Commit | Line | Data |
---|---|---|
4c2df51b | 1 | /* DWARF 2 location expression support for GDB. |
feb13ab0 | 2 | |
ecd75fc8 | 3 | Copyright (C) 2003-2014 Free Software Foundation, Inc. |
feb13ab0 | 4 | |
4c2df51b DJ |
5 | Contributed by Daniel Jacobowitz, MontaVista Software, Inc. |
6 | ||
7 | This file is part of GDB. | |
8 | ||
9 | This program is free software; you can redistribute it and/or modify | |
10 | it under the terms of the GNU General Public License as published by | |
a9762ec7 JB |
11 | the Free Software Foundation; either version 3 of the License, or |
12 | (at your option) any later version. | |
4c2df51b | 13 | |
a9762ec7 JB |
14 | This program is distributed in the hope that it will be useful, |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
4c2df51b DJ |
18 | |
19 | You should have received a copy of the GNU General Public License | |
a9762ec7 | 20 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
4c2df51b DJ |
21 | |
22 | #include "defs.h" | |
23 | #include "ui-out.h" | |
24 | #include "value.h" | |
25 | #include "frame.h" | |
26 | #include "gdbcore.h" | |
27 | #include "target.h" | |
28 | #include "inferior.h" | |
a55cc764 DJ |
29 | #include "ax.h" |
30 | #include "ax-gdb.h" | |
e4adbba9 | 31 | #include "regcache.h" |
c3228f12 | 32 | #include "objfiles.h" |
93ad78a7 | 33 | #include "exceptions.h" |
edb3359d | 34 | #include "block.h" |
8e3b41a9 | 35 | #include "gdbcmd.h" |
4c2df51b | 36 | |
fa8f86ff | 37 | #include "dwarf2.h" |
4c2df51b DJ |
38 | #include "dwarf2expr.h" |
39 | #include "dwarf2loc.h" | |
e7802207 | 40 | #include "dwarf2-frame.h" |
4c2df51b | 41 | |
0e9f083f | 42 | #include <string.h> |
eff4f95e | 43 | #include "gdb_assert.h" |
4c2df51b | 44 | |
9eae7c52 TT |
45 | extern int dwarf2_always_disassemble; |
46 | ||
1632a688 JK |
47 | static void dwarf_expr_frame_base_1 (struct symbol *framefunc, CORE_ADDR pc, |
48 | const gdb_byte **start, size_t *length); | |
0936ad1d | 49 | |
8e3b41a9 JK |
50 | static const struct dwarf_expr_context_funcs dwarf_expr_ctx_funcs; |
51 | ||
1632a688 JK |
52 | static struct value *dwarf2_evaluate_loc_desc_full (struct type *type, |
53 | struct frame_info *frame, | |
54 | const gdb_byte *data, | |
56eb65bd SP |
55 | size_t size, |
56 | struct dwarf2_per_cu_data *per_cu, | |
1632a688 | 57 | LONGEST byte_offset); |
8cf6f0b1 | 58 | |
f664829e DE |
59 | /* Until these have formal names, we define these here. |
60 | ref: http://gcc.gnu.org/wiki/DebugFission | |
61 | Each entry in .debug_loc.dwo begins with a byte that describes the entry, | |
62 | and is then followed by data specific to that entry. */ | |
63 | ||
64 | enum debug_loc_kind | |
65 | { | |
66 | /* Indicates the end of the list of entries. */ | |
67 | DEBUG_LOC_END_OF_LIST = 0, | |
68 | ||
69 | /* This is followed by an unsigned LEB128 number that is an index into | |
70 | .debug_addr and specifies the base address for all following entries. */ | |
71 | DEBUG_LOC_BASE_ADDRESS = 1, | |
72 | ||
73 | /* This is followed by two unsigned LEB128 numbers that are indices into | |
74 | .debug_addr and specify the beginning and ending addresses, and then | |
75 | a normal location expression as in .debug_loc. */ | |
3771a44c DE |
76 | DEBUG_LOC_START_END = 2, |
77 | ||
78 | /* This is followed by an unsigned LEB128 number that is an index into | |
79 | .debug_addr and specifies the beginning address, and a 4 byte unsigned | |
80 | number that specifies the length, and then a normal location expression | |
81 | as in .debug_loc. */ | |
82 | DEBUG_LOC_START_LENGTH = 3, | |
f664829e DE |
83 | |
84 | /* An internal value indicating there is insufficient data. */ | |
85 | DEBUG_LOC_BUFFER_OVERFLOW = -1, | |
86 | ||
87 | /* An internal value indicating an invalid kind of entry was found. */ | |
88 | DEBUG_LOC_INVALID_ENTRY = -2 | |
89 | }; | |
90 | ||
b6807d98 TT |
91 | /* Helper function which throws an error if a synthetic pointer is |
92 | invalid. */ | |
93 | ||
94 | static void | |
95 | invalid_synthetic_pointer (void) | |
96 | { | |
97 | error (_("access outside bounds of object " | |
98 | "referenced via synthetic pointer")); | |
99 | } | |
100 | ||
f664829e DE |
101 | /* Decode the addresses in a non-dwo .debug_loc entry. |
102 | A pointer to the next byte to examine is returned in *NEW_PTR. | |
103 | The encoded low,high addresses are return in *LOW,*HIGH. | |
104 | The result indicates the kind of entry found. */ | |
105 | ||
106 | static enum debug_loc_kind | |
107 | decode_debug_loc_addresses (const gdb_byte *loc_ptr, const gdb_byte *buf_end, | |
108 | const gdb_byte **new_ptr, | |
109 | CORE_ADDR *low, CORE_ADDR *high, | |
110 | enum bfd_endian byte_order, | |
111 | unsigned int addr_size, | |
112 | int signed_addr_p) | |
113 | { | |
114 | CORE_ADDR base_mask = ~(~(CORE_ADDR)1 << (addr_size * 8 - 1)); | |
115 | ||
116 | if (buf_end - loc_ptr < 2 * addr_size) | |
117 | return DEBUG_LOC_BUFFER_OVERFLOW; | |
118 | ||
119 | if (signed_addr_p) | |
120 | *low = extract_signed_integer (loc_ptr, addr_size, byte_order); | |
121 | else | |
122 | *low = extract_unsigned_integer (loc_ptr, addr_size, byte_order); | |
123 | loc_ptr += addr_size; | |
124 | ||
125 | if (signed_addr_p) | |
126 | *high = extract_signed_integer (loc_ptr, addr_size, byte_order); | |
127 | else | |
128 | *high = extract_unsigned_integer (loc_ptr, addr_size, byte_order); | |
129 | loc_ptr += addr_size; | |
130 | ||
131 | *new_ptr = loc_ptr; | |
132 | ||
133 | /* A base-address-selection entry. */ | |
134 | if ((*low & base_mask) == base_mask) | |
135 | return DEBUG_LOC_BASE_ADDRESS; | |
136 | ||
137 | /* An end-of-list entry. */ | |
138 | if (*low == 0 && *high == 0) | |
139 | return DEBUG_LOC_END_OF_LIST; | |
140 | ||
3771a44c | 141 | return DEBUG_LOC_START_END; |
f664829e DE |
142 | } |
143 | ||
144 | /* Decode the addresses in .debug_loc.dwo entry. | |
145 | A pointer to the next byte to examine is returned in *NEW_PTR. | |
146 | The encoded low,high addresses are return in *LOW,*HIGH. | |
147 | The result indicates the kind of entry found. */ | |
148 | ||
149 | static enum debug_loc_kind | |
150 | decode_debug_loc_dwo_addresses (struct dwarf2_per_cu_data *per_cu, | |
151 | const gdb_byte *loc_ptr, | |
152 | const gdb_byte *buf_end, | |
153 | const gdb_byte **new_ptr, | |
3771a44c DE |
154 | CORE_ADDR *low, CORE_ADDR *high, |
155 | enum bfd_endian byte_order) | |
f664829e | 156 | { |
9fccedf7 | 157 | uint64_t low_index, high_index; |
f664829e DE |
158 | |
159 | if (loc_ptr == buf_end) | |
160 | return DEBUG_LOC_BUFFER_OVERFLOW; | |
161 | ||
162 | switch (*loc_ptr++) | |
163 | { | |
164 | case DEBUG_LOC_END_OF_LIST: | |
165 | *new_ptr = loc_ptr; | |
166 | return DEBUG_LOC_END_OF_LIST; | |
167 | case DEBUG_LOC_BASE_ADDRESS: | |
168 | *low = 0; | |
169 | loc_ptr = gdb_read_uleb128 (loc_ptr, buf_end, &high_index); | |
170 | if (loc_ptr == NULL) | |
171 | return DEBUG_LOC_BUFFER_OVERFLOW; | |
172 | *high = dwarf2_read_addr_index (per_cu, high_index); | |
173 | *new_ptr = loc_ptr; | |
174 | return DEBUG_LOC_BASE_ADDRESS; | |
3771a44c | 175 | case DEBUG_LOC_START_END: |
f664829e DE |
176 | loc_ptr = gdb_read_uleb128 (loc_ptr, buf_end, &low_index); |
177 | if (loc_ptr == NULL) | |
178 | return DEBUG_LOC_BUFFER_OVERFLOW; | |
179 | *low = dwarf2_read_addr_index (per_cu, low_index); | |
180 | loc_ptr = gdb_read_uleb128 (loc_ptr, buf_end, &high_index); | |
181 | if (loc_ptr == NULL) | |
182 | return DEBUG_LOC_BUFFER_OVERFLOW; | |
183 | *high = dwarf2_read_addr_index (per_cu, high_index); | |
184 | *new_ptr = loc_ptr; | |
3771a44c DE |
185 | return DEBUG_LOC_START_END; |
186 | case DEBUG_LOC_START_LENGTH: | |
187 | loc_ptr = gdb_read_uleb128 (loc_ptr, buf_end, &low_index); | |
188 | if (loc_ptr == NULL) | |
189 | return DEBUG_LOC_BUFFER_OVERFLOW; | |
190 | *low = dwarf2_read_addr_index (per_cu, low_index); | |
191 | if (loc_ptr + 4 > buf_end) | |
192 | return DEBUG_LOC_BUFFER_OVERFLOW; | |
193 | *high = *low; | |
194 | *high += extract_unsigned_integer (loc_ptr, 4, byte_order); | |
195 | *new_ptr = loc_ptr + 4; | |
196 | return DEBUG_LOC_START_LENGTH; | |
f664829e DE |
197 | default: |
198 | return DEBUG_LOC_INVALID_ENTRY; | |
199 | } | |
200 | } | |
201 | ||
8cf6f0b1 | 202 | /* A function for dealing with location lists. Given a |
0d53c4c4 DJ |
203 | symbol baton (BATON) and a pc value (PC), find the appropriate |
204 | location expression, set *LOCEXPR_LENGTH, and return a pointer | |
205 | to the beginning of the expression. Returns NULL on failure. | |
206 | ||
207 | For now, only return the first matching location expression; there | |
208 | can be more than one in the list. */ | |
209 | ||
8cf6f0b1 TT |
210 | const gdb_byte * |
211 | dwarf2_find_location_expression (struct dwarf2_loclist_baton *baton, | |
212 | size_t *locexpr_length, CORE_ADDR pc) | |
0d53c4c4 | 213 | { |
ae0d2f24 | 214 | struct objfile *objfile = dwarf2_per_cu_objfile (baton->per_cu); |
f7fd4728 | 215 | struct gdbarch *gdbarch = get_objfile_arch (objfile); |
e17a4113 | 216 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); |
ae0d2f24 | 217 | unsigned int addr_size = dwarf2_per_cu_addr_size (baton->per_cu); |
d4a087c7 | 218 | int signed_addr_p = bfd_get_sign_extend_vma (objfile->obfd); |
8edfa926 | 219 | /* Adjust base_address for relocatable objects. */ |
9aa1f1e3 | 220 | CORE_ADDR base_offset = dwarf2_per_cu_text_offset (baton->per_cu); |
8edfa926 | 221 | CORE_ADDR base_address = baton->base_address + base_offset; |
f664829e | 222 | const gdb_byte *loc_ptr, *buf_end; |
0d53c4c4 DJ |
223 | |
224 | loc_ptr = baton->data; | |
225 | buf_end = baton->data + baton->size; | |
226 | ||
227 | while (1) | |
228 | { | |
f664829e DE |
229 | CORE_ADDR low = 0, high = 0; /* init for gcc -Wall */ |
230 | int length; | |
231 | enum debug_loc_kind kind; | |
232 | const gdb_byte *new_ptr = NULL; /* init for gcc -Wall */ | |
233 | ||
234 | if (baton->from_dwo) | |
235 | kind = decode_debug_loc_dwo_addresses (baton->per_cu, | |
236 | loc_ptr, buf_end, &new_ptr, | |
3771a44c | 237 | &low, &high, byte_order); |
d4a087c7 | 238 | else |
f664829e DE |
239 | kind = decode_debug_loc_addresses (loc_ptr, buf_end, &new_ptr, |
240 | &low, &high, | |
241 | byte_order, addr_size, | |
242 | signed_addr_p); | |
243 | loc_ptr = new_ptr; | |
244 | switch (kind) | |
1d6edc3c | 245 | { |
f664829e | 246 | case DEBUG_LOC_END_OF_LIST: |
1d6edc3c JK |
247 | *locexpr_length = 0; |
248 | return NULL; | |
f664829e DE |
249 | case DEBUG_LOC_BASE_ADDRESS: |
250 | base_address = high + base_offset; | |
251 | continue; | |
3771a44c DE |
252 | case DEBUG_LOC_START_END: |
253 | case DEBUG_LOC_START_LENGTH: | |
f664829e DE |
254 | break; |
255 | case DEBUG_LOC_BUFFER_OVERFLOW: | |
256 | case DEBUG_LOC_INVALID_ENTRY: | |
257 | error (_("dwarf2_find_location_expression: " | |
258 | "Corrupted DWARF expression.")); | |
259 | default: | |
260 | gdb_assert_not_reached ("bad debug_loc_kind"); | |
1d6edc3c | 261 | } |
b5758fe4 | 262 | |
bed911e5 DE |
263 | /* Otherwise, a location expression entry. |
264 | If the entry is from a DWO, don't add base address: the entry is | |
265 | from .debug_addr which has absolute addresses. */ | |
266 | if (! baton->from_dwo) | |
267 | { | |
268 | low += base_address; | |
269 | high += base_address; | |
270 | } | |
0d53c4c4 | 271 | |
e17a4113 | 272 | length = extract_unsigned_integer (loc_ptr, 2, byte_order); |
0d53c4c4 DJ |
273 | loc_ptr += 2; |
274 | ||
e18b2753 JK |
275 | if (low == high && pc == low) |
276 | { | |
277 | /* This is entry PC record present only at entry point | |
278 | of a function. Verify it is really the function entry point. */ | |
279 | ||
280 | struct block *pc_block = block_for_pc (pc); | |
281 | struct symbol *pc_func = NULL; | |
282 | ||
283 | if (pc_block) | |
284 | pc_func = block_linkage_function (pc_block); | |
285 | ||
286 | if (pc_func && pc == BLOCK_START (SYMBOL_BLOCK_VALUE (pc_func))) | |
287 | { | |
288 | *locexpr_length = length; | |
289 | return loc_ptr; | |
290 | } | |
291 | } | |
292 | ||
0d53c4c4 DJ |
293 | if (pc >= low && pc < high) |
294 | { | |
295 | *locexpr_length = length; | |
296 | return loc_ptr; | |
297 | } | |
298 | ||
299 | loc_ptr += length; | |
300 | } | |
301 | } | |
302 | ||
4c2df51b DJ |
303 | /* This is the baton used when performing dwarf2 expression |
304 | evaluation. */ | |
305 | struct dwarf_expr_baton | |
306 | { | |
307 | struct frame_info *frame; | |
17ea53c3 | 308 | struct dwarf2_per_cu_data *per_cu; |
4c2df51b DJ |
309 | }; |
310 | ||
311 | /* Helper functions for dwarf2_evaluate_loc_desc. */ | |
312 | ||
4bc9efe1 | 313 | /* Using the frame specified in BATON, return the value of register |
0b2b0195 | 314 | REGNUM, treated as a pointer. */ |
4c2df51b | 315 | static CORE_ADDR |
b1370418 | 316 | dwarf_expr_read_addr_from_reg (void *baton, int dwarf_regnum) |
4c2df51b | 317 | { |
4c2df51b | 318 | struct dwarf_expr_baton *debaton = (struct dwarf_expr_baton *) baton; |
5e2b427d | 319 | struct gdbarch *gdbarch = get_frame_arch (debaton->frame); |
e5192dd8 | 320 | CORE_ADDR result; |
0b2b0195 | 321 | int regnum; |
e4adbba9 | 322 | |
5e2b427d UW |
323 | regnum = gdbarch_dwarf2_reg_to_regnum (gdbarch, dwarf_regnum); |
324 | result = address_from_register (builtin_type (gdbarch)->builtin_data_ptr, | |
0b2b0195 | 325 | regnum, debaton->frame); |
4c2df51b DJ |
326 | return result; |
327 | } | |
328 | ||
0acf8b65 JB |
329 | /* Implement struct dwarf_expr_context_funcs' "get_reg_value" callback. */ |
330 | ||
331 | static struct value * | |
332 | dwarf_expr_get_reg_value (void *baton, struct type *type, int dwarf_regnum) | |
333 | { | |
334 | struct dwarf_expr_baton *debaton = (struct dwarf_expr_baton *) baton; | |
335 | struct gdbarch *gdbarch = get_frame_arch (debaton->frame); | |
336 | int regnum = gdbarch_dwarf2_reg_to_regnum (gdbarch, dwarf_regnum); | |
337 | ||
338 | return value_from_register (type, regnum, debaton->frame); | |
339 | } | |
340 | ||
4c2df51b DJ |
341 | /* Read memory at ADDR (length LEN) into BUF. */ |
342 | ||
343 | static void | |
852483bc | 344 | dwarf_expr_read_mem (void *baton, gdb_byte *buf, CORE_ADDR addr, size_t len) |
4c2df51b DJ |
345 | { |
346 | read_memory (addr, buf, len); | |
347 | } | |
348 | ||
349 | /* Using the frame specified in BATON, find the location expression | |
350 | describing the frame base. Return a pointer to it in START and | |
351 | its length in LENGTH. */ | |
352 | static void | |
0d45f56e | 353 | dwarf_expr_frame_base (void *baton, const gdb_byte **start, size_t * length) |
4c2df51b | 354 | { |
da62e633 AC |
355 | /* FIXME: cagney/2003-03-26: This code should be using |
356 | get_frame_base_address(), and then implement a dwarf2 specific | |
357 | this_base method. */ | |
4c2df51b | 358 | struct symbol *framefunc; |
4c2df51b | 359 | struct dwarf_expr_baton *debaton = (struct dwarf_expr_baton *) baton; |
c90a0773 HZ |
360 | struct block *bl = get_frame_block (debaton->frame, NULL); |
361 | ||
362 | if (bl == NULL) | |
363 | error (_("frame address is not available.")); | |
0d53c4c4 | 364 | |
edb3359d DJ |
365 | /* Use block_linkage_function, which returns a real (not inlined) |
366 | function, instead of get_frame_function, which may return an | |
367 | inlined function. */ | |
c90a0773 | 368 | framefunc = block_linkage_function (bl); |
0d53c4c4 | 369 | |
eff4f95e JG |
370 | /* If we found a frame-relative symbol then it was certainly within |
371 | some function associated with a frame. If we can't find the frame, | |
372 | something has gone wrong. */ | |
373 | gdb_assert (framefunc != NULL); | |
374 | ||
0936ad1d SS |
375 | dwarf_expr_frame_base_1 (framefunc, |
376 | get_frame_address_in_block (debaton->frame), | |
377 | start, length); | |
378 | } | |
379 | ||
f1e6e072 TT |
380 | /* Implement find_frame_base_location method for LOC_BLOCK functions using |
381 | DWARF expression for its DW_AT_frame_base. */ | |
382 | ||
383 | static void | |
384 | locexpr_find_frame_base_location (struct symbol *framefunc, CORE_ADDR pc, | |
385 | const gdb_byte **start, size_t *length) | |
386 | { | |
387 | struct dwarf2_locexpr_baton *symbaton = SYMBOL_LOCATION_BATON (framefunc); | |
388 | ||
389 | *length = symbaton->size; | |
390 | *start = symbaton->data; | |
391 | } | |
392 | ||
393 | /* Vector for inferior functions as represented by LOC_BLOCK, if the inferior | |
394 | function uses DWARF expression for its DW_AT_frame_base. */ | |
395 | ||
396 | const struct symbol_block_ops dwarf2_block_frame_base_locexpr_funcs = | |
397 | { | |
398 | locexpr_find_frame_base_location | |
399 | }; | |
400 | ||
401 | /* Implement find_frame_base_location method for LOC_BLOCK functions using | |
402 | DWARF location list for its DW_AT_frame_base. */ | |
403 | ||
404 | static void | |
405 | loclist_find_frame_base_location (struct symbol *framefunc, CORE_ADDR pc, | |
406 | const gdb_byte **start, size_t *length) | |
407 | { | |
408 | struct dwarf2_loclist_baton *symbaton = SYMBOL_LOCATION_BATON (framefunc); | |
409 | ||
410 | *start = dwarf2_find_location_expression (symbaton, length, pc); | |
411 | } | |
412 | ||
413 | /* Vector for inferior functions as represented by LOC_BLOCK, if the inferior | |
414 | function uses DWARF location list for its DW_AT_frame_base. */ | |
415 | ||
416 | const struct symbol_block_ops dwarf2_block_frame_base_loclist_funcs = | |
417 | { | |
418 | loclist_find_frame_base_location | |
419 | }; | |
420 | ||
0936ad1d SS |
421 | static void |
422 | dwarf_expr_frame_base_1 (struct symbol *framefunc, CORE_ADDR pc, | |
0d45f56e | 423 | const gdb_byte **start, size_t *length) |
0936ad1d | 424 | { |
f1e6e072 | 425 | if (SYMBOL_BLOCK_OPS (framefunc) != NULL) |
0d53c4c4 | 426 | { |
f1e6e072 | 427 | const struct symbol_block_ops *ops_block = SYMBOL_BLOCK_OPS (framefunc); |
22c6caba | 428 | |
f1e6e072 | 429 | ops_block->find_frame_base_location (framefunc, pc, start, length); |
0d53c4c4 DJ |
430 | } |
431 | else | |
f1e6e072 | 432 | *length = 0; |
0d53c4c4 | 433 | |
1d6edc3c | 434 | if (*length == 0) |
8a3fe4f8 | 435 | error (_("Could not find the frame base for \"%s\"."), |
0d53c4c4 | 436 | SYMBOL_NATURAL_NAME (framefunc)); |
4c2df51b DJ |
437 | } |
438 | ||
e7802207 TT |
439 | /* Helper function for dwarf2_evaluate_loc_desc. Computes the CFA for |
440 | the frame in BATON. */ | |
441 | ||
442 | static CORE_ADDR | |
443 | dwarf_expr_frame_cfa (void *baton) | |
444 | { | |
445 | struct dwarf_expr_baton *debaton = (struct dwarf_expr_baton *) baton; | |
9a619af0 | 446 | |
e7802207 TT |
447 | return dwarf2_frame_cfa (debaton->frame); |
448 | } | |
449 | ||
8cf6f0b1 TT |
450 | /* Helper function for dwarf2_evaluate_loc_desc. Computes the PC for |
451 | the frame in BATON. */ | |
452 | ||
453 | static CORE_ADDR | |
454 | dwarf_expr_frame_pc (void *baton) | |
455 | { | |
456 | struct dwarf_expr_baton *debaton = (struct dwarf_expr_baton *) baton; | |
457 | ||
458 | return get_frame_address_in_block (debaton->frame); | |
459 | } | |
460 | ||
4c2df51b DJ |
461 | /* Using the objfile specified in BATON, find the address for the |
462 | current thread's thread-local storage with offset OFFSET. */ | |
463 | static CORE_ADDR | |
464 | dwarf_expr_tls_address (void *baton, CORE_ADDR offset) | |
465 | { | |
466 | struct dwarf_expr_baton *debaton = (struct dwarf_expr_baton *) baton; | |
17ea53c3 | 467 | struct objfile *objfile = dwarf2_per_cu_objfile (debaton->per_cu); |
4c2df51b | 468 | |
17ea53c3 | 469 | return target_translate_tls_address (objfile, offset); |
4c2df51b DJ |
470 | } |
471 | ||
3e43a32a MS |
472 | /* Call DWARF subroutine from DW_AT_location of DIE at DIE_OFFSET in |
473 | current CU (as is PER_CU). State of the CTX is not affected by the | |
474 | call and return. */ | |
5c631832 JK |
475 | |
476 | static void | |
b64f50a1 | 477 | per_cu_dwarf_call (struct dwarf_expr_context *ctx, cu_offset die_offset, |
8cf6f0b1 TT |
478 | struct dwarf2_per_cu_data *per_cu, |
479 | CORE_ADDR (*get_frame_pc) (void *baton), | |
480 | void *baton) | |
5c631832 JK |
481 | { |
482 | struct dwarf2_locexpr_baton block; | |
483 | ||
8b9737bf | 484 | block = dwarf2_fetch_die_loc_cu_off (die_offset, per_cu, get_frame_pc, baton); |
5c631832 JK |
485 | |
486 | /* DW_OP_call_ref is currently not supported. */ | |
487 | gdb_assert (block.per_cu == per_cu); | |
488 | ||
489 | dwarf_expr_eval (ctx, block.data, block.size); | |
490 | } | |
491 | ||
492 | /* Helper interface of per_cu_dwarf_call for dwarf2_evaluate_loc_desc. */ | |
493 | ||
494 | static void | |
b64f50a1 | 495 | dwarf_expr_dwarf_call (struct dwarf_expr_context *ctx, cu_offset die_offset) |
5c631832 JK |
496 | { |
497 | struct dwarf_expr_baton *debaton = ctx->baton; | |
498 | ||
37b50a69 | 499 | per_cu_dwarf_call (ctx, die_offset, debaton->per_cu, |
9e8b7a03 | 500 | ctx->funcs->get_frame_pc, ctx->baton); |
5c631832 JK |
501 | } |
502 | ||
8a9b8146 TT |
503 | /* Callback function for dwarf2_evaluate_loc_desc. */ |
504 | ||
505 | static struct type * | |
b64f50a1 JK |
506 | dwarf_expr_get_base_type (struct dwarf_expr_context *ctx, |
507 | cu_offset die_offset) | |
8a9b8146 TT |
508 | { |
509 | struct dwarf_expr_baton *debaton = ctx->baton; | |
510 | ||
511 | return dwarf2_get_die_type (die_offset, debaton->per_cu); | |
512 | } | |
513 | ||
8e3b41a9 JK |
514 | /* See dwarf2loc.h. */ |
515 | ||
ccce17b0 | 516 | unsigned int entry_values_debug = 0; |
8e3b41a9 JK |
517 | |
518 | /* Helper to set entry_values_debug. */ | |
519 | ||
520 | static void | |
521 | show_entry_values_debug (struct ui_file *file, int from_tty, | |
522 | struct cmd_list_element *c, const char *value) | |
523 | { | |
524 | fprintf_filtered (file, | |
525 | _("Entry values and tail call frames debugging is %s.\n"), | |
526 | value); | |
527 | } | |
528 | ||
529 | /* Find DW_TAG_GNU_call_site's DW_AT_GNU_call_site_target address. | |
530 | CALLER_FRAME (for registers) can be NULL if it is not known. This function | |
531 | always returns valid address or it throws NO_ENTRY_VALUE_ERROR. */ | |
532 | ||
533 | static CORE_ADDR | |
534 | call_site_to_target_addr (struct gdbarch *call_site_gdbarch, | |
535 | struct call_site *call_site, | |
536 | struct frame_info *caller_frame) | |
537 | { | |
538 | switch (FIELD_LOC_KIND (call_site->target)) | |
539 | { | |
540 | case FIELD_LOC_KIND_DWARF_BLOCK: | |
541 | { | |
542 | struct dwarf2_locexpr_baton *dwarf_block; | |
543 | struct value *val; | |
544 | struct type *caller_core_addr_type; | |
545 | struct gdbarch *caller_arch; | |
546 | ||
547 | dwarf_block = FIELD_DWARF_BLOCK (call_site->target); | |
548 | if (dwarf_block == NULL) | |
549 | { | |
7cbd4a93 | 550 | struct bound_minimal_symbol msym; |
8e3b41a9 JK |
551 | |
552 | msym = lookup_minimal_symbol_by_pc (call_site->pc - 1); | |
553 | throw_error (NO_ENTRY_VALUE_ERROR, | |
554 | _("DW_AT_GNU_call_site_target is not specified " | |
555 | "at %s in %s"), | |
556 | paddress (call_site_gdbarch, call_site->pc), | |
7cbd4a93 | 557 | (msym.minsym == NULL ? "???" |
efd66ac6 | 558 | : MSYMBOL_PRINT_NAME (msym.minsym))); |
8e3b41a9 JK |
559 | |
560 | } | |
561 | if (caller_frame == NULL) | |
562 | { | |
7cbd4a93 | 563 | struct bound_minimal_symbol msym; |
8e3b41a9 JK |
564 | |
565 | msym = lookup_minimal_symbol_by_pc (call_site->pc - 1); | |
566 | throw_error (NO_ENTRY_VALUE_ERROR, | |
567 | _("DW_AT_GNU_call_site_target DWARF block resolving " | |
568 | "requires known frame which is currently not " | |
569 | "available at %s in %s"), | |
570 | paddress (call_site_gdbarch, call_site->pc), | |
7cbd4a93 | 571 | (msym.minsym == NULL ? "???" |
efd66ac6 | 572 | : MSYMBOL_PRINT_NAME (msym.minsym))); |
8e3b41a9 JK |
573 | |
574 | } | |
575 | caller_arch = get_frame_arch (caller_frame); | |
576 | caller_core_addr_type = builtin_type (caller_arch)->builtin_func_ptr; | |
577 | val = dwarf2_evaluate_loc_desc (caller_core_addr_type, caller_frame, | |
578 | dwarf_block->data, dwarf_block->size, | |
579 | dwarf_block->per_cu); | |
580 | /* DW_AT_GNU_call_site_target is a DWARF expression, not a DWARF | |
581 | location. */ | |
582 | if (VALUE_LVAL (val) == lval_memory) | |
583 | return value_address (val); | |
584 | else | |
585 | return value_as_address (val); | |
586 | } | |
587 | ||
588 | case FIELD_LOC_KIND_PHYSNAME: | |
589 | { | |
590 | const char *physname; | |
3b7344d5 | 591 | struct bound_minimal_symbol msym; |
8e3b41a9 JK |
592 | |
593 | physname = FIELD_STATIC_PHYSNAME (call_site->target); | |
9112db09 JK |
594 | |
595 | /* Handle both the mangled and demangled PHYSNAME. */ | |
596 | msym = lookup_minimal_symbol (physname, NULL, NULL); | |
3b7344d5 | 597 | if (msym.minsym == NULL) |
8e3b41a9 | 598 | { |
3b7344d5 | 599 | msym = lookup_minimal_symbol_by_pc (call_site->pc - 1); |
8e3b41a9 JK |
600 | throw_error (NO_ENTRY_VALUE_ERROR, |
601 | _("Cannot find function \"%s\" for a call site target " | |
602 | "at %s in %s"), | |
603 | physname, paddress (call_site_gdbarch, call_site->pc), | |
3b7344d5 TT |
604 | (msym.minsym == NULL ? "???" |
605 | : MSYMBOL_PRINT_NAME (msym.minsym))); | |
8e3b41a9 JK |
606 | |
607 | } | |
77e371c0 | 608 | return BMSYMBOL_VALUE_ADDRESS (msym); |
8e3b41a9 JK |
609 | } |
610 | ||
611 | case FIELD_LOC_KIND_PHYSADDR: | |
612 | return FIELD_STATIC_PHYSADDR (call_site->target); | |
613 | ||
614 | default: | |
615 | internal_error (__FILE__, __LINE__, _("invalid call site target kind")); | |
616 | } | |
617 | } | |
618 | ||
111c6489 JK |
619 | /* Convert function entry point exact address ADDR to the function which is |
620 | compliant with TAIL_CALL_LIST_COMPLETE condition. Throw | |
621 | NO_ENTRY_VALUE_ERROR otherwise. */ | |
622 | ||
623 | static struct symbol * | |
624 | func_addr_to_tail_call_list (struct gdbarch *gdbarch, CORE_ADDR addr) | |
625 | { | |
626 | struct symbol *sym = find_pc_function (addr); | |
627 | struct type *type; | |
628 | ||
629 | if (sym == NULL || BLOCK_START (SYMBOL_BLOCK_VALUE (sym)) != addr) | |
630 | throw_error (NO_ENTRY_VALUE_ERROR, | |
631 | _("DW_TAG_GNU_call_site resolving failed to find function " | |
632 | "name for address %s"), | |
633 | paddress (gdbarch, addr)); | |
634 | ||
635 | type = SYMBOL_TYPE (sym); | |
636 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_FUNC); | |
637 | gdb_assert (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_FUNC); | |
638 | ||
639 | return sym; | |
640 | } | |
641 | ||
2d6c5dc2 JK |
642 | /* Verify function with entry point exact address ADDR can never call itself |
643 | via its tail calls (incl. transitively). Throw NO_ENTRY_VALUE_ERROR if it | |
644 | can call itself via tail calls. | |
645 | ||
646 | If a funtion can tail call itself its entry value based parameters are | |
647 | unreliable. There is no verification whether the value of some/all | |
648 | parameters is unchanged through the self tail call, we expect if there is | |
649 | a self tail call all the parameters can be modified. */ | |
650 | ||
651 | static void | |
652 | func_verify_no_selftailcall (struct gdbarch *gdbarch, CORE_ADDR verify_addr) | |
653 | { | |
654 | struct obstack addr_obstack; | |
655 | struct cleanup *old_chain; | |
656 | CORE_ADDR addr; | |
657 | ||
658 | /* Track here CORE_ADDRs which were already visited. */ | |
659 | htab_t addr_hash; | |
660 | ||
661 | /* The verification is completely unordered. Track here function addresses | |
662 | which still need to be iterated. */ | |
663 | VEC (CORE_ADDR) *todo = NULL; | |
664 | ||
665 | obstack_init (&addr_obstack); | |
666 | old_chain = make_cleanup_obstack_free (&addr_obstack); | |
667 | addr_hash = htab_create_alloc_ex (64, core_addr_hash, core_addr_eq, NULL, | |
668 | &addr_obstack, hashtab_obstack_allocate, | |
669 | NULL); | |
670 | make_cleanup_htab_delete (addr_hash); | |
671 | ||
672 | make_cleanup (VEC_cleanup (CORE_ADDR), &todo); | |
673 | ||
674 | VEC_safe_push (CORE_ADDR, todo, verify_addr); | |
675 | while (!VEC_empty (CORE_ADDR, todo)) | |
676 | { | |
677 | struct symbol *func_sym; | |
678 | struct call_site *call_site; | |
679 | ||
680 | addr = VEC_pop (CORE_ADDR, todo); | |
681 | ||
682 | func_sym = func_addr_to_tail_call_list (gdbarch, addr); | |
683 | ||
684 | for (call_site = TYPE_TAIL_CALL_LIST (SYMBOL_TYPE (func_sym)); | |
685 | call_site; call_site = call_site->tail_call_next) | |
686 | { | |
687 | CORE_ADDR target_addr; | |
688 | void **slot; | |
689 | ||
690 | /* CALLER_FRAME with registers is not available for tail-call jumped | |
691 | frames. */ | |
692 | target_addr = call_site_to_target_addr (gdbarch, call_site, NULL); | |
693 | ||
694 | if (target_addr == verify_addr) | |
695 | { | |
7cbd4a93 | 696 | struct bound_minimal_symbol msym; |
2d6c5dc2 JK |
697 | |
698 | msym = lookup_minimal_symbol_by_pc (verify_addr); | |
699 | throw_error (NO_ENTRY_VALUE_ERROR, | |
700 | _("DW_OP_GNU_entry_value resolving has found " | |
701 | "function \"%s\" at %s can call itself via tail " | |
702 | "calls"), | |
7cbd4a93 | 703 | (msym.minsym == NULL ? "???" |
efd66ac6 | 704 | : MSYMBOL_PRINT_NAME (msym.minsym)), |
2d6c5dc2 JK |
705 | paddress (gdbarch, verify_addr)); |
706 | } | |
707 | ||
708 | slot = htab_find_slot (addr_hash, &target_addr, INSERT); | |
709 | if (*slot == NULL) | |
710 | { | |
711 | *slot = obstack_copy (&addr_obstack, &target_addr, | |
712 | sizeof (target_addr)); | |
713 | VEC_safe_push (CORE_ADDR, todo, target_addr); | |
714 | } | |
715 | } | |
716 | } | |
717 | ||
718 | do_cleanups (old_chain); | |
719 | } | |
720 | ||
111c6489 JK |
721 | /* Print user readable form of CALL_SITE->PC to gdb_stdlog. Used only for |
722 | ENTRY_VALUES_DEBUG. */ | |
723 | ||
724 | static void | |
725 | tailcall_dump (struct gdbarch *gdbarch, const struct call_site *call_site) | |
726 | { | |
727 | CORE_ADDR addr = call_site->pc; | |
7cbd4a93 | 728 | struct bound_minimal_symbol msym = lookup_minimal_symbol_by_pc (addr - 1); |
111c6489 JK |
729 | |
730 | fprintf_unfiltered (gdb_stdlog, " %s(%s)", paddress (gdbarch, addr), | |
7cbd4a93 | 731 | (msym.minsym == NULL ? "???" |
efd66ac6 | 732 | : MSYMBOL_PRINT_NAME (msym.minsym))); |
111c6489 JK |
733 | |
734 | } | |
735 | ||
736 | /* vec.h needs single word type name, typedef it. */ | |
737 | typedef struct call_site *call_sitep; | |
738 | ||
739 | /* Define VEC (call_sitep) functions. */ | |
740 | DEF_VEC_P (call_sitep); | |
741 | ||
742 | /* Intersect RESULTP with CHAIN to keep RESULTP unambiguous, keep in RESULTP | |
743 | only top callers and bottom callees which are present in both. GDBARCH is | |
744 | used only for ENTRY_VALUES_DEBUG. RESULTP is NULL after return if there are | |
745 | no remaining possibilities to provide unambiguous non-trivial result. | |
746 | RESULTP should point to NULL on the first (initialization) call. Caller is | |
747 | responsible for xfree of any RESULTP data. */ | |
748 | ||
749 | static void | |
750 | chain_candidate (struct gdbarch *gdbarch, struct call_site_chain **resultp, | |
751 | VEC (call_sitep) *chain) | |
752 | { | |
753 | struct call_site_chain *result = *resultp; | |
754 | long length = VEC_length (call_sitep, chain); | |
755 | int callers, callees, idx; | |
756 | ||
757 | if (result == NULL) | |
758 | { | |
759 | /* Create the initial chain containing all the passed PCs. */ | |
760 | ||
761 | result = xmalloc (sizeof (*result) + sizeof (*result->call_site) | |
762 | * (length - 1)); | |
763 | result->length = length; | |
764 | result->callers = result->callees = length; | |
19a1b230 AA |
765 | if (!VEC_empty (call_sitep, chain)) |
766 | memcpy (result->call_site, VEC_address (call_sitep, chain), | |
767 | sizeof (*result->call_site) * length); | |
111c6489 JK |
768 | *resultp = result; |
769 | ||
770 | if (entry_values_debug) | |
771 | { | |
772 | fprintf_unfiltered (gdb_stdlog, "tailcall: initial:"); | |
773 | for (idx = 0; idx < length; idx++) | |
774 | tailcall_dump (gdbarch, result->call_site[idx]); | |
775 | fputc_unfiltered ('\n', gdb_stdlog); | |
776 | } | |
777 | ||
778 | return; | |
779 | } | |
780 | ||
781 | if (entry_values_debug) | |
782 | { | |
783 | fprintf_unfiltered (gdb_stdlog, "tailcall: compare:"); | |
784 | for (idx = 0; idx < length; idx++) | |
785 | tailcall_dump (gdbarch, VEC_index (call_sitep, chain, idx)); | |
786 | fputc_unfiltered ('\n', gdb_stdlog); | |
787 | } | |
788 | ||
789 | /* Intersect callers. */ | |
790 | ||
791 | callers = min (result->callers, length); | |
792 | for (idx = 0; idx < callers; idx++) | |
793 | if (result->call_site[idx] != VEC_index (call_sitep, chain, idx)) | |
794 | { | |
795 | result->callers = idx; | |
796 | break; | |
797 | } | |
798 | ||
799 | /* Intersect callees. */ | |
800 | ||
801 | callees = min (result->callees, length); | |
802 | for (idx = 0; idx < callees; idx++) | |
803 | if (result->call_site[result->length - 1 - idx] | |
804 | != VEC_index (call_sitep, chain, length - 1 - idx)) | |
805 | { | |
806 | result->callees = idx; | |
807 | break; | |
808 | } | |
809 | ||
810 | if (entry_values_debug) | |
811 | { | |
812 | fprintf_unfiltered (gdb_stdlog, "tailcall: reduced:"); | |
813 | for (idx = 0; idx < result->callers; idx++) | |
814 | tailcall_dump (gdbarch, result->call_site[idx]); | |
815 | fputs_unfiltered (" |", gdb_stdlog); | |
816 | for (idx = 0; idx < result->callees; idx++) | |
817 | tailcall_dump (gdbarch, result->call_site[result->length | |
818 | - result->callees + idx]); | |
819 | fputc_unfiltered ('\n', gdb_stdlog); | |
820 | } | |
821 | ||
822 | if (result->callers == 0 && result->callees == 0) | |
823 | { | |
824 | /* There are no common callers or callees. It could be also a direct | |
825 | call (which has length 0) with ambiguous possibility of an indirect | |
826 | call - CALLERS == CALLEES == 0 is valid during the first allocation | |
827 | but any subsequence processing of such entry means ambiguity. */ | |
828 | xfree (result); | |
829 | *resultp = NULL; | |
830 | return; | |
831 | } | |
832 | ||
833 | /* See call_site_find_chain_1 why there is no way to reach the bottom callee | |
834 | PC again. In such case there must be two different code paths to reach | |
835 | it, therefore some of the former determined intermediate PCs must differ | |
836 | and the unambiguous chain gets shortened. */ | |
837 | gdb_assert (result->callers + result->callees < result->length); | |
838 | } | |
839 | ||
840 | /* Create and return call_site_chain for CALLER_PC and CALLEE_PC. All the | |
841 | assumed frames between them use GDBARCH. Use depth first search so we can | |
842 | keep single CHAIN of call_site's back to CALLER_PC. Function recursion | |
843 | would have needless GDB stack overhead. Caller is responsible for xfree of | |
844 | the returned result. Any unreliability results in thrown | |
845 | NO_ENTRY_VALUE_ERROR. */ | |
846 | ||
847 | static struct call_site_chain * | |
848 | call_site_find_chain_1 (struct gdbarch *gdbarch, CORE_ADDR caller_pc, | |
849 | CORE_ADDR callee_pc) | |
850 | { | |
c4be5165 | 851 | CORE_ADDR save_callee_pc = callee_pc; |
111c6489 JK |
852 | struct obstack addr_obstack; |
853 | struct cleanup *back_to_retval, *back_to_workdata; | |
854 | struct call_site_chain *retval = NULL; | |
855 | struct call_site *call_site; | |
856 | ||
857 | /* Mark CALL_SITEs so we do not visit the same ones twice. */ | |
858 | htab_t addr_hash; | |
859 | ||
860 | /* CHAIN contains only the intermediate CALL_SITEs. Neither CALLER_PC's | |
861 | call_site nor any possible call_site at CALLEE_PC's function is there. | |
862 | Any CALL_SITE in CHAIN will be iterated to its siblings - via | |
863 | TAIL_CALL_NEXT. This is inappropriate for CALLER_PC's call_site. */ | |
864 | VEC (call_sitep) *chain = NULL; | |
865 | ||
866 | /* We are not interested in the specific PC inside the callee function. */ | |
867 | callee_pc = get_pc_function_start (callee_pc); | |
868 | if (callee_pc == 0) | |
869 | throw_error (NO_ENTRY_VALUE_ERROR, _("Unable to find function for PC %s"), | |
c4be5165 | 870 | paddress (gdbarch, save_callee_pc)); |
111c6489 JK |
871 | |
872 | back_to_retval = make_cleanup (free_current_contents, &retval); | |
873 | ||
874 | obstack_init (&addr_obstack); | |
875 | back_to_workdata = make_cleanup_obstack_free (&addr_obstack); | |
876 | addr_hash = htab_create_alloc_ex (64, core_addr_hash, core_addr_eq, NULL, | |
877 | &addr_obstack, hashtab_obstack_allocate, | |
878 | NULL); | |
879 | make_cleanup_htab_delete (addr_hash); | |
880 | ||
881 | make_cleanup (VEC_cleanup (call_sitep), &chain); | |
882 | ||
883 | /* Do not push CALL_SITE to CHAIN. Push there only the first tail call site | |
884 | at the target's function. All the possible tail call sites in the | |
885 | target's function will get iterated as already pushed into CHAIN via their | |
886 | TAIL_CALL_NEXT. */ | |
887 | call_site = call_site_for_pc (gdbarch, caller_pc); | |
888 | ||
889 | while (call_site) | |
890 | { | |
891 | CORE_ADDR target_func_addr; | |
892 | struct call_site *target_call_site; | |
893 | ||
894 | /* CALLER_FRAME with registers is not available for tail-call jumped | |
895 | frames. */ | |
896 | target_func_addr = call_site_to_target_addr (gdbarch, call_site, NULL); | |
897 | ||
898 | if (target_func_addr == callee_pc) | |
899 | { | |
900 | chain_candidate (gdbarch, &retval, chain); | |
901 | if (retval == NULL) | |
902 | break; | |
903 | ||
904 | /* There is no way to reach CALLEE_PC again as we would prevent | |
905 | entering it twice as being already marked in ADDR_HASH. */ | |
906 | target_call_site = NULL; | |
907 | } | |
908 | else | |
909 | { | |
910 | struct symbol *target_func; | |
911 | ||
912 | target_func = func_addr_to_tail_call_list (gdbarch, target_func_addr); | |
913 | target_call_site = TYPE_TAIL_CALL_LIST (SYMBOL_TYPE (target_func)); | |
914 | } | |
915 | ||
916 | do | |
917 | { | |
918 | /* Attempt to visit TARGET_CALL_SITE. */ | |
919 | ||
920 | if (target_call_site) | |
921 | { | |
922 | void **slot; | |
923 | ||
924 | slot = htab_find_slot (addr_hash, &target_call_site->pc, INSERT); | |
925 | if (*slot == NULL) | |
926 | { | |
927 | /* Successfully entered TARGET_CALL_SITE. */ | |
928 | ||
929 | *slot = &target_call_site->pc; | |
930 | VEC_safe_push (call_sitep, chain, target_call_site); | |
931 | break; | |
932 | } | |
933 | } | |
934 | ||
935 | /* Backtrack (without revisiting the originating call_site). Try the | |
936 | callers's sibling; if there isn't any try the callers's callers's | |
937 | sibling etc. */ | |
938 | ||
939 | target_call_site = NULL; | |
940 | while (!VEC_empty (call_sitep, chain)) | |
941 | { | |
942 | call_site = VEC_pop (call_sitep, chain); | |
943 | ||
944 | gdb_assert (htab_find_slot (addr_hash, &call_site->pc, | |
945 | NO_INSERT) != NULL); | |
946 | htab_remove_elt (addr_hash, &call_site->pc); | |
947 | ||
948 | target_call_site = call_site->tail_call_next; | |
949 | if (target_call_site) | |
950 | break; | |
951 | } | |
952 | } | |
953 | while (target_call_site); | |
954 | ||
955 | if (VEC_empty (call_sitep, chain)) | |
956 | call_site = NULL; | |
957 | else | |
958 | call_site = VEC_last (call_sitep, chain); | |
959 | } | |
960 | ||
961 | if (retval == NULL) | |
962 | { | |
7cbd4a93 | 963 | struct bound_minimal_symbol msym_caller, msym_callee; |
111c6489 JK |
964 | |
965 | msym_caller = lookup_minimal_symbol_by_pc (caller_pc); | |
966 | msym_callee = lookup_minimal_symbol_by_pc (callee_pc); | |
967 | throw_error (NO_ENTRY_VALUE_ERROR, | |
968 | _("There are no unambiguously determinable intermediate " | |
969 | "callers or callees between caller function \"%s\" at %s " | |
970 | "and callee function \"%s\" at %s"), | |
7cbd4a93 | 971 | (msym_caller.minsym == NULL |
efd66ac6 | 972 | ? "???" : MSYMBOL_PRINT_NAME (msym_caller.minsym)), |
111c6489 | 973 | paddress (gdbarch, caller_pc), |
7cbd4a93 | 974 | (msym_callee.minsym == NULL |
efd66ac6 | 975 | ? "???" : MSYMBOL_PRINT_NAME (msym_callee.minsym)), |
111c6489 JK |
976 | paddress (gdbarch, callee_pc)); |
977 | } | |
978 | ||
979 | do_cleanups (back_to_workdata); | |
980 | discard_cleanups (back_to_retval); | |
981 | return retval; | |
982 | } | |
983 | ||
984 | /* Create and return call_site_chain for CALLER_PC and CALLEE_PC. All the | |
985 | assumed frames between them use GDBARCH. If valid call_site_chain cannot be | |
986 | constructed return NULL. Caller is responsible for xfree of the returned | |
987 | result. */ | |
988 | ||
989 | struct call_site_chain * | |
990 | call_site_find_chain (struct gdbarch *gdbarch, CORE_ADDR caller_pc, | |
991 | CORE_ADDR callee_pc) | |
992 | { | |
993 | volatile struct gdb_exception e; | |
994 | struct call_site_chain *retval = NULL; | |
995 | ||
996 | TRY_CATCH (e, RETURN_MASK_ERROR) | |
997 | { | |
998 | retval = call_site_find_chain_1 (gdbarch, caller_pc, callee_pc); | |
999 | } | |
1000 | if (e.reason < 0) | |
1001 | { | |
1002 | if (e.error == NO_ENTRY_VALUE_ERROR) | |
1003 | { | |
1004 | if (entry_values_debug) | |
1005 | exception_print (gdb_stdout, e); | |
1006 | ||
1007 | return NULL; | |
1008 | } | |
1009 | else | |
1010 | throw_exception (e); | |
1011 | } | |
1012 | return retval; | |
1013 | } | |
1014 | ||
24c5c679 JK |
1015 | /* Return 1 if KIND and KIND_U match PARAMETER. Return 0 otherwise. */ |
1016 | ||
1017 | static int | |
1018 | call_site_parameter_matches (struct call_site_parameter *parameter, | |
1019 | enum call_site_parameter_kind kind, | |
1020 | union call_site_parameter_u kind_u) | |
1021 | { | |
1022 | if (kind == parameter->kind) | |
1023 | switch (kind) | |
1024 | { | |
1025 | case CALL_SITE_PARAMETER_DWARF_REG: | |
1026 | return kind_u.dwarf_reg == parameter->u.dwarf_reg; | |
1027 | case CALL_SITE_PARAMETER_FB_OFFSET: | |
1028 | return kind_u.fb_offset == parameter->u.fb_offset; | |
1788b2d3 JK |
1029 | case CALL_SITE_PARAMETER_PARAM_OFFSET: |
1030 | return kind_u.param_offset.cu_off == parameter->u.param_offset.cu_off; | |
24c5c679 JK |
1031 | } |
1032 | return 0; | |
1033 | } | |
1034 | ||
1035 | /* Fetch call_site_parameter from caller matching KIND and KIND_U. | |
1036 | FRAME is for callee. | |
8e3b41a9 JK |
1037 | |
1038 | Function always returns non-NULL, it throws NO_ENTRY_VALUE_ERROR | |
1039 | otherwise. */ | |
1040 | ||
1041 | static struct call_site_parameter * | |
24c5c679 JK |
1042 | dwarf_expr_reg_to_entry_parameter (struct frame_info *frame, |
1043 | enum call_site_parameter_kind kind, | |
1044 | union call_site_parameter_u kind_u, | |
8e3b41a9 JK |
1045 | struct dwarf2_per_cu_data **per_cu_return) |
1046 | { | |
9e3a7d65 JK |
1047 | CORE_ADDR func_addr, caller_pc; |
1048 | struct gdbarch *gdbarch; | |
1049 | struct frame_info *caller_frame; | |
8e3b41a9 JK |
1050 | struct call_site *call_site; |
1051 | int iparams; | |
509f0fd9 JK |
1052 | /* Initialize it just to avoid a GCC false warning. */ |
1053 | struct call_site_parameter *parameter = NULL; | |
8e3b41a9 JK |
1054 | CORE_ADDR target_addr; |
1055 | ||
9e3a7d65 JK |
1056 | while (get_frame_type (frame) == INLINE_FRAME) |
1057 | { | |
1058 | frame = get_prev_frame (frame); | |
1059 | gdb_assert (frame != NULL); | |
1060 | } | |
1061 | ||
1062 | func_addr = get_frame_func (frame); | |
1063 | gdbarch = get_frame_arch (frame); | |
1064 | caller_frame = get_prev_frame (frame); | |
8e3b41a9 JK |
1065 | if (gdbarch != frame_unwind_arch (frame)) |
1066 | { | |
7cbd4a93 TT |
1067 | struct bound_minimal_symbol msym |
1068 | = lookup_minimal_symbol_by_pc (func_addr); | |
8e3b41a9 JK |
1069 | struct gdbarch *caller_gdbarch = frame_unwind_arch (frame); |
1070 | ||
1071 | throw_error (NO_ENTRY_VALUE_ERROR, | |
1072 | _("DW_OP_GNU_entry_value resolving callee gdbarch %s " | |
1073 | "(of %s (%s)) does not match caller gdbarch %s"), | |
1074 | gdbarch_bfd_arch_info (gdbarch)->printable_name, | |
1075 | paddress (gdbarch, func_addr), | |
7cbd4a93 | 1076 | (msym.minsym == NULL ? "???" |
efd66ac6 | 1077 | : MSYMBOL_PRINT_NAME (msym.minsym)), |
8e3b41a9 JK |
1078 | gdbarch_bfd_arch_info (caller_gdbarch)->printable_name); |
1079 | } | |
1080 | ||
1081 | if (caller_frame == NULL) | |
1082 | { | |
7cbd4a93 TT |
1083 | struct bound_minimal_symbol msym |
1084 | = lookup_minimal_symbol_by_pc (func_addr); | |
8e3b41a9 JK |
1085 | |
1086 | throw_error (NO_ENTRY_VALUE_ERROR, _("DW_OP_GNU_entry_value resolving " | |
1087 | "requires caller of %s (%s)"), | |
1088 | paddress (gdbarch, func_addr), | |
7cbd4a93 | 1089 | (msym.minsym == NULL ? "???" |
efd66ac6 | 1090 | : MSYMBOL_PRINT_NAME (msym.minsym))); |
8e3b41a9 JK |
1091 | } |
1092 | caller_pc = get_frame_pc (caller_frame); | |
1093 | call_site = call_site_for_pc (gdbarch, caller_pc); | |
1094 | ||
1095 | target_addr = call_site_to_target_addr (gdbarch, call_site, caller_frame); | |
1096 | if (target_addr != func_addr) | |
1097 | { | |
1098 | struct minimal_symbol *target_msym, *func_msym; | |
1099 | ||
7cbd4a93 TT |
1100 | target_msym = lookup_minimal_symbol_by_pc (target_addr).minsym; |
1101 | func_msym = lookup_minimal_symbol_by_pc (func_addr).minsym; | |
8e3b41a9 JK |
1102 | throw_error (NO_ENTRY_VALUE_ERROR, |
1103 | _("DW_OP_GNU_entry_value resolving expects callee %s at %s " | |
1104 | "but the called frame is for %s at %s"), | |
1105 | (target_msym == NULL ? "???" | |
efd66ac6 | 1106 | : MSYMBOL_PRINT_NAME (target_msym)), |
8e3b41a9 | 1107 | paddress (gdbarch, target_addr), |
efd66ac6 | 1108 | func_msym == NULL ? "???" : MSYMBOL_PRINT_NAME (func_msym), |
8e3b41a9 JK |
1109 | paddress (gdbarch, func_addr)); |
1110 | } | |
1111 | ||
2d6c5dc2 JK |
1112 | /* No entry value based parameters would be reliable if this function can |
1113 | call itself via tail calls. */ | |
1114 | func_verify_no_selftailcall (gdbarch, func_addr); | |
1115 | ||
8e3b41a9 JK |
1116 | for (iparams = 0; iparams < call_site->parameter_count; iparams++) |
1117 | { | |
1118 | parameter = &call_site->parameter[iparams]; | |
24c5c679 | 1119 | if (call_site_parameter_matches (parameter, kind, kind_u)) |
8e3b41a9 JK |
1120 | break; |
1121 | } | |
1122 | if (iparams == call_site->parameter_count) | |
1123 | { | |
7cbd4a93 TT |
1124 | struct minimal_symbol *msym |
1125 | = lookup_minimal_symbol_by_pc (caller_pc).minsym; | |
8e3b41a9 JK |
1126 | |
1127 | /* DW_TAG_GNU_call_site_parameter will be missing just if GCC could not | |
1128 | determine its value. */ | |
1129 | throw_error (NO_ENTRY_VALUE_ERROR, _("Cannot find matching parameter " | |
1130 | "at DW_TAG_GNU_call_site %s at %s"), | |
1131 | paddress (gdbarch, caller_pc), | |
efd66ac6 | 1132 | msym == NULL ? "???" : MSYMBOL_PRINT_NAME (msym)); |
8e3b41a9 JK |
1133 | } |
1134 | ||
1135 | *per_cu_return = call_site->per_cu; | |
1136 | return parameter; | |
1137 | } | |
1138 | ||
a471c594 JK |
1139 | /* Return value for PARAMETER matching DEREF_SIZE. If DEREF_SIZE is -1, return |
1140 | the normal DW_AT_GNU_call_site_value block. Otherwise return the | |
1141 | DW_AT_GNU_call_site_data_value (dereferenced) block. | |
e18b2753 JK |
1142 | |
1143 | TYPE and CALLER_FRAME specify how to evaluate the DWARF block into returned | |
1144 | struct value. | |
1145 | ||
1146 | Function always returns non-NULL, non-optimized out value. It throws | |
1147 | NO_ENTRY_VALUE_ERROR if it cannot resolve the value for any reason. */ | |
1148 | ||
1149 | static struct value * | |
1150 | dwarf_entry_parameter_to_value (struct call_site_parameter *parameter, | |
a471c594 | 1151 | CORE_ADDR deref_size, struct type *type, |
e18b2753 JK |
1152 | struct frame_info *caller_frame, |
1153 | struct dwarf2_per_cu_data *per_cu) | |
1154 | { | |
a471c594 | 1155 | const gdb_byte *data_src; |
e18b2753 | 1156 | gdb_byte *data; |
a471c594 JK |
1157 | size_t size; |
1158 | ||
1159 | data_src = deref_size == -1 ? parameter->value : parameter->data_value; | |
1160 | size = deref_size == -1 ? parameter->value_size : parameter->data_value_size; | |
1161 | ||
1162 | /* DEREF_SIZE size is not verified here. */ | |
1163 | if (data_src == NULL) | |
1164 | throw_error (NO_ENTRY_VALUE_ERROR, | |
1165 | _("Cannot resolve DW_AT_GNU_call_site_data_value")); | |
e18b2753 JK |
1166 | |
1167 | /* DW_AT_GNU_call_site_value is a DWARF expression, not a DWARF | |
1168 | location. Postprocessing of DWARF_VALUE_MEMORY would lose the type from | |
1169 | DWARF block. */ | |
a471c594 JK |
1170 | data = alloca (size + 1); |
1171 | memcpy (data, data_src, size); | |
1172 | data[size] = DW_OP_stack_value; | |
e18b2753 | 1173 | |
a471c594 | 1174 | return dwarf2_evaluate_loc_desc (type, caller_frame, data, size + 1, per_cu); |
e18b2753 JK |
1175 | } |
1176 | ||
24c5c679 JK |
1177 | /* Execute DWARF block of call_site_parameter which matches KIND and KIND_U. |
1178 | Choose DEREF_SIZE value of that parameter. Search caller of the CTX's | |
1179 | frame. CTX must be of dwarf_expr_ctx_funcs kind. | |
8e3b41a9 JK |
1180 | |
1181 | The CTX caller can be from a different CU - per_cu_dwarf_call implementation | |
1182 | can be more simple as it does not support cross-CU DWARF executions. */ | |
1183 | ||
1184 | static void | |
1185 | dwarf_expr_push_dwarf_reg_entry_value (struct dwarf_expr_context *ctx, | |
24c5c679 JK |
1186 | enum call_site_parameter_kind kind, |
1187 | union call_site_parameter_u kind_u, | |
a471c594 | 1188 | int deref_size) |
8e3b41a9 JK |
1189 | { |
1190 | struct dwarf_expr_baton *debaton; | |
1191 | struct frame_info *frame, *caller_frame; | |
1192 | struct dwarf2_per_cu_data *caller_per_cu; | |
1193 | struct dwarf_expr_baton baton_local; | |
1194 | struct dwarf_expr_context saved_ctx; | |
1195 | struct call_site_parameter *parameter; | |
1196 | const gdb_byte *data_src; | |
1197 | size_t size; | |
1198 | ||
1199 | gdb_assert (ctx->funcs == &dwarf_expr_ctx_funcs); | |
1200 | debaton = ctx->baton; | |
1201 | frame = debaton->frame; | |
1202 | caller_frame = get_prev_frame (frame); | |
1203 | ||
24c5c679 | 1204 | parameter = dwarf_expr_reg_to_entry_parameter (frame, kind, kind_u, |
8e3b41a9 | 1205 | &caller_per_cu); |
a471c594 JK |
1206 | data_src = deref_size == -1 ? parameter->value : parameter->data_value; |
1207 | size = deref_size == -1 ? parameter->value_size : parameter->data_value_size; | |
1208 | ||
1209 | /* DEREF_SIZE size is not verified here. */ | |
1210 | if (data_src == NULL) | |
1211 | throw_error (NO_ENTRY_VALUE_ERROR, | |
1212 | _("Cannot resolve DW_AT_GNU_call_site_data_value")); | |
8e3b41a9 JK |
1213 | |
1214 | baton_local.frame = caller_frame; | |
1215 | baton_local.per_cu = caller_per_cu; | |
1216 | ||
1217 | saved_ctx.gdbarch = ctx->gdbarch; | |
1218 | saved_ctx.addr_size = ctx->addr_size; | |
1219 | saved_ctx.offset = ctx->offset; | |
1220 | saved_ctx.baton = ctx->baton; | |
1221 | ctx->gdbarch = get_objfile_arch (dwarf2_per_cu_objfile (baton_local.per_cu)); | |
1222 | ctx->addr_size = dwarf2_per_cu_addr_size (baton_local.per_cu); | |
1223 | ctx->offset = dwarf2_per_cu_text_offset (baton_local.per_cu); | |
1224 | ctx->baton = &baton_local; | |
1225 | ||
1226 | dwarf_expr_eval (ctx, data_src, size); | |
1227 | ||
1228 | ctx->gdbarch = saved_ctx.gdbarch; | |
1229 | ctx->addr_size = saved_ctx.addr_size; | |
1230 | ctx->offset = saved_ctx.offset; | |
1231 | ctx->baton = saved_ctx.baton; | |
1232 | } | |
1233 | ||
3019eac3 DE |
1234 | /* Callback function for dwarf2_evaluate_loc_desc. |
1235 | Fetch the address indexed by DW_OP_GNU_addr_index. */ | |
1236 | ||
1237 | static CORE_ADDR | |
1238 | dwarf_expr_get_addr_index (void *baton, unsigned int index) | |
1239 | { | |
1240 | struct dwarf_expr_baton *debaton = (struct dwarf_expr_baton *) baton; | |
1241 | ||
1242 | return dwarf2_read_addr_index (debaton->per_cu, index); | |
1243 | } | |
1244 | ||
a471c594 JK |
1245 | /* VALUE must be of type lval_computed with entry_data_value_funcs. Perform |
1246 | the indirect method on it, that is use its stored target value, the sole | |
1247 | purpose of entry_data_value_funcs.. */ | |
1248 | ||
1249 | static struct value * | |
1250 | entry_data_value_coerce_ref (const struct value *value) | |
1251 | { | |
1252 | struct type *checked_type = check_typedef (value_type (value)); | |
1253 | struct value *target_val; | |
1254 | ||
1255 | if (TYPE_CODE (checked_type) != TYPE_CODE_REF) | |
1256 | return NULL; | |
1257 | ||
1258 | target_val = value_computed_closure (value); | |
1259 | value_incref (target_val); | |
1260 | return target_val; | |
1261 | } | |
1262 | ||
1263 | /* Implement copy_closure. */ | |
1264 | ||
1265 | static void * | |
1266 | entry_data_value_copy_closure (const struct value *v) | |
1267 | { | |
1268 | struct value *target_val = value_computed_closure (v); | |
1269 | ||
1270 | value_incref (target_val); | |
1271 | return target_val; | |
1272 | } | |
1273 | ||
1274 | /* Implement free_closure. */ | |
1275 | ||
1276 | static void | |
1277 | entry_data_value_free_closure (struct value *v) | |
1278 | { | |
1279 | struct value *target_val = value_computed_closure (v); | |
1280 | ||
1281 | value_free (target_val); | |
1282 | } | |
1283 | ||
1284 | /* Vector for methods for an entry value reference where the referenced value | |
1285 | is stored in the caller. On the first dereference use | |
1286 | DW_AT_GNU_call_site_data_value in the caller. */ | |
1287 | ||
1288 | static const struct lval_funcs entry_data_value_funcs = | |
1289 | { | |
1290 | NULL, /* read */ | |
1291 | NULL, /* write */ | |
1292 | NULL, /* check_validity */ | |
1293 | NULL, /* check_any_valid */ | |
1294 | NULL, /* indirect */ | |
1295 | entry_data_value_coerce_ref, | |
1296 | NULL, /* check_synthetic_pointer */ | |
1297 | entry_data_value_copy_closure, | |
1298 | entry_data_value_free_closure | |
1299 | }; | |
1300 | ||
24c5c679 JK |
1301 | /* Read parameter of TYPE at (callee) FRAME's function entry. KIND and KIND_U |
1302 | are used to match DW_AT_location at the caller's | |
1303 | DW_TAG_GNU_call_site_parameter. | |
e18b2753 JK |
1304 | |
1305 | Function always returns non-NULL value. It throws NO_ENTRY_VALUE_ERROR if it | |
1306 | cannot resolve the parameter for any reason. */ | |
1307 | ||
1308 | static struct value * | |
1309 | value_of_dwarf_reg_entry (struct type *type, struct frame_info *frame, | |
24c5c679 JK |
1310 | enum call_site_parameter_kind kind, |
1311 | union call_site_parameter_u kind_u) | |
e18b2753 | 1312 | { |
a471c594 JK |
1313 | struct type *checked_type = check_typedef (type); |
1314 | struct type *target_type = TYPE_TARGET_TYPE (checked_type); | |
e18b2753 | 1315 | struct frame_info *caller_frame = get_prev_frame (frame); |
a471c594 | 1316 | struct value *outer_val, *target_val, *val; |
e18b2753 JK |
1317 | struct call_site_parameter *parameter; |
1318 | struct dwarf2_per_cu_data *caller_per_cu; | |
a471c594 | 1319 | CORE_ADDR addr; |
e18b2753 | 1320 | |
24c5c679 | 1321 | parameter = dwarf_expr_reg_to_entry_parameter (frame, kind, kind_u, |
e18b2753 JK |
1322 | &caller_per_cu); |
1323 | ||
a471c594 JK |
1324 | outer_val = dwarf_entry_parameter_to_value (parameter, -1 /* deref_size */, |
1325 | type, caller_frame, | |
1326 | caller_per_cu); | |
1327 | ||
1328 | /* Check if DW_AT_GNU_call_site_data_value cannot be used. If it should be | |
1329 | used and it is not available do not fall back to OUTER_VAL - dereferencing | |
1330 | TYPE_CODE_REF with non-entry data value would give current value - not the | |
1331 | entry value. */ | |
1332 | ||
1333 | if (TYPE_CODE (checked_type) != TYPE_CODE_REF | |
1334 | || TYPE_TARGET_TYPE (checked_type) == NULL) | |
1335 | return outer_val; | |
1336 | ||
1337 | target_val = dwarf_entry_parameter_to_value (parameter, | |
1338 | TYPE_LENGTH (target_type), | |
1339 | target_type, caller_frame, | |
1340 | caller_per_cu); | |
1341 | ||
1342 | /* value_as_address dereferences TYPE_CODE_REF. */ | |
1343 | addr = extract_typed_address (value_contents (outer_val), checked_type); | |
1344 | ||
1345 | /* The target entry value has artificial address of the entry value | |
1346 | reference. */ | |
1347 | VALUE_LVAL (target_val) = lval_memory; | |
1348 | set_value_address (target_val, addr); | |
1349 | ||
1350 | release_value (target_val); | |
1351 | val = allocate_computed_value (type, &entry_data_value_funcs, | |
1352 | target_val /* closure */); | |
1353 | ||
1354 | /* Copy the referencing pointer to the new computed value. */ | |
1355 | memcpy (value_contents_raw (val), value_contents_raw (outer_val), | |
1356 | TYPE_LENGTH (checked_type)); | |
1357 | set_value_lazy (val, 0); | |
1358 | ||
1359 | return val; | |
e18b2753 JK |
1360 | } |
1361 | ||
1362 | /* Read parameter of TYPE at (callee) FRAME's function entry. DATA and | |
1363 | SIZE are DWARF block used to match DW_AT_location at the caller's | |
1364 | DW_TAG_GNU_call_site_parameter. | |
1365 | ||
1366 | Function always returns non-NULL value. It throws NO_ENTRY_VALUE_ERROR if it | |
1367 | cannot resolve the parameter for any reason. */ | |
1368 | ||
1369 | static struct value * | |
1370 | value_of_dwarf_block_entry (struct type *type, struct frame_info *frame, | |
1371 | const gdb_byte *block, size_t block_len) | |
1372 | { | |
24c5c679 | 1373 | union call_site_parameter_u kind_u; |
e18b2753 | 1374 | |
24c5c679 JK |
1375 | kind_u.dwarf_reg = dwarf_block_to_dwarf_reg (block, block + block_len); |
1376 | if (kind_u.dwarf_reg != -1) | |
1377 | return value_of_dwarf_reg_entry (type, frame, CALL_SITE_PARAMETER_DWARF_REG, | |
1378 | kind_u); | |
e18b2753 | 1379 | |
24c5c679 JK |
1380 | if (dwarf_block_to_fb_offset (block, block + block_len, &kind_u.fb_offset)) |
1381 | return value_of_dwarf_reg_entry (type, frame, CALL_SITE_PARAMETER_FB_OFFSET, | |
1382 | kind_u); | |
e18b2753 JK |
1383 | |
1384 | /* This can normally happen - throw NO_ENTRY_VALUE_ERROR to get the message | |
1385 | suppressed during normal operation. The expression can be arbitrary if | |
1386 | there is no caller-callee entry value binding expected. */ | |
1387 | throw_error (NO_ENTRY_VALUE_ERROR, | |
1388 | _("DWARF-2 expression error: DW_OP_GNU_entry_value is supported " | |
1389 | "only for single DW_OP_reg* or for DW_OP_fbreg(*)")); | |
1390 | } | |
1391 | ||
052b9502 NF |
1392 | struct piece_closure |
1393 | { | |
88bfdde4 TT |
1394 | /* Reference count. */ |
1395 | int refc; | |
1396 | ||
8cf6f0b1 TT |
1397 | /* The CU from which this closure's expression came. */ |
1398 | struct dwarf2_per_cu_data *per_cu; | |
1399 | ||
052b9502 NF |
1400 | /* The number of pieces used to describe this variable. */ |
1401 | int n_pieces; | |
1402 | ||
6063c216 UW |
1403 | /* The target address size, used only for DWARF_VALUE_STACK. */ |
1404 | int addr_size; | |
cec03d70 | 1405 | |
052b9502 NF |
1406 | /* The pieces themselves. */ |
1407 | struct dwarf_expr_piece *pieces; | |
1408 | }; | |
1409 | ||
1410 | /* Allocate a closure for a value formed from separately-described | |
1411 | PIECES. */ | |
1412 | ||
1413 | static struct piece_closure * | |
8cf6f0b1 TT |
1414 | allocate_piece_closure (struct dwarf2_per_cu_data *per_cu, |
1415 | int n_pieces, struct dwarf_expr_piece *pieces, | |
6063c216 | 1416 | int addr_size) |
052b9502 | 1417 | { |
41bf6aca | 1418 | struct piece_closure *c = XCNEW (struct piece_closure); |
8a9b8146 | 1419 | int i; |
052b9502 | 1420 | |
88bfdde4 | 1421 | c->refc = 1; |
8cf6f0b1 | 1422 | c->per_cu = per_cu; |
052b9502 | 1423 | c->n_pieces = n_pieces; |
6063c216 | 1424 | c->addr_size = addr_size; |
fc270c35 | 1425 | c->pieces = XCNEWVEC (struct dwarf_expr_piece, n_pieces); |
052b9502 NF |
1426 | |
1427 | memcpy (c->pieces, pieces, n_pieces * sizeof (struct dwarf_expr_piece)); | |
8a9b8146 TT |
1428 | for (i = 0; i < n_pieces; ++i) |
1429 | if (c->pieces[i].location == DWARF_VALUE_STACK) | |
1430 | value_incref (c->pieces[i].v.value); | |
052b9502 NF |
1431 | |
1432 | return c; | |
1433 | } | |
1434 | ||
d3b1e874 TT |
1435 | /* The lowest-level function to extract bits from a byte buffer. |
1436 | SOURCE is the buffer. It is updated if we read to the end of a | |
1437 | byte. | |
1438 | SOURCE_OFFSET_BITS is the offset of the first bit to read. It is | |
1439 | updated to reflect the number of bits actually read. | |
1440 | NBITS is the number of bits we want to read. It is updated to | |
1441 | reflect the number of bits actually read. This function may read | |
1442 | fewer bits. | |
1443 | BITS_BIG_ENDIAN is taken directly from gdbarch. | |
1444 | This function returns the extracted bits. */ | |
1445 | ||
1446 | static unsigned int | |
1447 | extract_bits_primitive (const gdb_byte **source, | |
1448 | unsigned int *source_offset_bits, | |
1449 | int *nbits, int bits_big_endian) | |
1450 | { | |
1451 | unsigned int avail, mask, datum; | |
1452 | ||
1453 | gdb_assert (*source_offset_bits < 8); | |
1454 | ||
1455 | avail = 8 - *source_offset_bits; | |
1456 | if (avail > *nbits) | |
1457 | avail = *nbits; | |
1458 | ||
1459 | mask = (1 << avail) - 1; | |
1460 | datum = **source; | |
1461 | if (bits_big_endian) | |
1462 | datum >>= 8 - (*source_offset_bits + *nbits); | |
1463 | else | |
1464 | datum >>= *source_offset_bits; | |
1465 | datum &= mask; | |
1466 | ||
1467 | *nbits -= avail; | |
1468 | *source_offset_bits += avail; | |
1469 | if (*source_offset_bits >= 8) | |
1470 | { | |
1471 | *source_offset_bits -= 8; | |
1472 | ++*source; | |
1473 | } | |
1474 | ||
1475 | return datum; | |
1476 | } | |
1477 | ||
1478 | /* Extract some bits from a source buffer and move forward in the | |
1479 | buffer. | |
1480 | ||
1481 | SOURCE is the source buffer. It is updated as bytes are read. | |
1482 | SOURCE_OFFSET_BITS is the offset into SOURCE. It is updated as | |
1483 | bits are read. | |
1484 | NBITS is the number of bits to read. | |
1485 | BITS_BIG_ENDIAN is taken directly from gdbarch. | |
1486 | ||
1487 | This function returns the bits that were read. */ | |
1488 | ||
1489 | static unsigned int | |
1490 | extract_bits (const gdb_byte **source, unsigned int *source_offset_bits, | |
1491 | int nbits, int bits_big_endian) | |
1492 | { | |
1493 | unsigned int datum; | |
1494 | ||
1495 | gdb_assert (nbits > 0 && nbits <= 8); | |
1496 | ||
1497 | datum = extract_bits_primitive (source, source_offset_bits, &nbits, | |
1498 | bits_big_endian); | |
1499 | if (nbits > 0) | |
1500 | { | |
1501 | unsigned int more; | |
1502 | ||
1503 | more = extract_bits_primitive (source, source_offset_bits, &nbits, | |
1504 | bits_big_endian); | |
1505 | if (bits_big_endian) | |
1506 | datum <<= nbits; | |
1507 | else | |
1508 | more <<= nbits; | |
1509 | datum |= more; | |
1510 | } | |
1511 | ||
1512 | return datum; | |
1513 | } | |
1514 | ||
1515 | /* Write some bits into a buffer and move forward in the buffer. | |
1516 | ||
1517 | DATUM is the bits to write. The low-order bits of DATUM are used. | |
1518 | DEST is the destination buffer. It is updated as bytes are | |
1519 | written. | |
1520 | DEST_OFFSET_BITS is the bit offset in DEST at which writing is | |
1521 | done. | |
1522 | NBITS is the number of valid bits in DATUM. | |
1523 | BITS_BIG_ENDIAN is taken directly from gdbarch. */ | |
1524 | ||
1525 | static void | |
1526 | insert_bits (unsigned int datum, | |
1527 | gdb_byte *dest, unsigned int dest_offset_bits, | |
1528 | int nbits, int bits_big_endian) | |
1529 | { | |
1530 | unsigned int mask; | |
1531 | ||
8c814cdd | 1532 | gdb_assert (dest_offset_bits + nbits <= 8); |
d3b1e874 TT |
1533 | |
1534 | mask = (1 << nbits) - 1; | |
1535 | if (bits_big_endian) | |
1536 | { | |
1537 | datum <<= 8 - (dest_offset_bits + nbits); | |
1538 | mask <<= 8 - (dest_offset_bits + nbits); | |
1539 | } | |
1540 | else | |
1541 | { | |
1542 | datum <<= dest_offset_bits; | |
1543 | mask <<= dest_offset_bits; | |
1544 | } | |
1545 | ||
1546 | gdb_assert ((datum & ~mask) == 0); | |
1547 | ||
1548 | *dest = (*dest & ~mask) | datum; | |
1549 | } | |
1550 | ||
1551 | /* Copy bits from a source to a destination. | |
1552 | ||
1553 | DEST is where the bits should be written. | |
1554 | DEST_OFFSET_BITS is the bit offset into DEST. | |
1555 | SOURCE is the source of bits. | |
1556 | SOURCE_OFFSET_BITS is the bit offset into SOURCE. | |
1557 | BIT_COUNT is the number of bits to copy. | |
1558 | BITS_BIG_ENDIAN is taken directly from gdbarch. */ | |
1559 | ||
1560 | static void | |
1561 | copy_bitwise (gdb_byte *dest, unsigned int dest_offset_bits, | |
1562 | const gdb_byte *source, unsigned int source_offset_bits, | |
1563 | unsigned int bit_count, | |
1564 | int bits_big_endian) | |
1565 | { | |
1566 | unsigned int dest_avail; | |
1567 | int datum; | |
1568 | ||
1569 | /* Reduce everything to byte-size pieces. */ | |
1570 | dest += dest_offset_bits / 8; | |
1571 | dest_offset_bits %= 8; | |
1572 | source += source_offset_bits / 8; | |
1573 | source_offset_bits %= 8; | |
1574 | ||
1575 | dest_avail = 8 - dest_offset_bits % 8; | |
1576 | ||
1577 | /* See if we can fill the first destination byte. */ | |
1578 | if (dest_avail < bit_count) | |
1579 | { | |
1580 | datum = extract_bits (&source, &source_offset_bits, dest_avail, | |
1581 | bits_big_endian); | |
1582 | insert_bits (datum, dest, dest_offset_bits, dest_avail, bits_big_endian); | |
1583 | ++dest; | |
1584 | dest_offset_bits = 0; | |
1585 | bit_count -= dest_avail; | |
1586 | } | |
1587 | ||
1588 | /* Now, either DEST_OFFSET_BITS is byte-aligned, or we have fewer | |
1589 | than 8 bits remaining. */ | |
1590 | gdb_assert (dest_offset_bits % 8 == 0 || bit_count < 8); | |
1591 | for (; bit_count >= 8; bit_count -= 8) | |
1592 | { | |
1593 | datum = extract_bits (&source, &source_offset_bits, 8, bits_big_endian); | |
1594 | *dest++ = (gdb_byte) datum; | |
1595 | } | |
1596 | ||
1597 | /* Finally, we may have a few leftover bits. */ | |
1598 | gdb_assert (bit_count <= 8 - dest_offset_bits % 8); | |
1599 | if (bit_count > 0) | |
1600 | { | |
1601 | datum = extract_bits (&source, &source_offset_bits, bit_count, | |
1602 | bits_big_endian); | |
1603 | insert_bits (datum, dest, dest_offset_bits, bit_count, bits_big_endian); | |
1604 | } | |
1605 | } | |
1606 | ||
052b9502 NF |
1607 | static void |
1608 | read_pieced_value (struct value *v) | |
1609 | { | |
1610 | int i; | |
1611 | long offset = 0; | |
d3b1e874 | 1612 | ULONGEST bits_to_skip; |
052b9502 | 1613 | gdb_byte *contents; |
3e43a32a MS |
1614 | struct piece_closure *c |
1615 | = (struct piece_closure *) value_computed_closure (v); | |
052b9502 | 1616 | struct frame_info *frame = frame_find_by_id (VALUE_FRAME_ID (v)); |
afd74c5f | 1617 | size_t type_len; |
d3b1e874 | 1618 | size_t buffer_size = 0; |
948f8e3d | 1619 | gdb_byte *buffer = NULL; |
d3b1e874 TT |
1620 | struct cleanup *cleanup; |
1621 | int bits_big_endian | |
1622 | = gdbarch_bits_big_endian (get_type_arch (value_type (v))); | |
afd74c5f TT |
1623 | |
1624 | if (value_type (v) != value_enclosing_type (v)) | |
1625 | internal_error (__FILE__, __LINE__, | |
1626 | _("Should not be able to create a lazy value with " | |
1627 | "an enclosing type")); | |
052b9502 | 1628 | |
d3b1e874 TT |
1629 | cleanup = make_cleanup (free_current_contents, &buffer); |
1630 | ||
052b9502 | 1631 | contents = value_contents_raw (v); |
d3b1e874 | 1632 | bits_to_skip = 8 * value_offset (v); |
0e03807e TT |
1633 | if (value_bitsize (v)) |
1634 | { | |
1635 | bits_to_skip += value_bitpos (v); | |
1636 | type_len = value_bitsize (v); | |
1637 | } | |
1638 | else | |
1639 | type_len = 8 * TYPE_LENGTH (value_type (v)); | |
d3b1e874 | 1640 | |
afd74c5f | 1641 | for (i = 0; i < c->n_pieces && offset < type_len; i++) |
052b9502 NF |
1642 | { |
1643 | struct dwarf_expr_piece *p = &c->pieces[i]; | |
d3b1e874 TT |
1644 | size_t this_size, this_size_bits; |
1645 | long dest_offset_bits, source_offset_bits, source_offset; | |
0d45f56e | 1646 | const gdb_byte *intermediate_buffer; |
d3b1e874 TT |
1647 | |
1648 | /* Compute size, source, and destination offsets for copying, in | |
1649 | bits. */ | |
1650 | this_size_bits = p->size; | |
1651 | if (bits_to_skip > 0 && bits_to_skip >= this_size_bits) | |
afd74c5f | 1652 | { |
d3b1e874 | 1653 | bits_to_skip -= this_size_bits; |
afd74c5f TT |
1654 | continue; |
1655 | } | |
d3b1e874 | 1656 | if (bits_to_skip > 0) |
afd74c5f | 1657 | { |
d3b1e874 TT |
1658 | dest_offset_bits = 0; |
1659 | source_offset_bits = bits_to_skip; | |
1660 | this_size_bits -= bits_to_skip; | |
1661 | bits_to_skip = 0; | |
afd74c5f TT |
1662 | } |
1663 | else | |
1664 | { | |
d3b1e874 TT |
1665 | dest_offset_bits = offset; |
1666 | source_offset_bits = 0; | |
afd74c5f | 1667 | } |
5bd1ef56 TT |
1668 | if (this_size_bits > type_len - offset) |
1669 | this_size_bits = type_len - offset; | |
9a619af0 | 1670 | |
d3b1e874 TT |
1671 | this_size = (this_size_bits + source_offset_bits % 8 + 7) / 8; |
1672 | source_offset = source_offset_bits / 8; | |
1673 | if (buffer_size < this_size) | |
1674 | { | |
1675 | buffer_size = this_size; | |
1676 | buffer = xrealloc (buffer, buffer_size); | |
1677 | } | |
1678 | intermediate_buffer = buffer; | |
1679 | ||
1680 | /* Copy from the source to DEST_BUFFER. */ | |
cec03d70 | 1681 | switch (p->location) |
052b9502 | 1682 | { |
cec03d70 TT |
1683 | case DWARF_VALUE_REGISTER: |
1684 | { | |
1685 | struct gdbarch *arch = get_frame_arch (frame); | |
8a9b8146 | 1686 | int gdb_regnum = gdbarch_dwarf2_reg_to_regnum (arch, p->v.regno); |
afd74c5f | 1687 | int reg_offset = source_offset; |
dcbf108f UW |
1688 | |
1689 | if (gdbarch_byte_order (arch) == BFD_ENDIAN_BIG | |
afd74c5f | 1690 | && this_size < register_size (arch, gdb_regnum)) |
d3b1e874 TT |
1691 | { |
1692 | /* Big-endian, and we want less than full size. */ | |
1693 | reg_offset = register_size (arch, gdb_regnum) - this_size; | |
1694 | /* We want the lower-order THIS_SIZE_BITS of the bytes | |
1695 | we extract from the register. */ | |
1696 | source_offset_bits += 8 * this_size - this_size_bits; | |
1697 | } | |
dcbf108f | 1698 | |
63b4f126 MGD |
1699 | if (gdb_regnum != -1) |
1700 | { | |
8dccd430 PA |
1701 | int optim, unavail; |
1702 | ||
1703 | if (!get_frame_register_bytes (frame, gdb_regnum, reg_offset, | |
1704 | this_size, buffer, | |
1705 | &optim, &unavail)) | |
1706 | { | |
1707 | /* Just so garbage doesn't ever shine through. */ | |
1708 | memset (buffer, 0, this_size); | |
1709 | ||
1710 | if (optim) | |
1711 | set_value_optimized_out (v, 1); | |
1712 | if (unavail) | |
bdf22206 | 1713 | mark_value_bits_unavailable (v, offset, this_size_bits); |
8dccd430 | 1714 | } |
63b4f126 MGD |
1715 | } |
1716 | else | |
1717 | { | |
1718 | error (_("Unable to access DWARF register number %s"), | |
8a9b8146 | 1719 | paddress (arch, p->v.regno)); |
63b4f126 | 1720 | } |
cec03d70 TT |
1721 | } |
1722 | break; | |
1723 | ||
1724 | case DWARF_VALUE_MEMORY: | |
e6ca34fc PA |
1725 | read_value_memory (v, offset, |
1726 | p->v.mem.in_stack_memory, | |
1727 | p->v.mem.addr + source_offset, | |
1728 | buffer, this_size); | |
cec03d70 TT |
1729 | break; |
1730 | ||
1731 | case DWARF_VALUE_STACK: | |
1732 | { | |
afd74c5f | 1733 | size_t n = this_size; |
9a619af0 | 1734 | |
afd74c5f TT |
1735 | if (n > c->addr_size - source_offset) |
1736 | n = (c->addr_size >= source_offset | |
1737 | ? c->addr_size - source_offset | |
1738 | : 0); | |
1739 | if (n == 0) | |
1740 | { | |
1741 | /* Nothing. */ | |
1742 | } | |
afd74c5f TT |
1743 | else |
1744 | { | |
8a9b8146 | 1745 | const gdb_byte *val_bytes = value_contents_all (p->v.value); |
afd74c5f | 1746 | |
8a9b8146 | 1747 | intermediate_buffer = val_bytes + source_offset; |
afd74c5f | 1748 | } |
cec03d70 TT |
1749 | } |
1750 | break; | |
1751 | ||
1752 | case DWARF_VALUE_LITERAL: | |
1753 | { | |
afd74c5f TT |
1754 | size_t n = this_size; |
1755 | ||
1756 | if (n > p->v.literal.length - source_offset) | |
1757 | n = (p->v.literal.length >= source_offset | |
1758 | ? p->v.literal.length - source_offset | |
1759 | : 0); | |
1760 | if (n != 0) | |
d3b1e874 | 1761 | intermediate_buffer = p->v.literal.data + source_offset; |
cec03d70 TT |
1762 | } |
1763 | break; | |
1764 | ||
8cf6f0b1 TT |
1765 | /* These bits show up as zeros -- but do not cause the value |
1766 | to be considered optimized-out. */ | |
1767 | case DWARF_VALUE_IMPLICIT_POINTER: | |
1768 | break; | |
1769 | ||
cb826367 | 1770 | case DWARF_VALUE_OPTIMIZED_OUT: |
0e03807e | 1771 | set_value_optimized_out (v, 1); |
cb826367 TT |
1772 | break; |
1773 | ||
cec03d70 TT |
1774 | default: |
1775 | internal_error (__FILE__, __LINE__, _("invalid location type")); | |
052b9502 | 1776 | } |
d3b1e874 | 1777 | |
8cf6f0b1 TT |
1778 | if (p->location != DWARF_VALUE_OPTIMIZED_OUT |
1779 | && p->location != DWARF_VALUE_IMPLICIT_POINTER) | |
d3b1e874 TT |
1780 | copy_bitwise (contents, dest_offset_bits, |
1781 | intermediate_buffer, source_offset_bits % 8, | |
1782 | this_size_bits, bits_big_endian); | |
1783 | ||
1784 | offset += this_size_bits; | |
052b9502 | 1785 | } |
d3b1e874 TT |
1786 | |
1787 | do_cleanups (cleanup); | |
052b9502 NF |
1788 | } |
1789 | ||
1790 | static void | |
1791 | write_pieced_value (struct value *to, struct value *from) | |
1792 | { | |
1793 | int i; | |
1794 | long offset = 0; | |
d3b1e874 | 1795 | ULONGEST bits_to_skip; |
afd74c5f | 1796 | const gdb_byte *contents; |
3e43a32a MS |
1797 | struct piece_closure *c |
1798 | = (struct piece_closure *) value_computed_closure (to); | |
052b9502 | 1799 | struct frame_info *frame = frame_find_by_id (VALUE_FRAME_ID (to)); |
afd74c5f | 1800 | size_t type_len; |
d3b1e874 | 1801 | size_t buffer_size = 0; |
948f8e3d | 1802 | gdb_byte *buffer = NULL; |
d3b1e874 TT |
1803 | struct cleanup *cleanup; |
1804 | int bits_big_endian | |
1805 | = gdbarch_bits_big_endian (get_type_arch (value_type (to))); | |
052b9502 NF |
1806 | |
1807 | if (frame == NULL) | |
1808 | { | |
1809 | set_value_optimized_out (to, 1); | |
1810 | return; | |
1811 | } | |
1812 | ||
d3b1e874 TT |
1813 | cleanup = make_cleanup (free_current_contents, &buffer); |
1814 | ||
afd74c5f | 1815 | contents = value_contents (from); |
d3b1e874 | 1816 | bits_to_skip = 8 * value_offset (to); |
0e03807e TT |
1817 | if (value_bitsize (to)) |
1818 | { | |
1819 | bits_to_skip += value_bitpos (to); | |
1820 | type_len = value_bitsize (to); | |
1821 | } | |
1822 | else | |
1823 | type_len = 8 * TYPE_LENGTH (value_type (to)); | |
1824 | ||
afd74c5f | 1825 | for (i = 0; i < c->n_pieces && offset < type_len; i++) |
052b9502 NF |
1826 | { |
1827 | struct dwarf_expr_piece *p = &c->pieces[i]; | |
d3b1e874 TT |
1828 | size_t this_size_bits, this_size; |
1829 | long dest_offset_bits, source_offset_bits, dest_offset, source_offset; | |
1830 | int need_bitwise; | |
1831 | const gdb_byte *source_buffer; | |
afd74c5f | 1832 | |
d3b1e874 TT |
1833 | this_size_bits = p->size; |
1834 | if (bits_to_skip > 0 && bits_to_skip >= this_size_bits) | |
afd74c5f | 1835 | { |
d3b1e874 | 1836 | bits_to_skip -= this_size_bits; |
afd74c5f TT |
1837 | continue; |
1838 | } | |
d3b1e874 TT |
1839 | if (this_size_bits > type_len - offset) |
1840 | this_size_bits = type_len - offset; | |
1841 | if (bits_to_skip > 0) | |
afd74c5f | 1842 | { |
d3b1e874 TT |
1843 | dest_offset_bits = bits_to_skip; |
1844 | source_offset_bits = 0; | |
1845 | this_size_bits -= bits_to_skip; | |
1846 | bits_to_skip = 0; | |
afd74c5f TT |
1847 | } |
1848 | else | |
1849 | { | |
d3b1e874 TT |
1850 | dest_offset_bits = 0; |
1851 | source_offset_bits = offset; | |
1852 | } | |
1853 | ||
1854 | this_size = (this_size_bits + source_offset_bits % 8 + 7) / 8; | |
1855 | source_offset = source_offset_bits / 8; | |
1856 | dest_offset = dest_offset_bits / 8; | |
1857 | if (dest_offset_bits % 8 == 0 && source_offset_bits % 8 == 0) | |
1858 | { | |
1859 | source_buffer = contents + source_offset; | |
1860 | need_bitwise = 0; | |
1861 | } | |
1862 | else | |
1863 | { | |
1864 | if (buffer_size < this_size) | |
1865 | { | |
1866 | buffer_size = this_size; | |
1867 | buffer = xrealloc (buffer, buffer_size); | |
1868 | } | |
1869 | source_buffer = buffer; | |
1870 | need_bitwise = 1; | |
afd74c5f | 1871 | } |
9a619af0 | 1872 | |
cec03d70 | 1873 | switch (p->location) |
052b9502 | 1874 | { |
cec03d70 TT |
1875 | case DWARF_VALUE_REGISTER: |
1876 | { | |
1877 | struct gdbarch *arch = get_frame_arch (frame); | |
8a9b8146 | 1878 | int gdb_regnum = gdbarch_dwarf2_reg_to_regnum (arch, p->v.regno); |
afd74c5f | 1879 | int reg_offset = dest_offset; |
dcbf108f UW |
1880 | |
1881 | if (gdbarch_byte_order (arch) == BFD_ENDIAN_BIG | |
afd74c5f | 1882 | && this_size <= register_size (arch, gdb_regnum)) |
dcbf108f | 1883 | /* Big-endian, and we want less than full size. */ |
afd74c5f | 1884 | reg_offset = register_size (arch, gdb_regnum) - this_size; |
dcbf108f | 1885 | |
63b4f126 MGD |
1886 | if (gdb_regnum != -1) |
1887 | { | |
d3b1e874 TT |
1888 | if (need_bitwise) |
1889 | { | |
8dccd430 PA |
1890 | int optim, unavail; |
1891 | ||
1892 | if (!get_frame_register_bytes (frame, gdb_regnum, reg_offset, | |
1893 | this_size, buffer, | |
1894 | &optim, &unavail)) | |
1895 | { | |
1896 | if (optim) | |
710409a2 PA |
1897 | throw_error (OPTIMIZED_OUT_ERROR, |
1898 | _("Can't do read-modify-write to " | |
1899 | "update bitfield; containing word " | |
1900 | "has been optimized out")); | |
8dccd430 PA |
1901 | if (unavail) |
1902 | throw_error (NOT_AVAILABLE_ERROR, | |
1903 | _("Can't do read-modify-write to update " | |
1904 | "bitfield; containing word " | |
1905 | "is unavailable")); | |
1906 | } | |
d3b1e874 TT |
1907 | copy_bitwise (buffer, dest_offset_bits, |
1908 | contents, source_offset_bits, | |
1909 | this_size_bits, | |
1910 | bits_big_endian); | |
1911 | } | |
1912 | ||
63b4f126 | 1913 | put_frame_register_bytes (frame, gdb_regnum, reg_offset, |
d3b1e874 | 1914 | this_size, source_buffer); |
63b4f126 MGD |
1915 | } |
1916 | else | |
1917 | { | |
1918 | error (_("Unable to write to DWARF register number %s"), | |
8a9b8146 | 1919 | paddress (arch, p->v.regno)); |
63b4f126 | 1920 | } |
cec03d70 TT |
1921 | } |
1922 | break; | |
1923 | case DWARF_VALUE_MEMORY: | |
d3b1e874 TT |
1924 | if (need_bitwise) |
1925 | { | |
1926 | /* Only the first and last bytes can possibly have any | |
1927 | bits reused. */ | |
f2c7657e UW |
1928 | read_memory (p->v.mem.addr + dest_offset, buffer, 1); |
1929 | read_memory (p->v.mem.addr + dest_offset + this_size - 1, | |
d3b1e874 TT |
1930 | buffer + this_size - 1, 1); |
1931 | copy_bitwise (buffer, dest_offset_bits, | |
1932 | contents, source_offset_bits, | |
1933 | this_size_bits, | |
1934 | bits_big_endian); | |
1935 | } | |
1936 | ||
f2c7657e | 1937 | write_memory (p->v.mem.addr + dest_offset, |
d3b1e874 | 1938 | source_buffer, this_size); |
cec03d70 TT |
1939 | break; |
1940 | default: | |
1941 | set_value_optimized_out (to, 1); | |
0e03807e | 1942 | break; |
052b9502 | 1943 | } |
d3b1e874 | 1944 | offset += this_size_bits; |
052b9502 | 1945 | } |
d3b1e874 | 1946 | |
d3b1e874 | 1947 | do_cleanups (cleanup); |
052b9502 NF |
1948 | } |
1949 | ||
8cf6f0b1 TT |
1950 | /* A helper function that checks bit validity in a pieced value. |
1951 | CHECK_FOR indicates the kind of validity checking. | |
1952 | DWARF_VALUE_MEMORY means to check whether any bit is valid. | |
1953 | DWARF_VALUE_OPTIMIZED_OUT means to check whether any bit is | |
1954 | optimized out. | |
1955 | DWARF_VALUE_IMPLICIT_POINTER means to check whether the bits are an | |
1956 | implicit pointer. */ | |
1957 | ||
0e03807e TT |
1958 | static int |
1959 | check_pieced_value_bits (const struct value *value, int bit_offset, | |
8cf6f0b1 TT |
1960 | int bit_length, |
1961 | enum dwarf_value_location check_for) | |
0e03807e TT |
1962 | { |
1963 | struct piece_closure *c | |
1964 | = (struct piece_closure *) value_computed_closure (value); | |
1965 | int i; | |
8cf6f0b1 TT |
1966 | int validity = (check_for == DWARF_VALUE_MEMORY |
1967 | || check_for == DWARF_VALUE_IMPLICIT_POINTER); | |
0e03807e TT |
1968 | |
1969 | bit_offset += 8 * value_offset (value); | |
1970 | if (value_bitsize (value)) | |
1971 | bit_offset += value_bitpos (value); | |
1972 | ||
1973 | for (i = 0; i < c->n_pieces && bit_length > 0; i++) | |
1974 | { | |
1975 | struct dwarf_expr_piece *p = &c->pieces[i]; | |
1976 | size_t this_size_bits = p->size; | |
1977 | ||
1978 | if (bit_offset > 0) | |
1979 | { | |
1980 | if (bit_offset >= this_size_bits) | |
1981 | { | |
1982 | bit_offset -= this_size_bits; | |
1983 | continue; | |
1984 | } | |
1985 | ||
1986 | bit_length -= this_size_bits - bit_offset; | |
1987 | bit_offset = 0; | |
1988 | } | |
1989 | else | |
1990 | bit_length -= this_size_bits; | |
1991 | ||
8cf6f0b1 TT |
1992 | if (check_for == DWARF_VALUE_IMPLICIT_POINTER) |
1993 | { | |
1994 | if (p->location != DWARF_VALUE_IMPLICIT_POINTER) | |
1995 | return 0; | |
1996 | } | |
1997 | else if (p->location == DWARF_VALUE_OPTIMIZED_OUT | |
1998 | || p->location == DWARF_VALUE_IMPLICIT_POINTER) | |
0e03807e TT |
1999 | { |
2000 | if (validity) | |
2001 | return 0; | |
2002 | } | |
2003 | else | |
2004 | { | |
2005 | if (!validity) | |
2006 | return 1; | |
2007 | } | |
2008 | } | |
2009 | ||
2010 | return validity; | |
2011 | } | |
2012 | ||
2013 | static int | |
2014 | check_pieced_value_validity (const struct value *value, int bit_offset, | |
2015 | int bit_length) | |
2016 | { | |
8cf6f0b1 TT |
2017 | return check_pieced_value_bits (value, bit_offset, bit_length, |
2018 | DWARF_VALUE_MEMORY); | |
0e03807e TT |
2019 | } |
2020 | ||
2021 | static int | |
2022 | check_pieced_value_invalid (const struct value *value) | |
2023 | { | |
2024 | return check_pieced_value_bits (value, 0, | |
8cf6f0b1 TT |
2025 | 8 * TYPE_LENGTH (value_type (value)), |
2026 | DWARF_VALUE_OPTIMIZED_OUT); | |
2027 | } | |
2028 | ||
2029 | /* An implementation of an lval_funcs method to see whether a value is | |
2030 | a synthetic pointer. */ | |
2031 | ||
2032 | static int | |
2033 | check_pieced_synthetic_pointer (const struct value *value, int bit_offset, | |
2034 | int bit_length) | |
2035 | { | |
2036 | return check_pieced_value_bits (value, bit_offset, bit_length, | |
2037 | DWARF_VALUE_IMPLICIT_POINTER); | |
2038 | } | |
2039 | ||
2040 | /* A wrapper function for get_frame_address_in_block. */ | |
2041 | ||
2042 | static CORE_ADDR | |
2043 | get_frame_address_in_block_wrapper (void *baton) | |
2044 | { | |
2045 | return get_frame_address_in_block (baton); | |
2046 | } | |
2047 | ||
2048 | /* An implementation of an lval_funcs method to indirect through a | |
2049 | pointer. This handles the synthetic pointer case when needed. */ | |
2050 | ||
2051 | static struct value * | |
2052 | indirect_pieced_value (struct value *value) | |
2053 | { | |
2054 | struct piece_closure *c | |
2055 | = (struct piece_closure *) value_computed_closure (value); | |
2056 | struct type *type; | |
2057 | struct frame_info *frame; | |
2058 | struct dwarf2_locexpr_baton baton; | |
2059 | int i, bit_offset, bit_length; | |
2060 | struct dwarf_expr_piece *piece = NULL; | |
8cf6f0b1 TT |
2061 | LONGEST byte_offset; |
2062 | ||
0e37a63c | 2063 | type = check_typedef (value_type (value)); |
8cf6f0b1 TT |
2064 | if (TYPE_CODE (type) != TYPE_CODE_PTR) |
2065 | return NULL; | |
2066 | ||
2067 | bit_length = 8 * TYPE_LENGTH (type); | |
2068 | bit_offset = 8 * value_offset (value); | |
2069 | if (value_bitsize (value)) | |
2070 | bit_offset += value_bitpos (value); | |
2071 | ||
2072 | for (i = 0; i < c->n_pieces && bit_length > 0; i++) | |
2073 | { | |
2074 | struct dwarf_expr_piece *p = &c->pieces[i]; | |
2075 | size_t this_size_bits = p->size; | |
2076 | ||
2077 | if (bit_offset > 0) | |
2078 | { | |
2079 | if (bit_offset >= this_size_bits) | |
2080 | { | |
2081 | bit_offset -= this_size_bits; | |
2082 | continue; | |
2083 | } | |
2084 | ||
2085 | bit_length -= this_size_bits - bit_offset; | |
2086 | bit_offset = 0; | |
2087 | } | |
2088 | else | |
2089 | bit_length -= this_size_bits; | |
2090 | ||
2091 | if (p->location != DWARF_VALUE_IMPLICIT_POINTER) | |
2092 | return NULL; | |
2093 | ||
2094 | if (bit_length != 0) | |
2095 | error (_("Invalid use of DW_OP_GNU_implicit_pointer")); | |
2096 | ||
2097 | piece = p; | |
2098 | break; | |
2099 | } | |
2100 | ||
2101 | frame = get_selected_frame (_("No frame selected.")); | |
543305c9 | 2102 | |
5bd1ef56 TT |
2103 | /* This is an offset requested by GDB, such as value subscripts. |
2104 | However, due to how synthetic pointers are implemented, this is | |
2105 | always presented to us as a pointer type. This means we have to | |
2106 | sign-extend it manually as appropriate. */ | |
8cf6f0b1 | 2107 | byte_offset = value_as_address (value); |
5bd1ef56 TT |
2108 | if (TYPE_LENGTH (value_type (value)) < sizeof (LONGEST)) |
2109 | byte_offset = gdb_sign_extend (byte_offset, | |
2110 | 8 * TYPE_LENGTH (value_type (value))); | |
2111 | byte_offset += piece->v.ptr.offset; | |
8cf6f0b1 | 2112 | |
e0e40094 | 2113 | gdb_assert (piece); |
8b9737bf TT |
2114 | baton |
2115 | = dwarf2_fetch_die_loc_sect_off (piece->v.ptr.die, c->per_cu, | |
2116 | get_frame_address_in_block_wrapper, | |
2117 | frame); | |
8cf6f0b1 | 2118 | |
b6807d98 TT |
2119 | if (baton.data != NULL) |
2120 | return dwarf2_evaluate_loc_desc_full (TYPE_TARGET_TYPE (type), frame, | |
2121 | baton.data, baton.size, baton.per_cu, | |
5bd1ef56 | 2122 | byte_offset); |
b6807d98 TT |
2123 | |
2124 | { | |
2125 | struct obstack temp_obstack; | |
2126 | struct cleanup *cleanup; | |
2127 | const gdb_byte *bytes; | |
2128 | LONGEST len; | |
2129 | struct value *result; | |
2130 | ||
2131 | obstack_init (&temp_obstack); | |
2132 | cleanup = make_cleanup_obstack_free (&temp_obstack); | |
2133 | ||
2134 | bytes = dwarf2_fetch_constant_bytes (piece->v.ptr.die, c->per_cu, | |
2135 | &temp_obstack, &len); | |
2136 | if (bytes == NULL) | |
2137 | result = allocate_optimized_out_value (TYPE_TARGET_TYPE (type)); | |
2138 | else | |
2139 | { | |
2140 | if (byte_offset < 0 | |
2141 | || byte_offset + TYPE_LENGTH (TYPE_TARGET_TYPE (type)) > len) | |
2142 | invalid_synthetic_pointer (); | |
2143 | bytes += byte_offset; | |
2144 | result = value_from_contents (TYPE_TARGET_TYPE (type), bytes); | |
2145 | } | |
2146 | ||
2147 | do_cleanups (cleanup); | |
2148 | return result; | |
2149 | } | |
0e03807e TT |
2150 | } |
2151 | ||
052b9502 | 2152 | static void * |
0e03807e | 2153 | copy_pieced_value_closure (const struct value *v) |
052b9502 | 2154 | { |
3e43a32a MS |
2155 | struct piece_closure *c |
2156 | = (struct piece_closure *) value_computed_closure (v); | |
052b9502 | 2157 | |
88bfdde4 TT |
2158 | ++c->refc; |
2159 | return c; | |
052b9502 NF |
2160 | } |
2161 | ||
2162 | static void | |
2163 | free_pieced_value_closure (struct value *v) | |
2164 | { | |
3e43a32a MS |
2165 | struct piece_closure *c |
2166 | = (struct piece_closure *) value_computed_closure (v); | |
052b9502 | 2167 | |
88bfdde4 TT |
2168 | --c->refc; |
2169 | if (c->refc == 0) | |
2170 | { | |
8a9b8146 TT |
2171 | int i; |
2172 | ||
2173 | for (i = 0; i < c->n_pieces; ++i) | |
2174 | if (c->pieces[i].location == DWARF_VALUE_STACK) | |
2175 | value_free (c->pieces[i].v.value); | |
2176 | ||
88bfdde4 TT |
2177 | xfree (c->pieces); |
2178 | xfree (c); | |
2179 | } | |
052b9502 NF |
2180 | } |
2181 | ||
2182 | /* Functions for accessing a variable described by DW_OP_piece. */ | |
c8f2448a | 2183 | static const struct lval_funcs pieced_value_funcs = { |
052b9502 NF |
2184 | read_pieced_value, |
2185 | write_pieced_value, | |
0e03807e TT |
2186 | check_pieced_value_validity, |
2187 | check_pieced_value_invalid, | |
8cf6f0b1 | 2188 | indirect_pieced_value, |
a471c594 | 2189 | NULL, /* coerce_ref */ |
8cf6f0b1 | 2190 | check_pieced_synthetic_pointer, |
052b9502 NF |
2191 | copy_pieced_value_closure, |
2192 | free_pieced_value_closure | |
2193 | }; | |
2194 | ||
9e8b7a03 JK |
2195 | /* Virtual method table for dwarf2_evaluate_loc_desc_full below. */ |
2196 | ||
2197 | static const struct dwarf_expr_context_funcs dwarf_expr_ctx_funcs = | |
2198 | { | |
b1370418 | 2199 | dwarf_expr_read_addr_from_reg, |
0acf8b65 | 2200 | dwarf_expr_get_reg_value, |
9e8b7a03 JK |
2201 | dwarf_expr_read_mem, |
2202 | dwarf_expr_frame_base, | |
2203 | dwarf_expr_frame_cfa, | |
2204 | dwarf_expr_frame_pc, | |
2205 | dwarf_expr_tls_address, | |
2206 | dwarf_expr_dwarf_call, | |
8e3b41a9 | 2207 | dwarf_expr_get_base_type, |
3019eac3 DE |
2208 | dwarf_expr_push_dwarf_reg_entry_value, |
2209 | dwarf_expr_get_addr_index | |
9e8b7a03 JK |
2210 | }; |
2211 | ||
4c2df51b | 2212 | /* Evaluate a location description, starting at DATA and with length |
8cf6f0b1 TT |
2213 | SIZE, to find the current location of variable of TYPE in the |
2214 | context of FRAME. BYTE_OFFSET is applied after the contents are | |
2215 | computed. */ | |
a2d33775 | 2216 | |
8cf6f0b1 TT |
2217 | static struct value * |
2218 | dwarf2_evaluate_loc_desc_full (struct type *type, struct frame_info *frame, | |
56eb65bd | 2219 | const gdb_byte *data, size_t size, |
8cf6f0b1 TT |
2220 | struct dwarf2_per_cu_data *per_cu, |
2221 | LONGEST byte_offset) | |
4c2df51b | 2222 | { |
4c2df51b DJ |
2223 | struct value *retval; |
2224 | struct dwarf_expr_baton baton; | |
2225 | struct dwarf_expr_context *ctx; | |
72fc29ff | 2226 | struct cleanup *old_chain, *value_chain; |
ac56253d | 2227 | struct objfile *objfile = dwarf2_per_cu_objfile (per_cu); |
79e1a869 | 2228 | volatile struct gdb_exception ex; |
4c2df51b | 2229 | |
8cf6f0b1 TT |
2230 | if (byte_offset < 0) |
2231 | invalid_synthetic_pointer (); | |
2232 | ||
0d53c4c4 | 2233 | if (size == 0) |
a7035dbb | 2234 | return allocate_optimized_out_value (type); |
0d53c4c4 | 2235 | |
4c2df51b | 2236 | baton.frame = frame; |
17ea53c3 | 2237 | baton.per_cu = per_cu; |
4c2df51b DJ |
2238 | |
2239 | ctx = new_dwarf_expr_context (); | |
4a227398 | 2240 | old_chain = make_cleanup_free_dwarf_expr_context (ctx); |
72fc29ff | 2241 | value_chain = make_cleanup_value_free_to_mark (value_mark ()); |
4a227398 | 2242 | |
ac56253d | 2243 | ctx->gdbarch = get_objfile_arch (objfile); |
ae0d2f24 | 2244 | ctx->addr_size = dwarf2_per_cu_addr_size (per_cu); |
181cebd4 | 2245 | ctx->ref_addr_size = dwarf2_per_cu_ref_addr_size (per_cu); |
9aa1f1e3 | 2246 | ctx->offset = dwarf2_per_cu_text_offset (per_cu); |
4c2df51b | 2247 | ctx->baton = &baton; |
9e8b7a03 | 2248 | ctx->funcs = &dwarf_expr_ctx_funcs; |
4c2df51b | 2249 | |
79e1a869 PA |
2250 | TRY_CATCH (ex, RETURN_MASK_ERROR) |
2251 | { | |
2252 | dwarf_expr_eval (ctx, data, size); | |
2253 | } | |
2254 | if (ex.reason < 0) | |
2255 | { | |
2256 | if (ex.error == NOT_AVAILABLE_ERROR) | |
2257 | { | |
72fc29ff | 2258 | do_cleanups (old_chain); |
79e1a869 PA |
2259 | retval = allocate_value (type); |
2260 | mark_value_bytes_unavailable (retval, 0, TYPE_LENGTH (type)); | |
2261 | return retval; | |
2262 | } | |
8e3b41a9 JK |
2263 | else if (ex.error == NO_ENTRY_VALUE_ERROR) |
2264 | { | |
2265 | if (entry_values_debug) | |
2266 | exception_print (gdb_stdout, ex); | |
2267 | do_cleanups (old_chain); | |
2268 | return allocate_optimized_out_value (type); | |
2269 | } | |
79e1a869 PA |
2270 | else |
2271 | throw_exception (ex); | |
2272 | } | |
2273 | ||
87808bd6 JB |
2274 | if (ctx->num_pieces > 0) |
2275 | { | |
052b9502 NF |
2276 | struct piece_closure *c; |
2277 | struct frame_id frame_id = get_frame_id (frame); | |
8cf6f0b1 TT |
2278 | ULONGEST bit_size = 0; |
2279 | int i; | |
052b9502 | 2280 | |
8cf6f0b1 TT |
2281 | for (i = 0; i < ctx->num_pieces; ++i) |
2282 | bit_size += ctx->pieces[i].size; | |
2283 | if (8 * (byte_offset + TYPE_LENGTH (type)) > bit_size) | |
2284 | invalid_synthetic_pointer (); | |
2285 | ||
2286 | c = allocate_piece_closure (per_cu, ctx->num_pieces, ctx->pieces, | |
6063c216 | 2287 | ctx->addr_size); |
72fc29ff TT |
2288 | /* We must clean up the value chain after creating the piece |
2289 | closure but before allocating the result. */ | |
2290 | do_cleanups (value_chain); | |
a2d33775 | 2291 | retval = allocate_computed_value (type, &pieced_value_funcs, c); |
052b9502 | 2292 | VALUE_FRAME_ID (retval) = frame_id; |
8cf6f0b1 | 2293 | set_value_offset (retval, byte_offset); |
87808bd6 | 2294 | } |
4c2df51b DJ |
2295 | else |
2296 | { | |
cec03d70 TT |
2297 | switch (ctx->location) |
2298 | { | |
2299 | case DWARF_VALUE_REGISTER: | |
2300 | { | |
2301 | struct gdbarch *arch = get_frame_arch (frame); | |
7c33b57c PA |
2302 | int dwarf_regnum |
2303 | = longest_to_int (value_as_long (dwarf_expr_fetch (ctx, 0))); | |
cec03d70 | 2304 | int gdb_regnum = gdbarch_dwarf2_reg_to_regnum (arch, dwarf_regnum); |
9a619af0 | 2305 | |
8cf6f0b1 TT |
2306 | if (byte_offset != 0) |
2307 | error (_("cannot use offset on synthetic pointer to register")); | |
72fc29ff | 2308 | do_cleanups (value_chain); |
901461f8 | 2309 | if (gdb_regnum == -1) |
7c33b57c PA |
2310 | error (_("Unable to access DWARF register number %d"), |
2311 | dwarf_regnum); | |
901461f8 PA |
2312 | retval = value_from_register (type, gdb_regnum, frame); |
2313 | if (value_optimized_out (retval)) | |
2314 | { | |
2315 | /* This means the register has undefined value / was | |
2316 | not saved. As we're computing the location of some | |
2317 | variable etc. in the program, not a value for | |
2318 | inspecting a register ($pc, $sp, etc.), return a | |
2319 | generic optimized out value instead, so that we show | |
2320 | <optimized out> instead of <not saved>. */ | |
2321 | do_cleanups (value_chain); | |
2322 | retval = allocate_optimized_out_value (type); | |
2323 | } | |
cec03d70 TT |
2324 | } |
2325 | break; | |
2326 | ||
2327 | case DWARF_VALUE_MEMORY: | |
2328 | { | |
f2c7657e | 2329 | CORE_ADDR address = dwarf_expr_fetch_address (ctx, 0); |
44353522 | 2330 | int in_stack_memory = dwarf_expr_fetch_in_stack_memory (ctx, 0); |
cec03d70 | 2331 | |
72fc29ff | 2332 | do_cleanups (value_chain); |
08039c9e | 2333 | retval = value_at_lazy (type, address + byte_offset); |
44353522 DE |
2334 | if (in_stack_memory) |
2335 | set_value_stack (retval, 1); | |
cec03d70 TT |
2336 | } |
2337 | break; | |
2338 | ||
2339 | case DWARF_VALUE_STACK: | |
2340 | { | |
8a9b8146 TT |
2341 | struct value *value = dwarf_expr_fetch (ctx, 0); |
2342 | gdb_byte *contents; | |
2343 | const gdb_byte *val_bytes; | |
2344 | size_t n = TYPE_LENGTH (value_type (value)); | |
cec03d70 | 2345 | |
8cf6f0b1 TT |
2346 | if (byte_offset + TYPE_LENGTH (type) > n) |
2347 | invalid_synthetic_pointer (); | |
2348 | ||
8a9b8146 TT |
2349 | val_bytes = value_contents_all (value); |
2350 | val_bytes += byte_offset; | |
8cf6f0b1 TT |
2351 | n -= byte_offset; |
2352 | ||
72fc29ff TT |
2353 | /* Preserve VALUE because we are going to free values back |
2354 | to the mark, but we still need the value contents | |
2355 | below. */ | |
2356 | value_incref (value); | |
2357 | do_cleanups (value_chain); | |
2358 | make_cleanup_value_free (value); | |
2359 | ||
a2d33775 | 2360 | retval = allocate_value (type); |
cec03d70 | 2361 | contents = value_contents_raw (retval); |
a2d33775 | 2362 | if (n > TYPE_LENGTH (type)) |
b6cede78 JK |
2363 | { |
2364 | struct gdbarch *objfile_gdbarch = get_objfile_arch (objfile); | |
2365 | ||
2366 | if (gdbarch_byte_order (objfile_gdbarch) == BFD_ENDIAN_BIG) | |
2367 | val_bytes += n - TYPE_LENGTH (type); | |
2368 | n = TYPE_LENGTH (type); | |
2369 | } | |
8a9b8146 | 2370 | memcpy (contents, val_bytes, n); |
cec03d70 TT |
2371 | } |
2372 | break; | |
2373 | ||
2374 | case DWARF_VALUE_LITERAL: | |
2375 | { | |
2376 | bfd_byte *contents; | |
8c814cdd | 2377 | const bfd_byte *ldata; |
cec03d70 TT |
2378 | size_t n = ctx->len; |
2379 | ||
8cf6f0b1 TT |
2380 | if (byte_offset + TYPE_LENGTH (type) > n) |
2381 | invalid_synthetic_pointer (); | |
2382 | ||
72fc29ff | 2383 | do_cleanups (value_chain); |
a2d33775 | 2384 | retval = allocate_value (type); |
cec03d70 | 2385 | contents = value_contents_raw (retval); |
8cf6f0b1 | 2386 | |
8c814cdd | 2387 | ldata = ctx->data + byte_offset; |
8cf6f0b1 TT |
2388 | n -= byte_offset; |
2389 | ||
a2d33775 | 2390 | if (n > TYPE_LENGTH (type)) |
b6cede78 JK |
2391 | { |
2392 | struct gdbarch *objfile_gdbarch = get_objfile_arch (objfile); | |
2393 | ||
2394 | if (gdbarch_byte_order (objfile_gdbarch) == BFD_ENDIAN_BIG) | |
2395 | ldata += n - TYPE_LENGTH (type); | |
2396 | n = TYPE_LENGTH (type); | |
2397 | } | |
8c814cdd | 2398 | memcpy (contents, ldata, n); |
cec03d70 TT |
2399 | } |
2400 | break; | |
2401 | ||
dd90784c | 2402 | case DWARF_VALUE_OPTIMIZED_OUT: |
72fc29ff | 2403 | do_cleanups (value_chain); |
a7035dbb | 2404 | retval = allocate_optimized_out_value (type); |
dd90784c JK |
2405 | break; |
2406 | ||
8cf6f0b1 TT |
2407 | /* DWARF_VALUE_IMPLICIT_POINTER was converted to a pieced |
2408 | operation by execute_stack_op. */ | |
2409 | case DWARF_VALUE_IMPLICIT_POINTER: | |
cb826367 TT |
2410 | /* DWARF_VALUE_OPTIMIZED_OUT can't occur in this context -- |
2411 | it can only be encountered when making a piece. */ | |
cec03d70 TT |
2412 | default: |
2413 | internal_error (__FILE__, __LINE__, _("invalid location type")); | |
2414 | } | |
4c2df51b DJ |
2415 | } |
2416 | ||
42be36b3 CT |
2417 | set_value_initialized (retval, ctx->initialized); |
2418 | ||
4a227398 | 2419 | do_cleanups (old_chain); |
4c2df51b DJ |
2420 | |
2421 | return retval; | |
2422 | } | |
8cf6f0b1 TT |
2423 | |
2424 | /* The exported interface to dwarf2_evaluate_loc_desc_full; it always | |
2425 | passes 0 as the byte_offset. */ | |
2426 | ||
2427 | struct value * | |
2428 | dwarf2_evaluate_loc_desc (struct type *type, struct frame_info *frame, | |
56eb65bd | 2429 | const gdb_byte *data, size_t size, |
8cf6f0b1 TT |
2430 | struct dwarf2_per_cu_data *per_cu) |
2431 | { | |
2432 | return dwarf2_evaluate_loc_desc_full (type, frame, data, size, per_cu, 0); | |
2433 | } | |
2434 | ||
4c2df51b DJ |
2435 | \f |
2436 | /* Helper functions and baton for dwarf2_loc_desc_needs_frame. */ | |
2437 | ||
2438 | struct needs_frame_baton | |
2439 | { | |
2440 | int needs_frame; | |
17ea53c3 | 2441 | struct dwarf2_per_cu_data *per_cu; |
4c2df51b DJ |
2442 | }; |
2443 | ||
2444 | /* Reads from registers do require a frame. */ | |
2445 | static CORE_ADDR | |
b1370418 | 2446 | needs_frame_read_addr_from_reg (void *baton, int regnum) |
4c2df51b DJ |
2447 | { |
2448 | struct needs_frame_baton *nf_baton = baton; | |
9a619af0 | 2449 | |
4c2df51b DJ |
2450 | nf_baton->needs_frame = 1; |
2451 | return 1; | |
2452 | } | |
2453 | ||
0acf8b65 JB |
2454 | /* struct dwarf_expr_context_funcs' "get_reg_value" callback: |
2455 | Reads from registers do require a frame. */ | |
2456 | ||
2457 | static struct value * | |
2458 | needs_frame_get_reg_value (void *baton, struct type *type, int regnum) | |
2459 | { | |
2460 | struct needs_frame_baton *nf_baton = baton; | |
2461 | ||
2462 | nf_baton->needs_frame = 1; | |
2463 | return value_zero (type, not_lval); | |
2464 | } | |
2465 | ||
4c2df51b DJ |
2466 | /* Reads from memory do not require a frame. */ |
2467 | static void | |
852483bc | 2468 | needs_frame_read_mem (void *baton, gdb_byte *buf, CORE_ADDR addr, size_t len) |
4c2df51b DJ |
2469 | { |
2470 | memset (buf, 0, len); | |
2471 | } | |
2472 | ||
2473 | /* Frame-relative accesses do require a frame. */ | |
2474 | static void | |
0d45f56e | 2475 | needs_frame_frame_base (void *baton, const gdb_byte **start, size_t * length) |
4c2df51b | 2476 | { |
852483bc | 2477 | static gdb_byte lit0 = DW_OP_lit0; |
4c2df51b DJ |
2478 | struct needs_frame_baton *nf_baton = baton; |
2479 | ||
2480 | *start = &lit0; | |
2481 | *length = 1; | |
2482 | ||
2483 | nf_baton->needs_frame = 1; | |
2484 | } | |
2485 | ||
e7802207 TT |
2486 | /* CFA accesses require a frame. */ |
2487 | ||
2488 | static CORE_ADDR | |
2489 | needs_frame_frame_cfa (void *baton) | |
2490 | { | |
2491 | struct needs_frame_baton *nf_baton = baton; | |
9a619af0 | 2492 | |
e7802207 TT |
2493 | nf_baton->needs_frame = 1; |
2494 | return 1; | |
2495 | } | |
2496 | ||
4c2df51b DJ |
2497 | /* Thread-local accesses do require a frame. */ |
2498 | static CORE_ADDR | |
2499 | needs_frame_tls_address (void *baton, CORE_ADDR offset) | |
2500 | { | |
2501 | struct needs_frame_baton *nf_baton = baton; | |
9a619af0 | 2502 | |
4c2df51b DJ |
2503 | nf_baton->needs_frame = 1; |
2504 | return 1; | |
2505 | } | |
2506 | ||
5c631832 JK |
2507 | /* Helper interface of per_cu_dwarf_call for dwarf2_loc_desc_needs_frame. */ |
2508 | ||
2509 | static void | |
b64f50a1 | 2510 | needs_frame_dwarf_call (struct dwarf_expr_context *ctx, cu_offset die_offset) |
5c631832 JK |
2511 | { |
2512 | struct needs_frame_baton *nf_baton = ctx->baton; | |
2513 | ||
37b50a69 | 2514 | per_cu_dwarf_call (ctx, die_offset, nf_baton->per_cu, |
9e8b7a03 | 2515 | ctx->funcs->get_frame_pc, ctx->baton); |
5c631832 JK |
2516 | } |
2517 | ||
8e3b41a9 JK |
2518 | /* DW_OP_GNU_entry_value accesses require a caller, therefore a frame. */ |
2519 | ||
2520 | static void | |
2521 | needs_dwarf_reg_entry_value (struct dwarf_expr_context *ctx, | |
24c5c679 JK |
2522 | enum call_site_parameter_kind kind, |
2523 | union call_site_parameter_u kind_u, int deref_size) | |
8e3b41a9 JK |
2524 | { |
2525 | struct needs_frame_baton *nf_baton = ctx->baton; | |
2526 | ||
2527 | nf_baton->needs_frame = 1; | |
1788b2d3 JK |
2528 | |
2529 | /* The expression may require some stub values on DWARF stack. */ | |
2530 | dwarf_expr_push_address (ctx, 0, 0); | |
8e3b41a9 JK |
2531 | } |
2532 | ||
3019eac3 DE |
2533 | /* DW_OP_GNU_addr_index doesn't require a frame. */ |
2534 | ||
2535 | static CORE_ADDR | |
2536 | needs_get_addr_index (void *baton, unsigned int index) | |
2537 | { | |
2538 | /* Nothing to do. */ | |
2539 | return 1; | |
2540 | } | |
2541 | ||
9e8b7a03 JK |
2542 | /* Virtual method table for dwarf2_loc_desc_needs_frame below. */ |
2543 | ||
2544 | static const struct dwarf_expr_context_funcs needs_frame_ctx_funcs = | |
2545 | { | |
b1370418 | 2546 | needs_frame_read_addr_from_reg, |
0acf8b65 | 2547 | needs_frame_get_reg_value, |
9e8b7a03 JK |
2548 | needs_frame_read_mem, |
2549 | needs_frame_frame_base, | |
2550 | needs_frame_frame_cfa, | |
2551 | needs_frame_frame_cfa, /* get_frame_pc */ | |
2552 | needs_frame_tls_address, | |
2553 | needs_frame_dwarf_call, | |
8e3b41a9 | 2554 | NULL, /* get_base_type */ |
3019eac3 DE |
2555 | needs_dwarf_reg_entry_value, |
2556 | needs_get_addr_index | |
9e8b7a03 JK |
2557 | }; |
2558 | ||
4c2df51b DJ |
2559 | /* Return non-zero iff the location expression at DATA (length SIZE) |
2560 | requires a frame to evaluate. */ | |
2561 | ||
2562 | static int | |
56eb65bd | 2563 | dwarf2_loc_desc_needs_frame (const gdb_byte *data, size_t size, |
ae0d2f24 | 2564 | struct dwarf2_per_cu_data *per_cu) |
4c2df51b DJ |
2565 | { |
2566 | struct needs_frame_baton baton; | |
2567 | struct dwarf_expr_context *ctx; | |
f630a401 | 2568 | int in_reg; |
4a227398 | 2569 | struct cleanup *old_chain; |
ac56253d | 2570 | struct objfile *objfile = dwarf2_per_cu_objfile (per_cu); |
4c2df51b DJ |
2571 | |
2572 | baton.needs_frame = 0; | |
17ea53c3 | 2573 | baton.per_cu = per_cu; |
4c2df51b DJ |
2574 | |
2575 | ctx = new_dwarf_expr_context (); | |
4a227398 | 2576 | old_chain = make_cleanup_free_dwarf_expr_context (ctx); |
72fc29ff | 2577 | make_cleanup_value_free_to_mark (value_mark ()); |
4a227398 | 2578 | |
ac56253d | 2579 | ctx->gdbarch = get_objfile_arch (objfile); |
ae0d2f24 | 2580 | ctx->addr_size = dwarf2_per_cu_addr_size (per_cu); |
181cebd4 | 2581 | ctx->ref_addr_size = dwarf2_per_cu_ref_addr_size (per_cu); |
9aa1f1e3 | 2582 | ctx->offset = dwarf2_per_cu_text_offset (per_cu); |
4c2df51b | 2583 | ctx->baton = &baton; |
9e8b7a03 | 2584 | ctx->funcs = &needs_frame_ctx_funcs; |
4c2df51b DJ |
2585 | |
2586 | dwarf_expr_eval (ctx, data, size); | |
2587 | ||
cec03d70 | 2588 | in_reg = ctx->location == DWARF_VALUE_REGISTER; |
f630a401 | 2589 | |
87808bd6 JB |
2590 | if (ctx->num_pieces > 0) |
2591 | { | |
2592 | int i; | |
2593 | ||
2594 | /* If the location has several pieces, and any of them are in | |
2595 | registers, then we will need a frame to fetch them from. */ | |
2596 | for (i = 0; i < ctx->num_pieces; i++) | |
cec03d70 | 2597 | if (ctx->pieces[i].location == DWARF_VALUE_REGISTER) |
87808bd6 JB |
2598 | in_reg = 1; |
2599 | } | |
2600 | ||
4a227398 | 2601 | do_cleanups (old_chain); |
4c2df51b | 2602 | |
f630a401 | 2603 | return baton.needs_frame || in_reg; |
4c2df51b DJ |
2604 | } |
2605 | ||
3cf03773 TT |
2606 | /* A helper function that throws an unimplemented error mentioning a |
2607 | given DWARF operator. */ | |
2608 | ||
2609 | static void | |
2610 | unimplemented (unsigned int op) | |
0d53c4c4 | 2611 | { |
f39c6ffd | 2612 | const char *name = get_DW_OP_name (op); |
b1bfef65 TT |
2613 | |
2614 | if (name) | |
2615 | error (_("DWARF operator %s cannot be translated to an agent expression"), | |
2616 | name); | |
2617 | else | |
1ba1b353 TT |
2618 | error (_("Unknown DWARF operator 0x%02x cannot be translated " |
2619 | "to an agent expression"), | |
b1bfef65 | 2620 | op); |
3cf03773 | 2621 | } |
08922a10 | 2622 | |
3cf03773 TT |
2623 | /* A helper function to convert a DWARF register to an arch register. |
2624 | ARCH is the architecture. | |
2625 | DWARF_REG is the register. | |
2626 | This will throw an exception if the DWARF register cannot be | |
2627 | translated to an architecture register. */ | |
08922a10 | 2628 | |
3cf03773 TT |
2629 | static int |
2630 | translate_register (struct gdbarch *arch, int dwarf_reg) | |
2631 | { | |
2632 | int reg = gdbarch_dwarf2_reg_to_regnum (arch, dwarf_reg); | |
2633 | if (reg == -1) | |
2634 | error (_("Unable to access DWARF register number %d"), dwarf_reg); | |
2635 | return reg; | |
2636 | } | |
08922a10 | 2637 | |
3cf03773 TT |
2638 | /* A helper function that emits an access to memory. ARCH is the |
2639 | target architecture. EXPR is the expression which we are building. | |
2640 | NBITS is the number of bits we want to read. This emits the | |
2641 | opcodes needed to read the memory and then extract the desired | |
2642 | bits. */ | |
08922a10 | 2643 | |
3cf03773 TT |
2644 | static void |
2645 | access_memory (struct gdbarch *arch, struct agent_expr *expr, ULONGEST nbits) | |
08922a10 | 2646 | { |
3cf03773 TT |
2647 | ULONGEST nbytes = (nbits + 7) / 8; |
2648 | ||
9df7235c | 2649 | gdb_assert (nbytes > 0 && nbytes <= sizeof (LONGEST)); |
3cf03773 | 2650 | |
92bc6a20 | 2651 | if (expr->tracing) |
3cf03773 TT |
2652 | ax_trace_quick (expr, nbytes); |
2653 | ||
2654 | if (nbits <= 8) | |
2655 | ax_simple (expr, aop_ref8); | |
2656 | else if (nbits <= 16) | |
2657 | ax_simple (expr, aop_ref16); | |
2658 | else if (nbits <= 32) | |
2659 | ax_simple (expr, aop_ref32); | |
2660 | else | |
2661 | ax_simple (expr, aop_ref64); | |
2662 | ||
2663 | /* If we read exactly the number of bytes we wanted, we're done. */ | |
2664 | if (8 * nbytes == nbits) | |
2665 | return; | |
2666 | ||
2667 | if (gdbarch_bits_big_endian (arch)) | |
0d53c4c4 | 2668 | { |
3cf03773 TT |
2669 | /* On a bits-big-endian machine, we want the high-order |
2670 | NBITS. */ | |
2671 | ax_const_l (expr, 8 * nbytes - nbits); | |
2672 | ax_simple (expr, aop_rsh_unsigned); | |
0d53c4c4 | 2673 | } |
3cf03773 | 2674 | else |
0d53c4c4 | 2675 | { |
3cf03773 TT |
2676 | /* On a bits-little-endian box, we want the low-order NBITS. */ |
2677 | ax_zero_ext (expr, nbits); | |
0d53c4c4 | 2678 | } |
3cf03773 | 2679 | } |
0936ad1d | 2680 | |
8cf6f0b1 TT |
2681 | /* A helper function to return the frame's PC. */ |
2682 | ||
2683 | static CORE_ADDR | |
2684 | get_ax_pc (void *baton) | |
2685 | { | |
2686 | struct agent_expr *expr = baton; | |
2687 | ||
2688 | return expr->scope; | |
2689 | } | |
2690 | ||
3cf03773 TT |
2691 | /* Compile a DWARF location expression to an agent expression. |
2692 | ||
2693 | EXPR is the agent expression we are building. | |
2694 | LOC is the agent value we modify. | |
2695 | ARCH is the architecture. | |
2696 | ADDR_SIZE is the size of addresses, in bytes. | |
2697 | OP_PTR is the start of the location expression. | |
2698 | OP_END is one past the last byte of the location expression. | |
2699 | ||
2700 | This will throw an exception for various kinds of errors -- for | |
2701 | example, if the expression cannot be compiled, or if the expression | |
2702 | is invalid. */ | |
0936ad1d | 2703 | |
9f6f94ff TT |
2704 | void |
2705 | dwarf2_compile_expr_to_ax (struct agent_expr *expr, struct axs_value *loc, | |
2706 | struct gdbarch *arch, unsigned int addr_size, | |
2707 | const gdb_byte *op_ptr, const gdb_byte *op_end, | |
2708 | struct dwarf2_per_cu_data *per_cu) | |
3cf03773 TT |
2709 | { |
2710 | struct cleanup *cleanups; | |
2711 | int i, *offsets; | |
2712 | VEC(int) *dw_labels = NULL, *patches = NULL; | |
2713 | const gdb_byte * const base = op_ptr; | |
2714 | const gdb_byte *previous_piece = op_ptr; | |
2715 | enum bfd_endian byte_order = gdbarch_byte_order (arch); | |
2716 | ULONGEST bits_collected = 0; | |
2717 | unsigned int addr_size_bits = 8 * addr_size; | |
2718 | int bits_big_endian = gdbarch_bits_big_endian (arch); | |
0936ad1d | 2719 | |
3cf03773 TT |
2720 | offsets = xmalloc ((op_end - op_ptr) * sizeof (int)); |
2721 | cleanups = make_cleanup (xfree, offsets); | |
0936ad1d | 2722 | |
3cf03773 TT |
2723 | for (i = 0; i < op_end - op_ptr; ++i) |
2724 | offsets[i] = -1; | |
0936ad1d | 2725 | |
3cf03773 TT |
2726 | make_cleanup (VEC_cleanup (int), &dw_labels); |
2727 | make_cleanup (VEC_cleanup (int), &patches); | |
0936ad1d | 2728 | |
3cf03773 TT |
2729 | /* By default we are making an address. */ |
2730 | loc->kind = axs_lvalue_memory; | |
0d45f56e | 2731 | |
3cf03773 TT |
2732 | while (op_ptr < op_end) |
2733 | { | |
2734 | enum dwarf_location_atom op = *op_ptr; | |
9fccedf7 DE |
2735 | uint64_t uoffset, reg; |
2736 | int64_t offset; | |
3cf03773 TT |
2737 | int i; |
2738 | ||
2739 | offsets[op_ptr - base] = expr->len; | |
2740 | ++op_ptr; | |
2741 | ||
2742 | /* Our basic approach to code generation is to map DWARF | |
2743 | operations directly to AX operations. However, there are | |
2744 | some differences. | |
2745 | ||
2746 | First, DWARF works on address-sized units, but AX always uses | |
2747 | LONGEST. For most operations we simply ignore this | |
2748 | difference; instead we generate sign extensions as needed | |
2749 | before division and comparison operations. It would be nice | |
2750 | to omit the sign extensions, but there is no way to determine | |
2751 | the size of the target's LONGEST. (This code uses the size | |
2752 | of the host LONGEST in some cases -- that is a bug but it is | |
2753 | difficult to fix.) | |
2754 | ||
2755 | Second, some DWARF operations cannot be translated to AX. | |
2756 | For these we simply fail. See | |
2757 | http://sourceware.org/bugzilla/show_bug.cgi?id=11662. */ | |
2758 | switch (op) | |
0936ad1d | 2759 | { |
3cf03773 TT |
2760 | case DW_OP_lit0: |
2761 | case DW_OP_lit1: | |
2762 | case DW_OP_lit2: | |
2763 | case DW_OP_lit3: | |
2764 | case DW_OP_lit4: | |
2765 | case DW_OP_lit5: | |
2766 | case DW_OP_lit6: | |
2767 | case DW_OP_lit7: | |
2768 | case DW_OP_lit8: | |
2769 | case DW_OP_lit9: | |
2770 | case DW_OP_lit10: | |
2771 | case DW_OP_lit11: | |
2772 | case DW_OP_lit12: | |
2773 | case DW_OP_lit13: | |
2774 | case DW_OP_lit14: | |
2775 | case DW_OP_lit15: | |
2776 | case DW_OP_lit16: | |
2777 | case DW_OP_lit17: | |
2778 | case DW_OP_lit18: | |
2779 | case DW_OP_lit19: | |
2780 | case DW_OP_lit20: | |
2781 | case DW_OP_lit21: | |
2782 | case DW_OP_lit22: | |
2783 | case DW_OP_lit23: | |
2784 | case DW_OP_lit24: | |
2785 | case DW_OP_lit25: | |
2786 | case DW_OP_lit26: | |
2787 | case DW_OP_lit27: | |
2788 | case DW_OP_lit28: | |
2789 | case DW_OP_lit29: | |
2790 | case DW_OP_lit30: | |
2791 | case DW_OP_lit31: | |
2792 | ax_const_l (expr, op - DW_OP_lit0); | |
2793 | break; | |
0d53c4c4 | 2794 | |
3cf03773 | 2795 | case DW_OP_addr: |
ac56253d | 2796 | uoffset = extract_unsigned_integer (op_ptr, addr_size, byte_order); |
3cf03773 | 2797 | op_ptr += addr_size; |
ac56253d TT |
2798 | /* Some versions of GCC emit DW_OP_addr before |
2799 | DW_OP_GNU_push_tls_address. In this case the value is an | |
2800 | index, not an address. We don't support things like | |
2801 | branching between the address and the TLS op. */ | |
2802 | if (op_ptr >= op_end || *op_ptr != DW_OP_GNU_push_tls_address) | |
9aa1f1e3 | 2803 | uoffset += dwarf2_per_cu_text_offset (per_cu); |
ac56253d | 2804 | ax_const_l (expr, uoffset); |
3cf03773 | 2805 | break; |
4c2df51b | 2806 | |
3cf03773 TT |
2807 | case DW_OP_const1u: |
2808 | ax_const_l (expr, extract_unsigned_integer (op_ptr, 1, byte_order)); | |
2809 | op_ptr += 1; | |
2810 | break; | |
2811 | case DW_OP_const1s: | |
2812 | ax_const_l (expr, extract_signed_integer (op_ptr, 1, byte_order)); | |
2813 | op_ptr += 1; | |
2814 | break; | |
2815 | case DW_OP_const2u: | |
2816 | ax_const_l (expr, extract_unsigned_integer (op_ptr, 2, byte_order)); | |
2817 | op_ptr += 2; | |
2818 | break; | |
2819 | case DW_OP_const2s: | |
2820 | ax_const_l (expr, extract_signed_integer (op_ptr, 2, byte_order)); | |
2821 | op_ptr += 2; | |
2822 | break; | |
2823 | case DW_OP_const4u: | |
2824 | ax_const_l (expr, extract_unsigned_integer (op_ptr, 4, byte_order)); | |
2825 | op_ptr += 4; | |
2826 | break; | |
2827 | case DW_OP_const4s: | |
2828 | ax_const_l (expr, extract_signed_integer (op_ptr, 4, byte_order)); | |
2829 | op_ptr += 4; | |
2830 | break; | |
2831 | case DW_OP_const8u: | |
2832 | ax_const_l (expr, extract_unsigned_integer (op_ptr, 8, byte_order)); | |
2833 | op_ptr += 8; | |
2834 | break; | |
2835 | case DW_OP_const8s: | |
2836 | ax_const_l (expr, extract_signed_integer (op_ptr, 8, byte_order)); | |
2837 | op_ptr += 8; | |
2838 | break; | |
2839 | case DW_OP_constu: | |
f664829e | 2840 | op_ptr = safe_read_uleb128 (op_ptr, op_end, &uoffset); |
3cf03773 TT |
2841 | ax_const_l (expr, uoffset); |
2842 | break; | |
2843 | case DW_OP_consts: | |
f664829e | 2844 | op_ptr = safe_read_sleb128 (op_ptr, op_end, &offset); |
3cf03773 TT |
2845 | ax_const_l (expr, offset); |
2846 | break; | |
9c238357 | 2847 | |
3cf03773 TT |
2848 | case DW_OP_reg0: |
2849 | case DW_OP_reg1: | |
2850 | case DW_OP_reg2: | |
2851 | case DW_OP_reg3: | |
2852 | case DW_OP_reg4: | |
2853 | case DW_OP_reg5: | |
2854 | case DW_OP_reg6: | |
2855 | case DW_OP_reg7: | |
2856 | case DW_OP_reg8: | |
2857 | case DW_OP_reg9: | |
2858 | case DW_OP_reg10: | |
2859 | case DW_OP_reg11: | |
2860 | case DW_OP_reg12: | |
2861 | case DW_OP_reg13: | |
2862 | case DW_OP_reg14: | |
2863 | case DW_OP_reg15: | |
2864 | case DW_OP_reg16: | |
2865 | case DW_OP_reg17: | |
2866 | case DW_OP_reg18: | |
2867 | case DW_OP_reg19: | |
2868 | case DW_OP_reg20: | |
2869 | case DW_OP_reg21: | |
2870 | case DW_OP_reg22: | |
2871 | case DW_OP_reg23: | |
2872 | case DW_OP_reg24: | |
2873 | case DW_OP_reg25: | |
2874 | case DW_OP_reg26: | |
2875 | case DW_OP_reg27: | |
2876 | case DW_OP_reg28: | |
2877 | case DW_OP_reg29: | |
2878 | case DW_OP_reg30: | |
2879 | case DW_OP_reg31: | |
2880 | dwarf_expr_require_composition (op_ptr, op_end, "DW_OP_regx"); | |
2881 | loc->u.reg = translate_register (arch, op - DW_OP_reg0); | |
2882 | loc->kind = axs_lvalue_register; | |
2883 | break; | |
9c238357 | 2884 | |
3cf03773 | 2885 | case DW_OP_regx: |
f664829e | 2886 | op_ptr = safe_read_uleb128 (op_ptr, op_end, ®); |
3cf03773 TT |
2887 | dwarf_expr_require_composition (op_ptr, op_end, "DW_OP_regx"); |
2888 | loc->u.reg = translate_register (arch, reg); | |
2889 | loc->kind = axs_lvalue_register; | |
2890 | break; | |
08922a10 | 2891 | |
3cf03773 TT |
2892 | case DW_OP_implicit_value: |
2893 | { | |
9fccedf7 | 2894 | uint64_t len; |
3cf03773 | 2895 | |
f664829e | 2896 | op_ptr = safe_read_uleb128 (op_ptr, op_end, &len); |
3cf03773 TT |
2897 | if (op_ptr + len > op_end) |
2898 | error (_("DW_OP_implicit_value: too few bytes available.")); | |
2899 | if (len > sizeof (ULONGEST)) | |
2900 | error (_("Cannot translate DW_OP_implicit_value of %d bytes"), | |
2901 | (int) len); | |
2902 | ||
2903 | ax_const_l (expr, extract_unsigned_integer (op_ptr, len, | |
2904 | byte_order)); | |
2905 | op_ptr += len; | |
2906 | dwarf_expr_require_composition (op_ptr, op_end, | |
2907 | "DW_OP_implicit_value"); | |
2908 | ||
2909 | loc->kind = axs_rvalue; | |
2910 | } | |
2911 | break; | |
08922a10 | 2912 | |
3cf03773 TT |
2913 | case DW_OP_stack_value: |
2914 | dwarf_expr_require_composition (op_ptr, op_end, "DW_OP_stack_value"); | |
2915 | loc->kind = axs_rvalue; | |
2916 | break; | |
08922a10 | 2917 | |
3cf03773 TT |
2918 | case DW_OP_breg0: |
2919 | case DW_OP_breg1: | |
2920 | case DW_OP_breg2: | |
2921 | case DW_OP_breg3: | |
2922 | case DW_OP_breg4: | |
2923 | case DW_OP_breg5: | |
2924 | case DW_OP_breg6: | |
2925 | case DW_OP_breg7: | |
2926 | case DW_OP_breg8: | |
2927 | case DW_OP_breg9: | |
2928 | case DW_OP_breg10: | |
2929 | case DW_OP_breg11: | |
2930 | case DW_OP_breg12: | |
2931 | case DW_OP_breg13: | |
2932 | case DW_OP_breg14: | |
2933 | case DW_OP_breg15: | |
2934 | case DW_OP_breg16: | |
2935 | case DW_OP_breg17: | |
2936 | case DW_OP_breg18: | |
2937 | case DW_OP_breg19: | |
2938 | case DW_OP_breg20: | |
2939 | case DW_OP_breg21: | |
2940 | case DW_OP_breg22: | |
2941 | case DW_OP_breg23: | |
2942 | case DW_OP_breg24: | |
2943 | case DW_OP_breg25: | |
2944 | case DW_OP_breg26: | |
2945 | case DW_OP_breg27: | |
2946 | case DW_OP_breg28: | |
2947 | case DW_OP_breg29: | |
2948 | case DW_OP_breg30: | |
2949 | case DW_OP_breg31: | |
f664829e | 2950 | op_ptr = safe_read_sleb128 (op_ptr, op_end, &offset); |
3cf03773 TT |
2951 | i = translate_register (arch, op - DW_OP_breg0); |
2952 | ax_reg (expr, i); | |
2953 | if (offset != 0) | |
2954 | { | |
2955 | ax_const_l (expr, offset); | |
2956 | ax_simple (expr, aop_add); | |
2957 | } | |
2958 | break; | |
2959 | case DW_OP_bregx: | |
2960 | { | |
f664829e DE |
2961 | op_ptr = safe_read_uleb128 (op_ptr, op_end, ®); |
2962 | op_ptr = safe_read_sleb128 (op_ptr, op_end, &offset); | |
3cf03773 TT |
2963 | i = translate_register (arch, reg); |
2964 | ax_reg (expr, i); | |
2965 | if (offset != 0) | |
2966 | { | |
2967 | ax_const_l (expr, offset); | |
2968 | ax_simple (expr, aop_add); | |
2969 | } | |
2970 | } | |
2971 | break; | |
2972 | case DW_OP_fbreg: | |
2973 | { | |
2974 | const gdb_byte *datastart; | |
2975 | size_t datalen; | |
3cf03773 TT |
2976 | struct block *b; |
2977 | struct symbol *framefunc; | |
08922a10 | 2978 | |
3cf03773 TT |
2979 | b = block_for_pc (expr->scope); |
2980 | ||
2981 | if (!b) | |
2982 | error (_("No block found for address")); | |
2983 | ||
2984 | framefunc = block_linkage_function (b); | |
2985 | ||
2986 | if (!framefunc) | |
2987 | error (_("No function found for block")); | |
2988 | ||
2989 | dwarf_expr_frame_base_1 (framefunc, expr->scope, | |
2990 | &datastart, &datalen); | |
2991 | ||
f664829e | 2992 | op_ptr = safe_read_sleb128 (op_ptr, op_end, &offset); |
9f6f94ff TT |
2993 | dwarf2_compile_expr_to_ax (expr, loc, arch, addr_size, datastart, |
2994 | datastart + datalen, per_cu); | |
d84cf7eb TT |
2995 | if (loc->kind == axs_lvalue_register) |
2996 | require_rvalue (expr, loc); | |
3cf03773 TT |
2997 | |
2998 | if (offset != 0) | |
2999 | { | |
3000 | ax_const_l (expr, offset); | |
3001 | ax_simple (expr, aop_add); | |
3002 | } | |
3003 | ||
3004 | loc->kind = axs_lvalue_memory; | |
3005 | } | |
08922a10 | 3006 | break; |
08922a10 | 3007 | |
3cf03773 TT |
3008 | case DW_OP_dup: |
3009 | ax_simple (expr, aop_dup); | |
3010 | break; | |
08922a10 | 3011 | |
3cf03773 TT |
3012 | case DW_OP_drop: |
3013 | ax_simple (expr, aop_pop); | |
3014 | break; | |
08922a10 | 3015 | |
3cf03773 TT |
3016 | case DW_OP_pick: |
3017 | offset = *op_ptr++; | |
c7f96d2b | 3018 | ax_pick (expr, offset); |
3cf03773 TT |
3019 | break; |
3020 | ||
3021 | case DW_OP_swap: | |
3022 | ax_simple (expr, aop_swap); | |
3023 | break; | |
08922a10 | 3024 | |
3cf03773 | 3025 | case DW_OP_over: |
c7f96d2b | 3026 | ax_pick (expr, 1); |
3cf03773 | 3027 | break; |
08922a10 | 3028 | |
3cf03773 | 3029 | case DW_OP_rot: |
c7f96d2b | 3030 | ax_simple (expr, aop_rot); |
3cf03773 | 3031 | break; |
08922a10 | 3032 | |
3cf03773 TT |
3033 | case DW_OP_deref: |
3034 | case DW_OP_deref_size: | |
3035 | { | |
3036 | int size; | |
08922a10 | 3037 | |
3cf03773 TT |
3038 | if (op == DW_OP_deref_size) |
3039 | size = *op_ptr++; | |
3040 | else | |
3041 | size = addr_size; | |
3042 | ||
9df7235c | 3043 | if (size != 1 && size != 2 && size != 4 && size != 8) |
f3cec7e6 HZ |
3044 | error (_("Unsupported size %d in %s"), |
3045 | size, get_DW_OP_name (op)); | |
9df7235c | 3046 | access_memory (arch, expr, size * TARGET_CHAR_BIT); |
3cf03773 TT |
3047 | } |
3048 | break; | |
3049 | ||
3050 | case DW_OP_abs: | |
3051 | /* Sign extend the operand. */ | |
3052 | ax_ext (expr, addr_size_bits); | |
3053 | ax_simple (expr, aop_dup); | |
3054 | ax_const_l (expr, 0); | |
3055 | ax_simple (expr, aop_less_signed); | |
3056 | ax_simple (expr, aop_log_not); | |
3057 | i = ax_goto (expr, aop_if_goto); | |
3058 | /* We have to emit 0 - X. */ | |
3059 | ax_const_l (expr, 0); | |
3060 | ax_simple (expr, aop_swap); | |
3061 | ax_simple (expr, aop_sub); | |
3062 | ax_label (expr, i, expr->len); | |
3063 | break; | |
3064 | ||
3065 | case DW_OP_neg: | |
3066 | /* No need to sign extend here. */ | |
3067 | ax_const_l (expr, 0); | |
3068 | ax_simple (expr, aop_swap); | |
3069 | ax_simple (expr, aop_sub); | |
3070 | break; | |
3071 | ||
3072 | case DW_OP_not: | |
3073 | /* Sign extend the operand. */ | |
3074 | ax_ext (expr, addr_size_bits); | |
3075 | ax_simple (expr, aop_bit_not); | |
3076 | break; | |
3077 | ||
3078 | case DW_OP_plus_uconst: | |
f664829e | 3079 | op_ptr = safe_read_uleb128 (op_ptr, op_end, ®); |
3cf03773 TT |
3080 | /* It would be really weird to emit `DW_OP_plus_uconst 0', |
3081 | but we micro-optimize anyhow. */ | |
3082 | if (reg != 0) | |
3083 | { | |
3084 | ax_const_l (expr, reg); | |
3085 | ax_simple (expr, aop_add); | |
3086 | } | |
3087 | break; | |
3088 | ||
3089 | case DW_OP_and: | |
3090 | ax_simple (expr, aop_bit_and); | |
3091 | break; | |
3092 | ||
3093 | case DW_OP_div: | |
3094 | /* Sign extend the operands. */ | |
3095 | ax_ext (expr, addr_size_bits); | |
3096 | ax_simple (expr, aop_swap); | |
3097 | ax_ext (expr, addr_size_bits); | |
3098 | ax_simple (expr, aop_swap); | |
3099 | ax_simple (expr, aop_div_signed); | |
08922a10 SS |
3100 | break; |
3101 | ||
3cf03773 TT |
3102 | case DW_OP_minus: |
3103 | ax_simple (expr, aop_sub); | |
3104 | break; | |
3105 | ||
3106 | case DW_OP_mod: | |
3107 | ax_simple (expr, aop_rem_unsigned); | |
3108 | break; | |
3109 | ||
3110 | case DW_OP_mul: | |
3111 | ax_simple (expr, aop_mul); | |
3112 | break; | |
3113 | ||
3114 | case DW_OP_or: | |
3115 | ax_simple (expr, aop_bit_or); | |
3116 | break; | |
3117 | ||
3118 | case DW_OP_plus: | |
3119 | ax_simple (expr, aop_add); | |
3120 | break; | |
3121 | ||
3122 | case DW_OP_shl: | |
3123 | ax_simple (expr, aop_lsh); | |
3124 | break; | |
3125 | ||
3126 | case DW_OP_shr: | |
3127 | ax_simple (expr, aop_rsh_unsigned); | |
3128 | break; | |
3129 | ||
3130 | case DW_OP_shra: | |
3131 | ax_simple (expr, aop_rsh_signed); | |
3132 | break; | |
3133 | ||
3134 | case DW_OP_xor: | |
3135 | ax_simple (expr, aop_bit_xor); | |
3136 | break; | |
3137 | ||
3138 | case DW_OP_le: | |
3139 | /* Sign extend the operands. */ | |
3140 | ax_ext (expr, addr_size_bits); | |
3141 | ax_simple (expr, aop_swap); | |
3142 | ax_ext (expr, addr_size_bits); | |
3143 | /* Note no swap here: A <= B is !(B < A). */ | |
3144 | ax_simple (expr, aop_less_signed); | |
3145 | ax_simple (expr, aop_log_not); | |
3146 | break; | |
3147 | ||
3148 | case DW_OP_ge: | |
3149 | /* Sign extend the operands. */ | |
3150 | ax_ext (expr, addr_size_bits); | |
3151 | ax_simple (expr, aop_swap); | |
3152 | ax_ext (expr, addr_size_bits); | |
3153 | ax_simple (expr, aop_swap); | |
3154 | /* A >= B is !(A < B). */ | |
3155 | ax_simple (expr, aop_less_signed); | |
3156 | ax_simple (expr, aop_log_not); | |
3157 | break; | |
3158 | ||
3159 | case DW_OP_eq: | |
3160 | /* Sign extend the operands. */ | |
3161 | ax_ext (expr, addr_size_bits); | |
3162 | ax_simple (expr, aop_swap); | |
3163 | ax_ext (expr, addr_size_bits); | |
3164 | /* No need for a second swap here. */ | |
3165 | ax_simple (expr, aop_equal); | |
3166 | break; | |
3167 | ||
3168 | case DW_OP_lt: | |
3169 | /* Sign extend the operands. */ | |
3170 | ax_ext (expr, addr_size_bits); | |
3171 | ax_simple (expr, aop_swap); | |
3172 | ax_ext (expr, addr_size_bits); | |
3173 | ax_simple (expr, aop_swap); | |
3174 | ax_simple (expr, aop_less_signed); | |
3175 | break; | |
3176 | ||
3177 | case DW_OP_gt: | |
3178 | /* Sign extend the operands. */ | |
3179 | ax_ext (expr, addr_size_bits); | |
3180 | ax_simple (expr, aop_swap); | |
3181 | ax_ext (expr, addr_size_bits); | |
3182 | /* Note no swap here: A > B is B < A. */ | |
3183 | ax_simple (expr, aop_less_signed); | |
3184 | break; | |
3185 | ||
3186 | case DW_OP_ne: | |
3187 | /* Sign extend the operands. */ | |
3188 | ax_ext (expr, addr_size_bits); | |
3189 | ax_simple (expr, aop_swap); | |
3190 | ax_ext (expr, addr_size_bits); | |
3191 | /* No need for a swap here. */ | |
3192 | ax_simple (expr, aop_equal); | |
3193 | ax_simple (expr, aop_log_not); | |
3194 | break; | |
3195 | ||
3196 | case DW_OP_call_frame_cfa: | |
9f6f94ff TT |
3197 | dwarf2_compile_cfa_to_ax (expr, loc, arch, expr->scope, per_cu); |
3198 | loc->kind = axs_lvalue_memory; | |
3cf03773 TT |
3199 | break; |
3200 | ||
3201 | case DW_OP_GNU_push_tls_address: | |
3202 | unimplemented (op); | |
3203 | break; | |
3204 | ||
3205 | case DW_OP_skip: | |
3206 | offset = extract_signed_integer (op_ptr, 2, byte_order); | |
3207 | op_ptr += 2; | |
3208 | i = ax_goto (expr, aop_goto); | |
3209 | VEC_safe_push (int, dw_labels, op_ptr + offset - base); | |
3210 | VEC_safe_push (int, patches, i); | |
3211 | break; | |
3212 | ||
3213 | case DW_OP_bra: | |
3214 | offset = extract_signed_integer (op_ptr, 2, byte_order); | |
3215 | op_ptr += 2; | |
3216 | /* Zero extend the operand. */ | |
3217 | ax_zero_ext (expr, addr_size_bits); | |
3218 | i = ax_goto (expr, aop_if_goto); | |
3219 | VEC_safe_push (int, dw_labels, op_ptr + offset - base); | |
3220 | VEC_safe_push (int, patches, i); | |
3221 | break; | |
3222 | ||
3223 | case DW_OP_nop: | |
3224 | break; | |
3225 | ||
3226 | case DW_OP_piece: | |
3227 | case DW_OP_bit_piece: | |
08922a10 | 3228 | { |
9fccedf7 | 3229 | uint64_t size, offset; |
3cf03773 TT |
3230 | |
3231 | if (op_ptr - 1 == previous_piece) | |
3232 | error (_("Cannot translate empty pieces to agent expressions")); | |
3233 | previous_piece = op_ptr - 1; | |
3234 | ||
f664829e | 3235 | op_ptr = safe_read_uleb128 (op_ptr, op_end, &size); |
3cf03773 TT |
3236 | if (op == DW_OP_piece) |
3237 | { | |
3238 | size *= 8; | |
3239 | offset = 0; | |
3240 | } | |
3241 | else | |
f664829e | 3242 | op_ptr = safe_read_uleb128 (op_ptr, op_end, &offset); |
08922a10 | 3243 | |
3cf03773 TT |
3244 | if (bits_collected + size > 8 * sizeof (LONGEST)) |
3245 | error (_("Expression pieces exceed word size")); | |
3246 | ||
3247 | /* Access the bits. */ | |
3248 | switch (loc->kind) | |
3249 | { | |
3250 | case axs_lvalue_register: | |
3251 | ax_reg (expr, loc->u.reg); | |
3252 | break; | |
3253 | ||
3254 | case axs_lvalue_memory: | |
3255 | /* Offset the pointer, if needed. */ | |
3256 | if (offset > 8) | |
3257 | { | |
3258 | ax_const_l (expr, offset / 8); | |
3259 | ax_simple (expr, aop_add); | |
3260 | offset %= 8; | |
3261 | } | |
3262 | access_memory (arch, expr, size); | |
3263 | break; | |
3264 | } | |
3265 | ||
3266 | /* For a bits-big-endian target, shift up what we already | |
3267 | have. For a bits-little-endian target, shift up the | |
3268 | new data. Note that there is a potential bug here if | |
3269 | the DWARF expression leaves multiple values on the | |
3270 | stack. */ | |
3271 | if (bits_collected > 0) | |
3272 | { | |
3273 | if (bits_big_endian) | |
3274 | { | |
3275 | ax_simple (expr, aop_swap); | |
3276 | ax_const_l (expr, size); | |
3277 | ax_simple (expr, aop_lsh); | |
3278 | /* We don't need a second swap here, because | |
3279 | aop_bit_or is symmetric. */ | |
3280 | } | |
3281 | else | |
3282 | { | |
3283 | ax_const_l (expr, size); | |
3284 | ax_simple (expr, aop_lsh); | |
3285 | } | |
3286 | ax_simple (expr, aop_bit_or); | |
3287 | } | |
3288 | ||
3289 | bits_collected += size; | |
3290 | loc->kind = axs_rvalue; | |
08922a10 SS |
3291 | } |
3292 | break; | |
08922a10 | 3293 | |
3cf03773 TT |
3294 | case DW_OP_GNU_uninit: |
3295 | unimplemented (op); | |
3296 | ||
3297 | case DW_OP_call2: | |
3298 | case DW_OP_call4: | |
3299 | { | |
3300 | struct dwarf2_locexpr_baton block; | |
3301 | int size = (op == DW_OP_call2 ? 2 : 4); | |
b64f50a1 | 3302 | cu_offset offset; |
3cf03773 TT |
3303 | |
3304 | uoffset = extract_unsigned_integer (op_ptr, size, byte_order); | |
3305 | op_ptr += size; | |
3306 | ||
b64f50a1 | 3307 | offset.cu_off = uoffset; |
8b9737bf TT |
3308 | block = dwarf2_fetch_die_loc_cu_off (offset, per_cu, |
3309 | get_ax_pc, expr); | |
3cf03773 TT |
3310 | |
3311 | /* DW_OP_call_ref is currently not supported. */ | |
3312 | gdb_assert (block.per_cu == per_cu); | |
3313 | ||
9f6f94ff TT |
3314 | dwarf2_compile_expr_to_ax (expr, loc, arch, addr_size, |
3315 | block.data, block.data + block.size, | |
3316 | per_cu); | |
3cf03773 TT |
3317 | } |
3318 | break; | |
3319 | ||
3320 | case DW_OP_call_ref: | |
3321 | unimplemented (op); | |
3322 | ||
3323 | default: | |
b1bfef65 | 3324 | unimplemented (op); |
08922a10 | 3325 | } |
08922a10 | 3326 | } |
3cf03773 TT |
3327 | |
3328 | /* Patch all the branches we emitted. */ | |
3329 | for (i = 0; i < VEC_length (int, patches); ++i) | |
3330 | { | |
3331 | int targ = offsets[VEC_index (int, dw_labels, i)]; | |
3332 | if (targ == -1) | |
3333 | internal_error (__FILE__, __LINE__, _("invalid label")); | |
3334 | ax_label (expr, VEC_index (int, patches, i), targ); | |
3335 | } | |
3336 | ||
3337 | do_cleanups (cleanups); | |
08922a10 SS |
3338 | } |
3339 | ||
4c2df51b DJ |
3340 | \f |
3341 | /* Return the value of SYMBOL in FRAME using the DWARF-2 expression | |
3342 | evaluator to calculate the location. */ | |
3343 | static struct value * | |
3344 | locexpr_read_variable (struct symbol *symbol, struct frame_info *frame) | |
3345 | { | |
3346 | struct dwarf2_locexpr_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); | |
3347 | struct value *val; | |
9a619af0 | 3348 | |
a2d33775 JK |
3349 | val = dwarf2_evaluate_loc_desc (SYMBOL_TYPE (symbol), frame, dlbaton->data, |
3350 | dlbaton->size, dlbaton->per_cu); | |
4c2df51b DJ |
3351 | |
3352 | return val; | |
3353 | } | |
3354 | ||
e18b2753 JK |
3355 | /* Return the value of SYMBOL in FRAME at (callee) FRAME's function |
3356 | entry. SYMBOL should be a function parameter, otherwise NO_ENTRY_VALUE_ERROR | |
3357 | will be thrown. */ | |
3358 | ||
3359 | static struct value * | |
3360 | locexpr_read_variable_at_entry (struct symbol *symbol, struct frame_info *frame) | |
3361 | { | |
3362 | struct dwarf2_locexpr_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); | |
3363 | ||
3364 | return value_of_dwarf_block_entry (SYMBOL_TYPE (symbol), frame, dlbaton->data, | |
3365 | dlbaton->size); | |
3366 | } | |
3367 | ||
4c2df51b DJ |
3368 | /* Return non-zero iff we need a frame to evaluate SYMBOL. */ |
3369 | static int | |
3370 | locexpr_read_needs_frame (struct symbol *symbol) | |
3371 | { | |
3372 | struct dwarf2_locexpr_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); | |
9a619af0 | 3373 | |
ae0d2f24 UW |
3374 | return dwarf2_loc_desc_needs_frame (dlbaton->data, dlbaton->size, |
3375 | dlbaton->per_cu); | |
4c2df51b DJ |
3376 | } |
3377 | ||
9eae7c52 TT |
3378 | /* Return true if DATA points to the end of a piece. END is one past |
3379 | the last byte in the expression. */ | |
3380 | ||
3381 | static int | |
3382 | piece_end_p (const gdb_byte *data, const gdb_byte *end) | |
3383 | { | |
3384 | return data == end || data[0] == DW_OP_piece || data[0] == DW_OP_bit_piece; | |
3385 | } | |
3386 | ||
5e44ecb3 TT |
3387 | /* Helper for locexpr_describe_location_piece that finds the name of a |
3388 | DWARF register. */ | |
3389 | ||
3390 | static const char * | |
3391 | locexpr_regname (struct gdbarch *gdbarch, int dwarf_regnum) | |
3392 | { | |
3393 | int regnum; | |
3394 | ||
3395 | regnum = gdbarch_dwarf2_reg_to_regnum (gdbarch, dwarf_regnum); | |
3396 | return gdbarch_register_name (gdbarch, regnum); | |
3397 | } | |
3398 | ||
9eae7c52 TT |
3399 | /* Nicely describe a single piece of a location, returning an updated |
3400 | position in the bytecode sequence. This function cannot recognize | |
3401 | all locations; if a location is not recognized, it simply returns | |
f664829e DE |
3402 | DATA. If there is an error during reading, e.g. we run off the end |
3403 | of the buffer, an error is thrown. */ | |
08922a10 | 3404 | |
0d45f56e | 3405 | static const gdb_byte * |
08922a10 SS |
3406 | locexpr_describe_location_piece (struct symbol *symbol, struct ui_file *stream, |
3407 | CORE_ADDR addr, struct objfile *objfile, | |
49f6c839 | 3408 | struct dwarf2_per_cu_data *per_cu, |
9eae7c52 | 3409 | const gdb_byte *data, const gdb_byte *end, |
0d45f56e | 3410 | unsigned int addr_size) |
4c2df51b | 3411 | { |
08922a10 | 3412 | struct gdbarch *gdbarch = get_objfile_arch (objfile); |
49f6c839 | 3413 | size_t leb128_size; |
08922a10 SS |
3414 | |
3415 | if (data[0] >= DW_OP_reg0 && data[0] <= DW_OP_reg31) | |
3416 | { | |
08922a10 | 3417 | fprintf_filtered (stream, _("a variable in $%s"), |
5e44ecb3 | 3418 | locexpr_regname (gdbarch, data[0] - DW_OP_reg0)); |
08922a10 SS |
3419 | data += 1; |
3420 | } | |
3421 | else if (data[0] == DW_OP_regx) | |
3422 | { | |
9fccedf7 | 3423 | uint64_t reg; |
4c2df51b | 3424 | |
f664829e | 3425 | data = safe_read_uleb128 (data + 1, end, ®); |
08922a10 | 3426 | fprintf_filtered (stream, _("a variable in $%s"), |
5e44ecb3 | 3427 | locexpr_regname (gdbarch, reg)); |
08922a10 SS |
3428 | } |
3429 | else if (data[0] == DW_OP_fbreg) | |
4c2df51b | 3430 | { |
08922a10 SS |
3431 | struct block *b; |
3432 | struct symbol *framefunc; | |
3433 | int frame_reg = 0; | |
9fccedf7 | 3434 | int64_t frame_offset; |
7155d578 | 3435 | const gdb_byte *base_data, *new_data, *save_data = data; |
08922a10 | 3436 | size_t base_size; |
9fccedf7 | 3437 | int64_t base_offset = 0; |
08922a10 | 3438 | |
f664829e | 3439 | new_data = safe_read_sleb128 (data + 1, end, &frame_offset); |
9eae7c52 TT |
3440 | if (!piece_end_p (new_data, end)) |
3441 | return data; | |
3442 | data = new_data; | |
3443 | ||
08922a10 SS |
3444 | b = block_for_pc (addr); |
3445 | ||
3446 | if (!b) | |
3447 | error (_("No block found for address for symbol \"%s\"."), | |
3448 | SYMBOL_PRINT_NAME (symbol)); | |
3449 | ||
3450 | framefunc = block_linkage_function (b); | |
3451 | ||
3452 | if (!framefunc) | |
3453 | error (_("No function found for block for symbol \"%s\"."), | |
3454 | SYMBOL_PRINT_NAME (symbol)); | |
3455 | ||
3456 | dwarf_expr_frame_base_1 (framefunc, addr, &base_data, &base_size); | |
3457 | ||
3458 | if (base_data[0] >= DW_OP_breg0 && base_data[0] <= DW_OP_breg31) | |
3459 | { | |
0d45f56e | 3460 | const gdb_byte *buf_end; |
08922a10 SS |
3461 | |
3462 | frame_reg = base_data[0] - DW_OP_breg0; | |
f664829e DE |
3463 | buf_end = safe_read_sleb128 (base_data + 1, base_data + base_size, |
3464 | &base_offset); | |
08922a10 | 3465 | if (buf_end != base_data + base_size) |
3e43a32a MS |
3466 | error (_("Unexpected opcode after " |
3467 | "DW_OP_breg%u for symbol \"%s\"."), | |
08922a10 SS |
3468 | frame_reg, SYMBOL_PRINT_NAME (symbol)); |
3469 | } | |
3470 | else if (base_data[0] >= DW_OP_reg0 && base_data[0] <= DW_OP_reg31) | |
3471 | { | |
3472 | /* The frame base is just the register, with no offset. */ | |
3473 | frame_reg = base_data[0] - DW_OP_reg0; | |
3474 | base_offset = 0; | |
3475 | } | |
3476 | else | |
3477 | { | |
3478 | /* We don't know what to do with the frame base expression, | |
3479 | so we can't trace this variable; give up. */ | |
7155d578 | 3480 | return save_data; |
08922a10 SS |
3481 | } |
3482 | ||
3e43a32a MS |
3483 | fprintf_filtered (stream, |
3484 | _("a variable at frame base reg $%s offset %s+%s"), | |
5e44ecb3 | 3485 | locexpr_regname (gdbarch, frame_reg), |
08922a10 SS |
3486 | plongest (base_offset), plongest (frame_offset)); |
3487 | } | |
9eae7c52 TT |
3488 | else if (data[0] >= DW_OP_breg0 && data[0] <= DW_OP_breg31 |
3489 | && piece_end_p (data, end)) | |
08922a10 | 3490 | { |
9fccedf7 | 3491 | int64_t offset; |
08922a10 | 3492 | |
f664829e | 3493 | data = safe_read_sleb128 (data + 1, end, &offset); |
08922a10 | 3494 | |
4c2df51b | 3495 | fprintf_filtered (stream, |
08922a10 SS |
3496 | _("a variable at offset %s from base reg $%s"), |
3497 | plongest (offset), | |
5e44ecb3 | 3498 | locexpr_regname (gdbarch, data[0] - DW_OP_breg0)); |
4c2df51b DJ |
3499 | } |
3500 | ||
c3228f12 EZ |
3501 | /* The location expression for a TLS variable looks like this (on a |
3502 | 64-bit LE machine): | |
3503 | ||
3504 | DW_AT_location : 10 byte block: 3 4 0 0 0 0 0 0 0 e0 | |
3505 | (DW_OP_addr: 4; DW_OP_GNU_push_tls_address) | |
09d8bd00 | 3506 | |
c3228f12 EZ |
3507 | 0x3 is the encoding for DW_OP_addr, which has an operand as long |
3508 | as the size of an address on the target machine (here is 8 | |
09d8bd00 TT |
3509 | bytes). Note that more recent version of GCC emit DW_OP_const4u |
3510 | or DW_OP_const8u, depending on address size, rather than | |
0963b4bd MS |
3511 | DW_OP_addr. 0xe0 is the encoding for DW_OP_GNU_push_tls_address. |
3512 | The operand represents the offset at which the variable is within | |
3513 | the thread local storage. */ | |
c3228f12 | 3514 | |
9eae7c52 | 3515 | else if (data + 1 + addr_size < end |
09d8bd00 TT |
3516 | && (data[0] == DW_OP_addr |
3517 | || (addr_size == 4 && data[0] == DW_OP_const4u) | |
3518 | || (addr_size == 8 && data[0] == DW_OP_const8u)) | |
9eae7c52 TT |
3519 | && data[1 + addr_size] == DW_OP_GNU_push_tls_address |
3520 | && piece_end_p (data + 2 + addr_size, end)) | |
08922a10 | 3521 | { |
d4a087c7 UW |
3522 | ULONGEST offset; |
3523 | offset = extract_unsigned_integer (data + 1, addr_size, | |
3524 | gdbarch_byte_order (gdbarch)); | |
9a619af0 | 3525 | |
08922a10 | 3526 | fprintf_filtered (stream, |
d4a087c7 | 3527 | _("a thread-local variable at offset 0x%s " |
08922a10 | 3528 | "in the thread-local storage for `%s'"), |
4262abfb | 3529 | phex_nz (offset, addr_size), objfile_name (objfile)); |
08922a10 SS |
3530 | |
3531 | data += 1 + addr_size + 1; | |
3532 | } | |
49f6c839 DE |
3533 | |
3534 | /* With -gsplit-dwarf a TLS variable can also look like this: | |
3535 | DW_AT_location : 3 byte block: fc 4 e0 | |
3536 | (DW_OP_GNU_const_index: 4; | |
3537 | DW_OP_GNU_push_tls_address) */ | |
3538 | else if (data + 3 <= end | |
3539 | && data + 1 + (leb128_size = skip_leb128 (data + 1, end)) < end | |
3540 | && data[0] == DW_OP_GNU_const_index | |
3541 | && leb128_size > 0 | |
3542 | && data[1 + leb128_size] == DW_OP_GNU_push_tls_address | |
3543 | && piece_end_p (data + 2 + leb128_size, end)) | |
3544 | { | |
a55c1f32 | 3545 | uint64_t offset; |
49f6c839 DE |
3546 | |
3547 | data = safe_read_uleb128 (data + 1, end, &offset); | |
3548 | offset = dwarf2_read_addr_index (per_cu, offset); | |
3549 | fprintf_filtered (stream, | |
3550 | _("a thread-local variable at offset 0x%s " | |
3551 | "in the thread-local storage for `%s'"), | |
4262abfb | 3552 | phex_nz (offset, addr_size), objfile_name (objfile)); |
49f6c839 DE |
3553 | ++data; |
3554 | } | |
3555 | ||
9eae7c52 TT |
3556 | else if (data[0] >= DW_OP_lit0 |
3557 | && data[0] <= DW_OP_lit31 | |
3558 | && data + 1 < end | |
3559 | && data[1] == DW_OP_stack_value) | |
3560 | { | |
3561 | fprintf_filtered (stream, _("the constant %d"), data[0] - DW_OP_lit0); | |
3562 | data += 2; | |
3563 | } | |
3564 | ||
3565 | return data; | |
3566 | } | |
3567 | ||
3568 | /* Disassemble an expression, stopping at the end of a piece or at the | |
3569 | end of the expression. Returns a pointer to the next unread byte | |
3570 | in the input expression. If ALL is nonzero, then this function | |
f664829e DE |
3571 | will keep going until it reaches the end of the expression. |
3572 | If there is an error during reading, e.g. we run off the end | |
3573 | of the buffer, an error is thrown. */ | |
9eae7c52 TT |
3574 | |
3575 | static const gdb_byte * | |
3576 | disassemble_dwarf_expression (struct ui_file *stream, | |
3577 | struct gdbarch *arch, unsigned int addr_size, | |
2bda9cc5 | 3578 | int offset_size, const gdb_byte *start, |
9eae7c52 | 3579 | const gdb_byte *data, const gdb_byte *end, |
2bda9cc5 | 3580 | int indent, int all, |
5e44ecb3 | 3581 | struct dwarf2_per_cu_data *per_cu) |
9eae7c52 | 3582 | { |
9eae7c52 TT |
3583 | while (data < end |
3584 | && (all | |
3585 | || (data[0] != DW_OP_piece && data[0] != DW_OP_bit_piece))) | |
3586 | { | |
3587 | enum dwarf_location_atom op = *data++; | |
9fccedf7 DE |
3588 | uint64_t ul; |
3589 | int64_t l; | |
9eae7c52 TT |
3590 | const char *name; |
3591 | ||
f39c6ffd | 3592 | name = get_DW_OP_name (op); |
9eae7c52 TT |
3593 | |
3594 | if (!name) | |
3595 | error (_("Unrecognized DWARF opcode 0x%02x at %ld"), | |
06826322 | 3596 | op, (long) (data - 1 - start)); |
2bda9cc5 JK |
3597 | fprintf_filtered (stream, " %*ld: %s", indent + 4, |
3598 | (long) (data - 1 - start), name); | |
9eae7c52 TT |
3599 | |
3600 | switch (op) | |
3601 | { | |
3602 | case DW_OP_addr: | |
d4a087c7 UW |
3603 | ul = extract_unsigned_integer (data, addr_size, |
3604 | gdbarch_byte_order (arch)); | |
9eae7c52 | 3605 | data += addr_size; |
d4a087c7 | 3606 | fprintf_filtered (stream, " 0x%s", phex_nz (ul, addr_size)); |
9eae7c52 TT |
3607 | break; |
3608 | ||
3609 | case DW_OP_const1u: | |
3610 | ul = extract_unsigned_integer (data, 1, gdbarch_byte_order (arch)); | |
3611 | data += 1; | |
3612 | fprintf_filtered (stream, " %s", pulongest (ul)); | |
3613 | break; | |
3614 | case DW_OP_const1s: | |
3615 | l = extract_signed_integer (data, 1, gdbarch_byte_order (arch)); | |
3616 | data += 1; | |
3617 | fprintf_filtered (stream, " %s", plongest (l)); | |
3618 | break; | |
3619 | case DW_OP_const2u: | |
3620 | ul = extract_unsigned_integer (data, 2, gdbarch_byte_order (arch)); | |
3621 | data += 2; | |
3622 | fprintf_filtered (stream, " %s", pulongest (ul)); | |
3623 | break; | |
3624 | case DW_OP_const2s: | |
3625 | l = extract_signed_integer (data, 2, gdbarch_byte_order (arch)); | |
3626 | data += 2; | |
3627 | fprintf_filtered (stream, " %s", plongest (l)); | |
3628 | break; | |
3629 | case DW_OP_const4u: | |
3630 | ul = extract_unsigned_integer (data, 4, gdbarch_byte_order (arch)); | |
3631 | data += 4; | |
3632 | fprintf_filtered (stream, " %s", pulongest (ul)); | |
3633 | break; | |
3634 | case DW_OP_const4s: | |
3635 | l = extract_signed_integer (data, 4, gdbarch_byte_order (arch)); | |
3636 | data += 4; | |
3637 | fprintf_filtered (stream, " %s", plongest (l)); | |
3638 | break; | |
3639 | case DW_OP_const8u: | |
3640 | ul = extract_unsigned_integer (data, 8, gdbarch_byte_order (arch)); | |
3641 | data += 8; | |
3642 | fprintf_filtered (stream, " %s", pulongest (ul)); | |
3643 | break; | |
3644 | case DW_OP_const8s: | |
3645 | l = extract_signed_integer (data, 8, gdbarch_byte_order (arch)); | |
3646 | data += 8; | |
3647 | fprintf_filtered (stream, " %s", plongest (l)); | |
3648 | break; | |
3649 | case DW_OP_constu: | |
f664829e | 3650 | data = safe_read_uleb128 (data, end, &ul); |
9eae7c52 TT |
3651 | fprintf_filtered (stream, " %s", pulongest (ul)); |
3652 | break; | |
3653 | case DW_OP_consts: | |
f664829e | 3654 | data = safe_read_sleb128 (data, end, &l); |
9eae7c52 TT |
3655 | fprintf_filtered (stream, " %s", plongest (l)); |
3656 | break; | |
3657 | ||
3658 | case DW_OP_reg0: | |
3659 | case DW_OP_reg1: | |
3660 | case DW_OP_reg2: | |
3661 | case DW_OP_reg3: | |
3662 | case DW_OP_reg4: | |
3663 | case DW_OP_reg5: | |
3664 | case DW_OP_reg6: | |
3665 | case DW_OP_reg7: | |
3666 | case DW_OP_reg8: | |
3667 | case DW_OP_reg9: | |
3668 | case DW_OP_reg10: | |
3669 | case DW_OP_reg11: | |
3670 | case DW_OP_reg12: | |
3671 | case DW_OP_reg13: | |
3672 | case DW_OP_reg14: | |
3673 | case DW_OP_reg15: | |
3674 | case DW_OP_reg16: | |
3675 | case DW_OP_reg17: | |
3676 | case DW_OP_reg18: | |
3677 | case DW_OP_reg19: | |
3678 | case DW_OP_reg20: | |
3679 | case DW_OP_reg21: | |
3680 | case DW_OP_reg22: | |
3681 | case DW_OP_reg23: | |
3682 | case DW_OP_reg24: | |
3683 | case DW_OP_reg25: | |
3684 | case DW_OP_reg26: | |
3685 | case DW_OP_reg27: | |
3686 | case DW_OP_reg28: | |
3687 | case DW_OP_reg29: | |
3688 | case DW_OP_reg30: | |
3689 | case DW_OP_reg31: | |
3690 | fprintf_filtered (stream, " [$%s]", | |
5e44ecb3 | 3691 | locexpr_regname (arch, op - DW_OP_reg0)); |
9eae7c52 TT |
3692 | break; |
3693 | ||
3694 | case DW_OP_regx: | |
f664829e | 3695 | data = safe_read_uleb128 (data, end, &ul); |
9eae7c52 | 3696 | fprintf_filtered (stream, " %s [$%s]", pulongest (ul), |
5e44ecb3 | 3697 | locexpr_regname (arch, (int) ul)); |
9eae7c52 TT |
3698 | break; |
3699 | ||
3700 | case DW_OP_implicit_value: | |
f664829e | 3701 | data = safe_read_uleb128 (data, end, &ul); |
9eae7c52 TT |
3702 | data += ul; |
3703 | fprintf_filtered (stream, " %s", pulongest (ul)); | |
3704 | break; | |
3705 | ||
3706 | case DW_OP_breg0: | |
3707 | case DW_OP_breg1: | |
3708 | case DW_OP_breg2: | |
3709 | case DW_OP_breg3: | |
3710 | case DW_OP_breg4: | |
3711 | case DW_OP_breg5: | |
3712 | case DW_OP_breg6: | |
3713 | case DW_OP_breg7: | |
3714 | case DW_OP_breg8: | |
3715 | case DW_OP_breg9: | |
3716 | case DW_OP_breg10: | |
3717 | case DW_OP_breg11: | |
3718 | case DW_OP_breg12: | |
3719 | case DW_OP_breg13: | |
3720 | case DW_OP_breg14: | |
3721 | case DW_OP_breg15: | |
3722 | case DW_OP_breg16: | |
3723 | case DW_OP_breg17: | |
3724 | case DW_OP_breg18: | |
3725 | case DW_OP_breg19: | |
3726 | case DW_OP_breg20: | |
3727 | case DW_OP_breg21: | |
3728 | case DW_OP_breg22: | |
3729 | case DW_OP_breg23: | |
3730 | case DW_OP_breg24: | |
3731 | case DW_OP_breg25: | |
3732 | case DW_OP_breg26: | |
3733 | case DW_OP_breg27: | |
3734 | case DW_OP_breg28: | |
3735 | case DW_OP_breg29: | |
3736 | case DW_OP_breg30: | |
3737 | case DW_OP_breg31: | |
f664829e | 3738 | data = safe_read_sleb128 (data, end, &l); |
0502ed8c | 3739 | fprintf_filtered (stream, " %s [$%s]", plongest (l), |
5e44ecb3 | 3740 | locexpr_regname (arch, op - DW_OP_breg0)); |
9eae7c52 TT |
3741 | break; |
3742 | ||
3743 | case DW_OP_bregx: | |
f664829e DE |
3744 | data = safe_read_uleb128 (data, end, &ul); |
3745 | data = safe_read_sleb128 (data, end, &l); | |
0502ed8c JK |
3746 | fprintf_filtered (stream, " register %s [$%s] offset %s", |
3747 | pulongest (ul), | |
5e44ecb3 | 3748 | locexpr_regname (arch, (int) ul), |
0502ed8c | 3749 | plongest (l)); |
9eae7c52 TT |
3750 | break; |
3751 | ||
3752 | case DW_OP_fbreg: | |
f664829e | 3753 | data = safe_read_sleb128 (data, end, &l); |
0502ed8c | 3754 | fprintf_filtered (stream, " %s", plongest (l)); |
9eae7c52 TT |
3755 | break; |
3756 | ||
3757 | case DW_OP_xderef_size: | |
3758 | case DW_OP_deref_size: | |
3759 | case DW_OP_pick: | |
3760 | fprintf_filtered (stream, " %d", *data); | |
3761 | ++data; | |
3762 | break; | |
3763 | ||
3764 | case DW_OP_plus_uconst: | |
f664829e | 3765 | data = safe_read_uleb128 (data, end, &ul); |
9eae7c52 TT |
3766 | fprintf_filtered (stream, " %s", pulongest (ul)); |
3767 | break; | |
3768 | ||
3769 | case DW_OP_skip: | |
3770 | l = extract_signed_integer (data, 2, gdbarch_byte_order (arch)); | |
3771 | data += 2; | |
3772 | fprintf_filtered (stream, " to %ld", | |
3773 | (long) (data + l - start)); | |
3774 | break; | |
3775 | ||
3776 | case DW_OP_bra: | |
3777 | l = extract_signed_integer (data, 2, gdbarch_byte_order (arch)); | |
3778 | data += 2; | |
3779 | fprintf_filtered (stream, " %ld", | |
3780 | (long) (data + l - start)); | |
3781 | break; | |
3782 | ||
3783 | case DW_OP_call2: | |
3784 | ul = extract_unsigned_integer (data, 2, gdbarch_byte_order (arch)); | |
3785 | data += 2; | |
3786 | fprintf_filtered (stream, " offset %s", phex_nz (ul, 2)); | |
3787 | break; | |
3788 | ||
3789 | case DW_OP_call4: | |
3790 | ul = extract_unsigned_integer (data, 4, gdbarch_byte_order (arch)); | |
3791 | data += 4; | |
3792 | fprintf_filtered (stream, " offset %s", phex_nz (ul, 4)); | |
3793 | break; | |
3794 | ||
3795 | case DW_OP_call_ref: | |
3796 | ul = extract_unsigned_integer (data, offset_size, | |
3797 | gdbarch_byte_order (arch)); | |
3798 | data += offset_size; | |
3799 | fprintf_filtered (stream, " offset %s", phex_nz (ul, offset_size)); | |
3800 | break; | |
3801 | ||
3802 | case DW_OP_piece: | |
f664829e | 3803 | data = safe_read_uleb128 (data, end, &ul); |
9eae7c52 TT |
3804 | fprintf_filtered (stream, " %s (bytes)", pulongest (ul)); |
3805 | break; | |
3806 | ||
3807 | case DW_OP_bit_piece: | |
3808 | { | |
9fccedf7 | 3809 | uint64_t offset; |
9eae7c52 | 3810 | |
f664829e DE |
3811 | data = safe_read_uleb128 (data, end, &ul); |
3812 | data = safe_read_uleb128 (data, end, &offset); | |
9eae7c52 TT |
3813 | fprintf_filtered (stream, " size %s offset %s (bits)", |
3814 | pulongest (ul), pulongest (offset)); | |
3815 | } | |
3816 | break; | |
8cf6f0b1 TT |
3817 | |
3818 | case DW_OP_GNU_implicit_pointer: | |
3819 | { | |
3820 | ul = extract_unsigned_integer (data, offset_size, | |
3821 | gdbarch_byte_order (arch)); | |
3822 | data += offset_size; | |
3823 | ||
f664829e | 3824 | data = safe_read_sleb128 (data, end, &l); |
8cf6f0b1 TT |
3825 | |
3826 | fprintf_filtered (stream, " DIE %s offset %s", | |
3827 | phex_nz (ul, offset_size), | |
3828 | plongest (l)); | |
3829 | } | |
3830 | break; | |
5e44ecb3 TT |
3831 | |
3832 | case DW_OP_GNU_deref_type: | |
3833 | { | |
3834 | int addr_size = *data++; | |
b64f50a1 | 3835 | cu_offset offset; |
5e44ecb3 TT |
3836 | struct type *type; |
3837 | ||
f664829e | 3838 | data = safe_read_uleb128 (data, end, &ul); |
b64f50a1 | 3839 | offset.cu_off = ul; |
5e44ecb3 TT |
3840 | type = dwarf2_get_die_type (offset, per_cu); |
3841 | fprintf_filtered (stream, "<"); | |
3842 | type_print (type, "", stream, -1); | |
b64f50a1 | 3843 | fprintf_filtered (stream, " [0x%s]> %d", phex_nz (offset.cu_off, 0), |
5e44ecb3 TT |
3844 | addr_size); |
3845 | } | |
3846 | break; | |
3847 | ||
3848 | case DW_OP_GNU_const_type: | |
3849 | { | |
b64f50a1 | 3850 | cu_offset type_die; |
5e44ecb3 TT |
3851 | struct type *type; |
3852 | ||
f664829e | 3853 | data = safe_read_uleb128 (data, end, &ul); |
b64f50a1 | 3854 | type_die.cu_off = ul; |
5e44ecb3 TT |
3855 | type = dwarf2_get_die_type (type_die, per_cu); |
3856 | fprintf_filtered (stream, "<"); | |
3857 | type_print (type, "", stream, -1); | |
b64f50a1 | 3858 | fprintf_filtered (stream, " [0x%s]>", phex_nz (type_die.cu_off, 0)); |
5e44ecb3 TT |
3859 | } |
3860 | break; | |
3861 | ||
3862 | case DW_OP_GNU_regval_type: | |
3863 | { | |
9fccedf7 | 3864 | uint64_t reg; |
b64f50a1 | 3865 | cu_offset type_die; |
5e44ecb3 TT |
3866 | struct type *type; |
3867 | ||
f664829e DE |
3868 | data = safe_read_uleb128 (data, end, ®); |
3869 | data = safe_read_uleb128 (data, end, &ul); | |
b64f50a1 | 3870 | type_die.cu_off = ul; |
5e44ecb3 TT |
3871 | |
3872 | type = dwarf2_get_die_type (type_die, per_cu); | |
3873 | fprintf_filtered (stream, "<"); | |
3874 | type_print (type, "", stream, -1); | |
b64f50a1 JK |
3875 | fprintf_filtered (stream, " [0x%s]> [$%s]", |
3876 | phex_nz (type_die.cu_off, 0), | |
5e44ecb3 TT |
3877 | locexpr_regname (arch, reg)); |
3878 | } | |
3879 | break; | |
3880 | ||
3881 | case DW_OP_GNU_convert: | |
3882 | case DW_OP_GNU_reinterpret: | |
3883 | { | |
b64f50a1 | 3884 | cu_offset type_die; |
5e44ecb3 | 3885 | |
f664829e | 3886 | data = safe_read_uleb128 (data, end, &ul); |
b64f50a1 | 3887 | type_die.cu_off = ul; |
5e44ecb3 | 3888 | |
b64f50a1 | 3889 | if (type_die.cu_off == 0) |
5e44ecb3 TT |
3890 | fprintf_filtered (stream, "<0>"); |
3891 | else | |
3892 | { | |
3893 | struct type *type; | |
3894 | ||
3895 | type = dwarf2_get_die_type (type_die, per_cu); | |
3896 | fprintf_filtered (stream, "<"); | |
3897 | type_print (type, "", stream, -1); | |
b64f50a1 | 3898 | fprintf_filtered (stream, " [0x%s]>", phex_nz (type_die.cu_off, 0)); |
5e44ecb3 TT |
3899 | } |
3900 | } | |
3901 | break; | |
2bda9cc5 JK |
3902 | |
3903 | case DW_OP_GNU_entry_value: | |
f664829e | 3904 | data = safe_read_uleb128 (data, end, &ul); |
2bda9cc5 JK |
3905 | fputc_filtered ('\n', stream); |
3906 | disassemble_dwarf_expression (stream, arch, addr_size, offset_size, | |
3907 | start, data, data + ul, indent + 2, | |
3908 | all, per_cu); | |
3909 | data += ul; | |
3910 | continue; | |
49f6c839 | 3911 | |
a24f71ab JK |
3912 | case DW_OP_GNU_parameter_ref: |
3913 | ul = extract_unsigned_integer (data, 4, gdbarch_byte_order (arch)); | |
3914 | data += 4; | |
3915 | fprintf_filtered (stream, " offset %s", phex_nz (ul, 4)); | |
3916 | break; | |
3917 | ||
49f6c839 DE |
3918 | case DW_OP_GNU_addr_index: |
3919 | data = safe_read_uleb128 (data, end, &ul); | |
3920 | ul = dwarf2_read_addr_index (per_cu, ul); | |
3921 | fprintf_filtered (stream, " 0x%s", phex_nz (ul, addr_size)); | |
3922 | break; | |
3923 | case DW_OP_GNU_const_index: | |
3924 | data = safe_read_uleb128 (data, end, &ul); | |
3925 | ul = dwarf2_read_addr_index (per_cu, ul); | |
3926 | fprintf_filtered (stream, " %s", pulongest (ul)); | |
3927 | break; | |
9eae7c52 TT |
3928 | } |
3929 | ||
3930 | fprintf_filtered (stream, "\n"); | |
3931 | } | |
c3228f12 | 3932 | |
08922a10 | 3933 | return data; |
4c2df51b DJ |
3934 | } |
3935 | ||
08922a10 SS |
3936 | /* Describe a single location, which may in turn consist of multiple |
3937 | pieces. */ | |
a55cc764 | 3938 | |
08922a10 SS |
3939 | static void |
3940 | locexpr_describe_location_1 (struct symbol *symbol, CORE_ADDR addr, | |
0d45f56e | 3941 | struct ui_file *stream, |
56eb65bd | 3942 | const gdb_byte *data, size_t size, |
9eae7c52 | 3943 | struct objfile *objfile, unsigned int addr_size, |
5e44ecb3 | 3944 | int offset_size, struct dwarf2_per_cu_data *per_cu) |
08922a10 | 3945 | { |
0d45f56e | 3946 | const gdb_byte *end = data + size; |
9eae7c52 | 3947 | int first_piece = 1, bad = 0; |
08922a10 | 3948 | |
08922a10 SS |
3949 | while (data < end) |
3950 | { | |
9eae7c52 TT |
3951 | const gdb_byte *here = data; |
3952 | int disassemble = 1; | |
3953 | ||
3954 | if (first_piece) | |
3955 | first_piece = 0; | |
3956 | else | |
3957 | fprintf_filtered (stream, _(", and ")); | |
08922a10 | 3958 | |
9eae7c52 TT |
3959 | if (!dwarf2_always_disassemble) |
3960 | { | |
3e43a32a | 3961 | data = locexpr_describe_location_piece (symbol, stream, |
49f6c839 | 3962 | addr, objfile, per_cu, |
9eae7c52 TT |
3963 | data, end, addr_size); |
3964 | /* If we printed anything, or if we have an empty piece, | |
3965 | then don't disassemble. */ | |
3966 | if (data != here | |
3967 | || data[0] == DW_OP_piece | |
3968 | || data[0] == DW_OP_bit_piece) | |
3969 | disassemble = 0; | |
08922a10 | 3970 | } |
9eae7c52 | 3971 | if (disassemble) |
2bda9cc5 JK |
3972 | { |
3973 | fprintf_filtered (stream, _("a complex DWARF expression:\n")); | |
3974 | data = disassemble_dwarf_expression (stream, | |
3975 | get_objfile_arch (objfile), | |
3976 | addr_size, offset_size, data, | |
3977 | data, end, 0, | |
3978 | dwarf2_always_disassemble, | |
3979 | per_cu); | |
3980 | } | |
9eae7c52 TT |
3981 | |
3982 | if (data < end) | |
08922a10 | 3983 | { |
9eae7c52 | 3984 | int empty = data == here; |
08922a10 | 3985 | |
9eae7c52 TT |
3986 | if (disassemble) |
3987 | fprintf_filtered (stream, " "); | |
3988 | if (data[0] == DW_OP_piece) | |
3989 | { | |
9fccedf7 | 3990 | uint64_t bytes; |
08922a10 | 3991 | |
f664829e | 3992 | data = safe_read_uleb128 (data + 1, end, &bytes); |
08922a10 | 3993 | |
9eae7c52 TT |
3994 | if (empty) |
3995 | fprintf_filtered (stream, _("an empty %s-byte piece"), | |
3996 | pulongest (bytes)); | |
3997 | else | |
3998 | fprintf_filtered (stream, _(" [%s-byte piece]"), | |
3999 | pulongest (bytes)); | |
4000 | } | |
4001 | else if (data[0] == DW_OP_bit_piece) | |
4002 | { | |
9fccedf7 | 4003 | uint64_t bits, offset; |
9eae7c52 | 4004 | |
f664829e DE |
4005 | data = safe_read_uleb128 (data + 1, end, &bits); |
4006 | data = safe_read_uleb128 (data, end, &offset); | |
9eae7c52 TT |
4007 | |
4008 | if (empty) | |
4009 | fprintf_filtered (stream, | |
4010 | _("an empty %s-bit piece"), | |
4011 | pulongest (bits)); | |
4012 | else | |
4013 | fprintf_filtered (stream, | |
4014 | _(" [%s-bit piece, offset %s bits]"), | |
4015 | pulongest (bits), pulongest (offset)); | |
4016 | } | |
4017 | else | |
4018 | { | |
4019 | bad = 1; | |
4020 | break; | |
4021 | } | |
08922a10 SS |
4022 | } |
4023 | } | |
4024 | ||
4025 | if (bad || data > end) | |
4026 | error (_("Corrupted DWARF2 expression for \"%s\"."), | |
4027 | SYMBOL_PRINT_NAME (symbol)); | |
4028 | } | |
4029 | ||
4030 | /* Print a natural-language description of SYMBOL to STREAM. This | |
4031 | version is for a symbol with a single location. */ | |
a55cc764 | 4032 | |
08922a10 SS |
4033 | static void |
4034 | locexpr_describe_location (struct symbol *symbol, CORE_ADDR addr, | |
4035 | struct ui_file *stream) | |
4036 | { | |
4037 | struct dwarf2_locexpr_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); | |
4038 | struct objfile *objfile = dwarf2_per_cu_objfile (dlbaton->per_cu); | |
4039 | unsigned int addr_size = dwarf2_per_cu_addr_size (dlbaton->per_cu); | |
9eae7c52 | 4040 | int offset_size = dwarf2_per_cu_offset_size (dlbaton->per_cu); |
08922a10 | 4041 | |
3e43a32a MS |
4042 | locexpr_describe_location_1 (symbol, addr, stream, |
4043 | dlbaton->data, dlbaton->size, | |
5e44ecb3 TT |
4044 | objfile, addr_size, offset_size, |
4045 | dlbaton->per_cu); | |
08922a10 SS |
4046 | } |
4047 | ||
4048 | /* Describe the location of SYMBOL as an agent value in VALUE, generating | |
4049 | any necessary bytecode in AX. */ | |
a55cc764 | 4050 | |
0d53c4c4 | 4051 | static void |
505e835d UW |
4052 | locexpr_tracepoint_var_ref (struct symbol *symbol, struct gdbarch *gdbarch, |
4053 | struct agent_expr *ax, struct axs_value *value) | |
a55cc764 DJ |
4054 | { |
4055 | struct dwarf2_locexpr_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); | |
3cf03773 | 4056 | unsigned int addr_size = dwarf2_per_cu_addr_size (dlbaton->per_cu); |
a55cc764 | 4057 | |
1d6edc3c | 4058 | if (dlbaton->size == 0) |
cabe9ab6 PA |
4059 | value->optimized_out = 1; |
4060 | else | |
9f6f94ff TT |
4061 | dwarf2_compile_expr_to_ax (ax, value, gdbarch, addr_size, |
4062 | dlbaton->data, dlbaton->data + dlbaton->size, | |
4063 | dlbaton->per_cu); | |
a55cc764 DJ |
4064 | } |
4065 | ||
4c2df51b DJ |
4066 | /* The set of location functions used with the DWARF-2 expression |
4067 | evaluator. */ | |
768a979c | 4068 | const struct symbol_computed_ops dwarf2_locexpr_funcs = { |
4c2df51b | 4069 | locexpr_read_variable, |
e18b2753 | 4070 | locexpr_read_variable_at_entry, |
4c2df51b DJ |
4071 | locexpr_read_needs_frame, |
4072 | locexpr_describe_location, | |
f1e6e072 | 4073 | 0, /* location_has_loclist */ |
a55cc764 | 4074 | locexpr_tracepoint_var_ref |
4c2df51b | 4075 | }; |
0d53c4c4 DJ |
4076 | |
4077 | ||
4078 | /* Wrapper functions for location lists. These generally find | |
4079 | the appropriate location expression and call something above. */ | |
4080 | ||
4081 | /* Return the value of SYMBOL in FRAME using the DWARF-2 expression | |
4082 | evaluator to calculate the location. */ | |
4083 | static struct value * | |
4084 | loclist_read_variable (struct symbol *symbol, struct frame_info *frame) | |
4085 | { | |
4086 | struct dwarf2_loclist_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); | |
4087 | struct value *val; | |
947bb88f | 4088 | const gdb_byte *data; |
b6b08ebf | 4089 | size_t size; |
8cf6f0b1 | 4090 | CORE_ADDR pc = frame ? get_frame_address_in_block (frame) : 0; |
0d53c4c4 | 4091 | |
8cf6f0b1 | 4092 | data = dwarf2_find_location_expression (dlbaton, &size, pc); |
1d6edc3c JK |
4093 | val = dwarf2_evaluate_loc_desc (SYMBOL_TYPE (symbol), frame, data, size, |
4094 | dlbaton->per_cu); | |
0d53c4c4 DJ |
4095 | |
4096 | return val; | |
4097 | } | |
4098 | ||
e18b2753 JK |
4099 | /* Read variable SYMBOL like loclist_read_variable at (callee) FRAME's function |
4100 | entry. SYMBOL should be a function parameter, otherwise NO_ENTRY_VALUE_ERROR | |
4101 | will be thrown. | |
4102 | ||
4103 | Function always returns non-NULL value, it may be marked optimized out if | |
4104 | inferior frame information is not available. It throws NO_ENTRY_VALUE_ERROR | |
4105 | if it cannot resolve the parameter for any reason. */ | |
4106 | ||
4107 | static struct value * | |
4108 | loclist_read_variable_at_entry (struct symbol *symbol, struct frame_info *frame) | |
4109 | { | |
4110 | struct dwarf2_loclist_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); | |
4111 | const gdb_byte *data; | |
4112 | size_t size; | |
4113 | CORE_ADDR pc; | |
4114 | ||
4115 | if (frame == NULL || !get_frame_func_if_available (frame, &pc)) | |
4116 | return allocate_optimized_out_value (SYMBOL_TYPE (symbol)); | |
4117 | ||
4118 | data = dwarf2_find_location_expression (dlbaton, &size, pc); | |
4119 | if (data == NULL) | |
4120 | return allocate_optimized_out_value (SYMBOL_TYPE (symbol)); | |
4121 | ||
4122 | return value_of_dwarf_block_entry (SYMBOL_TYPE (symbol), frame, data, size); | |
4123 | } | |
4124 | ||
0d53c4c4 DJ |
4125 | /* Return non-zero iff we need a frame to evaluate SYMBOL. */ |
4126 | static int | |
4127 | loclist_read_needs_frame (struct symbol *symbol) | |
4128 | { | |
4129 | /* If there's a location list, then assume we need to have a frame | |
4130 | to choose the appropriate location expression. With tracking of | |
4131 | global variables this is not necessarily true, but such tracking | |
4132 | is disabled in GCC at the moment until we figure out how to | |
4133 | represent it. */ | |
4134 | ||
4135 | return 1; | |
4136 | } | |
4137 | ||
08922a10 SS |
4138 | /* Print a natural-language description of SYMBOL to STREAM. This |
4139 | version applies when there is a list of different locations, each | |
4140 | with a specified address range. */ | |
4141 | ||
4142 | static void | |
4143 | loclist_describe_location (struct symbol *symbol, CORE_ADDR addr, | |
4144 | struct ui_file *stream) | |
0d53c4c4 | 4145 | { |
08922a10 | 4146 | struct dwarf2_loclist_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); |
947bb88f | 4147 | const gdb_byte *loc_ptr, *buf_end; |
08922a10 SS |
4148 | struct objfile *objfile = dwarf2_per_cu_objfile (dlbaton->per_cu); |
4149 | struct gdbarch *gdbarch = get_objfile_arch (objfile); | |
4150 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); | |
4151 | unsigned int addr_size = dwarf2_per_cu_addr_size (dlbaton->per_cu); | |
9eae7c52 | 4152 | int offset_size = dwarf2_per_cu_offset_size (dlbaton->per_cu); |
d4a087c7 | 4153 | int signed_addr_p = bfd_get_sign_extend_vma (objfile->obfd); |
08922a10 | 4154 | /* Adjust base_address for relocatable objects. */ |
9aa1f1e3 | 4155 | CORE_ADDR base_offset = dwarf2_per_cu_text_offset (dlbaton->per_cu); |
08922a10 | 4156 | CORE_ADDR base_address = dlbaton->base_address + base_offset; |
f664829e | 4157 | int done = 0; |
08922a10 SS |
4158 | |
4159 | loc_ptr = dlbaton->data; | |
4160 | buf_end = dlbaton->data + dlbaton->size; | |
4161 | ||
9eae7c52 | 4162 | fprintf_filtered (stream, _("multi-location:\n")); |
08922a10 SS |
4163 | |
4164 | /* Iterate through locations until we run out. */ | |
f664829e | 4165 | while (!done) |
08922a10 | 4166 | { |
f664829e DE |
4167 | CORE_ADDR low = 0, high = 0; /* init for gcc -Wall */ |
4168 | int length; | |
4169 | enum debug_loc_kind kind; | |
4170 | const gdb_byte *new_ptr = NULL; /* init for gcc -Wall */ | |
4171 | ||
4172 | if (dlbaton->from_dwo) | |
4173 | kind = decode_debug_loc_dwo_addresses (dlbaton->per_cu, | |
4174 | loc_ptr, buf_end, &new_ptr, | |
3771a44c | 4175 | &low, &high, byte_order); |
d4a087c7 | 4176 | else |
f664829e DE |
4177 | kind = decode_debug_loc_addresses (loc_ptr, buf_end, &new_ptr, |
4178 | &low, &high, | |
4179 | byte_order, addr_size, | |
4180 | signed_addr_p); | |
4181 | loc_ptr = new_ptr; | |
4182 | switch (kind) | |
08922a10 | 4183 | { |
f664829e DE |
4184 | case DEBUG_LOC_END_OF_LIST: |
4185 | done = 1; | |
4186 | continue; | |
4187 | case DEBUG_LOC_BASE_ADDRESS: | |
d4a087c7 | 4188 | base_address = high + base_offset; |
9eae7c52 | 4189 | fprintf_filtered (stream, _(" Base address %s"), |
08922a10 | 4190 | paddress (gdbarch, base_address)); |
08922a10 | 4191 | continue; |
3771a44c DE |
4192 | case DEBUG_LOC_START_END: |
4193 | case DEBUG_LOC_START_LENGTH: | |
f664829e DE |
4194 | break; |
4195 | case DEBUG_LOC_BUFFER_OVERFLOW: | |
4196 | case DEBUG_LOC_INVALID_ENTRY: | |
4197 | error (_("Corrupted DWARF expression for symbol \"%s\"."), | |
4198 | SYMBOL_PRINT_NAME (symbol)); | |
4199 | default: | |
4200 | gdb_assert_not_reached ("bad debug_loc_kind"); | |
08922a10 SS |
4201 | } |
4202 | ||
08922a10 SS |
4203 | /* Otherwise, a location expression entry. */ |
4204 | low += base_address; | |
4205 | high += base_address; | |
4206 | ||
4207 | length = extract_unsigned_integer (loc_ptr, 2, byte_order); | |
4208 | loc_ptr += 2; | |
4209 | ||
08922a10 SS |
4210 | /* (It would improve readability to print only the minimum |
4211 | necessary digits of the second number of the range.) */ | |
9eae7c52 | 4212 | fprintf_filtered (stream, _(" Range %s-%s: "), |
08922a10 SS |
4213 | paddress (gdbarch, low), paddress (gdbarch, high)); |
4214 | ||
4215 | /* Now describe this particular location. */ | |
4216 | locexpr_describe_location_1 (symbol, low, stream, loc_ptr, length, | |
5e44ecb3 TT |
4217 | objfile, addr_size, offset_size, |
4218 | dlbaton->per_cu); | |
9eae7c52 TT |
4219 | |
4220 | fprintf_filtered (stream, "\n"); | |
08922a10 SS |
4221 | |
4222 | loc_ptr += length; | |
4223 | } | |
0d53c4c4 DJ |
4224 | } |
4225 | ||
4226 | /* Describe the location of SYMBOL as an agent value in VALUE, generating | |
4227 | any necessary bytecode in AX. */ | |
4228 | static void | |
505e835d UW |
4229 | loclist_tracepoint_var_ref (struct symbol *symbol, struct gdbarch *gdbarch, |
4230 | struct agent_expr *ax, struct axs_value *value) | |
0d53c4c4 DJ |
4231 | { |
4232 | struct dwarf2_loclist_baton *dlbaton = SYMBOL_LOCATION_BATON (symbol); | |
947bb88f | 4233 | const gdb_byte *data; |
b6b08ebf | 4234 | size_t size; |
3cf03773 | 4235 | unsigned int addr_size = dwarf2_per_cu_addr_size (dlbaton->per_cu); |
0d53c4c4 | 4236 | |
8cf6f0b1 | 4237 | data = dwarf2_find_location_expression (dlbaton, &size, ax->scope); |
1d6edc3c | 4238 | if (size == 0) |
cabe9ab6 PA |
4239 | value->optimized_out = 1; |
4240 | else | |
9f6f94ff TT |
4241 | dwarf2_compile_expr_to_ax (ax, value, gdbarch, addr_size, data, data + size, |
4242 | dlbaton->per_cu); | |
0d53c4c4 DJ |
4243 | } |
4244 | ||
4245 | /* The set of location functions used with the DWARF-2 expression | |
4246 | evaluator and location lists. */ | |
768a979c | 4247 | const struct symbol_computed_ops dwarf2_loclist_funcs = { |
0d53c4c4 | 4248 | loclist_read_variable, |
e18b2753 | 4249 | loclist_read_variable_at_entry, |
0d53c4c4 DJ |
4250 | loclist_read_needs_frame, |
4251 | loclist_describe_location, | |
f1e6e072 | 4252 | 1, /* location_has_loclist */ |
0d53c4c4 DJ |
4253 | loclist_tracepoint_var_ref |
4254 | }; | |
8e3b41a9 | 4255 | |
70221824 PA |
4256 | /* Provide a prototype to silence -Wmissing-prototypes. */ |
4257 | extern initialize_file_ftype _initialize_dwarf2loc; | |
4258 | ||
8e3b41a9 JK |
4259 | void |
4260 | _initialize_dwarf2loc (void) | |
4261 | { | |
ccce17b0 YQ |
4262 | add_setshow_zuinteger_cmd ("entry-values", class_maintenance, |
4263 | &entry_values_debug, | |
4264 | _("Set entry values and tail call frames " | |
4265 | "debugging."), | |
4266 | _("Show entry values and tail call frames " | |
4267 | "debugging."), | |
4268 | _("When non-zero, the process of determining " | |
4269 | "parameter values from function entry point " | |
4270 | "and tail call frames will be printed."), | |
4271 | NULL, | |
4272 | show_entry_values_debug, | |
4273 | &setdebuglist, &showdebuglist); | |
8e3b41a9 | 4274 | } |