|
494
|
1 /* |
|
|
2 |
|
1827
|
3 Copyright (C) 1996 John W. Eaton |
|
494
|
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 |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
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 |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
494
|
20 |
|
|
21 */ |
|
|
22 |
|
1297
|
23 #if defined (__GNUG__) |
|
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
494
|
27 #ifdef HAVE_CONFIG_H |
|
1192
|
28 #include <config.h> |
|
494
|
29 #endif |
|
|
30 |
|
|
31 #include <iostream.h> |
|
|
32 |
|
1059
|
33 // Nonzero means we're breaking out of a loop or function body. |
|
578
|
34 int breaking = 0; |
|
|
35 |
|
|
36 // Nonzero means we're jumping to the end of a loop. |
|
|
37 int continuing = 0; |
|
|
38 |
|
|
39 // Nonzero means we're returning from a function. Global because it |
|
|
40 // is also needed in tree-expr.cc. |
|
|
41 int returning = 0; |
|
|
42 |
|
494
|
43 #include "error.h" |
|
|
44 #include "gripes.h" |
|
1352
|
45 #include "oct-map.h" |
|
|
46 #include "symtab.h" |
|
1742
|
47 #include "pt-cmd.h" |
|
2373
|
48 #include "ov.h" |
|
1742
|
49 #include "pt-exp.h" |
|
|
50 #include "pt-fvc.h" |
|
|
51 #include "pt-misc.h" |
|
|
52 #include "pt-mvr.h" |
|
2124
|
53 #include "pt-walk.h" |
|
916
|
54 #include "unwind-prot.h" |
|
1352
|
55 #include "variables.h" |
|
494
|
56 |
|
|
57 // Decide if it's time to quit a for or while loop. |
|
1827
|
58 static inline bool |
|
494
|
59 quit_loop_now (void) |
|
|
60 { |
|
1228
|
61 // Maybe handle `continue N' someday... |
|
494
|
62 |
|
|
63 if (continuing) |
|
|
64 continuing--; |
|
|
65 |
|
1827
|
66 bool quit = (returning || breaking || continuing); |
|
494
|
67 |
|
|
68 if (breaking) |
|
|
69 breaking--; |
|
|
70 |
|
|
71 return quit; |
|
|
72 } |
|
|
73 |
|
578
|
74 // Global. |
|
494
|
75 |
|
578
|
76 tree_global_command::~tree_global_command (void) |
|
494
|
77 { |
|
578
|
78 delete init_list; |
|
494
|
79 } |
|
|
80 |
|
|
81 void |
|
578
|
82 tree_global_command::eval (void) |
|
494
|
83 { |
|
578
|
84 if (init_list) |
|
|
85 init_list->eval (); |
|
494
|
86 |
|
|
87 if (error_state > 0) |
|
|
88 ::error ("evaluating global command near line %d, column %d", |
|
|
89 line (), column ()); |
|
|
90 } |
|
|
91 |
|
581
|
92 void |
|
2124
|
93 tree_global_command::accept (tree_walker& tw) |
|
581
|
94 { |
|
2124
|
95 tw.visit_global_command (*this); |
|
581
|
96 } |
|
|
97 |
|
578
|
98 // While. |
|
494
|
99 |
|
|
100 tree_while_command::~tree_while_command (void) |
|
|
101 { |
|
|
102 delete expr; |
|
|
103 delete list; |
|
|
104 } |
|
|
105 |
|
578
|
106 void |
|
|
107 tree_while_command::eval (void) |
|
494
|
108 { |
|
|
109 if (error_state) |
|
578
|
110 return; |
|
494
|
111 |
|
1491
|
112 if (! expr) |
|
|
113 panic_impossible (); |
|
|
114 |
|
494
|
115 for (;;) |
|
|
116 { |
|
1491
|
117 if (expr->is_logically_true ("while")) |
|
494
|
118 { |
|
529
|
119 if (list) |
|
494
|
120 { |
|
578
|
121 list->eval (1); |
|
494
|
122 if (error_state) |
|
|
123 { |
|
|
124 eval_error (); |
|
578
|
125 return; |
|
494
|
126 } |
|
|
127 } |
|
|
128 |
|
|
129 if (quit_loop_now ()) |
|
|
130 break; |
|
|
131 } |
|
|
132 else |
|
|
133 break; |
|
|
134 } |
|
|
135 } |
|
|
136 |
|
|
137 void |
|
|
138 tree_while_command::eval_error (void) |
|
|
139 { |
|
|
140 if (error_state > 0) |
|
|
141 ::error ("evaluating while command near line %d, column %d", |
|
|
142 line (), column ()); |
|
|
143 } |
|
|
144 |
|
581
|
145 void |
|
2124
|
146 tree_while_command::accept (tree_walker& tw) |
|
581
|
147 { |
|
2124
|
148 tw.visit_while_command (*this); |
|
581
|
149 } |
|
|
150 |
|
578
|
151 // For. |
|
494
|
152 |
|
|
153 tree_for_command::~tree_for_command (void) |
|
|
154 { |
|
|
155 delete id; |
|
1228
|
156 delete id_list; |
|
494
|
157 delete expr; |
|
|
158 delete list; |
|
|
159 } |
|
|
160 |
|
1168
|
161 inline void |
|
1228
|
162 tree_for_command::do_for_loop_once (tree_return_list *lst, |
|
2086
|
163 const octave_value_list& rhs, bool& quit) |
|
1228
|
164 { |
|
1827
|
165 quit = false; |
|
1228
|
166 |
|
|
167 tree_oct_obj *tmp = new tree_oct_obj (rhs); |
|
|
168 tree_multi_assignment_expression tmp_ass (lst, tmp, 1); |
|
1827
|
169 tmp_ass.eval (false); |
|
1228
|
170 |
|
|
171 if (error_state) |
|
|
172 { |
|
|
173 eval_error (); |
|
|
174 return; |
|
|
175 } |
|
|
176 |
|
|
177 if (list) |
|
|
178 { |
|
|
179 list->eval (1); |
|
|
180 if (error_state) |
|
|
181 { |
|
|
182 eval_error (); |
|
1827
|
183 quit = true; |
|
1228
|
184 return; |
|
|
185 } |
|
|
186 } |
|
|
187 |
|
|
188 quit = quit_loop_now (); |
|
|
189 } |
|
|
190 |
|
|
191 inline void |
|
|
192 tree_for_command::do_for_loop_once (tree_index_expression *idx_expr, |
|
2086
|
193 const octave_value& rhs, bool& quit) |
|
1168
|
194 { |
|
1827
|
195 quit = false; |
|
1168
|
196 |
|
2086
|
197 octave_value *tmp = new octave_value (rhs); |
|
1827
|
198 tree_simple_assignment_expression tmp_ass (idx_expr, tmp, true); |
|
|
199 tmp_ass.eval (false); |
|
1168
|
200 |
|
|
201 if (error_state) |
|
|
202 { |
|
|
203 eval_error (); |
|
|
204 return; |
|
|
205 } |
|
|
206 |
|
|
207 if (list) |
|
|
208 { |
|
|
209 list->eval (1); |
|
|
210 if (error_state) |
|
|
211 { |
|
|
212 eval_error (); |
|
1827
|
213 quit = true; |
|
1168
|
214 return; |
|
|
215 } |
|
|
216 } |
|
|
217 |
|
|
218 quit = quit_loop_now (); |
|
|
219 } |
|
|
220 |
|
|
221 inline void |
|
|
222 tree_for_command::do_for_loop_once (tree_identifier *ident, |
|
2086
|
223 octave_value& rhs, bool& quit) |
|
1168
|
224 { |
|
1827
|
225 quit = false; |
|
1168
|
226 |
|
2373
|
227 octave_variable_reference tmp (ident); |
|
1168
|
228 |
|
|
229 if (error_state) |
|
|
230 { |
|
|
231 eval_error (); |
|
|
232 return; |
|
|
233 } |
|
|
234 |
|
2373
|
235 tmp.assign (rhs); |
|
|
236 |
|
1168
|
237 if (list) |
|
|
238 { |
|
|
239 list->eval (1); |
|
|
240 if (error_state) |
|
|
241 { |
|
|
242 eval_error (); |
|
1827
|
243 quit = true; |
|
1168
|
244 return; |
|
|
245 } |
|
|
246 } |
|
|
247 |
|
|
248 quit = quit_loop_now (); |
|
|
249 } |
|
|
250 |
|
|
251 #define DO_LOOP(val) \ |
|
|
252 do \ |
|
|
253 { \ |
|
|
254 if (ident) \ |
|
|
255 for (int i = 0; i < steps; i++) \ |
|
|
256 { \ |
|
2086
|
257 octave_value rhs (val); \ |
|
1827
|
258 bool quit = false; \ |
|
1168
|
259 do_for_loop_once (ident, rhs, quit); \ |
|
|
260 if (quit) \ |
|
|
261 break; \ |
|
|
262 } \ |
|
1228
|
263 else if (id_list) \ |
|
|
264 for (int i = 0; i < steps; i++) \ |
|
|
265 { \ |
|
2086
|
266 octave_value_list rhs (val); \ |
|
1827
|
267 bool quit = false; \ |
|
1228
|
268 do_for_loop_once (id_list, rhs, quit); \ |
|
|
269 if (quit) \ |
|
|
270 break; \ |
|
|
271 } \ |
|
1168
|
272 else \ |
|
|
273 for (int i = 0; i < steps; i++) \ |
|
|
274 { \ |
|
2086
|
275 octave_value rhs (val); \ |
|
1827
|
276 bool quit = false; \ |
|
1228
|
277 do_for_loop_once (tmp_id, rhs, quit); \ |
|
1168
|
278 if (quit) \ |
|
|
279 break; \ |
|
|
280 } \ |
|
|
281 } \ |
|
|
282 while (0) |
|
|
283 |
|
578
|
284 void |
|
|
285 tree_for_command::eval (void) |
|
494
|
286 { |
|
529
|
287 if (error_state || ! expr) |
|
578
|
288 return; |
|
494
|
289 |
|
2086
|
290 octave_value tmp_expr = expr->eval (false); |
|
494
|
291 |
|
|
292 if (error_state || tmp_expr.is_undefined ()) |
|
|
293 { |
|
|
294 eval_error (); |
|
578
|
295 return; |
|
494
|
296 } |
|
|
297 |
|
1228
|
298 tree_index_expression *tmp_id = id; |
|
|
299 if (id_list && id_list->length () == 1) |
|
|
300 tmp_id = id_list->front (); |
|
|
301 |
|
1168
|
302 tree_identifier *ident = 0; |
|
1228
|
303 if (tmp_id && ! tmp_id->arg_list ()) |
|
1168
|
304 { |
|
1228
|
305 tree_indirect_ref *idr = tmp_id->ident (); |
|
1168
|
306 if (idr->is_identifier_only ()) |
|
|
307 ident = idr->ident (); |
|
|
308 } |
|
|
309 |
|
1234
|
310 if (id_list && ! ident && ! tmp_expr.is_map ()) |
|
1228
|
311 { |
|
|
312 error ("in statement `for [X, Y] = VAL', VAL must be a structure"); |
|
|
313 return; |
|
|
314 } |
|
|
315 |
|
620
|
316 if (tmp_expr.is_scalar_type ()) |
|
|
317 { |
|
1827
|
318 bool quit = false; |
|
1168
|
319 if (ident) |
|
|
320 do_for_loop_once (ident, tmp_expr, quit); |
|
1228
|
321 else if (id_list) |
|
|
322 { |
|
2086
|
323 octave_value_list rhs (tmp_expr); |
|
1228
|
324 do_for_loop_once (id_list, rhs, quit); |
|
|
325 } |
|
1168
|
326 else |
|
1228
|
327 do_for_loop_once (tmp_id, tmp_expr, quit); |
|
620
|
328 } |
|
|
329 else if (tmp_expr.is_matrix_type ()) |
|
494
|
330 { |
|
620
|
331 Matrix m_tmp; |
|
|
332 ComplexMatrix cm_tmp; |
|
|
333 int nr; |
|
|
334 int steps; |
|
|
335 if (tmp_expr.is_real_matrix ()) |
|
|
336 { |
|
|
337 m_tmp = tmp_expr.matrix_value (); |
|
|
338 nr = m_tmp.rows (); |
|
|
339 steps = m_tmp.columns (); |
|
|
340 } |
|
|
341 else |
|
|
342 { |
|
|
343 cm_tmp = tmp_expr.complex_matrix_value (); |
|
|
344 nr = cm_tmp.rows (); |
|
|
345 steps = cm_tmp.columns (); |
|
|
346 } |
|
494
|
347 |
|
1168
|
348 if (tmp_expr.is_real_matrix ()) |
|
620
|
349 { |
|
|
350 if (nr == 1) |
|
1168
|
351 DO_LOOP(m_tmp (0, i)); |
|
620
|
352 else |
|
1168
|
353 DO_LOOP(m_tmp.extract (0, i, nr-1, i)); |
|
|
354 } |
|
|
355 else |
|
|
356 { |
|
|
357 if (nr == 1) |
|
|
358 DO_LOOP(cm_tmp (0, i)); |
|
|
359 else |
|
|
360 DO_LOOP(cm_tmp.extract (0, i, nr-1, i)); |
|
620
|
361 } |
|
|
362 } |
|
|
363 else if (tmp_expr.is_string ()) |
|
|
364 { |
|
494
|
365 gripe_string_invalid (); |
|
620
|
366 } |
|
|
367 else if (tmp_expr.is_range ()) |
|
|
368 { |
|
|
369 Range rng = tmp_expr.range_value (); |
|
494
|
370 |
|
620
|
371 int steps = rng.nelem (); |
|
|
372 double b = rng.base (); |
|
|
373 double increment = rng.inc (); |
|
494
|
374 |
|
1168
|
375 if (ident) |
|
620
|
376 { |
|
1168
|
377 for (int i = 0; i < steps; i++) |
|
|
378 { |
|
|
379 double tmp_val = b + i * increment; |
|
|
380 |
|
2086
|
381 octave_value rhs (tmp_val); |
|
1168
|
382 |
|
1827
|
383 bool quit = false; |
|
1168
|
384 do_for_loop_once (ident, rhs, quit); |
|
494
|
385 |
|
1168
|
386 if (quit) |
|
|
387 break; |
|
|
388 } |
|
|
389 } |
|
1228
|
390 else if (id_list) |
|
|
391 { |
|
|
392 for (int i = 0; i < steps; i++) |
|
|
393 { |
|
|
394 double tmp_val = b + i * increment; |
|
|
395 |
|
2086
|
396 octave_value_list rhs (tmp_val); |
|
1228
|
397 |
|
1827
|
398 bool quit = false; |
|
1228
|
399 do_for_loop_once (id_list, rhs, quit); |
|
|
400 |
|
|
401 if (quit) |
|
|
402 break; |
|
|
403 } |
|
|
404 } |
|
1168
|
405 else |
|
|
406 { |
|
|
407 for (int i = 0; i < steps; i++) |
|
|
408 { |
|
|
409 double tmp_val = b + i * increment; |
|
494
|
410 |
|
2086
|
411 octave_value rhs (tmp_val); |
|
1168
|
412 |
|
1827
|
413 bool quit = false; |
|
1228
|
414 do_for_loop_once (tmp_id, rhs, quit); |
|
|
415 |
|
|
416 if (quit) |
|
|
417 break; |
|
|
418 } |
|
|
419 } |
|
|
420 } |
|
|
421 else if (tmp_expr.is_map ()) |
|
|
422 { |
|
|
423 if (ident) |
|
|
424 { |
|
|
425 Octave_map tmp_val (tmp_expr.map_value ()); |
|
|
426 |
|
|
427 for (Pix p = tmp_val.first (); p != 0; tmp_val.next (p)) |
|
|
428 { |
|
2086
|
429 octave_value rhs (tmp_val.contents (p)); |
|
1228
|
430 |
|
1827
|
431 bool quit = false; |
|
1228
|
432 do_for_loop_once (ident, rhs, quit); |
|
|
433 |
|
|
434 if (quit) |
|
|
435 break; |
|
|
436 } |
|
|
437 } |
|
|
438 else if (id_list) |
|
|
439 { |
|
|
440 // Cycle through structure elements. First element of |
|
|
441 // id_list is set to value and the second is set to the name |
|
|
442 // of the structure element. |
|
|
443 |
|
|
444 Octave_map tmp_val (tmp_expr.map_value ()); |
|
|
445 |
|
|
446 for (Pix p = tmp_val.first (); p != 0; tmp_val.next (p)) |
|
|
447 { |
|
2086
|
448 octave_value_list tmp; |
|
1228
|
449 tmp (1) = tmp_val.key (p); |
|
|
450 tmp (0) = tmp_val.contents (p); |
|
|
451 |
|
1827
|
452 bool quit = false; |
|
1228
|
453 do_for_loop_once (id_list, tmp, quit); |
|
|
454 |
|
|
455 if (quit) |
|
|
456 break; |
|
|
457 } |
|
|
458 } |
|
|
459 else |
|
|
460 { |
|
|
461 Octave_map tmp_val (tmp_expr.map_value ()); |
|
|
462 |
|
|
463 for (Pix p = tmp_val.first (); p != 0; tmp_val.next (p)) |
|
|
464 { |
|
2086
|
465 octave_value rhs = tmp_val.contents (p); |
|
1228
|
466 |
|
1827
|
467 bool quit = false; |
|
1228
|
468 do_for_loop_once (tmp_id, rhs, quit); |
|
1168
|
469 |
|
|
470 if (quit) |
|
|
471 break; |
|
|
472 } |
|
620
|
473 } |
|
|
474 } |
|
|
475 else |
|
|
476 { |
|
|
477 ::error ("invalid type in for loop expression near line %d, column %d", |
|
|
478 line (), column ()); |
|
494
|
479 } |
|
|
480 } |
|
|
481 |
|
|
482 void |
|
|
483 tree_for_command::eval_error (void) |
|
|
484 { |
|
|
485 if (error_state > 0) |
|
|
486 ::error ("evaluating for command near line %d, column %d", |
|
|
487 line (), column ()); |
|
|
488 } |
|
|
489 |
|
578
|
490 void |
|
2124
|
491 tree_for_command::accept (tree_walker& tw) |
|
581
|
492 { |
|
2124
|
493 tw.visit_for_command (*this); |
|
581
|
494 } |
|
|
495 |
|
578
|
496 // If. |
|
494
|
497 |
|
|
498 tree_if_command::~tree_if_command (void) |
|
|
499 { |
|
|
500 delete list; |
|
|
501 } |
|
|
502 |
|
|
503 void |
|
578
|
504 tree_if_command::eval (void) |
|
494
|
505 { |
|
578
|
506 if (list) |
|
|
507 list->eval (); |
|
|
508 |
|
494
|
509 if (error_state > 0) |
|
|
510 ::error ("evaluating if command near line %d, column %d", |
|
|
511 line (), column ()); |
|
|
512 } |
|
|
513 |
|
581
|
514 void |
|
2124
|
515 tree_if_command::accept (tree_walker& tw) |
|
581
|
516 { |
|
2124
|
517 tw.visit_if_command (*this); |
|
581
|
518 } |
|
|
519 |
|
916
|
520 // Simple exception handling. |
|
|
521 |
|
1489
|
522 tree_try_catch_command::~tree_try_catch_command (void) |
|
|
523 { |
|
|
524 delete try_code; |
|
|
525 delete catch_code; |
|
|
526 } |
|
|
527 |
|
|
528 static void |
|
|
529 do_catch_code (void *ptr) |
|
|
530 { |
|
|
531 tree_statement_list *list = (tree_statement_list *) ptr; |
|
|
532 |
|
|
533 // Set up for letting the user print any messages from errors that |
|
|
534 // occurred in the body of the try_catch statement. |
|
|
535 |
|
|
536 buffer_error_messages = 0; |
|
|
537 bind_global_error_variable (); |
|
|
538 add_unwind_protect (clear_global_error_variable, 0); |
|
|
539 |
|
|
540 // Similarly, if we have seen a return or break statement, allow all |
|
|
541 // the catch code to run before returning or handling the break. |
|
|
542 // We don't have to worry about continue statements because they can |
|
|
543 // only occur in loops. |
|
|
544 |
|
|
545 unwind_protect_int (returning); |
|
|
546 returning = 0; |
|
|
547 |
|
|
548 unwind_protect_int (breaking); |
|
|
549 breaking = 0; |
|
|
550 |
|
|
551 if (list) |
|
1827
|
552 list->eval (true); |
|
1489
|
553 |
|
|
554 // This is the one for breaking. (The unwind_protects are popped |
|
|
555 // off the stack in the reverse of the order they are pushed on). |
|
|
556 |
|
|
557 // XXX FIXME XXX -- inside a try-catch, should break work like |
|
|
558 // a return, or just jump to the end of the try_catch block? |
|
|
559 // The following code makes it just jump to the end of the block. |
|
|
560 |
|
|
561 run_unwind_protect (); |
|
|
562 if (breaking) |
|
|
563 breaking--; |
|
|
564 |
|
|
565 // This is the one for returning. |
|
|
566 |
|
|
567 if (returning) |
|
|
568 discard_unwind_protect (); |
|
|
569 else |
|
|
570 run_unwind_protect (); |
|
|
571 |
|
|
572 run_unwind_protect (); |
|
|
573 } |
|
|
574 |
|
|
575 void |
|
|
576 tree_try_catch_command::eval (void) |
|
|
577 { |
|
|
578 begin_unwind_frame ("tree_try_catch::eval"); |
|
|
579 |
|
|
580 add_unwind_protect (do_catch_code, catch_code); |
|
|
581 |
|
|
582 if (catch_code) |
|
|
583 { |
|
|
584 unwind_protect_int (buffer_error_messages); |
|
|
585 buffer_error_messages = 1; |
|
|
586 } |
|
|
587 |
|
|
588 if (try_code) |
|
1827
|
589 try_code->eval (true); |
|
1489
|
590 |
|
|
591 if (catch_code && error_state) |
|
|
592 { |
|
|
593 error_state = 0; |
|
|
594 run_unwind_frame ("tree_try_catch::eval"); |
|
|
595 } |
|
|
596 else |
|
|
597 { |
|
|
598 error_state = 0; |
|
|
599 discard_unwind_frame ("tree_try_catch::eval"); |
|
|
600 } |
|
|
601 } |
|
|
602 |
|
|
603 void |
|
2124
|
604 tree_try_catch_command::accept (tree_walker& tw) |
|
1489
|
605 { |
|
2124
|
606 tw.visit_try_catch_command (*this); |
|
1489
|
607 } |
|
|
608 |
|
|
609 // Simple exception handling. |
|
|
610 |
|
916
|
611 tree_unwind_protect_command::~tree_unwind_protect_command (void) |
|
|
612 { |
|
|
613 delete unwind_protect_code; |
|
|
614 delete cleanup_code; |
|
|
615 } |
|
|
616 |
|
|
617 static void |
|
|
618 do_unwind_protect_cleanup_code (void *ptr) |
|
|
619 { |
|
|
620 tree_statement_list *list = (tree_statement_list *) ptr; |
|
|
621 |
|
1228
|
622 // We want to run the cleanup code without error_state being set, |
|
|
623 // but we need to restore its value, so that any errors encountered |
|
|
624 // in the first part of the unwind_protect are not completely |
|
|
625 // ignored. |
|
916
|
626 |
|
|
627 unwind_protect_int (error_state); |
|
1266
|
628 error_state = 0; |
|
916
|
629 |
|
1266
|
630 // Similarly, if we have seen a return or break statement, allow all |
|
|
631 // the cleanup code to run before returning or handling the break. |
|
|
632 // We don't have to worry about continue statements because they can |
|
|
633 // only occur in loops. |
|
|
634 |
|
|
635 unwind_protect_int (returning); |
|
|
636 returning = 0; |
|
|
637 |
|
|
638 unwind_protect_int (breaking); |
|
|
639 breaking = 0; |
|
916
|
640 |
|
|
641 if (list) |
|
1827
|
642 list->eval (true); |
|
916
|
643 |
|
1266
|
644 // This is the one for breaking. (The unwind_protects are popped |
|
|
645 // off the stack in the reverse of the order they are pushed on). |
|
|
646 |
|
|
647 // XXX FIXME XXX -- inside an unwind_protect, should break work like |
|
|
648 // a return, or just jump to the end of the unwind_protect block? |
|
|
649 // The following code makes it just jump to the end of the block. |
|
|
650 |
|
|
651 run_unwind_protect (); |
|
|
652 if (breaking) |
|
|
653 breaking--; |
|
|
654 |
|
|
655 // This is the one for returning. |
|
|
656 |
|
|
657 if (returning) |
|
|
658 discard_unwind_protect (); |
|
|
659 else |
|
|
660 run_unwind_protect (); |
|
|
661 |
|
1228
|
662 // We don't want to ignore errors that occur in the cleanup code, so |
|
|
663 // if an error is encountered there, leave error_state alone. |
|
|
664 // Otherwise, set it back to what it was before. |
|
916
|
665 |
|
|
666 if (error_state) |
|
|
667 discard_unwind_protect (); |
|
|
668 else |
|
|
669 run_unwind_protect (); |
|
|
670 } |
|
|
671 |
|
|
672 void |
|
|
673 tree_unwind_protect_command::eval (void) |
|
|
674 { |
|
|
675 add_unwind_protect (do_unwind_protect_cleanup_code, cleanup_code); |
|
|
676 |
|
|
677 if (unwind_protect_code) |
|
1827
|
678 unwind_protect_code->eval (true); |
|
916
|
679 |
|
1489
|
680 run_unwind_protect (); |
|
916
|
681 } |
|
|
682 |
|
|
683 void |
|
2124
|
684 tree_unwind_protect_command::accept (tree_walker& tw) |
|
916
|
685 { |
|
2124
|
686 tw.visit_unwind_protect_command (*this); |
|
916
|
687 } |
|
|
688 |
|
578
|
689 // Break. |
|
494
|
690 |
|
578
|
691 void |
|
|
692 tree_break_command::eval (void) |
|
494
|
693 { |
|
|
694 if (! error_state) |
|
|
695 breaking = 1; |
|
|
696 } |
|
|
697 |
|
581
|
698 void |
|
2124
|
699 tree_break_command::accept (tree_walker& tw) |
|
581
|
700 { |
|
2124
|
701 tw.visit_break_command (*this); |
|
581
|
702 } |
|
|
703 |
|
578
|
704 // Continue. |
|
494
|
705 |
|
578
|
706 void |
|
|
707 tree_continue_command::eval (void) |
|
494
|
708 { |
|
|
709 if (! error_state) |
|
|
710 continuing = 1; |
|
|
711 } |
|
|
712 |
|
581
|
713 void |
|
2124
|
714 tree_continue_command::accept (tree_walker& tw) |
|
581
|
715 { |
|
2124
|
716 tw.visit_continue_command (*this); |
|
581
|
717 } |
|
|
718 |
|
578
|
719 // Return. |
|
494
|
720 |
|
578
|
721 void |
|
|
722 tree_return_command::eval (void) |
|
494
|
723 { |
|
|
724 if (! error_state) |
|
|
725 returning = 1; |
|
|
726 } |
|
|
727 |
|
581
|
728 void |
|
2124
|
729 tree_return_command::accept (tree_walker& tw) |
|
581
|
730 { |
|
2124
|
731 tw.visit_return_command (*this); |
|
581
|
732 } |
|
|
733 |
|
494
|
734 /* |
|
|
735 ;;; Local Variables: *** |
|
|
736 ;;; mode: C++ *** |
|
|
737 ;;; End: *** |
|
|
738 */ |
