Annotation of src/usr.bin/ctags/tree.c, Revision 1.7
1.7 ! tom 1: /* $OpenBSD: tree.c,v 1.6 2003/06/12 20:58:09 deraadt Exp $ */
1.1 deraadt 2: /* $NetBSD: tree.c,v 1.4 1995/03/26 20:14:11 glass Exp $ */
3:
4: /*
5: * Copyright (c) 1987, 1993, 1994
6: * The Regents of the University of California. All rights reserved.
7: *
8: * Redistribution and use in source and binary forms, with or without
9: * modification, are permitted provided that the following conditions
10: * are met:
11: * 1. Redistributions of source code must retain the above copyright
12: * notice, this list of conditions and the following disclaimer.
13: * 2. Redistributions in binary form must reproduce the above copyright
14: * notice, this list of conditions and the following disclaimer in the
15: * documentation and/or other materials provided with the distribution.
1.5 millert 16: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 17: * may be used to endorse or promote products derived from this software
18: * without specific prior written permission.
19: *
20: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30: * SUCH DAMAGE.
31: */
32:
33: #ifndef lint
34: #if 0
35: static char sccsid[] = "@(#)tree.c 8.3 (Berkeley) 4/2/94";
36: #else
1.7 ! tom 37: static char rcsid[] = "$OpenBSD: tree.c,v 1.6 2003/06/12 20:58:09 deraadt Exp $";
1.1 deraadt 38: #endif
39: #endif /* not lint */
40:
41: #include <err.h>
42: #include <limits.h>
43: #include <stdio.h>
44: #include <stdlib.h>
45: #include <string.h>
1.3 deraadt 46: #include <sys/dirent.h>
1.1 deraadt 47:
48: #include "ctags.h"
49:
1.4 millert 50: static void add_node(NODE *, NODE *);
51: static void free_tree(NODE *);
1.1 deraadt 52:
53: /*
54: * pfnote --
55: * enter a new node in the tree
56: */
57: void
1.6 deraadt 58: pfnote(char *name, int ln)
1.1 deraadt 59: {
60: NODE *np;
61: char *fp;
1.3 deraadt 62: char nbuf[1+MAXNAMLEN+1];
1.1 deraadt 63:
64: /*NOSTRICT*/
65: if (!(np = (NODE *)malloc(sizeof(NODE)))) {
66: warnx("too many entries to sort");
67: put_entries(head);
68: free_tree(head);
69: /*NOSTRICT*/
70: if (!(head = np = (NODE *)malloc(sizeof(NODE))))
1.7 ! tom 71: err(1, NULL);
1.1 deraadt 72: }
73: if (!xflag && !strcmp(name, "main")) {
74: if (!(fp = strrchr(curfile, '/')))
75: fp = curfile;
76: else
77: ++fp;
1.3 deraadt 78: (void)snprintf(nbuf, sizeof nbuf, "M%s", fp);
1.1 deraadt 79: fp = strrchr(nbuf, '.');
80: if (fp && !fp[2])
81: *fp = EOS;
82: name = nbuf;
83: }
84: if (!(np->entry = strdup(name)))
85: err(1, NULL);
86: np->file = curfile;
87: np->lno = ln;
88: np->left = np->right = 0;
89: if (!(np->pat = strdup(lbuf)))
90: err(1, NULL);
91: if (!head)
92: head = np;
93: else
94: add_node(np, head);
95: }
96:
97: static void
1.6 deraadt 98: add_node(NODE *node, NODE *cur_node)
1.1 deraadt 99: {
100: int dif;
101:
102: dif = strcmp(node->entry, cur_node->entry);
103: if (!dif) {
104: if (node->file == cur_node->file) {
105: if (!wflag)
106: fprintf(stderr, "Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node->file, lineno, node->entry);
107: return;
108: }
109: if (!cur_node->been_warned)
110: if (!wflag)
111: fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry);
112: cur_node->been_warned = YES;
113: }
114: else if (dif < 0)
115: if (cur_node->left)
116: add_node(node, cur_node->left);
117: else
118: cur_node->left = node;
119: else if (cur_node->right)
120: add_node(node, cur_node->right);
121: else
122: cur_node->right = node;
123: }
124:
125: static void
1.6 deraadt 126: free_tree(NODE *node)
1.1 deraadt 127: {
128: while (node) {
129: if (node->right)
130: free_tree(node->right);
131: free(node);
132: node = node->left;
133: }
134: }
![[BACK]](/icons/back.gif){kind=icon}
Return to tree.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / ctags