scripts: dbgbmap.py: Dropped parents, siblings, and traverse path
We don't use these in dbgbmap.py, so no reason to calculate them. (We do use them in dbgbmapd3.py, but that's a different script.)
This commit is contained in:
+2
-17
@@ -4451,9 +4451,8 @@ def main_(f, disk, mroots=None, *,
|
|||||||
mdir_count = 0
|
mdir_count = 0
|
||||||
btree_count = 0
|
btree_count = 0
|
||||||
data_count = 0
|
data_count = 0
|
||||||
for child, path in lfs.traverse(
|
for child in lfs.traverse(
|
||||||
mtree_only=mtree_only,
|
mtree_only=mtree_only):
|
||||||
path=True):
|
|
||||||
# track each block in our window
|
# track each block in our window
|
||||||
for b in child.blocks:
|
for b in child.blocks:
|
||||||
if b not in bmap:
|
if b not in bmap:
|
||||||
@@ -4507,20 +4506,6 @@ def main_(f, disk, mroots=None, *,
|
|||||||
else:
|
else:
|
||||||
bmap[b] = BmapBlock(b, type, child, usage)
|
bmap[b] = BmapBlock(b, type, child, usage)
|
||||||
|
|
||||||
# keep track of siblings
|
|
||||||
bmap[b].siblings.update(
|
|
||||||
b_ for b_ in child.blocks
|
|
||||||
if b_ != b and b_ in bmap)
|
|
||||||
|
|
||||||
# update parents with children
|
|
||||||
if path:
|
|
||||||
parent = path[-1][1]
|
|
||||||
for b in parent.blocks:
|
|
||||||
if b in bmap:
|
|
||||||
bmap[b].children.update(
|
|
||||||
b_ for b_ in child.blocks
|
|
||||||
if b_ in bmap)
|
|
||||||
|
|
||||||
# scale width/height if requested
|
# scale width/height if requested
|
||||||
if (to_scale is not None
|
if (to_scale is not None
|
||||||
and (width is None or height is None)):
|
and (width is None or height is None)):
|
||||||
|
|||||||
Reference in New Issue
Block a user