- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for blockOrder (0.48 sec)
-
src/cmd/compile/internal/ssa/regalloc.go
// According to the layout algorithm, the predecessor with the // smaller blockOrder is the true branch, and the test results show // that it is better to choose the predecessor with a smaller // blockOrder than no choice. if pb.likelyBranch() && !pSel.likelyBranch() || s.blockOrder[pb.ID] < s.blockOrder[pSel.ID] { idx = i } } } if idx < 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
src/runtime/select.go
lockorder[j] = lockorder[k] j = k } lockorder[j] = pollorder[i] } for i := len(lockorder) - 1; i >= 0; i-- { o := lockorder[i] c := scases[o].c lockorder[i] = lockorder[0] j := 0 for { k := j*2 + 1 if k >= i { break } if k+1 < i && scases[lockorder[k]].c.sortkey() < scases[lockorder[k+1]].c.sortkey() { k++ }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 13 21:36:04 UTC 2024 - 15K bytes - Viewed (0)