|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the QtXmlPatterns module of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 #include "qcommonsequencetypes_p.h" |
|
43 #include "qgenericsequencetype_p.h" |
|
44 #include "qoptimizationpasses_p.h" |
|
45 |
|
46 #include "qifthenclause_p.h" |
|
47 |
|
48 QT_BEGIN_NAMESPACE |
|
49 |
|
50 using namespace QPatternist; |
|
51 |
|
52 IfThenClause::IfThenClause(const Expression::Ptr &test, |
|
53 const Expression::Ptr &then, |
|
54 const Expression::Ptr &el) : TripleContainer(test, then, el) |
|
55 { |
|
56 } |
|
57 |
|
58 Item::Iterator::Ptr IfThenClause::evaluateSequence(const DynamicContext::Ptr &context) const |
|
59 { |
|
60 return m_operand1->evaluateEBV(context) |
|
61 ? m_operand2->evaluateSequence(context) |
|
62 : m_operand3->evaluateSequence(context); |
|
63 } |
|
64 |
|
65 Item IfThenClause::evaluateSingleton(const DynamicContext::Ptr &context) const |
|
66 { |
|
67 return m_operand1->evaluateEBV(context) |
|
68 ? m_operand2->evaluateSingleton(context) |
|
69 : m_operand3->evaluateSingleton(context); |
|
70 } |
|
71 |
|
72 bool IfThenClause::evaluateEBV(const DynamicContext::Ptr &context) const |
|
73 { |
|
74 return m_operand1->evaluateEBV(context) |
|
75 ? m_operand2->evaluateEBV(context) |
|
76 : m_operand3->evaluateEBV(context); |
|
77 } |
|
78 |
|
79 void IfThenClause::evaluateToSequenceReceiver(const DynamicContext::Ptr &context) const |
|
80 { |
|
81 if(m_operand1->evaluateEBV(context)) |
|
82 m_operand2->evaluateToSequenceReceiver(context); |
|
83 else |
|
84 m_operand3->evaluateToSequenceReceiver(context); |
|
85 } |
|
86 |
|
87 Expression::Ptr IfThenClause::compress(const StaticContext::Ptr &context) |
|
88 { |
|
89 const Expression::Ptr me(TripleContainer::compress(context)); |
|
90 |
|
91 if(me != this) |
|
92 return me; |
|
93 |
|
94 /* All operands mustn't be evaluated in order for const folding to |
|
95 * be possible. Let's see how far we get. */ |
|
96 |
|
97 if(m_operand1->isEvaluated()) |
|
98 { |
|
99 if(m_operand1->evaluateEBV(context->dynamicContext())) |
|
100 return m_operand2; |
|
101 else |
|
102 return m_operand3; |
|
103 } |
|
104 else |
|
105 return me; |
|
106 } |
|
107 |
|
108 QList<QExplicitlySharedDataPointer<OptimizationPass> > IfThenClause::optimizationPasses() const |
|
109 { |
|
110 return OptimizationPasses::ifThenPasses; |
|
111 } |
|
112 |
|
113 SequenceType::List IfThenClause::expectedOperandTypes() const |
|
114 { |
|
115 SequenceType::List result; |
|
116 result.append(CommonSequenceTypes::EBV); |
|
117 result.append(CommonSequenceTypes::ZeroOrMoreItems); |
|
118 result.append(CommonSequenceTypes::ZeroOrMoreItems); |
|
119 return result; |
|
120 } |
|
121 |
|
122 SequenceType::Ptr IfThenClause::staticType() const |
|
123 { |
|
124 const SequenceType::Ptr t1(m_operand2->staticType()); |
|
125 const SequenceType::Ptr t2(m_operand3->staticType()); |
|
126 |
|
127 return makeGenericSequenceType(t1->itemType() | t2->itemType(), |
|
128 t1->cardinality() | t2->cardinality()); |
|
129 } |
|
130 |
|
131 ExpressionVisitorResult::Ptr IfThenClause::accept(const ExpressionVisitor::Ptr &visitor) const |
|
132 { |
|
133 return visitor->visit(this); |
|
134 } |
|
135 |
|
136 Expression::ID IfThenClause::id() const |
|
137 { |
|
138 return IDIfThenClause; |
|
139 } |
|
140 |
|
141 /* |
|
142 Expression::Properties IfThenClause::properties() const |
|
143 { |
|
144 return m_operand1->properties() |
|
145 | m_operand2->properties() |
|
146 | m_operand3->properties() |
|
147 & ( Expression::RequiresFocus |
|
148 | Expression::IsEvaluated |
|
149 | Expression::DisableElimination); |
|
150 } |
|
151 */ |
|
152 QT_END_NAMESPACE |