view libinterp/parse-tree/pt-loop.h @ 24239:51e408a7d38f

jit: Move everything inside the octave namespace * libinterp/octave-value/ov-builtin.cc: Move everything inside the octave namespace * libinterp/octave-value/ov-builtin.h: Idem. * libinterp/octave-value/ov-usr-fcn.h: Idem. * libinterp/parse-tree/jit-ir.cc: Idem. * libinterp/parse-tree/jit-ir.h: Idem. * libinterp/parse-tree/jit-typeinfo.cc: Idem. * libinterp/parse-tree/jit-typeinfo.h: Idem. * libinterp/parse-tree/jit-util.cc: Idem. * libinterp/parse-tree/jit-util.h: Idem. * libinterp/parse-tree/pt-jit.cc: Idem. * libinterp/parse-tree/pt-jit.h: Idem. * libinterp/parse-tree/pt-loop.h: Idem. * libinterp/template-inst/Array-jit.cc: Idem.
author Julien Bect <jbect@users.sourceforge.net>
date Sun, 15 Oct 2017 21:08:02 +0200
parents 176e5f761039
children 790b4389cfb4
line wrap: on
line source

/*

Copyright (C) 1996-2017 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

#include "octave-config.h"

class octave_value;

#include "pt-cmd.h"
#include "pt-walk.h"
#include "symtab.h"
#include "pt-jit.h"

class jit_info;

namespace octave
{
  class tree_argument_list;
  class tree_expression;
  class tree_statement_list;

  // While.

  class tree_while_command : public tree_command
  {
  public:

    tree_while_command (int l = -1, int c = -1)
      : tree_command (l, c), expr (nullptr), list (nullptr),
        lead_comm (nullptr), trail_comm (nullptr)
#if defined (HAVE_LLVM)
      , compiled (nullptr)
#endif
    { }

    tree_while_command (tree_expression *e,
                        comment_list *lc = nullptr,
                        comment_list *tc = nullptr,
                        int l = -1, int c = -1)
      : tree_command (l, c), expr (e), list (nullptr),
        lead_comm (lc), trail_comm (tc)
#if defined (HAVE_LLVM)
      , compiled (nullptr)
#endif
    { }

    tree_while_command (tree_expression *e, tree_statement_list *lst,
                        comment_list *lc = nullptr,
                        comment_list *tc = nullptr,
                        int l = -1, int c = -1)
      : tree_command (l, c), expr (e), list (lst), lead_comm (lc),
        trail_comm (tc)
#if defined (HAVE_LLVM)
      , compiled (nullptr)
#endif
    { }

    // No copying!

    tree_while_command (const tree_while_command&) = delete;

    tree_while_command& operator = (const tree_while_command&) = delete;

    ~tree_while_command (void);

    tree_expression * condition (void) { return expr; }

    tree_statement_list * body (void) { return list; }

    comment_list * leading_comment (void) { return lead_comm; }

    comment_list * trailing_comment (void) { return trail_comm; }

    void accept (tree_walker& tw)
    {
      tw.visit_while_command (*this);
    }

#if defined (HAVE_LLVM)
    // some functions use by tree_jit
    octave::jit_info * get_info (void) const
    {
      return compiled;
    }

    void stash_info (octave::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.
    comment_list *lead_comm;

    // Comment preceding ENDWHILE token.
    comment_list *trail_comm;

  private:

#if defined (HAVE_LLVM)
    // compiled version of the loop
    jit_info *compiled;
#endif
  };

  // 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,
                           comment_list *lc = nullptr,
                           comment_list *tc = nullptr,
                           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,
                           comment_list *lc = nullptr,
                           comment_list *tc = nullptr,
                           int l = -1, int c = -1)
      : tree_while_command (e, lst, lc, tc, l, c) { }

    // No copying!

    tree_do_until_command (const tree_do_until_command&) = delete;

    tree_do_until_command& operator = (const tree_do_until_command&) = delete;

    ~tree_do_until_command (void) = default;

    void accept (tree_walker& tw)
    {
      tw.visit_do_until_command (*this);
    }
  };

  // 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 (nullptr), expr (nullptr),
        maxproc (nullptr), list (nullptr), lead_comm (nullptr),
        trail_comm (nullptr)
#if defined (HAVE_LLVM)
      , compiled (nullptr)
#endif
    { }

    tree_simple_for_command (bool parallel_arg, tree_expression *le,
                             tree_expression *re,
                             tree_expression *maxproc_arg,
                             tree_statement_list *lst,
                             comment_list *lc = nullptr,
                             comment_list *tc = nullptr,
                             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)
#if defined (HAVE_LLVM)
      , compiled (0)
#endif
    { }

    // No copying!

    tree_simple_for_command (const tree_simple_for_command&) = delete;

    tree_simple_for_command& operator = (const tree_simple_for_command&) = delete;

    ~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; }

    comment_list * leading_comment (void) { return lead_comm; }

    comment_list * trailing_comment (void) { return trail_comm; }

    void accept (tree_walker& tw)
    {
      tw.visit_simple_for_command (*this);
    }

#if defined (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.
    comment_list *lead_comm;

    // Comment preceding ENDFOR token.
    comment_list *trail_comm;

#if defined (HAVE_LLVM)
    // compiled version of the loop
    jit_info *compiled;
#endif
  };

  class tree_complex_for_command : public tree_command
  {
  public:

    tree_complex_for_command (int l = -1, int c = -1)
      : tree_command (l, c), lhs (nullptr), expr (nullptr), list (nullptr),
        lead_comm (nullptr), trail_comm (nullptr) { }

    tree_complex_for_command (tree_argument_list *le, tree_expression *re,
                              tree_statement_list *lst,
                              comment_list *lc = nullptr,
                              comment_list *tc = nullptr,
                              int l = -1, int c = -1)
      : tree_command (l, c), lhs (le), expr (re), list (lst),
        lead_comm (lc), trail_comm (tc) { }

    // No copying!

    tree_complex_for_command (const tree_complex_for_command&) = delete;

    tree_complex_for_command& operator = (const tree_complex_for_command&) = delete;

    ~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; }

    comment_list * leading_comment (void) { return lead_comm; }

    comment_list * trailing_comment (void) { return trail_comm; }

    void accept (tree_walker& tw)
    {
      tw.visit_complex_for_command (*this);
    }

  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.
    comment_list *lead_comm;

    // Comment preceding ENDFOR token.
    comment_list *trail_comm;
  };
}

#if defined (OCTAVE_USE_DEPRECATED_FUNCTIONS)

OCTAVE_DEPRECATED (4.4, "use 'octave::tree_while_command' instead")
typedef octave::tree_while_command tree_while_command;

OCTAVE_DEPRECATED (4.4, "use 'octave::tree_do_until_command' instead")
typedef octave::tree_do_until_command tree_do_until_command;

OCTAVE_DEPRECATED (4.4, "use 'octave::tree_simple_for_command' instead")
typedef octave::tree_simple_for_command tree_simple_for_command;

OCTAVE_DEPRECATED (4.4, "use 'octave::tree_complex_for_command' instead")
typedef octave::tree_complex_for_command tree_complex_for_command;

#endif

#endif