*** empty log message ***
[deliverable/binutils-gdb.git] / gdb / hppa-tdep.c
1 /* Target-dependent code for the HP PA architecture, for GDB.
2
3 Copyright 1986, 1987, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
4 1996, 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
5
6 Contributed by the Center for Software Science at the
7 University of Utah (pa-gdb-bugs@cs.utah.edu).
8
9 This file is part of GDB.
10
11 This program is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 2 of the License, or
14 (at your option) any later version.
15
16 This program is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
20
21 You should have received a copy of the GNU General Public License
22 along with this program; if not, write to the Free Software
23 Foundation, Inc., 59 Temple Place - Suite 330,
24 Boston, MA 02111-1307, USA. */
25
26 #include "defs.h"
27 #include "frame.h"
28 #include "bfd.h"
29 #include "inferior.h"
30 #include "value.h"
31 #include "regcache.h"
32 #include "completer.h"
33 #include "language.h"
34 #include "osabi.h"
35
36 /* For argument passing to the inferior */
37 #include "symtab.h"
38
39 #ifdef USG
40 #include <sys/types.h>
41 #endif
42
43 #include <dl.h>
44 #include <sys/param.h>
45 #include <signal.h>
46
47 #include <sys/ptrace.h>
48 #include <machine/save_state.h>
49
50 #ifdef COFF_ENCAPSULATE
51 #include "a.out.encap.h"
52 #else
53 #endif
54
55 /*#include <sys/user.h> After a.out.h */
56 #include <sys/file.h>
57 #include "gdb_stat.h"
58 #include "gdb_wait.h"
59
60 #include "gdbcore.h"
61 #include "gdbcmd.h"
62 #include "target.h"
63 #include "symfile.h"
64 #include "objfiles.h"
65
66 /* To support detection of the pseudo-initial frame
67 that threads have. */
68 #define THREAD_INITIAL_FRAME_SYMBOL "__pthread_exit"
69 #define THREAD_INITIAL_FRAME_SYM_LEN sizeof(THREAD_INITIAL_FRAME_SYMBOL)
70
71 static int extract_5_load (unsigned int);
72
73 static unsigned extract_5R_store (unsigned int);
74
75 static unsigned extract_5r_store (unsigned int);
76
77 static void find_dummy_frame_regs (struct frame_info *,
78 struct frame_saved_regs *);
79
80 static int find_proc_framesize (CORE_ADDR);
81
82 static int find_return_regnum (CORE_ADDR);
83
84 struct unwind_table_entry *find_unwind_entry (CORE_ADDR);
85
86 static int extract_17 (unsigned int);
87
88 static unsigned deposit_21 (unsigned int, unsigned int);
89
90 static int extract_21 (unsigned);
91
92 static unsigned deposit_14 (int, unsigned int);
93
94 static int extract_14 (unsigned);
95
96 static void unwind_command (char *, int);
97
98 static int low_sign_extend (unsigned int, unsigned int);
99
100 static int sign_extend (unsigned int, unsigned int);
101
102 static int restore_pc_queue (struct frame_saved_regs *);
103
104 static int hppa_alignof (struct type *);
105
106 /* To support multi-threading and stepping. */
107 int hppa_prepare_to_proceed ();
108
109 static int prologue_inst_adjust_sp (unsigned long);
110
111 static int is_branch (unsigned long);
112
113 static int inst_saves_gr (unsigned long);
114
115 static int inst_saves_fr (unsigned long);
116
117 static int pc_in_interrupt_handler (CORE_ADDR);
118
119 static int pc_in_linker_stub (CORE_ADDR);
120
121 static int compare_unwind_entries (const void *, const void *);
122
123 static void read_unwind_info (struct objfile *);
124
125 static void internalize_unwinds (struct objfile *,
126 struct unwind_table_entry *,
127 asection *, unsigned int,
128 unsigned int, CORE_ADDR);
129 static void pa_print_registers (char *, int, int);
130 static void pa_strcat_registers (char *, int, int, struct ui_file *);
131 static void pa_register_look_aside (char *, int, long *);
132 static void pa_print_fp_reg (int);
133 static void pa_strcat_fp_reg (int, struct ui_file *, enum precision_type);
134 static void record_text_segment_lowaddr (bfd *, asection *, void *);
135 /* FIXME: brobecker 2002-11-07: We will likely be able to make the
136 following functions static, once we hppa is partially multiarched. */
137 int hppa_reg_struct_has_addr (int gcc_p, struct type *type);
138 int hppa_inner_than (CORE_ADDR lhs, CORE_ADDR rhs);
139 CORE_ADDR hppa_stack_align (CORE_ADDR sp);
140 int hppa_pc_requires_run_before_use (CORE_ADDR pc);
141 int hppa_instruction_nullified (void);
142 int hppa_register_byte (int reg_nr);
143 struct type * hppa_register_virtual_type (int reg_nr);
144 void hppa_store_struct_return (CORE_ADDR addr, CORE_ADDR sp);
145 int hppa_cannot_store_register (int regnum);
146 CORE_ADDR hppa_frame_args_address (struct frame_info *fi);
147 CORE_ADDR hppa_frame_locals_address (struct frame_info *fi);
148 CORE_ADDR hppa_smash_text_address (CORE_ADDR addr);
149 int hppa_coerce_float_to_double (struct type *formal, struct type *actual);
150
151 typedef struct
152 {
153 struct minimal_symbol *msym;
154 CORE_ADDR solib_handle;
155 CORE_ADDR return_val;
156 }
157 args_for_find_stub;
158
159 static int cover_find_stub_with_shl_get (PTR);
160
161 static int is_pa_2 = 0; /* False */
162
163 /* This is declared in symtab.c; set to 1 in hp-symtab-read.c */
164 extern int hp_som_som_object_present;
165
166 /* In breakpoint.c */
167 extern int exception_catchpoints_are_fragile;
168
169 /* Should call_function allocate stack space for a struct return? */
170
171 int
172 hppa_use_struct_convention (int gcc_p, struct type *type)
173 {
174 return (TYPE_LENGTH (type) > 2 * REGISTER_SIZE);
175 }
176 \f
177
178 /* Routines to extract various sized constants out of hppa
179 instructions. */
180
181 /* This assumes that no garbage lies outside of the lower bits of
182 value. */
183
184 static int
185 sign_extend (unsigned val, unsigned bits)
186 {
187 return (int) (val >> (bits - 1) ? (-1 << bits) | val : val);
188 }
189
190 /* For many immediate values the sign bit is the low bit! */
191
192 static int
193 low_sign_extend (unsigned val, unsigned bits)
194 {
195 return (int) ((val & 0x1 ? (-1 << (bits - 1)) : 0) | val >> 1);
196 }
197
198 /* extract the immediate field from a ld{bhw}s instruction */
199
200 static int
201 extract_5_load (unsigned word)
202 {
203 return low_sign_extend (word >> 16 & MASK_5, 5);
204 }
205
206 /* extract the immediate field from a break instruction */
207
208 static unsigned
209 extract_5r_store (unsigned word)
210 {
211 return (word & MASK_5);
212 }
213
214 /* extract the immediate field from a {sr}sm instruction */
215
216 static unsigned
217 extract_5R_store (unsigned word)
218 {
219 return (word >> 16 & MASK_5);
220 }
221
222 /* extract a 14 bit immediate field */
223
224 static int
225 extract_14 (unsigned word)
226 {
227 return low_sign_extend (word & MASK_14, 14);
228 }
229
230 /* deposit a 14 bit constant in a word */
231
232 static unsigned
233 deposit_14 (int opnd, unsigned word)
234 {
235 unsigned sign = (opnd < 0 ? 1 : 0);
236
237 return word | ((unsigned) opnd << 1 & MASK_14) | sign;
238 }
239
240 /* extract a 21 bit constant */
241
242 static int
243 extract_21 (unsigned word)
244 {
245 int val;
246
247 word &= MASK_21;
248 word <<= 11;
249 val = GET_FIELD (word, 20, 20);
250 val <<= 11;
251 val |= GET_FIELD (word, 9, 19);
252 val <<= 2;
253 val |= GET_FIELD (word, 5, 6);
254 val <<= 5;
255 val |= GET_FIELD (word, 0, 4);
256 val <<= 2;
257 val |= GET_FIELD (word, 7, 8);
258 return sign_extend (val, 21) << 11;
259 }
260
261 /* deposit a 21 bit constant in a word. Although 21 bit constants are
262 usually the top 21 bits of a 32 bit constant, we assume that only
263 the low 21 bits of opnd are relevant */
264
265 static unsigned
266 deposit_21 (unsigned opnd, unsigned word)
267 {
268 unsigned val = 0;
269
270 val |= GET_FIELD (opnd, 11 + 14, 11 + 18);
271 val <<= 2;
272 val |= GET_FIELD (opnd, 11 + 12, 11 + 13);
273 val <<= 2;
274 val |= GET_FIELD (opnd, 11 + 19, 11 + 20);
275 val <<= 11;
276 val |= GET_FIELD (opnd, 11 + 1, 11 + 11);
277 val <<= 1;
278 val |= GET_FIELD (opnd, 11 + 0, 11 + 0);
279 return word | val;
280 }
281
282 /* extract a 17 bit constant from branch instructions, returning the
283 19 bit signed value. */
284
285 static int
286 extract_17 (unsigned word)
287 {
288 return sign_extend (GET_FIELD (word, 19, 28) |
289 GET_FIELD (word, 29, 29) << 10 |
290 GET_FIELD (word, 11, 15) << 11 |
291 (word & 0x1) << 16, 17) << 2;
292 }
293 \f
294
295 /* Compare the start address for two unwind entries returning 1 if
296 the first address is larger than the second, -1 if the second is
297 larger than the first, and zero if they are equal. */
298
299 static int
300 compare_unwind_entries (const void *arg1, const void *arg2)
301 {
302 const struct unwind_table_entry *a = arg1;
303 const struct unwind_table_entry *b = arg2;
304
305 if (a->region_start > b->region_start)
306 return 1;
307 else if (a->region_start < b->region_start)
308 return -1;
309 else
310 return 0;
311 }
312
313 static CORE_ADDR low_text_segment_address;
314
315 static void
316 record_text_segment_lowaddr (bfd *abfd, asection *section, void *ignored)
317 {
318 if (((section->flags & (SEC_ALLOC | SEC_LOAD | SEC_READONLY))
319 == (SEC_ALLOC | SEC_LOAD | SEC_READONLY))
320 && section->vma < low_text_segment_address)
321 low_text_segment_address = section->vma;
322 }
323
324 static void
325 internalize_unwinds (struct objfile *objfile, struct unwind_table_entry *table,
326 asection *section, unsigned int entries, unsigned int size,
327 CORE_ADDR text_offset)
328 {
329 /* We will read the unwind entries into temporary memory, then
330 fill in the actual unwind table. */
331 if (size > 0)
332 {
333 unsigned long tmp;
334 unsigned i;
335 char *buf = alloca (size);
336
337 low_text_segment_address = -1;
338
339 /* If addresses are 64 bits wide, then unwinds are supposed to
340 be segment relative offsets instead of absolute addresses.
341
342 Note that when loading a shared library (text_offset != 0) the
343 unwinds are already relative to the text_offset that will be
344 passed in. */
345 if (TARGET_PTR_BIT == 64 && text_offset == 0)
346 {
347 bfd_map_over_sections (objfile->obfd,
348 record_text_segment_lowaddr, (PTR) NULL);
349
350 /* ?!? Mask off some low bits. Should this instead subtract
351 out the lowest section's filepos or something like that?
352 This looks very hokey to me. */
353 low_text_segment_address &= ~0xfff;
354 text_offset += low_text_segment_address;
355 }
356
357 bfd_get_section_contents (objfile->obfd, section, buf, 0, size);
358
359 /* Now internalize the information being careful to handle host/target
360 endian issues. */
361 for (i = 0; i < entries; i++)
362 {
363 table[i].region_start = bfd_get_32 (objfile->obfd,
364 (bfd_byte *) buf);
365 table[i].region_start += text_offset;
366 buf += 4;
367 table[i].region_end = bfd_get_32 (objfile->obfd, (bfd_byte *) buf);
368 table[i].region_end += text_offset;
369 buf += 4;
370 tmp = bfd_get_32 (objfile->obfd, (bfd_byte *) buf);
371 buf += 4;
372 table[i].Cannot_unwind = (tmp >> 31) & 0x1;
373 table[i].Millicode = (tmp >> 30) & 0x1;
374 table[i].Millicode_save_sr0 = (tmp >> 29) & 0x1;
375 table[i].Region_description = (tmp >> 27) & 0x3;
376 table[i].reserved1 = (tmp >> 26) & 0x1;
377 table[i].Entry_SR = (tmp >> 25) & 0x1;
378 table[i].Entry_FR = (tmp >> 21) & 0xf;
379 table[i].Entry_GR = (tmp >> 16) & 0x1f;
380 table[i].Args_stored = (tmp >> 15) & 0x1;
381 table[i].Variable_Frame = (tmp >> 14) & 0x1;
382 table[i].Separate_Package_Body = (tmp >> 13) & 0x1;
383 table[i].Frame_Extension_Millicode = (tmp >> 12) & 0x1;
384 table[i].Stack_Overflow_Check = (tmp >> 11) & 0x1;
385 table[i].Two_Instruction_SP_Increment = (tmp >> 10) & 0x1;
386 table[i].Ada_Region = (tmp >> 9) & 0x1;
387 table[i].cxx_info = (tmp >> 8) & 0x1;
388 table[i].cxx_try_catch = (tmp >> 7) & 0x1;
389 table[i].sched_entry_seq = (tmp >> 6) & 0x1;
390 table[i].reserved2 = (tmp >> 5) & 0x1;
391 table[i].Save_SP = (tmp >> 4) & 0x1;
392 table[i].Save_RP = (tmp >> 3) & 0x1;
393 table[i].Save_MRP_in_frame = (tmp >> 2) & 0x1;
394 table[i].extn_ptr_defined = (tmp >> 1) & 0x1;
395 table[i].Cleanup_defined = tmp & 0x1;
396 tmp = bfd_get_32 (objfile->obfd, (bfd_byte *) buf);
397 buf += 4;
398 table[i].MPE_XL_interrupt_marker = (tmp >> 31) & 0x1;
399 table[i].HP_UX_interrupt_marker = (tmp >> 30) & 0x1;
400 table[i].Large_frame = (tmp >> 29) & 0x1;
401 table[i].Pseudo_SP_Set = (tmp >> 28) & 0x1;
402 table[i].reserved4 = (tmp >> 27) & 0x1;
403 table[i].Total_frame_size = tmp & 0x7ffffff;
404
405 /* Stub unwinds are handled elsewhere. */
406 table[i].stub_unwind.stub_type = 0;
407 table[i].stub_unwind.padding = 0;
408 }
409 }
410 }
411
412 /* Read in the backtrace information stored in the `$UNWIND_START$' section of
413 the object file. This info is used mainly by find_unwind_entry() to find
414 out the stack frame size and frame pointer used by procedures. We put
415 everything on the psymbol obstack in the objfile so that it automatically
416 gets freed when the objfile is destroyed. */
417
418 static void
419 read_unwind_info (struct objfile *objfile)
420 {
421 asection *unwind_sec, *stub_unwind_sec;
422 unsigned unwind_size, stub_unwind_size, total_size;
423 unsigned index, unwind_entries;
424 unsigned stub_entries, total_entries;
425 CORE_ADDR text_offset;
426 struct obj_unwind_info *ui;
427 obj_private_data_t *obj_private;
428
429 text_offset = ANOFFSET (objfile->section_offsets, 0);
430 ui = (struct obj_unwind_info *) obstack_alloc (&objfile->psymbol_obstack,
431 sizeof (struct obj_unwind_info));
432
433 ui->table = NULL;
434 ui->cache = NULL;
435 ui->last = -1;
436
437 /* For reasons unknown the HP PA64 tools generate multiple unwinder
438 sections in a single executable. So we just iterate over every
439 section in the BFD looking for unwinder sections intead of trying
440 to do a lookup with bfd_get_section_by_name.
441
442 First determine the total size of the unwind tables so that we
443 can allocate memory in a nice big hunk. */
444 total_entries = 0;
445 for (unwind_sec = objfile->obfd->sections;
446 unwind_sec;
447 unwind_sec = unwind_sec->next)
448 {
449 if (strcmp (unwind_sec->name, "$UNWIND_START$") == 0
450 || strcmp (unwind_sec->name, ".PARISC.unwind") == 0)
451 {
452 unwind_size = bfd_section_size (objfile->obfd, unwind_sec);
453 unwind_entries = unwind_size / UNWIND_ENTRY_SIZE;
454
455 total_entries += unwind_entries;
456 }
457 }
458
459 /* Now compute the size of the stub unwinds. Note the ELF tools do not
460 use stub unwinds at the curren time. */
461 stub_unwind_sec = bfd_get_section_by_name (objfile->obfd, "$UNWIND_END$");
462
463 if (stub_unwind_sec)
464 {
465 stub_unwind_size = bfd_section_size (objfile->obfd, stub_unwind_sec);
466 stub_entries = stub_unwind_size / STUB_UNWIND_ENTRY_SIZE;
467 }
468 else
469 {
470 stub_unwind_size = 0;
471 stub_entries = 0;
472 }
473
474 /* Compute total number of unwind entries and their total size. */
475 total_entries += stub_entries;
476 total_size = total_entries * sizeof (struct unwind_table_entry);
477
478 /* Allocate memory for the unwind table. */
479 ui->table = (struct unwind_table_entry *)
480 obstack_alloc (&objfile->psymbol_obstack, total_size);
481 ui->last = total_entries - 1;
482
483 /* Now read in each unwind section and internalize the standard unwind
484 entries. */
485 index = 0;
486 for (unwind_sec = objfile->obfd->sections;
487 unwind_sec;
488 unwind_sec = unwind_sec->next)
489 {
490 if (strcmp (unwind_sec->name, "$UNWIND_START$") == 0
491 || strcmp (unwind_sec->name, ".PARISC.unwind") == 0)
492 {
493 unwind_size = bfd_section_size (objfile->obfd, unwind_sec);
494 unwind_entries = unwind_size / UNWIND_ENTRY_SIZE;
495
496 internalize_unwinds (objfile, &ui->table[index], unwind_sec,
497 unwind_entries, unwind_size, text_offset);
498 index += unwind_entries;
499 }
500 }
501
502 /* Now read in and internalize the stub unwind entries. */
503 if (stub_unwind_size > 0)
504 {
505 unsigned int i;
506 char *buf = alloca (stub_unwind_size);
507
508 /* Read in the stub unwind entries. */
509 bfd_get_section_contents (objfile->obfd, stub_unwind_sec, buf,
510 0, stub_unwind_size);
511
512 /* Now convert them into regular unwind entries. */
513 for (i = 0; i < stub_entries; i++, index++)
514 {
515 /* Clear out the next unwind entry. */
516 memset (&ui->table[index], 0, sizeof (struct unwind_table_entry));
517
518 /* Convert offset & size into region_start and region_end.
519 Stuff away the stub type into "reserved" fields. */
520 ui->table[index].region_start = bfd_get_32 (objfile->obfd,
521 (bfd_byte *) buf);
522 ui->table[index].region_start += text_offset;
523 buf += 4;
524 ui->table[index].stub_unwind.stub_type = bfd_get_8 (objfile->obfd,
525 (bfd_byte *) buf);
526 buf += 2;
527 ui->table[index].region_end
528 = ui->table[index].region_start + 4 *
529 (bfd_get_16 (objfile->obfd, (bfd_byte *) buf) - 1);
530 buf += 2;
531 }
532
533 }
534
535 /* Unwind table needs to be kept sorted. */
536 qsort (ui->table, total_entries, sizeof (struct unwind_table_entry),
537 compare_unwind_entries);
538
539 /* Keep a pointer to the unwind information. */
540 if (objfile->obj_private == NULL)
541 {
542 obj_private = (obj_private_data_t *)
543 obstack_alloc (&objfile->psymbol_obstack,
544 sizeof (obj_private_data_t));
545 obj_private->unwind_info = NULL;
546 obj_private->so_info = NULL;
547 obj_private->dp = 0;
548
549 objfile->obj_private = (PTR) obj_private;
550 }
551 obj_private = (obj_private_data_t *) objfile->obj_private;
552 obj_private->unwind_info = ui;
553 }
554
555 /* Lookup the unwind (stack backtrace) info for the given PC. We search all
556 of the objfiles seeking the unwind table entry for this PC. Each objfile
557 contains a sorted list of struct unwind_table_entry. Since we do a binary
558 search of the unwind tables, we depend upon them to be sorted. */
559
560 struct unwind_table_entry *
561 find_unwind_entry (CORE_ADDR pc)
562 {
563 int first, middle, last;
564 struct objfile *objfile;
565
566 /* A function at address 0? Not in HP-UX! */
567 if (pc == (CORE_ADDR) 0)
568 return NULL;
569
570 ALL_OBJFILES (objfile)
571 {
572 struct obj_unwind_info *ui;
573 ui = NULL;
574 if (objfile->obj_private)
575 ui = ((obj_private_data_t *) (objfile->obj_private))->unwind_info;
576
577 if (!ui)
578 {
579 read_unwind_info (objfile);
580 if (objfile->obj_private == NULL)
581 error ("Internal error reading unwind information.");
582 ui = ((obj_private_data_t *) (objfile->obj_private))->unwind_info;
583 }
584
585 /* First, check the cache */
586
587 if (ui->cache
588 && pc >= ui->cache->region_start
589 && pc <= ui->cache->region_end)
590 return ui->cache;
591
592 /* Not in the cache, do a binary search */
593
594 first = 0;
595 last = ui->last;
596
597 while (first <= last)
598 {
599 middle = (first + last) / 2;
600 if (pc >= ui->table[middle].region_start
601 && pc <= ui->table[middle].region_end)
602 {
603 ui->cache = &ui->table[middle];
604 return &ui->table[middle];
605 }
606
607 if (pc < ui->table[middle].region_start)
608 last = middle - 1;
609 else
610 first = middle + 1;
611 }
612 } /* ALL_OBJFILES() */
613 return NULL;
614 }
615
616 /* Return the adjustment necessary to make for addresses on the stack
617 as presented by hpread.c.
618
619 This is necessary because of the stack direction on the PA and the
620 bizarre way in which someone (?) decided they wanted to handle
621 frame pointerless code in GDB. */
622 int
623 hpread_adjust_stack_address (CORE_ADDR func_addr)
624 {
625 struct unwind_table_entry *u;
626
627 u = find_unwind_entry (func_addr);
628 if (!u)
629 return 0;
630 else
631 return u->Total_frame_size << 3;
632 }
633
634 /* Called to determine if PC is in an interrupt handler of some
635 kind. */
636
637 static int
638 pc_in_interrupt_handler (CORE_ADDR pc)
639 {
640 struct unwind_table_entry *u;
641 struct minimal_symbol *msym_us;
642
643 u = find_unwind_entry (pc);
644 if (!u)
645 return 0;
646
647 /* Oh joys. HPUX sets the interrupt bit for _sigreturn even though
648 its frame isn't a pure interrupt frame. Deal with this. */
649 msym_us = lookup_minimal_symbol_by_pc (pc);
650
651 return (u->HP_UX_interrupt_marker
652 && !PC_IN_SIGTRAMP (pc, SYMBOL_NAME (msym_us)));
653 }
654
655 /* Called when no unwind descriptor was found for PC. Returns 1 if it
656 appears that PC is in a linker stub.
657
658 ?!? Need to handle stubs which appear in PA64 code. */
659
660 static int
661 pc_in_linker_stub (CORE_ADDR pc)
662 {
663 int found_magic_instruction = 0;
664 int i;
665 char buf[4];
666
667 /* If unable to read memory, assume pc is not in a linker stub. */
668 if (target_read_memory (pc, buf, 4) != 0)
669 return 0;
670
671 /* We are looking for something like
672
673 ; $$dyncall jams RP into this special spot in the frame (RP')
674 ; before calling the "call stub"
675 ldw -18(sp),rp
676
677 ldsid (rp),r1 ; Get space associated with RP into r1
678 mtsp r1,sp ; Move it into space register 0
679 be,n 0(sr0),rp) ; back to your regularly scheduled program */
680
681 /* Maximum known linker stub size is 4 instructions. Search forward
682 from the given PC, then backward. */
683 for (i = 0; i < 4; i++)
684 {
685 /* If we hit something with an unwind, stop searching this direction. */
686
687 if (find_unwind_entry (pc + i * 4) != 0)
688 break;
689
690 /* Check for ldsid (rp),r1 which is the magic instruction for a
691 return from a cross-space function call. */
692 if (read_memory_integer (pc + i * 4, 4) == 0x004010a1)
693 {
694 found_magic_instruction = 1;
695 break;
696 }
697 /* Add code to handle long call/branch and argument relocation stubs
698 here. */
699 }
700
701 if (found_magic_instruction != 0)
702 return 1;
703
704 /* Now look backward. */
705 for (i = 0; i < 4; i++)
706 {
707 /* If we hit something with an unwind, stop searching this direction. */
708
709 if (find_unwind_entry (pc - i * 4) != 0)
710 break;
711
712 /* Check for ldsid (rp),r1 which is the magic instruction for a
713 return from a cross-space function call. */
714 if (read_memory_integer (pc - i * 4, 4) == 0x004010a1)
715 {
716 found_magic_instruction = 1;
717 break;
718 }
719 /* Add code to handle long call/branch and argument relocation stubs
720 here. */
721 }
722 return found_magic_instruction;
723 }
724
725 static int
726 find_return_regnum (CORE_ADDR pc)
727 {
728 struct unwind_table_entry *u;
729
730 u = find_unwind_entry (pc);
731
732 if (!u)
733 return RP_REGNUM;
734
735 if (u->Millicode)
736 return 31;
737
738 return RP_REGNUM;
739 }
740
741 /* Return size of frame, or -1 if we should use a frame pointer. */
742 static int
743 find_proc_framesize (CORE_ADDR pc)
744 {
745 struct unwind_table_entry *u;
746 struct minimal_symbol *msym_us;
747
748 /* This may indicate a bug in our callers... */
749 if (pc == (CORE_ADDR) 0)
750 return -1;
751
752 u = find_unwind_entry (pc);
753
754 if (!u)
755 {
756 if (pc_in_linker_stub (pc))
757 /* Linker stubs have a zero size frame. */
758 return 0;
759 else
760 return -1;
761 }
762
763 msym_us = lookup_minimal_symbol_by_pc (pc);
764
765 /* If Save_SP is set, and we're not in an interrupt or signal caller,
766 then we have a frame pointer. Use it. */
767 if (u->Save_SP
768 && !pc_in_interrupt_handler (pc)
769 && msym_us
770 && !PC_IN_SIGTRAMP (pc, SYMBOL_NAME (msym_us)))
771 return -1;
772
773 return u->Total_frame_size << 3;
774 }
775
776 /* Return offset from sp at which rp is saved, or 0 if not saved. */
777 static int rp_saved (CORE_ADDR);
778
779 static int
780 rp_saved (CORE_ADDR pc)
781 {
782 struct unwind_table_entry *u;
783
784 /* A function at, and thus a return PC from, address 0? Not in HP-UX! */
785 if (pc == (CORE_ADDR) 0)
786 return 0;
787
788 u = find_unwind_entry (pc);
789
790 if (!u)
791 {
792 if (pc_in_linker_stub (pc))
793 /* This is the so-called RP'. */
794 return -24;
795 else
796 return 0;
797 }
798
799 if (u->Save_RP)
800 return (TARGET_PTR_BIT == 64 ? -16 : -20);
801 else if (u->stub_unwind.stub_type != 0)
802 {
803 switch (u->stub_unwind.stub_type)
804 {
805 case EXPORT:
806 case IMPORT:
807 return -24;
808 case PARAMETER_RELOCATION:
809 return -8;
810 default:
811 return 0;
812 }
813 }
814 else
815 return 0;
816 }
817 \f
818 int
819 frameless_function_invocation (struct frame_info *frame)
820 {
821 struct unwind_table_entry *u;
822
823 u = find_unwind_entry (frame->pc);
824
825 if (u == 0)
826 return 0;
827
828 return (u->Total_frame_size == 0 && u->stub_unwind.stub_type == 0);
829 }
830
831 /* Immediately after a function call, return the saved pc.
832 Can't go through the frames for this because on some machines
833 the new frame is not set up until the new function executes
834 some instructions. */
835
836 CORE_ADDR
837 saved_pc_after_call (struct frame_info *frame)
838 {
839 int ret_regnum;
840 CORE_ADDR pc;
841 struct unwind_table_entry *u;
842
843 ret_regnum = find_return_regnum (get_frame_pc (frame));
844 pc = read_register (ret_regnum) & ~0x3;
845
846 /* If PC is in a linker stub, then we need to dig the address
847 the stub will return to out of the stack. */
848 u = find_unwind_entry (pc);
849 if (u && u->stub_unwind.stub_type != 0)
850 return FRAME_SAVED_PC (frame);
851 else
852 return pc;
853 }
854 \f
855 CORE_ADDR
856 hppa_frame_saved_pc (struct frame_info *frame)
857 {
858 CORE_ADDR pc = get_frame_pc (frame);
859 struct unwind_table_entry *u;
860 CORE_ADDR old_pc;
861 int spun_around_loop = 0;
862 int rp_offset = 0;
863
864 /* BSD, HPUX & OSF1 all lay out the hardware state in the same manner
865 at the base of the frame in an interrupt handler. Registers within
866 are saved in the exact same order as GDB numbers registers. How
867 convienent. */
868 if (pc_in_interrupt_handler (pc))
869 return read_memory_integer (frame->frame + PC_REGNUM * 4,
870 TARGET_PTR_BIT / 8) & ~0x3;
871
872 if ((frame->pc >= frame->frame
873 && frame->pc <= (frame->frame
874 /* A call dummy is sized in words, but it is
875 actually a series of instructions. Account
876 for that scaling factor. */
877 + ((REGISTER_SIZE / INSTRUCTION_SIZE)
878 * CALL_DUMMY_LENGTH)
879 /* Similarly we have to account for 64bit
880 wide register saves. */
881 + (32 * REGISTER_SIZE)
882 /* We always consider FP regs 8 bytes long. */
883 + (NUM_REGS - FP0_REGNUM) * 8
884 /* Similarly we have to account for 64bit
885 wide register saves. */
886 + (6 * REGISTER_SIZE))))
887 {
888 return read_memory_integer ((frame->frame
889 + (TARGET_PTR_BIT == 64 ? -16 : -20)),
890 TARGET_PTR_BIT / 8) & ~0x3;
891 }
892
893 #ifdef FRAME_SAVED_PC_IN_SIGTRAMP
894 /* Deal with signal handler caller frames too. */
895 if ((get_frame_type (frame) == SIGTRAMP_FRAME))
896 {
897 CORE_ADDR rp;
898 FRAME_SAVED_PC_IN_SIGTRAMP (frame, &rp);
899 return rp & ~0x3;
900 }
901 #endif
902
903 if (frameless_function_invocation (frame))
904 {
905 int ret_regnum;
906
907 ret_regnum = find_return_regnum (pc);
908
909 /* If the next frame is an interrupt frame or a signal
910 handler caller, then we need to look in the saved
911 register area to get the return pointer (the values
912 in the registers may not correspond to anything useful). */
913 if (frame->next
914 && ((get_frame_type (frame->next) == SIGTRAMP_FRAME)
915 || pc_in_interrupt_handler (frame->next->pc)))
916 {
917 struct frame_saved_regs saved_regs;
918
919 get_frame_saved_regs (frame->next, &saved_regs);
920 if (read_memory_integer (saved_regs.regs[FLAGS_REGNUM],
921 TARGET_PTR_BIT / 8) & 0x2)
922 {
923 pc = read_memory_integer (saved_regs.regs[31],
924 TARGET_PTR_BIT / 8) & ~0x3;
925
926 /* Syscalls are really two frames. The syscall stub itself
927 with a return pointer in %rp and the kernel call with
928 a return pointer in %r31. We return the %rp variant
929 if %r31 is the same as frame->pc. */
930 if (pc == frame->pc)
931 pc = read_memory_integer (saved_regs.regs[RP_REGNUM],
932 TARGET_PTR_BIT / 8) & ~0x3;
933 }
934 else
935 pc = read_memory_integer (saved_regs.regs[RP_REGNUM],
936 TARGET_PTR_BIT / 8) & ~0x3;
937 }
938 else
939 pc = read_register (ret_regnum) & ~0x3;
940 }
941 else
942 {
943 spun_around_loop = 0;
944 old_pc = pc;
945
946 restart:
947 rp_offset = rp_saved (pc);
948
949 /* Similar to code in frameless function case. If the next
950 frame is a signal or interrupt handler, then dig the right
951 information out of the saved register info. */
952 if (rp_offset == 0
953 && frame->next
954 && ((get_frame_type (frame->next) == SIGTRAMP_FRAME)
955 || pc_in_interrupt_handler (frame->next->pc)))
956 {
957 struct frame_saved_regs saved_regs;
958
959 get_frame_saved_regs (frame->next, &saved_regs);
960 if (read_memory_integer (saved_regs.regs[FLAGS_REGNUM],
961 TARGET_PTR_BIT / 8) & 0x2)
962 {
963 pc = read_memory_integer (saved_regs.regs[31],
964 TARGET_PTR_BIT / 8) & ~0x3;
965
966 /* Syscalls are really two frames. The syscall stub itself
967 with a return pointer in %rp and the kernel call with
968 a return pointer in %r31. We return the %rp variant
969 if %r31 is the same as frame->pc. */
970 if (pc == frame->pc)
971 pc = read_memory_integer (saved_regs.regs[RP_REGNUM],
972 TARGET_PTR_BIT / 8) & ~0x3;
973 }
974 else
975 pc = read_memory_integer (saved_regs.regs[RP_REGNUM],
976 TARGET_PTR_BIT / 8) & ~0x3;
977 }
978 else if (rp_offset == 0)
979 {
980 old_pc = pc;
981 pc = read_register (RP_REGNUM) & ~0x3;
982 }
983 else
984 {
985 old_pc = pc;
986 pc = read_memory_integer (frame->frame + rp_offset,
987 TARGET_PTR_BIT / 8) & ~0x3;
988 }
989 }
990
991 /* If PC is inside a linker stub, then dig out the address the stub
992 will return to.
993
994 Don't do this for long branch stubs. Why? For some unknown reason
995 _start is marked as a long branch stub in hpux10. */
996 u = find_unwind_entry (pc);
997 if (u && u->stub_unwind.stub_type != 0
998 && u->stub_unwind.stub_type != LONG_BRANCH)
999 {
1000 unsigned int insn;
1001
1002 /* If this is a dynamic executable, and we're in a signal handler,
1003 then the call chain will eventually point us into the stub for
1004 _sigreturn. Unlike most cases, we'll be pointed to the branch
1005 to the real sigreturn rather than the code after the real branch!.
1006
1007 Else, try to dig the address the stub will return to in the normal
1008 fashion. */
1009 insn = read_memory_integer (pc, 4);
1010 if ((insn & 0xfc00e000) == 0xe8000000)
1011 return (pc + extract_17 (insn) + 8) & ~0x3;
1012 else
1013 {
1014 if (old_pc == pc)
1015 spun_around_loop++;
1016
1017 if (spun_around_loop > 1)
1018 {
1019 /* We're just about to go around the loop again with
1020 no more hope of success. Die. */
1021 error ("Unable to find return pc for this frame");
1022 }
1023 else
1024 goto restart;
1025 }
1026 }
1027
1028 return pc;
1029 }
1030 \f
1031 /* We need to correct the PC and the FP for the outermost frame when we are
1032 in a system call. */
1033
1034 void
1035 init_extra_frame_info (int fromleaf, struct frame_info *frame)
1036 {
1037 int flags;
1038 int framesize;
1039
1040 if (frame->next && !fromleaf)
1041 return;
1042
1043 /* If the next frame represents a frameless function invocation
1044 then we have to do some adjustments that are normally done by
1045 FRAME_CHAIN. (FRAME_CHAIN is not called in this case.) */
1046 if (fromleaf)
1047 {
1048 /* Find the framesize of *this* frame without peeking at the PC
1049 in the current frame structure (it isn't set yet). */
1050 framesize = find_proc_framesize (FRAME_SAVED_PC (get_next_frame (frame)));
1051
1052 /* Now adjust our base frame accordingly. If we have a frame pointer
1053 use it, else subtract the size of this frame from the current
1054 frame. (we always want frame->frame to point at the lowest address
1055 in the frame). */
1056 if (framesize == -1)
1057 frame->frame = TARGET_READ_FP ();
1058 else
1059 frame->frame -= framesize;
1060 return;
1061 }
1062
1063 flags = read_register (FLAGS_REGNUM);
1064 if (flags & 2) /* In system call? */
1065 frame->pc = read_register (31) & ~0x3;
1066
1067 /* The outermost frame is always derived from PC-framesize
1068
1069 One might think frameless innermost frames should have
1070 a frame->frame that is the same as the parent's frame->frame.
1071 That is wrong; frame->frame in that case should be the *high*
1072 address of the parent's frame. It's complicated as hell to
1073 explain, but the parent *always* creates some stack space for
1074 the child. So the child actually does have a frame of some
1075 sorts, and its base is the high address in its parent's frame. */
1076 framesize = find_proc_framesize (frame->pc);
1077 if (framesize == -1)
1078 frame->frame = TARGET_READ_FP ();
1079 else
1080 frame->frame = read_register (SP_REGNUM) - framesize;
1081 }
1082 \f
1083 /* Given a GDB frame, determine the address of the calling function's frame.
1084 This will be used to create a new GDB frame struct, and then
1085 INIT_EXTRA_FRAME_INFO and INIT_FRAME_PC will be called for the new frame.
1086
1087 This may involve searching through prologues for several functions
1088 at boundaries where GCC calls HP C code, or where code which has
1089 a frame pointer calls code without a frame pointer. */
1090
1091 CORE_ADDR
1092 frame_chain (struct frame_info *frame)
1093 {
1094 int my_framesize, caller_framesize;
1095 struct unwind_table_entry *u;
1096 CORE_ADDR frame_base;
1097 struct frame_info *tmp_frame;
1098
1099 /* A frame in the current frame list, or zero. */
1100 struct frame_info *saved_regs_frame = 0;
1101 /* Where the registers were saved in saved_regs_frame.
1102 If saved_regs_frame is zero, this is garbage. */
1103 struct frame_saved_regs saved_regs;
1104
1105 CORE_ADDR caller_pc;
1106
1107 struct minimal_symbol *min_frame_symbol;
1108 struct symbol *frame_symbol;
1109 char *frame_symbol_name;
1110
1111 /* If this is a threaded application, and we see the
1112 routine "__pthread_exit", treat it as the stack root
1113 for this thread. */
1114 min_frame_symbol = lookup_minimal_symbol_by_pc (frame->pc);
1115 frame_symbol = find_pc_function (frame->pc);
1116
1117 if ((min_frame_symbol != 0) /* && (frame_symbol == 0) */ )
1118 {
1119 /* The test above for "no user function name" would defend
1120 against the slim likelihood that a user might define a
1121 routine named "__pthread_exit" and then try to debug it.
1122
1123 If it weren't commented out, and you tried to debug the
1124 pthread library itself, you'd get errors.
1125
1126 So for today, we don't make that check. */
1127 frame_symbol_name = SYMBOL_NAME (min_frame_symbol);
1128 if (frame_symbol_name != 0)
1129 {
1130 if (0 == strncmp (frame_symbol_name,
1131 THREAD_INITIAL_FRAME_SYMBOL,
1132 THREAD_INITIAL_FRAME_SYM_LEN))
1133 {
1134 /* Pretend we've reached the bottom of the stack. */
1135 return (CORE_ADDR) 0;
1136 }
1137 }
1138 } /* End of hacky code for threads. */
1139
1140 /* Handle HPUX, BSD, and OSF1 style interrupt frames first. These
1141 are easy; at *sp we have a full save state strucutre which we can
1142 pull the old stack pointer from. Also see frame_saved_pc for
1143 code to dig a saved PC out of the save state structure. */
1144 if (pc_in_interrupt_handler (frame->pc))
1145 frame_base = read_memory_integer (frame->frame + SP_REGNUM * 4,
1146 TARGET_PTR_BIT / 8);
1147 #ifdef FRAME_BASE_BEFORE_SIGTRAMP
1148 else if ((get_frame_type (frame) == SIGTRAMP_FRAME))
1149 {
1150 FRAME_BASE_BEFORE_SIGTRAMP (frame, &frame_base);
1151 }
1152 #endif
1153 else
1154 frame_base = frame->frame;
1155
1156 /* Get frame sizes for the current frame and the frame of the
1157 caller. */
1158 my_framesize = find_proc_framesize (frame->pc);
1159 caller_pc = FRAME_SAVED_PC (frame);
1160
1161 /* If we can't determine the caller's PC, then it's not likely we can
1162 really determine anything meaningful about its frame. We'll consider
1163 this to be stack bottom. */
1164 if (caller_pc == (CORE_ADDR) 0)
1165 return (CORE_ADDR) 0;
1166
1167 caller_framesize = find_proc_framesize (FRAME_SAVED_PC (frame));
1168
1169 /* If caller does not have a frame pointer, then its frame
1170 can be found at current_frame - caller_framesize. */
1171 if (caller_framesize != -1)
1172 {
1173 return frame_base - caller_framesize;
1174 }
1175 /* Both caller and callee have frame pointers and are GCC compiled
1176 (SAVE_SP bit in unwind descriptor is on for both functions.
1177 The previous frame pointer is found at the top of the current frame. */
1178 if (caller_framesize == -1 && my_framesize == -1)
1179 {
1180 return read_memory_integer (frame_base, TARGET_PTR_BIT / 8);
1181 }
1182 /* Caller has a frame pointer, but callee does not. This is a little
1183 more difficult as GCC and HP C lay out locals and callee register save
1184 areas very differently.
1185
1186 The previous frame pointer could be in a register, or in one of
1187 several areas on the stack.
1188
1189 Walk from the current frame to the innermost frame examining
1190 unwind descriptors to determine if %r3 ever gets saved into the
1191 stack. If so return whatever value got saved into the stack.
1192 If it was never saved in the stack, then the value in %r3 is still
1193 valid, so use it.
1194
1195 We use information from unwind descriptors to determine if %r3
1196 is saved into the stack (Entry_GR field has this information). */
1197
1198 for (tmp_frame = frame; tmp_frame; tmp_frame = tmp_frame->next)
1199 {
1200 u = find_unwind_entry (tmp_frame->pc);
1201
1202 if (!u)
1203 {
1204 /* We could find this information by examining prologues. I don't
1205 think anyone has actually written any tools (not even "strip")
1206 which leave them out of an executable, so maybe this is a moot
1207 point. */
1208 /* ??rehrauer: Actually, it's quite possible to stepi your way into
1209 code that doesn't have unwind entries. For example, stepping into
1210 the dynamic linker will give you a PC that has none. Thus, I've
1211 disabled this warning. */
1212 #if 0
1213 warning ("Unable to find unwind for PC 0x%x -- Help!", tmp_frame->pc);
1214 #endif
1215 return (CORE_ADDR) 0;
1216 }
1217
1218 if (u->Save_SP
1219 || (get_frame_type (tmp_frame) == SIGTRAMP_FRAME)
1220 || pc_in_interrupt_handler (tmp_frame->pc))
1221 break;
1222
1223 /* Entry_GR specifies the number of callee-saved general registers
1224 saved in the stack. It starts at %r3, so %r3 would be 1. */
1225 if (u->Entry_GR >= 1)
1226 {
1227 /* The unwind entry claims that r3 is saved here. However,
1228 in optimized code, GCC often doesn't actually save r3.
1229 We'll discover this if we look at the prologue. */
1230 get_frame_saved_regs (tmp_frame, &saved_regs);
1231 saved_regs_frame = tmp_frame;
1232
1233 /* If we have an address for r3, that's good. */
1234 if (saved_regs.regs[FP_REGNUM])
1235 break;
1236 }
1237 }
1238
1239 if (tmp_frame)
1240 {
1241 /* We may have walked down the chain into a function with a frame
1242 pointer. */
1243 if (u->Save_SP
1244 && !(get_frame_type (tmp_frame) == SIGTRAMP_FRAME)
1245 && !pc_in_interrupt_handler (tmp_frame->pc))
1246 {
1247 return read_memory_integer (tmp_frame->frame, TARGET_PTR_BIT / 8);
1248 }
1249 /* %r3 was saved somewhere in the stack. Dig it out. */
1250 else
1251 {
1252 /* Sick.
1253
1254 For optimization purposes many kernels don't have the
1255 callee saved registers into the save_state structure upon
1256 entry into the kernel for a syscall; the optimization
1257 is usually turned off if the process is being traced so
1258 that the debugger can get full register state for the
1259 process.
1260
1261 This scheme works well except for two cases:
1262
1263 * Attaching to a process when the process is in the
1264 kernel performing a system call (debugger can't get
1265 full register state for the inferior process since
1266 the process wasn't being traced when it entered the
1267 system call).
1268
1269 * Register state is not complete if the system call
1270 causes the process to core dump.
1271
1272
1273 The following heinous code is an attempt to deal with
1274 the lack of register state in a core dump. It will
1275 fail miserably if the function which performs the
1276 system call has a variable sized stack frame. */
1277
1278 if (tmp_frame != saved_regs_frame)
1279 get_frame_saved_regs (tmp_frame, &saved_regs);
1280
1281 /* Abominable hack. */
1282 if (current_target.to_has_execution == 0
1283 && ((saved_regs.regs[FLAGS_REGNUM]
1284 && (read_memory_integer (saved_regs.regs[FLAGS_REGNUM],
1285 TARGET_PTR_BIT / 8)
1286 & 0x2))
1287 || (saved_regs.regs[FLAGS_REGNUM] == 0
1288 && read_register (FLAGS_REGNUM) & 0x2)))
1289 {
1290 u = find_unwind_entry (FRAME_SAVED_PC (frame));
1291 if (!u)
1292 {
1293 return read_memory_integer (saved_regs.regs[FP_REGNUM],
1294 TARGET_PTR_BIT / 8);
1295 }
1296 else
1297 {
1298 return frame_base - (u->Total_frame_size << 3);
1299 }
1300 }
1301
1302 return read_memory_integer (saved_regs.regs[FP_REGNUM],
1303 TARGET_PTR_BIT / 8);
1304 }
1305 }
1306 else
1307 {
1308 /* Get the innermost frame. */
1309 tmp_frame = frame;
1310 while (tmp_frame->next != NULL)
1311 tmp_frame = tmp_frame->next;
1312
1313 if (tmp_frame != saved_regs_frame)
1314 get_frame_saved_regs (tmp_frame, &saved_regs);
1315
1316 /* Abominable hack. See above. */
1317 if (current_target.to_has_execution == 0
1318 && ((saved_regs.regs[FLAGS_REGNUM]
1319 && (read_memory_integer (saved_regs.regs[FLAGS_REGNUM],
1320 TARGET_PTR_BIT / 8)
1321 & 0x2))
1322 || (saved_regs.regs[FLAGS_REGNUM] == 0
1323 && read_register (FLAGS_REGNUM) & 0x2)))
1324 {
1325 u = find_unwind_entry (FRAME_SAVED_PC (frame));
1326 if (!u)
1327 {
1328 return read_memory_integer (saved_regs.regs[FP_REGNUM],
1329 TARGET_PTR_BIT / 8);
1330 }
1331 else
1332 {
1333 return frame_base - (u->Total_frame_size << 3);
1334 }
1335 }
1336
1337 /* The value in %r3 was never saved into the stack (thus %r3 still
1338 holds the value of the previous frame pointer). */
1339 return TARGET_READ_FP ();
1340 }
1341 }
1342 \f
1343
1344 /* To see if a frame chain is valid, see if the caller looks like it
1345 was compiled with gcc. */
1346
1347 int
1348 hppa_frame_chain_valid (CORE_ADDR chain, struct frame_info *thisframe)
1349 {
1350 struct minimal_symbol *msym_us;
1351 struct minimal_symbol *msym_start;
1352 struct unwind_table_entry *u, *next_u = NULL;
1353 struct frame_info *next;
1354
1355 if (!chain)
1356 return 0;
1357
1358 u = find_unwind_entry (thisframe->pc);
1359
1360 if (u == NULL)
1361 return 1;
1362
1363 /* We can't just check that the same of msym_us is "_start", because
1364 someone idiotically decided that they were going to make a Ltext_end
1365 symbol with the same address. This Ltext_end symbol is totally
1366 indistinguishable (as nearly as I can tell) from the symbol for a function
1367 which is (legitimately, since it is in the user's namespace)
1368 named Ltext_end, so we can't just ignore it. */
1369 msym_us = lookup_minimal_symbol_by_pc (FRAME_SAVED_PC (thisframe));
1370 msym_start = lookup_minimal_symbol ("_start", NULL, NULL);
1371 if (msym_us
1372 && msym_start
1373 && SYMBOL_VALUE_ADDRESS (msym_us) == SYMBOL_VALUE_ADDRESS (msym_start))
1374 return 0;
1375
1376 /* Grrrr. Some new idiot decided that they don't want _start for the
1377 PRO configurations; $START$ calls main directly.... Deal with it. */
1378 msym_start = lookup_minimal_symbol ("$START$", NULL, NULL);
1379 if (msym_us
1380 && msym_start
1381 && SYMBOL_VALUE_ADDRESS (msym_us) == SYMBOL_VALUE_ADDRESS (msym_start))
1382 return 0;
1383
1384 next = get_next_frame (thisframe);
1385 if (next)
1386 next_u = find_unwind_entry (next->pc);
1387
1388 /* If this frame does not save SP, has no stack, isn't a stub,
1389 and doesn't "call" an interrupt routine or signal handler caller,
1390 then its not valid. */
1391 if (u->Save_SP || u->Total_frame_size || u->stub_unwind.stub_type != 0
1392 || (thisframe->next && (get_frame_type (thisframe->next) == SIGTRAMP_FRAME))
1393 || (next_u && next_u->HP_UX_interrupt_marker))
1394 return 1;
1395
1396 if (pc_in_linker_stub (thisframe->pc))
1397 return 1;
1398
1399 return 0;
1400 }
1401
1402 /*
1403 These functions deal with saving and restoring register state
1404 around a function call in the inferior. They keep the stack
1405 double-word aligned; eventually, on an hp700, the stack will have
1406 to be aligned to a 64-byte boundary. */
1407
1408 void
1409 push_dummy_frame (struct inferior_status *inf_status)
1410 {
1411 CORE_ADDR sp, pc, pcspace;
1412 register int regnum;
1413 CORE_ADDR int_buffer;
1414 double freg_buffer;
1415
1416 /* Oh, what a hack. If we're trying to perform an inferior call
1417 while the inferior is asleep, we have to make sure to clear
1418 the "in system call" bit in the flag register (the call will
1419 start after the syscall returns, so we're no longer in the system
1420 call!) This state is kept in "inf_status", change it there.
1421
1422 We also need a number of horrid hacks to deal with lossage in the
1423 PC queue registers (apparently they're not valid when the in syscall
1424 bit is set). */
1425 pc = target_read_pc (inferior_ptid);
1426 int_buffer = read_register (FLAGS_REGNUM);
1427 if (int_buffer & 0x2)
1428 {
1429 unsigned int sid;
1430 int_buffer &= ~0x2;
1431 write_inferior_status_register (inf_status, 0, int_buffer);
1432 write_inferior_status_register (inf_status, PCOQ_HEAD_REGNUM, pc + 0);
1433 write_inferior_status_register (inf_status, PCOQ_TAIL_REGNUM, pc + 4);
1434 sid = (pc >> 30) & 0x3;
1435 if (sid == 0)
1436 pcspace = read_register (SR4_REGNUM);
1437 else
1438 pcspace = read_register (SR4_REGNUM + 4 + sid);
1439 write_inferior_status_register (inf_status, PCSQ_HEAD_REGNUM, pcspace);
1440 write_inferior_status_register (inf_status, PCSQ_TAIL_REGNUM, pcspace);
1441 }
1442 else
1443 pcspace = read_register (PCSQ_HEAD_REGNUM);
1444
1445 /* Space for "arguments"; the RP goes in here. */
1446 sp = read_register (SP_REGNUM) + 48;
1447 int_buffer = read_register (RP_REGNUM) | 0x3;
1448
1449 /* The 32bit and 64bit ABIs save the return pointer into different
1450 stack slots. */
1451 if (REGISTER_SIZE == 8)
1452 write_memory (sp - 16, (char *) &int_buffer, REGISTER_SIZE);
1453 else
1454 write_memory (sp - 20, (char *) &int_buffer, REGISTER_SIZE);
1455
1456 int_buffer = TARGET_READ_FP ();
1457 write_memory (sp, (char *) &int_buffer, REGISTER_SIZE);
1458
1459 write_register (FP_REGNUM, sp);
1460
1461 sp += 2 * REGISTER_SIZE;
1462
1463 for (regnum = 1; regnum < 32; regnum++)
1464 if (regnum != RP_REGNUM && regnum != FP_REGNUM)
1465 sp = push_word (sp, read_register (regnum));
1466
1467 /* This is not necessary for the 64bit ABI. In fact it is dangerous. */
1468 if (REGISTER_SIZE != 8)
1469 sp += 4;
1470
1471 for (regnum = FP0_REGNUM; regnum < NUM_REGS; regnum++)
1472 {
1473 deprecated_read_register_bytes (REGISTER_BYTE (regnum),
1474 (char *) &freg_buffer, 8);
1475 sp = push_bytes (sp, (char *) &freg_buffer, 8);
1476 }
1477 sp = push_word (sp, read_register (IPSW_REGNUM));
1478 sp = push_word (sp, read_register (SAR_REGNUM));
1479 sp = push_word (sp, pc);
1480 sp = push_word (sp, pcspace);
1481 sp = push_word (sp, pc + 4);
1482 sp = push_word (sp, pcspace);
1483 write_register (SP_REGNUM, sp);
1484 }
1485
1486 static void
1487 find_dummy_frame_regs (struct frame_info *frame,
1488 struct frame_saved_regs *frame_saved_regs)
1489 {
1490 CORE_ADDR fp = frame->frame;
1491 int i;
1492
1493 /* The 32bit and 64bit ABIs save RP into different locations. */
1494 if (REGISTER_SIZE == 8)
1495 frame_saved_regs->regs[RP_REGNUM] = (fp - 16) & ~0x3;
1496 else
1497 frame_saved_regs->regs[RP_REGNUM] = (fp - 20) & ~0x3;
1498
1499 frame_saved_regs->regs[FP_REGNUM] = fp;
1500
1501 frame_saved_regs->regs[1] = fp + (2 * REGISTER_SIZE);
1502
1503 for (fp += 3 * REGISTER_SIZE, i = 3; i < 32; i++)
1504 {
1505 if (i != FP_REGNUM)
1506 {
1507 frame_saved_regs->regs[i] = fp;
1508 fp += REGISTER_SIZE;
1509 }
1510 }
1511
1512 /* This is not necessary or desirable for the 64bit ABI. */
1513 if (REGISTER_SIZE != 8)
1514 fp += 4;
1515
1516 for (i = FP0_REGNUM; i < NUM_REGS; i++, fp += 8)
1517 frame_saved_regs->regs[i] = fp;
1518
1519 frame_saved_regs->regs[IPSW_REGNUM] = fp;
1520 frame_saved_regs->regs[SAR_REGNUM] = fp + REGISTER_SIZE;
1521 frame_saved_regs->regs[PCOQ_HEAD_REGNUM] = fp + 2 * REGISTER_SIZE;
1522 frame_saved_regs->regs[PCSQ_HEAD_REGNUM] = fp + 3 * REGISTER_SIZE;
1523 frame_saved_regs->regs[PCOQ_TAIL_REGNUM] = fp + 4 * REGISTER_SIZE;
1524 frame_saved_regs->regs[PCSQ_TAIL_REGNUM] = fp + 5 * REGISTER_SIZE;
1525 }
1526
1527 void
1528 hppa_pop_frame (void)
1529 {
1530 register struct frame_info *frame = get_current_frame ();
1531 register CORE_ADDR fp, npc, target_pc;
1532 register int regnum;
1533 struct frame_saved_regs fsr;
1534 double freg_buffer;
1535
1536 fp = get_frame_base (frame);
1537 get_frame_saved_regs (frame, &fsr);
1538
1539 #ifndef NO_PC_SPACE_QUEUE_RESTORE
1540 if (fsr.regs[IPSW_REGNUM]) /* Restoring a call dummy frame */
1541 restore_pc_queue (&fsr);
1542 #endif
1543
1544 for (regnum = 31; regnum > 0; regnum--)
1545 if (fsr.regs[regnum])
1546 write_register (regnum, read_memory_integer (fsr.regs[regnum],
1547 REGISTER_SIZE));
1548
1549 for (regnum = NUM_REGS - 1; regnum >= FP0_REGNUM; regnum--)
1550 if (fsr.regs[regnum])
1551 {
1552 read_memory (fsr.regs[regnum], (char *) &freg_buffer, 8);
1553 deprecated_write_register_bytes (REGISTER_BYTE (regnum),
1554 (char *) &freg_buffer, 8);
1555 }
1556
1557 if (fsr.regs[IPSW_REGNUM])
1558 write_register (IPSW_REGNUM,
1559 read_memory_integer (fsr.regs[IPSW_REGNUM],
1560 REGISTER_SIZE));
1561
1562 if (fsr.regs[SAR_REGNUM])
1563 write_register (SAR_REGNUM,
1564 read_memory_integer (fsr.regs[SAR_REGNUM],
1565 REGISTER_SIZE));
1566
1567 /* If the PC was explicitly saved, then just restore it. */
1568 if (fsr.regs[PCOQ_TAIL_REGNUM])
1569 {
1570 npc = read_memory_integer (fsr.regs[PCOQ_TAIL_REGNUM],
1571 REGISTER_SIZE);
1572 write_register (PCOQ_TAIL_REGNUM, npc);
1573 }
1574 /* Else use the value in %rp to set the new PC. */
1575 else
1576 {
1577 npc = read_register (RP_REGNUM);
1578 write_pc (npc);
1579 }
1580
1581 write_register (FP_REGNUM, read_memory_integer (fp, REGISTER_SIZE));
1582
1583 if (fsr.regs[IPSW_REGNUM]) /* call dummy */
1584 write_register (SP_REGNUM, fp - 48);
1585 else
1586 write_register (SP_REGNUM, fp);
1587
1588 /* The PC we just restored may be inside a return trampoline. If so
1589 we want to restart the inferior and run it through the trampoline.
1590
1591 Do this by setting a momentary breakpoint at the location the
1592 trampoline returns to.
1593
1594 Don't skip through the trampoline if we're popping a dummy frame. */
1595 target_pc = SKIP_TRAMPOLINE_CODE (npc & ~0x3) & ~0x3;
1596 if (target_pc && !fsr.regs[IPSW_REGNUM])
1597 {
1598 struct symtab_and_line sal;
1599 struct breakpoint *breakpoint;
1600 struct cleanup *old_chain;
1601
1602 /* Set up our breakpoint. Set it to be silent as the MI code
1603 for "return_command" will print the frame we returned to. */
1604 sal = find_pc_line (target_pc, 0);
1605 sal.pc = target_pc;
1606 breakpoint = set_momentary_breakpoint (sal, NULL, bp_finish);
1607 breakpoint->silent = 1;
1608
1609 /* So we can clean things up. */
1610 old_chain = make_cleanup_delete_breakpoint (breakpoint);
1611
1612 /* Start up the inferior. */
1613 clear_proceed_status ();
1614 proceed_to_finish = 1;
1615 proceed ((CORE_ADDR) -1, TARGET_SIGNAL_DEFAULT, 0);
1616
1617 /* Perform our cleanups. */
1618 do_cleanups (old_chain);
1619 }
1620 flush_cached_frames ();
1621 }
1622
1623 /* After returning to a dummy on the stack, restore the instruction
1624 queue space registers. */
1625
1626 static int
1627 restore_pc_queue (struct frame_saved_regs *fsr)
1628 {
1629 CORE_ADDR pc = read_pc ();
1630 CORE_ADDR new_pc = read_memory_integer (fsr->regs[PCOQ_HEAD_REGNUM],
1631 TARGET_PTR_BIT / 8);
1632 struct target_waitstatus w;
1633 int insn_count;
1634
1635 /* Advance past break instruction in the call dummy. */
1636 write_register (PCOQ_HEAD_REGNUM, pc + 4);
1637 write_register (PCOQ_TAIL_REGNUM, pc + 8);
1638
1639 /* HPUX doesn't let us set the space registers or the space
1640 registers of the PC queue through ptrace. Boo, hiss.
1641 Conveniently, the call dummy has this sequence of instructions
1642 after the break:
1643 mtsp r21, sr0
1644 ble,n 0(sr0, r22)
1645
1646 So, load up the registers and single step until we are in the
1647 right place. */
1648
1649 write_register (21, read_memory_integer (fsr->regs[PCSQ_HEAD_REGNUM],
1650 REGISTER_SIZE));
1651 write_register (22, new_pc);
1652
1653 for (insn_count = 0; insn_count < 3; insn_count++)
1654 {
1655 /* FIXME: What if the inferior gets a signal right now? Want to
1656 merge this into wait_for_inferior (as a special kind of
1657 watchpoint? By setting a breakpoint at the end? Is there
1658 any other choice? Is there *any* way to do this stuff with
1659 ptrace() or some equivalent?). */
1660 resume (1, 0);
1661 target_wait (inferior_ptid, &w);
1662
1663 if (w.kind == TARGET_WAITKIND_SIGNALLED)
1664 {
1665 stop_signal = w.value.sig;
1666 terminal_ours_for_output ();
1667 printf_unfiltered ("\nProgram terminated with signal %s, %s.\n",
1668 target_signal_to_name (stop_signal),
1669 target_signal_to_string (stop_signal));
1670 gdb_flush (gdb_stdout);
1671 return 0;
1672 }
1673 }
1674 target_terminal_ours ();
1675 target_fetch_registers (-1);
1676 return 1;
1677 }
1678
1679
1680 #ifdef PA20W_CALLING_CONVENTIONS
1681
1682 /* This function pushes a stack frame with arguments as part of the
1683 inferior function calling mechanism.
1684
1685 This is the version for the PA64, in which later arguments appear
1686 at higher addresses. (The stack always grows towards higher
1687 addresses.)
1688
1689 We simply allocate the appropriate amount of stack space and put
1690 arguments into their proper slots. The call dummy code will copy
1691 arguments into registers as needed by the ABI.
1692
1693 This ABI also requires that the caller provide an argument pointer
1694 to the callee, so we do that too. */
1695
1696 CORE_ADDR
1697 hppa_push_arguments (int nargs, struct value **args, CORE_ADDR sp,
1698 int struct_return, CORE_ADDR struct_addr)
1699 {
1700 /* array of arguments' offsets */
1701 int *offset = (int *) alloca (nargs * sizeof (int));
1702
1703 /* array of arguments' lengths: real lengths in bytes, not aligned to
1704 word size */
1705 int *lengths = (int *) alloca (nargs * sizeof (int));
1706
1707 /* The value of SP as it was passed into this function after
1708 aligning. */
1709 CORE_ADDR orig_sp = STACK_ALIGN (sp);
1710
1711 /* The number of stack bytes occupied by the current argument. */
1712 int bytes_reserved;
1713
1714 /* The total number of bytes reserved for the arguments. */
1715 int cum_bytes_reserved = 0;
1716
1717 /* Similarly, but aligned. */
1718 int cum_bytes_aligned = 0;
1719 int i;
1720
1721 /* Iterate over each argument provided by the user. */
1722 for (i = 0; i < nargs; i++)
1723 {
1724 struct type *arg_type = VALUE_TYPE (args[i]);
1725
1726 /* Integral scalar values smaller than a register are padded on
1727 the left. We do this by promoting them to full-width,
1728 although the ABI says to pad them with garbage. */
1729 if (is_integral_type (arg_type)
1730 && TYPE_LENGTH (arg_type) < REGISTER_SIZE)
1731 {
1732 args[i] = value_cast ((TYPE_UNSIGNED (arg_type)
1733 ? builtin_type_unsigned_long
1734 : builtin_type_long),
1735 args[i]);
1736 arg_type = VALUE_TYPE (args[i]);
1737 }
1738
1739 lengths[i] = TYPE_LENGTH (arg_type);
1740
1741 /* Align the size of the argument to the word size for this
1742 target. */
1743 bytes_reserved = (lengths[i] + REGISTER_SIZE - 1) & -REGISTER_SIZE;
1744
1745 offset[i] = cum_bytes_reserved;
1746
1747 /* Aggregates larger than eight bytes (the only types larger
1748 than eight bytes we have) are aligned on a 16-byte boundary,
1749 possibly padded on the right with garbage. This may leave an
1750 empty word on the stack, and thus an unused register, as per
1751 the ABI. */
1752 if (bytes_reserved > 8)
1753 {
1754 /* Round up the offset to a multiple of two slots. */
1755 int new_offset = ((offset[i] + 2*REGISTER_SIZE-1)
1756 & -(2*REGISTER_SIZE));
1757
1758 /* Note the space we've wasted, if any. */
1759 bytes_reserved += new_offset - offset[i];
1760 offset[i] = new_offset;
1761 }
1762
1763 cum_bytes_reserved += bytes_reserved;
1764 }
1765
1766 /* CUM_BYTES_RESERVED already accounts for all the arguments
1767 passed by the user. However, the ABIs mandate minimum stack space
1768 allocations for outgoing arguments.
1769
1770 The ABIs also mandate minimum stack alignments which we must
1771 preserve. */
1772 cum_bytes_aligned = STACK_ALIGN (cum_bytes_reserved);
1773 sp += max (cum_bytes_aligned, REG_PARM_STACK_SPACE);
1774
1775 /* Now write each of the args at the proper offset down the stack. */
1776 for (i = 0; i < nargs; i++)
1777 write_memory (orig_sp + offset[i], VALUE_CONTENTS (args[i]), lengths[i]);
1778
1779 /* If a structure has to be returned, set up register 28 to hold its
1780 address */
1781 if (struct_return)
1782 write_register (28, struct_addr);
1783
1784 /* For the PA64 we must pass a pointer to the outgoing argument list.
1785 The ABI mandates that the pointer should point to the first byte of
1786 storage beyond the register flushback area.
1787
1788 However, the call dummy expects the outgoing argument pointer to
1789 be passed in register %r4. */
1790 write_register (4, orig_sp + REG_PARM_STACK_SPACE);
1791
1792 /* ?!? This needs further work. We need to set up the global data
1793 pointer for this procedure. This assumes the same global pointer
1794 for every procedure. The call dummy expects the dp value to
1795 be passed in register %r6. */
1796 write_register (6, read_register (27));
1797
1798 /* The stack will have 64 bytes of additional space for a frame marker. */
1799 return sp + 64;
1800 }
1801
1802 #else
1803
1804 /* This function pushes a stack frame with arguments as part of the
1805 inferior function calling mechanism.
1806
1807 This is the version of the function for the 32-bit PA machines, in
1808 which later arguments appear at lower addresses. (The stack always
1809 grows towards higher addresses.)
1810
1811 We simply allocate the appropriate amount of stack space and put
1812 arguments into their proper slots. The call dummy code will copy
1813 arguments into registers as needed by the ABI. */
1814
1815 CORE_ADDR
1816 hppa_push_arguments (int nargs, struct value **args, CORE_ADDR sp,
1817 int struct_return, CORE_ADDR struct_addr)
1818 {
1819 /* array of arguments' offsets */
1820 int *offset = (int *) alloca (nargs * sizeof (int));
1821
1822 /* array of arguments' lengths: real lengths in bytes, not aligned to
1823 word size */
1824 int *lengths = (int *) alloca (nargs * sizeof (int));
1825
1826 /* The number of stack bytes occupied by the current argument. */
1827 int bytes_reserved;
1828
1829 /* The total number of bytes reserved for the arguments. */
1830 int cum_bytes_reserved = 0;
1831
1832 /* Similarly, but aligned. */
1833 int cum_bytes_aligned = 0;
1834 int i;
1835
1836 /* Iterate over each argument provided by the user. */
1837 for (i = 0; i < nargs; i++)
1838 {
1839 lengths[i] = TYPE_LENGTH (VALUE_TYPE (args[i]));
1840
1841 /* Align the size of the argument to the word size for this
1842 target. */
1843 bytes_reserved = (lengths[i] + REGISTER_SIZE - 1) & -REGISTER_SIZE;
1844
1845 offset[i] = (cum_bytes_reserved
1846 + (lengths[i] > 4 ? bytes_reserved : lengths[i]));
1847
1848 /* If the argument is a double word argument, then it needs to be
1849 double word aligned. */
1850 if ((bytes_reserved == 2 * REGISTER_SIZE)
1851 && (offset[i] % 2 * REGISTER_SIZE))
1852 {
1853 int new_offset = 0;
1854 /* BYTES_RESERVED is already aligned to the word, so we put
1855 the argument at one word more down the stack.
1856
1857 This will leave one empty word on the stack, and one unused
1858 register as mandated by the ABI. */
1859 new_offset = ((offset[i] + 2 * REGISTER_SIZE - 1)
1860 & -(2 * REGISTER_SIZE));
1861
1862 if ((new_offset - offset[i]) >= 2 * REGISTER_SIZE)
1863 {
1864 bytes_reserved += REGISTER_SIZE;
1865 offset[i] += REGISTER_SIZE;
1866 }
1867 }
1868
1869 cum_bytes_reserved += bytes_reserved;
1870
1871 }
1872
1873 /* CUM_BYTES_RESERVED already accounts for all the arguments passed
1874 by the user. However, the ABI mandates minimum stack space
1875 allocations for outgoing arguments.
1876
1877 The ABI also mandates minimum stack alignments which we must
1878 preserve. */
1879 cum_bytes_aligned = STACK_ALIGN (cum_bytes_reserved);
1880 sp += max (cum_bytes_aligned, REG_PARM_STACK_SPACE);
1881
1882 /* Now write each of the args at the proper offset down the stack.
1883 ?!? We need to promote values to a full register instead of skipping
1884 words in the stack. */
1885 for (i = 0; i < nargs; i++)
1886 write_memory (sp - offset[i], VALUE_CONTENTS (args[i]), lengths[i]);
1887
1888 /* If a structure has to be returned, set up register 28 to hold its
1889 address */
1890 if (struct_return)
1891 write_register (28, struct_addr);
1892
1893 /* The stack will have 32 bytes of additional space for a frame marker. */
1894 return sp + 32;
1895 }
1896
1897 #endif
1898
1899 /* elz: this function returns a value which is built looking at the given address.
1900 It is called from call_function_by_hand, in case we need to return a
1901 value which is larger than 64 bits, and it is stored in the stack rather than
1902 in the registers r28 and r29 or fr4.
1903 This function does the same stuff as value_being_returned in values.c, but
1904 gets the value from the stack rather than from the buffer where all the
1905 registers were saved when the function called completed. */
1906 struct value *
1907 hppa_value_returned_from_stack (register struct type *valtype, CORE_ADDR addr)
1908 {
1909 register struct value *val;
1910
1911 val = allocate_value (valtype);
1912 CHECK_TYPEDEF (valtype);
1913 target_read_memory (addr, VALUE_CONTENTS_RAW (val), TYPE_LENGTH (valtype));
1914
1915 return val;
1916 }
1917
1918
1919
1920 /* elz: Used to lookup a symbol in the shared libraries.
1921 This function calls shl_findsym, indirectly through a
1922 call to __d_shl_get. __d_shl_get is in end.c, which is always
1923 linked in by the hp compilers/linkers.
1924 The call to shl_findsym cannot be made directly because it needs
1925 to be active in target address space.
1926 inputs: - minimal symbol pointer for the function we want to look up
1927 - address in target space of the descriptor for the library
1928 where we want to look the symbol up.
1929 This address is retrieved using the
1930 som_solib_get_solib_by_pc function (somsolib.c).
1931 output: - real address in the library of the function.
1932 note: the handle can be null, in which case shl_findsym will look for
1933 the symbol in all the loaded shared libraries.
1934 files to look at if you need reference on this stuff:
1935 dld.c, dld_shl_findsym.c
1936 end.c
1937 man entry for shl_findsym */
1938
1939 CORE_ADDR
1940 find_stub_with_shl_get (struct minimal_symbol *function, CORE_ADDR handle)
1941 {
1942 struct symbol *get_sym, *symbol2;
1943 struct minimal_symbol *buff_minsym, *msymbol;
1944 struct type *ftype;
1945 struct value **args;
1946 struct value *funcval;
1947 struct value *val;
1948
1949 int x, namelen, err_value, tmp = -1;
1950 CORE_ADDR endo_buff_addr, value_return_addr, errno_return_addr;
1951 CORE_ADDR stub_addr;
1952
1953
1954 args = alloca (sizeof (struct value *) * 8); /* 6 for the arguments and one null one??? */
1955 funcval = find_function_in_inferior ("__d_shl_get");
1956 get_sym = lookup_symbol ("__d_shl_get", NULL, VAR_NAMESPACE, NULL, NULL);
1957 buff_minsym = lookup_minimal_symbol ("__buffer", NULL, NULL);
1958 msymbol = lookup_minimal_symbol ("__shldp", NULL, NULL);
1959 symbol2 = lookup_symbol ("__shldp", NULL, VAR_NAMESPACE, NULL, NULL);
1960 endo_buff_addr = SYMBOL_VALUE_ADDRESS (buff_minsym);
1961 namelen = strlen (SYMBOL_NAME (function));
1962 value_return_addr = endo_buff_addr + namelen;
1963 ftype = check_typedef (SYMBOL_TYPE (get_sym));
1964
1965 /* do alignment */
1966 if ((x = value_return_addr % 64) != 0)
1967 value_return_addr = value_return_addr + 64 - x;
1968
1969 errno_return_addr = value_return_addr + 64;
1970
1971
1972 /* set up stuff needed by __d_shl_get in buffer in end.o */
1973
1974 target_write_memory (endo_buff_addr, SYMBOL_NAME (function), namelen);
1975
1976 target_write_memory (value_return_addr, (char *) &tmp, 4);
1977
1978 target_write_memory (errno_return_addr, (char *) &tmp, 4);
1979
1980 target_write_memory (SYMBOL_VALUE_ADDRESS (msymbol),
1981 (char *) &handle, 4);
1982
1983 /* now prepare the arguments for the call */
1984
1985 args[0] = value_from_longest (TYPE_FIELD_TYPE (ftype, 0), 12);
1986 args[1] = value_from_pointer (TYPE_FIELD_TYPE (ftype, 1), SYMBOL_VALUE_ADDRESS (msymbol));
1987 args[2] = value_from_pointer (TYPE_FIELD_TYPE (ftype, 2), endo_buff_addr);
1988 args[3] = value_from_longest (TYPE_FIELD_TYPE (ftype, 3), TYPE_PROCEDURE);
1989 args[4] = value_from_pointer (TYPE_FIELD_TYPE (ftype, 4), value_return_addr);
1990 args[5] = value_from_pointer (TYPE_FIELD_TYPE (ftype, 5), errno_return_addr);
1991
1992 /* now call the function */
1993
1994 val = call_function_by_hand (funcval, 6, args);
1995
1996 /* now get the results */
1997
1998 target_read_memory (errno_return_addr, (char *) &err_value, sizeof (err_value));
1999
2000 target_read_memory (value_return_addr, (char *) &stub_addr, sizeof (stub_addr));
2001 if (stub_addr <= 0)
2002 error ("call to __d_shl_get failed, error code is %d", err_value);
2003
2004 return (stub_addr);
2005 }
2006
2007 /* Cover routine for find_stub_with_shl_get to pass to catch_errors */
2008 static int
2009 cover_find_stub_with_shl_get (PTR args_untyped)
2010 {
2011 args_for_find_stub *args = args_untyped;
2012 args->return_val = find_stub_with_shl_get (args->msym, args->solib_handle);
2013 return 0;
2014 }
2015
2016 /* Insert the specified number of args and function address
2017 into a call sequence of the above form stored at DUMMYNAME.
2018
2019 On the hppa we need to call the stack dummy through $$dyncall.
2020 Therefore our version of FIX_CALL_DUMMY takes an extra argument,
2021 real_pc, which is the location where gdb should start up the
2022 inferior to do the function call.
2023
2024 This has to work across several versions of hpux, bsd, osf1. It has to
2025 work regardless of what compiler was used to build the inferior program.
2026 It should work regardless of whether or not end.o is available. It has
2027 to work even if gdb can not call into the dynamic loader in the inferior
2028 to query it for symbol names and addresses.
2029
2030 Yes, all those cases should work. Luckily code exists to handle most
2031 of them. The complexity is in selecting exactly what scheme should
2032 be used to perform the inferior call.
2033
2034 At the current time this routine is known not to handle cases where
2035 the program was linked with HP's compiler without including end.o.
2036
2037 Please contact Jeff Law (law@cygnus.com) before changing this code. */
2038
2039 CORE_ADDR
2040 hppa_fix_call_dummy (char *dummy, CORE_ADDR pc, CORE_ADDR fun, int nargs,
2041 struct value **args, struct type *type, int gcc_p)
2042 {
2043 CORE_ADDR dyncall_addr;
2044 struct minimal_symbol *msymbol;
2045 struct minimal_symbol *trampoline;
2046 int flags = read_register (FLAGS_REGNUM);
2047 struct unwind_table_entry *u = NULL;
2048 CORE_ADDR new_stub = 0;
2049 CORE_ADDR solib_handle = 0;
2050
2051 /* Nonzero if we will use GCC's PLT call routine. This routine must be
2052 passed an import stub, not a PLABEL. It is also necessary to set %r19
2053 (the PIC register) before performing the call.
2054
2055 If zero, then we are using __d_plt_call (HP's PLT call routine) or we
2056 are calling the target directly. When using __d_plt_call we want to
2057 use a PLABEL instead of an import stub. */
2058 int using_gcc_plt_call = 1;
2059
2060 #ifdef GDB_TARGET_IS_HPPA_20W
2061 /* We currently use completely different code for the PA2.0W inferior
2062 function call sequences. This needs to be cleaned up. */
2063 {
2064 CORE_ADDR pcsqh, pcsqt, pcoqh, pcoqt, sr5;
2065 struct target_waitstatus w;
2066 int inst1, inst2;
2067 char buf[4];
2068 int status;
2069 struct objfile *objfile;
2070
2071 /* We can not modify the PC space queues directly, so we start
2072 up the inferior and execute a couple instructions to set the
2073 space queues so that they point to the call dummy in the stack. */
2074 pcsqh = read_register (PCSQ_HEAD_REGNUM);
2075 sr5 = read_register (SR5_REGNUM);
2076 if (1)
2077 {
2078 pcoqh = read_register (PCOQ_HEAD_REGNUM);
2079 pcoqt = read_register (PCOQ_TAIL_REGNUM);
2080 if (target_read_memory (pcoqh, buf, 4) != 0)
2081 error ("Couldn't modify space queue\n");
2082 inst1 = extract_unsigned_integer (buf, 4);
2083
2084 if (target_read_memory (pcoqt, buf, 4) != 0)
2085 error ("Couldn't modify space queue\n");
2086 inst2 = extract_unsigned_integer (buf, 4);
2087
2088 /* BVE (r1) */
2089 *((int *) buf) = 0xe820d000;
2090 if (target_write_memory (pcoqh, buf, 4) != 0)
2091 error ("Couldn't modify space queue\n");
2092
2093 /* NOP */
2094 *((int *) buf) = 0x08000240;
2095 if (target_write_memory (pcoqt, buf, 4) != 0)
2096 {
2097 *((int *) buf) = inst1;
2098 target_write_memory (pcoqh, buf, 4);
2099 error ("Couldn't modify space queue\n");
2100 }
2101
2102 write_register (1, pc);
2103
2104 /* Single step twice, the BVE instruction will set the space queue
2105 such that it points to the PC value written immediately above
2106 (ie the call dummy). */
2107 resume (1, 0);
2108 target_wait (inferior_ptid, &w);
2109 resume (1, 0);
2110 target_wait (inferior_ptid, &w);
2111
2112 /* Restore the two instructions at the old PC locations. */
2113 *((int *) buf) = inst1;
2114 target_write_memory (pcoqh, buf, 4);
2115 *((int *) buf) = inst2;
2116 target_write_memory (pcoqt, buf, 4);
2117 }
2118
2119 /* The call dummy wants the ultimate destination address initially
2120 in register %r5. */
2121 write_register (5, fun);
2122
2123 /* We need to see if this objfile has a different DP value than our
2124 own (it could be a shared library for example). */
2125 ALL_OBJFILES (objfile)
2126 {
2127 struct obj_section *s;
2128 obj_private_data_t *obj_private;
2129
2130 /* See if FUN is in any section within this shared library. */
2131 for (s = objfile->sections; s < objfile->sections_end; s++)
2132 if (s->addr <= fun && fun < s->endaddr)
2133 break;
2134
2135 if (s >= objfile->sections_end)
2136 continue;
2137
2138 obj_private = (obj_private_data_t *) objfile->obj_private;
2139
2140 /* The DP value may be different for each objfile. But within an
2141 objfile each function uses the same dp value. Thus we do not need
2142 to grope around the opd section looking for dp values.
2143
2144 ?!? This is not strictly correct since we may be in a shared library
2145 and want to call back into the main program. To make that case
2146 work correctly we need to set obj_private->dp for the main program's
2147 objfile, then remove this conditional. */
2148 if (obj_private->dp)
2149 write_register (27, obj_private->dp);
2150 break;
2151 }
2152 return pc;
2153 }
2154 #endif
2155
2156 #ifndef GDB_TARGET_IS_HPPA_20W
2157 /* Prefer __gcc_plt_call over the HP supplied routine because
2158 __gcc_plt_call works for any number of arguments. */
2159 trampoline = NULL;
2160 if (lookup_minimal_symbol ("__gcc_plt_call", NULL, NULL) == NULL)
2161 using_gcc_plt_call = 0;
2162
2163 msymbol = lookup_minimal_symbol ("$$dyncall", NULL, NULL);
2164 if (msymbol == NULL)
2165 error ("Can't find an address for $$dyncall trampoline");
2166
2167 dyncall_addr = SYMBOL_VALUE_ADDRESS (msymbol);
2168
2169 /* FUN could be a procedure label, in which case we have to get
2170 its real address and the value of its GOT/DP if we plan to
2171 call the routine via gcc_plt_call. */
2172 if ((fun & 0x2) && using_gcc_plt_call)
2173 {
2174 /* Get the GOT/DP value for the target function. It's
2175 at *(fun+4). Note the call dummy is *NOT* allowed to
2176 trash %r19 before calling the target function. */
2177 write_register (19, read_memory_integer ((fun & ~0x3) + 4,
2178 REGISTER_SIZE));
2179
2180 /* Now get the real address for the function we are calling, it's
2181 at *fun. */
2182 fun = (CORE_ADDR) read_memory_integer (fun & ~0x3,
2183 TARGET_PTR_BIT / 8);
2184 }
2185 else
2186 {
2187
2188 #ifndef GDB_TARGET_IS_PA_ELF
2189 /* FUN could be an export stub, the real address of a function, or
2190 a PLABEL. When using gcc's PLT call routine we must call an import
2191 stub rather than the export stub or real function for lazy binding
2192 to work correctly
2193
2194 If we are using the gcc PLT call routine, then we need to
2195 get the import stub for the target function. */
2196 if (using_gcc_plt_call && som_solib_get_got_by_pc (fun))
2197 {
2198 struct objfile *objfile;
2199 struct minimal_symbol *funsymbol, *stub_symbol;
2200 CORE_ADDR newfun = 0;
2201
2202 funsymbol = lookup_minimal_symbol_by_pc (fun);
2203 if (!funsymbol)
2204 error ("Unable to find minimal symbol for target function.\n");
2205
2206 /* Search all the object files for an import symbol with the
2207 right name. */
2208 ALL_OBJFILES (objfile)
2209 {
2210 stub_symbol
2211 = lookup_minimal_symbol_solib_trampoline
2212 (SYMBOL_NAME (funsymbol), NULL, objfile);
2213
2214 if (!stub_symbol)
2215 stub_symbol = lookup_minimal_symbol (SYMBOL_NAME (funsymbol),
2216 NULL, objfile);
2217
2218 /* Found a symbol with the right name. */
2219 if (stub_symbol)
2220 {
2221 struct unwind_table_entry *u;
2222 /* It must be a shared library trampoline. */
2223 if (MSYMBOL_TYPE (stub_symbol) != mst_solib_trampoline)
2224 continue;
2225
2226 /* It must also be an import stub. */
2227 u = find_unwind_entry (SYMBOL_VALUE (stub_symbol));
2228 if (u == NULL
2229 || (u->stub_unwind.stub_type != IMPORT
2230 #ifdef GDB_NATIVE_HPUX_11
2231 /* Sigh. The hpux 10.20 dynamic linker will blow
2232 chunks if we perform a call to an unbound function
2233 via the IMPORT_SHLIB stub. The hpux 11.00 dynamic
2234 linker will blow chunks if we do not call the
2235 unbound function via the IMPORT_SHLIB stub.
2236
2237 We currently have no way to select bevahior on just
2238 the target. However, we only support HPUX/SOM in
2239 native mode. So we conditinalize on a native
2240 #ifdef. Ugly. Ugly. Ugly */
2241 && u->stub_unwind.stub_type != IMPORT_SHLIB
2242 #endif
2243 ))
2244 continue;
2245
2246 /* OK. Looks like the correct import stub. */
2247 newfun = SYMBOL_VALUE (stub_symbol);
2248 fun = newfun;
2249
2250 /* If we found an IMPORT stub, then we want to stop
2251 searching now. If we found an IMPORT_SHLIB, we want
2252 to continue the search in the hopes that we will find
2253 an IMPORT stub. */
2254 if (u->stub_unwind.stub_type == IMPORT)
2255 break;
2256 }
2257 }
2258
2259 /* Ouch. We did not find an import stub. Make an attempt to
2260 do the right thing instead of just croaking. Most of the
2261 time this will actually work. */
2262 if (newfun == 0)
2263 write_register (19, som_solib_get_got_by_pc (fun));
2264
2265 u = find_unwind_entry (fun);
2266 if (u
2267 && (u->stub_unwind.stub_type == IMPORT
2268 || u->stub_unwind.stub_type == IMPORT_SHLIB))
2269 trampoline = lookup_minimal_symbol ("__gcc_plt_call", NULL, NULL);
2270
2271 /* If we found the import stub in the shared library, then we have
2272 to set %r19 before we call the stub. */
2273 if (u && u->stub_unwind.stub_type == IMPORT_SHLIB)
2274 write_register (19, som_solib_get_got_by_pc (fun));
2275 }
2276 #endif
2277 }
2278
2279 /* If we are calling into another load module then have sr4export call the
2280 magic __d_plt_call routine which is linked in from end.o.
2281
2282 You can't use _sr4export to make the call as the value in sp-24 will get
2283 fried and you end up returning to the wrong location. You can't call the
2284 target as the code to bind the PLT entry to a function can't return to a
2285 stack address.
2286
2287 Also, query the dynamic linker in the inferior to provide a suitable
2288 PLABEL for the target function. */
2289 if (!using_gcc_plt_call)
2290 {
2291 CORE_ADDR new_fun;
2292
2293 /* Get a handle for the shared library containing FUN. Given the
2294 handle we can query the shared library for a PLABEL. */
2295 solib_handle = som_solib_get_solib_by_pc (fun);
2296
2297 if (solib_handle)
2298 {
2299 struct minimal_symbol *fmsymbol = lookup_minimal_symbol_by_pc (fun);
2300
2301 trampoline = lookup_minimal_symbol ("__d_plt_call", NULL, NULL);
2302
2303 if (trampoline == NULL)
2304 {
2305 error ("Can't find an address for __d_plt_call or __gcc_plt_call trampoline\nSuggest linking executable with -g or compiling with gcc.");
2306 }
2307
2308 /* This is where sr4export will jump to. */
2309 new_fun = SYMBOL_VALUE_ADDRESS (trampoline);
2310
2311 /* If the function is in a shared library, then call __d_shl_get to
2312 get a PLABEL for the target function. */
2313 new_stub = find_stub_with_shl_get (fmsymbol, solib_handle);
2314
2315 if (new_stub == 0)
2316 error ("Can't find an import stub for %s", SYMBOL_NAME (fmsymbol));
2317
2318 /* We have to store the address of the stub in __shlib_funcptr. */
2319 msymbol = lookup_minimal_symbol ("__shlib_funcptr", NULL,
2320 (struct objfile *) NULL);
2321
2322 if (msymbol == NULL)
2323 error ("Can't find an address for __shlib_funcptr");
2324 target_write_memory (SYMBOL_VALUE_ADDRESS (msymbol),
2325 (char *) &new_stub, 4);
2326
2327 /* We want sr4export to call __d_plt_call, so we claim it is
2328 the final target. Clear trampoline. */
2329 fun = new_fun;
2330 trampoline = NULL;
2331 }
2332 }
2333
2334 /* Store upper 21 bits of function address into ldil. fun will either be
2335 the final target (most cases) or __d_plt_call when calling into a shared
2336 library and __gcc_plt_call is not available. */
2337 store_unsigned_integer
2338 (&dummy[FUNC_LDIL_OFFSET],
2339 INSTRUCTION_SIZE,
2340 deposit_21 (fun >> 11,
2341 extract_unsigned_integer (&dummy[FUNC_LDIL_OFFSET],
2342 INSTRUCTION_SIZE)));
2343
2344 /* Store lower 11 bits of function address into ldo */
2345 store_unsigned_integer
2346 (&dummy[FUNC_LDO_OFFSET],
2347 INSTRUCTION_SIZE,
2348 deposit_14 (fun & MASK_11,
2349 extract_unsigned_integer (&dummy[FUNC_LDO_OFFSET],
2350 INSTRUCTION_SIZE)));
2351 #ifdef SR4EXPORT_LDIL_OFFSET
2352
2353 {
2354 CORE_ADDR trampoline_addr;
2355
2356 /* We may still need sr4export's address too. */
2357
2358 if (trampoline == NULL)
2359 {
2360 msymbol = lookup_minimal_symbol ("_sr4export", NULL, NULL);
2361 if (msymbol == NULL)
2362 error ("Can't find an address for _sr4export trampoline");
2363
2364 trampoline_addr = SYMBOL_VALUE_ADDRESS (msymbol);
2365 }
2366 else
2367 trampoline_addr = SYMBOL_VALUE_ADDRESS (trampoline);
2368
2369
2370 /* Store upper 21 bits of trampoline's address into ldil */
2371 store_unsigned_integer
2372 (&dummy[SR4EXPORT_LDIL_OFFSET],
2373 INSTRUCTION_SIZE,
2374 deposit_21 (trampoline_addr >> 11,
2375 extract_unsigned_integer (&dummy[SR4EXPORT_LDIL_OFFSET],
2376 INSTRUCTION_SIZE)));
2377
2378 /* Store lower 11 bits of trampoline's address into ldo */
2379 store_unsigned_integer
2380 (&dummy[SR4EXPORT_LDO_OFFSET],
2381 INSTRUCTION_SIZE,
2382 deposit_14 (trampoline_addr & MASK_11,
2383 extract_unsigned_integer (&dummy[SR4EXPORT_LDO_OFFSET],
2384 INSTRUCTION_SIZE)));
2385 }
2386 #endif
2387
2388 write_register (22, pc);
2389
2390 /* If we are in a syscall, then we should call the stack dummy
2391 directly. $$dyncall is not needed as the kernel sets up the
2392 space id registers properly based on the value in %r31. In
2393 fact calling $$dyncall will not work because the value in %r22
2394 will be clobbered on the syscall exit path.
2395
2396 Similarly if the current PC is in a shared library. Note however,
2397 this scheme won't work if the shared library isn't mapped into
2398 the same space as the stack. */
2399 if (flags & 2)
2400 return pc;
2401 #ifndef GDB_TARGET_IS_PA_ELF
2402 else if (som_solib_get_got_by_pc (target_read_pc (inferior_ptid)))
2403 return pc;
2404 #endif
2405 else
2406 return dyncall_addr;
2407 #endif
2408 }
2409
2410
2411
2412
2413 /* If the pid is in a syscall, then the FP register is not readable.
2414 We'll return zero in that case, rather than attempting to read it
2415 and cause a warning. */
2416 CORE_ADDR
2417 target_read_fp (int pid)
2418 {
2419 int flags = read_register (FLAGS_REGNUM);
2420
2421 if (flags & 2)
2422 {
2423 return (CORE_ADDR) 0;
2424 }
2425
2426 /* This is the only site that may directly read_register () the FP
2427 register. All others must use TARGET_READ_FP (). */
2428 return read_register (FP_REGNUM);
2429 }
2430
2431
2432 /* Get the PC from %r31 if currently in a syscall. Also mask out privilege
2433 bits. */
2434
2435 CORE_ADDR
2436 target_read_pc (ptid_t ptid)
2437 {
2438 int flags = read_register_pid (FLAGS_REGNUM, ptid);
2439
2440 /* The following test does not belong here. It is OS-specific, and belongs
2441 in native code. */
2442 /* Test SS_INSYSCALL */
2443 if (flags & 2)
2444 return read_register_pid (31, ptid) & ~0x3;
2445
2446 return read_register_pid (PC_REGNUM, ptid) & ~0x3;
2447 }
2448
2449 /* Write out the PC. If currently in a syscall, then also write the new
2450 PC value into %r31. */
2451
2452 void
2453 target_write_pc (CORE_ADDR v, ptid_t ptid)
2454 {
2455 int flags = read_register_pid (FLAGS_REGNUM, ptid);
2456
2457 /* The following test does not belong here. It is OS-specific, and belongs
2458 in native code. */
2459 /* If in a syscall, then set %r31. Also make sure to get the
2460 privilege bits set correctly. */
2461 /* Test SS_INSYSCALL */
2462 if (flags & 2)
2463 write_register_pid (31, v | 0x3, ptid);
2464
2465 write_register_pid (PC_REGNUM, v, ptid);
2466 write_register_pid (NPC_REGNUM, v + 4, ptid);
2467 }
2468
2469 /* return the alignment of a type in bytes. Structures have the maximum
2470 alignment required by their fields. */
2471
2472 static int
2473 hppa_alignof (struct type *type)
2474 {
2475 int max_align, align, i;
2476 CHECK_TYPEDEF (type);
2477 switch (TYPE_CODE (type))
2478 {
2479 case TYPE_CODE_PTR:
2480 case TYPE_CODE_INT:
2481 case TYPE_CODE_FLT:
2482 return TYPE_LENGTH (type);
2483 case TYPE_CODE_ARRAY:
2484 return hppa_alignof (TYPE_FIELD_TYPE (type, 0));
2485 case TYPE_CODE_STRUCT:
2486 case TYPE_CODE_UNION:
2487 max_align = 1;
2488 for (i = 0; i < TYPE_NFIELDS (type); i++)
2489 {
2490 /* Bit fields have no real alignment. */
2491 /* if (!TYPE_FIELD_BITPOS (type, i)) */
2492 if (!TYPE_FIELD_BITSIZE (type, i)) /* elz: this should be bitsize */
2493 {
2494 align = hppa_alignof (TYPE_FIELD_TYPE (type, i));
2495 max_align = max (max_align, align);
2496 }
2497 }
2498 return max_align;
2499 default:
2500 return 4;
2501 }
2502 }
2503
2504 /* Print the register regnum, or all registers if regnum is -1 */
2505
2506 void
2507 pa_do_registers_info (int regnum, int fpregs)
2508 {
2509 char raw_regs[REGISTER_BYTES];
2510 int i;
2511
2512 /* Make a copy of gdb's save area (may cause actual
2513 reads from the target). */
2514 for (i = 0; i < NUM_REGS; i++)
2515 frame_register_read (deprecated_selected_frame, i, raw_regs + REGISTER_BYTE (i));
2516
2517 if (regnum == -1)
2518 pa_print_registers (raw_regs, regnum, fpregs);
2519 else if (regnum < FP4_REGNUM)
2520 {
2521 long reg_val[2];
2522
2523 /* Why is the value not passed through "extract_signed_integer"
2524 as in "pa_print_registers" below? */
2525 pa_register_look_aside (raw_regs, regnum, &reg_val[0]);
2526
2527 if (!is_pa_2)
2528 {
2529 printf_unfiltered ("%s %lx\n", REGISTER_NAME (regnum), reg_val[1]);
2530 }
2531 else
2532 {
2533 /* Fancy % formats to prevent leading zeros. */
2534 if (reg_val[0] == 0)
2535 printf_unfiltered ("%s %lx\n", REGISTER_NAME (regnum), reg_val[1]);
2536 else
2537 printf_unfiltered ("%s %lx%8.8lx\n", REGISTER_NAME (regnum),
2538 reg_val[0], reg_val[1]);
2539 }
2540 }
2541 else
2542 /* Note that real floating point values only start at
2543 FP4_REGNUM. FP0 and up are just status and error
2544 registers, which have integral (bit) values. */
2545 pa_print_fp_reg (regnum);
2546 }
2547
2548 /********** new function ********************/
2549 void
2550 pa_do_strcat_registers_info (int regnum, int fpregs, struct ui_file *stream,
2551 enum precision_type precision)
2552 {
2553 char raw_regs[REGISTER_BYTES];
2554 int i;
2555
2556 /* Make a copy of gdb's save area (may cause actual
2557 reads from the target). */
2558 for (i = 0; i < NUM_REGS; i++)
2559 frame_register_read (deprecated_selected_frame, i, raw_regs + REGISTER_BYTE (i));
2560
2561 if (regnum == -1)
2562 pa_strcat_registers (raw_regs, regnum, fpregs, stream);
2563
2564 else if (regnum < FP4_REGNUM)
2565 {
2566 long reg_val[2];
2567
2568 /* Why is the value not passed through "extract_signed_integer"
2569 as in "pa_print_registers" below? */
2570 pa_register_look_aside (raw_regs, regnum, &reg_val[0]);
2571
2572 if (!is_pa_2)
2573 {
2574 fprintf_unfiltered (stream, "%s %lx", REGISTER_NAME (regnum), reg_val[1]);
2575 }
2576 else
2577 {
2578 /* Fancy % formats to prevent leading zeros. */
2579 if (reg_val[0] == 0)
2580 fprintf_unfiltered (stream, "%s %lx", REGISTER_NAME (regnum),
2581 reg_val[1]);
2582 else
2583 fprintf_unfiltered (stream, "%s %lx%8.8lx", REGISTER_NAME (regnum),
2584 reg_val[0], reg_val[1]);
2585 }
2586 }
2587 else
2588 /* Note that real floating point values only start at
2589 FP4_REGNUM. FP0 and up are just status and error
2590 registers, which have integral (bit) values. */
2591 pa_strcat_fp_reg (regnum, stream, precision);
2592 }
2593
2594 /* If this is a PA2.0 machine, fetch the real 64-bit register
2595 value. Otherwise use the info from gdb's saved register area.
2596
2597 Note that reg_val is really expected to be an array of longs,
2598 with two elements. */
2599 static void
2600 pa_register_look_aside (char *raw_regs, int regnum, long *raw_val)
2601 {
2602 static int know_which = 0; /* False */
2603
2604 int regaddr;
2605 unsigned int offset;
2606 register int i;
2607 int start;
2608
2609
2610 char buf[MAX_REGISTER_RAW_SIZE];
2611 long long reg_val;
2612
2613 if (!know_which)
2614 {
2615 if (CPU_PA_RISC2_0 == sysconf (_SC_CPU_VERSION))
2616 {
2617 is_pa_2 = (1 == 1);
2618 }
2619
2620 know_which = 1; /* True */
2621 }
2622
2623 raw_val[0] = 0;
2624 raw_val[1] = 0;
2625
2626 if (!is_pa_2)
2627 {
2628 raw_val[1] = *(long *) (raw_regs + REGISTER_BYTE (regnum));
2629 return;
2630 }
2631
2632 /* Code below copied from hppah-nat.c, with fixes for wide
2633 registers, using different area of save_state, etc. */
2634 if (regnum == FLAGS_REGNUM || regnum >= FP0_REGNUM ||
2635 !HAVE_STRUCT_SAVE_STATE_T || !HAVE_STRUCT_MEMBER_SS_WIDE)
2636 {
2637 /* Use narrow regs area of save_state and default macro. */
2638 offset = U_REGS_OFFSET;
2639 regaddr = register_addr (regnum, offset);
2640 start = 1;
2641 }
2642 else
2643 {
2644 /* Use wide regs area, and calculate registers as 8 bytes wide.
2645
2646 We'd like to do this, but current version of "C" doesn't
2647 permit "offsetof":
2648
2649 offset = offsetof(save_state_t, ss_wide);
2650
2651 Note that to avoid "C" doing typed pointer arithmetic, we
2652 have to cast away the type in our offset calculation:
2653 otherwise we get an offset of 1! */
2654
2655 /* NB: save_state_t is not available before HPUX 9.
2656 The ss_wide field is not available previous to HPUX 10.20,
2657 so to avoid compile-time warnings, we only compile this for
2658 PA 2.0 processors. This control path should only be followed
2659 if we're debugging a PA 2.0 processor, so this should not cause
2660 problems. */
2661
2662 /* #if the following code out so that this file can still be
2663 compiled on older HPUX boxes (< 10.20) which don't have
2664 this structure/structure member. */
2665 #if HAVE_STRUCT_SAVE_STATE_T == 1 && HAVE_STRUCT_MEMBER_SS_WIDE == 1
2666 save_state_t temp;
2667
2668 offset = ((int) &temp.ss_wide) - ((int) &temp);
2669 regaddr = offset + regnum * 8;
2670 start = 0;
2671 #endif
2672 }
2673
2674 for (i = start; i < 2; i++)
2675 {
2676 errno = 0;
2677 raw_val[i] = call_ptrace (PT_RUREGS, PIDGET (inferior_ptid),
2678 (PTRACE_ARG3_TYPE) regaddr, 0);
2679 if (errno != 0)
2680 {
2681 /* Warning, not error, in case we are attached; sometimes the
2682 kernel doesn't let us at the registers. */
2683 char *err = safe_strerror (errno);
2684 char *msg = alloca (strlen (err) + 128);
2685 sprintf (msg, "reading register %s: %s", REGISTER_NAME (regnum), err);
2686 warning (msg);
2687 goto error_exit;
2688 }
2689
2690 regaddr += sizeof (long);
2691 }
2692
2693 if (regnum == PCOQ_HEAD_REGNUM || regnum == PCOQ_TAIL_REGNUM)
2694 raw_val[1] &= ~0x3; /* I think we're masking out space bits */
2695
2696 error_exit:
2697 ;
2698 }
2699
2700 /* "Info all-reg" command */
2701
2702 static void
2703 pa_print_registers (char *raw_regs, int regnum, int fpregs)
2704 {
2705 int i, j;
2706 /* Alas, we are compiled so that "long long" is 32 bits */
2707 long raw_val[2];
2708 long long_val;
2709 int rows = 48, columns = 2;
2710
2711 for (i = 0; i < rows; i++)
2712 {
2713 for (j = 0; j < columns; j++)
2714 {
2715 /* We display registers in column-major order. */
2716 int regnum = i + j * rows;
2717
2718 /* Q: Why is the value passed through "extract_signed_integer",
2719 while above, in "pa_do_registers_info" it isn't?
2720 A: ? */
2721 pa_register_look_aside (raw_regs, regnum, &raw_val[0]);
2722
2723 /* Even fancier % formats to prevent leading zeros
2724 and still maintain the output in columns. */
2725 if (!is_pa_2)
2726 {
2727 /* Being big-endian, on this machine the low bits
2728 (the ones we want to look at) are in the second longword. */
2729 long_val = extract_signed_integer (&raw_val[1], 4);
2730 printf_filtered ("%10.10s: %8lx ",
2731 REGISTER_NAME (regnum), long_val);
2732 }
2733 else
2734 {
2735 /* raw_val = extract_signed_integer(&raw_val, 8); */
2736 if (raw_val[0] == 0)
2737 printf_filtered ("%10.10s: %8lx ",
2738 REGISTER_NAME (regnum), raw_val[1]);
2739 else
2740 printf_filtered ("%10.10s: %8lx%8.8lx ",
2741 REGISTER_NAME (regnum),
2742 raw_val[0], raw_val[1]);
2743 }
2744 }
2745 printf_unfiltered ("\n");
2746 }
2747
2748 if (fpregs)
2749 for (i = FP4_REGNUM; i < NUM_REGS; i++) /* FP4_REGNUM == 72 */
2750 pa_print_fp_reg (i);
2751 }
2752
2753 /************* new function ******************/
2754 static void
2755 pa_strcat_registers (char *raw_regs, int regnum, int fpregs,
2756 struct ui_file *stream)
2757 {
2758 int i, j;
2759 long raw_val[2]; /* Alas, we are compiled so that "long long" is 32 bits */
2760 long long_val;
2761 enum precision_type precision;
2762
2763 precision = unspecified_precision;
2764
2765 for (i = 0; i < 18; i++)
2766 {
2767 for (j = 0; j < 4; j++)
2768 {
2769 /* Q: Why is the value passed through "extract_signed_integer",
2770 while above, in "pa_do_registers_info" it isn't?
2771 A: ? */
2772 pa_register_look_aside (raw_regs, i + (j * 18), &raw_val[0]);
2773
2774 /* Even fancier % formats to prevent leading zeros
2775 and still maintain the output in columns. */
2776 if (!is_pa_2)
2777 {
2778 /* Being big-endian, on this machine the low bits
2779 (the ones we want to look at) are in the second longword. */
2780 long_val = extract_signed_integer (&raw_val[1], 4);
2781 fprintf_filtered (stream, "%8.8s: %8lx ",
2782 REGISTER_NAME (i + (j * 18)), long_val);
2783 }
2784 else
2785 {
2786 /* raw_val = extract_signed_integer(&raw_val, 8); */
2787 if (raw_val[0] == 0)
2788 fprintf_filtered (stream, "%8.8s: %8lx ",
2789 REGISTER_NAME (i + (j * 18)), raw_val[1]);
2790 else
2791 fprintf_filtered (stream, "%8.8s: %8lx%8.8lx ",
2792 REGISTER_NAME (i + (j * 18)), raw_val[0],
2793 raw_val[1]);
2794 }
2795 }
2796 fprintf_unfiltered (stream, "\n");
2797 }
2798
2799 if (fpregs)
2800 for (i = FP4_REGNUM; i < NUM_REGS; i++) /* FP4_REGNUM == 72 */
2801 pa_strcat_fp_reg (i, stream, precision);
2802 }
2803
2804 static void
2805 pa_print_fp_reg (int i)
2806 {
2807 char raw_buffer[MAX_REGISTER_RAW_SIZE];
2808 char virtual_buffer[MAX_REGISTER_VIRTUAL_SIZE];
2809
2810 /* Get 32bits of data. */
2811 frame_register_read (deprecated_selected_frame, i, raw_buffer);
2812
2813 /* Put it in the buffer. No conversions are ever necessary. */
2814 memcpy (virtual_buffer, raw_buffer, REGISTER_RAW_SIZE (i));
2815
2816 fputs_filtered (REGISTER_NAME (i), gdb_stdout);
2817 print_spaces_filtered (8 - strlen (REGISTER_NAME (i)), gdb_stdout);
2818 fputs_filtered ("(single precision) ", gdb_stdout);
2819
2820 val_print (REGISTER_VIRTUAL_TYPE (i), virtual_buffer, 0, 0, gdb_stdout, 0,
2821 1, 0, Val_pretty_default);
2822 printf_filtered ("\n");
2823
2824 /* If "i" is even, then this register can also be a double-precision
2825 FP register. Dump it out as such. */
2826 if ((i % 2) == 0)
2827 {
2828 /* Get the data in raw format for the 2nd half. */
2829 frame_register_read (deprecated_selected_frame, i + 1, raw_buffer);
2830
2831 /* Copy it into the appropriate part of the virtual buffer. */
2832 memcpy (virtual_buffer + REGISTER_RAW_SIZE (i), raw_buffer,
2833 REGISTER_RAW_SIZE (i));
2834
2835 /* Dump it as a double. */
2836 fputs_filtered (REGISTER_NAME (i), gdb_stdout);
2837 print_spaces_filtered (8 - strlen (REGISTER_NAME (i)), gdb_stdout);
2838 fputs_filtered ("(double precision) ", gdb_stdout);
2839
2840 val_print (builtin_type_double, virtual_buffer, 0, 0, gdb_stdout, 0,
2841 1, 0, Val_pretty_default);
2842 printf_filtered ("\n");
2843 }
2844 }
2845
2846 /*************** new function ***********************/
2847 static void
2848 pa_strcat_fp_reg (int i, struct ui_file *stream, enum precision_type precision)
2849 {
2850 char raw_buffer[MAX_REGISTER_RAW_SIZE];
2851 char virtual_buffer[MAX_REGISTER_VIRTUAL_SIZE];
2852
2853 fputs_filtered (REGISTER_NAME (i), stream);
2854 print_spaces_filtered (8 - strlen (REGISTER_NAME (i)), stream);
2855
2856 /* Get 32bits of data. */
2857 frame_register_read (deprecated_selected_frame, i, raw_buffer);
2858
2859 /* Put it in the buffer. No conversions are ever necessary. */
2860 memcpy (virtual_buffer, raw_buffer, REGISTER_RAW_SIZE (i));
2861
2862 if (precision == double_precision && (i % 2) == 0)
2863 {
2864
2865 char raw_buf[MAX_REGISTER_RAW_SIZE];
2866
2867 /* Get the data in raw format for the 2nd half. */
2868 frame_register_read (deprecated_selected_frame, i + 1, raw_buf);
2869
2870 /* Copy it into the appropriate part of the virtual buffer. */
2871 memcpy (virtual_buffer + REGISTER_RAW_SIZE (i), raw_buf, REGISTER_RAW_SIZE (i));
2872
2873 val_print (builtin_type_double, virtual_buffer, 0, 0, stream, 0,
2874 1, 0, Val_pretty_default);
2875
2876 }
2877 else
2878 {
2879 val_print (REGISTER_VIRTUAL_TYPE (i), virtual_buffer, 0, 0, stream, 0,
2880 1, 0, Val_pretty_default);
2881 }
2882
2883 }
2884
2885 /* Return one if PC is in the call path of a trampoline, else return zero.
2886
2887 Note we return one for *any* call trampoline (long-call, arg-reloc), not
2888 just shared library trampolines (import, export). */
2889
2890 int
2891 in_solib_call_trampoline (CORE_ADDR pc, char *name)
2892 {
2893 struct minimal_symbol *minsym;
2894 struct unwind_table_entry *u;
2895 static CORE_ADDR dyncall = 0;
2896 static CORE_ADDR sr4export = 0;
2897
2898 #ifdef GDB_TARGET_IS_HPPA_20W
2899 /* PA64 has a completely different stub/trampoline scheme. Is it
2900 better? Maybe. It's certainly harder to determine with any
2901 certainty that we are in a stub because we can not refer to the
2902 unwinders to help.
2903
2904 The heuristic is simple. Try to lookup the current PC value in th
2905 minimal symbol table. If that fails, then assume we are not in a
2906 stub and return.
2907
2908 Then see if the PC value falls within the section bounds for the
2909 section containing the minimal symbol we found in the first
2910 step. If it does, then assume we are not in a stub and return.
2911
2912 Finally peek at the instructions to see if they look like a stub. */
2913 {
2914 struct minimal_symbol *minsym;
2915 asection *sec;
2916 CORE_ADDR addr;
2917 int insn, i;
2918
2919 minsym = lookup_minimal_symbol_by_pc (pc);
2920 if (! minsym)
2921 return 0;
2922
2923 sec = SYMBOL_BFD_SECTION (minsym);
2924
2925 if (sec->vma <= pc
2926 && sec->vma + sec->_cooked_size < pc)
2927 return 0;
2928
2929 /* We might be in a stub. Peek at the instructions. Stubs are 3
2930 instructions long. */
2931 insn = read_memory_integer (pc, 4);
2932
2933 /* Find out where we think we are within the stub. */
2934 if ((insn & 0xffffc00e) == 0x53610000)
2935 addr = pc;
2936 else if ((insn & 0xffffffff) == 0xe820d000)
2937 addr = pc - 4;
2938 else if ((insn & 0xffffc00e) == 0x537b0000)
2939 addr = pc - 8;
2940 else
2941 return 0;
2942
2943 /* Now verify each insn in the range looks like a stub instruction. */
2944 insn = read_memory_integer (addr, 4);
2945 if ((insn & 0xffffc00e) != 0x53610000)
2946 return 0;
2947
2948 /* Now verify each insn in the range looks like a stub instruction. */
2949 insn = read_memory_integer (addr + 4, 4);
2950 if ((insn & 0xffffffff) != 0xe820d000)
2951 return 0;
2952
2953 /* Now verify each insn in the range looks like a stub instruction. */
2954 insn = read_memory_integer (addr + 8, 4);
2955 if ((insn & 0xffffc00e) != 0x537b0000)
2956 return 0;
2957
2958 /* Looks like a stub. */
2959 return 1;
2960 }
2961 #endif
2962
2963 /* FIXME XXX - dyncall and sr4export must be initialized whenever we get a
2964 new exec file */
2965
2966 /* First see if PC is in one of the two C-library trampolines. */
2967 if (!dyncall)
2968 {
2969 minsym = lookup_minimal_symbol ("$$dyncall", NULL, NULL);
2970 if (minsym)
2971 dyncall = SYMBOL_VALUE_ADDRESS (minsym);
2972 else
2973 dyncall = -1;
2974 }
2975
2976 if (!sr4export)
2977 {
2978 minsym = lookup_minimal_symbol ("_sr4export", NULL, NULL);
2979 if (minsym)
2980 sr4export = SYMBOL_VALUE_ADDRESS (minsym);
2981 else
2982 sr4export = -1;
2983 }
2984
2985 if (pc == dyncall || pc == sr4export)
2986 return 1;
2987
2988 minsym = lookup_minimal_symbol_by_pc (pc);
2989 if (minsym && strcmp (SYMBOL_NAME (minsym), ".stub") == 0)
2990 return 1;
2991
2992 /* Get the unwind descriptor corresponding to PC, return zero
2993 if no unwind was found. */
2994 u = find_unwind_entry (pc);
2995 if (!u)
2996 return 0;
2997
2998 /* If this isn't a linker stub, then return now. */
2999 if (u->stub_unwind.stub_type == 0)
3000 return 0;
3001
3002 /* By definition a long-branch stub is a call stub. */
3003 if (u->stub_unwind.stub_type == LONG_BRANCH)
3004 return 1;
3005
3006 /* The call and return path execute the same instructions within
3007 an IMPORT stub! So an IMPORT stub is both a call and return
3008 trampoline. */
3009 if (u->stub_unwind.stub_type == IMPORT)
3010 return 1;
3011
3012 /* Parameter relocation stubs always have a call path and may have a
3013 return path. */
3014 if (u->stub_unwind.stub_type == PARAMETER_RELOCATION
3015 || u->stub_unwind.stub_type == EXPORT)
3016 {
3017 CORE_ADDR addr;
3018
3019 /* Search forward from the current PC until we hit a branch
3020 or the end of the stub. */
3021 for (addr = pc; addr <= u->region_end; addr += 4)
3022 {
3023 unsigned long insn;
3024
3025 insn = read_memory_integer (addr, 4);
3026
3027 /* Does it look like a bl? If so then it's the call path, if
3028 we find a bv or be first, then we're on the return path. */
3029 if ((insn & 0xfc00e000) == 0xe8000000)
3030 return 1;
3031 else if ((insn & 0xfc00e001) == 0xe800c000
3032 || (insn & 0xfc000000) == 0xe0000000)
3033 return 0;
3034 }
3035
3036 /* Should never happen. */
3037 warning ("Unable to find branch in parameter relocation stub.\n");
3038 return 0;
3039 }
3040
3041 /* Unknown stub type. For now, just return zero. */
3042 return 0;
3043 }
3044
3045 /* Return one if PC is in the return path of a trampoline, else return zero.
3046
3047 Note we return one for *any* call trampoline (long-call, arg-reloc), not
3048 just shared library trampolines (import, export). */
3049
3050 int
3051 in_solib_return_trampoline (CORE_ADDR pc, char *name)
3052 {
3053 struct unwind_table_entry *u;
3054
3055 /* Get the unwind descriptor corresponding to PC, return zero
3056 if no unwind was found. */
3057 u = find_unwind_entry (pc);
3058 if (!u)
3059 return 0;
3060
3061 /* If this isn't a linker stub or it's just a long branch stub, then
3062 return zero. */
3063 if (u->stub_unwind.stub_type == 0 || u->stub_unwind.stub_type == LONG_BRANCH)
3064 return 0;
3065
3066 /* The call and return path execute the same instructions within
3067 an IMPORT stub! So an IMPORT stub is both a call and return
3068 trampoline. */
3069 if (u->stub_unwind.stub_type == IMPORT)
3070 return 1;
3071
3072 /* Parameter relocation stubs always have a call path and may have a
3073 return path. */
3074 if (u->stub_unwind.stub_type == PARAMETER_RELOCATION
3075 || u->stub_unwind.stub_type == EXPORT)
3076 {
3077 CORE_ADDR addr;
3078
3079 /* Search forward from the current PC until we hit a branch
3080 or the end of the stub. */
3081 for (addr = pc; addr <= u->region_end; addr += 4)
3082 {
3083 unsigned long insn;
3084
3085 insn = read_memory_integer (addr, 4);
3086
3087 /* Does it look like a bl? If so then it's the call path, if
3088 we find a bv or be first, then we're on the return path. */
3089 if ((insn & 0xfc00e000) == 0xe8000000)
3090 return 0;
3091 else if ((insn & 0xfc00e001) == 0xe800c000
3092 || (insn & 0xfc000000) == 0xe0000000)
3093 return 1;
3094 }
3095
3096 /* Should never happen. */
3097 warning ("Unable to find branch in parameter relocation stub.\n");
3098 return 0;
3099 }
3100
3101 /* Unknown stub type. For now, just return zero. */
3102 return 0;
3103
3104 }
3105
3106 /* Figure out if PC is in a trampoline, and if so find out where
3107 the trampoline will jump to. If not in a trampoline, return zero.
3108
3109 Simple code examination probably is not a good idea since the code
3110 sequences in trampolines can also appear in user code.
3111
3112 We use unwinds and information from the minimal symbol table to
3113 determine when we're in a trampoline. This won't work for ELF
3114 (yet) since it doesn't create stub unwind entries. Whether or
3115 not ELF will create stub unwinds or normal unwinds for linker
3116 stubs is still being debated.
3117
3118 This should handle simple calls through dyncall or sr4export,
3119 long calls, argument relocation stubs, and dyncall/sr4export
3120 calling an argument relocation stub. It even handles some stubs
3121 used in dynamic executables. */
3122
3123 CORE_ADDR
3124 skip_trampoline_code (CORE_ADDR pc, char *name)
3125 {
3126 long orig_pc = pc;
3127 long prev_inst, curr_inst, loc;
3128 static CORE_ADDR dyncall = 0;
3129 static CORE_ADDR dyncall_external = 0;
3130 static CORE_ADDR sr4export = 0;
3131 struct minimal_symbol *msym;
3132 struct unwind_table_entry *u;
3133
3134 /* FIXME XXX - dyncall and sr4export must be initialized whenever we get a
3135 new exec file */
3136
3137 if (!dyncall)
3138 {
3139 msym = lookup_minimal_symbol ("$$dyncall", NULL, NULL);
3140 if (msym)
3141 dyncall = SYMBOL_VALUE_ADDRESS (msym);
3142 else
3143 dyncall = -1;
3144 }
3145
3146 if (!dyncall_external)
3147 {
3148 msym = lookup_minimal_symbol ("$$dyncall_external", NULL, NULL);
3149 if (msym)
3150 dyncall_external = SYMBOL_VALUE_ADDRESS (msym);
3151 else
3152 dyncall_external = -1;
3153 }
3154
3155 if (!sr4export)
3156 {
3157 msym = lookup_minimal_symbol ("_sr4export", NULL, NULL);
3158 if (msym)
3159 sr4export = SYMBOL_VALUE_ADDRESS (msym);
3160 else
3161 sr4export = -1;
3162 }
3163
3164 /* Addresses passed to dyncall may *NOT* be the actual address
3165 of the function. So we may have to do something special. */
3166 if (pc == dyncall)
3167 {
3168 pc = (CORE_ADDR) read_register (22);
3169
3170 /* If bit 30 (counting from the left) is on, then pc is the address of
3171 the PLT entry for this function, not the address of the function
3172 itself. Bit 31 has meaning too, but only for MPE. */
3173 if (pc & 0x2)
3174 pc = (CORE_ADDR) read_memory_integer (pc & ~0x3, TARGET_PTR_BIT / 8);
3175 }
3176 if (pc == dyncall_external)
3177 {
3178 pc = (CORE_ADDR) read_register (22);
3179 pc = (CORE_ADDR) read_memory_integer (pc & ~0x3, TARGET_PTR_BIT / 8);
3180 }
3181 else if (pc == sr4export)
3182 pc = (CORE_ADDR) (read_register (22));
3183
3184 /* Get the unwind descriptor corresponding to PC, return zero
3185 if no unwind was found. */
3186 u = find_unwind_entry (pc);
3187 if (!u)
3188 return 0;
3189
3190 /* If this isn't a linker stub, then return now. */
3191 /* elz: attention here! (FIXME) because of a compiler/linker
3192 error, some stubs which should have a non zero stub_unwind.stub_type
3193 have unfortunately a value of zero. So this function would return here
3194 as if we were not in a trampoline. To fix this, we go look at the partial
3195 symbol information, which reports this guy as a stub.
3196 (FIXME): Unfortunately, we are not that lucky: it turns out that the
3197 partial symbol information is also wrong sometimes. This is because
3198 when it is entered (somread.c::som_symtab_read()) it can happen that
3199 if the type of the symbol (from the som) is Entry, and the symbol is
3200 in a shared library, then it can also be a trampoline. This would
3201 be OK, except that I believe the way they decide if we are ina shared library
3202 does not work. SOOOO..., even if we have a regular function w/o trampolines
3203 its minimal symbol can be assigned type mst_solib_trampoline.
3204 Also, if we find that the symbol is a real stub, then we fix the unwind
3205 descriptor, and define the stub type to be EXPORT.
3206 Hopefully this is correct most of the times. */
3207 if (u->stub_unwind.stub_type == 0)
3208 {
3209
3210 /* elz: NOTE (FIXME!) once the problem with the unwind information is fixed
3211 we can delete all the code which appears between the lines */
3212 /*--------------------------------------------------------------------------*/
3213 msym = lookup_minimal_symbol_by_pc (pc);
3214
3215 if (msym == NULL || MSYMBOL_TYPE (msym) != mst_solib_trampoline)
3216 return orig_pc == pc ? 0 : pc & ~0x3;
3217
3218 else if (msym != NULL && MSYMBOL_TYPE (msym) == mst_solib_trampoline)
3219 {
3220 struct objfile *objfile;
3221 struct minimal_symbol *msymbol;
3222 int function_found = 0;
3223
3224 /* go look if there is another minimal symbol with the same name as
3225 this one, but with type mst_text. This would happen if the msym
3226 is an actual trampoline, in which case there would be another
3227 symbol with the same name corresponding to the real function */
3228
3229 ALL_MSYMBOLS (objfile, msymbol)
3230 {
3231 if (MSYMBOL_TYPE (msymbol) == mst_text
3232 && STREQ (SYMBOL_NAME (msymbol), SYMBOL_NAME (msym)))
3233 {
3234 function_found = 1;
3235 break;
3236 }
3237 }
3238
3239 if (function_found)
3240 /* the type of msym is correct (mst_solib_trampoline), but
3241 the unwind info is wrong, so set it to the correct value */
3242 u->stub_unwind.stub_type = EXPORT;
3243 else
3244 /* the stub type info in the unwind is correct (this is not a
3245 trampoline), but the msym type information is wrong, it
3246 should be mst_text. So we need to fix the msym, and also
3247 get out of this function */
3248 {
3249 MSYMBOL_TYPE (msym) = mst_text;
3250 return orig_pc == pc ? 0 : pc & ~0x3;
3251 }
3252 }
3253
3254 /*--------------------------------------------------------------------------*/
3255 }
3256
3257 /* It's a stub. Search for a branch and figure out where it goes.
3258 Note we have to handle multi insn branch sequences like ldil;ble.
3259 Most (all?) other branches can be determined by examining the contents
3260 of certain registers and the stack. */
3261
3262 loc = pc;
3263 curr_inst = 0;
3264 prev_inst = 0;
3265 while (1)
3266 {
3267 /* Make sure we haven't walked outside the range of this stub. */
3268 if (u != find_unwind_entry (loc))
3269 {
3270 warning ("Unable to find branch in linker stub");
3271 return orig_pc == pc ? 0 : pc & ~0x3;
3272 }
3273
3274 prev_inst = curr_inst;
3275 curr_inst = read_memory_integer (loc, 4);
3276
3277 /* Does it look like a branch external using %r1? Then it's the
3278 branch from the stub to the actual function. */
3279 if ((curr_inst & 0xffe0e000) == 0xe0202000)
3280 {
3281 /* Yup. See if the previous instruction loaded
3282 a value into %r1. If so compute and return the jump address. */
3283 if ((prev_inst & 0xffe00000) == 0x20200000)
3284 return (extract_21 (prev_inst) + extract_17 (curr_inst)) & ~0x3;
3285 else
3286 {
3287 warning ("Unable to find ldil X,%%r1 before ble Y(%%sr4,%%r1).");
3288 return orig_pc == pc ? 0 : pc & ~0x3;
3289 }
3290 }
3291
3292 /* Does it look like a be 0(sr0,%r21)? OR
3293 Does it look like a be, n 0(sr0,%r21)? OR
3294 Does it look like a bve (r21)? (this is on PA2.0)
3295 Does it look like a bve, n(r21)? (this is also on PA2.0)
3296 That's the branch from an
3297 import stub to an export stub.
3298
3299 It is impossible to determine the target of the branch via
3300 simple examination of instructions and/or data (consider
3301 that the address in the plabel may be the address of the
3302 bind-on-reference routine in the dynamic loader).
3303
3304 So we have try an alternative approach.
3305
3306 Get the name of the symbol at our current location; it should
3307 be a stub symbol with the same name as the symbol in the
3308 shared library.
3309
3310 Then lookup a minimal symbol with the same name; we should
3311 get the minimal symbol for the target routine in the shared
3312 library as those take precedence of import/export stubs. */
3313 if ((curr_inst == 0xe2a00000) ||
3314 (curr_inst == 0xe2a00002) ||
3315 (curr_inst == 0xeaa0d000) ||
3316 (curr_inst == 0xeaa0d002))
3317 {
3318 struct minimal_symbol *stubsym, *libsym;
3319
3320 stubsym = lookup_minimal_symbol_by_pc (loc);
3321 if (stubsym == NULL)
3322 {
3323 warning ("Unable to find symbol for 0x%lx", loc);
3324 return orig_pc == pc ? 0 : pc & ~0x3;
3325 }
3326
3327 libsym = lookup_minimal_symbol (SYMBOL_NAME (stubsym), NULL, NULL);
3328 if (libsym == NULL)
3329 {
3330 warning ("Unable to find library symbol for %s\n",
3331 SYMBOL_NAME (stubsym));
3332 return orig_pc == pc ? 0 : pc & ~0x3;
3333 }
3334
3335 return SYMBOL_VALUE (libsym);
3336 }
3337
3338 /* Does it look like bl X,%rp or bl X,%r0? Another way to do a
3339 branch from the stub to the actual function. */
3340 /*elz */
3341 else if ((curr_inst & 0xffe0e000) == 0xe8400000
3342 || (curr_inst & 0xffe0e000) == 0xe8000000
3343 || (curr_inst & 0xffe0e000) == 0xe800A000)
3344 return (loc + extract_17 (curr_inst) + 8) & ~0x3;
3345
3346 /* Does it look like bv (rp)? Note this depends on the
3347 current stack pointer being the same as the stack
3348 pointer in the stub itself! This is a branch on from the
3349 stub back to the original caller. */
3350 /*else if ((curr_inst & 0xffe0e000) == 0xe840c000) */
3351 else if ((curr_inst & 0xffe0f000) == 0xe840c000)
3352 {
3353 /* Yup. See if the previous instruction loaded
3354 rp from sp - 8. */
3355 if (prev_inst == 0x4bc23ff1)
3356 return (read_memory_integer
3357 (read_register (SP_REGNUM) - 8, 4)) & ~0x3;
3358 else
3359 {
3360 warning ("Unable to find restore of %%rp before bv (%%rp).");
3361 return orig_pc == pc ? 0 : pc & ~0x3;
3362 }
3363 }
3364
3365 /* elz: added this case to capture the new instruction
3366 at the end of the return part of an export stub used by
3367 the PA2.0: BVE, n (rp) */
3368 else if ((curr_inst & 0xffe0f000) == 0xe840d000)
3369 {
3370 return (read_memory_integer
3371 (read_register (SP_REGNUM) - 24, TARGET_PTR_BIT / 8)) & ~0x3;
3372 }
3373
3374 /* What about be,n 0(sr0,%rp)? It's just another way we return to
3375 the original caller from the stub. Used in dynamic executables. */
3376 else if (curr_inst == 0xe0400002)
3377 {
3378 /* The value we jump to is sitting in sp - 24. But that's
3379 loaded several instructions before the be instruction.
3380 I guess we could check for the previous instruction being
3381 mtsp %r1,%sr0 if we want to do sanity checking. */
3382 return (read_memory_integer
3383 (read_register (SP_REGNUM) - 24, TARGET_PTR_BIT / 8)) & ~0x3;
3384 }
3385
3386 /* Haven't found the branch yet, but we're still in the stub.
3387 Keep looking. */
3388 loc += 4;
3389 }
3390 }
3391
3392
3393 /* For the given instruction (INST), return any adjustment it makes
3394 to the stack pointer or zero for no adjustment.
3395
3396 This only handles instructions commonly found in prologues. */
3397
3398 static int
3399 prologue_inst_adjust_sp (unsigned long inst)
3400 {
3401 /* This must persist across calls. */
3402 static int save_high21;
3403
3404 /* The most common way to perform a stack adjustment ldo X(sp),sp */
3405 if ((inst & 0xffffc000) == 0x37de0000)
3406 return extract_14 (inst);
3407
3408 /* stwm X,D(sp) */
3409 if ((inst & 0xffe00000) == 0x6fc00000)
3410 return extract_14 (inst);
3411
3412 /* std,ma X,D(sp) */
3413 if ((inst & 0xffe00008) == 0x73c00008)
3414 return (inst & 0x1 ? -1 << 13 : 0) | (((inst >> 4) & 0x3ff) << 3);
3415
3416 /* addil high21,%r1; ldo low11,(%r1),%r30)
3417 save high bits in save_high21 for later use. */
3418 if ((inst & 0xffe00000) == 0x28200000)
3419 {
3420 save_high21 = extract_21 (inst);
3421 return 0;
3422 }
3423
3424 if ((inst & 0xffff0000) == 0x343e0000)
3425 return save_high21 + extract_14 (inst);
3426
3427 /* fstws as used by the HP compilers. */
3428 if ((inst & 0xffffffe0) == 0x2fd01220)
3429 return extract_5_load (inst);
3430
3431 /* No adjustment. */
3432 return 0;
3433 }
3434
3435 /* Return nonzero if INST is a branch of some kind, else return zero. */
3436
3437 static int
3438 is_branch (unsigned long inst)
3439 {
3440 switch (inst >> 26)
3441 {
3442 case 0x20:
3443 case 0x21:
3444 case 0x22:
3445 case 0x23:
3446 case 0x27:
3447 case 0x28:
3448 case 0x29:
3449 case 0x2a:
3450 case 0x2b:
3451 case 0x2f:
3452 case 0x30:
3453 case 0x31:
3454 case 0x32:
3455 case 0x33:
3456 case 0x38:
3457 case 0x39:
3458 case 0x3a:
3459 case 0x3b:
3460 return 1;
3461
3462 default:
3463 return 0;
3464 }
3465 }
3466
3467 /* Return the register number for a GR which is saved by INST or
3468 zero it INST does not save a GR. */
3469
3470 static int
3471 inst_saves_gr (unsigned long inst)
3472 {
3473 /* Does it look like a stw? */
3474 if ((inst >> 26) == 0x1a || (inst >> 26) == 0x1b
3475 || (inst >> 26) == 0x1f
3476 || ((inst >> 26) == 0x1f
3477 && ((inst >> 6) == 0xa)))
3478 return extract_5R_store (inst);
3479
3480 /* Does it look like a std? */
3481 if ((inst >> 26) == 0x1c
3482 || ((inst >> 26) == 0x03
3483 && ((inst >> 6) & 0xf) == 0xb))
3484 return extract_5R_store (inst);
3485
3486 /* Does it look like a stwm? GCC & HPC may use this in prologues. */
3487 if ((inst >> 26) == 0x1b)
3488 return extract_5R_store (inst);
3489
3490 /* Does it look like sth or stb? HPC versions 9.0 and later use these
3491 too. */
3492 if ((inst >> 26) == 0x19 || (inst >> 26) == 0x18
3493 || ((inst >> 26) == 0x3
3494 && (((inst >> 6) & 0xf) == 0x8
3495 || (inst >> 6) & 0xf) == 0x9))
3496 return extract_5R_store (inst);
3497
3498 return 0;
3499 }
3500
3501 /* Return the register number for a FR which is saved by INST or
3502 zero it INST does not save a FR.
3503
3504 Note we only care about full 64bit register stores (that's the only
3505 kind of stores the prologue will use).
3506
3507 FIXME: What about argument stores with the HP compiler in ANSI mode? */
3508
3509 static int
3510 inst_saves_fr (unsigned long inst)
3511 {
3512 /* is this an FSTD ? */
3513 if ((inst & 0xfc00dfc0) == 0x2c001200)
3514 return extract_5r_store (inst);
3515 if ((inst & 0xfc000002) == 0x70000002)
3516 return extract_5R_store (inst);
3517 /* is this an FSTW ? */
3518 if ((inst & 0xfc00df80) == 0x24001200)
3519 return extract_5r_store (inst);
3520 if ((inst & 0xfc000002) == 0x7c000000)
3521 return extract_5R_store (inst);
3522 return 0;
3523 }
3524
3525 /* Advance PC across any function entry prologue instructions
3526 to reach some "real" code.
3527
3528 Use information in the unwind table to determine what exactly should
3529 be in the prologue. */
3530
3531
3532 CORE_ADDR
3533 skip_prologue_hard_way (CORE_ADDR pc)
3534 {
3535 char buf[4];
3536 CORE_ADDR orig_pc = pc;
3537 unsigned long inst, stack_remaining, save_gr, save_fr, save_rp, save_sp;
3538 unsigned long args_stored, status, i, restart_gr, restart_fr;
3539 struct unwind_table_entry *u;
3540
3541 restart_gr = 0;
3542 restart_fr = 0;
3543
3544 restart:
3545 u = find_unwind_entry (pc);
3546 if (!u)
3547 return pc;
3548
3549 /* If we are not at the beginning of a function, then return now. */
3550 if ((pc & ~0x3) != u->region_start)
3551 return pc;
3552
3553 /* This is how much of a frame adjustment we need to account for. */
3554 stack_remaining = u->Total_frame_size << 3;
3555
3556 /* Magic register saves we want to know about. */
3557 save_rp = u->Save_RP;
3558 save_sp = u->Save_SP;
3559
3560 /* An indication that args may be stored into the stack. Unfortunately
3561 the HPUX compilers tend to set this in cases where no args were
3562 stored too!. */
3563 args_stored = 1;
3564
3565 /* Turn the Entry_GR field into a bitmask. */
3566 save_gr = 0;
3567 for (i = 3; i < u->Entry_GR + 3; i++)
3568 {
3569 /* Frame pointer gets saved into a special location. */
3570 if (u->Save_SP && i == FP_REGNUM)
3571 continue;
3572
3573 save_gr |= (1 << i);
3574 }
3575 save_gr &= ~restart_gr;
3576
3577 /* Turn the Entry_FR field into a bitmask too. */
3578 save_fr = 0;
3579 for (i = 12; i < u->Entry_FR + 12; i++)
3580 save_fr |= (1 << i);
3581 save_fr &= ~restart_fr;
3582
3583 /* Loop until we find everything of interest or hit a branch.
3584
3585 For unoptimized GCC code and for any HP CC code this will never ever
3586 examine any user instructions.
3587
3588 For optimzied GCC code we're faced with problems. GCC will schedule
3589 its prologue and make prologue instructions available for delay slot
3590 filling. The end result is user code gets mixed in with the prologue
3591 and a prologue instruction may be in the delay slot of the first branch
3592 or call.
3593
3594 Some unexpected things are expected with debugging optimized code, so
3595 we allow this routine to walk past user instructions in optimized
3596 GCC code. */
3597 while (save_gr || save_fr || save_rp || save_sp || stack_remaining > 0
3598 || args_stored)
3599 {
3600 unsigned int reg_num;
3601 unsigned long old_stack_remaining, old_save_gr, old_save_fr;
3602 unsigned long old_save_rp, old_save_sp, next_inst;
3603
3604 /* Save copies of all the triggers so we can compare them later
3605 (only for HPC). */
3606 old_save_gr = save_gr;
3607 old_save_fr = save_fr;
3608 old_save_rp = save_rp;
3609 old_save_sp = save_sp;
3610 old_stack_remaining = stack_remaining;
3611
3612 status = target_read_memory (pc, buf, 4);
3613 inst = extract_unsigned_integer (buf, 4);
3614
3615 /* Yow! */
3616 if (status != 0)
3617 return pc;
3618
3619 /* Note the interesting effects of this instruction. */
3620 stack_remaining -= prologue_inst_adjust_sp (inst);
3621
3622 /* There are limited ways to store the return pointer into the
3623 stack. */
3624 if (inst == 0x6bc23fd9 || inst == 0x0fc212c1)
3625 save_rp = 0;
3626
3627 /* These are the only ways we save SP into the stack. At this time
3628 the HP compilers never bother to save SP into the stack. */
3629 if ((inst & 0xffffc000) == 0x6fc10000
3630 || (inst & 0xffffc00c) == 0x73c10008)
3631 save_sp = 0;
3632
3633 /* Are we loading some register with an offset from the argument
3634 pointer? */
3635 if ((inst & 0xffe00000) == 0x37a00000
3636 || (inst & 0xffffffe0) == 0x081d0240)
3637 {
3638 pc += 4;
3639 continue;
3640 }
3641
3642 /* Account for general and floating-point register saves. */
3643 reg_num = inst_saves_gr (inst);
3644 save_gr &= ~(1 << reg_num);
3645
3646 /* Ugh. Also account for argument stores into the stack.
3647 Unfortunately args_stored only tells us that some arguments
3648 where stored into the stack. Not how many or what kind!
3649
3650 This is a kludge as on the HP compiler sets this bit and it
3651 never does prologue scheduling. So once we see one, skip past
3652 all of them. We have similar code for the fp arg stores below.
3653
3654 FIXME. Can still die if we have a mix of GR and FR argument
3655 stores! */
3656 if (reg_num >= (TARGET_PTR_BIT == 64 ? 19 : 23) && reg_num <= 26)
3657 {
3658 while (reg_num >= (TARGET_PTR_BIT == 64 ? 19 : 23) && reg_num <= 26)
3659 {
3660 pc += 4;
3661 status = target_read_memory (pc, buf, 4);
3662 inst = extract_unsigned_integer (buf, 4);
3663 if (status != 0)
3664 return pc;
3665 reg_num = inst_saves_gr (inst);
3666 }
3667 args_stored = 0;
3668 continue;
3669 }
3670
3671 reg_num = inst_saves_fr (inst);
3672 save_fr &= ~(1 << reg_num);
3673
3674 status = target_read_memory (pc + 4, buf, 4);
3675 next_inst = extract_unsigned_integer (buf, 4);
3676
3677 /* Yow! */
3678 if (status != 0)
3679 return pc;
3680
3681 /* We've got to be read to handle the ldo before the fp register
3682 save. */
3683 if ((inst & 0xfc000000) == 0x34000000
3684 && inst_saves_fr (next_inst) >= 4
3685 && inst_saves_fr (next_inst) <= (TARGET_PTR_BIT == 64 ? 11 : 7))
3686 {
3687 /* So we drop into the code below in a reasonable state. */
3688 reg_num = inst_saves_fr (next_inst);
3689 pc -= 4;
3690 }
3691
3692 /* Ugh. Also account for argument stores into the stack.
3693 This is a kludge as on the HP compiler sets this bit and it
3694 never does prologue scheduling. So once we see one, skip past
3695 all of them. */
3696 if (reg_num >= 4 && reg_num <= (TARGET_PTR_BIT == 64 ? 11 : 7))
3697 {
3698 while (reg_num >= 4 && reg_num <= (TARGET_PTR_BIT == 64 ? 11 : 7))
3699 {
3700 pc += 8;
3701 status = target_read_memory (pc, buf, 4);
3702 inst = extract_unsigned_integer (buf, 4);
3703 if (status != 0)
3704 return pc;
3705 if ((inst & 0xfc000000) != 0x34000000)
3706 break;
3707 status = target_read_memory (pc + 4, buf, 4);
3708 next_inst = extract_unsigned_integer (buf, 4);
3709 if (status != 0)
3710 return pc;
3711 reg_num = inst_saves_fr (next_inst);
3712 }
3713 args_stored = 0;
3714 continue;
3715 }
3716
3717 /* Quit if we hit any kind of branch. This can happen if a prologue
3718 instruction is in the delay slot of the first call/branch. */
3719 if (is_branch (inst))
3720 break;
3721
3722 /* What a crock. The HP compilers set args_stored even if no
3723 arguments were stored into the stack (boo hiss). This could
3724 cause this code to then skip a bunch of user insns (up to the
3725 first branch).
3726
3727 To combat this we try to identify when args_stored was bogusly
3728 set and clear it. We only do this when args_stored is nonzero,
3729 all other resources are accounted for, and nothing changed on
3730 this pass. */
3731 if (args_stored
3732 && !(save_gr || save_fr || save_rp || save_sp || stack_remaining > 0)
3733 && old_save_gr == save_gr && old_save_fr == save_fr
3734 && old_save_rp == save_rp && old_save_sp == save_sp
3735 && old_stack_remaining == stack_remaining)
3736 break;
3737
3738 /* Bump the PC. */
3739 pc += 4;
3740 }
3741
3742 /* We've got a tenative location for the end of the prologue. However
3743 because of limitations in the unwind descriptor mechanism we may
3744 have went too far into user code looking for the save of a register
3745 that does not exist. So, if there registers we expected to be saved
3746 but never were, mask them out and restart.
3747
3748 This should only happen in optimized code, and should be very rare. */
3749 if (save_gr || (save_fr && !(restart_fr || restart_gr)))
3750 {
3751 pc = orig_pc;
3752 restart_gr = save_gr;
3753 restart_fr = save_fr;
3754 goto restart;
3755 }
3756
3757 return pc;
3758 }
3759
3760
3761 /* Return the address of the PC after the last prologue instruction if
3762 we can determine it from the debug symbols. Else return zero. */
3763
3764 static CORE_ADDR
3765 after_prologue (CORE_ADDR pc)
3766 {
3767 struct symtab_and_line sal;
3768 CORE_ADDR func_addr, func_end;
3769 struct symbol *f;
3770
3771 /* If we can not find the symbol in the partial symbol table, then
3772 there is no hope we can determine the function's start address
3773 with this code. */
3774 if (!find_pc_partial_function (pc, NULL, &func_addr, &func_end))
3775 return 0;
3776
3777 /* Get the line associated with FUNC_ADDR. */
3778 sal = find_pc_line (func_addr, 0);
3779
3780 /* There are only two cases to consider. First, the end of the source line
3781 is within the function bounds. In that case we return the end of the
3782 source line. Second is the end of the source line extends beyond the
3783 bounds of the current function. We need to use the slow code to
3784 examine instructions in that case.
3785
3786 Anything else is simply a bug elsewhere. Fixing it here is absolutely
3787 the wrong thing to do. In fact, it should be entirely possible for this
3788 function to always return zero since the slow instruction scanning code
3789 is supposed to *always* work. If it does not, then it is a bug. */
3790 if (sal.end < func_end)
3791 return sal.end;
3792 else
3793 return 0;
3794 }
3795
3796 /* To skip prologues, I use this predicate. Returns either PC itself
3797 if the code at PC does not look like a function prologue; otherwise
3798 returns an address that (if we're lucky) follows the prologue. If
3799 LENIENT, then we must skip everything which is involved in setting
3800 up the frame (it's OK to skip more, just so long as we don't skip
3801 anything which might clobber the registers which are being saved.
3802 Currently we must not skip more on the alpha, but we might the lenient
3803 stuff some day. */
3804
3805 CORE_ADDR
3806 hppa_skip_prologue (CORE_ADDR pc)
3807 {
3808 unsigned long inst;
3809 int offset;
3810 CORE_ADDR post_prologue_pc;
3811 char buf[4];
3812
3813 /* See if we can determine the end of the prologue via the symbol table.
3814 If so, then return either PC, or the PC after the prologue, whichever
3815 is greater. */
3816
3817 post_prologue_pc = after_prologue (pc);
3818
3819 /* If after_prologue returned a useful address, then use it. Else
3820 fall back on the instruction skipping code.
3821
3822 Some folks have claimed this causes problems because the breakpoint
3823 may be the first instruction of the prologue. If that happens, then
3824 the instruction skipping code has a bug that needs to be fixed. */
3825 if (post_prologue_pc != 0)
3826 return max (pc, post_prologue_pc);
3827 else
3828 return (skip_prologue_hard_way (pc));
3829 }
3830
3831 /* Put here the code to store, into a struct frame_saved_regs,
3832 the addresses of the saved registers of frame described by FRAME_INFO.
3833 This includes special registers such as pc and fp saved in special
3834 ways in the stack frame. sp is even more special:
3835 the address we return for it IS the sp for the next frame. */
3836
3837 void
3838 hppa_frame_find_saved_regs (struct frame_info *frame_info,
3839 struct frame_saved_regs *frame_saved_regs)
3840 {
3841 CORE_ADDR pc;
3842 struct unwind_table_entry *u;
3843 unsigned long inst, stack_remaining, save_gr, save_fr, save_rp, save_sp;
3844 int status, i, reg;
3845 char buf[4];
3846 int fp_loc = -1;
3847 int final_iteration;
3848
3849 /* Zero out everything. */
3850 memset (frame_saved_regs, '\0', sizeof (struct frame_saved_regs));
3851
3852 /* Call dummy frames always look the same, so there's no need to
3853 examine the dummy code to determine locations of saved registers;
3854 instead, let find_dummy_frame_regs fill in the correct offsets
3855 for the saved registers. */
3856 if ((frame_info->pc >= frame_info->frame
3857 && frame_info->pc <= (frame_info->frame
3858 /* A call dummy is sized in words, but it is
3859 actually a series of instructions. Account
3860 for that scaling factor. */
3861 + ((REGISTER_SIZE / INSTRUCTION_SIZE)
3862 * CALL_DUMMY_LENGTH)
3863 /* Similarly we have to account for 64bit
3864 wide register saves. */
3865 + (32 * REGISTER_SIZE)
3866 /* We always consider FP regs 8 bytes long. */
3867 + (NUM_REGS - FP0_REGNUM) * 8
3868 /* Similarly we have to account for 64bit
3869 wide register saves. */
3870 + (6 * REGISTER_SIZE))))
3871 find_dummy_frame_regs (frame_info, frame_saved_regs);
3872
3873 /* Interrupt handlers are special too. They lay out the register
3874 state in the exact same order as the register numbers in GDB. */
3875 if (pc_in_interrupt_handler (frame_info->pc))
3876 {
3877 for (i = 0; i < NUM_REGS; i++)
3878 {
3879 /* SP is a little special. */
3880 if (i == SP_REGNUM)
3881 frame_saved_regs->regs[SP_REGNUM]
3882 = read_memory_integer (frame_info->frame + SP_REGNUM * 4,
3883 TARGET_PTR_BIT / 8);
3884 else
3885 frame_saved_regs->regs[i] = frame_info->frame + i * 4;
3886 }
3887 return;
3888 }
3889
3890 #ifdef FRAME_FIND_SAVED_REGS_IN_SIGTRAMP
3891 /* Handle signal handler callers. */
3892 if ((get_frame_type (frame_info) == SIGTRAMP_FRAME))
3893 {
3894 FRAME_FIND_SAVED_REGS_IN_SIGTRAMP (frame_info, frame_saved_regs);
3895 return;
3896 }
3897 #endif
3898
3899 /* Get the starting address of the function referred to by the PC
3900 saved in frame. */
3901 pc = get_pc_function_start (frame_info->pc);
3902
3903 /* Yow! */
3904 u = find_unwind_entry (pc);
3905 if (!u)
3906 return;
3907
3908 /* This is how much of a frame adjustment we need to account for. */
3909 stack_remaining = u->Total_frame_size << 3;
3910
3911 /* Magic register saves we want to know about. */
3912 save_rp = u->Save_RP;
3913 save_sp = u->Save_SP;
3914
3915 /* Turn the Entry_GR field into a bitmask. */
3916 save_gr = 0;
3917 for (i = 3; i < u->Entry_GR + 3; i++)
3918 {
3919 /* Frame pointer gets saved into a special location. */
3920 if (u->Save_SP && i == FP_REGNUM)
3921 continue;
3922
3923 save_gr |= (1 << i);
3924 }
3925
3926 /* Turn the Entry_FR field into a bitmask too. */
3927 save_fr = 0;
3928 for (i = 12; i < u->Entry_FR + 12; i++)
3929 save_fr |= (1 << i);
3930
3931 /* The frame always represents the value of %sp at entry to the
3932 current function (and is thus equivalent to the "saved" stack
3933 pointer. */
3934 frame_saved_regs->regs[SP_REGNUM] = frame_info->frame;
3935
3936 /* Loop until we find everything of interest or hit a branch.
3937
3938 For unoptimized GCC code and for any HP CC code this will never ever
3939 examine any user instructions.
3940
3941 For optimized GCC code we're faced with problems. GCC will schedule
3942 its prologue and make prologue instructions available for delay slot
3943 filling. The end result is user code gets mixed in with the prologue
3944 and a prologue instruction may be in the delay slot of the first branch
3945 or call.
3946
3947 Some unexpected things are expected with debugging optimized code, so
3948 we allow this routine to walk past user instructions in optimized
3949 GCC code. */
3950 final_iteration = 0;
3951 while ((save_gr || save_fr || save_rp || save_sp || stack_remaining > 0)
3952 && pc <= frame_info->pc)
3953 {
3954 status = target_read_memory (pc, buf, 4);
3955 inst = extract_unsigned_integer (buf, 4);
3956
3957 /* Yow! */
3958 if (status != 0)
3959 return;
3960
3961 /* Note the interesting effects of this instruction. */
3962 stack_remaining -= prologue_inst_adjust_sp (inst);
3963
3964 /* There are limited ways to store the return pointer into the
3965 stack. */
3966 if (inst == 0x6bc23fd9) /* stw rp,-0x14(sr0,sp) */
3967 {
3968 save_rp = 0;
3969 frame_saved_regs->regs[RP_REGNUM] = frame_info->frame - 20;
3970 }
3971 else if (inst == 0x0fc212c1) /* std rp,-0x10(sr0,sp) */
3972 {
3973 save_rp = 0;
3974 frame_saved_regs->regs[RP_REGNUM] = frame_info->frame - 16;
3975 }
3976
3977 /* Note if we saved SP into the stack. This also happens to indicate
3978 the location of the saved frame pointer. */
3979 if ( (inst & 0xffffc000) == 0x6fc10000 /* stw,ma r1,N(sr0,sp) */
3980 || (inst & 0xffffc00c) == 0x73c10008) /* std,ma r1,N(sr0,sp) */
3981 {
3982 frame_saved_regs->regs[FP_REGNUM] = frame_info->frame;
3983 save_sp = 0;
3984 }
3985
3986 /* Account for general and floating-point register saves. */
3987 reg = inst_saves_gr (inst);
3988 if (reg >= 3 && reg <= 18
3989 && (!u->Save_SP || reg != FP_REGNUM))
3990 {
3991 save_gr &= ~(1 << reg);
3992
3993 /* stwm with a positive displacement is a *post modify*. */
3994 if ((inst >> 26) == 0x1b
3995 && extract_14 (inst) >= 0)
3996 frame_saved_regs->regs[reg] = frame_info->frame;
3997 /* A std has explicit post_modify forms. */
3998 else if ((inst & 0xfc00000c0) == 0x70000008)
3999 frame_saved_regs->regs[reg] = frame_info->frame;
4000 else
4001 {
4002 CORE_ADDR offset;
4003
4004 if ((inst >> 26) == 0x1c)
4005 offset = (inst & 0x1 ? -1 << 13 : 0) | (((inst >> 4) & 0x3ff) << 3);
4006 else if ((inst >> 26) == 0x03)
4007 offset = low_sign_extend (inst & 0x1f, 5);
4008 else
4009 offset = extract_14 (inst);
4010
4011 /* Handle code with and without frame pointers. */
4012 if (u->Save_SP)
4013 frame_saved_regs->regs[reg]
4014 = frame_info->frame + offset;
4015 else
4016 frame_saved_regs->regs[reg]
4017 = (frame_info->frame + (u->Total_frame_size << 3)
4018 + offset);
4019 }
4020 }
4021
4022
4023 /* GCC handles callee saved FP regs a little differently.
4024
4025 It emits an instruction to put the value of the start of
4026 the FP store area into %r1. It then uses fstds,ma with
4027 a basereg of %r1 for the stores.
4028
4029 HP CC emits them at the current stack pointer modifying
4030 the stack pointer as it stores each register. */
4031
4032 /* ldo X(%r3),%r1 or ldo X(%r30),%r1. */
4033 if ((inst & 0xffffc000) == 0x34610000
4034 || (inst & 0xffffc000) == 0x37c10000)
4035 fp_loc = extract_14 (inst);
4036
4037 reg = inst_saves_fr (inst);
4038 if (reg >= 12 && reg <= 21)
4039 {
4040 /* Note +4 braindamage below is necessary because the FP status
4041 registers are internally 8 registers rather than the expected
4042 4 registers. */
4043 save_fr &= ~(1 << reg);
4044 if (fp_loc == -1)
4045 {
4046 /* 1st HP CC FP register store. After this instruction
4047 we've set enough state that the GCC and HPCC code are
4048 both handled in the same manner. */
4049 frame_saved_regs->regs[reg + FP4_REGNUM + 4] = frame_info->frame;
4050 fp_loc = 8;
4051 }
4052 else
4053 {
4054 frame_saved_regs->regs[reg + FP0_REGNUM + 4]
4055 = frame_info->frame + fp_loc;
4056 fp_loc += 8;
4057 }
4058 }
4059
4060 /* Quit if we hit any kind of branch the previous iteration. */
4061 if (final_iteration)
4062 break;
4063
4064 /* We want to look precisely one instruction beyond the branch
4065 if we have not found everything yet. */
4066 if (is_branch (inst))
4067 final_iteration = 1;
4068
4069 /* Bump the PC. */
4070 pc += 4;
4071 }
4072 }
4073
4074
4075 /* Exception handling support for the HP-UX ANSI C++ compiler.
4076 The compiler (aCC) provides a callback for exception events;
4077 GDB can set a breakpoint on this callback and find out what
4078 exception event has occurred. */
4079
4080 /* The name of the hook to be set to point to the callback function */
4081 static char HP_ACC_EH_notify_hook[] = "__eh_notify_hook";
4082 /* The name of the function to be used to set the hook value */
4083 static char HP_ACC_EH_set_hook_value[] = "__eh_set_hook_value";
4084 /* The name of the callback function in end.o */
4085 static char HP_ACC_EH_notify_callback[] = "__d_eh_notify_callback";
4086 /* Name of function in end.o on which a break is set (called by above) */
4087 static char HP_ACC_EH_break[] = "__d_eh_break";
4088 /* Name of flag (in end.o) that enables catching throws */
4089 static char HP_ACC_EH_catch_throw[] = "__d_eh_catch_throw";
4090 /* Name of flag (in end.o) that enables catching catching */
4091 static char HP_ACC_EH_catch_catch[] = "__d_eh_catch_catch";
4092 /* The enum used by aCC */
4093 typedef enum
4094 {
4095 __EH_NOTIFY_THROW,
4096 __EH_NOTIFY_CATCH
4097 }
4098 __eh_notification;
4099
4100 /* Is exception-handling support available with this executable? */
4101 static int hp_cxx_exception_support = 0;
4102 /* Has the initialize function been run? */
4103 int hp_cxx_exception_support_initialized = 0;
4104 /* Similar to above, but imported from breakpoint.c -- non-target-specific */
4105 extern int exception_support_initialized;
4106 /* Address of __eh_notify_hook */
4107 static CORE_ADDR eh_notify_hook_addr = 0;
4108 /* Address of __d_eh_notify_callback */
4109 static CORE_ADDR eh_notify_callback_addr = 0;
4110 /* Address of __d_eh_break */
4111 static CORE_ADDR eh_break_addr = 0;
4112 /* Address of __d_eh_catch_catch */
4113 static CORE_ADDR eh_catch_catch_addr = 0;
4114 /* Address of __d_eh_catch_throw */
4115 static CORE_ADDR eh_catch_throw_addr = 0;
4116 /* Sal for __d_eh_break */
4117 static struct symtab_and_line *break_callback_sal = 0;
4118
4119 /* Code in end.c expects __d_pid to be set in the inferior,
4120 otherwise __d_eh_notify_callback doesn't bother to call
4121 __d_eh_break! So we poke the pid into this symbol
4122 ourselves.
4123 0 => success
4124 1 => failure */
4125 int
4126 setup_d_pid_in_inferior (void)
4127 {
4128 CORE_ADDR anaddr;
4129 struct minimal_symbol *msymbol;
4130 char buf[4]; /* FIXME 32x64? */
4131
4132 /* Slam the pid of the process into __d_pid; failing is only a warning! */
4133 msymbol = lookup_minimal_symbol ("__d_pid", NULL, symfile_objfile);
4134 if (msymbol == NULL)
4135 {
4136 warning ("Unable to find __d_pid symbol in object file.");
4137 warning ("Suggest linking executable with -g (links in /opt/langtools/lib/end.o).");
4138 return 1;
4139 }
4140
4141 anaddr = SYMBOL_VALUE_ADDRESS (msymbol);
4142 store_unsigned_integer (buf, 4, PIDGET (inferior_ptid)); /* FIXME 32x64? */
4143 if (target_write_memory (anaddr, buf, 4)) /* FIXME 32x64? */
4144 {
4145 warning ("Unable to write __d_pid");
4146 warning ("Suggest linking executable with -g (links in /opt/langtools/lib/end.o).");
4147 return 1;
4148 }
4149 return 0;
4150 }
4151
4152 /* Initialize exception catchpoint support by looking for the
4153 necessary hooks/callbacks in end.o, etc., and set the hook value to
4154 point to the required debug function
4155
4156 Return 0 => failure
4157 1 => success */
4158
4159 static int
4160 initialize_hp_cxx_exception_support (void)
4161 {
4162 struct symtabs_and_lines sals;
4163 struct cleanup *old_chain;
4164 struct cleanup *canonical_strings_chain = NULL;
4165 int i;
4166 char *addr_start;
4167 char *addr_end = NULL;
4168 char **canonical = (char **) NULL;
4169 int thread = -1;
4170 struct symbol *sym = NULL;
4171 struct minimal_symbol *msym = NULL;
4172 struct objfile *objfile;
4173 asection *shlib_info;
4174
4175 /* Detect and disallow recursion. On HP-UX with aCC, infinite
4176 recursion is a possibility because finding the hook for exception
4177 callbacks involves making a call in the inferior, which means
4178 re-inserting breakpoints which can re-invoke this code */
4179
4180 static int recurse = 0;
4181 if (recurse > 0)
4182 {
4183 hp_cxx_exception_support_initialized = 0;
4184 exception_support_initialized = 0;
4185 return 0;
4186 }
4187
4188 hp_cxx_exception_support = 0;
4189
4190 /* First check if we have seen any HP compiled objects; if not,
4191 it is very unlikely that HP's idiosyncratic callback mechanism
4192 for exception handling debug support will be available!
4193 This will percolate back up to breakpoint.c, where our callers
4194 will decide to try the g++ exception-handling support instead. */
4195 if (!hp_som_som_object_present)
4196 return 0;
4197
4198 /* We have a SOM executable with SOM debug info; find the hooks */
4199
4200 /* First look for the notify hook provided by aCC runtime libs */
4201 /* If we find this symbol, we conclude that the executable must
4202 have HP aCC exception support built in. If this symbol is not
4203 found, even though we're a HP SOM-SOM file, we may have been
4204 built with some other compiler (not aCC). This results percolates
4205 back up to our callers in breakpoint.c which can decide to
4206 try the g++ style of exception support instead.
4207 If this symbol is found but the other symbols we require are
4208 not found, there is something weird going on, and g++ support
4209 should *not* be tried as an alternative.
4210
4211 ASSUMPTION: Only HP aCC code will have __eh_notify_hook defined.
4212 ASSUMPTION: HP aCC and g++ modules cannot be linked together. */
4213
4214 /* libCsup has this hook; it'll usually be non-debuggable */
4215 msym = lookup_minimal_symbol (HP_ACC_EH_notify_hook, NULL, NULL);
4216 if (msym)
4217 {
4218 eh_notify_hook_addr = SYMBOL_VALUE_ADDRESS (msym);
4219 hp_cxx_exception_support = 1;
4220 }
4221 else
4222 {
4223 warning ("Unable to find exception callback hook (%s).", HP_ACC_EH_notify_hook);
4224 warning ("Executable may not have been compiled debuggable with HP aCC.");
4225 warning ("GDB will be unable to intercept exception events.");
4226 eh_notify_hook_addr = 0;
4227 hp_cxx_exception_support = 0;
4228 return 0;
4229 }
4230
4231 /* Next look for the notify callback routine in end.o */
4232 /* This is always available in the SOM symbol dictionary if end.o is linked in */
4233 msym = lookup_minimal_symbol (HP_ACC_EH_notify_callback, NULL, NULL);
4234 if (msym)
4235 {
4236 eh_notify_callback_addr = SYMBOL_VALUE_ADDRESS (msym);
4237 hp_cxx_exception_support = 1;
4238 }
4239 else
4240 {
4241 warning ("Unable to find exception callback routine (%s).", HP_ACC_EH_notify_callback);
4242 warning ("Suggest linking executable with -g (links in /opt/langtools/lib/end.o).");
4243 warning ("GDB will be unable to intercept exception events.");
4244 eh_notify_callback_addr = 0;
4245 return 0;
4246 }
4247
4248 #ifndef GDB_TARGET_IS_HPPA_20W
4249 /* Check whether the executable is dynamically linked or archive bound */
4250 /* With an archive-bound executable we can use the raw addresses we find
4251 for the callback function, etc. without modification. For an executable
4252 with shared libraries, we have to do more work to find the plabel, which
4253 can be the target of a call through $$dyncall from the aCC runtime support
4254 library (libCsup) which is linked shared by default by aCC. */
4255 /* This test below was copied from somsolib.c/somread.c. It may not be a very
4256 reliable one to test that an executable is linked shared. pai/1997-07-18 */
4257 shlib_info = bfd_get_section_by_name (symfile_objfile->obfd, "$SHLIB_INFO$");
4258 if (shlib_info && (bfd_section_size (symfile_objfile->obfd, shlib_info) != 0))
4259 {
4260 /* The minsym we have has the local code address, but that's not the
4261 plabel that can be used by an inter-load-module call. */
4262 /* Find solib handle for main image (which has end.o), and use that
4263 and the min sym as arguments to __d_shl_get() (which does the equivalent
4264 of shl_findsym()) to find the plabel. */
4265
4266 args_for_find_stub args;
4267 static char message[] = "Error while finding exception callback hook:\n";
4268
4269 args.solib_handle = som_solib_get_solib_by_pc (eh_notify_callback_addr);
4270 args.msym = msym;
4271 args.return_val = 0;
4272
4273 recurse++;
4274 catch_errors (cover_find_stub_with_shl_get, (PTR) &args, message,
4275 RETURN_MASK_ALL);
4276 eh_notify_callback_addr = args.return_val;
4277 recurse--;
4278
4279 exception_catchpoints_are_fragile = 1;
4280
4281 if (!eh_notify_callback_addr)
4282 {
4283 /* We can get here either if there is no plabel in the export list
4284 for the main image, or if something strange happened (?) */
4285 warning ("Couldn't find a plabel (indirect function label) for the exception callback.");
4286 warning ("GDB will not be able to intercept exception events.");
4287 return 0;
4288 }
4289 }
4290 else
4291 exception_catchpoints_are_fragile = 0;
4292 #endif
4293
4294 /* Now, look for the breakpointable routine in end.o */
4295 /* This should also be available in the SOM symbol dict. if end.o linked in */
4296 msym = lookup_minimal_symbol (HP_ACC_EH_break, NULL, NULL);
4297 if (msym)
4298 {
4299 eh_break_addr = SYMBOL_VALUE_ADDRESS (msym);
4300 hp_cxx_exception_support = 1;
4301 }
4302 else
4303 {
4304 warning ("Unable to find exception callback routine to set breakpoint (%s).", HP_ACC_EH_break);
4305 warning ("Suggest linking executable with -g (link in /opt/langtools/lib/end.o).");
4306 warning ("GDB will be unable to intercept exception events.");
4307 eh_break_addr = 0;
4308 return 0;
4309 }
4310
4311 /* Next look for the catch enable flag provided in end.o */
4312 sym = lookup_symbol (HP_ACC_EH_catch_catch, (struct block *) NULL,
4313 VAR_NAMESPACE, 0, (struct symtab **) NULL);
4314 if (sym) /* sometimes present in debug info */
4315 {
4316 eh_catch_catch_addr = SYMBOL_VALUE_ADDRESS (sym);
4317 hp_cxx_exception_support = 1;
4318 }
4319 else
4320 /* otherwise look in SOM symbol dict. */
4321 {
4322 msym = lookup_minimal_symbol (HP_ACC_EH_catch_catch, NULL, NULL);
4323 if (msym)
4324 {
4325 eh_catch_catch_addr = SYMBOL_VALUE_ADDRESS (msym);
4326 hp_cxx_exception_support = 1;
4327 }
4328 else
4329 {
4330 warning ("Unable to enable interception of exception catches.");
4331 warning ("Executable may not have been compiled debuggable with HP aCC.");
4332 warning ("Suggest linking executable with -g (link in /opt/langtools/lib/end.o).");
4333 return 0;
4334 }
4335 }
4336
4337 /* Next look for the catch enable flag provided end.o */
4338 sym = lookup_symbol (HP_ACC_EH_catch_catch, (struct block *) NULL,
4339 VAR_NAMESPACE, 0, (struct symtab **) NULL);
4340 if (sym) /* sometimes present in debug info */
4341 {
4342 eh_catch_throw_addr = SYMBOL_VALUE_ADDRESS (sym);
4343 hp_cxx_exception_support = 1;
4344 }
4345 else
4346 /* otherwise look in SOM symbol dict. */
4347 {
4348 msym = lookup_minimal_symbol (HP_ACC_EH_catch_throw, NULL, NULL);
4349 if (msym)
4350 {
4351 eh_catch_throw_addr = SYMBOL_VALUE_ADDRESS (msym);
4352 hp_cxx_exception_support = 1;
4353 }
4354 else
4355 {
4356 warning ("Unable to enable interception of exception throws.");
4357 warning ("Executable may not have been compiled debuggable with HP aCC.");
4358 warning ("Suggest linking executable with -g (link in /opt/langtools/lib/end.o).");
4359 return 0;
4360 }
4361 }
4362
4363 /* Set the flags */
4364 hp_cxx_exception_support = 2; /* everything worked so far */
4365 hp_cxx_exception_support_initialized = 1;
4366 exception_support_initialized = 1;
4367
4368 return 1;
4369 }
4370
4371 /* Target operation for enabling or disabling interception of
4372 exception events.
4373 KIND is either EX_EVENT_THROW or EX_EVENT_CATCH
4374 ENABLE is either 0 (disable) or 1 (enable).
4375 Return value is NULL if no support found;
4376 -1 if something went wrong,
4377 or a pointer to a symtab/line struct if the breakpointable
4378 address was found. */
4379
4380 struct symtab_and_line *
4381 child_enable_exception_callback (enum exception_event_kind kind, int enable)
4382 {
4383 char buf[4];
4384
4385 if (!exception_support_initialized || !hp_cxx_exception_support_initialized)
4386 if (!initialize_hp_cxx_exception_support ())
4387 return NULL;
4388
4389 switch (hp_cxx_exception_support)
4390 {
4391 case 0:
4392 /* Assuming no HP support at all */
4393 return NULL;
4394 case 1:
4395 /* HP support should be present, but something went wrong */
4396 return (struct symtab_and_line *) -1; /* yuck! */
4397 /* there may be other cases in the future */
4398 }
4399
4400 /* Set the EH hook to point to the callback routine */
4401 store_unsigned_integer (buf, 4, enable ? eh_notify_callback_addr : 0); /* FIXME 32x64 problem */
4402 /* pai: (temp) FIXME should there be a pack operation first? */
4403 if (target_write_memory (eh_notify_hook_addr, buf, 4)) /* FIXME 32x64 problem */
4404 {
4405 warning ("Could not write to target memory for exception event callback.");
4406 warning ("Interception of exception events may not work.");
4407 return (struct symtab_and_line *) -1;
4408 }
4409 if (enable)
4410 {
4411 /* Ensure that __d_pid is set up correctly -- end.c code checks this. :-( */
4412 if (PIDGET (inferior_ptid) > 0)
4413 {
4414 if (setup_d_pid_in_inferior ())
4415 return (struct symtab_and_line *) -1;
4416 }
4417 else
4418 {
4419 warning ("Internal error: Invalid inferior pid? Cannot intercept exception events.");
4420 return (struct symtab_and_line *) -1;
4421 }
4422 }
4423
4424 switch (kind)
4425 {
4426 case EX_EVENT_THROW:
4427 store_unsigned_integer (buf, 4, enable ? 1 : 0);
4428 if (target_write_memory (eh_catch_throw_addr, buf, 4)) /* FIXME 32x64? */
4429 {
4430 warning ("Couldn't enable exception throw interception.");
4431 return (struct symtab_and_line *) -1;
4432 }
4433 break;
4434 case EX_EVENT_CATCH:
4435 store_unsigned_integer (buf, 4, enable ? 1 : 0);
4436 if (target_write_memory (eh_catch_catch_addr, buf, 4)) /* FIXME 32x64? */
4437 {
4438 warning ("Couldn't enable exception catch interception.");
4439 return (struct symtab_and_line *) -1;
4440 }
4441 break;
4442 default:
4443 error ("Request to enable unknown or unsupported exception event.");
4444 }
4445
4446 /* Copy break address into new sal struct, malloc'ing if needed. */
4447 if (!break_callback_sal)
4448 {
4449 break_callback_sal = (struct symtab_and_line *) xmalloc (sizeof (struct symtab_and_line));
4450 }
4451 init_sal (break_callback_sal);
4452 break_callback_sal->symtab = NULL;
4453 break_callback_sal->pc = eh_break_addr;
4454 break_callback_sal->line = 0;
4455 break_callback_sal->end = eh_break_addr;
4456
4457 return break_callback_sal;
4458 }
4459
4460 /* Record some information about the current exception event */
4461 static struct exception_event_record current_ex_event;
4462 /* Convenience struct */
4463 static struct symtab_and_line null_symtab_and_line =
4464 {NULL, 0, 0, 0};
4465
4466 /* Report current exception event. Returns a pointer to a record
4467 that describes the kind of the event, where it was thrown from,
4468 and where it will be caught. More information may be reported
4469 in the future */
4470 struct exception_event_record *
4471 child_get_current_exception_event (void)
4472 {
4473 CORE_ADDR event_kind;
4474 CORE_ADDR throw_addr;
4475 CORE_ADDR catch_addr;
4476 struct frame_info *fi, *curr_frame;
4477 int level = 1;
4478
4479 curr_frame = get_current_frame ();
4480 if (!curr_frame)
4481 return (struct exception_event_record *) NULL;
4482
4483 /* Go up one frame to __d_eh_notify_callback, because at the
4484 point when this code is executed, there's garbage in the
4485 arguments of __d_eh_break. */
4486 fi = find_relative_frame (curr_frame, &level);
4487 if (level != 0)
4488 return (struct exception_event_record *) NULL;
4489
4490 select_frame (fi);
4491
4492 /* Read in the arguments */
4493 /* __d_eh_notify_callback() is called with 3 arguments:
4494 1. event kind catch or throw
4495 2. the target address if known
4496 3. a flag -- not sure what this is. pai/1997-07-17 */
4497 event_kind = read_register (ARG0_REGNUM);
4498 catch_addr = read_register (ARG1_REGNUM);
4499
4500 /* Now go down to a user frame */
4501 /* For a throw, __d_eh_break is called by
4502 __d_eh_notify_callback which is called by
4503 __notify_throw which is called
4504 from user code.
4505 For a catch, __d_eh_break is called by
4506 __d_eh_notify_callback which is called by
4507 <stackwalking stuff> which is called by
4508 __throw__<stuff> or __rethrow_<stuff> which is called
4509 from user code. */
4510 /* FIXME: Don't use such magic numbers; search for the frames */
4511 level = (event_kind == EX_EVENT_THROW) ? 3 : 4;
4512 fi = find_relative_frame (curr_frame, &level);
4513 if (level != 0)
4514 return (struct exception_event_record *) NULL;
4515
4516 select_frame (fi);
4517 throw_addr = fi->pc;
4518
4519 /* Go back to original (top) frame */
4520 select_frame (curr_frame);
4521
4522 current_ex_event.kind = (enum exception_event_kind) event_kind;
4523 current_ex_event.throw_sal = find_pc_line (throw_addr, 1);
4524 current_ex_event.catch_sal = find_pc_line (catch_addr, 1);
4525
4526 return &current_ex_event;
4527 }
4528
4529 static void
4530 unwind_command (char *exp, int from_tty)
4531 {
4532 CORE_ADDR address;
4533 struct unwind_table_entry *u;
4534
4535 /* If we have an expression, evaluate it and use it as the address. */
4536
4537 if (exp != 0 && *exp != 0)
4538 address = parse_and_eval_address (exp);
4539 else
4540 return;
4541
4542 u = find_unwind_entry (address);
4543
4544 if (!u)
4545 {
4546 printf_unfiltered ("Can't find unwind table entry for %s\n", exp);
4547 return;
4548 }
4549
4550 printf_unfiltered ("unwind_table_entry (0x%s):\n",
4551 paddr_nz (host_pointer_to_address (u)));
4552
4553 printf_unfiltered ("\tregion_start = ");
4554 print_address (u->region_start, gdb_stdout);
4555
4556 printf_unfiltered ("\n\tregion_end = ");
4557 print_address (u->region_end, gdb_stdout);
4558
4559 #define pif(FLD) if (u->FLD) printf_unfiltered (" "#FLD);
4560
4561 printf_unfiltered ("\n\tflags =");
4562 pif (Cannot_unwind);
4563 pif (Millicode);
4564 pif (Millicode_save_sr0);
4565 pif (Entry_SR);
4566 pif (Args_stored);
4567 pif (Variable_Frame);
4568 pif (Separate_Package_Body);
4569 pif (Frame_Extension_Millicode);
4570 pif (Stack_Overflow_Check);
4571 pif (Two_Instruction_SP_Increment);
4572 pif (Ada_Region);
4573 pif (Save_SP);
4574 pif (Save_RP);
4575 pif (Save_MRP_in_frame);
4576 pif (extn_ptr_defined);
4577 pif (Cleanup_defined);
4578 pif (MPE_XL_interrupt_marker);
4579 pif (HP_UX_interrupt_marker);
4580 pif (Large_frame);
4581
4582 putchar_unfiltered ('\n');
4583
4584 #define pin(FLD) printf_unfiltered ("\t"#FLD" = 0x%x\n", u->FLD);
4585
4586 pin (Region_description);
4587 pin (Entry_FR);
4588 pin (Entry_GR);
4589 pin (Total_frame_size);
4590 }
4591
4592 #ifdef PREPARE_TO_PROCEED
4593
4594 /* If the user has switched threads, and there is a breakpoint
4595 at the old thread's pc location, then switch to that thread
4596 and return TRUE, else return FALSE and don't do a thread
4597 switch (or rather, don't seem to have done a thread switch).
4598
4599 Ptrace-based gdb will always return FALSE to the thread-switch
4600 query, and thus also to PREPARE_TO_PROCEED.
4601
4602 The important thing is whether there is a BPT instruction,
4603 not how many user breakpoints there are. So we have to worry
4604 about things like these:
4605
4606 o Non-bp stop -- NO
4607
4608 o User hits bp, no switch -- NO
4609
4610 o User hits bp, switches threads -- YES
4611
4612 o User hits bp, deletes bp, switches threads -- NO
4613
4614 o User hits bp, deletes one of two or more bps
4615 at that PC, user switches threads -- YES
4616
4617 o Plus, since we're buffering events, the user may have hit a
4618 breakpoint, deleted the breakpoint and then gotten another
4619 hit on that same breakpoint on another thread which
4620 actually hit before the delete. (FIXME in breakpoint.c
4621 so that "dead" breakpoints are ignored?) -- NO
4622
4623 For these reasons, we have to violate information hiding and
4624 call "breakpoint_here_p". If core gdb thinks there is a bpt
4625 here, that's what counts, as core gdb is the one which is
4626 putting the BPT instruction in and taking it out.
4627
4628 Note that this implementation is potentially redundant now that
4629 default_prepare_to_proceed() has been added.
4630
4631 FIXME This may not support switching threads after Ctrl-C
4632 correctly. The default implementation does support this. */
4633 int
4634 hppa_prepare_to_proceed (void)
4635 {
4636 pid_t old_thread;
4637 pid_t current_thread;
4638
4639 old_thread = hppa_switched_threads (PIDGET (inferior_ptid));
4640 if (old_thread != 0)
4641 {
4642 /* Switched over from "old_thread". Try to do
4643 as little work as possible, 'cause mostly
4644 we're going to switch back. */
4645 CORE_ADDR new_pc;
4646 CORE_ADDR old_pc = read_pc ();
4647
4648 /* Yuk, shouldn't use global to specify current
4649 thread. But that's how gdb does it. */
4650 current_thread = PIDGET (inferior_ptid);
4651 inferior_ptid = pid_to_ptid (old_thread);
4652
4653 new_pc = read_pc ();
4654 if (new_pc != old_pc /* If at same pc, no need */
4655 && breakpoint_here_p (new_pc))
4656 {
4657 /* User hasn't deleted the BP.
4658 Return TRUE, finishing switch to "old_thread". */
4659 flush_cached_frames ();
4660 registers_changed ();
4661 #if 0
4662 printf ("---> PREPARE_TO_PROCEED (was %d, now %d)!\n",
4663 current_thread, PIDGET (inferior_ptid));
4664 #endif
4665
4666 return 1;
4667 }
4668
4669 /* Otherwise switch back to the user-chosen thread. */
4670 inferior_ptid = pid_to_ptid (current_thread);
4671 new_pc = read_pc (); /* Re-prime register cache */
4672 }
4673
4674 return 0;
4675 }
4676 #endif /* PREPARE_TO_PROCEED */
4677
4678 void
4679 hppa_skip_permanent_breakpoint (void)
4680 {
4681 /* To step over a breakpoint instruction on the PA takes some
4682 fiddling with the instruction address queue.
4683
4684 When we stop at a breakpoint, the IA queue front (the instruction
4685 we're executing now) points at the breakpoint instruction, and
4686 the IA queue back (the next instruction to execute) points to
4687 whatever instruction we would execute after the breakpoint, if it
4688 were an ordinary instruction. This is the case even if the
4689 breakpoint is in the delay slot of a branch instruction.
4690
4691 Clearly, to step past the breakpoint, we need to set the queue
4692 front to the back. But what do we put in the back? What
4693 instruction comes after that one? Because of the branch delay
4694 slot, the next insn is always at the back + 4. */
4695 write_register (PCOQ_HEAD_REGNUM, read_register (PCOQ_TAIL_REGNUM));
4696 write_register (PCSQ_HEAD_REGNUM, read_register (PCSQ_TAIL_REGNUM));
4697
4698 write_register (PCOQ_TAIL_REGNUM, read_register (PCOQ_TAIL_REGNUM) + 4);
4699 /* We can leave the tail's space the same, since there's no jump. */
4700 }
4701
4702 /* Copy the function value from VALBUF into the proper location
4703 for a function return.
4704
4705 Called only in the context of the "return" command. */
4706
4707 void
4708 hppa_store_return_value (struct type *type, char *valbuf)
4709 {
4710 /* For software floating point, the return value goes into the
4711 integer registers. But we do not have any flag to key this on,
4712 so we always store the value into the integer registers.
4713
4714 If its a float value, then we also store it into the floating
4715 point registers. */
4716 deprecated_write_register_bytes (REGISTER_BYTE (28)
4717 + (TYPE_LENGTH (type) > 4
4718 ? (8 - TYPE_LENGTH (type))
4719 : (4 - TYPE_LENGTH (type))),
4720 valbuf, TYPE_LENGTH (type));
4721 if (! SOFT_FLOAT && TYPE_CODE (type) == TYPE_CODE_FLT)
4722 deprecated_write_register_bytes (REGISTER_BYTE (FP4_REGNUM),
4723 valbuf, TYPE_LENGTH (type));
4724 }
4725
4726 /* Copy the function's return value into VALBUF.
4727
4728 This function is called only in the context of "target function calls",
4729 ie. when the debugger forces a function to be called in the child, and
4730 when the debugger forces a fucntion to return prematurely via the
4731 "return" command. */
4732
4733 void
4734 hppa_extract_return_value (struct type *type, char *regbuf, char *valbuf)
4735 {
4736 if (! SOFT_FLOAT && TYPE_CODE (type) == TYPE_CODE_FLT)
4737 memcpy (valbuf,
4738 (char *)regbuf + REGISTER_BYTE (FP4_REGNUM),
4739 TYPE_LENGTH (type));
4740 else
4741 memcpy (valbuf,
4742 ((char *)regbuf
4743 + REGISTER_BYTE (28)
4744 + (TYPE_LENGTH (type) > 4
4745 ? (8 - TYPE_LENGTH (type))
4746 : (4 - TYPE_LENGTH (type)))),
4747 TYPE_LENGTH (type));
4748 }
4749
4750 int
4751 hppa_reg_struct_has_addr (int gcc_p, struct type *type)
4752 {
4753 /* On the PA, any pass-by-value structure > 8 bytes is actually passed
4754 via a pointer regardless of its type or the compiler used. */
4755 return (TYPE_LENGTH (type) > 8);
4756 }
4757
4758 int
4759 hppa_inner_than (CORE_ADDR lhs, CORE_ADDR rhs)
4760 {
4761 /* Stack grows upward */
4762 return (lhs > rhs);
4763 }
4764
4765 CORE_ADDR
4766 hppa_stack_align (CORE_ADDR sp)
4767 {
4768 /* elz: adjust the quantity to the next highest value which is
4769 64-bit aligned. This is used in valops.c, when the sp is adjusted.
4770 On hppa the sp must always be kept 64-bit aligned */
4771 return ((sp % 8) ? (sp + 7) & -8 : sp);
4772 }
4773
4774 int
4775 hppa_pc_requires_run_before_use (CORE_ADDR pc)
4776 {
4777 /* Sometimes we may pluck out a minimal symbol that has a negative address.
4778
4779 An example of this occurs when an a.out is linked against a foo.sl.
4780 The foo.sl defines a global bar(), and the a.out declares a signature
4781 for bar(). However, the a.out doesn't directly call bar(), but passes
4782 its address in another call.
4783
4784 If you have this scenario and attempt to "break bar" before running,
4785 gdb will find a minimal symbol for bar() in the a.out. But that
4786 symbol's address will be negative. What this appears to denote is
4787 an index backwards from the base of the procedure linkage table (PLT)
4788 into the data linkage table (DLT), the end of which is contiguous
4789 with the start of the PLT. This is clearly not a valid address for
4790 us to set a breakpoint on.
4791
4792 Note that one must be careful in how one checks for a negative address.
4793 0xc0000000 is a legitimate address of something in a shared text
4794 segment, for example. Since I don't know what the possible range
4795 is of these "really, truly negative" addresses that come from the
4796 minimal symbols, I'm resorting to the gross hack of checking the
4797 top byte of the address for all 1's. Sigh. */
4798
4799 return (!target_has_stack && (pc & 0xFF000000));
4800 }
4801
4802 int
4803 hppa_instruction_nullified (void)
4804 {
4805 /* brobecker 2002/11/07: Couldn't we use a ULONGEST here? It would
4806 avoid the type cast. I'm leaving it as is for now as I'm doing
4807 semi-mechanical multiarching-related changes. */
4808 const int ipsw = (int) read_register (IPSW_REGNUM);
4809 const int flags = (int) read_register (FLAGS_REGNUM);
4810
4811 return ((ipsw & 0x00200000) && !(flags & 0x2));
4812 }
4813
4814 /* Index within the register vector of the first byte of the space i
4815 used for register REG_NR. */
4816
4817 int
4818 hppa_register_byte (int reg_nr)
4819 {
4820 return reg_nr * 4;
4821 }
4822
4823 /* Return the GDB type object for the "standard" data type of data
4824 in register N. */
4825
4826 struct type *
4827 hppa_register_virtual_type (int reg_nr)
4828 {
4829 if (reg_nr < FP4_REGNUM)
4830 return builtin_type_int;
4831 else
4832 return builtin_type_float;
4833 }
4834
4835 /* Store the address of the place in which to copy the structure the
4836 subroutine will return. This is called from call_function. */
4837
4838 void
4839 hppa_store_struct_return (CORE_ADDR addr, CORE_ADDR sp)
4840 {
4841 write_register (28, addr);
4842 }
4843
4844 /* Return True if REGNUM is not a register available to the user
4845 through ptrace(). */
4846
4847 int
4848 hppa_cannot_store_register (int regnum)
4849 {
4850 return (regnum == 0
4851 || regnum == PCSQ_HEAD_REGNUM
4852 || (regnum >= PCSQ_TAIL_REGNUM && regnum < IPSW_REGNUM)
4853 || (regnum > IPSW_REGNUM && regnum < FP4_REGNUM));
4854
4855 }
4856
4857 CORE_ADDR
4858 hppa_frame_args_address (struct frame_info *fi)
4859 {
4860 return fi->frame;
4861 }
4862
4863 CORE_ADDR
4864 hppa_frame_locals_address (struct frame_info *fi)
4865 {
4866 return fi->frame;
4867 }
4868
4869 CORE_ADDR
4870 hppa_smash_text_address (CORE_ADDR addr)
4871 {
4872 /* The low two bits of the PC on the PA contain the privilege level.
4873 Some genius implementing a (non-GCC) compiler apparently decided
4874 this means that "addresses" in a text section therefore include a
4875 privilege level, and thus symbol tables should contain these bits.
4876 This seems like a bonehead thing to do--anyway, it seems to work
4877 for our purposes to just ignore those bits. */
4878
4879 return (addr &= ~0x3);
4880 }
4881
4882 int
4883 hppa_coerce_float_to_double (struct type *formal, struct type *actual)
4884 {
4885 /* FIXME: For the pa, it appears that the debug info marks the
4886 parameters as floats regardless of whether the function is
4887 prototyped, but the actual values are passed as doubles for the
4888 non-prototyped case and floats for the prototyped case. Thus we
4889 choose to make the non-prototyped case work for C and break the
4890 prototyped case, since the non-prototyped case is probably much
4891 more common. */
4892 return (current_language -> la_language == language_c);
4893 }
4894
4895 static struct gdbarch *
4896 hppa_gdbarch_init (struct gdbarch_info info, struct gdbarch_list *arches)
4897 {
4898 struct gdbarch *gdbarch;
4899 enum gdb_osabi osabi = GDB_OSABI_UNKNOWN;
4900
4901 /* Try to determine the ABI of the object we are loading. */
4902
4903 if (info.abfd != NULL)
4904 {
4905 osabi = gdbarch_lookup_osabi (info.abfd);
4906 if (osabi == GDB_OSABI_UNKNOWN)
4907 {
4908 /* If it's a SOM file, assume it's HP/UX SOM. */
4909 if (bfd_get_flavour (info.abfd) == bfd_target_som_flavour)
4910 osabi = GDB_OSABI_HPUX_SOM;
4911 }
4912 }
4913
4914 /* find a candidate among the list of pre-declared architectures. */
4915 arches = gdbarch_list_lookup_by_info (arches, &info);
4916 if (arches != NULL)
4917 return (arches->gdbarch);
4918
4919 /* If none found, then allocate and initialize one. */
4920 gdbarch = gdbarch_alloc (&info, NULL);
4921
4922 return gdbarch;
4923 }
4924
4925 static void
4926 hppa_dump_tdep (struct gdbarch *current_gdbarch, struct ui_file *file)
4927 {
4928 /* Nothing to print for the moment. */
4929 }
4930
4931 void
4932 _initialize_hppa_tdep (void)
4933 {
4934 struct cmd_list_element *c;
4935 void break_at_finish_command (char *arg, int from_tty);
4936 void tbreak_at_finish_command (char *arg, int from_tty);
4937 void break_at_finish_at_depth_command (char *arg, int from_tty);
4938
4939 gdbarch_register (bfd_arch_hppa, hppa_gdbarch_init, hppa_dump_tdep);
4940 tm_print_insn = print_insn_hppa;
4941
4942 add_cmd ("unwind", class_maintenance, unwind_command,
4943 "Print unwind table entry at given address.",
4944 &maintenanceprintlist);
4945
4946 deprecate_cmd (add_com ("xbreak", class_breakpoint,
4947 break_at_finish_command,
4948 concat ("Set breakpoint at procedure exit. \n\
4949 Argument may be function name, or \"*\" and an address.\n\
4950 If function is specified, break at end of code for that function.\n\
4951 If an address is specified, break at the end of the function that contains \n\
4952 that exact address.\n",
4953 "With no arg, uses current execution address of selected stack frame.\n\
4954 This is useful for breaking on return to a stack frame.\n\
4955 \n\
4956 Multiple breakpoints at one place are permitted, and useful if conditional.\n\
4957 \n\
4958 Do \"help breakpoints\" for info on other commands dealing with breakpoints.", NULL)), NULL);
4959 deprecate_cmd (add_com_alias ("xb", "xbreak", class_breakpoint, 1), NULL);
4960 deprecate_cmd (add_com_alias ("xbr", "xbreak", class_breakpoint, 1), NULL);
4961 deprecate_cmd (add_com_alias ("xbre", "xbreak", class_breakpoint, 1), NULL);
4962 deprecate_cmd (add_com_alias ("xbrea", "xbreak", class_breakpoint, 1), NULL);
4963
4964 deprecate_cmd (c = add_com ("txbreak", class_breakpoint,
4965 tbreak_at_finish_command,
4966 "Set temporary breakpoint at procedure exit. Either there should\n\
4967 be no argument or the argument must be a depth.\n"), NULL);
4968 set_cmd_completer (c, location_completer);
4969
4970 if (xdb_commands)
4971 deprecate_cmd (add_com ("bx", class_breakpoint,
4972 break_at_finish_at_depth_command,
4973 "Set breakpoint at procedure exit. Either there should\n\
4974 be no argument or the argument must be a depth.\n"), NULL);
4975 }
4976
This page took 0.150907 seconds and 4 git commands to generate.