]>
Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Low level packing and unpacking of values for GDB, the GNU Debugger. |
1bac305b | 2 | |
1d506c26 | 3 | Copyright (C) 1986-2024 Free Software Foundation, Inc. |
c906108c | 4 | |
c5aa993b | 5 | This file is part of GDB. |
c906108c | 6 | |
c5aa993b JM |
7 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 10 | (at your option) any later version. |
c906108c | 11 | |
c5aa993b JM |
12 | This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
c906108c | 16 | |
c5aa993b | 17 | You should have received a copy of the GNU General Public License |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
19 | |
20 | #include "defs.h" | |
e17c207e | 21 | #include "arch-utils.h" |
c906108c SS |
22 | #include "symtab.h" |
23 | #include "gdbtypes.h" | |
24 | #include "value.h" | |
25 | #include "gdbcore.h" | |
c906108c SS |
26 | #include "command.h" |
27 | #include "gdbcmd.h" | |
28 | #include "target.h" | |
29 | #include "language.h" | |
c906108c | 30 | #include "demangle.h" |
36160dc4 | 31 | #include "regcache.h" |
fe898f56 | 32 | #include "block.h" |
70100014 | 33 | #include "target-float.h" |
bccdca4a | 34 | #include "objfiles.h" |
79a45b7d | 35 | #include "valprint.h" |
bc3b79fd | 36 | #include "cli/cli-decode.h" |
6dddc817 | 37 | #include "extension.h" |
3bd0f5ef | 38 | #include <ctype.h> |
0914bcdb | 39 | #include "tracepoint.h" |
be335936 | 40 | #include "cp-abi.h" |
a58e2656 | 41 | #include "user-regs.h" |
325fac50 | 42 | #include <algorithm> |
b0cf0a5b | 43 | #include <iterator> |
11470e70 | 44 | #include <map> |
b0cf0a5b CDB |
45 | #include <utility> |
46 | #include <vector> | |
eb3ff9a5 | 47 | #include "completer.h" |
268a13a5 TT |
48 | #include "gdbsupport/selftest.h" |
49 | #include "gdbsupport/array-view.h" | |
7f6aba03 | 50 | #include "cli/cli-style.h" |
413403fc | 51 | #include "expop.h" |
328d42d8 | 52 | #include "inferior.h" |
bc20e562 | 53 | #include "varobj.h" |
0914bcdb | 54 | |
bc3b79fd TJB |
55 | /* Definition of a user function. */ |
56 | struct internal_function | |
57 | { | |
58 | /* The name of the function. It is a bit odd to have this in the | |
59 | function itself -- the user might use a differently-named | |
60 | convenience variable to hold the function. */ | |
61 | char *name; | |
62 | ||
63 | /* The handler. */ | |
64 | internal_function_fn handler; | |
65 | ||
66 | /* User data for the handler. */ | |
67 | void *cookie; | |
68 | }; | |
69 | ||
4e07d55f PA |
70 | /* Returns true if the ranges defined by [offset1, offset1+len1) and |
71 | [offset2, offset2+len2) overlap. */ | |
72 | ||
b59ff01d | 73 | static bool |
4f82620c MR |
74 | ranges_overlap (LONGEST offset1, ULONGEST len1, |
75 | LONGEST offset2, ULONGEST len2) | |
4e07d55f | 76 | { |
4f82620c | 77 | LONGEST h, l; |
4e07d55f | 78 | |
325fac50 PA |
79 | l = std::max (offset1, offset2); |
80 | h = std::min (offset1 + len1, offset2 + len2); | |
4e07d55f PA |
81 | return (l < h); |
82 | } | |
83 | ||
4e07d55f PA |
84 | /* Returns true if RANGES contains any range that overlaps [OFFSET, |
85 | OFFSET+LENGTH). */ | |
86 | ||
b59ff01d | 87 | static bool |
0c7e6dd8 | 88 | ranges_contain (const std::vector<range> &ranges, LONGEST offset, |
4f82620c | 89 | ULONGEST length) |
4e07d55f | 90 | { |
0c7e6dd8 | 91 | range what; |
4e07d55f PA |
92 | |
93 | what.offset = offset; | |
94 | what.length = length; | |
95 | ||
96 | /* We keep ranges sorted by offset and coalesce overlapping and | |
97 | contiguous ranges, so to check if a range list contains a given | |
98 | range, we can do a binary search for the position the given range | |
99 | would be inserted if we only considered the starting OFFSET of | |
100 | ranges. We call that position I. Since we also have LENGTH to | |
101 | care for (this is a range afterall), we need to check if the | |
102 | _previous_ range overlaps the I range. E.g., | |
103 | ||
dda83cd7 SM |
104 | R |
105 | |---| | |
4e07d55f PA |
106 | |---| |---| |------| ... |--| |
107 | 0 1 2 N | |
108 | ||
109 | I=1 | |
110 | ||
111 | In the case above, the binary search would return `I=1', meaning, | |
112 | this OFFSET should be inserted at position 1, and the current | |
113 | position 1 should be pushed further (and before 2). But, `0' | |
114 | overlaps with R. | |
115 | ||
116 | Then we need to check if the I range overlaps the I range itself. | |
117 | E.g., | |
118 | ||
dda83cd7 SM |
119 | R |
120 | |---| | |
4e07d55f PA |
121 | |---| |---| |-------| ... |--| |
122 | 0 1 2 N | |
123 | ||
124 | I=1 | |
125 | */ | |
126 | ||
4e07d55f | 127 | |
0c7e6dd8 TT |
128 | auto i = std::lower_bound (ranges.begin (), ranges.end (), what); |
129 | ||
130 | if (i > ranges.begin ()) | |
4e07d55f | 131 | { |
0c7e6dd8 | 132 | const struct range &bef = *(i - 1); |
4e07d55f | 133 | |
0c7e6dd8 | 134 | if (ranges_overlap (bef.offset, bef.length, offset, length)) |
b59ff01d | 135 | return true; |
4e07d55f PA |
136 | } |
137 | ||
0c7e6dd8 | 138 | if (i < ranges.end ()) |
4e07d55f | 139 | { |
0c7e6dd8 | 140 | const struct range &r = *i; |
4e07d55f | 141 | |
0c7e6dd8 | 142 | if (ranges_overlap (r.offset, r.length, offset, length)) |
b59ff01d | 143 | return true; |
4e07d55f PA |
144 | } |
145 | ||
b59ff01d | 146 | return false; |
4e07d55f PA |
147 | } |
148 | ||
bc3b79fd TJB |
149 | static struct cmd_list_element *functionlist; |
150 | ||
e714001c TT |
151 | value::~value () |
152 | { | |
736355f2 | 153 | if (this->lval () == lval_computed) |
e714001c TT |
154 | { |
155 | const struct lval_funcs *funcs = m_location.computed.funcs; | |
156 | ||
157 | if (funcs->free_closure) | |
158 | funcs->free_closure (this); | |
159 | } | |
736355f2 | 160 | else if (this->lval () == lval_xcallable) |
e714001c TT |
161 | delete m_location.xm_worker; |
162 | } | |
163 | ||
e512cdbd SM |
164 | /* See value.h. */ |
165 | ||
166 | struct gdbarch * | |
f9ee742c | 167 | value::arch () const |
e512cdbd | 168 | { |
f9ee742c | 169 | return type ()->arch (); |
e512cdbd SM |
170 | } |
171 | ||
b59ff01d | 172 | bool |
d00664db | 173 | value::bits_available (LONGEST offset, ULONGEST length) const |
4e07d55f | 174 | { |
d00664db | 175 | gdb_assert (!m_lazy); |
4e07d55f | 176 | |
aaab5fce MR |
177 | /* Don't pretend we have anything available there in the history beyond |
178 | the boundaries of the value recorded. It's not like inferior memory | |
179 | where there is actual stuff underneath. */ | |
d00664db TT |
180 | ULONGEST val_len = TARGET_CHAR_BIT * enclosing_type ()->length (); |
181 | return !((m_in_history | |
aaab5fce | 182 | && (offset < 0 || offset + length > val_len)) |
d00664db | 183 | || ranges_contain (m_unavailable, offset, length)); |
4e07d55f PA |
184 | } |
185 | ||
b59ff01d | 186 | bool |
d00664db | 187 | value::bytes_available (LONGEST offset, ULONGEST length) const |
bdf22206 | 188 | { |
4f82620c MR |
189 | ULONGEST sign = (1ULL << (sizeof (ULONGEST) * 8 - 1)) / TARGET_CHAR_BIT; |
190 | ULONGEST mask = (sign << 1) - 1; | |
191 | ||
192 | if (offset != ((offset & mask) ^ sign) - sign | |
193 | || length != ((length & mask) ^ sign) - sign | |
194 | || (length > 0 && (~offset & (offset + length - 1) & sign) != 0)) | |
195 | error (_("Integer overflow in data location calculation")); | |
196 | ||
d00664db | 197 | return bits_available (offset * TARGET_CHAR_BIT, length * TARGET_CHAR_BIT); |
bdf22206 AB |
198 | } |
199 | ||
b59ff01d | 200 | bool |
d00664db | 201 | value::bits_any_optimized_out (int bit_offset, int bit_length) const |
9a0dc9e3 | 202 | { |
d00664db | 203 | gdb_assert (!m_lazy); |
9a0dc9e3 | 204 | |
d00664db | 205 | return ranges_contain (m_optimized_out, bit_offset, bit_length); |
9a0dc9e3 PA |
206 | } |
207 | ||
b59ff01d | 208 | bool |
d00664db | 209 | value::entirely_available () |
ec0a52e1 PA |
210 | { |
211 | /* We can only tell whether the whole value is available when we try | |
212 | to read it. */ | |
d00664db TT |
213 | if (m_lazy) |
214 | fetch_lazy (); | |
ec0a52e1 | 215 | |
d00664db | 216 | if (m_unavailable.empty ()) |
b59ff01d TT |
217 | return true; |
218 | return false; | |
ec0a52e1 PA |
219 | } |
220 | ||
d00664db | 221 | /* See value.h. */ |
9a0dc9e3 | 222 | |
b59ff01d | 223 | bool |
d00664db | 224 | value::entirely_covered_by_range_vector (const std::vector<range> &ranges) |
6211c335 | 225 | { |
9a0dc9e3 PA |
226 | /* We can only tell whether the whole value is optimized out / |
227 | unavailable when we try to read it. */ | |
d00664db TT |
228 | if (m_lazy) |
229 | fetch_lazy (); | |
6211c335 | 230 | |
0c7e6dd8 | 231 | if (ranges.size () == 1) |
6211c335 | 232 | { |
0c7e6dd8 | 233 | const struct range &t = ranges[0]; |
6211c335 | 234 | |
0c7e6dd8 | 235 | if (t.offset == 0 |
d00664db | 236 | && t.length == TARGET_CHAR_BIT * enclosing_type ()->length ()) |
b59ff01d | 237 | return true; |
6211c335 YQ |
238 | } |
239 | ||
b59ff01d | 240 | return false; |
6211c335 YQ |
241 | } |
242 | ||
9a0dc9e3 PA |
243 | /* Insert into the vector pointed to by VECTORP the bit range starting of |
244 | OFFSET bits, and extending for the next LENGTH bits. */ | |
245 | ||
246 | static void | |
0c7e6dd8 | 247 | insert_into_bit_range_vector (std::vector<range> *vectorp, |
4f82620c | 248 | LONGEST offset, ULONGEST length) |
4e07d55f | 249 | { |
0c7e6dd8 | 250 | range newr; |
4e07d55f PA |
251 | |
252 | /* Insert the range sorted. If there's overlap or the new range | |
253 | would be contiguous with an existing range, merge. */ | |
254 | ||
255 | newr.offset = offset; | |
256 | newr.length = length; | |
257 | ||
258 | /* Do a binary search for the position the given range would be | |
259 | inserted if we only considered the starting OFFSET of ranges. | |
260 | Call that position I. Since we also have LENGTH to care for | |
261 | (this is a range afterall), we need to check if the _previous_ | |
262 | range overlaps the I range. E.g., calling R the new range: | |
263 | ||
264 | #1 - overlaps with previous | |
265 | ||
266 | R | |
267 | |-...-| | |
268 | |---| |---| |------| ... |--| | |
269 | 0 1 2 N | |
270 | ||
271 | I=1 | |
272 | ||
273 | In the case #1 above, the binary search would return `I=1', | |
274 | meaning, this OFFSET should be inserted at position 1, and the | |
275 | current position 1 should be pushed further (and become 2). But, | |
276 | note that `0' overlaps with R, so we want to merge them. | |
277 | ||
278 | A similar consideration needs to be taken if the new range would | |
279 | be contiguous with the previous range: | |
280 | ||
281 | #2 - contiguous with previous | |
282 | ||
283 | R | |
284 | |-...-| | |
285 | |--| |---| |------| ... |--| | |
286 | 0 1 2 N | |
287 | ||
288 | I=1 | |
289 | ||
290 | If there's no overlap with the previous range, as in: | |
291 | ||
292 | #3 - not overlapping and not contiguous | |
293 | ||
294 | R | |
295 | |-...-| | |
296 | |--| |---| |------| ... |--| | |
297 | 0 1 2 N | |
298 | ||
299 | I=1 | |
300 | ||
301 | or if I is 0: | |
302 | ||
303 | #4 - R is the range with lowest offset | |
304 | ||
305 | R | |
306 | |-...-| | |
dda83cd7 SM |
307 | |--| |---| |------| ... |--| |
308 | 0 1 2 N | |
4e07d55f PA |
309 | |
310 | I=0 | |
311 | ||
312 | ... we just push the new range to I. | |
313 | ||
314 | All the 4 cases above need to consider that the new range may | |
315 | also overlap several of the ranges that follow, or that R may be | |
316 | contiguous with the following range, and merge. E.g., | |
317 | ||
318 | #5 - overlapping following ranges | |
319 | ||
320 | R | |
321 | |------------------------| | |
dda83cd7 SM |
322 | |--| |---| |------| ... |--| |
323 | 0 1 2 N | |
4e07d55f PA |
324 | |
325 | I=0 | |
326 | ||
327 | or: | |
328 | ||
329 | R | |
330 | |-------| | |
331 | |--| |---| |------| ... |--| | |
332 | 0 1 2 N | |
333 | ||
334 | I=1 | |
335 | ||
336 | */ | |
337 | ||
0c7e6dd8 TT |
338 | auto i = std::lower_bound (vectorp->begin (), vectorp->end (), newr); |
339 | if (i > vectorp->begin ()) | |
4e07d55f | 340 | { |
0c7e6dd8 | 341 | struct range &bef = *(i - 1); |
4e07d55f | 342 | |
0c7e6dd8 | 343 | if (ranges_overlap (bef.offset, bef.length, offset, length)) |
4e07d55f PA |
344 | { |
345 | /* #1 */ | |
4f82620c MR |
346 | LONGEST l = std::min (bef.offset, offset); |
347 | LONGEST h = std::max (bef.offset + bef.length, offset + length); | |
4e07d55f | 348 | |
0c7e6dd8 TT |
349 | bef.offset = l; |
350 | bef.length = h - l; | |
4e07d55f PA |
351 | i--; |
352 | } | |
0c7e6dd8 | 353 | else if (offset == bef.offset + bef.length) |
4e07d55f PA |
354 | { |
355 | /* #2 */ | |
0c7e6dd8 | 356 | bef.length += length; |
4e07d55f PA |
357 | i--; |
358 | } | |
359 | else | |
360 | { | |
361 | /* #3 */ | |
0c7e6dd8 | 362 | i = vectorp->insert (i, newr); |
4e07d55f PA |
363 | } |
364 | } | |
365 | else | |
366 | { | |
367 | /* #4 */ | |
0c7e6dd8 | 368 | i = vectorp->insert (i, newr); |
4e07d55f PA |
369 | } |
370 | ||
371 | /* Check whether the ranges following the one we've just added or | |
372 | touched can be folded in (#5 above). */ | |
0c7e6dd8 | 373 | if (i != vectorp->end () && i + 1 < vectorp->end ()) |
4e07d55f | 374 | { |
4e07d55f | 375 | int removed = 0; |
0c7e6dd8 | 376 | auto next = i + 1; |
4e07d55f PA |
377 | |
378 | /* Get the range we just touched. */ | |
0c7e6dd8 | 379 | struct range &t = *i; |
4e07d55f PA |
380 | removed = 0; |
381 | ||
382 | i = next; | |
0c7e6dd8 TT |
383 | for (; i < vectorp->end (); i++) |
384 | { | |
385 | struct range &r = *i; | |
386 | if (r.offset <= t.offset + t.length) | |
387 | { | |
4f82620c | 388 | LONGEST l, h; |
0c7e6dd8 TT |
389 | |
390 | l = std::min (t.offset, r.offset); | |
391 | h = std::max (t.offset + t.length, r.offset + r.length); | |
392 | ||
393 | t.offset = l; | |
394 | t.length = h - l; | |
395 | ||
396 | removed++; | |
397 | } | |
398 | else | |
399 | { | |
400 | /* If we couldn't merge this one, we won't be able to | |
401 | merge following ones either, since the ranges are | |
402 | always sorted by OFFSET. */ | |
403 | break; | |
404 | } | |
405 | } | |
4e07d55f PA |
406 | |
407 | if (removed != 0) | |
0c7e6dd8 | 408 | vectorp->erase (next, next + removed); |
4e07d55f PA |
409 | } |
410 | } | |
411 | ||
9a0dc9e3 | 412 | void |
d00664db | 413 | value::mark_bits_unavailable (LONGEST offset, ULONGEST length) |
9a0dc9e3 | 414 | { |
d00664db | 415 | insert_into_bit_range_vector (&m_unavailable, offset, length); |
9a0dc9e3 PA |
416 | } |
417 | ||
bdf22206 | 418 | void |
d00664db | 419 | value::mark_bytes_unavailable (LONGEST offset, ULONGEST length) |
bdf22206 | 420 | { |
d00664db TT |
421 | mark_bits_unavailable (offset * TARGET_CHAR_BIT, |
422 | length * TARGET_CHAR_BIT); | |
bdf22206 AB |
423 | } |
424 | ||
c8c1c22f PA |
425 | /* Find the first range in RANGES that overlaps the range defined by |
426 | OFFSET and LENGTH, starting at element POS in the RANGES vector, | |
427 | Returns the index into RANGES where such overlapping range was | |
428 | found, or -1 if none was found. */ | |
429 | ||
430 | static int | |
0c7e6dd8 | 431 | find_first_range_overlap (const std::vector<range> *ranges, int pos, |
6b850546 | 432 | LONGEST offset, LONGEST length) |
c8c1c22f | 433 | { |
c8c1c22f PA |
434 | int i; |
435 | ||
0c7e6dd8 TT |
436 | for (i = pos; i < ranges->size (); i++) |
437 | { | |
438 | const range &r = (*ranges)[i]; | |
439 | if (ranges_overlap (r.offset, r.length, offset, length)) | |
440 | return i; | |
441 | } | |
c8c1c22f PA |
442 | |
443 | return -1; | |
444 | } | |
445 | ||
bdf22206 AB |
446 | /* Compare LENGTH_BITS of memory at PTR1 + OFFSET1_BITS with the memory at |
447 | PTR2 + OFFSET2_BITS. Return 0 if the memory is the same, otherwise | |
448 | return non-zero. | |
449 | ||
450 | It must always be the case that: | |
451 | OFFSET1_BITS % TARGET_CHAR_BIT == OFFSET2_BITS % TARGET_CHAR_BIT | |
452 | ||
453 | It is assumed that memory can be accessed from: | |
454 | PTR + (OFFSET_BITS / TARGET_CHAR_BIT) | |
455 | to: | |
456 | PTR + ((OFFSET_BITS + LENGTH_BITS + TARGET_CHAR_BIT - 1) | |
dda83cd7 | 457 | / TARGET_CHAR_BIT) */ |
bdf22206 AB |
458 | static int |
459 | memcmp_with_bit_offsets (const gdb_byte *ptr1, size_t offset1_bits, | |
460 | const gdb_byte *ptr2, size_t offset2_bits, | |
461 | size_t length_bits) | |
462 | { | |
463 | gdb_assert (offset1_bits % TARGET_CHAR_BIT | |
464 | == offset2_bits % TARGET_CHAR_BIT); | |
465 | ||
466 | if (offset1_bits % TARGET_CHAR_BIT != 0) | |
467 | { | |
468 | size_t bits; | |
469 | gdb_byte mask, b1, b2; | |
470 | ||
471 | /* The offset from the base pointers PTR1 and PTR2 is not a complete | |
472 | number of bytes. A number of bits up to either the next exact | |
473 | byte boundary, or LENGTH_BITS (which ever is sooner) will be | |
474 | compared. */ | |
475 | bits = TARGET_CHAR_BIT - offset1_bits % TARGET_CHAR_BIT; | |
476 | gdb_assert (bits < sizeof (mask) * TARGET_CHAR_BIT); | |
477 | mask = (1 << bits) - 1; | |
478 | ||
479 | if (length_bits < bits) | |
480 | { | |
481 | mask &= ~(gdb_byte) ((1 << (bits - length_bits)) - 1); | |
482 | bits = length_bits; | |
483 | } | |
484 | ||
485 | /* Now load the two bytes and mask off the bits we care about. */ | |
486 | b1 = *(ptr1 + offset1_bits / TARGET_CHAR_BIT) & mask; | |
487 | b2 = *(ptr2 + offset2_bits / TARGET_CHAR_BIT) & mask; | |
488 | ||
489 | if (b1 != b2) | |
490 | return 1; | |
491 | ||
492 | /* Now update the length and offsets to take account of the bits | |
493 | we've just compared. */ | |
494 | length_bits -= bits; | |
495 | offset1_bits += bits; | |
496 | offset2_bits += bits; | |
497 | } | |
498 | ||
499 | if (length_bits % TARGET_CHAR_BIT != 0) | |
500 | { | |
501 | size_t bits; | |
502 | size_t o1, o2; | |
503 | gdb_byte mask, b1, b2; | |
504 | ||
505 | /* The length is not an exact number of bytes. After the previous | |
506 | IF.. block then the offsets are byte aligned, or the | |
507 | length is zero (in which case this code is not reached). Compare | |
508 | a number of bits at the end of the region, starting from an exact | |
509 | byte boundary. */ | |
510 | bits = length_bits % TARGET_CHAR_BIT; | |
511 | o1 = offset1_bits + length_bits - bits; | |
512 | o2 = offset2_bits + length_bits - bits; | |
513 | ||
514 | gdb_assert (bits < sizeof (mask) * TARGET_CHAR_BIT); | |
515 | mask = ((1 << bits) - 1) << (TARGET_CHAR_BIT - bits); | |
516 | ||
517 | gdb_assert (o1 % TARGET_CHAR_BIT == 0); | |
518 | gdb_assert (o2 % TARGET_CHAR_BIT == 0); | |
519 | ||
520 | b1 = *(ptr1 + o1 / TARGET_CHAR_BIT) & mask; | |
521 | b2 = *(ptr2 + o2 / TARGET_CHAR_BIT) & mask; | |
522 | ||
523 | if (b1 != b2) | |
524 | return 1; | |
525 | ||
526 | length_bits -= bits; | |
527 | } | |
528 | ||
529 | if (length_bits > 0) | |
530 | { | |
531 | /* We've now taken care of any stray "bits" at the start, or end of | |
532 | the region to compare, the remainder can be covered with a simple | |
533 | memcmp. */ | |
534 | gdb_assert (offset1_bits % TARGET_CHAR_BIT == 0); | |
535 | gdb_assert (offset2_bits % TARGET_CHAR_BIT == 0); | |
536 | gdb_assert (length_bits % TARGET_CHAR_BIT == 0); | |
537 | ||
538 | return memcmp (ptr1 + offset1_bits / TARGET_CHAR_BIT, | |
539 | ptr2 + offset2_bits / TARGET_CHAR_BIT, | |
540 | length_bits / TARGET_CHAR_BIT); | |
541 | } | |
542 | ||
543 | /* Length is zero, regions match. */ | |
544 | return 0; | |
545 | } | |
546 | ||
9a0dc9e3 PA |
547 | /* Helper struct for find_first_range_overlap_and_match and |
548 | value_contents_bits_eq. Keep track of which slot of a given ranges | |
549 | vector have we last looked at. */ | |
bdf22206 | 550 | |
9a0dc9e3 PA |
551 | struct ranges_and_idx |
552 | { | |
553 | /* The ranges. */ | |
0c7e6dd8 | 554 | const std::vector<range> *ranges; |
9a0dc9e3 PA |
555 | |
556 | /* The range we've last found in RANGES. Given ranges are sorted, | |
557 | we can start the next lookup here. */ | |
558 | int idx; | |
559 | }; | |
560 | ||
561 | /* Helper function for value_contents_bits_eq. Compare LENGTH bits of | |
562 | RP1's ranges starting at OFFSET1 bits with LENGTH bits of RP2's | |
563 | ranges starting at OFFSET2 bits. Return true if the ranges match | |
564 | and fill in *L and *H with the overlapping window relative to | |
565 | (both) OFFSET1 or OFFSET2. */ | |
bdf22206 AB |
566 | |
567 | static int | |
9a0dc9e3 PA |
568 | find_first_range_overlap_and_match (struct ranges_and_idx *rp1, |
569 | struct ranges_and_idx *rp2, | |
6b850546 | 570 | LONGEST offset1, LONGEST offset2, |
4f82620c | 571 | ULONGEST length, ULONGEST *l, ULONGEST *h) |
c8c1c22f | 572 | { |
9a0dc9e3 PA |
573 | rp1->idx = find_first_range_overlap (rp1->ranges, rp1->idx, |
574 | offset1, length); | |
575 | rp2->idx = find_first_range_overlap (rp2->ranges, rp2->idx, | |
576 | offset2, length); | |
c8c1c22f | 577 | |
9a0dc9e3 PA |
578 | if (rp1->idx == -1 && rp2->idx == -1) |
579 | { | |
580 | *l = length; | |
581 | *h = length; | |
582 | return 1; | |
583 | } | |
584 | else if (rp1->idx == -1 || rp2->idx == -1) | |
585 | return 0; | |
586 | else | |
c8c1c22f | 587 | { |
0c7e6dd8 | 588 | const range *r1, *r2; |
c8c1c22f PA |
589 | ULONGEST l1, h1; |
590 | ULONGEST l2, h2; | |
591 | ||
0c7e6dd8 TT |
592 | r1 = &(*rp1->ranges)[rp1->idx]; |
593 | r2 = &(*rp2->ranges)[rp2->idx]; | |
c8c1c22f PA |
594 | |
595 | /* Get the unavailable windows intersected by the incoming | |
596 | ranges. The first and last ranges that overlap the argument | |
597 | range may be wider than said incoming arguments ranges. */ | |
325fac50 PA |
598 | l1 = std::max (offset1, r1->offset); |
599 | h1 = std::min (offset1 + length, r1->offset + r1->length); | |
c8c1c22f | 600 | |
325fac50 PA |
601 | l2 = std::max (offset2, r2->offset); |
602 | h2 = std::min (offset2 + length, offset2 + r2->length); | |
c8c1c22f PA |
603 | |
604 | /* Make them relative to the respective start offsets, so we can | |
605 | compare them for equality. */ | |
606 | l1 -= offset1; | |
607 | h1 -= offset1; | |
608 | ||
609 | l2 -= offset2; | |
610 | h2 -= offset2; | |
611 | ||
9a0dc9e3 | 612 | /* Different ranges, no match. */ |
c8c1c22f PA |
613 | if (l1 != l2 || h1 != h2) |
614 | return 0; | |
615 | ||
9a0dc9e3 PA |
616 | *h = h1; |
617 | *l = l1; | |
618 | return 1; | |
619 | } | |
620 | } | |
621 | ||
622 | /* Helper function for value_contents_eq. The only difference is that | |
623 | this function is bit rather than byte based. | |
624 | ||
625 | Compare LENGTH bits of VAL1's contents starting at OFFSET1 bits | |
626 | with LENGTH bits of VAL2's contents starting at OFFSET2 bits. | |
627 | Return true if the available bits match. */ | |
628 | ||
02744ba9 TT |
629 | bool |
630 | value::contents_bits_eq (int offset1, const struct value *val2, int offset2, | |
631 | int length) const | |
9a0dc9e3 PA |
632 | { |
633 | /* Each array element corresponds to a ranges source (unavailable, | |
634 | optimized out). '1' is for VAL1, '2' for VAL2. */ | |
635 | struct ranges_and_idx rp1[2], rp2[2]; | |
636 | ||
637 | /* See function description in value.h. */ | |
02744ba9 | 638 | gdb_assert (!m_lazy && !val2->m_lazy); |
9a0dc9e3 PA |
639 | |
640 | /* We shouldn't be trying to compare past the end of the values. */ | |
641 | gdb_assert (offset1 + length | |
02744ba9 | 642 | <= m_enclosing_type->length () * TARGET_CHAR_BIT); |
9a0dc9e3 | 643 | gdb_assert (offset2 + length |
382d927f | 644 | <= val2->m_enclosing_type->length () * TARGET_CHAR_BIT); |
9a0dc9e3 PA |
645 | |
646 | memset (&rp1, 0, sizeof (rp1)); | |
647 | memset (&rp2, 0, sizeof (rp2)); | |
02744ba9 | 648 | rp1[0].ranges = &m_unavailable; |
382d927f | 649 | rp2[0].ranges = &val2->m_unavailable; |
02744ba9 | 650 | rp1[1].ranges = &m_optimized_out; |
382d927f | 651 | rp2[1].ranges = &val2->m_optimized_out; |
9a0dc9e3 PA |
652 | |
653 | while (length > 0) | |
654 | { | |
000339af | 655 | ULONGEST l = 0, h = 0; /* init for gcc -Wall */ |
9a0dc9e3 PA |
656 | int i; |
657 | ||
658 | for (i = 0; i < 2; i++) | |
659 | { | |
660 | ULONGEST l_tmp, h_tmp; | |
661 | ||
662 | /* The contents only match equal if the invalid/unavailable | |
663 | contents ranges match as well. */ | |
664 | if (!find_first_range_overlap_and_match (&rp1[i], &rp2[i], | |
665 | offset1, offset2, length, | |
666 | &l_tmp, &h_tmp)) | |
98ead37e | 667 | return false; |
9a0dc9e3 PA |
668 | |
669 | /* We're interested in the lowest/first range found. */ | |
670 | if (i == 0 || l_tmp < l) | |
671 | { | |
672 | l = l_tmp; | |
673 | h = h_tmp; | |
674 | } | |
675 | } | |
676 | ||
677 | /* Compare the available/valid contents. */ | |
02744ba9 | 678 | if (memcmp_with_bit_offsets (m_contents.get (), offset1, |
382d927f | 679 | val2->m_contents.get (), offset2, l) != 0) |
98ead37e | 680 | return false; |
c8c1c22f | 681 | |
9a0dc9e3 PA |
682 | length -= h; |
683 | offset1 += h; | |
684 | offset2 += h; | |
c8c1c22f PA |
685 | } |
686 | ||
98ead37e | 687 | return true; |
c8c1c22f PA |
688 | } |
689 | ||
02744ba9 TT |
690 | /* See value.h. */ |
691 | ||
98ead37e | 692 | bool |
02744ba9 TT |
693 | value::contents_eq (LONGEST offset1, |
694 | const struct value *val2, LONGEST offset2, | |
695 | LONGEST length) const | |
bdf22206 | 696 | { |
02744ba9 TT |
697 | return contents_bits_eq (offset1 * TARGET_CHAR_BIT, |
698 | val2, offset2 * TARGET_CHAR_BIT, | |
699 | length * TARGET_CHAR_BIT); | |
bdf22206 AB |
700 | } |
701 | ||
e379f652 TT |
702 | /* See value.h. */ |
703 | ||
704 | bool | |
02744ba9 | 705 | value::contents_eq (const struct value *val2) const |
e379f652 | 706 | { |
02744ba9 | 707 | ULONGEST len1 = check_typedef (enclosing_type ())->length (); |
463b870d | 708 | ULONGEST len2 = check_typedef (val2->enclosing_type ())->length (); |
e379f652 TT |
709 | if (len1 != len2) |
710 | return false; | |
02744ba9 | 711 | return contents_eq (0, val2, 0, len1); |
e379f652 | 712 | } |
c906108c | 713 | |
4d0266a0 TT |
714 | /* The value-history records all the values printed by print commands |
715 | during this session. */ | |
c906108c | 716 | |
4d0266a0 | 717 | static std::vector<value_ref_ptr> value_history; |
bc3b79fd | 718 | |
c906108c SS |
719 | \f |
720 | /* List of all value objects currently allocated | |
721 | (except for those released by calls to release_value) | |
722 | This is so they can be freed after each command. */ | |
723 | ||
062d818d | 724 | static std::vector<value_ref_ptr> all_values; |
c906108c | 725 | |
cbe793af | 726 | /* See value.h. */ |
c906108c | 727 | |
f23631e4 | 728 | struct value * |
cbe793af | 729 | value::allocate_lazy (struct type *type) |
c906108c | 730 | { |
f23631e4 | 731 | struct value *val; |
c54eabfa JK |
732 | |
733 | /* Call check_typedef on our type to make sure that, if TYPE | |
734 | is a TYPE_CODE_TYPEDEF, its length is set to the length | |
735 | of the target type instead of zero. However, we do not | |
736 | replace the typedef type by the target type, because we want | |
737 | to keep the typedef in order to be able to set the VAL's type | |
738 | description correctly. */ | |
739 | check_typedef (type); | |
c906108c | 740 | |
466ce3ae | 741 | val = new struct value (type); |
828d3400 DJ |
742 | |
743 | /* Values start out on the all_values chain. */ | |
062d818d | 744 | all_values.emplace_back (val); |
828d3400 | 745 | |
c906108c SS |
746 | return val; |
747 | } | |
748 | ||
5fdf6324 AB |
749 | /* The maximum size, in bytes, that GDB will try to allocate for a value. |
750 | The initial value of 64k was not selected for any specific reason, it is | |
751 | just a reasonable starting point. */ | |
752 | ||
753 | static int max_value_size = 65536; /* 64k bytes */ | |
754 | ||
755 | /* It is critical that the MAX_VALUE_SIZE is at least as big as the size of | |
756 | LONGEST, otherwise GDB will not be able to parse integer values from the | |
757 | CLI; for example if the MAX_VALUE_SIZE could be set to 1 then GDB would | |
758 | be unable to parse "set max-value-size 2". | |
759 | ||
760 | As we want a consistent GDB experience across hosts with different sizes | |
761 | of LONGEST, this arbitrary minimum value was selected, so long as this | |
762 | is bigger than LONGEST on all GDB supported hosts we're fine. */ | |
763 | ||
764 | #define MIN_VALUE_FOR_MAX_VALUE_SIZE 16 | |
69f6730d | 765 | static_assert (sizeof (LONGEST) <= MIN_VALUE_FOR_MAX_VALUE_SIZE); |
5fdf6324 AB |
766 | |
767 | /* Implement the "set max-value-size" command. */ | |
768 | ||
769 | static void | |
eb4c3f4a | 770 | set_max_value_size (const char *args, int from_tty, |
5fdf6324 AB |
771 | struct cmd_list_element *c) |
772 | { | |
773 | gdb_assert (max_value_size == -1 || max_value_size >= 0); | |
774 | ||
775 | if (max_value_size > -1 && max_value_size < MIN_VALUE_FOR_MAX_VALUE_SIZE) | |
776 | { | |
777 | max_value_size = MIN_VALUE_FOR_MAX_VALUE_SIZE; | |
778 | error (_("max-value-size set too low, increasing to %d bytes"), | |
779 | max_value_size); | |
780 | } | |
781 | } | |
782 | ||
783 | /* Implement the "show max-value-size" command. */ | |
784 | ||
785 | static void | |
786 | show_max_value_size (struct ui_file *file, int from_tty, | |
787 | struct cmd_list_element *c, const char *value) | |
788 | { | |
789 | if (max_value_size == -1) | |
6cb06a8c | 790 | gdb_printf (file, _("Maximum value size is unlimited.\n")); |
5fdf6324 | 791 | else |
6cb06a8c TT |
792 | gdb_printf (file, _("Maximum value size is %d bytes.\n"), |
793 | max_value_size); | |
5fdf6324 AB |
794 | } |
795 | ||
796 | /* Called before we attempt to allocate or reallocate a buffer for the | |
797 | contents of a value. TYPE is the type of the value for which we are | |
798 | allocating the buffer. If the buffer is too large (based on the user | |
799 | controllable setting) then throw an error. If this function returns | |
800 | then we should attempt to allocate the buffer. */ | |
801 | ||
802 | static void | |
803 | check_type_length_before_alloc (const struct type *type) | |
804 | { | |
df86565b | 805 | ULONGEST length = type->length (); |
5fdf6324 | 806 | |
13f5f57e | 807 | if (exceeds_max_value_size (length)) |
5fdf6324 | 808 | { |
7d93a1e0 | 809 | if (type->name () != NULL) |
6d8a0a5e LM |
810 | error (_("value of type `%s' requires %s bytes, which is more " |
811 | "than max-value-size"), type->name (), pulongest (length)); | |
5fdf6324 | 812 | else |
6d8a0a5e LM |
813 | error (_("value requires %s bytes, which is more than " |
814 | "max-value-size"), pulongest (length)); | |
5fdf6324 AB |
815 | } |
816 | } | |
817 | ||
13f5f57e AB |
818 | /* See value.h. */ |
819 | ||
820 | bool | |
821 | exceeds_max_value_size (ULONGEST length) | |
822 | { | |
823 | return max_value_size > -1 && length > max_value_size; | |
824 | } | |
825 | ||
a0c07915 AB |
826 | /* When this has a value, it is used to limit the number of array elements |
827 | of an array that are loaded into memory when an array value is made | |
828 | non-lazy. */ | |
6b09f134 | 829 | static std::optional<int> array_length_limiting_element_count; |
a0c07915 AB |
830 | |
831 | /* See value.h. */ | |
832 | scoped_array_length_limiting::scoped_array_length_limiting (int elements) | |
833 | { | |
834 | m_old_value = array_length_limiting_element_count; | |
835 | array_length_limiting_element_count.emplace (elements); | |
836 | } | |
837 | ||
838 | /* See value.h. */ | |
839 | scoped_array_length_limiting::~scoped_array_length_limiting () | |
840 | { | |
841 | array_length_limiting_element_count = m_old_value; | |
842 | } | |
843 | ||
844 | /* Find the inner element type for ARRAY_TYPE. */ | |
845 | ||
846 | static struct type * | |
847 | find_array_element_type (struct type *array_type) | |
848 | { | |
849 | array_type = check_typedef (array_type); | |
850 | gdb_assert (array_type->code () == TYPE_CODE_ARRAY); | |
851 | ||
852 | if (current_language->la_language == language_fortran) | |
853 | while (array_type->code () == TYPE_CODE_ARRAY) | |
854 | { | |
855 | array_type = array_type->target_type (); | |
856 | array_type = check_typedef (array_type); | |
857 | } | |
858 | else | |
859 | { | |
860 | array_type = array_type->target_type (); | |
861 | array_type = check_typedef (array_type); | |
862 | } | |
863 | ||
864 | return array_type; | |
865 | } | |
866 | ||
867 | /* Return the limited length of ARRAY_TYPE, which must be of | |
868 | TYPE_CODE_ARRAY. This function can only be called when the global | |
869 | ARRAY_LENGTH_LIMITING_ELEMENT_COUNT has a value. | |
870 | ||
871 | The limited length of an array is the smallest of either (1) the total | |
872 | size of the array type, or (2) the array target type multiplies by the | |
873 | array_length_limiting_element_count. */ | |
874 | ||
875 | static ULONGEST | |
876 | calculate_limited_array_length (struct type *array_type) | |
877 | { | |
878 | gdb_assert (array_length_limiting_element_count.has_value ()); | |
879 | ||
880 | array_type = check_typedef (array_type); | |
881 | gdb_assert (array_type->code () == TYPE_CODE_ARRAY); | |
882 | ||
883 | struct type *elm_type = find_array_element_type (array_type); | |
884 | ULONGEST len = (elm_type->length () | |
885 | * (*array_length_limiting_element_count)); | |
886 | len = std::min (len, array_type->length ()); | |
887 | ||
888 | return len; | |
889 | } | |
890 | ||
82ca8f72 | 891 | /* See value.h. */ |
a0c07915 | 892 | |
82ca8f72 TT |
893 | bool |
894 | value::set_limited_array_length () | |
a0c07915 | 895 | { |
82ca8f72 TT |
896 | ULONGEST limit = m_limited_length; |
897 | ULONGEST len = type ()->length (); | |
a0c07915 AB |
898 | |
899 | if (array_length_limiting_element_count.has_value ()) | |
82ca8f72 | 900 | len = calculate_limited_array_length (type ()); |
a0c07915 AB |
901 | |
902 | if (limit != 0 && len > limit) | |
903 | len = limit; | |
904 | if (len > max_value_size) | |
905 | return false; | |
906 | ||
82ca8f72 | 907 | m_limited_length = max_value_size; |
a0c07915 AB |
908 | return true; |
909 | } | |
910 | ||
82ca8f72 | 911 | /* See value.h. */ |
3e3d7139 | 912 | |
82ca8f72 TT |
913 | void |
914 | value::allocate_contents (bool check_size) | |
3e3d7139 | 915 | { |
82ca8f72 | 916 | if (!m_contents) |
5fdf6324 | 917 | { |
82ca8f72 TT |
918 | struct type *enc_type = enclosing_type (); |
919 | ULONGEST len = enc_type->length (); | |
a0c07915 | 920 | |
bae19789 | 921 | if (check_size) |
a0c07915 AB |
922 | { |
923 | /* If we are allocating the contents of an array, which | |
924 | is greater in size than max_value_size, and there is | |
925 | an element limit in effect, then we can possibly try | |
926 | to load only a sub-set of the array contents into | |
927 | GDB's memory. */ | |
82ca8f72 TT |
928 | if (type () == enc_type |
929 | && type ()->code () == TYPE_CODE_ARRAY | |
a0c07915 | 930 | && len > max_value_size |
82ca8f72 TT |
931 | && set_limited_array_length ()) |
932 | len = m_limited_length; | |
a0c07915 | 933 | else |
82ca8f72 | 934 | check_type_length_before_alloc (enc_type); |
a0c07915 AB |
935 | } |
936 | ||
82ca8f72 | 937 | m_contents.reset ((gdb_byte *) xzalloc (len)); |
5fdf6324 | 938 | } |
3e3d7139 JG |
939 | } |
940 | ||
bae19789 MR |
941 | /* Allocate a value and its contents for type TYPE. If CHECK_SIZE is true, |
942 | then apply the usual max-value-size checks. */ | |
3e3d7139 | 943 | |
317c3ed9 TT |
944 | struct value * |
945 | value::allocate (struct type *type, bool check_size) | |
3e3d7139 | 946 | { |
cbe793af | 947 | struct value *val = value::allocate_lazy (type); |
a109c7c1 | 948 | |
82ca8f72 | 949 | val->allocate_contents (check_size); |
a5b210cb | 950 | val->m_lazy = false; |
3e3d7139 JG |
951 | return val; |
952 | } | |
953 | ||
bae19789 MR |
954 | /* Allocate a value and its contents for type TYPE. */ |
955 | ||
956 | struct value * | |
317c3ed9 | 957 | value::allocate (struct type *type) |
bae19789 | 958 | { |
317c3ed9 | 959 | return allocate (type, true); |
bae19789 MR |
960 | } |
961 | ||
6831f2cd SM |
962 | /* See value.h */ |
963 | ||
8ada4c64 SM |
964 | value * |
965 | value::allocate_register_lazy (frame_info_ptr next_frame, int regnum, | |
966 | struct type *type) | |
6831f2cd | 967 | { |
8ada4c64 SM |
968 | if (type == nullptr) |
969 | type = register_type (frame_unwind_arch (next_frame), regnum); | |
970 | ||
971 | value *result = value::allocate_lazy (type); | |
6831f2cd SM |
972 | |
973 | result->set_lval (lval_register); | |
78f2fd84 | 974 | result->m_location.reg.regnum = regnum; |
32a5d479 SM |
975 | |
976 | /* If this register value is created during unwind (while computing a frame | |
977 | id), and NEXT_FRAME is a frame inlined in the frame being unwound, then | |
978 | NEXT_FRAME will not have a valid frame id yet. Find the next non-inline | |
979 | frame (possibly the sentinel frame). This is where registers are unwound | |
980 | from anyway. */ | |
981 | while (get_frame_type (next_frame) == INLINE_FRAME) | |
982 | next_frame = get_next_frame_sentinel_okay (next_frame); | |
983 | ||
8b31004b | 984 | result->m_location.reg.next_frame_id = get_frame_id (next_frame); |
6831f2cd | 985 | |
32a5d479 SM |
986 | /* We should have a next frame with a valid id. */ |
987 | gdb_assert (frame_id_p (result->m_location.reg.next_frame_id)); | |
988 | ||
6831f2cd SM |
989 | return result; |
990 | } | |
991 | ||
8ada4c64 SM |
992 | /* See value.h */ |
993 | ||
994 | value * | |
995 | value::allocate_register (frame_info_ptr next_frame, int regnum, | |
996 | struct type *type) | |
997 | { | |
998 | value *result = value::allocate_register_lazy (next_frame, regnum, type); | |
999 | result->set_lazy (false); | |
1000 | return result; | |
1001 | } | |
1002 | ||
c906108c | 1003 | /* Allocate a value that has the correct length |
938f5214 | 1004 | for COUNT repetitions of type TYPE. */ |
c906108c | 1005 | |
f23631e4 | 1006 | struct value * |
fba45db2 | 1007 | allocate_repeat_value (struct type *type, int count) |
c906108c | 1008 | { |
22c12a6c AB |
1009 | /* Despite the fact that we are really creating an array of TYPE here, we |
1010 | use the string lower bound as the array lower bound. This seems to | |
1011 | work fine for now. */ | |
1012 | int low_bound = current_language->string_lower_bound (); | |
c906108c SS |
1013 | /* FIXME-type-allocation: need a way to free this type when we are |
1014 | done with it. */ | |
e3506a9f UW |
1015 | struct type *array_type |
1016 | = lookup_array_range_type (type, low_bound, count + low_bound - 1); | |
a109c7c1 | 1017 | |
317c3ed9 | 1018 | return value::allocate (array_type); |
c906108c SS |
1019 | } |
1020 | ||
5f5233d4 | 1021 | struct value * |
b64e2602 TT |
1022 | value::allocate_computed (struct type *type, |
1023 | const struct lval_funcs *funcs, | |
1024 | void *closure) | |
5f5233d4 | 1025 | { |
cbe793af | 1026 | struct value *v = value::allocate_lazy (type); |
a109c7c1 | 1027 | |
6f9c9d71 | 1028 | v->set_lval (lval_computed); |
382d927f TT |
1029 | v->m_location.computed.funcs = funcs; |
1030 | v->m_location.computed.closure = closure; | |
5f5233d4 PA |
1031 | |
1032 | return v; | |
1033 | } | |
1034 | ||
b27556e3 | 1035 | /* See value.h. */ |
a7035dbb JK |
1036 | |
1037 | struct value * | |
b27556e3 | 1038 | value::allocate_optimized_out (struct type *type) |
a7035dbb | 1039 | { |
cbe793af | 1040 | struct value *retval = value::allocate_lazy (type); |
a7035dbb | 1041 | |
d00664db | 1042 | retval->mark_bytes_optimized_out (0, type->length ()); |
a5b210cb | 1043 | retval->set_lazy (false); |
a7035dbb JK |
1044 | return retval; |
1045 | } | |
1046 | ||
df407dfe AC |
1047 | /* Accessor methods. */ |
1048 | ||
50888e42 | 1049 | gdb::array_view<gdb_byte> |
bbe912ba | 1050 | value::contents_raw () |
990a07ab | 1051 | { |
bbe912ba | 1052 | int unit_size = gdbarch_addressable_memory_unit_size (arch ()); |
3ae385af | 1053 | |
82ca8f72 | 1054 | allocate_contents (true); |
50888e42 | 1055 | |
bbe912ba | 1056 | ULONGEST length = type ()->length (); |
5612b5d2 | 1057 | return gdb::make_array_view |
bbe912ba | 1058 | (m_contents.get () + m_embedded_offset * unit_size, length); |
990a07ab AC |
1059 | } |
1060 | ||
50888e42 | 1061 | gdb::array_view<gdb_byte> |
bbe912ba | 1062 | value::contents_all_raw () |
990a07ab | 1063 | { |
82ca8f72 | 1064 | allocate_contents (true); |
50888e42 | 1065 | |
bbe912ba TT |
1066 | ULONGEST length = enclosing_type ()->length (); |
1067 | return gdb::make_array_view (m_contents.get (), length); | |
990a07ab AC |
1068 | } |
1069 | ||
8264ba82 AG |
1070 | /* Look at value.h for description. */ |
1071 | ||
1072 | struct type * | |
1073 | value_actual_type (struct value *value, int resolve_simple_types, | |
1074 | int *real_type_found) | |
1075 | { | |
1076 | struct value_print_options opts; | |
8264ba82 AG |
1077 | struct type *result; |
1078 | ||
1079 | get_user_print_options (&opts); | |
1080 | ||
1081 | if (real_type_found) | |
1082 | *real_type_found = 0; | |
d0c97917 | 1083 | result = value->type (); |
8264ba82 AG |
1084 | if (opts.objectprint) |
1085 | { | |
5e34c6c3 LM |
1086 | /* If result's target type is TYPE_CODE_STRUCT, proceed to |
1087 | fetch its rtti type. */ | |
809f3be1 | 1088 | if (result->is_pointer_or_reference () |
27710edb | 1089 | && (check_typedef (result->target_type ())->code () |
78134374 | 1090 | == TYPE_CODE_STRUCT) |
d00664db | 1091 | && !value->optimized_out ()) |
dda83cd7 SM |
1092 | { |
1093 | struct type *real_type; | |
1094 | ||
1095 | real_type = value_rtti_indirect_type (value, NULL, NULL, NULL); | |
1096 | if (real_type) | |
1097 | { | |
1098 | if (real_type_found) | |
1099 | *real_type_found = 1; | |
1100 | result = real_type; | |
1101 | } | |
1102 | } | |
8264ba82 | 1103 | else if (resolve_simple_types) |
dda83cd7 SM |
1104 | { |
1105 | if (real_type_found) | |
1106 | *real_type_found = 1; | |
463b870d | 1107 | result = value->enclosing_type (); |
dda83cd7 | 1108 | } |
8264ba82 AG |
1109 | } |
1110 | ||
1111 | return result; | |
1112 | } | |
1113 | ||
901461f8 PA |
1114 | void |
1115 | error_value_optimized_out (void) | |
1116 | { | |
a6e7fea1 | 1117 | throw_error (OPTIMIZED_OUT_ERROR, _("value has been optimized out")); |
901461f8 PA |
1118 | } |
1119 | ||
efaf1ae0 TT |
1120 | void |
1121 | value::require_not_optimized_out () const | |
0e03807e | 1122 | { |
efaf1ae0 | 1123 | if (!m_optimized_out.empty ()) |
901461f8 | 1124 | { |
efaf1ae0 | 1125 | if (m_lval == lval_register) |
a6e7fea1 AB |
1126 | throw_error (OPTIMIZED_OUT_ERROR, |
1127 | _("register has not been saved in frame")); | |
901461f8 PA |
1128 | else |
1129 | error_value_optimized_out (); | |
1130 | } | |
0e03807e TT |
1131 | } |
1132 | ||
efaf1ae0 TT |
1133 | void |
1134 | value::require_available () const | |
4e07d55f | 1135 | { |
efaf1ae0 | 1136 | if (!m_unavailable.empty ()) |
8af8e3bc | 1137 | throw_error (NOT_AVAILABLE_ERROR, _("value is not available")); |
4e07d55f PA |
1138 | } |
1139 | ||
50888e42 | 1140 | gdb::array_view<const gdb_byte> |
efaf1ae0 | 1141 | value::contents_for_printing () |
46615f07 | 1142 | { |
efaf1ae0 TT |
1143 | if (m_lazy) |
1144 | fetch_lazy (); | |
50888e42 | 1145 | |
efaf1ae0 TT |
1146 | ULONGEST length = enclosing_type ()->length (); |
1147 | return gdb::make_array_view (m_contents.get (), length); | |
46615f07 AC |
1148 | } |
1149 | ||
50888e42 | 1150 | gdb::array_view<const gdb_byte> |
efaf1ae0 | 1151 | value::contents_for_printing () const |
de4127a3 | 1152 | { |
efaf1ae0 | 1153 | gdb_assert (!m_lazy); |
50888e42 | 1154 | |
efaf1ae0 TT |
1155 | ULONGEST length = enclosing_type ()->length (); |
1156 | return gdb::make_array_view (m_contents.get (), length); | |
de4127a3 PA |
1157 | } |
1158 | ||
50888e42 | 1159 | gdb::array_view<const gdb_byte> |
efaf1ae0 | 1160 | value::contents_all () |
0e03807e | 1161 | { |
efaf1ae0 TT |
1162 | gdb::array_view<const gdb_byte> result = contents_for_printing (); |
1163 | require_not_optimized_out (); | |
1164 | require_available (); | |
0e03807e TT |
1165 | return result; |
1166 | } | |
1167 | ||
9a0dc9e3 PA |
1168 | /* Copy ranges in SRC_RANGE that overlap [SRC_BIT_OFFSET, |
1169 | SRC_BIT_OFFSET+BIT_LENGTH) ranges into *DST_RANGE, adjusted. */ | |
1170 | ||
1171 | static void | |
0c7e6dd8 TT |
1172 | ranges_copy_adjusted (std::vector<range> *dst_range, int dst_bit_offset, |
1173 | const std::vector<range> &src_range, int src_bit_offset, | |
4f82620c | 1174 | unsigned int bit_length) |
9a0dc9e3 | 1175 | { |
0c7e6dd8 | 1176 | for (const range &r : src_range) |
9a0dc9e3 | 1177 | { |
4f82620c | 1178 | LONGEST h, l; |
9a0dc9e3 | 1179 | |
0c7e6dd8 | 1180 | l = std::max (r.offset, (LONGEST) src_bit_offset); |
4f82620c | 1181 | h = std::min ((LONGEST) (r.offset + r.length), |
325fac50 | 1182 | (LONGEST) src_bit_offset + bit_length); |
9a0dc9e3 PA |
1183 | |
1184 | if (l < h) | |
1185 | insert_into_bit_range_vector (dst_range, | |
1186 | dst_bit_offset + (l - src_bit_offset), | |
1187 | h - l); | |
1188 | } | |
1189 | } | |
1190 | ||
6c49729e | 1191 | /* See value.h. */ |
4875ffdb | 1192 | |
6c49729e TT |
1193 | void |
1194 | value::ranges_copy_adjusted (struct value *dst, int dst_bit_offset, | |
1195 | int src_bit_offset, int bit_length) const | |
4875ffdb | 1196 | { |
6c49729e TT |
1197 | ::ranges_copy_adjusted (&dst->m_unavailable, dst_bit_offset, |
1198 | m_unavailable, src_bit_offset, | |
1199 | bit_length); | |
1200 | ::ranges_copy_adjusted (&dst->m_optimized_out, dst_bit_offset, | |
1201 | m_optimized_out, src_bit_offset, | |
1202 | bit_length); | |
4875ffdb PA |
1203 | } |
1204 | ||
6c49729e | 1205 | /* See value.h. */ |
39d37385 | 1206 | |
6c49729e TT |
1207 | void |
1208 | value::contents_copy_raw (struct value *dst, LONGEST dst_offset, | |
1209 | LONGEST src_offset, LONGEST length) | |
39d37385 | 1210 | { |
6b850546 | 1211 | LONGEST src_bit_offset, dst_bit_offset, bit_length; |
6c49729e | 1212 | int unit_size = gdbarch_addressable_memory_unit_size (arch ()); |
39d37385 PA |
1213 | |
1214 | /* A lazy DST would make that this copy operation useless, since as | |
1215 | soon as DST's contents were un-lazied (by a later value_contents | |
1216 | call, say), the contents would be overwritten. A lazy SRC would | |
1217 | mean we'd be copying garbage. */ | |
6c49729e | 1218 | gdb_assert (!dst->m_lazy && !m_lazy); |
39d37385 | 1219 | |
0676ec3c MR |
1220 | ULONGEST copy_length = length; |
1221 | ULONGEST limit = m_limited_length; | |
1222 | if (limit > 0 && src_offset + length > limit) | |
1223 | copy_length = src_offset > limit ? 0 : limit - src_offset; | |
1224 | ||
29976f3f PA |
1225 | /* The overwritten DST range gets unavailability ORed in, not |
1226 | replaced. Make sure to remember to implement replacing if it | |
1227 | turns out actually necessary. */ | |
d00664db TT |
1228 | gdb_assert (dst->bytes_available (dst_offset, length)); |
1229 | gdb_assert (!dst->bits_any_optimized_out (TARGET_CHAR_BIT * dst_offset, | |
1230 | TARGET_CHAR_BIT * length)); | |
29976f3f | 1231 | |
39d37385 | 1232 | /* Copy the data. */ |
4bce7cda | 1233 | gdb::array_view<gdb_byte> dst_contents |
bbe912ba | 1234 | = dst->contents_all_raw ().slice (dst_offset * unit_size, |
0676ec3c | 1235 | copy_length * unit_size); |
4bce7cda | 1236 | gdb::array_view<const gdb_byte> src_contents |
6c49729e | 1237 | = contents_all_raw ().slice (src_offset * unit_size, |
0676ec3c | 1238 | copy_length * unit_size); |
e18312bb | 1239 | gdb::copy (src_contents, dst_contents); |
39d37385 PA |
1240 | |
1241 | /* Copy the meta-data, adjusted. */ | |
3ae385af SM |
1242 | src_bit_offset = src_offset * unit_size * HOST_CHAR_BIT; |
1243 | dst_bit_offset = dst_offset * unit_size * HOST_CHAR_BIT; | |
1244 | bit_length = length * unit_size * HOST_CHAR_BIT; | |
39d37385 | 1245 | |
6c49729e TT |
1246 | ranges_copy_adjusted (dst, dst_bit_offset, |
1247 | src_bit_offset, bit_length); | |
39d37385 PA |
1248 | } |
1249 | ||
6c49729e | 1250 | /* See value.h. */ |
e379f652 | 1251 | |
6c49729e TT |
1252 | void |
1253 | value::contents_copy_raw_bitwise (struct value *dst, LONGEST dst_bit_offset, | |
1254 | LONGEST src_bit_offset, | |
1255 | LONGEST bit_length) | |
e379f652 TT |
1256 | { |
1257 | /* A lazy DST would make that this copy operation useless, since as | |
1258 | soon as DST's contents were un-lazied (by a later value_contents | |
1259 | call, say), the contents would be overwritten. A lazy SRC would | |
1260 | mean we'd be copying garbage. */ | |
6c49729e | 1261 | gdb_assert (!dst->m_lazy && !m_lazy); |
e379f652 | 1262 | |
0676ec3c MR |
1263 | ULONGEST copy_bit_length = bit_length; |
1264 | ULONGEST bit_limit = m_limited_length * TARGET_CHAR_BIT; | |
1265 | if (bit_limit > 0 && src_bit_offset + bit_length > bit_limit) | |
1266 | copy_bit_length = (src_bit_offset > bit_limit ? 0 | |
1267 | : bit_limit - src_bit_offset); | |
1268 | ||
e379f652 TT |
1269 | /* The overwritten DST range gets unavailability ORed in, not |
1270 | replaced. Make sure to remember to implement replacing if it | |
1271 | turns out actually necessary. */ | |
1272 | LONGEST dst_offset = dst_bit_offset / TARGET_CHAR_BIT; | |
1273 | LONGEST length = bit_length / TARGET_CHAR_BIT; | |
d00664db TT |
1274 | gdb_assert (dst->bytes_available (dst_offset, length)); |
1275 | gdb_assert (!dst->bits_any_optimized_out (dst_bit_offset, | |
1276 | bit_length)); | |
e379f652 TT |
1277 | |
1278 | /* Copy the data. */ | |
bbe912ba | 1279 | gdb::array_view<gdb_byte> dst_contents = dst->contents_all_raw (); |
6c49729e | 1280 | gdb::array_view<const gdb_byte> src_contents = contents_all_raw (); |
e379f652 TT |
1281 | copy_bitwise (dst_contents.data (), dst_bit_offset, |
1282 | src_contents.data (), src_bit_offset, | |
0676ec3c | 1283 | copy_bit_length, |
6c49729e | 1284 | type_byte_order (type ()) == BFD_ENDIAN_BIG); |
e379f652 TT |
1285 | |
1286 | /* Copy the meta-data. */ | |
6c49729e | 1287 | ranges_copy_adjusted (dst, dst_bit_offset, src_bit_offset, bit_length); |
e379f652 TT |
1288 | } |
1289 | ||
6c49729e | 1290 | /* See value.h. */ |
39d37385 PA |
1291 | |
1292 | void | |
6c49729e TT |
1293 | value::contents_copy (struct value *dst, LONGEST dst_offset, |
1294 | LONGEST src_offset, LONGEST length) | |
39d37385 | 1295 | { |
6c49729e TT |
1296 | if (m_lazy) |
1297 | fetch_lazy (); | |
39d37385 | 1298 | |
6c49729e | 1299 | contents_copy_raw (dst, dst_offset, src_offset, length); |
39d37385 PA |
1300 | } |
1301 | ||
50888e42 | 1302 | gdb::array_view<const gdb_byte> |
efaf1ae0 | 1303 | value::contents () |
0fd88904 | 1304 | { |
efaf1ae0 TT |
1305 | gdb::array_view<const gdb_byte> result = contents_writeable (); |
1306 | require_not_optimized_out (); | |
1307 | require_available (); | |
0e03807e | 1308 | return result; |
0fd88904 AC |
1309 | } |
1310 | ||
50888e42 | 1311 | gdb::array_view<gdb_byte> |
bbe912ba | 1312 | value::contents_writeable () |
0fd88904 | 1313 | { |
bbe912ba | 1314 | if (m_lazy) |
78259c36 | 1315 | fetch_lazy (); |
bbe912ba | 1316 | return contents_raw (); |
0fd88904 AC |
1317 | } |
1318 | ||
b59ff01d | 1319 | bool |
d00664db | 1320 | value::optimized_out () |
feb13ab0 | 1321 | { |
d00664db | 1322 | if (m_lazy) |
ecf2e90c | 1323 | { |
a519e8ff TT |
1324 | /* See if we can compute the result without fetching the |
1325 | value. */ | |
736355f2 | 1326 | if (this->lval () == lval_memory) |
a519e8ff | 1327 | return false; |
736355f2 | 1328 | else if (this->lval () == lval_computed) |
a519e8ff | 1329 | { |
d00664db | 1330 | const struct lval_funcs *funcs = m_location.computed.funcs; |
a519e8ff TT |
1331 | |
1332 | if (funcs->is_optimized_out != nullptr) | |
d00664db | 1333 | return funcs->is_optimized_out (this); |
a519e8ff TT |
1334 | } |
1335 | ||
1336 | /* Fall back to fetching. */ | |
a70b8144 | 1337 | try |
ecf2e90c | 1338 | { |
d00664db | 1339 | fetch_lazy (); |
ecf2e90c | 1340 | } |
230d2906 | 1341 | catch (const gdb_exception_error &ex) |
ecf2e90c | 1342 | { |
6d7aa592 PA |
1343 | switch (ex.error) |
1344 | { | |
1345 | case MEMORY_ERROR: | |
1346 | case OPTIMIZED_OUT_ERROR: | |
1347 | case NOT_AVAILABLE_ERROR: | |
1348 | /* These can normally happen when we try to access an | |
1349 | optimized out or unavailable register, either in a | |
1350 | physical register or spilled to memory. */ | |
1351 | break; | |
1352 | default: | |
1353 | throw; | |
1354 | } | |
ecf2e90c | 1355 | } |
ecf2e90c | 1356 | } |
691a26f5 | 1357 | |
d00664db | 1358 | return !m_optimized_out.empty (); |
feb13ab0 AC |
1359 | } |
1360 | ||
9a0dc9e3 PA |
1361 | /* Mark contents of VALUE as optimized out, starting at OFFSET bytes, and |
1362 | the following LENGTH bytes. */ | |
eca07816 | 1363 | |
feb13ab0 | 1364 | void |
d00664db | 1365 | value::mark_bytes_optimized_out (int offset, int length) |
feb13ab0 | 1366 | { |
d00664db TT |
1367 | mark_bits_optimized_out (offset * TARGET_CHAR_BIT, |
1368 | length * TARGET_CHAR_BIT); | |
feb13ab0 | 1369 | } |
13c3b5f5 | 1370 | |
9a0dc9e3 | 1371 | /* See value.h. */ |
0e03807e | 1372 | |
9a0dc9e3 | 1373 | void |
d00664db | 1374 | value::mark_bits_optimized_out (LONGEST offset, LONGEST length) |
0e03807e | 1375 | { |
d00664db | 1376 | insert_into_bit_range_vector (&m_optimized_out, offset, length); |
0e03807e TT |
1377 | } |
1378 | ||
19124154 | 1379 | bool |
e989e637 | 1380 | value::bits_synthetic_pointer (LONGEST offset, LONGEST length) const |
8cf6f0b1 | 1381 | { |
e989e637 TT |
1382 | if (m_lval != lval_computed |
1383 | || !m_location.computed.funcs->check_synthetic_pointer) | |
19124154 | 1384 | return false; |
e989e637 TT |
1385 | return m_location.computed.funcs->check_synthetic_pointer (this, offset, |
1386 | length); | |
8cf6f0b1 TT |
1387 | } |
1388 | ||
c8f2448a | 1389 | const struct lval_funcs * |
b9f74d54 | 1390 | value::computed_funcs () const |
5f5233d4 | 1391 | { |
b9f74d54 | 1392 | gdb_assert (m_lval == lval_computed); |
5f5233d4 | 1393 | |
b9f74d54 | 1394 | return m_location.computed.funcs; |
5f5233d4 PA |
1395 | } |
1396 | ||
1397 | void * | |
b9f74d54 | 1398 | value::computed_closure () const |
5f5233d4 | 1399 | { |
b9f74d54 | 1400 | gdb_assert (m_lval == lval_computed); |
5f5233d4 | 1401 | |
b9f74d54 | 1402 | return m_location.computed.closure; |
5f5233d4 PA |
1403 | } |
1404 | ||
42ae5230 | 1405 | CORE_ADDR |
9feb2d07 | 1406 | value::address () const |
42ae5230 | 1407 | { |
9feb2d07 | 1408 | if (m_lval != lval_memory) |
42ae5230 | 1409 | return 0; |
9feb2d07 | 1410 | if (m_parent != NULL) |
f28085df | 1411 | return m_parent->address () + m_offset; |
9feb2d07 | 1412 | if (NULL != TYPE_DATA_LOCATION (type ())) |
9920b434 | 1413 | { |
9c0fb734 | 1414 | gdb_assert (TYPE_DATA_LOCATION (type ())->is_constant ()); |
9feb2d07 | 1415 | return TYPE_DATA_LOCATION_ADDR (type ()); |
9920b434 BH |
1416 | } |
1417 | ||
9feb2d07 | 1418 | return m_location.address + m_offset; |
42ae5230 TT |
1419 | } |
1420 | ||
1421 | CORE_ADDR | |
9feb2d07 | 1422 | value::raw_address () const |
42ae5230 | 1423 | { |
9feb2d07 | 1424 | if (m_lval != lval_memory) |
42ae5230 | 1425 | return 0; |
9feb2d07 | 1426 | return m_location.address; |
42ae5230 TT |
1427 | } |
1428 | ||
1429 | void | |
9feb2d07 | 1430 | value::set_address (CORE_ADDR addr) |
13bb5560 | 1431 | { |
9feb2d07 TT |
1432 | gdb_assert (m_lval == lval_memory); |
1433 | m_location.address = addr; | |
13bb5560 AC |
1434 | } |
1435 | ||
c906108c SS |
1436 | /* Return a mark in the value chain. All values allocated after the |
1437 | mark is obtained (except for those released) are subject to being freed | |
1438 | if a subsequent value_free_to_mark is passed the mark. */ | |
f23631e4 | 1439 | struct value * |
fba45db2 | 1440 | value_mark (void) |
c906108c | 1441 | { |
062d818d TT |
1442 | if (all_values.empty ()) |
1443 | return nullptr; | |
1444 | return all_values.back ().get (); | |
c906108c SS |
1445 | } |
1446 | ||
828d3400 DJ |
1447 | /* Release a reference to VAL, which was acquired with value_incref. |
1448 | This function is also called to deallocate values from the value | |
1449 | chain. */ | |
1450 | ||
3e3d7139 | 1451 | void |
cdf3de17 | 1452 | value::decref () |
3e3d7139 | 1453 | { |
cdf3de17 TT |
1454 | gdb_assert (m_reference_count > 0); |
1455 | m_reference_count--; | |
1456 | if (m_reference_count == 0) | |
1457 | delete this; | |
3e3d7139 JG |
1458 | } |
1459 | ||
c906108c SS |
1460 | /* Free all values allocated since MARK was obtained by value_mark |
1461 | (except for those released). */ | |
1462 | void | |
4bf7b526 | 1463 | value_free_to_mark (const struct value *mark) |
c906108c | 1464 | { |
062d818d TT |
1465 | auto iter = std::find (all_values.begin (), all_values.end (), mark); |
1466 | if (iter == all_values.end ()) | |
1467 | all_values.clear (); | |
1468 | else | |
1469 | all_values.erase (iter + 1, all_values.end ()); | |
c906108c SS |
1470 | } |
1471 | ||
c906108c SS |
1472 | /* Remove VAL from the chain all_values |
1473 | so it will not be freed automatically. */ | |
1474 | ||
22bc8444 | 1475 | value_ref_ptr |
f23631e4 | 1476 | release_value (struct value *val) |
c906108c | 1477 | { |
850645cf TT |
1478 | if (val == nullptr) |
1479 | return value_ref_ptr (); | |
1480 | ||
062d818d TT |
1481 | std::vector<value_ref_ptr>::reverse_iterator iter; |
1482 | for (iter = all_values.rbegin (); iter != all_values.rend (); ++iter) | |
c906108c | 1483 | { |
062d818d | 1484 | if (*iter == val) |
c906108c | 1485 | { |
062d818d TT |
1486 | value_ref_ptr result = *iter; |
1487 | all_values.erase (iter.base () - 1); | |
1488 | return result; | |
c906108c SS |
1489 | } |
1490 | } | |
c906108c | 1491 | |
062d818d TT |
1492 | /* We must always return an owned reference. Normally this happens |
1493 | because we transfer the reference from the value chain, but in | |
1494 | this case the value was not on the chain. */ | |
bbfa6f00 | 1495 | return value_ref_ptr::new_reference (val); |
e848a8a5 TT |
1496 | } |
1497 | ||
a6535de1 TT |
1498 | /* See value.h. */ |
1499 | ||
1500 | std::vector<value_ref_ptr> | |
4bf7b526 | 1501 | value_release_to_mark (const struct value *mark) |
c906108c | 1502 | { |
a6535de1 | 1503 | std::vector<value_ref_ptr> result; |
c906108c | 1504 | |
062d818d TT |
1505 | auto iter = std::find (all_values.begin (), all_values.end (), mark); |
1506 | if (iter == all_values.end ()) | |
1507 | std::swap (result, all_values); | |
1508 | else | |
e848a8a5 | 1509 | { |
062d818d TT |
1510 | std::move (iter + 1, all_values.end (), std::back_inserter (result)); |
1511 | all_values.erase (iter + 1, all_values.end ()); | |
e848a8a5 | 1512 | } |
062d818d | 1513 | std::reverse (result.begin (), result.end ()); |
a6535de1 | 1514 | return result; |
c906108c SS |
1515 | } |
1516 | ||
cda03344 | 1517 | /* See value.h. */ |
c906108c | 1518 | |
f23631e4 | 1519 | struct value * |
cda03344 | 1520 | value::copy () const |
c906108c | 1521 | { |
cda03344 | 1522 | struct type *encl_type = enclosing_type (); |
3e3d7139 JG |
1523 | struct value *val; |
1524 | ||
cbe793af | 1525 | val = value::allocate_lazy (encl_type); |
cda03344 | 1526 | val->m_type = m_type; |
6f9c9d71 | 1527 | val->set_lval (m_lval); |
cda03344 TT |
1528 | val->m_location = m_location; |
1529 | val->m_offset = m_offset; | |
1530 | val->m_bitpos = m_bitpos; | |
1531 | val->m_bitsize = m_bitsize; | |
1532 | val->m_lazy = m_lazy; | |
1533 | val->m_embedded_offset = embedded_offset (); | |
1534 | val->m_pointed_to_offset = m_pointed_to_offset; | |
1535 | val->m_modifiable = m_modifiable; | |
1536 | val->m_stack = m_stack; | |
1537 | val->m_is_zero = m_is_zero; | |
1538 | val->m_in_history = m_in_history; | |
1539 | val->m_initialized = m_initialized; | |
1540 | val->m_unavailable = m_unavailable; | |
1541 | val->m_optimized_out = m_optimized_out; | |
1542 | val->m_parent = m_parent; | |
1543 | val->m_limited_length = m_limited_length; | |
4bce7cda | 1544 | |
3ee3b270 | 1545 | if (!val->lazy () |
d00664db TT |
1546 | && !(val->entirely_optimized_out () |
1547 | || val->entirely_unavailable ())) | |
5f8ab46b | 1548 | { |
382d927f | 1549 | ULONGEST length = val->m_limited_length; |
a0c07915 | 1550 | if (length == 0) |
463b870d | 1551 | length = val->enclosing_type ()->length (); |
a0c07915 | 1552 | |
cda03344 | 1553 | gdb_assert (m_contents != nullptr); |
5f8ab46b | 1554 | const auto &arg_view |
cda03344 | 1555 | = gdb::make_array_view (m_contents.get (), length); |
a0c07915 | 1556 | |
82ca8f72 | 1557 | val->allocate_contents (false); |
a0c07915 | 1558 | gdb::array_view<gdb_byte> val_contents |
bbe912ba | 1559 | = val->contents_all_raw ().slice (0, length); |
a0c07915 | 1560 | |
e18312bb | 1561 | gdb::copy (arg_view, val_contents); |
5f8ab46b | 1562 | } |
c906108c | 1563 | |
736355f2 | 1564 | if (val->lval () == lval_computed) |
5f5233d4 | 1565 | { |
382d927f | 1566 | const struct lval_funcs *funcs = val->m_location.computed.funcs; |
5f5233d4 PA |
1567 | |
1568 | if (funcs->copy_closure) | |
382d927f | 1569 | val->m_location.computed.closure = funcs->copy_closure (val); |
5f5233d4 | 1570 | } |
c906108c SS |
1571 | return val; |
1572 | } | |
74bcbdf3 | 1573 | |
4c082a81 SC |
1574 | /* Return a "const" and/or "volatile" qualified version of the value V. |
1575 | If CNST is true, then the returned value will be qualified with | |
1576 | "const". | |
1577 | if VOLTL is true, then the returned value will be qualified with | |
1578 | "volatile". */ | |
1579 | ||
1580 | struct value * | |
1581 | make_cv_value (int cnst, int voltl, struct value *v) | |
1582 | { | |
d0c97917 | 1583 | struct type *val_type = v->type (); |
463b870d | 1584 | struct type *m_enclosing_type = v->enclosing_type (); |
cda03344 | 1585 | struct value *cv_val = v->copy (); |
4c082a81 | 1586 | |
81ae560c | 1587 | cv_val->deprecated_set_type (make_cv_type (cnst, voltl, val_type, NULL)); |
463b870d | 1588 | cv_val->set_enclosing_type (make_cv_type (cnst, voltl, m_enclosing_type, NULL)); |
4c082a81 SC |
1589 | |
1590 | return cv_val; | |
1591 | } | |
1592 | ||
aa9f4538 | 1593 | /* See value.h. */ |
c37f7098 KW |
1594 | |
1595 | struct value * | |
aa9f4538 | 1596 | value::non_lval () |
c37f7098 | 1597 | { |
736355f2 | 1598 | if (this->lval () != not_lval) |
c37f7098 | 1599 | { |
aa9f4538 | 1600 | struct type *enc_type = enclosing_type (); |
317c3ed9 | 1601 | struct value *val = value::allocate (enc_type); |
c37f7098 | 1602 | |
aa9f4538 TT |
1603 | gdb::copy (contents_all (), val->contents_all_raw ()); |
1604 | val->m_type = m_type; | |
1605 | val->set_embedded_offset (embedded_offset ()); | |
1606 | val->set_pointed_to_offset (pointed_to_offset ()); | |
c37f7098 KW |
1607 | return val; |
1608 | } | |
aa9f4538 | 1609 | return this; |
c37f7098 KW |
1610 | } |
1611 | ||
aa9f4538 | 1612 | /* See value.h. */ |
6c659fc2 SC |
1613 | |
1614 | void | |
aa9f4538 | 1615 | value::force_lval (CORE_ADDR addr) |
6c659fc2 | 1616 | { |
736355f2 | 1617 | gdb_assert (this->lval () == not_lval); |
6c659fc2 | 1618 | |
aa9f4538 TT |
1619 | write_memory (addr, contents_raw ().data (), type ()->length ()); |
1620 | m_lval = lval_memory; | |
1621 | m_location.address = addr; | |
6c659fc2 SC |
1622 | } |
1623 | ||
74bcbdf3 | 1624 | void |
8181b7b6 | 1625 | value::set_component_location (const struct value *whole) |
74bcbdf3 | 1626 | { |
9920b434 BH |
1627 | struct type *type; |
1628 | ||
382d927f | 1629 | gdb_assert (whole->m_lval != lval_xcallable); |
e81e7f5e | 1630 | |
382d927f | 1631 | if (whole->m_lval == lval_internalvar) |
6f9c9d71 | 1632 | m_lval = lval_internalvar_component; |
74bcbdf3 | 1633 | else |
6f9c9d71 | 1634 | m_lval = whole->m_lval; |
5f5233d4 | 1635 | |
8181b7b6 | 1636 | m_location = whole->m_location; |
382d927f | 1637 | if (whole->m_lval == lval_computed) |
5f5233d4 | 1638 | { |
382d927f | 1639 | const struct lval_funcs *funcs = whole->m_location.computed.funcs; |
5f5233d4 PA |
1640 | |
1641 | if (funcs->copy_closure) | |
8181b7b6 | 1642 | m_location.computed.closure = funcs->copy_closure (whole); |
5f5233d4 | 1643 | } |
9920b434 | 1644 | |
3c8c6de2 AB |
1645 | /* If the WHOLE value has a dynamically resolved location property then |
1646 | update the address of the COMPONENT. */ | |
d0c97917 | 1647 | type = whole->type (); |
9920b434 | 1648 | if (NULL != TYPE_DATA_LOCATION (type) |
9c0fb734 | 1649 | && TYPE_DATA_LOCATION (type)->is_constant ()) |
8181b7b6 | 1650 | set_address (TYPE_DATA_LOCATION_ADDR (type)); |
3c8c6de2 AB |
1651 | |
1652 | /* Similarly, if the COMPONENT value has a dynamically resolved location | |
1653 | property then update its address. */ | |
8181b7b6 | 1654 | type = this->type (); |
3c8c6de2 | 1655 | if (NULL != TYPE_DATA_LOCATION (type) |
9c0fb734 | 1656 | && TYPE_DATA_LOCATION (type)->is_constant ()) |
3c8c6de2 AB |
1657 | { |
1658 | /* If the COMPONENT has a dynamic location, and is an | |
1659 | lval_internalvar_component, then we change it to a lval_memory. | |
1660 | ||
1661 | Usually a component of an internalvar is created non-lazy, and has | |
1662 | its content immediately copied from the parent internalvar. | |
1663 | However, for components with a dynamic location, the content of | |
1664 | the component is not contained within the parent, but is instead | |
1665 | accessed indirectly. Further, the component will be created as a | |
1666 | lazy value. | |
1667 | ||
1668 | By changing the type of the component to lval_memory we ensure | |
1669 | that value_fetch_lazy can successfully load the component. | |
1670 | ||
287de656 SM |
1671 | This solution isn't ideal, but a real fix would require values to |
1672 | carry around both the parent value contents, and the contents of | |
1673 | any dynamic fields within the parent. This is a substantial | |
1674 | change to how values work in GDB. */ | |
736355f2 | 1675 | if (this->lval () == lval_internalvar_component) |
3c8c6de2 | 1676 | { |
8181b7b6 | 1677 | gdb_assert (lazy ()); |
6f9c9d71 | 1678 | m_lval = lval_memory; |
3c8c6de2 AB |
1679 | } |
1680 | else | |
736355f2 | 1681 | gdb_assert (this->lval () == lval_memory); |
8181b7b6 | 1682 | set_address (TYPE_DATA_LOCATION_ADDR (type)); |
3c8c6de2 | 1683 | } |
74bcbdf3 PA |
1684 | } |
1685 | ||
c906108c SS |
1686 | /* Access to the value history. */ |
1687 | ||
1688 | /* Record a new value in the value history. | |
eddf0bae | 1689 | Returns the absolute history index of the entry. */ |
c906108c SS |
1690 | |
1691 | int | |
0d0f488e | 1692 | value::record_latest () |
c906108c | 1693 | { |
c906108c SS |
1694 | /* We don't want this value to have anything to do with the inferior anymore. |
1695 | In particular, "set $1 = 50" should not affect the variable from which | |
1696 | the value was taken, and fast watchpoints should be able to assume that | |
1697 | a value on the value history never changes. */ | |
0d0f488e | 1698 | if (lazy ()) |
a0c07915 AB |
1699 | { |
1700 | /* We know that this is a _huge_ array, any attempt to fetch this | |
1701 | is going to cause GDB to throw an error. However, to allow | |
1702 | the array to still be displayed we fetch its contents up to | |
1703 | `max_value_size' and mark anything beyond "unavailable" in | |
1704 | the history. */ | |
0d0f488e TT |
1705 | if (m_type->code () == TYPE_CODE_ARRAY |
1706 | && m_type->length () > max_value_size | |
a0c07915 | 1707 | && array_length_limiting_element_count.has_value () |
0d0f488e TT |
1708 | && m_enclosing_type == m_type |
1709 | && calculate_limited_array_length (m_type) <= max_value_size) | |
1710 | m_limited_length = max_value_size; | |
a0c07915 | 1711 | |
0d0f488e | 1712 | fetch_lazy (); |
a0c07915 AB |
1713 | } |
1714 | ||
0d0f488e | 1715 | ULONGEST limit = m_limited_length; |
a0c07915 | 1716 | if (limit != 0) |
0d0f488e | 1717 | mark_bytes_unavailable (limit, m_enclosing_type->length () - limit); |
aaab5fce MR |
1718 | |
1719 | /* Mark the value as recorded in the history for the availability check. */ | |
0d0f488e | 1720 | m_in_history = true; |
aaab5fce | 1721 | |
c906108c SS |
1722 | /* We preserve VALUE_LVAL so that the user can find out where it was fetched |
1723 | from. This is a bit dubious, because then *&$1 does not just return $1 | |
1724 | but the current contents of that location. c'est la vie... */ | |
b2227e67 | 1725 | set_modifiable (false); |
350e1a76 | 1726 | |
0d0f488e | 1727 | value_history.push_back (release_value (this)); |
a109c7c1 | 1728 | |
4d0266a0 | 1729 | return value_history.size (); |
c906108c SS |
1730 | } |
1731 | ||
1732 | /* Return a copy of the value in the history with sequence number NUM. */ | |
1733 | ||
f23631e4 | 1734 | struct value * |
fba45db2 | 1735 | access_value_history (int num) |
c906108c | 1736 | { |
52f0bd74 | 1737 | int absnum = num; |
c906108c SS |
1738 | |
1739 | if (absnum <= 0) | |
4d0266a0 | 1740 | absnum += value_history.size (); |
c906108c SS |
1741 | |
1742 | if (absnum <= 0) | |
1743 | { | |
1744 | if (num == 0) | |
8a3fe4f8 | 1745 | error (_("The history is empty.")); |
c906108c | 1746 | else if (num == 1) |
8a3fe4f8 | 1747 | error (_("There is only one value in the history.")); |
c906108c | 1748 | else |
8a3fe4f8 | 1749 | error (_("History does not go back to $$%d."), -num); |
c906108c | 1750 | } |
4d0266a0 | 1751 | if (absnum > value_history.size ()) |
8a3fe4f8 | 1752 | error (_("History has not yet reached $%d."), absnum); |
c906108c SS |
1753 | |
1754 | absnum--; | |
1755 | ||
f28085df | 1756 | return value_history[absnum]->copy (); |
c906108c SS |
1757 | } |
1758 | ||
30a87e90 AB |
1759 | /* See value.h. */ |
1760 | ||
1761 | ULONGEST | |
1762 | value_history_count () | |
1763 | { | |
1764 | return value_history.size (); | |
1765 | } | |
1766 | ||
c906108c | 1767 | static void |
5fed81ff | 1768 | show_values (const char *num_exp, int from_tty) |
c906108c | 1769 | { |
52f0bd74 | 1770 | int i; |
f23631e4 | 1771 | struct value *val; |
c906108c SS |
1772 | static int num = 1; |
1773 | ||
1774 | if (num_exp) | |
1775 | { | |
f132ba9d | 1776 | /* "show values +" should print from the stored position. |
dda83cd7 | 1777 | "show values <exp>" should print around value number <exp>. */ |
c906108c | 1778 | if (num_exp[0] != '+' || num_exp[1] != '\0') |
bb518678 | 1779 | num = parse_and_eval_long (num_exp) - 5; |
c906108c SS |
1780 | } |
1781 | else | |
1782 | { | |
f132ba9d | 1783 | /* "show values" means print the last 10 values. */ |
4d0266a0 | 1784 | num = value_history.size () - 9; |
c906108c SS |
1785 | } |
1786 | ||
1787 | if (num <= 0) | |
1788 | num = 1; | |
1789 | ||
4d0266a0 | 1790 | for (i = num; i < num + 10 && i <= value_history.size (); i++) |
c906108c | 1791 | { |
79a45b7d | 1792 | struct value_print_options opts; |
a109c7c1 | 1793 | |
c906108c | 1794 | val = access_value_history (i); |
6cb06a8c | 1795 | gdb_printf (("$%d = "), i); |
79a45b7d TT |
1796 | get_user_print_options (&opts); |
1797 | value_print (val, gdb_stdout, &opts); | |
6cb06a8c | 1798 | gdb_printf (("\n")); |
c906108c SS |
1799 | } |
1800 | ||
f132ba9d | 1801 | /* The next "show values +" should start after what we just printed. */ |
c906108c SS |
1802 | num += 10; |
1803 | ||
1804 | /* Hitting just return after this command should do the same thing as | |
f132ba9d TJB |
1805 | "show values +". If num_exp is null, this is unnecessary, since |
1806 | "show values +" is not useful after "show values". */ | |
c906108c | 1807 | if (from_tty && num_exp) |
85c4be7c | 1808 | set_repeat_arguments ("+"); |
c906108c SS |
1809 | } |
1810 | \f | |
52059ffd TT |
1811 | enum internalvar_kind |
1812 | { | |
1813 | /* The internal variable is empty. */ | |
1814 | INTERNALVAR_VOID, | |
1815 | ||
1816 | /* The value of the internal variable is provided directly as | |
1817 | a GDB value object. */ | |
1818 | INTERNALVAR_VALUE, | |
1819 | ||
1820 | /* A fresh value is computed via a call-back routine on every | |
1821 | access to the internal variable. */ | |
1822 | INTERNALVAR_MAKE_VALUE, | |
1823 | ||
1824 | /* The internal variable holds a GDB internal convenience function. */ | |
1825 | INTERNALVAR_FUNCTION, | |
1826 | ||
1827 | /* The variable holds an integer value. */ | |
1828 | INTERNALVAR_INTEGER, | |
1829 | ||
1830 | /* The variable holds a GDB-provided string. */ | |
1831 | INTERNALVAR_STRING, | |
1832 | }; | |
1833 | ||
1834 | union internalvar_data | |
1835 | { | |
1836 | /* A value object used with INTERNALVAR_VALUE. */ | |
1837 | struct value *value; | |
1838 | ||
1839 | /* The call-back routine used with INTERNALVAR_MAKE_VALUE. */ | |
1840 | struct | |
1841 | { | |
1842 | /* The functions to call. */ | |
1843 | const struct internalvar_funcs *functions; | |
1844 | ||
1845 | /* The function's user-data. */ | |
1846 | void *data; | |
1847 | } make_value; | |
1848 | ||
1849 | /* The internal function used with INTERNALVAR_FUNCTION. */ | |
1850 | struct | |
1851 | { | |
1852 | struct internal_function *function; | |
1853 | /* True if this is the canonical name for the function. */ | |
1854 | int canonical; | |
1855 | } fn; | |
1856 | ||
1857 | /* An integer value used with INTERNALVAR_INTEGER. */ | |
1858 | struct | |
1859 | { | |
1860 | /* If type is non-NULL, it will be used as the type to generate | |
1861 | a value for this internal variable. If type is NULL, a default | |
1862 | integer type for the architecture is used. */ | |
1863 | struct type *type; | |
1864 | LONGEST val; | |
1865 | } integer; | |
1866 | ||
1867 | /* A string value used with INTERNALVAR_STRING. */ | |
1868 | char *string; | |
1869 | }; | |
1870 | ||
c906108c SS |
1871 | /* Internal variables. These are variables within the debugger |
1872 | that hold values assigned by debugger commands. | |
1873 | The user refers to them with a '$' prefix | |
1874 | that does not appear in the variable names stored internally. */ | |
1875 | ||
4fa62494 UW |
1876 | struct internalvar |
1877 | { | |
dbca589b SM |
1878 | internalvar (std::string name) |
1879 | : name (std::move (name)) | |
1880 | {} | |
1881 | ||
f251cb9b | 1882 | std::string name; |
4fa62494 | 1883 | |
78267919 UW |
1884 | /* We support various different kinds of content of an internal variable. |
1885 | enum internalvar_kind specifies the kind, and union internalvar_data | |
1886 | provides the data associated with this particular kind. */ | |
1887 | ||
dbca589b | 1888 | enum internalvar_kind kind = INTERNALVAR_VOID; |
4fa62494 | 1889 | |
34464235 | 1890 | union internalvar_data u {}; |
4fa62494 UW |
1891 | }; |
1892 | ||
11470e70 | 1893 | /* Use std::map, a sorted container, to make the order of iteration (and |
71797f12 | 1894 | therefore the output of "show convenience") stable. */ |
11470e70 SM |
1895 | |
1896 | static std::map<std::string, internalvar> internalvars; | |
c906108c | 1897 | |
3e43a32a MS |
1898 | /* If the variable does not already exist create it and give it the |
1899 | value given. If no value is given then the default is zero. */ | |
53e5f3cf | 1900 | static void |
0b39b52e | 1901 | init_if_undefined_command (const char* args, int from_tty) |
53e5f3cf | 1902 | { |
413403fc | 1903 | struct internalvar *intvar = nullptr; |
53e5f3cf AS |
1904 | |
1905 | /* Parse the expression - this is taken from set_command(). */ | |
4d01a485 | 1906 | expression_up expr = parse_expression (args); |
53e5f3cf AS |
1907 | |
1908 | /* Validate the expression. | |
1909 | Was the expression an assignment? | |
1910 | Or even an expression at all? */ | |
3dd93bf8 | 1911 | if (expr->first_opcode () != BINOP_ASSIGN) |
53e5f3cf AS |
1912 | error (_("Init-if-undefined requires an assignment expression.")); |
1913 | ||
1eaebe02 TT |
1914 | /* Extract the variable from the parsed expression. */ |
1915 | expr::assign_operation *assign | |
1916 | = dynamic_cast<expr::assign_operation *> (expr->op.get ()); | |
1917 | if (assign != nullptr) | |
413403fc | 1918 | { |
1eaebe02 TT |
1919 | expr::operation *lhs = assign->get_lhs (); |
1920 | expr::internalvar_operation *ivarop | |
1921 | = dynamic_cast<expr::internalvar_operation *> (lhs); | |
1922 | if (ivarop != nullptr) | |
1923 | intvar = ivarop->get_internalvar (); | |
413403fc TT |
1924 | } |
1925 | ||
1926 | if (intvar == nullptr) | |
3e43a32a MS |
1927 | error (_("The first parameter to init-if-undefined " |
1928 | "should be a GDB variable.")); | |
53e5f3cf AS |
1929 | |
1930 | /* Only evaluate the expression if the lvalue is void. | |
85102364 | 1931 | This may still fail if the expression is invalid. */ |
78267919 | 1932 | if (intvar->kind == INTERNALVAR_VOID) |
43048e46 | 1933 | expr->evaluate (); |
53e5f3cf AS |
1934 | } |
1935 | ||
1936 | ||
c906108c SS |
1937 | /* Look up an internal variable with name NAME. NAME should not |
1938 | normally include a dollar sign. | |
1939 | ||
1940 | If the specified internal variable does not exist, | |
c4a3d09a | 1941 | the return value is NULL. */ |
c906108c SS |
1942 | |
1943 | struct internalvar * | |
bc3b79fd | 1944 | lookup_only_internalvar (const char *name) |
c906108c | 1945 | { |
11470e70 SM |
1946 | auto it = internalvars.find (name); |
1947 | if (it == internalvars.end ()) | |
1948 | return nullptr; | |
c906108c | 1949 | |
11470e70 | 1950 | return &it->second; |
c4a3d09a MF |
1951 | } |
1952 | ||
eb3ff9a5 PA |
1953 | /* Complete NAME by comparing it to the names of internal |
1954 | variables. */ | |
d55637df | 1955 | |
eb3ff9a5 PA |
1956 | void |
1957 | complete_internalvar (completion_tracker &tracker, const char *name) | |
d55637df | 1958 | { |
11470e70 | 1959 | int len = strlen (name); |
d55637df | 1960 | |
11470e70 SM |
1961 | for (auto &pair : internalvars) |
1962 | { | |
1963 | const internalvar &var = pair.second; | |
d55637df | 1964 | |
11470e70 SM |
1965 | if (var.name.compare (0, len, name) == 0) |
1966 | tracker.add_completion (make_unique_xstrdup (var.name.c_str ())); | |
1967 | } | |
d55637df | 1968 | } |
c4a3d09a MF |
1969 | |
1970 | /* Create an internal variable with name NAME and with a void value. | |
11470e70 SM |
1971 | NAME should not normally include a dollar sign. |
1972 | ||
1973 | An internal variable with that name must not exist already. */ | |
c4a3d09a MF |
1974 | |
1975 | struct internalvar * | |
bc3b79fd | 1976 | create_internalvar (const char *name) |
c4a3d09a | 1977 | { |
11470e70 SM |
1978 | auto pair = internalvars.emplace (std::make_pair (name, internalvar (name))); |
1979 | gdb_assert (pair.second); | |
a109c7c1 | 1980 | |
11470e70 | 1981 | return &pair.first->second; |
c906108c SS |
1982 | } |
1983 | ||
4aa995e1 PA |
1984 | /* Create an internal variable with name NAME and register FUN as the |
1985 | function that value_of_internalvar uses to create a value whenever | |
1986 | this variable is referenced. NAME should not normally include a | |
22d2b532 SDJ |
1987 | dollar sign. DATA is passed uninterpreted to FUN when it is |
1988 | called. CLEANUP, if not NULL, is called when the internal variable | |
1989 | is destroyed. It is passed DATA as its only argument. */ | |
4aa995e1 PA |
1990 | |
1991 | struct internalvar * | |
22d2b532 SDJ |
1992 | create_internalvar_type_lazy (const char *name, |
1993 | const struct internalvar_funcs *funcs, | |
1994 | void *data) | |
4aa995e1 | 1995 | { |
4fa62494 | 1996 | struct internalvar *var = create_internalvar (name); |
a109c7c1 | 1997 | |
78267919 | 1998 | var->kind = INTERNALVAR_MAKE_VALUE; |
22d2b532 SDJ |
1999 | var->u.make_value.functions = funcs; |
2000 | var->u.make_value.data = data; | |
4aa995e1 PA |
2001 | return var; |
2002 | } | |
c4a3d09a | 2003 | |
22d2b532 SDJ |
2004 | /* See documentation in value.h. */ |
2005 | ||
2006 | int | |
2007 | compile_internalvar_to_ax (struct internalvar *var, | |
2008 | struct agent_expr *expr, | |
2009 | struct axs_value *value) | |
2010 | { | |
2011 | if (var->kind != INTERNALVAR_MAKE_VALUE | |
2012 | || var->u.make_value.functions->compile_to_ax == NULL) | |
2013 | return 0; | |
2014 | ||
2015 | var->u.make_value.functions->compile_to_ax (var, expr, value, | |
2016 | var->u.make_value.data); | |
2017 | return 1; | |
2018 | } | |
2019 | ||
c4a3d09a MF |
2020 | /* Look up an internal variable with name NAME. NAME should not |
2021 | normally include a dollar sign. | |
2022 | ||
2023 | If the specified internal variable does not exist, | |
2024 | one is created, with a void value. */ | |
2025 | ||
2026 | struct internalvar * | |
bc3b79fd | 2027 | lookup_internalvar (const char *name) |
c4a3d09a MF |
2028 | { |
2029 | struct internalvar *var; | |
2030 | ||
2031 | var = lookup_only_internalvar (name); | |
2032 | if (var) | |
2033 | return var; | |
2034 | ||
2035 | return create_internalvar (name); | |
2036 | } | |
2037 | ||
78267919 UW |
2038 | /* Return current value of internal variable VAR. For variables that |
2039 | are not inherently typed, use a value type appropriate for GDBARCH. */ | |
2040 | ||
f23631e4 | 2041 | struct value * |
78267919 | 2042 | value_of_internalvar (struct gdbarch *gdbarch, struct internalvar *var) |
c906108c | 2043 | { |
f23631e4 | 2044 | struct value *val; |
0914bcdb SS |
2045 | struct trace_state_variable *tsv; |
2046 | ||
2047 | /* If there is a trace state variable of the same name, assume that | |
2048 | is what we really want to see. */ | |
f251cb9b | 2049 | tsv = find_trace_state_variable (var->name.c_str ()); |
0914bcdb SS |
2050 | if (tsv) |
2051 | { | |
2052 | tsv->value_known = target_get_trace_state_variable_value (tsv->number, | |
2053 | &(tsv->value)); | |
2054 | if (tsv->value_known) | |
2055 | val = value_from_longest (builtin_type (gdbarch)->builtin_int64, | |
2056 | tsv->value); | |
2057 | else | |
317c3ed9 | 2058 | val = value::allocate (builtin_type (gdbarch)->builtin_void); |
0914bcdb SS |
2059 | return val; |
2060 | } | |
c906108c | 2061 | |
78267919 | 2062 | switch (var->kind) |
5f5233d4 | 2063 | { |
78267919 | 2064 | case INTERNALVAR_VOID: |
317c3ed9 | 2065 | val = value::allocate (builtin_type (gdbarch)->builtin_void); |
78267919 | 2066 | break; |
4fa62494 | 2067 | |
78267919 | 2068 | case INTERNALVAR_FUNCTION: |
317c3ed9 | 2069 | val = value::allocate (builtin_type (gdbarch)->internal_fn); |
78267919 | 2070 | break; |
4fa62494 | 2071 | |
cab0c772 UW |
2072 | case INTERNALVAR_INTEGER: |
2073 | if (!var->u.integer.type) | |
78267919 | 2074 | val = value_from_longest (builtin_type (gdbarch)->builtin_int, |
cab0c772 | 2075 | var->u.integer.val); |
78267919 | 2076 | else |
cab0c772 UW |
2077 | val = value_from_longest (var->u.integer.type, var->u.integer.val); |
2078 | break; | |
2079 | ||
78267919 | 2080 | case INTERNALVAR_STRING: |
baab3753 AB |
2081 | val = current_language->value_string (gdbarch, |
2082 | var->u.string, | |
2083 | strlen (var->u.string)); | |
78267919 | 2084 | break; |
4fa62494 | 2085 | |
78267919 | 2086 | case INTERNALVAR_VALUE: |
cda03344 | 2087 | val = var->u.value->copy (); |
3ee3b270 | 2088 | if (val->lazy ()) |
78259c36 | 2089 | val->fetch_lazy (); |
78267919 | 2090 | break; |
4aa995e1 | 2091 | |
78267919 | 2092 | case INTERNALVAR_MAKE_VALUE: |
22d2b532 SDJ |
2093 | val = (*var->u.make_value.functions->make_value) (gdbarch, var, |
2094 | var->u.make_value.data); | |
78267919 UW |
2095 | break; |
2096 | ||
2097 | default: | |
f34652de | 2098 | internal_error (_("bad kind")); |
78267919 UW |
2099 | } |
2100 | ||
2101 | /* Change the VALUE_LVAL to lval_internalvar so that future operations | |
2102 | on this value go back to affect the original internal variable. | |
2103 | ||
2104 | Do not do this for INTERNALVAR_MAKE_VALUE variables, as those have | |
30baf67b | 2105 | no underlying modifiable state in the internal variable. |
78267919 UW |
2106 | |
2107 | Likewise, if the variable's value is a computed lvalue, we want | |
2108 | references to it to produce another computed lvalue, where | |
2109 | references and assignments actually operate through the | |
2110 | computed value's functions. | |
2111 | ||
2112 | This means that internal variables with computed values | |
2113 | behave a little differently from other internal variables: | |
2114 | assignments to them don't just replace the previous value | |
2115 | altogether. At the moment, this seems like the behavior we | |
2116 | want. */ | |
2117 | ||
2118 | if (var->kind != INTERNALVAR_MAKE_VALUE | |
fcf86fe5 | 2119 | && val->lval () != lval_computed) |
78267919 | 2120 | { |
6f9c9d71 | 2121 | val->set_lval (lval_internalvar); |
78267919 | 2122 | VALUE_INTERNALVAR (val) = var; |
5f5233d4 | 2123 | } |
d3c139e9 | 2124 | |
4fa62494 UW |
2125 | return val; |
2126 | } | |
d3c139e9 | 2127 | |
4fa62494 UW |
2128 | int |
2129 | get_internalvar_integer (struct internalvar *var, LONGEST *result) | |
2130 | { | |
3158c6ed | 2131 | if (var->kind == INTERNALVAR_INTEGER) |
4fa62494 | 2132 | { |
cab0c772 UW |
2133 | *result = var->u.integer.val; |
2134 | return 1; | |
3158c6ed | 2135 | } |
d3c139e9 | 2136 | |
3158c6ed PA |
2137 | if (var->kind == INTERNALVAR_VALUE) |
2138 | { | |
d0c97917 | 2139 | struct type *type = check_typedef (var->u.value->type ()); |
3158c6ed | 2140 | |
78134374 | 2141 | if (type->code () == TYPE_CODE_INT) |
3158c6ed PA |
2142 | { |
2143 | *result = value_as_long (var->u.value); | |
2144 | return 1; | |
2145 | } | |
4fa62494 | 2146 | } |
3158c6ed | 2147 | |
52e0b52e HD |
2148 | if (var->kind == INTERNALVAR_MAKE_VALUE) |
2149 | { | |
2150 | struct gdbarch *gdbarch = get_current_arch (); | |
2151 | struct value *val | |
2152 | = (*var->u.make_value.functions->make_value) (gdbarch, var, | |
2153 | var->u.make_value.data); | |
2154 | struct type *type = check_typedef (val->type ()); | |
2155 | ||
2156 | if (type->code () == TYPE_CODE_INT) | |
2157 | { | |
2158 | *result = value_as_long (val); | |
2159 | return 1; | |
2160 | } | |
2161 | } | |
2162 | ||
3158c6ed | 2163 | return 0; |
4fa62494 | 2164 | } |
d3c139e9 | 2165 | |
4fa62494 UW |
2166 | static int |
2167 | get_internalvar_function (struct internalvar *var, | |
2168 | struct internal_function **result) | |
2169 | { | |
78267919 | 2170 | switch (var->kind) |
d3c139e9 | 2171 | { |
78267919 UW |
2172 | case INTERNALVAR_FUNCTION: |
2173 | *result = var->u.fn.function; | |
4fa62494 | 2174 | return 1; |
d3c139e9 | 2175 | |
4fa62494 UW |
2176 | default: |
2177 | return 0; | |
2178 | } | |
c906108c SS |
2179 | } |
2180 | ||
2181 | void | |
6b850546 DT |
2182 | set_internalvar_component (struct internalvar *var, |
2183 | LONGEST offset, LONGEST bitpos, | |
2184 | LONGEST bitsize, struct value *newval) | |
c906108c | 2185 | { |
4fa62494 | 2186 | gdb_byte *addr; |
bbe912ba | 2187 | struct gdbarch *gdbarch; |
3ae385af | 2188 | int unit_size; |
c906108c | 2189 | |
78267919 | 2190 | switch (var->kind) |
4fa62494 | 2191 | { |
78267919 | 2192 | case INTERNALVAR_VALUE: |
bbe912ba TT |
2193 | addr = var->u.value->contents_writeable ().data (); |
2194 | gdbarch = var->u.value->arch (); | |
2195 | unit_size = gdbarch_addressable_memory_unit_size (gdbarch); | |
4fa62494 UW |
2196 | |
2197 | if (bitsize) | |
d0c97917 | 2198 | modify_field (var->u.value->type (), addr + offset, |
4fa62494 UW |
2199 | value_as_long (newval), bitpos, bitsize); |
2200 | else | |
efaf1ae0 | 2201 | memcpy (addr + offset * unit_size, newval->contents ().data (), |
d0c97917 | 2202 | newval->type ()->length ()); |
4fa62494 | 2203 | break; |
78267919 UW |
2204 | |
2205 | default: | |
2206 | /* We can never get a component of any other kind. */ | |
f34652de | 2207 | internal_error (_("set_internalvar_component")); |
4fa62494 | 2208 | } |
c906108c SS |
2209 | } |
2210 | ||
2211 | void | |
f23631e4 | 2212 | set_internalvar (struct internalvar *var, struct value *val) |
c906108c | 2213 | { |
78267919 | 2214 | enum internalvar_kind new_kind; |
4fa62494 | 2215 | union internalvar_data new_data = { 0 }; |
c906108c | 2216 | |
78267919 | 2217 | if (var->kind == INTERNALVAR_FUNCTION && var->u.fn.canonical) |
f251cb9b | 2218 | error (_("Cannot overwrite convenience function %s"), var->name.c_str ()); |
bc3b79fd | 2219 | |
4fa62494 | 2220 | /* Prepare new contents. */ |
d0c97917 | 2221 | switch (check_typedef (val->type ())->code ()) |
4fa62494 UW |
2222 | { |
2223 | case TYPE_CODE_VOID: | |
78267919 | 2224 | new_kind = INTERNALVAR_VOID; |
4fa62494 UW |
2225 | break; |
2226 | ||
2227 | case TYPE_CODE_INTERNAL_FUNCTION: | |
736355f2 | 2228 | gdb_assert (val->lval () == lval_internalvar); |
78267919 UW |
2229 | new_kind = INTERNALVAR_FUNCTION; |
2230 | get_internalvar_function (VALUE_INTERNALVAR (val), | |
2231 | &new_data.fn.function); | |
2232 | /* Copies created here are never canonical. */ | |
4fa62494 UW |
2233 | break; |
2234 | ||
4fa62494 | 2235 | default: |
78267919 | 2236 | new_kind = INTERNALVAR_VALUE; |
cda03344 | 2237 | struct value *copy = val->copy (); |
b2227e67 | 2238 | copy->set_modifiable (true); |
4fa62494 UW |
2239 | |
2240 | /* Force the value to be fetched from the target now, to avoid problems | |
2241 | later when this internalvar is referenced and the target is gone or | |
2242 | has changed. */ | |
3ee3b270 | 2243 | if (copy->lazy ()) |
78259c36 | 2244 | copy->fetch_lazy (); |
4fa62494 UW |
2245 | |
2246 | /* Release the value from the value chain to prevent it from being | |
2247 | deleted by free_all_values. From here on this function should not | |
2248 | call error () until new_data is installed into the var->u to avoid | |
2249 | leaking memory. */ | |
895dafa6 | 2250 | new_data.value = release_value (copy).release (); |
9920b434 BH |
2251 | |
2252 | /* Internal variables which are created from values with a dynamic | |
dda83cd7 SM |
2253 | location don't need the location property of the origin anymore. |
2254 | The resolved dynamic location is used prior then any other address | |
2255 | when accessing the value. | |
2256 | If we keep it, we would still refer to the origin value. | |
2257 | Remove the location property in case it exist. */ | |
d0c97917 | 2258 | new_data.value->type ()->remove_dyn_prop (DYN_PROP_DATA_LOCATION); |
9920b434 | 2259 | |
4fa62494 UW |
2260 | break; |
2261 | } | |
2262 | ||
2263 | /* Clean up old contents. */ | |
2264 | clear_internalvar (var); | |
2265 | ||
2266 | /* Switch over. */ | |
78267919 | 2267 | var->kind = new_kind; |
4fa62494 | 2268 | var->u = new_data; |
c906108c SS |
2269 | /* End code which must not call error(). */ |
2270 | } | |
2271 | ||
4fa62494 UW |
2272 | void |
2273 | set_internalvar_integer (struct internalvar *var, LONGEST l) | |
2274 | { | |
2275 | /* Clean up old contents. */ | |
2276 | clear_internalvar (var); | |
2277 | ||
cab0c772 UW |
2278 | var->kind = INTERNALVAR_INTEGER; |
2279 | var->u.integer.type = NULL; | |
2280 | var->u.integer.val = l; | |
78267919 UW |
2281 | } |
2282 | ||
2283 | void | |
2284 | set_internalvar_string (struct internalvar *var, const char *string) | |
2285 | { | |
2286 | /* Clean up old contents. */ | |
2287 | clear_internalvar (var); | |
2288 | ||
2289 | var->kind = INTERNALVAR_STRING; | |
2290 | var->u.string = xstrdup (string); | |
4fa62494 UW |
2291 | } |
2292 | ||
2293 | static void | |
2294 | set_internalvar_function (struct internalvar *var, struct internal_function *f) | |
2295 | { | |
2296 | /* Clean up old contents. */ | |
2297 | clear_internalvar (var); | |
2298 | ||
78267919 UW |
2299 | var->kind = INTERNALVAR_FUNCTION; |
2300 | var->u.fn.function = f; | |
2301 | var->u.fn.canonical = 1; | |
2302 | /* Variables installed here are always the canonical version. */ | |
4fa62494 UW |
2303 | } |
2304 | ||
2305 | void | |
2306 | clear_internalvar (struct internalvar *var) | |
2307 | { | |
2308 | /* Clean up old contents. */ | |
78267919 | 2309 | switch (var->kind) |
4fa62494 | 2310 | { |
78267919 | 2311 | case INTERNALVAR_VALUE: |
cdf3de17 | 2312 | var->u.value->decref (); |
78267919 UW |
2313 | break; |
2314 | ||
2315 | case INTERNALVAR_STRING: | |
2316 | xfree (var->u.string); | |
4fa62494 UW |
2317 | break; |
2318 | ||
2319 | default: | |
4fa62494 UW |
2320 | break; |
2321 | } | |
2322 | ||
78267919 UW |
2323 | /* Reset to void kind. */ |
2324 | var->kind = INTERNALVAR_VOID; | |
4fa62494 UW |
2325 | } |
2326 | ||
baf20f76 | 2327 | const char * |
4bf7b526 | 2328 | internalvar_name (const struct internalvar *var) |
c906108c | 2329 | { |
f251cb9b | 2330 | return var->name.c_str (); |
c906108c SS |
2331 | } |
2332 | ||
4fa62494 UW |
2333 | static struct internal_function * |
2334 | create_internal_function (const char *name, | |
2335 | internal_function_fn handler, void *cookie) | |
bc3b79fd | 2336 | { |
bc3b79fd | 2337 | struct internal_function *ifn = XNEW (struct internal_function); |
a109c7c1 | 2338 | |
bc3b79fd TJB |
2339 | ifn->name = xstrdup (name); |
2340 | ifn->handler = handler; | |
2341 | ifn->cookie = cookie; | |
4fa62494 | 2342 | return ifn; |
bc3b79fd TJB |
2343 | } |
2344 | ||
91f87213 | 2345 | const char * |
bc3b79fd TJB |
2346 | value_internal_function_name (struct value *val) |
2347 | { | |
4fa62494 UW |
2348 | struct internal_function *ifn; |
2349 | int result; | |
2350 | ||
736355f2 | 2351 | gdb_assert (val->lval () == lval_internalvar); |
4fa62494 UW |
2352 | result = get_internalvar_function (VALUE_INTERNALVAR (val), &ifn); |
2353 | gdb_assert (result); | |
2354 | ||
bc3b79fd TJB |
2355 | return ifn->name; |
2356 | } | |
2357 | ||
2358 | struct value * | |
d452c4bc UW |
2359 | call_internal_function (struct gdbarch *gdbarch, |
2360 | const struct language_defn *language, | |
2361 | struct value *func, int argc, struct value **argv) | |
bc3b79fd | 2362 | { |
4fa62494 UW |
2363 | struct internal_function *ifn; |
2364 | int result; | |
2365 | ||
736355f2 | 2366 | gdb_assert (func->lval () == lval_internalvar); |
4fa62494 UW |
2367 | result = get_internalvar_function (VALUE_INTERNALVAR (func), &ifn); |
2368 | gdb_assert (result); | |
2369 | ||
d452c4bc | 2370 | return (*ifn->handler) (gdbarch, language, ifn->cookie, argc, argv); |
bc3b79fd TJB |
2371 | } |
2372 | ||
2373 | /* The 'function' command. This does nothing -- it is just a | |
2374 | placeholder to let "help function NAME" work. This is also used as | |
2375 | the implementation of the sub-command that is created when | |
2376 | registering an internal function. */ | |
2377 | static void | |
981a3fb3 | 2378 | function_command (const char *command, int from_tty) |
bc3b79fd TJB |
2379 | { |
2380 | /* Do nothing. */ | |
2381 | } | |
2382 | ||
1a6d41c6 TT |
2383 | /* Helper function that does the work for add_internal_function. */ |
2384 | ||
2385 | static struct cmd_list_element * | |
2386 | do_add_internal_function (const char *name, const char *doc, | |
2387 | internal_function_fn handler, void *cookie) | |
bc3b79fd | 2388 | { |
4fa62494 | 2389 | struct internal_function *ifn; |
bc3b79fd | 2390 | struct internalvar *var = lookup_internalvar (name); |
4fa62494 UW |
2391 | |
2392 | ifn = create_internal_function (name, handler, cookie); | |
2393 | set_internalvar_function (var, ifn); | |
bc3b79fd | 2394 | |
3ea16160 | 2395 | return add_cmd (name, no_class, function_command, doc, &functionlist); |
1a6d41c6 TT |
2396 | } |
2397 | ||
2398 | /* See value.h. */ | |
2399 | ||
2400 | void | |
2401 | add_internal_function (const char *name, const char *doc, | |
2402 | internal_function_fn handler, void *cookie) | |
2403 | { | |
2404 | do_add_internal_function (name, doc, handler, cookie); | |
2405 | } | |
2406 | ||
2407 | /* See value.h. */ | |
2408 | ||
2409 | void | |
3ea16160 TT |
2410 | add_internal_function (gdb::unique_xmalloc_ptr<char> &&name, |
2411 | gdb::unique_xmalloc_ptr<char> &&doc, | |
1a6d41c6 TT |
2412 | internal_function_fn handler, void *cookie) |
2413 | { | |
2414 | struct cmd_list_element *cmd | |
3ea16160 | 2415 | = do_add_internal_function (name.get (), doc.get (), handler, cookie); |
8eaecfb3 SM |
2416 | |
2417 | /* Manually transfer the ownership of the doc and name strings to CMD by | |
2418 | setting the appropriate flags. */ | |
2419 | (void) doc.release (); | |
1a6d41c6 | 2420 | cmd->doc_allocated = 1; |
8eaecfb3 | 2421 | (void) name.release (); |
3ea16160 | 2422 | cmd->name_allocated = 1; |
bc3b79fd TJB |
2423 | } |
2424 | ||
4e7a5ef5 | 2425 | void |
e3fb3c47 | 2426 | value::preserve (struct objfile *objfile, htab_t copied_types) |
ae5a43e0 | 2427 | { |
e3fb3c47 TT |
2428 | if (m_type->objfile_owner () == objfile) |
2429 | m_type = copy_type_recursive (m_type, copied_types); | |
ae5a43e0 | 2430 | |
e3fb3c47 TT |
2431 | if (m_enclosing_type->objfile_owner () == objfile) |
2432 | m_enclosing_type = copy_type_recursive (m_enclosing_type, copied_types); | |
ae5a43e0 DJ |
2433 | } |
2434 | ||
78267919 UW |
2435 | /* Likewise for internal variable VAR. */ |
2436 | ||
2437 | static void | |
2438 | preserve_one_internalvar (struct internalvar *var, struct objfile *objfile, | |
2439 | htab_t copied_types) | |
2440 | { | |
2441 | switch (var->kind) | |
2442 | { | |
cab0c772 | 2443 | case INTERNALVAR_INTEGER: |
6ac37371 SM |
2444 | if (var->u.integer.type |
2445 | && var->u.integer.type->objfile_owner () == objfile) | |
cab0c772 | 2446 | var->u.integer.type |
bde539c2 | 2447 | = copy_type_recursive (var->u.integer.type, copied_types); |
cab0c772 UW |
2448 | break; |
2449 | ||
78267919 | 2450 | case INTERNALVAR_VALUE: |
e3fb3c47 | 2451 | var->u.value->preserve (objfile, copied_types); |
78267919 UW |
2452 | break; |
2453 | } | |
2454 | } | |
2455 | ||
bc20e562 LS |
2456 | /* Make sure that all types and values referenced by VAROBJ are updated before |
2457 | OBJFILE is discarded. COPIED_TYPES is used to prevent cycles and | |
2458 | duplicates. */ | |
2459 | ||
2460 | static void | |
2461 | preserve_one_varobj (struct varobj *varobj, struct objfile *objfile, | |
2462 | htab_t copied_types) | |
2463 | { | |
2464 | if (varobj->type->is_objfile_owned () | |
2465 | && varobj->type->objfile_owner () == objfile) | |
2466 | { | |
2467 | varobj->type | |
bde539c2 | 2468 | = copy_type_recursive (varobj->type, copied_types); |
bc20e562 LS |
2469 | } |
2470 | ||
2471 | if (varobj->value != nullptr) | |
f28085df | 2472 | varobj->value->preserve (objfile, copied_types); |
bc20e562 LS |
2473 | } |
2474 | ||
ae5a43e0 DJ |
2475 | /* Update the internal variables and value history when OBJFILE is |
2476 | discarded; we must copy the types out of the objfile. New global types | |
2477 | will be created for every convenience variable which currently points to | |
2478 | this objfile's types, and the convenience variables will be adjusted to | |
2479 | use the new global types. */ | |
c906108c SS |
2480 | |
2481 | void | |
ae5a43e0 | 2482 | preserve_values (struct objfile *objfile) |
c906108c | 2483 | { |
ae5a43e0 DJ |
2484 | /* Create the hash table. We allocate on the objfile's obstack, since |
2485 | it is soon to be deleted. */ | |
bde539c2 | 2486 | htab_up copied_types = create_copied_types_hash (); |
ae5a43e0 | 2487 | |
4d0266a0 | 2488 | for (const value_ref_ptr &item : value_history) |
f28085df | 2489 | item->preserve (objfile, copied_types.get ()); |
ae5a43e0 | 2490 | |
11470e70 SM |
2491 | for (auto &pair : internalvars) |
2492 | preserve_one_internalvar (&pair.second, objfile, copied_types.get ()); | |
ae5a43e0 | 2493 | |
bc20e562 LS |
2494 | /* For the remaining varobj, check that none has type owned by OBJFILE. */ |
2495 | all_root_varobjs ([&copied_types, objfile] (struct varobj *varobj) | |
2496 | { | |
2497 | preserve_one_varobj (varobj, objfile, | |
2498 | copied_types.get ()); | |
2499 | }); | |
2500 | ||
6108fd18 | 2501 | preserve_ext_lang_values (objfile, copied_types.get ()); |
c906108c SS |
2502 | } |
2503 | ||
2504 | static void | |
ad25e423 | 2505 | show_convenience (const char *ignore, int from_tty) |
c906108c | 2506 | { |
e17c207e | 2507 | struct gdbarch *gdbarch = get_current_arch (); |
c906108c | 2508 | int varseen = 0; |
79a45b7d | 2509 | struct value_print_options opts; |
c906108c | 2510 | |
79a45b7d | 2511 | get_user_print_options (&opts); |
11470e70 | 2512 | for (auto &pair : internalvars) |
c906108c | 2513 | { |
11470e70 | 2514 | internalvar &var = pair.second; |
c709acd1 | 2515 | |
c906108c SS |
2516 | if (!varseen) |
2517 | { | |
2518 | varseen = 1; | |
2519 | } | |
11470e70 | 2520 | gdb_printf (("$%s = "), var.name.c_str ()); |
c709acd1 | 2521 | |
a70b8144 | 2522 | try |
c709acd1 PA |
2523 | { |
2524 | struct value *val; | |
2525 | ||
11470e70 | 2526 | val = value_of_internalvar (gdbarch, &var); |
c709acd1 PA |
2527 | value_print (val, gdb_stdout, &opts); |
2528 | } | |
230d2906 | 2529 | catch (const gdb_exception_error &ex) |
492d29ea | 2530 | { |
7f6aba03 TT |
2531 | fprintf_styled (gdb_stdout, metadata_style.style (), |
2532 | _("<error: %s>"), ex.what ()); | |
492d29ea | 2533 | } |
492d29ea | 2534 | |
6cb06a8c | 2535 | gdb_printf (("\n")); |
c906108c SS |
2536 | } |
2537 | if (!varseen) | |
f47f77df DE |
2538 | { |
2539 | /* This text does not mention convenience functions on purpose. | |
2540 | The user can't create them except via Python, and if Python support | |
2541 | is installed this message will never be printed ($_streq will | |
2542 | exist). */ | |
6cb06a8c TT |
2543 | gdb_printf (_("No debugger convenience variables now defined.\n" |
2544 | "Convenience variables have " | |
2545 | "names starting with \"$\";\n" | |
2546 | "use \"set\" as in \"set " | |
2547 | "$foo = 5\" to define them.\n")); | |
f47f77df | 2548 | } |
c906108c SS |
2549 | } |
2550 | \f | |
ba18742c SM |
2551 | |
2552 | /* See value.h. */ | |
e81e7f5e SC |
2553 | |
2554 | struct value * | |
6bd5c754 | 2555 | value::from_xmethod (xmethod_worker_up &&worker) |
e81e7f5e | 2556 | { |
ba18742c | 2557 | struct value *v; |
e81e7f5e | 2558 | |
99d9c3b9 | 2559 | v = value::allocate (builtin_type (current_inferior ()->arch ())->xmethod); |
382d927f TT |
2560 | v->m_lval = lval_xcallable; |
2561 | v->m_location.xm_worker = worker.release (); | |
b2227e67 | 2562 | v->m_modifiable = false; |
e81e7f5e | 2563 | |
ba18742c | 2564 | return v; |
e81e7f5e SC |
2565 | } |
2566 | ||
6bd5c754 | 2567 | /* See value.h. */ |
2ce1cdbf DE |
2568 | |
2569 | struct type * | |
6bd5c754 | 2570 | value::result_type_of_xmethod (gdb::array_view<value *> argv) |
2ce1cdbf | 2571 | { |
6bd5c754 TT |
2572 | gdb_assert (type ()->code () == TYPE_CODE_XMETHOD |
2573 | && m_lval == lval_xcallable && !argv.empty ()); | |
2ce1cdbf | 2574 | |
6bd5c754 | 2575 | return m_location.xm_worker->get_result_type (argv[0], argv.slice (1)); |
2ce1cdbf DE |
2576 | } |
2577 | ||
6bd5c754 | 2578 | /* See value.h. */ |
e81e7f5e SC |
2579 | |
2580 | struct value * | |
6bd5c754 | 2581 | value::call_xmethod (gdb::array_view<value *> argv) |
e81e7f5e | 2582 | { |
6bd5c754 TT |
2583 | gdb_assert (type ()->code () == TYPE_CODE_XMETHOD |
2584 | && m_lval == lval_xcallable && !argv.empty ()); | |
e81e7f5e | 2585 | |
6bd5c754 | 2586 | return m_location.xm_worker->invoke (argv[0], argv.slice (1)); |
e81e7f5e SC |
2587 | } |
2588 | \f | |
c906108c SS |
2589 | /* Extract a value as a C number (either long or double). |
2590 | Knows how to convert fixed values to double, or | |
2591 | floating values to long. | |
2592 | Does not deallocate the value. */ | |
2593 | ||
2594 | LONGEST | |
f23631e4 | 2595 | value_as_long (struct value *val) |
c906108c SS |
2596 | { |
2597 | /* This coerces arrays and functions, which is necessary (e.g. | |
2598 | in disassemble_command). It also dereferences references, which | |
2599 | I suspect is the most logical thing to do. */ | |
994b9211 | 2600 | val = coerce_array (val); |
efaf1ae0 | 2601 | return unpack_long (val->type (), val->contents ().data ()); |
c906108c SS |
2602 | } |
2603 | ||
4db6e7aa TT |
2604 | /* See value.h. */ |
2605 | ||
2606 | gdb_mpz | |
2607 | value_as_mpz (struct value *val) | |
2608 | { | |
2609 | val = coerce_array (val); | |
2610 | struct type *type = check_typedef (val->type ()); | |
2611 | ||
2612 | switch (type->code ()) | |
2613 | { | |
2614 | case TYPE_CODE_ENUM: | |
2615 | case TYPE_CODE_BOOL: | |
2616 | case TYPE_CODE_INT: | |
2617 | case TYPE_CODE_CHAR: | |
2618 | case TYPE_CODE_RANGE: | |
2619 | break; | |
2620 | ||
2621 | default: | |
2622 | return gdb_mpz (value_as_long (val)); | |
2623 | } | |
2624 | ||
2625 | gdb_mpz result; | |
2626 | ||
2627 | gdb::array_view<const gdb_byte> valbytes = val->contents (); | |
2628 | enum bfd_endian byte_order = type_byte_order (type); | |
2629 | ||
2630 | /* Handle integers that are either not a multiple of the word size, | |
2631 | or that are stored at some bit offset. */ | |
2632 | unsigned bit_off = 0, bit_size = 0; | |
2633 | if (type->bit_size_differs_p ()) | |
2634 | { | |
2635 | bit_size = type->bit_size (); | |
2636 | if (bit_size == 0) | |
2637 | { | |
2638 | /* We can just handle this immediately. */ | |
2639 | return result; | |
2640 | } | |
2641 | ||
2642 | bit_off = type->bit_offset (); | |
2643 | ||
2644 | unsigned n_bytes = ((bit_off % 8) + bit_size + 7) / 8; | |
2645 | valbytes = valbytes.slice (bit_off / 8, n_bytes); | |
2646 | ||
2647 | if (byte_order == BFD_ENDIAN_BIG) | |
2648 | bit_off = (n_bytes * 8 - bit_off % 8 - bit_size); | |
2649 | else | |
2650 | bit_off %= 8; | |
2651 | } | |
2652 | ||
2653 | result.read (val->contents (), byte_order, type->is_unsigned ()); | |
2654 | ||
2655 | /* Shift off any low bits, if needed. */ | |
2656 | if (bit_off != 0) | |
2657 | result >>= bit_off; | |
2658 | ||
2659 | /* Mask off any high bits, if needed. */ | |
2660 | if (bit_size) | |
2661 | result.mask (bit_size); | |
2662 | ||
2663 | /* Now handle any range bias. */ | |
2664 | if (type->code () == TYPE_CODE_RANGE && type->bounds ()->bias != 0) | |
2665 | { | |
2666 | /* Unfortunately we have to box here, because LONGEST is | |
2667 | probably wider than long. */ | |
2668 | result += gdb_mpz (type->bounds ()->bias); | |
2669 | } | |
2670 | ||
2671 | return result; | |
2672 | } | |
2673 | ||
f4d9bc83 AB |
2674 | /* Extract a value as a C pointer. */ |
2675 | ||
c906108c | 2676 | CORE_ADDR |
f23631e4 | 2677 | value_as_address (struct value *val) |
c906108c | 2678 | { |
d0c97917 | 2679 | struct gdbarch *gdbarch = val->type ()->arch (); |
50810684 | 2680 | |
c906108c SS |
2681 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure |
2682 | whether we want this to be true eventually. */ | |
2683 | #if 0 | |
bf6ae464 | 2684 | /* gdbarch_addr_bits_remove is wrong if we are being called for a |
c906108c SS |
2685 | non-address (e.g. argument to "signal", "info break", etc.), or |
2686 | for pointers to char, in which the low bits *are* significant. */ | |
50810684 | 2687 | return gdbarch_addr_bits_remove (gdbarch, value_as_long (val)); |
c906108c | 2688 | #else |
f312f057 JB |
2689 | |
2690 | /* There are several targets (IA-64, PowerPC, and others) which | |
2691 | don't represent pointers to functions as simply the address of | |
2692 | the function's entry point. For example, on the IA-64, a | |
2693 | function pointer points to a two-word descriptor, generated by | |
2694 | the linker, which contains the function's entry point, and the | |
2695 | value the IA-64 "global pointer" register should have --- to | |
2696 | support position-independent code. The linker generates | |
2697 | descriptors only for those functions whose addresses are taken. | |
2698 | ||
2699 | On such targets, it's difficult for GDB to convert an arbitrary | |
2700 | function address into a function pointer; it has to either find | |
2701 | an existing descriptor for that function, or call malloc and | |
2702 | build its own. On some targets, it is impossible for GDB to | |
2703 | build a descriptor at all: the descriptor must contain a jump | |
2704 | instruction; data memory cannot be executed; and code memory | |
2705 | cannot be modified. | |
2706 | ||
2707 | Upon entry to this function, if VAL is a value of type `function' | |
d0c97917 | 2708 | (that is, TYPE_CODE (val->type ()) == TYPE_CODE_FUNC), then |
9feb2d07 | 2709 | val->address () is the address of the function. This is what |
f312f057 JB |
2710 | you'll get if you evaluate an expression like `main'. The call |
2711 | to COERCE_ARRAY below actually does all the usual unary | |
2712 | conversions, which includes converting values of type `function' | |
2713 | to `pointer to function'. This is the challenging conversion | |
f4d9bc83 | 2714 | discussed above. Then, `unpack_pointer' will convert that pointer |
f312f057 JB |
2715 | back into an address. |
2716 | ||
2717 | So, suppose the user types `disassemble foo' on an architecture | |
2718 | with a strange function pointer representation, on which GDB | |
2719 | cannot build its own descriptors, and suppose further that `foo' | |
2720 | has no linker-built descriptor. The address->pointer conversion | |
2721 | will signal an error and prevent the command from running, even | |
2722 | though the next step would have been to convert the pointer | |
2723 | directly back into the same address. | |
2724 | ||
2725 | The following shortcut avoids this whole mess. If VAL is a | |
2726 | function, just return its address directly. */ | |
d0c97917 TT |
2727 | if (val->type ()->code () == TYPE_CODE_FUNC |
2728 | || val->type ()->code () == TYPE_CODE_METHOD) | |
9feb2d07 | 2729 | return val->address (); |
f312f057 | 2730 | |
994b9211 | 2731 | val = coerce_array (val); |
fc0c74b1 AC |
2732 | |
2733 | /* Some architectures (e.g. Harvard), map instruction and data | |
2734 | addresses onto a single large unified address space. For | |
2735 | instance: An architecture may consider a large integer in the | |
2736 | range 0x10000000 .. 0x1000ffff to already represent a data | |
2737 | addresses (hence not need a pointer to address conversion) while | |
2738 | a small integer would still need to be converted integer to | |
2739 | pointer to address. Just assume such architectures handle all | |
2740 | integer conversions in a single function. */ | |
2741 | ||
2742 | /* JimB writes: | |
2743 | ||
2744 | I think INTEGER_TO_ADDRESS is a good idea as proposed --- but we | |
2745 | must admonish GDB hackers to make sure its behavior matches the | |
2746 | compiler's, whenever possible. | |
2747 | ||
2748 | In general, I think GDB should evaluate expressions the same way | |
2749 | the compiler does. When the user copies an expression out of | |
2750 | their source code and hands it to a `print' command, they should | |
2751 | get the same value the compiler would have computed. Any | |
2752 | deviation from this rule can cause major confusion and annoyance, | |
2753 | and needs to be justified carefully. In other words, GDB doesn't | |
2754 | really have the freedom to do these conversions in clever and | |
2755 | useful ways. | |
2756 | ||
2757 | AndrewC pointed out that users aren't complaining about how GDB | |
2758 | casts integers to pointers; they are complaining that they can't | |
2759 | take an address from a disassembly listing and give it to `x/i'. | |
2760 | This is certainly important. | |
2761 | ||
79dd2d24 | 2762 | Adding an architecture method like integer_to_address() certainly |
fc0c74b1 AC |
2763 | makes it possible for GDB to "get it right" in all circumstances |
2764 | --- the target has complete control over how things get done, so | |
2765 | people can Do The Right Thing for their target without breaking | |
2766 | anyone else. The standard doesn't specify how integers get | |
2767 | converted to pointers; usually, the ABI doesn't either, but | |
2768 | ABI-specific code is a more reasonable place to handle it. */ | |
2769 | ||
d0c97917 | 2770 | if (!val->type ()->is_pointer_or_reference () |
50810684 | 2771 | && gdbarch_integer_to_address_p (gdbarch)) |
d0c97917 | 2772 | return gdbarch_integer_to_address (gdbarch, val->type (), |
efaf1ae0 | 2773 | val->contents ().data ()); |
fc0c74b1 | 2774 | |
f4d9bc83 | 2775 | return unpack_pointer (val->type (), val->contents ().data ()); |
c906108c SS |
2776 | #endif |
2777 | } | |
2778 | \f | |
2779 | /* Unpack raw data (copied from debugee, target byte order) at VALADDR | |
2780 | as a long, or as a double, assuming the raw data is described | |
2781 | by type TYPE. Knows how to convert different sizes of values | |
2782 | and can convert between fixed and floating point. We don't assume | |
2783 | any alignment for the raw data. Return value is in host byte order. | |
2784 | ||
2785 | If you want functions and arrays to be coerced to pointers, and | |
2786 | references to be dereferenced, call value_as_long() instead. | |
2787 | ||
2788 | C++: It is assumed that the front-end has taken care of | |
2789 | all matters concerning pointers to members. A pointer | |
2790 | to member which reaches here is considered to be equivalent | |
2791 | to an INT (or some size). After all, it is only an offset. */ | |
2792 | ||
2793 | LONGEST | |
fc1a4b47 | 2794 | unpack_long (struct type *type, const gdb_byte *valaddr) |
c906108c | 2795 | { |
09584414 | 2796 | if (is_fixed_point_type (type)) |
d19937a7 | 2797 | type = type->fixed_point_type_base_type (); |
09584414 | 2798 | |
34877895 | 2799 | enum bfd_endian byte_order = type_byte_order (type); |
78134374 | 2800 | enum type_code code = type->code (); |
df86565b | 2801 | int len = type->length (); |
c6d940a9 | 2802 | int nosign = type->is_unsigned (); |
c906108c | 2803 | |
c906108c SS |
2804 | switch (code) |
2805 | { | |
2806 | case TYPE_CODE_TYPEDEF: | |
2807 | return unpack_long (check_typedef (type), valaddr); | |
2808 | case TYPE_CODE_ENUM: | |
4f2aea11 | 2809 | case TYPE_CODE_FLAGS: |
c906108c SS |
2810 | case TYPE_CODE_BOOL: |
2811 | case TYPE_CODE_INT: | |
2812 | case TYPE_CODE_CHAR: | |
2813 | case TYPE_CODE_RANGE: | |
0d5de010 | 2814 | case TYPE_CODE_MEMBERPTR: |
4e962e74 TT |
2815 | { |
2816 | LONGEST result; | |
20a5fcbd TT |
2817 | |
2818 | if (type->bit_size_differs_p ()) | |
2819 | { | |
2820 | unsigned bit_off = type->bit_offset (); | |
2821 | unsigned bit_size = type->bit_size (); | |
2822 | if (bit_size == 0) | |
2823 | { | |
2824 | /* unpack_bits_as_long doesn't handle this case the | |
2825 | way we'd like, so handle it here. */ | |
2826 | result = 0; | |
2827 | } | |
2828 | else | |
2829 | result = unpack_bits_as_long (type, valaddr, bit_off, bit_size); | |
2830 | } | |
4e962e74 | 2831 | else |
20a5fcbd TT |
2832 | { |
2833 | if (nosign) | |
2834 | result = extract_unsigned_integer (valaddr, len, byte_order); | |
2835 | else | |
2836 | result = extract_signed_integer (valaddr, len, byte_order); | |
2837 | } | |
4e962e74 | 2838 | if (code == TYPE_CODE_RANGE) |
599088e3 | 2839 | result += type->bounds ()->bias; |
4e962e74 TT |
2840 | return result; |
2841 | } | |
c906108c SS |
2842 | |
2843 | case TYPE_CODE_FLT: | |
4ef30785 | 2844 | case TYPE_CODE_DECFLOAT: |
50637b26 | 2845 | return target_float_to_longest (valaddr, type); |
4ef30785 | 2846 | |
09584414 JB |
2847 | case TYPE_CODE_FIXED_POINT: |
2848 | { | |
2849 | gdb_mpq vq; | |
c9f0b43f JB |
2850 | vq.read_fixed_point (gdb::make_array_view (valaddr, len), |
2851 | byte_order, nosign, | |
e6fcee3a | 2852 | type->fixed_point_scaling_factor ()); |
09584414 | 2853 | |
302273ca | 2854 | gdb_mpz vz = vq.as_integer (); |
09584414 JB |
2855 | return vz.as_integer<LONGEST> (); |
2856 | } | |
2857 | ||
c906108c SS |
2858 | case TYPE_CODE_PTR: |
2859 | case TYPE_CODE_REF: | |
aa006118 | 2860 | case TYPE_CODE_RVALUE_REF: |
c906108c | 2861 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure |
dda83cd7 | 2862 | whether we want this to be true eventually. */ |
4478b372 | 2863 | return extract_typed_address (valaddr, type); |
c906108c | 2864 | |
c906108c | 2865 | default: |
8a3fe4f8 | 2866 | error (_("Value can't be converted to integer.")); |
c906108c | 2867 | } |
c906108c SS |
2868 | } |
2869 | ||
c906108c SS |
2870 | /* Unpack raw data (copied from debugee, target byte order) at VALADDR |
2871 | as a CORE_ADDR, assuming the raw data is described by type TYPE. | |
2872 | We don't assume any alignment for the raw data. Return value is in | |
2873 | host byte order. | |
2874 | ||
2875 | If you want functions and arrays to be coerced to pointers, and | |
1aa20aa8 | 2876 | references to be dereferenced, call value_as_address() instead. |
c906108c SS |
2877 | |
2878 | C++: It is assumed that the front-end has taken care of | |
2879 | all matters concerning pointers to members. A pointer | |
2880 | to member which reaches here is considered to be equivalent | |
2881 | to an INT (or some size). After all, it is only an offset. */ | |
2882 | ||
2883 | CORE_ADDR | |
fc1a4b47 | 2884 | unpack_pointer (struct type *type, const gdb_byte *valaddr) |
c906108c SS |
2885 | { |
2886 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure | |
2887 | whether we want this to be true eventually. */ | |
2888 | return unpack_long (type, valaddr); | |
2889 | } | |
4478b372 | 2890 | |
70100014 UW |
2891 | bool |
2892 | is_floating_value (struct value *val) | |
2893 | { | |
d0c97917 | 2894 | struct type *type = check_typedef (val->type ()); |
70100014 UW |
2895 | |
2896 | if (is_floating_type (type)) | |
2897 | { | |
efaf1ae0 | 2898 | if (!target_float_is_valid (val->contents ().data (), type)) |
70100014 UW |
2899 | error (_("Invalid floating value found in program.")); |
2900 | return true; | |
2901 | } | |
2902 | ||
2903 | return false; | |
2904 | } | |
2905 | ||
c906108c | 2906 | \f |
1596cb5d | 2907 | /* Get the value of the FIELDNO'th field (which must be static) of |
686d4def | 2908 | TYPE. */ |
c906108c | 2909 | |
f23631e4 | 2910 | struct value * |
fba45db2 | 2911 | value_static_field (struct type *type, int fieldno) |
c906108c | 2912 | { |
948e66d9 DJ |
2913 | struct value *retval; |
2914 | ||
2ad53ea1 | 2915 | switch (type->field (fieldno).loc_kind ()) |
c906108c | 2916 | { |
1596cb5d | 2917 | case FIELD_LOC_KIND_PHYSADDR: |
940da03e | 2918 | retval = value_at_lazy (type->field (fieldno).type (), |
e06c3e11 | 2919 | type->field (fieldno).loc_physaddr ()); |
1596cb5d DE |
2920 | break; |
2921 | case FIELD_LOC_KIND_PHYSNAME: | |
c906108c | 2922 | { |
fcbbbd90 | 2923 | const char *phys_name = type->field (fieldno).loc_physname (); |
33d16dd9 | 2924 | /* type->field (fieldno).name (); */ |
d12307c1 | 2925 | struct block_symbol sym = lookup_symbol (phys_name, 0, VAR_DOMAIN, 0); |
94af9270 | 2926 | |
d12307c1 | 2927 | if (sym.symbol == NULL) |
c906108c | 2928 | { |
a109c7c1 | 2929 | /* With some compilers, e.g. HP aCC, static data members are |
581e13c1 | 2930 | reported as non-debuggable symbols. */ |
3b7344d5 TT |
2931 | struct bound_minimal_symbol msym |
2932 | = lookup_minimal_symbol (phys_name, NULL, NULL); | |
940da03e | 2933 | struct type *field_type = type->field (fieldno).type (); |
a109c7c1 | 2934 | |
3b7344d5 | 2935 | if (!msym.minsym) |
b27556e3 | 2936 | retval = value::allocate_optimized_out (field_type); |
c906108c | 2937 | else |
4aeddc50 | 2938 | retval = value_at_lazy (field_type, msym.value_address ()); |
c906108c SS |
2939 | } |
2940 | else | |
d12307c1 | 2941 | retval = value_of_variable (sym.symbol, sym.block); |
1596cb5d | 2942 | break; |
c906108c | 2943 | } |
1596cb5d | 2944 | default: |
f3574227 | 2945 | gdb_assert_not_reached ("unexpected field location kind"); |
1596cb5d DE |
2946 | } |
2947 | ||
948e66d9 | 2948 | return retval; |
c906108c SS |
2949 | } |
2950 | ||
4dfea560 DE |
2951 | /* Change the enclosing type of a value object VAL to NEW_ENCL_TYPE. |
2952 | You have to be careful here, since the size of the data area for the value | |
2953 | is set by the length of the enclosing type. So if NEW_ENCL_TYPE is bigger | |
2954 | than the old enclosing type, you have to allocate more space for the | |
2955 | data. */ | |
2b127877 | 2956 | |
4dfea560 | 2957 | void |
463b870d | 2958 | value::set_enclosing_type (struct type *new_encl_type) |
2b127877 | 2959 | { |
463b870d | 2960 | if (new_encl_type->length () > enclosing_type ()->length ()) |
5fdf6324 AB |
2961 | { |
2962 | check_type_length_before_alloc (new_encl_type); | |
463b870d TT |
2963 | m_contents.reset ((gdb_byte *) xrealloc (m_contents.release (), |
2964 | new_encl_type->length ())); | |
5fdf6324 | 2965 | } |
3e3d7139 | 2966 | |
463b870d | 2967 | m_enclosing_type = new_encl_type; |
2b127877 DB |
2968 | } |
2969 | ||
6c49729e | 2970 | /* See value.h. */ |
c906108c | 2971 | |
f23631e4 | 2972 | struct value * |
6c49729e | 2973 | value::primitive_field (LONGEST offset, int fieldno, struct type *arg_type) |
c906108c | 2974 | { |
f23631e4 | 2975 | struct value *v; |
52f0bd74 | 2976 | struct type *type; |
6c49729e | 2977 | int unit_size = gdbarch_addressable_memory_unit_size (arch ()); |
c906108c | 2978 | |
f168693b | 2979 | arg_type = check_typedef (arg_type); |
940da03e | 2980 | type = arg_type->field (fieldno).type (); |
c54eabfa JK |
2981 | |
2982 | /* Call check_typedef on our type to make sure that, if TYPE | |
2983 | is a TYPE_CODE_TYPEDEF, its length is set to the length | |
2984 | of the target type instead of zero. However, we do not | |
2985 | replace the typedef type by the target type, because we want | |
2986 | to keep the typedef in order to be able to print the type | |
2987 | description correctly. */ | |
2988 | check_typedef (type); | |
c906108c | 2989 | |
3757d2d4 | 2990 | if (arg_type->field (fieldno).bitsize ()) |
c906108c | 2991 | { |
22c05d8a JK |
2992 | /* Handle packed fields. |
2993 | ||
2994 | Create a new value for the bitfield, with bitpos and bitsize | |
4ea48cc1 DJ |
2995 | set. If possible, arrange offset and bitpos so that we can |
2996 | do a single aligned read of the size of the containing type. | |
2997 | Otherwise, adjust offset to the byte containing the first | |
2998 | bit. Assume that the address, offset, and embedded offset | |
2999 | are sufficiently aligned. */ | |
22c05d8a | 3000 | |
b610c045 | 3001 | LONGEST bitpos = arg_type->field (fieldno).loc_bitpos (); |
df86565b | 3002 | LONGEST container_bitsize = type->length () * 8; |
4ea48cc1 | 3003 | |
cbe793af | 3004 | v = value::allocate_lazy (type); |
3757d2d4 | 3005 | v->set_bitsize (arg_type->field (fieldno).bitsize ()); |
fcf86fe5 | 3006 | if ((bitpos % container_bitsize) + v->bitsize () <= container_bitsize |
df86565b | 3007 | && type->length () <= (int) sizeof (LONGEST)) |
fcf86fe5 | 3008 | v->set_bitpos (bitpos % container_bitsize); |
4ea48cc1 | 3009 | else |
fcf86fe5 | 3010 | v->set_bitpos (bitpos % 8); |
6c49729e | 3011 | v->set_offset ((embedded_offset () |
fcf86fe5 TT |
3012 | + offset |
3013 | + (bitpos - v->bitpos ()) / 8)); | |
6c49729e TT |
3014 | v->set_parent (this); |
3015 | if (!lazy ()) | |
78259c36 | 3016 | v->fetch_lazy (); |
c906108c SS |
3017 | } |
3018 | else if (fieldno < TYPE_N_BASECLASSES (arg_type)) | |
3019 | { | |
3020 | /* This field is actually a base subobject, so preserve the | |
39d37385 PA |
3021 | entire object's contents for later references to virtual |
3022 | bases, etc. */ | |
6b850546 | 3023 | LONGEST boffset; |
a4e2ee12 DJ |
3024 | |
3025 | /* Lazy register values with offsets are not supported. */ | |
736355f2 | 3026 | if (this->lval () == lval_register && lazy ()) |
6c49729e | 3027 | fetch_lazy (); |
a4e2ee12 | 3028 | |
9a0dc9e3 PA |
3029 | /* We special case virtual inheritance here because this |
3030 | requires access to the contents, which we would rather avoid | |
3031 | for references to ordinary fields of unavailable values. */ | |
3032 | if (BASETYPE_VIA_VIRTUAL (arg_type, fieldno)) | |
3033 | boffset = baseclass_offset (arg_type, fieldno, | |
6c49729e TT |
3034 | contents ().data (), |
3035 | embedded_offset (), | |
3036 | address (), | |
3037 | this); | |
c906108c | 3038 | else |
b610c045 | 3039 | boffset = arg_type->field (fieldno).loc_bitpos () / 8; |
691a26f5 | 3040 | |
6c49729e TT |
3041 | if (lazy ()) |
3042 | v = value::allocate_lazy (enclosing_type ()); | |
9a0dc9e3 PA |
3043 | else |
3044 | { | |
6c49729e TT |
3045 | v = value::allocate (enclosing_type ()); |
3046 | contents_copy_raw (v, 0, 0, enclosing_type ()->length ()); | |
3e3d7139 | 3047 | } |
fcf86fe5 | 3048 | v->deprecated_set_type (type); |
6c49729e TT |
3049 | v->set_offset (this->offset ()); |
3050 | v->set_embedded_offset (offset + embedded_offset () + boffset); | |
c906108c | 3051 | } |
9920b434 BH |
3052 | else if (NULL != TYPE_DATA_LOCATION (type)) |
3053 | { | |
3054 | /* Field is a dynamic data member. */ | |
3055 | ||
3056 | gdb_assert (0 == offset); | |
3057 | /* We expect an already resolved data location. */ | |
9c0fb734 | 3058 | gdb_assert (TYPE_DATA_LOCATION (type)->is_constant ()); |
9920b434 | 3059 | /* For dynamic data types defer memory allocation |
dda83cd7 | 3060 | until we actual access the value. */ |
cbe793af | 3061 | v = value::allocate_lazy (type); |
9920b434 | 3062 | } |
c906108c SS |
3063 | else |
3064 | { | |
3065 | /* Plain old data member */ | |
b610c045 | 3066 | offset += (arg_type->field (fieldno).loc_bitpos () |
dda83cd7 | 3067 | / (HOST_CHAR_BIT * unit_size)); |
a4e2ee12 DJ |
3068 | |
3069 | /* Lazy register values with offsets are not supported. */ | |
736355f2 | 3070 | if (this->lval () == lval_register && lazy ()) |
6c49729e | 3071 | fetch_lazy (); |
a4e2ee12 | 3072 | |
6c49729e | 3073 | if (lazy ()) |
cbe793af | 3074 | v = value::allocate_lazy (type); |
c906108c | 3075 | else |
3e3d7139 | 3076 | { |
317c3ed9 | 3077 | v = value::allocate (type); |
6c49729e TT |
3078 | contents_copy_raw (v, v->embedded_offset (), |
3079 | embedded_offset () + offset, | |
3080 | type_length_units (type)); | |
3e3d7139 | 3081 | } |
6c49729e | 3082 | v->set_offset (this->offset () + offset + embedded_offset ()); |
c906108c | 3083 | } |
6c49729e | 3084 | v->set_component_location (this); |
c906108c SS |
3085 | return v; |
3086 | } | |
3087 | ||
3088 | /* Given a value ARG1 of a struct or union type, | |
3089 | extract and return the value of one of its (non-static) fields. | |
581e13c1 | 3090 | FIELDNO says which field. */ |
c906108c | 3091 | |
f23631e4 | 3092 | struct value * |
aa1ee363 | 3093 | value_field (struct value *arg1, int fieldno) |
c906108c | 3094 | { |
6c49729e | 3095 | return arg1->primitive_field (0, fieldno, arg1->type ()); |
c906108c SS |
3096 | } |
3097 | ||
3098 | /* Return a non-virtual function as a value. | |
3099 | F is the list of member functions which contains the desired method. | |
0478d61c FF |
3100 | J is an index into F which provides the desired method. |
3101 | ||
3102 | We only use the symbol for its address, so be happy with either a | |
581e13c1 | 3103 | full symbol or a minimal symbol. */ |
c906108c | 3104 | |
f23631e4 | 3105 | struct value * |
3e43a32a MS |
3106 | value_fn_field (struct value **arg1p, struct fn_field *f, |
3107 | int j, struct type *type, | |
6b850546 | 3108 | LONGEST offset) |
c906108c | 3109 | { |
f23631e4 | 3110 | struct value *v; |
52f0bd74 | 3111 | struct type *ftype = TYPE_FN_FIELD_TYPE (f, j); |
1d06ead6 | 3112 | const char *physname = TYPE_FN_FIELD_PHYSNAME (f, j); |
c906108c | 3113 | struct symbol *sym; |
7c7b6655 | 3114 | struct bound_minimal_symbol msym; |
c906108c | 3115 | |
d12307c1 | 3116 | sym = lookup_symbol (physname, 0, VAR_DOMAIN, 0).symbol; |
29ba33db | 3117 | if (sym == nullptr) |
0478d61c | 3118 | { |
7c7b6655 TT |
3119 | msym = lookup_bound_minimal_symbol (physname); |
3120 | if (msym.minsym == NULL) | |
5ae326fa | 3121 | return NULL; |
0478d61c FF |
3122 | } |
3123 | ||
317c3ed9 | 3124 | v = value::allocate (ftype); |
6f9c9d71 | 3125 | v->set_lval (lval_memory); |
0478d61c FF |
3126 | if (sym) |
3127 | { | |
9feb2d07 | 3128 | v->set_address (sym->value_block ()->entry_pc ()); |
0478d61c FF |
3129 | } |
3130 | else | |
3131 | { | |
bccdca4a UW |
3132 | /* The minimal symbol might point to a function descriptor; |
3133 | resolve it to the actual code address instead. */ | |
7c7b6655 | 3134 | struct objfile *objfile = msym.objfile; |
08feed99 | 3135 | struct gdbarch *gdbarch = objfile->arch (); |
bccdca4a | 3136 | |
9feb2d07 TT |
3137 | v->set_address (gdbarch_convert_from_func_ptr_addr |
3138 | (gdbarch, msym.value_address (), | |
3139 | current_inferior ()->top_target ())); | |
0478d61c | 3140 | } |
c906108c SS |
3141 | |
3142 | if (arg1p) | |
c5aa993b | 3143 | { |
d0c97917 | 3144 | if (type != (*arg1p)->type ()) |
c5aa993b JM |
3145 | *arg1p = value_ind (value_cast (lookup_pointer_type (type), |
3146 | value_addr (*arg1p))); | |
3147 | ||
070ad9f0 | 3148 | /* Move the `this' pointer according to the offset. |
76675c4d | 3149 | (*arg1p)->offset () += offset; */ |
c906108c SS |
3150 | } |
3151 | ||
3152 | return v; | |
3153 | } | |
3154 | ||
c906108c | 3155 | \f |
c906108c | 3156 | |
ef83a141 TT |
3157 | /* See value.h. */ |
3158 | ||
3159 | LONGEST | |
4875ffdb | 3160 | unpack_bits_as_long (struct type *field_type, const gdb_byte *valaddr, |
6b850546 | 3161 | LONGEST bitpos, LONGEST bitsize) |
c906108c | 3162 | { |
34877895 | 3163 | enum bfd_endian byte_order = type_byte_order (field_type); |
c906108c SS |
3164 | ULONGEST val; |
3165 | ULONGEST valmask; | |
c906108c | 3166 | int lsbcount; |
6b850546 DT |
3167 | LONGEST bytes_read; |
3168 | LONGEST read_offset; | |
c906108c | 3169 | |
4a76eae5 DJ |
3170 | /* Read the minimum number of bytes required; there may not be |
3171 | enough bytes to read an entire ULONGEST. */ | |
f168693b | 3172 | field_type = check_typedef (field_type); |
4a76eae5 DJ |
3173 | if (bitsize) |
3174 | bytes_read = ((bitpos % 8) + bitsize + 7) / 8; | |
3175 | else | |
15ce8941 | 3176 | { |
df86565b | 3177 | bytes_read = field_type->length (); |
15ce8941 TT |
3178 | bitsize = 8 * bytes_read; |
3179 | } | |
4a76eae5 | 3180 | |
5467c6c8 PA |
3181 | read_offset = bitpos / 8; |
3182 | ||
4875ffdb | 3183 | val = extract_unsigned_integer (valaddr + read_offset, |
4a76eae5 | 3184 | bytes_read, byte_order); |
c906108c | 3185 | |
581e13c1 | 3186 | /* Extract bits. See comment above. */ |
c906108c | 3187 | |
d5a22e77 | 3188 | if (byte_order == BFD_ENDIAN_BIG) |
4a76eae5 | 3189 | lsbcount = (bytes_read * 8 - bitpos % 8 - bitsize); |
c906108c SS |
3190 | else |
3191 | lsbcount = (bitpos % 8); | |
3192 | val >>= lsbcount; | |
3193 | ||
3194 | /* If the field does not entirely fill a LONGEST, then zero the sign bits. | |
581e13c1 | 3195 | If the field is signed, and is negative, then sign extend. */ |
c906108c | 3196 | |
15ce8941 | 3197 | if (bitsize < 8 * (int) sizeof (val)) |
c906108c SS |
3198 | { |
3199 | valmask = (((ULONGEST) 1) << bitsize) - 1; | |
3200 | val &= valmask; | |
c6d940a9 | 3201 | if (!field_type->is_unsigned ()) |
c906108c SS |
3202 | { |
3203 | if (val & (valmask ^ (valmask >> 1))) | |
3204 | { | |
3205 | val |= ~valmask; | |
3206 | } | |
3207 | } | |
3208 | } | |
5467c6c8 | 3209 | |
4875ffdb | 3210 | return val; |
5467c6c8 PA |
3211 | } |
3212 | ||
3213 | /* Unpack a field FIELDNO of the specified TYPE, from the object at | |
3214 | VALADDR + EMBEDDED_OFFSET. VALADDR points to the contents of | |
3215 | ORIGINAL_VALUE, which must not be NULL. See | |
3216 | unpack_value_bits_as_long for more details. */ | |
3217 | ||
3218 | int | |
3219 | unpack_value_field_as_long (struct type *type, const gdb_byte *valaddr, | |
6b850546 | 3220 | LONGEST embedded_offset, int fieldno, |
5467c6c8 PA |
3221 | const struct value *val, LONGEST *result) |
3222 | { | |
b610c045 | 3223 | int bitpos = type->field (fieldno).loc_bitpos (); |
3757d2d4 | 3224 | int bitsize = type->field (fieldno).bitsize (); |
940da03e | 3225 | struct type *field_type = type->field (fieldno).type (); |
4875ffdb PA |
3226 | int bit_offset; |
3227 | ||
5467c6c8 PA |
3228 | gdb_assert (val != NULL); |
3229 | ||
4875ffdb | 3230 | bit_offset = embedded_offset * TARGET_CHAR_BIT + bitpos; |
d00664db TT |
3231 | if (val->bits_any_optimized_out (bit_offset, bitsize) |
3232 | || !val->bits_available (bit_offset, bitsize)) | |
4875ffdb PA |
3233 | return 0; |
3234 | ||
3235 | *result = unpack_bits_as_long (field_type, valaddr + embedded_offset, | |
3236 | bitpos, bitsize); | |
3237 | return 1; | |
5467c6c8 PA |
3238 | } |
3239 | ||
3240 | /* Unpack a field FIELDNO of the specified TYPE, from the anonymous | |
4875ffdb | 3241 | object at VALADDR. See unpack_bits_as_long for more details. */ |
5467c6c8 PA |
3242 | |
3243 | LONGEST | |
3244 | unpack_field_as_long (struct type *type, const gdb_byte *valaddr, int fieldno) | |
3245 | { | |
b610c045 | 3246 | int bitpos = type->field (fieldno).loc_bitpos (); |
3757d2d4 | 3247 | int bitsize = type->field (fieldno).bitsize (); |
940da03e | 3248 | struct type *field_type = type->field (fieldno).type (); |
5467c6c8 | 3249 | |
4875ffdb PA |
3250 | return unpack_bits_as_long (field_type, valaddr, bitpos, bitsize); |
3251 | } | |
3252 | ||
6c49729e | 3253 | /* See value.h. */ |
4875ffdb | 3254 | |
bb9d5f81 | 3255 | void |
6c49729e TT |
3256 | value::unpack_bitfield (struct value *dest_val, |
3257 | LONGEST bitpos, LONGEST bitsize, | |
3258 | const gdb_byte *valaddr, LONGEST embedded_offset) | |
3259 | const | |
4875ffdb PA |
3260 | { |
3261 | enum bfd_endian byte_order; | |
3262 | int src_bit_offset; | |
3263 | int dst_bit_offset; | |
d0c97917 | 3264 | struct type *field_type = dest_val->type (); |
4875ffdb | 3265 | |
34877895 | 3266 | byte_order = type_byte_order (field_type); |
e5ca03b4 PA |
3267 | |
3268 | /* First, unpack and sign extend the bitfield as if it was wholly | |
3269 | valid. Optimized out/unavailable bits are read as zero, but | |
3270 | that's OK, as they'll end up marked below. If the VAL is | |
3271 | wholly-invalid we may have skipped allocating its contents, | |
b27556e3 | 3272 | though. See value::allocate_optimized_out. */ |
e5ca03b4 PA |
3273 | if (valaddr != NULL) |
3274 | { | |
3275 | LONGEST num; | |
3276 | ||
3277 | num = unpack_bits_as_long (field_type, valaddr + embedded_offset, | |
3278 | bitpos, bitsize); | |
bbe912ba | 3279 | store_signed_integer (dest_val->contents_raw ().data (), |
df86565b | 3280 | field_type->length (), byte_order, num); |
e5ca03b4 | 3281 | } |
4875ffdb PA |
3282 | |
3283 | /* Now copy the optimized out / unavailability ranges to the right | |
3284 | bits. */ | |
3285 | src_bit_offset = embedded_offset * TARGET_CHAR_BIT + bitpos; | |
3286 | if (byte_order == BFD_ENDIAN_BIG) | |
df86565b | 3287 | dst_bit_offset = field_type->length () * TARGET_CHAR_BIT - bitsize; |
4875ffdb PA |
3288 | else |
3289 | dst_bit_offset = 0; | |
6c49729e | 3290 | ranges_copy_adjusted (dest_val, dst_bit_offset, src_bit_offset, bitsize); |
5467c6c8 PA |
3291 | } |
3292 | ||
3293 | /* Return a new value with type TYPE, which is FIELDNO field of the | |
3294 | object at VALADDR + EMBEDDEDOFFSET. VALADDR points to the contents | |
3295 | of VAL. If the VAL's contents required to extract the bitfield | |
4875ffdb PA |
3296 | from are unavailable/optimized out, the new value is |
3297 | correspondingly marked unavailable/optimized out. */ | |
5467c6c8 PA |
3298 | |
3299 | struct value * | |
3300 | value_field_bitfield (struct type *type, int fieldno, | |
3301 | const gdb_byte *valaddr, | |
6b850546 | 3302 | LONGEST embedded_offset, const struct value *val) |
5467c6c8 | 3303 | { |
b610c045 | 3304 | int bitpos = type->field (fieldno).loc_bitpos (); |
3757d2d4 | 3305 | int bitsize = type->field (fieldno).bitsize (); |
317c3ed9 | 3306 | struct value *res_val = value::allocate (type->field (fieldno).type ()); |
5467c6c8 | 3307 | |
6c49729e | 3308 | val->unpack_bitfield (res_val, bitpos, bitsize, valaddr, embedded_offset); |
4875ffdb PA |
3309 | |
3310 | return res_val; | |
4ea48cc1 DJ |
3311 | } |
3312 | ||
c906108c SS |
3313 | /* Modify the value of a bitfield. ADDR points to a block of memory in |
3314 | target byte order; the bitfield starts in the byte pointed to. FIELDVAL | |
3315 | is the desired value of the field, in host byte order. BITPOS and BITSIZE | |
581e13c1 | 3316 | indicate which bits (in target bit order) comprise the bitfield. |
19f220c3 | 3317 | Requires 0 < BITSIZE <= lbits, 0 <= BITPOS % 8 + BITSIZE <= lbits, and |
f4e88c8e | 3318 | 0 <= BITPOS, where lbits is the size of a LONGEST in bits. */ |
c906108c SS |
3319 | |
3320 | void | |
50810684 | 3321 | modify_field (struct type *type, gdb_byte *addr, |
6b850546 | 3322 | LONGEST fieldval, LONGEST bitpos, LONGEST bitsize) |
c906108c | 3323 | { |
34877895 | 3324 | enum bfd_endian byte_order = type_byte_order (type); |
f4e88c8e PH |
3325 | ULONGEST oword; |
3326 | ULONGEST mask = (ULONGEST) -1 >> (8 * sizeof (ULONGEST) - bitsize); | |
6b850546 | 3327 | LONGEST bytesize; |
19f220c3 JK |
3328 | |
3329 | /* Normalize BITPOS. */ | |
3330 | addr += bitpos / 8; | |
3331 | bitpos %= 8; | |
c906108c SS |
3332 | |
3333 | /* If a negative fieldval fits in the field in question, chop | |
3334 | off the sign extension bits. */ | |
f4e88c8e PH |
3335 | if ((~fieldval & ~(mask >> 1)) == 0) |
3336 | fieldval &= mask; | |
c906108c SS |
3337 | |
3338 | /* Warn if value is too big to fit in the field in question. */ | |
f4e88c8e | 3339 | if (0 != (fieldval & ~mask)) |
c906108c SS |
3340 | { |
3341 | /* FIXME: would like to include fieldval in the message, but | |
dda83cd7 | 3342 | we don't have a sprintf_longest. */ |
6b850546 | 3343 | warning (_("Value does not fit in %s bits."), plongest (bitsize)); |
c906108c SS |
3344 | |
3345 | /* Truncate it, otherwise adjoining fields may be corrupted. */ | |
f4e88c8e | 3346 | fieldval &= mask; |
c906108c SS |
3347 | } |
3348 | ||
19f220c3 JK |
3349 | /* Ensure no bytes outside of the modified ones get accessed as it may cause |
3350 | false valgrind reports. */ | |
3351 | ||
3352 | bytesize = (bitpos + bitsize + 7) / 8; | |
3353 | oword = extract_unsigned_integer (addr, bytesize, byte_order); | |
c906108c SS |
3354 | |
3355 | /* Shifting for bit field depends on endianness of the target machine. */ | |
d5a22e77 | 3356 | if (byte_order == BFD_ENDIAN_BIG) |
19f220c3 | 3357 | bitpos = bytesize * 8 - bitpos - bitsize; |
c906108c | 3358 | |
f4e88c8e | 3359 | oword &= ~(mask << bitpos); |
c906108c SS |
3360 | oword |= fieldval << bitpos; |
3361 | ||
19f220c3 | 3362 | store_unsigned_integer (addr, bytesize, byte_order, oword); |
c906108c SS |
3363 | } |
3364 | \f | |
14d06750 | 3365 | /* Pack NUM into BUF using a target format of TYPE. */ |
c906108c | 3366 | |
14d06750 DJ |
3367 | void |
3368 | pack_long (gdb_byte *buf, struct type *type, LONGEST num) | |
c906108c | 3369 | { |
34877895 | 3370 | enum bfd_endian byte_order = type_byte_order (type); |
6b850546 | 3371 | LONGEST len; |
14d06750 DJ |
3372 | |
3373 | type = check_typedef (type); | |
df86565b | 3374 | len = type->length (); |
c906108c | 3375 | |
78134374 | 3376 | switch (type->code ()) |
c906108c | 3377 | { |
4e962e74 | 3378 | case TYPE_CODE_RANGE: |
599088e3 | 3379 | num -= type->bounds ()->bias; |
d182e398 | 3380 | [[fallthrough]]; |
c906108c SS |
3381 | case TYPE_CODE_INT: |
3382 | case TYPE_CODE_CHAR: | |
3383 | case TYPE_CODE_ENUM: | |
4f2aea11 | 3384 | case TYPE_CODE_FLAGS: |
c906108c | 3385 | case TYPE_CODE_BOOL: |
0d5de010 | 3386 | case TYPE_CODE_MEMBERPTR: |
20a5fcbd TT |
3387 | if (type->bit_size_differs_p ()) |
3388 | { | |
3389 | unsigned bit_off = type->bit_offset (); | |
3390 | unsigned bit_size = type->bit_size (); | |
3391 | num &= ((ULONGEST) 1 << bit_size) - 1; | |
3392 | num <<= bit_off; | |
3393 | } | |
e17a4113 | 3394 | store_signed_integer (buf, len, byte_order, num); |
c906108c | 3395 | break; |
c5aa993b | 3396 | |
c906108c | 3397 | case TYPE_CODE_REF: |
aa006118 | 3398 | case TYPE_CODE_RVALUE_REF: |
c906108c | 3399 | case TYPE_CODE_PTR: |
14d06750 | 3400 | store_typed_address (buf, type, (CORE_ADDR) num); |
c906108c | 3401 | break; |
c5aa993b | 3402 | |
50637b26 UW |
3403 | case TYPE_CODE_FLT: |
3404 | case TYPE_CODE_DECFLOAT: | |
3405 | target_float_from_longest (buf, type, num); | |
3406 | break; | |
3407 | ||
c906108c | 3408 | default: |
14d06750 | 3409 | error (_("Unexpected type (%d) encountered for integer constant."), |
78134374 | 3410 | type->code ()); |
c906108c | 3411 | } |
14d06750 DJ |
3412 | } |
3413 | ||
3414 | ||
595939de PM |
3415 | /* Pack NUM into BUF using a target format of TYPE. */ |
3416 | ||
70221824 | 3417 | static void |
595939de PM |
3418 | pack_unsigned_long (gdb_byte *buf, struct type *type, ULONGEST num) |
3419 | { | |
6b850546 | 3420 | LONGEST len; |
595939de PM |
3421 | enum bfd_endian byte_order; |
3422 | ||
3423 | type = check_typedef (type); | |
df86565b | 3424 | len = type->length (); |
34877895 | 3425 | byte_order = type_byte_order (type); |
595939de | 3426 | |
78134374 | 3427 | switch (type->code ()) |
595939de PM |
3428 | { |
3429 | case TYPE_CODE_INT: | |
3430 | case TYPE_CODE_CHAR: | |
3431 | case TYPE_CODE_ENUM: | |
3432 | case TYPE_CODE_FLAGS: | |
3433 | case TYPE_CODE_BOOL: | |
3434 | case TYPE_CODE_RANGE: | |
3435 | case TYPE_CODE_MEMBERPTR: | |
20a5fcbd TT |
3436 | if (type->bit_size_differs_p ()) |
3437 | { | |
3438 | unsigned bit_off = type->bit_offset (); | |
3439 | unsigned bit_size = type->bit_size (); | |
3440 | num &= ((ULONGEST) 1 << bit_size) - 1; | |
3441 | num <<= bit_off; | |
3442 | } | |
595939de PM |
3443 | store_unsigned_integer (buf, len, byte_order, num); |
3444 | break; | |
3445 | ||
3446 | case TYPE_CODE_REF: | |
aa006118 | 3447 | case TYPE_CODE_RVALUE_REF: |
595939de PM |
3448 | case TYPE_CODE_PTR: |
3449 | store_typed_address (buf, type, (CORE_ADDR) num); | |
3450 | break; | |
3451 | ||
50637b26 UW |
3452 | case TYPE_CODE_FLT: |
3453 | case TYPE_CODE_DECFLOAT: | |
3454 | target_float_from_ulongest (buf, type, num); | |
3455 | break; | |
3456 | ||
595939de | 3457 | default: |
3e43a32a MS |
3458 | error (_("Unexpected type (%d) encountered " |
3459 | "for unsigned integer constant."), | |
78134374 | 3460 | type->code ()); |
595939de PM |
3461 | } |
3462 | } | |
3463 | ||
ee7bb294 | 3464 | /* See value.h. */ |
3e44c304 TT |
3465 | |
3466 | struct value * | |
ee7bb294 | 3467 | value::zero (struct type *type, enum lval_type lv) |
3e44c304 | 3468 | { |
cbe793af | 3469 | struct value *val = value::allocate_lazy (type); |
3e44c304 | 3470 | |
6f9c9d71 | 3471 | val->set_lval (lv == lval_computed ? not_lval : lv); |
382d927f | 3472 | val->m_is_zero = true; |
3e44c304 TT |
3473 | return val; |
3474 | } | |
3475 | ||
14d06750 DJ |
3476 | /* Convert C numbers into newly allocated values. */ |
3477 | ||
3478 | struct value * | |
3479 | value_from_longest (struct type *type, LONGEST num) | |
3480 | { | |
317c3ed9 | 3481 | struct value *val = value::allocate (type); |
14d06750 | 3482 | |
bbe912ba | 3483 | pack_long (val->contents_raw ().data (), type, num); |
c906108c SS |
3484 | return val; |
3485 | } | |
3486 | ||
4478b372 | 3487 | |
595939de PM |
3488 | /* Convert C unsigned numbers into newly allocated values. */ |
3489 | ||
3490 | struct value * | |
3491 | value_from_ulongest (struct type *type, ULONGEST num) | |
3492 | { | |
317c3ed9 | 3493 | struct value *val = value::allocate (type); |
595939de | 3494 | |
bbe912ba | 3495 | pack_unsigned_long (val->contents_raw ().data (), type, num); |
595939de PM |
3496 | |
3497 | return val; | |
3498 | } | |
3499 | ||
4db6e7aa TT |
3500 | /* See value.h. */ |
3501 | ||
3502 | struct value * | |
3503 | value_from_mpz (struct type *type, const gdb_mpz &v) | |
3504 | { | |
3505 | struct type *real_type = check_typedef (type); | |
3506 | ||
3507 | const gdb_mpz *val = &v; | |
3508 | gdb_mpz storage; | |
3509 | if (real_type->code () == TYPE_CODE_RANGE && type->bounds ()->bias != 0) | |
3510 | { | |
3511 | storage = *val; | |
3512 | val = &storage; | |
3513 | storage -= type->bounds ()->bias; | |
3514 | } | |
3515 | ||
3516 | if (type->bit_size_differs_p ()) | |
3517 | { | |
3518 | unsigned bit_off = type->bit_offset (); | |
3519 | unsigned bit_size = type->bit_size (); | |
3520 | ||
3521 | if (val != &storage) | |
3522 | { | |
3523 | storage = *val; | |
3524 | val = &storage; | |
3525 | } | |
3526 | ||
3527 | storage.mask (bit_size); | |
3528 | storage <<= bit_off; | |
3529 | } | |
3530 | ||
3531 | struct value *result = value::allocate (type); | |
3532 | val->truncate (result->contents_raw (), type_byte_order (type), | |
3533 | type->is_unsigned ()); | |
3534 | return result; | |
3535 | } | |
595939de | 3536 | |
4478b372 | 3537 | /* Create a value representing a pointer of type TYPE to the address |
cb417230 | 3538 | ADDR. */ |
80180f79 | 3539 | |
f23631e4 | 3540 | struct value * |
4478b372 JB |
3541 | value_from_pointer (struct type *type, CORE_ADDR addr) |
3542 | { | |
317c3ed9 | 3543 | struct value *val = value::allocate (type); |
a109c7c1 | 3544 | |
bbe912ba | 3545 | store_typed_address (val->contents_raw ().data (), |
cb417230 | 3546 | check_typedef (type), addr); |
4478b372 JB |
3547 | return val; |
3548 | } | |
3549 | ||
7584bb30 AB |
3550 | /* Create and return a value object of TYPE containing the value D. The |
3551 | TYPE must be of TYPE_CODE_FLT, and must be large enough to hold D once | |
3552 | it is converted to target format. */ | |
3553 | ||
3554 | struct value * | |
3555 | value_from_host_double (struct type *type, double d) | |
3556 | { | |
317c3ed9 | 3557 | struct value *value = value::allocate (type); |
78134374 | 3558 | gdb_assert (type->code () == TYPE_CODE_FLT); |
bbe912ba | 3559 | target_float_from_host_double (value->contents_raw ().data (), |
d0c97917 | 3560 | value->type (), d); |
7584bb30 AB |
3561 | return value; |
3562 | } | |
4478b372 | 3563 | |
012370f6 TT |
3564 | /* Create a value of type TYPE whose contents come from VALADDR, if it |
3565 | is non-null, and whose memory address (in the inferior) is | |
3566 | ADDRESS. The type of the created value may differ from the passed | |
3567 | type TYPE. Make sure to retrieve values new type after this call. | |
3568 | Note that TYPE is not passed through resolve_dynamic_type; this is | |
3569 | a special API intended for use only by Ada. */ | |
3570 | ||
3571 | struct value * | |
3572 | value_from_contents_and_address_unresolved (struct type *type, | |
3573 | const gdb_byte *valaddr, | |
3574 | CORE_ADDR address) | |
3575 | { | |
3576 | struct value *v; | |
3577 | ||
3578 | if (valaddr == NULL) | |
cbe793af | 3579 | v = value::allocate_lazy (type); |
012370f6 TT |
3580 | else |
3581 | v = value_from_contents (type, valaddr); | |
6f9c9d71 | 3582 | v->set_lval (lval_memory); |
9feb2d07 | 3583 | v->set_address (address); |
012370f6 TT |
3584 | return v; |
3585 | } | |
3586 | ||
8acb6b92 TT |
3587 | /* Create a value of type TYPE whose contents come from VALADDR, if it |
3588 | is non-null, and whose memory address (in the inferior) is | |
80180f79 SA |
3589 | ADDRESS. The type of the created value may differ from the passed |
3590 | type TYPE. Make sure to retrieve values new type after this call. */ | |
8acb6b92 TT |
3591 | |
3592 | struct value * | |
3593 | value_from_contents_and_address (struct type *type, | |
3594 | const gdb_byte *valaddr, | |
168f9f95 TT |
3595 | CORE_ADDR address, |
3596 | frame_info_ptr frame) | |
8acb6b92 | 3597 | { |
b249d2c2 TT |
3598 | gdb::array_view<const gdb_byte> view; |
3599 | if (valaddr != nullptr) | |
df86565b | 3600 | view = gdb::make_array_view (valaddr, type->length ()); |
168f9f95 TT |
3601 | struct type *resolved_type = resolve_dynamic_type (type, view, address, |
3602 | &frame); | |
d36430db | 3603 | struct type *resolved_type_no_typedef = check_typedef (resolved_type); |
41e8491f | 3604 | struct value *v; |
a109c7c1 | 3605 | |
8acb6b92 | 3606 | if (valaddr == NULL) |
cbe793af | 3607 | v = value::allocate_lazy (resolved_type); |
8acb6b92 | 3608 | else |
80180f79 | 3609 | v = value_from_contents (resolved_type, valaddr); |
d36430db | 3610 | if (TYPE_DATA_LOCATION (resolved_type_no_typedef) != NULL |
9c0fb734 | 3611 | && TYPE_DATA_LOCATION (resolved_type_no_typedef)->is_constant ()) |
d36430db | 3612 | address = TYPE_DATA_LOCATION_ADDR (resolved_type_no_typedef); |
6f9c9d71 | 3613 | v->set_lval (lval_memory); |
9feb2d07 | 3614 | v->set_address (address); |
8acb6b92 TT |
3615 | return v; |
3616 | } | |
3617 | ||
8a9b8146 TT |
3618 | /* Create a value of type TYPE holding the contents CONTENTS. |
3619 | The new value is `not_lval'. */ | |
3620 | ||
3621 | struct value * | |
3622 | value_from_contents (struct type *type, const gdb_byte *contents) | |
3623 | { | |
3624 | struct value *result; | |
3625 | ||
317c3ed9 | 3626 | result = value::allocate (type); |
bbe912ba | 3627 | memcpy (result->contents_raw ().data (), contents, type->length ()); |
8a9b8146 TT |
3628 | return result; |
3629 | } | |
3630 | ||
3bd0f5ef MS |
3631 | /* Extract a value from the history file. Input will be of the form |
3632 | $digits or $$digits. See block comment above 'write_dollar_variable' | |
3633 | for details. */ | |
3634 | ||
3635 | struct value * | |
e799154c | 3636 | value_from_history_ref (const char *h, const char **endp) |
3bd0f5ef MS |
3637 | { |
3638 | int index, len; | |
3639 | ||
3640 | if (h[0] == '$') | |
3641 | len = 1; | |
3642 | else | |
3643 | return NULL; | |
3644 | ||
3645 | if (h[1] == '$') | |
3646 | len = 2; | |
3647 | ||
3648 | /* Find length of numeral string. */ | |
3649 | for (; isdigit (h[len]); len++) | |
3650 | ; | |
3651 | ||
3652 | /* Make sure numeral string is not part of an identifier. */ | |
3653 | if (h[len] == '_' || isalpha (h[len])) | |
3654 | return NULL; | |
3655 | ||
3656 | /* Now collect the index value. */ | |
3657 | if (h[1] == '$') | |
3658 | { | |
3659 | if (len == 2) | |
3660 | { | |
3661 | /* For some bizarre reason, "$$" is equivalent to "$$1", | |
3662 | rather than to "$$0" as it ought to be! */ | |
3663 | index = -1; | |
3664 | *endp += len; | |
3665 | } | |
3666 | else | |
e799154c TT |
3667 | { |
3668 | char *local_end; | |
3669 | ||
3670 | index = -strtol (&h[2], &local_end, 10); | |
3671 | *endp = local_end; | |
3672 | } | |
3bd0f5ef MS |
3673 | } |
3674 | else | |
3675 | { | |
3676 | if (len == 1) | |
3677 | { | |
3678 | /* "$" is equivalent to "$0". */ | |
3679 | index = 0; | |
3680 | *endp += len; | |
3681 | } | |
3682 | else | |
e799154c TT |
3683 | { |
3684 | char *local_end; | |
3685 | ||
3686 | index = strtol (&h[1], &local_end, 10); | |
3687 | *endp = local_end; | |
3688 | } | |
3bd0f5ef MS |
3689 | } |
3690 | ||
3691 | return access_value_history (index); | |
3692 | } | |
3693 | ||
3fff9862 YQ |
3694 | /* Get the component value (offset by OFFSET bytes) of a struct or |
3695 | union WHOLE. Component's type is TYPE. */ | |
3696 | ||
3697 | struct value * | |
3698 | value_from_component (struct value *whole, struct type *type, LONGEST offset) | |
3699 | { | |
3700 | struct value *v; | |
3701 | ||
736355f2 | 3702 | if (whole->lval () == lval_memory && whole->lazy ()) |
cbe793af | 3703 | v = value::allocate_lazy (type); |
3fff9862 YQ |
3704 | else |
3705 | { | |
317c3ed9 | 3706 | v = value::allocate (type); |
6c49729e TT |
3707 | whole->contents_copy (v, v->embedded_offset (), |
3708 | whole->embedded_offset () + offset, | |
3709 | type_length_units (type)); | |
3fff9862 | 3710 | } |
fcf86fe5 | 3711 | v->set_offset (whole->offset () + offset + whole->embedded_offset ()); |
8181b7b6 | 3712 | v->set_component_location (whole); |
3fff9862 YQ |
3713 | |
3714 | return v; | |
3715 | } | |
3716 | ||
e379f652 TT |
3717 | /* See value.h. */ |
3718 | ||
3719 | struct value * | |
6c49729e TT |
3720 | value::from_component_bitsize (struct type *type, |
3721 | LONGEST bit_offset, LONGEST bit_length) | |
e379f652 | 3722 | { |
6c49729e | 3723 | gdb_assert (!lazy ()); |
e379f652 TT |
3724 | |
3725 | /* Preserve lvalue-ness if possible. This is needed to avoid | |
3726 | array-printing failures (including crashes) when printing Ada | |
3727 | arrays in programs compiled with -fgnat-encodings=all. */ | |
3728 | if ((bit_offset % TARGET_CHAR_BIT) == 0 | |
3729 | && (bit_length % TARGET_CHAR_BIT) == 0 | |
3730 | && bit_length == TARGET_CHAR_BIT * type->length ()) | |
6c49729e | 3731 | return value_from_component (this, type, bit_offset / TARGET_CHAR_BIT); |
e379f652 | 3732 | |
317c3ed9 | 3733 | struct value *v = value::allocate (type); |
e379f652 | 3734 | |
391f8628 | 3735 | LONGEST dst_offset = TARGET_CHAR_BIT * v->embedded_offset (); |
e379f652 TT |
3736 | if (is_scalar_type (type) && type_byte_order (type) == BFD_ENDIAN_BIG) |
3737 | dst_offset += TARGET_CHAR_BIT * type->length () - bit_length; | |
3738 | ||
6c49729e TT |
3739 | contents_copy_raw_bitwise (v, dst_offset, |
3740 | TARGET_CHAR_BIT | |
3741 | * embedded_offset () | |
3742 | + bit_offset, | |
3743 | bit_length); | |
e379f652 TT |
3744 | return v; |
3745 | } | |
3746 | ||
a471c594 JK |
3747 | struct value * |
3748 | coerce_ref_if_computed (const struct value *arg) | |
3749 | { | |
3750 | const struct lval_funcs *funcs; | |
3751 | ||
d0c97917 | 3752 | if (!TYPE_IS_REFERENCE (check_typedef (arg->type ()))) |
a471c594 JK |
3753 | return NULL; |
3754 | ||
97044105 | 3755 | if (arg->lval () != lval_computed) |
a471c594 JK |
3756 | return NULL; |
3757 | ||
b9f74d54 | 3758 | funcs = arg->computed_funcs (); |
a471c594 JK |
3759 | if (funcs->coerce_ref == NULL) |
3760 | return NULL; | |
3761 | ||
3762 | return funcs->coerce_ref (arg); | |
3763 | } | |
3764 | ||
dfcee124 AG |
3765 | /* Look at value.h for description. */ |
3766 | ||
3767 | struct value * | |
3768 | readjust_indirect_value_type (struct value *value, struct type *enc_type, | |
4bf7b526 | 3769 | const struct type *original_type, |
e79eb02f AB |
3770 | struct value *original_value, |
3771 | CORE_ADDR original_value_address) | |
dfcee124 | 3772 | { |
809f3be1 | 3773 | gdb_assert (original_type->is_pointer_or_reference ()); |
e79eb02f | 3774 | |
27710edb | 3775 | struct type *original_target_type = original_type->target_type (); |
e79eb02f AB |
3776 | gdb::array_view<const gdb_byte> view; |
3777 | struct type *resolved_original_target_type | |
3778 | = resolve_dynamic_type (original_target_type, view, | |
3779 | original_value_address); | |
3780 | ||
dfcee124 | 3781 | /* Re-adjust type. */ |
81ae560c | 3782 | value->deprecated_set_type (resolved_original_target_type); |
dfcee124 AG |
3783 | |
3784 | /* Add embedding info. */ | |
463b870d | 3785 | value->set_enclosing_type (enc_type); |
391f8628 | 3786 | value->set_embedded_offset (original_value->pointed_to_offset ()); |
dfcee124 AG |
3787 | |
3788 | /* We may be pointing to an object of some derived type. */ | |
3789 | return value_full_object (value, NULL, 0, 0, 0); | |
3790 | } | |
3791 | ||
994b9211 AC |
3792 | struct value * |
3793 | coerce_ref (struct value *arg) | |
3794 | { | |
d0c97917 | 3795 | struct type *value_type_arg_tmp = check_typedef (arg->type ()); |
a471c594 | 3796 | struct value *retval; |
dfcee124 | 3797 | struct type *enc_type; |
a109c7c1 | 3798 | |
a471c594 JK |
3799 | retval = coerce_ref_if_computed (arg); |
3800 | if (retval) | |
3801 | return retval; | |
3802 | ||
aa006118 | 3803 | if (!TYPE_IS_REFERENCE (value_type_arg_tmp)) |
a471c594 JK |
3804 | return arg; |
3805 | ||
463b870d | 3806 | enc_type = check_typedef (arg->enclosing_type ()); |
27710edb | 3807 | enc_type = enc_type->target_type (); |
dfcee124 | 3808 | |
efaf1ae0 | 3809 | CORE_ADDR addr = unpack_pointer (arg->type (), arg->contents ().data ()); |
e79eb02f | 3810 | retval = value_at_lazy (enc_type, addr); |
d0c97917 | 3811 | enc_type = retval->type (); |
e79eb02f AB |
3812 | return readjust_indirect_value_type (retval, enc_type, value_type_arg_tmp, |
3813 | arg, addr); | |
994b9211 AC |
3814 | } |
3815 | ||
3816 | struct value * | |
3817 | coerce_array (struct value *arg) | |
3818 | { | |
f3134b88 TT |
3819 | struct type *type; |
3820 | ||
994b9211 | 3821 | arg = coerce_ref (arg); |
d0c97917 | 3822 | type = check_typedef (arg->type ()); |
f3134b88 | 3823 | |
78134374 | 3824 | switch (type->code ()) |
f3134b88 TT |
3825 | { |
3826 | case TYPE_CODE_ARRAY: | |
67bd3fd5 | 3827 | if (!type->is_vector () && current_language->c_style_arrays_p ()) |
f3134b88 TT |
3828 | arg = value_coerce_array (arg); |
3829 | break; | |
3830 | case TYPE_CODE_FUNC: | |
3831 | arg = value_coerce_function (arg); | |
3832 | break; | |
3833 | } | |
994b9211 AC |
3834 | return arg; |
3835 | } | |
c906108c | 3836 | \f |
c906108c | 3837 | |
bbfdfe1c DM |
3838 | /* Return the return value convention that will be used for the |
3839 | specified type. */ | |
3840 | ||
3841 | enum return_value_convention | |
3842 | struct_return_convention (struct gdbarch *gdbarch, | |
3843 | struct value *function, struct type *value_type) | |
3844 | { | |
78134374 | 3845 | enum type_code code = value_type->code (); |
bbfdfe1c DM |
3846 | |
3847 | if (code == TYPE_CODE_ERROR) | |
3848 | error (_("Function return type unknown.")); | |
3849 | ||
3850 | /* Probe the architecture for the return-value convention. */ | |
4e1d2f58 TT |
3851 | return gdbarch_return_value_as_value (gdbarch, function, value_type, |
3852 | NULL, NULL, NULL); | |
bbfdfe1c DM |
3853 | } |
3854 | ||
48436ce6 AC |
3855 | /* Return true if the function returning the specified type is using |
3856 | the convention of returning structures in memory (passing in the | |
82585c72 | 3857 | address as a hidden first parameter). */ |
c906108c SS |
3858 | |
3859 | int | |
d80b854b | 3860 | using_struct_return (struct gdbarch *gdbarch, |
6a3a010b | 3861 | struct value *function, struct type *value_type) |
c906108c | 3862 | { |
78134374 | 3863 | if (value_type->code () == TYPE_CODE_VOID) |
667e784f | 3864 | /* A void return value is never in memory. See also corresponding |
44e5158b | 3865 | code in "print_return_value". */ |
667e784f AC |
3866 | return 0; |
3867 | ||
bbfdfe1c | 3868 | return (struct_return_convention (gdbarch, function, value_type) |
31db7b6c | 3869 | != RETURN_VALUE_REGISTER_CONVENTION); |
c906108c SS |
3870 | } |
3871 | ||
78259c36 | 3872 | /* See value.h. */ |
41c60b4b | 3873 | |
78259c36 TT |
3874 | void |
3875 | value::fetch_lazy_bitfield () | |
41c60b4b | 3876 | { |
78259c36 | 3877 | gdb_assert (bitsize () != 0); |
41c60b4b SM |
3878 | |
3879 | /* To read a lazy bitfield, read the entire enclosing value. This | |
3880 | prevents reading the same block of (possibly volatile) memory once | |
3881 | per bitfield. It would be even better to read only the containing | |
3882 | word, but we have no way to record that just specific bits of a | |
3883 | value have been fetched. */ | |
78259c36 | 3884 | struct value *parent = this->parent (); |
41c60b4b | 3885 | |
3ee3b270 | 3886 | if (parent->lazy ()) |
78259c36 | 3887 | parent->fetch_lazy (); |
41c60b4b | 3888 | |
6c49729e TT |
3889 | parent->unpack_bitfield (this, bitpos (), bitsize (), |
3890 | parent->contents_for_printing ().data (), | |
3891 | offset ()); | |
41c60b4b SM |
3892 | } |
3893 | ||
78259c36 | 3894 | /* See value.h. */ |
41c60b4b | 3895 | |
78259c36 TT |
3896 | void |
3897 | value::fetch_lazy_memory () | |
41c60b4b | 3898 | { |
78259c36 | 3899 | gdb_assert (m_lval == lval_memory); |
41c60b4b | 3900 | |
78259c36 TT |
3901 | CORE_ADDR addr = address (); |
3902 | struct type *type = check_typedef (enclosing_type ()); | |
41c60b4b | 3903 | |
a0c07915 AB |
3904 | /* Figure out how much we should copy from memory. Usually, this is just |
3905 | the size of the type, but, for arrays, we might only be loading a | |
3906 | small part of the array (this is only done for very large arrays). */ | |
3907 | int len = 0; | |
78259c36 | 3908 | if (m_limited_length > 0) |
a0c07915 | 3909 | { |
78259c36 TT |
3910 | gdb_assert (this->type ()->code () == TYPE_CODE_ARRAY); |
3911 | len = m_limited_length; | |
a0c07915 AB |
3912 | } |
3913 | else if (type->length () > 0) | |
3914 | len = type_length_units (type); | |
3915 | ||
3916 | gdb_assert (len >= 0); | |
3917 | ||
3918 | if (len > 0) | |
19005d19 | 3919 | read_value_memory (this, 0, stack (), addr, |
78259c36 | 3920 | contents_all_raw ().data (), len); |
41c60b4b SM |
3921 | } |
3922 | ||
78259c36 | 3923 | /* See value.h. */ |
41c60b4b | 3924 | |
78259c36 TT |
3925 | void |
3926 | value::fetch_lazy_register () | |
41c60b4b | 3927 | { |
78259c36 | 3928 | struct type *type = check_typedef (this->type ()); |
89459202 TT |
3929 | struct value *new_val = this; |
3930 | ||
3931 | scoped_value_mark mark; | |
41c60b4b SM |
3932 | |
3933 | /* Offsets are not supported here; lazy register values must | |
3934 | refer to the entire register. */ | |
78259c36 | 3935 | gdb_assert (offset () == 0); |
41c60b4b | 3936 | |
736355f2 | 3937 | while (new_val->lval () == lval_register && new_val->lazy ()) |
41c60b4b | 3938 | { |
8b31004b SM |
3939 | frame_id next_frame_id = new_val->next_frame_id (); |
3940 | frame_info_ptr next_frame = frame_find_by_id (next_frame_id); | |
3941 | gdb_assert (next_frame != NULL); | |
41c60b4b | 3942 | |
78f2fd84 | 3943 | int regnum = new_val->regnum (); |
41c60b4b | 3944 | |
41c60b4b SM |
3945 | /* Convertible register routines are used for multi-register |
3946 | values and for interpretation in different types | |
3947 | (e.g. float or int from a double register). Lazy | |
3948 | register values should have the register's natural type, | |
3949 | so they do not apply. */ | |
3950 | gdb_assert (!gdbarch_convert_register_p (get_frame_arch (next_frame), | |
3951 | regnum, type)); | |
3952 | ||
41c60b4b SM |
3953 | new_val = frame_unwind_register_value (next_frame, regnum); |
3954 | ||
3955 | /* If we get another lazy lval_register value, it means the | |
3956 | register is found by reading it from NEXT_FRAME's next frame. | |
3957 | frame_unwind_register_value should never return a value with | |
3958 | the frame id pointing to NEXT_FRAME. If it does, it means we | |
3959 | either have two consecutive frames with the same frame id | |
3960 | in the frame chain, or some code is trying to unwind | |
3961 | behind get_prev_frame's back (e.g., a frame unwind | |
3962 | sniffer trying to unwind), bypassing its validations. In | |
3963 | any case, it should always be an internal error to end up | |
3964 | in this situation. */ | |
736355f2 | 3965 | if (new_val->lval () == lval_register |
3ee3b270 | 3966 | && new_val->lazy () |
8b31004b | 3967 | && new_val->next_frame_id () == next_frame_id) |
f34652de | 3968 | internal_error (_("infinite loop while fetching a register")); |
41c60b4b SM |
3969 | } |
3970 | ||
3971 | /* If it's still lazy (for instance, a saved register on the | |
3972 | stack), fetch it. */ | |
3ee3b270 | 3973 | if (new_val->lazy ()) |
78259c36 | 3974 | new_val->fetch_lazy (); |
41c60b4b SM |
3975 | |
3976 | /* Copy the contents and the unavailability/optimized-out | |
3977 | meta-data from NEW_VAL to VAL. */ | |
a5b210cb | 3978 | set_lazy (false); |
6c49729e TT |
3979 | new_val->contents_copy (this, embedded_offset (), |
3980 | new_val->embedded_offset (), | |
3981 | type_length_units (type)); | |
41c60b4b SM |
3982 | |
3983 | if (frame_debug) | |
3984 | { | |
8b31004b | 3985 | frame_info_ptr frame = frame_find_by_id (this->next_frame_id ()); |
ca89bdf8 | 3986 | frame = get_prev_frame_always (frame); |
78f2fd84 | 3987 | int regnum = this->regnum (); |
8b31004b | 3988 | gdbarch *gdbarch = get_frame_arch (frame); |
41c60b4b | 3989 | |
a05a883f | 3990 | string_file debug_file; |
6cb06a8c TT |
3991 | gdb_printf (&debug_file, |
3992 | "(frame=%d, regnum=%d(%s), ...) ", | |
3993 | frame_relative_level (frame), regnum, | |
3994 | user_reg_map_regnum_to_name (gdbarch, regnum)); | |
41c60b4b | 3995 | |
6cb06a8c | 3996 | gdb_printf (&debug_file, "->"); |
d00664db | 3997 | if (new_val->optimized_out ()) |
41c60b4b | 3998 | { |
6cb06a8c | 3999 | gdb_printf (&debug_file, " "); |
a05a883f | 4000 | val_print_optimized_out (new_val, &debug_file); |
41c60b4b SM |
4001 | } |
4002 | else | |
4003 | { | |
4004 | int i; | |
efaf1ae0 | 4005 | gdb::array_view<const gdb_byte> buf = new_val->contents (); |
41c60b4b | 4006 | |
736355f2 | 4007 | if (new_val->lval () == lval_register) |
78f2fd84 | 4008 | gdb_printf (&debug_file, " register=%d", new_val->regnum ()); |
736355f2 | 4009 | else if (new_val->lval () == lval_memory) |
6cb06a8c TT |
4010 | gdb_printf (&debug_file, " address=%s", |
4011 | paddress (gdbarch, | |
9feb2d07 | 4012 | new_val->address ())); |
41c60b4b | 4013 | else |
6cb06a8c | 4014 | gdb_printf (&debug_file, " computed"); |
41c60b4b | 4015 | |
6cb06a8c TT |
4016 | gdb_printf (&debug_file, " bytes="); |
4017 | gdb_printf (&debug_file, "["); | |
41c60b4b | 4018 | for (i = 0; i < register_size (gdbarch, regnum); i++) |
6cb06a8c TT |
4019 | gdb_printf (&debug_file, "%02x", buf[i]); |
4020 | gdb_printf (&debug_file, "]"); | |
41c60b4b SM |
4021 | } |
4022 | ||
a05a883f | 4023 | frame_debug_printf ("%s", debug_file.c_str ()); |
41c60b4b | 4024 | } |
41c60b4b SM |
4025 | } |
4026 | ||
78259c36 | 4027 | /* See value.h. */ |
a58e2656 | 4028 | |
a844296a | 4029 | void |
78259c36 | 4030 | value::fetch_lazy () |
a58e2656 | 4031 | { |
78259c36 | 4032 | gdb_assert (lazy ()); |
82ca8f72 | 4033 | allocate_contents (true); |
9a0dc9e3 PA |
4034 | /* A value is either lazy, or fully fetched. The |
4035 | availability/validity is only established as we try to fetch a | |
4036 | value. */ | |
78259c36 TT |
4037 | gdb_assert (m_optimized_out.empty ()); |
4038 | gdb_assert (m_unavailable.empty ()); | |
4039 | if (m_is_zero) | |
3e44c304 TT |
4040 | { |
4041 | /* Nothing. */ | |
4042 | } | |
78259c36 TT |
4043 | else if (bitsize ()) |
4044 | fetch_lazy_bitfield (); | |
736355f2 | 4045 | else if (this->lval () == lval_memory) |
78259c36 | 4046 | fetch_lazy_memory (); |
736355f2 | 4047 | else if (this->lval () == lval_register) |
78259c36 | 4048 | fetch_lazy_register (); |
736355f2 | 4049 | else if (this->lval () == lval_computed |
78259c36 TT |
4050 | && computed_funcs ()->read != NULL) |
4051 | computed_funcs ()->read (this); | |
a58e2656 | 4052 | else |
f34652de | 4053 | internal_error (_("Unexpected lazy value type.")); |
a58e2656 | 4054 | |
a5b210cb | 4055 | set_lazy (false); |
a58e2656 AB |
4056 | } |
4057 | ||
b3245cef SM |
4058 | /* See value.h. */ |
4059 | ||
4060 | value * | |
4061 | pseudo_from_raw_part (frame_info_ptr next_frame, int pseudo_reg_num, | |
4062 | int raw_reg_num, int raw_offset) | |
4063 | { | |
4064 | value *pseudo_reg_val | |
4065 | = value::allocate_register (next_frame, pseudo_reg_num); | |
4066 | value *raw_reg_val = value_of_register (raw_reg_num, next_frame); | |
4067 | raw_reg_val->contents_copy (pseudo_reg_val, 0, raw_offset, | |
4068 | pseudo_reg_val->type ()->length ()); | |
4069 | return pseudo_reg_val; | |
4070 | } | |
4071 | ||
4072 | /* See value.h. */ | |
4073 | ||
1f624181 SM |
4074 | void |
4075 | pseudo_to_raw_part (frame_info_ptr next_frame, | |
4076 | gdb::array_view<const gdb_byte> pseudo_buf, | |
4077 | int raw_reg_num, int raw_offset) | |
4078 | { | |
4079 | int raw_reg_size | |
4080 | = register_size (frame_unwind_arch (next_frame), raw_reg_num); | |
4081 | ||
4082 | /* When overflowing a register, put_frame_register_bytes writes to the | |
4083 | subsequent registers. We don't want that behavior here, so make sure | |
4084 | the write is wholly within register RAW_REG_NUM. */ | |
4085 | gdb_assert (raw_offset + pseudo_buf.size () <= raw_reg_size); | |
4086 | put_frame_register_bytes (next_frame, raw_reg_num, raw_offset, pseudo_buf); | |
4087 | } | |
4088 | ||
4089 | /* See value.h. */ | |
4090 | ||
b3245cef SM |
4091 | value * |
4092 | pseudo_from_concat_raw (frame_info_ptr next_frame, int pseudo_reg_num, | |
4093 | int raw_reg_1_num, int raw_reg_2_num) | |
4094 | { | |
4095 | value *pseudo_reg_val | |
4096 | = value::allocate_register (next_frame, pseudo_reg_num); | |
4097 | int dst_offset = 0; | |
4098 | ||
4099 | value *raw_reg_1_val = value_of_register (raw_reg_1_num, next_frame); | |
4100 | raw_reg_1_val->contents_copy (pseudo_reg_val, dst_offset, 0, | |
4101 | raw_reg_1_val->type ()->length ()); | |
4102 | dst_offset += raw_reg_1_val->type ()->length (); | |
4103 | ||
4104 | value *raw_reg_2_val = value_of_register (raw_reg_2_num, next_frame); | |
4105 | raw_reg_2_val->contents_copy (pseudo_reg_val, dst_offset, 0, | |
4106 | raw_reg_2_val->type ()->length ()); | |
4107 | dst_offset += raw_reg_2_val->type ()->length (); | |
4108 | ||
4109 | gdb_assert (dst_offset == pseudo_reg_val->type ()->length ()); | |
4110 | ||
4111 | return pseudo_reg_val; | |
4112 | } | |
4113 | ||
1f624181 SM |
4114 | /* See value.h. */ |
4115 | ||
4116 | void | |
4117 | pseudo_to_concat_raw (frame_info_ptr next_frame, | |
4118 | gdb::array_view<const gdb_byte> pseudo_buf, | |
4119 | int raw_reg_1_num, int raw_reg_2_num) | |
4120 | { | |
4121 | int src_offset = 0; | |
4122 | gdbarch *arch = frame_unwind_arch (next_frame); | |
4123 | ||
4124 | int raw_reg_1_size = register_size (arch, raw_reg_1_num); | |
80d2ef0c SM |
4125 | put_frame_register (next_frame, raw_reg_1_num, |
4126 | pseudo_buf.slice (src_offset, raw_reg_1_size)); | |
1f624181 SM |
4127 | src_offset += raw_reg_1_size; |
4128 | ||
4129 | int raw_reg_2_size = register_size (arch, raw_reg_2_num); | |
80d2ef0c SM |
4130 | put_frame_register (next_frame, raw_reg_2_num, |
4131 | pseudo_buf.slice (src_offset, raw_reg_2_size)); | |
1f624181 SM |
4132 | src_offset += raw_reg_2_size; |
4133 | ||
4134 | gdb_assert (src_offset == pseudo_buf.size ()); | |
4135 | } | |
4136 | ||
b3245cef SM |
4137 | /* See value.h. */ |
4138 | ||
4139 | value * | |
4140 | pseudo_from_concat_raw (frame_info_ptr next_frame, int pseudo_reg_num, | |
4141 | int raw_reg_1_num, int raw_reg_2_num, | |
4142 | int raw_reg_3_num) | |
4143 | { | |
4144 | value *pseudo_reg_val | |
4145 | = value::allocate_register (next_frame, pseudo_reg_num); | |
4146 | int dst_offset = 0; | |
4147 | ||
4148 | value *raw_reg_1_val = value_of_register (raw_reg_1_num, next_frame); | |
4149 | raw_reg_1_val->contents_copy (pseudo_reg_val, dst_offset, 0, | |
4150 | raw_reg_1_val->type ()->length ()); | |
4151 | dst_offset += raw_reg_1_val->type ()->length (); | |
4152 | ||
4153 | value *raw_reg_2_val = value_of_register (raw_reg_2_num, next_frame); | |
4154 | raw_reg_2_val->contents_copy (pseudo_reg_val, dst_offset, 0, | |
4155 | raw_reg_2_val->type ()->length ()); | |
4156 | dst_offset += raw_reg_2_val->type ()->length (); | |
4157 | ||
4158 | value *raw_reg_3_val = value_of_register (raw_reg_3_num, next_frame); | |
4159 | raw_reg_3_val->contents_copy (pseudo_reg_val, dst_offset, 0, | |
4160 | raw_reg_3_val->type ()->length ()); | |
4161 | dst_offset += raw_reg_3_val->type ()->length (); | |
4162 | ||
4163 | gdb_assert (dst_offset == pseudo_reg_val->type ()->length ()); | |
4164 | ||
4165 | return pseudo_reg_val; | |
4166 | } | |
4167 | ||
1f624181 SM |
4168 | /* See value.h. */ |
4169 | ||
4170 | void | |
4171 | pseudo_to_concat_raw (frame_info_ptr next_frame, | |
4172 | gdb::array_view<const gdb_byte> pseudo_buf, | |
4173 | int raw_reg_1_num, int raw_reg_2_num, int raw_reg_3_num) | |
4174 | { | |
4175 | int src_offset = 0; | |
4176 | gdbarch *arch = frame_unwind_arch (next_frame); | |
4177 | ||
4178 | int raw_reg_1_size = register_size (arch, raw_reg_1_num); | |
80d2ef0c SM |
4179 | put_frame_register (next_frame, raw_reg_1_num, |
4180 | pseudo_buf.slice (src_offset, raw_reg_1_size)); | |
1f624181 SM |
4181 | src_offset += raw_reg_1_size; |
4182 | ||
4183 | int raw_reg_2_size = register_size (arch, raw_reg_2_num); | |
80d2ef0c SM |
4184 | put_frame_register (next_frame, raw_reg_2_num, |
4185 | pseudo_buf.slice (src_offset, raw_reg_2_size)); | |
1f624181 SM |
4186 | src_offset += raw_reg_2_size; |
4187 | ||
4188 | int raw_reg_3_size = register_size (arch, raw_reg_3_num); | |
80d2ef0c SM |
4189 | put_frame_register (next_frame, raw_reg_3_num, |
4190 | pseudo_buf.slice (src_offset, raw_reg_3_size)); | |
1f624181 SM |
4191 | src_offset += raw_reg_3_size; |
4192 | ||
4193 | gdb_assert (src_offset == pseudo_buf.size ()); | |
4194 | } | |
4195 | ||
a280dbd1 SDJ |
4196 | /* Implementation of the convenience function $_isvoid. */ |
4197 | ||
4198 | static struct value * | |
4199 | isvoid_internal_fn (struct gdbarch *gdbarch, | |
4200 | const struct language_defn *language, | |
4201 | void *cookie, int argc, struct value **argv) | |
4202 | { | |
4203 | int ret; | |
4204 | ||
4205 | if (argc != 1) | |
6bc305f5 | 4206 | error (_("You must provide one argument for $_isvoid.")); |
a280dbd1 | 4207 | |
d0c97917 | 4208 | ret = argv[0]->type ()->code () == TYPE_CODE_VOID; |
a280dbd1 SDJ |
4209 | |
4210 | return value_from_longest (builtin_type (gdbarch)->builtin_int, ret); | |
4211 | } | |
4212 | ||
53a008a6 | 4213 | /* Implementation of the convenience function $_creal. Extracts the |
8bdc1658 AB |
4214 | real part from a complex number. */ |
4215 | ||
4216 | static struct value * | |
4217 | creal_internal_fn (struct gdbarch *gdbarch, | |
4218 | const struct language_defn *language, | |
4219 | void *cookie, int argc, struct value **argv) | |
4220 | { | |
4221 | if (argc != 1) | |
4222 | error (_("You must provide one argument for $_creal.")); | |
4223 | ||
4224 | value *cval = argv[0]; | |
d0c97917 | 4225 | type *ctype = check_typedef (cval->type ()); |
78134374 | 4226 | if (ctype->code () != TYPE_CODE_COMPLEX) |
8bdc1658 | 4227 | error (_("expected a complex number")); |
4c99290d | 4228 | return value_real_part (cval); |
8bdc1658 AB |
4229 | } |
4230 | ||
4231 | /* Implementation of the convenience function $_cimag. Extracts the | |
4232 | imaginary part from a complex number. */ | |
4233 | ||
4234 | static struct value * | |
4235 | cimag_internal_fn (struct gdbarch *gdbarch, | |
4236 | const struct language_defn *language, | |
4237 | void *cookie, int argc, | |
4238 | struct value **argv) | |
4239 | { | |
4240 | if (argc != 1) | |
4241 | error (_("You must provide one argument for $_cimag.")); | |
4242 | ||
4243 | value *cval = argv[0]; | |
d0c97917 | 4244 | type *ctype = check_typedef (cval->type ()); |
78134374 | 4245 | if (ctype->code () != TYPE_CODE_COMPLEX) |
8bdc1658 | 4246 | error (_("expected a complex number")); |
4c99290d | 4247 | return value_imaginary_part (cval); |
8bdc1658 AB |
4248 | } |
4249 | ||
d5f4488f SM |
4250 | #if GDB_SELF_TEST |
4251 | namespace selftests | |
4252 | { | |
4253 | ||
4254 | /* Test the ranges_contain function. */ | |
4255 | ||
4256 | static void | |
4257 | test_ranges_contain () | |
4258 | { | |
4259 | std::vector<range> ranges; | |
4260 | range r; | |
4261 | ||
4262 | /* [10, 14] */ | |
4263 | r.offset = 10; | |
4264 | r.length = 5; | |
4265 | ranges.push_back (r); | |
4266 | ||
4267 | /* [20, 24] */ | |
4268 | r.offset = 20; | |
4269 | r.length = 5; | |
4270 | ranges.push_back (r); | |
4271 | ||
4272 | /* [2, 6] */ | |
4273 | SELF_CHECK (!ranges_contain (ranges, 2, 5)); | |
4274 | /* [9, 13] */ | |
4275 | SELF_CHECK (ranges_contain (ranges, 9, 5)); | |
4276 | /* [10, 11] */ | |
4277 | SELF_CHECK (ranges_contain (ranges, 10, 2)); | |
4278 | /* [10, 14] */ | |
4279 | SELF_CHECK (ranges_contain (ranges, 10, 5)); | |
4280 | /* [13, 18] */ | |
4281 | SELF_CHECK (ranges_contain (ranges, 13, 6)); | |
4282 | /* [14, 18] */ | |
4283 | SELF_CHECK (ranges_contain (ranges, 14, 5)); | |
4284 | /* [15, 18] */ | |
4285 | SELF_CHECK (!ranges_contain (ranges, 15, 4)); | |
4286 | /* [16, 19] */ | |
4287 | SELF_CHECK (!ranges_contain (ranges, 16, 4)); | |
4288 | /* [16, 21] */ | |
4289 | SELF_CHECK (ranges_contain (ranges, 16, 6)); | |
4290 | /* [21, 21] */ | |
4291 | SELF_CHECK (ranges_contain (ranges, 21, 1)); | |
4292 | /* [21, 25] */ | |
4293 | SELF_CHECK (ranges_contain (ranges, 21, 5)); | |
4294 | /* [26, 28] */ | |
4295 | SELF_CHECK (!ranges_contain (ranges, 26, 3)); | |
4296 | } | |
4297 | ||
4298 | /* Check that RANGES contains the same ranges as EXPECTED. */ | |
4299 | ||
4300 | static bool | |
4301 | check_ranges_vector (gdb::array_view<const range> ranges, | |
4302 | gdb::array_view<const range> expected) | |
4303 | { | |
4304 | return ranges == expected; | |
4305 | } | |
4306 | ||
4307 | /* Test the insert_into_bit_range_vector function. */ | |
4308 | ||
4309 | static void | |
4310 | test_insert_into_bit_range_vector () | |
4311 | { | |
4312 | std::vector<range> ranges; | |
4313 | ||
4314 | /* [10, 14] */ | |
4315 | { | |
4316 | insert_into_bit_range_vector (&ranges, 10, 5); | |
4317 | static const range expected[] = { | |
4318 | {10, 5} | |
4319 | }; | |
4320 | SELF_CHECK (check_ranges_vector (ranges, expected)); | |
4321 | } | |
4322 | ||
4323 | /* [10, 14] */ | |
4324 | { | |
4325 | insert_into_bit_range_vector (&ranges, 11, 4); | |
4326 | static const range expected = {10, 5}; | |
4327 | SELF_CHECK (check_ranges_vector (ranges, expected)); | |
4328 | } | |
4329 | ||
4330 | /* [10, 14] [20, 24] */ | |
4331 | { | |
4332 | insert_into_bit_range_vector (&ranges, 20, 5); | |
4333 | static const range expected[] = { | |
4334 | {10, 5}, | |
4335 | {20, 5}, | |
4336 | }; | |
4337 | SELF_CHECK (check_ranges_vector (ranges, expected)); | |
4338 | } | |
4339 | ||
4340 | /* [10, 14] [17, 24] */ | |
4341 | { | |
4342 | insert_into_bit_range_vector (&ranges, 17, 5); | |
4343 | static const range expected[] = { | |
4344 | {10, 5}, | |
4345 | {17, 8}, | |
4346 | }; | |
4347 | SELF_CHECK (check_ranges_vector (ranges, expected)); | |
4348 | } | |
4349 | ||
4350 | /* [2, 8] [10, 14] [17, 24] */ | |
4351 | { | |
4352 | insert_into_bit_range_vector (&ranges, 2, 7); | |
4353 | static const range expected[] = { | |
4354 | {2, 7}, | |
4355 | {10, 5}, | |
4356 | {17, 8}, | |
4357 | }; | |
4358 | SELF_CHECK (check_ranges_vector (ranges, expected)); | |
4359 | } | |
4360 | ||
4361 | /* [2, 14] [17, 24] */ | |
4362 | { | |
4363 | insert_into_bit_range_vector (&ranges, 9, 1); | |
4364 | static const range expected[] = { | |
4365 | {2, 13}, | |
4366 | {17, 8}, | |
4367 | }; | |
4368 | SELF_CHECK (check_ranges_vector (ranges, expected)); | |
4369 | } | |
4370 | ||
4371 | /* [2, 14] [17, 24] */ | |
4372 | { | |
4373 | insert_into_bit_range_vector (&ranges, 9, 1); | |
4374 | static const range expected[] = { | |
4375 | {2, 13}, | |
4376 | {17, 8}, | |
4377 | }; | |
4378 | SELF_CHECK (check_ranges_vector (ranges, expected)); | |
4379 | } | |
4380 | ||
4381 | /* [2, 33] */ | |
4382 | { | |
4383 | insert_into_bit_range_vector (&ranges, 4, 30); | |
4384 | static const range expected = {2, 32}; | |
4385 | SELF_CHECK (check_ranges_vector (ranges, expected)); | |
4386 | } | |
4387 | } | |
4388 | ||
6d088eb9 SM |
4389 | static void |
4390 | test_value_copy () | |
4391 | { | |
27b1f19f | 4392 | type *type = builtin_type (current_inferior ()->arch ())->builtin_int; |
6d088eb9 SM |
4393 | |
4394 | /* Verify that we can copy an entirely optimized out value, that may not have | |
4395 | its contents allocated. */ | |
b27556e3 | 4396 | value_ref_ptr val = release_value (value::allocate_optimized_out (type)); |
f28085df | 4397 | value_ref_ptr copy = release_value (val->copy ()); |
6d088eb9 | 4398 | |
f28085df TT |
4399 | SELF_CHECK (val->entirely_optimized_out ()); |
4400 | SELF_CHECK (copy->entirely_optimized_out ()); | |
6d088eb9 SM |
4401 | } |
4402 | ||
d5f4488f SM |
4403 | } /* namespace selftests */ |
4404 | #endif /* GDB_SELF_TEST */ | |
4405 | ||
6c265988 | 4406 | void _initialize_values (); |
c906108c | 4407 | void |
6c265988 | 4408 | _initialize_values () |
c906108c | 4409 | { |
5e84b7ee SM |
4410 | cmd_list_element *show_convenience_cmd |
4411 | = add_cmd ("convenience", no_class, show_convenience, _("\ | |
f47f77df DE |
4412 | Debugger convenience (\"$foo\") variables and functions.\n\ |
4413 | Convenience variables are created when you assign them values;\n\ | |
4414 | thus, \"set $foo=1\" gives \"$foo\" the value 1. Values may be any type.\n\ | |
1a966eab | 4415 | \n\ |
c906108c SS |
4416 | A few convenience variables are given values automatically:\n\ |
4417 | \"$_\"holds the last address examined with \"x\" or \"info lines\",\n\ | |
f47f77df DE |
4418 | \"$__\" holds the contents of the last address examined with \"x\"." |
4419 | #ifdef HAVE_PYTHON | |
4420 | "\n\n\ | |
4421 | Convenience functions are defined via the Python API." | |
4422 | #endif | |
4423 | ), &showlist); | |
5e84b7ee | 4424 | add_alias_cmd ("conv", show_convenience_cmd, no_class, 1, &showlist); |
c906108c | 4425 | |
db5f229b | 4426 | add_cmd ("values", no_set_class, show_values, _("\ |
3e43a32a | 4427 | Elements of value history around item number IDX (or last ten)."), |
c906108c | 4428 | &showlist); |
53e5f3cf AS |
4429 | |
4430 | add_com ("init-if-undefined", class_vars, init_if_undefined_command, _("\ | |
4431 | Initialize a convenience variable if necessary.\n\ | |
4432 | init-if-undefined VARIABLE = EXPRESSION\n\ | |
4433 | Set an internal VARIABLE to the result of the EXPRESSION if it does not\n\ | |
4434 | exist or does not contain a value. The EXPRESSION is not evaluated if the\n\ | |
4435 | VARIABLE is already initialized.")); | |
bc3b79fd TJB |
4436 | |
4437 | add_prefix_cmd ("function", no_class, function_command, _("\ | |
4438 | Placeholder command for showing help on convenience functions."), | |
2f822da5 | 4439 | &functionlist, 0, &cmdlist); |
a280dbd1 SDJ |
4440 | |
4441 | add_internal_function ("_isvoid", _("\ | |
4442 | Check whether an expression is void.\n\ | |
4443 | Usage: $_isvoid (expression)\n\ | |
4444 | Return 1 if the expression is void, zero otherwise."), | |
4445 | isvoid_internal_fn, NULL); | |
5fdf6324 | 4446 | |
8bdc1658 AB |
4447 | add_internal_function ("_creal", _("\ |
4448 | Extract the real part of a complex number.\n\ | |
4449 | Usage: $_creal (expression)\n\ | |
4450 | Return the real part of a complex number, the type depends on the\n\ | |
4451 | type of a complex number."), | |
4452 | creal_internal_fn, NULL); | |
4453 | ||
4454 | add_internal_function ("_cimag", _("\ | |
4455 | Extract the imaginary part of a complex number.\n\ | |
4456 | Usage: $_cimag (expression)\n\ | |
4457 | Return the imaginary part of a complex number, the type depends on the\n\ | |
4458 | type of a complex number."), | |
4459 | cimag_internal_fn, NULL); | |
4460 | ||
5fdf6324 AB |
4461 | add_setshow_zuinteger_unlimited_cmd ("max-value-size", |
4462 | class_support, &max_value_size, _("\ | |
4463 | Set maximum sized value gdb will load from the inferior."), _("\ | |
4464 | Show maximum sized value gdb will load from the inferior."), _("\ | |
4465 | Use this to control the maximum size, in bytes, of a value that gdb\n\ | |
4466 | will load from the inferior. Setting this value to 'unlimited'\n\ | |
4467 | disables checking.\n\ | |
4468 | Setting this does not invalidate already allocated values, it only\n\ | |
4469 | prevents future values, larger than this size, from being allocated."), | |
4470 | set_max_value_size, | |
4471 | show_max_value_size, | |
4472 | &setlist, &showlist); | |
acbf4a58 TT |
4473 | set_show_commands vsize_limit |
4474 | = add_setshow_zuinteger_unlimited_cmd ("varsize-limit", class_support, | |
4475 | &max_value_size, _("\ | |
4476 | Set the maximum number of bytes allowed in a variable-size object."), _("\ | |
4477 | Show the maximum number of bytes allowed in a variable-size object."), _("\ | |
4478 | Attempts to access an object whose size is not a compile-time constant\n\ | |
4479 | and exceeds this limit will cause an error."), | |
4480 | NULL, NULL, &setlist, &showlist); | |
4481 | deprecate_cmd (vsize_limit.set, "set max-value-size"); | |
4482 | ||
d5f4488f SM |
4483 | #if GDB_SELF_TEST |
4484 | selftests::register_test ("ranges_contain", selftests::test_ranges_contain); | |
4485 | selftests::register_test ("insert_into_bit_range_vector", | |
4486 | selftests::test_insert_into_bit_range_vector); | |
6d088eb9 | 4487 | selftests::register_test ("value_copy", selftests::test_value_copy); |
d5f4488f | 4488 | #endif |
c906108c | 4489 | } |
9d1447e0 SDJ |
4490 | |
4491 | /* See value.h. */ | |
4492 | ||
4493 | void | |
4494 | finalize_values () | |
4495 | { | |
4496 | all_values.clear (); | |
4497 | } |