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