rdep: Support for recursing optional Should-* dependencies

_recurse_deps now checks the sstart and sstop fields for each dep,
skipping when errors would occur if they were missing from the pool.

1 files changed, 9 insertions, 1 deletions

diff --git a/test/deps.c b/test/deps.c
index 4b4b4c1..7d408bd 100644
--- a/test/deps.c
+++ b/test/deps.c
@@ -11,7 +11,7 @@ static void print_sk_list(const dep_t *list, initd_sk_t sk);
 int main(int argc, char *argv[])
 {
 	initd_list_t *all;
-	initd_t *a, *b, *c, *d;
+	initd_t *a, *b, *c, *d, *r;
 	dep_t *startlist, *stoplist, *need;
 
 	a = initd_new("a");
@@ -25,20 +25,28 @@ int main(int argc, char *argv[])
 	initd_add_prov(b, "b");
 	initd_add_rstart(b, "c");
 	initd_add_rstop(b, "c");
+	initd_add_sstart(b, "q");
 
 	c = initd_new("c");
 	initd_add_prov(c, "c");
+	initd_add_sstop(b, "r");
 
 	d = initd_new("d");
 	initd_add_prov(d, "d");
 	initd_add_rstart(d, "c");
 	initd_add_rstop(d, "c");
 
+	r = initd_new("r");
+	initd_add_prov(r, "r");
+	initd_add_rstop(r, "d");
+	initd_add_sstop(r, "q");
+
 	all = initd_list_new();
 	initd_list_add(all, a);
 	initd_list_add(all, b);
 	initd_list_add(all, c);
 	initd_list_add(all, d);
+	initd_list_add(all, r);
 
 	need = dep_new();
 	dep_add(need, "a");