diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-19 03:13:10 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-19 03:13:10 +0000 |
commit | 3c57dd931145d43f2b0aef96c4d178135956bf91 (patch) | |
tree | 3de698981e9f0cc2c4f9569b19a5f3595e741f6b /tools/performance-log-deduce.py | |
parent | Initial commit. (diff) | |
download | gimp-3c57dd931145d43f2b0aef96c4d178135956bf91.tar.xz gimp-3c57dd931145d43f2b0aef96c4d178135956bf91.zip |
Adding upstream version 2.10.36.upstream/2.10.36
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'tools/performance-log-deduce.py')
-rwxr-xr-x | tools/performance-log-deduce.py | 91 |
1 files changed, 91 insertions, 0 deletions
diff --git a/tools/performance-log-deduce.py b/tools/performance-log-deduce.py new file mode 100755 index 0000000..1c6e059 --- /dev/null +++ b/tools/performance-log-deduce.py @@ -0,0 +1,91 @@ +#!/usr/bin/env python3 + +""" +performance-log-deduce.py -- Deduce GIMP performance log thread state +Copyright (C) 2018 Ell + +This program is free software: you can redistribute it and/or modify +it under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3 of the License, or +(at your option) any later version. + +This program is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +GNU General Public License for more details. + +You should have received a copy of the GNU General Public License +along with this program. If not, see <https://www.gnu.org/licenses/>. + + +Usage: performance-log-deduce.py < infile > outfile +""" + +DEDUCE_MIN_N_OCCURRENCES = 10 +DEDUCE_MIN_PERCENTAGE = 0.75 + +from xml.etree import ElementTree +import sys + +empty_element = ElementTree.Element ("") + +# Read performance log from STDIN +log = ElementTree.fromstring (sys.stdin.buffer.read ()) + +# Construct state histogram +address_states = {} + +for sample in (log.find ("samples") or empty_element).iterfind ("sample"): + threads = (sample.find ("backtrace") or empty_element).iterfind ("thread") + + for thread in threads: + running = int (thread.get ("running")) + + frame = thread.find ("frame") + + if frame is not None: + address = frame.get ("address") + + states = address_states.setdefault (address, [0, 0]) + + states[running] += 1 + +# Find maximal states +for address, states in list (address_states.items ()): + n = sum (states) + + if n >= DEDUCE_MIN_N_OCCURRENCES: + state = 0 + m = states[0] + + for i in range (1, len (states)): + if states[i] > m: + state = i + m = states[i] + + percentage = m / n + + if percentage >= DEDUCE_MIN_PERCENTAGE: + address_states[address] = state + else: + del address_states[address] + else: + del address_states[address] + +# Replace thread states +for sample in (log.find ("samples") or empty_element).iterfind ("sample"): + threads = (sample.find ("backtrace") or empty_element).iterfind ("thread") + + for thread in threads: + frame = thread.find ("frame") + + if frame is not None: + address = frame.get ("address") + + running = address_states.get (address, None) + + if running is not None: + thread.set ("running", str (running)) + +# Write performance log to STDOUT +sys.stdout.buffer.write (ElementTree.tostring (log)) |