Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Find a variable's value in memory, for GDB, the GNU debugger. |
1bac305b | 2 | |
61baf725 | 3 | Copyright (C) 1986-2017 Free Software Foundation, Inc. |
c906108c | 4 | |
c5aa993b | 5 | This file is part of GDB. |
c906108c | 6 | |
c5aa993b JM |
7 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 10 | (at your option) any later version. |
c906108c | 11 | |
c5aa993b JM |
12 | This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
c906108c | 16 | |
c5aa993b | 17 | You should have received a copy of the GNU General Public License |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
19 | |
20 | #include "defs.h" | |
21 | #include "symtab.h" | |
22 | #include "gdbtypes.h" | |
23 | #include "frame.h" | |
24 | #include "value.h" | |
25 | #include "gdbcore.h" | |
26 | #include "inferior.h" | |
27 | #include "target.h" | |
c906108c | 28 | #include "floatformat.h" |
c5aa993b | 29 | #include "symfile.h" /* for overlay functions */ |
4e052eda | 30 | #include "regcache.h" |
eb8bc282 | 31 | #include "user-regs.h" |
fe898f56 | 32 | #include "block.h" |
e0740f77 | 33 | #include "objfiles.h" |
a5ee536b | 34 | #include "language.h" |
63e43d3a | 35 | #include "dwarf2loc.h" |
b057297a | 36 | #include "selftest.h" |
c906108c | 37 | |
9659616a MS |
38 | /* Basic byte-swapping routines. All 'extract' functions return a |
39 | host-format integer from a target-format integer at ADDR which is | |
40 | LEN bytes long. */ | |
c906108c SS |
41 | |
42 | #if TARGET_CHAR_BIT != 8 || HOST_CHAR_BIT != 8 | |
43 | /* 8 bit characters are a pretty safe assumption these days, so we | |
44 | assume it throughout all these swapping routines. If we had to deal with | |
45 | 9 bit characters, we would need to make len be in bits and would have | |
46 | to re-write these routines... */ | |
c5aa993b | 47 | you lose |
c906108c SS |
48 | #endif |
49 | ||
6f98355c YQ |
50 | template<typename T, typename> |
51 | T | |
52 | extract_integer (const gdb_byte *addr, int len, enum bfd_endian byte_order) | |
c906108c | 53 | { |
6f98355c | 54 | T retval = 0; |
37611a2b AC |
55 | const unsigned char *p; |
56 | const unsigned char *startaddr = addr; | |
57 | const unsigned char *endaddr = startaddr + len; | |
c906108c | 58 | |
6f98355c | 59 | if (len > (int) sizeof (T)) |
8a3fe4f8 AC |
60 | error (_("\ |
61 | That operation is not available on integers of more than %d bytes."), | |
6f98355c | 62 | (int) sizeof (T)); |
c906108c SS |
63 | |
64 | /* Start at the most significant end of the integer, and work towards | |
65 | the least significant. */ | |
e17a4113 | 66 | if (byte_order == BFD_ENDIAN_BIG) |
c906108c SS |
67 | { |
68 | p = startaddr; | |
6f98355c YQ |
69 | if (std::is_signed<T>::value) |
70 | { | |
71 | /* Do the sign extension once at the start. */ | |
72 | retval = ((LONGEST) * p ^ 0x80) - 0x80; | |
73 | ++p; | |
74 | } | |
75 | for (; p < endaddr; ++p) | |
c906108c SS |
76 | retval = (retval << 8) | *p; |
77 | } | |
78 | else | |
79 | { | |
80 | p = endaddr - 1; | |
6f98355c YQ |
81 | if (std::is_signed<T>::value) |
82 | { | |
83 | /* Do the sign extension once at the start. */ | |
84 | retval = ((LONGEST) * p ^ 0x80) - 0x80; | |
85 | --p; | |
86 | } | |
87 | for (; p >= startaddr; --p) | |
c906108c SS |
88 | retval = (retval << 8) | *p; |
89 | } | |
90 | return retval; | |
91 | } | |
92 | ||
6f98355c YQ |
93 | /* Explicit instantiations. */ |
94 | template LONGEST extract_integer<LONGEST> (const gdb_byte *addr, int len, | |
95 | enum bfd_endian byte_order); | |
96 | template ULONGEST extract_integer<ULONGEST> (const gdb_byte *addr, int len, | |
97 | enum bfd_endian byte_order); | |
c906108c SS |
98 | |
99 | /* Sometimes a long long unsigned integer can be extracted as a | |
100 | LONGEST value. This is done so that we can print these values | |
101 | better. If this integer can be converted to a LONGEST, this | |
102 | function returns 1 and sets *PVAL. Otherwise it returns 0. */ | |
103 | ||
104 | int | |
0d509538 | 105 | extract_long_unsigned_integer (const gdb_byte *addr, int orig_len, |
e17a4113 | 106 | enum bfd_endian byte_order, LONGEST *pval) |
c906108c | 107 | { |
0d509538 AC |
108 | const gdb_byte *p; |
109 | const gdb_byte *first_addr; | |
c906108c SS |
110 | int len; |
111 | ||
112 | len = orig_len; | |
e17a4113 | 113 | if (byte_order == BFD_ENDIAN_BIG) |
c906108c | 114 | { |
0d509538 AC |
115 | for (p = addr; |
116 | len > (int) sizeof (LONGEST) && p < addr + orig_len; | |
c906108c SS |
117 | p++) |
118 | { | |
119 | if (*p == 0) | |
120 | len--; | |
121 | else | |
122 | break; | |
123 | } | |
124 | first_addr = p; | |
125 | } | |
126 | else | |
127 | { | |
0d509538 AC |
128 | first_addr = addr; |
129 | for (p = addr + orig_len - 1; | |
130 | len > (int) sizeof (LONGEST) && p >= addr; | |
c906108c SS |
131 | p--) |
132 | { | |
133 | if (*p == 0) | |
134 | len--; | |
135 | else | |
136 | break; | |
137 | } | |
138 | } | |
139 | ||
140 | if (len <= (int) sizeof (LONGEST)) | |
141 | { | |
142 | *pval = (LONGEST) extract_unsigned_integer (first_addr, | |
e17a4113 UW |
143 | sizeof (LONGEST), |
144 | byte_order); | |
c906108c SS |
145 | return 1; |
146 | } | |
147 | ||
148 | return 0; | |
149 | } | |
150 | ||
4478b372 | 151 | |
4478b372 JB |
152 | /* Treat the bytes at BUF as a pointer of type TYPE, and return the |
153 | address it represents. */ | |
154 | CORE_ADDR | |
0d509538 | 155 | extract_typed_address (const gdb_byte *buf, struct type *type) |
4478b372 | 156 | { |
aa006118 | 157 | if (TYPE_CODE (type) != TYPE_CODE_PTR && !TYPE_IS_REFERENCE (type)) |
8e65ff28 | 158 | internal_error (__FILE__, __LINE__, |
e2e0b3e5 AC |
159 | _("extract_typed_address: " |
160 | "type is not a pointer or reference")); | |
4478b372 | 161 | |
50810684 | 162 | return gdbarch_pointer_to_address (get_type_arch (type), type, buf); |
4478b372 JB |
163 | } |
164 | ||
9659616a MS |
165 | /* All 'store' functions accept a host-format integer and store a |
166 | target-format integer at ADDR which is LEN bytes long. */ | |
6f98355c | 167 | template<typename T, typename> |
c906108c | 168 | void |
6f98355c YQ |
169 | store_integer (gdb_byte *addr, int len, enum bfd_endian byte_order, |
170 | T val) | |
c906108c | 171 | { |
0d509538 AC |
172 | gdb_byte *p; |
173 | gdb_byte *startaddr = addr; | |
174 | gdb_byte *endaddr = startaddr + len; | |
c906108c SS |
175 | |
176 | /* Start at the least significant end of the integer, and work towards | |
177 | the most significant. */ | |
e17a4113 | 178 | if (byte_order == BFD_ENDIAN_BIG) |
c906108c SS |
179 | { |
180 | for (p = endaddr - 1; p >= startaddr; --p) | |
181 | { | |
182 | *p = val & 0xff; | |
183 | val >>= 8; | |
184 | } | |
185 | } | |
186 | else | |
187 | { | |
188 | for (p = startaddr; p < endaddr; ++p) | |
189 | { | |
190 | *p = val & 0xff; | |
191 | val >>= 8; | |
192 | } | |
193 | } | |
194 | } | |
195 | ||
6f98355c YQ |
196 | /* Explicit instantiations. */ |
197 | template void store_integer (gdb_byte *addr, int len, | |
198 | enum bfd_endian byte_order, | |
199 | LONGEST val); | |
c906108c | 200 | |
6f98355c YQ |
201 | template void store_integer (gdb_byte *addr, int len, |
202 | enum bfd_endian byte_order, | |
203 | ULONGEST val); | |
c906108c | 204 | |
4478b372 JB |
205 | /* Store the address ADDR as a pointer of type TYPE at BUF, in target |
206 | form. */ | |
207 | void | |
0d509538 | 208 | store_typed_address (gdb_byte *buf, struct type *type, CORE_ADDR addr) |
4478b372 | 209 | { |
aa006118 | 210 | if (TYPE_CODE (type) != TYPE_CODE_PTR && !TYPE_IS_REFERENCE (type)) |
8e65ff28 | 211 | internal_error (__FILE__, __LINE__, |
e2e0b3e5 AC |
212 | _("store_typed_address: " |
213 | "type is not a pointer or reference")); | |
4478b372 | 214 | |
50810684 | 215 | gdbarch_address_to_pointer (get_type_arch (type), type, buf, addr); |
4478b372 JB |
216 | } |
217 | ||
b057297a AH |
218 | /* Copy a value from SOURCE of size SOURCE_SIZE bytes to DEST of size DEST_SIZE |
219 | bytes. If SOURCE_SIZE is greater than DEST_SIZE, then truncate the most | |
220 | significant bytes. If SOURCE_SIZE is less than DEST_SIZE then either sign | |
221 | or zero extended according to IS_SIGNED. Values are stored in memory with | |
222 | endianess BYTE_ORDER. */ | |
4478b372 | 223 | |
b057297a AH |
224 | void |
225 | copy_integer_to_size (gdb_byte *dest, int dest_size, const gdb_byte *source, | |
226 | int source_size, bool is_signed, | |
227 | enum bfd_endian byte_order) | |
228 | { | |
229 | signed int size_diff = dest_size - source_size; | |
230 | ||
231 | /* Copy across everything from SOURCE that can fit into DEST. */ | |
232 | ||
233 | if (byte_order == BFD_ENDIAN_BIG && size_diff > 0) | |
234 | memcpy (dest + size_diff, source, source_size); | |
235 | else if (byte_order == BFD_ENDIAN_BIG && size_diff < 0) | |
236 | memcpy (dest, source - size_diff, dest_size); | |
237 | else | |
238 | memcpy (dest, source, std::min (source_size, dest_size)); | |
239 | ||
240 | /* Fill the remaining space in DEST by either zero extending or sign | |
241 | extending. */ | |
242 | ||
243 | if (size_diff > 0) | |
244 | { | |
245 | gdb_byte extension = 0; | |
246 | if (is_signed | |
247 | && ((byte_order != BFD_ENDIAN_BIG && source[source_size - 1] & 0x80) | |
248 | || (byte_order == BFD_ENDIAN_BIG && source[0] & 0x80))) | |
249 | extension = 0xff; | |
250 | ||
251 | /* Extend into MSBs of SOURCE. */ | |
252 | if (byte_order == BFD_ENDIAN_BIG) | |
253 | memset (dest, extension, size_diff); | |
254 | else | |
255 | memset (dest + source_size, extension, size_diff); | |
256 | } | |
257 | } | |
4478b372 | 258 | |
376c9600 AC |
259 | /* Return a `value' with the contents of (virtual or cooked) register |
260 | REGNUM as found in the specified FRAME. The register's type is | |
9c5ea4d9 | 261 | determined by register_type(). */ |
c906108c | 262 | |
3d6d86c6 | 263 | struct value * |
376c9600 | 264 | value_of_register (int regnum, struct frame_info *frame) |
c906108c | 265 | { |
e9e45075 | 266 | struct gdbarch *gdbarch = get_frame_arch (frame); |
3d6d86c6 | 267 | struct value *reg_val; |
c906108c | 268 | |
9564ee9f | 269 | /* User registers lie completely outside of the range of normal |
0406ec40 | 270 | registers. Catch them early so that the target never sees them. */ |
e9e45075 UW |
271 | if (regnum >= gdbarch_num_regs (gdbarch) |
272 | + gdbarch_num_pseudo_regs (gdbarch)) | |
eb8bc282 | 273 | return value_of_user_reg (regnum, frame); |
0406ec40 | 274 | |
d5b495b4 PA |
275 | reg_val = value_of_register_lazy (frame, regnum); |
276 | value_fetch_lazy (reg_val); | |
c906108c SS |
277 | return reg_val; |
278 | } | |
4478b372 | 279 | |
9214ee5f DJ |
280 | /* Return a `value' with the contents of (virtual or cooked) register |
281 | REGNUM as found in the specified FRAME. The register's type is | |
282 | determined by register_type(). The value is not fetched. */ | |
283 | ||
284 | struct value * | |
285 | value_of_register_lazy (struct frame_info *frame, int regnum) | |
286 | { | |
287 | struct gdbarch *gdbarch = get_frame_arch (frame); | |
288 | struct value *reg_val; | |
41b56feb | 289 | struct frame_info *next_frame; |
9214ee5f DJ |
290 | |
291 | gdb_assert (regnum < (gdbarch_num_regs (gdbarch) | |
292 | + gdbarch_num_pseudo_regs (gdbarch))); | |
293 | ||
41b56feb KB |
294 | gdb_assert (frame != NULL); |
295 | ||
296 | next_frame = get_next_frame_sentinel_okay (frame); | |
297 | ||
298 | /* We should have a valid next frame. */ | |
299 | gdb_assert (frame_id_p (get_frame_id (next_frame))); | |
9214ee5f | 300 | |
41e8491f | 301 | reg_val = allocate_value_lazy (register_type (gdbarch, regnum)); |
9214ee5f DJ |
302 | VALUE_LVAL (reg_val) = lval_register; |
303 | VALUE_REGNUM (reg_val) = regnum; | |
41b56feb KB |
304 | VALUE_NEXT_FRAME_ID (reg_val) = get_frame_id (next_frame); |
305 | ||
9214ee5f DJ |
306 | return reg_val; |
307 | } | |
308 | ||
4478b372 JB |
309 | /* Given a pointer of type TYPE in target form in BUF, return the |
310 | address it represents. */ | |
311 | CORE_ADDR | |
9898f801 UW |
312 | unsigned_pointer_to_address (struct gdbarch *gdbarch, |
313 | struct type *type, const gdb_byte *buf) | |
4478b372 | 314 | { |
e17a4113 | 315 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); |
bb9bcb69 | 316 | |
e17a4113 | 317 | return extract_unsigned_integer (buf, TYPE_LENGTH (type), byte_order); |
4478b372 JB |
318 | } |
319 | ||
ac2e2ef7 | 320 | CORE_ADDR |
9898f801 UW |
321 | signed_pointer_to_address (struct gdbarch *gdbarch, |
322 | struct type *type, const gdb_byte *buf) | |
ac2e2ef7 | 323 | { |
e17a4113 | 324 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); |
bb9bcb69 | 325 | |
e17a4113 | 326 | return extract_signed_integer (buf, TYPE_LENGTH (type), byte_order); |
ac2e2ef7 | 327 | } |
4478b372 JB |
328 | |
329 | /* Given an address, store it as a pointer of type TYPE in target | |
330 | format in BUF. */ | |
331 | void | |
9898f801 UW |
332 | unsigned_address_to_pointer (struct gdbarch *gdbarch, struct type *type, |
333 | gdb_byte *buf, CORE_ADDR addr) | |
4478b372 | 334 | { |
e17a4113 | 335 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); |
bb9bcb69 | 336 | |
e17a4113 | 337 | store_unsigned_integer (buf, TYPE_LENGTH (type), byte_order, addr); |
4478b372 JB |
338 | } |
339 | ||
ac2e2ef7 | 340 | void |
9898f801 UW |
341 | address_to_signed_pointer (struct gdbarch *gdbarch, struct type *type, |
342 | gdb_byte *buf, CORE_ADDR addr) | |
ac2e2ef7 | 343 | { |
e17a4113 | 344 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); |
bb9bcb69 | 345 | |
e17a4113 | 346 | store_signed_integer (buf, TYPE_LENGTH (type), byte_order, addr); |
ac2e2ef7 | 347 | } |
c906108c | 348 | \f |
0b31a4bc TT |
349 | /* See value.h. */ |
350 | ||
351 | enum symbol_needs_kind | |
352 | symbol_read_needs (struct symbol *sym) | |
c906108c | 353 | { |
24d6c2a0 | 354 | if (SYMBOL_COMPUTED_OPS (sym) != NULL) |
0b31a4bc | 355 | return SYMBOL_COMPUTED_OPS (sym)->get_symbol_read_needs (sym); |
24d6c2a0 | 356 | |
c906108c SS |
357 | switch (SYMBOL_CLASS (sym)) |
358 | { | |
359 | /* All cases listed explicitly so that gcc -Wall will detect it if | |
c5aa993b | 360 | we failed to consider one. */ |
4c2df51b | 361 | case LOC_COMPUTED: |
24d6c2a0 | 362 | gdb_assert_not_reached (_("LOC_COMPUTED variable missing a method")); |
4c2df51b | 363 | |
c906108c SS |
364 | case LOC_REGISTER: |
365 | case LOC_ARG: | |
366 | case LOC_REF_ARG: | |
c906108c SS |
367 | case LOC_REGPARM_ADDR: |
368 | case LOC_LOCAL: | |
0b31a4bc | 369 | return SYMBOL_NEEDS_FRAME; |
c906108c SS |
370 | |
371 | case LOC_UNDEF: | |
372 | case LOC_CONST: | |
373 | case LOC_STATIC: | |
c906108c SS |
374 | case LOC_TYPEDEF: |
375 | ||
376 | case LOC_LABEL: | |
377 | /* Getting the address of a label can be done independently of the block, | |
c5aa993b JM |
378 | even if some *uses* of that address wouldn't work so well without |
379 | the right frame. */ | |
c906108c SS |
380 | |
381 | case LOC_BLOCK: | |
382 | case LOC_CONST_BYTES: | |
383 | case LOC_UNRESOLVED: | |
384 | case LOC_OPTIMIZED_OUT: | |
0b31a4bc | 385 | return SYMBOL_NEEDS_NONE; |
c906108c | 386 | } |
0b31a4bc TT |
387 | return SYMBOL_NEEDS_FRAME; |
388 | } | |
389 | ||
390 | /* See value.h. */ | |
391 | ||
392 | int | |
393 | symbol_read_needs_frame (struct symbol *sym) | |
394 | { | |
395 | return symbol_read_needs (sym) == SYMBOL_NEEDS_FRAME; | |
c906108c SS |
396 | } |
397 | ||
19630284 JB |
398 | /* Private data to be used with minsym_lookup_iterator_cb. */ |
399 | ||
400 | struct minsym_lookup_data | |
401 | { | |
402 | /* The name of the minimal symbol we are searching for. */ | |
403 | const char *name; | |
404 | ||
405 | /* The field where the callback should store the minimal symbol | |
406 | if found. It should be initialized to NULL before the search | |
407 | is started. */ | |
3b7344d5 | 408 | struct bound_minimal_symbol result; |
19630284 JB |
409 | }; |
410 | ||
411 | /* A callback function for gdbarch_iterate_over_objfiles_in_search_order. | |
412 | It searches by name for a minimal symbol within the given OBJFILE. | |
413 | The arguments are passed via CB_DATA, which in reality is a pointer | |
414 | to struct minsym_lookup_data. */ | |
415 | ||
416 | static int | |
417 | minsym_lookup_iterator_cb (struct objfile *objfile, void *cb_data) | |
418 | { | |
419 | struct minsym_lookup_data *data = (struct minsym_lookup_data *) cb_data; | |
420 | ||
3b7344d5 | 421 | gdb_assert (data->result.minsym == NULL); |
19630284 JB |
422 | |
423 | data->result = lookup_minimal_symbol (data->name, NULL, objfile); | |
424 | ||
425 | /* The iterator should stop iff a match was found. */ | |
3b7344d5 | 426 | return (data->result.minsym != NULL); |
19630284 JB |
427 | } |
428 | ||
63e43d3a PMR |
429 | /* Given static link expression and the frame it lives in, look for the frame |
430 | the static links points to and return it. Return NULL if we could not find | |
431 | such a frame. */ | |
432 | ||
433 | static struct frame_info * | |
434 | follow_static_link (struct frame_info *frame, | |
435 | const struct dynamic_prop *static_link) | |
436 | { | |
437 | CORE_ADDR upper_frame_base; | |
438 | ||
439 | if (!dwarf2_evaluate_property (static_link, frame, NULL, &upper_frame_base)) | |
440 | return NULL; | |
441 | ||
442 | /* Now climb up the stack frame until we reach the frame we are interested | |
443 | in. */ | |
444 | for (; frame != NULL; frame = get_prev_frame (frame)) | |
445 | { | |
446 | struct symbol *framefunc = get_frame_function (frame); | |
447 | ||
448 | /* Stacks can be quite deep: give the user a chance to stop this. */ | |
449 | QUIT; | |
450 | ||
451 | /* If we don't know how to compute FRAME's base address, don't give up: | |
452 | maybe the frame we are looking for is upper in the stace frame. */ | |
453 | if (framefunc != NULL | |
2091da29 | 454 | && SYMBOL_BLOCK_OPS (framefunc) != NULL |
63e43d3a PMR |
455 | && SYMBOL_BLOCK_OPS (framefunc)->get_frame_base != NULL |
456 | && (SYMBOL_BLOCK_OPS (framefunc)->get_frame_base (framefunc, frame) | |
457 | == upper_frame_base)) | |
458 | break; | |
459 | } | |
460 | ||
461 | return frame; | |
462 | } | |
463 | ||
464 | /* Assuming VAR is a symbol that can be reached from FRAME thanks to lexical | |
465 | rules, look for the frame that is actually hosting VAR and return it. If, | |
466 | for some reason, we found no such frame, return NULL. | |
467 | ||
468 | This kind of computation is necessary to correctly handle lexically nested | |
469 | functions. | |
470 | ||
471 | Note that in some cases, we know what scope VAR comes from but we cannot | |
472 | reach the specific frame that hosts the instance of VAR we are looking for. | |
473 | For backward compatibility purposes (with old compilers), we then look for | |
474 | the first frame that can host it. */ | |
475 | ||
476 | static struct frame_info * | |
477 | get_hosting_frame (struct symbol *var, const struct block *var_block, | |
478 | struct frame_info *frame) | |
479 | { | |
480 | const struct block *frame_block = NULL; | |
481 | ||
482 | if (!symbol_read_needs_frame (var)) | |
483 | return NULL; | |
484 | ||
485 | /* Some symbols for local variables have no block: this happens when they are | |
486 | not produced by a debug information reader, for instance when GDB creates | |
487 | synthetic symbols. Without block information, we must assume they are | |
488 | local to FRAME. In this case, there is nothing to do. */ | |
489 | else if (var_block == NULL) | |
490 | return frame; | |
491 | ||
492 | /* We currently assume that all symbols with a location list need a frame. | |
493 | This is true in practice because selecting the location description | |
494 | requires to compute the CFA, hence requires a frame. However we have | |
495 | tests that embed global/static symbols with null location lists. | |
496 | We want to get <optimized out> instead of <frame required> when evaluating | |
497 | them so return a frame instead of raising an error. */ | |
498 | else if (var_block == block_global_block (var_block) | |
499 | || var_block == block_static_block (var_block)) | |
500 | return frame; | |
501 | ||
502 | /* We have to handle the "my_func::my_local_var" notation. This requires us | |
503 | to look for upper frames when we find no block for the current frame: here | |
504 | and below, handle when frame_block == NULL. */ | |
505 | if (frame != NULL) | |
506 | frame_block = get_frame_block (frame, NULL); | |
507 | ||
508 | /* Climb up the call stack until reaching the frame we are looking for. */ | |
509 | while (frame != NULL && frame_block != var_block) | |
510 | { | |
511 | /* Stacks can be quite deep: give the user a chance to stop this. */ | |
512 | QUIT; | |
513 | ||
514 | if (frame_block == NULL) | |
515 | { | |
516 | frame = get_prev_frame (frame); | |
517 | if (frame == NULL) | |
518 | break; | |
519 | frame_block = get_frame_block (frame, NULL); | |
520 | } | |
521 | ||
522 | /* If we failed to find the proper frame, fallback to the heuristic | |
523 | method below. */ | |
524 | else if (frame_block == block_global_block (frame_block)) | |
525 | { | |
526 | frame = NULL; | |
527 | break; | |
528 | } | |
529 | ||
530 | /* Assuming we have a block for this frame: if we are at the function | |
531 | level, the immediate upper lexical block is in an outer function: | |
532 | follow the static link. */ | |
533 | else if (BLOCK_FUNCTION (frame_block)) | |
534 | { | |
535 | const struct dynamic_prop *static_link | |
536 | = block_static_link (frame_block); | |
537 | int could_climb_up = 0; | |
538 | ||
539 | if (static_link != NULL) | |
540 | { | |
541 | frame = follow_static_link (frame, static_link); | |
542 | if (frame != NULL) | |
543 | { | |
544 | frame_block = get_frame_block (frame, NULL); | |
545 | could_climb_up = frame_block != NULL; | |
546 | } | |
547 | } | |
548 | if (!could_climb_up) | |
549 | { | |
550 | frame = NULL; | |
551 | break; | |
552 | } | |
553 | } | |
554 | ||
555 | else | |
556 | /* We must be in some function nested lexical block. Just get the | |
557 | outer block: both must share the same frame. */ | |
558 | frame_block = BLOCK_SUPERBLOCK (frame_block); | |
559 | } | |
560 | ||
561 | /* Old compilers may not provide a static link, or they may provide an | |
562 | invalid one. For such cases, fallback on the old way to evaluate | |
563 | non-local references: just climb up the call stack and pick the first | |
564 | frame that contains the variable we are looking for. */ | |
565 | if (frame == NULL) | |
566 | { | |
567 | frame = block_innermost_frame (var_block); | |
568 | if (frame == NULL) | |
569 | { | |
570 | if (BLOCK_FUNCTION (var_block) | |
571 | && !block_inlined_p (var_block) | |
572 | && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (var_block))) | |
573 | error (_("No frame is currently executing in block %s."), | |
574 | SYMBOL_PRINT_NAME (BLOCK_FUNCTION (var_block))); | |
575 | else | |
576 | error (_("No frame is currently executing in specified" | |
577 | " block")); | |
578 | } | |
579 | } | |
580 | ||
581 | return frame; | |
582 | } | |
583 | ||
a5ee536b JB |
584 | /* A default implementation for the "la_read_var_value" hook in |
585 | the language vector which should work in most situations. */ | |
c906108c | 586 | |
3d6d86c6 | 587 | struct value * |
63e43d3a PMR |
588 | default_read_var_value (struct symbol *var, const struct block *var_block, |
589 | struct frame_info *frame) | |
c906108c | 590 | { |
52f0bd74 | 591 | struct value *v; |
c906108c SS |
592 | struct type *type = SYMBOL_TYPE (var); |
593 | CORE_ADDR addr; | |
0b31a4bc | 594 | enum symbol_needs_kind sym_need; |
c906108c | 595 | |
41e8491f JK |
596 | /* Call check_typedef on our type to make sure that, if TYPE is |
597 | a TYPE_CODE_TYPEDEF, its length is set to the length of the target type | |
598 | instead of zero. However, we do not replace the typedef type by the | |
599 | target type, because we want to keep the typedef in order to be able to | |
600 | set the returned value type description correctly. */ | |
601 | check_typedef (type); | |
c906108c | 602 | |
0b31a4bc TT |
603 | sym_need = symbol_read_needs (var); |
604 | if (sym_need == SYMBOL_NEEDS_FRAME) | |
63e43d3a | 605 | gdb_assert (frame != NULL); |
0b31a4bc TT |
606 | else if (sym_need == SYMBOL_NEEDS_REGISTERS && !target_has_registers) |
607 | error (_("Cannot read `%s' without registers"), SYMBOL_PRINT_NAME (var)); | |
63e43d3a PMR |
608 | |
609 | if (frame != NULL) | |
610 | frame = get_hosting_frame (var, var_block, frame); | |
c906108c | 611 | |
24d6c2a0 TT |
612 | if (SYMBOL_COMPUTED_OPS (var) != NULL) |
613 | return SYMBOL_COMPUTED_OPS (var)->read_variable (var, frame); | |
614 | ||
c906108c SS |
615 | switch (SYMBOL_CLASS (var)) |
616 | { | |
617 | case LOC_CONST: | |
1612e0c0 SA |
618 | if (is_dynamic_type (type)) |
619 | { | |
620 | /* Value is a constant byte-sequence and needs no memory access. */ | |
c3345124 | 621 | type = resolve_dynamic_type (type, NULL, /* Unused address. */ 0); |
1612e0c0 SA |
622 | } |
623 | /* Put the constant back in target format. */ | |
41e8491f | 624 | v = allocate_value (type); |
744a8059 | 625 | store_signed_integer (value_contents_raw (v), TYPE_LENGTH (type), |
e17a4113 | 626 | gdbarch_byte_order (get_type_arch (type)), |
c906108c SS |
627 | (LONGEST) SYMBOL_VALUE (var)); |
628 | VALUE_LVAL (v) = not_lval; | |
629 | return v; | |
630 | ||
631 | case LOC_LABEL: | |
632 | /* Put the constant back in target format. */ | |
41e8491f | 633 | v = allocate_value (type); |
c906108c | 634 | if (overlay_debugging) |
4478b372 JB |
635 | { |
636 | CORE_ADDR addr | |
637 | = symbol_overlayed_address (SYMBOL_VALUE_ADDRESS (var), | |
08be3fe3 | 638 | SYMBOL_OBJ_SECTION (symbol_objfile (var), |
e27d198c | 639 | var)); |
bb9bcb69 | 640 | |
990a07ab | 641 | store_typed_address (value_contents_raw (v), type, addr); |
4478b372 | 642 | } |
c906108c | 643 | else |
990a07ab | 644 | store_typed_address (value_contents_raw (v), type, |
4478b372 | 645 | SYMBOL_VALUE_ADDRESS (var)); |
c906108c SS |
646 | VALUE_LVAL (v) = not_lval; |
647 | return v; | |
648 | ||
649 | case LOC_CONST_BYTES: | |
1612e0c0 SA |
650 | if (is_dynamic_type (type)) |
651 | { | |
652 | /* Value is a constant byte-sequence and needs no memory access. */ | |
c3345124 | 653 | type = resolve_dynamic_type (type, NULL, /* Unused address. */ 0); |
1612e0c0 | 654 | } |
41e8491f | 655 | v = allocate_value (type); |
744a8059 SP |
656 | memcpy (value_contents_raw (v), SYMBOL_VALUE_BYTES (var), |
657 | TYPE_LENGTH (type)); | |
bb9bcb69 MS |
658 | VALUE_LVAL (v) = not_lval; |
659 | return v; | |
c906108c SS |
660 | |
661 | case LOC_STATIC: | |
662 | if (overlay_debugging) | |
663 | addr = symbol_overlayed_address (SYMBOL_VALUE_ADDRESS (var), | |
08be3fe3 | 664 | SYMBOL_OBJ_SECTION (symbol_objfile (var), |
e27d198c | 665 | var)); |
c906108c SS |
666 | else |
667 | addr = SYMBOL_VALUE_ADDRESS (var); | |
668 | break; | |
669 | ||
c906108c | 670 | case LOC_ARG: |
da62e633 | 671 | addr = get_frame_args_address (frame); |
c906108c | 672 | if (!addr) |
8afd712c JK |
673 | error (_("Unknown argument list address for `%s'."), |
674 | SYMBOL_PRINT_NAME (var)); | |
c906108c SS |
675 | addr += SYMBOL_VALUE (var); |
676 | break; | |
677 | ||
678 | case LOC_REF_ARG: | |
f76febae AC |
679 | { |
680 | struct value *ref; | |
681 | CORE_ADDR argref; | |
bb9bcb69 | 682 | |
da62e633 | 683 | argref = get_frame_args_address (frame); |
f76febae | 684 | if (!argref) |
8afd712c JK |
685 | error (_("Unknown argument list address for `%s'."), |
686 | SYMBOL_PRINT_NAME (var)); | |
f76febae | 687 | argref += SYMBOL_VALUE (var); |
00a4c844 | 688 | ref = value_at (lookup_pointer_type (type), argref); |
1aa20aa8 | 689 | addr = value_as_address (ref); |
f76febae AC |
690 | break; |
691 | } | |
c906108c SS |
692 | |
693 | case LOC_LOCAL: | |
da62e633 | 694 | addr = get_frame_locals_address (frame); |
c906108c SS |
695 | addr += SYMBOL_VALUE (var); |
696 | break; | |
697 | ||
c906108c | 698 | case LOC_TYPEDEF: |
8afd712c JK |
699 | error (_("Cannot look up value of a typedef `%s'."), |
700 | SYMBOL_PRINT_NAME (var)); | |
c906108c SS |
701 | break; |
702 | ||
703 | case LOC_BLOCK: | |
704 | if (overlay_debugging) | |
41e8491f | 705 | addr = symbol_overlayed_address |
08be3fe3 DE |
706 | (BLOCK_START (SYMBOL_BLOCK_VALUE (var)), |
707 | SYMBOL_OBJ_SECTION (symbol_objfile (var), var)); | |
c906108c | 708 | else |
41e8491f JK |
709 | addr = BLOCK_START (SYMBOL_BLOCK_VALUE (var)); |
710 | break; | |
c906108c SS |
711 | |
712 | case LOC_REGISTER: | |
c906108c SS |
713 | case LOC_REGPARM_ADDR: |
714 | { | |
768a979c UW |
715 | int regno = SYMBOL_REGISTER_OPS (var) |
716 | ->register_number (var, get_frame_arch (frame)); | |
3d6d86c6 | 717 | struct value *regval; |
c906108c | 718 | |
c906108c SS |
719 | if (SYMBOL_CLASS (var) == LOC_REGPARM_ADDR) |
720 | { | |
721 | regval = value_from_register (lookup_pointer_type (type), | |
c5aa993b | 722 | regno, |
c906108c SS |
723 | frame); |
724 | ||
725 | if (regval == NULL) | |
8afd712c JK |
726 | error (_("Value of register variable not available for `%s'."), |
727 | SYMBOL_PRINT_NAME (var)); | |
c906108c | 728 | |
1aa20aa8 | 729 | addr = value_as_address (regval); |
c906108c SS |
730 | } |
731 | else | |
732 | { | |
733 | regval = value_from_register (type, regno, frame); | |
734 | ||
735 | if (regval == NULL) | |
8afd712c JK |
736 | error (_("Value of register variable not available for `%s'."), |
737 | SYMBOL_PRINT_NAME (var)); | |
c906108c SS |
738 | return regval; |
739 | } | |
740 | } | |
741 | break; | |
742 | ||
4c2df51b | 743 | case LOC_COMPUTED: |
24d6c2a0 | 744 | gdb_assert_not_reached (_("LOC_COMPUTED variable missing a method")); |
4c2df51b | 745 | |
c906108c SS |
746 | case LOC_UNRESOLVED: |
747 | { | |
19630284 | 748 | struct minsym_lookup_data lookup_data; |
c906108c | 749 | struct minimal_symbol *msym; |
e0740f77 | 750 | struct obj_section *obj_section; |
c906108c | 751 | |
19630284 JB |
752 | memset (&lookup_data, 0, sizeof (lookup_data)); |
753 | lookup_data.name = SYMBOL_LINKAGE_NAME (var); | |
754 | ||
755 | gdbarch_iterate_over_objfiles_in_search_order | |
08be3fe3 | 756 | (symbol_arch (var), |
19630284 | 757 | minsym_lookup_iterator_cb, &lookup_data, |
08be3fe3 | 758 | symbol_objfile (var)); |
3b7344d5 | 759 | msym = lookup_data.result.minsym; |
19630284 | 760 | |
015d2e7e DE |
761 | /* If we can't find the minsym there's a problem in the symbol info. |
762 | The symbol exists in the debug info, but it's missing in the minsym | |
763 | table. */ | |
c906108c | 764 | if (msym == NULL) |
015d2e7e DE |
765 | { |
766 | const char *flavour_name | |
767 | = objfile_flavour_name (symbol_objfile (var)); | |
768 | ||
769 | /* We can't get here unless we've opened the file, so flavour_name | |
770 | can't be NULL. */ | |
771 | gdb_assert (flavour_name != NULL); | |
772 | error (_("Missing %s symbol \"%s\"."), | |
773 | flavour_name, SYMBOL_LINKAGE_NAME (var)); | |
774 | } | |
3b7344d5 | 775 | obj_section = MSYMBOL_OBJ_SECTION (lookup_data.result.objfile, msym); |
5382cfab PW |
776 | /* Relocate address, unless there is no section or the variable is |
777 | a TLS variable. */ | |
778 | if (obj_section == NULL | |
779 | || (obj_section->the_bfd_section->flags & SEC_THREAD_LOCAL) != 0) | |
780 | addr = MSYMBOL_VALUE_RAW_ADDRESS (msym); | |
781 | else | |
782 | addr = BMSYMBOL_VALUE_ADDRESS (lookup_data.result); | |
783 | if (overlay_debugging) | |
784 | addr = symbol_overlayed_address (addr, obj_section); | |
785 | /* Determine address of TLS variable. */ | |
e0740f77 JK |
786 | if (obj_section |
787 | && (obj_section->the_bfd_section->flags & SEC_THREAD_LOCAL) != 0) | |
788 | addr = target_translate_tls_address (obj_section->objfile, addr); | |
c906108c SS |
789 | } |
790 | break; | |
791 | ||
792 | case LOC_OPTIMIZED_OUT: | |
a7035dbb | 793 | return allocate_optimized_out_value (type); |
c906108c SS |
794 | |
795 | default: | |
8afd712c JK |
796 | error (_("Cannot look up value of a botched symbol `%s'."), |
797 | SYMBOL_PRINT_NAME (var)); | |
c906108c SS |
798 | break; |
799 | } | |
800 | ||
08039c9e | 801 | v = value_at_lazy (type, addr); |
c906108c SS |
802 | return v; |
803 | } | |
804 | ||
a5ee536b JB |
805 | /* Calls VAR's language la_read_var_value hook with the given arguments. */ |
806 | ||
807 | struct value * | |
63e43d3a PMR |
808 | read_var_value (struct symbol *var, const struct block *var_block, |
809 | struct frame_info *frame) | |
a5ee536b JB |
810 | { |
811 | const struct language_defn *lang = language_def (SYMBOL_LANGUAGE (var)); | |
812 | ||
813 | gdb_assert (lang != NULL); | |
814 | gdb_assert (lang->la_read_var_value != NULL); | |
815 | ||
63e43d3a | 816 | return lang->la_read_var_value (var, var_block, frame); |
a5ee536b JB |
817 | } |
818 | ||
9acbedc0 UW |
819 | /* Install default attributes for register values. */ |
820 | ||
821 | struct value * | |
2ed3c037 UW |
822 | default_value_from_register (struct gdbarch *gdbarch, struct type *type, |
823 | int regnum, struct frame_id frame_id) | |
9acbedc0 | 824 | { |
9acbedc0 UW |
825 | int len = TYPE_LENGTH (type); |
826 | struct value *value = allocate_value (type); | |
41b56feb | 827 | struct frame_info *frame; |
9acbedc0 UW |
828 | |
829 | VALUE_LVAL (value) = lval_register; | |
41b56feb KB |
830 | frame = frame_find_by_id (frame_id); |
831 | ||
832 | if (frame == NULL) | |
833 | frame_id = null_frame_id; | |
834 | else | |
835 | frame_id = get_frame_id (get_next_frame_sentinel_okay (frame)); | |
836 | ||
837 | VALUE_NEXT_FRAME_ID (value) = frame_id; | |
9acbedc0 UW |
838 | VALUE_REGNUM (value) = regnum; |
839 | ||
840 | /* Any structure stored in more than one register will always be | |
841 | an integral number of registers. Otherwise, you need to do | |
842 | some fiddling with the last register copied here for little | |
843 | endian machines. */ | |
e9e45075 | 844 | if (gdbarch_byte_order (gdbarch) == BFD_ENDIAN_BIG |
9acbedc0 UW |
845 | && len < register_size (gdbarch, regnum)) |
846 | /* Big-endian, and we want less than full size. */ | |
847 | set_value_offset (value, register_size (gdbarch, regnum) - len); | |
848 | else | |
849 | set_value_offset (value, 0); | |
850 | ||
851 | return value; | |
852 | } | |
853 | ||
b56d6f31 JB |
854 | /* VALUE must be an lval_register value. If regnum is the value's |
855 | associated register number, and len the length of the values type, | |
856 | read one or more registers in FRAME, starting with register REGNUM, | |
2603f7ee AB |
857 | until we've read LEN bytes. |
858 | ||
859 | If any of the registers we try to read are optimized out, then mark the | |
860 | complete resulting value as optimized out. */ | |
b56d6f31 JB |
861 | |
862 | void | |
863 | read_frame_register_value (struct value *value, struct frame_info *frame) | |
864 | { | |
01efb936 | 865 | struct gdbarch *gdbarch = get_frame_arch (frame); |
6b850546 DT |
866 | LONGEST offset = 0; |
867 | LONGEST reg_offset = value_offset (value); | |
b56d6f31 | 868 | int regnum = VALUE_REGNUM (value); |
3ae385af | 869 | int len = type_length_units (check_typedef (value_type (value))); |
b56d6f31 JB |
870 | |
871 | gdb_assert (VALUE_LVAL (value) == lval_register); | |
872 | ||
01efb936 UW |
873 | /* Skip registers wholly inside of REG_OFFSET. */ |
874 | while (reg_offset >= register_size (gdbarch, regnum)) | |
875 | { | |
876 | reg_offset -= register_size (gdbarch, regnum); | |
877 | regnum++; | |
878 | } | |
879 | ||
880 | /* Copy the data. */ | |
881 | while (len > 0) | |
b56d6f31 JB |
882 | { |
883 | struct value *regval = get_frame_register_value (frame, regnum); | |
3ae385af | 884 | int reg_len = type_length_units (value_type (regval)) - reg_offset; |
b56d6f31 | 885 | |
22355c90 JB |
886 | /* If the register length is larger than the number of bytes |
887 | remaining to copy, then only copy the appropriate bytes. */ | |
01efb936 UW |
888 | if (reg_len > len) |
889 | reg_len = len; | |
22355c90 | 890 | |
01efb936 | 891 | value_contents_copy (value, offset, regval, reg_offset, reg_len); |
b56d6f31 JB |
892 | |
893 | offset += reg_len; | |
01efb936 UW |
894 | len -= reg_len; |
895 | reg_offset = 0; | |
b56d6f31 JB |
896 | regnum++; |
897 | } | |
898 | } | |
899 | ||
00fa51f6 | 900 | /* Return a value of type TYPE, stored in register REGNUM, in frame FRAME. */ |
c906108c | 901 | |
3d6d86c6 | 902 | struct value * |
fba45db2 | 903 | value_from_register (struct type *type, int regnum, struct frame_info *frame) |
c906108c | 904 | { |
ff2e87ac | 905 | struct gdbarch *gdbarch = get_frame_arch (frame); |
9acbedc0 UW |
906 | struct type *type1 = check_typedef (type); |
907 | struct value *v; | |
908 | ||
e9e45075 | 909 | if (gdbarch_convert_register_p (gdbarch, regnum, type1)) |
ff2e87ac | 910 | { |
3543a589 TT |
911 | int optim, unavail, ok; |
912 | ||
ff2e87ac AC |
913 | /* The ISA/ABI need to something weird when obtaining the |
914 | specified value from this register. It might need to | |
915 | re-order non-adjacent, starting with REGNUM (see MIPS and | |
916 | i386). It might need to convert the [float] register into | |
917 | the corresponding [integer] type (see Alpha). The assumption | |
c1afe53d | 918 | is that gdbarch_register_to_value populates the entire value |
ff2e87ac | 919 | including the location. */ |
9acbedc0 UW |
920 | v = allocate_value (type); |
921 | VALUE_LVAL (v) = lval_register; | |
41b56feb | 922 | VALUE_NEXT_FRAME_ID (v) = get_frame_id (get_next_frame_sentinel_okay (frame)); |
9acbedc0 | 923 | VALUE_REGNUM (v) = regnum; |
8dccd430 PA |
924 | ok = gdbarch_register_to_value (gdbarch, frame, regnum, type1, |
925 | value_contents_raw (v), &optim, | |
926 | &unavail); | |
3543a589 TT |
927 | |
928 | if (!ok) | |
929 | { | |
930 | if (optim) | |
9a0dc9e3 | 931 | mark_value_bytes_optimized_out (v, 0, TYPE_LENGTH (type)); |
3543a589 TT |
932 | if (unavail) |
933 | mark_value_bytes_unavailable (v, 0, TYPE_LENGTH (type)); | |
934 | } | |
ff2e87ac AC |
935 | } |
936 | else | |
c906108c | 937 | { |
9acbedc0 | 938 | /* Construct the value. */ |
2ed3c037 UW |
939 | v = gdbarch_value_from_register (gdbarch, type, |
940 | regnum, get_frame_id (frame)); | |
00fa51f6 UW |
941 | |
942 | /* Get the data. */ | |
b56d6f31 | 943 | read_frame_register_value (v, frame); |
c906108c | 944 | } |
8dccd430 | 945 | |
c906108c SS |
946 | return v; |
947 | } | |
ff2e87ac | 948 | |
2ed3c037 UW |
949 | /* Return contents of register REGNUM in frame FRAME as address. |
950 | Will abort if register value is not available. */ | |
0b2b0195 UW |
951 | |
952 | CORE_ADDR | |
2ed3c037 | 953 | address_from_register (int regnum, struct frame_info *frame) |
0b2b0195 | 954 | { |
2ed3c037 UW |
955 | struct gdbarch *gdbarch = get_frame_arch (frame); |
956 | struct type *type = builtin_type (gdbarch)->builtin_data_ptr; | |
0b2b0195 UW |
957 | struct value *value; |
958 | CORE_ADDR result; | |
5f3ff4f8 JK |
959 | int regnum_max_excl = (gdbarch_num_regs (gdbarch) |
960 | + gdbarch_num_pseudo_regs (gdbarch)); | |
961 | ||
962 | if (regnum < 0 || regnum >= regnum_max_excl) | |
963 | error (_("Invalid register #%d, expecting 0 <= # < %d"), regnum, | |
964 | regnum_max_excl); | |
0b2b0195 | 965 | |
2ed3c037 UW |
966 | /* This routine may be called during early unwinding, at a time |
967 | where the ID of FRAME is not yet known. Calling value_from_register | |
968 | would therefore abort in get_frame_id. However, since we only need | |
969 | a temporary value that is never used as lvalue, we actually do not | |
41b56feb | 970 | really need to set its VALUE_NEXT_FRAME_ID. Therefore, we re-implement |
eeef931a | 971 | the core of value_from_register, but use the null_frame_id. */ |
2ed3c037 | 972 | |
eeef931a UW |
973 | /* Some targets require a special conversion routine even for plain |
974 | pointer types. Avoid constructing a value object in those cases. */ | |
975 | if (gdbarch_convert_register_p (gdbarch, regnum, type)) | |
976 | { | |
224c3ddb | 977 | gdb_byte *buf = (gdb_byte *) alloca (TYPE_LENGTH (type)); |
eeef931a UW |
978 | int optim, unavail, ok; |
979 | ||
980 | ok = gdbarch_register_to_value (gdbarch, frame, regnum, type, | |
981 | buf, &optim, &unavail); | |
982 | if (!ok) | |
983 | { | |
984 | /* This function is used while computing a location expression. | |
985 | Complain about the value being optimized out, rather than | |
986 | letting value_as_address complain about some random register | |
987 | the expression depends on not being saved. */ | |
988 | error_value_optimized_out (); | |
989 | } | |
990 | ||
991 | return unpack_long (type, buf); | |
992 | } | |
2ed3c037 UW |
993 | |
994 | value = gdbarch_value_from_register (gdbarch, type, regnum, null_frame_id); | |
995 | read_frame_register_value (value, frame); | |
0b2b0195 | 996 | |
901461f8 PA |
997 | if (value_optimized_out (value)) |
998 | { | |
999 | /* This function is used while computing a location expression. | |
1000 | Complain about the value being optimized out, rather than | |
1001 | letting value_as_address complain about some random register | |
1002 | the expression depends on not being saved. */ | |
1003 | error_value_optimized_out (); | |
1004 | } | |
1005 | ||
0b2b0195 UW |
1006 | result = value_as_address (value); |
1007 | release_value (value); | |
1008 | value_free (value); | |
1009 | ||
1010 | return result; | |
1011 | } | |
b56d6f31 | 1012 | |
b057297a AH |
1013 | #if GDB_SELF_TEST |
1014 | namespace selftests { | |
1015 | namespace findvar_tests { | |
1016 | ||
1017 | /* Function to test copy_integer_to_size. Store SOURCE_VAL with size | |
1018 | SOURCE_SIZE to a buffer, making sure no sign extending happens at this | |
1019 | stage. Copy buffer to a new buffer using copy_integer_to_size. Extract | |
1020 | copied value and compare to DEST_VALU. Copy again with a signed | |
1021 | copy_integer_to_size and compare to DEST_VALS. Do everything for both | |
1022 | LITTLE and BIG target endians. Use unsigned values throughout to make | |
1023 | sure there are no implicit sign extensions. */ | |
1024 | ||
1025 | static void | |
1026 | do_cint_test (ULONGEST dest_valu, ULONGEST dest_vals, int dest_size, | |
1027 | ULONGEST src_val, int src_size) | |
1028 | { | |
1029 | for (int i = 0; i < 2 ; i++) | |
1030 | { | |
1031 | gdb_byte srcbuf[sizeof (ULONGEST)] = {}; | |
1032 | gdb_byte destbuf[sizeof (ULONGEST)] = {}; | |
1033 | enum bfd_endian byte_order = i ? BFD_ENDIAN_BIG : BFD_ENDIAN_LITTLE; | |
1034 | ||
1035 | /* Fill the src buffer (and later the dest buffer) with non-zero junk, | |
1036 | to ensure zero extensions aren't hidden. */ | |
1037 | memset (srcbuf, 0xaa, sizeof (srcbuf)); | |
1038 | ||
1039 | /* Store (and later extract) using unsigned to ensure there are no sign | |
1040 | extensions. */ | |
1041 | store_unsigned_integer (srcbuf, src_size, byte_order, src_val); | |
1042 | ||
1043 | /* Test unsigned. */ | |
1044 | memset (destbuf, 0xaa, sizeof (destbuf)); | |
1045 | copy_integer_to_size (destbuf, dest_size, srcbuf, src_size, false, | |
1046 | byte_order); | |
1047 | SELF_CHECK (dest_valu == extract_unsigned_integer (destbuf, dest_size, | |
1048 | byte_order)); | |
1049 | ||
1050 | /* Test signed. */ | |
1051 | memset (destbuf, 0xaa, sizeof (destbuf)); | |
1052 | copy_integer_to_size (destbuf, dest_size, srcbuf, src_size, true, | |
1053 | byte_order); | |
1054 | SELF_CHECK (dest_vals == extract_unsigned_integer (destbuf, dest_size, | |
1055 | byte_order)); | |
1056 | } | |
1057 | } | |
1058 | ||
1059 | static void | |
1060 | copy_integer_to_size_test () | |
1061 | { | |
1062 | /* Destination is bigger than the source, which has the signed bit unset. */ | |
1063 | do_cint_test (0x12345678, 0x12345678, 8, 0x12345678, 4); | |
1064 | do_cint_test (0x345678, 0x345678, 8, 0x12345678, 3); | |
1065 | ||
1066 | /* Destination is bigger than the source, which has the signed bit set. */ | |
1067 | do_cint_test (0xdeadbeef, 0xffffffffdeadbeef, 8, 0xdeadbeef, 4); | |
1068 | do_cint_test (0xadbeef, 0xffffffffffadbeef, 8, 0xdeadbeef, 3); | |
1069 | ||
1070 | /* Destination is smaller than the source. */ | |
1071 | do_cint_test (0x5678, 0x5678, 2, 0x12345678, 3); | |
1072 | do_cint_test (0xbeef, 0xbeef, 2, 0xdeadbeef, 3); | |
1073 | ||
1074 | /* Destination and source are the same size. */ | |
1075 | do_cint_test (0x8765432112345678, 0x8765432112345678, 8, 0x8765432112345678, | |
1076 | 8); | |
1077 | do_cint_test (0x432112345678, 0x432112345678, 6, 0x8765432112345678, 6); | |
1078 | do_cint_test (0xfeedbeaddeadbeef, 0xfeedbeaddeadbeef, 8, 0xfeedbeaddeadbeef, | |
1079 | 8); | |
1080 | do_cint_test (0xbeaddeadbeef, 0xbeaddeadbeef, 6, 0xfeedbeaddeadbeef, 6); | |
1081 | ||
1082 | /* Destination is bigger than the source. Source is bigger than 32bits. */ | |
1083 | do_cint_test (0x3412345678, 0x3412345678, 8, 0x3412345678, 6); | |
1084 | do_cint_test (0xff12345678, 0xff12345678, 8, 0xff12345678, 6); | |
1085 | do_cint_test (0x432112345678, 0x432112345678, 8, 0x8765432112345678, 6); | |
1086 | do_cint_test (0xff2112345678, 0xffffff2112345678, 8, 0xffffff2112345678, 6); | |
1087 | } | |
1088 | ||
1089 | } // namespace findvar_test | |
1090 | } // namespace selftests | |
1091 | ||
1092 | #endif | |
1093 | ||
1094 | void | |
1095 | _initialize_findvar (void) | |
1096 | { | |
1097 | #if GDB_SELF_TEST | |
1526853e SM |
1098 | selftests::register_test |
1099 | ("copy_integer_to_size", | |
1100 | selftests::findvar_tests::copy_integer_to_size_test); | |
b057297a AH |
1101 | #endif |
1102 | } |