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