}
sched.procresizetime = now
- maskWords := (nprocs + 31) / 32
-
// Grow allp if necessary.
if nprocs > int32(len(allp)) {
// Synchronize with retake, which could be running
allp = nallp
}
- if maskWords <= int32(cap(idlepMask)) {
- idlepMask = idlepMask[:maskWords]
- timerpMask = timerpMask[:maskWords]
- } else {
- nidlepMask := make([]uint32, maskWords)
- // No need to copy beyond len, old Ps are irrelevant.
- copy(nidlepMask, idlepMask)
- idlepMask = nidlepMask
-
- ntimerpMask := make([]uint32, maskWords)
- copy(ntimerpMask, timerpMask)
- timerpMask = ntimerpMask
- }
+ idlepMask = idlepMask.resize(nprocs)
+ timerpMask = timerpMask.resize(nprocs)
unlock(&allpLock)
}
if int32(len(allp)) != nprocs {
lock(&allpLock)
allp = allp[:nprocs]
- idlepMask = idlepMask[:maskWords]
- timerpMask = timerpMask[:maskWords]
+ idlepMask = idlepMask.resize(nprocs)
+ timerpMask = timerpMask.resize(nprocs)
unlock(&allpLock)
}
atomic.And(&p[word], ^mask)
}
+// resize resizes the pMask and returns a new one.
+//
+// The result may alias p, so callers are encouraged to
+// discard p. Not safe for concurrent use.
+func (p pMask) resize(nprocs int32) pMask {
+ maskWords := (nprocs + 31) / 32
+
+ if maskWords <= int32(cap(p)) {
+ return p[:maskWords]
+ }
+ newMask := make([]uint32, maskWords)
+ // No need to copy beyond len, old Ps are irrelevant.
+ copy(newMask, p)
+ return newMask
+}
+
// pidleput puts p on the _Pidle list. now must be a relatively recent call
// to nanotime or zero. Returns now or the current time if now was zero.
//