gomap创建的源码分析

gomap创建的源码分析(1.18.2)

src/runtime/map.go中的makemap的方法中

步骤如下

1.参数校验

2.初始化map

3.生成随机种子

4.进行B的赋值

5.根据B生成底层bucket数组

源码如下:

func makemap(t *maptype, hint int, h *hmap) *hmap {

//-------------------------1.参数校验（校验是否溢出，以及是否超过最大可分配的空间）

   mem, overflow := math.MulUintptr(uintptr(hint), t.bucket.size)
   if overflow || mem > maxAlloc {
      hint = 0
   }


//--------------------------2.初始化map(当hmap为0的时候)
   // initialize Hmap
   if h == nil {
      h = new(hmap)
   }
//--------------------------3.生成随机种子(用于hash)
   h.hash0 = fastrand()


//--------------------------4.进行B的赋值(2^B*6.5应该大于count,如果count小于8直接只给一个桶，即B=0)
   // Find the size parameter B which will hold the requested # of elements.
   // For hint < 0 overLoadFactor returns false since hint < bucketCnt.
   B := uint8(0)
   for overLoadFactor(hint, B) {
      B++
   }
   h.B = B


//--------------------------5.根据B生成底层bucket数组(如果B为0，那么底层数组将会在后面赋值的时候进行allocated lazily(在赋值的时候才进行空间的申请)) 并用mapextra专门存储溢出桶的指针))

  if h.B != 0 {
      var nextOverflow *bmap
      h.buckets, nextOverflow = makeBucketArray(t, h.B, nil)
      if nextOverflow != nil {
         h.extra = new(mapextra)
         h.extra.nextOverflow = nextOverflow
      }
   }

   return h
}




//创建桶数组
func makeBucketArray(t *maptype, b uint8, dirtyalloc unsafe.Pointer) (buckets unsafe.Pointer, nextOverflow *bmap) {
   base := bucketShift(b)
   nbuckets := base

   if b >= 4 {

//---------------这里可以看到当b小于4的时候就不会有溢出桶的存在     
      nbuckets += bucketShift(b - 4)
      sz := t.bucket.size * nbuckets
      up := roundupsize(sz)
      if up != sz {
         nbuckets = up / t.bucket.size
      }
   }


   if dirtyalloc == nil {
      buckets = newarray(t.bucket, int(nbuckets))
   } else {
      // dirtyalloc was previously generated by
      // the above newarray(t.bucket, int(nbuckets))
      // but may not be empty.
      buckets = dirtyalloc
      size := t.bucket.size * nbuckets
      if t.bucket.ptrdata != 0 {
         memclrHasPointers(buckets, size)
      } else {
         memclrNoHeapPointers(buckets, size)
      }
   }



//-------------------------如果存在溢出桶(base是基础的2^B，nbuckets是基础桶的数目加上溢出桶的数目，存在溢出桶的时候，两者不相等)
   if base != nbuckets {

      nextOverflow = (*bmap)(add(buckets, base*uintptr(t.bucketsize)))
      last := (*bmap)(add(buckets, (nbuckets-1)*uintptr(t.bucketsize)))
      last.setoverflow(t, (*bmap)(buckets))
   }
   return buckets, nextOverflow
}