Commit | Line | Data |
---|---|---|
bd5635a1 | 1 | /* Evaluate expressions for GDB. |
e17960fb | 2 | Copyright 1986, 1987, 1989, 1991, 1992 Free Software Foundation, Inc. |
bd5635a1 RP |
3 | |
4 | This file is part of GDB. | |
5 | ||
2ccb3837 | 6 | This program is free software; you can redistribute it and/or modify |
bd5635a1 | 7 | it under the terms of the GNU General Public License as published by |
2ccb3837 JG |
8 | the Free Software Foundation; either version 2 of the License, or |
9 | (at your option) any later version. | |
bd5635a1 | 10 | |
2ccb3837 | 11 | This program is distributed in the hope that it will be useful, |
bd5635a1 RP |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
2ccb3837 JG |
17 | along with this program; if not, write to the Free Software |
18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
bd5635a1 RP |
19 | |
20 | #include "defs.h" | |
bd5635a1 | 21 | #include "symtab.h" |
01be6913 | 22 | #include "gdbtypes.h" |
bd5635a1 RP |
23 | #include "value.h" |
24 | #include "expression.h" | |
25 | #include "target.h" | |
2ccb3837 | 26 | #include "frame.h" |
bd5635a1 | 27 | |
01be6913 PB |
28 | /* Values of NOSIDE argument to eval_subexp. */ |
29 | enum noside | |
30 | { EVAL_NORMAL, | |
31 | EVAL_SKIP, /* Only effect is to increment pos. */ | |
32 | EVAL_AVOID_SIDE_EFFECTS /* Don't modify any variables or | |
33 | call any functions. The value | |
34 | returned will have the correct | |
35 | type, and will have an | |
36 | approximately correct lvalue | |
37 | type (inaccuracy: anything that is | |
38 | listed as being in a register in | |
39 | the function in which it was | |
40 | declared will be lval_register). */ | |
41 | }; | |
42 | ||
43 | /* Prototypes for local functions. */ | |
44 | ||
45 | static value | |
46 | evaluate_subexp_for_sizeof PARAMS ((struct expression *, int *)); | |
47 | ||
48 | static value | |
49 | evaluate_subexp_with_coercion PARAMS ((struct expression *, int *, | |
50 | enum noside)); | |
51 | ||
52 | static value | |
53 | evaluate_subexp_for_address PARAMS ((struct expression *, int *, | |
54 | enum noside)); | |
55 | ||
56 | static value | |
57 | evaluate_subexp PARAMS ((struct type *, struct expression *, int *, | |
58 | enum noside)); | |
bd5635a1 RP |
59 | |
60 | \f | |
61 | /* Parse the string EXP as a C expression, evaluate it, | |
62 | and return the result as a number. */ | |
63 | ||
64 | CORE_ADDR | |
65 | parse_and_eval_address (exp) | |
66 | char *exp; | |
67 | { | |
2ccb3837 | 68 | struct expression *expr = parse_expression (exp); |
bd5635a1 | 69 | register CORE_ADDR addr; |
01be6913 PB |
70 | register struct cleanup *old_chain = |
71 | make_cleanup (free_current_contents, &expr); | |
bd5635a1 | 72 | |
2ccb3837 | 73 | addr = value_as_pointer (evaluate_expression (expr)); |
bd5635a1 RP |
74 | do_cleanups (old_chain); |
75 | return addr; | |
76 | } | |
77 | ||
78 | /* Like parse_and_eval_address but takes a pointer to a char * variable | |
79 | and advanced that variable across the characters parsed. */ | |
80 | ||
81 | CORE_ADDR | |
82 | parse_and_eval_address_1 (expptr) | |
83 | char **expptr; | |
84 | { | |
2ccb3837 | 85 | struct expression *expr = parse_exp_1 (expptr, (struct block *)0, 0); |
bd5635a1 | 86 | register CORE_ADDR addr; |
01be6913 PB |
87 | register struct cleanup *old_chain = |
88 | make_cleanup (free_current_contents, &expr); | |
bd5635a1 | 89 | |
2ccb3837 | 90 | addr = value_as_pointer (evaluate_expression (expr)); |
bd5635a1 RP |
91 | do_cleanups (old_chain); |
92 | return addr; | |
93 | } | |
94 | ||
95 | value | |
96 | parse_and_eval (exp) | |
97 | char *exp; | |
98 | { | |
2ccb3837 | 99 | struct expression *expr = parse_expression (exp); |
bd5635a1 RP |
100 | register value val; |
101 | register struct cleanup *old_chain | |
102 | = make_cleanup (free_current_contents, &expr); | |
103 | ||
104 | val = evaluate_expression (expr); | |
105 | do_cleanups (old_chain); | |
106 | return val; | |
107 | } | |
108 | ||
109 | /* Parse up to a comma (or to a closeparen) | |
110 | in the string EXPP as an expression, evaluate it, and return the value. | |
111 | EXPP is advanced to point to the comma. */ | |
112 | ||
113 | value | |
114 | parse_to_comma_and_eval (expp) | |
115 | char **expp; | |
116 | { | |
2ccb3837 | 117 | struct expression *expr = parse_exp_1 (expp, (struct block *) 0, 1); |
bd5635a1 RP |
118 | register value val; |
119 | register struct cleanup *old_chain | |
120 | = make_cleanup (free_current_contents, &expr); | |
121 | ||
122 | val = evaluate_expression (expr); | |
123 | do_cleanups (old_chain); | |
124 | return val; | |
125 | } | |
126 | \f | |
127 | /* Evaluate an expression in internal prefix form | |
0a5d35ed | 128 | such as is constructed by parse.y. |
bd5635a1 RP |
129 | |
130 | See expression.h for info on the format of an expression. */ | |
131 | ||
132 | static value evaluate_subexp (); | |
133 | static value evaluate_subexp_for_address (); | |
134 | static value evaluate_subexp_for_sizeof (); | |
135 | static value evaluate_subexp_with_coercion (); | |
136 | ||
bd5635a1 RP |
137 | value |
138 | evaluate_expression (exp) | |
139 | struct expression *exp; | |
140 | { | |
141 | int pc = 0; | |
142 | return evaluate_subexp (NULL_TYPE, exp, &pc, EVAL_NORMAL); | |
143 | } | |
144 | ||
145 | /* Evaluate an expression, avoiding all memory references | |
146 | and getting a value whose type alone is correct. */ | |
147 | ||
148 | value | |
149 | evaluate_type (exp) | |
150 | struct expression *exp; | |
151 | { | |
152 | int pc = 0; | |
153 | return evaluate_subexp (NULL_TYPE, exp, &pc, EVAL_AVOID_SIDE_EFFECTS); | |
154 | } | |
155 | ||
156 | static value | |
157 | evaluate_subexp (expect_type, exp, pos, noside) | |
158 | struct type *expect_type; | |
159 | register struct expression *exp; | |
160 | register int *pos; | |
161 | enum noside noside; | |
162 | { | |
163 | enum exp_opcode op; | |
164 | int tem; | |
165 | register int pc, pc2, oldpos; | |
166 | register value arg1, arg2, arg3; | |
01be6913 | 167 | struct type *type; |
bd5635a1 RP |
168 | int nargs; |
169 | value *argvec; | |
170 | ||
171 | pc = (*pos)++; | |
172 | op = exp->elts[pc].opcode; | |
173 | ||
174 | switch (op) | |
175 | { | |
176 | case OP_SCOPE: | |
177 | tem = strlen (&exp->elts[pc + 2].string); | |
178 | (*pos) += 3 + ((tem + sizeof (union exp_element)) | |
179 | / sizeof (union exp_element)); | |
01be6913 | 180 | arg1 = value_struct_elt_for_reference (exp->elts[pc + 1].type, |
8f86a4e4 | 181 | 0, |
01be6913 PB |
182 | exp->elts[pc + 1].type, |
183 | &exp->elts[pc + 2].string, | |
184 | expect_type); | |
5f00ca54 JK |
185 | if (arg1 == NULL) |
186 | error ("There is no field named %s", &exp->elts[pc + 2].string); | |
187 | return arg1; | |
bd5635a1 RP |
188 | |
189 | case OP_LONG: | |
190 | (*pos) += 3; | |
2ccb3837 | 191 | return value_from_longest (exp->elts[pc + 1].type, |
bd5635a1 RP |
192 | exp->elts[pc + 2].longconst); |
193 | ||
194 | case OP_DOUBLE: | |
195 | (*pos) += 3; | |
196 | return value_from_double (exp->elts[pc + 1].type, | |
197 | exp->elts[pc + 2].doubleconst); | |
198 | ||
199 | case OP_VAR_VALUE: | |
200 | (*pos) += 2; | |
201 | if (noside == EVAL_SKIP) | |
202 | goto nosideret; | |
203 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
204 | { | |
205 | struct symbol * sym = exp->elts[pc + 1].symbol; | |
206 | enum lval_type lv; | |
207 | ||
208 | switch (SYMBOL_CLASS (sym)) | |
209 | { | |
210 | case LOC_CONST: | |
211 | case LOC_LABEL: | |
212 | case LOC_CONST_BYTES: | |
213 | lv = not_lval; | |
214 | break; | |
215 | ||
216 | case LOC_REGISTER: | |
217 | case LOC_REGPARM: | |
218 | lv = lval_register; | |
219 | break; | |
220 | ||
221 | default: | |
222 | lv = lval_memory; | |
223 | break; | |
224 | } | |
225 | ||
226 | return value_zero (SYMBOL_TYPE (sym), lv); | |
227 | } | |
228 | else | |
229 | return value_of_variable (exp->elts[pc + 1].symbol); | |
230 | ||
231 | case OP_LAST: | |
232 | (*pos) += 2; | |
2ccb3837 JG |
233 | return |
234 | access_value_history (longest_to_int (exp->elts[pc + 1].longconst)); | |
bd5635a1 RP |
235 | |
236 | case OP_REGISTER: | |
237 | (*pos) += 2; | |
2ccb3837 | 238 | return value_of_register (longest_to_int (exp->elts[pc + 1].longconst)); |
bd5635a1 | 239 | |
e58de8a2 FF |
240 | case OP_BOOL: |
241 | (*pos) += 2; | |
242 | return value_from_longest (builtin_type_chill_bool, | |
243 | exp->elts[pc + 1].longconst); | |
244 | ||
bd5635a1 RP |
245 | case OP_INTERNALVAR: |
246 | (*pos) += 2; | |
247 | return value_of_internalvar (exp->elts[pc + 1].internalvar); | |
248 | ||
249 | case OP_STRING: | |
250 | tem = strlen (&exp->elts[pc + 1].string); | |
251 | (*pos) += 2 + ((tem + sizeof (union exp_element)) | |
252 | / sizeof (union exp_element)); | |
253 | if (noside == EVAL_SKIP) | |
254 | goto nosideret; | |
255 | return value_string (&exp->elts[pc + 1].string, tem); | |
256 | ||
257 | case TERNOP_COND: | |
258 | /* Skip third and second args to evaluate the first one. */ | |
259 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
e58de8a2 | 260 | if (value_logical_not (arg1)) |
bd5635a1 RP |
261 | { |
262 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
263 | return evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
264 | } | |
265 | else | |
266 | { | |
267 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
268 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
269 | return arg2; | |
270 | } | |
271 | ||
272 | case OP_FUNCALL: | |
273 | (*pos) += 2; | |
274 | op = exp->elts[*pos].opcode; | |
275 | if (op == STRUCTOP_MEMBER || op == STRUCTOP_MPTR) | |
276 | { | |
277 | int fnptr; | |
278 | ||
2ccb3837 | 279 | nargs = longest_to_int (exp->elts[pc + 1].longconst) + 1; |
bd5635a1 RP |
280 | /* First, evaluate the structure into arg2 */ |
281 | pc2 = (*pos)++; | |
282 | ||
283 | if (noside == EVAL_SKIP) | |
284 | goto nosideret; | |
285 | ||
286 | if (op == STRUCTOP_MEMBER) | |
287 | { | |
288 | arg2 = evaluate_subexp_for_address (exp, pos, noside); | |
289 | } | |
290 | else | |
291 | { | |
292 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
293 | } | |
294 | ||
295 | /* If the function is a virtual function, then the | |
296 | aggregate value (providing the structure) plays | |
297 | its part by providing the vtable. Otherwise, | |
298 | it is just along for the ride: call the function | |
299 | directly. */ | |
300 | ||
301 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
302 | ||
2ccb3837 | 303 | fnptr = longest_to_int (value_as_long (arg1)); |
35fcebce PB |
304 | |
305 | if (METHOD_PTR_IS_VIRTUAL(fnptr)) | |
bd5635a1 | 306 | { |
35fcebce | 307 | int fnoffset = METHOD_PTR_TO_VOFFSET(fnptr); |
bd5635a1 | 308 | struct type *basetype; |
35fcebce PB |
309 | struct type *domain_type = |
310 | TYPE_DOMAIN_TYPE (TYPE_TARGET_TYPE (VALUE_TYPE (arg1))); | |
bd5635a1 RP |
311 | int i, j; |
312 | basetype = TYPE_TARGET_TYPE (VALUE_TYPE (arg2)); | |
35fcebce PB |
313 | if (domain_type != basetype) |
314 | arg2 = value_cast(lookup_pointer_type (domain_type), arg2); | |
315 | basetype = TYPE_VPTR_BASETYPE (domain_type); | |
bd5635a1 RP |
316 | for (i = TYPE_NFN_FIELDS (basetype) - 1; i >= 0; i--) |
317 | { | |
318 | struct fn_field *f = TYPE_FN_FIELDLIST1 (basetype, i); | |
319 | /* If one is virtual, then all are virtual. */ | |
320 | if (TYPE_FN_FIELD_VIRTUAL_P (f, 0)) | |
321 | for (j = TYPE_FN_FIELDLIST_LENGTH (basetype, i) - 1; j >= 0; --j) | |
35fcebce | 322 | if (TYPE_FN_FIELD_VOFFSET (f, j) == fnoffset) |
bd5635a1 | 323 | { |
35fcebce PB |
324 | value temp = value_ind (arg2); |
325 | arg1 = value_virtual_fn_field (&temp, f, j, domain_type, 0); | |
326 | arg2 = value_addr (temp); | |
bd5635a1 RP |
327 | goto got_it; |
328 | } | |
329 | } | |
330 | if (i < 0) | |
35fcebce | 331 | error ("virtual function at index %d not found", fnoffset); |
bd5635a1 RP |
332 | } |
333 | else | |
334 | { | |
335 | VALUE_TYPE (arg1) = lookup_pointer_type (TYPE_TARGET_TYPE (VALUE_TYPE (arg1))); | |
336 | } | |
337 | got_it: | |
338 | ||
339 | /* Now, say which argument to start evaluating from */ | |
340 | tem = 2; | |
341 | } | |
342 | else if (op == STRUCTOP_STRUCT || op == STRUCTOP_PTR) | |
343 | { | |
344 | /* Hair for method invocations */ | |
345 | int tem2; | |
346 | ||
2ccb3837 | 347 | nargs = longest_to_int (exp->elts[pc + 1].longconst) + 1; |
bd5635a1 RP |
348 | /* First, evaluate the structure into arg2 */ |
349 | pc2 = (*pos)++; | |
e58de8a2 FF |
350 | tem2 = strlen (&exp->elts[pc2 + 1].string); |
351 | *pos += 2 + (tem2 + sizeof (union exp_element)) / sizeof (union exp_element); | |
bd5635a1 RP |
352 | if (noside == EVAL_SKIP) |
353 | goto nosideret; | |
354 | ||
355 | if (op == STRUCTOP_STRUCT) | |
356 | { | |
357 | arg2 = evaluate_subexp_for_address (exp, pos, noside); | |
358 | } | |
359 | else | |
360 | { | |
361 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
362 | } | |
363 | /* Now, say which argument to start evaluating from */ | |
364 | tem = 2; | |
365 | } | |
366 | else | |
367 | { | |
2ccb3837 | 368 | nargs = longest_to_int (exp->elts[pc + 1].longconst); |
bd5635a1 RP |
369 | tem = 0; |
370 | } | |
371 | argvec = (value *) alloca (sizeof (value) * (nargs + 2)); | |
372 | for (; tem <= nargs; tem++) | |
373 | /* Ensure that array expressions are coerced into pointer objects. */ | |
374 | argvec[tem] = evaluate_subexp_with_coercion (exp, pos, noside); | |
375 | ||
376 | /* signal end of arglist */ | |
377 | argvec[tem] = 0; | |
378 | ||
379 | if (op == STRUCTOP_STRUCT || op == STRUCTOP_PTR) | |
380 | { | |
381 | int static_memfuncp; | |
382 | value temp = arg2; | |
383 | ||
384 | argvec[1] = arg2; | |
385 | argvec[0] = | |
e58de8a2 | 386 | value_struct_elt (&temp, argvec+1, &exp->elts[pc2 + 1].string, |
bd5635a1 RP |
387 | &static_memfuncp, |
388 | op == STRUCTOP_STRUCT | |
389 | ? "structure" : "structure pointer"); | |
390 | if (VALUE_OFFSET (temp)) | |
391 | { | |
2ccb3837 | 392 | arg2 = value_from_longest (lookup_pointer_type (VALUE_TYPE (temp)), |
bd5635a1 | 393 | value_as_long (arg2)+VALUE_OFFSET (temp)); |
bd5635a1 RP |
394 | argvec[1] = arg2; |
395 | } | |
396 | if (static_memfuncp) | |
397 | { | |
398 | argvec[1] = argvec[0]; | |
399 | nargs--; | |
400 | argvec++; | |
401 | } | |
402 | } | |
403 | else if (op == STRUCTOP_MEMBER || op == STRUCTOP_MPTR) | |
404 | { | |
405 | argvec[1] = arg2; | |
406 | argvec[0] = arg1; | |
407 | } | |
408 | ||
409 | if (noside == EVAL_SKIP) | |
410 | goto nosideret; | |
411 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
412 | { | |
413 | /* If the return type doesn't look like a function type, call an | |
414 | error. This can happen if somebody tries to turn a variable into | |
415 | a function call. This is here because people often want to | |
416 | call, eg, strcmp, which gdb doesn't know is a function. If | |
417 | gdb isn't asked for it's opinion (ie. through "whatis"), | |
418 | it won't offer it. */ | |
419 | ||
420 | struct type *ftype = | |
421 | TYPE_TARGET_TYPE (VALUE_TYPE (argvec[0])); | |
422 | ||
423 | if (ftype) | |
424 | return allocate_value (TYPE_TARGET_TYPE (VALUE_TYPE (argvec[0]))); | |
425 | else | |
426 | error ("Expression of type other than \"Function returning ...\" used as function"); | |
427 | } | |
e17960fb | 428 | return call_function_by_hand (argvec[0], nargs, argvec + 1); |
bd5635a1 RP |
429 | |
430 | case STRUCTOP_STRUCT: | |
e58de8a2 FF |
431 | tem = strlen (&exp->elts[pc + 1].string); |
432 | (*pos) += 2 + ((tem + sizeof (union exp_element)) | |
bd5635a1 RP |
433 | / sizeof (union exp_element)); |
434 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
435 | if (noside == EVAL_SKIP) | |
436 | goto nosideret; | |
437 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
438 | return value_zero (lookup_struct_elt_type (VALUE_TYPE (arg1), | |
e58de8a2 | 439 | &exp->elts[pc + 1].string, |
35fcebce | 440 | 0), |
bd5635a1 RP |
441 | lval_memory); |
442 | else | |
443 | { | |
444 | value temp = arg1; | |
e58de8a2 | 445 | return value_struct_elt (&temp, (value *)0, &exp->elts[pc + 1].string, |
bd5635a1 RP |
446 | (int *) 0, "structure"); |
447 | } | |
448 | ||
449 | case STRUCTOP_PTR: | |
e58de8a2 FF |
450 | tem = strlen (&exp->elts[pc + 1].string); |
451 | (*pos) += 2 + (tem + sizeof (union exp_element)) / sizeof (union exp_element); | |
bd5635a1 RP |
452 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
453 | if (noside == EVAL_SKIP) | |
454 | goto nosideret; | |
455 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
456 | return value_zero (lookup_struct_elt_type (TYPE_TARGET_TYPE | |
457 | (VALUE_TYPE (arg1)), | |
e58de8a2 | 458 | &exp->elts[pc + 1].string, |
35fcebce | 459 | 0), |
bd5635a1 RP |
460 | lval_memory); |
461 | else | |
462 | { | |
463 | value temp = arg1; | |
e58de8a2 | 464 | return value_struct_elt (&temp, (value *)0, &exp->elts[pc + 1].string, |
bd5635a1 RP |
465 | (int *) 0, "structure pointer"); |
466 | } | |
467 | ||
468 | case STRUCTOP_MEMBER: | |
469 | arg1 = evaluate_subexp_for_address (exp, pos, noside); | |
01be6913 | 470 | goto handle_pointer_to_member; |
bd5635a1 RP |
471 | case STRUCTOP_MPTR: |
472 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
01be6913 | 473 | handle_pointer_to_member: |
bd5635a1 RP |
474 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
475 | if (noside == EVAL_SKIP) | |
476 | goto nosideret; | |
01be6913 PB |
477 | if (TYPE_CODE (VALUE_TYPE (arg2)) != TYPE_CODE_PTR) |
478 | goto bad_pointer_to_member; | |
479 | type = TYPE_TARGET_TYPE (VALUE_TYPE (arg2)); | |
480 | if (TYPE_CODE (type) == TYPE_CODE_METHOD) | |
481 | error ("not implemented: pointer-to-method in pointer-to-member construct"); | |
482 | if (TYPE_CODE (type) != TYPE_CODE_MEMBER) | |
483 | goto bad_pointer_to_member; | |
bd5635a1 | 484 | /* Now, convert these values to an address. */ |
01be6913 PB |
485 | arg1 = value_cast (lookup_pointer_type (TYPE_DOMAIN_TYPE (type)), |
486 | arg1); | |
487 | arg3 = value_from_longest (lookup_pointer_type (TYPE_TARGET_TYPE (type)), | |
488 | value_as_long (arg1) + value_as_long (arg2)); | |
bd5635a1 | 489 | return value_ind (arg3); |
01be6913 PB |
490 | bad_pointer_to_member: |
491 | error("non-pointer-to-member value used in pointer-to-member construct"); | |
bd5635a1 RP |
492 | |
493 | case BINOP_ASSIGN: | |
494 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
495 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
496 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
497 | return arg1; | |
498 | if (binop_user_defined_p (op, arg1, arg2)) | |
2ccb3837 | 499 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
500 | else |
501 | return value_assign (arg1, arg2); | |
502 | ||
503 | case BINOP_ASSIGN_MODIFY: | |
504 | (*pos) += 2; | |
505 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
506 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
507 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
508 | return arg1; | |
509 | op = exp->elts[pc + 1].opcode; | |
510 | if (binop_user_defined_p (op, arg1, arg2)) | |
511 | return value_x_binop (arg1, arg2, BINOP_ASSIGN_MODIFY, op); | |
512 | else if (op == BINOP_ADD) | |
513 | arg2 = value_add (arg1, arg2); | |
514 | else if (op == BINOP_SUB) | |
515 | arg2 = value_sub (arg1, arg2); | |
516 | else | |
517 | arg2 = value_binop (arg1, arg2, op); | |
518 | return value_assign (arg1, arg2); | |
519 | ||
520 | case BINOP_ADD: | |
521 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
522 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
523 | if (noside == EVAL_SKIP) | |
524 | goto nosideret; | |
525 | if (binop_user_defined_p (op, arg1, arg2)) | |
2ccb3837 | 526 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
527 | else |
528 | return value_add (arg1, arg2); | |
529 | ||
530 | case BINOP_SUB: | |
531 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
532 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
533 | if (noside == EVAL_SKIP) | |
534 | goto nosideret; | |
535 | if (binop_user_defined_p (op, arg1, arg2)) | |
2ccb3837 | 536 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
537 | else |
538 | return value_sub (arg1, arg2); | |
539 | ||
540 | case BINOP_MUL: | |
541 | case BINOP_DIV: | |
542 | case BINOP_REM: | |
543 | case BINOP_LSH: | |
544 | case BINOP_RSH: | |
e58de8a2 FF |
545 | case BINOP_BITWISE_AND: |
546 | case BINOP_BITWISE_IOR: | |
547 | case BINOP_BITWISE_XOR: | |
bd5635a1 RP |
548 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
549 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
550 | if (noside == EVAL_SKIP) | |
551 | goto nosideret; | |
552 | if (binop_user_defined_p (op, arg1, arg2)) | |
2ccb3837 | 553 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
554 | else |
555 | if (noside == EVAL_AVOID_SIDE_EFFECTS | |
8f86a4e4 | 556 | && (op == BINOP_DIV || op == BINOP_REM)) |
bd5635a1 RP |
557 | return value_zero (VALUE_TYPE (arg1), not_lval); |
558 | else | |
559 | return value_binop (arg1, arg2, op); | |
560 | ||
561 | case BINOP_SUBSCRIPT: | |
562 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
563 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
564 | if (noside == EVAL_SKIP) | |
565 | goto nosideret; | |
566 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
35fcebce PB |
567 | { |
568 | /* If the user attempts to subscript something that has no target | |
569 | type (like a plain int variable for example), then report this | |
570 | as an error. */ | |
571 | ||
572 | type = TYPE_TARGET_TYPE (VALUE_TYPE (arg1)); | |
573 | if (type) | |
574 | return value_zero (type, VALUE_LVAL (arg1)); | |
575 | else | |
576 | error ("cannot subscript something of type `%s'", | |
577 | TYPE_NAME (VALUE_TYPE (arg1))); | |
578 | } | |
bd5635a1 RP |
579 | |
580 | if (binop_user_defined_p (op, arg1, arg2)) | |
2ccb3837 | 581 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
582 | else |
583 | return value_subscript (arg1, arg2); | |
584 | ||
e58de8a2 | 585 | case BINOP_LOGICAL_AND: |
bd5635a1 RP |
586 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
587 | if (noside == EVAL_SKIP) | |
588 | { | |
589 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
590 | goto nosideret; | |
591 | } | |
592 | ||
593 | oldpos = *pos; | |
594 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
595 | *pos = oldpos; | |
596 | ||
597 | if (binop_user_defined_p (op, arg1, arg2)) | |
598 | { | |
599 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2ccb3837 | 600 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
601 | } |
602 | else | |
603 | { | |
e58de8a2 | 604 | tem = value_logical_not (arg1); |
bd5635a1 RP |
605 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, |
606 | (tem ? EVAL_SKIP : noside)); | |
2ccb3837 | 607 | return value_from_longest (builtin_type_int, |
e58de8a2 | 608 | (LONGEST) (!tem && !value_logical_not (arg2))); |
bd5635a1 RP |
609 | } |
610 | ||
e58de8a2 | 611 | case BINOP_LOGICAL_OR: |
bd5635a1 RP |
612 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
613 | if (noside == EVAL_SKIP) | |
614 | { | |
615 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
616 | goto nosideret; | |
617 | } | |
618 | ||
619 | oldpos = *pos; | |
620 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
621 | *pos = oldpos; | |
622 | ||
623 | if (binop_user_defined_p (op, arg1, arg2)) | |
624 | { | |
625 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
2ccb3837 | 626 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
627 | } |
628 | else | |
629 | { | |
e58de8a2 | 630 | tem = value_logical_not (arg1); |
bd5635a1 RP |
631 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, |
632 | (!tem ? EVAL_SKIP : noside)); | |
2ccb3837 | 633 | return value_from_longest (builtin_type_int, |
e58de8a2 | 634 | (LONGEST) (!tem || !value_logical_not (arg2))); |
bd5635a1 RP |
635 | } |
636 | ||
637 | case BINOP_EQUAL: | |
638 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
639 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
640 | if (noside == EVAL_SKIP) | |
641 | goto nosideret; | |
642 | if (binop_user_defined_p (op, arg1, arg2)) | |
643 | { | |
2ccb3837 | 644 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
645 | } |
646 | else | |
647 | { | |
648 | tem = value_equal (arg1, arg2); | |
2ccb3837 | 649 | return value_from_longest (builtin_type_int, (LONGEST) tem); |
bd5635a1 RP |
650 | } |
651 | ||
652 | case BINOP_NOTEQUAL: | |
653 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
654 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
655 | if (noside == EVAL_SKIP) | |
656 | goto nosideret; | |
657 | if (binop_user_defined_p (op, arg1, arg2)) | |
658 | { | |
2ccb3837 | 659 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
660 | } |
661 | else | |
662 | { | |
663 | tem = value_equal (arg1, arg2); | |
2ccb3837 | 664 | return value_from_longest (builtin_type_int, (LONGEST) ! tem); |
bd5635a1 RP |
665 | } |
666 | ||
667 | case BINOP_LESS: | |
668 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
669 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
670 | if (noside == EVAL_SKIP) | |
671 | goto nosideret; | |
672 | if (binop_user_defined_p (op, arg1, arg2)) | |
673 | { | |
2ccb3837 | 674 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
675 | } |
676 | else | |
677 | { | |
678 | tem = value_less (arg1, arg2); | |
2ccb3837 | 679 | return value_from_longest (builtin_type_int, (LONGEST) tem); |
bd5635a1 RP |
680 | } |
681 | ||
682 | case BINOP_GTR: | |
683 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
684 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
685 | if (noside == EVAL_SKIP) | |
686 | goto nosideret; | |
687 | if (binop_user_defined_p (op, arg1, arg2)) | |
688 | { | |
2ccb3837 | 689 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
690 | } |
691 | else | |
692 | { | |
693 | tem = value_less (arg2, arg1); | |
2ccb3837 | 694 | return value_from_longest (builtin_type_int, (LONGEST) tem); |
bd5635a1 RP |
695 | } |
696 | ||
697 | case BINOP_GEQ: | |
698 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
699 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
700 | if (noside == EVAL_SKIP) | |
701 | goto nosideret; | |
702 | if (binop_user_defined_p (op, arg1, arg2)) | |
703 | { | |
2ccb3837 | 704 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
705 | } |
706 | else | |
707 | { | |
8f86a4e4 JG |
708 | tem = value_less (arg2, arg1) || value_equal (arg1, arg2); |
709 | return value_from_longest (builtin_type_int, (LONGEST) tem); | |
bd5635a1 RP |
710 | } |
711 | ||
712 | case BINOP_LEQ: | |
713 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
714 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
715 | if (noside == EVAL_SKIP) | |
716 | goto nosideret; | |
717 | if (binop_user_defined_p (op, arg1, arg2)) | |
718 | { | |
2ccb3837 | 719 | return value_x_binop (arg1, arg2, op, OP_NULL); |
bd5635a1 RP |
720 | } |
721 | else | |
722 | { | |
8f86a4e4 JG |
723 | tem = value_less (arg1, arg2) || value_equal (arg1, arg2); |
724 | return value_from_longest (builtin_type_int, (LONGEST) tem); | |
bd5635a1 RP |
725 | } |
726 | ||
727 | case BINOP_REPEAT: | |
728 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
729 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
730 | if (noside == EVAL_SKIP) | |
731 | goto nosideret; | |
732 | if (TYPE_CODE (VALUE_TYPE (arg2)) != TYPE_CODE_INT) | |
733 | error ("Non-integral right operand for \"@\" operator."); | |
734 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
735 | return allocate_repeat_value (VALUE_TYPE (arg1), | |
2ccb3837 | 736 | longest_to_int (value_as_long (arg2))); |
bd5635a1 | 737 | else |
2ccb3837 | 738 | return value_repeat (arg1, longest_to_int (value_as_long (arg2))); |
bd5635a1 RP |
739 | |
740 | case BINOP_COMMA: | |
741 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
742 | return evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
743 | ||
744 | case UNOP_NEG: | |
745 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
746 | if (noside == EVAL_SKIP) | |
747 | goto nosideret; | |
748 | if (unop_user_defined_p (op, arg1)) | |
749 | return value_x_unop (arg1, op); | |
750 | else | |
751 | return value_neg (arg1); | |
752 | ||
e58de8a2 | 753 | case UNOP_COMPLEMENT: |
5f00ca54 JK |
754 | /* C++: check for and handle destructor names. */ |
755 | op = exp->elts[*pos].opcode; | |
756 | ||
bd5635a1 RP |
757 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
758 | if (noside == EVAL_SKIP) | |
759 | goto nosideret; | |
e58de8a2 FF |
760 | if (unop_user_defined_p (UNOP_COMPLEMENT, arg1)) |
761 | return value_x_unop (arg1, UNOP_COMPLEMENT); | |
bd5635a1 | 762 | else |
e58de8a2 | 763 | return value_complement (arg1); |
bd5635a1 | 764 | |
e58de8a2 | 765 | case UNOP_LOGICAL_NOT: |
bd5635a1 RP |
766 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
767 | if (noside == EVAL_SKIP) | |
768 | goto nosideret; | |
769 | if (unop_user_defined_p (op, arg1)) | |
770 | return value_x_unop (arg1, op); | |
771 | else | |
2ccb3837 | 772 | return value_from_longest (builtin_type_int, |
e58de8a2 | 773 | (LONGEST) value_logical_not (arg1)); |
bd5635a1 RP |
774 | |
775 | case UNOP_IND: | |
776 | if (expect_type && TYPE_CODE (expect_type) == TYPE_CODE_PTR) | |
777 | expect_type = TYPE_TARGET_TYPE (expect_type); | |
778 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
779 | if (noside == EVAL_SKIP) | |
780 | goto nosideret; | |
781 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
782 | { | |
783 | if (TYPE_CODE (VALUE_TYPE (arg1)) == TYPE_CODE_PTR | |
784 | || TYPE_CODE (VALUE_TYPE (arg1)) == TYPE_CODE_REF | |
785 | /* In C you can dereference an array to get the 1st elt. */ | |
786 | || TYPE_CODE (VALUE_TYPE (arg1)) == TYPE_CODE_ARRAY | |
787 | ) | |
788 | return value_zero (TYPE_TARGET_TYPE (VALUE_TYPE (arg1)), | |
789 | lval_memory); | |
790 | else if (TYPE_CODE (VALUE_TYPE (arg1)) == TYPE_CODE_INT) | |
791 | /* GDB allows dereferencing an int. */ | |
792 | return value_zero (builtin_type_int, lval_memory); | |
793 | else | |
794 | error ("Attempt to take contents of a non-pointer value."); | |
795 | } | |
796 | return value_ind (arg1); | |
797 | ||
798 | case UNOP_ADDR: | |
799 | /* C++: check for and handle pointer to members. */ | |
800 | ||
801 | op = exp->elts[*pos].opcode; | |
802 | ||
803 | if (noside == EVAL_SKIP) | |
804 | { | |
805 | if (op == OP_SCOPE) | |
806 | { | |
807 | char *name = &exp->elts[pc+3].string; | |
808 | int temm = strlen (name); | |
809 | (*pos) += 2 + (temm + sizeof (union exp_element)) / sizeof (union exp_element); | |
810 | } | |
811 | else | |
812 | evaluate_subexp (expect_type, exp, pos, EVAL_SKIP); | |
813 | goto nosideret; | |
814 | } | |
815 | ||
01be6913 | 816 | return evaluate_subexp_for_address (exp, pos, noside); |
bd5635a1 RP |
817 | |
818 | case UNOP_SIZEOF: | |
819 | if (noside == EVAL_SKIP) | |
820 | { | |
821 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
822 | goto nosideret; | |
823 | } | |
824 | return evaluate_subexp_for_sizeof (exp, pos); | |
825 | ||
826 | case UNOP_CAST: | |
827 | (*pos) += 2; | |
828 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
829 | if (noside == EVAL_SKIP) | |
830 | goto nosideret; | |
831 | return value_cast (exp->elts[pc + 1].type, arg1); | |
832 | ||
833 | case UNOP_MEMVAL: | |
834 | (*pos) += 2; | |
835 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
836 | if (noside == EVAL_SKIP) | |
837 | goto nosideret; | |
838 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
839 | return value_zero (exp->elts[pc + 1].type, lval_memory); | |
840 | else | |
841 | return value_at_lazy (exp->elts[pc + 1].type, | |
2ccb3837 | 842 | value_as_pointer (arg1)); |
bd5635a1 RP |
843 | |
844 | case UNOP_PREINCREMENT: | |
845 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
846 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
847 | return arg1; | |
848 | else if (unop_user_defined_p (op, arg1)) | |
849 | { | |
850 | return value_x_unop (arg1, op); | |
851 | } | |
852 | else | |
853 | { | |
2ccb3837 | 854 | arg2 = value_add (arg1, value_from_longest (builtin_type_char, |
bd5635a1 RP |
855 | (LONGEST) 1)); |
856 | return value_assign (arg1, arg2); | |
857 | } | |
858 | ||
859 | case UNOP_PREDECREMENT: | |
860 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
861 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
862 | return arg1; | |
863 | else if (unop_user_defined_p (op, arg1)) | |
864 | { | |
865 | return value_x_unop (arg1, op); | |
866 | } | |
867 | else | |
868 | { | |
2ccb3837 | 869 | arg2 = value_sub (arg1, value_from_longest (builtin_type_char, |
bd5635a1 RP |
870 | (LONGEST) 1)); |
871 | return value_assign (arg1, arg2); | |
872 | } | |
873 | ||
874 | case UNOP_POSTINCREMENT: | |
875 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
876 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
877 | return arg1; | |
878 | else if (unop_user_defined_p (op, arg1)) | |
879 | { | |
880 | return value_x_unop (arg1, op); | |
881 | } | |
882 | else | |
883 | { | |
2ccb3837 | 884 | arg2 = value_add (arg1, value_from_longest (builtin_type_char, |
bd5635a1 RP |
885 | (LONGEST) 1)); |
886 | value_assign (arg1, arg2); | |
887 | return arg1; | |
888 | } | |
889 | ||
890 | case UNOP_POSTDECREMENT: | |
891 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); | |
892 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
893 | return arg1; | |
894 | else if (unop_user_defined_p (op, arg1)) | |
895 | { | |
896 | return value_x_unop (arg1, op); | |
897 | } | |
898 | else | |
899 | { | |
2ccb3837 | 900 | arg2 = value_sub (arg1, value_from_longest (builtin_type_char, |
bd5635a1 RP |
901 | (LONGEST) 1)); |
902 | value_assign (arg1, arg2); | |
903 | return arg1; | |
904 | } | |
905 | ||
906 | case OP_THIS: | |
907 | (*pos) += 1; | |
908 | return value_of_this (1); | |
909 | ||
910 | default: | |
911 | error ("internal error: I do not know how to evaluate what you gave me"); | |
912 | } | |
913 | ||
914 | nosideret: | |
2ccb3837 | 915 | return value_from_longest (builtin_type_long, (LONGEST) 1); |
bd5635a1 RP |
916 | } |
917 | \f | |
918 | /* Evaluate a subexpression of EXP, at index *POS, | |
919 | and return the address of that subexpression. | |
920 | Advance *POS over the subexpression. | |
921 | If the subexpression isn't an lvalue, get an error. | |
922 | NOSIDE may be EVAL_AVOID_SIDE_EFFECTS; | |
923 | then only the type of the result need be correct. */ | |
924 | ||
925 | static value | |
926 | evaluate_subexp_for_address (exp, pos, noside) | |
927 | register struct expression *exp; | |
928 | register int *pos; | |
929 | enum noside noside; | |
930 | { | |
931 | enum exp_opcode op; | |
932 | register int pc; | |
e17960fb | 933 | struct symbol *var; |
bd5635a1 RP |
934 | |
935 | pc = (*pos); | |
936 | op = exp->elts[pc].opcode; | |
937 | ||
938 | switch (op) | |
939 | { | |
940 | case UNOP_IND: | |
941 | (*pos)++; | |
942 | return evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
943 | ||
944 | case UNOP_MEMVAL: | |
945 | (*pos) += 3; | |
946 | return value_cast (lookup_pointer_type (exp->elts[pc + 1].type), | |
947 | evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
948 | ||
949 | case OP_VAR_VALUE: | |
e17960fb JG |
950 | var = exp->elts[pc + 1].symbol; |
951 | ||
952 | /* C++: The "address" of a reference should yield the address | |
953 | * of the object pointed to. Let value_addr() deal with it. */ | |
954 | if (TYPE_CODE (SYMBOL_TYPE (var)) == TYPE_CODE_REF) | |
955 | goto default_case; | |
956 | ||
bd5635a1 RP |
957 | (*pos) += 3; |
958 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
959 | { | |
960 | struct type *type = | |
e17960fb JG |
961 | lookup_pointer_type (SYMBOL_TYPE (var)); |
962 | enum address_class sym_class = SYMBOL_CLASS (var); | |
bd5635a1 RP |
963 | |
964 | if (sym_class == LOC_CONST | |
965 | || sym_class == LOC_CONST_BYTES | |
966 | || sym_class == LOC_REGISTER | |
967 | || sym_class == LOC_REGPARM) | |
968 | error ("Attempt to take address of register or constant."); | |
969 | ||
970 | return | |
971 | value_zero (type, not_lval); | |
972 | } | |
973 | else | |
e17960fb | 974 | return locate_var_value (var, (FRAME) 0); |
bd5635a1 RP |
975 | |
976 | default: | |
e17960fb | 977 | default_case: |
bd5635a1 RP |
978 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
979 | { | |
980 | value x = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
981 | if (VALUE_LVAL (x) == lval_memory) | |
0a5d35ed | 982 | return value_zero (lookup_pointer_type (VALUE_TYPE (x)), |
bd5635a1 RP |
983 | not_lval); |
984 | else | |
985 | error ("Attempt to take address of non-lval"); | |
986 | } | |
987 | return value_addr (evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
988 | } | |
989 | } | |
990 | ||
991 | /* Evaluate like `evaluate_subexp' except coercing arrays to pointers. | |
992 | When used in contexts where arrays will be coerced anyway, | |
993 | this is equivalent to `evaluate_subexp' | |
994 | but much faster because it avoids actually fetching array contents. */ | |
995 | ||
996 | static value | |
997 | evaluate_subexp_with_coercion (exp, pos, noside) | |
998 | register struct expression *exp; | |
999 | register int *pos; | |
1000 | enum noside noside; | |
1001 | { | |
1002 | register enum exp_opcode op; | |
1003 | register int pc; | |
1004 | register value val; | |
e17960fb | 1005 | struct symbol *var; |
bd5635a1 RP |
1006 | |
1007 | pc = (*pos); | |
1008 | op = exp->elts[pc].opcode; | |
1009 | ||
1010 | switch (op) | |
1011 | { | |
1012 | case OP_VAR_VALUE: | |
e17960fb JG |
1013 | var = exp->elts[pc + 1].symbol; |
1014 | if (TYPE_CODE (SYMBOL_TYPE (var)) == TYPE_CODE_ARRAY) | |
bd5635a1 RP |
1015 | { |
1016 | (*pos) += 3; | |
e17960fb JG |
1017 | val = locate_var_value (var, (FRAME) 0); |
1018 | return value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (SYMBOL_TYPE (var))), | |
bd5635a1 RP |
1019 | val); |
1020 | } | |
1021 | default: | |
1022 | return evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
1023 | } | |
1024 | } | |
1025 | ||
1026 | /* Evaluate a subexpression of EXP, at index *POS, | |
1027 | and return a value for the size of that subexpression. | |
1028 | Advance *POS over the subexpression. */ | |
1029 | ||
1030 | static value | |
1031 | evaluate_subexp_for_sizeof (exp, pos) | |
1032 | register struct expression *exp; | |
1033 | register int *pos; | |
1034 | { | |
1035 | enum exp_opcode op; | |
1036 | register int pc; | |
1037 | value val; | |
1038 | ||
1039 | pc = (*pos); | |
1040 | op = exp->elts[pc].opcode; | |
1041 | ||
1042 | switch (op) | |
1043 | { | |
1044 | /* This case is handled specially | |
1045 | so that we avoid creating a value for the result type. | |
1046 | If the result type is very big, it's desirable not to | |
1047 | create a value unnecessarily. */ | |
1048 | case UNOP_IND: | |
1049 | (*pos)++; | |
1050 | val = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
2ccb3837 | 1051 | return value_from_longest (builtin_type_int, (LONGEST) |
bd5635a1 RP |
1052 | TYPE_LENGTH (TYPE_TARGET_TYPE (VALUE_TYPE (val)))); |
1053 | ||
1054 | case UNOP_MEMVAL: | |
1055 | (*pos) += 3; | |
2ccb3837 | 1056 | return value_from_longest (builtin_type_int, |
bd5635a1 RP |
1057 | (LONGEST) TYPE_LENGTH (exp->elts[pc + 1].type)); |
1058 | ||
1059 | case OP_VAR_VALUE: | |
1060 | (*pos) += 3; | |
2ccb3837 | 1061 | return value_from_longest (builtin_type_int, |
bd5635a1 RP |
1062 | (LONGEST) TYPE_LENGTH (SYMBOL_TYPE (exp->elts[pc + 1].symbol))); |
1063 | ||
1064 | default: | |
1065 | val = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
2ccb3837 | 1066 | return value_from_longest (builtin_type_int, |
bd5635a1 RP |
1067 | (LONGEST) TYPE_LENGTH (VALUE_TYPE (val))); |
1068 | } | |
1069 | } | |
0a5d35ed SG |
1070 | |
1071 | /* Parse a type expression in the string [P..P+LENGTH). */ | |
1072 | ||
1073 | struct type * | |
1074 | parse_and_eval_type (p, length) | |
1075 | char *p; | |
1076 | int length; | |
1077 | { | |
1078 | char *tmp = (char *)alloca (length + 4); | |
1079 | struct expression *expr; | |
1080 | tmp[0] = '('; | |
35fcebce | 1081 | memcpy (tmp+1, p, length); |
0a5d35ed SG |
1082 | tmp[length+1] = ')'; |
1083 | tmp[length+2] = '0'; | |
1084 | tmp[length+3] = '\0'; | |
1085 | expr = parse_expression (tmp); | |
1086 | if (expr->elts[0].opcode != UNOP_CAST) | |
1087 | error ("Internal error in eval_type."); | |
1088 | return expr->elts[1].type; | |
1089 | } |