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