Searched refs:nVisits (Results 1 – 9 of 9) sorted by relevance
49 $nVisits = 0;68 $nVisits = $row->visits;70 if ($nVisits == 0) {
148 pObj->nVisits = pObj->nVisitsCopy;189 pObj->nVisits = pObj->nVisitsCopy;327 if ( pObj->nVisits == 0 ) in If_ManCrossCut()331 if ( !If_ObjIsCi(pFanin) && --pFanin->nVisits == 0 ) in If_ManCrossCut()334 if ( !If_ObjIsCi(pFanin) && --pFanin->nVisits == 0 ) in If_ManCrossCut()339 if ( !If_ObjIsCi(pFanin) && --pFanin->nVisits == 0 ) in If_ManCrossCut()345 pObj->nVisits = pObj->nVisitsCopy; in If_ManCrossCut()441 pObj->nVisits = pObj->nVisitsCopy; in If_ManMarkMapping()
399 pObj->pFanin0 = pFan0; pFan0->nRefs++; pFan0->nVisits++; pFan0->nVisitsCopy++; in If_ManCreateAnd()400 pObj->pFanin1 = pFan1; pFan1->nRefs++; pFan1->nVisits++; pFan1->nVisitsCopy++; in If_ManCreateAnd()468 pTemp->nVisits++; pTemp->nVisitsCopy++; in If_ManCreateChoice()623 assert( pObj->nVisits >= 0 ); in If_ManDerefNodeCutSet()624 if ( pObj->nVisits == 0 ) in If_ManDerefNodeCutSet()632 assert( pFanin->nVisits > 0 ); in If_ManDerefNodeCutSet()633 if ( !If_ObjIsCi(pFanin) && --pFanin->nVisits == 0 ) in If_ManDerefNodeCutSet()641 assert( pFanin->nVisits > 0 ); in If_ManDerefNodeCutSet()642 if ( !If_ObjIsCi(pFanin) && --pFanin->nVisits == 0 ) in If_ManDerefNodeCutSet()666 assert( pObj->nVisits > 0 ); in If_ManDerefChoiceCutSet()[all …]
162 assert( pObj->nVisits == 0 ); in If_ManPerformMappingRoundSeq()163 pObj->nVisits = pObj->nVisitsCopy; in If_ManPerformMappingRoundSeq()
610 assert( pObj->nVisits == pObj->nVisitsCopy ); in If_ManPerformMappingRound()658 assert( pObj->nVisits == 0 ); in If_ManPerformMappingRound()
337 int nVisits; // the number of visits to this node member
133 assert( pNode->nVisits > 0 ); in Dsd_TreeUnmark_rec()135 if ( --pNode->nVisits ) // if this is not the last visit, return in Dsd_TreeUnmark_rec()219 assert( pNode->nVisits >= 0 ); in Dsd_TreeGetInfo_rec()261 assert( pNode->nVisits >= 0 ); in Dsd_TreeGetAigCost_rec()361 assert( pNode->nVisits >= 0 ); in Dsd_TreeCountNonTerminalNodes_rec()363 if ( pNode->nVisits++ ) // if this is not the first visit, return zero in Dsd_TreeCountNonTerminalNodes_rec()440 assert( pNode->nVisits >= 0 ); in Dsd_TreeCountPrimeNodes_rec()442 if ( pNode->nVisits++ ) // if this is not the first visit, return zero in Dsd_TreeCountPrimeNodes_rec()616 assert( pNode->nVisits >= 0 ); in Dsd_TreeCollectNodesDfs_rec()618 if ( pNode->nVisits++ ) // if this is not the first visit, return zero in Dsd_TreeCollectNodesDfs_rec()
62 short nVisits; // the counter of visits member
48 unsigned nVisits : 27; member225 (*ppSpot)->nVisits++; in Aig_RManTableFindOrAdd()234 pEntry->nVisits = 1; in Aig_RManTableFindOrAdd()