| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 63 /// successors, we forward the edge from the predecessor to the successor by
162 // If the block is trivially dead, zap it. This eliminates the successor
178 // empty", we can replace uses of it with uses of the successor and make
198 // successor is now the header of the loop.
591 /// Since we can pick an arbitrary destination, we pick the successor with the
598 // Compute the successor with the minimum number of predecessors.
623 /// through to a successor, transform them now.
632 // successor, merge the blocks. This encourages recursive jump threading
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| LocalVariableExtractor.java | 172 * Merge this state into the start state for each successor,
|
| RopMethod.java | 159 * the successor's predecessors.
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| LocalVariableExtractor.java | 172 * Merge this state into the start state for each successor,
|
| RopMethod.java | 159 * the successor's predecessors.
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| LocalVariableExtractor.java | 189 * Merge this state into the start state for each successor,
|
| SsaRenamer.java | 364 * phis in successor blocks.
625 * Updates the phi insns in successor blocks with operands based
657 SsaBasicBlock successor = ssaMeth.getBlocks().get(i); local
658 successor.forEachPhiInsn(visitor);
|
| /external/chromium/chrome/browser/sync/syncable/ |
| nigori_util.cc | 190 // Push the successor.
|
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 80 /// isSuccessor - find out if a basic block is a successor of this Interval
|
| DominatorInternals.h | 89 // Increment the successor number for the next time we get to it.
92 // Visit the successor next, if it isn't already visited.
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 23 // * the successor blocks of the loop
|
| FastISel.h | 322 /// unless it is the immediate (fall-through) successor, and update
361 /// HandlePHINodesInSuccessorBlocks - Handle PHI nodes in successor blocks.
|
| /external/llvm/include/llvm/Support/ |
| InstIterator.h | 110 // the end() of the current BasicBlock and there are successor BBs.
|
| /external/llvm/lib/Analysis/ |
| DominanceFrontier.cpp | 67 // Does Node immediately dominate this successor?
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 477 // unconditional branch, try to move it to the successor block.
493 /// into a phi node with a store in the successor.
497 /// into a phi node with a store in the successor.
502 // Check to see if the successor block has exactly two incoming edges. If
|
| /external/llvm/lib/Transforms/Utils/ |
| DemoteRegToStack.cpp | 96 "Cannot demote invoke with a critical successor!");
|
| /external/llvm/lib/VMCore/ |
| Dominators.cpp | 89 // successor block.
|
| /external/llvm/tools/llvm-objdump/ |
| MCFunction.cpp | 122 // successor.
|
| /external/v8/test/cctest/ |
| cctest.h | 85 // pseudorandomly select a successor thread and switch execution
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedBlockingQueue.java | 96 * - the real successor Node
97 * - this Node, meaning the successor is head.next
98 * - null, meaning there is no successor (this is the last node)
778 * Returns the next live successor of p, or null if no such.
|
| ConcurrentLinkedDeque.java | 81 * ("prev") and successor ("next") nodes:
404 // and successor of x. Try to fix up their links so that
407 // predecessor/successor, we additionally try to gc-unlink,
409 // that the status of predecessor and successor are
438 // Find active successor
473 // Recheck expected state of predecessor and successor
680 * Returns the successor of p, or the first node if p.next has been
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| PathProfiling.cpp | 146 // Returns the successor number of this edge in the source.
209 // Removes phony edges from the successor list of the source, and the
240 // Removes the edge from the appropriate predecessor and successor lists.
482 // Returns the successor number of this edge in the source.
648 // Removes phony edges from the successor list of the source, and the
779 // Removes the edge from the appropriate predecessor and successor
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| RopperMachine.java | 89 /** primary successor index */
222 * Gets the primary successor index. This is the index into the
225 * successor. This may return something other than
229 * @return {@code >= -1;} the primary successor index
611 * primary successor.
[all...] |
| /external/chromium/net/tools/testserver/ |
| chromiumsync.py | 398 for item, successor in zip(siblings, siblings[1:]):
401 elif successor.id_string == entry.id_string:
403 entry.position_in_parent = successor.position_in_parent
406 # existing successor.
408 successor.position_in_parent) / 8
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedSynchronizer.java | 316 * successor is (normally) relinked to a non-cancelled
325 * successor must avoid races with newly queued nodes to set
328 * updated "tail" when a node's successor appears to be null.
367 /** waitStatus value to indicate successor's thread needs unparking */
379 * SIGNAL: The successor of this node is (or will soon be)
381 * unpark its successor when it releases or
427 * Link to the successor node that the current node/thread
613 * Wakes up node's successor, if one exists.
628 * Thread to unpark is held in successor, which is normally
631 * non-cancelled successor
[all...] |
