s.values[v.ID].regs |= regMask(1) << r
	s.used |= regMask(1) << r
	s.f.setHome(c, &s.registers[r])
}

// allocReg chooses a register from the set of registers in mask.
// If there is no unused register, a Value will be kicked out of
// a register to make room.
func (s *regAllocState) allocReg(mask regMask, v *Value) register {
	if v.OnWasmStack {
		return noRegister
	}

	mask &= s.allocatable

	return eachListItem(obj, fn, true)
}

// allocNew: Whether shallow copy is required when the elements in Object.Items are struct
func eachListItem(obj runtime.Object, fn func(runtime.Object) error, allocNew bool) error {
	if unstructured, ok := obj.(runtime.Unstructured); ok {
		if allocNew {
			return unstructured.EachListItemWithAlloc(fn)
		}
		return unstructured.EachListItem(fn)
	}

		log.Fatal(err)
	}

	// checkExecutionTimes relies on this.
	var wg sync.WaitGroup
	wg.Add(2)
	go cpu10(&wg)
	go cpu20(&wg)
	wg.Wait()

	// checkHeapMetrics relies on this.
	allocHog(25 * time.Millisecond)

	// checkProcStartStop relies on this.
	var wg2 sync.WaitGroup
	for i := 0; i < runtime.GOMAXPROCS(0); i++ {
		wg2.Add(1)
		go func() {
			defer wg2.Done()
			cpuHog(50 * time.Millisecond)

// dirtyalloc should either be nil or a bucket array previously
// allocated by makeBucketArray with the same t and b parameters.
// If dirtyalloc is nil a new backing array will be alloced and
// otherwise dirtyalloc will be cleared and reused as backing array.
func makeBucketArray(t *maptype, b uint8, dirtyalloc unsafe.Pointer) (buckets unsafe.Pointer, nextOverflow *bmap) {
	base := bucketShift(b)

String id=59
	data="main.blockingSyscall"
String id=60
	data="time.Sleep"
String id=61
	data="/usr/local/google/home/mknyszek/work/go-1/src/runtime/time.go"
String id=62
	data="main.allocHog"
String id=63
	data="main.cpu10"
String id=64
	data="runtime.goparkunlock"
String id=65
	data="/usr/local/google/home/mknyszek/work/go-1/src/runtime/proc.go"
String id=66
	data="runtime.bgsweep"