mirror of
https://github.com/team-infusion-developers/android_kernel_samsung_msm8976.git
synced 2024-11-07 04:09:21 +00:00
Prioritize synchronous signals over 'normal' signals
This makes sure that we pick the synchronous signals caused by a processor fault over any pending regular asynchronous signals sent to use by [t]kill(). This is not strictly required semantics, but it makes it _much_ easier for programs like Wine that expect to find the fault information in the signal stack. Without this, if a non-synchronous signal gets picked first, the delayed asynchronous signal will have its signal context pointing to the new signal invocation, rather than the instruction that caused the SIGSEGV or SIGBUS in the first place. This is not all that pretty, and we're discussing making the synchronous signals more explicit rather than have these kinds of implicit preferences of SIGSEGV and friends. See for example http://bugzilla.kernel.org/show_bug.cgi?id=15395 for some of the discussion. But in the meantime this is a simple and fairly straightforward work-around, and the whole if (x & Y) x &= Y; thing can be compiled into (and gcc does do it) just three instructions: movq %rdx, %rax andl $Y, %eax cmovne %rax, %rdx so it is at least a simple solution to a subtle issue. Reported-and-tested-by: Pavel Vilim <wylda@volny.cz> Acked-by: Oleg Nesterov <oleg@redhat.com> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
parent
eaa5eec739
commit
a27341cd5f
1 changed files with 32 additions and 15 deletions
|
@ -159,6 +159,10 @@ void recalc_sigpending(void)
|
|||
|
||||
/* Given the mask, find the first available signal that should be serviced. */
|
||||
|
||||
#define SYNCHRONOUS_MASK \
|
||||
(sigmask(SIGSEGV) | sigmask(SIGBUS) | sigmask(SIGILL) | \
|
||||
sigmask(SIGTRAP) | sigmask(SIGFPE))
|
||||
|
||||
int next_signal(struct sigpending *pending, sigset_t *mask)
|
||||
{
|
||||
unsigned long i, *s, *m, x;
|
||||
|
@ -166,26 +170,39 @@ int next_signal(struct sigpending *pending, sigset_t *mask)
|
|||
|
||||
s = pending->signal.sig;
|
||||
m = mask->sig;
|
||||
|
||||
/*
|
||||
* Handle the first word specially: it contains the
|
||||
* synchronous signals that need to be dequeued first.
|
||||
*/
|
||||
x = *s &~ *m;
|
||||
if (x) {
|
||||
if (x & SYNCHRONOUS_MASK)
|
||||
x &= SYNCHRONOUS_MASK;
|
||||
sig = ffz(~x) + 1;
|
||||
return sig;
|
||||
}
|
||||
|
||||
switch (_NSIG_WORDS) {
|
||||
default:
|
||||
for (i = 0; i < _NSIG_WORDS; ++i, ++s, ++m)
|
||||
if ((x = *s &~ *m) != 0) {
|
||||
sig = ffz(~x) + i*_NSIG_BPW + 1;
|
||||
break;
|
||||
}
|
||||
break;
|
||||
|
||||
case 2: if ((x = s[0] &~ m[0]) != 0)
|
||||
sig = 1;
|
||||
else if ((x = s[1] &~ m[1]) != 0)
|
||||
sig = _NSIG_BPW + 1;
|
||||
else
|
||||
for (i = 1; i < _NSIG_WORDS; ++i) {
|
||||
x = *++s &~ *++m;
|
||||
if (!x)
|
||||
continue;
|
||||
sig = ffz(~x) + i*_NSIG_BPW + 1;
|
||||
break;
|
||||
sig += ffz(~x);
|
||||
}
|
||||
break;
|
||||
|
||||
case 1: if ((x = *s &~ *m) != 0)
|
||||
sig = ffz(~x) + 1;
|
||||
case 2:
|
||||
x = s[1] &~ m[1];
|
||||
if (!x)
|
||||
break;
|
||||
sig = ffz(~x) + _NSIG_BPW + 1;
|
||||
break;
|
||||
|
||||
case 1:
|
||||
/* Nothing to do */
|
||||
break;
|
||||
}
|
||||
|
||||
|
|
Loading…
Reference in a new issue