| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| BasicBlockUtils.h | 185 /// The new predecessors are indicated by the Preds array. The new block is
187 /// from Preds are now pointing.
198 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
206 /// predecessors listed in Preds. The other basic block gets the remaining
217 ArrayRef<BasicBlock *> Preds,
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| BasicBlockUtils.h | 185 /// The new predecessors are indicated by the Preds array. The new block is
187 /// from Preds are now pointing.
198 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
206 /// predecessors listed in Preds. The other basic block gets the remaining
217 ArrayRef<BasicBlock *> Preds,
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| BasicBlockUtils.h | 185 /// The new predecessors are indicated by the Preds array. The new block is
187 /// from Preds are now pointing.
198 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
206 /// predecessors listed in Preds. The other basic block gets the remaining
217 ArrayRef<BasicBlock *> Preds,
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 129 SCEVUnionPredicate Preds;
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| check.go | 25 for i, e := range b.Preds {
31 if pe := e.b.Preds[e.i]; pe.b != b || pe.i != i {
193 if v.Op == OpPhi && len(v.Args) != len(b.Preds) {
194 f.Fatalf("phi length %s does not match pred length %d for block %s", v.LongString(), len(b.Preds), b)
220 for _, c := range b.Preds {
232 if len(f.Entry.Preds) > 0 {
233 f.Fatalf("entry block %s of %s has predecessor(s) %v", f.Entry, f.Name, f.Entry.Preds)
271 y = b.Preds[i].b
347 if b != f.Entry && len(b.Preds) == 0 {
405 for _, e := range b.Preds {
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| check.go | 25 for i, e := range b.Preds {
31 if pe := e.b.Preds[e.i]; pe.b != b || pe.i != i {
193 if v.Op == OpPhi && len(v.Args) != len(b.Preds) {
194 f.Fatalf("phi length %s does not match pred length %d for block %s", v.LongString(), len(b.Preds), b)
220 for _, c := range b.Preds {
232 if len(f.Entry.Preds) > 0 {
233 f.Fatalf("entry block %s of %s has predecessor(s) %v", f.Entry, f.Name, f.Entry.Preds)
271 y = b.Preds[i].b
347 if b != f.Entry && len(b.Preds) == 0 {
405 for _, e := range b.Preds {
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 425 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
676 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
859 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
938 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
[all...] |
| ScheduleDAGFast.cpp | 157 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
280 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
350 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
471 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 72 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
157 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
217 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
509 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
544 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU));
580 if (SU->isAvailable) return; // All preds scheduled
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| ScheduleDAG.h | 236 // Preds/Succs - The SUnits before/after us in the graph.
237 SmallVector<SDep, 4> Preds; // All sunit predecessors.
247 unsigned NumPreds; // # of SDep::Data preds.
249 unsigned NumPredsLeft; // # of preds not scheduled.
398 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
399 if (Preds[i].getSUnit() == N)
550 /// BuildSchedGraph - Build SUnits and set up their Preds and Succs
605 return Node->Preds[Operand].getSUnit();
619 return SUnitIterator(N, (unsigned)N->Preds.size());
632 return Node->Preds[Operand]
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 184 /// The new predecessors are indicated by the Preds array. The new block is
186 /// from Preds are now pointing.
197 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
205 /// predecessors listed in Preds. The other basic block gets the remaining
216 ArrayRef<BasicBlock *> Preds,
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 57 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
105 if (SU->isAvailable) return; // All preds scheduled.
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 185 /// The new predecessors are indicated by the Preds array. The new block is
187 /// from Preds are now pointing.
198 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
206 /// predecessors listed in Preds. The other basic block gets the remaining
217 ArrayRef<BasicBlock *> Preds,
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 185 /// The new predecessors are indicated by the Preds array. The new block is
187 /// from Preds are now pointing.
198 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
206 /// predecessors listed in Preds. The other basic block gets the remaining
217 ArrayRef<BasicBlock *> Preds,
|
