Files
qt-creator/src/libs/glsl/glslparser.h

209 lines
6.1 KiB
C
Raw Normal View History

2010-11-10 12:32:34 +01:00
#line 215 "./glsl.g"
/**************************************************************************
**
** This file is part of Qt Creator
**
** Copyright (c) 2012 Nokia Corporation and/or its subsidiary(-ies).
**
** Contact: http://www.qt-project.org/
**
**
** GNU Lesser General Public License Usage
**
2011-04-13 08:42:33 +02:00
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this file.
** Please review the following information to ensure the GNU Lesser General
** Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
2010-12-17 17:14:20 +01:00
** In addition, as a special exception, Nokia gives you certain additional
2011-04-13 08:42:33 +02:00
** rights. These rights are described in the Nokia Qt LGPL Exception
2010-12-17 17:14:20 +01:00
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
2011-04-13 08:42:33 +02:00
** Other Usage
**
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**************************************************************************/
2010-11-10 12:32:34 +01:00
#include "glslparsertable_p.h"
#include "glsllexer.h"
#include "glslast.h"
#include "glslengine.h"
2010-11-10 12:32:34 +01:00
#include <vector>
#include <stack>
namespace GLSL {
class GLSL_EXPORT Parser: public GLSLParserTable
2010-11-10 12:32:34 +01:00
{
public:
union Value {
void *ptr;
const QString *string;
AST *ast;
List<AST *> *ast_list;
DeclarationAST *declaration;
List<DeclarationAST *> *declaration_list;
ExpressionAST *expression;
List<ExpressionAST *> *expression_list;
StatementAST *statement;
List<StatementAST *> *statement_list;
TypeAST *type;
StructTypeAST::Field *field;
List<StructTypeAST::Field *> *field_list;
TranslationUnitAST *translation_unit;
FunctionIdentifierAST *function_identifier;
AST::Kind kind;
TypeAST::Precision precision;
struct {
StatementAST *thenClause;
StatementAST *elseClause;
} ifstmt;
struct {
ExpressionAST *condition;
ExpressionAST *increment;
} forstmt;
struct {
FunctionIdentifierAST *id;
List<ExpressionAST *> *arguments;
} function;
int qualifier;
LayoutQualifierAST *layout;
List<LayoutQualifierAST *> *layout_list;
struct {
int qualifier;
List<LayoutQualifierAST *> *layout_list;
} type_qualifier;
struct {
TypeAST *type;
const QString *name;
} param_declarator;
ParameterDeclarationAST *param_declaration;
FunctionDeclarationAST *function_declaration;
};
Parser(Engine *engine, const char *source, unsigned size, int variant);
2010-11-10 12:32:34 +01:00
~Parser();
TranslationUnitAST *parse() {
if (AST *u = parse(T_FEED_GLSL))
return u->asTranslationUnit();
return 0;
}
ExpressionAST *parseExpression() {
if (AST *u = parse(T_FEED_EXPRESSION))
return u->asExpression();
return 0;
}
AST *parse(int startToken);
2010-11-10 12:32:34 +01:00
private:
// 1-based
int &location(int n) { return _locationStack[_tos + n - 1]; }
Value &sym(int n) { return _symStack[_tos + n - 1]; }
AST *&ast(int n) { return _symStack[_tos + n - 1].ast; }
const QString *&string(int n) { return _symStack[_tos + n - 1].string; }
ExpressionAST *&expression(int n) { return _symStack[_tos + n - 1].expression; }
StatementAST *&statement(int n) { return _symStack[_tos + n - 1].statement; }
TypeAST *&type(int n) { return _symStack[_tos + n - 1].type; }
FunctionDeclarationAST *&function(int n) { return _symStack[_tos + n - 1].function_declaration; }
inline int consumeToken() {
if (_index < int(_tokens.size()))
return _index++;
return _tokens.size() - 1;
}
inline const Token &tokenAt(int index) const {
if (index == 0)
return _startToken;
return _tokens.at(index);
}
inline int tokenKind(int index) const {
if (index == 0)
return _startToken.kind;
return _tokens.at(index).kind;
}
void reduce(int ruleno);
2010-11-10 12:32:34 +01:00
2010-11-19 14:59:33 +01:00
void warning(int line, const QString &message)
{
_engine->warning(line, message);
2010-11-19 14:59:33 +01:00
}
void error(int line, const QString &message)
{
_engine->error(line, message);
2010-11-19 14:59:33 +01:00
}
template <typename T>
T *makeAstNode()
{
T *node = new (_engine->pool()) T ();
node->lineno = yyloc >= 0 ? (_tokens[yyloc].line + 1) : 0;
return node;
}
template <typename T, typename A1>
T *makeAstNode(A1 a1)
{
T *node = new (_engine->pool()) T (a1);
node->lineno = yyloc >= 0 ? (_tokens[yyloc].line + 1) : 0;
return node;
}
template <typename T, typename A1, typename A2>
T *makeAstNode(A1 a1, A2 a2)
{
T *node = new (_engine->pool()) T (a1, a2);
node->lineno = yyloc >= 0 ? (_tokens[yyloc].line + 1) : 0;
return node;
}
template <typename T, typename A1, typename A2, typename A3>
T *makeAstNode(A1 a1, A2 a2, A3 a3)
{
T *node = new (_engine->pool()) T (a1, a2, a3);
node->lineno = yyloc >= 0 ? (_tokens[yyloc].line + 1) : 0;
return node;
}
template <typename T, typename A1, typename A2, typename A3, typename A4>
T *makeAstNode(A1 a1, A2 a2, A3 a3, A4 a4)
{
T *node = new (_engine->pool()) T (a1, a2, a3, a4);
node->lineno = yyloc >= 0 ? (_tokens[yyloc].line + 1) : 0;
return node;
}
TypeAST *makeBasicType(int token)
{
TypeAST *type = new (_engine->pool()) BasicTypeAST(token, spell[token]);
type->lineno = yyloc >= 0 ? (_tokens[yyloc].line + 1) : 0;
return type;
}
2010-11-10 12:32:34 +01:00
private:
2010-11-11 15:05:42 +01:00
Engine *_engine;
2010-11-10 12:32:34 +01:00
int _tos;
int _index;
int yyloc;
int yytoken;
int yyrecovering;
bool _recovered;
Token _startToken;
2010-11-10 12:32:34 +01:00
std::vector<int> _stateStack;
std::vector<int> _locationStack;
std::vector<Value> _symStack;
2010-11-10 12:32:34 +01:00
std::vector<Token> _tokens;
};
} // namespace GLSL