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