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