1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2008-2025 The Octave Project Developers
//
// See the file COPYRIGHT.md in the top-level directory of this
// distribution or <https://octave.org/copyright/>.
//
// 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
// <https://www.gnu.org/licenses/>.
//
////////////////////////////////////////////////////////////////////////
#if defined (HAVE_CONFIG_H)
# include "config.h"
#endif
#include "interpreter.h"
#include "ov.h"
#include "pt-cbinop.h"
#include "pt-eval.h"
#include "pt-unop.h"
OCTAVE_BEGIN_NAMESPACE(octave)
octave_value
tree_compound_binary_expression::evaluate (tree_evaluator& tw, int)
{
octave_value val;
if (m_lhs)
{
// Evaluate with unknown number of output arguments
octave_value a = m_lhs->evaluate (tw, -1);
if (a.is_defined () && m_rhs)
{
// Evaluate with unknown number of output arguments
octave_value b = m_rhs->evaluate (tw, -1);
if (b.is_defined ())
{
interpreter& interp = tw.get_interpreter ();
type_info& ti = interp.get_type_info ();
val = binary_op (ti, m_etype, a, b);
}
}
}
return val;
}
typedef tree_expression *tree_expression_ptr_t;
// 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_ptr_t& 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;
}
// Possibly convert multiplication to trans_mul, mul_trans, herm_mul,
// or mul_herm.
static octave_value::compound_binary_op
simplify_mul_op (tree_expression_ptr_t& a, tree_expression_ptr_t& 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_ptr_t& a, tree_expression_ptr_t&)
{
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.
tree_binary_expression *
maybe_compound_binary_expression (tree_expression *a, const token& op_tok, tree_expression *b, 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;
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, op_tok, b, t)
: new tree_compound_binary_expression (a, op_tok, b, t, ca, cb, ct));
return ret;
}
OCTAVE_END_NAMESPACE(octave)
|
