Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 43 for offlet (0.37 sec)

  1. doc/asm.html

    at the beginning, as in <code>first_arg+0(FP)</code> and <code>second_arg+8(FP)</code>.
    (The meaning of the offset—offset from the frame pointer—distinct
    from its use with <code>SB</code>, where it is an offset from the symbol.)
    The assembler enforces this convention, rejecting plain <code>0(FP)</code> and <code>8(FP)</code>.
    HTML
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Nov 28 19:15:27 GMT 2023
    - 36.3K bytes
    - Viewed (0)
  2. src/archive/zip/struct.go

    // timeZone returns a *time.Location based on the provided offset.
    // If the offset is non-sensible, then this uses an offset of zero.
    func timeZone(offset time.Duration) *time.Location {
    	const (
    		minOffset   = -12 * time.Hour  // E.g., Baker island at -12:00
    		maxOffset   = +14 * time.Hour  // E.g., Line island at +14:00
    		offsetAlias = 15 * time.Minute // E.g., Nepal at +5:45
    	)
    	offset = offset.Round(offsetAlias)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Oct 13 18:36:46 GMT 2023
    - 12.1K bytes
    - Viewed (0)
  3. src/archive/zip/reader.go

    	n := len(d.files) - d.offset
    	if count > 0 && n > count {
    		n = count
    	}
    	if n == 0 {
    		if count <= 0 {
    			return nil, nil
    		}
    		return nil, io.EOF
    	}
    	list := make([]fs.DirEntry, n)
    	for i := range list {
    		s, err := d.files[d.offset+i].stat()
    		if err != nil {
    			return nil, err
    		}
    		list[i] = s
    	}
    	d.offset += n
    	return list, nil
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Oct 13 18:36:46 GMT 2023
    - 27.7K bytes
    - Viewed (0)
  4. src/archive/tar/format.go

    	// This matches the limit used by libarchive.
    	maxSpecialFileSize = 1 << 20
    )
    
    // blockPadding computes the number of bytes needed to pad offset up to the
    // nearest block edge where 0 <= n < blockSize.
    func blockPadding(offset int64) (n int64) {
    	return -offset & (blockSize - 1)
    }
    
    var zeroBlock block
    
    type block [blockSize]byte
    
    // Convert block to any number of formats.
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Oct 13 18:36:46 GMT 2023
    - 11.3K bytes
    - Viewed (0)
  5. src/cmd/asm/internal/asm/testdata/ppc64.s

    #include "../../../../../runtime/textflag.h"
    
    // In case of index mode instructions, usage of
    // (Rx)(R0) is equivalent to (Rx+R0)
    // In case of base+displacement mode instructions if
    // the offset is 0, usage of (Rx) is equivalent to 0(Rx)
    TEXT asmtest(SB),DUPOK|NOSPLIT,$0
    	// move constants
    	MOVD $1, R3                     // 38600001
    	MOVD $-1, R4                    // 3880ffff
    Others
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Apr 24 15:53:25 GMT 2024
    - 49K bytes
    - Viewed (0)
  6. src/bytes/bytes_test.go

    			}
    			b1[j] = 0
    			pos = IndexByte(b1, 'x')
    			if pos != -1 {
    				t.Errorf("IndexByte(%q, 'x') = %v", b1, pos)
    			}
    		}
    	}
    }
    
    // test a small index across all page offsets
    func TestIndexByteSmall(t *testing.T) {
    	b := make([]byte, 5015) // bigger than a page
    	// Make sure we find the correct byte even when straddling a page.
    	for i := 0; i <= len(b)-15; i++ {
    		for j := 0; j < 15; j++ {
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Jan 24 16:07:25 GMT 2024
    - 56.2K bytes
    - Viewed (0)
  7. misc/wasm/wasm_exec.js

    			let offset = 4096;
    
    			const strPtr = (str) => {
    				const ptr = offset;
    				const bytes = encoder.encode(str + "\0");
    				new Uint8Array(this.mem.buffer, offset, bytes.length).set(bytes);
    				offset += bytes.length;
    				if (offset % 8 !== 0) {
    					offset += 8 - (offset % 8);
    				}
    				return ptr;
    			};
    
    			const argc = this.argv.length;
    JavaScript
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon May 22 17:47:47 GMT 2023
    - 16.3K bytes
    - Viewed (1)
  8. src/archive/zip/reader_test.go

    				done <- true
    			}(j, ft)
    			n++
    		}
    	}
    	for ; n > 0; n-- {
    		<-done
    	}
    }
    
    func equalTimeAndZone(t1, t2 time.Time) bool {
    	name1, offset1 := t1.Zone()
    	name2, offset2 := t2.Zone()
    	return t1.Equal(t2) && name1 == name2 && offset1 == offset2
    }
    
    func readTestFile(t *testing.T, zt ZipTest, ft ZipTestFile, f *File, raw []byte) {
    	if f.Name != ft.Name {
    		t.Errorf("name=%q, want %q", f.Name, ft.Name)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Mar 27 18:23:49 GMT 2024
    - 55.3K bytes
    - Viewed (0)
  9. src/cmd/cgo/ast.go

    					// Replace "C" with _ "unsafe", to keep program valid.
    					// (Deleting import statement or clause is not safe if it is followed
    					// in the source by an explicit semicolon.)
    					f.Edit.Replace(f.offset(s.Path.Pos()), f.offset(s.Path.End()), `_ "unsafe"`)
    				}
    			}
    		}
    	}
    
    	// Accumulate pointers to uses of C.x.
    	if f.Ref == nil {
    		f.Ref = make([]*Ref, 0, 8)
    	}
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Jun 07 16:54:27 GMT 2023
    - 14.3K bytes
    - Viewed (0)
  10. src/bytes/buffer_test.go

    	tmp := make([]byte, 5)
    	for i := 0; i <= 5; i++ {
    		for j := i; j <= 5; j++ {
    			for k := 0; k <= 6; k++ {
    				// 0 <= i <= j <= 5; 0 <= k <= 6
    				// Check that if we start with a buffer
    				// of length j at offset i and ask for
    				// Next(k), we get the right bytes.
    				buf := NewBuffer(b[0:j])
    				n, _ := buf.Read(tmp[0:i])
    				if n != i {
    					t.Fatalf("Read %d returned %d", i, n)
    				}
    				bb := buf.Next(k)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Apr 26 13:31:36 GMT 2024
    - 18.6K bytes
    - Viewed (0)
Back to top