Mercurial > hg > octave-nkf
annotate src/parse-tree/pt-loop.h @ 15097:7c7b9ea23a86 classdef
maint: periodic merge of default to classdef
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Fri, 03 Aug 2012 18:04:33 -0400 |
parents | 46b19589b593 |
children |
rev | line source |
---|---|
2982 | 1 /* |
2 | |
14138
72c96de7a403
maint: update copyright notices for 2012
John W. Eaton <jwe@octave.org>
parents:
13245
diff
changeset
|
3 Copyright (C) 1996-2012 John W. Eaton |
2982 | 4 |
5 This file is part of Octave. | |
6 | |
7 Octave is free software; you can redistribute it and/or modify it | |
8 under the terms of the GNU General Public License as published by the | |
7016 | 9 Free Software Foundation; either version 3 of the License, or (at your |
10 option) any later version. | |
2982 | 11 |
12 Octave is distributed in the hope that it will be useful, but WITHOUT | |
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 for more details. | |
16 | |
17 You should have received a copy of the GNU General Public License | |
7016 | 18 along with Octave; see the file COPYING. If not, see |
19 <http://www.gnu.org/licenses/>. | |
2982 | 20 |
21 */ | |
22 | |
23 #if !defined (octave_tree_loop_h) | |
24 #define octave_tree_loop_h 1 | |
25 | |
26 class octave_value; | |
27 class octave_lvalue; | |
28 | |
29 class tree_argument_list; | |
30 class tree_expression; | |
31 class tree_statement_list; | |
32 | |
33 class tree_walker; | |
34 | |
3665 | 35 #include "comment-list.h" |
2982 | 36 #include "pt-cmd.h" |
7336 | 37 #include "symtab.h" |
2982 | 38 |
14906 | 39 class jit_info; |
40 | |
2982 | 41 // While. |
42 | |
43 class | |
44 tree_while_command : public tree_command | |
45 { | |
46 public: | |
47 | |
48 tree_while_command (int l = -1, int c = -1) | |
3665 | 49 : tree_command (l, c), expr (0), list (0), lead_comm (0), |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
50 trail_comm (0) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
51 #ifdef HAVE_LLVM |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
52 , compiled (0) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
53 #endif |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
54 { } |
2982 | 55 |
3665 | 56 tree_while_command (tree_expression *e, |
10313 | 57 octave_comment_list *lc = 0, |
58 octave_comment_list *tc = 0, | |
59 int l = -1, int c = -1) | |
3665 | 60 : tree_command (l, c), expr (e), list (0), lead_comm (lc), |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
61 trail_comm (tc) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
62 #ifdef HAVE_LLVM |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
63 , compiled (0) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
64 #endif |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
65 { } |
2982 | 66 |
67 tree_while_command (tree_expression *e, tree_statement_list *lst, | |
10313 | 68 octave_comment_list *lc = 0, |
69 octave_comment_list *tc = 0, | |
70 int l = -1, int c = -1) | |
3665 | 71 : tree_command (l, c), expr (e), list (lst), lead_comm (lc), |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
72 trail_comm (tc) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
73 #ifdef HAVE_LLVM |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
74 , compiled (0) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
75 #endif |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
76 { } |
2982 | 77 |
78 ~tree_while_command (void); | |
79 | |
80 tree_expression *condition (void) { return expr; } | |
81 | |
82 tree_statement_list *body (void) { return list; } | |
83 | |
3665 | 84 octave_comment_list *leading_comment (void) { return lead_comm; } |
85 | |
86 octave_comment_list *trailing_comment (void) { return trail_comm; } | |
87 | |
7767
71f068b22fcc
scope and context fixes for function handles
John W. Eaton <jwe@octave.org>
parents:
7336
diff
changeset
|
88 tree_command *dup (symbol_table::scope_id scope, |
10313 | 89 symbol_table::context_id context) const; |
5861 | 90 |
2982 | 91 void accept (tree_walker& tw); |
92 | |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
93 #ifdef HAVE_LLVM |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
94 // some functions use by tree_jit |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
95 jit_info *get_info (void) const |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
96 { |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
97 return compiled; |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
98 } |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
99 |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
100 void stash_info (jit_info *jinfo) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
101 { |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
102 compiled = jinfo; |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
103 } |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
104 #endif |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
105 |
3484 | 106 protected: |
2982 | 107 |
108 // Expression to test. | |
109 tree_expression *expr; | |
110 | |
111 // List of commands to execute. | |
112 tree_statement_list *list; | |
2988 | 113 |
3665 | 114 // Comment preceding WHILE token. |
115 octave_comment_list *lead_comm; | |
116 | |
117 // Comment preceding ENDWHILE token. | |
118 octave_comment_list *trail_comm; | |
119 | |
3484 | 120 private: |
121 | |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
122 #ifdef HAVE_LLVM |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
123 // compiled version of the loop |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
124 jit_info *compiled; |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
125 #endif |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
126 |
2988 | 127 // No copying! |
128 | |
129 tree_while_command (const tree_while_command&); | |
130 | |
131 tree_while_command& operator = (const tree_while_command&); | |
2982 | 132 }; |
133 | |
3484 | 134 // Do-Until. |
135 | |
136 class | |
137 tree_do_until_command : public tree_while_command | |
138 { | |
139 public: | |
140 | |
141 tree_do_until_command (int l = -1, int c = -1) | |
142 : tree_while_command (l, c) { } | |
143 | |
3665 | 144 tree_do_until_command (tree_expression *e, |
10313 | 145 octave_comment_list *lc = 0, |
146 octave_comment_list *tc = 0, | |
147 int l = -1, int c = -1) | |
3665 | 148 : tree_while_command (e, lc, tc, l, c) { } |
3484 | 149 |
150 tree_do_until_command (tree_expression *e, tree_statement_list *lst, | |
10313 | 151 octave_comment_list *lc = 0, |
152 octave_comment_list *tc = 0, | |
153 int l = -1, int c = -1) | |
3665 | 154 : tree_while_command (e, lst, lc, tc, l, c) { } |
3484 | 155 |
156 ~tree_do_until_command (void) { } | |
157 | |
7767
71f068b22fcc
scope and context fixes for function handles
John W. Eaton <jwe@octave.org>
parents:
7336
diff
changeset
|
158 tree_command *dup (symbol_table::scope_id scope, |
10313 | 159 symbol_table::context_id context) const; |
5861 | 160 |
3484 | 161 void accept (tree_walker& tw); |
162 | |
163 private: | |
164 | |
165 // No copying! | |
166 | |
167 tree_do_until_command (const tree_do_until_command&); | |
168 | |
169 tree_do_until_command& operator = (const tree_do_until_command&); | |
170 }; | |
171 | |
2982 | 172 // For. |
173 | |
174 class | |
175 tree_simple_for_command : public tree_command | |
176 { | |
177 public: | |
178 | |
179 tree_simple_for_command (int l = -1, int c = -1) | |
13245
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
180 : tree_command (l, c), parallel (false), lhs (0), expr (0), |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
181 maxproc (0), list (0), lead_comm (0), trail_comm (0) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
182 #ifdef HAVE_LLVM |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
183 , compiled (0) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
184 #endif |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
185 { } |
2982 | 186 |
13245
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
187 tree_simple_for_command (bool parallel_arg, tree_expression *le, |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
188 tree_expression *re, |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
189 tree_expression *maxproc_arg, |
10313 | 190 tree_statement_list *lst, |
191 octave_comment_list *lc = 0, | |
192 octave_comment_list *tc = 0, | |
193 int l = -1, int c = -1) | |
13245
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
194 : tree_command (l, c), parallel (parallel_arg), lhs (le), |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
195 expr (re), maxproc (maxproc_arg), list (lst), |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
196 lead_comm (lc), trail_comm (tc) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
197 #ifdef HAVE_LLVM |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
198 , compiled (0) |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
199 #endif |
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
200 { } |
2982 | 201 |
202 ~tree_simple_for_command (void); | |
203 | |
13245
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
204 bool in_parallel (void) { return parallel; } |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
205 |
2982 | 206 tree_expression *left_hand_side (void) { return lhs; } |
207 | |
208 tree_expression *control_expr (void) { return expr; } | |
209 | |
13245
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
210 tree_expression *maxproc_expr (void) { return maxproc; } |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
211 |
2982 | 212 tree_statement_list *body (void) { return list; } |
213 | |
3665 | 214 octave_comment_list *leading_comment (void) { return lead_comm; } |
215 | |
216 octave_comment_list *trailing_comment (void) { return trail_comm; } | |
217 | |
7767
71f068b22fcc
scope and context fixes for function handles
John W. Eaton <jwe@octave.org>
parents:
7336
diff
changeset
|
218 tree_command *dup (symbol_table::scope_id scope, |
10313 | 219 symbol_table::context_id context) const; |
5861 | 220 |
2982 | 221 void accept (tree_walker& tw); |
222 | |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
223 #ifdef HAVE_LLVM |
14906 | 224 // some functions use by tree_jit |
14920
51d4b1018efb
For loops compile with new IR
Max Brister <max@2bass.com>
parents:
14906
diff
changeset
|
225 jit_info *get_info (void) const |
14906 | 226 { |
14920
51d4b1018efb
For loops compile with new IR
Max Brister <max@2bass.com>
parents:
14906
diff
changeset
|
227 return compiled; |
14906 | 228 } |
229 | |
14920
51d4b1018efb
For loops compile with new IR
Max Brister <max@2bass.com>
parents:
14906
diff
changeset
|
230 void stash_info (jit_info *jinfo) |
14906 | 231 { |
14920
51d4b1018efb
For loops compile with new IR
Max Brister <max@2bass.com>
parents:
14906
diff
changeset
|
232 compiled = jinfo; |
14906 | 233 } |
15023
75d1bc2fd6d2
Compile top level while loops in JIT.
Max Brister <max@2bass.com>
parents:
14920
diff
changeset
|
234 #endif |
14906 | 235 |
2982 | 236 private: |
13245
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
237 // TRUE means operate in parallel (subject to the value of the |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
238 // maxproc expression). |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
239 bool parallel; |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
240 |
2982 | 241 // Expression to modify. |
242 tree_expression *lhs; | |
243 | |
244 // Expression to evaluate. | |
245 tree_expression *expr; | |
246 | |
13245
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
247 // Expression to tell how many processors should be used (only valid |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
248 // if parallel is TRUE). |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
249 tree_expression *maxproc; |
027a2186cd90
parfor keyword and infrastructure, but handle parfor as normal for loop for now
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
250 |
2982 | 251 // List of commands to execute. |
252 tree_statement_list *list; | |
253 | |
3665 | 254 // Comment preceding FOR token. |
255 octave_comment_list *lead_comm; | |
256 | |
257 // Comment preceding ENDFOR token. | |
258 octave_comment_list *trail_comm; | |
259 | |
14920
51d4b1018efb
For loops compile with new IR
Max Brister <max@2bass.com>
parents:
14906
diff
changeset
|
260 // compiled version of the loop |
51d4b1018efb
For loops compile with new IR
Max Brister <max@2bass.com>
parents:
14906
diff
changeset
|
261 jit_info *compiled; |
14906 | 262 |
2988 | 263 // No copying! |
264 | |
265 tree_simple_for_command (const tree_simple_for_command&); | |
266 | |
267 tree_simple_for_command& operator = (const tree_simple_for_command&); | |
2982 | 268 }; |
269 | |
270 class | |
271 tree_complex_for_command : public tree_command | |
272 { | |
273 public: | |
274 | |
275 tree_complex_for_command (int l = -1, int c = -1) | |
3665 | 276 : tree_command (l, c), lhs (0), expr (0), list (0), lead_comm (0), |
277 trail_comm (0) { } | |
2982 | 278 |
279 tree_complex_for_command (tree_argument_list *le, tree_expression *re, | |
10313 | 280 tree_statement_list *lst, |
281 octave_comment_list *lc = 0, | |
282 octave_comment_list *tc = 0, | |
283 int l = -1, int c = -1) | |
3665 | 284 : tree_command (l, c), lhs (le), expr (re), list (lst), |
285 lead_comm (lc), trail_comm (tc) { } | |
2982 | 286 |
287 ~tree_complex_for_command (void); | |
288 | |
289 tree_argument_list *left_hand_side (void) { return lhs; } | |
290 | |
291 tree_expression *control_expr (void) { return expr; } | |
292 | |
293 tree_statement_list *body (void) { return list; } | |
294 | |
3665 | 295 octave_comment_list *leading_comment (void) { return lead_comm; } |
296 | |
297 octave_comment_list *trailing_comment (void) { return trail_comm; } | |
298 | |
7767
71f068b22fcc
scope and context fixes for function handles
John W. Eaton <jwe@octave.org>
parents:
7336
diff
changeset
|
299 tree_command *dup (symbol_table::scope_id scope, |
10313 | 300 symbol_table::context_id context) const; |
5861 | 301 |
2982 | 302 void accept (tree_walker& tw); |
303 | |
304 private: | |
305 | |
306 // Expression to modify. | |
307 tree_argument_list *lhs; | |
308 | |
309 // Expression to evaluate. | |
310 tree_expression *expr; | |
311 | |
312 // List of commands to execute. | |
313 tree_statement_list *list; | |
314 | |
3665 | 315 // Comment preceding FOR token. |
316 octave_comment_list *lead_comm; | |
317 | |
318 // Comment preceding ENDFOR token. | |
319 octave_comment_list *trail_comm; | |
320 | |
2988 | 321 // No copying! |
322 | |
323 tree_complex_for_command (const tree_complex_for_command&); | |
324 | |
325 tree_complex_for_command& operator = (const tree_complex_for_command&); | |
2982 | 326 }; |
327 | |
328 #endif |