/external/clang/include/clang/Analysis/Analyses/ |
ThreadSafety.h | 57 /// predecessors of a CFGBlock.
|
/external/llvm/include/llvm/Transforms/Utils/ |
Cloning.h | 78 /// nodes from the original block, even though there are no predecessors for the
|
/external/llvm/lib/Analysis/ |
ProfileInfo.cpp | 73 // Are there zero predecessors of this block? 78 // Otherwise, if there are predecessors, the execution count of this block is 95 // If the predecessors did not suffice to get block weight, try successors. 457 // For all requestes Predecessors. [all...] |
LoopInfo.cpp | 213 // exits have all their predecessors inside the loop. 471 // propagating the nearest loop from sucessors to predecessors. 499 // from successors to predecessors as before.
|
/external/llvm/lib/CodeGen/ |
EarlyIfConversion.cpp | 450 /// This is possible when the only Tail predecessors are the if-converted 470 /// rewritePHIOperands - When there are additional Tail predecessors, insert 472 /// Keep the PHI instructions in Tail to handle the other predecessors. 522 // Are there extra Tail predecessors?
|
LatencyPriorityQueue.cpp | 98 /// AdjustPriorityOfUnscheduledPreds - One of the predecessors of SU was just
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGFast.cpp | 161 // Bottom up: release predecessors 180 /// count of its predecessors. If a predecessor pending count is zero, add it to 356 // New SUnit has the exact same predecessors. 529 // Release any predecessors of the special Exit node.
|
/external/llvm/lib/MC/ |
MCObjectDisassembler.cpp | 193 // Add all predecessors and successors to the worklist.
|
/external/llvm/test/CodeGen/PowerPC/ |
sjlj.ll | 27 return: ; No predecessors!
|
/external/llvm/test/CodeGen/X86/ |
2012-01-10-UndefExceptionEdge.ll | 5 ; This test case has a landing pad with two predecessors, and a variable that
|
early-ifcvt.ll | 42 ; Deal with alternative tail predecessors
|
/external/llvm/test/Transforms/GVN/ |
2007-07-30-PredIDom.ll | 267 ; No predecessors!
|
/dalvik/vm/analysis/ |
Liveness.cpp | 205 * Merge changes to all predecessors. If the new bits don't match 208 PointerSet* preds = workBlock->predecessors; 225 * We want to set the "changed" flag on unvisited predecessors
|
/external/chromium/chrome/browser/sync/glue/ |
bookmark_change_processor.cc | 360 // 2. Existing items with synced parents & predecessors. 361 // 3. New items with synced parents & predecessors. 362 // 4. Items with parents & predecessors in the list.
|
/external/chromium_org/chrome/browser/sync/glue/ |
bookmark_change_processor.cc | 491 // 2. Existing items with synced parents & predecessors. 492 // 3. New items with synced parents & predecessors. 493 // 4. Items with parents & predecessors in the list.
|
/external/chromium_org/v8/src/ |
hydrogen-gvn.cc | 544 HBasicBlock* pre_header = loop_header->predecessors()->at(0); 620 for (int i = 0; i < dominated->predecessors()->length(); ++i) { 621 HBasicBlock* block = dominated->predecessors()->at(i);
|
lithium-allocator.cc | [all...] |
hydrogen.cc | 293 if (predecessors()->length() == 1) { 301 for (int i = 1; i < predecessors()->length(); ++i) { 302 loop_information()->RegisterBackEdge(predecessors()->at(i)); 396 // If more successors than predecessors have been seen in the loop up to 480 for (int i = 0; i < block->predecessors()->length(); ++i) { 481 AddBlock(block->predecessors()->at(i)); 563 ASSERT(first->predecessors()->Contains(block)); 565 ASSERT(second->predecessors()->Contains(block)); 575 // Check that all join blocks have predecessors that end with an 577 if (block->predecessors()->length() >= 2) [all...] |
/external/llvm/lib/Transforms/Utils/ |
SSAUpdater.cpp | 128 // If there are no predecessors, just return undef. 153 // Fill in all the predecessors of the PHI. 241 /// FindPredecessorBlocks - Put the predecessors of Info->BB into the Preds
|
/external/clang/include/clang/Analysis/ |
CFG.h | 280 /// (3) A list of successors and predecessors. 288 /// Predecessors: the order in the set of predecessors is arbitrary. 363 /// Predecessors/Successors - Keep track of the predecessor / successor 689 /// entry block has no predecessors and contains no statements. [all...] |
/external/v8/src/ |
lithium-allocator.cc | [all...] |
hydrogen.h | 70 const ZoneList<HBasicBlock*>* predecessors() const { return &predecessors_; } function in class:v8::internal::HBasicBlock 142 // predecessors should contain the inlined exit sequence: 200 : predecessor_list_(block->predecessors()), current_(0) { } [all...] |
/external/llvm/include/llvm/CodeGen/ |
ScheduleDAG.h | 263 SmallVector<SDep, 4> Preds; // All sunit predecessors. 402 /// maximum path up to any node which has no predecessors. 719 /// an edge to be removed from the specified node N from the predecessors
|
/external/llvm/lib/Transforms/Scalar/ |
TailRecursionElimination.cpp | 574 // Loop over all of the predecessors of the tail recursion block. For the 632 // predecessors and perform TRC there. Look for predecessors that end
|
/external/llvm/test/Transforms/CodeGenPrepare/ |
2008-11-24-RAUW-Self.ll | 25 bb11.i.bb7.i197_crit_edge: ; No predecessors! 34 base2flt.exit.bb7.i197_crit_edge: ; No predecessors! 43 bb10.i196.bb7.i197_crit_edge: ; No predecessors!
|