Home
last modified time | relevance | path

Searched refs:nNodesMax (Results 1 – 25 of 30) sorted by relevance

12

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/reo/
H A DreoCore.c269 void reoResizeStructures( reo_man * p, int nDdVarsMax, int nNodesMax, int nFuncs ) in reoResizeStructures() argument
309 p->nNodesMaxAlloc = nNodesMax; in reoResizeStructures()
310 p->nTableSize = 3*nNodesMax + 1; in reoResizeStructures()
311 p->nRefNodesAlloc = 3*nNodesMax + 1; in reoResizeStructures()
312 p->nMemChunksAlloc = (10*nNodesMax + 1)/REO_CHUNK_SIZE + 1; in reoResizeStructures()
319 else if ( p->nNodesMaxAlloc < nNodesMax ) in reoResizeStructures()
324 p->nNodesMaxAlloc = nNodesMax; in reoResizeStructures()
325 p->nTableSize = 3*nNodesMax + 1; in reoResizeStructures()
326 p->nRefNodesAlloc = 3*nNodesMax + 1; in reoResizeStructures()
327 p->nMemChunksAlloc = (10*nNodesMax + 1)/REO_CHUNK_SIZE + 1; in reoResizeStructures()
H A DreoApi.c50 reo_man * Extra_ReorderInit( int nDdVarsMax, int nNodesMax ) in Extra_ReorderInit() argument
57 reoResizeStructures( p, nDdVarsMax, nNodesMax, 100 ); in Extra_ReorderInit()
H A Dreo.h184 extern reo_man * Extra_ReorderInit( int nDdVarsMax, int nNodesMax );
195 extern void reoResizeStructures( reo_man * p, int nDdVarsMax, int nNodesMax, int nFuncs );
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/mapper/
H A DmapperCut.c595 if ( pCut1->nLeaves == nNodesMax ) in Map_CutMergeTwo()
597 if ( pCut2->nLeaves == nNodesMax ) in Map_CutMergeTwo()
600 for ( i = 0; i < nNodesMax; i++ ) in Map_CutMergeTwo()
604 for ( i = 0; i < nNodesMax; i++ ) in Map_CutMergeTwo()
606 return nNodesMax; in Map_CutMergeTwo()
622 return nNodesMax; in Map_CutMergeTwo()
625 else if ( pCut1->nLeaves == nNodesMax - 1 && pCut2->nLeaves == nNodesMax ) in Map_CutMergeTwo()
629 for ( i = 0; i < nNodesMax; i++ ) in Map_CutMergeTwo()
637 for ( i = 0; i < nNodesMax; i++ ) in Map_CutMergeTwo()
639 return nNodesMax; in Map_CutMergeTwo()
[all …]
H A DmapperUtils.c37 static void Map_MappingFindLatest( Map_Man_t * p, int * pNodes, int nNodesMax );
257 void Map_MappingFindLatest( Map_Man_t * p, int * pNodes, int nNodesMax ) in Map_MappingFindLatest() argument
260 assert( p->nOutputs >= nNodesMax ); in Map_MappingFindLatest()
268 if ( k == nNodesMax - 1 ) in Map_MappingFindLatest()
270 if ( nNodes < nNodesMax ) in Map_MappingFindLatest()
/dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/aig/
H A DaigMan.c61 Aig_Man_t * Aig_ManStart( int nNodesMax ) in Aig_ManStart() argument
64 if ( nNodesMax <= 0 ) in Aig_ManStart()
65 nNodesMax = 10007; in Aig_ManStart()
78 p->pMemObjs = Aig_MmFixedStart( sizeof(Aig_Obj_t), nNodesMax ); in Aig_ManStart()
85 p->nTableSize = Aig_PrimeCudd( nNodesMax ); in Aig_ManStart()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/aig/
H A DaigMan.c47 Aig_Man_t * Aig_ManStart( int nNodesMax ) in Aig_ManStart() argument
50 if ( nNodesMax <= 0 ) in Aig_ManStart()
51 nNodesMax = 10007; in Aig_ManStart()
68 p->pMemObjs = Aig_MmFixedStart( sizeof(Aig_Obj_t), nNodesMax ); in Aig_ManStart()
75 p->nTableSize = Abc_PrimeCudd( nNodesMax ); in Aig_ManStart()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/sat/bmc/
H A DbmcBmc2.c40 int nNodesMax; // the max number of nodes to add member
282 Saig_Bmc_t * Saig_BmcManStart( Aig_Man_t * pAig, int nFramesMax, int nNodesMax, int nConfMaxOne, in… in Saig_BmcManStart() argument
292 p->nNodesMax = nNodesMax; in Saig_BmcManStart()
485 if ( Aig_ManObjNum(p->pFrm) >= nNodes + p->nNodesMax ) in Saig_BmcInterval()
547 pNew = Aig_ManStart( p->nNodesMax ); in Saig_BmcIntervalToAig()
811 int Saig_BmcPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, int nNodesMax, int nTimeOut, int… in Saig_BmcPerform() argument
832 nFramesMax, nNodesMax, nConfMaxOne, nConfMaxAll ); in Saig_BmcPerform()
835 …p = Saig_BmcManStart( pAig, nFramesMax, nNodesMax, nConfMaxOne, nConfMaxAll, fVerbose, fUseSatoko … in Saig_BmcPerform()
H A Dbmc.h212 … Saig_BmcPerform( Aig_Man_t * pAig, int nStart, int nFramesMax, int nNodesMax, int nTimeOut, i…
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/
H A DabcLut.c42 int nNodesMax; // the max number of divisors in the cone member
59 static Abc_ManScl_t * Abc_ManSclStart( int nLutSize, int nCutSizeMax, int nNodesMax );
286 Abc_ManScl_t * Abc_ManSclStart( int nLutSize, int nCutSizeMax, int nNodesMax ) in Abc_ManSclStart() argument
295 p->nNodesMax = nNodesMax; in Abc_ManSclStart()
299 p->uSims = (unsigned **)Extra_ArrayAlloc( nNodesMax, p->nWords, 4 ); in Abc_ManSclStart()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/bdc/
H A DbdcInt.h87 int nNodesMax; // the limit on the number of new nodes member
128 …dc_Fun_t * pRes; if ( p->nNodes >= p->nNodesAlloc || p->nNodesNew >= p->nNodesMax ) return NULL; p… in Bdc_FunNew()
H A DbdcCore.c291 … Bdc_Man_t * p, unsigned * puFunc, unsigned * puCare, int nVars, Vec_Ptr_t * vDivs, int nNodesMax ) in Bdc_ManDecompose() argument
299 p->nNodesMax = nNodesMax; in Bdc_ManDecompose()
H A Dbdc.h71 …Bdc_Man_t * p, unsigned * puFunc, unsigned * puCare, int nVars, Vec_Ptr_t * vDivs, int nNodesMax );
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/fra/
H A DfraMan.c145 void Fra_ManClean( Fra_Man_t * p, int nNodesMax ) in Fra_ManClean() argument
153 if ( p->nMemAlloc < nNodesMax ) in Fra_ManClean()
155 int nMemAllocNew = nNodesMax + 5000; in Fra_ManClean()
H A Dfra.h349 extern void Fra_ManClean( Fra_Man_t * p, int nNodesMax );
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/acb/
H A DacbPar.h48 int nNodesMax; // the maximum number of nodes to try member
H A DacbAbc.c256 pPars->nNodesMax = 0; // the maximum number of nodes to try in Acb_ParSetDefault()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/fpga/
H A DfpgaUtils.c33 static void Fpga_MappingFindLatest( Fpga_Man_t * p, int * pNodes, int nNodesMax );
370 void Fpga_MappingFindLatest( Fpga_Man_t * p, int * pNodes, int nNodesMax ) in Fpga_MappingFindLatest() argument
373 assert( p->nOutputs >= nNodesMax ); in Fpga_MappingFindLatest()
381 if ( k == nNodesMax - 1 ) in Fpga_MappingFindLatest()
383 if ( nNodes < nNodesMax ) in Fpga_MappingFindLatest()
H A DfpgaCut.c66 …Fpga_CutMergeTwo( Fpga_Cut_t * pCut1, Fpga_Cut_t * pCut2, Fpga_Node_t * ppNodes[], int nNodesMax );
606 … Fpga_CutMergeTwo( Fpga_Cut_t * pCut1, Fpga_Cut_t * pCut2, Fpga_Node_t * ppNodes[], int nNodesMax ) in Fpga_CutMergeTwo() argument
615 if ( Counter > nNodesMax ) in Fpga_CutMergeTwo()
677 if ( nTotal == nNodesMax ) in Fpga_CutMergeTwo()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/extrab/
H A DextraBddImage.c49 int nNodesMax; // the max number of nodes in one iter member
252 pTree->nNodesMax = 0; in Extra_bddImageCompute()
254 if ( pTree->nNodesMaxT < pTree->nNodesMax ) in Extra_bddImageCompute()
255 pTree->nNodesMaxT = pTree->nNodesMax; in Extra_bddImageCompute()
610 if ( pTree->nNodesMax < nNodes ) in Extra_bddImageCompute_rec()
611 pTree->nNodesMax = nNodes; in Extra_bddImageCompute_rec()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/sfm/
H A Dsfm.h56 int nNodesMax; // the maximum number of nodes to try member
H A DsfmCore.c325 if ( pPars->nNodesMax && Counter >= pPars->nNodesMax ) in Sfm_NtkPerform()
H A DsfmDec.c1934 if ( i >= nStop || (p->pPars->nNodesMax && i > p->pPars->nNodesMax) ) in Abc_NtkAreaOpt()
1989 for ( n = 0; pPars->nNodesMax == 0 || n < pPars->nNodesMax; n++ ) in Abc_NtkDelayOpt()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/bbr/
H A DbbrImage.c52 int nNodesMax; // the max number of nodes in one iter member
285 pTree->nNodesMax = 0; in Bbr_bddImageCompute()
288 if ( pTree->nNodesMaxT < pTree->nNodesMax ) in Bbr_bddImageCompute()
289 pTree->nNodesMaxT = pTree->nNodesMax; in Bbr_bddImageCompute()
702 if ( pTree->nNodesMax < nNodes ) in Bbr_bddImageCompute_rec()
703 pTree->nNodesMax = nNodes; in Bbr_bddImageCompute_rec()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/dau/
H A DdauNpn.c458 …Dau_ExactNpnPrint( Vec_Mem_t * vTtMem, Vec_Int_t * vNodSup, int nVars, int nInputs, int nNodesMax ) in Dau_ExactNpnPrint() argument
466 for ( n = 0; n <= nNodesMax; n++ ) in Dau_ExactNpnPrint()

12