Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Low level packing and unpacking of values for GDB, the GNU Debugger. |
1bac305b | 2 | |
f23631e4 | 3 | Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, |
990a07ab AC |
4 | 1995, 1996, 1997, 1998, 1999, 2000, 2002, 2003, 2004, 2005 Free |
5 | 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 | |
11 | the Free Software Foundation; either version 2 of the License, or | |
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 JM |
19 | You should have received a copy of the GNU General Public License |
20 | along with this program; if not, write to the Free Software | |
21 | Foundation, Inc., 59 Temple Place - Suite 330, | |
22 | Boston, MA 02111-1307, USA. */ | |
c906108c SS |
23 | |
24 | #include "defs.h" | |
25 | #include "gdb_string.h" | |
26 | #include "symtab.h" | |
27 | #include "gdbtypes.h" | |
28 | #include "value.h" | |
29 | #include "gdbcore.h" | |
c906108c SS |
30 | #include "command.h" |
31 | #include "gdbcmd.h" | |
32 | #include "target.h" | |
33 | #include "language.h" | |
34 | #include "scm-lang.h" | |
35 | #include "demangle.h" | |
d16aafd8 | 36 | #include "doublest.h" |
5ae326fa | 37 | #include "gdb_assert.h" |
36160dc4 | 38 | #include "regcache.h" |
fe898f56 | 39 | #include "block.h" |
c906108c SS |
40 | |
41 | /* Prototypes for exported functions. */ | |
42 | ||
a14ed312 | 43 | void _initialize_values (void); |
c906108c SS |
44 | |
45 | /* Prototypes for local functions. */ | |
46 | ||
a14ed312 | 47 | static void show_values (char *, int); |
c906108c | 48 | |
a14ed312 | 49 | static void show_convenience (char *, int); |
c906108c | 50 | |
c906108c SS |
51 | |
52 | /* The value-history records all the values printed | |
53 | by print commands during this session. Each chunk | |
54 | records 60 consecutive values. The first chunk on | |
55 | the chain records the most recent values. | |
56 | The total number of values is in value_history_count. */ | |
57 | ||
58 | #define VALUE_HISTORY_CHUNK 60 | |
59 | ||
60 | struct value_history_chunk | |
c5aa993b JM |
61 | { |
62 | struct value_history_chunk *next; | |
f23631e4 | 63 | struct value *values[VALUE_HISTORY_CHUNK]; |
c5aa993b | 64 | }; |
c906108c SS |
65 | |
66 | /* Chain of chunks now in use. */ | |
67 | ||
68 | static struct value_history_chunk *value_history_chain; | |
69 | ||
70 | static int value_history_count; /* Abs number of last entry stored */ | |
71 | \f | |
72 | /* List of all value objects currently allocated | |
73 | (except for those released by calls to release_value) | |
74 | This is so they can be freed after each command. */ | |
75 | ||
f23631e4 | 76 | static struct value *all_values; |
c906108c SS |
77 | |
78 | /* Allocate a value that has the correct length for type TYPE. */ | |
79 | ||
f23631e4 | 80 | struct value * |
fba45db2 | 81 | allocate_value (struct type *type) |
c906108c | 82 | { |
f23631e4 | 83 | struct value *val; |
c906108c SS |
84 | struct type *atype = check_typedef (type); |
85 | ||
86 | val = (struct value *) xmalloc (sizeof (struct value) + TYPE_LENGTH (atype)); | |
df407dfe | 87 | val->next = all_values; |
c906108c | 88 | all_values = val; |
df407dfe | 89 | val->type = type; |
4754a64e | 90 | val->enclosing_type = type; |
c906108c SS |
91 | VALUE_LVAL (val) = not_lval; |
92 | VALUE_ADDRESS (val) = 0; | |
1df6926e | 93 | VALUE_FRAME_ID (val) = null_frame_id; |
df407dfe AC |
94 | val->offset = 0; |
95 | val->bitpos = 0; | |
96 | val->bitsize = 0; | |
9ee8fc9d | 97 | VALUE_REGNUM (val) = -1; |
c906108c SS |
98 | VALUE_LAZY (val) = 0; |
99 | VALUE_OPTIMIZED_OUT (val) = 0; | |
c906108c SS |
100 | VALUE_EMBEDDED_OFFSET (val) = 0; |
101 | VALUE_POINTED_TO_OFFSET (val) = 0; | |
102 | val->modifiable = 1; | |
103 | return val; | |
104 | } | |
105 | ||
106 | /* Allocate a value that has the correct length | |
107 | for COUNT repetitions type TYPE. */ | |
108 | ||
f23631e4 | 109 | struct value * |
fba45db2 | 110 | allocate_repeat_value (struct type *type, int count) |
c906108c | 111 | { |
c5aa993b | 112 | int low_bound = current_language->string_lower_bound; /* ??? */ |
c906108c SS |
113 | /* FIXME-type-allocation: need a way to free this type when we are |
114 | done with it. */ | |
115 | struct type *range_type | |
c5aa993b JM |
116 | = create_range_type ((struct type *) NULL, builtin_type_int, |
117 | low_bound, count + low_bound - 1); | |
c906108c SS |
118 | /* FIXME-type-allocation: need a way to free this type when we are |
119 | done with it. */ | |
120 | return allocate_value (create_array_type ((struct type *) NULL, | |
121 | type, range_type)); | |
122 | } | |
123 | ||
df407dfe AC |
124 | /* Accessor methods. */ |
125 | ||
126 | struct type * | |
127 | value_type (struct value *value) | |
128 | { | |
129 | return value->type; | |
130 | } | |
131 | ||
132 | int | |
133 | value_offset (struct value *value) | |
134 | { | |
135 | return value->offset; | |
136 | } | |
137 | ||
138 | int | |
139 | value_bitpos (struct value *value) | |
140 | { | |
141 | return value->bitpos; | |
142 | } | |
143 | ||
144 | int | |
145 | value_bitsize (struct value *value) | |
146 | { | |
147 | return value->bitsize; | |
148 | } | |
149 | ||
990a07ab AC |
150 | bfd_byte * |
151 | value_contents_raw (struct value *value) | |
152 | { | |
153 | return value->aligner.contents + value->embedded_offset; | |
154 | } | |
155 | ||
156 | bfd_byte * | |
157 | value_contents_all_raw (struct value *value) | |
158 | { | |
159 | return value->aligner.contents; | |
160 | } | |
161 | ||
4754a64e AC |
162 | struct type * |
163 | value_enclosing_type (struct value *value) | |
164 | { | |
165 | return value->enclosing_type; | |
166 | } | |
167 | ||
990a07ab | 168 | \f |
c906108c SS |
169 | /* Return a mark in the value chain. All values allocated after the |
170 | mark is obtained (except for those released) are subject to being freed | |
171 | if a subsequent value_free_to_mark is passed the mark. */ | |
f23631e4 | 172 | struct value * |
fba45db2 | 173 | value_mark (void) |
c906108c SS |
174 | { |
175 | return all_values; | |
176 | } | |
177 | ||
178 | /* Free all values allocated since MARK was obtained by value_mark | |
179 | (except for those released). */ | |
180 | void | |
f23631e4 | 181 | value_free_to_mark (struct value *mark) |
c906108c | 182 | { |
f23631e4 AC |
183 | struct value *val; |
184 | struct value *next; | |
c906108c SS |
185 | |
186 | for (val = all_values; val && val != mark; val = next) | |
187 | { | |
df407dfe | 188 | next = val->next; |
c906108c SS |
189 | value_free (val); |
190 | } | |
191 | all_values = val; | |
192 | } | |
193 | ||
194 | /* Free all the values that have been allocated (except for those released). | |
195 | Called after each command, successful or not. */ | |
196 | ||
197 | void | |
fba45db2 | 198 | free_all_values (void) |
c906108c | 199 | { |
f23631e4 AC |
200 | struct value *val; |
201 | struct value *next; | |
c906108c SS |
202 | |
203 | for (val = all_values; val; val = next) | |
204 | { | |
df407dfe | 205 | next = val->next; |
c906108c SS |
206 | value_free (val); |
207 | } | |
208 | ||
209 | all_values = 0; | |
210 | } | |
211 | ||
212 | /* Remove VAL from the chain all_values | |
213 | so it will not be freed automatically. */ | |
214 | ||
215 | void | |
f23631e4 | 216 | release_value (struct value *val) |
c906108c | 217 | { |
f23631e4 | 218 | struct value *v; |
c906108c SS |
219 | |
220 | if (all_values == val) | |
221 | { | |
222 | all_values = val->next; | |
223 | return; | |
224 | } | |
225 | ||
226 | for (v = all_values; v; v = v->next) | |
227 | { | |
228 | if (v->next == val) | |
229 | { | |
230 | v->next = val->next; | |
231 | break; | |
232 | } | |
233 | } | |
234 | } | |
235 | ||
236 | /* Release all values up to mark */ | |
f23631e4 AC |
237 | struct value * |
238 | value_release_to_mark (struct value *mark) | |
c906108c | 239 | { |
f23631e4 AC |
240 | struct value *val; |
241 | struct value *next; | |
c906108c | 242 | |
df407dfe AC |
243 | for (val = next = all_values; next; next = next->next) |
244 | if (next->next == mark) | |
c906108c | 245 | { |
df407dfe AC |
246 | all_values = next->next; |
247 | next->next = NULL; | |
c906108c SS |
248 | return val; |
249 | } | |
250 | all_values = 0; | |
251 | return val; | |
252 | } | |
253 | ||
254 | /* Return a copy of the value ARG. | |
255 | It contains the same contents, for same memory address, | |
256 | but it's a different block of storage. */ | |
257 | ||
f23631e4 AC |
258 | struct value * |
259 | value_copy (struct value *arg) | |
c906108c | 260 | { |
4754a64e | 261 | struct type *encl_type = value_enclosing_type (arg); |
f23631e4 | 262 | struct value *val = allocate_value (encl_type); |
df407dfe | 263 | val->type = arg->type; |
c906108c SS |
264 | VALUE_LVAL (val) = VALUE_LVAL (arg); |
265 | VALUE_ADDRESS (val) = VALUE_ADDRESS (arg); | |
df407dfe AC |
266 | val->offset = arg->offset; |
267 | val->bitpos = arg->bitpos; | |
268 | val->bitsize = arg->bitsize; | |
1df6926e | 269 | VALUE_FRAME_ID (val) = VALUE_FRAME_ID (arg); |
9ee8fc9d | 270 | VALUE_REGNUM (val) = VALUE_REGNUM (arg); |
c906108c SS |
271 | VALUE_LAZY (val) = VALUE_LAZY (arg); |
272 | VALUE_OPTIMIZED_OUT (val) = VALUE_OPTIMIZED_OUT (arg); | |
273 | VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (arg); | |
274 | VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (arg); | |
c906108c SS |
275 | val->modifiable = arg->modifiable; |
276 | if (!VALUE_LAZY (val)) | |
277 | { | |
990a07ab | 278 | memcpy (value_contents_all_raw (val), value_contents_all_raw (arg), |
4754a64e | 279 | TYPE_LENGTH (value_enclosing_type (arg))); |
c906108c SS |
280 | |
281 | } | |
282 | return val; | |
283 | } | |
284 | \f | |
285 | /* Access to the value history. */ | |
286 | ||
287 | /* Record a new value in the value history. | |
288 | Returns the absolute history index of the entry. | |
289 | Result of -1 indicates the value was not saved; otherwise it is the | |
290 | value history index of this new item. */ | |
291 | ||
292 | int | |
f23631e4 | 293 | record_latest_value (struct value *val) |
c906108c SS |
294 | { |
295 | int i; | |
296 | ||
297 | /* We don't want this value to have anything to do with the inferior anymore. | |
298 | In particular, "set $1 = 50" should not affect the variable from which | |
299 | the value was taken, and fast watchpoints should be able to assume that | |
300 | a value on the value history never changes. */ | |
301 | if (VALUE_LAZY (val)) | |
302 | value_fetch_lazy (val); | |
303 | /* We preserve VALUE_LVAL so that the user can find out where it was fetched | |
304 | from. This is a bit dubious, because then *&$1 does not just return $1 | |
305 | but the current contents of that location. c'est la vie... */ | |
306 | val->modifiable = 0; | |
307 | release_value (val); | |
308 | ||
309 | /* Here we treat value_history_count as origin-zero | |
310 | and applying to the value being stored now. */ | |
311 | ||
312 | i = value_history_count % VALUE_HISTORY_CHUNK; | |
313 | if (i == 0) | |
314 | { | |
f23631e4 | 315 | struct value_history_chunk *new |
c5aa993b JM |
316 | = (struct value_history_chunk *) |
317 | xmalloc (sizeof (struct value_history_chunk)); | |
c906108c SS |
318 | memset (new->values, 0, sizeof new->values); |
319 | new->next = value_history_chain; | |
320 | value_history_chain = new; | |
321 | } | |
322 | ||
323 | value_history_chain->values[i] = val; | |
324 | ||
325 | /* Now we regard value_history_count as origin-one | |
326 | and applying to the value just stored. */ | |
327 | ||
328 | return ++value_history_count; | |
329 | } | |
330 | ||
331 | /* Return a copy of the value in the history with sequence number NUM. */ | |
332 | ||
f23631e4 | 333 | struct value * |
fba45db2 | 334 | access_value_history (int num) |
c906108c | 335 | { |
f23631e4 | 336 | struct value_history_chunk *chunk; |
52f0bd74 AC |
337 | int i; |
338 | int absnum = num; | |
c906108c SS |
339 | |
340 | if (absnum <= 0) | |
341 | absnum += value_history_count; | |
342 | ||
343 | if (absnum <= 0) | |
344 | { | |
345 | if (num == 0) | |
346 | error ("The history is empty."); | |
347 | else if (num == 1) | |
348 | error ("There is only one value in the history."); | |
349 | else | |
350 | error ("History does not go back to $$%d.", -num); | |
351 | } | |
352 | if (absnum > value_history_count) | |
353 | error ("History has not yet reached $%d.", absnum); | |
354 | ||
355 | absnum--; | |
356 | ||
357 | /* Now absnum is always absolute and origin zero. */ | |
358 | ||
359 | chunk = value_history_chain; | |
360 | for (i = (value_history_count - 1) / VALUE_HISTORY_CHUNK - absnum / VALUE_HISTORY_CHUNK; | |
361 | i > 0; i--) | |
362 | chunk = chunk->next; | |
363 | ||
364 | return value_copy (chunk->values[absnum % VALUE_HISTORY_CHUNK]); | |
365 | } | |
366 | ||
367 | /* Clear the value history entirely. | |
368 | Must be done when new symbol tables are loaded, | |
369 | because the type pointers become invalid. */ | |
370 | ||
371 | void | |
fba45db2 | 372 | clear_value_history (void) |
c906108c | 373 | { |
f23631e4 | 374 | struct value_history_chunk *next; |
52f0bd74 | 375 | int i; |
f23631e4 | 376 | struct value *val; |
c906108c SS |
377 | |
378 | while (value_history_chain) | |
379 | { | |
380 | for (i = 0; i < VALUE_HISTORY_CHUNK; i++) | |
381 | if ((val = value_history_chain->values[i]) != NULL) | |
b8c9b27d | 382 | xfree (val); |
c906108c | 383 | next = value_history_chain->next; |
b8c9b27d | 384 | xfree (value_history_chain); |
c906108c SS |
385 | value_history_chain = next; |
386 | } | |
387 | value_history_count = 0; | |
388 | } | |
389 | ||
390 | static void | |
fba45db2 | 391 | show_values (char *num_exp, int from_tty) |
c906108c | 392 | { |
52f0bd74 | 393 | int i; |
f23631e4 | 394 | struct value *val; |
c906108c SS |
395 | static int num = 1; |
396 | ||
397 | if (num_exp) | |
398 | { | |
c5aa993b JM |
399 | /* "info history +" should print from the stored position. |
400 | "info history <exp>" should print around value number <exp>. */ | |
c906108c | 401 | if (num_exp[0] != '+' || num_exp[1] != '\0') |
bb518678 | 402 | num = parse_and_eval_long (num_exp) - 5; |
c906108c SS |
403 | } |
404 | else | |
405 | { | |
406 | /* "info history" means print the last 10 values. */ | |
407 | num = value_history_count - 9; | |
408 | } | |
409 | ||
410 | if (num <= 0) | |
411 | num = 1; | |
412 | ||
413 | for (i = num; i < num + 10 && i <= value_history_count; i++) | |
414 | { | |
415 | val = access_value_history (i); | |
416 | printf_filtered ("$%d = ", i); | |
417 | value_print (val, gdb_stdout, 0, Val_pretty_default); | |
418 | printf_filtered ("\n"); | |
419 | } | |
420 | ||
421 | /* The next "info history +" should start after what we just printed. */ | |
422 | num += 10; | |
423 | ||
424 | /* Hitting just return after this command should do the same thing as | |
425 | "info history +". If num_exp is null, this is unnecessary, since | |
426 | "info history +" is not useful after "info history". */ | |
427 | if (from_tty && num_exp) | |
428 | { | |
429 | num_exp[0] = '+'; | |
430 | num_exp[1] = '\0'; | |
431 | } | |
432 | } | |
433 | \f | |
434 | /* Internal variables. These are variables within the debugger | |
435 | that hold values assigned by debugger commands. | |
436 | The user refers to them with a '$' prefix | |
437 | that does not appear in the variable names stored internally. */ | |
438 | ||
439 | static struct internalvar *internalvars; | |
440 | ||
441 | /* Look up an internal variable with name NAME. NAME should not | |
442 | normally include a dollar sign. | |
443 | ||
444 | If the specified internal variable does not exist, | |
445 | one is created, with a void value. */ | |
446 | ||
447 | struct internalvar * | |
fba45db2 | 448 | lookup_internalvar (char *name) |
c906108c | 449 | { |
52f0bd74 | 450 | struct internalvar *var; |
c906108c SS |
451 | |
452 | for (var = internalvars; var; var = var->next) | |
5cb316ef | 453 | if (strcmp (var->name, name) == 0) |
c906108c SS |
454 | return var; |
455 | ||
456 | var = (struct internalvar *) xmalloc (sizeof (struct internalvar)); | |
457 | var->name = concat (name, NULL); | |
458 | var->value = allocate_value (builtin_type_void); | |
459 | release_value (var->value); | |
460 | var->next = internalvars; | |
461 | internalvars = var; | |
462 | return var; | |
463 | } | |
464 | ||
f23631e4 | 465 | struct value * |
fba45db2 | 466 | value_of_internalvar (struct internalvar *var) |
c906108c | 467 | { |
f23631e4 | 468 | struct value *val; |
c906108c | 469 | |
c906108c SS |
470 | val = value_copy (var->value); |
471 | if (VALUE_LAZY (val)) | |
472 | value_fetch_lazy (val); | |
473 | VALUE_LVAL (val) = lval_internalvar; | |
474 | VALUE_INTERNALVAR (val) = var; | |
475 | return val; | |
476 | } | |
477 | ||
478 | void | |
fba45db2 | 479 | set_internalvar_component (struct internalvar *var, int offset, int bitpos, |
f23631e4 | 480 | int bitsize, struct value *newval) |
c906108c | 481 | { |
52f0bd74 | 482 | char *addr = VALUE_CONTENTS (var->value) + offset; |
c906108c | 483 | |
c906108c SS |
484 | if (bitsize) |
485 | modify_field (addr, value_as_long (newval), | |
486 | bitpos, bitsize); | |
487 | else | |
df407dfe | 488 | memcpy (addr, VALUE_CONTENTS (newval), TYPE_LENGTH (value_type (newval))); |
c906108c SS |
489 | } |
490 | ||
491 | void | |
f23631e4 | 492 | set_internalvar (struct internalvar *var, struct value *val) |
c906108c | 493 | { |
f23631e4 | 494 | struct value *newval; |
c906108c | 495 | |
c906108c SS |
496 | newval = value_copy (val); |
497 | newval->modifiable = 1; | |
498 | ||
499 | /* Force the value to be fetched from the target now, to avoid problems | |
500 | later when this internalvar is referenced and the target is gone or | |
501 | has changed. */ | |
502 | if (VALUE_LAZY (newval)) | |
503 | value_fetch_lazy (newval); | |
504 | ||
505 | /* Begin code which must not call error(). If var->value points to | |
506 | something free'd, an error() obviously leaves a dangling pointer. | |
507 | But we also get a danling pointer if var->value points to | |
508 | something in the value chain (i.e., before release_value is | |
509 | called), because after the error free_all_values will get called before | |
510 | long. */ | |
b8c9b27d | 511 | xfree (var->value); |
c906108c SS |
512 | var->value = newval; |
513 | release_value (newval); | |
514 | /* End code which must not call error(). */ | |
515 | } | |
516 | ||
517 | char * | |
fba45db2 | 518 | internalvar_name (struct internalvar *var) |
c906108c SS |
519 | { |
520 | return var->name; | |
521 | } | |
522 | ||
523 | /* Free all internalvars. Done when new symtabs are loaded, | |
524 | because that makes the values invalid. */ | |
525 | ||
526 | void | |
fba45db2 | 527 | clear_internalvars (void) |
c906108c | 528 | { |
52f0bd74 | 529 | struct internalvar *var; |
c906108c SS |
530 | |
531 | while (internalvars) | |
532 | { | |
533 | var = internalvars; | |
534 | internalvars = var->next; | |
b8c9b27d KB |
535 | xfree (var->name); |
536 | xfree (var->value); | |
537 | xfree (var); | |
c906108c SS |
538 | } |
539 | } | |
540 | ||
541 | static void | |
fba45db2 | 542 | show_convenience (char *ignore, int from_tty) |
c906108c | 543 | { |
52f0bd74 | 544 | struct internalvar *var; |
c906108c SS |
545 | int varseen = 0; |
546 | ||
547 | for (var = internalvars; var; var = var->next) | |
548 | { | |
c906108c SS |
549 | if (!varseen) |
550 | { | |
551 | varseen = 1; | |
552 | } | |
553 | printf_filtered ("$%s = ", var->name); | |
554 | value_print (var->value, gdb_stdout, 0, Val_pretty_default); | |
555 | printf_filtered ("\n"); | |
556 | } | |
557 | if (!varseen) | |
558 | printf_unfiltered ("No debugger convenience variables now defined.\n\ | |
559 | Convenience variables have names starting with \"$\";\n\ | |
560 | use \"set\" as in \"set $foo = 5\" to define them.\n"); | |
561 | } | |
562 | \f | |
563 | /* Extract a value as a C number (either long or double). | |
564 | Knows how to convert fixed values to double, or | |
565 | floating values to long. | |
566 | Does not deallocate the value. */ | |
567 | ||
568 | LONGEST | |
f23631e4 | 569 | value_as_long (struct value *val) |
c906108c SS |
570 | { |
571 | /* This coerces arrays and functions, which is necessary (e.g. | |
572 | in disassemble_command). It also dereferences references, which | |
573 | I suspect is the most logical thing to do. */ | |
994b9211 | 574 | val = coerce_array (val); |
df407dfe | 575 | return unpack_long (value_type (val), VALUE_CONTENTS (val)); |
c906108c SS |
576 | } |
577 | ||
578 | DOUBLEST | |
f23631e4 | 579 | value_as_double (struct value *val) |
c906108c SS |
580 | { |
581 | DOUBLEST foo; | |
582 | int inv; | |
c5aa993b | 583 | |
df407dfe | 584 | foo = unpack_double (value_type (val), VALUE_CONTENTS (val), &inv); |
c906108c SS |
585 | if (inv) |
586 | error ("Invalid floating value found in program."); | |
587 | return foo; | |
588 | } | |
4478b372 JB |
589 | /* Extract a value as a C pointer. Does not deallocate the value. |
590 | Note that val's type may not actually be a pointer; value_as_long | |
591 | handles all the cases. */ | |
c906108c | 592 | CORE_ADDR |
f23631e4 | 593 | value_as_address (struct value *val) |
c906108c SS |
594 | { |
595 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure | |
596 | whether we want this to be true eventually. */ | |
597 | #if 0 | |
598 | /* ADDR_BITS_REMOVE is wrong if we are being called for a | |
599 | non-address (e.g. argument to "signal", "info break", etc.), or | |
600 | for pointers to char, in which the low bits *are* significant. */ | |
c5aa993b | 601 | return ADDR_BITS_REMOVE (value_as_long (val)); |
c906108c | 602 | #else |
f312f057 JB |
603 | |
604 | /* There are several targets (IA-64, PowerPC, and others) which | |
605 | don't represent pointers to functions as simply the address of | |
606 | the function's entry point. For example, on the IA-64, a | |
607 | function pointer points to a two-word descriptor, generated by | |
608 | the linker, which contains the function's entry point, and the | |
609 | value the IA-64 "global pointer" register should have --- to | |
610 | support position-independent code. The linker generates | |
611 | descriptors only for those functions whose addresses are taken. | |
612 | ||
613 | On such targets, it's difficult for GDB to convert an arbitrary | |
614 | function address into a function pointer; it has to either find | |
615 | an existing descriptor for that function, or call malloc and | |
616 | build its own. On some targets, it is impossible for GDB to | |
617 | build a descriptor at all: the descriptor must contain a jump | |
618 | instruction; data memory cannot be executed; and code memory | |
619 | cannot be modified. | |
620 | ||
621 | Upon entry to this function, if VAL is a value of type `function' | |
622 | (that is, TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FUNC), then | |
623 | VALUE_ADDRESS (val) is the address of the function. This is what | |
624 | you'll get if you evaluate an expression like `main'. The call | |
625 | to COERCE_ARRAY below actually does all the usual unary | |
626 | conversions, which includes converting values of type `function' | |
627 | to `pointer to function'. This is the challenging conversion | |
628 | discussed above. Then, `unpack_long' will convert that pointer | |
629 | back into an address. | |
630 | ||
631 | So, suppose the user types `disassemble foo' on an architecture | |
632 | with a strange function pointer representation, on which GDB | |
633 | cannot build its own descriptors, and suppose further that `foo' | |
634 | has no linker-built descriptor. The address->pointer conversion | |
635 | will signal an error and prevent the command from running, even | |
636 | though the next step would have been to convert the pointer | |
637 | directly back into the same address. | |
638 | ||
639 | The following shortcut avoids this whole mess. If VAL is a | |
640 | function, just return its address directly. */ | |
df407dfe AC |
641 | if (TYPE_CODE (value_type (val)) == TYPE_CODE_FUNC |
642 | || TYPE_CODE (value_type (val)) == TYPE_CODE_METHOD) | |
f312f057 JB |
643 | return VALUE_ADDRESS (val); |
644 | ||
994b9211 | 645 | val = coerce_array (val); |
fc0c74b1 AC |
646 | |
647 | /* Some architectures (e.g. Harvard), map instruction and data | |
648 | addresses onto a single large unified address space. For | |
649 | instance: An architecture may consider a large integer in the | |
650 | range 0x10000000 .. 0x1000ffff to already represent a data | |
651 | addresses (hence not need a pointer to address conversion) while | |
652 | a small integer would still need to be converted integer to | |
653 | pointer to address. Just assume such architectures handle all | |
654 | integer conversions in a single function. */ | |
655 | ||
656 | /* JimB writes: | |
657 | ||
658 | I think INTEGER_TO_ADDRESS is a good idea as proposed --- but we | |
659 | must admonish GDB hackers to make sure its behavior matches the | |
660 | compiler's, whenever possible. | |
661 | ||
662 | In general, I think GDB should evaluate expressions the same way | |
663 | the compiler does. When the user copies an expression out of | |
664 | their source code and hands it to a `print' command, they should | |
665 | get the same value the compiler would have computed. Any | |
666 | deviation from this rule can cause major confusion and annoyance, | |
667 | and needs to be justified carefully. In other words, GDB doesn't | |
668 | really have the freedom to do these conversions in clever and | |
669 | useful ways. | |
670 | ||
671 | AndrewC pointed out that users aren't complaining about how GDB | |
672 | casts integers to pointers; they are complaining that they can't | |
673 | take an address from a disassembly listing and give it to `x/i'. | |
674 | This is certainly important. | |
675 | ||
79dd2d24 | 676 | Adding an architecture method like integer_to_address() certainly |
fc0c74b1 AC |
677 | makes it possible for GDB to "get it right" in all circumstances |
678 | --- the target has complete control over how things get done, so | |
679 | people can Do The Right Thing for their target without breaking | |
680 | anyone else. The standard doesn't specify how integers get | |
681 | converted to pointers; usually, the ABI doesn't either, but | |
682 | ABI-specific code is a more reasonable place to handle it. */ | |
683 | ||
df407dfe AC |
684 | if (TYPE_CODE (value_type (val)) != TYPE_CODE_PTR |
685 | && TYPE_CODE (value_type (val)) != TYPE_CODE_REF | |
79dd2d24 AC |
686 | && gdbarch_integer_to_address_p (current_gdbarch)) |
687 | return gdbarch_integer_to_address (current_gdbarch, value_type (val), | |
688 | VALUE_CONTENTS (val)); | |
fc0c74b1 | 689 | |
df407dfe | 690 | return unpack_long (value_type (val), VALUE_CONTENTS (val)); |
c906108c SS |
691 | #endif |
692 | } | |
693 | \f | |
694 | /* Unpack raw data (copied from debugee, target byte order) at VALADDR | |
695 | as a long, or as a double, assuming the raw data is described | |
696 | by type TYPE. Knows how to convert different sizes of values | |
697 | and can convert between fixed and floating point. We don't assume | |
698 | any alignment for the raw data. Return value is in host byte order. | |
699 | ||
700 | If you want functions and arrays to be coerced to pointers, and | |
701 | references to be dereferenced, call value_as_long() instead. | |
702 | ||
703 | C++: It is assumed that the front-end has taken care of | |
704 | all matters concerning pointers to members. A pointer | |
705 | to member which reaches here is considered to be equivalent | |
706 | to an INT (or some size). After all, it is only an offset. */ | |
707 | ||
708 | LONGEST | |
66140c26 | 709 | unpack_long (struct type *type, const char *valaddr) |
c906108c | 710 | { |
52f0bd74 AC |
711 | enum type_code code = TYPE_CODE (type); |
712 | int len = TYPE_LENGTH (type); | |
713 | int nosign = TYPE_UNSIGNED (type); | |
c906108c SS |
714 | |
715 | if (current_language->la_language == language_scm | |
716 | && is_scmvalue_type (type)) | |
717 | return scm_unpack (type, valaddr, TYPE_CODE_INT); | |
718 | ||
719 | switch (code) | |
720 | { | |
721 | case TYPE_CODE_TYPEDEF: | |
722 | return unpack_long (check_typedef (type), valaddr); | |
723 | case TYPE_CODE_ENUM: | |
724 | case TYPE_CODE_BOOL: | |
725 | case TYPE_CODE_INT: | |
726 | case TYPE_CODE_CHAR: | |
727 | case TYPE_CODE_RANGE: | |
728 | if (nosign) | |
729 | return extract_unsigned_integer (valaddr, len); | |
730 | else | |
731 | return extract_signed_integer (valaddr, len); | |
732 | ||
733 | case TYPE_CODE_FLT: | |
96d2f608 | 734 | return extract_typed_floating (valaddr, type); |
c906108c SS |
735 | |
736 | case TYPE_CODE_PTR: | |
737 | case TYPE_CODE_REF: | |
738 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure | |
c5aa993b | 739 | whether we want this to be true eventually. */ |
4478b372 | 740 | return extract_typed_address (valaddr, type); |
c906108c SS |
741 | |
742 | case TYPE_CODE_MEMBER: | |
743 | error ("not implemented: member types in unpack_long"); | |
744 | ||
745 | default: | |
746 | error ("Value can't be converted to integer."); | |
747 | } | |
c5aa993b | 748 | return 0; /* Placate lint. */ |
c906108c SS |
749 | } |
750 | ||
751 | /* Return a double value from the specified type and address. | |
752 | INVP points to an int which is set to 0 for valid value, | |
753 | 1 for invalid value (bad float format). In either case, | |
754 | the returned double is OK to use. Argument is in target | |
755 | format, result is in host format. */ | |
756 | ||
757 | DOUBLEST | |
66140c26 | 758 | unpack_double (struct type *type, const char *valaddr, int *invp) |
c906108c SS |
759 | { |
760 | enum type_code code; | |
761 | int len; | |
762 | int nosign; | |
763 | ||
764 | *invp = 0; /* Assume valid. */ | |
765 | CHECK_TYPEDEF (type); | |
766 | code = TYPE_CODE (type); | |
767 | len = TYPE_LENGTH (type); | |
768 | nosign = TYPE_UNSIGNED (type); | |
769 | if (code == TYPE_CODE_FLT) | |
770 | { | |
75bc7ddf AC |
771 | /* NOTE: cagney/2002-02-19: There was a test here to see if the |
772 | floating-point value was valid (using the macro | |
773 | INVALID_FLOAT). That test/macro have been removed. | |
774 | ||
775 | It turns out that only the VAX defined this macro and then | |
776 | only in a non-portable way. Fixing the portability problem | |
777 | wouldn't help since the VAX floating-point code is also badly | |
778 | bit-rotten. The target needs to add definitions for the | |
779 | methods TARGET_FLOAT_FORMAT and TARGET_DOUBLE_FORMAT - these | |
780 | exactly describe the target floating-point format. The | |
781 | problem here is that the corresponding floatformat_vax_f and | |
782 | floatformat_vax_d values these methods should be set to are | |
783 | also not defined either. Oops! | |
784 | ||
785 | Hopefully someone will add both the missing floatformat | |
ac79b88b DJ |
786 | definitions and the new cases for floatformat_is_valid (). */ |
787 | ||
788 | if (!floatformat_is_valid (floatformat_from_type (type), valaddr)) | |
789 | { | |
790 | *invp = 1; | |
791 | return 0.0; | |
792 | } | |
793 | ||
96d2f608 | 794 | return extract_typed_floating (valaddr, type); |
c906108c SS |
795 | } |
796 | else if (nosign) | |
797 | { | |
798 | /* Unsigned -- be sure we compensate for signed LONGEST. */ | |
c906108c | 799 | return (ULONGEST) unpack_long (type, valaddr); |
c906108c SS |
800 | } |
801 | else | |
802 | { | |
803 | /* Signed -- we are OK with unpack_long. */ | |
804 | return unpack_long (type, valaddr); | |
805 | } | |
806 | } | |
807 | ||
808 | /* Unpack raw data (copied from debugee, target byte order) at VALADDR | |
809 | as a CORE_ADDR, assuming the raw data is described by type TYPE. | |
810 | We don't assume any alignment for the raw data. Return value is in | |
811 | host byte order. | |
812 | ||
813 | If you want functions and arrays to be coerced to pointers, and | |
1aa20aa8 | 814 | references to be dereferenced, call value_as_address() instead. |
c906108c SS |
815 | |
816 | C++: It is assumed that the front-end has taken care of | |
817 | all matters concerning pointers to members. A pointer | |
818 | to member which reaches here is considered to be equivalent | |
819 | to an INT (or some size). After all, it is only an offset. */ | |
820 | ||
821 | CORE_ADDR | |
66140c26 | 822 | unpack_pointer (struct type *type, const char *valaddr) |
c906108c SS |
823 | { |
824 | /* Assume a CORE_ADDR can fit in a LONGEST (for now). Not sure | |
825 | whether we want this to be true eventually. */ | |
826 | return unpack_long (type, valaddr); | |
827 | } | |
4478b372 | 828 | |
c906108c | 829 | \f |
2c2738a0 DC |
830 | /* Get the value of the FIELDN'th field (which must be static) of |
831 | TYPE. Return NULL if the field doesn't exist or has been | |
832 | optimized out. */ | |
c906108c | 833 | |
f23631e4 | 834 | struct value * |
fba45db2 | 835 | value_static_field (struct type *type, int fieldno) |
c906108c | 836 | { |
948e66d9 DJ |
837 | struct value *retval; |
838 | ||
c906108c SS |
839 | if (TYPE_FIELD_STATIC_HAS_ADDR (type, fieldno)) |
840 | { | |
948e66d9 | 841 | retval = value_at (TYPE_FIELD_TYPE (type, fieldno), |
00a4c844 | 842 | TYPE_FIELD_STATIC_PHYSADDR (type, fieldno)); |
c906108c SS |
843 | } |
844 | else | |
845 | { | |
846 | char *phys_name = TYPE_FIELD_STATIC_PHYSNAME (type, fieldno); | |
176620f1 | 847 | struct symbol *sym = lookup_symbol (phys_name, 0, VAR_DOMAIN, 0, NULL); |
948e66d9 | 848 | if (sym == NULL) |
c906108c SS |
849 | { |
850 | /* With some compilers, e.g. HP aCC, static data members are reported | |
c5aa993b JM |
851 | as non-debuggable symbols */ |
852 | struct minimal_symbol *msym = lookup_minimal_symbol (phys_name, NULL, NULL); | |
c906108c SS |
853 | if (!msym) |
854 | return NULL; | |
855 | else | |
c5aa993b | 856 | { |
948e66d9 | 857 | retval = value_at (TYPE_FIELD_TYPE (type, fieldno), |
00a4c844 | 858 | SYMBOL_VALUE_ADDRESS (msym)); |
c906108c SS |
859 | } |
860 | } | |
861 | else | |
862 | { | |
948e66d9 DJ |
863 | /* SYM should never have a SYMBOL_CLASS which will require |
864 | read_var_value to use the FRAME parameter. */ | |
865 | if (symbol_read_needs_frame (sym)) | |
866 | warning ("static field's value depends on the current " | |
867 | "frame - bad debug info?"); | |
868 | retval = read_var_value (sym, NULL); | |
2b127877 | 869 | } |
948e66d9 DJ |
870 | if (retval && VALUE_LVAL (retval) == lval_memory) |
871 | SET_FIELD_PHYSADDR (TYPE_FIELD (type, fieldno), | |
872 | VALUE_ADDRESS (retval)); | |
c906108c | 873 | } |
948e66d9 | 874 | return retval; |
c906108c SS |
875 | } |
876 | ||
2b127877 DB |
877 | /* Change the enclosing type of a value object VAL to NEW_ENCL_TYPE. |
878 | You have to be careful here, since the size of the data area for the value | |
879 | is set by the length of the enclosing type. So if NEW_ENCL_TYPE is bigger | |
880 | than the old enclosing type, you have to allocate more space for the data. | |
881 | The return value is a pointer to the new version of this value structure. */ | |
882 | ||
f23631e4 AC |
883 | struct value * |
884 | value_change_enclosing_type (struct value *val, struct type *new_encl_type) | |
2b127877 | 885 | { |
4754a64e | 886 | if (TYPE_LENGTH (new_encl_type) <= TYPE_LENGTH (value_enclosing_type (val))) |
2b127877 | 887 | { |
4754a64e | 888 | val->enclosing_type = new_encl_type; |
2b127877 DB |
889 | return val; |
890 | } | |
891 | else | |
892 | { | |
f23631e4 AC |
893 | struct value *new_val; |
894 | struct value *prev; | |
2b127877 | 895 | |
f23631e4 | 896 | new_val = (struct value *) xrealloc (val, sizeof (struct value) + TYPE_LENGTH (new_encl_type)); |
cc303028 | 897 | |
4754a64e | 898 | new_val->enclosing_type = new_encl_type; |
cc303028 | 899 | |
2b127877 DB |
900 | /* We have to make sure this ends up in the same place in the value |
901 | chain as the original copy, so it's clean-up behavior is the same. | |
902 | If the value has been released, this is a waste of time, but there | |
903 | is no way to tell that in advance, so... */ | |
904 | ||
905 | if (val != all_values) | |
906 | { | |
907 | for (prev = all_values; prev != NULL; prev = prev->next) | |
908 | { | |
909 | if (prev->next == val) | |
910 | { | |
911 | prev->next = new_val; | |
912 | break; | |
913 | } | |
914 | } | |
915 | } | |
916 | ||
917 | return new_val; | |
918 | } | |
919 | } | |
920 | ||
c906108c SS |
921 | /* Given a value ARG1 (offset by OFFSET bytes) |
922 | of a struct or union type ARG_TYPE, | |
923 | extract and return the value of one of its (non-static) fields. | |
924 | FIELDNO says which field. */ | |
925 | ||
f23631e4 AC |
926 | struct value * |
927 | value_primitive_field (struct value *arg1, int offset, | |
aa1ee363 | 928 | int fieldno, struct type *arg_type) |
c906108c | 929 | { |
f23631e4 | 930 | struct value *v; |
52f0bd74 | 931 | struct type *type; |
c906108c SS |
932 | |
933 | CHECK_TYPEDEF (arg_type); | |
934 | type = TYPE_FIELD_TYPE (arg_type, fieldno); | |
935 | ||
936 | /* Handle packed fields */ | |
937 | ||
938 | if (TYPE_FIELD_BITSIZE (arg_type, fieldno)) | |
939 | { | |
940 | v = value_from_longest (type, | |
941 | unpack_field_as_long (arg_type, | |
942 | VALUE_CONTENTS (arg1) | |
c5aa993b | 943 | + offset, |
c906108c | 944 | fieldno)); |
df407dfe AC |
945 | v->bitpos = TYPE_FIELD_BITPOS (arg_type, fieldno) % 8; |
946 | v->bitsize = TYPE_FIELD_BITSIZE (arg_type, fieldno); | |
947 | v->offset = value_offset (arg1) + offset | |
2e70b7b9 | 948 | + TYPE_FIELD_BITPOS (arg_type, fieldno) / 8; |
c906108c SS |
949 | } |
950 | else if (fieldno < TYPE_N_BASECLASSES (arg_type)) | |
951 | { | |
952 | /* This field is actually a base subobject, so preserve the | |
953 | entire object's contents for later references to virtual | |
954 | bases, etc. */ | |
4754a64e | 955 | v = allocate_value (value_enclosing_type (arg1)); |
df407dfe | 956 | v->type = type; |
c906108c SS |
957 | if (VALUE_LAZY (arg1)) |
958 | VALUE_LAZY (v) = 1; | |
959 | else | |
990a07ab | 960 | memcpy (value_contents_all_raw (v), value_contents_all_raw (arg1), |
4754a64e | 961 | TYPE_LENGTH (value_enclosing_type (arg1))); |
df407dfe | 962 | v->offset = value_offset (arg1); |
c906108c | 963 | VALUE_EMBEDDED_OFFSET (v) |
c5aa993b JM |
964 | = offset + |
965 | VALUE_EMBEDDED_OFFSET (arg1) + | |
966 | TYPE_FIELD_BITPOS (arg_type, fieldno) / 8; | |
c906108c SS |
967 | } |
968 | else | |
969 | { | |
970 | /* Plain old data member */ | |
971 | offset += TYPE_FIELD_BITPOS (arg_type, fieldno) / 8; | |
972 | v = allocate_value (type); | |
973 | if (VALUE_LAZY (arg1)) | |
974 | VALUE_LAZY (v) = 1; | |
975 | else | |
990a07ab AC |
976 | memcpy (value_contents_raw (v), |
977 | value_contents_raw (arg1) + offset, | |
c906108c | 978 | TYPE_LENGTH (type)); |
df407dfe AC |
979 | v->offset = (value_offset (arg1) + offset |
980 | + VALUE_EMBEDDED_OFFSET (arg1)); | |
c906108c SS |
981 | } |
982 | VALUE_LVAL (v) = VALUE_LVAL (arg1); | |
983 | if (VALUE_LVAL (arg1) == lval_internalvar) | |
984 | VALUE_LVAL (v) = lval_internalvar_component; | |
985 | VALUE_ADDRESS (v) = VALUE_ADDRESS (arg1); | |
9ee8fc9d | 986 | VALUE_REGNUM (v) = VALUE_REGNUM (arg1); |
0c16dd26 | 987 | VALUE_FRAME_ID (v) = VALUE_FRAME_ID (arg1); |
c906108c | 988 | /* VALUE_OFFSET (v) = VALUE_OFFSET (arg1) + offset |
c5aa993b | 989 | + TYPE_FIELD_BITPOS (arg_type, fieldno) / 8; */ |
c906108c SS |
990 | return v; |
991 | } | |
992 | ||
993 | /* Given a value ARG1 of a struct or union type, | |
994 | extract and return the value of one of its (non-static) fields. | |
995 | FIELDNO says which field. */ | |
996 | ||
f23631e4 | 997 | struct value * |
aa1ee363 | 998 | value_field (struct value *arg1, int fieldno) |
c906108c | 999 | { |
df407dfe | 1000 | return value_primitive_field (arg1, 0, fieldno, value_type (arg1)); |
c906108c SS |
1001 | } |
1002 | ||
1003 | /* Return a non-virtual function as a value. | |
1004 | F is the list of member functions which contains the desired method. | |
0478d61c FF |
1005 | J is an index into F which provides the desired method. |
1006 | ||
1007 | We only use the symbol for its address, so be happy with either a | |
1008 | full symbol or a minimal symbol. | |
1009 | */ | |
c906108c | 1010 | |
f23631e4 AC |
1011 | struct value * |
1012 | value_fn_field (struct value **arg1p, struct fn_field *f, int j, struct type *type, | |
fba45db2 | 1013 | int offset) |
c906108c | 1014 | { |
f23631e4 | 1015 | struct value *v; |
52f0bd74 | 1016 | struct type *ftype = TYPE_FN_FIELD_TYPE (f, j); |
0478d61c | 1017 | char *physname = TYPE_FN_FIELD_PHYSNAME (f, j); |
c906108c | 1018 | struct symbol *sym; |
0478d61c | 1019 | struct minimal_symbol *msym; |
c906108c | 1020 | |
176620f1 | 1021 | sym = lookup_symbol (physname, 0, VAR_DOMAIN, 0, NULL); |
5ae326fa | 1022 | if (sym != NULL) |
0478d61c | 1023 | { |
5ae326fa AC |
1024 | msym = NULL; |
1025 | } | |
1026 | else | |
1027 | { | |
1028 | gdb_assert (sym == NULL); | |
0478d61c | 1029 | msym = lookup_minimal_symbol (physname, NULL, NULL); |
5ae326fa AC |
1030 | if (msym == NULL) |
1031 | return NULL; | |
0478d61c FF |
1032 | } |
1033 | ||
c906108c | 1034 | v = allocate_value (ftype); |
0478d61c FF |
1035 | if (sym) |
1036 | { | |
1037 | VALUE_ADDRESS (v) = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); | |
1038 | } | |
1039 | else | |
1040 | { | |
1041 | VALUE_ADDRESS (v) = SYMBOL_VALUE_ADDRESS (msym); | |
1042 | } | |
c906108c SS |
1043 | |
1044 | if (arg1p) | |
c5aa993b | 1045 | { |
df407dfe | 1046 | if (type != value_type (*arg1p)) |
c5aa993b JM |
1047 | *arg1p = value_ind (value_cast (lookup_pointer_type (type), |
1048 | value_addr (*arg1p))); | |
1049 | ||
070ad9f0 | 1050 | /* Move the `this' pointer according to the offset. |
c5aa993b JM |
1051 | VALUE_OFFSET (*arg1p) += offset; |
1052 | */ | |
c906108c SS |
1053 | } |
1054 | ||
1055 | return v; | |
1056 | } | |
1057 | ||
c906108c SS |
1058 | \f |
1059 | /* Unpack a field FIELDNO of the specified TYPE, from the anonymous object at | |
1060 | VALADDR. | |
1061 | ||
1062 | Extracting bits depends on endianness of the machine. Compute the | |
1063 | number of least significant bits to discard. For big endian machines, | |
1064 | we compute the total number of bits in the anonymous object, subtract | |
1065 | off the bit count from the MSB of the object to the MSB of the | |
1066 | bitfield, then the size of the bitfield, which leaves the LSB discard | |
1067 | count. For little endian machines, the discard count is simply the | |
1068 | number of bits from the LSB of the anonymous object to the LSB of the | |
1069 | bitfield. | |
1070 | ||
1071 | If the field is signed, we also do sign extension. */ | |
1072 | ||
1073 | LONGEST | |
66140c26 | 1074 | unpack_field_as_long (struct type *type, const char *valaddr, int fieldno) |
c906108c SS |
1075 | { |
1076 | ULONGEST val; | |
1077 | ULONGEST valmask; | |
1078 | int bitpos = TYPE_FIELD_BITPOS (type, fieldno); | |
1079 | int bitsize = TYPE_FIELD_BITSIZE (type, fieldno); | |
1080 | int lsbcount; | |
1081 | struct type *field_type; | |
1082 | ||
1083 | val = extract_unsigned_integer (valaddr + bitpos / 8, sizeof (val)); | |
1084 | field_type = TYPE_FIELD_TYPE (type, fieldno); | |
1085 | CHECK_TYPEDEF (field_type); | |
1086 | ||
1087 | /* Extract bits. See comment above. */ | |
1088 | ||
1089 | if (BITS_BIG_ENDIAN) | |
1090 | lsbcount = (sizeof val * 8 - bitpos % 8 - bitsize); | |
1091 | else | |
1092 | lsbcount = (bitpos % 8); | |
1093 | val >>= lsbcount; | |
1094 | ||
1095 | /* If the field does not entirely fill a LONGEST, then zero the sign bits. | |
1096 | If the field is signed, and is negative, then sign extend. */ | |
1097 | ||
1098 | if ((bitsize > 0) && (bitsize < 8 * (int) sizeof (val))) | |
1099 | { | |
1100 | valmask = (((ULONGEST) 1) << bitsize) - 1; | |
1101 | val &= valmask; | |
1102 | if (!TYPE_UNSIGNED (field_type)) | |
1103 | { | |
1104 | if (val & (valmask ^ (valmask >> 1))) | |
1105 | { | |
1106 | val |= ~valmask; | |
1107 | } | |
1108 | } | |
1109 | } | |
1110 | return (val); | |
1111 | } | |
1112 | ||
1113 | /* Modify the value of a bitfield. ADDR points to a block of memory in | |
1114 | target byte order; the bitfield starts in the byte pointed to. FIELDVAL | |
1115 | is the desired value of the field, in host byte order. BITPOS and BITSIZE | |
f4e88c8e PH |
1116 | indicate which bits (in target bit order) comprise the bitfield. |
1117 | Requires 0 < BITSIZE <= lbits, 0 <= BITPOS+BITSIZE <= lbits, and | |
1118 | 0 <= BITPOS, where lbits is the size of a LONGEST in bits. */ | |
c906108c SS |
1119 | |
1120 | void | |
fba45db2 | 1121 | modify_field (char *addr, LONGEST fieldval, int bitpos, int bitsize) |
c906108c | 1122 | { |
f4e88c8e PH |
1123 | ULONGEST oword; |
1124 | ULONGEST mask = (ULONGEST) -1 >> (8 * sizeof (ULONGEST) - bitsize); | |
c906108c SS |
1125 | |
1126 | /* If a negative fieldval fits in the field in question, chop | |
1127 | off the sign extension bits. */ | |
f4e88c8e PH |
1128 | if ((~fieldval & ~(mask >> 1)) == 0) |
1129 | fieldval &= mask; | |
c906108c SS |
1130 | |
1131 | /* Warn if value is too big to fit in the field in question. */ | |
f4e88c8e | 1132 | if (0 != (fieldval & ~mask)) |
c906108c SS |
1133 | { |
1134 | /* FIXME: would like to include fieldval in the message, but | |
c5aa993b | 1135 | we don't have a sprintf_longest. */ |
c906108c SS |
1136 | warning ("Value does not fit in %d bits.", bitsize); |
1137 | ||
1138 | /* Truncate it, otherwise adjoining fields may be corrupted. */ | |
f4e88c8e | 1139 | fieldval &= mask; |
c906108c SS |
1140 | } |
1141 | ||
f4e88c8e | 1142 | oword = extract_unsigned_integer (addr, sizeof oword); |
c906108c SS |
1143 | |
1144 | /* Shifting for bit field depends on endianness of the target machine. */ | |
1145 | if (BITS_BIG_ENDIAN) | |
1146 | bitpos = sizeof (oword) * 8 - bitpos - bitsize; | |
1147 | ||
f4e88c8e | 1148 | oword &= ~(mask << bitpos); |
c906108c SS |
1149 | oword |= fieldval << bitpos; |
1150 | ||
f4e88c8e | 1151 | store_unsigned_integer (addr, sizeof oword, oword); |
c906108c SS |
1152 | } |
1153 | \f | |
1154 | /* Convert C numbers into newly allocated values */ | |
1155 | ||
f23631e4 | 1156 | struct value * |
aa1ee363 | 1157 | value_from_longest (struct type *type, LONGEST num) |
c906108c | 1158 | { |
f23631e4 | 1159 | struct value *val = allocate_value (type); |
52f0bd74 AC |
1160 | enum type_code code; |
1161 | int len; | |
c5aa993b | 1162 | retry: |
c906108c SS |
1163 | code = TYPE_CODE (type); |
1164 | len = TYPE_LENGTH (type); | |
1165 | ||
1166 | switch (code) | |
1167 | { | |
1168 | case TYPE_CODE_TYPEDEF: | |
1169 | type = check_typedef (type); | |
1170 | goto retry; | |
1171 | case TYPE_CODE_INT: | |
1172 | case TYPE_CODE_CHAR: | |
1173 | case TYPE_CODE_ENUM: | |
1174 | case TYPE_CODE_BOOL: | |
1175 | case TYPE_CODE_RANGE: | |
990a07ab | 1176 | store_signed_integer (value_contents_raw (val), len, num); |
c906108c | 1177 | break; |
c5aa993b | 1178 | |
c906108c SS |
1179 | case TYPE_CODE_REF: |
1180 | case TYPE_CODE_PTR: | |
990a07ab | 1181 | store_typed_address (value_contents_raw (val), type, (CORE_ADDR) num); |
c906108c | 1182 | break; |
c5aa993b | 1183 | |
c906108c SS |
1184 | default: |
1185 | error ("Unexpected type (%d) encountered for integer constant.", code); | |
1186 | } | |
1187 | return val; | |
1188 | } | |
1189 | ||
4478b372 JB |
1190 | |
1191 | /* Create a value representing a pointer of type TYPE to the address | |
1192 | ADDR. */ | |
f23631e4 | 1193 | struct value * |
4478b372 JB |
1194 | value_from_pointer (struct type *type, CORE_ADDR addr) |
1195 | { | |
f23631e4 | 1196 | struct value *val = allocate_value (type); |
990a07ab | 1197 | store_typed_address (value_contents_raw (val), type, addr); |
4478b372 JB |
1198 | return val; |
1199 | } | |
1200 | ||
1201 | ||
0f71a2f6 | 1202 | /* Create a value for a string constant to be stored locally |
070ad9f0 | 1203 | (not in the inferior's memory space, but in GDB memory). |
0f71a2f6 JM |
1204 | This is analogous to value_from_longest, which also does not |
1205 | use inferior memory. String shall NOT contain embedded nulls. */ | |
1206 | ||
f23631e4 | 1207 | struct value * |
fba45db2 | 1208 | value_from_string (char *ptr) |
0f71a2f6 | 1209 | { |
f23631e4 | 1210 | struct value *val; |
c5aa993b | 1211 | int len = strlen (ptr); |
0f71a2f6 | 1212 | int lowbound = current_language->string_lower_bound; |
f290d38e AC |
1213 | struct type *string_char_type; |
1214 | struct type *rangetype; | |
1215 | struct type *stringtype; | |
1216 | ||
1217 | rangetype = create_range_type ((struct type *) NULL, | |
1218 | builtin_type_int, | |
1219 | lowbound, len + lowbound - 1); | |
1220 | string_char_type = language_string_char_type (current_language, | |
1221 | current_gdbarch); | |
1222 | stringtype = create_array_type ((struct type *) NULL, | |
1223 | string_char_type, | |
1224 | rangetype); | |
0f71a2f6 | 1225 | val = allocate_value (stringtype); |
990a07ab | 1226 | memcpy (value_contents_raw (val), ptr, len); |
0f71a2f6 JM |
1227 | return val; |
1228 | } | |
1229 | ||
f23631e4 | 1230 | struct value * |
fba45db2 | 1231 | value_from_double (struct type *type, DOUBLEST num) |
c906108c | 1232 | { |
f23631e4 | 1233 | struct value *val = allocate_value (type); |
c906108c | 1234 | struct type *base_type = check_typedef (type); |
52f0bd74 AC |
1235 | enum type_code code = TYPE_CODE (base_type); |
1236 | int len = TYPE_LENGTH (base_type); | |
c906108c SS |
1237 | |
1238 | if (code == TYPE_CODE_FLT) | |
1239 | { | |
990a07ab | 1240 | store_typed_floating (value_contents_raw (val), base_type, num); |
c906108c SS |
1241 | } |
1242 | else | |
1243 | error ("Unexpected type encountered for floating constant."); | |
1244 | ||
1245 | return val; | |
1246 | } | |
994b9211 AC |
1247 | |
1248 | struct value * | |
1249 | coerce_ref (struct value *arg) | |
1250 | { | |
df407dfe | 1251 | struct type *value_type_arg_tmp = check_typedef (value_type (arg)); |
994b9211 AC |
1252 | if (TYPE_CODE (value_type_arg_tmp) == TYPE_CODE_REF) |
1253 | arg = value_at_lazy (TYPE_TARGET_TYPE (value_type_arg_tmp), | |
df407dfe | 1254 | unpack_pointer (value_type (arg), |
994b9211 AC |
1255 | VALUE_CONTENTS (arg))); |
1256 | return arg; | |
1257 | } | |
1258 | ||
1259 | struct value * | |
1260 | coerce_array (struct value *arg) | |
1261 | { | |
1262 | arg = coerce_ref (arg); | |
1263 | if (current_language->c_style_arrays | |
df407dfe | 1264 | && TYPE_CODE (value_type (arg)) == TYPE_CODE_ARRAY) |
994b9211 | 1265 | arg = value_coerce_array (arg); |
df407dfe | 1266 | if (TYPE_CODE (value_type (arg)) == TYPE_CODE_FUNC) |
994b9211 AC |
1267 | arg = value_coerce_function (arg); |
1268 | return arg; | |
1269 | } | |
1270 | ||
1271 | struct value * | |
1272 | coerce_number (struct value *arg) | |
1273 | { | |
1274 | arg = coerce_array (arg); | |
1275 | arg = coerce_enum (arg); | |
1276 | return arg; | |
1277 | } | |
1278 | ||
1279 | struct value * | |
1280 | coerce_enum (struct value *arg) | |
1281 | { | |
df407dfe | 1282 | if (TYPE_CODE (check_typedef (value_type (arg))) == TYPE_CODE_ENUM) |
994b9211 AC |
1283 | arg = value_cast (builtin_type_unsigned_int, arg); |
1284 | return arg; | |
1285 | } | |
c906108c | 1286 | \f |
c906108c | 1287 | |
74055713 AC |
1288 | /* Should we use DEPRECATED_EXTRACT_STRUCT_VALUE_ADDRESS instead of |
1289 | EXTRACT_RETURN_VALUE? GCC_P is true if compiled with gcc and TYPE | |
1290 | is the type (which is known to be struct, union or array). | |
c906108c SS |
1291 | |
1292 | On most machines, the struct convention is used unless we are | |
1293 | using gcc and the type is of a special size. */ | |
1294 | /* As of about 31 Mar 93, GCC was changed to be compatible with the | |
1295 | native compiler. GCC 2.3.3 was the last release that did it the | |
1296 | old way. Since gcc2_compiled was not changed, we have no | |
1297 | way to correctly win in all cases, so we just do the right thing | |
1298 | for gcc1 and for gcc2 after this change. Thus it loses for gcc | |
1299 | 2.0-2.3.3. This is somewhat unfortunate, but changing gcc2_compiled | |
1300 | would cause more chaos than dealing with some struct returns being | |
1301 | handled wrong. */ | |
bc87dfa0 AC |
1302 | /* NOTE: cagney/2004-06-13: Deleted check for "gcc_p". GCC 1.x is |
1303 | dead. */ | |
c906108c SS |
1304 | |
1305 | int | |
fba45db2 | 1306 | generic_use_struct_convention (int gcc_p, struct type *value_type) |
c5aa993b | 1307 | { |
bc87dfa0 AC |
1308 | return !(TYPE_LENGTH (value_type) == 1 |
1309 | || TYPE_LENGTH (value_type) == 2 | |
1310 | || TYPE_LENGTH (value_type) == 4 | |
1311 | || TYPE_LENGTH (value_type) == 8); | |
c906108c SS |
1312 | } |
1313 | ||
48436ce6 AC |
1314 | /* Return true if the function returning the specified type is using |
1315 | the convention of returning structures in memory (passing in the | |
1316 | address as a hidden first parameter). GCC_P is nonzero if compiled | |
c906108c SS |
1317 | with GCC. */ |
1318 | ||
1319 | int | |
48436ce6 | 1320 | using_struct_return (struct type *value_type, int gcc_p) |
c906108c | 1321 | { |
52f0bd74 | 1322 | enum type_code code = TYPE_CODE (value_type); |
c906108c SS |
1323 | |
1324 | if (code == TYPE_CODE_ERROR) | |
1325 | error ("Function return type unknown."); | |
1326 | ||
667e784f AC |
1327 | if (code == TYPE_CODE_VOID) |
1328 | /* A void return value is never in memory. See also corresponding | |
44e5158b | 1329 | code in "print_return_value". */ |
667e784f AC |
1330 | return 0; |
1331 | ||
92ad9cd9 AC |
1332 | /* Probe the architecture for the return-value convention. */ |
1333 | return (gdbarch_return_value (current_gdbarch, value_type, | |
1334 | NULL, NULL, NULL) | |
31db7b6c | 1335 | != RETURN_VALUE_REGISTER_CONVENTION); |
c906108c SS |
1336 | } |
1337 | ||
c906108c | 1338 | void |
fba45db2 | 1339 | _initialize_values (void) |
c906108c SS |
1340 | { |
1341 | add_cmd ("convenience", no_class, show_convenience, | |
c5aa993b | 1342 | "Debugger convenience (\"$foo\") variables.\n\ |
c906108c SS |
1343 | These variables are created when you assign them values;\n\ |
1344 | thus, \"print $foo=1\" gives \"$foo\" the value 1. Values may be any type.\n\n\ | |
1345 | A few convenience variables are given values automatically:\n\ | |
1346 | \"$_\"holds the last address examined with \"x\" or \"info lines\",\n\ | |
1347 | \"$__\" holds the contents of the last address examined with \"x\".", | |
1348 | &showlist); | |
1349 | ||
1350 | add_cmd ("values", no_class, show_values, | |
1351 | "Elements of value history around item number IDX (or last ten).", | |
1352 | &showlist); | |
1353 | } |