runtime.p.deferpool (field)

29 uses

	runtime (current package)
		panic.go#L343: 	var m [len(p{}.deferpool)]int32
		panic.go#L396: 	if sc < uintptr(len(p{}.deferpool)) {
		panic.go#L398: 		if len(pp.deferpool[sc]) == 0 && sched.deferpool[sc] != nil {
		panic.go#L403: 				for len(pp.deferpool[sc]) < cap(pp.deferpool[sc])/2 && sched.deferpool[sc] != nil {
		panic.go#L407: 					pp.deferpool[sc] = append(pp.deferpool[sc], d)
		panic.go#L412: 		if n := len(pp.deferpool[sc]); n > 0 {
		panic.go#L413: 			d = pp.deferpool[sc][n-1]
		panic.go#L414: 			pp.deferpool[sc][n-1] = nil
		panic.go#L415: 			pp.deferpool[sc] = pp.deferpool[sc][:n-1]
		panic.go#L448: 	if sc >= uintptr(len(p{}.deferpool)) {
		panic.go#L452: 	if len(pp.deferpool[sc]) == cap(pp.deferpool[sc]) {
		panic.go#L459: 			for len(pp.deferpool[sc]) > cap(pp.deferpool[sc])/2 {
		panic.go#L460: 				n := len(pp.deferpool[sc])
		panic.go#L461: 				d := pp.deferpool[sc][n-1]
		panic.go#L462: 				pp.deferpool[sc][n-1] = nil
		panic.go#L463: 				pp.deferpool[sc] = pp.deferpool[sc][:n-1]
		panic.go#L493: 	pp.deferpool[sc] = append(pp.deferpool[sc], d)
		proc.go#L4645: 	for i := range pp.deferpool {
		proc.go#L4646: 		pp.deferpool[i] = pp.deferpoolbuf[i][:0]
		proc.go#L4725: 	for i := range pp.deferpool {
		proc.go#L4729: 		pp.deferpool[i] = pp.deferpoolbuf[i][:0]
		runtime2.go#L588: 	deferpool    [5][]*_defer // pool of available defer structs of different sizes (see panic.go)