Split out eval_op_structop_struct
[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 struct value *
1358 evaluate_subexp_standard (struct type *expect_type,
1359 struct expression *exp, int *pos,
1360 enum noside noside)
1361 {
1362 enum exp_opcode op;
1363 int tem, tem2, tem3;
1364 int pc, oldpos;
1365 struct value *arg1 = NULL;
1366 struct value *arg2 = NULL;
1367 struct value *arg3;
1368 struct type *type;
1369 int nargs;
1370 struct value **argvec;
1371 int ix;
1372 long mem_offset;
1373 struct type **arg_types;
1374
1375 pc = (*pos)++;
1376 op = exp->elts[pc].opcode;
1377
1378 switch (op)
1379 {
1380 case OP_SCOPE:
1381 tem = longest_to_int (exp->elts[pc + 2].longconst);
1382 (*pos) += 4 + BYTES_TO_EXP_ELEM (tem + 1);
1383 return eval_op_scope (expect_type, exp, noside,
1384 exp->elts[pc + 1].type,
1385 &exp->elts[pc + 3].string);
1386
1387 case OP_LONG:
1388 (*pos) += 3;
1389 return value_from_longest (exp->elts[pc + 1].type,
1390 exp->elts[pc + 2].longconst);
1391
1392 case OP_FLOAT:
1393 (*pos) += 3;
1394 return value_from_contents (exp->elts[pc + 1].type,
1395 exp->elts[pc + 2].floatconst);
1396
1397 case OP_ADL_FUNC:
1398 case OP_VAR_VALUE:
1399 {
1400 (*pos) += 3;
1401 symbol *var = exp->elts[pc + 2].symbol;
1402 if (SYMBOL_TYPE (var)->code () == TYPE_CODE_ERROR)
1403 error_unknown_type (var->print_name ());
1404 if (noside != EVAL_SKIP)
1405 return evaluate_var_value (noside, exp->elts[pc + 1].block, var);
1406 else
1407 {
1408 /* Return a dummy value of the correct type when skipping, so
1409 that parent functions know what is to be skipped. */
1410 return allocate_value (SYMBOL_TYPE (var));
1411 }
1412 }
1413
1414 case OP_VAR_MSYM_VALUE:
1415 {
1416 (*pos) += 3;
1417
1418 minimal_symbol *msymbol = exp->elts[pc + 2].msymbol;
1419 return eval_op_var_msym_value (expect_type, exp, noside,
1420 pc == 0, msymbol,
1421 exp->elts[pc + 1].objfile);
1422 }
1423
1424 case OP_VAR_ENTRY_VALUE:
1425 (*pos) += 2;
1426
1427 {
1428 struct symbol *sym = exp->elts[pc + 1].symbol;
1429
1430 return eval_op_var_entry_value (expect_type, exp, noside, sym);
1431 }
1432
1433 case OP_FUNC_STATIC_VAR:
1434 tem = longest_to_int (exp->elts[pc + 1].longconst);
1435 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
1436 if (noside == EVAL_SKIP)
1437 return eval_skip_value (exp);
1438
1439 {
1440 value *func = evaluate_subexp_standard (NULL, exp, pos, noside);
1441
1442 return eval_op_func_static_var (expect_type, exp, noside, func,
1443 &exp->elts[pc + 2].string);
1444 }
1445
1446 case OP_LAST:
1447 (*pos) += 2;
1448 return
1449 access_value_history (longest_to_int (exp->elts[pc + 1].longconst));
1450
1451 case OP_REGISTER:
1452 {
1453 const char *name = &exp->elts[pc + 2].string;
1454
1455 (*pos) += 3 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
1456 return eval_op_register (expect_type, exp, noside, name);
1457 }
1458 case OP_BOOL:
1459 (*pos) += 2;
1460 type = language_bool_type (exp->language_defn, exp->gdbarch);
1461 return value_from_longest (type, exp->elts[pc + 1].longconst);
1462
1463 case OP_INTERNALVAR:
1464 (*pos) += 2;
1465 return value_of_internalvar (exp->gdbarch,
1466 exp->elts[pc + 1].internalvar);
1467
1468 case OP_STRING:
1469 tem = longest_to_int (exp->elts[pc + 1].longconst);
1470 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
1471 return eval_op_string (expect_type, exp, noside, tem,
1472 &exp->elts[pc + 2].string);
1473
1474 case OP_OBJC_NSSTRING: /* Objective C Foundation Class
1475 NSString constant. */
1476 tem = longest_to_int (exp->elts[pc + 1].longconst);
1477 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
1478 if (noside == EVAL_SKIP)
1479 return eval_skip_value (exp);
1480 return value_nsstring (exp->gdbarch, &exp->elts[pc + 2].string, tem + 1);
1481
1482 case OP_ARRAY:
1483 (*pos) += 3;
1484 tem2 = longest_to_int (exp->elts[pc + 1].longconst);
1485 tem3 = longest_to_int (exp->elts[pc + 2].longconst);
1486 nargs = tem3 - tem2 + 1;
1487 type = expect_type ? check_typedef (expect_type) : nullptr;
1488
1489 if (expect_type != nullptr && noside != EVAL_SKIP
1490 && type->code () == TYPE_CODE_STRUCT)
1491 {
1492 struct value *rec = allocate_value (expect_type);
1493
1494 memset (value_contents_raw (rec), '\0', TYPE_LENGTH (type));
1495 return evaluate_struct_tuple (rec, exp, pos, noside, nargs);
1496 }
1497
1498 if (expect_type != nullptr && noside != EVAL_SKIP
1499 && type->code () == TYPE_CODE_ARRAY)
1500 {
1501 struct type *range_type = type->index_type ();
1502 struct type *element_type = TYPE_TARGET_TYPE (type);
1503 struct value *array = allocate_value (expect_type);
1504 int element_size = TYPE_LENGTH (check_typedef (element_type));
1505 LONGEST low_bound, high_bound, index;
1506
1507 if (!get_discrete_bounds (range_type, &low_bound, &high_bound))
1508 {
1509 low_bound = 0;
1510 high_bound = (TYPE_LENGTH (type) / element_size) - 1;
1511 }
1512 index = low_bound;
1513 memset (value_contents_raw (array), 0, TYPE_LENGTH (expect_type));
1514 for (tem = nargs; --nargs >= 0;)
1515 {
1516 struct value *element;
1517
1518 element = evaluate_subexp (element_type, exp, pos, noside);
1519 if (value_type (element) != element_type)
1520 element = value_cast (element_type, element);
1521 if (index > high_bound)
1522 /* To avoid memory corruption. */
1523 error (_("Too many array elements"));
1524 memcpy (value_contents_raw (array)
1525 + (index - low_bound) * element_size,
1526 value_contents (element),
1527 element_size);
1528 index++;
1529 }
1530 return array;
1531 }
1532
1533 if (expect_type != nullptr && noside != EVAL_SKIP
1534 && type->code () == TYPE_CODE_SET)
1535 {
1536 struct value *set = allocate_value (expect_type);
1537 gdb_byte *valaddr = value_contents_raw (set);
1538 struct type *element_type = type->index_type ();
1539 struct type *check_type = element_type;
1540 LONGEST low_bound, high_bound;
1541
1542 /* Get targettype of elementtype. */
1543 while (check_type->code () == TYPE_CODE_RANGE
1544 || check_type->code () == TYPE_CODE_TYPEDEF)
1545 check_type = TYPE_TARGET_TYPE (check_type);
1546
1547 if (!get_discrete_bounds (element_type, &low_bound, &high_bound))
1548 error (_("(power)set type with unknown size"));
1549 memset (valaddr, '\0', TYPE_LENGTH (type));
1550 for (tem = 0; tem < nargs; tem++)
1551 {
1552 LONGEST range_low, range_high;
1553 struct type *range_low_type, *range_high_type;
1554 struct value *elem_val;
1555
1556 elem_val = evaluate_subexp (element_type, exp, pos, noside);
1557 range_low_type = range_high_type = value_type (elem_val);
1558 range_low = range_high = value_as_long (elem_val);
1559
1560 /* Check types of elements to avoid mixture of elements from
1561 different types. Also check if type of element is "compatible"
1562 with element type of powerset. */
1563 if (range_low_type->code () == TYPE_CODE_RANGE)
1564 range_low_type = TYPE_TARGET_TYPE (range_low_type);
1565 if (range_high_type->code () == TYPE_CODE_RANGE)
1566 range_high_type = TYPE_TARGET_TYPE (range_high_type);
1567 if ((range_low_type->code () != range_high_type->code ())
1568 || (range_low_type->code () == TYPE_CODE_ENUM
1569 && (range_low_type != range_high_type)))
1570 /* different element modes. */
1571 error (_("POWERSET tuple elements of different mode"));
1572 if ((check_type->code () != range_low_type->code ())
1573 || (check_type->code () == TYPE_CODE_ENUM
1574 && range_low_type != check_type))
1575 error (_("incompatible POWERSET tuple elements"));
1576 if (range_low > range_high)
1577 {
1578 warning (_("empty POWERSET tuple range"));
1579 continue;
1580 }
1581 if (range_low < low_bound || range_high > high_bound)
1582 error (_("POWERSET tuple element out of range"));
1583 range_low -= low_bound;
1584 range_high -= low_bound;
1585 for (; range_low <= range_high; range_low++)
1586 {
1587 int bit_index = (unsigned) range_low % TARGET_CHAR_BIT;
1588
1589 if (gdbarch_byte_order (exp->gdbarch) == BFD_ENDIAN_BIG)
1590 bit_index = TARGET_CHAR_BIT - 1 - bit_index;
1591 valaddr[(unsigned) range_low / TARGET_CHAR_BIT]
1592 |= 1 << bit_index;
1593 }
1594 }
1595 return set;
1596 }
1597
1598 argvec = XALLOCAVEC (struct value *, nargs);
1599 for (tem = 0; tem < nargs; tem++)
1600 {
1601 /* Ensure that array expressions are coerced into pointer
1602 objects. */
1603 argvec[tem] = evaluate_subexp_with_coercion (exp, pos, noside);
1604 }
1605 if (noside == EVAL_SKIP)
1606 return eval_skip_value (exp);
1607 return value_array (tem2, tem3, argvec);
1608
1609 case TERNOP_SLICE:
1610 {
1611 struct value *array = evaluate_subexp (nullptr, exp, pos, noside);
1612 struct value *low = evaluate_subexp (nullptr, exp, pos, noside);
1613 struct value *upper = evaluate_subexp (nullptr, exp, pos, noside);
1614 return eval_op_ternop (expect_type, exp, noside, array, low, upper);
1615 }
1616
1617 case TERNOP_COND:
1618 /* Skip third and second args to evaluate the first one. */
1619 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
1620 if (value_logical_not (arg1))
1621 {
1622 evaluate_subexp (nullptr, exp, pos, EVAL_SKIP);
1623 return evaluate_subexp (nullptr, exp, pos, noside);
1624 }
1625 else
1626 {
1627 arg2 = evaluate_subexp (nullptr, exp, pos, noside);
1628 evaluate_subexp (nullptr, exp, pos, EVAL_SKIP);
1629 return arg2;
1630 }
1631
1632 case OP_OBJC_SELECTOR:
1633 { /* Objective C @selector operator. */
1634 char *sel = &exp->elts[pc + 2].string;
1635 int len = longest_to_int (exp->elts[pc + 1].longconst);
1636
1637 (*pos) += 3 + BYTES_TO_EXP_ELEM (len + 1);
1638 if (sel[len] != 0)
1639 sel[len] = 0; /* Make sure it's terminated. */
1640
1641 return eval_op_objc_selector (expect_type, exp, noside, sel);
1642 }
1643
1644 case OP_OBJC_MSGCALL:
1645 { /* Objective C message (method) call. */
1646
1647 CORE_ADDR responds_selector = 0;
1648 CORE_ADDR method_selector = 0;
1649
1650 CORE_ADDR selector = 0;
1651
1652 int struct_return = 0;
1653 enum noside sub_no_side = EVAL_NORMAL;
1654
1655 struct value *msg_send = NULL;
1656 struct value *msg_send_stret = NULL;
1657 int gnu_runtime = 0;
1658
1659 struct value *target = NULL;
1660 struct value *method = NULL;
1661 struct value *called_method = NULL;
1662
1663 struct type *selector_type = NULL;
1664 struct type *long_type;
1665
1666 struct value *ret = NULL;
1667 CORE_ADDR addr = 0;
1668
1669 selector = exp->elts[pc + 1].longconst;
1670 nargs = exp->elts[pc + 2].longconst;
1671 argvec = XALLOCAVEC (struct value *, nargs + 5);
1672
1673 (*pos) += 3;
1674
1675 long_type = builtin_type (exp->gdbarch)->builtin_long;
1676 selector_type = builtin_type (exp->gdbarch)->builtin_data_ptr;
1677
1678 if (noside == EVAL_AVOID_SIDE_EFFECTS)
1679 sub_no_side = EVAL_NORMAL;
1680 else
1681 sub_no_side = noside;
1682
1683 target = evaluate_subexp (selector_type, exp, pos, sub_no_side);
1684
1685 if (value_as_long (target) == 0)
1686 return value_from_longest (long_type, 0);
1687
1688 if (lookup_minimal_symbol ("objc_msg_lookup", 0, 0).minsym)
1689 gnu_runtime = 1;
1690
1691 /* Find the method dispatch (Apple runtime) or method lookup
1692 (GNU runtime) function for Objective-C. These will be used
1693 to lookup the symbol information for the method. If we
1694 can't find any symbol information, then we'll use these to
1695 call the method, otherwise we can call the method
1696 directly. The msg_send_stret function is used in the special
1697 case of a method that returns a structure (Apple runtime
1698 only). */
1699 if (gnu_runtime)
1700 {
1701 type = selector_type;
1702
1703 type = lookup_function_type (type);
1704 type = lookup_pointer_type (type);
1705 type = lookup_function_type (type);
1706 type = lookup_pointer_type (type);
1707
1708 msg_send = find_function_in_inferior ("objc_msg_lookup", NULL);
1709 msg_send_stret
1710 = find_function_in_inferior ("objc_msg_lookup", NULL);
1711
1712 msg_send = value_from_pointer (type, value_as_address (msg_send));
1713 msg_send_stret = value_from_pointer (type,
1714 value_as_address (msg_send_stret));
1715 }
1716 else
1717 {
1718 msg_send = find_function_in_inferior ("objc_msgSend", NULL);
1719 /* Special dispatcher for methods returning structs. */
1720 msg_send_stret
1721 = find_function_in_inferior ("objc_msgSend_stret", NULL);
1722 }
1723
1724 /* Verify the target object responds to this method. The
1725 standard top-level 'Object' class uses a different name for
1726 the verification method than the non-standard, but more
1727 often used, 'NSObject' class. Make sure we check for both. */
1728
1729 responds_selector
1730 = lookup_child_selector (exp->gdbarch, "respondsToSelector:");
1731 if (responds_selector == 0)
1732 responds_selector
1733 = lookup_child_selector (exp->gdbarch, "respondsTo:");
1734
1735 if (responds_selector == 0)
1736 error (_("no 'respondsTo:' or 'respondsToSelector:' method"));
1737
1738 method_selector
1739 = lookup_child_selector (exp->gdbarch, "methodForSelector:");
1740 if (method_selector == 0)
1741 method_selector
1742 = lookup_child_selector (exp->gdbarch, "methodFor:");
1743
1744 if (method_selector == 0)
1745 error (_("no 'methodFor:' or 'methodForSelector:' method"));
1746
1747 /* Call the verification method, to make sure that the target
1748 class implements the desired method. */
1749
1750 argvec[0] = msg_send;
1751 argvec[1] = target;
1752 argvec[2] = value_from_longest (long_type, responds_selector);
1753 argvec[3] = value_from_longest (long_type, selector);
1754 argvec[4] = 0;
1755
1756 ret = call_function_by_hand (argvec[0], NULL, {argvec + 1, 3});
1757 if (gnu_runtime)
1758 {
1759 /* Function objc_msg_lookup returns a pointer. */
1760 argvec[0] = ret;
1761 ret = call_function_by_hand (argvec[0], NULL, {argvec + 1, 3});
1762 }
1763 if (value_as_long (ret) == 0)
1764 error (_("Target does not respond to this message selector."));
1765
1766 /* Call "methodForSelector:" method, to get the address of a
1767 function method that implements this selector for this
1768 class. If we can find a symbol at that address, then we
1769 know the return type, parameter types etc. (that's a good
1770 thing). */
1771
1772 argvec[0] = msg_send;
1773 argvec[1] = target;
1774 argvec[2] = value_from_longest (long_type, method_selector);
1775 argvec[3] = value_from_longest (long_type, selector);
1776 argvec[4] = 0;
1777
1778 ret = call_function_by_hand (argvec[0], NULL, {argvec + 1, 3});
1779 if (gnu_runtime)
1780 {
1781 argvec[0] = ret;
1782 ret = call_function_by_hand (argvec[0], NULL, {argvec + 1, 3});
1783 }
1784
1785 /* ret should now be the selector. */
1786
1787 addr = value_as_long (ret);
1788 if (addr)
1789 {
1790 struct symbol *sym = NULL;
1791
1792 /* The address might point to a function descriptor;
1793 resolve it to the actual code address instead. */
1794 addr = gdbarch_convert_from_func_ptr_addr (exp->gdbarch, addr,
1795 current_top_target ());
1796
1797 /* Is it a high_level symbol? */
1798 sym = find_pc_function (addr);
1799 if (sym != NULL)
1800 method = value_of_variable (sym, 0);
1801 }
1802
1803 /* If we found a method with symbol information, check to see
1804 if it returns a struct. Otherwise assume it doesn't. */
1805
1806 if (method)
1807 {
1808 CORE_ADDR funaddr;
1809 struct type *val_type;
1810
1811 funaddr = find_function_addr (method, &val_type);
1812
1813 block_for_pc (funaddr);
1814
1815 val_type = check_typedef (val_type);
1816
1817 if ((val_type == NULL)
1818 || (val_type->code () == TYPE_CODE_ERROR))
1819 {
1820 if (expect_type != NULL)
1821 val_type = expect_type;
1822 }
1823
1824 struct_return = using_struct_return (exp->gdbarch, method,
1825 val_type);
1826 }
1827 else if (expect_type != NULL)
1828 {
1829 struct_return = using_struct_return (exp->gdbarch, NULL,
1830 check_typedef (expect_type));
1831 }
1832
1833 /* Found a function symbol. Now we will substitute its
1834 value in place of the message dispatcher (obj_msgSend),
1835 so that we call the method directly instead of thru
1836 the dispatcher. The main reason for doing this is that
1837 we can now evaluate the return value and parameter values
1838 according to their known data types, in case we need to
1839 do things like promotion, dereferencing, special handling
1840 of structs and doubles, etc.
1841
1842 We want to use the type signature of 'method', but still
1843 jump to objc_msgSend() or objc_msgSend_stret() to better
1844 mimic the behavior of the runtime. */
1845
1846 if (method)
1847 {
1848 if (value_type (method)->code () != TYPE_CODE_FUNC)
1849 error (_("method address has symbol information "
1850 "with non-function type; skipping"));
1851
1852 /* Create a function pointer of the appropriate type, and
1853 replace its value with the value of msg_send or
1854 msg_send_stret. We must use a pointer here, as
1855 msg_send and msg_send_stret are of pointer type, and
1856 the representation may be different on systems that use
1857 function descriptors. */
1858 if (struct_return)
1859 called_method
1860 = value_from_pointer (lookup_pointer_type (value_type (method)),
1861 value_as_address (msg_send_stret));
1862 else
1863 called_method
1864 = value_from_pointer (lookup_pointer_type (value_type (method)),
1865 value_as_address (msg_send));
1866 }
1867 else
1868 {
1869 if (struct_return)
1870 called_method = msg_send_stret;
1871 else
1872 called_method = msg_send;
1873 }
1874
1875 if (noside == EVAL_SKIP)
1876 return eval_skip_value (exp);
1877
1878 if (noside == EVAL_AVOID_SIDE_EFFECTS)
1879 {
1880 /* If the return type doesn't look like a function type,
1881 call an error. This can happen if somebody tries to
1882 turn a variable into a function call. This is here
1883 because people often want to call, eg, strcmp, which
1884 gdb doesn't know is a function. If gdb isn't asked for
1885 it's opinion (ie. through "whatis"), it won't offer
1886 it. */
1887
1888 struct type *callee_type = value_type (called_method);
1889
1890 if (callee_type && callee_type->code () == TYPE_CODE_PTR)
1891 callee_type = TYPE_TARGET_TYPE (callee_type);
1892 callee_type = TYPE_TARGET_TYPE (callee_type);
1893
1894 if (callee_type)
1895 {
1896 if ((callee_type->code () == TYPE_CODE_ERROR) && expect_type)
1897 return allocate_value (expect_type);
1898 else
1899 return allocate_value (callee_type);
1900 }
1901 else
1902 error (_("Expression of type other than "
1903 "\"method returning ...\" used as a method"));
1904 }
1905
1906 /* Now depending on whether we found a symbol for the method,
1907 we will either call the runtime dispatcher or the method
1908 directly. */
1909
1910 argvec[0] = called_method;
1911 argvec[1] = target;
1912 argvec[2] = value_from_longest (long_type, selector);
1913 /* User-supplied arguments. */
1914 for (tem = 0; tem < nargs; tem++)
1915 argvec[tem + 3] = evaluate_subexp_with_coercion (exp, pos, noside);
1916 argvec[tem + 3] = 0;
1917
1918 auto call_args = gdb::make_array_view (argvec + 1, nargs + 2);
1919
1920 if (gnu_runtime && (method != NULL))
1921 {
1922 /* Function objc_msg_lookup returns a pointer. */
1923 deprecated_set_value_type (argvec[0],
1924 lookup_pointer_type (lookup_function_type (value_type (argvec[0]))));
1925 argvec[0] = call_function_by_hand (argvec[0], NULL, call_args);
1926 }
1927
1928 return call_function_by_hand (argvec[0], NULL, call_args);
1929 }
1930 break;
1931
1932 case OP_FUNCALL:
1933 return evaluate_funcall (expect_type, exp, pos, noside);
1934
1935 case OP_COMPLEX:
1936 /* We have a complex number, There should be 2 floating
1937 point numbers that compose it. */
1938 (*pos) += 2;
1939 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
1940 arg2 = evaluate_subexp (nullptr, exp, pos, noside);
1941
1942 return value_literal_complex (arg1, arg2, exp->elts[pc + 1].type);
1943
1944 case STRUCTOP_STRUCT:
1945 tem = longest_to_int (exp->elts[pc + 1].longconst);
1946 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
1947 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
1948 return eval_op_structop_struct (expect_type, exp, noside, arg1,
1949 &exp->elts[pc + 2].string);
1950
1951 case STRUCTOP_PTR:
1952 tem = longest_to_int (exp->elts[pc + 1].longconst);
1953 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
1954 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
1955 if (noside == EVAL_SKIP)
1956 return eval_skip_value (exp);
1957
1958 /* Check to see if operator '->' has been overloaded. If so replace
1959 arg1 with the value returned by evaluating operator->(). */
1960 while (unop_user_defined_p (op, arg1))
1961 {
1962 struct value *value = NULL;
1963 try
1964 {
1965 value = value_x_unop (arg1, op, noside);
1966 }
1967
1968 catch (const gdb_exception_error &except)
1969 {
1970 if (except.error == NOT_FOUND_ERROR)
1971 break;
1972 else
1973 throw;
1974 }
1975
1976 arg1 = value;
1977 }
1978
1979 /* JYG: if print object is on we need to replace the base type
1980 with rtti type in order to continue on with successful
1981 lookup of member / method only available in the rtti type. */
1982 {
1983 struct type *arg_type = value_type (arg1);
1984 struct type *real_type;
1985 int full, using_enc;
1986 LONGEST top;
1987 struct value_print_options opts;
1988
1989 get_user_print_options (&opts);
1990 if (opts.objectprint && TYPE_TARGET_TYPE (arg_type)
1991 && (TYPE_TARGET_TYPE (arg_type)->code () == TYPE_CODE_STRUCT))
1992 {
1993 real_type = value_rtti_indirect_type (arg1, &full, &top,
1994 &using_enc);
1995 if (real_type)
1996 arg1 = value_cast (real_type, arg1);
1997 }
1998 }
1999
2000 arg3 = value_struct_elt (&arg1, NULL, &exp->elts[pc + 2].string,
2001 NULL, "structure pointer");
2002 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2003 arg3 = value_zero (value_type (arg3), VALUE_LVAL (arg3));
2004 return arg3;
2005
2006 case STRUCTOP_MEMBER:
2007 case STRUCTOP_MPTR:
2008 if (op == STRUCTOP_MEMBER)
2009 arg1 = evaluate_subexp_for_address (exp, pos, noside);
2010 else
2011 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2012
2013 arg2 = evaluate_subexp (nullptr, exp, pos, noside);
2014
2015 if (noside == EVAL_SKIP)
2016 return eval_skip_value (exp);
2017
2018 type = check_typedef (value_type (arg2));
2019 switch (type->code ())
2020 {
2021 case TYPE_CODE_METHODPTR:
2022 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2023 return value_zero (TYPE_TARGET_TYPE (type), not_lval);
2024 else
2025 {
2026 arg2 = cplus_method_ptr_to_value (&arg1, arg2);
2027 gdb_assert (value_type (arg2)->code () == TYPE_CODE_PTR);
2028 return value_ind (arg2);
2029 }
2030
2031 case TYPE_CODE_MEMBERPTR:
2032 /* Now, convert these values to an address. */
2033 arg1 = value_cast_pointers (lookup_pointer_type (TYPE_SELF_TYPE (type)),
2034 arg1, 1);
2035
2036 mem_offset = value_as_long (arg2);
2037
2038 arg3 = value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2039 value_as_long (arg1) + mem_offset);
2040 return value_ind (arg3);
2041
2042 default:
2043 error (_("non-pointer-to-member value used "
2044 "in pointer-to-member construct"));
2045 }
2046
2047 case TYPE_INSTANCE:
2048 {
2049 type_instance_flags flags
2050 = (type_instance_flag_value) longest_to_int (exp->elts[pc + 1].longconst);
2051 nargs = longest_to_int (exp->elts[pc + 2].longconst);
2052 arg_types = (struct type **) alloca (nargs * sizeof (struct type *));
2053 for (ix = 0; ix < nargs; ++ix)
2054 arg_types[ix] = exp->elts[pc + 2 + ix + 1].type;
2055
2056 fake_method fake_expect_type (flags, nargs, arg_types);
2057 *(pos) += 4 + nargs;
2058 return evaluate_subexp_standard (fake_expect_type.type (), exp, pos,
2059 noside);
2060 }
2061
2062 case BINOP_CONCAT:
2063 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
2064 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
2065 return eval_op_concat (expect_type, exp, noside, op, arg1, arg2);
2066
2067 case BINOP_ASSIGN:
2068 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2069 /* Special-case assignments where the left-hand-side is a
2070 convenience variable -- in these, don't bother setting an
2071 expected type. This avoids a weird case where re-assigning a
2072 string or array to an internal variable could error with "Too
2073 many array elements". */
2074 arg2 = evaluate_subexp (VALUE_LVAL (arg1) == lval_internalvar
2075 ? nullptr
2076 : value_type (arg1),
2077 exp, pos, noside);
2078
2079 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
2080 return arg1;
2081 if (binop_user_defined_p (op, arg1, arg2))
2082 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2083 else
2084 return value_assign (arg1, arg2);
2085
2086 case BINOP_ASSIGN_MODIFY:
2087 (*pos) += 2;
2088 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2089 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
2090 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
2091 return arg1;
2092 op = exp->elts[pc + 1].opcode;
2093 if (binop_user_defined_p (op, arg1, arg2))
2094 return value_x_binop (arg1, arg2, BINOP_ASSIGN_MODIFY, op, noside);
2095 else if (op == BINOP_ADD && ptrmath_type_p (exp->language_defn,
2096 value_type (arg1))
2097 && is_integral_type (value_type (arg2)))
2098 arg2 = value_ptradd (arg1, value_as_long (arg2));
2099 else if (op == BINOP_SUB && ptrmath_type_p (exp->language_defn,
2100 value_type (arg1))
2101 && is_integral_type (value_type (arg2)))
2102 arg2 = value_ptradd (arg1, - value_as_long (arg2));
2103 else
2104 {
2105 struct value *tmp = arg1;
2106
2107 /* For shift and integer exponentiation operations,
2108 only promote the first argument. */
2109 if ((op == BINOP_LSH || op == BINOP_RSH || op == BINOP_EXP)
2110 && is_integral_type (value_type (arg2)))
2111 unop_promote (exp->language_defn, exp->gdbarch, &tmp);
2112 else
2113 binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2);
2114
2115 arg2 = value_binop (tmp, arg2, op);
2116 }
2117 return value_assign (arg1, arg2);
2118
2119 case BINOP_ADD:
2120 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
2121 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
2122 if (noside == EVAL_SKIP)
2123 return eval_skip_value (exp);
2124 if (binop_user_defined_p (op, arg1, arg2))
2125 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2126 else if (ptrmath_type_p (exp->language_defn, value_type (arg1))
2127 && is_integral_or_integral_reference (value_type (arg2)))
2128 return value_ptradd (arg1, value_as_long (arg2));
2129 else if (ptrmath_type_p (exp->language_defn, value_type (arg2))
2130 && is_integral_or_integral_reference (value_type (arg1)))
2131 return value_ptradd (arg2, value_as_long (arg1));
2132 else
2133 {
2134 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2135 return value_binop (arg1, arg2, BINOP_ADD);
2136 }
2137
2138 case BINOP_SUB:
2139 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
2140 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
2141 if (noside == EVAL_SKIP)
2142 return eval_skip_value (exp);
2143 if (binop_user_defined_p (op, arg1, arg2))
2144 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2145 else if (ptrmath_type_p (exp->language_defn, value_type (arg1))
2146 && ptrmath_type_p (exp->language_defn, value_type (arg2)))
2147 {
2148 /* FIXME -- should be ptrdiff_t */
2149 type = builtin_type (exp->gdbarch)->builtin_long;
2150 return value_from_longest (type, value_ptrdiff (arg1, arg2));
2151 }
2152 else if (ptrmath_type_p (exp->language_defn, value_type (arg1))
2153 && is_integral_or_integral_reference (value_type (arg2)))
2154 return value_ptradd (arg1, - value_as_long (arg2));
2155 else
2156 {
2157 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2158 return value_binop (arg1, arg2, BINOP_SUB);
2159 }
2160
2161 case BINOP_EXP:
2162 case BINOP_MUL:
2163 case BINOP_DIV:
2164 case BINOP_INTDIV:
2165 case BINOP_REM:
2166 case BINOP_MOD:
2167 case BINOP_LSH:
2168 case BINOP_RSH:
2169 case BINOP_BITWISE_AND:
2170 case BINOP_BITWISE_IOR:
2171 case BINOP_BITWISE_XOR:
2172 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2173 arg2 = evaluate_subexp (nullptr, 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
2179 {
2180 /* If EVAL_AVOID_SIDE_EFFECTS and we're dividing by zero,
2181 fudge arg2 to avoid division-by-zero, the caller is
2182 (theoretically) only looking for the type of the result. */
2183 if (noside == EVAL_AVOID_SIDE_EFFECTS
2184 /* ??? Do we really want to test for BINOP_MOD here?
2185 The implementation of value_binop gives it a well-defined
2186 value. */
2187 && (op == BINOP_DIV
2188 || op == BINOP_INTDIV
2189 || op == BINOP_REM
2190 || op == BINOP_MOD)
2191 && value_logical_not (arg2))
2192 {
2193 struct value *v_one;
2194
2195 v_one = value_one (value_type (arg2));
2196 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &v_one);
2197 return value_binop (arg1, v_one, op);
2198 }
2199 else
2200 {
2201 /* For shift and integer exponentiation operations,
2202 only promote the first argument. */
2203 if ((op == BINOP_LSH || op == BINOP_RSH || op == BINOP_EXP)
2204 && is_integral_type (value_type (arg2)))
2205 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
2206 else
2207 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2208
2209 return value_binop (arg1, arg2, op);
2210 }
2211 }
2212
2213 case BINOP_SUBSCRIPT:
2214 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2215 arg2 = evaluate_subexp (nullptr, exp, pos, noside);
2216 if (noside == EVAL_SKIP)
2217 return eval_skip_value (exp);
2218 if (binop_user_defined_p (op, arg1, arg2))
2219 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2220 else
2221 {
2222 /* If the user attempts to subscript something that is not an
2223 array or pointer type (like a plain int variable for example),
2224 then report this as an error. */
2225
2226 arg1 = coerce_ref (arg1);
2227 type = check_typedef (value_type (arg1));
2228 if (type->code () != TYPE_CODE_ARRAY
2229 && type->code () != TYPE_CODE_PTR)
2230 {
2231 if (type->name ())
2232 error (_("cannot subscript something of type `%s'"),
2233 type->name ());
2234 else
2235 error (_("cannot subscript requested type"));
2236 }
2237
2238 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2239 return value_zero (TYPE_TARGET_TYPE (type), VALUE_LVAL (arg1));
2240 else
2241 return value_subscript (arg1, value_as_long (arg2));
2242 }
2243 case MULTI_SUBSCRIPT:
2244 (*pos) += 2;
2245 nargs = longest_to_int (exp->elts[pc + 1].longconst);
2246 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
2247 argvec = XALLOCAVEC (struct value *, nargs);
2248 for (ix = 0; ix < nargs; ++ix)
2249 argvec[ix] = evaluate_subexp_with_coercion (exp, pos, noside);
2250 if (noside == EVAL_SKIP)
2251 return arg1;
2252 for (ix = 0; ix < nargs; ++ix)
2253 {
2254 arg2 = argvec[ix];
2255
2256 if (binop_user_defined_p (op, arg1, arg2))
2257 {
2258 arg1 = value_x_binop (arg1, arg2, op, OP_NULL, noside);
2259 }
2260 else
2261 {
2262 arg1 = coerce_ref (arg1);
2263 type = check_typedef (value_type (arg1));
2264
2265 switch (type->code ())
2266 {
2267 case TYPE_CODE_PTR:
2268 case TYPE_CODE_ARRAY:
2269 case TYPE_CODE_STRING:
2270 arg1 = value_subscript (arg1, value_as_long (arg2));
2271 break;
2272
2273 default:
2274 if (type->name ())
2275 error (_("cannot subscript something of type `%s'"),
2276 type->name ());
2277 else
2278 error (_("cannot subscript requested type"));
2279 }
2280 }
2281 }
2282 return (arg1);
2283
2284 case BINOP_LOGICAL_AND:
2285 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2286 if (noside == EVAL_SKIP)
2287 {
2288 evaluate_subexp (nullptr, exp, pos, noside);
2289 return eval_skip_value (exp);
2290 }
2291
2292 oldpos = *pos;
2293 arg2 = evaluate_subexp (nullptr, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2294 *pos = oldpos;
2295
2296 if (binop_user_defined_p (op, arg1, arg2))
2297 {
2298 arg2 = evaluate_subexp (nullptr, exp, pos, noside);
2299 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2300 }
2301 else
2302 {
2303 tem = value_logical_not (arg1);
2304 arg2
2305 = evaluate_subexp (nullptr, exp, pos, (tem ? EVAL_SKIP : noside));
2306 type = language_bool_type (exp->language_defn, exp->gdbarch);
2307 return value_from_longest (type,
2308 (LONGEST) (!tem && !value_logical_not (arg2)));
2309 }
2310
2311 case BINOP_LOGICAL_OR:
2312 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2313 if (noside == EVAL_SKIP)
2314 {
2315 evaluate_subexp (nullptr, exp, pos, noside);
2316 return eval_skip_value (exp);
2317 }
2318
2319 oldpos = *pos;
2320 arg2 = evaluate_subexp (nullptr, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2321 *pos = oldpos;
2322
2323 if (binop_user_defined_p (op, arg1, arg2))
2324 {
2325 arg2 = evaluate_subexp (nullptr, exp, pos, noside);
2326 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2327 }
2328 else
2329 {
2330 tem = value_logical_not (arg1);
2331 arg2
2332 = evaluate_subexp (nullptr, exp, pos, (!tem ? EVAL_SKIP : noside));
2333 type = language_bool_type (exp->language_defn, exp->gdbarch);
2334 return value_from_longest (type,
2335 (LONGEST) (!tem || !value_logical_not (arg2)));
2336 }
2337
2338 case BINOP_EQUAL:
2339 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2340 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
2341 if (noside == EVAL_SKIP)
2342 return eval_skip_value (exp);
2343 if (binop_user_defined_p (op, arg1, arg2))
2344 {
2345 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2346 }
2347 else
2348 {
2349 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2350 tem = value_equal (arg1, arg2);
2351 type = language_bool_type (exp->language_defn, exp->gdbarch);
2352 return value_from_longest (type, (LONGEST) tem);
2353 }
2354
2355 case BINOP_NOTEQUAL:
2356 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2357 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
2358 if (noside == EVAL_SKIP)
2359 return eval_skip_value (exp);
2360 if (binop_user_defined_p (op, arg1, arg2))
2361 {
2362 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2363 }
2364 else
2365 {
2366 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2367 tem = value_equal (arg1, arg2);
2368 type = language_bool_type (exp->language_defn, exp->gdbarch);
2369 return value_from_longest (type, (LONGEST) ! tem);
2370 }
2371
2372 case BINOP_LESS:
2373 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2374 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
2375 if (noside == EVAL_SKIP)
2376 return eval_skip_value (exp);
2377 if (binop_user_defined_p (op, arg1, arg2))
2378 {
2379 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2380 }
2381 else
2382 {
2383 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2384 tem = value_less (arg1, arg2);
2385 type = language_bool_type (exp->language_defn, exp->gdbarch);
2386 return value_from_longest (type, (LONGEST) tem);
2387 }
2388
2389 case BINOP_GTR:
2390 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2391 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
2392 if (noside == EVAL_SKIP)
2393 return eval_skip_value (exp);
2394 if (binop_user_defined_p (op, arg1, arg2))
2395 {
2396 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2397 }
2398 else
2399 {
2400 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2401 tem = value_less (arg2, arg1);
2402 type = language_bool_type (exp->language_defn, exp->gdbarch);
2403 return value_from_longest (type, (LONGEST) tem);
2404 }
2405
2406 case BINOP_GEQ:
2407 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2408 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
2409 if (noside == EVAL_SKIP)
2410 return eval_skip_value (exp);
2411 if (binop_user_defined_p (op, arg1, arg2))
2412 {
2413 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2414 }
2415 else
2416 {
2417 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2418 tem = value_less (arg2, arg1) || value_equal (arg1, arg2);
2419 type = language_bool_type (exp->language_defn, exp->gdbarch);
2420 return value_from_longest (type, (LONGEST) tem);
2421 }
2422
2423 case BINOP_LEQ:
2424 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2425 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
2426 if (noside == EVAL_SKIP)
2427 return eval_skip_value (exp);
2428 if (binop_user_defined_p (op, arg1, arg2))
2429 {
2430 return value_x_binop (arg1, arg2, op, OP_NULL, noside);
2431 }
2432 else
2433 {
2434 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
2435 tem = value_less (arg1, arg2) || value_equal (arg1, arg2);
2436 type = language_bool_type (exp->language_defn, exp->gdbarch);
2437 return value_from_longest (type, (LONGEST) tem);
2438 }
2439
2440 case BINOP_REPEAT:
2441 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2442 arg2 = evaluate_subexp (nullptr, exp, pos, noside);
2443 if (noside == EVAL_SKIP)
2444 return eval_skip_value (exp);
2445 type = check_typedef (value_type (arg2));
2446 if (type->code () != TYPE_CODE_INT
2447 && type->code () != TYPE_CODE_ENUM)
2448 error (_("Non-integral right operand for \"@\" operator."));
2449 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2450 {
2451 return allocate_repeat_value (value_type (arg1),
2452 longest_to_int (value_as_long (arg2)));
2453 }
2454 else
2455 return value_repeat (arg1, longest_to_int (value_as_long (arg2)));
2456
2457 case BINOP_COMMA:
2458 evaluate_subexp (nullptr, exp, pos, noside);
2459 return evaluate_subexp (nullptr, exp, pos, noside);
2460
2461 case UNOP_PLUS:
2462 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2463 if (noside == EVAL_SKIP)
2464 return eval_skip_value (exp);
2465 if (unop_user_defined_p (op, arg1))
2466 return value_x_unop (arg1, op, noside);
2467 else
2468 {
2469 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
2470 return value_pos (arg1);
2471 }
2472
2473 case UNOP_NEG:
2474 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2475 if (noside == EVAL_SKIP)
2476 return eval_skip_value (exp);
2477 if (unop_user_defined_p (op, arg1))
2478 return value_x_unop (arg1, op, noside);
2479 else
2480 {
2481 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
2482 return value_neg (arg1);
2483 }
2484
2485 case UNOP_COMPLEMENT:
2486 /* C++: check for and handle destructor names. */
2487
2488 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2489 if (noside == EVAL_SKIP)
2490 return eval_skip_value (exp);
2491 if (unop_user_defined_p (UNOP_COMPLEMENT, arg1))
2492 return value_x_unop (arg1, UNOP_COMPLEMENT, noside);
2493 else
2494 {
2495 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
2496 return value_complement (arg1);
2497 }
2498
2499 case UNOP_LOGICAL_NOT:
2500 arg1 = evaluate_subexp (nullptr, exp, pos, noside);
2501 if (noside == EVAL_SKIP)
2502 return eval_skip_value (exp);
2503 if (unop_user_defined_p (op, arg1))
2504 return value_x_unop (arg1, op, noside);
2505 else
2506 {
2507 type = language_bool_type (exp->language_defn, exp->gdbarch);
2508 return value_from_longest (type, (LONGEST) value_logical_not (arg1));
2509 }
2510
2511 case UNOP_IND:
2512 if (expect_type && expect_type->code () == TYPE_CODE_PTR)
2513 expect_type = TYPE_TARGET_TYPE (check_typedef (expect_type));
2514 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
2515 type = check_typedef (value_type (arg1));
2516 if (type->code () == TYPE_CODE_METHODPTR
2517 || type->code () == TYPE_CODE_MEMBERPTR)
2518 error (_("Attempt to dereference pointer "
2519 "to member without an object"));
2520 if (noside == EVAL_SKIP)
2521 return eval_skip_value (exp);
2522 if (unop_user_defined_p (op, arg1))
2523 return value_x_unop (arg1, op, noside);
2524 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
2525 {
2526 type = check_typedef (value_type (arg1));
2527
2528 /* If the type pointed to is dynamic then in order to resolve the
2529 dynamic properties we must actually dereference the pointer.
2530 There is a risk that this dereference will have side-effects
2531 in the inferior, but being able to print accurate type
2532 information seems worth the risk. */
2533 if ((type->code () != TYPE_CODE_PTR
2534 && !TYPE_IS_REFERENCE (type))
2535 || !is_dynamic_type (TYPE_TARGET_TYPE (type)))
2536 {
2537 if (type->code () == TYPE_CODE_PTR
2538 || TYPE_IS_REFERENCE (type)
2539 /* In C you can dereference an array to get the 1st elt. */
2540 || type->code () == TYPE_CODE_ARRAY)
2541 return value_zero (TYPE_TARGET_TYPE (type),
2542 lval_memory);
2543 else if (type->code () == TYPE_CODE_INT)
2544 /* GDB allows dereferencing an int. */
2545 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
2546 lval_memory);
2547 else
2548 error (_("Attempt to take contents of a non-pointer value."));
2549 }
2550 }
2551
2552 /* Allow * on an integer so we can cast it to whatever we want.
2553 This returns an int, which seems like the most C-like thing to
2554 do. "long long" variables are rare enough that
2555 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
2556 if (type->code () == TYPE_CODE_INT)
2557 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
2558 (CORE_ADDR) value_as_address (arg1));
2559 return value_ind (arg1);
2560
2561 case UNOP_ADDR:
2562 /* C++: check for and handle pointer to members. */
2563
2564 if (noside == EVAL_SKIP)
2565 {
2566 evaluate_subexp (nullptr, exp, pos, EVAL_SKIP);
2567 return eval_skip_value (exp);
2568 }
2569 else
2570 return evaluate_subexp_for_address (exp, pos, noside);
2571
2572 case UNOP_SIZEOF:
2573 if (noside == EVAL_SKIP)
2574 {
2575 evaluate_subexp (nullptr, exp, pos, EVAL_SKIP);
2576 return eval_skip_value (exp);
2577 }
2578 return evaluate_subexp_for_sizeof (exp, pos, noside);
2579
2580 case UNOP_ALIGNOF:
2581 {
2582 type = value_type (
2583 evaluate_subexp (nullptr, exp, pos, EVAL_AVOID_SIDE_EFFECTS));
2584 /* FIXME: This should be size_t. */
2585 struct type *size_type = builtin_type (exp->gdbarch)->builtin_int;
2586 ULONGEST align = type_align (type);
2587 if (align == 0)
2588 error (_("could not determine alignment of type"));
2589 return value_from_longest (size_type, align);
2590 }
2591
2592 case UNOP_CAST:
2593 (*pos) += 2;
2594 type = exp->elts[pc + 1].type;
2595 return evaluate_subexp_for_cast (exp, pos, noside, type);
2596
2597 case UNOP_CAST_TYPE:
2598 arg1 = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2599 type = value_type (arg1);
2600 return evaluate_subexp_for_cast (exp, pos, noside, type);
2601
2602 case UNOP_DYNAMIC_CAST:
2603 arg1 = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2604 type = value_type (arg1);
2605 arg1 = evaluate_subexp (type, exp, pos, noside);
2606 if (noside == EVAL_SKIP)
2607 return eval_skip_value (exp);
2608 return value_dynamic_cast (type, arg1);
2609
2610 case UNOP_REINTERPRET_CAST:
2611 arg1 = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2612 type = value_type (arg1);
2613 arg1 = evaluate_subexp (type, exp, pos, noside);
2614 if (noside == EVAL_SKIP)
2615 return eval_skip_value (exp);
2616 return value_reinterpret_cast (type, arg1);
2617
2618 case UNOP_MEMVAL:
2619 (*pos) += 2;
2620 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
2621 if (noside == EVAL_SKIP)
2622 return eval_skip_value (exp);
2623 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2624 return value_zero (exp->elts[pc + 1].type, lval_memory);
2625 else
2626 return value_at_lazy (exp->elts[pc + 1].type,
2627 value_as_address (arg1));
2628
2629 case UNOP_MEMVAL_TYPE:
2630 arg1 = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2631 type = value_type (arg1);
2632 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
2633 if (noside == EVAL_SKIP)
2634 return eval_skip_value (exp);
2635 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2636 return value_zero (type, lval_memory);
2637 else
2638 return value_at_lazy (type, value_as_address (arg1));
2639
2640 case UNOP_PREINCREMENT:
2641 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
2642 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
2643 return arg1;
2644 else if (unop_user_defined_p (op, arg1))
2645 {
2646 return value_x_unop (arg1, op, noside);
2647 }
2648 else
2649 {
2650 if (ptrmath_type_p (exp->language_defn, value_type (arg1)))
2651 arg2 = value_ptradd (arg1, 1);
2652 else
2653 {
2654 struct value *tmp = arg1;
2655
2656 arg2 = value_one (value_type (arg1));
2657 binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2);
2658 arg2 = value_binop (tmp, arg2, BINOP_ADD);
2659 }
2660
2661 return value_assign (arg1, arg2);
2662 }
2663
2664 case UNOP_PREDECREMENT:
2665 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
2666 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
2667 return arg1;
2668 else if (unop_user_defined_p (op, arg1))
2669 {
2670 return value_x_unop (arg1, op, noside);
2671 }
2672 else
2673 {
2674 if (ptrmath_type_p (exp->language_defn, value_type (arg1)))
2675 arg2 = value_ptradd (arg1, -1);
2676 else
2677 {
2678 struct value *tmp = arg1;
2679
2680 arg2 = value_one (value_type (arg1));
2681 binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2);
2682 arg2 = value_binop (tmp, arg2, BINOP_SUB);
2683 }
2684
2685 return value_assign (arg1, arg2);
2686 }
2687
2688 case UNOP_POSTINCREMENT:
2689 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
2690 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
2691 return arg1;
2692 else if (unop_user_defined_p (op, arg1))
2693 {
2694 return value_x_unop (arg1, op, noside);
2695 }
2696 else
2697 {
2698 arg3 = value_non_lval (arg1);
2699
2700 if (ptrmath_type_p (exp->language_defn, value_type (arg1)))
2701 arg2 = value_ptradd (arg1, 1);
2702 else
2703 {
2704 struct value *tmp = arg1;
2705
2706 arg2 = value_one (value_type (arg1));
2707 binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2);
2708 arg2 = value_binop (tmp, arg2, BINOP_ADD);
2709 }
2710
2711 value_assign (arg1, arg2);
2712 return arg3;
2713 }
2714
2715 case UNOP_POSTDECREMENT:
2716 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
2717 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
2718 return arg1;
2719 else if (unop_user_defined_p (op, arg1))
2720 {
2721 return value_x_unop (arg1, op, noside);
2722 }
2723 else
2724 {
2725 arg3 = value_non_lval (arg1);
2726
2727 if (ptrmath_type_p (exp->language_defn, value_type (arg1)))
2728 arg2 = value_ptradd (arg1, -1);
2729 else
2730 {
2731 struct value *tmp = arg1;
2732
2733 arg2 = value_one (value_type (arg1));
2734 binop_promote (exp->language_defn, exp->gdbarch, &tmp, &arg2);
2735 arg2 = value_binop (tmp, arg2, BINOP_SUB);
2736 }
2737
2738 value_assign (arg1, arg2);
2739 return arg3;
2740 }
2741
2742 case OP_THIS:
2743 (*pos) += 1;
2744 return value_of_this (exp->language_defn);
2745
2746 case OP_TYPE:
2747 /* The value is not supposed to be used. This is here to make it
2748 easier to accommodate expressions that contain types. */
2749 (*pos) += 2;
2750 if (noside == EVAL_SKIP)
2751 return eval_skip_value (exp);
2752 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
2753 return allocate_value (exp->elts[pc + 1].type);
2754 else
2755 error (_("Attempt to use a type name as an expression"));
2756
2757 case OP_TYPEOF:
2758 case OP_DECLTYPE:
2759 if (noside == EVAL_SKIP)
2760 {
2761 evaluate_subexp (nullptr, exp, pos, EVAL_SKIP);
2762 return eval_skip_value (exp);
2763 }
2764 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
2765 {
2766 enum exp_opcode sub_op = exp->elts[*pos].opcode;
2767 struct value *result;
2768
2769 result = evaluate_subexp (nullptr, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2770
2771 /* 'decltype' has special semantics for lvalues. */
2772 if (op == OP_DECLTYPE
2773 && (sub_op == BINOP_SUBSCRIPT
2774 || sub_op == STRUCTOP_MEMBER
2775 || sub_op == STRUCTOP_MPTR
2776 || sub_op == UNOP_IND
2777 || sub_op == STRUCTOP_STRUCT
2778 || sub_op == STRUCTOP_PTR
2779 || sub_op == OP_SCOPE))
2780 {
2781 type = value_type (result);
2782
2783 if (!TYPE_IS_REFERENCE (type))
2784 {
2785 type = lookup_lvalue_reference_type (type);
2786 result = allocate_value (type);
2787 }
2788 }
2789
2790 return result;
2791 }
2792 else
2793 error (_("Attempt to use a type as an expression"));
2794
2795 case OP_TYPEID:
2796 {
2797 struct value *result;
2798 enum exp_opcode sub_op = exp->elts[*pos].opcode;
2799
2800 if (sub_op == OP_TYPE || sub_op == OP_DECLTYPE || sub_op == OP_TYPEOF)
2801 result = evaluate_subexp (nullptr, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2802 else
2803 result = evaluate_subexp (nullptr, exp, pos, noside);
2804
2805 if (noside != EVAL_NORMAL)
2806 return allocate_value (cplus_typeid_type (exp->gdbarch));
2807
2808 return cplus_typeid (result);
2809 }
2810
2811 default:
2812 /* Removing this case and compiling with gcc -Wall reveals that
2813 a lot of cases are hitting this case. Some of these should
2814 probably be removed from expression.h; others are legitimate
2815 expressions which are (apparently) not fully implemented.
2816
2817 If there are any cases landing here which mean a user error,
2818 then they should be separate cases, with more descriptive
2819 error messages. */
2820
2821 error (_("GDB does not (yet) know how to "
2822 "evaluate that kind of expression"));
2823 }
2824
2825 gdb_assert_not_reached ("missed return?");
2826 }
2827 \f
2828 /* Evaluate a subexpression of EXP, at index *POS,
2829 and return the address of that subexpression.
2830 Advance *POS over the subexpression.
2831 If the subexpression isn't an lvalue, get an error.
2832 NOSIDE may be EVAL_AVOID_SIDE_EFFECTS;
2833 then only the type of the result need be correct. */
2834
2835 static struct value *
2836 evaluate_subexp_for_address (struct expression *exp, int *pos,
2837 enum noside noside)
2838 {
2839 enum exp_opcode op;
2840 int pc;
2841 struct symbol *var;
2842 struct value *x;
2843 int tem;
2844
2845 pc = (*pos);
2846 op = exp->elts[pc].opcode;
2847
2848 switch (op)
2849 {
2850 case UNOP_IND:
2851 (*pos)++;
2852 x = evaluate_subexp (nullptr, exp, pos, noside);
2853
2854 /* We can't optimize out "&*" if there's a user-defined operator*. */
2855 if (unop_user_defined_p (op, x))
2856 {
2857 x = value_x_unop (x, op, noside);
2858 goto default_case_after_eval;
2859 }
2860
2861 return coerce_array (x);
2862
2863 case UNOP_MEMVAL:
2864 (*pos) += 3;
2865 return value_cast (lookup_pointer_type (exp->elts[pc + 1].type),
2866 evaluate_subexp (nullptr, exp, pos, noside));
2867
2868 case UNOP_MEMVAL_TYPE:
2869 {
2870 struct type *type;
2871
2872 (*pos) += 1;
2873 x = evaluate_subexp (nullptr, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
2874 type = value_type (x);
2875 return value_cast (lookup_pointer_type (type),
2876 evaluate_subexp (nullptr, exp, pos, noside));
2877 }
2878
2879 case OP_VAR_VALUE:
2880 var = exp->elts[pc + 2].symbol;
2881
2882 /* C++: The "address" of a reference should yield the address
2883 * of the object pointed to. Let value_addr() deal with it. */
2884 if (TYPE_IS_REFERENCE (SYMBOL_TYPE (var)))
2885 goto default_case;
2886
2887 (*pos) += 4;
2888 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2889 {
2890 struct type *type =
2891 lookup_pointer_type (SYMBOL_TYPE (var));
2892 enum address_class sym_class = SYMBOL_CLASS (var);
2893
2894 if (sym_class == LOC_CONST
2895 || sym_class == LOC_CONST_BYTES
2896 || sym_class == LOC_REGISTER)
2897 error (_("Attempt to take address of register or constant."));
2898
2899 return
2900 value_zero (type, not_lval);
2901 }
2902 else
2903 return address_of_variable (var, exp->elts[pc + 1].block);
2904
2905 case OP_VAR_MSYM_VALUE:
2906 {
2907 (*pos) += 4;
2908
2909 value *val = evaluate_var_msym_value (noside,
2910 exp->elts[pc + 1].objfile,
2911 exp->elts[pc + 2].msymbol);
2912 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2913 {
2914 struct type *type = lookup_pointer_type (value_type (val));
2915 return value_zero (type, not_lval);
2916 }
2917 else
2918 return value_addr (val);
2919 }
2920
2921 case OP_SCOPE:
2922 tem = longest_to_int (exp->elts[pc + 2].longconst);
2923 (*pos) += 5 + BYTES_TO_EXP_ELEM (tem + 1);
2924 x = value_aggregate_elt (exp->elts[pc + 1].type,
2925 &exp->elts[pc + 3].string,
2926 NULL, 1, noside);
2927 if (x == NULL)
2928 error (_("There is no field named %s"), &exp->elts[pc + 3].string);
2929 return x;
2930
2931 default:
2932 default_case:
2933 x = evaluate_subexp (nullptr, exp, pos, noside);
2934 default_case_after_eval:
2935 if (noside == EVAL_AVOID_SIDE_EFFECTS)
2936 {
2937 struct type *type = check_typedef (value_type (x));
2938
2939 if (TYPE_IS_REFERENCE (type))
2940 return value_zero (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2941 not_lval);
2942 else if (VALUE_LVAL (x) == lval_memory || value_must_coerce_to_target (x))
2943 return value_zero (lookup_pointer_type (value_type (x)),
2944 not_lval);
2945 else
2946 error (_("Attempt to take address of "
2947 "value not located in memory."));
2948 }
2949 return value_addr (x);
2950 }
2951 }
2952
2953 /* Evaluate like `evaluate_subexp' except coercing arrays to pointers.
2954 When used in contexts where arrays will be coerced anyway, this is
2955 equivalent to `evaluate_subexp' but much faster because it avoids
2956 actually fetching array contents (perhaps obsolete now that we have
2957 value_lazy()).
2958
2959 Note that we currently only do the coercion for C expressions, where
2960 arrays are zero based and the coercion is correct. For other languages,
2961 with nonzero based arrays, coercion loses. Use CAST_IS_CONVERSION
2962 to decide if coercion is appropriate. */
2963
2964 struct value *
2965 evaluate_subexp_with_coercion (struct expression *exp,
2966 int *pos, enum noside noside)
2967 {
2968 enum exp_opcode op;
2969 int pc;
2970 struct value *val;
2971 struct symbol *var;
2972 struct type *type;
2973
2974 pc = (*pos);
2975 op = exp->elts[pc].opcode;
2976
2977 switch (op)
2978 {
2979 case OP_VAR_VALUE:
2980 var = exp->elts[pc + 2].symbol;
2981 type = check_typedef (SYMBOL_TYPE (var));
2982 if (type->code () == TYPE_CODE_ARRAY
2983 && !type->is_vector ()
2984 && CAST_IS_CONVERSION (exp->language_defn))
2985 {
2986 (*pos) += 4;
2987 val = address_of_variable (var, exp->elts[pc + 1].block);
2988 return value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2989 val);
2990 }
2991 /* FALLTHROUGH */
2992
2993 default:
2994 return evaluate_subexp (nullptr, exp, pos, noside);
2995 }
2996 }
2997
2998 /* Evaluate a subexpression of EXP, at index *POS,
2999 and return a value for the size of that subexpression.
3000 Advance *POS over the subexpression. If NOSIDE is EVAL_NORMAL
3001 we allow side-effects on the operand if its type is a variable
3002 length array. */
3003
3004 static struct value *
3005 evaluate_subexp_for_sizeof (struct expression *exp, int *pos,
3006 enum noside noside)
3007 {
3008 /* FIXME: This should be size_t. */
3009 struct type *size_type = builtin_type (exp->gdbarch)->builtin_int;
3010 enum exp_opcode op;
3011 int pc;
3012 struct type *type;
3013 struct value *val;
3014
3015 pc = (*pos);
3016 op = exp->elts[pc].opcode;
3017
3018 switch (op)
3019 {
3020 /* This case is handled specially
3021 so that we avoid creating a value for the result type.
3022 If the result type is very big, it's desirable not to
3023 create a value unnecessarily. */
3024 case UNOP_IND:
3025 (*pos)++;
3026 val = evaluate_subexp (nullptr, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
3027 type = check_typedef (value_type (val));
3028 if (type->code () != TYPE_CODE_PTR
3029 && !TYPE_IS_REFERENCE (type)
3030 && type->code () != TYPE_CODE_ARRAY)
3031 error (_("Attempt to take contents of a non-pointer value."));
3032 type = TYPE_TARGET_TYPE (type);
3033 if (is_dynamic_type (type))
3034 type = value_type (value_ind (val));
3035 return value_from_longest (size_type, (LONGEST) TYPE_LENGTH (type));
3036
3037 case UNOP_MEMVAL:
3038 (*pos) += 3;
3039 type = exp->elts[pc + 1].type;
3040 break;
3041
3042 case UNOP_MEMVAL_TYPE:
3043 (*pos) += 1;
3044 val = evaluate_subexp (NULL, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
3045 type = value_type (val);
3046 break;
3047
3048 case OP_VAR_VALUE:
3049 type = SYMBOL_TYPE (exp->elts[pc + 2].symbol);
3050 if (is_dynamic_type (type))
3051 {
3052 val = evaluate_subexp (nullptr, exp, pos, EVAL_NORMAL);
3053 type = value_type (val);
3054 if (type->code () == TYPE_CODE_ARRAY)
3055 {
3056 if (type_not_allocated (type) || type_not_associated (type))
3057 return value_zero (size_type, not_lval);
3058 else if (is_dynamic_type (type->index_type ())
3059 && type->bounds ()->high.kind () == PROP_UNDEFINED)
3060 return allocate_optimized_out_value (size_type);
3061 }
3062 }
3063 else
3064 (*pos) += 4;
3065 break;
3066
3067 case OP_VAR_MSYM_VALUE:
3068 {
3069 (*pos) += 4;
3070
3071 minimal_symbol *msymbol = exp->elts[pc + 2].msymbol;
3072 value *mval = evaluate_var_msym_value (noside,
3073 exp->elts[pc + 1].objfile,
3074 msymbol);
3075
3076 type = value_type (mval);
3077 if (type->code () == TYPE_CODE_ERROR)
3078 error_unknown_type (msymbol->print_name ());
3079
3080 return value_from_longest (size_type, TYPE_LENGTH (type));
3081 }
3082 break;
3083
3084 /* Deal with the special case if NOSIDE is EVAL_NORMAL and the resulting
3085 type of the subscript is a variable length array type. In this case we
3086 must re-evaluate the right hand side of the subscription to allow
3087 side-effects. */
3088 case BINOP_SUBSCRIPT:
3089 if (noside == EVAL_NORMAL)
3090 {
3091 int npc = (*pos) + 1;
3092
3093 val = evaluate_subexp (nullptr, exp, &npc, EVAL_AVOID_SIDE_EFFECTS);
3094 type = check_typedef (value_type (val));
3095 if (type->code () == TYPE_CODE_ARRAY)
3096 {
3097 type = check_typedef (TYPE_TARGET_TYPE (type));
3098 if (type->code () == TYPE_CODE_ARRAY)
3099 {
3100 type = type->index_type ();
3101 /* Only re-evaluate the right hand side if the resulting type
3102 is a variable length type. */
3103 if (type->bounds ()->flag_bound_evaluated)
3104 {
3105 val = evaluate_subexp (nullptr, exp, pos, EVAL_NORMAL);
3106 return value_from_longest
3107 (size_type, (LONGEST) TYPE_LENGTH (value_type (val)));
3108 }
3109 }
3110 }
3111 }
3112
3113 /* Fall through. */
3114
3115 default:
3116 val = evaluate_subexp (nullptr, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
3117 type = value_type (val);
3118 break;
3119 }
3120
3121 /* $5.3.3/2 of the C++ Standard (n3290 draft) says of sizeof:
3122 "When applied to a reference or a reference type, the result is
3123 the size of the referenced type." */
3124 type = check_typedef (type);
3125 if (exp->language_defn->la_language == language_cplus
3126 && (TYPE_IS_REFERENCE (type)))
3127 type = check_typedef (TYPE_TARGET_TYPE (type));
3128 return value_from_longest (size_type, (LONGEST) TYPE_LENGTH (type));
3129 }
3130
3131 /* Evaluate a subexpression of EXP, at index *POS, and return a value
3132 for that subexpression cast to TO_TYPE. Advance *POS over the
3133 subexpression. */
3134
3135 static value *
3136 evaluate_subexp_for_cast (expression *exp, int *pos,
3137 enum noside noside,
3138 struct type *to_type)
3139 {
3140 int pc = *pos;
3141
3142 /* Don't let symbols be evaluated with evaluate_subexp because that
3143 throws an "unknown type" error for no-debug data symbols.
3144 Instead, we want the cast to reinterpret the symbol. */
3145 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE
3146 || exp->elts[pc].opcode == OP_VAR_VALUE)
3147 {
3148 (*pos) += 4;
3149
3150 value *val;
3151 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE)
3152 {
3153 if (noside == EVAL_AVOID_SIDE_EFFECTS)
3154 return value_zero (to_type, not_lval);
3155
3156 val = evaluate_var_msym_value (noside,
3157 exp->elts[pc + 1].objfile,
3158 exp->elts[pc + 2].msymbol);
3159 }
3160 else
3161 val = evaluate_var_value (noside,
3162 exp->elts[pc + 1].block,
3163 exp->elts[pc + 2].symbol);
3164
3165 if (noside == EVAL_SKIP)
3166 return eval_skip_value (exp);
3167
3168 val = value_cast (to_type, val);
3169
3170 /* Don't allow e.g. '&(int)var_with_no_debug_info'. */
3171 if (VALUE_LVAL (val) == lval_memory)
3172 {
3173 if (value_lazy (val))
3174 value_fetch_lazy (val);
3175 VALUE_LVAL (val) = not_lval;
3176 }
3177 return val;
3178 }
3179
3180 value *val = evaluate_subexp (to_type, exp, pos, noside);
3181 if (noside == EVAL_SKIP)
3182 return eval_skip_value (exp);
3183 return value_cast (to_type, val);
3184 }
3185
3186 /* Parse a type expression in the string [P..P+LENGTH). */
3187
3188 struct type *
3189 parse_and_eval_type (const char *p, int length)
3190 {
3191 char *tmp = (char *) alloca (length + 4);
3192
3193 tmp[0] = '(';
3194 memcpy (tmp + 1, p, length);
3195 tmp[length + 1] = ')';
3196 tmp[length + 2] = '0';
3197 tmp[length + 3] = '\0';
3198 expression_up expr = parse_expression (tmp);
3199 if (expr->first_opcode () != UNOP_CAST)
3200 error (_("Internal error in eval_type."));
3201 return expr->elts[1].type;
3202 }
This page took 0.124152 seconds and 5 git commands to generate.