1/*
2 * Copyright (c) 1987, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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.
20 *
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
31 * SUCH DAMAGE.
32 */
33
34#include <sys/cdefs.h>
35
36__FBSDID("$FreeBSD: head/usr.bin/ctags/tree.c 87249 2001-12-03 00:07:59Z markm $");
37
38#ifndef lint
39static const char sccsid[] = "@(#)tree.c 8.3 (Berkeley) 4/2/94";
40#endif
41
42#include <err.h>
43#include <limits.h>
44#include <stdio.h>
45#include <stdlib.h>
46#include <string.h>
47
48#include "ctags.h"
49
50static void add_node __P((NODE *, NODE *));
51static void free_tree __P((NODE *));
52
53/*
54 * pfnote --
55 * enter a new node in the tree
56 */
57void
58pfnote(name, ln)
59 const char *name;
60 int ln;
61{
62 NODE *np;
63 char *fp;
64 char nbuf[MAXTOKEN];
65
66 /*NOSTRICT*/
67 if (!(np = (NODE *)malloc(sizeof(NODE)))) {
68 warnx("too many entries to sort");
69 put_entries(head);
70 free_tree(head);
71 /*NOSTRICT*/
72 if (!(head = np = (NODE *)malloc(sizeof(NODE))))
73 err(1, "out of space");
74 }
75 if (!xflag && !strcmp(name, "main")) {
76 if (!(fp = strrchr(curfile, '/')))
77 fp = curfile;
78 else
79 ++fp;
80 (void)sprintf(nbuf, "M%s", fp);
81 fp = strrchr(nbuf, '.');
82 if (fp && !fp[2])
83 *fp = EOS;
84 name = nbuf;
85 }
86 if (!(np->entry = strdup(name)))
87 err(1, NULL);
88 np->file = curfile;
89 np->lno = ln;
90 np->left = np->right = 0;
91 if (!(np->pat = strdup(lbuf)))
92 err(1, NULL);
93 if (!head)
94 head = np;
95 else
96 add_node(np, head);
97}
98
99static void
100add_node(node, cur_node)
101 NODE *node,
102 *cur_node;
103{
104 int dif;
105
106 dif = strcmp(node->entry, cur_node->entry);
107 if (!dif) {
108 if (node->file == cur_node->file) {
109 if (!wflag)
110 fprintf(stderr, "Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node->file, lineno, node->entry);
111 return;
112 }
113 if (!cur_node->been_warned)
114 if (!wflag)
115 fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry);
116 cur_node->been_warned = YES;
117 }
118 else if (dif < 0)
119 if (cur_node->left)
120 add_node(node, cur_node->left);
121 else
122 cur_node->left = node;
123 else if (cur_node->right)
124 add_node(node, cur_node->right);
125 else
126 cur_node->right = node;
127}
128
129static void
130free_tree(node)
131 NODE *node;
132{
133 while (node) {
134 if (node->right)
135 free_tree(node->right);
136 free(node);
137 node = node->left;
138 }
139}