| /external/chromium/chrome/browser/resources/sync_internals/ |
| sync_node_browser.html | 45 <td>Predecessor</td>
|
| /external/chromium_org/chrome/browser/resources/sync_internals/ |
| node_browser.html | 45 <td>Predecessor</td>
|
| /external/llvm/test/CodeGen/Generic/ |
| 2003-05-30-BadPreselectPhi.ll | 8 ;; the Phi instead of in predecessor blocks. This later
|
| /external/llvm/lib/Transforms/Utils/ |
| DemoteRegToStack.cpp | 47 // use. Instead insert the load in the predecessor block corresponding
60 // Insert the load into the predecessor block
127 // Iterate over each operand inserting a store in each predecessor.
|
| BasicBlockUtils.cpp | 64 /// FoldSingleEntryPHINodes - We know that BB has one predecessor. If there are
67 /// when the block has exactly one predecessor.
114 /// MergeBlockIntoPredecessor - Attempts to merge a block into its predecessor,
154 // Delete the unconditional branch from the predecessor...
161 // Move all definitions in the successor to the predecessor...
462 // account for the newly created predecessor.
587 /// instruction into a predecessor which ends in an unconditional branch. If
590 /// predecessor.
594 // Clone the return and add it to the end of the predecessor.
691 if (PI == PE) // No predecessor
[all...] |
| Local.cpp | 438 /// method is called when we're about to delete Pred as a predecessor of BB. If
446 /// .. and delete the predecessor corresponding to the '1', this will attempt to
475 /// MergeBasicBlockIntoOnlyPred - DestBB is a block with one predecessor and its
476 /// predecessor is known to have one successor (DestBB!). Eliminate the edge
477 /// between them, moving the instructions in the predecessor into DestBB and
478 /// deleting the predecessor block.
491 assert(PredBB && "Block doesn't have a single predecessor!");
545 // Shortcut, if there is only a single predecessor it must be BB and merging
569 << BBPN->getName() << " with regard to common predecessor "
577 // See if the incoming value for the common predecessor is equal to th
[all...] |
| /external/bison/src/ |
| ielr.c | 296 * - <tt>result[i]</tt> is an array of pointers to the predecessor
426 state **predecessor; local
428 for (predecessor = predecessors[s->number];
429 *predecessor;
430 ++predecessor)
433 goto_follows[map_goto ((*predecessor)->number,
437 predecessor items' lookahead sets. */
440 state **predecessor; local
441 for (predecessor = predecessors[s->number];
442 *predecessor;
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 38 /// FoldSingleEntryPHINodes - We know that BB has one predecessor. If there are
41 /// when the block has exactly one predecessor.
51 /// MergeBlockIntoPredecessor - Attempts to merge a block into its predecessor,
178 /// instruction into a predecessor which ends in an unconditional branch. If
181 /// predecessor.
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderQuote.cpp | 313 for (RenderObject* predecessor = previousInPreOrder(); predecessor; predecessor = predecessor->previousInPreOrder()) {
316 if (!predecessor->isQuote() || !toRenderQuote(predecessor)->isAttached())
318 m_previous = toRenderQuote(predecessor);
|
| /external/llvm/include/llvm/IR/ |
| BasicBlock.h | 173 /// \brief Return this block if it has a single predecessor block. Otherwise
180 /// \brief Return this block if it has a unique predecessor block. Otherwise return a null pointer.
182 /// Note that unique predecessor doesn't mean single edge, there can be
183 /// multiple edges from the unique predecessor to this block (for example a
240 /// \brief Notify the BasicBlock that the predecessor \p Pred is no longer
243 /// This is actually not used to update the Predecessor list, but is actually
245 /// should be called while the predecessor still refers to this block.
|
| /external/chromium_org/sync/syncable/ |
| mutable_entry.cc | 229 MutableEntry predecessor(write_transaction(), GET_BY_ID, predecessor_id);
230 if (!predecessor.good())
232 dir()->PutPredecessor(kernel_, predecessor.kernel_);
|
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteConnectionPool.java | 624 ConnectionWaiter predecessor = null; local
631 predecessor = successor;
634 if (predecessor != null) {
635 predecessor.mNext = waiter;
715 ConnectionWaiter predecessor = null; local
719 predecessor = current;
722 if (predecessor != null) {
723 predecessor.mNext = waiter.mNext;
784 ConnectionWaiter predecessor = null; local
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| PhiInsn.java | 33 * in SSA form. Will be converted to moves in predecessor blocks before
130 * @param predBlock predecessor block to be associated with this operand
293 * Returns the list of predecessor blocks associated with all operands
298 * @return list of predecessor blocks, empty if none
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| SsaToRop.java | 163 * predecessor block.
273 * Validates that a basic block is a valid end predecessor. It must
286 throw new RuntimeException("Exit predecessor must end"
310 "Exit predecessor must have no other successors"
|
| /external/clang/include/clang/Analysis/Analyses/ |
| CFGReachabilityAnalysis.h | 29 // tend to have a common destination, so we lazily do a predecessor search
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| PhiInsn.java | 29 * in SSA form. Will be converted to moves in predecessor blocks before
126 * @param predBlock predecessor block to be associated with this operand
289 * Returns the list of predecessor blocks associated with all operands
294 * @return list of predecessor blocks, empty if none
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
| SsaToRop.java | 164 * predecessor block.
274 * Validates that a basic block is a valid end predecessor. It must
287 throw new RuntimeException("Exit predecessor must end"
311 "Exit predecessor must have no other successors"
|
| /external/llvm/include/llvm/Analysis/ |
| PathNumbering.h | 75 // Iterator information for predecessor edges. Includes phony and
87 // Add an edge to the predecessor list.
90 // Remove an edge from the predecessor list.
108 // Holds the predecessor edges of this node.
|
| /external/llvm/lib/Target/Sparc/ |
| SparcAsmPrinter.cpp | 237 /// exactly one predecessor and the control transfer mechanism between
238 /// the predecessor and this block is a fall-through.
248 // If there isn't exactly one predecessor, it can't be a fall through.
254 // The predecessor has to be immediately before this block.
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| 2011-10-03-CritEdgeMerge.ll | 45 ; Handle single-predecessor phis: PR13756
|
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 57 * information about a thread in the predecessor of its node. A
59 * should block. A node is signalled when its predecessor
87 * predecessor. For explanation of similar mechanics in the case
93 * predecessor signals the next node to wake up by traversing
107 * a new predecessor, unless we can identify an uncancelled
108 * predecessor who will carry this responsibility.
184 * Link to predecessor node that current node/thread relies on
187 * cancellation of a predecessor, we short-circuit while
201 * assign next field of a predecessor until after attachment,
238 * Use when predecessor cannot be null. The null check coul
243 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedLongSynchronizer.Node
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| RopMethod.java | 148 * Calculates the predecessor sets for each block as well as for the
182 // Sort and immutablize all the predecessor lists.
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| RopMethod.java | 147 * Calculates the predecessor sets for each block as well as for the
181 // Sort and immutablize all the predecessor lists.
|
| /external/bison/lib/ |
| open.c | 95 its predecessor."
154 its predecessor."
|
| /external/chromium_org/extensions/browser/ |
| app_sorting.h | 50 // located after the given predecessor and before the successor.
51 // Empty strings are used to indicate no successor or predecessor.
|
