bc5292b46499453de6fb88f9f8a1eb68fd16347d
* Copyright (c) 1987, 1993
* The Regents of the University of California. All rights reserved.
* %sccs.include.redist.c%
static char sccsid
[] = "@(#)tree.c 8.1 (Berkeley) %G%";
* 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
);