diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-16 19:19:13 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-16 19:19:13 +0000 |
commit | ccd992355df7192993c666236047820244914598 (patch) | |
tree | f00fea65147227b7743083c6148396f74cd66935 /test/fixedbugs/issue59411.go | |
parent | Initial commit. (diff) | |
download | golang-1.21-ccd992355df7192993c666236047820244914598.tar.xz golang-1.21-ccd992355df7192993c666236047820244914598.zip |
Adding upstream version 1.21.8.upstream/1.21.8
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to '')
-rw-r--r-- | test/fixedbugs/issue59411.go | 77 |
1 files changed, 77 insertions, 0 deletions
diff --git a/test/fixedbugs/issue59411.go b/test/fixedbugs/issue59411.go new file mode 100644 index 0000000..fc35c98 --- /dev/null +++ b/test/fixedbugs/issue59411.go @@ -0,0 +1,77 @@ +// run + +// Copyright 2023 The Go Authors. All rights reserved. +// Use of this source code is governed by a BSD-style +// license that can be found in the LICENSE file. + +package main + +import ( + "math" + "reflect" +) + +func main() { + for i := 0; i < 100; i++ { + f() + g() + } +} + +func f() { + // Allocate map. + m := map[float64]int{} + // Fill to just before a growth trigger. + const N = 13 << 4 // 6.5 * 2 * 2^k + for i := 0; i < N; i++ { + m[math.NaN()] = i + } + // Trigger growth. + m[math.NaN()] = N + + // Iterate through map. + i := 0 + for range m { + if i == 6 { + // Partway through iteration, clear the map. + clear(m) + } else if i > 6 { + // If we advance to the next iteration, that's a bug. + panic("BAD") + } + i++ + } + if len(m) != 0 { + panic("clear did not empty the map") + } +} + +func g() { + // Allocate map. + m := map[float64]int{} + // Fill to just before a growth trigger. + const N = 13 << 4 // 6.5 * 2 * 2^k + for i := 0; i < N; i++ { + m[math.NaN()] = i + } + // Trigger growth. + m[math.NaN()] = N + + // Iterate through map. + i := 0 + v := reflect.ValueOf(m) + iter := v.MapRange() + for iter.Next() { + if i == 6 { + // Partway through iteration, clear the map. + v.Clear() + } else if i > 6 { + // If we advance to the next iteration, that's a bug. + panic("BAD") + } + i++ + } + if v.Len() != 0 { + panic("clear did not empty the map") + } +} |