/dports/devel/p5-POE-Test-Loops/POE-Test-Loops-1.360/ |
H A D | MANIFEST | 14 lib/POE/Test/Loops.pm 15 lib/POE/Test/Loops/00_info.pm 16 lib/POE/Test/Loops/all_errors.pm 17 lib/POE/Test/Loops/comp_tcp.pm 20 lib/POE/Test/Loops/k_alarms.pm 21 lib/POE/Test/Loops/k_aliases.pm 22 lib/POE/Test/Loops/k_detach.pm 24 lib/POE/Test/Loops/k_selects.pm 26 lib/POE/Test/Loops/k_signals.pm 29 lib/POE/Test/Loops/ses_nfa.pm [all …]
|
/dports/audio/spiralloops/SpiralLoops-2.0.0/ |
H A D | SpiralLoops.C | 46 Loops::Loops(): in Loops() function 63 Loops::~Loops() in ~Loops() 73 void Loops::AllocMem() in AllocMem() 102 void Loops::DoIdle() in DoIdle() 142 void Loops::AddLoop() in AddLoop() 162 void Loops::ClearLoops() in ClearLoops() 193 vector<int> Loops; in CheckTriggers() local 203 i!=Loops.end(); i++) in CheckTriggers() 304 int Loops::LinkPlugin() in LinkPlugin() 323 int Loops::ClosePlugin() in ClosePlugin() [all …]
|
H A D | SpiralLoops.h | 53 class Loops 56 Loops(); 57 ~Loops(); 150 friend istream &operator>>(istream &s, Loops &o); 151 friend ostream &operator<<(ostream &s, Loops &o); 154 istream &operator>>(istream &s, Loops &o); 155 ostream &operator<<(ostream &s, Loops &o);
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 71 Loop &getOutermostLoop() const { return *Loops.front(); } 77 if (Loops.size() == 1) in getEntryNode() 78 return Loops.back(); in getEntryNode() 83 Loop *LastLoop = Loops.back(); in getEntryNode() 84 auto SecondLastLoopIter = ++Loops.rbegin(); in getEntryNode() 92 assert(Index < Loops.size() && "Index is out of bounds"); 93 return Loops[Index]; 97 size_t getNumLoops() const { return Loops.size(); } 100 ArrayRef<Loop *> getLoops() const { return Loops; } 125 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in LoopBlocksDFS() [all …]
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 71 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 77 if (Loops.size() == 1) in getInnermostLoop() 78 return Loops.back(); in getInnermostLoop() 83 Loop *LastLoop = Loops.back(); in getInnermostLoop() 84 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 92 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 93 return Loops[Index]; in getLoop() 97 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 100 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 125 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 71 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 77 if (Loops.size() == 1) in getInnermostLoop() 78 return Loops.back(); in getInnermostLoop() 83 Loop *LastLoop = Loops.back(); in getInnermostLoop() 84 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 92 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 93 return Loops[Index]; in getLoop() 97 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 100 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 125 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 71 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 77 if (Loops.size() == 1) in getInnermostLoop() 78 return Loops.back(); in getInnermostLoop() 83 Loop *LastLoop = Loops.back(); in getInnermostLoop() 84 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 92 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 93 return Loops[Index]; in getLoop() 97 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 100 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 125 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 71 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 77 if (Loops.size() == 1) in getInnermostLoop() 78 return Loops.back(); in getInnermostLoop() 83 Loop *LastLoop = Loops.back(); in getInnermostLoop() 84 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 92 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 93 return Loops[Index]; in getLoop() 97 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 100 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 125 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 70 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 76 if (Loops.size() == 1) in getInnermostLoop() 77 return Loops.back(); in getInnermostLoop() 82 Loop *LastLoop = Loops.back(); in getInnermostLoop() 83 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 91 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 92 return Loops[Index]; in getLoop() 96 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 99 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 124 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 70 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 76 if (Loops.size() == 1) in getInnermostLoop() 77 return Loops.back(); in getInnermostLoop() 82 Loop *LastLoop = Loops.back(); in getInnermostLoop() 83 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 91 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 92 return Loops[Index]; in getLoop() 96 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 99 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 124 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 80 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 86 if (Loops.size() == 1) in getInnermostLoop() 87 return Loops.back(); in getInnermostLoop() 92 Loop *LastLoop = Loops.back(); in getInnermostLoop() 93 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 101 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 102 return Loops[Index]; in getLoop() 106 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 109 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 134 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 63 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 69 if (Loops.size() == 1) in getInnermostLoop() 70 return Loops.back(); in getInnermostLoop() 75 Loop *LastLoop = Loops.back(); in getInnermostLoop() 76 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 84 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 85 return Loops[Index]; in getLoop() 89 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 92 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 117 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 63 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 69 if (Loops.size() == 1) in getInnermostLoop() 70 return Loops.back(); in getInnermostLoop() 75 Loop *LastLoop = Loops.back(); in getInnermostLoop() 76 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 84 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 85 return Loops[Index]; in getLoop() 89 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 92 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 117 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/Analysis/ |
H A D | LoopNestAnalysis.h | 63 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop() 69 if (Loops.size() == 1) in getInnermostLoop() 70 return Loops.back(); in getInnermostLoop() 75 Loop *LastLoop = Loops.back(); in getInnermostLoop() 76 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop() 84 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop() 85 return Loops[Index]; in getLoop() 89 size_t getNumLoops() const { return Loops.size(); } in getNumLoops() 92 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops() 117 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth() [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/BRepOffset/ |
H A D | BRepOffset_MakeLoops.cxx | 62 Loops.SetImageVV (theImageVV); in Build() 74 Loops.Init(F); in Build() 103 Loops.Perform(); in Build() 104 Loops.WiresToFaces(); in Build() 300 Loops.AddEdge(E,LV); in BuildOnContext() 326 Loops.Perform(); in BuildOnContext() 422 Loops.Init(F); in BuildFaces() 447 Loops.AddConstEdge(CE); in BuildFaces() 462 Loops.AddConstEdge(CE); in BuildFaces() 517 Loops.Perform(); in BuildFaces() [all …]
|
/dports/archivers/peazip/peazip-8.1.0.src/ |
H A D | t_sp_ws.pas | 129 for i:=1 to Loops do begin 135 if Loops=1 then begin 150 for i:=1 to Loops do begin 156 if Loops=1 then begin 171 for i:=1 to Loops do begin 177 if Loops=1 then begin 192 for i:=1 to Loops do begin 198 if Loops=1 then begin 213 for i:=1 to Loops do begin 219 if Loops=1 then begin [all …]
|
H A D | t_tf_ws.pas | 135 for i:=1 to Loops do begin 141 if Loops=1 then begin 156 for i:=1 to Loops do begin 162 if Loops=1 then begin 177 for i:=1 to Loops do begin 183 if Loops=1 then begin 204 for i:=1 to Loops do begin 210 if Loops=1 then begin 231 if Loops=1 then begin 258 if Loops=1 then begin [all …]
|
/dports/devel/adabooch/bc-20160321/demos/ |
H A D | time_change.adb | 20 Loops : Natural := 0; component 26 Loops : Natural := 0; component 40 Ada_Times (I).Loops := Ada_Times (I).Loops + 1; 49 & Natural'Image (Ada_Times (I).Loops) 59 BC_Times (I).Loops := BC_Times (I).Loops + 1; 67 & Natural'Image (BC_Times (I).Loops)
|
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/Analysis/ |
H A D | ScalarEvolutionNormalization.cpp | 67 PostIncLoopSet &Loops, in TransformForPostIncUse() argument 76 Loops, SE, DT); in TransformForPostIncUse() 107 User, OperandValToReplace, Loops, SE, DT); in TransformForPostIncUse() 109 Loops.insert(L); in TransformForPostIncUse() 118 Loops, SE, DT) && in TransformForPostIncUse() 123 if (Loops.count(L)) { in TransformForPostIncUse() 133 Loops, SE, DT) && in TransformForPostIncUse() 138 if (Loops.count(L)) in TransformForPostIncUse() 153 Loops, SE, DT); in TransformForPostIncUse() 173 Loops, SE, DT); in TransformForPostIncUse() [all …]
|
/dports/math/igraph/igraph-0.9.5/tests/unit/ |
H A D | adjlist.out | 3 Loops eliminated: { 11 Loops listed once: { 19 Loops listed twice: { 31 Loops eliminated: { 39 Loops listed once: { 47 Loops listed twice: { 211 Loops also eliminated: { 223 Loops listed once: { 235 Loops listed twice: { 263 Loops listed once: { [all …]
|
/dports/devel/llvm70/llvm-7.0.1.src/lib/Target/WebAssembly/ |
H A D | WebAssemblyCFGSort.cpp | 146 SmallVector<Entry, 4> Loops; in SortBlocks() local 153 Loops.push_back(Entry(L)); in SortBlocks() 157 for (Entry &E : Loops) in SortBlocks() 161 while (!Loops.empty() && Loops.back().NumBlocksLeft == 0) in SortBlocks() 162 Loops.pop_back(); in SortBlocks() 182 if (!Loops.empty() && in SortBlocks() 183 !MDT.dominates(Loops.back().Loop->getHeader(), Next)) { in SortBlocks() 184 Loops.back().Deferred.push_back(Next); in SortBlocks() 212 if (!Loops.empty() && in SortBlocks() 214 Loops.back().Deferred.push_back(Next); in SortBlocks() [all …]
|
/dports/audio/hydrogen/hydrogen-1.0.1/src/core/include/hydrogen/basics/ |
H A D | sample.h | 75 class Loops 90 Loops() : start_frame( 0 ), loop_frame( 0 ), end_frame( 0 ), count( 0 ), mode( FORWARD ) { }; in Loops() function 92 Loops( const Loops* other ) : in Loops() function 99 bool operator ==( const Loops& b ) const 188 …static Sample* load( const QString& filepath, const Loops& loops, const Rubberband& rubber, const … 239 …void apply( const Loops& loops, const Rubberband& rubber, const VelocityEnvelope& velocity, const … 244 bool apply_loops( const Loops& lo ); 310 Loops get_loops() const; 317 static Loops::LoopMode parse_loop_mode( const QString& string ); 330 Loops __loops; ///< set of loop parameters [all …]
|
/dports/devel/judy/judy-1.0.5/test/ |
H A D | Judy1LHTime.c | 967 Word_t Loops; in TestJudyIns() local 973 Loops = 1; in TestJudyIns() 976 Loops = 1; in TestJudyIns() 1187 Loops = 1; in TestJudyDup() 1337 Loops = 1; in TestJudyGet() 1502 Loops = 1; in TestJudy1Copy() 1581 Loops = 1; in TestJudyCount() 1688 Loops = 1; in TestJudyNext() 1824 Loops = 1; in TestJudyPrev() 1936 Loops = 1; in TestJudyNextEmpty() [all …]
|
H A D | Judy1LTime.c | 765 Word_t Loops; in TestJudyIns() local 770 Loops = 1; in TestJudyIns() 773 Loops = 1; in TestJudyIns() 898 Word_t Loops; in TestJudyDup() local 900 Loops = (MAXLOOPS / Elements) + MINLOOPS; in TestJudyDup() 1002 Word_t Loops; in TestJudyGet() local 1104 Word_t Loops; in TestJudyCount() local 1187 Word_t Loops; in TestJudyNext() local 1276 Word_t Loops; in TestJudyPrev() local 1363 Word_t Loops; in TestJudyNextEmpty() local [all …]
|
/dports/biology/viennarna/ViennaRNA-2.4.18/doc/latex/ |
H A D | group__eval__loops.tex | 1 \hypertarget{group__eval__loops}{}\doxysection{Energy Evaluation for Individual Loops} 2 …__eval__loops}\index{Energy Evaluation for Individual Loops@{Energy Evaluation for Individual Loop… 19 …artition function computations. Collaboration diagram for Energy Evaluation for Individual Loops\+: 30 \mbox{\hyperlink{group__eval__loops__ext}{Exterior Loops}} 32 \mbox{\hyperlink{group__eval__loops__hp}{Hairpin Loops}} 34 \mbox{\hyperlink{group__eval__loops__int}{Internal Loops}} 36 \mbox{\hyperlink{group__eval__loops__mb}{Multibranch Loops}} 62 \index{Energy Evaluation for Individual Loops@{Energy Evaluation for Individual Loops}!vrna\_eval\_… 63 …rna\_eval\_loop\_pt}!Energy Evaluation for Individual Loops@{Energy Evaluation for Individual Loop… 90 \index{Energy Evaluation for Individual Loops@{Energy Evaluation for Individual Loops}!vrna\_eval\_… [all …]
|