| /external/llvm-project/clang/include/clang/Analysis/Analyses/ |
| D | CFGReachabilityAnalysis.h | 36 ReachableMap reachable; variable
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | CFGReachabilityAnalysis.h | 36 ReachableMap reachable; variable
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | UnreachableCodeChecker.cpp | 52 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
171 CFGBlocksSet &reachable, in FindUnreachableEntryPoints()
|
| D | AnalyzerStatsChecker.cpp | 46 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; in checkEndAnalysis() local
|
| /external/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| D | UnreachableCodeChecker.cpp | 51 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
179 CFGBlocksSet &reachable, in FindUnreachableEntryPoints()
|
| D | AnalyzerStatsChecker.cpp | 45 llvm::SmallPtrSet<const CFGBlock*, 32> reachable; in checkEndAnalysis() local
|
| /external/libchrome/base/third_party/valgrind/ |
| D | memcheck.h | 203 #define VALGRIND_COUNT_LEAKS(leaked, dubious, reachable, suppressed) \ argument
225 #define VALGRIND_COUNT_LEAK_BLOCKS(leaked, dubious, reachable, suppressed) \ argument
|
| /external/rust/crates/bindgen/src/ir/analysis/ |
| D | template_params.rs | 389 let mut reachable = vec![i]; in new() localVariable
500 let mut reachable = vec![i]; in initial_worklist() localVariable
|
| D | mod.rs | 295 reachable: HashMap<Node, HashSet<Node>>, field
375 let reachable = analyze::<ReachableFrom>(&g); in monotone() localVariable
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | prog.cc | 562 SparseSet reachable(size()); in Flatten() local
647 SparseSet* reachable, std::vector<int>* stk) { in MarkSuccessors()
711 SparseSet* reachable, std::vector<int>* stk) { in MarkDominator()
774 SparseSet* reachable, std::vector<int>* stk) { in EmitList()
|
| /external/selinux/libselinux/src/ |
| D | get_context_list.c | 159 char ** reachable, in get_context_order()
397 char **reachable = NULL; in get_ordered_context_list() local
|
| /external/deqp-deps/SPIRV-Tools/source/val/ |
| D | basic_block.h | 68 bool reachable() const { return reachable_; } in reachable() function
|
| /external/swiftshader/third_party/SPIRV-Tools/source/val/ |
| D | basic_block.h | 68 bool reachable() const { return reachable_; } in reachable() function
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/val/ |
| D | basic_block.h | 68 bool reachable() const { return reachable_; } in reachable() function
|
| /external/mesa3d/src/compiler/nir/ |
| D | nir_lower_goto_ifs.c | 37 struct set *reachable; member
277 struct set *reachable = _mesa_set_clone(fork->paths[0].reachable, fork); in fork_reachable() local
546 select_fork(struct set *reachable, nir_function_impl *impl, bool need_var, in select_fork()
|
| /external/openscreen/third_party/abseil/src/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure() local
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST() local
|
| /external/libtextclassifier/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure() local
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST() local
|
| /external/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure() local
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST() local
|
| /external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure() local
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST() local
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure() local
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST() local
|
| /external/angle/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure() local
288 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST() local
|
| /external/clang/lib/Analysis/ |
| D | ReachableCode.cpp | 356 DeadCodeScan(llvm::BitVector &reachable, Preprocessor &PP) in DeadCodeScan()
646 llvm::BitVector reachable(cfg->getNumBlockIDs()); in FindUnreachableCode() local
|
| /external/tensorflow/tensorflow/compiler/xla/service/graphcycles/ |
| D | graphcycles.cc | 354 bool reachable = !ForwardDFS(r, x, ny->rank); in IsReachableNonConst() local
364 bool reachable = IsReachableNonConst(a, b); in CanContractEdge() local
|
| D | graphcycles_test.cc | 134 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure() local
307 bool reachable = IsReachable(&edges, nodes[from], nodes[to], &seen); in TEST() local
|
| /external/llvm-project/clang/lib/Analysis/ |
| D | ReachableCode.cpp | 399 DeadCodeScan(llvm::BitVector &reachable, Preprocessor &PP, ASTContext &C) in DeadCodeScan()
688 llvm::BitVector reachable(cfg->getNumBlockIDs()); in FindUnreachableCode() local
|