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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "txNodeSorter.h"
#include "txExecutionState.h"
#include "txXPathResultComparator.h"
#include "nsGkAtoms.h"
#include "txNodeSetContext.h"
#include "txExpr.h"
#include "txStringUtils.h"
#include "nsQuickSort.h"
#include "mozilla/CheckedInt.h"
#include "mozilla/UniquePtrExtensions.h"
using mozilla::CheckedUint32;
using mozilla::MakeUnique;
using mozilla::MakeUniqueFallible;
using mozilla::UniquePtr;
/*
* Sorts Nodes as specified by the W3C XSLT 1.0 Recommendation
*/
txNodeSorter::txNodeSorter() : mNKeys(0) {}
txNodeSorter::~txNodeSorter() {
txListIterator iter(&mSortKeys);
while (iter.hasNext()) {
SortKey* key = (SortKey*)iter.next();
delete key->mComparator;
delete key;
}
}
nsresult txNodeSorter::addSortElement(Expr* aSelectExpr, Expr* aLangExpr,
Expr* aDataTypeExpr, Expr* aOrderExpr,
Expr* aCaseOrderExpr,
txIEvalContext* aContext) {
UniquePtr<SortKey> key(new SortKey);
nsresult rv = NS_OK;
// Select
key->mExpr = aSelectExpr;
// Order
bool ascending = true;
if (aOrderExpr) {
nsAutoString attrValue;
rv = aOrderExpr->evaluateToString(aContext, attrValue);
NS_ENSURE_SUCCESS(rv, rv);
if (TX_StringEqualsAtom(attrValue, nsGkAtoms::descending)) {
ascending = false;
} else if (!TX_StringEqualsAtom(attrValue, nsGkAtoms::ascending)) {
// XXX ErrorReport: unknown value for order attribute
return NS_ERROR_XSLT_BAD_VALUE;
}
}
// Create comparator depending on datatype
nsAutoString dataType;
if (aDataTypeExpr) {
rv = aDataTypeExpr->evaluateToString(aContext, dataType);
NS_ENSURE_SUCCESS(rv, rv);
}
if (!aDataTypeExpr || TX_StringEqualsAtom(dataType, nsGkAtoms::text)) {
// Text comparator
// Language
nsAutoString lang;
if (aLangExpr) {
rv = aLangExpr->evaluateToString(aContext, lang);
NS_ENSURE_SUCCESS(rv, rv);
}
// Case-order
bool upperFirst = false;
if (aCaseOrderExpr) {
nsAutoString attrValue;
rv = aCaseOrderExpr->evaluateToString(aContext, attrValue);
NS_ENSURE_SUCCESS(rv, rv);
if (TX_StringEqualsAtom(attrValue, nsGkAtoms::upperFirst)) {
upperFirst = true;
} else if (!TX_StringEqualsAtom(attrValue, nsGkAtoms::lowerFirst)) {
// XXX ErrorReport: unknown value for case-order attribute
return NS_ERROR_XSLT_BAD_VALUE;
}
}
key->mComparator =
new txResultStringComparator(ascending, upperFirst, lang);
} else if (TX_StringEqualsAtom(dataType, nsGkAtoms::number)) {
// Number comparator
key->mComparator = new txResultNumberComparator(ascending);
} else {
// XXX ErrorReport: unknown data-type
return NS_ERROR_XSLT_BAD_VALUE;
}
// mSortKeys owns key now.
mSortKeys.add(key.release());
mNKeys++;
return NS_OK;
}
nsresult txNodeSorter::sortNodeSet(txNodeSet* aNodes, txExecutionState* aEs,
txNodeSet** aResult) {
if (mNKeys == 0 || aNodes->isEmpty()) {
RefPtr<txNodeSet> ref(aNodes);
ref.forget(aResult);
return NS_OK;
}
*aResult = nullptr;
RefPtr<txNodeSet> sortedNodes;
nsresult rv = aEs->recycler()->getNodeSet(getter_AddRefs(sortedNodes));
NS_ENSURE_SUCCESS(rv, rv);
// Create and set up memoryblock for sort-values and indexarray
CheckedUint32 len = aNodes->size();
CheckedUint32 numSortValues = len * mNKeys;
CheckedUint32 sortValuesSize = numSortValues * sizeof(txObject*);
if (!sortValuesSize.isValid()) {
return NS_ERROR_OUT_OF_MEMORY;
}
auto indexes = MakeUniqueFallible<uint32_t[]>(len.value());
auto sortValues = MakeUniqueFallible<txObject*[]>(numSortValues.value());
if (!indexes || !sortValues) {
return NS_ERROR_OUT_OF_MEMORY;
}
uint32_t i;
for (i = 0; i < len.value(); ++i) {
indexes[i] = i;
}
memset(sortValues.get(), 0, sortValuesSize.value());
auto nodeSetContext = MakeUnique<txNodeSetContext>(aNodes, aEs);
// Sort the indexarray
SortData sortData;
sortData.mNodeSorter = this;
sortData.mContext = nodeSetContext.get();
sortData.mSortValues = sortValues.get();
sortData.mRv = NS_OK;
aEs->pushEvalContext(nodeSetContext.release());
NS_QuickSort(indexes.get(), len.value(), sizeof(uint32_t), compareNodes,
&sortData);
// Delete these here so we don't have to deal with them at every possible
// failurepoint
for (i = 0; i < numSortValues.value(); ++i) {
delete sortValues[i];
}
if (NS_FAILED(sortData.mRv)) {
// The txExecutionState owns the evalcontext so no need to handle it
return sortData.mRv;
}
// Insert nodes in sorted order in new nodeset
for (i = 0; i < len.value(); ++i) {
rv = sortedNodes->append(aNodes->get(indexes[i]));
if (NS_FAILED(rv)) {
// The txExecutionState owns the evalcontext so no need to handle it
return rv;
}
}
delete aEs->popEvalContext();
sortedNodes.forget(aResult);
return NS_OK;
}
// static
int txNodeSorter::compareNodes(const void* aIndexA, const void* aIndexB,
void* aSortData) {
SortData* sortData = static_cast<SortData*>(aSortData);
NS_ENSURE_SUCCESS(sortData->mRv, -1);
txListIterator iter(&sortData->mNodeSorter->mSortKeys);
uint32_t indexA = *static_cast<const uint32_t*>(aIndexA);
uint32_t indexB = *static_cast<const uint32_t*>(aIndexB);
txObject** sortValuesA =
sortData->mSortValues + indexA * sortData->mNodeSorter->mNKeys;
txObject** sortValuesB =
sortData->mSortValues + indexB * sortData->mNodeSorter->mNKeys;
unsigned int i;
// Step through each key until a difference is found
for (i = 0; i < sortData->mNodeSorter->mNKeys; ++i) {
SortKey* key = (SortKey*)iter.next();
// Lazy create sort values
if (!sortValuesA[i] &&
!calcSortValue(sortValuesA[i], key, sortData, indexA)) {
return -1;
}
if (!sortValuesB[i] &&
!calcSortValue(sortValuesB[i], key, sortData, indexB)) {
return -1;
}
// Compare node values
int compRes =
key->mComparator->compareValues(sortValuesA[i], sortValuesB[i]);
if (compRes != 0) return compRes;
}
// All keys have the same value for these nodes
return indexA - indexB;
}
// static
bool txNodeSorter::calcSortValue(txObject*& aSortValue, SortKey* aKey,
SortData* aSortData, uint32_t aNodeIndex) {
aSortData->mContext->setPosition(aNodeIndex + 1); // position is 1-based
nsresult rv = aKey->mComparator->createSortableValue(
aKey->mExpr, aSortData->mContext, aSortValue);
if (NS_FAILED(rv)) {
aSortData->mRv = rv;
return false;
}
return true;
}
|
