Convenience function to store a predefined string in the qc string area

[xonotic/gmqcc.git] / ast.h

diff --git a/ast.h b/ast.h
index b2d906e6a0c9bdf3a515d311ea51ba8bc1eeab9f..d0ce67a02aba7846dd0ce31fb6049cdae7e2edc7 100644 (file)
--- a/ast.h
+++ b/ast.h
@@ -39,6 +39,7 @@ typedef struct ast_store_s      ast_store;
 typedef struct ast_entfield_s   ast_entfield;
 typedef struct ast_ifthen_s     ast_ifthen;
 typedef struct ast_ternary_s    ast_ternary;
+typedef struct ast_loop_s       ast_loop;
 
 /* Node interface with common components
  */
@@ -75,6 +76,8 @@ typedef struct
 {
     ast_node_common         node;
     ast_expression_codegen *codegen;
+    int                     vtype;
+    ast_expression         *next;
 } ast_expression_common;
 
 /* Value
@@ -90,8 +93,10 @@ struct ast_value_s
 
     const char *name;
 
+    /*
     int         vtype;
     ast_value  *next;
+    */
 
     bool isconst;
     union {
@@ -237,6 +242,47 @@ void ast_ternary_delete(ast_ternary*);
 
 bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
 
+/* A general loop node
+ *
+ * For convenience it contains 4 parts:
+ * -) (ini) = initializing expression
+ * -) (pre) = pre-loop condition
+ * -) (pst) = post-loop condition
+ * -) (inc) = "increment" expression
+ * The following is a psudo-representation of this loop
+ * note that '=>' bears the logical meaning of "implies".
+ * (a => b) equals (!a || b)
+
+{ini};
+while (has_pre => {pre})
+{
+    {body};
+
+continue:      // a 'continue' will jump here
+    if (has_pst => {pst})
+        break;
+
+    {inc};
+}
+ */
+struct ast_loop_s
+{
+    ast_expression_common expression;
+    ast_expression *initexpr;
+    ast_expression *precond;
+    ast_expression *postcond;
+    ast_expression *increment;
+    ast_expression *body;
+};
+ast_loop* ast_loop_new(lex_ctx ctx,
+                       ast_expression *initexpr,
+                       ast_expression *precond,
+                       ast_expression *postcond,
+                       ast_expression *increment,
+                       ast_expression *body);
+void ast_loop_delete(ast_loop*);
+
+bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
 
 /* Blocks
  *
@@ -275,6 +321,8 @@ struct ast_function_s
 
     ir_function *ir_func;
     ir_block    *curblock;
+    ir_block    *breakblock;
+    ir_block    *continueblock;
 
     size_t       labelcount;
     /* in order for thread safety - for the optional
@@ -288,12 +336,10 @@ struct ast_function_s
 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype);
 /* This will NOT delete the underlying ast_value */
 void ast_function_delete(ast_function*);
-/* TODO: for better readability in dumps, this should take some kind of
- * value prefix...
- * For "optimized" builds this can just keep returning "foo"...
+/* For "optimized" builds this can just keep returning "foo"...
  * or whatever...
  */
-const char* ast_function_label(ast_function*);
+const char* ast_function_label(ast_function*, const char *prefix);
 
 MEM_VECTOR_PROTO(ast_function, ast_block*, blocks);
 
@@ -305,8 +351,13 @@ union ast_expression_u
 {
     ast_expression_common expression;
 
-    ast_binary binary;
-    ast_block  block;
+    ast_value    value;
+    ast_binary   binary;
+    ast_block    block;
+    ast_ternary  ternary;
+    ast_ifthen   ifthen;
+    ast_store    store;
+    ast_entfield entfield;
 };
 
 /* Node union