- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 118 for Shift1 (0.18 sec)
-
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/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) -
src/internal/types/testdata/check/go1_12.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) -
src/main/assemblies/files/fess
do case $1 in --help) ARGV="$ARGV -h"; shift;; --*=*) properties="$properties -Dfess.${1#--}" shift 1 ;; --*) [ $# -le 1 ] && { echo "Option requires an argument: '$1'." shift continue } properties="$properties -Dfess.${1#--}=$2" shift 2 ;; *) ARGV="$ARGV $1" ; shift
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Sun Jan 15 06:32:15 UTC 2023 - 5.4K bytes - Viewed (0) -
src/crypto/md5/md5block_arm.s
MOVM.IA (Rc0), [Ra,Rb,Rc,Rd] // a += (((c^d)&b)^d) + X[index] + const // a = a<<shift | a>>(32-shift) + b #define ROUND1(Ra, Rb, Rc, Rd, index, shift, Rconst) \ EOR Rc, Rd, Rt0 ; \ AND Rb, Rt0 ; \ EOR Rd, Rt0 ; \ MOVW (index<<2)(Rdata), Rt1 ; \ ADD Rt1, Rt0 ; \ ADD Rconst, Rt0 ; \ ADD Rt0, Ra ; \ ADD Ra@>(32-shift), Rb, Ra ; MOVM.IA.W (Rtable), [Rc0,Rc1,Rc2,Rc3] ROUND1(Ra, Rb, Rc, Rd, 0, 7, Rc0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 8.8K bytes - Viewed (0) -
src/math/sqrt.go
return x case x < 0: return NaN() } ix := Float64bits(x) // normalize x exp := int((ix >> shift) & mask) if exp == 0 { // subnormal x for ix&(1<<shift) == 0 { ix <<= 1 exp-- } exp++ } exp -= bias // unbias exponent ix &^= mask << shift ix |= 1 << shift if exp&1 == 1 { // odd exp, double x to make it even ix <<= 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 15 17:07:57 UTC 2022 - 4.8K bytes - Viewed (0)