- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 553 for Shift1 (0.1 sec)
-
src/math/big/decimal_test.go
} } } var sink string func BenchmarkDecimalConversion(b *testing.B) { for i := 0; i < b.N; i++ { for shift := -100; shift <= +100; shift++ { var d decimal d.init(natOne, shift) sink = d.String() } } } func BenchmarkFloatString(b *testing.B) { x := new(Float) for _, prec := range []uint{1e2, 1e3, 1e4, 1e5} {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 18 05:54:35 UTC 2016 - 3.3K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/armerror.s
MOVB R0>>8, R2 // ERROR "illegal shift" MOVH R0<<16, R2 // ERROR "illegal shift" MOVBS R0->8, R2 // ERROR "illegal shift" MOVHS R0<<24, R2 // ERROR "illegal shift" MOVBU R0->24, R2 // ERROR "illegal shift" MOVHU R0@>1, R2 // ERROR "illegal shift" XTAB R0>>8, R2 // ERROR "illegal shift" XTAH R0<<16, R2 // ERROR "illegal shift"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 03 14:06:21 UTC 2017 - 14.4K bytes - Viewed (0) -
staging/src/k8s.io/api/authentication/v1alpha1/generated.pb.go
case 0: for shift := uint(0); ; shift += 7 { if shift >= 64 { return 0, ErrIntOverflowGenerated } if iNdEx >= l { return 0, io.ErrUnexpectedEOF } iNdEx++ if dAtA[iNdEx-1] < 0x80 { break } } case 1: iNdEx += 8 case 2: var length int for shift := uint(0); ; shift += 7 { if shift >= 64 { return 0, ErrIntOverflowGenerated
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 06:06:37 UTC 2024 - 14.8K bytes - Viewed (0) -
src/crypto/des/block.go
} // Expand 48-bit input to 64-bit, with each 6-bit block padded by extra two bits at the top. // By doing so, we can have the input blocks (four bits each), and the key blocks (six bits each) well-aligned without // extra shifts/rotations for alignments. func unpack(x uint64) uint64 { return ((x>>(6*1))&0xff)<<(8*0) | ((x>>(6*3))&0xff)<<(8*1) | ((x>>(6*5))&0xff)<<(8*2) | ((x>>(6*7))&0xff)<<(8*3) | ((x>>(6*0))&0xff)<<(8*4) |
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 6.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/arch/ppc64/ppc64asm/decode.go
case TypeImmSigned: return Imm(a.BitFields.ParseSigned(i) << a.Shift) case TypeImmUnsigned: return Imm(a.BitFields.Parse(i) << a.Shift) case TypePCRel: return PCRel(a.BitFields.ParseSigned(i) << a.Shift) case TypeLabel: return Label(a.BitFields.ParseSigned(i) << a.Shift) case TypeOffset: return Offset(a.BitFields.ParseSigned(i) << a.Shift) case TypeNegOffset:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 22 17:16:14 UTC 2022 - 5.6K bytes - Viewed (0) -
prow/integ-suite-kind.sh
--node-image) NODE_IMAGE=$2 shift 2 ;; # Config for enabling different Kubernetes features in KinD (see prow/config{endpointslice.yaml,trustworthy-jwt.yaml}). --kind-config) KIND_CONFIG=$2 shift 2 ;; --skip-setup) SKIP_SETUP=true shift ;; --skip-cleanup) SKIP_CLEANUP=true shift ;; --skip-build) SKIP_BUILD=true
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Apr 18 05:42:41 UTC 2024 - 5.1K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
} case lex.LSH: p.next() shift := p.factor() if int64(shift) < 0 { p.errorf("negative left shift count") } return value << shift case lex.RSH: p.next() shift := p.term() if int64(shift) < 0 { p.errorf("negative right shift count") } if int64(value) < 0 { p.errorf("right shift of value with high bit set") } value >>= shift
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 14:34:57 UTC 2024 - 36.9K bytes - Viewed (0) -
src/crypto/md5/md5block_s390x.s
CMPBEQ R6, R7, end loop: STMY R2, R5, tmp-16(SP) MOVWBR 0(R6), R8 MOVWZ R5, R9 #define ROUND1(a, b, c, d, index, const, shift) \ XOR c, R9; \ ADD $const, a; \ ADD R8, a; \ MOVWBR (index*4)(R6), R8; \ AND b, R9; \ XOR d, R9; \ ADD R9, a; \ RLL $shift, a; \ MOVWZ c, R9; \ ADD b, a ROUND1(R2,R3,R4,R5, 1,0xd76aa478, 7); ROUND1(R5,R2,R3,R4, 2,0xe8c7b756,12);
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 4.4K bytes - Viewed (0) -
src/strings/search.go
// badCharSkip[b] is len(pattern). // // Whenever a mismatch is found with byte b in the text, we can safely // shift the matching frame at least badCharSkip[b] until the next time // the matching char could be in alignment. badCharSkip [256]int // goodSuffixSkip[i] defines how far we can shift the matching frame given // that the suffix pattern[i+1:] matches, but the byte pattern[i] does // not. There are two cases to consider:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 07 18:49:51 UTC 2023 - 4.1K bytes - Viewed (0) -
test/fixedbugs/issue31747.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 02:54:13 UTC 2024 - 1.1K bytes - Viewed (0)