1 /* Low level packing and unpacking of values for GDB, the GNU Debugger.
3 Copyright (C) 1986-2021 Free Software Foundation, Inc.
5 This file is part of GDB.
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
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
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.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
21 #include "arch-utils.h"
33 #include "target-float.h"
36 #include "cli/cli-decode.h"
37 #include "extension.h"
39 #include "tracepoint.h"
41 #include "user-regs.h"
43 #include "completer.h"
44 #include "gdbsupport/selftest.h"
45 #include "gdbsupport/array-view.h"
46 #include "cli/cli-style.h"
50 /* Definition of a user function. */
51 struct internal_function
53 /* The name of the function. It is a bit odd to have this in the
54 function itself -- the user might use a differently-named
55 convenience variable to hold the function. */
59 internal_function_fn handler
;
61 /* User data for the handler. */
65 /* Defines an [OFFSET, OFFSET + LENGTH) range. */
69 /* Lowest offset in the range. */
72 /* Length of the range. */
75 /* Returns true if THIS is strictly less than OTHER, useful for
76 searching. We keep ranges sorted by offset and coalesce
77 overlapping and contiguous ranges, so this just compares the
80 bool operator< (const range
&other
) const
82 return offset
< other
.offset
;
85 /* Returns true if THIS is equal to OTHER. */
86 bool operator== (const range
&other
) const
88 return offset
== other
.offset
&& length
== other
.length
;
92 /* Returns true if the ranges defined by [offset1, offset1+len1) and
93 [offset2, offset2+len2) overlap. */
96 ranges_overlap (LONGEST offset1
, LONGEST len1
,
97 LONGEST offset2
, LONGEST len2
)
101 l
= std::max (offset1
, offset2
);
102 h
= std::min (offset1
+ len1
, offset2
+ len2
);
106 /* Returns true if RANGES contains any range that overlaps [OFFSET,
110 ranges_contain (const std::vector
<range
> &ranges
, LONGEST offset
,
115 what
.offset
= offset
;
116 what
.length
= length
;
118 /* We keep ranges sorted by offset and coalesce overlapping and
119 contiguous ranges, so to check if a range list contains a given
120 range, we can do a binary search for the position the given range
121 would be inserted if we only considered the starting OFFSET of
122 ranges. We call that position I. Since we also have LENGTH to
123 care for (this is a range afterall), we need to check if the
124 _previous_ range overlaps the I range. E.g.,
128 |---| |---| |------| ... |--|
133 In the case above, the binary search would return `I=1', meaning,
134 this OFFSET should be inserted at position 1, and the current
135 position 1 should be pushed further (and before 2). But, `0'
138 Then we need to check if the I range overlaps the I range itself.
143 |---| |---| |-------| ... |--|
150 auto i
= std::lower_bound (ranges
.begin (), ranges
.end (), what
);
152 if (i
> ranges
.begin ())
154 const struct range
&bef
= *(i
- 1);
156 if (ranges_overlap (bef
.offset
, bef
.length
, offset
, length
))
160 if (i
< ranges
.end ())
162 const struct range
&r
= *i
;
164 if (ranges_overlap (r
.offset
, r
.length
, offset
, length
))
171 static struct cmd_list_element
*functionlist
;
173 /* Note that the fields in this structure are arranged to save a bit
178 explicit value (struct type
*type_
)
185 enclosing_type (type_
)
191 if (VALUE_LVAL (this) == lval_computed
)
193 const struct lval_funcs
*funcs
= location
.computed
.funcs
;
195 if (funcs
->free_closure
)
196 funcs
->free_closure (this);
198 else if (VALUE_LVAL (this) == lval_xcallable
)
199 delete location
.xm_worker
;
202 DISABLE_COPY_AND_ASSIGN (value
);
204 /* Type of value; either not an lval, or one of the various
205 different possible kinds of lval. */
206 enum lval_type lval
= not_lval
;
208 /* Is it modifiable? Only relevant if lval != not_lval. */
209 unsigned int modifiable
: 1;
211 /* If zero, contents of this value are in the contents field. If
212 nonzero, contents are in inferior. If the lval field is lval_memory,
213 the contents are in inferior memory at location.address plus offset.
214 The lval field may also be lval_register.
216 WARNING: This field is used by the code which handles watchpoints
217 (see breakpoint.c) to decide whether a particular value can be
218 watched by hardware watchpoints. If the lazy flag is set for
219 some member of a value chain, it is assumed that this member of
220 the chain doesn't need to be watched as part of watching the
221 value itself. This is how GDB avoids watching the entire struct
222 or array when the user wants to watch a single struct member or
223 array element. If you ever change the way lazy flag is set and
224 reset, be sure to consider this use as well! */
225 unsigned int lazy
: 1;
227 /* If value is a variable, is it initialized or not. */
228 unsigned int initialized
: 1;
230 /* If value is from the stack. If this is set, read_stack will be
231 used instead of read_memory to enable extra caching. */
232 unsigned int stack
: 1;
234 /* True if this is a zero value, created by 'value_zero'; false
238 /* Location of value (if lval). */
241 /* If lval == lval_memory, this is the address in the inferior */
244 /*If lval == lval_register, the value is from a register. */
247 /* Register number. */
249 /* Frame ID of "next" frame to which a register value is relative.
250 If the register value is found relative to frame F, then the
251 frame id of F->next will be stored in next_frame_id. */
252 struct frame_id next_frame_id
;
255 /* Pointer to internal variable. */
256 struct internalvar
*internalvar
;
258 /* Pointer to xmethod worker. */
259 struct xmethod_worker
*xm_worker
;
261 /* If lval == lval_computed, this is a set of function pointers
262 to use to access and describe the value, and a closure pointer
266 /* Functions to call. */
267 const struct lval_funcs
*funcs
;
269 /* Closure for those functions to use. */
274 /* Describes offset of a value within lval of a structure in target
275 addressable memory units. Note also the member embedded_offset
279 /* Only used for bitfields; number of bits contained in them. */
282 /* Only used for bitfields; position of start of field. For
283 little-endian targets, it is the position of the LSB. For
284 big-endian targets, it is the position of the MSB. */
287 /* The number of references to this value. When a value is created,
288 the value chain holds a reference, so REFERENCE_COUNT is 1. If
289 release_value is called, this value is removed from the chain but
290 the caller of release_value now has a reference to this value.
291 The caller must arrange for a call to value_free later. */
292 int reference_count
= 1;
294 /* Only used for bitfields; the containing value. This allows a
295 single read from the target when displaying multiple
297 value_ref_ptr parent
;
299 /* Type of the value. */
302 /* If a value represents a C++ object, then the `type' field gives
303 the object's compile-time type. If the object actually belongs
304 to some class derived from `type', perhaps with other base
305 classes and additional members, then `type' is just a subobject
306 of the real thing, and the full object is probably larger than
307 `type' would suggest.
309 If `type' is a dynamic class (i.e. one with a vtable), then GDB
310 can actually determine the object's run-time type by looking at
311 the run-time type information in the vtable. When this
312 information is available, we may elect to read in the entire
313 object, for several reasons:
315 - When printing the value, the user would probably rather see the
316 full object, not just the limited portion apparent from the
319 - If `type' has virtual base classes, then even printing `type'
320 alone may require reaching outside the `type' portion of the
321 object to wherever the virtual base class has been stored.
323 When we store the entire object, `enclosing_type' is the run-time
324 type -- the complete object -- and `embedded_offset' is the
325 offset of `type' within that larger type, in target addressable memory
326 units. The value_contents() macro takes `embedded_offset' into account,
327 so most GDB code continues to see the `type' portion of the value, just
328 as the inferior would.
330 If `type' is a pointer to an object, then `enclosing_type' is a
331 pointer to the object's run-time type, and `pointed_to_offset' is
332 the offset in target addressable memory units from the full object
333 to the pointed-to object -- that is, the value `embedded_offset' would
334 have if we followed the pointer and fetched the complete object.
335 (I don't really see the point. Why not just determine the
336 run-time type when you indirect, and avoid the special case? The
337 contents don't matter until you indirect anyway.)
339 If we're not doing anything fancy, `enclosing_type' is equal to
340 `type', and `embedded_offset' is zero, so everything works
342 struct type
*enclosing_type
;
343 LONGEST embedded_offset
= 0;
344 LONGEST pointed_to_offset
= 0;
346 /* Actual contents of the value. Target byte-order. NULL or not
347 valid if lazy is nonzero. */
348 gdb::unique_xmalloc_ptr
<gdb_byte
> contents
;
350 /* Unavailable ranges in CONTENTS. We mark unavailable ranges,
351 rather than available, since the common and default case is for a
352 value to be available. This is filled in at value read time.
353 The unavailable ranges are tracked in bits. Note that a contents
354 bit that has been optimized out doesn't really exist in the
355 program, so it can't be marked unavailable either. */
356 std::vector
<range
> unavailable
;
358 /* Likewise, but for optimized out contents (a chunk of the value of
359 a variable that does not actually exist in the program). If LVAL
360 is lval_register, this is a register ($pc, $sp, etc., never a
361 program variable) that has not been saved in the frame. Not
362 saved registers and optimized-out program variables values are
363 treated pretty much the same, except not-saved registers have a
364 different string representation and related error strings. */
365 std::vector
<range
> optimized_out
;
371 get_value_arch (const struct value
*value
)
373 return value_type (value
)->arch ();
377 value_bits_available (const struct value
*value
, LONGEST offset
, LONGEST length
)
379 gdb_assert (!value
->lazy
);
381 return !ranges_contain (value
->unavailable
, offset
, length
);
385 value_bytes_available (const struct value
*value
,
386 LONGEST offset
, LONGEST length
)
388 return value_bits_available (value
,
389 offset
* TARGET_CHAR_BIT
,
390 length
* TARGET_CHAR_BIT
);
394 value_bits_any_optimized_out (const struct value
*value
, int bit_offset
, int bit_length
)
396 gdb_assert (!value
->lazy
);
398 return ranges_contain (value
->optimized_out
, bit_offset
, bit_length
);
402 value_entirely_available (struct value
*value
)
404 /* We can only tell whether the whole value is available when we try
407 value_fetch_lazy (value
);
409 if (value
->unavailable
.empty ())
414 /* Returns true if VALUE is entirely covered by RANGES. If the value
415 is lazy, it'll be read now. Note that RANGE is a pointer to
416 pointer because reading the value might change *RANGE. */
419 value_entirely_covered_by_range_vector (struct value
*value
,
420 const std::vector
<range
> &ranges
)
422 /* We can only tell whether the whole value is optimized out /
423 unavailable when we try to read it. */
425 value_fetch_lazy (value
);
427 if (ranges
.size () == 1)
429 const struct range
&t
= ranges
[0];
432 && t
.length
== (TARGET_CHAR_BIT
433 * TYPE_LENGTH (value_enclosing_type (value
))))
441 value_entirely_unavailable (struct value
*value
)
443 return value_entirely_covered_by_range_vector (value
, value
->unavailable
);
447 value_entirely_optimized_out (struct value
*value
)
449 return value_entirely_covered_by_range_vector (value
, value
->optimized_out
);
452 /* Insert into the vector pointed to by VECTORP the bit range starting of
453 OFFSET bits, and extending for the next LENGTH bits. */
456 insert_into_bit_range_vector (std::vector
<range
> *vectorp
,
457 LONGEST offset
, LONGEST length
)
461 /* Insert the range sorted. If there's overlap or the new range
462 would be contiguous with an existing range, merge. */
464 newr
.offset
= offset
;
465 newr
.length
= length
;
467 /* Do a binary search for the position the given range would be
468 inserted if we only considered the starting OFFSET of ranges.
469 Call that position I. Since we also have LENGTH to care for
470 (this is a range afterall), we need to check if the _previous_
471 range overlaps the I range. E.g., calling R the new range:
473 #1 - overlaps with previous
477 |---| |---| |------| ... |--|
482 In the case #1 above, the binary search would return `I=1',
483 meaning, this OFFSET should be inserted at position 1, and the
484 current position 1 should be pushed further (and become 2). But,
485 note that `0' overlaps with R, so we want to merge them.
487 A similar consideration needs to be taken if the new range would
488 be contiguous with the previous range:
490 #2 - contiguous with previous
494 |--| |---| |------| ... |--|
499 If there's no overlap with the previous range, as in:
501 #3 - not overlapping and not contiguous
505 |--| |---| |------| ... |--|
512 #4 - R is the range with lowest offset
516 |--| |---| |------| ... |--|
521 ... we just push the new range to I.
523 All the 4 cases above need to consider that the new range may
524 also overlap several of the ranges that follow, or that R may be
525 contiguous with the following range, and merge. E.g.,
527 #5 - overlapping following ranges
530 |------------------------|
531 |--| |---| |------| ... |--|
540 |--| |---| |------| ... |--|
547 auto i
= std::lower_bound (vectorp
->begin (), vectorp
->end (), newr
);
548 if (i
> vectorp
->begin ())
550 struct range
&bef
= *(i
- 1);
552 if (ranges_overlap (bef
.offset
, bef
.length
, offset
, length
))
555 ULONGEST l
= std::min (bef
.offset
, offset
);
556 ULONGEST h
= std::max (bef
.offset
+ bef
.length
, offset
+ length
);
562 else if (offset
== bef
.offset
+ bef
.length
)
565 bef
.length
+= length
;
571 i
= vectorp
->insert (i
, newr
);
577 i
= vectorp
->insert (i
, newr
);
580 /* Check whether the ranges following the one we've just added or
581 touched can be folded in (#5 above). */
582 if (i
!= vectorp
->end () && i
+ 1 < vectorp
->end ())
587 /* Get the range we just touched. */
588 struct range
&t
= *i
;
592 for (; i
< vectorp
->end (); i
++)
594 struct range
&r
= *i
;
595 if (r
.offset
<= t
.offset
+ t
.length
)
599 l
= std::min (t
.offset
, r
.offset
);
600 h
= std::max (t
.offset
+ t
.length
, r
.offset
+ r
.length
);
609 /* If we couldn't merge this one, we won't be able to
610 merge following ones either, since the ranges are
611 always sorted by OFFSET. */
617 vectorp
->erase (next
, next
+ removed
);
622 mark_value_bits_unavailable (struct value
*value
,
623 LONGEST offset
, LONGEST length
)
625 insert_into_bit_range_vector (&value
->unavailable
, offset
, length
);
629 mark_value_bytes_unavailable (struct value
*value
,
630 LONGEST offset
, LONGEST length
)
632 mark_value_bits_unavailable (value
,
633 offset
* TARGET_CHAR_BIT
,
634 length
* TARGET_CHAR_BIT
);
637 /* Find the first range in RANGES that overlaps the range defined by
638 OFFSET and LENGTH, starting at element POS in the RANGES vector,
639 Returns the index into RANGES where such overlapping range was
640 found, or -1 if none was found. */
643 find_first_range_overlap (const std::vector
<range
> *ranges
, int pos
,
644 LONGEST offset
, LONGEST length
)
648 for (i
= pos
; i
< ranges
->size (); i
++)
650 const range
&r
= (*ranges
)[i
];
651 if (ranges_overlap (r
.offset
, r
.length
, offset
, length
))
658 /* Compare LENGTH_BITS of memory at PTR1 + OFFSET1_BITS with the memory at
659 PTR2 + OFFSET2_BITS. Return 0 if the memory is the same, otherwise
662 It must always be the case that:
663 OFFSET1_BITS % TARGET_CHAR_BIT == OFFSET2_BITS % TARGET_CHAR_BIT
665 It is assumed that memory can be accessed from:
666 PTR + (OFFSET_BITS / TARGET_CHAR_BIT)
668 PTR + ((OFFSET_BITS + LENGTH_BITS + TARGET_CHAR_BIT - 1)
669 / TARGET_CHAR_BIT) */
671 memcmp_with_bit_offsets (const gdb_byte
*ptr1
, size_t offset1_bits
,
672 const gdb_byte
*ptr2
, size_t offset2_bits
,
675 gdb_assert (offset1_bits
% TARGET_CHAR_BIT
676 == offset2_bits
% TARGET_CHAR_BIT
);
678 if (offset1_bits
% TARGET_CHAR_BIT
!= 0)
681 gdb_byte mask
, b1
, b2
;
683 /* The offset from the base pointers PTR1 and PTR2 is not a complete
684 number of bytes. A number of bits up to either the next exact
685 byte boundary, or LENGTH_BITS (which ever is sooner) will be
687 bits
= TARGET_CHAR_BIT
- offset1_bits
% TARGET_CHAR_BIT
;
688 gdb_assert (bits
< sizeof (mask
) * TARGET_CHAR_BIT
);
689 mask
= (1 << bits
) - 1;
691 if (length_bits
< bits
)
693 mask
&= ~(gdb_byte
) ((1 << (bits
- length_bits
)) - 1);
697 /* Now load the two bytes and mask off the bits we care about. */
698 b1
= *(ptr1
+ offset1_bits
/ TARGET_CHAR_BIT
) & mask
;
699 b2
= *(ptr2
+ offset2_bits
/ TARGET_CHAR_BIT
) & mask
;
704 /* Now update the length and offsets to take account of the bits
705 we've just compared. */
707 offset1_bits
+= bits
;
708 offset2_bits
+= bits
;
711 if (length_bits
% TARGET_CHAR_BIT
!= 0)
715 gdb_byte mask
, b1
, b2
;
717 /* The length is not an exact number of bytes. After the previous
718 IF.. block then the offsets are byte aligned, or the
719 length is zero (in which case this code is not reached). Compare
720 a number of bits at the end of the region, starting from an exact
722 bits
= length_bits
% TARGET_CHAR_BIT
;
723 o1
= offset1_bits
+ length_bits
- bits
;
724 o2
= offset2_bits
+ length_bits
- bits
;
726 gdb_assert (bits
< sizeof (mask
) * TARGET_CHAR_BIT
);
727 mask
= ((1 << bits
) - 1) << (TARGET_CHAR_BIT
- bits
);
729 gdb_assert (o1
% TARGET_CHAR_BIT
== 0);
730 gdb_assert (o2
% TARGET_CHAR_BIT
== 0);
732 b1
= *(ptr1
+ o1
/ TARGET_CHAR_BIT
) & mask
;
733 b2
= *(ptr2
+ o2
/ TARGET_CHAR_BIT
) & mask
;
743 /* We've now taken care of any stray "bits" at the start, or end of
744 the region to compare, the remainder can be covered with a simple
746 gdb_assert (offset1_bits
% TARGET_CHAR_BIT
== 0);
747 gdb_assert (offset2_bits
% TARGET_CHAR_BIT
== 0);
748 gdb_assert (length_bits
% TARGET_CHAR_BIT
== 0);
750 return memcmp (ptr1
+ offset1_bits
/ TARGET_CHAR_BIT
,
751 ptr2
+ offset2_bits
/ TARGET_CHAR_BIT
,
752 length_bits
/ TARGET_CHAR_BIT
);
755 /* Length is zero, regions match. */
759 /* Helper struct for find_first_range_overlap_and_match and
760 value_contents_bits_eq. Keep track of which slot of a given ranges
761 vector have we last looked at. */
763 struct ranges_and_idx
766 const std::vector
<range
> *ranges
;
768 /* The range we've last found in RANGES. Given ranges are sorted,
769 we can start the next lookup here. */
773 /* Helper function for value_contents_bits_eq. Compare LENGTH bits of
774 RP1's ranges starting at OFFSET1 bits with LENGTH bits of RP2's
775 ranges starting at OFFSET2 bits. Return true if the ranges match
776 and fill in *L and *H with the overlapping window relative to
777 (both) OFFSET1 or OFFSET2. */
780 find_first_range_overlap_and_match (struct ranges_and_idx
*rp1
,
781 struct ranges_and_idx
*rp2
,
782 LONGEST offset1
, LONGEST offset2
,
783 LONGEST length
, ULONGEST
*l
, ULONGEST
*h
)
785 rp1
->idx
= find_first_range_overlap (rp1
->ranges
, rp1
->idx
,
787 rp2
->idx
= find_first_range_overlap (rp2
->ranges
, rp2
->idx
,
790 if (rp1
->idx
== -1 && rp2
->idx
== -1)
796 else if (rp1
->idx
== -1 || rp2
->idx
== -1)
800 const range
*r1
, *r2
;
804 r1
= &(*rp1
->ranges
)[rp1
->idx
];
805 r2
= &(*rp2
->ranges
)[rp2
->idx
];
807 /* Get the unavailable windows intersected by the incoming
808 ranges. The first and last ranges that overlap the argument
809 range may be wider than said incoming arguments ranges. */
810 l1
= std::max (offset1
, r1
->offset
);
811 h1
= std::min (offset1
+ length
, r1
->offset
+ r1
->length
);
813 l2
= std::max (offset2
, r2
->offset
);
814 h2
= std::min (offset2
+ length
, offset2
+ r2
->length
);
816 /* Make them relative to the respective start offsets, so we can
817 compare them for equality. */
824 /* Different ranges, no match. */
825 if (l1
!= l2
|| h1
!= h2
)
834 /* Helper function for value_contents_eq. The only difference is that
835 this function is bit rather than byte based.
837 Compare LENGTH bits of VAL1's contents starting at OFFSET1 bits
838 with LENGTH bits of VAL2's contents starting at OFFSET2 bits.
839 Return true if the available bits match. */
842 value_contents_bits_eq (const struct value
*val1
, int offset1
,
843 const struct value
*val2
, int offset2
,
846 /* Each array element corresponds to a ranges source (unavailable,
847 optimized out). '1' is for VAL1, '2' for VAL2. */
848 struct ranges_and_idx rp1
[2], rp2
[2];
850 /* See function description in value.h. */
851 gdb_assert (!val1
->lazy
&& !val2
->lazy
);
853 /* We shouldn't be trying to compare past the end of the values. */
854 gdb_assert (offset1
+ length
855 <= TYPE_LENGTH (val1
->enclosing_type
) * TARGET_CHAR_BIT
);
856 gdb_assert (offset2
+ length
857 <= TYPE_LENGTH (val2
->enclosing_type
) * TARGET_CHAR_BIT
);
859 memset (&rp1
, 0, sizeof (rp1
));
860 memset (&rp2
, 0, sizeof (rp2
));
861 rp1
[0].ranges
= &val1
->unavailable
;
862 rp2
[0].ranges
= &val2
->unavailable
;
863 rp1
[1].ranges
= &val1
->optimized_out
;
864 rp2
[1].ranges
= &val2
->optimized_out
;
868 ULONGEST l
= 0, h
= 0; /* init for gcc -Wall */
871 for (i
= 0; i
< 2; i
++)
873 ULONGEST l_tmp
, h_tmp
;
875 /* The contents only match equal if the invalid/unavailable
876 contents ranges match as well. */
877 if (!find_first_range_overlap_and_match (&rp1
[i
], &rp2
[i
],
878 offset1
, offset2
, length
,
882 /* We're interested in the lowest/first range found. */
883 if (i
== 0 || l_tmp
< l
)
890 /* Compare the available/valid contents. */
891 if (memcmp_with_bit_offsets (val1
->contents
.get (), offset1
,
892 val2
->contents
.get (), offset2
, l
) != 0)
904 value_contents_eq (const struct value
*val1
, LONGEST offset1
,
905 const struct value
*val2
, LONGEST offset2
,
908 return value_contents_bits_eq (val1
, offset1
* TARGET_CHAR_BIT
,
909 val2
, offset2
* TARGET_CHAR_BIT
,
910 length
* TARGET_CHAR_BIT
);
914 /* The value-history records all the values printed by print commands
915 during this session. */
917 static std::vector
<value_ref_ptr
> value_history
;
920 /* List of all value objects currently allocated
921 (except for those released by calls to release_value)
922 This is so they can be freed after each command. */
924 static std::vector
<value_ref_ptr
> all_values
;
926 /* Allocate a lazy value for type TYPE. Its actual content is
927 "lazily" allocated too: the content field of the return value is
928 NULL; it will be allocated when it is fetched from the target. */
931 allocate_value_lazy (struct type
*type
)
935 /* Call check_typedef on our type to make sure that, if TYPE
936 is a TYPE_CODE_TYPEDEF, its length is set to the length
937 of the target type instead of zero. However, we do not
938 replace the typedef type by the target type, because we want
939 to keep the typedef in order to be able to set the VAL's type
940 description correctly. */
941 check_typedef (type
);
943 val
= new struct value (type
);
945 /* Values start out on the all_values chain. */
946 all_values
.emplace_back (val
);
951 /* The maximum size, in bytes, that GDB will try to allocate for a value.
952 The initial value of 64k was not selected for any specific reason, it is
953 just a reasonable starting point. */
955 static int max_value_size
= 65536; /* 64k bytes */
957 /* It is critical that the MAX_VALUE_SIZE is at least as big as the size of
958 LONGEST, otherwise GDB will not be able to parse integer values from the
959 CLI; for example if the MAX_VALUE_SIZE could be set to 1 then GDB would
960 be unable to parse "set max-value-size 2".
962 As we want a consistent GDB experience across hosts with different sizes
963 of LONGEST, this arbitrary minimum value was selected, so long as this
964 is bigger than LONGEST on all GDB supported hosts we're fine. */
966 #define MIN_VALUE_FOR_MAX_VALUE_SIZE 16
967 gdb_static_assert (sizeof (LONGEST
) <= MIN_VALUE_FOR_MAX_VALUE_SIZE
);
969 /* Implement the "set max-value-size" command. */
972 set_max_value_size (const char *args
, int from_tty
,
973 struct cmd_list_element
*c
)
975 gdb_assert (max_value_size
== -1 || max_value_size
>= 0);
977 if (max_value_size
> -1 && max_value_size
< MIN_VALUE_FOR_MAX_VALUE_SIZE
)
979 max_value_size
= MIN_VALUE_FOR_MAX_VALUE_SIZE
;
980 error (_("max-value-size set too low, increasing to %d bytes"),
985 /* Implement the "show max-value-size" command. */
988 show_max_value_size (struct ui_file
*file
, int from_tty
,
989 struct cmd_list_element
*c
, const char *value
)
991 if (max_value_size
== -1)
992 fprintf_filtered (file
, _("Maximum value size is unlimited.\n"));
994 fprintf_filtered (file
, _("Maximum value size is %d bytes.\n"),
998 /* Called before we attempt to allocate or reallocate a buffer for the
999 contents of a value. TYPE is the type of the value for which we are
1000 allocating the buffer. If the buffer is too large (based on the user
1001 controllable setting) then throw an error. If this function returns
1002 then we should attempt to allocate the buffer. */
1005 check_type_length_before_alloc (const struct type
*type
)
1007 ULONGEST length
= TYPE_LENGTH (type
);
1009 if (max_value_size
> -1 && length
> max_value_size
)
1011 if (type
->name () != NULL
)
1012 error (_("value of type `%s' requires %s bytes, which is more "
1013 "than max-value-size"), type
->name (), pulongest (length
));
1015 error (_("value requires %s bytes, which is more than "
1016 "max-value-size"), pulongest (length
));
1020 /* Allocate the contents of VAL if it has not been allocated yet. */
1023 allocate_value_contents (struct value
*val
)
1027 check_type_length_before_alloc (val
->enclosing_type
);
1029 ((gdb_byte
*) xzalloc (TYPE_LENGTH (val
->enclosing_type
)));
1033 /* Allocate a value and its contents for type TYPE. */
1036 allocate_value (struct type
*type
)
1038 struct value
*val
= allocate_value_lazy (type
);
1040 allocate_value_contents (val
);
1045 /* Allocate a value that has the correct length
1046 for COUNT repetitions of type TYPE. */
1049 allocate_repeat_value (struct type
*type
, int count
)
1051 /* Despite the fact that we are really creating an array of TYPE here, we
1052 use the string lower bound as the array lower bound. This seems to
1053 work fine for now. */
1054 int low_bound
= current_language
->string_lower_bound ();
1055 /* FIXME-type-allocation: need a way to free this type when we are
1057 struct type
*array_type
1058 = lookup_array_range_type (type
, low_bound
, count
+ low_bound
- 1);
1060 return allocate_value (array_type
);
1064 allocate_computed_value (struct type
*type
,
1065 const struct lval_funcs
*funcs
,
1068 struct value
*v
= allocate_value_lazy (type
);
1070 VALUE_LVAL (v
) = lval_computed
;
1071 v
->location
.computed
.funcs
= funcs
;
1072 v
->location
.computed
.closure
= closure
;
1077 /* Allocate NOT_LVAL value for type TYPE being OPTIMIZED_OUT. */
1080 allocate_optimized_out_value (struct type
*type
)
1082 struct value
*retval
= allocate_value_lazy (type
);
1084 mark_value_bytes_optimized_out (retval
, 0, TYPE_LENGTH (type
));
1085 set_value_lazy (retval
, 0);
1089 /* Accessor methods. */
1092 value_type (const struct value
*value
)
1097 deprecated_set_value_type (struct value
*value
, struct type
*type
)
1103 value_offset (const struct value
*value
)
1105 return value
->offset
;
1108 set_value_offset (struct value
*value
, LONGEST offset
)
1110 value
->offset
= offset
;
1114 value_bitpos (const struct value
*value
)
1116 return value
->bitpos
;
1119 set_value_bitpos (struct value
*value
, LONGEST bit
)
1121 value
->bitpos
= bit
;
1125 value_bitsize (const struct value
*value
)
1127 return value
->bitsize
;
1130 set_value_bitsize (struct value
*value
, LONGEST bit
)
1132 value
->bitsize
= bit
;
1136 value_parent (const struct value
*value
)
1138 return value
->parent
.get ();
1144 set_value_parent (struct value
*value
, struct value
*parent
)
1146 value
->parent
= value_ref_ptr::new_reference (parent
);
1149 gdb::array_view
<gdb_byte
>
1150 value_contents_raw (struct value
*value
)
1152 struct gdbarch
*arch
= get_value_arch (value
);
1153 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
1155 allocate_value_contents (value
);
1157 ULONGEST length
= TYPE_LENGTH (value_type (value
));
1158 return gdb::make_array_view
1159 (value
->contents
.get () + value
->embedded_offset
* unit_size
, length
);
1162 gdb::array_view
<gdb_byte
>
1163 value_contents_all_raw (struct value
*value
)
1165 allocate_value_contents (value
);
1167 ULONGEST length
= TYPE_LENGTH (value_type (value
));
1168 return gdb::make_array_view (value
->contents
.get (), length
);
1172 value_enclosing_type (const struct value
*value
)
1174 return value
->enclosing_type
;
1177 /* Look at value.h for description. */
1180 value_actual_type (struct value
*value
, int resolve_simple_types
,
1181 int *real_type_found
)
1183 struct value_print_options opts
;
1184 struct type
*result
;
1186 get_user_print_options (&opts
);
1188 if (real_type_found
)
1189 *real_type_found
= 0;
1190 result
= value_type (value
);
1191 if (opts
.objectprint
)
1193 /* If result's target type is TYPE_CODE_STRUCT, proceed to
1194 fetch its rtti type. */
1195 if (result
->is_pointer_or_reference ()
1196 && (check_typedef (TYPE_TARGET_TYPE (result
))->code ()
1197 == TYPE_CODE_STRUCT
)
1198 && !value_optimized_out (value
))
1200 struct type
*real_type
;
1202 real_type
= value_rtti_indirect_type (value
, NULL
, NULL
, NULL
);
1205 if (real_type_found
)
1206 *real_type_found
= 1;
1210 else if (resolve_simple_types
)
1212 if (real_type_found
)
1213 *real_type_found
= 1;
1214 result
= value_enclosing_type (value
);
1222 error_value_optimized_out (void)
1224 error (_("value has been optimized out"));
1228 require_not_optimized_out (const struct value
*value
)
1230 if (!value
->optimized_out
.empty ())
1232 if (value
->lval
== lval_register
)
1233 error (_("register has not been saved in frame"));
1235 error_value_optimized_out ();
1240 require_available (const struct value
*value
)
1242 if (!value
->unavailable
.empty ())
1243 throw_error (NOT_AVAILABLE_ERROR
, _("value is not available"));
1246 gdb::array_view
<const gdb_byte
>
1247 value_contents_for_printing (struct value
*value
)
1250 value_fetch_lazy (value
);
1252 ULONGEST length
= TYPE_LENGTH (value_type (value
));
1253 return gdb::make_array_view (value
->contents
.get (), length
);
1256 gdb::array_view
<const gdb_byte
>
1257 value_contents_for_printing_const (const struct value
*value
)
1259 gdb_assert (!value
->lazy
);
1261 ULONGEST length
= TYPE_LENGTH (value_type (value
));
1262 return gdb::make_array_view (value
->contents
.get (), length
);
1265 gdb::array_view
<const gdb_byte
>
1266 value_contents_all (struct value
*value
)
1268 gdb::array_view
<const gdb_byte
> result
= value_contents_for_printing (value
);
1269 require_not_optimized_out (value
);
1270 require_available (value
);
1274 /* Copy ranges in SRC_RANGE that overlap [SRC_BIT_OFFSET,
1275 SRC_BIT_OFFSET+BIT_LENGTH) ranges into *DST_RANGE, adjusted. */
1278 ranges_copy_adjusted (std::vector
<range
> *dst_range
, int dst_bit_offset
,
1279 const std::vector
<range
> &src_range
, int src_bit_offset
,
1282 for (const range
&r
: src_range
)
1286 l
= std::max (r
.offset
, (LONGEST
) src_bit_offset
);
1287 h
= std::min (r
.offset
+ r
.length
,
1288 (LONGEST
) src_bit_offset
+ bit_length
);
1291 insert_into_bit_range_vector (dst_range
,
1292 dst_bit_offset
+ (l
- src_bit_offset
),
1297 /* Copy the ranges metadata in SRC that overlaps [SRC_BIT_OFFSET,
1298 SRC_BIT_OFFSET+BIT_LENGTH) into DST, adjusted. */
1301 value_ranges_copy_adjusted (struct value
*dst
, int dst_bit_offset
,
1302 const struct value
*src
, int src_bit_offset
,
1305 ranges_copy_adjusted (&dst
->unavailable
, dst_bit_offset
,
1306 src
->unavailable
, src_bit_offset
,
1308 ranges_copy_adjusted (&dst
->optimized_out
, dst_bit_offset
,
1309 src
->optimized_out
, src_bit_offset
,
1313 /* Copy LENGTH target addressable memory units of SRC value's (all) contents
1314 (value_contents_all) starting at SRC_OFFSET, into DST value's (all)
1315 contents, starting at DST_OFFSET. If unavailable contents are
1316 being copied from SRC, the corresponding DST contents are marked
1317 unavailable accordingly. Neither DST nor SRC may be lazy
1320 It is assumed the contents of DST in the [DST_OFFSET,
1321 DST_OFFSET+LENGTH) range are wholly available. */
1324 value_contents_copy_raw (struct value
*dst
, LONGEST dst_offset
,
1325 struct value
*src
, LONGEST src_offset
, LONGEST length
)
1327 LONGEST src_bit_offset
, dst_bit_offset
, bit_length
;
1328 struct gdbarch
*arch
= get_value_arch (src
);
1329 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
1331 /* A lazy DST would make that this copy operation useless, since as
1332 soon as DST's contents were un-lazied (by a later value_contents
1333 call, say), the contents would be overwritten. A lazy SRC would
1334 mean we'd be copying garbage. */
1335 gdb_assert (!dst
->lazy
&& !src
->lazy
);
1337 /* The overwritten DST range gets unavailability ORed in, not
1338 replaced. Make sure to remember to implement replacing if it
1339 turns out actually necessary. */
1340 gdb_assert (value_bytes_available (dst
, dst_offset
, length
));
1341 gdb_assert (!value_bits_any_optimized_out (dst
,
1342 TARGET_CHAR_BIT
* dst_offset
,
1343 TARGET_CHAR_BIT
* length
));
1345 /* Copy the data. */
1346 memcpy (value_contents_all_raw (dst
).data () + dst_offset
* unit_size
,
1347 value_contents_all_raw (src
).data () + src_offset
* unit_size
,
1348 length
* unit_size
);
1350 /* Copy the meta-data, adjusted. */
1351 src_bit_offset
= src_offset
* unit_size
* HOST_CHAR_BIT
;
1352 dst_bit_offset
= dst_offset
* unit_size
* HOST_CHAR_BIT
;
1353 bit_length
= length
* unit_size
* HOST_CHAR_BIT
;
1355 value_ranges_copy_adjusted (dst
, dst_bit_offset
,
1356 src
, src_bit_offset
,
1360 /* Copy LENGTH bytes of SRC value's (all) contents
1361 (value_contents_all) starting at SRC_OFFSET byte, into DST value's
1362 (all) contents, starting at DST_OFFSET. If unavailable contents
1363 are being copied from SRC, the corresponding DST contents are
1364 marked unavailable accordingly. DST must not be lazy. If SRC is
1365 lazy, it will be fetched now.
1367 It is assumed the contents of DST in the [DST_OFFSET,
1368 DST_OFFSET+LENGTH) range are wholly available. */
1371 value_contents_copy (struct value
*dst
, LONGEST dst_offset
,
1372 struct value
*src
, LONGEST src_offset
, LONGEST length
)
1375 value_fetch_lazy (src
);
1377 value_contents_copy_raw (dst
, dst_offset
, src
, src_offset
, length
);
1381 value_lazy (const struct value
*value
)
1387 set_value_lazy (struct value
*value
, int val
)
1393 value_stack (const struct value
*value
)
1395 return value
->stack
;
1399 set_value_stack (struct value
*value
, int val
)
1404 gdb::array_view
<const gdb_byte
>
1405 value_contents (struct value
*value
)
1407 gdb::array_view
<const gdb_byte
> result
= value_contents_writeable (value
);
1408 require_not_optimized_out (value
);
1409 require_available (value
);
1413 gdb::array_view
<gdb_byte
>
1414 value_contents_writeable (struct value
*value
)
1417 value_fetch_lazy (value
);
1418 return value_contents_raw (value
);
1422 value_optimized_out (struct value
*value
)
1426 /* See if we can compute the result without fetching the
1428 if (VALUE_LVAL (value
) == lval_memory
)
1430 else if (VALUE_LVAL (value
) == lval_computed
)
1432 const struct lval_funcs
*funcs
= value
->location
.computed
.funcs
;
1434 if (funcs
->is_optimized_out
!= nullptr)
1435 return funcs
->is_optimized_out (value
);
1438 /* Fall back to fetching. */
1441 value_fetch_lazy (value
);
1443 catch (const gdb_exception_error
&ex
)
1448 case OPTIMIZED_OUT_ERROR
:
1449 case NOT_AVAILABLE_ERROR
:
1450 /* These can normally happen when we try to access an
1451 optimized out or unavailable register, either in a
1452 physical register or spilled to memory. */
1460 return !value
->optimized_out
.empty ();
1463 /* Mark contents of VALUE as optimized out, starting at OFFSET bytes, and
1464 the following LENGTH bytes. */
1467 mark_value_bytes_optimized_out (struct value
*value
, int offset
, int length
)
1469 mark_value_bits_optimized_out (value
,
1470 offset
* TARGET_CHAR_BIT
,
1471 length
* TARGET_CHAR_BIT
);
1477 mark_value_bits_optimized_out (struct value
*value
,
1478 LONGEST offset
, LONGEST length
)
1480 insert_into_bit_range_vector (&value
->optimized_out
, offset
, length
);
1484 value_bits_synthetic_pointer (const struct value
*value
,
1485 LONGEST offset
, LONGEST length
)
1487 if (value
->lval
!= lval_computed
1488 || !value
->location
.computed
.funcs
->check_synthetic_pointer
)
1490 return value
->location
.computed
.funcs
->check_synthetic_pointer (value
,
1496 value_embedded_offset (const struct value
*value
)
1498 return value
->embedded_offset
;
1502 set_value_embedded_offset (struct value
*value
, LONGEST val
)
1504 value
->embedded_offset
= val
;
1508 value_pointed_to_offset (const struct value
*value
)
1510 return value
->pointed_to_offset
;
1514 set_value_pointed_to_offset (struct value
*value
, LONGEST val
)
1516 value
->pointed_to_offset
= val
;
1519 const struct lval_funcs
*
1520 value_computed_funcs (const struct value
*v
)
1522 gdb_assert (value_lval_const (v
) == lval_computed
);
1524 return v
->location
.computed
.funcs
;
1528 value_computed_closure (const struct value
*v
)
1530 gdb_assert (v
->lval
== lval_computed
);
1532 return v
->location
.computed
.closure
;
1536 deprecated_value_lval_hack (struct value
*value
)
1538 return &value
->lval
;
1542 value_lval_const (const struct value
*value
)
1548 value_address (const struct value
*value
)
1550 if (value
->lval
!= lval_memory
)
1552 if (value
->parent
!= NULL
)
1553 return value_address (value
->parent
.get ()) + value
->offset
;
1554 if (NULL
!= TYPE_DATA_LOCATION (value_type (value
)))
1556 gdb_assert (PROP_CONST
== TYPE_DATA_LOCATION_KIND (value_type (value
)));
1557 return TYPE_DATA_LOCATION_ADDR (value_type (value
));
1560 return value
->location
.address
+ value
->offset
;
1564 value_raw_address (const struct value
*value
)
1566 if (value
->lval
!= lval_memory
)
1568 return value
->location
.address
;
1572 set_value_address (struct value
*value
, CORE_ADDR addr
)
1574 gdb_assert (value
->lval
== lval_memory
);
1575 value
->location
.address
= addr
;
1578 struct internalvar
**
1579 deprecated_value_internalvar_hack (struct value
*value
)
1581 return &value
->location
.internalvar
;
1585 deprecated_value_next_frame_id_hack (struct value
*value
)
1587 gdb_assert (value
->lval
== lval_register
);
1588 return &value
->location
.reg
.next_frame_id
;
1592 deprecated_value_regnum_hack (struct value
*value
)
1594 gdb_assert (value
->lval
== lval_register
);
1595 return &value
->location
.reg
.regnum
;
1599 deprecated_value_modifiable (const struct value
*value
)
1601 return value
->modifiable
;
1604 /* Return a mark in the value chain. All values allocated after the
1605 mark is obtained (except for those released) are subject to being freed
1606 if a subsequent value_free_to_mark is passed the mark. */
1610 if (all_values
.empty ())
1612 return all_values
.back ().get ();
1618 value_incref (struct value
*val
)
1620 val
->reference_count
++;
1623 /* Release a reference to VAL, which was acquired with value_incref.
1624 This function is also called to deallocate values from the value
1628 value_decref (struct value
*val
)
1632 gdb_assert (val
->reference_count
> 0);
1633 val
->reference_count
--;
1634 if (val
->reference_count
== 0)
1639 /* Free all values allocated since MARK was obtained by value_mark
1640 (except for those released). */
1642 value_free_to_mark (const struct value
*mark
)
1644 auto iter
= std::find (all_values
.begin (), all_values
.end (), mark
);
1645 if (iter
== all_values
.end ())
1646 all_values
.clear ();
1648 all_values
.erase (iter
+ 1, all_values
.end ());
1651 /* Remove VAL from the chain all_values
1652 so it will not be freed automatically. */
1655 release_value (struct value
*val
)
1658 return value_ref_ptr ();
1660 std::vector
<value_ref_ptr
>::reverse_iterator iter
;
1661 for (iter
= all_values
.rbegin (); iter
!= all_values
.rend (); ++iter
)
1665 value_ref_ptr result
= *iter
;
1666 all_values
.erase (iter
.base () - 1);
1671 /* We must always return an owned reference. Normally this happens
1672 because we transfer the reference from the value chain, but in
1673 this case the value was not on the chain. */
1674 return value_ref_ptr::new_reference (val
);
1679 std::vector
<value_ref_ptr
>
1680 value_release_to_mark (const struct value
*mark
)
1682 std::vector
<value_ref_ptr
> result
;
1684 auto iter
= std::find (all_values
.begin (), all_values
.end (), mark
);
1685 if (iter
== all_values
.end ())
1686 std::swap (result
, all_values
);
1689 std::move (iter
+ 1, all_values
.end (), std::back_inserter (result
));
1690 all_values
.erase (iter
+ 1, all_values
.end ());
1692 std::reverse (result
.begin (), result
.end ());
1696 /* Return a copy of the value ARG.
1697 It contains the same contents, for same memory address,
1698 but it's a different block of storage. */
1701 value_copy (struct value
*arg
)
1703 struct type
*encl_type
= value_enclosing_type (arg
);
1706 if (value_lazy (arg
))
1707 val
= allocate_value_lazy (encl_type
);
1709 val
= allocate_value (encl_type
);
1710 val
->type
= arg
->type
;
1711 VALUE_LVAL (val
) = VALUE_LVAL (arg
);
1712 val
->location
= arg
->location
;
1713 val
->offset
= arg
->offset
;
1714 val
->bitpos
= arg
->bitpos
;
1715 val
->bitsize
= arg
->bitsize
;
1716 val
->lazy
= arg
->lazy
;
1717 val
->embedded_offset
= value_embedded_offset (arg
);
1718 val
->pointed_to_offset
= arg
->pointed_to_offset
;
1719 val
->modifiable
= arg
->modifiable
;
1720 val
->stack
= arg
->stack
;
1721 val
->is_zero
= arg
->is_zero
;
1722 val
->initialized
= arg
->initialized
;
1723 if (!value_lazy (val
))
1725 memcpy (value_contents_all_raw (val
).data (),
1726 value_contents_all_raw (arg
).data (),
1727 TYPE_LENGTH (value_enclosing_type (arg
)));
1730 val
->unavailable
= arg
->unavailable
;
1731 val
->optimized_out
= arg
->optimized_out
;
1732 val
->parent
= arg
->parent
;
1733 if (VALUE_LVAL (val
) == lval_computed
)
1735 const struct lval_funcs
*funcs
= val
->location
.computed
.funcs
;
1737 if (funcs
->copy_closure
)
1738 val
->location
.computed
.closure
= funcs
->copy_closure (val
);
1743 /* Return a "const" and/or "volatile" qualified version of the value V.
1744 If CNST is true, then the returned value will be qualified with
1746 if VOLTL is true, then the returned value will be qualified with
1750 make_cv_value (int cnst
, int voltl
, struct value
*v
)
1752 struct type
*val_type
= value_type (v
);
1753 struct type
*enclosing_type
= value_enclosing_type (v
);
1754 struct value
*cv_val
= value_copy (v
);
1756 deprecated_set_value_type (cv_val
,
1757 make_cv_type (cnst
, voltl
, val_type
, NULL
));
1758 set_value_enclosing_type (cv_val
,
1759 make_cv_type (cnst
, voltl
, enclosing_type
, NULL
));
1764 /* Return a version of ARG that is non-lvalue. */
1767 value_non_lval (struct value
*arg
)
1769 if (VALUE_LVAL (arg
) != not_lval
)
1771 struct type
*enc_type
= value_enclosing_type (arg
);
1772 struct value
*val
= allocate_value (enc_type
);
1774 memcpy (value_contents_all_raw (val
).data (),
1775 value_contents_all (arg
).data (),
1776 TYPE_LENGTH (enc_type
));
1777 val
->type
= arg
->type
;
1778 set_value_embedded_offset (val
, value_embedded_offset (arg
));
1779 set_value_pointed_to_offset (val
, value_pointed_to_offset (arg
));
1785 /* Write contents of V at ADDR and set its lval type to be LVAL_MEMORY. */
1788 value_force_lval (struct value
*v
, CORE_ADDR addr
)
1790 gdb_assert (VALUE_LVAL (v
) == not_lval
);
1792 write_memory (addr
, value_contents_raw (v
).data (), TYPE_LENGTH (value_type (v
)));
1793 v
->lval
= lval_memory
;
1794 v
->location
.address
= addr
;
1798 set_value_component_location (struct value
*component
,
1799 const struct value
*whole
)
1803 gdb_assert (whole
->lval
!= lval_xcallable
);
1805 if (whole
->lval
== lval_internalvar
)
1806 VALUE_LVAL (component
) = lval_internalvar_component
;
1808 VALUE_LVAL (component
) = whole
->lval
;
1810 component
->location
= whole
->location
;
1811 if (whole
->lval
== lval_computed
)
1813 const struct lval_funcs
*funcs
= whole
->location
.computed
.funcs
;
1815 if (funcs
->copy_closure
)
1816 component
->location
.computed
.closure
= funcs
->copy_closure (whole
);
1819 /* If the WHOLE value has a dynamically resolved location property then
1820 update the address of the COMPONENT. */
1821 type
= value_type (whole
);
1822 if (NULL
!= TYPE_DATA_LOCATION (type
)
1823 && TYPE_DATA_LOCATION_KIND (type
) == PROP_CONST
)
1824 set_value_address (component
, TYPE_DATA_LOCATION_ADDR (type
));
1826 /* Similarly, if the COMPONENT value has a dynamically resolved location
1827 property then update its address. */
1828 type
= value_type (component
);
1829 if (NULL
!= TYPE_DATA_LOCATION (type
)
1830 && TYPE_DATA_LOCATION_KIND (type
) == PROP_CONST
)
1832 /* If the COMPONENT has a dynamic location, and is an
1833 lval_internalvar_component, then we change it to a lval_memory.
1835 Usually a component of an internalvar is created non-lazy, and has
1836 its content immediately copied from the parent internalvar.
1837 However, for components with a dynamic location, the content of
1838 the component is not contained within the parent, but is instead
1839 accessed indirectly. Further, the component will be created as a
1842 By changing the type of the component to lval_memory we ensure
1843 that value_fetch_lazy can successfully load the component.
1845 This solution isn't ideal, but a real fix would require values to
1846 carry around both the parent value contents, and the contents of
1847 any dynamic fields within the parent. This is a substantial
1848 change to how values work in GDB. */
1849 if (VALUE_LVAL (component
) == lval_internalvar_component
)
1851 gdb_assert (value_lazy (component
));
1852 VALUE_LVAL (component
) = lval_memory
;
1855 gdb_assert (VALUE_LVAL (component
) == lval_memory
);
1856 set_value_address (component
, TYPE_DATA_LOCATION_ADDR (type
));
1860 /* Access to the value history. */
1862 /* Record a new value in the value history.
1863 Returns the absolute history index of the entry. */
1866 record_latest_value (struct value
*val
)
1868 /* We don't want this value to have anything to do with the inferior anymore.
1869 In particular, "set $1 = 50" should not affect the variable from which
1870 the value was taken, and fast watchpoints should be able to assume that
1871 a value on the value history never changes. */
1872 if (value_lazy (val
))
1873 value_fetch_lazy (val
);
1874 /* We preserve VALUE_LVAL so that the user can find out where it was fetched
1875 from. This is a bit dubious, because then *&$1 does not just return $1
1876 but the current contents of that location. c'est la vie... */
1877 val
->modifiable
= 0;
1879 value_history
.push_back (release_value (val
));
1881 return value_history
.size ();
1884 /* Return a copy of the value in the history with sequence number NUM. */
1887 access_value_history (int num
)
1892 absnum
+= value_history
.size ();
1897 error (_("The history is empty."));
1899 error (_("There is only one value in the history."));
1901 error (_("History does not go back to $$%d."), -num
);
1903 if (absnum
> value_history
.size ())
1904 error (_("History has not yet reached $%d."), absnum
);
1908 return value_copy (value_history
[absnum
].get ());
1912 show_values (const char *num_exp
, int from_tty
)
1920 /* "show values +" should print from the stored position.
1921 "show values <exp>" should print around value number <exp>. */
1922 if (num_exp
[0] != '+' || num_exp
[1] != '\0')
1923 num
= parse_and_eval_long (num_exp
) - 5;
1927 /* "show values" means print the last 10 values. */
1928 num
= value_history
.size () - 9;
1934 for (i
= num
; i
< num
+ 10 && i
<= value_history
.size (); i
++)
1936 struct value_print_options opts
;
1938 val
= access_value_history (i
);
1939 printf_filtered (("$%d = "), i
);
1940 get_user_print_options (&opts
);
1941 value_print (val
, gdb_stdout
, &opts
);
1942 printf_filtered (("\n"));
1945 /* The next "show values +" should start after what we just printed. */
1948 /* Hitting just return after this command should do the same thing as
1949 "show values +". If num_exp is null, this is unnecessary, since
1950 "show values +" is not useful after "show values". */
1951 if (from_tty
&& num_exp
)
1952 set_repeat_arguments ("+");
1955 enum internalvar_kind
1957 /* The internal variable is empty. */
1960 /* The value of the internal variable is provided directly as
1961 a GDB value object. */
1964 /* A fresh value is computed via a call-back routine on every
1965 access to the internal variable. */
1966 INTERNALVAR_MAKE_VALUE
,
1968 /* The internal variable holds a GDB internal convenience function. */
1969 INTERNALVAR_FUNCTION
,
1971 /* The variable holds an integer value. */
1972 INTERNALVAR_INTEGER
,
1974 /* The variable holds a GDB-provided string. */
1978 union internalvar_data
1980 /* A value object used with INTERNALVAR_VALUE. */
1981 struct value
*value
;
1983 /* The call-back routine used with INTERNALVAR_MAKE_VALUE. */
1986 /* The functions to call. */
1987 const struct internalvar_funcs
*functions
;
1989 /* The function's user-data. */
1993 /* The internal function used with INTERNALVAR_FUNCTION. */
1996 struct internal_function
*function
;
1997 /* True if this is the canonical name for the function. */
2001 /* An integer value used with INTERNALVAR_INTEGER. */
2004 /* If type is non-NULL, it will be used as the type to generate
2005 a value for this internal variable. If type is NULL, a default
2006 integer type for the architecture is used. */
2011 /* A string value used with INTERNALVAR_STRING. */
2015 /* Internal variables. These are variables within the debugger
2016 that hold values assigned by debugger commands.
2017 The user refers to them with a '$' prefix
2018 that does not appear in the variable names stored internally. */
2022 struct internalvar
*next
;
2025 /* We support various different kinds of content of an internal variable.
2026 enum internalvar_kind specifies the kind, and union internalvar_data
2027 provides the data associated with this particular kind. */
2029 enum internalvar_kind kind
;
2031 union internalvar_data u
;
2034 static struct internalvar
*internalvars
;
2036 /* If the variable does not already exist create it and give it the
2037 value given. If no value is given then the default is zero. */
2039 init_if_undefined_command (const char* args
, int from_tty
)
2041 struct internalvar
*intvar
= nullptr;
2043 /* Parse the expression - this is taken from set_command(). */
2044 expression_up expr
= parse_expression (args
);
2046 /* Validate the expression.
2047 Was the expression an assignment?
2048 Or even an expression at all? */
2049 if (expr
->first_opcode () != BINOP_ASSIGN
)
2050 error (_("Init-if-undefined requires an assignment expression."));
2052 /* Extract the variable from the parsed expression. */
2053 expr::assign_operation
*assign
2054 = dynamic_cast<expr::assign_operation
*> (expr
->op
.get ());
2055 if (assign
!= nullptr)
2057 expr::operation
*lhs
= assign
->get_lhs ();
2058 expr::internalvar_operation
*ivarop
2059 = dynamic_cast<expr::internalvar_operation
*> (lhs
);
2060 if (ivarop
!= nullptr)
2061 intvar
= ivarop
->get_internalvar ();
2064 if (intvar
== nullptr)
2065 error (_("The first parameter to init-if-undefined "
2066 "should be a GDB variable."));
2068 /* Only evaluate the expression if the lvalue is void.
2069 This may still fail if the expression is invalid. */
2070 if (intvar
->kind
== INTERNALVAR_VOID
)
2071 evaluate_expression (expr
.get ());
2075 /* Look up an internal variable with name NAME. NAME should not
2076 normally include a dollar sign.
2078 If the specified internal variable does not exist,
2079 the return value is NULL. */
2081 struct internalvar
*
2082 lookup_only_internalvar (const char *name
)
2084 struct internalvar
*var
;
2086 for (var
= internalvars
; var
; var
= var
->next
)
2087 if (strcmp (var
->name
, name
) == 0)
2093 /* Complete NAME by comparing it to the names of internal
2097 complete_internalvar (completion_tracker
&tracker
, const char *name
)
2099 struct internalvar
*var
;
2102 len
= strlen (name
);
2104 for (var
= internalvars
; var
; var
= var
->next
)
2105 if (strncmp (var
->name
, name
, len
) == 0)
2106 tracker
.add_completion (make_unique_xstrdup (var
->name
));
2109 /* Create an internal variable with name NAME and with a void value.
2110 NAME should not normally include a dollar sign. */
2112 struct internalvar
*
2113 create_internalvar (const char *name
)
2115 struct internalvar
*var
= XNEW (struct internalvar
);
2117 var
->name
= xstrdup (name
);
2118 var
->kind
= INTERNALVAR_VOID
;
2119 var
->next
= internalvars
;
2124 /* Create an internal variable with name NAME and register FUN as the
2125 function that value_of_internalvar uses to create a value whenever
2126 this variable is referenced. NAME should not normally include a
2127 dollar sign. DATA is passed uninterpreted to FUN when it is
2128 called. CLEANUP, if not NULL, is called when the internal variable
2129 is destroyed. It is passed DATA as its only argument. */
2131 struct internalvar
*
2132 create_internalvar_type_lazy (const char *name
,
2133 const struct internalvar_funcs
*funcs
,
2136 struct internalvar
*var
= create_internalvar (name
);
2138 var
->kind
= INTERNALVAR_MAKE_VALUE
;
2139 var
->u
.make_value
.functions
= funcs
;
2140 var
->u
.make_value
.data
= data
;
2144 /* See documentation in value.h. */
2147 compile_internalvar_to_ax (struct internalvar
*var
,
2148 struct agent_expr
*expr
,
2149 struct axs_value
*value
)
2151 if (var
->kind
!= INTERNALVAR_MAKE_VALUE
2152 || var
->u
.make_value
.functions
->compile_to_ax
== NULL
)
2155 var
->u
.make_value
.functions
->compile_to_ax (var
, expr
, value
,
2156 var
->u
.make_value
.data
);
2160 /* Look up an internal variable with name NAME. NAME should not
2161 normally include a dollar sign.
2163 If the specified internal variable does not exist,
2164 one is created, with a void value. */
2166 struct internalvar
*
2167 lookup_internalvar (const char *name
)
2169 struct internalvar
*var
;
2171 var
= lookup_only_internalvar (name
);
2175 return create_internalvar (name
);
2178 /* Return current value of internal variable VAR. For variables that
2179 are not inherently typed, use a value type appropriate for GDBARCH. */
2182 value_of_internalvar (struct gdbarch
*gdbarch
, struct internalvar
*var
)
2185 struct trace_state_variable
*tsv
;
2187 /* If there is a trace state variable of the same name, assume that
2188 is what we really want to see. */
2189 tsv
= find_trace_state_variable (var
->name
);
2192 tsv
->value_known
= target_get_trace_state_variable_value (tsv
->number
,
2194 if (tsv
->value_known
)
2195 val
= value_from_longest (builtin_type (gdbarch
)->builtin_int64
,
2198 val
= allocate_value (builtin_type (gdbarch
)->builtin_void
);
2204 case INTERNALVAR_VOID
:
2205 val
= allocate_value (builtin_type (gdbarch
)->builtin_void
);
2208 case INTERNALVAR_FUNCTION
:
2209 val
= allocate_value (builtin_type (gdbarch
)->internal_fn
);
2212 case INTERNALVAR_INTEGER
:
2213 if (!var
->u
.integer
.type
)
2214 val
= value_from_longest (builtin_type (gdbarch
)->builtin_int
,
2215 var
->u
.integer
.val
);
2217 val
= value_from_longest (var
->u
.integer
.type
, var
->u
.integer
.val
);
2220 case INTERNALVAR_STRING
:
2221 val
= value_cstring (var
->u
.string
, strlen (var
->u
.string
),
2222 builtin_type (gdbarch
)->builtin_char
);
2225 case INTERNALVAR_VALUE
:
2226 val
= value_copy (var
->u
.value
);
2227 if (value_lazy (val
))
2228 value_fetch_lazy (val
);
2231 case INTERNALVAR_MAKE_VALUE
:
2232 val
= (*var
->u
.make_value
.functions
->make_value
) (gdbarch
, var
,
2233 var
->u
.make_value
.data
);
2237 internal_error (__FILE__
, __LINE__
, _("bad kind"));
2240 /* Change the VALUE_LVAL to lval_internalvar so that future operations
2241 on this value go back to affect the original internal variable.
2243 Do not do this for INTERNALVAR_MAKE_VALUE variables, as those have
2244 no underlying modifiable state in the internal variable.
2246 Likewise, if the variable's value is a computed lvalue, we want
2247 references to it to produce another computed lvalue, where
2248 references and assignments actually operate through the
2249 computed value's functions.
2251 This means that internal variables with computed values
2252 behave a little differently from other internal variables:
2253 assignments to them don't just replace the previous value
2254 altogether. At the moment, this seems like the behavior we
2257 if (var
->kind
!= INTERNALVAR_MAKE_VALUE
2258 && val
->lval
!= lval_computed
)
2260 VALUE_LVAL (val
) = lval_internalvar
;
2261 VALUE_INTERNALVAR (val
) = var
;
2268 get_internalvar_integer (struct internalvar
*var
, LONGEST
*result
)
2270 if (var
->kind
== INTERNALVAR_INTEGER
)
2272 *result
= var
->u
.integer
.val
;
2276 if (var
->kind
== INTERNALVAR_VALUE
)
2278 struct type
*type
= check_typedef (value_type (var
->u
.value
));
2280 if (type
->code () == TYPE_CODE_INT
)
2282 *result
= value_as_long (var
->u
.value
);
2291 get_internalvar_function (struct internalvar
*var
,
2292 struct internal_function
**result
)
2296 case INTERNALVAR_FUNCTION
:
2297 *result
= var
->u
.fn
.function
;
2306 set_internalvar_component (struct internalvar
*var
,
2307 LONGEST offset
, LONGEST bitpos
,
2308 LONGEST bitsize
, struct value
*newval
)
2311 struct gdbarch
*arch
;
2316 case INTERNALVAR_VALUE
:
2317 addr
= value_contents_writeable (var
->u
.value
).data ();
2318 arch
= get_value_arch (var
->u
.value
);
2319 unit_size
= gdbarch_addressable_memory_unit_size (arch
);
2322 modify_field (value_type (var
->u
.value
), addr
+ offset
,
2323 value_as_long (newval
), bitpos
, bitsize
);
2325 memcpy (addr
+ offset
* unit_size
, value_contents (newval
).data (),
2326 TYPE_LENGTH (value_type (newval
)));
2330 /* We can never get a component of any other kind. */
2331 internal_error (__FILE__
, __LINE__
, _("set_internalvar_component"));
2336 set_internalvar (struct internalvar
*var
, struct value
*val
)
2338 enum internalvar_kind new_kind
;
2339 union internalvar_data new_data
= { 0 };
2341 if (var
->kind
== INTERNALVAR_FUNCTION
&& var
->u
.fn
.canonical
)
2342 error (_("Cannot overwrite convenience function %s"), var
->name
);
2344 /* Prepare new contents. */
2345 switch (check_typedef (value_type (val
))->code ())
2347 case TYPE_CODE_VOID
:
2348 new_kind
= INTERNALVAR_VOID
;
2351 case TYPE_CODE_INTERNAL_FUNCTION
:
2352 gdb_assert (VALUE_LVAL (val
) == lval_internalvar
);
2353 new_kind
= INTERNALVAR_FUNCTION
;
2354 get_internalvar_function (VALUE_INTERNALVAR (val
),
2355 &new_data
.fn
.function
);
2356 /* Copies created here are never canonical. */
2360 new_kind
= INTERNALVAR_VALUE
;
2361 struct value
*copy
= value_copy (val
);
2362 copy
->modifiable
= 1;
2364 /* Force the value to be fetched from the target now, to avoid problems
2365 later when this internalvar is referenced and the target is gone or
2367 if (value_lazy (copy
))
2368 value_fetch_lazy (copy
);
2370 /* Release the value from the value chain to prevent it from being
2371 deleted by free_all_values. From here on this function should not
2372 call error () until new_data is installed into the var->u to avoid
2374 new_data
.value
= release_value (copy
).release ();
2376 /* Internal variables which are created from values with a dynamic
2377 location don't need the location property of the origin anymore.
2378 The resolved dynamic location is used prior then any other address
2379 when accessing the value.
2380 If we keep it, we would still refer to the origin value.
2381 Remove the location property in case it exist. */
2382 value_type (new_data
.value
)->remove_dyn_prop (DYN_PROP_DATA_LOCATION
);
2387 /* Clean up old contents. */
2388 clear_internalvar (var
);
2391 var
->kind
= new_kind
;
2393 /* End code which must not call error(). */
2397 set_internalvar_integer (struct internalvar
*var
, LONGEST l
)
2399 /* Clean up old contents. */
2400 clear_internalvar (var
);
2402 var
->kind
= INTERNALVAR_INTEGER
;
2403 var
->u
.integer
.type
= NULL
;
2404 var
->u
.integer
.val
= l
;
2408 set_internalvar_string (struct internalvar
*var
, const char *string
)
2410 /* Clean up old contents. */
2411 clear_internalvar (var
);
2413 var
->kind
= INTERNALVAR_STRING
;
2414 var
->u
.string
= xstrdup (string
);
2418 set_internalvar_function (struct internalvar
*var
, struct internal_function
*f
)
2420 /* Clean up old contents. */
2421 clear_internalvar (var
);
2423 var
->kind
= INTERNALVAR_FUNCTION
;
2424 var
->u
.fn
.function
= f
;
2425 var
->u
.fn
.canonical
= 1;
2426 /* Variables installed here are always the canonical version. */
2430 clear_internalvar (struct internalvar
*var
)
2432 /* Clean up old contents. */
2435 case INTERNALVAR_VALUE
:
2436 value_decref (var
->u
.value
);
2439 case INTERNALVAR_STRING
:
2440 xfree (var
->u
.string
);
2443 case INTERNALVAR_MAKE_VALUE
:
2444 if (var
->u
.make_value
.functions
->destroy
!= NULL
)
2445 var
->u
.make_value
.functions
->destroy (var
->u
.make_value
.data
);
2452 /* Reset to void kind. */
2453 var
->kind
= INTERNALVAR_VOID
;
2457 internalvar_name (const struct internalvar
*var
)
2462 static struct internal_function
*
2463 create_internal_function (const char *name
,
2464 internal_function_fn handler
, void *cookie
)
2466 struct internal_function
*ifn
= XNEW (struct internal_function
);
2468 ifn
->name
= xstrdup (name
);
2469 ifn
->handler
= handler
;
2470 ifn
->cookie
= cookie
;
2475 value_internal_function_name (struct value
*val
)
2477 struct internal_function
*ifn
;
2480 gdb_assert (VALUE_LVAL (val
) == lval_internalvar
);
2481 result
= get_internalvar_function (VALUE_INTERNALVAR (val
), &ifn
);
2482 gdb_assert (result
);
2488 call_internal_function (struct gdbarch
*gdbarch
,
2489 const struct language_defn
*language
,
2490 struct value
*func
, int argc
, struct value
**argv
)
2492 struct internal_function
*ifn
;
2495 gdb_assert (VALUE_LVAL (func
) == lval_internalvar
);
2496 result
= get_internalvar_function (VALUE_INTERNALVAR (func
), &ifn
);
2497 gdb_assert (result
);
2499 return (*ifn
->handler
) (gdbarch
, language
, ifn
->cookie
, argc
, argv
);
2502 /* The 'function' command. This does nothing -- it is just a
2503 placeholder to let "help function NAME" work. This is also used as
2504 the implementation of the sub-command that is created when
2505 registering an internal function. */
2507 function_command (const char *command
, int from_tty
)
2512 /* Helper function that does the work for add_internal_function. */
2514 static struct cmd_list_element
*
2515 do_add_internal_function (const char *name
, const char *doc
,
2516 internal_function_fn handler
, void *cookie
)
2518 struct internal_function
*ifn
;
2519 struct internalvar
*var
= lookup_internalvar (name
);
2521 ifn
= create_internal_function (name
, handler
, cookie
);
2522 set_internalvar_function (var
, ifn
);
2524 return add_cmd (name
, no_class
, function_command
, doc
, &functionlist
);
2530 add_internal_function (const char *name
, const char *doc
,
2531 internal_function_fn handler
, void *cookie
)
2533 do_add_internal_function (name
, doc
, handler
, cookie
);
2539 add_internal_function (gdb::unique_xmalloc_ptr
<char> &&name
,
2540 gdb::unique_xmalloc_ptr
<char> &&doc
,
2541 internal_function_fn handler
, void *cookie
)
2543 struct cmd_list_element
*cmd
2544 = do_add_internal_function (name
.get (), doc
.get (), handler
, cookie
);
2546 cmd
->doc_allocated
= 1;
2548 cmd
->name_allocated
= 1;
2551 /* Update VALUE before discarding OBJFILE. COPIED_TYPES is used to
2552 prevent cycles / duplicates. */
2555 preserve_one_value (struct value
*value
, struct objfile
*objfile
,
2556 htab_t copied_types
)
2558 if (value
->type
->objfile_owner () == objfile
)
2559 value
->type
= copy_type_recursive (objfile
, value
->type
, copied_types
);
2561 if (value
->enclosing_type
->objfile_owner () == objfile
)
2562 value
->enclosing_type
= copy_type_recursive (objfile
,
2563 value
->enclosing_type
,
2567 /* Likewise for internal variable VAR. */
2570 preserve_one_internalvar (struct internalvar
*var
, struct objfile
*objfile
,
2571 htab_t copied_types
)
2575 case INTERNALVAR_INTEGER
:
2576 if (var
->u
.integer
.type
2577 && var
->u
.integer
.type
->objfile_owner () == objfile
)
2579 = copy_type_recursive (objfile
, var
->u
.integer
.type
, copied_types
);
2582 case INTERNALVAR_VALUE
:
2583 preserve_one_value (var
->u
.value
, objfile
, copied_types
);
2588 /* Update the internal variables and value history when OBJFILE is
2589 discarded; we must copy the types out of the objfile. New global types
2590 will be created for every convenience variable which currently points to
2591 this objfile's types, and the convenience variables will be adjusted to
2592 use the new global types. */
2595 preserve_values (struct objfile
*objfile
)
2597 struct internalvar
*var
;
2599 /* Create the hash table. We allocate on the objfile's obstack, since
2600 it is soon to be deleted. */
2601 htab_up copied_types
= create_copied_types_hash (objfile
);
2603 for (const value_ref_ptr
&item
: value_history
)
2604 preserve_one_value (item
.get (), objfile
, copied_types
.get ());
2606 for (var
= internalvars
; var
; var
= var
->next
)
2607 preserve_one_internalvar (var
, objfile
, copied_types
.get ());
2609 preserve_ext_lang_values (objfile
, copied_types
.get ());
2613 show_convenience (const char *ignore
, int from_tty
)
2615 struct gdbarch
*gdbarch
= get_current_arch ();
2616 struct internalvar
*var
;
2618 struct value_print_options opts
;
2620 get_user_print_options (&opts
);
2621 for (var
= internalvars
; var
; var
= var
->next
)
2628 printf_filtered (("$%s = "), var
->name
);
2634 val
= value_of_internalvar (gdbarch
, var
);
2635 value_print (val
, gdb_stdout
, &opts
);
2637 catch (const gdb_exception_error
&ex
)
2639 fprintf_styled (gdb_stdout
, metadata_style
.style (),
2640 _("<error: %s>"), ex
.what ());
2643 printf_filtered (("\n"));
2647 /* This text does not mention convenience functions on purpose.
2648 The user can't create them except via Python, and if Python support
2649 is installed this message will never be printed ($_streq will
2651 printf_unfiltered (_("No debugger convenience variables now defined.\n"
2652 "Convenience variables have "
2653 "names starting with \"$\";\n"
2654 "use \"set\" as in \"set "
2655 "$foo = 5\" to define them.\n"));
2663 value_from_xmethod (xmethod_worker_up
&&worker
)
2667 v
= allocate_value (builtin_type (target_gdbarch ())->xmethod
);
2668 v
->lval
= lval_xcallable
;
2669 v
->location
.xm_worker
= worker
.release ();
2675 /* Return the type of the result of TYPE_CODE_XMETHOD value METHOD. */
2678 result_type_of_xmethod (struct value
*method
, gdb::array_view
<value
*> argv
)
2680 gdb_assert (value_type (method
)->code () == TYPE_CODE_XMETHOD
2681 && method
->lval
== lval_xcallable
&& !argv
.empty ());
2683 return method
->location
.xm_worker
->get_result_type (argv
[0], argv
.slice (1));
2686 /* Call the xmethod corresponding to the TYPE_CODE_XMETHOD value METHOD. */
2689 call_xmethod (struct value
*method
, gdb::array_view
<value
*> argv
)
2691 gdb_assert (value_type (method
)->code () == TYPE_CODE_XMETHOD
2692 && method
->lval
== lval_xcallable
&& !argv
.empty ());
2694 return method
->location
.xm_worker
->invoke (argv
[0], argv
.slice (1));
2697 /* Extract a value as a C number (either long or double).
2698 Knows how to convert fixed values to double, or
2699 floating values to long.
2700 Does not deallocate the value. */
2703 value_as_long (struct value
*val
)
2705 /* This coerces arrays and functions, which is necessary (e.g.
2706 in disassemble_command). It also dereferences references, which
2707 I suspect is the most logical thing to do. */
2708 val
= coerce_array (val
);
2709 return unpack_long (value_type (val
), value_contents (val
).data ());
2712 /* Extract a value as a C pointer. Does not deallocate the value.
2713 Note that val's type may not actually be a pointer; value_as_long
2714 handles all the cases. */
2716 value_as_address (struct value
*val
)
2718 struct gdbarch
*gdbarch
= value_type (val
)->arch ();
2720 /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure
2721 whether we want this to be true eventually. */
2723 /* gdbarch_addr_bits_remove is wrong if we are being called for a
2724 non-address (e.g. argument to "signal", "info break", etc.), or
2725 for pointers to char, in which the low bits *are* significant. */
2726 return gdbarch_addr_bits_remove (gdbarch
, value_as_long (val
));
2729 /* There are several targets (IA-64, PowerPC, and others) which
2730 don't represent pointers to functions as simply the address of
2731 the function's entry point. For example, on the IA-64, a
2732 function pointer points to a two-word descriptor, generated by
2733 the linker, which contains the function's entry point, and the
2734 value the IA-64 "global pointer" register should have --- to
2735 support position-independent code. The linker generates
2736 descriptors only for those functions whose addresses are taken.
2738 On such targets, it's difficult for GDB to convert an arbitrary
2739 function address into a function pointer; it has to either find
2740 an existing descriptor for that function, or call malloc and
2741 build its own. On some targets, it is impossible for GDB to
2742 build a descriptor at all: the descriptor must contain a jump
2743 instruction; data memory cannot be executed; and code memory
2746 Upon entry to this function, if VAL is a value of type `function'
2747 (that is, TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FUNC), then
2748 value_address (val) is the address of the function. This is what
2749 you'll get if you evaluate an expression like `main'. The call
2750 to COERCE_ARRAY below actually does all the usual unary
2751 conversions, which includes converting values of type `function'
2752 to `pointer to function'. This is the challenging conversion
2753 discussed above. Then, `unpack_long' will convert that pointer
2754 back into an address.
2756 So, suppose the user types `disassemble foo' on an architecture
2757 with a strange function pointer representation, on which GDB
2758 cannot build its own descriptors, and suppose further that `foo'
2759 has no linker-built descriptor. The address->pointer conversion
2760 will signal an error and prevent the command from running, even
2761 though the next step would have been to convert the pointer
2762 directly back into the same address.
2764 The following shortcut avoids this whole mess. If VAL is a
2765 function, just return its address directly. */
2766 if (value_type (val
)->code () == TYPE_CODE_FUNC
2767 || value_type (val
)->code () == TYPE_CODE_METHOD
)
2768 return value_address (val
);
2770 val
= coerce_array (val
);
2772 /* Some architectures (e.g. Harvard), map instruction and data
2773 addresses onto a single large unified address space. For
2774 instance: An architecture may consider a large integer in the
2775 range 0x10000000 .. 0x1000ffff to already represent a data
2776 addresses (hence not need a pointer to address conversion) while
2777 a small integer would still need to be converted integer to
2778 pointer to address. Just assume such architectures handle all
2779 integer conversions in a single function. */
2783 I think INTEGER_TO_ADDRESS is a good idea as proposed --- but we
2784 must admonish GDB hackers to make sure its behavior matches the
2785 compiler's, whenever possible.
2787 In general, I think GDB should evaluate expressions the same way
2788 the compiler does. When the user copies an expression out of
2789 their source code and hands it to a `print' command, they should
2790 get the same value the compiler would have computed. Any
2791 deviation from this rule can cause major confusion and annoyance,
2792 and needs to be justified carefully. In other words, GDB doesn't
2793 really have the freedom to do these conversions in clever and
2796 AndrewC pointed out that users aren't complaining about how GDB
2797 casts integers to pointers; they are complaining that they can't
2798 take an address from a disassembly listing and give it to `x/i'.
2799 This is certainly important.
2801 Adding an architecture method like integer_to_address() certainly
2802 makes it possible for GDB to "get it right" in all circumstances
2803 --- the target has complete control over how things get done, so
2804 people can Do The Right Thing for their target without breaking
2805 anyone else. The standard doesn't specify how integers get
2806 converted to pointers; usually, the ABI doesn't either, but
2807 ABI-specific code is a more reasonable place to handle it. */
2809 if (!value_type (val
)->is_pointer_or_reference ()
2810 && gdbarch_integer_to_address_p (gdbarch
))
2811 return gdbarch_integer_to_address (gdbarch
, value_type (val
),
2812 value_contents (val
).data ());
2814 return unpack_long (value_type (val
), value_contents (val
).data ());
2818 /* Unpack raw data (copied from debugee, target byte order) at VALADDR
2819 as a long, or as a double, assuming the raw data is described
2820 by type TYPE. Knows how to convert different sizes of values
2821 and can convert between fixed and floating point. We don't assume
2822 any alignment for the raw data. Return value is in host byte order.
2824 If you want functions and arrays to be coerced to pointers, and
2825 references to be dereferenced, call value_as_long() instead.
2827 C++: It is assumed that the front-end has taken care of
2828 all matters concerning pointers to members. A pointer
2829 to member which reaches here is considered to be equivalent
2830 to an INT (or some size). After all, it is only an offset. */
2833 unpack_long (struct type
*type
, const gdb_byte
*valaddr
)
2835 if (is_fixed_point_type (type
))
2836 type
= type
->fixed_point_type_base_type ();
2838 enum bfd_endian byte_order
= type_byte_order (type
);
2839 enum type_code code
= type
->code ();
2840 int len
= TYPE_LENGTH (type
);
2841 int nosign
= type
->is_unsigned ();
2845 case TYPE_CODE_TYPEDEF
:
2846 return unpack_long (check_typedef (type
), valaddr
);
2847 case TYPE_CODE_ENUM
:
2848 case TYPE_CODE_FLAGS
:
2849 case TYPE_CODE_BOOL
:
2851 case TYPE_CODE_CHAR
:
2852 case TYPE_CODE_RANGE
:
2853 case TYPE_CODE_MEMBERPTR
:
2857 if (type
->bit_size_differs_p ())
2859 unsigned bit_off
= type
->bit_offset ();
2860 unsigned bit_size
= type
->bit_size ();
2863 /* unpack_bits_as_long doesn't handle this case the
2864 way we'd like, so handle it here. */
2868 result
= unpack_bits_as_long (type
, valaddr
, bit_off
, bit_size
);
2873 result
= extract_unsigned_integer (valaddr
, len
, byte_order
);
2875 result
= extract_signed_integer (valaddr
, len
, byte_order
);
2877 if (code
== TYPE_CODE_RANGE
)
2878 result
+= type
->bounds ()->bias
;
2883 case TYPE_CODE_DECFLOAT
:
2884 return target_float_to_longest (valaddr
, type
);
2886 case TYPE_CODE_FIXED_POINT
:
2889 vq
.read_fixed_point (gdb::make_array_view (valaddr
, len
),
2891 type
->fixed_point_scaling_factor ());
2894 mpz_tdiv_q (vz
.val
, mpq_numref (vq
.val
), mpq_denref (vq
.val
));
2895 return vz
.as_integer
<LONGEST
> ();
2900 case TYPE_CODE_RVALUE_REF
:
2901 /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure
2902 whether we want this to be true eventually. */
2903 return extract_typed_address (valaddr
, type
);
2906 error (_("Value can't be converted to integer."));
2910 /* Unpack raw data (copied from debugee, target byte order) at VALADDR
2911 as a CORE_ADDR, assuming the raw data is described by type TYPE.
2912 We don't assume any alignment for the raw data. Return value is in
2915 If you want functions and arrays to be coerced to pointers, and
2916 references to be dereferenced, call value_as_address() instead.
2918 C++: It is assumed that the front-end has taken care of
2919 all matters concerning pointers to members. A pointer
2920 to member which reaches here is considered to be equivalent
2921 to an INT (or some size). After all, it is only an offset. */
2924 unpack_pointer (struct type
*type
, const gdb_byte
*valaddr
)
2926 /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure
2927 whether we want this to be true eventually. */
2928 return unpack_long (type
, valaddr
);
2932 is_floating_value (struct value
*val
)
2934 struct type
*type
= check_typedef (value_type (val
));
2936 if (is_floating_type (type
))
2938 if (!target_float_is_valid (value_contents (val
).data (), type
))
2939 error (_("Invalid floating value found in program."));
2947 /* Get the value of the FIELDNO'th field (which must be static) of
2951 value_static_field (struct type
*type
, int fieldno
)
2953 struct value
*retval
;
2955 switch (type
->field (fieldno
).loc_kind ())
2957 case FIELD_LOC_KIND_PHYSADDR
:
2958 retval
= value_at_lazy (type
->field (fieldno
).type (),
2959 type
->field (fieldno
).loc_physaddr ());
2961 case FIELD_LOC_KIND_PHYSNAME
:
2963 const char *phys_name
= type
->field (fieldno
).loc_physname ();
2964 /* type->field (fieldno).name (); */
2965 struct block_symbol sym
= lookup_symbol (phys_name
, 0, VAR_DOMAIN
, 0);
2967 if (sym
.symbol
== NULL
)
2969 /* With some compilers, e.g. HP aCC, static data members are
2970 reported as non-debuggable symbols. */
2971 struct bound_minimal_symbol msym
2972 = lookup_minimal_symbol (phys_name
, NULL
, NULL
);
2973 struct type
*field_type
= type
->field (fieldno
).type ();
2976 retval
= allocate_optimized_out_value (field_type
);
2978 retval
= value_at_lazy (field_type
, BMSYMBOL_VALUE_ADDRESS (msym
));
2981 retval
= value_of_variable (sym
.symbol
, sym
.block
);
2985 gdb_assert_not_reached ("unexpected field location kind");
2991 /* Change the enclosing type of a value object VAL to NEW_ENCL_TYPE.
2992 You have to be careful here, since the size of the data area for the value
2993 is set by the length of the enclosing type. So if NEW_ENCL_TYPE is bigger
2994 than the old enclosing type, you have to allocate more space for the
2998 set_value_enclosing_type (struct value
*val
, struct type
*new_encl_type
)
3000 if (TYPE_LENGTH (new_encl_type
) > TYPE_LENGTH (value_enclosing_type (val
)))
3002 check_type_length_before_alloc (new_encl_type
);
3004 .reset ((gdb_byte
*) xrealloc (val
->contents
.release (),
3005 TYPE_LENGTH (new_encl_type
)));
3008 val
->enclosing_type
= new_encl_type
;
3011 /* Given a value ARG1 (offset by OFFSET bytes)
3012 of a struct or union type ARG_TYPE,
3013 extract and return the value of one of its (non-static) fields.
3014 FIELDNO says which field. */
3017 value_primitive_field (struct value
*arg1
, LONGEST offset
,
3018 int fieldno
, struct type
*arg_type
)
3022 struct gdbarch
*arch
= get_value_arch (arg1
);
3023 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
3025 arg_type
= check_typedef (arg_type
);
3026 type
= arg_type
->field (fieldno
).type ();
3028 /* Call check_typedef on our type to make sure that, if TYPE
3029 is a TYPE_CODE_TYPEDEF, its length is set to the length
3030 of the target type instead of zero. However, we do not
3031 replace the typedef type by the target type, because we want
3032 to keep the typedef in order to be able to print the type
3033 description correctly. */
3034 check_typedef (type
);
3036 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
))
3038 /* Handle packed fields.
3040 Create a new value for the bitfield, with bitpos and bitsize
3041 set. If possible, arrange offset and bitpos so that we can
3042 do a single aligned read of the size of the containing type.
3043 Otherwise, adjust offset to the byte containing the first
3044 bit. Assume that the address, offset, and embedded offset
3045 are sufficiently aligned. */
3047 LONGEST bitpos
= arg_type
->field (fieldno
).loc_bitpos ();
3048 LONGEST container_bitsize
= TYPE_LENGTH (type
) * 8;
3050 v
= allocate_value_lazy (type
);
3051 v
->bitsize
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
3052 if ((bitpos
% container_bitsize
) + v
->bitsize
<= container_bitsize
3053 && TYPE_LENGTH (type
) <= (int) sizeof (LONGEST
))
3054 v
->bitpos
= bitpos
% container_bitsize
;
3056 v
->bitpos
= bitpos
% 8;
3057 v
->offset
= (value_embedded_offset (arg1
)
3059 + (bitpos
- v
->bitpos
) / 8);
3060 set_value_parent (v
, arg1
);
3061 if (!value_lazy (arg1
))
3062 value_fetch_lazy (v
);
3064 else if (fieldno
< TYPE_N_BASECLASSES (arg_type
))
3066 /* This field is actually a base subobject, so preserve the
3067 entire object's contents for later references to virtual
3071 /* Lazy register values with offsets are not supported. */
3072 if (VALUE_LVAL (arg1
) == lval_register
&& value_lazy (arg1
))
3073 value_fetch_lazy (arg1
);
3075 /* We special case virtual inheritance here because this
3076 requires access to the contents, which we would rather avoid
3077 for references to ordinary fields of unavailable values. */
3078 if (BASETYPE_VIA_VIRTUAL (arg_type
, fieldno
))
3079 boffset
= baseclass_offset (arg_type
, fieldno
,
3080 value_contents (arg1
).data (),
3081 value_embedded_offset (arg1
),
3082 value_address (arg1
),
3085 boffset
= arg_type
->field (fieldno
).loc_bitpos () / 8;
3087 if (value_lazy (arg1
))
3088 v
= allocate_value_lazy (value_enclosing_type (arg1
));
3091 v
= allocate_value (value_enclosing_type (arg1
));
3092 value_contents_copy_raw (v
, 0, arg1
, 0,
3093 TYPE_LENGTH (value_enclosing_type (arg1
)));
3096 v
->offset
= value_offset (arg1
);
3097 v
->embedded_offset
= offset
+ value_embedded_offset (arg1
) + boffset
;
3099 else if (NULL
!= TYPE_DATA_LOCATION (type
))
3101 /* Field is a dynamic data member. */
3103 gdb_assert (0 == offset
);
3104 /* We expect an already resolved data location. */
3105 gdb_assert (PROP_CONST
== TYPE_DATA_LOCATION_KIND (type
));
3106 /* For dynamic data types defer memory allocation
3107 until we actual access the value. */
3108 v
= allocate_value_lazy (type
);
3112 /* Plain old data member */
3113 offset
+= (arg_type
->field (fieldno
).loc_bitpos ()
3114 / (HOST_CHAR_BIT
* unit_size
));
3116 /* Lazy register values with offsets are not supported. */
3117 if (VALUE_LVAL (arg1
) == lval_register
&& value_lazy (arg1
))
3118 value_fetch_lazy (arg1
);
3120 if (value_lazy (arg1
))
3121 v
= allocate_value_lazy (type
);
3124 v
= allocate_value (type
);
3125 value_contents_copy_raw (v
, value_embedded_offset (v
),
3126 arg1
, value_embedded_offset (arg1
) + offset
,
3127 type_length_units (type
));
3129 v
->offset
= (value_offset (arg1
) + offset
3130 + value_embedded_offset (arg1
));
3132 set_value_component_location (v
, arg1
);
3136 /* Given a value ARG1 of a struct or union type,
3137 extract and return the value of one of its (non-static) fields.
3138 FIELDNO says which field. */
3141 value_field (struct value
*arg1
, int fieldno
)
3143 return value_primitive_field (arg1
, 0, fieldno
, value_type (arg1
));
3146 /* Return a non-virtual function as a value.
3147 F is the list of member functions which contains the desired method.
3148 J is an index into F which provides the desired method.
3150 We only use the symbol for its address, so be happy with either a
3151 full symbol or a minimal symbol. */
3154 value_fn_field (struct value
**arg1p
, struct fn_field
*f
,
3155 int j
, struct type
*type
,
3159 struct type
*ftype
= TYPE_FN_FIELD_TYPE (f
, j
);
3160 const char *physname
= TYPE_FN_FIELD_PHYSNAME (f
, j
);
3162 struct bound_minimal_symbol msym
;
3164 sym
= lookup_symbol (physname
, 0, VAR_DOMAIN
, 0).symbol
;
3167 memset (&msym
, 0, sizeof (msym
));
3171 gdb_assert (sym
== NULL
);
3172 msym
= lookup_bound_minimal_symbol (physname
);
3173 if (msym
.minsym
== NULL
)
3177 v
= allocate_value (ftype
);
3178 VALUE_LVAL (v
) = lval_memory
;
3181 set_value_address (v
, BLOCK_ENTRY_PC (SYMBOL_BLOCK_VALUE (sym
)));
3185 /* The minimal symbol might point to a function descriptor;
3186 resolve it to the actual code address instead. */
3187 struct objfile
*objfile
= msym
.objfile
;
3188 struct gdbarch
*gdbarch
= objfile
->arch ();
3190 set_value_address (v
,
3191 gdbarch_convert_from_func_ptr_addr
3192 (gdbarch
, BMSYMBOL_VALUE_ADDRESS (msym
),
3193 current_inferior ()->top_target ()));
3198 if (type
!= value_type (*arg1p
))
3199 *arg1p
= value_ind (value_cast (lookup_pointer_type (type
),
3200 value_addr (*arg1p
)));
3202 /* Move the `this' pointer according to the offset.
3203 VALUE_OFFSET (*arg1p) += offset; */
3214 unpack_bits_as_long (struct type
*field_type
, const gdb_byte
*valaddr
,
3215 LONGEST bitpos
, LONGEST bitsize
)
3217 enum bfd_endian byte_order
= type_byte_order (field_type
);
3222 LONGEST read_offset
;
3224 /* Read the minimum number of bytes required; there may not be
3225 enough bytes to read an entire ULONGEST. */
3226 field_type
= check_typedef (field_type
);
3228 bytes_read
= ((bitpos
% 8) + bitsize
+ 7) / 8;
3231 bytes_read
= TYPE_LENGTH (field_type
);
3232 bitsize
= 8 * bytes_read
;
3235 read_offset
= bitpos
/ 8;
3237 val
= extract_unsigned_integer (valaddr
+ read_offset
,
3238 bytes_read
, byte_order
);
3240 /* Extract bits. See comment above. */
3242 if (byte_order
== BFD_ENDIAN_BIG
)
3243 lsbcount
= (bytes_read
* 8 - bitpos
% 8 - bitsize
);
3245 lsbcount
= (bitpos
% 8);
3248 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
3249 If the field is signed, and is negative, then sign extend. */
3251 if (bitsize
< 8 * (int) sizeof (val
))
3253 valmask
= (((ULONGEST
) 1) << bitsize
) - 1;
3255 if (!field_type
->is_unsigned ())
3257 if (val
& (valmask
^ (valmask
>> 1)))
3267 /* Unpack a field FIELDNO of the specified TYPE, from the object at
3268 VALADDR + EMBEDDED_OFFSET. VALADDR points to the contents of
3269 ORIGINAL_VALUE, which must not be NULL. See
3270 unpack_value_bits_as_long for more details. */
3273 unpack_value_field_as_long (struct type
*type
, const gdb_byte
*valaddr
,
3274 LONGEST embedded_offset
, int fieldno
,
3275 const struct value
*val
, LONGEST
*result
)
3277 int bitpos
= type
->field (fieldno
).loc_bitpos ();
3278 int bitsize
= TYPE_FIELD_BITSIZE (type
, fieldno
);
3279 struct type
*field_type
= type
->field (fieldno
).type ();
3282 gdb_assert (val
!= NULL
);
3284 bit_offset
= embedded_offset
* TARGET_CHAR_BIT
+ bitpos
;
3285 if (value_bits_any_optimized_out (val
, bit_offset
, bitsize
)
3286 || !value_bits_available (val
, bit_offset
, bitsize
))
3289 *result
= unpack_bits_as_long (field_type
, valaddr
+ embedded_offset
,
3294 /* Unpack a field FIELDNO of the specified TYPE, from the anonymous
3295 object at VALADDR. See unpack_bits_as_long for more details. */
3298 unpack_field_as_long (struct type
*type
, const gdb_byte
*valaddr
, int fieldno
)
3300 int bitpos
= type
->field (fieldno
).loc_bitpos ();
3301 int bitsize
= TYPE_FIELD_BITSIZE (type
, fieldno
);
3302 struct type
*field_type
= type
->field (fieldno
).type ();
3304 return unpack_bits_as_long (field_type
, valaddr
, bitpos
, bitsize
);
3307 /* Unpack a bitfield of BITSIZE bits found at BITPOS in the object at
3308 VALADDR + EMBEDDEDOFFSET that has the type of DEST_VAL and store
3309 the contents in DEST_VAL, zero or sign extending if the type of
3310 DEST_VAL is wider than BITSIZE. VALADDR points to the contents of
3311 VAL. If the VAL's contents required to extract the bitfield from
3312 are unavailable/optimized out, DEST_VAL is correspondingly
3313 marked unavailable/optimized out. */
3316 unpack_value_bitfield (struct value
*dest_val
,
3317 LONGEST bitpos
, LONGEST bitsize
,
3318 const gdb_byte
*valaddr
, LONGEST embedded_offset
,
3319 const struct value
*val
)
3321 enum bfd_endian byte_order
;
3324 struct type
*field_type
= value_type (dest_val
);
3326 byte_order
= type_byte_order (field_type
);
3328 /* First, unpack and sign extend the bitfield as if it was wholly
3329 valid. Optimized out/unavailable bits are read as zero, but
3330 that's OK, as they'll end up marked below. If the VAL is
3331 wholly-invalid we may have skipped allocating its contents,
3332 though. See allocate_optimized_out_value. */
3333 if (valaddr
!= NULL
)
3337 num
= unpack_bits_as_long (field_type
, valaddr
+ embedded_offset
,
3339 store_signed_integer (value_contents_raw (dest_val
).data (),
3340 TYPE_LENGTH (field_type
), byte_order
, num
);
3343 /* Now copy the optimized out / unavailability ranges to the right
3345 src_bit_offset
= embedded_offset
* TARGET_CHAR_BIT
+ bitpos
;
3346 if (byte_order
== BFD_ENDIAN_BIG
)
3347 dst_bit_offset
= TYPE_LENGTH (field_type
) * TARGET_CHAR_BIT
- bitsize
;
3350 value_ranges_copy_adjusted (dest_val
, dst_bit_offset
,
3351 val
, src_bit_offset
, bitsize
);
3354 /* Return a new value with type TYPE, which is FIELDNO field of the
3355 object at VALADDR + EMBEDDEDOFFSET. VALADDR points to the contents
3356 of VAL. If the VAL's contents required to extract the bitfield
3357 from are unavailable/optimized out, the new value is
3358 correspondingly marked unavailable/optimized out. */
3361 value_field_bitfield (struct type
*type
, int fieldno
,
3362 const gdb_byte
*valaddr
,
3363 LONGEST embedded_offset
, const struct value
*val
)
3365 int bitpos
= type
->field (fieldno
).loc_bitpos ();
3366 int bitsize
= TYPE_FIELD_BITSIZE (type
, fieldno
);
3367 struct value
*res_val
= allocate_value (type
->field (fieldno
).type ());
3369 unpack_value_bitfield (res_val
, bitpos
, bitsize
,
3370 valaddr
, embedded_offset
, val
);
3375 /* Modify the value of a bitfield. ADDR points to a block of memory in
3376 target byte order; the bitfield starts in the byte pointed to. FIELDVAL
3377 is the desired value of the field, in host byte order. BITPOS and BITSIZE
3378 indicate which bits (in target bit order) comprise the bitfield.
3379 Requires 0 < BITSIZE <= lbits, 0 <= BITPOS % 8 + BITSIZE <= lbits, and
3380 0 <= BITPOS, where lbits is the size of a LONGEST in bits. */
3383 modify_field (struct type
*type
, gdb_byte
*addr
,
3384 LONGEST fieldval
, LONGEST bitpos
, LONGEST bitsize
)
3386 enum bfd_endian byte_order
= type_byte_order (type
);
3388 ULONGEST mask
= (ULONGEST
) -1 >> (8 * sizeof (ULONGEST
) - bitsize
);
3391 /* Normalize BITPOS. */
3395 /* If a negative fieldval fits in the field in question, chop
3396 off the sign extension bits. */
3397 if ((~fieldval
& ~(mask
>> 1)) == 0)
3400 /* Warn if value is too big to fit in the field in question. */
3401 if (0 != (fieldval
& ~mask
))
3403 /* FIXME: would like to include fieldval in the message, but
3404 we don't have a sprintf_longest. */
3405 warning (_("Value does not fit in %s bits."), plongest (bitsize
));
3407 /* Truncate it, otherwise adjoining fields may be corrupted. */
3411 /* Ensure no bytes outside of the modified ones get accessed as it may cause
3412 false valgrind reports. */
3414 bytesize
= (bitpos
+ bitsize
+ 7) / 8;
3415 oword
= extract_unsigned_integer (addr
, bytesize
, byte_order
);
3417 /* Shifting for bit field depends on endianness of the target machine. */
3418 if (byte_order
== BFD_ENDIAN_BIG
)
3419 bitpos
= bytesize
* 8 - bitpos
- bitsize
;
3421 oword
&= ~(mask
<< bitpos
);
3422 oword
|= fieldval
<< bitpos
;
3424 store_unsigned_integer (addr
, bytesize
, byte_order
, oword
);
3427 /* Pack NUM into BUF using a target format of TYPE. */
3430 pack_long (gdb_byte
*buf
, struct type
*type
, LONGEST num
)
3432 enum bfd_endian byte_order
= type_byte_order (type
);
3435 type
= check_typedef (type
);
3436 len
= TYPE_LENGTH (type
);
3438 switch (type
->code ())
3440 case TYPE_CODE_RANGE
:
3441 num
-= type
->bounds ()->bias
;
3444 case TYPE_CODE_CHAR
:
3445 case TYPE_CODE_ENUM
:
3446 case TYPE_CODE_FLAGS
:
3447 case TYPE_CODE_BOOL
:
3448 case TYPE_CODE_MEMBERPTR
:
3449 if (type
->bit_size_differs_p ())
3451 unsigned bit_off
= type
->bit_offset ();
3452 unsigned bit_size
= type
->bit_size ();
3453 num
&= ((ULONGEST
) 1 << bit_size
) - 1;
3456 store_signed_integer (buf
, len
, byte_order
, num
);
3460 case TYPE_CODE_RVALUE_REF
:
3462 store_typed_address (buf
, type
, (CORE_ADDR
) num
);
3466 case TYPE_CODE_DECFLOAT
:
3467 target_float_from_longest (buf
, type
, num
);
3471 error (_("Unexpected type (%d) encountered for integer constant."),
3477 /* Pack NUM into BUF using a target format of TYPE. */
3480 pack_unsigned_long (gdb_byte
*buf
, struct type
*type
, ULONGEST num
)
3483 enum bfd_endian byte_order
;
3485 type
= check_typedef (type
);
3486 len
= TYPE_LENGTH (type
);
3487 byte_order
= type_byte_order (type
);
3489 switch (type
->code ())
3492 case TYPE_CODE_CHAR
:
3493 case TYPE_CODE_ENUM
:
3494 case TYPE_CODE_FLAGS
:
3495 case TYPE_CODE_BOOL
:
3496 case TYPE_CODE_RANGE
:
3497 case TYPE_CODE_MEMBERPTR
:
3498 if (type
->bit_size_differs_p ())
3500 unsigned bit_off
= type
->bit_offset ();
3501 unsigned bit_size
= type
->bit_size ();
3502 num
&= ((ULONGEST
) 1 << bit_size
) - 1;
3505 store_unsigned_integer (buf
, len
, byte_order
, num
);
3509 case TYPE_CODE_RVALUE_REF
:
3511 store_typed_address (buf
, type
, (CORE_ADDR
) num
);
3515 case TYPE_CODE_DECFLOAT
:
3516 target_float_from_ulongest (buf
, type
, num
);
3520 error (_("Unexpected type (%d) encountered "
3521 "for unsigned integer constant."),
3527 /* Create a value of type TYPE that is zero, and return it. */
3530 value_zero (struct type
*type
, enum lval_type lv
)
3532 struct value
*val
= allocate_value_lazy (type
);
3534 VALUE_LVAL (val
) = (lv
== lval_computed
? not_lval
: lv
);
3535 val
->is_zero
= true;
3539 /* Convert C numbers into newly allocated values. */
3542 value_from_longest (struct type
*type
, LONGEST num
)
3544 struct value
*val
= allocate_value (type
);
3546 pack_long (value_contents_raw (val
).data (), type
, num
);
3551 /* Convert C unsigned numbers into newly allocated values. */
3554 value_from_ulongest (struct type
*type
, ULONGEST num
)
3556 struct value
*val
= allocate_value (type
);
3558 pack_unsigned_long (value_contents_raw (val
).data (), type
, num
);
3564 /* Create a value representing a pointer of type TYPE to the address
3568 value_from_pointer (struct type
*type
, CORE_ADDR addr
)
3570 struct value
*val
= allocate_value (type
);
3572 store_typed_address (value_contents_raw (val
).data (),
3573 check_typedef (type
), addr
);
3577 /* Create and return a value object of TYPE containing the value D. The
3578 TYPE must be of TYPE_CODE_FLT, and must be large enough to hold D once
3579 it is converted to target format. */
3582 value_from_host_double (struct type
*type
, double d
)
3584 struct value
*value
= allocate_value (type
);
3585 gdb_assert (type
->code () == TYPE_CODE_FLT
);
3586 target_float_from_host_double (value_contents_raw (value
).data (),
3587 value_type (value
), d
);
3591 /* Create a value of type TYPE whose contents come from VALADDR, if it
3592 is non-null, and whose memory address (in the inferior) is
3593 ADDRESS. The type of the created value may differ from the passed
3594 type TYPE. Make sure to retrieve values new type after this call.
3595 Note that TYPE is not passed through resolve_dynamic_type; this is
3596 a special API intended for use only by Ada. */
3599 value_from_contents_and_address_unresolved (struct type
*type
,
3600 const gdb_byte
*valaddr
,
3605 if (valaddr
== NULL
)
3606 v
= allocate_value_lazy (type
);
3608 v
= value_from_contents (type
, valaddr
);
3609 VALUE_LVAL (v
) = lval_memory
;
3610 set_value_address (v
, address
);
3614 /* Create a value of type TYPE whose contents come from VALADDR, if it
3615 is non-null, and whose memory address (in the inferior) is
3616 ADDRESS. The type of the created value may differ from the passed
3617 type TYPE. Make sure to retrieve values new type after this call. */
3620 value_from_contents_and_address (struct type
*type
,
3621 const gdb_byte
*valaddr
,
3624 gdb::array_view
<const gdb_byte
> view
;
3625 if (valaddr
!= nullptr)
3626 view
= gdb::make_array_view (valaddr
, TYPE_LENGTH (type
));
3627 struct type
*resolved_type
= resolve_dynamic_type (type
, view
, address
);
3628 struct type
*resolved_type_no_typedef
= check_typedef (resolved_type
);
3631 if (valaddr
== NULL
)
3632 v
= allocate_value_lazy (resolved_type
);
3634 v
= value_from_contents (resolved_type
, valaddr
);
3635 if (TYPE_DATA_LOCATION (resolved_type_no_typedef
) != NULL
3636 && TYPE_DATA_LOCATION_KIND (resolved_type_no_typedef
) == PROP_CONST
)
3637 address
= TYPE_DATA_LOCATION_ADDR (resolved_type_no_typedef
);
3638 VALUE_LVAL (v
) = lval_memory
;
3639 set_value_address (v
, address
);
3643 /* Create a value of type TYPE holding the contents CONTENTS.
3644 The new value is `not_lval'. */
3647 value_from_contents (struct type
*type
, const gdb_byte
*contents
)
3649 struct value
*result
;
3651 result
= allocate_value (type
);
3652 memcpy (value_contents_raw (result
).data (), contents
, TYPE_LENGTH (type
));
3656 /* Extract a value from the history file. Input will be of the form
3657 $digits or $$digits. See block comment above 'write_dollar_variable'
3661 value_from_history_ref (const char *h
, const char **endp
)
3673 /* Find length of numeral string. */
3674 for (; isdigit (h
[len
]); len
++)
3677 /* Make sure numeral string is not part of an identifier. */
3678 if (h
[len
] == '_' || isalpha (h
[len
]))
3681 /* Now collect the index value. */
3686 /* For some bizarre reason, "$$" is equivalent to "$$1",
3687 rather than to "$$0" as it ought to be! */
3695 index
= -strtol (&h
[2], &local_end
, 10);
3703 /* "$" is equivalent to "$0". */
3711 index
= strtol (&h
[1], &local_end
, 10);
3716 return access_value_history (index
);
3719 /* Get the component value (offset by OFFSET bytes) of a struct or
3720 union WHOLE. Component's type is TYPE. */
3723 value_from_component (struct value
*whole
, struct type
*type
, LONGEST offset
)
3727 if (VALUE_LVAL (whole
) == lval_memory
&& value_lazy (whole
))
3728 v
= allocate_value_lazy (type
);
3731 v
= allocate_value (type
);
3732 value_contents_copy (v
, value_embedded_offset (v
),
3733 whole
, value_embedded_offset (whole
) + offset
,
3734 type_length_units (type
));
3736 v
->offset
= value_offset (whole
) + offset
+ value_embedded_offset (whole
);
3737 set_value_component_location (v
, whole
);
3743 coerce_ref_if_computed (const struct value
*arg
)
3745 const struct lval_funcs
*funcs
;
3747 if (!TYPE_IS_REFERENCE (check_typedef (value_type (arg
))))
3750 if (value_lval_const (arg
) != lval_computed
)
3753 funcs
= value_computed_funcs (arg
);
3754 if (funcs
->coerce_ref
== NULL
)
3757 return funcs
->coerce_ref (arg
);
3760 /* Look at value.h for description. */
3763 readjust_indirect_value_type (struct value
*value
, struct type
*enc_type
,
3764 const struct type
*original_type
,
3765 struct value
*original_value
,
3766 CORE_ADDR original_value_address
)
3768 gdb_assert (original_type
->is_pointer_or_reference ());
3770 struct type
*original_target_type
= TYPE_TARGET_TYPE (original_type
);
3771 gdb::array_view
<const gdb_byte
> view
;
3772 struct type
*resolved_original_target_type
3773 = resolve_dynamic_type (original_target_type
, view
,
3774 original_value_address
);
3776 /* Re-adjust type. */
3777 deprecated_set_value_type (value
, resolved_original_target_type
);
3779 /* Add embedding info. */
3780 set_value_enclosing_type (value
, enc_type
);
3781 set_value_embedded_offset (value
, value_pointed_to_offset (original_value
));
3783 /* We may be pointing to an object of some derived type. */
3784 return value_full_object (value
, NULL
, 0, 0, 0);
3788 coerce_ref (struct value
*arg
)
3790 struct type
*value_type_arg_tmp
= check_typedef (value_type (arg
));
3791 struct value
*retval
;
3792 struct type
*enc_type
;
3794 retval
= coerce_ref_if_computed (arg
);
3798 if (!TYPE_IS_REFERENCE (value_type_arg_tmp
))
3801 enc_type
= check_typedef (value_enclosing_type (arg
));
3802 enc_type
= TYPE_TARGET_TYPE (enc_type
);
3804 CORE_ADDR addr
= unpack_pointer (value_type (arg
), value_contents (arg
).data ());
3805 retval
= value_at_lazy (enc_type
, addr
);
3806 enc_type
= value_type (retval
);
3807 return readjust_indirect_value_type (retval
, enc_type
, value_type_arg_tmp
,
3812 coerce_array (struct value
*arg
)
3816 arg
= coerce_ref (arg
);
3817 type
= check_typedef (value_type (arg
));
3819 switch (type
->code ())
3821 case TYPE_CODE_ARRAY
:
3822 if (!type
->is_vector () && current_language
->c_style_arrays_p ())
3823 arg
= value_coerce_array (arg
);
3825 case TYPE_CODE_FUNC
:
3826 arg
= value_coerce_function (arg
);
3833 /* Return the return value convention that will be used for the
3836 enum return_value_convention
3837 struct_return_convention (struct gdbarch
*gdbarch
,
3838 struct value
*function
, struct type
*value_type
)
3840 enum type_code code
= value_type
->code ();
3842 if (code
== TYPE_CODE_ERROR
)
3843 error (_("Function return type unknown."));
3845 /* Probe the architecture for the return-value convention. */
3846 return gdbarch_return_value (gdbarch
, function
, value_type
,
3850 /* Return true if the function returning the specified type is using
3851 the convention of returning structures in memory (passing in the
3852 address as a hidden first parameter). */
3855 using_struct_return (struct gdbarch
*gdbarch
,
3856 struct value
*function
, struct type
*value_type
)
3858 if (value_type
->code () == TYPE_CODE_VOID
)
3859 /* A void return value is never in memory. See also corresponding
3860 code in "print_return_value". */
3863 return (struct_return_convention (gdbarch
, function
, value_type
)
3864 != RETURN_VALUE_REGISTER_CONVENTION
);
3867 /* Set the initialized field in a value struct. */
3870 set_value_initialized (struct value
*val
, int status
)
3872 val
->initialized
= status
;
3875 /* Return the initialized field in a value struct. */
3878 value_initialized (const struct value
*val
)
3880 return val
->initialized
;
3883 /* Helper for value_fetch_lazy when the value is a bitfield. */
3886 value_fetch_lazy_bitfield (struct value
*val
)
3888 gdb_assert (value_bitsize (val
) != 0);
3890 /* To read a lazy bitfield, read the entire enclosing value. This
3891 prevents reading the same block of (possibly volatile) memory once
3892 per bitfield. It would be even better to read only the containing
3893 word, but we have no way to record that just specific bits of a
3894 value have been fetched. */
3895 struct value
*parent
= value_parent (val
);
3897 if (value_lazy (parent
))
3898 value_fetch_lazy (parent
);
3900 unpack_value_bitfield (val
, value_bitpos (val
), value_bitsize (val
),
3901 value_contents_for_printing (parent
).data (),
3902 value_offset (val
), parent
);
3905 /* Helper for value_fetch_lazy when the value is in memory. */
3908 value_fetch_lazy_memory (struct value
*val
)
3910 gdb_assert (VALUE_LVAL (val
) == lval_memory
);
3912 CORE_ADDR addr
= value_address (val
);
3913 struct type
*type
= check_typedef (value_enclosing_type (val
));
3915 if (TYPE_LENGTH (type
))
3916 read_value_memory (val
, 0, value_stack (val
),
3917 addr
, value_contents_all_raw (val
).data (),
3918 type_length_units (type
));
3921 /* Helper for value_fetch_lazy when the value is in a register. */
3924 value_fetch_lazy_register (struct value
*val
)
3926 struct frame_info
*next_frame
;
3928 struct type
*type
= check_typedef (value_type (val
));
3929 struct value
*new_val
= val
, *mark
= value_mark ();
3931 /* Offsets are not supported here; lazy register values must
3932 refer to the entire register. */
3933 gdb_assert (value_offset (val
) == 0);
3935 while (VALUE_LVAL (new_val
) == lval_register
&& value_lazy (new_val
))
3937 struct frame_id next_frame_id
= VALUE_NEXT_FRAME_ID (new_val
);
3939 next_frame
= frame_find_by_id (next_frame_id
);
3940 regnum
= VALUE_REGNUM (new_val
);
3942 gdb_assert (next_frame
!= NULL
);
3944 /* Convertible register routines are used for multi-register
3945 values and for interpretation in different types
3946 (e.g. float or int from a double register). Lazy
3947 register values should have the register's natural type,
3948 so they do not apply. */
3949 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (next_frame
),
3952 /* FRAME was obtained, above, via VALUE_NEXT_FRAME_ID.
3953 Since a "->next" operation was performed when setting
3954 this field, we do not need to perform a "next" operation
3955 again when unwinding the register. That's why
3956 frame_unwind_register_value() is called here instead of
3957 get_frame_register_value(). */
3958 new_val
= frame_unwind_register_value (next_frame
, regnum
);
3960 /* If we get another lazy lval_register value, it means the
3961 register is found by reading it from NEXT_FRAME's next frame.
3962 frame_unwind_register_value should never return a value with
3963 the frame id pointing to NEXT_FRAME. If it does, it means we
3964 either have two consecutive frames with the same frame id
3965 in the frame chain, or some code is trying to unwind
3966 behind get_prev_frame's back (e.g., a frame unwind
3967 sniffer trying to unwind), bypassing its validations. In
3968 any case, it should always be an internal error to end up
3969 in this situation. */
3970 if (VALUE_LVAL (new_val
) == lval_register
3971 && value_lazy (new_val
)
3972 && frame_id_eq (VALUE_NEXT_FRAME_ID (new_val
), next_frame_id
))
3973 internal_error (__FILE__
, __LINE__
,
3974 _("infinite loop while fetching a register"));
3977 /* If it's still lazy (for instance, a saved register on the
3978 stack), fetch it. */
3979 if (value_lazy (new_val
))
3980 value_fetch_lazy (new_val
);
3982 /* Copy the contents and the unavailability/optimized-out
3983 meta-data from NEW_VAL to VAL. */
3984 set_value_lazy (val
, 0);
3985 value_contents_copy (val
, value_embedded_offset (val
),
3986 new_val
, value_embedded_offset (new_val
),
3987 type_length_units (type
));
3991 struct gdbarch
*gdbarch
;
3992 struct frame_info
*frame
;
3993 frame
= frame_find_by_id (VALUE_NEXT_FRAME_ID (val
));
3994 frame
= get_prev_frame_always (frame
);
3995 regnum
= VALUE_REGNUM (val
);
3996 gdbarch
= get_frame_arch (frame
);
3998 string_file debug_file
;
3999 fprintf_unfiltered (&debug_file
,
4000 "(frame=%d, regnum=%d(%s), ...) ",
4001 frame_relative_level (frame
), regnum
,
4002 user_reg_map_regnum_to_name (gdbarch
, regnum
));
4004 fprintf_unfiltered (&debug_file
, "->");
4005 if (value_optimized_out (new_val
))
4007 fprintf_unfiltered (&debug_file
, " ");
4008 val_print_optimized_out (new_val
, &debug_file
);
4013 const gdb_byte
*buf
= value_contents (new_val
).data ();
4015 if (VALUE_LVAL (new_val
) == lval_register
)
4016 fprintf_unfiltered (&debug_file
, " register=%d",
4017 VALUE_REGNUM (new_val
));
4018 else if (VALUE_LVAL (new_val
) == lval_memory
)
4019 fprintf_unfiltered (&debug_file
, " address=%s",
4021 value_address (new_val
)));
4023 fprintf_unfiltered (&debug_file
, " computed");
4025 fprintf_unfiltered (&debug_file
, " bytes=");
4026 fprintf_unfiltered (&debug_file
, "[");
4027 for (i
= 0; i
< register_size (gdbarch
, regnum
); i
++)
4028 fprintf_unfiltered (&debug_file
, "%02x", buf
[i
]);
4029 fprintf_unfiltered (&debug_file
, "]");
4032 frame_debug_printf ("%s", debug_file
.c_str ());
4035 /* Dispose of the intermediate values. This prevents
4036 watchpoints from trying to watch the saved frame pointer. */
4037 value_free_to_mark (mark
);
4040 /* Load the actual content of a lazy value. Fetch the data from the
4041 user's process and clear the lazy flag to indicate that the data in
4042 the buffer is valid.
4044 If the value is zero-length, we avoid calling read_memory, which
4045 would abort. We mark the value as fetched anyway -- all 0 bytes of
4049 value_fetch_lazy (struct value
*val
)
4051 gdb_assert (value_lazy (val
));
4052 allocate_value_contents (val
);
4053 /* A value is either lazy, or fully fetched. The
4054 availability/validity is only established as we try to fetch a
4056 gdb_assert (val
->optimized_out
.empty ());
4057 gdb_assert (val
->unavailable
.empty ());
4062 else if (value_bitsize (val
))
4063 value_fetch_lazy_bitfield (val
);
4064 else if (VALUE_LVAL (val
) == lval_memory
)
4065 value_fetch_lazy_memory (val
);
4066 else if (VALUE_LVAL (val
) == lval_register
)
4067 value_fetch_lazy_register (val
);
4068 else if (VALUE_LVAL (val
) == lval_computed
4069 && value_computed_funcs (val
)->read
!= NULL
)
4070 value_computed_funcs (val
)->read (val
);
4072 internal_error (__FILE__
, __LINE__
, _("Unexpected lazy value type."));
4074 set_value_lazy (val
, 0);
4077 /* Implementation of the convenience function $_isvoid. */
4079 static struct value
*
4080 isvoid_internal_fn (struct gdbarch
*gdbarch
,
4081 const struct language_defn
*language
,
4082 void *cookie
, int argc
, struct value
**argv
)
4087 error (_("You must provide one argument for $_isvoid."));
4089 ret
= value_type (argv
[0])->code () == TYPE_CODE_VOID
;
4091 return value_from_longest (builtin_type (gdbarch
)->builtin_int
, ret
);
4094 /* Implementation of the convenience function $_creal. Extracts the
4095 real part from a complex number. */
4097 static struct value
*
4098 creal_internal_fn (struct gdbarch
*gdbarch
,
4099 const struct language_defn
*language
,
4100 void *cookie
, int argc
, struct value
**argv
)
4103 error (_("You must provide one argument for $_creal."));
4105 value
*cval
= argv
[0];
4106 type
*ctype
= check_typedef (value_type (cval
));
4107 if (ctype
->code () != TYPE_CODE_COMPLEX
)
4108 error (_("expected a complex number"));
4109 return value_real_part (cval
);
4112 /* Implementation of the convenience function $_cimag. Extracts the
4113 imaginary part from a complex number. */
4115 static struct value
*
4116 cimag_internal_fn (struct gdbarch
*gdbarch
,
4117 const struct language_defn
*language
,
4118 void *cookie
, int argc
,
4119 struct value
**argv
)
4122 error (_("You must provide one argument for $_cimag."));
4124 value
*cval
= argv
[0];
4125 type
*ctype
= check_typedef (value_type (cval
));
4126 if (ctype
->code () != TYPE_CODE_COMPLEX
)
4127 error (_("expected a complex number"));
4128 return value_imaginary_part (cval
);
4135 /* Test the ranges_contain function. */
4138 test_ranges_contain ()
4140 std::vector
<range
> ranges
;
4146 ranges
.push_back (r
);
4151 ranges
.push_back (r
);
4154 SELF_CHECK (!ranges_contain (ranges
, 2, 5));
4156 SELF_CHECK (ranges_contain (ranges
, 9, 5));
4158 SELF_CHECK (ranges_contain (ranges
, 10, 2));
4160 SELF_CHECK (ranges_contain (ranges
, 10, 5));
4162 SELF_CHECK (ranges_contain (ranges
, 13, 6));
4164 SELF_CHECK (ranges_contain (ranges
, 14, 5));
4166 SELF_CHECK (!ranges_contain (ranges
, 15, 4));
4168 SELF_CHECK (!ranges_contain (ranges
, 16, 4));
4170 SELF_CHECK (ranges_contain (ranges
, 16, 6));
4172 SELF_CHECK (ranges_contain (ranges
, 21, 1));
4174 SELF_CHECK (ranges_contain (ranges
, 21, 5));
4176 SELF_CHECK (!ranges_contain (ranges
, 26, 3));
4179 /* Check that RANGES contains the same ranges as EXPECTED. */
4182 check_ranges_vector (gdb::array_view
<const range
> ranges
,
4183 gdb::array_view
<const range
> expected
)
4185 return ranges
== expected
;
4188 /* Test the insert_into_bit_range_vector function. */
4191 test_insert_into_bit_range_vector ()
4193 std::vector
<range
> ranges
;
4197 insert_into_bit_range_vector (&ranges
, 10, 5);
4198 static const range expected
[] = {
4201 SELF_CHECK (check_ranges_vector (ranges
, expected
));
4206 insert_into_bit_range_vector (&ranges
, 11, 4);
4207 static const range expected
= {10, 5};
4208 SELF_CHECK (check_ranges_vector (ranges
, expected
));
4211 /* [10, 14] [20, 24] */
4213 insert_into_bit_range_vector (&ranges
, 20, 5);
4214 static const range expected
[] = {
4218 SELF_CHECK (check_ranges_vector (ranges
, expected
));
4221 /* [10, 14] [17, 24] */
4223 insert_into_bit_range_vector (&ranges
, 17, 5);
4224 static const range expected
[] = {
4228 SELF_CHECK (check_ranges_vector (ranges
, expected
));
4231 /* [2, 8] [10, 14] [17, 24] */
4233 insert_into_bit_range_vector (&ranges
, 2, 7);
4234 static const range expected
[] = {
4239 SELF_CHECK (check_ranges_vector (ranges
, expected
));
4242 /* [2, 14] [17, 24] */
4244 insert_into_bit_range_vector (&ranges
, 9, 1);
4245 static const range expected
[] = {
4249 SELF_CHECK (check_ranges_vector (ranges
, expected
));
4252 /* [2, 14] [17, 24] */
4254 insert_into_bit_range_vector (&ranges
, 9, 1);
4255 static const range expected
[] = {
4259 SELF_CHECK (check_ranges_vector (ranges
, expected
));
4264 insert_into_bit_range_vector (&ranges
, 4, 30);
4265 static const range expected
= {2, 32};
4266 SELF_CHECK (check_ranges_vector (ranges
, expected
));
4270 } /* namespace selftests */
4271 #endif /* GDB_SELF_TEST */
4273 void _initialize_values ();
4275 _initialize_values ()
4277 cmd_list_element
*show_convenience_cmd
4278 = add_cmd ("convenience", no_class
, show_convenience
, _("\
4279 Debugger convenience (\"$foo\") variables and functions.\n\
4280 Convenience variables are created when you assign them values;\n\
4281 thus, \"set $foo=1\" gives \"$foo\" the value 1. Values may be any type.\n\
4283 A few convenience variables are given values automatically:\n\
4284 \"$_\"holds the last address examined with \"x\" or \"info lines\",\n\
4285 \"$__\" holds the contents of the last address examined with \"x\"."
4288 Convenience functions are defined via the Python API."
4291 add_alias_cmd ("conv", show_convenience_cmd
, no_class
, 1, &showlist
);
4293 add_cmd ("values", no_set_class
, show_values
, _("\
4294 Elements of value history around item number IDX (or last ten)."),
4297 add_com ("init-if-undefined", class_vars
, init_if_undefined_command
, _("\
4298 Initialize a convenience variable if necessary.\n\
4299 init-if-undefined VARIABLE = EXPRESSION\n\
4300 Set an internal VARIABLE to the result of the EXPRESSION if it does not\n\
4301 exist or does not contain a value. The EXPRESSION is not evaluated if the\n\
4302 VARIABLE is already initialized."));
4304 add_prefix_cmd ("function", no_class
, function_command
, _("\
4305 Placeholder command for showing help on convenience functions."),
4306 &functionlist
, 0, &cmdlist
);
4308 add_internal_function ("_isvoid", _("\
4309 Check whether an expression is void.\n\
4310 Usage: $_isvoid (expression)\n\
4311 Return 1 if the expression is void, zero otherwise."),
4312 isvoid_internal_fn
, NULL
);
4314 add_internal_function ("_creal", _("\
4315 Extract the real part of a complex number.\n\
4316 Usage: $_creal (expression)\n\
4317 Return the real part of a complex number, the type depends on the\n\
4318 type of a complex number."),
4319 creal_internal_fn
, NULL
);
4321 add_internal_function ("_cimag", _("\
4322 Extract the imaginary part of a complex number.\n\
4323 Usage: $_cimag (expression)\n\
4324 Return the imaginary part of a complex number, the type depends on the\n\
4325 type of a complex number."),
4326 cimag_internal_fn
, NULL
);
4328 add_setshow_zuinteger_unlimited_cmd ("max-value-size",
4329 class_support
, &max_value_size
, _("\
4330 Set maximum sized value gdb will load from the inferior."), _("\
4331 Show maximum sized value gdb will load from the inferior."), _("\
4332 Use this to control the maximum size, in bytes, of a value that gdb\n\
4333 will load from the inferior. Setting this value to 'unlimited'\n\
4334 disables checking.\n\
4335 Setting this does not invalidate already allocated values, it only\n\
4336 prevents future values, larger than this size, from being allocated."),
4338 show_max_value_size
,
4339 &setlist
, &showlist
);
4340 set_show_commands vsize_limit
4341 = add_setshow_zuinteger_unlimited_cmd ("varsize-limit", class_support
,
4342 &max_value_size
, _("\
4343 Set the maximum number of bytes allowed in a variable-size object."), _("\
4344 Show the maximum number of bytes allowed in a variable-size object."), _("\
4345 Attempts to access an object whose size is not a compile-time constant\n\
4346 and exceeds this limit will cause an error."),
4347 NULL
, NULL
, &setlist
, &showlist
);
4348 deprecate_cmd (vsize_limit
.set
, "set max-value-size");
4351 selftests::register_test ("ranges_contain", selftests::test_ranges_contain
);
4352 selftests::register_test ("insert_into_bit_range_vector",
4353 selftests::test_insert_into_bit_range_vector
);
4362 all_values
.clear ();