+ return deps1;
+}
+
+char **get_libs(const void *ctx, const char *dir, const char *style,
+ char *(*get_info)(const void *ctx, const char *dir))
+{
+ char **deps, **libs;
+ unsigned int i, len;
+
+ libs = get_one_libs(ctx, dir, get_info);
+ len = tal_count(libs);
+
+ if (style) {
+ deps = get_deps(ctx, dir, style, true, get_info);
+ if (streq(style, "testdepends"))
+ deps = add_deps(deps,
+ get_deps(ctx, dir, "depends", true,
+ get_info));
+
+ for (i = 0; deps[i]; i++) {
+ char **newlibs, *subdir;
+ size_t newlen;
+
+ if (!strstarts(deps[i], "ccan/"))
+ continue;
+
+ subdir = path_join(ctx, find_ccan_dir(dir), deps[i]);
+
+ newlibs = get_one_libs(ctx, subdir, get_info);
+ newlen = tal_count(newlibs);
+ tal_resize(&libs, len + newlen);
+ memcpy(&libs[len], newlibs,
+ sizeof(newlibs[0])*newlen);
+ len += newlen;
+ }
+ }
+
+ /* Append NULL entry. */
+ tal_resize(&libs, len + 1);
+ libs[len] = NULL;
+ return libs;
+}
+
+/* FIXME: This is O(n^2), which is dumb. */
+static char **uniquify_deps(char **deps)
+{
+ unsigned int i, j, num;
+
+ if (!deps)
+ return NULL;
+
+ num = tal_count(deps) - 1;
+ for (i = 0; i < num; i++) {
+ for (j = i + 1; j < num; j++) {
+ if (streq(deps[i], deps[j])) {
+ memmove(&deps[j], &deps[j+1],
+ (num - j - 1) * sizeof(char *));
+ num--;
+ }
+ }
+ }
+ deps[num] = NULL;
+ /* Make sure tal_count() works */
+ tal_resize(&deps, num + 1);
+ return deps;
+}
+
+char **get_deps(const void *ctx, const char *dir, const char *style,
+ bool recurse,
+ char *(*get_info)(const void *ctx, const char *dir))
+{
+ char **ret;
+
+ if (!recurse) {
+ ret = get_one_deps(ctx, dir, style, get_info);
+ } else
+ ret = get_all_deps(ctx, dir, style, get_info, get_one_deps);
+
+ return uniquify_deps(ret);