- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for DivisionNeedsFixUp (0.32 sec)
-
src/cmd/compile/internal/x86/ssa.go
// negative int is divided by -1. var j *obj.Prog if v.Op == ssa.Op386DIVL || v.Op == ssa.Op386DIVW || v.Op == ssa.Op386MODL || v.Op == ssa.Op386MODW { if ssa.DivisionNeedsFixUp(v) { var c *obj.Prog switch v.Op { case ssa.Op386DIVL, ssa.Op386MODL: c = s.Prog(x86.ACMPL) j = s.Prog(x86.AJEQ) case ssa.Op386DIVW, ssa.Op386MODW:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 01:26:58 UTC 2023 - 26.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
r := ((b << 32) & (1 << 63)) | (0x7ff << 52) | ((b & 0x7fffff) << (52 - 23)) return math.Float64frombits(r) } // DivisionNeedsFixUp reports whether the division needs fix-up code. func DivisionNeedsFixUp(v *Value) bool { return v.AuxInt == 0 } // auxFrom64F encodes a float64 value so it can be stored in an AuxInt. func auxFrom64F(f float64) int64 { if f != f {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
divd := v.Args[0] divdLim, divdLimok := ft.limits[divd.ID] if (divrLimok && (divrLim.max < -1 || divrLim.min > -1)) || (divdLimok && divdLim.min > mostNegativeDividend[v.Op]) { // See DivisionNeedsFixUp in rewrite.go. // v.AuxInt = 1 means we have proved both that the divisor is not -1 // and that the dividend is not the most negative integer, // so we do not need to add fix-up code. v.AuxInt = 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0)