- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for addBranchRestrictions (0.28 sec)
-
src/cmd/compile/internal/ssa/fuse_branchredirect.go
} ft.checkpoint() // Assume branch p->b is taken. addBranchRestrictions(ft, p, pbranch) // Check if any outgoing branch is unreachable based on the above condition. parent := b for j, bbranch := range [...]branch{positive, negative} { ft.checkpoint() // Try to update relationship b->child, and check if the contradiction occurs. addBranchRestrictions(ft, parent, bbranch) unsat := ft.unsat ft.restore()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
addRestrictions(b, ft, d, iv.ind, iv.max, lt) } else { addRestrictions(b, ft, d, iv.ind, iv.max, lt|eq) } } // addBranchRestrictions updates the factsTables ft with the facts learned when // branching from Block b in direction br. func addBranchRestrictions(ft *factsTable, b *Block, br branch) { c := b.Controls[0] switch { case br == negative: addRestrictions(b, ft, boolean, nil, c, eq)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0)