sergiotarxz/libvips
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

vipsprofile outputs top 10 waits

Browse Source
This commit is contained in:
John Cupitt 2023-01-04 18:16:04 +00:00
parent 675143807a
commit febb71dba1
1 changed files with 23 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
tools/vipsprofile
View File

@ -151,7 +151,7 @@ for thread in threads:
all_events.sort(key=lambda x: x.start)
print('loaded %d events' % n_events)
print(f'loaded {n_events} events')
# move time axis to secs of computation
ticks_per_sec = 1000000.0
@ -170,7 +170,7 @@ for event in all_events:
last_time = (last_time - first_time) / ticks_per_sec
first_time = 0
print('total time =', last_time)
print(f'total time = {last_time}')
# calculate some simple stats
for thread in threads:
@ -199,7 +199,7 @@ for thread in threads:
# hide very short-lived threads
thread.hide = thread.alive < 0.01
print('name\t\talive\twait%\twork%\tunkn%\tmemory\tpeakm')
print('name alive wait% work% unkn% mem peakm')
for thread in threads:
if thread.hide:
continue
@ -208,11 +208,10 @@ for thread in threads:
work_percent = 100 * thread.work / thread.alive
unkn_percent = 100 - 100 * (thread.work + thread.wait) / thread.alive
print('%13s\t%6.2g\t' % (thread.thread_name, thread.alive), end=' ')
print('%.3g\t%.3g\t%.3g\t' %
(wait_percent, work_percent, unkn_percent), end=' ')
print('%.3g\t' % (thread.mem / (1024 * 1024)), end=' ')
print('%.3g\t' % (thread.peak_mem / (1024 * 1024)))
print((f'{thread.thread_name:>13}\t{thread.alive:6.2f}\t'
f'{wait_percent:>4.1f}\t{work_percent:>4.1f}\t{unkn_percent:>4.1f}\t'
f'{thread.mem / (1024 * 1024):>4.1f}\t'
f'{thread.peak_mem / (1024 * 1024):>4.1f}'))
mem = 0
peak_mem = 0
@ -222,9 +221,9 @@ for event in all_events:
if mem > peak_mem:
peak_mem = mem
print('peak memory = %.3g MB' % (peak_mem / (1024 * 1024)))
print(f'peak memory = {peak_mem / (1024 * 1024):.1f} MB')
if mem != 0:
print('leak! final memory = %.3g MB' % (mem / (1024 * 1024)))
print(f'leak! final memory = {mem / (1024 * 1024):.1f} MB')
# does a list of events contain an overlap?
# assume the list of events has been sorted by start time
@ -253,6 +252,20 @@ def gates_overlap(events, gate_name1, gate_name2):
return events_overlap(merged)
# show top 10 waits
wait = {}
for thread in threads:
for event in thread.all_events:
if event.wait:
if event.gate_location not in wait:
wait[event.gate_location] = 0
wait[event.gate_location] += event.stop - event.start
print('name wait')
for [name, time] in sorted(wait.items(), reverse=True, key=lambda x: x[1])[:10]:
print(f'{name:>30}\t{time:.2f}')
# allocate a y position for each gate
total_y = 0
for thread in threads: