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
173
174
175
176
177
178
179
180
181
182
|
/****************************************************************************
**
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qcommonsequencetypes_p.h"
#include "qoptimizerblocks_p.h"
#include "qoptimizationpasses_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
OptimizationPass::List OptimizationPasses::comparisonPasses;
OptimizationPass::List OptimizationPasses::forPasses;
OptimizationPass::List OptimizationPasses::ifThenPasses;
OptimizationPass::List OptimizationPasses::notFN;
void OptimizationPasses::Coordinator::init()
{
static bool isInitialized = false; // STATIC DATA
if(isInitialized)
return;
isInitialized = true;
/* Note, below is many of the building blocks re-used in several passes
* in order to reduce memory use. Thus, when changing one building block
* it potentially affects many passes. */
/* ****************************************************** */
/* Rewrite "count(<expr>) ge 1" into "exists(<expr>)" */
OptimizationPass::ExpressionMarker firstFirstChild;
firstFirstChild.append(0);
firstFirstChild.append(0);
ExpressionIdentifier::List geOpIDs;
const ExpressionIdentifier::Ptr countFN(new ByIDIdentifier(Expression::IDCountFN));
geOpIDs.append(countFN);
geOpIDs.append(ExpressionIdentifier::Ptr(new IntegerIdentifier(1)));
QVector<Expression::ID> geMatcher;
geMatcher.append(Expression::IDValueComparison);
geMatcher.append(Expression::IDGeneralComparison);
const ExpressionIdentifier::Ptr ge(new ComparisonIdentifier(geMatcher,
AtomicComparator::OperatorGreaterOrEqual));
const ExpressionCreator::Ptr existsFN(new ByIDCreator(Expression::IDExistsFN));
const OptimizationPass::Ptr geToExists(new OptimizationPass(ge, geOpIDs, firstFirstChild, existsFN));
comparisonPasses.append(geToExists);
/* ****************************************************** */
/* ****************************************************** */
/* Rewrite "count(<expr>) gt 0" into "exists(<expr>)" */
ExpressionIdentifier::List countAndIntZero;
countAndIntZero.append(countFN);
const ExpressionIdentifier::Ptr zeroInteger(new IntegerIdentifier(0));
countAndIntZero.append(zeroInteger);
const ExpressionIdentifier::Ptr gt(new ComparisonIdentifier(geMatcher,
AtomicComparator::OperatorGreaterThan));
const OptimizationPass::Ptr gtToExists(new OptimizationPass(gt, countAndIntZero,
firstFirstChild, existsFN));
comparisonPasses.append(gtToExists);
/* ****************************************************** */
/* ****************************************************** */
/* Rewrite "count(<expr>) ne 0" into "exists(<expr>)" */
const ExpressionIdentifier::Ptr ne(new ComparisonIdentifier(geMatcher,
AtomicComparator::OperatorNotEqual));
const OptimizationPass::Ptr neToExists(new OptimizationPass(ne, countAndIntZero, firstFirstChild,
existsFN,
OptimizationPass::AnyOrder));
comparisonPasses.append(neToExists);
/* ****************************************************** */
/* ****************************************************** */
/* Rewrite "count(<expr>) eq 0" into "empty(<expr>)" */
ExpressionIdentifier::List eqOpIDs;
eqOpIDs.append(countFN);
eqOpIDs.append(zeroInteger);
const ExpressionCreator::Ptr emptyFN(new ByIDCreator(Expression::IDEmptyFN));
const ExpressionIdentifier::Ptr eq(new ComparisonIdentifier(geMatcher,
AtomicComparator::OperatorEqual));
const OptimizationPass::Ptr eqToEmpty(new OptimizationPass(eq, eqOpIDs, firstFirstChild,
emptyFN,
OptimizationPass::AnyOrder));
comparisonPasses.append(eqToEmpty);
/* ****************************************************** */
/* ****************************************************** */
/* Rewrite "for $var in <expr> return $var" into "<expr>" */
ExpressionIdentifier::List forOps;
OptimizationPass::ExpressionMarker firstChild;
firstChild.append(0);
forOps.append(ExpressionIdentifier::Ptr());
forOps.append(ExpressionIdentifier::Ptr(new ByIDIdentifier(Expression::IDRangeVariableReference)));
const OptimizationPass::Ptr simplifyFor(new OptimizationPass(ExpressionIdentifier::Ptr(), forOps,
firstChild, ExpressionCreator::Ptr()));
forPasses.append(simplifyFor);
/* ****************************************************** */
/* ****************************************************** */
/* Rewrite "if(<expr>) then true() else false()" to "<expr>" */
OptimizationPass::ExpressionMarker marker;
marker.append(0);
ExpressionIdentifier::List opIDs;
opIDs.append(ExpressionIdentifier::Ptr(new BySequenceTypeIdentifier(
CommonSequenceTypes::ExactlyOneBoolean)));
opIDs.append(ExpressionIdentifier::Ptr(new BooleanIdentifier(true)));
opIDs.append(ExpressionIdentifier::Ptr(new BooleanIdentifier(false)));
const OptimizationPass::Ptr pass(new OptimizationPass(ExpressionIdentifier::Ptr(), opIDs, marker));
ifThenPasses.append(pass);
/* ****************************************************** */
/* ****************************************************** */
/* Rewrite "not(exists(X))" into "empty(X)" */
ExpressionIdentifier::List idExistsFN;
idExistsFN.append(ExpressionIdentifier::Ptr(new ByIDIdentifier(Expression::IDExistsFN)));
notFN.append(OptimizationPass::Ptr(new OptimizationPass(ExpressionIdentifier::Ptr(),
idExistsFN,
firstFirstChild,
emptyFN)));
/* Rewrite "not(empty(X))" into "exists(X)" */
ExpressionIdentifier::List idEmptyFN;
idEmptyFN.append(ExpressionIdentifier::Ptr(new ByIDIdentifier(Expression::IDEmptyFN)));
notFN.append(OptimizationPass::Ptr(new OptimizationPass(ExpressionIdentifier::Ptr(),
idEmptyFN,
firstFirstChild,
existsFN)));
/* ****************************************************** */
}
QT_END_NAMESPACE
|
