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