/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/ret/ |
H A D | retDelay.c | 176 int i, k, LevelCur, LevelMax = 0; in Abc_NtkRetimeTiming() local 216 if ( LevelMax < LevelCur ) in Abc_NtkRetimeTiming() 217 LevelMax = LevelCur; in Abc_NtkRetimeTiming() 222 if ( LevelMax < LevelCur ) in Abc_NtkRetimeTiming() 223 LevelMax = LevelCur; in Abc_NtkRetimeTiming() 262 return LevelMax; in Abc_NtkRetimeTiming() 280 int i, LevelCur, LevelMax = 0; in Abc_NtkRetimeTiming_rec() local 291 if ( LevelMax < LevelCur ) in Abc_NtkRetimeTiming_rec() 292 LevelMax = LevelCur; in Abc_NtkRetimeTiming_rec() 301 LevelMax = LevelCur; in Abc_NtkRetimeTiming_rec() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/nwk/ |
H A D | nwkDfs.c | 106 int i, k, LevelMax, Level; in Nwk_ManLevelBackup() local 112 LevelMax = 0; in Nwk_ManLevelBackup() 146 return LevelMax; in Nwk_ManLevelBackup() 184 LevelMax++; in Nwk_ManLevel_rec() 197 LevelMax++; in Nwk_ManLevel_rec() 201 Nwk_ObjSetLevel( pObj, LevelMax ); in Nwk_ManLevel_rec() 218 int i, LevelMax = 0; in Nwk_ManLevel() local 226 LevelMax = Nwk_ObjLevel(pObj); in Nwk_ManLevel() 234 return LevelMax; in Nwk_ManLevel() 251 int i, LevelMax = 0; in Nwk_ManLevelMax() local [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/ |
H A D | giaBalMap.c | 203 LevelMax = (int)((1.0 - 0.01 * nTimeWindow) * nLevels); in Gia_ManFindLatest() 204 if ( nLevels < LevelMax ) in Gia_ManFindLatest() 207 if ( pLevels[Gia_ObjFaninId0p(p, pObj)] >= LevelMax ) in Gia_ManFindLatest() 216 if ( nLevels < LevelMax ) in Gia_ManFindLatest() 219 if ( Gia_ObjLevel(p, pObj) >= LevelMax ) in Gia_ManFindLatest() 240 assert( !LevelMax != !nTimeWindow ); in Gia_ManExtractWindow() 241 vOuts = Gia_ManFindLatest( p, LevelMax, nTimeWindow ); in Gia_ManExtractWindow() 269 assert( !LevelMax != !nTimeWindow ); in Gia_ManPerformSopBalanceWin() 270 vOuts = Gia_ManFindLatest( p, LevelMax, nTimeWindow ); in Gia_ManPerformSopBalanceWin() 302 assert( !LevelMax != !nTimeWindow ); in Gia_ManPerformDsdBalanceWin() [all …]
|
H A D | giaShow.c | 103 LevelMax = 1 + nLevels; in Gia_ShowPath() 128 for ( Level = LevelMax; Level >= 0; Level-- ) in Gia_ShowPath() 141 for ( Level = LevelMax; Level >= 0; Level-- ) in Gia_ShowPath() 194 fprintf( pFile, " Level%d;\n", LevelMax ); in Gia_ShowPath() 343 int LevelMax, Prev, Level, i; in Gia_WriteDotAigSimple() local 367 LevelMax = 1 + Gia_ManLevelNum( p ); in Gia_WriteDotAigSimple() 392 for ( Level = LevelMax; Level >= 0; Level-- ) in Gia_WriteDotAigSimple() 405 for ( Level = LevelMax; Level >= 0; Level-- ) in Gia_WriteDotAigSimple() 458 fprintf( pFile, " Level%d;\n", LevelMax ); in Gia_WriteDotAigSimple() 679 int LevelMax, Prev, Level, i; in Gia_WriteDotAig() local [all …]
|
H A D | giaIf.c | 479 LevelMax = Abc_MaxInt( LevelMax, pLevels[i] ); in Gia_ManPrintMappingStats() 490 LevelMax = Abc_MaxInt( LevelMax, pLevels[i] ); in Gia_ManPrintMappingStats() 507 Abc_Print( 1, "lev =%5d ", LevelMax ); in Gia_ManPrintMappingStats() 673 int i, iBox, iTerm1, nTerms, LevelMax = 0; in Gia_ManChoiceLevel_rec() local 693 LevelMax++; in Gia_ManChoiceLevel_rec() 716 LevelMax++; in Gia_ManChoiceLevel_rec() 728 Gia_ObjSetLevel( p, pObj, LevelMax ); in Gia_ManChoiceLevel_rec() 733 int i, LevelMax = 0; in Gia_ManChoiceLevel() local 741 LevelMax = Gia_ObjLevel(p, pObj); in Gia_ManChoiceLevel() 748 LevelMax = Gia_ObjLevel(p, pObj); in Gia_ManChoiceLevel() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/io/ |
H A D | ioWriteDot.c | 118 LevelMax = Abc_NtkLevel( pNtk ); in Io_WriteDotNtk() 122 assert( LevelMax == LevelMin ); in Io_WriteDotNtk() 130 LevelMax = -1; in Io_WriteDotNtk() 142 LevelMax = pNode->Level; in Io_WriteDotNtk() 148 LevelMax++; in Io_WriteDotNtk() 152 pNode->Level = LevelMax; in Io_WriteDotNtk() 481 LevelMax = Abc_NtkLevel( pNtk ); in Io_WriteDotSeq() 485 assert( LevelMax == LevelMin ); in Io_WriteDotSeq() 493 LevelMax = -1; in Io_WriteDotSeq() 505 LevelMax = pNode->Level; in Io_WriteDotSeq() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/ivy/ |
H A D | ivyDfs.c | 255 int i, k, Level, LevelMax; in Ivy_ManRequiredLevels() local 271 LevelMax = Ivy_ManLevels( p ); in Ivy_ManRequiredLevels() 432 unsigned LevelMax = pObj->Level; in Ivy_ManSetLevels_rec() local 436 LevelMax = IVY_MAX( LevelMax, pTemp->Level ); in Ivy_ManSetLevels_rec() 439 pObj->Level = LevelMax; in Ivy_ManSetLevels_rec() 441 pTemp->Level = LevelMax; in Ivy_ManSetLevels_rec() 460 int i, LevelMax; in Ivy_ManSetLevels() local 472 LevelMax = 0; in Ivy_ManSetLevels() 476 LevelMax = IVY_MAX( LevelMax, (int)Ivy_ObjFanin0(pObj)->Level ); in Ivy_ManSetLevels() 483 LevelMax = IVY_MAX( LevelMax, (int)pObj->Level ); in Ivy_ManSetLevels() [all …]
|
H A D | ivyShow.c | 85 int LevelMax, Level, i; in Ivy_WriteDotAig() local 104 LevelMax = 1 + Ivy_ManSetLevels( pMan, fHaig ); in Ivy_WriteDotAig() 127 for ( Level = LevelMax; Level >= 0; Level-- ) in Ivy_WriteDotAig() 140 for ( Level = LevelMax; Level >= 0; Level-- ) in Ivy_WriteDotAig() 181 …f( pFile, "The set contains %d logic nodes and spans %d levels.", Ivy_ManNodeNum(pMan), LevelMax ); in Ivy_WriteDotAig() 193 fprintf( pFile, " Level%d;\n", LevelMax ); in Ivy_WriteDotAig() 213 for ( Level = LevelMax - 1; Level > 0; Level-- ) in Ivy_WriteDotAig()
|
H A D | ivyRwr.c | 35 Vec_Ptr_t * vFaninsCur, int nNodesSaved, int LevelMax, int * pGainBest, unsigned uTruth ); 37 …oNetworkCount( Ivy_Man_t * p, Ivy_Obj_t * pRoot, Dec_Graph_t * pGraph, int NodeMax, int LevelMax ); 361 …_t * p, Ivy_Obj_t * pRoot, Vec_Ptr_t * vFaninsCur, int nNodesSaved, int LevelMax, int * pGainBest,… in Rwt_CutEvaluate() argument 381 nNodesAdded = Ivy_GraphToNetworkCount( pMan, pRoot, pGraphCur, nNodesSaved, LevelMax ); in Rwt_CutEvaluate() 413 …ToNetworkCount( Ivy_Man_t * p, Ivy_Obj_t * pRoot, Dec_Graph_t * pGraph, int NodeMax, int LevelMax ) in Ivy_GraphToNetworkCount() argument 465 if ( LevelNew > LevelMax ) in Ivy_GraphToNetworkCount()
|
/dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/aig/ |
H A D | aigShow.c | 65 int LevelMax, Level, i; in Aig_WriteDotAig() local 85 LevelMax = 1 + Aig_ManLevels( pMan ); in Aig_WriteDotAig() 87 pNode->Level = LevelMax; in Aig_WriteDotAig() 110 for ( Level = LevelMax; Level >= 0; Level-- ) in Aig_WriteDotAig() 123 for ( Level = LevelMax; Level >= 0; Level-- ) in Aig_WriteDotAig() 164 …f( pFile, "The set contains %d logic nodes and spans %d levels.", Aig_ManNodeNum(pMan), LevelMax ); in Aig_WriteDotAig() 176 fprintf( pFile, " Level%d;\n", LevelMax ); in Aig_WriteDotAig() 200 for ( Level = LevelMax - 1; Level > 0; Level-- ) in Aig_WriteDotAig()
|
H A D | aigMffc.c | 269 int i, LevelMax, ConeSize1, ConeSize2, ConeCur1, ConeCur2, ConeBest; in Aig_NodeMffsExtendCut() local 271 LevelMax = 0; in Aig_NodeMffsExtendCut() 273 LevelMax = AIG_MAX( LevelMax, (int)pObj->Level ); in Aig_NodeMffsExtendCut() 274 if ( LevelMax == 0 ) in Aig_NodeMffsExtendCut() 283 if ( (int)pObj->Level != LevelMax ) in Aig_NodeMffsExtendCut()
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/aig/ |
H A D | aigShow.c | 51 int LevelMax, Prev, Level, i; in Aig_WriteDotAig() local 71 LevelMax = 1 + Aig_ManLevels( pMan ); in Aig_WriteDotAig() 73 pNode->Level = LevelMax; in Aig_WriteDotAig() 96 for ( Level = LevelMax; Level >= 0; Level-- ) in Aig_WriteDotAig() 109 for ( Level = LevelMax; Level >= 0; Level-- ) in Aig_WriteDotAig() 150 …f( pFile, "The set contains %d logic nodes and spans %d levels.", Aig_ManNodeNum(pMan), LevelMax ); in Aig_WriteDotAig() 162 fprintf( pFile, " Level%d;\n", LevelMax ); in Aig_WriteDotAig() 186 for ( Level = LevelMax - 1; Level > 0; Level-- ) in Aig_WriteDotAig()
|
H A D | aigDfs.c | 546 LevelMax++; in Aig_ManChoiceLevel_rec() 556 LevelMax = Aig_ObjLevel(pNext); in Aig_ManChoiceLevel_rec() 564 LevelMax = Aig_ObjLevel(pNext); in Aig_ManChoiceLevel_rec() 568 LevelMax = Aig_ObjLevel(pNext); in Aig_ManChoiceLevel_rec() 569 LevelMax++; in Aig_ManChoiceLevel_rec() 581 Aig_ObjSetLevel( pObj, LevelMax ); in Aig_ManChoiceLevel_rec() 598 int i, LevelMax = 0; in Aig_ManChoiceLevel() local 606 if ( LevelMax < Aig_ObjLevel(pObj) ) in Aig_ManChoiceLevel() 607 LevelMax = Aig_ObjLevel(pObj); in Aig_ManChoiceLevel() 614 LevelMax = Aig_ObjLevel(pObj); in Aig_ManChoiceLevel() [all …]
|
H A D | aigMffc.c | 268 int i, LevelMax, ConeSize1, ConeSize2, ConeCur1, ConeCur2, ConeBest; in Aig_NodeMffcExtendCut() local 270 LevelMax = 0; in Aig_NodeMffcExtendCut() 272 LevelMax = Abc_MaxInt( LevelMax, (int)pObj->Level ); in Aig_NodeMffcExtendCut() 273 if ( LevelMax == 0 ) in Aig_NodeMffcExtendCut() 282 if ( (int)pObj->Level != LevelMax ) in Aig_NodeMffcExtendCut()
|
/dports/math/vtk9/VTK-9.1.0/Filters/Hybrid/ |
H A D | vtkAdaptiveDataSetSurfaceFilter.cxx | 57 this->LevelMax = -1; in vtkAdaptiveDataSetSurfaceFilter() 137 os << indent << "LevelMax: " << this->LevelMax << endl; in PrintSelf() 270 this->LevelMax = 65536; in DataObjectExecute() 274 this->LevelMax -= this->DynamicDecimateLevelMax; in DataObjectExecute() 275 if (this->LevelMax < 0) in DataObjectExecute() 277 this->LevelMax = 0; in DataObjectExecute() 284 this->LevelMax = this->FixedLevelMax; in DataObjectExecute() 310 std::cerr << "LevelMax " << this->LevelMax << std::endl; in DataObjectExecute() 325 this->LevelMax = -1; in DataObjectExecute() 461 bool insideBB = (this->LevelMax == -1); in RecursivelyProcessTreeNot3D() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/wlc/ |
H A D | wlcShow.c | 50 int LevelMax, Prev, Level, i; in Wlc_NtkDumpDot() local 69 LevelMax = 1 + Wlc_NtkCreateLevels( p ); in Wlc_NtkDumpDot() 71 LevelMax = Wlc_NtkRemapLevels( p, vBold, LevelMax ); in Wlc_NtkDumpDot() 98 for ( Level = LevelMax; Level >= 0; Level-- ) in Wlc_NtkDumpDot() 111 for ( Level = LevelMax; Level >= 0; Level-- ) in Wlc_NtkDumpDot() 152 …el network contains %d nodes and spans %d levels.", Wlc_NtkObjNum(p)-Wlc_NtkCiNum(p), LevelMax-1 ); in Wlc_NtkDumpDot() 164 fprintf( pFile, " Level%d;\n", LevelMax ); in Wlc_NtkDumpDot() 181 for ( Level = LevelMax - 1; Level > 0; Level-- ) in Wlc_NtkDumpDot()
|
/dports/math/vtk8/VTK-8.2.0/Filters/Hybrid/ |
H A D | vtkAdaptiveDataSetSurfaceFilter.cxx | 51 this->LevelMax = -1; in vtkAdaptiveDataSetSurfaceFilter() 117 os << indent << "LevelMax: " << this->LevelMax << endl; in PrintSelf() 219 this->LevelMax = ( log( windowSize ) + log( zoom / this->Scale ) ) / log( f ) + 1; in DataSetExecute() 220 if ( this->LevelMax < 0 ) in DataSetExecute() 222 this->LevelMax = 0; in DataSetExecute() 230 this->LevelMax = -1; in DataSetExecute() 342 bool insideBB = ( this->LevelMax == -1 ); in RecursivelyProcessTree() 356 if ( cursor->IsLeaf() || ( this->LevelMax != -1 && level >= this->LevelMax ) ) in RecursivelyProcessTree()
|
/dports/games/rnd_jue/rnd_jue-3.3.0.0/src/game_sp/ |
H A D | Globals.c | 16 int FieldMax, LevelMax; variable 174 LevelMax = (FieldWidth * FieldHeight) - 1; in InitGlobals() 184 AnimationPosTable = REDIM_1D(sizeof(int), 0, LevelMax); in InitGlobals() 185 AnimationSubTable = REDIM_1D(sizeof(byte), 0, LevelMax); in InitGlobals()
|
/dports/games/rocksndiamonds/rnd_jue-3.3.0.0/src/game_sp/ |
H A D | Globals.c | 16 int FieldMax, LevelMax; variable 174 LevelMax = (FieldWidth * FieldHeight) - 1; in InitGlobals() 184 AnimationPosTable = REDIM_1D(sizeof(int), 0, LevelMax); in InitGlobals() 185 AnimationSubTable = REDIM_1D(sizeof(byte), 0, LevelMax); in InitGlobals()
|
/dports/games/rnd_jue/rocksndiamonds-3.3.1.0/src/game_sp/ |
H A D | Globals.c | 16 int FieldMax, LevelMax; variable 180 LevelMax = (FieldWidth * FieldHeight) - 1; in InitGlobals() 202 AnimationPosTable = REDIM_1D(sizeof(int), 0, LevelMax); in InitGlobals() 203 AnimationSubTable = REDIM_1D(sizeof(byte), 0, LevelMax); in InitGlobals()
|
/dports/games/rocksndiamonds/rocksndiamonds-3.3.1.2/src/game_sp/ |
H A D | Globals.c | 16 int FieldMax, LevelMax; variable 180 LevelMax = (FieldWidth * FieldHeight) - 1; in InitGlobals() 202 AnimationPosTable = REDIM_1D(sizeof(int), 0, LevelMax); in InitGlobals() 203 AnimationSubTable = REDIM_1D(sizeof(byte), 0, LevelMax); in InitGlobals()
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/fra/ |
H A D | fraSat.c | 502 int Fra_SetActivityFactors_rec( Fra_Man_t * p, Aig_Obj_t * pObj, int LevelMin, int LevelMax ) in Fra_SetActivityFactors_rec() argument 520 …[Fra_ObjSatNum(pObj)] = p->pPars->dActConeBumpMax * (pObj->Level - LevelMin)/(LevelMax - LevelMin); in Fra_SetActivityFactors_rec() 525 Counter += Fra_SetActivityFactors_rec( p, Aig_Regular(pFanin), LevelMin, LevelMax ); in Fra_SetActivityFactors_rec() 542 int LevelMin, LevelMax; in Fra_SetActivityFactors() local 552 LevelMax = Abc_MaxInt( (pNew ? pNew->Level : 0), (pOld ? pOld->Level : 0) ); in Fra_SetActivityFactors() 553 LevelMin = (int)(LevelMax * (1.0 - p->pPars->dActConeRatio)); in Fra_SetActivityFactors() 556 Fra_SetActivityFactors_rec( p, pOld, LevelMin, LevelMax ); in Fra_SetActivityFactors() 558 Fra_SetActivityFactors_rec( p, pNew, LevelMin, LevelMax ); in Fra_SetActivityFactors()
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/ |
H A D | abcRr.c | 432 int i, LevelMin, LevelMax, RetValue; in Abc_NtkRRWindow() local 439 LevelMax = (int)pEdgeFanout->Level + p->nFanoutLevels; in Abc_NtkRRWindow() 455 while ( Abc_NtkRRTfo_int(p->vFaninLeaves, p->vFanoutRoots, LevelMax, pEdgeFanin, pEdgeFanout) ); in Abc_NtkRRWindow() 461 RetValue = Abc_NtkRRTfo_rec( pEdgeFanout, p->vRoots, LevelMax + 1 ); in Abc_NtkRRWindow() 495 int i, k, LevelMax, nSize; in Abc_NtkRRTfi_int() local 498 LevelMax = 0; in Abc_NtkRRTfi_int() 500 if ( LevelMax < (int)pObj->Level ) in Abc_NtkRRTfi_int() 501 LevelMax = pObj->Level; in Abc_NtkRRTfi_int() 503 if ( LevelMax <= LevelLimit ) in Abc_NtkRRTfi_int() 509 if ( LevelMax != (int)pObj->Level ) in Abc_NtkRRTfi_int() [all …]
|
/dports/devel/p5-Log-Log4perl/Log-Log4perl-1.54/lib/Log/Log4perl/Filter/ |
H A D | LevelRange.pm | 24 LevelMax => 'FATAL', 49 Log::Log4perl::Level::to_priority($self->{LevelMax}) >=
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/acb/ |
H A D | acbUtil.c | 126 p->LevelMax = Level; in Acb_NtkComputeLevelD() 148 p->LevelMax = Level; in Acb_NtkComputeLevelR() 172 assert( !Acb_ObjIsCio(p, iObj) + p->LevelMax >= LevelSum ); in Acb_ObjSlack() 173 return !Acb_ObjIsCio(p, iObj) + p->LevelMax - LevelSum; in Acb_ObjSlack() 291 LevelD = p->LevelMax; in Acb_NtkComputePaths() 293 LevelR = p->LevelMax; in Acb_NtkComputePaths() 348 int i, Entry, LevelMax = p->LevelMax; in Acb_NtkUpdateTiming() local 360 LevelD = p->LevelMax; in Acb_NtkUpdateTiming() 362 LevelR = p->LevelMax; in Acb_NtkUpdateTiming() 364 if ( iObj > 0 && LevelMax > p->LevelMax ) // reduced level in Acb_NtkUpdateTiming()
|