-#ifndef GMQCC_LEXER_HDR_
-#define GMQCC_LEXER_HDR_
-
+/*
+ * Copyright (C) 2012, 2013
+ * Wolfgang Bumiller
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy of
+ * this software and associated documentation files (the "Software"), to deal in
+ * the Software without restriction, including without limitation the rights to
+ * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+ * of the Software, and to permit persons to whom the Software is furnished to do
+ * so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ */
+#ifndef GMQCC_LEXER_HDR
+#define GMQCC_LEXER_HDR
typedef struct token_s token;
-#include "ast.h"
-
struct token_s {
- int ttype;
+ int ttype;
- char *value;
+ char *value;
- union {
- vector v;
- int i;
- double f;
- int t; /* type */
- } constval;
+ union {
+ vector v;
+ int i;
+ double f;
+ int t; /* type */
+ } constval;
#if 0
- struct token_s *next;
- struct token_s *prev;
+ struct token_s *next;
+ struct token_s *prev;
#endif
- lex_ctx ctx;
+ lex_ctx ctx;
};
#if 0
TOKEN_DOTS, /* 3 dots, ... */
+ TOKEN_ATTRIBUTE_OPEN, /* [[ */
+ TOKEN_ATTRIBUTE_CLOSE, /* ]] */
+
+ TOKEN_VA_ARGS, /* for the ftepp only */
+ TOKEN_VA_ARGS_ARRAY, /* for the ftepp only */
+ TOKEN_VA_COUNT, /* to get the count of vaargs */
+
TOKEN_STRINGCONST, /* not the typename but an actual "string" */
TOKEN_CHARCONST,
TOKEN_VECTORCONST,
TOKEN_WHITE,
TOKEN_EOL,
- TOKEN_EOF,
+ /* if we add additional tokens before this, the exposed API
+ * should not be broken anyway, but EOF/ERROR/... should
+ * still be at the bottom
+ */
+ TOKEN_EOF = 1024,
/* We use '< TOKEN_ERROR', so TOKEN_FATAL must come after it and any
* other error related tokens as well
TOKEN_FATAL /* internal error, eg out of memory */
};
-static const char *_tokennames[] = {
- "TOKEN_START",
- "TOKEN_IDENT",
- "TOKEN_TYPENAME",
- "TOKEN_OPERATOR",
- "TOKEN_KEYWORD",
- "TOKEN_DOTS",
- "TOKEN_STRINGCONST",
- "TOKEN_CHARCONST",
- "TOKEN_VECTORCONST",
- "TOKEN_INTCONST",
- "TOKEN_FLOATCONST",
- "TOKEN_WHITE",
- "TOKEN_EOL",
- "TOKEN_EOF",
- "TOKEN_ERROR",
- "TOKEN_FATAL",
-};
-typedef int
-_all_tokennames_added_[
- ((TOKEN_FATAL - TOKEN_START + 1) ==
- (sizeof(_tokennames)/sizeof(_tokennames[0])))
- ? 1 : -1];
-
typedef struct {
char *name;
int value;
} frame_macro;
-typedef struct {
- FILE *file;
- const char *open_string;
- size_t open_string_length;
- size_t open_string_pos;
+typedef struct lex_file_s {
+ FILE *file;
+ const char *open_string;
+ size_t open_string_length;
+ size_t open_string_pos;
- char *name;
- size_t line;
- size_t sline; /* line at the start of a token */
+ char *name;
+ size_t line;
+ size_t sline; /* line at the start of a token */
+ size_t column;
- char peek[256];
- size_t peekpos;
+ int peek[256];
+ size_t peekpos;
- bool eof;
+ bool eof;
- token tok; /* not a pointer anymore */
+ token tok; /* not a pointer anymore */
- struct {
- bool noops;
- bool nodigraphs; /* used when lexing string constants */
- bool preprocessing; /* whitespace and EOLs become actual tokens */
- bool mergelines; /* backslash at the end of a line escapes the newline */
- } flags;
+ struct {
+ bool noops;
+ bool nodigraphs; /* used when lexing string constants */
+ bool preprocessing; /* whitespace and EOLs become actual tokens */
+ bool mergelines; /* backslash at the end of a line escapes the newline */
+ } flags;
int framevalue;
- frame_macro *frames;
- char *modelname;
+ frame_macro *frames;
+ char *modelname;
- size_t push_line;
+ size_t push_line;
} lex_file;
lex_file* lex_open (const char *file);
unsigned int operands;
unsigned int id;
unsigned int assoc;
- unsigned int prec;
+ signed int prec;
unsigned int flags;
} oper_info;
-#define opid1(a) (a)
-#define opid2(a,b) ((a<<8)|b)
-#define opid3(a,b,c) ((a<<16)|(b<<8)|c)
+/*
+ * Explicit uint8_t casts since the left operand of shift operator cannot
+ * be negative, even though it won't happen, this supresses the future
+ * possibility.
+ */
+#define opid1(a) ((uint8_t)a)
+#define opid2(a,b) (((uint8_t)a<<8) |(uint8_t)b)
+#define opid3(a,b,c) (((uint8_t)a<<16)|((uint8_t)b<<8)|(uint8_t)c)
static const oper_info c_operators[] = {
{ "(", 0, opid1('('), ASSOC_LEFT, 99, OP_PREFIX}, /* paren expression - non function call */
- { "++", 1, opid3('S','+','+'), ASSOC_LEFT, 16, OP_SUFFIX},
- { "--", 1, opid3('S','-','-'), ASSOC_LEFT, 16, OP_SUFFIX},
+ { "++", 1, opid3('S','+','+'), ASSOC_LEFT, 17, OP_SUFFIX},
+ { "--", 1, opid3('S','-','-'), ASSOC_LEFT, 17, OP_SUFFIX},
+ { ".", 2, opid1('.'), ASSOC_LEFT, 17, 0 },
+ { "(", 0, opid1('('), ASSOC_LEFT, 17, 0 }, /* function call */
+ { "[", 2, opid1('['), ASSOC_LEFT, 17, 0 }, /* array subscript */
- { ".", 2, opid1('.'), ASSOC_LEFT, 15, 0 },
- { "(", 0, opid1('('), ASSOC_LEFT, 15, 0 }, /* function call */
- { "[", 2, opid1('['), ASSOC_LEFT, 15, 0 }, /* array subscript */
+ { "++", 1, opid3('+','+','P'), ASSOC_RIGHT, 16, OP_PREFIX },
+ { "--", 1, opid3('-','-','P'), ASSOC_RIGHT, 16, OP_PREFIX },
+
+ { "**", 2, opid2('*', '*'), ASSOC_RIGHT, 15, 0 },
{ "!", 1, opid2('!', 'P'), ASSOC_RIGHT, 14, OP_PREFIX },
{ "~", 1, opid2('~', 'P'), ASSOC_RIGHT, 14, OP_PREFIX },
{ "+", 1, opid2('+','P'), ASSOC_RIGHT, 14, OP_PREFIX },
{ "-", 1, opid2('-','P'), ASSOC_RIGHT, 14, OP_PREFIX },
- { "++", 1, opid3('+','+','P'), ASSOC_RIGHT, 14, OP_PREFIX },
- { "--", 1, opid3('-','-','P'), ASSOC_RIGHT, 14, OP_PREFIX },
/* { "&", 1, opid2('&','P'), ASSOC_RIGHT, 14, OP_PREFIX }, */
{ "*", 2, opid1('*'), ASSOC_LEFT, 13, 0 },
{ "<", 2, opid1('<'), ASSOC_LEFT, 10, 0 },
{ ">", 2, opid1('>'), ASSOC_LEFT, 10, 0 },
+ { "<=>", 2, opid3('<','=','>'), ASSOC_LEFT, 10, 0 },
{ "<=", 2, opid2('<','='), ASSOC_LEFT, 10, 0 },
{ ">=", 2, opid2('>','='), ASSOC_LEFT, 10, 0 },
{ "&=", 2, opid2('&','='), ASSOC_RIGHT, 2, 0 },
{ "^=", 2, opid2('^','='), ASSOC_RIGHT, 2, 0 },
{ "|=", 2, opid2('|','='), ASSOC_RIGHT, 2, 0 },
+ { "&~=", 2, opid3('&','~','='), ASSOC_RIGHT, 2, 0 },
- { ",", 2, opid1(','), ASSOC_LEFT, 1, 0 }
+ { ":", 0, opid2(':','?'), ASSOC_RIGHT, 1, 0 },
+
+ { ",", 2, opid1(','), ASSOC_LEFT, 0, 0 }
};
static const size_t c_operator_count = (sizeof(c_operators) / sizeof(c_operators[0]));
+static const oper_info fte_operators[] = {
+ { "(", 0, opid1('('), ASSOC_LEFT, 99, OP_PREFIX}, /* paren expression - non function call */
+
+ { "++", 1, opid3('S','+','+'), ASSOC_LEFT, 15, OP_SUFFIX},
+ { "--", 1, opid3('S','-','-'), ASSOC_LEFT, 15, OP_SUFFIX},
+ { ".", 2, opid1('.'), ASSOC_LEFT, 15, 0 },
+ { "(", 0, opid1('('), ASSOC_LEFT, 15, 0 }, /* function call */
+ { "[", 2, opid1('['), ASSOC_LEFT, 15, 0 }, /* array subscript */
+
+ { "!", 1, opid2('!', 'P'), ASSOC_RIGHT, 14, OP_PREFIX },
+ { "+", 1, opid2('+','P'), ASSOC_RIGHT, 14, OP_PREFIX },
+ { "-", 1, opid2('-','P'), ASSOC_RIGHT, 14, OP_PREFIX },
+ { "++", 1, opid3('+','+','P'), ASSOC_RIGHT, 14, OP_PREFIX },
+ { "--", 1, opid3('-','-','P'), ASSOC_RIGHT, 14, OP_PREFIX },
+
+ { "*", 2, opid1('*'), ASSOC_LEFT, 13, 0 },
+ { "/", 2, opid1('/'), ASSOC_LEFT, 13, 0 },
+ { "&", 2, opid1('&'), ASSOC_LEFT, 13, 0 },
+ { "|", 2, opid1('|'), ASSOC_LEFT, 13, 0 },
+
+ { "+", 2, opid1('+'), ASSOC_LEFT, 12, 0 },
+ { "-", 2, opid1('-'), ASSOC_LEFT, 12, 0 },
+
+ { "<<", 2, opid2('<','<'), ASSOC_LEFT, 11, 0 },
+ { ">>", 2, opid2('>','>'), ASSOC_LEFT, 11, 0 },
+
+ { "<", 2, opid1('<'), ASSOC_LEFT, 10, 0 },
+ { ">", 2, opid1('>'), ASSOC_LEFT, 10, 0 },
+ { "<=", 2, opid2('<','='), ASSOC_LEFT, 10, 0 },
+ { ">=", 2, opid2('>','='), ASSOC_LEFT, 10, 0 },
+ { "==", 2, opid2('=','='), ASSOC_LEFT, 10, 0 },
+ { "!=", 2, opid2('!','='), ASSOC_LEFT, 10, 0 },
+
+ { "?", 3, opid2('?',':'), ASSOC_RIGHT, 9, 0 },
+
+ { "=", 2, opid1('='), ASSOC_RIGHT, 8, 0 },
+ { "+=", 2, opid2('+','='), ASSOC_RIGHT, 8, 0 },
+ { "-=", 2, opid2('-','='), ASSOC_RIGHT, 8, 0 },
+ { "*=", 2, opid2('*','='), ASSOC_RIGHT, 8, 0 },
+ { "/=", 2, opid2('/','='), ASSOC_RIGHT, 8, 0 },
+ { "%=", 2, opid2('%','='), ASSOC_RIGHT, 8, 0 },
+ { "&=", 2, opid2('&','='), ASSOC_RIGHT, 8, 0 },
+ { "|=", 2, opid2('|','='), ASSOC_RIGHT, 8, 0 },
+ { "&~=", 2, opid3('&','~','='), ASSOC_RIGHT, 8, 0 },
+
+ { "&&", 2, opid2('&','&'), ASSOC_LEFT, 5, 0 },
+ { "||", 2, opid2('|','|'), ASSOC_LEFT, 5, 0 },
+
+ /* Leave precedence 3 for : with -fcorrect-ternary */
+ { ",", 2, opid1(','), ASSOC_LEFT, 2, 0 },
+ { ":", 0, opid2(':','?'), ASSOC_RIGHT, 1, 0 }
+};
+static const size_t fte_operator_count = (sizeof(fte_operators) / sizeof(fte_operators[0]));
+
static const oper_info qcc_operators[] = {
{ "(", 0, opid1('('), ASSOC_LEFT, 99, OP_PREFIX}, /* paren expression - non function call */
{ "&&", 2, opid2('&','&'), ASSOC_LEFT, 5, 0 },
{ "||", 2, opid2('|','|'), ASSOC_LEFT, 5, 0 },
- { ",", 2, opid1(','), ASSOC_LEFT, 1, 0 }
+ { ",", 2, opid1(','), ASSOC_LEFT, 2, 0 },
};
static const size_t qcc_operator_count = (sizeof(qcc_operators) / sizeof(qcc_operators[0]));
extern const oper_info *operators;
extern size_t operator_count;
-void lexerror(lex_file*, const char *fmt, ...);
+/*void lexerror(lex_file*, const char *fmt, ...);*/
#endif