| /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 | 95 * - the real successor Node
96 * - this Node, meaning the successor is head.next
97 * - null, meaning there is no successor (this is the last node)
777 * Returns the next live successor of p, or null if no such.
|
| ConcurrentLinkedDeque.java | 87 * ("prev") and successor ("next") nodes:
417 // and successor of x. Try to fix up their links so that
420 // predecessor/successor, we additionally try to gc-unlink,
422 // that the status of predecessor and successor are
451 // Find active successor
486 // Recheck expected state of predecessor and successor
693 * Returns the successor of p, or the first node if p.next has been
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| PathProfiling.cpp | 145 // Returns the successor number of this edge in the source.
208 // Removes phony edges from the successor list of the source, and the
239 // Removes the edge from the appropriate predecessor and successor lists.
481 // Returns the successor number of this edge in the source.
647 // Removes phony edges from the successor list of the source, and the
779 // Removes the edge from the appropriate predecessor and successor
[all...] |
| /external/chromium_org/v8/src/ |
| lithium-allocator.cc | 573 // successor edges.
576 // Process all successor blocks.
578 // Add values live on entry to the successor. Note the successor's
580 HBasicBlock* successor = it.Current(); local
581 BitVector* live_in = live_in_sets_[successor->block_id()];
584 // All phi input operands corresponding to this successor edge are live
586 int index = successor->PredecessorIndexOf(block);
587 const ZoneList<HPhi*>* phis = successor->phis();
[all...] |
| /external/v8/src/ |
| lithium-allocator.cc | 563 // successor edges.
566 // Process all successor blocks.
568 // Add values live on entry to the successor. Note the successor's
570 HBasicBlock* successor = it.Current(); local
571 BitVector* live_in = live_in_sets_[successor->block_id()];
574 // All phi input operands corresponding to this successor edge are live
576 int index = successor->PredecessorIndexOf(block);
577 const ZoneList<HPhi*>* phis = successor->phis();
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| RopperMachine.java | 88 /** primary successor index */
221 * Gets the primary successor index. This is the index into the
224 * successor. This may return something other than
228 * @return {@code >= -1;} the primary successor index
610 * 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...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 148 /// predecessor and the successor, given that they have this edge
392 /// not already. It also adds the current node as a successor of the
397 /// node if it exists. It also removes the current node as a successor of
419 /// recursively marks successor nodes dirty.
445 /// isSucc - Test if node N is a successor of this node.
|
| FastISel.h | 339 /// immediate (fall-through) successor, and update the CFG.
378 /// \brief Handle PHI nodes in successor blocks.
|
| MachineTraceMetrics.h | 138 /// Trace successor, or NULL for the last block in the trace.
286 /// Return the Depth of a PHI instruction in a trace center block successor.
|
| /external/llvm/lib/CodeGen/ |
| LiveVariables.cpp | 172 // least one of the successor blocks, it's not a kill.
608 // bottom of this basic block. We check all of our successor blocks to see
742 // Is it alive in this successor?
749 // Check to see if this value is live because there is a use in a successor
815 // If the Defs is defined in the successor it can't be live in BB.
|
| PostRASchedulerList.cpp | 561 /// ReleaseSucc - Decrement the NumPredsLeft count of a successor. Add it to
580 // Standard scheduler algorithms will recompute the depth of the successor
586 // all descendents to be marked dirty. Setting the successor depth explicitly
588 // successor is not yet ready (because of a transitively redundant edge) then
606 /// count of its successors. If a successor pending count is zero, add it to
|
| IfConversion.cpp | 422 /// findFalseBlock - BB has a fallthrough. Find its 'false' successor given
423 /// its 'true' successor.
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 161 // Move all definitions in the successor to the predecessor...
249 // If the edge isn't critical, then BB has a single successor or Succ has a
253 // If the successor only has a single pred, split the top of the successor
260 // Otherwise, if BB has a single successor, split it at the bottom of the
|
| BreakCriticalEdges.cpp | 92 /// successor of SplitBB.
131 /// specified successor will be merged into the same critical edge block.
|
| FlattenCFG.cpp | 118 /// In both cases, \param BB is the common successor of conditional branches.
203 // PS is the successor which is not BB. Check successors to identify
|
| /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...] |
| /external/bison/tests/ |
| reduce.at | 1224 state. States are iterated for successor construction in numerical order.
1228 algorithm using annotations alone. That is, when state 11's successor on
1229 'd' is merged with state 5 (which is originally just state 1's successor on
1230 'd'), state 5's successor on 'e' must then be changed because the resulting
1232 successor on 'e'. In other words, state 13 must be split to avoid the
1254 7), state 5's successor on 'e' would never be merged with state 8's, so the
[all...] |
| /external/chromium_org/third_party/bintrees/ |
| README.txt | 111 * succ_item(key) -> get (k,v) pair as a 2-tuple, where k is successor to key, O(log(n))
112 * succ_key(key) -> k, get the successor of key, O(log(n))
|
| /external/llvm/include/llvm/Analysis/ |
| 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/Transforms/Utils/ |
| Local.h | 112 /// predecessor is known to have one successor (BB!). Eliminate the edge
122 /// rewriting all the predecessors to branch to the successor block and return
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 323 BasicBlock *Successor = *I;
325 for (BasicBlock::iterator II = Successor->begin();
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 207 // Pre-compute the closure of the successor relation.
273 llvm::errs() << "Successor Closure:\n";
|
| /art/compiler/sea_ir/debug/ |
| dot_gen.cc | 142 DCHECK(NULL != *cit) << "Null successor found for SeaNode" <<
|
