| blob | 1c4fc4cca47ad7270ae7d3ff7c6c3d5400187f49 |
1 /* Target-dependent code for the IA-64 for GDB, the GNU debugger.
3 Copyright (C) 1999-2021 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
42 #ifdef HAVE_LIBUNWIND_IA64_H
46 /* Note: KERNEL_START is supposed to be an address which is not going
47 to ever contain any valid unwind info. For ia64 linux, the choice
48 of 0xc000000000000000 is fairly safe since that's uncached space.
50 We use KERNEL_START as follows: after obtaining the kernel's
51 unwind table via getunwind(), we project its unwind data into
52 address-range KERNEL_START-(KERNEL_START+ktab_size) and then
53 when ia64_access_mem() sees a memory access to this
54 address-range, we redirect it to ktab instead.
56 None of this hackery is needed with a modern kernel/libcs
57 which uses the kernel virtual DSO to provide access to the
58 kernel's unwind info. In that case, ktab_size remains 0 and
59 hence the value of KERNEL_START doesn't matter. */
61 #define KERNEL_START 0xc000000000000000ULL
64 struct ia64_table_entry
65 {
69 };
74 #endif
76 /* An enumeration of the different IA-64 instruction types. */
79 {
87 undefined /* undefined or reserved */
90 /* We represent IA-64 PC addresses as the value of the instruction
91 pointer or'd with some bit combination in the low nibble which
92 represents the slot number in the bundle addressed by the
93 instruction pointer. The problem is that the Linux kernel
94 multiplies its slot numbers (for exceptions) by one while the
95 disassembler multiplies its slot numbers by 6. In addition, I've
96 heard it said that the simulator uses 1 as the multiplier.
98 I've fixed the disassembler so that the bytes_per_line field will
99 be the slot multiplier. If bytes_per_line comes in as zero, it
100 is set to six (which is how it was set up initially). -- objdump
101 displays pretty disassembly dumps with this value. For our purposes,
102 we'll set bytes_per_line to SLOT_MULTIPLIER. This is okay since we
103 never want to also display the raw bytes the way objdump does. */
105 #define SLOT_MULTIPLIER 1
107 /* Length in bytes of an instruction bundle. */
109 #define BUNDLE_LEN 16
111 /* See the saved memory layout comment for ia64_memory_insert_breakpoint. */
113 #if BREAKPOINT_MAX < BUNDLE_LEN - 2
115 #endif
125 CORE_ADDR faddr);
127 #define NUM_IA64_RAW_REGS 462
129 /* Big enough to hold a FP register in bytes. */
130 #define IA64_FP_REGISTER_SIZE 16
134 /* NOTE: we treat the register stack registers r32-r127 as
135 pseudo-registers because they may not be accessible via the ptrace
136 register get/set interfaces. */
144 /* Array of register names; There should be ia64_num_regs strings in
145 the initializer. */
254 };
256 struct ia64_frame_cache
257 {
268 cfm value). */
269 CORE_ADDR after_prologue;
270 /* Address of first instruction after the last
271 prologue instruction; Note that there may
272 be instructions from the function's body
273 intermingled with the prologue. */
275 /* Size of the memory stack frame (may be zero),
276 or -1 if it has not been determined yet. */
278 for this frame. 0 if no register is being used
279 as the frame pointer. */
281 /* Saved registers. */
284 };
286 static int
288 {
290 }
293 {
296 };
299 {
302 };
305 {
307 &floatformat_ia64_ext_little
308 };
312 {
316 tdep->ia64_ext_type
318 floatformats_ia64_ext);
321 }
323 static int
326 {
344 }
348 {
350 }
354 {
357 else
359 }
361 static int
363 {
367 }
370 /* Extract ``len'' bits from an instruction bundle starting at
371 bit ``from''. */
373 static long long
375 {
392 {
395 }
398 {
402 }
405 }
407 /* Replace the specified bits in an instruction bundle. */
409 static void
411 {
419 {
428 }
429 else
430 {
439 {
443 }
446 {
452 }
453 }
454 }
456 /* Return the contents of slot N (for N = 0, 1, or 2) in
457 and instruction bundle. */
459 static long long
461 {
463 }
465 /* Store an instruction in an instruction bundle. */
467 static void
469 {
471 }
474 {
507 };
509 /* Fetch and (partially) decode an instruction at ADDR and return the
510 address of the next instruction to fetch. */
512 static CORE_ADDR
514 {
520 /* Warn about slot numbers greater than 2. We used to generate
521 an error here on the assumption that the user entered an invalid
522 address. But, sometimes GDB itself requests an invalid address.
523 This can (easily) happen when execution stops in a function for
524 which there are no symbols. The prologue scanner will attempt to
525 find the beginning of the function - if the nearest symbol
526 happens to not be aligned on a bundle boundary (16 bytes), the
527 resulting starting address will cause GDB to think that the slot
528 number is too large.
530 So we warn about it and set the slot number to zero. It is
531 not necessarily a fatal condition, particularly if debugging
532 at the assembly language level. */
534 {
538 }
553 else
557 }
559 /* There are 5 different break instructions (break.i, break.b,
560 break.m, break.f, and break.x), but they all have the same
561 encoding. (The five bit template in the low five bits of the
562 instruction bundle distinguishes one from another.)
564 The runtime architecture manual specifies that break instructions
565 used for debugging purposes must have the upper two bits of the 21
566 bit immediate set to a 0 and a 1 respectively. A breakpoint
567 instruction encodes the most significant bit of its 21 bit
568 immediate at bit 36 of the 41 bit instruction. The penultimate msb
569 is at bit 25 which leads to the pattern below.
571 Originally, I had this set up to do, e.g, a "break.i 0x80000" But
572 it turns out that 0x80000 was used as the syscall break in the early
573 simulators. So I changed the pattern slightly to do "break.i 0x080001"
574 instead. But that didn't work either (I later found out that this
575 pattern was used by the simulator that I was using.) So I ended up
576 using the pattern seen below.
578 SHADOW_CONTENTS has byte-based addressing (PLACED_ADDRESS and SHADOW_LEN)
579 while we need bit-based addressing as the instructions length is 41 bits and
580 we must not modify/corrupt the adjacent slots in the same bundle.
581 Fortunately we may store larger memory incl. the adjacent bits with the
582 original memory content (not the possibly already stored breakpoints there).
583 We need to be careful in ia64_memory_remove_breakpoint to always restore
584 only the specific bits of this instruction ignoring any adjacent stored
585 bits.
587 We use the original addressing with the low nibble in the range <0..2> which
588 gets incorrectly interpreted by generic non-ia64 breakpoint_restore_shadows
589 as the direct byte offset of SHADOW_CONTENTS. We store whole BUNDLE_LEN
590 bytes just without these two possibly skipped bytes to not to exceed to the
591 next bundle.
593 If we would like to store the whole bundle to SHADOW_CONTENTS we would have
594 to store already the base address (`address & ~0x0f') into PLACED_ADDRESS.
595 In such case there is no other place where to store
596 SLOTNUM (`adress & 0x0f', value in the range <0..2>). We need to know
597 SLOTNUM in ia64_memory_remove_breakpoint.
599 There is one special case where we need to be extra careful:
600 L-X instructions, which are instructions that occupy 2 slots
601 (The L part is always in slot 1, and the X part is always in
602 slot 2). We must refuse to insert breakpoints for an address
603 that points at slot 2 of a bundle where an L-X instruction is
604 present, since there is logically no instruction at that address.
605 However, to make things more interesting, the opcode of L-X
606 instructions is located in slot 2. This means that, to insert
607 a breakpoint at an address that points to slot 1, we actually
608 need to write the breakpoint in slot 2! Slot 1 is actually
609 the extended operand, so writing the breakpoint there would not
610 have the desired effect. Another side-effect of this issue
611 is that we need to make sure that the shadow contents buffer
612 does save byte 15 of our instruction bundle (this is the tail
613 end of slot 2, which wouldn't be saved if we were to insert
614 the breakpoint in slot 1).
616 ia64 16-byte bundle layout:
617 | 5 bits | slot 0 with 41 bits | slot 1 with 41 bits | slot 2 with 41 bits |
619 The current addressing used by the code below:
620 original PC placed_address placed_size required covered
621 == bp_tgt->shadow_len reqd \subset covered
622 0xABCDE0 0xABCDE0 0x10 <0x0...0x5> <0x0..0xF>
623 0xABCDE1 0xABCDE1 0xF <0x5...0xA> <0x1..0xF>
624 0xABCDE2 0xABCDE2 0xE <0xA...0xF> <0x2..0xF>
626 L-X instructions are treated a little specially, as explained above:
627 0xABCDE1 0xABCDE1 0xF <0xA...0xF> <0x1..0xF>
629 `objdump -d' and some other tools show a bit unjustified offsets:
630 original PC byte where starts the instruction objdump offset
631 0xABCDE0 0xABCDE0 0xABCDE0
632 0xABCDE1 0xABCDE5 0xABCDE6
633 0xABCDE2 0xABCDEA 0xABCDEC
634 */
636 #define IA64_BREAKPOINT 0x00003333300LL
638 static int
641 {
654 /* Enable the automatic memory restoration from breakpoints while
655 we read our instruction bundle for the purpose of SHADOW_CONTENTS.
656 Otherwise, we could possibly store into the shadow parts of the adjacent
657 placed breakpoints. It is due to our SHADOW_CONTENTS overlapping the real
658 breakpoint instruction bits region. */
659 scoped_restore restore_memory_0
665 /* SHADOW_SLOTNUM saves the original slot number as expected by the caller
666 for addressing the SHADOW_CONTENTS placement. */
669 /* Always cover the last byte of the bundle in case we are inserting
670 a breakpoint on an L-X instruction. */
675 {
676 /* X unit types can only be used in slot 2, and are actually
677 part of a 2-slot L-X instruction. We cannot break at this
678 address, as this is the second half of an instruction that
679 lives in slot 1 of that bundle. */
682 }
684 {
685 /* L unit types can only be used in slot 1. But the associated
686 opcode for that instruction is in slot 2, so bump the slot number
687 accordingly. */
690 }
692 /* Store the whole bundle, except for the initial skipped bytes by the slot
693 number interpreted as bytes offset in PLACED_ADDRESS. */
697 /* Re-read the same bundle as above except that, this time, read it in order
698 to compute the new bundle inside which we will be inserting the
699 breakpoint. Therefore, disable the automatic memory restoration from
700 breakpoints while we read our instruction bundle. Otherwise, the general
701 restoration mechanism kicks in and we would possibly remove parts of the
702 adjacent placed breakpoints. It is due to our SHADOW_CONTENTS overlapping
703 the real breakpoint instruction bits region. */
704 scoped_restore restore_memory_1
710 /* Breakpoints already present in the code will get detected and not get
711 reinserted by bp_loc_is_permanent. Multiple breakpoints at the same
712 location cannot induce the internal error as they are optimized into
713 a single instance by update_global_location_list. */
725 }
727 static int
730 {
740 /* Disable the automatic memory restoration from breakpoints while
741 we read our instruction bundle. Otherwise, the general restoration
742 mechanism kicks in and we would possibly remove parts of the adjacent
743 placed breakpoints. It is due to our SHADOW_CONTENTS overlapping the real
744 breakpoint instruction bits region. */
745 scoped_restore restore_memory_1
751 /* SHADOW_SLOTNUM saves the original slot number as expected by the caller
752 for addressing the SHADOW_CONTENTS placement. */
757 {
758 /* X unit types can only be used in slot 2, and are actually
759 part of a 2-slot L-X instruction. We refuse to insert
760 breakpoints at this address, so there should be no reason
761 for us attempting to remove one there, except if the program's
762 code somehow got modified in memory. */
768 }
770 {
771 /* L unit types can only be used in slot 1. But the breakpoint
772 was actually saved using slot 2, so update the slot number
773 accordingly. */
776 }
782 {
787 }
789 /* Extract the original saved instruction from SLOTNUM normalizing its
790 bit-shift for INSTR_SAVED. */
796 /* In BUNDLE_MEM, be careful to modify only the bits belonging to SLOTNUM
797 and not any of the other ones that are stored in SHADOW_CONTENTS. */
802 }
804 /* Implement the breakpoint_kind_from_pc gdbarch method. */
806 static int
808 {
809 /* A place holder of gdbarch method breakpoint_kind_from_pc. */
811 }
813 /* As gdbarch_breakpoint_from_pc ranges have byte granularity and ia64
814 instruction slots ranges are bit-granular (41 bits) we have to provide an
815 extended range as described for ia64_memory_insert_breakpoint. We also take
816 care of preserving the `break' instruction 21-bit (or 62-bit) parameter to
817 make a match for permanent breakpoints. */
822 {
835 /* Enable the automatic memory restoration from breakpoints while
836 we read our instruction bundle to match bp_loc_is_permanent. */
837 {
838 scoped_restore restore_memory_0
841 }
843 /* The memory might be unreachable. This can happen, for instance,
844 when the user inserts a breakpoint at an invalid address. */
848 /* SHADOW_SLOTNUM saves the original slot number as expected by the caller
849 for addressing the SHADOW_CONTENTS placement. */
852 /* Cover always the last byte of the bundle for the L-X slot case. */
855 /* Check for L type instruction in slot 1, if present then bump up the slot
856 number to the slot 2. */
859 {
862 }
864 {
867 }
869 /* A break instruction has its all its opcode bits cleared except for
870 the parameter value. For L+X slot pair we are at the X slot (slot 2) so
871 we should not touch the L slot - the upper 41 bits of the parameter. */
877 }
879 static CORE_ADDR
881 {
890 }
892 void
894 {
896 ULONGEST psr_value;
906 }
908 #define IS_NaT_COLLECTION_ADDR(addr) ((((addr) >> 3) & 0x3f) == 0x3f)
910 /* Returns the address of the slot that's NSLOTS slots away from
911 the address ADDR. NSLOTS may be positive or negative. */
912 static CORE_ADDR
914 {
915 CORE_ADDR new_addr;
928 }
930 static enum register_status
933 {
938 {
939 #ifdef HAVE_LIBUNWIND_IA64_H
940 /* First try and use the libunwind special reg accessor,
941 otherwise fallback to standard logic. */
944 #endif
945 {
946 /* The fallback position is to assume that r32-r127 are
947 found sequentially in memory starting at $bof. This
948 isn't always true, but without libunwind, this is the
949 best we can do. */
950 ULONGEST cfm;
951 ULONGEST bsp;
952 CORE_ADDR reg;
962 /* The bsp points at the end of the register frame so we
963 subtract the size of frame from it to get start of
964 register frame. */
968 {
973 }
974 else
977 }
978 }
980 {
981 ULONGEST unatN_val;
982 ULONGEST unat;
990 }
992 {
994 ULONGEST bsp;
995 ULONGEST cfm;
1006 /* The bsp points at the end of the register frame so we
1007 subtract the size of frame from it to get start of register frame. */
1014 {
1015 /* Compute address of nat collection bits. */
1017 ULONGEST nat_collection;
1019 /* If our nat collection address is bigger than bsp, we have to get
1020 the nat collection from rnat. Otherwise, we fetch the nat
1021 collection from the computed address. */
1024 else
1028 }
1032 }
1034 {
1035 /* A virtual register frame start is provided for user convenience.
1036 It can be calculated as the bsp - sof (sizeof frame). */
1038 ULONGEST cfm;
1047 /* The bsp points at the end of the register frame so we
1048 subtract the size of frame from it to get beginning of frame. */
1052 }
1054 {
1055 ULONGEST pr;
1056 ULONGEST cfm;
1057 ULONGEST prN_val;
1067 {
1068 /* Fetch predicate register rename base from current frame
1069 marker for this frame. */
1072 /* Adjust the register number to account for register rotation. */
1073 regnum = VP16_REGNUM
1075 }
1079 }
1080 else
1084 }
1086 static void
1089 {
1093 {
1094 ULONGEST bsp;
1095 ULONGEST cfm;
1102 {
1105 }
1106 }
1108 {
1112 regnum),
1113 byte_order);
1120 }
1122 {
1123 ULONGEST natN_val;
1124 ULONGEST bsp;
1125 ULONGEST cfm;
1130 /* The bsp points at the end of the register frame so we
1131 subtract the size of frame from it to get start of register frame. */
1138 regnum),
1139 byte_order);
1142 {
1143 /* Compute address of nat collection bits. */
1145 CORE_ADDR nat_collection;
1148 /* If our nat collection address is bigger than bsp, we have to get
1149 the nat collection from rnat. Otherwise, we fetch the nat
1150 collection from the computed address. */
1152 {
1154 IA64_RNAT_REGNUM,
1158 else
1161 nat_collection);
1162 }
1163 else
1164 {
1169 else
1174 }
1175 }
1176 }
1178 {
1179 ULONGEST pr;
1180 ULONGEST cfm;
1181 ULONGEST prN_val;
1182 ULONGEST prN_mask;
1188 {
1189 /* Fetch predicate register rename base from current frame
1190 marker for this frame. */
1193 /* Adjust the register number to account for register rotation. */
1194 regnum = VP16_REGNUM
1196 }
1198 byte_order);
1205 }
1206 }
1208 /* The ia64 needs to convert between various ieee floating-point formats
1209 and the special ia64 floating point register format. */
1211 static int
1213 {
1217 }
1219 static int
1223 {
1227 /* Convert to TYPE. */
1231 regnum)),
1238 }
1240 static void
1243 {
1248 }
1251 /* Limit the number of skipped non-prologue instructions since examining
1252 of the prologue is expensive. */
1255 /* Given PC representing the starting address of a function, and
1256 LIM_PC which is the (sloppy) limit to which to scan when looking
1257 for a prologue, attempt to further refine this limit by using
1258 the line data in the symbol table. If successful, a better guess
1259 on where the prologue ends is returned, otherwise the previous
1260 value of lim_pc is returned. TRUST_LIMIT is a pointer to a flag
1261 which will be set to indicate whether the returned limit may be
1262 used with no further scanning in the event that the function is
1263 frameless. */
1265 /* FIXME: cagney/2004-02-14: This function and logic have largely been
1266 superseded by skip_prologue_using_sal. */
1268 static CORE_ADDR
1270 {
1273 CORE_ADDR end_pc;
1275 /* The prologue can not possibly go past the function end itself,
1276 so we can already adjust LIM_PC accordingly. */
1280 /* Start off not trusting the limit. */
1285 {
1289 /* Handle the case in which compiler's optimizer/scheduler
1290 has moved instructions into the prologue. We scan ahead
1291 in the function looking for address ranges whose corresponding
1292 line number is less than or equal to the first one that we
1293 found for the function. (It can be less than when the
1294 scheduler puts a body instruction before the first prologue
1295 instruction.) */
1298 i--)
1299 {
1307 {
1309 }
1311 }
1314 {
1318 }
1319 }
1321 }
1323 #define isScratch(_regnum_) ((_regnum_) == 2 || (_regnum_) == 3 \
1324 || (8 <= (_regnum_) && (_regnum_) <= 11) \
1325 || (14 <= (_regnum_) && (_regnum_) <= 31))
1326 #define imm9(_instr_) \
1327 ( ((((_instr_) & 0x01000000000LL) ? -1 : 0) << 8) \
1328 | (((_instr_) & 0x00008000000LL) >> 20) \
1329 | (((_instr_) & 0x00000001fc0LL) >> 6))
1331 /* Allocate and initialize a frame cache. */
1335 {
1341 /* Base address. */
1357 }
1359 static CORE_ADDR
1363 {
1364 CORE_ADDR next_pc;
1366 instruction_type it;
1382 CORE_ADDR addr;
1397 /* We want to check if we have a recognizable function start before we
1398 look ahead for a prologue. */
1401 {
1402 /* alloc - start of a regular function. */
1407 /* Verify that the current cfm matches what we think is the
1408 function start. If we have somehow jumped within a function,
1409 we do not want to interpret the prologue and calculate the
1410 addresses of various registers such as the return address.
1411 We will instead treat the frame as frameless. */
1420 }
1421 else
1422 {
1423 /* Look for a leaf routine. */
1427 {
1428 /* adds rN = imm14, rM (or mov rN, rM when imm14 is 0) */
1436 {
1437 /* mov r2, r12 - beginning of leaf routine. */
1440 }
1441 }
1443 /* If we don't recognize a regular function or leaf routine, we are
1444 done. */
1446 {
1450 }
1451 }
1453 /* Loop, looking for prologue instructions, keeping track of
1454 where preserved registers were spilled. */
1456 {
1462 {
1463 /* Exit loop upon hitting a non-nop branch instruction. */
1467 }
1470 {
1471 /* Exit loop upon hitting a predicated instruction if
1472 we already have the return register or if we are frameless. */
1476 }
1478 {
1479 /* Move from BR */
1485 {
1488 }
1489 }
1492 {
1493 /* adds rN = imm14, rM (or mov rN, rM when imm14 is 0) */
1502 {
1503 /* mov rN, r12 */
1506 }
1508 {
1509 /* adds r12, -mem_stack_frame_size, r12 */
1512 }
1515 {
1517 /* adds r2, spilloffset, rFramePointer
1518 or
1519 adds r2, spilloffset, r12
1521 Get ready for stf.spill or st8.spill instructions.
1522 The address to start spilling at is loaded into r2.
1523 FIXME: Why r2? That's what gcc currently uses; it
1524 could well be different for other compilers. */
1526 /* Hmm... whether or not this will work will depend on
1527 where the pc is. If it's still early in the prologue
1528 this'll be wrong. FIXME */
1531 sp_regnum);
1532 spill_addr = saved_sp
1537 }
1540 {
1541 /* mov rN, rM where rM is an input register. */
1544 }
1547 {
1548 /* mov r12, r2 */
1551 }
1552 }
1556 {
1557 /* stf.spill [rN] = fM, imm9
1558 or
1559 stf.spill [rN] = fM */
1567 {
1572 else
1575 }
1576 }
1579 {
1580 /* mov.m rN = arM
1581 or
1582 mov.i rN = arM */
1588 {
1589 /* We have something like "mov.m r3 = ar.unat". Remember the
1590 r3 (or whatever) and watch for a store of this register... */
1593 }
1594 }
1596 {
1597 /* mov rN = pr */
1601 {
1604 }
1605 }
1609 {
1610 /* st8 [rN] = rM
1611 or
1612 st8 [rN] = rM, imm9 */
1619 {
1620 /* We've found a spill of either the UNAT register or the PR
1621 register. (Well, not exactly; what we've actually found is
1622 a spill of the register that UNAT or PR was moved to).
1623 Record that fact and move on... */
1625 {
1626 /* Track UNAT register. */
1629 }
1630 else
1631 {
1632 /* Track PR register. */
1635 }
1637 /* st8 [rN] = rM, imm9 */
1639 else
1642 }
1644 {
1645 /* Allow up to one store of each input register. */
1648 }
1651 {
1652 /* Allow an indirect store of an input register. */
1655 }
1656 }
1658 {
1659 /* One of
1660 st1 [rN] = rM
1661 st2 [rN] = rM
1662 st4 [rN] = rM
1663 st8 [rN] = rM
1664 Note that the st8 case is handled in the clause above.
1666 Advance over stores of input registers. One store per input
1667 register is permitted. */
1672 {
1675 }
1678 {
1679 /* Allow an indirect store of an input register. */
1682 }
1683 }
1685 {
1686 /* Either
1687 stfs [rN] = fM
1688 or
1689 stfd [rN] = fM
1691 Advance over stores of floating point input registers. Again
1692 one store per register is permitted. */
1696 {
1699 }
1700 }
1704 {
1705 /* st8.spill [rN] = rM
1706 or
1707 st8.spill [rN] = rM, imm9 */
1712 {
1713 /* We've found a spill of one of the preserved general purpose
1714 regs. Record the spill address and advance the spill
1715 register if appropriate. */
1718 /* st8.spill [rN] = rM, imm9 */
1720 else
1723 }
1724 }
1727 }
1729 /* If not frameless and we aren't called by skip_prologue, then we need
1730 to calculate registers for the previous frame which will be needed
1731 later. */
1734 {
1738 /* Extract the size of the rotating portion of the stack
1739 frame and the register rename base from the current
1740 frame marker. */
1747 /* Find the bof (beginning of frame). */
1753 {
1755 {
1757 }
1764 }
1766 /* For the previous argument registers we require the previous bof.
1767 If we can't find the previous cfm, then we can do nothing. */
1770 {
1773 }
1775 {
1778 }
1782 {
1788 /* The previous bof only requires subtraction of the sol (size of
1789 locals) due to the overlap between output and input of
1790 subsequent frames. */
1796 {
1798 {
1800 }
1805 else
1807 }
1809 }
1810 }
1812 /* Try and trust the lim_pc value whenever possible. */
1822 }
1824 CORE_ADDR
1826 {
1833 /* Call examine_prologue with - as third argument since we don't
1834 have a next frame pointer to send. */
1836 }
1839 /* Normal frames. */
1843 {
1848 CORE_ADDR cfm;
1859 /* We always want the bsp to point to the end of frame.
1860 This way, we can always get the beginning of frame (bof)
1861 by subtracting frame size. */
1884 }
1886 static void
1889 {
1894 /* If outermost frame, mark with null frame id. */
1899 "regular frame id: code %s, stack %s, "
1905 }
1910 {
1925 {
1929 /* We want to calculate the previous bsp as the end of the previous
1930 register stack frame. This corresponds to what the hardware bsp
1931 register will be if we pop the frame back which is why we might
1932 have been called. We know the beginning of the current frame is
1933 cache->bsp - cache->sof. This value in the previous frame points
1934 to the start of the output registers. We can calculate the end of
1935 that frame by adding the size of output:
1936 (sof (size of frame) - sol (size of locals)). */
1941 prev_bsp =
1945 }
1948 {
1959 IA64_PFS_REGNUM);
1961 }
1964 {
1965 /* If the function in question uses an automatic register (r32-r127)
1966 for the frame pointer, it'll be found by ia64_find_saved_register()
1967 above. If the function lacks one of these frame pointers, we can
1968 still provide a value since we know the size of the frame. */
1970 }
1973 {
1975 ULONGEST prN;
1978 IA64_PR_REGNUM);
1980 {
1981 /* Fetch predicate register rename base from current frame
1982 marker for this frame. */
1985 /* Adjust the register number to account for register rotation. */
1987 }
1991 }
1994 {
1996 ULONGEST unatN;
1998 IA64_UNAT_REGNUM);
2002 }
2005 {
2007 /* Find address of general register corresponding to nat bit we're
2008 interested in. */
2009 CORE_ADDR gr_addr;
2014 {
2015 /* Compute address of nat collection bits. */
2017 CORE_ADDR bsp;
2018 CORE_ADDR nat_collection;
2021 /* If our nat collection address is bigger than bsp, we have to get
2022 the nat collection from rnat. Otherwise, we fetch the nat
2023 collection from the computed address. */
2027 {
2030 }
2031 else
2035 }
2038 }
2041 {
2046 {
2049 }
2051 {
2054 }
2057 }
2060 {
2061 /* We don't know how to get the complete previous PSR, but we need it
2062 for the slot information when we unwind the pc (pc is formed of IP
2063 register plus slot information from PSR). To get the previous
2064 slot information, we mask it off the return address. */
2074 {
2077 }
2079 {
2082 }
2087 }
2090 {
2097 }
2101 {
2111 {
2115 /* FIXME: brobecker/2008-05-01: Doesn't this seem redundant
2116 with the same code above? */
2120 IA64_CFM_REGNUM);
2124 IA64_BSP_REGNUM);
2131 }
2134 }
2137 {
2141 {
2142 /* Fetch floating point register rename base from current
2143 frame marker for this frame. */
2146 /* Adjust the floating point register number to account for
2147 register rotation. */
2148 regnum = IA64_FR32_REGNUM
2150 }
2152 /* If we have stored a memory address, access the register. */
2156 /* Otherwise, punt and get the current value of the register. */
2157 else
2159 }
2160 }
2163 {
2164 NORMAL_FRAME,
2165 default_frame_unwind_stop_reason,
2168 NULL,
2169 default_frame_sniffer
2170 };
2172 /* Signal trampolines. */
2174 static void
2177 {
2182 {
2187 IA64_IP_REGNUM);
2190 IA64_CFM_REGNUM);
2193 IA64_PSR_REGNUM);
2196 IA64_BSP_REGNUM);
2199 IA64_RNAT_REGNUM);
2202 IA64_CCV_REGNUM);
2205 IA64_UNAT_REGNUM);
2208 IA64_FPSR_REGNUM);
2211 IA64_PFS_REGNUM);
2214 IA64_LC_REGNUM);
2225 }
2226 }
2230 {
2242 /* Note that frame size is hard-coded below. We cannot calculate it
2243 via prologue examination. */
2257 }
2259 static void
2262 {
2272 "sigtramp frame id: code %s, stack %s, "
2278 }
2283 {
2293 {
2298 {
2302 }
2305 }
2309 {
2319 }
2322 {
2329 }
2330 }
2332 static int
2336 {
2339 {
2344 }
2347 }
2350 {
2351 SIGTRAMP_FRAME,
2352 default_frame_unwind_stop_reason,
2353 ia64_sigtramp_frame_this_id,
2354 ia64_sigtramp_frame_prev_register,
2355 NULL,
2356 ia64_sigtramp_frame_sniffer
2357 };
2359 \f
2361 static CORE_ADDR
2363 {
2367 }
2370 {
2372 ia64_frame_base_address,
2373 ia64_frame_base_address,
2374 ia64_frame_base_address
2375 };
2377 #ifdef HAVE_LIBUNWIND_IA64_H
2379 struct ia64_unwind_table_entry
2380 {
2381 unw_word_t start_offset;
2382 unw_word_t end_offset;
2383 unw_word_t info_offset;
2384 };
2388 {
2390 }
2392 /* Skip over a designated number of registers in the backing
2393 store, remembering every 64th position is for NAT. */
2396 {
2402 }
2404 /* Gdb ia64-libunwind-tdep callback function to convert from an ia64 gdb
2405 register number to a libunwind register number. */
2406 static int
2408 {
2433 else
2435 }
2437 /* Gdb ia64-libunwind-tdep callback function to convert from a libunwind
2438 register number to a ia64 gdb register number. */
2439 static int
2441 {
2464 else
2466 }
2468 /* Gdb ia64-libunwind-tdep callback function to reveal if register is
2469 a float register or not. */
2470 static int
2472 {
2474 }
2476 /* Libunwind callback accessor function for general registers. */
2477 static int
2480 {
2486 /* We never call any libunwind routines that need to write registers. */
2490 {
2492 /* Libunwind expects to see the pc value which means the slot number
2493 from the psr must be merged with the ip word address. */
2500 /* Libunwind expects to see the beginning of the current
2501 register frame so we must account for the fact that
2502 ptrace() will return a value for bsp that points *after*
2503 the current register frame. */
2511 /* Libunwind wants bspstore to be after the current register frame.
2512 This is what ptrace() and gdb treats as the regular bsp value. */
2517 /* For all other registers, just unwind the value directly. */
2520 }
2529 }
2531 /* Libunwind callback accessor function for floating-point registers. */
2532 static int
2535 {
2539 /* We never call any libunwind routines that need to write registers. */
2545 }
2547 /* Libunwind callback accessor function for top-level rse registers. */
2548 static int
2551 {
2557 /* We never call any libunwind routines that need to write registers. */
2561 {
2563 /* Libunwind expects to see the pc value which means the slot number
2564 from the psr must be merged with the ip word address. */
2571 /* Libunwind expects to see the beginning of the current
2572 register frame so we must account for the fact that
2573 ptrace() will return a value for bsp that points *after*
2574 the current register frame. */
2582 /* Libunwind wants bspstore to be after the current register frame.
2583 This is what ptrace() and gdb treats as the regular bsp value. */
2588 /* For all other registers, just unwind the value directly. */
2591 }
2601 }
2603 /* Libunwind callback accessor function for top-level fp registers. */
2604 static int
2607 {
2611 /* We never call any libunwind routines that need to write registers. */
2617 }
2619 /* Libunwind callback accessor function for accessing memory. */
2620 static int
2624 {
2626 {
2632 else
2635 }
2637 /* XXX do we need to normalize byte-order here? */
2640 else
2642 }
2644 /* Call low-level function to access the kernel unwind table. */
2647 {
2648 /* FIXME drow/2005-09-10: This code used to call
2649 ia64_linux_xfer_unwind_table directly to fetch the unwind table
2650 for the currently running ia64-linux kernel. That data should
2651 come from the core file and be accessed via the auxv vector; if
2652 we want to preserve fall back to the running kernel's table, then
2653 we should find a way to override the corefile layer's
2654 xfer_partial method. */
2658 }
2660 /* Get the kernel unwind table. */
2661 static int
2663 {
2667 {
2677 }
2699 }
2701 /* Find the unwind table entry for a specified address. */
2702 static int
2705 {
2709 CORE_ADDR load_base;
2721 {
2723 {
2736 }
2737 }
2742 /* Verify that the segment that contains the IP also contains
2743 the static unwind table. If not, we may be in the Linux kernel's
2744 DSO gate page in which case the unwind table is another segment.
2745 Otherwise, we are dealing with runtime-generated code, for which we
2746 have no info here. */
2750 {
2753 {
2756 {
2758 /* Get the segbase from the section containing the
2759 libunwind table. */
2761 }
2762 }
2765 }
2777 }
2779 /* Libunwind callback accessor function to acquire procedure unwind-info. */
2780 static int
2783 {
2785 unw_dyn_info_t di;
2790 {
2791 /* XXX This only works if the host and the target architecture are
2792 both ia64 and if the have (more or less) the same kernel
2793 version. */
2799 "(name=`%s',segbase=%s,start=%s,end=%s,gp=%s,"
2807 }
2808 else
2809 {
2816 "(name=`%s',segbase=%s,start=%s,end=%s,gp=%s,"
2824 }
2827 arg);
2829 /* We no longer need the dyn info storage so free it. */
2833 }
2835 /* Libunwind callback accessor function for cleanup. */
2836 static void
2839 {
2840 /* Nothing required for now. */
2841 }
2843 /* Libunwind callback accessor function to get head of the dynamic
2844 unwind-info registration list. */
2845 static int
2848 {
2851 unw_dyn_info_t di;
2858 {
2865 {
2867 /* We no longer need the dyn info storage so free it. */
2871 {
2874 "dynamic unwind table in objfile %s "
2880 }
2881 }
2882 }
2884 }
2887 /* Frame interface functions for libunwind. */
2889 static void
2892 {
2897 CORE_ADDR bsp;
2901 {
2904 }
2906 /* We must add the bsp as the special address for frame comparison
2907 purposes. */
2915 "libunwind frame id: code %s, stack %s, "
2921 }
2926 {
2937 /* Let libunwind do most of the work. */
2941 {
2942 ULONGEST prN_val;
2945 {
2947 ULONGEST cfm;
2949 /* Fetch predicate register rename base from current frame
2950 marker for this frame. */
2954 /* Adjust the register number to account for register rotation. */
2956 }
2960 }
2963 {
2964 ULONGEST unatN_val;
2969 }
2972 {
2976 /* We want to calculate the previous bsp as the end of the previous
2977 register stack frame. This corresponds to what the hardware bsp
2978 register will be if we pop the frame back which is why we might
2979 have been called. We know that libunwind will pass us back the
2980 beginning of the current frame so we should just add sof to it. */
2984 IA64_CFM_REGNUM);
2990 }
2991 else
2993 }
2995 static int
2999 {
3005 }
3008 {
3009 NORMAL_FRAME,
3010 default_frame_unwind_stop_reason,
3011 ia64_libunwind_frame_this_id,
3012 ia64_libunwind_frame_prev_register,
3013 NULL,
3014 ia64_libunwind_frame_sniffer,
3015 libunwind_frame_dealloc_cache
3016 };
3018 static void
3022 {
3026 CORE_ADDR bsp;
3031 {
3034 }
3036 /* We must add the bsp as the special address for frame comparison
3037 purposes. */
3041 /* For a sigtramp frame, we don't make the check for previous ip being 0. */
3046 "libunwind sigtramp frame id: code %s, "
3052 }
3057 {
3061 CORE_ADDR prev_ip;
3063 /* If the previous frame pc value is 0, then we want to use the SIGCONTEXT
3064 method of getting previous registers. */
3066 IA64_IP_REGNUM);
3071 {
3074 regnum);
3075 }
3076 else
3078 }
3080 static int
3084 {
3086 {
3090 }
3091 else
3093 }
3096 {
3097 SIGTRAMP_FRAME,
3098 default_frame_unwind_stop_reason,
3099 ia64_libunwind_sigtramp_frame_this_id,
3100 ia64_libunwind_sigtramp_frame_prev_register,
3101 NULL,
3102 ia64_libunwind_sigtramp_frame_sniffer
3103 };
3105 /* Set of libunwind callback acccessor functions. */
3106 unw_accessors_t ia64_unw_accessors =
3107 {
3108 ia64_find_proc_info_x,
3109 ia64_put_unwind_info,
3110 ia64_get_dyn_info_list,
3111 ia64_access_mem,
3112 ia64_access_reg,
3113 ia64_access_fpreg,
3114 /* resume */
3115 /* get_proc_name */
3116 };
3118 /* Set of special libunwind callback acccessor functions specific for accessing
3119 the rse registers. At the top of the stack, we want libunwind to figure out
3120 how to read r32 - r127. Though usually they are found sequentially in
3121 memory starting from $bof, this is not always true. */
3122 unw_accessors_t ia64_unw_rse_accessors =
3123 {
3124 ia64_find_proc_info_x,
3125 ia64_put_unwind_info,
3126 ia64_get_dyn_info_list,
3127 ia64_access_mem,
3128 ia64_access_rse_reg,
3129 ia64_access_rse_fpreg,
3130 /* resume */
3131 /* get_proc_name */
3132 };
3134 /* Set of ia64-libunwind-tdep gdb callbacks and data for generic
3135 ia64-libunwind-tdep code to use. */
3137 {
3138 ia64_gdb2uw_regnum,
3139 ia64_uw2gdb_regnum,
3140 ia64_is_fpreg,
3143 };
3147 static int
3149 {
3152 /* Don't use the struct convention for anything but structure,
3153 union, or array types. */
3159 /* HFAs are structures (or arrays) consisting entirely of floating
3160 point values of the same length. Up to 8 of these are returned
3161 in registers. Don't use the struct convention when this is the
3162 case. */
3168 /* Other structs of length 32 or less are returned in r8-r11.
3169 Don't use the struct convention for those either. */
3171 }
3173 /* Return non-zero if TYPE is a structure or union type. */
3175 static int
3177 {
3180 }
3182 static void
3185 {
3191 {
3198 {
3203 regnum++;
3204 }
3205 }
3207 {
3208 /* This is an integral value, and its size is less than 8 bytes.
3209 These values are LSB-aligned, so extract the relevant bytes,
3210 and copy them into VALBUF. */
3211 /* brobecker/2005-12-30: Actually, all integral values are LSB aligned,
3212 so I suppose we should also add handling here for integral values
3213 whose size is greater than 8. But I wasn't able to create such
3214 a type, neither in C nor in Ada, so not worrying about these yet. */
3216 ULONGEST val;
3220 }
3221 else
3222 {
3223 ULONGEST val;
3231 {
3232 ULONGEST regval;
3236 regnum++;
3237 }
3240 {
3243 }
3244 }
3245 }
3247 static void
3250 {
3256 {
3263 {
3268 regnum++;
3269 }
3270 }
3271 else
3272 {
3280 {
3281 ULONGEST val;
3285 regnum++;
3286 }
3289 {
3290 ULONGEST val;
3293 }
3294 }
3295 }
3297 static enum return_value_convention
3301 {
3305 {
3308 }
3311 {
3314 }
3318 else
3320 }
3322 static int
3324 {
3326 {
3330 else
3331 {
3334 }
3337 return
3339 etp);
3342 {
3350 }
3355 }
3356 }
3358 /* Determine if the given type is one of the floating point types or
3359 and HFA (which is a struct, array, or combination thereof whose
3360 bottom-most elements are all of the same floating point type). */
3364 {
3368 }
3371 /* Return 1 if the alignment of T is such that the next even slot
3372 should be used. Return 0, if the next available slot should
3373 be used. (See section 8.5.1 of the IA-64 Software Conventions
3374 and Runtime manual). */
3376 static int
3378 {
3380 {
3385 else
3388 return
3391 {
3399 }
3402 }
3403 }
3405 /* Attempt to find (and return) the global pointer for the given
3406 function.
3408 This is a rather nasty bit of code searchs for the .dynamic section
3409 in the objfile corresponding to the pc of the function we're trying
3410 to call. Once it finds the addresses at which the .dynamic section
3411 lives in the child process, it scans the Elf64_Dyn entries for a
3412 DT_PLTGOT tag. If it finds one of these, the corresponding
3413 d_un.d_ptr value is the global pointer. */
3415 static CORE_ADDR
3417 CORE_ADDR faddr)
3418 {
3424 {
3428 {
3431 }
3434 {
3441 {
3443 LONGEST tag;
3452 {
3453 CORE_ADDR global_pointer;
3459 byte_order);
3461 /* The payoff... */
3463 }
3469 }
3470 }
3471 }
3473 }
3475 /* Attempt to find (and return) the global pointer for the given
3476 function. We first try the find_global_pointer_from_solib routine
3477 from the gdbarch tdep vector, if provided. And if that does not
3478 work, then we try ia64_find_global_pointer_from_dynamic_section. */
3480 static CORE_ADDR
3482 {
3491 }
3493 /* Given a function's address, attempt to find (and return) the
3494 corresponding (canonical) function descriptor. Return 0 if
3495 not found. */
3496 static CORE_ADDR
3498 {
3502 /* Return early if faddr is already a function descriptor. */
3508 {
3511 {
3514 }
3517 {
3524 {
3526 LONGEST faddr2;
3538 }
3539 }
3540 }
3542 }
3544 /* Attempt to find a function descriptor corresponding to the
3545 given address. If none is found, construct one on the
3546 stack using the address at fdaptr. */
3548 static CORE_ADDR
3550 {
3553 CORE_ADDR fdesc;
3558 {
3559 ULONGEST global_pointer;
3575 }
3578 }
3580 /* Use the following routine when printing out function pointers
3581 so the user can see the function address rather than just the
3582 function descriptor. */
3583 static CORE_ADDR
3586 {
3593 /* check if ADDR points to a function descriptor. */
3597 /* Normally, functions live inside a section that is executable.
3598 So, if ADDR points to a non-executable section, then treat it
3599 as a function descriptor and return the target address iff
3600 the target address itself points to a section that is executable.
3601 Check first the memory of the whole length of 8 bytes is readable. */
3604 {
3610 }
3612 /* There are also descriptors embedded in vtables. */
3614 {
3622 }
3625 }
3627 static CORE_ADDR
3629 {
3631 }
3633 /* The default "allocate_new_rse_frame" ia64_infcall_ops routine for ia64. */
3635 static void
3637 {
3653 }
3655 /* The default "store_argument_in_slot" ia64_infcall_ops routine for
3656 ia64. */
3658 static void
3661 {
3663 }
3665 /* The default "set_function_addr" ia64_infcall_ops routine for ia64. */
3667 static void
3669 {
3670 /* Nothing needed. */
3671 }
3673 static CORE_ADDR
3677 function_call_return_method return_method,
3678 CORE_ADDR struct_addr)
3679 {
3688 ULONGEST bsp;
3694 /* Count the number of slots needed for the arguments. */
3696 {
3702 nslots++;
3705 nfuncargs++;
3708 }
3710 /* Divvy up the slots between the RSE and the memory stack. */
3714 /* Allocate a new RSE frame. */
3718 /* We will attempt to find function descriptors in the .opd segment,
3719 but if we can't we'll construct them ourselves. That being the
3720 case, we'll need to reserve space on the stack for them. */
3724 /* Adjust the stack pointer to it's new value. The calling conventions
3725 require us to have 16 bytes of scratch, plus whatever space is
3726 necessary for the memory slots and our function descriptors. */
3730 /* Place the arguments where they belong. The arguments will be
3731 either placed in the RSE backing store or on the memory stack.
3732 In addition, floating point arguments or HFAs are placed in
3733 floating point registers. */
3737 {
3744 /* Special handling for function parameters. */
3748 {
3758 else
3760 slotnum++;
3762 }
3764 /* Normal slots. */
3766 /* Skip odd slot if necessary... */
3768 slotnum++;
3772 {
3777 {
3778 /* Integral types are LSB-aligned, so we have to be careful
3779 to insert the argument on the correct side of the buffer.
3780 This is why we use store_unsigned_integer. */
3781 store_unsigned_integer
3784 byte_order));
3785 }
3786 else
3787 {
3788 /* This is either an 8bit integral type, or an aggregate.
3789 For 8bit integral type, there is no problem, we just
3790 copy the value over.
3792 For aggregates, the only potentially tricky portion
3793 is to write the last one if it is less than 8 bytes.
3794 In this case, the data is Byte0-aligned. Happy news,
3795 this means that we don't need to differentiate the
3796 handling of 8byte blocks and less-than-8bytes blocks. */
3799 }
3804 else
3809 slotnum++;
3810 }
3812 /* Handle floating point types (including HFAs). */
3815 {
3819 {
3825 floatreg++;
3828 }
3829 }
3830 }
3832 /* Store the struct return value in r8 if necessary. */
3842 /* The following is not necessary on HP-UX, because we're using
3843 a dummy code sequence pushed on the stack to make the call, and
3844 this sequence doesn't need b0 to be set in order for our dummy
3845 breakpoint to be hit. Nonetheless, this doesn't interfere, and
3846 it's needed for other OSes, so we do this unconditionaly. */
3854 }
3857 {
3858 ia64_allocate_new_rse_frame,
3859 ia64_store_argument_in_slot,
3860 ia64_set_function_addr
3861 };
3863 static struct frame_id
3865 {
3883 }
3885 static CORE_ADDR
3887 {
3899 }
3901 static int
3903 {
3906 }
3908 /* The default "size_of_register_frame" gdbarch_tdep routine for ia64. */
3910 static int
3912 {
3914 }
3918 {
3922 /* If there is already a candidate, use it. */
3932 /* According to the ia64 specs, instructions that store long double
3933 floats in memory use a long-double format different than that
3934 used in the floating registers. The memory format matches the
3935 x86 extended float format which is 80 bits. An OS may choose to
3936 use this format (e.g. GNU/Linux) or choose to use a different
3937 format for storing long doubles (e.g. HPUX). In the latter case,
3938 the setting of the format may be moved/overridden in an
3939 OS-specific tdep file. */
3973 ia64_memory_insert_breakpoint);
3975 ia64_memory_remove_breakpoint);
3981 /* Settings for calling functions in the inferior. */
3988 #ifdef HAVE_LIBUNWIND_IA64_H
3994 #else
3996 #endif
4000 /* Settings that should be unnecessary. */
4005 ia64_convert_from_func_ptr_addr);
4007 /* The virtual table contains 16-byte descriptors, not pointers to
4008 descriptors. */
4011 /* Hook in ABI-specific overrides, if they have been registered. */
4015 }
4018 void
4020 {
4022 }