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