aboutsummaryrefslogtreecommitdiff
path: root/tools/perf/scripts/python/bin
diff options
context:
space:
mode:
authorOleg Nesterov <[email protected]>2015-07-21 15:40:13 +0200
committerIngo Molnar <[email protected]>2015-07-31 10:38:04 +0200
commita83cfeb92132c279b20bbc8ed3cef833b0fe417e (patch)
tree993d56e06db2cf0b927ba39b578cb9310720fdff /tools/perf/scripts/python/bin
parent6c58d0e4cc26ea8882928e64c0de9afed4fc37cb (diff)
uprobes: Change handle_trampoline() to find the next chain beforehand
No functional changes, preparation. Add the new helper, find_next_ret_chain(), which finds the first !chained entry and returns its ->next. Yes, it is suboptimal. We probably want to turn ->chained into ->start_of_this_chain pointer and avoid another loop. But this needs the boring changes in dup_utask(), so lets do this later. Change the main loop in handle_trampoline() to unwind the stack until ri is equal to the pointer returned by this new helper. Tested-by: Pratyush Anand <[email protected]> Signed-off-by: Oleg Nesterov <[email protected]> Acked-by: Srikar Dronamraju <[email protected]> Acked-by: Anton Arapov <[email protected]> Cc: Andy Lutomirski <[email protected]> Cc: Linus Torvalds <[email protected]> Cc: Peter Zijlstra <[email protected]> Cc: Thomas Gleixner <[email protected]> Link: http://lkml.kernel.org/r/[email protected] Signed-off-by: Ingo Molnar <[email protected]>
Diffstat (limited to 'tools/perf/scripts/python/bin')
0 files changed, 0 insertions, 0 deletions