runtime.sudog.next (field)

50 uses

	runtime (current package)
		chan.go#L775: 	sgp.next = nil
		chan.go#L784: 	x.next = sgp
		chan.go#L794: 		y := sgp.next
		chan.go#L801: 			sgp.next = nil // mark as removed (see dequeueSudog)
		mgc.go#L2277: 		sgnext = sg.next
		mgc.go#L2278: 		sg.next = nil
		proc.go#L368: 			sched.sudogcache = s.next
		proc.go#L369: 			s.next = nil
		proc.go#L397: 	if s.next != nil {
		proc.go#L426: 				last.next = p
		proc.go#L431: 		last.next = sched.sudogcache
		runtime2.go#L352: 	next *sudog
		select.go#L586: 	y := sgp.next
		select.go#L590: 			x.next = y
		select.go#L592: 			sgp.next = nil
		select.go#L597: 		x.next = nil
		select.go#L606: 		sgp.next = nil
		sema.go#L237: 	s.next = nil
		sema.go#L252: 				s.next = t.next
		sema.go#L256: 				if s.next != nil {
		sema.go#L257: 					s.next.parent = s
		sema.go#L267: 				t.next = nil
		sema.go#L285: 			pt = &t.next
		sema.go#L309: 			if s.parent.next != s {
		sema.go#L331: 			ps = &s.next
		sema.go#L350: 		t.next = s.next
		sema.go#L351: 		if t.next != nil {
		sema.go#L352: 			t.next.parent = t
		sema.go#L364: 		for s.next != nil || s.prev != nil {
		sema.go#L365: 			if s.next == nil || s.prev != nil && s.prev.ticket < s.next.ticket {
		sema.go#L376: 				s.parent.next = nil
		sema.go#L384: 	s.next = nil
		sema.go#L395: 	y := x.next
		sema.go#L400: 	x.next = b
		sema.go#L411: 		if p.next != x {
		sema.go#L414: 		p.next = y
		sema.go#L424: 	b := x.next
		sema.go#L426: 	x.next = y
		sema.go#L439: 		if p.next != y {
		sema.go#L442: 		p.next = x
		sema.go#L510: 		l.tail.next = s
		sema.go#L545: 		next := s.next
		sema.go#L546: 		s.next = nil
		sema.go#L586: 	for p, s := (*sudog)(nil), l.head; s != nil; p, s = s, s.next {
		sema.go#L588: 			n := s.next
		sema.go#L590: 				p.next = n
		sema.go#L598: 			s.next = nil