- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for canSpeculativelyExecute (0.25 sec)
-
src/cmd/compile/internal/ssa/branchelim.go
return false } yes, no := b.Succs[0].Block(), b.Succs[1].Block() if !isLeafPlain(yes) || len(yes.Values) > 1 || !canSpeculativelyExecute(yes) { return false } if !isLeafPlain(no) || len(no.Values) > 1 || !canSpeculativelyExecute(no) { return false } if b.Succs[0].Block().Succs[0].Block() != b.Succs[1].Block().Succs[0].Block() { return false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 30 17:46:51 UTC 2022 - 12.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse_comparisons.go
// is lower than a fixed amount. Bear in mind however that the // other optimization passes might yet reduce the cost of b // significantly so we shouldn't be overly conservative. if !canSpeculativelyExecute(b) { return false } // Logically combine the control values for p and b. v := b.NewValue0(bc.Pos, op, bc.Type) v.AddArg(pc) v.AddArg(bc)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 4K bytes - Viewed (0)