Lines Matching defs:deps
289 if (to_file->deps == 0)
290 to_file->deps = from_file->deps;
293 register struct dep *deps = to_file->deps;
294 while (deps->next != 0)
295 deps = deps->next;
296 deps->next = from_file->deps;
465 struct dep *old = f->deps;
471 f->deps = 0;
592 /* Add newly parsed deps to f->deps. If this is the last dependency
608 *d_ptr = f->deps;
609 f->deps = new;
614 for (d_ptr = &f->deps; *d_ptr; d_ptr = &(*d_ptr)->next)
663 for (d = f->deps; d != 0; d = d->next)
668 for (d = f->deps; d != 0; d = d->next)
673 for (d = f->deps; d != 0; d = d->next)
685 /* .INTERMEDIATE with deps listed
686 marks those deps as intermediate files. */
687 for (d = f->deps; d != 0; d = d->next)
690 /* .INTERMEDIATE with no deps does nothing.
697 /* .SECONDARY with deps listed
698 marks those deps as intermediate files
702 if (f->deps)
703 for (d = f->deps; d != 0; d = d->next)
706 /* .SECONDARY with no deps listed marks *all* files that way. */
721 if (f->deps == 0)
724 for (d = f->deps; d != 0; d = d->next)
732 if (f->deps == 0)
735 for (d = f->deps; d != 0; d = d->next)
891 /* Print all normal dependencies; note any order-only deps. */
892 for (d = f->deps; d != 0; d = d->next)
898 /* Print order-only deps, if we have any. */
