path: root/src/parsers/generic.cpp

/*
 *  Copyright (C) 2015  Andrei Karas
 *
 *  This file is part of AstDumper.
 *
 *  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 "nodes/functiondeclnode.h"
#include "nodes/functiontypenode.h"
#include "nodes/voidtypenode.h"
#include "nodes/typedeclnode.h"
#include "nodes/identifiernode.h"
#include "nodes/integercstnode.h"

#include "parsers/parserincludes.h"

parserDefine(FunctionDecl);
parserDefine(FunctionType);
parserDefine(ResultDecl);
parserDefine(VoidType);
parserDefine(TypeDecl);
parserDefine(TreeList);
parserDefine(Identifier);
parserDefine(IntegerCst);

#include "localconsts.h"

#define createNodeType(code, type) \
    case code: \
        node = new type; \
        break

#define parseNodeType(code, type) \
    case code: \
        parse##type##Node(static_cast<type##Node*>(node)); \
        break


namespace Generic
{

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

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

    Node *node = nullptr;
    switch (TREE_CODE(gccNode))
    {
        createNodeType(FUNCTION_DECL, FunctionDeclNode);
        createNodeType(RESULT_DECL, ResultDeclNode);
        createNodeType(TYPE_DECL, TypeDeclNode);
        createNodeType(FUNCTION_TYPE, FunctionTypeNode);
        createNodeType(VOID_TYPE, VoidTypeNode);
        createNodeType(TREE_LIST, TreeListNode);
        createNodeType(IDENTIFIER_NODE, IdentifierNode);
        createNodeType(INTEGER_CST, IntegerCstNode);
        default:
            Log::log(parent,
                1,
                "Not supported 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)
        {
            node->indent  = parent->indent + 1;
            if (tag.empty())
                node->tag = parent->tag;
            else
                node->tag = tag;
        }
        else
        {
            node->tag = tag;
        }

        switch (TREE_CODE(node->gccNode))
        {
            parseNodeType(FUNCTION_DECL, FunctionDecl);
            parseNodeType(RESULT_DECL, ResultDecl);
            parseNodeType(TYPE_DECL, TypeDecl);
            parseNodeType(FUNCTION_TYPE, FunctionType);
            parseNodeType(VOID_TYPE, VoidType);
            parseNodeType(TREE_LIST, TreeList);
            parseNodeType(IDENTIFIER_NODE, Identifier);
            parseNodeType(INTEGER_CST, IntegerCst);
            default:
                break;
        }
        if (wantType != ERROR_MARK &&
            node->nodeType != get_tree_code_name(wantType))
        {
            if (tag.empty())
            {
                Log::log(node,
                    "Wrong node type. Want %s but get %s",
                    get_tree_code_name(wantType),
                    node->nodeType.c_str());
            }
            else
            {
                Log::log(node,
                    "Wrong node type. Want %s but get %s - %s",
                    get_tree_code_name(wantType),
                    node->nodeType.c_str(),
                    tag.c_str());
            }
        }
    }
    return node;
}

void parseNodes(tree gccNode)
{
    createParseNode(nullptr, gccNode, FUNCTION_DECL);
}

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

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

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

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

}