- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 26 for Ford (0.15 sec)
-
src/cmd/asm/internal/arch/s390x.go
// s390x instruction set, to minimize its interaction // with the core of the assembler. package arch import ( "cmd/internal/obj/s390x" ) func jumpS390x(word string) bool { switch word { case "BRC", "BC", "BCL", "BEQ", "BGE", "BGT", "BL", "BLE", "BLEU", "BLT", "BLTU", "BNE", "BR", "BVC", "BVS", "BRCT", "BRCTG",
Go - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Thu Oct 17 14:55:25 GMT 2019 - 1.2K bytes - Viewed (0) -
src/cmd/asm/internal/arch/ppc64.go
// 64-bit PowerPC (PPC64) instruction set, to minimize its interaction // with the core of the assembler. package arch import ( "cmd/internal/obj" "cmd/internal/obj/ppc64" ) func jumpPPC64(word string) bool { switch word { case "BC", "BCL", "BEQ", "BGE", "BGT", "BL", "BLE", "BLT", "BNE", "BR", "BVC", "BVS", "BDNZ", "BDZ", "CALL", "JMP": return true } return false }
Go - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Wed Sep 07 20:53:33 GMT 2022 - 2.2K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/mips64.s
// { // outcode(int($1), &$2, int($4.Reg), &$6); // } ADDD F1, F2, F3 // LFCMP freg ',' freg // { // outcode(int($1), &$2, 0, &$4); // } CMPEQD F1, F2 // // WORD // WORD $1 // 00000001 NOOP // 00000000 SYNC // 0000000f // // NOP // // LNOP comma // asm doesn't support the trailing comma. // { // outcode(int($1), &nullgen, 0, &nullgen); // }
Others - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Tue Aug 08 12:17:12 GMT 2023 - 12.4K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/amd64enc_extra.s
KNOTQ K1, K5 // c4e1f844e9 KORB K7, K5, K0 // c5d545c7 KORB K0, K7, K5 // c5c545e8 KORW K7, K5, K0 // c5d445c7 KORW K0, K7, K5 // c5c445e8 KORD K7, K5, K0 // c4e1d545c7 KORD K0, K7, K5 // c4e1c545e8 KORQ K7, K5, K0 // c4e1d445c7 KORQ K0, K7, K5 // c4e1c445e8 KSHIFTLB $0, K7, K0 // c4e37932c700 KSHIFTLB $196, K1, K5 // c4e37932e9c4
Others - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Tue Apr 11 18:32:50 GMT 2023 - 57.6K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
scratch := make([][]lex.Token, 0, 3) for { word, cond, operands, ok := p.line(scratch) if !ok { break } scratch = operands if p.pseudo(word, operands) { continue } i, present := p.arch.Instructions[word] if present { p.instruction(i, word, cond, operands) continue } p.errorf("unrecognized instruction %q", word) } if p.errorCount > 0 { return nil, false
Go - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K bytes - Viewed (0) -
src/bytes/bytes.go
// asciiSet is a 32-byte value, where each bit represents the presence of a // given ASCII character in the set. The 128-bits of the lower 16 bytes, // starting with the least-significant bit of the lowest word to the // most-significant bit of the highest word, map to the full range of all // 128 ASCII characters. The 128-bits of the upper 16 bytes will be zeroed, // ensuring that any non-ASCII character will be reported as not in the set.
Go - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Mon Feb 19 19:51:15 GMT 2024 - 33.8K bytes - Viewed (0) -
src/cmd/asm/internal/lex/input.go
func (in *Input) Text() string { return in.text } // hash processes a # preprocessor directive. It reports whether it completes. func (in *Input) hash() bool { // We have a '#'; it must be followed by a known word (define, include, etc.). tok := in.Stack.Next() if tok != scanner.Ident { in.expectText("expected identifier after '#'") } if !in.enabled() {
Go - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K bytes - Viewed (0) -
src/cmd/asm/internal/arch/mips.go
// MIPS (MIPS64) instruction set, to minimize its interaction // with the core of the assembler. package arch import ( "cmd/internal/obj" "cmd/internal/obj/mips" ) func jumpMIPS(word string) bool { switch word { case "BEQ", "BFPF", "BFPT", "BGEZ", "BGEZAL", "BGTZ", "BLEZ", "BLTZ", "BLTZAL", "BNE", "JMP", "JAL", "CALL": return true } return false }
Go - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Wed Mar 04 19:06:44 GMT 2020 - 1.7K bytes - Viewed (0) -
src/bufio/scan_test.go
} func TestScanWordsExcessiveWhiteSpace(t *testing.T) { const word = "ipsum" s := strings.Repeat(" ", 4*smallMaxTokenSize) + word scanner := NewScanner(strings.NewReader(s)) scanner.MaxTokenSize(smallMaxTokenSize) scanner.Split(ScanWords) if !scanner.Scan() { t.Fatalf("scan failed: %v", scanner.Err()) } if token := scanner.Text(); token != word { t.Fatalf("unexpected token: %v", token) } }
Go - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Fri Sep 22 16:22:42 GMT 2023 - 14.3K bytes - Viewed (0) -
doc/go_mem.html
</p> <p> Reads of memory locations larger than a single machine word are encouraged but not required to meet the same semantics as word-sized memory locations, observing a single allowed write <i>w</i>. For performance reasons, implementations may instead treat larger operations as a set of individual machine-word-sized operations in an unspecified order. This means that races on multiword data structures
HTML - Registered: Tue Mar 26 11:13:08 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0)