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 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)tree.c 8.3 (Berkeley) 4/2/94 34 * $FreeBSD: src/usr.bin/ctags/tree.c,v 1.2.6.2 2002/07/30 00:55:07 tjr Exp $ 35 * $DragonFly: src/usr.bin/ctags/tree.c,v 1.2 2003/06/17 04:29:25 dillon Exp $ 36 */ 37 38 #include <err.h> 39 #include <limits.h> 40 #include <stdio.h> 41 #include <stdlib.h> 42 #include <string.h> 43 44 #include "ctags.h" 45 46 static void add_node(NODE *, NODE *); 47 static void free_tree(NODE *); 48 49 /* 50 * pfnote -- 51 * enter a new node in the tree 52 */ 53 void 54 pfnote(const char *name, int ln) 55 { 56 NODE *np; 57 char *fp; 58 char nbuf[MAXTOKEN]; 59 60 /*NOSTRICT*/ 61 if (!(np = (NODE *)malloc(sizeof(NODE)))) { 62 warnx("too many entries to sort"); 63 put_entries(head); 64 free_tree(head); 65 /*NOSTRICT*/ 66 if (!(head = np = (NODE *)malloc(sizeof(NODE)))) 67 errx(1, "out of space"); 68 } 69 if (!xflag && !strcmp(name, "main")) { 70 if (!(fp = strrchr(curfile, '/'))) 71 fp = curfile; 72 else 73 ++fp; 74 (void)snprintf(nbuf, sizeof(nbuf), "M%s", fp); 75 fp = strrchr(nbuf, '.'); 76 if (fp && !fp[2]) 77 *fp = EOS; 78 name = nbuf; 79 } 80 if (!(np->entry = strdup(name))) 81 err(1, NULL); 82 np->file = curfile; 83 np->lno = ln; 84 np->left = np->right = 0; 85 if (!(np->pat = strdup(lbuf))) 86 err(1, NULL); 87 if (!head) 88 head = np; 89 else 90 add_node(np, head); 91 } 92 93 static void 94 add_node(NODE *node, NODE *cur_node) 95 { 96 int dif; 97 98 dif = strcoll(node->entry, cur_node->entry); 99 if (!dif) { 100 if (node->file == cur_node->file) { 101 if (!wflag) 102 fprintf(stderr, "Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node->file, lineno, node->entry); 103 return; 104 } 105 if (!cur_node->been_warned) 106 if (!wflag) 107 fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry); 108 cur_node->been_warned = YES; 109 } 110 else if (dif < 0) 111 if (cur_node->left) 112 add_node(node, cur_node->left); 113 else 114 cur_node->left = node; 115 else if (cur_node->right) 116 add_node(node, cur_node->right); 117 else 118 cur_node->right = node; 119 } 120 121 static void 122 free_tree(NODE *node) 123 { 124 while (node) { 125 if (node->right) 126 free_tree(node->right); 127 free(node); 128 node = node->left; 129 } 130 } 131