Home
last modified time | relevance | path

Searched refs:topg (Results 1 – 25 of 70) sorted by relevance

123

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/cudd/
H A DcuddBddIte.c232 if (topg == v) { in Cudd_bddIteConstant()
585 if (topf <= topg) { in Cudd_bddLeq()
594 if (topg <= topf) { in Cudd_bddLeq()
714 if (topg == v) { in cuddBddIteRecur()
805 if (topf <= topg) { in cuddBddIntersectRecur()
818 if (topg <= topf) { in cuddBddIntersectRecur()
939 if (topf <= topg) { in cuddBddAndRecur()
952 if (topg <= topf) { in cuddBddAndRecur()
1061 if (topf <= topg) { in cuddBddXorRecur()
1211 if ((topf > topg) || (topf == topg && cuddF2L(f) > cuddF2L(g))) { in bddVarToCanonical()
[all …]
H A DcuddAddIte.c194 topg = cuddI(dd,g->index); in Cudd_addIteConstant()
196 v = ddMin(topg,toph); in Cudd_addIteConstant()
216 if (topg == v) { in Cudd_addIteConstant()
267 unsigned int topf,topg; in Cudd_addEvalConst() local
288 topg = cuddI(dd,g->index); in Cudd_addEvalConst()
297 if (topf <= topg) { in Cudd_addEvalConst()
302 if (topg <= topf) { in Cudd_addEvalConst()
405 if (topf <= topg) { in Cudd_addLeq()
410 if (topg <= topf) { in Cudd_addLeq()
482 v = ddMin(topg,toph); in cuddAddIteRecur()
[all …]
H A DcuddLiteral.c163 unsigned int topf, topg, comple; in cuddBddLiteralSetIntersectionRecur() local
181 topg = cuddI(dd,G->index); in cuddBddLiteralSetIntersectionRecur()
185 while (topf != topg) { in cuddBddLiteralSetIntersectionRecur()
186 if (topf < topg) { /* move down on f */ in cuddBddLiteralSetIntersectionRecur()
196 } else if (topg < topf) { in cuddBddLiteralSetIntersectionRecur()
205 topg = cuddI(dd,G->index); in cuddBddLiteralSetIntersectionRecur()
H A DcuddCof.c236 unsigned int topf,topg; in cuddCofactorRecur() local
260 topg = dd->perm[G->index]; in cuddCofactorRecur()
267 if (topf <= topg) { in cuddCofactorRecur()
272 if (topg <= topf) { in cuddCofactorRecur()
280 if (topf >= topg) { in cuddCofactorRecur()
H A DcuddClip.c278 unsigned int topf, topg, index; in cuddBddClippingAndRecur() local
323 topg = manager->perm[G->index]; in cuddBddClippingAndRecur()
326 if (topf <= topg) { in cuddBddClippingAndRecur()
339 if (topg <= topf) { in cuddBddClippingAndRecur()
415 unsigned int topf, topg, topcube, top, index; in cuddBddClipAndAbsRecur() local
460 topg = manager->perm[G->index]; in cuddBddClipAndAbsRecur()
461 top = ddMin(topf, topg); in cuddBddClipAndAbsRecur()
483 if (topg == top) { in cuddBddClipAndAbsRecur()
/dports/math/py-brial/BRiAl-1.2.10/cudd/
H A DcuddAddIte.c190 topg = cuddI(dd,g->index); in cuddAddScalarInverseRecur()
192 v = ddMin(topg,toph); in cuddAddScalarInverseRecur()
212 if (topg == v) { in cuddAddScalarInverseRecur()
263 unsigned int topf,topg;
284 topg = cuddI(dd,g->index);
293 if (topf <= topg) {
298 if (topg <= topf) {
401 if (topf <= topg) {
406 if (topg <= topf) {
478 v = ddMin(topg,toph);
[all …]
H A DcuddBddIte.c268 if (topg == v) { in Cudd_bddIteConstant()
694 if (topf <= topg) { in Cudd_bddLeq()
703 if (topg <= topf) { in Cudd_bddLeq()
823 if (topg == v) { in cuddBddIteRecur()
914 if (topf <= topg) { in cuddBddIntersectRecur()
927 if (topg <= topf) { in cuddBddIntersectRecur()
1045 if (topf <= topg) { in cuddBddAndRecur()
1058 if (topg <= topf) { in cuddBddAndRecur()
1167 if (topf <= topg) { in cuddBddXorRecur()
1317 if ((topf > topg) || (topf == topg && f > g)) { in bddVarToCanonical()
[all …]
H A DcuddLiteral.c159 unsigned int topf, topg, comple; in cuddBddLiteralSetIntersectionRecur() local
177 topg = cuddI(dd,G->index); in cuddBddLiteralSetIntersectionRecur()
181 while (topf != topg) { in cuddBddLiteralSetIntersectionRecur()
182 if (topf < topg) { /* move down on f */ in cuddBddLiteralSetIntersectionRecur()
192 } else if (topg < topf) { in cuddBddLiteralSetIntersectionRecur()
201 topg = cuddI(dd,G->index); in cuddBddLiteralSetIntersectionRecur()
H A DcuddCof.c232 unsigned int topf,topg; in cuddCofactorRecur() local
256 topg = dd->perm[G->index]; in cuddCofactorRecur()
263 if (topf <= topg) { in cuddCofactorRecur()
268 if (topg <= topf) { in cuddCofactorRecur()
276 if (topf >= topg) { in cuddCofactorRecur()
H A DcuddClip.c274 unsigned int topf, topg, index; in cuddBddClippingAndRecur() local
319 topg = manager->perm[G->index]; in cuddBddClippingAndRecur()
322 if (topf <= topg) { in cuddBddClippingAndRecur()
335 if (topg <= topf) { in cuddBddClippingAndRecur()
411 unsigned int topf, topg, topcube, top, index; in cuddBddClipAndAbsRecur() local
456 topg = manager->perm[G->index]; in cuddBddClipAndAbsRecur()
457 top = ddMin(topf, topg); in cuddBddClipAndAbsRecur()
479 if (topg == top) { in cuddBddClipAndAbsRecur()
/dports/math/cudd/cudd-3.0.0/cudd/
H A DcuddAddIte.c148 int topf,topg,toph,v; in Cudd_addIteConstant() local
173 v = ddMin(topg,toph); in Cudd_addIteConstant()
193 if (topg == v) { in Cudd_addIteConstant()
244 int topf,topg; in Cudd_addEvalConst() local
274 if (topf <= topg) { in Cudd_addEvalConst()
279 if (topg <= topf) { in Cudd_addEvalConst()
362 int topf, topg, res; in Cudd_addLeq() local
385 if (topf <= topg) { in Cudd_addLeq()
390 if (topg <= topf) { in Cudd_addLeq()
431 int topf,topg,toph,v; in cuddAddIteRecur() local
[all …]
H A DcuddBddIte.c233 if (topg == v) { in Cudd_bddIteConstant()
671 if (topf <= topg) { in Cudd_bddLeq()
680 if (topg <= topf) { in Cudd_bddLeq()
799 if (topg == v) { in cuddBddIteRecur()
863 int topf, topg; in cuddBddIntersectRecur() local
890 if (topf <= topg) { in cuddBddIntersectRecur()
903 if (topg <= topf) { in cuddBddIntersectRecur()
977 int topf, topg; in cuddBddAndRecur() local
1107 int topf, topg; in cuddBddXorRecur() local
1295 if ((topf > topg) || (topf == topg && f > g)) { in bddVarToCanonical()
[all …]
H A DcuddLiteral.c148 int topf, topg, comple; in cuddBddLiteralSetIntersectionRecur() local
166 topg = cuddI(dd,G->index); in cuddBddLiteralSetIntersectionRecur()
170 while (topf != topg) { in cuddBddLiteralSetIntersectionRecur()
171 if (topf < topg) { /* move down on f */ in cuddBddLiteralSetIntersectionRecur()
181 } else if (topg < topf) { in cuddBddLiteralSetIntersectionRecur()
190 topg = cuddI(dd,G->index); in cuddBddLiteralSetIntersectionRecur()
H A DcuddClip.c250 int topf, topg; in cuddBddClippingAndRecur() local
298 topg = manager->perm[G->index]; in cuddBddClippingAndRecur()
301 if (topf <= topg) { in cuddBddClippingAndRecur()
314 if (topg <= topf) { in cuddBddClippingAndRecur()
388 int topf, topg, topcube, top; in cuddBddClipAndAbsRecur() local
436 topg = manager->perm[G->index]; in cuddBddClipAndAbsRecur()
437 top = ddMin(topf, topg); in cuddBddClipAndAbsRecur()
459 if (topg == top) { in cuddBddClipAndAbsRecur()
/dports/math/brial/BRiAl-1.2.10/cudd/
H A DcuddAddIte.c190 topg = cuddI(dd,g->index); in Cudd_addIteConstant()
192 v = ddMin(topg,toph); in Cudd_addIteConstant()
212 if (topg == v) { in Cudd_addIteConstant()
263 unsigned int topf,topg; in Cudd_addEvalConst() local
284 topg = cuddI(dd,g->index); in Cudd_addEvalConst()
293 if (topf <= topg) { in Cudd_addEvalConst()
298 if (topg <= topf) { in Cudd_addEvalConst()
401 if (topf <= topg) { in Cudd_addLeq()
406 if (topg <= topf) { in Cudd_addLeq()
478 v = ddMin(topg,toph); in cuddAddIteRecur()
[all …]
H A DcuddBddIte.c268 if (topg == v) { in Cudd_bddIteConstant()
694 if (topf <= topg) { in Cudd_bddLeq()
703 if (topg <= topf) { in Cudd_bddLeq()
823 if (topg == v) { in cuddBddIteRecur()
914 if (topf <= topg) { in cuddBddIntersectRecur()
927 if (topg <= topf) { in cuddBddIntersectRecur()
1045 if (topf <= topg) { in cuddBddAndRecur()
1058 if (topg <= topf) { in cuddBddAndRecur()
1167 if (topf <= topg) { in cuddBddXorRecur()
1317 if ((topf > topg) || (topf == topg && f > g)) { in bddVarToCanonical()
[all …]
H A DcuddLiteral.c159 unsigned int topf, topg, comple; in cuddBddLiteralSetIntersectionRecur() local
177 topg = cuddI(dd,G->index); in cuddBddLiteralSetIntersectionRecur()
181 while (topf != topg) { in cuddBddLiteralSetIntersectionRecur()
182 if (topf < topg) { /* move down on f */ in cuddBddLiteralSetIntersectionRecur()
192 } else if (topg < topf) { in cuddBddLiteralSetIntersectionRecur()
201 topg = cuddI(dd,G->index); in cuddBddLiteralSetIntersectionRecur()
H A DcuddCof.c232 unsigned int topf,topg; in cuddCofactorRecur() local
256 topg = dd->perm[G->index]; in cuddCofactorRecur()
263 if (topf <= topg) { in cuddCofactorRecur()
268 if (topg <= topf) { in cuddCofactorRecur()
276 if (topf >= topg) { in cuddCofactorRecur()
H A DcuddClip.c274 unsigned int topf, topg, index; in cuddBddClippingAndRecur() local
319 topg = manager->perm[G->index]; in cuddBddClippingAndRecur()
322 if (topf <= topg) { in cuddBddClippingAndRecur()
335 if (topg <= topf) { in cuddBddClippingAndRecur()
411 unsigned int topf, topg, topcube, top, index; in cuddBddClipAndAbsRecur() local
456 topg = manager->perm[G->index]; in cuddBddClipAndAbsRecur()
457 top = ddMin(topf, topg); in cuddBddClipAndAbsRecur()
479 if (topg == top) { in cuddBddClipAndAbsRecur()
/dports/misc/xdelta3/xdelta-3.1.0/xdelta3/examples/
H A Dsmall_page_test.c119 uint8_t topg[PAGE_SIZE]; in test() local
128 topg[i] = frompg[i] = (rand() >> 3 ^ rand() >> 6 ^ rand() >> 9); in test()
136 topg[j - 1] ^= 0xff; in test()
141 topg, PAGE_SIZE, in test()
170 if (reout[i] != topg[i]) in test()
/dports/sysutils/fwup/fwup-1.9.0/src/3rdparty/xdelta3/examples/
H A Dsmall_page_test.c133 uint8_t topg[PAGE_SIZE];
142 topg[i] = frompg[i] = (rand() >> 3 ^ rand() >> 6 ^ rand() >> 9);
150 topg[j - 1] ^= 0xff;
155 topg, PAGE_SIZE,
184 if (reout[i] != topg[i])
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/google/martian/v3/cmd/proxy/
H A Dmain.go334 topg := fifo.NewGroup()
347 topg.AddRequestModifier(apif)
349 topg.AddRequestModifier(stack)
350 topg.AddResponseModifier(stack)
352 p.SetRequestModifier(topg)
353 p.SetResponseModifier(topg)
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/google/martian/v3/cmd/proxy/
H A Dmain.go334 topg := fifo.NewGroup()
347 topg.AddRequestModifier(apif)
349 topg.AddRequestModifier(stack)
350 topg.AddResponseModifier(stack)
352 p.SetRequestModifier(topg)
353 p.SetResponseModifier(topg)
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/google/martian/v3/mobile/
H A Dproxy.go144 topg := fifo.NewGroup()
147 topg.AddRequestModifier(apif)
150 topg.AddRequestModifier(stack)
151 topg.AddResponseModifier(stack)
153 m.proxy.SetRequestModifier(topg)
154 m.proxy.SetResponseModifier(topg)
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/google/martian/v3/mobile/
H A Dproxy.go144 topg := fifo.NewGroup()
147 topg.AddRequestModifier(apif)
150 topg.AddRequestModifier(stack)
151 topg.AddResponseModifier(stack)
153 m.proxy.SetRequestModifier(topg)
154 m.proxy.SetResponseModifier(topg)

123