/*
** Copyright (C) 1995,2003-2004 Peter Schachte and The University of Melbourne.
** This file may only be copied under the terms of the GNU Library General
** Public License - see the file COPYING.LIB in the Mercury distribution.
*/

/*****************************************************************
  File     : test_vars.c
  Author   : Peter Schachte
  Origin   : Tue Jul 18 20:13:51 1995
  Purpose  : Timing test for bryant graph MR_ROBDD_vars_entailed function

*****************************************************************/

#include <stdio.h>
#include <stdlib.h>
#include "bryant.h"
#include "timing.h"


#define VARLIMIT 1024

int opcount;

void usage(char *progname)
    {
	printf("usage:  %s size maxvar [repetitions]\n", progname);
	printf("  creates all possible v <-> v1 & v2 & ... & vsize functions and conjoins this\n");
	printf("  with each variable between 0 and maxvar, and then determines the set of\n");
	printf("  variables MR_ROBDD_entailed by this function.  V and the vi are between 0 and maxvar\n");
	printf("  inclusive.  If repetitions is >0, this will be done that many times.\n");
    }


void init_array(int top, int v0, int array[])
    {
	int i, val;

	for (i=0, val=0; i<top; ++i, ++val) {
	    if (val==v0) ++val;
	    array[i] = val;
	}
    }



int next_array(int n, int varmax, int v0, int array[])
    {
	int i;
	int limit;
	int val;

	/* Search backward for first cell with "room" to be
	 * incremented.  This is complicated by the need to avoid
	 * using the value v0.
	 */
	for (i=n-1, limit=varmax-1;; --i, --limit) {
	    if (i<0) return 0;	/* no more combinations possible */
	    if (limit==v0) --limit;
	    if (++array[i]==v0) ++array[i];
	    if (array[i]<=limit) break;
	}
	/* Now we've incremented array[i], and must set
	 * array[i+1..n-1] to successive values (avoiding v0).
	 */
	for (val=array[i]+1, ++i; i<n; ++i, ++val) {
	    if (val==v0) ++val;
	    array[i] = val;
	}
	return 1;
    }


void doit(int top, MR_ROBDD_type *f)
    {
	MR_ROBDD_bitset *set;
#ifdef DEBUGALL
	int var;
	MR_ROBDD_bitmask mask;
	int word;

	printf("MR_ROBDD_vars_entailed(");
	printOut(f),
	printf("[, %d]) =", top);
	fflush(stdout);
#endif /* DEBUGALL */
#ifndef OVERHEAD
#ifndef MR_ROBDD_NEW
	set = MR_ROBDD_vars_entailed(f, top);
#else /* !MR_ROBDD_NAIVE */
	set = MR_ROBDD_vars_entailed(f);
#endif /* MR_ROBDD_OLD */
#ifdef DEBUGALL
	MR_ROBDD_FOREACH_ELEMENT(*set,var,word,mask) {
	    printf(" %d", var);
	}
	printf("\n");
#endif /* DEBUGALL */
#endif /* !OVERHEAD */
	++opcount;
    }


void dont_doit(int top, MR_ROBDD_type *f)
    {
    }


void inner_loop(int varmax, MR_ROBDD_type *f)
    {
	MR_ROBDD_type *g;
	int v;

	for (v=0; v<varmax; ++v) {
	    g = MR_ROBDD_glb(MR_ROBDD_variableRep(v), f);
	    doit(varmax, g);
	}
    }


void dont_inner_loop(int varmax, MR_ROBDD_type *f)
    {
	MR_ROBDD_type *g;
	int v;

	for (v=0; v<varmax; ++v) {
	    g = MR_ROBDD_glb(MR_ROBDD_variableRep(v), f);
	    dont_doit(varmax, g);
	}
    }


int main(int argc, char **argv)
    {
	int varmax, size, repetitions;
	int array[VARLIMIT];
	int reps, v0;
	MR_ROBDD_type *f;
	millisec clock0, clock1, clock2, clock3;
	float runtime, overhead, rate;
	int test_nodes, overhead_nodes;

	if (argc < 3) {
	    usage(argv[0]);
	    return 20;
	}
	if ((varmax=atoi(argv[2]))<1 || varmax>=VARLIMIT) {
	    usage(argv[0]);
	    printf("\n  varmax must be between 1 <= varmax < %d\n", VARLIMIT);
	    return 20;
	}
	if ((size=atoi(argv[1]))<0 || size>=varmax) {
	    usage(argv[0]);
	    printf("\n  size must be between 0 <= size < varmax\n");
	    return 20;
	}
	repetitions=(argc>3 ? atoi(argv[3]) : 1);
	if (repetitions <= 0) repetitions = 1;

	opcount = 0;
	clock0 = milli_time();
	for (reps=repetitions; reps>0; --reps) {
	    for (v0=0; v0<varmax; ++v0) {
		init_array(size, v0, array);
		f = MR_ROBDD_testing_iff_conj_array(v0, size, array);
		inner_loop(varmax, f);
		while (next_array(size, varmax, v0, array)) {
		    f = MR_ROBDD_testing_iff_conj_array(v0, size, array);
		    inner_loop(varmax, f);
		}
	    }
	}
	clock1 = milli_time();
	test_nodes = MR_ROBDD_nodes_in_use();
	MR_ROBDD_initRep();
	clock2 = milli_time();
	for (reps=repetitions; reps>0; --reps) {
	    for (v0=0; v0<varmax; ++v0) {
		init_array(size, v0, array);
		f = MR_ROBDD_testing_iff_conj_array(v0, size, array);
		dont_inner_loop(varmax, f);
		while (next_array(size, varmax, v0, array)) {
		    f = MR_ROBDD_testing_iff_conj_array(v0, size, array);
		    dont_inner_loop(varmax, f);
		}
	    }
	}
	clock3 = milli_time();
	overhead_nodes = MR_ROBDD_nodes_in_use();
	runtime = (float)(clock1-clock0)/1000;
	overhead = (float)(clock3-clock2)/1000;
	rate = ((float)opcount)/(runtime-overhead);
	printf("%s %d %d %d:  %.3f - %.3f = %.3f secs, %d ops, %d nodes, %.1f ops/sec\n",
	       argv[0], size, varmax, repetitions,
	       runtime, overhead, (runtime-overhead), opcount,
	       test_nodes-overhead_nodes, rate);
	return 0;
    }