Github/littlefs
1
Fork 0
Code Actions Activity

Tweaked dbgrbyd.py to show -1 tag rids

Browse Source
This commit is contained in:
Christopher Haster
2023-10-02 00:14:23 -05:00
parent 8c0f99890d
commit a2aa25aa8e
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
scripts/dbgrbyd.py
+2 -2
View File
@@ -803,7 +803,7 @@ def dbg_tree(data, block_size, rev, trunk, weight, *,
w_width = 2*m.ceil(m.log10(max(1, weight)+1))+1 w_width = 2*m.ceil(m.log10(max(1, weight)+1))+1
rid, tag = -1, 0 rid, tag = -1, 0
while True: for i in it.count():
done, rid, tag, w, j, d, size, path = lookup(rid, tag+0x1) done, rid, tag, w, j, d, size, path = lookup(rid, tag+0x1)
# found end of tree? # found end of tree?
if done: if done:
@@ -816,7 +816,7 @@ def dbg_tree(data, block_size, rev, trunk, weight, *,
'%*s %-22s%s' % ( '%*s %-22s%s' % (
w_width, '%d-%d' % (rid-(w-1), rid) w_width, '%d-%d' % (rid-(w-1), rid)
if w > 1 else rid if w > 1 else rid
if w > 0 else '', if w > 0 or i == 0 else '',
tagrepr(tag, w, size, j), tagrepr(tag, w, size, j),
' %s' % next(xxd( ' %s' % next(xxd(
data[j+d:j+d+min(size, 8)], 8), '') data[j+d:j+d+min(size, 8)], 8), '')