2 * Copyright (c) 1987, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 static char sccsid[] = "@(#)tree.c 8.3 (Berkeley) 4/2/94";
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
47 static void add_node(NODE *, NODE *);
48 static void free_tree(NODE *);
52 * enter a new node in the tree
55 pfnote(const char *name, int ln)
62 if (!(np = (NODE *)malloc(sizeof(NODE)))) {
63 warnx("too many entries to sort");
67 if (!(head = np = (NODE *)malloc(sizeof(NODE))))
68 errx(1, "out of space");
70 if (!xflag && !strcmp(name, "main")) {
71 if (!(fp = strrchr(curfile, '/')))
75 (void)snprintf(nbuf, sizeof(nbuf), "M%s", fp);
76 fp = strrchr(nbuf, '.');
81 if (!(np->entry = strdup(name)))
85 np->left = np->right = 0;
86 if (!(np->pat = strdup(lbuf)))
95 add_node(NODE *node, NODE *cur_node)
99 dif = strcoll(node->entry, cur_node->entry);
101 if (node->file == cur_node->file) {
103 fprintf(stderr, "Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node->file, lineno, node->entry);
106 if (!cur_node->been_warned)
108 fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry);
109 cur_node->been_warned = YES;
113 add_node(node, cur_node->left);
115 cur_node->left = node;
116 else if (cur_node->right)
117 add_node(node, cur_node->right);
119 cur_node->right = node;
123 free_tree(NODE *node)
128 free_tree(node->right);
129 node_next = node->left;