Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Evaluate expressions for GDB. |
1bac305b | 2 | |
ecd75fc8 | 3 | Copyright (C) 1986-2014 Free Software Foundation, Inc. |
c906108c | 4 | |
c5aa993b | 5 | This file is part of GDB. |
c906108c | 6 | |
c5aa993b JM |
7 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 10 | (at your option) any later version. |
c906108c | 11 | |
c5aa993b JM |
12 | This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
c906108c | 16 | |
c5aa993b | 17 | You should have received a copy of the GNU General Public License |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
19 | |
20 | #include "defs.h" | |
0e9f083f | 21 | #include <string.h> |
c906108c SS |
22 | #include "symtab.h" |
23 | #include "gdbtypes.h" | |
24 | #include "value.h" | |
25 | #include "expression.h" | |
26 | #include "target.h" | |
27 | #include "frame.h" | |
0963b4bd MS |
28 | #include "language.h" /* For CAST_IS_CONVERSION. */ |
29 | #include "f-lang.h" /* For array bound stuff. */ | |
015a42b4 | 30 | #include "cp-abi.h" |
04714b91 | 31 | #include "infcall.h" |
a9fa03de AF |
32 | #include "objc-lang.h" |
33 | #include "block.h" | |
5f9769d1 | 34 | #include "parser-defs.h" |
d3cbe7ef | 35 | #include "cp-support.h" |
5e572bb4 DJ |
36 | #include "ui-out.h" |
37 | #include "exceptions.h" | |
123dc839 | 38 | #include "regcache.h" |
029a67e4 | 39 | #include "user-regs.h" |
79a45b7d | 40 | #include "valprint.h" |
072bba3b KS |
41 | #include "gdb_obstack.h" |
42 | #include "objfiles.h" | |
c906108c | 43 | |
0d5de010 DJ |
44 | #include "gdb_assert.h" |
45 | ||
bc3b79fd TJB |
46 | #include <ctype.h> |
47 | ||
c5aa993b | 48 | /* This is defined in valops.c */ |
c906108c SS |
49 | extern int overload_resolution; |
50 | ||
0963b4bd | 51 | /* Prototypes for local functions. */ |
c906108c | 52 | |
5ecaaa66 SA |
53 | static struct value *evaluate_subexp_for_sizeof (struct expression *, int *, |
54 | enum noside); | |
c906108c | 55 | |
61051030 AC |
56 | static struct value *evaluate_subexp_for_address (struct expression *, |
57 | int *, enum noside); | |
c906108c | 58 | |
61051030 AC |
59 | static struct value *evaluate_struct_tuple (struct value *, |
60 | struct expression *, int *, | |
61 | enum noside, int); | |
c906108c | 62 | |
61051030 AC |
63 | static LONGEST init_array_element (struct value *, struct value *, |
64 | struct expression *, int *, enum noside, | |
65 | LONGEST, LONGEST); | |
c906108c | 66 | |
4b27a620 | 67 | struct value * |
aa1ee363 AC |
68 | evaluate_subexp (struct type *expect_type, struct expression *exp, |
69 | int *pos, enum noside noside) | |
c906108c | 70 | { |
5f9769d1 PH |
71 | return (*exp->language_defn->la_exp_desc->evaluate_exp) |
72 | (expect_type, exp, pos, noside); | |
c906108c SS |
73 | } |
74 | \f | |
75 | /* Parse the string EXP as a C expression, evaluate it, | |
76 | and return the result as a number. */ | |
77 | ||
78 | CORE_ADDR | |
bbc13ae3 | 79 | parse_and_eval_address (const char *exp) |
c906108c SS |
80 | { |
81 | struct expression *expr = parse_expression (exp); | |
52f0bd74 AC |
82 | CORE_ADDR addr; |
83 | struct cleanup *old_chain = | |
62995fc4 | 84 | make_cleanup (free_current_contents, &expr); |
c906108c | 85 | |
1aa20aa8 | 86 | addr = value_as_address (evaluate_expression (expr)); |
c906108c SS |
87 | do_cleanups (old_chain); |
88 | return addr; | |
89 | } | |
90 | ||
bb518678 | 91 | /* Like parse_and_eval_address, but treats the value of the expression |
0963b4bd | 92 | as an integer, not an address, returns a LONGEST, not a CORE_ADDR. */ |
bb518678 | 93 | LONGEST |
a1b8c4cc | 94 | parse_and_eval_long (const char *exp) |
bb518678 DT |
95 | { |
96 | struct expression *expr = parse_expression (exp); | |
52f0bd74 AC |
97 | LONGEST retval; |
98 | struct cleanup *old_chain = | |
bb518678 DT |
99 | make_cleanup (free_current_contents, &expr); |
100 | ||
101 | retval = value_as_long (evaluate_expression (expr)); | |
102 | do_cleanups (old_chain); | |
103 | return (retval); | |
104 | } | |
105 | ||
61051030 | 106 | struct value * |
bbc13ae3 | 107 | parse_and_eval (const char *exp) |
c906108c SS |
108 | { |
109 | struct expression *expr = parse_expression (exp); | |
61051030 | 110 | struct value *val; |
52f0bd74 | 111 | struct cleanup *old_chain = |
62995fc4 | 112 | make_cleanup (free_current_contents, &expr); |
c906108c SS |
113 | |
114 | val = evaluate_expression (expr); | |
115 | do_cleanups (old_chain); | |
116 | return val; | |
117 | } | |
118 | ||
119 | /* Parse up to a comma (or to a closeparen) | |
120 | in the string EXPP as an expression, evaluate it, and return the value. | |
121 | EXPP is advanced to point to the comma. */ | |
122 | ||
61051030 | 123 | struct value * |
bbc13ae3 | 124 | parse_to_comma_and_eval (const char **expp) |
c906108c | 125 | { |
1bb9788d | 126 | struct expression *expr = parse_exp_1 (expp, 0, (struct block *) 0, 1); |
61051030 | 127 | struct value *val; |
52f0bd74 | 128 | struct cleanup *old_chain = |
62995fc4 | 129 | make_cleanup (free_current_contents, &expr); |
c906108c SS |
130 | |
131 | val = evaluate_expression (expr); | |
132 | do_cleanups (old_chain); | |
133 | return val; | |
134 | } | |
135 | \f | |
136 | /* Evaluate an expression in internal prefix form | |
137 | such as is constructed by parse.y. | |
138 | ||
139 | See expression.h for info on the format of an expression. */ | |
140 | ||
61051030 | 141 | struct value * |
fba45db2 | 142 | evaluate_expression (struct expression *exp) |
c906108c SS |
143 | { |
144 | int pc = 0; | |
d7f9d729 | 145 | |
c906108c SS |
146 | return evaluate_subexp (NULL_TYPE, exp, &pc, EVAL_NORMAL); |
147 | } | |
148 | ||
149 | /* Evaluate an expression, avoiding all memory references | |
150 | and getting a value whose type alone is correct. */ | |
151 | ||
61051030 | 152 | struct value * |
fba45db2 | 153 | evaluate_type (struct expression *exp) |
c906108c SS |
154 | { |
155 | int pc = 0; | |
d7f9d729 | 156 | |
c906108c SS |
157 | return evaluate_subexp (NULL_TYPE, exp, &pc, EVAL_AVOID_SIDE_EFFECTS); |
158 | } | |
159 | ||
65d12d83 TT |
160 | /* Evaluate a subexpression, avoiding all memory references and |
161 | getting a value whose type alone is correct. */ | |
162 | ||
163 | struct value * | |
164 | evaluate_subexpression_type (struct expression *exp, int subexp) | |
165 | { | |
166 | return evaluate_subexp (NULL_TYPE, exp, &subexp, EVAL_AVOID_SIDE_EFFECTS); | |
167 | } | |
168 | ||
0cf6dd15 TJB |
169 | /* Find the current value of a watchpoint on EXP. Return the value in |
170 | *VALP and *RESULTP and the chain of intermediate and final values | |
171 | in *VAL_CHAIN. RESULTP and VAL_CHAIN may be NULL if the caller does | |
172 | not need them. | |
173 | ||
3a1115a0 TT |
174 | If PRESERVE_ERRORS is true, then exceptions are passed through. |
175 | Otherwise, if PRESERVE_ERRORS is false, then if a memory error | |
176 | occurs while evaluating the expression, *RESULTP will be set to | |
177 | NULL. *RESULTP may be a lazy value, if the result could not be | |
178 | read from memory. It is used to determine whether a value is | |
179 | user-specified (we should watch the whole value) or intermediate | |
0cf6dd15 TJB |
180 | (we should watch only the bit used to locate the final value). |
181 | ||
182 | If the final value, or any intermediate value, could not be read | |
183 | from memory, *VALP will be set to NULL. *VAL_CHAIN will still be | |
184 | set to any referenced values. *VALP will never be a lazy value. | |
185 | This is the value which we store in struct breakpoint. | |
186 | ||
187 | If VAL_CHAIN is non-NULL, *VAL_CHAIN will be released from the | |
188 | value chain. The caller must free the values individually. If | |
189 | VAL_CHAIN is NULL, all generated values will be left on the value | |
190 | chain. */ | |
191 | ||
192 | void | |
193 | fetch_subexp_value (struct expression *exp, int *pc, struct value **valp, | |
3a1115a0 TT |
194 | struct value **resultp, struct value **val_chain, |
195 | int preserve_errors) | |
0cf6dd15 TJB |
196 | { |
197 | struct value *mark, *new_mark, *result; | |
198 | volatile struct gdb_exception ex; | |
199 | ||
200 | *valp = NULL; | |
201 | if (resultp) | |
202 | *resultp = NULL; | |
203 | if (val_chain) | |
204 | *val_chain = NULL; | |
205 | ||
206 | /* Evaluate the expression. */ | |
207 | mark = value_mark (); | |
208 | result = NULL; | |
209 | ||
210 | TRY_CATCH (ex, RETURN_MASK_ALL) | |
211 | { | |
212 | result = evaluate_subexp (NULL_TYPE, exp, pc, EVAL_NORMAL); | |
213 | } | |
214 | if (ex.reason < 0) | |
215 | { | |
3a1115a0 | 216 | /* Ignore memory errors if we want watchpoints pointing at |
0cf6dd15 TJB |
217 | inaccessible memory to still be created; otherwise, throw the |
218 | error to some higher catcher. */ | |
219 | switch (ex.error) | |
220 | { | |
221 | case MEMORY_ERROR: | |
3a1115a0 TT |
222 | if (!preserve_errors) |
223 | break; | |
0cf6dd15 TJB |
224 | default: |
225 | throw_exception (ex); | |
226 | break; | |
227 | } | |
228 | } | |
229 | ||
230 | new_mark = value_mark (); | |
231 | if (mark == new_mark) | |
232 | return; | |
233 | if (resultp) | |
234 | *resultp = result; | |
235 | ||
236 | /* Make sure it's not lazy, so that after the target stops again we | |
237 | have a non-lazy previous value to compare with. */ | |
8e7b59a5 KS |
238 | if (result != NULL) |
239 | { | |
240 | if (!value_lazy (result)) | |
241 | *valp = result; | |
242 | else | |
243 | { | |
244 | volatile struct gdb_exception except; | |
245 | ||
246 | TRY_CATCH (except, RETURN_MASK_ERROR) | |
247 | { | |
248 | value_fetch_lazy (result); | |
249 | *valp = result; | |
250 | } | |
251 | } | |
252 | } | |
0cf6dd15 TJB |
253 | |
254 | if (val_chain) | |
255 | { | |
256 | /* Return the chain of intermediate values. We use this to | |
257 | decide which addresses to watch. */ | |
258 | *val_chain = new_mark; | |
259 | value_release_to_mark (mark); | |
260 | } | |
261 | } | |
262 | ||
65d12d83 TT |
263 | /* Extract a field operation from an expression. If the subexpression |
264 | of EXP starting at *SUBEXP is not a structure dereference | |
265 | operation, return NULL. Otherwise, return the name of the | |
266 | dereferenced field, and advance *SUBEXP to point to the | |
267 | subexpression of the left-hand-side of the dereference. This is | |
268 | used when completing field names. */ | |
269 | ||
270 | char * | |
271 | extract_field_op (struct expression *exp, int *subexp) | |
272 | { | |
273 | int tem; | |
274 | char *result; | |
d7f9d729 | 275 | |
65d12d83 TT |
276 | if (exp->elts[*subexp].opcode != STRUCTOP_STRUCT |
277 | && exp->elts[*subexp].opcode != STRUCTOP_PTR) | |
278 | return NULL; | |
279 | tem = longest_to_int (exp->elts[*subexp + 1].longconst); | |
280 | result = &exp->elts[*subexp + 2].string; | |
281 | (*subexp) += 1 + 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
282 | return result; | |
283 | } | |
284 | ||
f0559fff YQ |
285 | /* This function evaluates brace-initializers (in C/C++) for |
286 | structure types. */ | |
c906108c | 287 | |
61051030 AC |
288 | static struct value * |
289 | evaluate_struct_tuple (struct value *struct_val, | |
aa1ee363 AC |
290 | struct expression *exp, |
291 | int *pos, enum noside noside, int nargs) | |
c906108c | 292 | { |
df407dfe | 293 | struct type *struct_type = check_typedef (value_type (struct_val)); |
c906108c SS |
294 | struct type *field_type; |
295 | int fieldno = -1; | |
d7f9d729 | 296 | |
c5aa993b | 297 | while (--nargs >= 0) |
c906108c | 298 | { |
61051030 | 299 | struct value *val = NULL; |
c906108c | 300 | int bitpos, bitsize; |
0fd88904 | 301 | bfd_byte *addr; |
c5aa993b | 302 | |
f0559fff YQ |
303 | fieldno++; |
304 | /* Skip static fields. */ | |
305 | while (fieldno < TYPE_NFIELDS (struct_type) | |
306 | && field_is_static (&TYPE_FIELD (struct_type, | |
307 | fieldno))) | |
308 | fieldno++; | |
309 | if (fieldno >= TYPE_NFIELDS (struct_type)) | |
310 | error (_("too many initializers")); | |
311 | field_type = TYPE_FIELD_TYPE (struct_type, fieldno); | |
312 | if (TYPE_CODE (field_type) == TYPE_CODE_UNION | |
313 | && TYPE_FIELD_NAME (struct_type, fieldno)[0] == '0') | |
314 | error (_("don't know which variant you want to set")); | |
315 | ||
316 | /* Here, struct_type is the type of the inner struct, | |
317 | while substruct_type is the type of the inner struct. | |
318 | These are the same for normal structures, but a variant struct | |
319 | contains anonymous union fields that contain substruct fields. | |
320 | The value fieldno is the index of the top-level (normal or | |
321 | anonymous union) field in struct_field, while the value | |
322 | subfieldno is the index of the actual real (named inner) field | |
323 | in substruct_type. */ | |
324 | ||
325 | field_type = TYPE_FIELD_TYPE (struct_type, fieldno); | |
326 | if (val == 0) | |
327 | val = evaluate_subexp (field_type, exp, pos, noside); | |
328 | ||
329 | /* Now actually set the field in struct_val. */ | |
330 | ||
331 | /* Assign val to field fieldno. */ | |
332 | if (value_type (val) != field_type) | |
333 | val = value_cast (field_type, val); | |
334 | ||
335 | bitsize = TYPE_FIELD_BITSIZE (struct_type, fieldno); | |
336 | bitpos = TYPE_FIELD_BITPOS (struct_type, fieldno); | |
337 | addr = value_contents_writeable (struct_val) + bitpos / 8; | |
338 | if (bitsize) | |
339 | modify_field (struct_type, addr, | |
340 | value_as_long (val), bitpos % 8, bitsize); | |
341 | else | |
342 | memcpy (addr, value_contents (val), | |
343 | TYPE_LENGTH (value_type (val))); | |
c906108c | 344 | |
c906108c SS |
345 | } |
346 | return struct_val; | |
347 | } | |
348 | ||
db034ac5 | 349 | /* Recursive helper function for setting elements of array tuples for |
1b831c93 AC |
350 | (the deleted) Chill. The target is ARRAY (which has bounds |
351 | LOW_BOUND to HIGH_BOUND); the element value is ELEMENT; EXP, POS | |
352 | and NOSIDE are as usual. Evaluates index expresions and sets the | |
353 | specified element(s) of ARRAY to ELEMENT. Returns last index | |
354 | value. */ | |
c906108c SS |
355 | |
356 | static LONGEST | |
61051030 | 357 | init_array_element (struct value *array, struct value *element, |
aa1ee363 | 358 | struct expression *exp, int *pos, |
fba45db2 | 359 | enum noside noside, LONGEST low_bound, LONGEST high_bound) |
c906108c SS |
360 | { |
361 | LONGEST index; | |
df407dfe | 362 | int element_size = TYPE_LENGTH (value_type (element)); |
d7f9d729 | 363 | |
c906108c SS |
364 | if (exp->elts[*pos].opcode == BINOP_COMMA) |
365 | { | |
366 | (*pos)++; | |
367 | init_array_element (array, element, exp, pos, noside, | |
368 | low_bound, high_bound); | |
369 | return init_array_element (array, element, | |
370 | exp, pos, noside, low_bound, high_bound); | |
371 | } | |
c906108c SS |
372 | else |
373 | { | |
374 | index = value_as_long (evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
375 | if (index < low_bound || index > high_bound) | |
8a3fe4f8 | 376 | error (_("tuple index out of range")); |
990a07ab | 377 | memcpy (value_contents_raw (array) + (index - low_bound) * element_size, |
0fd88904 | 378 | value_contents (element), element_size); |
c906108c SS |
379 | } |
380 | return index; | |
381 | } | |
382 | ||
2c0b251b | 383 | static struct value * |
0b4e1325 WZ |
384 | value_f90_subarray (struct value *array, |
385 | struct expression *exp, int *pos, enum noside noside) | |
386 | { | |
387 | int pc = (*pos) + 1; | |
388 | LONGEST low_bound, high_bound; | |
389 | struct type *range = check_typedef (TYPE_INDEX_TYPE (value_type (array))); | |
390 | enum f90_range_type range_type = longest_to_int (exp->elts[pc].longconst); | |
391 | ||
392 | *pos += 3; | |
393 | ||
394 | if (range_type == LOW_BOUND_DEFAULT || range_type == BOTH_BOUND_DEFAULT) | |
395 | low_bound = TYPE_LOW_BOUND (range); | |
396 | else | |
397 | low_bound = value_as_long (evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
398 | ||
399 | if (range_type == HIGH_BOUND_DEFAULT || range_type == BOTH_BOUND_DEFAULT) | |
400 | high_bound = TYPE_HIGH_BOUND (range); | |
401 | else | |
402 | high_bound = value_as_long (evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
403 | ||
404 | return value_slice (array, low_bound, high_bound - low_bound + 1); | |
405 | } | |
406 | ||
4066e646 UW |
407 | |
408 | /* Promote value ARG1 as appropriate before performing a unary operation | |
409 | on this argument. | |
410 | If the result is not appropriate for any particular language then it | |
411 | needs to patch this function. */ | |
412 | ||
413 | void | |
414 | unop_promote (const struct language_defn *language, struct gdbarch *gdbarch, | |
415 | struct value **arg1) | |
416 | { | |
417 | struct type *type1; | |
418 | ||
419 | *arg1 = coerce_ref (*arg1); | |
420 | type1 = check_typedef (value_type (*arg1)); | |
421 | ||
422 | if (is_integral_type (type1)) | |
423 | { | |
424 | switch (language->la_language) | |
425 | { | |
426 | default: | |
427 | /* Perform integral promotion for ANSI C/C++. | |
428 | If not appropropriate for any particular language | |
429 | it needs to modify this function. */ | |
430 | { | |
431 | struct type *builtin_int = builtin_type (gdbarch)->builtin_int; | |
d7f9d729 | 432 | |
4066e646 UW |
433 | if (TYPE_LENGTH (type1) < TYPE_LENGTH (builtin_int)) |
434 | *arg1 = value_cast (builtin_int, *arg1); | |
435 | } | |
436 | break; | |
437 | } | |
438 | } | |
439 | } | |
440 | ||
441 | /* Promote values ARG1 and ARG2 as appropriate before performing a binary | |
442 | operation on those two operands. | |
443 | If the result is not appropriate for any particular language then it | |
444 | needs to patch this function. */ | |
445 | ||
446 | void | |
447 | binop_promote (const struct language_defn *language, struct gdbarch *gdbarch, | |
448 | struct value **arg1, struct value **arg2) | |
449 | { | |
450 | struct type *promoted_type = NULL; | |
451 | struct type *type1; | |
452 | struct type *type2; | |
453 | ||
454 | *arg1 = coerce_ref (*arg1); | |
455 | *arg2 = coerce_ref (*arg2); | |
456 | ||
457 | type1 = check_typedef (value_type (*arg1)); | |
458 | type2 = check_typedef (value_type (*arg2)); | |
459 | ||
460 | if ((TYPE_CODE (type1) != TYPE_CODE_FLT | |
461 | && TYPE_CODE (type1) != TYPE_CODE_DECFLOAT | |
462 | && !is_integral_type (type1)) | |
463 | || (TYPE_CODE (type2) != TYPE_CODE_FLT | |
464 | && TYPE_CODE (type2) != TYPE_CODE_DECFLOAT | |
465 | && !is_integral_type (type2))) | |
466 | return; | |
467 | ||
468 | if (TYPE_CODE (type1) == TYPE_CODE_DECFLOAT | |
469 | || TYPE_CODE (type2) == TYPE_CODE_DECFLOAT) | |
470 | { | |
471 | /* No promotion required. */ | |
472 | } | |
473 | else if (TYPE_CODE (type1) == TYPE_CODE_FLT | |
474 | || TYPE_CODE (type2) == TYPE_CODE_FLT) | |
475 | { | |
476 | switch (language->la_language) | |
477 | { | |
478 | case language_c: | |
479 | case language_cplus: | |
480 | case language_asm: | |
481 | case language_objc: | |
f4b8a18d | 482 | case language_opencl: |
4066e646 UW |
483 | /* No promotion required. */ |
484 | break; | |
485 | ||
486 | default: | |
487 | /* For other languages the result type is unchanged from gdb | |
488 | version 6.7 for backward compatibility. | |
489 | If either arg was long double, make sure that value is also long | |
490 | double. Otherwise use double. */ | |
491 | if (TYPE_LENGTH (type1) * 8 > gdbarch_double_bit (gdbarch) | |
492 | || TYPE_LENGTH (type2) * 8 > gdbarch_double_bit (gdbarch)) | |
493 | promoted_type = builtin_type (gdbarch)->builtin_long_double; | |
494 | else | |
495 | promoted_type = builtin_type (gdbarch)->builtin_double; | |
496 | break; | |
497 | } | |
498 | } | |
499 | else if (TYPE_CODE (type1) == TYPE_CODE_BOOL | |
500 | && TYPE_CODE (type2) == TYPE_CODE_BOOL) | |
501 | { | |
502 | /* No promotion required. */ | |
503 | } | |
504 | else | |
505 | /* Integral operations here. */ | |
506 | /* FIXME: Also mixed integral/booleans, with result an integer. */ | |
507 | { | |
508 | const struct builtin_type *builtin = builtin_type (gdbarch); | |
509 | unsigned int promoted_len1 = TYPE_LENGTH (type1); | |
510 | unsigned int promoted_len2 = TYPE_LENGTH (type2); | |
511 | int is_unsigned1 = TYPE_UNSIGNED (type1); | |
512 | int is_unsigned2 = TYPE_UNSIGNED (type2); | |
513 | unsigned int result_len; | |
514 | int unsigned_operation; | |
515 | ||
516 | /* Determine type length and signedness after promotion for | |
517 | both operands. */ | |
518 | if (promoted_len1 < TYPE_LENGTH (builtin->builtin_int)) | |
519 | { | |
520 | is_unsigned1 = 0; | |
521 | promoted_len1 = TYPE_LENGTH (builtin->builtin_int); | |
522 | } | |
523 | if (promoted_len2 < TYPE_LENGTH (builtin->builtin_int)) | |
524 | { | |
525 | is_unsigned2 = 0; | |
526 | promoted_len2 = TYPE_LENGTH (builtin->builtin_int); | |
527 | } | |
528 | ||
529 | if (promoted_len1 > promoted_len2) | |
530 | { | |
531 | unsigned_operation = is_unsigned1; | |
532 | result_len = promoted_len1; | |
533 | } | |
534 | else if (promoted_len2 > promoted_len1) | |
535 | { | |
536 | unsigned_operation = is_unsigned2; | |
537 | result_len = promoted_len2; | |
538 | } | |
539 | else | |
540 | { | |
541 | unsigned_operation = is_unsigned1 || is_unsigned2; | |
542 | result_len = promoted_len1; | |
543 | } | |
544 | ||
545 | switch (language->la_language) | |
546 | { | |
547 | case language_c: | |
548 | case language_cplus: | |
549 | case language_asm: | |
550 | case language_objc: | |
551 | if (result_len <= TYPE_LENGTH (builtin->builtin_int)) | |
552 | { | |
553 | promoted_type = (unsigned_operation | |
554 | ? builtin->builtin_unsigned_int | |
555 | : builtin->builtin_int); | |
556 | } | |
557 | else if (result_len <= TYPE_LENGTH (builtin->builtin_long)) | |
558 | { | |
559 | promoted_type = (unsigned_operation | |
560 | ? builtin->builtin_unsigned_long | |
561 | : builtin->builtin_long); | |
562 | } | |
563 | else | |
564 | { | |
565 | promoted_type = (unsigned_operation | |
566 | ? builtin->builtin_unsigned_long_long | |
567 | : builtin->builtin_long_long); | |
568 | } | |
569 | break; | |
f4b8a18d KW |
570 | case language_opencl: |
571 | if (result_len <= TYPE_LENGTH (lookup_signed_typename | |
572 | (language, gdbarch, "int"))) | |
573 | { | |
574 | promoted_type = | |
575 | (unsigned_operation | |
576 | ? lookup_unsigned_typename (language, gdbarch, "int") | |
577 | : lookup_signed_typename (language, gdbarch, "int")); | |
578 | } | |
579 | else if (result_len <= TYPE_LENGTH (lookup_signed_typename | |
580 | (language, gdbarch, "long"))) | |
581 | { | |
582 | promoted_type = | |
583 | (unsigned_operation | |
584 | ? lookup_unsigned_typename (language, gdbarch, "long") | |
585 | : lookup_signed_typename (language, gdbarch,"long")); | |
586 | } | |
587 | break; | |
4066e646 UW |
588 | default: |
589 | /* For other languages the result type is unchanged from gdb | |
590 | version 6.7 for backward compatibility. | |
591 | If either arg was long long, make sure that value is also long | |
592 | long. Otherwise use long. */ | |
593 | if (unsigned_operation) | |
594 | { | |
595 | if (result_len > gdbarch_long_bit (gdbarch) / HOST_CHAR_BIT) | |
596 | promoted_type = builtin->builtin_unsigned_long_long; | |
597 | else | |
598 | promoted_type = builtin->builtin_unsigned_long; | |
599 | } | |
600 | else | |
601 | { | |
602 | if (result_len > gdbarch_long_bit (gdbarch) / HOST_CHAR_BIT) | |
603 | promoted_type = builtin->builtin_long_long; | |
604 | else | |
605 | promoted_type = builtin->builtin_long; | |
606 | } | |
607 | break; | |
608 | } | |
609 | } | |
610 | ||
611 | if (promoted_type) | |
612 | { | |
613 | /* Promote both operands to common type. */ | |
614 | *arg1 = value_cast (promoted_type, *arg1); | |
615 | *arg2 = value_cast (promoted_type, *arg2); | |
616 | } | |
617 | } | |
618 | ||
89eef114 | 619 | static int |
cc73bb8c | 620 | ptrmath_type_p (const struct language_defn *lang, struct type *type) |
89eef114 UW |
621 | { |
622 | type = check_typedef (type); | |
623 | if (TYPE_CODE (type) == TYPE_CODE_REF) | |
624 | type = TYPE_TARGET_TYPE (type); | |
625 | ||
626 | switch (TYPE_CODE (type)) | |
627 | { | |
628 | case TYPE_CODE_PTR: | |
629 | case TYPE_CODE_FUNC: | |
630 | return 1; | |
631 | ||
632 | case TYPE_CODE_ARRAY: | |
7346b668 | 633 | return TYPE_VECTOR (type) ? 0 : lang->c_style_arrays; |
89eef114 UW |
634 | |
635 | default: | |
636 | return 0; | |
637 | } | |
638 | } | |
639 | ||
072bba3b KS |
640 | /* Constructs a fake method with the given parameter types. |
641 | This function is used by the parser to construct an "expected" | |
642 | type for method overload resolution. */ | |
643 | ||
644 | static struct type * | |
645 | make_params (int num_types, struct type **param_types) | |
646 | { | |
41bf6aca TT |
647 | struct type *type = XCNEW (struct type); |
648 | TYPE_MAIN_TYPE (type) = XCNEW (struct main_type); | |
072bba3b KS |
649 | TYPE_LENGTH (type) = 1; |
650 | TYPE_CODE (type) = TYPE_CODE_METHOD; | |
651 | TYPE_VPTR_FIELDNO (type) = -1; | |
652 | TYPE_CHAIN (type) = type; | |
e314d629 | 653 | if (num_types > 0) |
a6fb9c08 | 654 | { |
e314d629 TT |
655 | if (param_types[num_types - 1] == NULL) |
656 | { | |
657 | --num_types; | |
658 | TYPE_VARARGS (type) = 1; | |
659 | } | |
660 | else if (TYPE_CODE (check_typedef (param_types[num_types - 1])) | |
661 | == TYPE_CODE_VOID) | |
662 | { | |
663 | --num_types; | |
664 | /* Caller should have ensured this. */ | |
665 | gdb_assert (num_types == 0); | |
666 | TYPE_PROTOTYPED (type) = 1; | |
667 | } | |
a6fb9c08 | 668 | } |
e314d629 | 669 | |
072bba3b KS |
670 | TYPE_NFIELDS (type) = num_types; |
671 | TYPE_FIELDS (type) = (struct field *) | |
672 | TYPE_ZALLOC (type, sizeof (struct field) * num_types); | |
673 | ||
674 | while (num_types-- > 0) | |
675 | TYPE_FIELD_TYPE (type, num_types) = param_types[num_types]; | |
676 | ||
677 | return type; | |
678 | } | |
679 | ||
61051030 | 680 | struct value * |
fba45db2 | 681 | evaluate_subexp_standard (struct type *expect_type, |
aa1ee363 | 682 | struct expression *exp, int *pos, |
fba45db2 | 683 | enum noside noside) |
c906108c SS |
684 | { |
685 | enum exp_opcode op; | |
686 | int tem, tem2, tem3; | |
52f0bd74 | 687 | int pc, pc2 = 0, oldpos; |
61051030 AC |
688 | struct value *arg1 = NULL; |
689 | struct value *arg2 = NULL; | |
690 | struct value *arg3; | |
c906108c SS |
691 | struct type *type; |
692 | int nargs; | |
61051030 | 693 | struct value **argvec; |
c906108c SS |
694 | int code; |
695 | int ix; | |
696 | long mem_offset; | |
c5aa993b | 697 | struct type **arg_types; |
c906108c | 698 | int save_pos1; |
714f19d5 TT |
699 | struct symbol *function = NULL; |
700 | char *function_name = NULL; | |
c906108c | 701 | |
c906108c SS |
702 | pc = (*pos)++; |
703 | op = exp->elts[pc].opcode; | |
704 | ||
705 | switch (op) | |
706 | { | |
707 | case OP_SCOPE: | |
708 | tem = longest_to_int (exp->elts[pc + 2].longconst); | |
709 | (*pos) += 4 + BYTES_TO_EXP_ELEM (tem + 1); | |
0d5de010 DJ |
710 | if (noside == EVAL_SKIP) |
711 | goto nosideret; | |
79c2c32d DC |
712 | arg1 = value_aggregate_elt (exp->elts[pc + 1].type, |
713 | &exp->elts[pc + 3].string, | |
072bba3b | 714 | expect_type, 0, noside); |
c906108c | 715 | if (arg1 == NULL) |
8a3fe4f8 | 716 | error (_("There is no field named %s"), &exp->elts[pc + 3].string); |
c906108c SS |
717 | return arg1; |
718 | ||
719 | case OP_LONG: | |
720 | (*pos) += 3; | |
721 | return value_from_longest (exp->elts[pc + 1].type, | |
722 | exp->elts[pc + 2].longconst); | |
723 | ||
724 | case OP_DOUBLE: | |
725 | (*pos) += 3; | |
726 | return value_from_double (exp->elts[pc + 1].type, | |
727 | exp->elts[pc + 2].doubleconst); | |
728 | ||
27bc4d80 TJB |
729 | case OP_DECFLOAT: |
730 | (*pos) += 3; | |
4ef30785 TJB |
731 | return value_from_decfloat (exp->elts[pc + 1].type, |
732 | exp->elts[pc + 2].decfloatconst); | |
27bc4d80 | 733 | |
7322dca9 | 734 | case OP_ADL_FUNC: |
c906108c SS |
735 | case OP_VAR_VALUE: |
736 | (*pos) += 3; | |
737 | if (noside == EVAL_SKIP) | |
738 | goto nosideret; | |
c906108c | 739 | |
070ad9f0 DB |
740 | /* JYG: We used to just return value_zero of the symbol type |
741 | if we're asked to avoid side effects. Otherwise we return | |
742 | value_of_variable (...). However I'm not sure if | |
743 | value_of_variable () has any side effect. | |
744 | We need a full value object returned here for whatis_exp () | |
745 | to call evaluate_type () and then pass the full value to | |
746 | value_rtti_target_type () if we are dealing with a pointer | |
0963b4bd | 747 | or reference to a base class and print object is on. */ |
c906108c | 748 | |
5e572bb4 DJ |
749 | { |
750 | volatile struct gdb_exception except; | |
751 | struct value *ret = NULL; | |
752 | ||
753 | TRY_CATCH (except, RETURN_MASK_ERROR) | |
754 | { | |
755 | ret = value_of_variable (exp->elts[pc + 2].symbol, | |
756 | exp->elts[pc + 1].block); | |
757 | } | |
758 | ||
759 | if (except.reason < 0) | |
760 | { | |
761 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
3e43a32a MS |
762 | ret = value_zero (SYMBOL_TYPE (exp->elts[pc + 2].symbol), |
763 | not_lval); | |
5e572bb4 DJ |
764 | else |
765 | throw_exception (except); | |
766 | } | |
767 | ||
768 | return ret; | |
769 | } | |
c906108c | 770 | |
36b11add JK |
771 | case OP_VAR_ENTRY_VALUE: |
772 | (*pos) += 2; | |
773 | if (noside == EVAL_SKIP) | |
774 | goto nosideret; | |
775 | ||
776 | { | |
777 | struct symbol *sym = exp->elts[pc + 1].symbol; | |
778 | struct frame_info *frame; | |
779 | ||
780 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
781 | return value_zero (SYMBOL_TYPE (sym), not_lval); | |
782 | ||
24d6c2a0 | 783 | if (SYMBOL_COMPUTED_OPS (sym) == NULL |
36b11add JK |
784 | || SYMBOL_COMPUTED_OPS (sym)->read_variable_at_entry == NULL) |
785 | error (_("Symbol \"%s\" does not have any specific entry value"), | |
786 | SYMBOL_PRINT_NAME (sym)); | |
787 | ||
788 | frame = get_selected_frame (NULL); | |
789 | return SYMBOL_COMPUTED_OPS (sym)->read_variable_at_entry (sym, frame); | |
790 | } | |
791 | ||
c906108c SS |
792 | case OP_LAST: |
793 | (*pos) += 2; | |
794 | return | |
795 | access_value_history (longest_to_int (exp->elts[pc + 1].longconst)); | |
796 | ||
797 | case OP_REGISTER: | |
798 | { | |
67f3407f DJ |
799 | const char *name = &exp->elts[pc + 2].string; |
800 | int regno; | |
123dc839 | 801 | struct value *val; |
67f3407f DJ |
802 | |
803 | (*pos) += 3 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
d80b854b | 804 | regno = user_reg_map_name_to_regnum (exp->gdbarch, |
029a67e4 | 805 | name, strlen (name)); |
67f3407f DJ |
806 | if (regno == -1) |
807 | error (_("Register $%s not available."), name); | |
80f064a2 JB |
808 | |
809 | /* In EVAL_AVOID_SIDE_EFFECTS mode, we only need to return | |
810 | a value with the appropriate register type. Unfortunately, | |
811 | we don't have easy access to the type of user registers. | |
812 | So for these registers, we fetch the register value regardless | |
813 | of the evaluation mode. */ | |
814 | if (noside == EVAL_AVOID_SIDE_EFFECTS | |
d80b854b UW |
815 | && regno < gdbarch_num_regs (exp->gdbarch) |
816 | + gdbarch_num_pseudo_regs (exp->gdbarch)) | |
817 | val = value_zero (register_type (exp->gdbarch, regno), not_lval); | |
123dc839 DJ |
818 | else |
819 | val = value_of_register (regno, get_selected_frame (NULL)); | |
c906108c | 820 | if (val == NULL) |
67f3407f | 821 | error (_("Value of register %s not available."), name); |
c906108c SS |
822 | else |
823 | return val; | |
824 | } | |
825 | case OP_BOOL: | |
826 | (*pos) += 2; | |
fbb06eb1 UW |
827 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
828 | return value_from_longest (type, exp->elts[pc + 1].longconst); | |
c906108c SS |
829 | |
830 | case OP_INTERNALVAR: | |
831 | (*pos) += 2; | |
78267919 UW |
832 | return value_of_internalvar (exp->gdbarch, |
833 | exp->elts[pc + 1].internalvar); | |
c906108c SS |
834 | |
835 | case OP_STRING: | |
836 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
837 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
838 | if (noside == EVAL_SKIP) | |
839 | goto nosideret; | |
3b7538c0 UW |
840 | type = language_string_char_type (exp->language_defn, exp->gdbarch); |
841 | return value_string (&exp->elts[pc + 2].string, tem, type); | |
c906108c | 842 | |
3e43a32a MS |
843 | case OP_OBJC_NSSTRING: /* Objective C Foundation Class |
844 | NSString constant. */ | |
a9fa03de AF |
845 | tem = longest_to_int (exp->elts[pc + 1].longconst); |
846 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
847 | if (noside == EVAL_SKIP) | |
848 | { | |
849 | goto nosideret; | |
850 | } | |
3b7538c0 | 851 | return value_nsstring (exp->gdbarch, &exp->elts[pc + 2].string, tem + 1); |
a9fa03de | 852 | |
c906108c SS |
853 | case OP_ARRAY: |
854 | (*pos) += 3; | |
855 | tem2 = longest_to_int (exp->elts[pc + 1].longconst); | |
856 | tem3 = longest_to_int (exp->elts[pc + 2].longconst); | |
857 | nargs = tem3 - tem2 + 1; | |
858 | type = expect_type ? check_typedef (expect_type) : NULL_TYPE; | |
859 | ||
860 | if (expect_type != NULL_TYPE && noside != EVAL_SKIP | |
861 | && TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
862 | { | |
61051030 | 863 | struct value *rec = allocate_value (expect_type); |
d7f9d729 | 864 | |
990a07ab | 865 | memset (value_contents_raw (rec), '\0', TYPE_LENGTH (type)); |
c906108c SS |
866 | return evaluate_struct_tuple (rec, exp, pos, noside, nargs); |
867 | } | |
868 | ||
869 | if (expect_type != NULL_TYPE && noside != EVAL_SKIP | |
870 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
871 | { | |
262452ec | 872 | struct type *range_type = TYPE_INDEX_TYPE (type); |
c906108c | 873 | struct type *element_type = TYPE_TARGET_TYPE (type); |
61051030 | 874 | struct value *array = allocate_value (expect_type); |
c906108c SS |
875 | int element_size = TYPE_LENGTH (check_typedef (element_type)); |
876 | LONGEST low_bound, high_bound, index; | |
d7f9d729 | 877 | |
c906108c SS |
878 | if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0) |
879 | { | |
880 | low_bound = 0; | |
881 | high_bound = (TYPE_LENGTH (type) / element_size) - 1; | |
882 | } | |
883 | index = low_bound; | |
990a07ab | 884 | memset (value_contents_raw (array), 0, TYPE_LENGTH (expect_type)); |
c5aa993b | 885 | for (tem = nargs; --nargs >= 0;) |
c906108c | 886 | { |
61051030 | 887 | struct value *element; |
c906108c | 888 | int index_pc = 0; |
d7f9d729 | 889 | |
c906108c | 890 | element = evaluate_subexp (element_type, exp, pos, noside); |
df407dfe | 891 | if (value_type (element) != element_type) |
c906108c SS |
892 | element = value_cast (element_type, element); |
893 | if (index_pc) | |
894 | { | |
895 | int continue_pc = *pos; | |
d7f9d729 | 896 | |
c906108c SS |
897 | *pos = index_pc; |
898 | index = init_array_element (array, element, exp, pos, noside, | |
899 | low_bound, high_bound); | |
900 | *pos = continue_pc; | |
901 | } | |
902 | else | |
903 | { | |
904 | if (index > high_bound) | |
0963b4bd | 905 | /* To avoid memory corruption. */ |
8a3fe4f8 | 906 | error (_("Too many array elements")); |
990a07ab | 907 | memcpy (value_contents_raw (array) |
c906108c | 908 | + (index - low_bound) * element_size, |
0fd88904 | 909 | value_contents (element), |
c906108c SS |
910 | element_size); |
911 | } | |
912 | index++; | |
913 | } | |
914 | return array; | |
915 | } | |
916 | ||
917 | if (expect_type != NULL_TYPE && noside != EVAL_SKIP | |
918 | && TYPE_CODE (type) == TYPE_CODE_SET) | |
919 | { | |
61051030 | 920 | struct value *set = allocate_value (expect_type); |
47b667de | 921 | gdb_byte *valaddr = value_contents_raw (set); |
c906108c SS |
922 | struct type *element_type = TYPE_INDEX_TYPE (type); |
923 | struct type *check_type = element_type; | |
924 | LONGEST low_bound, high_bound; | |
925 | ||
0963b4bd | 926 | /* Get targettype of elementtype. */ |
905e0470 PM |
927 | while (TYPE_CODE (check_type) == TYPE_CODE_RANGE |
928 | || TYPE_CODE (check_type) == TYPE_CODE_TYPEDEF) | |
c906108c SS |
929 | check_type = TYPE_TARGET_TYPE (check_type); |
930 | ||
931 | if (get_discrete_bounds (element_type, &low_bound, &high_bound) < 0) | |
8a3fe4f8 | 932 | error (_("(power)set type with unknown size")); |
c906108c SS |
933 | memset (valaddr, '\0', TYPE_LENGTH (type)); |
934 | for (tem = 0; tem < nargs; tem++) | |
935 | { | |
936 | LONGEST range_low, range_high; | |
937 | struct type *range_low_type, *range_high_type; | |
61051030 | 938 | struct value *elem_val; |
d7f9d729 | 939 | |
ae8fddda YQ |
940 | elem_val = evaluate_subexp (element_type, exp, pos, noside); |
941 | range_low_type = range_high_type = value_type (elem_val); | |
942 | range_low = range_high = value_as_long (elem_val); | |
943 | ||
0963b4bd | 944 | /* Check types of elements to avoid mixture of elements from |
c5aa993b | 945 | different types. Also check if type of element is "compatible" |
0963b4bd | 946 | with element type of powerset. */ |
c906108c SS |
947 | if (TYPE_CODE (range_low_type) == TYPE_CODE_RANGE) |
948 | range_low_type = TYPE_TARGET_TYPE (range_low_type); | |
949 | if (TYPE_CODE (range_high_type) == TYPE_CODE_RANGE) | |
950 | range_high_type = TYPE_TARGET_TYPE (range_high_type); | |
905e0470 PM |
951 | if ((TYPE_CODE (range_low_type) != TYPE_CODE (range_high_type)) |
952 | || (TYPE_CODE (range_low_type) == TYPE_CODE_ENUM | |
953 | && (range_low_type != range_high_type))) | |
0963b4bd | 954 | /* different element modes. */ |
8a3fe4f8 | 955 | error (_("POWERSET tuple elements of different mode")); |
905e0470 PM |
956 | if ((TYPE_CODE (check_type) != TYPE_CODE (range_low_type)) |
957 | || (TYPE_CODE (check_type) == TYPE_CODE_ENUM | |
958 | && range_low_type != check_type)) | |
8a3fe4f8 | 959 | error (_("incompatible POWERSET tuple elements")); |
c906108c SS |
960 | if (range_low > range_high) |
961 | { | |
8a3fe4f8 | 962 | warning (_("empty POWERSET tuple range")); |
c906108c SS |
963 | continue; |
964 | } | |
965 | if (range_low < low_bound || range_high > high_bound) | |
8a3fe4f8 | 966 | error (_("POWERSET tuple element out of range")); |
c906108c SS |
967 | range_low -= low_bound; |
968 | range_high -= low_bound; | |
c5aa993b | 969 | for (; range_low <= range_high; range_low++) |
c906108c SS |
970 | { |
971 | int bit_index = (unsigned) range_low % TARGET_CHAR_BIT; | |
d7f9d729 | 972 | |
34e13b5b | 973 | if (gdbarch_bits_big_endian (exp->gdbarch)) |
c906108c | 974 | bit_index = TARGET_CHAR_BIT - 1 - bit_index; |
c5aa993b | 975 | valaddr[(unsigned) range_low / TARGET_CHAR_BIT] |
c906108c SS |
976 | |= 1 << bit_index; |
977 | } | |
978 | } | |
979 | return set; | |
980 | } | |
981 | ||
f976f6d4 | 982 | argvec = (struct value **) alloca (sizeof (struct value *) * nargs); |
c906108c SS |
983 | for (tem = 0; tem < nargs; tem++) |
984 | { | |
0963b4bd MS |
985 | /* Ensure that array expressions are coerced into pointer |
986 | objects. */ | |
c906108c SS |
987 | argvec[tem] = evaluate_subexp_with_coercion (exp, pos, noside); |
988 | } | |
989 | if (noside == EVAL_SKIP) | |
990 | goto nosideret; | |
991 | return value_array (tem2, tem3, argvec); | |
992 | ||
993 | case TERNOP_SLICE: | |
994 | { | |
61051030 | 995 | struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
c906108c | 996 | int lowbound |
d7f9d729 | 997 | = value_as_long (evaluate_subexp (NULL_TYPE, exp, pos, noside)); |
c906108c | 998 | int upper |
d7f9d729 MS |
999 | = value_as_long (evaluate_subexp (NULL_TYPE, exp, pos, noside)); |
1000 | ||
c906108c SS |
1001 | if (noside == EVAL_SKIP) |
1002 | goto nosideret; | |
1003 | return value_slice (array, lowbound, upper - lowbound + 1); | |
1004 | } | |
1005 | ||
c906108c SS |
1006 | case TERNOP_COND: |
1007 | /* Skip third and second args to evaluate the first one. */ | |
1008 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1009 | if (value_logical_not (arg1)) | |
1010 | { | |
1011 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
1012 | return evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1013 | } | |
1014 | else | |
1015 | { | |
1016 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1017 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
1018 | return arg2; | |
1019 | } | |
1020 | ||
a9fa03de AF |
1021 | case OP_OBJC_SELECTOR: |
1022 | { /* Objective C @selector operator. */ | |
1023 | char *sel = &exp->elts[pc + 2].string; | |
1024 | int len = longest_to_int (exp->elts[pc + 1].longconst); | |
d4dbb9c7 | 1025 | struct type *selector_type; |
a9fa03de AF |
1026 | |
1027 | (*pos) += 3 + BYTES_TO_EXP_ELEM (len + 1); | |
1028 | if (noside == EVAL_SKIP) | |
1029 | goto nosideret; | |
1030 | ||
1031 | if (sel[len] != 0) | |
1032 | sel[len] = 0; /* Make sure it's terminated. */ | |
d4dbb9c7 UW |
1033 | |
1034 | selector_type = builtin_type (exp->gdbarch)->builtin_data_ptr; | |
3b7538c0 UW |
1035 | return value_from_longest (selector_type, |
1036 | lookup_child_selector (exp->gdbarch, sel)); | |
a9fa03de AF |
1037 | } |
1038 | ||
1039 | case OP_OBJC_MSGCALL: | |
1040 | { /* Objective C message (method) call. */ | |
1041 | ||
17dd65ce TT |
1042 | CORE_ADDR responds_selector = 0; |
1043 | CORE_ADDR method_selector = 0; | |
a9fa03de | 1044 | |
c253954e | 1045 | CORE_ADDR selector = 0; |
a9fa03de | 1046 | |
a9fa03de AF |
1047 | int struct_return = 0; |
1048 | int sub_no_side = 0; | |
1049 | ||
17dd65ce TT |
1050 | struct value *msg_send = NULL; |
1051 | struct value *msg_send_stret = NULL; | |
1052 | int gnu_runtime = 0; | |
a9fa03de AF |
1053 | |
1054 | struct value *target = NULL; | |
1055 | struct value *method = NULL; | |
1056 | struct value *called_method = NULL; | |
1057 | ||
1058 | struct type *selector_type = NULL; | |
d4dbb9c7 | 1059 | struct type *long_type; |
a9fa03de AF |
1060 | |
1061 | struct value *ret = NULL; | |
1062 | CORE_ADDR addr = 0; | |
1063 | ||
1064 | selector = exp->elts[pc + 1].longconst; | |
1065 | nargs = exp->elts[pc + 2].longconst; | |
1066 | argvec = (struct value **) alloca (sizeof (struct value *) | |
1067 | * (nargs + 5)); | |
1068 | ||
1069 | (*pos) += 3; | |
1070 | ||
d4dbb9c7 UW |
1071 | long_type = builtin_type (exp->gdbarch)->builtin_long; |
1072 | selector_type = builtin_type (exp->gdbarch)->builtin_data_ptr; | |
1073 | ||
a9fa03de AF |
1074 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
1075 | sub_no_side = EVAL_NORMAL; | |
1076 | else | |
1077 | sub_no_side = noside; | |
1078 | ||
1079 | target = evaluate_subexp (selector_type, exp, pos, sub_no_side); | |
1080 | ||
1081 | if (value_as_long (target) == 0) | |
d4dbb9c7 | 1082 | return value_from_longest (long_type, 0); |
a9fa03de | 1083 | |
3b7344d5 | 1084 | if (lookup_minimal_symbol ("objc_msg_lookup", 0, 0).minsym) |
a9fa03de AF |
1085 | gnu_runtime = 1; |
1086 | ||
1087 | /* Find the method dispatch (Apple runtime) or method lookup | |
1088 | (GNU runtime) function for Objective-C. These will be used | |
1089 | to lookup the symbol information for the method. If we | |
1090 | can't find any symbol information, then we'll use these to | |
1091 | call the method, otherwise we can call the method | |
0963b4bd | 1092 | directly. The msg_send_stret function is used in the special |
a9fa03de AF |
1093 | case of a method that returns a structure (Apple runtime |
1094 | only). */ | |
1095 | if (gnu_runtime) | |
1096 | { | |
d4dbb9c7 | 1097 | struct type *type = selector_type; |
d7f9d729 | 1098 | |
c253954e JB |
1099 | type = lookup_function_type (type); |
1100 | type = lookup_pointer_type (type); | |
1101 | type = lookup_function_type (type); | |
1102 | type = lookup_pointer_type (type); | |
1103 | ||
3e3b026f UW |
1104 | msg_send = find_function_in_inferior ("objc_msg_lookup", NULL); |
1105 | msg_send_stret | |
1106 | = find_function_in_inferior ("objc_msg_lookup", NULL); | |
c253954e JB |
1107 | |
1108 | msg_send = value_from_pointer (type, value_as_address (msg_send)); | |
1109 | msg_send_stret = value_from_pointer (type, | |
1110 | value_as_address (msg_send_stret)); | |
a9fa03de AF |
1111 | } |
1112 | else | |
1113 | { | |
3e3b026f | 1114 | msg_send = find_function_in_inferior ("objc_msgSend", NULL); |
0963b4bd | 1115 | /* Special dispatcher for methods returning structs. */ |
3e3b026f UW |
1116 | msg_send_stret |
1117 | = find_function_in_inferior ("objc_msgSend_stret", NULL); | |
a9fa03de AF |
1118 | } |
1119 | ||
0963b4bd | 1120 | /* Verify the target object responds to this method. The |
a9fa03de AF |
1121 | standard top-level 'Object' class uses a different name for |
1122 | the verification method than the non-standard, but more | |
0963b4bd | 1123 | often used, 'NSObject' class. Make sure we check for both. */ |
a9fa03de | 1124 | |
3b7538c0 UW |
1125 | responds_selector |
1126 | = lookup_child_selector (exp->gdbarch, "respondsToSelector:"); | |
a9fa03de | 1127 | if (responds_selector == 0) |
3b7538c0 UW |
1128 | responds_selector |
1129 | = lookup_child_selector (exp->gdbarch, "respondsTo:"); | |
a9fa03de AF |
1130 | |
1131 | if (responds_selector == 0) | |
8a3fe4f8 | 1132 | error (_("no 'respondsTo:' or 'respondsToSelector:' method")); |
a9fa03de | 1133 | |
3b7538c0 UW |
1134 | method_selector |
1135 | = lookup_child_selector (exp->gdbarch, "methodForSelector:"); | |
a9fa03de | 1136 | if (method_selector == 0) |
3b7538c0 UW |
1137 | method_selector |
1138 | = lookup_child_selector (exp->gdbarch, "methodFor:"); | |
a9fa03de AF |
1139 | |
1140 | if (method_selector == 0) | |
8a3fe4f8 | 1141 | error (_("no 'methodFor:' or 'methodForSelector:' method")); |
a9fa03de AF |
1142 | |
1143 | /* Call the verification method, to make sure that the target | |
0963b4bd | 1144 | class implements the desired method. */ |
a9fa03de AF |
1145 | |
1146 | argvec[0] = msg_send; | |
1147 | argvec[1] = target; | |
d4dbb9c7 UW |
1148 | argvec[2] = value_from_longest (long_type, responds_selector); |
1149 | argvec[3] = value_from_longest (long_type, selector); | |
a9fa03de AF |
1150 | argvec[4] = 0; |
1151 | ||
1152 | ret = call_function_by_hand (argvec[0], 3, argvec + 1); | |
1153 | if (gnu_runtime) | |
1154 | { | |
1155 | /* Function objc_msg_lookup returns a pointer. */ | |
1156 | argvec[0] = ret; | |
1157 | ret = call_function_by_hand (argvec[0], 3, argvec + 1); | |
1158 | } | |
1159 | if (value_as_long (ret) == 0) | |
8a3fe4f8 | 1160 | error (_("Target does not respond to this message selector.")); |
a9fa03de AF |
1161 | |
1162 | /* Call "methodForSelector:" method, to get the address of a | |
1163 | function method that implements this selector for this | |
1164 | class. If we can find a symbol at that address, then we | |
1165 | know the return type, parameter types etc. (that's a good | |
0963b4bd | 1166 | thing). */ |
a9fa03de AF |
1167 | |
1168 | argvec[0] = msg_send; | |
1169 | argvec[1] = target; | |
d4dbb9c7 UW |
1170 | argvec[2] = value_from_longest (long_type, method_selector); |
1171 | argvec[3] = value_from_longest (long_type, selector); | |
a9fa03de AF |
1172 | argvec[4] = 0; |
1173 | ||
1174 | ret = call_function_by_hand (argvec[0], 3, argvec + 1); | |
1175 | if (gnu_runtime) | |
1176 | { | |
1177 | argvec[0] = ret; | |
1178 | ret = call_function_by_hand (argvec[0], 3, argvec + 1); | |
1179 | } | |
1180 | ||
1181 | /* ret should now be the selector. */ | |
1182 | ||
1183 | addr = value_as_long (ret); | |
1184 | if (addr) | |
1185 | { | |
1186 | struct symbol *sym = NULL; | |
a9fa03de | 1187 | |
69368a60 UW |
1188 | /* The address might point to a function descriptor; |
1189 | resolve it to the actual code address instead. */ | |
1190 | addr = gdbarch_convert_from_func_ptr_addr (exp->gdbarch, addr, | |
1191 | ¤t_target); | |
1192 | ||
1193 | /* Is it a high_level symbol? */ | |
a9fa03de AF |
1194 | sym = find_pc_function (addr); |
1195 | if (sym != NULL) | |
1196 | method = value_of_variable (sym, 0); | |
1197 | } | |
1198 | ||
1199 | /* If we found a method with symbol information, check to see | |
1200 | if it returns a struct. Otherwise assume it doesn't. */ | |
1201 | ||
1202 | if (method) | |
1203 | { | |
a9fa03de | 1204 | CORE_ADDR funaddr; |
c055b101 | 1205 | struct type *val_type; |
a9fa03de | 1206 | |
c055b101 | 1207 | funaddr = find_function_addr (method, &val_type); |
a9fa03de | 1208 | |
262acaeb | 1209 | block_for_pc (funaddr); |
a9fa03de | 1210 | |
c055b101 | 1211 | CHECK_TYPEDEF (val_type); |
a9fa03de | 1212 | |
c055b101 CV |
1213 | if ((val_type == NULL) |
1214 | || (TYPE_CODE(val_type) == TYPE_CODE_ERROR)) | |
a9fa03de AF |
1215 | { |
1216 | if (expect_type != NULL) | |
c055b101 | 1217 | val_type = expect_type; |
a9fa03de AF |
1218 | } |
1219 | ||
6a3a010b | 1220 | struct_return = using_struct_return (exp->gdbarch, method, |
3e43a32a | 1221 | val_type); |
a9fa03de AF |
1222 | } |
1223 | else if (expect_type != NULL) | |
1224 | { | |
d80b854b | 1225 | struct_return = using_struct_return (exp->gdbarch, NULL, |
c055b101 | 1226 | check_typedef (expect_type)); |
a9fa03de AF |
1227 | } |
1228 | ||
1229 | /* Found a function symbol. Now we will substitute its | |
1230 | value in place of the message dispatcher (obj_msgSend), | |
1231 | so that we call the method directly instead of thru | |
1232 | the dispatcher. The main reason for doing this is that | |
1233 | we can now evaluate the return value and parameter values | |
1234 | according to their known data types, in case we need to | |
1235 | do things like promotion, dereferencing, special handling | |
1236 | of structs and doubles, etc. | |
1237 | ||
1238 | We want to use the type signature of 'method', but still | |
1239 | jump to objc_msgSend() or objc_msgSend_stret() to better | |
1240 | mimic the behavior of the runtime. */ | |
1241 | ||
1242 | if (method) | |
1243 | { | |
df407dfe | 1244 | if (TYPE_CODE (value_type (method)) != TYPE_CODE_FUNC) |
3e43a32a MS |
1245 | error (_("method address has symbol information " |
1246 | "with non-function type; skipping")); | |
1247 | ||
1248 | /* Create a function pointer of the appropriate type, and | |
1249 | replace its value with the value of msg_send or | |
1250 | msg_send_stret. We must use a pointer here, as | |
1251 | msg_send and msg_send_stret are of pointer type, and | |
1252 | the representation may be different on systems that use | |
69368a60 | 1253 | function descriptors. */ |
a9fa03de | 1254 | if (struct_return) |
69368a60 UW |
1255 | called_method |
1256 | = value_from_pointer (lookup_pointer_type (value_type (method)), | |
1257 | value_as_address (msg_send_stret)); | |
a9fa03de | 1258 | else |
69368a60 UW |
1259 | called_method |
1260 | = value_from_pointer (lookup_pointer_type (value_type (method)), | |
1261 | value_as_address (msg_send)); | |
a9fa03de AF |
1262 | } |
1263 | else | |
1264 | { | |
1265 | if (struct_return) | |
1266 | called_method = msg_send_stret; | |
1267 | else | |
1268 | called_method = msg_send; | |
1269 | } | |
1270 | ||
1271 | if (noside == EVAL_SKIP) | |
1272 | goto nosideret; | |
1273 | ||
1274 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
1275 | { | |
1276 | /* If the return type doesn't look like a function type, | |
1277 | call an error. This can happen if somebody tries to | |
0963b4bd | 1278 | turn a variable into a function call. This is here |
a9fa03de AF |
1279 | because people often want to call, eg, strcmp, which |
1280 | gdb doesn't know is a function. If gdb isn't asked for | |
1281 | it's opinion (ie. through "whatis"), it won't offer | |
0963b4bd | 1282 | it. */ |
a9fa03de | 1283 | |
df407dfe | 1284 | struct type *type = value_type (called_method); |
d7f9d729 | 1285 | |
a9fa03de AF |
1286 | if (type && TYPE_CODE (type) == TYPE_CODE_PTR) |
1287 | type = TYPE_TARGET_TYPE (type); | |
1288 | type = TYPE_TARGET_TYPE (type); | |
1289 | ||
1290 | if (type) | |
1291 | { | |
1292 | if ((TYPE_CODE (type) == TYPE_CODE_ERROR) && expect_type) | |
1293 | return allocate_value (expect_type); | |
1294 | else | |
1295 | return allocate_value (type); | |
1296 | } | |
1297 | else | |
3e43a32a MS |
1298 | error (_("Expression of type other than " |
1299 | "\"method returning ...\" used as a method")); | |
a9fa03de AF |
1300 | } |
1301 | ||
1302 | /* Now depending on whether we found a symbol for the method, | |
1303 | we will either call the runtime dispatcher or the method | |
1304 | directly. */ | |
1305 | ||
1306 | argvec[0] = called_method; | |
1307 | argvec[1] = target; | |
d4dbb9c7 | 1308 | argvec[2] = value_from_longest (long_type, selector); |
a9fa03de AF |
1309 | /* User-supplied arguments. */ |
1310 | for (tem = 0; tem < nargs; tem++) | |
1311 | argvec[tem + 3] = evaluate_subexp_with_coercion (exp, pos, noside); | |
1312 | argvec[tem + 3] = 0; | |
1313 | ||
1314 | if (gnu_runtime && (method != NULL)) | |
1315 | { | |
a9fa03de | 1316 | /* Function objc_msg_lookup returns a pointer. */ |
04624583 | 1317 | deprecated_set_value_type (argvec[0], |
69368a60 | 1318 | lookup_pointer_type (lookup_function_type (value_type (argvec[0])))); |
3e43a32a MS |
1319 | argvec[0] |
1320 | = call_function_by_hand (argvec[0], nargs + 2, argvec + 1); | |
a9fa03de | 1321 | } |
a9fa03de | 1322 | |
c253954e | 1323 | ret = call_function_by_hand (argvec[0], nargs + 2, argvec + 1); |
a9fa03de AF |
1324 | return ret; |
1325 | } | |
1326 | break; | |
1327 | ||
c906108c SS |
1328 | case OP_FUNCALL: |
1329 | (*pos) += 2; | |
1330 | op = exp->elts[*pos].opcode; | |
1331 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
1332 | /* Allocate arg vector, including space for the function to be | |
cd8ae15e | 1333 | called in argvec[0], a potential `this', and a terminating NULL. */ |
3e43a32a MS |
1334 | argvec = (struct value **) |
1335 | alloca (sizeof (struct value *) * (nargs + 3)); | |
c906108c SS |
1336 | if (op == STRUCTOP_MEMBER || op == STRUCTOP_MPTR) |
1337 | { | |
0963b4bd | 1338 | /* First, evaluate the structure into arg2. */ |
c906108c SS |
1339 | pc2 = (*pos)++; |
1340 | ||
1341 | if (noside == EVAL_SKIP) | |
1342 | goto nosideret; | |
1343 | ||
1344 | if (op == STRUCTOP_MEMBER) | |
1345 | { | |
1346 | arg2 = evaluate_subexp_for_address (exp, pos, noside); | |
1347 | } | |
1348 | else | |
1349 | { | |
1350 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1351 | } | |
1352 | ||
1353 | /* If the function is a virtual function, then the | |
1354 | aggregate value (providing the structure) plays | |
1355 | its part by providing the vtable. Otherwise, | |
1356 | it is just along for the ride: call the function | |
1357 | directly. */ | |
1358 | ||
1359 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1360 | ||
5edf51fe YQ |
1361 | type = check_typedef (value_type (arg1)); |
1362 | if (TYPE_CODE (type) == TYPE_CODE_METHODPTR) | |
1363 | { | |
1364 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
1365 | arg1 = value_zero (TYPE_TARGET_TYPE (type), not_lval); | |
1366 | else | |
1367 | arg1 = cplus_method_ptr_to_value (&arg2, arg1); | |
c906108c | 1368 | |
5edf51fe YQ |
1369 | /* Now, say which argument to start evaluating from. */ |
1370 | nargs++; | |
1371 | tem = 2; | |
1372 | argvec[1] = arg2; | |
1373 | } | |
1374 | else if (TYPE_CODE (type) == TYPE_CODE_MEMBERPTR) | |
c906108c | 1375 | { |
5edf51fe YQ |
1376 | struct type *type_ptr |
1377 | = lookup_pointer_type (TYPE_DOMAIN_TYPE (type)); | |
f5682501 YQ |
1378 | struct type *target_type_ptr |
1379 | = lookup_pointer_type (TYPE_TARGET_TYPE (type)); | |
5edf51fe YQ |
1380 | |
1381 | /* Now, convert these values to an address. */ | |
1382 | arg2 = value_cast (type_ptr, arg2); | |
d7f9d729 | 1383 | |
5edf51fe YQ |
1384 | mem_offset = value_as_long (arg1); |
1385 | ||
f5682501 | 1386 | arg1 = value_from_pointer (target_type_ptr, |
5edf51fe YQ |
1387 | value_as_long (arg2) + mem_offset); |
1388 | arg1 = value_ind (arg1); | |
1389 | tem = 1; | |
c906108c SS |
1390 | } |
1391 | else | |
5edf51fe YQ |
1392 | error (_("Non-pointer-to-member value used in pointer-to-member " |
1393 | "construct")); | |
c906108c SS |
1394 | } |
1395 | else if (op == STRUCTOP_STRUCT || op == STRUCTOP_PTR) | |
1396 | { | |
0963b4bd | 1397 | /* Hair for method invocations. */ |
c906108c SS |
1398 | int tem2; |
1399 | ||
1400 | nargs++; | |
0963b4bd | 1401 | /* First, evaluate the structure into arg2. */ |
c906108c SS |
1402 | pc2 = (*pos)++; |
1403 | tem2 = longest_to_int (exp->elts[pc2 + 1].longconst); | |
1404 | *pos += 3 + BYTES_TO_EXP_ELEM (tem2 + 1); | |
1405 | if (noside == EVAL_SKIP) | |
1406 | goto nosideret; | |
1407 | ||
1408 | if (op == STRUCTOP_STRUCT) | |
1409 | { | |
1410 | /* If v is a variable in a register, and the user types | |
c5aa993b JM |
1411 | v.method (), this will produce an error, because v has |
1412 | no address. | |
1413 | ||
1414 | A possible way around this would be to allocate a | |
1415 | copy of the variable on the stack, copy in the | |
1416 | contents, call the function, and copy out the | |
1417 | contents. I.e. convert this from call by reference | |
1418 | to call by copy-return (or whatever it's called). | |
1419 | However, this does not work because it is not the | |
1420 | same: the method being called could stash a copy of | |
1421 | the address, and then future uses through that address | |
1422 | (after the method returns) would be expected to | |
1423 | use the variable itself, not some copy of it. */ | |
c906108c SS |
1424 | arg2 = evaluate_subexp_for_address (exp, pos, noside); |
1425 | } | |
1426 | else | |
1427 | { | |
1428 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
79afc5ef | 1429 | |
3e43a32a MS |
1430 | /* Check to see if the operator '->' has been |
1431 | overloaded. If the operator has been overloaded | |
1432 | replace arg2 with the value returned by the custom | |
79afc5ef SW |
1433 | operator and continue evaluation. */ |
1434 | while (unop_user_defined_p (op, arg2)) | |
1435 | { | |
1436 | volatile struct gdb_exception except; | |
1437 | struct value *value = NULL; | |
1438 | TRY_CATCH (except, RETURN_MASK_ERROR) | |
1439 | { | |
1440 | value = value_x_unop (arg2, op, noside); | |
1441 | } | |
1442 | ||
1443 | if (except.reason < 0) | |
1444 | { | |
1445 | if (except.error == NOT_FOUND_ERROR) | |
1446 | break; | |
1447 | else | |
1448 | throw_exception (except); | |
1449 | } | |
1450 | arg2 = value; | |
1451 | } | |
c906108c | 1452 | } |
0963b4bd | 1453 | /* Now, say which argument to start evaluating from. */ |
c906108c SS |
1454 | tem = 2; |
1455 | } | |
714f19d5 TT |
1456 | else if (op == OP_SCOPE |
1457 | && overload_resolution | |
1458 | && (exp->language_defn->la_language == language_cplus)) | |
1459 | { | |
1460 | /* Unpack it locally so we can properly handle overload | |
1461 | resolution. */ | |
714f19d5 TT |
1462 | char *name; |
1463 | int local_tem; | |
1464 | ||
1465 | pc2 = (*pos)++; | |
1466 | local_tem = longest_to_int (exp->elts[pc2 + 2].longconst); | |
1467 | (*pos) += 4 + BYTES_TO_EXP_ELEM (local_tem + 1); | |
1468 | type = exp->elts[pc2 + 1].type; | |
1469 | name = &exp->elts[pc2 + 3].string; | |
1470 | ||
1471 | function = NULL; | |
1472 | function_name = NULL; | |
1473 | if (TYPE_CODE (type) == TYPE_CODE_NAMESPACE) | |
1474 | { | |
1475 | function = cp_lookup_symbol_namespace (TYPE_TAG_NAME (type), | |
94af9270 | 1476 | name, |
714f19d5 | 1477 | get_selected_block (0), |
13387711 | 1478 | VAR_DOMAIN); |
714f19d5 TT |
1479 | if (function == NULL) |
1480 | error (_("No symbol \"%s\" in namespace \"%s\"."), | |
1481 | name, TYPE_TAG_NAME (type)); | |
1482 | ||
1483 | tem = 1; | |
cd8ae15e | 1484 | /* arg2 is left as NULL on purpose. */ |
714f19d5 TT |
1485 | } |
1486 | else | |
1487 | { | |
1488 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_STRUCT | |
1489 | || TYPE_CODE (type) == TYPE_CODE_UNION); | |
1490 | function_name = name; | |
1491 | ||
cd8ae15e DE |
1492 | /* We need a properly typed value for method lookup. For |
1493 | static methods arg2 is otherwise unused. */ | |
714f19d5 TT |
1494 | arg2 = value_zero (type, lval_memory); |
1495 | ++nargs; | |
1496 | tem = 2; | |
1497 | } | |
1498 | } | |
7322dca9 SW |
1499 | else if (op == OP_ADL_FUNC) |
1500 | { | |
1501 | /* Save the function position and move pos so that the arguments | |
1502 | can be evaluated. */ | |
1503 | int func_name_len; | |
d7f9d729 | 1504 | |
7322dca9 SW |
1505 | save_pos1 = *pos; |
1506 | tem = 1; | |
1507 | ||
1508 | func_name_len = longest_to_int (exp->elts[save_pos1 + 3].longconst); | |
1509 | (*pos) += 6 + BYTES_TO_EXP_ELEM (func_name_len + 1); | |
1510 | } | |
c906108c SS |
1511 | else |
1512 | { | |
0963b4bd | 1513 | /* Non-method function call. */ |
c906108c | 1514 | save_pos1 = *pos; |
c906108c | 1515 | tem = 1; |
883df6dd SW |
1516 | |
1517 | /* If this is a C++ function wait until overload resolution. */ | |
1518 | if (op == OP_VAR_VALUE | |
1519 | && overload_resolution | |
1520 | && (exp->language_defn->la_language == language_cplus)) | |
c906108c | 1521 | { |
883df6dd SW |
1522 | (*pos) += 4; /* Skip the evaluation of the symbol. */ |
1523 | argvec[0] = NULL; | |
1524 | } | |
1525 | else | |
1526 | { | |
1527 | argvec[0] = evaluate_subexp_with_coercion (exp, pos, noside); | |
1528 | type = value_type (argvec[0]); | |
1529 | if (type && TYPE_CODE (type) == TYPE_CODE_PTR) | |
1530 | type = TYPE_TARGET_TYPE (type); | |
1531 | if (type && TYPE_CODE (type) == TYPE_CODE_FUNC) | |
c906108c | 1532 | { |
883df6dd SW |
1533 | for (; tem <= nargs && tem <= TYPE_NFIELDS (type); tem++) |
1534 | { | |
3e43a32a MS |
1535 | argvec[tem] = evaluate_subexp (TYPE_FIELD_TYPE (type, |
1536 | tem - 1), | |
883df6dd SW |
1537 | exp, pos, noside); |
1538 | } | |
c906108c SS |
1539 | } |
1540 | } | |
1541 | } | |
1542 | ||
cd8ae15e DE |
1543 | /* Evaluate arguments (if not already done, e.g., namespace::func() |
1544 | and overload-resolution is off). */ | |
c906108c SS |
1545 | for (; tem <= nargs; tem++) |
1546 | { | |
0963b4bd MS |
1547 | /* Ensure that array expressions are coerced into pointer |
1548 | objects. */ | |
c906108c SS |
1549 | argvec[tem] = evaluate_subexp_with_coercion (exp, pos, noside); |
1550 | } | |
1551 | ||
0963b4bd | 1552 | /* Signal end of arglist. */ |
c906108c | 1553 | argvec[tem] = 0; |
cd8ae15e | 1554 | |
7322dca9 SW |
1555 | if (op == OP_ADL_FUNC) |
1556 | { | |
1557 | struct symbol *symp; | |
1558 | char *func_name; | |
1559 | int name_len; | |
1560 | int string_pc = save_pos1 + 3; | |
1561 | ||
1562 | /* Extract the function name. */ | |
1563 | name_len = longest_to_int (exp->elts[string_pc].longconst); | |
1564 | func_name = (char *) alloca (name_len + 1); | |
1565 | strcpy (func_name, &exp->elts[string_pc + 1].string); | |
1566 | ||
da096638 | 1567 | find_overload_match (&argvec[1], nargs, func_name, |
3e43a32a | 1568 | NON_METHOD, /* not method */ |
3e43a32a MS |
1569 | NULL, NULL, /* pass NULL symbol since |
1570 | symbol is unknown */ | |
7322dca9 SW |
1571 | NULL, &symp, NULL, 0); |
1572 | ||
1573 | /* Now fix the expression being evaluated. */ | |
1574 | exp->elts[save_pos1 + 2].symbol = symp; | |
1575 | argvec[0] = evaluate_subexp_with_coercion (exp, &save_pos1, noside); | |
1576 | } | |
c906108c | 1577 | |
714f19d5 TT |
1578 | if (op == STRUCTOP_STRUCT || op == STRUCTOP_PTR |
1579 | || (op == OP_SCOPE && function_name != NULL)) | |
c906108c SS |
1580 | { |
1581 | int static_memfuncp; | |
714f19d5 | 1582 | char *tstr; |
c5aa993b | 1583 | |
cd8ae15e DE |
1584 | /* Method invocation: stuff "this" as first parameter. |
1585 | If the method turns out to be static we undo this below. */ | |
9b013045 | 1586 | argvec[1] = arg2; |
714f19d5 TT |
1587 | |
1588 | if (op != OP_SCOPE) | |
1589 | { | |
0963b4bd | 1590 | /* Name of method from expression. */ |
714f19d5 TT |
1591 | tstr = &exp->elts[pc2 + 2].string; |
1592 | } | |
1593 | else | |
1594 | tstr = function_name; | |
c5aa993b | 1595 | |
3e43a32a MS |
1596 | if (overload_resolution && (exp->language_defn->la_language |
1597 | == language_cplus)) | |
c5aa993b | 1598 | { |
3e43a32a | 1599 | /* Language is C++, do some overload resolution before |
0963b4bd | 1600 | evaluation. */ |
61051030 | 1601 | struct value *valp = NULL; |
c5aa993b | 1602 | |
da096638 | 1603 | (void) find_overload_match (&argvec[1], nargs, tstr, |
3e43a32a | 1604 | METHOD, /* method */ |
3e43a32a MS |
1605 | &arg2, /* the object */ |
1606 | NULL, &valp, NULL, | |
1607 | &static_memfuncp, 0); | |
c5aa993b | 1608 | |
714f19d5 TT |
1609 | if (op == OP_SCOPE && !static_memfuncp) |
1610 | { | |
1611 | /* For the time being, we don't handle this. */ | |
1612 | error (_("Call to overloaded function %s requires " | |
1613 | "`this' pointer"), | |
1614 | function_name); | |
1615 | } | |
c5aa993b | 1616 | argvec[1] = arg2; /* the ``this'' pointer */ |
0963b4bd MS |
1617 | argvec[0] = valp; /* Use the method found after overload |
1618 | resolution. */ | |
c5aa993b JM |
1619 | } |
1620 | else | |
0963b4bd | 1621 | /* Non-C++ case -- or no overload resolution. */ |
c5aa993b | 1622 | { |
9b013045 | 1623 | struct value *temp = arg2; |
d7f9d729 | 1624 | |
c5aa993b JM |
1625 | argvec[0] = value_struct_elt (&temp, argvec + 1, tstr, |
1626 | &static_memfuncp, | |
1627 | op == STRUCTOP_STRUCT | |
1628 | ? "structure" : "structure pointer"); | |
9b013045 PS |
1629 | /* value_struct_elt updates temp with the correct value |
1630 | of the ``this'' pointer if necessary, so modify argvec[1] to | |
1631 | reflect any ``this'' changes. */ | |
3e43a32a MS |
1632 | arg2 |
1633 | = value_from_longest (lookup_pointer_type(value_type (temp)), | |
1634 | value_address (temp) | |
1635 | + value_embedded_offset (temp)); | |
c5aa993b JM |
1636 | argvec[1] = arg2; /* the ``this'' pointer */ |
1637 | } | |
c906108c | 1638 | |
cd8ae15e | 1639 | /* Take out `this' if needed. */ |
c906108c SS |
1640 | if (static_memfuncp) |
1641 | { | |
1642 | argvec[1] = argvec[0]; | |
1643 | nargs--; | |
1644 | argvec++; | |
1645 | } | |
1646 | } | |
1647 | else if (op == STRUCTOP_MEMBER || op == STRUCTOP_MPTR) | |
1648 | { | |
5edf51fe | 1649 | /* Pointer to member. argvec[1] is already set up. */ |
c906108c SS |
1650 | argvec[0] = arg1; |
1651 | } | |
714f19d5 | 1652 | else if (op == OP_VAR_VALUE || (op == OP_SCOPE && function != NULL)) |
c5aa993b | 1653 | { |
0963b4bd | 1654 | /* Non-member function being called. */ |
917317f4 JM |
1655 | /* fn: This can only be done for C++ functions. A C-style function |
1656 | in a C++ program, for instance, does not have the fields that | |
0963b4bd | 1657 | are expected here. */ |
c906108c | 1658 | |
3e43a32a MS |
1659 | if (overload_resolution && (exp->language_defn->la_language |
1660 | == language_cplus)) | |
c5aa993b | 1661 | { |
3e43a32a | 1662 | /* Language is C++, do some overload resolution before |
0963b4bd | 1663 | evaluation. */ |
c5aa993b | 1664 | struct symbol *symp; |
7322dca9 SW |
1665 | int no_adl = 0; |
1666 | ||
1667 | /* If a scope has been specified disable ADL. */ | |
1668 | if (op == OP_SCOPE) | |
1669 | no_adl = 1; | |
c5aa993b | 1670 | |
714f19d5 TT |
1671 | if (op == OP_VAR_VALUE) |
1672 | function = exp->elts[save_pos1+2].symbol; | |
1673 | ||
da096638 | 1674 | (void) find_overload_match (&argvec[1], nargs, |
3e43a32a MS |
1675 | NULL, /* no need for name */ |
1676 | NON_METHOD, /* not method */ | |
3e43a32a | 1677 | NULL, function, /* the function */ |
7322dca9 | 1678 | NULL, &symp, NULL, no_adl); |
c5aa993b | 1679 | |
714f19d5 TT |
1680 | if (op == OP_VAR_VALUE) |
1681 | { | |
0963b4bd | 1682 | /* Now fix the expression being evaluated. */ |
714f19d5 TT |
1683 | exp->elts[save_pos1+2].symbol = symp; |
1684 | argvec[0] = evaluate_subexp_with_coercion (exp, &save_pos1, | |
1685 | noside); | |
1686 | } | |
1687 | else | |
1688 | argvec[0] = value_of_variable (symp, get_selected_block (0)); | |
c5aa993b JM |
1689 | } |
1690 | else | |
1691 | { | |
0963b4bd MS |
1692 | /* Not C++, or no overload resolution allowed. */ |
1693 | /* Nothing to be done; argvec already correctly set up. */ | |
c5aa993b JM |
1694 | } |
1695 | } | |
917317f4 JM |
1696 | else |
1697 | { | |
0963b4bd MS |
1698 | /* It is probably a C-style function. */ |
1699 | /* Nothing to be done; argvec already correctly set up. */ | |
917317f4 | 1700 | } |
c906108c SS |
1701 | |
1702 | do_call_it: | |
1703 | ||
1704 | if (noside == EVAL_SKIP) | |
1705 | goto nosideret; | |
0478d61c | 1706 | if (argvec[0] == NULL) |
8a3fe4f8 | 1707 | error (_("Cannot evaluate function -- may be inlined")); |
c906108c SS |
1708 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
1709 | { | |
1710 | /* If the return type doesn't look like a function type, call an | |
1711 | error. This can happen if somebody tries to turn a variable into | |
0963b4bd | 1712 | a function call. This is here because people often want to |
c906108c SS |
1713 | call, eg, strcmp, which gdb doesn't know is a function. If |
1714 | gdb isn't asked for it's opinion (ie. through "whatis"), | |
0963b4bd | 1715 | it won't offer it. */ |
c906108c | 1716 | |
329719ec | 1717 | struct type *ftype = value_type (argvec[0]); |
c906108c | 1718 | |
329719ec TT |
1719 | if (TYPE_CODE (ftype) == TYPE_CODE_INTERNAL_FUNCTION) |
1720 | { | |
1721 | /* We don't know anything about what the internal | |
1722 | function might return, but we have to return | |
1723 | something. */ | |
1724 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
1725 | not_lval); | |
1726 | } | |
0875794a JK |
1727 | else if (TYPE_GNU_IFUNC (ftype)) |
1728 | return allocate_value (TYPE_TARGET_TYPE (TYPE_TARGET_TYPE (ftype))); | |
329719ec TT |
1729 | else if (TYPE_TARGET_TYPE (ftype)) |
1730 | return allocate_value (TYPE_TARGET_TYPE (ftype)); | |
c906108c | 1731 | else |
3e43a32a MS |
1732 | error (_("Expression of type other than " |
1733 | "\"Function returning ...\" used as function")); | |
c906108c | 1734 | } |
233e8b28 SC |
1735 | switch (TYPE_CODE (value_type (argvec[0]))) |
1736 | { | |
1737 | case TYPE_CODE_INTERNAL_FUNCTION: | |
1738 | return call_internal_function (exp->gdbarch, exp->language_defn, | |
1739 | argvec[0], nargs, argvec + 1); | |
1740 | case TYPE_CODE_XMETHOD: | |
1741 | return call_xmethod (argvec[0], nargs, argvec + 1); | |
1742 | default: | |
1743 | return call_function_by_hand (argvec[0], nargs, argvec + 1); | |
1744 | } | |
3e43a32a MS |
1745 | /* pai: FIXME save value from call_function_by_hand, then adjust |
1746 | pc by adjust_fn_pc if +ve. */ | |
c906108c | 1747 | |
c5aa993b | 1748 | case OP_F77_UNDETERMINED_ARGLIST: |
c906108c SS |
1749 | |
1750 | /* Remember that in F77, functions, substring ops and | |
1751 | array subscript operations cannot be disambiguated | |
1752 | at parse time. We have made all array subscript operations, | |
1753 | substring operations as well as function calls come here | |
0963b4bd MS |
1754 | and we now have to discover what the heck this thing actually was. |
1755 | If it is a function, we process just as if we got an OP_FUNCALL. */ | |
c906108c | 1756 | |
c5aa993b | 1757 | nargs = longest_to_int (exp->elts[pc + 1].longconst); |
c906108c SS |
1758 | (*pos) += 2; |
1759 | ||
c5aa993b | 1760 | /* First determine the type code we are dealing with. */ |
c906108c | 1761 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
df407dfe | 1762 | type = check_typedef (value_type (arg1)); |
c906108c SS |
1763 | code = TYPE_CODE (type); |
1764 | ||
df0ca547 WZ |
1765 | if (code == TYPE_CODE_PTR) |
1766 | { | |
1767 | /* Fortran always passes variable to subroutines as pointer. | |
1768 | So we need to look into its target type to see if it is | |
1769 | array, string or function. If it is, we need to switch | |
1770 | to the target value the original one points to. */ | |
1771 | struct type *target_type = check_typedef (TYPE_TARGET_TYPE (type)); | |
1772 | ||
1773 | if (TYPE_CODE (target_type) == TYPE_CODE_ARRAY | |
1774 | || TYPE_CODE (target_type) == TYPE_CODE_STRING | |
1775 | || TYPE_CODE (target_type) == TYPE_CODE_FUNC) | |
1776 | { | |
1777 | arg1 = value_ind (arg1); | |
1778 | type = check_typedef (value_type (arg1)); | |
1779 | code = TYPE_CODE (type); | |
1780 | } | |
1781 | } | |
1782 | ||
c5aa993b | 1783 | switch (code) |
c906108c SS |
1784 | { |
1785 | case TYPE_CODE_ARRAY: | |
0b4e1325 WZ |
1786 | if (exp->elts[*pos].opcode == OP_F90_RANGE) |
1787 | return value_f90_subarray (arg1, exp, pos, noside); | |
1788 | else | |
1789 | goto multi_f77_subscript; | |
c906108c SS |
1790 | |
1791 | case TYPE_CODE_STRING: | |
0b4e1325 WZ |
1792 | if (exp->elts[*pos].opcode == OP_F90_RANGE) |
1793 | return value_f90_subarray (arg1, exp, pos, noside); | |
1794 | else | |
1795 | { | |
1796 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
2497b498 | 1797 | return value_subscript (arg1, value_as_long (arg2)); |
0b4e1325 | 1798 | } |
c906108c SS |
1799 | |
1800 | case TYPE_CODE_PTR: | |
1801 | case TYPE_CODE_FUNC: | |
0963b4bd | 1802 | /* It's a function call. */ |
c906108c | 1803 | /* Allocate arg vector, including space for the function to be |
0963b4bd | 1804 | called in argvec[0] and a terminating NULL. */ |
3e43a32a MS |
1805 | argvec = (struct value **) |
1806 | alloca (sizeof (struct value *) * (nargs + 2)); | |
c906108c SS |
1807 | argvec[0] = arg1; |
1808 | tem = 1; | |
1809 | for (; tem <= nargs; tem++) | |
1810 | argvec[tem] = evaluate_subexp_with_coercion (exp, pos, noside); | |
c5aa993b | 1811 | argvec[tem] = 0; /* signal end of arglist */ |
c906108c SS |
1812 | goto do_call_it; |
1813 | ||
1814 | default: | |
8a3fe4f8 | 1815 | error (_("Cannot perform substring on this type")); |
c906108c SS |
1816 | } |
1817 | ||
c906108c SS |
1818 | case OP_COMPLEX: |
1819 | /* We have a complex number, There should be 2 floating | |
0963b4bd | 1820 | point numbers that compose it. */ |
c806c55a | 1821 | (*pos) += 2; |
c906108c | 1822 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
c5aa993b | 1823 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
c906108c | 1824 | |
c806c55a | 1825 | return value_literal_complex (arg1, arg2, exp->elts[pc + 1].type); |
c906108c SS |
1826 | |
1827 | case STRUCTOP_STRUCT: | |
1828 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
1829 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
1830 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1831 | if (noside == EVAL_SKIP) | |
1832 | goto nosideret; | |
ac1ca910 | 1833 | arg3 = value_struct_elt (&arg1, NULL, &exp->elts[pc + 2].string, |
fce632b6 | 1834 | NULL, "structure"); |
ac1ca910 TT |
1835 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
1836 | arg3 = value_zero (value_type (arg3), not_lval); | |
1837 | return arg3; | |
c906108c SS |
1838 | |
1839 | case STRUCTOP_PTR: | |
1840 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
1841 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
1842 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1843 | if (noside == EVAL_SKIP) | |
1844 | goto nosideret; | |
070ad9f0 | 1845 | |
79afc5ef SW |
1846 | /* Check to see if operator '->' has been overloaded. If so replace |
1847 | arg1 with the value returned by evaluating operator->(). */ | |
1848 | while (unop_user_defined_p (op, arg1)) | |
1849 | { | |
1850 | volatile struct gdb_exception except; | |
1851 | struct value *value = NULL; | |
1852 | TRY_CATCH (except, RETURN_MASK_ERROR) | |
1853 | { | |
1854 | value = value_x_unop (arg1, op, noside); | |
1855 | } | |
1856 | ||
1857 | if (except.reason < 0) | |
1858 | { | |
1859 | if (except.error == NOT_FOUND_ERROR) | |
1860 | break; | |
1861 | else | |
1862 | throw_exception (except); | |
1863 | } | |
1864 | arg1 = value; | |
1865 | } | |
1866 | ||
070ad9f0 DB |
1867 | /* JYG: if print object is on we need to replace the base type |
1868 | with rtti type in order to continue on with successful | |
0963b4bd | 1869 | lookup of member / method only available in the rtti type. */ |
070ad9f0 | 1870 | { |
df407dfe | 1871 | struct type *type = value_type (arg1); |
070ad9f0 DB |
1872 | struct type *real_type; |
1873 | int full, top, using_enc; | |
79a45b7d TT |
1874 | struct value_print_options opts; |
1875 | ||
1876 | get_user_print_options (&opts); | |
905e0470 PM |
1877 | if (opts.objectprint && TYPE_TARGET_TYPE(type) |
1878 | && (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_CLASS)) | |
070ad9f0 | 1879 | { |
dfcee124 AG |
1880 | real_type = value_rtti_indirect_type (arg1, &full, &top, |
1881 | &using_enc); | |
070ad9f0 | 1882 | if (real_type) |
070ad9f0 | 1883 | arg1 = value_cast (real_type, arg1); |
070ad9f0 DB |
1884 | } |
1885 | } | |
1886 | ||
ac1ca910 | 1887 | arg3 = value_struct_elt (&arg1, NULL, &exp->elts[pc + 2].string, |
fce632b6 | 1888 | NULL, "structure pointer"); |
ac1ca910 TT |
1889 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
1890 | arg3 = value_zero (value_type (arg3), not_lval); | |
1891 | return arg3; | |
c906108c SS |
1892 | |
1893 | case STRUCTOP_MEMBER: | |
0d5de010 DJ |
1894 | case STRUCTOP_MPTR: |
1895 | if (op == STRUCTOP_MEMBER) | |
1896 | arg1 = evaluate_subexp_for_address (exp, pos, noside); | |
1897 | else | |
1898 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1899 | ||
c906108c SS |
1900 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
1901 | ||
0d5de010 DJ |
1902 | if (noside == EVAL_SKIP) |
1903 | goto nosideret; | |
c5aa993b | 1904 | |
0d5de010 DJ |
1905 | type = check_typedef (value_type (arg2)); |
1906 | switch (TYPE_CODE (type)) | |
1907 | { | |
1908 | case TYPE_CODE_METHODPTR: | |
0d5de010 DJ |
1909 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
1910 | return value_zero (TYPE_TARGET_TYPE (type), not_lval); | |
1911 | else | |
1912 | { | |
1913 | arg2 = cplus_method_ptr_to_value (&arg1, arg2); | |
1914 | gdb_assert (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR); | |
1915 | return value_ind (arg2); | |
1916 | } | |
c906108c | 1917 | |
0d5de010 DJ |
1918 | case TYPE_CODE_MEMBERPTR: |
1919 | /* Now, convert these values to an address. */ | |
b1af9e97 TT |
1920 | arg1 = value_cast_pointers (lookup_pointer_type (TYPE_DOMAIN_TYPE (type)), |
1921 | arg1, 1); | |
c906108c | 1922 | |
0d5de010 | 1923 | mem_offset = value_as_long (arg2); |
c906108c | 1924 | |
0d5de010 DJ |
1925 | arg3 = value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
1926 | value_as_long (arg1) + mem_offset); | |
1927 | return value_ind (arg3); | |
1928 | ||
1929 | default: | |
3e43a32a MS |
1930 | error (_("non-pointer-to-member value used " |
1931 | "in pointer-to-member construct")); | |
c5aa993b | 1932 | } |
c906108c | 1933 | |
072bba3b KS |
1934 | case TYPE_INSTANCE: |
1935 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
1936 | arg_types = (struct type **) alloca (nargs * sizeof (struct type *)); | |
1937 | for (ix = 0; ix < nargs; ++ix) | |
1938 | arg_types[ix] = exp->elts[pc + 1 + ix + 1].type; | |
1939 | ||
1940 | expect_type = make_params (nargs, arg_types); | |
1941 | *(pos) += 3 + nargs; | |
1942 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
1943 | xfree (TYPE_FIELDS (expect_type)); | |
1944 | xfree (TYPE_MAIN_TYPE (expect_type)); | |
1945 | xfree (expect_type); | |
1946 | return arg1; | |
1947 | ||
c906108c SS |
1948 | case BINOP_CONCAT: |
1949 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
1950 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
1951 | if (noside == EVAL_SKIP) | |
1952 | goto nosideret; | |
1953 | if (binop_user_defined_p (op, arg1, arg2)) | |
1954 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
1955 | else | |
1956 | return value_concat (arg1, arg2); | |
1957 | ||
1958 | case BINOP_ASSIGN: | |
1959 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
df407dfe | 1960 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
c906108c | 1961 | |
c906108c SS |
1962 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) |
1963 | return arg1; | |
1964 | if (binop_user_defined_p (op, arg1, arg2)) | |
1965 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
1966 | else | |
1967 | return value_assign (arg1, arg2); | |
1968 | ||
1969 | case BINOP_ASSIGN_MODIFY: | |
1970 | (*pos) += 2; | |
1971 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
df407dfe | 1972 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
c906108c SS |
1973 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) |
1974 | return arg1; | |
1975 | op = exp->elts[pc + 1].opcode; | |
1976 | if (binop_user_defined_p (op, arg1, arg2)) | |
1977 | return value_x_binop (arg1, arg2, BINOP_ASSIGN_MODIFY, op, noside); | |
cc73bb8c TT |
1978 | else if (op == BINOP_ADD && ptrmath_type_p (exp->language_defn, |
1979 | value_type (arg1)) | |
2497b498 UW |
1980 | && is_integral_type (value_type (arg2))) |
1981 | arg2 = value_ptradd (arg1, value_as_long (arg2)); | |
cc73bb8c TT |
1982 | else if (op == BINOP_SUB && ptrmath_type_p (exp->language_defn, |
1983 | value_type (arg1)) | |
2497b498 UW |
1984 | && is_integral_type (value_type (arg2))) |
1985 | arg2 = value_ptradd (arg1, - value_as_long (arg2)); | |
c906108c | 1986 | else |
f44316fa UW |
1987 | { |
1988 | struct value *tmp = arg1; | |
1989 | ||
1990 | /* For shift and integer exponentiation operations, | |
1991 | only promote the first argument. */ | |
1992 | if ((op == BINOP_LSH || op == BINOP_RSH || op == BINOP_EXP) | |
1993 | && is_integral_type (value_type (arg2))) | |
1994 | unop_promote (exp->language_defn, exp->gdbarch, &tmp); | |
1995 | else | |
1996 | binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2); | |
1997 | ||
1998 | arg2 = value_binop (tmp, arg2, op); | |
1999 | } | |
c906108c SS |
2000 | return value_assign (arg1, arg2); |
2001 | ||
2002 | case BINOP_ADD: | |
2003 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
2004 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
2005 | if (noside == EVAL_SKIP) | |
2006 | goto nosideret; | |
2007 | if (binop_user_defined_p (op, arg1, arg2)) | |
2008 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
cc73bb8c | 2009 | else if (ptrmath_type_p (exp->language_defn, value_type (arg1)) |
2497b498 UW |
2010 | && is_integral_type (value_type (arg2))) |
2011 | return value_ptradd (arg1, value_as_long (arg2)); | |
cc73bb8c | 2012 | else if (ptrmath_type_p (exp->language_defn, value_type (arg2)) |
2497b498 UW |
2013 | && is_integral_type (value_type (arg1))) |
2014 | return value_ptradd (arg2, value_as_long (arg1)); | |
c906108c | 2015 | else |
f44316fa UW |
2016 | { |
2017 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
2018 | return value_binop (arg1, arg2, BINOP_ADD); | |
2019 | } | |
c906108c SS |
2020 | |
2021 | case BINOP_SUB: | |
2022 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
2023 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
2024 | if (noside == EVAL_SKIP) | |
2025 | goto nosideret; | |
2026 | if (binop_user_defined_p (op, arg1, arg2)) | |
2027 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
cc73bb8c TT |
2028 | else if (ptrmath_type_p (exp->language_defn, value_type (arg1)) |
2029 | && ptrmath_type_p (exp->language_defn, value_type (arg2))) | |
89eef114 | 2030 | { |
2497b498 UW |
2031 | /* FIXME -- should be ptrdiff_t */ |
2032 | type = builtin_type (exp->gdbarch)->builtin_long; | |
2033 | return value_from_longest (type, value_ptrdiff (arg1, arg2)); | |
89eef114 | 2034 | } |
cc73bb8c | 2035 | else if (ptrmath_type_p (exp->language_defn, value_type (arg1)) |
2497b498 UW |
2036 | && is_integral_type (value_type (arg2))) |
2037 | return value_ptradd (arg1, - value_as_long (arg2)); | |
c906108c | 2038 | else |
f44316fa UW |
2039 | { |
2040 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
2041 | return value_binop (arg1, arg2, BINOP_SUB); | |
2042 | } | |
c906108c | 2043 | |
bd49c137 | 2044 | case BINOP_EXP: |
c906108c SS |
2045 | case BINOP_MUL: |
2046 | case BINOP_DIV: | |
9b3442ee | 2047 | case BINOP_INTDIV: |
c906108c SS |
2048 | case BINOP_REM: |
2049 | case BINOP_MOD: | |
2050 | case BINOP_LSH: | |
2051 | case BINOP_RSH: | |
2052 | case BINOP_BITWISE_AND: | |
2053 | case BINOP_BITWISE_IOR: | |
2054 | case BINOP_BITWISE_XOR: | |
2055 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2056 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2057 | if (noside == EVAL_SKIP) | |
2058 | goto nosideret; | |
2059 | if (binop_user_defined_p (op, arg1, arg2)) | |
2060 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
c906108c | 2061 | else |
301f0ecf DE |
2062 | { |
2063 | /* If EVAL_AVOID_SIDE_EFFECTS and we're dividing by zero, | |
2064 | fudge arg2 to avoid division-by-zero, the caller is | |
2065 | (theoretically) only looking for the type of the result. */ | |
2066 | if (noside == EVAL_AVOID_SIDE_EFFECTS | |
2067 | /* ??? Do we really want to test for BINOP_MOD here? | |
2068 | The implementation of value_binop gives it a well-defined | |
2069 | value. */ | |
2070 | && (op == BINOP_DIV | |
2071 | || op == BINOP_INTDIV | |
2072 | || op == BINOP_REM | |
2073 | || op == BINOP_MOD) | |
2074 | && value_logical_not (arg2)) | |
2075 | { | |
2076 | struct value *v_one, *retval; | |
2077 | ||
18a46dbe | 2078 | v_one = value_one (value_type (arg2)); |
f44316fa | 2079 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &v_one); |
301f0ecf DE |
2080 | retval = value_binop (arg1, v_one, op); |
2081 | return retval; | |
2082 | } | |
2083 | else | |
f44316fa UW |
2084 | { |
2085 | /* For shift and integer exponentiation operations, | |
2086 | only promote the first argument. */ | |
2087 | if ((op == BINOP_LSH || op == BINOP_RSH || op == BINOP_EXP) | |
2088 | && is_integral_type (value_type (arg2))) | |
2089 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
2090 | else | |
2091 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
2092 | ||
2093 | return value_binop (arg1, arg2, op); | |
2094 | } | |
301f0ecf | 2095 | } |
c906108c | 2096 | |
c906108c | 2097 | case BINOP_SUBSCRIPT: |
74de6778 TT |
2098 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
2099 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
c906108c SS |
2100 | if (noside == EVAL_SKIP) |
2101 | goto nosideret; | |
2102 | if (binop_user_defined_p (op, arg1, arg2)) | |
2103 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2104 | else | |
c5aa993b | 2105 | { |
c906108c SS |
2106 | /* If the user attempts to subscript something that is not an |
2107 | array or pointer type (like a plain int variable for example), | |
0963b4bd | 2108 | then report this as an error. */ |
c906108c | 2109 | |
994b9211 | 2110 | arg1 = coerce_ref (arg1); |
df407dfe | 2111 | type = check_typedef (value_type (arg1)); |
c906108c SS |
2112 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY |
2113 | && TYPE_CODE (type) != TYPE_CODE_PTR) | |
2114 | { | |
2115 | if (TYPE_NAME (type)) | |
8a3fe4f8 | 2116 | error (_("cannot subscript something of type `%s'"), |
c906108c SS |
2117 | TYPE_NAME (type)); |
2118 | else | |
8a3fe4f8 | 2119 | error (_("cannot subscript requested type")); |
c906108c SS |
2120 | } |
2121 | ||
2122 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
2123 | return value_zero (TYPE_TARGET_TYPE (type), VALUE_LVAL (arg1)); | |
2124 | else | |
2497b498 | 2125 | return value_subscript (arg1, value_as_long (arg2)); |
c5aa993b | 2126 | } |
c906108c SS |
2127 | case MULTI_SUBSCRIPT: |
2128 | (*pos) += 2; | |
2129 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
2130 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
2131 | while (nargs-- > 0) | |
2132 | { | |
2133 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
0963b4bd | 2134 | /* FIXME: EVAL_SKIP handling may not be correct. */ |
c906108c SS |
2135 | if (noside == EVAL_SKIP) |
2136 | { | |
2137 | if (nargs > 0) | |
2138 | { | |
2139 | continue; | |
2140 | } | |
2141 | else | |
2142 | { | |
2143 | goto nosideret; | |
2144 | } | |
2145 | } | |
0963b4bd | 2146 | /* FIXME: EVAL_AVOID_SIDE_EFFECTS handling may not be correct. */ |
c906108c SS |
2147 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
2148 | { | |
2149 | /* If the user attempts to subscript something that has no target | |
c5aa993b | 2150 | type (like a plain int variable for example), then report this |
0963b4bd | 2151 | as an error. */ |
c5aa993b | 2152 | |
df407dfe | 2153 | type = TYPE_TARGET_TYPE (check_typedef (value_type (arg1))); |
c906108c SS |
2154 | if (type != NULL) |
2155 | { | |
2156 | arg1 = value_zero (type, VALUE_LVAL (arg1)); | |
2157 | noside = EVAL_SKIP; | |
2158 | continue; | |
2159 | } | |
2160 | else | |
2161 | { | |
8a3fe4f8 | 2162 | error (_("cannot subscript something of type `%s'"), |
df407dfe | 2163 | TYPE_NAME (value_type (arg1))); |
c906108c SS |
2164 | } |
2165 | } | |
c5aa993b | 2166 | |
c906108c SS |
2167 | if (binop_user_defined_p (op, arg1, arg2)) |
2168 | { | |
2169 | arg1 = value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2170 | } | |
2171 | else | |
2172 | { | |
afc05acb UW |
2173 | arg1 = coerce_ref (arg1); |
2174 | type = check_typedef (value_type (arg1)); | |
2175 | ||
2176 | switch (TYPE_CODE (type)) | |
2177 | { | |
2178 | case TYPE_CODE_PTR: | |
2179 | case TYPE_CODE_ARRAY: | |
2180 | case TYPE_CODE_STRING: | |
2497b498 | 2181 | arg1 = value_subscript (arg1, value_as_long (arg2)); |
afc05acb UW |
2182 | break; |
2183 | ||
afc05acb UW |
2184 | default: |
2185 | if (TYPE_NAME (type)) | |
2186 | error (_("cannot subscript something of type `%s'"), | |
2187 | TYPE_NAME (type)); | |
2188 | else | |
2189 | error (_("cannot subscript requested type")); | |
2190 | } | |
c906108c SS |
2191 | } |
2192 | } | |
2193 | return (arg1); | |
2194 | ||
2195 | multi_f77_subscript: | |
c5aa993b | 2196 | { |
c2ff108b | 2197 | LONGEST subscript_array[MAX_FORTRAN_DIMS]; |
c5aa993b | 2198 | int ndimensions = 1, i; |
c2ff108b | 2199 | struct value *array = arg1; |
c906108c SS |
2200 | |
2201 | if (nargs > MAX_FORTRAN_DIMS) | |
8a3fe4f8 | 2202 | error (_("Too many subscripts for F77 (%d Max)"), MAX_FORTRAN_DIMS); |
c906108c | 2203 | |
c906108c SS |
2204 | ndimensions = calc_f77_array_dims (type); |
2205 | ||
2206 | if (nargs != ndimensions) | |
8a3fe4f8 | 2207 | error (_("Wrong number of subscripts")); |
c906108c | 2208 | |
1c9f699c DJ |
2209 | gdb_assert (nargs > 0); |
2210 | ||
c906108c | 2211 | /* Now that we know we have a legal array subscript expression |
0963b4bd | 2212 | let us actually find out where this element exists in the array. */ |
c906108c | 2213 | |
0963b4bd | 2214 | /* Take array indices left to right. */ |
7ca2d3a3 | 2215 | for (i = 0; i < nargs; i++) |
c906108c | 2216 | { |
0963b4bd | 2217 | /* Evaluate each subscript; it must be a legal integer in F77. */ |
c906108c SS |
2218 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); |
2219 | ||
c2ff108b | 2220 | /* Fill in the subscript array. */ |
c906108c SS |
2221 | |
2222 | subscript_array[i] = value_as_long (arg2); | |
7ca2d3a3 | 2223 | } |
c5aa993b | 2224 | |
0963b4bd | 2225 | /* Internal type of array is arranged right to left. */ |
c2ff108b | 2226 | for (i = nargs; i > 0; i--) |
7ca2d3a3 | 2227 | { |
c2ff108b JK |
2228 | struct type *array_type = check_typedef (value_type (array)); |
2229 | LONGEST index = subscript_array[i - 1]; | |
c906108c | 2230 | |
0953dec1 SP |
2231 | array = value_subscripted_rvalue (array, index, |
2232 | f77_get_lowerbound (array_type)); | |
c906108c SS |
2233 | } |
2234 | ||
c2ff108b | 2235 | return array; |
c906108c SS |
2236 | } |
2237 | ||
2238 | case BINOP_LOGICAL_AND: | |
2239 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2240 | if (noside == EVAL_SKIP) | |
2241 | { | |
262acaeb | 2242 | evaluate_subexp (NULL_TYPE, exp, pos, noside); |
c906108c SS |
2243 | goto nosideret; |
2244 | } | |
c5aa993b | 2245 | |
c906108c SS |
2246 | oldpos = *pos; |
2247 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
2248 | *pos = oldpos; | |
c5aa993b JM |
2249 | |
2250 | if (binop_user_defined_p (op, arg1, arg2)) | |
c906108c SS |
2251 | { |
2252 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2253 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2254 | } | |
2255 | else | |
2256 | { | |
2257 | tem = value_logical_not (arg1); | |
2258 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, | |
2259 | (tem ? EVAL_SKIP : noside)); | |
fbb06eb1 UW |
2260 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
2261 | return value_from_longest (type, | |
c5aa993b | 2262 | (LONGEST) (!tem && !value_logical_not (arg2))); |
c906108c SS |
2263 | } |
2264 | ||
2265 | case BINOP_LOGICAL_OR: | |
2266 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2267 | if (noside == EVAL_SKIP) | |
2268 | { | |
262acaeb | 2269 | evaluate_subexp (NULL_TYPE, exp, pos, noside); |
c906108c SS |
2270 | goto nosideret; |
2271 | } | |
c5aa993b | 2272 | |
c906108c SS |
2273 | oldpos = *pos; |
2274 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
2275 | *pos = oldpos; | |
c5aa993b JM |
2276 | |
2277 | if (binop_user_defined_p (op, arg1, arg2)) | |
c906108c SS |
2278 | { |
2279 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2280 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2281 | } | |
2282 | else | |
2283 | { | |
2284 | tem = value_logical_not (arg1); | |
2285 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, | |
2286 | (!tem ? EVAL_SKIP : noside)); | |
fbb06eb1 UW |
2287 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
2288 | return value_from_longest (type, | |
c5aa993b | 2289 | (LONGEST) (!tem || !value_logical_not (arg2))); |
c906108c SS |
2290 | } |
2291 | ||
2292 | case BINOP_EQUAL: | |
2293 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
df407dfe | 2294 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
c906108c SS |
2295 | if (noside == EVAL_SKIP) |
2296 | goto nosideret; | |
2297 | if (binop_user_defined_p (op, arg1, arg2)) | |
2298 | { | |
2299 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2300 | } | |
2301 | else | |
2302 | { | |
f44316fa | 2303 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
c906108c | 2304 | tem = value_equal (arg1, arg2); |
fbb06eb1 UW |
2305 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
2306 | return value_from_longest (type, (LONGEST) tem); | |
c906108c SS |
2307 | } |
2308 | ||
2309 | case BINOP_NOTEQUAL: | |
2310 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
df407dfe | 2311 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
c906108c SS |
2312 | if (noside == EVAL_SKIP) |
2313 | goto nosideret; | |
2314 | if (binop_user_defined_p (op, arg1, arg2)) | |
2315 | { | |
2316 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2317 | } | |
2318 | else | |
2319 | { | |
f44316fa | 2320 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
c906108c | 2321 | tem = value_equal (arg1, arg2); |
fbb06eb1 UW |
2322 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
2323 | return value_from_longest (type, (LONGEST) ! tem); | |
c906108c SS |
2324 | } |
2325 | ||
2326 | case BINOP_LESS: | |
2327 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
df407dfe | 2328 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
c906108c SS |
2329 | if (noside == EVAL_SKIP) |
2330 | goto nosideret; | |
2331 | if (binop_user_defined_p (op, arg1, arg2)) | |
2332 | { | |
2333 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2334 | } | |
2335 | else | |
2336 | { | |
f44316fa | 2337 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
c906108c | 2338 | tem = value_less (arg1, arg2); |
fbb06eb1 UW |
2339 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
2340 | return value_from_longest (type, (LONGEST) tem); | |
c906108c SS |
2341 | } |
2342 | ||
2343 | case BINOP_GTR: | |
2344 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
df407dfe | 2345 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
c906108c SS |
2346 | if (noside == EVAL_SKIP) |
2347 | goto nosideret; | |
2348 | if (binop_user_defined_p (op, arg1, arg2)) | |
2349 | { | |
2350 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2351 | } | |
2352 | else | |
2353 | { | |
f44316fa | 2354 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
c906108c | 2355 | tem = value_less (arg2, arg1); |
fbb06eb1 UW |
2356 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
2357 | return value_from_longest (type, (LONGEST) tem); | |
c906108c SS |
2358 | } |
2359 | ||
2360 | case BINOP_GEQ: | |
2361 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
df407dfe | 2362 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
c906108c SS |
2363 | if (noside == EVAL_SKIP) |
2364 | goto nosideret; | |
2365 | if (binop_user_defined_p (op, arg1, arg2)) | |
2366 | { | |
2367 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2368 | } | |
2369 | else | |
2370 | { | |
f44316fa | 2371 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
c906108c | 2372 | tem = value_less (arg2, arg1) || value_equal (arg1, arg2); |
fbb06eb1 UW |
2373 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
2374 | return value_from_longest (type, (LONGEST) tem); | |
c906108c SS |
2375 | } |
2376 | ||
2377 | case BINOP_LEQ: | |
2378 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
df407dfe | 2379 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
c906108c SS |
2380 | if (noside == EVAL_SKIP) |
2381 | goto nosideret; | |
2382 | if (binop_user_defined_p (op, arg1, arg2)) | |
2383 | { | |
2384 | return value_x_binop (arg1, arg2, op, OP_NULL, noside); | |
2385 | } | |
c5aa993b | 2386 | else |
c906108c | 2387 | { |
f44316fa | 2388 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
c906108c | 2389 | tem = value_less (arg1, arg2) || value_equal (arg1, arg2); |
fbb06eb1 UW |
2390 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
2391 | return value_from_longest (type, (LONGEST) tem); | |
c906108c SS |
2392 | } |
2393 | ||
2394 | case BINOP_REPEAT: | |
2395 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2396 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2397 | if (noside == EVAL_SKIP) | |
2398 | goto nosideret; | |
df407dfe | 2399 | type = check_typedef (value_type (arg2)); |
c906108c | 2400 | if (TYPE_CODE (type) != TYPE_CODE_INT) |
8a3fe4f8 | 2401 | error (_("Non-integral right operand for \"@\" operator.")); |
c906108c SS |
2402 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
2403 | { | |
df407dfe | 2404 | return allocate_repeat_value (value_type (arg1), |
c5aa993b | 2405 | longest_to_int (value_as_long (arg2))); |
c906108c SS |
2406 | } |
2407 | else | |
2408 | return value_repeat (arg1, longest_to_int (value_as_long (arg2))); | |
2409 | ||
2410 | case BINOP_COMMA: | |
2411 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2412 | return evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2413 | ||
36e9969c NS |
2414 | case UNOP_PLUS: |
2415 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2416 | if (noside == EVAL_SKIP) | |
2417 | goto nosideret; | |
2418 | if (unop_user_defined_p (op, arg1)) | |
2419 | return value_x_unop (arg1, op, noside); | |
2420 | else | |
f44316fa UW |
2421 | { |
2422 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
2423 | return value_pos (arg1); | |
2424 | } | |
36e9969c | 2425 | |
c906108c SS |
2426 | case UNOP_NEG: |
2427 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2428 | if (noside == EVAL_SKIP) | |
2429 | goto nosideret; | |
2430 | if (unop_user_defined_p (op, arg1)) | |
2431 | return value_x_unop (arg1, op, noside); | |
2432 | else | |
f44316fa UW |
2433 | { |
2434 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
2435 | return value_neg (arg1); | |
2436 | } | |
c906108c SS |
2437 | |
2438 | case UNOP_COMPLEMENT: | |
2439 | /* C++: check for and handle destructor names. */ | |
2440 | op = exp->elts[*pos].opcode; | |
2441 | ||
2442 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2443 | if (noside == EVAL_SKIP) | |
2444 | goto nosideret; | |
2445 | if (unop_user_defined_p (UNOP_COMPLEMENT, arg1)) | |
2446 | return value_x_unop (arg1, UNOP_COMPLEMENT, noside); | |
2447 | else | |
f44316fa UW |
2448 | { |
2449 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
2450 | return value_complement (arg1); | |
2451 | } | |
c906108c SS |
2452 | |
2453 | case UNOP_LOGICAL_NOT: | |
2454 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2455 | if (noside == EVAL_SKIP) | |
2456 | goto nosideret; | |
2457 | if (unop_user_defined_p (op, arg1)) | |
2458 | return value_x_unop (arg1, op, noside); | |
2459 | else | |
fbb06eb1 UW |
2460 | { |
2461 | type = language_bool_type (exp->language_defn, exp->gdbarch); | |
2462 | return value_from_longest (type, (LONGEST) value_logical_not (arg1)); | |
2463 | } | |
c906108c SS |
2464 | |
2465 | case UNOP_IND: | |
2466 | if (expect_type && TYPE_CODE (expect_type) == TYPE_CODE_PTR) | |
c5aa993b | 2467 | expect_type = TYPE_TARGET_TYPE (check_typedef (expect_type)); |
c906108c | 2468 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); |
0d5de010 DJ |
2469 | type = check_typedef (value_type (arg1)); |
2470 | if (TYPE_CODE (type) == TYPE_CODE_METHODPTR | |
2471 | || TYPE_CODE (type) == TYPE_CODE_MEMBERPTR) | |
3e43a32a MS |
2472 | error (_("Attempt to dereference pointer " |
2473 | "to member without an object")); | |
c906108c SS |
2474 | if (noside == EVAL_SKIP) |
2475 | goto nosideret; | |
2476 | if (unop_user_defined_p (op, arg1)) | |
2477 | return value_x_unop (arg1, op, noside); | |
2478 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
2479 | { | |
df407dfe | 2480 | type = check_typedef (value_type (arg1)); |
c906108c SS |
2481 | if (TYPE_CODE (type) == TYPE_CODE_PTR |
2482 | || TYPE_CODE (type) == TYPE_CODE_REF | |
c5aa993b | 2483 | /* In C you can dereference an array to get the 1st elt. */ |
c906108c | 2484 | || TYPE_CODE (type) == TYPE_CODE_ARRAY |
c5aa993b | 2485 | ) |
c906108c SS |
2486 | return value_zero (TYPE_TARGET_TYPE (type), |
2487 | lval_memory); | |
2488 | else if (TYPE_CODE (type) == TYPE_CODE_INT) | |
2489 | /* GDB allows dereferencing an int. */ | |
22fe0fbb UW |
2490 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, |
2491 | lval_memory); | |
c906108c | 2492 | else |
8a3fe4f8 | 2493 | error (_("Attempt to take contents of a non-pointer value.")); |
c906108c | 2494 | } |
22fe0fbb UW |
2495 | |
2496 | /* Allow * on an integer so we can cast it to whatever we want. | |
2497 | This returns an int, which seems like the most C-like thing to | |
2498 | do. "long long" variables are rare enough that | |
2499 | BUILTIN_TYPE_LONGEST would seem to be a mistake. */ | |
2500 | if (TYPE_CODE (type) == TYPE_CODE_INT) | |
2501 | return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int, | |
2502 | (CORE_ADDR) value_as_address (arg1)); | |
c906108c SS |
2503 | return value_ind (arg1); |
2504 | ||
2505 | case UNOP_ADDR: | |
2506 | /* C++: check for and handle pointer to members. */ | |
c5aa993b | 2507 | |
c906108c SS |
2508 | op = exp->elts[*pos].opcode; |
2509 | ||
2510 | if (noside == EVAL_SKIP) | |
2511 | { | |
0d5de010 | 2512 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); |
c906108c SS |
2513 | goto nosideret; |
2514 | } | |
c5aa993b JM |
2515 | else |
2516 | { | |
3e43a32a MS |
2517 | struct value *retvalp = evaluate_subexp_for_address (exp, pos, |
2518 | noside); | |
d7f9d729 | 2519 | |
c5aa993b JM |
2520 | return retvalp; |
2521 | } | |
2522 | ||
c906108c SS |
2523 | case UNOP_SIZEOF: |
2524 | if (noside == EVAL_SKIP) | |
2525 | { | |
2526 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
2527 | goto nosideret; | |
2528 | } | |
5ecaaa66 | 2529 | return evaluate_subexp_for_sizeof (exp, pos, noside); |
c906108c SS |
2530 | |
2531 | case UNOP_CAST: | |
2532 | (*pos) += 2; | |
2533 | type = exp->elts[pc + 1].type; | |
2534 | arg1 = evaluate_subexp (type, exp, pos, noside); | |
2535 | if (noside == EVAL_SKIP) | |
2536 | goto nosideret; | |
df407dfe | 2537 | if (type != value_type (arg1)) |
c906108c SS |
2538 | arg1 = value_cast (type, arg1); |
2539 | return arg1; | |
2540 | ||
9eaf6705 TT |
2541 | case UNOP_CAST_TYPE: |
2542 | arg1 = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
2543 | type = value_type (arg1); | |
2544 | arg1 = evaluate_subexp (type, exp, pos, noside); | |
2545 | if (noside == EVAL_SKIP) | |
2546 | goto nosideret; | |
2547 | if (type != value_type (arg1)) | |
2548 | arg1 = value_cast (type, arg1); | |
2549 | return arg1; | |
2550 | ||
4e8f195d | 2551 | case UNOP_DYNAMIC_CAST: |
9eaf6705 TT |
2552 | arg1 = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS); |
2553 | type = value_type (arg1); | |
4e8f195d TT |
2554 | arg1 = evaluate_subexp (type, exp, pos, noside); |
2555 | if (noside == EVAL_SKIP) | |
2556 | goto nosideret; | |
2557 | return value_dynamic_cast (type, arg1); | |
2558 | ||
2559 | case UNOP_REINTERPRET_CAST: | |
9eaf6705 TT |
2560 | arg1 = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS); |
2561 | type = value_type (arg1); | |
4e8f195d TT |
2562 | arg1 = evaluate_subexp (type, exp, pos, noside); |
2563 | if (noside == EVAL_SKIP) | |
2564 | goto nosideret; | |
2565 | return value_reinterpret_cast (type, arg1); | |
2566 | ||
c906108c SS |
2567 | case UNOP_MEMVAL: |
2568 | (*pos) += 2; | |
2569 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
2570 | if (noside == EVAL_SKIP) | |
2571 | goto nosideret; | |
2572 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
2573 | return value_zero (exp->elts[pc + 1].type, lval_memory); | |
2574 | else | |
2575 | return value_at_lazy (exp->elts[pc + 1].type, | |
00a4c844 | 2576 | value_as_address (arg1)); |
c906108c | 2577 | |
9eaf6705 TT |
2578 | case UNOP_MEMVAL_TYPE: |
2579 | arg1 = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
2580 | type = value_type (arg1); | |
2581 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
2582 | if (noside == EVAL_SKIP) | |
2583 | goto nosideret; | |
2584 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
4f485ebc | 2585 | return value_zero (type, lval_memory); |
9eaf6705 | 2586 | else |
4f485ebc | 2587 | return value_at_lazy (type, value_as_address (arg1)); |
9eaf6705 | 2588 | |
9e35dae4 DJ |
2589 | case UNOP_MEMVAL_TLS: |
2590 | (*pos) += 3; | |
2591 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
2592 | if (noside == EVAL_SKIP) | |
2593 | goto nosideret; | |
2594 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
2595 | return value_zero (exp->elts[pc + 2].type, lval_memory); | |
2596 | else | |
2597 | { | |
2598 | CORE_ADDR tls_addr; | |
d7f9d729 | 2599 | |
9e35dae4 DJ |
2600 | tls_addr = target_translate_tls_address (exp->elts[pc + 1].objfile, |
2601 | value_as_address (arg1)); | |
2602 | return value_at_lazy (exp->elts[pc + 2].type, tls_addr); | |
2603 | } | |
2604 | ||
c906108c SS |
2605 | case UNOP_PREINCREMENT: |
2606 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
2607 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
2608 | return arg1; | |
2609 | else if (unop_user_defined_p (op, arg1)) | |
2610 | { | |
2611 | return value_x_unop (arg1, op, noside); | |
2612 | } | |
2613 | else | |
2614 | { | |
cc73bb8c | 2615 | if (ptrmath_type_p (exp->language_defn, value_type (arg1))) |
2497b498 | 2616 | arg2 = value_ptradd (arg1, 1); |
89eef114 | 2617 | else |
f44316fa UW |
2618 | { |
2619 | struct value *tmp = arg1; | |
d7f9d729 | 2620 | |
18a46dbe | 2621 | arg2 = value_one (value_type (arg1)); |
f44316fa UW |
2622 | binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2); |
2623 | arg2 = value_binop (tmp, arg2, BINOP_ADD); | |
2624 | } | |
89eef114 | 2625 | |
c906108c SS |
2626 | return value_assign (arg1, arg2); |
2627 | } | |
2628 | ||
2629 | case UNOP_PREDECREMENT: | |
2630 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
2631 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
2632 | return arg1; | |
2633 | else if (unop_user_defined_p (op, arg1)) | |
2634 | { | |
2635 | return value_x_unop (arg1, op, noside); | |
2636 | } | |
2637 | else | |
2638 | { | |
cc73bb8c | 2639 | if (ptrmath_type_p (exp->language_defn, value_type (arg1))) |
2497b498 | 2640 | arg2 = value_ptradd (arg1, -1); |
89eef114 | 2641 | else |
f44316fa UW |
2642 | { |
2643 | struct value *tmp = arg1; | |
d7f9d729 | 2644 | |
18a46dbe | 2645 | arg2 = value_one (value_type (arg1)); |
f44316fa UW |
2646 | binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2); |
2647 | arg2 = value_binop (tmp, arg2, BINOP_SUB); | |
2648 | } | |
89eef114 | 2649 | |
c906108c SS |
2650 | return value_assign (arg1, arg2); |
2651 | } | |
2652 | ||
2653 | case UNOP_POSTINCREMENT: | |
2654 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
2655 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
2656 | return arg1; | |
2657 | else if (unop_user_defined_p (op, arg1)) | |
2658 | { | |
2659 | return value_x_unop (arg1, op, noside); | |
2660 | } | |
2661 | else | |
2662 | { | |
c37f7098 KW |
2663 | arg3 = value_non_lval (arg1); |
2664 | ||
cc73bb8c | 2665 | if (ptrmath_type_p (exp->language_defn, value_type (arg1))) |
2497b498 | 2666 | arg2 = value_ptradd (arg1, 1); |
89eef114 | 2667 | else |
f44316fa UW |
2668 | { |
2669 | struct value *tmp = arg1; | |
d7f9d729 | 2670 | |
18a46dbe | 2671 | arg2 = value_one (value_type (arg1)); |
f44316fa UW |
2672 | binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2); |
2673 | arg2 = value_binop (tmp, arg2, BINOP_ADD); | |
2674 | } | |
89eef114 | 2675 | |
c906108c | 2676 | value_assign (arg1, arg2); |
c37f7098 | 2677 | return arg3; |
c906108c SS |
2678 | } |
2679 | ||
2680 | case UNOP_POSTDECREMENT: | |
2681 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
2682 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
2683 | return arg1; | |
2684 | else if (unop_user_defined_p (op, arg1)) | |
2685 | { | |
2686 | return value_x_unop (arg1, op, noside); | |
2687 | } | |
2688 | else | |
2689 | { | |
c37f7098 KW |
2690 | arg3 = value_non_lval (arg1); |
2691 | ||
cc73bb8c | 2692 | if (ptrmath_type_p (exp->language_defn, value_type (arg1))) |
2497b498 | 2693 | arg2 = value_ptradd (arg1, -1); |
89eef114 | 2694 | else |
f44316fa UW |
2695 | { |
2696 | struct value *tmp = arg1; | |
d7f9d729 | 2697 | |
18a46dbe | 2698 | arg2 = value_one (value_type (arg1)); |
f44316fa UW |
2699 | binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2); |
2700 | arg2 = value_binop (tmp, arg2, BINOP_SUB); | |
2701 | } | |
89eef114 | 2702 | |
c906108c | 2703 | value_assign (arg1, arg2); |
c37f7098 | 2704 | return arg3; |
c906108c | 2705 | } |
c5aa993b | 2706 | |
c906108c SS |
2707 | case OP_THIS: |
2708 | (*pos) += 1; | |
85bc8cb7 | 2709 | return value_of_this (exp->language_defn); |
a9fa03de | 2710 | |
c906108c | 2711 | case OP_TYPE: |
d843c49c FF |
2712 | /* The value is not supposed to be used. This is here to make it |
2713 | easier to accommodate expressions that contain types. */ | |
2714 | (*pos) += 2; | |
2715 | if (noside == EVAL_SKIP) | |
2716 | goto nosideret; | |
2717 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
cb249c71 TT |
2718 | { |
2719 | struct type *type = exp->elts[pc + 1].type; | |
d7f9d729 | 2720 | |
cb249c71 TT |
2721 | /* If this is a typedef, then find its immediate target. We |
2722 | use check_typedef to resolve stubs, but we ignore its | |
2723 | result because we do not want to dig past all | |
2724 | typedefs. */ | |
2725 | check_typedef (type); | |
2726 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
2727 | type = TYPE_TARGET_TYPE (type); | |
2728 | return allocate_value (type); | |
2729 | } | |
d843c49c FF |
2730 | else |
2731 | error (_("Attempt to use a type name as an expression")); | |
c906108c | 2732 | |
608b4967 TT |
2733 | case OP_TYPEOF: |
2734 | case OP_DECLTYPE: | |
2735 | if (noside == EVAL_SKIP) | |
2736 | { | |
2737 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
2738 | goto nosideret; | |
2739 | } | |
2740 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
2741 | { | |
2742 | enum exp_opcode sub_op = exp->elts[*pos].opcode; | |
2743 | struct value *result; | |
2744 | ||
2745 | result = evaluate_subexp (NULL_TYPE, exp, pos, | |
2746 | EVAL_AVOID_SIDE_EFFECTS); | |
2747 | ||
2748 | /* 'decltype' has special semantics for lvalues. */ | |
2749 | if (op == OP_DECLTYPE | |
2750 | && (sub_op == BINOP_SUBSCRIPT | |
2751 | || sub_op == STRUCTOP_MEMBER | |
2752 | || sub_op == STRUCTOP_MPTR | |
2753 | || sub_op == UNOP_IND | |
2754 | || sub_op == STRUCTOP_STRUCT | |
2755 | || sub_op == STRUCTOP_PTR | |
2756 | || sub_op == OP_SCOPE)) | |
2757 | { | |
2758 | struct type *type = value_type (result); | |
2759 | ||
2760 | if (TYPE_CODE (check_typedef (type)) != TYPE_CODE_REF) | |
2761 | { | |
2762 | type = lookup_reference_type (type); | |
2763 | result = allocate_value (type); | |
2764 | } | |
2765 | } | |
2766 | ||
2767 | return result; | |
2768 | } | |
2769 | else | |
2770 | error (_("Attempt to use a type as an expression")); | |
2771 | ||
6e72ca20 TT |
2772 | case OP_TYPEID: |
2773 | { | |
2774 | struct value *result; | |
2775 | enum exp_opcode sub_op = exp->elts[*pos].opcode; | |
2776 | ||
2777 | if (sub_op == OP_TYPE || sub_op == OP_DECLTYPE || sub_op == OP_TYPEOF) | |
2778 | result = evaluate_subexp (NULL_TYPE, exp, pos, | |
2779 | EVAL_AVOID_SIDE_EFFECTS); | |
2780 | else | |
2781 | result = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2782 | ||
2783 | if (noside != EVAL_NORMAL) | |
2784 | return allocate_value (cplus_typeid_type (exp->gdbarch)); | |
2785 | ||
2786 | return cplus_typeid (result); | |
2787 | } | |
2788 | ||
c906108c SS |
2789 | default: |
2790 | /* Removing this case and compiling with gcc -Wall reveals that | |
c5aa993b | 2791 | a lot of cases are hitting this case. Some of these should |
2df3850c JM |
2792 | probably be removed from expression.h; others are legitimate |
2793 | expressions which are (apparently) not fully implemented. | |
c906108c | 2794 | |
c5aa993b JM |
2795 | If there are any cases landing here which mean a user error, |
2796 | then they should be separate cases, with more descriptive | |
2797 | error messages. */ | |
c906108c | 2798 | |
3e43a32a MS |
2799 | error (_("GDB does not (yet) know how to " |
2800 | "evaluate that kind of expression")); | |
c906108c SS |
2801 | } |
2802 | ||
c5aa993b | 2803 | nosideret: |
22601c15 | 2804 | return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1); |
c906108c SS |
2805 | } |
2806 | \f | |
2807 | /* Evaluate a subexpression of EXP, at index *POS, | |
2808 | and return the address of that subexpression. | |
2809 | Advance *POS over the subexpression. | |
2810 | If the subexpression isn't an lvalue, get an error. | |
2811 | NOSIDE may be EVAL_AVOID_SIDE_EFFECTS; | |
2812 | then only the type of the result need be correct. */ | |
2813 | ||
61051030 | 2814 | static struct value * |
aa1ee363 | 2815 | evaluate_subexp_for_address (struct expression *exp, int *pos, |
fba45db2 | 2816 | enum noside noside) |
c906108c SS |
2817 | { |
2818 | enum exp_opcode op; | |
52f0bd74 | 2819 | int pc; |
c906108c | 2820 | struct symbol *var; |
ab5c9f60 | 2821 | struct value *x; |
0d5de010 | 2822 | int tem; |
c906108c SS |
2823 | |
2824 | pc = (*pos); | |
2825 | op = exp->elts[pc].opcode; | |
2826 | ||
2827 | switch (op) | |
2828 | { | |
2829 | case UNOP_IND: | |
2830 | (*pos)++; | |
ab5c9f60 DJ |
2831 | x = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
2832 | ||
2833 | /* We can't optimize out "&*" if there's a user-defined operator*. */ | |
2834 | if (unop_user_defined_p (op, x)) | |
2835 | { | |
2836 | x = value_x_unop (x, op, noside); | |
0d5de010 | 2837 | goto default_case_after_eval; |
ab5c9f60 DJ |
2838 | } |
2839 | ||
708ead4e | 2840 | return coerce_array (x); |
c906108c SS |
2841 | |
2842 | case UNOP_MEMVAL: | |
2843 | (*pos) += 3; | |
2844 | return value_cast (lookup_pointer_type (exp->elts[pc + 1].type), | |
2845 | evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
2846 | ||
9eaf6705 TT |
2847 | case UNOP_MEMVAL_TYPE: |
2848 | { | |
2849 | struct type *type; | |
2850 | ||
2851 | (*pos) += 1; | |
2852 | x = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
2853 | type = value_type (x); | |
2854 | return value_cast (lookup_pointer_type (type), | |
2855 | evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
2856 | } | |
2857 | ||
c906108c SS |
2858 | case OP_VAR_VALUE: |
2859 | var = exp->elts[pc + 2].symbol; | |
2860 | ||
2861 | /* C++: The "address" of a reference should yield the address | |
0963b4bd | 2862 | * of the object pointed to. Let value_addr() deal with it. */ |
c906108c | 2863 | if (TYPE_CODE (SYMBOL_TYPE (var)) == TYPE_CODE_REF) |
c5aa993b | 2864 | goto default_case; |
c906108c SS |
2865 | |
2866 | (*pos) += 4; | |
2867 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
2868 | { | |
2869 | struct type *type = | |
d7f9d729 | 2870 | lookup_pointer_type (SYMBOL_TYPE (var)); |
c906108c SS |
2871 | enum address_class sym_class = SYMBOL_CLASS (var); |
2872 | ||
2873 | if (sym_class == LOC_CONST | |
2874 | || sym_class == LOC_CONST_BYTES | |
2a2d4dc3 | 2875 | || sym_class == LOC_REGISTER) |
8a3fe4f8 | 2876 | error (_("Attempt to take address of register or constant.")); |
c906108c | 2877 | |
c5aa993b JM |
2878 | return |
2879 | value_zero (type, not_lval); | |
c906108c | 2880 | } |
ceef53c1 | 2881 | else |
61212c0f | 2882 | return address_of_variable (var, exp->elts[pc + 1].block); |
c906108c | 2883 | |
0d5de010 DJ |
2884 | case OP_SCOPE: |
2885 | tem = longest_to_int (exp->elts[pc + 2].longconst); | |
2886 | (*pos) += 5 + BYTES_TO_EXP_ELEM (tem + 1); | |
2887 | x = value_aggregate_elt (exp->elts[pc + 1].type, | |
2888 | &exp->elts[pc + 3].string, | |
072bba3b | 2889 | NULL, 1, noside); |
0d5de010 DJ |
2890 | if (x == NULL) |
2891 | error (_("There is no field named %s"), &exp->elts[pc + 3].string); | |
2892 | return x; | |
2893 | ||
c906108c SS |
2894 | default: |
2895 | default_case: | |
ab5c9f60 | 2896 | x = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
0d5de010 | 2897 | default_case_after_eval: |
c906108c SS |
2898 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
2899 | { | |
0d5de010 DJ |
2900 | struct type *type = check_typedef (value_type (x)); |
2901 | ||
4819b3f8 | 2902 | if (TYPE_CODE (type) == TYPE_CODE_REF) |
0d5de010 DJ |
2903 | return value_zero (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
2904 | not_lval); | |
4819b3f8 PA |
2905 | else if (VALUE_LVAL (x) == lval_memory || value_must_coerce_to_target (x)) |
2906 | return value_zero (lookup_pointer_type (value_type (x)), | |
2907 | not_lval); | |
c906108c | 2908 | else |
3e43a32a MS |
2909 | error (_("Attempt to take address of " |
2910 | "value not located in memory.")); | |
c906108c | 2911 | } |
ab5c9f60 | 2912 | return value_addr (x); |
c906108c SS |
2913 | } |
2914 | } | |
2915 | ||
2916 | /* Evaluate like `evaluate_subexp' except coercing arrays to pointers. | |
2917 | When used in contexts where arrays will be coerced anyway, this is | |
2918 | equivalent to `evaluate_subexp' but much faster because it avoids | |
2919 | actually fetching array contents (perhaps obsolete now that we have | |
d69fe07e | 2920 | value_lazy()). |
c906108c SS |
2921 | |
2922 | Note that we currently only do the coercion for C expressions, where | |
2923 | arrays are zero based and the coercion is correct. For other languages, | |
2924 | with nonzero based arrays, coercion loses. Use CAST_IS_CONVERSION | |
0963b4bd | 2925 | to decide if coercion is appropriate. */ |
c906108c | 2926 | |
61051030 | 2927 | struct value * |
aa1ee363 AC |
2928 | evaluate_subexp_with_coercion (struct expression *exp, |
2929 | int *pos, enum noside noside) | |
c906108c | 2930 | { |
52f0bd74 AC |
2931 | enum exp_opcode op; |
2932 | int pc; | |
61051030 | 2933 | struct value *val; |
c906108c | 2934 | struct symbol *var; |
61212c0f | 2935 | struct type *type; |
c906108c SS |
2936 | |
2937 | pc = (*pos); | |
2938 | op = exp->elts[pc].opcode; | |
2939 | ||
2940 | switch (op) | |
2941 | { | |
2942 | case OP_VAR_VALUE: | |
2943 | var = exp->elts[pc + 2].symbol; | |
61212c0f UW |
2944 | type = check_typedef (SYMBOL_TYPE (var)); |
2945 | if (TYPE_CODE (type) == TYPE_CODE_ARRAY | |
7346b668 | 2946 | && !TYPE_VECTOR (type) |
cc73bb8c | 2947 | && CAST_IS_CONVERSION (exp->language_defn)) |
c906108c SS |
2948 | { |
2949 | (*pos) += 4; | |
61212c0f UW |
2950 | val = address_of_variable (var, exp->elts[pc + 1].block); |
2951 | return value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)), | |
c906108c SS |
2952 | val); |
2953 | } | |
2954 | /* FALLTHROUGH */ | |
2955 | ||
2956 | default: | |
2957 | return evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2958 | } | |
2959 | } | |
2960 | ||
2961 | /* Evaluate a subexpression of EXP, at index *POS, | |
2962 | and return a value for the size of that subexpression. | |
5ecaaa66 SA |
2963 | Advance *POS over the subexpression. If NOSIDE is EVAL_NORMAL |
2964 | we allow side-effects on the operand if its type is a variable | |
2965 | length array. */ | |
c906108c | 2966 | |
61051030 | 2967 | static struct value * |
5ecaaa66 SA |
2968 | evaluate_subexp_for_sizeof (struct expression *exp, int *pos, |
2969 | enum noside noside) | |
c906108c | 2970 | { |
98b90dd8 UW |
2971 | /* FIXME: This should be size_t. */ |
2972 | struct type *size_type = builtin_type (exp->gdbarch)->builtin_int; | |
c906108c | 2973 | enum exp_opcode op; |
52f0bd74 | 2974 | int pc; |
c906108c | 2975 | struct type *type; |
61051030 | 2976 | struct value *val; |
c906108c SS |
2977 | |
2978 | pc = (*pos); | |
2979 | op = exp->elts[pc].opcode; | |
2980 | ||
2981 | switch (op) | |
2982 | { | |
2983 | /* This case is handled specially | |
c5aa993b JM |
2984 | so that we avoid creating a value for the result type. |
2985 | If the result type is very big, it's desirable not to | |
2986 | create a value unnecessarily. */ | |
c906108c SS |
2987 | case UNOP_IND: |
2988 | (*pos)++; | |
2989 | val = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
df407dfe | 2990 | type = check_typedef (value_type (val)); |
c906108c SS |
2991 | if (TYPE_CODE (type) != TYPE_CODE_PTR |
2992 | && TYPE_CODE (type) != TYPE_CODE_REF | |
2993 | && TYPE_CODE (type) != TYPE_CODE_ARRAY) | |
8a3fe4f8 | 2994 | error (_("Attempt to take contents of a non-pointer value.")); |
6b662e19 | 2995 | type = TYPE_TARGET_TYPE (type); |
3c8452d4 SA |
2996 | if (is_dynamic_type (type)) |
2997 | type = value_type (value_ind (val)); | |
2998 | return value_from_longest (size_type, (LONGEST) TYPE_LENGTH (type)); | |
c906108c SS |
2999 | |
3000 | case UNOP_MEMVAL: | |
3001 | (*pos) += 3; | |
245a5f0b KS |
3002 | type = exp->elts[pc + 1].type; |
3003 | break; | |
c906108c | 3004 | |
9eaf6705 TT |
3005 | case UNOP_MEMVAL_TYPE: |
3006 | (*pos) += 1; | |
3007 | val = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
245a5f0b KS |
3008 | type = value_type (val); |
3009 | break; | |
9eaf6705 | 3010 | |
c906108c | 3011 | case OP_VAR_VALUE: |
6b662e19 | 3012 | type = SYMBOL_TYPE (exp->elts[pc + 2].symbol); |
4ad88275 SA |
3013 | if (is_dynamic_type (type)) |
3014 | { | |
3015 | val = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL); | |
3016 | type = value_type (val); | |
3017 | } | |
3018 | else | |
3019 | (*pos) += 4; | |
245a5f0b | 3020 | break; |
c906108c | 3021 | |
5ecaaa66 SA |
3022 | /* Deal with the special case if NOSIDE is EVAL_NORMAL and the resulting |
3023 | type of the subscript is a variable length array type. In this case we | |
3024 | must re-evaluate the right hand side of the subcription to allow | |
3025 | side-effects. */ | |
3026 | case BINOP_SUBSCRIPT: | |
3027 | if (noside == EVAL_NORMAL) | |
3028 | { | |
3029 | int pc = (*pos) + 1; | |
3030 | ||
3031 | val = evaluate_subexp (NULL_TYPE, exp, &pc, EVAL_AVOID_SIDE_EFFECTS); | |
3032 | type = check_typedef (value_type (val)); | |
3033 | if (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
3034 | { | |
3035 | type = check_typedef (TYPE_TARGET_TYPE (type)); | |
3036 | if (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
3037 | { | |
3038 | type = TYPE_INDEX_TYPE (type); | |
3039 | /* Only re-evaluate the right hand side if the resulting type | |
3040 | is a variable length type. */ | |
3041 | if (TYPE_RANGE_DATA (type)->flag_bound_evaluated) | |
3042 | { | |
3043 | val = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL); | |
3044 | return value_from_longest | |
3045 | (size_type, (LONGEST) TYPE_LENGTH (value_type (val))); | |
3046 | } | |
3047 | } | |
3048 | } | |
3049 | } | |
3050 | ||
3051 | /* Fall through. */ | |
3052 | ||
c906108c SS |
3053 | default: |
3054 | val = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
245a5f0b KS |
3055 | type = value_type (val); |
3056 | break; | |
c906108c | 3057 | } |
245a5f0b KS |
3058 | |
3059 | /* $5.3.3/2 of the C++ Standard (n3290 draft) says of sizeof: | |
3060 | "When applied to a reference or a reference type, the result is | |
3061 | the size of the referenced type." */ | |
3062 | CHECK_TYPEDEF (type); | |
3063 | if (exp->language_defn->la_language == language_cplus | |
3064 | && TYPE_CODE (type) == TYPE_CODE_REF) | |
3065 | type = check_typedef (TYPE_TARGET_TYPE (type)); | |
3066 | return value_from_longest (size_type, (LONGEST) TYPE_LENGTH (type)); | |
c906108c SS |
3067 | } |
3068 | ||
0963b4bd | 3069 | /* Parse a type expression in the string [P..P+LENGTH). */ |
c906108c SS |
3070 | |
3071 | struct type * | |
fba45db2 | 3072 | parse_and_eval_type (char *p, int length) |
c906108c | 3073 | { |
c5aa993b JM |
3074 | char *tmp = (char *) alloca (length + 4); |
3075 | struct expression *expr; | |
d7f9d729 | 3076 | |
c5aa993b JM |
3077 | tmp[0] = '('; |
3078 | memcpy (tmp + 1, p, length); | |
3079 | tmp[length + 1] = ')'; | |
3080 | tmp[length + 2] = '0'; | |
3081 | tmp[length + 3] = '\0'; | |
3082 | expr = parse_expression (tmp); | |
3083 | if (expr->elts[0].opcode != UNOP_CAST) | |
8a3fe4f8 | 3084 | error (_("Internal error in eval_type.")); |
c5aa993b | 3085 | return expr->elts[1].type; |
c906108c SS |
3086 | } |
3087 | ||
3088 | int | |
fba45db2 | 3089 | calc_f77_array_dims (struct type *array_type) |
c906108c SS |
3090 | { |
3091 | int ndimen = 1; | |
3092 | struct type *tmp_type; | |
3093 | ||
c5aa993b | 3094 | if ((TYPE_CODE (array_type) != TYPE_CODE_ARRAY)) |
8a3fe4f8 | 3095 | error (_("Can't get dimensions for a non-array type")); |
c5aa993b JM |
3096 | |
3097 | tmp_type = array_type; | |
c906108c SS |
3098 | |
3099 | while ((tmp_type = TYPE_TARGET_TYPE (tmp_type))) | |
3100 | { | |
3101 | if (TYPE_CODE (tmp_type) == TYPE_CODE_ARRAY) | |
3102 | ++ndimen; | |
3103 | } | |
c5aa993b | 3104 | return ndimen; |
c906108c | 3105 | } |