| /external/llvm/include/llvm/Support/ |
| CFG.h | 70 /// terminator of the successor.
95 template <class Term_, class BB_> // Successor Iterator
272 // instead of the successor edges.
332 // instead of the successor edges.
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 60 /// only has one predecessor, and that predecessor only has one successor.
66 // pred, and if there is only one distinct successor of the predecessor, and
90 // Move all definitions in the successor to the predecessor...
349 // Update the conditional branch's successor for the following
|
| SimplifyCFG.cpp | 88 // successor, and if that successor has a PHI node, and if *that* PHI node has
591 << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n");
604 << "Through successor TI: " << *TI);
629 // BB. Find out which successor will unconditionally be branched to.
653 << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n");
772 // Okay, at this point, we know which new successor Pred will get. Make
795 // Okay, last check. If BB is still a successor of PSI, then we must
[all...] |
| Local.cpp | 111 "Default destination is not successor #0?");
139 // successor.
203 // If we didn't find our destination in the IBI successor list, then we
422 /// predecessor is known to have one successor (DestBB!). Eliminate the edge
477 /// Assumption: Succ is the single successor for BB.
480 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
549 /// eliminate BB by rewriting all the predecessors to branch to the successor
595 // the successor, then we need to add incoming edges for the PHI nodes
599 // Loop over all of the PHI nodes in the successor of BB.
[all...] |
| LowerSwitch.cpp | 216 // If there were any PHI nodes in this successor, rewrite one entry
228 assert(BlockIdx != -1 && "Switch didn't go to this successor??");
302 assert(BlockIdx != -1 && "Switch didn't go to this successor??");
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 319 /// getUniqueExitBlocks - Return all unique successor blocks of this loop.
443 "uninitialized successor");
449 assert((FoundIB || Unloop->contains(L)) && "uninitialized successor");
469 "uninitialized successor");
518 /// successors. If a successor is a subloop header, consider its parent to be
544 assert(!Subloop && "subloop blocks must have a successor");
553 // This successor has not been processed. This path must lead to an
559 // Successor is in a subloop.
|
| /external/clang/lib/Analysis/ |
| CFG.cpp | 244 /// the AST in reverse order so that the successor of a basic block is
554 // incomplete AST. Handle this by not registering a successor.
572 // at an incomplete AST. Handle this by not registering a successor.
594 /// CFG. It is *not* connected to the current (global) successor, and instead
667 // create a new block for the destructor which does not have as a successor
[all...] |
| UninitializedValues.cpp | 298 const CFGBlock *Successor = *I;
299 if (!Successor || enqueuedBlocks[Successor->getBlockID()])
301 worklist.push_back(Successor);
302 enqueuedBlocks[Successor->getBlockID()] = true;
|
| /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/ |
| MachineVerifier.cpp | 112 // Vregs that must pass through MBB because they are needed by a successor
410 report("MBB has more than one landing pad successor", MBB);
420 // Block falls through to its successor.
433 "exactly one CFG successor!", MBB);
435 report("MBB exits via unconditional fall-through but its successor "
436 "differs from its CFG successor!", MBB);
451 "exactly one CFG successor!", MBB);
454 "successor doesn't match the actual successor!", MBB);
891 // block in order to satisfy the requirements of successor blocks. This is ver
[all...] |
| BranchFolding.cpp | 531 // instructions with the block that falls through into the common successor.
689 // successor, or all have no successor) can be tail-merged. If there is a
690 // successor, any blocks in MergePotentials that are not tail-merged and
692 // Succ added (but the predecessor/successor lists need no adjustment).
710 dbgs() << " with successor BB#" << SuccBB->getNumber() << '\n';
[all...] |
| PostRASchedulerList.cpp | 534 /// ReleaseSucc - Decrement the NumPredsLeft count of a successor. Add it to
549 // Standard scheduler algorithms will recompute the depth of the successor
555 // all descendents to be marked dirty. Setting the successor depth explicitly
557 // successor is not yet ready (because of a transitively redundant edge) then
575 /// count of its successors. If a successor pending count is zero, add it to
|
| /external/v8/src/ |
| lithium-allocator.cc | 564 // successor edges.
567 // Process all successor blocks.
568 HBasicBlock* successor = block->end()->FirstSuccessor(); local
569 while (successor != NULL) {
570 // Add values live on entry to the successor. Note the successor's
572 BitVector* live_in = live_in_sets_[successor->block_id()];
575 // All phi input operands corresponding to this successor edge are live
577 int index = successor->PredecessorIndexOf(block);
578 const ZoneList<HPhi*>* phis = successor->phis()
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 85 * successor is (normally) relinked to a non-cancelled
94 * successor must avoid races with newly queued nodes to set
97 * updated "tail" when a node's successor appears to be null.
136 /** waitStatus value to indicate successor's thread needs unparking */
148 * SIGNAL: The successor of this node is (or will soon be)
150 * unpark its successor when it releases or
196 * Link to the successor node that the current node/thread
382 * Wakes up node's successor, if one exists.
397 * Thread to unpark is held in successor, which is normally
400 * non-cancelled successor
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 166 "Entry block must have 1 successor.");
168 // Get the solitary successor.
371 // Only 1 successor: the indirect goto dispatch block.
412 "Blocks with no terminator should have at most 1 successor.");
751 // Get the solitary successor.
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 142 /// predecessor and the successor, given that they have this edge
351 /// not already. It also adds the current node as a successor of the
356 /// node if it exists. It also removes the current node as a successor of
378 /// recursively marks successor nodes dirty.
404 /// isSucc - Test if node N is a successor of this node.
|
| LiveVariables.h | 77 /// node in the successor. In this case, AliveBlocks is empty (the value is
80 /// the block, but is not live in any successor blocks.
297 /// PHI nodes. This means that Reg is either killed by a successor block or
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 163 /// in tandem add this node as a successor of the other node.
182 // Iterators over successor and predecessor vertices.
259 /// and successor groups.
|
| /external/e2fsprogs/intl/ |
| l10nflist.c | 346 retval->successor[entries++]
353 retval->successor[entries++]
359 retval->successor[entries] = NULL;
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| basic-block.h | 638 /* Returns true if BB has precisely one successor. */
654 /* Returns the single successor edge of basic block BB. Aborts if
655 BB does not have exactly one successor. */
674 /* Returns the single successor block of basic block BB. Aborts
675 if BB does not have exactly one successor. */
801 vector of predecessor or successor edges. It must not be used when
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| basic-block.h | 638 /* Returns true if BB has precisely one successor. */
654 /* Returns the single successor edge of basic block BB. Aborts if
655 BB does not have exactly one successor. */
674 /* Returns the single successor block of basic block BB. Aborts
675 if BB does not have exactly one successor. */
801 vector of predecessor or successor edges. It must not be used when
[all...] |
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/ |
| basic-block.h | 638 /* Returns true if BB has precisely one successor. */
654 /* Returns the single successor edge of basic block BB. Aborts if
655 BB does not have exactly one successor. */
674 /* Returns the single successor block of basic block BB. Aborts
675 if BB does not have exactly one successor. */
801 vector of predecessor or successor edges. It must not be used when
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| Local.h | 101 /// predecessor is known to have one successor (BB!). Eliminate the edge
111 /// rewriting all the predecessors to branch to the successor block and return
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGList.cpp | 106 /// ReleaseSucc - Decrement the NumPredsLeft count of a successor. Add it to
141 /// count of its successors. If a successor pending count is zero, add it to
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| OptimalEdgeProfiling.cpp | 194 // we only have a single successor, insert the counter in this block,
195 // otherwise insert it in the successor block.
|
