- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for Lord (0.13 sec)
-
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 Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 08 12:17:12 GMT 2023 - 12.4K 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 30 11:13:12 GMT 2024 - Last Modified: Mon Oct 23 09:06:30 GMT 2023 - 14.2K 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 May 07 11:14:38 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K 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 Apr 30 11:13:12 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 30 11:13:12 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 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K 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 Apr 30 11:13:12 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 May 07 11:14:38 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0) -
api/except.txt
pkg math/big, const MaxBase = 36 pkg math/big, type Word uintptr pkg net, func ListenUnixgram(string, *UnixAddr) (*UDPConn, error) pkg os (linux-arm), const O_SYNC = 1052672 pkg os (linux-arm), const O_SYNC = 4096 pkg os (linux-arm-cgo), const O_SYNC = 1052672
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu May 25 00:13:30 GMT 2023 - 34.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 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 22 04:42:21 GMT 2024 - 16.7K bytes - Viewed (0)