/dports/audio/praat/praat-6.2.03/dwsys/ |
H A D | Roots.h | 35 void Roots_fixIntoUnitCircle (Roots me); 37 void Roots_sort (Roots me); 40 dcomplex Roots_evaluate_z (Roots me, dcomplex z); 44 integer Roots_getNumberOfRoots (Roots me); 46 void Roots_draw (Roots me, Graphics g, double rmin, double rmax, double imin, double imax, 49 dcomplex Roots_getRoot (Roots me, integer index); 51 void Roots_setRoot (Roots me, integer index, double re, double im); 56 void Roots_Polynomial_polish (Roots me, Polynomial thee); 58 autoPolynomial Roots_to_Polynomial (Roots me, bool rootsAreReal); 66 void Polynomial_into_Roots (Polynomial me, Roots r, VEC const& workspace);
|
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/hipe/llvm/ |
H A D | hipe_llvm_liveness.erl | 9 Roots = find_roots(RtlCfg, Liveness), 11 NewRtlCfg = mark_dead_roots(RtlCfg, Liveness, Roots), 12 {NewRtlCfg, Roots}. 20 Roots = find_roots_bb(Labels, Cfg, Liveness, []), 21 lists:usort(lists:flatten(Roots)). 31 find_roots_bb(Ls, Cfg, Liveness, Roots++RootAcc). 66 mark_dead_roots(CFG, Liveness, Roots) -> 68 mark_dead_bb(Labels, CFG, Liveness, Roots). 72 mark_dead_bb([L|Ls], Cfg, Liveness, Roots) -> 80 mark_dead_bb(Ls, NewCFG, Liveness, Roots). [all …]
|
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/hipe/llvm/ |
H A D | hipe_llvm_liveness.erl | 9 Roots = find_roots(RtlCfg, Liveness), 11 NewRtlCfg = mark_dead_roots(RtlCfg, Liveness, Roots), 12 {NewRtlCfg, Roots}. 20 Roots = find_roots_bb(Labels, Cfg, Liveness, []), 21 lists:usort(lists:flatten(Roots)). 31 find_roots_bb(Ls, Cfg, Liveness, Roots++RootAcc). 66 mark_dead_roots(CFG, Liveness, Roots) -> 68 mark_dead_bb(Labels, CFG, Liveness, Roots). 72 mark_dead_bb([L|Ls], Cfg, Liveness, Roots) -> 80 mark_dead_bb(Ls, NewCFG, Liveness, Roots). [all …]
|
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/hipe/llvm/ |
H A D | hipe_llvm_liveness.erl | 9 Roots = find_roots(RtlCfg, Liveness), 11 NewRtlCfg = mark_dead_roots(RtlCfg, Liveness, Roots), 12 {NewRtlCfg, Roots}. 20 Roots = find_roots_bb(Labels, Cfg, Liveness, []), 21 lists:usort(lists:flatten(Roots)). 31 find_roots_bb(Ls, Cfg, Liveness, Roots++RootAcc). 66 mark_dead_roots(CFG, Liveness, Roots) -> 68 mark_dead_bb(Labels, CFG, Liveness, Roots). 72 mark_dead_bb([L|Ls], Cfg, Liveness, Roots) -> 80 mark_dead_bb(Ls, NewCFG, Liveness, Roots). [all …]
|
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/hipe/flow/ |
H A D | ebb.inc | 61 Roots = [Start], 62 Blocks = Labels -- Roots, 122 %% Roots = [Start], 123 %% Edges = all_adges(EBBs, Roots), 124 %% start_dag(Roots, Edges, []). 143 %% {Dag, Roots, Visit}; 151 %% {Dag0, [S|Roots], Visit0} 170 %% all_edges([EBB|EBBs], Roots) -> 173 %% succ_edges(Lbl, [], EBBs, Roots) -> 174 %% case lists:member(Lbl, Roots) of [all …]
|
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/hipe/flow/ |
H A D | ebb.inc | 61 Roots = [Start], 62 Blocks = Labels -- Roots, 122 %% Roots = [Start], 123 %% Edges = all_adges(EBBs, Roots), 124 %% start_dag(Roots, Edges, []). 143 %% {Dag, Roots, Visit}; 151 %% {Dag0, [S|Roots], Visit0} 170 %% all_edges([EBB|EBBs], Roots) -> 173 %% succ_edges(Lbl, [], EBBs, Roots) -> 174 %% case lists:member(Lbl, Roots) of [all …]
|
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/hipe/flow/ |
H A D | ebb.inc | 61 Roots = [Start], 62 Blocks = Labels -- Roots, 122 %% Roots = [Start], 123 %% Edges = all_adges(EBBs, Roots), 124 %% start_dag(Roots, Edges, []). 143 %% {Dag, Roots, Visit}; 151 %% {Dag0, [S|Roots], Visit0} 170 %% all_edges([EBB|EBBs], Roots) -> 173 %% succ_edges(Lbl, [], EBBs, Roots) -> 174 %% case lists:member(Lbl, Roots) of [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/tutorials/output/ |
H A D | ex1_6.out | 18 [0] Roots referenced by my leaves, by rank 23 [1] Roots referenced by my leaves, by rank 29 [2] Roots referenced by my leaves, by rank 36 [3] Roots referenced by my leaves, by rank 56 [0] Roots referenced by my leaves, by rank 59 [1] Roots referenced by my leaves, by rank 63 [2] Roots referenced by my leaves, by rank 68 [3] Roots referenced by my leaves, by rank
|
H A D | ex1_6_basic.out | 19 [0] Roots referenced by my leaves, by rank 24 [1] Roots referenced by my leaves, by rank 30 [2] Roots referenced by my leaves, by rank 37 [3] Roots referenced by my leaves, by rank 58 [0] Roots referenced by my leaves, by rank 61 [1] Roots referenced by my leaves, by rank 65 [2] Roots referenced by my leaves, by rank 70 [3] Roots referenced by my leaves, by rank
|
H A D | ex1_6_basic_alt.out | 19 [0] Roots referenced by my leaves, by rank 24 [1] Roots referenced by my leaves, by rank 30 [2] Roots referenced by my leaves, by rank 37 [3] Roots referenced by my leaves, by rank 58 [0] Roots referenced by my leaves, by rank 61 [1] Roots referenced by my leaves, by rank 65 [2] Roots referenced by my leaves, by rank 70 [3] Roots referenced by my leaves, by rank
|
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/ada/ |
H A D | memroot.adb | 131 package Roots is new GNAT.Table ( packspec 218 Roots.Increment_Last; 219 Roots.Table (Roots.Last) := Root'(F, F + Len - 1, 0, 0, 0); 220 Res := Root_HTable.Get (Roots.Table (Roots.Last)); 224 Roots.Decrement_Last; 228 Root_HTable.Set (Roots.Table (Roots.Last), Roots.Last); 229 return Roots.Last; 240 Frames_In_Root.Table (Roots.Table (B).First .. Roots.Table (B).Last)); 364 return Roots.Table (B).Nb_Alloc; 589 Roots.Table (B).Alloc_Size := V; [all …]
|
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ada/ |
H A D | memroot.adb | 131 package Roots is new GNAT.Table ( packspec 218 Roots.Increment_Last; 219 Roots.Table (Roots.Last) := Root'(F, F + Len - 1, 0, 0, 0); 220 Res := Root_HTable.Get (Roots.Table (Roots.Last)); 224 Roots.Decrement_Last; 228 Root_HTable.Set (Roots.Table (Roots.Last), Roots.Last); 229 return Roots.Last; 240 Frames_In_Root.Table (Roots.Table (B).First .. Roots.Table (B).Last)); 364 return Roots.Table (B).Nb_Alloc; 589 Roots.Table (B).Alloc_Size := V; [all …]
|
/dports/cad/zcad/zcad-8b8a693/cad_source/other/AGraphLaz/Test/Graph/ |
H A D | TestStrongDigraph.pas | 22 Roots: TClassList; 35 Roots.Add(FromVertex); 49 while SearchNumbers[TVertex(Roots.Last).Index] > SearchNumber do 50 Roots.Pop; 53 if FromVertex = Roots.Last then begin 63 Roots.Pop; 75 Roots:=TClassList.Create; 87 Roots.Free;
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 233 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 246 Roots.push_back(Pair); in CollectRoots() 253 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 297 if (Roots.empty()) in runOnFunction() 329 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 367 Roots[I].first->eraseFromParent(); in runOnFunction() 368 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 233 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 246 Roots.push_back(Pair); in CollectRoots() 253 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 297 if (Roots.empty()) in runOnFunction() 329 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 367 Roots[I].first->eraseFromParent(); in runOnFunction() 368 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/devel/llvm10/llvm-10.0.1.src/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 233 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 246 Roots.push_back(Pair); in CollectRoots() 253 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 297 if (Roots.empty()) in runOnFunction() 329 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 367 Roots[I].first->eraseFromParent(); in runOnFunction() 368 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 114 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 125 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 165 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 238 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 251 Roots.push_back(Pair); in CollectRoots() 258 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 306 if (Roots.empty()) in runOnFunction() 342 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 381 Roots[I].first->eraseFromParent(); in runOnFunction() 382 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 114 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 125 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 165 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 238 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 251 Roots.push_back(Pair); in CollectRoots() 258 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 306 if (Roots.empty()) in runOnFunction() 342 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 381 Roots[I].first->eraseFromParent(); in runOnFunction() 382 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 233 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 246 Roots.push_back(Pair); in CollectRoots() 253 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 297 if (Roots.empty()) in runOnFunction() 329 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 367 Roots[I].first->eraseFromParent(); in runOnFunction() 368 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/devel/llvm11/llvm-11.0.1.src/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 233 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 246 Roots.push_back(Pair); in CollectRoots() 253 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 297 if (Roots.empty()) in runOnFunction() 329 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 367 Roots[I].first->eraseFromParent(); in runOnFunction() 368 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 114 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 125 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 165 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 238 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 251 Roots.push_back(Pair); in CollectRoots() 258 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 306 if (Roots.empty()) in runOnFunction() 342 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 381 Roots[I].first->eraseFromParent(); in runOnFunction() 382 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 233 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 246 Roots.push_back(Pair); in CollectRoots() 253 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 297 if (Roots.empty()) in runOnFunction() 329 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 367 Roots[I].first->eraseFromParent(); in runOnFunction() 368 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 114 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 125 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 165 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 238 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 251 Roots.push_back(Pair); in CollectRoots() 258 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 306 if (Roots.empty()) in runOnFunction() 342 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 381 Roots[I].first->eraseFromParent(); in runOnFunction() 382 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 114 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 125 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 165 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 238 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 251 Roots.push_back(Pair); in CollectRoots() 258 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 306 if (Roots.empty()) in runOnFunction() 342 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 381 Roots[I].first->eraseFromParent(); in runOnFunction() 382 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/CodeGen/ |
H A D | ShadowStackGCLowering.cpp | 109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap() 120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap() 160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType() 233 assert(Roots.empty() && "Not cleaned up?"); in CollectRoots() 246 Roots.push_back(Pair); in CollectRoots() 253 Roots.insert(Roots.begin(), MetaRoots.begin(), MetaRoots.end()); in CollectRoots() 297 if (Roots.empty()) in runOnFunction() 329 AllocaInst *OriginalAlloca = Roots[I].second; in runOnFunction() 367 Roots[I].first->eraseFromParent(); in runOnFunction() 368 Roots[I].second->eraseFromParent(); in runOnFunction() [all …]
|