| /external/llvm/lib/CodeGen/ |
| MachineCSE.cpp | 251 // is if the common subexpression is in the sole predecessor block.
369 // an immediate predecessor. We don't want to increase register pressure and
487 // ... Unless the CS is local or is in the sole predecessor block
569 // Add physical register defs now coming in from a predecessor to MBB
|
| StrongPHIElimination.cpp | 164 // Stores pairs of predecessor basic blocks and the source registers of
169 // Maps pairs of predecessor basic blocks and colors to their defining copy
589 // the predecessor block. The def of a PHI's destination register is processed
636 // If two PHIs have the same operand from every shared predecessor, then
658 // copy in the predecessor.
|
| MachineLICM.cpp | 308 /// loop that has a unique predecessor.
310 // Check whether this loop even has a unique predecessor.
317 // None of them did, so this is the outermost with a unique predecessor.
611 // Now move the instructions to the predecessor, inserting it before any
799 // If the preheader has only a single predecessor and it ends with a
800 // fallthrough or an unconditional branch, then scan its predecessor for live
802 // the critical edge from the loop predecessor to the loop header.
[all...] |
| LiveRangeCalc.cpp | 152 // VNInfo SSA form. Perform a search for all predecessor blocks where we
330 // This predecessor is carrying something other than IDomValue.
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_cfg.cpp | 34 * blocks with successor/predecessor edges connecting them.
|
| /frameworks/base/core/java/android/view/ |
| Choreographer.java | 816 CallbackRecord predecessor = null; local
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 104 * (predecessor, node, successor) in order to detect when and how
149 * predecessor b and successor f, initially:
254 * because subsequent uses require a snapshot of predecessor
264 * only, returning a base-level predecessor of the key. findNode()
284 * Node: b, n, f for predecessor, node, successor
438 * predecessor. This is called during traversals when value
440 * @param b predecessor
680 * @return a predecessor of key
717 * base-level looking for key starting at predecessor returned
725 * predecessor b's current successor, which means tha
[all...] |
| ConcurrentLinkedDeque.java | 86 * A node contains the expected E ("item") and links to predecessor
416 // Our strategy is to find the unique active predecessor
420 // predecessor/successor, we additionally try to gc-unlink,
422 // that the status of predecessor and successor are
430 // Find active predecessor
486 // Recheck expected state of predecessor and successor
704 * Returns the predecessor of p, or the last node if p.prev has been
[all...] |
| /external/chromium_org/sync/syncable/ |
| directory.cc | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 90 /// the value of the Latency field of the predecessor, however advanced
148 /// predecessor and the successor, given that they have this edge
424 /// recursively marks predecessor nodes dirty.
437 /// isPred - Test if node N is a predecessor of this node.
460 /// \brief Order this node's predecessor edges such that the critical path
|
| LiveVariables.h | 71 /// value in one of its predecessor blocks, it is not listed in the kills set,
72 /// but does include the predecessor block in the AliveBlocks set (unless that
|
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | [all...] |
| /external/chromium_org/third_party/bintrees/ |
| README.txt | 109 * prev_item(key) -> get (k, v) pair, where k is predecessor to key, O(log(n))
110 * prev_key(key) -> k, get the predecessor of key, O(log(n))
|
| /external/llvm/lib/Analysis/ |
| PHITransAddr.cpp | 329 // Make sure the value is live in the predecessor.
339 /// predecessor block, inserting a computation of the value if it is
|
| /external/llvm/lib/IR/ |
| Dominators.cpp | 176 // Simple case: if the end BB has a single predecessor, the fact that it
244 // happening at the end of the predecessor block.
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 222 // Invert to form the predecessor closure map.
261 llvm::errs() << "Predecessor Closure:\n";
|
| /external/valgrind/main/coregrind/ |
| m_stacks.c | 123 /* st0 points to st, st1 to its predecessor, and st2 to st1's
124 predecessor. Swap st0 and st1, that is, move st0 one step
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| BasicBlock.java | 48 * Constructs an instance. The predecessor set is set to {@code null}.
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| BasicBlock.java | 48 * Constructs an instance. The predecessor set is set to {@code null}.
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 203 * PredInfo may not exist in case the predecessor is
|
| /external/chromium/chrome/browser/sync/syncable/ |
| syncable.h | 427 // Compute a local predecessor position for |update_item|, based on its
428 // absolute server position. The returned ID will be a valid predecessor
526 // Adjusts the successor and predecessor entries so that they no longer
849 // Compute a local predecessor position for |update_item|. The position
[all...] |
| /external/chromium/net/tools/testserver/ |
| chromiumsync.py | 358 Clients specify positions using the predecessor-based references; the
368 prev_id: The ID of the entry intended as the new predecessor. If this
373 value placing it just after (to the right of) the new predecessor.
671 # predecessor during Commit operations, but the 'position_in_parent'
[all...] |
| /external/chromium_org/chrome/browser/sync/glue/ |
| bookmark_change_processor.cc | 466 // Find the bookmark model predecessor, and insert after it.
470 LOG(WARNING) << "Predecessor lookup failed";
502 // "Predecessor" here means the previous item within a given folder; an item
503 // in the first position is always said to have a synced predecessor.
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| ptw32_MCS_lock.c | 173 /* the lock was not free. link behind predecessor. */
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLImport.h | 180 bool m_documentBlocked; // If its predecessor is not done yet, the document creation is blocked.
|
