| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| DenseMapTest.cpp | 147 bool visited[100]; local
151 visited[i] = false;
158 visited[it->first] = true;
161 // Ensure every number was visited.
163 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
|
| StringMapTest.cpp | 145 bool visited[100]; local
152 visited[i] = false;
161 visited[it->second] = true;
164 // Ensure every number was visited.
166 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAOptimizer.java | 128 protected Set visited = new HashSet(); field in class:DFAOptimizer
157 visited.clear();
172 visited.clear();
177 visited.clear();
186 if ( visited.contains(sI) ) {
187 return; // already visited
189 visited.add(sI);
216 if ( visited.contains(sI) ) {
217 return; // already visited
219 visited.add(sI)
[all...] |
| MachineProbe.java | 49 Set<DFAState> visited = new HashSet<DFAState>(); local
50 return getAnyDFAPathToTarget(dfa.startState, targetState, visited);
54 DFAState targetState, Set<DFAState> visited) {
56 visited.add(startState);
65 if (!visited.contains(e.target)) {
67 (DFAState) e.target, targetState, visited);
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 82 Set<Node> visited = new OrderedHashSet<Node>(); local
84 while ( visited.size() < nodes.size() ) {
89 if ( !visited.contains(n) ) break;
91 DFS(n, visited, sorted);
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) {
97 if ( visited.contains(n) ) return;
98 visited.add(n);
102 DFS(target, visited, sorted);
|
| /external/guava/guava/src/com/google/common/reflect/ |
| TypeVisitor.java | 53 * <p>One {@code Type} is visited at most once. The second time the same type is visited, it's
63 private final Set<Type> visited = Sets.newHashSet(); field in class:TypeVisitor
71 if (type == null || !visited.add(type)) {
72 // null owner type, or already visited;
93 visited.remove(type);
|
| /art/compiler/optimizing/ |
| licm.cc | 85 ArenaBitVector* visited = nullptr; local
87 visited = new (graph_->GetAllocator()) ArenaBitVector(graph_->GetAllocator(),
108 // Thanks to post order visit, inner loops were already visited.
109 DCHECK(visited->IsBitSet(inner->GetBlockId()));
113 visited->SetBit(inner->GetBlockId());
|
| /art/runtime/ |
| handle_scope_test.cc | 81 visited.insert(ref);
86 std::set<StackReference<mirror::Object>*> visited; member in class:art::CollectVisitor
115 EXPECT_LE(visitor.visited.size(), base->NumberOfReferences());
117 for (StackReference<mirror::Object>* ref : visitor.visited) {
|
| /system/tools/hidl/ |
| AST.cpp | 130 std::unordered_set<const Type*> visited; local
136 &visited);
157 std::unordered_set<const Type*> visited;
179 &visited);
183 std::unordered_set<const Type*> visited;
196 &visited);
229 std::unordered_set<const Type*> visited;
238 &visited);
242 std::unordered_set<const Type*> visited;
243 return mRootScope.recursivePass(&Type::resolveInheritance, &visited);
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| UnreachableCodeChecker.cpp | 10 // path-sensitive analysis. We mark any path visited, and then walk the CFG as a
11 // post-analysis to determine what was never visited.
43 CFGBlocksSet &visited);
52 CFGBlocksSet reachable, visited; local
107 if (!visited.count(CB->getBlockID()))
108 FindUnreachableEntryPoints(CB, reachable, visited);
172 CFGBlocksSet &visited) {
173 visited.insert(CB->getBlockID());
184 if (!visited.count((*I)->getBlockID()))
185 // If we haven't previously visited the unreachable predecessor, recurs
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 113 &visited = t2; local
115 visited.clear();
116 visited.setBit(from);
119 if (visited.setBit(idx))
122 return targets.intersectsWith(visited);
|
| /external/pdfium/core/fpdfapi/page/ |
| cpdf_page.cpp | 101 std::set<CPDF_Dictionary*> visited; local
103 visited.insert(pPageDict);
108 if (!pPageDict || pdfium::ContainsKey(visited, pPageDict))
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| DominanceFrontier.cpp | 45 SmallPtrSet<BasicBlock *, 32> visited; local
61 if (visited.count(currentBB) == 0) {
62 visited.insert(currentBB);
81 if (visited.count(childBB) == 0) {
88 // If all children are visited or there is any child then pop this block
|
| /external/tensorflow/tensorflow/core/grappler/ |
| grappler_item.cc | 144 std::unordered_set<const NodeDef*> visited; local
149 if (!visited.insert(node).second) {
150 // The node has already been visited.
|
| /frameworks/base/sax/java/android/sax/ |
| Element.java | 40 boolean visited; field in class:Element
180 requiredChildren.get(i).visited = false;
193 if (!child.visited) {
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
| ContactAggregatorHelper.java | 98 Set<Long> visited = new ArraySet<>(); local
100 if (!visited.contains(id)) {
102 findConnectedComponentForRawContact(matchingRawIdPairs, visited, id, set);
110 Set<Long> visited, Long rawContactId, Set<Long> results) {
111 visited.add(rawContactId);
114 if (!visited.contains(match)) {
115 findConnectedComponentForRawContact(connections, visited, match, results);
|
| /art/runtime/gc/ |
| verification.cc | 159 explicit BFSFindReachable(ObjectSet* visited) : visited_(visited) {}
198 CollectRootVisitor(ObjectSet* visited, WorkQueue* work) : visited_(visited), work_(work) {}
216 std::set<mirror::Object*> visited; local
219 CollectRootVisitor root_visitor(&visited, &work);
228 BFSFindReachable visitor(&visited);
|
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 159 SmallPtrSet<BlockT *, 32> visited; local
175 if (visited.insert(currentBB).second) {
195 if (visited.count(childBB) == 0) {
202 // If all children are visited or there is any child then pop this block
|
| /external/llvm/lib/CodeGen/ |
| CalcSpillWeights.cpp | 139 SmallPtrSet<MachineInstr*, 8> visited; local
158 if (!visited.insert(mi).second)
|
| /external/llvm/unittests/ADT/ |
| DenseMapTest.cpp | 309 bool visited[100]; local
314 visited[i] = false;
323 visited[visitedIndex[it->first]] = true;
325 // Ensure every number was visited.
327 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| CalcSpillWeights.cpp | 97 SmallPtrSet<MachineInstr*, 8> visited; local
113 if (!visited.insert(mi))
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 221 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
234 unsigned oldSize = visited.size();
235 visited.insert(N);
236 if (visited.size() != oldSize) {
241 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
255 DenseSet<SDNode *> visited; local
257 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
260 setSubgraphColorHelper(N, "blue", visited, 0, printed);
262 setSubgraphColorHelper(N, "green", visited, 0, printed);
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| call_graph.cc | 139 tensorflow::gtl::FlatSet<const HloComputation*>* visited) const {
140 if (a == b || ContainsKey(*visited, b)) {
141 // The call graph is guaranteed to be acyclic so any previously visited node
153 visited->insert(b);
155 if (!DominatesHelper(a, b_caller, visited)) {
164 tensorflow::gtl::FlatSet<const HloComputation*> visited; local
165 return DominatesHelper(a, b, &visited);
278 tensorflow::gtl::FlatSet<const CallGraphNode*>* visited) const {
279 auto pair = visited->insert(&node);
281 // Node was not inserted. Node has already been visited
295 tensorflow::gtl::FlatSet<const CallGraphNode*> visited; local
[all...] |
| computation_tracker.cc | 94 std::set<VersionedComputationHandle> visited; local
98 ComputeComputationPostOrder(entry_versioned_handle, &visited, &post_order);
149 std::set<VersionedComputationHandle>* visited,
151 if (visited->count(versioned_handle) > 0) {
152 CHECK_EQ(1, visited->count(versioned_handle));
162 ComputeComputationPostOrder(embedded_handle, visited, post_order);
165 visited->insert(versioned_handle);
185 std::set<VersionedComputationHandle> visited; local
187 ComputeComputationPostOrder(entry_handle, &visited, &post_order);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 159 SmallPtrSet<BlockT *, 32> visited; local
175 if (visited.insert(currentBB).second) {
195 if (visited.count(childBB) == 0) {
202 // If all children are visited or there is any child then pop this block
|
