1 /* Target-dependent code for the HP PA architecture, for GDB.
2 Copyright 1986, 1987, 1989, 1990, 1991, 1992, 1993, 1994, 1995
3 Free Software Foundation, Inc.
5 Contributed by the Center for Software Science at the
6 University of Utah (pa-gdb-bugs@cs.utah.edu).
8 This file is part of GDB.
10 This program is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 2 of the License, or
13 (at your option) any later version.
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software
22 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
29 /* For argument passing to the inferior */
33 #include <sys/types.h>
36 #include <sys/param.h>
39 #ifdef COFF_ENCAPSULATE
40 #include "a.out.encap.h"
44 #define N_SET_MAGIC(exec, val) ((exec).a_magic = (val))
47 /*#include <sys/user.h> After a.out.h */
58 #define SWAP_TARGET_AND_HOST(buffer,len) \
61 if (TARGET_BYTE_ORDER != HOST_BYTE_ORDER) \
64 char *p = (char *)(buffer); \
65 char *q = ((char *)(buffer)) + len - 1; \
66 for (; p < q; p++, q--) \
76 static int restore_pc_queue PARAMS ((struct frame_saved_regs *));
78 static int hppa_alignof PARAMS ((struct type *));
80 CORE_ADDR frame_saved_pc PARAMS ((struct frame_info *));
82 static int prologue_inst_adjust_sp PARAMS ((unsigned long));
84 static int is_branch PARAMS ((unsigned long));
86 static int inst_saves_gr PARAMS ((unsigned long));
88 static int inst_saves_fr PARAMS ((unsigned long));
90 static int pc_in_interrupt_handler PARAMS ((CORE_ADDR));
92 static int pc_in_linker_stub PARAMS ((CORE_ADDR));
94 static int compare_unwind_entries PARAMS ((const struct unwind_table_entry *,
95 const struct unwind_table_entry *));
97 static void read_unwind_info PARAMS ((struct objfile *));
99 static void internalize_unwinds PARAMS ((struct objfile *,
100 struct unwind_table_entry *,
101 asection *, unsigned int,
102 unsigned int, CORE_ADDR));
103 static void pa_print_registers PARAMS ((char *, int, int));
104 static void pa_print_fp_reg PARAMS ((int));
107 /* Routines to extract various sized constants out of hppa
110 /* This assumes that no garbage lies outside of the lower bits of
114 sign_extend (val, bits)
117 return (int)(val >> bits - 1 ? (-1 << bits) | val : val);
120 /* For many immediate values the sign bit is the low bit! */
123 low_sign_extend (val, bits)
126 return (int)((val & 0x1 ? (-1 << (bits - 1)) : 0) | val >> 1);
128 /* extract the immediate field from a ld{bhw}s instruction */
131 get_field (val, from, to)
132 unsigned val, from, to;
134 val = val >> 31 - to;
135 return val & ((1 << 32 - from) - 1);
139 set_field (val, from, to, new_val)
140 unsigned *val, from, to;
142 unsigned mask = ~((1 << (to - from + 1)) << (31 - from));
143 return *val = *val & mask | (new_val << (31 - from));
146 /* extract a 3-bit space register number from a be, ble, mtsp or mfsp */
151 return GET_FIELD (word, 18, 18) << 2 | GET_FIELD (word, 16, 17);
154 extract_5_load (word)
157 return low_sign_extend (word >> 16 & MASK_5, 5);
160 /* extract the immediate field from a st{bhw}s instruction */
163 extract_5_store (word)
166 return low_sign_extend (word & MASK_5, 5);
169 /* extract the immediate field from a break instruction */
172 extract_5r_store (word)
175 return (word & MASK_5);
178 /* extract the immediate field from a {sr}sm instruction */
181 extract_5R_store (word)
184 return (word >> 16 & MASK_5);
187 /* extract an 11 bit immediate field */
193 return low_sign_extend (word & MASK_11, 11);
196 /* extract a 14 bit immediate field */
202 return low_sign_extend (word & MASK_14, 14);
205 /* deposit a 14 bit constant in a word */
208 deposit_14 (opnd, word)
212 unsigned sign = (opnd < 0 ? 1 : 0);
214 return word | ((unsigned)opnd << 1 & MASK_14) | sign;
217 /* extract a 21 bit constant */
227 val = GET_FIELD (word, 20, 20);
229 val |= GET_FIELD (word, 9, 19);
231 val |= GET_FIELD (word, 5, 6);
233 val |= GET_FIELD (word, 0, 4);
235 val |= GET_FIELD (word, 7, 8);
236 return sign_extend (val, 21) << 11;
239 /* deposit a 21 bit constant in a word. Although 21 bit constants are
240 usually the top 21 bits of a 32 bit constant, we assume that only
241 the low 21 bits of opnd are relevant */
244 deposit_21 (opnd, word)
249 val |= GET_FIELD (opnd, 11 + 14, 11 + 18);
251 val |= GET_FIELD (opnd, 11 + 12, 11 + 13);
253 val |= GET_FIELD (opnd, 11 + 19, 11 + 20);
255 val |= GET_FIELD (opnd, 11 + 1, 11 + 11);
257 val |= GET_FIELD (opnd, 11 + 0, 11 + 0);
261 /* extract a 12 bit constant from branch instructions */
267 return sign_extend (GET_FIELD (word, 19, 28) |
268 GET_FIELD (word, 29, 29) << 10 |
269 (word & 0x1) << 11, 12) << 2;
272 /* extract a 17 bit constant from branch instructions, returning the
273 19 bit signed value. */
279 return sign_extend (GET_FIELD (word, 19, 28) |
280 GET_FIELD (word, 29, 29) << 10 |
281 GET_FIELD (word, 11, 15) << 11 |
282 (word & 0x1) << 16, 17) << 2;
286 /* Compare the start address for two unwind entries returning 1 if
287 the first address is larger than the second, -1 if the second is
288 larger than the first, and zero if they are equal. */
291 compare_unwind_entries (a, b)
292 const struct unwind_table_entry *a;
293 const struct unwind_table_entry *b;
295 if (a->region_start > b->region_start)
297 else if (a->region_start < b->region_start)
304 internalize_unwinds (objfile, table, section, entries, size, text_offset)
305 struct objfile *objfile;
306 struct unwind_table_entry *table;
308 unsigned int entries, size;
309 CORE_ADDR text_offset;
311 /* We will read the unwind entries into temporary memory, then
312 fill in the actual unwind table. */
317 char *buf = alloca (size);
319 bfd_get_section_contents (objfile->obfd, section, buf, 0, size);
321 /* Now internalize the information being careful to handle host/target
323 for (i = 0; i < entries; i++)
325 table[i].region_start = bfd_get_32 (objfile->obfd,
327 table[i].region_start += text_offset;
329 table[i].region_end = bfd_get_32 (objfile->obfd, (bfd_byte *)buf);
330 table[i].region_end += text_offset;
332 tmp = bfd_get_32 (objfile->obfd, (bfd_byte *)buf);
334 table[i].Cannot_unwind = (tmp >> 31) & 0x1;
335 table[i].Millicode = (tmp >> 30) & 0x1;
336 table[i].Millicode_save_sr0 = (tmp >> 29) & 0x1;
337 table[i].Region_description = (tmp >> 27) & 0x3;
338 table[i].reserved1 = (tmp >> 26) & 0x1;
339 table[i].Entry_SR = (tmp >> 25) & 0x1;
340 table[i].Entry_FR = (tmp >> 21) & 0xf;
341 table[i].Entry_GR = (tmp >> 16) & 0x1f;
342 table[i].Args_stored = (tmp >> 15) & 0x1;
343 table[i].Variable_Frame = (tmp >> 14) & 0x1;
344 table[i].Separate_Package_Body = (tmp >> 13) & 0x1;
345 table[i].Frame_Extension_Millicode = (tmp >> 12 ) & 0x1;
346 table[i].Stack_Overflow_Check = (tmp >> 11) & 0x1;
347 table[i].Two_Instruction_SP_Increment = (tmp >> 10) & 0x1;
348 table[i].Ada_Region = (tmp >> 9) & 0x1;
349 table[i].reserved2 = (tmp >> 5) & 0xf;
350 table[i].Save_SP = (tmp >> 4) & 0x1;
351 table[i].Save_RP = (tmp >> 3) & 0x1;
352 table[i].Save_MRP_in_frame = (tmp >> 2) & 0x1;
353 table[i].extn_ptr_defined = (tmp >> 1) & 0x1;
354 table[i].Cleanup_defined = tmp & 0x1;
355 tmp = bfd_get_32 (objfile->obfd, (bfd_byte *)buf);
357 table[i].MPE_XL_interrupt_marker = (tmp >> 31) & 0x1;
358 table[i].HP_UX_interrupt_marker = (tmp >> 30) & 0x1;
359 table[i].Large_frame = (tmp >> 29) & 0x1;
360 table[i].reserved4 = (tmp >> 27) & 0x3;
361 table[i].Total_frame_size = tmp & 0x7ffffff;
366 /* Read in the backtrace information stored in the `$UNWIND_START$' section of
367 the object file. This info is used mainly by find_unwind_entry() to find
368 out the stack frame size and frame pointer used by procedures. We put
369 everything on the psymbol obstack in the objfile so that it automatically
370 gets freed when the objfile is destroyed. */
373 read_unwind_info (objfile)
374 struct objfile *objfile;
376 asection *unwind_sec, *elf_unwind_sec, *stub_unwind_sec;
377 unsigned unwind_size, elf_unwind_size, stub_unwind_size, total_size;
378 unsigned index, unwind_entries, elf_unwind_entries;
379 unsigned stub_entries, total_entries;
380 CORE_ADDR text_offset;
381 struct obj_unwind_info *ui;
383 text_offset = ANOFFSET (objfile->section_offsets, 0);
384 ui = obstack_alloc (&objfile->psymbol_obstack,
385 sizeof (struct obj_unwind_info));
391 /* Get hooks to all unwind sections. Note there is no linker-stub unwind
392 section in ELF at the moment. */
393 unwind_sec = bfd_get_section_by_name (objfile->obfd, "$UNWIND_START$");
394 elf_unwind_sec = bfd_get_section_by_name (objfile->obfd, ".PARISC.unwind");
395 stub_unwind_sec = bfd_get_section_by_name (objfile->obfd, "$UNWIND_END$");
397 /* Get sizes and unwind counts for all sections. */
400 unwind_size = bfd_section_size (objfile->obfd, unwind_sec);
401 unwind_entries = unwind_size / UNWIND_ENTRY_SIZE;
411 elf_unwind_size = bfd_section_size (objfile->obfd, elf_unwind_sec);
412 elf_unwind_entries = elf_unwind_size / UNWIND_ENTRY_SIZE;
417 elf_unwind_entries = 0;
422 stub_unwind_size = bfd_section_size (objfile->obfd, stub_unwind_sec);
423 stub_entries = stub_unwind_size / STUB_UNWIND_ENTRY_SIZE;
427 stub_unwind_size = 0;
431 /* Compute total number of unwind entries and their total size. */
432 total_entries = unwind_entries + elf_unwind_entries + stub_entries;
433 total_size = total_entries * sizeof (struct unwind_table_entry);
435 /* Allocate memory for the unwind table. */
436 ui->table = obstack_alloc (&objfile->psymbol_obstack, total_size);
437 ui->last = total_entries - 1;
439 /* Internalize the standard unwind entries. */
441 internalize_unwinds (objfile, &ui->table[index], unwind_sec,
442 unwind_entries, unwind_size, text_offset);
443 index += unwind_entries;
444 internalize_unwinds (objfile, &ui->table[index], elf_unwind_sec,
445 elf_unwind_entries, elf_unwind_size, text_offset);
446 index += elf_unwind_entries;
448 /* Now internalize the stub unwind entries. */
449 if (stub_unwind_size > 0)
452 char *buf = alloca (stub_unwind_size);
454 /* Read in the stub unwind entries. */
455 bfd_get_section_contents (objfile->obfd, stub_unwind_sec, buf,
456 0, stub_unwind_size);
458 /* Now convert them into regular unwind entries. */
459 for (i = 0; i < stub_entries; i++, index++)
461 /* Clear out the next unwind entry. */
462 memset (&ui->table[index], 0, sizeof (struct unwind_table_entry));
464 /* Convert offset & size into region_start and region_end.
465 Stuff away the stub type into "reserved" fields. */
466 ui->table[index].region_start = bfd_get_32 (objfile->obfd,
468 ui->table[index].region_start += text_offset;
470 ui->table[index].stub_type = bfd_get_8 (objfile->obfd,
473 ui->table[index].region_end
474 = ui->table[index].region_start + 4 *
475 (bfd_get_16 (objfile->obfd, (bfd_byte *) buf) - 1);
481 /* Unwind table needs to be kept sorted. */
482 qsort (ui->table, total_entries, sizeof (struct unwind_table_entry),
483 compare_unwind_entries);
485 /* Keep a pointer to the unwind information. */
486 objfile->obj_private = (PTR) ui;
489 /* Lookup the unwind (stack backtrace) info for the given PC. We search all
490 of the objfiles seeking the unwind table entry for this PC. Each objfile
491 contains a sorted list of struct unwind_table_entry. Since we do a binary
492 search of the unwind tables, we depend upon them to be sorted. */
494 static struct unwind_table_entry *
495 find_unwind_entry(pc)
498 int first, middle, last;
499 struct objfile *objfile;
501 ALL_OBJFILES (objfile)
503 struct obj_unwind_info *ui;
505 ui = OBJ_UNWIND_INFO (objfile);
509 read_unwind_info (objfile);
510 ui = OBJ_UNWIND_INFO (objfile);
513 /* First, check the cache */
516 && pc >= ui->cache->region_start
517 && pc <= ui->cache->region_end)
520 /* Not in the cache, do a binary search */
525 while (first <= last)
527 middle = (first + last) / 2;
528 if (pc >= ui->table[middle].region_start
529 && pc <= ui->table[middle].region_end)
531 ui->cache = &ui->table[middle];
532 return &ui->table[middle];
535 if (pc < ui->table[middle].region_start)
540 } /* ALL_OBJFILES() */
544 /* Return the adjustment necessary to make for addresses on the stack
545 as presented by hpread.c.
547 This is necessary because of the stack direction on the PA and the
548 bizarre way in which someone (?) decided they wanted to handle
549 frame pointerless code in GDB. */
551 hpread_adjust_stack_address (func_addr)
554 struct unwind_table_entry *u;
556 u = find_unwind_entry (func_addr);
560 return u->Total_frame_size << 3;
563 /* Called to determine if PC is in an interrupt handler of some
567 pc_in_interrupt_handler (pc)
570 struct unwind_table_entry *u;
571 struct minimal_symbol *msym_us;
573 u = find_unwind_entry (pc);
577 /* Oh joys. HPUX sets the interrupt bit for _sigreturn even though
578 its frame isn't a pure interrupt frame. Deal with this. */
579 msym_us = lookup_minimal_symbol_by_pc (pc);
581 return u->HP_UX_interrupt_marker && !IN_SIGTRAMP (pc, SYMBOL_NAME (msym_us));
584 /* Called when no unwind descriptor was found for PC. Returns 1 if it
585 appears that PC is in a linker stub. */
588 pc_in_linker_stub (pc)
591 int found_magic_instruction = 0;
595 /* If unable to read memory, assume pc is not in a linker stub. */
596 if (target_read_memory (pc, buf, 4) != 0)
599 /* We are looking for something like
601 ; $$dyncall jams RP into this special spot in the frame (RP')
602 ; before calling the "call stub"
605 ldsid (rp),r1 ; Get space associated with RP into r1
606 mtsp r1,sp ; Move it into space register 0
607 be,n 0(sr0),rp) ; back to your regularly scheduled program
610 /* Maximum known linker stub size is 4 instructions. Search forward
611 from the given PC, then backward. */
612 for (i = 0; i < 4; i++)
614 /* If we hit something with an unwind, stop searching this direction. */
616 if (find_unwind_entry (pc + i * 4) != 0)
619 /* Check for ldsid (rp),r1 which is the magic instruction for a
620 return from a cross-space function call. */
621 if (read_memory_integer (pc + i * 4, 4) == 0x004010a1)
623 found_magic_instruction = 1;
626 /* Add code to handle long call/branch and argument relocation stubs
630 if (found_magic_instruction != 0)
633 /* Now look backward. */
634 for (i = 0; i < 4; i++)
636 /* If we hit something with an unwind, stop searching this direction. */
638 if (find_unwind_entry (pc - i * 4) != 0)
641 /* Check for ldsid (rp),r1 which is the magic instruction for a
642 return from a cross-space function call. */
643 if (read_memory_integer (pc - i * 4, 4) == 0x004010a1)
645 found_magic_instruction = 1;
648 /* Add code to handle long call/branch and argument relocation stubs
651 return found_magic_instruction;
655 find_return_regnum(pc)
658 struct unwind_table_entry *u;
660 u = find_unwind_entry (pc);
671 /* Return size of frame, or -1 if we should use a frame pointer. */
673 find_proc_framesize (pc)
676 struct unwind_table_entry *u;
677 struct minimal_symbol *msym_us;
679 u = find_unwind_entry (pc);
683 if (pc_in_linker_stub (pc))
684 /* Linker stubs have a zero size frame. */
690 msym_us = lookup_minimal_symbol_by_pc (pc);
692 /* If Save_SP is set, and we're not in an interrupt or signal caller,
693 then we have a frame pointer. Use it. */
694 if (u->Save_SP && !pc_in_interrupt_handler (pc)
695 && !IN_SIGTRAMP (pc, SYMBOL_NAME (msym_us)))
698 return u->Total_frame_size << 3;
701 /* Return offset from sp at which rp is saved, or 0 if not saved. */
702 static int rp_saved PARAMS ((CORE_ADDR));
708 struct unwind_table_entry *u;
710 u = find_unwind_entry (pc);
714 if (pc_in_linker_stub (pc))
715 /* This is the so-called RP'. */
723 else if (u->stub_type != 0)
725 switch (u->stub_type)
730 case PARAMETER_RELOCATION:
741 frameless_function_invocation (frame)
742 struct frame_info *frame;
744 struct unwind_table_entry *u;
746 u = find_unwind_entry (frame->pc);
751 return (u->Total_frame_size == 0 && u->stub_type == 0);
755 saved_pc_after_call (frame)
756 struct frame_info *frame;
760 struct unwind_table_entry *u;
762 ret_regnum = find_return_regnum (get_frame_pc (frame));
763 pc = read_register (ret_regnum) & ~0x3;
765 /* If PC is in a linker stub, then we need to dig the address
766 the stub will return to out of the stack. */
767 u = find_unwind_entry (pc);
768 if (u && u->stub_type != 0)
769 return frame_saved_pc (frame);
775 frame_saved_pc (frame)
776 struct frame_info *frame;
778 CORE_ADDR pc = get_frame_pc (frame);
779 struct unwind_table_entry *u;
781 /* BSD, HPUX & OSF1 all lay out the hardware state in the same manner
782 at the base of the frame in an interrupt handler. Registers within
783 are saved in the exact same order as GDB numbers registers. How
785 if (pc_in_interrupt_handler (pc))
786 return read_memory_integer (frame->frame + PC_REGNUM * 4, 4) & ~0x3;
788 /* Deal with signal handler caller frames too. */
789 if (frame->signal_handler_caller)
792 FRAME_SAVED_PC_IN_SIGTRAMP (frame, &rp);
796 if (frameless_function_invocation (frame))
800 ret_regnum = find_return_regnum (pc);
802 /* If the next frame is an interrupt frame or a signal
803 handler caller, then we need to look in the saved
804 register area to get the return pointer (the values
805 in the registers may not correspond to anything useful). */
807 && (frame->next->signal_handler_caller
808 || pc_in_interrupt_handler (frame->next->pc)))
810 struct frame_saved_regs saved_regs;
812 get_frame_saved_regs (frame->next, &saved_regs);
813 if (read_memory_integer (saved_regs.regs[FLAGS_REGNUM], 4) & 0x2)
815 pc = read_memory_integer (saved_regs.regs[31], 4) & ~0x3;
817 /* Syscalls are really two frames. The syscall stub itself
818 with a return pointer in %rp and the kernel call with
819 a return pointer in %r31. We return the %rp variant
820 if %r31 is the same as frame->pc. */
822 pc = read_memory_integer (saved_regs.regs[RP_REGNUM], 4) & ~0x3;
825 pc = read_memory_integer (saved_regs.regs[RP_REGNUM], 4) & ~0x3;
828 pc = read_register (ret_regnum) & ~0x3;
835 rp_offset = rp_saved (pc);
836 /* Similar to code in frameless function case. If the next
837 frame is a signal or interrupt handler, then dig the right
838 information out of the saved register info. */
841 && (frame->next->signal_handler_caller
842 || pc_in_interrupt_handler (frame->next->pc)))
844 struct frame_saved_regs saved_regs;
846 get_frame_saved_regs (frame->next, &saved_regs);
847 if (read_memory_integer (saved_regs.regs[FLAGS_REGNUM], 4) & 0x2)
849 pc = read_memory_integer (saved_regs.regs[31], 4) & ~0x3;
851 /* Syscalls are really two frames. The syscall stub itself
852 with a return pointer in %rp and the kernel call with
853 a return pointer in %r31. We return the %rp variant
854 if %r31 is the same as frame->pc. */
856 pc = read_memory_integer (saved_regs.regs[RP_REGNUM], 4) & ~0x3;
859 pc = read_memory_integer (saved_regs.regs[RP_REGNUM], 4) & ~0x3;
861 else if (rp_offset == 0)
862 pc = read_register (RP_REGNUM) & ~0x3;
864 pc = read_memory_integer (frame->frame + rp_offset, 4) & ~0x3;
867 /* If PC is inside a linker stub, then dig out the address the stub
869 u = find_unwind_entry (pc);
870 if (u && u->stub_type != 0)
876 /* We need to correct the PC and the FP for the outermost frame when we are
880 init_extra_frame_info (fromleaf, frame)
882 struct frame_info *frame;
887 if (frame->next && !fromleaf)
890 /* If the next frame represents a frameless function invocation
891 then we have to do some adjustments that are normally done by
892 FRAME_CHAIN. (FRAME_CHAIN is not called in this case.) */
895 /* Find the framesize of *this* frame without peeking at the PC
896 in the current frame structure (it isn't set yet). */
897 framesize = find_proc_framesize (FRAME_SAVED_PC (get_next_frame (frame)));
899 /* Now adjust our base frame accordingly. If we have a frame pointer
900 use it, else subtract the size of this frame from the current
901 frame. (we always want frame->frame to point at the lowest address
904 frame->frame = read_register (FP_REGNUM);
906 frame->frame -= framesize;
910 flags = read_register (FLAGS_REGNUM);
911 if (flags & 2) /* In system call? */
912 frame->pc = read_register (31) & ~0x3;
914 /* The outermost frame is always derived from PC-framesize
916 One might think frameless innermost frames should have
917 a frame->frame that is the same as the parent's frame->frame.
918 That is wrong; frame->frame in that case should be the *high*
919 address of the parent's frame. It's complicated as hell to
920 explain, but the parent *always* creates some stack space for
921 the child. So the child actually does have a frame of some
922 sorts, and its base is the high address in its parent's frame. */
923 framesize = find_proc_framesize(frame->pc);
925 frame->frame = read_register (FP_REGNUM);
927 frame->frame = read_register (SP_REGNUM) - framesize;
930 /* Given a GDB frame, determine the address of the calling function's frame.
931 This will be used to create a new GDB frame struct, and then
932 INIT_EXTRA_FRAME_INFO and INIT_FRAME_PC will be called for the new frame.
934 This may involve searching through prologues for several functions
935 at boundaries where GCC calls HP C code, or where code which has
936 a frame pointer calls code without a frame pointer. */
940 struct frame_info *frame;
942 int my_framesize, caller_framesize;
943 struct unwind_table_entry *u;
944 CORE_ADDR frame_base;
946 /* Handle HPUX, BSD, and OSF1 style interrupt frames first. These
947 are easy; at *sp we have a full save state strucutre which we can
948 pull the old stack pointer from. Also see frame_saved_pc for
949 code to dig a saved PC out of the save state structure. */
950 if (pc_in_interrupt_handler (frame->pc))
951 frame_base = read_memory_integer (frame->frame + SP_REGNUM * 4, 4);
952 else if (frame->signal_handler_caller)
954 FRAME_BASE_BEFORE_SIGTRAMP (frame, &frame_base);
957 frame_base = frame->frame;
959 /* Get frame sizes for the current frame and the frame of the
961 my_framesize = find_proc_framesize (frame->pc);
962 caller_framesize = find_proc_framesize (FRAME_SAVED_PC(frame));
964 /* If caller does not have a frame pointer, then its frame
965 can be found at current_frame - caller_framesize. */
966 if (caller_framesize != -1)
967 return frame_base - caller_framesize;
969 /* Both caller and callee have frame pointers and are GCC compiled
970 (SAVE_SP bit in unwind descriptor is on for both functions.
971 The previous frame pointer is found at the top of the current frame. */
972 if (caller_framesize == -1 && my_framesize == -1)
973 return read_memory_integer (frame_base, 4);
975 /* Caller has a frame pointer, but callee does not. This is a little
976 more difficult as GCC and HP C lay out locals and callee register save
977 areas very differently.
979 The previous frame pointer could be in a register, or in one of
980 several areas on the stack.
982 Walk from the current frame to the innermost frame examining
983 unwind descriptors to determine if %r3 ever gets saved into the
984 stack. If so return whatever value got saved into the stack.
985 If it was never saved in the stack, then the value in %r3 is still
988 We use information from unwind descriptors to determine if %r3
989 is saved into the stack (Entry_GR field has this information). */
993 u = find_unwind_entry (frame->pc);
997 /* We could find this information by examining prologues. I don't
998 think anyone has actually written any tools (not even "strip")
999 which leave them out of an executable, so maybe this is a moot
1001 warning ("Unable to find unwind for PC 0x%x -- Help!", frame->pc);
1005 /* Entry_GR specifies the number of callee-saved general registers
1006 saved in the stack. It starts at %r3, so %r3 would be 1. */
1007 if (u->Entry_GR >= 1 || u->Save_SP
1008 || frame->signal_handler_caller
1009 || pc_in_interrupt_handler (frame->pc))
1012 frame = frame->next;
1017 /* We may have walked down the chain into a function with a frame
1020 && !frame->signal_handler_caller
1021 && !pc_in_interrupt_handler (frame->pc))
1022 return read_memory_integer (frame->frame, 4);
1023 /* %r3 was saved somewhere in the stack. Dig it out. */
1026 struct frame_saved_regs saved_regs;
1028 get_frame_saved_regs (frame, &saved_regs);
1029 return read_memory_integer (saved_regs.regs[FP_REGNUM], 4);
1034 /* The value in %r3 was never saved into the stack (thus %r3 still
1035 holds the value of the previous frame pointer). */
1036 return read_register (FP_REGNUM);
1041 /* To see if a frame chain is valid, see if the caller looks like it
1042 was compiled with gcc. */
1045 frame_chain_valid (chain, thisframe)
1047 struct frame_info *thisframe;
1049 struct minimal_symbol *msym_us;
1050 struct minimal_symbol *msym_start;
1051 struct unwind_table_entry *u, *next_u = NULL;
1052 struct frame_info *next;
1057 u = find_unwind_entry (thisframe->pc);
1062 /* We can't just check that the same of msym_us is "_start", because
1063 someone idiotically decided that they were going to make a Ltext_end
1064 symbol with the same address. This Ltext_end symbol is totally
1065 indistinguishable (as nearly as I can tell) from the symbol for a function
1066 which is (legitimately, since it is in the user's namespace)
1067 named Ltext_end, so we can't just ignore it. */
1068 msym_us = lookup_minimal_symbol_by_pc (FRAME_SAVED_PC (thisframe));
1069 msym_start = lookup_minimal_symbol ("_start", NULL, NULL);
1072 && SYMBOL_VALUE_ADDRESS (msym_us) == SYMBOL_VALUE_ADDRESS (msym_start))
1075 next = get_next_frame (thisframe);
1077 next_u = find_unwind_entry (next->pc);
1079 /* If this frame does not save SP, has no stack, isn't a stub,
1080 and doesn't "call" an interrupt routine or signal handler caller,
1081 then its not valid. */
1082 if (u->Save_SP || u->Total_frame_size || u->stub_type != 0
1083 || (thisframe->next && thisframe->next->signal_handler_caller)
1084 || (next_u && next_u->HP_UX_interrupt_marker))
1087 if (pc_in_linker_stub (thisframe->pc))
1094 * These functions deal with saving and restoring register state
1095 * around a function call in the inferior. They keep the stack
1096 * double-word aligned; eventually, on an hp700, the stack will have
1097 * to be aligned to a 64-byte boundary.
1101 push_dummy_frame (inf_status)
1102 struct inferior_status *inf_status;
1104 CORE_ADDR sp, pc, pcspace;
1105 register int regnum;
1109 /* Oh, what a hack. If we're trying to perform an inferior call
1110 while the inferior is asleep, we have to make sure to clear
1111 the "in system call" bit in the flag register (the call will
1112 start after the syscall returns, so we're no longer in the system
1113 call!) This state is kept in "inf_status", change it there.
1115 We also need a number of horrid hacks to deal with lossage in the
1116 PC queue registers (apparently they're not valid when the in syscall
1118 pc = target_read_pc (inferior_pid);
1119 int_buffer = read_register (FLAGS_REGNUM);
1120 if (int_buffer & 0x2)
1124 memcpy (inf_status->registers, &int_buffer, 4);
1125 memcpy (inf_status->registers + REGISTER_BYTE (PCOQ_HEAD_REGNUM), &pc, 4);
1127 memcpy (inf_status->registers + REGISTER_BYTE (PCOQ_TAIL_REGNUM), &pc, 4);
1129 sid = (pc >> 30) & 0x3;
1131 pcspace = read_register (SR4_REGNUM);
1133 pcspace = read_register (SR4_REGNUM + 4 + sid);
1134 memcpy (inf_status->registers + REGISTER_BYTE (PCSQ_HEAD_REGNUM),
1136 memcpy (inf_status->registers + REGISTER_BYTE (PCSQ_TAIL_REGNUM),
1140 pcspace = read_register (PCSQ_HEAD_REGNUM);
1142 /* Space for "arguments"; the RP goes in here. */
1143 sp = read_register (SP_REGNUM) + 48;
1144 int_buffer = read_register (RP_REGNUM) | 0x3;
1145 write_memory (sp - 20, (char *)&int_buffer, 4);
1147 int_buffer = read_register (FP_REGNUM);
1148 write_memory (sp, (char *)&int_buffer, 4);
1150 write_register (FP_REGNUM, sp);
1154 for (regnum = 1; regnum < 32; regnum++)
1155 if (regnum != RP_REGNUM && regnum != FP_REGNUM)
1156 sp = push_word (sp, read_register (regnum));
1160 for (regnum = FP0_REGNUM; regnum < NUM_REGS; regnum++)
1162 read_register_bytes (REGISTER_BYTE (regnum), (char *)&freg_buffer, 8);
1163 sp = push_bytes (sp, (char *)&freg_buffer, 8);
1165 sp = push_word (sp, read_register (IPSW_REGNUM));
1166 sp = push_word (sp, read_register (SAR_REGNUM));
1167 sp = push_word (sp, pc);
1168 sp = push_word (sp, pcspace);
1169 sp = push_word (sp, pc + 4);
1170 sp = push_word (sp, pcspace);
1171 write_register (SP_REGNUM, sp);
1175 find_dummy_frame_regs (frame, frame_saved_regs)
1176 struct frame_info *frame;
1177 struct frame_saved_regs *frame_saved_regs;
1179 CORE_ADDR fp = frame->frame;
1182 frame_saved_regs->regs[RP_REGNUM] = fp - 20 & ~0x3;
1183 frame_saved_regs->regs[FP_REGNUM] = fp;
1184 frame_saved_regs->regs[1] = fp + 8;
1186 for (fp += 12, i = 3; i < 32; i++)
1190 frame_saved_regs->regs[i] = fp;
1196 for (i = FP0_REGNUM; i < NUM_REGS; i++, fp += 8)
1197 frame_saved_regs->regs[i] = fp;
1199 frame_saved_regs->regs[IPSW_REGNUM] = fp;
1200 frame_saved_regs->regs[SAR_REGNUM] = fp + 4;
1201 frame_saved_regs->regs[PCOQ_HEAD_REGNUM] = fp + 8;
1202 frame_saved_regs->regs[PCSQ_HEAD_REGNUM] = fp + 12;
1203 frame_saved_regs->regs[PCOQ_TAIL_REGNUM] = fp + 16;
1204 frame_saved_regs->regs[PCSQ_TAIL_REGNUM] = fp + 20;
1210 register struct frame_info *frame = get_current_frame ();
1211 register CORE_ADDR fp, npc, target_pc;
1212 register int regnum;
1213 struct frame_saved_regs fsr;
1216 fp = FRAME_FP (frame);
1217 get_frame_saved_regs (frame, &fsr);
1219 #ifndef NO_PC_SPACE_QUEUE_RESTORE
1220 if (fsr.regs[IPSW_REGNUM]) /* Restoring a call dummy frame */
1221 restore_pc_queue (&fsr);
1224 for (regnum = 31; regnum > 0; regnum--)
1225 if (fsr.regs[regnum])
1226 write_register (regnum, read_memory_integer (fsr.regs[regnum], 4));
1228 for (regnum = NUM_REGS - 1; regnum >= FP0_REGNUM ; regnum--)
1229 if (fsr.regs[regnum])
1231 read_memory (fsr.regs[regnum], (char *)&freg_buffer, 8);
1232 write_register_bytes (REGISTER_BYTE (regnum), (char *)&freg_buffer, 8);
1235 if (fsr.regs[IPSW_REGNUM])
1236 write_register (IPSW_REGNUM,
1237 read_memory_integer (fsr.regs[IPSW_REGNUM], 4));
1239 if (fsr.regs[SAR_REGNUM])
1240 write_register (SAR_REGNUM,
1241 read_memory_integer (fsr.regs[SAR_REGNUM], 4));
1243 /* If the PC was explicitly saved, then just restore it. */
1244 if (fsr.regs[PCOQ_TAIL_REGNUM])
1246 npc = read_memory_integer (fsr.regs[PCOQ_TAIL_REGNUM], 4);
1247 write_register (PCOQ_TAIL_REGNUM, npc);
1249 /* Else use the value in %rp to set the new PC. */
1252 npc = read_register (RP_REGNUM);
1253 target_write_pc (npc, 0);
1256 write_register (FP_REGNUM, read_memory_integer (fp, 4));
1258 if (fsr.regs[IPSW_REGNUM]) /* call dummy */
1259 write_register (SP_REGNUM, fp - 48);
1261 write_register (SP_REGNUM, fp);
1263 /* The PC we just restored may be inside a return trampoline. If so
1264 we want to restart the inferior and run it through the trampoline.
1266 Do this by setting a momentary breakpoint at the location the
1267 trampoline returns to.
1269 Don't skip through the trampoline if we're popping a dummy frame. */
1270 target_pc = SKIP_TRAMPOLINE_CODE (npc & ~0x3) & ~0x3;
1271 if (target_pc && !fsr.regs[IPSW_REGNUM])
1273 struct symtab_and_line sal;
1274 struct breakpoint *breakpoint;
1275 struct cleanup *old_chain;
1277 /* Set up our breakpoint. Set it to be silent as the MI code
1278 for "return_command" will print the frame we returned to. */
1279 sal = find_pc_line (target_pc, 0);
1281 breakpoint = set_momentary_breakpoint (sal, NULL, bp_finish);
1282 breakpoint->silent = 1;
1284 /* So we can clean things up. */
1285 old_chain = make_cleanup (delete_breakpoint, breakpoint);
1287 /* Start up the inferior. */
1288 proceed_to_finish = 1;
1289 proceed ((CORE_ADDR) -1, TARGET_SIGNAL_DEFAULT, 0);
1291 /* Perform our cleanups. */
1292 do_cleanups (old_chain);
1294 flush_cached_frames ();
1298 * After returning to a dummy on the stack, restore the instruction
1299 * queue space registers. */
1302 restore_pc_queue (fsr)
1303 struct frame_saved_regs *fsr;
1305 CORE_ADDR pc = read_pc ();
1306 CORE_ADDR new_pc = read_memory_integer (fsr->regs[PCOQ_HEAD_REGNUM], 4);
1307 struct target_waitstatus w;
1310 /* Advance past break instruction in the call dummy. */
1311 write_register (PCOQ_HEAD_REGNUM, pc + 4);
1312 write_register (PCOQ_TAIL_REGNUM, pc + 8);
1315 * HPUX doesn't let us set the space registers or the space
1316 * registers of the PC queue through ptrace. Boo, hiss.
1317 * Conveniently, the call dummy has this sequence of instructions
1322 * So, load up the registers and single step until we are in the
1326 write_register (21, read_memory_integer (fsr->regs[PCSQ_HEAD_REGNUM], 4));
1327 write_register (22, new_pc);
1329 for (insn_count = 0; insn_count < 3; insn_count++)
1331 /* FIXME: What if the inferior gets a signal right now? Want to
1332 merge this into wait_for_inferior (as a special kind of
1333 watchpoint? By setting a breakpoint at the end? Is there
1334 any other choice? Is there *any* way to do this stuff with
1335 ptrace() or some equivalent?). */
1337 target_wait (inferior_pid, &w);
1339 if (w.kind == TARGET_WAITKIND_SIGNALLED)
1341 stop_signal = w.value.sig;
1342 terminal_ours_for_output ();
1343 printf_unfiltered ("\nProgram terminated with signal %s, %s.\n",
1344 target_signal_to_name (stop_signal),
1345 target_signal_to_string (stop_signal));
1346 gdb_flush (gdb_stdout);
1350 target_terminal_ours ();
1351 target_fetch_registers (-1);
1356 hppa_push_arguments (nargs, args, sp, struct_return, struct_addr)
1361 CORE_ADDR struct_addr;
1363 /* array of arguments' offsets */
1364 int *offset = (int *)alloca(nargs * sizeof (int));
1368 for (i = 0; i < nargs; i++)
1370 cum += TYPE_LENGTH (VALUE_TYPE (args[i]));
1372 /* value must go at proper alignment. Assume alignment is a
1374 alignment = hppa_alignof (VALUE_TYPE (args[i]));
1375 if (cum % alignment)
1376 cum = (cum + alignment) & -alignment;
1379 sp += max ((cum + 7) & -8, 16);
1381 for (i = 0; i < nargs; i++)
1382 write_memory (sp + offset[i], VALUE_CONTENTS (args[i]),
1383 TYPE_LENGTH (VALUE_TYPE (args[i])));
1386 write_register (28, struct_addr);
1391 * Insert the specified number of args and function address
1392 * into a call sequence of the above form stored at DUMMYNAME.
1394 * On the hppa we need to call the stack dummy through $$dyncall.
1395 * Therefore our version of FIX_CALL_DUMMY takes an extra argument,
1396 * real_pc, which is the location where gdb should start up the
1397 * inferior to do the function call.
1401 hppa_fix_call_dummy (dummy, pc, fun, nargs, args, type, gcc_p)
1410 CORE_ADDR dyncall_addr, sr4export_addr;
1411 struct minimal_symbol *msymbol;
1412 int flags = read_register (FLAGS_REGNUM);
1413 struct unwind_table_entry *u;
1415 msymbol = lookup_minimal_symbol ("$$dyncall", NULL, NULL);
1416 if (msymbol == NULL)
1417 error ("Can't find an address for $$dyncall trampoline");
1419 dyncall_addr = SYMBOL_VALUE_ADDRESS (msymbol);
1421 /* FUN could be a procedure label, in which case we have to get
1422 its real address and the value of its GOT/DP. */
1425 /* Get the GOT/DP value for the target function. It's
1426 at *(fun+4). Note the call dummy is *NOT* allowed to
1427 trash %r19 before calling the target function. */
1428 write_register (19, read_memory_integer ((fun & ~0x3) + 4, 4));
1430 /* Now get the real address for the function we are calling, it's
1432 fun = (CORE_ADDR) read_memory_integer (fun & ~0x3, 4);
1437 #ifndef GDB_TARGET_IS_PA_ELF
1438 /* FUN could be either an export stub, or the real address of a
1439 function in a shared library. We must call an import stub
1440 rather than the export stub or real function for lazy binding
1441 to work correctly. */
1442 if (som_solib_get_got_by_pc (fun))
1444 struct objfile *objfile;
1445 struct minimal_symbol *funsymbol, *stub_symbol;
1446 CORE_ADDR newfun = 0;
1448 funsymbol = lookup_minimal_symbol_by_pc (fun);
1450 error ("Unable to find minimal symbol for target fucntion.\n");
1452 /* Search all the object files for an import symbol with the
1454 ALL_OBJFILES (objfile)
1456 stub_symbol = lookup_minimal_symbol (SYMBOL_NAME (funsymbol),
1458 /* Found a symbol with the right name. */
1461 struct unwind_table_entry *u;
1462 /* It must be a shared library trampoline. */
1463 if (SYMBOL_TYPE (stub_symbol) != mst_solib_trampoline)
1466 /* It must also be an import stub. */
1467 u = find_unwind_entry (SYMBOL_VALUE (stub_symbol));
1468 if (!u || u->stub_type != IMPORT)
1471 /* OK. Looks like the correct import stub. */
1472 newfun = SYMBOL_VALUE (stub_symbol);
1477 write_register (19, som_solib_get_got_by_pc (fun));
1482 /* If we are calling an import stub (eg calling into a dynamic library)
1483 then have sr4export call the magic __d_plt_call routine which is linked
1484 in from end.o. (You can't use _sr4export to call the import stub as
1485 the value in sp-24 will get fried and you end up returning to the
1486 wrong location. You can't call the import stub directly as the code
1487 to bind the PLT entry to a function can't return to a stack address.) */
1488 u = find_unwind_entry (fun);
1489 if (u && u->stub_type == IMPORT)
1492 msymbol = lookup_minimal_symbol ("__d_plt_call", NULL, NULL);
1493 if (msymbol == NULL)
1494 msymbol = lookup_minimal_symbol ("__gcc_plt_call", NULL, NULL);
1496 if (msymbol == NULL)
1497 error ("Can't find an address for __d_plt_call or __gcc_plt_call trampoline");
1499 /* This is where sr4export will jump to. */
1500 new_fun = SYMBOL_VALUE_ADDRESS (msymbol);
1502 if (strcmp (SYMBOL_NAME (msymbol), "__d_plt_call"))
1503 write_register (22, fun);
1506 /* We have to store the address of the stub in __shlib_funcptr. */
1507 msymbol = lookup_minimal_symbol ("__shlib_funcptr", NULL,
1508 (struct objfile *)NULL);
1509 if (msymbol == NULL)
1510 error ("Can't find an address for __shlib_funcptr");
1512 target_write_memory (SYMBOL_VALUE_ADDRESS (msymbol), (char *)&fun, 4);
1517 /* We still need sr4export's address too. */
1518 msymbol = lookup_minimal_symbol ("_sr4export", NULL, NULL);
1519 if (msymbol == NULL)
1520 error ("Can't find an address for _sr4export trampoline");
1522 sr4export_addr = SYMBOL_VALUE_ADDRESS (msymbol);
1524 store_unsigned_integer
1525 (&dummy[9*REGISTER_SIZE],
1527 deposit_21 (fun >> 11,
1528 extract_unsigned_integer (&dummy[9*REGISTER_SIZE],
1530 store_unsigned_integer
1531 (&dummy[10*REGISTER_SIZE],
1533 deposit_14 (fun & MASK_11,
1534 extract_unsigned_integer (&dummy[10*REGISTER_SIZE],
1536 store_unsigned_integer
1537 (&dummy[12*REGISTER_SIZE],
1539 deposit_21 (sr4export_addr >> 11,
1540 extract_unsigned_integer (&dummy[12*REGISTER_SIZE],
1542 store_unsigned_integer
1543 (&dummy[13*REGISTER_SIZE],
1545 deposit_14 (sr4export_addr & MASK_11,
1546 extract_unsigned_integer (&dummy[13*REGISTER_SIZE],
1549 write_register (22, pc);
1551 /* If we are in a syscall, then we should call the stack dummy
1552 directly. $$dyncall is not needed as the kernel sets up the
1553 space id registers properly based on the value in %r31. In
1554 fact calling $$dyncall will not work because the value in %r22
1555 will be clobbered on the syscall exit path.
1557 Similarly if the current PC is in a shared library. Note however,
1558 this scheme won't work if the shared library isn't mapped into
1559 the same space as the stack. */
1562 #ifndef GDB_TARGET_IS_PA_ELF
1563 else if (som_solib_get_got_by_pc (target_read_pc (inferior_pid)))
1567 return dyncall_addr;
1571 /* Get the PC from %r31 if currently in a syscall. Also mask out privilege
1575 target_read_pc (pid)
1578 int flags = read_register (FLAGS_REGNUM);
1581 return read_register (31) & ~0x3;
1583 return read_register (PC_REGNUM) & ~0x3;
1586 /* Write out the PC. If currently in a syscall, then also write the new
1587 PC value into %r31. */
1590 target_write_pc (v, pid)
1594 int flags = read_register (FLAGS_REGNUM);
1596 /* If in a syscall, then set %r31. Also make sure to get the
1597 privilege bits set correctly. */
1599 write_register (31, (long) (v | 0x3));
1601 write_register (PC_REGNUM, (long) v);
1602 write_register (NPC_REGNUM, (long) v + 4);
1605 /* return the alignment of a type in bytes. Structures have the maximum
1606 alignment required by their fields. */
1612 int max_align, align, i;
1613 switch (TYPE_CODE (arg))
1618 return TYPE_LENGTH (arg);
1619 case TYPE_CODE_ARRAY:
1620 return hppa_alignof (TYPE_FIELD_TYPE (arg, 0));
1621 case TYPE_CODE_STRUCT:
1622 case TYPE_CODE_UNION:
1624 for (i = 0; i < TYPE_NFIELDS (arg); i++)
1626 /* Bit fields have no real alignment. */
1627 if (!TYPE_FIELD_BITPOS (arg, i))
1629 align = hppa_alignof (TYPE_FIELD_TYPE (arg, i));
1630 max_align = max (max_align, align);
1639 /* Print the register regnum, or all registers if regnum is -1 */
1642 pa_do_registers_info (regnum, fpregs)
1646 char raw_regs [REGISTER_BYTES];
1649 for (i = 0; i < NUM_REGS; i++)
1650 read_relative_register_raw_bytes (i, raw_regs + REGISTER_BYTE (i));
1652 pa_print_registers (raw_regs, regnum, fpregs);
1653 else if (regnum < FP0_REGNUM)
1654 printf_unfiltered ("%s %x\n", reg_names[regnum], *(long *)(raw_regs +
1655 REGISTER_BYTE (regnum)));
1657 pa_print_fp_reg (regnum);
1661 pa_print_registers (raw_regs, regnum, fpregs)
1669 for (i = 0; i < 18; i++)
1671 for (j = 0; j < 4; j++)
1673 val = *(int *)(raw_regs + REGISTER_BYTE (i+(j*18)));
1674 SWAP_TARGET_AND_HOST (&val, 4);
1675 printf_unfiltered ("%8.8s: %8x ", reg_names[i+(j*18)], val);
1677 printf_unfiltered ("\n");
1681 for (i = 72; i < NUM_REGS; i++)
1682 pa_print_fp_reg (i);
1689 unsigned char raw_buffer[MAX_REGISTER_RAW_SIZE];
1690 unsigned char virtual_buffer[MAX_REGISTER_VIRTUAL_SIZE];
1692 /* Get 32bits of data. */
1693 read_relative_register_raw_bytes (i, raw_buffer);
1695 /* Put it in the buffer. No conversions are ever necessary. */
1696 memcpy (virtual_buffer, raw_buffer, REGISTER_RAW_SIZE (i));
1698 fputs_filtered (reg_names[i], gdb_stdout);
1699 print_spaces_filtered (8 - strlen (reg_names[i]), gdb_stdout);
1700 fputs_filtered ("(single precision) ", gdb_stdout);
1702 val_print (REGISTER_VIRTUAL_TYPE (i), virtual_buffer, 0, gdb_stdout, 0,
1703 1, 0, Val_pretty_default);
1704 printf_filtered ("\n");
1706 /* If "i" is even, then this register can also be a double-precision
1707 FP register. Dump it out as such. */
1710 /* Get the data in raw format for the 2nd half. */
1711 read_relative_register_raw_bytes (i + 1, raw_buffer);
1713 /* Copy it into the appropriate part of the virtual buffer. */
1714 memcpy (virtual_buffer + REGISTER_RAW_SIZE (i), raw_buffer,
1715 REGISTER_RAW_SIZE (i));
1717 /* Dump it as a double. */
1718 fputs_filtered (reg_names[i], gdb_stdout);
1719 print_spaces_filtered (8 - strlen (reg_names[i]), gdb_stdout);
1720 fputs_filtered ("(double precision) ", gdb_stdout);
1722 val_print (builtin_type_double, virtual_buffer, 0, gdb_stdout, 0,
1723 1, 0, Val_pretty_default);
1724 printf_filtered ("\n");
1728 /* Return one if PC is in the call path of a trampoline, else return zero.
1730 Note we return one for *any* call trampoline (long-call, arg-reloc), not
1731 just shared library trampolines (import, export). */
1734 in_solib_call_trampoline (pc, name)
1738 struct minimal_symbol *minsym;
1739 struct unwind_table_entry *u;
1740 static CORE_ADDR dyncall = 0;
1741 static CORE_ADDR sr4export = 0;
1743 /* FIXME XXX - dyncall and sr4export must be initialized whenever we get a
1746 /* First see if PC is in one of the two C-library trampolines. */
1749 minsym = lookup_minimal_symbol ("$$dyncall", NULL, NULL);
1751 dyncall = SYMBOL_VALUE_ADDRESS (minsym);
1758 minsym = lookup_minimal_symbol ("_sr4export", NULL, NULL);
1760 sr4export = SYMBOL_VALUE_ADDRESS (minsym);
1765 if (pc == dyncall || pc == sr4export)
1768 /* Get the unwind descriptor corresponding to PC, return zero
1769 if no unwind was found. */
1770 u = find_unwind_entry (pc);
1774 /* If this isn't a linker stub, then return now. */
1775 if (u->stub_type == 0)
1778 /* By definition a long-branch stub is a call stub. */
1779 if (u->stub_type == LONG_BRANCH)
1782 /* The call and return path execute the same instructions within
1783 an IMPORT stub! So an IMPORT stub is both a call and return
1785 if (u->stub_type == IMPORT)
1788 /* Parameter relocation stubs always have a call path and may have a
1790 if (u->stub_type == PARAMETER_RELOCATION
1791 || u->stub_type == EXPORT)
1795 /* Search forward from the current PC until we hit a branch
1796 or the end of the stub. */
1797 for (addr = pc; addr <= u->region_end; addr += 4)
1801 insn = read_memory_integer (addr, 4);
1803 /* Does it look like a bl? If so then it's the call path, if
1804 we find a bv or be first, then we're on the return path. */
1805 if ((insn & 0xfc00e000) == 0xe8000000)
1807 else if ((insn & 0xfc00e001) == 0xe800c000
1808 || (insn & 0xfc000000) == 0xe0000000)
1812 /* Should never happen. */
1813 warning ("Unable to find branch in parameter relocation stub.\n");
1817 /* Unknown stub type. For now, just return zero. */
1821 /* Return one if PC is in the return path of a trampoline, else return zero.
1823 Note we return one for *any* call trampoline (long-call, arg-reloc), not
1824 just shared library trampolines (import, export). */
1827 in_solib_return_trampoline (pc, name)
1831 struct unwind_table_entry *u;
1833 /* Get the unwind descriptor corresponding to PC, return zero
1834 if no unwind was found. */
1835 u = find_unwind_entry (pc);
1839 /* If this isn't a linker stub or it's just a long branch stub, then
1841 if (u->stub_type == 0 || u->stub_type == LONG_BRANCH)
1844 /* The call and return path execute the same instructions within
1845 an IMPORT stub! So an IMPORT stub is both a call and return
1847 if (u->stub_type == IMPORT)
1850 /* Parameter relocation stubs always have a call path and may have a
1852 if (u->stub_type == PARAMETER_RELOCATION
1853 || u->stub_type == EXPORT)
1857 /* Search forward from the current PC until we hit a branch
1858 or the end of the stub. */
1859 for (addr = pc; addr <= u->region_end; addr += 4)
1863 insn = read_memory_integer (addr, 4);
1865 /* Does it look like a bl? If so then it's the call path, if
1866 we find a bv or be first, then we're on the return path. */
1867 if ((insn & 0xfc00e000) == 0xe8000000)
1869 else if ((insn & 0xfc00e001) == 0xe800c000
1870 || (insn & 0xfc000000) == 0xe0000000)
1874 /* Should never happen. */
1875 warning ("Unable to find branch in parameter relocation stub.\n");
1879 /* Unknown stub type. For now, just return zero. */
1884 /* Figure out if PC is in a trampoline, and if so find out where
1885 the trampoline will jump to. If not in a trampoline, return zero.
1887 Simple code examination probably is not a good idea since the code
1888 sequences in trampolines can also appear in user code.
1890 We use unwinds and information from the minimal symbol table to
1891 determine when we're in a trampoline. This won't work for ELF
1892 (yet) since it doesn't create stub unwind entries. Whether or
1893 not ELF will create stub unwinds or normal unwinds for linker
1894 stubs is still being debated.
1896 This should handle simple calls through dyncall or sr4export,
1897 long calls, argument relocation stubs, and dyncall/sr4export
1898 calling an argument relocation stub. It even handles some stubs
1899 used in dynamic executables. */
1902 skip_trampoline_code (pc, name)
1907 long prev_inst, curr_inst, loc;
1908 static CORE_ADDR dyncall = 0;
1909 static CORE_ADDR sr4export = 0;
1910 struct minimal_symbol *msym;
1911 struct unwind_table_entry *u;
1913 /* FIXME XXX - dyncall and sr4export must be initialized whenever we get a
1918 msym = lookup_minimal_symbol ("$$dyncall", NULL, NULL);
1920 dyncall = SYMBOL_VALUE_ADDRESS (msym);
1927 msym = lookup_minimal_symbol ("_sr4export", NULL, NULL);
1929 sr4export = SYMBOL_VALUE_ADDRESS (msym);
1934 /* Addresses passed to dyncall may *NOT* be the actual address
1935 of the function. So we may have to do something special. */
1938 pc = (CORE_ADDR) read_register (22);
1940 /* If bit 30 (counting from the left) is on, then pc is the address of
1941 the PLT entry for this function, not the address of the function
1942 itself. Bit 31 has meaning too, but only for MPE. */
1944 pc = (CORE_ADDR) read_memory_integer (pc & ~0x3, 4);
1946 else if (pc == sr4export)
1947 pc = (CORE_ADDR) (read_register (22));
1949 /* Get the unwind descriptor corresponding to PC, return zero
1950 if no unwind was found. */
1951 u = find_unwind_entry (pc);
1955 /* If this isn't a linker stub, then return now. */
1956 if (u->stub_type == 0)
1957 return orig_pc == pc ? 0 : pc & ~0x3;
1959 /* It's a stub. Search for a branch and figure out where it goes.
1960 Note we have to handle multi insn branch sequences like ldil;ble.
1961 Most (all?) other branches can be determined by examining the contents
1962 of certain registers and the stack. */
1968 /* Make sure we haven't walked outside the range of this stub. */
1969 if (u != find_unwind_entry (loc))
1971 warning ("Unable to find branch in linker stub");
1972 return orig_pc == pc ? 0 : pc & ~0x3;
1975 prev_inst = curr_inst;
1976 curr_inst = read_memory_integer (loc, 4);
1978 /* Does it look like a branch external using %r1? Then it's the
1979 branch from the stub to the actual function. */
1980 if ((curr_inst & 0xffe0e000) == 0xe0202000)
1982 /* Yup. See if the previous instruction loaded
1983 a value into %r1. If so compute and return the jump address. */
1984 if ((prev_inst & 0xffe00000) == 0x20200000)
1985 return (extract_21 (prev_inst) + extract_17 (curr_inst)) & ~0x3;
1988 warning ("Unable to find ldil X,%%r1 before ble Y(%%sr4,%%r1).");
1989 return orig_pc == pc ? 0 : pc & ~0x3;
1993 /* Does it look like a be 0(sr0,%r21)? That's the branch from an
1994 import stub to an export stub.
1996 It is impossible to determine the target of the branch via
1997 simple examination of instructions and/or data (consider
1998 that the address in the plabel may be the address of the
1999 bind-on-reference routine in the dynamic loader).
2001 So we have try an alternative approach.
2003 Get the name of the symbol at our current location; it should
2004 be a stub symbol with the same name as the symbol in the
2007 Then lookup a minimal symbol with the same name; we should
2008 get the minimal symbol for the target routine in the shared
2009 library as those take precedence of import/export stubs. */
2010 if (curr_inst == 0xe2a00000)
2012 struct minimal_symbol *stubsym, *libsym;
2014 stubsym = lookup_minimal_symbol_by_pc (loc);
2015 if (stubsym == NULL)
2017 warning ("Unable to find symbol for 0x%x", loc);
2018 return orig_pc == pc ? 0 : pc & ~0x3;
2021 libsym = lookup_minimal_symbol (SYMBOL_NAME (stubsym), NULL, NULL);
2024 warning ("Unable to find library symbol for %s\n",
2025 SYMBOL_NAME (stubsym));
2026 return orig_pc == pc ? 0 : pc & ~0x3;
2029 return SYMBOL_VALUE (libsym);
2032 /* Does it look like bl X,%rp or bl X,%r0? Another way to do a
2033 branch from the stub to the actual function. */
2034 else if ((curr_inst & 0xffe0e000) == 0xe8400000
2035 || (curr_inst & 0xffe0e000) == 0xe8000000)
2036 return (loc + extract_17 (curr_inst) + 8) & ~0x3;
2038 /* Does it look like bv (rp)? Note this depends on the
2039 current stack pointer being the same as the stack
2040 pointer in the stub itself! This is a branch on from the
2041 stub back to the original caller. */
2042 else if ((curr_inst & 0xffe0e000) == 0xe840c000)
2044 /* Yup. See if the previous instruction loaded
2046 if (prev_inst == 0x4bc23ff1)
2047 return (read_memory_integer
2048 (read_register (SP_REGNUM) - 8, 4)) & ~0x3;
2051 warning ("Unable to find restore of %%rp before bv (%%rp).");
2052 return orig_pc == pc ? 0 : pc & ~0x3;
2056 /* What about be,n 0(sr0,%rp)? It's just another way we return to
2057 the original caller from the stub. Used in dynamic executables. */
2058 else if (curr_inst == 0xe0400002)
2060 /* The value we jump to is sitting in sp - 24. But that's
2061 loaded several instructions before the be instruction.
2062 I guess we could check for the previous instruction being
2063 mtsp %r1,%sr0 if we want to do sanity checking. */
2064 return (read_memory_integer
2065 (read_register (SP_REGNUM) - 24, 4)) & ~0x3;
2068 /* Haven't found the branch yet, but we're still in the stub.
2074 /* For the given instruction (INST), return any adjustment it makes
2075 to the stack pointer or zero for no adjustment.
2077 This only handles instructions commonly found in prologues. */
2080 prologue_inst_adjust_sp (inst)
2083 /* This must persist across calls. */
2084 static int save_high21;
2086 /* The most common way to perform a stack adjustment ldo X(sp),sp */
2087 if ((inst & 0xffffc000) == 0x37de0000)
2088 return extract_14 (inst);
2091 if ((inst & 0xffe00000) == 0x6fc00000)
2092 return extract_14 (inst);
2094 /* addil high21,%r1; ldo low11,(%r1),%r30)
2095 save high bits in save_high21 for later use. */
2096 if ((inst & 0xffe00000) == 0x28200000)
2098 save_high21 = extract_21 (inst);
2102 if ((inst & 0xffff0000) == 0x343e0000)
2103 return save_high21 + extract_14 (inst);
2105 /* fstws as used by the HP compilers. */
2106 if ((inst & 0xffffffe0) == 0x2fd01220)
2107 return extract_5_load (inst);
2109 /* No adjustment. */
2113 /* Return nonzero if INST is a branch of some kind, else return zero. */
2143 /* Return the register number for a GR which is saved by INST or
2144 zero it INST does not save a GR. */
2147 inst_saves_gr (inst)
2150 /* Does it look like a stw? */
2151 if ((inst >> 26) == 0x1a)
2152 return extract_5R_store (inst);
2154 /* Does it look like a stwm? GCC & HPC may use this in prologues. */
2155 if ((inst >> 26) == 0x1b)
2156 return extract_5R_store (inst);
2158 /* Does it look like sth or stb? HPC versions 9.0 and later use these
2160 if ((inst >> 26) == 0x19 || (inst >> 26) == 0x18)
2161 return extract_5R_store (inst);
2166 /* Return the register number for a FR which is saved by INST or
2167 zero it INST does not save a FR.
2169 Note we only care about full 64bit register stores (that's the only
2170 kind of stores the prologue will use).
2172 FIXME: What about argument stores with the HP compiler in ANSI mode? */
2175 inst_saves_fr (inst)
2178 if ((inst & 0xfc00dfc0) == 0x2c001200)
2179 return extract_5r_store (inst);
2183 /* Advance PC across any function entry prologue instructions
2184 to reach some "real" code.
2186 Use information in the unwind table to determine what exactly should
2187 be in the prologue. */
2194 unsigned long inst, stack_remaining, save_gr, save_fr, save_rp, save_sp;
2195 unsigned long args_stored, status, i;
2196 struct unwind_table_entry *u;
2198 u = find_unwind_entry (pc);
2202 /* If we are not at the beginning of a function, then return now. */
2203 if ((pc & ~0x3) != u->region_start)
2206 /* This is how much of a frame adjustment we need to account for. */
2207 stack_remaining = u->Total_frame_size << 3;
2209 /* Magic register saves we want to know about. */
2210 save_rp = u->Save_RP;
2211 save_sp = u->Save_SP;
2213 /* An indication that args may be stored into the stack. Unfortunately
2214 the HPUX compilers tend to set this in cases where no args were
2216 args_stored = u->Args_stored;
2218 /* Turn the Entry_GR field into a bitmask. */
2220 for (i = 3; i < u->Entry_GR + 3; i++)
2222 /* Frame pointer gets saved into a special location. */
2223 if (u->Save_SP && i == FP_REGNUM)
2226 save_gr |= (1 << i);
2229 /* Turn the Entry_FR field into a bitmask too. */
2231 for (i = 12; i < u->Entry_FR + 12; i++)
2232 save_fr |= (1 << i);
2234 /* Loop until we find everything of interest or hit a branch.
2236 For unoptimized GCC code and for any HP CC code this will never ever
2237 examine any user instructions.
2239 For optimzied GCC code we're faced with problems. GCC will schedule
2240 its prologue and make prologue instructions available for delay slot
2241 filling. The end result is user code gets mixed in with the prologue
2242 and a prologue instruction may be in the delay slot of the first branch
2245 Some unexpected things are expected with debugging optimized code, so
2246 we allow this routine to walk past user instructions in optimized
2248 while (save_gr || save_fr || save_rp || save_sp || stack_remaining > 0
2251 unsigned int reg_num;
2252 unsigned long old_stack_remaining, old_save_gr, old_save_fr;
2253 unsigned long old_save_rp, old_save_sp, next_inst;
2255 /* Save copies of all the triggers so we can compare them later
2257 old_save_gr = save_gr;
2258 old_save_fr = save_fr;
2259 old_save_rp = save_rp;
2260 old_save_sp = save_sp;
2261 old_stack_remaining = stack_remaining;
2263 status = target_read_memory (pc, buf, 4);
2264 inst = extract_unsigned_integer (buf, 4);
2270 /* Note the interesting effects of this instruction. */
2271 stack_remaining -= prologue_inst_adjust_sp (inst);
2273 /* There is only one instruction used for saving RP into the stack. */
2274 if (inst == 0x6bc23fd9)
2277 /* This is the only way we save SP into the stack. At this time
2278 the HP compilers never bother to save SP into the stack. */
2279 if ((inst & 0xffffc000) == 0x6fc10000)
2282 /* Account for general and floating-point register saves. */
2283 reg_num = inst_saves_gr (inst);
2284 save_gr &= ~(1 << reg_num);
2286 /* Ugh. Also account for argument stores into the stack.
2287 Unfortunately args_stored only tells us that some arguments
2288 where stored into the stack. Not how many or what kind!
2290 This is a kludge as on the HP compiler sets this bit and it
2291 never does prologue scheduling. So once we see one, skip past
2292 all of them. We have similar code for the fp arg stores below.
2294 FIXME. Can still die if we have a mix of GR and FR argument
2296 if (reg_num >= 23 && reg_num <= 26)
2298 while (reg_num >= 23 && reg_num <= 26)
2301 status = target_read_memory (pc, buf, 4);
2302 inst = extract_unsigned_integer (buf, 4);
2305 reg_num = inst_saves_gr (inst);
2311 reg_num = inst_saves_fr (inst);
2312 save_fr &= ~(1 << reg_num);
2314 status = target_read_memory (pc + 4, buf, 4);
2315 next_inst = extract_unsigned_integer (buf, 4);
2321 /* We've got to be read to handle the ldo before the fp register
2323 if ((inst & 0xfc000000) == 0x34000000
2324 && inst_saves_fr (next_inst) >= 4
2325 && inst_saves_fr (next_inst) <= 7)
2327 /* So we drop into the code below in a reasonable state. */
2328 reg_num = inst_saves_fr (next_inst);
2332 /* Ugh. Also account for argument stores into the stack.
2333 This is a kludge as on the HP compiler sets this bit and it
2334 never does prologue scheduling. So once we see one, skip past
2336 if (reg_num >= 4 && reg_num <= 7)
2338 while (reg_num >= 4 && reg_num <= 7)
2341 status = target_read_memory (pc, buf, 4);
2342 inst = extract_unsigned_integer (buf, 4);
2345 if ((inst & 0xfc000000) != 0x34000000)
2347 status = target_read_memory (pc + 4, buf, 4);
2348 next_inst = extract_unsigned_integer (buf, 4);
2351 reg_num = inst_saves_fr (next_inst);
2357 /* Quit if we hit any kind of branch. This can happen if a prologue
2358 instruction is in the delay slot of the first call/branch. */
2359 if (is_branch (inst))
2362 /* What a crock. The HP compilers set args_stored even if no
2363 arguments were stored into the stack (boo hiss). This could
2364 cause this code to then skip a bunch of user insns (up to the
2367 To combat this we try to identify when args_stored was bogusly
2368 set and clear it. We only do this when args_stored is nonzero,
2369 all other resources are accounted for, and nothing changed on
2372 && ! (save_gr || save_fr || save_rp || save_sp || stack_remaining > 0)
2373 && old_save_gr == save_gr && old_save_fr == save_fr
2374 && old_save_rp == save_rp && old_save_sp == save_sp
2375 && old_stack_remaining == stack_remaining)
2385 /* Put here the code to store, into a struct frame_saved_regs,
2386 the addresses of the saved registers of frame described by FRAME_INFO.
2387 This includes special registers such as pc and fp saved in special
2388 ways in the stack frame. sp is even more special:
2389 the address we return for it IS the sp for the next frame. */
2392 hppa_frame_find_saved_regs (frame_info, frame_saved_regs)
2393 struct frame_info *frame_info;
2394 struct frame_saved_regs *frame_saved_regs;
2397 struct unwind_table_entry *u;
2398 unsigned long inst, stack_remaining, save_gr, save_fr, save_rp, save_sp;
2403 /* Zero out everything. */
2404 memset (frame_saved_regs, '\0', sizeof (struct frame_saved_regs));
2406 /* Call dummy frames always look the same, so there's no need to
2407 examine the dummy code to determine locations of saved registers;
2408 instead, let find_dummy_frame_regs fill in the correct offsets
2409 for the saved registers. */
2410 if ((frame_info->pc >= frame_info->frame
2411 && frame_info->pc <= (frame_info->frame + CALL_DUMMY_LENGTH
2412 + 32 * 4 + (NUM_REGS - FP0_REGNUM) * 8
2414 find_dummy_frame_regs (frame_info, frame_saved_regs);
2416 /* Interrupt handlers are special too. They lay out the register
2417 state in the exact same order as the register numbers in GDB. */
2418 if (pc_in_interrupt_handler (frame_info->pc))
2420 for (i = 0; i < NUM_REGS; i++)
2422 /* SP is a little special. */
2424 frame_saved_regs->regs[SP_REGNUM]
2425 = read_memory_integer (frame_info->frame + SP_REGNUM * 4, 4);
2427 frame_saved_regs->regs[i] = frame_info->frame + i * 4;
2432 /* Handle signal handler callers. */
2433 if (frame_info->signal_handler_caller)
2435 FRAME_FIND_SAVED_REGS_IN_SIGTRAMP (frame_info, frame_saved_regs);
2439 /* Get the starting address of the function referred to by the PC
2441 pc = get_pc_function_start (frame_info->pc);
2444 u = find_unwind_entry (pc);
2448 /* This is how much of a frame adjustment we need to account for. */
2449 stack_remaining = u->Total_frame_size << 3;
2451 /* Magic register saves we want to know about. */
2452 save_rp = u->Save_RP;
2453 save_sp = u->Save_SP;
2455 /* Turn the Entry_GR field into a bitmask. */
2457 for (i = 3; i < u->Entry_GR + 3; i++)
2459 /* Frame pointer gets saved into a special location. */
2460 if (u->Save_SP && i == FP_REGNUM)
2463 save_gr |= (1 << i);
2466 /* Turn the Entry_FR field into a bitmask too. */
2468 for (i = 12; i < u->Entry_FR + 12; i++)
2469 save_fr |= (1 << i);
2471 /* The frame always represents the value of %sp at entry to the
2472 current function (and is thus equivalent to the "saved" stack
2474 frame_saved_regs->regs[SP_REGNUM] = frame_info->frame;
2476 /* Loop until we find everything of interest or hit a branch.
2478 For unoptimized GCC code and for any HP CC code this will never ever
2479 examine any user instructions.
2481 For optimzied GCC code we're faced with problems. GCC will schedule
2482 its prologue and make prologue instructions available for delay slot
2483 filling. The end result is user code gets mixed in with the prologue
2484 and a prologue instruction may be in the delay slot of the first branch
2487 Some unexpected things are expected with debugging optimized code, so
2488 we allow this routine to walk past user instructions in optimized
2490 while (save_gr || save_fr || save_rp || save_sp || stack_remaining > 0)
2492 status = target_read_memory (pc, buf, 4);
2493 inst = extract_unsigned_integer (buf, 4);
2499 /* Note the interesting effects of this instruction. */
2500 stack_remaining -= prologue_inst_adjust_sp (inst);
2502 /* There is only one instruction used for saving RP into the stack. */
2503 if (inst == 0x6bc23fd9)
2506 frame_saved_regs->regs[RP_REGNUM] = frame_info->frame - 20;
2509 /* Just note that we found the save of SP into the stack. The
2510 value for frame_saved_regs was computed above. */
2511 if ((inst & 0xffffc000) == 0x6fc10000)
2514 /* Account for general and floating-point register saves. */
2515 reg = inst_saves_gr (inst);
2516 if (reg >= 3 && reg <= 18
2517 && (!u->Save_SP || reg != FP_REGNUM))
2519 save_gr &= ~(1 << reg);
2521 /* stwm with a positive displacement is a *post modify*. */
2522 if ((inst >> 26) == 0x1b
2523 && extract_14 (inst) >= 0)
2524 frame_saved_regs->regs[reg] = frame_info->frame;
2527 /* Handle code with and without frame pointers. */
2529 frame_saved_regs->regs[reg]
2530 = frame_info->frame + extract_14 (inst);
2532 frame_saved_regs->regs[reg]
2533 = frame_info->frame + (u->Total_frame_size << 3)
2534 + extract_14 (inst);
2539 /* GCC handles callee saved FP regs a little differently.
2541 It emits an instruction to put the value of the start of
2542 the FP store area into %r1. It then uses fstds,ma with
2543 a basereg of %r1 for the stores.
2545 HP CC emits them at the current stack pointer modifying
2546 the stack pointer as it stores each register. */
2548 /* ldo X(%r3),%r1 or ldo X(%r30),%r1. */
2549 if ((inst & 0xffffc000) == 0x34610000
2550 || (inst & 0xffffc000) == 0x37c10000)
2551 fp_loc = extract_14 (inst);
2553 reg = inst_saves_fr (inst);
2554 if (reg >= 12 && reg <= 21)
2556 /* Note +4 braindamage below is necessary because the FP status
2557 registers are internally 8 registers rather than the expected
2559 save_fr &= ~(1 << reg);
2562 /* 1st HP CC FP register store. After this instruction
2563 we've set enough state that the GCC and HPCC code are
2564 both handled in the same manner. */
2565 frame_saved_regs->regs[reg + FP4_REGNUM + 4] = frame_info->frame;
2570 frame_saved_regs->regs[reg + FP0_REGNUM + 4]
2571 = frame_info->frame + fp_loc;
2576 /* Quit if we hit any kind of branch. This can happen if a prologue
2577 instruction is in the delay slot of the first call/branch. */
2578 if (is_branch (inst))
2586 #ifdef MAINTENANCE_CMDS
2589 unwind_command (exp, from_tty)
2597 struct unwind_table_entry *u;
2600 /* If we have an expression, evaluate it and use it as the address. */
2602 if (exp != 0 && *exp != 0)
2603 address = parse_and_eval_address (exp);
2607 xxx.u = find_unwind_entry (address);
2611 printf_unfiltered ("Can't find unwind table entry for PC 0x%x\n", address);
2615 printf_unfiltered ("%08x\n%08X\n%08X\n%08X\n", xxx.foo[0], xxx.foo[1], xxx.foo[2],
2618 #endif /* MAINTENANCE_CMDS */
2621 _initialize_hppa_tdep ()
2623 tm_print_insn = print_insn_hppa;
2625 #ifdef MAINTENANCE_CMDS
2626 add_cmd ("unwind", class_maintenance, unwind_command,
2627 "Print unwind table entry at given address.",
2628 &maintenanceprintlist);
2629 #endif /* MAINTENANCE_CMDS */