runtime: correct scavengeIndex.sysGrow min index handling

The backing store for the scavengeIndex chunks slice is allocated on demand
as page allocation occurs. When pageAlloc.grow is called, a range is
allocated from a reserved region, before scavengeIndex.grow is called
to ensure that the chunks needed to manage this new range have a valid
backing store. The valid region for chunks is recorded as the index min
and index max. Any changes need to take the existing valid range into
consideration and ensure that a contiguous valid range is maintained.

However, a bug in the min index handling can currently lead to an existing
part of the chunk slice backing store being zeroed via remapping. Initially,
there is no backing store allocated and both min and max are zero. As soon
as an allocation occurs max will be non-zero, however it is still valid for
min to be zero depending on the base addresses of the page allocations. A
sequence like the following will trigger the bug:

1. A page allocation occurs requiring chunks [0, 512) (after rounding) - a
   sysMap occurs for the backing store, min is set to 0 and max is set
   to 512.

2. A page allocation occurs requiring chunks [512, 1024) - another sysMap
   occurs for this part of the backing store, max is set to 1024, however
   min is incorrectly set to 512, since haveMin == 0 (validly).

3. Another page allocation occurs requiring chunks [0, 512) - since min is
   currently 512 a sysMap occurs for the already mapped and inuse part
   of the backing store from [0, 512), zeroing the chunk data.

Correct this by only updating min when either haveMax == 0 (the
uninitialised case) or when needMin < haveMin (the case where the new
backing store range is actually below the current allocation). Remove
the unnecessary haveMax == 0 check for updating max, as the existing
needMax > haveMax case already covers this.

Fixes golang#63385

Change-Id: I9deed74c4ffa187c98286fe7110e5d735e81f35f
Reviewed-on: https://go-review.googlesource.com/c/go/+/553135
Reviewed-by: Michael Knyszek <[email protected]>
TryBot-Result: Gopher Robot <[email protected]>
Reviewed-by: Michael Pratt <[email protected]>
Run-TryBot: Joel Sing <[email protected]>

src/runtime/mpagealloc_64bit.go

@@ -209,23 +209,20 @@ func (s *scavengeIndex) sysGrow(base, limit uintptr, sysStat *sysMemStat) uintpt
  haveMax := s.max.Load()
  needMin := alignDown(uintptr(chunkIndex(base)), physPageSize/scSize)
  needMax := alignUp(uintptr(chunkIndex(limit)), physPageSize/scSize)
- // Extend the range down to what we have, if there's no overlap.
+
+ // We need a contiguous range, so extend the range if there's no overlap.
  if needMax < haveMin {
  needMax = haveMin
  }
  if haveMax != 0 && needMin > haveMax {
  needMin = haveMax
  }
- have := makeAddrRange(
- // Avoid a panic from indexing one past the last element.
- uintptr(unsafe.Pointer(&s.chunks[0]))+haveMin*scSize,
- uintptr(unsafe.Pointer(&s.chunks[0]))+haveMax*scSize,
- )
- need := makeAddrRange(
- // Avoid a panic from indexing one past the last element.
- uintptr(unsafe.Pointer(&s.chunks[0]))+needMin*scSize,
- uintptr(unsafe.Pointer(&s.chunks[0]))+needMax*scSize,
- )
+
+ // Avoid a panic from indexing one past the last element.
+ chunksBase := uintptr(unsafe.Pointer(&s.chunks[0]))
+ have := makeAddrRange(chunksBase+haveMin*scSize, chunksBase+haveMax*scSize)
+ need := makeAddrRange(chunksBase+needMin*scSize, chunksBase+needMax*scSize)
+
  // Subtract any overlap from rounding. We can't re-map memory because
  // it'll be zeroed.
  need = need.subtract(have)
@@ -235,10 +232,10 @@ func (s *scavengeIndex) sysGrow(base, limit uintptr, sysStat *sysMemStat) uintpt
  sysMap(unsafe.Pointer(need.base.addr()), need.size(), sysStat)
  sysUsed(unsafe.Pointer(need.base.addr()), need.size(), need.size())
  // Update the indices only after the new memory is valid.
- if haveMin == 0 || needMin < haveMin {
+ if haveMax == 0 || needMin < haveMin {
  s.min.Store(needMin)
  }
- if haveMax == 0 || needMax > haveMax {
+ if needMax > haveMax {
  s.max.Store(needMax)
  }
  }