summary refs log tree commit diff stats
path: root/compiler/pragmas.nim
Commit message (Collapse)AuthorAgeFilesLines
* implemented undocumented '.liftLocals' featureAndreas Rumpf2017-11-021-1/+10
|
* deprecated unary '<'Andreas Rumpf2017-10-291-1/+1
|
* first implementation of package level types that allow forwarding across ↵Andreas Rumpf2017-10-281-2/+2
| | | | module boundaries
* backend preparations for incomplete/forwarded object typesAndreas Rumpf2017-10-281-1/+5
|
* distinguish between 'reorder' and 'noforward'Andreas Rumpf2017-07-261-4/+5
|
* fixes #5846Andreas Rumpf2017-06-291-2/+3
|
* proper error reporting for concepts and the introduction of the {.explain.} ↵Zahary Karadjov2017-03-241-2/+4
| | | | pragma
* fixes #5529; don't merge type visibility flagsAraq2017-03-141-1/+1
|
* removed compiler internal list implementation (#5371)Arne Döring2017-02-221-19/+16
|
* Enabled explicitly unknown lock levels (#5409)Fabian Keller2017-02-201-1/+7
| | | | | | | * enabled explicitly unknown lock levels * allowing "unknown" as locks pragma * added test case for locks pragma * updated docs on locks pragma
* new feature: .used pragma to suppress declared-but-not-used warningAraq2017-02-171-8/+12
|
* new name mangling rules for easier debuggingAndreas Rumpf2017-02-021-0/+1
|
* new name mangling scheme implementedAndreas Rumpf2017-02-021-2/+7
|
* fixes serious regression that was introduced in the handling of .compile pragmaAraq2017-01-281-2/+4
|
* .compile pragma supports patterns and actionsAraq2017-01-281-10/+22
|
* .compile pragma supports wildcardsAraq2017-01-271-4/+16
|
* implements {.gcsafe.} enforcement as a pragma blockAndreas Rumpf2017-01-181-4/+7
|
* fixes #3848Araq2016-12-301-1/+1
|
* Merge branch 'devel' into sighashesAraq2016-12-171-2/+16
|\
| * reworked emit pragma; fixes #4730Andreas Rumpf2016-12-171-2/+16
| |
* | more tests workAraq2016-12-021-1/+4
|/
* fixes the regressions introduced by fix for #5076Araq2016-11-301-0/+1
|
* first version of the new memory tracking featureAndreas Rumpf2016-11-211-1/+2
|
* fixes #4088Andreas Rumpf2016-09-111-1/+3
|
* MergedAraq2016-08-271-30/+25
|\
| * fixes #4579Andreas Rumpf2016-08-231-30/+25
| |
* | next steps in getting symbol files to work againAraq2016-08-161-0/+2
|/
* fixes a regression involving the .compile and .link pragmasAndreas Rumpf2016-08-051-1/+3
|
* fixes #4555Andreas Rumpf2016-08-021-2/+2
|
* stdlib and compiler don't use .immediate anymoreAndreas Rumpf2016-07-291-1/+4
|
* .base pragma works for generic methodsAndreas Rumpf2016-07-281-1/+1
|
* Fix typo. Remove unnecessary procJeff Ciesielski2016-07-051-1/+1
|
* Plumb {.intdefine.} and {.strdefine.} pragmas.Jeff Ciesielski2016-07-041-1/+6
| | | | Shorthand so that users won't need to use the .magic pragma
* fixes #1262Andreas Rumpf2016-05-311-10/+12
|
* Fix issue #4001: invalid pragma {. hint[]: off .}Andrei Formiga2016-05-271-0/+1
| | | | | | | | | | | | | | | The bug was in processNote, module pragmas. The code assumed that a nkBracketExpr AST node always had two children (without testing this), and tried to access elements with index 0 and 1 in the sons array of the nkBracketExpr node. The code that triggered the bug was just {. hint[]: off .} by itself in a module; in this case the nkBracketExpr has only one children in the sons array, so the code in processNote caused an out-of-bounds array access. This commit also adds a test to guarantee that this pragma is rejected, as is.
* fixes #3646Andreas Rumpf2016-04-041-2/+3
|
* first version of .partial objectsAndreas Rumpf2016-02-281-1/+10
|
* added experimental .this pragmaAndreas Rumpf2016-02-281-1/+6
|
* Dont warn about unused symbol if its used in emitYuriy Glukhov2016-02-151-0/+1
|
* added undocumented exportNims pragma for Nimscript supportAraq2015-10-031-7/+11
|
* implement bitsize pragma for bitfieldsAman Gupta2015-09-281-1/+6
|
* fixes #2590; methods now require a .base annotationAraq2015-09-061-1/+4
|
* Merge branch 'devel' into coroutinesrku2015-08-201-271/+273
|\
| * fixes #3171Araq2015-08-021-271/+273
| |
* | {.compile.} pragma accepts paths relative to file pragma is in.rku2015-07-311-0/+2
|/
* small steps for making --symbolFiles:on work againAraq2015-07-201-1/+2
|
* Introduce {.noRewrite.} expr pragma disabling TRAdam Strzelecki2015-06-021-1/+3
| | | | | | | | | | | | | | Term rewriting macros/templates are currently greedy and they will rewrite as long as there is a match. So there was no way to ensure some rewrite happens only once, eg. when rewriting term to same term plus extra content. With new macro we can actually prevent further rewriting on marked expr or stmts, eg. with given example echo(...) will be rewritten just once: template pwnEcho{echo(x)}(x: expr) = {.noRewrite.}: echo("pwned!") echo "ab"
* implements .goto support for variablesAraq2015-04-191-1/+6
|
* Get rid of deprecation warningsdef2015-04-071-3/+3
|
* Merge pull request #2428 from arnetheduck/comp-lib-ropesAndreas Rumpf2015-04-061-1/+1
|\ | | | | Comp lib ropes
on' href='/akkartik/mu/blame/028call_return.cc?h=main&id=b771d375d3e11dcf3e6e55175f2ae128448177a7'>^
3473c63a ^
5109e78f ^
a3f420b6 ^
f116818c ^
40278ae5 ^
f116818c ^
1bc0bb7e ^

f116818c ^
1bc0bb7e ^
6c96a437 ^
f116818c ^

af023b32 ^
2b250717 ^
f116818c ^
1bc0bb7e ^
b24eb476 ^
abc70216 ^
2b250717 ^
f116818c ^
abc70216 ^
4637d58f ^
2b250717 ^
4637d58f ^
1bc0bb7e ^

f116818c ^
1bc0bb7e ^



636837e7 ^



5109e78f ^
0c0bc3ae ^
1ead3562 ^
192d59d3 ^
0c0bc3ae ^
1ead3562 ^
192d59d3 ^

0c0bc3ae ^
1ead3562 ^
0c0bc3ae ^
192d59d3 ^
d135851e ^
9a81d746 ^
87cc473c ^
f116818c ^
9a81d746 ^


4071055a ^
5109e78f ^
5f98a10c ^
1ead3562 ^
192d59d3 ^

87cc473c ^
1ead3562 ^
192d59d3 ^

87cc473c ^
192d59d3 ^
87cc473c ^
5109e78f ^
1ead3562 ^
192d59d3 ^

7402ce32 ^
1ead3562 ^
192d59d3 ^

7402ce32 ^
5f98a10c ^
7402ce32 ^
8dacba82 ^
fca0ebbe ^
8dacba82 ^

ac0e9db5 ^
4082acd2 ^
8dacba82 ^


6c96a437 ^
8dacba82 ^
4082acd2 ^
8dacba82 ^



1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
                                                                
 
                  
          
                      
 
       

                           











                              
                      
 

                              
 
                                             
       
                                        

                                                                
                                                     
                                       
              
                                                          
 
                                                
              
                 
                     
                                                                                                                                     
                                    
                                            
                                     

                                        
   
                                     

                                                                        
                                               
                                                                                            
                                             
                                                                                     
               
                                                             
 
 
                                                           

                      
                                                                       
       
                                                                 
                                        
                                                                                                          
                                                  


                                                               
                                                             
                                                                     
                                                    

                                                          
                                    
                                                                              
                                                                                                       

              
                                                                     
                                                            
                                                                
                                          
                                         
                                                                                                                                                                        
                                                                                                       
                                   

         
                                                                              
                                                                
                                                                     

                                                                                           
                                   
                                                                                                                                                                   
                                     
           
                                                        
                                                                         
                                                                                                                                  
                                     
           
                                                                                                                                                                                                                                       
                                                                                                                                                                                                                                                                                     
           

         
                           



     



                                     
                                
                     
          
              
 
       

                           
                               
                 
 
                                                                 
 
                                                                     
                                                                            
                                                                        


                                                                      
 
                                     
                     
          

                                                                    
 
           

                                    
 
                                                                                
 
                                           
          

                                                                
 
           

                                    
 
         
 
       
                                            

                              
                      
                                   


                     
                                        
                           
                                   



                   
//: Calls can also generate products, using 'reply' or 'return'.

:(scenario return)
def main [
  1:num, 2:num <- f 34
]
def f [
  12:num <- next-ingredient
  13:num <- add 1, 12:num
  return 12:num, 13:num
]
+mem: storing 34 in location 1
+mem: storing 35 in location 2

:(scenario reply)
def main [
  1:num, 2:num <- f 34
]
def f [
  12:num <- next-ingredient
  13:num <- add 1, 12:num
  reply 12:num, 13:num
]
+mem: storing 34 in location 1
+mem: storing 35 in location 2

:(before "End Primitive Recipe Declarations")
RETURN,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "return", RETURN);
put(Recipe_ordinal, "reply", RETURN);  // synonym while teaching
put(Recipe_ordinal, "output", RETURN);  // experiment
:(before "End Primitive Recipe Checks")
case RETURN: {
  break;  // checks will be performed by a transform below
}
:(before "End Primitive Recipe Implementations")
case RETURN: {
  // Begin Return
  if (Trace_stream) {
    trace("trace") << current_instruction().name << ": decrementing callstack depth from " << Trace_stream->callstack_depth << end();
    --Trace_stream->callstack_depth;
    if (Trace_stream->callstack_depth < 0) {
      Current_routine->calls.clear();
      goto stop_running_current_routine;
    }
  }
  Current_routine->calls.pop_front();
  // just in case 'main' returns a value, drop it for now
  if (Current_routine->calls.empty()) goto stop_running_current_routine;
  for (int i = 0;  i < SIZE(ingredients);  ++i)
    trace(9998, "run") << "result " << i << " is " << to_string(ingredients.at(i)) << end();
  // make return products available to caller
  copy(ingredients.begin(), ingredients.end(), inserter(products, products.begin()));
  // End Return
  break;  // continue to process rest of *caller* instruction
}

//: Types in return instructions are checked ahead of time.

:(before "End Checks")
Transform.push_back(check_types_of_return_instructions);  // idempotent
:(code)
void check_types_of_return_instructions(const recipe_ordinal r) {
  const recipe& caller = get(Recipe, r);
  trace(9991, "transform") << "--- check types of return instructions in recipe " << caller.name << end();
  for (int i = 0;  i < SIZE(caller.steps);  ++i) {
    const instruction& caller_instruction = caller.steps.at(i);
    if (caller_instruction.is_label) continue;
    if (caller_instruction.products.empty()) continue;
    if (is_primitive(caller_instruction.operation)) continue;
    const recipe& callee = get(Recipe, caller_instruction.operation);
    for (int i = 0;  i < SIZE(callee.steps);  ++i) {
      const instruction& return_inst = callee.steps.at(i);
      if (return_inst.operation != RETURN) continue;
      // check types with the caller
      if (SIZE(caller_instruction.products) > SIZE(return_inst.ingredients)) {
        raise << maybe(caller.name) << "too few values returned from " << callee.name << '\n' << end();
        break;
      }
      for (int i = 0;  i < SIZE(caller_instruction.products);  ++i) {
        reagent/*copy*/ lhs = return_inst.ingredients.at(i);
        reagent/*copy*/ rhs = caller_instruction.products.at(i);
        // End Check RETURN Copy(lhs, rhs)
        if (!types_coercible(rhs, lhs)) {
          raise << maybe(callee.name) << return_inst.name << " ingredient '" << lhs.original_string << "' can't be saved in '" << rhs.original_string << "'\n" << end();
          raise << "  ['" << to_string(lhs.type) << "' vs '" << to_string(rhs.type) << "']\n" << end();
          goto finish_return_check;
        }
      }
      // check that any return ingredients with /same-as-ingredient connect up
      // the corresponding ingredient and product in the caller.
      for (int i = 0;  i < SIZE(caller_instruction.products);  ++i) {
        if (has_property(return_inst.ingredients.at(i), "same-as-ingredient")) {
          string_tree* tmp = property(return_inst.ingredients.at(i), "same-as-ingredient");
          if (!tmp || !tmp->atom) {
            raise << maybe(caller.name) << "'same-as-ingredient' metadata should take exactly one value in '" << to_original_string(return_inst) << "'\n" << end();
            goto finish_return_check;
          }
          int ingredient_index = to_integer(tmp->value);
          if (ingredient_index >= SIZE(caller_instruction.ingredients)) {
            raise << maybe(caller.name) << "too few ingredients in '" << to_original_string(caller_instruction) << "'\n" << end();
            goto finish_return_check;
          }
          if (!is_dummy(caller_instruction.products.at(i)) && !is_literal(caller_instruction.ingredients.at(ingredient_index)) && caller_instruction.products.at(i).name != caller_instruction.ingredients.at(ingredient_index).name) {
            raise << maybe(caller.name) << "'" << to_original_string(caller_instruction) << "' should write to '" << caller_instruction.ingredients.at(ingredient_index).original_string << "' rather than '" << caller_instruction.products.at(i).original_string << "'\n" << end();
          }
        }
      }
      finish_return_check:;
    }
  }
}

bool is_primitive(recipe_ordinal r) {
  return r < MAX_PRIMITIVE_RECIPES;
}

:(scenario return_type_mismatch)
% Hide_errors = true;
def main [
  3:num <- f 2
]
def f [
  12:num <- next-ingredient
  13:num <- copy 35
  14:point <- copy 12:point/raw
  return 14:point
]
+error: f: return ingredient '14:point' can't be saved in '3:num'

//: In Mu we'd like to assume that any instruction doesn't modify its
//: ingredients unless they're also products. The /same-as-ingredient inside
//: the recipe's 'return' indicates that an ingredient is intended to be
//: modified in place, and will help catch accidental misuse of such
//: 'ingredient-products' (sometimes called in-out parameters in other
//: languages).

:(scenario return_same_as_ingredient)
% Hide_errors = true;
def main [
  1:num <- copy 0
  2:num <- test1 1:num  # call with different ingredient and product
]
def test1 [
  10:num <- next-ingredient
  return 10:num/same-as-ingredient:0
]
+error: main: '2:num <- test1 1:num' should write to '1:num' rather than '2:num'

:(scenario return_same_as_ingredient_dummy)
def main [
  1:num <- copy 0
  _ <- test1 1:num  # call with different ingredient and product
]
def test1 [
  10:num <- next-ingredient
  return 10:num/same-as-ingredient:0
]
$error: 0

:(code)
string to_string(const vector<double>& in) {
  if (in.empty()) return "[]";
  ostringstream out;
  if (SIZE(in) == 1) {
    out << no_scientific(in.at(0));
    return out.str();
  }
  out << "[";
  for (int i = 0;  i < SIZE(in);  ++i) {
    if (i > 0) out << ", ";
    out << no_scientific(in.at(i));
  }
  out << "]";
  return out.str();
}