2 * Copyright (c) 1989, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Michael Rendell of Memorial University of Newfoundland.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * $FreeBSD: src/usr.bin/tsort/tsort.c,v 1.10.2.1 2001/03/04 09:18:23 kris Exp $
37 * $DragonFly: src/usr.bin/tsort/tsort.c,v 1.3 2003/10/04 20:36:53 hmp Exp $
39 * @(#) Copyright (c) 1989, 1993, 1994 The Regents of the University of California. All rights reserved.
40 * @(#)tsort.c 8.3 (Berkeley) 5/4/95
43 #include <sys/types.h>
56 * Topological sort. Input is a list of pairs of strings separated by
57 * white space (spaces, tabs, and/or newlines); strings are written to
58 * standard output in sorted order, one per line.
61 * tsort [-dlq] [inputfile]
62 * If no input file is specified, standard input is read.
64 * Should be compatible with AT&T tsort HOWEVER the output is not identical
65 * (i.e. for most graphs there is more than one sorted order, and this tsort
66 * usually generates a different one then the AT&T tsort). Also, cycle
67 * reporting seems to be more accurate in this version (the AT&T tsort
68 * sometimes says a node is in a cycle when it isn't).
70 * Michael Rendell, michael@stretch.cs.mun.ca - Feb 26, '90
72 #define HASHSIZE 53 /* doesn't need to be big */
73 #define NF_MARK 0x1 /* marker for cycle detection */
74 #define NF_ACYCLIC 0x2 /* this node is cycle free */
75 #define NF_NODEST 0x4 /* Unreachable */
78 typedef struct node_str NODE;
81 NODE **n_prevp; /* pointer to previous node's n_next */
82 NODE *n_next; /* next node in graph */
83 NODE **n_arcs; /* array of arcs to other nodes */
84 int n_narcs; /* number of arcs in n_arcs[] */
85 int n_arcsize; /* size of n_arcs[] array */
86 int n_refcnt; /* # of arcs pointing to this node */
87 int n_flags; /* NF_* */
88 char n_name[1]; /* name of this node */
97 NODE *graph, **cycle_buf, **longest_cycle;
98 int debug, longest, quiet;
100 void add_arc(char *, char *);
101 int find_cycle(NODE *, NODE *, int, int);
102 NODE *get_node(char *);
103 void *grow_buf(void *, int);
104 void remove_node(NODE *);
109 main(int argc, char **argv)
114 int bsize, ch, nused;
117 while ((ch = getopt(argc, argv, "dlq")) != -1)
140 if ((fp = fopen(*argv, "r")) == NULL)
147 for (b = bufs, n = 2; --n >= 0; b++)
148 b->b_buf = grow_buf(NULL, b->b_bsize = 1024);
150 /* parse input and build the graph */
151 for (n = 0, c = getc(fp);;) {
152 while (c != EOF && isspace(c))
161 b->b_buf[nused++] = c;
163 b->b_buf = grow_buf(b->b_buf, bsize *= 2);
165 } while (c != EOF && !isspace(c));
167 b->b_buf[nused] = '\0';
170 add_arc(bufs[0].b_buf, bufs[1].b_buf);
175 errx(1, "odd data count");
182 /* double the size of oldbuf and return a pointer to the new buffer. */
184 grow_buf(void *bp, int size)
186 if ((bp = realloc(bp, (u_int)size)) == NULL)
192 * add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
193 * the graph, then add them.
196 add_arc(char *s1, char *s2)
210 * Check if this arc is already here.
212 for (i = 0; i < n1->n_narcs; i++)
213 if (n1->n_arcs[i] == n2)
218 if (n1->n_narcs == n1->n_arcsize) {
221 bsize = n1->n_arcsize * sizeof(*n1->n_arcs) * 2;
222 n1->n_arcs = grow_buf(n1->n_arcs, bsize);
223 n1->n_arcsize = bsize / sizeof(*n1->n_arcs);
225 n1->n_arcs[n1->n_narcs++] = n2;
229 /* Find a node in the graph (insert if not found) and return a pointer to it. */
237 (db = dbopen(NULL, O_RDWR, 0, DB_HASH, NULL)) == NULL)
238 err(1, "db: %s", name);
241 key.size = strlen(name) + 1;
243 switch ((*db->get)(db, &key, &data, 0)) {
245 bcopy(data.data, &n, sizeof(n));
251 err(1, "db: %s", name);
254 if ((n = malloc(sizeof(NODE) + key.size)) == NULL)
262 bcopy(name, n->n_name, key.size);
264 /* Add to linked list. */
265 if ((n->n_next = graph) != NULL)
266 graph->n_prevp = &n->n_next;
270 /* Add to hash table. */
272 data.size = sizeof(n);
273 if ((*db->put)(db, &key, &data, 0))
274 err(1, "db: %s", name);
280 * Clear the NODEST flag from all nodes.
287 for (n = graph; n != NULL; n = n->n_next)
288 n->n_flags &= ~NF_NODEST;
291 /* do topological sort on graph */
295 register NODE *n, *next;
298 while (graph != NULL) {
300 * Keep getting rid of simple cases until there are none left,
301 * if there are any nodes still in the graph, then there is
305 for (cnt = 0, n = graph; n != NULL; n = next) {
307 if (n->n_refcnt == 0) {
312 } while (graph != NULL && cnt);
319 * Allocate space for two cycle logs - one to be used
320 * as scratch space, the other to save the longest
323 for (cnt = 0, n = graph; n != NULL; n = n->n_next)
325 cycle_buf = malloc((u_int)sizeof(NODE *) * cnt);
326 longest_cycle = malloc((u_int)sizeof(NODE *) * cnt);
327 if (cycle_buf == NULL || longest_cycle == NULL)
330 for (n = graph; n != NULL; n = n->n_next)
331 if (!(n->n_flags & NF_ACYCLIC)) {
332 if ((cnt = find_cycle(n, n, 0, 0))) {
334 warnx("cycle in data");
335 for (i = 0; i < cnt; i++)
337 longest_cycle[i]->n_name);
343 /* to avoid further checks */
344 n->n_flags |= NF_ACYCLIC;
350 errx(1, "internal error -- could not find cycle");
354 /* print node and remove from graph (does not actually free node) */
356 remove_node(register NODE *n)
361 (void)printf("%s\n", n->n_name);
362 for (np = n->n_arcs, i = n->n_narcs; --i >= 0; np++)
365 *n->n_prevp = n->n_next;
367 n->n_next->n_prevp = n->n_prevp;
371 /* look for the longest? cycle from node from to node to. */
373 find_cycle(NODE *from, NODE *to, int longest_len, int depth)
379 * avoid infinite loops and ignore portions of the graph known
382 if (from->n_flags & (NF_NODEST|NF_MARK|NF_ACYCLIC))
384 from->n_flags |= NF_MARK;
386 for (np = from->n_arcs, i = from->n_narcs; --i >= 0; np++) {
387 cycle_buf[depth] = *np;
389 if (depth + 1 > longest_len) {
390 longest_len = depth + 1;
391 (void)memcpy((char *)longest_cycle,
393 longest_len * sizeof(NODE *));
396 if ((*np)->n_flags & (NF_MARK|NF_ACYCLIC|NF_NODEST))
398 len = find_cycle(*np, to, longest_len, depth + 1);
401 (void)printf("%*s %s->%s %d\n", depth, "",
402 from->n_name, to->n_name, len);
405 (*np)->n_flags |= NF_NODEST;
407 if (len > longest_len)
410 if (len > 0 && !longest)
414 from->n_flags &= ~NF_MARK;
415 return (longest_len);
421 (void)fprintf(stderr, "usage: tsort [-dlq] [file]\n");