| // Copyright 2024 The Go Authors. All rights reserved. | |
| // Use of this source code is governed by a BSD-style | |
| // license that can be found in the LICENSE file. | |
| //go:build linux && (amd64 || arm64 || arm64be || ppc64 || ppc64le || loong64 || s390x) | |
| package runtime | |
| import ( | |
| "internal/cpu" | |
| "internal/goexperiment" | |
| "unsafe" | |
| ) | |
| //go:noescape | |
| func vgetrandom1(buf *byte, length uintptr, flags uint32, state uintptr, stateSize uintptr) int | |
| var vgetrandomAlloc struct { | |
| states []uintptr | |
| statesLock mutex | |
| stateSize uintptr | |
| mmapProt int32 | |
| mmapFlags int32 | |
| } | |
| func vgetrandomInit() { | |
| if vdsoGetrandomSym == 0 { | |
| return | |
| } | |
| var params struct { | |
| SizeOfOpaqueState uint32 | |
| MmapProt uint32 | |
| MmapFlags uint32 | |
| reserved [13]uint32 | |
| } | |
| if vgetrandom1(nil, 0, 0, uintptr(unsafe.Pointer(¶ms)), ^uintptr(0)) != 0 { | |
| return | |
| } | |
| vgetrandomAlloc.stateSize = uintptr(params.SizeOfOpaqueState) | |
| vgetrandomAlloc.mmapProt = int32(params.MmapProt) | |
| vgetrandomAlloc.mmapFlags = int32(params.MmapFlags) | |
| lockInit(&vgetrandomAlloc.statesLock, lockRankVgetrandom) | |
| } | |
| func vgetrandomGetState() uintptr { | |
| lock(&vgetrandomAlloc.statesLock) | |
| if len(vgetrandomAlloc.states) == 0 { | |
| num := uintptr(numCPUStartup) // Just a reasonable size hint to start. | |
| stateSizeCacheAligned := (vgetrandomAlloc.stateSize + cpu.CacheLineSize - 1) &^ (cpu.CacheLineSize - 1) | |
| allocSize := (num*stateSizeCacheAligned + physPageSize - 1) &^ (physPageSize - 1) | |
| num = (physPageSize / stateSizeCacheAligned) * (allocSize / physPageSize) | |
| p, err := mmap(nil, allocSize, vgetrandomAlloc.mmapProt, vgetrandomAlloc.mmapFlags, -1, 0) | |
| if err != 0 { | |
| unlock(&vgetrandomAlloc.statesLock) | |
| return 0 | |
| } | |
| setVMAName(p, allocSize, "getrandom states") | |
| newBlock := uintptr(p) | |
| if vgetrandomAlloc.states == nil { | |
| vgetrandomAlloc.states = make([]uintptr, 0, num) | |
| } | |
| for i := uintptr(0); i < num; i++ { | |
| if (newBlock&(physPageSize-1))+vgetrandomAlloc.stateSize > physPageSize { | |
| newBlock = (newBlock + physPageSize - 1) &^ (physPageSize - 1) | |
| } | |
| vgetrandomAlloc.states = append(vgetrandomAlloc.states, newBlock) | |
| newBlock += stateSizeCacheAligned | |
| } | |
| } | |
| state := vgetrandomAlloc.states[len(vgetrandomAlloc.states)-1] | |
| vgetrandomAlloc.states = vgetrandomAlloc.states[:len(vgetrandomAlloc.states)-1] | |
| unlock(&vgetrandomAlloc.statesLock) | |
| return state | |
| } | |
| // Free vgetrandom state from the M (if any) prior to destroying the M. | |
| // | |
| // This may allocate, so it must have a P. | |
| func vgetrandomDestroy(mp *m) { | |
| if mp.vgetrandomState == 0 { | |
| return | |
| } | |
| lock(&vgetrandomAlloc.statesLock) | |
| vgetrandomAlloc.states = append(vgetrandomAlloc.states, mp.vgetrandomState) | |
| unlock(&vgetrandomAlloc.statesLock) | |
| } | |
| // This is exported for use in internal/syscall/unix as well as x/sys/unix. | |
| // | |
| //go:linkname vgetrandom | |
| func vgetrandom(p []byte, flags uint32) (ret int, supported bool) { | |
| if vgetrandomAlloc.stateSize == 0 { | |
| return -1, false | |
| } | |
| // vDSO code may spill registers to the stack | |
| // Make sure they're zeroed if we're running in secret mode | |
| gp := getg() | |
| if goexperiment.RuntimeSecret && gp.secret > 0 { | |
| secretEraseRegisters() | |
| } | |
| // We use getg().m instead of acquirem() here, because always taking | |
| // the lock is slightly more expensive than not always taking the lock. | |
| // However, we *do* require that m doesn't migrate elsewhere during the | |
| // execution of the vDSO. So, we exploit two details: | |
| // 1) Asynchronous preemption is aborted when PC is in the runtime. | |
| // 2) Most of the time, this function only calls vgetrandom1(), which | |
| // does not have a preamble that synchronously preempts. | |
| // We do need to take the lock when getting a new state for m, but this | |
| // is very much the slow path, in the sense that it only ever happens | |
| // once over the entire lifetime of an m. So, a simple getg().m suffices. | |
| mp := getg().m | |
| if mp.vgetrandomState == 0 { | |
| mp.locks++ | |
| state := vgetrandomGetState() | |
| mp.locks-- | |
| if state == 0 { | |
| return -1, false | |
| } | |
| mp.vgetrandomState = state | |
| } | |
| return vgetrandom1(unsafe.SliceData(p), uintptr(len(p)), flags, mp.vgetrandomState, vgetrandomAlloc.stateSize), true | |
| } |