- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for Boundaries (0.15 sec)
-
src/cmd/compile/internal/ssa/rewrite.go
func applyRewrite(f *Func, rb blockRewriter, rv valueRewriter, deadcode deadValueChoice) { // repeat rewrites until we find no more rewrites pendingLines := f.cachedLineStarts // Holds statement boundaries that need to be moved to a new value/block pendingLines.clear() debug := f.pass.debug if debug > 1 { fmt.Printf("%s: rewriting for %s\n", f.pass.name, f.Name) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
src/runtime/mbitmap.go
// On a related note, small objects are always small enough that their bitmap // fits in goarch.PtrSize*8 bits, so writing out bitmap data takes two bitmap // writes at most (because object boundaries don't generally lie on // s.heapBits()[i] boundaries). // // For larger objects, if t is the type for the object starting at "start", // within some span whose mspan is s, then the bitmap at t.GCData is "tiled"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0) -
src/runtime/traceback.go
// of the steps we need with a single traceback printer implementation. // // We could be more lax about exactly how many frames we print, for example // always stopping and resuming on physical frame boundaries, or at least // cgo expansion boundaries. It's not clear that's much simpler. flags |= unwindPrintErrors var u unwinder tracebackWithRuntime := func(showRuntime bool) int { const maxInt int = 0x7fffffff
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 55.1K bytes - Viewed (0) -
src/time/time.go
// // The calendar runs on an exact 400 year cycle: a 400-year calendar // printed for 1970-2369 will apply as well to 2370-2769. Even the days // of the week match up. It simplifies the computations to choose the // cycle boundaries so that the exceptional years are always delayed as // long as possible. That means choosing a year equal to 1 mod 400, so // that the first leap year is the 4th year, the first missed leap year
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 50.7K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
talign := t.Align if f.BitOffset > 0 || f.BitSize > 0 { // The layout of bitfields is implementation defined, // so we don't know how they correspond to Go fields // even if they are aligned at byte boundaries. continue } if talign > 0 && f.ByteOffset%talign != 0 { // Drop misaligned fields, the same way we drop integer bit fields. // The goal is to make available what can be made available.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 97K bytes - Viewed (0)