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 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)tree.c 8.3 (Berkeley) 4/2/94
34 * $FreeBSD: src/usr.bin/ctags/tree.c,v 1.2.6.2 2002/07/30 00:55:07 tjr Exp $
35 * $DragonFly: src/usr.bin/ctags/tree.c,v 1.2 2003/06/17 04:29:25 dillon Exp $
46 static void add_node(NODE *, NODE *);
47 static void free_tree(NODE *);
51 * enter a new node in the tree
54 pfnote(const char *name, int ln)
61 if (!(np = (NODE *)malloc(sizeof(NODE)))) {
62 warnx("too many entries to sort");
66 if (!(head = np = (NODE *)malloc(sizeof(NODE))))
67 errx(1, "out of space");
69 if (!xflag && !strcmp(name, "main")) {
70 if (!(fp = strrchr(curfile, '/')))
74 (void)snprintf(nbuf, sizeof(nbuf), "M%s", fp);
75 fp = strrchr(nbuf, '.');
80 if (!(np->entry = strdup(name)))
84 np->left = np->right = 0;
85 if (!(np->pat = strdup(lbuf)))
94 add_node(NODE *node, NODE *cur_node)
98 dif = strcoll(node->entry, cur_node->entry);
100 if (node->file == cur_node->file) {
102 fprintf(stderr, "Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node->file, lineno, node->entry);
105 if (!cur_node->been_warned)
107 fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry);
108 cur_node->been_warned = YES;
112 add_node(node, cur_node->left);
114 cur_node->left = node;
115 else if (cur_node->right)
116 add_node(node, cur_node->right);
118 cur_node->right = node;
122 free_tree(NODE *node)
126 free_tree(node->right);