* Copyright (c) 1987 The Regents of the University of California.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
static char sccsid
[] = "@(#)tree.c 5.5 (Berkeley) 2/26/91";
* enter a new node in the tree
extern NODE
*head
; /* head of the sorted binary tree */
extern char *curfile
; /* current input file name */
if (!(np
= (NODE
*)malloc(sizeof(NODE
)))) {
fputs("ctags: too many entries to sort\n",stderr
);
if (!(head
= np
= (NODE
*)malloc(sizeof(NODE
)))) {
fputs("ctags: out of space.\n",stderr
);
if (!xflag
&& !strcmp(name
,"main")) {
if (!(fp
= rindex(curfile
,'/')))
(void)sprintf(nbuf
,"M%s",fp
);
if (!(np
->entry
= strdup(name
))) {
(void)fprintf(stderr
, "ctags: %s\n", strerror(errno
));
np
->left
= np
->right
= 0;
if (!(np
->pat
= strdup(lbuf
))) {
(void)fprintf(stderr
, "ctags: %s\n", strerror(errno
));
extern int wflag
; /* -w: suppress warnings */
dif
= strcmp(node
->entry
,cur_node
->entry
);
if (node
->file
== cur_node
->file
) {
fprintf(stderr
,"Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n",node
->file
,lineno
,node
->entry
);
if (!cur_node
->been_warned
)
fprintf(stderr
,"Duplicate entry in files %s and %s: %s (Warning only)\n",node
->file
,cur_node
->file
,node
->entry
);
cur_node
->been_warned
= YES
;
add_node(node
,cur_node
->left
);
else if (cur_node
->right
)
add_node(node
,cur_node
->right
);