2002-03-19 01:11:43 +08:00
|
|
|
// i386-signal.h - Catch runtime signals and turn them into exceptions
|
|
|
|
// on an i386 based Linux system.
|
1999-04-13 17:18:09 +08:00
|
|
|
|
2002-03-19 01:11:43 +08:00
|
|
|
/* Copyright (C) 1998, 1999, 2001, 2002 Free Software Foundation
|
1999-04-13 17:18:09 +08:00
|
|
|
|
|
|
|
This file is part of libgcj.
|
|
|
|
|
|
|
|
This software is copyrighted work licensed under the terms of the
|
|
|
|
Libgcj License. Please consult the file "LIBGCJ_LICENSE" for
|
|
|
|
details. */
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef JAVA_SIGNAL_H
|
|
|
|
#define JAVA_SIGNAL_H 1
|
|
|
|
|
|
|
|
#include <signal.h>
|
2001-01-31 05:00:22 +08:00
|
|
|
#include <sys/syscall.h>
|
1999-04-13 17:18:09 +08:00
|
|
|
|
|
|
|
#define HANDLE_SEGV 1
|
|
|
|
#define HANDLE_FPE 1
|
|
|
|
|
1999-04-20 14:27:11 +08:00
|
|
|
#define SIGNAL_HANDLER(_name) \
|
|
|
|
static void _name (int _dummy)
|
1999-04-13 17:18:09 +08:00
|
|
|
|
2000-05-20 01:55:34 +08:00
|
|
|
#define MAKE_THROW_FRAME(_exception) \
|
1999-05-20 16:26:55 +08:00
|
|
|
do \
|
1999-04-13 17:18:09 +08:00
|
|
|
{ \
|
|
|
|
void **_p = (void **)&_dummy; \
|
|
|
|
struct sigcontext_struct *_regs = (struct sigcontext_struct *)++_p; \
|
|
|
|
\
|
1999-07-07 17:09:39 +08:00
|
|
|
/* Advance the program counter so that it is after the start of the \
|
|
|
|
instruction: the x86 exception handler expects \
|
|
|
|
the PC to point to the instruction after a call. */ \
|
2001-05-30 01:50:50 +08:00
|
|
|
_regs->eip += 2; \
|
1999-07-07 17:09:39 +08:00
|
|
|
\
|
1999-05-20 16:26:55 +08:00
|
|
|
} \
|
|
|
|
while (0)
|
|
|
|
|
|
|
|
#define HANDLE_DIVIDE_OVERFLOW \
|
|
|
|
do \
|
|
|
|
{ \
|
|
|
|
void **_p = (void **)&_dummy; \
|
|
|
|
struct sigcontext_struct *_regs = (struct sigcontext_struct *)++_p; \
|
|
|
|
\
|
|
|
|
register unsigned char *_eip = (unsigned char *)_regs->eip; \
|
|
|
|
\
|
|
|
|
/* According to the JVM spec, "if the dividend is the negative \
|
|
|
|
* integer of the smallest magnitude and the divisor is -1, then \
|
|
|
|
* overflow occurs and the result is equal to the dividend. Despite \
|
|
|
|
* the overflow, no exception occurs". \
|
|
|
|
\
|
|
|
|
* We handle this by inspecting the instruction which generated the \
|
|
|
|
* signal and advancing eip to point to the following instruction. \
|
|
|
|
* As the instructions are variable length it is necessary to do a \
|
|
|
|
* little calculation to figure out where the following instruction \
|
|
|
|
* actually is. \
|
2001-05-30 01:50:50 +08:00
|
|
|
\
|
1999-05-20 16:26:55 +08:00
|
|
|
*/ \
|
|
|
|
\
|
|
|
|
if (_eip[0] == 0xf7) \
|
|
|
|
{ \
|
|
|
|
unsigned char _modrm = _eip[1]; \
|
|
|
|
\
|
|
|
|
if (_regs->eax == 0x80000000 \
|
|
|
|
&& ((_modrm >> 3) & 7) == 7) /* Signed divide */ \
|
|
|
|
{ \
|
|
|
|
_regs->edx = 0; /* the remainder is zero */ \
|
|
|
|
switch (_modrm >> 6) \
|
|
|
|
{ \
|
|
|
|
case 0: \
|
|
|
|
if ((_modrm & 7) == 5) \
|
|
|
|
_eip += 4; \
|
|
|
|
break; \
|
|
|
|
case 1: \
|
|
|
|
_eip += 1; \
|
|
|
|
break; \
|
|
|
|
case 2: \
|
|
|
|
_eip += 4; \
|
|
|
|
break; \
|
|
|
|
case 3: \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
_eip += 2; \
|
|
|
|
_regs->eip = (unsigned long)_eip; \
|
|
|
|
return; \
|
|
|
|
} \
|
1999-07-07 17:09:39 +08:00
|
|
|
else \
|
|
|
|
{ \
|
|
|
|
/* Advance the program counter so that it is after the start \
|
|
|
|
of the instruction: this is because the x86 exception \
|
|
|
|
handler expects the PC to point to the instruction after a \
|
|
|
|
call. */ \
|
2001-05-30 01:50:50 +08:00
|
|
|
_regs->eip += 2; \
|
1999-07-07 17:09:39 +08:00
|
|
|
} \
|
1999-05-20 16:26:55 +08:00
|
|
|
} \
|
|
|
|
} \
|
|
|
|
while (0)
|
1999-04-13 17:18:09 +08:00
|
|
|
|
2002-03-19 01:11:43 +08:00
|
|
|
/* We use old_kernel_sigaction here because we're calling the kernel
|
|
|
|
directly rather than via glibc. The sigaction structure that the
|
|
|
|
syscall uses is a different shape from the one in userland and not
|
|
|
|
visible to us in a header file so we define it here. */
|
|
|
|
|
|
|
|
struct old_i386_kernel_sigaction {
|
|
|
|
void (*k_sa_handler) (int);
|
|
|
|
unsigned long k_sa_mask;
|
|
|
|
unsigned long k_sa_flags;
|
|
|
|
void (*sa_restorer) (void);
|
|
|
|
};
|
|
|
|
|
|
|
|
#define INIT_SEGV \
|
|
|
|
do \
|
|
|
|
{ \
|
|
|
|
nullp = new java::lang::NullPointerException (); \
|
|
|
|
struct old_i386_kernel_sigaction kact; \
|
|
|
|
kact.k_sa_handler = catch_segv; \
|
|
|
|
kact.k_sa_mask = 0; \
|
|
|
|
kact.k_sa_flags = 0; \
|
|
|
|
syscall (SYS_sigaction, SIGSEGV, &kact, NULL); \
|
|
|
|
} \
|
1999-04-20 14:27:11 +08:00
|
|
|
while (0)
|
|
|
|
|
1999-07-07 17:09:39 +08:00
|
|
|
#define INIT_FPE \
|
1999-04-20 14:27:11 +08:00
|
|
|
do \
|
2002-03-19 01:11:43 +08:00
|
|
|
{ \
|
|
|
|
arithexception = new java::lang::ArithmeticException \
|
1999-05-20 16:26:55 +08:00
|
|
|
(JvNewStringLatin1 ("/ by zero")); \
|
2002-03-19 01:11:43 +08:00
|
|
|
struct old_i386_kernel_sigaction kact; \
|
|
|
|
kact.k_sa_handler = catch_fpe; \
|
|
|
|
kact.k_sa_mask = 0; \
|
|
|
|
kact.k_sa_flags = 0; \
|
|
|
|
syscall (SYS_sigaction, SIGFPE, &kact, NULL); \
|
1999-04-20 14:27:11 +08:00
|
|
|
} \
|
|
|
|
while (0)
|
|
|
|
|
2001-01-31 05:00:22 +08:00
|
|
|
/* You might wonder why we use syscall(SYS_sigaction) in INIT_FPE
|
|
|
|
* instead of the standard sigaction(). This is necessary because of
|
|
|
|
* the shenanigans above where we increment the PC saved in the
|
|
|
|
* context and then return. This trick will only work when we are
|
|
|
|
* called _directly_ by the kernel, because linuxthreads wraps signal
|
|
|
|
* handlers and its wrappers do not copy the sigcontext struct back
|
|
|
|
* when returning from a signal handler. If we return from our divide
|
|
|
|
* handler to a linuxthreads wrapper, we will lose the PC adjustment
|
|
|
|
* we made and return to the faulting instruction again. Using
|
2002-03-19 01:11:43 +08:00
|
|
|
* syscall(SYS_sigaction) causes our handler to be called directly
|
|
|
|
* by the kernel, bypassing any wrappers.
|
|
|
|
|
|
|
|
* Also, there is at the present time no unwind info in the
|
|
|
|
* linuxthreads library's signal handlers and so we can't unwind
|
|
|
|
* through them anyway.
|
|
|
|
|
|
|
|
* Finally, the code that glibc uses to return from a signal handler
|
|
|
|
* is subject to change. */
|
2001-01-31 05:00:22 +08:00
|
|
|
|
1999-04-13 17:18:09 +08:00
|
|
|
#endif /* JAVA_SIGNAL_H */
|
|
|
|
|