• Source: Tsort

      • The tsort program is a command line utility on Unix and Unix-like platforms, that performs a topological sort on its input. As of 2017, it is part of the POSIX.1 standard.


      History


      According to its info page, this command was initially written for providing an ordering of object files that allowed the linker to process them sequentially (each one exactly once, and in order). The FreeBSD manual page dates its appearance to Version 7 Unix.
      Note that the following description is describing the behavior of the FreeBSD implementation of tsort and mentions GNU features where they may exist. Other implementations or versions may differ.


      Syntax


      tsort [-dlq] [FILE]

      FreeBSD options can be:

      -d turn on debugging
      -l search for and display the longest cycle.
      -q Do not display informational messages about cycles.

      GNU provides the following options only:

      --help display help message and exit
      --version display version information and exit

      There are no options prescribed by POSIX.


      Behavior


      tsort reads its input (from the given FILE, or standard input if no input file is given or for a FILE of '-') as pairs of strings, separated by blanks, indicating a partial ordering. The output is a total ordering that corresponds to the given partial ordering.
      In other words: for a directed acyclic graph (used as a dependency graph), tsort produces a listing of the
      vertices so that for all edges 'a->b', 'a' comes before 'b' in the listing.


      Examples


      tsort lists the vertices of a directed acyclic graph in such an order that all ordering/direction relations are respected:


      = Call graph

      =
      tsort can help rearranging functions in a source file so that as many as possible are defined before they are used (Interpret the following as: main() calls parse_options(), tail_file() and tail_forever(); tail_file() calls pretty_name(), and so on. The result is that dump_remainder() should be defined first, start_lines() second, etc.):


      = Library

      =
      The traditional ld (Unix linker) requires that its library inputs be sorted in topological order, since it processes files in a single pass. This applies both to static libraries (*.a) and dynamic libraries (*.so), and in the case of static libraries preferably for the individual object files contained within.
      BSD UNIX uses tsort as a common part of the typical ar & ranlib command invocations (from /usr/share/mk/bsd.lib.mk):

      Here lorder ("library order") is used to generate the inter-file dependency list by inspecting the symbol table.


      Usage notes


      Notice the interchangeability of white space separators so the following inputs are equivalent:

      Pairs of identical items indicate presence of a vertex, but not ordering (so the following represents one vertex without edges):

      a a

      Strictly speaking there is no topological ordering of a graph that contains one or more cycles. However tsort prints a warning and GNU tsort prints the detected cycles to standard error (lines beginning with 'tsort:'):


      See also



      Sort (Unix)
      Make (software)
      Topological sorting
      List of Unix commands
      Call graph


      References




      = Further reading

      =
      Knuth, Donald E. (1997). The Art of Computer Programming. Vol. 1 (3rd ed.). pp. 261–268. ISBN 0-201-89683-4.
      Kahn, A.B. (1962). "Topological sorting of large networks". Communications of the ACM. 5 (11): 558–562. doi:10.1145/368996.369025. S2CID 16728233.


      External links


      manual page of tsort on

      FreeBSD,
      OpenBSD,
      NetBSD,
      AIX,
      Solaris,
      HP-UX
      dep-trace Orders basic dependencies and unfolds nested ones. (basic: without 2D graphical presumption)

    Kata Kunci Pencarian: