| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/testing/ |
| D | backtrack.cc | 83 PODArray<uint32_t> visited_; // bitmap: (Inst*, char*) pairs visited member in re2::Backtracker
131 visited_ = PODArray<uint32_t>(nvisited); in Search()
132 memset(visited_.data(), 0, nvisited*sizeof visited_[0]); in Search()
164 CHECK_LT(n/32, visited_.size()); in Visit()
165 if (visited_[n/32] & (1 << (n&31))) in Visit()
167 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | bitstate.cc | 67 PODArray<uint64_t> visited_; // bitmap: (list ID, char*) pairs visited member in re2::BitState
93 if (visited_[n/kVisitedBits] & (uint64_t{1} << (n & (kVisitedBits-1)))) in ShouldVisit()
95 visited_[n/kVisitedBits] |= uint64_t{1} << (n & (kVisitedBits-1)); in ShouldVisit()
311 visited_ = PODArray<uint64_t>(nvisited); in Search()
312 memset(visited_.data(), 0, nvisited*sizeof visited_[0]); in Search()
|
| /external/perfetto/src/trace_processor/importers/memory_tracker/ |
| D | graph.cc | 202 if (visited_.count(node) != 0) in next()
206 if (node->owns_edge() && visited_.count(node->owns_edge()->target()) == 0) in next()
210 if (node->parent() && visited_.count(node->parent()) == 0) in next()
226 visited_.insert(node); in next()
245 if (visited_.count(node) != 0) in next()
252 visited_.insert(node); in next()
|
| /external/deqp-deps/glslang/SPIRV/ |
| D | InReadableOrder.cpp | 77 if (visited_.count(block) || delayed_.count(block)) in visit()
80 visited_.insert(block); in visit()
121 std::unordered_set<Block *> visited_, delayed_; member in __anon976670f80111::ReadableOrderTraverser
|
| /external/angle/third_party/vulkan-deps/glslang/src/SPIRV/ |
| D | InReadableOrder.cpp | 77 if (visited_.count(block) || delayed_.count(block)) in visit()
80 visited_.insert(block); in visit()
121 std::unordered_set<Block *> visited_, delayed_; member in __anon68fdc7a50111::ReadableOrderTraverser
|
| /external/tensorflow/tensorflow/core/util/ |
| D | presized_cuckoo_map.h | 311 CuckooPathEntry parent = visited_[e.parent]; in CuckooInsert()
321 visited_[visited_end] = e; in CuckooInsert()
331 uint64 e_parent_bucket = visited_[e.parent].bucket; in CuckooInsert()
357 CuckooPathEntry visited_[kVisitedListSize]; variable
|
| /external/perfetto/include/perfetto/ext/trace_processor/importers/memory_tracker/ |
| D | graph.h | 243 std::set<const Node*> visited_; variable
258 std::set<Node*> visited_; variable
|
| /external/llvm-project/flang/include/flang/Semantics/ |
| D | tools.h | 440 bool visited() const { return visited_; } in ENUM_CLASS()
441 void set_visited(bool yes) { visited_ = yes; } in ENUM_CLASS()
459 bool visited_{false}; in ENUM_CLASS()
|
| /external/bcc/src/cc/frontends/clang/ |
| D | b_frontend_action.h | 91 std::set<clang::Expr *> visited_; variable
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | conditional_code_motion.cc | 72 while (!worklist_.empty() && ContainsKey(visited_, b.operands()[0])) { in PopNextBoundary()
76 visited_.insert(b.operands()[0]); in PopNextBoundary()
87 if (!ContainsKey(visited_, b.operands()[0])) { in HasNextBoundary()
98 absl::flat_hash_set<HloInstruction*> visited_; member in xla::conditional_opt::BoundaryVisitor
|