Lines Matching defs:start
83 int start; /* Start of this sub-table (entry in "bddnodes") */
113 #define NODEHASH(var,l,h) ((PAIR((l),(h))%levels[var].size)+levels[var].start)
177 printf("Win2 start: %d nodes\n", reorder_nodenum());
219 printf("Win2ite start: %d nodes\n", reorder_nodenum());
402 printf("Win3 start: %d nodes\n", reorder_nodenum());
433 printf("Win3ite start: %d nodes\n", reorder_nodenum());
964 levels[n].start = n * levels[n].maxsize;
968 levels[n].start = n * levels[n].maxsize;
976 printf("L%3d: start %d, size %d, nodes %d\n", n, levels[n].start,
1121 int vl0 = levels[var0].start;
1237 int vl1 = levels[var1].start;
1339 int vl1 = levels[var1].start;
1423 r = bddnodes[n+levels[v].start].hash;
1652 levels[n].start = -1;
1769 SHORT {* start dynamic reordering *}