| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/vec/ |
| H A D | vecInt.h | 1668 pBeg1++; in Vec_IntTwoCountCommon()
1696 Vec_IntPush( vArr, *pBeg1 ), pBeg1++, pBeg2++; in Vec_IntTwoFindCommon()
1698 pBeg1++; in Vec_IntTwoFindCommon()
1714 Vec_IntPush( vArr, *pBeg1 ), pBeg1++, pBeg2++; in Vec_IntTwoFindCommonReverse()
1716 pBeg1++; in Vec_IntTwoFindCommonReverse()
1746 Vec_IntPush( vArr, *pBeg1 ), pBeg1++, pBeg2++; in Vec_IntTwoRemoveCommon()
1752 while ( pBeg1 < pEnd1 ) in Vec_IntTwoRemoveCommon()
1788 while ( pBeg1 < pEnd1 ) in Vec_IntTwoRemove()
1821 while ( pBeg1 < pEnd1 ) in Vec_IntTwoMerge2Int()
1822 *pBeg++ = *pBeg1++; in Vec_IntTwoMerge2Int()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/util/ |
| H A D | utilMem.c | 232 void ** pBeg1 = vArr1->pArray; in Vec_MemTwoMerge() local
236 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Vec_MemTwoMerge()
238 if ( *pBeg1 == *pBeg2 ) in Vec_MemTwoMerge()
239 pBeg1++, pBeg2++; in Vec_MemTwoMerge()
240 else if ( *pBeg1 < *pBeg2 ) in Vec_MemTwoMerge()
242 free( *pBeg1 ); in Vec_MemTwoMerge()
243 *pBeg++ = *pBeg1++; in Vec_MemTwoMerge()
249 while ( pBeg1 < pEnd1 ) in Vec_MemTwoMerge()
250 *pBeg++ = *pBeg1++; in Vec_MemTwoMerge()
|
| /dports/math/stp/stp-2.3.3/lib/extlib-abc/ |
| H A D | vecInt.h | 791 int * pBeg1 = vArr1->pArray; in Vec_IntTwoCountCommon() local
798 if ( *pBeg1 == *pBeg2 ) in Vec_IntTwoCountCommon()
799 pBeg1++, pBeg2++, Counter++; in Vec_IntTwoCountCommon()
800 else if ( *pBeg1 < *pBeg2 ) in Vec_IntTwoCountCommon()
801 pBeg1++; in Vec_IntTwoCountCommon()
823 int * pBeg1 = vArr1->pArray; in Vec_IntTwoMerge() local
829 if ( *pBeg1 == *pBeg2 ) in Vec_IntTwoMerge()
831 else if ( *pBeg1 < *pBeg2 ) in Vec_IntTwoMerge()
832 *pBeg++ = *pBeg1++; in Vec_IntTwoMerge()
836 while ( pBeg1 < pEnd1 ) in Vec_IntTwoMerge()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/ |
| H A D | giaEsop.c | 384 int * pBeg1 = vCube1->pArray; in Eso_ManComputeAnd() local
388 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Eso_ManComputeAnd()
390 if ( *pBeg1 == *pBeg2 ) in Eso_ManComputeAnd()
391 *pBeg++ = *pBeg1++, pBeg2++; in Eso_ManComputeAnd()
392 else if ( Abc_Lit2Var(*pBeg1) == Abc_Lit2Var(*pBeg2) ) in Eso_ManComputeAnd()
394 else if ( *pBeg1 < *pBeg2 ) in Eso_ManComputeAnd()
395 *pBeg++ = *pBeg1++; in Eso_ManComputeAnd()
399 while ( pBeg1 < pEnd1 ) in Eso_ManComputeAnd()
400 *pBeg++ = *pBeg1++; in Eso_ManComputeAnd()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/ |
| H A D | abcFx.c | 579 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Fx_ManDivFindCubeFree()
581 if ( *pBeg1 == *pBeg2 ) in Fx_ManDivFindCubeFree()
582 pBeg1++, pBeg2++, Counter++; in Fx_ManDivFindCubeFree()
583 else if ( *pBeg1 < *pBeg2 ) in Fx_ManDivFindCubeFree()
592 while ( pBeg1 < pEnd1 ) in Fx_ManDivFindCubeFree()
912 int * pBeg1 = vPart0->pArray; in Fx_ManFindCommonPairs() local
919 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Fx_ManFindCommonPairs()
925 for ( i = 1; pBeg1+i < pEnd1; i++ ) in Fx_ManFindCommonPairs()
934 if ( pBeg1[i_] == pBeg2[k_] ) in Fx_ManFindCommonPairs()
944 pBeg1 += i; in Fx_ManFindCommonPairs()
[all …]
|
| H A D | abcPart.c | 215 int * pBeg1 = p1->pOuts; in Supp_ManMergeEntry() local
220 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Supp_ManMergeEntry()
222 if ( *pBeg1 == *pBeg2 ) in Supp_ManMergeEntry()
223 *pBeg++ = *pBeg1++, pBeg2++; in Supp_ManMergeEntry()
224 else if ( *pBeg1 < *pBeg2 ) in Supp_ManMergeEntry()
225 *pBeg++ = *pBeg1++; in Supp_ManMergeEntry()
229 while ( pBeg1 < pEnd1 ) in Supp_ManMergeEntry()
230 *pBeg++ = *pBeg1++; in Supp_ManMergeEntry()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/extra/ |
| H A D | extraUtilPrime.c | 350 int * pBeg1 = pCube1 + 1; // skip variable ID in Tab_ManCubeFree() local
352 int * pEnd1 = pBeg1 + pCube1[0]; in Tab_ManCubeFree()
356 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Tab_ManCubeFree()
358 if ( *pBeg1 == *pBeg2 ) in Tab_ManCubeFree()
359 pBeg1++, pBeg2++, Counter++; in Tab_ManCubeFree()
360 else if ( *pBeg1 < *pBeg2 ) in Tab_ManCubeFree()
361 Vec_IntPush( vCubeFree, Abc_Var2Lit(*pBeg1++, fAttr0) ); in Tab_ManCubeFree()
369 while ( pBeg1 < pEnd1 ) in Tab_ManCubeFree()
370 Vec_IntPush( vCubeFree, Abc_Var2Lit(*pBeg1++, fAttr0) ); in Tab_ManCubeFree()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/acec/ |
| H A D | acecCore.c | 435 int * pBeg1 = Vec_IntArray(vLevel1); in Acec_MatchBoxes() local
438 while ( pBeg0 < pEnd0 && pBeg1 < pEnd1 ) in Acec_MatchBoxes()
441 int Entry1 = Abc_Lit2LitL( Vec_IntArray(vMap1), *pBeg1 ); in Acec_MatchBoxes()
442 assert( *pBeg0 && *pBeg1 ); in Acec_MatchBoxes()
446 Vec_IntPush( vShared1, *pBeg1++ ); in Acec_MatchBoxes()
451 Vec_IntPush( vUnique1, *pBeg1++ ); in Acec_MatchBoxes()
455 while ( pBeg1 < pEnd1 ) in Acec_MatchBoxes()
456 Vec_IntPush( vUnique1, *pBeg1++ ); in Acec_MatchBoxes()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/aig/ |
| H A D | aigUtil.c | 1242 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Aig_NodeUnionLists()
1244 if ( (*pBeg1)->Id == (*pBeg2)->Id ) in Aig_NodeUnionLists()
1245 *pBeg++ = *pBeg1++, pBeg2++; in Aig_NodeUnionLists()
1246 else if ( (*pBeg1)->Id < (*pBeg2)->Id ) in Aig_NodeUnionLists()
1247 *pBeg++ = *pBeg1++; in Aig_NodeUnionLists()
1251 while ( pBeg1 < pEnd1 ) in Aig_NodeUnionLists()
1252 *pBeg++ = *pBeg1++; in Aig_NodeUnionLists()
1281 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Aig_NodeIntersectLists()
1283 if ( (*pBeg1)->Id == (*pBeg2)->Id ) in Aig_NodeIntersectLists()
1284 *pBeg++ = *pBeg1++, pBeg2++; in Aig_NodeIntersectLists()
[all …]
|
| H A D | aigPart.c | 215 int * pBeg1 = p1->pOuts; in Part_ManMergeEntry() local
220 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Part_ManMergeEntry()
222 if ( *pBeg1 == *pBeg2 ) in Part_ManMergeEntry()
223 *pBeg++ = *pBeg1++, pBeg2++; in Part_ManMergeEntry()
224 else if ( *pBeg1 < *pBeg2 ) in Part_ManMergeEntry()
225 *pBeg++ = *pBeg1++; in Part_ManMergeEntry()
229 while ( pBeg1 < pEnd1 ) in Part_ManMergeEntry()
230 *pBeg++ = *pBeg1++; in Part_ManMergeEntry()
|
| /dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/aig/ |
| H A D | aigPart.c | 228 int * pBeg1 = p1->pOuts; in Part_ManMergeEntry() local
233 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Part_ManMergeEntry()
235 if ( *pBeg1 == *pBeg2 ) in Part_ManMergeEntry()
236 *pBeg++ = *pBeg1++, pBeg2++; in Part_ManMergeEntry()
237 else if ( *pBeg1 < *pBeg2 ) in Part_ManMergeEntry()
238 *pBeg++ = *pBeg1++; in Part_ManMergeEntry()
242 while ( pBeg1 < pEnd1 ) in Part_ManMergeEntry()
243 *pBeg++ = *pBeg1++; in Part_ManMergeEntry()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/pla/ |
| H A D | plaFxch.c | 253 int * pBeg1 = vArr1->pArray; in Fxch_CollectSingles() local
260 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Fxch_CollectSingles()
262 if ( Pla_CubeNum(*pBeg1) == Pla_CubeNum(*pBeg2) ) in Fxch_CollectSingles()
263 Vec_IntPushTwo( vArr, *pBeg1, *pBeg2 ), pBeg1++, pBeg2++; in Fxch_CollectSingles()
264 else if ( *pBeg1 < *pBeg2 ) in Fxch_CollectSingles()
265 *pBeg1New++ = *pBeg1++; in Fxch_CollectSingles()
269 while ( pBeg1 < pEnd1 ) in Fxch_CollectSingles()
270 *pBeg1New++ = *pBeg1++; in Fxch_CollectSingles()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/bdc/ |
| H A D | bdcSpfd.c | 596 Bdc_Ent_t * p, * q, * pBeg0, * pEnd0, * pBeg1, * pEnd1, * pThis0, * pThis1; in Bdc_SpfdDecomposeTest__() local
645 pBeg1 = p + Vec_IntEntry( vStops, m ); in Bdc_SpfdDecomposeTest__()
649 printf( "Trying %7d x %7d. ", (int)(pEnd0-pBeg0), (int)(pEnd1-pBeg1) ); in Bdc_SpfdDecomposeTest__()
651 for ( pThis1 = pBeg1; pThis1 < pEnd1; pThis1++ ) in Bdc_SpfdDecomposeTest__()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/sbd/ |
| H A D | sbdCore.c | 1613 int * pBeg1 = pCut1 + 1; in Sbd_CutMergeSimple() local
1617 while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 ) in Sbd_CutMergeSimple()
1619 if ( *pBeg1 == *pBeg2 ) in Sbd_CutMergeSimple()
1620 *pBeg++ = *pBeg1++, pBeg2++; in Sbd_CutMergeSimple()
1621 else if ( *pBeg1 < *pBeg2 ) in Sbd_CutMergeSimple()
1622 *pBeg++ = *pBeg1++; in Sbd_CutMergeSimple()
1626 while ( pBeg1 < pEnd1 ) in Sbd_CutMergeSimple()
1627 *pBeg++ = *pBeg1++; in Sbd_CutMergeSimple()
|