ppc-aix osabi sniffer: Turn test of bfd flavour into assertion
[deliverable/binutils-gdb.git] / gdb / findvar.c
1 /* Find a variable's value in memory, for GDB, the GNU debugger.
2
3 Copyright (C) 1986-2001, 2003-2005, 2007-2012 Free Software
4 Foundation, Inc.
5
6 This file is part of GDB.
7
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
12
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
17
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
20
21 #include "defs.h"
22 #include "symtab.h"
23 #include "gdbtypes.h"
24 #include "frame.h"
25 #include "value.h"
26 #include "gdbcore.h"
27 #include "inferior.h"
28 #include "target.h"
29 #include "gdb_string.h"
30 #include "gdb_assert.h"
31 #include "floatformat.h"
32 #include "symfile.h" /* for overlay functions */
33 #include "regcache.h"
34 #include "user-regs.h"
35 #include "block.h"
36 #include "objfiles.h"
37 #include "language.h"
38
39 /* Basic byte-swapping routines. All 'extract' functions return a
40 host-format integer from a target-format integer at ADDR which is
41 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... */
48 you lose
49 #endif
50
51 LONGEST
52 extract_signed_integer (const gdb_byte *addr, int len,
53 enum bfd_endian byte_order)
54 {
55 LONGEST retval;
56 const unsigned char *p;
57 const unsigned char *startaddr = addr;
58 const unsigned char *endaddr = startaddr + len;
59
60 if (len > (int) sizeof (LONGEST))
61 error (_("\
62 That operation is not available on integers of more than %d bytes."),
63 (int) sizeof (LONGEST));
64
65 /* Start at the most significant end of the integer, and work towards
66 the least significant. */
67 if (byte_order == BFD_ENDIAN_BIG)
68 {
69 p = startaddr;
70 /* Do the sign extension once at the start. */
71 retval = ((LONGEST) * p ^ 0x80) - 0x80;
72 for (++p; p < endaddr; ++p)
73 retval = (retval << 8) | *p;
74 }
75 else
76 {
77 p = endaddr - 1;
78 /* Do the sign extension once at the start. */
79 retval = ((LONGEST) * p ^ 0x80) - 0x80;
80 for (--p; p >= startaddr; --p)
81 retval = (retval << 8) | *p;
82 }
83 return retval;
84 }
85
86 ULONGEST
87 extract_unsigned_integer (const gdb_byte *addr, int len,
88 enum bfd_endian byte_order)
89 {
90 ULONGEST retval;
91 const unsigned char *p;
92 const unsigned char *startaddr = addr;
93 const unsigned char *endaddr = startaddr + len;
94
95 if (len > (int) sizeof (ULONGEST))
96 error (_("\
97 That operation is not available on integers of more than %d bytes."),
98 (int) sizeof (ULONGEST));
99
100 /* Start at the most significant end of the integer, and work towards
101 the least significant. */
102 retval = 0;
103 if (byte_order == BFD_ENDIAN_BIG)
104 {
105 for (p = startaddr; p < endaddr; ++p)
106 retval = (retval << 8) | *p;
107 }
108 else
109 {
110 for (p = endaddr - 1; p >= startaddr; --p)
111 retval = (retval << 8) | *p;
112 }
113 return retval;
114 }
115
116 /* Sometimes a long long unsigned integer can be extracted as a
117 LONGEST value. This is done so that we can print these values
118 better. If this integer can be converted to a LONGEST, this
119 function returns 1 and sets *PVAL. Otherwise it returns 0. */
120
121 int
122 extract_long_unsigned_integer (const gdb_byte *addr, int orig_len,
123 enum bfd_endian byte_order, LONGEST *pval)
124 {
125 const gdb_byte *p;
126 const gdb_byte *first_addr;
127 int len;
128
129 len = orig_len;
130 if (byte_order == BFD_ENDIAN_BIG)
131 {
132 for (p = addr;
133 len > (int) sizeof (LONGEST) && p < addr + orig_len;
134 p++)
135 {
136 if (*p == 0)
137 len--;
138 else
139 break;
140 }
141 first_addr = p;
142 }
143 else
144 {
145 first_addr = addr;
146 for (p = addr + orig_len - 1;
147 len > (int) sizeof (LONGEST) && p >= addr;
148 p--)
149 {
150 if (*p == 0)
151 len--;
152 else
153 break;
154 }
155 }
156
157 if (len <= (int) sizeof (LONGEST))
158 {
159 *pval = (LONGEST) extract_unsigned_integer (first_addr,
160 sizeof (LONGEST),
161 byte_order);
162 return 1;
163 }
164
165 return 0;
166 }
167
168
169 /* Treat the bytes at BUF as a pointer of type TYPE, and return the
170 address it represents. */
171 CORE_ADDR
172 extract_typed_address (const gdb_byte *buf, struct type *type)
173 {
174 if (TYPE_CODE (type) != TYPE_CODE_PTR
175 && TYPE_CODE (type) != TYPE_CODE_REF)
176 internal_error (__FILE__, __LINE__,
177 _("extract_typed_address: "
178 "type is not a pointer or reference"));
179
180 return gdbarch_pointer_to_address (get_type_arch (type), type, buf);
181 }
182
183 /* All 'store' functions accept a host-format integer and store a
184 target-format integer at ADDR which is LEN bytes long. */
185
186 void
187 store_signed_integer (gdb_byte *addr, int len,
188 enum bfd_endian byte_order, LONGEST val)
189 {
190 gdb_byte *p;
191 gdb_byte *startaddr = addr;
192 gdb_byte *endaddr = startaddr + len;
193
194 /* Start at the least significant end of the integer, and work towards
195 the most significant. */
196 if (byte_order == BFD_ENDIAN_BIG)
197 {
198 for (p = endaddr - 1; p >= startaddr; --p)
199 {
200 *p = val & 0xff;
201 val >>= 8;
202 }
203 }
204 else
205 {
206 for (p = startaddr; p < endaddr; ++p)
207 {
208 *p = val & 0xff;
209 val >>= 8;
210 }
211 }
212 }
213
214 void
215 store_unsigned_integer (gdb_byte *addr, int len,
216 enum bfd_endian byte_order, ULONGEST val)
217 {
218 unsigned char *p;
219 unsigned char *startaddr = (unsigned char *) addr;
220 unsigned char *endaddr = startaddr + len;
221
222 /* Start at the least significant end of the integer, and work towards
223 the most significant. */
224 if (byte_order == BFD_ENDIAN_BIG)
225 {
226 for (p = endaddr - 1; p >= startaddr; --p)
227 {
228 *p = val & 0xff;
229 val >>= 8;
230 }
231 }
232 else
233 {
234 for (p = startaddr; p < endaddr; ++p)
235 {
236 *p = val & 0xff;
237 val >>= 8;
238 }
239 }
240 }
241
242 /* Store the address ADDR as a pointer of type TYPE at BUF, in target
243 form. */
244 void
245 store_typed_address (gdb_byte *buf, struct type *type, CORE_ADDR addr)
246 {
247 if (TYPE_CODE (type) != TYPE_CODE_PTR
248 && TYPE_CODE (type) != TYPE_CODE_REF)
249 internal_error (__FILE__, __LINE__,
250 _("store_typed_address: "
251 "type is not a pointer or reference"));
252
253 gdbarch_address_to_pointer (get_type_arch (type), type, buf, addr);
254 }
255
256
257
258 /* Return a `value' with the contents of (virtual or cooked) register
259 REGNUM as found in the specified FRAME. The register's type is
260 determined by register_type(). */
261
262 struct value *
263 value_of_register (int regnum, struct frame_info *frame)
264 {
265 struct gdbarch *gdbarch = get_frame_arch (frame);
266 CORE_ADDR addr;
267 int optim;
268 int unavail;
269 struct value *reg_val;
270 int realnum;
271 gdb_byte raw_buffer[MAX_REGISTER_SIZE];
272 enum lval_type lval;
273
274 /* User registers lie completely outside of the range of normal
275 registers. Catch them early so that the target never sees them. */
276 if (regnum >= gdbarch_num_regs (gdbarch)
277 + gdbarch_num_pseudo_regs (gdbarch))
278 return value_of_user_reg (regnum, frame);
279
280 frame_register (frame, regnum, &optim, &unavail,
281 &lval, &addr, &realnum, raw_buffer);
282
283 reg_val = allocate_value (register_type (gdbarch, regnum));
284
285 if (!optim && !unavail)
286 memcpy (value_contents_raw (reg_val), raw_buffer,
287 register_size (gdbarch, regnum));
288 else
289 memset (value_contents_raw (reg_val), 0,
290 register_size (gdbarch, regnum));
291
292 VALUE_LVAL (reg_val) = lval;
293 set_value_address (reg_val, addr);
294 VALUE_REGNUM (reg_val) = regnum;
295 set_value_optimized_out (reg_val, optim);
296 if (unavail)
297 mark_value_bytes_unavailable (reg_val, 0, register_size (gdbarch, regnum));
298 VALUE_FRAME_ID (reg_val) = get_frame_id (frame);
299 return reg_val;
300 }
301
302 /* Return a `value' with the contents of (virtual or cooked) register
303 REGNUM as found in the specified FRAME. The register's type is
304 determined by register_type(). The value is not fetched. */
305
306 struct value *
307 value_of_register_lazy (struct frame_info *frame, int regnum)
308 {
309 struct gdbarch *gdbarch = get_frame_arch (frame);
310 struct value *reg_val;
311
312 gdb_assert (regnum < (gdbarch_num_regs (gdbarch)
313 + gdbarch_num_pseudo_regs (gdbarch)));
314
315 /* We should have a valid (i.e. non-sentinel) frame. */
316 gdb_assert (frame_id_p (get_frame_id (frame)));
317
318 reg_val = allocate_value_lazy (register_type (gdbarch, regnum));
319 VALUE_LVAL (reg_val) = lval_register;
320 VALUE_REGNUM (reg_val) = regnum;
321 VALUE_FRAME_ID (reg_val) = get_frame_id (frame);
322 return reg_val;
323 }
324
325 /* Given a pointer of type TYPE in target form in BUF, return the
326 address it represents. */
327 CORE_ADDR
328 unsigned_pointer_to_address (struct gdbarch *gdbarch,
329 struct type *type, const gdb_byte *buf)
330 {
331 enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
332
333 return extract_unsigned_integer (buf, TYPE_LENGTH (type), byte_order);
334 }
335
336 CORE_ADDR
337 signed_pointer_to_address (struct gdbarch *gdbarch,
338 struct type *type, const gdb_byte *buf)
339 {
340 enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
341
342 return extract_signed_integer (buf, TYPE_LENGTH (type), byte_order);
343 }
344
345 /* Given an address, store it as a pointer of type TYPE in target
346 format in BUF. */
347 void
348 unsigned_address_to_pointer (struct gdbarch *gdbarch, struct type *type,
349 gdb_byte *buf, CORE_ADDR addr)
350 {
351 enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
352
353 store_unsigned_integer (buf, TYPE_LENGTH (type), byte_order, addr);
354 }
355
356 void
357 address_to_signed_pointer (struct gdbarch *gdbarch, struct type *type,
358 gdb_byte *buf, CORE_ADDR addr)
359 {
360 enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
361
362 store_signed_integer (buf, TYPE_LENGTH (type), byte_order, addr);
363 }
364 \f
365 /* Will calling read_var_value or locate_var_value on SYM end
366 up caring what frame it is being evaluated relative to? SYM must
367 be non-NULL. */
368 int
369 symbol_read_needs_frame (struct symbol *sym)
370 {
371 switch (SYMBOL_CLASS (sym))
372 {
373 /* All cases listed explicitly so that gcc -Wall will detect it if
374 we failed to consider one. */
375 case LOC_COMPUTED:
376 /* FIXME: cagney/2004-01-26: It should be possible to
377 unconditionally call the SYMBOL_COMPUTED_OPS method when available.
378 Unfortunately DWARF 2 stores the frame-base (instead of the
379 function) location in a function's symbol. Oops! For the
380 moment enable this when/where applicable. */
381 return SYMBOL_COMPUTED_OPS (sym)->read_needs_frame (sym);
382
383 case LOC_REGISTER:
384 case LOC_ARG:
385 case LOC_REF_ARG:
386 case LOC_REGPARM_ADDR:
387 case LOC_LOCAL:
388 return 1;
389
390 case LOC_UNDEF:
391 case LOC_CONST:
392 case LOC_STATIC:
393 case LOC_TYPEDEF:
394
395 case LOC_LABEL:
396 /* Getting the address of a label can be done independently of the block,
397 even if some *uses* of that address wouldn't work so well without
398 the right frame. */
399
400 case LOC_BLOCK:
401 case LOC_CONST_BYTES:
402 case LOC_UNRESOLVED:
403 case LOC_OPTIMIZED_OUT:
404 return 0;
405 }
406 return 1;
407 }
408
409 /* Private data to be used with minsym_lookup_iterator_cb. */
410
411 struct minsym_lookup_data
412 {
413 /* The name of the minimal symbol we are searching for. */
414 const char *name;
415
416 /* The field where the callback should store the minimal symbol
417 if found. It should be initialized to NULL before the search
418 is started. */
419 struct minimal_symbol *result;
420 };
421
422 /* A callback function for gdbarch_iterate_over_objfiles_in_search_order.
423 It searches by name for a minimal symbol within the given OBJFILE.
424 The arguments are passed via CB_DATA, which in reality is a pointer
425 to struct minsym_lookup_data. */
426
427 static int
428 minsym_lookup_iterator_cb (struct objfile *objfile, void *cb_data)
429 {
430 struct minsym_lookup_data *data = (struct minsym_lookup_data *) cb_data;
431
432 gdb_assert (data->result == NULL);
433
434 data->result = lookup_minimal_symbol (data->name, NULL, objfile);
435
436 /* The iterator should stop iff a match was found. */
437 return (data->result != NULL);
438 }
439
440 /* A default implementation for the "la_read_var_value" hook in
441 the language vector which should work in most situations. */
442
443 struct value *
444 default_read_var_value (struct symbol *var, struct frame_info *frame)
445 {
446 struct value *v;
447 struct type *type = SYMBOL_TYPE (var);
448 CORE_ADDR addr;
449
450 /* Call check_typedef on our type to make sure that, if TYPE is
451 a TYPE_CODE_TYPEDEF, its length is set to the length of the target type
452 instead of zero. However, we do not replace the typedef type by the
453 target type, because we want to keep the typedef in order to be able to
454 set the returned value type description correctly. */
455 check_typedef (type);
456
457 if (symbol_read_needs_frame (var))
458 gdb_assert (frame);
459
460 switch (SYMBOL_CLASS (var))
461 {
462 case LOC_CONST:
463 /* Put the constant back in target format. */
464 v = allocate_value (type);
465 store_signed_integer (value_contents_raw (v), TYPE_LENGTH (type),
466 gdbarch_byte_order (get_type_arch (type)),
467 (LONGEST) SYMBOL_VALUE (var));
468 VALUE_LVAL (v) = not_lval;
469 return v;
470
471 case LOC_LABEL:
472 /* Put the constant back in target format. */
473 v = allocate_value (type);
474 if (overlay_debugging)
475 {
476 CORE_ADDR addr
477 = symbol_overlayed_address (SYMBOL_VALUE_ADDRESS (var),
478 SYMBOL_OBJ_SECTION (var));
479
480 store_typed_address (value_contents_raw (v), type, addr);
481 }
482 else
483 store_typed_address (value_contents_raw (v), type,
484 SYMBOL_VALUE_ADDRESS (var));
485 VALUE_LVAL (v) = not_lval;
486 return v;
487
488 case LOC_CONST_BYTES:
489 v = allocate_value (type);
490 memcpy (value_contents_raw (v), SYMBOL_VALUE_BYTES (var),
491 TYPE_LENGTH (type));
492 VALUE_LVAL (v) = not_lval;
493 return v;
494
495 case LOC_STATIC:
496 v = allocate_value_lazy (type);
497 if (overlay_debugging)
498 addr = symbol_overlayed_address (SYMBOL_VALUE_ADDRESS (var),
499 SYMBOL_OBJ_SECTION (var));
500 else
501 addr = SYMBOL_VALUE_ADDRESS (var);
502 break;
503
504 case LOC_ARG:
505 addr = get_frame_args_address (frame);
506 if (!addr)
507 error (_("Unknown argument list address for `%s'."),
508 SYMBOL_PRINT_NAME (var));
509 addr += SYMBOL_VALUE (var);
510 v = allocate_value_lazy (type);
511 break;
512
513 case LOC_REF_ARG:
514 {
515 struct value *ref;
516 CORE_ADDR argref;
517
518 argref = get_frame_args_address (frame);
519 if (!argref)
520 error (_("Unknown argument list address for `%s'."),
521 SYMBOL_PRINT_NAME (var));
522 argref += SYMBOL_VALUE (var);
523 ref = value_at (lookup_pointer_type (type), argref);
524 addr = value_as_address (ref);
525 v = allocate_value_lazy (type);
526 break;
527 }
528
529 case LOC_LOCAL:
530 addr = get_frame_locals_address (frame);
531 addr += SYMBOL_VALUE (var);
532 v = allocate_value_lazy (type);
533 break;
534
535 case LOC_TYPEDEF:
536 error (_("Cannot look up value of a typedef `%s'."),
537 SYMBOL_PRINT_NAME (var));
538 break;
539
540 case LOC_BLOCK:
541 v = allocate_value_lazy (type);
542 if (overlay_debugging)
543 addr = symbol_overlayed_address
544 (BLOCK_START (SYMBOL_BLOCK_VALUE (var)), SYMBOL_OBJ_SECTION (var));
545 else
546 addr = BLOCK_START (SYMBOL_BLOCK_VALUE (var));
547 break;
548
549 case LOC_REGISTER:
550 case LOC_REGPARM_ADDR:
551 {
552 int regno = SYMBOL_REGISTER_OPS (var)
553 ->register_number (var, get_frame_arch (frame));
554 struct value *regval;
555
556 if (SYMBOL_CLASS (var) == LOC_REGPARM_ADDR)
557 {
558 regval = value_from_register (lookup_pointer_type (type),
559 regno,
560 frame);
561
562 if (regval == NULL)
563 error (_("Value of register variable not available for `%s'."),
564 SYMBOL_PRINT_NAME (var));
565
566 addr = value_as_address (regval);
567 v = allocate_value_lazy (type);
568 }
569 else
570 {
571 regval = value_from_register (type, regno, frame);
572
573 if (regval == NULL)
574 error (_("Value of register variable not available for `%s'."),
575 SYMBOL_PRINT_NAME (var));
576 return regval;
577 }
578 }
579 break;
580
581 case LOC_COMPUTED:
582 /* FIXME: cagney/2004-01-26: It should be possible to
583 unconditionally call the SYMBOL_COMPUTED_OPS method when available.
584 Unfortunately DWARF 2 stores the frame-base (instead of the
585 function) location in a function's symbol. Oops! For the
586 moment enable this when/where applicable. */
587 return SYMBOL_COMPUTED_OPS (var)->read_variable (var, frame);
588
589 case LOC_UNRESOLVED:
590 {
591 struct minsym_lookup_data lookup_data;
592 struct minimal_symbol *msym;
593 struct obj_section *obj_section;
594
595 memset (&lookup_data, 0, sizeof (lookup_data));
596 lookup_data.name = SYMBOL_LINKAGE_NAME (var);
597
598 gdbarch_iterate_over_objfiles_in_search_order
599 (get_objfile_arch (SYMBOL_SYMTAB (var)->objfile),
600 minsym_lookup_iterator_cb, &lookup_data,
601 SYMBOL_SYMTAB (var)->objfile);
602 msym = lookup_data.result;
603
604 if (msym == NULL)
605 error (_("No global symbol \"%s\"."), SYMBOL_LINKAGE_NAME (var));
606 if (overlay_debugging)
607 addr = symbol_overlayed_address (SYMBOL_VALUE_ADDRESS (msym),
608 SYMBOL_OBJ_SECTION (msym));
609 else
610 addr = SYMBOL_VALUE_ADDRESS (msym);
611
612 obj_section = SYMBOL_OBJ_SECTION (msym);
613 if (obj_section
614 && (obj_section->the_bfd_section->flags & SEC_THREAD_LOCAL) != 0)
615 addr = target_translate_tls_address (obj_section->objfile, addr);
616 v = allocate_value_lazy (type);
617 }
618 break;
619
620 case LOC_OPTIMIZED_OUT:
621 return allocate_optimized_out_value (type);
622
623 default:
624 error (_("Cannot look up value of a botched symbol `%s'."),
625 SYMBOL_PRINT_NAME (var));
626 break;
627 }
628
629 VALUE_LVAL (v) = lval_memory;
630 set_value_address (v, addr);
631 return v;
632 }
633
634 /* Calls VAR's language la_read_var_value hook with the given arguments. */
635
636 struct value *
637 read_var_value (struct symbol *var, struct frame_info *frame)
638 {
639 const struct language_defn *lang = language_def (SYMBOL_LANGUAGE (var));
640
641 gdb_assert (lang != NULL);
642 gdb_assert (lang->la_read_var_value != NULL);
643
644 return lang->la_read_var_value (var, frame);
645 }
646
647 /* Install default attributes for register values. */
648
649 struct value *
650 default_value_from_register (struct type *type, int regnum,
651 struct frame_info *frame)
652 {
653 struct gdbarch *gdbarch = get_frame_arch (frame);
654 int len = TYPE_LENGTH (type);
655 struct value *value = allocate_value (type);
656
657 VALUE_LVAL (value) = lval_register;
658 VALUE_FRAME_ID (value) = get_frame_id (frame);
659 VALUE_REGNUM (value) = regnum;
660
661 /* Any structure stored in more than one register will always be
662 an integral number of registers. Otherwise, you need to do
663 some fiddling with the last register copied here for little
664 endian machines. */
665 if (gdbarch_byte_order (gdbarch) == BFD_ENDIAN_BIG
666 && len < register_size (gdbarch, regnum))
667 /* Big-endian, and we want less than full size. */
668 set_value_offset (value, register_size (gdbarch, regnum) - len);
669 else
670 set_value_offset (value, 0);
671
672 return value;
673 }
674
675 /* VALUE must be an lval_register value. If regnum is the value's
676 associated register number, and len the length of the values type,
677 read one or more registers in FRAME, starting with register REGNUM,
678 until we've read LEN bytes.
679
680 If any of the registers we try to read are optimized out, then mark the
681 complete resulting value as optimized out. */
682
683 void
684 read_frame_register_value (struct value *value, struct frame_info *frame)
685 {
686 struct gdbarch *gdbarch = get_frame_arch (frame);
687 int offset = 0;
688 int reg_offset = value_offset (value);
689 int regnum = VALUE_REGNUM (value);
690 int len = TYPE_LENGTH (check_typedef (value_type (value)));
691
692 gdb_assert (VALUE_LVAL (value) == lval_register);
693
694 /* Skip registers wholly inside of REG_OFFSET. */
695 while (reg_offset >= register_size (gdbarch, regnum))
696 {
697 reg_offset -= register_size (gdbarch, regnum);
698 regnum++;
699 }
700
701 /* Copy the data. */
702 while (len > 0)
703 {
704 struct value *regval = get_frame_register_value (frame, regnum);
705 int reg_len = TYPE_LENGTH (value_type (regval)) - reg_offset;
706
707 if (value_optimized_out (regval))
708 {
709 set_value_optimized_out (value, 1);
710 break;
711 }
712
713 /* If the register length is larger than the number of bytes
714 remaining to copy, then only copy the appropriate bytes. */
715 if (reg_len > len)
716 reg_len = len;
717
718 value_contents_copy (value, offset, regval, reg_offset, reg_len);
719
720 offset += reg_len;
721 len -= reg_len;
722 reg_offset = 0;
723 regnum++;
724 }
725 }
726
727 /* Return a value of type TYPE, stored in register REGNUM, in frame FRAME. */
728
729 struct value *
730 value_from_register (struct type *type, int regnum, struct frame_info *frame)
731 {
732 struct gdbarch *gdbarch = get_frame_arch (frame);
733 struct type *type1 = check_typedef (type);
734 struct value *v;
735
736 if (gdbarch_convert_register_p (gdbarch, regnum, type1))
737 {
738 int optim, unavail, ok;
739
740 /* The ISA/ABI need to something weird when obtaining the
741 specified value from this register. It might need to
742 re-order non-adjacent, starting with REGNUM (see MIPS and
743 i386). It might need to convert the [float] register into
744 the corresponding [integer] type (see Alpha). The assumption
745 is that gdbarch_register_to_value populates the entire value
746 including the location. */
747 v = allocate_value (type);
748 VALUE_LVAL (v) = lval_register;
749 VALUE_FRAME_ID (v) = get_frame_id (frame);
750 VALUE_REGNUM (v) = regnum;
751 ok = gdbarch_register_to_value (gdbarch, frame, regnum, type1,
752 value_contents_raw (v), &optim,
753 &unavail);
754
755 if (!ok)
756 {
757 if (optim)
758 set_value_optimized_out (v, 1);
759 if (unavail)
760 mark_value_bytes_unavailable (v, 0, TYPE_LENGTH (type));
761 }
762 }
763 else
764 {
765 /* Construct the value. */
766 v = gdbarch_value_from_register (gdbarch, type, regnum, frame);
767
768 /* Get the data. */
769 read_frame_register_value (v, frame);
770 }
771
772 return v;
773 }
774
775 /* Return contents of register REGNUM in frame FRAME as address,
776 interpreted as value of type TYPE. Will abort if register
777 value is not available. */
778
779 CORE_ADDR
780 address_from_register (struct type *type, int regnum, struct frame_info *frame)
781 {
782 struct value *value;
783 CORE_ADDR result;
784
785 value = value_from_register (type, regnum, frame);
786 gdb_assert (value);
787
788 result = value_as_address (value);
789 release_value (value);
790 value_free (value);
791
792 return result;
793 }
794
This page took 0.066693 seconds and 4 git commands to generate.