| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| block.go | 41 Preds []Edge
59 // Storage for Succs, Preds, and Values
69 // c.Preds = [?, ?, ?, {b,0}]
70 // d.Preds = [?, {b,1}, ?]
80 // c.Preds = [{b,0},{b,1}]
83 // block edge goes to (in a Succs list) or from (in a Preds list)
87 // e.b.Preds[e.i] = Edge{x,idx}
150 j := len(c.Preds)
152 c.Preds = append(c.Preds, Edge{b, i}
[all...] |
| phiopt.go | 29 if len(b.Preds) != 2 || len(b.Values) == 0 {
34 pb0, b0 := b, b.Preds[0].b
35 for len(b0.Succs) == 1 && len(b0.Preds) == 1 {
36 pb0, b0 = b0, b0.Preds[0].b
41 pb1, b1 := b, b.Preds[1].b
42 for len(b1.Succs) == 1 && len(b1.Preds) == 1 {
43 pb1, b1 = b1, b1.Preds[0].b
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 67 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();
121 Preds.push_back(D);
135 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
146 Preds.erase(I);
201 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
202 E = SU->Preds.end(); I != E; ++I) {
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin()
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 100 assert(I != E && "No preds, but we have an edge to the block?");
107 // non-critical iff all preds come from TI's block.
122 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
125 static void CreatePHIsForSplitLoopExit(SmallVectorImpl<BasicBlock *> &Preds,
143 PHINode *NewPN = PHINode::Create(PN->getType(), Preds.size(), "split",
145 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
146 NewPN->addIncoming(V, Preds[i]);
350 // Collect all the preds that are inside the loop, and note
351 // whether there are any preds outside the loop
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScheduleDAGEmit.cpp | 37 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
39 if (I->isCtrl()) continue; // ignore chain preds
48 if (II->isCtrl()) continue; // ignore chain preds
|
| ScheduleDAG.cpp | 90 for (SmallVector<SDep, 4>::const_iterator I = Preds.begin(), E = Preds.end();
113 Preds.push_back(D);
127 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end();
142 assert(FoundSucc && "Mismatching preds / succs lists!");
144 Preds.erase(I);
191 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
192 E = SU->Preds.end(); I != E; ++I) {
232 for (SUnit::const_pred_iterator I = Cur->Preds.begin()
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
114 SmallVector<BlkT*, 10> Preds;
117 Preds.clear();
118 Traits::FindPredecessorBlocks(Info->BB, &Preds);
119 Info->NumPreds = Preds.size();
121 Info->Preds = nullptr;
123 Info->Preds = static_cast<BBInfo**>
128 BlkT *Pred = Preds[p];
133 Info->Preds[p] = BBMapBucket.second
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 43 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
48 NumPreds(0), Preds(0), PHITag(0) { }
103 SmallVector<BlkT*, 10> Preds;
106 Preds.clear();
107 Traits::FindPredecessorBlocks(Info->BB, &Preds);
108 Info->NumPreds = Preds.size();
110 Info->Preds = 0;
112 Info->Preds = static_cast<BBInfo**>
117 BlkT *Pred = Preds[p];
122 Info->Preds[p] = BBMapBucket.second
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
114 SmallVector<BlkT*, 10> Preds;
117 Preds.clear();
118 Traits::FindPredecessorBlocks(Info->BB, &Preds);
119 Info->NumPreds = Preds.size();
121 Info->Preds = nullptr;
123 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
127 BlkT *Pred = Preds[p];
132 Info->Preds[p] = BBMapBucket.second
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
114 SmallVector<BlkT*, 10> Preds;
117 Preds.clear();
118 Traits::FindPredecessorBlocks(Info->BB, &Preds);
119 Info->NumPreds = Preds.size();
121 Info->Preds = nullptr;
123 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
127 BlkT *Pred = Preds[p];
132 Info->Preds[p] = BBMapBucket.second
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
114 SmallVector<BlkT*, 10> Preds;
117 Preds.clear();
118 Traits::FindPredecessorBlocks(Info->BB, &Preds);
119 Info->NumPreds = Preds.size();
121 Info->Preds = nullptr;
123 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
127 BlkT *Pred = Preds[p];
132 Info->Preds[p] = BBMapBucket.second
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
114 SmallVector<BlkT*, 10> Preds;
117 Preds.clear();
118 Traits::FindPredecessorBlocks(Info->BB, &Preds);
119 Info->NumPreds = Preds.size();
121 Info->Preds = nullptr;
123 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
127 BlkT *Pred = Preds[p];
132 Info->Preds[p] = BBMapBucket.second
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
114 SmallVector<BlkT*, 10> Preds;
117 Preds.clear();
118 Traits::FindPredecessorBlocks(Info->BB, &Preds);
119 Info->NumPreds = Preds.size();
121 Info->Preds = nullptr;
123 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
127 BlkT *Pred = Preds[p];
132 Info->Preds[p] = BBMapBucket.second
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
114 SmallVector<BlkT*, 10> Preds;
117 Preds.clear();
118 Traits::FindPredecessorBlocks(Info->BB, &Preds);
119 Info->NumPreds = Preds.size();
121 Info->Preds = nullptr;
123 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
127 BlkT *Pred = Preds[p];
132 Info->Preds[p] = BBMapBucket.second
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 64 BBInfo **Preds = nullptr;
127 SmallVector<BlkT *, 10> Preds;
130 Preds.clear();
131 Traits::FindPredecessorBlocks(Info->BB, &Preds);
132 Info->NumPreds = Preds.size();
134 Info->Preds = nullptr;
136 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
140 BlkT *Pred = Preds[p];
145 Info->Preds[p] = BBMapBucket.second;
153 Info->Preds[p] = PredInfo
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 64 BBInfo **Preds = nullptr;
127 SmallVector<BlkT *, 10> Preds;
130 Preds.clear();
131 Traits::FindPredecessorBlocks(Info->BB, &Preds);
132 Info->NumPreds = Preds.size();
134 Info->Preds = nullptr;
136 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
140 BlkT *Pred = Preds[p];
145 Info->Preds[p] = BBMapBucket.second;
153 Info->Preds[p] = PredInfo
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 64 BBInfo **Preds = nullptr;
127 SmallVector<BlkT *, 10> Preds;
130 Preds.clear();
131 Traits::FindPredecessorBlocks(Info->BB, &Preds);
132 Info->NumPreds = Preds.size();
134 Info->Preds = nullptr;
136 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
140 BlkT *Pred = Preds[p];
145 Info->Preds[p] = BBMapBucket.second;
153 Info->Preds[p] = PredInfo
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 64 BBInfo **Preds = nullptr;
127 SmallVector<BlkT *, 10> Preds;
130 Preds.clear();
131 Traits::FindPredecessorBlocks(Info->BB, &Preds);
132 Info->NumPreds = Preds.size();
134 Info->Preds = nullptr;
136 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
140 BlkT *Pred = Preds[p];
145 Info->Preds[p] = BBMapBucket.second;
153 Info->Preds[p] = PredInfo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 64 BBInfo **Preds = nullptr;
127 SmallVector<BlkT *, 10> Preds;
130 Preds.clear();
131 Traits::FindPredecessorBlocks(Info->BB, &Preds);
132 Info->NumPreds = Preds.size();
134 Info->Preds = nullptr;
136 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
140 BlkT *Pred = Preds[p];
145 Info->Preds[p] = BBMapBucket.second;
153 Info->Preds[p] = PredInfo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 64 BBInfo **Preds = nullptr;
127 SmallVector<BlkT *, 10> Preds;
130 Preds.clear();
131 Traits::FindPredecessorBlocks(Info->BB, &Preds);
132 Info->NumPreds = Preds.size();
134 Info->Preds = nullptr;
136 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
140 BlkT *Pred = Preds[p];
145 Info->Preds[p] = BBMapBucket.second;
153 Info->Preds[p] = PredInfo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 64 BBInfo **Preds = nullptr;
127 SmallVector<BlkT *, 10> Preds;
130 Preds.clear();
131 Traits::FindPredecessorBlocks(Info->BB, &Preds);
132 Info->NumPreds = Preds.size();
134 Info->Preds = nullptr;
136 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
140 BlkT *Pred = Preds[p];
145 Info->Preds[p] = BBMapBucket.second;
153 Info->Preds[p] = PredInfo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 64 BBInfo **Preds = nullptr;
127 SmallVector<BlkT *, 10> Preds;
130 Preds.clear();
131 Traits::FindPredecessorBlocks(Info->BB, &Preds);
132 Info->NumPreds = Preds.size();
134 Info->Preds = nullptr;
136 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
140 BlkT *Pred = Preds[p];
145 Info->Preds[p] = BBMapBucket.second;
153 Info->Preds[p] = PredInfo
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCHazardRecognizers.cpp | 40 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
41 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
45 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier())
49 if (SU->Preds[i].getSUnit() == CurGroup[j])
66 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
67 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
71 if (SU->Preds[i].isCtrl())
75 if (SU->Preds[i].getSUnit() == CurGroup[j])
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 279 ArrayRef<BasicBlock *> Preds,
296 for (BasicBlock *Pred : Preds) {
297 // If we need to preserve LCSSA, determine if any of the preds is a loop
304 // If we need to preserve LoopInfo, note whether any of the preds crosses
324 for (BasicBlock *Pred : Preds) {
351 ArrayRef<BasicBlock *> Preds, BranchInst *BI,
354 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end());
362 InVal = PN->getIncomingValueForBlock(Preds[0]);
398 PHINode::Create(PN->getType(), Preds.size(), PN->getName() + ".ph", BI)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| phiopt.go | 29 if len(b.Preds) != 2 || len(b.Values) == 0 {
34 pb0, b0 := b, b.Preds[0].b
35 for len(b0.Succs) == 1 && len(b0.Preds) == 1 {
36 pb0, b0 = b0, b0.Preds[0].b
41 pb1, b1 := b, b.Preds[1].b
42 for len(b1.Succs) == 1 && len(b1.Preds) == 1 {
43 pb1, b1 = b1, b1.Preds[0].b
|
