Home
last modified time | relevance | path

Searched refs:pCuts0 (Results 1 – 7 of 7) sorted by relevance

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/
H A DgiaKf.c86 Kf_Cut_t pCuts0[KF_CUT_MAX];
162 static inline void Kf_SetPrepare( Kf_Set_t * p, int * pCuts0, int * pCuts1 )
172 p->nCuts0 = Kf_SetLoadCuts( p->pCuts0, pCuts0 );
508 Kf_SetPrepare( p, pCuts0, pCuts1 );
514 if ( p->pCuts0[c0].nLeaves >= p->pCuts1[c1].nLeaves )
515 Kf_SetMergePairs( p, p->pCuts0 + c0++, p->pCuts1 + c1, p->nCuts1 - c1, fArea );
517 Kf_SetMergePairs( p, p->pCuts1 + c1++, p->pCuts0 + c0, p->nCuts0 - c0, fArea );
611 Kf_SetPrepare( p, pCuts0, pCuts1 );
613 for ( pCut0 = p->pCuts0; pCut0 < p->pCuts0 + p->nCuts0; pCut0++ )
791 Kf_SetPrepare( p, pCuts0, pCuts1 );
[all …]
H A DgiaPf.c779 Pf_Cut_t pCuts0[PF_CUT_MAX], pCuts1[PF_CUT_MAX], pCuts[PF_CUT_MAX], * pCutsR[PF_CUT_MAX]; in Pf_ObjMergeOrder() local
784 int nCuts0 = Pf_ManPrepareCuts(pCuts0, p, Gia_ObjFaninId0(pObj, iObj), 1); in Pf_ObjMergeOrder()
789 Pf_Cut_t * pCut0, * pCut1, * pCut0Lim = pCuts0 + nCuts0, * pCut1Lim = pCuts1 + nCuts1; in Pf_ObjMergeOrder()
816 for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ ) in Pf_ObjMergeOrder()
838 for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ ) in Pf_ObjMergeOrder()
H A DgiaJf.c1136 int * pCut0, * pCut1, * pCuts0, * pCuts1; in Jf_ObjComputeCuts() local
1142 pCuts0 = Jf_ObjCuts( p, Gia_ObjFaninId0(pObj, iObj) ); in Jf_ObjComputeCuts()
1143 Jf_ObjForEachCut( pCuts0, pCut0, i ) in Jf_ObjComputeCuts()
1150 p->CutCount[0] += pCuts0[0] * pCuts1[0]; in Jf_ObjComputeCuts()
1151 Jf_ObjForEachCut( pCuts0, pCut0, i ) in Jf_ObjComputeCuts()
H A DgiaOf.c686 Of_Cut_t pCuts0[OF_CUT_MAX], pCuts1[OF_CUT_MAX], pCuts[OF_CUT_MAX], * pCutsR[OF_CUT_MAX]; in Of_ObjMergeOrder() local
691 int nCuts0 = Of_ManPrepareCuts(pCuts0, p, Gia_ObjFaninId0(pObj, iObj), 1); in Of_ObjMergeOrder()
696 Of_Cut_t * pCut0, * pCut1, * pCut0Lim = pCuts0 + nCuts0, * pCut1Lim = pCuts1 + nCuts1; in Of_ObjMergeOrder()
724 for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ ) in Of_ObjMergeOrder()
746 for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ ) in Of_ObjMergeOrder()
H A DgiaMf.c1025 Mf_Cut_t pCuts0[MF_CUT_MAX], pCuts1[MF_CUT_MAX], pCuts[MF_CUT_MAX], * pCutsR[MF_CUT_MAX]; in Mf_ObjMergeOrder() local
1030 int nCuts0 = Mf_ManPrepareCuts(pCuts0, p, Gia_ObjFaninId0(pObj, iObj), 1); in Mf_ObjMergeOrder()
1035 Mf_Cut_t * pCut0, * pCut1, * pCut0Lim = pCuts0 + nCuts0, * pCut1Lim = pCuts1 + nCuts1; in Mf_ObjMergeOrder()
1062 for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ ) in Mf_ObjMergeOrder()
1084 for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ ) in Mf_ObjMergeOrder()
H A DgiaNf.c857 Nf_Cut_t pCuts0[NF_CUT_MAX], pCuts1[NF_CUT_MAX], pCuts[NF_CUT_MAX], * pCutsR[NF_CUT_MAX]; in Nf_ObjMergeOrder() local
863 int nCuts0 = Nf_ManPrepareCuts(pCuts0, p, Gia_ObjFaninId0(pObj, iObj), 1); in Nf_ObjMergeOrder()
868 Nf_Cut_t * pCut0, * pCut1, * pCut0Lim = pCuts0 + nCuts0, * pCut1Lim = pCuts1 + nCuts1; in Nf_ObjMergeOrder()
895 for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ ) in Nf_ObjMergeOrder()
917 for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ ) in Nf_ObjMergeOrder()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/acec/
H A DacecFadds.c371 int * pCuts0 = Vec_IntArray(vCutsXor); in Dtc_ManFindCommonCuts() local
378 while ( pCuts0 < pLimit0 && pCuts1 < pLimit1 ) in Dtc_ManFindCommonCuts()
381 if ( pCuts0[i] != pCuts1[i] ) in Dtc_ManFindCommonCuts()
386 Vec_IntPush( vFadds, pCuts0[i] ); in Dtc_ManFindCommonCuts()
388 pCuts0 += 4; in Dtc_ManFindCommonCuts()
391 else if ( pCuts0[i] < pCuts1[i] ) in Dtc_ManFindCommonCuts()
392 pCuts0 += 4; in Dtc_ManFindCommonCuts()
393 else if ( pCuts0[i] > pCuts1[i] ) in Dtc_ManFindCommonCuts()