| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| debug.go | 377 var preds []*Block
378 for _, pred := range b.Preds {
380 preds = append(preds, pred.b)
384 if len(preds) > 0 {
385 p := preds[0]
399 if state.loggingEnabled && len(b.Preds) > 1 {
400 state.logf("Starting merge with state from %v: %v\n", b.Preds[0].b, state.BlockString(blockLocs[b.Preds[0].b.ID]))
402 for i := 1; i < len(preds); i++
[all...] |
| rewrite.go | 463 if len(b.Preds) > 1 {
467 b = b.Preds[0].b
488 if len(b.Preds) > 1 {
491 b = b.Preds[0].b
|
| regalloc.go | 10 // (those targeting a block with len(Preds)>1) are processed to
229 // We record the index in the Preds list where the primary predecessor sits.
651 for i, e := range b.Preds {
656 if best == -1 || blockOrder[p.ID] > blockOrder[b.Preds[best].b.ID] {
786 // any inputs. This is the state the len(b.Preds)>1
844 } else if len(b.Preds) == 1 {
846 s.setState(s.endRegs[b.Preds[0].b.ID])
868 p := b.Preds[idx].b
[all...] |
| html.go | 467 if len(b.Preds) > 0 {
469 for _, e := range b.Preds {
|
| prove.go | 571 if sdom.isAncestorEq(p.Succs[0].b, b) && len(p.Succs[0].b.Preds) == 1 {
574 if sdom.isAncestorEq(p.Succs[1].b, b) && len(p.Succs[1].b.Preds) == 1 {
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopVersioning.cpp | 52 Preds = std::move(Check);
|
| SimplifyCFG.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | [all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenSchedule.cpp | [all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| regalloc.go | 10 // (those targeting a block with len(Preds)>1) are processed to
229 // We record the index in the Preds list where the primary predecessor sits.
651 for i, e := range b.Preds {
656 if best == -1 || blockOrder[p.ID] > blockOrder[b.Preds[best].b.ID] {
786 // any inputs. This is the state the len(b.Preds)>1
844 } else if len(b.Preds) == 1 {
846 s.setState(s.endRegs[b.Preds[0].b.ID])
868 p := b.Preds[idx].b
[all...] |
| html.go | 467 if len(b.Preds) > 0 {
469 for _, e := range b.Preds {
|
| prove.go | 571 if sdom.isAncestorEq(p.Succs[0].b, b) && len(p.Succs[0].b.Preds) == 1 {
574 if sdom.isAncestorEq(p.Succs[1].b, b) && len(p.Succs[1].b.Preds) == 1 {
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 691 SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB));
692 while (!Preds.empty()) {
693 BasicBlock *Pred = Preds.pop_back_val();
[all...] |
| /external/swiftshader/third_party/LLVM/lib/VMCore/ |
| Verifier.cpp | 736 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
738 std::sort(Preds.begin(), Preds.end());
745 Assert1(PN->getNumIncomingValues() == Preds.size(),
770 Assert3(Values[i].first == Preds[i],
772 Values[i].first, Preds[i]);
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGInstrs.cpp | [all...] |
| MachineScheduler.cpp | 622 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
[all...] |
| MachineVerifier.cpp | 123 BlockSet Preds, Succs;
545 MInfo.Preds.insert(MBB.pred_begin(), MBB.pred_end());
546 if (MInfo.Preds.size() != MBB.pred_size())
593 if (!MBBInfoMap[*I].Preds.count(MBB)) {
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 199 SmallVector<BasicBlock *, 2> Preds;
304 edge_iterator pred_begin() const { return Preds.begin(); }
305 edge_iterator pred_end() const { return Preds.end(); }
310 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); }
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 349 // Scan up to find glued preds.
425 // Pass 2: add the preds, succs, etc.
760 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
762 if (I->isCtrl()) continue; // ignore chain preds
771 if (II->isCtrl()) continue; // ignore chain preds
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | [all...] |
| LoopUnswitch.cpp | [all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| PostRASchedulerList.cpp | 608 bool available = SUnits[i].Preds.empty();
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ProfileInfo.cpp | 443 BasicBlock *const *Preds,
459 const BasicBlock * Pred = Preds[pred];
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| plive.go | 902 if len(b.Preds) == 0 {
912 be := lv.blockEffects(b.Preds[0].Block())
916 for _, pred := range b.Preds[1:] {
1118 for j, pred := range b.Preds {
[all...] |
