| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 204 // If there were any PHI nodes in this successor, rewrite one entry
216 assert(BlockIdx != -1 && "Switch didn't go to this successor??");
284 assert(BlockIdx != -1 && "Switch didn't go to this successor??");
|
| SimplifyCFG.cpp | 124 // successor, and if that successor has a PHI node, and if *that* PHI node has
602 << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n");
615 << "Through successor TI: " << *TI);
661 // BB. Find out which successor will unconditionally be branched to.
685 << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n");
805 // If there are no predecessor weights but there are successor weights,
807 // successor's weights
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/ |
| ByteBlock.java | 131 * @return {@code non-null;} the successor list
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| ByteBlock.java | 131 * @return {@code non-null;} the successor list
|
| /external/chromium_org/third_party/icu/source/config/ |
| mh-darwin | 2 ## Darwin-specific setup (Darwin is the Mac OS X developer preview, successor
|
| /external/chromium_org/tools/ |
| gyp-explain.py | 24 """Given a graph in (node -> list of successor nodes) dictionary format,
|
| /external/chromium_org/v8/src/ |
| hydrogen-bch.cc | 159 Element* successor = at(current->end()->SuccessorAt(i)); local
161 if (!successor->is_in_loop()) {
162 if (!successor->is_proper_exit()) {
170 if (successor->is_start()) {
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 68 /// predecessor and many have only one successor. It can also be used to
177 /// in tandem add this node as a successor of the other node.
203 // Iterators over successor and predecessor vertices.
270 /// and successor groups.
|
| /external/icu4c/config/ |
| mh-darwin | 2 ## Darwin-specific setup (Darwin is the Mac OS X developer preview, successor
|
| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 89 // successor nodes that have a single unscheduled predecessor. If so, that
|
| /external/llvm/test/CodeGen/Hexagon/ |
| BranchPredict.ll | 4 ; The basic block placement pass should place the more probable successor
|
| /external/chromium_org/chrome/common/ |
| content_settings_pattern.h | 50 // - SUCCESSOR:
59 SUCCESSOR = -1,
|
| content_settings_pattern_unittest.cc | 555 EXPECT_EQ(ContentSettingsPattern::SUCCESSOR,
562 EXPECT_EQ(ContentSettingsPattern::SUCCESSOR,
569 EXPECT_EQ(ContentSettingsPattern::SUCCESSOR,
576 EXPECT_EQ(ContentSettingsPattern::SUCCESSOR,
583 EXPECT_EQ(ContentSettingsPattern::SUCCESSOR,
595 EXPECT_EQ(ContentSettingsPattern::SUCCESSOR,
602 EXPECT_EQ(ContentSettingsPattern::SUCCESSOR,
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| __init__.py | 79 * succ_item(key) -> get (k,v) pair as a 2-tuple, where k is successor to key, O(log(n))
80 * succ_key(key) -> k, get the successor of key, O(log(n))
|
| /external/chromium_org/third_party/jemalloc/chromium/ |
| rb.h | 528 /* instead swap it with its successor and delete the */\
529 /* successor. Record enough information to do the */\
578 /* rbp_r_c now refers to the successor node to */\
654 /* will instead swap it with its successor */\
655 /* and delete the successor. Record enough */\
[all...] |
| /external/chromium_org/third_party/jemalloc/vendor/ |
| rb.h | 528 /* instead swap it with its successor and delete the */\
529 /* successor. Record enough information to do the */\
578 /* rbp_r_c now refers to the successor node to */\
654 /* will instead swap it with its successor */\
655 /* and delete the successor. Record enough */\
[all...] |
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 356 /// getUniqueExitBlocks - Return all unique successor blocks of this loop.
482 "uninitialized successor");
488 assert((FoundIB || Unloop->contains(L)) && "uninitialized successor");
508 "uninitialized successor");
555 /// successors. If a successor is a subloop header, consider its parent to be
580 assert(!Subloop && "subloop blocks must have a successor");
589 // This successor has not been processed. This path must lead to an
595 // Successor is in a subloop.
|
| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 54 cl::desc("Disallow MIPS delay filler to search successor basic blocks."),
223 /// This function searches one of MBB's successor blocks for an instruction
225 /// instruction into the successor's predecessor blocks.
228 /// Pick a successor block of MBB. Return NULL if MBB doesn't have a
229 /// successor block that is not a landing pad.
645 // Select the successor with the larget edge weight.
|
| /external/clang/lib/Analysis/ |
| CFG.cpp | 284 /// the AST in reverse order so that the successor of a basic block is
682 // incomplete AST. Handle this by not registering a successor.
700 // at an incomplete AST. Handle this by not registering a successor.
722 /// CFG. It is *not* connected to the current (global) successor, and instead
839 // create a new block for the destructor which does not have as a successor
[all...] |
| UninitializedValues.cpp | 230 const CFGBlock *Successor = *I;
231 if (!Successor || enqueuedBlocks[Successor->getBlockID()])
233 worklist.push_back(Successor);
234 enqueuedBlocks[Successor->getBlockID()] = true;
509 // * Block 8 is visited because we've visited its only successor.
541 // When visiting the first successor of a block, mark all NULL
|
| /external/e2fsprogs/e2fsck/ |
| dict.c | 150 * dict_next() successor function, verifying that the key of each node is
151 * strictly lower than that of its successor, if duplicates are not allowed,
670 * successor (i.e. the leftmost node in the right subtree.) By doing this,
671 * we avoid the traditional algorithm under which the successor's key and
672 * value *only* move to the deleted node and the successor is spliced out
674 * pointers to the successor, or nodes may be inextricably tied to some
690 * First, splice out the successor from the tree completely, by
705 * Now that the successor has been extricated from the tree, install it
887 * Return the given node's successor node---the node which has the
889 * no successor, a null pointer is returned rather than a pointer t
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.cpp | 538 // instructions with the block that falls through into the common successor.
703 // successor, or all have no successor) can be tail-merged. If there is a
704 // successor, any blocks in MergePotentials that are not tail-merged and
706 // Succ added (but the predecessor/successor lists need no adjustment).
724 dbgs() << " with successor BB#" << SuccBB->getNumber() << '\n';
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 86 * successor is (normally) relinked to a non-cancelled
95 * successor must avoid races with newly queued nodes to set
98 * updated "tail" when a node's successor appears to be null.
137 /** waitStatus value to indicate successor's thread needs unparking */
149 * SIGNAL: The successor of this node is (or will soon be)
151 * unpark its successor when it releases or
197 * Link to the successor node that the current node/thread
383 * Wakes up node's successor, if one exists.
398 * Thread to unpark is held in successor, which is normally
401 * non-cancelled successor
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | 525 // Check to see if the successor is a trivial loop exit.
576 // Check to see if a successor of the branch is guaranteed to
591 // Check to see if a successor of the switch is guaranteed to go to the
[all...] |
| /external/bison/src/ |
| ielr.c | 242 * follow (that is, it's computed by internal and successor edges) of goto
245 * successor follow edges. \c edge_counts has not been updated.
396 check. If, instead, this kernel item is the successor of the start
555 /** Has this state been recomputed as a successor of another state? */
609 * - The isocore of \c t that will be the transition successor of \c s will
623 kernel item in the start state, but t is supposed to be a successor
624 state. If, instead, this kernel item is the successor of the start
626 a special case to avoid the - 2 below, but the next successor can be
835 in order, we can just stop at the first such successor. O
[all...] |
