| /external/llvm/lib/CodeGen/ |
| PrologEpilogInserter.cpp | 373 // Visited will contain all the basic blocks that are in the region
380 SmallPtrSet<MachineBasicBlock *, 8> Visited;
390 Visited.insert(Entry);
392 Visited.insert(Save);
396 // By construction Restore cannot be visited, otherwise it
407 // Enqueue all the successors not already visited.
410 if (Visited.insert(SuccBB).second)
417 for (MachineBasicBlock *MBB : Visited) {
826 "DFS stack predecessor is already visited.\n");
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyPEI.cpp | 389 // Visited will contain all the basic blocks that are in the region
396 SmallPtrSet<MachineBasicBlock *, 8> Visited;
406 Visited.insert(Entry);
408 Visited.insert(Save);
412 // By construction Restore cannot be visited, otherwise it
423 // Enqueue all the successors not already visited.
426 if (Visited.insert(SuccBB).second)
433 for (MachineBasicBlock *MBB : Visited) {
842 "DFS stack predecessor is already visited.\n");
[all...] |
| /art/compiler/optimizing/ |
| gvn.cc | 386 // Returns false if the GlobalValueNumberer has already visited all blocks
390 // Iterates over visited blocks and finds one which has a ValueSet such that:
402 // visited/unvisited boolean.
413 // visited before the block itself.
499 // which hasn't been visited yet due to the order we visit instructions.
|
| graph_checker.cc | 674 static bool IsConstantEquivalent(HInstruction* insn1, HInstruction* insn2, BitVector* visited) {
679 if (visited->IsBitSet(insn1->GetId())) {
682 visited->SetBit(insn1->GetId());
685 if (!IsConstantEquivalent(insn1->InputAt(i), insn2->InputAt(i), visited)) {
821 ArenaBitVector& visited = visited_storage_; local
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
64 /// that functions already visited in a bottom-up order of the SCC DAG are no
65 /// longer valid to have visited, or such that functions not yet visited in
67 /// visited.
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUtils.cpp | 71 SmallPtrSetImpl<Instruction *> &Visited,
86 Visited.insert(Phi);
96 SmallPtrSetImpl<Instruction *> &Visited,
117 if (Visited.count(J)) {
122 // If the operand is not in Visited, it is not a reduction operation, but
|
| /build/tools/droiddoc/templates-sdk-dev/ |
| customizations.cs | 118 <h2>Most visited</h2>
119 <div class="resource-flow-layout" data-history-query="history:most/visited" data-maxresults="3" data-cardsizes="18x2"></div>
123 <h2>Recently visited</h2>
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| DOTGenerator.java | 51 * which states we've visited. Make a new set every time you start
115 return; // already visited this node
165 return; // already visited this node
|
| /external/chromium-trace/catapult/third_party/Paste/paste/ |
| recursive.py | 47 "Forwarding loop detected; %r visited twice (internal "
128 If you ran this application and visited ``/hello`` you would get a
129 ``Hello World!`` message. If you ran the application and visited
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CoreEngine.h | 72 /// number of times different CFGBlocks have been visited along a path.
75 /// The locations where we stopped doing work because we visited a location
190 /// visited on the exploded graph path.
|
| /external/doclava/res/assets/templates/assets/ |
| doclava-developer-core.css | 41 a:visited,
42 a:visited code {
477 #footerlinks a:visited {
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| AbstractScheduledService.java | 64 * private Set<Uri> visited;
73 * visited.add(uri);
75 * if (!visited.contains(newUri)) { toCrawl.add(newUri); }
|
| /external/jacoco/org.jacoco.doc/docroot/doc/ |
| flow.html | 170 visited. From this edge we can conclude to other preceding nodes and edges:
174 <li>If a edge has been visited, we know that the source node of the this edge
177 we know that this edge has been visited.</li>
|
| /external/llvm/lib/Analysis/ |
| BasicAliasAnalysis.cpp | 475 assert(Visited.empty() && "Visited must be cleared after use!");
482 if (!Visited.insert(V).second) {
483 Visited.clear();
497 Visited.clear();
515 Visited.clear();
524 Visited.clear();
529 Visited.clear();
[all...] |
| CaptureTracking.cpp | 216 SmallSet<const Use *, Threshold> Visited;
226 Visited.insert(&U);
287 if (Visited.insert(&UU).second)
|
| /external/llvm/lib/Transforms/Scalar/ |
| AlignmentFromAssumptions.cpp | 314 SmallPtrSet<Instruction *, 32> Visited;
402 Visited.insert(J);
405 if (!Visited.count(K) && isValidAssumeForContext(ACall, K, DT))
|
| LoopRerollPass.cpp | [all...] |
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPIteratorImpl.java | 216 /** the currently visited node */
241 * @param visitedNode the currently visited node
341 // if its the first child visited or the former child is finished
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| expr.go | 853 visited := make(map[int64]bool, len(elts))
877 if visited[index] {
880 visited[index] = true
1027 visited := make([]bool, len(fields))
1047 if visited[i] {
1051 visited[i] = true
1104 visited := make(map[interface{}][]Type, len(e.Elts))
1122 for _, vtyp := range visited[x.val] {
1128 visited[x.val] = append(visited[x.val], x.typ
[all...] |
| /prebuilts/go/linux-x86/src/go/types/ |
| expr.go | 853 visited := make(map[int64]bool, len(elts))
877 if visited[index] {
880 visited[index] = true
1027 visited := make([]bool, len(fields))
1047 if visited[i] {
1051 visited[i] = true
1104 visited := make(map[interface{}][]Type, len(e.Elts))
1122 for _, vtyp := range visited[x.val] {
1128 visited[x.val] = append(visited[x.val], x.typ
[all...] |
| /external/llvm/lib/IR/ |
| Value.cpp | 430 SmallPtrSet<Value *, 4> Visited;
432 Visited.insert(V);
462 } while (Visited.insert(V).second);
491 SmallPtrSet<Value *, 4> Visited;
492 Visited.insert(this);
511 } while (Visited.insert(V).second);
|
| /external/mesa3d/src/glsl/ |
| lower_jumps.cpp | 253 * characteristics of the visited statement.
256 * strength_none, the visited node is at the end of its exec_list.
258 * visited statement in its exec_list have been removed.
260 * CONTAINED_JUMPS_LOWERED: If the visited statement contains other
498 * foreach_list() isn't safe if the node being visited gets
564 * jump will be visited next, and it will be lowered if
[all...] |
| /frameworks/base/docs/html/ndk/reference/ |
| doxygen.css | 118 .contents a:visited {
137 .contents a.qindexHL:visited {
148 a.code, a.code:visited, a.line, a.line:visited {
152 a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited {
|
| /art/compiler/ |
| image_writer.cc | 711 std::unordered_set<mirror::Class*> visited; local
712 return PruneAppImageClassInternal(klass, &early_exit, &visited);
718 std::unordered_set<mirror::Class*>* visited) {
720 DCHECK(visited != nullptr);
731 if (visited->find(klass) != visited->end()) {
735 visited->emplace(klass);
750 // Check interfaces since these wont be visited through VisitReferences.)
755 visited);
761 visited);
[all...] |
| /external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
| ObjectExplorer.java | 251 * Null references should be visited.
256 * Primitive values should be visited.
|
