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. 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.
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
29 * @(#)tree.c 8.3 (Berkeley) 4/2/94
30 * $FreeBSD: head/usr.bin/ctags/tree.c 216370 2010-12-11 08:32:16Z joel $
41 static void add_node(NODE
*, NODE
*);
42 static void free_tree(NODE
*);
46 * enter a new node in the tree
49 pfnote(const char *name
, int ln
)
56 if (!(np
= (NODE
*)malloc(sizeof(NODE
)))) {
57 warnx("too many entries to sort");
61 if (!(head
= np
= (NODE
*)malloc(sizeof(NODE
))))
62 errx(1, "out of space");
64 if (!xflag
&& !strcmp(name
, "main")) {
65 if (!(fp
= strrchr(curfile
, '/')))
69 snprintf(nbuf
, sizeof(nbuf
), "M%s", fp
);
70 fp
= strrchr(nbuf
, '.');
75 if (!(np
->entry
= strdup(name
)))
79 np
->left
= np
->right
= 0;
80 if (!(np
->pat
= strdup(lbuf
)))
89 add_node(NODE
*node
, NODE
*cur_node
)
93 dif
= strcoll(node
->entry
, cur_node
->entry
);
95 if (node
->file
== cur_node
->file
) {
97 fprintf(stderr
, "Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node
->file
, lineno
, node
->entry
);
100 if (!cur_node
->been_warned
)
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
= YES
;
107 add_node(node
, cur_node
->left
);
109 cur_node
->left
= node
;
110 else if (cur_node
->right
)
111 add_node(node
, cur_node
->right
);
113 cur_node
->right
= node
;
117 free_tree(NODE
*node
)
123 free_tree(node
->right
);