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

1 2 3 4 5 67 8 91011>>

  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 52 // successors to it at any time after creating it.
120 /// Succs - The successors of this node.
367 /// these are end-of-path nodes (i.e. they have no successors).
  /external/clang/lib/Analysis/
ThreadSafetyTIL.cpp 171 for (auto *Block : successors())
234 // of its successors have already computed their post-dominators. This is
239 for (auto *Succ : successors()) {
  /external/e2fsprogs/debian/
control.in 213 The ext2, ext3 and ext4 file systems are successors of the original ext
231 The ext2, ext3 and ext4 file systems are successors of the original ext
251 The ext2, ext3 and ext4 file systems are successors of the original ext
  /external/llvm/include/llvm/Analysis/
RegionIterator.h 25 /// This iterator iterates over all successors of a RegionNode.
43 // In BB mode it returns all successors of this BasicBlock as its
44 // successors.
  /external/llvm/lib/Analysis/
DivergenceAnalysis.cpp 201 // A helper function for computeInfluenceRegion that adds successors of "ThisBB"
207 for (BasicBlock *Succ : successors(ThisBB)) {
246 // Terminators with less than two successors won't introduce sync
SparsePropagation.cpp 120 /// successors are reachable from a given terminator instruction.
163 // Invoke instructions successors are always executable.
224 // Mark all feasible successors executable...
CFG.cpp 70 /// successors. It is an error to call this with a block that is not a
86 /// Critical edges are edges from a block with multiple successors to a block
EHPersonalities.cpp 102 for (BasicBlock *Succ : successors(Visiting))
  /external/v8/src/compiler/
graph-visualizer.cc 388 os_ << "successors";
389 for (BasicBlock* successor : current->successors()) {
477 for (BasicBlock* successor : current->successors()) {
instruction.h     [all...]
schedule.cc 309 for (BasicBlock* const successor : from->successors()) {
364 for (BasicBlock const* successor : block->successors()) {
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 153 // If all the node's successors are scheduled, this node is ready
212 /// successors to the newly created node.
362 // Only copy scheduled successors. Cut them from old node's successor
386 /// scheduled successors of the given SUnit to the last copy.
399 // Only copy scheduled successors. Cut them from old node's successor
541 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
ScheduleDAGSDNodes.h 79 /// predecessors / successors info nor the temporary scheduling states.
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/
graph.rst 212 Return a list of nodes where the successors (based on outgoing
217 Return a list of nodes where the successors (based on incoming
  /external/llvm/lib/Target/X86/
README-X86-64.txt 108 Successors according to CFG: 0x203afb0 (#3)
113 Successors according to CFG: 0x203afb0 (#3)
  /art/compiler/optimizing/
dead_code_elimination.cc 75 // Add only those successors that have not been visited yet.
ssa_liveness_analysis.cc 84 // iterate over the successors. When all non-back edge predecessors of a
218 // Set phi inputs of successors of this block corresponding to this block
244 // Add a range that covers this block to all instructions live_in because of successors.
350 // The live_out set of a block is the union of live_in sets of its successors.
  /dalvik/dx/src/com/android/dx/ssa/back/
IdenticalBlockCombiner.java 152 * Replaces one of a block's successors with a different label. Constructs
  /external/dexmaker/src/dx/java/com/android/dx/ssa/back/
IdenticalBlockCombiner.java 157 * Replaces one of a block's successors with a different label. Constructs
  /external/llvm/lib/CodeGen/
LatencyPriorityQueue.cpp 74 // Look at all of the successors of this node. Count the number of nodes that
ShrinkWrap.cpp 298 // Look for a restore point that post-dominates all the successors.
300 Restore = FindIDom<>(*Restore, Restore->successors(), *MPDT);
371 IPdom = FindIDom<>(*IPdom, LoopExitBB->successors(), *MPDT);
462 Restore = FindIDom<>(*Restore, Restore->successors(), *MPDT);
  /external/llvm/lib/Target/BPF/
BPFInstrInfo.cpp 143 assert(!FBB && "Unconditional branch with multiple successors!");
  /external/llvm/lib/Target/WebAssembly/
WebAssemblyCFGStackify.cpp 121 : MBB(MBB), Succs(MBB->successors()) {
123 // successors, the DFS has to pick which order to visit the successors in.
176 // successors are visited in (see above). Also, we can sort the blocks in the
  /external/llvm/lib/Transforms/IPO/
PartialInlining.cpp 61 for (BasicBlock *BB : successors(entryBlock)) {
  /external/llvm/lib/Transforms/Scalar/
LoopInstSimplify.cpp 150 // Add all successors to the worklist, except for loop exit blocks and the

Completed in 971 milliseconds

1 2 3 4 5 67 8 91011>>