Lines Matching refs:deps
93 struct dso **deps, *needed_by;
319 struct dso **deps = use_deps ? dso->deps : 0;
320 for (; dso; dso=use_deps ? *deps++ : dso->syms_next) {
1307 if (p->deps) return;
1314 /* Use builtin buffer for apps with no external deps, to
1316 p->deps = (p==head && cnt<2) ? builtin_deps :
1317 calloc(cnt+1, sizeof *p->deps);
1318 if (!p->deps) {
1324 p->deps[cnt++] = q;
1334 p->deps[cnt++] = dep;
1336 p->deps[cnt] = 0;
1342 if (p->deps) return;
1352 /* Can't use realloc if the original p->deps was allocated at
1354 * the builtin non-allocated trivial main program deps array. */
1356 || p->deps == builtin_deps;
1361 /* Mark existing (direct) deps so they won't be duplicated. */
1362 for (i=0; p->deps[i]; i++)
1363 p->deps[i]->mark = 1;
1369 for (i=0; p->deps[i]; i++) {
1370 struct dso *dep = p->deps[i];
1372 if (!dep->deps[j]->mark) cnt++;
1375 realloc(p->deps, sizeof(*tmp) * (ndeps_all+cnt+1));
1382 memcpy(tmp, p->deps, sizeof(*tmp) * (ndeps_all+1));
1385 p->deps = tmp;
1387 if (dep->deps[j]->mark) continue;
1388 dep->deps[j]->mark = 1;
1389 p->deps[ndeps_all++] = dep->deps[j];
1391 p->deps[ndeps_all] = 0;
1559 /* Bound on queue size is the total number of indirect deps.
1560 * If a bfs deps list was built, we can use it. Otherwise,
1564 for (cnt=0; dso->deps[cnt]; cnt++)
1565 dso->deps[cnt]->mark = 0;
1566 cnt++; /* self, not included in deps */
1593 /* Then perform pseudo-DFS sort, but ignoring circular deps. */
1597 if (p->deps[p->next_dep]->mark) {
1601 p = p->deps[p->next_dep];
2015 ldso.deps = (struct dso **)no_deps;
2041 vdso.deps = (struct dso **)no_deps;
2215 free(p->deps);
2251 for (i=0; p->deps[i]; i++)
2252 if (!p->deps[i]->relocated)
2253 prepare_lazy(p->deps[i]);
2259 for (i=0; p->deps[i]; i++)
2260 add_syms(p->deps[i]);