47 if ( Node >=
p->vCutsNew->nSize )
49 return (
Cut_Cut_t *)Vec_PtrEntry(
p->vCutsNew, Node );
65 assert( Node < p->vCutsOld->nSize );
66 return (
Cut_Cut_t *)Vec_PtrEntry(
p->vCutsOld, Node );
82 assert( Node < p->vCutsTemp->nSize );
83 return (
Cut_Cut_t *)Vec_PtrEntry(
p->vCutsTemp, Node );
99 Vec_PtrWriteEntry(
p->vCutsNew, Node, pList );
115 Vec_PtrWriteEntry(
p->vCutsOld, Node, pList );
131 Vec_PtrWriteEntry(
p->vCutsTemp, Node, pList );
166 nFanouts = Vec_IntEntry(
p->vFanCounts, Node );
168 if ( --nFanouts == 0 )
170 Vec_IntWriteEntry(
p->vFanCounts, Node, nFanouts );
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
void Cut_NodeTryDroppingCuts(Cut_Man_t *p, int Node)
Cut_Cut_t * Cut_NodeReadCutsOld(Cut_Man_t *p, int Node)
void Cut_NodeSetTriv(Cut_Man_t *p, int Node)
void Cut_NodeWriteCutsTemp(Cut_Man_t *p, int Node, Cut_Cut_t *pList)
void Cut_NodeWriteCutsOld(Cut_Man_t *p, int Node, Cut_Cut_t *pList)
void Cut_NodeWriteCutsNew(Cut_Man_t *p, int Node, Cut_Cut_t *pList)
ABC_NAMESPACE_IMPL_START Cut_Cut_t * Cut_NodeReadCutsNew(Cut_Man_t *p, int Node)
DECLARATIONS ///.
void Cut_NodeFreeCuts(Cut_Man_t *p, int Node)
Cut_Cut_t * Cut_NodeReadCutsTemp(Cut_Man_t *p, int Node)
Cut_Cut_t * Cut_CutCreateTriv(Cut_Man_t *p, int Node)
void Cut_CutRecycle(Cut_Man_t *p, Cut_Cut_t *pCut)
#define Cut_ListForEachCutSafe(pList, pCut, pCut2)
struct Cut_ManStruct_t_ Cut_Man_t
BASIC TYPES ///.
struct Cut_CutStruct_t_ Cut_Cut_t