- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,109 for offset2 (0.11 sec)
-
src/internal/bytealg/compare_ppc64x.s
ADD $-16,R9,R9 MOVD $32,R11 // set offsets to load into vector MOVD $48,R12 // set offsets to load into vector PCALIGN $16 cmp64_loop: LXVD2X (R5)(R0),V3 // load bytes of A at offset 0 into vector LXVD2X (R6)(R0),V4 // load bytes of B at offset 0 into vector VCMPEQUDCC V3,V4,V1 BGE CR6,different // jump out if its different LXVD2X (R5)(R10),V3 // load bytes of A at offset 16 into vector
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 28 17:33:20 UTC 2023 - 6.7K bytes - Viewed (0) -
src/cmd/compile/internal/types/size.go
} for i, m := range methods { m.Offset = int64(i) * int64(PtrSize) } t.SetAllMethods(methods) } // calcStructOffset computes the offsets of a sequence of fields, // starting at the given offset. It returns the resulting offset and // maximum field alignment. func calcStructOffset(t *Type, fields []*Field, offset int64) int64 { for _, f := range fields { CalcSize(f.Type)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 15K bytes - Viewed (0) -
src/internal/zstd/block.go
r.repeatedOffset2 = r.repeatedOffset1 r.repeatedOffset1 = offset } else { if literal == 0 { offset++ } switch offset { case 1: offset = r.repeatedOffset1 case 2: offset = r.repeatedOffset2 r.repeatedOffset2 = r.repeatedOffset1 r.repeatedOffset1 = offset case 3: offset = r.repeatedOffset3 r.repeatedOffset3 = r.repeatedOffset2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 28 17:57:43 UTC 2023 - 10.2K bytes - Viewed (0) -
src/cmd/compile/internal/test/abiutilsaux_test.go
} func verifyParamResultOffset(t *testing.T, f *types.Field, r abi.ABIParamAssignment, which string, idx int) int { n := f.Nname.(*ir.Name) if n.FrameOffset() != int64(r.Offset()) { t.Errorf("%s %d: got offset %d wanted %d t=%v", which, idx, r.Offset(), n.Offset_, f.Type) return 1 } return 0 } func makeExpectedDump(e string) expectedDump { return expectedDump{dump: e} }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 13 18:34:00 UTC 2023 - 3.2K bytes - Viewed (0) -
src/cmd/link/internal/ld/pcln.go
func (state *pclntab) generatePctab(ctxt *Link, funcs []loader.Sym) { ldr := ctxt.loader // Pctab offsets of 0 are considered invalid in the runtime. We respect // that by just padding a single byte at the beginning of runtime.pctab, // that way no real offsets can be zero. size := int64(1) // Walk the functions, finding offset to store each pcdata. seen := make(map[loader.Sym]struct{}) saveOffset := func(pcSym loader.Sym) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 22:16:54 UTC 2024 - 29.6K bytes - Viewed (0) -
src/time/zoneinfo.go
// FixedZone returns a [Location] that always uses // the given zone name and offset (seconds east of UTC). func FixedZone(name string, offset int) *Location { // Most calls to FixedZone have an unnamed zone with an offset by the hour. // Optimize for that case by returning the same *Location for a given hour. const hoursBeforeUTC = 12 const hoursAfterUTC = 14 hour := offset / 60 / 60
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:30 UTC 2024 - 18.2K bytes - Viewed (0) -
src/cmd/link/internal/ld/macho_combine_dwarf.go
func (r loadCmdReader) ReadAt(offset int64, data interface{}) error { if _, err := r.f.Seek(r.offset+offset, 0); err != nil { return err } return binary.Read(r.f, r.order, data) } func (r loadCmdReader) WriteAt(offset int64, data interface{}) error { if _, err := r.f.Seek(r.offset+offset, 0); err != nil { return err } return binary.Write(r.f, r.order, data) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 18:45:27 UTC 2024 - 13.3K bytes - Viewed (0) -
src/internal/zstd/fse.go
// be.baseline = 1 << e.sym // be.basebits = e.sym // That would give us an offset value that corresponds to // the one described in the RFC. However, for offsets > 3 // we have to subtract 3. And for offset values 1, 2, 3 // we use a repeated offset. // // The baseline is always a power of 2, and is never 0, // so for those low values we will see one entry that is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 17 16:44:06 UTC 2023 - 12.2K bytes - Viewed (0) -
internal/s3select/select.go
rsc.offset = rsc.size + offset } if rsc.offset < 0 { return rsc.offset, errors.New("seek to invalid negative offset") } if rsc.offset >= rsc.size { return rsc.offset, errors.New("seek past end of object") } if rsc.reader != nil { _ = rsc.reader.Close() rsc.reader = nil } return rsc.offset, nil } // Read call to implement io.Reader
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 21K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/pgen.go
} if mls != nil { // Update offsets of followers (subsumed vars) to be the // same as the leader var in their partition. for i := 0; i < len(fn.Dcl); i++ { n := fn.Dcl[i] if !mls.Subsumed(n) { continue } leader := mls.Leader(n) off, ok := leaders[leader] if !ok { panic("internal error missing leader") } // Set the stack offset this subsumed (followed) var
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 13.1K bytes - Viewed (0)