Lines Matching refs:Buckets
10 // into an array of buckets. Each bucket contains up to
17 // extra buckets.
20 // of buckets twice as big. Buckets are incrementally
23 // Map iterators walk through the array of buckets and
34 // buckets, too small and we waste a lot of space. I wrote
48 // %overflow = percentage of buckets which have an overflow bucket
84 // Each bucket (including its overflow buckets, if any) will have either all or none of its
94 iterator = 1 // there may be an iterator using buckets
107 B uint8 // log_2 of # of buckets (can hold up to loadFactor * 2^B items)
110 buckets unsafe.Pointer // array of 2^B Buckets. may be nil if count==0.
112 nevacuate uintptr // progress counter for evacuation (buckets less than this have been evacuated)
116 // However, bmap.overflow is a pointer. In order to keep overflow buckets
117 // alive, we store pointers to all overflow buckets in hmap.overflow.
119 // overflow[0] contains overflow buckets for hmap.buckets.
120 // overflow[1] contains overflow buckets for hmap.oldbuckets.
144 buckets unsafe.Pointer // bucket ptr at hash_iter initialization time
146 overflow [2]*[]*bmap // keeps overflow buckets alive
245 // if B == 0, the buckets field is allocated lazily later (in mapassign)
247 buckets := bucket
249 buckets = newarray(t.bucket, uintptr(1)<<B)
260 h.buckets = buckets
285 b := (*bmap)(add(h.buckets, (hash&m)*uintptr(t.bucketsize)))
333 b := (*bmap)(unsafe.Pointer(uintptr(h.buckets) + (hash&m)*uintptr(t.bucketsize)))
376 b := (*bmap)(unsafe.Pointer(uintptr(h.buckets) + (hash&m)*uintptr(t.bucketsize)))
426 if h.buckets == nil {
427 h.buckets = newarray(t.bucket, 1)
435 b := (*bmap)(unsafe.Pointer(uintptr(h.buckets) + bucket*uintptr(t.bucketsize)))
486 // all current buckets are full, allocate a new one.
527 b := (*bmap)(unsafe.Pointer(uintptr(h.buckets) + bucket*uintptr(t.bucketsize)))
565 it.buckets = nil
589 it.buckets = h.buckets
592 // This preserves all relevant overflow buckets alive even if
593 // the table grows and/or overflow buckets are added to the table
652 b = (*bmap)(add(it.buckets, bucket*uintptr(t.bucketsize)))
656 b = (*bmap)(add(it.buckets, bucket*uintptr(t.bucketsize)))
678 // buckets during a grow).
760 oldbuckets := h.buckets
770 h.buckets = newbuckets
774 // Promote current overflow buckets to the old generation.
804 // TODO: reuse overflow buckets instead of using new ones, if there
805 // is no iterator using the old buckets. (If !oldIterator.)
807 x := (*bmap)(add(h.buckets, oldbucket*uintptr(t.bucketsize)))
808 y := (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.bucketsize)))
845 // these keys will get evenly distributed across all buckets
909 // Unlink the overflow buckets & clear key/value to help GC.
922 // Can discard old overflow buckets as well.
