Home
last modified time | relevance | path

Searched refs:pFanins (Results 1 – 25 of 65) sorted by relevance

123

/dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/cnf/
H A DcnfCut.c216 if ( pCut->pFanins[i] == pCutFan->pFanins[k] ) in Cnf_CutMergeLeaves()
217 pFanins[nFanins++] = pCut->pFanins[i], i++, k++; in Cnf_CutMergeLeaves()
218 else if ( pCut->pFanins[i] < pCutFan->pFanins[k] ) in Cnf_CutMergeLeaves()
219 pFanins[nFanins++] = pCut->pFanins[i], i++; in Cnf_CutMergeLeaves()
221 pFanins[nFanins++] = pCutFan->pFanins[k], k++; in Cnf_CutMergeLeaves()
224 pFanins[nFanins++] = pCut->pFanins[i]; in Cnf_CutMergeLeaves()
226 pFanins[nFanins++] = pCutFan->pFanins[k]; in Cnf_CutMergeLeaves()
249 if ( pCut->pFanins[i] < pCut1->pFanins[k] ) in Cnf_TruthPhase()
251 assert( pCut->pFanins[i] == pCut1->pFanins[k] ); in Cnf_TruthPhase()
275 pCut->pFanins[i] = pCut->pFanins[i+1]; in Cnf_CutRemoveIthVar()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/sat/cnf/
H A DcnfCut.c201 if ( pCut->pFanins[i] == pCutFan->pFanins[k] ) in Cnf_CutMergeLeaves()
202 pFanins[nFanins++] = pCut->pFanins[i], i++, k++; in Cnf_CutMergeLeaves()
203 else if ( pCut->pFanins[i] < pCutFan->pFanins[k] ) in Cnf_CutMergeLeaves()
204 pFanins[nFanins++] = pCut->pFanins[i], i++; in Cnf_CutMergeLeaves()
206 pFanins[nFanins++] = pCutFan->pFanins[k], k++; in Cnf_CutMergeLeaves()
209 pFanins[nFanins++] = pCut->pFanins[i]; in Cnf_CutMergeLeaves()
211 pFanins[nFanins++] = pCutFan->pFanins[k]; in Cnf_CutMergeLeaves()
234 if ( pCut->pFanins[i] < pCut1->pFanins[k] ) in Cnf_TruthPhase()
236 assert( pCut->pFanins[i] == pCut1->pFanins[k] ); in Cnf_TruthPhase()
260 pCut->pFanins[i] = pCut->pFanins[i+1]; in Cnf_CutRemoveIthVar()
[all …]
H A Dcnf.h77 int pFanins[0]; // the fanins (followed by the truth table) member
102 static inline int * Cnf_CutLeaves( Cnf_Cut_t * pCut ) { return pCut->pFanins; … in Cnf_CutLeaves()
103 …d * Cnf_CutTruth( Cnf_Cut_t * pCut ) { return (unsigned *)(pCut->pFanins + pCut->nFanins);… in Cnf_CutTruth()
122 for ( i = 0; (i < (int)(pCut)->nFanins) && ((pLeaf) = Aig_ManObj(p, (pCut)->pFanins[i])); i++ )
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/csw/
H A DcswCut.c129 if ( pCut->pFanins[i] < pCut1->pFanins[k] ) in Cut_TruthPhase()
198 pCut->pFanins[k++] = pCut->pFanins[i]; in Csw_CutSupportMinimize()
305 pC->pFanins[i] = pC0->pFanins[i]; in Csw_CutMergeOrdered()
321 pC->pFanins[i] = pC0->pFanins[i]; in Csw_CutMergeOrdered()
337 pC->pFanins[c] = pC0->pFanins[i++]; in Csw_CutMergeOrdered()
347 pC->pFanins[c] = pC1->pFanins[k++]; in Csw_CutMergeOrdered()
350 if ( pC0->pFanins[i] < pC1->pFanins[k] ) in Csw_CutMergeOrdered()
352 pC->pFanins[c] = pC0->pFanins[i++]; in Csw_CutMergeOrdered()
355 if ( pC0->pFanins[i] > pC1->pFanins[k] ) in Csw_CutMergeOrdered()
357 pC->pFanins[c] = pC1->pFanins[k++]; in Csw_CutMergeOrdered()
[all …]
H A DcswInt.h66 int pFanins[0]; // the fanins (followed by the truth table) member
103 static inline int * Csw_CutLeaves( Csw_Cut_t * pCut ) { return pCut->pFanins; … in Csw_CutLeaves()
104 …Csw_CutTruth( Csw_Cut_t * pCut ) { return (unsigned *)(pCut->pFanins + pCut->nLeafMax)… in Csw_CutTruth()
132 for ( i = 0; (i < (int)(pCut)->nFanins) && ((pLeaf) = Aig_ManObj(p, (pCut)->pFanins[i])); i++ )
H A DcswTable.c67 uHash ^= pCut->pFanins[i] * s_FPrimes[i]; in Csw_CutHash()
133 if ( memcmp( pEnt->pFanins, pCut->pFanins, sizeof(int) * pCut->nFanins ) ) in Csw_TableCutLookup()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/aig/
H A DaigCuts.c256 if ( pCut->pFanins[i] < pCut1->pFanins[k] ) in Aig_CutTruthPhase()
325 pCut->pFanins[k++] = pCut->pFanins[i]; in Aig_CutSupportMinimize()
432 pC->pFanins[i] = pC0->pFanins[i]; in Aig_CutMergeOrdered()
448 pC->pFanins[i] = pC0->pFanins[i]; in Aig_CutMergeOrdered()
464 pC->pFanins[c] = pC0->pFanins[i++]; in Aig_CutMergeOrdered()
474 pC->pFanins[c] = pC1->pFanins[k++]; in Aig_CutMergeOrdered()
477 if ( pC0->pFanins[i] < pC1->pFanins[k] ) in Aig_CutMergeOrdered()
479 pC->pFanins[c] = pC0->pFanins[i++]; in Aig_CutMergeOrdered()
482 if ( pC0->pFanins[i] > pC1->pFanins[k] ) in Aig_CutMergeOrdered()
484 pC->pFanins[c] = pC1->pFanins[k++]; in Aig_CutMergeOrdered()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/
H A DabcLutmin.c134 Abc_ObjAddFanin( pNode, pFanins[0] ); in Abc_NtkBddMux21()
135 Abc_ObjAddFanin( pNode, pFanins[1] ); in Abc_NtkBddMux21()
136 Abc_ObjAddFanin( pNode, pFanins[2] ); in Abc_NtkBddMux21()
161 Abc_ObjAddFanin( pNode, pFanins[0] ); in Abc_NtkBddMux411()
273 pNodesBot[0] = pFanins[1]; in Abc_NtkBddMux413()
274 pNodesBot[1] = pFanins[2]; in Abc_NtkBddMux413()
275 pNodesBot[2] = pFanins[3]; in Abc_NtkBddMux413()
278 pNodesBot[0] = pFanins[1]; in Abc_NtkBddMux413()
279 pNodesBot[1] = pFanins[4]; in Abc_NtkBddMux413()
280 pNodesBot[2] = pFanins[5]; in Abc_NtkBddMux413()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/acb/
H A DacbPush.c153 int k, iFanin, * pFanins; in Acb_ObjSuppMin_int() local
155 Acb_ObjForEachFaninFast( p, iObj, pFanins, iFanin, k ) in Acb_ObjSuppMin_int()
185 int i, k, * pFanins = Acb_ObjFanins( p, iObj ); in Acb_ObjRemoveDupFanins_int() local
186 for ( i = 0; i < pFanins[0]; i++ ) in Acb_ObjRemoveDupFanins_int()
187 for ( k = i+1; k < pFanins[0]; k++ ) in Acb_ObjRemoveDupFanins_int()
189 if ( pFanins[1+i] != pFanins[1+k] ) in Acb_ObjRemoveDupFanins_int()
267 int k, iFanin, * pFanins; in Acb_ObjFindFaninPushableIndex() local
268 Acb_ObjForEachFaninFast( p, iObj, pFanins, iFanin, k ) in Acb_ObjFindFaninPushableIndex()
275 int k, iFanin, * pFanins; in Acb_ObjFindFanoutPushableIndex() local
276 Acb_ObjForEachFaninFast( p, iObj, pFanins, iFanin, k ) in Acb_ObjFindFanoutPushableIndex()
[all …]
H A Dacb.h376 …for ( k = 0, pFanins = Acb_ObjFanins(p, iObj); k < pFanins[0] && ((iFanin = pFanins[k+1]), 1); k++…
410 int k, iFanin, * pFanins; in Acb_ObjWhatFanin() local
420 assert( pFanins[ 1 + pFanins[0] ] == -1 ); in Acb_ObjAddFanin()
421 pFanins[ 1 + pFanins[0]++ ] = iFanin; in Acb_ObjAddFanin()
426 pFanins[0]--; in Acb_ObjDeleteFaninIndex()
428 pFanins[ 1 + i ] = pFanins[ 2 + i ]; in Acb_ObjDeleteFaninIndex()
429 pFanins[ 1 + pFanins[0] ] = -1; in Acb_ObjDeleteFaninIndex()
448 assert( pFanins[ 1 + pFanins[0] ] == -1 ); in Acb_ObjSetNtkId()
449 pFanins[ 1 + pFanins[0] ] = iNtk; in Acb_ObjSetNtkId()
457 pFanins[i] = -1; in Acb_ObjRemoveFanins()
[all …]
H A DacbMfs.c168 int k, iFanin, * pFanins, Prev, This; in Acb_DeriveCnfForNode() local
171 Acb_ObjForEachFaninFast( p, iObj, pFanins, iFanin, k ) in Acb_DeriveCnfForNode()
199 int i, k, iObj, iObjLit, iFanin, * pFanins, Entry; in Acb_NtkWindow2Cnf() local
466 int k, iFanin, * pFanins; in Acb_NtkDivisors_rec() local
472 Acb_ObjForEachFaninFast( p, iObj, pFanins, iFanin, k ) in Acb_NtkDivisors_rec()
478 int k, iFanin, * pFanins; in Acb_NtkDivisors() local
663 int i, k, Node, iFanin, * pFanins; in Acb_NtkCollectTfoSideInputs() local
689 int i, iFanin, * pFanins; in Acb_NtkCollectNewTfi1_rec() local
700 int i, iFanin, * pFanins; in Acb_NtkCollectNewTfi2_rec() local
750 int i, k, iObj, iFanin, * pFanins; in Acb_NtkCollectWindow() local
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/sat/bmc/
H A DbmcMaj3.c182 pFanins[nFanins++] = f; in Maj3_ManFindFanin()
187 pFanins[nFanins++] = f; in Maj3_ManFindFanin()
206 iVar = pFanins[k]; in Maj3_ManPrintSolution()
889 if ( p->pFanins[i-1][k] != p->pFanins[i][k] ) in Zyx_ManAddCnfLazyTopo()
924 if ( p->pFanins[i-1][k] < p->pFanins[i][k] ) in Zyx_ManAddCnfLazyTopo()
1038 …pPars->nLutSize == 3 && Zyx_ManIsUsed3(p, iMint, i, p->pFanins[i][0], p->pFanins[i][1], p->pFanins… in Zyx_ManAddCnfLazyFunc2()
1071 p->pFanins[i][0] = s; in Zyx_ManAddCnfLazyFunc()
1072 p->pFanins[i][1] = t; in Zyx_ManAddCnfLazyFunc()
1096 p->pFanins[i][0] = s; in Zyx_ManAddCnfLazyFunc()
1097 p->pFanins[i][1] = t; in Zyx_ManAddCnfLazyFunc()
[all …]
H A DbmcMaj.c189 int i, k, iMint; word * pFanins[3]; in Maj_ManEval() local
193 pFanins[k] = Maj_ManTruth( p, Maj_ManFindFanin(p, i, k) ); in Maj_ManEval()
194 Abc_TtMaj( Maj_ManTruth(p, i), pFanins[0], pFanins[1], pFanins[2], p->nWords ); in Maj_ManEval()
542 int i, k, iMint; word * pFanins[2]; in Exa_ManEval() local
553 … Abc_TtAndCompl( Exa_ManTruth(p, p->nObjs), pFanins[0], !(k&1), pFanins[1], !(k>>1), p->nWords ); in Exa_ManEval()
1022 int i, k, j, iMint; word * pFanins[6]; in Exa3_ManEval() local
1260 int pFanins[16]; in Exa3_ManAddCnf2() local
1262 pFanins[j] = Exa3_ManFindFanin(p, i, j); in Exa3_ManAddCnf2()
1264 if ( p->pPars->nLutSize == 2 && Exa3_ManIsUsed2(p, iMint, i, pFanins[1], pFanins[0]) ) in Exa3_ManAddCnf2()
1266 … if ( p->pPars->nLutSize == 3 && Exa3_ManIsUsed3(p, iMint, i, pFanins[2], pFanins[1], pFanins[0]) ) in Exa3_ManAddCnf2()
[all …]
/dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/kit/
H A DkitAig.c94 Aig_Obj_t * Kit_GraphToAig( Aig_Man_t * pMan, Aig_Obj_t ** pFanins, Kit_Graph_t * pGraph ) in Kit_GraphToAig() argument
100 pNode->pFunc = pFanins[i]; in Kit_GraphToAig()
117 Aig_Obj_t * Kit_TruthToAig( Aig_Man_t * pMan, Aig_Obj_t ** pFanins, unsigned * pTruth, int nVars, V…
131 pObj = Kit_GraphToAig( pMan, pFanins, pGraph );
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/kit/
H A DkitAig.c79 Aig_Obj_t * Kit_GraphToAig( Aig_Man_t * pMan, Aig_Obj_t ** pFanins, Kit_Graph_t * pGraph ) in Kit_GraphToAig() argument
85 pNode->pFunc = pFanins[i]; in Kit_GraphToAig()
101 Aig_Obj_t * Kit_TruthToAig( Aig_Man_t * pMan, Aig_Obj_t ** pFanins, unsigned * pTruth, int nVars, V… in Kit_TruthToAig() argument
115 pObj = Kit_GraphToAig( pMan, pFanins, pGraph ); in Kit_TruthToAig()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/lpk/
H A DlpkAbcUtil.c96 p->pFanins[i] = i; in Lpk_FunCreate()
126 memcpy( pNew->pFanins, p->pFanins, 16 ); in Lpk_FunDup()
158 p->pFanins[k] = p->pFanins[i]; in Lpk_FunSuppMinimize()
/dports/math/stp/stp-2.3.3/lib/extlib-abc/
H A Dcnf_short.h90 int pFanins[0]; // the fanins (followed by the truth table) member
115 static inline int * Cnf_CutLeaves( Cnf_Cut_t * pCut ) { return pCut->pFanins; … in Cnf_CutLeaves()
116 …d * Cnf_CutTruth( Cnf_Cut_t * pCut ) { return (unsigned *)(pCut->pFanins + pCut->nFanins);… in Cnf_CutTruth()
131 for ( i = 0; (i < (int)(pCut)->nFanins) && ((pLeaf) = Aig_ManObj(p, (pCut)->pFanins[i])); i++ )
H A Dcnf.h90 int pFanins[0]; // the fanins (followed by the truth table) member
115 static inline int * Cnf_CutLeaves( Cnf_Cut_t * pCut ) { return pCut->pFanins; … in Cnf_CutLeaves()
116 …d * Cnf_CutTruth( Cnf_Cut_t * pCut ) { return (unsigned *)(pCut->pFanins + pCut->nFanins);… in Cnf_CutTruth()
131 for ( i = 0; (i < (int)(pCut)->nFanins) && ((pLeaf) = Aig_ManObj(p, (pCut)->pFanins[i])); i++ )
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/acec/
H A DacecOrder.c216 int * pFanins = Vec_IntEntryP( vFadds, 5*Node ); in Gia_PolynReorder() local
218 Gia_ManCollectAnds_rec( pGia, pFanins[k], vOrder ); in Gia_PolynReorder()
222 int * pFanins = Vec_IntEntryP( vHadds, 2*Node ); in Gia_PolynReorder() local
224 Gia_ManCollectAnds_rec( pGia, pFanins[k], vOrder ); in Gia_PolynReorder()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/sfm/
H A DsfmLib.c537 void Sfm_LibPrintGate( Mio_Cell2_t * pCell, char * pFanins, Mio_Cell2_t * pCell2, char * pFanins2 ) in Sfm_LibPrintGate() argument
542 if ( pFanins[k] == (char)16 ) in Sfm_LibPrintGate()
545 printf( " %c", 'a' + pFanins[k] ); in Sfm_LibPrintGate()
625 int Sfm_LibFindDelayMatches( Sfm_Lib_t * p, word * pTruth, int * pFanins, int nFanins, Vec_Ptr_t * … in Sfm_LibFindDelayMatches() argument
679 int Sfm_LibImplementSimple( Sfm_Lib_t * p, word * pTruth, int * pFanins, int nFanins, Vec_Int_t * v… in Sfm_LibImplementSimple() argument
698 Vec_IntPush( vLevel, pFanins[0] ); in Sfm_LibImplementSimple()
704 int Sfm_LibImplementGatesArea( Sfm_Lib_t * p, int * pFanins, int nFanins, int iObj, Vec_Int_t * vGa… in Sfm_LibImplementGatesArea() argument
721 Vec_IntPush( vLevel, pFanins[(int)pObjMin->pFansB[i+1]] ); in Sfm_LibImplementGatesArea()
733 Vec_IntPush( vLevel, pFanins[(int)pObjMin->pFansT[i+1]] ); in Sfm_LibImplementGatesArea()
745 Vec_IntPush( vLevel, pFanins[(int)pFansB[i]] ); in Sfm_LibImplementGatesDelay()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/mapper/
H A DmapperTree.c107 pGate->pFanins[i] = pLib->ppSupers[Num]; in Map_LibraryReadGateTree()
605 pFanin = pGate->pFanins[k]; in Map_LibraryDeriveGateInfo()
617 pFanin = pGate->pFanins[k]; in Map_LibraryDeriveGateInfo()
642 Map_LibraryAddFaninDelays( pLib, pGate, pGate->pFanins[k], pPin ); in Map_LibraryDeriveGateInfo()
674 pGate->nGates += pGate->pFanins[k]->nGates; in Map_LibraryDeriveGateInfo()
675 pGate->Area += pGate->pFanins[k]->Area; in Map_LibraryDeriveGateInfo()
733 VarCur = Map_LibraryGetMaxSuperPi_rec( pGate->pFanins[i] ); in Map_LibraryGetMaxSuperPi_rec()
759 uSupport |= Map_LibraryGetGateSupp_rec( pGate->pFanins[i] ); in Map_LibraryGetGateSupp_rec()
995 printf( " %6d", pGate->pFanins[k]->Num ); in Map_LibraryPrintTree()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/dau/
H A DdauGia.c54 int Dau_DsdToGiaCompose_rec( Gia_Man_t * pGia, word Func, int * pFanins, int nVars ) in Dau_DsdToGiaCompose_rec() argument
65 return Abc_LitNotCond( pFanins[0], (int)(Func == s_Truths6Neg[0]) ); in Dau_DsdToGiaCompose_rec()
68 return Dau_DsdToGiaCompose_rec( pGia, Func, pFanins, nVars ); in Dau_DsdToGiaCompose_rec()
69 t0 = Dau_DsdToGiaCompose_rec( pGia, Abc_Tt6Cofactor0(Func, nVars), pFanins, nVars ); in Dau_DsdToGiaCompose_rec()
70 t1 = Dau_DsdToGiaCompose_rec( pGia, Abc_Tt6Cofactor1(Func, nVars), pFanins, nVars ); in Dau_DsdToGiaCompose_rec()
72 return Gia_ManHashMuxReal( pGia, pFanins[nVars], t1, t0 ); in Dau_DsdToGiaCompose_rec()
74 return Gia_ManHashMux( pGia, pFanins[nVars], t1, t0 ); in Dau_DsdToGiaCompose_rec()
H A DdauDsd.c334 word Dau_Dsd6TruthCompose_rec( word Func, word * pFanins, int nVars ) in Dau_Dsd6TruthCompose_rec() argument
345 return (Func == s_Truths6[0]) ? pFanins[0] : ~pFanins[0]; in Dau_Dsd6TruthCompose_rec()
348 return Dau_Dsd6TruthCompose_rec( Func, pFanins, nVars ); in Dau_Dsd6TruthCompose_rec()
351 return (~pFanins[nVars] & t0) | (pFanins[nVars] & t1); in Dau_Dsd6TruthCompose_rec()
485 Abc_TtCopy( pRes, pFanins[0], nWordsR, Func == s_Truths6Neg[0] ); in Dau_DsdTruth6Compose_rec()
490 Dau_DsdTruth6Compose_rec( Func, pFanins, pRes, nVars, nWordsR ); in Dau_DsdTruth6Compose_rec()
497 Abc_TtMux( pRes, pFanins[nVars], pTtTemp[1], pTtTemp[0], nWordsR ); in Dau_DsdTruth6Compose_rec()
523 Dau_DsdTruthCompose_rec( pFunc, pFanins, pRes, nVars-1, nWordsR ); in Dau_DsdTruthCompose_rec()
531 Abc_TtMux( pRes, pFanins[nVars], pTtTemp[1], pTtTemp[0], nWordsR ); in Dau_DsdTruthCompose_rec()
593 word pFanins[DAU_MAX_VAR][DAU_MAX_WORD], pFunc[DAU_MAX_WORD]; in Dau_DsdToTruth_rec() local
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/wln/
H A DwlnRetime.c177 int * pFanins = Wln_RetFanins( p, iObj ); in Wln_RetAlloc() local
180 pFanins[2*k+0] = iFanin; in Wln_RetAlloc()
181 pFanins[2*k+1] = Wln_ObjIsFf(pNtk, iFanin) ? Vec_IntSize(&p->vEdgeLinks) : 0; in Wln_RetAlloc()
427 int * pFanins = Wln_RetFanins( p, iObj ); in Wln_RetRemoveOneFanin() local
434 pFanins[2*k+1] = Vec_IntEntry( &p->vEdgeLinks, pLink[0] ); in Wln_RetRemoveOneFanin()
460 int * pFanins = Wln_RetFanins( p, iObj ); in Wln_RetInsertOneFanin() local
466 iHead = pFanins[2*k+1]; in Wln_RetInsertOneFanin()
467 pFanins[2*k+1] = Vec_IntSize(&p->vEdgeLinks); in Wln_RetInsertOneFanin()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/
H A DgiaStr.c119 Vec_IntPush( &p->vFanins, pFanins[i] ); in Str_ObjCreate()
120 assert( pFanins[i] >= 0 ); in Str_ObjCreate()
650 int pFanins[3]; in Str_ManNormalize_rec() local
656 pFanins[0] = Gia_ObjFanin0Copy(pObj); in Str_ManNormalize_rec()
657 pFanins[1] = Gia_ObjFanin1Copy(pObj); in Str_ManNormalize_rec()
659 if ( Abc_LitIsCompl(pFanins[2]) ) in Str_ManNormalize_rec()
661 pFanins[2] = Abc_LitNot(pFanins[2]); in Str_ManNormalize_rec()
662 ABC_SWAP( int, pFanins[0], pFanins[1] ); in Str_ManNormalize_rec()
688 if ( Abc_LitIsCompl(pFanins[2]) ) in Str_ManNormalize_rec()
690 pFanins[2] = Abc_LitNot(pFanins[2]); in Str_ManNormalize_rec()
[all …]

123