/prebuilts/go/linux-x86/src/cmd/vet/internal/cfg/ |
cfg_test.go | 151 for _, succ := range b.Succs { 152 visit(succ)
|
cfg.go | 127 for _, succ := range b.Succs { 128 fmt.Fprintf(&buf, " %d", succ.index)
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
MachineBasicBlock.cpp | 341 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) { 351 Successors.push_back(succ); 352 succ->addPredecessor(this); 355 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) { 356 succ->removePredecessor(this); 357 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); 414 MachineBasicBlock *Succ = *fromMBB->succ_begin(); 422 addSuccessor(Succ, weight); 423 fromMBB->removeSuccessor(Succ); 433 MachineBasicBlock *Succ = *fromMBB->succ_begin() [all...] |
/external/toolchain-utils/automation/common/ |
job.py | 94 res.extend(['%d' % succ.id for succ in self.successors])
|
/prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
plive.go | 53 succ []*BasicBlock // successors; if none, probably ends in return statement 113 // and its pred/succ slice together. 117 succ [2]*BasicBlock 127 result.succ = b.succ[:0] 140 from.succ = append(from.succ, to) 191 for _, succ := range bb.succ { 192 fmt.Printf(" %d", succ.rpo [all...] |
/prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
plive.go | 53 succ []*BasicBlock // successors; if none, probably ends in return statement 113 // and its pred/succ slice together. 117 succ [2]*BasicBlock 127 result.succ = b.succ[:0] 140 from.succ = append(from.succ, to) 191 for _, succ := range bb.succ { 192 fmt.Printf(" %d", succ.rpo [all...] |
/dalvik/dexgen/src/com/android/dexgen/dex/code/ |
RopTranslator.java | 263 int succ = block.getPrimarySuccessor(); local 271 if ((succ >= 0) && (succ != nextLabel)) { 286 output.reverseBranch(1, addresses.getStart(succ)); 295 addresses.getStart(succ));
|
/dalvik/dx/src/com/android/dx/dex/code/ |
RopTranslator.java | 270 int succ = block.getPrimarySuccessor(); local 278 if ((succ >= 0) && (succ != nextLabel)) { 293 output.reverseBranch(1, addresses.getStart(succ)); 302 addresses.getStart(succ)); [all...] |
/external/v8/src/compiler/ |
schedule.cc | 196 void Schedule::AddGoto(BasicBlock* block, BasicBlock* succ) { 199 AddSuccessor(block, succ); 423 void Schedule::AddSuccessor(BasicBlock* block, BasicBlock* succ) { 424 block->AddSuccessor(succ); 425 succ->AddPredecessor(block);
|
verifier.cc | 1456 BasicBlock* succ = block->SuccessorAt(s); local 1498 BasicBlock* succ = block->SuccessorAt(s); local [all...] |
/libcore/ojluni/src/main/java/java/util/concurrent/ |
ConcurrentLinkedDeque.java | 255 * - all live nodes are reachable from the first node via succ() 720 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedDeque [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
MachineBasicBlock.h | 257 /// addSuccessor - Add succ as a successor of this MachineBasicBlock. 258 /// The Predecessors list of succ is automatically updated. WEIGHT 262 void addSuccessor(MachineBasicBlock *succ, uint32_t weight = 0); 265 /// MachineBasicBlock. The Predecessors list of succ is automatically updated. 267 void removeSuccessor(MachineBasicBlock *succ); 270 /// this MachineBasicBlock. The Predecessors list of succ is automatically 342 MachineBasicBlock *SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P); 427 uint32_t getSuccWeight(MachineBasicBlock *succ);
|
/external/ltp/testcases/kernel/power_management/lib/ |
pm_sched_mc.py | 338 succ = os.system('./ebizzy -t%s -s4096 -S %s >/dev/null &' 342 succ = os.system('taskset -c %s ./ebizzy -t%s -s4096 -S %s >/dev/null' 345 succ = os.system('./ebizzy -t%s -s4096 -S %s >/dev/null' 348 if succ == 0:
|
/prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/gen/ |
rulegen.go | 260 for _, succ := range succs { 261 if m[succ] { 262 log.Fatalf("can't have a repeat successor name %s in %s", succ, rule) 264 m[succ] = true 266 for _, succ := range newsuccs { 267 if !m[succ] { 268 log.Fatalf("unknown successor %s in %s", succ, rule) 270 delete(m, succ)
|
/prebuilts/go/darwin-x86/src/cmd/vet/internal/cfg/ |
cfg.go | 127 for _, succ := range b.Succs { 128 fmt.Fprintf(&buf, " %d", succ.index)
|
/prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/gen/ |
rulegen.go | 260 for _, succ := range succs { 261 if m[succ] { 262 log.Fatalf("can't have a repeat successor name %s in %s", succ, rule) 264 m[succ] = true 266 for _, succ := range newsuccs { 267 if !m[succ] { 268 log.Fatalf("unknown successor %s in %s", succ, rule) 270 delete(m, succ)
|
/dalvik/dx/src/com/android/dx/ssa/ |
SsaBasicBlock.java | 603 SsaBasicBlock succ; local 605 succ = parent.getBlocks().get(i); 606 succ.addMoveToBeginning(result, source); [all...] |
/dalvik/dx/src/com/android/dx/cf/code/ |
Ropper.java | 861 int succ = successors.get(i); local 863 mergeAndWorkAsNecessary(succ, block.getLabel(), 866 ex.addContext("...while merging to block " + Hex.u2(succ)); 1779 int succ = successors.get(i); local [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
DeadStoresChecker.cpp | 97 if (const CFGBlock *succ = *i) 98 worklist.push_back(succ);
|
/external/llvm/include/llvm/Analysis/ |
DependenceAnalysis.h | 200 void setNextSuccessor(const Dependence *succ) { NextSuccessor = succ; } [all...] |
/external/llvm/test/Bindings/OCaml/ |
target.ml | 68 ignore (T.succ target);
|
/prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
func_test.go | 186 for _, succ := range c.succs { 187 b.AddEdgeTo(blocks[succ]) 226 func Goto(succ string) ctrl { 227 return ctrl{BlockPlain, "", []string{succ}}
|
check.go | 23 f.Fatalf("block pred/succ not crosslinked correctly %d:%s %d:%s", i, b, se.i, se.b) 28 f.Fatalf("block succ/pred not crosslinked correctly %d:%s %d:%s", i, b, pe.i, pe.b)
|
/prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
func_test.go | 186 for _, succ := range c.succs { 187 b.AddEdgeTo(blocks[succ]) 226 func Goto(succ string) ctrl { 227 return ctrl{BlockPlain, "", []string{succ}}
|
/external/llvm/bindings/ocaml/target/ |
llvm_target.mli | 142 (** [succ t] returns the next target after [t], or [None] 144 val succ : t -> t option
|