/external/llvm/lib/Analysis/ |
ProfileInfo.cpp | 661 // The set of BasicBlocks that are still unvisited. 662 std::set<const BasicBlock*> Unvisited; 669 // 1) The blocks in this function in the Unvisited set. 677 Unvisited.insert(BB); 701 if (Unvisited.insert(*NBB).second) { 707 while (Unvisited.size() > 0) { 708 unsigned oldUnvisitedCount = Unvisited.size(); 719 Unvisited.erase(e.first); 726 std::set<const BasicBlock *>::iterator FI = Unvisited.begin(), FE = Unvisited.end() [all...] |
PathNumbering.cpp | 431 if(succNode) // an unvisited node that is child of a gray node 433 else { // an unvisited node that is a child of a an unvisted node
|
CFG.cpp | 59 // Go down one level if there is a unvisited successor.
|
/external/chromium_org/third_party/WebKit/ManualTests/ |
redraw-page-cache-visited-links.html | 29 <li>The link in Step 2 should be rendered in an unvisited link color first.
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
Graph.java | 85 // pick any unvisited node, n
|
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
ParticleDepositionHeightMap.java | 138 //map 0 unmarked, unvisited, 1 marked, unvisited, 2 marked visited.
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
shortest-distance.h | 185 // An unvisited state S has distance Zero(), which will be stored in 215 // distance from each state to the final states. An unvisited state S
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
TreeIterator.cs | 129 // must have found a node with an unvisited sibling
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
TreeIterator.cs | 154 // must have found a node with an unvisited sibling
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
TreeIterator.java | 123 // must have found a node with an unvisited sibling
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRTreeIterator.m | 170 // must have found a node with an unvisited sibling
|
/external/chromium/chrome/browser/visitedlink/ |
visitedlink_perftest.cc | 104 // check URLs, doing half visited, half unvisited
|
/external/chromium/chrome/common/ |
visitedlink_common.h | 39 // we consider it visited. Otherwise, it is unvisited. Note that it is possible
|
/external/chromium_org/components/visitedlink/common/ |
visitedlink_common.h | 40 // we consider it visited. Otherwise, it is unvisited. Note that it is possible
|
/external/chromium_org/components/visitedlink/test/ |
visitedlink_perftest.cc | 102 // check URLs, doing half visited, half unvisited
|
/external/llvm/unittests/ADT/ |
SCCIteratorTest.cpp | 190 // Find the next unvisited child node. 210 // Find the next unvisited child node.
|
/external/openfst/src/include/fst/ |
shortest-distance.h | 228 // An unvisited state S has distance Zero(), which will be stored in 264 // distance from each state to the final states. An unvisited state S
|
/external/llvm/lib/CodeGen/ |
UnreachableBlockElim.cpp | 13 // then deletes any unvisited nodes.
|
/art/runtime/gc/accounting/ |
space_bitmap.cc | 204 // For an unvisited object, visit it then all its children found via fields.
|
/external/chromium_org/third_party/icu/source/test/perf/perldriver/ |
Output.pm | 227 A:link { color: black; font-weight: normal; text-decoration: none} /* unvisited links */
|
/external/clang/lib/Serialization/ |
ModuleManager.cpp | 272 // module we depend on. If we were the last unvisited module
|
/external/icu4c/test/perf/perldriver/ |
Output.pm | 227 A:link { color: black; font-weight: normal; text-decoration: none} /* unvisited links */
|
/external/llvm/include/llvm/Transforms/Utils/ |
SSAUpdaterImpl.h | 181 // Add unvisited successors to the work list.
|
/external/v8/src/ |
bootstrapper.cc | 213 UNVISITED, VISITED, INSTALLED [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
RenderStyle.cpp | [all...] |