| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/if/ |
| H A D | ifMap.c | 202 …pCut->Delay = (float)Abc_ExactDelayCost( If_CutTruthW(p, pCut), If_CutLeaveNum(pCut), If_CutArrTim… in If_ObjPerformMappingAnd()
214 pCut->Delay = If_CutDelaySop( p, pCut ); in If_ObjPerformMappingAnd()
216 pCut->Delay = If_CutDelay( p, pObj, pCut ); in If_ObjPerformMappingAnd()
222 pCut->Area = (Mode == 2)? If_CutAreaDerefed( p, pCut ) : If_CutAreaFlow( p, pCut ); in If_ObjPerformMappingAnd()
224 pCut->Edge = (Mode == 2)? If_CutEdgeDerefed( p, pCut ) : If_CutEdgeFlow( p, pCut ); in If_ObjPerformMappingAnd()
275 …pCut->fAndCut = fUseAndCut && pCut->nLeaves == 2 && pCut->pLeaves[0] == pObj->pFanin0->Id && pCut-… in If_ObjPerformMappingAnd()
405 pCut->fUseless = (int)(iCofVar == (int)pCut->nLeaves && pCut->nLeaves > 0); in If_ObjPerformMappingAnd()
430 …pCut->Delay = (float)Abc_ExactDelayCost( If_CutTruthW(p, pCut), If_CutLeaveNum(pCut), If_CutArrTim… in If_ObjPerformMappingAnd()
442 pCut->Delay = If_CutDelaySop( p, pCut ); in If_ObjPerformMappingAnd()
450 pCut->Area = (Mode == 2)? If_CutAreaDerefed( p, pCut ) : If_CutAreaFlow( p, pCut ); in If_ObjPerformMappingAnd()
[all …]
|
| H A D | ifDelay.c | 73 pCut->fUser = 1; in If_CutDelaySop()
86 assert( If_CutLeaveNum(pCut) >= 0 && If_CutLeaveNum(pCut) <= 16 ); in If_CutDelaySop()
250 pCut->fUser = 1; in If_CutSopBalanceEval()
258 pCut->Cost = 0; in If_CutSopBalanceEval()
268 pCut->Cost = 0; in If_CutSopBalanceEval()
300 …Kit_TruthIsopPrintCover( vCover, If_CutLeaveNum(pCut), Abc_LitIsCompl(If_CutTruthLit(pCut)) ^ pCut… in If_CutSopBalanceEval()
341 assert( (If_CutLeaveNum(pCut) > LutSize) == (pCut->uMaskFunc > 0) ); in If_CutLutBalancePinDelays()
371 pCut->fUser = 1; in If_CutLutBalanceEval()
372 pCut->Cost = pCut->nLeaves > 1 ? 1 : 0; in If_CutLutBalanceEval()
373 pCut->uMaskFunc = 0; in If_CutLutBalanceEval()
[all …]
|
| H A D | ifTruth.c | 77 …TruthPermute( NULL, If_CutLeaveNum(pCut), pCut->nLeaves, p->nTruth6Words[pCut->nLeaves], PinDelays… in If_CutRotatePins()
81 …ermute( p->puTempW, If_CutLeaveNum(pCut), pCut->nLeaves, p->nTruth6Words[pCut->nLeaves], PinDelays… in If_CutRotatePins()
83 pCut->iCutFunc = Abc_Var2Lit( truthId, If_CutTruthIsCompl(pCut) ); in If_CutRotatePins()
110 …Abc_TtExpand( pTruth0, pCut->nLeaves, pCut0->pLeaves, pCut0->nLeaves, pCut->pLeaves, pCut->nLeaves… in If_CutComputeTruth()
111 …Abc_TtExpand( pTruth1, pCut->nLeaves, pCut1->pLeaves, pCut1->nLeaves, pCut->pLeaves, pCut->nLeaves… in If_CutComputeTruth()
116 nLeavesNew = Abc_TtMinBase( pTruth, pCut->pLeaves, pCut->nLeaves, pCut->nLeaves ); in If_CutComputeTruth()
120 pCut->uSign = If_ObjCutSignCompute( pCut ); in If_CutComputeTruth()
219 nLeavesNew = Abc_TtMinBase( pTruth, pCut->pLeaves, pCut->nLeaves, pCut->nLeaves ); in If_CutComputeTruthPerm_int()
234 pCut->uMaskFunc = 0; in If_CutComputeTruthPerm_int()
243 pCut->uSign = If_ObjCutSignCompute( pCut ); in If_CutComputeTruthPerm_int()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/fpga/ |
| H A D | fpgaCutUtils.c | 45 Fpga_Cut_t * pCut; in Fpga_CutAlloc() local
48 return pCut; in Fpga_CutAlloc()
87 if ( pCut ) in Fpga_CutFree()
106 pCut->tArrival, pCut->aFlow, pRoot->Num ); in Fpga_CutPrint()
125 Fpga_Cut_t * pCut; in Fpga_CutCreateSimple() local
130 pCut->uSign = FPGA_SEQ_SIGN(pCut->ppLeaves[0]); in Fpga_CutCreateSimple()
131 return pCut; in Fpga_CutCreateSimple()
284 pCut->aFlow = pMan->pLutLib->pLutAreas[(int)pCut->nLeaves]; in Fpga_CutGetParameters()
299 pCut->tArrival += pMan->pLutLib->pLutDelays[(int)pCut->nLeaves][0]; in Fpga_CutGetParameters()
318 pCut->aFlow = pMan->pLutLib->pLutAreas[(int)pCut->nLeaves]; in Fpga_CutGetAreaFlow()
[all …]
|
| H A D | fpgaTruth.c | 47 assert( !Fpga_IsComplement(pCut) ); in Fpga_TruthsCutBdd_rec()
49 if ( pCut->uSign ) in Fpga_TruthsCutBdd_rec()
61 assert( pCut->uSign == 0 ); in Fpga_TruthsCutBdd_rec()
84 assert( pCut->nLeaves > 1 ); in Fpga_TruthsCutBdd()
98 pCut->uSign = 0; in Fpga_TruthsCutBdd()
120 assert( !Fpga_IsComplement(pCut) ); in Fpga_CutVolume_rec()
121 if ( pCut->fMark ) in Fpga_CutVolume_rec()
123 pCut->fMark = 1; in Fpga_CutVolume_rec()
140 int Fpga_CutVolume( Fpga_Cut_t * pCut ) in Fpga_CutVolume() argument
144 assert( pCut->nLeaves > 1 ); in Fpga_CutVolume()
[all …]
|
| H A D | fpgaCut.c | 93 pCut = pCut->pNext )
99 pCut2 = pCut? pCut->pNext: NULL )
425 pLists[(int)pCut->nLeaves] = pCut; in Fpga_CutMergeLists()
460 pLists[(int)pCut->nLeaves] = pCut; in Fpga_CutMergeLists()
500 pLists[(int)pCut->nLeaves] = pCut; in Fpga_CutMergeLists()
516 pPrev = pCut, pCut = pCut->pNext ); in Fpga_CutMergeLists()
567 pLists[(int)pCut->nLeaves] = pCut; in Fpga_CutMergeLists2()
583 pPrev = pCut, pCut = pCut->pNext ); in Fpga_CutMergeLists2()
776 for ( pCut = pNode->pCuts; pCut; pCut = pCut->pNext ) in Fpga_CutCountAll()
804 for ( pCut = pNode->pCuts; pCut; pCut = pCut->pNext ) in Fpga_CutsCleanSign()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/cut/ |
| H A D | cutNode.c | 104 *ppListR = pCut, ppListR = &pCut->pNext; in Cut_CutFilter()
176 for ( a = pCut->nLeaves + 1; a <= (int)pCut->nVarsMax; a++ ) in Cut_CutFilterOne()
182 if ( (pTemp->uSign & pCut->uSign) != pCut->uSign ) in Cut_CutFilterOne()
279 if ( (pTemp->uSign & pCut->uSign) != pCut->uSign ) in Cut_CutFilterOld()
314 Cut_Cut_t * pCut; in Cut_CutProcessTwo() local
326 pCut->Num0 = pCut0->Num0, pCut->Num1 = pCut1->Num0; in Cut_CutProcessTwo()
551 if ( pCut == NULL || pCut->nLeaves == 1 ) in Cut_ManMappingArea_rec()
721 pCut->fCompl = pTop->fSimul ^ pCut->fSimul; in Cut_NodeUnionCuts()
751 pCut->fCompl = pTop->fSimul ^ pCut->fSimul; in Cut_NodeUnionCuts()
877 pCut->fCompl = pTop->fSimul ^ pCut->fSimul; in Cut_NodeUnionCutsSeq()
[all …]
|
| H A D | cutCut.c | 47 Cut_Cut_t * pCut; in Cut_CutAlloc() local
58 return pCut; in Cut_CutAlloc()
188 Cut_Cut_t * pCut; in Cut_CutMergeLists() local
221 Cut_Cut_t * pCut; in Cut_CutNumberList() local
261 return pCut; in Cut_CutCreateTriv()
311 for ( pCut = pList; pCut; pCut = pCut->pNext ) in Cut_CutPrintList()
350 pCut->nLeaves > 0 ? pCut->pLeaves[0] : -1, in Cut_CutPrintMerge()
351 pCut->nLeaves > 1 ? pCut->pLeaves[1] : -1, in Cut_CutPrintMerge()
352 pCut->nLeaves > 2 ? pCut->pLeaves[2] : -1, in Cut_CutPrintMerge()
353 pCut->nLeaves > 3 ? pCut->pLeaves[3] : -1, in Cut_CutPrintMerge()
[all …]
|
| H A D | cutTruth.c | 90 assert( pCut->nVarsMax < 6 ); in Cut_TruthNCanonicize()
96 Extra_TruthCanonFastN( pCut->nVarsMax, pCut->nLeaves, &uTruth, &uCanon2, &pPhases2 ); in Cut_TruthNCanonicize()
100 pCut->uCanon0 = uCanon2[0]; in Cut_TruthNCanonicize()
101 pCut->Num0 = pPhases2[0]; in Cut_TruthNCanonicize()
107 Extra_TruthCanonFastN( pCut->nVarsMax, pCut->nLeaves, &uTruth, &uCanon2, &pPhases2 ); in Cut_TruthNCanonicize()
111 pCut->uCanon1 = uCanon2[0]; in Cut_TruthNCanonicize()
112 pCut->Num1 = pPhases2[0]; in Cut_TruthNCanonicize()
154 if ( pCut->fCompl ) in Cut_TruthComputeOld()
192 if ( pCut->fCompl ) in Cut_TruthCompute()
203 if ( pCut->nLeaves != 7 ) in Cut_TruthCompute()
[all …]
|
| /dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/dar/ |
| H A D | darCut.c | 138 return pCut; in Dar_CutFindFree()
218 if ( (pTemp->uSign & pCut->uSign) != pCut->uSign ) in Dar_CutFilter()
362 pCut->fUsed = 1; in Dar_CutMerge()
527 pCut->uSign = 0; in Dar_CutSuppMinimize()
532 pCut->pLeaves[k++] = pCut->pLeaves[i]; in Dar_CutSuppMinimize()
533 pCut->uSign |= Aig_ObjCutSign( pCut->pLeaves[i] ); in Dar_CutSuppMinimize()
584 pCut->fUsed = 0; in Dar_ObjPrepareCuts()
587 pCut = pCutSet; in Dar_ObjPrepareCuts()
588 pCut->fUsed = 1; in Dar_ObjPrepareCuts()
602 pCut->Value = Dar_CutFindValue( p, pCut ); in Dar_ObjPrepareCuts()
[all …]
|
| /dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/cnf/ |
| H A D | cnfCut.c | 63 Cnf_Cut_t * pCut; in Cnf_CutAlloc() local
68 pCut->vIsop[0] = pCut->vIsop[1] = NULL; in Cnf_CutAlloc()
69 return pCut; in Cnf_CutAlloc()
85 if ( pCut->vIsop[0] ) in Cnf_CutFree()
87 if ( pCut->vIsop[1] ) in Cnf_CutFree()
105 Cnf_Cut_t * pCut; in Cnf_CutCreate() local
116 return pCut; in Cnf_CutCreate()
273 pCut->nFanins--; in Cnf_CutRemoveIthVar()
275 pCut->pFanins[i] = pCut->pFanins[i+1]; in Cnf_CutRemoveIthVar()
293 pCut->pFanins[i] = pCut->pFanins[i-1]; in Cnf_CutInsertIthVar()
[all …]
|
| H A D | cnfMap.c | 64 pCut->Value = 0; in Cnf_CutAssignAreaFlow()
65 pCut->uSign = 100 * Cnf_CutSopCost( p, pCut ); in Cnf_CutAssignAreaFlow()
131 pCut->fBest = 0; in Cnf_DeriveMapping()
136 (pCutBest->uSign == pCut->uSign && pCutBest->Value < pCut->Value) ) in Cnf_DeriveMapping()
239 Aig_CutDeref( p, pCut );
290 pCutBest = pCut;
309 pCut->Area = (float)pCut->Cost;
310 pCut->NoRefs = 0;
311 pCut->FanRefs = 0;
319 pCut->NoRefs++;
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/sat/cnf/ |
| H A D | cnfCut.c | 48 Cnf_Cut_t * pCut; in Cnf_CutAlloc() local
53 pCut->vIsop[0] = pCut->vIsop[1] = NULL; in Cnf_CutAlloc()
54 return pCut; in Cnf_CutAlloc()
70 if ( pCut->vIsop[0] ) in Cnf_CutFree()
72 if ( pCut->vIsop[1] ) in Cnf_CutFree()
90 Cnf_Cut_t * pCut; in Cnf_CutCreate() local
101 return pCut; in Cnf_CutCreate()
258 pCut->nFanins--; in Cnf_CutRemoveIthVar()
260 pCut->pFanins[i] = pCut->pFanins[i+1]; in Cnf_CutRemoveIthVar()
278 pCut->pFanins[i] = pCut->pFanins[i-1]; in Cnf_CutInsertIthVar()
[all …]
|
| H A D | cnfMap.c | 49 pCut->Value = 0; in Cnf_CutAssignAreaFlow()
51 pCut->uSign = 10 * Cnf_CutSopCost( p, pCut ); in Cnf_CutAssignAreaFlow()
117 pCut->fBest = 0; in Cnf_DeriveMapping()
122 (pCutBest->uSign == pCut->uSign && pCutBest->Value < pCut->Value) ) in Cnf_DeriveMapping()
221 Aig_CutDeref( p, pCut );
272 pCutBest = pCut;
291 pCut->Area = (float)pCut->Cost;
292 pCut->NoRefs = 0;
293 pCut->FanRefs = 0;
301 pCut->NoRefs++;
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/dar/ |
| H A D | darCut.c | 67 Dar_Cut_t * pCut; in Dar_ObjCutPrint() local
150 return pCut; in Dar_CutFindFree()
230 if ( (pTemp->uSign & pCut->uSign) != pCut->uSign ) in Dar_CutFilter()
374 pCut->fUsed = 1; in Dar_CutMerge()
624 pCut->uSign = 0; in Dar_CutSuppMinimize()
629 pCut->pLeaves[k++] = pCut->pLeaves[i]; in Dar_CutSuppMinimize()
630 pCut->uSign |= Aig_ObjCutSign( pCut->pLeaves[i] ); in Dar_CutSuppMinimize()
682 pCut = pCutSet; in Dar_ObjPrepareCuts()
683 pCut->fUsed = 1; in Dar_ObjPrepareCuts()
697 pCut->Value = Dar_CutFindValue( p, pCut ); in Dar_ObjPrepareCuts()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/csw/ |
| H A D | cswCut.c | 101 return pCut; in Csw_CutFindFree()
103 pCutMax = pCut; in Csw_CutFindFree()
198 pCut->pFanins[k++] = pCut->pFanins[i]; in Csw_CutSupportMinimize()
252 if ( pTemp == pCut ) in Csw_CutFilter()
257 if ( (pTemp->uSign & pCut->uSign) != pCut->uSign ) in Csw_CutFilter()
462 pCut->nFanins = 0; in Csw_ObjPrepareCuts()
470 pCut = pCutSet; in Csw_ObjPrepareCuts()
471 pCut->Cost = 0; in Csw_ObjPrepareCuts()
473 pCut->nFanins = 1; in Csw_ObjPrepareCuts()
571 pObjNew = pCut->nFanins > 2 ? Csw_TableCutLookup( p, pCut ) : NULL; in Csw_ObjSweep()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/lpk/ |
| H A D | lpkCut.c | 235 Lpk_Cut_t * pCut; in Lpk_NodeRecordImpact() local
364 Lpk_Cut_t * pCut; in Lpk_NodeCutsOneFilter() local
388 if ( (pCut->uSign[0] & pCutNew->uSign[0]) != pCut->uSign[0] ) in Lpk_NodeCutsOneFilter()
390 if ( (pCut->uSign[1] & pCutNew->uSign[1]) != pCut->uSign[1] ) in Lpk_NodeCutsOneFilter()
456 pCut->uSign[0] = pCut->uSign[1] = 0; in Lpk_NodeCutSignature()
459 pCut->uSign[(pCut->pLeaves[i] & 32) > 0] |= (1 << (pCut->pLeaves[i] & 31)); in Lpk_NodeCutSignature()
461 assert( pCut->pLeaves[i] < pCut->pLeaves[i+1] ); in Lpk_NodeCutSignature()
551 memcpy( pCutNew->pNodes, pCut->pNodes, pCut->nNodes * sizeof(int) ); in Lpk_NodeCutsOne()
657 Lpk_NodeCutsOne( p, pCut, pCut->pLeaves[k] ); in Lpk_NodeCuts()
683 … pCut->Weight = (float)1.0 * (pCut->nNodes - pCut->nNodesDup) / pCut->nLuts; //p->pPars->nLutsMax; in Lpk_NodeCuts()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/aig/ |
| H A D | aigCuts.c | 127 Aig_Cut_t * pCut; in Aig_ObjCutPrint() local
131 if ( pCut->nFanins ) in Aig_ObjCutPrint()
149 Aig_Cut_t * pCut; in Aig_ManCutCount() local
228 return pCut; in Aig_CutFindFree()
230 pCutMax = pCut; in Aig_CutFindFree()
325 pCut->pFanins[k++] = pCut->pFanins[i]; in Aig_CutSupportMinimize()
384 if ( (pTemp->uSign & pCut->uSign) != pCut->uSign ) in Aig_CutFilter()
553 pCut = pCutSet; in Aig_ObjPrepareCuts()
554 pCut->Cost = 0; in Aig_ObjPrepareCuts()
556 pCut->nFanins = 1; in Aig_ObjPrepareCuts()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/ |
| H A D | abcRenode.c | 174 pGraph = Kit_TruthToGraph( If_CutTruth(p, pCut), If_CutLeaveNum(pCut), s_vMemory ); in Abc_NtkRenodeEvalAig()
207 …bFunc = Kit_TruthToBdd( s_pDd, If_CutTruth(p, pCut), If_CutLeaveNum(pCut), 0 ); Cudd_Ref( bFunc ); in Abc_NtkRenodeEvalBdd()
235 RetValue = Kit_TruthIsop( If_CutTruth(p, pCut), If_CutLeaveNum(pCut), s_vMemory, 1 ); in Abc_NtkRenodeEvalSop()
261 RetValue = Kit_TruthIsop( If_CutTruth(p, pCut), If_CutLeaveNum(pCut), s_vMemory, 0 ); in Abc_NtkRenodeEvalCnf()
267 Kit_TruthNot( If_CutTruth(p, pCut), If_CutTruth(p, pCut), If_CutLeaveNum(pCut) ); in Abc_NtkRenodeEvalCnf()
268 RetValue = Kit_TruthIsop( If_CutTruth(p, pCut), If_CutLeaveNum(pCut), s_vMemory, 0 ); in Abc_NtkRenodeEvalCnf()
269 Kit_TruthNot( If_CutTruth(p, pCut), If_CutTruth(p, pCut), If_CutLeaveNum(pCut) ); in Abc_NtkRenodeEvalCnf()
296 RetValue = Kit_TruthIsop( If_CutTruth(p, pCut), If_CutLeaveNum(pCut), s_vMemory, 0 ); in Abc_NtkRenodeEvalMv()
301 Kit_TruthNot( If_CutTruth(p, pCut), If_CutTruth(p, pCut), If_CutLeaveNum(pCut) ); in Abc_NtkRenodeEvalMv()
302 RetValue = Kit_TruthIsop( If_CutTruth(p, pCut), If_CutLeaveNum(pCut), s_vMemory2, 0 ); in Abc_NtkRenodeEvalMv()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/mpm/ |
| H A D | mpmMap.c | 58 Mpm_Cut_t * pCut; in Mpm_CutCreateZero() local
184 assert( &pUnit->pCut == pCut ); in Mpm_CutSetupInfo()
391 pCut->iFunc = 0; pCut->iFunc = ~pCut->iFunc; in Mpm_ManMergeCuts()
398 Vec_IntSelectSort( pCut->pLeaves, pCut->nLeaves ); in Mpm_ManMergeCuts()
399 return pCut; in Mpm_ManMergeCuts()
542 pCut = Mpm_ManMergeCuts( p, pCut, NULL, NULL ); in Mpm_ObjAddChoiceCutsToStore()
558 *pList = Mpm_CutCreate( p, &pUnit->pCut, &pCut ); in Mpm_ObjTranslateCutsFromStore()
751 if ( pOld->pCut.nLeaves != pNew->pCut.nLeaves ) return pOld->pCut.nLeaves - pNew->pCut.nLeaves; in Mpm_CutCompareDelay()
761 if ( pOld->pCut.nLeaves != pNew->pCut.nLeaves ) return pOld->pCut.nLeaves - pNew->pCut.nLeaves; in Mpm_CutCompareDelay2()
767 if ( pOld->pCut.nLeaves != pNew->pCut.nLeaves ) return pOld->pCut.nLeaves - pNew->pCut.nLeaves; in Mpm_CutCompareArea()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/ivy/ |
| H A D | ivyCut.c | 526 pCut->uHash = 0; in Ivy_NodeCutHash()
528 pCut->uHash |= (1 << (pCut->pArray[i] % 31)); in Ivy_NodeCutHash()
548 pCut->pArray[k++] = pCut->pArray[i]; in Ivy_NodeCutShrink()
550 pCut->nSize--; in Ivy_NodeCutShrink()
571 if ( pCut->nSize == pCut->nSizeMax ) in Ivy_NodeCutExtend()
576 pCut->pArray[i+1] = pCut->pArray[i]; in Ivy_NodeCutExtend()
583 pCut->nSize++; in Ivy_NodeCutExtend()
601 if ( pCut->nSize < pCut->nSizeMax ) in Ivy_NodeCutPrescreen()
604 if ( pCut->pArray[i] == Id0 || pCut->pArray[i] == Id1 ) in Ivy_NodeCutPrescreen()
682 Ivy_Cut_t * pCut; in Ivy_NodeCutFindOrAdd() local
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/acec/ |
| H A D | acecRe.c | 32 #define Ree_ForEachCut( pList, pCut, i ) for ( i = 0, pCut = pList + 1; i < pList[0]; i++, pCut += … argument
110 pCut[1+pCut[0]++] = pCut0[i]; in Ree_ManCutMergeOne()
113 if ( pCut[1] > pCut[2] ) in Ree_ManCutMergeOne()
114 ABC_SWAP( int, pCut[1], pCut[2] ); in Ree_ManCutMergeOne()
115 assert( pCut[1] < pCut[2] ); in Ree_ManCutMergeOne()
118 if ( pCut[2] > pCut[3] ) in Ree_ManCutMergeOne()
119 ABC_SWAP( int, pCut[2], pCut[3] ); in Ree_ManCutMergeOne()
120 if ( pCut[1] > pCut[2] ) in Ree_ManCutMergeOne()
121 ABC_SWAP( int, pCut[1], pCut[2] ); in Ree_ManCutMergeOne()
122 assert( pCut[1] < pCut[2] ); in Ree_ManCutMergeOne()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/amap/ |
| H A D | amapMerge.c | 84 memcpy( pNew->Fans, pCut->Fans, sizeof(int) * pCut->nFans ); in Amap_ManCutStore()
123 *Amap_ManCutNextP( pCut ) = p->ppCutsTemp[ pCut->iMat ]; in Amap_ManCutCreate()
124 p->ppCutsTemp[ pCut->iMat ] = pCut; in Amap_ManCutCreate()
125 return pCut; in Amap_ManCutCreate()
158 *Amap_ManCutNextP( pCut ) = p->ppCutsTemp[ pCut->iMat ]; in Amap_ManCutCreate3()
159 p->ppCutsTemp[ pCut->iMat ] = pCut; in Amap_ManCutCreate3()
160 return pCut; in Amap_ManCutCreate3()
186 for ( pCut = p->ppCutsTemp[Entry]; pCut; pCut = *Amap_ManCutNextP(pCut) ) in Amap_ManCutSaveStored()
207 for ( pCut = p->ppCutsTemp[Entry]; pCut; pCut = *Amap_ManCutNextP(pCut) ) in Amap_ManCutSaveStored()
231 pCut = NULL; in Amap_ManCutSaveStored()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/mapper/ |
| H A D | mapperCut.c | 77 pCut = pCut->pNext )
83 pCut2 = pCut? pCut->pNext: NULL )
110 for ( pCut = pNode->pCuts; pCut; pCut = pCut->pNext ) in Map_MappingCountAllCuts()
411 pCut->pNext = pLists[(int)pCut->nLeaves]; in Map_CutMergeLists()
412 pLists[(int)pCut->nLeaves] = pCut; in Map_CutMergeLists()
445 pCut->pNext = pLists[(int)pCut->nLeaves]; in Map_CutMergeLists()
446 pLists[(int)pCut->nLeaves] = pCut; in Map_CutMergeLists()
483 pLists[(int)pCut->nLeaves] = pCut; in Map_CutMergeLists()
499 pPrev = pCut, pCut = pCut->pNext ); in Map_CutMergeLists()
550 pLists[(int)pCut->nLeaves] = pCut; in Map_CutMergeLists2()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/ |
| H A D | giaJf.c | 108 #define Jf_ObjForEachCut( pList, pCut, i ) for ( i = 0, pCut = pList + 1; i < pList[0]; i++, pCut… argument
676 pCut[++pCut[0]] = pCut1[i]; in Jf_CutMerge0()
719 pCut[++pCut[0]] = pCut1[i]; in Jf_CutMerge1()
738 pCut[(iPlace = ++pCut[0])] = pCut1[i]; in Jf_CutMerge2()
766 if ( pSto[c]->pCut[0] >= pSto[k]->pCut[0] && in Jf_ObjCutFilterBoth()
775 if ( !(pSto[c]->pCut[0] < pSto[k]->pCut[0] && in Jf_ObjCutFilterBoth()
794 if ( pSto[c]->pCut[0] >= pSto[k]->pCut[0] && in Jf_ObjCutFilter()
943 if ( pOld->pCut[0] != pNew->pCut[0] ) return pOld->pCut[0] - pNew->pCut[0]; in Jf_CutCompareDelay()
954 if ( pOld->pCut[0] != pNew->pCut[0] ) return pOld->pCut[0] - pNew->pCut[0]; in Jf_CutCompareArea()
1370 Jf_CutSetCost(pCut, Jf_CutSize(pCut)); in Jf_ObjComputeBestCut()
[all …]
|