void JSONObject::write(std::ostream& str, WriteVisitor& visitor)
{
OrderList defaultOrder;
defaultOrder.push_back("UniqueID");
defaultOrder.push_back("Name");
defaultOrder.push_back("TargetName");
writeOrder(str, defaultOrder, visitor);
}
void JSONNode::write(std::ostream& str, WriteVisitor& visitor)
{
std::vector<std::string> order;
order.push_back("UniqueID");
order.push_back("Name");
order.push_back("TargetName");
order.push_back("Matrix");
order.push_back("UpdateCallbacks");
order.push_back("StateSet");
writeOrder(str, order, visitor);
}
int main(int argc, char** argv) {
unsigned int i;
Biddy_Boolean complete;
Biddy_Edge tmp;
Biddy_Edge r1,r2;
unsigned int n1,n2;
char *userinput;
#ifdef USA_YES
unsigned int usaSize = 0;
unsigned int **usaEdge;
unsigned int *usaOrder;
char *usaCodes;
Biddy_Edge *usaState;
Biddy_Edge *usaGraph;
#endif
#ifdef EUROPE_YES
unsigned int europeSize = 0;
unsigned int **europeEdge;
unsigned int *europeOrder;
char *europeCodes;
Biddy_Edge *europeState;
Biddy_Edge *europeGraph;
#endif
setbuf(stdout, NULL);
#ifdef USA_YES
setDataUSA(&usaSize,&usaEdge,&usaOrder,&usaCodes);
#endif
#ifdef EUROPE_YES
setDataEurope(&europeSize,&europeEdge,&europeOrder,&europeCodes);
#endif
#ifdef USE_BIDDY
/* There is only one unique table in Biddy */
/* There are three caches in Biddy */
/* Unique table grows over the time */
/* The max number of variables is hardcoded in biddyInt. h */
/* biddyVariableTable.usaSize = BIDDYVARMAX = 2048 */
/* The following constants are hardcoded in biddyMain.c */
/* biddyIteCache.usaSize = MEDIUM_TABLE = 262143 */
/* biddyEACache.usaSize = SMALL_TABLE = 65535 */
/* biddyRCCache.usaSize = SMALL_TABLE = 65535 */
/* DEFAULT INIT CALL: Biddy_Init() */
Biddy_Init();
#endif
#ifdef USE_CUDD
/* In CUDD each variable has its own subtable in the unique table */
/* There is only one cache in CUDD */
/* Subtables grow over the time, you can set limit for fast unique table growth */
/* Cudd_SetLooseUpTo(manager,1048576) */
/* Cache can grow over the time, you can set the max usaSize */
/* Cudd_SetMaxCacheHard(manager,262144) */
/* These two constants are hardcoded in v3.0.0 */
/* CUDD_UNIQUE_SLOTS = 256 (default initial usaSize of each subtable) */
/* CUDD_CACHE_SLOTS = 262144 (default initial usaSize of cache table) */
/* DEFAULT INIT CALL: Cudd_Init(0,0,CUDD_UNIQUE_SLOTS,CUDD_CACHE_SLOTS,0) */
manager = Cudd_Init(0,0,CUDD_UNIQUE_SLOTS,CUDD_CACHE_SLOTS,0);
Cudd_SetMaxCacheHard(manager,262144);
#endif
#ifdef USA_YES
usaGraph = (Biddy_Edge *) malloc(usaSize*sizeof(Biddy_Edge *));
usaState = (Biddy_Edge *) malloc(usaSize*sizeof(Biddy_Edge *));
#endif
#ifdef EUROPE_YES
europeGraph = (Biddy_Edge *) malloc(europeSize*sizeof(Biddy_Edge *));
europeState = (Biddy_Edge *) malloc(europeSize*sizeof(Biddy_Edge *));
#endif
i = 0;
complete = FALSE;
while (!complete) {
complete = TRUE;
tmp = Biddy_AddVariable();
#ifdef USA_YES
if (i < usaSize) {
usaState[usaOrder[i]] = tmp;
}
complete = complete && (i >= (usaSize-1));
#endif
#ifdef EUROPE_YES
if (i < europeSize) {
europeState[europeOrder[i]] = tmp;
}
complete = complete && (i >= (europeSize-1));
#endif
i++;
}
#ifdef USA_YES
createGraph(usaSize,usaEdge,usaState,usaGraph);
#endif
#ifdef EUROPE_YES
createGraph(europeSize,europeEdge,europeState,europeGraph);
#endif
#ifdef USE_BIDDY
Biddy_Clean();
#endif
r1 = Biddy_GetConstantZero();
r2 = Biddy_GetConstantZero();
#ifdef USE_CUDD
Cudd_Ref(r1);
Cudd_Ref(r2);
#endif
#ifdef USA_YES
if (!CALCULATE_KERNELS) {
/* CALCULATING INDEPENDENCE SETS FOR USA */
#ifdef USE_CUDD
Cudd_RecursiveDeref(manager,r1);
#endif
r1 = calculateIndependence(usaSize,usaState,usaGraph);
} else {
/* CALCULATING KERNELS (MAXIMUM INDEPENDENCE SETS) FOR USA */
#ifdef USE_CUDD
Cudd_RecursiveDeref(manager,r1);
#endif
r1 = calculateKernels(usaSize,usaState,usaGraph);
}
#ifdef USE_BIDDY
Biddy_AddPersistentFormula((Biddy_String)"usa",r1);
Biddy_Clean();
#endif
#ifdef USE_CUDD
for (i=0; i<usaSize; i++) {
Cudd_RecursiveDeref(manager,usaGraph[i]);
}
#endif
#endif
#ifdef EUROPE_YES
if (!CALCULATE_KERNELS) {
/* CALCULATING INDEPENDENCE SETS FOR EUROPE */
#ifdef USE_CUDD
Cudd_RecursiveDeref(manager,r2);
#endif
r2 = calculateIndependence(europeSize,europeState,europeGraph);
} else {
/* CALCULATING KERNELS (MAXIMUM INDEPENDENCE SETS) FOR EUROPE */
#ifdef USE_CUDD
Cudd_RecursiveDeref(manager,r2);
#endif
r2 = calculateKernels(europeSize,europeState,europeGraph);
}
#ifdef USE_BIDDY
Biddy_AddPersistentFormula((Biddy_String)"europe",r2);
Biddy_Clean();
#endif
#ifdef USE_CUDD
for (i=0; i<europeSize; i++) {
Cudd_RecursiveDeref(manager,europeGraph[i]);
}
#endif
#endif
userinput = strdup("...");
while (userinput[0] != 'x') {
/* We have problems with passing stdout in the case you compile this file */
/* with MINGW and use biddy.dll generated with Visual Studio. */
/* In such cases, please, use Biddy_PrintInfo(NULL) */
if (userinput[0] == 'r') Biddy_PrintInfo(stdout);
/* SIFTING */
#ifdef USE_BIDDY
#ifdef CONVERGE
if (userinput[0] == 's') Biddy_PurgeAndReorder(NULL,TRUE);
#ifdef USA_YES
if (userinput[0] == 'u') Biddy_PurgeAndReorder(r1,TRUE);
#endif
#ifdef EUROPE_YES
if (userinput[0] == 'e') Biddy_PurgeAndReorder(r2,TRUE);
#endif
#else
if (userinput[0] == 's') Biddy_PurgeAndReorder(NULL,FALSE);
#ifdef USA_YES
if (userinput[0] == 'u') Biddy_PurgeAndReorder(r1,FALSE);
#endif
#ifdef EUROPE_YES
if (userinput[0] == 'e') Biddy_PurgeAndReorder(r2,FALSE);
#endif
#endif
#endif
#ifdef USE_CUDD
#ifdef CONVERGE
if (userinput[0] == 's') Cudd_ReduceHeap(manager,CUDD_REORDER_SIFT_CONVERGE,0);
#else
if (userinput[0] == 's') Cudd_ReduceHeap(manager,CUDD_REORDER_SIFT,0);
#endif
#endif
n1 = Biddy_VariableNumber(r1);
n2 = Biddy_VariableNumber(r2);
if ((userinput[0] == 's')
#ifdef USA_YES
|| (userinput[0] == 'u')
#endif
#ifdef EUROPE_YES
|| (userinput[0] == 'e')
#endif
) {
#ifdef CONVERGE
printf("(CONVERGING SIFTING");
#ifdef USE_BIDDY
if (userinput[0] == 'u') {
printf(" ON FUNCTION FOR USA");
}
if (userinput[0] == 'e') {
printf(" ON FUNCTION FOR EUROPE");
}
#endif
printf(") ");
#else
printf("(SIFTING");
#ifdef USE_BIDDY
if (userinput[0] == 'u') {
printf(" ON FUNCTION FOR USA");
}
if (userinput[0] == 'e') {
printf(" ON FUNCTION FOR EUROPE");
}
#endif
printf(") ");
#endif
}
printf("Resulting function r1/r2 depends on %u/%u variables.\n",n1,n2);
printf("Resulting function r1/r2 has %.0f/%.0f minterms.\n",Biddy_CountMinterm(r1,n1),Biddy_CountMinterm(r2,n2));
#ifdef USE_BIDDY
printf("BDD for resulting function r1/r2 has %u/%u nodes (%u/%u nodes if using complement edges).\n",
Biddy_NodeNumberPlain(r1),Biddy_NodeNumberPlain(r2),Biddy_NodeNumber(r1),Biddy_NodeNumber(r2));
#endif
#ifdef USE_CUDD
printf("BDD for resulting function r1/r2 has %u/%u nodes (using complement edges).\n",Biddy_NodeNumber(r1),Biddy_NodeNumber(r2));
#endif
#ifdef USE_BIDDY
printf("Variable swaps performed so far: %u\n",Biddy_NodeTableSwapNumber());
#endif
#ifdef USE_CUDD
printf("Variable swaps performed so far: %.0f\n",Cudd_ReadSwapSteps(manager));
#endif
#ifdef USA_YES
printf("Order for USA: ");
writeOrder(r1,usaCodes,usaOrder,usaSize);
#endif
#ifdef EUROPE_YES
printf("Order for Europe: ");
writeOrder(r2,europeCodes,europeOrder,europeSize);
#endif
#ifdef USE_BIDDY
printf("E[x]it or [r]eport or ");
#ifdef CONVERGE
printf("Converging sifting ");
#else
printf("Sifting ");
#endif
#if (defined USA_YES) || (defined EUROPE_YES)
printf("on [s]ystem or Sifting on function for");
#ifdef USA_YES
printf(" [u]SA");
#endif
#ifdef EUROPE_YES
printf(" [e]urope");
#endif
#endif
printf(": ");
if (!scanf("%s",userinput)) printf("ERROR\n");
#endif
#ifdef USE_CUDD
printf("E[x]it or [r]eport or ");
#ifdef CONVERGE
printf("Converging sifting ");
#else
printf("Sifting ");
#endif
printf("on [s]ystem: ");
if (!scanf("%s",userinput)) printf("ERROR\n");
#endif
}
free(userinput);
/* EXIT */
#ifdef USE_BIDDY
Biddy_Exit();
#endif
#ifdef USE_CUDD
Cudd_RecursiveDeref(manager,r1);
Cudd_RecursiveDeref(manager,r2);
printf("CUDD: nodes with non-zero reference counts: %d\n",Cudd_CheckZeroRef(manager));
Cudd_Quit(manager);
#endif
return 0;
}
