Commit | Line | Data |
---|---|---|
02d27625 MM |
1 | /* Branch trace support for GDB, the GNU debugger. |
2 | ||
42a4f53d | 3 | Copyright (C) 2013-2019 Free Software Foundation, Inc. |
02d27625 MM |
4 | |
5 | Contributed by Intel Corp. <markus.t.metzger@intel.com> | |
6 | ||
7 | This file is part of GDB. | |
8 | ||
9 | This program is free software; you can redistribute it and/or modify | |
10 | it under the terms of the GNU General Public License as published by | |
11 | the Free Software Foundation; either version 3 of the License, or | |
12 | (at your option) any later version. | |
13 | ||
14 | This program is distributed in the hope that it will be useful, | |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
20 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ | |
21 | ||
d41f6d8e | 22 | #include "defs.h" |
02d27625 MM |
23 | #include "btrace.h" |
24 | #include "gdbthread.h" | |
02d27625 | 25 | #include "inferior.h" |
4de283e4 | 26 | #include "target.h" |
02d27625 | 27 | #include "record.h" |
d55e5aa6 | 28 | #include "symtab.h" |
4de283e4 TT |
29 | #include "disasm.h" |
30 | #include "source.h" | |
31 | #include "filenames.h" | |
c12a2917 | 32 | #include "xml-support.h" |
4de283e4 | 33 | #include "regcache.h" |
268a13a5 | 34 | #include "gdbsupport/rsp-low.h" |
4de283e4 TT |
35 | #include "gdbcmd.h" |
36 | #include "cli/cli-utils.h" | |
0d12e84c | 37 | #include "gdbarch.h" |
b20a6524 | 38 | |
4a4495d6 MM |
39 | /* For maintenance commands. */ |
40 | #include "record-btrace.h" | |
41 | ||
b20a6524 | 42 | #include <inttypes.h> |
b0627500 | 43 | #include <ctype.h> |
325fac50 | 44 | #include <algorithm> |
b0627500 MM |
45 | |
46 | /* Command lists for btrace maintenance commands. */ | |
47 | static struct cmd_list_element *maint_btrace_cmdlist; | |
48 | static struct cmd_list_element *maint_btrace_set_cmdlist; | |
49 | static struct cmd_list_element *maint_btrace_show_cmdlist; | |
50 | static struct cmd_list_element *maint_btrace_pt_set_cmdlist; | |
51 | static struct cmd_list_element *maint_btrace_pt_show_cmdlist; | |
52 | ||
53 | /* Control whether to skip PAD packets when computing the packet history. */ | |
54 | static int maint_btrace_pt_skip_pad = 1; | |
b20a6524 MM |
55 | |
56 | static void btrace_add_pc (struct thread_info *tp); | |
02d27625 MM |
57 | |
58 | /* Print a record debug message. Use do ... while (0) to avoid ambiguities | |
59 | when used in if statements. */ | |
60 | ||
61 | #define DEBUG(msg, args...) \ | |
62 | do \ | |
63 | { \ | |
64 | if (record_debug != 0) \ | |
65 | fprintf_unfiltered (gdb_stdlog, \ | |
66 | "[btrace] " msg "\n", ##args); \ | |
67 | } \ | |
68 | while (0) | |
69 | ||
70 | #define DEBUG_FTRACE(msg, args...) DEBUG ("[ftrace] " msg, ##args) | |
71 | ||
02d27625 MM |
72 | /* Return the function name of a recorded function segment for printing. |
73 | This function never returns NULL. */ | |
74 | ||
75 | static const char * | |
23a7fe75 | 76 | ftrace_print_function_name (const struct btrace_function *bfun) |
02d27625 MM |
77 | { |
78 | struct minimal_symbol *msym; | |
79 | struct symbol *sym; | |
80 | ||
81 | msym = bfun->msym; | |
82 | sym = bfun->sym; | |
83 | ||
84 | if (sym != NULL) | |
85 | return SYMBOL_PRINT_NAME (sym); | |
86 | ||
87 | if (msym != NULL) | |
efd66ac6 | 88 | return MSYMBOL_PRINT_NAME (msym); |
02d27625 MM |
89 | |
90 | return "<unknown>"; | |
91 | } | |
92 | ||
93 | /* Return the file name of a recorded function segment for printing. | |
94 | This function never returns NULL. */ | |
95 | ||
96 | static const char * | |
23a7fe75 | 97 | ftrace_print_filename (const struct btrace_function *bfun) |
02d27625 MM |
98 | { |
99 | struct symbol *sym; | |
100 | const char *filename; | |
101 | ||
102 | sym = bfun->sym; | |
103 | ||
104 | if (sym != NULL) | |
08be3fe3 | 105 | filename = symtab_to_filename_for_display (symbol_symtab (sym)); |
02d27625 MM |
106 | else |
107 | filename = "<unknown>"; | |
108 | ||
109 | return filename; | |
110 | } | |
111 | ||
23a7fe75 MM |
112 | /* Return a string representation of the address of an instruction. |
113 | This function never returns NULL. */ | |
02d27625 | 114 | |
23a7fe75 MM |
115 | static const char * |
116 | ftrace_print_insn_addr (const struct btrace_insn *insn) | |
02d27625 | 117 | { |
23a7fe75 MM |
118 | if (insn == NULL) |
119 | return "<nil>"; | |
120 | ||
121 | return core_addr_to_string_nz (insn->pc); | |
02d27625 MM |
122 | } |
123 | ||
23a7fe75 | 124 | /* Print an ftrace debug status message. */ |
02d27625 MM |
125 | |
126 | static void | |
23a7fe75 | 127 | ftrace_debug (const struct btrace_function *bfun, const char *prefix) |
02d27625 | 128 | { |
23a7fe75 MM |
129 | const char *fun, *file; |
130 | unsigned int ibegin, iend; | |
ce0dfbea | 131 | int level; |
23a7fe75 MM |
132 | |
133 | fun = ftrace_print_function_name (bfun); | |
134 | file = ftrace_print_filename (bfun); | |
135 | level = bfun->level; | |
136 | ||
23a7fe75 | 137 | ibegin = bfun->insn_offset; |
0860c437 | 138 | iend = ibegin + bfun->insn.size (); |
23a7fe75 | 139 | |
ce0dfbea MM |
140 | DEBUG_FTRACE ("%s: fun = %s, file = %s, level = %d, insn = [%u; %u)", |
141 | prefix, fun, file, level, ibegin, iend); | |
02d27625 MM |
142 | } |
143 | ||
69090cee TW |
144 | /* Return the number of instructions in a given function call segment. */ |
145 | ||
146 | static unsigned int | |
147 | ftrace_call_num_insn (const struct btrace_function* bfun) | |
148 | { | |
149 | if (bfun == NULL) | |
150 | return 0; | |
151 | ||
152 | /* A gap is always counted as one instruction. */ | |
153 | if (bfun->errcode != 0) | |
154 | return 1; | |
155 | ||
0860c437 | 156 | return bfun->insn.size (); |
69090cee TW |
157 | } |
158 | ||
42bfe59e TW |
159 | /* Return the function segment with the given NUMBER or NULL if no such segment |
160 | exists. BTINFO is the branch trace information for the current thread. */ | |
161 | ||
162 | static struct btrace_function * | |
08c3f6d2 TW |
163 | ftrace_find_call_by_number (struct btrace_thread_info *btinfo, |
164 | unsigned int number) | |
165 | { | |
166 | if (number == 0 || number > btinfo->functions.size ()) | |
167 | return NULL; | |
168 | ||
169 | return &btinfo->functions[number - 1]; | |
170 | } | |
171 | ||
172 | /* A const version of the function above. */ | |
173 | ||
174 | static const struct btrace_function * | |
42bfe59e TW |
175 | ftrace_find_call_by_number (const struct btrace_thread_info *btinfo, |
176 | unsigned int number) | |
177 | { | |
178 | if (number == 0 || number > btinfo->functions.size ()) | |
179 | return NULL; | |
180 | ||
08c3f6d2 | 181 | return &btinfo->functions[number - 1]; |
42bfe59e TW |
182 | } |
183 | ||
23a7fe75 MM |
184 | /* Return non-zero if BFUN does not match MFUN and FUN, |
185 | return zero otherwise. */ | |
02d27625 MM |
186 | |
187 | static int | |
23a7fe75 MM |
188 | ftrace_function_switched (const struct btrace_function *bfun, |
189 | const struct minimal_symbol *mfun, | |
190 | const struct symbol *fun) | |
02d27625 MM |
191 | { |
192 | struct minimal_symbol *msym; | |
193 | struct symbol *sym; | |
194 | ||
02d27625 MM |
195 | msym = bfun->msym; |
196 | sym = bfun->sym; | |
197 | ||
198 | /* If the minimal symbol changed, we certainly switched functions. */ | |
199 | if (mfun != NULL && msym != NULL | |
efd66ac6 | 200 | && strcmp (MSYMBOL_LINKAGE_NAME (mfun), MSYMBOL_LINKAGE_NAME (msym)) != 0) |
02d27625 MM |
201 | return 1; |
202 | ||
203 | /* If the symbol changed, we certainly switched functions. */ | |
204 | if (fun != NULL && sym != NULL) | |
205 | { | |
206 | const char *bfname, *fname; | |
207 | ||
208 | /* Check the function name. */ | |
209 | if (strcmp (SYMBOL_LINKAGE_NAME (fun), SYMBOL_LINKAGE_NAME (sym)) != 0) | |
210 | return 1; | |
211 | ||
212 | /* Check the location of those functions, as well. */ | |
08be3fe3 DE |
213 | bfname = symtab_to_fullname (symbol_symtab (sym)); |
214 | fname = symtab_to_fullname (symbol_symtab (fun)); | |
02d27625 MM |
215 | if (filename_cmp (fname, bfname) != 0) |
216 | return 1; | |
217 | } | |
218 | ||
23a7fe75 MM |
219 | /* If we lost symbol information, we switched functions. */ |
220 | if (!(msym == NULL && sym == NULL) && mfun == NULL && fun == NULL) | |
221 | return 1; | |
222 | ||
223 | /* If we gained symbol information, we switched functions. */ | |
224 | if (msym == NULL && sym == NULL && !(mfun == NULL && fun == NULL)) | |
225 | return 1; | |
226 | ||
02d27625 MM |
227 | return 0; |
228 | } | |
229 | ||
8286623c TW |
230 | /* Allocate and initialize a new branch trace function segment at the end of |
231 | the trace. | |
17b89b34 | 232 | BTINFO is the branch trace information for the current thread. |
08c3f6d2 TW |
233 | MFUN and FUN are the symbol information we have for this function. |
234 | This invalidates all struct btrace_function pointer currently held. */ | |
23a7fe75 MM |
235 | |
236 | static struct btrace_function * | |
17b89b34 | 237 | ftrace_new_function (struct btrace_thread_info *btinfo, |
23a7fe75 MM |
238 | struct minimal_symbol *mfun, |
239 | struct symbol *fun) | |
240 | { | |
08c3f6d2 TW |
241 | int level; |
242 | unsigned int number, insn_offset; | |
23a7fe75 | 243 | |
b54b03bd | 244 | if (btinfo->functions.empty ()) |
5de9129b | 245 | { |
08c3f6d2 TW |
246 | /* Start counting NUMBER and INSN_OFFSET at one. */ |
247 | level = 0; | |
248 | number = 1; | |
249 | insn_offset = 1; | |
5de9129b MM |
250 | } |
251 | else | |
23a7fe75 | 252 | { |
08c3f6d2 TW |
253 | const struct btrace_function *prev = &btinfo->functions.back (); |
254 | level = prev->level; | |
255 | number = prev->number + 1; | |
256 | insn_offset = prev->insn_offset + ftrace_call_num_insn (prev); | |
23a7fe75 MM |
257 | } |
258 | ||
08c3f6d2 TW |
259 | btinfo->functions.emplace_back (mfun, fun, number, insn_offset, level); |
260 | return &btinfo->functions.back (); | |
02d27625 MM |
261 | } |
262 | ||
23a7fe75 | 263 | /* Update the UP field of a function segment. */ |
02d27625 | 264 | |
23a7fe75 MM |
265 | static void |
266 | ftrace_update_caller (struct btrace_function *bfun, | |
267 | struct btrace_function *caller, | |
268 | enum btrace_function_flag flags) | |
02d27625 | 269 | { |
42bfe59e | 270 | if (bfun->up != 0) |
23a7fe75 | 271 | ftrace_debug (bfun, "updating caller"); |
02d27625 | 272 | |
42bfe59e | 273 | bfun->up = caller->number; |
23a7fe75 MM |
274 | bfun->flags = flags; |
275 | ||
276 | ftrace_debug (bfun, "set caller"); | |
d87fdac3 | 277 | ftrace_debug (caller, "..to"); |
23a7fe75 MM |
278 | } |
279 | ||
280 | /* Fix up the caller for all segments of a function. */ | |
281 | ||
282 | static void | |
4aeb0dfc TW |
283 | ftrace_fixup_caller (struct btrace_thread_info *btinfo, |
284 | struct btrace_function *bfun, | |
23a7fe75 MM |
285 | struct btrace_function *caller, |
286 | enum btrace_function_flag flags) | |
287 | { | |
4aeb0dfc | 288 | unsigned int prev, next; |
23a7fe75 | 289 | |
4aeb0dfc TW |
290 | prev = bfun->prev; |
291 | next = bfun->next; | |
23a7fe75 MM |
292 | ftrace_update_caller (bfun, caller, flags); |
293 | ||
294 | /* Update all function segments belonging to the same function. */ | |
4aeb0dfc TW |
295 | for (; prev != 0; prev = bfun->prev) |
296 | { | |
297 | bfun = ftrace_find_call_by_number (btinfo, prev); | |
298 | ftrace_update_caller (bfun, caller, flags); | |
299 | } | |
23a7fe75 | 300 | |
4aeb0dfc TW |
301 | for (; next != 0; next = bfun->next) |
302 | { | |
303 | bfun = ftrace_find_call_by_number (btinfo, next); | |
304 | ftrace_update_caller (bfun, caller, flags); | |
305 | } | |
23a7fe75 MM |
306 | } |
307 | ||
8286623c | 308 | /* Add a new function segment for a call at the end of the trace. |
17b89b34 | 309 | BTINFO is the branch trace information for the current thread. |
23a7fe75 MM |
310 | MFUN and FUN are the symbol information we have for this function. */ |
311 | ||
312 | static struct btrace_function * | |
17b89b34 | 313 | ftrace_new_call (struct btrace_thread_info *btinfo, |
23a7fe75 MM |
314 | struct minimal_symbol *mfun, |
315 | struct symbol *fun) | |
316 | { | |
b54b03bd | 317 | const unsigned int length = btinfo->functions.size (); |
8286623c | 318 | struct btrace_function *bfun = ftrace_new_function (btinfo, mfun, fun); |
23a7fe75 | 319 | |
42bfe59e | 320 | bfun->up = length; |
31fd9caa | 321 | bfun->level += 1; |
23a7fe75 MM |
322 | |
323 | ftrace_debug (bfun, "new call"); | |
324 | ||
325 | return bfun; | |
326 | } | |
327 | ||
8286623c | 328 | /* Add a new function segment for a tail call at the end of the trace. |
17b89b34 | 329 | BTINFO is the branch trace information for the current thread. |
23a7fe75 MM |
330 | MFUN and FUN are the symbol information we have for this function. */ |
331 | ||
332 | static struct btrace_function * | |
17b89b34 | 333 | ftrace_new_tailcall (struct btrace_thread_info *btinfo, |
23a7fe75 MM |
334 | struct minimal_symbol *mfun, |
335 | struct symbol *fun) | |
336 | { | |
b54b03bd | 337 | const unsigned int length = btinfo->functions.size (); |
8286623c | 338 | struct btrace_function *bfun = ftrace_new_function (btinfo, mfun, fun); |
02d27625 | 339 | |
42bfe59e | 340 | bfun->up = length; |
31fd9caa | 341 | bfun->level += 1; |
23a7fe75 | 342 | bfun->flags |= BFUN_UP_LINKS_TO_TAILCALL; |
02d27625 | 343 | |
23a7fe75 MM |
344 | ftrace_debug (bfun, "new tail call"); |
345 | ||
346 | return bfun; | |
347 | } | |
348 | ||
d87fdac3 | 349 | /* Return the caller of BFUN or NULL if there is none. This function skips |
42bfe59e TW |
350 | tail calls in the call chain. BTINFO is the branch trace information for |
351 | the current thread. */ | |
d87fdac3 | 352 | static struct btrace_function * |
42bfe59e TW |
353 | ftrace_get_caller (struct btrace_thread_info *btinfo, |
354 | struct btrace_function *bfun) | |
d87fdac3 | 355 | { |
42bfe59e | 356 | for (; bfun != NULL; bfun = ftrace_find_call_by_number (btinfo, bfun->up)) |
d87fdac3 | 357 | if ((bfun->flags & BFUN_UP_LINKS_TO_TAILCALL) == 0) |
42bfe59e | 358 | return ftrace_find_call_by_number (btinfo, bfun->up); |
d87fdac3 MM |
359 | |
360 | return NULL; | |
361 | } | |
362 | ||
23a7fe75 | 363 | /* Find the innermost caller in the back trace of BFUN with MFUN/FUN |
42bfe59e TW |
364 | symbol information. BTINFO is the branch trace information for the current |
365 | thread. */ | |
23a7fe75 MM |
366 | |
367 | static struct btrace_function * | |
42bfe59e TW |
368 | ftrace_find_caller (struct btrace_thread_info *btinfo, |
369 | struct btrace_function *bfun, | |
23a7fe75 MM |
370 | struct minimal_symbol *mfun, |
371 | struct symbol *fun) | |
372 | { | |
42bfe59e | 373 | for (; bfun != NULL; bfun = ftrace_find_call_by_number (btinfo, bfun->up)) |
23a7fe75 MM |
374 | { |
375 | /* Skip functions with incompatible symbol information. */ | |
376 | if (ftrace_function_switched (bfun, mfun, fun)) | |
377 | continue; | |
378 | ||
379 | /* This is the function segment we're looking for. */ | |
380 | break; | |
381 | } | |
382 | ||
383 | return bfun; | |
384 | } | |
385 | ||
386 | /* Find the innermost caller in the back trace of BFUN, skipping all | |
387 | function segments that do not end with a call instruction (e.g. | |
42bfe59e TW |
388 | tail calls ending with a jump). BTINFO is the branch trace information for |
389 | the current thread. */ | |
23a7fe75 MM |
390 | |
391 | static struct btrace_function * | |
42bfe59e TW |
392 | ftrace_find_call (struct btrace_thread_info *btinfo, |
393 | struct btrace_function *bfun) | |
23a7fe75 | 394 | { |
42bfe59e | 395 | for (; bfun != NULL; bfun = ftrace_find_call_by_number (btinfo, bfun->up)) |
02d27625 | 396 | { |
31fd9caa MM |
397 | /* Skip gaps. */ |
398 | if (bfun->errcode != 0) | |
399 | continue; | |
23a7fe75 | 400 | |
0860c437 | 401 | btrace_insn &last = bfun->insn.back (); |
02d27625 | 402 | |
0860c437 | 403 | if (last.iclass == BTRACE_INSN_CALL) |
23a7fe75 MM |
404 | break; |
405 | } | |
406 | ||
407 | return bfun; | |
408 | } | |
409 | ||
8286623c TW |
410 | /* Add a continuation segment for a function into which we return at the end of |
411 | the trace. | |
17b89b34 | 412 | BTINFO is the branch trace information for the current thread. |
23a7fe75 MM |
413 | MFUN and FUN are the symbol information we have for this function. */ |
414 | ||
415 | static struct btrace_function * | |
17b89b34 | 416 | ftrace_new_return (struct btrace_thread_info *btinfo, |
23a7fe75 MM |
417 | struct minimal_symbol *mfun, |
418 | struct symbol *fun) | |
419 | { | |
08c3f6d2 | 420 | struct btrace_function *prev, *bfun, *caller; |
23a7fe75 | 421 | |
8286623c | 422 | bfun = ftrace_new_function (btinfo, mfun, fun); |
08c3f6d2 | 423 | prev = ftrace_find_call_by_number (btinfo, bfun->number - 1); |
23a7fe75 MM |
424 | |
425 | /* It is important to start at PREV's caller. Otherwise, we might find | |
426 | PREV itself, if PREV is a recursive function. */ | |
42bfe59e TW |
427 | caller = ftrace_find_call_by_number (btinfo, prev->up); |
428 | caller = ftrace_find_caller (btinfo, caller, mfun, fun); | |
23a7fe75 MM |
429 | if (caller != NULL) |
430 | { | |
431 | /* The caller of PREV is the preceding btrace function segment in this | |
432 | function instance. */ | |
4aeb0dfc | 433 | gdb_assert (caller->next == 0); |
23a7fe75 | 434 | |
4aeb0dfc TW |
435 | caller->next = bfun->number; |
436 | bfun->prev = caller->number; | |
23a7fe75 MM |
437 | |
438 | /* Maintain the function level. */ | |
439 | bfun->level = caller->level; | |
440 | ||
441 | /* Maintain the call stack. */ | |
442 | bfun->up = caller->up; | |
443 | bfun->flags = caller->flags; | |
444 | ||
445 | ftrace_debug (bfun, "new return"); | |
446 | } | |
447 | else | |
448 | { | |
449 | /* We did not find a caller. This could mean that something went | |
450 | wrong or that the call is simply not included in the trace. */ | |
02d27625 | 451 | |
23a7fe75 | 452 | /* Let's search for some actual call. */ |
42bfe59e TW |
453 | caller = ftrace_find_call_by_number (btinfo, prev->up); |
454 | caller = ftrace_find_call (btinfo, caller); | |
23a7fe75 | 455 | if (caller == NULL) |
02d27625 | 456 | { |
23a7fe75 MM |
457 | /* There is no call in PREV's back trace. We assume that the |
458 | branch trace did not include it. */ | |
459 | ||
259ba1e8 MM |
460 | /* Let's find the topmost function and add a new caller for it. |
461 | This should handle a series of initial tail calls. */ | |
42bfe59e TW |
462 | while (prev->up != 0) |
463 | prev = ftrace_find_call_by_number (btinfo, prev->up); | |
02d27625 | 464 | |
259ba1e8 | 465 | bfun->level = prev->level - 1; |
23a7fe75 MM |
466 | |
467 | /* Fix up the call stack for PREV. */ | |
4aeb0dfc | 468 | ftrace_fixup_caller (btinfo, prev, bfun, BFUN_UP_LINKS_TO_RET); |
23a7fe75 MM |
469 | |
470 | ftrace_debug (bfun, "new return - no caller"); | |
471 | } | |
472 | else | |
02d27625 | 473 | { |
23a7fe75 | 474 | /* There is a call in PREV's back trace to which we should have |
259ba1e8 MM |
475 | returned but didn't. Let's start a new, separate back trace |
476 | from PREV's level. */ | |
477 | bfun->level = prev->level - 1; | |
478 | ||
479 | /* We fix up the back trace for PREV but leave other function segments | |
480 | on the same level as they are. | |
481 | This should handle things like schedule () correctly where we're | |
482 | switching contexts. */ | |
42bfe59e | 483 | prev->up = bfun->number; |
259ba1e8 | 484 | prev->flags = BFUN_UP_LINKS_TO_RET; |
02d27625 | 485 | |
23a7fe75 | 486 | ftrace_debug (bfun, "new return - unknown caller"); |
02d27625 | 487 | } |
23a7fe75 MM |
488 | } |
489 | ||
490 | return bfun; | |
491 | } | |
492 | ||
8286623c | 493 | /* Add a new function segment for a function switch at the end of the trace. |
17b89b34 | 494 | BTINFO is the branch trace information for the current thread. |
23a7fe75 MM |
495 | MFUN and FUN are the symbol information we have for this function. */ |
496 | ||
497 | static struct btrace_function * | |
17b89b34 | 498 | ftrace_new_switch (struct btrace_thread_info *btinfo, |
23a7fe75 MM |
499 | struct minimal_symbol *mfun, |
500 | struct symbol *fun) | |
501 | { | |
08c3f6d2 | 502 | struct btrace_function *prev, *bfun; |
23a7fe75 | 503 | |
4c2c7ac6 MM |
504 | /* This is an unexplained function switch. We can't really be sure about the |
505 | call stack, yet the best I can think of right now is to preserve it. */ | |
8286623c | 506 | bfun = ftrace_new_function (btinfo, mfun, fun); |
08c3f6d2 | 507 | prev = ftrace_find_call_by_number (btinfo, bfun->number - 1); |
4c2c7ac6 MM |
508 | bfun->up = prev->up; |
509 | bfun->flags = prev->flags; | |
02d27625 | 510 | |
23a7fe75 MM |
511 | ftrace_debug (bfun, "new switch"); |
512 | ||
513 | return bfun; | |
514 | } | |
515 | ||
8286623c TW |
516 | /* Add a new function segment for a gap in the trace due to a decode error at |
517 | the end of the trace. | |
17b89b34 | 518 | BTINFO is the branch trace information for the current thread. |
31fd9caa MM |
519 | ERRCODE is the format-specific error code. */ |
520 | ||
521 | static struct btrace_function * | |
8ffd39f2 TW |
522 | ftrace_new_gap (struct btrace_thread_info *btinfo, int errcode, |
523 | std::vector<unsigned int> &gaps) | |
31fd9caa MM |
524 | { |
525 | struct btrace_function *bfun; | |
526 | ||
b54b03bd | 527 | if (btinfo->functions.empty ()) |
8286623c | 528 | bfun = ftrace_new_function (btinfo, NULL, NULL); |
b54b03bd TW |
529 | else |
530 | { | |
531 | /* We hijack the previous function segment if it was empty. */ | |
08c3f6d2 | 532 | bfun = &btinfo->functions.back (); |
0860c437 | 533 | if (bfun->errcode != 0 || !bfun->insn.empty ()) |
b54b03bd TW |
534 | bfun = ftrace_new_function (btinfo, NULL, NULL); |
535 | } | |
31fd9caa MM |
536 | |
537 | bfun->errcode = errcode; | |
8ffd39f2 | 538 | gaps.push_back (bfun->number); |
31fd9caa MM |
539 | |
540 | ftrace_debug (bfun, "new gap"); | |
541 | ||
542 | return bfun; | |
543 | } | |
544 | ||
8286623c TW |
545 | /* Update the current function segment at the end of the trace in BTINFO with |
546 | respect to the instruction at PC. This may create new function segments. | |
23a7fe75 MM |
547 | Return the chronologically latest function segment, never NULL. */ |
548 | ||
549 | static struct btrace_function * | |
8286623c | 550 | ftrace_update_function (struct btrace_thread_info *btinfo, CORE_ADDR pc) |
23a7fe75 MM |
551 | { |
552 | struct bound_minimal_symbol bmfun; | |
553 | struct minimal_symbol *mfun; | |
554 | struct symbol *fun; | |
b54b03bd | 555 | struct btrace_function *bfun; |
23a7fe75 MM |
556 | |
557 | /* Try to determine the function we're in. We use both types of symbols | |
558 | to avoid surprises when we sometimes get a full symbol and sometimes | |
559 | only a minimal symbol. */ | |
560 | fun = find_pc_function (pc); | |
561 | bmfun = lookup_minimal_symbol_by_pc (pc); | |
562 | mfun = bmfun.minsym; | |
563 | ||
564 | if (fun == NULL && mfun == NULL) | |
565 | DEBUG_FTRACE ("no symbol at %s", core_addr_to_string_nz (pc)); | |
566 | ||
b54b03bd TW |
567 | /* If we didn't have a function, we create one. */ |
568 | if (btinfo->functions.empty ()) | |
569 | return ftrace_new_function (btinfo, mfun, fun); | |
570 | ||
571 | /* If we had a gap before, we create a function. */ | |
08c3f6d2 | 572 | bfun = &btinfo->functions.back (); |
b54b03bd | 573 | if (bfun->errcode != 0) |
8286623c | 574 | return ftrace_new_function (btinfo, mfun, fun); |
23a7fe75 MM |
575 | |
576 | /* Check the last instruction, if we have one. | |
577 | We do this check first, since it allows us to fill in the call stack | |
578 | links in addition to the normal flow links. */ | |
0860c437 SM |
579 | btrace_insn *last = NULL; |
580 | if (!bfun->insn.empty ()) | |
581 | last = &bfun->insn.back (); | |
23a7fe75 MM |
582 | |
583 | if (last != NULL) | |
584 | { | |
7d5c24b3 MM |
585 | switch (last->iclass) |
586 | { | |
587 | case BTRACE_INSN_RETURN: | |
986b6601 MM |
588 | { |
589 | const char *fname; | |
590 | ||
591 | /* On some systems, _dl_runtime_resolve returns to the resolved | |
592 | function instead of jumping to it. From our perspective, | |
593 | however, this is a tailcall. | |
594 | If we treated it as return, we wouldn't be able to find the | |
595 | resolved function in our stack back trace. Hence, we would | |
596 | lose the current stack back trace and start anew with an empty | |
597 | back trace. When the resolved function returns, we would then | |
598 | create a stack back trace with the same function names but | |
599 | different frame id's. This will confuse stepping. */ | |
600 | fname = ftrace_print_function_name (bfun); | |
601 | if (strcmp (fname, "_dl_runtime_resolve") == 0) | |
8286623c | 602 | return ftrace_new_tailcall (btinfo, mfun, fun); |
986b6601 | 603 | |
8286623c | 604 | return ftrace_new_return (btinfo, mfun, fun); |
986b6601 | 605 | } |
23a7fe75 | 606 | |
7d5c24b3 MM |
607 | case BTRACE_INSN_CALL: |
608 | /* Ignore calls to the next instruction. They are used for PIC. */ | |
609 | if (last->pc + last->size == pc) | |
610 | break; | |
23a7fe75 | 611 | |
8286623c | 612 | return ftrace_new_call (btinfo, mfun, fun); |
23a7fe75 | 613 | |
7d5c24b3 MM |
614 | case BTRACE_INSN_JUMP: |
615 | { | |
616 | CORE_ADDR start; | |
23a7fe75 | 617 | |
7d5c24b3 | 618 | start = get_pc_function_start (pc); |
23a7fe75 | 619 | |
2dfdb47a MM |
620 | /* A jump to the start of a function is (typically) a tail call. */ |
621 | if (start == pc) | |
8286623c | 622 | return ftrace_new_tailcall (btinfo, mfun, fun); |
2dfdb47a | 623 | |
2cb2ba9a MM |
624 | /* Some versions of _Unwind_RaiseException use an indirect |
625 | jump to 'return' to the exception handler of the caller | |
626 | handling the exception instead of a return. Let's restrict | |
627 | this heuristic to that and related functions. */ | |
628 | const char *fname = ftrace_print_function_name (bfun); | |
629 | if (strncmp (fname, "_Unwind_", strlen ("_Unwind_")) == 0) | |
630 | { | |
631 | struct btrace_function *caller | |
632 | = ftrace_find_call_by_number (btinfo, bfun->up); | |
633 | caller = ftrace_find_caller (btinfo, caller, mfun, fun); | |
634 | if (caller != NULL) | |
635 | return ftrace_new_return (btinfo, mfun, fun); | |
636 | } | |
637 | ||
7d5c24b3 | 638 | /* If we can't determine the function for PC, we treat a jump at |
2dfdb47a MM |
639 | the end of the block as tail call if we're switching functions |
640 | and as an intra-function branch if we don't. */ | |
641 | if (start == 0 && ftrace_function_switched (bfun, mfun, fun)) | |
8286623c | 642 | return ftrace_new_tailcall (btinfo, mfun, fun); |
2dfdb47a MM |
643 | |
644 | break; | |
7d5c24b3 | 645 | } |
02d27625 | 646 | } |
23a7fe75 MM |
647 | } |
648 | ||
649 | /* Check if we're switching functions for some other reason. */ | |
650 | if (ftrace_function_switched (bfun, mfun, fun)) | |
651 | { | |
652 | DEBUG_FTRACE ("switching from %s in %s at %s", | |
653 | ftrace_print_insn_addr (last), | |
654 | ftrace_print_function_name (bfun), | |
655 | ftrace_print_filename (bfun)); | |
02d27625 | 656 | |
8286623c | 657 | return ftrace_new_switch (btinfo, mfun, fun); |
23a7fe75 MM |
658 | } |
659 | ||
660 | return bfun; | |
661 | } | |
662 | ||
23a7fe75 MM |
663 | /* Add the instruction at PC to BFUN's instructions. */ |
664 | ||
665 | static void | |
0860c437 | 666 | ftrace_update_insns (struct btrace_function *bfun, const btrace_insn &insn) |
23a7fe75 | 667 | { |
0860c437 | 668 | bfun->insn.push_back (insn); |
23a7fe75 MM |
669 | |
670 | if (record_debug > 1) | |
671 | ftrace_debug (bfun, "update insn"); | |
672 | } | |
673 | ||
7d5c24b3 MM |
674 | /* Classify the instruction at PC. */ |
675 | ||
676 | static enum btrace_insn_class | |
677 | ftrace_classify_insn (struct gdbarch *gdbarch, CORE_ADDR pc) | |
678 | { | |
7d5c24b3 MM |
679 | enum btrace_insn_class iclass; |
680 | ||
681 | iclass = BTRACE_INSN_OTHER; | |
a70b8144 | 682 | try |
7d5c24b3 MM |
683 | { |
684 | if (gdbarch_insn_is_call (gdbarch, pc)) | |
685 | iclass = BTRACE_INSN_CALL; | |
686 | else if (gdbarch_insn_is_ret (gdbarch, pc)) | |
687 | iclass = BTRACE_INSN_RETURN; | |
688 | else if (gdbarch_insn_is_jump (gdbarch, pc)) | |
689 | iclass = BTRACE_INSN_JUMP; | |
690 | } | |
230d2906 | 691 | catch (const gdb_exception_error &error) |
492d29ea PA |
692 | { |
693 | } | |
7d5c24b3 MM |
694 | |
695 | return iclass; | |
696 | } | |
697 | ||
d87fdac3 MM |
698 | /* Try to match the back trace at LHS to the back trace at RHS. Returns the |
699 | number of matching function segments or zero if the back traces do not | |
42bfe59e | 700 | match. BTINFO is the branch trace information for the current thread. */ |
d87fdac3 MM |
701 | |
702 | static int | |
42bfe59e TW |
703 | ftrace_match_backtrace (struct btrace_thread_info *btinfo, |
704 | struct btrace_function *lhs, | |
d87fdac3 MM |
705 | struct btrace_function *rhs) |
706 | { | |
707 | int matches; | |
708 | ||
709 | for (matches = 0; lhs != NULL && rhs != NULL; ++matches) | |
710 | { | |
711 | if (ftrace_function_switched (lhs, rhs->msym, rhs->sym)) | |
712 | return 0; | |
713 | ||
42bfe59e TW |
714 | lhs = ftrace_get_caller (btinfo, lhs); |
715 | rhs = ftrace_get_caller (btinfo, rhs); | |
d87fdac3 MM |
716 | } |
717 | ||
718 | return matches; | |
719 | } | |
720 | ||
eb8f2b9c TW |
721 | /* Add ADJUSTMENT to the level of BFUN and succeeding function segments. |
722 | BTINFO is the branch trace information for the current thread. */ | |
d87fdac3 MM |
723 | |
724 | static void | |
eb8f2b9c TW |
725 | ftrace_fixup_level (struct btrace_thread_info *btinfo, |
726 | struct btrace_function *bfun, int adjustment) | |
d87fdac3 MM |
727 | { |
728 | if (adjustment == 0) | |
729 | return; | |
730 | ||
731 | DEBUG_FTRACE ("fixup level (%+d)", adjustment); | |
732 | ftrace_debug (bfun, "..bfun"); | |
733 | ||
eb8f2b9c TW |
734 | while (bfun != NULL) |
735 | { | |
736 | bfun->level += adjustment; | |
737 | bfun = ftrace_find_call_by_number (btinfo, bfun->number + 1); | |
738 | } | |
d87fdac3 MM |
739 | } |
740 | ||
741 | /* Recompute the global level offset. Traverse the function trace and compute | |
742 | the global level offset as the negative of the minimal function level. */ | |
743 | ||
744 | static void | |
745 | ftrace_compute_global_level_offset (struct btrace_thread_info *btinfo) | |
746 | { | |
b54b03bd | 747 | int level = INT_MAX; |
d87fdac3 MM |
748 | |
749 | if (btinfo == NULL) | |
750 | return; | |
751 | ||
b54b03bd | 752 | if (btinfo->functions.empty ()) |
d87fdac3 MM |
753 | return; |
754 | ||
b54b03bd TW |
755 | unsigned int length = btinfo->functions.size() - 1; |
756 | for (unsigned int i = 0; i < length; ++i) | |
08c3f6d2 | 757 | level = std::min (level, btinfo->functions[i].level); |
b54b03bd | 758 | |
d87fdac3 MM |
759 | /* The last function segment contains the current instruction, which is not |
760 | really part of the trace. If it contains just this one instruction, we | |
b54b03bd | 761 | ignore the segment. */ |
08c3f6d2 | 762 | struct btrace_function *last = &btinfo->functions.back(); |
0860c437 | 763 | if (last->insn.size () != 1) |
b54b03bd | 764 | level = std::min (level, last->level); |
d87fdac3 MM |
765 | |
766 | DEBUG_FTRACE ("setting global level offset: %d", -level); | |
767 | btinfo->level = -level; | |
768 | } | |
769 | ||
770 | /* Connect the function segments PREV and NEXT in a bottom-to-top walk as in | |
42bfe59e TW |
771 | ftrace_connect_backtrace. BTINFO is the branch trace information for the |
772 | current thread. */ | |
d87fdac3 MM |
773 | |
774 | static void | |
42bfe59e TW |
775 | ftrace_connect_bfun (struct btrace_thread_info *btinfo, |
776 | struct btrace_function *prev, | |
d87fdac3 MM |
777 | struct btrace_function *next) |
778 | { | |
779 | DEBUG_FTRACE ("connecting..."); | |
780 | ftrace_debug (prev, "..prev"); | |
781 | ftrace_debug (next, "..next"); | |
782 | ||
783 | /* The function segments are not yet connected. */ | |
4aeb0dfc TW |
784 | gdb_assert (prev->next == 0); |
785 | gdb_assert (next->prev == 0); | |
d87fdac3 | 786 | |
4aeb0dfc TW |
787 | prev->next = next->number; |
788 | next->prev = prev->number; | |
d87fdac3 MM |
789 | |
790 | /* We may have moved NEXT to a different function level. */ | |
eb8f2b9c | 791 | ftrace_fixup_level (btinfo, next, prev->level - next->level); |
d87fdac3 MM |
792 | |
793 | /* If we run out of back trace for one, let's use the other's. */ | |
42bfe59e | 794 | if (prev->up == 0) |
d87fdac3 | 795 | { |
42bfe59e TW |
796 | const btrace_function_flags flags = next->flags; |
797 | ||
798 | next = ftrace_find_call_by_number (btinfo, next->up); | |
799 | if (next != NULL) | |
d87fdac3 MM |
800 | { |
801 | DEBUG_FTRACE ("using next's callers"); | |
4aeb0dfc | 802 | ftrace_fixup_caller (btinfo, prev, next, flags); |
d87fdac3 MM |
803 | } |
804 | } | |
42bfe59e | 805 | else if (next->up == 0) |
d87fdac3 | 806 | { |
42bfe59e TW |
807 | const btrace_function_flags flags = prev->flags; |
808 | ||
809 | prev = ftrace_find_call_by_number (btinfo, prev->up); | |
810 | if (prev != NULL) | |
d87fdac3 MM |
811 | { |
812 | DEBUG_FTRACE ("using prev's callers"); | |
4aeb0dfc | 813 | ftrace_fixup_caller (btinfo, next, prev, flags); |
d87fdac3 MM |
814 | } |
815 | } | |
816 | else | |
817 | { | |
818 | /* PREV may have a tailcall caller, NEXT can't. If it does, fixup the up | |
819 | link to add the tail callers to NEXT's back trace. | |
820 | ||
821 | This removes NEXT->UP from NEXT's back trace. It will be added back | |
822 | when connecting NEXT and PREV's callers - provided they exist. | |
823 | ||
824 | If PREV's back trace consists of a series of tail calls without an | |
825 | actual call, there will be no further connection and NEXT's caller will | |
826 | be removed for good. To catch this case, we handle it here and connect | |
827 | the top of PREV's back trace to NEXT's caller. */ | |
828 | if ((prev->flags & BFUN_UP_LINKS_TO_TAILCALL) != 0) | |
829 | { | |
830 | struct btrace_function *caller; | |
42bfe59e | 831 | btrace_function_flags next_flags, prev_flags; |
d87fdac3 MM |
832 | |
833 | /* We checked NEXT->UP above so CALLER can't be NULL. */ | |
42bfe59e TW |
834 | caller = ftrace_find_call_by_number (btinfo, next->up); |
835 | next_flags = next->flags; | |
836 | prev_flags = prev->flags; | |
d87fdac3 MM |
837 | |
838 | DEBUG_FTRACE ("adding prev's tail calls to next"); | |
839 | ||
42bfe59e | 840 | prev = ftrace_find_call_by_number (btinfo, prev->up); |
4aeb0dfc | 841 | ftrace_fixup_caller (btinfo, next, prev, prev_flags); |
d87fdac3 | 842 | |
42bfe59e TW |
843 | for (; prev != NULL; prev = ftrace_find_call_by_number (btinfo, |
844 | prev->up)) | |
d87fdac3 MM |
845 | { |
846 | /* At the end of PREV's back trace, continue with CALLER. */ | |
42bfe59e | 847 | if (prev->up == 0) |
d87fdac3 MM |
848 | { |
849 | DEBUG_FTRACE ("fixing up link for tailcall chain"); | |
850 | ftrace_debug (prev, "..top"); | |
851 | ftrace_debug (caller, "..up"); | |
852 | ||
4aeb0dfc | 853 | ftrace_fixup_caller (btinfo, prev, caller, next_flags); |
d87fdac3 MM |
854 | |
855 | /* If we skipped any tail calls, this may move CALLER to a | |
856 | different function level. | |
857 | ||
858 | Note that changing CALLER's level is only OK because we | |
859 | know that this is the last iteration of the bottom-to-top | |
860 | walk in ftrace_connect_backtrace. | |
861 | ||
862 | Otherwise we will fix up CALLER's level when we connect it | |
863 | to PREV's caller in the next iteration. */ | |
eb8f2b9c TW |
864 | ftrace_fixup_level (btinfo, caller, |
865 | prev->level - caller->level - 1); | |
d87fdac3 MM |
866 | break; |
867 | } | |
868 | ||
869 | /* There's nothing to do if we find a real call. */ | |
870 | if ((prev->flags & BFUN_UP_LINKS_TO_TAILCALL) == 0) | |
871 | { | |
872 | DEBUG_FTRACE ("will fix up link in next iteration"); | |
873 | break; | |
874 | } | |
875 | } | |
876 | } | |
877 | } | |
878 | } | |
879 | ||
880 | /* Connect function segments on the same level in the back trace at LHS and RHS. | |
881 | The back traces at LHS and RHS are expected to match according to | |
42bfe59e TW |
882 | ftrace_match_backtrace. BTINFO is the branch trace information for the |
883 | current thread. */ | |
d87fdac3 MM |
884 | |
885 | static void | |
42bfe59e TW |
886 | ftrace_connect_backtrace (struct btrace_thread_info *btinfo, |
887 | struct btrace_function *lhs, | |
d87fdac3 MM |
888 | struct btrace_function *rhs) |
889 | { | |
890 | while (lhs != NULL && rhs != NULL) | |
891 | { | |
892 | struct btrace_function *prev, *next; | |
893 | ||
894 | gdb_assert (!ftrace_function_switched (lhs, rhs->msym, rhs->sym)); | |
895 | ||
896 | /* Connecting LHS and RHS may change the up link. */ | |
897 | prev = lhs; | |
898 | next = rhs; | |
899 | ||
42bfe59e TW |
900 | lhs = ftrace_get_caller (btinfo, lhs); |
901 | rhs = ftrace_get_caller (btinfo, rhs); | |
d87fdac3 | 902 | |
42bfe59e | 903 | ftrace_connect_bfun (btinfo, prev, next); |
d87fdac3 MM |
904 | } |
905 | } | |
906 | ||
907 | /* Bridge the gap between two function segments left and right of a gap if their | |
42bfe59e TW |
908 | respective back traces match in at least MIN_MATCHES functions. BTINFO is |
909 | the branch trace information for the current thread. | |
d87fdac3 MM |
910 | |
911 | Returns non-zero if the gap could be bridged, zero otherwise. */ | |
912 | ||
913 | static int | |
42bfe59e TW |
914 | ftrace_bridge_gap (struct btrace_thread_info *btinfo, |
915 | struct btrace_function *lhs, struct btrace_function *rhs, | |
d87fdac3 MM |
916 | int min_matches) |
917 | { | |
918 | struct btrace_function *best_l, *best_r, *cand_l, *cand_r; | |
919 | int best_matches; | |
920 | ||
921 | DEBUG_FTRACE ("checking gap at insn %u (req matches: %d)", | |
922 | rhs->insn_offset - 1, min_matches); | |
923 | ||
924 | best_matches = 0; | |
925 | best_l = NULL; | |
926 | best_r = NULL; | |
927 | ||
928 | /* We search the back traces of LHS and RHS for valid connections and connect | |
929 | the two functon segments that give the longest combined back trace. */ | |
930 | ||
42bfe59e TW |
931 | for (cand_l = lhs; cand_l != NULL; |
932 | cand_l = ftrace_get_caller (btinfo, cand_l)) | |
933 | for (cand_r = rhs; cand_r != NULL; | |
934 | cand_r = ftrace_get_caller (btinfo, cand_r)) | |
d87fdac3 MM |
935 | { |
936 | int matches; | |
937 | ||
42bfe59e | 938 | matches = ftrace_match_backtrace (btinfo, cand_l, cand_r); |
d87fdac3 MM |
939 | if (best_matches < matches) |
940 | { | |
941 | best_matches = matches; | |
942 | best_l = cand_l; | |
943 | best_r = cand_r; | |
944 | } | |
945 | } | |
946 | ||
947 | /* We need at least MIN_MATCHES matches. */ | |
948 | gdb_assert (min_matches > 0); | |
949 | if (best_matches < min_matches) | |
950 | return 0; | |
951 | ||
952 | DEBUG_FTRACE ("..matches: %d", best_matches); | |
953 | ||
954 | /* We will fix up the level of BEST_R and succeeding function segments such | |
955 | that BEST_R's level matches BEST_L's when we connect BEST_L to BEST_R. | |
956 | ||
957 | This will ignore the level of RHS and following if BEST_R != RHS. I.e. if | |
958 | BEST_R is a successor of RHS in the back trace of RHS (phases 1 and 3). | |
959 | ||
960 | To catch this, we already fix up the level here where we can start at RHS | |
961 | instead of at BEST_R. We will ignore the level fixup when connecting | |
962 | BEST_L to BEST_R as they will already be on the same level. */ | |
eb8f2b9c | 963 | ftrace_fixup_level (btinfo, rhs, best_l->level - best_r->level); |
d87fdac3 | 964 | |
42bfe59e | 965 | ftrace_connect_backtrace (btinfo, best_l, best_r); |
d87fdac3 MM |
966 | |
967 | return best_matches; | |
968 | } | |
969 | ||
970 | /* Try to bridge gaps due to overflow or decode errors by connecting the | |
971 | function segments that are separated by the gap. */ | |
972 | ||
973 | static void | |
8ffd39f2 | 974 | btrace_bridge_gaps (struct thread_info *tp, std::vector<unsigned int> &gaps) |
d87fdac3 | 975 | { |
4aeb0dfc | 976 | struct btrace_thread_info *btinfo = &tp->btrace; |
8ffd39f2 | 977 | std::vector<unsigned int> remaining; |
d87fdac3 MM |
978 | int min_matches; |
979 | ||
980 | DEBUG ("bridge gaps"); | |
981 | ||
d87fdac3 MM |
982 | /* We require a minimum amount of matches for bridging a gap. The number of |
983 | required matches will be lowered with each iteration. | |
984 | ||
985 | The more matches the higher our confidence that the bridging is correct. | |
986 | For big gaps or small traces, however, it may not be feasible to require a | |
987 | high number of matches. */ | |
988 | for (min_matches = 5; min_matches > 0; --min_matches) | |
989 | { | |
990 | /* Let's try to bridge as many gaps as we can. In some cases, we need to | |
991 | skip a gap and revisit it again after we closed later gaps. */ | |
8ffd39f2 | 992 | while (!gaps.empty ()) |
d87fdac3 | 993 | { |
8ffd39f2 | 994 | for (const unsigned int number : gaps) |
d87fdac3 | 995 | { |
8ffd39f2 | 996 | struct btrace_function *gap, *lhs, *rhs; |
d87fdac3 MM |
997 | int bridged; |
998 | ||
8ffd39f2 TW |
999 | gap = ftrace_find_call_by_number (btinfo, number); |
1000 | ||
d87fdac3 MM |
1001 | /* We may have a sequence of gaps if we run from one error into |
1002 | the next as we try to re-sync onto the trace stream. Ignore | |
1003 | all but the leftmost gap in such a sequence. | |
1004 | ||
1005 | Also ignore gaps at the beginning of the trace. */ | |
eb8f2b9c | 1006 | lhs = ftrace_find_call_by_number (btinfo, gap->number - 1); |
d87fdac3 MM |
1007 | if (lhs == NULL || lhs->errcode != 0) |
1008 | continue; | |
1009 | ||
1010 | /* Skip gaps to the right. */ | |
eb8f2b9c TW |
1011 | rhs = ftrace_find_call_by_number (btinfo, gap->number + 1); |
1012 | while (rhs != NULL && rhs->errcode != 0) | |
1013 | rhs = ftrace_find_call_by_number (btinfo, rhs->number + 1); | |
d87fdac3 MM |
1014 | |
1015 | /* Ignore gaps at the end of the trace. */ | |
1016 | if (rhs == NULL) | |
1017 | continue; | |
1018 | ||
eb8f2b9c | 1019 | bridged = ftrace_bridge_gap (btinfo, lhs, rhs, min_matches); |
d87fdac3 MM |
1020 | |
1021 | /* Keep track of gaps we were not able to bridge and try again. | |
1022 | If we just pushed them to the end of GAPS we would risk an | |
1023 | infinite loop in case we simply cannot bridge a gap. */ | |
1024 | if (bridged == 0) | |
8ffd39f2 | 1025 | remaining.push_back (number); |
d87fdac3 MM |
1026 | } |
1027 | ||
1028 | /* Let's see if we made any progress. */ | |
8ffd39f2 | 1029 | if (remaining.size () == gaps.size ()) |
d87fdac3 MM |
1030 | break; |
1031 | ||
8ffd39f2 TW |
1032 | gaps.clear (); |
1033 | gaps.swap (remaining); | |
d87fdac3 MM |
1034 | } |
1035 | ||
1036 | /* We get here if either GAPS is empty or if GAPS equals REMAINING. */ | |
8ffd39f2 | 1037 | if (gaps.empty ()) |
d87fdac3 MM |
1038 | break; |
1039 | ||
8ffd39f2 | 1040 | remaining.clear (); |
d87fdac3 MM |
1041 | } |
1042 | ||
d87fdac3 MM |
1043 | /* We may omit this in some cases. Not sure it is worth the extra |
1044 | complication, though. */ | |
eb8f2b9c | 1045 | ftrace_compute_global_level_offset (btinfo); |
d87fdac3 MM |
1046 | } |
1047 | ||
734b0e4b | 1048 | /* Compute the function branch trace from BTS trace. */ |
23a7fe75 MM |
1049 | |
1050 | static void | |
76235df1 | 1051 | btrace_compute_ftrace_bts (struct thread_info *tp, |
d87fdac3 | 1052 | const struct btrace_data_bts *btrace, |
8ffd39f2 | 1053 | std::vector<unsigned int> &gaps) |
23a7fe75 | 1054 | { |
76235df1 | 1055 | struct btrace_thread_info *btinfo; |
23a7fe75 | 1056 | struct gdbarch *gdbarch; |
d87fdac3 | 1057 | unsigned int blk; |
23a7fe75 MM |
1058 | int level; |
1059 | ||
23a7fe75 | 1060 | gdbarch = target_gdbarch (); |
76235df1 | 1061 | btinfo = &tp->btrace; |
734b0e4b | 1062 | blk = VEC_length (btrace_block_s, btrace->blocks); |
23a7fe75 | 1063 | |
b54b03bd TW |
1064 | if (btinfo->functions.empty ()) |
1065 | level = INT_MAX; | |
1066 | else | |
1067 | level = -btinfo->level; | |
1068 | ||
23a7fe75 MM |
1069 | while (blk != 0) |
1070 | { | |
1071 | btrace_block_s *block; | |
1072 | CORE_ADDR pc; | |
1073 | ||
1074 | blk -= 1; | |
1075 | ||
734b0e4b | 1076 | block = VEC_index (btrace_block_s, btrace->blocks, blk); |
23a7fe75 MM |
1077 | pc = block->begin; |
1078 | ||
1079 | for (;;) | |
1080 | { | |
b54b03bd | 1081 | struct btrace_function *bfun; |
7d5c24b3 | 1082 | struct btrace_insn insn; |
23a7fe75 MM |
1083 | int size; |
1084 | ||
1085 | /* We should hit the end of the block. Warn if we went too far. */ | |
1086 | if (block->end < pc) | |
1087 | { | |
b61ce85c | 1088 | /* Indicate the gap in the trace. */ |
8ffd39f2 | 1089 | bfun = ftrace_new_gap (btinfo, BDE_BTS_OVERFLOW, gaps); |
b61ce85c MM |
1090 | |
1091 | warning (_("Recorded trace may be corrupted at instruction " | |
b54b03bd | 1092 | "%u (pc = %s)."), bfun->insn_offset - 1, |
b61ce85c | 1093 | core_addr_to_string_nz (pc)); |
63ab433e | 1094 | |
23a7fe75 MM |
1095 | break; |
1096 | } | |
1097 | ||
b54b03bd | 1098 | bfun = ftrace_update_function (btinfo, pc); |
23a7fe75 | 1099 | |
8710b709 MM |
1100 | /* Maintain the function level offset. |
1101 | For all but the last block, we do it here. */ | |
1102 | if (blk != 0) | |
b54b03bd | 1103 | level = std::min (level, bfun->level); |
23a7fe75 | 1104 | |
7d5c24b3 | 1105 | size = 0; |
a70b8144 | 1106 | try |
492d29ea PA |
1107 | { |
1108 | size = gdb_insn_length (gdbarch, pc); | |
1109 | } | |
230d2906 | 1110 | catch (const gdb_exception_error &error) |
492d29ea PA |
1111 | { |
1112 | } | |
7d5c24b3 MM |
1113 | |
1114 | insn.pc = pc; | |
1115 | insn.size = size; | |
1116 | insn.iclass = ftrace_classify_insn (gdbarch, pc); | |
da8c46d2 | 1117 | insn.flags = 0; |
7d5c24b3 | 1118 | |
0860c437 | 1119 | ftrace_update_insns (bfun, insn); |
23a7fe75 MM |
1120 | |
1121 | /* We're done once we pushed the instruction at the end. */ | |
1122 | if (block->end == pc) | |
1123 | break; | |
1124 | ||
7d5c24b3 | 1125 | /* We can't continue if we fail to compute the size. */ |
23a7fe75 MM |
1126 | if (size <= 0) |
1127 | { | |
31fd9caa MM |
1128 | /* Indicate the gap in the trace. We just added INSN so we're |
1129 | not at the beginning. */ | |
8ffd39f2 | 1130 | bfun = ftrace_new_gap (btinfo, BDE_BTS_INSN_SIZE, gaps); |
31fd9caa | 1131 | |
63ab433e | 1132 | warning (_("Recorded trace may be incomplete at instruction %u " |
b54b03bd | 1133 | "(pc = %s)."), bfun->insn_offset - 1, |
63ab433e MM |
1134 | core_addr_to_string_nz (pc)); |
1135 | ||
23a7fe75 MM |
1136 | break; |
1137 | } | |
1138 | ||
1139 | pc += size; | |
8710b709 MM |
1140 | |
1141 | /* Maintain the function level offset. | |
1142 | For the last block, we do it here to not consider the last | |
1143 | instruction. | |
1144 | Since the last instruction corresponds to the current instruction | |
1145 | and is not really part of the execution history, it shouldn't | |
1146 | affect the level. */ | |
1147 | if (blk == 0) | |
b54b03bd | 1148 | level = std::min (level, bfun->level); |
23a7fe75 | 1149 | } |
02d27625 MM |
1150 | } |
1151 | ||
23a7fe75 MM |
1152 | /* LEVEL is the minimal function level of all btrace function segments. |
1153 | Define the global level offset to -LEVEL so all function levels are | |
1154 | normalized to start at zero. */ | |
1155 | btinfo->level = -level; | |
02d27625 MM |
1156 | } |
1157 | ||
b20a6524 MM |
1158 | #if defined (HAVE_LIBIPT) |
1159 | ||
1160 | static enum btrace_insn_class | |
1161 | pt_reclassify_insn (enum pt_insn_class iclass) | |
1162 | { | |
1163 | switch (iclass) | |
1164 | { | |
1165 | case ptic_call: | |
1166 | return BTRACE_INSN_CALL; | |
1167 | ||
1168 | case ptic_return: | |
1169 | return BTRACE_INSN_RETURN; | |
1170 | ||
1171 | case ptic_jump: | |
1172 | return BTRACE_INSN_JUMP; | |
1173 | ||
1174 | default: | |
1175 | return BTRACE_INSN_OTHER; | |
1176 | } | |
1177 | } | |
1178 | ||
da8c46d2 MM |
1179 | /* Return the btrace instruction flags for INSN. */ |
1180 | ||
d7abe101 | 1181 | static btrace_insn_flags |
b5c36682 | 1182 | pt_btrace_insn_flags (const struct pt_insn &insn) |
da8c46d2 | 1183 | { |
d7abe101 | 1184 | btrace_insn_flags flags = 0; |
da8c46d2 | 1185 | |
b5c36682 | 1186 | if (insn.speculative) |
da8c46d2 MM |
1187 | flags |= BTRACE_INSN_FLAG_SPECULATIVE; |
1188 | ||
1189 | return flags; | |
1190 | } | |
1191 | ||
b5c36682 PA |
1192 | /* Return the btrace instruction for INSN. */ |
1193 | ||
1194 | static btrace_insn | |
1195 | pt_btrace_insn (const struct pt_insn &insn) | |
1196 | { | |
1197 | return {(CORE_ADDR) insn.ip, (gdb_byte) insn.size, | |
1198 | pt_reclassify_insn (insn.iclass), | |
1199 | pt_btrace_insn_flags (insn)}; | |
1200 | } | |
1201 | ||
13ace077 MM |
1202 | /* Handle instruction decode events (libipt-v2). */ |
1203 | ||
1204 | static int | |
1205 | handle_pt_insn_events (struct btrace_thread_info *btinfo, | |
1206 | struct pt_insn_decoder *decoder, | |
1207 | std::vector<unsigned int> &gaps, int status) | |
1208 | { | |
1209 | #if defined (HAVE_PT_INSN_EVENT) | |
1210 | while (status & pts_event_pending) | |
1211 | { | |
1212 | struct btrace_function *bfun; | |
1213 | struct pt_event event; | |
1214 | uint64_t offset; | |
1215 | ||
1216 | status = pt_insn_event (decoder, &event, sizeof (event)); | |
1217 | if (status < 0) | |
1218 | break; | |
1219 | ||
1220 | switch (event.type) | |
1221 | { | |
1222 | default: | |
1223 | break; | |
1224 | ||
1225 | case ptev_enabled: | |
1226 | if (event.variant.enabled.resumed == 0 && !btinfo->functions.empty ()) | |
1227 | { | |
1228 | bfun = ftrace_new_gap (btinfo, BDE_PT_DISABLED, gaps); | |
1229 | ||
1230 | pt_insn_get_offset (decoder, &offset); | |
1231 | ||
1232 | warning (_("Non-contiguous trace at instruction %u (offset = 0x%" | |
1233 | PRIx64 ")."), bfun->insn_offset - 1, offset); | |
1234 | } | |
1235 | ||
1236 | break; | |
1237 | ||
1238 | case ptev_overflow: | |
1239 | bfun = ftrace_new_gap (btinfo, BDE_PT_OVERFLOW, gaps); | |
1240 | ||
1241 | pt_insn_get_offset (decoder, &offset); | |
1242 | ||
1243 | warning (_("Overflow at instruction %u (offset = 0x%" PRIx64 ")."), | |
1244 | bfun->insn_offset - 1, offset); | |
1245 | ||
1246 | break; | |
1247 | } | |
1248 | } | |
1249 | #endif /* defined (HAVE_PT_INSN_EVENT) */ | |
1250 | ||
1251 | return status; | |
1252 | } | |
1253 | ||
1254 | /* Handle events indicated by flags in INSN (libipt-v1). */ | |
1255 | ||
1256 | static void | |
1257 | handle_pt_insn_event_flags (struct btrace_thread_info *btinfo, | |
1258 | struct pt_insn_decoder *decoder, | |
1259 | const struct pt_insn &insn, | |
1260 | std::vector<unsigned int> &gaps) | |
1261 | { | |
1262 | #if defined (HAVE_STRUCT_PT_INSN_ENABLED) | |
1263 | /* Tracing is disabled and re-enabled each time we enter the kernel. Most | |
1264 | times, we continue from the same instruction we stopped before. This is | |
1265 | indicated via the RESUMED instruction flag. The ENABLED instruction flag | |
1266 | means that we continued from some other instruction. Indicate this as a | |
1267 | trace gap except when tracing just started. */ | |
1268 | if (insn.enabled && !btinfo->functions.empty ()) | |
1269 | { | |
1270 | struct btrace_function *bfun; | |
1271 | uint64_t offset; | |
1272 | ||
1273 | bfun = ftrace_new_gap (btinfo, BDE_PT_DISABLED, gaps); | |
1274 | ||
1275 | pt_insn_get_offset (decoder, &offset); | |
1276 | ||
1277 | warning (_("Non-contiguous trace at instruction %u (offset = 0x%" PRIx64 | |
1278 | ", pc = 0x%" PRIx64 ")."), bfun->insn_offset - 1, offset, | |
1279 | insn.ip); | |
1280 | } | |
1281 | #endif /* defined (HAVE_STRUCT_PT_INSN_ENABLED) */ | |
1282 | ||
1283 | #if defined (HAVE_STRUCT_PT_INSN_RESYNCED) | |
1284 | /* Indicate trace overflows. */ | |
1285 | if (insn.resynced) | |
1286 | { | |
1287 | struct btrace_function *bfun; | |
1288 | uint64_t offset; | |
1289 | ||
1290 | bfun = ftrace_new_gap (btinfo, BDE_PT_OVERFLOW, gaps); | |
1291 | ||
1292 | pt_insn_get_offset (decoder, &offset); | |
1293 | ||
1294 | warning (_("Overflow at instruction %u (offset = 0x%" PRIx64 ", pc = 0x%" | |
1295 | PRIx64 ")."), bfun->insn_offset - 1, offset, insn.ip); | |
1296 | } | |
1297 | #endif /* defined (HAVE_STRUCT_PT_INSN_RESYNCED) */ | |
1298 | } | |
b5c36682 | 1299 | |
17b89b34 | 1300 | /* Add function branch trace to BTINFO using DECODER. */ |
b20a6524 MM |
1301 | |
1302 | static void | |
17b89b34 TW |
1303 | ftrace_add_pt (struct btrace_thread_info *btinfo, |
1304 | struct pt_insn_decoder *decoder, | |
b54b03bd | 1305 | int *plevel, |
8ffd39f2 | 1306 | std::vector<unsigned int> &gaps) |
b20a6524 | 1307 | { |
b54b03bd | 1308 | struct btrace_function *bfun; |
b20a6524 | 1309 | uint64_t offset; |
13ace077 | 1310 | int status; |
b20a6524 | 1311 | |
b20a6524 MM |
1312 | for (;;) |
1313 | { | |
b20a6524 MM |
1314 | struct pt_insn insn; |
1315 | ||
13ace077 MM |
1316 | status = pt_insn_sync_forward (decoder); |
1317 | if (status < 0) | |
b20a6524 | 1318 | { |
13ace077 | 1319 | if (status != -pte_eos) |
bc504a31 | 1320 | warning (_("Failed to synchronize onto the Intel Processor " |
13ace077 | 1321 | "Trace stream: %s."), pt_errstr (pt_errcode (status))); |
b20a6524 MM |
1322 | break; |
1323 | } | |
1324 | ||
b20a6524 MM |
1325 | for (;;) |
1326 | { | |
13ace077 MM |
1327 | /* Handle events from the previous iteration or synchronization. */ |
1328 | status = handle_pt_insn_events (btinfo, decoder, gaps, status); | |
1329 | if (status < 0) | |
b20a6524 MM |
1330 | break; |
1331 | ||
13ace077 MM |
1332 | status = pt_insn_next (decoder, &insn, sizeof(insn)); |
1333 | if (status < 0) | |
1334 | break; | |
b61ce85c | 1335 | |
13ace077 MM |
1336 | /* Handle events indicated by flags in INSN. */ |
1337 | handle_pt_insn_event_flags (btinfo, decoder, insn, gaps); | |
b20a6524 | 1338 | |
b54b03bd | 1339 | bfun = ftrace_update_function (btinfo, insn.ip); |
b20a6524 MM |
1340 | |
1341 | /* Maintain the function level offset. */ | |
b54b03bd | 1342 | *plevel = std::min (*plevel, bfun->level); |
b20a6524 | 1343 | |
7525b645 | 1344 | ftrace_update_insns (bfun, pt_btrace_insn (insn)); |
b20a6524 MM |
1345 | } |
1346 | ||
13ace077 | 1347 | if (status == -pte_eos) |
b20a6524 MM |
1348 | break; |
1349 | ||
b20a6524 | 1350 | /* Indicate the gap in the trace. */ |
13ace077 | 1351 | bfun = ftrace_new_gap (btinfo, status, gaps); |
b20a6524 | 1352 | |
63ab433e MM |
1353 | pt_insn_get_offset (decoder, &offset); |
1354 | ||
1355 | warning (_("Decode error (%d) at instruction %u (offset = 0x%" PRIx64 | |
13ace077 MM |
1356 | ", pc = 0x%" PRIx64 "): %s."), status, bfun->insn_offset - 1, |
1357 | offset, insn.ip, pt_errstr (pt_errcode (status))); | |
63ab433e | 1358 | } |
b20a6524 MM |
1359 | } |
1360 | ||
1361 | /* A callback function to allow the trace decoder to read the inferior's | |
1362 | memory. */ | |
1363 | ||
1364 | static int | |
1365 | btrace_pt_readmem_callback (gdb_byte *buffer, size_t size, | |
80a2b330 | 1366 | const struct pt_asid *asid, uint64_t pc, |
b20a6524 MM |
1367 | void *context) |
1368 | { | |
43368e1d | 1369 | int result, errcode; |
b20a6524 | 1370 | |
43368e1d | 1371 | result = (int) size; |
a70b8144 | 1372 | try |
b20a6524 | 1373 | { |
80a2b330 | 1374 | errcode = target_read_code ((CORE_ADDR) pc, buffer, size); |
b20a6524 | 1375 | if (errcode != 0) |
43368e1d | 1376 | result = -pte_nomap; |
b20a6524 | 1377 | } |
230d2906 | 1378 | catch (const gdb_exception_error &error) |
b20a6524 | 1379 | { |
43368e1d | 1380 | result = -pte_nomap; |
b20a6524 | 1381 | } |
b20a6524 | 1382 | |
43368e1d | 1383 | return result; |
b20a6524 MM |
1384 | } |
1385 | ||
1386 | /* Translate the vendor from one enum to another. */ | |
1387 | ||
1388 | static enum pt_cpu_vendor | |
1389 | pt_translate_cpu_vendor (enum btrace_cpu_vendor vendor) | |
1390 | { | |
1391 | switch (vendor) | |
1392 | { | |
1393 | default: | |
1394 | return pcv_unknown; | |
1395 | ||
1396 | case CV_INTEL: | |
1397 | return pcv_intel; | |
1398 | } | |
1399 | } | |
1400 | ||
1401 | /* Finalize the function branch trace after decode. */ | |
1402 | ||
1403 | static void btrace_finalize_ftrace_pt (struct pt_insn_decoder *decoder, | |
1404 | struct thread_info *tp, int level) | |
1405 | { | |
1406 | pt_insn_free_decoder (decoder); | |
1407 | ||
1408 | /* LEVEL is the minimal function level of all btrace function segments. | |
1409 | Define the global level offset to -LEVEL so all function levels are | |
1410 | normalized to start at zero. */ | |
1411 | tp->btrace.level = -level; | |
1412 | ||
1413 | /* Add a single last instruction entry for the current PC. | |
1414 | This allows us to compute the backtrace at the current PC using both | |
1415 | standard unwind and btrace unwind. | |
1416 | This extra entry is ignored by all record commands. */ | |
1417 | btrace_add_pc (tp); | |
1418 | } | |
1419 | ||
bc504a31 PA |
1420 | /* Compute the function branch trace from Intel Processor Trace |
1421 | format. */ | |
b20a6524 MM |
1422 | |
1423 | static void | |
1424 | btrace_compute_ftrace_pt (struct thread_info *tp, | |
d87fdac3 | 1425 | const struct btrace_data_pt *btrace, |
8ffd39f2 | 1426 | std::vector<unsigned int> &gaps) |
b20a6524 MM |
1427 | { |
1428 | struct btrace_thread_info *btinfo; | |
1429 | struct pt_insn_decoder *decoder; | |
1430 | struct pt_config config; | |
1431 | int level, errcode; | |
1432 | ||
1433 | if (btrace->size == 0) | |
1434 | return; | |
1435 | ||
1436 | btinfo = &tp->btrace; | |
b54b03bd TW |
1437 | if (btinfo->functions.empty ()) |
1438 | level = INT_MAX; | |
1439 | else | |
1440 | level = -btinfo->level; | |
b20a6524 MM |
1441 | |
1442 | pt_config_init(&config); | |
1443 | config.begin = btrace->data; | |
1444 | config.end = btrace->data + btrace->size; | |
1445 | ||
4a4495d6 MM |
1446 | /* We treat an unknown vendor as 'no errata'. */ |
1447 | if (btrace->config.cpu.vendor != CV_UNKNOWN) | |
1448 | { | |
1449 | config.cpu.vendor | |
1450 | = pt_translate_cpu_vendor (btrace->config.cpu.vendor); | |
1451 | config.cpu.family = btrace->config.cpu.family; | |
1452 | config.cpu.model = btrace->config.cpu.model; | |
1453 | config.cpu.stepping = btrace->config.cpu.stepping; | |
b20a6524 | 1454 | |
4a4495d6 MM |
1455 | errcode = pt_cpu_errata (&config.errata, &config.cpu); |
1456 | if (errcode < 0) | |
1457 | error (_("Failed to configure the Intel Processor Trace " | |
1458 | "decoder: %s."), pt_errstr (pt_errcode (errcode))); | |
1459 | } | |
b20a6524 MM |
1460 | |
1461 | decoder = pt_insn_alloc_decoder (&config); | |
1462 | if (decoder == NULL) | |
bc504a31 | 1463 | error (_("Failed to allocate the Intel Processor Trace decoder.")); |
b20a6524 | 1464 | |
a70b8144 | 1465 | try |
b20a6524 MM |
1466 | { |
1467 | struct pt_image *image; | |
1468 | ||
1469 | image = pt_insn_get_image(decoder); | |
1470 | if (image == NULL) | |
bc504a31 | 1471 | error (_("Failed to configure the Intel Processor Trace decoder.")); |
b20a6524 MM |
1472 | |
1473 | errcode = pt_image_set_callback(image, btrace_pt_readmem_callback, NULL); | |
1474 | if (errcode < 0) | |
bc504a31 | 1475 | error (_("Failed to configure the Intel Processor Trace decoder: " |
b20a6524 MM |
1476 | "%s."), pt_errstr (pt_errcode (errcode))); |
1477 | ||
b54b03bd | 1478 | ftrace_add_pt (btinfo, decoder, &level, gaps); |
b20a6524 | 1479 | } |
230d2906 | 1480 | catch (const gdb_exception &error) |
b20a6524 MM |
1481 | { |
1482 | /* Indicate a gap in the trace if we quit trace processing. */ | |
b54b03bd | 1483 | if (error.reason == RETURN_QUIT && !btinfo->functions.empty ()) |
8ffd39f2 | 1484 | ftrace_new_gap (btinfo, BDE_PT_USER_QUIT, gaps); |
b20a6524 MM |
1485 | |
1486 | btrace_finalize_ftrace_pt (decoder, tp, level); | |
1487 | ||
eedc3f4f | 1488 | throw; |
b20a6524 | 1489 | } |
b20a6524 MM |
1490 | |
1491 | btrace_finalize_ftrace_pt (decoder, tp, level); | |
1492 | } | |
1493 | ||
1494 | #else /* defined (HAVE_LIBIPT) */ | |
1495 | ||
1496 | static void | |
1497 | btrace_compute_ftrace_pt (struct thread_info *tp, | |
d87fdac3 | 1498 | const struct btrace_data_pt *btrace, |
8ffd39f2 | 1499 | std::vector<unsigned int> &gaps) |
b20a6524 MM |
1500 | { |
1501 | internal_error (__FILE__, __LINE__, _("Unexpected branch trace format.")); | |
1502 | } | |
1503 | ||
1504 | #endif /* defined (HAVE_LIBIPT) */ | |
1505 | ||
734b0e4b | 1506 | /* Compute the function branch trace from a block branch trace BTRACE for |
4a4495d6 MM |
1507 | a thread given by BTINFO. If CPU is not NULL, overwrite the cpu in the |
1508 | branch trace configuration. This is currently only used for the PT | |
1509 | format. */ | |
734b0e4b MM |
1510 | |
1511 | static void | |
4a4495d6 MM |
1512 | btrace_compute_ftrace_1 (struct thread_info *tp, |
1513 | struct btrace_data *btrace, | |
1514 | const struct btrace_cpu *cpu, | |
8ffd39f2 | 1515 | std::vector<unsigned int> &gaps) |
734b0e4b MM |
1516 | { |
1517 | DEBUG ("compute ftrace"); | |
1518 | ||
1519 | switch (btrace->format) | |
1520 | { | |
1521 | case BTRACE_FORMAT_NONE: | |
1522 | return; | |
1523 | ||
1524 | case BTRACE_FORMAT_BTS: | |
d87fdac3 | 1525 | btrace_compute_ftrace_bts (tp, &btrace->variant.bts, gaps); |
734b0e4b | 1526 | return; |
b20a6524 MM |
1527 | |
1528 | case BTRACE_FORMAT_PT: | |
4a4495d6 MM |
1529 | /* Overwrite the cpu we use for enabling errata workarounds. */ |
1530 | if (cpu != nullptr) | |
1531 | btrace->variant.pt.config.cpu = *cpu; | |
1532 | ||
d87fdac3 | 1533 | btrace_compute_ftrace_pt (tp, &btrace->variant.pt, gaps); |
b20a6524 | 1534 | return; |
734b0e4b MM |
1535 | } |
1536 | ||
1537 | internal_error (__FILE__, __LINE__, _("Unkown branch trace format.")); | |
1538 | } | |
1539 | ||
d87fdac3 | 1540 | static void |
8ffd39f2 | 1541 | btrace_finalize_ftrace (struct thread_info *tp, std::vector<unsigned int> &gaps) |
d87fdac3 | 1542 | { |
8ffd39f2 | 1543 | if (!gaps.empty ()) |
d87fdac3 | 1544 | { |
8ffd39f2 | 1545 | tp->btrace.ngaps += gaps.size (); |
d87fdac3 MM |
1546 | btrace_bridge_gaps (tp, gaps); |
1547 | } | |
1548 | } | |
1549 | ||
1550 | static void | |
4a4495d6 MM |
1551 | btrace_compute_ftrace (struct thread_info *tp, struct btrace_data *btrace, |
1552 | const struct btrace_cpu *cpu) | |
d87fdac3 | 1553 | { |
8ffd39f2 | 1554 | std::vector<unsigned int> gaps; |
d87fdac3 | 1555 | |
a70b8144 | 1556 | try |
d87fdac3 | 1557 | { |
4a4495d6 | 1558 | btrace_compute_ftrace_1 (tp, btrace, cpu, gaps); |
d87fdac3 | 1559 | } |
230d2906 | 1560 | catch (const gdb_exception &error) |
d87fdac3 | 1561 | { |
8ffd39f2 | 1562 | btrace_finalize_ftrace (tp, gaps); |
d87fdac3 | 1563 | |
eedc3f4f | 1564 | throw; |
d87fdac3 | 1565 | } |
d87fdac3 | 1566 | |
8ffd39f2 | 1567 | btrace_finalize_ftrace (tp, gaps); |
d87fdac3 MM |
1568 | } |
1569 | ||
6e07b1d2 MM |
1570 | /* Add an entry for the current PC. */ |
1571 | ||
1572 | static void | |
1573 | btrace_add_pc (struct thread_info *tp) | |
1574 | { | |
734b0e4b | 1575 | struct btrace_data btrace; |
6e07b1d2 MM |
1576 | struct btrace_block *block; |
1577 | struct regcache *regcache; | |
6e07b1d2 MM |
1578 | CORE_ADDR pc; |
1579 | ||
00431a78 | 1580 | regcache = get_thread_regcache (tp); |
6e07b1d2 MM |
1581 | pc = regcache_read_pc (regcache); |
1582 | ||
734b0e4b MM |
1583 | btrace.format = BTRACE_FORMAT_BTS; |
1584 | btrace.variant.bts.blocks = NULL; | |
6e07b1d2 | 1585 | |
734b0e4b | 1586 | block = VEC_safe_push (btrace_block_s, btrace.variant.bts.blocks, NULL); |
6e07b1d2 MM |
1587 | block->begin = pc; |
1588 | block->end = pc; | |
1589 | ||
4a4495d6 | 1590 | btrace_compute_ftrace (tp, &btrace, NULL); |
6e07b1d2 MM |
1591 | } |
1592 | ||
02d27625 MM |
1593 | /* See btrace.h. */ |
1594 | ||
1595 | void | |
f4abbc16 | 1596 | btrace_enable (struct thread_info *tp, const struct btrace_config *conf) |
02d27625 MM |
1597 | { |
1598 | if (tp->btrace.target != NULL) | |
1599 | return; | |
1600 | ||
46a3515b MM |
1601 | #if !defined (HAVE_LIBIPT) |
1602 | if (conf->format == BTRACE_FORMAT_PT) | |
c4e12631 | 1603 | error (_("Intel Processor Trace support was disabled at compile time.")); |
46a3515b MM |
1604 | #endif /* !defined (HAVE_LIBIPT) */ |
1605 | ||
43792cf0 | 1606 | DEBUG ("enable thread %s (%s)", print_thread_id (tp), |
a068643d | 1607 | target_pid_to_str (tp->ptid).c_str ()); |
02d27625 | 1608 | |
f4abbc16 | 1609 | tp->btrace.target = target_enable_btrace (tp->ptid, conf); |
6e07b1d2 | 1610 | |
cd4007e4 MM |
1611 | /* We're done if we failed to enable tracing. */ |
1612 | if (tp->btrace.target == NULL) | |
1613 | return; | |
1614 | ||
1615 | /* We need to undo the enable in case of errors. */ | |
a70b8144 | 1616 | try |
cd4007e4 MM |
1617 | { |
1618 | /* Add an entry for the current PC so we start tracing from where we | |
1619 | enabled it. | |
1620 | ||
1621 | If we can't access TP's registers, TP is most likely running. In this | |
1622 | case, we can't really say where tracing was enabled so it should be | |
1623 | safe to simply skip this step. | |
1624 | ||
1625 | This is not relevant for BTRACE_FORMAT_PT since the trace will already | |
1626 | start at the PC at which tracing was enabled. */ | |
1627 | if (conf->format != BTRACE_FORMAT_PT | |
00431a78 | 1628 | && can_access_registers_thread (tp)) |
cd4007e4 MM |
1629 | btrace_add_pc (tp); |
1630 | } | |
230d2906 | 1631 | catch (const gdb_exception &exception) |
cd4007e4 MM |
1632 | { |
1633 | btrace_disable (tp); | |
1634 | ||
eedc3f4f | 1635 | throw; |
cd4007e4 | 1636 | } |
02d27625 MM |
1637 | } |
1638 | ||
1639 | /* See btrace.h. */ | |
1640 | ||
f4abbc16 MM |
1641 | const struct btrace_config * |
1642 | btrace_conf (const struct btrace_thread_info *btinfo) | |
1643 | { | |
1644 | if (btinfo->target == NULL) | |
1645 | return NULL; | |
1646 | ||
1647 | return target_btrace_conf (btinfo->target); | |
1648 | } | |
1649 | ||
1650 | /* See btrace.h. */ | |
1651 | ||
02d27625 MM |
1652 | void |
1653 | btrace_disable (struct thread_info *tp) | |
1654 | { | |
1655 | struct btrace_thread_info *btp = &tp->btrace; | |
02d27625 MM |
1656 | |
1657 | if (btp->target == NULL) | |
1658 | return; | |
1659 | ||
43792cf0 | 1660 | DEBUG ("disable thread %s (%s)", print_thread_id (tp), |
a068643d | 1661 | target_pid_to_str (tp->ptid).c_str ()); |
02d27625 MM |
1662 | |
1663 | target_disable_btrace (btp->target); | |
1664 | btp->target = NULL; | |
1665 | ||
1666 | btrace_clear (tp); | |
1667 | } | |
1668 | ||
1669 | /* See btrace.h. */ | |
1670 | ||
1671 | void | |
1672 | btrace_teardown (struct thread_info *tp) | |
1673 | { | |
1674 | struct btrace_thread_info *btp = &tp->btrace; | |
02d27625 MM |
1675 | |
1676 | if (btp->target == NULL) | |
1677 | return; | |
1678 | ||
43792cf0 | 1679 | DEBUG ("teardown thread %s (%s)", print_thread_id (tp), |
a068643d | 1680 | target_pid_to_str (tp->ptid).c_str ()); |
02d27625 MM |
1681 | |
1682 | target_teardown_btrace (btp->target); | |
1683 | btp->target = NULL; | |
1684 | ||
1685 | btrace_clear (tp); | |
1686 | } | |
1687 | ||
734b0e4b | 1688 | /* Stitch branch trace in BTS format. */ |
969c39fb MM |
1689 | |
1690 | static int | |
31fd9caa | 1691 | btrace_stitch_bts (struct btrace_data_bts *btrace, struct thread_info *tp) |
969c39fb | 1692 | { |
31fd9caa | 1693 | struct btrace_thread_info *btinfo; |
969c39fb | 1694 | struct btrace_function *last_bfun; |
969c39fb MM |
1695 | btrace_block_s *first_new_block; |
1696 | ||
31fd9caa | 1697 | btinfo = &tp->btrace; |
b54b03bd | 1698 | gdb_assert (!btinfo->functions.empty ()); |
31fd9caa MM |
1699 | gdb_assert (!VEC_empty (btrace_block_s, btrace->blocks)); |
1700 | ||
08c3f6d2 | 1701 | last_bfun = &btinfo->functions.back (); |
b54b03bd | 1702 | |
31fd9caa MM |
1703 | /* If the existing trace ends with a gap, we just glue the traces |
1704 | together. We need to drop the last (i.e. chronologically first) block | |
1705 | of the new trace, though, since we can't fill in the start address.*/ | |
0860c437 | 1706 | if (last_bfun->insn.empty ()) |
31fd9caa MM |
1707 | { |
1708 | VEC_pop (btrace_block_s, btrace->blocks); | |
1709 | return 0; | |
1710 | } | |
969c39fb MM |
1711 | |
1712 | /* Beware that block trace starts with the most recent block, so the | |
1713 | chronologically first block in the new trace is the last block in | |
1714 | the new trace's block vector. */ | |
734b0e4b | 1715 | first_new_block = VEC_last (btrace_block_s, btrace->blocks); |
0860c437 | 1716 | const btrace_insn &last_insn = last_bfun->insn.back (); |
969c39fb MM |
1717 | |
1718 | /* If the current PC at the end of the block is the same as in our current | |
1719 | trace, there are two explanations: | |
1720 | 1. we executed the instruction and some branch brought us back. | |
1721 | 2. we have not made any progress. | |
1722 | In the first case, the delta trace vector should contain at least two | |
1723 | entries. | |
1724 | In the second case, the delta trace vector should contain exactly one | |
1725 | entry for the partial block containing the current PC. Remove it. */ | |
0860c437 | 1726 | if (first_new_block->end == last_insn.pc |
734b0e4b | 1727 | && VEC_length (btrace_block_s, btrace->blocks) == 1) |
969c39fb | 1728 | { |
734b0e4b | 1729 | VEC_pop (btrace_block_s, btrace->blocks); |
969c39fb MM |
1730 | return 0; |
1731 | } | |
1732 | ||
0860c437 | 1733 | DEBUG ("stitching %s to %s", ftrace_print_insn_addr (&last_insn), |
969c39fb MM |
1734 | core_addr_to_string_nz (first_new_block->end)); |
1735 | ||
1736 | /* Do a simple sanity check to make sure we don't accidentally end up | |
1737 | with a bad block. This should not occur in practice. */ | |
0860c437 | 1738 | if (first_new_block->end < last_insn.pc) |
969c39fb MM |
1739 | { |
1740 | warning (_("Error while trying to read delta trace. Falling back to " | |
1741 | "a full read.")); | |
1742 | return -1; | |
1743 | } | |
1744 | ||
1745 | /* We adjust the last block to start at the end of our current trace. */ | |
1746 | gdb_assert (first_new_block->begin == 0); | |
0860c437 | 1747 | first_new_block->begin = last_insn.pc; |
969c39fb MM |
1748 | |
1749 | /* We simply pop the last insn so we can insert it again as part of | |
1750 | the normal branch trace computation. | |
1751 | Since instruction iterators are based on indices in the instructions | |
1752 | vector, we don't leave any pointers dangling. */ | |
1753 | DEBUG ("pruning insn at %s for stitching", | |
0860c437 | 1754 | ftrace_print_insn_addr (&last_insn)); |
969c39fb | 1755 | |
0860c437 | 1756 | last_bfun->insn.pop_back (); |
969c39fb MM |
1757 | |
1758 | /* The instructions vector may become empty temporarily if this has | |
1759 | been the only instruction in this function segment. | |
1760 | This violates the invariant but will be remedied shortly by | |
1761 | btrace_compute_ftrace when we add the new trace. */ | |
31fd9caa MM |
1762 | |
1763 | /* The only case where this would hurt is if the entire trace consisted | |
1764 | of just that one instruction. If we remove it, we might turn the now | |
1765 | empty btrace function segment into a gap. But we don't want gaps at | |
1766 | the beginning. To avoid this, we remove the entire old trace. */ | |
0860c437 | 1767 | if (last_bfun->number == 1 && last_bfun->insn.empty ()) |
31fd9caa MM |
1768 | btrace_clear (tp); |
1769 | ||
969c39fb MM |
1770 | return 0; |
1771 | } | |
1772 | ||
734b0e4b MM |
1773 | /* Adjust the block trace in order to stitch old and new trace together. |
1774 | BTRACE is the new delta trace between the last and the current stop. | |
31fd9caa MM |
1775 | TP is the traced thread. |
1776 | May modifx BTRACE as well as the existing trace in TP. | |
734b0e4b MM |
1777 | Return 0 on success, -1 otherwise. */ |
1778 | ||
1779 | static int | |
31fd9caa | 1780 | btrace_stitch_trace (struct btrace_data *btrace, struct thread_info *tp) |
734b0e4b MM |
1781 | { |
1782 | /* If we don't have trace, there's nothing to do. */ | |
8dcc53b3 | 1783 | if (btrace->empty ()) |
734b0e4b MM |
1784 | return 0; |
1785 | ||
1786 | switch (btrace->format) | |
1787 | { | |
1788 | case BTRACE_FORMAT_NONE: | |
1789 | return 0; | |
1790 | ||
1791 | case BTRACE_FORMAT_BTS: | |
31fd9caa | 1792 | return btrace_stitch_bts (&btrace->variant.bts, tp); |
b20a6524 MM |
1793 | |
1794 | case BTRACE_FORMAT_PT: | |
1795 | /* Delta reads are not supported. */ | |
1796 | return -1; | |
734b0e4b MM |
1797 | } |
1798 | ||
1799 | internal_error (__FILE__, __LINE__, _("Unkown branch trace format.")); | |
1800 | } | |
1801 | ||
969c39fb MM |
1802 | /* Clear the branch trace histories in BTINFO. */ |
1803 | ||
1804 | static void | |
1805 | btrace_clear_history (struct btrace_thread_info *btinfo) | |
1806 | { | |
1807 | xfree (btinfo->insn_history); | |
1808 | xfree (btinfo->call_history); | |
1809 | xfree (btinfo->replay); | |
1810 | ||
1811 | btinfo->insn_history = NULL; | |
1812 | btinfo->call_history = NULL; | |
1813 | btinfo->replay = NULL; | |
1814 | } | |
1815 | ||
b0627500 MM |
1816 | /* Clear the branch trace maintenance histories in BTINFO. */ |
1817 | ||
1818 | static void | |
1819 | btrace_maint_clear (struct btrace_thread_info *btinfo) | |
1820 | { | |
1821 | switch (btinfo->data.format) | |
1822 | { | |
1823 | default: | |
1824 | break; | |
1825 | ||
1826 | case BTRACE_FORMAT_BTS: | |
1827 | btinfo->maint.variant.bts.packet_history.begin = 0; | |
1828 | btinfo->maint.variant.bts.packet_history.end = 0; | |
1829 | break; | |
1830 | ||
1831 | #if defined (HAVE_LIBIPT) | |
1832 | case BTRACE_FORMAT_PT: | |
1833 | xfree (btinfo->maint.variant.pt.packets); | |
1834 | ||
1835 | btinfo->maint.variant.pt.packets = NULL; | |
1836 | btinfo->maint.variant.pt.packet_history.begin = 0; | |
1837 | btinfo->maint.variant.pt.packet_history.end = 0; | |
1838 | break; | |
1839 | #endif /* defined (HAVE_LIBIPT) */ | |
1840 | } | |
1841 | } | |
1842 | ||
02d27625 MM |
1843 | /* See btrace.h. */ |
1844 | ||
508352a9 TW |
1845 | const char * |
1846 | btrace_decode_error (enum btrace_format format, int errcode) | |
1847 | { | |
1848 | switch (format) | |
1849 | { | |
1850 | case BTRACE_FORMAT_BTS: | |
1851 | switch (errcode) | |
1852 | { | |
1853 | case BDE_BTS_OVERFLOW: | |
1854 | return _("instruction overflow"); | |
1855 | ||
1856 | case BDE_BTS_INSN_SIZE: | |
1857 | return _("unknown instruction"); | |
1858 | ||
1859 | default: | |
1860 | break; | |
1861 | } | |
1862 | break; | |
1863 | ||
1864 | #if defined (HAVE_LIBIPT) | |
1865 | case BTRACE_FORMAT_PT: | |
1866 | switch (errcode) | |
1867 | { | |
1868 | case BDE_PT_USER_QUIT: | |
1869 | return _("trace decode cancelled"); | |
1870 | ||
1871 | case BDE_PT_DISABLED: | |
1872 | return _("disabled"); | |
1873 | ||
1874 | case BDE_PT_OVERFLOW: | |
1875 | return _("overflow"); | |
1876 | ||
1877 | default: | |
1878 | if (errcode < 0) | |
1879 | return pt_errstr (pt_errcode (errcode)); | |
1880 | break; | |
1881 | } | |
1882 | break; | |
1883 | #endif /* defined (HAVE_LIBIPT) */ | |
1884 | ||
1885 | default: | |
1886 | break; | |
1887 | } | |
1888 | ||
1889 | return _("unknown"); | |
1890 | } | |
1891 | ||
1892 | /* See btrace.h. */ | |
1893 | ||
02d27625 | 1894 | void |
4a4495d6 | 1895 | btrace_fetch (struct thread_info *tp, const struct btrace_cpu *cpu) |
02d27625 MM |
1896 | { |
1897 | struct btrace_thread_info *btinfo; | |
969c39fb | 1898 | struct btrace_target_info *tinfo; |
734b0e4b | 1899 | struct btrace_data btrace; |
969c39fb | 1900 | int errcode; |
02d27625 | 1901 | |
43792cf0 | 1902 | DEBUG ("fetch thread %s (%s)", print_thread_id (tp), |
a068643d | 1903 | target_pid_to_str (tp->ptid).c_str ()); |
02d27625 MM |
1904 | |
1905 | btinfo = &tp->btrace; | |
969c39fb MM |
1906 | tinfo = btinfo->target; |
1907 | if (tinfo == NULL) | |
1908 | return; | |
1909 | ||
1910 | /* There's no way we could get new trace while replaying. | |
1911 | On the other hand, delta trace would return a partial record with the | |
1912 | current PC, which is the replay PC, not the last PC, as expected. */ | |
1913 | if (btinfo->replay != NULL) | |
02d27625 MM |
1914 | return; |
1915 | ||
ae20e79a TW |
1916 | /* With CLI usage, TP->PTID always equals INFERIOR_PTID here. Now that we |
1917 | can store a gdb.Record object in Python referring to a different thread | |
1918 | than the current one, temporarily set INFERIOR_PTID. */ | |
2989a365 | 1919 | scoped_restore save_inferior_ptid = make_scoped_restore (&inferior_ptid); |
ae20e79a TW |
1920 | inferior_ptid = tp->ptid; |
1921 | ||
cd4007e4 | 1922 | /* We should not be called on running or exited threads. */ |
00431a78 | 1923 | gdb_assert (can_access_registers_thread (tp)); |
cd4007e4 | 1924 | |
969c39fb | 1925 | /* Let's first try to extend the trace we already have. */ |
b54b03bd | 1926 | if (!btinfo->functions.empty ()) |
969c39fb MM |
1927 | { |
1928 | errcode = target_read_btrace (&btrace, tinfo, BTRACE_READ_DELTA); | |
1929 | if (errcode == 0) | |
1930 | { | |
1931 | /* Success. Let's try to stitch the traces together. */ | |
31fd9caa | 1932 | errcode = btrace_stitch_trace (&btrace, tp); |
969c39fb MM |
1933 | } |
1934 | else | |
1935 | { | |
1936 | /* We failed to read delta trace. Let's try to read new trace. */ | |
1937 | errcode = target_read_btrace (&btrace, tinfo, BTRACE_READ_NEW); | |
1938 | ||
1939 | /* If we got any new trace, discard what we have. */ | |
8dcc53b3 | 1940 | if (errcode == 0 && !btrace.empty ()) |
969c39fb MM |
1941 | btrace_clear (tp); |
1942 | } | |
1943 | ||
1944 | /* If we were not able to read the trace, we start over. */ | |
1945 | if (errcode != 0) | |
1946 | { | |
1947 | btrace_clear (tp); | |
1948 | errcode = target_read_btrace (&btrace, tinfo, BTRACE_READ_ALL); | |
1949 | } | |
1950 | } | |
1951 | else | |
1952 | errcode = target_read_btrace (&btrace, tinfo, BTRACE_READ_ALL); | |
1953 | ||
1954 | /* If we were not able to read the branch trace, signal an error. */ | |
1955 | if (errcode != 0) | |
1956 | error (_("Failed to read branch trace.")); | |
1957 | ||
1958 | /* Compute the trace, provided we have any. */ | |
8dcc53b3 | 1959 | if (!btrace.empty ()) |
23a7fe75 | 1960 | { |
9be54cae MM |
1961 | /* Store the raw trace data. The stored data will be cleared in |
1962 | btrace_clear, so we always append the new trace. */ | |
1963 | btrace_data_append (&btinfo->data, &btrace); | |
b0627500 | 1964 | btrace_maint_clear (btinfo); |
9be54cae | 1965 | |
969c39fb | 1966 | btrace_clear_history (btinfo); |
4a4495d6 | 1967 | btrace_compute_ftrace (tp, &btrace, cpu); |
23a7fe75 | 1968 | } |
02d27625 MM |
1969 | } |
1970 | ||
1971 | /* See btrace.h. */ | |
1972 | ||
1973 | void | |
1974 | btrace_clear (struct thread_info *tp) | |
1975 | { | |
1976 | struct btrace_thread_info *btinfo; | |
1977 | ||
43792cf0 | 1978 | DEBUG ("clear thread %s (%s)", print_thread_id (tp), |
a068643d | 1979 | target_pid_to_str (tp->ptid).c_str ()); |
02d27625 | 1980 | |
0b722aec MM |
1981 | /* Make sure btrace frames that may hold a pointer into the branch |
1982 | trace data are destroyed. */ | |
1983 | reinit_frame_cache (); | |
1984 | ||
02d27625 | 1985 | btinfo = &tp->btrace; |
23a7fe75 | 1986 | |
17b89b34 | 1987 | btinfo->functions.clear (); |
31fd9caa | 1988 | btinfo->ngaps = 0; |
23a7fe75 | 1989 | |
b0627500 MM |
1990 | /* Must clear the maint data before - it depends on BTINFO->DATA. */ |
1991 | btrace_maint_clear (btinfo); | |
8dcc53b3 | 1992 | btinfo->data.clear (); |
969c39fb | 1993 | btrace_clear_history (btinfo); |
02d27625 MM |
1994 | } |
1995 | ||
1996 | /* See btrace.h. */ | |
1997 | ||
1998 | void | |
1999 | btrace_free_objfile (struct objfile *objfile) | |
2000 | { | |
02d27625 MM |
2001 | DEBUG ("free objfile"); |
2002 | ||
08036331 | 2003 | for (thread_info *tp : all_non_exited_threads ()) |
02d27625 MM |
2004 | btrace_clear (tp); |
2005 | } | |
c12a2917 MM |
2006 | |
2007 | #if defined (HAVE_LIBEXPAT) | |
2008 | ||
2009 | /* Check the btrace document version. */ | |
2010 | ||
2011 | static void | |
2012 | check_xml_btrace_version (struct gdb_xml_parser *parser, | |
2013 | const struct gdb_xml_element *element, | |
4d0fdd9b SM |
2014 | void *user_data, |
2015 | std::vector<gdb_xml_value> &attributes) | |
c12a2917 | 2016 | { |
9a3c8263 | 2017 | const char *version |
4d0fdd9b | 2018 | = (const char *) xml_find_attribute (attributes, "version")->value.get (); |
c12a2917 MM |
2019 | |
2020 | if (strcmp (version, "1.0") != 0) | |
2021 | gdb_xml_error (parser, _("Unsupported btrace version: \"%s\""), version); | |
2022 | } | |
2023 | ||
2024 | /* Parse a btrace "block" xml record. */ | |
2025 | ||
2026 | static void | |
2027 | parse_xml_btrace_block (struct gdb_xml_parser *parser, | |
2028 | const struct gdb_xml_element *element, | |
4d0fdd9b SM |
2029 | void *user_data, |
2030 | std::vector<gdb_xml_value> &attributes) | |
c12a2917 | 2031 | { |
734b0e4b | 2032 | struct btrace_data *btrace; |
c12a2917 MM |
2033 | struct btrace_block *block; |
2034 | ULONGEST *begin, *end; | |
2035 | ||
9a3c8263 | 2036 | btrace = (struct btrace_data *) user_data; |
734b0e4b MM |
2037 | |
2038 | switch (btrace->format) | |
2039 | { | |
2040 | case BTRACE_FORMAT_BTS: | |
2041 | break; | |
2042 | ||
2043 | case BTRACE_FORMAT_NONE: | |
2044 | btrace->format = BTRACE_FORMAT_BTS; | |
2045 | btrace->variant.bts.blocks = NULL; | |
2046 | break; | |
2047 | ||
2048 | default: | |
2049 | gdb_xml_error (parser, _("Btrace format error.")); | |
2050 | } | |
c12a2917 | 2051 | |
4d0fdd9b SM |
2052 | begin = (ULONGEST *) xml_find_attribute (attributes, "begin")->value.get (); |
2053 | end = (ULONGEST *) xml_find_attribute (attributes, "end")->value.get (); | |
c12a2917 | 2054 | |
734b0e4b | 2055 | block = VEC_safe_push (btrace_block_s, btrace->variant.bts.blocks, NULL); |
c12a2917 MM |
2056 | block->begin = *begin; |
2057 | block->end = *end; | |
2058 | } | |
2059 | ||
b20a6524 MM |
2060 | /* Parse a "raw" xml record. */ |
2061 | ||
2062 | static void | |
2063 | parse_xml_raw (struct gdb_xml_parser *parser, const char *body_text, | |
e7b01ce0 | 2064 | gdb_byte **pdata, size_t *psize) |
b20a6524 | 2065 | { |
343b0027 | 2066 | gdb_byte *bin; |
e7b01ce0 | 2067 | size_t len, size; |
b20a6524 MM |
2068 | |
2069 | len = strlen (body_text); | |
e7b01ce0 | 2070 | if (len % 2 != 0) |
b20a6524 MM |
2071 | gdb_xml_error (parser, _("Bad raw data size.")); |
2072 | ||
e7b01ce0 MM |
2073 | size = len / 2; |
2074 | ||
343b0027 TT |
2075 | gdb::unique_xmalloc_ptr<gdb_byte> data ((gdb_byte *) xmalloc (size)); |
2076 | bin = data.get (); | |
b20a6524 | 2077 | |
268a13a5 | 2078 | /* We use hex encoding - see gdbsupport/rsp-low.h. */ |
b20a6524 MM |
2079 | while (len > 0) |
2080 | { | |
2081 | char hi, lo; | |
2082 | ||
2083 | hi = *body_text++; | |
2084 | lo = *body_text++; | |
2085 | ||
2086 | if (hi == 0 || lo == 0) | |
2087 | gdb_xml_error (parser, _("Bad hex encoding.")); | |
2088 | ||
2089 | *bin++ = fromhex (hi) * 16 + fromhex (lo); | |
2090 | len -= 2; | |
2091 | } | |
2092 | ||
343b0027 | 2093 | *pdata = data.release (); |
b20a6524 MM |
2094 | *psize = size; |
2095 | } | |
2096 | ||
2097 | /* Parse a btrace pt-config "cpu" xml record. */ | |
2098 | ||
2099 | static void | |
2100 | parse_xml_btrace_pt_config_cpu (struct gdb_xml_parser *parser, | |
2101 | const struct gdb_xml_element *element, | |
2102 | void *user_data, | |
4d0fdd9b | 2103 | std::vector<gdb_xml_value> &attributes) |
b20a6524 MM |
2104 | { |
2105 | struct btrace_data *btrace; | |
2106 | const char *vendor; | |
2107 | ULONGEST *family, *model, *stepping; | |
2108 | ||
4d0fdd9b SM |
2109 | vendor = |
2110 | (const char *) xml_find_attribute (attributes, "vendor")->value.get (); | |
2111 | family | |
2112 | = (ULONGEST *) xml_find_attribute (attributes, "family")->value.get (); | |
2113 | model | |
2114 | = (ULONGEST *) xml_find_attribute (attributes, "model")->value.get (); | |
2115 | stepping | |
2116 | = (ULONGEST *) xml_find_attribute (attributes, "stepping")->value.get (); | |
b20a6524 | 2117 | |
9a3c8263 | 2118 | btrace = (struct btrace_data *) user_data; |
b20a6524 MM |
2119 | |
2120 | if (strcmp (vendor, "GenuineIntel") == 0) | |
2121 | btrace->variant.pt.config.cpu.vendor = CV_INTEL; | |
2122 | ||
2123 | btrace->variant.pt.config.cpu.family = *family; | |
2124 | btrace->variant.pt.config.cpu.model = *model; | |
2125 | btrace->variant.pt.config.cpu.stepping = *stepping; | |
2126 | } | |
2127 | ||
2128 | /* Parse a btrace pt "raw" xml record. */ | |
2129 | ||
2130 | static void | |
2131 | parse_xml_btrace_pt_raw (struct gdb_xml_parser *parser, | |
2132 | const struct gdb_xml_element *element, | |
2133 | void *user_data, const char *body_text) | |
2134 | { | |
2135 | struct btrace_data *btrace; | |
2136 | ||
9a3c8263 | 2137 | btrace = (struct btrace_data *) user_data; |
b20a6524 MM |
2138 | parse_xml_raw (parser, body_text, &btrace->variant.pt.data, |
2139 | &btrace->variant.pt.size); | |
2140 | } | |
2141 | ||
2142 | /* Parse a btrace "pt" xml record. */ | |
2143 | ||
2144 | static void | |
2145 | parse_xml_btrace_pt (struct gdb_xml_parser *parser, | |
2146 | const struct gdb_xml_element *element, | |
4d0fdd9b SM |
2147 | void *user_data, |
2148 | std::vector<gdb_xml_value> &attributes) | |
b20a6524 MM |
2149 | { |
2150 | struct btrace_data *btrace; | |
2151 | ||
9a3c8263 | 2152 | btrace = (struct btrace_data *) user_data; |
b20a6524 MM |
2153 | btrace->format = BTRACE_FORMAT_PT; |
2154 | btrace->variant.pt.config.cpu.vendor = CV_UNKNOWN; | |
2155 | btrace->variant.pt.data = NULL; | |
2156 | btrace->variant.pt.size = 0; | |
2157 | } | |
2158 | ||
c12a2917 MM |
2159 | static const struct gdb_xml_attribute block_attributes[] = { |
2160 | { "begin", GDB_XML_AF_NONE, gdb_xml_parse_attr_ulongest, NULL }, | |
2161 | { "end", GDB_XML_AF_NONE, gdb_xml_parse_attr_ulongest, NULL }, | |
2162 | { NULL, GDB_XML_AF_NONE, NULL, NULL } | |
2163 | }; | |
2164 | ||
b20a6524 MM |
2165 | static const struct gdb_xml_attribute btrace_pt_config_cpu_attributes[] = { |
2166 | { "vendor", GDB_XML_AF_NONE, NULL, NULL }, | |
2167 | { "family", GDB_XML_AF_NONE, gdb_xml_parse_attr_ulongest, NULL }, | |
2168 | { "model", GDB_XML_AF_NONE, gdb_xml_parse_attr_ulongest, NULL }, | |
2169 | { "stepping", GDB_XML_AF_NONE, gdb_xml_parse_attr_ulongest, NULL }, | |
2170 | { NULL, GDB_XML_AF_NONE, NULL, NULL } | |
2171 | }; | |
2172 | ||
2173 | static const struct gdb_xml_element btrace_pt_config_children[] = { | |
2174 | { "cpu", btrace_pt_config_cpu_attributes, NULL, GDB_XML_EF_OPTIONAL, | |
2175 | parse_xml_btrace_pt_config_cpu, NULL }, | |
2176 | { NULL, NULL, NULL, GDB_XML_EF_NONE, NULL, NULL } | |
2177 | }; | |
2178 | ||
2179 | static const struct gdb_xml_element btrace_pt_children[] = { | |
2180 | { "pt-config", NULL, btrace_pt_config_children, GDB_XML_EF_OPTIONAL, NULL, | |
2181 | NULL }, | |
2182 | { "raw", NULL, NULL, GDB_XML_EF_OPTIONAL, NULL, parse_xml_btrace_pt_raw }, | |
2183 | { NULL, NULL, NULL, GDB_XML_EF_NONE, NULL, NULL } | |
2184 | }; | |
2185 | ||
c12a2917 MM |
2186 | static const struct gdb_xml_attribute btrace_attributes[] = { |
2187 | { "version", GDB_XML_AF_NONE, NULL, NULL }, | |
2188 | { NULL, GDB_XML_AF_NONE, NULL, NULL } | |
2189 | }; | |
2190 | ||
2191 | static const struct gdb_xml_element btrace_children[] = { | |
2192 | { "block", block_attributes, NULL, | |
2193 | GDB_XML_EF_REPEATABLE | GDB_XML_EF_OPTIONAL, parse_xml_btrace_block, NULL }, | |
b20a6524 MM |
2194 | { "pt", NULL, btrace_pt_children, GDB_XML_EF_OPTIONAL, parse_xml_btrace_pt, |
2195 | NULL }, | |
c12a2917 MM |
2196 | { NULL, NULL, NULL, GDB_XML_EF_NONE, NULL, NULL } |
2197 | }; | |
2198 | ||
2199 | static const struct gdb_xml_element btrace_elements[] = { | |
2200 | { "btrace", btrace_attributes, btrace_children, GDB_XML_EF_NONE, | |
2201 | check_xml_btrace_version, NULL }, | |
2202 | { NULL, NULL, NULL, GDB_XML_EF_NONE, NULL, NULL } | |
2203 | }; | |
2204 | ||
2205 | #endif /* defined (HAVE_LIBEXPAT) */ | |
2206 | ||
2207 | /* See btrace.h. */ | |
2208 | ||
734b0e4b MM |
2209 | void |
2210 | parse_xml_btrace (struct btrace_data *btrace, const char *buffer) | |
c12a2917 | 2211 | { |
c12a2917 MM |
2212 | #if defined (HAVE_LIBEXPAT) |
2213 | ||
15766370 | 2214 | int errcode; |
8dcc53b3 TT |
2215 | btrace_data result; |
2216 | result.format = BTRACE_FORMAT_NONE; | |
734b0e4b | 2217 | |
c12a2917 | 2218 | errcode = gdb_xml_parse_quick (_("btrace"), "btrace.dtd", btrace_elements, |
8dcc53b3 | 2219 | buffer, &result); |
c12a2917 | 2220 | if (errcode != 0) |
969c39fb | 2221 | error (_("Error parsing branch trace.")); |
c12a2917 MM |
2222 | |
2223 | /* Keep parse results. */ | |
8dcc53b3 | 2224 | *btrace = std::move (result); |
c12a2917 MM |
2225 | |
2226 | #else /* !defined (HAVE_LIBEXPAT) */ | |
2227 | ||
c4e12631 MM |
2228 | error (_("Cannot process branch trace. XML support was disabled at " |
2229 | "compile time.")); | |
c12a2917 MM |
2230 | |
2231 | #endif /* !defined (HAVE_LIBEXPAT) */ | |
c12a2917 | 2232 | } |
23a7fe75 | 2233 | |
f4abbc16 MM |
2234 | #if defined (HAVE_LIBEXPAT) |
2235 | ||
2236 | /* Parse a btrace-conf "bts" xml record. */ | |
2237 | ||
2238 | static void | |
2239 | parse_xml_btrace_conf_bts (struct gdb_xml_parser *parser, | |
2240 | const struct gdb_xml_element *element, | |
4d0fdd9b SM |
2241 | void *user_data, |
2242 | std::vector<gdb_xml_value> &attributes) | |
f4abbc16 MM |
2243 | { |
2244 | struct btrace_config *conf; | |
d33501a5 | 2245 | struct gdb_xml_value *size; |
f4abbc16 | 2246 | |
9a3c8263 | 2247 | conf = (struct btrace_config *) user_data; |
f4abbc16 | 2248 | conf->format = BTRACE_FORMAT_BTS; |
d33501a5 MM |
2249 | conf->bts.size = 0; |
2250 | ||
2251 | size = xml_find_attribute (attributes, "size"); | |
2252 | if (size != NULL) | |
4d0fdd9b | 2253 | conf->bts.size = (unsigned int) *(ULONGEST *) size->value.get (); |
f4abbc16 MM |
2254 | } |
2255 | ||
b20a6524 MM |
2256 | /* Parse a btrace-conf "pt" xml record. */ |
2257 | ||
2258 | static void | |
2259 | parse_xml_btrace_conf_pt (struct gdb_xml_parser *parser, | |
2260 | const struct gdb_xml_element *element, | |
4d0fdd9b SM |
2261 | void *user_data, |
2262 | std::vector<gdb_xml_value> &attributes) | |
b20a6524 MM |
2263 | { |
2264 | struct btrace_config *conf; | |
2265 | struct gdb_xml_value *size; | |
2266 | ||
9a3c8263 | 2267 | conf = (struct btrace_config *) user_data; |
b20a6524 MM |
2268 | conf->format = BTRACE_FORMAT_PT; |
2269 | conf->pt.size = 0; | |
2270 | ||
2271 | size = xml_find_attribute (attributes, "size"); | |
2272 | if (size != NULL) | |
4d0fdd9b | 2273 | conf->pt.size = (unsigned int) *(ULONGEST *) size->value.get (); |
b20a6524 MM |
2274 | } |
2275 | ||
2276 | static const struct gdb_xml_attribute btrace_conf_pt_attributes[] = { | |
2277 | { "size", GDB_XML_AF_OPTIONAL, gdb_xml_parse_attr_ulongest, NULL }, | |
2278 | { NULL, GDB_XML_AF_NONE, NULL, NULL } | |
2279 | }; | |
2280 | ||
d33501a5 MM |
2281 | static const struct gdb_xml_attribute btrace_conf_bts_attributes[] = { |
2282 | { "size", GDB_XML_AF_OPTIONAL, gdb_xml_parse_attr_ulongest, NULL }, | |
2283 | { NULL, GDB_XML_AF_NONE, NULL, NULL } | |
2284 | }; | |
2285 | ||
f4abbc16 | 2286 | static const struct gdb_xml_element btrace_conf_children[] = { |
d33501a5 MM |
2287 | { "bts", btrace_conf_bts_attributes, NULL, GDB_XML_EF_OPTIONAL, |
2288 | parse_xml_btrace_conf_bts, NULL }, | |
b20a6524 MM |
2289 | { "pt", btrace_conf_pt_attributes, NULL, GDB_XML_EF_OPTIONAL, |
2290 | parse_xml_btrace_conf_pt, NULL }, | |
f4abbc16 MM |
2291 | { NULL, NULL, NULL, GDB_XML_EF_NONE, NULL, NULL } |
2292 | }; | |
2293 | ||
2294 | static const struct gdb_xml_attribute btrace_conf_attributes[] = { | |
2295 | { "version", GDB_XML_AF_NONE, NULL, NULL }, | |
2296 | { NULL, GDB_XML_AF_NONE, NULL, NULL } | |
2297 | }; | |
2298 | ||
2299 | static const struct gdb_xml_element btrace_conf_elements[] = { | |
2300 | { "btrace-conf", btrace_conf_attributes, btrace_conf_children, | |
2301 | GDB_XML_EF_NONE, NULL, NULL }, | |
2302 | { NULL, NULL, NULL, GDB_XML_EF_NONE, NULL, NULL } | |
2303 | }; | |
2304 | ||
2305 | #endif /* defined (HAVE_LIBEXPAT) */ | |
2306 | ||
2307 | /* See btrace.h. */ | |
2308 | ||
2309 | void | |
2310 | parse_xml_btrace_conf (struct btrace_config *conf, const char *xml) | |
2311 | { | |
f4abbc16 MM |
2312 | #if defined (HAVE_LIBEXPAT) |
2313 | ||
15766370 | 2314 | int errcode; |
f4abbc16 MM |
2315 | errcode = gdb_xml_parse_quick (_("btrace-conf"), "btrace-conf.dtd", |
2316 | btrace_conf_elements, xml, conf); | |
2317 | if (errcode != 0) | |
2318 | error (_("Error parsing branch trace configuration.")); | |
2319 | ||
2320 | #else /* !defined (HAVE_LIBEXPAT) */ | |
2321 | ||
c4e12631 MM |
2322 | error (_("Cannot process the branch trace configuration. XML support " |
2323 | "was disabled at compile time.")); | |
f4abbc16 MM |
2324 | |
2325 | #endif /* !defined (HAVE_LIBEXPAT) */ | |
2326 | } | |
2327 | ||
23a7fe75 MM |
2328 | /* See btrace.h. */ |
2329 | ||
2330 | const struct btrace_insn * | |
2331 | btrace_insn_get (const struct btrace_insn_iterator *it) | |
2332 | { | |
2333 | const struct btrace_function *bfun; | |
2334 | unsigned int index, end; | |
2335 | ||
a0f1b963 | 2336 | index = it->insn_index; |
08c3f6d2 | 2337 | bfun = &it->btinfo->functions[it->call_index]; |
23a7fe75 | 2338 | |
31fd9caa MM |
2339 | /* Check if the iterator points to a gap in the trace. */ |
2340 | if (bfun->errcode != 0) | |
2341 | return NULL; | |
2342 | ||
23a7fe75 | 2343 | /* The index is within the bounds of this function's instruction vector. */ |
0860c437 | 2344 | end = bfun->insn.size (); |
23a7fe75 MM |
2345 | gdb_assert (0 < end); |
2346 | gdb_assert (index < end); | |
2347 | ||
0860c437 | 2348 | return &bfun->insn[index]; |
23a7fe75 MM |
2349 | } |
2350 | ||
2351 | /* See btrace.h. */ | |
2352 | ||
69090cee TW |
2353 | int |
2354 | btrace_insn_get_error (const struct btrace_insn_iterator *it) | |
23a7fe75 | 2355 | { |
08c3f6d2 | 2356 | return it->btinfo->functions[it->call_index].errcode; |
69090cee | 2357 | } |
31fd9caa | 2358 | |
69090cee | 2359 | /* See btrace.h. */ |
31fd9caa | 2360 | |
69090cee TW |
2361 | unsigned int |
2362 | btrace_insn_number (const struct btrace_insn_iterator *it) | |
2363 | { | |
08c3f6d2 | 2364 | return it->btinfo->functions[it->call_index].insn_offset + it->insn_index; |
23a7fe75 MM |
2365 | } |
2366 | ||
2367 | /* See btrace.h. */ | |
2368 | ||
2369 | void | |
2370 | btrace_insn_begin (struct btrace_insn_iterator *it, | |
2371 | const struct btrace_thread_info *btinfo) | |
2372 | { | |
b54b03bd | 2373 | if (btinfo->functions.empty ()) |
23a7fe75 MM |
2374 | error (_("No trace.")); |
2375 | ||
521103fd | 2376 | it->btinfo = btinfo; |
a0f1b963 TW |
2377 | it->call_index = 0; |
2378 | it->insn_index = 0; | |
23a7fe75 MM |
2379 | } |
2380 | ||
2381 | /* See btrace.h. */ | |
2382 | ||
2383 | void | |
2384 | btrace_insn_end (struct btrace_insn_iterator *it, | |
2385 | const struct btrace_thread_info *btinfo) | |
2386 | { | |
2387 | const struct btrace_function *bfun; | |
2388 | unsigned int length; | |
2389 | ||
b54b03bd | 2390 | if (btinfo->functions.empty ()) |
23a7fe75 MM |
2391 | error (_("No trace.")); |
2392 | ||
08c3f6d2 | 2393 | bfun = &btinfo->functions.back (); |
0860c437 | 2394 | length = bfun->insn.size (); |
23a7fe75 | 2395 | |
31fd9caa MM |
2396 | /* The last function may either be a gap or it contains the current |
2397 | instruction, which is one past the end of the execution trace; ignore | |
2398 | it. */ | |
2399 | if (length > 0) | |
2400 | length -= 1; | |
2401 | ||
521103fd | 2402 | it->btinfo = btinfo; |
a0f1b963 TW |
2403 | it->call_index = bfun->number - 1; |
2404 | it->insn_index = length; | |
23a7fe75 MM |
2405 | } |
2406 | ||
2407 | /* See btrace.h. */ | |
2408 | ||
2409 | unsigned int | |
2410 | btrace_insn_next (struct btrace_insn_iterator *it, unsigned int stride) | |
2411 | { | |
2412 | const struct btrace_function *bfun; | |
2413 | unsigned int index, steps; | |
2414 | ||
08c3f6d2 | 2415 | bfun = &it->btinfo->functions[it->call_index]; |
23a7fe75 | 2416 | steps = 0; |
a0f1b963 | 2417 | index = it->insn_index; |
23a7fe75 MM |
2418 | |
2419 | while (stride != 0) | |
2420 | { | |
2421 | unsigned int end, space, adv; | |
2422 | ||
0860c437 | 2423 | end = bfun->insn.size (); |
23a7fe75 | 2424 | |
31fd9caa MM |
2425 | /* An empty function segment represents a gap in the trace. We count |
2426 | it as one instruction. */ | |
2427 | if (end == 0) | |
2428 | { | |
2429 | const struct btrace_function *next; | |
2430 | ||
eb8f2b9c | 2431 | next = ftrace_find_call_by_number (it->btinfo, bfun->number + 1); |
31fd9caa MM |
2432 | if (next == NULL) |
2433 | break; | |
2434 | ||
2435 | stride -= 1; | |
2436 | steps += 1; | |
2437 | ||
2438 | bfun = next; | |
2439 | index = 0; | |
2440 | ||
2441 | continue; | |
2442 | } | |
2443 | ||
23a7fe75 MM |
2444 | gdb_assert (0 < end); |
2445 | gdb_assert (index < end); | |
2446 | ||
2447 | /* Compute the number of instructions remaining in this segment. */ | |
2448 | space = end - index; | |
2449 | ||
2450 | /* Advance the iterator as far as possible within this segment. */ | |
325fac50 | 2451 | adv = std::min (space, stride); |
23a7fe75 MM |
2452 | stride -= adv; |
2453 | index += adv; | |
2454 | steps += adv; | |
2455 | ||
2456 | /* Move to the next function if we're at the end of this one. */ | |
2457 | if (index == end) | |
2458 | { | |
2459 | const struct btrace_function *next; | |
2460 | ||
eb8f2b9c | 2461 | next = ftrace_find_call_by_number (it->btinfo, bfun->number + 1); |
23a7fe75 MM |
2462 | if (next == NULL) |
2463 | { | |
2464 | /* We stepped past the last function. | |
2465 | ||
2466 | Let's adjust the index to point to the last instruction in | |
2467 | the previous function. */ | |
2468 | index -= 1; | |
2469 | steps -= 1; | |
2470 | break; | |
2471 | } | |
2472 | ||
2473 | /* We now point to the first instruction in the new function. */ | |
2474 | bfun = next; | |
2475 | index = 0; | |
2476 | } | |
2477 | ||
2478 | /* We did make progress. */ | |
2479 | gdb_assert (adv > 0); | |
2480 | } | |
2481 | ||
2482 | /* Update the iterator. */ | |
a0f1b963 TW |
2483 | it->call_index = bfun->number - 1; |
2484 | it->insn_index = index; | |
23a7fe75 MM |
2485 | |
2486 | return steps; | |
2487 | } | |
2488 | ||
2489 | /* See btrace.h. */ | |
2490 | ||
2491 | unsigned int | |
2492 | btrace_insn_prev (struct btrace_insn_iterator *it, unsigned int stride) | |
2493 | { | |
2494 | const struct btrace_function *bfun; | |
2495 | unsigned int index, steps; | |
2496 | ||
08c3f6d2 | 2497 | bfun = &it->btinfo->functions[it->call_index]; |
23a7fe75 | 2498 | steps = 0; |
a0f1b963 | 2499 | index = it->insn_index; |
23a7fe75 MM |
2500 | |
2501 | while (stride != 0) | |
2502 | { | |
2503 | unsigned int adv; | |
2504 | ||
2505 | /* Move to the previous function if we're at the start of this one. */ | |
2506 | if (index == 0) | |
2507 | { | |
2508 | const struct btrace_function *prev; | |
2509 | ||
eb8f2b9c | 2510 | prev = ftrace_find_call_by_number (it->btinfo, bfun->number - 1); |
23a7fe75 MM |
2511 | if (prev == NULL) |
2512 | break; | |
2513 | ||
2514 | /* We point to one after the last instruction in the new function. */ | |
2515 | bfun = prev; | |
0860c437 | 2516 | index = bfun->insn.size (); |
23a7fe75 | 2517 | |
31fd9caa MM |
2518 | /* An empty function segment represents a gap in the trace. We count |
2519 | it as one instruction. */ | |
2520 | if (index == 0) | |
2521 | { | |
2522 | stride -= 1; | |
2523 | steps += 1; | |
2524 | ||
2525 | continue; | |
2526 | } | |
23a7fe75 MM |
2527 | } |
2528 | ||
2529 | /* Advance the iterator as far as possible within this segment. */ | |
325fac50 | 2530 | adv = std::min (index, stride); |
31fd9caa | 2531 | |
23a7fe75 MM |
2532 | stride -= adv; |
2533 | index -= adv; | |
2534 | steps += adv; | |
2535 | ||
2536 | /* We did make progress. */ | |
2537 | gdb_assert (adv > 0); | |
2538 | } | |
2539 | ||
2540 | /* Update the iterator. */ | |
a0f1b963 TW |
2541 | it->call_index = bfun->number - 1; |
2542 | it->insn_index = index; | |
23a7fe75 MM |
2543 | |
2544 | return steps; | |
2545 | } | |
2546 | ||
2547 | /* See btrace.h. */ | |
2548 | ||
2549 | int | |
2550 | btrace_insn_cmp (const struct btrace_insn_iterator *lhs, | |
2551 | const struct btrace_insn_iterator *rhs) | |
2552 | { | |
a0f1b963 | 2553 | gdb_assert (lhs->btinfo == rhs->btinfo); |
23a7fe75 | 2554 | |
a0f1b963 TW |
2555 | if (lhs->call_index != rhs->call_index) |
2556 | return lhs->call_index - rhs->call_index; | |
23a7fe75 | 2557 | |
a0f1b963 | 2558 | return lhs->insn_index - rhs->insn_index; |
23a7fe75 MM |
2559 | } |
2560 | ||
2561 | /* See btrace.h. */ | |
2562 | ||
2563 | int | |
2564 | btrace_find_insn_by_number (struct btrace_insn_iterator *it, | |
2565 | const struct btrace_thread_info *btinfo, | |
2566 | unsigned int number) | |
2567 | { | |
2568 | const struct btrace_function *bfun; | |
fdd2bd92 | 2569 | unsigned int upper, lower; |
23a7fe75 | 2570 | |
2b51eddc | 2571 | if (btinfo->functions.empty ()) |
fdd2bd92 | 2572 | return 0; |
23a7fe75 | 2573 | |
fdd2bd92 | 2574 | lower = 0; |
08c3f6d2 | 2575 | bfun = &btinfo->functions[lower]; |
fdd2bd92 | 2576 | if (number < bfun->insn_offset) |
23a7fe75 MM |
2577 | return 0; |
2578 | ||
2b51eddc | 2579 | upper = btinfo->functions.size () - 1; |
08c3f6d2 | 2580 | bfun = &btinfo->functions[upper]; |
fdd2bd92 | 2581 | if (number >= bfun->insn_offset + ftrace_call_num_insn (bfun)) |
23a7fe75 MM |
2582 | return 0; |
2583 | ||
fdd2bd92 TW |
2584 | /* We assume that there are no holes in the numbering. */ |
2585 | for (;;) | |
2586 | { | |
2587 | const unsigned int average = lower + (upper - lower) / 2; | |
2588 | ||
08c3f6d2 | 2589 | bfun = &btinfo->functions[average]; |
fdd2bd92 TW |
2590 | |
2591 | if (number < bfun->insn_offset) | |
2592 | { | |
2593 | upper = average - 1; | |
2594 | continue; | |
2595 | } | |
2596 | ||
2597 | if (number >= bfun->insn_offset + ftrace_call_num_insn (bfun)) | |
2598 | { | |
2599 | lower = average + 1; | |
2600 | continue; | |
2601 | } | |
2602 | ||
2603 | break; | |
2604 | } | |
2605 | ||
521103fd | 2606 | it->btinfo = btinfo; |
a0f1b963 TW |
2607 | it->call_index = bfun->number - 1; |
2608 | it->insn_index = number - bfun->insn_offset; | |
23a7fe75 MM |
2609 | return 1; |
2610 | } | |
2611 | ||
f158f208 TW |
2612 | /* Returns true if the recording ends with a function segment that |
2613 | contains only a single (i.e. the current) instruction. */ | |
2614 | ||
2615 | static bool | |
2616 | btrace_ends_with_single_insn (const struct btrace_thread_info *btinfo) | |
2617 | { | |
2618 | const btrace_function *bfun; | |
2619 | ||
2620 | if (btinfo->functions.empty ()) | |
2621 | return false; | |
2622 | ||
08c3f6d2 | 2623 | bfun = &btinfo->functions.back (); |
f158f208 TW |
2624 | if (bfun->errcode != 0) |
2625 | return false; | |
2626 | ||
2627 | return ftrace_call_num_insn (bfun) == 1; | |
2628 | } | |
2629 | ||
23a7fe75 MM |
2630 | /* See btrace.h. */ |
2631 | ||
2632 | const struct btrace_function * | |
2633 | btrace_call_get (const struct btrace_call_iterator *it) | |
2634 | { | |
f158f208 TW |
2635 | if (it->index >= it->btinfo->functions.size ()) |
2636 | return NULL; | |
2637 | ||
08c3f6d2 | 2638 | return &it->btinfo->functions[it->index]; |
23a7fe75 MM |
2639 | } |
2640 | ||
2641 | /* See btrace.h. */ | |
2642 | ||
2643 | unsigned int | |
2644 | btrace_call_number (const struct btrace_call_iterator *it) | |
2645 | { | |
f158f208 | 2646 | const unsigned int length = it->btinfo->functions.size (); |
23a7fe75 | 2647 | |
f158f208 TW |
2648 | /* If the last function segment contains only a single instruction (i.e. the |
2649 | current instruction), skip it. */ | |
2650 | if ((it->index == length) && btrace_ends_with_single_insn (it->btinfo)) | |
2651 | return length; | |
23a7fe75 | 2652 | |
f158f208 | 2653 | return it->index + 1; |
23a7fe75 MM |
2654 | } |
2655 | ||
2656 | /* See btrace.h. */ | |
2657 | ||
2658 | void | |
2659 | btrace_call_begin (struct btrace_call_iterator *it, | |
2660 | const struct btrace_thread_info *btinfo) | |
2661 | { | |
f158f208 | 2662 | if (btinfo->functions.empty ()) |
23a7fe75 MM |
2663 | error (_("No trace.")); |
2664 | ||
2665 | it->btinfo = btinfo; | |
f158f208 | 2666 | it->index = 0; |
23a7fe75 MM |
2667 | } |
2668 | ||
2669 | /* See btrace.h. */ | |
2670 | ||
2671 | void | |
2672 | btrace_call_end (struct btrace_call_iterator *it, | |
2673 | const struct btrace_thread_info *btinfo) | |
2674 | { | |
f158f208 | 2675 | if (btinfo->functions.empty ()) |
23a7fe75 MM |
2676 | error (_("No trace.")); |
2677 | ||
2678 | it->btinfo = btinfo; | |
f158f208 | 2679 | it->index = btinfo->functions.size (); |
23a7fe75 MM |
2680 | } |
2681 | ||
2682 | /* See btrace.h. */ | |
2683 | ||
2684 | unsigned int | |
2685 | btrace_call_next (struct btrace_call_iterator *it, unsigned int stride) | |
2686 | { | |
f158f208 | 2687 | const unsigned int length = it->btinfo->functions.size (); |
23a7fe75 | 2688 | |
f158f208 TW |
2689 | if (it->index + stride < length - 1) |
2690 | /* Default case: Simply advance the iterator. */ | |
2691 | it->index += stride; | |
2692 | else if (it->index + stride == length - 1) | |
23a7fe75 | 2693 | { |
f158f208 TW |
2694 | /* We land exactly at the last function segment. If it contains only one |
2695 | instruction (i.e. the current instruction) it is not actually part of | |
2696 | the trace. */ | |
2697 | if (btrace_ends_with_single_insn (it->btinfo)) | |
2698 | it->index = length; | |
2699 | else | |
2700 | it->index = length - 1; | |
2701 | } | |
2702 | else | |
2703 | { | |
2704 | /* We land past the last function segment and have to adjust the stride. | |
2705 | If the last function segment contains only one instruction (i.e. the | |
2706 | current instruction) it is not actually part of the trace. */ | |
2707 | if (btrace_ends_with_single_insn (it->btinfo)) | |
2708 | stride = length - it->index - 1; | |
2709 | else | |
2710 | stride = length - it->index; | |
23a7fe75 | 2711 | |
f158f208 | 2712 | it->index = length; |
23a7fe75 MM |
2713 | } |
2714 | ||
f158f208 | 2715 | return stride; |
23a7fe75 MM |
2716 | } |
2717 | ||
2718 | /* See btrace.h. */ | |
2719 | ||
2720 | unsigned int | |
2721 | btrace_call_prev (struct btrace_call_iterator *it, unsigned int stride) | |
2722 | { | |
f158f208 TW |
2723 | const unsigned int length = it->btinfo->functions.size (); |
2724 | int steps = 0; | |
23a7fe75 | 2725 | |
f158f208 | 2726 | gdb_assert (it->index <= length); |
23a7fe75 | 2727 | |
f158f208 TW |
2728 | if (stride == 0 || it->index == 0) |
2729 | return 0; | |
23a7fe75 | 2730 | |
f158f208 TW |
2731 | /* If we are at the end, the first step is a special case. If the last |
2732 | function segment contains only one instruction (i.e. the current | |
2733 | instruction) it is not actually part of the trace. To be able to step | |
2734 | over this instruction, we need at least one more function segment. */ | |
2735 | if ((it->index == length) && (length > 1)) | |
23a7fe75 | 2736 | { |
f158f208 TW |
2737 | if (btrace_ends_with_single_insn (it->btinfo)) |
2738 | it->index = length - 2; | |
2739 | else | |
2740 | it->index = length - 1; | |
23a7fe75 | 2741 | |
f158f208 TW |
2742 | steps = 1; |
2743 | stride -= 1; | |
23a7fe75 MM |
2744 | } |
2745 | ||
f158f208 TW |
2746 | stride = std::min (stride, it->index); |
2747 | ||
2748 | it->index -= stride; | |
2749 | return steps + stride; | |
23a7fe75 MM |
2750 | } |
2751 | ||
2752 | /* See btrace.h. */ | |
2753 | ||
2754 | int | |
2755 | btrace_call_cmp (const struct btrace_call_iterator *lhs, | |
2756 | const struct btrace_call_iterator *rhs) | |
2757 | { | |
f158f208 TW |
2758 | gdb_assert (lhs->btinfo == rhs->btinfo); |
2759 | return (int) (lhs->index - rhs->index); | |
23a7fe75 MM |
2760 | } |
2761 | ||
2762 | /* See btrace.h. */ | |
2763 | ||
2764 | int | |
2765 | btrace_find_call_by_number (struct btrace_call_iterator *it, | |
2766 | const struct btrace_thread_info *btinfo, | |
2767 | unsigned int number) | |
2768 | { | |
f158f208 | 2769 | const unsigned int length = btinfo->functions.size (); |
23a7fe75 | 2770 | |
f158f208 TW |
2771 | if ((number == 0) || (number > length)) |
2772 | return 0; | |
23a7fe75 | 2773 | |
f158f208 TW |
2774 | it->btinfo = btinfo; |
2775 | it->index = number - 1; | |
2776 | return 1; | |
23a7fe75 MM |
2777 | } |
2778 | ||
2779 | /* See btrace.h. */ | |
2780 | ||
2781 | void | |
2782 | btrace_set_insn_history (struct btrace_thread_info *btinfo, | |
2783 | const struct btrace_insn_iterator *begin, | |
2784 | const struct btrace_insn_iterator *end) | |
2785 | { | |
2786 | if (btinfo->insn_history == NULL) | |
8d749320 | 2787 | btinfo->insn_history = XCNEW (struct btrace_insn_history); |
23a7fe75 MM |
2788 | |
2789 | btinfo->insn_history->begin = *begin; | |
2790 | btinfo->insn_history->end = *end; | |
2791 | } | |
2792 | ||
2793 | /* See btrace.h. */ | |
2794 | ||
2795 | void | |
2796 | btrace_set_call_history (struct btrace_thread_info *btinfo, | |
2797 | const struct btrace_call_iterator *begin, | |
2798 | const struct btrace_call_iterator *end) | |
2799 | { | |
2800 | gdb_assert (begin->btinfo == end->btinfo); | |
2801 | ||
2802 | if (btinfo->call_history == NULL) | |
8d749320 | 2803 | btinfo->call_history = XCNEW (struct btrace_call_history); |
23a7fe75 MM |
2804 | |
2805 | btinfo->call_history->begin = *begin; | |
2806 | btinfo->call_history->end = *end; | |
2807 | } | |
07bbe694 MM |
2808 | |
2809 | /* See btrace.h. */ | |
2810 | ||
2811 | int | |
2812 | btrace_is_replaying (struct thread_info *tp) | |
2813 | { | |
2814 | return tp->btrace.replay != NULL; | |
2815 | } | |
6e07b1d2 MM |
2816 | |
2817 | /* See btrace.h. */ | |
2818 | ||
2819 | int | |
2820 | btrace_is_empty (struct thread_info *tp) | |
2821 | { | |
2822 | struct btrace_insn_iterator begin, end; | |
2823 | struct btrace_thread_info *btinfo; | |
2824 | ||
2825 | btinfo = &tp->btrace; | |
2826 | ||
b54b03bd | 2827 | if (btinfo->functions.empty ()) |
6e07b1d2 MM |
2828 | return 1; |
2829 | ||
2830 | btrace_insn_begin (&begin, btinfo); | |
2831 | btrace_insn_end (&end, btinfo); | |
2832 | ||
2833 | return btrace_insn_cmp (&begin, &end) == 0; | |
2834 | } | |
734b0e4b | 2835 | |
b0627500 MM |
2836 | #if defined (HAVE_LIBIPT) |
2837 | ||
2838 | /* Print a single packet. */ | |
2839 | ||
2840 | static void | |
2841 | pt_print_packet (const struct pt_packet *packet) | |
2842 | { | |
2843 | switch (packet->type) | |
2844 | { | |
2845 | default: | |
2846 | printf_unfiltered (("[??: %x]"), packet->type); | |
2847 | break; | |
2848 | ||
2849 | case ppt_psb: | |
2850 | printf_unfiltered (("psb")); | |
2851 | break; | |
2852 | ||
2853 | case ppt_psbend: | |
2854 | printf_unfiltered (("psbend")); | |
2855 | break; | |
2856 | ||
2857 | case ppt_pad: | |
2858 | printf_unfiltered (("pad")); | |
2859 | break; | |
2860 | ||
2861 | case ppt_tip: | |
2862 | printf_unfiltered (("tip %u: 0x%" PRIx64 ""), | |
2863 | packet->payload.ip.ipc, | |
2864 | packet->payload.ip.ip); | |
2865 | break; | |
2866 | ||
2867 | case ppt_tip_pge: | |
2868 | printf_unfiltered (("tip.pge %u: 0x%" PRIx64 ""), | |
2869 | packet->payload.ip.ipc, | |
2870 | packet->payload.ip.ip); | |
2871 | break; | |
2872 | ||
2873 | case ppt_tip_pgd: | |
2874 | printf_unfiltered (("tip.pgd %u: 0x%" PRIx64 ""), | |
2875 | packet->payload.ip.ipc, | |
2876 | packet->payload.ip.ip); | |
2877 | break; | |
2878 | ||
2879 | case ppt_fup: | |
2880 | printf_unfiltered (("fup %u: 0x%" PRIx64 ""), | |
2881 | packet->payload.ip.ipc, | |
2882 | packet->payload.ip.ip); | |
2883 | break; | |
2884 | ||
2885 | case ppt_tnt_8: | |
2886 | printf_unfiltered (("tnt-8 %u: 0x%" PRIx64 ""), | |
2887 | packet->payload.tnt.bit_size, | |
2888 | packet->payload.tnt.payload); | |
2889 | break; | |
2890 | ||
2891 | case ppt_tnt_64: | |
2892 | printf_unfiltered (("tnt-64 %u: 0x%" PRIx64 ""), | |
2893 | packet->payload.tnt.bit_size, | |
2894 | packet->payload.tnt.payload); | |
2895 | break; | |
2896 | ||
2897 | case ppt_pip: | |
37fdfe4c MM |
2898 | printf_unfiltered (("pip %" PRIx64 "%s"), packet->payload.pip.cr3, |
2899 | packet->payload.pip.nr ? (" nr") : ("")); | |
b0627500 MM |
2900 | break; |
2901 | ||
2902 | case ppt_tsc: | |
2903 | printf_unfiltered (("tsc %" PRIx64 ""), packet->payload.tsc.tsc); | |
2904 | break; | |
2905 | ||
2906 | case ppt_cbr: | |
2907 | printf_unfiltered (("cbr %u"), packet->payload.cbr.ratio); | |
2908 | break; | |
2909 | ||
2910 | case ppt_mode: | |
2911 | switch (packet->payload.mode.leaf) | |
2912 | { | |
2913 | default: | |
2914 | printf_unfiltered (("mode %u"), packet->payload.mode.leaf); | |
2915 | break; | |
2916 | ||
2917 | case pt_mol_exec: | |
2918 | printf_unfiltered (("mode.exec%s%s"), | |
2919 | packet->payload.mode.bits.exec.csl | |
2920 | ? (" cs.l") : (""), | |
2921 | packet->payload.mode.bits.exec.csd | |
2922 | ? (" cs.d") : ("")); | |
2923 | break; | |
2924 | ||
2925 | case pt_mol_tsx: | |
2926 | printf_unfiltered (("mode.tsx%s%s"), | |
2927 | packet->payload.mode.bits.tsx.intx | |
2928 | ? (" intx") : (""), | |
2929 | packet->payload.mode.bits.tsx.abrt | |
2930 | ? (" abrt") : ("")); | |
2931 | break; | |
2932 | } | |
2933 | break; | |
2934 | ||
2935 | case ppt_ovf: | |
2936 | printf_unfiltered (("ovf")); | |
2937 | break; | |
2938 | ||
37fdfe4c MM |
2939 | case ppt_stop: |
2940 | printf_unfiltered (("stop")); | |
2941 | break; | |
2942 | ||
2943 | case ppt_vmcs: | |
2944 | printf_unfiltered (("vmcs %" PRIx64 ""), packet->payload.vmcs.base); | |
2945 | break; | |
2946 | ||
2947 | case ppt_tma: | |
2948 | printf_unfiltered (("tma %x %x"), packet->payload.tma.ctc, | |
2949 | packet->payload.tma.fc); | |
2950 | break; | |
2951 | ||
2952 | case ppt_mtc: | |
2953 | printf_unfiltered (("mtc %x"), packet->payload.mtc.ctc); | |
2954 | break; | |
2955 | ||
2956 | case ppt_cyc: | |
2957 | printf_unfiltered (("cyc %" PRIx64 ""), packet->payload.cyc.value); | |
2958 | break; | |
2959 | ||
2960 | case ppt_mnt: | |
2961 | printf_unfiltered (("mnt %" PRIx64 ""), packet->payload.mnt.payload); | |
2962 | break; | |
b0627500 MM |
2963 | } |
2964 | } | |
2965 | ||
2966 | /* Decode packets into MAINT using DECODER. */ | |
2967 | ||
2968 | static void | |
2969 | btrace_maint_decode_pt (struct btrace_maint_info *maint, | |
2970 | struct pt_packet_decoder *decoder) | |
2971 | { | |
2972 | int errcode; | |
2973 | ||
2974 | for (;;) | |
2975 | { | |
2976 | struct btrace_pt_packet packet; | |
2977 | ||
2978 | errcode = pt_pkt_sync_forward (decoder); | |
2979 | if (errcode < 0) | |
2980 | break; | |
2981 | ||
2982 | for (;;) | |
2983 | { | |
2984 | pt_pkt_get_offset (decoder, &packet.offset); | |
2985 | ||
2986 | errcode = pt_pkt_next (decoder, &packet.packet, | |
2987 | sizeof(packet.packet)); | |
2988 | if (errcode < 0) | |
2989 | break; | |
2990 | ||
2991 | if (maint_btrace_pt_skip_pad == 0 || packet.packet.type != ppt_pad) | |
2992 | { | |
2993 | packet.errcode = pt_errcode (errcode); | |
2994 | VEC_safe_push (btrace_pt_packet_s, maint->variant.pt.packets, | |
2995 | &packet); | |
2996 | } | |
2997 | } | |
2998 | ||
2999 | if (errcode == -pte_eos) | |
3000 | break; | |
3001 | ||
3002 | packet.errcode = pt_errcode (errcode); | |
3003 | VEC_safe_push (btrace_pt_packet_s, maint->variant.pt.packets, | |
3004 | &packet); | |
3005 | ||
3006 | warning (_("Error at trace offset 0x%" PRIx64 ": %s."), | |
3007 | packet.offset, pt_errstr (packet.errcode)); | |
3008 | } | |
3009 | ||
3010 | if (errcode != -pte_eos) | |
bc504a31 | 3011 | warning (_("Failed to synchronize onto the Intel Processor Trace " |
b0627500 MM |
3012 | "stream: %s."), pt_errstr (pt_errcode (errcode))); |
3013 | } | |
3014 | ||
3015 | /* Update the packet history in BTINFO. */ | |
3016 | ||
3017 | static void | |
3018 | btrace_maint_update_pt_packets (struct btrace_thread_info *btinfo) | |
3019 | { | |
b0627500 | 3020 | struct pt_packet_decoder *decoder; |
4a4495d6 | 3021 | const struct btrace_cpu *cpu; |
b0627500 MM |
3022 | struct btrace_data_pt *pt; |
3023 | struct pt_config config; | |
3024 | int errcode; | |
3025 | ||
3026 | pt = &btinfo->data.variant.pt; | |
3027 | ||
3028 | /* Nothing to do if there is no trace. */ | |
3029 | if (pt->size == 0) | |
3030 | return; | |
3031 | ||
3032 | memset (&config, 0, sizeof(config)); | |
3033 | ||
3034 | config.size = sizeof (config); | |
3035 | config.begin = pt->data; | |
3036 | config.end = pt->data + pt->size; | |
3037 | ||
4a4495d6 MM |
3038 | cpu = record_btrace_get_cpu (); |
3039 | if (cpu == nullptr) | |
3040 | cpu = &pt->config.cpu; | |
3041 | ||
3042 | /* We treat an unknown vendor as 'no errata'. */ | |
3043 | if (cpu->vendor != CV_UNKNOWN) | |
3044 | { | |
3045 | config.cpu.vendor = pt_translate_cpu_vendor (cpu->vendor); | |
3046 | config.cpu.family = cpu->family; | |
3047 | config.cpu.model = cpu->model; | |
3048 | config.cpu.stepping = cpu->stepping; | |
b0627500 | 3049 | |
4a4495d6 MM |
3050 | errcode = pt_cpu_errata (&config.errata, &config.cpu); |
3051 | if (errcode < 0) | |
3052 | error (_("Failed to configure the Intel Processor Trace " | |
3053 | "decoder: %s."), pt_errstr (pt_errcode (errcode))); | |
3054 | } | |
b0627500 MM |
3055 | |
3056 | decoder = pt_pkt_alloc_decoder (&config); | |
3057 | if (decoder == NULL) | |
bc504a31 | 3058 | error (_("Failed to allocate the Intel Processor Trace decoder.")); |
b0627500 | 3059 | |
a70b8144 | 3060 | try |
b0627500 MM |
3061 | { |
3062 | btrace_maint_decode_pt (&btinfo->maint, decoder); | |
3063 | } | |
230d2906 | 3064 | catch (const gdb_exception &except) |
b0627500 MM |
3065 | { |
3066 | pt_pkt_free_decoder (decoder); | |
3067 | ||
3068 | if (except.reason < 0) | |
eedc3f4f | 3069 | throw; |
b0627500 | 3070 | } |
b0627500 MM |
3071 | |
3072 | pt_pkt_free_decoder (decoder); | |
3073 | } | |
3074 | ||
3075 | #endif /* !defined (HAVE_LIBIPT) */ | |
3076 | ||
3077 | /* Update the packet maintenance information for BTINFO and store the | |
3078 | low and high bounds into BEGIN and END, respectively. | |
3079 | Store the current iterator state into FROM and TO. */ | |
3080 | ||
3081 | static void | |
3082 | btrace_maint_update_packets (struct btrace_thread_info *btinfo, | |
3083 | unsigned int *begin, unsigned int *end, | |
3084 | unsigned int *from, unsigned int *to) | |
3085 | { | |
3086 | switch (btinfo->data.format) | |
3087 | { | |
3088 | default: | |
3089 | *begin = 0; | |
3090 | *end = 0; | |
3091 | *from = 0; | |
3092 | *to = 0; | |
3093 | break; | |
3094 | ||
3095 | case BTRACE_FORMAT_BTS: | |
3096 | /* Nothing to do - we operate directly on BTINFO->DATA. */ | |
3097 | *begin = 0; | |
3098 | *end = VEC_length (btrace_block_s, btinfo->data.variant.bts.blocks); | |
3099 | *from = btinfo->maint.variant.bts.packet_history.begin; | |
3100 | *to = btinfo->maint.variant.bts.packet_history.end; | |
3101 | break; | |
3102 | ||
3103 | #if defined (HAVE_LIBIPT) | |
3104 | case BTRACE_FORMAT_PT: | |
3105 | if (VEC_empty (btrace_pt_packet_s, btinfo->maint.variant.pt.packets)) | |
3106 | btrace_maint_update_pt_packets (btinfo); | |
3107 | ||
3108 | *begin = 0; | |
3109 | *end = VEC_length (btrace_pt_packet_s, btinfo->maint.variant.pt.packets); | |
3110 | *from = btinfo->maint.variant.pt.packet_history.begin; | |
3111 | *to = btinfo->maint.variant.pt.packet_history.end; | |
3112 | break; | |
3113 | #endif /* defined (HAVE_LIBIPT) */ | |
3114 | } | |
3115 | } | |
3116 | ||
3117 | /* Print packets in BTINFO from BEGIN (inclusive) until END (exclusive) and | |
3118 | update the current iterator position. */ | |
3119 | ||
3120 | static void | |
3121 | btrace_maint_print_packets (struct btrace_thread_info *btinfo, | |
3122 | unsigned int begin, unsigned int end) | |
3123 | { | |
3124 | switch (btinfo->data.format) | |
3125 | { | |
3126 | default: | |
3127 | break; | |
3128 | ||
3129 | case BTRACE_FORMAT_BTS: | |
3130 | { | |
3131 | VEC (btrace_block_s) *blocks; | |
3132 | unsigned int blk; | |
3133 | ||
3134 | blocks = btinfo->data.variant.bts.blocks; | |
3135 | for (blk = begin; blk < end; ++blk) | |
3136 | { | |
3137 | const btrace_block_s *block; | |
3138 | ||
3139 | block = VEC_index (btrace_block_s, blocks, blk); | |
3140 | ||
3141 | printf_unfiltered ("%u\tbegin: %s, end: %s\n", blk, | |
3142 | core_addr_to_string_nz (block->begin), | |
3143 | core_addr_to_string_nz (block->end)); | |
3144 | } | |
3145 | ||
3146 | btinfo->maint.variant.bts.packet_history.begin = begin; | |
3147 | btinfo->maint.variant.bts.packet_history.end = end; | |
3148 | } | |
3149 | break; | |
3150 | ||
3151 | #if defined (HAVE_LIBIPT) | |
3152 | case BTRACE_FORMAT_PT: | |
3153 | { | |
3154 | VEC (btrace_pt_packet_s) *packets; | |
3155 | unsigned int pkt; | |
3156 | ||
3157 | packets = btinfo->maint.variant.pt.packets; | |
3158 | for (pkt = begin; pkt < end; ++pkt) | |
3159 | { | |
3160 | const struct btrace_pt_packet *packet; | |
3161 | ||
3162 | packet = VEC_index (btrace_pt_packet_s, packets, pkt); | |
3163 | ||
3164 | printf_unfiltered ("%u\t", pkt); | |
3165 | printf_unfiltered ("0x%" PRIx64 "\t", packet->offset); | |
3166 | ||
3167 | if (packet->errcode == pte_ok) | |
3168 | pt_print_packet (&packet->packet); | |
3169 | else | |
3170 | printf_unfiltered ("[error: %s]", pt_errstr (packet->errcode)); | |
3171 | ||
3172 | printf_unfiltered ("\n"); | |
3173 | } | |
3174 | ||
3175 | btinfo->maint.variant.pt.packet_history.begin = begin; | |
3176 | btinfo->maint.variant.pt.packet_history.end = end; | |
3177 | } | |
3178 | break; | |
3179 | #endif /* defined (HAVE_LIBIPT) */ | |
3180 | } | |
3181 | } | |
3182 | ||
3183 | /* Read a number from an argument string. */ | |
3184 | ||
3185 | static unsigned int | |
f938677d | 3186 | get_uint (const char **arg) |
b0627500 | 3187 | { |
f938677d TT |
3188 | const char *begin, *pos; |
3189 | char *end; | |
b0627500 MM |
3190 | unsigned long number; |
3191 | ||
3192 | begin = *arg; | |
3193 | pos = skip_spaces (begin); | |
3194 | ||
3195 | if (!isdigit (*pos)) | |
3196 | error (_("Expected positive number, got: %s."), pos); | |
3197 | ||
3198 | number = strtoul (pos, &end, 10); | |
3199 | if (number > UINT_MAX) | |
3200 | error (_("Number too big.")); | |
3201 | ||
3202 | *arg += (end - begin); | |
3203 | ||
3204 | return (unsigned int) number; | |
3205 | } | |
3206 | ||
3207 | /* Read a context size from an argument string. */ | |
3208 | ||
3209 | static int | |
f938677d | 3210 | get_context_size (const char **arg) |
b0627500 | 3211 | { |
f938677d | 3212 | const char *pos = skip_spaces (*arg); |
b0627500 MM |
3213 | |
3214 | if (!isdigit (*pos)) | |
3215 | error (_("Expected positive number, got: %s."), pos); | |
3216 | ||
f938677d TT |
3217 | char *end; |
3218 | long result = strtol (pos, &end, 10); | |
3219 | *arg = end; | |
3220 | return result; | |
b0627500 MM |
3221 | } |
3222 | ||
3223 | /* Complain about junk at the end of an argument string. */ | |
3224 | ||
3225 | static void | |
f938677d | 3226 | no_chunk (const char *arg) |
b0627500 MM |
3227 | { |
3228 | if (*arg != 0) | |
3229 | error (_("Junk after argument: %s."), arg); | |
3230 | } | |
3231 | ||
3232 | /* The "maintenance btrace packet-history" command. */ | |
3233 | ||
3234 | static void | |
f938677d | 3235 | maint_btrace_packet_history_cmd (const char *arg, int from_tty) |
b0627500 MM |
3236 | { |
3237 | struct btrace_thread_info *btinfo; | |
b0627500 MM |
3238 | unsigned int size, begin, end, from, to; |
3239 | ||
00431a78 | 3240 | thread_info *tp = find_thread_ptid (inferior_ptid); |
b0627500 MM |
3241 | if (tp == NULL) |
3242 | error (_("No thread.")); | |
3243 | ||
3244 | size = 10; | |
3245 | btinfo = &tp->btrace; | |
3246 | ||
3247 | btrace_maint_update_packets (btinfo, &begin, &end, &from, &to); | |
3248 | if (begin == end) | |
3249 | { | |
3250 | printf_unfiltered (_("No trace.\n")); | |
3251 | return; | |
3252 | } | |
3253 | ||
3254 | if (arg == NULL || *arg == 0 || strcmp (arg, "+") == 0) | |
3255 | { | |
3256 | from = to; | |
3257 | ||
3258 | if (end - from < size) | |
3259 | size = end - from; | |
3260 | to = from + size; | |
3261 | } | |
3262 | else if (strcmp (arg, "-") == 0) | |
3263 | { | |
3264 | to = from; | |
3265 | ||
3266 | if (to - begin < size) | |
3267 | size = to - begin; | |
3268 | from = to - size; | |
3269 | } | |
3270 | else | |
3271 | { | |
3272 | from = get_uint (&arg); | |
3273 | if (end <= from) | |
3274 | error (_("'%u' is out of range."), from); | |
3275 | ||
3276 | arg = skip_spaces (arg); | |
3277 | if (*arg == ',') | |
3278 | { | |
3279 | arg = skip_spaces (++arg); | |
3280 | ||
3281 | if (*arg == '+') | |
3282 | { | |
3283 | arg += 1; | |
3284 | size = get_context_size (&arg); | |
3285 | ||
3286 | no_chunk (arg); | |
3287 | ||
3288 | if (end - from < size) | |
3289 | size = end - from; | |
3290 | to = from + size; | |
3291 | } | |
3292 | else if (*arg == '-') | |
3293 | { | |
3294 | arg += 1; | |
3295 | size = get_context_size (&arg); | |
3296 | ||
3297 | no_chunk (arg); | |
3298 | ||
3299 | /* Include the packet given as first argument. */ | |
3300 | from += 1; | |
3301 | to = from; | |
3302 | ||
3303 | if (to - begin < size) | |
3304 | size = to - begin; | |
3305 | from = to - size; | |
3306 | } | |
3307 | else | |
3308 | { | |
3309 | to = get_uint (&arg); | |
3310 | ||
3311 | /* Include the packet at the second argument and silently | |
3312 | truncate the range. */ | |
3313 | if (to < end) | |
3314 | to += 1; | |
3315 | else | |
3316 | to = end; | |
3317 | ||
3318 | no_chunk (arg); | |
3319 | } | |
3320 | } | |
3321 | else | |
3322 | { | |
3323 | no_chunk (arg); | |
3324 | ||
3325 | if (end - from < size) | |
3326 | size = end - from; | |
3327 | to = from + size; | |
3328 | } | |
3329 | ||
3330 | dont_repeat (); | |
3331 | } | |
3332 | ||
3333 | btrace_maint_print_packets (btinfo, from, to); | |
3334 | } | |
3335 | ||
3336 | /* The "maintenance btrace clear-packet-history" command. */ | |
3337 | ||
3338 | static void | |
f938677d | 3339 | maint_btrace_clear_packet_history_cmd (const char *args, int from_tty) |
b0627500 | 3340 | { |
b0627500 MM |
3341 | if (args != NULL && *args != 0) |
3342 | error (_("Invalid argument.")); | |
3343 | ||
00431a78 | 3344 | if (inferior_ptid == null_ptid) |
b0627500 MM |
3345 | error (_("No thread.")); |
3346 | ||
00431a78 PA |
3347 | thread_info *tp = inferior_thread (); |
3348 | btrace_thread_info *btinfo = &tp->btrace; | |
b0627500 MM |
3349 | |
3350 | /* Must clear the maint data before - it depends on BTINFO->DATA. */ | |
3351 | btrace_maint_clear (btinfo); | |
8dcc53b3 | 3352 | btinfo->data.clear (); |
b0627500 MM |
3353 | } |
3354 | ||
3355 | /* The "maintenance btrace clear" command. */ | |
3356 | ||
3357 | static void | |
f938677d | 3358 | maint_btrace_clear_cmd (const char *args, int from_tty) |
b0627500 | 3359 | { |
b0627500 MM |
3360 | if (args != NULL && *args != 0) |
3361 | error (_("Invalid argument.")); | |
3362 | ||
00431a78 | 3363 | if (inferior_ptid == null_ptid) |
b0627500 MM |
3364 | error (_("No thread.")); |
3365 | ||
00431a78 | 3366 | thread_info *tp = inferior_thread (); |
b0627500 MM |
3367 | btrace_clear (tp); |
3368 | } | |
3369 | ||
3370 | /* The "maintenance btrace" command. */ | |
3371 | ||
3372 | static void | |
981a3fb3 | 3373 | maint_btrace_cmd (const char *args, int from_tty) |
b0627500 MM |
3374 | { |
3375 | help_list (maint_btrace_cmdlist, "maintenance btrace ", all_commands, | |
3376 | gdb_stdout); | |
3377 | } | |
3378 | ||
3379 | /* The "maintenance set btrace" command. */ | |
3380 | ||
3381 | static void | |
981a3fb3 | 3382 | maint_btrace_set_cmd (const char *args, int from_tty) |
b0627500 MM |
3383 | { |
3384 | help_list (maint_btrace_set_cmdlist, "maintenance set btrace ", all_commands, | |
3385 | gdb_stdout); | |
3386 | } | |
3387 | ||
3388 | /* The "maintenance show btrace" command. */ | |
3389 | ||
3390 | static void | |
981a3fb3 | 3391 | maint_btrace_show_cmd (const char *args, int from_tty) |
b0627500 MM |
3392 | { |
3393 | help_list (maint_btrace_show_cmdlist, "maintenance show btrace ", | |
3394 | all_commands, gdb_stdout); | |
3395 | } | |
3396 | ||
3397 | /* The "maintenance set btrace pt" command. */ | |
3398 | ||
3399 | static void | |
981a3fb3 | 3400 | maint_btrace_pt_set_cmd (const char *args, int from_tty) |
b0627500 MM |
3401 | { |
3402 | help_list (maint_btrace_pt_set_cmdlist, "maintenance set btrace pt ", | |
3403 | all_commands, gdb_stdout); | |
3404 | } | |
3405 | ||
3406 | /* The "maintenance show btrace pt" command. */ | |
3407 | ||
3408 | static void | |
981a3fb3 | 3409 | maint_btrace_pt_show_cmd (const char *args, int from_tty) |
b0627500 MM |
3410 | { |
3411 | help_list (maint_btrace_pt_show_cmdlist, "maintenance show btrace pt ", | |
3412 | all_commands, gdb_stdout); | |
3413 | } | |
3414 | ||
3415 | /* The "maintenance info btrace" command. */ | |
3416 | ||
3417 | static void | |
f938677d | 3418 | maint_info_btrace_cmd (const char *args, int from_tty) |
b0627500 MM |
3419 | { |
3420 | struct btrace_thread_info *btinfo; | |
b0627500 MM |
3421 | const struct btrace_config *conf; |
3422 | ||
3423 | if (args != NULL && *args != 0) | |
3424 | error (_("Invalid argument.")); | |
3425 | ||
00431a78 | 3426 | if (inferior_ptid == null_ptid) |
b0627500 MM |
3427 | error (_("No thread.")); |
3428 | ||
00431a78 PA |
3429 | thread_info *tp = inferior_thread (); |
3430 | ||
b0627500 MM |
3431 | btinfo = &tp->btrace; |
3432 | ||
3433 | conf = btrace_conf (btinfo); | |
3434 | if (conf == NULL) | |
3435 | error (_("No btrace configuration.")); | |
3436 | ||
3437 | printf_unfiltered (_("Format: %s.\n"), | |
3438 | btrace_format_string (conf->format)); | |
3439 | ||
3440 | switch (conf->format) | |
3441 | { | |
3442 | default: | |
3443 | break; | |
3444 | ||
3445 | case BTRACE_FORMAT_BTS: | |
3446 | printf_unfiltered (_("Number of packets: %u.\n"), | |
3447 | VEC_length (btrace_block_s, | |
3448 | btinfo->data.variant.bts.blocks)); | |
3449 | break; | |
3450 | ||
3451 | #if defined (HAVE_LIBIPT) | |
3452 | case BTRACE_FORMAT_PT: | |
3453 | { | |
3454 | struct pt_version version; | |
3455 | ||
3456 | version = pt_library_version (); | |
3457 | printf_unfiltered (_("Version: %u.%u.%u%s.\n"), version.major, | |
3458 | version.minor, version.build, | |
3459 | version.ext != NULL ? version.ext : ""); | |
3460 | ||
3461 | btrace_maint_update_pt_packets (btinfo); | |
3462 | printf_unfiltered (_("Number of packets: %u.\n"), | |
3463 | VEC_length (btrace_pt_packet_s, | |
3464 | btinfo->maint.variant.pt.packets)); | |
3465 | } | |
3466 | break; | |
3467 | #endif /* defined (HAVE_LIBIPT) */ | |
3468 | } | |
3469 | } | |
3470 | ||
3471 | /* The "maint show btrace pt skip-pad" show value function. */ | |
3472 | ||
3473 | static void | |
3474 | show_maint_btrace_pt_skip_pad (struct ui_file *file, int from_tty, | |
3475 | struct cmd_list_element *c, | |
3476 | const char *value) | |
3477 | { | |
3478 | fprintf_filtered (file, _("Skip PAD packets is %s.\n"), value); | |
3479 | } | |
3480 | ||
3481 | ||
3482 | /* Initialize btrace maintenance commands. */ | |
3483 | ||
b0627500 MM |
3484 | void |
3485 | _initialize_btrace (void) | |
3486 | { | |
3487 | add_cmd ("btrace", class_maintenance, maint_info_btrace_cmd, | |
3488 | _("Info about branch tracing data."), &maintenanceinfolist); | |
3489 | ||
3490 | add_prefix_cmd ("btrace", class_maintenance, maint_btrace_cmd, | |
3491 | _("Branch tracing maintenance commands."), | |
3492 | &maint_btrace_cmdlist, "maintenance btrace ", | |
3493 | 0, &maintenancelist); | |
3494 | ||
3495 | add_prefix_cmd ("btrace", class_maintenance, maint_btrace_set_cmd, _("\ | |
3496 | Set branch tracing specific variables."), | |
3497 | &maint_btrace_set_cmdlist, "maintenance set btrace ", | |
3498 | 0, &maintenance_set_cmdlist); | |
3499 | ||
3500 | add_prefix_cmd ("pt", class_maintenance, maint_btrace_pt_set_cmd, _("\ | |
bc504a31 | 3501 | Set Intel Processor Trace specific variables."), |
b0627500 MM |
3502 | &maint_btrace_pt_set_cmdlist, "maintenance set btrace pt ", |
3503 | 0, &maint_btrace_set_cmdlist); | |
3504 | ||
3505 | add_prefix_cmd ("btrace", class_maintenance, maint_btrace_show_cmd, _("\ | |
3506 | Show branch tracing specific variables."), | |
3507 | &maint_btrace_show_cmdlist, "maintenance show btrace ", | |
3508 | 0, &maintenance_show_cmdlist); | |
3509 | ||
3510 | add_prefix_cmd ("pt", class_maintenance, maint_btrace_pt_show_cmd, _("\ | |
bc504a31 | 3511 | Show Intel Processor Trace specific variables."), |
b0627500 MM |
3512 | &maint_btrace_pt_show_cmdlist, "maintenance show btrace pt ", |
3513 | 0, &maint_btrace_show_cmdlist); | |
3514 | ||
3515 | add_setshow_boolean_cmd ("skip-pad", class_maintenance, | |
3516 | &maint_btrace_pt_skip_pad, _("\ | |
3517 | Set whether PAD packets should be skipped in the btrace packet history."), _("\ | |
3518 | Show whether PAD packets should be skipped in the btrace packet history."),_("\ | |
3519 | When enabled, PAD packets are ignored in the btrace packet history."), | |
3520 | NULL, show_maint_btrace_pt_skip_pad, | |
3521 | &maint_btrace_pt_set_cmdlist, | |
3522 | &maint_btrace_pt_show_cmdlist); | |
3523 | ||
3524 | add_cmd ("packet-history", class_maintenance, maint_btrace_packet_history_cmd, | |
3525 | _("Print the raw branch tracing data.\n\ | |
3526 | With no argument, print ten more packets after the previous ten-line print.\n\ | |
3527 | With '-' as argument print ten packets before a previous ten-line print.\n\ | |
3528 | One argument specifies the starting packet of a ten-line print.\n\ | |
3529 | Two arguments with comma between specify starting and ending packets to \ | |
3530 | print.\n\ | |
3531 | Preceded with '+'/'-' the second argument specifies the distance from the \ | |
89549d7f | 3532 | first."), |
b0627500 MM |
3533 | &maint_btrace_cmdlist); |
3534 | ||
3535 | add_cmd ("clear-packet-history", class_maintenance, | |
3536 | maint_btrace_clear_packet_history_cmd, | |
3537 | _("Clears the branch tracing packet history.\n\ | |
89549d7f | 3538 | Discards the raw branch tracing data but not the execution history data."), |
b0627500 MM |
3539 | &maint_btrace_cmdlist); |
3540 | ||
3541 | add_cmd ("clear", class_maintenance, maint_btrace_clear_cmd, | |
3542 | _("Clears the branch tracing data.\n\ | |
3543 | Discards the raw branch tracing data and the execution history data.\n\ | |
89549d7f | 3544 | The next 'record' command will fetch the branch tracing data anew."), |
b0627500 MM |
3545 | &maint_btrace_cmdlist); |
3546 | ||
3547 | } |