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