- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for Ford (0.21 sec)
-
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 Apr 23 11:13:09 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 Apr 23 11:13:09 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 Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/riscv64.s
ECALL // 73000000 SCALL // 73000000 EBREAK // 73001000 SBREAK // 73001000 // Arbitrary bytes (entered in little-endian mode) WORD $0x12345678 // WORD $305419896 // 78563412 WORD $0x9abcdef0 // WORD $2596069104 // f0debc9a // MOV pseudo-instructions MOV X5, X6 // 13830200 MOV $2047, X5 // 9302f07f MOV $-2048, X5 // 93020080 MOV $2048, X5 // b71200009b820280
Others - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Fri Mar 22 04:42:21 GMT 2024 - 16.7K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/loong64enc1.s
MOVW F4, 1(F5) // a404402b MOVF F4, 1(F5) // a404402b MOVD F4, 1(F5) // a404c02b MOVW R4, F5 // 85a41401 MOVW F4, R5 // 85b41401 MOVV R4, F5 // 85a81401 MOVV F4, R5 // 85b81401 WORD $74565 // 45230100 BREAK R4, result+16(FP) // 64600006 BREAK R4, 1(R5) // a4040006 BREAK // 00002a00 UNDEF // 00002a00 // mul MUL R4, R5 // a5101c00 MUL R4, R5, R6 // a6101c00
Others - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Fri Mar 31 02:56:19 GMT 2023 - 6.4K bytes - Viewed (0) -
src/cmd/asm/internal/arch/arch.go
case "s390x": return archS390x() case "wasm": return archWasm() } return nil } func jumpX86(word string) bool { return word[0] == 'J' || word == "CALL" || strings.HasPrefix(word, "LOOP") || word == "XBEGIN" } func jumpRISCV(word string) bool { switch word { case "BEQ", "BEQZ", "BGE", "BGEU", "BGEZ", "BGT", "BGTU", "BGTZ", "BLE", "BLEU", "BLEZ",
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Mar 21 06:51:28 GMT 2023 - 21.3K bytes - Viewed (0) -
src/bufio/scan.go
if !isSpace(r) { break } } // Scan until space, marking end of word. for width, i := 0, start; i < len(data); i += width { var r rune r, width = utf8.DecodeRune(data[i:]) if isSpace(r) { return i + width, data[start:i], nil } } // If we're at EOF, we have a final, non-empty, non-terminated word. Return it. if atEOF && len(data) > start { return len(data), data[start:], nil }
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Oct 23 09:06:30 GMT 2023 - 14.2K bytes - Viewed (0) -
src/bufio/example_test.go
} if err := scanner.Err(); err != nil { fmt.Fprintln(os.Stderr, "shouldn't see an error scanning a string") } // Output: // true } // Use a Scanner to implement a simple word-count utility by scanning the // input as a sequence of space-delimited tokens. func ExampleScanner_words() { // An artificial input source.
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Oct 23 09:06:30 GMT 2023 - 4.9K bytes - Viewed (0) -
api/go1.9.txt
pkg image/png, type EncoderBufferPool interface, Put(*EncoderBuffer) pkg math/big, method (*Int) IsInt64() bool pkg math/big, method (*Int) IsUint64() bool pkg math/big, type Word uint pkg math/bits (darwin-amd64), const UintSize = 64 pkg math/bits (darwin-amd64-cgo), const UintSize = 64 pkg math/bits (freebsd-386), const UintSize = 32 pkg math/bits (freebsd-386-cgo), const UintSize = 32
Plain Text - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Oct 04 20:20:20 GMT 2021 - 10.7K bytes - Viewed (0) -
doc/asm.html
but only worthwhile if it's likely the instruction will be used again. Instead, for simple one-off cases, it's possible to use the <code>BYTE</code> and <code>WORD</code> directives to lay down explicit data into the instruction stream within a <code>TEXT</code>. Here's how the 386 runtime defines the 64-bit atomic load function. </p> <pre>
HTML - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0)