OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:backedges
(Results
1 - 5
of
5
) sorted by null
/external/v8/src/compiler/
loop-peeling.cc
19
// | | (
backedges
)
45
//
backedges
of the loop correspond to edges from the peeled iteration to
46
// the main loop body, with multiple
backedges
requiring a merge.
69
// | | | (
backedges
)
234
int
backedges
= loop_node->InputCount() - 1;
local
235
if (
backedges
> 1) {
236
// Multiple
backedges
from original loop, therefore multiple output edges
243
graph->NewNode(common->Merge(
backedges
),
backedges
, &inputs[0]);
249
for (int i = 0; i <
backedges
; i++)
[
all
...]
osr.cc
141
// Gather
backedges
from the previous copies of the inner loops of {loop}.
142
NodeVectorVector
backedges
(tmp_zone);
143
TRACE("Gathering
backedges
...\n");
159
backedges
.push_back(NodeVector(tmp_zone));
160
backedges
.back().reserve(header_nodes.size());
167
backedges
.back().push_back(input);
175
int backedge_count = static_cast<int>(
backedges
.size());
181
Node* input =
backedges
[0][index];
188
// Complex case of multiple
backedges
from previous copies requires
189
// merging the
backedges
to create the entry into the loop header
[
all
...]
scheduler.cc
744
// recording
backedges
that form cycles. O(|B|).
782
// Otherwise, compute the loop information from the
backedges
in order
[
all
...]
/prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
loopreschedchecks.go
43
// insertLoopReschedChecks inserts rescheduling checks on loop
backedges
.
45
// TODO: when split information is recorded in export data, insert checks only on
backedges
that can be reached on a split-call-free path.
52
// 1. locate
backedges
.
60
// 5. Rewrite
backedges
to include reschedule check,
68
backedges
:=
backedges
(f)
69
if len(
backedges
) == 0 { // no
backedges
means no rescheduling checks.
88
for _, e := range
backedges
{ // TODO: could filter here by calls in loops, if declared and inferred nosplit are recorded in export data.
104
// loop because there might be
backedges
that haven't been visited yet
460
func
backedges
(f *Func) []Edge {
func
[
all
...]
/prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
loopreschedchecks.go
43
// insertLoopReschedChecks inserts rescheduling checks on loop
backedges
.
45
// TODO: when split information is recorded in export data, insert checks only on
backedges
that can be reached on a split-call-free path.
52
// 1. locate
backedges
.
60
// 5. Rewrite
backedges
to include reschedule check,
68
backedges
:=
backedges
(f)
69
if len(
backedges
) == 0 { // no
backedges
means no rescheduling checks.
88
for _, e := range
backedges
{ // TODO: could filter here by calls in loops, if declared and inferred nosplit are recorded in export data.
104
// loop because there might be
backedges
that haven't been visited yet
460
func
backedges
(f *Func) []Edge {
func
[
all
...]
Completed in 209 milliseconds