- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 44 for NextIp (0.16 sec)
-
src/cmd/link/internal/sym/library.go
File string Pkg string Shlib string Fingerprint goobj.FingerprintType Autolib []goobj.ImportedPkg Imports []*Library Main bool Units []*CompilationUnit Textp []LoaderSym // text syms defined in this library DupTextSyms []LoaderSym // dupok text syms defined in this library } func (l Library) String() string { return l.Pkg
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 11 18:32:23 UTC 2020 - 651 bytes - Viewed (0) -
src/cmd/link/internal/ld/data.go
// Note: we load C symbols before Go symbols, so we can scan from the start. for i < len(textp) && (ldr.SubSym(textp[i]) != 0 || ldr.AttrSubSymbol(textp[i])) { i++ } textp = textp[i:] r.Shuffle(len(textp), func(i, j int) { textp[i], textp[j] = textp[j], textp[i] }) } text := ctxt.xdefine("runtime.text", sym.STEXT, 0) etext := ctxt.xdefine("runtime.etext", sym.STEXT, 0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 12 15:10:50 UTC 2024 - 100.5K bytes - Viewed (1) -
src/cmd/link/internal/loadmacho/ldmacho.go
return errorf("symbol %s listed multiple times", bld.Name()) } bld.SetOnList(true) textp = append(textp, s) for s1 := bld.Sub(); s1 != 0; s1 = l.SubSym(s1) { if l.AttrOnList(s1) { return errorf("symbol %s listed multiple times", l.SymName(s1)) } l.SetAttrOnList(s1, true) textp = append(textp, s1) } } } // load relocations for i := 0; uint32(i) < c.seg.nsect; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 12 18:45:57 UTC 2022 - 19.1K bytes - Viewed (0) -
src/cmd/link/internal/loadelf/ldelf.go
l.SymName(s)) } l.SetAttrOnList(s, true) textp = append(textp, s) for ss := l.SubSym(s); ss != 0; ss = l.SubSym(ss) { if l.AttrOnList(ss) { return errorf("symbol %s listed multiple times", l.SymName(ss)) } l.SetAttrOnList(ss, true) textp = append(textp, ss) } } } // load relocations
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:12:12 UTC 2024 - 33.9K bytes - Viewed (0) -
src/cmd/link/internal/ld/pcln.go
indexes[i] = NOIDX } idx := int32(0) for i, s := range ctxt.Textp { if !emitPcln(ctxt, s, container) { continue } p := ldr.SymValue(s) var e loader.Sym i++ if i < len(ctxt.Textp) { e = ctxt.Textp[i] } for e != 0 && !emitPcln(ctxt, e, container) && i < len(ctxt.Textp) { e = ctxt.Textp[i] i++ } q := max if e != 0 { q = ldr.SymValue(e)
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/cmd/link/internal/x86/asm.go
// Destination register is in bits 3-5 of the middle byte, so add that in. o(0x8b, 0x04+r.num<<3, 0x24) // c3 ret o(0xc3) thunks = append(thunks, thunkfunc.Sym()) } ctxt.Textp = append(thunks, ctxt.Textp...) // keep Textp in dependency order initfunc, addmoduledata := ld.PrepareAddmoduledata(ctxt) if initfunc == nil { return } o := func(op ...uint8) { for _, op1 := range op {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 23 05:58:20 UTC 2023 - 13.6K bytes - Viewed (0) -
src/cmd/link/internal/ld/seh.go
// an RVA, so it is possible, and binary-size wise, // to deduplicate .xdata entries. uwcache := make(map[string]int64) // aux symbol name --> .xdata offset for _, s := range ctxt.Textp { if fi := ldr.FuncInfo(s); !fi.Valid() { continue } uw := ldr.SEHUnwindSym(s) if uw == 0 { continue } name := ctxt.SymName(uw) off, cached := uwcache[name] if !cached {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 09 19:01:27 UTC 2023 - 2K bytes - Viewed (0) -
src/cmd/link/internal/ld/dwarf.go
func (v compilationUnitByStartPC) Less(i, j int) bool { switch { case len(v[i].Textp) == 0 && len(v[j].Textp) == 0: return v[i].Lib.Pkg < v[j].Lib.Pkg case len(v[i].Textp) != 0 && len(v[j].Textp) == 0: return true case len(v[i].Textp) == 0 && len(v[j].Textp) != 0: return false default: return v[i].PCs[0].Start < v[j].PCs[0].Start } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 16:25:18 UTC 2024 - 72.4K bytes - Viewed (0) -
src/runtime/select.go
// sg on gp.waiting where copystack can find it. sg.elem = cas.elem sg.releasetime = 0 if t0 != 0 { sg.releasetime = -1 } sg.c = c // Construct waiting list in lock order. *nextp = sg nextp = &sg.waitlink if casi < nsends { c.sendq.enqueue(sg) } else { c.recvq.enqueue(sg) } if c.timer != nil { blockTimerChan(c) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 13 21:36:04 UTC 2024 - 15K bytes - Viewed (0) -
src/cmd/link/internal/ld/lib.go
ldelf := func(ctxt *Link, f *bio.Reader, pkg string, length int64, pn string) { textp, flags, err := loadelf.Load(ctxt.loader, ctxt.Arch, ctxt.IncVersion(), f, pkg, length, pn, ehdr.Flags) if err != nil { Errorf(nil, "%v", err) return } ehdr.Flags = flags ctxt.Textp = append(ctxt.Textp, textp...) } return ldhostobj(ldelf, ctxt.HeadType, f, pkg, length, pn, file) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 18:45:27 UTC 2024 - 88.6K bytes - Viewed (0)