littlefs-project/littlefs
1
0
Fork 0
mirror of https://github.com/littlefs-project/littlefs.git synced 2025-10-24 03:32:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added scripts/stack.py for viewing stack usage

Browse Source 
Note this detects loops (recursion), and renders this as infinity.
Currently littlefs does have a single recursive function and you can see
how this infects the full call graph. Eventually this should be removed.
This commit is contained in:
Christopher Haster
2022-02-20 10:51:01 -06:00
parent 20c58dcbaa
commit f4c7af76f8
6 changed files with 370 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
scripts/code.py
View File

@@ -162,7 +162,8 @@ def main(**args):
print_header(by='%s (%d added, %d removed)' % (by,
sum(1 for old, _, _, _ in diff.values() if not old),
sum(1 for _, new, _, _ in diff.values() if not new)))
for name, (old, new, diff, ratio) in sorted_diff_entries(diff.items()):
for name, (old, new, diff, ratio) in sorted_diff_entries(
diff.items()):
if ratio or args.get('all'):
print("%-36s %7s %7s %+7d%s" % (name,
old or "-",