URL https://opencores.org/ocsvn/theia_gpu/theia_gpu/trunk

Subversion Repositories theia_gpu

Compare Revisions

This comparison shows the changes necessary to convert path
```
/theia_gpu
```
from Rev 215 to Rev 216
↔ Reverse comparison
Compare Path: Rev

With Path: Rev

Rev 215 → Rev 216

/branches/beta_2.0/compiler/src/vp_compiler/Scanner.h

0,0 → 1,66

/branches/beta_2.0/compiler/src/vp_compiler/instructions.mem

0,0 → 1,79

/branches/beta_2.0/compiler/src/vp_compiler/parser.tab.c

0,0 → 1,3613

/branches/beta_2.0/compiler/src/vp_compiler/scanner.l

0,0 → 1,105

/branches/beta_2.0/compiler/src/vp_compiler/parser.tab.h

0,0 → 1,395

/branches/beta_2.0/compiler/src/vp_compiler/Compiler.h

0,0 → 1,239

/branches/beta_2.0/compiler/src/vp_compiler/position.hh

0,0 → 1,165

/branches/beta_2.0/compiler/src/vp_compiler/Instruction.cpp

0,0 → 1,784

/branches/beta_2.0/compiler/src/vp_compiler/parser.y

0,0 → 1,2398

/branches/beta_2.0/compiler/src/vp_compiler/stack.hh

0,0 → 1,141

/branches/beta_2.0/compiler/src/vp_compiler/Main.cpp

0,0 → 1,121

/branches/beta_2.0/compiler/src/vp_compiler/location.hh

0,0 → 1,169

/branches/beta_2.0/compiler/src/vp_compiler/Preprocessor.cpp

0,0 → 1,227

/branches/beta_2.0/compiler/src/vp_compiler/Instruction.h

0,0 → 1,209

/branches/beta_2.0/compiler/src/vp_compiler/Preprocessor.h

0,0 → 1,37

/branches/beta_2.0/compiler/src/vp_compiler/lex.yy.cc

0,0 → 1,1914

/branches/beta_2.0/compiler/src/vp_compiler/Makefile

0,0 → 1,9

/branches/beta_2.0/compiler/src/cp_compiler/Scanner.h

0,0 → 1,66

/branches/beta_2.0/compiler/src/cp_compiler/parser.tab.c

0,0 → 1,1599

/branches/beta_2.0/compiler/src/cp_compiler/scanner.l

0,0 → 1,90

/branches/beta_2.0/compiler/src/cp_compiler/theia_cp_compile Cannot display: file marked as a binary type. svn:mime-type = application/octet-stream

/branches/beta_2.0/compiler/src/cp_compiler/theia_cp_compile

branches/beta_2.0/compiler/src/cp_compiler/theia_cp_compile Property changes : Added: svn:mime-type ## -0,0 +1 ## +application/octet-stream \ No newline at end of property Index: branches/beta_2.0/compiler/src/cp_compiler/parser.tab.h =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/parser.tab.h (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/parser.tab.h (revision 216) @@ -0,0 +1,382 @@ + +/* A Bison parser, made by GNU Bison 2.4.1. */ + +/* Skeleton interface for Bison LALR(1) parsers in C++ + + Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software + Foundation, Inc. + + 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 + (at your option) 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 . */ + +/* As a special exception, you may create a larger work that contains + part or all of the Bison parser skeleton and distribute that work + under terms of your choice, so long as that work isn't itself a + parser generator using the skeleton or a modified version thereof + as a parser skeleton. Alternatively, if you modify or redistribute + the parser skeleton itself, you may (at your option) remove this + special exception, which will cause the skeleton and the resulting + Bison output files to be licensed under the GNU General Public + License without this special exception. + + This special exception was added by the Free Software Foundation in + version 2.2 of Bison. */ + +/* C++ LALR(1) parser skeleton written by Akim Demaille. */ + +#ifndef PARSER_HEADER_H +# define PARSER_HEADER_H + +/* "%code requires" blocks. */ + +/* Line 35 of lalr1.cc */ +#line 36 "parser.y" + + #include + #include + #include + #include + #include + #include "Instruction.h" + #include + + + // We want to return a string + #define YYSTYPE std::string + + + namespace Theia + { + // Forward-declare the Scanner class; the Parser needs to be assigned a + // Scanner, but the Scanner can't be declared without the Parser + class Scanner; + + // We use a map to store the INI data + typedef std::map > mapData; + + + + + + } + + + + +/* Line 35 of lalr1.cc */ +#line 78 "parser.tab.h" + + +#include +#include +#include "stack.hh" + + +/* Line 35 of lalr1.cc */ +#line 28 "parser.y" +namespace Theia { + +/* Line 35 of lalr1.cc */ +#line 91 "parser.tab.h" + class position; + class location; + +/* Line 35 of lalr1.cc */ +#line 28 "parser.y" +} // Theia + +/* Line 35 of lalr1.cc */ +#line 100 "parser.tab.h" + +#include "location.hh" + +/* Enabling traces. */ +#ifndef YYDEBUG +# define YYDEBUG 0 +#endif + +/* Enabling verbose error messages. */ +#ifdef YYERROR_VERBOSE +# undef YYERROR_VERBOSE +# define YYERROR_VERBOSE 1 +#else +# define YYERROR_VERBOSE 1 +#endif + +/* Enabling the token table. */ +#ifndef YYTOKEN_TABLE +# define YYTOKEN_TABLE 0 +#endif + +/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. + If N is 0, then set CURRENT to the empty location which ends + the previous symbol: RHS[0] (always defined). */ + +#ifndef YYLLOC_DEFAULT +# define YYLLOC_DEFAULT(Current, Rhs, N) \ +do { \ + if (N) \ + { \ + (Current).begin = (Rhs)[1].begin; \ + (Current).end = (Rhs)[N].end; \ + } \ + else \ + { \ + (Current).begin = (Current).end = (Rhs)[0].end; \ + } \ +} while (false) +#endif + + +/* Line 35 of lalr1.cc */ +#line 28 "parser.y" +namespace Theia { + +/* Line 35 of lalr1.cc */ +#line 147 "parser.tab.h" + + /// A Bison parser. + class Parser + { + public: + /// Symbol semantic values. +#ifndef YYSTYPE + typedef int semantic_type; +#else + typedef YYSTYPE semantic_type; +#endif + /// Symbol locations. + typedef location location_type; + /// Tokens. + struct token + { + /* Tokens. */ + enum yytokentype { + SHL = 258, + SHR = 259, + SCALAR = 260, + RETURN = 261, + EXIT = 262, + EQUAL = 263, + NOT_EQUAL = 264, + GREATER_THAN = 265, + LESS_THAN = 266, + LESS_OR_EQUAL_THAN = 267, + GREATER_OR_EQUAL_THAN = 268, + IF = 269, + ELSE = 270, + OPEN_ROUND_BRACE = 271, + CLOSE_ROUND_BRACE = 272, + OPEN_BRACE = 273, + CLOSE_BRACE = 274, + ASSIGN = 275, + ADD = 276, + DECCONST = 277, + HEXCONST = 278, + BINCONST = 279, + EOS = 280, + MINUS = 281, + IDENTIFIER = 282, + COMMA = 283, + OPEN_SQUARE_BRACE = 284, + CLOSE_SQUARE_BRACE = 285, + WHILE = 286, + START = 287, + BITWISE_AND = 288, + BITWISE_OR = 289, + COPY_DATA_BLOCK = 290, + COPY_CODE_BLOCK = 291, + BLOCK_TRANSFER_IN_PROGRESS = 292 + }; + + }; + /// Token type. + typedef token::yytokentype token_type; + + /// Build a parser object. + Parser (Theia::Scanner &scanner_yyarg, std::map & mSymbolMap_yyarg, std::vector< CControlInstruction > &mInstructions_yyarg, bool &mGenerateFixedPointArithmetic_yyarg); + virtual ~Parser (); + + /// Parse. + /// \returns 0 iff parsing succeeded. + virtual int parse (); + +#if YYDEBUG + /// The current debugging stream. + std::ostream& debug_stream () const; + /// Set the current debugging stream. + void set_debug_stream (std::ostream &); + + /// Type for debugging levels. + typedef int debug_level_type; + /// The current debugging level. + debug_level_type debug_level () const; + /// Set the current debugging level. + void set_debug_level (debug_level_type l); +#endif + + private: + /// Report a syntax error. + /// \param loc where the syntax error is found. + /// \param msg a description of the syntax error. + virtual void error (const location_type& loc, const std::string& msg); + + /// Generate an error message. + /// \param state the state where the error occurred. + /// \param tok the lookahead token. + virtual std::string yysyntax_error_ (int yystate, int tok); + +#if YYDEBUG + /// \brief Report a symbol value on the debug stream. + /// \param yytype The token type. + /// \param yyvaluep Its semantic value. + /// \param yylocationp Its location. + virtual void yy_symbol_value_print_ (int yytype, + const semantic_type* yyvaluep, + const location_type* yylocationp); + /// \brief Report a symbol on the debug stream. + /// \param yytype The token type. + /// \param yyvaluep Its semantic value. + /// \param yylocationp Its location. + virtual void yy_symbol_print_ (int yytype, + const semantic_type* yyvaluep, + const location_type* yylocationp); +#endif + + + /// State numbers. + typedef int state_type; + /// State stack type. + typedef stack state_stack_type; + /// Semantic value stack type. + typedef stack semantic_stack_type; + /// location stack type. + typedef stack location_stack_type; + + /// The state stack. + state_stack_type yystate_stack_; + /// The semantic value stack. + semantic_stack_type yysemantic_stack_; + /// The location stack. + location_stack_type yylocation_stack_; + + /// Internal symbol numbers. + typedef unsigned char token_number_type; + /* Tables. */ + /// For a state, the index in \a yytable_ of its portion. + static const signed char yypact_[]; + static const signed char yypact_ninf_; + + /// For a state, default rule to reduce. + /// Unless\a yytable_ specifies something else to do. + /// Zero means the default is an error. + static const unsigned char yydefact_[]; + + static const signed char yypgoto_[]; + static const signed char yydefgoto_[]; + + /// What to do in a state. + /// \a yytable_[yypact_[s]]: what to do in state \a s. + /// - if positive, shift that token. + /// - if negative, reduce the rule which number is the opposite. + /// - if zero, do what YYDEFACT says. + static const unsigned char yytable_[]; + static const signed char yytable_ninf_; + + static const unsigned char yycheck_[]; + + /// For a state, its accessing symbol. + static const unsigned char yystos_[]; + + /// For a rule, its LHS. + static const unsigned char yyr1_[]; + /// For a rule, its RHS length. + static const unsigned char yyr2_[]; + +#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE + /// For a symbol, its name in clear. + static const char* const yytname_[]; +#endif + +#if YYERROR_VERBOSE + /// Convert the symbol name \a n to a form suitable for a diagnostic. + virtual std::string yytnamerr_ (const char *n); +#endif + +#if YYDEBUG + /// A type to store symbol numbers and -1. + typedef signed char rhs_number_type; + /// A `-1'-separated list of the rules' RHS. + static const rhs_number_type yyrhs_[]; + /// For each rule, the index of the first RHS symbol in \a yyrhs_. + static const unsigned char yyprhs_[]; + /// For each rule, its source line number. + static const unsigned short int yyrline_[]; + /// For each scanner token number, its symbol number. + static const unsigned short int yytoken_number_[]; + /// Report on the debug stream that the rule \a r is going to be reduced. + virtual void yy_reduce_print_ (int r); + /// Print the state stack on the debug stream. + virtual void yystack_print_ (); + + /* Debugging. */ + int yydebug_; + std::ostream* yycdebug_; +#endif + + /// Convert a scanner token number \a t to a symbol number. + token_number_type yytranslate_ (int t); + + /// \brief Reclaim the memory associated to a symbol. + /// \param yymsg Why this token is reclaimed. + /// \param yytype The symbol type. + /// \param yyvaluep Its semantic value. + /// \param yylocationp Its location. + inline void yydestruct_ (const char* yymsg, + int yytype, + semantic_type* yyvaluep, + location_type* yylocationp); + + /// Pop \a n symbols the three stacks. + inline void yypop_ (unsigned int n = 1); + + /* Constants. */ + static const int yyeof_; + /* LAST_ -- Last index in TABLE_. */ + static const int yylast_; + static const int yynnts_; + static const int yyempty_; + static const int yyfinal_; + static const int yyterror_; + static const int yyerrcode_; + static const int yyntokens_; + static const unsigned int yyuser_token_number_max_; + static const token_number_type yyundef_token_; + + /* User arguments. */ + Theia::Scanner &scanner; + std::map & mSymbolMap; + std::vector< CControlInstruction > &mInstructions; + bool &mGenerateFixedPointArithmetic; + }; + +/* Line 35 of lalr1.cc */ +#line 28 "parser.y" +} // Theia + +/* Line 35 of lalr1.cc */ +#line 379 "parser.tab.h" + + + +#endif /* ! defined PARSER_HEADER_H */ Index: branches/beta_2.0/compiler/src/cp_compiler/Compiler.h =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/Compiler.h (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/Compiler.h (revision 216) @@ -0,0 +1,154 @@ +/* This program is free software. It comes without any warranty, to + * the extent permitted by applicable law. You can redistribute it + * and/or modify it under the terms of the Do What The Fuck You Want + * To Public License, Version 2, as published by Sam Hocevar. See + * http://sam.zoy.org/wtfpl/COPYING for more details. */ + +#pragma once + +#include +#include "Scanner.h" +#include +#include "Instruction.h" +#include +#include +#include + + + class TheiaCompiler + { + public: + std::vector mPreprocessedFile; + // can instantiate with either a file name or an already open stream + inline explicit TheiaCompiler(std::string fileName) throw(std::string); + inline explicit TheiaCompiler(std::istream &iniStream) throw(std::string); + + // Get a value from section and key + const char * getValue(const char * const section, const char * const key) const; + //------------------------------------------------------------------------------------- + void PrependCodeInitialization() + { + CControlInstruction I; + I.Clear(); + I.SetOperation(EOPERATION_NOP); + mInstructions.push_back(I); + I.Clear(); + + I.SetOperation(EOPERATION_NOP); + mInstructions.push_back(I); + I.Clear(); + + I.SetOperation(EOPERATION_NOP); + mInstructions.push_back(I); + I.Clear(); + + I.SetDestinationAddress(0); + I.SetOperation(EOPERATION_ASSIGN); + I.SetLiteral(0); + mInstructions.push_back(I); + + } + //------------------------------------------------------------------------------------- + std::string GetHexCodeDump(void) + { + std::ostringstream oss; + //Add the header + oss << "//List file created by theia_compile\n"; + + + for ( int i = 0; i < mInstructions.size(); i++) + { + + oss << GetLineSymbolDefintion( i ); + + if (mInstructions[i].mSourceLine > 0) + oss << "//" << mPreprocessedFile[ mInstructions[i].mSourceLine -1 ] << "\n"; + + if (mInstructions[i].mComment.size()) + oss << "//" << mInstructions[i].mComment<< "\n"; + + oss << std::dec << i ; + //oss << std::hex << " (0x" << i << ") " ; + oss << ":\t" << mInstructions[i].PrintAssembly() << "\n"; + } + + return oss.str(); + } + //------------------------------------------------------------------------------------- + std::string GetLineSymbolDefintion( unsigned int aLine ) + { + + std::map::const_iterator it; + for (it = mSymbolMap.begin(); it != mSymbolMap.end(); ++it) + { + if (it->second == aLine) + return "\n//" + it->first + "\n"; + + } + return std::string(""); + } + + std::string PostProcess(std::string aFilePath ) + { + std::ostringstream oss; + oss << "//Code generated bt theia_compile\n"; + for ( int i = 0; i < mInstructions.size(); i++) + { + oss << mInstructions[i].PrintAssembly() << "\n"; + } + return oss.str(); + } + //-------------------------------------------------------------------------------------------------- + + private: + // supress default constructor + TheiaCompiler(); + // supress default copy constructor + TheiaCompiler(TheiaCompiler const &rhs); + // supress default assignment operator + TheiaCompiler &operator=(TheiaCompiler const &rhs); + + std::vector< CControlInstruction > mInstructions; + std::map mSymbolMap; + bool mGenerateFixedPointArithmetic; + }; + +//------------------------------------------------------------------------------------------------------- + TheiaCompiler::TheiaCompiler(std::string fileName) throw(std::string) + { + mGenerateFixedPointArithmetic = false; + std::ifstream inFile(fileName.c_str()); + if (!inFile.good()) + throw std::string("Unable to open file "+ fileName); + + //First get me a local copy of the file into a vector + std::string Line; //int i = 1; + while( std::getline(inFile, Line) ) + { + mPreprocessedFile.push_back( Line ); + ////std::cout << i++ << " " << Line << "\n"; + } + + inFile.close(); + inFile.open(fileName.c_str()); + if (!inFile.good()) + throw std::string("Unable to open file "+ fileName); + + PrependCodeInitialization(); + + Theia::Scanner scanner(&inFile); + Theia::Parser parser(scanner, mSymbolMap , mInstructions, mGenerateFixedPointArithmetic); + std::cout << "parsing file\n"; + parser.parse(); + } +//------------------------------------------------------------------------------------------------------- + + TheiaCompiler::TheiaCompiler(std::istream &iniStream) throw(std::string) + { + mGenerateFixedPointArithmetic = false; + Theia::Scanner scanner(&iniStream); + Theia::Parser parser(scanner, mSymbolMap, mInstructions, mGenerateFixedPointArithmetic); + parser.parse(); + } + +//------------------------------------------------------------------------------------------------------- Index: branches/beta_2.0/compiler/src/cp_compiler/position.hh =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/position.hh (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/position.hh (revision 216) @@ -0,0 +1,165 @@ + +/* A Bison parser, made by GNU Bison 2.4.1. */ + +/* Positions for Bison parsers in C++ + + Copyright (C) 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. + + 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 + (at your option) 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 . */ + +/* As a special exception, you may create a larger work that contains + part or all of the Bison parser skeleton and distribute that work + under terms of your choice, so long as that work isn't itself a + parser generator using the skeleton or a modified version thereof + as a parser skeleton. Alternatively, if you modify or redistribute + the parser skeleton itself, you may (at your option) remove this + special exception, which will cause the skeleton and the resulting + Bison output files to be licensed under the GNU General Public + License without this special exception. + + This special exception was added by the Free Software Foundation in + version 2.2 of Bison. */ + +/** + ** \file position.hh + ** Define the Theia::position class. + */ + +#ifndef BISON_POSITION_HH +# define BISON_POSITION_HH + +# include +# include +# include + + +/* Line 38 of location.cc */ +#line 28 "parser.y" +namespace Theia { + +/* Line 38 of location.cc */ +#line 53 "position.hh" + /// Abstract a position. + class position + { + public: + + /// Construct a position. + position () + : filename (0), line (1), column (1) + { + } + + + /// Initialization. + inline void initialize (std::string* fn) + { + filename = fn; + line = 1; + column = 1; + } + + /** \name Line and Column related manipulators + ** \{ */ + public: + /// (line related) Advance to the COUNT next lines. + inline void lines (int count = 1) + { + column = 1; + line += count; + } + + /// (column related) Advance to the COUNT next columns. + inline void columns (int count = 1) + { + column = std::max (1u, column + count); + } + /** \} */ + + public: + /// File name to which this position refers. + std::string* filename; + /// Current line number. + unsigned int line; + /// Current column number. + unsigned int column; + }; + + /// Add and assign a position. + inline const position& + operator+= (position& res, const int width) + { + res.columns (width); + return res; + } + + /// Add two position objects. + inline const position + operator+ (const position& begin, const int width) + { + position res = begin; + return res += width; + } + + /// Add and assign a position. + inline const position& + operator-= (position& res, const int width) + { + return res += -width; + } + + /// Add two position objects. + inline const position + operator- (const position& begin, const int width) + { + return begin + -width; + } + + /// Compare two position objects. + inline bool + operator== (const position& pos1, const position& pos2) + { + return + (pos1.filename == pos2.filename + || pos1.filename && pos2.filename && *pos1.filename == *pos2.filename) + && pos1.line == pos2.line && pos1.column == pos2.column; + } + + /// Compare two position objects. + inline bool + operator!= (const position& pos1, const position& pos2) + { + return !(pos1 == pos2); + } + + /** \brief Intercept output stream redirection. + ** \param ostr the destination output stream + ** \param pos a reference to the position to redirect + */ + inline std::ostream& + operator<< (std::ostream& ostr, const position& pos) + { + if (pos.filename) + ostr << *pos.filename << ':'; + return ostr << pos.line << '.' << pos.column; + } + + +/* Line 144 of location.cc */ +#line 28 "parser.y" +} // Theia + +/* Line 144 of location.cc */ +#line 165 "position.hh" +#endif // not BISON_POSITION_HH Index: branches/beta_2.0/compiler/src/cp_compiler/Instruction.cpp =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/Instruction.cpp (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/Instruction.cpp (revision 216) @@ -0,0 +1,252 @@ + +/********************************************************************************** +Theia, Ray Cast Programable graphic Processing Unit. +Copyright (C) 2012 Diego Valverde (diego.valverde.g@gmail.com) + +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 2 +of the License, or (at your option) 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, write to the Free Software +Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. + +***********************************************************************************/ + + +#include "Instruction.h" +#include +#include +#include + + +//-------------------------------------------------------------- +template +inline void SetbitRange( std::bitset & aBitset , unsigned int aEnd, unsigned int aStart, unsigned int aValue) +{ + unsigned long mask = 1; + unsigned long result = 0; + for (int i = aStart; i <= aEnd; ++i) + { + aBitset[i] = ( mask & aValue ); + mask <<= 1; + } + +} +//-------------------------------------------------------------- +template +inline unsigned int GetbitRange( std::bitset & aBitset , unsigned int aEnd, unsigned int aStart) +{ + + unsigned long Result = 0; + int j = 0; + for (int i = aStart; i <= aEnd; ++i) + { + Result |= ( aBitset[i] << j++); + + } + + return Result; + +} +//-------------------------------------------------------------- +const char lookuparrbin2hex[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'}; + +char convert_bin2hex(std::string bits) +{ + unsigned int result = 0; + unsigned int shifter0 = 0; + unsigned int shifter1 = 1; + + for(int n=0; n < bits.length(); n++) + { + result <<= 1; //shift result to the left by 1 + if(bits[n] == '1') result = (result | shifter1); + else result = (result | shifter0); + } + return lookuparrbin2hex[result]; +} +//-------------------------------------------------------------- + +std::string BinStringToHexString(std::string aBinString ) +{ + std::string endresult = ""; + for(int i = 0; i < aBinString.length(); i = i+4) + { + endresult += convert_bin2hex(aBinString.substr(i,4)); + } + return endresult; +} + +//-------------------------------------------------------------- +CControlInstruction::CControlInstruction() +{ + +mSourceLine = -1; +} +//-------------------------------------------------------------- +CControlInstruction::~CControlInstruction() +{ + +} + +//-------------------------------------------------------------- +void CControlInstruction::Clear() +{ + mOperation = 0; + mDestination = 0; + mSource1 = 0; + mSource0 = 0; + mComment.clear(); + mCopyDestinationAddress = 0; + mCopySourceAddress = 0; + mCopyDestinationId = 0; + mCopySize = 0; + mSourceLine = -1; +} + +//-------------------------------------------------------------- +void CControlInstruction::SetDestinationAddress( unsigned int aAddress ) +{ + + mDestination = aAddress; + +} +//-------------------------------------------------------------- +void CControlInstruction::SetSrc1Address(unsigned int aAddress ) +{ + mSource1 = aAddress; +} +//-------------------------------------------------------------- +void CControlInstruction::SetSrc0Address(unsigned int aAddress ) +{ + mSource0 = aAddress; +} +//-------------------------------------------------------------- +void CControlInstruction::SetOperation( EOPERATION aCode ) +{ + mOperation = aCode; +} +//-------------------------------------------------------------- +void CControlInstruction::SetCopyDestinationAddress( unsigned int aAddress ) +{ + mCopyDestinationAddress = aAddress; +} +//-------------------------------------------------------------- +void CControlInstruction::SetCopySourceAddress( unsigned int aAddress ) +{ + mCopySourceAddress = aAddress; +} +//-------------------------------------------------------------- +void CControlInstruction::SetCopyDestinationId( unsigned int aId ) +{ + mCopyDestinationId = aId; +} +//-------------------------------------------------------------- + +void CControlInstruction::SetCopySize( unsigned int aSize ) +{ + mCopyDestinationAddress = mCopyDestinationAddress; +} + +//-------------------------------------------------------------- +void CControlInstruction::SetLiteral( unsigned int aLiteral ) +{ + mLiteral = aLiteral; +} +//-------------------------------------------------------------- +std::string OperationStrings[] = +{ + "NOP", + "DELIVERCOMMAND", + "ADD", + "SUB", + "AND", + "OR", + "BRANCH", + "BEQ", + "BNE", + "BG", + "BL", + "BGE", + "BLE", + "ASSIGN", + "COPYBLOCK", + "EXIT", + "NOT", + "SHL", + "SHR" + +}; + +//-------------------------------------------------------------- +std::string CControlInstruction::PrintAssembly( void ) +{ + std::ostringstream oss; + std::bitset Bitset; + + + SetbitRange( Bitset ,OP_RNG , mOperation); + switch (mOperation) + { + case EOPERATION_COPYBLOCK: + { + SetbitRange( Bitset ,COPY_DST_RNG, mCopyDestinationAddress); + SetbitRange( Bitset ,COPY_SRC_RNG, mCopySourceAddress); + SetbitRange( Bitset ,COPY_DSTID_RNG, mCopyDestinationId); + //SetbitRange( Bitset ,COPY_SIZE_RNG, mCopyDestinationAddress); + + /*std::bitset<32> BitsetWord32_0( GetbitRange(Bitset,31,0) ); + std::bitset<32> BitsetWord32_1( GetbitRange(Bitset,63,32) ); + std::bitset<32> BitsetWord32_2( GetbitRange(Bitset,84,64) );*/ + + //oss << std::hex << BitsetWord32_2 << " " << BitsetWord32_1 << " "<< BitsetWord32_0; + oss << std::hex << Bitset.to_ulong(); + oss << "\t\t//" << OperationStrings[mOperation]; + oss << std::dec << " DstId: R" << mCopyDestinationId << " SrcOffset: R" << mCopySourceAddress << " DstOffsetAndLen: R" << mCopyDestinationAddress; + } + break; + case EOPERATION_ASSIGN: + { + + SetbitRange( Bitset ,DST_RNG , mDestination); + SetbitRange( Bitset ,LITERAL_RNG , mLiteral); + //SetbitRange( Bitset ,63,32 , 0); + + /*std::bitset<32> BitsetWord32_0( GetbitRange(Bitset,31,0) ); + std::bitset<32> BitsetWord32_1( GetbitRange(Bitset,63,32) ); + std::bitset<32> BitsetWord32_2( GetbitRange(Bitset,84,64) ); + + oss << std::hex << BitsetWord32_2 << " " << BitsetWord32_1 << " "<< BitsetWord32_0;*/ + oss << std::hex << Bitset.to_ulong(); + oss << "\t\t//" << OperationStrings[mOperation]; + oss << std::dec << " R" << mDestination << " I(" << mLiteral << " )"; + } + break; + default: + { + SetbitRange( Bitset ,SRC0_RNG, mSource0); + SetbitRange( Bitset ,SRC1_RNG, mSource1); + SetbitRange( Bitset ,DST_RNG , mDestination); + /* + std::bitset<32> BitsetWord32_0( GetbitRange(Bitset,31,0) ); + std::bitset<32> BitsetWord32_1( GetbitRange(Bitset,63,32) ); + std::bitset<32> BitsetWord32_2( GetbitRange(Bitset,84,64) ); + + + oss << std::hex << BitsetWord32_2 << " " << BitsetWord32_1 << " "<< BitsetWord32_0;*/ + oss << std::hex << Bitset.to_ulong(); + oss << "\t\t//" << OperationStrings[mOperation]; + oss << std::dec << " R" << mDestination << " R" << mSource1 << " R" << mSource0; + } + } + + return oss.str(); +} +//-------------------------------------------------------------- \ No newline at end of file Index: branches/beta_2.0/compiler/src/cp_compiler/stack.hh =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/stack.hh (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/stack.hh (revision 216) @@ -0,0 +1,141 @@ + +/* A Bison parser, made by GNU Bison 2.4.1. */ + +/* Stack handling for Bison parsers in C++ + + Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software + Foundation, Inc. + + 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 + (at your option) 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 . */ + +/* As a special exception, you may create a larger work that contains + part or all of the Bison parser skeleton and distribute that work + under terms of your choice, so long as that work isn't itself a + parser generator using the skeleton or a modified version thereof + as a parser skeleton. Alternatively, if you modify or redistribute + the parser skeleton itself, you may (at your option) remove this + special exception, which will cause the skeleton and the resulting + Bison output files to be licensed under the GNU General Public + License without this special exception. + + This special exception was added by the Free Software Foundation in + version 2.2 of Bison. */ + +#ifndef BISON_STACK_HH +# define BISON_STACK_HH + +#include + + +/* Line 1067 of lalr1.cc */ +#line 28 "parser.y" +namespace Theia { + +/* Line 1067 of lalr1.cc */ +#line 47 "stack.hh" + template > + class stack + { + public: + + // Hide our reversed order. + typedef typename S::reverse_iterator iterator; + typedef typename S::const_reverse_iterator const_iterator; + + stack () : seq_ () + { + } + + stack (unsigned int n) : seq_ (n) + { + } + + inline + T& + operator [] (unsigned int i) + { + return seq_[i]; + } + + inline + const T& + operator [] (unsigned int i) const + { + return seq_[i]; + } + + inline + void + push (const T& t) + { + seq_.push_front (t); + } + + inline + void + pop (unsigned int n = 1) + { + for (; n; --n) + seq_.pop_front (); + } + + inline + unsigned int + height () const + { + return seq_.size (); + } + + inline const_iterator begin () const { return seq_.rbegin (); } + inline const_iterator end () const { return seq_.rend (); } + + private: + + S seq_; + }; + + /// Present a slice of the top of a stack. + template > + class slice + { + public: + + slice (const S& stack, + unsigned int range) : stack_ (stack), + range_ (range) + { + } + + inline + const T& + operator [] (unsigned int i) const + { + return stack_[range_ - i]; + } + + private: + + const S& stack_; + unsigned int range_; + }; + +/* Line 1153 of lalr1.cc */ +#line 28 "parser.y" +} // Theia + +/* Line 1153 of lalr1.cc */ +#line 139 "stack.hh" + +#endif // not BISON_STACK_HH[]dnl + Index: branches/beta_2.0/compiler/src/cp_compiler/parser.y =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/parser.y (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/parser.y (revision 216) @@ -0,0 +1,663 @@ + +/********************************************************************************** +Theia, Ray Cast Programable graphic Processing Unit. +Copyright (C) 2012 Diego Valverde (diego.valverde.g@gmail.com) + +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 2 +of the License, or (at your option) 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, write to the Free Software +Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. + +***********************************************************************************/ + + +%require "2.4.1" +%skeleton "lalr1.cc" +%defines +%error-verbose +%locations +%define namespace "Theia" +%define parser_class_name "Parser" +%parse-param { Theia::Scanner &scanner } +%parse-param { std::map & mSymbolMap } +%parse-param { std::vector< CControlInstruction > &mInstructions } +%parse-param { bool &mGenerateFixedPointArithmetic } +%lex-param { Theia::Scanner &scanner } + +%code requires { + #include + #include + #include + #include + #include + #include "Instruction.h" + #include + + + // We want to return a string + #define YYSTYPE std::string + + + namespace Theia + { + // Forward-declare the Scanner class; the Parser needs to be assigned a + // Scanner, but the Scanner can't be declared without the Parser + class Scanner; + + // We use a map to store the INI data + typedef std::map > mapData; + + + + + + } + +} + +%code +{ + #include "Instruction.h" + #include + CControlInstruction I; + std::vector< unsigned int > gBranchStack; + static int gInsertedInstructions = 0; + static int gWhileLoopAddress = 0; +#define FUNCTION_PARAM_START_REGION 4 +#define FUNCTION_PARAM_LAST_REGION 7 + std::map gVaribleMap; + +#define AUTOVAR_START_REGION 9 +#define TEMP_VAR_START_OFFSET 128 +unsigned int gAutoVarIndex = AUTOVAR_START_REGION; + +unsigned int gFunctionParameterIndex = FUNCTION_PARAM_START_REGION; +//---------------------------------------------------------- +int GetCurrentLineNumber( const Theia::Parser::location_type &loc ) +{ + int ret = -1; + std::stringstream ss2; + std::string where; + ss2 << loc; + ss2 >> where; + where.erase(where.find_first_of(".")); + std::stringstream ss3; + ss3 << where; + ss3 >> ret; + return ret; +} +//---------------------------------------------------------- +unsigned int GetAddressFromIdentifier( std::string aIdentifier, Theia::Parser::location_type yylloc ) +{ + if (aIdentifier.find("R") != std::string::npos) + { + return atoi(aIdentifier.c_str()+1); + } + if (gVaribleMap.find(aIdentifier) == gVaribleMap.end()) + { + std::ostringstream ret; + ret << "Undefined variable '" << aIdentifier << "' at line " << yylloc << " \n"; + throw ret.str(); + } + + return gVaribleMap[ aIdentifier ]; + +} +//---------------------------------------------------------- +unsigned int gTempRegisterIndex = TEMP_VAR_START_OFFSET; +//---------------------------------------------------------- +unsigned int GetFreeTempRegister( void ) +{ + + return gTempRegisterIndex++; + +} +//---------------------------------------------------------- +void ResetTempRegisterIndex( void ) +{ + + gTempRegisterIndex = TEMP_VAR_START_OFFSET; +} +//---------------------------------------------------------- +unsigned int AllocateVariable( ) +{ + gAutoVarIndex++; + return gAutoVarIndex; + +} +//---------------------------------------------------------- + // Prototype for the yylex function + static int yylex(Theia::Parser::semantic_type * yylval, + Theia::Parser::location_type * yylloc, + Theia::Scanner &scanner); +} + +%token SHL SHR SCALAR RETURN EXIT EQUAL NOT_EQUAL GREATER_THAN LESS_THAN LESS_OR_EQUAL_THAN GREATER_OR_EQUAL_THAN IF ELSE OPEN_ROUND_BRACE CLOSE_ROUND_BRACE OPEN_BRACE CLOSE_BRACE ASSIGN ADD DECCONST HEXCONST BINCONST EOS MINUS +%token IDENTIFIER COMMA OPEN_SQUARE_BRACE CLOSE_SQUARE_BRACE WHILE START BITWISE_AND BITWISE_OR COPY_DATA_BLOCK COPY_CODE_BLOCK BLOCK_TRANSFER_IN_PROGRESS +%% + +statement_list: //empty + | + statement_list statement + | + statement + ; + +statement + : + START LESS_THAN constant GREATER_THAN EOS + { + + unsigned int ImmediateValue; + std::string StringHex = $3; + std::stringstream ss; + ss << std::hex << StringHex; + ss >> ImmediateValue; + + + I.mComment = "Start"; + I.mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation(EOPERATION_DELIVERCOMMAND); + I.SetDestinationAddress( ImmediateValue+1 ); + I.SetSrc1Address( VP_COMMAND_START_MAIN_THREAD ); + mInstructions.push_back(I); + I.Clear(); + } + | + SCALAR scalar_list EOS + | + COPY_DATA_BLOCK LESS_THAN expression COMMA expression COMMA expression GREATER_THAN EOS + { + + I.SetOperation( EOPERATION_ADD ); + I.mComment = "Setting destination ID SPR for Copy data block"; + I.SetDestinationAddress( BLOCK_DST_REG ); + I.SetSrc1Address( GetAddressFromIdentifier($3,yylloc)); + I.SetSrc0Address(0); + mInstructions.push_back(I); + I.Clear(); + + std::cout << "COPY_DATA_BLOCK I(" << GetAddressFromIdentifier($3,yylloc) << ") " << GetAddressFromIdentifier($5,yylloc) << " " << GetAddressFromIdentifier($7,yylloc) << "\n"; + I.mComment = "Copy data block"; + I.mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation(EOPERATION_COPYBLOCK); + //I.SetCopyDestinationId(ImmediateValue); + I.SetCopyDestinationId(0); + I.SetCopyDestinationAddress(GetAddressFromIdentifier($5,yylloc)); + I.SetCopySourceAddress(GetAddressFromIdentifier($7,yylloc)); + I.SetCopySize(GetAddressFromIdentifier($9,yylloc)); + mInstructions.push_back(I); + I.Clear(); + } + | + EXIT EOS + { + //Insert a stupid NOP before the exit... is a bug but easier to just patch like this... + + I.mComment = "Exit"; + I.mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation(EOPERATION_EXIT); + mInstructions.push_back(I); + I.Clear(); + } + + | + IDENTIFIER MINUS MINUS EOS + { + + I.mComment = "Storing constant '1'"; + I.SetOperation( EOPERATION_SUB ); + unsigned int TmpReg = GetFreeTempRegister(); + I.SetDestinationAddress( TmpReg ); + I.SetLiteral(1); + mInstructions.push_back( I ); + I.Clear(); + + I.mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation( EOPERATION_ADD ); + I.SetDestinationAddress( GetAddressFromIdentifier($1,yylloc) ); + I.SetSrc1Address( GetAddressFromIdentifier($3,yylloc)); + I.SetSrc0Address( TmpReg ); + mInstructions.push_back( I ); + I.Clear(); + gInsertedInstructions = 0; + ResetTempRegisterIndex(); + } + | + IDENTIFIER ADD ADD EOS + { + + I.mComment = "Storing constant '1'"; + I.SetOperation( EOPERATION_ADD ); + unsigned int TmpReg = GetFreeTempRegister(); + I.SetDestinationAddress( TmpReg ); + I.SetLiteral(1); + mInstructions.push_back( I ); + I.Clear(); + + I.mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation( EOPERATION_ADD ); + I.SetDestinationAddress( GetAddressFromIdentifier($1,yylloc) ); + I.SetSrc1Address( GetAddressFromIdentifier($3,yylloc)); + I.SetSrc0Address( TmpReg ); + mInstructions.push_back( I ); + I.Clear(); + gInsertedInstructions = 0; + ResetTempRegisterIndex(); + + } + | + IDENTIFIER ASSIGN expression EOS + { + mInstructions[mInstructions.size()-gInsertedInstructions].mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation( EOPERATION_ADD ); + I.SetDestinationAddress( GetAddressFromIdentifier($1,yylloc) ); + I.SetSrc1Address( GetAddressFromIdentifier($3,yylloc)); + I.SetSrc0Address(0); + mInstructions.push_back( I ); + I.Clear(); + gInsertedInstructions = 0; + ResetTempRegisterIndex(); + } + | + IDENTIFIER ADD ASSIGN expression EOS + { + mInstructions[mInstructions.size()-gInsertedInstructions].mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation( EOPERATION_ADD ); + I.SetDestinationAddress( GetAddressFromIdentifier($1,yylloc) ); + I.SetSrc1Address( GetAddressFromIdentifier($4,yylloc)); + I.SetSrc0Address( GetAddressFromIdentifier($1,yylloc) ); + mInstructions.push_back( I ); + I.Clear(); + gInsertedInstructions = 0; + } + | + WHILE {gWhileLoopAddress = (mInstructions.size());} OPEN_ROUND_BRACE boolean_expression CLOSE_ROUND_BRACE OPEN_BRACE statement_list CLOSE_BRACE + { + mInstructions[gBranchStack.back()].SetDestinationAddress(mInstructions.size()+1); + gBranchStack.pop_back(); + //Now I need to put a GOTO so that the while gets evaluated again... + //jump out of the if + I.Clear(); + I.SetOperation( EOPERATION_BRANCH ); + I.mComment = "while loop goto re-eval boolean"; + I.SetDestinationAddress( gWhileLoopAddress ); + mInstructions.push_back(I); + I.Clear(); + + I.SetOperation( EOPERATION_NOP ); + I.mComment = "branch delay"; + I.SetDestinationAddress( gWhileLoopAddress ); + mInstructions.push_back(I); + I.Clear(); + gInsertedInstructions = 0; + } + | + START IDENTIFIER EOS + { + + } + ; + + + +expression + : + expression ADD term + { + unsigned int TempRegIndex = GetFreeTempRegister(); + I.SetOperation( EOPERATION_ADD ); + I.SetDestinationAddress( TempRegIndex ); + I.SetSrc1Address(GetAddressFromIdentifier($1,yylloc)); + I.SetSrc0Address(GetAddressFromIdentifier($3,yylloc)); + mInstructions.push_back(I); + gInsertedInstructions++; + I.Clear(); + std::stringstream ss; + ss << "R" << TempRegIndex; + $$ = ss.str(); + + //$$ = ss.str(); + + } + | + expression BITWISE_OR term + { + unsigned int TempRegIndex = GetFreeTempRegister(); + I.SetOperation( EOPERATION_OR ); + I.SetDestinationAddress( TempRegIndex ); + I.SetSrc1Address(GetAddressFromIdentifier($1,yylloc)); + I.SetSrc0Address(GetAddressFromIdentifier($3,yylloc)); + mInstructions.push_back(I); + gInsertedInstructions++; + I.Clear(); + std::stringstream ss; + ss << "R" << TempRegIndex; + $$ = ss.str(); + } + | + expression MINUS term + { + unsigned int TempRegIndex = GetFreeTempRegister(); + I.SetOperation( EOPERATION_SUB ); + I.SetDestinationAddress( TempRegIndex ); + I.SetSrc1Address(GetAddressFromIdentifier($1,yylloc)); + I.SetSrc0Address(GetAddressFromIdentifier($3,yylloc)); + mInstructions.push_back(I); + gInsertedInstructions++; + I.Clear(); + std::stringstream ss; + ss << "R" << TempRegIndex; + $$ = ss.str(); + } + | + term + { + $$ = $1; + } + ; + + term + : + factor SHL factor + { + + unsigned int TempRegIndex = GetFreeTempRegister(); + I.SetOperation( EOPERATION_SHL ); + I.SetDestinationAddress( TempRegIndex ); + I.SetSrc1Address(GetAddressFromIdentifier($1,yylloc)); + I.SetSrc0Address(GetAddressFromIdentifier($3,yylloc)); + mInstructions.push_back(I); + gInsertedInstructions++; + I.Clear(); + std::stringstream ss; + ss << "R" << TempRegIndex; + $$ = ss.str(); + } + | + factor SHR factor + { + unsigned int TempRegIndex = GetFreeTempRegister(); + I.SetOperation( EOPERATION_SHR ); + I.SetDestinationAddress( TempRegIndex ); + I.SetSrc1Address(GetAddressFromIdentifier($1,yylloc)); + I.SetSrc0Address(GetAddressFromIdentifier($3,yylloc)); + mInstructions.push_back(I); + gInsertedInstructions++; + I.Clear(); + std::stringstream ss; + ss << "R" << TempRegIndex; + $$ = ss.str(); + } + | + factor BITWISE_AND factor + { + unsigned int TempRegIndex = GetFreeTempRegister(); + I.SetOperation( EOPERATION_AND ); + I.SetDestinationAddress( TempRegIndex ); + I.SetSrc1Address(GetAddressFromIdentifier($1,yylloc)); + I.SetSrc0Address(GetAddressFromIdentifier($3,yylloc)); + mInstructions.push_back(I); + gInsertedInstructions++; + I.Clear(); + std::stringstream ss; + ss << "R" << TempRegIndex; + $$ = ss.str(); + } + | + factor + { + $$ = $1; + } + ; + + factor + : + IDENTIFIER + { + $$ = $1; + } + | + OPEN_ROUND_BRACE expression CLOSE_ROUND_BRACE + { + $$ = $2; + } + | + constant + { + unsigned int ImmediateValue; + std::string StringHex = $1; + std::stringstream ss; + ss << std::hex << StringHex; + ss >> ImmediateValue; + unsigned int TempRegIndex = GetFreeTempRegister(); + I.SetOperation( EOPERATION_ASSIGN ); + // I.mSourceLine = GetCurrentLineNumber( yylloc ); + + I.SetDestinationAddress( TempRegIndex ); + + I.SetLiteral(ImmediateValue); + + mInstructions.push_back(I); + + gInsertedInstructions++; + I.Clear(); + std::stringstream ss2; + ss2 << "R" << TempRegIndex; + $$ = ss2.str(); + } + ; + + + +constant + : + DECCONST + { + // Transform to HEX string + unsigned int Val; + std::string StringDec = $1; + std::stringstream ss; + ss << StringDec; + ss >> Val; + std::stringstream ss2; + ss2 << std::hex << Val; + $$ = ss2.str(); + } + | + HEXCONST + { + std::string StringHex = $1; + // Get rid of the 0x + StringHex.erase(StringHex.begin(),StringHex.begin()+2); + std::stringstream ss; + ss << std::hex << StringHex; + + $$ = ss.str(); + } + | + BINCONST + { + // Transform to HEX string + std::string StringBin = $1; + // Get rid of the 0b + StringBin.erase(StringBin.begin(),StringBin.begin()+2); + std::bitset<32> Bitset( StringBin ); + std::stringstream ss2; + ss2 << std::hex << Bitset; + $$ = ss2.str(); + } + ; + +boolean_expression + : + BLOCK_TRANSFER_IN_PROGRESS + { + + unsigned int ImmediateValue = 0x1; + unsigned int TempRegIndex0 = GetFreeTempRegister(); + I.SetOperation( EOPERATION_ASSIGN ); + I.SetDestinationAddress( TempRegIndex0 ); + I.SetLiteral(ImmediateValue); + mInstructions.push_back(I); + gInsertedInstructions++; + + + I.SetOperation( EOPERATION_BEQ ); + I.SetDestinationAddress( 0 ); + I.SetSrc1Address( STATUS_REG ); + I.SetSrc0Address(TempRegIndex0); + mInstructions.push_back(I); + gInsertedInstructions++; + gBranchStack.push_back(mInstructions.size() - 1); + I.Clear(); + + I.SetOperation( EOPERATION_NOP ); + I.mComment = "branch delay"; + I.SetDestinationAddress( gWhileLoopAddress ); + mInstructions.push_back(I); + I.Clear(); + + + + } + | + expression EQUAL expression + { + + I.SetOperation( EOPERATION_BNE ); + I.SetDestinationAddress( 0 ); + I.SetSrc1Address( GetAddressFromIdentifier($1,yylloc) ); + I.SetSrc0Address( GetAddressFromIdentifier($3,yylloc)); + mInstructions.push_back(I); + gInsertedInstructions++; + gBranchStack.push_back(mInstructions.size() - 1); + I.Clear(); + + I.SetOperation( EOPERATION_NOP ); + I.mComment = "branch delay"; + I.SetDestinationAddress( gWhileLoopAddress ); + mInstructions.push_back(I); + I.Clear(); + + } + | + expression LESS_OR_EQUAL_THAN expression + { + + I.SetOperation( EOPERATION_BLE ); + I.SetDestinationAddress( 0 ); + I.SetSrc1Address( GetAddressFromIdentifier($1,yylloc) ); + I.SetSrc0Address( GetAddressFromIdentifier($3,yylloc)); + mInstructions.push_back(I); + gInsertedInstructions++; + gBranchStack.push_back(mInstructions.size() - 1); + I.Clear(); + + I.SetOperation( EOPERATION_NOP ); + I.mComment = "branch delay"; + I.SetDestinationAddress( gWhileLoopAddress ); + mInstructions.push_back(I); + I.Clear(); + + } +; +scalar_list + : + IDENTIFIER COMMA scalar_list + { + if (gVaribleMap.find($1) != gVaribleMap.end()) + { + std::ostringstream ret; + ret << "Duplicated symbol '" << $1 << "'\n"; + throw ret.str(); + } + + gVaribleMap[ $1 ] = AllocateVariable(); + } + | + IDENTIFIER ASSIGN constant COMMA scalar_list + { + if (gVaribleMap.find($1) != gVaribleMap.end()) + { + std::ostringstream ret; + ret << "Duplicated symbol '" << $1 << "'\n"; + throw ret.str(); + } + + gVaribleMap[ $1 ] = AllocateVariable(); + I.mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation( EOPERATION_ASSIGN ); + I.SetDestinationAddress( gVaribleMap[ $1 ] ); + I.SetLiteral( atoi($3.c_str() ) ); + mInstructions.push_back( I ); + I.Clear(); + + } + | + IDENTIFIER ASSIGN constant + { + if (gVaribleMap.find($1) != gVaribleMap.end()) + { + std::ostringstream ret; + ret << "Duplicated symbol '" << $1 << "'\n"; + throw ret.str(); + } + unsigned int ImmediateValue; + std::string StringHex = $3; + std::stringstream ss; + ss << std::hex << StringHex; + ss >> ImmediateValue; + gVaribleMap[ $1 ] = AllocateVariable(); + I.mSourceLine = GetCurrentLineNumber( yylloc ); + I.SetOperation( EOPERATION_ASSIGN ); + I.SetDestinationAddress( gVaribleMap[ $1 ] ); + I.SetLiteral( ImmediateValue ); + mInstructions.push_back( I ); + I.Clear(); + } + | + IDENTIFIER + { + if (gVaribleMap.find($1) != gVaribleMap.end()) + { + std::ostringstream ret; + ret << "Duplicated symbol '" << $1 << "'\n"; + throw ret.str(); + } + + gVaribleMap[ $1 ] = AllocateVariable(); + } + ; + + +%% + + + +// Error function throws an exception (std::string) with the location and error message +void Theia::Parser::error(const Theia::Parser::location_type &loc, + const std::string &msg) { + std::ostringstream ret; + ret << "\ncp_compile -- Parser Error at " << loc << ": " << msg; + throw ret.str(); +} + +// Now that we have the Parser declared, we can declare the Scanner and implement +// the yylex function +#include "Scanner.h" +static int yylex(Theia::Parser::semantic_type * yylval, + Theia::Parser::location_type * yylloc, + Theia::Scanner &scanner) { + return scanner.yylex(yylval, yylloc); +} + Index: branches/beta_2.0/compiler/src/cp_compiler/Main.cpp =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/Main.cpp (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/Main.cpp (revision 216) @@ -0,0 +1,63 @@ +/* This program is free software. It comes without any warranty, to + * the extent permitted by applicable law. You can redistribute it + * and/or modify it under the terms of the Do What The Fuck You Want + * To Public License, Version 2, as published by Sam Hocevar. See + * http://sam.zoy.org/wtfpl/COPYING for more details. */ + +#include "Compiler.h" +#include "Preprocessor.h" +#include +#include +#include +#include + +Preprocessor PP; + +int main(int argc, char * argv[]) { + // make sure we received a filename + if (argc != 2) { + std::cerr << "Usage: ./theia_cp_compile [FILENAME]" << std::endl; + return 255; + } + + + // try and open the INI file + TheiaCompiler * Compiler; + try { + // - means stdin, not a file named '-' + if (strcmp(argv[1], "-") == 0) { + + Compiler = new TheiaCompiler(std::cin); + } else { + PP.Execute(argv[1]); + + Compiler = new TheiaCompiler( std::string(argv[1])+ ".preprocessed"); + } + } catch (std::string error) { + std::cerr << "ERROR: " << error << std::endl; + std::cout << "ERROR: " << error << std::endl; + return 255; + } + + + std::ofstream ofs; + ofs.open("cp_code.list"); + if (!ofs.good()) + { + std::cout << "Error could not open file for write 'code.mem'\n"; + return 0; + } + + ofs << Compiler->GetHexCodeDump(); + ofs.close(); + ofs.open("control_code.mem"); + ofs << Compiler->PostProcess("code.list"); + ofs.close(); + + delete Compiler; + std::string Command = "rm " + std::string(argv[1])+ ".preprocessed"; + system(Command.c_str()); + std::cout << "Code successfully compiled!\n"; + return 0; +} + Index: branches/beta_2.0/compiler/src/cp_compiler/location.hh =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/location.hh (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/location.hh (revision 216) @@ -0,0 +1,169 @@ + +/* A Bison parser, made by GNU Bison 2.4.1. */ + +/* Locations for Bison parsers in C++ + + Copyright (C) 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. + + 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 + (at your option) 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 . */ + +/* As a special exception, you may create a larger work that contains + part or all of the Bison parser skeleton and distribute that work + under terms of your choice, so long as that work isn't itself a + parser generator using the skeleton or a modified version thereof + as a parser skeleton. Alternatively, if you modify or redistribute + the parser skeleton itself, you may (at your option) remove this + special exception, which will cause the skeleton and the resulting + Bison output files to be licensed under the GNU General Public + License without this special exception. + + This special exception was added by the Free Software Foundation in + version 2.2 of Bison. */ + +/** + ** \file location.hh + ** Define the Theia::location class. + */ + +#ifndef BISON_LOCATION_HH +# define BISON_LOCATION_HH + +# include +# include +# include "position.hh" + + +/* Line 162 of location.cc */ +#line 28 "parser.y" +namespace Theia { + +/* Line 162 of location.cc */ +#line 53 "location.hh" + + /// Abstract a location. + class location + { + public: + + /// Construct a location. + location () + : begin (), end () + { + } + + + /// Initialization. + inline void initialize (std::string* fn) + { + begin.initialize (fn); + end = begin; + } + + /** \name Line and Column related manipulators + ** \{ */ + public: + /// Reset initial location to final location. + inline void step () + { + begin = end; + } + + /// Extend the current location to the COUNT next columns. + inline void columns (unsigned int count = 1) + { + end += count; + } + + /// Extend the current location to the COUNT next lines. + inline void lines (unsigned int count = 1) + { + end.lines (count); + } + /** \} */ + + + public: + /// Beginning of the located region. + position begin; + /// End of the located region. + position end; + }; + + /// Join two location objects to create a location. + inline const location operator+ (const location& begin, const location& end) + { + location res = begin; + res.end = end.end; + return res; + } + + /// Add two location objects. + inline const location operator+ (const location& begin, unsigned int width) + { + location res = begin; + res.columns (width); + return res; + } + + /// Add and assign a location. + inline location& operator+= (location& res, unsigned int width) + { + res.columns (width); + return res; + } + + /// Compare two location objects. + inline bool + operator== (const location& loc1, const location& loc2) + { + return loc1.begin == loc2.begin && loc1.end == loc2.end; + } + + /// Compare two location objects. + inline bool + operator!= (const location& loc1, const location& loc2) + { + return !(loc1 == loc2); + } + + /** \brief Intercept output stream redirection. + ** \param ostr the destination output stream + ** \param loc a reference to the location to redirect + ** + ** Avoid duplicate information. + */ + inline std::ostream& operator<< (std::ostream& ostr, const location& loc) + { + position last = loc.end - 1; + ostr << loc.begin; + if (last.filename + && (!loc.begin.filename + || *loc.begin.filename != *last.filename)) + ostr << '-' << last; + else if (loc.begin.line != last.line) + ostr << '-' << last.line << '.' << last.column; + else if (loc.begin.column != last.column) + ostr << '-' << last.column; + return ostr; + } + + +/* Line 271 of location.cc */ +#line 28 "parser.y" +} // Theia + +/* Line 271 of location.cc */ +#line 168 "location.hh" + +#endif // not BISON_LOCATION_HH Index: branches/beta_2.0/compiler/src/cp_compiler/Preprocessor.cpp =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/Preprocessor.cpp (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/Preprocessor.cpp (revision 216) @@ -0,0 +1,313 @@ +#include "Preprocessor.h" +#include +#include +#include +#include +using namespace std; +void find_and_replace( string& input_string, + const string& find_string, + const string& replace_string ) +{ + if( find_string.empty() + or find_string == replace_string + or input_string.length() < find_string.length() ) + { + return; + } + + string output_string; + output_string.reserve( input_string.length() ); + size_t last_pos = 0u; + for( size_t new_pos = input_string.find( find_string ); + new_pos != string::npos; + new_pos = input_string.find( find_string, new_pos ) ) + { + bool did_replace = false; + if( ( new_pos == 0u + or not std::isalpha( input_string.at( new_pos - 1u ) ) ) + and ( new_pos + find_string.length() == input_string.length() + or not std::isalpha( input_string.at( new_pos + find_string.length() ) ) ) ) + { + output_string.append( input_string, last_pos, new_pos - last_pos ); + output_string.append( replace_string ); + did_replace = true; + } + new_pos += find_string.length(); + if( did_replace ) + { + last_pos = new_pos; + } + } + output_string.append( input_string, last_pos, + input_string.length() - last_pos ); + + input_string.swap( output_string ); +} +//---------------------------------------------------------------- +Preprocessor::Preprocessor() +{ +} +//---------------------------------------------------------------- +Preprocessor::~Preprocessor() +{ +} +//----------------------------------------------------------------------- +void Tokenize(const string& str, + vector& tokens, + const string& delimiters = " ") +{ + + string::size_type lastPos = str.find_first_not_of(delimiters, 0); + string::size_type pos = str.find_first_of(delimiters, lastPos); + + while (string::npos != pos || string::npos != lastPos) + { + + tokens.push_back(str.substr(lastPos, pos - lastPos)); + lastPos = str.find_first_not_of(delimiters, pos); + pos = str.find_first_of(delimiters, lastPos); + } +} +//---------------------------------------------------------------- +void Preprocessor::IncludeFile( string aPath, vector & NewFile ) +{ + ifstream ifs; + ifs.open(aPath.c_str()); + if (!ifs.is_open()) + throw string("Could not include file '") + aPath + "'"; + + while( !ifs.eof()) + { + char Buffer[1024]; + ifs.getline( Buffer,1024 ); + string Line = Buffer; + ScanLine(Line,NewFile,ifs, false); + // NewFile.push_back("//" + Line); + } + ifs.close(); +} +//---------------------------------------------------------------- +void Preprocessor::ScanLine( string & Line , vector & NewFile, ifstream & ifs, bool aAddLineToFile = true ) +{ + //replace tabs with spaces + int pos = 0; + while ((pos = Line.find("\t")) != string::npos) + Line.replace(pos,1," "); + + if (Line.find("#") == string::npos) + { + + NewFile.push_back(Line); + return; + } + + if (Line.find("#macro") != string::npos) + { + if (aAddLineToFile) + NewFile.push_back("//" + Line); + PopulateMacroFunction(Line,ifs,NewFile); + return; + } + + vector Tokens; + Tokenize(Line,Tokens," "); + if (Tokens.size() != 0) + { + + if (Tokens[0] == "#define") + { + mMacros[ Tokens[1] ] = Tokens[2]; + if (aAddLineToFile) + NewFile.push_back("//" + Line); + } + + if (Tokens[0] == "#include") + { + string IncludeFilaPath = Tokens[1]; + + while(IncludeFilaPath.find("\"") != string::npos) IncludeFilaPath.erase(IncludeFilaPath.find("\""),1); + IncludeFile( IncludeFilaPath, NewFile ); + /* ifstream ifs; + ifs.open(IncludeFilaPath.c_str()); + if (!ifs.is_open()) + throw string("Could not include file '") + IncludeFilaPath + "'"; + + while( !ifs.eof()) + { + char Buffer[1024]; + ifs.getline( Buffer,1024 ); + string Line = Buffer; + ScanLine(Line,NewFile,ifs); + // NewFile.push_back("//" + Line); + } + ifs.close(); */ + } + } +} +//---------------------------------------------------------------- +vector Preprocessor::ScanFile( std::ifstream & ifs ) +{ + vector NewFile; + while (!ifs.eof()) + { + char Buffer[1024]; + ifs.getline( Buffer,1024 ); + string Line = Buffer; + ScanLine( Line,NewFile,ifs ); + + + } + + + return NewFile; +} +//---------------------------------------------------------------- +void Preprocessor::SubstitudeMacros( vector & aFile, ofstream & ofs ) +{ + //for (int i = 0; i < NewFile.size(); i++) + int i = 0; + for ( vector::iterator I = aFile.begin(); (I != aFile.end() && i < aFile.size()); I++, i++) + { + + //Now the macro literals + for( map::const_iterator it = mMacros.begin(); it != mMacros.end(); ++it ) + { + string Key = it->first; + string Value = it->second; + string Line = aFile[i]; + if (Line.find("#define") != string::npos) + { + aFile[i] = Line; + continue; + } + find_and_replace(Line,Key,Value); + + aFile[i] = Line; + } + + + //Now the macro functions + for( map::iterator it = mMacroFunctions.begin(); it != mMacroFunctions.end(); ++it ) + { + string Key = it->first; + TMacroFunction MacroFunction = it->second; + string Line =*I; + if (Line.find("//") != string::npos) + Line.erase(Line.find("//"),Line.length()-Line.find("//")); + //continue; + + if (Line.find(Key) != string::npos) + { + int pos = 0; + while ((pos = Line.find(" ")) != string::npos) + Line.erase(pos,1); + vector Tokens; + Tokenize(Line,Tokens,"="); + + MacroFunction.mReturnValue = Tokens[0]; + vector Tokens2; + string Tmp = Tokens[1]; + Tokens.clear(); + Tokenize(Tmp,Tokens,"("); + Tmp = Tokens[1]; + while ((pos = Tmp.find(")")) != string::npos) + Tmp.erase(pos,1); + while ((pos = Tmp.find(";")) != string::npos) + Tmp.erase(pos,1); + Tokens.clear(); + Tokenize(Tmp,Tokens,","); + MacroFunction.mParamterValue = Tokens; + + vector MacroString = MacroFunction.GetSubstitudedMacro(); + aFile[i] = "//" + aFile[i]; + I = aFile.begin() + i+1; + aFile.insert(I,MacroString.begin(),MacroString.end()); + + I = aFile.begin() + i; + } + } + + // cout << aFile[i].c_str() << std::endl; + ofs << aFile[i].c_str() << std::endl; + } +} +//---------------------------------------------------------------- +void Preprocessor::Execute( string aFile ) +{ + ifstream ifs; + ifs.open(aFile.c_str()); + if (!ifs.good()) + std::cout << "Cannot open file" << aFile << "\n"; + cout << "Scanning file " << aFile << "\n"; + vector NewFile = ScanFile( ifs ); + ifs.close(); + cout << "Preprocessing file " << aFile << "\n"; + ofstream ofs(string(aFile + ".preprocessed").c_str()); + SubstitudeMacros( NewFile, ofs ); + ofs.close(); +} +//---------------------------------------------------------------- +vector TMacroFunction::GetSubstitudedMacro() + { + vector ReturnString; + for (int i = 0; i < mLines.size(); i++) + { + + string Line = mLines[i]; + for (int j = 0; j < mParamterSymbol.size(); j++) + { + while( Line.find(mParamterSymbol[j]) != string::npos ) + Line.replace(Line.find(mParamterSymbol[j]),mParamterSymbol[j].length(),mParamterValue[j]); + + while( Line.find(mReturnSymbol) != string::npos ) + Line.replace(Line.find(mReturnSymbol),mReturnSymbol.length(),mReturnValue); + + } + + ReturnString.push_back( Line ); + } + return ReturnString; + } +//---------------------------------------------------------------- +void Preprocessor::PopulateMacroFunction(string aSignature, std::ifstream & ifs, vector & aNewFile) +{ + + //Get rid of spaces + int pos = 0; + while ((pos = aSignature.find(" ")) != string::npos) + aSignature.erase(pos,1); + //Delete the "#macro" string + aSignature.erase(0,6); + vector Tokens; + Tokenize(aSignature,Tokens,"="); + TMacroFunction M; + M.mReturnSymbol = Tokens[0]; + + string Tmp = Tokens[1]; + Tokens.clear(); + Tokenize(Tmp,Tokens,"("); + M.mName = Tokens[0]; + Tmp = Tokens[1]; + while ((pos = Tmp.find(")")) != string::npos) + Tmp.erase(pos,1); + Tokens.clear(); + Tokenize(Tmp,Tokens,","); + M.mParamterSymbol = Tokens; + + int MacroLineCount = 0; + while (MacroLineCount < MAX_MACRO_FUNCTION_LINE_COUNT) + { + char Buffer[1024]; + ifs.getline( Buffer,1024 ); + string Line = Buffer; + aNewFile.push_back("//" + Line); + if (Line.find("#endmacro") != string::npos) + break; + M.mLines.push_back( Line ); + MacroLineCount++; + } + + mMacroFunctions[M.mName] = M; + M.mLines.clear(); +} +//---------------------------------------------------------------- \ No newline at end of file Index: branches/beta_2.0/compiler/src/cp_compiler/Instruction.h =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/Instruction.h (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/Instruction.h (revision 216) @@ -0,0 +1,123 @@ +#ifndef INSTRUCTION_H +#define INSTRUCTION_H + +/********************************************************************************** +Theia, Ray Cast Programable graphic Processing Unit. +Copyright (C) 2012 Diego Valverde (diego.valverde.g@gmail.com) + +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 2 +of the License, or (at your option) 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, write to the Free Software +Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. + +***********************************************************************************/ + +#include +#include +#include + +#define INSTRUCTION_SIZE 32 +#define OPERATION_SIZE 8 +#define DESTINATION_SIZE 4 +#define SOURCE1_SIZE 8 +#define SOURCE0_SIZE 8 +#define SRC_ADDR_SIZE 8 +#define DST_ADDR_SIZE 8 +#define DST_ID_SIZE 4 +#define COPY_SIZE 8 + + +#define SRC0_RNG 7,0 +#define SRC1_RNG 15,8 +#define DST_RNG 23,16 +#define OP_RNG 31,24 +#define COPY_DST_RNG 7,0 +#define COPY_SRC_RNG 15,8 +#define COPY_DSTID_RNG 23,16 +//#define COPY_SIZE_RNG 23,20 + +#define LITERAL_RNG 15,0 + +#define STATUS_REG 2 +#define BLOCK_DST_REG 3 +//////////////////////////////////////////////////////// + +typedef enum +{ + EOPERATION_NOP=0, + EOPERATION_DELIVERCOMMAND, + EOPERATION_ADD, + EOPERATION_SUB, + EOPERATION_AND, + EOPERATION_OR, + EOPERATION_BRANCH, + EOPERATION_BEQ, + EOPERATION_BNE, + EOPERATION_BG, + EOPERATION_BL, + EOPERATION_BGE, + EOPERATION_BLE, + EOPERATION_ASSIGN, + EOPERATION_COPYBLOCK, + EOPERATION_EXIT, + EOPERATION_NOT, + EOPERATION_SHL, + EOPERATION_SHR + +} EOPERATION; + + +typedef enum +{ + VP_COMMAND_START_MAIN_THREAD = 0, + VP_COMMAND_STOP_MAIN_THREAD = 1 +} EVPCOMMAD; + +class CControlInstruction +{ + public: + CControlInstruction(); + ~CControlInstruction(); + public: + + void Clear( void ); + + public: + void SetOperation( EOPERATION aCode ); + void SetDestinationAddress( unsigned int aDestinationAddress ); + void SetSrc1Address( unsigned int aAddress ); + void SetSrc0Address( unsigned int aAddress ); + void SetCopyDestinationAddress( unsigned int aAddress ); + void SetCopySourceAddress( unsigned int aAddress ); + void SetCopyDestinationId( unsigned int aAddress ); + void SetCopySize( unsigned int aAddress ); //High part or SRC0 + void SetLiteral( unsigned int aLiteral ); + std::string PrintAssembly( void ); + //private: + unsigned int mOperation; + unsigned int mDestination; + unsigned int mSource1; + unsigned int mSource0; + unsigned int mCopyDestinationAddress; + unsigned int mCopySourceAddress; + unsigned int mCopyDestinationId; + unsigned int mCopySize; + unsigned int mLiteral; + +public: + int mSourceLine; + std::string mComment; + private: + +}; + +#endif \ No newline at end of file Index: branches/beta_2.0/compiler/src/cp_compiler/Preprocessor.h =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/Preprocessor.h (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/Preprocessor.h (revision 216) @@ -0,0 +1,40 @@ + +#include +#include +#include +using namespace std; +//----------------------------------------------------------------------- +#define MAX_MACRO_FUNCTION_LINE_COUNT 100 +class TMacroFunction +{ +public: + vector GetSubstitudedMacro( void ); + string mName; + string mReturnSymbol; + string mReturnValue; + vector mParamterSymbol; + vector mParamterValue; + vector mLines; +} ; +//-------------------------------------------------------- +class Preprocessor +{ + public: + Preprocessor(); + ~Preprocessor(); +public: + void Execute( string aFile ); + + private: + void ScanLine( string & Line ,vector & NewFile, ifstream & ifs, bool aAddLine); + void IncludeFile( string aPath, vector & NewFile ); + vector ScanFile( ifstream & ifs ); + void SubstitudeMacros( vector & aFile, ofstream & ofs ); + void PopulateMacroFunction(string aSignature, ifstream & ifs, vector & aNewFile); + + map mMacroFunctions; + map mMacros; + vector mIncludes; + +}; +//-------------------------------------------------------- \ No newline at end of file Index: branches/beta_2.0/compiler/src/cp_compiler/lex.yy.cc =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/lex.yy.cc (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/lex.yy.cc (revision 216) @@ -0,0 +1,1819 @@ + +#line 3 "lex.yy.cc" + +#define YY_INT_ALIGNED short int + +/* A lexical scanner generated by flex */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 +#define YY_FLEX_SUBMINOR_VERSION 35 +#if YY_FLEX_SUBMINOR_VERSION > 0 +#define FLEX_BETA +#endif + + /* The c++ scanner is a mess. The FlexLexer.h header file relies on the + * following macro. This is required in order to pass the c++-multiple-scanners + * test in the regression suite. We get reports that it breaks inheritance. + * We will address this in a future release of flex, or omit the C++ scanner + * altogether. + */ + #define yyFlexLexer yyFlexLexer + +/* First, we deal with platform-specific or compiler-specific issues. */ + +/* begin standard C headers. */ + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have . Non-C99 systems may or may not. */ + +#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L + +/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, + * if you want the limit (max/min) macros for int types. + */ +#ifndef __STDC_LIMIT_MACROS +#define __STDC_LIMIT_MACROS 1 +#endif + +#include +typedef int8_t flex_int8_t; +typedef uint8_t flex_uint8_t; +typedef int16_t flex_int16_t; +typedef uint16_t flex_uint16_t; +typedef int32_t flex_int32_t; +typedef uint32_t flex_uint32_t; +#else +typedef signed char flex_int8_t; +typedef short int flex_int16_t; +typedef int flex_int32_t; +typedef unsigned char flex_uint8_t; +typedef unsigned short int flex_uint16_t; +typedef unsigned int flex_uint32_t; + +/* Limits of integral types. */ +#ifndef INT8_MIN +#define INT8_MIN (-128) +#endif +#ifndef INT16_MIN +#define INT16_MIN (-32767-1) +#endif +#ifndef INT32_MIN +#define INT32_MIN (-2147483647-1) +#endif +#ifndef INT8_MAX +#define INT8_MAX (127) +#endif +#ifndef INT16_MAX +#define INT16_MAX (32767) +#endif +#ifndef INT32_MAX +#define INT32_MAX (2147483647) +#endif +#ifndef UINT8_MAX +#define UINT8_MAX (255U) +#endif +#ifndef UINT16_MAX +#define UINT16_MAX (65535U) +#endif +#ifndef UINT32_MAX +#define UINT32_MAX (4294967295U) +#endif + +#endif /* ! C99 */ + +#endif /* ! FLEXINT_H */ + +/* begin standard C++ headers. */ +#include +#include +#include +#include +#include +/* end standard C++ headers. */ + +#ifdef __cplusplus + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +/* C99 requires __STDC__ to be defined as 1. */ +#if defined (__STDC__) + +#define YY_USE_CONST + +#endif /* defined (__STDC__) */ +#endif /* ! __cplusplus */ + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an unsigned + * integer for use as an array index. If the signed char is negative, + * we want to instead treat it as an 8-bit unsigned char, hence the + * double cast. + */ +#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN (yy_start) = 1 + 2 * + +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START (((yy_start) - 1) / 2) +#define YYSTATE YY_START + +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) + +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE yyrestart( yyin ) + +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#ifndef YY_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k. + * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case. + * Ditto for the __ia64__ case accordingly. + */ +#define YY_BUF_SIZE 32768 +#else +#define YY_BUF_SIZE 16384 +#endif /* __ia64__ */ +#endif + +/* The state buf must be large enough to hold one state per character in the main buffer. + */ +#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) + +#ifndef YY_TYPEDEF_YY_BUFFER_STATE +#define YY_TYPEDEF_YY_BUFFER_STATE +typedef struct yy_buffer_state *YY_BUFFER_STATE; +#endif + +extern int yyleng; + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + + #define YY_LESS_LINENO(n) + +/* Return all but the first "n" matched characters back to the input stream. */ +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + *yy_cp = (yy_hold_char); \ + YY_RESTORE_YY_MORE_OFFSET \ + (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) + +#define unput(c) yyunput( c, (yytext_ptr) ) + +#ifndef YY_TYPEDEF_YY_SIZE_T +#define YY_TYPEDEF_YY_SIZE_T +typedef size_t yy_size_t; +#endif + +#ifndef YY_STRUCT_YY_BUFFER_STATE +#define YY_STRUCT_YY_BUFFER_STATE +struct yy_buffer_state + { + + std::istream* yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + yy_size_t yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + int yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + int yy_bs_lineno; /**< The line count. */ + int yy_bs_column; /**< The column count. */ + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; + +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via yyrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + + }; +#endif /* !YY_STRUCT_YY_BUFFER_STATE */ + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + * + * Returns the top of the stack, or NULL. + */ +#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ + ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ + : NULL) + +/* Same as previous macro, but useful when we know that the buffer stack is not + * NULL or when we need an lvalue. For internal use only. + */ +#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] + +void *yyalloc (yy_size_t ); +void *yyrealloc (void *,yy_size_t ); +void yyfree (void * ); + +#define yy_new_buffer yy_create_buffer + +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! YY_CURRENT_BUFFER ){ \ + yyensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + yy_create_buffer( yyin, YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ + } + +#define yy_set_bol(at_bol) \ + { \ + if ( ! YY_CURRENT_BUFFER ){\ + yyensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + yy_create_buffer( yyin, YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ + } + +#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) + +/* Begin user sect3 */ +#define YY_SKIP_YYWRAP + +typedef unsigned char YY_CHAR; + +#define yytext_ptr yytext +#define YY_INTERACTIVE + +#include + +int yyFlexLexer::yywrap() { return 1; } +int yyFlexLexer::yylex() + { + LexerError( "yyFlexLexer::yylex invoked but %option yyclass used" ); + return 0; + } + +#define YY_DECL int Scanner::yylex() + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + (yytext_ptr) = yy_bp; \ + yyleng = (size_t) (yy_cp - yy_bp); \ + (yy_hold_char) = *yy_cp; \ + *yy_cp = '\0'; \ + (yy_c_buf_p) = yy_cp; + +#define YY_NUM_RULES 37 +#define YY_END_OF_BUFFER 38 +/* This struct is not used in this scanner, + but its presence is necessary. */ +struct yy_trans_info + { + flex_int32_t yy_verify; + flex_int32_t yy_nxt; + }; +static yyconst flex_int16_t yy_accept[117] = + { 0, + 0, 0, 38, 36, 3, 2, 36, 10, 18, 19, + 32, 34, 22, 36, 4, 4, 33, 31, 27, 30, + 35, 35, 35, 35, 35, 35, 35, 20, 11, 21, + 3, 24, 0, 4, 0, 0, 28, 25, 23, 26, + 29, 35, 35, 35, 35, 35, 7, 35, 35, 35, + 0, 1, 6, 5, 35, 35, 35, 35, 35, 35, + 35, 35, 35, 8, 12, 35, 35, 35, 35, 35, + 35, 14, 9, 35, 35, 35, 13, 35, 35, 35, + 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, + 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, + + 35, 35, 16, 15, 35, 35, 35, 35, 35, 35, + 35, 35, 35, 35, 17, 0 + } ; + +static yyconst flex_int32_t yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 4, 2, 1, 1, 1, 5, 1, 6, + 7, 1, 8, 9, 10, 1, 11, 12, 13, 14, + 14, 14, 14, 14, 14, 14, 14, 1, 15, 16, + 17, 18, 1, 1, 19, 19, 19, 19, 19, 19, + 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, + 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, + 1, 1, 1, 1, 21, 1, 22, 23, 24, 25, + + 26, 27, 28, 29, 30, 20, 31, 32, 20, 33, + 34, 35, 20, 36, 37, 38, 20, 20, 39, 40, + 41, 42, 43, 44, 45, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static yyconst flex_int32_t yy_meta[46] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 2, 2, 1, 1, 1, 1, 2, 3, + 3, 2, 2, 2, 2, 2, 2, 3, 3, 3, + 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, + 3, 3, 1, 1, 1 + } ; + +static yyconst flex_int16_t yy_base[120] = + { 0, + 0, 0, 147, 148, 144, 148, 128, 148, 148, 148, + 148, 148, 148, 133, 34, 37, 148, 36, 126, 37, + 0, 110, 107, 24, 113, 34, 110, 148, 148, 148, + 136, 148, 134, 47, 50, 0, 148, 148, 148, 148, + 148, 0, 102, 100, 97, 103, 0, 110, 109, 100, + 126, 148, 53, 0, 104, 86, 100, 87, 92, 87, + 90, 90, 99, 0, 0, 97, 80, 91, 95, 43, + 79, 0, 0, 76, 79, 90, 0, 75, 85, 71, + 86, 81, 84, 72, 83, 82, 65, 78, 77, 72, + 66, 65, 70, 61, 60, 57, 68, 67, 69, 58, + + 57, 57, 0, 0, 53, 64, 49, 47, 48, 53, + 44, 47, 34, 33, 0, 148, 73, 76, 67 + } ; + +static yyconst flex_int16_t yy_def[120] = + { 0, + 116, 1, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 117, 117, 117, 117, 117, 117, 117, 116, 116, 116, + 116, 116, 118, 116, 116, 119, 116, 116, 116, 116, + 116, 117, 117, 117, 117, 117, 117, 117, 117, 117, + 118, 116, 116, 119, 117, 117, 117, 117, 117, 117, + 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, + 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, + 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, + 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, + + 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, + 117, 117, 117, 117, 117, 0, 116, 116, 116 + } ; + +static yyconst flex_int16_t yy_nxt[194] = + { 0, + 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, + 14, 15, 16, 16, 17, 18, 19, 20, 21, 21, + 4, 21, 22, 23, 21, 24, 21, 21, 21, 25, + 21, 21, 21, 21, 21, 21, 26, 21, 27, 4, + 4, 4, 28, 29, 30, 34, 34, 34, 34, 34, + 34, 37, 38, 40, 41, 45, 35, 48, 34, 34, + 34, 53, 53, 46, 53, 53, 75, 76, 54, 115, + 114, 49, 113, 36, 42, 42, 51, 51, 51, 112, + 111, 110, 109, 108, 107, 106, 105, 104, 103, 102, + 101, 100, 99, 98, 97, 96, 95, 94, 93, 92, + + 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, + 81, 80, 79, 78, 77, 74, 73, 72, 71, 70, + 69, 68, 67, 66, 65, 64, 63, 62, 52, 61, + 60, 59, 58, 57, 56, 55, 52, 31, 50, 47, + 44, 43, 39, 33, 32, 31, 116, 3, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116 + + } ; + +static yyconst flex_int16_t yy_chk[194] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 15, 15, 15, 16, 16, + 16, 18, 18, 20, 20, 24, 15, 26, 34, 34, + 34, 35, 35, 24, 53, 53, 70, 70, 119, 114, + 113, 26, 112, 15, 117, 117, 118, 118, 118, 111, + 110, 109, 108, 107, 106, 105, 102, 101, 100, 99, + 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, + + 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, + 78, 76, 75, 74, 71, 69, 68, 67, 66, 63, + 62, 61, 60, 59, 58, 57, 56, 55, 51, 50, + 49, 48, 46, 45, 44, 43, 33, 31, 27, 25, + 23, 22, 19, 14, 7, 5, 3, 116, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, + 116, 116, 116 + + } ; + +/* The intent behind this definition is that it'll catch + * any uses of REJECT which flex missed. + */ +#define REJECT reject_used_but_not_detected +#define yymore() yymore_used_but_not_detected +#define YY_MORE_ADJ 0 +#define YY_RESTORE_YY_MORE_OFFSET +#line 1 "scanner.l" +#line 2 "scanner.l" + +/********************************************************************************** +Theia, Ray Cast Programable graphic Processing Unit. +Copyright (C) 2012 Diego Valverde (diego.valverde.g@gmail.com) + +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 2 +of the License, or (at your option) 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, write to the Free Software +Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. + +***********************************************************************************/ + + #include "Scanner.h" + // used to keep track of location + #define YY_USER_ACTION yylloc->columns(yyleng); + int LineNumber = 1; +#line 531 "lex.yy.cc" + +#define INITIAL 0 + +#ifndef YY_NO_UNISTD_H +/* Special case for "unistd.h", since it is non-ANSI. We include it way + * down here because we want the user's section 1 to have been scanned first. + * The user has a chance to override it with an option. + */ +#include +#endif + +#ifndef YY_EXTRA_TYPE +#define YY_EXTRA_TYPE void * +#endif + +#ifndef yytext_ptr +static void yy_flex_strncpy (char *,yyconst char *,int ); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * ); +#endif + +#ifndef YY_NO_INPUT + +#endif + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k */ +#define YY_READ_BUF_SIZE 16384 +#else +#define YY_READ_BUF_SIZE 8192 +#endif /* __ia64__ */ +#endif + +/* Copy whatever the last rule matched to the standard output. */ +#ifndef ECHO +#define ECHO LexerOutput( yytext, yyleng ) +#endif + +/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, + * is returned in "result". + */ +#ifndef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ +\ + if ( (result = LexerInput( (char *) buf, max_size )) < 0 ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); + +#endif + +/* No semi-colon after return; correct usage is to write "yyterminate();" - + * we don't want an extra ';' after the "return" because that will cause + * some compilers to complain about unreachable statements. + */ +#ifndef yyterminate +#define yyterminate() return YY_NULL +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Report a fatal error. */ +#ifndef YY_FATAL_ERROR +#define YY_FATAL_ERROR(msg) LexerError( msg ) +#endif + +/* end tables serialization structures and prototypes */ + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL_IS_OURS 1 +#define YY_DECL int yyFlexLexer::yylex() +#endif /* !YY_DECL */ + +/* Code executed at the beginning of each rule, after yytext and yyleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK break; +#endif + +#define YY_RULE_SETUP \ + YY_USER_ACTION + +/** The main scanner function which does all the work. + */ +YY_DECL +{ + register yy_state_type yy_current_state; + register char *yy_cp, *yy_bp; + register int yy_act; + +#line 43 "scanner.l" + + + + yylloc->step(); + + +#line 643 "lex.yy.cc" + + if ( !(yy_init) ) + { + (yy_init) = 1; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! (yy_start) ) + (yy_start) = 1; /* first start state */ + + if ( ! yyin ) + yyin = & std::cin; + + if ( ! yyout ) + yyout = & std::cout; + + if ( ! YY_CURRENT_BUFFER ) { + yyensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + yy_create_buffer( yyin, YY_BUF_SIZE ); + } + + yy_load_buffer_state( ); + } + + while ( 1 ) /* loops until end-of-file is reached */ + { + yy_cp = (yy_c_buf_p); + + /* Support of yytext. */ + *yy_cp = (yy_hold_char); + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = (yy_start); +yy_match: + do + { + register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 117 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + ++yy_cp; + } + while ( yy_base[yy_current_state] != 148 ); + +yy_find_action: + yy_act = yy_accept[yy_current_state]; + if ( yy_act == 0 ) + { /* have to back up */ + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + yy_act = yy_accept[yy_current_state]; + } + + YY_DO_BEFORE_ACTION; + +do_action: /* This label is used only to access EOF actions. */ + + switch ( yy_act ) + { /* beginning of action switch */ + case 0: /* must back up */ + /* undo the effects of YY_DO_BEFORE_ACTION */ + *yy_cp = (yy_hold_char); + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + goto yy_find_action; + +case 1: +/* rule 1 can match eol */ +YY_RULE_SETUP +#line 49 "scanner.l" +{yylloc->lines(); ;LineNumber++; ;} + YY_BREAK +case 2: +/* rule 2 can match eol */ +YY_RULE_SETUP +#line 50 "scanner.l" +{yylloc->lines(); ;LineNumber++;} + YY_BREAK +case 3: +YY_RULE_SETUP +#line 51 "scanner.l" +{/* do nothing */} + YY_BREAK +case 4: +YY_RULE_SETUP +#line 52 "scanner.l" +{ *yylval = yytext; return Theia::Parser::token::DECCONST; } + YY_BREAK +case 5: +YY_RULE_SETUP +#line 53 "scanner.l" +{ *yylval = yytext; return Theia::Parser::token::HEXCONST; } + YY_BREAK +case 6: +YY_RULE_SETUP +#line 54 "scanner.l" +{ *yylval = yytext; return Theia::Parser::token::BINCONST; } + YY_BREAK +case 7: +YY_RULE_SETUP +#line 55 "scanner.l" +{return Theia::Parser::token::IF;} + YY_BREAK +case 8: +YY_RULE_SETUP +#line 56 "scanner.l" +{return Theia::Parser::token::ELSE;} + YY_BREAK +case 9: +YY_RULE_SETUP +#line 57 "scanner.l" +{return Theia::Parser::token::WHILE;} + YY_BREAK +case 10: +YY_RULE_SETUP +#line 58 "scanner.l" +{return Theia::Parser::token::BITWISE_AND;} + YY_BREAK +case 11: +YY_RULE_SETUP +#line 59 "scanner.l" +{return Theia::Parser::token::BITWISE_OR;} + YY_BREAK +case 12: +YY_RULE_SETUP +#line 60 "scanner.l" +{return Theia::Parser::token::EXIT;} + YY_BREAK +case 13: +YY_RULE_SETUP +#line 61 "scanner.l" +{return Theia::Parser::token::SCALAR;} + YY_BREAK +case 14: +YY_RULE_SETUP +#line 62 "scanner.l" +{return Theia::Parser::token::START;} + YY_BREAK +case 15: +YY_RULE_SETUP +#line 63 "scanner.l" +{return Theia::Parser::token::COPY_DATA_BLOCK;} + YY_BREAK +case 16: +YY_RULE_SETUP +#line 64 "scanner.l" +{return Theia::Parser::token::COPY_CODE_BLOCK;} + YY_BREAK +case 17: +YY_RULE_SETUP +#line 65 "scanner.l" +{return Theia::Parser::token::BLOCK_TRANSFER_IN_PROGRESS;} + YY_BREAK +case 18: +YY_RULE_SETUP +#line 66 "scanner.l" +{return Theia::Parser::token::OPEN_ROUND_BRACE;} + YY_BREAK +case 19: +YY_RULE_SETUP +#line 67 "scanner.l" +{return Theia::Parser::token::CLOSE_ROUND_BRACE;} + YY_BREAK +case 20: +YY_RULE_SETUP +#line 68 "scanner.l" +{return Theia::Parser::token::OPEN_BRACE;} + YY_BREAK +case 21: +YY_RULE_SETUP +#line 69 "scanner.l" +{return Theia::Parser::token::CLOSE_BRACE;} + YY_BREAK +case 22: +YY_RULE_SETUP +#line 70 "scanner.l" +{*yylval = yytext;return Theia::Parser::token::MINUS; } + YY_BREAK +case 23: +YY_RULE_SETUP +#line 71 "scanner.l" +{return Theia::Parser::token::EQUAL; } + YY_BREAK +case 24: +YY_RULE_SETUP +#line 72 "scanner.l" +{return Theia::Parser::token::NOT_EQUAL; } + YY_BREAK +case 25: +YY_RULE_SETUP +#line 73 "scanner.l" +{return Theia::Parser::token::LESS_OR_EQUAL_THAN; } + YY_BREAK +case 26: +YY_RULE_SETUP +#line 74 "scanner.l" +{return Theia::Parser::token::GREATER_OR_EQUAL_THAN; } + YY_BREAK +case 27: +YY_RULE_SETUP +#line 75 "scanner.l" +{return Theia::Parser::token::ASSIGN; } + YY_BREAK +case 28: +YY_RULE_SETUP +#line 76 "scanner.l" +{ return Theia::Parser::token::SHL;} + YY_BREAK +case 29: +YY_RULE_SETUP +#line 77 "scanner.l" +{ return Theia::Parser::token::SHR;} + YY_BREAK +case 30: +YY_RULE_SETUP +#line 78 "scanner.l" +{return Theia::Parser::token::GREATER_THAN; } + YY_BREAK +case 31: +YY_RULE_SETUP +#line 79 "scanner.l" +{return Theia::Parser::token::LESS_THAN; } + YY_BREAK +case 32: +YY_RULE_SETUP +#line 80 "scanner.l" +{return Theia::Parser::token::ADD; } + YY_BREAK +case 33: +YY_RULE_SETUP +#line 81 "scanner.l" +{return Theia::Parser::token::EOS; } + YY_BREAK +case 34: +YY_RULE_SETUP +#line 82 "scanner.l" +{return Theia::Parser::token::COMMA; } + YY_BREAK +case 35: +YY_RULE_SETUP +#line 84 "scanner.l" +{*yylval = yytext; return Theia::Parser::token::IDENTIFIER;} + YY_BREAK +case 36: +YY_RULE_SETUP +#line 85 "scanner.l" +{ + std::ostringstream ret; + ret << "Unknown Indetifier at line " << LineNumber << " '" << yytext << "'\n"; + throw ret.str(); + }; + YY_BREAK +case 37: +YY_RULE_SETUP +#line 90 "scanner.l" +YY_FATAL_ERROR( "flex scanner jammed" ); + YY_BREAK +#line 917 "lex.yy.cc" +case YY_STATE_EOF(INITIAL): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = (yy_hold_char); + YY_RESTORE_YY_MORE_OFFSET + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) + { + /* We're scanning a new file or input source. It's + * possible that this happened because the user + * just pointed yyin at a new source and called + * yylex(). If so, then we have to assure + * consistency between YY_CURRENT_BUFFER and our + * globals. Here is the right place to do so, because + * this is the first action (other than possibly a + * back-up) that will match for the new input source. + */ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; + } + + /* Note that here we test for yy_c_buf_p "<=" to the position + * of the first EOB in the buffer, since yy_c_buf_p will + * already have been incremented past the NUL character + * (since all states make transitions on EOB to the + * end-of-buffer state). Contrast this with the test + * in input(). + */ + if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) + { /* This was really a NUL. */ + yy_state_type yy_next_state; + + (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( ); + + /* Okay, we're now positioned to make the NUL + * transition. We couldn't have + * yy_get_previous_state() go ahead and do it + * for us because it doesn't know how to deal + * with the possibility of jamming (and we don't + * want to build jamming into it because then it + * will run more slowly). + */ + + yy_next_state = yy_try_NUL_trans( yy_current_state ); + + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + + if ( yy_next_state ) + { + /* Consume the NUL. */ + yy_cp = ++(yy_c_buf_p); + yy_current_state = yy_next_state; + goto yy_match; + } + + else + { + yy_cp = (yy_c_buf_p); + goto yy_find_action; + } + } + + else switch ( yy_get_next_buffer( ) ) + { + case EOB_ACT_END_OF_FILE: + { + (yy_did_buffer_switch_on_eof) = 0; + + if ( yywrap( ) ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * yytext, we can now set up + * yy_c_buf_p so that if some total + * hoser (like flex itself) wants to + * call the scanner after we return the + * YY_NULL, it'll still work - another + * YY_NULL will get returned. + */ + (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; + + yy_act = YY_STATE_EOF(YY_START); + goto do_action; + } + + else + { + if ( ! (yy_did_buffer_switch_on_eof) ) + YY_NEW_FILE; + } + break; + } + + case EOB_ACT_CONTINUE_SCAN: + (yy_c_buf_p) = + (yytext_ptr) + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( ); + + yy_cp = (yy_c_buf_p); + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + goto yy_match; + + case EOB_ACT_LAST_MATCH: + (yy_c_buf_p) = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; + + yy_current_state = yy_get_previous_state( ); + + yy_cp = (yy_c_buf_p); + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + goto yy_find_action; + } + break; + } + + default: + YY_FATAL_ERROR( + "fatal flex scanner internal error--no action found" ); + } /* end of action switch */ + } /* end of scanning one token */ +} /* end of yylex */ + +/* The contents of this function are C++ specific, so the () macro is not used. + */ +yyFlexLexer::yyFlexLexer( std::istream* arg_yyin, std::ostream* arg_yyout ) +{ + yyin = arg_yyin; + yyout = arg_yyout; + yy_c_buf_p = 0; + yy_init = 0; + yy_start = 0; + yy_flex_debug = 0; + yylineno = 1; // this will only get updated if %option yylineno + + yy_did_buffer_switch_on_eof = 0; + + yy_looking_for_trail_begin = 0; + yy_more_flag = 0; + yy_more_len = 0; + yy_more_offset = yy_prev_more_offset = 0; + + yy_start_stack_ptr = yy_start_stack_depth = 0; + yy_start_stack = NULL; + + yy_buffer_stack = 0; + yy_buffer_stack_top = 0; + yy_buffer_stack_max = 0; + + yy_state_buf = 0; + +} + +/* The contents of this function are C++ specific, so the () macro is not used. + */ +yyFlexLexer::~yyFlexLexer() +{ + delete [] yy_state_buf; + yyfree(yy_start_stack ); + yy_delete_buffer( YY_CURRENT_BUFFER ); + yyfree(yy_buffer_stack ); +} + +/* The contents of this function are C++ specific, so the () macro is not used. + */ +void yyFlexLexer::switch_streams( std::istream* new_in, std::ostream* new_out ) +{ + if ( new_in ) + { + yy_delete_buffer( YY_CURRENT_BUFFER ); + yy_switch_to_buffer( yy_create_buffer( new_in, YY_BUF_SIZE ) ); + } + + if ( new_out ) + yyout = new_out; +} + +#ifdef YY_INTERACTIVE +int yyFlexLexer::LexerInput( char* buf, int /* max_size */ ) +#else +int yyFlexLexer::LexerInput( char* buf, int max_size ) +#endif +{ + if ( yyin->eof() || yyin->fail() ) + return 0; + +#ifdef YY_INTERACTIVE + yyin->get( buf[0] ); + + if ( yyin->eof() ) + return 0; + + if ( yyin->bad() ) + return -1; + + return 1; + +#else + (void) yyin->read( buf, max_size ); + + if ( yyin->bad() ) + return -1; + else + return yyin->gcount(); +#endif +} + +void yyFlexLexer::LexerOutput( const char* buf, int size ) +{ + (void) yyout->write( buf, size ); +} + +/* yy_get_next_buffer - try to read in a new buffer + * + * Returns a code representing an action: + * EOB_ACT_LAST_MATCH - + * EOB_ACT_CONTINUE_SCAN - continue scanning from current position + * EOB_ACT_END_OF_FILE - end of file + */ +int yyFlexLexer::yy_get_next_buffer() +{ + register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; + register char *source = (yytext_ptr); + register int number_to_move, i; + int ret_val; + + if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) + { /* Don't try to fill the buffer, so this is an EOF. */ + if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 ) + { + /* We matched a single character, the EOB, so + * treat this as a final EOF. + */ + return EOB_ACT_END_OF_FILE; + } + + else + { + /* We matched some text prior to the EOB, first + * process it. + */ + return EOB_ACT_LAST_MATCH; + } + } + + /* Try to read more data. */ + + /* First move last chars to start of buffer. */ + number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1; + + for ( i = 0; i < number_to_move; ++i ) + *(dest++) = *(source++); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) + /* don't do the read, it's not guaranteed to return an EOF, + * just force an EOF + */ + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0; + + else + { + int num_to_read = + YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ + + /* just a shorter name for the current buffer */ + YY_BUFFER_STATE b = YY_CURRENT_BUFFER; + + int yy_c_buf_p_offset = + (int) ((yy_c_buf_p) - b->yy_ch_buf); + + if ( b->yy_is_our_buffer ) + { + int new_size = b->yy_buf_size * 2; + + if ( new_size <= 0 ) + b->yy_buf_size += b->yy_buf_size / 8; + else + b->yy_buf_size *= 2; + + b->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ); + } + else + /* Can't grow it, we don't own it. */ + b->yy_ch_buf = 0; + + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( + "fatal error - scanner input buffer overflow" ); + + (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; + + num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - + number_to_move - 1; + + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), + (yy_n_chars), (size_t) num_to_read ); + + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + if ( (yy_n_chars) == 0 ) + { + if ( number_to_move == YY_MORE_ADJ ) + { + ret_val = EOB_ACT_END_OF_FILE; + yyrestart( yyin ); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { + /* Extend the array by 50%, plus the number we really need. */ + yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); + if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); + } + + (yy_n_chars) += number_to_move; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; + + (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; + + return ret_val; +} + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + + yy_state_type yyFlexLexer::yy_get_previous_state() +{ + register yy_state_type yy_current_state; + register char *yy_cp; + + yy_current_state = (yy_start); + + for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) + { + register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 117 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + } + + return yy_current_state; +} + +/* yy_try_NUL_trans - try to make a transition on the NUL character + * + * synopsis + * next_state = yy_try_NUL_trans( current_state ); + */ + yy_state_type yyFlexLexer::yy_try_NUL_trans( yy_state_type yy_current_state ) +{ + register int yy_is_jam; + register char *yy_cp = (yy_c_buf_p); + + register YY_CHAR yy_c = 1; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 117 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + yy_is_jam = (yy_current_state == 116); + + return yy_is_jam ? 0 : yy_current_state; +} + + void yyFlexLexer::yyunput( int c, register char* yy_bp) +{ + register char *yy_cp; + + yy_cp = (yy_c_buf_p); + + /* undo effects of setting up yytext */ + *yy_cp = (yy_hold_char); + + if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) + { /* need to shift things up to make room */ + /* +2 for EOB chars. */ + register int number_to_move = (yy_n_chars) + 2; + register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[ + YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; + register char *source = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; + + while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + *--dest = *--source; + + yy_cp += (int) (dest - source); + yy_bp += (int) (dest - source); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size; + + if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) + YY_FATAL_ERROR( "flex scanner push-back overflow" ); + } + + *--yy_cp = (char) c; + + (yytext_ptr) = yy_bp; + (yy_hold_char) = *yy_cp; + (yy_c_buf_p) = yy_cp; +} + + int yyFlexLexer::yyinput() +{ + int c; + + *(yy_c_buf_p) = (yy_hold_char); + + if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR ) + { + /* yy_c_buf_p now points to the character we want to return. + * If this occurs *before* the EOB characters, then it's a + * valid NUL; if not, then we've hit the end of the buffer. + */ + if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) + /* This was really a NUL. */ + *(yy_c_buf_p) = '\0'; + + else + { /* need more input */ + int offset = (yy_c_buf_p) - (yytext_ptr); + ++(yy_c_buf_p); + + switch ( yy_get_next_buffer( ) ) + { + case EOB_ACT_LAST_MATCH: + /* This happens because yy_g_n_b() + * sees that we've accumulated a + * token and flags that we need to + * try matching the token before + * proceeding. But for input(), + * there's no matching to consider. + * So convert the EOB_ACT_LAST_MATCH + * to EOB_ACT_END_OF_FILE. + */ + + /* Reset buffer status. */ + yyrestart( yyin ); + + /*FALLTHROUGH*/ + + case EOB_ACT_END_OF_FILE: + { + if ( yywrap( ) ) + return EOF; + + if ( ! (yy_did_buffer_switch_on_eof) ) + YY_NEW_FILE; +#ifdef __cplusplus + return yyinput(); +#else + return input(); +#endif + } + + case EOB_ACT_CONTINUE_SCAN: + (yy_c_buf_p) = (yytext_ptr) + offset; + break; + } + } + } + + c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ + *(yy_c_buf_p) = '\0'; /* preserve yytext */ + (yy_hold_char) = *++(yy_c_buf_p); + + return c; +} + +/** Immediately switch to a different input stream. + * @param input_file A readable stream. + * + * @note This function does not reset the start condition to @c INITIAL . + */ + void yyFlexLexer::yyrestart( std::istream* input_file ) +{ + + if ( ! YY_CURRENT_BUFFER ){ + yyensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + yy_create_buffer( yyin, YY_BUF_SIZE ); + } + + yy_init_buffer( YY_CURRENT_BUFFER, input_file ); + yy_load_buffer_state( ); +} + +/** Switch to a different input buffer. + * @param new_buffer The new input buffer. + * + */ + void yyFlexLexer::yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) +{ + + /* TODO. We should be able to replace this entire function body + * with + * yypop_buffer_state(); + * yypush_buffer_state(new_buffer); + */ + yyensure_buffer_stack (); + if ( YY_CURRENT_BUFFER == new_buffer ) + return; + + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + YY_CURRENT_BUFFER_LVALUE = new_buffer; + yy_load_buffer_state( ); + + /* We don't actually know whether we did this switch during + * EOF (yywrap()) processing, but the only time this flag + * is looked at is after yywrap() is called, so it's safe + * to go ahead and always set it. + */ + (yy_did_buffer_switch_on_eof) = 1; +} + + void yyFlexLexer::yy_load_buffer_state() +{ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; + yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; + (yy_hold_char) = *(yy_c_buf_p); +} + +/** Allocate and initialize an input buffer state. + * @param file A readable stream. + * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. + * + * @return the allocated buffer state. + */ + YY_BUFFER_STATE yyFlexLexer::yy_create_buffer( std::istream* file, int size ) +{ + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_buf_size = size; + + /* yy_ch_buf has to be 2 characters longer than the size given because + * we need to put in 2 end-of-buffer characters. + */ + b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + yy_init_buffer( b, file ); + + return b; +} + +/** Destroy the buffer. + * @param b a buffer created with yy_create_buffer() + * + */ + void yyFlexLexer::yy_delete_buffer( YY_BUFFER_STATE b ) +{ + + if ( ! b ) + return; + + if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ + YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + yyfree((void *) b->yy_ch_buf ); + + yyfree((void *) b ); +} + +extern "C" int isatty (int ); + +/* Initializes or reinitializes a buffer. + * This function is sometimes called more than once on the same buffer, + * such as during a yyrestart() or at EOF. + */ + void yyFlexLexer::yy_init_buffer( YY_BUFFER_STATE b, std::istream* file ) + +{ + int oerrno = errno; + + yy_flush_buffer( b ); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + + /* If b is the current buffer, then yy_init_buffer was _probably_ + * called from yyrestart() or through yy_get_next_buffer. + * In that case, we don't want to reset the lineno or column. + */ + if (b != YY_CURRENT_BUFFER){ + b->yy_bs_lineno = 1; + b->yy_bs_column = 0; + } + + b->yy_is_interactive = 0; + errno = oerrno; +} + +/** Discard all buffered characters. On the next scan, YY_INPUT will be called. + * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. + * + */ + void yyFlexLexer::yy_flush_buffer( YY_BUFFER_STATE b ) +{ + if ( ! b ) + return; + + b->yy_n_chars = 0; + + /* We always need two end-of-buffer characters. The first causes + * a transition to the end-of-buffer state. The second causes + * a jam in that state. + */ + b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; + b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; + + b->yy_buf_pos = &b->yy_ch_buf[0]; + + b->yy_at_bol = 1; + b->yy_buffer_status = YY_BUFFER_NEW; + + if ( b == YY_CURRENT_BUFFER ) + yy_load_buffer_state( ); +} + +/** Pushes the new state onto the stack. The new state becomes + * the current state. This function will allocate the stack + * if necessary. + * @param new_buffer The new state. + * + */ +void yyFlexLexer::yypush_buffer_state (YY_BUFFER_STATE new_buffer) +{ + if (new_buffer == NULL) + return; + + yyensure_buffer_stack(); + + /* This block is copied from yy_switch_to_buffer. */ + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + /* Only push if top exists. Otherwise, replace top. */ + if (YY_CURRENT_BUFFER) + (yy_buffer_stack_top)++; + YY_CURRENT_BUFFER_LVALUE = new_buffer; + + /* copied from yy_switch_to_buffer. */ + yy_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; +} + +/** Removes and deletes the top of the stack, if present. + * The next element becomes the new top. + * + */ +void yyFlexLexer::yypop_buffer_state (void) +{ + if (!YY_CURRENT_BUFFER) + return; + + yy_delete_buffer(YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + if ((yy_buffer_stack_top) > 0) + --(yy_buffer_stack_top); + + if (YY_CURRENT_BUFFER) { + yy_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; + } +} + +/* Allocates the stack if it does not exist. + * Guarantees space for at least one push. + */ +void yyFlexLexer::yyensure_buffer_stack(void) +{ + int num_to_alloc; + + if (!(yy_buffer_stack)) { + + /* First allocation is just for 2 elements, since we don't know if this + * scanner will even need a stack. We use 2 instead of 1 to avoid an + * immediate realloc on the next call. + */ + num_to_alloc = 1; + (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc + (num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); + + memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); + + (yy_buffer_stack_max) = num_to_alloc; + (yy_buffer_stack_top) = 0; + return; + } + + if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ + + /* Increase the buffer to prepare for a possible push. */ + int grow_size = 8 /* arbitrary grow size */; + + num_to_alloc = (yy_buffer_stack_max) + grow_size; + (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc + ((yy_buffer_stack), + num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); + + /* zero only the new slots.*/ + memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); + (yy_buffer_stack_max) = num_to_alloc; + } +} + + void yyFlexLexer::yy_push_state( int new_state ) +{ + if ( (yy_start_stack_ptr) >= (yy_start_stack_depth) ) + { + yy_size_t new_size; + + (yy_start_stack_depth) += YY_START_STACK_INCR; + new_size = (yy_start_stack_depth) * sizeof( int ); + + if ( ! (yy_start_stack) ) + (yy_start_stack) = (int *) yyalloc(new_size ); + + else + (yy_start_stack) = (int *) yyrealloc((void *) (yy_start_stack),new_size ); + + if ( ! (yy_start_stack) ) + YY_FATAL_ERROR( "out of memory expanding start-condition stack" ); + } + + (yy_start_stack)[(yy_start_stack_ptr)++] = YY_START; + + BEGIN(new_state); +} + + void yyFlexLexer::yy_pop_state() +{ + if ( --(yy_start_stack_ptr) < 0 ) + YY_FATAL_ERROR( "start-condition stack underflow" ); + + BEGIN((yy_start_stack)[(yy_start_stack_ptr)]); +} + + int yyFlexLexer::yy_top_state() +{ + return (yy_start_stack)[(yy_start_stack_ptr) - 1]; +} + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +void yyFlexLexer::LexerError( yyconst char msg[] ) +{ + std::cerr << msg << std::endl; + exit( YY_EXIT_FAILURE ); +} + +/* Redefine yyless() so it works in section 3 code. */ + +#undef yyless +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + yytext[yyleng] = (yy_hold_char); \ + (yy_c_buf_p) = yytext + yyless_macro_arg; \ + (yy_hold_char) = *(yy_c_buf_p); \ + *(yy_c_buf_p) = '\0'; \ + yyleng = yyless_macro_arg; \ + } \ + while ( 0 ) + +/* Accessor methods (get/set functions) to struct members. */ + +/* + * Internal utility routines. + */ + +#ifndef yytext_ptr +static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) +{ + register int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; +} +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * s ) +{ + register int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; +} +#endif + +void *yyalloc (yy_size_t size ) +{ + return (void *) malloc( size ); +} + +void *yyrealloc (void * ptr, yy_size_t size ) +{ + /* The cast to (char *) in the following accommodates both + * implementations that use char* generic pointers, and those + * that use void* generic pointers. It works with the latter + * because both ANSI C and C++ allow castless assignment from + * any pointer type to void*, and deal with argument conversions + * as though doing an assignment. + */ + return (void *) realloc( (char *) ptr, size ); +} + +void yyfree (void * ptr ) +{ + free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ +} + +#define YYTABLES_NAME "yytables" + +#line 90 "scanner.l" + + + Index: branches/beta_2.0/compiler/src/cp_compiler/Makefile =================================================================== --- branches/beta_2.0/compiler/src/cp_compiler/Makefile (nonexistent) +++ branches/beta_2.0/compiler/src/cp_compiler/Makefile (revision 216) @@ -0,0 +1,9 @@ +all: + bison parser.y + flex scanner.l + g++ -g lex.yy.cc Main.cpp parser.tab.c Preprocessor.cpp Instruction.cpp -o theia_cp_compile + cp -v theia_cp_compile ../../bin/ +clean: + rm -rf parser.tab.c parser.tab.h location.hh position.hh stack.hh + rm -rf lex.yy.cc + rm -rf theia_compile Index: branches/beta_2.0/compiler/bin/instructions.mem =================================================================== --- branches/beta_2.0/compiler/bin/instructions.mem (nonexistent) +++ branches/beta_2.0/compiler/bin/instructions.mem (revision 216) @@ -0,0 +1 @@ + Index: branches/beta_2.0/compiler/bin/theia_compile =================================================================== --- branches/beta_2.0/compiler/bin/theia_compile (nonexistent) +++ branches/beta_2.0/compiler/bin/theia_compile (revision 216) @@ -0,0 +1,50 @@ + +#!/bin/bash + + +if [ -z "$THEIA_PROJECT_FOLDER" ]; then + echo "Error the environment variable THEIA_PROJECT_FOLDER was not set" + exit 1 +fi +header_file="code_block_header.thh" +#clear the output files +echo > instructions.mem +echo > $header_file +offset=0 +vp_compile_path=$THEIA_PROJECT_FOLDER/compiler/bin/theia_vp_compile +cp_compile_path=$THEIA_PROJECT_FOLDER/compiler/bin/theia_cp_compile +while [ $# -ne 0 ] +do + file_name=$1; + size=$($vp_compile_path -i $file_name -hex32 | grep CodeBlockSize | cut -d ' ' -f 2) + + ##Get rid of file extension + name=${file_name%.*} + name=$(basename $name) + #Convert to upper case + name=$(echo $name | tr '[a-z]' '[A-Z]') + + #Create the include file + echo "#define " $name"_SIZE ("$size"<<20)">> $header_file + echo "#define " $name"_OFFSET" $offset >> $header_file + offset=$(( $offset+$size )) + + #concatenate the code into a big file + cat code.mem >> instructions.mem + + cp_file=${file_name%.*}.cp + if [ ! -f $cp_file ]; then + echo "ERROR: file not found " $cp_file + exit 1 + fi + $cp_compile_path $cp_file + if [ "$?" != "0" ]; then + echo "ERROR: cp_compile failed for file: " $cp_file "!!!" 1>&2 + exit 1 + fi + +shift +done + + + Index: branches/beta_2.0/compiler/bin/theia_cp_compile =================================================================== Cannot display: file marked as a binary type. svn:mime-type = application/octet-stream Index: branches/beta_2.0/compiler/bin/theia_cp_compile =================================================================== --- branches/beta_2.0/compiler/bin/theia_cp_compile (nonexistent) +++ branches/beta_2.0/compiler/bin/theia_cp_compile (revision 216)

branches/beta_2.0/compiler/bin/theia_cp_compile Property changes : Added: svn:mime-type ## -0,0 +1 ## +application/octet-stream \ No newline at end of property Index: branches/beta_2.0/compiler/bin/cp_code.list =================================================================== --- branches/beta_2.0/compiler/bin/cp_code.list (nonexistent) +++ branches/beta_2.0/compiler/bin/cp_code.list (revision 216) @@ -0,0 +1,38 @@ +//List file created by theia_compile +0: 0 //NOP R0 R0 R0 +1: 0 //NOP R0 R0 R0 +2: 0 //NOP R0 R0 R0 +3: d000000 //ASSIGN R0 I(0 ) +// scalar SrcOffset = 0,DstOffset; +4: d0b0000 //ASSIGN R11 I(0 ) +// DstOffset = (0x0 | (147<<20) | (1<<31) ); +5: d800000 //ASSIGN R128 I(0 ) +6: d810093 //ASSIGN R129 I(147 ) +7: d820014 //ASSIGN R130 I(20 ) +8: 11838182 //SHL R131 R129 R130 +9: 5848083 //OR R132 R128 R131 +10: d850001 //ASSIGN R133 I(1 ) +11: d86001f //ASSIGN R134 I(31 ) +12: 11878586 //SHL R135 R133 R134 +13: 5888487 //OR R136 R132 R135 +14: 20a8800 //ADD R10 R136 R0 +15: d800002 //ASSIGN R128 I(2 ) +//Setting destination ID SPR for Copy data block +16: 2038000 //ADD R3 R128 R0 +// copy_data_block < 2 , DstOffset ,SrcOffset>; +//Copy data block +17: e000b0a //COPYBLOCK DstId: R0 SrcOffset: R11 DstOffsetAndLen: R10 +18: d810001 //ASSIGN R129 I(1 ) +19: 7160281 //BEQ R22 R2 R129 +//branch delay +20: 120000 //NOP R18 R0 R0 +//while loop goto re-eval boolean +21: 6120000 //BRANCH R18 R0 R0 +//branch delay +22: 120000 //NOP R18 R0 R0 +// start <2>; +//Start +23: 1030000 //DELIVERCOMMAND R3 R0 R0 +// exit ; +//Exit +24: f000000 //EXIT R0 R0 R0 Index: branches/beta_2.0/compiler/bin/control_code.mem =================================================================== --- branches/beta_2.0/compiler/bin/control_code.mem (nonexistent) +++ branches/beta_2.0/compiler/bin/control_code.mem (revision 216) @@ -0,0 +1,26 @@ +//Code generated bt theia_compile +0 //NOP R0 R0 R0 +0 //NOP R0 R0 R0 +0 //NOP R0 R0 R0 +d000000 //ASSIGN R0 I(0 ) +d0b0000 //ASSIGN R11 I(0 ) +d800000 //ASSIGN R128 I(0 ) +d810093 //ASSIGN R129 I(147 ) +d820014 //ASSIGN R130 I(20 ) +11838182 //SHL R131 R129 R130 +5848083 //OR R132 R128 R131 +d850001 //ASSIGN R133 I(1 ) +d86001f //ASSIGN R134 I(31 ) +11878586 //SHL R135 R133 R134 +5888487 //OR R136 R132 R135 +20a8800 //ADD R10 R136 R0 +d800002 //ASSIGN R128 I(2 ) +2038000 //ADD R3 R128 R0 +e000b0a //COPYBLOCK DstId: R0 SrcOffset: R11 DstOffsetAndLen: R10 +d810001 //ASSIGN R129 I(1 ) +7160281 //BEQ R22 R2 R129 +120000 //NOP R18 R0 R0 +6120000 //BRANCH R18 R0 R0 +120000 //NOP R18 R0 R0 +1030000 //DELIVERCOMMAND R3 R0 R0 +f000000 //EXIT R0 R0 R0 Index: branches/beta_2.0/compiler/bin/theia_vp_compile =================================================================== Cannot display: file marked as a binary type. svn:mime-type = application/octet-stream Index: branches/beta_2.0/compiler/bin/theia_vp_compile =================================================================== --- branches/beta_2.0/compiler/bin/theia_vp_compile (nonexistent) +++ branches/beta_2.0/compiler/bin/theia_vp_compile (revision 216)

branches/beta_2.0/compiler/bin/theia_vp_compile Property changes : Added: svn:mime-type ## -0,0 +1 ## +application/octet-stream \ No newline at end of property Index: branches/beta_2.0/compiler/bin/code_block_header.thh =================================================================== --- branches/beta_2.0/compiler/bin/code_block_header.thh (nonexistent) +++ branches/beta_2.0/compiler/bin/code_block_header.thh (revision 216) @@ -0,0 +1,3 @@ + +#define TEST_DEFAULT_CODE1_SIZE (147<<20) +#define TEST_DEFAULT_CODE1_OFFSET 0

Browse

Tools

Subversion Repositories theia_gpu

Compare Revisions

Rev 215 → Rev 216