Changed my mind about the design again, now callback is dirtree_opennode() and recursion choice is how caller interprets flags.

1 files changed, 12 insertions, 13 deletions

diff --git a/lib/dirtree.c b/lib/dirtree.c
index 01e0ea8c..291f99a4 100644
--- a/lib/dirtree.c
+++ b/lib/dirtree.c
@@ -78,21 +78,20 @@ int dirtree_notdotdot(struct dirtree *catch)
 	return DIRTREE_SAVE|DIRTREE_RECURSE;
 }
 
-// depth first recursion
-int dirtree_comeagain(struct dirtree *try, int recurse)
+// get open filehandle for node in extra, giving caller the option of
+// using DIRTREE_COMEAGAIN or not.
+int dirtree_opennode(struct dirtree *try)
 {
-	int ret = dirtree_notdotdot(try);
-	if (ret) {
-		if (S_ISDIR(try->st.st_mode)) {
-			if (!try->extra) {
-				try->extra = xdup(try->data);
-				if (recurse) return DIRTREE_COMEAGAIN;
-			}
-		} else try->extra = openat(try->parent ? try->parent->data : AT_FDCWD,
-			try->name, 0);
-	}
+	if (!dirtree_notdotdot(try)) return 0;
+	if (S_ISDIR(try->st.st_mode)) {
+		if (!try->extra) {
+			try->extra = xdup(try->data);
+			return DIRTREE_COMEAGAIN;
+		}
+	} else try->extra = openat(try->parent ? try->parent->data : AT_FDCWD,
+		try->name, 0);
 
-	return ret;
+	return DIRTREE_SAVE|DIRTREE_RECURSE;
 }
 
 // Handle callback for a node in the tree. Returns saved node(s) or NULL.