summary refs log tree commit diff stats
path: root/compiler/treetab.nim
Commit message (Collapse)AuthorAgeFilesLines
* Nil type check implementation (#15287)Alexander Ivanov2020-12-291-3/+7
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | * Nil checking * Enable current older not nil checking again, run new checking only under flag, skip our test * Enable tests, work on try/except and bugs, fix notnil tests * Enable strictNotNil tests (currently with lowercase category) and add some expected output * Work on try/except/finally: still some things unclear and a lot of code can raise out of try * Fix the notnil build by going back to the old version of a test which I shouldn't have changed * Fix test : use action compile * Work on mutation and aliasing: not finished * Render var parititions graph, try to understand it, fix a nilcheck if bug * Rebase, progress on working with partitions * Improve time logic * Fix some bugs, use graph indices instead of symbol in nil map * Fix bugs, test simpler ident aliasing for now, support two mutation levels * Support ContentMutation and ReAssignment: for now just detect possible re assignment for var parameters of calls * Enable several simple passing tests * Cleanup a bit, fix condition/branch infix-related bug * Remove some files, address some comments by Araq * Use internalError and no quit for now * Separate tests with expected warnings and with expected ok, fix a bug with if with a single branch related to copyMap * Fix new data structures, bugs: make tests pass, disable some for now * Work on fixing errors with non-sym nodes, aliasing: tests fail * Work on alias support: simple set-based logic, todo more tests and ref sets? * Use ref sets: TODO can we think of handle seq-s similar to varpartitions' Araq ones * Handle defers in one place, stop raising in reverse to make an async test compile with strictNotNil, add a commented out test * Dot expressions: call/reassignment. Other refactorings and distinct, SeqOfDistinct support. Checkout an older varpartitions * Work on field tracking * Backup : trying to fix bugs when running some stdlib stuff for running an async test * Start a section about strict not nil checking in experimental manual * Fix experimental strict not nil manual section and move it to another file based on Araq feedback * Fix unstructured flow and double warning problems, fix manual, cleanup * Fix if/elif/else : take in account structure according to Araq feedback * Refactor a bit * Work on bracket expr support, re-enable tests, clarify in manual/tests/implementation static index support for now * Work on compiling stdlib and compiler with strictNotNil * Small fixes to the manual for strictNotNil * Fix idgen for strict check nil rebase * Enable some simple tests, remove old stuff, comment out code/print * Copy the original varpartitions source instead of my changes * Remove some files
* Cosmetic compiler cleanup (#12718)Clyybber2019-11-281-11/+11
| | | | | | | | | | | | | | | | | | * Cleanup compiler code base * Unify add calls * Unify len invocations * Unify range operators * Fix oversight * Remove {.procvar.} pragma * initCandidate -> newCandidate where reasonable * Unify safeLen calls
* Small ast.nim cleanup (#12156)Clyybber2019-09-091-3/+3
| | | | | * Remove sonsLen * Use Indexable
* Replace countup(x, y) with x .. yClyybber2019-05-071-2/+2
|
* Replace countup(x, y-1) with x ..< yClyybber2019-05-071-2/+2
|
* even more strict isNil handling for strings/seqs in order to detect bugsAraq2018-08-221-2/+1
|
* compiler: Trim .nim files trailing whitespaceAdam Strzelecki2015-09-041-38/+38
| | | | via OSX: find . -name '*.nim' -exec sed -i '' -E 's/[[:space:]]+$//' {} +
* Dropped 'T' from typespdw2015-06-041-7/+7
|
* tables work in 'const' sections; echo supports 'nil' strings; minor cleanupsAraq2015-02-091-2/+3
|
* Nimrod renamed to NimAraq2014-08-281-1/+1
|
* case consistency: next stepsAraq2013-12-291-2/+2
|
* case consistency part 4Araq2013-12-271-1/+1
|
* case consistency part 1Araq2013-12-271-15/+15
|
* Removes executable bit for text files.Grzegorz Adam Hankiewicz2013-03-161-0/+0
|
* fixes 259Araq2012-11-211-2/+2
|
* year 2012 for most copyright headersAraq2012-01-021-1/+1
|
* much more efficient rod file generationAraq2011-10-181-1/+1
|
* got rid of nstrtabs and nhashes modulesAraq2011-06-101-9/+9
|
* gc tweaking to gain a few percent of performanceAraq2011-05-071-31/+16
|
* big repo cleanupAraq2011-04-121-0/+125
re>4d6b5173 ^
1ed9af83 ^
4d6b5173 ^




1ed9af83 ^
4d6b5173 ^

5cee5562 ^





e709c65e ^
1ed9af83 ^







5f128523 ^

8e7827df ^
5f128523 ^
9a31c34f ^



5f128523 ^
e709c65e ^




9a31c34f ^

1ed9af83 ^
4d6b5173 ^
1ed9af83 ^



9a31c34f ^
1ed9af83 ^

9a31c34f ^
5f128523 ^
9a31c34f ^

5f128523 ^
9a31c34f ^









5f128523 ^
9a31c34f ^
5f128523 ^
9a31c34f ^







5f128523 ^
9a31c34f ^


5f128523 ^
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
178
179
180
181
182
183
184
185




                                                                






                          

 





                                 


                                                                                        


                                          




                                           
                                                    
 



















                                             
                         


                                                            
 
                                      

                                        
 
                       

             
 






                                                                 
                         


                             



                                           
                       




                                           
                       

                               


                                           
                       




                                           
                       




                                           
                       




                                           
                       

                               





                                        
 







                                                                               

 
                                                                           
 



                               
 




                                           

                                              
                             
                                                                                                        



                        
     

                                  
   
 

                                                                          
 









                                                 
 
                            
 







                                                               
 


                                                                      
 
// if s1 starts with s2 returns true, else false
// len is the length of s1
// s2 should be null-terminated
static bool starts_with(const char *s1, int len, const char *s2)
{
  int n = 0;
  while (*s2 && n < len) {
    if (*s1++ != *s2++)
      return false;
    n++;
  }
  return *s2 == 0;
}

#define FOO(...) { \
  FILE* f = fopen("log", "a+"); \
  fprintf(f, __VA_ARGS__); \
  fclose(f); \
}

// convert escape sequence to event, and return consumed bytes on success (failure == 0)
static int parse_escape_seq(struct tb_event *event, const char *buf, int len)
{
  static int parse_attempts = 0;
  static const int MAX_PARSE_ATTEMPTS = 2;

//?   int x = 0;
//?   FOO("-- %d\n", len);
//?   for (x = 0; x < len; ++x) {
//?     FOO("%d\n", (unsigned char)buf[x]);
//?   }
  if (len >= 6 && starts_with(buf, len, "\033[M")) {

    switch (buf[3] & 3) {
    case 0:
      if (buf[3] == 0x60)
        event->key = TB_KEY_MOUSE_WHEEL_UP;
      else
        event->key = TB_KEY_MOUSE_LEFT;
      break;
    case 1:
      if (buf[3] == 0x61)
        event->key = TB_KEY_MOUSE_WHEEL_DOWN;
      else
        event->key = TB_KEY_MOUSE_MIDDLE;
      break;
    case 2:
      event->key = TB_KEY_MOUSE_RIGHT;
      break;
    case 3:
      event->key = TB_KEY_MOUSE_RELEASE;
      break;
    default:
      parse_attempts = 0;
      return -6;
    }
    event->type = TB_EVENT_MOUSE; // TB_EVENT_KEY by default

    // the coord is 1,1 for upper left
    event->x = (uint8_t)buf[4] - 1 - 32;
    event->y = (uint8_t)buf[5] - 1 - 32;

    parse_attempts = 0;
    return 6;
  }

  // it's pretty simple here, find 'starts_with' match and return
  // success, else return failure
  int i;
  for (i = 0; keys[i]; i++) {
    if (starts_with(buf, len, keys[i])) {
      event->ch = 0;
      event->key = 0xFFFF-i;
      parse_attempts = 0;
      return strlen(keys[i]);
    }
  }

  if (starts_with(buf, len, "\033[200~")) {
    event->ch = 0;
    event->key = TB_KEY_START_PASTE;
    parse_attempts = 0;
    return strlen("\033[200~");
  }
  if (starts_with(buf, len, "\033[201~")) {
    event->ch = 0;
    event->key = TB_KEY_END_PASTE;
    parse_attempts = 0;
    return strlen("\033[201~");
  }
  if (starts_with(buf, len, "\033[1;5A")) {
    event->ch = 0;
    event->key = TB_KEY_CTRL_ARROW_UP;
    parse_attempts = 0;
    return strlen("\033[1;5A");
  }
  if (starts_with(buf, len, "\033[1;5B")) {
    event->ch = 0;
    event->key = TB_KEY_CTRL_ARROW_DOWN;
    parse_attempts = 0;
    return strlen("\033[1;5B");
  }
  if (starts_with(buf, len, "\033[1;5C")) {
    event->ch = 0;
    event->key = TB_KEY_CTRL_ARROW_RIGHT;
    parse_attempts = 0;
    return strlen("\033[1;5C");
  }
  if (starts_with(buf, len, "\033[1;5D")) {
    event->ch = 0;
    event->key = TB_KEY_CTRL_ARROW_LEFT;
    parse_attempts = 0;
    return strlen("\033[1;5D");
  }
  if (starts_with(buf, len, "\033[Z")) {
    event->ch = 0;
    event->key = TB_KEY_SHIFT_TAB;
    parse_attempts = 0;
    return strlen("\033[Z");
  }

  // no escape sequence recognized? wait a bit in case our buffer is incomplete
  ++parse_attempts;
  if (parse_attempts < MAX_PARSE_ATTEMPTS) return 0;
  // still nothing? give up and consume just the esc
  event->ch = 0;
  event->key = TB_KEY_ESC;
  parse_attempts = 0;
  return 1;
}

static bool extract_event(struct tb_event *event, struct bytebuffer *inbuf)
{
  const char *buf = inbuf->buf;
  const int len = inbuf->len;
  if (len == 0)
    return false;

//?   int x = 0;
//?   FOO("== %d\n", len);
//?   for (x = 0; x < len; ++x) {
//?     FOO("%x\n", (unsigned char)buf[x]);
//?   }
  if (buf[0] == '\033') {
    int n = parse_escape_seq(event, buf, len);
    if (n == 0) return false;
//?     FOO("parsed: %u %u %u %u\n", n, (unsigned int)event->type, (unsigned int)event->key, event->ch);
    bool success = true;
    if (n < 0) {
      success = false;
      n = -n;
    }
    bytebuffer_truncate(inbuf, n);
    return success;
  }

  // if we're here, this is not an escape sequence and not an alt sequence
  // so, it's a FUNCTIONAL KEY or a UNICODE character

  // first of all check if it's a functional key
  if ((unsigned char)buf[0] <= TB_KEY_SPACE ||
      (unsigned char)buf[0] == TB_KEY_BACKSPACE2)
  {
    // fill event, pop buffer, return success */
    event->ch = 0;
    event->key = (uint16_t)buf[0];
    bytebuffer_truncate(inbuf, 1);
    return true;
  }

  // feh... we got utf8 here

  // check if there is all bytes
  if (len >= tb_utf8_char_length(buf[0])) {
    /* everything ok, fill event, pop buffer, return success */
    tb_utf8_char_to_unicode(&event->ch, buf);
    event->key = 0;
    bytebuffer_truncate(inbuf, tb_utf8_char_length(buf[0]));
    return true;
  }

  // event isn't recognized, perhaps there is not enough bytes in utf8
  // sequence
  return false;
}