- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 211 for Qword4 (0.11 sec)
-
src/internal/syscall/windows/registry/registry_test.go
{Type: registry.DWORD, Name: "Dword1", Value: uint64(0)}, {Type: registry.DWORD, Name: "Dword2", Value: uint64(1)}, {Type: registry.DWORD, Name: "Dword3", Value: uint64(0xff)}, {Type: registry.DWORD, Name: "Dword4", Value: uint64(0xffff)}, {Type: registry.QWORD, Name: "Qword1", Value: uint64(0)}, {Type: registry.QWORD, Name: "Qword2", Value: uint64(1)}, {Type: registry.QWORD, Name: "Qword3", Value: uint64(0xff)},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 06 19:19:00 UTC 2024 - 18.5K bytes - Viewed (0) -
pkg/collateral/control.go
-e "s/${LWORD}_filedir${RWORD}/__istio_filedir/g" \ -e "s/${LWORD}_get_comp_words_by_ref${RWORD}/__istio_get_comp_words_by_ref/g" \ -e "s/${LWORD}__ltrim_colon_completions${RWORD}/__istio_ltrim_colon_completions/g" \ -e "s/${LWORD}compgen${RWORD}/__istio_compgen/g" \ -e "s/${LWORD}compopt${RWORD}/__istio_compopt/g" \ -e "s/${LWORD}declare${RWORD}/builtin declare/g" \
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jan 10 03:51:36 UTC 2024 - 17.8K bytes - Viewed (0) -
src/crypto/sha256/sha256block_amd64.s
JB done_hash avx2_do_last_block: VMOVDQU 0(INP), XWORD0 VMOVDQU 16(INP), XWORD1 VMOVDQU 32(INP), XWORD2 VMOVDQU 48(INP), XWORD3 VMOVDQU flip_mask<>(SB), BYTE_FLIP_MASK VPSHUFB X_BYTE_FLIP_MASK, XWORD0, XWORD0 VPSHUFB X_BYTE_FLIP_MASK, XWORD1, XWORD1 VPSHUFB X_BYTE_FLIP_MASK, XWORD2, XWORD2 VPSHUFB X_BYTE_FLIP_MASK, XWORD3, XWORD3 MOVQ $K256<>(SB), TBL JMP avx2_last_block_enter
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 47.3K bytes - Viewed (0) -
src/internal/syscall/windows/registry/value.go
// If value is not DWORD or QWORD, it will return the correct value // type and ErrUnexpectedType. func (k Key) GetIntegerValue(name string) (val uint64, valtype uint32, err error) { data, typ, err2 := k.getValue(name, make([]byte, 8)) if err2 != nil { return 0, typ, err2 } switch typ { case DWORD: if len(data) != 4 { return 0, typ, errors.New("DWORD value is not 4 bytes long") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 18 20:01:34 UTC 2023 - 11K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/arch/x86/x86asm/intel.go
prefix = "dword " case STOSQ, MOVSQ, CMPSQ, LODSQ, SCASQ: prefix = "qword " case LAR: prefix = "word " case BOUND: if inst.Mode == 32 { prefix = "qword " } else { prefix = "dword " } case PREFETCHW, PREFETCHNTA, PREFETCHT0, PREFETCHT1, PREFETCHT2, CLFLUSH: prefix = "zmmword " } switch inst.Op {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 29 22:23:32 UTC 2017 - 11.7K bytes - Viewed (0) -
src/math/big/nat_test.go
f.Fuzz(func(t *testing.T, x1, x2, x3, y1, y2, y3, m1, m2, m3 uint) { if m1 == 0 && m2 == 0 && m3 == 0 { return } x := new(Int).SetBits([]Word{Word(x1), Word(x2), Word(x3)}) y := new(Int).SetBits([]Word{Word(y1), Word(y2), Word(y3)}) m := new(Int).SetBits([]Word{Word(m1), Word(m2), Word(m3)}) out := new(Int).Exp(x, y, m) want := new(Int).expSlow(x, y, m) if out.Cmp(want) != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 09 15:29:36 UTC 2024 - 26.2K bytes - Viewed (0) -
src/math/big/arith_test.go
} } // TODO(gri) mulAddVWW and divWVW are symmetric operations but // their signature is not symmetric. Try to unify. type funWVW func(z []Word, xn Word, x []Word, y Word) (r Word) type argWVW struct { z nat xn Word x nat y Word r Word } func testFunWVW(t *testing.T, msg string, f funWVW, a argWVW) { z := make(nat, len(a.z)) r := f(z, a.xn, a.x, a.y) for i, zi := range z {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 02 14:43:52 UTC 2022 - 19.9K bytes - Viewed (0) -
src/mime/encodedword.go
} // Decode decodes an RFC 2047 encoded-word. func (d *WordDecoder) Decode(word string) (string, error) { // See https://tools.ietf.org/html/rfc2047#section-2 for details. // Our decoder is permissive, we accept empty encoded-text. if len(word) < 8 || !strings.HasPrefix(word, "=?") || !strings.HasSuffix(word, "?=") || strings.Count(word, "?") != 4 { return "", errInvalidWord } word = word[2 : len(word)-2]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 16:12:35 UTC 2024 - 10K bytes - Viewed (0) -
src/net/mail/message.go
words[len(words)-1] += word } else { words = append(words, word) } isPrevEncoded = isEncoded } // Ignore any error if we got at least one word. if err != nil && len(words) == 0 { debug.Printf("consumePhrase: hit err: %v", err) return "", fmt.Errorf("mail: missing word in phrase: %v", err) } phrase = strings.Join(words, " ") return phrase, nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 19 11:31:03 UTC 2024 - 23.5K bytes - Viewed (0) -
src/math/big/natconv.go
// maxPow returns (b**n, n) such that b**n is the largest power b**n <= _M. // For instance maxPow(10) == (1e19, 19) for 19 decimal digits in a 64bit Word. // In other words, at most n digits in base b fit into a Word. // TODO(gri) replace this with a table, generated at build time. func maxPow(b Word) (p Word, n int) { p, n = b, 1 // assuming b <= _M for max := _M / b; p <= max; { // p == b**n && p <= max p *= b n++ }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 14.6K bytes - Viewed (0)