/*
 *  Copyright (C) 2015  Andrei Karas
 *
 *  This file is part of Paranoid null checker.
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 3 of the License, or
 *  any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#include "parsers/generic.h"

#include "command.h"
#include "nodesmap.h"

#include "includes/nodeincludes.h"
#include "includes/parserincludes.h"
#include "includes/parserdefines.inc"

#include "localconsts.h"

int allocations = 0;

namespace Generic
{

Node *createParseNode(Node *parent,
                      tree gccNode,
                      std::string tag,
                      int parseChilds)
{
    return createParseNode(parent,
        gccNode,
        ERROR_MARK,
        tag,
        parseChilds);
}

Node *createParseNode(Node *parent,
                      tree gccNode,
                      tree_code wantType,
                      std::string tag,
                      int parseChilds)
{
    if (gccNode == NULL_TREE)
    {
        return nullptr;
    }

    if (allocations > 5000000)
    {
        fatal_error(0, "Plugin error. Infinite loop detected 1");
        return nullptr;
    }

    if (parent && parent->indent > 30000)
    {
        fatal_error(0, "Plugin error. Infinite loop detected 2");
        return nullptr;
    }

    Node *node = nullptr;
    switch (TREE_CODE(gccNode))
    {
#define handleNodeType(code, type) \
    case code: \
        node = new type##Node; \
        break;
#include "includes/nodeshandling.inc"
        default:
            if (checkCommand(DumpUnsupported))
            {
                Log::error("Unsupported node type: %s",
                    get_tree_code_name(TREE_CODE(gccNode)));
            }
            else
            {
                Log::dump(parent,
                    1,
                    "Unsupported node type: %s - %s",
                    get_tree_code_name(TREE_CODE(gccNode)),
                    tag.c_str());
            }
            break;
    }
    if (node)
    {
        node->parent = parent;
        node->gccNode = gccNode;
        if (!parent || parseChilds < parent->parseChilds - 1)
            node->parseChilds = parseChilds;
        else
            node->parseChilds = parent->parseChilds - 1;
        if (node->parseChilds < 0)
            node->parseChilds = 0;

        if (wantType != ERROR_MARK &&
            TREE_CODE(node->gccNode) != wantType)
        {
            if (tag.empty())
            {
                Log::dump(node,
                    "Wrong node type. Want %s but get %s",
                    get_tree_code_name(wantType),
                    get_tree_code_name(TREE_CODE(node->gccNode)));
            }
            else
            {
                Log::dump(node,
                    "Wrong node type. Want %s but get %s - %s",
                    get_tree_code_name(wantType),
                    get_tree_code_name(TREE_CODE(node->gccNode)),
                    tag.c_str());
            }
            delete node;
            return nullptr;
        }

        if (parent)
        {
            node->indent  = parent->indent + 1;
            if (tag.empty())
                node->tag = parent->tag;
            else
                node->tag = tag;
            parent->childs.push_back(node);
        }
        else
        {
            node->tag = tag;
        }

        switch (TREE_CODE(node->gccNode))
        {
#undef handleNodeType
#define handleNodeType(code, type) \
    case code: \
        parse##type##Node(static_cast<type##Node*>(node)); \
        break;
#include "includes/nodeshandling.inc"
            default:
                break;
        }
    }
    return node;
}

Node *parseNodes(tree gccNode)
{
    return createParseNode(nullptr, gccNode, FUNCTION_DECL);
}

void parseVarDeclNode(VarDeclNode *node1, VarDeclNode *node2);

void updateNodes()
{
    FOR_EACH(it, updateNodesMap)
    {
        Node *node1 = it.first;
        Node *node2 = it.second;
        if (node1 == VAR_DECL)
        {
            parseVarDeclNode(static_cast<VarDeclNode*>(node1),
                static_cast<VarDeclNode*>(node2));
        }
    }
}

void cleanAllNodes(Node *node)
{
    foundNodesMap.clear();
    updateNodesMap.clear();
    if (checkCommand(MemoryUsage))
        Log::error("Allocations before cleanup: %d", allocations);
    cleanNodes(node);
    if (checkCommand(MemoryUsage))
        Log::error("Allocations after cleanup: %d", allocations);
}

void cleanNodes(Node *node)
{
    FOR_EACH (it, node->childs)
    {
        cleanNodes(it);
    }
    delete node;
}

void fillType(Node *node)
{
    if (!node || node->gccNode == NULL_TREE)
    {
        return;
    }

    node->treeNumber = static_cast<int>(TREE_CODE(node->gccNode));
    node->nodeType = TREE_CODE(node->gccNode);
    node->nodeTypeName = get_tree_code_name(TREE_CODE(node->gccNode));
//    Log::dump(node);
}

void fillLocation(Node *node)
{
    if (!node || node->gccNode == NULL_TREE)
    {
        return;
    }

    location_t loc = DECL_SOURCE_LOCATION(node->gccNode);
    if (loc)
    {
        node->location = loc;
        node->file = LOCATION_FILE(loc);
        node->line = LOCATION_LINE(loc);
        node->column = LOCATION_COLUMN(loc);
    }
}

}