1 // Copyright 2014 The Go Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style
3 // license that can be found in the LICENSE file.
7 // This was originally based on tcmalloc, but has diverged quite a bit.
8 // http://goog-perftools.sourceforge.net/doc/tcmalloc.html
10 // The main allocator works in runs of pages.
11 // Small allocation sizes (up to and including 32 kB) are
12 // rounded to one of about 70 size classes, each of which
13 // has its own free set of objects of exactly that size.
14 // Any free page of memory can be split into a set of objects
15 // of one size class, which are then managed using a free bitmap.
17 // The allocator's data structures are:
19 // fixalloc: a free-list allocator for fixed-size off-heap objects,
20 // used to manage storage used by the allocator.
21 // mheap: the malloc heap, managed at page (8192-byte) granularity.
22 // mspan: a run of in-use pages managed by the mheap.
23 // mcentral: collects all spans of a given size class.
24 // mcache: a per-P cache of mspans with free space.
25 // mstats: allocation statistics.
27 // Allocating a small object proceeds up a hierarchy of caches:
29 // 1. Round the size up to one of the small size classes
30 // and look in the corresponding mspan in this P's mcache.
31 // Scan the mspan's free bitmap to find a free slot.
32 // If there is a free slot, allocate it.
33 // This can all be done without acquiring a lock.
35 // 2. If the mspan has no free slots, obtain a new mspan
36 // from the mcentral's list of mspans of the required size
37 // class that have free space.
38 // Obtaining a whole span amortizes the cost of locking
41 // 3. If the mcentral's mspan list is empty, obtain a run
42 // of pages from the mheap to use for the mspan.
44 // 4. If the mheap is empty or has no page runs large enough,
45 // allocate a new group of pages (at least 1MB) from the
46 // operating system. Allocating a large run of pages
47 // amortizes the cost of talking to the operating system.
49 // Sweeping an mspan and freeing objects on it proceeds up a similar
52 // 1. If the mspan is being swept in response to allocation, it
53 // is returned to the mcache to satisfy the allocation.
55 // 2. Otherwise, if the mspan still has allocated objects in it,
56 // it is placed on the mcentral free list for the mspan's size
59 // 3. Otherwise, if all objects in the mspan are free, the mspan's
60 // pages are returned to the mheap and the mspan is now dead.
62 // Allocating and freeing a large object uses the mheap
63 // directly, bypassing the mcache and mcentral.
65 // If mspan.needzero is false, then free object slots in the mspan are
66 // already zeroed. Otherwise if needzero is true, objects are zeroed as
67 // they are allocated. There are various benefits to delaying zeroing
70 // 1. Stack frame allocation can avoid zeroing altogether.
72 // 2. It exhibits better temporal locality, since the program is
73 // probably about to write to the memory.
75 // 3. We don't zero pages that never get reused.
77 // Virtual memory layout
79 // The heap consists of a set of arenas, which are 64MB on 64-bit and
80 // 4MB on 32-bit (heapArenaBytes). Each arena's start address is also
81 // aligned to the arena size.
83 // Each arena has an associated heapArena object that stores the
84 // metadata for that arena: the heap bitmap for all words in the arena
85 // and the span map for all pages in the arena. heapArena objects are
86 // themselves allocated off-heap.
88 // Since arenas are aligned, the address space can be viewed as a
89 // series of arena frames. The arena map (mheap_.arenas) maps from
90 // arena frame number to *heapArena, or nil for parts of the address
91 // space not backed by the Go heap. The arena map is structured as a
92 // two-level array consisting of a "L1" arena map and many "L2" arena
93 // maps; however, since arenas are large, on many architectures, the
94 // arena map consists of a single, large L2 map.
96 // The arena map covers the entire possible address space, allowing
97 // the Go heap to use any part of the address space. The allocator
98 // attempts to keep arenas contiguous so that large spans (and hence
99 // large objects) can cross arenas.
106 "runtime/internal/atomic"
107 "runtime/internal/math"
108 "runtime/internal/sys"
113 maxTinySize = _TinySize
114 tinySizeClass = _TinySizeClass
115 maxSmallSize = _MaxSmallSize
117 pageShift = _PageShift
120 _PageSize = 1 << _PageShift
121 _PageMask = _PageSize - 1
123 // _64bit = 1 on 64-bit systems, 0 on 32-bit systems
124 _64bit = 1 << (^uintptr(0) >> 63) / 2
126 // Tiny allocator parameters, see "Tiny allocator" comment in malloc.go.
128 _TinySizeClass = int8(2)
130 _FixAllocChunk = 16 << 10 // Chunk size for FixAlloc
132 // Per-P, per order stack segment cache size.
133 _StackCacheSize = 32 * 1024
135 // Number of orders that get caching. Order 0 is FixedStack
136 // and each successive order is twice as large.
137 // We want to cache 2KB, 4KB, 8KB, and 16KB stacks. Larger stacks
138 // will be allocated directly.
139 // Since FixedStack is different on different systems, we
140 // must vary NumStackOrders to keep the same maximum cached size.
141 // OS | FixedStack | NumStackOrders
142 // -----------------+------------+---------------
143 // linux/darwin/bsd | 2KB | 4
144 // windows/32 | 4KB | 3
145 // windows/64 | 8KB | 2
147 _NumStackOrders = 4 - goarch.PtrSize/4*goos.IsWindows - 1*goos.IsPlan9
149 // heapAddrBits is the number of bits in a heap address. On
150 // amd64, addresses are sign-extended beyond heapAddrBits. On
151 // other arches, they are zero-extended.
153 // On most 64-bit platforms, we limit this to 48 bits based on a
154 // combination of hardware and OS limitations.
156 // amd64 hardware limits addresses to 48 bits, sign-extended
157 // to 64 bits. Addresses where the top 16 bits are not either
158 // all 0 or all 1 are "non-canonical" and invalid. Because of
159 // these "negative" addresses, we offset addresses by 1<<47
160 // (arenaBaseOffset) on amd64 before computing indexes into
161 // the heap arenas index. In 2017, amd64 hardware added
162 // support for 57 bit addresses; however, currently only Linux
163 // supports this extension and the kernel will never choose an
164 // address above 1<<47 unless mmap is called with a hint
165 // address above 1<<47 (which we never do).
167 // arm64 hardware (as of ARMv8) limits user addresses to 48
168 // bits, in the range [0, 1<<48).
170 // ppc64, mips64, and s390x support arbitrary 64 bit addresses
171 // in hardware. On Linux, Go leans on stricter OS limits. Based
172 // on Linux's processor.h, the user address space is limited as
173 // follows on 64-bit architectures:
175 // Architecture Name Maximum Value (exclusive)
176 // ---------------------------------------------------------------------
177 // amd64 TASK_SIZE_MAX 0x007ffffffff000 (47 bit addresses)
178 // arm64 TASK_SIZE_64 0x01000000000000 (48 bit addresses)
179 // ppc64{,le} TASK_SIZE_USER64 0x00400000000000 (46 bit addresses)
180 // mips64{,le} TASK_SIZE64 0x00010000000000 (40 bit addresses)
181 // s390x TASK_SIZE 1<<64 (64 bit addresses)
183 // These limits may increase over time, but are currently at
184 // most 48 bits except on s390x. On all architectures, Linux
185 // starts placing mmap'd regions at addresses that are
186 // significantly below 48 bits, so even if it's possible to
187 // exceed Go's 48 bit limit, it's extremely unlikely in
190 // On 32-bit platforms, we accept the full 32-bit address
191 // space because doing so is cheap.
192 // mips32 only has access to the low 2GB of virtual memory, so
193 // we further limit it to 31 bits.
195 // On ios/arm64, although 64-bit pointers are presumably
196 // available, pointers are truncated to 33 bits in iOS <14.
197 // Furthermore, only the top 4 GiB of the address space are
198 // actually available to the application. In iOS >=14, more
199 // of the address space is available, and the OS can now
200 // provide addresses outside of those 33 bits. Pick 40 bits
201 // as a reasonable balance between address space usage by the
202 // page allocator, and flexibility for what mmap'd regions
203 // we'll accept for the heap. We can't just move to the full
204 // 48 bits because this uses too much address space for older
206 // TODO(mknyszek): Once iOS <14 is deprecated, promote ios/arm64
207 // to a 48-bit address space like every other arm64 platform.
209 // WebAssembly currently has a limit of 4GB linear memory.
210 heapAddrBits = (_64bit*(1-goarch.IsWasm)*(1-goos.IsIos*goarch.IsArm64))*48 + (1-_64bit+goarch.IsWasm)*(32-(goarch.IsMips+goarch.IsMipsle)) + 40*goos.IsIos*goarch.IsArm64
212 // maxAlloc is the maximum size of an allocation. On 64-bit,
213 // it's theoretically possible to allocate 1<<heapAddrBits bytes. On
214 // 32-bit, however, this is one less than 1<<32 because the
215 // number of bytes in the address space doesn't actually fit
217 maxAlloc = (1 << heapAddrBits) - (1-_64bit)*1
219 // The number of bits in a heap address, the size of heap
220 // arenas, and the L1 and L2 arena map sizes are related by
222 // (1 << addr bits) = arena size * L1 entries * L2 entries
224 // Currently, we balance these as follows:
226 // Platform Addr bits Arena size L1 entries L2 entries
227 // -------------- --------- ---------- ---------- -----------
228 // */64-bit 48 64MB 1 4M (32MB)
229 // windows/64-bit 48 4MB 64 1M (8MB)
230 // ios/arm64 33 4MB 1 2048 (8KB)
231 // */32-bit 32 4MB 1 1024 (4KB)
232 // */mips(le) 31 4MB 1 512 (2KB)
234 // heapArenaBytes is the size of a heap arena. The heap
235 // consists of mappings of size heapArenaBytes, aligned to
236 // heapArenaBytes. The initial heap mapping is one arena.
238 // This is currently 64MB on 64-bit non-Windows and 4MB on
239 // 32-bit and on Windows. We use smaller arenas on Windows
240 // because all committed memory is charged to the process,
241 // even if it's not touched. Hence, for processes with small
242 // heaps, the mapped arena space needs to be commensurate.
243 // This is particularly important with the race detector,
244 // since it significantly amplifies the cost of committed
246 heapArenaBytes = 1 << logHeapArenaBytes
248 heapArenaWords = heapArenaBytes / goarch.PtrSize
250 // logHeapArenaBytes is log_2 of heapArenaBytes. For clarity,
251 // prefer using heapArenaBytes where possible (we need the
252 // constant to compute some other constants).
253 logHeapArenaBytes = (6+20)*(_64bit*(1-goos.IsWindows)*(1-goarch.IsWasm)*(1-goos.IsIos*goarch.IsArm64)) + (2+20)*(_64bit*goos.IsWindows) + (2+20)*(1-_64bit) + (2+20)*goarch.IsWasm + (2+20)*goos.IsIos*goarch.IsArm64
255 // heapArenaBitmapWords is the size of each heap arena's bitmap in uintptrs.
256 heapArenaBitmapWords = heapArenaWords / (8 * goarch.PtrSize)
258 pagesPerArena = heapArenaBytes / pageSize
260 // arenaL1Bits is the number of bits of the arena number
261 // covered by the first level arena map.
263 // This number should be small, since the first level arena
264 // map requires PtrSize*(1<<arenaL1Bits) of space in the
265 // binary's BSS. It can be zero, in which case the first level
266 // index is effectively unused. There is a performance benefit
267 // to this, since the generated code can be more efficient,
268 // but comes at the cost of having a large L2 mapping.
270 // We use the L1 map on 64-bit Windows because the arena size
271 // is small, but the address space is still 48 bits, and
272 // there's a high cost to having a large L2.
273 arenaL1Bits = 6 * (_64bit * goos.IsWindows)
275 // arenaL2Bits is the number of bits of the arena number
276 // covered by the second level arena index.
278 // The size of each arena map allocation is proportional to
279 // 1<<arenaL2Bits, so it's important that this not be too
280 // large. 48 bits leads to 32MB arena index allocations, which
281 // is about the practical threshold.
282 arenaL2Bits = heapAddrBits - logHeapArenaBytes - arenaL1Bits
284 // arenaL1Shift is the number of bits to shift an arena frame
285 // number by to compute an index into the first level arena map.
286 arenaL1Shift = arenaL2Bits
288 // arenaBits is the total bits in a combined arena map index.
289 // This is split between the index into the L1 arena map and
291 arenaBits = arenaL1Bits + arenaL2Bits
293 // arenaBaseOffset is the pointer value that corresponds to
294 // index 0 in the heap arena map.
296 // On amd64, the address space is 48 bits, sign extended to 64
297 // bits. This offset lets us handle "negative" addresses (or
298 // high addresses if viewed as unsigned).
300 // On aix/ppc64, this offset allows to keep the heapAddrBits to
301 // 48. Otherwise, it would be 60 in order to handle mmap addresses
302 // (in range 0x0a00000000000000 - 0x0afffffffffffff). But in this
303 // case, the memory reserved in (s *pageAlloc).init for chunks
304 // is causing important slowdowns.
306 // On other platforms, the user address space is contiguous
307 // and starts at 0, so no offset is necessary.
308 arenaBaseOffset = 0xffff800000000000*goarch.IsAmd64 + 0x0a00000000000000*goos.IsAix
309 // A typed version of this constant that will make it into DWARF (for viewcore).
310 arenaBaseOffsetUintptr = uintptr(arenaBaseOffset)
312 // Max number of threads to run garbage collection.
313 // 2, 3, and 4 are all plausible maximums depending
314 // on the hardware details of the machine. The garbage
315 // collector scales well to 32 cpus.
318 // minLegalPointer is the smallest possible legal pointer.
319 // This is the smallest possible architectural page size,
320 // since we assume that the first page is never mapped.
322 // This should agree with minZeroPage in the compiler.
323 minLegalPointer uintptr = 4096
325 // minHeapForMetadataHugePages sets a threshold on when certain kinds of
326 // heap metadata, currently the arenas map L2 entries and page alloc bitmap
327 // mappings, are allowed to be backed by huge pages. If the heap goal ever
328 // exceeds this threshold, then huge pages are enabled.
330 // These numbers are chosen with the assumption that huge pages are on the
331 // order of a few MiB in size.
333 // The kind of metadata this applies to has a very low overhead when compared
334 // to address space used, but their constant overheads for small heaps would
335 // be very high if they were to be backed by huge pages (e.g. a few MiB makes
336 // a huge difference for an 8 MiB heap, but barely any difference for a 1 GiB
337 // heap). The benefit of huge pages is also not worth it for small heaps,
338 // because only a very, very small part of the metadata is used for small heaps.
340 // N.B. If the heap goal exceeds the threshold then shrinks to a very small size
341 // again, then huge pages will still be enabled for this mapping. The reason is that
342 // there's no point unless we're also returning the physical memory for these
343 // metadata mappings back to the OS. That would be quite complex to do in general
344 // as the heap is likely fragmented after a reduction in heap size.
345 minHeapForMetadataHugePages = 1 << 30
348 // physPageSize is the size in bytes of the OS's physical pages.
349 // Mapping and unmapping operations must be done at multiples of
352 // This must be set by the OS init code (typically in osinit) before
354 var physPageSize uintptr
356 // physHugePageSize is the size in bytes of the OS's default physical huge
357 // page size whose allocation is opaque to the application. It is assumed
358 // and verified to be a power of two.
360 // If set, this must be set by the OS init code (typically in osinit) before
361 // mallocinit. However, setting it at all is optional, and leaving the default
362 // value is always safe (though potentially less efficient).
364 // Since physHugePageSize is always assumed to be a power of two,
365 // physHugePageShift is defined as physHugePageSize == 1 << physHugePageShift.
366 // The purpose of physHugePageShift is to avoid doing divisions in
367 // performance critical functions.
369 physHugePageSize uintptr
370 physHugePageShift uint
374 if class_to_size[_TinySizeClass] != _TinySize {
375 throw("bad TinySizeClass")
378 if heapArenaBitmapWords&(heapArenaBitmapWords-1) != 0 {
379 // heapBits expects modular arithmetic on bitmap
380 // addresses to work.
381 throw("heapArenaBitmapWords not a power of 2")
384 // Check physPageSize.
385 if physPageSize == 0 {
386 // The OS init code failed to fetch the physical page size.
387 throw("failed to get system page size")
389 if physPageSize > maxPhysPageSize {
390 print("system page size (", physPageSize, ") is larger than maximum page size (", maxPhysPageSize, ")\n")
391 throw("bad system page size")
393 if physPageSize < minPhysPageSize {
394 print("system page size (", physPageSize, ") is smaller than minimum page size (", minPhysPageSize, ")\n")
395 throw("bad system page size")
397 if physPageSize&(physPageSize-1) != 0 {
398 print("system page size (", physPageSize, ") must be a power of 2\n")
399 throw("bad system page size")
401 if physHugePageSize&(physHugePageSize-1) != 0 {
402 print("system huge page size (", physHugePageSize, ") must be a power of 2\n")
403 throw("bad system huge page size")
405 if physHugePageSize > maxPhysHugePageSize {
406 // physHugePageSize is greater than the maximum supported huge page size.
407 // Don't throw here, like in the other cases, since a system configured
408 // in this way isn't wrong, we just don't have the code to support them.
409 // Instead, silently set the huge page size to zero.
412 if physHugePageSize != 0 {
413 // Since physHugePageSize is a power of 2, it suffices to increase
414 // physHugePageShift until 1<<physHugePageShift == physHugePageSize.
415 for 1<<physHugePageShift != physHugePageSize {
419 if pagesPerArena%pagesPerSpanRoot != 0 {
420 print("pagesPerArena (", pagesPerArena, ") is not divisible by pagesPerSpanRoot (", pagesPerSpanRoot, ")\n")
421 throw("bad pagesPerSpanRoot")
423 if pagesPerArena%pagesPerReclaimerChunk != 0 {
424 print("pagesPerArena (", pagesPerArena, ") is not divisible by pagesPerReclaimerChunk (", pagesPerReclaimerChunk, ")\n")
425 throw("bad pagesPerReclaimerChunk")
428 if minTagBits > taggedPointerBits {
429 throw("taggedPointerbits too small")
432 // Initialize the heap.
434 mcache0 = allocmcache()
435 lockInit(&gcBitsArenas.lock, lockRankGcBitsArenas)
436 lockInit(&profInsertLock, lockRankProfInsert)
437 lockInit(&profBlockLock, lockRankProfBlock)
438 lockInit(&profMemActiveLock, lockRankProfMemActive)
439 for i := range profMemFutureLock {
440 lockInit(&profMemFutureLock[i], lockRankProfMemFuture)
442 lockInit(&globalAlloc.mutex, lockRankGlobalAlloc)
444 // Create initial arena growth hints.
445 if goarch.PtrSize == 8 {
446 // On a 64-bit machine, we pick the following hints
449 // 1. Starting from the middle of the address space
450 // makes it easier to grow out a contiguous range
451 // without running in to some other mapping.
453 // 2. This makes Go heap addresses more easily
454 // recognizable when debugging.
456 // 3. Stack scanning in gccgo is still conservative,
457 // so it's important that addresses be distinguishable
460 // Starting at 0x00c0 means that the valid memory addresses
461 // will begin 0x00c0, 0x00c1, ...
462 // In little-endian, that's c0 00, c1 00, ... None of those are valid
463 // UTF-8 sequences, and they are otherwise as far away from
464 // ff (likely a common byte) as possible. If that fails, we try other 0xXXc0
465 // addresses. An earlier attempt to use 0x11f8 caused out of memory errors
466 // on OS X during thread allocations. 0x00c0 causes conflicts with
467 // AddressSanitizer which reserves all memory up to 0x0100.
468 // These choices reduce the odds of a conservative garbage collector
469 // not collecting memory because some non-pointer block of memory
470 // had a bit pattern that matched a memory address.
472 // However, on arm64, we ignore all this advice above and slam the
473 // allocation at 0x40 << 32 because when using 4k pages with 3-level
474 // translation buffers, the user address space is limited to 39 bits
475 // On ios/arm64, the address space is even smaller.
477 // On AIX, mmaps starts at 0x0A00000000000000 for 64-bit.
480 // Space mapped for user arenas comes immediately after the range
481 // originally reserved for the regular heap when race mode is not
482 // enabled because user arena chunks can never be used for regular heap
483 // allocations and we want to avoid fragmenting the address space.
485 // In race mode we have no choice but to just use the same hints because
486 // the race detector requires that the heap be mapped contiguously.
487 for i := 0x7f; i >= 0; i-- {
491 // The TSAN runtime requires the heap
492 // to be in the range [0x00c000000000,
494 p = uintptr(i)<<32 | uintptrMask&(0x00c0<<32)
495 if p >= uintptrMask&0x00e000000000 {
498 case GOARCH == "arm64" && GOOS == "ios":
499 p = uintptr(i)<<40 | uintptrMask&(0x0013<<28)
500 case GOARCH == "arm64":
501 p = uintptr(i)<<40 | uintptrMask&(0x0040<<32)
504 // We don't use addresses directly after 0x0A00000000000000
505 // to avoid collisions with others mmaps done by non-go programs.
508 p = uintptr(i)<<40 | uintptrMask&(0xa0<<52)
510 p = uintptr(i)<<40 | uintptrMask&(0x00c0<<32)
512 // Switch to generating hints for user arenas if we've gone
513 // through about half the hints. In race mode, take only about
514 // a quarter; we don't have very much space to work with.
515 hintList := &mheap_.arenaHints
516 if (!raceenabled && i > 0x3f) || (raceenabled && i > 0x5f) {
517 hintList = &mheap_.userArena.arenaHints
519 hint := (*arenaHint)(mheap_.arenaHintAlloc.alloc())
521 hint.next, *hintList = *hintList, hint
524 // On a 32-bit machine, we're much more concerned
525 // about keeping the usable heap contiguous.
528 // 1. We reserve space for all heapArenas up front so
529 // they don't get interleaved with the heap. They're
530 // ~258MB, so this isn't too bad. (We could reserve a
531 // smaller amount of space up front if this is a
534 // 2. We hint the heap to start right above the end of
535 // the binary so we have the best chance of keeping it
538 // 3. We try to stake out a reasonably large initial
541 const arenaMetaSize = (1 << arenaBits) * unsafe.Sizeof(heapArena{})
542 meta := uintptr(sysReserve(nil, arenaMetaSize))
544 mheap_.heapArenaAlloc.init(meta, arenaMetaSize, true)
547 // We want to start the arena low, but if we're linked
548 // against C code, it's possible global constructors
549 // have called malloc and adjusted the process' brk.
550 // Query the brk so we can avoid trying to map the
551 // region over it (which will cause the kernel to put
552 // the region somewhere else, likely at a high
556 // If we ask for the end of the data segment but the
557 // operating system requires a little more space
558 // before we can start allocating, it will give out a
559 // slightly higher pointer. Except QEMU, which is
560 // buggy, as usual: it won't adjust the pointer
561 // upward. So adjust it upward a little bit ourselves:
562 // 1/4 MB to get away from the running binary image.
563 p := firstmoduledata.end
567 if mheap_.heapArenaAlloc.next <= p && p < mheap_.heapArenaAlloc.end {
568 p = mheap_.heapArenaAlloc.end
570 p = alignUp(p+(256<<10), heapArenaBytes)
571 // Because we're worried about fragmentation on
572 // 32-bit, we try to make a large initial reservation.
573 arenaSizes := []uintptr{
578 for _, arenaSize := range arenaSizes {
579 a, size := sysReserveAligned(unsafe.Pointer(p), arenaSize, heapArenaBytes)
581 mheap_.arena.init(uintptr(a), size, false)
582 p = mheap_.arena.end // For hint below
586 hint := (*arenaHint)(mheap_.arenaHintAlloc.alloc())
588 hint.next, mheap_.arenaHints = mheap_.arenaHints, hint
590 // Place the hint for user arenas just after the large reservation.
592 // While this potentially competes with the hint above, in practice we probably
593 // aren't going to be getting this far anyway on 32-bit platforms.
594 userArenaHint := (*arenaHint)(mheap_.arenaHintAlloc.alloc())
595 userArenaHint.addr = p
596 userArenaHint.next, mheap_.userArena.arenaHints = mheap_.userArena.arenaHints, userArenaHint
598 // Initialize the memory limit here because the allocator is going to look at it
599 // but we haven't called gcinit yet and we're definitely going to allocate memory before then.
600 gcController.memoryLimit.Store(maxInt64)
603 // sysAlloc allocates heap arena space for at least n bytes. The
604 // returned pointer is always heapArenaBytes-aligned and backed by
605 // h.arenas metadata. The returned size is always a multiple of
606 // heapArenaBytes. sysAlloc returns nil on failure.
607 // There is no corresponding free function.
609 // hintList is a list of hint addresses for where to allocate new
610 // heap arenas. It must be non-nil.
612 // register indicates whether the heap arena should be registered
615 // sysAlloc returns a memory region in the Reserved state. This region must
616 // be transitioned to Prepared and then Ready before use.
619 func (h *mheap) sysAlloc(n uintptr, hintList **arenaHint, register bool) (v unsafe.Pointer, size uintptr) {
620 assertLockHeld(&h.lock)
622 n = alignUp(n, heapArenaBytes)
624 if hintList == &h.arenaHints {
625 // First, try the arena pre-reservation.
626 // Newly-used mappings are considered released.
628 // Only do this if we're using the regular heap arena hints.
629 // This behavior is only for the heap.
630 v = h.arena.alloc(n, heapArenaBytes, &gcController.heapReleased)
637 // Try to grow the heap at a hint address.
638 for *hintList != nil {
645 // We can't use this, so don't ask.
647 } else if arenaIndex(p+n-1) >= 1<<arenaBits {
648 // Outside addressable heap. Can't use.
651 v = sysReserve(unsafe.Pointer(p), n)
654 // Success. Update the hint.
662 // Failed. Discard this hint and try the next.
664 // TODO: This would be cleaner if sysReserve could be
665 // told to only return the requested address. In
666 // particular, this is already how Windows behaves, so
667 // it would simplify things there.
671 *hintList = hint.next
672 h.arenaHintAlloc.free(unsafe.Pointer(hint))
677 // The race detector assumes the heap lives in
678 // [0x00c000000000, 0x00e000000000), but we
679 // just ran out of hints in this region. Give
681 throw("too many address space collisions for -race mode")
684 // All of the hints failed, so we'll take any
685 // (sufficiently aligned) address the kernel will give
687 v, size = sysReserveAligned(nil, n, heapArenaBytes)
692 // Create new hints for extending this region.
693 hint := (*arenaHint)(h.arenaHintAlloc.alloc())
694 hint.addr, hint.down = uintptr(v), true
695 hint.next, mheap_.arenaHints = mheap_.arenaHints, hint
696 hint = (*arenaHint)(h.arenaHintAlloc.alloc())
697 hint.addr = uintptr(v) + size
698 hint.next, mheap_.arenaHints = mheap_.arenaHints, hint
701 // Check for bad pointers or pointers we can't use.
706 bad = "region exceeds uintptr range"
707 } else if arenaIndex(p) >= 1<<arenaBits {
708 bad = "base outside usable address space"
709 } else if arenaIndex(p+size-1) >= 1<<arenaBits {
710 bad = "end outside usable address space"
713 // This should be impossible on most architectures,
714 // but it would be really confusing to debug.
715 print("runtime: memory allocated by OS [", hex(p), ", ", hex(p+size), ") not in usable address space: ", bad, "\n")
716 throw("memory reservation exceeds address space limit")
720 if uintptr(v)&(heapArenaBytes-1) != 0 {
721 throw("misrounded allocation in sysAlloc")
725 // Create arena metadata.
726 for ri := arenaIndex(uintptr(v)); ri <= arenaIndex(uintptr(v)+size-1); ri++ {
727 l2 := h.arenas[ri.l1()]
729 // Allocate an L2 arena map.
731 // Use sysAllocOS instead of sysAlloc or persistentalloc because there's no
732 // statistic we can comfortably account for this space in. With this structure,
733 // we rely on demand paging to avoid large overheads, but tracking which memory
734 // is paged in is too expensive. Trying to account for the whole region means
735 // that it will appear like an enormous memory overhead in statistics, even though
737 l2 = (*[1 << arenaL2Bits]*heapArena)(sysAllocOS(unsafe.Sizeof(*l2)))
739 throw("out of memory allocating heap arena map")
741 if h.arenasHugePages {
742 sysHugePage(unsafe.Pointer(l2), unsafe.Sizeof(*l2))
744 sysNoHugePage(unsafe.Pointer(l2), unsafe.Sizeof(*l2))
746 atomic.StorepNoWB(unsafe.Pointer(&h.arenas[ri.l1()]), unsafe.Pointer(l2))
749 if l2[ri.l2()] != nil {
750 throw("arena already initialized")
753 r = (*heapArena)(h.heapArenaAlloc.alloc(unsafe.Sizeof(*r), goarch.PtrSize, &memstats.gcMiscSys))
755 r = (*heapArena)(persistentalloc(unsafe.Sizeof(*r), goarch.PtrSize, &memstats.gcMiscSys))
757 throw("out of memory allocating heap arena metadata")
761 // Register the arena in allArenas if requested.
763 if len(h.allArenas) == cap(h.allArenas) {
764 size := 2 * uintptr(cap(h.allArenas)) * goarch.PtrSize
768 newArray := (*notInHeap)(persistentalloc(size, goarch.PtrSize, &memstats.gcMiscSys))
770 throw("out of memory allocating allArenas")
772 oldSlice := h.allArenas
773 *(*notInHeapSlice)(unsafe.Pointer(&h.allArenas)) = notInHeapSlice{newArray, len(h.allArenas), int(size / goarch.PtrSize)}
774 copy(h.allArenas, oldSlice)
775 // Do not free the old backing array because
776 // there may be concurrent readers. Since we
777 // double the array each time, this can lead
778 // to at most 2x waste.
780 h.allArenas = h.allArenas[:len(h.allArenas)+1]
781 h.allArenas[len(h.allArenas)-1] = ri
784 // Store atomically just in case an object from the
785 // new heap arena becomes visible before the heap lock
786 // is released (which shouldn't happen, but there's
787 // little downside to this).
788 atomic.StorepNoWB(unsafe.Pointer(&l2[ri.l2()]), unsafe.Pointer(r))
791 // Tell the race detector about the new heap memory.
793 racemapshadow(v, size)
799 // sysReserveAligned is like sysReserve, but the returned pointer is
800 // aligned to align bytes. It may reserve either n or n+align bytes,
801 // so it returns the size that was reserved.
802 func sysReserveAligned(v unsafe.Pointer, size, align uintptr) (unsafe.Pointer, uintptr) {
803 // Since the alignment is rather large in uses of this
804 // function, we're not likely to get it by chance, so we ask
805 // for a larger region and remove the parts we don't need.
808 p := uintptr(sysReserve(v, size+align))
812 case p&(align-1) == 0:
813 return unsafe.Pointer(p), size + align
814 case GOOS == "windows":
815 // On Windows we can't release pieces of a
816 // reservation, so we release the whole thing and
817 // re-reserve the aligned sub-region. This may race,
818 // so we may have to try again.
819 sysFreeOS(unsafe.Pointer(p), size+align)
820 p = alignUp(p, align)
821 p2 := sysReserve(unsafe.Pointer(p), size)
822 if p != uintptr(p2) {
823 // Must have raced. Try again.
825 if retries++; retries == 100 {
826 throw("failed to allocate aligned heap memory; too many retries")
833 // Trim off the unaligned parts.
834 pAligned := alignUp(p, align)
835 sysFreeOS(unsafe.Pointer(p), pAligned-p)
836 end := pAligned + size
837 endLen := (p + size + align) - end
839 sysFreeOS(unsafe.Pointer(end), endLen)
841 return unsafe.Pointer(pAligned), size
845 // enableMetadataHugePages enables huge pages for various sources of heap metadata.
847 // A note on latency: for sufficiently small heaps (<10s of GiB) this function will take constant
848 // time, but may take time proportional to the size of the mapped heap beyond that.
850 // This function is idempotent.
852 // The heap lock must not be held over this operation, since it will briefly acquire
854 func (h *mheap) enableMetadataHugePages() {
855 // Enable huge pages for page structure.
856 h.pages.enableChunkHugePages()
858 // Grab the lock and set arenasHugePages if it's not.
860 // Once arenasHugePages is set, all new L2 entries will be eligible for
861 // huge pages. We'll set all the old entries after we release the lock.
863 if h.arenasHugePages {
867 h.arenasHugePages = true
870 // N.B. The arenas L1 map is quite small on all platforms, so it's fine to
871 // just iterate over the whole thing.
872 for i := range h.arenas {
873 l2 := (*[1 << arenaL2Bits]*heapArena)(atomic.Loadp(unsafe.Pointer(&h.arenas[i])))
877 sysHugePage(unsafe.Pointer(l2), unsafe.Sizeof(*l2))
881 // base address for all 0-byte allocations
884 // nextFreeFast returns the next free object if one is quickly available.
885 // Otherwise it returns 0.
886 func nextFreeFast(s *mspan) gclinkptr {
887 theBit := sys.TrailingZeros64(s.allocCache) // Is there a free object in the allocCache?
889 result := s.freeindex + uint16(theBit)
890 if result < s.nelems {
891 freeidx := result + 1
892 if freeidx%64 == 0 && freeidx != s.nelems {
895 s.allocCache >>= uint(theBit + 1)
896 s.freeindex = freeidx
898 return gclinkptr(uintptr(result)*s.elemsize + s.base())
904 // nextFree returns the next free object from the cached span if one is available.
905 // Otherwise it refills the cache with a span with an available object and
906 // returns that object along with a flag indicating that this was a heavy
907 // weight allocation. If it is a heavy weight allocation the caller must
908 // determine whether a new GC cycle needs to be started or if the GC is active
909 // whether this goroutine needs to assist the GC.
911 // Must run in a non-preemptible context since otherwise the owner of
913 func (c *mcache) nextFree(spc spanClass) (v gclinkptr, s *mspan, shouldhelpgc bool) {
916 freeIndex := s.nextFreeIndex()
917 if freeIndex == s.nelems {
919 if s.allocCount != s.nelems {
920 println("runtime: s.allocCount=", s.allocCount, "s.nelems=", s.nelems)
921 throw("s.allocCount != s.nelems && freeIndex == s.nelems")
927 freeIndex = s.nextFreeIndex()
930 if freeIndex >= s.nelems {
931 throw("freeIndex is not valid")
934 v = gclinkptr(uintptr(freeIndex)*s.elemsize + s.base())
936 if s.allocCount > s.nelems {
937 println("s.allocCount=", s.allocCount, "s.nelems=", s.nelems)
938 throw("s.allocCount > s.nelems")
943 // Allocate an object of size bytes.
944 // Small objects are allocated from the per-P cache's free lists.
945 // Large objects (> 32 kB) are allocated straight from the heap.
946 func mallocgc(size uintptr, typ *_type, needzero bool) unsafe.Pointer {
947 if gcphase == _GCmarktermination {
948 throw("mallocgc called with gcphase == _GCmarktermination")
952 return unsafe.Pointer(&zerobase)
955 // It's possible for any malloc to trigger sweeping, which may in
956 // turn queue finalizers. Record this dynamic lock edge.
957 lockRankMayQueueFinalizer()
961 // Refer to ASAN runtime library, the malloc() function allocates extra memory,
962 // the redzone, around the user requested memory region. And the redzones are marked
963 // as unaddressable. We perform the same operations in Go to detect the overflows or
965 size += computeRZlog(size)
972 // TODO(austin): This should be just
973 // align = uintptr(typ.align)
974 // but that's only 4 on 32-bit platforms,
975 // even if there's a uint64 field in typ (see #599).
976 // This causes 64-bit atomic accesses to panic.
977 // Hence, we use stricter alignment that matches
978 // the normal allocator better.
981 } else if size&3 == 0 {
983 } else if size&1 == 0 {
989 return persistentalloc(size, align, &memstats.other_sys)
992 if inittrace.active && inittrace.id == getg().goid {
993 // Init functions are executed sequentially in a single goroutine.
994 inittrace.allocs += 1
998 // assistG is the G to charge for this allocation, or nil if
999 // GC is not currently active.
1000 assistG := deductAssistCredit(size)
1002 // Set mp.mallocing to keep from being preempted by GC.
1004 if mp.mallocing != 0 {
1005 throw("malloc deadlock")
1007 if mp.gsignal == getg() {
1008 throw("malloc during signal")
1012 shouldhelpgc := false
1013 dataSize := userSize
1016 throw("mallocgc called without a P or outside bootstrapping")
1019 var x unsafe.Pointer
1020 noscan := typ == nil || typ.PtrBytes == 0
1021 // In some cases block zeroing can profitably (for latency reduction purposes)
1022 // be delayed till preemption is possible; delayedZeroing tracks that state.
1023 delayedZeroing := false
1024 if size <= maxSmallSize {
1025 if noscan && size < maxTinySize {
1028 // Tiny allocator combines several tiny allocation requests
1029 // into a single memory block. The resulting memory block
1030 // is freed when all subobjects are unreachable. The subobjects
1031 // must be noscan (don't have pointers), this ensures that
1032 // the amount of potentially wasted memory is bounded.
1034 // Size of the memory block used for combining (maxTinySize) is tunable.
1035 // Current setting is 16 bytes, which relates to 2x worst case memory
1036 // wastage (when all but one subobjects are unreachable).
1037 // 8 bytes would result in no wastage at all, but provides less
1038 // opportunities for combining.
1039 // 32 bytes provides more opportunities for combining,
1040 // but can lead to 4x worst case wastage.
1041 // The best case winning is 8x regardless of block size.
1043 // Objects obtained from tiny allocator must not be freed explicitly.
1044 // So when an object will be freed explicitly, we ensure that
1045 // its size >= maxTinySize.
1047 // SetFinalizer has a special case for objects potentially coming
1048 // from tiny allocator, it such case it allows to set finalizers
1049 // for an inner byte of a memory block.
1051 // The main targets of tiny allocator are small strings and
1052 // standalone escaping variables. On a json benchmark
1053 // the allocator reduces number of allocations by ~12% and
1054 // reduces heap size by ~20%.
1056 // Align tiny pointer for required (conservative) alignment.
1058 off = alignUp(off, 8)
1059 } else if goarch.PtrSize == 4 && size == 12 {
1060 // Conservatively align 12-byte objects to 8 bytes on 32-bit
1061 // systems so that objects whose first field is a 64-bit
1062 // value is aligned to 8 bytes and does not cause a fault on
1063 // atomic access. See issue 37262.
1064 // TODO(mknyszek): Remove this workaround if/when issue 36606
1066 off = alignUp(off, 8)
1067 } else if size&3 == 0 {
1068 off = alignUp(off, 4)
1069 } else if size&1 == 0 {
1070 off = alignUp(off, 2)
1072 if off+size <= maxTinySize && c.tiny != 0 {
1073 // The object fits into existing tiny block.
1074 x = unsafe.Pointer(c.tiny + off)
1075 c.tinyoffset = off + size
1081 // Allocate a new maxTinySize block.
1082 span = c.alloc[tinySpanClass]
1083 v := nextFreeFast(span)
1085 v, span, shouldhelpgc = c.nextFree(tinySpanClass)
1087 x = unsafe.Pointer(v)
1088 (*[2]uint64)(x)[0] = 0
1089 (*[2]uint64)(x)[1] = 0
1090 // See if we need to replace the existing tiny block with the new one
1091 // based on amount of remaining free space.
1092 if !raceenabled && (size < c.tinyoffset || c.tiny == 0) {
1093 // Note: disabled when race detector is on, see comment near end of this function.
1100 if size <= smallSizeMax-8 {
1101 sizeclass = size_to_class8[divRoundUp(size, smallSizeDiv)]
1103 sizeclass = size_to_class128[divRoundUp(size-smallSizeMax, largeSizeDiv)]
1105 size = uintptr(class_to_size[sizeclass])
1106 spc := makeSpanClass(sizeclass, noscan)
1108 v := nextFreeFast(span)
1110 v, span, shouldhelpgc = c.nextFree(spc)
1112 x = unsafe.Pointer(v)
1113 if needzero && span.needzero != 0 {
1114 memclrNoHeapPointers(x, size)
1119 // For large allocations, keep track of zeroed state so that
1120 // bulk zeroing can be happen later in a preemptible context.
1121 span = c.allocLarge(size, noscan)
1124 size = span.elemsize
1125 x = unsafe.Pointer(span.base())
1126 if needzero && span.needzero != 0 {
1128 delayedZeroing = true
1130 memclrNoHeapPointers(x, size)
1131 // We've in theory cleared almost the whole span here,
1132 // and could take the extra step of actually clearing
1133 // the whole thing. However, don't. Any GC bits for the
1134 // uncleared parts will be zero, and it's just going to
1135 // be needzero = 1 once freed anyway.
1141 var scanSize uintptr
1142 heapBitsSetType(uintptr(x), size, dataSize, typ)
1143 if dataSize > typ.Size_ {
1144 // Array allocation. If there are any
1145 // pointers, GC has to scan to the last
1147 if typ.PtrBytes != 0 {
1148 scanSize = dataSize - typ.Size_ + typ.PtrBytes
1151 scanSize = typ.PtrBytes
1153 c.scanAlloc += scanSize
1156 // Ensure that the stores above that initialize x to
1157 // type-safe memory and set the heap bits occur before
1158 // the caller can make x observable to the garbage
1159 // collector. Otherwise, on weakly ordered machines,
1160 // the garbage collector could follow a pointer to x,
1161 // but see uninitialized memory or stale heap bits.
1162 publicationBarrier()
1163 // As x and the heap bits are initialized, update
1164 // freeIndexForScan now so x is seen by the GC
1165 // (including conservative scan) as an allocated object.
1166 // While this pointer can't escape into user code as a
1167 // _live_ pointer until we return, conservative scanning
1168 // may find a dead pointer that happens to point into this
1169 // object. Delaying this update until now ensures that
1170 // conservative scanning considers this pointer dead until
1172 span.freeIndexForScan = span.freeindex
1174 // Allocate black during GC.
1175 // All slots hold nil so no scanning is needed.
1176 // This may be racing with GC so do it atomically if there can be
1177 // a race marking the bit.
1178 if gcphase != _GCoff {
1179 gcmarknewobject(span, uintptr(x), size)
1191 // We should only read/write the memory with the size asked by the user.
1192 // The rest of the allocated memory should be poisoned, so that we can report
1193 // errors when accessing poisoned memory.
1194 // The allocated memory is larger than required userSize, it will also include
1195 // redzone and some other padding bytes.
1196 rzBeg := unsafe.Add(x, userSize)
1197 asanpoison(rzBeg, size-userSize)
1198 asanunpoison(x, userSize)
1201 if rate := MemProfileRate; rate > 0 {
1202 // Note cache c only valid while m acquired; see #47302
1203 if rate != 1 && size < c.nextSample {
1204 c.nextSample -= size
1206 profilealloc(mp, x, size)
1212 // Pointerfree data can be zeroed late in a context where preemption can occur.
1213 // x will keep the memory alive.
1216 throw("delayed zeroing on data that may contain pointers")
1218 memclrNoHeapPointersChunked(size, x) // This is a possible preemption point: see #47302
1222 if debug.allocfreetrace != 0 {
1223 tracealloc(x, size, typ)
1226 if inittrace.active && inittrace.id == getg().goid {
1227 // Init functions are executed sequentially in a single goroutine.
1228 inittrace.bytes += uint64(size)
1233 // Account for internal fragmentation in the assist
1234 // debt now that we know it.
1235 assistG.gcAssistBytes -= int64(size - dataSize)
1239 if t := (gcTrigger{kind: gcTriggerHeap}); t.test() {
1244 if raceenabled && noscan && dataSize < maxTinySize {
1245 // Pad tinysize allocations so they are aligned with the end
1246 // of the tinyalloc region. This ensures that any arithmetic
1247 // that goes off the top end of the object will be detectable
1248 // by checkptr (issue 38872).
1249 // Note that we disable tinyalloc when raceenabled for this to work.
1250 // TODO: This padding is only performed when the race detector
1251 // is enabled. It would be nice to enable it if any package
1252 // was compiled with checkptr, but there's no easy way to
1253 // detect that (especially at compile time).
1254 // TODO: enable this padding for all allocations, not just
1255 // tinyalloc ones. It's tricky because of pointer maps.
1256 // Maybe just all noscan objects?
1257 x = add(x, size-dataSize)
1263 // deductAssistCredit reduces the current G's assist credit
1264 // by size bytes, and assists the GC if necessary.
1266 // Caller must be preemptible.
1268 // Returns the G for which the assist credit was accounted.
1269 func deductAssistCredit(size uintptr) *g {
1271 if gcBlackenEnabled != 0 {
1272 // Charge the current user G for this allocation.
1274 if assistG.m.curg != nil {
1275 assistG = assistG.m.curg
1277 // Charge the allocation against the G. We'll account
1278 // for internal fragmentation at the end of mallocgc.
1279 assistG.gcAssistBytes -= int64(size)
1281 if assistG.gcAssistBytes < 0 {
1282 // This G is in debt. Assist the GC to correct
1283 // this before allocating. This must happen
1284 // before disabling preemption.
1285 gcAssistAlloc(assistG)
1291 // memclrNoHeapPointersChunked repeatedly calls memclrNoHeapPointers
1292 // on chunks of the buffer to be zeroed, with opportunities for preemption
1293 // along the way. memclrNoHeapPointers contains no safepoints and also
1294 // cannot be preemptively scheduled, so this provides a still-efficient
1295 // block copy that can also be preempted on a reasonable granularity.
1297 // Use this with care; if the data being cleared is tagged to contain
1298 // pointers, this allows the GC to run before it is all cleared.
1299 func memclrNoHeapPointersChunked(size uintptr, x unsafe.Pointer) {
1301 // got this from benchmarking. 128k is too small, 512k is too large.
1302 const chunkBytes = 256 * 1024
1304 for voff := v; voff < vsize; voff = voff + chunkBytes {
1306 // may hold locks, e.g., profiling
1309 // clear min(avail, lump) bytes
1314 memclrNoHeapPointers(unsafe.Pointer(voff), n)
1318 // implementation of new builtin
1319 // compiler (both frontend and SSA backend) knows the signature
1320 // of this function.
1321 func newobject(typ *_type) unsafe.Pointer {
1322 return mallocgc(typ.Size_, typ, true)
1325 //go:linkname reflect_unsafe_New reflect.unsafe_New
1326 func reflect_unsafe_New(typ *_type) unsafe.Pointer {
1327 return mallocgc(typ.Size_, typ, true)
1330 //go:linkname reflectlite_unsafe_New internal/reflectlite.unsafe_New
1331 func reflectlite_unsafe_New(typ *_type) unsafe.Pointer {
1332 return mallocgc(typ.Size_, typ, true)
1335 // newarray allocates an array of n elements of type typ.
1336 func newarray(typ *_type, n int) unsafe.Pointer {
1338 return mallocgc(typ.Size_, typ, true)
1340 mem, overflow := math.MulUintptr(typ.Size_, uintptr(n))
1341 if overflow || mem > maxAlloc || n < 0 {
1342 panic(plainError("runtime: allocation size out of range"))
1344 return mallocgc(mem, typ, true)
1347 //go:linkname reflect_unsafe_NewArray reflect.unsafe_NewArray
1348 func reflect_unsafe_NewArray(typ *_type, n int) unsafe.Pointer {
1349 return newarray(typ, n)
1352 func profilealloc(mp *m, x unsafe.Pointer, size uintptr) {
1355 throw("profilealloc called without a P or outside bootstrapping")
1357 c.nextSample = nextSample()
1358 mProf_Malloc(x, size)
1361 // nextSample returns the next sampling point for heap profiling. The goal is
1362 // to sample allocations on average every MemProfileRate bytes, but with a
1363 // completely random distribution over the allocation timeline; this
1364 // corresponds to a Poisson process with parameter MemProfileRate. In Poisson
1365 // processes, the distance between two samples follows the exponential
1366 // distribution (exp(MemProfileRate)), so the best return value is a random
1367 // number taken from an exponential distribution whose mean is MemProfileRate.
1368 func nextSample() uintptr {
1369 if MemProfileRate == 1 {
1370 // Callers assign our return value to
1371 // mcache.next_sample, but next_sample is not used
1372 // when the rate is 1. So avoid the math below and
1373 // just return something.
1376 if GOOS == "plan9" {
1377 // Plan 9 doesn't support floating point in note handler.
1378 if gp := getg(); gp == gp.m.gsignal {
1379 return nextSampleNoFP()
1383 return uintptr(fastexprand(MemProfileRate))
1386 // fastexprand returns a random number from an exponential distribution with
1387 // the specified mean.
1388 func fastexprand(mean int) int32 {
1389 // Avoid overflow. Maximum possible step is
1390 // -ln(1/(1<<randomBitCount)) * mean, approximately 20 * mean.
1392 case mean > 0x7000000:
1398 // Take a random sample of the exponential distribution exp(-mean*x).
1399 // The probability distribution function is mean*exp(-mean*x), so the CDF is
1400 // p = 1 - exp(-mean*x), so
1401 // q = 1 - p == exp(-mean*x)
1402 // log_e(q) = -mean*x
1403 // -log_e(q)/mean = x
1404 // x = -log_e(q) * mean
1405 // x = log_2(q) * (-log_e(2)) * mean ; Using log_2 for efficiency
1406 const randomBitCount = 26
1407 q := fastrandn(1<<randomBitCount) + 1
1408 qlog := fastlog2(float64(q)) - randomBitCount
1412 const minusLog2 = -0.6931471805599453 // -ln(2)
1413 return int32(qlog*(minusLog2*float64(mean))) + 1
1416 // nextSampleNoFP is similar to nextSample, but uses older,
1417 // simpler code to avoid floating point.
1418 func nextSampleNoFP() uintptr {
1419 // Set first allocation sample size.
1420 rate := MemProfileRate
1421 if rate > 0x3fffffff { // make 2*rate not overflow
1425 return uintptr(fastrandn(uint32(2 * rate)))
1430 type persistentAlloc struct {
1435 var globalAlloc struct {
1440 // persistentChunkSize is the number of bytes we allocate when we grow
1441 // a persistentAlloc.
1442 const persistentChunkSize = 256 << 10
1444 // persistentChunks is a list of all the persistent chunks we have
1445 // allocated. The list is maintained through the first word in the
1446 // persistent chunk. This is updated atomically.
1447 var persistentChunks *notInHeap
1449 // Wrapper around sysAlloc that can allocate small chunks.
1450 // There is no associated free operation.
1451 // Intended for things like function/type/debug-related persistent data.
1452 // If align is 0, uses default align (currently 8).
1453 // The returned memory will be zeroed.
1454 // sysStat must be non-nil.
1456 // Consider marking persistentalloc'd types not in heap by embedding
1457 // runtime/internal/sys.NotInHeap.
1458 func persistentalloc(size, align uintptr, sysStat *sysMemStat) unsafe.Pointer {
1460 systemstack(func() {
1461 p = persistentalloc1(size, align, sysStat)
1463 return unsafe.Pointer(p)
1466 // Must run on system stack because stack growth can (re)invoke it.
1470 func persistentalloc1(size, align uintptr, sysStat *sysMemStat) *notInHeap {
1472 maxBlock = 64 << 10 // VM reservation granularity is 64K on windows
1476 throw("persistentalloc: size == 0")
1479 if align&(align-1) != 0 {
1480 throw("persistentalloc: align is not a power of 2")
1482 if align > _PageSize {
1483 throw("persistentalloc: align is too large")
1489 if size >= maxBlock {
1490 return (*notInHeap)(sysAlloc(size, sysStat))
1494 var persistent *persistentAlloc
1495 if mp != nil && mp.p != 0 {
1496 persistent = &mp.p.ptr().palloc
1498 lock(&globalAlloc.mutex)
1499 persistent = &globalAlloc.persistentAlloc
1501 persistent.off = alignUp(persistent.off, align)
1502 if persistent.off+size > persistentChunkSize || persistent.base == nil {
1503 persistent.base = (*notInHeap)(sysAlloc(persistentChunkSize, &memstats.other_sys))
1504 if persistent.base == nil {
1505 if persistent == &globalAlloc.persistentAlloc {
1506 unlock(&globalAlloc.mutex)
1508 throw("runtime: cannot allocate memory")
1511 // Add the new chunk to the persistentChunks list.
1513 chunks := uintptr(unsafe.Pointer(persistentChunks))
1514 *(*uintptr)(unsafe.Pointer(persistent.base)) = chunks
1515 if atomic.Casuintptr((*uintptr)(unsafe.Pointer(&persistentChunks)), chunks, uintptr(unsafe.Pointer(persistent.base))) {
1519 persistent.off = alignUp(goarch.PtrSize, align)
1521 p := persistent.base.add(persistent.off)
1522 persistent.off += size
1524 if persistent == &globalAlloc.persistentAlloc {
1525 unlock(&globalAlloc.mutex)
1528 if sysStat != &memstats.other_sys {
1529 sysStat.add(int64(size))
1530 memstats.other_sys.add(-int64(size))
1535 // inPersistentAlloc reports whether p points to memory allocated by
1536 // persistentalloc. This must be nosplit because it is called by the
1537 // cgo checker code, which is called by the write barrier code.
1540 func inPersistentAlloc(p uintptr) bool {
1541 chunk := atomic.Loaduintptr((*uintptr)(unsafe.Pointer(&persistentChunks)))
1543 if p >= chunk && p < chunk+persistentChunkSize {
1546 chunk = *(*uintptr)(unsafe.Pointer(chunk))
1551 // linearAlloc is a simple linear allocator that pre-reserves a region
1552 // of memory and then optionally maps that region into the Ready state
1555 // The caller is responsible for locking.
1556 type linearAlloc struct {
1557 next uintptr // next free byte
1558 mapped uintptr // one byte past end of mapped space
1559 end uintptr // end of reserved space
1561 mapMemory bool // transition memory from Reserved to Ready if true
1564 func (l *linearAlloc) init(base, size uintptr, mapMemory bool) {
1565 if base+size < base {
1566 // Chop off the last byte. The runtime isn't prepared
1567 // to deal with situations where the bounds could overflow.
1568 // Leave that memory reserved, though, so we don't map it
1572 l.next, l.mapped = base, base
1574 l.mapMemory = mapMemory
1577 func (l *linearAlloc) alloc(size, align uintptr, sysStat *sysMemStat) unsafe.Pointer {
1578 p := alignUp(l.next, align)
1583 if pEnd := alignUp(l.next-1, physPageSize); pEnd > l.mapped {
1585 // Transition from Reserved to Prepared to Ready.
1586 n := pEnd - l.mapped
1587 sysMap(unsafe.Pointer(l.mapped), n, sysStat)
1588 sysUsed(unsafe.Pointer(l.mapped), n, n)
1592 return unsafe.Pointer(p)
1595 // notInHeap is off-heap memory allocated by a lower-level allocator
1596 // like sysAlloc or persistentAlloc.
1598 // In general, it's better to use real types which embed
1599 // runtime/internal/sys.NotInHeap, but this serves as a generic type
1600 // for situations where that isn't possible (like in the allocators).
1602 // TODO: Use this as the return type of sysAlloc, persistentAlloc, etc?
1603 type notInHeap struct{ _ sys.NotInHeap }
1605 func (p *notInHeap) add(bytes uintptr) *notInHeap {
1606 return (*notInHeap)(unsafe.Pointer(uintptr(unsafe.Pointer(p)) + bytes))
1609 // computeRZlog computes the size of the redzone.
1610 // Refer to the implementation of the compiler-rt.
1611 func computeRZlog(userSize uintptr) uintptr {
1613 case userSize <= (64 - 16):
1615 case userSize <= (128 - 32):
1617 case userSize <= (512 - 64):
1619 case userSize <= (4096 - 128):
1621 case userSize <= (1<<14)-256:
1623 case userSize <= (1<<15)-512:
1625 case userSize <= (1<<16)-1024: