mirror of
https://github.com/golang/go.git
synced 2025-12-08 06:10:04 +00:00
Previously the extra m needed for cgo callbacks was created on the first callback. This works for cgo, however the cgocallback mechanism is also borrowed by badsignal which can run before any cgo calls are made. Now we initialize the extra M at runtime startup before any signal handlers are registered, so badsignal cannot be called until the extra M is ready. Updates #10207. Change-Id: Iddda2c80db6dc52d8b60e2b269670fbaa704c7b3 Reviewed-on: https://go-review.googlesource.com/7978 Reviewed-by: Ian Lance Taylor <iant@golang.org> Run-TryBot: David Crawshaw <crawshaw@golang.org>
169 lines
4.4 KiB
Go
169 lines
4.4 KiB
Go
// Copyright 2009 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.
|
|
|
|
// This file implements runtime support for signal handling.
|
|
//
|
|
// Most synchronization primitives are not available from
|
|
// the signal handler (it cannot block, allocate memory, or use locks)
|
|
// so the handler communicates with a processing goroutine
|
|
// via struct sig, below.
|
|
//
|
|
// sigsend is called by the signal handler to queue a new signal.
|
|
// signal_recv is called by the Go program to receive a newly queued signal.
|
|
// Synchronization between sigsend and signal_recv is based on the sig.state
|
|
// variable. It can be in 3 states: sigIdle, sigReceiving and sigSending.
|
|
// sigReceiving means that signal_recv is blocked on sig.Note and there are no
|
|
// new pending signals.
|
|
// sigSending means that sig.mask *may* contain new pending signals,
|
|
// signal_recv can't be blocked in this state.
|
|
// sigIdle means that there are no new pending signals and signal_recv is not blocked.
|
|
// Transitions between states are done atomically with CAS.
|
|
// When signal_recv is unblocked, it resets sig.Note and rechecks sig.mask.
|
|
// If several sigsends and signal_recv execute concurrently, it can lead to
|
|
// unnecessary rechecks of sig.mask, but it cannot lead to missed signals
|
|
// nor deadlocks.
|
|
|
|
// +build !plan9
|
|
|
|
package runtime
|
|
|
|
import "unsafe"
|
|
|
|
var sig struct {
|
|
note note
|
|
mask [(_NSIG + 31) / 32]uint32
|
|
wanted [(_NSIG + 31) / 32]uint32
|
|
recv [(_NSIG + 31) / 32]uint32
|
|
state uint32
|
|
inuse bool
|
|
}
|
|
|
|
const (
|
|
sigIdle = iota
|
|
sigReceiving
|
|
sigSending
|
|
)
|
|
|
|
// Called from sighandler to send a signal back out of the signal handling thread.
|
|
// Reports whether the signal was sent. If not, the caller typically crashes the program.
|
|
func sigsend(s uint32) bool {
|
|
bit := uint32(1) << uint(s&31)
|
|
if !sig.inuse || s < 0 || int(s) >= 32*len(sig.wanted) || sig.wanted[s/32]&bit == 0 {
|
|
return false
|
|
}
|
|
|
|
// Add signal to outgoing queue.
|
|
for {
|
|
mask := sig.mask[s/32]
|
|
if mask&bit != 0 {
|
|
return true // signal already in queue
|
|
}
|
|
if cas(&sig.mask[s/32], mask, mask|bit) {
|
|
break
|
|
}
|
|
}
|
|
|
|
// Notify receiver that queue has new bit.
|
|
Send:
|
|
for {
|
|
switch atomicload(&sig.state) {
|
|
default:
|
|
throw("sigsend: inconsistent state")
|
|
case sigIdle:
|
|
if cas(&sig.state, sigIdle, sigSending) {
|
|
break Send
|
|
}
|
|
case sigSending:
|
|
// notification already pending
|
|
break Send
|
|
case sigReceiving:
|
|
if cas(&sig.state, sigReceiving, sigIdle) {
|
|
notewakeup(&sig.note)
|
|
break Send
|
|
}
|
|
}
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
// Called to receive the next queued signal.
|
|
// Must only be called from a single goroutine at a time.
|
|
func signal_recv() uint32 {
|
|
for {
|
|
// Serve any signals from local copy.
|
|
for i := uint32(0); i < _NSIG; i++ {
|
|
if sig.recv[i/32]&(1<<(i&31)) != 0 {
|
|
sig.recv[i/32] &^= 1 << (i & 31)
|
|
return i
|
|
}
|
|
}
|
|
|
|
// Wait for updates to be available from signal sender.
|
|
Receive:
|
|
for {
|
|
switch atomicload(&sig.state) {
|
|
default:
|
|
throw("signal_recv: inconsistent state")
|
|
case sigIdle:
|
|
if cas(&sig.state, sigIdle, sigReceiving) {
|
|
notetsleepg(&sig.note, -1)
|
|
noteclear(&sig.note)
|
|
break Receive
|
|
}
|
|
case sigSending:
|
|
if cas(&sig.state, sigSending, sigIdle) {
|
|
break Receive
|
|
}
|
|
}
|
|
}
|
|
|
|
// Incorporate updates from sender into local copy.
|
|
for i := range sig.mask {
|
|
sig.recv[i] = xchg(&sig.mask[i], 0)
|
|
}
|
|
}
|
|
}
|
|
|
|
// Must only be called from a single goroutine at a time.
|
|
func signal_enable(s uint32) {
|
|
if !sig.inuse {
|
|
// The first call to signal_enable is for us
|
|
// to use for initialization. It does not pass
|
|
// signal information in m.
|
|
sig.inuse = true // enable reception of signals; cannot disable
|
|
noteclear(&sig.note)
|
|
return
|
|
}
|
|
|
|
if int(s) >= len(sig.wanted)*32 {
|
|
return
|
|
}
|
|
sig.wanted[s/32] |= 1 << (s & 31)
|
|
sigenable(s)
|
|
}
|
|
|
|
// Must only be called from a single goroutine at a time.
|
|
func signal_disable(s uint32) {
|
|
if int(s) >= len(sig.wanted)*32 {
|
|
return
|
|
}
|
|
sig.wanted[s/32] &^= 1 << (s & 31)
|
|
sigdisable(s)
|
|
}
|
|
|
|
// Must only be called from a single goroutine at a time.
|
|
func signal_ignore(s uint32) {
|
|
if int(s) >= len(sig.wanted)*32 {
|
|
return
|
|
}
|
|
sig.wanted[s/32] &^= 1 << (s & 31)
|
|
sigignore(s)
|
|
}
|
|
|
|
// This runs on a foreign stack, without an m or a g. No stack split.
|
|
//go:nosplit
|
|
func badsignal(sig uintptr) {
|
|
cgocallback(unsafe.Pointer(funcPC(sigsend)), noescape(unsafe.Pointer(&sig)), unsafe.Sizeof(sig))
|
|
}
|