2012-12-10 Paul Koning <paul_koning@dell.com>
[deliverable/binutils-gdb.git] / gdb / dwarf2expr.c
CommitLineData
852483bc
MK
1/* DWARF 2 Expression Evaluator.
2
0b302171
JB
3 Copyright (C) 2001-2003, 2005, 2007-2012 Free Software Foundation,
4 Inc.
852483bc 5
4c2df51b
DJ
6 Contributed by Daniel Berlin (dan@dberlin.org)
7
8 This file is part of GDB.
9
10 This program is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
a9762ec7 12 the Free Software Foundation; either version 3 of the License, or
4c2df51b
DJ
13 (at your option) any later version.
14
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
19
20 You should have received a copy of the GNU General Public License
a9762ec7 21 along with this program. If not, see <http://www.gnu.org/licenses/>. */
4c2df51b
DJ
22
23#include "defs.h"
24#include "symtab.h"
25#include "gdbtypes.h"
26#include "value.h"
27#include "gdbcore.h"
fa8f86ff 28#include "dwarf2.h"
4c2df51b 29#include "dwarf2expr.h"
1e3a102a 30#include "gdb_assert.h"
4c2df51b
DJ
31
32/* Local prototypes. */
33
34static void execute_stack_op (struct dwarf_expr_context *,
0d45f56e 35 const gdb_byte *, const gdb_byte *);
4c2df51b 36
8a9b8146
TT
37/* Cookie for gdbarch data. */
38
39static struct gdbarch_data *dwarf_arch_cookie;
40
41/* This holds gdbarch-specific types used by the DWARF expression
42 evaluator. See comments in execute_stack_op. */
43
44struct dwarf_gdbarch_types
45{
46 struct type *dw_types[3];
47};
48
49/* Allocate and fill in dwarf_gdbarch_types for an arch. */
50
51static void *
52dwarf_gdbarch_types_init (struct gdbarch *gdbarch)
53{
54 struct dwarf_gdbarch_types *types
55 = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct dwarf_gdbarch_types);
56
57 /* The types themselves are lazily initialized. */
58
59 return types;
60}
61
62/* Return the type used for DWARF operations where the type is
63 unspecified in the DWARF spec. Only certain sizes are
64 supported. */
65
66static struct type *
67dwarf_expr_address_type (struct dwarf_expr_context *ctx)
68{
69 struct dwarf_gdbarch_types *types = gdbarch_data (ctx->gdbarch,
70 dwarf_arch_cookie);
71 int ndx;
72
73 if (ctx->addr_size == 2)
74 ndx = 0;
75 else if (ctx->addr_size == 4)
76 ndx = 1;
77 else if (ctx->addr_size == 8)
78 ndx = 2;
79 else
80 error (_("Unsupported address size in DWARF expressions: %d bits"),
81 8 * ctx->addr_size);
82
83 if (types->dw_types[ndx] == NULL)
84 types->dw_types[ndx]
85 = arch_integer_type (ctx->gdbarch,
86 8 * ctx->addr_size,
87 0, "<signed DWARF address type>");
88
89 return types->dw_types[ndx];
90}
91
4c2df51b
DJ
92/* Create a new context for the expression evaluator. */
93
94struct dwarf_expr_context *
e4adbba9 95new_dwarf_expr_context (void)
4c2df51b
DJ
96{
97 struct dwarf_expr_context *retval;
9a619af0 98
4c2df51b 99 retval = xcalloc (1, sizeof (struct dwarf_expr_context));
18ec9831
KB
100 retval->stack_len = 0;
101 retval->stack_allocated = 10;
b966cb8a
TT
102 retval->stack = xmalloc (retval->stack_allocated
103 * sizeof (struct dwarf_stack_value));
87808bd6
JB
104 retval->num_pieces = 0;
105 retval->pieces = 0;
1e3a102a 106 retval->max_recursion_depth = 0x100;
4c2df51b
DJ
107 return retval;
108}
109
110/* Release the memory allocated to CTX. */
111
112void
113free_dwarf_expr_context (struct dwarf_expr_context *ctx)
114{
115 xfree (ctx->stack);
87808bd6 116 xfree (ctx->pieces);
4c2df51b
DJ
117 xfree (ctx);
118}
119
4a227398
TT
120/* Helper for make_cleanup_free_dwarf_expr_context. */
121
122static void
123free_dwarf_expr_context_cleanup (void *arg)
124{
125 free_dwarf_expr_context (arg);
126}
127
128/* Return a cleanup that calls free_dwarf_expr_context. */
129
130struct cleanup *
131make_cleanup_free_dwarf_expr_context (struct dwarf_expr_context *ctx)
132{
133 return make_cleanup (free_dwarf_expr_context_cleanup, ctx);
134}
135
4c2df51b
DJ
136/* Expand the memory allocated to CTX's stack to contain at least
137 NEED more elements than are currently used. */
138
139static void
140dwarf_expr_grow_stack (struct dwarf_expr_context *ctx, size_t need)
141{
142 if (ctx->stack_len + need > ctx->stack_allocated)
143 {
18ec9831 144 size_t newlen = ctx->stack_len + need + 10;
9a619af0 145
4c2df51b 146 ctx->stack = xrealloc (ctx->stack,
44353522 147 newlen * sizeof (struct dwarf_stack_value));
18ec9831 148 ctx->stack_allocated = newlen;
4c2df51b
DJ
149 }
150}
151
152/* Push VALUE onto CTX's stack. */
153
8a9b8146
TT
154static void
155dwarf_expr_push (struct dwarf_expr_context *ctx, struct value *value,
44353522 156 int in_stack_memory)
4c2df51b 157{
44353522
DE
158 struct dwarf_stack_value *v;
159
4c2df51b 160 dwarf_expr_grow_stack (ctx, 1);
44353522
DE
161 v = &ctx->stack[ctx->stack_len++];
162 v->value = value;
163 v->in_stack_memory = in_stack_memory;
4c2df51b
DJ
164}
165
8a9b8146 166/* Push VALUE onto CTX's stack. */
4c2df51b
DJ
167
168void
8a9b8146
TT
169dwarf_expr_push_address (struct dwarf_expr_context *ctx, CORE_ADDR value,
170 int in_stack_memory)
171{
172 dwarf_expr_push (ctx,
173 value_from_ulongest (dwarf_expr_address_type (ctx), value),
174 in_stack_memory);
175}
176
177/* Pop the top item off of CTX's stack. */
178
179static void
4c2df51b
DJ
180dwarf_expr_pop (struct dwarf_expr_context *ctx)
181{
182 if (ctx->stack_len <= 0)
8a3fe4f8 183 error (_("dwarf expression stack underflow"));
4c2df51b
DJ
184 ctx->stack_len--;
185}
186
187/* Retrieve the N'th item on CTX's stack. */
188
8a9b8146 189struct value *
4c2df51b
DJ
190dwarf_expr_fetch (struct dwarf_expr_context *ctx, int n)
191{
ef0fdf07 192 if (ctx->stack_len <= n)
3e43a32a
MS
193 error (_("Asked for position %d of stack, "
194 "stack only has %d elements on it."),
4c2df51b 195 n, ctx->stack_len);
44353522 196 return ctx->stack[ctx->stack_len - (1 + n)].value;
8a9b8146
TT
197}
198
199/* Require that TYPE be an integral type; throw an exception if not. */
44353522 200
8a9b8146
TT
201static void
202dwarf_require_integral (struct type *type)
203{
204 if (TYPE_CODE (type) != TYPE_CODE_INT
205 && TYPE_CODE (type) != TYPE_CODE_CHAR
206 && TYPE_CODE (type) != TYPE_CODE_BOOL)
207 error (_("integral type expected in DWARF expression"));
208}
209
210/* Return the unsigned form of TYPE. TYPE is necessarily an integral
211 type. */
212
213static struct type *
214get_unsigned_type (struct gdbarch *gdbarch, struct type *type)
215{
216 switch (TYPE_LENGTH (type))
217 {
218 case 1:
219 return builtin_type (gdbarch)->builtin_uint8;
220 case 2:
221 return builtin_type (gdbarch)->builtin_uint16;
222 case 4:
223 return builtin_type (gdbarch)->builtin_uint32;
224 case 8:
225 return builtin_type (gdbarch)->builtin_uint64;
226 default:
227 error (_("no unsigned variant found for type, while evaluating "
228 "DWARF expression"));
229 }
44353522
DE
230}
231
8ddd9a20
TT
232/* Return the signed form of TYPE. TYPE is necessarily an integral
233 type. */
234
235static struct type *
236get_signed_type (struct gdbarch *gdbarch, struct type *type)
237{
238 switch (TYPE_LENGTH (type))
239 {
240 case 1:
241 return builtin_type (gdbarch)->builtin_int8;
242 case 2:
243 return builtin_type (gdbarch)->builtin_int16;
244 case 4:
245 return builtin_type (gdbarch)->builtin_int32;
246 case 8:
247 return builtin_type (gdbarch)->builtin_int64;
248 default:
249 error (_("no signed variant found for type, while evaluating "
250 "DWARF expression"));
251 }
252}
253
f2c7657e
UW
254/* Retrieve the N'th item on CTX's stack, converted to an address. */
255
256CORE_ADDR
257dwarf_expr_fetch_address (struct dwarf_expr_context *ctx, int n)
258{
8a9b8146
TT
259 struct value *result_val = dwarf_expr_fetch (ctx, n);
260 enum bfd_endian byte_order = gdbarch_byte_order (ctx->gdbarch);
261 ULONGEST result;
262
263 dwarf_require_integral (value_type (result_val));
264 result = extract_unsigned_integer (value_contents (result_val),
265 TYPE_LENGTH (value_type (result_val)),
266 byte_order);
f2c7657e
UW
267
268 /* For most architectures, calling extract_unsigned_integer() alone
269 is sufficient for extracting an address. However, some
270 architectures (e.g. MIPS) use signed addresses and using
271 extract_unsigned_integer() will not produce a correct
272 result. Make sure we invoke gdbarch_integer_to_address()
273 for those architectures which require it. */
274 if (gdbarch_integer_to_address_p (ctx->gdbarch))
275 {
f2c7657e 276 gdb_byte *buf = alloca (ctx->addr_size);
8a9b8146
TT
277 struct type *int_type = get_unsigned_type (ctx->gdbarch,
278 value_type (result_val));
f2c7657e
UW
279
280 store_unsigned_integer (buf, ctx->addr_size, byte_order, result);
281 return gdbarch_integer_to_address (ctx->gdbarch, int_type, buf);
282 }
283
284 return (CORE_ADDR) result;
285}
286
44353522
DE
287/* Retrieve the in_stack_memory flag of the N'th item on CTX's stack. */
288
289int
290dwarf_expr_fetch_in_stack_memory (struct dwarf_expr_context *ctx, int n)
291{
292 if (ctx->stack_len <= n)
3e43a32a
MS
293 error (_("Asked for position %d of stack, "
294 "stack only has %d elements on it."),
44353522
DE
295 n, ctx->stack_len);
296 return ctx->stack[ctx->stack_len - (1 + n)].in_stack_memory;
4c2df51b
DJ
297}
298
cb826367
TT
299/* Return true if the expression stack is empty. */
300
301static int
302dwarf_expr_stack_empty_p (struct dwarf_expr_context *ctx)
303{
304 return ctx->stack_len == 0;
305}
306
87808bd6
JB
307/* Add a new piece to CTX's piece list. */
308static void
d3b1e874 309add_piece (struct dwarf_expr_context *ctx, ULONGEST size, ULONGEST offset)
87808bd6
JB
310{
311 struct dwarf_expr_piece *p;
312
313 ctx->num_pieces++;
314
d3b1e874
TT
315 ctx->pieces = xrealloc (ctx->pieces,
316 (ctx->num_pieces
317 * sizeof (struct dwarf_expr_piece)));
87808bd6
JB
318
319 p = &ctx->pieces[ctx->num_pieces - 1];
cec03d70 320 p->location = ctx->location;
87808bd6 321 p->size = size;
d3b1e874
TT
322 p->offset = offset;
323
cec03d70
TT
324 if (p->location == DWARF_VALUE_LITERAL)
325 {
326 p->v.literal.data = ctx->data;
327 p->v.literal.length = ctx->len;
328 }
cb826367
TT
329 else if (dwarf_expr_stack_empty_p (ctx))
330 {
331 p->location = DWARF_VALUE_OPTIMIZED_OUT;
332 /* Also reset the context's location, for our callers. This is
333 a somewhat strange approach, but this lets us avoid setting
334 the location to DWARF_VALUE_MEMORY in all the individual
335 cases in the evaluator. */
336 ctx->location = DWARF_VALUE_OPTIMIZED_OUT;
337 }
f2c7657e
UW
338 else if (p->location == DWARF_VALUE_MEMORY)
339 {
340 p->v.mem.addr = dwarf_expr_fetch_address (ctx, 0);
341 p->v.mem.in_stack_memory = dwarf_expr_fetch_in_stack_memory (ctx, 0);
342 }
8cf6f0b1
TT
343 else if (p->location == DWARF_VALUE_IMPLICIT_POINTER)
344 {
8b9737bf 345 p->v.ptr.die.sect_off = ctx->len;
8a9b8146 346 p->v.ptr.offset = value_as_long (dwarf_expr_fetch (ctx, 0));
8cf6f0b1 347 }
8a9b8146
TT
348 else if (p->location == DWARF_VALUE_REGISTER)
349 p->v.regno = value_as_long (dwarf_expr_fetch (ctx, 0));
cec03d70 350 else
44353522 351 {
f2c7657e 352 p->v.value = dwarf_expr_fetch (ctx, 0);
44353522 353 }
87808bd6
JB
354}
355
4c2df51b
DJ
356/* Evaluate the expression at ADDR (LEN bytes long) using the context
357 CTX. */
358
359void
0d45f56e
TT
360dwarf_expr_eval (struct dwarf_expr_context *ctx, const gdb_byte *addr,
361 size_t len)
4c2df51b 362{
1e3a102a
JK
363 int old_recursion_depth = ctx->recursion_depth;
364
4c2df51b 365 execute_stack_op (ctx, addr, addr + len);
1e3a102a
JK
366
367 /* CTX RECURSION_DEPTH becomes invalid if an exception was thrown here. */
368
369 gdb_assert (ctx->recursion_depth == old_recursion_depth);
4c2df51b
DJ
370}
371
f664829e 372/* Helper to read a uleb128 value or throw an error. */
4c2df51b 373
0d45f56e 374const gdb_byte *
f664829e 375safe_read_uleb128 (const gdb_byte *buf, const gdb_byte *buf_end,
9fccedf7 376 uint64_t *r)
4c2df51b 377{
f664829e
DE
378 buf = gdb_read_uleb128 (buf, buf_end, r);
379 if (buf == NULL)
380 error (_("DWARF expression error: ran off end of buffer reading uleb128 value"));
4c2df51b
DJ
381 return buf;
382}
383
f664829e 384/* Helper to read a sleb128 value or throw an error. */
4c2df51b 385
0d45f56e 386const gdb_byte *
f664829e 387safe_read_sleb128 (const gdb_byte *buf, const gdb_byte *buf_end,
9fccedf7 388 int64_t *r)
4c2df51b 389{
f664829e
DE
390 buf = gdb_read_sleb128 (buf, buf_end, r);
391 if (buf == NULL)
392 error (_("DWARF expression error: ran off end of buffer reading sleb128 value"));
393 return buf;
394}
4c2df51b 395
f664829e
DE
396const gdb_byte *
397safe_skip_leb128 (const gdb_byte *buf, const gdb_byte *buf_end)
398{
399 buf = gdb_skip_leb128 (buf, buf_end);
400 if (buf == NULL)
401 error (_("DWARF expression error: ran off end of buffer reading leb128 value"));
4c2df51b
DJ
402 return buf;
403}
4c2df51b 404\f
cec03d70
TT
405
406/* Check that the current operator is either at the end of an
407 expression, or that it is followed by a composition operator. */
408
3cf03773
TT
409void
410dwarf_expr_require_composition (const gdb_byte *op_ptr, const gdb_byte *op_end,
411 const char *op_name)
cec03d70
TT
412{
413 /* It seems like DW_OP_GNU_uninit should be handled here. However,
414 it doesn't seem to make sense for DW_OP_*_value, and it was not
415 checked at the other place that this function is called. */
416 if (op_ptr != op_end && *op_ptr != DW_OP_piece && *op_ptr != DW_OP_bit_piece)
417 error (_("DWARF-2 expression error: `%s' operations must be "
64b9b334 418 "used either alone or in conjunction with DW_OP_piece "
cec03d70
TT
419 "or DW_OP_bit_piece."),
420 op_name);
421}
422
8a9b8146
TT
423/* Return true iff the types T1 and T2 are "the same". This only does
424 checks that might reasonably be needed to compare DWARF base
425 types. */
426
427static int
428base_types_equal_p (struct type *t1, struct type *t2)
429{
430 if (TYPE_CODE (t1) != TYPE_CODE (t2))
431 return 0;
432 if (TYPE_UNSIGNED (t1) != TYPE_UNSIGNED (t2))
433 return 0;
434 return TYPE_LENGTH (t1) == TYPE_LENGTH (t2);
435}
436
437/* A convenience function to call get_base_type on CTX and return the
438 result. DIE is the DIE whose type we need. SIZE is non-zero if
439 this function should verify that the resulting type has the correct
440 size. */
441
442static struct type *
b64f50a1 443dwarf_get_base_type (struct dwarf_expr_context *ctx, cu_offset die, int size)
8a9b8146
TT
444{
445 struct type *result;
446
9e8b7a03 447 if (ctx->funcs->get_base_type)
8a9b8146 448 {
9e8b7a03 449 result = ctx->funcs->get_base_type (ctx, die);
9ff3b74f
TT
450 if (result == NULL)
451 error (_("Could not find type for DW_OP_GNU_const_type"));
8a9b8146
TT
452 if (size != 0 && TYPE_LENGTH (result) != size)
453 error (_("DW_OP_GNU_const_type has different sizes for type and data"));
454 }
455 else
456 /* Anything will do. */
457 result = builtin_type (ctx->gdbarch)->builtin_int;
458
459 return result;
460}
461
8e3b41a9
JK
462/* If <BUF..BUF_END] contains DW_FORM_block* with single DW_OP_reg* return the
463 DWARF register number. Otherwise return -1. */
464
465int
466dwarf_block_to_dwarf_reg (const gdb_byte *buf, const gdb_byte *buf_end)
467{
9fccedf7 468 uint64_t dwarf_reg;
8e3b41a9
JK
469
470 if (buf_end <= buf)
471 return -1;
472 if (*buf >= DW_OP_reg0 && *buf <= DW_OP_reg31)
473 {
474 if (buf_end - buf != 1)
475 return -1;
476 return *buf - DW_OP_reg0;
477 }
478
479 if (*buf == DW_OP_GNU_regval_type)
480 {
481 buf++;
f664829e
DE
482 buf = gdb_read_uleb128 (buf, buf_end, &dwarf_reg);
483 if (buf == NULL)
484 return -1;
485 buf = gdb_skip_leb128 (buf, buf_end);
486 if (buf == NULL)
487 return -1;
8e3b41a9
JK
488 }
489 else if (*buf == DW_OP_regx)
490 {
491 buf++;
f664829e
DE
492 buf = gdb_read_uleb128 (buf, buf_end, &dwarf_reg);
493 if (buf == NULL)
494 return -1;
8e3b41a9
JK
495 }
496 else
497 return -1;
498 if (buf != buf_end || (int) dwarf_reg != dwarf_reg)
499 return -1;
500 return dwarf_reg;
501}
502
a471c594
JK
503/* If <BUF..BUF_END] contains DW_FORM_block* with just DW_OP_breg*(0) and
504 DW_OP_deref* return the DWARF register number. Otherwise return -1.
505 DEREF_SIZE_RETURN contains -1 for DW_OP_deref; otherwise it contains the
506 size from DW_OP_deref_size. */
507
508int
509dwarf_block_to_dwarf_reg_deref (const gdb_byte *buf, const gdb_byte *buf_end,
510 CORE_ADDR *deref_size_return)
511{
9fccedf7
DE
512 uint64_t dwarf_reg;
513 int64_t offset;
a471c594
JK
514
515 if (buf_end <= buf)
516 return -1;
f664829e 517
a471c594
JK
518 if (*buf >= DW_OP_breg0 && *buf <= DW_OP_breg31)
519 {
520 dwarf_reg = *buf - DW_OP_breg0;
521 buf++;
f664829e
DE
522 if (buf >= buf_end)
523 return -1;
a471c594
JK
524 }
525 else if (*buf == DW_OP_bregx)
526 {
527 buf++;
f664829e
DE
528 buf = gdb_read_uleb128 (buf, buf_end, &dwarf_reg);
529 if (buf == NULL)
530 return -1;
a471c594
JK
531 if ((int) dwarf_reg != dwarf_reg)
532 return -1;
533 }
534 else
535 return -1;
536
f664829e
DE
537 buf = gdb_read_sleb128 (buf, buf_end, &offset);
538 if (buf == NULL)
a471c594 539 return -1;
f664829e 540 if (offset != 0)
a471c594
JK
541 return -1;
542
543 if (*buf == DW_OP_deref)
544 {
545 buf++;
546 *deref_size_return = -1;
547 }
548 else if (*buf == DW_OP_deref_size)
549 {
550 buf++;
551 if (buf >= buf_end)
552 return -1;
553 *deref_size_return = *buf++;
554 }
555 else
556 return -1;
557
558 if (buf != buf_end)
559 return -1;
560
561 return dwarf_reg;
562}
563
e18b2753
JK
564/* If <BUF..BUF_END] contains DW_FORM_block* with single DW_OP_fbreg(X) fill
565 in FB_OFFSET_RETURN with the X offset and return 1. Otherwise return 0. */
566
567int
568dwarf_block_to_fb_offset (const gdb_byte *buf, const gdb_byte *buf_end,
569 CORE_ADDR *fb_offset_return)
570{
9fccedf7 571 int64_t fb_offset;
e18b2753
JK
572
573 if (buf_end <= buf)
574 return 0;
575
576 if (*buf != DW_OP_fbreg)
577 return 0;
578 buf++;
579
f664829e
DE
580 buf = gdb_read_sleb128 (buf, buf_end, &fb_offset);
581 if (buf == NULL)
582 return 0;
e18b2753
JK
583 *fb_offset_return = fb_offset;
584 if (buf != buf_end || fb_offset != (LONGEST) *fb_offset_return)
585 return 0;
586
587 return 1;
588}
589
590/* If <BUF..BUF_END] contains DW_FORM_block* with single DW_OP_bregSP(X) fill
591 in SP_OFFSET_RETURN with the X offset and return 1. Otherwise return 0.
592 The matched SP register number depends on GDBARCH. */
593
594int
595dwarf_block_to_sp_offset (struct gdbarch *gdbarch, const gdb_byte *buf,
596 const gdb_byte *buf_end, CORE_ADDR *sp_offset_return)
597{
9fccedf7
DE
598 uint64_t dwarf_reg;
599 int64_t sp_offset;
e18b2753
JK
600
601 if (buf_end <= buf)
602 return 0;
603 if (*buf >= DW_OP_breg0 && *buf <= DW_OP_breg31)
604 {
605 dwarf_reg = *buf - DW_OP_breg0;
606 buf++;
607 }
608 else
609 {
610 if (*buf != DW_OP_bregx)
611 return 0;
612 buf++;
f664829e
DE
613 buf = gdb_read_uleb128 (buf, buf_end, &dwarf_reg);
614 if (buf == NULL)
615 return 0;
e18b2753
JK
616 }
617
618 if (gdbarch_dwarf2_reg_to_regnum (gdbarch, dwarf_reg)
619 != gdbarch_sp_regnum (gdbarch))
620 return 0;
621
f664829e
DE
622 buf = gdb_read_sleb128 (buf, buf_end, &sp_offset);
623 if (buf == NULL)
624 return 0;
e18b2753
JK
625 *sp_offset_return = sp_offset;
626 if (buf != buf_end || sp_offset != (LONGEST) *sp_offset_return)
627 return 0;
628
629 return 1;
630}
631
4c2df51b
DJ
632/* The engine for the expression evaluator. Using the context in CTX,
633 evaluate the expression between OP_PTR and OP_END. */
634
635static void
852483bc 636execute_stack_op (struct dwarf_expr_context *ctx,
0d45f56e 637 const gdb_byte *op_ptr, const gdb_byte *op_end)
4c2df51b 638{
e17a4113 639 enum bfd_endian byte_order = gdbarch_byte_order (ctx->gdbarch);
8a9b8146
TT
640 /* Old-style "untyped" DWARF values need special treatment in a
641 couple of places, specifically DW_OP_mod and DW_OP_shr. We need
642 a special type for these values so we can distinguish them from
643 values that have an explicit type, because explicitly-typed
644 values do not need special treatment. This special type must be
645 different (in the `==' sense) from any base type coming from the
646 CU. */
647 struct type *address_type = dwarf_expr_address_type (ctx);
9a619af0 648
cec03d70 649 ctx->location = DWARF_VALUE_MEMORY;
42be36b3 650 ctx->initialized = 1; /* Default is initialized. */
18ec9831 651
1e3a102a
JK
652 if (ctx->recursion_depth > ctx->max_recursion_depth)
653 error (_("DWARF-2 expression error: Loop detected (%d)."),
654 ctx->recursion_depth);
655 ctx->recursion_depth++;
656
4c2df51b
DJ
657 while (op_ptr < op_end)
658 {
659 enum dwarf_location_atom op = *op_ptr++;
f2c7657e 660 ULONGEST result;
44353522
DE
661 /* Assume the value is not in stack memory.
662 Code that knows otherwise sets this to 1.
663 Some arithmetic on stack addresses can probably be assumed to still
664 be a stack address, but we skip this complication for now.
665 This is just an optimization, so it's always ok to punt
666 and leave this as 0. */
667 int in_stack_memory = 0;
9fccedf7
DE
668 uint64_t uoffset, reg;
669 int64_t offset;
8a9b8146 670 struct value *result_val = NULL;
4c2df51b 671
e0e9434c
TT
672 /* The DWARF expression might have a bug causing an infinite
673 loop. In that case, quitting is the only way out. */
674 QUIT;
675
4c2df51b
DJ
676 switch (op)
677 {
678 case DW_OP_lit0:
679 case DW_OP_lit1:
680 case DW_OP_lit2:
681 case DW_OP_lit3:
682 case DW_OP_lit4:
683 case DW_OP_lit5:
684 case DW_OP_lit6:
685 case DW_OP_lit7:
686 case DW_OP_lit8:
687 case DW_OP_lit9:
688 case DW_OP_lit10:
689 case DW_OP_lit11:
690 case DW_OP_lit12:
691 case DW_OP_lit13:
692 case DW_OP_lit14:
693 case DW_OP_lit15:
694 case DW_OP_lit16:
695 case DW_OP_lit17:
696 case DW_OP_lit18:
697 case DW_OP_lit19:
698 case DW_OP_lit20:
699 case DW_OP_lit21:
700 case DW_OP_lit22:
701 case DW_OP_lit23:
702 case DW_OP_lit24:
703 case DW_OP_lit25:
704 case DW_OP_lit26:
705 case DW_OP_lit27:
706 case DW_OP_lit28:
707 case DW_OP_lit29:
708 case DW_OP_lit30:
709 case DW_OP_lit31:
710 result = op - DW_OP_lit0;
8a9b8146 711 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
712 break;
713
714 case DW_OP_addr:
f2c7657e
UW
715 result = extract_unsigned_integer (op_ptr,
716 ctx->addr_size, byte_order);
ae0d2f24 717 op_ptr += ctx->addr_size;
ac56253d
TT
718 /* Some versions of GCC emit DW_OP_addr before
719 DW_OP_GNU_push_tls_address. In this case the value is an
720 index, not an address. We don't support things like
721 branching between the address and the TLS op. */
722 if (op_ptr >= op_end || *op_ptr != DW_OP_GNU_push_tls_address)
723 result += ctx->offset;
8a9b8146 724 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
725 break;
726
3019eac3 727 case DW_OP_GNU_addr_index:
49f6c839
DE
728 op_ptr = safe_read_uleb128 (op_ptr, op_end, &uoffset);
729 result = (ctx->funcs->get_addr_index) (ctx->baton, uoffset);
730 result += ctx->offset;
731 result_val = value_from_ulongest (address_type, result);
732 break;
733 case DW_OP_GNU_const_index:
f664829e 734 op_ptr = safe_read_uleb128 (op_ptr, op_end, &uoffset);
3019eac3
DE
735 result = (ctx->funcs->get_addr_index) (ctx->baton, uoffset);
736 result_val = value_from_ulongest (address_type, result);
737 break;
738
4c2df51b 739 case DW_OP_const1u:
e17a4113 740 result = extract_unsigned_integer (op_ptr, 1, byte_order);
8a9b8146 741 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
742 op_ptr += 1;
743 break;
744 case DW_OP_const1s:
e17a4113 745 result = extract_signed_integer (op_ptr, 1, byte_order);
8a9b8146 746 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
747 op_ptr += 1;
748 break;
749 case DW_OP_const2u:
e17a4113 750 result = extract_unsigned_integer (op_ptr, 2, byte_order);
8a9b8146 751 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
752 op_ptr += 2;
753 break;
754 case DW_OP_const2s:
e17a4113 755 result = extract_signed_integer (op_ptr, 2, byte_order);
8a9b8146 756 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
757 op_ptr += 2;
758 break;
759 case DW_OP_const4u:
e17a4113 760 result = extract_unsigned_integer (op_ptr, 4, byte_order);
8a9b8146 761 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
762 op_ptr += 4;
763 break;
764 case DW_OP_const4s:
e17a4113 765 result = extract_signed_integer (op_ptr, 4, byte_order);
8a9b8146 766 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
767 op_ptr += 4;
768 break;
769 case DW_OP_const8u:
e17a4113 770 result = extract_unsigned_integer (op_ptr, 8, byte_order);
8a9b8146 771 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
772 op_ptr += 8;
773 break;
774 case DW_OP_const8s:
e17a4113 775 result = extract_signed_integer (op_ptr, 8, byte_order);
8a9b8146 776 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
777 op_ptr += 8;
778 break;
779 case DW_OP_constu:
f664829e 780 op_ptr = safe_read_uleb128 (op_ptr, op_end, &uoffset);
4c2df51b 781 result = uoffset;
8a9b8146 782 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
783 break;
784 case DW_OP_consts:
f664829e 785 op_ptr = safe_read_sleb128 (op_ptr, op_end, &offset);
4c2df51b 786 result = offset;
8a9b8146 787 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
788 break;
789
790 /* The DW_OP_reg operations are required to occur alone in
791 location expressions. */
792 case DW_OP_reg0:
793 case DW_OP_reg1:
794 case DW_OP_reg2:
795 case DW_OP_reg3:
796 case DW_OP_reg4:
797 case DW_OP_reg5:
798 case DW_OP_reg6:
799 case DW_OP_reg7:
800 case DW_OP_reg8:
801 case DW_OP_reg9:
802 case DW_OP_reg10:
803 case DW_OP_reg11:
804 case DW_OP_reg12:
805 case DW_OP_reg13:
806 case DW_OP_reg14:
807 case DW_OP_reg15:
808 case DW_OP_reg16:
809 case DW_OP_reg17:
810 case DW_OP_reg18:
811 case DW_OP_reg19:
812 case DW_OP_reg20:
813 case DW_OP_reg21:
814 case DW_OP_reg22:
815 case DW_OP_reg23:
816 case DW_OP_reg24:
817 case DW_OP_reg25:
818 case DW_OP_reg26:
819 case DW_OP_reg27:
820 case DW_OP_reg28:
821 case DW_OP_reg29:
822 case DW_OP_reg30:
823 case DW_OP_reg31:
42be36b3
CT
824 if (op_ptr != op_end
825 && *op_ptr != DW_OP_piece
d3b1e874 826 && *op_ptr != DW_OP_bit_piece
42be36b3 827 && *op_ptr != DW_OP_GNU_uninit)
8a3fe4f8 828 error (_("DWARF-2 expression error: DW_OP_reg operations must be "
64b9b334 829 "used either alone or in conjunction with DW_OP_piece "
d3b1e874 830 "or DW_OP_bit_piece."));
4c2df51b 831
61fbb938 832 result = op - DW_OP_reg0;
8a9b8146 833 result_val = value_from_ulongest (address_type, result);
cec03d70 834 ctx->location = DWARF_VALUE_REGISTER;
4c2df51b
DJ
835 break;
836
837 case DW_OP_regx:
f664829e 838 op_ptr = safe_read_uleb128 (op_ptr, op_end, &reg);
3cf03773 839 dwarf_expr_require_composition (op_ptr, op_end, "DW_OP_regx");
4c2df51b 840
61fbb938 841 result = reg;
8a9b8146 842 result_val = value_from_ulongest (address_type, result);
cec03d70 843 ctx->location = DWARF_VALUE_REGISTER;
4c2df51b
DJ
844 break;
845
cec03d70
TT
846 case DW_OP_implicit_value:
847 {
9fccedf7 848 uint64_t len;
9a619af0 849
f664829e 850 op_ptr = safe_read_uleb128 (op_ptr, op_end, &len);
cec03d70
TT
851 if (op_ptr + len > op_end)
852 error (_("DW_OP_implicit_value: too few bytes available."));
853 ctx->len = len;
854 ctx->data = op_ptr;
855 ctx->location = DWARF_VALUE_LITERAL;
856 op_ptr += len;
3cf03773
TT
857 dwarf_expr_require_composition (op_ptr, op_end,
858 "DW_OP_implicit_value");
cec03d70
TT
859 }
860 goto no_push;
861
862 case DW_OP_stack_value:
863 ctx->location = DWARF_VALUE_STACK;
3cf03773 864 dwarf_expr_require_composition (op_ptr, op_end, "DW_OP_stack_value");
cec03d70
TT
865 goto no_push;
866
8cf6f0b1
TT
867 case DW_OP_GNU_implicit_pointer:
868 {
9fccedf7 869 int64_t len;
8cf6f0b1 870
181cebd4
JK
871 if (ctx->ref_addr_size == -1)
872 error (_("DWARF-2 expression error: DW_OP_GNU_implicit_pointer "
873 "is not allowed in frame context"));
874
8b9737bf 875 /* The referred-to DIE of sect_offset kind. */
181cebd4 876 ctx->len = extract_unsigned_integer (op_ptr, ctx->ref_addr_size,
8cf6f0b1 877 byte_order);
181cebd4 878 op_ptr += ctx->ref_addr_size;
8cf6f0b1
TT
879
880 /* The byte offset into the data. */
f664829e 881 op_ptr = safe_read_sleb128 (op_ptr, op_end, &len);
8cf6f0b1 882 result = (ULONGEST) len;
8a9b8146 883 result_val = value_from_ulongest (address_type, result);
8cf6f0b1
TT
884
885 ctx->location = DWARF_VALUE_IMPLICIT_POINTER;
886 dwarf_expr_require_composition (op_ptr, op_end,
887 "DW_OP_GNU_implicit_pointer");
888 }
889 break;
890
4c2df51b
DJ
891 case DW_OP_breg0:
892 case DW_OP_breg1:
893 case DW_OP_breg2:
894 case DW_OP_breg3:
895 case DW_OP_breg4:
896 case DW_OP_breg5:
897 case DW_OP_breg6:
898 case DW_OP_breg7:
899 case DW_OP_breg8:
900 case DW_OP_breg9:
901 case DW_OP_breg10:
902 case DW_OP_breg11:
903 case DW_OP_breg12:
904 case DW_OP_breg13:
905 case DW_OP_breg14:
906 case DW_OP_breg15:
907 case DW_OP_breg16:
908 case DW_OP_breg17:
909 case DW_OP_breg18:
910 case DW_OP_breg19:
911 case DW_OP_breg20:
912 case DW_OP_breg21:
913 case DW_OP_breg22:
914 case DW_OP_breg23:
915 case DW_OP_breg24:
916 case DW_OP_breg25:
917 case DW_OP_breg26:
918 case DW_OP_breg27:
919 case DW_OP_breg28:
920 case DW_OP_breg29:
921 case DW_OP_breg30:
922 case DW_OP_breg31:
923 {
f664829e 924 op_ptr = safe_read_sleb128 (op_ptr, op_end, &offset);
9e8b7a03 925 result = (ctx->funcs->read_reg) (ctx->baton, op - DW_OP_breg0);
4c2df51b 926 result += offset;
8a9b8146 927 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
928 }
929 break;
930 case DW_OP_bregx:
931 {
f664829e
DE
932 op_ptr = safe_read_uleb128 (op_ptr, op_end, &reg);
933 op_ptr = safe_read_sleb128 (op_ptr, op_end, &offset);
9e8b7a03 934 result = (ctx->funcs->read_reg) (ctx->baton, reg);
4c2df51b 935 result += offset;
8a9b8146 936 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
937 }
938 break;
939 case DW_OP_fbreg:
940 {
0d45f56e 941 const gdb_byte *datastart;
4c2df51b
DJ
942 size_t datalen;
943 unsigned int before_stack_len;
944
f664829e 945 op_ptr = safe_read_sleb128 (op_ptr, op_end, &offset);
4c2df51b
DJ
946 /* Rather than create a whole new context, we simply
947 record the stack length before execution, then reset it
948 afterwards, effectively erasing whatever the recursive
949 call put there. */
950 before_stack_len = ctx->stack_len;
da62e633
AC
951 /* FIXME: cagney/2003-03-26: This code should be using
952 get_frame_base_address(), and then implement a dwarf2
953 specific this_base method. */
9e8b7a03 954 (ctx->funcs->get_frame_base) (ctx->baton, &datastart, &datalen);
4c2df51b 955 dwarf_expr_eval (ctx, datastart, datalen);
f2c7657e
UW
956 if (ctx->location == DWARF_VALUE_MEMORY)
957 result = dwarf_expr_fetch_address (ctx, 0);
958 else if (ctx->location == DWARF_VALUE_REGISTER)
9e8b7a03
JK
959 result = (ctx->funcs->read_reg) (ctx->baton,
960 value_as_long (dwarf_expr_fetch (ctx, 0)));
f2c7657e 961 else
3e43a32a
MS
962 error (_("Not implemented: computing frame "
963 "base using explicit value operator"));
4c2df51b 964 result = result + offset;
8a9b8146 965 result_val = value_from_ulongest (address_type, result);
44353522 966 in_stack_memory = 1;
4c2df51b 967 ctx->stack_len = before_stack_len;
cec03d70 968 ctx->location = DWARF_VALUE_MEMORY;
4c2df51b
DJ
969 }
970 break;
44353522 971
4c2df51b 972 case DW_OP_dup:
8a9b8146 973 result_val = dwarf_expr_fetch (ctx, 0);
44353522 974 in_stack_memory = dwarf_expr_fetch_in_stack_memory (ctx, 0);
4c2df51b
DJ
975 break;
976
977 case DW_OP_drop:
978 dwarf_expr_pop (ctx);
979 goto no_push;
980
981 case DW_OP_pick:
982 offset = *op_ptr++;
8a9b8146 983 result_val = dwarf_expr_fetch (ctx, offset);
44353522 984 in_stack_memory = dwarf_expr_fetch_in_stack_memory (ctx, offset);
4c2df51b 985 break;
9f3fe11c
TG
986
987 case DW_OP_swap:
988 {
44353522 989 struct dwarf_stack_value t1, t2;
9f3fe11c
TG
990
991 if (ctx->stack_len < 2)
3e43a32a 992 error (_("Not enough elements for "
0963b4bd 993 "DW_OP_swap. Need 2, have %d."),
9f3fe11c
TG
994 ctx->stack_len);
995 t1 = ctx->stack[ctx->stack_len - 1];
996 t2 = ctx->stack[ctx->stack_len - 2];
997 ctx->stack[ctx->stack_len - 1] = t2;
998 ctx->stack[ctx->stack_len - 2] = t1;
999 goto no_push;
1000 }
4c2df51b
DJ
1001
1002 case DW_OP_over:
8a9b8146 1003 result_val = dwarf_expr_fetch (ctx, 1);
44353522 1004 in_stack_memory = dwarf_expr_fetch_in_stack_memory (ctx, 1);
4c2df51b
DJ
1005 break;
1006
1007 case DW_OP_rot:
1008 {
44353522 1009 struct dwarf_stack_value t1, t2, t3;
4c2df51b
DJ
1010
1011 if (ctx->stack_len < 3)
0963b4bd
MS
1012 error (_("Not enough elements for "
1013 "DW_OP_rot. Need 3, have %d."),
4c2df51b
DJ
1014 ctx->stack_len);
1015 t1 = ctx->stack[ctx->stack_len - 1];
1016 t2 = ctx->stack[ctx->stack_len - 2];
1017 t3 = ctx->stack[ctx->stack_len - 3];
1018 ctx->stack[ctx->stack_len - 1] = t2;
1019 ctx->stack[ctx->stack_len - 2] = t3;
1020 ctx->stack[ctx->stack_len - 3] = t1;
1021 goto no_push;
1022 }
1023
1024 case DW_OP_deref:
1025 case DW_OP_deref_size:
8a9b8146 1026 case DW_OP_GNU_deref_type:
f2c7657e
UW
1027 {
1028 int addr_size = (op == DW_OP_deref ? ctx->addr_size : *op_ptr++);
1029 gdb_byte *buf = alloca (addr_size);
1030 CORE_ADDR addr = dwarf_expr_fetch_address (ctx, 0);
8a9b8146
TT
1031 struct type *type;
1032
f2c7657e
UW
1033 dwarf_expr_pop (ctx);
1034
8a9b8146
TT
1035 if (op == DW_OP_GNU_deref_type)
1036 {
b64f50a1 1037 cu_offset type_die;
8a9b8146 1038
f664829e 1039 op_ptr = safe_read_uleb128 (op_ptr, op_end, &uoffset);
b64f50a1 1040 type_die.cu_off = uoffset;
8a9b8146
TT
1041 type = dwarf_get_base_type (ctx, type_die, 0);
1042 }
1043 else
1044 type = address_type;
1045
9e8b7a03 1046 (ctx->funcs->read_mem) (ctx->baton, buf, addr, addr_size);
325663dc
JB
1047
1048 /* If the size of the object read from memory is different
1049 from the type length, we need to zero-extend it. */
1050 if (TYPE_LENGTH (type) != addr_size)
1051 {
1052 ULONGEST result =
1053 extract_unsigned_integer (buf, addr_size, byte_order);
1054
1055 buf = alloca (TYPE_LENGTH (type));
1056 store_unsigned_integer (buf, TYPE_LENGTH (type),
1057 byte_order, result);
1058 }
1059
8a9b8146 1060 result_val = value_from_contents_and_address (type, buf, addr);
f2c7657e
UW
1061 break;
1062 }
1063
4c2df51b
DJ
1064 case DW_OP_abs:
1065 case DW_OP_neg:
1066 case DW_OP_not:
1067 case DW_OP_plus_uconst:
8a9b8146
TT
1068 {
1069 /* Unary operations. */
1070 result_val = dwarf_expr_fetch (ctx, 0);
1071 dwarf_expr_pop (ctx);
4c2df51b 1072
8a9b8146
TT
1073 switch (op)
1074 {
1075 case DW_OP_abs:
1076 if (value_less (result_val,
1077 value_zero (value_type (result_val), not_lval)))
1078 result_val = value_neg (result_val);
1079 break;
1080 case DW_OP_neg:
1081 result_val = value_neg (result_val);
1082 break;
1083 case DW_OP_not:
1084 dwarf_require_integral (value_type (result_val));
1085 result_val = value_complement (result_val);
1086 break;
1087 case DW_OP_plus_uconst:
1088 dwarf_require_integral (value_type (result_val));
1089 result = value_as_long (result_val);
f664829e 1090 op_ptr = safe_read_uleb128 (op_ptr, op_end, &reg);
8a9b8146
TT
1091 result += reg;
1092 result_val = value_from_ulongest (address_type, result);
1093 break;
1094 }
1095 }
4c2df51b
DJ
1096 break;
1097
1098 case DW_OP_and:
1099 case DW_OP_div:
1100 case DW_OP_minus:
1101 case DW_OP_mod:
1102 case DW_OP_mul:
1103 case DW_OP_or:
1104 case DW_OP_plus:
1105 case DW_OP_shl:
1106 case DW_OP_shr:
1107 case DW_OP_shra:
1108 case DW_OP_xor:
1109 case DW_OP_le:
1110 case DW_OP_ge:
1111 case DW_OP_eq:
1112 case DW_OP_lt:
1113 case DW_OP_gt:
1114 case DW_OP_ne:
1115 {
f2c7657e 1116 /* Binary operations. */
8a9b8146 1117 struct value *first, *second;
4c2df51b
DJ
1118
1119 second = dwarf_expr_fetch (ctx, 0);
1120 dwarf_expr_pop (ctx);
1121
b263358a 1122 first = dwarf_expr_fetch (ctx, 0);
4c2df51b
DJ
1123 dwarf_expr_pop (ctx);
1124
8a9b8146
TT
1125 if (! base_types_equal_p (value_type (first), value_type (second)))
1126 error (_("Incompatible types on DWARF stack"));
1127
4c2df51b
DJ
1128 switch (op)
1129 {
1130 case DW_OP_and:
8a9b8146
TT
1131 dwarf_require_integral (value_type (first));
1132 dwarf_require_integral (value_type (second));
1133 result_val = value_binop (first, second, BINOP_BITWISE_AND);
4c2df51b
DJ
1134 break;
1135 case DW_OP_div:
8a9b8146 1136 result_val = value_binop (first, second, BINOP_DIV);
99c87dab 1137 break;
4c2df51b 1138 case DW_OP_minus:
8a9b8146 1139 result_val = value_binop (first, second, BINOP_SUB);
4c2df51b
DJ
1140 break;
1141 case DW_OP_mod:
8a9b8146
TT
1142 {
1143 int cast_back = 0;
1144 struct type *orig_type = value_type (first);
1145
1146 /* We have to special-case "old-style" untyped values
1147 -- these must have mod computed using unsigned
1148 math. */
1149 if (orig_type == address_type)
1150 {
1151 struct type *utype
1152 = get_unsigned_type (ctx->gdbarch, orig_type);
1153
1154 cast_back = 1;
1155 first = value_cast (utype, first);
1156 second = value_cast (utype, second);
1157 }
1158 /* Note that value_binop doesn't handle float or
1159 decimal float here. This seems unimportant. */
1160 result_val = value_binop (first, second, BINOP_MOD);
1161 if (cast_back)
1162 result_val = value_cast (orig_type, result_val);
1163 }
4c2df51b
DJ
1164 break;
1165 case DW_OP_mul:
8a9b8146 1166 result_val = value_binop (first, second, BINOP_MUL);
4c2df51b
DJ
1167 break;
1168 case DW_OP_or:
8a9b8146
TT
1169 dwarf_require_integral (value_type (first));
1170 dwarf_require_integral (value_type (second));
1171 result_val = value_binop (first, second, BINOP_BITWISE_IOR);
4c2df51b
DJ
1172 break;
1173 case DW_OP_plus:
8a9b8146 1174 result_val = value_binop (first, second, BINOP_ADD);
4c2df51b
DJ
1175 break;
1176 case DW_OP_shl:
8a9b8146
TT
1177 dwarf_require_integral (value_type (first));
1178 dwarf_require_integral (value_type (second));
1179 result_val = value_binop (first, second, BINOP_LSH);
4c2df51b
DJ
1180 break;
1181 case DW_OP_shr:
8a9b8146
TT
1182 dwarf_require_integral (value_type (first));
1183 dwarf_require_integral (value_type (second));
b087e0ed 1184 if (!TYPE_UNSIGNED (value_type (first)))
8a9b8146
TT
1185 {
1186 struct type *utype
1187 = get_unsigned_type (ctx->gdbarch, value_type (first));
1188
1189 first = value_cast (utype, first);
1190 }
1191
1192 result_val = value_binop (first, second, BINOP_RSH);
1193 /* Make sure we wind up with the same type we started
1194 with. */
1195 if (value_type (result_val) != value_type (second))
1196 result_val = value_cast (value_type (second), result_val);
99c87dab 1197 break;
4c2df51b 1198 case DW_OP_shra:
8a9b8146
TT
1199 dwarf_require_integral (value_type (first));
1200 dwarf_require_integral (value_type (second));
8ddd9a20
TT
1201 if (TYPE_UNSIGNED (value_type (first)))
1202 {
1203 struct type *stype
1204 = get_signed_type (ctx->gdbarch, value_type (first));
1205
1206 first = value_cast (stype, first);
1207 }
1208
8a9b8146 1209 result_val = value_binop (first, second, BINOP_RSH);
8ddd9a20
TT
1210 /* Make sure we wind up with the same type we started
1211 with. */
1212 if (value_type (result_val) != value_type (second))
1213 result_val = value_cast (value_type (second), result_val);
4c2df51b
DJ
1214 break;
1215 case DW_OP_xor:
8a9b8146
TT
1216 dwarf_require_integral (value_type (first));
1217 dwarf_require_integral (value_type (second));
1218 result_val = value_binop (first, second, BINOP_BITWISE_XOR);
4c2df51b
DJ
1219 break;
1220 case DW_OP_le:
8a9b8146
TT
1221 /* A <= B is !(B < A). */
1222 result = ! value_less (second, first);
1223 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
1224 break;
1225 case DW_OP_ge:
8a9b8146
TT
1226 /* A >= B is !(A < B). */
1227 result = ! value_less (first, second);
1228 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
1229 break;
1230 case DW_OP_eq:
8a9b8146
TT
1231 result = value_equal (first, second);
1232 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
1233 break;
1234 case DW_OP_lt:
8a9b8146
TT
1235 result = value_less (first, second);
1236 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
1237 break;
1238 case DW_OP_gt:
8a9b8146
TT
1239 /* A > B is B < A. */
1240 result = value_less (second, first);
1241 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
1242 break;
1243 case DW_OP_ne:
8a9b8146
TT
1244 result = ! value_equal (first, second);
1245 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
1246 break;
1247 default:
1248 internal_error (__FILE__, __LINE__,
e2e0b3e5 1249 _("Can't be reached."));
4c2df51b 1250 }
4c2df51b
DJ
1251 }
1252 break;
1253
e7802207 1254 case DW_OP_call_frame_cfa:
9e8b7a03 1255 result = (ctx->funcs->get_frame_cfa) (ctx->baton);
8a9b8146 1256 result_val = value_from_ulongest (address_type, result);
44353522 1257 in_stack_memory = 1;
e7802207
TT
1258 break;
1259
4c2df51b 1260 case DW_OP_GNU_push_tls_address:
c3228f12
EZ
1261 /* Variable is at a constant offset in the thread-local
1262 storage block into the objfile for the current thread and
0963b4bd 1263 the dynamic linker module containing this expression. Here
c3228f12
EZ
1264 we return returns the offset from that base. The top of the
1265 stack has the offset from the beginning of the thread
1266 control block at which the variable is located. Nothing
1267 should follow this operator, so the top of stack would be
1268 returned. */
8a9b8146 1269 result = value_as_long (dwarf_expr_fetch (ctx, 0));
4c2df51b 1270 dwarf_expr_pop (ctx);
9e8b7a03 1271 result = (ctx->funcs->get_tls_address) (ctx->baton, result);
8a9b8146 1272 result_val = value_from_ulongest (address_type, result);
4c2df51b
DJ
1273 break;
1274
1275 case DW_OP_skip:
e17a4113 1276 offset = extract_signed_integer (op_ptr, 2, byte_order);
4c2df51b
DJ
1277 op_ptr += 2;
1278 op_ptr += offset;
1279 goto no_push;
1280
1281 case DW_OP_bra:
8a9b8146
TT
1282 {
1283 struct value *val;
1284
1285 offset = extract_signed_integer (op_ptr, 2, byte_order);
1286 op_ptr += 2;
1287 val = dwarf_expr_fetch (ctx, 0);
1288 dwarf_require_integral (value_type (val));
1289 if (value_as_long (val) != 0)
1290 op_ptr += offset;
1291 dwarf_expr_pop (ctx);
1292 }
4c2df51b
DJ
1293 goto no_push;
1294
1295 case DW_OP_nop:
1296 goto no_push;
1297
87808bd6
JB
1298 case DW_OP_piece:
1299 {
9fccedf7 1300 uint64_t size;
87808bd6
JB
1301
1302 /* Record the piece. */
f664829e 1303 op_ptr = safe_read_uleb128 (op_ptr, op_end, &size);
d3b1e874 1304 add_piece (ctx, 8 * size, 0);
87808bd6 1305
cec03d70
TT
1306 /* Pop off the address/regnum, and reset the location
1307 type. */
cb826367
TT
1308 if (ctx->location != DWARF_VALUE_LITERAL
1309 && ctx->location != DWARF_VALUE_OPTIMIZED_OUT)
cec03d70
TT
1310 dwarf_expr_pop (ctx);
1311 ctx->location = DWARF_VALUE_MEMORY;
87808bd6
JB
1312 }
1313 goto no_push;
1314
d3b1e874
TT
1315 case DW_OP_bit_piece:
1316 {
9fccedf7 1317 uint64_t size, offset;
d3b1e874
TT
1318
1319 /* Record the piece. */
f664829e
DE
1320 op_ptr = safe_read_uleb128 (op_ptr, op_end, &size);
1321 op_ptr = safe_read_uleb128 (op_ptr, op_end, &offset);
d3b1e874
TT
1322 add_piece (ctx, size, offset);
1323
1324 /* Pop off the address/regnum, and reset the location
1325 type. */
1326 if (ctx->location != DWARF_VALUE_LITERAL
1327 && ctx->location != DWARF_VALUE_OPTIMIZED_OUT)
1328 dwarf_expr_pop (ctx);
1329 ctx->location = DWARF_VALUE_MEMORY;
1330 }
1331 goto no_push;
1332
42be36b3
CT
1333 case DW_OP_GNU_uninit:
1334 if (op_ptr != op_end)
9c482037 1335 error (_("DWARF-2 expression error: DW_OP_GNU_uninit must always "
42be36b3
CT
1336 "be the very last op."));
1337
1338 ctx->initialized = 0;
1339 goto no_push;
1340
5c631832 1341 case DW_OP_call2:
b64f50a1
JK
1342 {
1343 cu_offset offset;
1344
1345 offset.cu_off = extract_unsigned_integer (op_ptr, 2, byte_order);
1346 op_ptr += 2;
1347 ctx->funcs->dwarf_call (ctx, offset);
1348 }
5c631832
JK
1349 goto no_push;
1350
1351 case DW_OP_call4:
b64f50a1
JK
1352 {
1353 cu_offset offset;
1354
1355 offset.cu_off = extract_unsigned_integer (op_ptr, 4, byte_order);
1356 op_ptr += 4;
1357 ctx->funcs->dwarf_call (ctx, offset);
1358 }
5c631832 1359 goto no_push;
dd90784c
JK
1360
1361 case DW_OP_GNU_entry_value:
8e3b41a9 1362 {
9fccedf7 1363 uint64_t len;
8e3b41a9 1364 CORE_ADDR deref_size;
24c5c679 1365 union call_site_parameter_u kind_u;
8e3b41a9 1366
f664829e 1367 op_ptr = safe_read_uleb128 (op_ptr, op_end, &len);
8e3b41a9
JK
1368 if (op_ptr + len > op_end)
1369 error (_("DW_OP_GNU_entry_value: too few bytes available."));
1370
24c5c679
JK
1371 kind_u.dwarf_reg = dwarf_block_to_dwarf_reg (op_ptr, op_ptr + len);
1372 if (kind_u.dwarf_reg != -1)
8e3b41a9
JK
1373 {
1374 op_ptr += len;
24c5c679
JK
1375 ctx->funcs->push_dwarf_reg_entry_value (ctx,
1376 CALL_SITE_PARAMETER_DWARF_REG,
1377 kind_u,
a471c594
JK
1378 -1 /* deref_size */);
1379 goto no_push;
1380 }
1381
24c5c679
JK
1382 kind_u.dwarf_reg = dwarf_block_to_dwarf_reg_deref (op_ptr,
1383 op_ptr + len,
1384 &deref_size);
1385 if (kind_u.dwarf_reg != -1)
a471c594
JK
1386 {
1387 if (deref_size == -1)
1388 deref_size = ctx->addr_size;
1389 op_ptr += len;
24c5c679
JK
1390 ctx->funcs->push_dwarf_reg_entry_value (ctx,
1391 CALL_SITE_PARAMETER_DWARF_REG,
1392 kind_u, deref_size);
8e3b41a9
JK
1393 goto no_push;
1394 }
1395
1396 error (_("DWARF-2 expression error: DW_OP_GNU_entry_value is "
a471c594
JK
1397 "supported only for single DW_OP_reg* "
1398 "or for DW_OP_breg*(0)+DW_OP_deref*"));
8e3b41a9 1399 }
5c631832 1400
1788b2d3
JK
1401 case DW_OP_GNU_parameter_ref:
1402 {
1403 union call_site_parameter_u kind_u;
1404
1405 kind_u.param_offset.cu_off = extract_unsigned_integer (op_ptr, 4,
1406 byte_order);
1407 op_ptr += 4;
1408 ctx->funcs->push_dwarf_reg_entry_value (ctx,
1409 CALL_SITE_PARAMETER_PARAM_OFFSET,
1410 kind_u,
1411 -1 /* deref_size */);
1412 }
1413 goto no_push;
1414
8a9b8146
TT
1415 case DW_OP_GNU_const_type:
1416 {
b64f50a1 1417 cu_offset type_die;
8a9b8146
TT
1418 int n;
1419 const gdb_byte *data;
1420 struct type *type;
1421
f664829e 1422 op_ptr = safe_read_uleb128 (op_ptr, op_end, &uoffset);
b64f50a1 1423 type_die.cu_off = uoffset;
8a9b8146
TT
1424 n = *op_ptr++;
1425 data = op_ptr;
1426 op_ptr += n;
1427
1428 type = dwarf_get_base_type (ctx, type_die, n);
1429 result_val = value_from_contents (type, data);
1430 }
1431 break;
1432
1433 case DW_OP_GNU_regval_type:
1434 {
b64f50a1 1435 cu_offset type_die;
8a9b8146
TT
1436 struct type *type;
1437
f664829e
DE
1438 op_ptr = safe_read_uleb128 (op_ptr, op_end, &reg);
1439 op_ptr = safe_read_uleb128 (op_ptr, op_end, &uoffset);
b64f50a1 1440 type_die.cu_off = uoffset;
8a9b8146
TT
1441
1442 type = dwarf_get_base_type (ctx, type_die, 0);
9e8b7a03 1443 result = (ctx->funcs->read_reg) (ctx->baton, reg);
d1b66e6d
TT
1444 result_val = value_from_ulongest (address_type, result);
1445 result_val = value_from_contents (type,
1446 value_contents_all (result_val));
8a9b8146
TT
1447 }
1448 break;
1449
1450 case DW_OP_GNU_convert:
1451 case DW_OP_GNU_reinterpret:
1452 {
b64f50a1 1453 cu_offset type_die;
8a9b8146
TT
1454 struct type *type;
1455
f664829e 1456 op_ptr = safe_read_uleb128 (op_ptr, op_end, &uoffset);
b64f50a1 1457 type_die.cu_off = uoffset;
8a9b8146 1458
b64f50a1 1459 if (type_die.cu_off == 0)
c38c4bc5
TT
1460 type = address_type;
1461 else
1462 type = dwarf_get_base_type (ctx, type_die, 0);
8a9b8146
TT
1463
1464 result_val = dwarf_expr_fetch (ctx, 0);
1465 dwarf_expr_pop (ctx);
1466
1467 if (op == DW_OP_GNU_convert)
1468 result_val = value_cast (type, result_val);
1469 else if (type == value_type (result_val))
1470 {
1471 /* Nothing. */
1472 }
1473 else if (TYPE_LENGTH (type)
1474 != TYPE_LENGTH (value_type (result_val)))
1475 error (_("DW_OP_GNU_reinterpret has wrong size"));
1476 else
1477 result_val
1478 = value_from_contents (type,
1479 value_contents_all (result_val));
1480 }
1481 break;
1482
4c2df51b 1483 default:
8a3fe4f8 1484 error (_("Unhandled dwarf expression opcode 0x%x"), op);
4c2df51b
DJ
1485 }
1486
1487 /* Most things push a result value. */
8a9b8146
TT
1488 gdb_assert (result_val != NULL);
1489 dwarf_expr_push (ctx, result_val, in_stack_memory);
82ae4854 1490 no_push:
b27cf2b3 1491 ;
4c2df51b 1492 }
1e3a102a 1493
8cf6f0b1
TT
1494 /* To simplify our main caller, if the result is an implicit
1495 pointer, then make a pieced value. This is ok because we can't
1496 have implicit pointers in contexts where pieces are invalid. */
1497 if (ctx->location == DWARF_VALUE_IMPLICIT_POINTER)
1498 add_piece (ctx, 8 * ctx->addr_size, 0);
1499
dd90784c 1500abort_expression:
1e3a102a
JK
1501 ctx->recursion_depth--;
1502 gdb_assert (ctx->recursion_depth >= 0);
8a9b8146
TT
1503}
1504
523f3620
JK
1505/* Stub dwarf_expr_context_funcs.get_frame_base implementation. */
1506
1507void
1508ctx_no_get_frame_base (void *baton, const gdb_byte **start, size_t *length)
1509{
1510 error (_("%s is invalid in this context"), "DW_OP_fbreg");
1511}
1512
1513/* Stub dwarf_expr_context_funcs.get_frame_cfa implementation. */
1514
1515CORE_ADDR
1516ctx_no_get_frame_cfa (void *baton)
1517{
1518 error (_("%s is invalid in this context"), "DW_OP_call_frame_cfa");
1519}
1520
1521/* Stub dwarf_expr_context_funcs.get_frame_pc implementation. */
1522
1523CORE_ADDR
1524ctx_no_get_frame_pc (void *baton)
1525{
1526 error (_("%s is invalid in this context"), "DW_OP_GNU_implicit_pointer");
1527}
1528
1529/* Stub dwarf_expr_context_funcs.get_tls_address implementation. */
1530
1531CORE_ADDR
1532ctx_no_get_tls_address (void *baton, CORE_ADDR offset)
1533{
1534 error (_("%s is invalid in this context"), "DW_OP_GNU_push_tls_address");
1535}
1536
1537/* Stub dwarf_expr_context_funcs.dwarf_call implementation. */
1538
1539void
b64f50a1 1540ctx_no_dwarf_call (struct dwarf_expr_context *ctx, cu_offset die_offset)
523f3620
JK
1541{
1542 error (_("%s is invalid in this context"), "DW_OP_call*");
1543}
1544
1545/* Stub dwarf_expr_context_funcs.get_base_type implementation. */
1546
1547struct type *
b64f50a1 1548ctx_no_get_base_type (struct dwarf_expr_context *ctx, cu_offset die)
523f3620
JK
1549{
1550 error (_("Support for typed DWARF is not supported in this context"));
1551}
1552
8e3b41a9
JK
1553/* Stub dwarf_expr_context_funcs.push_dwarf_block_entry_value
1554 implementation. */
1555
1556void
1557ctx_no_push_dwarf_reg_entry_value (struct dwarf_expr_context *ctx,
24c5c679
JK
1558 enum call_site_parameter_kind kind,
1559 union call_site_parameter_u kind_u,
a471c594 1560 int deref_size)
8e3b41a9
JK
1561{
1562 internal_error (__FILE__, __LINE__,
1563 _("Support for DW_OP_GNU_entry_value is unimplemented"));
1564}
1565
3019eac3
DE
1566/* Stub dwarf_expr_context_funcs.get_addr_index implementation. */
1567
1568CORE_ADDR
1569ctx_no_get_addr_index (void *baton, unsigned int index)
1570{
1571 error (_("%s is invalid in this context"), "DW_OP_GNU_addr_index");
1572}
1573
70221824
PA
1574/* Provide a prototype to silence -Wmissing-prototypes. */
1575extern initialize_file_ftype _initialize_dwarf2expr;
1576
8a9b8146
TT
1577void
1578_initialize_dwarf2expr (void)
1579{
1580 dwarf_arch_cookie
1581 = gdbarch_data_register_post_init (dwarf_gdbarch_types_init);
4c2df51b 1582}
This page took 0.749515 seconds and 4 git commands to generate.