]>
Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Find a variable's value in memory, for GDB, the GNU debugger. |
1bac305b AC |
2 | |
3 | Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, | |
9564ee9f | 4 | 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004 Free Software |
1bac305b | 5 | Foundation, Inc. |
c906108c | 6 | |
c5aa993b | 7 | This file is part of GDB. |
c906108c | 8 | |
c5aa993b JM |
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 | |
11 | the Free Software Foundation; either version 2 of the License, or | |
12 | (at your option) any later version. | |
c906108c | 13 | |
c5aa993b JM |
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. | |
c906108c | 18 | |
c5aa993b JM |
19 | You should have received a copy of the GNU General Public License |
20 | along with this program; if not, write to the Free Software | |
21 | Foundation, Inc., 59 Temple Place - Suite 330, | |
22 | Boston, MA 02111-1307, USA. */ | |
c906108c SS |
23 | |
24 | #include "defs.h" | |
25 | #include "symtab.h" | |
26 | #include "gdbtypes.h" | |
27 | #include "frame.h" | |
28 | #include "value.h" | |
29 | #include "gdbcore.h" | |
30 | #include "inferior.h" | |
31 | #include "target.h" | |
32 | #include "gdb_string.h" | |
14e534aa | 33 | #include "gdb_assert.h" |
c906108c | 34 | #include "floatformat.h" |
c5aa993b | 35 | #include "symfile.h" /* for overlay functions */ |
4e052eda | 36 | #include "regcache.h" |
eb8bc282 | 37 | #include "user-regs.h" |
fe898f56 | 38 | #include "block.h" |
c906108c | 39 | |
c906108c SS |
40 | /* Basic byte-swapping routines. GDB has needed these for a long time... |
41 | All extract a target-format integer at ADDR which is LEN bytes long. */ | |
42 | ||
43 | #if TARGET_CHAR_BIT != 8 || HOST_CHAR_BIT != 8 | |
44 | /* 8 bit characters are a pretty safe assumption these days, so we | |
45 | assume it throughout all these swapping routines. If we had to deal with | |
46 | 9 bit characters, we would need to make len be in bits and would have | |
47 | to re-write these routines... */ | |
c5aa993b | 48 | you lose |
c906108c SS |
49 | #endif |
50 | ||
a9ac8f51 | 51 | LONGEST |
37611a2b | 52 | extract_signed_integer (const void *addr, int len) |
c906108c SS |
53 | { |
54 | LONGEST retval; | |
37611a2b AC |
55 | const unsigned char *p; |
56 | const unsigned char *startaddr = addr; | |
57 | const unsigned char *endaddr = startaddr + len; | |
c906108c SS |
58 | |
59 | if (len > (int) sizeof (LONGEST)) | |
60 | error ("\ | |
61 | That operation is not available on integers of more than %d bytes.", | |
baa6f10b | 62 | (int) sizeof (LONGEST)); |
c906108c SS |
63 | |
64 | /* Start at the most significant end of the integer, and work towards | |
65 | the least significant. */ | |
d7449b42 | 66 | if (TARGET_BYTE_ORDER == BFD_ENDIAN_BIG) |
c906108c SS |
67 | { |
68 | p = startaddr; | |
69 | /* Do the sign extension once at the start. */ | |
c5aa993b | 70 | retval = ((LONGEST) * p ^ 0x80) - 0x80; |
c906108c SS |
71 | for (++p; p < endaddr; ++p) |
72 | retval = (retval << 8) | *p; | |
73 | } | |
74 | else | |
75 | { | |
76 | p = endaddr - 1; | |
77 | /* Do the sign extension once at the start. */ | |
c5aa993b | 78 | retval = ((LONGEST) * p ^ 0x80) - 0x80; |
c906108c SS |
79 | for (--p; p >= startaddr; --p) |
80 | retval = (retval << 8) | *p; | |
81 | } | |
82 | return retval; | |
83 | } | |
84 | ||
85 | ULONGEST | |
37611a2b | 86 | extract_unsigned_integer (const void *addr, int len) |
c906108c SS |
87 | { |
88 | ULONGEST retval; | |
37611a2b AC |
89 | const unsigned char *p; |
90 | const unsigned char *startaddr = addr; | |
91 | const unsigned char *endaddr = startaddr + len; | |
c906108c SS |
92 | |
93 | if (len > (int) sizeof (ULONGEST)) | |
94 | error ("\ | |
95 | That operation is not available on integers of more than %d bytes.", | |
baa6f10b | 96 | (int) sizeof (ULONGEST)); |
c906108c SS |
97 | |
98 | /* Start at the most significant end of the integer, and work towards | |
99 | the least significant. */ | |
100 | retval = 0; | |
d7449b42 | 101 | if (TARGET_BYTE_ORDER == BFD_ENDIAN_BIG) |
c906108c SS |
102 | { |
103 | for (p = startaddr; p < endaddr; ++p) | |
104 | retval = (retval << 8) | *p; | |
105 | } | |
106 | else | |
107 | { | |
108 | for (p = endaddr - 1; p >= startaddr; --p) | |
109 | retval = (retval << 8) | *p; | |
110 | } | |
111 | return retval; | |
112 | } | |
113 | ||
114 | /* Sometimes a long long unsigned integer can be extracted as a | |
115 | LONGEST value. This is done so that we can print these values | |
116 | better. If this integer can be converted to a LONGEST, this | |
117 | function returns 1 and sets *PVAL. Otherwise it returns 0. */ | |
118 | ||
119 | int | |
66140c26 | 120 | extract_long_unsigned_integer (const void *addr, int orig_len, LONGEST *pval) |
c906108c SS |
121 | { |
122 | char *p, *first_addr; | |
123 | int len; | |
124 | ||
125 | len = orig_len; | |
d7449b42 | 126 | if (TARGET_BYTE_ORDER == BFD_ENDIAN_BIG) |
c906108c SS |
127 | { |
128 | for (p = (char *) addr; | |
129 | len > (int) sizeof (LONGEST) && p < (char *) addr + orig_len; | |
130 | p++) | |
131 | { | |
132 | if (*p == 0) | |
133 | len--; | |
134 | else | |
135 | break; | |
136 | } | |
137 | first_addr = p; | |
138 | } | |
139 | else | |
140 | { | |
141 | first_addr = (char *) addr; | |
142 | for (p = (char *) addr + orig_len - 1; | |
143 | len > (int) sizeof (LONGEST) && p >= (char *) addr; | |
144 | p--) | |
145 | { | |
146 | if (*p == 0) | |
147 | len--; | |
148 | else | |
149 | break; | |
150 | } | |
151 | } | |
152 | ||
153 | if (len <= (int) sizeof (LONGEST)) | |
154 | { | |
155 | *pval = (LONGEST) extract_unsigned_integer (first_addr, | |
156 | sizeof (LONGEST)); | |
157 | return 1; | |
158 | } | |
159 | ||
160 | return 0; | |
161 | } | |
162 | ||
4478b372 | 163 | |
4478b372 JB |
164 | /* Treat the bytes at BUF as a pointer of type TYPE, and return the |
165 | address it represents. */ | |
166 | CORE_ADDR | |
66140c26 | 167 | extract_typed_address (const void *buf, struct type *type) |
4478b372 JB |
168 | { |
169 | if (TYPE_CODE (type) != TYPE_CODE_PTR | |
170 | && TYPE_CODE (type) != TYPE_CODE_REF) | |
8e65ff28 AC |
171 | internal_error (__FILE__, __LINE__, |
172 | "extract_typed_address: " | |
4478b372 JB |
173 | "type is not a pointer or reference"); |
174 | ||
175 | return POINTER_TO_ADDRESS (type, buf); | |
176 | } | |
177 | ||
178 | ||
c906108c | 179 | void |
a9ac8f51 | 180 | store_signed_integer (void *addr, int len, LONGEST val) |
c906108c SS |
181 | { |
182 | unsigned char *p; | |
c5aa993b | 183 | unsigned char *startaddr = (unsigned char *) addr; |
c906108c SS |
184 | unsigned char *endaddr = startaddr + len; |
185 | ||
186 | /* Start at the least significant end of the integer, and work towards | |
187 | the most significant. */ | |
d7449b42 | 188 | if (TARGET_BYTE_ORDER == BFD_ENDIAN_BIG) |
c906108c SS |
189 | { |
190 | for (p = endaddr - 1; p >= startaddr; --p) | |
191 | { | |
192 | *p = val & 0xff; | |
193 | val >>= 8; | |
194 | } | |
195 | } | |
196 | else | |
197 | { | |
198 | for (p = startaddr; p < endaddr; ++p) | |
199 | { | |
200 | *p = val & 0xff; | |
201 | val >>= 8; | |
202 | } | |
203 | } | |
204 | } | |
205 | ||
206 | void | |
a9ac8f51 | 207 | store_unsigned_integer (void *addr, int len, ULONGEST val) |
c906108c SS |
208 | { |
209 | unsigned char *p; | |
c5aa993b | 210 | unsigned char *startaddr = (unsigned char *) addr; |
c906108c SS |
211 | unsigned char *endaddr = startaddr + len; |
212 | ||
213 | /* Start at the least significant end of the integer, and work towards | |
214 | the most significant. */ | |
d7449b42 | 215 | if (TARGET_BYTE_ORDER == BFD_ENDIAN_BIG) |
c906108c SS |
216 | { |
217 | for (p = endaddr - 1; p >= startaddr; --p) | |
218 | { | |
219 | *p = val & 0xff; | |
220 | val >>= 8; | |
221 | } | |
222 | } | |
223 | else | |
224 | { | |
225 | for (p = startaddr; p < endaddr; ++p) | |
226 | { | |
227 | *p = val & 0xff; | |
228 | val >>= 8; | |
229 | } | |
230 | } | |
231 | } | |
232 | ||
4478b372 JB |
233 | /* Store the address ADDR as a pointer of type TYPE at BUF, in target |
234 | form. */ | |
235 | void | |
236 | store_typed_address (void *buf, struct type *type, CORE_ADDR addr) | |
237 | { | |
238 | if (TYPE_CODE (type) != TYPE_CODE_PTR | |
239 | && TYPE_CODE (type) != TYPE_CODE_REF) | |
8e65ff28 AC |
240 | internal_error (__FILE__, __LINE__, |
241 | "store_typed_address: " | |
4478b372 JB |
242 | "type is not a pointer or reference"); |
243 | ||
244 | ADDRESS_TO_POINTER (type, buf, addr); | |
245 | } | |
246 | ||
247 | ||
248 | ||
376c9600 AC |
249 | /* Return a `value' with the contents of (virtual or cooked) register |
250 | REGNUM as found in the specified FRAME. The register's type is | |
7b83296f | 251 | determined by register_type(). |
c906108c | 252 | |
376c9600 AC |
253 | NOTE: returns NULL if register value is not available. Caller will |
254 | check return value or die! */ | |
c906108c | 255 | |
3d6d86c6 | 256 | struct value * |
376c9600 | 257 | value_of_register (int regnum, struct frame_info *frame) |
c906108c SS |
258 | { |
259 | CORE_ADDR addr; | |
260 | int optim; | |
3d6d86c6 | 261 | struct value *reg_val; |
ac2adee5 | 262 | int realnum; |
d9d9c31f | 263 | char raw_buffer[MAX_REGISTER_SIZE]; |
c906108c SS |
264 | enum lval_type lval; |
265 | ||
9564ee9f | 266 | /* User registers lie completely outside of the range of normal |
0406ec40 AC |
267 | registers. Catch them early so that the target never sees them. */ |
268 | if (regnum >= NUM_REGS + NUM_PSEUDO_REGS) | |
eb8bc282 | 269 | return value_of_user_reg (regnum, frame); |
0406ec40 | 270 | |
ac2adee5 | 271 | frame_register (frame, regnum, &optim, &lval, &addr, &realnum, raw_buffer); |
c906108c | 272 | |
c97dcfc7 AC |
273 | /* FIXME: cagney/2002-05-15: This test is just bogus. |
274 | ||
275 | It indicates that the target failed to supply a value for a | |
276 | register because it was "not available" at this time. Problem | |
277 | is, the target still has the register and so get saved_register() | |
278 | may be returning a value saved on the stack. */ | |
279 | ||
32178cab | 280 | if (register_cached (regnum) < 0) |
c5aa993b | 281 | return NULL; /* register value not available */ |
c906108c | 282 | |
7b83296f | 283 | reg_val = allocate_value (register_type (current_gdbarch, regnum)); |
c906108c | 284 | |
01e1877c AC |
285 | memcpy (VALUE_CONTENTS_RAW (reg_val), raw_buffer, |
286 | register_size (current_gdbarch, regnum)); | |
c906108c SS |
287 | VALUE_LVAL (reg_val) = lval; |
288 | VALUE_ADDRESS (reg_val) = addr; | |
289 | VALUE_REGNO (reg_val) = regnum; | |
290 | VALUE_OPTIMIZED_OUT (reg_val) = optim; | |
291 | return reg_val; | |
292 | } | |
4478b372 JB |
293 | |
294 | /* Given a pointer of type TYPE in target form in BUF, return the | |
295 | address it represents. */ | |
296 | CORE_ADDR | |
66140c26 | 297 | unsigned_pointer_to_address (struct type *type, const void *buf) |
4478b372 | 298 | { |
af1342ab | 299 | return extract_unsigned_integer (buf, TYPE_LENGTH (type)); |
4478b372 JB |
300 | } |
301 | ||
ac2e2ef7 | 302 | CORE_ADDR |
66140c26 | 303 | signed_pointer_to_address (struct type *type, const void *buf) |
ac2e2ef7 AC |
304 | { |
305 | return extract_signed_integer (buf, TYPE_LENGTH (type)); | |
306 | } | |
4478b372 JB |
307 | |
308 | /* Given an address, store it as a pointer of type TYPE in target | |
309 | format in BUF. */ | |
310 | void | |
ac2e2ef7 | 311 | unsigned_address_to_pointer (struct type *type, void *buf, CORE_ADDR addr) |
4478b372 | 312 | { |
fbd9dcd3 | 313 | store_unsigned_integer (buf, TYPE_LENGTH (type), addr); |
4478b372 JB |
314 | } |
315 | ||
ac2e2ef7 AC |
316 | void |
317 | address_to_signed_pointer (struct type *type, void *buf, CORE_ADDR addr) | |
318 | { | |
319 | store_signed_integer (buf, TYPE_LENGTH (type), addr); | |
320 | } | |
c906108c SS |
321 | \f |
322 | /* Will calling read_var_value or locate_var_value on SYM end | |
323 | up caring what frame it is being evaluated relative to? SYM must | |
324 | be non-NULL. */ | |
325 | int | |
fba45db2 | 326 | symbol_read_needs_frame (struct symbol *sym) |
c906108c SS |
327 | { |
328 | switch (SYMBOL_CLASS (sym)) | |
329 | { | |
330 | /* All cases listed explicitly so that gcc -Wall will detect it if | |
c5aa993b | 331 | we failed to consider one. */ |
4c2df51b DJ |
332 | case LOC_COMPUTED: |
333 | case LOC_COMPUTED_ARG: | |
a67af2b9 AC |
334 | /* FIXME: cagney/2004-01-26: It should be possible to |
335 | unconditionally call the SYMBOL_OPS method when available. | |
d3efc286 | 336 | Unfortunately DWARF 2 stores the frame-base (instead of the |
a67af2b9 AC |
337 | function) location in a function's symbol. Oops! For the |
338 | moment enable this when/where applicable. */ | |
339 | return SYMBOL_OPS (sym)->read_needs_frame (sym); | |
4c2df51b | 340 | |
c906108c SS |
341 | case LOC_REGISTER: |
342 | case LOC_ARG: | |
343 | case LOC_REF_ARG: | |
344 | case LOC_REGPARM: | |
345 | case LOC_REGPARM_ADDR: | |
346 | case LOC_LOCAL: | |
347 | case LOC_LOCAL_ARG: | |
348 | case LOC_BASEREG: | |
349 | case LOC_BASEREG_ARG: | |
407caf07 | 350 | case LOC_HP_THREAD_LOCAL_STATIC: |
c906108c SS |
351 | return 1; |
352 | ||
353 | case LOC_UNDEF: | |
354 | case LOC_CONST: | |
355 | case LOC_STATIC: | |
356 | case LOC_INDIRECT: | |
357 | case LOC_TYPEDEF: | |
358 | ||
359 | case LOC_LABEL: | |
360 | /* Getting the address of a label can be done independently of the block, | |
c5aa993b JM |
361 | even if some *uses* of that address wouldn't work so well without |
362 | the right frame. */ | |
c906108c SS |
363 | |
364 | case LOC_BLOCK: | |
365 | case LOC_CONST_BYTES: | |
366 | case LOC_UNRESOLVED: | |
367 | case LOC_OPTIMIZED_OUT: | |
368 | return 0; | |
369 | } | |
370 | return 1; | |
371 | } | |
372 | ||
373 | /* Given a struct symbol for a variable, | |
374 | and a stack frame id, read the value of the variable | |
375 | and return a (pointer to a) struct value containing the value. | |
376 | If the variable cannot be found, return a zero pointer. | |
6e7f8b9c | 377 | If FRAME is NULL, use the deprecated_selected_frame. */ |
c906108c | 378 | |
3d6d86c6 | 379 | struct value * |
aa1ee363 | 380 | read_var_value (struct symbol *var, struct frame_info *frame) |
c906108c | 381 | { |
52f0bd74 | 382 | struct value *v; |
c906108c SS |
383 | struct type *type = SYMBOL_TYPE (var); |
384 | CORE_ADDR addr; | |
52f0bd74 | 385 | int len; |
c906108c SS |
386 | |
387 | v = allocate_value (type); | |
388 | VALUE_LVAL (v) = lval_memory; /* The most likely possibility. */ | |
389 | VALUE_BFD_SECTION (v) = SYMBOL_BFD_SECTION (var); | |
390 | ||
391 | len = TYPE_LENGTH (type); | |
392 | ||
7dd88986 DJ |
393 | |
394 | /* FIXME drow/2003-09-06: this call to the selected frame should be | |
395 | pushed upwards to the callers. */ | |
c5aa993b | 396 | if (frame == NULL) |
7dd88986 | 397 | frame = deprecated_safe_get_selected_frame (); |
c906108c SS |
398 | |
399 | switch (SYMBOL_CLASS (var)) | |
400 | { | |
401 | case LOC_CONST: | |
402 | /* Put the constant back in target format. */ | |
403 | store_signed_integer (VALUE_CONTENTS_RAW (v), len, | |
404 | (LONGEST) SYMBOL_VALUE (var)); | |
405 | VALUE_LVAL (v) = not_lval; | |
406 | return v; | |
407 | ||
408 | case LOC_LABEL: | |
409 | /* Put the constant back in target format. */ | |
410 | if (overlay_debugging) | |
4478b372 JB |
411 | { |
412 | CORE_ADDR addr | |
413 | = symbol_overlayed_address (SYMBOL_VALUE_ADDRESS (var), | |
414 | SYMBOL_BFD_SECTION (var)); | |
415 | store_typed_address (VALUE_CONTENTS_RAW (v), type, addr); | |
416 | } | |
c906108c | 417 | else |
4478b372 JB |
418 | store_typed_address (VALUE_CONTENTS_RAW (v), type, |
419 | SYMBOL_VALUE_ADDRESS (var)); | |
c906108c SS |
420 | VALUE_LVAL (v) = not_lval; |
421 | return v; | |
422 | ||
423 | case LOC_CONST_BYTES: | |
424 | { | |
425 | char *bytes_addr; | |
426 | bytes_addr = SYMBOL_VALUE_BYTES (var); | |
427 | memcpy (VALUE_CONTENTS_RAW (v), bytes_addr, len); | |
428 | VALUE_LVAL (v) = not_lval; | |
429 | return v; | |
430 | } | |
431 | ||
432 | case LOC_STATIC: | |
433 | if (overlay_debugging) | |
434 | addr = symbol_overlayed_address (SYMBOL_VALUE_ADDRESS (var), | |
435 | SYMBOL_BFD_SECTION (var)); | |
436 | else | |
437 | addr = SYMBOL_VALUE_ADDRESS (var); | |
438 | break; | |
439 | ||
440 | case LOC_INDIRECT: | |
f76febae AC |
441 | { |
442 | /* The import slot does not have a real address in it from the | |
443 | dynamic loader (dld.sl on HP-UX), if the target hasn't | |
444 | begun execution yet, so check for that. */ | |
445 | CORE_ADDR locaddr; | |
446 | struct value *loc; | |
447 | if (!target_has_execution) | |
448 | error ("\ | |
c906108c SS |
449 | Attempt to access variable defined in different shared object or load module when\n\ |
450 | addresses have not been bound by the dynamic loader. Try again when executable is running."); | |
c5aa993b | 451 | |
f76febae AC |
452 | locaddr = SYMBOL_VALUE_ADDRESS (var); |
453 | loc = value_at (lookup_pointer_type (type), locaddr, NULL); | |
1aa20aa8 | 454 | addr = value_as_address (loc); |
f76febae | 455 | } |
c906108c SS |
456 | |
457 | case LOC_ARG: | |
458 | if (frame == NULL) | |
459 | return 0; | |
da62e633 | 460 | addr = get_frame_args_address (frame); |
c906108c SS |
461 | if (!addr) |
462 | return 0; | |
463 | addr += SYMBOL_VALUE (var); | |
464 | break; | |
465 | ||
466 | case LOC_REF_ARG: | |
f76febae AC |
467 | { |
468 | struct value *ref; | |
469 | CORE_ADDR argref; | |
470 | if (frame == NULL) | |
471 | return 0; | |
da62e633 | 472 | argref = get_frame_args_address (frame); |
f76febae AC |
473 | if (!argref) |
474 | return 0; | |
475 | argref += SYMBOL_VALUE (var); | |
476 | ref = value_at (lookup_pointer_type (type), argref, NULL); | |
1aa20aa8 | 477 | addr = value_as_address (ref); |
f76febae AC |
478 | break; |
479 | } | |
c906108c SS |
480 | |
481 | case LOC_LOCAL: | |
482 | case LOC_LOCAL_ARG: | |
483 | if (frame == NULL) | |
484 | return 0; | |
da62e633 | 485 | addr = get_frame_locals_address (frame); |
c906108c SS |
486 | addr += SYMBOL_VALUE (var); |
487 | break; | |
488 | ||
489 | case LOC_BASEREG: | |
490 | case LOC_BASEREG_ARG: | |
407caf07 | 491 | case LOC_HP_THREAD_LOCAL_STATIC: |
c906108c | 492 | { |
3d6d86c6 | 493 | struct value *regval; |
c5aa993b | 494 | |
9ed10b08 ND |
495 | regval = value_from_register (lookup_pointer_type (type), |
496 | SYMBOL_BASEREG (var), frame); | |
497 | if (regval == NULL) | |
498 | error ("Value of base register not available."); | |
1aa20aa8 | 499 | addr = value_as_address (regval); |
c5aa993b JM |
500 | addr += SYMBOL_VALUE (var); |
501 | break; | |
c906108c | 502 | } |
c5aa993b | 503 | |
c906108c SS |
504 | case LOC_TYPEDEF: |
505 | error ("Cannot look up value of a typedef"); | |
506 | break; | |
507 | ||
508 | case LOC_BLOCK: | |
509 | if (overlay_debugging) | |
c5aa993b | 510 | VALUE_ADDRESS (v) = symbol_overlayed_address |
c906108c SS |
511 | (BLOCK_START (SYMBOL_BLOCK_VALUE (var)), SYMBOL_BFD_SECTION (var)); |
512 | else | |
513 | VALUE_ADDRESS (v) = BLOCK_START (SYMBOL_BLOCK_VALUE (var)); | |
514 | return v; | |
515 | ||
516 | case LOC_REGISTER: | |
517 | case LOC_REGPARM: | |
518 | case LOC_REGPARM_ADDR: | |
519 | { | |
520 | struct block *b; | |
521 | int regno = SYMBOL_VALUE (var); | |
3d6d86c6 | 522 | struct value *regval; |
c906108c SS |
523 | |
524 | if (frame == NULL) | |
525 | return 0; | |
ae767bfb | 526 | b = get_frame_block (frame, 0); |
c906108c SS |
527 | |
528 | if (SYMBOL_CLASS (var) == LOC_REGPARM_ADDR) | |
529 | { | |
530 | regval = value_from_register (lookup_pointer_type (type), | |
c5aa993b | 531 | regno, |
c906108c SS |
532 | frame); |
533 | ||
534 | if (regval == NULL) | |
535 | error ("Value of register variable not available."); | |
536 | ||
1aa20aa8 | 537 | addr = value_as_address (regval); |
c906108c SS |
538 | VALUE_LVAL (v) = lval_memory; |
539 | } | |
540 | else | |
541 | { | |
542 | regval = value_from_register (type, regno, frame); | |
543 | ||
544 | if (regval == NULL) | |
545 | error ("Value of register variable not available."); | |
546 | return regval; | |
547 | } | |
548 | } | |
549 | break; | |
550 | ||
4c2df51b DJ |
551 | case LOC_COMPUTED: |
552 | case LOC_COMPUTED_ARG: | |
a67af2b9 AC |
553 | /* FIXME: cagney/2004-01-26: It should be possible to |
554 | unconditionally call the SYMBOL_OPS method when available. | |
d3efc286 | 555 | Unfortunately DWARF 2 stores the frame-base (instead of the |
a67af2b9 AC |
556 | function) location in a function's symbol. Oops! For the |
557 | moment enable this when/where applicable. */ | |
558 | if (frame == 0 && SYMBOL_OPS (var)->read_needs_frame (var)) | |
559 | return 0; | |
560 | return SYMBOL_OPS (var)->read_variable (var, frame); | |
4c2df51b | 561 | |
c906108c SS |
562 | case LOC_UNRESOLVED: |
563 | { | |
564 | struct minimal_symbol *msym; | |
565 | ||
22abf04a | 566 | msym = lookup_minimal_symbol (DEPRECATED_SYMBOL_NAME (var), NULL, NULL); |
c906108c SS |
567 | if (msym == NULL) |
568 | return 0; | |
569 | if (overlay_debugging) | |
570 | addr = symbol_overlayed_address (SYMBOL_VALUE_ADDRESS (msym), | |
571 | SYMBOL_BFD_SECTION (msym)); | |
572 | else | |
573 | addr = SYMBOL_VALUE_ADDRESS (msym); | |
574 | } | |
575 | break; | |
576 | ||
577 | case LOC_OPTIMIZED_OUT: | |
578 | VALUE_LVAL (v) = not_lval; | |
579 | VALUE_OPTIMIZED_OUT (v) = 1; | |
580 | return v; | |
581 | ||
582 | default: | |
583 | error ("Cannot look up value of a botched symbol."); | |
584 | break; | |
585 | } | |
586 | ||
587 | VALUE_ADDRESS (v) = addr; | |
588 | VALUE_LAZY (v) = 1; | |
589 | return v; | |
590 | } | |
591 | ||
592 | /* Return a value of type TYPE, stored in register REGNUM, in frame | |
0f2c5ba5 | 593 | FRAME. |
c906108c SS |
594 | |
595 | NOTE: returns NULL if register value is not available. | |
596 | Caller will check return value or die! */ | |
597 | ||
3d6d86c6 | 598 | struct value * |
fba45db2 | 599 | value_from_register (struct type *type, int regnum, struct frame_info *frame) |
c906108c | 600 | { |
ff2e87ac | 601 | struct gdbarch *gdbarch = get_frame_arch (frame); |
3d6d86c6 | 602 | struct value *v = allocate_value (type); |
c906108c | 603 | CHECK_TYPEDEF (type); |
c906108c | 604 | |
4589a601 JB |
605 | if (TYPE_LENGTH (type) == 0) |
606 | { | |
607 | /* It doesn't matter much what we return for this: since the | |
608 | length is zero, it could be anything. But if allowed to see | |
609 | a zero-length type, the register-finding loop below will set | |
610 | neither mem_stor nor reg_stor, and then report an internal | |
611 | error. | |
612 | ||
613 | Zero-length types can legitimately arise from declarations | |
f98c22d5 JB |
614 | like 'struct {}' (a GCC extension, not valid ISO C). GDB may |
615 | also create them when it finds bogus debugging information; | |
616 | for example, in GCC 2.95.4 and binutils 2.11.93.0.2, the | |
617 | STABS BINCL->EXCL compression process can create bad type | |
618 | numbers. GDB reads these as TYPE_CODE_UNDEF types, with zero | |
619 | length. (That bug is actually the only known way to get a | |
620 | zero-length value allocated to a register --- which is what | |
621 | it takes to make it here.) | |
4589a601 JB |
622 | |
623 | We'll just attribute the value to the original register. */ | |
624 | VALUE_LVAL (v) = lval_register; | |
625 | VALUE_ADDRESS (v) = regnum; | |
626 | VALUE_REGNO (v) = regnum; | |
627 | } | |
628 | else if (CONVERT_REGISTER_P (regnum, type)) | |
ff2e87ac AC |
629 | { |
630 | /* The ISA/ABI need to something weird when obtaining the | |
631 | specified value from this register. It might need to | |
632 | re-order non-adjacent, starting with REGNUM (see MIPS and | |
633 | i386). It might need to convert the [float] register into | |
634 | the corresponding [integer] type (see Alpha). The assumption | |
635 | is that REGISTER_TO_VALUE populates the entire value | |
636 | including the location. */ | |
637 | REGISTER_TO_VALUE (frame, regnum, type, VALUE_CONTENTS_RAW (v)); | |
638 | VALUE_LVAL (v) = lval_reg_frame_relative; | |
639 | VALUE_FRAME_ID (v) = get_frame_id (frame); | |
640 | VALUE_FRAME_REGNUM (v) = regnum; | |
641 | } | |
642 | else | |
c906108c | 643 | { |
c906108c SS |
644 | int local_regnum; |
645 | int mem_stor = 0, reg_stor = 0; | |
646 | int mem_tracking = 1; | |
647 | CORE_ADDR last_addr = 0; | |
648 | CORE_ADDR first_addr = 0; | |
ff2e87ac AC |
649 | int first_realnum = regnum; |
650 | int len = TYPE_LENGTH (type); | |
651 | int value_bytes_copied; | |
652 | int optimized = 0; | |
653 | char *value_bytes = (char *) alloca (len + MAX_REGISTER_SIZE); | |
c906108c SS |
654 | |
655 | /* Copy all of the data out, whereever it may be. */ | |
ff2e87ac AC |
656 | for (local_regnum = regnum, value_bytes_copied = 0; |
657 | value_bytes_copied < len; | |
12c266ea | 658 | (value_bytes_copied += DEPRECATED_REGISTER_RAW_SIZE (local_regnum), |
ff2e87ac AC |
659 | ++local_regnum)) |
660 | { | |
661 | int realnum; | |
662 | int optim; | |
663 | enum lval_type lval; | |
664 | CORE_ADDR addr; | |
665 | frame_register (frame, local_regnum, &optim, &lval, &addr, | |
666 | &realnum, value_bytes + value_bytes_copied); | |
667 | optimized += optim; | |
668 | if (register_cached (local_regnum) == -1) | |
669 | return NULL; /* register value not available */ | |
670 | ||
671 | if (regnum == local_regnum) | |
672 | { | |
c906108c | 673 | first_addr = addr; |
ff2e87ac AC |
674 | first_realnum = realnum; |
675 | } | |
676 | if (lval == lval_register) | |
677 | reg_stor++; | |
678 | else | |
679 | { | |
680 | mem_stor++; | |
681 | ||
682 | mem_tracking = (mem_tracking | |
683 | && (regnum == local_regnum | |
684 | || addr == last_addr)); | |
685 | } | |
686 | last_addr = addr; | |
687 | } | |
688 | ||
689 | /* FIXME: cagney/2003-06-04: Shouldn't this always use | |
690 | lval_reg_frame_relative? If it doesn't and the register's | |
691 | location changes (say after a resume) then this value is | |
692 | going to have wrong information. */ | |
c906108c SS |
693 | if ((reg_stor && mem_stor) |
694 | || (mem_stor && !mem_tracking)) | |
695 | /* Mixed storage; all of the hassle we just went through was | |
696 | for some good purpose. */ | |
697 | { | |
698 | VALUE_LVAL (v) = lval_reg_frame_relative; | |
1df6926e | 699 | VALUE_FRAME_ID (v) = get_frame_id (frame); |
c906108c SS |
700 | VALUE_FRAME_REGNUM (v) = regnum; |
701 | } | |
702 | else if (mem_stor) | |
703 | { | |
704 | VALUE_LVAL (v) = lval_memory; | |
705 | VALUE_ADDRESS (v) = first_addr; | |
706 | } | |
707 | else if (reg_stor) | |
708 | { | |
709 | VALUE_LVAL (v) = lval_register; | |
710 | VALUE_ADDRESS (v) = first_addr; | |
ff2e87ac | 711 | VALUE_REGNO (v) = first_realnum; |
c906108c SS |
712 | } |
713 | else | |
8e65ff28 AC |
714 | internal_error (__FILE__, __LINE__, |
715 | "value_from_register: Value not stored anywhere!"); | |
ff2e87ac AC |
716 | |
717 | VALUE_OPTIMIZED_OUT (v) = optimized; | |
718 | ||
c906108c | 719 | /* Any structure stored in more than one register will always be |
ff2e87ac | 720 | an integral number of registers. Otherwise, you need to do |
c5aa993b JM |
721 | some fiddling with the last register copied here for little |
722 | endian machines. */ | |
ff2e87ac | 723 | if (TARGET_BYTE_ORDER == BFD_ENDIAN_BIG |
12c266ea | 724 | && len < DEPRECATED_REGISTER_RAW_SIZE (regnum)) |
ff2e87ac | 725 | /* Big-endian, and we want less than full size. */ |
12c266ea | 726 | VALUE_OFFSET (v) = DEPRECATED_REGISTER_RAW_SIZE (regnum) - len; |
ff2e87ac AC |
727 | else |
728 | VALUE_OFFSET (v) = 0; | |
729 | memcpy (VALUE_CONTENTS_RAW (v), value_bytes + VALUE_OFFSET (v), len); | |
c906108c | 730 | } |
c906108c SS |
731 | return v; |
732 | } | |
ff2e87ac | 733 | |
c906108c SS |
734 | \f |
735 | /* Given a struct symbol for a variable or function, | |
736 | and a stack frame id, | |
737 | return a (pointer to a) struct value containing the properly typed | |
738 | address. */ | |
739 | ||
3d6d86c6 | 740 | struct value * |
aa1ee363 | 741 | locate_var_value (struct symbol *var, struct frame_info *frame) |
c906108c SS |
742 | { |
743 | CORE_ADDR addr = 0; | |
744 | struct type *type = SYMBOL_TYPE (var); | |
3d6d86c6 | 745 | struct value *lazy_value; |
c906108c SS |
746 | |
747 | /* Evaluate it first; if the result is a memory address, we're fine. | |
748 | Lazy evaluation pays off here. */ | |
749 | ||
750 | lazy_value = read_var_value (var, frame); | |
751 | if (lazy_value == 0) | |
de5ad195 | 752 | error ("Address of \"%s\" is unknown.", SYMBOL_PRINT_NAME (var)); |
c906108c SS |
753 | |
754 | if (VALUE_LAZY (lazy_value) | |
755 | || TYPE_CODE (type) == TYPE_CODE_FUNC) | |
756 | { | |
3d6d86c6 | 757 | struct value *val; |
c906108c SS |
758 | |
759 | addr = VALUE_ADDRESS (lazy_value); | |
4478b372 | 760 | val = value_from_pointer (lookup_pointer_type (type), addr); |
c906108c SS |
761 | VALUE_BFD_SECTION (val) = VALUE_BFD_SECTION (lazy_value); |
762 | return val; | |
763 | } | |
764 | ||
765 | /* Not a memory address; check what the problem was. */ | |
c5aa993b | 766 | switch (VALUE_LVAL (lazy_value)) |
c906108c SS |
767 | { |
768 | case lval_register: | |
14e534aa PM |
769 | gdb_assert (REGISTER_NAME (VALUE_REGNO (lazy_value)) != NULL |
770 | && *REGISTER_NAME (VALUE_REGNO (lazy_value)) != '\0'); | |
771 | error("Address requested for identifier " | |
772 | "\"%s\" which is in register $%s", | |
de5ad195 | 773 | SYMBOL_PRINT_NAME (var), |
14e534aa PM |
774 | REGISTER_NAME (VALUE_REGNO (lazy_value))); |
775 | break; | |
776 | ||
c906108c | 777 | case lval_reg_frame_relative: |
14e534aa PM |
778 | gdb_assert (REGISTER_NAME (VALUE_FRAME_REGNUM (lazy_value)) != NULL |
779 | && *REGISTER_NAME (VALUE_FRAME_REGNUM (lazy_value)) != '\0'); | |
780 | error("Address requested for identifier " | |
781 | "\"%s\" which is in frame register $%s", | |
de5ad195 | 782 | SYMBOL_PRINT_NAME (var), |
14e534aa | 783 | REGISTER_NAME (VALUE_FRAME_REGNUM (lazy_value))); |
c906108c SS |
784 | break; |
785 | ||
786 | default: | |
787 | error ("Can't take address of \"%s\" which isn't an lvalue.", | |
de5ad195 | 788 | SYMBOL_PRINT_NAME (var)); |
c906108c SS |
789 | break; |
790 | } | |
c5aa993b | 791 | return 0; /* For lint -- never reached */ |
c906108c | 792 | } |