HomeSort by relevance Sort by last modified time
    Searched full:successors (Results 201 - 225 of 527) sorted by null

1 2 3 4 5 6 7 891011>>

  /prebuilts/go/darwin-x86/src/image/jpeg/
idct.go 27 * customers, employees, agents, transferees, successors, and assigns.
  /prebuilts/go/linux-x86/src/image/jpeg/
idct.go 27 * customers, employees, agents, transferees, successors, and assigns.
  /art/compiler/optimizing/
graph_visualizer.cc 268 output_ << "successors";
631 PrintProperty("successors", "B", successor_index);
633 PrintEmptyProperty("successors");
  /dalvik/dx/src/com/android/dx/ssa/
SsaRenamer.java 653 BitSet successors = block.getSuccessors(); local
654 for (int i = successors.nextSetBit(0); i >= 0;
655 i = successors.nextSetBit(i + 1)) {
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/
Graph.py 387 Returns a list of nodes where the successors (based on outgoing and
434 Returns a list of nodes where the successors (based on outgoing edges)
443 Returns a list of nodes where the successors (based on incoming edges)
  /external/clang/lib/Analysis/
ReachableCode.cpp 251 /// Returns true if we should always explore all successors of a block.
289 // There are cases where we want to treat all successors as reachable.
294 // Look at the successors and mark then reachable.
  /external/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 167 // (b) changing the successors predecessor to the predecessor of this node
423 // In the case that some of the intended successors of NewN have already
424 // been created, we should hook them up as successors. Otherwise, enqueue
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
SsaRenamer.java 654 BitSet successors = block.getSuccessors(); local
655 for (int i = successors.nextSetBit(0); i >= 0;
656 i = successors.nextSetBit(i + 1)) {
  /external/llvm/lib/CodeGen/
PostRASchedulerList.cpp 472 /// ReleaseSuccessors - Call ReleaseSucc on each of SU's successors.
481 /// count of its successors. If a successor pending count is zero, add it to
516 // Release any successors of the special Entry node.
BranchFolding.cpp 128 // drop all successors.
439 // Move all the successors of this block to the specified block.
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopRotation.cpp 263 // successors by duplicating their incoming values for OrigHeader.
265 for (BasicBlock *SuccBB : TI->successors())
318 // Right now OrigPreHeader has two successors, NewHeader and ExitBlock, and
LoopUnswitch.cpp 371 // already unswitched and has redundant successors.
622 // Otherwise, this is an unvisited intra-loop node. Check all successors.
818 // and merge successors into loop header (then we only need to check header's
823 // branches. The following code keeps traversing loop header's successors
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 384 // If all the node's successors are scheduled, this node is ready
735 // Update liveness of predecessors before successors to avoid treating a
    [all...]
  /external/clang/include/clang/Analysis/
CFG.h 332 /// (3) A list of successors and predecessors.
342 /// Successors: the order in the set of successors is NOT arbitrary. We
403 /// and its successors.
470 /// Predecessors/Successors - Keep track of the predecessor / successor
    [all...]
  /external/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 172 // Use a hash table for many successors to keep this linear.
192 // Only bother if there are multiple successors.
400 // Distribute mass to successors as laid out in Dist.
  /external/llvm/lib/Target/Mips/
Mips16ISelLowering.cpp 553 // Next, add the true and fallthrough blocks as its successors.
614 // Next, add the true and fallthrough blocks as its successors.
678 // Next, add the true and fallthrough blocks as its successors.
  /external/llvm/lib/Transforms/Utils/
CloneFunction.cpp 411 // need to clone this block's successors.
413 for (const BasicBlock *Succ : TI->successors())
468 for (const BasicBlock *Succ : TI->successors())
    [all...]
CodeExtractor.cpp 634 // There are no successors (the block containing the switch itself), which
666 // of the other successors.
750 // Look at all successors of the codeReplacer block. If any of these blocks
  /art/runtime/base/
arena_allocator.cc 48 "Successors ",
  /dalvik/dx/src/com/android/dx/rop/
package-info.java 86 * in the non-exceptional case, where all other successors represent
  /dalvik/dx/src/com/android/dx/ssa/back/
SsaToRop.java 310 "Exit predecessor must have no other successors"
  /external/dexmaker/src/dx/java/com/android/dx/ssa/back/
SsaToRop.java 311 "Exit predecessor must have no other successors"
  /external/libvncserver/common/
sha1.c 19 * revoked by the Internet Society or its successors or assigns.
  /external/llvm/include/llvm/ADT/
DepthFirstIterator.h 124 // Oops, ran out of successors... go up a level on the stack.
  /external/llvm/lib/Target/MSP430/
MSP430InstrInfo.cpp 272 assert(!FBB && "Unconditional branch with multiple successors!");

Completed in 1640 milliseconds

1 2 3 4 5 6 7 891011>>