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