Mercurial > octave-nkf
view libinterp/parse-tree/pt-cbinop.cc @ 20587:f90c8372b7ba
eliminate many more simple uses of error_state
* Cell.cc, __ichol__.cc, __ilu__.cc, balance.cc, bsxfun.cc, colloc.cc,
det.cc, dlmread.cc, dynamic-ld.cc, eig.cc, fft.cc, fft2.cc, fftn.cc,
gcd.cc, getgrent.cc, getpwent.cc, givens.cc, hess.cc, input.cc,
levenshtein.cc, load-path.cc, lookup.cc, ls-mat-ascii.cc, ls-mat4.cc,
lsode.cc, lu.cc, max.cc, md5sum.cc, mex.cc, pager.cc, pinv.cc,
pr-output.cc, qz.cc, schur.cc, sparse.cc, sqrtm.cc, str2double.cc,
strfns.cc, sub2ind.cc, sysdep.cc, time.cc, toplev.cc, tril.cc,
tsearch.cc, typecast.cc, __init_gnuplot__.cc, __magick_read__.cc,
__osmesa_print__.cc, amd.cc, audiodevinfo.cc, dmperm.cc, fftw.cc,
symrcm.cc, ov-base-diag.cc, ov-base-sparse.cc, ov-base.cc,
ov-bool-sparse.cc, ov-builtin.cc, ov-complex.cc, ov-cx-diag.cc,
ov-cx-mat.cc, ov-cx-sparse.cc, ov-fcn-handle.cc, ov-fcn-inline.cc,
ov-float.cc, ov-flt-complex.cc, ov-flt-cx-diag.cc, ov-flt-cx-mat.cc,
ov-flt-re-diag.cc, ov-flt-re-mat.cc, ov-lazy-idx.cc, ov-mex-fcn.cc,
ov-perm.cc, ov-range.cc, ov-re-diag.cc, ov-re-mat.cc, ov-re-sparse.cc,
ov-scalar.cc, ov-str-mat.cc, op-bm-b.cc, op-bm-bm.cc, op-sbm-b.cc,
op-sbm-bm.cc, op-str-m.cc, op-str-s.cc, oct-parse.in.yy, pt-cbinop.cc,
pt-colon.cc, pt-decl.cc, pt-exp.cc, pt-id.cc, pt-misc.cc,
pt-select.cc, pt-unop.cc: Eliminate simple uses of error_state.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Mon, 05 Oct 2015 19:29:36 -0400 |
parents | 4197fc428c7d |
children |
line wrap: on
line source
/* Copyright (C) 2008-2015 Jaroslav Hajek 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/>. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #include "error.h" #include "oct-obj.h" #include "ov.h" #include "pt-cbinop.h" #include "pt-bp.h" #include "pt-unop.h" #include "pt-walk.h" octave_value_list tree_compound_binary_expression::rvalue (int nargout) { octave_value_list retval; if (nargout > 1) error ("binary operator '%s': invalid number of output arguments", oper () . c_str ()); else retval = rvalue1 (nargout); return retval; } octave_value tree_compound_binary_expression::rvalue1 (int) { octave_value retval; if (op_lhs) { octave_value a = op_lhs->rvalue1 (); if (a.is_defined () && op_rhs) { octave_value b = op_rhs->rvalue1 (); if (b.is_defined ()) retval = ::do_binary_op (etype, a, b); } } return retval; } // If a tree expression is a transpose or hermitian transpose, return // the argument and corresponding operator. static octave_value::unary_op strip_trans_herm (tree_expression *&exp) { if (exp->is_unary_expression ()) { tree_unary_expression *uexp = dynamic_cast<tree_unary_expression *> (exp); octave_value::unary_op op = uexp->op_type (); if (op == octave_value::op_transpose || op == octave_value::op_hermitian) exp = uexp->operand (); else op = octave_value::unknown_unary_op; return op; } else return octave_value::unknown_unary_op; } static octave_value::unary_op strip_not (tree_expression *&exp) { if (exp->is_unary_expression ()) { tree_unary_expression *uexp = dynamic_cast<tree_unary_expression *> (exp); octave_value::unary_op op = uexp->op_type (); if (op == octave_value::op_not) exp = uexp->operand (); else op = octave_value::unknown_unary_op; return op; } else return octave_value::unknown_unary_op; } // Possibly convert multiplication to trans_mul, mul_trans, herm_mul, // or mul_herm. static octave_value::compound_binary_op simplify_mul_op (tree_expression *&a, tree_expression *&b) { octave_value::compound_binary_op retop = octave_value::unknown_compound_binary_op; octave_value::unary_op opa = strip_trans_herm (a); if (opa == octave_value::op_hermitian) retop = octave_value::op_herm_mul; else if (opa == octave_value::op_transpose) retop = octave_value::op_trans_mul; else { octave_value::unary_op opb = strip_trans_herm (b); if (opb == octave_value::op_hermitian) retop = octave_value::op_mul_herm; else if (opb == octave_value::op_transpose) retop = octave_value::op_mul_trans; } return retop; } // Possibly convert left division to trans_ldiv or herm_ldiv. static octave_value::compound_binary_op simplify_ldiv_op (tree_expression *&a, tree_expression *&) { octave_value::compound_binary_op retop = octave_value::unknown_compound_binary_op; octave_value::unary_op opa = strip_trans_herm (a); if (opa == octave_value::op_hermitian) retop = octave_value::op_herm_ldiv; else if (opa == octave_value::op_transpose) retop = octave_value::op_trans_ldiv; return retop; } // Possibly contract and/or with negation. static octave_value::compound_binary_op simplify_and_or_op (tree_expression *&a, tree_expression *&b, octave_value::binary_op op) { octave_value::compound_binary_op retop = octave_value::unknown_compound_binary_op; octave_value::unary_op opa = strip_not (a); if (opa == octave_value::op_not) { if (op == octave_value::op_el_and) retop = octave_value::op_el_not_and; else if (op == octave_value::op_el_or) retop = octave_value::op_el_not_or; } else { octave_value::unary_op opb = strip_not (b); if (opb == octave_value::op_not) { if (op == octave_value::op_el_and) retop = octave_value::op_el_and_not; else if (op == octave_value::op_el_or) retop = octave_value::op_el_or_not; } } return retop; } tree_binary_expression * maybe_compound_binary_expression (tree_expression *a, tree_expression *b, int l, int c, octave_value::binary_op t) { tree_expression *ca = a; tree_expression *cb = b; octave_value::compound_binary_op ct; switch (t) { case octave_value::op_mul: ct = simplify_mul_op (ca, cb); break; case octave_value::op_ldiv: ct = simplify_ldiv_op (ca, cb); break; case octave_value::op_el_and: case octave_value::op_el_or: ct = simplify_and_or_op (ca, cb, t); break; default: ct = octave_value::unknown_compound_binary_op; break; } tree_binary_expression *ret = (ct == octave_value::unknown_compound_binary_op) ? new tree_binary_expression (a, b, l, c, t) : new tree_compound_binary_expression (a, b, l, c, t, ca, cb, ct); return ret; }