which must be a Dis object file,
and finds all unique strings in it that end in
It takes each such string as the name of a Dis file, and
if the file exists, it does the same for it, and so on, recursively.
It writes each unique name to the standard output.
The result is a list of all statically-named Dis files that might be referenced by
an application, typically as the operand of a Limbo
Several options change or extend the output:
Print all names as they are encountered in the search, including duplicates.
Indent to show the dependency structure.
Show only the immediate (outermost) dependencies of each
Print the dependency relation as pairs:
a file, a space, and the name of a file on which it depends.
Only the the first name is printed when a file depends on no other.
This format is useful as input to
dependency generators, or dependency graphing programs.
Include strings of the form
on the assumption
they are the names of system modules loaded by the application.