Lines Matching defs:deps
799 struct array deps; /* struct symbol */
829 array_free_array(&mod->deps);
848 err = array_append_unique(&mod->deps, sym->owner);
941 array_init(&mod->deps, 4);
1453 if (m->deps.count > 1)
1454 array_sort(&m->deps, dep_cmp);
1579 if (m->deps.count == 0) {
1594 itr = (struct mod **) m->deps.array;
1595 itr_end = itr + m->deps.count;
1722 itr_dst = (const struct mod **)src->deps.array;
1723 itr_dst_end = itr_dst + src->deps.count;
1773 for (i = 0; i < mod->deps.count; i++) {
1774 const struct mod *d = mod->deps.array[i];
1780 static int mod_fill_all_unique_dependencies(const struct mod *mod, const struct mod **deps, size_t n_deps, size_t *last)
1784 for (i = 0; i < mod->deps.count; i++) {
1785 const struct mod *d = mod->deps.array[i];
1790 if (deps[j] == d) {
1801 deps[*last] = d;
1803 err = mod_fill_all_unique_dependencies(d, deps, n_deps, last);
1812 const struct mod **deps;
1819 deps = malloc(sizeof(struct mod *) * (*n_deps));
1820 if (deps == NULL)
1823 if (mod_fill_all_unique_dependencies(mod, deps, *n_deps, &last) < 0) {
1824 free(deps);
1828 qsort(deps, last, sizeof(struct mod *), dep_cmp);
1830 return deps;
1845 const struct mod **deps, *mod = depmod->modules.array[i];
1851 if (mod->deps.count == 0)
1854 deps = mod_get_all_sorted_dependencies(mod, &n_deps);
1855 if (deps == NULL) {
1861 const struct mod *d = deps[j];
1864 free(deps);
1885 const struct mod **deps, *mod = depmod->modules.array[i];
1891 deps = mod_get_all_sorted_dependencies(mod, &n_deps);
1892 if (deps == NULL && n_deps > 0) {
1899 const struct mod *d = deps[j];
1905 free(deps);
1906 ERR("modules.deps.bin: out of memory\n");
1918 const struct mod *d = deps[j];
1933 WRN("duplicate module deps:\n%s\n", line);
1935 free(deps);