type Mutex struct {
  // 互斥鎖的狀態(tài)，比如是否被鎖定
  state int32
  // 表示信號(hào)量。堵塞的協(xié)程會(huì)等待該信號(hào)量，解鎖的協(xié)程會(huì)釋放該信號(hào)量
  sema int32
}

const (
? // 當(dāng)前是否已經(jīng)上鎖
? mutexLocked = 1 << iota // 1
? // 當(dāng)前是否有喚醒的goroutine
? mutexWoken // 2
? // 當(dāng)前是否為饑餓狀態(tài)
? mutexStarving // 4
? // state >> mutexWaiterShift 得到等待者數(shù)量
? mutexWaiterShift = iota // 3

? starvationThresholdNs = 1e6 // 判斷是否要進(jìn)入饑餓狀態(tài)的閾值
)

func (m *Mutex) Lock() {
    // 快路徑。直接獲取未鎖的mutex
  // 初始狀態(tài)為0，所以只要狀態(tài)存在其他任何狀態(tài)位都是無(wú)法直接獲取的
    if atomic.CompareAndSwapInt32(&m.state, 0, mutexLocked) {
        if race.Enabled {
            race.Acquire(unsafe.Pointer(m))
        }
        return
    }
    // Slow path (outlined so that the fast path can be inlined)
    m.lockSlow()
}

        // 只要原狀態(tài)已鎖且不處于饑餓狀態(tài)，并滿(mǎn)足自旋條件
        if old&(mutexLocked|mutexStarving) == mutexLocked && runtime_canSpin(iter) {
            // 在當(dāng)前goroutine沒(méi)有喚醒，且沒(méi)有其他goroutine在嘗試喚醒，且存在等待的情況下，cas標(biāo)記存在goroutine正在嘗試喚醒。若標(biāo)記成功就設(shè)置當(dāng)前goroutine已經(jīng)喚醒了
            if !awoke && old&mutexWoken == 0 && old>>mutexWaiterShift != 0 &&
                atomic.CompareAndSwapInt32(&m.state, old, old|mutexWoken) {
                awoke = true
            }
      // 自旋
            runtime_doSpin()
      // 自旋次數(shù)加一
            iter++
      // 更新原狀態(tài)
            old = m.state
            continue
        }

const (
?? ?locked uintptr = 1

?? ?active_spin ? ? = 4
?? ?active_spin_cnt = 30
?? ?passive_spin ? ?= 1
)

func sync_runtime_canSpin(i int) bool {
?? ?// sync.Mutex is cooperative, so we are conservative with spinning.
?? ?// Spin only few times and only if running on a multicore machine and
?? ?// GOMAXPROCS>1 and there is at least one other running P and local runq is empty.
?? ?// As opposed to runtime mutex we don't do passive spinning here,
?? ?// because there can be work on global runq or on other Ps.
?? ?if i >= active_spin || ncpu <= 1 || gomaxprocs <= int32(sched.npidle+sched.nmspinning)+1 {
?? ??? ?return false
?? ?}
?? ?if p := getg().m.p.ptr(); !runqempty(p) {
?? ??? ?return false
?? ?}
?? ?return true
}

# 定義了一個(gè)runtime.procyield的文本段,通過(guò)NOSPLIT不使用棧分裂,$0-0 表示該函數(shù)不需要任何輸入?yún)?shù)和返回值
TEXT runtime·procyield(SB),NOSPLIT,$0-0
    # 從棧幀中讀取cycles參賽值，并儲(chǔ)存在寄存器R0中
    MOVWU    cycles+0(FP), R0
# 組成無(wú)限循環(huán)。在每次循環(huán)中，通過(guò)YIELD告訴CPU將當(dāng)前線(xiàn)程置于休眠狀態(tài)
# YIELD: x86上，實(shí)現(xiàn)為PAUSE指令，會(huì)暫停處理器執(zhí)行，切換CPU到低功耗模式并等待更多數(shù)據(jù)到達(dá)。通常用于忙等待機(jī)制，避免無(wú)謂CPU占用
# ARM上，實(shí)現(xiàn)為WFE(Wait For Event)，用于等待中斷或者其他事件發(fā)生。在某些情況下可能會(huì)導(dǎo)致CPU陷入死循環(huán)，因此需要特殊處理邏輯解決
again:
    YIELD
    # 將R0值減1
    SUBW    $1, R0
    # CBNZ(Compare and Branch on Non-Zero)檢查剩余的時(shí)鐘周期數(shù)是否為0。不為0就跳轉(zhuǎn)到標(biāo)簽again并再次調(diào)用YIELD，否則就退出函數(shù)
    CBNZ    R0, again
    RET

const active_spin_cnt = 30

func sync_runtime_doSpin() {
?? ?procyield(active_spin_cnt)
}

        new := old
        // Don't try to acquire starving mutex, new arriving goroutines must queue.
    // 若原狀態(tài)不處于饑餓狀態(tài)，就給新?tīng)顟B(tài)設(shè)置已加鎖
        if old&mutexStarving == 0 {
            new |= mutexLocked
        }
    // 只要原狀態(tài)處于已鎖或者饑餓模式，就將新?tīng)顟B(tài)等待數(shù)量遞增
        if old&(mutexLocked|mutexStarving) != 0 {
            new += 1 << mutexWaiterShift
        }
    // 若已經(jīng)等待超過(guò)饑餓閾值時(shí)間且原狀態(tài)已鎖，就設(shè)置新?tīng)顟B(tài)為饑餓
    // 這也意味著如果已經(jīng)不處于已鎖狀態(tài)，就可以切換回正常模式了
        if starving && old&mutexLocked != 0 {
            new |= mutexStarving
        }
    // 如果已經(jīng)喚醒了（也就是沒(méi)有其他正在搶占的goroutine），則在新?tīng)顟B(tài)中清除正在喚醒狀態(tài)位
        if awoke {
            // The goroutine has been woken from sleep,
            // so we need to reset the flag in either case.
            if new&mutexWoken == 0 {
                throw("sync: inconsistent mutex state")
            }
            new &^= mutexWoken
        }

if atomic.CompareAndSwapInt32(&m.state, old, new) {
      // 如果原狀態(tài)既沒(méi)有處于已鎖狀態(tài)，也沒(méi)有處于饑餓模式
      // 那么就表示已經(jīng)獲取到鎖，直接退出
            if old&(mutexLocked|mutexStarving) == 0 {
                break // locked the mutex with CAS
            }
      // 若已經(jīng)在等待了，就排到隊(duì)列頭
            queueLifo := waitStartTime != 0
            if waitStartTime == 0 {
                waitStartTime = runtime_nanotime()
            }
      // 嘗試獲取信號(hào)量。此處獲取一個(gè)信號(hào)量以實(shí)現(xiàn)互斥
      // 此處會(huì)進(jìn)行堵塞
            runtime_SemacquireMutex(&m.sema, queueLifo, 1)
      // 被信號(hào)量喚醒之后，發(fā)現(xiàn)若等待時(shí)間超過(guò)饑餓閾值，就切換到饑餓模式
            starving = starving || runtime_nanotime()-waitStartTime > starvationThresholdNs
            old = m.state
      // 處于饑餓模式下
            if old&mutexStarving != 0 {
                // If this goroutine was woken and mutex is in starvation mode,
                // ownership was handed off to us but mutex is in somewhat
                // inconsistent state: mutexLocked is not set and we are still
                // accounted as waiter. Fix that.
        // 若既沒(méi)有已鎖且正在嘗試喚醒，或者等待隊(duì)列為空，就代表產(chǎn)生了不一致的狀態(tài)
                if old&(mutexLocked|mutexWoken) != 0 || old>>mutexWaiterShift == 0 {
                    throw("sync: inconsistent mutex state")
                }
        // 當(dāng)前goroutine已經(jīng)獲取鎖，等待隊(duì)列減1；若等待者就一個(gè)，就切換正常模式。退出
                delta := int32(mutexLocked - 1<<mutexWaiterShift)
                if !starving || old>>mutexWaiterShift == 1 {
                    delta -= mutexStarving
                }
                atomic.AddInt32(&m.state, delta)
                break
            }
      // 不處于饑餓模式下，設(shè)置當(dāng)前goroutine為喚醒狀態(tài)，重置自璇次數(shù)，繼續(xù)嘗試獲取鎖
            awoke = true
            iter = 0
        } else {
      // 若鎖被其他goroutine占用了，就更新原狀態(tài)，繼續(xù)嘗試獲取鎖
            old = m.state
        }

func (m *Mutex) Unlock() {
    // Fast path: drop lock bit.
    new := atomic.AddInt32(&m.state, -mutexLocked)
    if new != 0 {
        // Outlined slow path to allow inlining the fast path.
        // To hide unlockSlow during tracing we skip one extra frame when tracing GoUnblock.
        m.unlockSlow(new)
    }
}

func (m *Mutex) unlockSlow(new int32) {
  // 若原狀態(tài)根本沒(méi)有已鎖狀態(tài)位
    if (new+mutexLocked)&mutexLocked == 0 {
        throw("sync: unlock of unlocked mutex")
    }
  // 若原狀態(tài)不處于饑餓狀態(tài)
    if new&mutexStarving == 0 {
        old := new
        for {
      // 若沒(méi)有等待，或者存在goroutine已經(jīng)被喚醒，或者已經(jīng)被鎖住了，就不需要喚醒任何人，返回
            if old>>mutexWaiterShift == 0 || old&(mutexLocked|mutexWoken|mutexStarving) != 0 {
                return
            }
            // Grab the right to wake someone.
      // 設(shè)置期望狀態(tài)為正在獲取狀態(tài)位，并減去一個(gè)等待者
            new = (old - 1<<mutexWaiterShift) | mutexWoken
      // 嘗試cas更新為期望新?tīng)顟B(tài)，若成功就釋放信號(hào)量，失敗就更新原狀態(tài)，進(jìn)行下一輪釋放
      // 失敗說(shuō)明在這過(guò)程中又有g(shù)oroutine在嘗試獲取，比如已經(jīng)獲取到了、變成饑餓了、自旋等
            if atomic.CompareAndSwapInt32(&m.state, old, new) {
                runtime_Semrelease(&m.sema, false, 1)
                return
            }
            old = m.state
        }
    } else {
    // 饑餓模式下就移交鎖所有權(quán)給下一個(gè)等待者，并放棄時(shí)間片，以便該等待者可以快速開(kāi)始
        runtime_Semrelease(&m.sema, true, 1)
    }
}