/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/tutorials/output/ |
H A D | ex1_bcastop_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
|
H A D | ex1_2_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
|
H A D | ex1_4_stride.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
|
H A D | ex1_5_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
|
H A D | ex1_5_stride.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
|
H A D | ex1_5.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
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 385 RootsT Roots; in FindRoots() local 390 return Roots; in FindRoots() 413 Roots.push_back(N); in FindRoots() 499 return Roots; in FindRoots() 518 auto &Root = Roots[i]; in RemoveRedundantRoots() 533 if (llvm::find(Roots, N) != Roots.end()) { in RemoveRedundantRoots() 538 Roots.pop_back(); in RemoveRedundantRoots() 683 if (RIt == DT.Roots.end()) in UpdateRootsBeforeInsertion() 711 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 718 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 385 RootsT Roots; in FindRoots() local 390 return Roots; in FindRoots() 413 Roots.push_back(N); in FindRoots() 499 return Roots; in FindRoots() 518 auto &Root = Roots[i]; in RemoveRedundantRoots() 533 if (llvm::find(Roots, N) != Roots.end()) { in RemoveRedundantRoots() 538 Roots.pop_back(); in RemoveRedundantRoots() 691 if (RIt == DT.Roots.end()) in UpdateRootsBeforeInsertion() 719 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 726 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 385 RootsT Roots; in FindRoots() local 390 return Roots; in FindRoots() 413 Roots.push_back(N); in FindRoots() 499 return Roots; in FindRoots() 518 auto &Root = Roots[i]; in RemoveRedundantRoots() 533 if (llvm::find(Roots, N) != Roots.end()) { in RemoveRedundantRoots() 538 Roots.pop_back(); in RemoveRedundantRoots() 683 if (RIt == DT.Roots.end()) in UpdateRootsBeforeInsertion() 711 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 718 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 385 RootsT Roots; in FindRoots() local 390 return Roots; in FindRoots() 413 Roots.push_back(N); in FindRoots() 499 return Roots; in FindRoots() 518 auto &Root = Roots[i]; in RemoveRedundantRoots() 533 if (llvm::find(Roots, N) != Roots.end()) { in RemoveRedundantRoots() 538 Roots.pop_back(); in RemoveRedundantRoots() 691 if (RIt == DT.Roots.end()) in UpdateRootsBeforeInsertion() 719 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 726 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 385 RootsT Roots; in FindRoots() local 390 return Roots; in FindRoots() 413 Roots.push_back(N); in FindRoots() 499 return Roots; in FindRoots() 518 auto &Root = Roots[i]; in RemoveRedundantRoots() 533 if (llvm::find(Roots, N) != Roots.end()) { in RemoveRedundantRoots() 538 Roots.pop_back(); in RemoveRedundantRoots() 691 if (RIt == DT.Roots.end()) in UpdateRootsBeforeInsertion() 719 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 726 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 352 RootsT Roots; in FindRoots() local 357 return Roots; in FindRoots() 380 Roots.push_back(N); in FindRoots() 497 return Roots; in FindRoots() 516 auto &Root = Roots[i]; in RemoveRedundantRoots() 531 if (llvm::find(Roots, N) != Roots.end()) { in RemoveRedundantRoots() 536 Roots.pop_back(); in RemoveRedundantRoots() 690 if (RIt == DT.Roots.end()) in UpdateRootsBeforeInsertion() 718 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 725 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 385 RootsT Roots; in FindRoots() local 390 return Roots; in FindRoots() 413 Roots.push_back(N); in FindRoots() 499 return Roots; in FindRoots() 518 auto &Root = Roots[i]; in RemoveRedundantRoots() 533 if (llvm::find(Roots, N) != Roots.end()) { in RemoveRedundantRoots() 538 Roots.pop_back(); in RemoveRedundantRoots() 691 if (RIt == DT.Roots.end()) in UpdateRootsBeforeInsertion() 719 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 726 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/compiler/src/ |
H A D | beam_digraph.erl | 238 {Roots, Component} = sc_2([V], G, V, Roots0, []), 239 sc_1(Vs, G, Roots, Components#{ V => Component }); 240 sc_1([V | Vs], G, Roots, Components0) -> 242 Root = map_get(V, Roots), 245 sc_1(Vs, G, Roots, Components); 249 sc_2([V | Vs], G, Root, Roots, Acc) when not is_map_key(V, Roots) -> 251 sc_2(in_neighbours(G, V) ++ Vs, G, Root, Roots#{ V => Root }, [V | Acc]); 252 sc_2([_V | Vs], G, Root, Roots, Acc) -> 254 sc_2(Vs, G, Root, Roots, Acc); 255 sc_2([], _G, _Root, Roots, Acc) -> [all …]
|
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/compiler/src/ |
H A D | beam_digraph.erl | 238 {Roots, Component} = sc_2([V], G, V, Roots0, []), 239 sc_1(Vs, G, Roots, Components#{ V => Component }); 240 sc_1([V | Vs], G, Roots, Components0) -> 242 Root = map_get(V, Roots), 245 sc_1(Vs, G, Roots, Components); 249 sc_2([V | Vs], G, Root, Roots, Acc) when not is_map_key(V, Roots) -> 251 sc_2(in_neighbours(G, V) ++ Vs, G, Root, Roots#{ V => Root }, [V | Acc]); 252 sc_2([_V | Vs], G, Root, Roots, Acc) -> 254 sc_2(Vs, G, Root, Roots, Acc); 255 sc_2([], _G, _Root, Roots, Acc) -> [all …]
|
/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/compiler/src/ |
H A D | beam_digraph.erl | 238 {Roots, Component} = sc_2([V], G, V, Roots0, []), 239 sc_1(Vs, G, Roots, Components#{ V => Component }); 240 sc_1([V | Vs], G, Roots, Components0) -> 242 Root = map_get(V, Roots), 245 sc_1(Vs, G, Roots, Components); 249 sc_2([V | Vs], G, Root, Roots, Acc) when not is_map_key(V, Roots) -> 251 sc_2(in_neighbours(G, V) ++ Vs, G, Root, Roots#{ V => Root }, [V | Acc]); 252 sc_2([_V | Vs], G, Root, Roots, Acc) -> 254 sc_2(Vs, G, Root, Roots, Acc); 255 sc_2([], _G, _Root, Roots, Acc) -> [all …]
|
/dports/lang/erlang/otp-OTP-24.1.7/lib/compiler/src/ |
H A D | beam_digraph.erl | 238 {Roots, Component} = sc_2([V], G, V, Roots0, []), 239 sc_1(Vs, G, Roots, Components#{ V => Component }); 240 sc_1([V | Vs], G, Roots, Components0) -> 242 Root = map_get(V, Roots), 245 sc_1(Vs, G, Roots, Components); 249 sc_2([V | Vs], G, Root, Roots, Acc) when not is_map_key(V, Roots) -> 251 sc_2(in_neighbours(G, V) ++ Vs, G, Root, Roots#{ V => Root }, [V | Acc]); 252 sc_2([_V | Vs], G, Root, Roots, Acc) -> 254 sc_2(Vs, G, Root, Roots, Acc); 255 sc_2([], _G, _Root, Roots, Acc) -> [all …]
|
/dports/lang/erlang-java/otp-OTP-24.1.7/lib/compiler/src/ |
H A D | beam_digraph.erl | 238 {Roots, Component} = sc_2([V], G, V, Roots0, []), 239 sc_1(Vs, G, Roots, Components#{ V => Component }); 240 sc_1([V | Vs], G, Roots, Components0) -> 242 Root = map_get(V, Roots), 245 sc_1(Vs, G, Roots, Components); 249 sc_2([V | Vs], G, Root, Roots, Acc) when not is_map_key(V, Roots) -> 251 sc_2(in_neighbours(G, V) ++ Vs, G, Root, Roots#{ V => Root }, [V | Acc]); 252 sc_2([_V | Vs], G, Root, Roots, Acc) -> 254 sc_2(Vs, G, Root, Roots, Acc); 255 sc_2([], _G, _Root, Roots, Acc) -> [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/dm/impls/plex/tests/output/ |
H A D | ex1_part_simple_1.out | 1023 [0] Roots referenced by my leaves, by rank 1031 [1] Roots referenced by my leaves, by rank 1043 [2] Roots referenced by my leaves, by rank 1051 [3] Roots referenced by my leaves, by rank 1064 [4] Roots referenced by my leaves, by rank 1067 [5] Roots referenced by my leaves, by rank 1075 [6] Roots referenced by my leaves, by rank 1082 [7] Roots referenced by my leaves, by rank
|
/dports/science/PETSc/petsc-3.14.1/src/mat/tests/output/ |
H A D | ex134_1.out | 23 [0] Roots referenced by my leaves, by rank 27 [1] Roots referenced by my leaves, by rank 61 [0] Roots referenced by my leaves, by rank 65 [1] Roots referenced by my leaves, by rank 98 [0] Roots referenced by my leaves, by rank 102 [1] Roots referenced by my leaves, by rank 132 [0] Roots referenced by my leaves, by rank 136 [1] Roots referenced by my leaves, by rank
|
/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/tests/output/ |
H A D | ex2_1_window.out | 11 [0] Roots referenced by my leaves, by rank 15 [1] Roots referenced by my leaves, by rank 27 [0] Roots referenced by my leaves, by rank 30 [1] Roots referenced by my leaves, by rank
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUPropagateAttributes.cpp | 117 SmallSet<Function *, 32> Roots; member in __anon8fb9fc340111::AMDGPUPropagateAttributes 216 Roots.insert(&F); in process() 218 return Roots.empty() ? false : process(); in process() 222 Roots.insert(&F); in process() 231 assert(!Roots.empty()); in process() 232 Module &M = *(*Roots.begin())->getParent(); in process() 235 Roots.insert(NewRoots.begin(), NewRoots.end()); in process() 260 if (!Roots.count(Caller) && !NewRoots.count(Caller)) in process() 266 if (!Roots.count(&F)) in process() 309 Roots.clear(); in process()
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 352 RootsT Roots; in FindRoots() local 357 return Roots; in FindRoots() 380 Roots.push_back(N); in FindRoots() 497 return Roots; in FindRoots() 516 auto &Root = Roots[i]; in RemoveRedundantRoots() 536 Roots.pop_back(); in RemoveRedundantRoots() 588 if (DT.Roots.empty()) return; in CalculateFromScratch() 667 DT.Roots.push_back(From); in InsertEdge() 717 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 724 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 352 RootsT Roots; in FindRoots() local 357 return Roots; in FindRoots() 380 Roots.push_back(N); in FindRoots() 497 return Roots; in FindRoots() 516 auto &Root = Roots[i]; in RemoveRedundantRoots() 536 Roots.pop_back(); in RemoveRedundantRoots() 588 if (DT.Roots.empty()) return; in CalculateFromScratch() 667 DT.Roots.push_back(From); in InsertEdge() 717 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 724 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 352 RootsT Roots; in FindRoots() local 357 return Roots; in FindRoots() 380 Roots.push_back(N); in FindRoots() 497 return Roots; in FindRoots() 516 auto &Root = Roots[i]; in RemoveRedundantRoots() 536 Roots.pop_back(); in RemoveRedundantRoots() 588 if (DT.Roots.empty()) return; in CalculateFromScratch() 667 DT.Roots.push_back(From); in InsertEdge() 717 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { in UpdateRootsAfterUpdate() 724 if (!isPermutation(DT.Roots, Roots)) { in UpdateRootsAfterUpdate() [all …]
|