| blob | 9553951ebe3d2fa3d8ac066695f26f5979daa279 |
1 <html>
3 <body>
6 <HR>
7 <DL>
8 <dt><pre>
10 static unsigned int <I></I>
12 unsigned int * <b>pathLengthArray</b>, <i>array determining number of nodes belonging to the different path lengths</i>
17 )
18 </pre>
19 <dd> Chooses the maximum allowable path length under each node.
20 The corner cases are when the threshold is larger than the number
21 of nodes in the BDD iself, in which case 'numVars + 1' is returned.
22 If all nodes of a particular path length are needed, then the
23 maxpath returned is the next one with excess nodes = 0;
24 <p>
27 <p>
29 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
31 <dt><pre>
33 static int <I></I>
40 )
41 </pre>
42 <dd> Finds don't care nodes by traversing f and b in parallel.
43 Returns the care status of the visited f node if successful; CARE_ERROR
44 otherwise.
45 <p>
48 <p>
51 </code>
53 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
55 <dt><pre>
57 static int <I></I>
65 )
66 </pre>
68 otherwise.
69 <p>
72 <p>
75 </code>
77 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
79 <dt><pre>
81 static Conjuncts * <I></I>
91 )
92 </pre>
93 <dd> Builds the conjuncts recursively, bottom up. Constants
94 are returned as (f, f). The cache is checked for previously computed
95 result. The decomposition points are determined by the local
96 reference count of this node and the longest distance from the
97 constant. At the decomposition point, the factors returned are (f,
98 1). Recur on the two children. The order is determined by the
99 heavier branch. Combine the factors of the two children and pick the
100 one that already occurs in the gh table. Occurence in g is indicated
102 <p>
105 </code>
107 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
109 <dt><pre>
111 static DdNode * <I></I>
118 )
119 </pre>
120 <dd> Builds the BDD with nodes labeled with path length
121 under maxpath and as many nodes labeled maxpath as determined by the
122 threshold. The procedure uses the path table to determine which nodes
123 in the original bdd need to be retained. This procedure picks a
124 shortest path (tie break decided by taking the child with the shortest
125 distance to the constant) and recurs down the path till it reaches the
126 constant. the procedure then starts building the subset upward from
127 the constant. All nodes labeled by path lengths less than the given
128 maxpath are used to build the subset. However, in the case of nodes
129 that have label equal to maxpath, as many are chosen as required by
130 the threshold. This number is stored in the info structure in the
131 field thresholdReached. This field is decremented whenever a node
132 labeled maxpath is encountered and the nodes labeled maxpath are
133 aggregated in a maxpath table. As soon as the thresholdReached count
134 goes to 0, the shortest path from this node to the constant is found.
135 The extraction of nodes with the above labeling is based on the fact
136 that each node, labeled with a path length, P, has at least one child
137 labeled P or less. So extracting all nodes labeled a given path length
138 P ensures complete paths between the root and the constant. Extraction
139 of a partial number of nodes with a given path length may result in
140 incomplete paths and hence the additional number of nodes are grabbed
141 to complete the path. Since the Bdd is built bottom-up, other nodes
142 labeled maxpath do lie on complete paths. The procedure may cause the
143 subset to have a larger or smaller number of nodes than the specified
144 threshold. The increase in the number of nodes is caused by the
145 building of a subset and the reduction by recombination. However in
146 most cases, the recombination overshadows the increase and the
147 procedure returns a result with lower number of nodes than specified.
148 The subsetNodeTable is NIL when there is no hard limit on the number
149 of nodes. Further efforts towards keeping the subset closer to the
150 threshold number were abandoned in favour of keeping the procedure
151 simple and fast.
152 <p>
155 <p>
157 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
159 <dt><pre>
161 static DdNode * <I></I>
170 )
171 </pre>
172 <dd> The procedure carries out the building of the subset BDD
173 starting at the root. Using the three different counts labelling each node,
174 the procedure chooses the heavier branch starting from the root and keeps
175 track of the number of nodes it discards at each step, thus keeping count
176 of the size of the subset BDD dynamically. Once the threshold is satisfied,
177 the procedure then calls ITE to build the BDD.
178 <p>
181 <p>
183 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
185 <dt><pre>
187 static Conjuncts * <I></I>
197 )
198 </pre>
199 <dd> Check if the two pairs exist in the table. If any of
200 the conjuncts do exist, store in the cache and return the
201 corresponding pair.
202 <p>
206 </code>
208 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
210 <dt><pre>
212 static Conjuncts * <I></I>
219 )
220 </pre>
221 <dd> Check the tables for the existence of pair and return
222 one combination, cache the result. The assumption is that one of the
223 conjuncts is already in the tables.
224 <p>
227 <p>
230 </code>
232 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
234 <dt><pre>
236 static void <I></I>
240 )
241 </pre>
242 <dd> Free factors structure
243 <p>
246 <p>
248 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
250 <dt><pre>
252 static enum st_retval <I></I>
257 )
258 </pre>
259 <dd> Frees memory associated with hash table. Returns
260 ST_CONTINUE.
261 <p>
264 <p>
266 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddCorr.c"TARGET="ABSTRACT"><CODE>cuddBddCorr.c</CODE></A>
268 <dt><pre>
270 static int <I></I>
274 )
275 </pre>
277 identical; 1 otherwise.
278 <p>
281 <p>
283 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddCorr.c"TARGET="ABSTRACT"><CODE>cuddBddCorr.c</CODE></A>
285 <dt><pre>
287 static int <I></I>
291 )
292 </pre>
293 <dd> Hashes a hash table entry. It is patterned after
294 st_strhash. Returns a value between 0 and modulus.
295 <p>
298 <p>
300 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddCorr.c"TARGET="ABSTRACT"><CODE>cuddBddCorr.c</CODE></A>
302 <dt><pre>
304 static double <I></I>
310 )
311 </pre>
312 <dd> Count the number of minterms of each node ina a BDD and
313 store it in a hash table.
314 <p>
317 <p>
319 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
321 <dt><pre>
323 static NodeStat * <I></I>
327 )
328 </pre>
329 <dd> Get longest distance of node from constant. Returns the
330 distance of the root from the constant if successful; CUDD_OUT_OF_MEM
331 otherwise.
332 <p>
335 <p>
337 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
339 <dt><pre>
341 static int <I></I>
345 unsigned int * <b>pathLengthArray</b>, <i>array that stores number of nodes belonging to a particular path length.</i>
347 )
348 </pre>
349 <dd> Labels each node with the shortest distance from the constant.
350 This is done in a DFS search of the BDD. Each node has an odd
351 and even parity distance from the sink (since there exists paths to both
352 zero and one) which is less than MAXSHORTINT. At each node these distances
353 are updated using the minimum distance of its children from the constant.
354 SInce now both the length from the root and child is known, the minimum path
355 length(length of the shortest path between the root and the constant that
356 this node lies on) of this node can be calculated and used to update the
357 pathLengthArray
358 <p>
361 <p>
366 </code>
368 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
370 <dt><pre>
372 static st_table * <I></I>
375 unsigned int * <b>pathLengthArray</b>, <i>array of path lengths to store nodes labeled with the various path lengths</i>
377 )
378 </pre>
379 <dd> The outer procedure to label each node with its shortest
380 distance from the root and constant. Calls CreateTopDist and CreateBotDist.
381 The basis for computing the distance between root and constant is that
382 the distance may be the sum of even distances from the node to the root
383 and constant or the sum of odd distances from the node to the root and
384 constant. Both CreateTopDist and CreateBotDist create the odd and
385 even parity distances from the root and constant respectively.
386 <p>
389 <p>
393 </code>
395 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
397 <dt><pre>
399 static void <I></I>
402 int <b>parentPage</b>, <i>the pointer to the page on which the first parent in the queue is to be found.</i>
409 )
410 </pre>
411 <dd> Labels each node with its shortest distance from the root.
412 This is done in a BFS search of the BDD. The nodes are processed
413 in a queue implemented as pages(array) to reduce memory fragmentation.
414 An entry is created for each node visited. The distance from the root
415 to the node with the corresponding parity is updated. The procedure
416 is called recursively each recusion level handling nodes at a given
417 level from the root.
418 <p>
421 <p>
425 </code>
427 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
429 <dt><pre>
431 int <I></I>
436 )
437 </pre>
438 <dd> Adds a function to a hook. A hook is a list of
439 application-provided functions called on certain occasions by the
441 function was already in the list; 0 otherwise.
442 <p>
445 <p>
448 </code>
450 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
452 <dt><pre>
454 DdApaDigit <I></I>
460 )
461 </pre>
462 <dd> Adds two arbitrary precision integers. Returns the
463 carry out of the most significant digit.
464 <p>
467 <p>
469 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
471 <dt><pre>
473 int <I></I>
481 )
482 </pre>
483 <dd> Compares the ratios of two arbitrary precision integers
485 they are equal; -1 if the second number is larger.
486 <p>
489 <p>
491 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
493 <dt><pre>
495 int <I></I>
501 )
502 </pre>
505 number is larger.
506 <p>
509 <p>
511 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
513 <dt><pre>
515 void <I></I>
520 )
521 </pre>
522 <dd> Makes a copy of an arbitrary precision integer.
523 <p>
526 <p>
528 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
530 <dt><pre>
532 DdApaNumber <I></I>
538 )
539 </pre>
540 <dd> Counts the number of minterms of a DD. The function is
541 assumed to depend on nvars variables. The minterm count is
542 represented as an arbitrary precision unsigned integer, to allow for
543 any number of variables CUDD supports. Returns a pointer to the
544 array representing the number of minterms of the function rooted at
545 node if successful; NULL otherwise.
546 <p>
550 <p>
553 </code>
555 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
557 <dt><pre>
559 unsigned int <I></I>
565 )
566 </pre>
568 unsigned integer. Returns the remainder of the division. This
569 procedure relies on the assumption that the number of bits of a
570 DdApaDigit plus the number of bits of an unsigned int is less the
571 number of bits of the mantissa of a double. This guarantees that the
572 product of a DdApaDigit and an unsigned int can be represented
573 without loss of precision by a double. On machines where this
574 assumption is not satisfied, this procedure will malfunction.
575 <p>
578 <p>
581 </code>
583 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
585 <dt><pre>
587 int <I></I>
590 )
591 </pre>
592 <dd> Finds the number of digits for an arbitrary precision
593 integer given the maximum number of binary digits. The number of
594 binary digits should be positive. Returns the number of digits if
595 successful; 0 otherwise.
596 <p>
599 <p>
601 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
603 <dt><pre>
605 void <I></I>
610 )
611 </pre>
612 <dd> Sets an arbitrary precision integer to a power of
613 two. If the power of two is too large to be represented, the number
614 is set to 0.
615 <p>
618 <p>
620 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
622 <dt><pre>
624 int <I></I>
629 )
630 </pre>
631 <dd> Prints an arbitrary precision integer in decimal format.
633 <p>
636 <p>
640 </code>
642 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
644 <dt><pre>
646 int <I></I>
652 )
653 </pre>
654 <dd> Prints the density of a BDD or ADD using
656 <p>
659 <p>
661 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
663 <dt><pre>
665 int <I></I>
671 )
672 </pre>
673 <dd> Prints an arbitrary precision integer in exponential format.
675 <p>
678 <p>
682 </code>
684 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
686 <dt><pre>
688 int <I></I>
693 )
694 </pre>
695 <dd> Prints an arbitrary precision integer in hexadecimal format.
697 <p>
700 <p>
704 </code>
706 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
708 <dt><pre>
710 int <I></I>
717 )
718 </pre>
719 <dd> Prints the number of minterms of a BDD or ADD in
720 exponential format using arbitrary precision arithmetic. Parameter
721 precision controls the number of signficant digits printed. Returns
723 <p>
726 <p>
729 </code>
731 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
733 <dt><pre>
735 int <I></I>
741 )
742 </pre>
743 <dd> Prints the number of minterms of a BDD or ADD using
745 <p>
748 <p>
751 </code>
753 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
755 <dt><pre>
757 void <I></I>
762 )
763 </pre>
764 <dd> Sets an arbitrary precision integer to a one-digit literal.
765 <p>
768 <p>
770 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
772 <dt><pre>
774 void <I></I>
780 )
781 </pre>
782 <dd> Shifts right an arbitrary precision integer by one
783 binary place. The most significant binary digit of the result is
785 <p>
788 <p>
790 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
792 <dt><pre>
794 DdApaDigit <I></I>
800 )
801 </pre>
802 <dd> Divides an arbitrary precision integer by a digit.
803 <p>
806 <p>
808 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
810 <dt><pre>
812 DdApaDigit <I></I>
818 )
819 </pre>
820 <dd> Subtracts two arbitrary precision integers. Returns the
821 borrow out of the most significant digit.
822 <p>
826 <p>
828 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
830 <dt><pre>
832 void <I></I>
835 )
836 </pre>
837 <dd> Disables automatic dynamic reordering of ZDDs.
838 <p>
841 <p>
846 </code>
848 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
850 <dt><pre>
852 void <I></I>
855 )
856 </pre>
857 <dd> Disables automatic dynamic reordering.
858 <p>
861 <p>
866 </code>
868 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
870 <dt><pre>
872 void <I></I>
876 )
877 </pre>
878 <dd> Enables automatic dynamic reordering of ZDDs. Parameter
879 method is used to determine the method used for reordering ZDDs. If
880 CUDD_REORDER_SAME is passed, the method is unchanged.
881 <p>
884 <p>
889 </code>
891 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
893 <dt><pre>
895 void <I></I>
899 )
900 </pre>
901 <dd> Enables automatic dynamic reordering of BDDs and
902 ADDs. Parameter method is used to determine the method used for
903 reordering. If CUDD_REORDER_SAME is passed, the method is
904 unchanged.
905 <p>
908 <p>
913 </code>
915 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
917 <dt><pre>
919 double <I></I>
922 )
923 </pre>
924 <dd> Computes the average distance between adjacent nodes in
925 the manager. Adjacent nodes are node pairs such that the second node
926 is the then child, else child, or next node in the collision list.
927 <p>
930 <p>
932 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
934 <dt><pre>
936 DdNode * <I></I>
940 )
941 </pre>
943 resulting ADD if successful; NULL otherwise.
944 <p>
947 <p>
953 </code>
955 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
957 <dt><pre>
959 int <I></I>
964 )
965 </pre>
966 <dd> Builds a positional array from the BDD of a cube.
967 Array must have one entry for each BDD variable. The positional
968 array has 1 in i-th position if the variable of index i appears in
969 true form in the cube; it has 0 in i-th position if the variable of
970 index i appears in complemented form in the cube; finally, it has 2
971 in i-th position if the variable of index i does not appear in the
973 otherwise.
974 <p>
977 <p>
980 </code>
982 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
984 <dt><pre>
986 DdNode * <I></I>
995 )
996 </pre>
997 <dd> Extracts a dense superset from a BDD. The procedure is
998 identical to the underapproximation procedure except for the fact that it
999 works on the complement of the given function. Extracting the subset
1000 of the complement function is equivalent to extracting the superset
1001 of the function.
1002 Returns a pointer to the BDD of the superset if successful. NULL if
1003 intermediate result causes the procedure to run out of memory. The
1004 parameter numVars is the maximum number of variables to be used in
1005 minterm calculation. The optimal number
1006 should be as close as possible to the size of the support of f.
1007 However, it is safe to pass the value returned by Cudd_ReadSize for
1008 numVars when the number of variables is under 1023. If numVars is
1010 the procedure will compute a value which will avoid overflow but
1011 will cause underflow with 2046 variables or more.
1012 <p>
1015 <p>
1022 </code>
1024 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
1026 <dt><pre>
1028 DdNode * <I></I>
1037 )
1038 </pre>
1039 <dd> Extracts a dense subset from a BDD. This procedure uses
1040 a biased remapping technique and density as the cost function. The bias
1041 is a function. This procedure tries to approximate where the bias is 0
1042 and preserve the given function where the bias is 1.
1043 Returns a pointer to the BDD of the subset if
1044 successful. NULL if the procedure runs out of memory. The parameter
1045 numVars is the maximum number of variables to be used in minterm
1046 calculation. The optimal number should be as close as possible to
1047 the size of the support of f. However, it is safe to pass the value
1048 returned by Cudd_ReadSize for numVars when the number of variables
1050 overflow. If a 0 parameter is passed then the procedure will compute
1051 a value which will avoid overflow but will cause underflow with 2046
1052 variables or more.
1053 <p>
1056 <p>
1063 </code>
1065 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
1067 <dt><pre>
1069 DdNode * <I></I>
1074 )
1075 </pre>
1076 <dd> Computes the compatible projection of relation R with
1077 respect to cube Y. Returns a pointer to the c-projection if
1078 successful; NULL otherwise. For a comparison between Cudd_CProjection
1079 and Cudd_PrioritySelect, see the documentation of the latter.
1080 <p>
1083 <p>
1086 </code>
1088 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
1090 <dt><pre>
1092 int <I></I>
1095 )
1096 </pre>
1097 <dd> Checks for the following conditions:
1098 <ul>
1099 <li>Wrong sizes of subtables.
1100 <li>Wrong number of keys found in unique subtable.
1101 <li>Wrong number of dead found in unique subtable.
1102 <li>Wrong number of keys found in the constant table
1103 <li>Wrong number of dead found in the constant table
1104 <li>Wrong number of total slots found
1105 <li>Wrong number of maximum keys found
1106 <li>Wrong number of total dead found
1107 </ul>
1108 Reports the average length of non-empty lists. Returns the number of
1109 subtables for which the number of keys is wrong.
1110 <p>
1113 <p>
1116 </code>
1118 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCheck.c"TARGET="ABSTRACT"><CODE>cuddCheck.c</CODE></A>
1120 <dt><pre>
1122 int <I></I>
1125 )
1126 </pre>
1127 <dd> Checks the unique table for nodes with non-zero
1128 reference counts. It is normally called before Cudd_Quit to make sure
1129 that there are no memory leaks due to missing Cudd_RecursiveDeref's.
1130 Takes into account that reference counts may saturate and that the
1131 basic constants and the projection functions are referenced by the
1132 manager. Returns the number of nodes with non-zero reference count.
1133 (Except for the cases mentioned above.)
1134 <p>
1137 <p>
1139 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
1141 <dt><pre>
1143 int <I></I>
1151 )
1152 </pre>
1153 <dd> Classifies the variables in the support of two DDs
1157 <p>
1160 returned as side effects.
1161 <p>
1165 </code>
1167 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1169 <dt><pre>
1171 void <I></I>
1174 )
1175 </pre>
1176 <dd> Clear the error code of a manager.
1177 <p>
1180 <p>
1183 </code>
1185 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
1187 <dt><pre>
1189 double * <I></I>
1193 )
1194 </pre>
1195 <dd> Computes the fraction of minterms in the on-set of all
1196 the positive cofactors of DD. Returns the pointer to an array of
1197 doubles if successful; NULL otherwise. The array has as many
1198 positions as there are BDD variables in the manager plus one. The
1199 last position of the array contains the fraction of the minterms in
1200 the ON-set of the function represented by the BDD or ADD. The other
1201 positions of the array hold the variable signatures.
1202 <p>
1205 <p>
1207 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSign.c"TARGET="ABSTRACT"><CODE>cuddSign.c</CODE></A>
1209 <dt><pre>
1211 DdNode * <I></I>
1216 )
1217 </pre>
1218 <dd> Computes the cofactor of f with respect to g; g must be
1219 the BDD or the ADD of a cube. Returns a pointer to the cofactor if
1220 successful; NULL otherwise.
1221 <p>
1224 <p>
1228 </code>
1230 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCof.c"TARGET="ABSTRACT"><CODE>cuddCof.c</CODE></A>
1232 <dt><pre>
1234 int <I></I>
1237 )
1238 </pre>
1239 <dd> Counts the number of leaves in a DD. Returns the number
1240 of leaves in the DD rooted at node if successful; CUDD_OUT_OF_MEM
1241 otherwise.
1242 <p>
1245 <p>
1248 </code>
1250 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1252 <dt><pre>
1254 double <I></I>
1259 )
1260 </pre>
1261 <dd> Counts the number of minterms of a DD. The function is
1262 assumed to depend on nvars variables. The minterm count is
1263 represented as a double, to allow for a larger number of variables.
1264 Returns the number of minterms of the function rooted at node if
1265 successful; (double) CUDD_OUT_OF_MEM otherwise.
1266 <p>
1269 <p>
1273 </code>
1275 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1277 <dt><pre>
1279 double <I></I>
1282 )
1283 </pre>
1284 <dd> Counts the number of paths to a non-zero terminal of a
1285 DD. The path count is
1286 represented as a double, to allow for a larger number of variables.
1287 Returns the number of paths of the function rooted at node.
1288 <p>
1291 <p>
1295 </code>
1297 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1299 <dt><pre>
1301 double <I></I>
1304 )
1305 </pre>
1306 <dd> Counts the number of paths of a DD. Paths to all
1307 terminal nodes are counted. The path count is represented as a
1308 double, to allow for a larger number of variables. Returns the
1309 number of paths of the function rooted at node if successful;
1310 (double) CUDD_OUT_OF_MEM otherwise.
1311 <p>
1314 <p>
1317 </code>
1319 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1321 <dt><pre>
1323 DdNode * <I></I>
1327 )
1328 </pre>
1329 <dd> Builds a cube from a positional array. The array must
1330 have one integer entry for each BDD variable. If the i-th entry is
1331 1, the variable of index i appears in true form in the cube; If the
1332 i-th entry is 0, the variable of index i appears complemented in the
1333 cube; otherwise the variable does not appear in the cube. Returns a
1334 pointer to the BDD for the cube if successful; NULL otherwise.
1335 <p>
1338 <p>
1343 </code>
1345 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1347 <dt><pre>
1349 int <I></I>
1352 )
1353 </pre>
1354 <dd> Counts the number of nodes in a DD. Returns the number
1355 of nodes in the graph rooted at node.
1356 <p>
1359 <p>
1363 </code>
1365 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1367 <dt><pre>
1369 int <I></I>
1372 )
1373 </pre>
1374 <dd> Tells whether dead nodes are counted towards triggering
1376 <p>
1379 <p>
1383 </code>
1385 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
1387 <dt><pre>
1389 int <I></I>
1392 )
1393 </pre>
1394 <dd> Checks for inconsistencies in the DD heap:
1395 <ul>
1396 <li> node has illegal index
1397 <li> live node has dead children
1398 <li> node has illegal Then or Else pointers
1399 <li> BDD/ADD node has identical children
1400 <li> ZDD node has zero then child
1401 <li> wrong number of total nodes
1402 <li> wrong number of dead nodes
1403 <li> ref count error at node
1404 </ul>
1405 Returns 0 if no inconsistencies are found; DD_OUT_OF_MEM if there is
1406 not enough memory; 1 otherwise.
1407 <p>
1410 <p>
1413 </code>
1415 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCheck.c"TARGET="ABSTRACT"><CODE>cuddCheck.c</CODE></A>
1417 <dt><pre>
1419 DdNode * <I></I>
1424 )
1425 </pre>
1426 <dd> Determines whether the function represented by BDD f is
1427 negative unate (monotonic decreasing) in variable i. Returns the
1428 constant one is f is unate and the (logical) constant zero if it is not.
1429 This function does not generate any new nodes.
1430 <p>
1433 <p>
1436 </code>
1438 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
1440 <dt><pre>
1442 void <I></I>
1446 )
1447 </pre>
1448 <dd> Enqueues node n for later dereferencing. If the queue
1449 is full decreases the reference count of the oldest node N to make
1450 room for n. If N dies, recursively decreases the reference counts of
1451 its children. It is used to dispose of a BDD that is currently not
1452 needed, but may be useful again in the near future. The dereferencing
1453 proper is done as in Cudd_IterDerefBdd.
1454 <p>
1457 <p>
1461 </code>
1463 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
1465 <dt><pre>
1467 double <I></I>
1472 )
1473 </pre>
1474 <dd> Computes the density of a BDD or ADD. The density is
1475 the ratio of the number of minterms to the number of nodes. If 0 is
1476 passed as number of variables, the number of variables existing in
1477 the manager is used. Returns the density if successful; (double)
1478 CUDD_OUT_OF_MEM otherwise.
1479 <p>
1482 <p>
1486 </code>
1488 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1490 <dt><pre>
1492 void <I></I>
1495 )
1496 </pre>
1497 <dd> Decreases the reference count of node. It is primarily
1498 used in recursive procedures to decrease the ref count of a result
1499 node before returning it. This accomplishes the goal of removing the
1500 protection applied by a previous Cudd_Ref.
1501 <p>
1504 <p>
1509 </code>
1511 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
1513 <dt><pre>
1515 void <I></I>
1518 )
1519 </pre>
1520 <dd> Disables garbage collection. Garbage collection is
1521 initially enabled. This function may be called to disable it.
1522 However, garbage collection will still occur when a new node must be
1523 created and no memory is left, or when garbage collection is required
1524 for correctness. (E.g., before reordering.)
1525 <p>
1528 <p>
1530 <dd> <b>See Also</b> <code><a href="#Cudd_EnableGarbageCollection">Cudd_EnableGarbageCollection</a>
1532 </code>
1534 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
1536 <dt><pre>
1538 int <I></I>
1541 )
1542 </pre>
1543 <dd> Disables reporting of reordering stats.
1545 <p>
1548 hooks.
1549 <p>
1551 <dd> <b>See Also</b> <code><a href="#Cudd_EnableReorderingReporting">Cudd_EnableReorderingReporting</a>
1553 </code>
1555 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
1557 <dt><pre>
1559 DdNode * <I></I>
1566 )
1567 </pre>
1568 <dd> This function generates a BDD for the function x -y != c.
1571 The BDD is built bottom-up.
1572 It has a linear number of nodes if the variables are ordered as follows:
1574 <p>
1577 <p>
1580 </code>
1582 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
1584 <dt><pre>
1586 int <I></I>
1595 )
1596 </pre>
1597 <dd> Writes a blif body representing the argument BDDs as a
1598 network of multiplexers. No header (.model, .inputs, and .outputs) and
1599 footer (.end) are produced by this function. One multiplexer is written
1601 out-of-memory, file system full, or an ADD with constants different
1603 caller responsibility. Cudd_DumpBlifBody uses a minimal unique subset of
1604 the hexadecimal address of a node as name for it. If the argument
1605 inames is non-null, it is assumed to hold the pointers to the names
1606 of the inputs. Similarly for onames. This function prints out only
1607 .names part.
1608 <p>
1611 <p>
1619 </code>
1621 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
1623 <dt><pre>
1625 int <I></I>
1635 )
1636 </pre>
1637 <dd> Writes a blif file representing the argument BDDs as a
1638 network of multiplexers. One multiplexer is written for each BDD
1640 out-of-memory, file system full, or an ADD with constants different
1642 caller responsibility. Cudd_DumpBlif uses a minimal unique subset of
1643 the hexadecimal address of a node as name for it. If the argument
1644 inames is non-null, it is assumed to hold the pointers to the names
1645 of the inputs. Similarly for onames.
1646 <p>
1649 <p>
1657 </code>
1659 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
1661 <dt><pre>
1663 int <I></I>
1671 )
1672 </pre>
1673 <dd> Writes a DDcal file representing the argument BDDs.
1675 file system full). Cudd_DumpDDcal does not close the file: This
1676 is the caller responsibility. Cudd_DumpDDcal uses a minimal unique
1677 subset of the hexadecimal address of a node as name for it. If the
1678 argument inames is non-null, it is assumed to hold the pointers to
1679 the names of the inputs. Similarly for onames.
1680 <p>
1683 <p>
1690 </code>
1692 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
1694 <dt><pre>
1696 int <I></I>
1704 )
1705 </pre>
1706 <dd> Writes a daVinci file representing the argument BDDs.
1708 file system full). Cudd_DumpDaVinci does not close the file: This
1709 is the caller responsibility. Cudd_DumpDaVinci uses a minimal unique
1710 subset of the hexadecimal address of a node as name for it. If the
1711 argument inames is non-null, it is assumed to hold the pointers to
1712 the names of the inputs. Similarly for onames.
1713 <p>
1716 <p>
1723 </code>
1725 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
1727 <dt><pre>
1729 int <I></I>
1737 )
1738 </pre>
1739 <dd> Writes a file representing the argument DDs in a format
1740 suitable for the graph drawing program dot.
1742 file system full).
1743 Cudd_DumpDot does not close the file: This is the caller
1744 responsibility. Cudd_DumpDot uses a minimal unique subset of the
1745 hexadecimal address of a node as name for it.
1746 If the argument inames is non-null, it is assumed to hold the pointers
1747 to the names of the inputs. Similarly for onames.
1748 Cudd_DumpDot uses the following convention to draw arcs:
1749 <ul>
1750 <li> solid line: THEN arcs;
1751 <li> dotted line: complement arcs;
1752 <li> dashed line: regular ELSE arcs.
1753 </ul>
1754 The dot options are chosen so that the drawing fits on a letter-size
1755 sheet.
1756 <p>
1759 <p>
1766 </code>
1768 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
1770 <dt><pre>
1772 int <I></I>
1780 )
1781 </pre>
1782 <dd> Writes factored forms representing the argument BDDs.
1783 The format of the factored form is the one used in the genlib files
1785 otherwise (e.g., file system full). Cudd_DumpFactoredForm does not
1786 close the file: This is the caller responsibility. Caution must be
1787 exercised because a factored form may be exponentially larger than
1788 the argument BDD. If the argument inames is non-null, it is assumed
1789 to hold the pointers to the names of the inputs. Similarly for
1790 onames.
1791 <p>
1794 <p>
1801 </code>
1803 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
1805 <dt><pre>
1807 DdNode * <I></I>
1814 )
1815 </pre>
1816 <dd> This function generates a BDD for the function d(x,y)
1817 > d(x,z);
1820 with 0 the most significant bit.
1821 The distance d(x,y) is defined as:
1823 The BDD is built bottom-up.
1826 <p>
1829 <p>
1835 </code>
1837 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
1839 <dt><pre>
1841 DdNode * <I></I>
1848 )
1849 </pre>
1850 <dd> This function generates a BDD for the function d(x,y)
1851 > d(y,z);
1854 with 0 the most significant bit.
1855 The distance d(x,y) is defined as:
1857 The BDD is built bottom-up.
1860 <p>
1863 <p>
1869 </code>
1871 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
1873 <dt><pre>
1875 void <I></I>
1878 )
1879 </pre>
1880 <dd> Enables garbage collection. Garbage collection is
1881 initially enabled. Therefore it is necessary to call this function
1882 only if garbage collection has been explicitly disabled.
1883 <p>
1886 <p>
1888 <dd> <b>See Also</b> <code><a href="#Cudd_DisableGarbageCollection">Cudd_DisableGarbageCollection</a>
1890 </code>
1892 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
1894 <dt><pre>
1896 int <I></I>
1899 )
1900 </pre>
1901 <dd> Enables reporting of reordering stats.
1903 <p>
1906 hooks.
1907 <p>
1909 <dd> <b>See Also</b> <code><a href="#Cudd_DisableReorderingReporting">Cudd_DisableReorderingReporting</a>
1911 </code>
1913 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
1915 <dt><pre>
1917 int <I></I>
1923 )
1924 </pre>
1925 <dd> Counts the number of minterms of a DD with extended precision.
1926 The function is assumed to depend on nvars variables. The minterm count is
1927 represented as an EpDouble, to allow any number of variables.
1928 Returns 0 if successful; CUDD_OUT_OF_MEM otherwise.
1929 <p>
1932 <p>
1936 </code>
1938 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
1940 <dt><pre>
1942 int <I></I>
1949 )
1950 </pre>
1951 <dd> Compares two ADDs for equality within tolerance. Two
1952 ADDs are reported to be equal if the maximum difference between them
1953 (the sup norm of their difference) is less than or equal to the
1954 tolerance parameter. Returns 1 if the two ADDs are equal (within
1956 the first failure is reported to the standard output.
1957 <p>
1960 <p>
1962 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
1964 <dt><pre>
1966 int <I></I>
1972 )
1973 </pre>
1977 otherwise. No new nodes are created.
1978 <p>
1981 <p>
1984 </code>
1986 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
1988 <dt><pre>
1990 int <I></I>
1994 )
1995 </pre>
1996 <dd> Estimates the number of nodes in a cofactor of a DD.
1997 Returns an estimate of the number of nodes in the positive cofactor of
1998 the graph rooted at node with respect to the variable whose index is i.
1999 This procedure implements with minor changes the algorithm of Cabodi et al.
2000 (ICCAD96). It does not allocate any memory, it does not change the
2001 state of the manager, and it is fast. However, it has been observed to
2002 overestimate the size of the cofactor by as much as a factor of 2.
2003 <p>
2006 <p>
2009 </code>
2011 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2013 <dt><pre>
2015 int <I></I>
2021 )
2022 </pre>
2023 <dd> Estimates the number of nodes in a cofactor of a DD.
2024 Returns an estimate of the number of nodes in a cofactor of
2025 the graph rooted at node with respect to the variable whose index is i.
2026 In case of failure, returns CUDD_OUT_OF_MEM.
2027 This function uses a refinement of the algorithm of Cabodi et al.
2028 (ICCAD96). The refinement allows the procedure to account for part
2029 of the recombination that may occur in the part of the cofactor above
2030 the cofactoring variable. This procedure does no create any new node.
2031 It does keep a small table of results; therefore it may run out of memory.
2032 If this is a concern, one should use Cudd_EstimateCofactorSimple, which
2033 is faster, does not allocate any memory, but is less accurate.
2034 <p>
2037 <p>
2041 </code>
2043 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2045 <dt><pre>
2047 DdNode * <I></I>
2052 )
2053 </pre>
2054 <dd> Finds the value of a DD for a given variable
2055 assignment. The variable assignment is passed in an array of int's,
2056 that should specify a zero or a one for each variable in the support
2057 of the function. Returns a pointer to a constant node. No new nodes
2058 are produced.
2059 <p>
2062 <p>
2066 </code>
2068 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
2070 <dt><pre>
2072 double <I></I>
2075 )
2076 </pre>
2077 <dd> Computes the fraction of slots in the unique table that
2078 should be in use. This expected value is based on the assumption
2079 that the hash function distributes the keys randomly; it can be
2080 compared with the result of Cudd_ReadUsedSlots to monitor the
2081 performance of the unique table hash function.
2082 <p>
2085 <p>
2089 </code>
2091 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
2093 <dt><pre>
2095 DdNode * <I></I>
2099 )
2100 </pre>
2101 <dd> Returns the cube of the essential variables. A positive
2102 literal means that the variable must be set to 1 for the function to be
2104 function to be 1. Returns a pointer to the cube BDD if successful;
2105 NULL otherwise.
2106 <p>
2109 <p>
2112 </code>
2114 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
2116 <dt><pre>
2118 DdTlcInfo * <I></I>
2122 )
2123 </pre>
2124 <dd> Returns the one- and two-literal clauses of a DD.
2125 Returns a pointer to the structure holding the clauses if
2126 successful; NULL otherwise. For a constant DD, the empty set of clauses
2127 is returned. This is obviously correct for a non-zero constant. For the
2128 constant zero, it is based on the assumption that only those clauses
2129 containing variables in the support of the function are considered. Since
2130 the support of a constant function is empty, no clauses are returned.
2131 <p>
2134 <p>
2137 </code>
2139 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
2141 <dt><pre>
2143 DdGen * <I></I>
2149 )
2150 </pre>
2151 <dd> Defines an iterator on the onset of a decision diagram
2152 and finds its first cube. Returns a generator that contains the
2153 information necessary to continue the enumeration if successful; NULL
2154 otherwise.<p>
2155 A cube is represented as an array of literals, which are integers in
2157 uncomplemented literal, and 2 stands for don't care. The enumeration
2158 produces a disjoint cover of the function associated with the diagram.
2159 The size of the array equals the number of variables in the manager at
2160 the time Cudd_FirstCube is called.<p>
2161 For each cube, a value is also returned. This value is always 1 for a
2162 BDD, while it may be different from 1 for an ADD.
2163 For BDDs, the offset is the set of cubes whose value is the logical zero.
2164 For ADDs, the offset is the set of cubes whose value is the
2165 background value. The cubes of the offset are not enumerated.
2166 <p>
2169 <p>
2176 </code>
2178 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2180 <dt><pre>
2182 DdGen * <I></I>
2187 )
2188 </pre>
2189 <dd> Defines an iterator on the nodes of a decision diagram
2190 and finds its first node. Returns a generator that contains the
2191 information necessary to continue the enumeration if successful;
2192 NULL otherwise. The nodes are enumerated in a reverse topological
2193 order, so that a node is always preceded in the enumeration by its
2194 descendants.
2195 <p>
2198 <p>
2205 </code>
2207 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2209 <dt><pre>
2211 DdGen * <I></I>
2217 )
2218 </pre>
2219 <dd> Defines an iterator on a pair of BDDs describing a
2220 (possibly incompletely specified) Boolean functions and finds the
2221 first cube of a cover of the function. Returns a generator
2222 that contains the information necessary to continue the enumeration
2223 if successful; NULL otherwise.<p>
2225 The two argument BDDs are the lower and upper bounds of an interval.
2226 It is a mistake to call this function with a lower bound that is not
2227 less than or equal to the upper bound.<p>
2229 A cube is represented as an array of literals, which are integers in
2231 uncomplemented literal, and 2 stands for don't care. The enumeration
2232 produces a prime and irredundant cover of the function associated
2233 with the two BDDs. The size of the array equals the number of
2234 variables in the manager at the time Cudd_FirstCube is called.<p>
2236 This iterator can only be used on BDDs.
2237 <p>
2240 <p>
2248 </code>
2250 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2252 <dt><pre>
2254 void <I></I>
2257 )
2258 </pre>
2259 <dd> Frees the variable group tree of the manager.
2260 <p>
2263 <p>
2268 </code>
2270 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
2272 <dt><pre>
2274 void <I></I>
2277 )
2278 </pre>
2279 <dd> Frees the variable group tree of the manager.
2280 <p>
2283 <p>
2288 </code>
2290 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
2292 <dt><pre>
2294 int <I></I>
2297 )
2298 </pre>
2300 <p>
2303 <p>
2305 <dd> <b>See Also</b> <code><a href="#Cudd_EnableGarbageCollection">Cudd_EnableGarbageCollection</a>
2307 </code>
2309 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
2311 <dt><pre>
2313 int <I></I>
2316 )
2317 </pre>
2319 be used in mis-like foreach constructs.
2320 <p>
2323 <p>
2332 </code>
2334 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2336 <dt><pre>
2338 DdNode * <I></I>
2343 )
2344 </pre>
2345 <dd> Determines whether the function represented by BDD f is
2346 positive unate (monotonic increasing) in variable i. It is based on
2347 Cudd_Decreasing and the fact that f is monotonic increasing in i if
2348 and only if its complement is monotonic decreasing in i.
2349 <p>
2352 <p>
2355 </code>
2357 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
2359 <dt><pre>
2361 DdNode * <I></I>
2366 )
2367 </pre>
2368 <dd> Builds a cube of BDD variables from an array of indices.
2369 Returns a pointer to the result if successful; NULL otherwise.
2370 <p>
2373 <p>
2377 </code>
2379 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2381 <dt><pre>
2383 DdNode * <I></I>
2390 )
2391 </pre>
2395 The BDD is built bottom-up.
2396 It has a linear number of nodes if the variables are ordered as follows:
2398 <p>
2401 <p>
2404 </code>
2406 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
2408 <dt><pre>
2410 DdManager * <I></I>
2417 )
2418 </pre>
2419 <dd> Creates a new DD manager, initializes the table, the
2420 basic constants and the projection functions. If maxMemory is 0,
2421 Cudd_Init decides suitable values for the maximum size of the cache
2422 and for the limit for fast unique table growth based on the available
2423 memory. Returns a pointer to the manager if successful; NULL
2424 otherwise.
2425 <p>
2428 <p>
2431 </code>
2433 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInit.c"TARGET="ABSTRACT"><CODE>cuddInit.c</CODE></A>
2435 <dt><pre>
2437 int <I></I>
2440 )
2441 </pre>
2443 generator is empty or NULL; 0 otherswise.
2444 <p>
2447 <p>
2456 </code>
2458 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2460 <dt><pre>
2462 int <I></I>
2467 )
2468 </pre>
2469 <dd> Checks whether a function is in a hook. A hook is a list of
2470 application-provided functions called on certain occasions by the
2472 <p>
2475 <p>
2479 </code>
2481 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
2483 <dt><pre>
2485 int <I></I>
2488 )
2489 </pre>
2491 useful to test the results of Cudd_bddIteConstant, Cudd_addIteConstant,
2492 Cudd_addEvalConst. These results may be a special value signifying
2493 non-constant. In the other cases the macro Cudd_IsConstant can be used.
2494 <p>
2497 <p>
2503 </code>
2505 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
2507 <dt><pre>
2509 void <I></I>
2513 )
2514 </pre>
2515 <dd> Decreases the reference count of node n. If n dies,
2516 recursively decreases the reference counts of its children. It is
2517 used to dispose of a BDD that is no longer needed. It is more
2518 efficient than Cudd_RecursiveDeref, but it cannot be used on
2519 ADDs. The greater efficiency comes from being able to assume that no
2520 constant node will ever die as a result of a call to this
2521 procedure.
2522 <p>
2525 <p>
2529 </code>
2531 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
2533 <dt><pre>
2535 DdNode * <I></I>
2540 )
2541 </pre>
2542 <dd> Finds a largest cube in a DD. f is the DD we want to
2543 get the largest cube for. The problem is translated into the one of
2544 finding a shortest path in f, when both THEN and ELSE arcs are assumed to
2545 have unit length. This yields a largest cube in the disjoint cover
2546 corresponding to the DD. Therefore, it is not necessarily the largest
2547 implicant of f. Returns the largest cube as a BDD.
2548 <p>
2551 <p>
2554 </code>
2556 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
2558 <dt><pre>
2560 DdNode * <I></I>
2564 )
2565 </pre>
2566 <dd> Converts a ZDD cover to a BDD graph. If successful, it
2567 returns a BDD node, otherwise it returns NULL.
2568 <p>
2571 </code>
2573 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddIsop.c"TARGET="ABSTRACT"><CODE>cuddZddIsop.c</CODE></A>
2575 <dt><pre>
2577 MtrNode * <I></I>
2583 )
2584 </pre>
2585 <dd> Creates a new variable group. The group starts at
2586 variable and contains size variables. The parameter low is the index
2587 of the first variable. If the variable already exists, its current
2588 position in the order is known to the manager. If the variable does
2589 not exist yet, the position is assumed to be the same as the index.
2590 The group tree is created if it does not exist yet.
2591 Returns a pointer to the group if successful; NULL otherwise.
2592 <p>
2595 <p>
2598 </code>
2600 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
2602 <dt><pre>
2604 MtrNode * <I></I>
2610 )
2611 </pre>
2612 <dd> Creates a new ZDD variable group. The group starts at
2613 variable and contains size variables. The parameter low is the index
2614 of the first variable. If the variable already exists, its current
2615 position in the order is known to the manager. If the variable does
2616 not exist yet, the position is assumed to be the same as the index.
2617 The group tree is created if it does not exist yet.
2618 Returns a pointer to the group if successful; NULL otherwise.
2619 <p>
2622 <p>
2625 </code>
2627 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
2629 <dt><pre>
2631 int <I></I>
2637 )
2638 </pre>
2639 <dd> Returns the minimum Hamming distance between the
2640 minterms of a function f and a reference minterm. The function is
2641 given as a BDD; the minterm is given as an array of integers, one
2642 for each variable in the manager. Returns the minimum distance if
2643 it is less than the upper bound; the upper bound if the minimum
2644 distance is at least as large; CUDD_OUT_OF_MEM in case of failure.
2645 <p>
2648 <p>
2652 </code>
2654 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
2656 <dt><pre>
2658 DdApaNumber <I></I>
2661 )
2662 </pre>
2663 <dd> Allocates memory for an arbitrary precision
2664 integer. Returns a pointer to the allocated memory if successful;
2665 NULL otherwise.
2666 <p>
2669 <p>
2671 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
2673 <dt><pre>
2675 int <I></I>
2680 )
2681 </pre>
2682 <dd> Generates the next cube of a decision diagram onset,
2684 otherwise.
2685 <p>
2688 generator is modified.
2689 <p>
2696 </code>
2698 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2700 <dt><pre>
2702 int <I></I>
2706 )
2707 </pre>
2708 <dd> Finds the node of a decision diagram, using generator
2710 <p>
2713 <p>
2720 </code>
2722 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2724 <dt><pre>
2726 int <I></I>
2730 )
2731 </pre>
2732 <dd> Generates the next cube of a Boolean function,
2734 otherwise.
2735 <p>
2738 generator is modified.
2739 <p>
2747 </code>
2749 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2751 <dt><pre>
2753 unsigned int <I></I>
2756 )
2757 </pre>
2758 <dd> Returns the index of the node. The node pointer can be
2759 either regular or complemented.
2760 <p>
2763 <p>
2766 </code>
2768 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
2770 <dt><pre>
2772 void <I></I>
2775 )
2776 </pre>
2777 <dd> Warns that a memory allocation failed.
2778 This function can be used as replacement of MMout_of_memory to prevent
2779 the safe_mem functions of the util package from exiting when malloc
2780 returns NULL. One possible use is in case of discretionary allocations;
2781 for instance, the allocation of memory to enlarge the computed table.
2782 <p>
2785 <p>
2787 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2789 <dt><pre>
2791 DdNode * <I></I>
2799 )
2800 </pre>
2801 <dd> Extracts a dense superset from a BDD. The procedure is
2802 identical to the underapproximation procedure except for the fact that it
2803 works on the complement of the given function. Extracting the subset
2804 of the complement function is equivalent to extracting the superset
2805 of the function.
2806 Returns a pointer to the BDD of the superset if successful. NULL if
2807 intermediate result causes the procedure to run out of memory. The
2808 parameter numVars is the maximum number of variables to be used in
2809 minterm calculation. The optimal number
2810 should be as close as possible to the size of the support of f.
2811 However, it is safe to pass the value returned by Cudd_ReadSize for
2812 numVars when the number of variables is under 1023. If numVars is
2814 the procedure will compute a value which will avoid overflow but
2815 will cause underflow with 2046 variables or more.
2816 <p>
2819 <p>
2824 </code>
2826 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
2828 <dt><pre>
2830 unsigned int <I></I>
2833 )
2834 </pre>
2836 <p>
2839 <p>
2841 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
2843 <dt><pre>
2845 int <I></I>
2851 )
2852 </pre>
2853 <dd> Prints to the standard output a DD and its statistics.
2854 The statistics include the number of nodes, the number of leaves, and
2855 the number of minterms. (The number of minterms is the number of
2856 assignments to the variables that cause the function to be different
2857 from the logical zero (for BDDs) and from the background value (for
2859 <ul>
2865 </ul>
2866 For the purpose of counting the number of minterms, the function is
2868 <p>
2871 <p>
2877 </code>
2879 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2881 <dt><pre>
2883 int <I></I>
2887 )
2888 </pre>
2889 <dd> Prints out statistics and settings for a CUDD manager.
2891 <p>
2894 <p>
2896 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
2898 <dt><pre>
2900 int <I></I>
2903 )
2904 </pre>
2906 success; 0 otherwise.
2907 <p>
2910 <p>
2912 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
2914 <dt><pre>
2916 int <I></I>
2920 )
2921 </pre>
2922 <dd> Prints a disjoint sum of product cover for the function
2923 rooted at node. Each product corresponds to a path from node to a
2924 leaf node different from the logical zero, and different from the
2925 background value. Uses the package default output file. Returns 1
2926 if successful; 0 otherwise.
2927 <p>
2930 <p>
2934 </code>
2936 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2938 <dt><pre>
2940 int <I></I>
2946 )
2947 </pre>
2950 the variable indices are printed.
2951 <p>
2954 <p>
2956 <dd> <b>See Also</b> <code><a href="#Cudd_FindTwoLiteralClauses">Cudd_FindTwoLiteralClauses</a>
2957 </code>
2959 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
2961 <dt><pre>
2963 void <I></I>
2966 )
2967 </pre>
2968 <dd> Prints the package version number.
2969 <p>
2972 <p>
2974 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
2976 <dt><pre>
2978 DdNode * <I></I>
2988 )
2989 </pre>
2990 <dd> Selects pairs from a relation R(x,y) (given as a BDD)
2991 in such a way that a given x appears in one pair only. Uses a
2992 priority function to determine which y should be paired to a given x.
2993 Cudd_PrioritySelect returns a pointer to
2994 the selected function if successful; NULL otherwise.
2995 Three of the arguments--x, y, and z--are vectors of BDD variables.
2996 The first two are the variables on which R depends. The third vectore
2997 is a vector of auxiliary variables, used during the computation. This
2998 vector is optional. If a NULL value is passed instead,
2999 Cudd_PrioritySelect will create the working variables on the fly.
3000 The sizes of x and y (and z if it is not NULL) should equal n.
3001 The priority function Pi can be passed as a BDD, or can be built by
3002 Cudd_PrioritySelect. If NULL is passed instead of a DdNode *,
3003 parameter Pifunc is used by Cudd_PrioritySelect to build a BDD for the
3004 priority function. (Pifunc is a pointer to a C function.) If Pi is not
3005 NULL, then Pifunc is ignored. Pifunc should have the same interface as
3006 the standard priority functions (e.g., Cudd_Dxygtdxz).
3007 Cudd_PrioritySelect and Cudd_CProjection can sometimes be used
3008 interchangeably. Specifically, calling Cudd_PrioritySelect with
3009 Cudd_Xgty as Pifunc produces the same result as calling
3010 Cudd_CProjection with the all-zero minterm as reference minterm.
3011 However, depending on the application, one or the other may be
3012 preferable:
3013 <ul>
3014 <li> When extracting representatives from an equivalence relation,
3015 Cudd_CProjection has the advantage of nor requiring the auxiliary
3016 variables.
3017 <li> When computing matchings in general bipartite graphs,
3018 Cudd_PrioritySelect normally obtains better results because it can use
3019 more powerful matching schemes (e.g., Cudd_Dxygtdxz).
3020 </ul>
3021 <p>
3024 the manager.
3025 <p>
3032 </code>
3034 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
3036 <dt><pre>
3038 void <I></I>
3041 )
3042 </pre>
3043 <dd> Deletes resources associated with a DD manager and
3044 resets the global statistical counters. (Otherwise, another manaqger
3045 subsequently created would inherit the stats of this one.)
3046 <p>
3049 <p>
3052 </code>
3054 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInit.c"TARGET="ABSTRACT"><CODE>cuddInit.c</CODE></A>
3056 <dt><pre>
3058 long <I></I>
3060 <b></b> <i></i>
3061 )
3062 </pre>
3065 of L'Ecuyer with Bays-Durham shuffle. Returns a long integer uniformly
3067 The random generator can be explicitly initialized by calling
3068 Cudd_Srandom. If no explicit initialization is performed, then the
3069 seed 1 is assumed.
3070 <p>
3073 <p>
3076 </code>
3078 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
3080 <dt><pre>
3082 int <I></I>
3085 )
3086 </pre>
3087 <dd> Returns the current value of the arcviolation
3088 parameter. This parameter is used in group sifting to decide how
3090 tolerable when checking for aggregation due to extended
3092 causes fewer variables to be aggregated. The default value is 0.
3093 <p>
3096 <p>
3099 </code>
3101 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3103 <dt><pre>
3105 DdNode * <I></I>
3108 )
3109 </pre>
3110 <dd> Reads the background constant of the manager.
3111 <p>
3114 <p>
3116 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3118 <dt><pre>
3120 double <I></I>
3123 )
3124 </pre>
3125 <dd> Returns the number of cache hits.
3126 <p>
3129 <p>
3132 </code>
3134 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3136 <dt><pre>
3138 double <I></I>
3141 )
3142 </pre>
3143 <dd> Returns the number of cache look-ups.
3144 <p>
3147 <p>
3150 </code>
3152 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3154 <dt><pre>
3156 unsigned int <I></I>
3159 )
3160 </pre>
3161 <dd> Reads the number of slots in the cache.
3162 <p>
3165 <p>
3168 </code>
3170 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3172 <dt><pre>
3174 double <I></I>
3177 )
3178 </pre>
3179 <dd> Reads the fraction of used slots in the cache. The unused
3180 slots are those in which no valid data is stored. Garbage collection,
3181 variable reordering, and cache resizing may cause used slots to become
3182 unused.
3183 <p>
3186 <p>
3189 </code>
3191 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3193 <dt><pre>
3195 unsigned int <I></I>
3198 )
3199 </pre>
3200 <dd> Returns the number of dead nodes in the unique table.
3201 <p>
3204 <p>
3207 </code>
3209 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3211 <dt><pre>
3213 CUDD_VALUE_TYPE <I></I>
3216 )
3217 </pre>
3218 <dd> Reads the epsilon parameter of the manager. The epsilon
3219 parameter control the comparison between floating point numbers.
3220 <p>
3223 <p>
3226 </code>
3228 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3230 <dt><pre>
3232 Cudd_ErrorType <I></I>
3235 )
3236 </pre>
3237 <dd> Returns the code of the last error. The error codes are
3238 defined in cudd.h.
3239 <p>
3242 <p>
3245 </code>
3247 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3249 <dt><pre>
3251 long <I></I>
3254 )
3255 </pre>
3256 <dd> Returns the number of milliseconds spent doing garbage
3257 collection since the manager was initialized.
3258 <p>
3261 <p>
3263 <dd> <b>See Also</b> <code><a href="#Cudd_ReadGarbageCollections">Cudd_ReadGarbageCollections</a>
3264 </code>
3266 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3268 <dt><pre>
3270 int <I></I>
3273 )
3274 </pre>
3275 <dd> Returns the number of times garbage collection has
3276 occurred in the manager. The number includes both the calls from
3277 reordering procedures and those caused by requests to create new
3278 nodes.
3279 <p>
3282 <p>
3284 <dd> <b>See Also</b> <code><a href="#Cudd_ReadGarbageCollectionTime">Cudd_ReadGarbageCollectionTime</a>
3285 </code>
3287 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3289 <dt><pre>
3291 Cudd_AggregationType <I></I>
3294 )
3295 </pre>
3296 <dd> Reads the groupcheck parameter of the manager. The
3297 groupcheck parameter determines the aggregation criterion in group
3298 sifting.
3299 <p>
3302 <p>
3305 </code>
3307 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3309 <dt><pre>
3311 int <I></I>
3315 )
3316 </pre>
3317 <dd> Returns the index of the ZDD variable currently in the
3318 i-th position of the order. If the index is CUDD_CONST_INDEX, returns
3319 CUDD_CONST_INDEX; otherwise, if the index is out of bounds returns -1.
3320 <p>
3323 <p>
3327 </code>
3329 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3331 <dt><pre>
3333 int <I></I>
3337 )
3338 </pre>
3339 <dd> Returns the index of the variable currently in the i-th
3340 position of the order. If the index is CUDD_CONST_INDEX, returns
3341 CUDD_CONST_INDEX; otherwise, if the index is out of bounds returns -1.
3342 <p>
3345 <p>
3349 </code>
3351 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3353 <dt><pre>
3355 int <I></I>
3363 )
3364 </pre>
3365 <dd> Accesses the i-th clause of a DD given the clause set which
3367 or in case of error.
3368 <p>
3371 <p>
3373 <dd> <b>See Also</b> <code><a href="#Cudd_FindTwoLiteralClauses">Cudd_FindTwoLiteralClauses</a>
3374 </code>
3376 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
3378 <dt><pre>
3380 unsigned int <I></I>
3383 )
3384 </pre>
3385 <dd> Returns the total number of nodes currently in the unique
3386 table, including the dead nodes.
3387 <p>
3390 <p>
3393 </code>
3395 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3397 <dt><pre>
3399 int <I></I>
3404 )
3405 </pre>
3406 <dd> Reads an entry of the linear transform matrix.
3407 <p>
3410 <p>
3412 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
3414 <dt><pre>
3416 DdNode * <I></I>
3419 )
3420 </pre>
3421 <dd> Returns the zero constant of the manager. The logic zero
3422 constant is the complement of the one constant, and is distinct from
3423 the arithmetic zero.
3424 <p>
3427 <p>
3431 </code>
3433 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3435 <dt><pre>
3437 unsigned int <I></I>
3440 )
3441 </pre>
3442 <dd> Reads the looseUpTo parameter of the manager.
3443 <p>
3446 <p>
3451 </code>
3453 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3455 <dt><pre>
3457 unsigned int <I></I>
3460 )
3461 </pre>
3462 <dd> Reads the maxCacheHard parameter of the manager.
3463 <p>
3466 <p>
3470 </code>
3472 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3474 <dt><pre>
3476 unsigned int <I></I>
3479 )
3480 </pre>
3481 <dd> Returns the soft limit for the cache size. The soft limit
3482 <p>
3485 <p>
3488 </code>
3490 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3492 <dt><pre>
3494 double <I></I>
3497 )
3498 </pre>
3499 <dd> Reads the maxGrowthAlt parameter of the manager. This
3500 parameter is analogous to the maxGrowth paramter, and is used every
3501 given number of reorderings instead of maxGrowth. The number of
3502 reorderings is set with Cudd_SetReorderingCycle. If the number of
3503 reorderings is 0 (default) maxGrowthAlt is never used.
3504 <p>
3507 <p>
3513 </code>
3515 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3517 <dt><pre>
3519 double <I></I>
3522 )
3523 </pre>
3524 <dd> Reads the maxGrowth parameter of the manager. This
3525 parameter determines how much the number of nodes can grow during
3526 sifting of a variable. Overall, sifting never increases the size of
3527 the decision diagrams. This parameter only refers to intermediate
3528 results. A lower value will speed up sifting, possibly at the
3529 expense of quality.
3530 <p>
3533 <p>
3537 </code>
3539 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3541 <dt><pre>
3543 unsigned int <I></I>
3546 )
3547 </pre>
3548 <dd> Reads the maximum allowed number of live nodes. When this
3549 number is exceeded, the package returns NULL.
3550 <p>
3553 <p>
3556 </code>
3558 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3560 <dt><pre>
3562 unsigned long <I></I>
3565 )
3566 </pre>
3567 <dd> Reads the maximum allowed memory. When this
3568 number is exceeded, the package returns NULL.
3569 <p>
3572 <p>
3575 </code>
3577 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3579 <dt><pre>
3581 unsigned long <I></I>
3584 )
3585 </pre>
3586 <dd> Returns the memory in use by the manager measured in bytes.
3587 <p>
3590 <p>
3592 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3594 <dt><pre>
3596 unsigned int <I></I>
3599 )
3600 </pre>
3601 <dd> Reads the minDead parameter of the manager. The minDead
3602 parameter is used by the package to decide whether to collect garbage
3603 or resize a subtable of the unique table when the subtable becomes
3604 too full. The application can indirectly control the value of minDead
3605 by setting the looseUpTo parameter.
3606 <p>
3609 <p>
3614 </code>
3616 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3618 <dt><pre>
3620 unsigned int <I></I>
3623 )
3624 </pre>
3625 <dd> Reads the hit rate that causes resizinig of the computed
3626 table.
3627 <p>
3630 <p>
3633 </code>
3635 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3637 <dt><pre>
3639 DdNode * <I></I>
3642 )
3643 </pre>
3644 <dd> Reads the minus-infinity constant from the manager.
3645 <p>
3648 <p>
3650 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3652 <dt><pre>
3654 unsigned int <I></I>
3657 )
3658 </pre>
3659 <dd> Returns the threshold for the next dynamic reordering.
3660 The threshold is in terms of number of nodes and is in effect only
3661 if reordering is enabled. The count does not include the dead nodes,
3662 unless the countDead parameter of the manager has been changed from
3663 its default setting.
3664 <p>
3667 <p>
3670 </code>
3672 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3674 <dt><pre>
3676 long <I></I>
3679 )
3680 </pre>
3681 <dd> Reports the number of live nodes in BDDs and ADDs. This
3682 number does not include the isolated projection functions and the
3683 unused constants. These nodes that are not counted are not part of
3684 the DDs manipulated by the application.
3685 <p>
3688 <p>
3692 </code>
3694 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3696 <dt><pre>
3698 double <I></I>
3701 )
3702 </pre>
3703 <dd> Returns the number of nodes killed by dereferencing if the
3704 keeping of this statistic is enabled; -1 otherwise. This statistic is
3705 enabled only if the package is compiled with DD_STATS defined.
3706 <p>
3709 <p>
3712 </code>
3714 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3716 <dt><pre>
3718 double <I></I>
3721 )
3722 </pre>
3723 <dd> Returns the number of nodes returned to the free list if the
3724 keeping of this statistic is enabled; -1 otherwise. This statistic is
3725 enabled only if the package is compiled with DD_STATS defined.
3726 <p>
3729 <p>
3732 </code>
3734 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3736 <dt><pre>
3738 int <I></I>
3741 )
3742 </pre>
3743 <dd> Reads the current number of crossovers used by the
3744 genetic algorithm for variable reordering. A larger number of crossovers will
3745 cause the genetic algorithm to take more time, but will generally
3746 produce better results. The default value is 0, in which case the
3747 package uses three times the number of variables as number of crossovers,
3748 with a maximum of 60.
3749 <p>
3752 <p>
3755 </code>
3757 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3759 <dt><pre>
3761 DdNode * <I></I>
3764 )
3765 </pre>
3766 <dd> Returns the one constant of the manager. The one
3767 constant is common to ADDs and BDDs.
3768 <p>
3771 <p>
3776 </code>
3778 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3780 <dt><pre>
3782 int <I></I>
3785 )
3786 </pre>
3787 <dd> Reports the peak number of live nodes. This count is kept
3788 only if CUDD is compiled with DD_STATS defined. If DD_STATS is not
3789 defined, this function returns -1.
3790 <p>
3793 <p>
3798 </code>
3800 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3802 <dt><pre>
3804 long <I></I>
3807 )
3808 </pre>
3809 <dd> Reports the peak number of nodes. This number includes
3810 node on the free list. At the peak, the number of nodes on the free
3811 list is guaranteed to be less than DD_MEM_CHUNK.
3812 <p>
3815 <p>
3819 </code>
3821 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3823 <dt><pre>
3825 int <I></I>
3829 )
3830 </pre>
3831 <dd> Returns the current position of the i-th ZDD variable
3832 in the order. If the index is CUDD_CONST_INDEX, returns
3833 CUDD_CONST_INDEX; otherwise, if the index is out of bounds returns
3834 -1.
3835 <p>
3838 <p>
3842 </code>
3844 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3846 <dt><pre>
3848 int <I></I>
3852 )
3853 </pre>
3854 <dd> Returns the current position of the i-th variable in
3855 the order. If the index is CUDD_CONST_INDEX, returns
3856 CUDD_CONST_INDEX; otherwise, if the index is out of bounds returns
3857 -1.
3858 <p>
3861 <p>
3865 </code>
3867 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3869 <dt><pre>
3871 DdNode * <I></I>
3874 )
3875 </pre>
3876 <dd> Reads the plus-infinity constant from the manager.
3877 <p>
3880 <p>
3882 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3884 <dt><pre>
3886 int <I></I>
3889 )
3890 </pre>
3891 <dd> Reads the current size of the population used by the
3892 genetic algorithm for variable reordering. A larger population size will
3893 cause the genetic algorithm to take more time, but will generally
3894 produce better results. The default value is 0, in which case the
3895 package uses three times the number of variables as population size,
3896 with a maximum of 120.
3897 <p>
3900 <p>
3903 </code>
3905 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3907 <dt><pre>
3909 int <I></I>
3912 )
3913 </pre>
3914 <dd> Returns the current value of the recombination
3915 parameter used in group sifting. A larger (positive) value makes the
3916 aggregation of variables due to the second difference criterion more
3917 likely. A smaller (negative) value makes aggregation less likely.
3918 <p>
3921 <p>
3924 </code>
3926 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3928 <dt><pre>
3930 double <I></I>
3933 )
3934 </pre>
3935 <dd> Returns the number of recursive calls if the package is
3936 compiled with DD_COUNT defined.
3937 <p>
3940 <p>
3942 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3944 <dt><pre>
3946 int <I></I>
3949 )
3950 </pre>
3951 <dd> Reads the reordCycle parameter of the manager. This
3952 parameter determines how often the alternate threshold on maximum
3953 growth is used in reordering.
3954 <p>
3957 <p>
3959 <dd> <b>See Also</b> <code><a href="#Cudd_ReadMaxGrowthAlternate">Cudd_ReadMaxGrowthAlternate</a>
3962 </code>
3964 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3966 <dt><pre>
3968 long <I></I>
3971 )
3972 </pre>
3973 <dd> Returns the number of milliseconds spent reordering
3974 variables since the manager was initialized. The time spent in collecting
3975 garbage before reordering is included.
3976 <p>
3979 <p>
3982 </code>
3984 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
3986 <dt><pre>
3988 int <I></I>
3991 )
3992 </pre>
3993 <dd> Returns the number of times reordering has occurred in the
3994 manager. The number includes both the calls to Cudd_ReduceHeap from
3995 the application program and those automatically performed by the
3996 package. However, calls that do not even initiate reordering are not
3997 counted. A call may not initiate reordering if there are fewer than
3998 minsize live nodes in the manager, or if CUDD_REORDER_NONE is specified
3999 as reordering method. The calls to Cudd_ShuffleHeap are not counted.
4000 <p>
4003 <p>
4007 </code>
4009 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4011 <dt><pre>
4013 int <I></I>
4016 )
4017 </pre>
4018 <dd> Reads the siftMaxSwap parameter of the manager. This
4019 parameter gives the maximum number of swaps that will be attempted
4020 for each invocation of sifting. The real number of swaps may exceed
4021 the set limit because the package will always complete the sifting
4022 of the variable that causes the limit to be reached.
4023 <p>
4026 <p>
4030 </code>
4032 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4034 <dt><pre>
4036 int <I></I>
4039 )
4040 </pre>
4041 <dd> Reads the siftMaxVar parameter of the manager. This
4042 parameter gives the maximum number of variables that will be sifted
4043 for each invocation of sifting.
4044 <p>
4047 <p>
4051 </code>
4053 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4055 <dt><pre>
4057 int <I></I>
4060 )
4061 </pre>
4062 <dd> Returns the number of BDD variables in existance.
4063 <p>
4066 <p>
4069 </code>
4071 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4073 <dt><pre>
4075 unsigned int <I></I>
4078 )
4079 </pre>
4080 <dd> Returns the total number of slots of the unique table.
4081 This number ismainly for diagnostic purposes.
4082 <p>
4085 <p>
4087 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4089 <dt><pre>
4091 FILE * <I></I>
4094 )
4095 </pre>
4096 <dd> Reads the stderr of a manager. This is the file pointer to
4097 which messages normally going to stderr are written. It is initialized
4098 to stderr. Cudd_SetStderr allows the application to redirect it.
4099 <p>
4102 <p>
4106 </code>
4108 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4110 <dt><pre>
4112 FILE * <I></I>
4115 )
4116 </pre>
4117 <dd> Reads the stdout of a manager. This is the file pointer to
4118 which messages normally going to stdout are written. It is initialized
4119 to stdout. Cudd_SetStdout allows the application to redirect it.
4120 <p>
4123 <p>
4127 </code>
4129 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4131 <dt><pre>
4133 double <I></I>
4136 )
4137 </pre>
4138 <dd> Reads the number of elementary reordering steps.
4139 <p>
4142 <p>
4144 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4146 <dt><pre>
4148 int <I></I>
4151 )
4152 </pre>
4153 <dd> Returns the current value of the symmviolation
4154 parameter. This parameter is used in group sifting to decide how
4158 small value causes fewer variables to be aggregated. The default
4159 value is 0.
4160 <p>
4163 <p>
4166 </code>
4168 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4170 <dt><pre>
4172 MtrNode * <I></I>
4175 )
4176 </pre>
4177 <dd> Returns the variable group tree of the manager.
4178 <p>
4181 <p>
4186 </code>
4188 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4190 <dt><pre>
4192 double <I></I>
4195 )
4196 </pre>
4197 <dd> Returns the number of links followed during look-ups in the
4198 unique table if the keeping of this statistic is enabled; -1 otherwise.
4199 If an item is found in the first position of its collision list, the
4200 number of links followed is taken to be 0. If it is in second position,
4201 the number of links is 1, and so on. This statistic is enabled only if
4202 the package is compiled with DD_UNIQUE_PROFILE defined.
4203 <p>
4206 <p>
4209 </code>
4211 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4213 <dt><pre>
4215 double <I></I>
4218 )
4219 </pre>
4220 <dd> Returns the number of look-ups in the unique table if the
4221 keeping of this statistic is enabled; -1 otherwise. This statistic is
4222 enabled only if the package is compiled with DD_UNIQUE_PROFILE defined.
4223 <p>
4226 <p>
4229 </code>
4231 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4233 <dt><pre>
4235 double <I></I>
4238 )
4239 </pre>
4240 <dd> Reads the fraction of used slots in the unique
4241 table. The unused slots are those in which no valid data is
4242 stored. Garbage collection, variable reordering, and subtable
4243 resizing may cause used slots to become unused.
4244 <p>
4247 <p>
4250 </code>
4252 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4254 <dt><pre>
4256 DdNode * <I></I>
4260 )
4261 </pre>
4262 <dd> Returns the i-th element of the vars array if it falls
4263 within the array bounds; NULL otherwise. If i is the index of an
4264 existing variable, this function produces the same result as
4265 Cudd_bddIthVar. However, if the i-th var does not exist yet,
4266 Cudd_bddIthVar will create it, whereas Cudd_ReadVars will not.
4267 <p>
4270 <p>
4273 </code>
4275 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4277 <dt><pre>
4279 DdNode * <I></I>
4283 )
4284 </pre>
4286 The representation of the constant 1 function as a ZDD depends on
4287 how many variables it (nominally) depends on. The index of the
4289 <p>
4292 <p>
4295 </code>
4297 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4299 <dt><pre>
4301 int <I></I>
4304 )
4305 </pre>
4306 <dd> Returns the number of ZDD variables in existance.
4307 <p>
4310 <p>
4313 </code>
4315 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4317 <dt><pre>
4319 MtrNode * <I></I>
4322 )
4323 </pre>
4324 <dd> Returns the variable group tree of the manager.
4325 <p>
4328 <p>
4333 </code>
4335 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4337 <dt><pre>
4339 DdNode * <I></I>
4342 )
4343 </pre>
4344 <dd> Returns the zero constant of the manager. The zero
4345 constant is the arithmetic zero, rather than the logic zero. The
4346 latter is the complement of the one constant.
4347 <p>
4350 <p>
4354 </code>
4356 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4358 <dt><pre>
4360 void <I></I>
4364 )
4365 </pre>
4366 <dd> Decreases the reference count of ZDD node n. If n dies,
4367 recursively decreases the reference counts of its children. It is
4368 used to dispose of a ZDD that is no longer needed.
4369 <p>
4372 <p>
4377 </code>
4379 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
4381 <dt><pre>
4383 void <I></I>
4387 )
4388 </pre>
4389 <dd> Decreases the reference count of node n. If n dies,
4390 recursively decreases the reference counts of its children. It is
4391 used to dispose of a DD that is no longer needed.
4392 <p>
4395 <p>
4400 </code>
4402 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
4404 <dt><pre>
4406 int <I></I>
4411 )
4412 </pre>
4413 <dd> Main dynamic reordering routine.
4414 Calls one of the possible reordering procedures:
4415 <ul>
4416 <li>Swapping
4417 <li>Sifting
4418 <li>Symmetric Sifting
4419 <li>Group Sifting
4420 <li>Window Permutation
4421 <li>Simulated Annealing
4422 <li>Genetic Algorithm
4423 <li>Dynamic Programming (exact)
4424 </ul>
4426 For sifting, symmetric sifting, group sifting, and window
4427 permutation it is possible to request reordering to convergence.<p>
4429 The core of all methods is the reordering procedure
4430 cuddSwapInPlace() which swaps two adjacent variables and is based
4431 on Rudell's paper.
4433 sifting (with and without convergence) returns 1 plus the number of
4434 symmetric variables, in case of success.
4435 <p>
4438 the cache.
4439 <p>
4441 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
4443 <dt><pre>
4445 void <I></I>
4448 )
4449 </pre>
4450 <dd> Increases the reference count of a node, if it is not
4451 saturated.
4452 <p>
4455 <p>
4459 </code>
4461 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
4463 <dt><pre>
4465 DdNode * <I></I>
4472 )
4473 </pre>
4474 <dd> Extracts a dense superset from a BDD. The procedure is
4475 identical to the underapproximation procedure except for the fact that it
4476 works on the complement of the given function. Extracting the subset
4477 of the complement function is equivalent to extracting the superset
4478 of the function.
4479 Returns a pointer to the BDD of the superset if successful. NULL if
4480 intermediate result causes the procedure to run out of memory. The
4481 parameter numVars is the maximum number of variables to be used in
4482 minterm calculation. The optimal number
4483 should be as close as possible to the size of the support of f.
4484 However, it is safe to pass the value returned by Cudd_ReadSize for
4485 numVars when the number of variables is under 1023. If numVars is
4487 the procedure will compute a value which will avoid overflow but
4488 will cause underflow with 2046 variables or more.
4489 <p>
4492 <p>
4497 </code>
4499 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
4501 <dt><pre>
4503 DdNode * <I></I>
4510 )
4511 </pre>
4512 <dd> Extracts a dense subset from a BDD. This procedure uses
4513 a remapping technique and density as the cost function.
4514 Returns a pointer to the BDD of the subset if
4515 successful. NULL if the procedure runs out of memory. The parameter
4516 numVars is the maximum number of variables to be used in minterm
4517 calculation. The optimal number should be as close as possible to
4518 the size of the support of f. However, it is safe to pass the value
4519 returned by Cudd_ReadSize for numVars when the number of variables
4521 overflow. If a 0 parameter is passed then the procedure will compute
4522 a value which will avoid overflow but will cause underflow with 2046
4523 variables or more.
4524 <p>
4527 <p>
4533 </code>
4535 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
4537 <dt><pre>
4539 int <I></I>
4544 )
4545 </pre>
4546 <dd> Removes a function from a hook. A hook is a list of
4547 application-provided functions called on certain occasions by the
4549 <p>
4552 <p>
4555 </code>
4557 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4559 <dt><pre>
4561 int <I></I>
4564 )
4565 </pre>
4567 0 otherwise.
4568 <p>
4571 <p>
4573 <dd> <b>See Also</b> <code><a href="#Cudd_EnableReorderingReporting">Cudd_EnableReorderingReporting</a>
4575 </code>
4577 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4579 <dt><pre>
4581 int <I></I>
4585 )
4586 </pre>
4587 <dd> Reports the status of automatic dynamic reordering of
4588 ZDDs. Parameter method is set to the ZDD reordering method currently
4590 otherwise.
4591 <p>
4594 selected.
4595 <p>
4600 </code>
4602 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4604 <dt><pre>
4606 int <I></I>
4610 )
4611 </pre>
4612 <dd> Reports the status of automatic dynamic reordering of
4613 BDDs and ADDs. Parameter method is set to the reordering method
4615 otherwise.
4616 <p>
4619 selected.
4620 <p>
4625 </code>
4627 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4629 <dt><pre>
4631 void <I></I>
4635 )
4636 </pre>
4637 <dd> Sets the value of the arcviolation
4638 parameter. This parameter is used in group sifting to decide how
4640 tolerable when checking for aggregation due to extended
4642 causes fewer variables to be aggregated. The default value is 0.
4643 <p>
4646 <p>
4649 </code>
4651 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4653 <dt><pre>
4655 void <I></I>
4659 )
4660 </pre>
4661 <dd> Sets the background constant of the manager. It assumes
4662 that the DdNode pointer bck is already referenced.
4663 <p>
4666 <p>
4668 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4670 <dt><pre>
4672 void <I></I>
4676 )
4677 </pre>
4678 <dd> Sets the epsilon parameter of the manager to ep. The epsilon
4679 parameter control the comparison between floating point numbers.
4680 <p>
4683 <p>
4686 </code>
4688 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4690 <dt><pre>
4692 void <I></I>
4696 )
4697 </pre>
4698 <dd> Sets the parameter groupcheck of the manager to gc. The
4699 groupcheck parameter determines the aggregation criterion in group
4700 sifting.
4701 <p>
4704 <p>
4707 </code>
4709 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4711 <dt><pre>
4713 void <I></I>
4717 )
4718 </pre>
4719 <dd> Sets the looseUpTo parameter of the manager. This
4720 parameter of the manager controls the threshold beyond which no fast
4721 growth of the unique table is allowed. The threshold is given as a
4722 number of slots. If the value passed to this function is 0, the
4723 function determines a suitable value based on the available memory.
4724 <p>
4727 <p>
4731 </code>
4733 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4735 <dt><pre>
4737 void <I></I>
4741 )
4742 </pre>
4743 <dd> Sets the maxCacheHard parameter of the manager. The
4744 cache cannot grow larger than maxCacheHard entries. This parameter
4745 allows an application to control the trade-off of memory versus
4746 speed. If the value passed to this function is 0, the function
4747 determines a suitable maximum cache size based on the available memory.
4748 <p>
4751 <p>
4755 </code>
4757 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4759 <dt><pre>
4761 void <I></I>
4765 )
4766 </pre>
4767 <dd> Sets the maxGrowthAlt parameter of the manager. This
4768 parameter is analogous to the maxGrowth paramter, and is used every
4769 given number of reorderings instead of maxGrowth. The number of
4770 reorderings is set with Cudd_SetReorderingCycle. If the number of
4771 reorderings is 0 (default) maxGrowthAlt is never used.
4772 <p>
4775 <p>
4777 <dd> <b>See Also</b> <code><a href="#Cudd_ReadMaxGrowthAlternate">Cudd_ReadMaxGrowthAlternate</a>
4781 </code>
4783 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4785 <dt><pre>
4787 void <I></I>
4791 )
4792 </pre>
4793 <dd> Sets the maxGrowth parameter of the manager. This
4794 parameter determines how much the number of nodes can grow during
4795 sifting of a variable. Overall, sifting never increases the size of
4796 the decision diagrams. This parameter only refers to intermediate
4797 results. A lower value will speed up sifting, possibly at the
4798 expense of quality.
4799 <p>
4802 <p>
4806 </code>
4808 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4810 <dt><pre>
4812 void <I></I>
4816 )
4817 </pre>
4818 <dd> Sets the maximum allowed number of live nodes. When this
4819 number is exceeded, the package returns NULL.
4820 <p>
4823 <p>
4826 </code>
4828 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4830 <dt><pre>
4832 void <I></I>
4836 )
4837 </pre>
4838 <dd> Sets the maximum allowed memory. When this
4839 number is exceeded, the package returns NULL.
4840 <p>
4843 <p>
4846 </code>
4848 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4850 <dt><pre>
4852 void <I></I>
4856 )
4857 </pre>
4858 <dd> Sets the minHit parameter of the manager. This
4859 parameter controls the resizing of the computed table. If the hit
4860 rate is larger than the specified value, and the cache is not
4861 already too large, then its size is doubled.
4862 <p>
4865 <p>
4868 </code>
4870 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4872 <dt><pre>
4874 void <I></I>
4878 )
4879 </pre>
4880 <dd> Sets the threshold for the next dynamic reordering.
4881 The threshold is in terms of number of nodes and is in effect only
4882 if reordering is enabled. The count does not include the dead nodes,
4883 unless the countDead parameter of the manager has been changed from
4884 its default setting.
4885 <p>
4888 <p>
4891 </code>
4893 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4895 <dt><pre>
4897 void <I></I>
4901 )
4902 </pre>
4903 <dd> Sets the number of crossovers used by the genetic
4904 algorithm for variable reordering. A larger number of crossovers
4905 will cause the genetic algorithm to take more time, but will
4906 generally produce better results. The default value is 0, in which
4907 case the package uses three times the number of variables as number
4908 of crossovers, with a maximum of 60.
4909 <p>
4912 <p>
4915 </code>
4917 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4919 <dt><pre>
4921 void <I></I>
4925 )
4926 </pre>
4927 <dd> Sets the size of the population used by the
4928 genetic algorithm for variable reordering. A larger population size will
4929 cause the genetic algorithm to take more time, but will generally
4930 produce better results. The default value is 0, in which case the
4931 package uses three times the number of variables as population size,
4932 with a maximum of 120.
4933 <p>
4936 <p>
4939 </code>
4941 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4943 <dt><pre>
4945 void <I></I>
4949 )
4950 </pre>
4951 <dd> Sets the value of the recombination parameter used in
4952 group sifting. A larger (positive) value makes the aggregation of
4953 variables due to the second difference criterion more likely. A
4954 smaller (negative) value makes aggregation less likely. The default
4955 value is 0.
4956 <p>
4959 <p>
4962 </code>
4964 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4966 <dt><pre>
4968 void <I></I>
4972 )
4973 </pre>
4974 <dd> Sets the reordCycle parameter of the manager. This
4975 parameter determines how often the alternate threshold on maximum
4976 growth is used in reordering.
4977 <p>
4980 <p>
4982 <dd> <b>See Also</b> <code><a href="#Cudd_ReadMaxGrowthAlternate">Cudd_ReadMaxGrowthAlternate</a>
4985 </code>
4987 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
4989 <dt><pre>
4991 void <I></I>
4995 )
4996 </pre>
4997 <dd> Sets the siftMaxSwap parameter of the manager. This
4998 parameter gives the maximum number of swaps that will be attempted
4999 for each invocation of sifting. The real number of swaps may exceed
5000 the set limit because the package will always complete the sifting
5001 of the variable that causes the limit to be reached.
5002 <p>
5005 <p>
5009 </code>
5011 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5013 <dt><pre>
5015 void <I></I>
5019 )
5020 </pre>
5021 <dd> Sets the siftMaxVar parameter of the manager. This
5022 parameter gives the maximum number of variables that will be sifted
5023 for each invocation of sifting.
5024 <p>
5027 <p>
5031 </code>
5033 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5035 <dt><pre>
5037 void <I></I>
5041 )
5042 </pre>
5043 <dd> Sets the stderr of a manager.
5044 <p>
5047 <p>
5051 </code>
5053 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5055 <dt><pre>
5057 void <I></I>
5061 )
5062 </pre>
5063 <dd> Sets the stdout of a manager.
5064 <p>
5067 <p>
5071 </code>
5073 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5075 <dt><pre>
5077 void <I></I>
5081 )
5082 </pre>
5083 <dd> Sets the value of the symmviolation
5084 parameter. This parameter is used in group sifting to decide how
5088 small value causes fewer variables to be aggregated. The default
5089 value is 0.
5090 <p>
5093 <p>
5096 </code>
5098 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5100 <dt><pre>
5102 void <I></I>
5106 )
5107 </pre>
5108 <dd> Sets the variable group tree of the manager.
5109 <p>
5112 <p>
5117 </code>
5119 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5121 <dt><pre>
5123 int <I></I>
5129 )
5130 </pre>
5131 <dd> Registers with the manager a variable mapping described
5132 by two sets of variables. This variable mapping is then used by
5133 functions like Cudd_bddVarMap. This function is convenient for
5134 those applications that perform the same mapping several times.
5135 However, if several different permutations are used, it may be more
5136 efficient not to rely on the registered mapping, because changing
5137 mapping causes the cache to be cleared. (The initial setting,
5138 however, does not clear the cache.) The two sets of variables (x and
5139 y) must have the same size (x and y). The size is given by n. The
5140 two sets of variables are normally disjoint, but this restriction is
5141 not imposeded by the function. When new variables are created, the
5142 map is automatically extended (each new variable maps to
5143 itself). The typical use, however, is to wait until all variables
5144 are created, and then create the map. Returns 1 if the mapping is
5145 successfully registered with the manager; 0 otherwise.
5146 <p>
5149 <p>
5154 </code>
5156 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
5158 <dt><pre>
5160 void <I></I>
5164 )
5165 </pre>
5166 <dd> Sets the ZDD variable group tree of the manager.
5167 <p>
5170 <p>
5175 </code>
5177 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5179 <dt><pre>
5181 int <I></I>
5185 )
5186 </pre>
5187 <dd> Counts the number of nodes in an array of DDs. Shared
5188 nodes are counted only once. Returns the total number of nodes.
5189 <p>
5192 <p>
5195 </code>
5197 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5199 <dt><pre>
5201 int <I></I>
5206 )
5207 </pre>
5208 <dd> Find the length of the shortest path(s) in a DD. f is
5209 the DD we want to get the shortest path for; weight[i] is the
5210 weight of the THEN edge coming from the node whose index is i. All
5211 ELSE edges have 0 weight. Returns the length of the shortest
5212 path(s) if such a path is found; a large number if the function is
5213 identically 0, and CUDD_OUT_OF_MEM in case of failure.
5214 <p>
5217 <p>
5220 </code>
5222 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
5224 <dt><pre>
5226 DdNode * <I></I>
5233 )
5234 </pre>
5235 <dd> Finds a shortest path in a DD. f is the DD we want to
5236 get the shortest path for; weight[i] is the weight of the THEN arc
5237 coming from the node whose index is i. If weight is NULL, then unit
5238 weights are assumed for all THEN arcs. All ELSE arcs have 0 weight.
5239 If non-NULL, both weight and support should point to arrays with at
5240 least as many entries as there are variables in the manager.
5241 Returns the shortest path as the BDD of a cube.
5242 <p>
5245 If support is NULL on entry, then Cudd_ShortestPath does not compute
5246 the true support info. length contains the length of the path.
5247 <p>
5251 </code>
5253 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
5255 <dt><pre>
5257 int <I></I>
5261 )
5262 </pre>
5263 <dd> Reorders variables according to given permutation.
5264 The i-th entry of the permutation array contains the index of the variable
5265 that should be brought to the i-th level. The size of the array should be
5266 equal or greater to the number of variables currently in use.
5268 <p>
5271 the cache.
5272 <p>
5275 </code>
5277 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
5279 <dt><pre>
5281 DdNode * <I></I>
5289 )
5290 </pre>
5292 value is the consistency condition. The y variables are the unknowns
5293 and the remaining variables are the parameters. Returns the
5294 consistency condition if successful; NULL otherwise. Cudd_SolveEqn
5295 allocates an array and fills it with the indices of the
5296 unknowns. This array is used by Cudd_VerifySol.
5297 <p>
5300 variables are returned in yIndex.
5301 <p>
5304 </code>
5306 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSolve.c"TARGET="ABSTRACT"><CODE>cuddSolve.c</CODE></A>
5308 <dt><pre>
5310 DdNode * <I></I>
5317 )
5318 </pre>
5321 to create as few extra nodes as possible. The function represented
5324 of the on-set of S if successful; NULL otherwise.
5325 <p>
5328 <p>
5330 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSplit.c"TARGET="ABSTRACT"><CODE>cuddSplit.c</CODE></A>
5332 <dt><pre>
5334 void <I></I>
5337 )
5338 </pre>
5339 <dd> Initializer for the portable number generator based on
5340 ran2 in "Numerical Recipes in C." The input is the seed for the
5341 generator. If it is negative, its absolute value is taken as seed.
5343 recurrences used to generate a long-period stream, and sets up the
5344 shuffle table.
5345 <p>
5348 <p>
5351 </code>
5353 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5355 <dt><pre>
5357 int <I></I>
5362 )
5363 </pre>
5364 <dd> Sample hook function to call after reordering.
5365 Prints on the manager's stdout final size and reordering time.
5367 <p>
5370 <p>
5373 </code>
5375 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5377 <dt><pre>
5379 int <I></I>
5384 )
5385 </pre>
5386 <dd> Sample hook function to call before reordering.
5387 Prints on the manager's stdout reordering method and initial size.
5389 <p>
5392 <p>
5395 </code>
5397 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5399 <dt><pre>
5401 DdNode * <I></I>
5407 )
5408 </pre>
5410 the ratio of number of minterms to number of nodes. Uses several
5411 techniques in series. It is more expensive than other subsetting
5412 procedures, but often produces better results. See
5413 Cudd_SubsetShortPaths for a description of the threshold and nvars
5414 parameters. Returns a pointer to the result if successful; NULL
5415 otherwise.
5416 <p>
5419 <p>
5425 </code>
5427 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
5429 <dt><pre>
5431 DdNode * <I></I>
5437 )
5438 </pre>
5439 <dd> Extracts a dense subset from a BDD. This procedure
5440 builds a subset by throwing away one of the children of each node,
5441 starting from the root, until the result is small enough. The child
5442 that is eliminated from the result is the one that contributes the
5443 fewer minterms. Returns a pointer to the BDD of the subset if
5444 successful. NULL if the procedure runs out of memory. The parameter
5445 numVars is the maximum number of variables to be used in minterm
5446 calculation and node count calculation. The optimal number should
5447 be as close as possible to the size of the support of f. However,
5448 it is safe to pass the value returned by Cudd_ReadSize for numVars
5449 when the number of variables is under 1023. If numVars is larger
5451 procedure will compute a value which will avoid overflow but will
5452 cause underflow with 2046 variables or more.
5453 <p>
5456 <p>
5461 </code>
5463 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
5465 <dt><pre>
5467 DdNode * <I></I>
5474 )
5475 </pre>
5476 <dd> Extracts a dense subset from a BDD. This procedure
5477 tries to preserve the shortest paths of the input BDD, because they
5478 give many minterms and contribute few nodes. This procedure may
5479 increase the number of nodes in trying to create the subset or
5480 reduce the number of nodes due to recombination as compared to the
5481 original BDD. Hence the threshold may not be strictly adhered to. In
5482 practice, recombination overshadows the increase in the number of
5483 nodes and results in small BDDs as compared to the threshold. The
5484 hardlimit specifies whether threshold needs to be strictly adhered
5485 to. If it is set to 1, the procedure ensures that result is never
5486 larger than the specified limit but may be considerably less than
5487 the threshold. Returns a pointer to the BDD for the subset if
5488 successful; NULL otherwise. The value for numVars should be as
5489 close as possible to the size of the support of f for better
5490 efficiency. However, it is safe to pass the value returned by
5491 Cudd_ReadSize for numVars. If 0 is passed, then the value returned
5492 by Cudd_ReadSize is used.
5493 <p>
5496 <p>
5501 </code>
5503 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
5505 <dt><pre>
5507 DdNode * <I></I>
5515 )
5516 </pre>
5517 <dd> Extracts a subset from a BDD in the following procedure.
5518 1. Compute the weight for each mask variable by counting the number of
5519 minterms for both positive and negative cofactors of the BDD with
5520 respect to each mask variable. (weight = #positive - #negative)
5521 2. Find a representative cube of the BDD by using the weight. From the
5522 top variable of the BDD, for each variable, if the weight is greater
5523 than 0.0, choose THEN branch, othereise ELSE branch, until meeting
5524 the constant 1.
5525 3. Quantify out the variables not in maskVars from the representative
5526 cube and if a variable in maskVars is don't care, replace the
5528 4. Make a subset of the BDD by multiplying with the modified cube.
5529 <p>
5532 <p>
5534 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5536 <dt><pre>
5538 DdNode * <I></I>
5544 )
5545 </pre>
5547 the ratio of number of minterms to number of nodes. Uses several
5548 techniques in series. It is more expensive than other supersetting
5549 procedures, but often produces better results. See
5550 Cudd_SupersetShortPaths for a description of the threshold and nvars
5551 parameters. Returns a pointer to the result if successful; NULL
5552 otherwise.
5553 <p>
5556 <p>
5563 </code>
5565 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
5567 <dt><pre>
5569 DdNode * <I></I>
5575 )
5576 </pre>
5577 <dd> Extracts a dense superset from a BDD. The procedure is
5578 identical to the subset procedure except for the fact that it
5579 receives the complement of the given function. Extracting the subset
5580 of the complement function is equivalent to extracting the superset
5581 of the function. This procedure builds a superset by throwing away
5582 one of the children of each node starting from the root of the
5583 complement function, until the result is small enough. The child
5584 that is eliminated from the result is the one that contributes the
5585 fewer minterms.
5586 Returns a pointer to the BDD of the superset if successful. NULL if
5587 intermediate result causes the procedure to run out of memory. The
5588 parameter numVars is the maximum number of variables to be used in
5589 minterm calculation and node count calculation. The optimal number
5590 should be as close as possible to the size of the support of f.
5591 However, it is safe to pass the value returned by Cudd_ReadSize for
5592 numVars when the number of variables is under 1023. If numVars is
5594 the procedure will compute a value which will avoid overflow but
5595 will cause underflow with 2046 variables or more.
5596 <p>
5599 <p>
5604 </code>
5606 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
5608 <dt><pre>
5610 DdNode * <I></I>
5617 )
5618 </pre>
5619 <dd> Extracts a dense superset from a BDD. The procedure is
5620 identical to the subset procedure except for the fact that it
5621 receives the complement of the given function. Extracting the subset
5622 of the complement function is equivalent to extracting the superset
5623 of the function. This procedure tries to preserve the shortest
5624 paths of the complement BDD, because they give many minterms and
5625 contribute few nodes. This procedure may increase the number of
5626 nodes in trying to create the superset or reduce the number of nodes
5627 due to recombination as compared to the original BDD. Hence the
5628 threshold may not be strictly adhered to. In practice, recombination
5629 overshadows the increase in the number of nodes and results in small
5630 BDDs as compared to the threshold. The hardlimit specifies whether
5631 threshold needs to be strictly adhered to. If it is set to 1, the
5632 procedure ensures that result is never larger than the specified
5633 limit but may be considerably less than the threshold. Returns a
5634 pointer to the BDD for the superset if successful; NULL
5635 otherwise. The value for numVars should be as close as possible to
5636 the size of the support of f for better efficiency. However, it is
5637 safe to pass the value returned by Cudd_ReadSize for numVar. If 0
5638 is passed, then the value returned by Cudd_ReadSize is used.
5639 <p>
5642 <p>
5647 </code>
5649 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
5651 <dt><pre>
5653 int * <I></I>
5657 )
5658 </pre>
5659 <dd> Finds the variables on which a DD depends. Returns an
5660 index array of the variables if successful; NULL otherwise. The
5661 size of the array equals the number of variables in the manager.
5662 Each entry of the array is 1 if the corresponding variable is in the
5663 support of the DD and 0 otherwise.
5664 <p>
5667 <p>
5672 </code>
5674 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5676 <dt><pre>
5678 int <I></I>
5682 )
5683 </pre>
5684 <dd> Counts the variables on which a DD depends.
5685 Returns the number of the variables if successful; CUDD_OUT_OF_MEM
5686 otherwise.
5687 <p>
5690 <p>
5693 </code>
5695 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5697 <dt><pre>
5699 DdNode * <I></I>
5703 )
5704 </pre>
5705 <dd> Finds the variables on which a DD depends.
5706 Returns a BDD consisting of the product of the variables if
5707 successful; NULL otherwise.
5708 <p>
5711 <p>
5715 </code>
5717 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5719 <dt><pre>
5721 void <I></I>
5726 )
5727 </pre>
5728 <dd> Prints statistics on symmetric variables.
5729 <p>
5732 <p>
5734 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
5736 <dt><pre>
5738 void <I></I>
5741 )
5742 </pre>
5743 <dd> Causes the dead nodes not to be counted towards
5744 triggering reordering. This causes less frequent reorderings. By
5745 default dead nodes are not counted. Therefore there is no need to
5746 call this function unless Cudd_TurnOnCountDead has been previously
5747 called.
5748 <p>
5751 <p>
5755 </code>
5757 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5759 <dt><pre>
5761 void <I></I>
5764 )
5765 </pre>
5766 <dd> Causes the dead nodes to be counted towards triggering
5767 reordering. This causes more frequent reorderings. By default dead
5768 nodes are not counted.
5769 <p>
5772 <p>
5776 </code>
5778 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
5780 <dt><pre>
5782 DdNode * <I></I>
5790 )
5791 </pre>
5792 <dd> Extracts a dense subset from a BDD. This procedure uses
5793 a variant of Tom Shiple's underapproximation method. The main
5794 difference from the original method is that density is used as cost
5795 function. Returns a pointer to the BDD of the subset if
5796 successful. NULL if the procedure runs out of memory. The parameter
5797 numVars is the maximum number of variables to be used in minterm
5798 calculation. The optimal number should be as close as possible to
5799 the size of the support of f. However, it is safe to pass the value
5800 returned by Cudd_ReadSize for numVars when the number of variables
5802 overflow. If a 0 parameter is passed then the procedure will compute
5803 a value which will avoid overflow but will cause underflow with 2046
5804 variables or more.
5805 <p>
5808 <p>
5813 </code>
5815 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
5817 <dt><pre>
5819 int * <I></I>
5824 )
5825 </pre>
5826 <dd> Finds the variables on which a set of DDs depends.
5827 The set must contain either BDDs and ADDs, or ZDDs.
5828 Returns an index array of the variables if successful; NULL otherwise.
5829 <p>
5832 <p>
5837 </code>
5839 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5841 <dt><pre>
5843 int <I></I>
5848 )
5849 </pre>
5850 <dd> Counts the variables on which a set of DDs depends.
5851 The set must contain either BDDs and ADDs, or ZDDs.
5852 Returns the number of the variables if successful; CUDD_OUT_OF_MEM
5853 otherwise.
5854 <p>
5857 <p>
5861 </code>
5863 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5865 <dt><pre>
5867 DdNode * <I></I>
5872 )
5873 </pre>
5874 <dd> Finds the variables on which a set of DDs depends.
5875 The set must contain either BDDs and ADDs, or ZDDs.
5876 Returns a BDD consisting of the product of the variables if
5877 successful; NULL otherwise.
5878 <p>
5881 <p>
5885 </code>
5887 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
5889 <dt><pre>
5891 DdNode * <I></I>
5898 )
5899 </pre>
5901 substitutes the solution components for the unknowns of F and returns
5902 the resulting BDD for F.
5903 <p>
5906 <p>
5909 </code>
5911 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSolve.c"TARGET="ABSTRACT"><CODE>cuddSolve.c</CODE></A>
5913 <dt><pre>
5915 DdNode * <I></I>
5921 )
5922 </pre>
5923 <dd> This function generates a BDD for the function x==y.
5926 The BDD is built bottom-up.
5929 <p>
5932 <p>
5935 </code>
5937 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
5939 <dt><pre>
5941 DdNode * <I></I>
5948 )
5949 </pre>
5953 The BDD is built bottom-up.
5956 Argument z is not used by Cudd_Xgty: it is included to make it
5957 call-compatible to Cudd_Dxygtdxz and Cudd_Dxygtdyz.
5958 <p>
5961 <p>
5966 </code>
5968 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
5970 <dt><pre>
5972 DdNode * <I></I>
5977 )
5978 </pre>
5979 <dd> Returns NULL if not a terminal case; f op g otherwise,
5980 where f op g is f if f==g; background if f!=g.
5981 <p>
5984 <p>
5987 </code>
5989 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
5991 <dt><pre>
5993 DdNode * <I></I>
5999 )
6000 </pre>
6001 <dd> Applies op to the corresponding discriminants of f and g.
6002 Returns a pointer to the result if succssful; NULL otherwise.
6003 <p>
6006 <p>
6025 </code>
6027 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6029 <dt><pre>
6031 DdNode * <I></I>
6037 )
6038 </pre>
6039 <dd> Converts an ADD to a BDD by replacing all
6040 discriminants greater than or equal to lower and less than or equal to
6042 the resulting BDD if successful; NULL otherwise.
6043 <p>
6046 <p>
6052 </code>
6054 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
6056 <dt><pre>
6058 DdNode * <I></I>
6063 )
6064 </pre>
6065 <dd> Converts an ADD to a BDD by replacing all
6067 discriminants with 0. The i-th bit refers to the integer
6068 representation of the leaf value. If the value is has a fractional
6069 part, it is ignored. Repeated calls to this procedure allow one to
6070 transform an integer-valued ADD into an array of BDDs, one for each
6071 bit of the leaf values. Returns a pointer to the resulting BDD if
6072 successful; NULL otherwise.
6073 <p>
6076 <p>
6081 </code>
6083 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
6085 <dt><pre>
6087 DdNode * <I></I>
6091 )
6092 </pre>
6093 <dd> Converts an ADD to a BDD by replacing all
6095 resulting BDD if successful; NULL otherwise.
6096 <p>
6099 <p>
6105 </code>
6107 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
6109 <dt><pre>
6111 DdNode * <I></I>
6116 )
6117 </pre>
6118 <dd> Converts an ADD to a BDD by replacing all
6119 discriminants STRICTLY greater than value with 1, and all other
6120 discriminants with 0. Returns a pointer to the resulting BDD if
6121 successful; NULL otherwise.
6122 <p>
6125 <p>
6131 </code>
6133 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
6135 <dt><pre>
6137 DdNode * <I></I>
6142 )
6143 </pre>
6144 <dd> Converts an ADD to a BDD by replacing all
6145 discriminants greater than or equal to value with 1, and all other
6146 discriminants with 0. Returns a pointer to the resulting BDD if
6147 successful; NULL otherwise.
6148 <p>
6151 <p>
6157 </code>
6159 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
6161 <dt><pre>
6163 DdNode * <I></I>
6167 )
6168 </pre>
6169 <dd> Computes the complement of an ADD a la C language: The
6171 Returns a pointer to the resulting ADD if successful; NULL otherwise.
6172 <p>
6175 <p>
6178 </code>
6180 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddIte.c"TARGET="ABSTRACT"><CODE>cuddAddIte.c</CODE></A>
6182 <dt><pre>
6184 DdNode * <I></I>
6190 )
6191 </pre>
6192 <dd> Substitutes g for x_v in the ADD for f. v is the index of the
6194 the corresponding projection function to the recursive procedure, so
6195 that the cache may be used. Returns the composed ADD if successful;
6196 NULL otherwise.
6197 <p>
6200 <p>
6203 </code>
6205 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
6207 <dt><pre>
6209 DdNode * <I></I>
6215 )
6216 </pre>
6217 <dd> Computes the cube of an array of ADD variables. If
6218 non-null, the phase argument indicates which literal of each
6219 variable should appear in the cube. If phase[i] is nonzero, then the
6220 positive literal is used. If phase is NULL, the cube is positive unate.
6221 Returns a pointer to the result if successful; NULL otherwise.
6222 <p>
6225 <p>
6228 </code>
6230 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
6232 <dt><pre>
6234 DdNode * <I></I>
6239 )
6240 </pre>
6242 ADD. List of special cases:
6243 <ul>
6249 </ul>
6250 Returns a pointer to the result if successful; NULL otherwise.
6251 <p>
6254 <p>
6257 </code>
6259 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
6261 <dt><pre>
6263 DdNode * <I></I>
6267 )
6268 </pre>
6269 <dd> Retrieves the ADD for constant c if it already
6270 exists, or creates a new ADD. Returns a pointer to the
6271 ADD if successful; NULL otherwise.
6272 <p>
6275 <p>
6279 </code>
6281 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
6283 <dt><pre>
6285 DdNode * <I></I>
6290 )
6291 </pre>
6292 <dd> Returns NULL if not a terminal case; f op g otherwise,
6293 where f op g is plusinfinity if f=g; min(f,g) if f!=g.
6294 <p>
6297 <p>
6300 </code>
6302 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6304 <dt><pre>
6306 DdNode * <I></I>
6311 )
6312 </pre>
6313 <dd> Integer and floating point division. Returns NULL if not
6314 a terminal case; f / g otherwise.
6315 <p>
6318 <p>
6321 </code>
6323 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6325 <dt><pre>
6327 DdNode * <I></I>
6332 )
6333 </pre>
6336 or may not be constant) or DD_NON_CONSTANT. If f is identically 0,
6337 the check is assumed to be successful, and the background value is
6338 returned. No new nodes are created.
6339 <p>
6342 <p>
6346 </code>
6348 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddIte.c"TARGET="ABSTRACT"><CODE>cuddAddIte.c</CODE></A>
6350 <dt><pre>
6352 DdNode * <I></I>
6357 )
6358 </pre>
6359 <dd> Abstracts all the variables in cube from f by summing
6360 over all possible values taken by the variables. Returns the
6361 abstracted ADD.
6362 <p>
6365 <p>
6370 </code>
6372 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddAbs.c"TARGET="ABSTRACT"><CODE>cuddAddAbs.c</CODE></A>
6374 <dt><pre>
6376 DdNode * <I></I>
6380 )
6381 </pre>
6382 <dd> Returns a pointer to a constant ADD.
6383 <p>
6386 <p>
6388 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddFind.c"TARGET="ABSTRACT"><CODE>cuddAddFind.c</CODE></A>
6390 <dt><pre>
6392 DdNode * <I></I>
6396 )
6397 </pre>
6398 <dd> Returns a pointer to a constant ADD.
6399 <p>
6402 <p>
6404 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddFind.c"TARGET="ABSTRACT"><CODE>cuddAddFind.c</CODE></A>
6406 <dt><pre>
6408 DdNode * <I></I>
6414 )
6415 </pre>
6416 <dd> Given a vector of ADDs, creates a new ADD by substituting the
6417 ADDs for the variables of the ADD f. vectorOn contains ADDs to be substituted
6418 for the x_v and vectorOff the ADDs to be substituted for x_v'. There should
6419 be an entry in vector for each variable in the manager. If no substitution
6420 is sought for a given variable, the corresponding projection function should
6421 be specified in the vector. This function implements simultaneous
6422 composition. Returns a pointer to the resulting ADD if successful; NULL
6423 otherwise.
6424 <p>
6427 <p>
6434 </code>
6436 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
6438 <dt><pre>
6440 DdNode * <I></I>
6446 )
6447 </pre>
6448 <dd> Computes the Hamming distance ADD. Returns an ADD that
6449 gives the Hamming distance between its two arguments if successful;
6450 NULL otherwise. The two vectors xVars and yVars identify the variables
6451 that form the two arguments.
6452 <p>
6455 <p>
6457 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
6459 <dt><pre>
6461 int <I></I>
6479 )
6480 </pre>
6481 <dd> Reads in a matrix in the format of the Harwell-Boeing
6482 benchmark suite. The variables are ordered as follows:
6483 <blockquote>
6485 </blockquote>
6486 0 is the most significant bit. On input, nx and ny hold the numbers
6487 of row and column variables already in existence. On output, they
6488 hold the numbers of row and column variables actually used by the
6489 matrix. m and n are set to the numbers of rows and columns of the
6490 matrix. Their values on input are immaterial. Returns 1 on
6491 success; 0 otherwise. The ADD for the sparse matrix is returned in
6493 <p>
6496 <p>
6500 </code>
6502 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddHarwell.c"TARGET="ABSTRACT"><CODE>cuddHarwell.c</CODE></A>
6504 <dt><pre>
6506 DdNode * <I></I>
6512 )
6513 </pre>
6515 Returns a pointer to the resulting ADD (which may or may not be
6516 constant) or DD_NON_CONSTANT. No new nodes are created. This function
6517 can be used, for instance, to check that g has a constant value
6518 (specified by h) whenever f is 1. If the constant value is unknown,
6519 then one should use Cudd_addEvalConst.
6520 <p>
6523 <p>
6528 </code>
6530 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddIte.c"TARGET="ABSTRACT"><CODE>cuddAddIte.c</CODE></A>
6532 <dt><pre>
6534 DdNode * <I></I>
6540 )
6541 </pre>
6542 <dd> Implements ITE(f,g,h). This procedure assumes that f is
6544 otherwise.
6545 <p>
6548 <p>
6553 </code>
6555 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddIte.c"TARGET="ABSTRACT"><CODE>cuddAddIte.c</CODE></A>
6557 <dt><pre>
6559 DdNode * <I></I>
6564 )
6565 </pre>
6566 <dd> Produces an ADD from another ADD by replacing all
6568 discriminants with 0. The i-th bit refers to the integer
6569 representation of the leaf value. If the value is has a fractional
6570 part, it is ignored. Repeated calls to this procedure allow one to
6571 transform an integer-valued ADD into an array of ADDs, one for each
6572 bit of the leaf values. Returns a pointer to the resulting ADD if
6573 successful; NULL otherwise.
6574 <p>
6577 <p>
6580 </code>
6582 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddFind.c"TARGET="ABSTRACT"><CODE>cuddAddFind.c</CODE></A>
6584 <dt><pre>
6586 DdNode * <I></I>
6590 )
6591 </pre>
6592 <dd> Retrieves the ADD variable with index i if it already
6593 exists, or creates a new ADD variable. Returns a pointer to the
6594 variable if successful; NULL otherwise. An ADD variable differs from
6595 a BDD variable because it points to the arithmetic zero, instead of
6596 having a complement pointer to 1.
6597 <p>
6600 <p>
6606 </code>
6608 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
6610 <dt><pre>
6612 int <I></I>
6617 )
6618 </pre>
6620 No new nodes are created. This procedure works for arbitrary ADDs.
6622 <p>
6625 <p>
6630 </code>
6632 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddIte.c"TARGET="ABSTRACT"><CODE>cuddAddIte.c</CODE></A>
6634 <dt><pre>
6636 DdNode * <I></I>
6640 )
6641 </pre>
6642 <dd> Natural logarithm of an ADDs. Returns NULL
6643 if not a terminal case; log(f) otherwise. The discriminants of f must
6644 be positive double's.
6645 <p>
6648 <p>
6651 </code>
6653 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6655 <dt><pre>
6657 DdNode * <I></I>
6664 )
6665 </pre>
6666 <dd> Calculates the product of two matrices, A and B,
6667 represented as ADDs. This procedure implements the quasiring multiplication
6668 algorithm. A is assumed to depend on variables x (rows) and z
6669 (columns). B is assumed to depend on variables z (rows) and y
6670 (columns). The product of A and B then depends on x (rows) and y
6671 (columns). Only the z variables have to be explicitly identified;
6672 they are the "summation" variables. Returns a pointer to the
6673 result if successful; NULL otherwise.
6674 <p>
6677 <p>
6682 </code>
6684 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddMatMult.c"TARGET="ABSTRACT"><CODE>cuddMatMult.c</CODE></A>
6686 <dt><pre>
6688 DdNode * <I></I>
6693 )
6694 </pre>
6695 <dd> Integer and floating point max for Cudd_addApply.
6696 Returns NULL if not a terminal case; max(f,g) otherwise.
6697 <p>
6700 <p>
6703 </code>
6705 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6707 <dt><pre>
6709 DdNode * <I></I>
6714 )
6715 </pre>
6716 <dd> Integer and floating point min for Cudd_addApply.
6717 Returns NULL if not a terminal case; min(f,g) otherwise.
6718 <p>
6721 <p>
6724 </code>
6726 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6728 <dt><pre>
6730 DdNode * <I></I>
6735 )
6736 </pre>
6737 <dd> Integer and floating point subtraction. Returns NULL if
6738 not a terminal case; f - g otherwise.
6739 <p>
6742 <p>
6745 </code>
6747 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6749 <dt><pre>
6751 DdNode * <I></I>
6756 )
6757 </pre>
6758 <dd> Applies op to the discriminants of f.
6759 Returns a pointer to the result if succssful; NULL otherwise.
6760 <p>
6763 <p>
6767 </code>
6769 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6771 <dt><pre>
6773 DdNode * <I></I>
6778 )
6779 </pre>
6781 if not a terminal case; f NAND g otherwise.
6782 <p>
6785 <p>
6788 </code>
6790 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6792 <dt><pre>
6794 DdNode * <I></I>
6798 )
6799 </pre>
6800 <dd> Computes the additive inverse of an ADD. Returns a pointer
6801 to the result if successful; NULL otherwise.
6802 <p>
6805 <p>
6808 </code>
6810 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddNeg.c"TARGET="ABSTRACT"><CODE>cuddAddNeg.c</CODE></A>
6812 <dt><pre>
6814 DdNode * <I></I>
6818 )
6819 </pre>
6820 <dd> Creates a new ADD variable. The new variable has an
6821 index equal to the largest previous index plus 1 and is positioned at
6822 the specified level in the order. Returns a pointer to the new
6823 variable if successful; NULL otherwise.
6824 <p>
6827 <p>
6832 </code>
6834 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
6836 <dt><pre>
6838 DdNode * <I></I>
6841 )
6842 </pre>
6843 <dd> Creates a new ADD variable. The new variable has an
6844 index equal to the largest previous index plus 1. Returns a
6845 pointer to the new variable if successful; NULL otherwise.
6846 An ADD variable differs from a BDD variable because it points to the
6847 arithmetic zero, instead of having a complement pointer to 1.
6848 <p>
6851 <p>
6857 </code>
6859 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
6861 <dt><pre>
6863 DdNode * <I></I>
6868 )
6869 </pre>
6872 should be an entry in vector for each variable in the manager.
6873 This function implements non-simultaneous composition. If any of the
6874 functions being composed depends on any of the variables being
6875 substituted, then the result depends on the order of composition,
6876 which in turn depends on the variable order: The variables farther from
6877 the roots in the order are substituted first.
6878 Returns a pointer to the resulting ADD if successful; NULL
6879 otherwise.
6880 <p>
6883 <p>
6888 </code>
6890 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
6892 <dt><pre>
6894 DdNode * <I></I>
6899 )
6900 </pre>
6902 if not a terminal case; f NOR g otherwise.
6903 <p>
6906 <p>
6909 </code>
6911 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6913 <dt><pre>
6915 DdNode * <I></I>
6920 )
6921 </pre>
6923 conjunction with Cudd_addApply. Returns NULL if not a terminal
6924 case.
6925 <p>
6928 <p>
6931 </code>
6933 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6935 <dt><pre>
6937 DdNode * <I></I>
6942 )
6943 </pre>
6945 by taking the disjunction over all possible values taken by the
6946 variables. Returns the abstracted ADD if successful; NULL
6947 otherwise.
6948 <p>
6951 <p>
6955 </code>
6957 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddAbs.c"TARGET="ABSTRACT"><CODE>cuddAddAbs.c</CODE></A>
6959 <dt><pre>
6961 DdNode * <I></I>
6966 )
6967 </pre>
6969 if not a terminal case; f OR g otherwise.
6970 <p>
6973 <p>
6976 </code>
6978 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
6980 <dt><pre>
6982 DdNode * <I></I>
6988 )
6989 </pre>
6990 <dd> Takes the pointwise minimum of a matrix and the outer
6991 sum of two vectors. This procedure is used in the Floyd-Warshall
6992 all-pair shortest path algorithm. Returns a pointer to the result if
6993 successful; NULL otherwise.
6994 <p>
6997 <p>
6999 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddMatMult.c"TARGET="ABSTRACT"><CODE>cuddMatMult.c</CODE></A>
7001 <dt><pre>
7003 DdNode * <I></I>
7008 )
7009 </pre>
7010 <dd> Given a permutation in array permut, creates a new ADD
7011 with permuted variables. There should be an entry in array permut
7012 for each variable in the manager. The i-th entry of permut holds the
7013 index of the variable that is to substitute the i-th
7014 variable. Returns a pointer to the resulting ADD if successful; NULL
7015 otherwise.
7016 <p>
7019 <p>
7023 </code>
7025 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
7027 <dt><pre>
7029 DdNode * <I></I>
7034 )
7035 </pre>
7036 <dd> Integer and floating point addition. Returns NULL if not
7037 a terminal case; f+g otherwise.
7038 <p>
7041 <p>
7044 </code>
7046 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
7048 <dt><pre>
7050 int <I></I>
7067 )
7068 </pre>
7069 <dd> Reads in a sparse matrix specified in a simple format.
7070 The first line of the input contains the numbers of rows and columns.
7071 The remaining lines contain the elements of the matrix, one per line.
7072 Given a background value
7073 (specified by the background field of the manager), only the values
7074 different from it are explicitly listed. Each foreground element is
7075 described by two integers, i.e., the row and column number, and a
7076 real number, i.e., the value.<p>
7077 Cudd_addRead produces an ADD that depends on two sets of variables: x
7081 The variables may already exist or may be created by the function.
7082 The index of x[i] is bx+i*sx, and the index of y[i] is by+i*sy.<p>
7083 On input, nx and ny hold the numbers
7084 of row and column variables already in existence. On output, they
7085 hold the numbers of row and column variables actually used by the
7086 matrix. When Cudd_addRead creates the variable arrays,
7087 the index of x[i] is bx+i*sx, and the index of y[i] is by+i*sy.
7088 When some variables already exist Cudd_addRead expects the indices
7089 of the existing x variables to be bx+i*sx, and the indices of the
7090 existing y variables to be by+i*sy.<p>
7091 m and n are set to the numbers of rows and columns of the
7092 matrix. Their values on input are immaterial.
7093 The ADD for the
7096 <p>
7099 variables. m and n are set to the numbers of rows and columns. x and y
7100 are possibly extended to represent the array of row and column
7101 variables. Similarly for xn and yn_, which hold on return from
7102 Cudd_addRead the complements of the row and column variables.
7103 <p>
7107 </code>
7109 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRead.c"TARGET="ABSTRACT"><CODE>cuddRead.c</CODE></A>
7111 <dt><pre>
7113 DdNode * <I></I>
7120 )
7121 </pre>
7122 <dd> Builds an ADD for the residue modulo m of an n-bit
7123 number. The modulus must be at least 2, and the number of bits at
7124 least 1. Parameter options specifies whether the MSB should be on top
7125 or the LSB; and whther the number whose residue is computed is in
7126 two's complement notation or not. The macro CUDD_RESIDUE_DEFAULT
7127 specifies LSB on top and unsigned number. The macro CUDD_RESIDUE_MSB
7128 specifies MSB on top, and the macro CUDD_RESIDUE_TC specifies two's
7129 complement residue. To request MSB on top and two's complement residue
7130 simultaneously, one can OR the two macros:
7131 CUDD_RESIDUE_MSB | CUDD_RESIDUE_TC.
7132 Cudd_addResidue returns a pointer to the resulting ADD if successful;
7133 NULL otherwise.
7134 <p>
7137 <p>
7139 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddWalsh.c"TARGET="ABSTRACT"><CODE>cuddAddWalsh.c</CODE></A>
7141 <dt><pre>
7143 DdNode * <I></I>
7148 )
7149 </pre>
7150 <dd> ADD restrict according to Coudert and Madre's algorithm
7151 (ICCAD90). Returns the restricted ADD if successful; otherwise NULL.
7152 If application of restrict results in an ADD larger than the input
7153 ADD, the input ADD is returned.
7154 <p>
7157 <p>
7161 </code>
7163 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
7165 <dt><pre>
7167 DdNode * <I></I>
7172 )
7173 </pre>
7174 <dd> Rounds off the discriminants of an ADD. The discriminants are
7175 rounded off to N digits after the decimal. Returns a pointer to the result
7176 ADD if successful; NULL otherwise.
7177 <p>
7180 <p>
7182 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddNeg.c"TARGET="ABSTRACT"><CODE>cuddAddNeg.c</CODE></A>
7184 <dt><pre>
7186 DdNode * <I></I>
7191 )
7192 </pre>
7193 <dd> Computes an n ADD where the discriminants are the
7194 multiplicative inverses of the corresponding discriminants of the
7195 argument ADD. Returns a pointer to the resulting ADD in case of
7196 success. Returns NULL if any discriminants smaller than epsilon is
7197 encountered.
7198 <p>
7201 <p>
7203 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddInv.c"TARGET="ABSTRACT"><CODE>cuddAddInv.c</CODE></A>
7205 <dt><pre>
7207 DdNode * <I></I>
7212 )
7213 </pre>
7215 Returns NULL if not a terminal case; f op g otherwise.
7216 <p>
7219 <p>
7222 </code>
7224 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
7226 <dt><pre>
7228 DdNode * <I></I>
7235 )
7236 </pre>
7237 <dd> Swaps two sets of variables of the same size (x and y) in
7238 the ADD f. The size is given by n. The two sets of variables are
7239 assumed to be disjoint. Returns a pointer to the resulting ADD if
7240 successful; NULL otherwise.
7241 <p>
7244 <p>
7248 </code>
7250 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
7252 <dt><pre>
7254 DdNode * <I></I>
7259 )
7260 </pre>
7262 Returns NULL if not a terminal case; f op g otherwise.
7263 <p>
7266 <p>
7269 </code>
7271 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
7273 <dt><pre>
7275 DdNode * <I></I>
7282 )
7283 </pre>
7284 <dd> Calculates the product of two matrices, A and B,
7285 represented as ADDs, using the CMU matrix by matrix multiplication
7286 procedure by Clarke et al.. Matrix A has x's as row variables and z's
7287 as column variables, while matrix B has z's as row variables and y's
7288 as column variables. Returns the pointer to the result if successful;
7289 NULL otherwise. The resulting matrix has x's as row variables and y's
7290 as column variables.
7291 <p>
7294 <p>
7297 </code>
7299 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddMatMult.c"TARGET="ABSTRACT"><CODE>cuddMatMult.c</CODE></A>
7301 <dt><pre>
7303 DdNode * <I></I>
7308 )
7309 </pre>
7310 <dd> Integer and floating point multiplication. Returns NULL
7311 if not a terminal case; f * g otherwise. This function can be used also
7313 <p>
7316 <p>
7319 </code>
7321 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
7323 <dt><pre>
7325 DdNode * <I></I>
7332 )
7333 </pre>
7334 <dd> Implements the semiring multiplication algorithm used in
7335 the triangulation step for the shortest path computation. f
7336 is assumed to depend on variables x (rows) and z (columns). g is
7337 assumed to depend on variables z (rows) and y (columns). The product
7338 of f and g then depends on x (rows) and y (columns). Only the z
7339 variables have to be explicitly identified; they are the
7340 "abstraction" variables. Returns a pointer to the result if
7341 successful; NULL otherwise.
7342 <p>
7345 <p>
7349 </code>
7351 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddMatMult.c"TARGET="ABSTRACT"><CODE>cuddMatMult.c</CODE></A>
7353 <dt><pre>
7355 DdNode * <I></I>
7360 )
7361 </pre>
7362 <dd> Abstracts all the variables in cube from f by taking
7363 the product over all possible values taken by the variable. Returns
7364 the abstracted ADD if successful; NULL otherwise.
7365 <p>
7368 <p>
7373 </code>
7375 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddAbs.c"TARGET="ABSTRACT"><CODE>cuddAddAbs.c</CODE></A>
7377 <dt><pre>
7379 DdNode * <I></I>
7384 )
7385 </pre>
7388 should be an entry in vector for each variable in the manager.
7389 If no substitution is sought for a given variable, the corresponding
7390 projection function should be specified in the vector.
7391 This function implements simultaneous composition.
7392 Returns a pointer to the resulting ADD if successful; NULL
7393 otherwise.
7394 <p>
7397 <p>
7403 </code>
7405 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
7407 <dt><pre>
7409 DdNode * <I></I>
7415 )
7416 </pre>
7417 <dd> Generates a Walsh matrix in ADD form. Returns a pointer
7418 to the matrixi if successful; NULL otherwise.
7419 <p>
7422 <p>
7424 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddWalsh.c"TARGET="ABSTRACT"><CODE>cuddAddWalsh.c</CODE></A>
7426 <dt><pre>
7428 DdNode * <I></I>
7434 )
7435 </pre>
7436 <dd> This function generates an ADD for the function x==y.
7439 The ADD is built bottom-up.
7442 <p>
7445 <p>
7448 </code>
7450 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
7452 <dt><pre>
7454 DdNode * <I></I>
7459 )
7460 </pre>
7462 if not a terminal case; f XNOR g otherwise.
7463 <p>
7466 <p>
7469 </code>
7471 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
7473 <dt><pre>
7475 DdNode * <I></I>
7480 )
7481 </pre>
7483 if not a terminal case; f XOR g otherwise.
7484 <p>
7487 <p>
7490 </code>
7492 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
7494 <dt><pre>
7496 DdNode * <I></I>
7502 )
7503 </pre>
7504 <dd> Rearranges a set of variables in the BDD B. The size of
7505 the set is given by n. This procedure is intended for the
7506 `randomization' of the priority functions. Returns a pointer to the
7507 BDD if successful; NULL otherwise.
7508 <p>
7511 <p>
7518 </code>
7520 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
7522 <dt><pre>
7524 DdNode * <I></I>
7531 )
7532 </pre>
7533 <dd> Takes the AND of two BDDs and simultaneously abstracts
7534 the variables in cube. The variables are existentially abstracted.
7535 Returns a pointer to the result is successful; NULL otherwise.
7536 In particular, if the number of new nodes created exceeds
7538 <p>
7541 <p>
7544 </code>
7546 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAndAbs.c"TARGET="ABSTRACT"><CODE>cuddAndAbs.c</CODE></A>
7548 <dt><pre>
7550 DdNode * <I></I>
7556 )
7557 </pre>
7558 <dd> Takes the AND of two BDDs and simultaneously abstracts
7559 the variables in cube. The variables are existentially abstracted.
7560 Returns a pointer to the result is successful; NULL otherwise.
7561 Cudd_bddAndAbstract implements the semiring matrix multiplication
7562 algorithm for the boolean semiring.
7563 <p>
7566 <p>
7571 </code>
7573 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAndAbs.c"TARGET="ABSTRACT"><CODE>cuddAndAbs.c</CODE></A>
7575 <dt><pre>
7577 DdNode * <I></I>
7583 )
7584 </pre>
7585 <dd> Computes the conjunction of two BDDs f and g. Returns a
7586 pointer to the resulting BDD if successful; NULL if the intermediate
7588 required.
7589 <p>
7592 <p>
7595 </code>
7597 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
7599 <dt><pre>
7601 DdNode * <I></I>
7606 )
7607 </pre>
7608 <dd> Computes the conjunction of two BDDs f and g. Returns a
7609 pointer to the resulting BDD if successful; NULL if the intermediate
7610 result blows up.
7611 <p>
7614 <p>
7625 </code>
7627 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
7629 <dt><pre>
7631 int <I></I>
7636 )
7637 </pre>
7638 <dd> Performs two-way conjunctive decomposition of a
7639 BDD. This procedure owes its name to the use of supersetting to
7640 obtain an initial factor of the given function. Returns the number
7642 decomposition was found; 0 otherwise. The conjuncts produced by this
7643 procedure tend to be imbalanced.
7644 <p>
7647 The array is allocated by this function. It is the caller's responsibility
7648 to free it. On successful completion, the conjuncts are already
7649 referenced. If the function returns 0, the array for the conjuncts is
7650 not allocated. If the function returns 1, the only factor equals the
7651 function to be decomposed.
7652 <p>
7661 </code>
7663 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
7665 <dt><pre>
7667 int <I></I>
7672 )
7673 </pre>
7674 <dd> Performs two-way disjunctive decomposition of a BDD.
7675 Returns the number of disjuncts produced, that is, 2 if successful;
7677 disjuncts produced by this procedure tend to be imbalanced.
7678 <p>
7681 The array is allocated by this function. It is the caller's responsibility
7682 to free it. On successful completion, the disjuncts are already
7683 referenced. If the function returns 0, the array for the disjuncts is
7684 not allocated. If the function returns 1, the only factor equals the
7685 function to be decomposed.
7686 <p>
7692 </code>
7694 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
7696 <dt><pre>
7698 int <I></I>
7702 )
7703 </pre>
7704 <dd> This function sets a flag to prevent sifting of a
7706 variable index).
7707 <p>
7710 <p>
7713 </code>
7715 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
7717 <dt><pre>
7719 DdNode * <I></I>
7724 )
7725 </pre>
7726 <dd> Computes the boolean difference of f with respect to the
7727 variable with index x. Returns the BDD of the boolean difference if
7728 successful; NULL otherwise.
7729 <p>
7732 <p>
7734 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
7736 <dt><pre>
7738 DdNode ** <I></I>
7742 )
7743 </pre>
7744 <dd> Computes a vector of BDDs whose image equals a non-zero
7745 function.
7746 The result depends on the variable order. The i-th component of the vector
7747 depends only on the first i variables in the order. Each BDD in the vector
7748 is not larger than the BDD of the given characteristic function. This
7749 function is based on the description of char-to-vect in "Verification of
7750 Sequential Machines Using Boolean Functional Vectors" by O. Coudert, C.
7751 Berthet and J. C. Madre.
7752 Returns a pointer to an array containing the result if successful; NULL
7753 otherwise. The size of the array equals the number of variables in the
7754 manager. The components of the solution have their reference counts
7755 already incremented (unlike the results of most other functions in
7756 the package).
7757 <p>
7760 <p>
7763 </code>
7765 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
7767 <dt><pre>
7769 DdNode * <I></I>
7777 )
7778 </pre>
7779 <dd> Approximates the conjunction of two BDDs f and g and
7780 simultaneously abstracts the variables in cube. The variables are
7781 existentially abstracted. Returns a pointer to the resulting BDD if
7782 successful; NULL if the intermediate result blows up.
7783 <p>
7786 <p>
7790 </code>
7792 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddClip.c"TARGET="ABSTRACT"><CODE>cuddClip.c</CODE></A>
7794 <dt><pre>
7796 DdNode * <I></I>
7803 )
7804 </pre>
7805 <dd> Approximates the conjunction of two BDDs f and g. Returns a
7806 pointer to the resulting BDD if successful; NULL if the intermediate
7807 result blows up.
7808 <p>
7811 <p>
7814 </code>
7816 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddClip.c"TARGET="ABSTRACT"><CODE>cuddClip.c</CODE></A>
7818 <dt><pre>
7820 DdNode * <I></I>
7826 )
7827 </pre>
7828 <dd> Finds a cube of f at minimum Hamming distance from the
7829 minterms of g. All the minterms of the cube are at the minimum
7830 distance. If the distance is 0, the cube belongs to the
7831 intersection of f and g. Returns the cube if successful; NULL
7832 otherwise.
7833 <p>
7836 <p>
7839 </code>
7841 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
7843 <dt><pre>
7845 DdNode * <I></I>
7851 )
7852 </pre>
7853 <dd> Substitutes g for x_v in the BDD for f. v is the index of the
7854 variable to be substituted. Cudd_bddCompose passes the corresponding
7855 projection function to the recursive procedure, so that the cache may
7856 be used. Returns the composed BDD if successful; NULL otherwise.
7857 <p>
7860 <p>
7863 </code>
7865 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
7867 <dt><pre>
7869 DdNode * <I></I>
7875 )
7876 </pre>
7877 <dd> Computes the cube of an array of BDD variables. If
7878 non-null, the phase argument indicates which literal of each
7879 variable should appear in the cube. If phase[i] is nonzero, then the
7880 positive literal is used. If phase is NULL, the cube is positive unate.
7881 Returns a pointer to the result if successful; NULL otherwise.
7882 <p>
7885 <p>
7890 </code>
7892 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
7894 <dt><pre>
7896 DdNode ** <I></I>
7900 )
7901 </pre>
7902 <dd> BDD conjunctive decomposition as in McMillan's CAV96
7903 paper. The decomposition is canonical only for a given variable
7904 order. If canonicity is required, variable ordering must be disabled
7905 after the decomposition has been computed. Returns an array with one
7906 entry for each BDD variable in the manager if successful; otherwise
7907 NULL. The components of the solution have their reference counts
7908 already incremented (unlike the results of most other functions in
7909 the package.
7910 <p>
7913 <p>
7917 </code>
7919 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
7921 <dt><pre>
7923 DdNode * <I></I>
7928 )
7929 </pre>
7930 <dd> Computes f constrain c (f @ c).
7931 Uses a canonical form: (f' @ c) = ( f @ c)'. (Note: this is not true
7932 for c.) List of special cases:
7933 <ul>
7940 </ul>
7941 Returns a pointer to the result if successful; NULL otherwise. Note that if
7942 F=(f1,...,fn) and reordering takes place while computing F @ c, then the
7943 image restriction property (Img(F,c) = Img(F @ c)) is lost.
7944 <p>
7947 <p>
7951 </code>
7953 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
7955 <dt><pre>
7957 double <I></I>
7963 )
7964 </pre>
7965 <dd> Computes the correlation of f and g for given input
7966 probabilities. On input, prob[i] is supposed to contain the
7967 probability of the i-th input variable to be 1.
7968 If f == g, their correlation is 1. If f == g', their
7969 correlation is 0. Returns the probability that f and g have the same
7970 value. If it runs out of memory, returns (double)CUDD_OUT_OF_MEM. The
7971 correlation of f and the constant one gives the probability of f.
7972 <p>
7975 <p>
7978 </code>
7980 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddCorr.c"TARGET="ABSTRACT"><CODE>cuddBddCorr.c</CODE></A>
7982 <dt><pre>
7984 double <I></I>
7989 )
7990 </pre>
7991 <dd> Computes the correlation of f and g. If f == g, their
7993 fraction of minterms in the ON-set of the EXNOR of f and g. If it
7994 runs out of memory, returns (double)CUDD_OUT_OF_MEM.
7995 <p>
7998 <p>
8000 <dd> <b>See Also</b> <code><a href="#Cudd_bddCorrelationWeights">Cudd_bddCorrelationWeights</a>
8001 </code>
8003 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddCorr.c"TARGET="ABSTRACT"><CODE>cuddBddCorr.c</CODE></A>
8005 <dt><pre>
8007 DdNode * <I></I>
8012 )
8013 </pre>
8014 <dd> Existentially abstracts all the variables in cube from f.
8015 Returns the abstracted BDD if successful; NULL otherwise.
8016 <p>
8019 <p>
8023 </code>
8025 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
8027 <dt><pre>
8029 int <I></I>
8034 )
8035 </pre>
8036 <dd> Performs two-way conjunctive decomposition of a
8037 BDD. This procedure owes its name to the fact tht it generalizes the
8038 decomposition based on the cofactors with respect to one
8039 variable. Returns the number of conjuncts produced, that is, 2 if
8041 otherwise. The conjuncts produced by this procedure tend to be
8042 balanced.
8043 <p>
8046 The array is allocated by this function. It is the caller's responsibility
8047 to free it. On successful completion, the conjuncts are already
8048 referenced. If the function returns 0, the array for the conjuncts is
8049 not allocated. If the function returns 1, the only factor equals the
8050 function to be decomposed.
8051 <p>
8057 </code>
8059 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
8061 <dt><pre>
8063 int <I></I>
8068 )
8069 </pre>
8070 <dd> Performs two-way disjunctive decomposition of a BDD.
8071 Returns the number of disjuncts produced, that is, 2 if successful;
8073 disjuncts produced by this procedure tend to be balanced.
8074 <p>
8077 The array is allocated by this function. It is the caller's responsibility
8078 to free it. On successful completion, the disjuncts are already
8079 referenced. If the function returns 0, the array for the disjuncts is
8080 not allocated. If the function returns 1, the only factor equals the
8081 function to be decomposed.
8082 <p>
8088 </code>
8090 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
8092 <dt><pre>
8094 DdNode * <I></I>
8099 )
8100 </pre>
8101 <dd> Computes a function included in the intersection of f and
8102 g. (That is, a witness that the intersection is not empty.)
8103 Cudd_bddIntersect tries to build as few new nodes as possible. If the
8104 only result of interest is whether f and g intersect,
8105 Cudd_bddLeq should be used instead.
8106 <p>
8109 <p>
8113 </code>
8115 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
8117 <dt><pre>
8119 DdNode * <I></I>
8126 )
8127 </pre>
8128 <dd> This function generates a BDD for the function
8131 The number of variables N should be sufficient to represent the bounds;
8132 otherwise, the bounds are truncated to their N least significant bits.
8134 are finally conjoined.
8135 <p>
8138 <p>
8141 </code>
8143 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
8145 <dt><pre>
8147 int <I></I>
8151 )
8152 </pre>
8154 the variable's type is present state; 0 if the variable exists but is
8155 not a present state; -1 if the variable does not exist.
8156 <p>
8159 <p>
8164 </code>
8166 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8168 <dt><pre>
8170 int <I></I>
8174 )
8175 </pre>
8177 the variable's type is primary input; 0 if the variable exists but is
8178 not a primary input; -1 if the variable does not exist.
8179 <p>
8182 <p>
8187 </code>
8189 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8191 <dt><pre>
8193 int <I></I>
8197 )
8198 </pre>
8200 the variable's type is present state; 0 if the variable exists but is
8201 not a present state; -1 if the variable does not exist.
8202 <p>
8205 <p>
8210 </code>
8212 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8214 <dt><pre>
8216 int <I></I>
8222 )
8223 </pre>
8224 <dd> Determines whether a given variable is essential with a
8226 and f-->x_id, or if phase == 0 and f-->x_id'.
8227 <p>
8230 <p>
8233 </code>
8235 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
8237 <dt><pre>
8239 int <I></I>
8243 )
8244 </pre>
8245 <dd> Checks whether a variable is set to be in a hard group. This
8246 function is used for lazy sifting. Returns 1 if the variable is marked
8247 to be in a hard group; 0 if the variable exists, but it is not marked to be
8248 in a hard group; -1 if the variable does not exist.
8249 <p>
8252 <p>
8255 </code>
8257 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8259 <dt><pre>
8261 int <I></I>
8265 )
8266 </pre>
8267 <dd> Checks whether a variable is set to be grouped. This
8268 function is used for lazy sifting.
8269 <p>
8272 <p>
8274 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8276 <dt><pre>
8278 int <I></I>
8282 )
8283 </pre>
8284 <dd> Checks whether a variable is set to be ungrouped. This
8285 function is used for lazy sifting. Returns 1 if the variable is marked
8286 to be ungrouped; 0 if the variable exists, but it is not marked to be
8287 ungrouped; -1 if the variable does not exist.
8288 <p>
8291 <p>
8293 <dd> <b>See Also</b> <code><a href="#Cudd_bddSetVarToBeUngrouped">Cudd_bddSetVarToBeUngrouped</a>
8294 </code>
8296 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8298 <dt><pre>
8300 DdNode * <I></I>
8305 )
8306 </pre>
8307 <dd> Computes a BDD in the interval between L and U with a
8308 simple sum-of-produuct cover. This procedure is similar to
8309 Cudd_zddIsop, but it does not return the ZDD for the cover. Returns
8310 a pointer to the BDD if successful; NULL otherwise.
8311 <p>
8314 <p>
8317 </code>
8319 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddIsop.c"TARGET="ABSTRACT"><CODE>cuddZddIsop.c</CODE></A>
8321 <dt><pre>
8323 DdNode * <I></I>
8329 )
8330 </pre>
8331 <dd> Implements ITEconstant(f,g,h). Returns a pointer to the
8332 resulting BDD (which may or may not be constant) or DD_NON_CONSTANT.
8333 No new nodes are created.
8334 <p>
8337 <p>
8343 </code>
8345 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
8347 <dt><pre>
8349 int <I></I>
8354 )
8355 </pre>
8356 <dd> Performs two-way conjunctive decomposition of a
8357 BDD. This procedure owes its name to the iterated use of
8358 supersetting to obtain a factor of the given function. Returns the
8360 meaningful decomposition was found; 0 otherwise. The conjuncts
8361 produced by this procedure tend to be imbalanced.
8362 <p>
8365 The array is allocated by this function. It is the caller's responsibility
8366 to free it. On successful completion, the conjuncts are already
8367 referenced. If the function returns 0, the array for the conjuncts is
8368 not allocated. If the function returns 1, the only factor equals the
8369 function to be decomposed.
8370 <p>
8379 </code>
8381 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
8383 <dt><pre>
8385 int <I></I>
8390 )
8391 </pre>
8392 <dd> Performs two-way disjunctive decomposition of a BDD.
8393 Returns the number of disjuncts produced, that is, 2 if successful;
8395 disjuncts produced by this procedure tend to be imbalanced.
8396 <p>
8399 The array is allocated by this function. It is the caller's responsibility
8400 to free it. On successful completion, the disjuncts are already
8401 referenced. If the function returns 0, the array for the disjuncts is
8402 not allocated. If the function returns 1, the only factor equals the
8403 function to be decomposed.
8404 <p>
8410 </code>
8412 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
8414 <dt><pre>
8416 DdNode * <I></I>
8422 )
8423 </pre>
8424 <dd> Implements ITE(f,g,h). Returns a pointer to the
8425 resulting BDD if successful; NULL if the intermediate result blows
8426 up.
8427 <p>
8430 <p>
8435 </code>
8437 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
8439 <dt><pre>
8441 DdNode * <I></I>
8445 )
8446 </pre>
8447 <dd> Retrieves the BDD variable with index i if it already
8448 exists, or creates a new BDD variable. Returns a pointer to the
8449 variable if successful; NULL otherwise.
8450 <p>
8453 <p>
8459 </code>
8461 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8463 <dt><pre>
8465 DdNode * <I></I>
8470 )
8471 </pre>
8472 <dd> Performs safe minimization of a BDD. Given the BDD
8477 of the result is guaranteed not to exceed the size of
8479 al.. Returns a pointer to the result if successful; NULL
8480 otherwise.
8481 <p>
8484 <p>
8487 </code>
8489 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
8491 <dt><pre>
8493 int <I></I>
8499 )
8500 </pre>
8501 <dd> Tells whether f is less than of equal to G unless D is
8503 of equal to G, and 0 otherwise. No new nodes are created.
8504 <p>
8507 <p>
8512 </code>
8514 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
8516 <dt><pre>
8518 int <I></I>
8523 )
8524 </pre>
8526 No new nodes are created.
8527 <p>
8530 <p>
8534 </code>
8536 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
8538 <dt><pre>
8540 DdNode * <I></I>
8545 )
8546 </pre>
8547 <dd> Computes the intesection of two sets of literals
8548 represented as BDDs. Each set is represented as a cube of the
8549 literals in the set. The empty set is represented by the constant 1.
8550 No variable can be simultaneously present in both phases in a set.
8551 Returns a pointer to the BDD representing the intersected sets, if
8552 successful; NULL otherwise.
8553 <p>
8556 <p>
8558 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLiteral.c"TARGET="ABSTRACT"><CODE>cuddLiteral.c</CODE></A>
8560 <dt><pre>
8562 DdNode * <I></I>
8567 )
8568 </pre>
8569 <dd> Expands cube to a prime implicant of f. Returns the prime
8570 if successful; NULL otherwise. In particular, NULL is returned if cube
8571 is not a real cube or is not an implicant of f.
8572 <p>
8575 <p>
8577 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
8579 <dt><pre>
8581 DdNode * <I></I>
8586 )
8587 </pre>
8590 otherwise.
8591 <p>
8594 <p>
8599 </code>
8601 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
8603 <dt><pre>
8605 DdNode * <I></I>
8610 )
8611 </pre>
8612 <dd> Computes f non-polluting-and g. The non-polluting AND
8613 of f and g is a hybrid of AND and Restrict. From Restrict, this
8614 operation takes the idea of existentially quantifying the top
8615 variable of the second operand if it does not appear in the first.
8616 Therefore, the variables that appear in the result also appear in f.
8617 For the rest, the function behaves like AND. Since the two operands
8618 play different roles, non-polluting AND is not commutative.
8620 Returns a pointer to the result if successful; NULL otherwise.
8621 <p>
8624 <p>
8628 </code>
8630 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
8632 <dt><pre>
8634 DdNode * <I></I>
8639 )
8640 </pre>
8641 <dd> Computes the NAND of two BDDs f and g. Returns a
8642 pointer to the resulting BDD if successful; NULL if the intermediate
8643 result blows up.
8644 <p>
8647 <p>
8656 </code>
8658 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
8660 <dt><pre>
8662 DdNode * <I></I>
8666 )
8667 </pre>
8668 <dd> Creates a new BDD variable. The new variable has an
8669 index equal to the largest previous index plus 1 and is positioned at
8670 the specified level in the order. Returns a pointer to the new
8671 variable if successful; NULL otherwise.
8672 <p>
8675 <p>
8680 </code>
8682 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8684 <dt><pre>
8686 DdNode * <I></I>
8689 )
8690 </pre>
8691 <dd> Creates a new BDD variable. The new variable has an
8692 index equal to the largest previous index plus 1. Returns a
8693 pointer to the new variable if successful; NULL otherwise.
8694 <p>
8697 <p>
8702 </code>
8704 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8706 <dt><pre>
8708 DdNode * <I></I>
8713 )
8714 </pre>
8715 <dd> Computes the NOR of two BDDs f and g. Returns a
8716 pointer to the resulting BDD if successful; NULL if the intermediate
8717 result blows up.
8718 <p>
8721 <p>
8730 </code>
8732 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
8734 <dt><pre>
8736 DdNode * <I></I>
8741 )
8742 </pre>
8743 <dd> Computes the disjunction of two BDDs f and g. Returns a
8744 pointer to the resulting BDD if successful; NULL if the intermediate
8745 result blows up.
8746 <p>
8749 <p>
8758 </code>
8760 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
8762 <dt><pre>
8764 DdNode * <I></I>
8769 )
8770 </pre>
8771 <dd> Given a permutation in array permut, creates a new BDD
8772 with permuted variables. There should be an entry in array permut
8773 for each variable in the manager. The i-th entry of permut holds the
8774 index of the variable that is to substitute the i-th variable.
8775 Returns a pointer to the resulting BDD if successful; NULL
8776 otherwise.
8777 <p>
8780 <p>
8784 </code>
8786 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
8788 <dt><pre>
8790 DdNode ** <I></I>
8797 )
8798 </pre>
8799 <dd> Picks k on-set minterms evenly distributed from given DD.
8803 built by this procedure may not be contained in
8805 pointer to it if successful; NULL otherwise. There are three reasons
8806 why the procedure may fail:
8807 <ul>
8808 <li> It may run out of memory;
8811 </ul>
8812 <p>
8815 <p>
8819 </code>
8821 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
8823 <dt><pre>
8825 int <I></I>
8830 )
8831 </pre>
8832 <dd> Picks one on-set cube randomly from the given DD. The
8833 cube is written into an array of characters. The array must have at
8834 least as many entries as there are variables. Returns 1 if
8835 successful; 0 otherwise.
8836 <p>
8839 <p>
8842 </code>
8844 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
8846 <dt><pre>
8848 DdNode * <I></I>
8854 )
8855 </pre>
8856 <dd> Picks one on-set minterm randomly from the given
8860 built by this procedure may not be contained in
8862 to it if successful; NULL otherwise. There are three reasons why the
8863 procedure may fail:
8864 <ul>
8865 <li> It may run out of memory;
8868 </ul>
8869 <p>
8872 <p>
8875 </code>
8877 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
8879 <dt><pre>
8881 int <I></I>
8886 )
8887 </pre>
8888 <dd> Prints a sum of product cover for an incompletely
8889 specified function given by a lower bound and an upper bound. Each
8890 product is a prime implicant obtained by expanding the product
8891 corresponding to a path from node to the constant one. Uses the
8893 <p>
8896 <p>
8899 </code>
8901 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
8903 <dt><pre>
8905 int <I></I>
8909 )
8910 </pre>
8911 <dd> Reads a corresponding pair index for a given index.
8912 These pair indices are present and next state variable. Returns the
8913 corresponding variable index if the variable exists; -1 otherwise.
8914 <p>
8917 <p>
8920 </code>
8922 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
8924 <dt><pre>
8926 int <I></I>
8941 )
8942 </pre>
8943 <dd> Reads in a graph (without labels) given as an adjacency
8944 matrix. The first line of the input contains the numbers of rows and
8945 columns of the adjacency matrix. The remaining lines contain the arcs
8946 of the graph, one per line. Each arc is described by two integers,
8947 i.e., the row and column number, or the indices of the two endpoints.
8948 Cudd_bddRead produces a BDD that depends on two sets of variables: x
8952 indices.
8953 The variables may already exist or may be created by the function.
8954 The index of x[i] is bx+i*sx, and the index of y[i] is by+i*sy.<p>
8955 On input, nx and ny hold the numbers of row and column variables already
8956 in existence. On output, they hold the numbers of row and column
8957 variables actually used by the matrix. When Cudd_bddRead creates the
8958 variable arrays, the index of x[i] is bx+i*sx, and the index of
8959 y[i] is by+i*sy. When some variables already exist, Cudd_bddRead
8960 expects the indices of the existing x variables to be bx+i*sx, and the
8961 indices of the existing y variables to be by+i*sy.<p>
8962 m and n are set to the numbers of rows and columns of the
8963 matrix. Their values on input are immaterial. The BDD for the graph
8966 <p>
8969 variables. m and n are set to the numbers of rows and columns. x and y
8970 are possibly extended to represent the array of row and column
8971 variables.
8972 <p>
8976 </code>
8978 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRead.c"TARGET="ABSTRACT"><CODE>cuddRead.c</CODE></A>
8980 <dt><pre>
8982 void <I></I>
8985 )
8986 </pre>
8987 <dd> Disables realignment of ZDD order to BDD order.
8988 <p>
8991 <p>
8997 </code>
8999 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9001 <dt><pre>
9003 void <I></I>
9006 )
9007 </pre>
9008 <dd> Enables realignment of the BDD variable order to the
9009 ZDD variable order after the ZDDs have been reordered. The
9010 number of ZDD variables must be a multiple of the number of BDD
9011 variables for realignment to make sense. If this condition is not met,
9013 ratio of the two numbers. For the purpose of realignment, the ZDD
9016 is initially disabled.
9017 <p>
9020 <p>
9027 </code>
9029 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9031 <dt><pre>
9033 int <I></I>
9036 )
9037 </pre>
9039 enabled; 0 otherwise.
9040 <p>
9043 <p>
9049 </code>
9051 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9053 <dt><pre>
9055 int <I></I>
9059 )
9060 </pre>
9061 <dd> Resets a variable not to be grouped. This function is
9063 <p>
9066 <p>
9070 </code>
9072 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9074 <dt><pre>
9076 DdNode * <I></I>
9081 )
9082 </pre>
9083 <dd> BDD restrict according to Coudert and Madre's algorithm
9084 (ICCAD90). Returns the restricted BDD if successful; otherwise NULL.
9085 If application of restrict results in a BDD larger than the input
9086 BDD, the input BDD is returned.
9087 <p>
9090 <p>
9094 </code>
9096 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
9098 <dt><pre>
9100 int <I></I>
9104 )
9105 </pre>
9106 <dd> Sets a variable type to next state. The variable type is
9108 <p>
9111 <p>
9116 </code>
9118 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9120 <dt><pre>
9122 int <I></I>
9127 )
9128 </pre>
9129 <dd> Sets a corresponding pair index for a given index.
9130 These pair indices are present and next state variable. Returns 1 if
9131 successful; 0 otherwise.
9132 <p>
9135 <p>
9138 </code>
9140 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9142 <dt><pre>
9144 int <I></I>
9148 )
9149 </pre>
9150 <dd> Sets a variable type to primary input. The variable type is
9152 <p>
9155 <p>
9160 </code>
9162 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9164 <dt><pre>
9166 int <I></I>
9170 )
9171 </pre>
9172 <dd> Sets a variable type to present state. The variable type is
9174 <p>
9177 <p>
9182 </code>
9184 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9186 <dt><pre>
9188 int <I></I>
9192 )
9193 </pre>
9194 <dd> Sets a variable to be a hard group. This function is used
9196 <p>
9199 <p>
9204 </code>
9206 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9208 <dt><pre>
9210 int <I></I>
9214 )
9215 </pre>
9216 <dd> Sets a variable to be grouped. This function is used for
9218 <p>
9221 <p>
9225 </code>
9227 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9229 <dt><pre>
9231 int <I></I>
9235 )
9236 </pre>
9237 <dd> Sets a variable to be ungrouped. This function is used
9239 <p>
9242 <p>
9244 <dd> <b>See Also</b> <code><a href="#Cudd_bddIsVarToBeUngrouped">Cudd_bddIsVarToBeUngrouped</a>
9245 </code>
9247 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9249 <dt><pre>
9251 DdNode * <I></I>
9256 )
9257 </pre>
9258 <dd> Finds a small BDD in a function interval. Given BDDs
9260 upper bound of a function interval, Cudd_bddSqueeze produces the BDD
9261 of a function within the interval with a small BDD. Returns a
9262 pointer to the result if successful; NULL otherwise.
9263 <p>
9266 <p>
9270 </code>
9272 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
9274 <dt><pre>
9276 DdNode * <I></I>
9283 )
9284 </pre>
9285 <dd> Swaps two sets of variables of the same size (x and y)
9286 in the BDD f. The size is given by n. The two sets of variables are
9287 assumed to be disjoint. Returns a pointer to the resulting BDD if
9288 successful; NULL otherwise.
9289 <p>
9292 <p>
9296 </code>
9298 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
9300 <dt><pre>
9302 DdNode * <I></I>
9307 )
9308 </pre>
9309 <dd> Convert a BDD from a manager to another one. The orders of the
9310 variables in the two managers may be different. Returns a
9311 pointer to the BDD in the destination manager if successful; NULL
9312 otherwise.
9313 <p>
9316 <p>
9318 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
9320 <dt><pre>
9322 int <I></I>
9326 )
9327 </pre>
9328 <dd> This function resets the flag that prevents the sifting
9329 of a variable. In successive variable reorderings, the variable will
9330 NOT be skipped, that is, sifted. Initially all variables can be
9331 sifted. It is necessary to call this function only to re-enable
9333 otherwise (i.e., invalid variable index).
9334 <p>
9337 <p>
9340 </code>
9342 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9344 <dt><pre>
9346 DdNode * <I></I>
9351 )
9352 </pre>
9353 <dd> Universally abstracts all the variables in cube from f.
9354 Returns the abstracted BDD if successful; NULL otherwise.
9355 <p>
9358 <p>
9362 </code>
9364 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
9366 <dt><pre>
9368 int <I></I>
9373 )
9374 </pre>
9375 <dd> Conjunctively decomposes one BDD according to a
9379 the sizes of the two conjuncts and to keep them small. Returns the
9381 meaningful decomposition was found; 0 otherwise.
9382 <p>
9385 The array is allocated by this function. It is the caller's responsibility
9386 to free it. On successful completion, the conjuncts are already
9387 referenced. If the function returns 0, the array for the conjuncts is
9388 not allocated. If the function returns 1, the only factor equals the
9389 function to be decomposed.
9390 <p>
9396 </code>
9398 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
9400 <dt><pre>
9402 int <I></I>
9407 )
9408 </pre>
9409 <dd> Performs two-way disjunctive decomposition of a BDD
9413 the sizes of the two disjuncts and to keep them small. Returns the
9415 meaningful decomposition was found; 0 otherwise.
9416 <p>
9419 The array is allocated by this function. It is the caller's responsibility
9420 to free it. On successful completion, the disjuncts are already
9421 referenced. If the function returns 0, the array for the disjuncts is
9422 not allocated. If the function returns 1, the only factor equals the
9423 function to be decomposed.
9424 <p>
9430 </code>
9432 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
9434 <dt><pre>
9436 int <I></I>
9440 )
9441 </pre>
9443 sifting. Initially all variables can be sifted. This function returns
9444 0 only if there has been a previous call to Cudd_bddBindVar for that
9445 variable not followed by a call to Cudd_bddUnbindVar. The function returns
9446 0 also in the case in which the index of the variable is out of bounds.
9447 <p>
9450 <p>
9454 </code>
9456 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
9458 <dt><pre>
9460 int <I></I>
9465 )
9466 </pre>
9467 <dd> Checks whether a variable is dependent on others in a
9469 new nodes are created.
9470 <p>
9473 <p>
9475 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
9477 <dt><pre>
9479 DdNode * <I></I>
9483 )
9484 </pre>
9485 <dd> Remaps the variables of a BDD using the default
9486 variable map. A typical use of this function is to swap two sets of
9487 variables. The variable map must be registered with Cudd_SetVarMap.
9488 Returns a pointer to the resulting BDD if successful; NULL
9489 otherwise.
9490 <p>
9493 <p>
9498 </code>
9500 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
9502 <dt><pre>
9504 DdNode * <I></I>
9509 )
9510 </pre>
9511 <dd> Given a vector of BDDs, creates a new BDD by
9512 substituting the BDDs for the variables of the BDD f. There
9513 should be an entry in vector for each variable in the manager.
9514 If no substitution is sought for a given variable, the corresponding
9515 projection function should be specified in the vector.
9516 This function implements simultaneous composition.
9517 Returns a pointer to the resulting BDD if successful; NULL
9518 otherwise.
9519 <p>
9522 <p>
9527 </code>
9529 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
9531 <dt><pre>
9533 DdNode * <I></I>
9538 )
9539 </pre>
9540 <dd> Computes the exclusive NOR of two BDDs f and g. Returns a
9541 pointer to the resulting BDD if successful; NULL if the intermediate
9542 result blows up.
9543 <p>
9546 <p>
9555 </code>
9557 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
9559 <dt><pre>
9561 DdNode * <I></I>
9567 )
9568 </pre>
9569 <dd> Takes the exclusive OR of two BDDs and simultaneously abstracts
9570 the variables in cube. The variables are existentially abstracted. Returns a
9571 pointer to the result is successful; NULL otherwise.
9572 <p>
9575 <p>
9580 </code>
9582 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
9584 <dt><pre>
9586 DdNode * <I></I>
9591 )
9592 </pre>
9593 <dd> Computes the exclusive OR of two BDDs f and g. Returns a
9594 pointer to the resulting BDD if successful; NULL if the intermediate
9595 result blows up.
9596 <p>
9599 <p>
9608 </code>
9610 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
9612 <dt><pre>
9614 void <I></I>
9617 )
9618 </pre>
9619 <dd> Frees a DdTlcInfo Structure as well as the memory pointed
9620 by it.
9621 <p>
9624 <p>
9626 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
9628 <dt><pre>
9630 DdNode * <I></I>
9635 )
9636 </pre>
9637 <dd> Substitutes a variable with its complement in a ZDD.
9638 returns a pointer to the result if successful; NULL otherwise.
9639 <p>
9642 <p>
9644 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
9646 <dt><pre>
9648 DdNode * <I></I>
9652 )
9653 </pre>
9654 <dd> Computes a complement cover for a ZDD node. For lack of a
9655 better method, we first extract the function BDD from the ZDD cover,
9656 then make the complement of the ZDD cover from the complement of the
9657 BDD node by using ISOP. Returns a pointer to the resulting cover if
9658 successful; NULL otherwise. The result depends on current variable
9659 order.
9660 <p>
9663 <p>
9665 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
9667 <dt><pre>
9669 double <I></I>
9673 )
9674 </pre>
9675 <dd> Counts the number of minterms of a ZDD. The result is
9676 returned as a double. If the procedure runs out of memory, it
9677 returns (double) CUDD_OUT_OF_MEM. This procedure is used in
9678 Cudd_zddCountMinterm.
9679 <p>
9682 <p>
9686 </code>
9688 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddCount.c"TARGET="ABSTRACT"><CODE>cuddZddCount.c</CODE></A>
9690 <dt><pre>
9692 double <I></I>
9697 )
9698 </pre>
9699 <dd> Counts the number of minterms of the ZDD rooted at
9702 support of the function. If the procedure runs out of memory, it
9703 returns (double) CUDD_OUT_OF_MEM.
9704 <p>
9707 <p>
9710 </code>
9712 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddMisc.c"TARGET="ABSTRACT"><CODE>cuddZddMisc.c</CODE></A>
9714 <dt><pre>
9716 int <I></I>
9720 )
9721 </pre>
9722 <dd> Returns an integer representing the number of minterms
9723 in a ZDD.
9724 <p>
9727 <p>
9730 </code>
9732 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddCount.c"TARGET="ABSTRACT"><CODE>cuddZddCount.c</CODE></A>
9734 <dt><pre>
9736 char * <I></I>
9741 )
9742 </pre>
9743 <dd> Converts a path of a ZDD representing a cover to a
9744 string. The string represents an implicant of the cover. The path
9745 is typically produced by Cudd_zddForeachPath. Returns a pointer to
9746 the string if successful; NULL otherwise. If the str input is NULL,
9747 it allocates a new string. The string passed to this function must
9748 have enough room for all variables and for the terminator.
9749 <p>
9752 <p>
9755 </code>
9757 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
9759 <dt><pre>
9761 int <I></I>
9764 )
9765 </pre>
9766 <dd> Counts the number of nodes in a ZDD. This function
9767 duplicates Cudd_DagSize and is only retained for compatibility.
9768 <p>
9771 <p>
9774 </code>
9776 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddMisc.c"TARGET="ABSTRACT"><CODE>cuddZddMisc.c</CODE></A>
9778 <dt><pre>
9780 DdNode * <I></I>
9785 )
9786 </pre>
9787 <dd> Inclusion test for ZDDs (P implies Q). No new nodes are
9788 generated by this procedure. Returns empty if true;
9789 a valid pointer different from empty or DD_NON_CONSTANT otherwise.
9790 <p>
9793 <p>
9796 </code>
9798 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
9800 <dt><pre>
9802 DdNode * <I></I>
9807 )
9808 </pre>
9809 <dd> Computes the difference of two ZDDs. Returns a pointer to the
9810 result if successful; NULL otherwise.
9811 <p>
9814 <p>
9817 </code>
9819 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
9821 <dt><pre>
9823 DdNode * <I></I>
9828 )
9829 </pre>
9830 <dd> Modified version of Cudd_zddDivide. This function may
9831 disappear in future releases.
9832 <p>
9835 <p>
9837 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
9839 <dt><pre>
9841 DdNode * <I></I>
9846 )
9847 </pre>
9848 <dd> Computes the quotient of two unate covers represented
9849 by ZDDs. Unate covers use one ZDD variable for each BDD
9850 variable. Returns a pointer to the resulting ZDD if successful; NULL
9851 otherwise.
9852 <p>
9855 <p>
9858 </code>
9860 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
9862 <dt><pre>
9864 int <I></I>
9872 )
9873 </pre>
9874 <dd> Writes a file representing the argument ZDDs in a format
9875 suitable for the graph drawing program dot.
9877 file system full).
9878 Cudd_zddDumpDot does not close the file: This is the caller
9879 responsibility. Cudd_zddDumpDot uses a minimal unique subset of the
9880 hexadecimal address of a node as name for it.
9881 If the argument inames is non-null, it is assumed to hold the pointers
9882 to the names of the inputs. Similarly for onames.
9883 Cudd_zddDumpDot uses the following convention to draw arcs:
9884 <ul>
9885 <li> solid line: THEN arcs;
9886 <li> dashed line: ELSE arcs.
9887 </ul>
9888 The dot options are chosen so that the drawing fits on a letter-size
9889 sheet.
9890 <p>
9893 <p>
9897 </code>
9899 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
9901 <dt><pre>
9903 DdGen * <I></I>
9908 )
9909 </pre>
9910 <dd> Defines an iterator on the paths of a ZDD
9911 and finds its first path. Returns a generator that contains the
9912 information necessary to continue the enumeration if successful; NULL
9913 otherwise.<p>
9914 A path is represented as an array of literals, which are integers in
9916 out of a node, and 2 stands for the absence of a node.
9917 The size of the array equals the number of variables in the manager at
9918 the time Cudd_zddFirstCube is called.<p>
9919 The paths that end in the empty terminal are not enumerated.
9920 <p>
9923 <p>
9929 </code>
9931 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
9933 <dt><pre>
9935 DdNode * <I></I>
9940 )
9941 </pre>
9942 <dd> Computes the intersection of two ZDDs. Returns a pointer to
9943 the result if successful; NULL otherwise.
9944 <p>
9947 <p>
9949 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
9951 <dt><pre>
9953 DdNode * <I></I>
9959 )
9960 </pre>
9961 <dd> Computes an irredundant sum of products (ISOP) in ZDD
9962 form from BDDs. The two BDDs L and U represent the lower bound and
9963 the upper bound, respectively, of the function. The ISOP uses two
9964 ZDD variables for each BDD variable: One for the positive literal,
9965 and one for the negative literal. These two variables should be
9966 adjacent in the ZDD order. The two ZDD variables corresponding to
9969 variable order. If successful, Cudd_zddIsop returns the BDD for
9970 the function chosen from the interval. The ZDD representing the
9971 irredundant cover is returned as a side effect in zdd_I. In case of
9972 failure, NULL is returned.
9973 <p>
9976 successful return.
9977 <p>
9981 </code>
9983 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddIsop.c"TARGET="ABSTRACT"><CODE>cuddZddIsop.c</CODE></A>
9985 <dt><pre>
9987 DdNode * <I></I>
9993 )
9994 </pre>
9995 <dd> Computes the ITE of three ZDDs. Returns a pointer to the
9996 result if successful; NULL otherwise.
9997 <p>
10000 <p>
10002 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
10004 <dt><pre>
10006 DdNode * <I></I>
10010 )
10011 </pre>
10012 <dd> Retrieves the ZDD variable with index i if it already
10013 exists, or creates a new ZDD variable. Returns a pointer to the
10014 variable if successful; NULL otherwise.
10015 <p>
10018 <p>
10022 </code>
10024 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
10026 <dt><pre>
10028 int <I></I>
10032 )
10033 </pre>
10034 <dd> Generates the next path of a ZDD onset,
10036 otherwise.
10037 <p>
10040 generator is modified.
10041 <p>
10047 </code>
10049 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
10051 <dt><pre>
10053 DdNode * <I></I>
10057 )
10058 </pre>
10059 <dd> Converts a BDD into a ZDD. This function assumes that
10060 there is a one-to-one correspondence between the BDD variables and the
10061 ZDD variables, and that the variable order is the same for both types
10062 of variables. These conditions are established if the ZDD variables
10063 are created by one call to Cudd_zddVarsFromBddVars with multiplicity =
10064 1. Returns a pointer to the resulting ZDD if successful; NULL otherwise.
10065 <p>
10068 <p>
10071 </code>
10073 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddPort.c"TARGET="ABSTRACT"><CODE>cuddZddPort.c</CODE></A>
10075 <dt><pre>
10077 DdNode * <I></I>
10081 )
10082 </pre>
10083 <dd> Converts a ZDD into a BDD. Returns a pointer to the resulting
10084 ZDD if successful; NULL otherwise.
10085 <p>
10088 <p>
10091 </code>
10093 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddPort.c"TARGET="ABSTRACT"><CODE>cuddZddPort.c</CODE></A>
10095 <dt><pre>
10097 int <I></I>
10101 )
10102 </pre>
10103 <dd> Prints a sum of products from a ZDD representing a cover.
10105 <p>
10108 <p>
10111 </code>
10113 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
10115 <dt><pre>
10117 int <I></I>
10123 )
10124 </pre>
10125 <dd> Prints to the standard output a DD and its statistics.
10126 The statistics include the number of nodes and the number of minterms.
10127 (The number of minterms is also the number of combinations in the set.)
10129 <ul>
10135 </ul>
10137 <p>
10140 <p>
10142 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
10144 <dt><pre>
10146 int <I></I>
10150 )
10151 </pre>
10153 if successful; 0 otherwise.
10154 <p>
10157 <p>
10161 </code>
10163 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
10165 <dt><pre>
10167 void <I></I>
10170 )
10171 </pre>
10172 <dd> Prints the ZDD table for debugging purposes.
10173 <p>
10176 <p>
10178 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddMisc.c"TARGET="ABSTRACT"><CODE>cuddZddMisc.c</CODE></A>
10180 <dt><pre>
10182 DdNode * <I></I>
10187 )
10188 </pre>
10189 <dd> Computes the product of two covers represented by
10190 ZDDs. The result is also a ZDD. Returns a pointer to the result if
10191 successful; NULL otherwise. The covers on which Cudd_zddProduct
10192 operates use two ZDD variables for each function variable (one ZDD
10193 variable for each literal of the variable). Those two ZDD variables
10194 should be adjacent in the order.
10195 <p>
10198 <p>
10201 </code>
10203 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
10205 <dt><pre>
10207 long <I></I>
10210 )
10211 </pre>
10212 <dd> Reports the number of nodes in ZDDs. This
10214 <p>
10217 <p>
10221 </code>
10223 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
10225 <dt><pre>
10227 void <I></I>
10230 )
10231 </pre>
10232 <dd> Disables realignment of ZDD order to BDD order.
10233 <p>
10236 <p>
10242 </code>
10244 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
10246 <dt><pre>
10248 void <I></I>
10251 )
10252 </pre>
10253 <dd> Enables realignment of the ZDD variable order to the
10254 BDD variable order after the BDDs and ADDs have been reordered. The
10255 number of ZDD variables must be a multiple of the number of BDD
10256 variables for realignment to make sense. If this condition is not met,
10258 ratio of the two numbers. For the purpose of realignment, the ZDD
10261 is initially disabled.
10262 <p>
10265 <p>
10272 </code>
10274 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
10276 <dt><pre>
10278 int <I></I>
10281 )
10282 </pre>
10284 enabled; 0 otherwise.
10285 <p>
10288 <p>
10294 </code>
10296 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
10298 <dt><pre>
10300 int <I></I>
10305 )
10306 </pre>
10307 <dd> Main dynamic reordering routine for ZDDs.
10308 Calls one of the possible reordering procedures:
10309 <ul>
10310 <li>Swapping
10311 <li>Sifting
10312 <li>Symmetric Sifting
10313 </ul>
10315 For sifting and symmetric sifting it is possible to request reordering
10316 to convergence.<p>
10318 The core of all methods is the reordering procedure
10319 cuddZddSwapInPlace() which swaps two adjacent variables.
10321 sifting (with and without convergence) returns 1 plus the number of
10322 symmetric variables, in case of success.
10323 <p>
10326 the cache.
10327 <p>
10329 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
10331 <dt><pre>
10333 int <I></I>
10337 )
10338 </pre>
10339 <dd> Reorders ZDD variables according to given permutation.
10340 The i-th entry of the permutation array contains the index of the variable
10341 that should be brought to the i-th level. The size of the array should be
10342 equal or greater to the number of variables currently in use.
10344 <p>
10347 the cache.
10348 <p>
10351 </code>
10353 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
10355 <dt><pre>
10357 DdNode * <I></I>
10362 )
10363 </pre>
10364 <dd> Computes the negative cofactor of a ZDD w.r.t. a
10365 variable. In terms of combinations, the result is the set of all
10366 combinations in which the variable is negated. Returns a pointer to
10367 the result if successful; NULL otherwise.
10368 <p>
10371 <p>
10374 </code>
10376 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
10378 <dt><pre>
10380 DdNode * <I></I>
10385 )
10386 </pre>
10387 <dd> Computes the positive cofactor of a ZDD w.r.t. a
10388 variable. In terms of combinations, the result is the set of all
10389 combinations in which the variable is asserted. Returns a pointer to
10390 the result if successful; NULL otherwise.
10391 <p>
10394 <p>
10397 </code>
10399 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
10401 <dt><pre>
10403 void <I></I>
10408 )
10409 </pre>
10410 <dd> Prints statistics on symmetric ZDD variables.
10411 <p>
10414 <p>
10416 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
10418 <dt><pre>
10420 DdNode * <I></I>
10425 )
10426 </pre>
10427 <dd> Computes the product of two unate covers represented as
10428 ZDDs. Unate covers use one ZDD variable for each BDD
10429 variable. Returns a pointer to the result if successful; NULL
10430 otherwise.
10431 <p>
10434 <p>
10437 </code>
10439 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
10441 <dt><pre>
10443 DdNode * <I></I>
10448 )
10449 </pre>
10450 <dd> Computes the union of two ZDDs. Returns a pointer to the
10451 result if successful; NULL otherwise.
10452 <p>
10455 <p>
10457 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
10459 <dt><pre>
10461 int <I></I>
10465 )
10466 </pre>
10467 <dd> Creates one or more ZDD variables for each BDD
10468 variable. If some ZDD variables already exist, only the missing
10469 variables are created. Parameter multiplicity allows the caller to
10470 control how many variables are created for each BDD variable in
10471 existence. For instance, if ZDDs are used to represent covers, two
10472 ZDD variables are required for each BDD variable. The order of the
10473 BDD variables is transferred to the ZDD variables. If a variable
10474 group tree exists for the BDD variables, a corresponding ZDD
10475 variable group tree is created by expanding the BDD variable
10476 tree. In any case, the ZDD variables derived from the same BDD
10477 variable are merged in a ZDD variable group. If a ZDD variable group
10479 <p>
10482 <p>
10487 </code>
10489 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
10491 <dt><pre>
10493 DdNode * <I></I>
10498 )
10499 </pre>
10500 <dd> Modified version of Cudd_zddWeakDiv. This function may
10501 disappear in future releases.
10502 <p>
10505 <p>
10508 </code>
10510 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
10512 <dt><pre>
10514 DdNode * <I></I>
10519 )
10520 </pre>
10521 <dd> Applies weak division to two ZDDs representing two
10522 covers. Returns a pointer to the ZDD representing the result if
10523 successful; NULL otherwise. The result of weak division depends on
10524 the variable order. The covers on which Cudd_zddWeakDiv operates use
10525 two ZDD variables for each function variable (one ZDD variable for
10526 each literal of the variable). Those two ZDD variables should be
10527 adjacent in the order.
10528 <p>
10531 <p>
10534 </code>
10536 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
10538 <dt><pre>
10540 static enum st_retval <I></I>
10545 )
10546 </pre>
10547 <dd> Frees memory associated with computed table of
10548 cuddBddLICMarkEdges. Returns ST_CONTINUE.
10549 <p>
10552 <p>
10555 </code>
10557 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
10559 <dt><pre>
10561 static int <I></I>
10565 )
10566 </pre>
10567 <dd> Comparison function for the computed table of
10569 otherwise.
10570 <p>
10573 <p>
10576 </code>
10578 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
10580 <dt><pre>
10582 static int <I></I>
10586 )
10587 </pre>
10588 <dd> Hash function for the computed table of
10589 cuddBddLICMarkEdges. Returns the bucket number.
10590 <p>
10593 <p>
10596 </code>
10598 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
10600 <dt><pre>
10602 static int <I></I>
10605 )
10606 </pre>
10607 <dd> Performs the crossover between two randomly chosen
10608 parents, and creates two children, x1 and x2. Uses the Partially
10609 Matched Crossover operator.
10610 <p>
10613 <p>
10615 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
10617 <dt><pre>
10619 static int <I></I>
10624 )
10625 </pre>
10626 <dd> .Check whether the given pair is in the tables. gTable
10627 and hTable are combined.
10628 absence in both is indicated by 0,
10629 presence in gTable is indicated by 1,
10630 presence in hTable by 2 and
10631 presence in both by 3.
10632 The values returned by this function are PAIR_ST,
10633 PAIR_CR, G_ST, G_CR, H_ST, H_CR, BOTH_G, BOTH_H, NONE.
10634 PAIR_ST implies g in gTable and h in hTable
10635 PAIR_CR implies g in hTable and h in gTable
10636 G_ST implies g in gTable and h not in any table
10637 G_CR implies g in hTable and h not in any table
10638 H_ST implies h in hTable and g not in any table
10639 H_CR implies h in gTable and g not in any table
10640 BOTH_G implies both in gTable
10641 BOTH_H implies both in hTable
10642 NONE implies none in table;
10643 <p>
10647 </code>
10649 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
10651 <dt><pre>
10653 static Conjuncts * <I></I>
10662 )
10663 </pre>
10664 <dd> Check the tables for the existence of pair and return
10665 one combination, store in cache. The pair that has more pointers to
10666 it is picked. An approximation of the number of local pointers is
10667 made by taking the reference count of the pairs sent.
10668 <p>
10672 </code>
10674 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
10676 <dt><pre>
10678 static DdNode * <I></I>
10683 )
10684 </pre>
10685 <dd> Builds the subset BDDfor cuddRemapUnderApprox. Based
10686 on the info table, performs remapping or replacement at selected
10687 nodes. Returns a pointer to the result if successful; NULL
10688 otherwise.
10689 <p>
10692 <p>
10695 </code>
10697 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
10699 <dt><pre>
10701 static int <I></I>
10708 )
10709 </pre>
10711 otherwise.
10712 <p>
10715 <p>
10718 </code>
10720 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
10722 <dt><pre>
10724 static void <I></I>
10726 <b></b> <i></i>
10727 )
10728 </pre>
10729 <dd> Resize the number of pages allocated to store the minterm
10730 counts. The procedure moves the counter to the next page when the
10731 end of the page is reached and allocates new pages when necessary.
10732 <p>
10735 number of pages freeing stuff in case of memory out.
10736 <p>
10738 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
10740 <dt><pre>
10742 static void <I></I>
10744 <b></b> <i></i>
10745 )
10746 </pre>
10747 <dd> Resize the number of pages allocated to store the node counts.
10748 The procedure moves the counter to the next page when the end of
10749 the page is reached and allocates new pages when necessary.
10750 <p>
10753 number of pages freeing stuff in case of memory out.
10754 <p>
10756 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
10758 <dt><pre>
10760 static void <I></I>
10762 <b></b> <i></i>
10763 )
10764 </pre>
10765 <dd> Resize the number of pages allocated to store the node data
10766 The procedure moves the counter to the next page when the end of
10767 the page is reached and allocates new pages when necessary.
10768 <p>
10771 number of pages freeing stuff in case of memory out.
10772 <p>
10774 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
10776 <dt><pre>
10778 static void <I></I>
10780 <b></b> <i></i>
10781 )
10782 </pre>
10783 <dd> Resize the number of pages allocated to store the distances
10784 related to each node. The procedure moves the counter to the
10785 next page when the end of the page is reached and allocates new
10786 pages when necessary.
10787 <p>
10790 number of pages freeing stuff in case of memory out.
10791 <p>
10793 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
10795 <dt><pre>
10797 static void <I></I>
10799 <b></b> <i></i>
10800 )
10801 </pre>
10802 <dd> Resize the number of pages allocated to store nodes in the BFS
10803 traversal of the Bdd. The procedure moves the counter to the
10804 next page when the end of the page is reached and allocates new
10805 pages when necessary.
10806 <p>
10809 number of pages freeing stuff in case of memory out.
10810 <p>
10812 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
10814 <dt><pre>
10816 static void <I></I>
10821 )
10822 </pre>
10823 <dd> rocedure to recursively store nodes that are retained in the subset.
10824 <p>
10827 <p>
10830 </code>
10832 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
10834 <dt><pre>
10836 static double <I></I>
10841 )
10842 </pre>
10843 <dd> Recursively counts minterms of each node in the DAG.
10844 Similar to the cuddCountMintermAux which recursively counts the
10845 number of minterms for the dag rooted at each node in terms of the
10846 total number of variables (max). This procedure creates the node
10847 data structure and stores the minterm count as part of the node
10848 data structure.
10849 <p>
10852 <p>
10855 </code>
10857 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
10859 <dt><pre>
10861 static st_table * <I></I>
10865 )
10866 </pre>
10867 <dd> Counts minterms of each node in the DAG. Similar to the
10868 Cudd_CountMinterm procedure except this returns the minterm count for
10869 all the nodes in the bdd in an st_table.
10870 <p>
10873 <p>
10876 </code>
10878 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
10880 <dt><pre>
10882 static int <I></I>
10887 )
10888 </pre>
10889 <dd> Recursively counts the number of nodes under the dag.
10890 Also counts the number of nodes under the lighter child of
10891 this node. . Note that the same dag may be the lighter child of two
10892 different nodes and have different counts. As with the minterm counts,
10893 the node counts are stored in pages to be space efficient and the
10894 address for these node counts are stored in an st_table associated
10895 to each node.
10896 <p>
10899 <p>
10902 </code>
10904 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
10906 <dt><pre>
10908 static int <I></I>
10913 )
10914 </pre>
10915 <dd> Counts the nodes under the current node and its lighter
10916 child. Calls a recursive procedure to count the number of nodes of
10917 a DAG rooted at a particular node and the number of nodes taken by its
10918 lighter child.
10919 <p>
10922 <p>
10925 </code>
10927 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
10929 <dt><pre>
10931 static DdNode * <I></I>
10936 )
10937 </pre>
10938 <dd> Builds the subset BDD. Based on the info table,
10939 replaces selected nodes by zero. Returns a pointer to the result if
10940 successful; NULL otherwise.
10941 <p>
10944 <p>
10947 </code>
10949 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
10951 <dt><pre>
10953 static int <I></I>
10961 )
10962 </pre>
10964 0 otherwise.
10965 <p>
10968 <p>
10971 </code>
10973 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
10975 <dt><pre>
10977 static Conjuncts * <I></I>
10985 )
10986 </pre>
10987 <dd> If one child is zero, do explicitly what Restrict does or better.
10988 First separate a variable and its child in the base case. In case of a cube
10989 times a function, separate the cube and function. As a last resort, look in
10990 tables.
10991 <p>
10994 because it is freed above.
10995 <p>
10998 </code>
11000 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
11002 <dt><pre>
11004 static DdNode * <I></I>
11010 )
11011 </pre>
11012 <dd> Performs the recursive step for Cudd_addBddInterval.
11013 Returns a pointer to the BDD if successful; NULL otherwise.
11014 <p>
11017 <p>
11021 </code>
11023 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
11025 <dt><pre>
11027 static DdNode * <I></I>
11032 )
11033 </pre>
11034 <dd> Performs the recursive step for Cudd_addBddIthBit.
11035 Returns a pointer to the BDD if successful; NULL otherwise.
11036 <p>
11039 <p>
11041 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
11043 <dt><pre>
11045 static DdNode * <I></I>
11050 )
11051 </pre>
11052 <dd> Performs the recursive step for Cudd_addBddStrictThreshold.
11053 Returns a pointer to the BDD if successful; NULL otherwise.
11054 <p>
11057 <p>
11060 </code>
11062 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
11064 <dt><pre>
11066 static DdNode * <I></I>
11071 )
11072 </pre>
11073 <dd> Performs the recursive step for Cudd_addBddThreshold.
11074 Returns a pointer to the BDD if successful; NULL otherwise.
11075 <p>
11078 <p>
11081 </code>
11083 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
11085 <dt><pre>
11087 static int <I></I>
11091 )
11092 </pre>
11093 <dd> Checks whether cube is an ADD representing the product of
11095 <p>
11098 <p>
11100 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddAbs.c"TARGET="ABSTRACT"><CODE>cuddAddAbs.c</CODE></A>
11102 <dt><pre>
11104 static DdNode * <I></I>
11109 )
11110 </pre>
11111 <dd> Performs the recursive step for Cudd_addIthBit.
11112 Returns a pointer to the BDD if successful; NULL otherwise.
11113 <p>
11116 <p>
11118 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddFind.c"TARGET="ABSTRACT"><CODE>cuddAddFind.c</CODE></A>
11120 <dt><pre>
11122 static DdNode * <I></I>
11129 )
11130 </pre>
11131 <dd> Performs the recursive step of Cudd_addMatrixMultiply.
11132 Returns a pointer to the result if successful; NULL otherwise.
11133 <p>
11136 <p>
11138 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddMatMult.c"TARGET="ABSTRACT"><CODE>cuddMatMult.c</CODE></A>
11140 <dt><pre>
11142 static int <I></I>
11149 )
11150 </pre>
11151 <dd> Adds multiplicity groups to a ZDD variable group tree.
11153 for set of ZDD variables (whose cardinality is given by parameter
11154 multiplicity) that are created for each BDD variable in
11155 Cudd_zddVarsFromBddVars. The crux of the matter is to determine the index
11156 each new group. (The index of the first variable in the group.)
11157 We first build all the groups for the children of a node, and then deal
11158 with the ZDD variables that are directly attached to the node. The problem
11159 for these is that the tree itself does not provide information on their
11160 position inside the group. While we deal with the children of the node,
11161 therefore, we keep track of all the positions they occupy. The remaining
11162 positions in the tree can be freely used. Also, we keep track of all the
11163 variables placed in the children. All the remaining variables are directly
11164 attached to the group. We can then place any pair of variables not yet
11165 grouped in any pair of available positions in the node.
11166 <p>
11169 <p>
11172 </code>
11174 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
11176 <dt><pre>
11178 static DdNode * <I></I>
11185 )
11186 </pre>
11187 <dd> Performs the recursive step of Cudd_addTriangle. Returns
11188 a pointer to the result if successful; NULL otherwise.
11189 <p>
11192 <p>
11194 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddMatMult.c"TARGET="ABSTRACT"><CODE>cuddMatMult.c</CODE></A>
11196 <dt><pre>
11198 static void <I></I>
11205 )
11206 </pre>
11207 <dd> Replaces variables with constants if possible (part of
11208 canonical form).
11209 <p>
11212 <p>
11214 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddIte.c"TARGET="ABSTRACT"><CODE>cuddAddIte.c</CODE></A>
11216 <dt><pre>
11218 static DdNode * <I></I>
11224 )
11225 </pre>
11226 <dd> Generates a Walsh matrix in ADD form. Returns a pointer
11227 to the matrixi if successful; NULL otherwise.
11228 <p>
11231 <p>
11233 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddWalsh.c"TARGET="ABSTRACT"><CODE>cuddAddWalsh.c</CODE></A>
11235 <dt><pre>
11237 static int <I></I>
11241 )
11242 </pre>
11244 the two arrays are equal; 1 otherwise.
11245 <p>
11248 <p>
11250 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
11252 <dt><pre>
11254 static int <I></I>
11258 )
11259 </pre>
11260 <dd> Hash function for the computed table. Returns the bucket
11261 number.
11262 <p>
11265 <p>
11267 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
11269 <dt><pre>
11271 static double <I></I>
11277 )
11278 </pre>
11279 <dd> Annotates every node in the BDD node with its minterm count.
11280 In this function, every node and the minterm count represented by it are
11281 stored in a hash table.
11282 <p>
11285 <p>
11287 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSplit.c"TARGET="ABSTRACT"><CODE>cuddSplit.c</CODE></A>
11289 <dt><pre>
11291 static int <I></I>
11295 )
11296 </pre>
11298 <p>
11301 <p>
11303 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
11305 <dt><pre>
11307 static double <I></I>
11313 )
11314 </pre>
11315 <dd> Performs the recursive step of Cudd_bddCorrelation.
11316 Returns the fraction of minterms in the ON-set of the EXNOR of f and
11317 g.
11318 <p>
11321 <p>
11324 </code>
11326 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddCorr.c"TARGET="ABSTRACT"><CODE>cuddBddCorr.c</CODE></A>
11328 <dt><pre>
11330 static double <I></I>
11337 )
11338 </pre>
11339 <dd> Performs the recursive step of Cudd_bddCorrelationWeigths.
11340 <p>
11343 <p>
11346 </code>
11348 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddCorr.c"TARGET="ABSTRACT"><CODE>cuddBddCorr.c</CODE></A>
11350 <dt><pre>
11352 static void <I></I>
11356 )
11357 </pre>
11358 <dd> Fixes the BDD variable group tree after a
11359 shuffle. Assumes that the order of the variables in a terminal node
11360 has not been changed.
11361 <p>
11364 <p>
11366 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
11368 <dt><pre>
11370 static int <I></I>
11379 )
11380 </pre>
11381 <dd> Makes sure the first two pointers are regular. This
11382 mat require the complementation of the result, which is signaled by
11384 case because it assumes that no two arguments are the same or
11385 complementary, and no argument is constant.
11386 <p>
11389 <p>
11393 </code>
11395 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
11397 <dt><pre>
11399 static int <I></I>
11408 )
11409 </pre>
11411 <p>
11414 <p>
11418 </code>
11420 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
11422 <dt><pre>
11424 static void <I></I>
11430 )
11431 </pre>
11432 <dd> This function performs part of the transformation to
11433 standard form by replacing variables with constants if possible.
11434 <p>
11437 <p>
11441 </code>
11443 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
11445 <dt><pre>
11447 static int <I></I>
11457 )
11458 </pre>
11459 <dd> Returns true iff the first argument precedes the second
11460 in the clause order. A clause precedes another if its first lieral
11461 precedes the first literal of the other, or if the first literals
11462 are the same, and its second literal precedes the second literal of
11463 the other clause. A literal precedes another if it has a higher
11464 index, of if it has the same index, but it has lower phase. Phase 0
11465 is the positive phase, and it is lower than Phase 1 (negative
11466 phase).
11467 <p>
11470 <p>
11473 </code>
11475 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
11477 <dt><pre>
11479 static BitVector * <I></I>
11482 )
11483 </pre>
11484 <dd> Allocates a bit vector. The parameter size gives the
11485 number of bits. This procedure allocates enough long's to hold the
11486 specified number of bits. Returns a pointer to the allocated vector
11487 if successful; NULL otherwise.
11488 <p>
11491 <p>
11495 </code>
11497 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
11499 <dt><pre>
11501 static void <I></I>
11505 )
11506 </pre>
11507 <dd> Clears a bit vector. The parameter size gives the
11508 number of bits.
11509 <p>
11512 <p>
11515 </code>
11517 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
11519 <dt><pre>
11521 static void <I></I>
11524 )
11525 </pre>
11526 <dd> Frees a bit vector.
11527 <p>
11530 <p>
11533 </code>
11535 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
11537 <dt><pre>
11539 static short <I></I>
11543 )
11544 </pre>
11545 <dd> Returns the i-th entry of a bit vector.
11546 <p>
11549 <p>
11552 </code>
11554 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
11556 <dt><pre>
11558 static void <I></I>
11563 )
11564 </pre>
11565 <dd> Sets the i-th entry of a bit vector to a value.
11566 <p>
11569 <p>
11572 </code>
11574 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
11576 <dt><pre>
11578 static int <I></I>
11584 )
11585 </pre>
11586 <dd> Builds a DD from a given order. This procedure also
11587 sifts the final order and inserts into the array the size in nodes
11589 <p>
11592 <p>
11594 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
11596 <dt><pre>
11598 static int <I></I>
11604 )
11605 </pre>
11607 among those belonging to a symmetry group that are in the top part of
11608 the BDD. The top part is given by level.
11609 <p>
11612 <p>
11615 </code>
11617 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
11619 <dt><pre>
11621 static DdTlcInfo * <I></I>
11626 )
11627 </pre>
11628 <dd> Computes the two-literal clauses for a node with a zero
11629 child, given the clauses for its other child and the label of the
11630 node. Returns a pointer to a TclInfo structure if successful; NULL
11631 otherwise.
11632 <p>
11635 <p>
11638 </code>
11640 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
11642 <dt><pre>
11644 static DdTlcInfo * <I></I>
11650 )
11651 </pre>
11652 <dd> Computes the two-literal clauses for a node given the
11653 clauses for its children and the label of the node. Returns a
11654 pointer to a TclInfo structure if successful; NULL otherwise.
11655 <p>
11658 <p>
11660 <dd> <b>See Also</b> <code><a href="#computeClausesWithUniverse">computeClausesWithUniverse</a>
11661 </code>
11663 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
11665 <dt><pre>
11667 static int <I></I>
11676 )
11677 </pre>
11678 <dd> Computes a lower bound on the size of a BDD from the
11679 following factors:
11680 <ul>
11681 <li> size of the lower part of it;
11682 <li> size of the part of the upper part not subjected to reordering;
11683 <li> number of roots in the part of the BDD subjected to reordering;
11684 <li> variable in the support of the roots in the upper part of the
11685 BDD subjected to reordering.
11686 <ul/>
11687 <p>
11690 <p>
11692 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
11694 <dt><pre>
11696 static int <I></I>
11703 )
11704 </pre>
11705 <dd> Counts the nodes that would be eliminated if a given
11706 node were replaced by zero. This procedure uses a queue passed by
11707 the caller for efficiency: since the queue is left empty at the
11708 endof the search, it can be reused as is by the next search. Returns
11709 the count (always striclty positive) if successful; 0 otherwise.
11710 <p>
11713 <p>
11716 </code>
11718 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
11720 <dt><pre>
11722 static void <I></I>
11728 )
11729 </pre>
11730 <dd> Copies the current variable order to array.
11731 At the same time inverts the permutation.
11732 <p>
11735 <p>
11737 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
11739 <dt><pre>
11741 static DdNode * <I></I>
11748 )
11749 </pre>
11750 <dd> Builds a result for cache storage. Returns a pointer
11751 to the resulting ADD if successful; NULL otherwise.
11752 <p>
11755 <p>
11758 separateCube
11759 </code>
11761 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
11763 <dt><pre>
11765 DdNode * <I></I>
11771 )
11772 </pre>
11773 <dd> Performs the recursive step of Cudd_addApply. Returns a
11774 pointer to the result if successful; NULL otherwise.
11775 <p>
11778 <p>
11781 </code>
11783 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
11785 <dt><pre>
11787 DdNode * <I></I>
11791 )
11792 </pre>
11793 <dd> Performs the recursive step for Cudd_addBddPattern. Returns a
11794 pointer to the resulting BDD if successful; NULL otherwise.
11795 <p>
11798 <p>
11800 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
11802 <dt><pre>
11804 DdNode * <I></I>
11808 )
11809 </pre>
11810 <dd> Performs the recursive step of Cudd_addCmpl. Returns a
11811 pointer to the resulting ADD if successful; NULL otherwise.
11812 <p>
11815 <p>
11818 </code>
11820 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddIte.c"TARGET="ABSTRACT"><CODE>cuddAddIte.c</CODE></A>
11822 <dt><pre>
11824 DdNode * <I></I>
11830 )
11831 </pre>
11832 <dd> Performs the recursive step of Cudd_addCompose.
11833 Returns the composed BDD if successful; NULL otherwise.
11834 <p>
11837 <p>
11840 </code>
11842 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
11844 <dt><pre>
11846 DdNode * <I></I>
11851 )
11852 </pre>
11853 <dd> Performs the recursive step of Cudd_addConstrain.
11854 Returns a pointer to the result if successful; NULL otherwise.
11855 <p>
11858 <p>
11861 </code>
11863 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
11865 <dt><pre>
11867 DdNode * <I></I>
11872 )
11873 </pre>
11874 <dd> Performs the recursive step of Cudd_addExistAbstract.
11875 Returns the ADD obtained by abstracting the variables of cube from f,
11876 if successful; NULL otherwise.
11877 <p>
11880 <p>
11882 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddAbs.c"TARGET="ABSTRACT"><CODE>cuddAddAbs.c</CODE></A>
11884 <dt><pre>
11886 static DdNode * <I></I>
11894 )
11895 </pre>
11896 <dd> Performs the recursive step of Cudd_addGeneralVectorCompose.
11897 <p>
11900 <p>
11902 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
11904 <dt><pre>
11906 DdNode * <I></I>
11912 )
11913 </pre>
11914 <dd> Implements the recursive step of Cudd_addIte(f,g,h).
11915 Returns a pointer to the resulting ADD if successful; NULL
11916 otherwise.
11917 <p>
11920 <p>
11923 </code>
11925 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddIte.c"TARGET="ABSTRACT"><CODE>cuddAddIte.c</CODE></A>
11927 <dt><pre>
11929 DdNode * <I></I>
11934 )
11935 </pre>
11936 <dd> Performs the recursive step of Cudd_addMonadicApply. Returns a
11937 pointer to the result if successful; NULL otherwise.
11938 <p>
11941 <p>
11944 </code>
11946 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddApply.c"TARGET="ABSTRACT"><CODE>cuddAddApply.c</CODE></A>
11948 <dt><pre>
11950 DdNode * <I></I>
11954 )
11955 </pre>
11956 <dd> Implements the recursive step of Cudd_addNegate.
11957 Returns a pointer to the result.
11958 <p>
11961 <p>
11963 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddNeg.c"TARGET="ABSTRACT"><CODE>cuddAddNeg.c</CODE></A>
11965 <dt><pre>
11967 static DdNode * <I></I>
11975 )
11976 </pre>
11977 <dd> Performs the recursive step of Cudd_addNonSimCompose.
11978 <p>
11981 <p>
11983 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
11985 <dt><pre>
11987 DdNode * <I></I>
11992 )
11993 </pre>
11994 <dd> Performs the recursive step of Cudd_addOrAbstract.
11995 Returns the ADD obtained by abstracting the variables of cube from f,
11996 if successful; NULL otherwise.
11997 <p>
12000 <p>
12002 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddAbs.c"TARGET="ABSTRACT"><CODE>cuddAddAbs.c</CODE></A>
12004 <dt><pre>
12006 static DdNode * <I></I>
12012 )
12013 </pre>
12014 <dd> Performs the recursive step of Cudd_addOuterSum.
12015 Returns a pointer to the result if successful; NULL otherwise.
12016 <p>
12019 <p>
12021 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddMatMult.c"TARGET="ABSTRACT"><CODE>cuddMatMult.c</CODE></A>
12023 <dt><pre>
12025 static DdNode * <I></I>
12031 )
12032 </pre>
12033 <dd> Recursively puts the ADD in the order given in the
12034 array permut. Checks for trivial cases to terminate recursion, then
12035 splits on the children of this node. Once the solutions for the
12036 children are obtained, it puts into the current position the node
12037 from the rest of the ADD that should be here. Then returns this ADD.
12038 The key here is that the node being visited is NOT put in its proper
12039 place by this instance, but rather is switched when its proper
12040 position is reached in the recursion tree.<p>
12041 The DdNode * that is returned is the same ADD as passed in as node,
12042 but in the new order.
12043 <p>
12046 <p>
12050 </code>
12052 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
12054 <dt><pre>
12056 DdNode * <I></I>
12061 )
12062 </pre>
12063 <dd> Performs the recursive step of Cudd_addRestrict.
12064 Returns the restricted ADD if successful; otherwise NULL.
12065 <p>
12068 <p>
12071 </code>
12073 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12075 <dt><pre>
12077 DdNode * <I></I>
12082 )
12083 </pre>
12084 <dd> Implements the recursive step of Cudd_addRoundOff.
12085 Returns a pointer to the result.
12086 <p>
12089 <p>
12091 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddNeg.c"TARGET="ABSTRACT"><CODE>cuddAddNeg.c</CODE></A>
12093 <dt><pre>
12095 DdNode * <I></I>
12100 )
12101 </pre>
12102 <dd> Returns a pointer to the resulting ADD in case of
12103 success. Returns NULL if any discriminants smaller than epsilon is
12104 encountered.
12105 <p>
12108 <p>
12110 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddInv.c"TARGET="ABSTRACT"><CODE>cuddAddInv.c</CODE></A>
12112 <dt><pre>
12114 DdNode * <I></I>
12119 )
12120 </pre>
12121 <dd> Performs the recursive step of Cudd_addUnivAbstract.
12122 Returns the ADD obtained by abstracting the variables of cube from f,
12123 if successful; NULL otherwise.
12124 <p>
12127 <p>
12129 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAddAbs.c"TARGET="ABSTRACT"><CODE>cuddAddAbs.c</CODE></A>
12131 <dt><pre>
12133 static DdNode * <I></I>
12140 )
12141 </pre>
12142 <dd> Performs the recursive step of Cudd_addVectorCompose.
12143 <p>
12146 <p>
12148 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
12150 <dt><pre>
12152 DdNode * <I></I>
12155 )
12156 </pre>
12157 <dd> Fast storage allocation for DdNodes in the table. The
12158 first 4 bytes of a chunk contain a pointer to the next block; the
12159 rest contains DD_MEM_CHUNK spaces for DdNodes. Returns a pointer to
12160 a new node if successful; NULL is memory is full.
12161 <p>
12164 <p>
12167 </code>
12169 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
12171 <dt><pre>
12173 int <I></I>
12178 )
12179 </pre>
12180 <dd> Get x, y by random selection. Choose either
12181 exchange or jump randomly. In case of jump, choose between jump_up
12182 and jump_down randomly. Do exchange or jump and get optimal case.
12183 Loop until there is no improvement or temperature reaches
12185 <p>
12188 <p>
12190 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
12192 <dt><pre>
12194 static DdApaNumber <I></I>
12201 )
12202 </pre>
12203 <dd> Performs the recursive step of Cudd_ApaCountMinterm.
12204 It is based on the following identity. Let |f| be the
12205 number of minterms of f. Then:
12206 <xmp>
12207 |f| = (|f0|+|f1|)/2
12208 </xmp>
12209 where f0 and f1 are the two cofactors of f.
12211 The procedure expects the argument "node" to be a regular pointer, and
12212 guarantees this condition is met in the recursive calls.
12213 For efficiency, the result of a call is cached only if the node has
12214 a reference count greater than 1.
12215 Returns the number of minterms of the function rooted at node.
12216 <p>
12219 <p>
12221 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
12223 <dt><pre>
12225 static enum st_retval <I></I>
12230 )
12231 </pre>
12232 <dd> Frees the memory used to store the minterm counts
12233 recorded in the visited table. Returns ST_CONTINUE.
12234 <p>
12237 <p>
12239 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApa.c"TARGET="ABSTRACT"><CODE>cuddApa.c</CODE></A>
12241 <dt><pre>
12243 int <I></I>
12246 )
12247 </pre>
12248 <dd> Reorders BDD variables according to the order of the
12249 ZDD variables. This function can be called at the end of ZDD
12250 reordering to insure that the order of the BDD variables is
12251 consistent with the order of the ZDD variables. The number of ZDD
12252 variables must be a multiple of the number of BDD variables. Let
12257 Cudd_zddReduceHeap, which clears the cache. Returns 1 in case of
12258 success; 0 otherwise.
12259 <p>
12262 garbage collection of the BDD unique table.
12263 <p>
12267 </code>
12269 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
12271 <dt><pre>
12273 DdNode * <I></I>
12279 )
12280 </pre>
12281 <dd> Takes the AND of two BDDs and simultaneously abstracts
12282 the variables in cube. The variables are existentially abstracted.
12283 Returns a pointer to the result is successful; NULL otherwise.
12284 <p>
12287 <p>
12290 </code>
12292 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAndAbs.c"TARGET="ABSTRACT"><CODE>cuddAndAbs.c</CODE></A>
12294 <dt><pre>
12296 DdNode * <I></I>
12301 )
12302 </pre>
12303 <dd> Implements the recursive step of Cudd_bddAnd by taking
12304 the conjunction of two BDDs. Returns a pointer to the result is
12305 successful; NULL otherwise.
12306 <p>
12309 <p>
12312 </code>
12314 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
12316 <dt><pre>
12318 DdNode * <I></I>
12323 )
12324 </pre>
12325 <dd> Performs the recursive steps of Cudd_bddBoleanDiff.
12326 Returns the BDD obtained by XORing the cofactors of f with respect to
12327 var if successful; NULL otherwise. Exploits the fact that dF/dx =
12328 dF'/dx.
12329 <p>
12332 <p>
12334 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
12336 <dt><pre>
12338 static DdNode * <I></I>
12343 )
12344 </pre>
12345 <dd> Performs the recursive step of Cudd_bddCharToVect.
12346 This function maintains the invariant that f is non-zero.
12347 Returns the i-th component of the vector if successful; otherwise NULL.
12348 <p>
12351 <p>
12354 </code>
12356 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12358 <dt><pre>
12360 static DdNode * <I></I>
12368 )
12369 </pre>
12370 <dd> Approximates the AND of two BDDs and simultaneously
12371 abstracts the variables in cube. The variables are existentially
12372 abstracted. Returns a pointer to the result is successful; NULL
12373 otherwise.
12374 <p>
12377 <p>
12379 <dd> <b>See Also</b> <code><a href="#Cudd_bddClippingAndAbstract">Cudd_bddClippingAndAbstract</a>
12380 </code>
12382 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddClip.c"TARGET="ABSTRACT"><CODE>cuddClip.c</CODE></A>
12384 <dt><pre>
12386 DdNode * <I></I>
12394 )
12395 </pre>
12396 <dd> Approximates the conjunction of two BDDs f and g and
12397 simultaneously abstracts the variables in cube. Returns a
12398 pointer to the resulting BDD if successful; NULL if the intermediate
12399 result blows up.
12400 <p>
12403 <p>
12405 <dd> <b>See Also</b> <code><a href="#Cudd_bddClippingAndAbstract">Cudd_bddClippingAndAbstract</a>
12406 </code>
12408 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddClip.c"TARGET="ABSTRACT"><CODE>cuddClip.c</CODE></A>
12410 <dt><pre>
12412 static DdNode * <I></I>
12419 )
12420 </pre>
12421 <dd> Implements the recursive step of Cudd_bddClippingAnd by taking
12422 the conjunction of two BDDs. Returns a pointer to the result is
12423 successful; NULL otherwise.
12424 <p>
12427 <p>
12430 </code>
12432 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddClip.c"TARGET="ABSTRACT"><CODE>cuddClip.c</CODE></A>
12434 <dt><pre>
12436 DdNode * <I></I>
12443 )
12444 </pre>
12445 <dd> Approximates the conjunction of two BDDs f and g. Returns a
12446 pointer to the resulting BDD if successful; NULL if the intermediate
12447 result blows up.
12448 <p>
12451 <p>
12454 </code>
12456 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddClip.c"TARGET="ABSTRACT"><CODE>cuddClip.c</CODE></A>
12458 <dt><pre>
12460 DdNode * <I></I>
12466 )
12467 </pre>
12468 <dd> Performs the recursive step of Cudd_bddClosestCube.
12469 Returns the cube if succesful; NULL otherwise. The procedure uses a
12470 four-way recursion to examine all four combinations of cofactors of
12472 <pre>
12474 </pre>
12475 Bounding is based on the following observations.
12476 <ul>
12478 continuing. Furthermore,
12479 <li> If F == not(G) then the best we can hope for is a minimum distance
12481 no point in continuing. (Indeed, H(F,G) == 1 in this case. We
12482 have to continue, though, to find the cube.)
12483 </ul>
12485 that we are still interested in. Therefore, we desist when
12486 <pre>
12488 </pre>
12489 If we were maximally aggressive in using the bound, we would always
12490 set the bound to the minimum distance seen thus far minus one. That
12491 is, we would maintain the invariant
12492 <pre>
12493 bound < minD,
12494 </pre>
12495 except at the very beginning, when we have no value for
12499 two negative cofactors, because we try to find a large cube at
12500 minimum distance. To do so, we try to find a cube in the negative
12501 cofactors at the same or smaller distance from the cube found in the
12502 positive cofactors.<p>
12505 know that we are going to add 1 to the result of the recursive call
12506 to account for the difference in the splitting variable. Therefore,
12507 we decrease the bound correspondingly.<p>
12509 Another important observation concerns the need of examining all
12514 not depend on the top variable.) Then
12515 <pre>
12517 = min(H(ft,g), H(fe,g)) .
12518 </pre>
12521 An interesting feature of this function is the scheme used for
12522 caching the results in the global computed table. Since we have a
12523 cube and a distance, we combine them to form an ADD. The
12524 combination replaces the zero child of the top node of the cube with
12525 the negative of the distance. (The use of the negative is to avoid
12526 ambiguity with 1.) The degenerate cases (zero and one) are treated
12527 specially because the distance is known (0 for one, and infinity for
12528 zero).
12529 <p>
12532 <p>
12535 </code>
12537 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
12539 <dt><pre>
12541 DdNode * <I></I>
12547 )
12548 </pre>
12549 <dd> Performs the recursive step of Cudd_bddCompose.
12550 Exploits the fact that the composition of f' with g
12551 produces the complement of the composition of f with g to better
12552 utilize the cache. Returns the composed BDD if successful; NULL
12553 otherwise.
12554 <p>
12557 <p>
12560 </code>
12562 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
12564 <dt><pre>
12566 static int <I></I>
12571 )
12572 </pre>
12573 <dd> Performs the recursive step of Cudd_bddConstrainDecomp.
12574 Returns f super (i) if successful; otherwise NULL.
12575 <p>
12578 <p>
12581 </code>
12583 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12585 <dt><pre>
12587 DdNode * <I></I>
12592 )
12593 </pre>
12594 <dd> Performs the recursive step of Cudd_bddConstrain.
12595 Returns a pointer to the result if successful; NULL otherwise.
12596 <p>
12599 <p>
12602 </code>
12604 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12606 <dt><pre>
12608 DdNode * <I></I>
12613 )
12614 </pre>
12615 <dd> Performs the recursive steps of Cudd_bddExistAbstract.
12616 Returns the BDD obtained by abstracting the variables
12617 of cube from f if successful; NULL otherwise. It is also used by
12618 Cudd_bddUnivAbstract.
12619 <p>
12622 <p>
12626 </code>
12628 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
12630 <dt><pre>
12632 DdNode * <I></I>
12637 )
12638 </pre>
12639 <dd> Implements the recursive step of Cudd_bddIntersect.
12640 <p>
12643 <p>
12646 </code>
12648 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
12650 <dt><pre>
12652 DdNode * <I></I>
12657 )
12658 </pre>
12659 <dd> Performs the recursive step of Cudd_bddIsop.
12660 <p>
12663 <p>
12666 </code>
12668 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddIsop.c"TARGET="ABSTRACT"><CODE>cuddZddIsop.c</CODE></A>
12670 <dt><pre>
12672 DdNode * <I></I>
12678 )
12679 </pre>
12680 <dd> Implements the recursive step of Cudd_bddIte. Returns a
12681 pointer to the resulting BDD. NULL if the intermediate result blows
12682 up or if reordering occurs.
12683 <p>
12686 <p>
12688 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
12690 <dt><pre>
12692 static DdNode * <I></I>
12698 )
12699 </pre>
12700 <dd> Builds the results of Cudd_bddLICompaction.
12701 Returns a pointer to the minimized BDD if successful; otherwise NULL.
12702 <p>
12705 <p>
12709 </code>
12711 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12713 <dt><pre>
12715 static int <I></I>
12722 )
12723 </pre>
12724 <dd> Performs the edge marking step of Cudd_bddLICompaction.
12726 if successful; otherwise CUDD_OUT_OF_MEM.
12727 <p>
12730 <p>
12734 </code>
12736 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12738 <dt><pre>
12740 DdNode * <I></I>
12745 )
12746 </pre>
12747 <dd> Performs safe minimization of a BDD. Given the BDD
12752 of the result is guaranteed not to exceed the size of
12754 al.. Returns a pointer to the result if successful; NULL
12755 otherwise.
12756 <p>
12759 <p>
12762 </code>
12764 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12766 <dt><pre>
12768 DdNode * <I></I>
12773 )
12774 </pre>
12775 <dd> Performs the recursive step of
12776 Cudd_bddLiteralSetIntersection. Scans the cubes for common variables,
12777 and checks whether they agree in phase. Returns a pointer to the
12778 resulting cube if successful; NULL otherwise.
12779 <p>
12782 <p>
12784 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLiteral.c"TARGET="ABSTRACT"><CODE>cuddLiteral.c</CODE></A>
12786 <dt><pre>
12788 DdNode * <I></I>
12793 )
12794 </pre>
12795 <dd> Performs the recursive step of Cudd_bddMakePrime.
12796 Returns the prime if successful; NULL otherwise.
12797 <p>
12800 <p>
12802 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
12804 <dt><pre>
12806 DdNode * <I></I>
12811 )
12812 </pre>
12813 <dd> Implements the recursive step of Cudd_bddNPAnd.
12814 Returns a pointer to the result is successful; NULL otherwise.
12815 <p>
12818 <p>
12821 </code>
12823 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12825 <dt><pre>
12827 static DdNode * <I></I>
12833 )
12834 </pre>
12835 <dd> Recursively puts the BDD in the order given in the array permut.
12836 Checks for trivial cases to terminate recursion, then splits on the
12837 children of this node. Once the solutions for the children are
12838 obtained, it puts into the current position the node from the rest of
12839 the BDD that should be here. Then returns this BDD.
12840 The key here is that the node being visited is NOT put in its proper
12841 place by this instance, but rather is switched when its proper position
12842 is reached in the recursion tree.<p>
12843 The DdNode * that is returned is the same BDD as passed in as node,
12844 but in the new order.
12845 <p>
12848 <p>
12852 </code>
12854 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
12856 <dt><pre>
12858 DdNode * <I></I>
12863 )
12864 </pre>
12865 <dd> Performs the recursive step of Cudd_bddRestrict.
12866 Returns the restricted BDD if successful; otherwise NULL.
12867 <p>
12870 <p>
12873 </code>
12875 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12877 <dt><pre>
12879 static DdNode * <I></I>
12884 )
12885 </pre>
12886 <dd> Performs the recursive step of Cudd_bddSqueeze. This
12887 procedure exploits the fact that if we complement and swap the
12888 bounds of the interval we obtain a valid solution by taking the
12889 complement of the solution to the original problem. Therefore, we
12890 can enforce the condition that the upper bound is always regular.
12891 Returns a pointer to the result if successful; NULL otherwise.
12892 <p>
12895 <p>
12898 </code>
12900 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenCof.c"TARGET="ABSTRACT"><CODE>cuddGenCof.c</CODE></A>
12902 <dt><pre>
12904 static DdNode * <I></I>
12910 )
12911 </pre>
12912 <dd> Performs the recursive step of Cudd_bddTransfer.
12913 Returns a pointer to the result if successful; NULL otherwise.
12914 <p>
12917 <p>
12920 </code>
12922 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
12924 <dt><pre>
12926 DdNode * <I></I>
12931 )
12932 </pre>
12933 <dd> Convert a BDD from a manager to another one. Returns a
12934 pointer to the BDD in the destination manager if successful; NULL
12935 otherwise.
12936 <p>
12939 <p>
12942 </code>
12944 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
12946 <dt><pre>
12948 static DdNode * <I></I>
12952 )
12953 </pre>
12954 <dd> Implements the recursive step of Cudd_bddVarMap.
12955 Returns a pointer to the result if successful; NULL otherwise.
12956 <p>
12959 <p>
12962 </code>
12964 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
12966 <dt><pre>
12968 static DdNode * <I></I>
12975 )
12976 </pre>
12977 <dd> Performs the recursive step of Cudd_bddVectorCompose.
12978 <p>
12981 <p>
12983 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
12985 <dt><pre>
12987 DdNode * <I></I>
12993 )
12994 </pre>
12995 <dd> Takes the exclusive OR of two BDDs and simultaneously abstracts
12996 the variables in cube. The variables are existentially abstracted. Returns a
12997 pointer to the result is successful; NULL otherwise.
12998 <p>
13001 <p>
13004 </code>
13006 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddAbs.c"TARGET="ABSTRACT"><CODE>cuddBddAbs.c</CODE></A>
13008 <dt><pre>
13010 DdNode * <I></I>
13015 )
13016 </pre>
13017 <dd> Implements the recursive step of Cudd_bddXor by taking
13018 the exclusive OR of two BDDs. Returns a pointer to the result is
13019 successful; NULL otherwise.
13020 <p>
13023 <p>
13026 </code>
13028 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBddIte.c"TARGET="ABSTRACT"><CODE>cuddBddIte.c</CODE></A>
13030 <dt><pre>
13032 DdNode * <I></I>
13041 )
13042 </pre>
13043 <dd> Applies the biased remapping underappoximation algorithm.
13044 Proceeds in three phases:
13045 <ul>
13046 <li> collect information on each node in the BDD; this is done via DFS.
13047 <li> traverse the BDD in top-down fashion and compute for each node
13048 whether remapping increases density.
13049 <li> traverse the BDD via DFS and actually perform the elimination.
13050 </ul>
13051 Returns the approximated BDD if successful; NULL otherwise.
13052 <p>
13055 <p>
13058 </code>
13060 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
13062 <dt><pre>
13064 DdNode * <I></I>
13070 )
13071 </pre>
13072 <dd> Performs the recursive step of Cudd_CProjection. Returns
13073 the projection if successful; NULL otherwise.
13074 <p>
13077 <p>
13080 </code>
13082 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
13084 <dt><pre>
13086 void <I></I>
13089 )
13090 </pre>
13091 <dd> Flushes the cache.
13092 <p>
13095 <p>
13097 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13099 <dt><pre>
13101 void <I></I>
13107 )
13108 </pre>
13109 <dd> Inserts a result in the cache for a function with two
13110 operands.
13111 <p>
13114 <p>
13118 </code>
13120 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13122 <dt><pre>
13124 void <I></I>
13131 )
13132 </pre>
13133 <dd> Inserts a result in the cache for a function with two
13134 operands.
13135 <p>
13138 <p>
13142 </code>
13144 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13146 <dt><pre>
13148 void <I></I>
13156 )
13157 </pre>
13158 <dd> Inserts a result in the cache.
13159 <p>
13162 <p>
13166 </code>
13168 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13170 <dt><pre>
13172 DdNode * <I></I>
13177 )
13178 </pre>
13179 <dd> Returns the result if found; it returns NULL if no
13180 result is found.
13181 <p>
13184 <p>
13188 </code>
13190 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13192 <dt><pre>
13194 DdNode * <I></I>
13199 )
13200 </pre>
13201 <dd> Returns the result if found; it returns NULL if no
13202 result is found.
13203 <p>
13206 <p>
13210 </code>
13212 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13214 <dt><pre>
13216 DdNode * <I></I>
13222 )
13223 </pre>
13224 <dd> Returns the result if found; it returns NULL if no
13225 result is found.
13226 <p>
13229 <p>
13233 </code>
13235 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13237 <dt><pre>
13239 DdNode * <I></I>
13245 )
13246 </pre>
13247 <dd> Returns the result if found; it returns NULL if no
13248 result is found.
13249 <p>
13252 <p>
13256 </code>
13258 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13260 <dt><pre>
13262 DdNode * <I></I>
13269 )
13270 </pre>
13271 <dd> Returns the result if found; it returns NULL if no
13272 result is found.
13273 <p>
13276 <p>
13280 </code>
13282 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13284 <dt><pre>
13286 DdNode * <I></I>
13293 )
13294 </pre>
13295 <dd> Returns the result if found; it returns NULL if no
13296 result is found.
13297 <p>
13300 <p>
13304 </code>
13306 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13308 <dt><pre>
13310 int <I></I>
13314 )
13315 </pre>
13316 <dd> Computes and prints a profile of the cache usage.
13318 <p>
13321 <p>
13323 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13325 <dt><pre>
13327 void <I></I>
13330 )
13331 </pre>
13332 <dd> Resizes the cache.
13333 <p>
13336 <p>
13338 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13340 <dt><pre>
13342 static int <I></I>
13347 )
13348 </pre>
13349 <dd> Checks whether a collision list is ordered.
13350 <p>
13353 <p>
13355 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
13357 <dt><pre>
13359 int <I></I>
13363 )
13364 </pre>
13367 constant functions cause cuddCheckCube to return 0.
13368 <p>
13371 <p>
13373 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCof.c"TARGET="ABSTRACT"><CODE>cuddCof.c</CODE></A>
13375 <dt><pre>
13377 void <I></I>
13380 )
13381 </pre>
13382 <dd> Clears the death row.
13383 <p>
13386 <p>
13392 </code>
13394 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
13396 <dt><pre>
13398 DdNode * <I></I>
13403 )
13404 </pre>
13405 <dd> Performs the recursive step of Cudd_Cofactor. Returns a
13406 pointer to the cofactor if successful; NULL otherwise.
13407 <p>
13410 <p>
13413 </code>
13415 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCof.c"TARGET="ABSTRACT"><CODE>cuddCof.c</CODE></A>
13417 <dt><pre>
13419 int <I></I>
13423 )
13424 </pre>
13425 <dd> Traverses the DD f and collects all its nodes in a
13426 symbol table. f is assumed to be a regular pointer and
13427 cuddCollectNodes guarantees this assumption in the recursive calls.
13429 <p>
13432 <p>
13434 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
13436 <dt><pre>
13438 int <I></I>
13441 )
13442 </pre>
13444 The input value is assumed to be greater than 0.
13445 <p>
13448 <p>
13450 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13452 <dt><pre>
13454 static int <I></I>
13460 )
13461 </pre>
13462 <dd> Procedure to compute two conjunctive factors of f and
13463 place in *c1 and *c2. Sets up the required data - table of distances
13464 from the constant and local reference count. Also minterm table.
13465 <p>
13467 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddDecomp.c"TARGET="ABSTRACT"><CODE>cuddDecomp.c</CODE></A>
13469 <dt><pre>
13471 DdNode * <I></I>
13478 )
13479 </pre>
13480 <dd> Looks up in the cache for the result of op applied to f,
13481 g, and h. Assumes that the calling procedure (e.g.,
13482 Cudd_bddIteConstant) is only interested in whether the result is
13483 constant or not. Returns the result if found (possibly
13484 DD_NON_CONSTANT); otherwise it returns NULL.
13485 <p>
13488 <p>
13491 </code>
13493 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
13495 <dt><pre>
13497 int <I></I>
13501 )
13502 </pre>
13503 <dd> Destroys the n most recently created subtables in a unique
13504 table. n should be positive. The subtables should not contain any live
13505 nodes, except the (isolated) projection function. The projection
13507 <p>
13510 destroyed if it exists. In this case the cache is also cleared.
13511 <p>
13515 </code>
13517 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
13519 <dt><pre>
13521 static void <I></I>
13525 )
13526 </pre>
13527 <dd> Rebalances a red/black tree.
13528 <p>
13531 <p>
13533 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
13535 <dt><pre>
13537 DdNode * <I></I>
13540 )
13541 </pre>
13542 <dd> Dynamically allocates a Node. This procedure is similar
13543 to cuddAllocNode in Cudd_Table.c, but it does not attempt garbage
13544 collection, because during reordering there are no dead nodes.
13545 Returns a pointer to a new node if successful; NULL is memory is
13546 full.
13547 <p>
13550 <p>
13553 </code>
13555 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
13557 <dt><pre>
13559 static int <I></I>
13563 )
13564 </pre>
13565 <dd> Performs the recursive step of Cudd_CofactorEstimateSimple.
13566 Returns an estimate of the number of nodes in the DD of the positive
13567 cofactor of node. Uses the least significant bit of the next field as
13568 visited flag. node is supposed to be regular; the invariant is maintained
13569 by this procedure.
13570 <p>
13573 <p>
13575 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
13577 <dt><pre>
13579 static int <I></I>
13587 )
13588 </pre>
13589 <dd> Performs the recursive step of Cudd_CofactorEstimate.
13590 Returns an estimate of the number of nodes in the DD of a
13591 cofactor of node. Uses the least significant bit of the next field as
13592 visited flag. node is supposed to be regular; the invariant is maintained
13593 by this procedure.
13594 <p>
13597 <p>
13599 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
13601 <dt><pre>
13603 int <I></I>
13608 )
13609 </pre>
13610 <dd> Exact variable ordering algorithm. Finds an optimum
13611 order for the variables between lower and upper. Returns 1 if
13612 successful; 0 otherwise.
13613 <p>
13616 <p>
13618 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
13620 <dt><pre>
13622 static int <I></I>
13626 )
13627 </pre>
13629 as soon as one parent is found. Returns 0 is the search is fruitless.
13630 <p>
13633 <p>
13635 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
13637 <dt><pre>
13639 void <I></I>
13642 )
13643 </pre>
13644 <dd> Frees the resources associated to a unique table.
13645 <p>
13648 <p>
13651 </code>
13653 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
13655 <dt><pre>
13657 int <I></I>
13661 )
13662 </pre>
13663 <dd> Performs garbage collection on the BDD and ZDD unique tables.
13664 If clearCache is 0, the cache is not cleared. This should only be
13665 specified if the cache has been cleared right before calling
13666 cuddGarbageCollect. (As in the case of dynamic reordering.)
13667 Returns the total number of deleted nodes.
13668 <p>
13671 <p>
13673 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
13675 <dt><pre>
13677 int <I></I>
13682 )
13683 </pre>
13684 <dd> Genetic algorithm for DD reordering.
13685 The two children of a crossover will be stored in
13686 storedd[popsize
13687 <p>
13690 <p>
13692 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
13694 <dt><pre>
13696 void <I></I>
13701 )
13702 </pre>
13703 <dd> Computes the children of g.
13704 <p>
13707 <p>
13709 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCof.c"TARGET="ABSTRACT"><CODE>cuddCof.c</CODE></A>
13711 <dt><pre>
13713 static DdHashItem * <I></I>
13716 )
13717 </pre>
13718 <dd> Fast storage allocation for items in a hash table. The
13719 first 4 bytes of a chunk contain a pointer to the next block; the
13720 rest contains DD_MEM_CHUNK spaces for hash items. Returns a pointer to
13721 a new item if successful; NULL is memory is full.
13722 <p>
13725 <p>
13729 </code>
13731 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13733 <dt><pre>
13735 DdHashTable * <I></I>
13740 )
13741 </pre>
13742 <dd> Initializes a hash table. Returns a pointer to the new
13743 table if successful; NULL otherwise.
13744 <p>
13747 <p>
13750 </code>
13752 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13754 <dt><pre>
13756 int <I></I>
13762 )
13763 </pre>
13764 <dd> Inserts an item in a hash table when the key is one pointer.
13766 <p>
13769 <p>
13775 </code>
13777 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13779 <dt><pre>
13781 int <I></I>
13788 )
13789 </pre>
13790 <dd> Inserts an item in a hash table when the key is
13792 <p>
13795 <p>
13801 </code>
13803 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13805 <dt><pre>
13807 int <I></I>
13815 )
13816 </pre>
13817 <dd> Inserts an item in a hash table when the key is
13819 <p>
13822 <p>
13828 </code>
13830 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13832 <dt><pre>
13834 int <I></I>
13840 )
13841 </pre>
13842 <dd> Inserts an item in a hash table when the key has more than
13844 <p>
13847 <p>
13853 </code>
13855 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13857 <dt><pre>
13859 DdNode * <I></I>
13863 )
13864 </pre>
13865 <dd> Looks up a key consisting of one pointer in a hash table.
13866 Returns the value associated to the key if there is an entry for the given
13867 key in the table; NULL otherwise. If the entry is present, its reference
13868 counter is decremented if not saturated. If the counter reaches 0, the
13869 value of the entry is dereferenced, and the entry is returned to the free
13870 list.
13871 <p>
13874 <p>
13880 </code>
13882 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13884 <dt><pre>
13886 DdNode * <I></I>
13891 )
13892 </pre>
13893 <dd> Looks up a key consisting of two pointer in a hash table.
13894 Returns the value associated to the key if there is an entry for the given
13895 key in the table; NULL otherwise. If the entry is present, its reference
13896 counter is decremented if not saturated. If the counter reaches 0, the
13897 value of the entry is dereferenced, and the entry is returned to the free
13898 list.
13899 <p>
13902 <p>
13908 </code>
13910 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13912 <dt><pre>
13914 DdNode * <I></I>
13920 )
13921 </pre>
13922 <dd> Looks up a key consisting of three pointers in a hash table.
13923 Returns the value associated to the key if there is an entry for the given
13924 key in the table; NULL otherwise. If the entry is present, its reference
13925 counter is decremented if not saturated. If the counter reaches 0, the
13926 value of the entry is dereferenced, and the entry is returned to the free
13927 list.
13928 <p>
13931 <p>
13937 </code>
13939 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13941 <dt><pre>
13943 DdNode * <I></I>
13947 )
13948 </pre>
13949 <dd> Looks up a key consisting of more than three pointers
13950 in a hash table. Returns the value associated to the key if there
13951 is an entry for the given key in the table; NULL otherwise. If the
13952 entry is present, its reference counter is decremented if not
13953 saturated. If the counter reaches 0, the value of the entry is
13954 dereferenced, and the entry is returned to the free list.
13955 <p>
13958 <p>
13964 </code>
13966 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13968 <dt><pre>
13970 void <I></I>
13973 )
13974 </pre>
13975 <dd> Shuts down a hash table, dereferencing all the values.
13976 <p>
13979 <p>
13982 </code>
13984 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
13986 <dt><pre>
13988 static int <I></I>
13991 )
13992 </pre>
13994 otherwise.
13995 <p>
13998 <p>
14001 </code>
14003 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14005 <dt><pre>
14007 int <I></I>
14010 )
14011 </pre>
14012 <dd> Prints to the manager's stdout the number of live nodes for each
14013 level of the DD heap that contains at least one live node. It also
14014 prints a summary containing:
14015 <ul>
14016 <li> total number of tables;
14017 <li> number of tables with live nodes;
14018 <li> table with the largest number of live nodes;
14019 <li> number of nodes in that table.
14020 </ul>
14021 If more than one table contains the maximum number of live nodes,
14022 only the one of lowest index is reported. Returns 1 in case of success
14023 and 0 otherwise.
14024 <p>
14027 <p>
14029 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCheck.c"TARGET="ABSTRACT"><CODE>cuddCheck.c</CODE></A>
14031 <dt><pre>
14033 int <I></I>
14038 )
14039 </pre>
14040 <dd> Initializes the computed table. It is called by
14042 <p>
14045 <p>
14048 </code>
14050 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCache.c"TARGET="ABSTRACT"><CODE>cuddCache.c</CODE></A>
14052 <dt><pre>
14054 int <I></I>
14057 )
14058 </pre>
14059 <dd> Initializes the interaction matrix. The interaction
14060 matrix is implemented as a bit vector storing the upper triangle of
14061 the symmetric interaction matrix. The bit vector is kept in an array
14062 of long integers. The computation is based on a series of depth-first
14063 searches, one for each root of the DAG. Two flags are needed: The
14064 local visited flag uses the LSB of the then pointer. The global
14065 visited flag uses the LSB of the next pointer.
14067 <p>
14070 <p>
14072 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInteract.c"TARGET="ABSTRACT"><CODE>cuddInteract.c</CODE></A>
14074 <dt><pre>
14076 int <I></I>
14079 )
14080 </pre>
14082 successful; 0 otherwise.
14083 <p>
14086 <p>
14088 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
14090 <dt><pre>
14092 DdManager * <I></I>
14098 )
14099 </pre>
14100 <dd> Creates and initializes the unique table. Returns a pointer
14101 to the table if successful; NULL otherwise.
14102 <p>
14105 <p>
14109 </code>
14111 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14113 <dt><pre>
14115 int <I></I>
14120 )
14121 </pre>
14122 <dd> Inserts n new subtables in a unique table at level.
14123 The number n should be positive, and level should be an existing level.
14125 <p>
14128 <p>
14131 </code>
14133 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14135 <dt><pre>
14137 int <I></I>
14141 )
14142 </pre>
14143 <dd> Checks whether a node is in the death row. Returns the
14144 position of the first occurrence if the node is present; -1
14145 otherwise.
14146 <p>
14149 <p>
14153 </code>
14155 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
14157 <dt><pre>
14159 void <I></I>
14163 )
14164 </pre>
14165 <dd> Remove an item from the front of a level queue.
14166 <p>
14169 <p>
14172 </code>
14174 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
14176 <dt><pre>
14178 void * <I></I>
14183 )
14184 </pre>
14185 <dd> Inserts a new key in a level queue. A new entry is
14186 created in the queue only if the node is not already
14187 enqueued. Returns a pointer to the queue item if successful; NULL
14188 otherwise.
14189 <p>
14192 <p>
14196 </code>
14198 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
14200 <dt><pre>
14202 DdLevelQueue * <I></I>
14207 )
14208 </pre>
14209 <dd> Initializes a level queue. A level queue is a queue
14210 where inserts are based on the levels of the nodes. Within each
14211 level the policy is FIFO. Level queues are useful in traversing a
14212 BDD top-down. Queue items are kept in a free list when dequeued for
14213 efficiency. Returns a pointer to the new queue if successful; NULL
14214 otherwise.
14215 <p>
14218 <p>
14223 </code>
14225 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
14227 <dt><pre>
14229 void <I></I>
14232 )
14233 </pre>
14234 <dd> Shuts down a level queue and releases all the
14235 associated memory.
14236 <p>
14239 <p>
14242 </code>
14244 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
14246 <dt><pre>
14248 int <I></I>
14253 )
14254 </pre>
14255 <dd> BDD reduction based on combination of sifting and linear
14256 transformations. Assumes that no dead nodes are present.
14257 <ol>
14258 <li> Order all the variables according to the number of entries
14259 in each unique table.
14260 <li> Sift the variable up and down, remembering each time the
14261 total size of the DD heap. At each position, linear transformation
14262 of the two adjacent variables is tried and is accepted if it reduces
14263 the size of the DD.
14264 <li> Select the best permutation.
14266 </ol>
14268 <p>
14271 <p>
14273 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
14275 <dt><pre>
14277 int <I></I>
14282 )
14283 </pre>
14284 <dd> Linearly combines two adjacent variables. Specifically,
14285 replaces the top variable with the exclusive nor of the two variables.
14286 It assumes that no dead nodes are present on entry to this
14287 procedure. The procedure then guarantees that no dead nodes will be
14288 present when it terminates. cuddLinearInPlace assumes that x <
14289 y. Returns the number of keys in the table if successful; 0
14290 otherwise.
14291 <p>
14294 modified. The global counters of the unique table are also affected.
14295 <p>
14298 </code>
14300 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
14302 <dt><pre>
14304 static void <I></I>
14307 )
14308 </pre>
14309 <dd> Inserts a local cache in the manager list.
14310 <p>
14313 <p>
14315 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14317 <dt><pre>
14319 void <I></I>
14322 )
14323 </pre>
14324 <dd> Clears the local caches of a manager.
14325 Used before reordering.
14326 <p>
14329 <p>
14331 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14333 <dt><pre>
14335 void <I></I>
14338 )
14339 </pre>
14340 <dd> Clears the dead entries of the local caches of a manager.
14341 Used during garbage collection.
14342 <p>
14345 <p>
14347 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14349 <dt><pre>
14351 DdLocalCache * <I></I>
14357 )
14358 </pre>
14359 <dd> Initializes a computed table. Returns a pointer the
14360 the new local cache in case of success; NULL otherwise.
14361 <p>
14364 <p>
14367 </code>
14369 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14371 <dt><pre>
14373 void <I></I>
14378 )
14379 </pre>
14380 <dd> Inserts a result in a local cache.
14381 <p>
14384 <p>
14386 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14388 <dt><pre>
14390 DdNode * <I></I>
14394 )
14395 </pre>
14396 <dd> Looks up in a local cache. Returns the result if found;
14397 it returns NULL if no result is found.
14398 <p>
14401 <p>
14403 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14405 <dt><pre>
14407 int <I></I>
14410 )
14411 </pre>
14412 <dd> Computes and prints a profile of a local cache usage.
14414 <p>
14417 <p>
14419 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14421 <dt><pre>
14423 void <I></I>
14426 )
14427 </pre>
14428 <dd> Initializes the computed table. It is called by
14429 Cudd_Init. Returns a pointer the the new local cache in case of
14430 success; NULL otherwise.
14431 <p>
14434 <p>
14437 </code>
14439 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14441 <dt><pre>
14443 static void <I></I>
14446 )
14447 </pre>
14448 <dd> Removes a local cache from the manager list.
14449 <p>
14452 <p>
14454 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14456 <dt><pre>
14458 static void <I></I>
14461 )
14462 </pre>
14463 <dd> Resizes a local cache.
14464 <p>
14467 <p>
14469 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
14471 <dt><pre>
14473 DdNode * <I></I>
14477 )
14478 </pre>
14479 <dd> Converts a ZDD cover to a BDD graph. If successful, it
14480 returns a BDD node, otherwise it returns NULL. It is a recursive
14481 algorithm as the following. First computes 3 cofactors of a ZDD cover;
14482 f1, f0 and fd. Second, compute BDDs(b1, b0 and bd) of f1, f0 and fd.
14483 Third, compute T=b1+bd and E=b0+bd. Fourth, compute ITE(v,T,E) where v
14484 is the variable which has the index of the top node of the ZDD cover.
14485 In this case, since the index of v can be larger than either one of T or
14486 one of E, cuddUniqueInterIVO is called, here IVO stands for
14487 independent variable ordering.
14488 <p>
14491 </code>
14493 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddIsop.c"TARGET="ABSTRACT"><CODE>cuddZddIsop.c</CODE></A>
14495 <dt><pre>
14497 static int <I></I>
14503 )
14504 </pre>
14505 <dd> Performs the recursive step of Cudd_MinHammingDist.
14506 It is based on the following identity. Let H(f) be the
14507 minimum Hamming distance of the minterms of f from the reference
14508 minterm. Then:
14509 <xmp>
14510 H(f) = min(H(f0)+h0,H(f1)+h1)
14511 </xmp>
14512 where f0 and f1 are the two cofactors of f with respect to its top
14515 The upper bound on the distance is used to bound the depth of the
14516 recursion.
14517 Returns the minimum distance unless it exceeds the upper bound or
14518 computation fails.
14519 <p>
14522 <p>
14525 </code>
14527 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
14529 <dt><pre>
14531 int <I></I>
14535 )
14536 </pre>
14537 <dd> Finds the next subtable with a larger index. Returns the
14538 index.
14539 <p>
14542 <p>
14545 </code>
14547 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
14549 <dt><pre>
14551 int <I></I>
14555 )
14556 </pre>
14557 <dd> Finds the next subtable with a smaller index. Returns the
14558 index.
14559 <p>
14562 <p>
14565 </code>
14567 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
14569 <dt><pre>
14571 static int <I></I>
14576 )
14577 </pre>
14578 <dd> Performs the recursive step of cuddNodeArray. Returns
14579 an the number of nodes in the DD. Clear the least significant bit
14580 of the next field that was used as visited flag by
14581 cuddNodeArrayRecur when counting the nodes. node is supposed to be
14582 regular; the invariant is maintained by this procedure.
14583 <p>
14586 <p>
14588 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
14590 <dt><pre>
14592 DdNodePtr * <I></I>
14596 )
14597 </pre>
14598 <dd> Traverses the DD f and collects all its nodes in an array.
14599 The caller should free the array returned by cuddNodeArray.
14600 Returns a pointer to the array of nodes in case of success; NULL
14601 otherwise. The nodes are collected in reverse topological order, so
14602 that a node is always preceded in the array by all its descendants.
14603 <p>
14606 <p>
14609 </code>
14611 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
14613 <dt><pre>
14615 static void <I></I>
14619 )
14620 </pre>
14621 <dd> Inserts a DdNode in a red/black search tree. Nodes from
14622 the same "page" (defined by DD_PAGE_MASK) are linked in a LIFO list.
14623 <p>
14626 <p>
14629 </code>
14631 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14633 <dt><pre>
14635 static DdNode * <I></I>
14639 )
14640 </pre>
14641 <dd> Threads all the nodes of a search tree into a linear
14642 list. For each node of the search tree, the "left" child, if non-null, has
14643 a lower address than its parent, and the "right" child, if non-null, has a
14644 higher address than its parent.
14645 The list is sorted in order of increasing addresses. The search
14646 tree is destroyed as a result of this operation. The last element of
14647 the linear list is made to point to the address passed in list. Each
14648 node if the search tree is a linearly-linked list of nodes from the
14649 same memory page (as defined in DD_PAGE_MASK). When a node is added to
14650 the linear list, all the elements of the linked list are added.
14651 <p>
14654 <p>
14657 </code>
14659 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14661 <dt><pre>
14663 void <I></I>
14667 )
14668 </pre>
14669 <dd> Prints out information on a node.
14670 <p>
14673 <p>
14675 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCheck.c"TARGET="ABSTRACT"><CODE>cuddCheck.c</CODE></A>
14677 <dt><pre>
14679 void <I></I>
14685 )
14686 </pre>
14687 <dd> Prints the variable groups as a parenthesized list.
14688 For each group the level range that it represents is printed. After
14689 each group, the group's flags are printed, preceded by a `|'. For
14690 each flag (except MTR_TERMINAL) a character is printed.
14691 <ul>
14692 <li>F: MTR_FIXED
14693 <li>N: MTR_NEWNODE
14694 <li>S: MTR_SOFT
14695 </ul>
14696 The second argument, silent, if different from 0, causes
14697 Cudd_PrintVarGroups to only check the syntax of the group tree.
14698 <p>
14701 <p>
14703 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCheck.c"TARGET="ABSTRACT"><CODE>cuddCheck.c</CODE></A>
14705 <dt><pre>
14707 int <I></I>
14711 )
14712 </pre>
14713 <dd> Prints a DD to the standard output. One line per node is
14715 <p>
14718 <p>
14721 </code>
14723 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
14725 <dt><pre>
14727 void <I></I>
14731 )
14732 </pre>
14733 <dd> Brings children of a dead ZDD node back.
14734 <p>
14737 <p>
14740 </code>
14742 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
14744 <dt><pre>
14746 void <I></I>
14750 )
14751 </pre>
14752 <dd> Brings children of a dead node back.
14753 <p>
14756 <p>
14759 </code>
14761 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
14763 <dt><pre>
14765 void <I></I>
14769 )
14770 </pre>
14771 <dd> Doubles the size of a unique subtable and rehashes its
14772 contents.
14773 <p>
14776 <p>
14778 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14780 <dt><pre>
14782 DdNode * <I></I>
14789 )
14790 </pre>
14791 <dd> Applies the remapping underappoximation algorithm.
14792 Proceeds in three phases:
14793 <ul>
14794 <li> collect information on each node in the BDD; this is done via DFS.
14795 <li> traverse the BDD in top-down fashion and compute for each node
14796 whether remapping increases density.
14797 <li> traverse the BDD via DFS and actually perform the elimination.
14798 </ul>
14799 Returns the approximated BDD if successful; NULL otherwise.
14800 <p>
14803 <p>
14806 </code>
14808 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
14810 <dt><pre>
14812 int <I></I>
14815 )
14816 </pre>
14818 successful; 0 otherwise.
14819 <p>
14822 <p>
14824 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
14826 <dt><pre>
14828 int <I></I>
14832 )
14833 </pre>
14834 <dd> Increases the number of ZDD subtables in a unique table so
14835 that it meets or exceeds index. When new ZDD variables are created, it
14836 is possible to preserve the functions unchanged, or it is possible to
14837 preserve the covers unchanged, but not both. cuddResizeTableZdd preserves
14839 <p>
14842 <p>
14845 </code>
14847 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14849 <dt><pre>
14851 static void <I></I>
14854 )
14855 </pre>
14856 <dd> Performs the left rotation for red/black trees.
14857 <p>
14860 <p>
14863 </code>
14865 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14867 <dt><pre>
14869 static void <I></I>
14872 )
14873 </pre>
14874 <dd> Performs the right rotation for red/black trees.
14875 <p>
14878 <p>
14881 </code>
14883 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14885 <dt><pre>
14887 void <I></I>
14892 )
14893 </pre>
14895 sets the corresponding bit of the interaction matrix to 1.
14896 <p>
14899 <p>
14901 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInteract.c"TARGET="ABSTRACT"><CODE>cuddInteract.c</CODE></A>
14903 <dt><pre>
14905 void <I></I>
14908 )
14909 </pre>
14910 <dd> Shrinks the death row by a factor of four.
14911 <p>
14914 <p>
14917 </code>
14919 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
14921 <dt><pre>
14923 void <I></I>
14927 )
14928 </pre>
14929 <dd> Shrinks a subtable.
14930 <p>
14933 <p>
14936 </code>
14938 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14940 <dt><pre>
14942 int <I></I>
14947 )
14948 </pre>
14949 <dd> Implementation of Rudell's sifting algorithm.
14950 Assumes that no dead nodes are present.
14951 <ol>
14952 <li> Order all the variables according to the number of entries
14953 in each unique table.
14954 <li> Sift the variable up and down, remembering each time the
14955 total size of the DD heap.
14956 <li> Select the best permutation.
14958 </ol>
14960 <p>
14963 <p>
14965 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
14967 <dt><pre>
14969 void <I></I>
14972 )
14973 </pre>
14974 <dd> Adjusts parameters of a table to slow down its growth.
14975 <p>
14978 <p>
14980 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
14982 <dt><pre>
14984 DdNode * <I></I>
14993 )
14994 </pre>
14995 <dd> Implements the recursive step of Cudd_SolveEqn.
14996 Returns NULL if the intermediate solution blows up
14997 or reordering occurs. The parametric solutions are
14998 stored in the array G.
14999 <p>
15002 <p>
15006 </code>
15008 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSolve.c"TARGET="ABSTRACT"><CODE>cuddSolve.c</CODE></A>
15010 <dt><pre>
15012 DdNode* <I></I>
15021 )
15022 </pre>
15023 <dd> Implements the recursive step of Cudd_SplitSet. The
15024 procedure recursively traverses the BDD and checks to see if any
15025 node satisfies the minterm requirements as specified by 'n'. At any
15026 node X, n is compared to the number of minterms in the onset of X's
15027 children. If either of the child nodes have exactly n minterms, then
15028 that node is returned; else, if n is greater than the onset of one
15029 of the child nodes, that node is retained and the difference in the
15030 number of minterms is extracted from the other child. In case n
15031 minterms can be extracted from constant 1, the algorithm returns the
15032 result with at most log(n) nodes.
15033 <p>
15036 to set the variables traversed by the procedure.
15037 <p>
15039 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSplit.c"TARGET="ABSTRACT"><CODE>cuddSplit.c</CODE></A>
15041 <dt><pre>
15043 enum st_retval <I></I>
15048 )
15049 </pre>
15050 <dd> Frees the memory used to store the minterm counts
15051 recorded in the visited table. Returns ST_CONTINUE.
15052 <p>
15055 <p>
15057 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
15059 <dt><pre>
15061 DdNode * <I></I>
15067 )
15068 </pre>
15069 <dd> Here a subset BDD is built by throwing away one of the
15070 children. Starting at root, annotate each node with the number of
15071 minterms (in terms of the total number of variables specified -
15072 numVars), number of nodes taken by the DAG rooted at this node and
15073 number of additional nodes taken by the child that has the lesser
15074 minterms. The child with the lower number of minterms is thrown away
15075 and a dyanmic count of the nodes of the subset is kept. Once the
15076 threshold is reached the subset is returned to the calling
15077 procedure.
15078 <p>
15081 <p>
15084 </code>
15086 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetHB.c"TARGET="ABSTRACT"><CODE>cuddSubsetHB.c</CODE></A>
15088 <dt><pre>
15090 DdNode * <I></I>
15097 )
15098 </pre>
15099 <dd> The outermost procedure to return a subset of the given
15100 BDD with the largest cubes. The path lengths are calculated, the maximum
15101 allowable path length is determined and the number of nodes of this
15102 path length that can be used to build a subset. If the threshold is
15103 larger than the size of the original BDD, the original BDD is
15104 returned.
15105 <p>
15108 <p>
15111 </code>
15113 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
15115 <dt><pre>
15117 int <I></I>
15122 )
15123 </pre>
15124 <dd> Swaps two adjacent variables. It assumes that no dead
15125 nodes are present on entry to this procedure. The procedure then
15126 guarantees that no dead nodes will be present when it terminates.
15127 cuddSwapInPlace assumes that x < y. Returns the number of keys in
15128 the table if successful; 0 otherwise.
15129 <p>
15132 <p>
15134 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
15136 <dt><pre>
15138 int <I></I>
15144 )
15145 </pre>
15146 <dd> Implementation of Plessier's algorithm that reorders
15147 variables by a sequence of (non-adjacent) swaps.
15148 <ol>
15149 <li> Select two variables (RANDOM or HEURISTIC).
15150 <li> Permute these variables.
15151 <li> If the nodes have decreased accept the permutation.
15152 <li> Otherwise reconstruct the original heap.
15153 <li> Loop.
15154 </ol>
15156 <p>
15159 <p>
15161 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
15163 <dt><pre>
15165 int <I></I>
15170 )
15171 </pre>
15172 <dd> Checks for symmetry of x and y. Ignores projection
15174 otherwise.
15175 <p>
15178 <p>
15180 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
15182 <dt><pre>
15184 int <I></I>
15189 )
15190 </pre>
15191 <dd> Symmetric sifting to convergence algorithm.
15192 Assumes that no dead nodes are present.
15193 <ol>
15194 <li> Order all the variables according to the number of entries in
15195 each unique subtable.
15196 <li> Sift the variable up and down, remembering each time the total
15197 size of the DD heap and grouping variables that are symmetric.
15198 <li> Select the best permutation.
15201 </ol>
15203 otherwise.
15204 <p>
15207 <p>
15210 </code>
15212 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
15214 <dt><pre>
15216 int <I></I>
15221 )
15222 </pre>
15223 <dd> Symmetric sifting algorithm.
15224 Assumes that no dead nodes are present.
15225 <ol>
15226 <li> Order all the variables according to the number of entries in
15227 each unique subtable.
15228 <li> Sift the variable up and down, remembering each time the total
15229 size of the DD heap and grouping variables that are symmetric.
15230 <li> Select the best permutation.
15232 </ol>
15234 otherwise.
15235 <p>
15238 <p>
15241 </code>
15243 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
15245 <dt><pre>
15247 int <I></I>
15252 )
15253 </pre>
15255 tests whether the corresponding bit of the interaction matrix is 1.
15256 Returns the value of the bit.
15257 <p>
15260 <p>
15262 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInteract.c"TARGET="ABSTRACT"><CODE>cuddInteract.c</CODE></A>
15264 <dt><pre>
15266 int <I></I>
15270 )
15271 </pre>
15272 <dd> Counts how many times a node is in the death row.
15273 <p>
15276 <p>
15281 </code>
15283 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddRef.c"TARGET="ABSTRACT"><CODE>cuddRef.c</CODE></A>
15285 <dt><pre>
15287 int <I></I>
15291 )
15292 </pre>
15293 <dd> Tree sifting algorithm. Assumes that a tree representing
15294 a group hierarchy is passed as a parameter. It then reorders each
15295 group in postorder fashion by calling ddTreeSiftingAux. Assumes that
15297 <p>
15300 <p>
15302 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
15304 <dt><pre>
15306 DdNode * <I></I>
15314 )
15315 </pre>
15316 <dd> Applies Tom Shiple's underappoximation algorithm. Proceeds
15317 in three phases:
15318 <ul>
15319 <li> collect information on each node in the BDD; this is done via DFS.
15320 <li> traverse the BDD in top-down fashion and compute for each node
15321 whether its elimination increases density.
15322 <li> traverse the BDD via DFS and actually perform the elimination.
15323 </ul>
15324 Returns the approximated BDD if successful; NULL otherwise.
15325 <p>
15328 <p>
15331 </code>
15333 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
15335 <dt><pre>
15337 DdNode * <I></I>
15341 )
15342 </pre>
15343 <dd> Checks the unique table for the existence of a constant node.
15344 If it does not exist, it creates a new one. Does not
15345 modify the reference count of whatever is returned. A newly created
15346 internal node comes back with a reference count 0. Returns a
15347 pointer to the new node.
15348 <p>
15351 <p>
15353 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
15355 <dt><pre>
15357 DdNode * <I></I>
15363 )
15364 </pre>
15365 <dd> Wrapper for cuddUniqueInter that is independent of
15366 variable ordering (IVO). This function does not require parameter
15367 index to precede the indices of the top nodes of T and E in the
15368 variable order. Returns a pointer to the result node under normal
15369 conditions; NULL if reordering occurred or memory was exhausted.
15370 <p>
15373 <p>
15377 </code>
15379 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
15381 <dt><pre>
15383 DdNode * <I></I>
15389 )
15390 </pre>
15391 <dd> Checks the unique table for the existence of an internal
15392 ZDD node. If it does not exist, it creates a new one. Does not
15393 modify the reference count of whatever is returned. A newly created
15394 internal node comes back with a reference count 0. For a newly
15395 created node, increments the reference counts of what T and E point
15396 to. Returns a pointer to the new node if successful; NULL if memory
15397 is exhausted or if reordering took place.
15398 <p>
15401 <p>
15404 </code>
15406 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
15408 <dt><pre>
15410 DdNode * <I></I>
15416 )
15417 </pre>
15418 <dd> Checks the unique table for the existence of an internal
15419 node. If it does not exist, it creates a new one. Does not
15420 modify the reference count of whatever is returned. A newly created
15421 internal node comes back with a reference count 0. For a newly
15422 created node, increments the reference counts of what T and E point
15423 to. Returns a pointer to the new node if successful; NULL if memory
15424 is exhausted or if reordering took place.
15425 <p>
15428 <p>
15431 </code>
15433 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
15435 <dt><pre>
15437 static DdNode * <I></I>
15443 )
15444 </pre>
15445 <dd> Checks the unique table for the existence of an internal
15446 node. Returns a pointer to the node if it is in the table; NULL otherwise.
15447 <p>
15450 <p>
15453 </code>
15455 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
15457 <dt><pre>
15459 void <I></I>
15464 )
15465 </pre>
15466 <dd> Updates the interaction matrix.
15467 <p>
15470 <p>
15472 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
15474 <dt><pre>
15476 DdNode * <I></I>
15483 )
15484 </pre>
15485 <dd> Implements the recursive step of Cudd_VerifySol.
15486 <p>
15489 <p>
15492 </code>
15494 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSolve.c"TARGET="ABSTRACT"><CODE>cuddSolve.c</CODE></A>
15496 <dt><pre>
15498 int <I></I>
15504 )
15505 </pre>
15506 <dd> Reorders by applying the method of the sliding window.
15507 Tries all possible permutations to the variables in a window that
15508 slides from low to high. The size of the window is determined by
15509 submethod. Assumes that no dead nodes are present. Returns 1 in
15510 case of success; 0 otherwise.
15511 <p>
15514 <p>
15516 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
15518 <dt><pre>
15520 static void <I></I>
15525 )
15526 </pre>
15527 <dd> XORs two rows of the linear transform matrix and replaces
15528 the first row with the result.
15529 <p>
15532 <p>
15534 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
15536 <dt><pre>
15538 int <I></I>
15541 )
15542 </pre>
15543 <dd> Reorders ZDD variables according to the order of the
15544 BDD variables. This function can be called at the end of BDD
15545 reordering to insure that the order of the ZDD variables is
15546 consistent with the order of the BDD variables. The number of ZDD
15547 variables must be a multiple of the number of BDD variables. Let
15552 Cudd_ReduceHeap, which clears the cache. Returns 1 in case of
15553 success; 0 otherwise.
15554 <p>
15557 garbage collection of the ZDD unique table.
15558 <p>
15562 </code>
15564 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
15566 <dt><pre>
15568 DdNode * <I></I>
15573 )
15574 </pre>
15575 <dd> Performs the recursive step of Cudd_zddChange.
15576 <p>
15579 <p>
15581 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
15583 <dt><pre>
15585 DdNode * <I></I>
15590 )
15591 </pre>
15592 <dd> Substitutes a variable with its complement in a ZDD.
15593 returns a pointer to the result if successful; NULL
15594 otherwise. cuddZddChange performs the same function as
15595 Cudd_zddChange, but does not restart if reordering has taken
15596 place. Therefore it can be called from within a recursive
15597 procedure.
15598 <p>
15601 <p>
15604 </code>
15606 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
15608 <dt><pre>
15610 DdNode * <I></I>
15614 )
15615 </pre>
15616 <dd> Computes the complement of a ZDD node. So far, since we
15617 couldn't find a direct way to get the complement of a ZDD cover, we first
15618 convert a ZDD cover to a BDD, then make the complement of the ZDD cover
15619 from the complement of the BDD node by using ISOP.
15620 <p>
15623 <p>
15625 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15627 <dt><pre>
15629 static double <I></I>
15635 )
15636 </pre>
15637 <dd> Performs the recursive step of Cudd_zddCountDouble.
15638 <p>
15641 <p>
15643 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddCount.c"TARGET="ABSTRACT"><CODE>cuddZddCount.c</CODE></A>
15645 <dt><pre>
15647 static int <I></I>
15653 )
15654 </pre>
15655 <dd> Performs the recursive step of Cudd_zddCount.
15656 <p>
15659 <p>
15661 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddCount.c"TARGET="ABSTRACT"><CODE>cuddZddCount.c</CODE></A>
15663 <dt><pre>
15665 static int <I></I>
15669 )
15670 </pre>
15671 <dd> Performs the recursive step of Cudd_zddDagSize. Does
15672 not check for out-of-memory conditions.
15673 <p>
15676 <p>
15678 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddMisc.c"TARGET="ABSTRACT"><CODE>cuddZddMisc.c</CODE></A>
15680 <dt><pre>
15682 DdNode * <I></I>
15687 )
15688 </pre>
15689 <dd> Performs the recursive step of Cudd_zddDiff.
15690 <p>
15693 <p>
15695 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
15697 <dt><pre>
15699 DdNode * <I></I>
15704 )
15705 </pre>
15706 <dd> Performs the recursive step of Cudd_zddDivideF.
15707 <p>
15710 <p>
15713 </code>
15715 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15717 <dt><pre>
15719 DdNode * <I></I>
15724 )
15725 </pre>
15726 <dd> Performs the recursive step of Cudd_zddDivide.
15727 <p>
15730 <p>
15733 </code>
15735 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15737 <dt><pre>
15739 void <I></I>
15742 )
15743 </pre>
15744 <dd> Frees the ZDD universe.
15745 <p>
15748 <p>
15751 </code>
15753 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInit.c"TARGET="ABSTRACT"><CODE>cuddInit.c</CODE></A>
15755 <dt><pre>
15757 int <I></I>
15764 )
15765 </pre>
15766 <dd> Computes the two-way decomposition of f w.r.t. v.
15767 <p>
15770 <p>
15773 </code>
15775 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15777 <dt><pre>
15779 int <I></I>
15787 )
15788 </pre>
15789 <dd> Computes the three-way decomposition of function f (represented
15791 <p>
15794 <p>
15797 </code>
15799 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15801 <dt><pre>
15803 int <I></I>
15807 )
15808 </pre>
15809 <dd> Returns the index of negative ZDD variable.
15810 <p>
15812 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15814 <dt><pre>
15816 int <I></I>
15820 )
15821 </pre>
15822 <dd> Returns the level of negative ZDD variable.
15823 <p>
15825 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15827 <dt><pre>
15829 DdNode * <I></I>
15835 )
15836 </pre>
15837 <dd> Wrapper for cuddUniqueInterZdd that is independent of
15838 variable ordering (IVO). This function does not require parameter
15839 index to precede the indices of the top nodes of g and h in the
15840 variable order. Returns a pointer to the result node under normal
15841 conditions; NULL if reordering occurred or memory was exhausted.
15842 <p>
15845 <p>
15849 </code>
15851 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
15853 <dt><pre>
15855 DdNode * <I></I>
15861 )
15862 </pre>
15863 <dd> Wrapper for cuddUniqueInterZdd, which applies the ZDD
15864 reduction rule. Returns a pointer to the result node under normal
15865 conditions; NULL if reordering occurred or memory was exhausted.
15866 <p>
15869 <p>
15872 </code>
15874 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
15876 <dt><pre>
15878 int <I></I>
15882 )
15883 </pre>
15884 <dd> Returns the index of positive ZDD variable.
15885 <p>
15887 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15889 <dt><pre>
15891 int <I></I>
15895 )
15896 </pre>
15897 <dd> Returns the level of positive ZDD variable.
15898 <p>
15900 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
15902 <dt><pre>
15904 int <I></I>
15907 )
15908 </pre>
15910 otherwise.
15911 <p>
15914 <p>
15917 </code>
15919 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInit.c"TARGET="ABSTRACT"><CODE>cuddInit.c</CODE></A>
15921 <dt><pre>
15923 DdNode * <I></I>
15928 )
15929 </pre>
15930 <dd> Performs the recursive step of Cudd_zddIntersect.
15931 <p>
15934 <p>
15936 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
15938 <dt><pre>
15940 DdNode * <I></I>
15946 )
15947 </pre>
15948 <dd> Performs the recursive step of Cudd_zddIsop.
15949 <p>
15952 <p>
15955 </code>
15957 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddIsop.c"TARGET="ABSTRACT"><CODE>cuddZddIsop.c</CODE></A>
15959 <dt><pre>
15961 DdNode * <I></I>
15967 )
15968 </pre>
15969 <dd> Performs the recursive step of Cudd_zddIte.
15970 <p>
15973 <p>
15975 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
15977 <dt><pre>
15979 static int <I></I>
15985 )
15986 </pre>
15987 <dd> Given xLow <= x <= xHigh moves x up and down between the
15988 boundaries. Finds the best position and does the required changes.
15990 <p>
15993 <p>
15995 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddLin.c"TARGET="ABSTRACT"><CODE>cuddZddLin.c</CODE></A>
15997 <dt><pre>
15999 static int <I></I>
16004 )
16005 </pre>
16006 <dd> Given a set of moves, returns the ZDD heap to the
16007 position giving the minimum size. In case of ties, returns to the
16008 closest position giving the minimum size. Returns 1 in case of
16009 success; 0 otherwise.
16010 <p>
16013 <p>
16015 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddLin.c"TARGET="ABSTRACT"><CODE>cuddZddLin.c</CODE></A>
16017 <dt><pre>
16019 static Move * <I></I>
16025 )
16026 </pre>
16027 <dd> Sifts a variable down. Moves x down until either it
16028 reaches the bound (xHigh) or the size of the ZDD heap increases too
16029 much. Returns the set of moves in case of success; NULL if memory is
16030 full.
16031 <p>
16034 <p>
16036 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddLin.c"TARGET="ABSTRACT"><CODE>cuddZddLin.c</CODE></A>
16038 <dt><pre>
16040 static int <I></I>
16045 )
16046 </pre>
16047 <dd> Linearly combines two adjacent variables. It assumes
16048 that no dead nodes are present on entry to this procedure. The
16049 procedure then guarantees that no dead nodes will be present when it
16050 terminates. cuddZddLinearInPlace assumes that x < y. Returns the
16051 number of keys in the table if successful; 0 otherwise.
16052 <p>
16055 <p>
16059 </code>
16061 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddLin.c"TARGET="ABSTRACT"><CODE>cuddZddLin.c</CODE></A>
16063 <dt><pre>
16065 int <I></I>
16070 )
16071 </pre>
16072 <dd> Implementation of the linear sifting algorithm for ZDDs.
16073 Assumes that no dead nodes are present.
16074 <ol>
16075 <li> Order all the variables according to the number of entries
16076 in each unique table.
16077 <li> Sift the variable up and down and applies the XOR transformation,
16078 remembering each time the total size of the DD heap.
16079 <li> Select the best permutation.
16081 </ol>
16083 <p>
16086 <p>
16088 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddLin.c"TARGET="ABSTRACT"><CODE>cuddZddLin.c</CODE></A>
16090 <dt><pre>
16092 static Move * <I></I>
16098 )
16099 </pre>
16100 <dd> Sifts a variable up applying the XOR
16101 transformation. Moves y up until either it reaches the bound (xLow)
16102 or the size of the ZDD heap increases too much. Returns the set of
16103 moves in case of success; NULL if memory is full.
16104 <p>
16107 <p>
16109 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddLin.c"TARGET="ABSTRACT"><CODE>cuddZddLin.c</CODE></A>
16111 <dt><pre>
16113 int <I></I>
16117 )
16118 </pre>
16119 <dd> Finds the next subtable with a larger index. Returns the
16120 index.
16121 <p>
16124 <p>
16126 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16128 <dt><pre>
16130 int <I></I>
16134 )
16135 </pre>
16136 <dd> Finds the next subtable with a smaller index. Returns the
16137 index.
16138 <p>
16141 <p>
16143 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16145 <dt><pre>
16147 DdNode * <I></I>
16152 )
16153 </pre>
16154 <dd> Performs the recursive step of Cudd_zddProduct.
16155 <p>
16158 <p>
16161 </code>
16163 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
16165 <dt><pre>
16167 int <I></I>
16171 )
16172 </pre>
16173 <dd> Prints a ZDD to the standard output. One line per node is
16175 <p>
16178 <p>
16181 </code>
16183 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
16185 <dt><pre>
16187 static int <I></I>
16193 )
16194 </pre>
16195 <dd> Given xLow <= x <= xHigh moves x up and down between the
16196 boundaries. Finds the best position and does the required changes.
16198 <p>
16201 <p>
16203 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16205 <dt><pre>
16207 static int <I></I>
16212 )
16213 </pre>
16214 <dd> Given a set of moves, returns the ZDD heap to the
16215 position giving the minimum size. In case of ties, returns to the
16216 closest position giving the minimum size. Returns 1 in case of
16217 success; 0 otherwise.
16218 <p>
16221 <p>
16223 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16225 <dt><pre>
16227 static Move * <I></I>
16233 )
16234 </pre>
16235 <dd> Sifts a variable down. Moves x down until either it
16236 reaches the bound (x_high) or the size of the ZDD heap increases too
16237 much. Returns the set of moves in case of success; NULL if memory is
16238 full.
16239 <p>
16242 <p>
16244 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16246 <dt><pre>
16248 static Move * <I></I>
16254 )
16255 </pre>
16256 <dd> Sifts a variable up. Moves y up until either it reaches
16257 the bound (x_low) or the size of the ZDD heap increases too much.
16258 Returns the set of moves in case of success; NULL if memory is full.
16259 <p>
16262 <p>
16264 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16266 <dt><pre>
16268 int <I></I>
16273 )
16274 </pre>
16275 <dd> Implementation of Rudell's sifting algorithm.
16276 Assumes that no dead nodes are present.
16277 <ol>
16278 <li> Order all the variables according to the number of entries
16279 in each unique table.
16280 <li> Sift the variable up and down, remembering each time the
16281 total size of the DD heap.
16282 <li> Select the best permutation.
16284 </ol>
16286 <p>
16289 <p>
16291 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16293 <dt><pre>
16295 DdNode * <I></I>
16300 )
16301 </pre>
16302 <dd> Computes the negative cofactor of a ZDD w.r.t. a
16303 variable. In terms of combinations, the result is the set of all
16304 combinations in which the variable is negated. Returns a pointer to
16305 the result if successful; NULL otherwise. cuddZddSubset0 performs
16306 the same function as Cudd_zddSubset0, but does not restart if
16307 reordering has taken place. Therefore it can be called from within a
16308 recursive procedure.
16309 <p>
16312 <p>
16316 </code>
16318 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
16320 <dt><pre>
16322 DdNode * <I></I>
16327 )
16328 </pre>
16329 <dd> Computes the positive cofactor of a ZDD w.r.t. a
16330 variable. In terms of combinations, the result is the set of all
16331 combinations in which the variable is asserted. Returns a pointer to
16332 the result if successful; NULL otherwise. cuddZddSubset1 performs
16333 the same function as Cudd_zddSubset1, but does not restart if
16334 reordering has taken place. Therefore it can be called from within a
16335 recursive procedure.
16336 <p>
16339 <p>
16343 </code>
16345 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
16347 <dt><pre>
16349 int <I></I>
16354 )
16355 </pre>
16356 <dd> Swaps two adjacent variables. It assumes that no dead
16357 nodes are present on entry to this procedure. The procedure then
16358 guarantees that no dead nodes will be present when it terminates.
16359 cuddZddSwapInPlace assumes that x < y. Returns the number of keys in
16360 the table if successful; 0 otherwise.
16361 <p>
16364 <p>
16366 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16368 <dt><pre>
16370 int <I></I>
16376 )
16377 </pre>
16378 <dd> Implementation of Plessier's algorithm that reorders
16379 variables by a sequence of (non-adjacent) swaps.
16380 <ol>
16381 <li> Select two variables (RANDOM or HEURISTIC).
16382 <li> Permute these variables.
16383 <li> If the nodes have decreased accept the permutation.
16384 <li> Otherwise reconstruct the original heap.
16385 <li> Loop.
16386 </ol>
16388 <p>
16391 <p>
16393 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16395 <dt><pre>
16397 int <I></I>
16402 )
16403 </pre>
16404 <dd> Checks for symmetry of x and y. Ignores projection
16405 functions, unless they are isolated. Returns 1 in case of
16406 symmetry; 0 otherwise.
16407 <p>
16410 <p>
16412 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16414 <dt><pre>
16416 static int <I></I>
16422 )
16423 </pre>
16424 <dd> Given x_low <= x <= x_high moves x up and down between the
16425 boundaries. Finds the best position and does the required changes.
16426 Assumes that x is not part of a symmetry group. Returns 1 if
16427 successful; 0 otherwise.
16428 <p>
16431 <p>
16433 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16435 <dt><pre>
16437 static int <I></I>
16442 )
16443 </pre>
16444 <dd> Given a set of moves, returns the ZDD heap to the
16445 position giving the minimum size. In case of ties, returns to the
16446 closest position giving the minimum size. Returns 1 in case of
16447 success; 0 otherwise.
16448 <p>
16451 <p>
16453 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16455 <dt><pre>
16457 static int <I></I>
16463 )
16464 </pre>
16465 <dd> Given x_low <= x <= x_high moves x up and down between the
16466 boundaries. Finds the best position and does the required changes.
16467 Assumes that x is either an isolated variable, or it is the bottom of
16468 a symmetry group. All symmetries may not have been found, because of
16470 <p>
16473 <p>
16475 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16477 <dt><pre>
16479 int <I></I>
16484 )
16485 </pre>
16486 <dd> Symmetric sifting to convergence algorithm for ZDDs.
16487 Assumes that no dead nodes are present.
16488 <ol>
16489 <li> Order all the variables according to the number of entries in
16490 each unique subtable.
16491 <li> Sift the variable up and down, remembering each time the total
16492 size of the ZDD heap and grouping variables that are symmetric.
16493 <li> Select the best permutation.
16496 </ol>
16498 otherwise.
16499 <p>
16502 <p>
16505 </code>
16507 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16509 <dt><pre>
16511 static Move * <I></I>
16517 )
16518 </pre>
16519 <dd> Moves x down until either it reaches the bound (x_high)
16520 or the size of the ZDD heap increases too much. Assumes that x is the
16521 bottom of a symmetry group. Checks x for symmetry to the adjacent
16522 variables. If symmetry is found, the symmetry group of x is merged
16523 with the symmetry group of the other variable. Returns the set of
16524 moves in case of success; ZDD_MV_OOM if memory is full.
16525 <p>
16528 <p>
16530 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16532 <dt><pre>
16534 static Move * <I></I>
16540 )
16541 </pre>
16542 <dd> Moves x up until either it reaches the bound (x_low) or
16543 the size of the ZDD heap increases too much. Assumes that x is the top
16544 of a symmetry group. Checks x for symmetry to the adjacent
16545 variables. If symmetry is found, the symmetry group of x is merged
16546 with the symmetry group of the other variable. Returns the set of
16547 moves in case of success; ZDD_MV_OOM if memory is full.
16548 <p>
16551 <p>
16553 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16555 <dt><pre>
16557 int <I></I>
16562 )
16563 </pre>
16564 <dd> Symmetric sifting algorithm.
16565 Assumes that no dead nodes are present.
16566 <ol>
16567 <li> Order all the variables according to the number of entries in
16568 each unique subtable.
16569 <li> Sift the variable up and down, remembering each time the total
16570 size of the ZDD heap and grouping variables that are symmetric.
16571 <li> Select the best permutation.
16573 </ol>
16575 otherwise.
16576 <p>
16579 <p>
16582 </code>
16584 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16586 <dt><pre>
16588 static void <I></I>
16595 )
16596 </pre>
16597 <dd> Counts numbers of symmetric variables and symmetry
16598 groups.
16599 <p>
16602 <p>
16604 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
16606 <dt><pre>
16608 int <I></I>
16612 )
16613 </pre>
16614 <dd> Tree sifting algorithm for ZDDs. Assumes that a tree
16615 representing a group hierarchy is passed as a parameter. It then
16616 reorders each group in postorder fashion by calling
16617 zddTreeSiftingAux. Assumes that no dead nodes are present. Returns
16619 <p>
16622 <p>
16624 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
16626 <dt><pre>
16628 DdNode * <I></I>
16633 )
16634 </pre>
16635 <dd> Performs the recursive step of Cudd_zddUnateProduct.
16636 <p>
16639 <p>
16642 </code>
16644 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
16646 <dt><pre>
16648 static Move* <I></I>
16652 )
16653 </pre>
16654 <dd> Given a set of moves, returns the ZDD heap to the
16655 order in effect before the moves. Returns 1 in case of success;
16656 0 otherwise.
16657 <p>
16660 <p>
16662 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddLin.c"TARGET="ABSTRACT"><CODE>cuddZddLin.c</CODE></A>
16664 <dt><pre>
16666 DdNode * <I></I>
16671 )
16672 </pre>
16673 <dd> Performs the recursive step of Cudd_zddUnion.
16674 <p>
16677 <p>
16679 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
16681 <dt><pre>
16683 int <I></I>
16687 )
16688 </pre>
16689 <dd> Comparison function used by qsort to order the
16690 variables according to the number of keys in the subtables.
16691 Returns the difference in number of keys between the two
16692 variables being compared.
16693 <p>
16696 <p>
16698 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
16700 <dt><pre>
16702 DdNode * <I></I>
16707 )
16708 </pre>
16709 <dd> Performs the recursive step of Cudd_zddWeakDivF.
16710 <p>
16713 <p>
16716 </code>
16718 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
16720 <dt><pre>
16722 DdNode * <I></I>
16727 )
16728 </pre>
16729 <dd> Performs the recursive step of Cudd_zddWeakDiv.
16730 <p>
16733 <p>
16736 </code>
16738 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddFuncs.c"TARGET="ABSTRACT"><CODE>cuddZddFuncs.c</CODE></A>
16740 <dt><pre>
16742 static DdNode * <I></I>
16746 )
16747 </pre>
16748 <dd> Performs the recursive step for Cudd_BddToAdd. Returns a
16749 pointer to the resulting ADD if successful; NULL otherwise.
16750 <p>
16753 <p>
16755 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddBridge.c"TARGET="ABSTRACT"><CODE>cuddBridge.c</CODE></A>
16757 <dt><pre>
16759 static int <I></I>
16765 )
16766 </pre>
16767 <dd> Checks the BDD variable group tree before a shuffle.
16769 <p>
16772 <p>
16774 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
16776 <dt><pre>
16778 static void <I></I>
16781 )
16782 </pre>
16783 <dd> Performs a DFS from f, clearing the LSB of the next
16784 pointers.
16785 <p>
16788 <p>
16792 </code>
16794 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
16796 <dt><pre>
16798 static void <I></I>
16803 )
16804 </pre>
16805 <dd> Scans the DD and clears the LSB of the next pointers.
16806 The LSB of the next pointers are used as markers to tell whether a
16807 node was reached. Once the roots are counted, these flags are
16808 reset.
16809 <p>
16812 <p>
16815 </code>
16817 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
16819 <dt><pre>
16821 static void <I></I>
16824 )
16825 </pre>
16826 <dd> The LSB of the next pointers are used as markers to tell
16827 whether a node was reached by at least one DFS. Once the interaction
16828 matrix is built, these flags are reset.
16829 <p>
16832 <p>
16834 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInteract.c"TARGET="ABSTRACT"><CODE>cuddInteract.c</CODE></A>
16836 <dt><pre>
16838 static void <I></I>
16841 )
16842 </pre>
16843 <dd> Performs a DFS from f, clearing the LSB of the then pointers.
16844 <p>
16847 <p>
16849 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInteract.c"TARGET="ABSTRACT"><CODE>cuddInteract.c</CODE></A>
16851 <dt><pre>
16853 static double * <I></I>
16858 )
16859 </pre>
16860 <dd> Traverses the DD node and computes the fraction of
16861 minterms in the on-set of all positive cofactors simultaneously.
16862 It allocates an array with two more entries than there are
16863 variables below the one labeling the node. One extra entry (the
16864 first in the array) is for the variable labeling the node. The other
16865 entry (the last one in the array) holds the fraction of minterms of
16866 the function rooted at node. Each other entry holds the value for
16867 one cofactor. The array is put in a symbol table, to avoid repeated
16868 computation, and its address is returned by the procedure, for use
16869 by the caller. Returns a pointer to the array of cofactor measures.
16870 <p>
16873 <p>
16875 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSign.c"TARGET="ABSTRACT"><CODE>cuddSign.c</CODE></A>
16877 <dt><pre>
16879 static int <I></I>
16883 )
16884 </pre>
16885 <dd> Counts the number of internal nodes of the group tree.
16886 Returns the count.
16887 <p>
16890 <p>
16892 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
16894 <dt><pre>
16896 static double <I></I>
16901 )
16902 </pre>
16903 <dd> Performs the recursive step of Cudd_CountMinterm.
16904 It is based on the following identity. Let |f| be the
16905 number of minterms of f. Then:
16906 <xmp>
16907 |f| = (|f0|+|f1|)/2
16908 </xmp>
16909 where f0 and f1 are the two cofactors of f. Does not use the
16910 identity |f'| = max - |f|, to minimize loss of accuracy due to
16911 roundoff. Returns the number of minterms of the function rooted at
16912 node.
16913 <p>
16916 <p>
16918 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
16920 <dt><pre>
16922 static double <I></I>
16926 )
16927 </pre>
16928 <dd> Performs the recursive step of Cudd_CountPath.
16929 It is based on the following identity. Let |f| be the
16930 number of paths of f. Then:
16931 <xmp>
16932 |f| = |f0|+|f1|
16933 </xmp>
16934 where f0 and f1 are the two cofactors of f. Uses the
16935 identity |f'| = |f|, to improve the utilization of the (local) cache.
16936 Returns the number of paths of the function rooted at node.
16937 <p>
16940 <p>
16942 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
16944 <dt><pre>
16946 static double <I></I>
16950 )
16951 </pre>
16952 <dd> Performs the recursive step of Cudd_CountPathsToNonZero.
16953 It is based on the following identity. Let |f| be the
16954 number of paths of f. Then:
16955 <xmp>
16956 |f| = |f0|+|f1|
16957 </xmp>
16958 where f0 and f1 are the two cofactors of f. Returns the number of
16959 paths of the function rooted at node.
16960 <p>
16963 <p>
16965 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
16967 <dt><pre>
16969 static int <I></I>
16974 )
16975 </pre>
16976 <dd> Counts the number of roots at the levels between lower and
16977 upper. The computation is based on breadth-first search.
16978 A node is a root if it is not reachable from any previously visited node.
16979 (All the nodes at level lower are therefore considered roots.)
16980 The visited flag uses the LSB of the next pointer. Returns the root
16981 count. The roots that are constant nodes are always ignored.
16982 <p>
16985 <p>
16988 </code>
16990 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
16992 <dt><pre>
16994 static void <I></I>
16999 )
17000 </pre>
17001 <dd> Creates a group encompassing variables from x to y in the
17002 DD table. In the current implementation it must be y == x+1.
17004 <p>
17007 <p>
17009 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17011 <dt><pre>
17013 static int <I></I>
17016 )
17017 </pre>
17018 <dd> Performs the recursive step of Cudd_DagSize. Returns the
17019 number of nodes in the graph rooted at n.
17020 <p>
17023 <p>
17025 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
17027 <dt><pre>
17029 static void <I></I>
17034 )
17035 </pre>
17036 <dd> x and y are variables in a group to be cut in two. The cut
17037 is to pass between x and y.
17038 <p>
17041 <p>
17043 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17045 <dt><pre>
17047 static int <I></I>
17055 )
17056 </pre>
17057 <dd> Performs the recursive step of Cudd_DumpBlif. Traverses
17058 the BDD f and writes a multiplexer-network description to the file
17059 pointed by fp in blif format. f is assumed to be a regular pointer
17060 and ddDoDumpBlif guarantees this assumption in the recursive calls.
17061 <p>
17064 <p>
17066 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
17068 <dt><pre>
17070 static int <I></I>
17078 )
17079 </pre>
17080 <dd> Performs the recursive step of Cudd_DumpDDcal. Traverses
17081 the BDD f and writes a line for each node to the file
17082 pointed by fp in DDcal format. f is assumed to be a regular pointer
17083 and ddDoDumpDDcal guarantees this assumption in the recursive calls.
17084 <p>
17087 <p>
17089 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
17091 <dt><pre>
17093 static int <I></I>
17101 )
17102 </pre>
17103 <dd> Performs the recursive step of Cudd_DumpDaVinci. Traverses
17104 the BDD f and writes a term expression to the file
17105 pointed by fp in daVinci format. f is assumed to be a regular pointer
17106 and ddDoDumpDaVinci guarantees this assumption in the recursive calls.
17107 <p>
17110 <p>
17112 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
17114 <dt><pre>
17116 static int <I></I>
17122 )
17123 </pre>
17124 <dd> Performs the recursive step of
17125 Cudd_DumpFactoredForm. Traverses the BDD f and writes a factored
17126 form for each node to the file pointed by fp in terms of the
17127 factored forms of the children. Constants are propagated, and
17128 absorption is applied. f is assumed to be a regular pointer and
17129 ddDoDumpFActoredForm guarantees this assumption in the recursive
17130 calls.
17131 <p>
17134 <p>
17137 </code>
17139 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExport.c"TARGET="ABSTRACT"><CODE>cuddExport.c</CODE></A>
17141 <dt><pre>
17143 static int <I></I>
17149 )
17150 </pre>
17151 <dd> Performs the recursive step of Cudd_EpdCountMinterm.
17152 It is based on the following identity. Let |f| be the
17153 number of minterms of f. Then:
17154 <xmp>
17155 |f| = (|f0|+|f1|)/2
17156 </xmp>
17157 where f0 and f1 are the two cofactors of f. Does not use the
17158 identity |f'| = max - |f|, to minimize loss of accuracy due to
17159 roundoff. Returns the number of minterms of the function rooted at
17160 node.
17161 <p>
17164 <p>
17166 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
17168 <dt><pre>
17170 static enum st_retval <I></I>
17175 )
17176 </pre>
17177 <dd> Frees the memory used to store the minterm counts
17178 recorded in the visited table. Returns ST_CONTINUE.
17179 <p>
17182 <p>
17184 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
17186 <dt><pre>
17188 static int <I></I>
17194 )
17195 </pre>
17196 <dd> This is the same funcion as ddSwapping except for
17197 comparison expression. Use probability function, exp(-size_change/temp).
17198 <p>
17201 <p>
17203 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
17205 <dt><pre>
17207 static int <I></I>
17212 )
17213 </pre>
17215 case of extended symmetry; 0 otherwise.
17216 <p>
17219 <p>
17221 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17223 <dt><pre>
17225 static DdNode * <I></I>
17229 )
17230 </pre>
17231 <dd> Implements the recursive step of Cudd_FindEssential.
17232 Returns a pointer to the cube BDD if successful; NULL otherwise.
17233 <p>
17236 <p>
17238 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
17240 <dt><pre>
17242 static void <I></I>
17248 )
17249 </pre>
17250 <dd> Finds the lower and upper bounds of the group
17251 represented by treenode. From the index and size fields we need to
17252 derive the current positions, and find maximum and minimum.
17253 <p>
17256 <p>
17258 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17260 <dt><pre>
17262 static DdTlcInfo * <I></I>
17267 )
17268 </pre>
17269 <dd> Implements the recursive step of
17270 Cudd_FindTwoLiteralClauses. The DD node is assumed to be not
17271 constant. Returns a pointer to a set of clauses if successful; NULL
17272 otherwise.
17273 <p>
17276 <p>
17278 <dd> <b>See Also</b> <code><a href="#Cudd_FindTwoLiteralClauses">Cudd_FindTwoLiteralClauses</a>
17279 </code>
17281 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
17283 <dt><pre>
17285 static void <I></I>
17288 )
17289 </pre>
17290 <dd> Adjusts the values of table fields controlling the.
17291 sizes of subtables and computed table. If the computed table is too small
17292 according to the new values, it is resized.
17293 <p>
17296 <p>
17298 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
17300 <dt><pre>
17302 static int <I></I>
17307 )
17308 </pre>
17310 success; 0 otherwise.
17311 <p>
17314 <p>
17316 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17318 <dt><pre>
17320 static int <I></I>
17326 )
17327 </pre>
17328 <dd> Swaps two groups and records the move. Returns the
17329 number of keys in the DD table in case of success; 0 otherwise.
17330 <p>
17333 <p>
17335 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17337 <dt><pre>
17339 static int <I></I>
17347 )
17348 </pre>
17349 <dd> Sifts one variable up and down until it has taken all
17350 positions. Checks for aggregation. There may be at most two sweeps,
17351 even if the group grows. Assumes that x is either an isolated
17352 variable, or it is the bottom of a group. All groups may not have
17353 been found. The variable being moved is returned to the best position
17355 <p>
17358 <p>
17360 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17362 <dt><pre>
17364 static int <I></I>
17371 )
17372 </pre>
17373 <dd> Determines the best position for a variables and returns
17375 <p>
17378 <p>
17380 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17382 <dt><pre>
17384 static int <I></I>
17391 )
17392 </pre>
17393 <dd> Sifts down a variable until it reaches position xHigh.
17394 Assumes that x is the bottom of a group (or a singleton). Records
17396 <p>
17399 <p>
17401 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17403 <dt><pre>
17405 static int <I></I>
17412 )
17413 </pre>
17414 <dd> Sifts up a variable until either it reaches position
17415 xLow or the size of the DD heap increases too much. Assumes that y is
17416 the top of a group (or a singleton). Checks y for aggregation to the
17417 adjacent variables. Records all the moves that are appended to the
17418 list of moves received as input and returned as a side effect.
17420 <p>
17423 <p>
17425 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17427 <dt><pre>
17429 static int <I></I>
17436 )
17437 </pre>
17439 croupcheck == CUDD_GROUP_CHECK7, it checks for group creation at the
17440 end of the initial sifting. If a group is created, it is then sifted
17441 again. After sifting one variable, the group that contains it is
17443 <p>
17446 <p>
17448 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17450 <dt><pre>
17452 static int <I></I>
17458 )
17459 </pre>
17460 <dd> Comparison of a pair of functions to the i-th ADD
17461 variable. Returns 1 if the functions are the i-th ADD variable and its
17462 complement; 0 otherwise.
17463 <p>
17466 <p>
17468 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
17470 <dt><pre>
17472 static int <I></I>
17477 )
17478 </pre>
17480 the function is the i-th ADD variable; 0 otherwise.
17481 <p>
17484 <p>
17486 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCompose.c"TARGET="ABSTRACT"><CODE>cuddCompose.c</CODE></A>
17488 <dt><pre>
17490 static int <I></I>
17494 )
17495 </pre>
17496 <dd> Checks whether a variables is already handled. This
17497 function is used for lazy sifting.
17498 <p>
17501 <p>
17503 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17505 <dt><pre>
17507 static int <I></I>
17514 )
17515 </pre>
17516 <dd> If x==x_low, it executes jumping_down. If x==x_high, it
17517 executes jumping_up. This funcion is similar to ddSiftingAux. Returns
17519 <p>
17522 <p>
17524 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
17526 <dt><pre>
17528 static Move * <I></I>
17534 )
17535 </pre>
17536 <dd> This is a simplified version of ddSiftingDown. It does not
17537 use lower bounding. Returns the set of moves in case of success; NULL
17538 if memory is full.
17539 <p>
17542 <p>
17544 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
17546 <dt><pre>
17548 static Move * <I></I>
17554 )
17555 </pre>
17556 <dd> This is a simplified version of ddSiftingUp. It does not
17557 use lower bounding. Returns the set of moves in case of success; NULL
17558 if memory is full.
17559 <p>
17562 <p>
17564 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
17566 <dt><pre>
17568 static unsigned int <I></I>
17573 )
17574 </pre>
17575 <dd> Computes the hash value for a local cache. Returns the
17576 bucket index.
17577 <p>
17580 <p>
17582 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
17584 <dt><pre>
17586 static int <I></I>
17589 )
17590 </pre>
17591 <dd> Performs the recursive step of Cudd_CountLeaves. Returns
17592 the number of leaves in the DD rooted at n.
17593 <p>
17596 <p>
17599 </code>
17601 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
17603 <dt><pre>
17605 static int <I></I>
17611 )
17612 </pre>
17613 <dd> Given xLow <= x <= xHigh moves x up and down between the
17614 boundaries. At each step a linear transformation is tried, and, if it
17615 decreases the size of the DD, it is accepted. Finds the best position
17617 <p>
17620 <p>
17622 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
17624 <dt><pre>
17626 static int <I></I>
17631 )
17632 </pre>
17633 <dd> Given a set of moves, returns the DD heap to the
17634 position giving the minimum size. In case of ties, returns to the
17635 closest position giving the minimum size. Returns 1 in case of
17636 success; 0 otherwise.
17637 <p>
17640 <p>
17642 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
17644 <dt><pre>
17646 static Move * <I></I>
17652 )
17653 </pre>
17654 <dd> Sifts a variable down and applies linear
17655 transformations. Moves x down until either it reaches the bound
17656 (xHigh) or the size of the DD heap increases too much. Returns the
17657 set of moves in case of success; NULL if memory is full.
17658 <p>
17661 <p>
17663 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
17665 <dt><pre>
17667 static Move * <I></I>
17673 )
17674 </pre>
17675 <dd> Sifts a variable up and applies linear transformations.
17676 Moves y up until either it reaches the bound (xLow) or the size of
17677 the DD heap increases too much. Returns the set of moves in case of
17678 success; NULL if memory is full.
17679 <p>
17682 <p>
17684 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
17686 <dt><pre>
17688 static int <I></I>
17692 )
17693 </pre>
17694 <dd> Comparison function used by qsort to order the
17695 variables according to the number of keys in the subtables.
17696 Returns the difference in number of keys between the two
17697 variables being compared.
17698 <p>
17701 <p>
17703 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
17705 <dt><pre>
17707 static void <I></I>
17713 )
17714 </pre>
17715 <dd> Creates a single group from low to high and adjusts the
17716 index field of the tree node.
17717 <p>
17720 <p>
17722 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17724 <dt><pre>
17726 static int <I></I>
17731 )
17732 </pre>
17733 <dd> Pretends to check two variables for aggregation. Always
17734 returns 0.
17735 <p>
17738 <p>
17740 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17742 <dt><pre>
17744 static void <I></I>
17748 )
17749 </pre>
17750 <dd> Fixes a variable tree after the insertion of new subtables.
17751 After such an insertion, the low fields of the tree below the insertion
17752 point are inconsistent.
17753 <p>
17756 <p>
17758 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
17760 <dt><pre>
17762 static int <I></I>
17766 )
17767 </pre>
17768 <dd> Tries all the permutations of the three variables between
17769 x and x+2 and retains the best. Assumes that no dead nodes are
17771 success; 0 otherwise.Assumes that no dead nodes are present. Returns
17773 otherwise.
17774 <p>
17777 <p>
17779 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
17781 <dt><pre>
17783 static int <I></I>
17787 )
17788 </pre>
17789 <dd> Tries all the permutations of the four variables between
17790 w and w+3 and retains the best. Assumes that no dead nodes are
17792 success; 0 otherwise.
17793 <p>
17796 <p>
17798 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
17800 <dt><pre>
17802 static int <I></I>
17809 )
17810 </pre>
17811 <dd> Performs the recursive step of Cudd_bddPickArbitraryMinterms.
17813 <p>
17816 <p>
17818 <dd> <b>See Also</b> <code><a href="#Cudd_bddPickArbitraryMinterms">Cudd_bddPickArbitraryMinterms</a>
17819 </code>
17821 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
17823 <dt><pre>
17825 static int <I></I>
17831 )
17832 </pre>
17833 <dd> Finds a representative cube of a BDD with the weight of
17834 each variable. From the top variable, if the weight is greater than or
17836 Otherwise, choose ELSE branch unless the child is the constant 0.
17837 <p>
17840 <p>
17842 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
17844 <dt><pre>
17846 static void <I></I>
17851 )
17852 </pre>
17853 <dd> Performs the recursive step of Cudd_PrintMinterm.
17854 <p>
17857 <p>
17859 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
17861 <dt><pre>
17863 static void <I></I>
17867 )
17868 </pre>
17869 <dd> Rehashes a ZDD unique subtable.
17870 <p>
17873 <p>
17876 </code>
17878 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
17880 <dt><pre>
17882 static int <I></I>
17887 )
17888 </pre>
17889 <dd> Reorders the children of a group tree node according to
17890 the options. After reordering puts all the variables in the group
17891 and/or its descendents in a single group. This allows hierarchical
17892 reordering. If the variables in the group do not exist yet, simply
17894 <p>
17897 <p>
17899 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17901 <dt><pre>
17903 static int <I></I>
17906 )
17907 </pre>
17908 <dd> Cleans up at the end of reordering.
17909 <p>
17912 <p>
17914 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
17916 <dt><pre>
17918 static int <I></I>
17921 )
17922 </pre>
17923 <dd> Prepares the DD heap for dynamic reordering. Does
17924 garbage collection, to guarantee that there are no dead nodes;
17925 clears the cache, which is invalidated by dynamic reordering; initializes
17926 the number of isolated projection functions; and initializes the
17928 <p>
17931 <p>
17933 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
17935 <dt><pre>
17937 static void <I></I>
17942 )
17943 </pre>
17944 <dd> Reports problem in garbage collection.
17945 <p>
17948 <p>
17952 </code>
17954 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
17956 <dt><pre>
17958 static int <I></I>
17962 )
17963 </pre>
17964 <dd> Resets a variable to be processed. This function is used
17965 for lazy sifting.
17966 <p>
17969 <p>
17971 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
17973 <dt><pre>
17975 static int <I></I>
17979 )
17980 </pre>
17981 <dd> Increases the number of subtables in a unique table so
17983 <p>
17986 <p>
17989 </code>
17991 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddTable.c"TARGET="ABSTRACT"><CODE>cuddTable.c</CODE></A>
17993 <dt><pre>
17995 static int <I></I>
18000 )
18001 </pre>
18002 <dd> Checks two variables for aggregation. The check is based
18003 on the second difference of the number of nodes as a function of the
18004 layer. If the second difference is lower than a given threshold
18005 (typically negative) then the two variables should be aggregated.
18007 <p>
18010 <p>
18012 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
18014 <dt><pre>
18016 static int <I></I>
18020 )
18021 </pre>
18022 <dd> Sets a variable to already handled. This function is used
18023 for lazy sifting.
18024 <p>
18027 <p>
18029 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
18031 <dt><pre>
18033 static int <I></I>
18039 )
18040 </pre>
18041 <dd> Reorders variables according to a given permutation.
18042 The i-th permutation array contains the index of the variable that
18043 should be brought to the i-th level. ddShuffle assumes that no
18044 dead nodes are present and that the interaction matrix is properly
18045 initialized. The reordering is achieved by a series of upward sifts.
18047 <p>
18050 <p>
18052 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
18054 <dt><pre>
18056 static int <I></I>
18060 )
18061 </pre>
18062 <dd> Reorders variables according to a given permutation.
18063 The i-th permutation array contains the index of the variable that
18064 should be brought to the i-th level. ddShuffle assumes that no
18065 dead nodes are present and that the interaction matrix is properly
18066 initialized. The reordering is achieved by a series of upward sifts.
18068 <p>
18071 <p>
18073 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18075 <dt><pre>
18077 static int <I></I>
18082 )
18083 </pre>
18084 <dd> Takes a variable from position x and sifts it up to
18085 position xLow; xLow should be less than or equal to x.
18087 <p>
18090 <p>
18092 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
18094 <dt><pre>
18096 static int <I></I>
18101 )
18102 </pre>
18103 <dd> Takes a variable from position x and sifts it up to
18104 position xLow; xLow should be less than or equal to x.
18106 <p>
18109 <p>
18111 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18113 <dt><pre>
18115 static int <I></I>
18121 )
18122 </pre>
18123 <dd> Given xLow <= x <= xHigh moves x up and down between the
18124 boundaries. Finds the best position and does the required changes.
18126 <p>
18129 <p>
18131 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18133 <dt><pre>
18135 static int <I></I>
18140 )
18141 </pre>
18142 <dd> Given a set of moves, returns the DD heap to the
18143 position giving the minimum size. In case of ties, returns to the
18144 closest position giving the minimum size. Returns 1 in case of
18145 success; 0 otherwise.
18146 <p>
18149 <p>
18151 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18153 <dt><pre>
18155 static Move * <I></I>
18160 )
18161 </pre>
18162 <dd> Sifts a variable down. Moves x down until either it
18163 reaches the bound (xHigh) or the size of the DD heap increases too
18164 much. Returns the set of moves in case of success; NULL if memory is
18165 full.
18166 <p>
18169 <p>
18171 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18173 <dt><pre>
18175 static Move * <I></I>
18180 )
18181 </pre>
18182 <dd> Sifts a variable up. Moves y up until either it reaches
18183 the bound (xLow) or the size of the DD heap increases too much.
18184 Returns the set of moves in case of success; NULL if memory is full.
18185 <p>
18188 <p>
18190 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18192 <dt><pre>
18194 static void <I></I>
18198 )
18199 </pre>
18200 <dd> Performs a DFS from f. Uses the LSB of the then pointer
18201 as visited flag.
18202 <p>
18205 <p>
18207 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInteract.c"TARGET="ABSTRACT"><CODE>cuddInteract.c</CODE></A>
18209 <dt><pre>
18211 static void <I></I>
18215 )
18216 </pre>
18217 <dd> Performs the recursive step of Cudd_Support. Performs a
18218 DFS from f. The support is accumulated in supp as a side effect. Uses
18219 the LSB of the then pointer as visited flag.
18220 <p>
18223 <p>
18226 </code>
18228 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
18230 <dt><pre>
18232 static Move * <I></I>
18237 )
18238 </pre>
18239 <dd> Swaps any two variables. Returns the set of moves.
18240 <p>
18243 <p>
18245 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18247 <dt><pre>
18249 static int <I></I>
18254 )
18255 </pre>
18256 <dd> Undoes the swap of two groups. x is assumed to be the
18257 bottom variable of the first group. y is assumed to be the top
18258 variable of the second group. Returns the number of keys in the table
18259 if successful; 0 otherwise.
18260 <p>
18263 <p>
18265 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18267 <dt><pre>
18269 static int <I></I>
18275 )
18276 </pre>
18277 <dd> Swaps two groups. x is assumed to be the bottom variable
18278 of the first group. y is assumed to be the top variable of the second
18279 group. Updates the list of moves. Returns the number of keys in the
18280 table if successful; 0 otherwise.
18281 <p>
18284 <p>
18286 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18288 <dt><pre>
18290 static int <I></I>
18296 )
18297 </pre>
18298 <dd> Given xLow <= x <= xHigh moves x up and down between the
18299 boundaries. Finds the best position and does the required changes.
18300 Assumes that x is not part of a symmetry group. Returns 1 if
18301 successful; 0 otherwise.
18302 <p>
18305 <p>
18307 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18309 <dt><pre>
18311 static int <I></I>
18316 )
18317 </pre>
18318 <dd> Given a set of moves, returns the DD heap to the
18319 position giving the minimum size. In case of ties, returns to the
18320 closest position giving the minimum size. Returns 1 in case of
18321 success; 0 otherwise.
18322 <p>
18325 <p>
18327 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18329 <dt><pre>
18331 static int <I></I>
18337 )
18338 </pre>
18339 <dd> Given xLow <= x <= xHigh moves x up and down between the
18340 boundaries. Finds the best position and does the required changes.
18341 Assumes that x is either an isolated variable, or it is the bottom of
18342 a symmetry group. All symmetries may not have been found, because of
18344 <p>
18347 <p>
18349 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18351 <dt><pre>
18353 static Move * <I></I>
18358 )
18359 </pre>
18360 <dd> Moves x down until either it reaches the bound (xHigh)
18361 or the size of the DD heap increases too much. Assumes that x is the
18362 bottom of a symmetry group. Checks x for symmetry to the adjacent
18363 variables. If symmetry is found, the symmetry group of x is merged
18364 with the symmetry group of the other variable. Returns the set of
18365 moves in case of success; MV_OOM if memory is full.
18366 <p>
18369 <p>
18371 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18373 <dt><pre>
18375 static Move * <I></I>
18380 )
18381 </pre>
18382 <dd> Moves x up until either it reaches the bound (xLow) or
18383 the size of the DD heap increases too much. Assumes that x is the top
18384 of a symmetry group. Checks x for symmetry to the adjacent
18385 variables. If symmetry is found, the symmetry group of x is merged
18386 with the symmetry group of the other variable. Returns the set of
18387 moves in case of success; MV_OOM if memory is full.
18388 <p>
18391 <p>
18393 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18395 <dt><pre>
18397 static void <I></I>
18404 )
18405 </pre>
18406 <dd> Counts numbers of symmetric variables and symmetry
18407 groups.
18408 <p>
18411 <p>
18413 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18415 <dt><pre>
18417 static int <I></I>
18421 )
18422 </pre>
18423 <dd> Comparison function used by qsort to order the variables
18424 according to the number of keys in the subtables.
18425 Returns the difference in number of keys between the two
18426 variables being compared.
18427 <p>
18430 <p>
18432 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSymmetry.c"TARGET="ABSTRACT"><CODE>cuddSymmetry.c</CODE></A>
18434 <dt><pre>
18436 static int <I></I>
18441 )
18442 </pre>
18443 <dd> Recursively visits the group tree and reorders each
18445 <p>
18448 <p>
18450 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
18452 <dt><pre>
18454 static Move* <I></I>
18458 )
18459 </pre>
18460 <dd> Given a set of moves, returns the DD heap to the
18461 order in effect before the moves. Returns 1 in case of success;
18462 0 otherwise.
18463 <p>
18466 <p>
18468 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLinear.c"TARGET="ABSTRACT"><CODE>cuddLinear.c</CODE></A>
18470 <dt><pre>
18472 static int <I></I>
18476 )
18477 </pre>
18478 <dd> Comparison function used by qsort to order the variables
18479 according to the number of keys in the subtables. Returns the
18480 difference in number of keys between the two variables being
18481 compared.
18482 <p>
18485 <p>
18487 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
18489 <dt><pre>
18491 static int <I></I>
18495 )
18496 </pre>
18497 <dd> Comparison function used by qsort to order the
18498 variables according to the number of keys in the subtables.
18499 Returns the difference in number of keys between the two
18500 variables being compared.
18501 <p>
18504 <p>
18506 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18508 <dt><pre>
18510 static void <I></I>
18514 )
18515 </pre>
18516 <dd> If support[i
18517 <p>
18520 <p>
18522 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddInteract.c"TARGET="ABSTRACT"><CODE>cuddInteract.c</CODE></A>
18524 <dt><pre>
18526 static int <I></I>
18532 )
18533 </pre>
18534 <dd> Updates the BDD variable group tree before a shuffle.
18536 <p>
18539 <p>
18541 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddReorder.c"TARGET="ABSTRACT"><CODE>cuddReorder.c</CODE></A>
18543 <dt><pre>
18545 static int <I></I>
18550 )
18551 </pre>
18553 case of grouping; 0 otherwise. This function is used for lazy sifting.
18554 <p>
18557 <p>
18559 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGroup.c"TARGET="ABSTRACT"><CODE>cuddGroup.c</CODE></A>
18561 <dt><pre>
18563 static int <I></I>
18568 )
18569 </pre>
18571 Tries both permutations of the variables in a window
18572 that slides from low to high. Assumes that no dead nodes are
18574 <p>
18577 <p>
18579 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
18581 <dt><pre>
18583 static int <I></I>
18588 )
18589 </pre>
18591 Tries all possible permutations to the variables in a
18592 window that slides from low to high. Assumes that no dead nodes are
18594 <p>
18597 <p>
18599 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
18601 <dt><pre>
18603 static int <I></I>
18608 )
18609 </pre>
18611 Tries all possible permutations to the variables in a
18612 window that slides from low to high. Assumes that no dead nodes are
18614 <p>
18617 <p>
18619 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
18621 <dt><pre>
18623 static int <I></I>
18628 )
18629 </pre>
18630 <dd> Reorders by repeatedly applying a sliding window of width
18631 2. Tries both permutations of the variables in a window
18632 that slides from low to high. Assumes that no dead nodes are
18633 present. Uses an event-driven approach to determine convergence.
18635 <p>
18638 <p>
18640 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
18642 <dt><pre>
18644 static int <I></I>
18649 )
18650 </pre>
18651 <dd> Reorders by repeatedly applying a sliding window of width
18652 3. Tries all possible permutations to the variables in a
18653 window that slides from low to high. Assumes that no dead nodes are
18654 present. Uses an event-driven approach to determine convergence.
18656 <p>
18659 <p>
18661 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
18663 <dt><pre>
18665 static int <I></I>
18670 )
18671 </pre>
18672 <dd> Reorders by repeatedly applying a sliding window of width
18673 4. Tries all possible permutations to the variables in a
18674 window that slides from low to high. Assumes that no dead nodes are
18675 present. Uses an event-driven approach to determine convergence.
18677 <p>
18680 <p>
18682 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddWindow.c"TARGET="ABSTRACT"><CODE>cuddWindow.c</CODE></A>
18684 <dt><pre>
18686 static void <I></I>
18690 )
18691 </pre>
18692 <dd> Searches all the subtables above node. Very expensive.
18693 The same check is now implemented more efficiently in ddDebugCheck.
18694 <p>
18697 <p>
18700 </code>
18702 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCheck.c"TARGET="ABSTRACT"><CODE>cuddCheck.c</CODE></A>
18704 <dt><pre>
18706 static void <I></I>
18710 )
18711 </pre>
18712 <dd> Searches the subtables above node for its parents.
18713 <p>
18716 <p>
18718 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddCheck.c"TARGET="ABSTRACT"><CODE>cuddCheck.c</CODE></A>
18720 <dt><pre>
18722 static int <I></I>
18727 )
18728 </pre>
18730 of success; 0 otherwise.
18731 <p>
18734 <p>
18736 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddUtil.c"TARGET="ABSTRACT"><CODE>cuddUtil.c</CODE></A>
18738 <dt><pre>
18740 static DdTlcInfo * <I></I>
18742 <b></b> <i></i>
18743 )
18744 </pre>
18745 <dd> Returns a pointer to an empty set of clauses if
18746 successful; NULL otherwise. No bit vector for the phases is
18747 allocated.
18748 <p>
18751 <p>
18753 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
18755 <dt><pre>
18757 static int <I></I>
18767 )
18768 </pre>
18769 <dd> Returns true iff the two arguments are identical
18770 clauses. Since literals are sorted, we only need to compare
18771 literals in the same position.
18772 <p>
18775 <p>
18778 </code>
18780 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
18782 <dt><pre>
18784 static double <I></I>
18786 <b></b> <i></i>
18787 )
18788 </pre>
18789 <dd> Returns the average fitness of the population.
18790 <p>
18793 <p>
18795 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
18797 <dt><pre>
18799 static int <I></I>
18801 <b></b> <i></i>
18802 )
18803 </pre>
18804 <dd> Returns the index of the fittest individual.
18805 <p>
18808 <p>
18810 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
18812 <dt><pre>
18814 static void <I></I>
18819 )
18820 </pre>
18821 <dd> Fixes a variable group tree.
18822 <p>
18825 <p>
18827 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAPI.c"TARGET="ABSTRACT"><CODE>cuddAPI.c</CODE></A>
18829 <dt><pre>
18831 static void <I></I>
18834 )
18835 </pre>
18836 <dd> Frees a two-dimensional matrix allocated by getMatrix.
18837 <p>
18840 <p>
18843 </code>
18845 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
18847 <dt><pre>
18849 static enum st_retval <I></I>
18854 )
18855 </pre>
18856 <dd> Frees the entries of the visited symbol table. Returns
18857 ST_CONTINUE.
18858 <p>
18861 <p>
18863 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
18865 <dt><pre>
18867 static NodeData * <I></I>
18872 )
18873 </pre>
18874 <dd> Recursively counts minterms and computes reference
18875 counts of each node in the BDD. Similar to the cuddCountMintermAux
18876 which recursively counts the number of minterms for the dag rooted
18877 at each node in terms of the total number of variables (max). It assumes
18878 that the node pointer passed to it is regular and it maintains the
18879 invariant.
18880 <p>
18883 <p>
18886 </code>
18888 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
18890 <dt><pre>
18892 static ApproxInfo * <I></I>
18898 )
18899 </pre>
18900 <dd> Counts minterms and computes reference counts of each
18901 node in the BDD . The minterm count is separately computed for the
18902 node and its complement. This is to avoid cancellation
18903 errors. Returns a pointer to the data structure holding the
18904 information gathered if successful; NULL otherwise.
18905 <p>
18908 <p>
18912 </code>
18914 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
18916 <dt><pre>
18918 static int <I></I>
18922 )
18923 </pre>
18924 <dd> Returns the gcd of two integers. Uses the binary GCD
18925 algorithm described in Cormen, Leiserson, and Rivest.
18926 <p>
18929 <p>
18931 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
18933 <dt><pre>
18935 static DdNode * <I></I>
18941 )
18942 </pre>
18943 <dd> Build a BDD for a largest cube of f.
18944 Given the minimum length from the root, and the minimum
18945 lengths for each node (in visited), apply triangulation at each node.
18946 Of the two children of each node on a shortest path, at least one is
18947 on a shortest path. In case of ties the procedure chooses the THEN
18948 children.
18949 Returns a pointer to the cube BDD representing the path if
18950 successful; NULL otherwise.
18951 <p>
18954 <p>
18956 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
18958 <dt><pre>
18960 static cuddPathPair <I></I>
18964 )
18965 </pre>
18966 <dd> Finds the size of the largest cube(s) in a DD.
18967 This problem is translated into finding the shortest paths from a node
18968 when both THEN and ELSE arcs have unit lengths.
18969 Uses a local symbol table to store the lengths for each
18970 node. Only the lengths for the regular nodes are entered in the table,
18971 because those for the complement nodes are simply obtained by swapping
18972 the two lenghts.
18973 Returns a pair of lengths: the length of the shortest path to 1;
18974 and the length of the shortest path to 0. This is done so as to take
18975 complement arcs into account.
18976 <p>
18979 <p>
18981 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
18983 <dt><pre>
18985 static int <I></I>
18989 )
18990 </pre>
18991 <dd> Returns the number of nodes at one level of a unique table.
18992 The projection function, if isolated, is not counted.
18993 <p>
18996 <p>
18998 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
19000 <dt><pre>
19002 static DdHalfWord ** <I></I>
19006 )
19007 </pre>
19008 <dd> Allocates a two-dimensional matrix of ints.
19009 Returns the pointer to the matrix if successful; NULL otherwise.
19010 <p>
19013 <p>
19016 </code>
19018 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
19020 <dt><pre>
19022 static int <I></I>
19025 )
19026 </pre>
19027 <dd> Computes the maximum value of (n choose k) for a given
19028 n. The maximum value occurs for k = n/2 when n is even, or k =
19030 intermediate overflow problems. It is based on the identity
19031 <pre>
19033 </pre>
19034 Returns the computed value if successful; -1 if out of range.
19035 <p>
19038 <p>
19040 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
19042 <dt><pre>
19044 static DdNode * <I></I>
19051 )
19052 </pre>
19053 <dd> Build a BDD for a shortest path of f.
19054 Given the minimum length from the root, and the minimum
19055 lengths for each node (in visited), apply triangulation at each node.
19056 Of the two children of each node on a shortest path, at least one is
19057 on a shortest path. In case of ties the procedure chooses the THEN
19058 children.
19059 Returns a pointer to the cube BDD representing the path if
19060 successful; NULL otherwise.
19061 <p>
19064 <p>
19066 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
19068 <dt><pre>
19070 static cuddPathPair <I></I>
19076 )
19077 </pre>
19078 <dd> Finds the length of the shortest path(s) in a DD.
19079 Uses a local symbol table to store the lengths for each
19080 node. Only the lengths for the regular nodes are entered in the table,
19081 because those for the complement nodes are simply obtained by swapping
19082 the two lenghts.
19083 Returns a pair of lengths: the length of the shortest path to 1;
19084 and the length of the shortest path to 0. This is done so as to take
19085 complement arcs into account.
19086 <p>
19089 <p>
19091 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSat.c"TARGET="ABSTRACT"><CODE>cuddSat.c</CODE></A>
19093 <dt><pre>
19095 static void <I></I>
19099 )
19100 </pre>
19101 <dd> Removes an item from the hash table of a level queue.
19102 Nothing is done if the item is not in the table.
19103 <p>
19106 <p>
19110 </code>
19112 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
19114 <dt><pre>
19116 static int <I></I>
19120 )
19121 </pre>
19122 <dd> Inserts an item in the hash table of a level queue. Returns
19124 the same key is already in the hash table.
19125 <p>
19128 <p>
19131 </code>
19133 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
19135 <dt><pre>
19137 static DdQueueItem * <I></I>
19141 )
19142 </pre>
19143 <dd> Looks up a key in the hash table of a level queue. Returns
19144 a pointer to the item with the given key if the key is found; NULL
19145 otherwise.
19146 <p>
19149 <p>
19153 </code>
19155 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
19157 <dt><pre>
19159 static int <I></I>
19162 )
19163 </pre>
19165 successful; 0 otherwise.
19166 <p>
19169 <p>
19172 </code>
19174 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
19176 <dt><pre>
19178 static int <I></I>
19186 )
19187 </pre>
19188 <dd> Returns true iff either literal of a clause is in a set
19189 of literals. The first four arguments specify the clause. The
19190 remaining two arguments specify the literal set.
19191 <p>
19194 <p>
19196 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
19198 <dt><pre>
19200 static DdHalfWord * <I></I>
19205 )
19206 </pre>
19207 <dd> Translates the symmetry information stored in the next
19208 field of each subtable from level to indices. This procedure is called
19209 immediately after symmetric sifting, so that the next fields are correct.
19210 By translating this informaton in terms of indices, we make it independent
19211 of subsequent reorderings. The format used is that of the next fields:
19212 a circular list where each variable points to the next variable in the
19213 same symmetry group. Only the entries between lower and upper are
19214 considered. The procedure returns a pointer to an array
19215 holding the symmetry information if successful; NULL otherwise.
19216 <p>
19219 <p>
19222 </code>
19224 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
19226 <dt><pre>
19228 static int <I></I>
19230 <b></b> <i></i>
19231 )
19232 </pre>
19233 <dd> Finds the largest DD in the population. If an order is
19234 repeated, it avoids choosing the copy that is in the computed table
19235 (it has repeat[i
19236 <p>
19239 <p>
19241 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
19243 <dt><pre>
19245 static int <I></I>
19249 )
19250 </pre>
19251 <dd> Generates the random sequences for the initial population.
19252 The sequences are permutations of the indices between lower and
19253 upper in the current order.
19254 <p>
19257 <p>
19259 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
19261 <dt><pre>
19263 static DdNode * <I></I>
19270 )
19271 </pre>
19273 <p>
19276 <p>
19278 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSplit.c"TARGET="ABSTRACT"><CODE>cuddSplit.c</CODE></A>
19280 <dt><pre>
19282 static int <I></I>
19285 )
19286 </pre>
19287 <dd> Returns true iff the argument is a one-literal clause.
19288 A one-litaral clause has the constant FALSE as second literal.
19289 Since the constant TRUE is never used, it is sufficient to test for
19290 a constant.
19291 <p>
19294 <p>
19296 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
19298 <dt><pre>
19300 static void <I></I>
19305 )
19306 </pre>
19308 <p>
19311 <p>
19313 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
19315 <dt><pre>
19317 static int <I></I>
19320 )
19321 </pre>
19323 <p>
19326 <p>
19328 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
19330 <dt><pre>
19332 static double <I></I>
19334 <b></b> <i></i>
19335 )
19336 </pre>
19338 <p>
19341 <p>
19343 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
19345 <dt><pre>
19347 static int <I></I>
19353 )
19354 </pre>
19355 <dd> Restores the variable order in array by a series of sifts up.
19357 <p>
19360 <p>
19362 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
19364 <dt><pre>
19366 static int <I></I>
19370 )
19371 </pre>
19372 <dd> Selects two distinct parents with the roulette wheel method.
19373 <p>
19376 effects.
19377 <p>
19379 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
19381 <dt><pre>
19383 static DdNode * <I></I>
19388 )
19389 </pre>
19390 <dd> This function prepares an array of variables which have not been
19391 encountered so far when traversing the procedure cuddSplitSetRecur. This
19392 array is then used to extract the required number of minterms from a constant
19393 1. The algorithm guarantees that the size of BDD will be utmost log(n).
19394 <p>
19397 <p>
19399 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSplit.c"TARGET="ABSTRACT"><CODE>cuddSplit.c</CODE></A>
19401 <dt><pre>
19403 static int <I></I>
19407 )
19408 </pre>
19409 <dd> Returns true iff the argument is the sentinel clause.
19410 A sentinel clause has both variables equal to 0.
19411 <p>
19414 <p>
19416 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
19418 <dt><pre>
19420 static DdNode * <I></I>
19425 )
19426 </pre>
19427 <dd> Separates cube from distance. Returns the cube if
19428 successful; NULL otherwise.
19429 <p>
19432 <p>
19436 </code>
19438 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddPriority.c"TARGET="ABSTRACT"><CODE>cuddPriority.c</CODE></A>
19440 <dt><pre>
19442 static int <I></I>
19448 )
19449 </pre>
19451 the current configuration or return the DD to the original
19453 <p>
19456 <p>
19458 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
19460 <dt><pre>
19462 static int <I></I>
19467 )
19468 </pre>
19469 <dd> Takes a variable from position x and sifts it up to
19470 position x_low; x_low should be less than x. Returns 1 if successful;
19471 0 otherwise
19472 <p>
19475 <p>
19477 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddGenetic.c"TARGET="ABSTRACT"><CODE>cuddGenetic.c</CODE></A>
19479 <dt><pre>
19481 static enum st_retval <I></I>
19486 )
19487 </pre>
19488 <dd> None
19489 <p>
19492 <p>
19494 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddSubsetSP.c"TARGET="ABSTRACT"><CODE>cuddSubsetSP.c</CODE></A>
19496 <dt><pre>
19498 static enum st_retval <I></I>
19503 )
19504 </pre>
19505 <dd> Frees the memory associated with the computed table of
19506 Cudd_zddCountDouble.
19507 <p>
19510 <p>
19512 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddCount.c"TARGET="ABSTRACT"><CODE>cuddZddCount.c</CODE></A>
19514 <dt><pre>
19516 static enum st_retval <I></I>
19521 )
19522 </pre>
19523 <dd> Frees the memory associated with the computed table of
19524 Cudd_zddCount.
19525 <p>
19528 <p>
19530 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddCount.c"TARGET="ABSTRACT"><CODE>cuddZddCount.c</CODE></A>
19532 <dt><pre>
19534 static int <I></I>
19541 )
19542 </pre>
19543 <dd> If temperature is STOP_TEMP or there is no improvement
19545 otherwise.
19546 <p>
19549 <p>
19551 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddAnneal.c"TARGET="ABSTRACT"><CODE>cuddAnneal.c</CODE></A>
19553 <dt><pre>
19555 static DdTlcInfo * <I></I>
19557 <b></b> <i></i>
19558 )
19559 </pre>
19560 <dd> Returns a pointer to a DdTlcInfo Structure if successful;
19561 NULL otherwise.
19562 <p>
19565 <p>
19568 </code>
19570 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddEssent.c"TARGET="ABSTRACT"><CODE>cuddEssent.c</CODE></A>
19572 <dt><pre>
19574 static int <I></I>
19586 )
19587 </pre>
19588 <dd> Updates entry for a subset. Finds the subset, if it exists.
19589 If the new order for the subset has lower cost, or if the subset did not
19590 exist, it stores the new order and cost. Returns the number of subsets
19591 currently in the table.
19592 <p>
19595 <p>
19597 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
19599 <dt><pre>
19601 static void <I></I>
19606 )
19607 </pre>
19608 <dd> Recursively update the parity of the paths reaching a node.
19609 Assumes that node is regular and propagates the invariant.
19610 <p>
19613 <p>
19616 </code>
19618 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
19620 <dt><pre>
19622 static int <I></I>
19629 )
19630 </pre>
19631 <dd> Update function reference counts to account for replacement.
19632 Returns the number of nodes saved if successful; 0 otherwise.
19633 <p>
19636 <p>
19639 RAmarkNodes
19640 </code>
19642 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddApprox.c"TARGET="ABSTRACT"><CODE>cuddApprox.c</CODE></A>
19644 <dt><pre>
19646 static int <I></I>
19653 )
19654 </pre>
19655 <dd> Updates the upper bound and saves the best order seen so far.
19656 Returns the current value of the upper bound.
19657 <p>
19660 <p>
19662 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddExact.c"TARGET="ABSTRACT"><CODE>cuddExact.c</CODE></A>
19664 <dt><pre>
19666 static int <I></I>
19670 )
19671 </pre>
19672 <dd> Counts the number of internal nodes of the group tree.
19673 Returns the count.
19674 <p>
19677 <p>
19679 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19681 <dt><pre>
19683 static void <I></I>
19689 )
19690 </pre>
19691 <dd> Finds the lower and upper bounds of the group represented
19692 by treenode. The high and low fields of treenode are indices. From
19693 those we need to derive the current positions, and find maximum and
19694 minimum.
19695 <p>
19698 <p>
19700 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19702 <dt><pre>
19704 static void <I></I>
19708 )
19709 </pre>
19710 <dd> Fixes the ZDD variable group tree after a
19711 shuffle. Assumes that the order of the variables in a terminal node
19712 has not been changed.
19713 <p>
19716 <p>
19718 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
19720 <dt><pre>
19722 static int <I></I>
19727 )
19728 </pre>
19730 success; 0 otherwise.
19731 <p>
19734 <p>
19736 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19738 <dt><pre>
19740 static int <I></I>
19746 )
19747 </pre>
19748 <dd> Swaps two groups and records the move. Returns the
19749 number of keys in the DD table in case of success; 0 otherwise.
19750 <p>
19753 <p>
19755 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19757 <dt><pre>
19759 static int <I></I>
19765 )
19766 </pre>
19767 <dd> Sifts one variable up and down until it has taken all
19768 positions. Checks for aggregation. There may be at most two sweeps,
19769 even if the group grows. Assumes that x is either an isolated
19770 variable, or it is the bottom of a group. All groups may not have
19771 been found. The variable being moved is returned to the best position
19773 <p>
19776 <p>
19778 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19780 <dt><pre>
19782 static int <I></I>
19787 )
19788 </pre>
19789 <dd> Determines the best position for a variables and returns
19791 <p>
19794 <p>
19796 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19798 <dt><pre>
19800 static int <I></I>
19806 )
19807 </pre>
19808 <dd> Sifts down a variable until it reaches position xHigh.
19809 Assumes that x is the bottom of a group (or a singleton). Records
19811 <p>
19814 <p>
19816 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19818 <dt><pre>
19820 static int <I></I>
19826 )
19827 </pre>
19828 <dd> Sifts up a variable until either it reaches position
19829 xLow or the size of the DD heap increases too much. Assumes that y is
19830 the top of a group (or a singleton). Checks y for aggregation to the
19831 adjacent variables. Records all the moves that are appended to the
19832 list of moves received as input and returned as a side effect.
19834 <p>
19837 <p>
19839 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19841 <dt><pre>
19843 static int <I></I>
19848 )
19849 </pre>
19851 croupcheck == CUDD_GROUP_CHECK7, it checks for group creation at the
19852 end of the initial sifting. If a group is created, it is then sifted
19853 again. After sifting one variable, the group that contains it is
19855 <p>
19858 <p>
19860 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19862 <dt><pre>
19864 static void <I></I>
19870 )
19871 </pre>
19872 <dd> Creates a single group from low to high and adjusts the
19873 idex field of the tree node.
19874 <p>
19877 <p>
19879 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19881 <dt><pre>
19883 static DdNode * <I></I>
19888 )
19889 </pre>
19890 <dd> Performs the recursive step of Cudd_zddPortFromBdd.
19891 <p>
19894 <p>
19896 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddPort.c"TARGET="ABSTRACT"><CODE>cuddZddPort.c</CODE></A>
19898 <dt><pre>
19900 static DdNode * <I></I>
19905 )
19906 </pre>
19907 <dd> Performs the recursive step of Cudd_zddPortToBdd.
19908 <p>
19911 <p>
19913 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddPort.c"TARGET="ABSTRACT"><CODE>cuddZddPort.c</CODE></A>
19915 <dt><pre>
19917 static void <I></I>
19923 )
19924 </pre>
19925 <dd> Performs the recursive step of Cudd_zddPrintCover.
19926 <p>
19929 <p>
19931 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
19933 <dt><pre>
19935 static int <I></I>
19940 )
19941 </pre>
19942 <dd> Reorders the children of a group tree node according to
19943 the options. After reordering puts all the variables in the group
19944 and/or its descendents in a single group. This allows hierarchical
19945 reordering. If the variables in the group do not exist yet, simply
19947 <p>
19950 <p>
19952 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
19954 <dt><pre>
19956 static int <I></I>
19959 )
19960 </pre>
19961 <dd> Shrinks almost empty subtables at the end of reordering to
19962 guarantee that they have a reasonable load factor. However, if there many
19963 nodes are being reclaimed, then no resizing occurs. Returns 1 in case of
19964 success; 0 otherwise.
19965 <p>
19968 <p>
19970 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
19972 <dt><pre>
19974 static void <I></I>
19977 )
19978 </pre>
19979 <dd> Prepares the ZDD heap for dynamic reordering. Does
19980 garbage collection, to guarantee that there are no dead nodes;
19981 and clears the cache, which is invalidated by dynamic reordering.
19982 <p>
19985 <p>
19987 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
19989 <dt><pre>
19991 static int <I></I>
19995 )
19996 </pre>
19997 <dd> Reorders ZDD variables according to a given permutation.
19998 The i-th permutation array contains the index of the variable that
19999 should be brought to the i-th level. zddShuffle assumes that no
20000 dead nodes are present. The reordering is achieved by a series of
20002 <p>
20005 <p>
20007 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
20009 <dt><pre>
20011 static int <I></I>
20016 )
20017 </pre>
20018 <dd> Takes a ZDD variable from position x and sifts it up to
20019 position xLow; xLow should be less than or equal to x.
20021 <p>
20024 <p>
20026 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
20028 <dt><pre>
20030 static Move * <I></I>
20035 )
20036 </pre>
20037 <dd> Swaps any two variables. Returns the set of moves.
20038 <p>
20041 <p>
20043 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddReord.c"TARGET="ABSTRACT"><CODE>cuddZddReord.c</CODE></A>
20045 <dt><pre>
20047 static int <I></I>
20052 )
20053 </pre>
20054 <dd> Recursively visits the group tree and reorders each
20056 <p>
20059 <p>
20061 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
20063 <dt><pre>
20065 static int <I></I>
20069 )
20070 </pre>
20071 <dd> Comparison function used by qsort to order the variables
20072 according to the number of keys in the subtables. Returns the
20073 difference in number of keys between the two variables being
20074 compared.
20075 <p>
20078 <p>
20080 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddGroup.c"TARGET="ABSTRACT"><CODE>cuddZddGroup.c</CODE></A>
20082 <dt><pre>
20084 static void <I></I>
20091 )
20092 </pre>
20093 <dd> Replaces variables with constants if possible (part of
20094 canonical form).
20095 <p>
20098 <p>
20100 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
20102 <dt><pre>
20104 static int <I></I>
20109 )
20110 </pre>
20111 <dd> Undoes the swap of two groups. x is assumed to be the
20112 bottom variable of the first group. y is assumed to be the top
20114 <p>
20117 <p>
20119 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
20121 <dt><pre>
20123 static int <I></I>
20129 )
20130 </pre>
20131 <dd> Swaps two groups. x is assumed to be the bottom variable
20132 of the first group. y is assumed to be the top variable of the second
20133 group. Updates the list of moves. Returns the number of keys in the
20134 table if successful; 0 otherwise.
20135 <p>
20138 <p>
20140 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSymm.c"TARGET="ABSTRACT"><CODE>cuddZddSymm.c</CODE></A>
20142 <dt><pre>
20144 static void <I></I>
20150 )
20151 </pre>
20152 <dd> Performs the recursive step of Cudd_zddPrintMinterm.
20153 <p>
20156 <p>
20158 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
20160 <dt><pre>
20162 static DdNode * <I></I>
20167 )
20168 </pre>
20169 <dd> Performs the recursive step of Cudd_zddSubset0.
20170 <p>
20173 <p>
20175 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
20177 <dt><pre>
20179 static DdNode * <I></I>
20184 )
20185 </pre>
20186 <dd> Performs the recursive step of Cudd_zddSubset1.
20187 <p>
20190 <p>
20192 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddSetop.c"TARGET="ABSTRACT"><CODE>cuddZddSetop.c</CODE></A>
20194 <dt><pre>
20196 static int <I></I>
20201 )
20202 </pre>
20204 case of success; 0 otherwise.
20205 <p>
20208 <p>
20210 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddZddUtil.c"TARGET="ABSTRACT"><CODE>cuddZddUtil.c</CODE></A>
20212 <dt><pre>
20214 <I></I>
20215 <B></B>(
20216 <b></b> <i></i>
20217 )
20218 </pre>
20219 <dd> Adds node to the head of the free list. Does not
20220 deallocate memory chunks that become free. This function is also
20221 used by the dynamic reordering functions.
20222 <p>
20225 <p>
20230 </code>
20234 <dt><pre>
20236 <I></I>
20237 <B></B>(
20238 <b></b> <i></i>
20239 )
20240 </pre>
20241 <dd> Adds node to the head of the free list. Does not
20242 deallocate memory chunks that become free. This function is also
20243 used by the dynamic reordering functions.
20244 <p>
20247 <p>
20251 </code>
20255 <dt><pre>
20257 <I></I>
20258 <B></B>(
20259 <b></b> <i></i>
20260 )
20261 </pre>
20263 <p>
20266 <p>
20270 <dt><pre>
20272 <I></I>
20273 <B></B>(
20274 <b></b> <i></i>
20275 )
20276 </pre>
20277 <dd> Complements a DD if condition c is true; c should be
20279 doubt on the values c may take, use "(c) ? Cudd_Not(node) : node".
20280 <p>
20283 <p>
20286 </code>
20290 <dt><pre>
20292 <I></I>
20293 <B></B>(
20294 <b></b> <i></i>
20295 )
20296 </pre>
20297 <dd> Complements a DD by flipping the complement attribute of
20298 the pointer (the least significant bit).
20299 <p>
20302 <p>
20305 </code>
20309 <dt><pre>
20311 <I></I>
20312 <B></B>(
20313 <b></b> <i></i>
20314 )
20315 </pre>
20316 <dd> Computes hash function for keys of three operands.
20317 <p>
20320 <p>
20324 </code>
20326 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
20328 <dt><pre>
20330 <I></I>
20331 <B></B>(
20332 <b></b> <i></i>
20333 )
20334 </pre>
20335 <dd> Computes hash function for keys of two operands.
20336 <p>
20339 <p>
20343 </code>
20345 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLCache.c"TARGET="ABSTRACT"><CODE>cuddLCache.c</CODE></A>
20347 <dt><pre>
20349 <I></I>
20350 <B></B>(
20351 <b></b> <i></i>
20352 )
20353 </pre>
20354 <dd> Computes the absolute value of a number.
20355 <p>
20358 <p>
20362 <dt><pre>
20364 <I></I>
20365 <B></B>(
20366 <b></b> <i></i>
20367 )
20368 </pre>
20369 <dd> Computes the maximum of two numbers.
20370 <p>
20373 <p>
20376 </code>
20380 <dt><pre>
20382 <I></I>
20383 <B></B>(
20384 <b></b> <i></i>
20385 )
20386 </pre>
20387 <dd> Computes the minimum of two numbers.
20388 <p>
20391 <p>
20394 </code>
20398 <dt><pre>
20400 <I></I>
20401 <B></B>(
20402 <b></b> <i></i>
20403 )
20404 </pre>
20405 <dd> Decreases the reference count of node. It is primarily
20406 used in recursive procedures to decrease the ref count of a result
20407 node before returning it. This accomplishes the goal of removing the
20408 protection applied by a previous cuddRef. This being a macro, it is
20409 faster than Cudd_Deref, but it cannot be used in constructs like
20410 cuddDeref(a = b()).
20411 <p>
20414 <p>
20417 </code>
20421 <dt><pre>
20423 <I></I>
20424 <B></B>(
20425 <b></b> <i></i>
20426 )
20427 </pre>
20428 <dd> Enforces DD_MINUS_INF_VAL <= x <= DD_PLUS_INF_VAL.
20429 Furthermore, if x <= DD_MINUS_INF_VAL/2, x is set to
20430 DD_MINUS_INF_VAL. Similarly, if DD_PLUS_INF_VAL/2 <= x, x is set to
20431 DD_PLUS_INF_VAL. Normally this macro is a NOOP. However, if
20432 HAVE_IEEE_754 is not defined, it makes sure that a value does not
20433 get larger than infinity in absolute value, and once it gets to
20434 infinity, stays there. If the value overflows before this macro is
20435 applied, no recovery is possible.
20436 <p>
20439 <p>
20443 <dt><pre>
20445 <I></I>
20446 <B></B>(
20447 <b></b> <i></i>
20448 )
20449 </pre>
20450 <dd> Extract the least significant digit of a double digit. Used
20451 in the manipulation of arbitrary precision integers.
20452 <p>
20455 <p>
20458 </code>
20462 <dt><pre>
20464 <I></I>
20465 <B></B>(
20466 <b></b> <i></i>
20467 )
20468 </pre>
20469 <dd> Extract the most significant digit of a double digit. Used
20470 in the manipulation of arbitrary precision integers.
20471 <p>
20474 <p>
20477 </code>
20481 <dt><pre>
20483 <I></I>
20484 <B></B>(
20485 <b></b> <i></i>
20486 )
20487 </pre>
20488 <dd> Finds the current position of ZDD variable index in the
20489 order. This macro duplicates the functionality of Cudd_ReadPermZdd,
20490 but it does not check for out-of-bounds indices and it is more
20491 efficient.
20492 <p>
20495 <p>
20498 </code>
20502 <dt><pre>
20504 <I></I>
20505 <B></B>(
20506 <b></b> <i></i>
20507 )
20508 </pre>
20509 <dd> Finds the current position of variable index in the
20510 order. This macro duplicates the functionality of Cudd_ReadPerm,
20511 but it does not check for out-of-bounds indices and it is more
20512 efficient.
20513 <p>
20516 <p>
20519 </code>
20523 <dt><pre>
20525 <I></I>
20526 <B></B>(
20527 <b></b> <i></i>
20528 )
20529 </pre>
20530 <dd> Hash function for the cache for functions with two
20531 operands.
20532 <p>
20535 <p>
20539 </code>
20543 <dt><pre>
20545 <I></I>
20546 <B></B>(
20547 <b></b> <i></i>
20548 )
20549 </pre>
20550 <dd> Hash function for the cache.
20551 <p>
20554 <p>
20558 </code>
20562 <dt><pre>
20564 <I></I>
20565 <B></B>(
20566 <b></b> <i></i>
20567 )
20568 </pre>
20569 <dd> Hash function for the table of a level queue.
20570 <p>
20573 <p>
20578 </code>
20580 <DD> <B>Defined in </B> <A HREF="cuddAllFile.html#cuddLevelQ.c"TARGET="ABSTRACT"><CODE>cuddLevelQ.c</CODE></A>
20582 <dt><pre>
20584 <I></I>
20585 <B></B>(
20586 <b></b> <i></i>
20587 )
20588 </pre>
20589 <dd> Hash function for the unique table.
20590 <p>
20593 <p>
20597 </code>
20601 <dt><pre>
20603 <I></I>
20604 <B></B>(
20605 <b></b> <i></i>
20606 )
20607 </pre>
20608 <dd> Increases the reference count of a node, if it is not
20609 saturated. This being a macro, it is faster than Cudd_Ref, but it
20610 cannot be used in constructs like cuddRef(a = b()).
20611 <p>
20614 <p>
20617 </code>
20621 <dt><pre>
20623 <I></I>
20624 <B></B>(
20625 <b></b> <i></i>
20626 )
20627 </pre>
20628 <dd> Iterates over the cubes of a decision diagram f.
20629 <ul>
20630 <li> DdManager *manager;
20631 <li> DdNode *f;
20632 <li> DdGen *gen;
20633 <li> int *cube;
20634 <li> CUDD_VALUE_TYPE value;
20635 </ul>
20636 Cudd_ForeachCube allocates and frees the generator. Therefore the
20637 application should not try to do that. Also, the cube is freed at the
20638 end of Cudd_ForeachCube and hence is not available outside of the loop.<p>
20639 CAUTION: It is assumed that dynamic reordering will not occur while
20640 there are open generators. It is the user's responsibility to make sure
20641 that dynamic reordering does not occur. As long as new nodes are not created
20642 during generation, and dynamic reordering is not called explicitly,
20643 dynamic reordering will not occur. Alternatively, it is sufficient to
20644 disable dynamic reordering. It is a mistake to dispose of a diagram
20645 on which generation is ongoing.
20646 <p>
20649 <p>
20657 </code>
20661 <dt><pre>
20663 <I></I>
20664 <B></B>(
20665 <b></b> <i></i>
20666 )
20667 </pre>
20668 <dd> Iterates over the nodes of a decision diagram f.
20669 <ul>
20670 <li> DdManager *manager;
20671 <li> DdNode *f;
20672 <li> DdGen *gen;
20673 <li> DdNode *node;
20674 </ul>
20675 The nodes are returned in a seemingly random order.
20676 Cudd_ForeachNode allocates and frees the generator. Therefore the
20677 application should not try to do that.<p>
20678 CAUTION: It is assumed that dynamic reordering will not occur while
20679 there are open generators. It is the user's responsibility to make sure
20680 that dynamic reordering does not occur. As long as new nodes are not created
20681 during generation, and dynamic reordering is not called explicitly,
20682 dynamic reordering will not occur. Alternatively, it is sufficient to
20683 disable dynamic reordering. It is a mistake to dispose of a diagram
20684 on which generation is ongoing.
20685 <p>
20688 <p>
20696 </code>
20700 <dt><pre>
20702 <I></I>
20703 <B></B>(
20704 <b></b> <i></i>
20705 )
20706 </pre>
20707 <dd> Iterates over the paths of a ZDD f.
20708 <ul>
20709 <li> DdManager *manager;
20710 <li> DdNode *f;
20711 <li> DdGen *gen;
20712 <li> int *path;
20713 </ul>
20714 Cudd_zddForeachPath allocates and frees the generator. Therefore the
20715 application should not try to do that. Also, the path is freed at the
20716 end of Cudd_zddForeachPath and hence is not available outside of the loop.<p>
20717 CAUTION: It is assumed that dynamic reordering will not occur while
20718 there are open generators. It is the user's responsibility to make sure
20719 that dynamic reordering does not occur. As long as new nodes are not created
20720 during generation, and dynamic reordering is not called explicitly,
20721 dynamic reordering will not occur. Alternatively, it is sufficient to
20722 disable dynamic reordering. It is a mistake to dispose of a diagram
20723 on which generation is ongoing.
20724 <p>
20727 <p>
20734 </code>
20738 <dt><pre>
20740 <I></I>
20741 <B></B>(
20742 <b></b> <i></i>
20743 )
20744 </pre>
20745 <dd> Iterates over the primes of a Boolean function producing
20746 a prime and irredundant cover.
20747 <ul>
20748 <li> DdManager *manager;
20749 <li> DdNode *l;
20750 <li> DdNode *u;
20751 <li> DdGen *gen;
20752 <li> int *cube;
20753 </ul>
20754 The Boolean function is described by an upper bound and a lower bound. If
20755 the function is completely specified, the two bounds coincide.
20756 Cudd_ForeachPrime allocates and frees the generator. Therefore the
20757 application should not try to do that. Also, the cube is freed at the
20758 end of Cudd_ForeachPrime and hence is not available outside of the loop.<p>
20759 CAUTION: It is a mistake to change a diagram on which generation is ongoing.
20760 <p>
20763 <p>
20770 </code>
20774 <dt><pre>
20776 <I></I>
20777 <B></B>(
20778 <b></b> <i></i>
20779 )
20780 </pre>
20781 <dd> Outputs a line of stats if DD_COUNT and DD_STATS are
20782 defined. Increments the number of recursive calls if DD_COUNT is
20783 defined.
20784 <p>
20787 <p>
20791 <dt><pre>
20793 <I></I>
20794 <B></B>(
20795 <b></b> <i></i>
20796 )
20797 </pre>
20799 <p>
20802 <p>
20806 </code>
20810 <dt><pre>
20812 <I></I>
20813 <B></B>(
20814 <b></b> <i></i>
20815 )
20816 </pre>
20818 arguments x and y is less than e.
20819 <p>
20822 <p>
20826 <dt><pre>
20828 <I></I>
20829 <B></B>(
20830 <b></b> <i></i>
20831 )
20832 </pre>
20834 internal node). All constant nodes have the same index
20835 (CUDD_CONST_INDEX). The pointer passed to Cudd_IsConstant may be either
20836 regular or complemented.
20837 <p>
20840 <p>
20844 <dt><pre>
20846 <I></I>
20847 <B></B>(
20848 <b></b> <i></i>
20849 )
20850 </pre>
20852 internal node). All constant nodes have the same index
20853 (CUDD_CONST_INDEX). The pointer passed to cuddIsConstant must be regular.
20854 <p>
20857 <p>
20860 </code>
20864 <dt><pre>
20866 <I></I>
20867 <B></B>(
20868 <b></b> <i></i>
20869 )
20870 </pre>
20872 from the logical zero. The latter is obtained by
20873 Cudd_Not(DD_ONE(dd)).
20874 <p>
20877 <p>
20881 DD_PLUS_INFINITY
20882 DD_MINUS_INFINITY
20883 </code>
20887 <dt><pre>
20889 <I></I>
20890 <B></B>(
20891 <b></b> <i></i>
20892 )
20893 </pre>
20894 <dd> Returns the complemented version of a pointer.
20895 <p>
20898 <p>
20902 </code>
20906 <dt><pre>
20908 <I></I>
20909 <B></B>(
20910 <b></b> <i></i>
20911 )
20912 </pre>
20914 <p>
20917 <p>
20920 DD_PLUS_INFINITY
20921 DD_MINUS_INFINITY
20922 </code>
20926 <dt><pre>
20928 <I></I>
20929 <B></B>(
20930 <b></b> <i></i>
20931 )
20932 </pre>
20933 <dd> Returns the current position in the order of variable
20934 index. This macro is obsolete and is kept for compatibility. New
20935 applications should use Cudd_ReadPerm instead.
20936 <p>
20939 <p>
20942 </code>
20946 <dt><pre>
20948 <I></I>
20949 <B></B>(
20950 <b></b> <i></i>
20951 )
20952 </pre>
20953 <dd> Returns the else child of an internal node. If
20955 The pointer passed to cuddE must be regular.
20956 <p>
20959 <p>
20962 </code>
20966 <dt><pre>
20968 <I></I>
20969 <B></B>(
20970 <b></b> <i></i>
20971 )
20972 </pre>
20973 <dd> Returns the else child of an internal node. If
20975 <p>
20978 <p>
20982 </code>
20986 <dt><pre>
20988 <I></I>
20989 <B></B>(
20990 <b></b> <i></i>
20991 )
20992 </pre>
20993 <dd> Returns the minus infinity constant node.
20994 <p>
20997 <p>
21000 DD_ZERO
21001 DD_PLUS_INFINITY
21002 </code>
21006 <dt><pre>
21008 <I></I>
21009 <B></B>(
21010 <b></b> <i></i>
21011 )
21012 </pre>
21013 <dd> Returns the plus infinity constant node.
21014 <p>
21017 <p>
21020 DD_ZERO
21021 DD_MINUS_INFINITY
21022 </code>
21026 <dt><pre>
21028 <I></I>
21029 <B></B>(
21030 <b></b> <i></i>
21031 )
21032 </pre>
21033 <dd> Returns the regular version of a pointer.
21034 <p>
21037 <p>
21041 </code>
21045 <dt><pre>
21047 <I></I>
21048 <B></B>(
21049 <b></b> <i></i>
21050 )
21051 </pre>
21052 <dd> Returns the then child of an internal node. If
21054 The pointer passed to cuddT must be regular.
21055 <p>
21058 <p>
21061 </code>
21065 <dt><pre>
21067 <I></I>
21068 <B></B>(
21069 <b></b> <i></i>
21070 )
21071 </pre>
21072 <dd> Returns the then child of an internal node. If
21074 <p>
21077 <p>
21081 </code>
21085 <dt><pre>
21087 <I></I>
21088 <B></B>(
21089 <b></b> <i></i>
21090 )
21091 </pre>
21092 <dd> Returns the value of a constant node. If
21094 The pointer passed to cuddV must be regular.
21095 <p>
21098 <p>
21101 </code>
21105 <dt><pre>
21107 <I></I>
21108 <B></B>(
21109 <b></b> <i></i>
21110 )
21111 </pre>
21112 <dd> Returns the value of a constant node. If
21114 <p>
21117 <p>
21121 </code>
21125 <dt><pre>
21127 <I></I>
21128 <B></B>(
21129 <b></b> <i></i>
21130 )
21131 </pre>
21132 <dd> Saturating decrement operator.
21133 <p>
21136 <p>
21139 </code>
21143 <dt><pre>
21145 <I></I>
21146 <B></B>(
21147 <b></b> <i></i>
21148 )
21149 </pre>
21150 <dd> Saturating increment operator.
21151 <p>
21154 <p>
21157 </code>
21162 </DL>
21163 <HR>
21164 Last updated on 20090220 23h06
21165 </BODY></HTML>