/*-
 * SPDX-License-Identifier: BSD-3-Clause
 *
 * Copyright (c) 1987, 1993, 1994
 *      The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 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. 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
 * SUCH DAMAGE.
 */

#include <sys/cdefs.h>
#include <err.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "ctags.h"

static void     add_node(NODE *, NODE *);
static void     free_tree(NODE *);

/*
 * pfnote --
 *      enter a new node in the tree
 */
void
pfnote(const char *name, int ln)
{
        NODE    *np;
        char    *fp;
        char    nbuf[MAXTOKEN];

        /*NOSTRICT*/
        if (!(np = (NODE *)malloc(sizeof(NODE)))) {
                warnx("too many entries to sort");
                put_entries(head);
                free_tree(head);
                /*NOSTRICT*/
                if (!(head = np = (NODE *)malloc(sizeof(NODE))))
                        errx(1, "out of space");
        }
        if (!xflag && !strcmp(name, "main")) {
                if (!(fp = strrchr(curfile, '/')))
                        fp = curfile;
                else
                        ++fp;
                (void)snprintf(nbuf, sizeof(nbuf), "M%s", fp);
                fp = strrchr(nbuf, '.');
                if (fp && !fp[2])
                        *fp = EOS;
                name = nbuf;
        }
        if (!(np->entry = strdup(name)))
                err(1, NULL);
        np->file = curfile;
        np->lno = ln;
        np->left = np->right = 0;
        if (!(np->pat = strdup(lbuf)))
                err(1, NULL);
        if (!head)
                head = np;
        else
                add_node(np, head);
}

static void
add_node(NODE *node, NODE *cur_node)
{
        int     dif;

        dif = strcoll(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 = true;
        }
        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;
}

static void
free_tree(NODE *node)
{
        NODE *node_next;
        while (node) {
                if (node->right)
                        free_tree(node->right);
                node_next = node->left;
                free(node);
                node = node_next;
        }
}