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