Lines Matching full:there
39 2. signal masks are per-thread (there's no notion of a process-wide
48 window it will cause havok (I think there's still one instance of this
54 particular thread; there's no such thing as a broadcast signal.)
82 this is that there's no general atomic
98 BUT, there's another complexity: because the Unix signal mechanism has
106 To handle this case, there's a small per-thread signal queue set up to
112 *all* signals blocked, so there's no risk of two concurrent async signal
119 There are two mechanisms to prevent disaster if multiple threads get
122 block all signals, so there's no risk of a new signal being delivered to
145 The main function for this is VG_(deliver_signal). There are three cases:
161 Terminate always kills the entire process; there's no such thing as a
171 that there's a signal frame on the stack, and the instruction pointer is
172 pointing to the handler. The fiddly bit is that there are two
174 the exact shape of these frames on stack is abstracted, there are real
181 Signal return is also interesting. There are two syscalls, sigreturn
187 pending signals after the old frame has been cleaned up, since there's a
216 I hope that helps clarify things. And explain why there's so much stuff
217 in there: it's tracking a very complex and arcane underlying set of
258 > there is a notion of 'thread group'. I further understand that if
