Mercurial > octave-nkf
view libinterp/parse-tree/pt-loop.h @ 19632:76478d2da117
unconditionally disable the octave_allocator class
* configure.ac: Delete the --enable-octave-allocator option.
* oct-alloc.h: Delete octave_allocator class. Warn if file is
included. Unconditionally define macros to be empty.
* NEWS: Make note of these changes.
* oct-alloc.cc: Delete.
* liboctave/util/module.mk (UTIL_SRC): Remove it from the list.
* make_int.cc, Cell.h, oct-obj.cc, oct-obj.h, audiodevinfo.cc,
ov-base-int.h, ov-base-scalar.h, ov-bool-mat.cc, ov-bool-mat.h,
ov-bool-sparse.cc, ov-bool-sparse.h, ov-bool.cc, ov-bool.h,
ov-builtin.cc, ov-builtin.h, ov-cell.cc, ov-cell.h, ov-ch-mat.h,
ov-class.cc, ov-class.h, ov-classdef.cc, ov-classdef.h, ov-complex.cc,
ov-complex.h, ov-cs-list.cc, ov-cs-list.h, ov-cx-diag.cc,
ov-cx-diag.h, ov-cx-mat.cc, ov-cx-mat.h, ov-cx-sparse.cc,
ov-cx-sparse.h, ov-dld-fcn.cc, ov-dld-fcn.h, ov-fcn-handle.cc,
ov-fcn-handle.h, ov-fcn-inline.cc, ov-fcn-inline.h, ov-fcn.cc,
ov-fcn.h, ov-float.cc, ov-float.h, ov-flt-complex.cc,
ov-flt-complex.h, ov-flt-cx-diag.cc, ov-flt-cx-diag.h,
ov-flt-cx-mat.cc, ov-flt-cx-mat.h, ov-flt-re-diag.cc,
ov-flt-re-diag.h, ov-flt-re-mat.cc, ov-flt-re-mat.h, ov-int16.cc,
ov-int32.cc, ov-int64.cc, ov-int8.cc, ov-intx.h, ov-java.cc,
ov-java.h, ov-mex-fcn.cc, ov-mex-fcn.h, ov-perm.cc, ov-perm.h,
ov-range.cc, ov-range.h, ov-re-diag.cc, ov-re-diag.h, ov-re-mat.cc,
ov-re-mat.h, ov-re-sparse.cc, ov-re-sparse.h, ov-scalar.cc,
ov-scalar.h, ov-str-mat.cc, ov-str-mat.h, ov-struct.cc, ov-struct.h,
ov-uint16.cc, ov-uint32.cc, ov-uint64.cc, ov-uint8.cc, ov-usr-fcn.cc,
ov-usr-fcn.h, ov.cc, ov.h, pt-const.cc, pt-const.h, idx-vector.cc,
idx-vector.h: Delete uses of oct-alloc.h and OCTAVE_ALLOCATOR macros.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Tue, 20 Jan 2015 13:43:29 -0500 |
parents | ebb3ef964372 |
children | 4197fc428c7d |
line wrap: on
line source
/* Copyright (C) 1996-2013 John W. Eaton This file is part of Octave. Octave is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Octave is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Octave; see the file COPYING. If not, see <http://www.gnu.org/licenses/>. */ #if !defined (octave_pt_loop_h) #define octave_pt_loop_h 1 class octave_value; class octave_lvalue; class tree_argument_list; class tree_expression; class tree_statement_list; class tree_walker; #include "comment-list.h" #include "pt-cmd.h" #include "symtab.h" class jit_info; // While. class tree_while_command : public tree_command { public: tree_while_command (int l = -1, int c = -1) : tree_command (l, c), expr (0), list (0), lead_comm (0), trail_comm (0) #ifdef HAVE_LLVM , compiled (0) #endif { } tree_while_command (tree_expression *e, octave_comment_list *lc = 0, octave_comment_list *tc = 0, int l = -1, int c = -1) : tree_command (l, c), expr (e), list (0), lead_comm (lc), trail_comm (tc) #ifdef HAVE_LLVM , compiled (0) #endif { } tree_while_command (tree_expression *e, tree_statement_list *lst, octave_comment_list *lc = 0, octave_comment_list *tc = 0, int l = -1, int c = -1) : tree_command (l, c), expr (e), list (lst), lead_comm (lc), trail_comm (tc) #ifdef HAVE_LLVM , compiled (0) #endif { } ~tree_while_command (void); tree_expression *condition (void) { return expr; } tree_statement_list *body (void) { return list; } octave_comment_list *leading_comment (void) { return lead_comm; } octave_comment_list *trailing_comment (void) { return trail_comm; } tree_command *dup (symbol_table::scope_id scope, symbol_table::context_id context) const; void accept (tree_walker& tw); #ifdef HAVE_LLVM // some functions use by tree_jit jit_info *get_info (void) const { return compiled; } void stash_info (jit_info *jinfo) { compiled = jinfo; } #endif protected: // Expression to test. tree_expression *expr; // List of commands to execute. tree_statement_list *list; // Comment preceding WHILE token. octave_comment_list *lead_comm; // Comment preceding ENDWHILE token. octave_comment_list *trail_comm; private: #ifdef HAVE_LLVM // compiled version of the loop jit_info *compiled; #endif // No copying! tree_while_command (const tree_while_command&); tree_while_command& operator = (const tree_while_command&); }; // Do-Until. class tree_do_until_command : public tree_while_command { public: tree_do_until_command (int l = -1, int c = -1) : tree_while_command (l, c) { } tree_do_until_command (tree_expression *e, octave_comment_list *lc = 0, octave_comment_list *tc = 0, int l = -1, int c = -1) : tree_while_command (e, lc, tc, l, c) { } tree_do_until_command (tree_expression *e, tree_statement_list *lst, octave_comment_list *lc = 0, octave_comment_list *tc = 0, int l = -1, int c = -1) : tree_while_command (e, lst, lc, tc, l, c) { } ~tree_do_until_command (void) { } tree_command *dup (symbol_table::scope_id scope, symbol_table::context_id context) const; void accept (tree_walker& tw); private: // No copying! tree_do_until_command (const tree_do_until_command&); tree_do_until_command& operator = (const tree_do_until_command&); }; // For. class tree_simple_for_command : public tree_command { public: tree_simple_for_command (int l = -1, int c = -1) : tree_command (l, c), parallel (false), lhs (0), expr (0), maxproc (0), list (0), lead_comm (0), trail_comm (0) #ifdef HAVE_LLVM , compiled (0) #endif { } tree_simple_for_command (bool parallel_arg, tree_expression *le, tree_expression *re, tree_expression *maxproc_arg, tree_statement_list *lst, octave_comment_list *lc = 0, octave_comment_list *tc = 0, int l = -1, int c = -1) : tree_command (l, c), parallel (parallel_arg), lhs (le), expr (re), maxproc (maxproc_arg), list (lst), lead_comm (lc), trail_comm (tc) #ifdef HAVE_LLVM , compiled (0) #endif { } ~tree_simple_for_command (void); bool in_parallel (void) { return parallel; } tree_expression *left_hand_side (void) { return lhs; } tree_expression *control_expr (void) { return expr; } tree_expression *maxproc_expr (void) { return maxproc; } tree_statement_list *body (void) { return list; } octave_comment_list *leading_comment (void) { return lead_comm; } octave_comment_list *trailing_comment (void) { return trail_comm; } tree_command *dup (symbol_table::scope_id scope, symbol_table::context_id context) const; void accept (tree_walker& tw); #ifdef HAVE_LLVM // some functions use by tree_jit jit_info *get_info (void) const { return compiled; } void stash_info (jit_info *jinfo) { compiled = jinfo; } #endif private: // TRUE means operate in parallel (subject to the value of the // maxproc expression). bool parallel; // Expression to modify. tree_expression *lhs; // Expression to evaluate. tree_expression *expr; // Expression to tell how many processors should be used (only valid // if parallel is TRUE). tree_expression *maxproc; // List of commands to execute. tree_statement_list *list; // Comment preceding FOR token. octave_comment_list *lead_comm; // Comment preceding ENDFOR token. octave_comment_list *trail_comm; // compiled version of the loop jit_info *compiled; // No copying! tree_simple_for_command (const tree_simple_for_command&); tree_simple_for_command& operator = (const tree_simple_for_command&); }; class tree_complex_for_command : public tree_command { public: tree_complex_for_command (int l = -1, int c = -1) : tree_command (l, c), lhs (0), expr (0), list (0), lead_comm (0), trail_comm (0) { } tree_complex_for_command (tree_argument_list *le, tree_expression *re, tree_statement_list *lst, octave_comment_list *lc = 0, octave_comment_list *tc = 0, int l = -1, int c = -1) : tree_command (l, c), lhs (le), expr (re), list (lst), lead_comm (lc), trail_comm (tc) { } ~tree_complex_for_command (void); tree_argument_list *left_hand_side (void) { return lhs; } tree_expression *control_expr (void) { return expr; } tree_statement_list *body (void) { return list; } octave_comment_list *leading_comment (void) { return lead_comm; } octave_comment_list *trailing_comment (void) { return trail_comm; } tree_command *dup (symbol_table::scope_id scope, symbol_table::context_id context) const; void accept (tree_walker& tw); private: // Expression to modify. tree_argument_list *lhs; // Expression to evaluate. tree_expression *expr; // List of commands to execute. tree_statement_list *list; // Comment preceding FOR token. octave_comment_list *lead_comm; // Comment preceding ENDFOR token. octave_comment_list *trail_comm; // No copying! tree_complex_for_command (const tree_complex_for_command&); tree_complex_for_command& operator = (const tree_complex_for_command&); }; #endif