| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 207 // Pre-compute the closure of the successor relation.
273 llvm::errs() << "Successor Closure:\n";
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopRotation.cpp | 198 // Find new Loop header. NewHeader is a Header's one and only successor
199 // that is inside loop. Header's other successor is outside the
|
| /external/llvm/lib/VMCore/ |
| BasicBlock.cpp | 323 BasicBlock *Successor = *I;
325 for (BasicBlock::iterator II = Successor->begin();
|
| /external/llvm/include/llvm/Analysis/ |
| Dominators.h | 224 // NewBB is split and now it has one successor. Update dominator tree to
231 "NewBB should have a single successor!");
539 /// splitBlock - BB is split and now it has one successor. Update dominator
811 /// splitBlock - BB is split and now it has one successor. Update dominator
|
| LoopInfo.h | 24 // * the successor blocks of the loop
213 /// getExitBlocks - Return all of the successor blocks of this loop. These
282 // The predecessor has exactly one successor, so it is a preheader.
289 /// the predecessor to have exactly one successor.
617 /// getUniqueExitBlocks - Return all unique successor blocks of this loop.
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineDominators.h | 154 /// splitBlock - BB is split and now it has one successor. Update dominator
|
| Passes.h | 147 /// successor blocks (creating fall throughs), and eliminating branches over
|
| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 88 // successor nodes that have a single unscheduled predecessor. If so, that
|
| LiveVariables.cpp | 168 // least one of the successor blocks, it's not a kill.
574 // bottom of this basic block. We check all of our successor blocks to see
713 // Is it alive in this successor?
720 // Check to see if this value is live because there is a use in a successor
|
| ScheduleDAG.cpp | 86 /// not already. It also adds the current node as a successor of the
123 /// node if it exists. It also removes the current node as a successor of
131 // Find the corresponding successor in N.
|
| IfConversion.cpp | 413 /// findFalseBlock - BB has a fallthrough. Find its 'false' successor given
414 /// its 'true' successor.
[all...] |
| /external/v8/src/ |
| double.h | 172 // at the same distance as its successor.
|
| hydrogen.h | 290 void CheckForBackEdge(HBasicBlock* block, HBasicBlock* successor);
738 // block and loop_entry is the successor block. loop_successor is the
742 // value is the new successor block which is the join of loop_successor
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedBlockingDeque.java | 94 * - the real successor Node
95 * - this Node, meaning the successor is head
96 * - null, meaning there is no successor
1049 * Returns the successor node of the given non-null, but
[all...] |
| ConcurrentSkipListMap.java | 103 * (predecessor, node, successor) in order to detect when and how
148 * predecessor b and successor f, initially:
254 * and/or successor and/or value fields which can't be returned
283 * Node: b, n, f for predecessor, node, successor
428 * @param f the assumed current successor of this node
440 * @param f successor
529 * Tries to CAS newSucc as successor. To minimize races with
532 * @param succ the expected current successor
533 * @param newSucc the new successor
543 * Tries to CAS right field to skip over apparent successor
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 80 // Produce a table of pointers to counters, by predecessor and successor
204 void addEdge(GCOVBlock &Successor) {
205 OutEdges.push_back(&Successor);
|
| /external/llvm/lib/Transforms/Utils/ |
| InlineFunction.cpp | 94 // Okay, if that failed, look for one in an obvious successor. If
124 BasicBlock *successor = branch->getSuccessor(0);
127 if (!visited.insert(successor)) return 0;
129 // If the successor isn't dominated by exnBlock:
130 if (!successor->getSinglePredecessor()) {
138 nonDominated = successor;
142 exnBlock = successor;
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| EscapeAnalysis.java | 743 // Add a successor block with a move result pseudo for the exception
753 // Add another successor block to initialize the exception
763 // Add another successor block to throw the new exception
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 261 /// Terminator Successor Ordering
330 /// Predecessors/Successors - Keep track of the predecessor / successor
339 /// will have a single immediate successor: the exit block. This allows them
|
| /external/e2fsprogs/intl/ |
| dcigettext.c | 627 for (cnt = 0; domain->successor[cnt] != NULL; ++cnt)
629 retval = _nl_find_msg (domain->successor[cnt], binding,
634 domain = domain->successor[cnt];
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| StdCatchBuilder.java | 234 * successor -- if any -- last in the successors list, but
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| StdCatchBuilder.java | 234 * successor -- if any -- last in the successors list, but
|
| /external/llvm/lib/Analysis/ |
| LazyValueInfo.cpp | 807 // If this is a conditional branch and only one successor goes to BBTo, then
813 "BBTo isn't a successor of BBFrom");
890 assert(EdgeVal && "Missing successor?");
946 // values in any successor of OldSucc (except NewSucc) in which they were
[all...] |
| /external/llvm/tools/llvm-prof/ |
| llvm-prof.cpp | 104 // Figure out how many times each successor executed.
|
| /external/llvm/include/llvm/ |
| Instructions.h | [all...] |
