Annotation of src/usr.bin/ctags/tree.c, Revision 1.5
1.5 ! millert 1: /* $OpenBSD: tree.c,v 1.4 2002/02/16 21:27:45 millert 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.5 ! millert 37: static char rcsid[] = "$OpenBSD: tree.c,v 1.4 2002/02/16 21:27:45 millert 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
58: pfnote(name, ln)
59: char *name;
60: int ln;
61: {
62: NODE *np;
63: char *fp;
1.3 deraadt 64: char nbuf[1+MAXNAMLEN+1];
1.1 deraadt 65:
66: /*NOSTRICT*/
67: if (!(np = (NODE *)malloc(sizeof(NODE)))) {
68: warnx("too many entries to sort");
69: put_entries(head);
70: free_tree(head);
71: /*NOSTRICT*/
72: if (!(head = np = (NODE *)malloc(sizeof(NODE))))
73: err(1, "out of space");
74: }
75: if (!xflag && !strcmp(name, "main")) {
76: if (!(fp = strrchr(curfile, '/')))
77: fp = curfile;
78: else
79: ++fp;
1.3 deraadt 80: (void)snprintf(nbuf, sizeof nbuf, "M%s", fp);
1.1 deraadt 81: fp = strrchr(nbuf, '.');
82: if (fp && !fp[2])
83: *fp = EOS;
84: name = nbuf;
85: }
86: if (!(np->entry = strdup(name)))
87: err(1, NULL);
88: np->file = curfile;
89: np->lno = ln;
90: np->left = np->right = 0;
91: if (!(np->pat = strdup(lbuf)))
92: err(1, NULL);
93: if (!head)
94: head = np;
95: else
96: add_node(np, head);
97: }
98:
99: static void
100: add_node(node, cur_node)
101: NODE *node,
102: *cur_node;
103: {
104: int dif;
105:
106: dif = strcmp(node->entry, cur_node->entry);
107: if (!dif) {
108: if (node->file == cur_node->file) {
109: if (!wflag)
110: fprintf(stderr, "Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node->file, lineno, node->entry);
111: return;
112: }
113: if (!cur_node->been_warned)
114: if (!wflag)
115: fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry);
116: cur_node->been_warned = YES;
117: }
118: else if (dif < 0)
119: if (cur_node->left)
120: add_node(node, cur_node->left);
121: else
122: cur_node->left = node;
123: else if (cur_node->right)
124: add_node(node, cur_node->right);
125: else
126: cur_node->right = node;
127: }
128:
129: static void
130: free_tree(node)
131: NODE *node;
132: {
133: while (node) {
134: if (node->right)
135: free_tree(node->right);
136: free(node);
137: node = node->left;
138: }
139: }
![[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