- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for predecessor (0.5 sec)
-
src/cmd/compile/internal/ssa/looprotate.go
// come right after it. after := map[ID][]*Block{} // Check each loop header and decide if we want to move it. for _, loop := range loopnest.loops { b := loop.header var p *Block // b's in-loop predecessor for _, e := range b.Preds { if e.b.Kind != BlockPlain { continue } if loopnest.b2l[e.b.ID] != loop { continue } p = e.b } if p == nil { continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 3K bytes - Viewed (0) -
src/internal/dag/parse.go
} for _, r := range rules { if r.op == "!<" { disallowed = append(disallowed, r) continue } for _, def := range r.def { if def == "NONE" { errorf("NONE cannot be a predecessor") continue } if !g.addNode(def) { errorf("multiple definitions for %s", def) } for _, less := range r.less { if less == "NONE" { continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.7K bytes - Viewed (0)