- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 114 for shifts (0.25 sec)
-
src/runtime/asm_386.s
DATA shifts<>+0x28(SB)/4, $0xffffffff DATA shifts<>+0x2c(SB)/4, $0xffffffff DATA shifts<>+0x30(SB)/4, $0xff0f0e0d DATA shifts<>+0x34(SB)/4, $0xffffffff DATA shifts<>+0x38(SB)/4, $0xffffffff DATA shifts<>+0x3c(SB)/4, $0xffffffff DATA shifts<>+0x40(SB)/4, $0x0f0e0d0c DATA shifts<>+0x44(SB)/4, $0xffffffff DATA shifts<>+0x48(SB)/4, $0xffffffff DATA shifts<>+0x4c(SB)/4, $0xffffffff
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 15:45:13 UTC 2024 - 43.1K bytes - Viewed (0) -
test/codegen/shift.go
if shift >= 0 && shift < 64 { // arm64:"LSL",-"CSEL" r1 = val64 << shift } if shift >= 0 && shift < 32 { // arm64:"LSL",-"CSEL" r2 = val32 << shift } if shift >= 0 && shift < 16 { // arm64:"LSL",-"CSEL" r3 = val16 << shift } if shift >= 0 && shift < 8 { // arm64:"LSL",-"CSEL" r4 = val8 << shift } return r1, r2, r3, r4
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 18:53:43 UTC 2024 - 12.7K bytes - Viewed (0) -
test/prove.go
} func sh32x64(n int32) int32 { if n < 0 { return n } return n >> uint64(31) // ERROR "Proved Rsh32x64 shifts to zero" } func sh16(n int16) int16 { if n < 0 { return n } return n >> 15 // ERROR "Proved Rsh16x64 shifts to zero" } func sh64noopt(n int64) int64 { return n >> 63 // not optimized; n could be negative }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 23 00:02:36 UTC 2024 - 21.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/memcombine.go
} } // Check for reads in little-endian or big-endian order. shift0 := r[0].shift isLittleEndian := true for i := int64(0); i < n; i++ { if r[i].shift != shift0+i*size*8 { isLittleEndian = false break } } isBigEndian := true for i := int64(0); i < n; i++ { if r[i].shift != shift0-i*size*8 { isBigEndian = false break } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 19:45:41 UTC 2024 - 18.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/RISCV64.rules
(SRLI <t> [x] (MOVWUreg y)) && x >= 0 && x <= 31 => (SRLIW <t> [int64(x)] y) // Replace right shifts that exceed size of signed type. (SRAI <t> [x] (MOVBreg y)) && x >= 8 => (SRAI [63] (SLLI <t> [56] y)) (SRAI <t> [x] (MOVHreg y)) && x >= 16 => (SRAI [63] (SLLI <t> [48] y)) (SRAI <t> [x] (MOVWreg y)) && x >= 32 => (SRAIW [31] y) // Eliminate right shifts that exceed size of unsigned type. (SRLI <t> [x] (MOVBUreg y)) && x >= 8 => (MOVDconst <t> [0])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 14:57:07 UTC 2024 - 40.3K bytes - Viewed (0) -
src/cmd/asm/internal/asm/asm.go
} else { p.errorf("bad addr size for DATA argument: %d", sz) } } } // asmGlobl assembles a GLOBL pseudo-op. // GLOBL shifts<>(SB),8,$256 // GLOBL shifts<>(SB),$256 func (p *Parser) asmGlobl(operands [][]lex.Token) { if len(operands) != 2 && len(operands) != 3 { p.errorf("expect two or three operands for GLOBL") return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:04:54 UTC 2024 - 25.5K bytes - Viewed (0) -
src/compress/bzip2/bzip2.go
} for i := range tt { b := tt[i] & 0xff tt[c[b]] |= uint32(i) << 8 c[b]++ } return tt[origPtr] >> 8 } // This is a standard CRC32 like in hash/crc32 except that all the shifts are reversed, // causing the bits in the input to be processed in the reverse of the usual order. var crctab [256]uint32 func init() { const poly = 0x04C11DB7 for i := range crctab {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 13K bytes - Viewed (0) -
operator/cmd/mesh/install.go
}) if err != nil { return err } // If there is no default webhook but a revisioned default webhook exists, // and we are installing a new IOP with default semantics, the default webhook shifts. if exists && len(mwhs.Items) == 0 && iop.Spec.GetRevision() == "" { p.Println("The default revision has been updated to point to this installation.") } return nil
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri May 17 21:52:35 UTC 2024 - 15.4K bytes - Viewed (0) -
test/codegen/arithmetic.go
d = divd / divr // amd64:-"JMP" // 386:-"JMP" e = divd % divr d += e } return d, e } // Check that len() and cap() calls divided by powers of two are // optimized into shifts and ands func LenDiv1(a []int) int { // 386:"SHRL\t[$]10" // amd64:"SHRQ\t[$]10" // arm64:"LSR\t[$]10",-"SDIV" // arm:"SRL\t[$]10",-".*udiv" // ppc64x:"SRD"\t[$]10" return len(a) / 1024 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 15:28:00 UTC 2024 - 15.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
{name: "Xor16", argLength: 2, commutative: true}, {name: "Xor32", argLength: 2, commutative: true}, {name: "Xor64", argLength: 2, commutative: true}, // For shifts, AxB means the shifted value has A bits and the shift amount has B bits. // Shift amounts are considered unsigned. // If arg1 is known to be nonnegative and less than the number of bits in arg0, // then auxInt may be set to 1.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0)