Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for Ford (0.17 sec)

  1. lib/time/zoneinfo.zip

    Atlantic/South_Georgia Atlantic/St_Helena Atlantic/Stanley Australia/ACT Australia/Adelaide Australia/Brisbane Australia/Broken_Hill Australia/Canberra Australia/Currie Australia/Darwin Australia/Eucla Australia/Hobart Australia/LHI Australia/Lindeman Australia/Lord_Howe Australia/Melbourne Australia/NSW Australia/North Australia/Perth Australia/Queensland Australia/South Australia/Sydney Australia/Tasmania Australia/Victoria Australia/West Australia/Yancowinna Brazil/Acre Brazil/DeNoronha Brazil/East Brazil/West...
    ZIP Archive
    - Registered: Tue Apr 23 11:13:09 GMT 2024
    - Last Modified: Fri Feb 02 18:20:41 GMT 2024
    - 392.3K bytes
    - Viewed (1)
  2. src/cmd/asm/internal/asm/testdata/arm.s

    // DIVHW R0, R1: R1 / R0 -> R1
    	DIVHW	R0, R1               // 11f011e7
    	DIVUHW	R0, R1               // 11f031e7
    
    // misc
    	CLZ	R1, R2         // 112f6fe1
    	WORD	$0             // 00000000
    	WORD	$4294967295    // ffffffff
    	WORD	$2863311530    // aaaaaaaa
    	WORD	$1431655765    // 55555555
    	PLD	4080(R6)       // f0ffd6f5
    	PLD	-4080(R9)      // f0ff59f5
    	RFE	               // 0080fde8
    Others
    - Registered: Tue Apr 23 11:13:09 GMT 2024
    - Last Modified: Fri Dec 15 20:51:01 GMT 2023
    - 69K bytes
    - Viewed (0)
  3. 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)
  4. 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)
  5. 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)
  6. 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)
  7. 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 Apr 23 11:13:09 GMT 2024
    - Last Modified: Mon Mar 04 15:54:42 GMT 2024
    - 26.6K bytes
    - Viewed (0)
Back to top