func math/bits.Len

11 uses

	math/bits (current package)
		bits.go#L25: func LeadingZeros(x uint) int { return UintSize - Len(x) }
		bits.go#L302: func Len(x uint) int {

	math/big
		nat.go#L665: 		return i*_W + bits.Len(top)
		natdiv.go#L733: 	recDepth := 2 * bits.Len(uint(len(v)))

	net/http
		h2_bundle.go#L8907: 	bits := bits.Len(uint(size))

	slices
		sort.go#L18: 	pdqsortOrdered(x, 0, n, bits.Len(uint(n)))
		sort.go#L32: 	pdqsortCmpFunc(x, 0, n, bits.Len(uint(n)), cmp)
		sort.go#L189: 	return 1 << bits.Len(uint(length))

	sort
		slice.go#L28: 	limit := bits.Len(uint(length))
		sort.go#L50: 	limit := bits.Len(uint(n))
		sort.go#L73: 	shift := uint(bits.Len(uint(length)))