- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 227 for cpos (0.24 sec)
-
build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/JavadocScanner.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 4.3K bytes - Viewed (0) -
src/cmd/compile/internal/ir/func.go
} // NewFunc returns a new Func with the given name and type. // // fpos is the position of the "func" token, and npos is the position // of the name identifier. // // TODO(mdempsky): I suspect there's no need for separate fpos and // npos. func NewFunc(fpos, npos src.XPos, sym *types.Sym, typ *types.Type) *Func { name := NewNameAt(npos, sym, typ) name.Class = PFUNC sym.SetFunc(true) fn := &Func{Nname: name}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:05:44 UTC 2024 - 21.1K bytes - Viewed (0) -
src/cmd/link/internal/ld/pe.go
// first entry: extended relocs out.Write32(0) // placeholder for number of relocation + 1 out.Write32(0) out.Write16(0) n := relocfn() + 1 cpos := out.Offset() out.SeekSet(int64(sect.pointerToRelocations)) out.Write32(uint32(n)) out.SeekSet(cpos) if n > 0x10000 { n = 0x10000 sect.characteristics |= IMAGE_SCN_LNK_NRELOC_OVFL } else { sect.pointerToRelocations += 10 // skip the extend reloc entry
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 09 19:01:27 UTC 2023 - 48.8K bytes - Viewed (0) -
src/cmd/link/internal/ld/dwarf.go
} pos += uint64(ldr.SymSize(s)) if ctxt.IsWindows() { pos = uint64(Rnd(int64(pos), PEFILEALIGN)) } } } Segdwarf.Length = pos - Segdwarf.Vaddr } type compilationUnitByStartPC []*sym.CompilationUnit func (v compilationUnitByStartPC) Len() int { return len(v) } func (v compilationUnitByStartPC) Swap(i, j int) { v[i], v[j] = v[j], v[i] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 16:25:18 UTC 2024 - 72.4K bytes - Viewed (0) -
cluster/gce/cos
Michael Taufen <******@****.***> 1489617107 -0700
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Mar 15 22:31:51 UTC 2017 - 3 bytes - Viewed (0) -
src/cmd/internal/src/xpos.go
} // XPos returns the corresponding XPos for the given pos, // adding pos to t if necessary. func (t *PosTable) XPos(pos Pos) XPos { return XPos{t.baseIndex(pos.base), pos.lico} } func (t *PosTable) baseIndex(base *PosBase) int32 { if base == nil { return 0 } if i, ok := t.indexMap[base]; ok { return int32(i) } if base.fileIndex >= 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 01 15:52:41 UTC 2023 - 4.9K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/pos.go
func MakePos(base *PosBase, line, col uint) Pos { return Pos{base, sat32(line), sat32(col)} } // TODO(gri) IsKnown makes an assumption about linebase < 1. // Maybe we should check for Base() != nil instead. func (pos Pos) Pos() Pos { return pos } func (pos Pos) IsKnown() bool { return pos.line > 0 } func (pos Pos) Base() *PosBase { return pos.base }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 20:44:57 UTC 2024 - 5.6K bytes - Viewed (0) -
src/cmd/internal/src/pos.go
} base := *orig base.inl = inlTreeIndex base.fileIndex = -1 if orig == orig.pos.base { base.pos.base = &base } return &base } var noPos Pos // Pos returns the position at which base is located. // If b == nil, the result is the zero position. func (b *PosBase) Pos() *Pos { if b != nil { return &b.pos } return &noPos }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 01 15:52:41 UTC 2023 - 15.5K bytes - Viewed (0) -
src/cmd/internal/src/xpos_test.go
} } func TestSetBase(t *testing.T) { var tab PosTable b1 := NewFileBase("b1", "b1") orig := MakePos(b1, 42, 7) xpos := tab.XPos(orig) pos := tab.Pos(xpos) new := NewInliningBase(b1, 2) pos.SetBase(new) xpos = tab.XPos(pos) pos = tab.Pos(xpos) if inl := pos.Base().InliningIndex(); inl != 2 { t.Fatalf("wrong inlining index: %d", inl) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 01 15:52:41 UTC 2023 - 2.7K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/cpu_assignment.go
// by number of free CPUs that their cores contain. Finally, for each core, the CPUs in it are // sorted by numerical ID. The order is always ascending. In other words, the relative order of two // CPUs is determined as follows: // 1. If the two CPUs belong to different sockets, the CPU in the socket with the smaller amount of // free CPUs appears first.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 25 23:56:21 UTC 2024 - 36.3K bytes - Viewed (0)