Home
last modified time | relevance | path

Searched refs:reachable (Results 1 - 25 of 48) sorted by relevance

12

/third_party/mesa3d/src/compiler/nir/
H A Dnir_lower_goto_ifs.c33 * It's "reachable" not in the sense that these are all the nodes reachable
37 struct set *reachable; member
39 /** Fork in the path, if reachable->entries > 1 */
140 if (_mesa_set_search(fork->paths[i].reachable, target)) { in set_path_vars()
167 if (_mesa_set_search(fork->paths[i].reachable, then_block)) { in set_path_vars_cond()
168 if (_mesa_set_search(fork->paths[i].reachable, else_block)) { in set_path_vars_cond()
208 if (_mesa_set_search(routing->regular.reachable, target)) { in route_to()
211 else if (_mesa_set_search(routing->brk.reachable, target)) { in route_to()
215 else if (_mesa_set_search(routing->cont.reachable, targe in route_to()
277 struct set *reachable = _mesa_set_clone(fork->paths[0].reachable, fork); fork_reachable() local
546 select_fork(struct set *reachable, nir_function_impl *impl, bool need_var, void *mem_ctx) select_fork() argument
[all...]
/third_party/selinux/libselinux/src/
H A Dget_context_list.c117 static int is_in_reachable(char **reachable, const char *usercon_str) in is_in_reachable() argument
119 if (!reachable) in is_in_reachable()
122 for (; *reachable != NULL; reachable++) { in is_in_reachable()
123 if (strcmp(*reachable, usercon_str) == 0) { in is_in_reachable()
133 char ***reachable, in get_context_user()
268 /* check whether usercon is already in reachable */ in get_context_user()
269 if (is_in_reachable(*reachable, usercon_str2)) { in get_context_user()
275 new_reachable = realloc(*reachable, (*nreachable + 2) * sizeof(char *)); in get_context_user()
281 *reachable in get_context_user()
130 get_context_user(FILE * fp, const char * fromcon, const char * user, char ***reachable, unsigned int *nreachable) get_context_user() argument
411 char **reachable = NULL; get_ordered_context_list() local
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dall-nodes.cc14 : reachable(local_zone), in AllNodes()
22 : reachable(local_zone), in AllNodes()
31 reachable.push_back(end); in Mark()
32 // Find all nodes reachable from {end}. in Mark()
33 for (size_t i = 0; i < reachable.size(); i++) { in Mark()
34 for (Node* const input : reachable[i]->inputs()) { in Mark()
41 reachable.push_back(input); in Mark()
45 for (Node* use : reachable[i]->uses()) { in Mark()
51 reachable.push_back(use); in Mark()
H A Dall-nodes.h15 // A helper utility that traverses the graph and gathers all nodes reachable
19 // Constructor. Traverses the graph and builds the {reachable} set of nodes
20 // reachable from {end}. When {only_inputs} is true, find the nodes
21 // reachable through input edges; these are all live nodes.
24 // Constructor. Traverses the graph and builds the {reachable} set of nodes
25 // reachable from the End node.
39 NodeVector reachable; // Nodes reachable from end. member in v8::internal::compiler::AllNodes
/third_party/gn/tools/
H A Dfind_unreachable.py14 # Lists all targets that are not reachable from //:all or //ci:test_all:
26 reachable = set()
30 if next in reachable:
32 reachable.add(next)
34 return reachable
57 and all their recursive dependencies are considered reachable.\
67 reachable = find_reachable_targets(cmd_args.roots, targets_graph)
69 unreachable = all - reachable
/third_party/rust/crates/bindgen/bindgen/ir/analysis/
H A Dmod.rs216 // Here we find the set of nodes that are reachable from any given
250 // reachable from it within the test graph:
299 reachable: HashMap<Node, HashSet<Node>>,
312 reachable: Default::default(),
323 // The set of nodes reachable from a node `x` is in constrain()
325 // reachable(x) = s_0 U s_1 U ... U reachable(s_0) U reachable(s_1) U ... in constrain()
333 .reachable in constrain()
339 self.reachable in constrain()
[all...]
H A Dtemplate_params.rs158 // The set of allowlisted items, without any blocklisted items reachable
389 let mut reachable = vec![i]; in new() variables
393 reachable.push(s); in new()
397 reachable in new()
465 // reachable from allowlisted items. in new()
503 let mut reachable = vec![i]; in initial_worklist() variables
507 reachable.push(s); in initial_worklist()
511 reachable in initial_worklist()
/third_party/skia/third_party/externals/spirv-tools/source/val/
H A Dvalidate_cfg.cpp467 bool target_reachable = target_block->reachable(); in FindCaseFallThrough()
477 if (target_reachable && block->reachable() && in FindCaseFallThrough()
550 if (header->reachable() && target_block->reachable() && in StructuredSwitchChecks()
654 if (!block->reachable()) continue; in ValidateStructuredSelections()
709 if (!loop_header->reachable()) continue; in StructuredControlFlowChecks()
726 if (header->reachable() && !merge) { in StructuredControlFlowChecks()
736 // If the exit block is reachable then it's dominated by the in StructuredControlFlowChecks()
738 if (merge && merge->reachable()) { in StructuredControlFlowChecks()
755 // post-dominance only make sense when the construct is reachable in StructuredControlFlowChecks()
[all...]
H A Dvalidate_id.cpp73 if (use_block->reachable() == false) continue; in CheckIdDefinitionDominateUse()
110 if (phi->block()->reachable() == false) continue; in CheckIdDefinitionDominateUse()
115 if (variable->block() && parent->reachable() && in CheckIdDefinitionDominateUse()
H A Dbasic_block.h67 /// Returns true if the block is reachable in the CFG
68 bool reachable() const { return reachable_; } in reachable() function in spvtools::val::BasicBlock
226 /// True if the block is reachable in the CFG
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/
H A Dvalidate_cfg.cpp467 bool target_reachable = target_block->reachable(); in FindCaseFallThrough()
477 if (target_reachable && block->reachable() && in FindCaseFallThrough()
550 if (header->reachable() && target_block->reachable() && in StructuredSwitchChecks()
654 if (!block->reachable()) continue; in ValidateStructuredSelections()
709 if (!loop_header->reachable()) continue; in StructuredControlFlowChecks()
726 if (header->reachable() && !merge) { in StructuredControlFlowChecks()
736 // If the exit block is reachable then it's dominated by the in StructuredControlFlowChecks()
738 if (merge && merge->reachable()) { in StructuredControlFlowChecks()
755 // post-dominance only make sense when the construct is reachable in StructuredControlFlowChecks()
[all...]
H A Dvalidate_id.cpp73 if (use_block->reachable() == false) continue; in CheckIdDefinitionDominateUse()
110 if (phi->block()->reachable() == false) continue; in CheckIdDefinitionDominateUse()
115 if (variable->block() && parent->reachable() && in CheckIdDefinitionDominateUse()
H A Dbasic_block.h67 /// Returns true if the block is reachable in the CFG
68 bool reachable() const { return reachable_; } in reachable() function in spvtools::val::BasicBlock
226 /// True if the block is reachable in the CFG
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles_test.cc49 // Return whether "to" is reachable from "from".
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure() local
123 if (gc_reachable != reachable) { in CheckTransitiveClosure()
128 ABSL_RAW_LOG(FATAL, "gc_reachable %s reachable %s a %d b %d", in CheckTransitiveClosure()
130 reachable ? "true" : "false", a, b); in CheckTransitiveClosure()
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST() local
291 ASSERT_EQ(path_len != 0, reachable); in TEST()
/third_party/skia/third_party/externals/swiftshader/src/Pipeline/
H A DSpirvShaderControlFlow.cpp120 void SpirvShader::Function::TraverseReachableBlocks(Block::ID id, SpirvShader::Block::Set &reachable) const in TraverseReachableBlocks()
122 if(reachable.count(id) == 0) in TraverseReachableBlocks()
124 reachable.emplace(id); in TraverseReachableBlocks()
127 TraverseReachableBlocks(out, reachable); in TraverseReachableBlocks()
134 Block::Set reachable; in AssignBlockFields() local
135 TraverseReachableBlocks(entry, reachable); in AssignBlockFields()
141 if(reachable.count(blockId) > 0) in AssignBlockFields()
/third_party/spirv-tools/source/val/
H A Dvalidate_id.cpp62 if (use_block->reachable() == false) continue; in CheckIdDefinitionDominateUse()
99 if (phi->block()->reachable() == false) continue; in CheckIdDefinitionDominateUse()
104 if (variable->block() && parent->reachable() && in CheckIdDefinitionDominateUse()
H A Dbasic_block.h87 /// Returns true if the block is reachable in the CFG.
88 bool reachable() const { return reachable_; } in reachable() function in spvtools::val::BasicBlock
90 /// Returns true if the block is structurally reachable in the CFG.
291 /// True if the block is reachable in the CFG
294 /// True if the block is structurally reachable in the CFG
/third_party/libcoap/scripts/
H A Dbuild.sh68 LD_LIBRARY_PATH=$TEST_LD_LIBRARY_PATH libtool --mode=execute valgrind --track-origins=yes --leak-check=yes --show-reachable=yes --error-exitcode=123 --quiet --suppressions=tests/valgrind_suppression $EXEC_FILE
/third_party/skia/third_party/externals/spirv-tools/test/val/
H A Dval_cfg_test.cpp188 // In this case, the loop is reachable from a node without a predecessor, in TEST_P()
224 // In this case, the loop is not reachable from a node without a in TEST_P()
676 // If a merge block is reachable, then it must be strictly dominated by in TEST_P()
4313 ASSERT_TRUE(entry->reachable()); in TEST_F()
4315 ASSERT_TRUE(end->reachable()); in TEST_F()
4355 ASSERT_TRUE(b6->reachable()); in TEST_F()
4356 ASSERT_TRUE(b7->reachable()); in TEST_F()
4357 ASSERT_TRUE(b8->reachable()); in TEST_F()
4358 ASSERT_TRUE(b9->reachable()); in TEST_F()
4359 ASSERT_TRUE(b10->reachable()); in TEST_F()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/val/
H A Dval_cfg_test.cpp188 // In this case, the loop is reachable from a node without a predecessor, in TEST_P()
224 // In this case, the loop is not reachable from a node without a in TEST_P()
676 // If a merge block is reachable, then it must be strictly dominated by in TEST_P()
4313 ASSERT_TRUE(entry->reachable()); in TEST_F()
4315 ASSERT_TRUE(end->reachable()); in TEST_F()
4355 ASSERT_TRUE(b6->reachable()); in TEST_F()
4356 ASSERT_TRUE(b7->reachable()); in TEST_F()
4357 ASSERT_TRUE(b8->reachable()); in TEST_F()
4358 ASSERT_TRUE(b9->reachable()); in TEST_F()
4359 ASSERT_TRUE(b10->reachable()); in TEST_F()
[all...]
/third_party/spirv-tools/test/val/
H A Dval_cfg_test.cpp186 // In this case, the loop is reachable from a node without a predecessor, in TEST_P()
222 // In this case, the loop is not reachable from a node without a in TEST_P()
642 // If a merge block is reachable, then it must be strictly dominated by in TEST_P()
4390 ASSERT_TRUE(entry->reachable()); in TEST_F()
4392 ASSERT_TRUE(end->reachable()); in TEST_F()
4432 ASSERT_TRUE(b6->reachable()); in TEST_F()
4433 ASSERT_TRUE(b7->reachable()); in TEST_F()
4434 ASSERT_TRUE(b8->reachable()); in TEST_F()
4435 ASSERT_TRUE(b9->reachable()); in TEST_F()
4436 ASSERT_TRUE(b10->reachable()); in TEST_F()
[all...]
/third_party/skia/third_party/externals/swiftshader/src/Shader/
H A DShader.cpp1957 bool reachable; // Is this function reachable?
1968 functions[MAIN_ID].reachable = true;
2025 functions[id].reachable = true;
2082 // Assert that every function is reachable (these should have been
2089 for (const auto &it : functions) { ASSERT(it.second.reachable); }
/third_party/ltp/testcases/network/iproute/
H A Dip_tests.sh131 ip neigh replace $taddr lladdr 00:00:00:00:00:00 dev $tdev nud reachable
/third_party/python/PCbuild/
H A Drt.bat7 rem after deleting all the .pyc files reachable from Lib/.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DMachineVerifier.cpp132 // Is this MBB reachable from the MF entry point?
133 bool reachable = false; member
569 if (!MInfo.reachable) { in markReachable()
570 MInfo.reachable = true; in markReachable()
2138 if (!MInfo.reachable) in calcRegsPassed()
2243 if (MInfo.reachable) { in checkPHIOps()
2246 if (!MO0.isUndef() && PrInfo.reachable && in checkPHIOps()
2253 if (MInfo.reachable) { in checkPHIOps()

Completed in 30 milliseconds

12