/*
 * Module: signature.c
 * Purpose: The main signature algorithm
 * Routines;
 * pcover signature():
 *	Entry point for the signature cubes algorithm.
 * pcover generate_primes():
 *	Generates the set of primes corresponding to
 *	the Essential Signature Cubes
 */

#include <stdio.h>
#include <math.h>
#include "espresso.h"
#include "signature.h"

static long start_time; /* yuk */

pcover
signature(pset_family F1, pset_family D1, pset_family R1)
{
  pcover ESC,ESSet,ESSENTIAL;
  pcover F,D,R;
  pcube last,p;

  /* make scratch copy */
  F = sf_save(F1);
  D = sf_save(D1);
  R = sf_save(R1);

  /* unwrap offset */
  R = unravel(R, cube.num_binary_vars);
  R = sf_contain(R);

  start_time = ptime();

  /* Initial expand and irredundant */
  foreach_set(F, last, p) {
    RESET(p, PRIME);
  }

  S_EXECUTE(F = expand(F, R, FALSE), ESSEN_TIME);
  S_EXECUTE(F = irredundant(F, D), ESSEN_TIME);
  S_EXECUTE(ESSENTIAL = essential(&F,&D), ESSEN_TIME);

  S_EXECUTE(ESC = find_canonical_cover(F,D,R), FCC_TIME);
  /**************************************************
  printf("ESCubes %d\n", ESC->count + ESSENTIAL->count);
  fflush(stdout);
  **************************************************/

  S_EXECUTE(ESSet = generate_primes(ESC,R), PRIMES_TIME);
  /**************************************************
  printf("ESSet %d\n",ESSet->count + ESSENTIAL->count);
  fflush(stdout);
  **************************************************/

  S_EXECUTE(F = signature_minimize_exact(ESC,ESSet), MINCOV_TIME);
  sf_append(F,ESSENTIAL);
  /**************************************************
  printf("Exact_Minimum %d\n",F->count);
  print_cover(F,"Exact Minimum");
  **************************************************/

  if (! skip_make_sparse && R != 0) {
    F = make_sparse(F, D1, R);
  }

  free_cover(D);
  free_cover(R);
  free_cover(ESC);
  free_cover(ESSet);
  return F;
}


pcover
generate_primes(pset_family F, pset_family R)
{
  pcube c,r,lastc,b,lastb;
  pcover BB,PRIMES;
  pcube odd,even,out_part_r;
  register int i;
      register int w, last;
  register unsigned int x;
  int count;

  out_part_r = new_cube();
  odd = new_cube();
  even = new_cube();

  count = 0;
  PRIMES = new_cover(F->count);
  foreach_set(F,lastc,c){
    BB = new_cover(R->count);
    BB->count = R->count;
    /* BB = get_blocking_matrix(R,c); */
    foreachi_set(R,i,r){
      b = GETSET(BB,i);
      if ((last = cube.inword) != -1) {
        /* Check the partial word of binary variables */
        x = r[last] & c[last];
        x = ~(x | x >> 1) & cube.inmask;
        b[last] = r[last] & (x | x << 1);
        /* Check the full words of binary variables */
        for(w = 1; w < last; w++) {
              x = r[w] & c[w];
              x = ~(x | x >> 1) & DISJOINT;
          b[w] = r[w] & (x | x << 1);
        }
          }
      PUTLOOP(b,LOOP(r));
      INLINEset_and(b,b,cube.binary_mask);
      INLINEset_and(out_part_r,cube.mv_mask,r);
      if(!setp_implies(out_part_r,c)){
        INLINEset_or(b,b,out_part_r);
      }
    }
    BB = unate_compl(BB);
    if(BB != NULL){
      foreach_set(BB,lastb,b){
        set_not(b);
      }
      sf_append(PRIMES,BB);
    }
    count++;
    if(count % 100 == 0){
      PRIMES = sf_contain(PRIMES);
    }
  }
  PRIMES = sf_contain(PRIMES);
  free_cube(out_part_r);
  free_cube(odd);
  free_cube(even);
  return PRIMES;
}

void
cleanup(void)
{
  s_runtime(ptime() - start_time);
  printf("CPU Limit Exceeded\n");
  exit(1);
}
