original by Ken Arnold -- Berkeley copyright

[unix-history] / usr / src / usr.bin / ctags / tree.c

/*
* Copyright (c) 1987 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that the above copyright notice and this paragraph are
* duplicated in all such forms and that any documentation,
* advertising materials, and other materials related to such
* distribution and use acknowledge that the software was developed
* by the University of California, Berkeley.  The name of the
* University may not be used to endorse or promote products derived
* from this software without specific prior written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/

#ifndef lint
static char sccsid[] = "@(#)tree.c      5.2 (Berkeley) %G%";
#endif /* not lint */

#include <ctags.h>
#include <strings.h>

/*
* pfnote --
*      enter a new node in the tree
*/
pfnote(name,ln)
       char    *name;
       int     ln;
{
       extern NODE     *head;          /* head of the sorted binary tree */
       extern char     *curfile;       /* current input file name */
       register NODE   *np;
       register char   *fp;
       char    nbuf[MAXTOKEN],
               *malloc(), *savestr();

       /*NOSTRICT*/
       if (!(np = (NODE *)malloc(sizeof(NODE)))) {
               fputs("ctags: too many entries to sort\n",stderr);
               put_entries(head);
               free_tree(head);
               /*NOSTRICT*/
               if (!(head = np = (NODE *)malloc(sizeof(NODE)))) {
                       fputs("ctags: out of space.\n",stderr);
                       exit(1);
               }
       }
       if (!xflag && !strcmp(name,"main")) {
               if (!(fp = rindex(curfile,'/')))
                       fp = curfile;
               else
                       ++fp;
               (void)sprintf(nbuf,"M%s",fp);
               fp = rindex(nbuf,'.');
               if (fp && !fp[2])
                       *fp = EOS;
               name = nbuf;
       }
       np->entry = savestr(name);
       np->file = curfile;
       np->lno = ln;
       np->left = np->right = 0;
       np->pat = savestr(lbuf);
       if (!head)
               head = np;
       else
               add_node(np,head);
}

add_node(node,cur_node)
       register NODE   *node,
                       *cur_node;
{
       extern int      wflag;                  /* -w: suppress warnings */
       register int    dif;

       dif = strcmp(node->entry,cur_node->entry);
       if (!dif) {
               if (node->file == cur_node->file) {
                       if (!wflag)
                               fprintf(stderr,"Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n",node->file,lineno,node->entry);
                       return;
               }
               if (!cur_node->been_warned)
                       if (!wflag)
                               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;
       }
       else if (dif < 0)
               if (cur_node->left)
                       add_node(node,cur_node->left);
               else
                       cur_node->left = node;
       else if (cur_node->right)
               add_node(node,cur_node->right);
       else
               cur_node->right = node;
}

free_tree(node)
       register NODE   *node;
{
       while (node) {
               if (node->right)
                       free_tree(node->right);
               cfree(node);
               node = node->left;
       }
}