Commit | Line | Data |
---|---|---|
55aa24fb SDJ |
1 | /* SystemTap probe support for GDB. |
2 | ||
42a4f53d | 3 | Copyright (C) 2012-2019 Free Software Foundation, Inc. |
55aa24fb SDJ |
4 | |
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 3 of the License, or | |
10 | (at your option) any later version. | |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ | |
19 | ||
20 | #include "defs.h" | |
21 | #include "stap-probe.h" | |
22 | #include "probe.h" | |
0747795c | 23 | #include "common/vec.h" |
55aa24fb SDJ |
24 | #include "ui-out.h" |
25 | #include "objfiles.h" | |
26 | #include "arch-utils.h" | |
27 | #include "command.h" | |
28 | #include "gdbcmd.h" | |
29 | #include "filenames.h" | |
30 | #include "value.h" | |
55aa24fb SDJ |
31 | #include "ax.h" |
32 | #include "ax-gdb.h" | |
33 | #include "complaints.h" | |
34 | #include "cli/cli-utils.h" | |
35 | #include "linespec.h" | |
36 | #include "user-regs.h" | |
37 | #include "parser-defs.h" | |
38 | #include "language.h" | |
39 | #include "elf-bfd.h" | |
40 | ||
41 | #include <ctype.h> | |
42 | ||
43 | /* The name of the SystemTap section where we will find information about | |
44 | the probes. */ | |
45 | ||
46 | #define STAP_BASE_SECTION_NAME ".stapsdt.base" | |
47 | ||
55aa24fb SDJ |
48 | /* Should we display debug information for the probe's argument expression |
49 | parsing? */ | |
50 | ||
ccce17b0 | 51 | static unsigned int stap_expression_debug = 0; |
55aa24fb SDJ |
52 | |
53 | /* The various possibilities of bitness defined for a probe's argument. | |
54 | ||
55 | The relationship is: | |
56 | ||
57 | - STAP_ARG_BITNESS_UNDEFINED: The user hasn't specified the bitness. | |
30a1e6cc SDJ |
58 | - STAP_ARG_BITNESS_8BIT_UNSIGNED: argument string starts with `1@'. |
59 | - STAP_ARG_BITNESS_8BIT_SIGNED: argument string starts with `-1@'. | |
60 | - STAP_ARG_BITNESS_16BIT_UNSIGNED: argument string starts with `2@'. | |
61 | - STAP_ARG_BITNESS_16BIT_SIGNED: argument string starts with `-2@'. | |
55aa24fb SDJ |
62 | - STAP_ARG_BITNESS_32BIT_UNSIGNED: argument string starts with `4@'. |
63 | - STAP_ARG_BITNESS_32BIT_SIGNED: argument string starts with `-4@'. | |
64 | - STAP_ARG_BITNESS_64BIT_UNSIGNED: argument string starts with `8@'. | |
65 | - STAP_ARG_BITNESS_64BIT_SIGNED: argument string starts with `-8@'. */ | |
66 | ||
67 | enum stap_arg_bitness | |
68 | { | |
69 | STAP_ARG_BITNESS_UNDEFINED, | |
30a1e6cc SDJ |
70 | STAP_ARG_BITNESS_8BIT_UNSIGNED, |
71 | STAP_ARG_BITNESS_8BIT_SIGNED, | |
72 | STAP_ARG_BITNESS_16BIT_UNSIGNED, | |
73 | STAP_ARG_BITNESS_16BIT_SIGNED, | |
55aa24fb SDJ |
74 | STAP_ARG_BITNESS_32BIT_UNSIGNED, |
75 | STAP_ARG_BITNESS_32BIT_SIGNED, | |
76 | STAP_ARG_BITNESS_64BIT_UNSIGNED, | |
77 | STAP_ARG_BITNESS_64BIT_SIGNED, | |
78 | }; | |
79 | ||
80 | /* The following structure represents a single argument for the probe. */ | |
81 | ||
82 | struct stap_probe_arg | |
83 | { | |
0e9ae10f SDJ |
84 | /* Constructor for stap_probe_arg. */ |
85 | stap_probe_arg (enum stap_arg_bitness bitness_, struct type *atype_, | |
86 | expression_up &&aexpr_) | |
87 | : bitness (bitness_), atype (atype_), aexpr (std::move (aexpr_)) | |
88 | {} | |
89 | ||
55aa24fb SDJ |
90 | /* The bitness of this argument. */ |
91 | enum stap_arg_bitness bitness; | |
92 | ||
93 | /* The corresponding `struct type *' to the bitness. */ | |
94 | struct type *atype; | |
95 | ||
96 | /* The argument converted to an internal GDB expression. */ | |
0e9ae10f | 97 | expression_up aexpr; |
55aa24fb SDJ |
98 | }; |
99 | ||
0e9ae10f | 100 | /* Class that implements the static probe methods for "stap" probes. */ |
55aa24fb | 101 | |
0e9ae10f | 102 | class stap_static_probe_ops : public static_probe_ops |
55aa24fb | 103 | { |
0e9ae10f SDJ |
104 | public: |
105 | /* See probe.h. */ | |
106 | bool is_linespec (const char **linespecp) const override; | |
55aa24fb | 107 | |
0e9ae10f | 108 | /* See probe.h. */ |
814cf43a | 109 | void get_probes (std::vector<std::unique_ptr<probe>> *probesp, |
0e9ae10f SDJ |
110 | struct objfile *objfile) const override; |
111 | ||
112 | /* See probe.h. */ | |
113 | const char *type_name () const override; | |
114 | ||
115 | /* See probe.h. */ | |
116 | std::vector<struct info_probe_column> gen_info_probes_table_header | |
117 | () const override; | |
118 | }; | |
119 | ||
120 | /* SystemTap static_probe_ops. */ | |
121 | ||
3dcfdc58 | 122 | const stap_static_probe_ops stap_static_probe_ops {}; |
0e9ae10f SDJ |
123 | |
124 | class stap_probe : public probe | |
125 | { | |
126 | public: | |
127 | /* Constructor for stap_probe. */ | |
128 | stap_probe (std::string &&name_, std::string &&provider_, CORE_ADDR address_, | |
129 | struct gdbarch *arch_, CORE_ADDR sem_addr, const char *args_text) | |
130 | : probe (std::move (name_), std::move (provider_), address_, arch_), | |
131 | m_sem_addr (sem_addr), | |
132 | m_have_parsed_args (false), m_unparsed_args_text (args_text) | |
133 | {} | |
134 | ||
135 | /* See probe.h. */ | |
136 | CORE_ADDR get_relocated_address (struct objfile *objfile) override; | |
137 | ||
138 | /* See probe.h. */ | |
139 | unsigned get_argument_count (struct frame_info *frame) override; | |
140 | ||
141 | /* See probe.h. */ | |
142 | bool can_evaluate_arguments () const override; | |
143 | ||
144 | /* See probe.h. */ | |
145 | struct value *evaluate_argument (unsigned n, | |
146 | struct frame_info *frame) override; | |
147 | ||
148 | /* See probe.h. */ | |
149 | void compile_to_ax (struct agent_expr *aexpr, | |
150 | struct axs_value *axs_value, | |
151 | unsigned n) override; | |
152 | ||
153 | /* See probe.h. */ | |
154 | void set_semaphore (struct objfile *objfile, | |
155 | struct gdbarch *gdbarch) override; | |
156 | ||
157 | /* See probe.h. */ | |
158 | void clear_semaphore (struct objfile *objfile, | |
159 | struct gdbarch *gdbarch) override; | |
160 | ||
161 | /* See probe.h. */ | |
162 | const static_probe_ops *get_static_ops () const override; | |
163 | ||
164 | /* See probe.h. */ | |
165 | std::vector<const char *> gen_info_probes_table_values () const override; | |
166 | ||
167 | /* Return argument N of probe. | |
168 | ||
169 | If the probe's arguments have not been parsed yet, parse them. If | |
170 | there are no arguments, throw an exception (error). Otherwise, | |
171 | return the requested argument. */ | |
172 | struct stap_probe_arg *get_arg_by_number (unsigned n, | |
173 | struct gdbarch *gdbarch) | |
174 | { | |
175 | if (!m_have_parsed_args) | |
176 | this->parse_arguments (gdbarch); | |
177 | ||
178 | gdb_assert (m_have_parsed_args); | |
179 | if (m_parsed_args.empty ()) | |
180 | internal_error (__FILE__, __LINE__, | |
181 | _("Probe '%s' apparently does not have arguments, but \n" | |
182 | "GDB is requesting its argument number %u anyway. " | |
183 | "This should not happen. Please report this bug."), | |
184 | this->get_name ().c_str (), n); | |
185 | ||
186 | if (n > m_parsed_args.size ()) | |
187 | internal_error (__FILE__, __LINE__, | |
188 | _("Probe '%s' has %d arguments, but GDB is requesting\n" | |
189 | "argument %u. This should not happen. Please\n" | |
190 | "report this bug."), | |
191 | this->get_name ().c_str (), | |
192 | (int) m_parsed_args.size (), n); | |
193 | ||
194 | return &m_parsed_args[n]; | |
195 | } | |
196 | ||
197 | /* Function which parses an argument string from the probe, | |
198 | correctly splitting the arguments and storing their information | |
199 | in properly ways. | |
200 | ||
201 | Consider the following argument string (x86 syntax): | |
202 | ||
203 | `4@%eax 4@$10' | |
204 | ||
205 | We have two arguments, `%eax' and `$10', both with 32-bit | |
206 | unsigned bitness. This function basically handles them, properly | |
207 | filling some structures with this information. */ | |
208 | void parse_arguments (struct gdbarch *gdbarch); | |
209 | ||
210 | private: | |
55aa24fb | 211 | /* If the probe has a semaphore associated, then this is the value of |
729662a5 | 212 | it, relative to SECT_OFF_DATA. */ |
0e9ae10f | 213 | CORE_ADDR m_sem_addr; |
55aa24fb | 214 | |
0e9ae10f SDJ |
215 | /* True if the arguments have been parsed. */ |
216 | bool m_have_parsed_args; | |
97c2dca0 | 217 | |
0e9ae10f SDJ |
218 | /* The text version of the probe's arguments, unparsed. */ |
219 | const char *m_unparsed_args_text; | |
55aa24fb | 220 | |
0e9ae10f SDJ |
221 | /* Information about each argument. This is an array of `stap_probe_arg', |
222 | with each entry representing one argument. This is only valid if | |
223 | M_ARGS_PARSED is true. */ | |
224 | std::vector<struct stap_probe_arg> m_parsed_args; | |
55aa24fb SDJ |
225 | }; |
226 | ||
227 | /* When parsing the arguments, we have to establish different precedences | |
228 | for the various kinds of asm operators. This enumeration represents those | |
229 | precedences. | |
230 | ||
231 | This logic behind this is available at | |
232 | <http://sourceware.org/binutils/docs/as/Infix-Ops.html#Infix-Ops>, or using | |
233 | the command "info '(as)Infix Ops'". */ | |
234 | ||
235 | enum stap_operand_prec | |
236 | { | |
237 | /* Lowest precedence, used for non-recognized operands or for the beginning | |
238 | of the parsing process. */ | |
239 | STAP_OPERAND_PREC_NONE = 0, | |
240 | ||
241 | /* Precedence of logical OR. */ | |
242 | STAP_OPERAND_PREC_LOGICAL_OR, | |
243 | ||
244 | /* Precedence of logical AND. */ | |
245 | STAP_OPERAND_PREC_LOGICAL_AND, | |
246 | ||
247 | /* Precedence of additive (plus, minus) and comparative (equal, less, | |
248 | greater-than, etc) operands. */ | |
249 | STAP_OPERAND_PREC_ADD_CMP, | |
250 | ||
251 | /* Precedence of bitwise operands (bitwise OR, XOR, bitwise AND, | |
252 | logical NOT). */ | |
253 | STAP_OPERAND_PREC_BITWISE, | |
254 | ||
255 | /* Precedence of multiplicative operands (multiplication, division, | |
256 | remainder, left shift and right shift). */ | |
257 | STAP_OPERAND_PREC_MUL | |
258 | }; | |
259 | ||
af2d9bee | 260 | static void stap_parse_argument_1 (struct stap_parse_info *p, bool has_lhs, |
55aa24fb SDJ |
261 | enum stap_operand_prec prec); |
262 | ||
263 | static void stap_parse_argument_conditionally (struct stap_parse_info *p); | |
264 | ||
af2d9bee | 265 | /* Returns true if *S is an operator, false otherwise. */ |
55aa24fb | 266 | |
af2d9bee | 267 | static bool stap_is_operator (const char *op); |
55aa24fb SDJ |
268 | |
269 | static void | |
270 | show_stapexpressiondebug (struct ui_file *file, int from_tty, | |
271 | struct cmd_list_element *c, const char *value) | |
272 | { | |
273 | fprintf_filtered (file, _("SystemTap Probe expression debugging is %s.\n"), | |
274 | value); | |
275 | } | |
276 | ||
277 | /* Returns the operator precedence level of OP, or STAP_OPERAND_PREC_NONE | |
278 | if the operator code was not recognized. */ | |
279 | ||
280 | static enum stap_operand_prec | |
281 | stap_get_operator_prec (enum exp_opcode op) | |
282 | { | |
283 | switch (op) | |
284 | { | |
285 | case BINOP_LOGICAL_OR: | |
286 | return STAP_OPERAND_PREC_LOGICAL_OR; | |
287 | ||
288 | case BINOP_LOGICAL_AND: | |
289 | return STAP_OPERAND_PREC_LOGICAL_AND; | |
290 | ||
291 | case BINOP_ADD: | |
292 | case BINOP_SUB: | |
293 | case BINOP_EQUAL: | |
294 | case BINOP_NOTEQUAL: | |
295 | case BINOP_LESS: | |
296 | case BINOP_LEQ: | |
297 | case BINOP_GTR: | |
298 | case BINOP_GEQ: | |
299 | return STAP_OPERAND_PREC_ADD_CMP; | |
300 | ||
301 | case BINOP_BITWISE_IOR: | |
302 | case BINOP_BITWISE_AND: | |
303 | case BINOP_BITWISE_XOR: | |
304 | case UNOP_LOGICAL_NOT: | |
305 | return STAP_OPERAND_PREC_BITWISE; | |
306 | ||
307 | case BINOP_MUL: | |
308 | case BINOP_DIV: | |
309 | case BINOP_REM: | |
310 | case BINOP_LSH: | |
311 | case BINOP_RSH: | |
312 | return STAP_OPERAND_PREC_MUL; | |
313 | ||
314 | default: | |
315 | return STAP_OPERAND_PREC_NONE; | |
316 | } | |
317 | } | |
318 | ||
3ca58cde SDJ |
319 | /* Given S, read the operator in it. Return the EXP_OPCODE which |
320 | represents the operator detected, or throw an error if no operator | |
321 | was found. */ | |
55aa24fb | 322 | |
fcf57f19 SDJ |
323 | static enum exp_opcode |
324 | stap_get_opcode (const char **s) | |
55aa24fb SDJ |
325 | { |
326 | const char c = **s; | |
fcf57f19 | 327 | enum exp_opcode op; |
55aa24fb SDJ |
328 | |
329 | *s += 1; | |
330 | ||
331 | switch (c) | |
332 | { | |
333 | case '*': | |
fcf57f19 | 334 | op = BINOP_MUL; |
55aa24fb SDJ |
335 | break; |
336 | ||
337 | case '/': | |
fcf57f19 | 338 | op = BINOP_DIV; |
55aa24fb SDJ |
339 | break; |
340 | ||
341 | case '%': | |
fcf57f19 | 342 | op = BINOP_REM; |
55aa24fb SDJ |
343 | break; |
344 | ||
345 | case '<': | |
fcf57f19 | 346 | op = BINOP_LESS; |
55aa24fb SDJ |
347 | if (**s == '<') |
348 | { | |
349 | *s += 1; | |
fcf57f19 | 350 | op = BINOP_LSH; |
55aa24fb SDJ |
351 | } |
352 | else if (**s == '=') | |
353 | { | |
354 | *s += 1; | |
fcf57f19 | 355 | op = BINOP_LEQ; |
55aa24fb SDJ |
356 | } |
357 | else if (**s == '>') | |
358 | { | |
359 | *s += 1; | |
fcf57f19 | 360 | op = BINOP_NOTEQUAL; |
55aa24fb SDJ |
361 | } |
362 | break; | |
363 | ||
364 | case '>': | |
fcf57f19 | 365 | op = BINOP_GTR; |
55aa24fb SDJ |
366 | if (**s == '>') |
367 | { | |
368 | *s += 1; | |
fcf57f19 | 369 | op = BINOP_RSH; |
55aa24fb SDJ |
370 | } |
371 | else if (**s == '=') | |
372 | { | |
373 | *s += 1; | |
fcf57f19 | 374 | op = BINOP_GEQ; |
55aa24fb SDJ |
375 | } |
376 | break; | |
377 | ||
378 | case '|': | |
fcf57f19 | 379 | op = BINOP_BITWISE_IOR; |
55aa24fb SDJ |
380 | if (**s == '|') |
381 | { | |
382 | *s += 1; | |
fcf57f19 | 383 | op = BINOP_LOGICAL_OR; |
55aa24fb SDJ |
384 | } |
385 | break; | |
386 | ||
387 | case '&': | |
fcf57f19 | 388 | op = BINOP_BITWISE_AND; |
55aa24fb SDJ |
389 | if (**s == '&') |
390 | { | |
391 | *s += 1; | |
fcf57f19 | 392 | op = BINOP_LOGICAL_AND; |
55aa24fb SDJ |
393 | } |
394 | break; | |
395 | ||
396 | case '^': | |
fcf57f19 | 397 | op = BINOP_BITWISE_XOR; |
55aa24fb SDJ |
398 | break; |
399 | ||
400 | case '!': | |
fcf57f19 | 401 | op = UNOP_LOGICAL_NOT; |
55aa24fb SDJ |
402 | break; |
403 | ||
404 | case '+': | |
fcf57f19 | 405 | op = BINOP_ADD; |
55aa24fb SDJ |
406 | break; |
407 | ||
408 | case '-': | |
fcf57f19 | 409 | op = BINOP_SUB; |
55aa24fb SDJ |
410 | break; |
411 | ||
412 | case '=': | |
fcf57f19 SDJ |
413 | gdb_assert (**s == '='); |
414 | op = BINOP_EQUAL; | |
55aa24fb SDJ |
415 | break; |
416 | ||
417 | default: | |
f469e8ce SDJ |
418 | error (_("Invalid opcode in expression `%s' for SystemTap" |
419 | "probe"), *s); | |
55aa24fb SDJ |
420 | } |
421 | ||
fcf57f19 | 422 | return op; |
55aa24fb SDJ |
423 | } |
424 | ||
425 | /* Given the bitness of the argument, represented by B, return the | |
3ca58cde SDJ |
426 | corresponding `struct type *', or throw an error if B is |
427 | unknown. */ | |
55aa24fb SDJ |
428 | |
429 | static struct type * | |
430 | stap_get_expected_argument_type (struct gdbarch *gdbarch, | |
f469e8ce | 431 | enum stap_arg_bitness b, |
0e9ae10f | 432 | const char *probe_name) |
55aa24fb SDJ |
433 | { |
434 | switch (b) | |
435 | { | |
436 | case STAP_ARG_BITNESS_UNDEFINED: | |
437 | if (gdbarch_addr_bit (gdbarch) == 32) | |
438 | return builtin_type (gdbarch)->builtin_uint32; | |
439 | else | |
440 | return builtin_type (gdbarch)->builtin_uint64; | |
441 | ||
30a1e6cc SDJ |
442 | case STAP_ARG_BITNESS_8BIT_UNSIGNED: |
443 | return builtin_type (gdbarch)->builtin_uint8; | |
444 | ||
445 | case STAP_ARG_BITNESS_8BIT_SIGNED: | |
446 | return builtin_type (gdbarch)->builtin_int8; | |
447 | ||
448 | case STAP_ARG_BITNESS_16BIT_UNSIGNED: | |
449 | return builtin_type (gdbarch)->builtin_uint16; | |
450 | ||
451 | case STAP_ARG_BITNESS_16BIT_SIGNED: | |
452 | return builtin_type (gdbarch)->builtin_int16; | |
453 | ||
55aa24fb SDJ |
454 | case STAP_ARG_BITNESS_32BIT_SIGNED: |
455 | return builtin_type (gdbarch)->builtin_int32; | |
456 | ||
457 | case STAP_ARG_BITNESS_32BIT_UNSIGNED: | |
458 | return builtin_type (gdbarch)->builtin_uint32; | |
459 | ||
460 | case STAP_ARG_BITNESS_64BIT_SIGNED: | |
461 | return builtin_type (gdbarch)->builtin_int64; | |
462 | ||
463 | case STAP_ARG_BITNESS_64BIT_UNSIGNED: | |
464 | return builtin_type (gdbarch)->builtin_uint64; | |
465 | ||
466 | default: | |
0e9ae10f | 467 | error (_("Undefined bitness for probe '%s'."), probe_name); |
55aa24fb SDJ |
468 | break; |
469 | } | |
470 | } | |
471 | ||
05c0465e SDJ |
472 | /* Helper function to check for a generic list of prefixes. GDBARCH |
473 | is the current gdbarch being used. S is the expression being | |
474 | analyzed. If R is not NULL, it will be used to return the found | |
475 | prefix. PREFIXES is the list of expected prefixes. | |
476 | ||
477 | This function does a case-insensitive match. | |
478 | ||
af2d9bee | 479 | Return true if any prefix has been found, false otherwise. */ |
05c0465e | 480 | |
af2d9bee | 481 | static bool |
05c0465e SDJ |
482 | stap_is_generic_prefix (struct gdbarch *gdbarch, const char *s, |
483 | const char **r, const char *const *prefixes) | |
484 | { | |
485 | const char *const *p; | |
486 | ||
487 | if (prefixes == NULL) | |
488 | { | |
489 | if (r != NULL) | |
490 | *r = ""; | |
491 | ||
af2d9bee | 492 | return true; |
05c0465e SDJ |
493 | } |
494 | ||
495 | for (p = prefixes; *p != NULL; ++p) | |
97c2dca0 SDJ |
496 | if (strncasecmp (s, *p, strlen (*p)) == 0) |
497 | { | |
498 | if (r != NULL) | |
499 | *r = *p; | |
05c0465e | 500 | |
af2d9bee | 501 | return true; |
97c2dca0 | 502 | } |
05c0465e | 503 | |
af2d9bee | 504 | return false; |
05c0465e SDJ |
505 | } |
506 | ||
af2d9bee SDJ |
507 | /* Return true if S points to a register prefix, false otherwise. For |
508 | a description of the arguments, look at stap_is_generic_prefix. */ | |
05c0465e | 509 | |
af2d9bee | 510 | static bool |
05c0465e SDJ |
511 | stap_is_register_prefix (struct gdbarch *gdbarch, const char *s, |
512 | const char **r) | |
513 | { | |
514 | const char *const *t = gdbarch_stap_register_prefixes (gdbarch); | |
515 | ||
516 | return stap_is_generic_prefix (gdbarch, s, r, t); | |
517 | } | |
518 | ||
af2d9bee | 519 | /* Return true if S points to a register indirection prefix, false |
05c0465e SDJ |
520 | otherwise. For a description of the arguments, look at |
521 | stap_is_generic_prefix. */ | |
522 | ||
af2d9bee | 523 | static bool |
05c0465e SDJ |
524 | stap_is_register_indirection_prefix (struct gdbarch *gdbarch, const char *s, |
525 | const char **r) | |
526 | { | |
527 | const char *const *t = gdbarch_stap_register_indirection_prefixes (gdbarch); | |
528 | ||
529 | return stap_is_generic_prefix (gdbarch, s, r, t); | |
530 | } | |
531 | ||
af2d9bee SDJ |
532 | /* Return true if S points to an integer prefix, false otherwise. For |
533 | a description of the arguments, look at stap_is_generic_prefix. | |
05c0465e SDJ |
534 | |
535 | This function takes care of analyzing whether we are dealing with | |
536 | an expected integer prefix, or, if there is no integer prefix to be | |
537 | expected, whether we are dealing with a digit. It does a | |
538 | case-insensitive match. */ | |
539 | ||
af2d9bee | 540 | static bool |
05c0465e SDJ |
541 | stap_is_integer_prefix (struct gdbarch *gdbarch, const char *s, |
542 | const char **r) | |
543 | { | |
544 | const char *const *t = gdbarch_stap_integer_prefixes (gdbarch); | |
545 | const char *const *p; | |
546 | ||
547 | if (t == NULL) | |
548 | { | |
549 | /* A NULL value here means that integers do not have a prefix. | |
550 | We just check for a digit then. */ | |
551 | if (r != NULL) | |
552 | *r = ""; | |
553 | ||
af2d9bee | 554 | return isdigit (*s) > 0; |
05c0465e SDJ |
555 | } |
556 | ||
557 | for (p = t; *p != NULL; ++p) | |
558 | { | |
559 | size_t len = strlen (*p); | |
560 | ||
561 | if ((len == 0 && isdigit (*s)) | |
562 | || (len > 0 && strncasecmp (s, *p, len) == 0)) | |
563 | { | |
564 | /* Integers may or may not have a prefix. The "len == 0" | |
565 | check covers the case when integers do not have a prefix | |
566 | (therefore, we just check if we have a digit). The call | |
567 | to "strncasecmp" covers the case when they have a | |
568 | prefix. */ | |
569 | if (r != NULL) | |
570 | *r = *p; | |
571 | ||
af2d9bee | 572 | return true; |
05c0465e SDJ |
573 | } |
574 | } | |
575 | ||
af2d9bee | 576 | return false; |
05c0465e SDJ |
577 | } |
578 | ||
579 | /* Helper function to check for a generic list of suffixes. If we are | |
580 | not expecting any suffixes, then it just returns 1. If we are | |
af2d9bee SDJ |
581 | expecting at least one suffix, then it returns true if a suffix has |
582 | been found, false otherwise. GDBARCH is the current gdbarch being | |
05c0465e SDJ |
583 | used. S is the expression being analyzed. If R is not NULL, it |
584 | will be used to return the found suffix. SUFFIXES is the list of | |
585 | expected suffixes. This function does a case-insensitive | |
586 | match. */ | |
587 | ||
af2d9bee | 588 | static bool |
05c0465e SDJ |
589 | stap_generic_check_suffix (struct gdbarch *gdbarch, const char *s, |
590 | const char **r, const char *const *suffixes) | |
591 | { | |
592 | const char *const *p; | |
af2d9bee | 593 | bool found = false; |
05c0465e SDJ |
594 | |
595 | if (suffixes == NULL) | |
596 | { | |
597 | if (r != NULL) | |
598 | *r = ""; | |
599 | ||
af2d9bee | 600 | return true; |
05c0465e SDJ |
601 | } |
602 | ||
603 | for (p = suffixes; *p != NULL; ++p) | |
604 | if (strncasecmp (s, *p, strlen (*p)) == 0) | |
605 | { | |
606 | if (r != NULL) | |
607 | *r = *p; | |
608 | ||
af2d9bee | 609 | found = true; |
05c0465e SDJ |
610 | break; |
611 | } | |
612 | ||
613 | return found; | |
614 | } | |
615 | ||
af2d9bee SDJ |
616 | /* Return true if S points to an integer suffix, false otherwise. For |
617 | a description of the arguments, look at | |
05c0465e SDJ |
618 | stap_generic_check_suffix. */ |
619 | ||
af2d9bee | 620 | static bool |
05c0465e SDJ |
621 | stap_check_integer_suffix (struct gdbarch *gdbarch, const char *s, |
622 | const char **r) | |
623 | { | |
624 | const char *const *p = gdbarch_stap_integer_suffixes (gdbarch); | |
625 | ||
626 | return stap_generic_check_suffix (gdbarch, s, r, p); | |
627 | } | |
628 | ||
af2d9bee SDJ |
629 | /* Return true if S points to a register suffix, false otherwise. For |
630 | a description of the arguments, look at | |
05c0465e SDJ |
631 | stap_generic_check_suffix. */ |
632 | ||
af2d9bee | 633 | static bool |
05c0465e SDJ |
634 | stap_check_register_suffix (struct gdbarch *gdbarch, const char *s, |
635 | const char **r) | |
636 | { | |
637 | const char *const *p = gdbarch_stap_register_suffixes (gdbarch); | |
638 | ||
639 | return stap_generic_check_suffix (gdbarch, s, r, p); | |
640 | } | |
641 | ||
af2d9bee | 642 | /* Return true if S points to a register indirection suffix, false |
05c0465e SDJ |
643 | otherwise. For a description of the arguments, look at |
644 | stap_generic_check_suffix. */ | |
645 | ||
af2d9bee | 646 | static bool |
05c0465e SDJ |
647 | stap_check_register_indirection_suffix (struct gdbarch *gdbarch, const char *s, |
648 | const char **r) | |
649 | { | |
650 | const char *const *p = gdbarch_stap_register_indirection_suffixes (gdbarch); | |
651 | ||
652 | return stap_generic_check_suffix (gdbarch, s, r, p); | |
653 | } | |
654 | ||
55aa24fb SDJ |
655 | /* Function responsible for parsing a register operand according to |
656 | SystemTap parlance. Assuming: | |
657 | ||
658 | RP = register prefix | |
659 | RS = register suffix | |
660 | RIP = register indirection prefix | |
661 | RIS = register indirection suffix | |
662 | ||
663 | Then a register operand can be: | |
664 | ||
665 | [RIP] [RP] REGISTER [RS] [RIS] | |
666 | ||
667 | This function takes care of a register's indirection, displacement and | |
668 | direct access. It also takes into consideration the fact that some | |
669 | registers are named differently inside and outside GDB, e.g., PPC's | |
670 | general-purpose registers are represented by integers in the assembly | |
671 | language (e.g., `15' is the 15th general-purpose register), but inside | |
672 | GDB they have a prefix (the letter `r') appended. */ | |
673 | ||
674 | static void | |
675 | stap_parse_register_operand (struct stap_parse_info *p) | |
676 | { | |
677 | /* Simple flag to indicate whether we have seen a minus signal before | |
678 | certain number. */ | |
af2d9bee | 679 | bool got_minus = false; |
55aa24fb SDJ |
680 | /* Flags to indicate whether this register access is being displaced and/or |
681 | indirected. */ | |
af2d9bee SDJ |
682 | bool disp_p = false; |
683 | bool indirect_p = false; | |
55aa24fb | 684 | struct gdbarch *gdbarch = p->gdbarch; |
55aa24fb SDJ |
685 | /* Needed to generate the register name as a part of an expression. */ |
686 | struct stoken str; | |
55aa24fb SDJ |
687 | /* Variables used to extract the register name from the probe's |
688 | argument. */ | |
689 | const char *start; | |
55aa24fb | 690 | const char *gdb_reg_prefix = gdbarch_stap_gdb_register_prefix (gdbarch); |
55aa24fb | 691 | const char *gdb_reg_suffix = gdbarch_stap_gdb_register_suffix (gdbarch); |
05c0465e SDJ |
692 | const char *reg_prefix; |
693 | const char *reg_ind_prefix; | |
694 | const char *reg_suffix; | |
695 | const char *reg_ind_suffix; | |
55aa24fb SDJ |
696 | |
697 | /* Checking for a displacement argument. */ | |
698 | if (*p->arg == '+') | |
699 | { | |
700 | /* If it's a plus sign, we don't need to do anything, just advance the | |
701 | pointer. */ | |
702 | ++p->arg; | |
703 | } | |
f1bb75ab | 704 | else if (*p->arg == '-') |
55aa24fb | 705 | { |
af2d9bee | 706 | got_minus = true; |
55aa24fb SDJ |
707 | ++p->arg; |
708 | } | |
709 | ||
710 | if (isdigit (*p->arg)) | |
711 | { | |
712 | /* The value of the displacement. */ | |
713 | long displacement; | |
a0bcdaa7 | 714 | char *endp; |
55aa24fb | 715 | |
af2d9bee | 716 | disp_p = true; |
a0bcdaa7 PA |
717 | displacement = strtol (p->arg, &endp, 10); |
718 | p->arg = endp; | |
55aa24fb SDJ |
719 | |
720 | /* Generating the expression for the displacement. */ | |
410a0ff2 SDJ |
721 | write_exp_elt_opcode (&p->pstate, OP_LONG); |
722 | write_exp_elt_type (&p->pstate, builtin_type (gdbarch)->builtin_long); | |
723 | write_exp_elt_longcst (&p->pstate, displacement); | |
724 | write_exp_elt_opcode (&p->pstate, OP_LONG); | |
55aa24fb | 725 | if (got_minus) |
410a0ff2 | 726 | write_exp_elt_opcode (&p->pstate, UNOP_NEG); |
55aa24fb SDJ |
727 | } |
728 | ||
729 | /* Getting rid of register indirection prefix. */ | |
05c0465e | 730 | if (stap_is_register_indirection_prefix (gdbarch, p->arg, ®_ind_prefix)) |
55aa24fb | 731 | { |
af2d9bee | 732 | indirect_p = true; |
05c0465e | 733 | p->arg += strlen (reg_ind_prefix); |
55aa24fb SDJ |
734 | } |
735 | ||
736 | if (disp_p && !indirect_p) | |
737 | error (_("Invalid register displacement syntax on expression `%s'."), | |
738 | p->saved_arg); | |
739 | ||
740 | /* Getting rid of register prefix. */ | |
05c0465e SDJ |
741 | if (stap_is_register_prefix (gdbarch, p->arg, ®_prefix)) |
742 | p->arg += strlen (reg_prefix); | |
55aa24fb SDJ |
743 | |
744 | /* Now we should have only the register name. Let's extract it and get | |
745 | the associated number. */ | |
746 | start = p->arg; | |
747 | ||
748 | /* We assume the register name is composed by letters and numbers. */ | |
749 | while (isalnum (*p->arg)) | |
750 | ++p->arg; | |
751 | ||
677052f2 | 752 | std::string regname (start, p->arg - start); |
55aa24fb SDJ |
753 | |
754 | /* We only add the GDB's register prefix/suffix if we are dealing with | |
755 | a numeric register. */ | |
677052f2 | 756 | if (isdigit (*start)) |
55aa24fb | 757 | { |
677052f2 SDJ |
758 | if (gdb_reg_prefix != NULL) |
759 | regname = gdb_reg_prefix + regname; | |
55aa24fb | 760 | |
677052f2 SDJ |
761 | if (gdb_reg_suffix != NULL) |
762 | regname += gdb_reg_suffix; | |
55aa24fb | 763 | } |
55aa24fb | 764 | |
7d7571f0 SDJ |
765 | int regnum = user_reg_map_name_to_regnum (gdbarch, regname.c_str (), |
766 | regname.size ()); | |
767 | ||
55aa24fb | 768 | /* Is this a valid register name? */ |
7d7571f0 | 769 | if (regnum == -1) |
55aa24fb | 770 | error (_("Invalid register name `%s' on expression `%s'."), |
677052f2 | 771 | regname.c_str (), p->saved_arg); |
55aa24fb | 772 | |
7d7571f0 SDJ |
773 | /* Check if there's any special treatment that the arch-specific |
774 | code would like to perform on the register name. */ | |
775 | if (gdbarch_stap_adjust_register_p (gdbarch)) | |
776 | { | |
777 | std::string oldregname = regname; | |
778 | ||
779 | gdbarch_stap_adjust_register (gdbarch, p, regname, regnum); | |
780 | ||
781 | if (regname != oldregname) | |
782 | { | |
783 | /* This is just a check we perform to make sure that the | |
784 | arch-dependent code has provided us with a valid | |
785 | register name. */ | |
786 | regnum = user_reg_map_name_to_regnum (gdbarch, regname.c_str (), | |
787 | regname.size ()); | |
788 | ||
789 | if (regnum == -1) | |
790 | internal_error (__FILE__, __LINE__, | |
791 | _("Invalid register name '%s' after replacing it" | |
792 | " (previous name was '%s')"), | |
793 | regname.c_str (), oldregname.c_str ()); | |
794 | } | |
795 | } | |
796 | ||
410a0ff2 | 797 | write_exp_elt_opcode (&p->pstate, OP_REGISTER); |
677052f2 SDJ |
798 | str.ptr = regname.c_str (); |
799 | str.length = regname.size (); | |
410a0ff2 SDJ |
800 | write_exp_string (&p->pstate, str); |
801 | write_exp_elt_opcode (&p->pstate, OP_REGISTER); | |
55aa24fb SDJ |
802 | |
803 | if (indirect_p) | |
804 | { | |
805 | if (disp_p) | |
410a0ff2 | 806 | write_exp_elt_opcode (&p->pstate, BINOP_ADD); |
55aa24fb SDJ |
807 | |
808 | /* Casting to the expected type. */ | |
410a0ff2 SDJ |
809 | write_exp_elt_opcode (&p->pstate, UNOP_CAST); |
810 | write_exp_elt_type (&p->pstate, lookup_pointer_type (p->arg_type)); | |
811 | write_exp_elt_opcode (&p->pstate, UNOP_CAST); | |
55aa24fb | 812 | |
410a0ff2 | 813 | write_exp_elt_opcode (&p->pstate, UNOP_IND); |
55aa24fb SDJ |
814 | } |
815 | ||
816 | /* Getting rid of the register name suffix. */ | |
05c0465e SDJ |
817 | if (stap_check_register_suffix (gdbarch, p->arg, ®_suffix)) |
818 | p->arg += strlen (reg_suffix); | |
819 | else | |
820 | error (_("Missing register name suffix on expression `%s'."), | |
821 | p->saved_arg); | |
55aa24fb SDJ |
822 | |
823 | /* Getting rid of the register indirection suffix. */ | |
05c0465e | 824 | if (indirect_p) |
55aa24fb | 825 | { |
05c0465e SDJ |
826 | if (stap_check_register_indirection_suffix (gdbarch, p->arg, |
827 | ®_ind_suffix)) | |
828 | p->arg += strlen (reg_ind_suffix); | |
829 | else | |
830 | error (_("Missing indirection suffix on expression `%s'."), | |
831 | p->saved_arg); | |
55aa24fb SDJ |
832 | } |
833 | } | |
834 | ||
835 | /* This function is responsible for parsing a single operand. | |
836 | ||
837 | A single operand can be: | |
838 | ||
839 | - an unary operation (e.g., `-5', `~2', or even with subexpressions | |
840 | like `-(2 + 1)') | |
841 | - a register displacement, which will be treated as a register | |
842 | operand (e.g., `-4(%eax)' on x86) | |
843 | - a numeric constant, or | |
844 | - a register operand (see function `stap_parse_register_operand') | |
845 | ||
846 | The function also calls special-handling functions to deal with | |
847 | unrecognized operands, allowing arch-specific parsers to be | |
848 | created. */ | |
849 | ||
850 | static void | |
851 | stap_parse_single_operand (struct stap_parse_info *p) | |
852 | { | |
853 | struct gdbarch *gdbarch = p->gdbarch; | |
05c0465e | 854 | const char *int_prefix = NULL; |
55aa24fb SDJ |
855 | |
856 | /* We first try to parse this token as a "special token". */ | |
f1bb75ab SDJ |
857 | if (gdbarch_stap_parse_special_token_p (gdbarch) |
858 | && (gdbarch_stap_parse_special_token (gdbarch, p) != 0)) | |
859 | { | |
860 | /* If the return value of the above function is not zero, | |
861 | it means it successfully parsed the special token. | |
55aa24fb | 862 | |
f1bb75ab SDJ |
863 | If it is NULL, we try to parse it using our method. */ |
864 | return; | |
865 | } | |
55aa24fb SDJ |
866 | |
867 | if (*p->arg == '-' || *p->arg == '~' || *p->arg == '+') | |
868 | { | |
869 | char c = *p->arg; | |
55aa24fb SDJ |
870 | /* We use this variable to do a lookahead. */ |
871 | const char *tmp = p->arg; | |
af2d9bee | 872 | bool has_digit = false; |
55aa24fb | 873 | |
97c2dca0 | 874 | /* Skipping signal. */ |
55aa24fb SDJ |
875 | ++tmp; |
876 | ||
877 | /* This is an unary operation. Here is a list of allowed tokens | |
878 | here: | |
879 | ||
880 | - numeric literal; | |
881 | - number (from register displacement) | |
882 | - subexpression (beginning with `(') | |
883 | ||
884 | We handle the register displacement here, and the other cases | |
885 | recursively. */ | |
886 | if (p->inside_paren_p) | |
f1735a53 | 887 | tmp = skip_spaces (tmp); |
55aa24fb | 888 | |
474ca4f6 | 889 | while (isdigit (*tmp)) |
a0bcdaa7 | 890 | { |
474ca4f6 SDJ |
891 | /* We skip the digit here because we are only interested in |
892 | knowing what kind of unary operation this is. The digit | |
893 | will be handled by one of the functions that will be | |
894 | called below ('stap_parse_argument_conditionally' or | |
895 | 'stap_parse_register_operand'). */ | |
896 | ++tmp; | |
af2d9bee | 897 | has_digit = true; |
a0bcdaa7 | 898 | } |
55aa24fb | 899 | |
474ca4f6 SDJ |
900 | if (has_digit && stap_is_register_indirection_prefix (gdbarch, tmp, |
901 | NULL)) | |
55aa24fb SDJ |
902 | { |
903 | /* If we are here, it means it is a displacement. The only | |
904 | operations allowed here are `-' and `+'. */ | |
f1bb75ab | 905 | if (c != '-' && c != '+') |
55aa24fb SDJ |
906 | error (_("Invalid operator `%c' for register displacement " |
907 | "on expression `%s'."), c, p->saved_arg); | |
908 | ||
909 | stap_parse_register_operand (p); | |
910 | } | |
474ca4f6 SDJ |
911 | else |
912 | { | |
913 | /* This is not a displacement. We skip the operator, and | |
914 | deal with it when the recursion returns. */ | |
915 | ++p->arg; | |
916 | stap_parse_argument_conditionally (p); | |
917 | if (c == '-') | |
918 | write_exp_elt_opcode (&p->pstate, UNOP_NEG); | |
919 | else if (c == '~') | |
920 | write_exp_elt_opcode (&p->pstate, UNOP_COMPLEMENT); | |
921 | } | |
55aa24fb SDJ |
922 | } |
923 | else if (isdigit (*p->arg)) | |
924 | { | |
925 | /* A temporary variable, needed for lookahead. */ | |
926 | const char *tmp = p->arg; | |
a0bcdaa7 | 927 | char *endp; |
55aa24fb SDJ |
928 | long number; |
929 | ||
05c0465e SDJ |
930 | /* We can be dealing with a numeric constant, or with a register |
931 | displacement. */ | |
a0bcdaa7 PA |
932 | number = strtol (tmp, &endp, 10); |
933 | tmp = endp; | |
55aa24fb SDJ |
934 | |
935 | if (p->inside_paren_p) | |
f1735a53 | 936 | tmp = skip_spaces (tmp); |
05c0465e SDJ |
937 | |
938 | /* If "stap_is_integer_prefix" returns true, it means we can | |
939 | accept integers without a prefix here. But we also need to | |
940 | check whether the next token (i.e., "tmp") is not a register | |
941 | indirection prefix. */ | |
942 | if (stap_is_integer_prefix (gdbarch, p->arg, NULL) | |
943 | && !stap_is_register_indirection_prefix (gdbarch, tmp, NULL)) | |
55aa24fb | 944 | { |
05c0465e SDJ |
945 | const char *int_suffix; |
946 | ||
55aa24fb | 947 | /* We are dealing with a numeric constant. */ |
410a0ff2 SDJ |
948 | write_exp_elt_opcode (&p->pstate, OP_LONG); |
949 | write_exp_elt_type (&p->pstate, | |
950 | builtin_type (gdbarch)->builtin_long); | |
951 | write_exp_elt_longcst (&p->pstate, number); | |
952 | write_exp_elt_opcode (&p->pstate, OP_LONG); | |
55aa24fb SDJ |
953 | |
954 | p->arg = tmp; | |
955 | ||
05c0465e SDJ |
956 | if (stap_check_integer_suffix (gdbarch, p->arg, &int_suffix)) |
957 | p->arg += strlen (int_suffix); | |
958 | else | |
959 | error (_("Invalid constant suffix on expression `%s'."), | |
960 | p->saved_arg); | |
55aa24fb | 961 | } |
05c0465e | 962 | else if (stap_is_register_indirection_prefix (gdbarch, tmp, NULL)) |
55aa24fb SDJ |
963 | stap_parse_register_operand (p); |
964 | else | |
965 | error (_("Unknown numeric token on expression `%s'."), | |
966 | p->saved_arg); | |
967 | } | |
05c0465e | 968 | else if (stap_is_integer_prefix (gdbarch, p->arg, &int_prefix)) |
55aa24fb SDJ |
969 | { |
970 | /* We are dealing with a numeric constant. */ | |
971 | long number; | |
a0bcdaa7 | 972 | char *endp; |
05c0465e | 973 | const char *int_suffix; |
55aa24fb | 974 | |
05c0465e | 975 | p->arg += strlen (int_prefix); |
a0bcdaa7 PA |
976 | number = strtol (p->arg, &endp, 10); |
977 | p->arg = endp; | |
55aa24fb | 978 | |
410a0ff2 SDJ |
979 | write_exp_elt_opcode (&p->pstate, OP_LONG); |
980 | write_exp_elt_type (&p->pstate, builtin_type (gdbarch)->builtin_long); | |
981 | write_exp_elt_longcst (&p->pstate, number); | |
982 | write_exp_elt_opcode (&p->pstate, OP_LONG); | |
55aa24fb | 983 | |
05c0465e SDJ |
984 | if (stap_check_integer_suffix (gdbarch, p->arg, &int_suffix)) |
985 | p->arg += strlen (int_suffix); | |
986 | else | |
987 | error (_("Invalid constant suffix on expression `%s'."), | |
988 | p->saved_arg); | |
55aa24fb | 989 | } |
05c0465e SDJ |
990 | else if (stap_is_register_prefix (gdbarch, p->arg, NULL) |
991 | || stap_is_register_indirection_prefix (gdbarch, p->arg, NULL)) | |
55aa24fb SDJ |
992 | stap_parse_register_operand (p); |
993 | else | |
994 | error (_("Operator `%c' not recognized on expression `%s'."), | |
995 | *p->arg, p->saved_arg); | |
996 | } | |
997 | ||
998 | /* This function parses an argument conditionally, based on single or | |
999 | non-single operands. A non-single operand would be a parenthesized | |
1000 | expression (e.g., `(2 + 1)'), and a single operand is anything that | |
1001 | starts with `-', `~', `+' (i.e., unary operators), a digit, or | |
1002 | something recognized by `gdbarch_stap_is_single_operand'. */ | |
1003 | ||
1004 | static void | |
1005 | stap_parse_argument_conditionally (struct stap_parse_info *p) | |
1006 | { | |
97c2dca0 SDJ |
1007 | gdb_assert (gdbarch_stap_is_single_operand_p (p->gdbarch)); |
1008 | ||
55aa24fb SDJ |
1009 | if (*p->arg == '-' || *p->arg == '~' || *p->arg == '+' /* Unary. */ |
1010 | || isdigit (*p->arg) | |
1011 | || gdbarch_stap_is_single_operand (p->gdbarch, p->arg)) | |
1012 | stap_parse_single_operand (p); | |
1013 | else if (*p->arg == '(') | |
1014 | { | |
1015 | /* We are dealing with a parenthesized operand. It means we | |
1016 | have to parse it as it was a separate expression, without | |
1017 | left-side or precedence. */ | |
1018 | ++p->arg; | |
f1735a53 | 1019 | p->arg = skip_spaces (p->arg); |
55aa24fb SDJ |
1020 | ++p->inside_paren_p; |
1021 | ||
1022 | stap_parse_argument_1 (p, 0, STAP_OPERAND_PREC_NONE); | |
1023 | ||
1024 | --p->inside_paren_p; | |
1025 | if (*p->arg != ')') | |
1026 | error (_("Missign close-paren on expression `%s'."), | |
1027 | p->saved_arg); | |
1028 | ||
1029 | ++p->arg; | |
1030 | if (p->inside_paren_p) | |
f1735a53 | 1031 | p->arg = skip_spaces (p->arg); |
55aa24fb SDJ |
1032 | } |
1033 | else | |
1034 | error (_("Cannot parse expression `%s'."), p->saved_arg); | |
1035 | } | |
1036 | ||
1037 | /* Helper function for `stap_parse_argument'. Please, see its comments to | |
1038 | better understand what this function does. */ | |
1039 | ||
1040 | static void | |
af2d9bee | 1041 | stap_parse_argument_1 (struct stap_parse_info *p, bool has_lhs, |
55aa24fb SDJ |
1042 | enum stap_operand_prec prec) |
1043 | { | |
1044 | /* This is an operator-precedence parser. | |
1045 | ||
1046 | We work with left- and right-sides of expressions, and | |
1047 | parse them depending on the precedence of the operators | |
1048 | we find. */ | |
1049 | ||
97c2dca0 SDJ |
1050 | gdb_assert (p->arg != NULL); |
1051 | ||
55aa24fb | 1052 | if (p->inside_paren_p) |
f1735a53 | 1053 | p->arg = skip_spaces (p->arg); |
55aa24fb SDJ |
1054 | |
1055 | if (!has_lhs) | |
1056 | { | |
1057 | /* We were called without a left-side, either because this is the | |
1058 | first call, or because we were called to parse a parenthesized | |
1059 | expression. It doesn't really matter; we have to parse the | |
1060 | left-side in order to continue the process. */ | |
1061 | stap_parse_argument_conditionally (p); | |
1062 | } | |
1063 | ||
1064 | /* Start to parse the right-side, and to "join" left and right sides | |
1065 | depending on the operation specified. | |
1066 | ||
1067 | This loop shall continue until we run out of characters in the input, | |
1068 | or until we find a close-parenthesis, which means that we've reached | |
1069 | the end of a sub-expression. */ | |
97c2dca0 | 1070 | while (*p->arg != '\0' && *p->arg != ')' && !isspace (*p->arg)) |
55aa24fb SDJ |
1071 | { |
1072 | const char *tmp_exp_buf; | |
1073 | enum exp_opcode opcode; | |
1074 | enum stap_operand_prec cur_prec; | |
1075 | ||
fcf57f19 | 1076 | if (!stap_is_operator (p->arg)) |
55aa24fb SDJ |
1077 | error (_("Invalid operator `%c' on expression `%s'."), *p->arg, |
1078 | p->saved_arg); | |
1079 | ||
1080 | /* We have to save the current value of the expression buffer because | |
1081 | the `stap_get_opcode' modifies it in order to get the current | |
1082 | operator. If this operator's precedence is lower than PREC, we | |
1083 | should return and not advance the expression buffer pointer. */ | |
1084 | tmp_exp_buf = p->arg; | |
fcf57f19 | 1085 | opcode = stap_get_opcode (&tmp_exp_buf); |
55aa24fb SDJ |
1086 | |
1087 | cur_prec = stap_get_operator_prec (opcode); | |
1088 | if (cur_prec < prec) | |
1089 | { | |
1090 | /* If the precedence of the operator that we are seeing now is | |
1091 | lower than the precedence of the first operator seen before | |
1092 | this parsing process began, it means we should stop parsing | |
1093 | and return. */ | |
1094 | break; | |
1095 | } | |
1096 | ||
1097 | p->arg = tmp_exp_buf; | |
1098 | if (p->inside_paren_p) | |
f1735a53 | 1099 | p->arg = skip_spaces (p->arg); |
55aa24fb SDJ |
1100 | |
1101 | /* Parse the right-side of the expression. */ | |
1102 | stap_parse_argument_conditionally (p); | |
1103 | ||
1104 | /* While we still have operators, try to parse another | |
1105 | right-side, but using the current right-side as a left-side. */ | |
97c2dca0 | 1106 | while (*p->arg != '\0' && stap_is_operator (p->arg)) |
55aa24fb SDJ |
1107 | { |
1108 | enum exp_opcode lookahead_opcode; | |
1109 | enum stap_operand_prec lookahead_prec; | |
1110 | ||
1111 | /* Saving the current expression buffer position. The explanation | |
1112 | is the same as above. */ | |
1113 | tmp_exp_buf = p->arg; | |
fcf57f19 | 1114 | lookahead_opcode = stap_get_opcode (&tmp_exp_buf); |
55aa24fb SDJ |
1115 | lookahead_prec = stap_get_operator_prec (lookahead_opcode); |
1116 | ||
1117 | if (lookahead_prec <= prec) | |
1118 | { | |
1119 | /* If we are dealing with an operator whose precedence is lower | |
1120 | than the first one, just abandon the attempt. */ | |
1121 | break; | |
1122 | } | |
1123 | ||
1124 | /* Parse the right-side of the expression, but since we already | |
1125 | have a left-side at this point, set `has_lhs' to 1. */ | |
1126 | stap_parse_argument_1 (p, 1, lookahead_prec); | |
1127 | } | |
1128 | ||
410a0ff2 | 1129 | write_exp_elt_opcode (&p->pstate, opcode); |
55aa24fb SDJ |
1130 | } |
1131 | } | |
1132 | ||
1133 | /* Parse a probe's argument. | |
1134 | ||
1135 | Assuming that: | |
1136 | ||
1137 | LP = literal integer prefix | |
1138 | LS = literal integer suffix | |
1139 | ||
1140 | RP = register prefix | |
1141 | RS = register suffix | |
1142 | ||
1143 | RIP = register indirection prefix | |
1144 | RIS = register indirection suffix | |
1145 | ||
1146 | This routine assumes that arguments' tokens are of the form: | |
1147 | ||
1148 | - [LP] NUMBER [LS] | |
1149 | - [RP] REGISTER [RS] | |
1150 | - [RIP] [RP] REGISTER [RS] [RIS] | |
1151 | - If we find a number without LP, we try to parse it as a literal integer | |
1152 | constant (if LP == NULL), or as a register displacement. | |
1153 | - We count parenthesis, and only skip whitespaces if we are inside them. | |
1154 | - If we find an operator, we skip it. | |
1155 | ||
1156 | This function can also call a special function that will try to match | |
0e9ae10f SDJ |
1157 | unknown tokens. It will return the expression_up generated from |
1158 | parsing the argument. */ | |
55aa24fb | 1159 | |
0e9ae10f | 1160 | static expression_up |
55aa24fb SDJ |
1161 | stap_parse_argument (const char **arg, struct type *atype, |
1162 | struct gdbarch *gdbarch) | |
1163 | { | |
55aa24fb | 1164 | /* We need to initialize the expression buffer, in order to begin |
f7088df3 SDJ |
1165 | our parsing efforts. We use language_c here because we may need |
1166 | to do pointer arithmetics. */ | |
1201a264 | 1167 | struct stap_parse_info p (*arg, atype, language_def (language_c), |
e9d9f57e | 1168 | gdbarch); |
55aa24fb SDJ |
1169 | |
1170 | stap_parse_argument_1 (&p, 0, STAP_OPERAND_PREC_NONE); | |
1171 | ||
55aa24fb SDJ |
1172 | gdb_assert (p.inside_paren_p == 0); |
1173 | ||
1174 | /* Casting the final expression to the appropriate type. */ | |
410a0ff2 SDJ |
1175 | write_exp_elt_opcode (&p.pstate, UNOP_CAST); |
1176 | write_exp_elt_type (&p.pstate, atype); | |
1177 | write_exp_elt_opcode (&p.pstate, UNOP_CAST); | |
55aa24fb | 1178 | |
f1735a53 | 1179 | p.arg = skip_spaces (p.arg); |
55aa24fb SDJ |
1180 | *arg = p.arg; |
1181 | ||
e9d9f57e | 1182 | return p.pstate.release (); |
55aa24fb SDJ |
1183 | } |
1184 | ||
0e9ae10f | 1185 | /* Implementation of 'parse_arguments' method. */ |
55aa24fb | 1186 | |
0e9ae10f SDJ |
1187 | void |
1188 | stap_probe::parse_arguments (struct gdbarch *gdbarch) | |
55aa24fb SDJ |
1189 | { |
1190 | const char *cur; | |
55aa24fb | 1191 | |
0e9ae10f SDJ |
1192 | gdb_assert (!m_have_parsed_args); |
1193 | cur = m_unparsed_args_text; | |
1194 | m_have_parsed_args = true; | |
55aa24fb | 1195 | |
97c2dca0 | 1196 | if (cur == NULL || *cur == '\0' || *cur == ':') |
55aa24fb SDJ |
1197 | return; |
1198 | ||
97c2dca0 | 1199 | while (*cur != '\0') |
55aa24fb | 1200 | { |
0e9ae10f SDJ |
1201 | enum stap_arg_bitness bitness; |
1202 | bool got_minus = false; | |
55aa24fb SDJ |
1203 | |
1204 | /* We expect to find something like: | |
1205 | ||
1206 | N@OP | |
1207 | ||
30a1e6cc | 1208 | Where `N' can be [+,-][1,2,4,8]. This is not mandatory, so |
55aa24fb SDJ |
1209 | we check it here. If we don't find it, go to the next |
1210 | state. */ | |
f33da99a SDJ |
1211 | if ((cur[0] == '-' && isdigit (cur[1]) && cur[2] == '@') |
1212 | || (isdigit (cur[0]) && cur[1] == '@')) | |
55aa24fb SDJ |
1213 | { |
1214 | if (*cur == '-') | |
1215 | { | |
1216 | /* Discard the `-'. */ | |
1217 | ++cur; | |
0e9ae10f | 1218 | got_minus = true; |
55aa24fb SDJ |
1219 | } |
1220 | ||
30a1e6cc SDJ |
1221 | /* Defining the bitness. */ |
1222 | switch (*cur) | |
55aa24fb | 1223 | { |
30a1e6cc | 1224 | case '1': |
0e9ae10f SDJ |
1225 | bitness = (got_minus ? STAP_ARG_BITNESS_8BIT_SIGNED |
1226 | : STAP_ARG_BITNESS_8BIT_UNSIGNED); | |
30a1e6cc SDJ |
1227 | break; |
1228 | ||
1229 | case '2': | |
0e9ae10f SDJ |
1230 | bitness = (got_minus ? STAP_ARG_BITNESS_16BIT_SIGNED |
1231 | : STAP_ARG_BITNESS_16BIT_UNSIGNED); | |
30a1e6cc SDJ |
1232 | break; |
1233 | ||
1234 | case '4': | |
0e9ae10f SDJ |
1235 | bitness = (got_minus ? STAP_ARG_BITNESS_32BIT_SIGNED |
1236 | : STAP_ARG_BITNESS_32BIT_UNSIGNED); | |
30a1e6cc SDJ |
1237 | break; |
1238 | ||
1239 | case '8': | |
0e9ae10f SDJ |
1240 | bitness = (got_minus ? STAP_ARG_BITNESS_64BIT_SIGNED |
1241 | : STAP_ARG_BITNESS_64BIT_UNSIGNED); | |
30a1e6cc SDJ |
1242 | break; |
1243 | ||
1244 | default: | |
1245 | { | |
1246 | /* We have an error, because we don't expect anything | |
1247 | except 1, 2, 4 and 8. */ | |
1248 | warning (_("unrecognized bitness %s%c' for probe `%s'"), | |
0e9ae10f SDJ |
1249 | got_minus ? "`-" : "`", *cur, |
1250 | this->get_name ().c_str ()); | |
30a1e6cc SDJ |
1251 | return; |
1252 | } | |
55aa24fb | 1253 | } |
55aa24fb SDJ |
1254 | /* Discard the number and the `@' sign. */ |
1255 | cur += 2; | |
1256 | } | |
f33da99a | 1257 | else |
0e9ae10f | 1258 | bitness = STAP_ARG_BITNESS_UNDEFINED; |
f33da99a | 1259 | |
0e9ae10f SDJ |
1260 | struct type *atype |
1261 | = stap_get_expected_argument_type (gdbarch, bitness, | |
1262 | this->get_name ().c_str ()); | |
55aa24fb | 1263 | |
0e9ae10f | 1264 | expression_up expr = stap_parse_argument (&cur, atype, gdbarch); |
55aa24fb SDJ |
1265 | |
1266 | if (stap_expression_debug) | |
0e9ae10f | 1267 | dump_raw_expression (expr.get (), gdb_stdlog, |
55aa24fb SDJ |
1268 | "before conversion to prefix form"); |
1269 | ||
0e9ae10f | 1270 | prefixify_expression (expr.get ()); |
55aa24fb SDJ |
1271 | |
1272 | if (stap_expression_debug) | |
0e9ae10f | 1273 | dump_prefix_expression (expr.get (), gdb_stdlog); |
55aa24fb | 1274 | |
0e9ae10f | 1275 | m_parsed_args.emplace_back (bitness, atype, std::move (expr)); |
55aa24fb SDJ |
1276 | |
1277 | /* Start it over again. */ | |
f1735a53 | 1278 | cur = skip_spaces (cur); |
55aa24fb SDJ |
1279 | } |
1280 | } | |
1281 | ||
685de8c2 SDJ |
1282 | /* Helper function to relocate an address. */ |
1283 | ||
1284 | static CORE_ADDR | |
1285 | relocate_address (CORE_ADDR address, struct objfile *objfile) | |
1286 | { | |
1287 | return address + ANOFFSET (objfile->section_offsets, | |
1288 | SECT_OFF_DATA (objfile)); | |
1289 | } | |
1290 | ||
0e9ae10f | 1291 | /* Implementation of the get_relocated_address method. */ |
729662a5 | 1292 | |
0e9ae10f SDJ |
1293 | CORE_ADDR |
1294 | stap_probe::get_relocated_address (struct objfile *objfile) | |
729662a5 | 1295 | { |
685de8c2 | 1296 | return relocate_address (this->get_address (), objfile); |
729662a5 TT |
1297 | } |
1298 | ||
55aa24fb SDJ |
1299 | /* Given PROBE, returns the number of arguments present in that probe's |
1300 | argument string. */ | |
1301 | ||
0e9ae10f SDJ |
1302 | unsigned |
1303 | stap_probe::get_argument_count (struct frame_info *frame) | |
55aa24fb | 1304 | { |
08a6411c | 1305 | struct gdbarch *gdbarch = get_frame_arch (frame); |
55aa24fb | 1306 | |
0e9ae10f | 1307 | if (!m_have_parsed_args) |
25f9533e | 1308 | { |
0e9ae10f SDJ |
1309 | if (this->can_evaluate_arguments ()) |
1310 | this->parse_arguments (gdbarch); | |
25f9533e SDJ |
1311 | else |
1312 | { | |
af2d9bee | 1313 | static bool have_warned_stap_incomplete = false; |
25f9533e SDJ |
1314 | |
1315 | if (!have_warned_stap_incomplete) | |
1316 | { | |
1317 | warning (_( | |
1318 | "The SystemTap SDT probe support is not fully implemented on this target;\n" | |
1319 | "you will not be able to inspect the arguments of the probes.\n" | |
1320 | "Please report a bug against GDB requesting a port to this target.")); | |
af2d9bee | 1321 | have_warned_stap_incomplete = true; |
25f9533e SDJ |
1322 | } |
1323 | ||
1324 | /* Marking the arguments as "already parsed". */ | |
0e9ae10f | 1325 | m_have_parsed_args = true; |
25f9533e SDJ |
1326 | } |
1327 | } | |
55aa24fb | 1328 | |
0e9ae10f SDJ |
1329 | gdb_assert (m_have_parsed_args); |
1330 | return m_parsed_args.size (); | |
55aa24fb SDJ |
1331 | } |
1332 | ||
af2d9bee SDJ |
1333 | /* Return true if OP is a valid operator inside a probe argument, or |
1334 | false otherwise. */ | |
55aa24fb | 1335 | |
af2d9bee | 1336 | static bool |
fcf57f19 | 1337 | stap_is_operator (const char *op) |
55aa24fb | 1338 | { |
af2d9bee | 1339 | bool ret = true; |
fcf57f19 SDJ |
1340 | |
1341 | switch (*op) | |
1342 | { | |
1343 | case '*': | |
1344 | case '/': | |
1345 | case '%': | |
1346 | case '^': | |
1347 | case '!': | |
1348 | case '+': | |
1349 | case '-': | |
1350 | case '<': | |
1351 | case '>': | |
1352 | case '|': | |
1353 | case '&': | |
1354 | break; | |
1355 | ||
1356 | case '=': | |
1357 | if (op[1] != '=') | |
af2d9bee | 1358 | ret = false; |
fcf57f19 SDJ |
1359 | break; |
1360 | ||
1361 | default: | |
1362 | /* We didn't find any operator. */ | |
af2d9bee | 1363 | ret = false; |
fcf57f19 SDJ |
1364 | } |
1365 | ||
1366 | return ret; | |
55aa24fb SDJ |
1367 | } |
1368 | ||
0e9ae10f | 1369 | /* Implement the `can_evaluate_arguments' method. */ |
f469e8ce | 1370 | |
0e9ae10f SDJ |
1371 | bool |
1372 | stap_probe::can_evaluate_arguments () const | |
25f9533e | 1373 | { |
0e9ae10f | 1374 | struct gdbarch *gdbarch = this->get_gdbarch (); |
25f9533e SDJ |
1375 | |
1376 | /* For SystemTap probes, we have to guarantee that the method | |
1377 | stap_is_single_operand is defined on gdbarch. If it is not, then it | |
1378 | means that argument evaluation is not implemented on this target. */ | |
1379 | return gdbarch_stap_is_single_operand_p (gdbarch); | |
1380 | } | |
1381 | ||
55aa24fb SDJ |
1382 | /* Evaluate the probe's argument N (indexed from 0), returning a value |
1383 | corresponding to it. Assertion is thrown if N does not exist. */ | |
1384 | ||
0e9ae10f SDJ |
1385 | struct value * |
1386 | stap_probe::evaluate_argument (unsigned n, struct frame_info *frame) | |
55aa24fb | 1387 | { |
55aa24fb SDJ |
1388 | struct stap_probe_arg *arg; |
1389 | int pos = 0; | |
0e9ae10f | 1390 | struct gdbarch *gdbarch = get_frame_arch (frame); |
55aa24fb | 1391 | |
0e9ae10f SDJ |
1392 | arg = this->get_arg_by_number (n, gdbarch); |
1393 | return evaluate_subexp_standard (arg->atype, arg->aexpr.get (), &pos, | |
1394 | EVAL_NORMAL); | |
55aa24fb SDJ |
1395 | } |
1396 | ||
1397 | /* Compile the probe's argument N (indexed from 0) to agent expression. | |
1398 | Assertion is thrown if N does not exist. */ | |
1399 | ||
0e9ae10f SDJ |
1400 | void |
1401 | stap_probe::compile_to_ax (struct agent_expr *expr, struct axs_value *value, | |
1402 | unsigned n) | |
55aa24fb | 1403 | { |
55aa24fb SDJ |
1404 | struct stap_probe_arg *arg; |
1405 | union exp_element *pc; | |
1406 | ||
0e9ae10f | 1407 | arg = this->get_arg_by_number (n, expr->gdbarch); |
55aa24fb SDJ |
1408 | |
1409 | pc = arg->aexpr->elts; | |
0e9ae10f | 1410 | gen_expr (arg->aexpr.get (), &pc, expr, value); |
55aa24fb SDJ |
1411 | |
1412 | require_rvalue (expr, value); | |
1413 | value->type = arg->atype; | |
1414 | } | |
55aa24fb SDJ |
1415 | \f |
1416 | ||
55aa24fb | 1417 | /* Set or clear a SystemTap semaphore. ADDRESS is the semaphore's |
0e9ae10f SDJ |
1418 | address. SET is zero if the semaphore should be cleared, or one if |
1419 | it should be set. This is a helper function for | |
1420 | 'stap_probe::set_semaphore' and 'stap_probe::clear_semaphore'. */ | |
55aa24fb SDJ |
1421 | |
1422 | static void | |
1423 | stap_modify_semaphore (CORE_ADDR address, int set, struct gdbarch *gdbarch) | |
1424 | { | |
1425 | gdb_byte bytes[sizeof (LONGEST)]; | |
1426 | /* The ABI specifies "unsigned short". */ | |
1427 | struct type *type = builtin_type (gdbarch)->builtin_unsigned_short; | |
1428 | ULONGEST value; | |
1429 | ||
1430 | if (address == 0) | |
1431 | return; | |
1432 | ||
1433 | /* Swallow errors. */ | |
1434 | if (target_read_memory (address, bytes, TYPE_LENGTH (type)) != 0) | |
1435 | { | |
1436 | warning (_("Could not read the value of a SystemTap semaphore.")); | |
1437 | return; | |
1438 | } | |
1439 | ||
1440 | value = extract_unsigned_integer (bytes, TYPE_LENGTH (type), | |
1441 | gdbarch_byte_order (gdbarch)); | |
1442 | /* Note that we explicitly don't worry about overflow or | |
1443 | underflow. */ | |
1444 | if (set) | |
1445 | ++value; | |
1446 | else | |
1447 | --value; | |
1448 | ||
1449 | store_unsigned_integer (bytes, TYPE_LENGTH (type), | |
1450 | gdbarch_byte_order (gdbarch), value); | |
1451 | ||
1452 | if (target_write_memory (address, bytes, TYPE_LENGTH (type)) != 0) | |
1453 | warning (_("Could not write the value of a SystemTap semaphore.")); | |
1454 | } | |
1455 | ||
0e9ae10f | 1456 | /* Implementation of the 'set_semaphore' method. |
55aa24fb | 1457 | |
0e9ae10f SDJ |
1458 | SystemTap semaphores act as reference counters, so calls to this |
1459 | function must be paired with calls to 'clear_semaphore'. | |
55aa24fb | 1460 | |
0e9ae10f SDJ |
1461 | This function and 'clear_semaphore' race with another tool |
1462 | changing the probes, but that is too rare to care. */ | |
1463 | ||
1464 | void | |
1465 | stap_probe::set_semaphore (struct objfile *objfile, struct gdbarch *gdbarch) | |
55aa24fb | 1466 | { |
685de8c2 | 1467 | stap_modify_semaphore (relocate_address (m_sem_addr, objfile), 1, gdbarch); |
0e9ae10f | 1468 | } |
55aa24fb | 1469 | |
0e9ae10f | 1470 | /* Implementation of the 'clear_semaphore' method. */ |
55aa24fb | 1471 | |
0e9ae10f SDJ |
1472 | void |
1473 | stap_probe::clear_semaphore (struct objfile *objfile, struct gdbarch *gdbarch) | |
1474 | { | |
685de8c2 | 1475 | stap_modify_semaphore (relocate_address (m_sem_addr, objfile), 0, gdbarch); |
55aa24fb SDJ |
1476 | } |
1477 | ||
0e9ae10f | 1478 | /* Implementation of the 'get_static_ops' method. */ |
55aa24fb | 1479 | |
0e9ae10f SDJ |
1480 | const static_probe_ops * |
1481 | stap_probe::get_static_ops () const | |
1482 | { | |
1483 | return &stap_static_probe_ops; | |
1484 | } | |
1485 | ||
1486 | /* Implementation of the 'gen_info_probes_table_values' method. */ | |
1487 | ||
1488 | std::vector<const char *> | |
1489 | stap_probe::gen_info_probes_table_values () const | |
55aa24fb | 1490 | { |
0e9ae10f | 1491 | const char *val = NULL; |
55aa24fb | 1492 | |
0e9ae10f SDJ |
1493 | if (m_sem_addr != 0) |
1494 | val = print_core_address (this->get_gdbarch (), m_sem_addr); | |
55aa24fb | 1495 | |
0e9ae10f | 1496 | return std::vector<const char *> { val }; |
55aa24fb SDJ |
1497 | } |
1498 | ||
55aa24fb SDJ |
1499 | /* Helper function that parses the information contained in a |
1500 | SystemTap's probe. Basically, the information consists in: | |
1501 | ||
1502 | - Probe's PC address; | |
1503 | - Link-time section address of `.stapsdt.base' section; | |
1504 | - Link-time address of the semaphore variable, or ZERO if the | |
1505 | probe doesn't have an associated semaphore; | |
1506 | - Probe's provider name; | |
1507 | - Probe's name; | |
3ca58cde | 1508 | - Probe's argument format. */ |
55aa24fb SDJ |
1509 | |
1510 | static void | |
1511 | handle_stap_probe (struct objfile *objfile, struct sdt_note *el, | |
814cf43a TT |
1512 | std::vector<std::unique_ptr<probe>> *probesp, |
1513 | CORE_ADDR base) | |
55aa24fb SDJ |
1514 | { |
1515 | bfd *abfd = objfile->obfd; | |
1516 | int size = bfd_get_arch_size (abfd) / 8; | |
1517 | struct gdbarch *gdbarch = get_objfile_arch (objfile); | |
55aa24fb | 1518 | struct type *ptr_type = builtin_type (gdbarch)->builtin_data_ptr; |
55aa24fb SDJ |
1519 | |
1520 | /* Provider and the name of the probe. */ | |
0e9ae10f SDJ |
1521 | const char *provider = (const char *) &el->data[3 * size]; |
1522 | const char *name = ((const char *) | |
1523 | memchr (provider, '\0', | |
1524 | (char *) el->data + el->size - provider)); | |
55aa24fb | 1525 | /* Making sure there is a name. */ |
0e9ae10f | 1526 | if (name == NULL) |
55aa24fb | 1527 | { |
f3da9116 | 1528 | complaint (_("corrupt probe name when reading `%s'"), |
4262abfb | 1529 | objfile_name (objfile)); |
55aa24fb SDJ |
1530 | |
1531 | /* There is no way to use a probe without a name or a provider, so | |
f3da9116 | 1532 | returning here makes sense. */ |
55aa24fb SDJ |
1533 | return; |
1534 | } | |
1535 | else | |
0e9ae10f | 1536 | ++name; |
55aa24fb SDJ |
1537 | |
1538 | /* Retrieving the probe's address. */ | |
0e9ae10f | 1539 | CORE_ADDR address = extract_typed_address (&el->data[0], ptr_type); |
55aa24fb SDJ |
1540 | |
1541 | /* Link-time sh_addr of `.stapsdt.base' section. */ | |
0e9ae10f | 1542 | CORE_ADDR base_ref = extract_typed_address (&el->data[size], ptr_type); |
55aa24fb SDJ |
1543 | |
1544 | /* Semaphore address. */ | |
0e9ae10f | 1545 | CORE_ADDR sem_addr = extract_typed_address (&el->data[2 * size], ptr_type); |
55aa24fb | 1546 | |
0e9ae10f SDJ |
1547 | address += base - base_ref; |
1548 | if (sem_addr != 0) | |
1549 | sem_addr += base - base_ref; | |
55aa24fb SDJ |
1550 | |
1551 | /* Arguments. We can only extract the argument format if there is a valid | |
1552 | name for this probe. */ | |
0e9ae10f SDJ |
1553 | const char *probe_args = ((const char*) |
1554 | memchr (name, '\0', | |
1555 | (char *) el->data + el->size - name)); | |
55aa24fb SDJ |
1556 | |
1557 | if (probe_args != NULL) | |
1558 | ++probe_args; | |
1559 | ||
97c2dca0 | 1560 | if (probe_args == NULL |
0e9ae10f | 1561 | || (memchr (probe_args, '\0', (char *) el->data + el->size - name) |
97c2dca0 | 1562 | != el->data + el->size - 1)) |
55aa24fb | 1563 | { |
f3da9116 | 1564 | complaint (_("corrupt probe argument when reading `%s'"), |
4262abfb | 1565 | objfile_name (objfile)); |
55aa24fb | 1566 | /* If the argument string is NULL, it means some problem happened with |
f3da9116 | 1567 | it. So we return. */ |
55aa24fb SDJ |
1568 | return; |
1569 | } | |
1570 | ||
0e9ae10f SDJ |
1571 | stap_probe *ret = new stap_probe (std::string (name), std::string (provider), |
1572 | address, gdbarch, sem_addr, probe_args); | |
55aa24fb SDJ |
1573 | |
1574 | /* Successfully created probe. */ | |
814cf43a | 1575 | probesp->emplace_back (ret); |
55aa24fb SDJ |
1576 | } |
1577 | ||
1578 | /* Helper function which tries to find the base address of the SystemTap | |
1579 | base section named STAP_BASE_SECTION_NAME. */ | |
1580 | ||
1581 | static void | |
1582 | get_stap_base_address_1 (bfd *abfd, asection *sect, void *obj) | |
1583 | { | |
19ba03f4 | 1584 | asection **ret = (asection **) obj; |
55aa24fb SDJ |
1585 | |
1586 | if ((sect->flags & (SEC_DATA | SEC_ALLOC | SEC_HAS_CONTENTS)) | |
1587 | && sect->name && !strcmp (sect->name, STAP_BASE_SECTION_NAME)) | |
1588 | *ret = sect; | |
1589 | } | |
1590 | ||
1591 | /* Helper function which iterates over every section in the BFD file, | |
1592 | trying to find the base address of the SystemTap base section. | |
1593 | Returns 1 if found (setting BASE to the proper value), zero otherwise. */ | |
1594 | ||
1595 | static int | |
1596 | get_stap_base_address (bfd *obfd, bfd_vma *base) | |
1597 | { | |
1598 | asection *ret = NULL; | |
1599 | ||
1600 | bfd_map_over_sections (obfd, get_stap_base_address_1, (void *) &ret); | |
1601 | ||
97c2dca0 | 1602 | if (ret == NULL) |
55aa24fb | 1603 | { |
b98664d3 | 1604 | complaint (_("could not obtain base address for " |
55aa24fb SDJ |
1605 | "SystemTap section on objfile `%s'."), |
1606 | obfd->filename); | |
1607 | return 0; | |
1608 | } | |
1609 | ||
97c2dca0 | 1610 | if (base != NULL) |
55aa24fb SDJ |
1611 | *base = ret->vma; |
1612 | ||
1613 | return 1; | |
1614 | } | |
1615 | ||
0e9ae10f | 1616 | /* Implementation of the 'is_linespec' method. */ |
55aa24fb | 1617 | |
0e9ae10f SDJ |
1618 | bool |
1619 | stap_static_probe_ops::is_linespec (const char **linespecp) const | |
1620 | { | |
1621 | static const char *const keywords[] = { "-pstap", "-probe-stap", NULL }; | |
1622 | ||
1623 | return probe_is_linespec_by_keyword (linespecp, keywords); | |
1624 | } | |
1625 | ||
1626 | /* Implementation of the 'get_probes' method. */ | |
1627 | ||
1628 | void | |
814cf43a TT |
1629 | stap_static_probe_ops::get_probes |
1630 | (std::vector<std::unique_ptr<probe>> *probesp, | |
1631 | struct objfile *objfile) const | |
55aa24fb SDJ |
1632 | { |
1633 | /* If we are here, then this is the first time we are parsing the | |
1634 | SystemTap probe's information. We basically have to count how many | |
1635 | probes the objfile has, and then fill in the necessary information | |
1636 | for each one. */ | |
1637 | bfd *obfd = objfile->obfd; | |
1638 | bfd_vma base; | |
1639 | struct sdt_note *iter; | |
aaa63a31 | 1640 | unsigned save_probesp_len = probesp->size (); |
55aa24fb | 1641 | |
d7333987 SDJ |
1642 | if (objfile->separate_debug_objfile_backlink != NULL) |
1643 | { | |
1644 | /* This is a .debug file, not the objfile itself. */ | |
1645 | return; | |
1646 | } | |
1647 | ||
97c2dca0 | 1648 | if (elf_tdata (obfd)->sdt_note_head == NULL) |
55aa24fb SDJ |
1649 | { |
1650 | /* There isn't any probe here. */ | |
1651 | return; | |
1652 | } | |
1653 | ||
1654 | if (!get_stap_base_address (obfd, &base)) | |
1655 | { | |
1656 | /* There was an error finding the base address for the section. | |
1657 | Just return NULL. */ | |
1658 | return; | |
1659 | } | |
1660 | ||
1661 | /* Parsing each probe's information. */ | |
97c2dca0 SDJ |
1662 | for (iter = elf_tdata (obfd)->sdt_note_head; |
1663 | iter != NULL; | |
1664 | iter = iter->next) | |
55aa24fb SDJ |
1665 | { |
1666 | /* We first have to handle all the information about the | |
1667 | probe which is present in the section. */ | |
1668 | handle_stap_probe (objfile, iter, probesp, base); | |
1669 | } | |
1670 | ||
aaa63a31 | 1671 | if (save_probesp_len == probesp->size ()) |
55aa24fb SDJ |
1672 | { |
1673 | /* If we are here, it means we have failed to parse every known | |
1674 | probe. */ | |
f3da9116 | 1675 | complaint (_("could not parse SystemTap probe(s) from inferior")); |
55aa24fb SDJ |
1676 | return; |
1677 | } | |
1678 | } | |
1679 | ||
6f9b8491 JM |
1680 | /* Implementation of the type_name method. */ |
1681 | ||
0e9ae10f SDJ |
1682 | const char * |
1683 | stap_static_probe_ops::type_name () const | |
6f9b8491 | 1684 | { |
6f9b8491 JM |
1685 | return "stap"; |
1686 | } | |
1687 | ||
0e9ae10f | 1688 | /* Implementation of the 'gen_info_probes_table_header' method. */ |
55aa24fb | 1689 | |
0e9ae10f SDJ |
1690 | std::vector<struct info_probe_column> |
1691 | stap_static_probe_ops::gen_info_probes_table_header () const | |
55aa24fb | 1692 | { |
0e9ae10f | 1693 | struct info_probe_column stap_probe_column; |
55aa24fb SDJ |
1694 | |
1695 | stap_probe_column.field_name = "semaphore"; | |
1696 | stap_probe_column.print_name = _("Semaphore"); | |
1697 | ||
0e9ae10f | 1698 | return std::vector<struct info_probe_column> { stap_probe_column }; |
55aa24fb SDJ |
1699 | } |
1700 | ||
55aa24fb SDJ |
1701 | /* Implementation of the `info probes stap' command. */ |
1702 | ||
1703 | static void | |
884beb0c | 1704 | info_probes_stap_command (const char *arg, int from_tty) |
55aa24fb | 1705 | { |
0e9ae10f | 1706 | info_probes_for_spops (arg, from_tty, &stap_static_probe_ops); |
55aa24fb SDJ |
1707 | } |
1708 | ||
55aa24fb SDJ |
1709 | void |
1710 | _initialize_stap_probe (void) | |
1711 | { | |
0e9ae10f | 1712 | all_static_probe_ops.push_back (&stap_static_probe_ops); |
55aa24fb | 1713 | |
ccce17b0 YQ |
1714 | add_setshow_zuinteger_cmd ("stap-expression", class_maintenance, |
1715 | &stap_expression_debug, | |
1716 | _("Set SystemTap expression debugging."), | |
1717 | _("Show SystemTap expression debugging."), | |
1718 | _("When non-zero, the internal representation " | |
1719 | "of SystemTap expressions will be printed."), | |
1720 | NULL, | |
1721 | show_stapexpressiondebug, | |
1722 | &setdebuglist, &showdebuglist); | |
55aa24fb | 1723 | |
55aa24fb SDJ |
1724 | add_cmd ("stap", class_info, info_probes_stap_command, |
1725 | _("\ | |
1726 | Show information about SystemTap static probes.\n\ | |
1727 | Usage: info probes stap [PROVIDER [NAME [OBJECT]]]\n\ | |
1728 | Each argument is a regular expression, used to select probes.\n\ | |
1729 | PROVIDER matches probe provider names.\n\ | |
1730 | NAME matches the probe names.\n\ | |
1731 | OBJECT matches the executable or shared library name."), | |
1732 | info_probes_cmdlist_get ()); | |
1733 | ||
1734 | } |