aboutsummaryrefslogtreecommitdiff
path: root/tools/perf/scripts/python/call-graph-from-postgresql.py
diff options
context:
space:
mode:
authorPeter Zijlstra <[email protected]>2017-03-22 11:35:59 +0100
committerThomas Gleixner <[email protected]>2017-03-23 19:10:10 +0100
commitbebe5b514345f09be2c15e414d076b02ecb9cce8 (patch)
tree6cc89f5210cc01abf5b0195bfd577e46d08bb8fd /tools/perf/scripts/python/call-graph-from-postgresql.py
parentcfafcd117da0216520568c195cb2f6cd1980c4bb (diff)
futex: Futex_unlock_pi() determinism
The problem with returning -EAGAIN when the waiter state mismatches is that it becomes very hard to proof a bounded execution time on the operation. And seeing that this is a RT operation, this is somewhat important. While in practise; given the previous patch; it will be very unlikely to ever really take more than one or two rounds, proving so becomes rather hard. However, now that modifying wait_list is done while holding both hb->lock and wait_lock, the scenario can be avoided entirely by acquiring wait_lock while still holding hb-lock. Doing a hand-over, without leaving a hole. Signed-off-by: Peter Zijlstra (Intel) <[email protected]> Cc: [email protected] Cc: [email protected] Cc: [email protected] Cc: [email protected] Cc: [email protected] Cc: [email protected] Cc: [email protected] Cc: [email protected] Link: http://lkml.kernel.org/r/[email protected] Signed-off-by: Thomas Gleixner <[email protected]>
Diffstat (limited to 'tools/perf/scripts/python/call-graph-from-postgresql.py')
0 files changed, 0 insertions, 0 deletions