Searched refs:backedges (Results 1 – 11 of 11) sorted by relevance
| /external/v8/src/compiler/ |
| D | loop-peeling.cc | 230 int backedges = loop_node->InputCount() - 1; in Peel() local
231 if (backedges > 1) { in Peel()
239 graph->NewNode(common->Merge(backedges), backedges, &inputs[0]); in Peel()
245 for (int i = 0; i < backedges; i++) { in Peel()
251 const Operator* op = common->ResizeMergeOrPhi(node->op(), backedges); in Peel()
252 Node* phi = graph->NewNode(op, backedges + 1, &inputs[0]); in Peel()
|
| D | osr.cc | 133 NodeVectorVector backedges(tmp_zone); in PeelOuterLoopsForOsr() local
150 backedges.push_back(NodeVector(tmp_zone)); in PeelOuterLoopsForOsr()
151 backedges.back().reserve(header_nodes.size()); in PeelOuterLoopsForOsr()
158 backedges.back().push_back(input); in PeelOuterLoopsForOsr()
166 int backedge_count = static_cast<int>(backedges.size()); in PeelOuterLoopsForOsr()
172 Node* input = backedges[0][index]; in PeelOuterLoopsForOsr()
187 tmp_inputs.push_back(backedges[edge][index]); in PeelOuterLoopsForOsr()
|
| D | scheduler.cc | 919 size_t num_loops, ZoneVector<Backedge>* backedges) { in ComputeLoopInfo() argument
933 for (size_t i = 0; i < backedges->size(); i++) { in ComputeLoopInfo()
934 BasicBlock* member = backedges->at(i).first; in ComputeLoopInfo()
935 BasicBlock* header = member->SuccessorAt(backedges->at(i).second); in ComputeLoopInfo()
|
| /external/llvm/test/Transforms/LoopSimplify/ |
| D | indirectbr-backedge.ll | 3 ; LoopSimplify shouldn't split loop backedges that use indirectbr.
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | unsimplified-loop.ll | 3 ; This loop has no preheader, multiple backedges, etc., but ScalarEvolution
|
| /external/llvm/test/Analysis/BlockFrequencyInfo/ |
| D | basic.ll | 10 ; Loop backedges are weighted and thus their bodies have a greater frequency.
|
| D | irreducible.ll | 49 ; that are targets of a backedge within it (excluding backedges within true
53 ; intercepts all the edges to the headers. All backedges and entries point to
|
| /external/llvm/docs/ |
| D | BlockFrequencyTerminology.rst | 67 bottom-up, ignoring backedges; i.e., as a DAG. After each loop is processed,
|
| D | Statepoints.rst | 729 loop backedges locations. Extending this to work with return polls would be
|
| /external/v8/test/cctest/compiler/ |
| D | test-osr.cc | 302 While(OsrDeconstructorTester& R, Node* cond, bool is_osr, int backedges = 1) in While()
304 loop = t.NewLoop(is_osr, backedges); in While()
|
| /external/llvm/test/CodeGen/WebAssembly/ |
| D | cfg-stackify.ll | 11 ; Test that loops are made contiguous, even in the presence of split backedges.
637 ; Test a case where there are multiple backedges and multiple loop exits
|