blob: 90aed83d46a52ed086f9afdf2a7e756ede7dc9e5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
// Copyright 2016 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.
// Proc unit tests. In runtime package so can use runtime guts.
package runtime
func RunStealOrderTest() {
var ord randomOrder
for procs := 1; procs <= 64; procs++ {
ord.reset(uint32(procs))
if procs >= 3 && len(ord.coprimes) < 2 {
panic("too few coprimes")
}
for co := 0; co < len(ord.coprimes); co++ {
enum := ord.start(uint32(co))
checked := make([]bool, procs)
for p := 0; p < procs; p++ {
x := enum.position()
if checked[x] {
println("procs:", procs, "inc:", enum.inc)
panic("duplicate during enumeration")
}
checked[x] = true
enum.next()
}
if !enum.done() {
panic("not done")
}
}
}
// Make sure that different arguments to ord.start don't generate the
// same pos+inc twice.
for procs := 2; procs <= 64; procs++ {
ord.reset(uint32(procs))
checked := make([]bool, procs*procs)
// We want at least procs*len(ord.coprimes) different pos+inc values
// before we start repeating.
for i := 0; i < procs*len(ord.coprimes); i++ {
enum := ord.start(uint32(i))
j := enum.pos*uint32(procs) + enum.inc
if checked[j] {
println("procs:", procs, "pos:", enum.pos, "inc:", enum.inc)
panic("duplicate pos+inc during enumeration")
}
checked[j] = true
}
}
}
|
