dtree

чување 25b3358f3be1f4f2eadc38108abe75ae9c8d6f20
родитељ 8d1f4ff1729beddab94f3600facfae37f09cae34
Аутор: Страхиња Радић <sr@strahinja.org>
Датум:   Tue, 23 Sep 2025 17:23:36 +0200

dtree.1.in: Fix findmnt example

Diffstat:
M
dtree.1.in
 | 
23
+++++++++++++++--------

измењених датотека: 1, додавања: 15(+), брисања: 8(-)
diff --git a/dtree.1.in b/dtree.1.in
@@ -75,29 +75,36 @@ poor man's
 active):
 .Bd -literal
 LC_ALL=C sort -k2 /proc/mounts |
-awk '{				# pp = previous pointer
+awk 'BEGIN{ pp=0 } {		# pp = previous pointer
 	sl = $2;
 	gsub("[^/]", "", sl);
 	slashc = length(sl);	# slash count
 	if ($2 != "/" &&
-		slashc > prevsc[pp] &&
 		substr($2,0,length(prev[pp])) == prev[pp])
 	{
-		for (i = 0; i < pp+1; i++)
+		if (prev[pp] == "/" || slashc > prevsc[pp])
+			pp++;
+		for (i = 0; i < pp; i++)
 			printf "\et";
-		pp++;
+		prev[pp] = $2;		# previous mountpoint
+		prevsc[pp] = slashc;	# previous slash count
 	}
 	else if ($2 != "/")
 	{
 		if (slashc < prevsc[pp] &&
-			substr($2,0,length(prev[pp])) != prev[pp])
+			substr($2,0,length(prev[pp-1])) != prev[pp-1])
 			pp--;
-		for (i = 0; i < pp+1; i++)
+		prev[pp] = $2;
+		prevsc[pp] = slashc;
+		for (i = 0; i < pp; i++)
 			printf "\et";
 	}
+	else
+	{
+		prev[pp] = $2;
+		prevsc[pp] = slashc;
+	}
 	print $2;
-	prev[pp] = $2;		# previous mountpoint
-	prevsc[pp] = slashc;	# previous slash count
 }' |
 dtree
 .Ed