- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 41 for Atack (0.1 sec)
-
src/regexp/syntax/parse.go
re1 := p.stack[n-1] re3 := p.stack[n-3] // Make re3 the more complex of the two. if re1.Op > re3.Op { re1, re3 = re3, re1 p.stack[n-3] = re3 } mergeCharClass(re3, re1) p.reuse(re1) p.stack = p.stack[:n-1] return true } if n >= 2 { re1 := p.stack[n-1] re2 := p.stack[n-2] if re2.Op == opVerticalBar { if n >= 3 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 13:59:01 UTC 2024 - 52.1K bytes - Viewed (0) -
src/cmd/cgo/out.go
// assignments, so it won't use much stack space, so // it's OK to not split the stack. Splitting the stack // can run into a bug in clang (as of 2018-11-09): // this is a leaf function, and when clang sees a leaf // function it won't emit the split stack prologue for // the function. However, if this function refers to a // non-split-stack function, which will happen if the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 16:41:10 UTC 2024 - 59.6K bytes - Viewed (0) -
src/runtime/mgcpacer.go
// lastStackScan is the number of bytes of stack that were scanned // last GC cycle. lastStackScan atomic.Uint64 // maxStackScan is the amount of allocated goroutine stack space in // use by goroutines. // // This number tracks allocated goroutine stack space rather than used // goroutine stack space (i.e. what is actually scanned) because used // goroutine stack space is much harder to measure cheaply. By using
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
src/cmd/internal/obj/riscv/obj.go
alignedValue := p.From.Offset v := pcAlignPadLength(pc, alignedValue) pc += int64(v) } } return pc } // stackOffset updates Addr offsets based on the current stack size. // // The stack looks like: // ------------------- // | | // | PARAMs | // | | // | | // ------------------- // | Parent RA | SP on function entry
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Apr 07 03:32:27 UTC 2024 - 77K bytes - Viewed (0) -
src/debug/elf/file_test.go
{".debug_str", SHT_PROGBITS, SHF_MERGE | SHF_STRINGS | SHF_COMPRESSED, 0x0, 0x1b2, 0x10f, 0x0, 0x0, 0x1, 0x1, 0xb3}, {".comment", SHT_PROGBITS, SHF_MERGE | SHF_STRINGS, 0x0, 0x265, 0x2a, 0x0, 0x0, 0x1, 0x1, 0x2a}, {".note.GNU-stack", SHT_PROGBITS, 0x0, 0x0, 0x28f, 0x0, 0x0, 0x0, 0x1, 0x0, 0x0}, {".eh_frame", SHT_PROGBITS, SHF_ALLOC, 0x0, 0x290, 0x38, 0x0, 0x0, 0x4, 0x0, 0x38},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 22 16:22:42 UTC 2023 - 60.1K bytes - Viewed (0) -
src/runtime/malloc.go
var p *notInHeap systemstack(func() { p = persistentalloc1(size, align, sysStat) }) return unsafe.Pointer(p) } // Must run on system stack because stack growth can (re)invoke it. // See issue 9174. // //go:systemstack func persistentalloc1(size, align uintptr, sysStat *sysMemStat) *notInHeap { const (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
src/runtime/map.go
h := new(hmap) h.hash0 = uint32(rand()) return h } // makemap implements Go map creation for make(map[k]v, hint). // If the compiler has determined that the map or the first bucket // can be created on the stack, h and/or bucket may be non-nil. // If h != nil, the map can be created directly in h. // If h.buckets != nil, bucket pointed to can be used as the first bucket. // // makemap should be an internal detail,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
if isSamePtr(p1, p2) { return !overlap(off1, n1, off2, n2) } // p1 and p2 are not the same, so if they are both OpAddrs then // they point to different variables. // If one pointer is on the stack and the other is an argument // then they can't overlap. switch p1.Op { case OpAddr, OpLocalAddr: if p2.Op == OpAddr || p2.Op == OpLocalAddr || p2.Op == OpSP { return true }
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/time/time_test.go
t.Errorf("The result t2: %+v after Unmarshal is not matched original t1: %+v", t2, t1) } } } func TestUnmarshalTextAllocations(t *testing.T) { in := []byte(testdataRFC3339UTC) // short enough to be stack allocated if allocs := testing.AllocsPerRun(100, func() { var t Time t.UnmarshalText(in) }); allocs != 0 { t.Errorf("got %v allocs, want 0 allocs", allocs) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:13:47 UTC 2024 - 56.5K bytes - Viewed (0) -
src/cmd/internal/testdir/testdir_test.go
// This command-timeout code adapted from cmd/go/test.go // Note: the Go command uses a more sophisticated timeout // strategy, first sending SIGQUIT (if appropriate for the // OS in question) to try to trigger a stack trace, then // finally much later SIGKILL. If timeouts prove to be a // common problem here, it would be worth porting over // that code as well. See https://do.dev/issue/50973 // for more discussion.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 20:08:06 UTC 2024 - 57.5K bytes - Viewed (0)