type Pool struct {
    // GMP中，每一個(gè)P(協(xié)程調(diào)度器)會(huì)有一個(gè)數(shù)組，數(shù)組大小位localSize. 
 local     unsafe.Pointer 
 // p 數(shù)組大小.
 localSize uintptr
 New func() any
}

// poolLocal 每個(gè)P(協(xié)程調(diào)度器)的本地pool.
type poolLocal struct {
 poolLocalInternal
    // 保證一個(gè)poolLocal占用一個(gè)緩存行
 pad [128 - unsafe.Sizeof(poolLocalInternal{})%128]byte
}

type poolLocalInternal struct {
 private any       // Can be used only by the respective P. 16
 shared  poolChain // Local P can pushHead/popHead; any P can popTail. 8
}

type poolChain struct {
 head *poolChainElt
 tail *poolChainElt
}

type poolChainElt struct {
 poolDequeue
 next, prev *poolChainElt
}

type poolDequeue struct {
 // head 高32位，tail低32位.
 headTail uint64
 vals []eface
}

// 存儲(chǔ)具體的value. 
type eface struct {
 typ, val unsafe.Pointer
}

func (p *Pool) pin() (*poolLocal, int) {
 // 返回運(yùn)行當(dāng)前協(xié)程的P(協(xié)程調(diào)度器),并且設(shè)置禁止搶占.
 pid := runtime_procPin()
 s := runtime_LoadAcquintptr(&p.localSize) // load-acquire
 l := p.local                              // load-consume
 // pid < 核心數(shù). 默認(rèn)走該邏輯.
 if uintptr(pid) < s {
  return indexLocal(l, pid), pid
 }
 // 設(shè)置的P大于本機(jī)CPU核心數(shù).
 return p.pinSlow()
}

// indexLocal 獲取當(dāng)前P的poolLocal指針. 
func indexLocal(l unsafe.Pointer, i int) *poolLocal {
 // l p.local指針開(kāi)始位置.
 // 我猜測(cè)這里如果l為空，編譯階段會(huì)進(jìn)行優(yōu)化. 
 lp := unsafe.Pointer(uintptr(l) + uintptr(i)*unsafe.Sizeof(poolLocal{}))
 // uintptr真實(shí)的指針.
 // unsafe.Pointer Go對(duì)指針的封裝: 用于指針和結(jié)構(gòu)體互相轉(zhuǎn)化.
 return (*poolLocal)(lp)
}

func (c *poolChain) pushHead(val any) {
 d := c.head
    // 初始化. 
 if d == nil {
  // Initialize the chain.
  const initSize = 8 // Must be a power of 2
  d = new(poolChainElt)
  d.vals = make([]eface, initSize)
  c.head = d
  // 將新構(gòu)建的d賦值給tail.
  storePoolChainElt(&c.tail, d)
 }
 // 入隊(duì).
 if d.pushHead(val) {
  return
 }
 // 隊(duì)列滿(mǎn)了.
 newSize := len(d.vals) * 2
 if newSize >= dequeueLimit {
        // 隊(duì)列大小默認(rèn)為2的30次方. 
  newSize = dequeueLimit
 }

    // 賦值鏈表前后節(jié)點(diǎn)關(guān)系. 
 // prev.
 // d2.prev=d1.
 // d1.next=d2.
 d2 := &poolChainElt{prev: d}
 d2.vals = make([]eface, newSize)
 c.head = d2
 // next .
 storePoolChainElt(&d.next, d2)
 d2.pushHead(val)
}

// 入隊(duì)poolDequeue
func (d *poolDequeue) pushHead(val any) bool {
 ptrs := atomic.LoadUint64(&d.headTail)
 head, tail := d.unpack(ptrs)
 // head 表示當(dāng)前有多少元素.
 if (tail+uint32(len(d.vals)))&(1<<dequeueBits-1) == head {
  return false
 }
 // 環(huán)型隊(duì)列. head&uint32(len(d.vals)-1) 表示當(dāng)前元素落的位置一定在隊(duì)列上.
 slot := &d.vals[head&uint32(len(d.vals)-1)]

 typ := atomic.LoadPointer(&slot.typ)
 if typ != nil {
  return false
 }

 // The head slot is free, so we own it.
 if val == nil {
  val = dequeueNil(nil)
 }
    // 向slot寫(xiě)入指針類(lèi)型為*any，并且值為val.
 *(*any)(unsafe.Pointer(slot)) = val
    // headTail高32位++
 atomic.AddUint64(&d.headTail, 1<<dequeueBits)
 return true
}