Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Low level packing and unpacking of values for GDB, the GNU Debugger. |
1bac305b | 2 | |
6aba47ca | 3 | Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, |
0fb0cc75 | 4 | 1996, 1997, 1998, 1999, 2000, 2002, 2003, 2004, 2005, 2006, 2007, 2008, |
7b6bb8da | 5 | 2009, 2010, 2011 Free Software Foundation, Inc. |
c906108c | 6 | |
c5aa993b | 7 | This file is part of GDB. |
c906108c | 8 | |
c5aa993b JM |
9 | This program is free software; you can redistribute it and/or modify |
10 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 11 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 12 | (at your option) any later version. |
c906108c | 13 | |
c5aa993b JM |
14 | This program is distributed in the hope that it will be useful, |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
c906108c | 18 | |
c5aa993b | 19 | You should have received a copy of the GNU General Public License |
a9762ec7 | 20 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
21 | |
22 | #include "defs.h" | |
e17c207e | 23 | #include "arch-utils.h" |
c906108c SS |
24 | #include "gdb_string.h" |
25 | #include "symtab.h" | |
26 | #include "gdbtypes.h" | |
27 | #include "value.h" | |
28 | #include "gdbcore.h" | |
c906108c SS |
29 | #include "command.h" |
30 | #include "gdbcmd.h" | |
31 | #include "target.h" | |
32 | #include "language.h" | |
c906108c | 33 | #include "demangle.h" |
d16aafd8 | 34 | #include "doublest.h" |
5ae326fa | 35 | #include "gdb_assert.h" |
36160dc4 | 36 | #include "regcache.h" |
fe898f56 | 37 | #include "block.h" |
27bc4d80 | 38 | #include "dfp.h" |
bccdca4a | 39 | #include "objfiles.h" |
79a45b7d | 40 | #include "valprint.h" |
bc3b79fd | 41 | #include "cli/cli-decode.h" |
8af8e3bc | 42 | #include "exceptions.h" |
a08702d6 TJB |
43 | #include "python/python.h" |
44 | ||
0914bcdb SS |
45 | #include "tracepoint.h" |
46 | ||
581e13c1 | 47 | /* Prototypes for exported functions. */ |
c906108c | 48 | |
a14ed312 | 49 | void _initialize_values (void); |
c906108c | 50 | |
bc3b79fd TJB |
51 | /* Definition of a user function. */ |
52 | struct internal_function | |
53 | { | |
54 | /* The name of the function. It is a bit odd to have this in the | |
55 | function itself -- the user might use a differently-named | |
56 | convenience variable to hold the function. */ | |
57 | char *name; | |
58 | ||
59 | /* The handler. */ | |
60 | internal_function_fn handler; | |
61 | ||
62 | /* User data for the handler. */ | |
63 | void *cookie; | |
64 | }; | |
65 | ||
4e07d55f PA |
66 | /* Defines an [OFFSET, OFFSET + LENGTH) range. */ |
67 | ||
68 | struct range | |
69 | { | |
70 | /* Lowest offset in the range. */ | |
71 | int offset; | |
72 | ||
73 | /* Length of the range. */ | |
74 | int length; | |
75 | }; | |
76 | ||
77 | typedef struct range range_s; | |
78 | ||
79 | DEF_VEC_O(range_s); | |
80 | ||
81 | /* Returns true if the ranges defined by [offset1, offset1+len1) and | |
82 | [offset2, offset2+len2) overlap. */ | |
83 | ||
84 | static int | |
85 | ranges_overlap (int offset1, int len1, | |
86 | int offset2, int len2) | |
87 | { | |
88 | ULONGEST h, l; | |
89 | ||
90 | l = max (offset1, offset2); | |
91 | h = min (offset1 + len1, offset2 + len2); | |
92 | return (l < h); | |
93 | } | |
94 | ||
95 | /* Returns true if the first argument is strictly less than the | |
96 | second, useful for VEC_lower_bound. We keep ranges sorted by | |
97 | offset and coalesce overlapping and contiguous ranges, so this just | |
98 | compares the starting offset. */ | |
99 | ||
100 | static int | |
101 | range_lessthan (const range_s *r1, const range_s *r2) | |
102 | { | |
103 | return r1->offset < r2->offset; | |
104 | } | |
105 | ||
106 | /* Returns true if RANGES contains any range that overlaps [OFFSET, | |
107 | OFFSET+LENGTH). */ | |
108 | ||
109 | static int | |
110 | ranges_contain (VEC(range_s) *ranges, int offset, int length) | |
111 | { | |
112 | range_s what; | |
113 | int i; | |
114 | ||
115 | what.offset = offset; | |
116 | what.length = length; | |
117 | ||
118 | /* We keep ranges sorted by offset and coalesce overlapping and | |
119 | contiguous ranges, so to check if a range list contains a given | |
120 | range, we can do a binary search for the position the given range | |
121 | would be inserted if we only considered the starting OFFSET of | |
122 | ranges. We call that position I. Since we also have LENGTH to | |
123 | care for (this is a range afterall), we need to check if the | |
124 | _previous_ range overlaps the I range. E.g., | |
125 | ||
126 | R | |
127 | |---| | |
128 | |---| |---| |------| ... |--| | |
129 | 0 1 2 N | |
130 | ||
131 | I=1 | |
132 | ||
133 | In the case above, the binary search would return `I=1', meaning, | |
134 | this OFFSET should be inserted at position 1, and the current | |
135 | position 1 should be pushed further (and before 2). But, `0' | |
136 | overlaps with R. | |
137 | ||
138 | Then we need to check if the I range overlaps the I range itself. | |
139 | E.g., | |
140 | ||
141 | R | |
142 | |---| | |
143 | |---| |---| |-------| ... |--| | |
144 | 0 1 2 N | |
145 | ||
146 | I=1 | |
147 | */ | |
148 | ||
149 | i = VEC_lower_bound (range_s, ranges, &what, range_lessthan); | |
150 | ||
151 | if (i > 0) | |
152 | { | |
153 | struct range *bef = VEC_index (range_s, ranges, i - 1); | |
154 | ||
155 | if (ranges_overlap (bef->offset, bef->length, offset, length)) | |
156 | return 1; | |
157 | } | |
158 | ||
159 | if (i < VEC_length (range_s, ranges)) | |
160 | { | |
161 | struct range *r = VEC_index (range_s, ranges, i); | |
162 | ||
163 | if (ranges_overlap (r->offset, r->length, offset, length)) | |
164 | return 1; | |
165 | } | |
166 | ||
167 | return 0; | |
168 | } | |
169 | ||
bc3b79fd TJB |
170 | static struct cmd_list_element *functionlist; |
171 | ||
91294c83 AC |
172 | struct value |
173 | { | |
174 | /* Type of value; either not an lval, or one of the various | |
175 | different possible kinds of lval. */ | |
176 | enum lval_type lval; | |
177 | ||
178 | /* Is it modifiable? Only relevant if lval != not_lval. */ | |
179 | int modifiable; | |
180 | ||
181 | /* Location of value (if lval). */ | |
182 | union | |
183 | { | |
184 | /* If lval == lval_memory, this is the address in the inferior. | |
185 | If lval == lval_register, this is the byte offset into the | |
186 | registers structure. */ | |
187 | CORE_ADDR address; | |
188 | ||
189 | /* Pointer to internal variable. */ | |
190 | struct internalvar *internalvar; | |
5f5233d4 PA |
191 | |
192 | /* If lval == lval_computed, this is a set of function pointers | |
193 | to use to access and describe the value, and a closure pointer | |
194 | for them to use. */ | |
195 | struct | |
196 | { | |
197 | struct lval_funcs *funcs; /* Functions to call. */ | |
198 | void *closure; /* Closure for those functions to use. */ | |
199 | } computed; | |
91294c83 AC |
200 | } location; |
201 | ||
202 | /* Describes offset of a value within lval of a structure in bytes. | |
203 | If lval == lval_memory, this is an offset to the address. If | |
204 | lval == lval_register, this is a further offset from | |
205 | location.address within the registers structure. Note also the | |
206 | member embedded_offset below. */ | |
207 | int offset; | |
208 | ||
209 | /* Only used for bitfields; number of bits contained in them. */ | |
210 | int bitsize; | |
211 | ||
212 | /* Only used for bitfields; position of start of field. For | |
32c9a795 | 213 | gdbarch_bits_big_endian=0 targets, it is the position of the LSB. For |
581e13c1 | 214 | gdbarch_bits_big_endian=1 targets, it is the position of the MSB. */ |
91294c83 AC |
215 | int bitpos; |
216 | ||
4ea48cc1 DJ |
217 | /* Only used for bitfields; the containing value. This allows a |
218 | single read from the target when displaying multiple | |
219 | bitfields. */ | |
220 | struct value *parent; | |
221 | ||
91294c83 AC |
222 | /* Frame register value is relative to. This will be described in |
223 | the lval enum above as "lval_register". */ | |
224 | struct frame_id frame_id; | |
225 | ||
226 | /* Type of the value. */ | |
227 | struct type *type; | |
228 | ||
229 | /* If a value represents a C++ object, then the `type' field gives | |
230 | the object's compile-time type. If the object actually belongs | |
231 | to some class derived from `type', perhaps with other base | |
232 | classes and additional members, then `type' is just a subobject | |
233 | of the real thing, and the full object is probably larger than | |
234 | `type' would suggest. | |
235 | ||
236 | If `type' is a dynamic class (i.e. one with a vtable), then GDB | |
237 | can actually determine the object's run-time type by looking at | |
238 | the run-time type information in the vtable. When this | |
239 | information is available, we may elect to read in the entire | |
240 | object, for several reasons: | |
241 | ||
242 | - When printing the value, the user would probably rather see the | |
243 | full object, not just the limited portion apparent from the | |
244 | compile-time type. | |
245 | ||
246 | - If `type' has virtual base classes, then even printing `type' | |
247 | alone may require reaching outside the `type' portion of the | |
248 | object to wherever the virtual base class has been stored. | |
249 | ||
250 | When we store the entire object, `enclosing_type' is the run-time | |
251 | type -- the complete object -- and `embedded_offset' is the | |
252 | offset of `type' within that larger type, in bytes. The | |
253 | value_contents() macro takes `embedded_offset' into account, so | |
254 | most GDB code continues to see the `type' portion of the value, | |
255 | just as the inferior would. | |
256 | ||
257 | If `type' is a pointer to an object, then `enclosing_type' is a | |
258 | pointer to the object's run-time type, and `pointed_to_offset' is | |
259 | the offset in bytes from the full object to the pointed-to object | |
260 | -- that is, the value `embedded_offset' would have if we followed | |
261 | the pointer and fetched the complete object. (I don't really see | |
262 | the point. Why not just determine the run-time type when you | |
263 | indirect, and avoid the special case? The contents don't matter | |
264 | until you indirect anyway.) | |
265 | ||
266 | If we're not doing anything fancy, `enclosing_type' is equal to | |
267 | `type', and `embedded_offset' is zero, so everything works | |
268 | normally. */ | |
269 | struct type *enclosing_type; | |
270 | int embedded_offset; | |
271 | int pointed_to_offset; | |
272 | ||
273 | /* Values are stored in a chain, so that they can be deleted easily | |
274 | over calls to the inferior. Values assigned to internal | |
a08702d6 TJB |
275 | variables, put into the value history or exposed to Python are |
276 | taken off this list. */ | |
91294c83 AC |
277 | struct value *next; |
278 | ||
279 | /* Register number if the value is from a register. */ | |
280 | short regnum; | |
281 | ||
282 | /* If zero, contents of this value are in the contents field. If | |
9214ee5f DJ |
283 | nonzero, contents are in inferior. If the lval field is lval_memory, |
284 | the contents are in inferior memory at location.address plus offset. | |
285 | The lval field may also be lval_register. | |
91294c83 AC |
286 | |
287 | WARNING: This field is used by the code which handles watchpoints | |
288 | (see breakpoint.c) to decide whether a particular value can be | |
289 | watched by hardware watchpoints. If the lazy flag is set for | |
290 | some member of a value chain, it is assumed that this member of | |
291 | the chain doesn't need to be watched as part of watching the | |
292 | value itself. This is how GDB avoids watching the entire struct | |
293 | or array when the user wants to watch a single struct member or | |
294 | array element. If you ever change the way lazy flag is set and | |
295 | reset, be sure to consider this use as well! */ | |
296 | char lazy; | |
297 | ||
298 | /* If nonzero, this is the value of a variable which does not | |
299 | actually exist in the program. */ | |
300 | char optimized_out; | |
301 | ||
42be36b3 CT |
302 | /* If value is a variable, is it initialized or not. */ |
303 | int initialized; | |
304 | ||
4e5d721f DE |
305 | /* If value is from the stack. If this is set, read_stack will be |
306 | used instead of read_memory to enable extra caching. */ | |
307 | int stack; | |
308 | ||
3e3d7139 JG |
309 | /* Actual contents of the value. Target byte-order. NULL or not |
310 | valid if lazy is nonzero. */ | |
311 | gdb_byte *contents; | |
828d3400 | 312 | |
4e07d55f PA |
313 | /* Unavailable ranges in CONTENTS. We mark unavailable ranges, |
314 | rather than available, since the common and default case is for a | |
315 | value to be available. This is filled in at value read time. */ | |
316 | VEC(range_s) *unavailable; | |
317 | ||
828d3400 DJ |
318 | /* The number of references to this value. When a value is created, |
319 | the value chain holds a reference, so REFERENCE_COUNT is 1. If | |
320 | release_value is called, this value is removed from the chain but | |
321 | the caller of release_value now has a reference to this value. | |
322 | The caller must arrange for a call to value_free later. */ | |
323 | int reference_count; | |
91294c83 AC |
324 | }; |
325 | ||
4e07d55f PA |
326 | int |
327 | value_bytes_available (const struct value *value, int offset, int length) | |
328 | { | |
329 | gdb_assert (!value->lazy); | |
330 | ||
331 | return !ranges_contain (value->unavailable, offset, length); | |
332 | } | |
333 | ||
ec0a52e1 PA |
334 | int |
335 | value_entirely_available (struct value *value) | |
336 | { | |
337 | /* We can only tell whether the whole value is available when we try | |
338 | to read it. */ | |
339 | if (value->lazy) | |
340 | value_fetch_lazy (value); | |
341 | ||
342 | if (VEC_empty (range_s, value->unavailable)) | |
343 | return 1; | |
344 | return 0; | |
345 | } | |
346 | ||
4e07d55f PA |
347 | void |
348 | mark_value_bytes_unavailable (struct value *value, int offset, int length) | |
349 | { | |
350 | range_s newr; | |
351 | int i; | |
352 | ||
353 | /* Insert the range sorted. If there's overlap or the new range | |
354 | would be contiguous with an existing range, merge. */ | |
355 | ||
356 | newr.offset = offset; | |
357 | newr.length = length; | |
358 | ||
359 | /* Do a binary search for the position the given range would be | |
360 | inserted if we only considered the starting OFFSET of ranges. | |
361 | Call that position I. Since we also have LENGTH to care for | |
362 | (this is a range afterall), we need to check if the _previous_ | |
363 | range overlaps the I range. E.g., calling R the new range: | |
364 | ||
365 | #1 - overlaps with previous | |
366 | ||
367 | R | |
368 | |-...-| | |
369 | |---| |---| |------| ... |--| | |
370 | 0 1 2 N | |
371 | ||
372 | I=1 | |
373 | ||
374 | In the case #1 above, the binary search would return `I=1', | |
375 | meaning, this OFFSET should be inserted at position 1, and the | |
376 | current position 1 should be pushed further (and become 2). But, | |
377 | note that `0' overlaps with R, so we want to merge them. | |
378 | ||
379 | A similar consideration needs to be taken if the new range would | |
380 | be contiguous with the previous range: | |
381 | ||
382 | #2 - contiguous with previous | |
383 | ||
384 | R | |
385 | |-...-| | |
386 | |--| |---| |------| ... |--| | |
387 | 0 1 2 N | |
388 | ||
389 | I=1 | |
390 | ||
391 | If there's no overlap with the previous range, as in: | |
392 | ||
393 | #3 - not overlapping and not contiguous | |
394 | ||
395 | R | |
396 | |-...-| | |
397 | |--| |---| |------| ... |--| | |
398 | 0 1 2 N | |
399 | ||
400 | I=1 | |
401 | ||
402 | or if I is 0: | |
403 | ||
404 | #4 - R is the range with lowest offset | |
405 | ||
406 | R | |
407 | |-...-| | |
408 | |--| |---| |------| ... |--| | |
409 | 0 1 2 N | |
410 | ||
411 | I=0 | |
412 | ||
413 | ... we just push the new range to I. | |
414 | ||
415 | All the 4 cases above need to consider that the new range may | |
416 | also overlap several of the ranges that follow, or that R may be | |
417 | contiguous with the following range, and merge. E.g., | |
418 | ||
419 | #5 - overlapping following ranges | |
420 | ||
421 | R | |
422 | |------------------------| | |
423 | |--| |---| |------| ... |--| | |
424 | 0 1 2 N | |
425 | ||
426 | I=0 | |
427 | ||
428 | or: | |
429 | ||
430 | R | |
431 | |-------| | |
432 | |--| |---| |------| ... |--| | |
433 | 0 1 2 N | |
434 | ||
435 | I=1 | |
436 | ||
437 | */ | |
438 | ||
439 | i = VEC_lower_bound (range_s, value->unavailable, &newr, range_lessthan); | |
440 | if (i > 0) | |
441 | { | |
6bfc80c7 | 442 | struct range *bef = VEC_index (range_s, value->unavailable, i - 1); |
4e07d55f PA |
443 | |
444 | if (ranges_overlap (bef->offset, bef->length, offset, length)) | |
445 | { | |
446 | /* #1 */ | |
447 | ULONGEST l = min (bef->offset, offset); | |
448 | ULONGEST h = max (bef->offset + bef->length, offset + length); | |
449 | ||
450 | bef->offset = l; | |
451 | bef->length = h - l; | |
452 | i--; | |
453 | } | |
454 | else if (offset == bef->offset + bef->length) | |
455 | { | |
456 | /* #2 */ | |
457 | bef->length += length; | |
458 | i--; | |
459 | } | |
460 | else | |
461 | { | |
462 | /* #3 */ | |
463 | VEC_safe_insert (range_s, value->unavailable, i, &newr); | |
464 | } | |
465 | } | |
466 | else | |
467 | { | |
468 | /* #4 */ | |
469 | VEC_safe_insert (range_s, value->unavailable, i, &newr); | |
470 | } | |
471 | ||
472 | /* Check whether the ranges following the one we've just added or | |
473 | touched can be folded in (#5 above). */ | |
474 | if (i + 1 < VEC_length (range_s, value->unavailable)) | |
475 | { | |
476 | struct range *t; | |
477 | struct range *r; | |
478 | int removed = 0; | |
479 | int next = i + 1; | |
480 | ||
481 | /* Get the range we just touched. */ | |
482 | t = VEC_index (range_s, value->unavailable, i); | |
483 | removed = 0; | |
484 | ||
485 | i = next; | |
486 | for (; VEC_iterate (range_s, value->unavailable, i, r); i++) | |
487 | if (r->offset <= t->offset + t->length) | |
488 | { | |
489 | ULONGEST l, h; | |
490 | ||
491 | l = min (t->offset, r->offset); | |
492 | h = max (t->offset + t->length, r->offset + r->length); | |
493 | ||
494 | t->offset = l; | |
495 | t->length = h - l; | |
496 | ||
497 | removed++; | |
498 | } | |
499 | else | |
500 | { | |
501 | /* If we couldn't merge this one, we won't be able to | |
502 | merge following ones either, since the ranges are | |
503 | always sorted by OFFSET. */ | |
504 | break; | |
505 | } | |
506 | ||
507 | if (removed != 0) | |
508 | VEC_block_remove (range_s, value->unavailable, next, removed); | |
509 | } | |
510 | } | |
511 | ||
c8c1c22f PA |
512 | /* Find the first range in RANGES that overlaps the range defined by |
513 | OFFSET and LENGTH, starting at element POS in the RANGES vector, | |
514 | Returns the index into RANGES where such overlapping range was | |
515 | found, or -1 if none was found. */ | |
516 | ||
517 | static int | |
518 | find_first_range_overlap (VEC(range_s) *ranges, int pos, | |
519 | int offset, int length) | |
520 | { | |
521 | range_s *r; | |
522 | int i; | |
523 | ||
524 | for (i = pos; VEC_iterate (range_s, ranges, i, r); i++) | |
525 | if (ranges_overlap (r->offset, r->length, offset, length)) | |
526 | return i; | |
527 | ||
528 | return -1; | |
529 | } | |
530 | ||
531 | int | |
532 | value_available_contents_eq (const struct value *val1, int offset1, | |
533 | const struct value *val2, int offset2, | |
534 | int length) | |
535 | { | |
c8c1c22f | 536 | int idx1 = 0, idx2 = 0; |
c8c1c22f PA |
537 | |
538 | /* This routine is used by printing routines, where we should | |
539 | already have read the value. Note that we only know whether a | |
540 | value chunk is available if we've tried to read it. */ | |
541 | gdb_assert (!val1->lazy && !val2->lazy); | |
542 | ||
c8c1c22f PA |
543 | while (length > 0) |
544 | { | |
545 | range_s *r1, *r2; | |
546 | ULONGEST l1, h1; | |
547 | ULONGEST l2, h2; | |
548 | ||
549 | idx1 = find_first_range_overlap (val1->unavailable, idx1, | |
550 | offset1, length); | |
551 | idx2 = find_first_range_overlap (val2->unavailable, idx2, | |
552 | offset2, length); | |
553 | ||
554 | /* The usual case is for both values to be completely available. */ | |
555 | if (idx1 == -1 && idx2 == -1) | |
cd24cfaa PA |
556 | return (memcmp (val1->contents + offset1, |
557 | val2->contents + offset2, | |
558 | length) == 0); | |
c8c1c22f PA |
559 | /* The contents only match equal if the available set matches as |
560 | well. */ | |
561 | else if (idx1 == -1 || idx2 == -1) | |
562 | return 0; | |
563 | ||
564 | gdb_assert (idx1 != -1 && idx2 != -1); | |
565 | ||
566 | r1 = VEC_index (range_s, val1->unavailable, idx1); | |
567 | r2 = VEC_index (range_s, val2->unavailable, idx2); | |
568 | ||
569 | /* Get the unavailable windows intersected by the incoming | |
570 | ranges. The first and last ranges that overlap the argument | |
571 | range may be wider than said incoming arguments ranges. */ | |
572 | l1 = max (offset1, r1->offset); | |
573 | h1 = min (offset1 + length, r1->offset + r1->length); | |
574 | ||
575 | l2 = max (offset2, r2->offset); | |
576 | h2 = min (offset2 + length, r2->offset + r2->length); | |
577 | ||
578 | /* Make them relative to the respective start offsets, so we can | |
579 | compare them for equality. */ | |
580 | l1 -= offset1; | |
581 | h1 -= offset1; | |
582 | ||
583 | l2 -= offset2; | |
584 | h2 -= offset2; | |
585 | ||
586 | /* Different availability, no match. */ | |
587 | if (l1 != l2 || h1 != h2) | |
588 | return 0; | |
589 | ||
590 | /* Compare the _available_ contents. */ | |
cd24cfaa PA |
591 | if (memcmp (val1->contents + offset1, |
592 | val2->contents + offset2, | |
593 | l1) != 0) | |
c8c1c22f PA |
594 | return 0; |
595 | ||
c8c1c22f PA |
596 | length -= h1; |
597 | offset1 += h1; | |
598 | offset2 += h1; | |
599 | } | |
600 | ||
601 | return 1; | |
602 | } | |
603 | ||
581e13c1 | 604 | /* Prototypes for local functions. */ |
c906108c | 605 | |
a14ed312 | 606 | static void show_values (char *, int); |
c906108c | 607 | |
a14ed312 | 608 | static void show_convenience (char *, int); |
c906108c | 609 | |
c906108c SS |
610 | |
611 | /* The value-history records all the values printed | |
612 | by print commands during this session. Each chunk | |
613 | records 60 consecutive values. The first chunk on | |
614 | the chain records the most recent values. | |
615 | The total number of values is in value_history_count. */ | |
616 | ||
617 | #define VALUE_HISTORY_CHUNK 60 | |
618 | ||
619 | struct value_history_chunk | |
c5aa993b JM |
620 | { |
621 | struct value_history_chunk *next; | |
f23631e4 | 622 | struct value *values[VALUE_HISTORY_CHUNK]; |
c5aa993b | 623 | }; |
c906108c SS |
624 | |
625 | /* Chain of chunks now in use. */ | |
626 | ||
627 | static struct value_history_chunk *value_history_chain; | |
628 | ||
581e13c1 | 629 | static int value_history_count; /* Abs number of last entry stored. */ |
bc3b79fd | 630 | |
c906108c SS |
631 | \f |
632 | /* List of all value objects currently allocated | |
633 | (except for those released by calls to release_value) | |
634 | This is so they can be freed after each command. */ | |
635 | ||
f23631e4 | 636 | static struct value *all_values; |
c906108c | 637 | |
3e3d7139 JG |
638 | /* Allocate a lazy value for type TYPE. Its actual content is |
639 | "lazily" allocated too: the content field of the return value is | |
640 | NULL; it will be allocated when it is fetched from the target. */ | |
c906108c | 641 | |
f23631e4 | 642 | struct value * |
3e3d7139 | 643 | allocate_value_lazy (struct type *type) |
c906108c | 644 | { |
f23631e4 | 645 | struct value *val; |
c54eabfa JK |
646 | |
647 | /* Call check_typedef on our type to make sure that, if TYPE | |
648 | is a TYPE_CODE_TYPEDEF, its length is set to the length | |
649 | of the target type instead of zero. However, we do not | |
650 | replace the typedef type by the target type, because we want | |
651 | to keep the typedef in order to be able to set the VAL's type | |
652 | description correctly. */ | |
653 | check_typedef (type); | |
c906108c | 654 | |
3e3d7139 JG |
655 | val = (struct value *) xzalloc (sizeof (struct value)); |
656 | val->contents = NULL; | |
df407dfe | 657 | val->next = all_values; |
c906108c | 658 | all_values = val; |
df407dfe | 659 | val->type = type; |
4754a64e | 660 | val->enclosing_type = type; |
c906108c | 661 | VALUE_LVAL (val) = not_lval; |
42ae5230 | 662 | val->location.address = 0; |
1df6926e | 663 | VALUE_FRAME_ID (val) = null_frame_id; |
df407dfe AC |
664 | val->offset = 0; |
665 | val->bitpos = 0; | |
666 | val->bitsize = 0; | |
9ee8fc9d | 667 | VALUE_REGNUM (val) = -1; |
3e3d7139 | 668 | val->lazy = 1; |
feb13ab0 | 669 | val->optimized_out = 0; |
13c3b5f5 | 670 | val->embedded_offset = 0; |
b44d461b | 671 | val->pointed_to_offset = 0; |
c906108c | 672 | val->modifiable = 1; |
42be36b3 | 673 | val->initialized = 1; /* Default to initialized. */ |
828d3400 DJ |
674 | |
675 | /* Values start out on the all_values chain. */ | |
676 | val->reference_count = 1; | |
677 | ||
c906108c SS |
678 | return val; |
679 | } | |
680 | ||
3e3d7139 JG |
681 | /* Allocate the contents of VAL if it has not been allocated yet. */ |
682 | ||
683 | void | |
684 | allocate_value_contents (struct value *val) | |
685 | { | |
686 | if (!val->contents) | |
687 | val->contents = (gdb_byte *) xzalloc (TYPE_LENGTH (val->enclosing_type)); | |
688 | } | |
689 | ||
690 | /* Allocate a value and its contents for type TYPE. */ | |
691 | ||
692 | struct value * | |
693 | allocate_value (struct type *type) | |
694 | { | |
695 | struct value *val = allocate_value_lazy (type); | |
a109c7c1 | 696 | |
3e3d7139 JG |
697 | allocate_value_contents (val); |
698 | val->lazy = 0; | |
699 | return val; | |
700 | } | |
701 | ||
c906108c | 702 | /* Allocate a value that has the correct length |
938f5214 | 703 | for COUNT repetitions of type TYPE. */ |
c906108c | 704 | |
f23631e4 | 705 | struct value * |
fba45db2 | 706 | allocate_repeat_value (struct type *type, int count) |
c906108c | 707 | { |
c5aa993b | 708 | int low_bound = current_language->string_lower_bound; /* ??? */ |
c906108c SS |
709 | /* FIXME-type-allocation: need a way to free this type when we are |
710 | done with it. */ | |
e3506a9f UW |
711 | struct type *array_type |
712 | = lookup_array_range_type (type, low_bound, count + low_bound - 1); | |
a109c7c1 | 713 | |
e3506a9f | 714 | return allocate_value (array_type); |
c906108c SS |
715 | } |
716 | ||
5f5233d4 PA |
717 | struct value * |
718 | allocate_computed_value (struct type *type, | |
719 | struct lval_funcs *funcs, | |
720 | void *closure) | |
721 | { | |
41e8491f | 722 | struct value *v = allocate_value_lazy (type); |
a109c7c1 | 723 | |
5f5233d4 PA |
724 | VALUE_LVAL (v) = lval_computed; |
725 | v->location.computed.funcs = funcs; | |
726 | v->location.computed.closure = closure; | |
5f5233d4 PA |
727 | |
728 | return v; | |
729 | } | |
730 | ||
df407dfe AC |
731 | /* Accessor methods. */ |
732 | ||
17cf0ecd AC |
733 | struct value * |
734 | value_next (struct value *value) | |
735 | { | |
736 | return value->next; | |
737 | } | |
738 | ||
df407dfe | 739 | struct type * |
0e03807e | 740 | value_type (const struct value *value) |
df407dfe AC |
741 | { |
742 | return value->type; | |
743 | } | |
04624583 AC |
744 | void |
745 | deprecated_set_value_type (struct value *value, struct type *type) | |
746 | { | |
747 | value->type = type; | |
748 | } | |
df407dfe AC |
749 | |
750 | int | |
0e03807e | 751 | value_offset (const struct value *value) |
df407dfe AC |
752 | { |
753 | return value->offset; | |
754 | } | |
f5cf64a7 AC |
755 | void |
756 | set_value_offset (struct value *value, int offset) | |
757 | { | |
758 | value->offset = offset; | |
759 | } | |
df407dfe AC |
760 | |
761 | int | |
0e03807e | 762 | value_bitpos (const struct value *value) |
df407dfe AC |
763 | { |
764 | return value->bitpos; | |
765 | } | |
9bbda503 AC |
766 | void |
767 | set_value_bitpos (struct value *value, int bit) | |
768 | { | |
769 | value->bitpos = bit; | |
770 | } | |
df407dfe AC |
771 | |
772 | int | |
0e03807e | 773 | value_bitsize (const struct value *value) |
df407dfe AC |
774 | { |
775 | return value->bitsize; | |
776 | } | |
9bbda503 AC |
777 | void |
778 | set_value_bitsize (struct value *value, int bit) | |
779 | { | |
780 | value->bitsize = bit; | |
781 | } | |
df407dfe | 782 | |
4ea48cc1 DJ |
783 | struct value * |
784 | value_parent (struct value *value) | |
785 | { | |
786 | return value->parent; | |
787 | } | |
788 | ||
fc1a4b47 | 789 | gdb_byte * |
990a07ab AC |
790 | value_contents_raw (struct value *value) |
791 | { | |
3e3d7139 JG |
792 | allocate_value_contents (value); |
793 | return value->contents + value->embedded_offset; | |
990a07ab AC |
794 | } |
795 | ||
fc1a4b47 | 796 | gdb_byte * |
990a07ab AC |
797 | value_contents_all_raw (struct value *value) |
798 | { | |
3e3d7139 JG |
799 | allocate_value_contents (value); |
800 | return value->contents; | |
990a07ab AC |
801 | } |
802 | ||
4754a64e AC |
803 | struct type * |
804 | value_enclosing_type (struct value *value) | |
805 | { | |
806 | return value->enclosing_type; | |
807 | } | |
808 | ||
0e03807e | 809 | static void |
4e07d55f | 810 | require_not_optimized_out (const struct value *value) |
0e03807e TT |
811 | { |
812 | if (value->optimized_out) | |
813 | error (_("value has been optimized out")); | |
814 | } | |
815 | ||
4e07d55f PA |
816 | static void |
817 | require_available (const struct value *value) | |
818 | { | |
819 | if (!VEC_empty (range_s, value->unavailable)) | |
8af8e3bc | 820 | throw_error (NOT_AVAILABLE_ERROR, _("value is not available")); |
4e07d55f PA |
821 | } |
822 | ||
fc1a4b47 | 823 | const gdb_byte * |
0e03807e | 824 | value_contents_for_printing (struct value *value) |
46615f07 AC |
825 | { |
826 | if (value->lazy) | |
827 | value_fetch_lazy (value); | |
3e3d7139 | 828 | return value->contents; |
46615f07 AC |
829 | } |
830 | ||
de4127a3 PA |
831 | const gdb_byte * |
832 | value_contents_for_printing_const (const struct value *value) | |
833 | { | |
834 | gdb_assert (!value->lazy); | |
835 | return value->contents; | |
836 | } | |
837 | ||
0e03807e TT |
838 | const gdb_byte * |
839 | value_contents_all (struct value *value) | |
840 | { | |
841 | const gdb_byte *result = value_contents_for_printing (value); | |
842 | require_not_optimized_out (value); | |
4e07d55f | 843 | require_available (value); |
0e03807e TT |
844 | return result; |
845 | } | |
846 | ||
39d37385 PA |
847 | /* Copy LENGTH bytes of SRC value's contents starting at SRC_OFFSET, |
848 | into DST value's contents, starting at DST_OFFSET. If unavailable | |
849 | contents are being copied from SRC, the corresponding DST contents | |
850 | are marked unavailable accordingly. Neither DST nor SRC may be | |
851 | lazy values. */ | |
852 | ||
853 | void | |
854 | value_contents_copy_raw (struct value *dst, int dst_offset, | |
855 | struct value *src, int src_offset, int length) | |
856 | { | |
857 | range_s *r; | |
858 | int i; | |
859 | ||
860 | /* A lazy DST would make that this copy operation useless, since as | |
861 | soon as DST's contents were un-lazied (by a later value_contents | |
862 | call, say), the contents would be overwritten. A lazy SRC would | |
863 | mean we'd be copying garbage. */ | |
864 | gdb_assert (!dst->lazy && !src->lazy); | |
865 | ||
866 | /* Copy the data. */ | |
867 | memcpy (value_contents_all_raw (dst) + dst_offset, | |
868 | value_contents_all_raw (src) + src_offset, | |
869 | length); | |
870 | ||
871 | /* Copy the meta-data, adjusted. */ | |
872 | for (i = 0; VEC_iterate (range_s, src->unavailable, i, r); i++) | |
873 | { | |
874 | ULONGEST h, l; | |
875 | ||
876 | l = max (r->offset, src_offset); | |
877 | h = min (r->offset + r->length, src_offset + length); | |
878 | ||
879 | if (l < h) | |
880 | mark_value_bytes_unavailable (dst, | |
881 | dst_offset + (l - src_offset), | |
882 | h - l); | |
883 | } | |
884 | } | |
885 | ||
886 | /* Copy LENGTH bytes of SRC value's contents starting at SRC_OFFSET | |
887 | byte, into DST value's contents, starting at DST_OFFSET. If | |
888 | unavailable contents are being copied from SRC, the corresponding | |
889 | DST contents are marked unavailable accordingly. DST must not be | |
890 | lazy. If SRC is lazy, it will be fetched now. If SRC is not valid | |
891 | (is optimized out), an error is thrown. */ | |
892 | ||
893 | void | |
894 | value_contents_copy (struct value *dst, int dst_offset, | |
895 | struct value *src, int src_offset, int length) | |
896 | { | |
897 | require_not_optimized_out (src); | |
898 | ||
899 | if (src->lazy) | |
900 | value_fetch_lazy (src); | |
901 | ||
902 | value_contents_copy_raw (dst, dst_offset, src, src_offset, length); | |
903 | } | |
904 | ||
d69fe07e AC |
905 | int |
906 | value_lazy (struct value *value) | |
907 | { | |
908 | return value->lazy; | |
909 | } | |
910 | ||
dfa52d88 AC |
911 | void |
912 | set_value_lazy (struct value *value, int val) | |
913 | { | |
914 | value->lazy = val; | |
915 | } | |
916 | ||
4e5d721f DE |
917 | int |
918 | value_stack (struct value *value) | |
919 | { | |
920 | return value->stack; | |
921 | } | |
922 | ||
923 | void | |
924 | set_value_stack (struct value *value, int val) | |
925 | { | |
926 | value->stack = val; | |
927 | } | |
928 | ||
fc1a4b47 | 929 | const gdb_byte * |
0fd88904 AC |
930 | value_contents (struct value *value) |
931 | { | |
0e03807e TT |
932 | const gdb_byte *result = value_contents_writeable (value); |
933 | require_not_optimized_out (value); | |
4e07d55f | 934 | require_available (value); |
0e03807e | 935 | return result; |
0fd88904 AC |
936 | } |
937 | ||
fc1a4b47 | 938 | gdb_byte * |
0fd88904 AC |
939 | value_contents_writeable (struct value *value) |
940 | { | |
941 | if (value->lazy) | |
942 | value_fetch_lazy (value); | |
fc0c53a0 | 943 | return value_contents_raw (value); |
0fd88904 AC |
944 | } |
945 | ||
a6c442d8 MK |
946 | /* Return non-zero if VAL1 and VAL2 have the same contents. Note that |
947 | this function is different from value_equal; in C the operator == | |
948 | can return 0 even if the two values being compared are equal. */ | |
949 | ||
950 | int | |
951 | value_contents_equal (struct value *val1, struct value *val2) | |
952 | { | |
953 | struct type *type1; | |
954 | struct type *type2; | |
955 | int len; | |
956 | ||
957 | type1 = check_typedef (value_type (val1)); | |
958 | type2 = check_typedef (value_type (val2)); | |
959 | len = TYPE_LENGTH (type1); | |
960 | if (len != TYPE_LENGTH (type2)) | |
961 | return 0; | |
962 | ||
963 | return (memcmp (value_contents (val1), value_contents (val2), len) == 0); | |
964 | } | |
965 | ||
feb13ab0 AC |
966 | int |
967 | value_optimized_out (struct value *value) | |
968 | { | |
969 | return value->optimized_out; | |
970 | } | |
971 | ||
972 | void | |
973 | set_value_optimized_out (struct value *value, int val) | |
974 | { | |
975 | value->optimized_out = val; | |
976 | } | |
13c3b5f5 | 977 | |
0e03807e TT |
978 | int |
979 | value_entirely_optimized_out (const struct value *value) | |
980 | { | |
981 | if (!value->optimized_out) | |
982 | return 0; | |
983 | if (value->lval != lval_computed | |
ba19bb4d | 984 | || !value->location.computed.funcs->check_any_valid) |
0e03807e | 985 | return 1; |
b65c7efe | 986 | return !value->location.computed.funcs->check_any_valid (value); |
0e03807e TT |
987 | } |
988 | ||
989 | int | |
990 | value_bits_valid (const struct value *value, int offset, int length) | |
991 | { | |
e7303042 | 992 | if (!value->optimized_out) |
0e03807e TT |
993 | return 1; |
994 | if (value->lval != lval_computed | |
995 | || !value->location.computed.funcs->check_validity) | |
996 | return 0; | |
997 | return value->location.computed.funcs->check_validity (value, offset, | |
998 | length); | |
999 | } | |
1000 | ||
8cf6f0b1 TT |
1001 | int |
1002 | value_bits_synthetic_pointer (const struct value *value, | |
1003 | int offset, int length) | |
1004 | { | |
e7303042 | 1005 | if (value->lval != lval_computed |
8cf6f0b1 TT |
1006 | || !value->location.computed.funcs->check_synthetic_pointer) |
1007 | return 0; | |
1008 | return value->location.computed.funcs->check_synthetic_pointer (value, | |
1009 | offset, | |
1010 | length); | |
1011 | } | |
1012 | ||
13c3b5f5 AC |
1013 | int |
1014 | value_embedded_offset (struct value *value) | |
1015 | { | |
1016 | return value->embedded_offset; | |
1017 | } | |
1018 | ||
1019 | void | |
1020 | set_value_embedded_offset (struct value *value, int val) | |
1021 | { | |
1022 | value->embedded_offset = val; | |
1023 | } | |
b44d461b AC |
1024 | |
1025 | int | |
1026 | value_pointed_to_offset (struct value *value) | |
1027 | { | |
1028 | return value->pointed_to_offset; | |
1029 | } | |
1030 | ||
1031 | void | |
1032 | set_value_pointed_to_offset (struct value *value, int val) | |
1033 | { | |
1034 | value->pointed_to_offset = val; | |
1035 | } | |
13bb5560 | 1036 | |
5f5233d4 PA |
1037 | struct lval_funcs * |
1038 | value_computed_funcs (struct value *v) | |
1039 | { | |
1040 | gdb_assert (VALUE_LVAL (v) == lval_computed); | |
1041 | ||
1042 | return v->location.computed.funcs; | |
1043 | } | |
1044 | ||
1045 | void * | |
0e03807e | 1046 | value_computed_closure (const struct value *v) |
5f5233d4 | 1047 | { |
0e03807e | 1048 | gdb_assert (v->lval == lval_computed); |
5f5233d4 PA |
1049 | |
1050 | return v->location.computed.closure; | |
1051 | } | |
1052 | ||
13bb5560 AC |
1053 | enum lval_type * |
1054 | deprecated_value_lval_hack (struct value *value) | |
1055 | { | |
1056 | return &value->lval; | |
1057 | } | |
1058 | ||
42ae5230 | 1059 | CORE_ADDR |
de4127a3 | 1060 | value_address (const struct value *value) |
42ae5230 TT |
1061 | { |
1062 | if (value->lval == lval_internalvar | |
1063 | || value->lval == lval_internalvar_component) | |
1064 | return 0; | |
1065 | return value->location.address + value->offset; | |
1066 | } | |
1067 | ||
1068 | CORE_ADDR | |
1069 | value_raw_address (struct value *value) | |
1070 | { | |
1071 | if (value->lval == lval_internalvar | |
1072 | || value->lval == lval_internalvar_component) | |
1073 | return 0; | |
1074 | return value->location.address; | |
1075 | } | |
1076 | ||
1077 | void | |
1078 | set_value_address (struct value *value, CORE_ADDR addr) | |
13bb5560 | 1079 | { |
42ae5230 TT |
1080 | gdb_assert (value->lval != lval_internalvar |
1081 | && value->lval != lval_internalvar_component); | |
1082 | value->location.address = addr; | |
13bb5560 AC |
1083 | } |
1084 | ||
1085 | struct internalvar ** | |
1086 | deprecated_value_internalvar_hack (struct value *value) | |
1087 | { | |
1088 | return &value->location.internalvar; | |
1089 | } | |
1090 | ||
1091 | struct frame_id * | |
1092 | deprecated_value_frame_id_hack (struct value *value) | |
1093 | { | |
1094 | return &value->frame_id; | |
1095 | } | |
1096 | ||
1097 | short * | |
1098 | deprecated_value_regnum_hack (struct value *value) | |
1099 | { | |
1100 | return &value->regnum; | |
1101 | } | |
88e3b34b AC |
1102 | |
1103 | int | |
1104 | deprecated_value_modifiable (struct value *value) | |
1105 | { | |
1106 | return value->modifiable; | |
1107 | } | |
1108 | void | |
1109 | deprecated_set_value_modifiable (struct value *value, int modifiable) | |
1110 | { | |
1111 | value->modifiable = modifiable; | |
1112 | } | |
990a07ab | 1113 | \f |
c906108c SS |
1114 | /* Return a mark in the value chain. All values allocated after the |
1115 | mark is obtained (except for those released) are subject to being freed | |
1116 | if a subsequent value_free_to_mark is passed the mark. */ | |
f23631e4 | 1117 | struct value * |
fba45db2 | 1118 | value_mark (void) |
c906108c SS |
1119 | { |
1120 | return all_values; | |
1121 | } | |
1122 | ||
828d3400 DJ |
1123 | /* Take a reference to VAL. VAL will not be deallocated until all |
1124 | references are released. */ | |
1125 | ||
1126 | void | |
1127 | value_incref (struct value *val) | |
1128 | { | |
1129 | val->reference_count++; | |
1130 | } | |
1131 | ||
1132 | /* Release a reference to VAL, which was acquired with value_incref. | |
1133 | This function is also called to deallocate values from the value | |
1134 | chain. */ | |
1135 | ||
3e3d7139 JG |
1136 | void |
1137 | value_free (struct value *val) | |
1138 | { | |
1139 | if (val) | |
5f5233d4 | 1140 | { |
828d3400 DJ |
1141 | gdb_assert (val->reference_count > 0); |
1142 | val->reference_count--; | |
1143 | if (val->reference_count > 0) | |
1144 | return; | |
1145 | ||
4ea48cc1 DJ |
1146 | /* If there's an associated parent value, drop our reference to |
1147 | it. */ | |
1148 | if (val->parent != NULL) | |
1149 | value_free (val->parent); | |
1150 | ||
5f5233d4 PA |
1151 | if (VALUE_LVAL (val) == lval_computed) |
1152 | { | |
1153 | struct lval_funcs *funcs = val->location.computed.funcs; | |
1154 | ||
1155 | if (funcs->free_closure) | |
1156 | funcs->free_closure (val); | |
1157 | } | |
1158 | ||
1159 | xfree (val->contents); | |
4e07d55f | 1160 | VEC_free (range_s, val->unavailable); |
5f5233d4 | 1161 | } |
3e3d7139 JG |
1162 | xfree (val); |
1163 | } | |
1164 | ||
c906108c SS |
1165 | /* Free all values allocated since MARK was obtained by value_mark |
1166 | (except for those released). */ | |
1167 | void | |
f23631e4 | 1168 | value_free_to_mark (struct value *mark) |
c906108c | 1169 | { |
f23631e4 AC |
1170 | struct value *val; |
1171 | struct value *next; | |
c906108c SS |
1172 | |
1173 | for (val = all_values; val && val != mark; val = next) | |
1174 | { | |
df407dfe | 1175 | next = val->next; |
c906108c SS |
1176 | value_free (val); |
1177 | } | |
1178 | all_values = val; | |
1179 | } | |
1180 | ||
1181 | /* Free all the values that have been allocated (except for those released). | |
725e88af DE |
1182 | Call after each command, successful or not. |
1183 | In practice this is called before each command, which is sufficient. */ | |
c906108c SS |
1184 | |
1185 | void | |
fba45db2 | 1186 | free_all_values (void) |
c906108c | 1187 | { |
f23631e4 AC |
1188 | struct value *val; |
1189 | struct value *next; | |
c906108c SS |
1190 | |
1191 | for (val = all_values; val; val = next) | |
1192 | { | |
df407dfe | 1193 | next = val->next; |
c906108c SS |
1194 | value_free (val); |
1195 | } | |
1196 | ||
1197 | all_values = 0; | |
1198 | } | |
1199 | ||
0cf6dd15 TJB |
1200 | /* Frees all the elements in a chain of values. */ |
1201 | ||
1202 | void | |
1203 | free_value_chain (struct value *v) | |
1204 | { | |
1205 | struct value *next; | |
1206 | ||
1207 | for (; v; v = next) | |
1208 | { | |
1209 | next = value_next (v); | |
1210 | value_free (v); | |
1211 | } | |
1212 | } | |
1213 | ||
c906108c SS |
1214 | /* Remove VAL from the chain all_values |
1215 | so it will not be freed automatically. */ | |
1216 | ||
1217 | void | |
f23631e4 | 1218 | release_value (struct value *val) |
c906108c | 1219 | { |
f23631e4 | 1220 | struct value *v; |
c906108c SS |
1221 | |
1222 | if (all_values == val) | |
1223 | { | |
1224 | all_values = val->next; | |
06a64a0b | 1225 | val->next = NULL; |
c906108c SS |
1226 | return; |
1227 | } | |
1228 | ||
1229 | for (v = all_values; v; v = v->next) | |
1230 | { | |
1231 | if (v->next == val) | |
1232 | { | |
1233 | v->next = val->next; | |
06a64a0b | 1234 | val->next = NULL; |
c906108c SS |
1235 | break; |
1236 | } | |
1237 | } | |
1238 | } | |
1239 | ||
1240 | /* Release all values up to mark */ | |
f23631e4 AC |
1241 | struct value * |
1242 | value_release_to_mark (struct value *mark) | |
c906108c | 1243 | { |
f23631e4 AC |
1244 | struct value *val; |
1245 | struct value *next; | |
c906108c | 1246 | |
df407dfe AC |
1247 | for (val = next = all_values; next; next = next->next) |
1248 | if (next->next == mark) | |
c906108c | 1249 | { |
df407dfe AC |
1250 | all_values = next->next; |
1251 | next->next = NULL; | |
c906108c SS |
1252 | return val; |
1253 | } | |
1254 | all_values = 0; | |
1255 | return val; | |
1256 | } | |
1257 | ||
1258 | /* Return a copy of the value ARG. | |
1259 | It contains the same contents, for same memory address, | |
1260 | but it's a different block of storage. */ | |
1261 | ||
f23631e4 AC |
1262 | struct value * |
1263 | value_copy (struct value *arg) | |
c906108c | 1264 | { |
4754a64e | 1265 | struct type *encl_type = value_enclosing_type (arg); |
3e3d7139 JG |
1266 | struct value *val; |
1267 | ||
1268 | if (value_lazy (arg)) | |
1269 | val = allocate_value_lazy (encl_type); | |
1270 | else | |
1271 | val = allocate_value (encl_type); | |
df407dfe | 1272 | val->type = arg->type; |
c906108c | 1273 | VALUE_LVAL (val) = VALUE_LVAL (arg); |
6f7c8fc2 | 1274 | val->location = arg->location; |
df407dfe AC |
1275 | val->offset = arg->offset; |
1276 | val->bitpos = arg->bitpos; | |
1277 | val->bitsize = arg->bitsize; | |
1df6926e | 1278 | VALUE_FRAME_ID (val) = VALUE_FRAME_ID (arg); |
9ee8fc9d | 1279 | VALUE_REGNUM (val) = VALUE_REGNUM (arg); |
d69fe07e | 1280 | val->lazy = arg->lazy; |
feb13ab0 | 1281 | val->optimized_out = arg->optimized_out; |
13c3b5f5 | 1282 | val->embedded_offset = value_embedded_offset (arg); |
b44d461b | 1283 | val->pointed_to_offset = arg->pointed_to_offset; |
c906108c | 1284 | val->modifiable = arg->modifiable; |
d69fe07e | 1285 | if (!value_lazy (val)) |
c906108c | 1286 | { |
990a07ab | 1287 | memcpy (value_contents_all_raw (val), value_contents_all_raw (arg), |
4754a64e | 1288 | TYPE_LENGTH (value_enclosing_type (arg))); |
c906108c SS |
1289 | |
1290 | } | |
4e07d55f | 1291 | val->unavailable = VEC_copy (range_s, arg->unavailable); |
4ea48cc1 DJ |
1292 | val->parent = arg->parent; |
1293 | if (val->parent) | |
1294 | value_incref (val->parent); | |
5f5233d4 PA |
1295 | if (VALUE_LVAL (val) == lval_computed) |
1296 | { | |
1297 | struct lval_funcs *funcs = val->location.computed.funcs; | |
1298 | ||
1299 | if (funcs->copy_closure) | |
1300 | val->location.computed.closure = funcs->copy_closure (val); | |
1301 | } | |
c906108c SS |
1302 | return val; |
1303 | } | |
74bcbdf3 | 1304 | |
c37f7098 KW |
1305 | /* Return a version of ARG that is non-lvalue. */ |
1306 | ||
1307 | struct value * | |
1308 | value_non_lval (struct value *arg) | |
1309 | { | |
1310 | if (VALUE_LVAL (arg) != not_lval) | |
1311 | { | |
1312 | struct type *enc_type = value_enclosing_type (arg); | |
1313 | struct value *val = allocate_value (enc_type); | |
1314 | ||
1315 | memcpy (value_contents_all_raw (val), value_contents_all (arg), | |
1316 | TYPE_LENGTH (enc_type)); | |
1317 | val->type = arg->type; | |
1318 | set_value_embedded_offset (val, value_embedded_offset (arg)); | |
1319 | set_value_pointed_to_offset (val, value_pointed_to_offset (arg)); | |
1320 | return val; | |
1321 | } | |
1322 | return arg; | |
1323 | } | |
1324 | ||
74bcbdf3 | 1325 | void |
0e03807e TT |
1326 | set_value_component_location (struct value *component, |
1327 | const struct value *whole) | |
74bcbdf3 | 1328 | { |
0e03807e | 1329 | if (whole->lval == lval_internalvar) |
74bcbdf3 PA |
1330 | VALUE_LVAL (component) = lval_internalvar_component; |
1331 | else | |
0e03807e | 1332 | VALUE_LVAL (component) = whole->lval; |
5f5233d4 | 1333 | |
74bcbdf3 | 1334 | component->location = whole->location; |
0e03807e | 1335 | if (whole->lval == lval_computed) |
5f5233d4 PA |
1336 | { |
1337 | struct lval_funcs *funcs = whole->location.computed.funcs; | |
1338 | ||
1339 | if (funcs->copy_closure) | |
1340 | component->location.computed.closure = funcs->copy_closure (whole); | |
1341 | } | |
74bcbdf3 PA |
1342 | } |
1343 | ||
c906108c SS |
1344 | \f |
1345 | /* Access to the value history. */ | |
1346 | ||
1347 | /* Record a new value in the value history. | |
1348 | Returns the absolute history index of the entry. | |
1349 | Result of -1 indicates the value was not saved; otherwise it is the | |
1350 | value history index of this new item. */ | |
1351 | ||
1352 | int | |
f23631e4 | 1353 | record_latest_value (struct value *val) |
c906108c SS |
1354 | { |
1355 | int i; | |
1356 | ||
1357 | /* We don't want this value to have anything to do with the inferior anymore. | |
1358 | In particular, "set $1 = 50" should not affect the variable from which | |
1359 | the value was taken, and fast watchpoints should be able to assume that | |
1360 | a value on the value history never changes. */ | |
d69fe07e | 1361 | if (value_lazy (val)) |
c906108c SS |
1362 | value_fetch_lazy (val); |
1363 | /* We preserve VALUE_LVAL so that the user can find out where it was fetched | |
1364 | from. This is a bit dubious, because then *&$1 does not just return $1 | |
1365 | but the current contents of that location. c'est la vie... */ | |
1366 | val->modifiable = 0; | |
1367 | release_value (val); | |
1368 | ||
1369 | /* Here we treat value_history_count as origin-zero | |
1370 | and applying to the value being stored now. */ | |
1371 | ||
1372 | i = value_history_count % VALUE_HISTORY_CHUNK; | |
1373 | if (i == 0) | |
1374 | { | |
f23631e4 | 1375 | struct value_history_chunk *new |
a109c7c1 MS |
1376 | = (struct value_history_chunk *) |
1377 | ||
c5aa993b | 1378 | xmalloc (sizeof (struct value_history_chunk)); |
c906108c SS |
1379 | memset (new->values, 0, sizeof new->values); |
1380 | new->next = value_history_chain; | |
1381 | value_history_chain = new; | |
1382 | } | |
1383 | ||
1384 | value_history_chain->values[i] = val; | |
1385 | ||
1386 | /* Now we regard value_history_count as origin-one | |
1387 | and applying to the value just stored. */ | |
1388 | ||
1389 | return ++value_history_count; | |
1390 | } | |
1391 | ||
1392 | /* Return a copy of the value in the history with sequence number NUM. */ | |
1393 | ||
f23631e4 | 1394 | struct value * |
fba45db2 | 1395 | access_value_history (int num) |
c906108c | 1396 | { |
f23631e4 | 1397 | struct value_history_chunk *chunk; |
52f0bd74 AC |
1398 | int i; |
1399 | int absnum = num; | |
c906108c SS |
1400 | |
1401 | if (absnum <= 0) | |
1402 | absnum += value_history_count; | |
1403 | ||
1404 | if (absnum <= 0) | |
1405 | { | |
1406 | if (num == 0) | |
8a3fe4f8 | 1407 | error (_("The history is empty.")); |
c906108c | 1408 | else if (num == 1) |
8a3fe4f8 | 1409 | error (_("There is only one value in the history.")); |
c906108c | 1410 | else |
8a3fe4f8 | 1411 | error (_("History does not go back to $$%d."), -num); |
c906108c SS |
1412 | } |
1413 | if (absnum > value_history_count) | |
8a3fe4f8 | 1414 | error (_("History has not yet reached $%d."), absnum); |
c906108c SS |
1415 | |
1416 | absnum--; | |
1417 | ||
1418 | /* Now absnum is always absolute and origin zero. */ | |
1419 | ||
1420 | chunk = value_history_chain; | |
3e43a32a MS |
1421 | for (i = (value_history_count - 1) / VALUE_HISTORY_CHUNK |
1422 | - absnum / VALUE_HISTORY_CHUNK; | |
c906108c SS |
1423 | i > 0; i--) |
1424 | chunk = chunk->next; | |
1425 | ||
1426 | return value_copy (chunk->values[absnum % VALUE_HISTORY_CHUNK]); | |
1427 | } | |
1428 | ||
c906108c | 1429 | static void |
fba45db2 | 1430 | show_values (char *num_exp, int from_tty) |
c906108c | 1431 | { |
52f0bd74 | 1432 | int i; |
f23631e4 | 1433 | struct value *val; |
c906108c SS |
1434 | static int num = 1; |
1435 | ||
1436 | if (num_exp) | |
1437 | { | |
f132ba9d TJB |
1438 | /* "show values +" should print from the stored position. |
1439 | "show values <exp>" should print around value number <exp>. */ | |
c906108c | 1440 | if (num_exp[0] != '+' || num_exp[1] != '\0') |
bb518678 | 1441 | num = parse_and_eval_long (num_exp) - 5; |
c906108c SS |
1442 | } |
1443 | else | |
1444 | { | |
f132ba9d | 1445 | /* "show values" means print the last 10 values. */ |
c906108c SS |
1446 | num = value_history_count - 9; |
1447 | } | |
1448 | ||
1449 | if (num <= 0) | |
1450 | num = 1; | |
1451 | ||
1452 | for (i = num; i < num + 10 && i <= value_history_count; i++) | |
1453 | { | |
79a45b7d | 1454 | struct value_print_options opts; |
a109c7c1 | 1455 | |
c906108c | 1456 | val = access_value_history (i); |
a3f17187 | 1457 | printf_filtered (("$%d = "), i); |
79a45b7d TT |
1458 | get_user_print_options (&opts); |
1459 | value_print (val, gdb_stdout, &opts); | |
a3f17187 | 1460 | printf_filtered (("\n")); |
c906108c SS |
1461 | } |
1462 | ||
f132ba9d | 1463 | /* The next "show values +" should start after what we just printed. */ |
c906108c SS |
1464 | num += 10; |
1465 | ||
1466 | /* Hitting just return after this command should do the same thing as | |
f132ba9d TJB |
1467 | "show values +". If num_exp is null, this is unnecessary, since |
1468 | "show values +" is not useful after "show values". */ | |
c906108c SS |
1469 | if (from_tty && num_exp) |
1470 | { | |
1471 | num_exp[0] = '+'; | |
1472 | num_exp[1] = '\0'; | |
1473 | } | |
1474 | } | |
1475 | \f | |
1476 | /* Internal variables. These are variables within the debugger | |
1477 | that hold values assigned by debugger commands. | |
1478 | The user refers to them with a '$' prefix | |
1479 | that does not appear in the variable names stored internally. */ | |
1480 | ||
4fa62494 UW |
1481 | struct internalvar |
1482 | { | |
1483 | struct internalvar *next; | |
1484 | char *name; | |
4fa62494 | 1485 | |
78267919 UW |
1486 | /* We support various different kinds of content of an internal variable. |
1487 | enum internalvar_kind specifies the kind, and union internalvar_data | |
1488 | provides the data associated with this particular kind. */ | |
1489 | ||
1490 | enum internalvar_kind | |
1491 | { | |
1492 | /* The internal variable is empty. */ | |
1493 | INTERNALVAR_VOID, | |
1494 | ||
1495 | /* The value of the internal variable is provided directly as | |
1496 | a GDB value object. */ | |
1497 | INTERNALVAR_VALUE, | |
1498 | ||
1499 | /* A fresh value is computed via a call-back routine on every | |
1500 | access to the internal variable. */ | |
1501 | INTERNALVAR_MAKE_VALUE, | |
4fa62494 | 1502 | |
78267919 UW |
1503 | /* The internal variable holds a GDB internal convenience function. */ |
1504 | INTERNALVAR_FUNCTION, | |
1505 | ||
cab0c772 UW |
1506 | /* The variable holds an integer value. */ |
1507 | INTERNALVAR_INTEGER, | |
1508 | ||
78267919 UW |
1509 | /* The variable holds a GDB-provided string. */ |
1510 | INTERNALVAR_STRING, | |
1511 | ||
1512 | } kind; | |
4fa62494 | 1513 | |
4fa62494 UW |
1514 | union internalvar_data |
1515 | { | |
78267919 UW |
1516 | /* A value object used with INTERNALVAR_VALUE. */ |
1517 | struct value *value; | |
1518 | ||
1519 | /* The call-back routine used with INTERNALVAR_MAKE_VALUE. */ | |
1520 | internalvar_make_value make_value; | |
1521 | ||
1522 | /* The internal function used with INTERNALVAR_FUNCTION. */ | |
1523 | struct | |
1524 | { | |
1525 | struct internal_function *function; | |
1526 | /* True if this is the canonical name for the function. */ | |
1527 | int canonical; | |
1528 | } fn; | |
1529 | ||
cab0c772 | 1530 | /* An integer value used with INTERNALVAR_INTEGER. */ |
78267919 UW |
1531 | struct |
1532 | { | |
1533 | /* If type is non-NULL, it will be used as the type to generate | |
1534 | a value for this internal variable. If type is NULL, a default | |
1535 | integer type for the architecture is used. */ | |
1536 | struct type *type; | |
cab0c772 UW |
1537 | LONGEST val; |
1538 | } integer; | |
1539 | ||
78267919 UW |
1540 | /* A string value used with INTERNALVAR_STRING. */ |
1541 | char *string; | |
4fa62494 UW |
1542 | } u; |
1543 | }; | |
1544 | ||
c906108c SS |
1545 | static struct internalvar *internalvars; |
1546 | ||
3e43a32a MS |
1547 | /* If the variable does not already exist create it and give it the |
1548 | value given. If no value is given then the default is zero. */ | |
53e5f3cf AS |
1549 | static void |
1550 | init_if_undefined_command (char* args, int from_tty) | |
1551 | { | |
1552 | struct internalvar* intvar; | |
1553 | ||
1554 | /* Parse the expression - this is taken from set_command(). */ | |
1555 | struct expression *expr = parse_expression (args); | |
1556 | register struct cleanup *old_chain = | |
1557 | make_cleanup (free_current_contents, &expr); | |
1558 | ||
1559 | /* Validate the expression. | |
1560 | Was the expression an assignment? | |
1561 | Or even an expression at all? */ | |
1562 | if (expr->nelts == 0 || expr->elts[0].opcode != BINOP_ASSIGN) | |
1563 | error (_("Init-if-undefined requires an assignment expression.")); | |
1564 | ||
1565 | /* Extract the variable from the parsed expression. | |
1566 | In the case of an assign the lvalue will be in elts[1] and elts[2]. */ | |
1567 | if (expr->elts[1].opcode != OP_INTERNALVAR) | |
3e43a32a MS |
1568 | error (_("The first parameter to init-if-undefined " |
1569 | "should be a GDB variable.")); | |
53e5f3cf AS |
1570 | intvar = expr->elts[2].internalvar; |
1571 | ||
1572 | /* Only evaluate the expression if the lvalue is void. | |
1573 | This may still fail if the expresssion is invalid. */ | |
78267919 | 1574 | if (intvar->kind == INTERNALVAR_VOID) |
53e5f3cf AS |
1575 | evaluate_expression (expr); |
1576 | ||
1577 | do_cleanups (old_chain); | |
1578 | } | |
1579 | ||
1580 | ||
c906108c SS |
1581 | /* Look up an internal variable with name NAME. NAME should not |
1582 | normally include a dollar sign. | |
1583 | ||
1584 | If the specified internal variable does not exist, | |
c4a3d09a | 1585 | the return value is NULL. */ |
c906108c SS |
1586 | |
1587 | struct internalvar * | |
bc3b79fd | 1588 | lookup_only_internalvar (const char *name) |
c906108c | 1589 | { |
52f0bd74 | 1590 | struct internalvar *var; |
c906108c SS |
1591 | |
1592 | for (var = internalvars; var; var = var->next) | |
5cb316ef | 1593 | if (strcmp (var->name, name) == 0) |
c906108c SS |
1594 | return var; |
1595 | ||
c4a3d09a MF |
1596 | return NULL; |
1597 | } | |
1598 | ||
1599 | ||
1600 | /* Create an internal variable with name NAME and with a void value. | |
1601 | NAME should not normally include a dollar sign. */ | |
1602 | ||
1603 | struct internalvar * | |
bc3b79fd | 1604 | create_internalvar (const char *name) |
c4a3d09a MF |
1605 | { |
1606 | struct internalvar *var; | |
a109c7c1 | 1607 | |
c906108c | 1608 | var = (struct internalvar *) xmalloc (sizeof (struct internalvar)); |
1754f103 | 1609 | var->name = concat (name, (char *)NULL); |
78267919 | 1610 | var->kind = INTERNALVAR_VOID; |
c906108c SS |
1611 | var->next = internalvars; |
1612 | internalvars = var; | |
1613 | return var; | |
1614 | } | |
1615 | ||
4aa995e1 PA |
1616 | /* Create an internal variable with name NAME and register FUN as the |
1617 | function that value_of_internalvar uses to create a value whenever | |
1618 | this variable is referenced. NAME should not normally include a | |
1619 | dollar sign. */ | |
1620 | ||
1621 | struct internalvar * | |
1622 | create_internalvar_type_lazy (char *name, internalvar_make_value fun) | |
1623 | { | |
4fa62494 | 1624 | struct internalvar *var = create_internalvar (name); |
a109c7c1 | 1625 | |
78267919 UW |
1626 | var->kind = INTERNALVAR_MAKE_VALUE; |
1627 | var->u.make_value = fun; | |
4aa995e1 PA |
1628 | return var; |
1629 | } | |
c4a3d09a MF |
1630 | |
1631 | /* Look up an internal variable with name NAME. NAME should not | |
1632 | normally include a dollar sign. | |
1633 | ||
1634 | If the specified internal variable does not exist, | |
1635 | one is created, with a void value. */ | |
1636 | ||
1637 | struct internalvar * | |
bc3b79fd | 1638 | lookup_internalvar (const char *name) |
c4a3d09a MF |
1639 | { |
1640 | struct internalvar *var; | |
1641 | ||
1642 | var = lookup_only_internalvar (name); | |
1643 | if (var) | |
1644 | return var; | |
1645 | ||
1646 | return create_internalvar (name); | |
1647 | } | |
1648 | ||
78267919 UW |
1649 | /* Return current value of internal variable VAR. For variables that |
1650 | are not inherently typed, use a value type appropriate for GDBARCH. */ | |
1651 | ||
f23631e4 | 1652 | struct value * |
78267919 | 1653 | value_of_internalvar (struct gdbarch *gdbarch, struct internalvar *var) |
c906108c | 1654 | { |
f23631e4 | 1655 | struct value *val; |
0914bcdb SS |
1656 | struct trace_state_variable *tsv; |
1657 | ||
1658 | /* If there is a trace state variable of the same name, assume that | |
1659 | is what we really want to see. */ | |
1660 | tsv = find_trace_state_variable (var->name); | |
1661 | if (tsv) | |
1662 | { | |
1663 | tsv->value_known = target_get_trace_state_variable_value (tsv->number, | |
1664 | &(tsv->value)); | |
1665 | if (tsv->value_known) | |
1666 | val = value_from_longest (builtin_type (gdbarch)->builtin_int64, | |
1667 | tsv->value); | |
1668 | else | |
1669 | val = allocate_value (builtin_type (gdbarch)->builtin_void); | |
1670 | return val; | |
1671 | } | |
c906108c | 1672 | |
78267919 | 1673 | switch (var->kind) |
5f5233d4 | 1674 | { |
78267919 UW |
1675 | case INTERNALVAR_VOID: |
1676 | val = allocate_value (builtin_type (gdbarch)->builtin_void); | |
1677 | break; | |
4fa62494 | 1678 | |
78267919 UW |
1679 | case INTERNALVAR_FUNCTION: |
1680 | val = allocate_value (builtin_type (gdbarch)->internal_fn); | |
1681 | break; | |
4fa62494 | 1682 | |
cab0c772 UW |
1683 | case INTERNALVAR_INTEGER: |
1684 | if (!var->u.integer.type) | |
78267919 | 1685 | val = value_from_longest (builtin_type (gdbarch)->builtin_int, |
cab0c772 | 1686 | var->u.integer.val); |
78267919 | 1687 | else |
cab0c772 UW |
1688 | val = value_from_longest (var->u.integer.type, var->u.integer.val); |
1689 | break; | |
1690 | ||
78267919 UW |
1691 | case INTERNALVAR_STRING: |
1692 | val = value_cstring (var->u.string, strlen (var->u.string), | |
1693 | builtin_type (gdbarch)->builtin_char); | |
1694 | break; | |
4fa62494 | 1695 | |
78267919 UW |
1696 | case INTERNALVAR_VALUE: |
1697 | val = value_copy (var->u.value); | |
4aa995e1 PA |
1698 | if (value_lazy (val)) |
1699 | value_fetch_lazy (val); | |
78267919 | 1700 | break; |
4aa995e1 | 1701 | |
78267919 UW |
1702 | case INTERNALVAR_MAKE_VALUE: |
1703 | val = (*var->u.make_value) (gdbarch, var); | |
1704 | break; | |
1705 | ||
1706 | default: | |
9b20d036 | 1707 | internal_error (__FILE__, __LINE__, _("bad kind")); |
78267919 UW |
1708 | } |
1709 | ||
1710 | /* Change the VALUE_LVAL to lval_internalvar so that future operations | |
1711 | on this value go back to affect the original internal variable. | |
1712 | ||
1713 | Do not do this for INTERNALVAR_MAKE_VALUE variables, as those have | |
1714 | no underlying modifyable state in the internal variable. | |
1715 | ||
1716 | Likewise, if the variable's value is a computed lvalue, we want | |
1717 | references to it to produce another computed lvalue, where | |
1718 | references and assignments actually operate through the | |
1719 | computed value's functions. | |
1720 | ||
1721 | This means that internal variables with computed values | |
1722 | behave a little differently from other internal variables: | |
1723 | assignments to them don't just replace the previous value | |
1724 | altogether. At the moment, this seems like the behavior we | |
1725 | want. */ | |
1726 | ||
1727 | if (var->kind != INTERNALVAR_MAKE_VALUE | |
1728 | && val->lval != lval_computed) | |
1729 | { | |
1730 | VALUE_LVAL (val) = lval_internalvar; | |
1731 | VALUE_INTERNALVAR (val) = var; | |
5f5233d4 | 1732 | } |
d3c139e9 | 1733 | |
4fa62494 UW |
1734 | return val; |
1735 | } | |
d3c139e9 | 1736 | |
4fa62494 UW |
1737 | int |
1738 | get_internalvar_integer (struct internalvar *var, LONGEST *result) | |
1739 | { | |
3158c6ed | 1740 | if (var->kind == INTERNALVAR_INTEGER) |
4fa62494 | 1741 | { |
cab0c772 UW |
1742 | *result = var->u.integer.val; |
1743 | return 1; | |
3158c6ed | 1744 | } |
d3c139e9 | 1745 | |
3158c6ed PA |
1746 | if (var->kind == INTERNALVAR_VALUE) |
1747 | { | |
1748 | struct type *type = check_typedef (value_type (var->u.value)); | |
1749 | ||
1750 | if (TYPE_CODE (type) == TYPE_CODE_INT) | |
1751 | { | |
1752 | *result = value_as_long (var->u.value); | |
1753 | return 1; | |
1754 | } | |
4fa62494 | 1755 | } |
3158c6ed PA |
1756 | |
1757 | return 0; | |
4fa62494 | 1758 | } |
d3c139e9 | 1759 | |
4fa62494 UW |
1760 | static int |
1761 | get_internalvar_function (struct internalvar *var, | |
1762 | struct internal_function **result) | |
1763 | { | |
78267919 | 1764 | switch (var->kind) |
d3c139e9 | 1765 | { |
78267919 UW |
1766 | case INTERNALVAR_FUNCTION: |
1767 | *result = var->u.fn.function; | |
4fa62494 | 1768 | return 1; |
d3c139e9 | 1769 | |
4fa62494 UW |
1770 | default: |
1771 | return 0; | |
1772 | } | |
c906108c SS |
1773 | } |
1774 | ||
1775 | void | |
fba45db2 | 1776 | set_internalvar_component (struct internalvar *var, int offset, int bitpos, |
f23631e4 | 1777 | int bitsize, struct value *newval) |
c906108c | 1778 | { |
4fa62494 | 1779 | gdb_byte *addr; |
c906108c | 1780 | |
78267919 | 1781 | switch (var->kind) |
4fa62494 | 1782 | { |
78267919 UW |
1783 | case INTERNALVAR_VALUE: |
1784 | addr = value_contents_writeable (var->u.value); | |
4fa62494 UW |
1785 | |
1786 | if (bitsize) | |
50810684 | 1787 | modify_field (value_type (var->u.value), addr + offset, |
4fa62494 UW |
1788 | value_as_long (newval), bitpos, bitsize); |
1789 | else | |
1790 | memcpy (addr + offset, value_contents (newval), | |
1791 | TYPE_LENGTH (value_type (newval))); | |
1792 | break; | |
78267919 UW |
1793 | |
1794 | default: | |
1795 | /* We can never get a component of any other kind. */ | |
9b20d036 | 1796 | internal_error (__FILE__, __LINE__, _("set_internalvar_component")); |
4fa62494 | 1797 | } |
c906108c SS |
1798 | } |
1799 | ||
1800 | void | |
f23631e4 | 1801 | set_internalvar (struct internalvar *var, struct value *val) |
c906108c | 1802 | { |
78267919 | 1803 | enum internalvar_kind new_kind; |
4fa62494 | 1804 | union internalvar_data new_data = { 0 }; |
c906108c | 1805 | |
78267919 | 1806 | if (var->kind == INTERNALVAR_FUNCTION && var->u.fn.canonical) |
bc3b79fd TJB |
1807 | error (_("Cannot overwrite convenience function %s"), var->name); |
1808 | ||
4fa62494 | 1809 | /* Prepare new contents. */ |
78267919 | 1810 | switch (TYPE_CODE (check_typedef (value_type (val)))) |
4fa62494 UW |
1811 | { |
1812 | case TYPE_CODE_VOID: | |
78267919 | 1813 | new_kind = INTERNALVAR_VOID; |
4fa62494 UW |
1814 | break; |
1815 | ||
1816 | case TYPE_CODE_INTERNAL_FUNCTION: | |
1817 | gdb_assert (VALUE_LVAL (val) == lval_internalvar); | |
78267919 UW |
1818 | new_kind = INTERNALVAR_FUNCTION; |
1819 | get_internalvar_function (VALUE_INTERNALVAR (val), | |
1820 | &new_data.fn.function); | |
1821 | /* Copies created here are never canonical. */ | |
4fa62494 UW |
1822 | break; |
1823 | ||
4fa62494 | 1824 | default: |
78267919 UW |
1825 | new_kind = INTERNALVAR_VALUE; |
1826 | new_data.value = value_copy (val); | |
1827 | new_data.value->modifiable = 1; | |
4fa62494 UW |
1828 | |
1829 | /* Force the value to be fetched from the target now, to avoid problems | |
1830 | later when this internalvar is referenced and the target is gone or | |
1831 | has changed. */ | |
78267919 UW |
1832 | if (value_lazy (new_data.value)) |
1833 | value_fetch_lazy (new_data.value); | |
4fa62494 UW |
1834 | |
1835 | /* Release the value from the value chain to prevent it from being | |
1836 | deleted by free_all_values. From here on this function should not | |
1837 | call error () until new_data is installed into the var->u to avoid | |
1838 | leaking memory. */ | |
78267919 | 1839 | release_value (new_data.value); |
4fa62494 UW |
1840 | break; |
1841 | } | |
1842 | ||
1843 | /* Clean up old contents. */ | |
1844 | clear_internalvar (var); | |
1845 | ||
1846 | /* Switch over. */ | |
78267919 | 1847 | var->kind = new_kind; |
4fa62494 | 1848 | var->u = new_data; |
c906108c SS |
1849 | /* End code which must not call error(). */ |
1850 | } | |
1851 | ||
4fa62494 UW |
1852 | void |
1853 | set_internalvar_integer (struct internalvar *var, LONGEST l) | |
1854 | { | |
1855 | /* Clean up old contents. */ | |
1856 | clear_internalvar (var); | |
1857 | ||
cab0c772 UW |
1858 | var->kind = INTERNALVAR_INTEGER; |
1859 | var->u.integer.type = NULL; | |
1860 | var->u.integer.val = l; | |
78267919 UW |
1861 | } |
1862 | ||
1863 | void | |
1864 | set_internalvar_string (struct internalvar *var, const char *string) | |
1865 | { | |
1866 | /* Clean up old contents. */ | |
1867 | clear_internalvar (var); | |
1868 | ||
1869 | var->kind = INTERNALVAR_STRING; | |
1870 | var->u.string = xstrdup (string); | |
4fa62494 UW |
1871 | } |
1872 | ||
1873 | static void | |
1874 | set_internalvar_function (struct internalvar *var, struct internal_function *f) | |
1875 | { | |
1876 | /* Clean up old contents. */ | |
1877 | clear_internalvar (var); | |
1878 | ||
78267919 UW |
1879 | var->kind = INTERNALVAR_FUNCTION; |
1880 | var->u.fn.function = f; | |
1881 | var->u.fn.canonical = 1; | |
1882 | /* Variables installed here are always the canonical version. */ | |
4fa62494 UW |
1883 | } |
1884 | ||
1885 | void | |
1886 | clear_internalvar (struct internalvar *var) | |
1887 | { | |
1888 | /* Clean up old contents. */ | |
78267919 | 1889 | switch (var->kind) |
4fa62494 | 1890 | { |
78267919 UW |
1891 | case INTERNALVAR_VALUE: |
1892 | value_free (var->u.value); | |
1893 | break; | |
1894 | ||
1895 | case INTERNALVAR_STRING: | |
1896 | xfree (var->u.string); | |
4fa62494 UW |
1897 | break; |
1898 | ||
1899 | default: | |
4fa62494 UW |
1900 | break; |
1901 | } | |
1902 | ||
78267919 UW |
1903 | /* Reset to void kind. */ |
1904 | var->kind = INTERNALVAR_VOID; | |
4fa62494 UW |
1905 | } |
1906 | ||
c906108c | 1907 | char * |
fba45db2 | 1908 | internalvar_name (struct internalvar *var) |
c906108c SS |
1909 | { |
1910 | return var->name; | |
1911 | } | |
1912 | ||
4fa62494 UW |
1913 | static struct internal_function * |
1914 | create_internal_function (const char *name, | |
1915 | internal_function_fn handler, void *cookie) | |
bc3b79fd | 1916 | { |
bc3b79fd | 1917 | struct internal_function *ifn = XNEW (struct internal_function); |
a109c7c1 | 1918 | |
bc3b79fd TJB |
1919 | ifn->name = xstrdup (name); |
1920 | ifn->handler = handler; | |
1921 | ifn->cookie = cookie; | |
4fa62494 | 1922 | return ifn; |
bc3b79fd TJB |
1923 | } |
1924 | ||
1925 | char * | |
1926 | value_internal_function_name (struct value *val) | |
1927 | { | |
4fa62494 UW |
1928 | struct internal_function *ifn; |
1929 | int result; | |
1930 | ||
1931 | gdb_assert (VALUE_LVAL (val) == lval_internalvar); | |
1932 | result = get_internalvar_function (VALUE_INTERNALVAR (val), &ifn); | |
1933 | gdb_assert (result); | |
1934 | ||
bc3b79fd TJB |
1935 | return ifn->name; |
1936 | } | |
1937 | ||
1938 | struct value * | |
d452c4bc UW |
1939 | call_internal_function (struct gdbarch *gdbarch, |
1940 | const struct language_defn *language, | |
1941 | struct value *func, int argc, struct value **argv) | |
bc3b79fd | 1942 | { |
4fa62494 UW |
1943 | struct internal_function *ifn; |
1944 | int result; | |
1945 | ||
1946 | gdb_assert (VALUE_LVAL (func) == lval_internalvar); | |
1947 | result = get_internalvar_function (VALUE_INTERNALVAR (func), &ifn); | |
1948 | gdb_assert (result); | |
1949 | ||
d452c4bc | 1950 | return (*ifn->handler) (gdbarch, language, ifn->cookie, argc, argv); |
bc3b79fd TJB |
1951 | } |
1952 | ||
1953 | /* The 'function' command. This does nothing -- it is just a | |
1954 | placeholder to let "help function NAME" work. This is also used as | |
1955 | the implementation of the sub-command that is created when | |
1956 | registering an internal function. */ | |
1957 | static void | |
1958 | function_command (char *command, int from_tty) | |
1959 | { | |
1960 | /* Do nothing. */ | |
1961 | } | |
1962 | ||
1963 | /* Clean up if an internal function's command is destroyed. */ | |
1964 | static void | |
1965 | function_destroyer (struct cmd_list_element *self, void *ignore) | |
1966 | { | |
1967 | xfree (self->name); | |
1968 | xfree (self->doc); | |
1969 | } | |
1970 | ||
1971 | /* Add a new internal function. NAME is the name of the function; DOC | |
1972 | is a documentation string describing the function. HANDLER is | |
1973 | called when the function is invoked. COOKIE is an arbitrary | |
1974 | pointer which is passed to HANDLER and is intended for "user | |
1975 | data". */ | |
1976 | void | |
1977 | add_internal_function (const char *name, const char *doc, | |
1978 | internal_function_fn handler, void *cookie) | |
1979 | { | |
1980 | struct cmd_list_element *cmd; | |
4fa62494 | 1981 | struct internal_function *ifn; |
bc3b79fd | 1982 | struct internalvar *var = lookup_internalvar (name); |
4fa62494 UW |
1983 | |
1984 | ifn = create_internal_function (name, handler, cookie); | |
1985 | set_internalvar_function (var, ifn); | |
bc3b79fd TJB |
1986 | |
1987 | cmd = add_cmd (xstrdup (name), no_class, function_command, (char *) doc, | |
1988 | &functionlist); | |
1989 | cmd->destroyer = function_destroyer; | |
1990 | } | |
1991 | ||
ae5a43e0 DJ |
1992 | /* Update VALUE before discarding OBJFILE. COPIED_TYPES is used to |
1993 | prevent cycles / duplicates. */ | |
1994 | ||
4e7a5ef5 | 1995 | void |
ae5a43e0 DJ |
1996 | preserve_one_value (struct value *value, struct objfile *objfile, |
1997 | htab_t copied_types) | |
1998 | { | |
1999 | if (TYPE_OBJFILE (value->type) == objfile) | |
2000 | value->type = copy_type_recursive (objfile, value->type, copied_types); | |
2001 | ||
2002 | if (TYPE_OBJFILE (value->enclosing_type) == objfile) | |
2003 | value->enclosing_type = copy_type_recursive (objfile, | |
2004 | value->enclosing_type, | |
2005 | copied_types); | |
2006 | } | |
2007 | ||
78267919 UW |
2008 | /* Likewise for internal variable VAR. */ |
2009 | ||
2010 | static void | |
2011 | preserve_one_internalvar (struct internalvar *var, struct objfile *objfile, | |
2012 | htab_t copied_types) | |
2013 | { | |
2014 | switch (var->kind) | |
2015 | { | |
cab0c772 UW |
2016 | case INTERNALVAR_INTEGER: |
2017 | if (var->u.integer.type && TYPE_OBJFILE (var->u.integer.type) == objfile) | |
2018 | var->u.integer.type | |
2019 | = copy_type_recursive (objfile, var->u.integer.type, copied_types); | |
2020 | break; | |
2021 | ||
78267919 UW |
2022 | case INTERNALVAR_VALUE: |
2023 | preserve_one_value (var->u.value, objfile, copied_types); | |
2024 | break; | |
2025 | } | |
2026 | } | |
2027 | ||
ae5a43e0 DJ |
2028 | /* Update the internal variables and value history when OBJFILE is |
2029 | discarded; we must copy the types out of the objfile. New global types | |
2030 | will be created for every convenience variable which currently points to | |
2031 | this objfile's types, and the convenience variables will be adjusted to | |
2032 | use the new global types. */ | |
c906108c SS |
2033 | |
2034 | void | |
ae5a43e0 | 2035 | preserve_values (struct objfile *objfile) |
c906108c | 2036 | { |
ae5a43e0 DJ |
2037 | htab_t copied_types; |
2038 | struct value_history_chunk *cur; | |
52f0bd74 | 2039 | struct internalvar *var; |
ae5a43e0 | 2040 | int i; |
c906108c | 2041 | |
ae5a43e0 DJ |
2042 | /* Create the hash table. We allocate on the objfile's obstack, since |
2043 | it is soon to be deleted. */ | |
2044 | copied_types = create_copied_types_hash (objfile); | |
2045 | ||
2046 | for (cur = value_history_chain; cur; cur = cur->next) | |
2047 | for (i = 0; i < VALUE_HISTORY_CHUNK; i++) | |
2048 | if (cur->values[i]) | |
2049 | preserve_one_value (cur->values[i], objfile, copied_types); | |
2050 | ||
2051 | for (var = internalvars; var; var = var->next) | |
78267919 | 2052 | preserve_one_internalvar (var, objfile, copied_types); |
ae5a43e0 | 2053 | |
4e7a5ef5 | 2054 | preserve_python_values (objfile, copied_types); |
a08702d6 | 2055 | |
ae5a43e0 | 2056 | htab_delete (copied_types); |
c906108c SS |
2057 | } |
2058 | ||
2059 | static void | |
fba45db2 | 2060 | show_convenience (char *ignore, int from_tty) |
c906108c | 2061 | { |
e17c207e | 2062 | struct gdbarch *gdbarch = get_current_arch (); |
52f0bd74 | 2063 | struct internalvar *var; |
c906108c | 2064 | int varseen = 0; |
79a45b7d | 2065 | struct value_print_options opts; |
c906108c | 2066 | |
79a45b7d | 2067 | get_user_print_options (&opts); |
c906108c SS |
2068 | for (var = internalvars; var; var = var->next) |
2069 | { | |
c906108c SS |
2070 | if (!varseen) |
2071 | { | |
2072 | varseen = 1; | |
2073 | } | |
a3f17187 | 2074 | printf_filtered (("$%s = "), var->name); |
78267919 | 2075 | value_print (value_of_internalvar (gdbarch, var), gdb_stdout, |
79a45b7d | 2076 | &opts); |
a3f17187 | 2077 | printf_filtered (("\n")); |
c906108c SS |
2078 | } |
2079 | if (!varseen) | |
3e43a32a MS |
2080 | printf_unfiltered (_("No debugger convenience variables now defined.\n" |
2081 | "Convenience variables have " | |
2082 | "names starting with \"$\";\n" | |
2083 | "use \"set\" as in \"set " | |
2084 | "$foo = 5\" to define them.\n")); | |
c906108c SS |
2085 | } |
2086 | \f | |
2087 | /* Extract a value as a C number (either long or double). | |
2088 | Knows how to convert fixed values to double, or | |
2089 | floating values to long. | |
2090 | Does not deallocate the value. */ | |
2091 | ||
2092 | LONGEST | |
f23631e4 | 2093 | value_as_long (struct value *val) |
c906108c SS |
2094 | { |
2095 | /* This coerces arrays and functions, which is necessary (e.g. | |
2096 | in disassemble_command). It also dereferences references, which | |
2097 | I suspect is the most logical thing to do. */ | |
994b9211 | 2098 | val = coerce_array (val); |
0fd88904 | 2099 | return unpack_long (value_type (val), value_contents (val)); |
c906108c SS |
2100 | } |
2101 | ||
2102 | DOUBLEST | |
f23631e4 | 2103 | value_as_double (struct value *val) |
c906108c SS |
2104 | { |
2105 | DOUBLEST foo; | |
2106 | int inv; | |
c5aa993b | 2107 | |
0fd88904 | 2108 | foo = unpack_double (value_type (val), value_contents (val), &inv); |
c906108c | 2109 | if (inv) |
8a3fe4f8 | 2110 | error (_("Invalid floating value found in program.")); |
c906108c SS |
2111 | return foo; |
2112 | } | |
4ef30785 | 2113 | |
581e13c1 | 2114 | /* Extract a value as a C pointer. Does not deallocate the value. |
4478b372 JB |
2115 | Note that val's type may not actually be a pointer; value_as_long |
2116 | handles all the cases. */ | |
c906108c | 2117 | CORE_ADDR |
f23631e4 | 2118 | value_as_address (struct value *val) |
c906108c | 2119 | { |
50810684 UW |
2120 | struct gdbarch *gdbarch = get_type_arch (value_type (val)); |
2121 | ||
c906108c SS |
2122 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure |
2123 | whether we want this to be true eventually. */ | |
2124 | #if 0 | |
bf6ae464 | 2125 | /* gdbarch_addr_bits_remove is wrong if we are being called for a |
c906108c SS |
2126 | non-address (e.g. argument to "signal", "info break", etc.), or |
2127 | for pointers to char, in which the low bits *are* significant. */ | |
50810684 | 2128 | return gdbarch_addr_bits_remove (gdbarch, value_as_long (val)); |
c906108c | 2129 | #else |
f312f057 JB |
2130 | |
2131 | /* There are several targets (IA-64, PowerPC, and others) which | |
2132 | don't represent pointers to functions as simply the address of | |
2133 | the function's entry point. For example, on the IA-64, a | |
2134 | function pointer points to a two-word descriptor, generated by | |
2135 | the linker, which contains the function's entry point, and the | |
2136 | value the IA-64 "global pointer" register should have --- to | |
2137 | support position-independent code. The linker generates | |
2138 | descriptors only for those functions whose addresses are taken. | |
2139 | ||
2140 | On such targets, it's difficult for GDB to convert an arbitrary | |
2141 | function address into a function pointer; it has to either find | |
2142 | an existing descriptor for that function, or call malloc and | |
2143 | build its own. On some targets, it is impossible for GDB to | |
2144 | build a descriptor at all: the descriptor must contain a jump | |
2145 | instruction; data memory cannot be executed; and code memory | |
2146 | cannot be modified. | |
2147 | ||
2148 | Upon entry to this function, if VAL is a value of type `function' | |
2149 | (that is, TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FUNC), then | |
42ae5230 | 2150 | value_address (val) is the address of the function. This is what |
f312f057 JB |
2151 | you'll get if you evaluate an expression like `main'. The call |
2152 | to COERCE_ARRAY below actually does all the usual unary | |
2153 | conversions, which includes converting values of type `function' | |
2154 | to `pointer to function'. This is the challenging conversion | |
2155 | discussed above. Then, `unpack_long' will convert that pointer | |
2156 | back into an address. | |
2157 | ||
2158 | So, suppose the user types `disassemble foo' on an architecture | |
2159 | with a strange function pointer representation, on which GDB | |
2160 | cannot build its own descriptors, and suppose further that `foo' | |
2161 | has no linker-built descriptor. The address->pointer conversion | |
2162 | will signal an error and prevent the command from running, even | |
2163 | though the next step would have been to convert the pointer | |
2164 | directly back into the same address. | |
2165 | ||
2166 | The following shortcut avoids this whole mess. If VAL is a | |
2167 | function, just return its address directly. */ | |
df407dfe AC |
2168 | if (TYPE_CODE (value_type (val)) == TYPE_CODE_FUNC |
2169 | || TYPE_CODE (value_type (val)) == TYPE_CODE_METHOD) | |
42ae5230 | 2170 | return value_address (val); |
f312f057 | 2171 | |
994b9211 | 2172 | val = coerce_array (val); |
fc0c74b1 AC |
2173 | |
2174 | /* Some architectures (e.g. Harvard), map instruction and data | |
2175 | addresses onto a single large unified address space. For | |
2176 | instance: An architecture may consider a large integer in the | |
2177 | range 0x10000000 .. 0x1000ffff to already represent a data | |
2178 | addresses (hence not need a pointer to address conversion) while | |
2179 | a small integer would still need to be converted integer to | |
2180 | pointer to address. Just assume such architectures handle all | |
2181 | integer conversions in a single function. */ | |
2182 | ||
2183 | /* JimB writes: | |
2184 | ||
2185 | I think INTEGER_TO_ADDRESS is a good idea as proposed --- but we | |
2186 | must admonish GDB hackers to make sure its behavior matches the | |
2187 | compiler's, whenever possible. | |
2188 | ||
2189 | In general, I think GDB should evaluate expressions the same way | |
2190 | the compiler does. When the user copies an expression out of | |
2191 | their source code and hands it to a `print' command, they should | |
2192 | get the same value the compiler would have computed. Any | |
2193 | deviation from this rule can cause major confusion and annoyance, | |
2194 | and needs to be justified carefully. In other words, GDB doesn't | |
2195 | really have the freedom to do these conversions in clever and | |
2196 | useful ways. | |
2197 | ||
2198 | AndrewC pointed out that users aren't complaining about how GDB | |
2199 | casts integers to pointers; they are complaining that they can't | |
2200 | take an address from a disassembly listing and give it to `x/i'. | |
2201 | This is certainly important. | |
2202 | ||
79dd2d24 | 2203 | Adding an architecture method like integer_to_address() certainly |
fc0c74b1 AC |
2204 | makes it possible for GDB to "get it right" in all circumstances |
2205 | --- the target has complete control over how things get done, so | |
2206 | people can Do The Right Thing for their target without breaking | |
2207 | anyone else. The standard doesn't specify how integers get | |
2208 | converted to pointers; usually, the ABI doesn't either, but | |
2209 | ABI-specific code is a more reasonable place to handle it. */ | |
2210 | ||
df407dfe AC |
2211 | if (TYPE_CODE (value_type (val)) != TYPE_CODE_PTR |
2212 | && TYPE_CODE (value_type (val)) != TYPE_CODE_REF | |
50810684 UW |
2213 | && gdbarch_integer_to_address_p (gdbarch)) |
2214 | return gdbarch_integer_to_address (gdbarch, value_type (val), | |
0fd88904 | 2215 | value_contents (val)); |
fc0c74b1 | 2216 | |
0fd88904 | 2217 | return unpack_long (value_type (val), value_contents (val)); |
c906108c SS |
2218 | #endif |
2219 | } | |
2220 | \f | |
2221 | /* Unpack raw data (copied from debugee, target byte order) at VALADDR | |
2222 | as a long, or as a double, assuming the raw data is described | |
2223 | by type TYPE. Knows how to convert different sizes of values | |
2224 | and can convert between fixed and floating point. We don't assume | |
2225 | any alignment for the raw data. Return value is in host byte order. | |
2226 | ||
2227 | If you want functions and arrays to be coerced to pointers, and | |
2228 | references to be dereferenced, call value_as_long() instead. | |
2229 | ||
2230 | C++: It is assumed that the front-end has taken care of | |
2231 | all matters concerning pointers to members. A pointer | |
2232 | to member which reaches here is considered to be equivalent | |
2233 | to an INT (or some size). After all, it is only an offset. */ | |
2234 | ||
2235 | LONGEST | |
fc1a4b47 | 2236 | unpack_long (struct type *type, const gdb_byte *valaddr) |
c906108c | 2237 | { |
e17a4113 | 2238 | enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type)); |
52f0bd74 AC |
2239 | enum type_code code = TYPE_CODE (type); |
2240 | int len = TYPE_LENGTH (type); | |
2241 | int nosign = TYPE_UNSIGNED (type); | |
c906108c | 2242 | |
c906108c SS |
2243 | switch (code) |
2244 | { | |
2245 | case TYPE_CODE_TYPEDEF: | |
2246 | return unpack_long (check_typedef (type), valaddr); | |
2247 | case TYPE_CODE_ENUM: | |
4f2aea11 | 2248 | case TYPE_CODE_FLAGS: |
c906108c SS |
2249 | case TYPE_CODE_BOOL: |
2250 | case TYPE_CODE_INT: | |
2251 | case TYPE_CODE_CHAR: | |
2252 | case TYPE_CODE_RANGE: | |
0d5de010 | 2253 | case TYPE_CODE_MEMBERPTR: |
c906108c | 2254 | if (nosign) |
e17a4113 | 2255 | return extract_unsigned_integer (valaddr, len, byte_order); |
c906108c | 2256 | else |
e17a4113 | 2257 | return extract_signed_integer (valaddr, len, byte_order); |
c906108c SS |
2258 | |
2259 | case TYPE_CODE_FLT: | |
96d2f608 | 2260 | return extract_typed_floating (valaddr, type); |
c906108c | 2261 | |
4ef30785 TJB |
2262 | case TYPE_CODE_DECFLOAT: |
2263 | /* libdecnumber has a function to convert from decimal to integer, but | |
2264 | it doesn't work when the decimal number has a fractional part. */ | |
e17a4113 | 2265 | return decimal_to_doublest (valaddr, len, byte_order); |
4ef30785 | 2266 | |
c906108c SS |
2267 | case TYPE_CODE_PTR: |
2268 | case TYPE_CODE_REF: | |
2269 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure | |
c5aa993b | 2270 | whether we want this to be true eventually. */ |
4478b372 | 2271 | return extract_typed_address (valaddr, type); |
c906108c | 2272 | |
c906108c | 2273 | default: |
8a3fe4f8 | 2274 | error (_("Value can't be converted to integer.")); |
c906108c | 2275 | } |
c5aa993b | 2276 | return 0; /* Placate lint. */ |
c906108c SS |
2277 | } |
2278 | ||
2279 | /* Return a double value from the specified type and address. | |
2280 | INVP points to an int which is set to 0 for valid value, | |
2281 | 1 for invalid value (bad float format). In either case, | |
2282 | the returned double is OK to use. Argument is in target | |
2283 | format, result is in host format. */ | |
2284 | ||
2285 | DOUBLEST | |
fc1a4b47 | 2286 | unpack_double (struct type *type, const gdb_byte *valaddr, int *invp) |
c906108c | 2287 | { |
e17a4113 | 2288 | enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type)); |
c906108c SS |
2289 | enum type_code code; |
2290 | int len; | |
2291 | int nosign; | |
2292 | ||
581e13c1 | 2293 | *invp = 0; /* Assume valid. */ |
c906108c SS |
2294 | CHECK_TYPEDEF (type); |
2295 | code = TYPE_CODE (type); | |
2296 | len = TYPE_LENGTH (type); | |
2297 | nosign = TYPE_UNSIGNED (type); | |
2298 | if (code == TYPE_CODE_FLT) | |
2299 | { | |
75bc7ddf AC |
2300 | /* NOTE: cagney/2002-02-19: There was a test here to see if the |
2301 | floating-point value was valid (using the macro | |
2302 | INVALID_FLOAT). That test/macro have been removed. | |
2303 | ||
2304 | It turns out that only the VAX defined this macro and then | |
2305 | only in a non-portable way. Fixing the portability problem | |
2306 | wouldn't help since the VAX floating-point code is also badly | |
2307 | bit-rotten. The target needs to add definitions for the | |
ea06eb3d | 2308 | methods gdbarch_float_format and gdbarch_double_format - these |
75bc7ddf AC |
2309 | exactly describe the target floating-point format. The |
2310 | problem here is that the corresponding floatformat_vax_f and | |
2311 | floatformat_vax_d values these methods should be set to are | |
2312 | also not defined either. Oops! | |
2313 | ||
2314 | Hopefully someone will add both the missing floatformat | |
ac79b88b DJ |
2315 | definitions and the new cases for floatformat_is_valid (). */ |
2316 | ||
2317 | if (!floatformat_is_valid (floatformat_from_type (type), valaddr)) | |
2318 | { | |
2319 | *invp = 1; | |
2320 | return 0.0; | |
2321 | } | |
2322 | ||
96d2f608 | 2323 | return extract_typed_floating (valaddr, type); |
c906108c | 2324 | } |
4ef30785 | 2325 | else if (code == TYPE_CODE_DECFLOAT) |
e17a4113 | 2326 | return decimal_to_doublest (valaddr, len, byte_order); |
c906108c SS |
2327 | else if (nosign) |
2328 | { | |
2329 | /* Unsigned -- be sure we compensate for signed LONGEST. */ | |
c906108c | 2330 | return (ULONGEST) unpack_long (type, valaddr); |
c906108c SS |
2331 | } |
2332 | else | |
2333 | { | |
2334 | /* Signed -- we are OK with unpack_long. */ | |
2335 | return unpack_long (type, valaddr); | |
2336 | } | |
2337 | } | |
2338 | ||
2339 | /* Unpack raw data (copied from debugee, target byte order) at VALADDR | |
2340 | as a CORE_ADDR, assuming the raw data is described by type TYPE. | |
2341 | We don't assume any alignment for the raw data. Return value is in | |
2342 | host byte order. | |
2343 | ||
2344 | If you want functions and arrays to be coerced to pointers, and | |
1aa20aa8 | 2345 | references to be dereferenced, call value_as_address() instead. |
c906108c SS |
2346 | |
2347 | C++: It is assumed that the front-end has taken care of | |
2348 | all matters concerning pointers to members. A pointer | |
2349 | to member which reaches here is considered to be equivalent | |
2350 | to an INT (or some size). After all, it is only an offset. */ | |
2351 | ||
2352 | CORE_ADDR | |
fc1a4b47 | 2353 | unpack_pointer (struct type *type, const gdb_byte *valaddr) |
c906108c SS |
2354 | { |
2355 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure | |
2356 | whether we want this to be true eventually. */ | |
2357 | return unpack_long (type, valaddr); | |
2358 | } | |
4478b372 | 2359 | |
c906108c | 2360 | \f |
1596cb5d | 2361 | /* Get the value of the FIELDNO'th field (which must be static) of |
2c2738a0 | 2362 | TYPE. Return NULL if the field doesn't exist or has been |
581e13c1 | 2363 | optimized out. */ |
c906108c | 2364 | |
f23631e4 | 2365 | struct value * |
fba45db2 | 2366 | value_static_field (struct type *type, int fieldno) |
c906108c | 2367 | { |
948e66d9 DJ |
2368 | struct value *retval; |
2369 | ||
1596cb5d | 2370 | switch (TYPE_FIELD_LOC_KIND (type, fieldno)) |
c906108c | 2371 | { |
1596cb5d | 2372 | case FIELD_LOC_KIND_PHYSADDR: |
52e9fde8 SS |
2373 | retval = value_at_lazy (TYPE_FIELD_TYPE (type, fieldno), |
2374 | TYPE_FIELD_STATIC_PHYSADDR (type, fieldno)); | |
1596cb5d DE |
2375 | break; |
2376 | case FIELD_LOC_KIND_PHYSNAME: | |
c906108c SS |
2377 | { |
2378 | char *phys_name = TYPE_FIELD_STATIC_PHYSNAME (type, fieldno); | |
581e13c1 | 2379 | /* TYPE_FIELD_NAME (type, fieldno); */ |
2570f2b7 | 2380 | struct symbol *sym = lookup_symbol (phys_name, 0, VAR_DOMAIN, 0); |
94af9270 | 2381 | |
948e66d9 | 2382 | if (sym == NULL) |
c906108c | 2383 | { |
a109c7c1 | 2384 | /* With some compilers, e.g. HP aCC, static data members are |
581e13c1 | 2385 | reported as non-debuggable symbols. */ |
a109c7c1 MS |
2386 | struct minimal_symbol *msym = lookup_minimal_symbol (phys_name, |
2387 | NULL, NULL); | |
2388 | ||
c906108c SS |
2389 | if (!msym) |
2390 | return NULL; | |
2391 | else | |
c5aa993b | 2392 | { |
52e9fde8 SS |
2393 | retval = value_at_lazy (TYPE_FIELD_TYPE (type, fieldno), |
2394 | SYMBOL_VALUE_ADDRESS (msym)); | |
c906108c SS |
2395 | } |
2396 | } | |
2397 | else | |
515ed532 | 2398 | retval = value_of_variable (sym, NULL); |
1596cb5d | 2399 | break; |
c906108c | 2400 | } |
1596cb5d | 2401 | default: |
f3574227 | 2402 | gdb_assert_not_reached ("unexpected field location kind"); |
1596cb5d DE |
2403 | } |
2404 | ||
948e66d9 | 2405 | return retval; |
c906108c SS |
2406 | } |
2407 | ||
4dfea560 DE |
2408 | /* Change the enclosing type of a value object VAL to NEW_ENCL_TYPE. |
2409 | You have to be careful here, since the size of the data area for the value | |
2410 | is set by the length of the enclosing type. So if NEW_ENCL_TYPE is bigger | |
2411 | than the old enclosing type, you have to allocate more space for the | |
2412 | data. */ | |
2b127877 | 2413 | |
4dfea560 DE |
2414 | void |
2415 | set_value_enclosing_type (struct value *val, struct type *new_encl_type) | |
2b127877 | 2416 | { |
3e3d7139 JG |
2417 | if (TYPE_LENGTH (new_encl_type) > TYPE_LENGTH (value_enclosing_type (val))) |
2418 | val->contents = | |
2419 | (gdb_byte *) xrealloc (val->contents, TYPE_LENGTH (new_encl_type)); | |
2420 | ||
2421 | val->enclosing_type = new_encl_type; | |
2b127877 DB |
2422 | } |
2423 | ||
c906108c SS |
2424 | /* Given a value ARG1 (offset by OFFSET bytes) |
2425 | of a struct or union type ARG_TYPE, | |
2426 | extract and return the value of one of its (non-static) fields. | |
581e13c1 | 2427 | FIELDNO says which field. */ |
c906108c | 2428 | |
f23631e4 AC |
2429 | struct value * |
2430 | value_primitive_field (struct value *arg1, int offset, | |
aa1ee363 | 2431 | int fieldno, struct type *arg_type) |
c906108c | 2432 | { |
f23631e4 | 2433 | struct value *v; |
52f0bd74 | 2434 | struct type *type; |
c906108c SS |
2435 | |
2436 | CHECK_TYPEDEF (arg_type); | |
2437 | type = TYPE_FIELD_TYPE (arg_type, fieldno); | |
c54eabfa JK |
2438 | |
2439 | /* Call check_typedef on our type to make sure that, if TYPE | |
2440 | is a TYPE_CODE_TYPEDEF, its length is set to the length | |
2441 | of the target type instead of zero. However, we do not | |
2442 | replace the typedef type by the target type, because we want | |
2443 | to keep the typedef in order to be able to print the type | |
2444 | description correctly. */ | |
2445 | check_typedef (type); | |
c906108c SS |
2446 | |
2447 | /* Handle packed fields */ | |
2448 | ||
2449 | if (TYPE_FIELD_BITSIZE (arg_type, fieldno)) | |
2450 | { | |
4ea48cc1 DJ |
2451 | /* Create a new value for the bitfield, with bitpos and bitsize |
2452 | set. If possible, arrange offset and bitpos so that we can | |
2453 | do a single aligned read of the size of the containing type. | |
2454 | Otherwise, adjust offset to the byte containing the first | |
2455 | bit. Assume that the address, offset, and embedded offset | |
2456 | are sufficiently aligned. */ | |
2457 | int bitpos = TYPE_FIELD_BITPOS (arg_type, fieldno); | |
2458 | int container_bitsize = TYPE_LENGTH (type) * 8; | |
2459 | ||
2460 | v = allocate_value_lazy (type); | |
df407dfe | 2461 | v->bitsize = TYPE_FIELD_BITSIZE (arg_type, fieldno); |
4ea48cc1 DJ |
2462 | if ((bitpos % container_bitsize) + v->bitsize <= container_bitsize |
2463 | && TYPE_LENGTH (type) <= (int) sizeof (LONGEST)) | |
2464 | v->bitpos = bitpos % container_bitsize; | |
2465 | else | |
2466 | v->bitpos = bitpos % 8; | |
38f12cfc TT |
2467 | v->offset = (value_embedded_offset (arg1) |
2468 | + offset | |
2469 | + (bitpos - v->bitpos) / 8); | |
4ea48cc1 DJ |
2470 | v->parent = arg1; |
2471 | value_incref (v->parent); | |
2472 | if (!value_lazy (arg1)) | |
2473 | value_fetch_lazy (v); | |
c906108c SS |
2474 | } |
2475 | else if (fieldno < TYPE_N_BASECLASSES (arg_type)) | |
2476 | { | |
2477 | /* This field is actually a base subobject, so preserve the | |
39d37385 PA |
2478 | entire object's contents for later references to virtual |
2479 | bases, etc. */ | |
a4e2ee12 DJ |
2480 | |
2481 | /* Lazy register values with offsets are not supported. */ | |
2482 | if (VALUE_LVAL (arg1) == lval_register && value_lazy (arg1)) | |
2483 | value_fetch_lazy (arg1); | |
2484 | ||
2485 | if (value_lazy (arg1)) | |
3e3d7139 | 2486 | v = allocate_value_lazy (value_enclosing_type (arg1)); |
c906108c | 2487 | else |
3e3d7139 JG |
2488 | { |
2489 | v = allocate_value (value_enclosing_type (arg1)); | |
39d37385 PA |
2490 | value_contents_copy_raw (v, 0, arg1, 0, |
2491 | TYPE_LENGTH (value_enclosing_type (arg1))); | |
3e3d7139 JG |
2492 | } |
2493 | v->type = type; | |
df407dfe | 2494 | v->offset = value_offset (arg1); |
13c3b5f5 AC |
2495 | v->embedded_offset = (offset + value_embedded_offset (arg1) |
2496 | + TYPE_FIELD_BITPOS (arg_type, fieldno) / 8); | |
c906108c SS |
2497 | } |
2498 | else | |
2499 | { | |
2500 | /* Plain old data member */ | |
2501 | offset += TYPE_FIELD_BITPOS (arg_type, fieldno) / 8; | |
a4e2ee12 DJ |
2502 | |
2503 | /* Lazy register values with offsets are not supported. */ | |
2504 | if (VALUE_LVAL (arg1) == lval_register && value_lazy (arg1)) | |
2505 | value_fetch_lazy (arg1); | |
2506 | ||
2507 | if (value_lazy (arg1)) | |
3e3d7139 | 2508 | v = allocate_value_lazy (type); |
c906108c | 2509 | else |
3e3d7139 JG |
2510 | { |
2511 | v = allocate_value (type); | |
39d37385 PA |
2512 | value_contents_copy_raw (v, value_embedded_offset (v), |
2513 | arg1, value_embedded_offset (arg1) + offset, | |
2514 | TYPE_LENGTH (type)); | |
3e3d7139 | 2515 | } |
df407dfe | 2516 | v->offset = (value_offset (arg1) + offset |
13c3b5f5 | 2517 | + value_embedded_offset (arg1)); |
c906108c | 2518 | } |
74bcbdf3 | 2519 | set_value_component_location (v, arg1); |
9ee8fc9d | 2520 | VALUE_REGNUM (v) = VALUE_REGNUM (arg1); |
0c16dd26 | 2521 | VALUE_FRAME_ID (v) = VALUE_FRAME_ID (arg1); |
c906108c SS |
2522 | return v; |
2523 | } | |
2524 | ||
2525 | /* Given a value ARG1 of a struct or union type, | |
2526 | extract and return the value of one of its (non-static) fields. | |
581e13c1 | 2527 | FIELDNO says which field. */ |
c906108c | 2528 | |
f23631e4 | 2529 | struct value * |
aa1ee363 | 2530 | value_field (struct value *arg1, int fieldno) |
c906108c | 2531 | { |
df407dfe | 2532 | return value_primitive_field (arg1, 0, fieldno, value_type (arg1)); |
c906108c SS |
2533 | } |
2534 | ||
2535 | /* Return a non-virtual function as a value. | |
2536 | F is the list of member functions which contains the desired method. | |
0478d61c FF |
2537 | J is an index into F which provides the desired method. |
2538 | ||
2539 | We only use the symbol for its address, so be happy with either a | |
581e13c1 | 2540 | full symbol or a minimal symbol. */ |
c906108c | 2541 | |
f23631e4 | 2542 | struct value * |
3e43a32a MS |
2543 | value_fn_field (struct value **arg1p, struct fn_field *f, |
2544 | int j, struct type *type, | |
fba45db2 | 2545 | int offset) |
c906108c | 2546 | { |
f23631e4 | 2547 | struct value *v; |
52f0bd74 | 2548 | struct type *ftype = TYPE_FN_FIELD_TYPE (f, j); |
0478d61c | 2549 | char *physname = TYPE_FN_FIELD_PHYSNAME (f, j); |
c906108c | 2550 | struct symbol *sym; |
0478d61c | 2551 | struct minimal_symbol *msym; |
c906108c | 2552 | |
2570f2b7 | 2553 | sym = lookup_symbol (physname, 0, VAR_DOMAIN, 0); |
5ae326fa | 2554 | if (sym != NULL) |
0478d61c | 2555 | { |
5ae326fa AC |
2556 | msym = NULL; |
2557 | } | |
2558 | else | |
2559 | { | |
2560 | gdb_assert (sym == NULL); | |
0478d61c | 2561 | msym = lookup_minimal_symbol (physname, NULL, NULL); |
5ae326fa AC |
2562 | if (msym == NULL) |
2563 | return NULL; | |
0478d61c FF |
2564 | } |
2565 | ||
c906108c | 2566 | v = allocate_value (ftype); |
0478d61c FF |
2567 | if (sym) |
2568 | { | |
42ae5230 | 2569 | set_value_address (v, BLOCK_START (SYMBOL_BLOCK_VALUE (sym))); |
0478d61c FF |
2570 | } |
2571 | else | |
2572 | { | |
bccdca4a UW |
2573 | /* The minimal symbol might point to a function descriptor; |
2574 | resolve it to the actual code address instead. */ | |
2575 | struct objfile *objfile = msymbol_objfile (msym); | |
2576 | struct gdbarch *gdbarch = get_objfile_arch (objfile); | |
2577 | ||
42ae5230 TT |
2578 | set_value_address (v, |
2579 | gdbarch_convert_from_func_ptr_addr | |
2580 | (gdbarch, SYMBOL_VALUE_ADDRESS (msym), ¤t_target)); | |
0478d61c | 2581 | } |
c906108c SS |
2582 | |
2583 | if (arg1p) | |
c5aa993b | 2584 | { |
df407dfe | 2585 | if (type != value_type (*arg1p)) |
c5aa993b JM |
2586 | *arg1p = value_ind (value_cast (lookup_pointer_type (type), |
2587 | value_addr (*arg1p))); | |
2588 | ||
070ad9f0 | 2589 | /* Move the `this' pointer according to the offset. |
581e13c1 | 2590 | VALUE_OFFSET (*arg1p) += offset; */ |
c906108c SS |
2591 | } |
2592 | ||
2593 | return v; | |
2594 | } | |
2595 | ||
c906108c | 2596 | \f |
c906108c | 2597 | |
5467c6c8 PA |
2598 | /* Helper function for both unpack_value_bits_as_long and |
2599 | unpack_bits_as_long. See those functions for more details on the | |
2600 | interface; the only difference is that this function accepts either | |
2601 | a NULL or a non-NULL ORIGINAL_VALUE. */ | |
c906108c | 2602 | |
5467c6c8 PA |
2603 | static int |
2604 | unpack_value_bits_as_long_1 (struct type *field_type, const gdb_byte *valaddr, | |
2605 | int embedded_offset, int bitpos, int bitsize, | |
2606 | const struct value *original_value, | |
2607 | LONGEST *result) | |
c906108c | 2608 | { |
4ea48cc1 | 2609 | enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (field_type)); |
c906108c SS |
2610 | ULONGEST val; |
2611 | ULONGEST valmask; | |
c906108c | 2612 | int lsbcount; |
4a76eae5 | 2613 | int bytes_read; |
5467c6c8 | 2614 | int read_offset; |
c906108c | 2615 | |
4a76eae5 DJ |
2616 | /* Read the minimum number of bytes required; there may not be |
2617 | enough bytes to read an entire ULONGEST. */ | |
c906108c | 2618 | CHECK_TYPEDEF (field_type); |
4a76eae5 DJ |
2619 | if (bitsize) |
2620 | bytes_read = ((bitpos % 8) + bitsize + 7) / 8; | |
2621 | else | |
2622 | bytes_read = TYPE_LENGTH (field_type); | |
2623 | ||
5467c6c8 PA |
2624 | read_offset = bitpos / 8; |
2625 | ||
2626 | if (original_value != NULL | |
2627 | && !value_bytes_available (original_value, embedded_offset + read_offset, | |
2628 | bytes_read)) | |
2629 | return 0; | |
2630 | ||
2631 | val = extract_unsigned_integer (valaddr + embedded_offset + read_offset, | |
4a76eae5 | 2632 | bytes_read, byte_order); |
c906108c | 2633 | |
581e13c1 | 2634 | /* Extract bits. See comment above. */ |
c906108c | 2635 | |
4ea48cc1 | 2636 | if (gdbarch_bits_big_endian (get_type_arch (field_type))) |
4a76eae5 | 2637 | lsbcount = (bytes_read * 8 - bitpos % 8 - bitsize); |
c906108c SS |
2638 | else |
2639 | lsbcount = (bitpos % 8); | |
2640 | val >>= lsbcount; | |
2641 | ||
2642 | /* If the field does not entirely fill a LONGEST, then zero the sign bits. | |
581e13c1 | 2643 | If the field is signed, and is negative, then sign extend. */ |
c906108c SS |
2644 | |
2645 | if ((bitsize > 0) && (bitsize < 8 * (int) sizeof (val))) | |
2646 | { | |
2647 | valmask = (((ULONGEST) 1) << bitsize) - 1; | |
2648 | val &= valmask; | |
2649 | if (!TYPE_UNSIGNED (field_type)) | |
2650 | { | |
2651 | if (val & (valmask ^ (valmask >> 1))) | |
2652 | { | |
2653 | val |= ~valmask; | |
2654 | } | |
2655 | } | |
2656 | } | |
5467c6c8 PA |
2657 | |
2658 | *result = val; | |
2659 | return 1; | |
c906108c SS |
2660 | } |
2661 | ||
5467c6c8 PA |
2662 | /* Unpack a bitfield of the specified FIELD_TYPE, from the object at |
2663 | VALADDR + EMBEDDED_OFFSET, and store the result in *RESULT. | |
2664 | VALADDR points to the contents of ORIGINAL_VALUE, which must not be | |
2665 | NULL. The bitfield starts at BITPOS bits and contains BITSIZE | |
2666 | bits. | |
4ea48cc1 | 2667 | |
5467c6c8 PA |
2668 | Returns false if the value contents are unavailable, otherwise |
2669 | returns true, indicating a valid value has been stored in *RESULT. | |
2670 | ||
2671 | Extracting bits depends on endianness of the machine. Compute the | |
2672 | number of least significant bits to discard. For big endian machines, | |
2673 | we compute the total number of bits in the anonymous object, subtract | |
2674 | off the bit count from the MSB of the object to the MSB of the | |
2675 | bitfield, then the size of the bitfield, which leaves the LSB discard | |
2676 | count. For little endian machines, the discard count is simply the | |
2677 | number of bits from the LSB of the anonymous object to the LSB of the | |
2678 | bitfield. | |
2679 | ||
2680 | If the field is signed, we also do sign extension. */ | |
2681 | ||
2682 | int | |
2683 | unpack_value_bits_as_long (struct type *field_type, const gdb_byte *valaddr, | |
2684 | int embedded_offset, int bitpos, int bitsize, | |
2685 | const struct value *original_value, | |
2686 | LONGEST *result) | |
2687 | { | |
2688 | gdb_assert (original_value != NULL); | |
2689 | ||
2690 | return unpack_value_bits_as_long_1 (field_type, valaddr, embedded_offset, | |
2691 | bitpos, bitsize, original_value, result); | |
2692 | ||
2693 | } | |
2694 | ||
2695 | /* Unpack a field FIELDNO of the specified TYPE, from the object at | |
2696 | VALADDR + EMBEDDED_OFFSET. VALADDR points to the contents of | |
2697 | ORIGINAL_VALUE. See unpack_value_bits_as_long for more | |
2698 | details. */ | |
2699 | ||
2700 | static int | |
2701 | unpack_value_field_as_long_1 (struct type *type, const gdb_byte *valaddr, | |
2702 | int embedded_offset, int fieldno, | |
2703 | const struct value *val, LONGEST *result) | |
4ea48cc1 DJ |
2704 | { |
2705 | int bitpos = TYPE_FIELD_BITPOS (type, fieldno); | |
2706 | int bitsize = TYPE_FIELD_BITSIZE (type, fieldno); | |
2707 | struct type *field_type = TYPE_FIELD_TYPE (type, fieldno); | |
2708 | ||
5467c6c8 PA |
2709 | return unpack_value_bits_as_long_1 (field_type, valaddr, embedded_offset, |
2710 | bitpos, bitsize, val, | |
2711 | result); | |
2712 | } | |
2713 | ||
2714 | /* Unpack a field FIELDNO of the specified TYPE, from the object at | |
2715 | VALADDR + EMBEDDED_OFFSET. VALADDR points to the contents of | |
2716 | ORIGINAL_VALUE, which must not be NULL. See | |
2717 | unpack_value_bits_as_long for more details. */ | |
2718 | ||
2719 | int | |
2720 | unpack_value_field_as_long (struct type *type, const gdb_byte *valaddr, | |
2721 | int embedded_offset, int fieldno, | |
2722 | const struct value *val, LONGEST *result) | |
2723 | { | |
2724 | gdb_assert (val != NULL); | |
2725 | ||
2726 | return unpack_value_field_as_long_1 (type, valaddr, embedded_offset, | |
2727 | fieldno, val, result); | |
2728 | } | |
2729 | ||
2730 | /* Unpack a field FIELDNO of the specified TYPE, from the anonymous | |
2731 | object at VALADDR. See unpack_value_bits_as_long for more details. | |
2732 | This function differs from unpack_value_field_as_long in that it | |
2733 | operates without a struct value object. */ | |
2734 | ||
2735 | LONGEST | |
2736 | unpack_field_as_long (struct type *type, const gdb_byte *valaddr, int fieldno) | |
2737 | { | |
2738 | LONGEST result; | |
2739 | ||
2740 | unpack_value_field_as_long_1 (type, valaddr, 0, fieldno, NULL, &result); | |
2741 | return result; | |
2742 | } | |
2743 | ||
2744 | /* Return a new value with type TYPE, which is FIELDNO field of the | |
2745 | object at VALADDR + EMBEDDEDOFFSET. VALADDR points to the contents | |
2746 | of VAL. If the VAL's contents required to extract the bitfield | |
2747 | from are unavailable, the new value is correspondingly marked as | |
2748 | unavailable. */ | |
2749 | ||
2750 | struct value * | |
2751 | value_field_bitfield (struct type *type, int fieldno, | |
2752 | const gdb_byte *valaddr, | |
2753 | int embedded_offset, const struct value *val) | |
2754 | { | |
2755 | LONGEST l; | |
2756 | ||
2757 | if (!unpack_value_field_as_long (type, valaddr, embedded_offset, fieldno, | |
2758 | val, &l)) | |
2759 | { | |
2760 | struct type *field_type = TYPE_FIELD_TYPE (type, fieldno); | |
2761 | struct value *retval = allocate_value (field_type); | |
2762 | mark_value_bytes_unavailable (retval, 0, TYPE_LENGTH (field_type)); | |
2763 | return retval; | |
2764 | } | |
2765 | else | |
2766 | { | |
2767 | return value_from_longest (TYPE_FIELD_TYPE (type, fieldno), l); | |
2768 | } | |
4ea48cc1 DJ |
2769 | } |
2770 | ||
c906108c SS |
2771 | /* Modify the value of a bitfield. ADDR points to a block of memory in |
2772 | target byte order; the bitfield starts in the byte pointed to. FIELDVAL | |
2773 | is the desired value of the field, in host byte order. BITPOS and BITSIZE | |
581e13c1 | 2774 | indicate which bits (in target bit order) comprise the bitfield. |
19f220c3 | 2775 | Requires 0 < BITSIZE <= lbits, 0 <= BITPOS % 8 + BITSIZE <= lbits, and |
f4e88c8e | 2776 | 0 <= BITPOS, where lbits is the size of a LONGEST in bits. */ |
c906108c SS |
2777 | |
2778 | void | |
50810684 UW |
2779 | modify_field (struct type *type, gdb_byte *addr, |
2780 | LONGEST fieldval, int bitpos, int bitsize) | |
c906108c | 2781 | { |
e17a4113 | 2782 | enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type)); |
f4e88c8e PH |
2783 | ULONGEST oword; |
2784 | ULONGEST mask = (ULONGEST) -1 >> (8 * sizeof (ULONGEST) - bitsize); | |
19f220c3 JK |
2785 | int bytesize; |
2786 | ||
2787 | /* Normalize BITPOS. */ | |
2788 | addr += bitpos / 8; | |
2789 | bitpos %= 8; | |
c906108c SS |
2790 | |
2791 | /* If a negative fieldval fits in the field in question, chop | |
2792 | off the sign extension bits. */ | |
f4e88c8e PH |
2793 | if ((~fieldval & ~(mask >> 1)) == 0) |
2794 | fieldval &= mask; | |
c906108c SS |
2795 | |
2796 | /* Warn if value is too big to fit in the field in question. */ | |
f4e88c8e | 2797 | if (0 != (fieldval & ~mask)) |
c906108c SS |
2798 | { |
2799 | /* FIXME: would like to include fieldval in the message, but | |
c5aa993b | 2800 | we don't have a sprintf_longest. */ |
8a3fe4f8 | 2801 | warning (_("Value does not fit in %d bits."), bitsize); |
c906108c SS |
2802 | |
2803 | /* Truncate it, otherwise adjoining fields may be corrupted. */ | |
f4e88c8e | 2804 | fieldval &= mask; |
c906108c SS |
2805 | } |
2806 | ||
19f220c3 JK |
2807 | /* Ensure no bytes outside of the modified ones get accessed as it may cause |
2808 | false valgrind reports. */ | |
2809 | ||
2810 | bytesize = (bitpos + bitsize + 7) / 8; | |
2811 | oword = extract_unsigned_integer (addr, bytesize, byte_order); | |
c906108c SS |
2812 | |
2813 | /* Shifting for bit field depends on endianness of the target machine. */ | |
50810684 | 2814 | if (gdbarch_bits_big_endian (get_type_arch (type))) |
19f220c3 | 2815 | bitpos = bytesize * 8 - bitpos - bitsize; |
c906108c | 2816 | |
f4e88c8e | 2817 | oword &= ~(mask << bitpos); |
c906108c SS |
2818 | oword |= fieldval << bitpos; |
2819 | ||
19f220c3 | 2820 | store_unsigned_integer (addr, bytesize, byte_order, oword); |
c906108c SS |
2821 | } |
2822 | \f | |
14d06750 | 2823 | /* Pack NUM into BUF using a target format of TYPE. */ |
c906108c | 2824 | |
14d06750 DJ |
2825 | void |
2826 | pack_long (gdb_byte *buf, struct type *type, LONGEST num) | |
c906108c | 2827 | { |
e17a4113 | 2828 | enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type)); |
52f0bd74 | 2829 | int len; |
14d06750 DJ |
2830 | |
2831 | type = check_typedef (type); | |
c906108c SS |
2832 | len = TYPE_LENGTH (type); |
2833 | ||
14d06750 | 2834 | switch (TYPE_CODE (type)) |
c906108c | 2835 | { |
c906108c SS |
2836 | case TYPE_CODE_INT: |
2837 | case TYPE_CODE_CHAR: | |
2838 | case TYPE_CODE_ENUM: | |
4f2aea11 | 2839 | case TYPE_CODE_FLAGS: |
c906108c SS |
2840 | case TYPE_CODE_BOOL: |
2841 | case TYPE_CODE_RANGE: | |
0d5de010 | 2842 | case TYPE_CODE_MEMBERPTR: |
e17a4113 | 2843 | store_signed_integer (buf, len, byte_order, num); |
c906108c | 2844 | break; |
c5aa993b | 2845 | |
c906108c SS |
2846 | case TYPE_CODE_REF: |
2847 | case TYPE_CODE_PTR: | |
14d06750 | 2848 | store_typed_address (buf, type, (CORE_ADDR) num); |
c906108c | 2849 | break; |
c5aa993b | 2850 | |
c906108c | 2851 | default: |
14d06750 DJ |
2852 | error (_("Unexpected type (%d) encountered for integer constant."), |
2853 | TYPE_CODE (type)); | |
c906108c | 2854 | } |
14d06750 DJ |
2855 | } |
2856 | ||
2857 | ||
595939de PM |
2858 | /* Pack NUM into BUF using a target format of TYPE. */ |
2859 | ||
2860 | void | |
2861 | pack_unsigned_long (gdb_byte *buf, struct type *type, ULONGEST num) | |
2862 | { | |
2863 | int len; | |
2864 | enum bfd_endian byte_order; | |
2865 | ||
2866 | type = check_typedef (type); | |
2867 | len = TYPE_LENGTH (type); | |
2868 | byte_order = gdbarch_byte_order (get_type_arch (type)); | |
2869 | ||
2870 | switch (TYPE_CODE (type)) | |
2871 | { | |
2872 | case TYPE_CODE_INT: | |
2873 | case TYPE_CODE_CHAR: | |
2874 | case TYPE_CODE_ENUM: | |
2875 | case TYPE_CODE_FLAGS: | |
2876 | case TYPE_CODE_BOOL: | |
2877 | case TYPE_CODE_RANGE: | |
2878 | case TYPE_CODE_MEMBERPTR: | |
2879 | store_unsigned_integer (buf, len, byte_order, num); | |
2880 | break; | |
2881 | ||
2882 | case TYPE_CODE_REF: | |
2883 | case TYPE_CODE_PTR: | |
2884 | store_typed_address (buf, type, (CORE_ADDR) num); | |
2885 | break; | |
2886 | ||
2887 | default: | |
3e43a32a MS |
2888 | error (_("Unexpected type (%d) encountered " |
2889 | "for unsigned integer constant."), | |
595939de PM |
2890 | TYPE_CODE (type)); |
2891 | } | |
2892 | } | |
2893 | ||
2894 | ||
14d06750 DJ |
2895 | /* Convert C numbers into newly allocated values. */ |
2896 | ||
2897 | struct value * | |
2898 | value_from_longest (struct type *type, LONGEST num) | |
2899 | { | |
2900 | struct value *val = allocate_value (type); | |
2901 | ||
2902 | pack_long (value_contents_raw (val), type, num); | |
c906108c SS |
2903 | return val; |
2904 | } | |
2905 | ||
4478b372 | 2906 | |
595939de PM |
2907 | /* Convert C unsigned numbers into newly allocated values. */ |
2908 | ||
2909 | struct value * | |
2910 | value_from_ulongest (struct type *type, ULONGEST num) | |
2911 | { | |
2912 | struct value *val = allocate_value (type); | |
2913 | ||
2914 | pack_unsigned_long (value_contents_raw (val), type, num); | |
2915 | ||
2916 | return val; | |
2917 | } | |
2918 | ||
2919 | ||
4478b372 JB |
2920 | /* Create a value representing a pointer of type TYPE to the address |
2921 | ADDR. */ | |
f23631e4 | 2922 | struct value * |
4478b372 JB |
2923 | value_from_pointer (struct type *type, CORE_ADDR addr) |
2924 | { | |
f23631e4 | 2925 | struct value *val = allocate_value (type); |
a109c7c1 | 2926 | |
cab0c772 | 2927 | store_typed_address (value_contents_raw (val), check_typedef (type), addr); |
4478b372 JB |
2928 | return val; |
2929 | } | |
2930 | ||
2931 | ||
8acb6b92 TT |
2932 | /* Create a value of type TYPE whose contents come from VALADDR, if it |
2933 | is non-null, and whose memory address (in the inferior) is | |
2934 | ADDRESS. */ | |
2935 | ||
2936 | struct value * | |
2937 | value_from_contents_and_address (struct type *type, | |
2938 | const gdb_byte *valaddr, | |
2939 | CORE_ADDR address) | |
2940 | { | |
41e8491f | 2941 | struct value *v; |
a109c7c1 | 2942 | |
8acb6b92 | 2943 | if (valaddr == NULL) |
41e8491f | 2944 | v = allocate_value_lazy (type); |
8acb6b92 | 2945 | else |
41e8491f JK |
2946 | { |
2947 | v = allocate_value (type); | |
2948 | memcpy (value_contents_raw (v), valaddr, TYPE_LENGTH (type)); | |
2949 | } | |
42ae5230 | 2950 | set_value_address (v, address); |
33d502b4 | 2951 | VALUE_LVAL (v) = lval_memory; |
8acb6b92 TT |
2952 | return v; |
2953 | } | |
2954 | ||
f23631e4 | 2955 | struct value * |
fba45db2 | 2956 | value_from_double (struct type *type, DOUBLEST num) |
c906108c | 2957 | { |
f23631e4 | 2958 | struct value *val = allocate_value (type); |
c906108c | 2959 | struct type *base_type = check_typedef (type); |
52f0bd74 | 2960 | enum type_code code = TYPE_CODE (base_type); |
c906108c SS |
2961 | |
2962 | if (code == TYPE_CODE_FLT) | |
2963 | { | |
990a07ab | 2964 | store_typed_floating (value_contents_raw (val), base_type, num); |
c906108c SS |
2965 | } |
2966 | else | |
8a3fe4f8 | 2967 | error (_("Unexpected type encountered for floating constant.")); |
c906108c SS |
2968 | |
2969 | return val; | |
2970 | } | |
994b9211 | 2971 | |
27bc4d80 | 2972 | struct value * |
4ef30785 | 2973 | value_from_decfloat (struct type *type, const gdb_byte *dec) |
27bc4d80 TJB |
2974 | { |
2975 | struct value *val = allocate_value (type); | |
27bc4d80 | 2976 | |
4ef30785 | 2977 | memcpy (value_contents_raw (val), dec, TYPE_LENGTH (type)); |
27bc4d80 TJB |
2978 | return val; |
2979 | } | |
2980 | ||
994b9211 AC |
2981 | struct value * |
2982 | coerce_ref (struct value *arg) | |
2983 | { | |
df407dfe | 2984 | struct type *value_type_arg_tmp = check_typedef (value_type (arg)); |
a109c7c1 | 2985 | |
994b9211 AC |
2986 | if (TYPE_CODE (value_type_arg_tmp) == TYPE_CODE_REF) |
2987 | arg = value_at_lazy (TYPE_TARGET_TYPE (value_type_arg_tmp), | |
df407dfe | 2988 | unpack_pointer (value_type (arg), |
0fd88904 | 2989 | value_contents (arg))); |
994b9211 AC |
2990 | return arg; |
2991 | } | |
2992 | ||
2993 | struct value * | |
2994 | coerce_array (struct value *arg) | |
2995 | { | |
f3134b88 TT |
2996 | struct type *type; |
2997 | ||
994b9211 | 2998 | arg = coerce_ref (arg); |
f3134b88 TT |
2999 | type = check_typedef (value_type (arg)); |
3000 | ||
3001 | switch (TYPE_CODE (type)) | |
3002 | { | |
3003 | case TYPE_CODE_ARRAY: | |
7346b668 | 3004 | if (!TYPE_VECTOR (type) && current_language->c_style_arrays) |
f3134b88 TT |
3005 | arg = value_coerce_array (arg); |
3006 | break; | |
3007 | case TYPE_CODE_FUNC: | |
3008 | arg = value_coerce_function (arg); | |
3009 | break; | |
3010 | } | |
994b9211 AC |
3011 | return arg; |
3012 | } | |
c906108c | 3013 | \f |
c906108c | 3014 | |
48436ce6 AC |
3015 | /* Return true if the function returning the specified type is using |
3016 | the convention of returning structures in memory (passing in the | |
82585c72 | 3017 | address as a hidden first parameter). */ |
c906108c SS |
3018 | |
3019 | int | |
d80b854b UW |
3020 | using_struct_return (struct gdbarch *gdbarch, |
3021 | struct type *func_type, struct type *value_type) | |
c906108c | 3022 | { |
52f0bd74 | 3023 | enum type_code code = TYPE_CODE (value_type); |
c906108c SS |
3024 | |
3025 | if (code == TYPE_CODE_ERROR) | |
8a3fe4f8 | 3026 | error (_("Function return type unknown.")); |
c906108c | 3027 | |
667e784f AC |
3028 | if (code == TYPE_CODE_VOID) |
3029 | /* A void return value is never in memory. See also corresponding | |
44e5158b | 3030 | code in "print_return_value". */ |
667e784f AC |
3031 | return 0; |
3032 | ||
92ad9cd9 | 3033 | /* Probe the architecture for the return-value convention. */ |
d80b854b | 3034 | return (gdbarch_return_value (gdbarch, func_type, value_type, |
92ad9cd9 | 3035 | NULL, NULL, NULL) |
31db7b6c | 3036 | != RETURN_VALUE_REGISTER_CONVENTION); |
c906108c SS |
3037 | } |
3038 | ||
42be36b3 CT |
3039 | /* Set the initialized field in a value struct. */ |
3040 | ||
3041 | void | |
3042 | set_value_initialized (struct value *val, int status) | |
3043 | { | |
3044 | val->initialized = status; | |
3045 | } | |
3046 | ||
3047 | /* Return the initialized field in a value struct. */ | |
3048 | ||
3049 | int | |
3050 | value_initialized (struct value *val) | |
3051 | { | |
3052 | return val->initialized; | |
3053 | } | |
3054 | ||
c906108c | 3055 | void |
fba45db2 | 3056 | _initialize_values (void) |
c906108c | 3057 | { |
1a966eab AC |
3058 | add_cmd ("convenience", no_class, show_convenience, _("\ |
3059 | Debugger convenience (\"$foo\") variables.\n\ | |
c906108c | 3060 | These variables are created when you assign them values;\n\ |
1a966eab AC |
3061 | thus, \"print $foo=1\" gives \"$foo\" the value 1. Values may be any type.\n\ |
3062 | \n\ | |
c906108c SS |
3063 | A few convenience variables are given values automatically:\n\ |
3064 | \"$_\"holds the last address examined with \"x\" or \"info lines\",\n\ | |
1a966eab | 3065 | \"$__\" holds the contents of the last address examined with \"x\"."), |
c906108c SS |
3066 | &showlist); |
3067 | ||
db5f229b | 3068 | add_cmd ("values", no_set_class, show_values, _("\ |
3e43a32a | 3069 | Elements of value history around item number IDX (or last ten)."), |
c906108c | 3070 | &showlist); |
53e5f3cf AS |
3071 | |
3072 | add_com ("init-if-undefined", class_vars, init_if_undefined_command, _("\ | |
3073 | Initialize a convenience variable if necessary.\n\ | |
3074 | init-if-undefined VARIABLE = EXPRESSION\n\ | |
3075 | Set an internal VARIABLE to the result of the EXPRESSION if it does not\n\ | |
3076 | exist or does not contain a value. The EXPRESSION is not evaluated if the\n\ | |
3077 | VARIABLE is already initialized.")); | |
bc3b79fd TJB |
3078 | |
3079 | add_prefix_cmd ("function", no_class, function_command, _("\ | |
3080 | Placeholder command for showing help on convenience functions."), | |
3081 | &functionlist, "function ", 0, &cmdlist); | |
c906108c | 3082 | } |