Newer
Older
$Header: /Volumes/share2/src/cmucl/cvs2git/cvsroot/src/lisp/sparc-arch.c,v 1.14 2003/08/27 16:45:56 toy Exp $
This code was written as part of the CMU Common Lisp project at
Carnegie Mellon University, and has been placed in the public domain.
*/
#include "lisp.h"
#include "internals.h"
#include "globals.h"
#include "validate.h"
#include "os.h"
#include "lispregs.h"
#include "signal.h"
#include "interrupt.h"
char *arch_init()
{
{
unsigned long badinst;
int rs1;
/* On the sparc, we have to decode the instruction. */
/* Make sure it's not the pc thats bogus, and that it was lisp code */
/* that caused the fault. */
if ((SC_PC(context) & 3) != 0 ||
((SC_PC(context) < READ_ONLY_SPACE_START ||
SC_PC(context) >= READ_ONLY_SPACE_START+READ_ONLY_SPACE_SIZE) &&
((lispobj *)SC_PC(context) < current_dynamic_space &&
(lispobj *)SC_PC(context) >=
current_dynamic_space + dynamic_space_size)))
if ((badinst >> 30) != 3)
/* All load/store instructions have op = 11 (binary) */
rs1 = (badinst>>14)&0x1f;
if (badinst & (1<<13)) {
/* r[rs1] + simm(13) */
int simm13 = badinst & 0x1fff;
if (simm13 & (1<<12))
simm13 |= -1<<13;
return (os_vm_address_t)(SC_REG(context, rs1) + simm13);
}
else {
/* r[rs1] + r[rs2] */
int rs2 = badinst & 0x1f;
return (os_vm_address_t)(SC_REG(context, rs1) + SC_REG(context, rs2));
}
}
void arch_skip_instruction(context)
struct sigcontext *context;
{
/* Skip the offending instruction */
}
unsigned char *arch_internal_error_arguments(struct sigcontext *scp)
{
}
boolean arch_pseudo_atomic_atomic(struct sigcontext *scp)
{
return (SC_REG(scp, reg_ALLOC) & 4);
}
void arch_set_pseudo_atomic_interrupted(struct sigcontext *scp)
{
SC_REG(scp, reg_ALLOC) |= 1;
}
unsigned long arch_install_breakpoint(void *pc)
{
unsigned long *ptr = (unsigned long *)pc;
unsigned long result = *ptr;
*ptr = trap_Breakpoint;
os_flush_icache((os_vm_address_t) pc, sizeof(unsigned long));
return result;
}
void arch_remove_breakpoint(void *pc, unsigned long orig_inst)
{
*(unsigned long *)pc = orig_inst;
os_flush_icache((os_vm_address_t) pc, sizeof(unsigned long));
}
static unsigned long *skipped_break_addr, displaced_after_inst;
void arch_do_displaced_inst(struct sigcontext *scp,
unsigned long orig_inst)
{
unsigned long *pc = (unsigned long *)SC_PC(scp);
unsigned long *npc = (unsigned long *)SC_NPC(scp);
#ifdef POSIX_SIGS
orig_sigmask = scp->uc_sigmask;
sigemptyset(&scp->uc_sigmask);
FILLBLOCKSET(&scp->uc_sigmask);
#else
os_flush_icache((os_vm_address_t) pc, sizeof(unsigned long));
skipped_break_addr = pc;
displaced_after_inst = *npc;
*npc = trap_AfterBreakpoint;
os_flush_icache((os_vm_address_t) npc, sizeof(unsigned long));
#ifdef SOLARIS
/* XXX never tested */
setcontext(scp);
#else
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
/*
* Look at the instruction at address PC and see if it's a trap
* instruction with an immediate value. If so, set trapno to the trap
* number, and return non-zero. If it's not a trap instruction,
* return 0.
*/
boolean trap_inst_p(unsigned int* pc, int* trapno)
{
unsigned int trap_inst;
trap_inst = *pc;
if (((trap_inst >> 30) == 2)
&& (((trap_inst >> 19) & 0x3f) == 0x3a)
&& (((trap_inst >> 14) & 0x1f) == reg_ZERO)
&& (((trap_inst >> 13) & 1) == 1))
{
/*
* Got a trap instruction with immediate trap value.
* Get the value and return.
*/
*trapno = (trap_inst & 0x3f);
return 1;
}
else
{
*trapno = -1;
return 0;
}
}
int result;
pc = (unsigned int*) SC_PC(context);
badinst = *pc;
result = 0;
/*
* Check to see if the current instruction is a trap #16. We check
* to make sure this instruction was a trap instruction with rs1 = 0
* and a software trap number (immediate value) of 16.
*/
if (trap_inst_p(pc, &trapno) && (trapno == trap_PseudoAtomic))
{
unsigned int previnst;
previnst = pc[-1];
/*
* Check to see if the previous instruction was an andcc alloc-tn,
* 3, zero-tn instruction.
*/
if (((previnst >> 30) == 2) && (((previnst >> 19) & 0x3f) == 0x11)
&& (((previnst >> 14) & 0x1f) == reg_ALLOC)
&& (((previnst >> 25) & 0x1f) == reg_ZERO)
&& (((previnst >> 13) & 1) == 1)
&& ((previnst & 0x1fff) == 3))
{
result = 1;
}
else
{
fprintf(stderr, "Oops! Got a pseudo atomic trap without a preceeding andcc!\n");
#ifdef GENCGC
/*
* Return non-zero if the instruction is a trap 31 instruction
*/
boolean allocation_trap_p(struct sigcontext *context)
{
int result;
unsigned int* pc;
unsigned int or_inst;
int trapno;
result = 0;
/*
* Make sure this is a trap 31 instruction preceeded by an OR
* instruction.
*/
pc = SC_PC(context);
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
{
/* Got the trap. Is it preceeded by an OR instruction? */
or_inst = pc[-1];
if (((or_inst >> 30) == 2) && (((or_inst >> 19) & 0x1f) == 2))
{
result = 1;
}
else
{
fprintf(stderr, "Whoa!!! Got an allocation trap not preceeded by an OR inst: 0x%08x!\n",
or_inst);
}
}
return result;
}
#endif
#if 0
/* Pop the stack frame that build_fake_control_stack_frame makes */
static void pop_fake_control_stack_frame(struct sigcontext *context)
{
current_control_frame_pointer = (lispobj*) SC_REG(context, reg_CFP);
SC_REG(context, reg_OCFP) = current_control_frame_pointer[0];
SC_REG(context, reg_CODE) = current_control_frame_pointer[1];
SC_REG(context, reg_CSP) = SC_REG(context, reg_CFP);
SC_REG(context, reg_CFP) = SC_REG(context, reg_OCFP);
}
#endif
#ifdef GENCGC
void handle_allocation_trap(struct sigcontext *context)
{
unsigned int* pc;
unsigned int or_inst;
int rs1;
int size;
int immed;
int context_index;
boolean were_in_lisp;
char* memory;
pc = (unsigned int*) SC_PC(context);
or_inst = pc[-1];
/*
* The instruction before this trap instruction had better be an OR
* instruction!
*/
/*
* An OR instruction. RS1 is the register we want to allocate to.
* RS2 (or an immediate) is the size.
*/
rs1 = (or_inst >> 14) & 0x1f;
immed = (or_inst >> 13) & 1;
if (immed == 1)
{
size = or_inst & 0x1fff;
}
else
{
size = or_inst & 0x1f;
size = SC_REG(context, size);
}
/*
* I don't think it's possible for us NOT to be in lisp when we get
* here. Remove this later?
*/
were_in_lisp = !foreign_function_call_active;
if (were_in_lisp)
{
fake_foreign_function_call(context);
}
else
{
fprintf(stderr, "**** Whoa! allocation trap and we weren't in lisp!\n");
}
/*
* Allocate some memory, store the memory address in rs1.
*/
#if 0
fprintf(stderr, "Alloc %d to %s\n", size, lisp_register_names[rs1]);
#endif
memory = alloc(size);
SC_REG(context, rs1) = memory;
if (were_in_lisp)
{
undo_fake_foreign_function_call(context);
}
}
#endif
/*
* How to identify an illegal instruction trap and a trap instruction
* trap.
*/
#ifdef SOLARIS
#define ILLTRAP_INST ILL_ILLOPC
#define TRAP_INST(code) (CODE(code) == ILL_ILLTRP)
#else
#define ILLTRAP_INST T_UNIMP_INSTR
#define TRAP_INST(code) ((CODE(code) >= T_SOFTWARE_TRAP + 16) && (CODE(code) < T_SOFTWARE_TRAP + 32))
#endif
SAVE_CONTEXT();
#ifdef POSIX_SIGS
sigprocmask(SIG_SETMASK, &context->uc_sigmask, 0);
#else
sigsetmask(context->sc_mask);
#endif
if (CODE(code) == ILLTRAP_INST)
unsigned int inst;
unsigned int* pc = (unsigned int *)(SC_PC(context));
illtrap_code = inst & 0x3fffff;
switch (illtrap_code) {
arch_skip_instruction(context);
interrupt_handle_pending(context);
lose("%%primitive halt called; the party is over.\n");
case trap_Error:
case trap_Cerror:
interrupt_internal_error(signal, code, context, illtrap_code == trap_Cerror);
SC_PC(context)=(int)handle_function_end_breakpoint(signal, code, context);
SC_NPC(context)=SC_PC(context) + 4;
break;
case trap_AfterBreakpoint:
*skipped_break_addr = trap_Breakpoint;
skipped_break_addr = NULL;
*(unsigned long *)SC_PC(context) = displaced_after_inst;
#ifdef POSIX_SIGS
context->uc_sigmask = orig_sigmask;
#else
context->sc_mask = orig_sigmask;
#endif
os_flush_icache((os_vm_address_t) SC_PC(context),
sizeof(unsigned long));
{
if (pseudo_atomic_trap_p(context))
{
/* A trap instruction from a pseudo-atomic. We just need
to fixup up alloc-tn to remove the interrupted flag,
skip over the trap instruction, and then handle the
pending interrupt(s). */
SC_REG(context, reg_ALLOC) &= ~7;
arch_skip_instruction(context);
interrupt_handle_pending(context);
}
#ifdef GENCGC
else if (allocation_trap_p(context))
{
/* An allocation trap. Call the trap handler and then skip
this instruction */
handle_allocation_trap(context);
arch_skip_instruction(context);
}
#endif
else
{
interrupt_internal_error(signal, code, context, FALSE);
}
}
{
unsigned long badinst;
boolean subtract, immed;
int rd, rs1, op1, rs2, op2, result;
if ((badinst >> 30) != 2 || ((badinst >> 20) & 0x1f) != 0x11) {
/* It wasn't a tagged add. Pass the signal into lisp. */
fprintf(stderr, "SIGEMT trap handler with tagged op instruction!\n");
/* Extract the parts of the inst. */
subtract = badinst & (1<<19);
rs1 = (badinst>>14) & 0x1f;
/* If the first arg is $ALLOC then it is really a signal-pending note */
/* for the pseudo-atomic noise. */
if (rs1 == reg_ALLOC) {
/* Perform the op anyway. */
op2 = badinst & 0x1fff;
if (op2 & (1<<12))
op2 |= -1<<13;
if (subtract)
result = op1 - op2;
else
result = op1 + op2;
SC_REG(context, reg_ALLOC) = result & ~7;
arch_skip_instruction(context);
interrupt_handle_pending(context);
return;
}
if ((op1 & 3) != 0) {
/* The first arg wan't a fixnum. */
return;
}
if (immed = badinst & (1<<13)) {
op2 = badinst & 0x1fff;
if (op2 & (1<<12))
op2 |= -1<<13;
}
else {
rs2 = badinst & 0x1f;
}
if ((op2 & 3) != 0) {
/* The second arg wan't a fixnum. */
return;
}
rd = (badinst>>25) & 0x1f;
if (rd != 0) {
/* Don't bother computing the result unless we are going to use it. */
if (subtract)
result = (op1>>2) - (op2>>2);
else
result = (op1>>2) + (op2>>2);
current_dynamic_space_free_pointer =
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
}
void arch_install_interrupt_handlers()
{
interrupt_install_low_level_handler(SIGILL,sigill_handler);
interrupt_install_low_level_handler(SIGEMT,sigemt_handler);
}
extern lispobj call_into_lisp(lispobj fun, lispobj *args, int nargs);
lispobj funcall0(lispobj function)
{
lispobj *args = current_control_stack_pointer;
return call_into_lisp(function, args, 0);
}
lispobj funcall1(lispobj function, lispobj arg0)
{
lispobj *args = current_control_stack_pointer;
current_control_stack_pointer += 1;
args[0] = arg0;
return call_into_lisp(function, args, 1);
}
lispobj funcall2(lispobj function, lispobj arg0, lispobj arg1)
{
lispobj *args = current_control_stack_pointer;
current_control_stack_pointer += 2;
args[0] = arg0;
args[1] = arg1;
return call_into_lisp(function, args, 2);
}
lispobj funcall3(lispobj function, lispobj arg0, lispobj arg1, lispobj arg2)
{
lispobj *args = current_control_stack_pointer;
current_control_stack_pointer += 3;
args[0] = arg0;
args[1] = arg1;
args[2] = arg2;
return call_into_lisp(function, args, 3);
}
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
#ifdef LINKAGE_TABLE
/* This is mostly stolen from the x86 version, with adjustments for sparc */
/*
* Linkage entry size is 16, because we need at least 3 instruction to
* implement a jump:
*
* sethi %hi(addr), %g4
* jmpl [%g4 + %lo(addr)], %g5
* nop
*
* The Sparc V9 ABI seems to use 8 words for its jump tables. Maybe
* we should do the same?
*/
/*
* This had better match lisp::target-foreign-linkage-entry-size in
* sparc/parms.lisp! Each entry is 4 instructions long, so 16 bytes.
*/
#ifndef LinkageEntrySize
#define LinkageEntrySize (4*4)
#endif
/*
* Define the registers to use in the linkage jump table. Can be the
* same. This MUST be coordinated with resolve_linkage_tramp which
* needs to know the register used for LINKAGE_ADDR_REG.
*
* Some care must be exercised when choosing these. It has to be a
* register that is not otherwise being used. reg_L0 is a good
* choice. call_into_c trashes reg_L0 without preserving it, so we
* can trash it in the linkage jump table. For the linkage entries
* that call resolve_linkage_tramp, we can use reg_L0 too because
* resolve_linkage_tramp is always called from call_into_c. (This is
* enforced by having new-genesis create an entry for call_into_c, so
* we never have to do a lookup for call_into_c.)
*/
#define LINKAGE_TEMP_REG reg_L0
#define LINKAGE_ADDR_REG reg_L0
/*
* Insert the necessary jump instructions at the given address.
* Return the address of the next word
*/
void* arch_make_jump_entry(void* reloc_addr, void *target_addr)
{
/*
* Make JMP to function entry.
*
* The instruction sequence is:
*
* sethi %hi(addr), temp_reg
* jmp %temp_reg + %lo(addr), %addr_reg
* nop
* nop
*
*/
int* inst_ptr;
unsigned long hi; /* Top 22 bits of address */
unsigned long lo; /* Low 10 bits of address */
unsigned int inst;
inst_ptr = (int*) reloc_addr;
/*
* Split the target address into hi and lo parts for the sethi
* instruction. hi is the top 22 bits. lo is the low 10 bits.
*/
hi = (unsigned long) target_addr;
lo = hi & 0x3ff;
hi >>= 10;
/*
* sethi %hi(addr), temp_reg
*/
inst = (0 << 30) | (LINKAGE_TEMP_REG << 25) | (4 << 22) | hi;
*inst_ptr++ = inst;
/*
* jmpl [temp_reg + %lo(addr)], addr_reg
*/
inst = (2 << 30) | (LINKAGE_ADDR_REG << 25) | (0x38 << 19)
| (LINKAGE_TEMP_REG << 14) | (1 << 13) | lo;
*inst_ptr++ = inst;
/* nop (really sethi 0, %g0) */
inst = (0 << 30) | (0 << 25) | (4 << 22) | 0;
*inst_ptr++ = inst;
*inst_ptr++ = inst;
os_flush_icache(reloc_addr, (char*) inst_ptr - (char*) reloc_addr);
return reloc_addr;
}
void arch_make_linkage_entry(long linkage_entry, void *target_addr, long type)
{
int *reloc_addr = (int *)(FOREIGN_LINKAGE_SPACE_START
+ linkage_entry * LinkageEntrySize);
if (type == 1)
{ /* code reference */
arch_make_jump_entry(reloc_addr, target_addr);
}
else if (type == 2)
{
*(unsigned long *)reloc_addr = (unsigned long)target_addr;
}
}
/* Make a the entry a jump to resolve_linkage_tramp. */
extern void resolve_linkage_tramp(void);
void arch_make_lazy_linkage(long linkage_entry)
{
arch_make_linkage_entry(linkage_entry, (void*) resolve_linkage_tramp, 1);
}
/* Get linkage entry. We're given the return address which should be
the address of the jmpl instruction (2nd word) of the linkage
entry. Figure out which entry this address belong to. */
long arch_linkage_entry(unsigned long retaddr)
{
return (retaddr - (FOREIGN_LINKAGE_SPACE_START))
/ LinkageEntrySize;
}
#endif /* LINKAGE_TABLE */