/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 860 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 904 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 905 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 860 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 904 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 905 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/devel/llvm11/llvm-11.0.1.src/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 862 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 863 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 906 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 907 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 861 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 862 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 905 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 906 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 860 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 904 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 905 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 860 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 904 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 905 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 860 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 904 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 905 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 860 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 904 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 905 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/graphics/graphviz/graphviz-2.44.1/lib/dotgen/ |
H A D | mincross.c | 838 maxthispass = MIN(4, MaxIter); in mincross() 851 maxthispass = MaxIter; in mincross() 1955 MaxIter = 24; in mincross_options() 1961 MaxIter = MAX(1, MaxIter * f); in mincross_options()
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 860 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 904 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 905 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 860 unsigned MaxIter = PrologBBs.size() - 1; in addBranches() local 861 for (unsigned i = 0, j = MaxIter; i <= MaxIter; ++i, --j) { in addBranches() 904 LoopInfo->setPreheader(PrologBBs[MaxIter]); in addBranches() 905 LoopInfo->adjustTripCount(-(MaxIter + 1)); in addBranches()
|
/dports/science/dynare/dynare-4.6.4/matlab/ |
H A D | osr1.m | 72 options_.optim_opt=[options_.optim_opt,'''MaxIter'',',num2str(options_.osr.maxit),''];
|
/dports/devel/llvm90/llvm-9.0.1.src/lib/Target/PowerPC/ |
H A D | PPCInstrInfo.h | 503 unsigned Iter, unsigned MaxIter) const override;
|
/dports/science/elmerfem/elmerfem-release-9.0/fem/src/modules/ |
H A D | StressSolve.F90 | 213 INTEGER :: MaxIter, MinIter, NoModes, Nsize, Dofs, DisplacementVelDOFs local 548 MaxIter = GetInteger( SolverParams, & 550 IF ( .NOT.Found ) MaxIter = 1 578 MaxIter = 2 622 MaxIter = 6 630 DO iter=1,MaxIter 645 IF( MaxIter > 1 ) THEN
|
/dports/math/testu01/TestU01-1.2.3/probdist/ |
H A D | finv.c | 1862 const int MaxIter = 100; /* Maximum number of iterations */ in finv_GenericC() local 1940 if (i > MaxIter) { in finv_GenericC()
|
/dports/devel/llvm90/llvm-9.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonInstrInfo.h | 146 unsigned Iter, unsigned MaxIter) const override;
|
/dports/devel/llvm80/llvm-8.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonInstrInfo.h | 147 unsigned Iter, unsigned MaxIter) const override;
|
/dports/devel/llvm70/llvm-7.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonInstrInfo.h | 147 unsigned Iter, unsigned MaxIter) const override;
|
/dports/math/octave-forge-optim/optim-1.6.1/inst/private/ |
H A D | __d2_min__.m | 47 if (isempty (maxout = hook.MaxIter)) maxout = 1000; endif
|
/dports/math/octave/octave-6.4.0/doc/interpreter/ |
H A D | optim.texi | 623 @qcode{"MaxIter"}, @qcode{"TolX"}. 625 @qcode{"MaxIter"} proscribes the maximum number of algorithm iterations 689 one option: @qcode{"MaxIter"}. 1085 these options: @qcode{"MaxIter"}, @qcode{"TolX"}. 1228 @item MaxIter
|
/dports/math/octave-forge-linear-algebra/linear-algebra-2.2.3/inst/ |
H A D | nmf_bpas.m | 62 ## @item MaxIter 136 parser.addParamValue ('MaxIter', 100, @(x)x>0); 154 par.max_iter = parser.Results.MaxIter;
|
/dports/math/octave/octave-6.4.0/scripts/optimization/ |
H A D | optimset.m | 97 ## @item MaxIter
|
/dports/science/dynare/dynare-4.6.4/matlab/optimization/ |
H A D | solvopt.m | 33 % optim.MaxIter= limit for the number of iterations (15000 by default), 138 doptions.MaxIter=15000; 1033 if(k==optim.MaxIter)
|
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/haskell-src-exts-1.23.1/tests/examples/ |
H A D | Attributes.hs | 278 …| MaxIter Int -- ^ /Valid for/: G; /Default/: @100 * # nodes@ (@mode == 'KK'@… 427 unqtDot (MaxIter v) = printField "maxiter" v 575 , liftM MaxIter $ parseField "maxiter" 691 usedByGraphs MaxIter{} = True function
|
/dports/devel/hs-hoogle/hoogle-5.0.18.2/_cabal_deps/haskell-src-exts-1.23.0/tests/examples/ |
H A D | Attributes.hs | 278 …| MaxIter Int -- ^ /Valid for/: G; /Default/: @100 * # nodes@ (@mode == 'KK'@… 427 unqtDot (MaxIter v) = printField "maxiter" v 575 , liftM MaxIter $ parseField "maxiter" 691 usedByGraphs MaxIter{} = True function
|