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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* 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 <grouptokenconverter.hxx>
#include <document.hxx>
#include <formulacell.hxx>
#include <tokenarray.hxx>
#include <refdata.hxx>
#include <formula/token.hxx>
#include <formula/vectortoken.hxx>
using namespace formula;
bool ScGroupTokenConverter::isSelfReferenceRelative(const ScAddress& rRefPos, SCROW nRelRow)
{
if (rRefPos.Col() != mrPos.Col() || rRefPos.Tab() != mrPos.Tab())
return false;
SCROW nLen = mrCell.GetCellGroup()->mnLength;
SCROW nEndRow = mrPos.Row() + nLen - 1;
if (nRelRow < 0)
{
SCROW nTest = nEndRow;
nTest += nRelRow;
if (nTest >= mrPos.Row())
return true;
}
else if (nRelRow > 0)
{
SCROW nTest = mrPos.Row(); // top row.
nTest += nRelRow;
if (nTest <= nEndRow)
return true;
}
return false;
}
bool ScGroupTokenConverter::isSelfReferenceAbsolute(const ScAddress& rRefPos)
{
if (rRefPos.Col() != mrPos.Col() || rRefPos.Tab() != mrPos.Tab())
return false;
SCROW nLen = mrCell.GetCellGroup()->mnLength;
SCROW nEndRow = mrPos.Row() + nLen - 1;
if (rRefPos.Row() < mrPos.Row())
return false;
if (rRefPos.Row() > nEndRow)
return false;
return true;
}
SCROW ScGroupTokenConverter::trimLength(SCTAB nTab, SCCOL nCol1, SCCOL nCol2, SCROW nRow, SCROW nRowLen)
{
SCROW nLastRow = nRow + nRowLen - 1; // current last row.
nLastRow = mrDoc.GetLastDataRow(nTab, nCol1, nCol2, nLastRow);
if (nLastRow < (nRow + nRowLen - 1))
{
// This can end up negative! Was that the original intent, or
// is it accidental? Was it not like that originally but the
// surrounding conditions changed?
nRowLen = nLastRow - nRow + 1;
// Anyway, let's assume it doesn't make sense to return a
// negative value here. But should we then return 0 or 1? In
// the "Column is empty" case below, we return 1, why!? And,
// at the callsites there are tests for a zero value returned
// from this function (but not for a negative one).
if (nRowLen < 0)
nRowLen = 0;
}
else if (nLastRow == 0)
// Column is empty.
nRowLen = 1;
return nRowLen;
}
ScGroupTokenConverter::ScGroupTokenConverter(
ScTokenArray& rGroupTokens, ScDocument& rDoc, const ScFormulaCell& rCell, const ScAddress& rPos) :
mrGroupTokens(rGroupTokens),
mrDoc(rDoc),
mrCell(rCell),
mrPos(rPos)
{
}
bool ScGroupTokenConverter::convert( const ScTokenArray& rCode, sc::FormulaLogger::GroupScope& rScope )
{
#if 0
{ // debug to start with:
ScCompiler aComp( &mrDoc, mrPos, rCode, formula::FormulaGrammar::GRAM_NATIVE_XL_R1C1);
OUStringBuffer aAsString;
aComp.CreateStringFromTokenArray(aAsString);
}
#endif
const SCROW nLen = mrCell.GetCellGroup()->mnLength;
formula::FormulaTokenArrayPlainIterator aIter(rCode);
for (const formula::FormulaToken* p = aIter.First(); p; p = aIter.Next())
{
// A reference can be either absolute or relative. If it's absolute,
// convert it to a static value token. If relative, convert it to a
// vector reference token. Note: we only care about relative vs
// absolute reference state for row directions.
switch (p->GetType())
{
case svSingleRef:
{
ScSingleRefData aRef = *p->GetSingleRef();
if( aRef.IsDeleted())
return false;
ScAddress aRefPos = aRef.toAbs(&mrDoc, mrPos);
if (aRef.IsRowRel())
{
if (isSelfReferenceRelative(aRefPos, aRef.Row()))
return false;
// Trim data array length to actual data range.
SCROW nTrimLen = trimLength(aRefPos.Tab(), aRefPos.Col(), aRefPos.Col(), aRefPos.Row(), nLen);
// Fetch double array guarantees that the length of the
// returned array equals or greater than the requested
// length.
formula::VectorRefArray aArray;
if (nTrimLen)
{
#ifdef DBG_UTIL
// All the necessary Interpret() calls for all the cells
// should have been already handled by ScDependantsCalculator
// calling HandleRefArrayForParallelism(), and that handling also checks
// for cycles etc. Recursively calling Interpret() from here (which shouldn't
// happen) could lead to unhandled problems.
// Also, because of caching FetchVectorRefArray() fetches values for all rows
// up to the maximum one, so check those too.
mrDoc.AssertNoInterpretNeeded(
ScAddress(aRefPos.Col(), 0, aRefPos.Tab()), nTrimLen + aRefPos.Row());
#endif
aArray = mrDoc.FetchVectorRefArray(aRefPos, nTrimLen);
}
if (!aArray.isValid())
return false;
formula::SingleVectorRefToken aTok(aArray, nTrimLen);
mrGroupTokens.AddToken(aTok);
rScope.addRefMessage(mrPos, aRefPos, nLen, aArray);
if (nTrimLen && !mxFormulaGroupContext)
{
//tdf#98880 if the SingleVectorRefToken relies on the
//underlying storage provided by the Document
//FormulaGroupContext, take a reference to it here to
//ensure that backing storage exists for our lifetime
mxFormulaGroupContext = mrDoc.GetFormulaGroupContext();
}
}
else
{
// Absolute row reference.
if (isSelfReferenceAbsolute(aRefPos))
return false;
formula::FormulaTokenRef pNewToken = mrDoc.ResolveStaticReference(aRefPos);
if (!pNewToken)
return false;
mrGroupTokens.AddToken(*pNewToken);
rScope.addRefMessage(mrPos, aRefPos, *pNewToken);
}
}
break;
case svDoubleRef:
{
// This code may break in case of implicit intersection, leading to unnecessarily large
// matrix operations and possibly incorrect results (=C:C/D:D). That is handled by
// having ScCompiler check that there are no possible implicit intersections.
// Additionally some functions such as INDEX() and OFFSET() require a reference,
// that is handled by blacklisting those opcodes in ScTokenArray::CheckToken().
ScComplexRefData aRef = *p->GetDoubleRef();
if( aRef.IsDeleted())
return false;
ScRange aAbs = aRef.toAbs(&mrDoc, mrPos);
// Multiple sheets not handled by vector/matrix.
if (aRef.Ref1.Tab() != aRef.Ref2.Tab())
return false;
// Check for self reference.
if (aRef.Ref1.IsRowRel())
{
if (isSelfReferenceRelative(aAbs.aStart, aRef.Ref1.Row()))
return false;
}
else if (isSelfReferenceAbsolute(aAbs.aStart))
return false;
if (aRef.Ref2.IsRowRel())
{
if (isSelfReferenceRelative(aAbs.aEnd, aRef.Ref2.Row()))
return false;
}
else if (isSelfReferenceAbsolute(aAbs.aEnd))
return false;
// Row reference is relative.
bool bAbsFirst = !aRef.Ref1.IsRowRel();
bool bAbsLast = !aRef.Ref2.IsRowRel();
ScAddress aRefPos = aAbs.aStart;
size_t nCols = aAbs.aEnd.Col() - aAbs.aStart.Col() + 1;
std::vector<formula::VectorRefArray> aArrays;
aArrays.reserve(nCols);
SCROW nRefRowSize = aAbs.aEnd.Row() - aAbs.aStart.Row() + 1;
SCROW nArrayLength = nRefRowSize;
if (!bAbsLast)
{
// range end position is relative. Extend the array length.
SCROW nLastRefRowOffset = aAbs.aEnd.Row() - mrPos.Row();
SCROW nLastRefRow = mrPos.Row() + nLen - 1 + nLastRefRowOffset;
SCROW nNewLength = nLastRefRow - aAbs.aStart.Row() + 1;
if (nNewLength > nArrayLength)
nArrayLength = nNewLength;
}
// Trim trailing empty rows.
SCROW nRequestedLength = nArrayLength; // keep the original length.
nArrayLength = trimLength(aRefPos.Tab(), aAbs.aStart.Col(), aAbs.aEnd.Col(), aRefPos.Row(), nArrayLength);
for (SCCOL i = aAbs.aStart.Col(); i <= aAbs.aEnd.Col(); ++i)
{
aRefPos.SetCol(i);
formula::VectorRefArray aArray;
if (nArrayLength)
{
#ifdef DBG_UTIL
mrDoc.AssertNoInterpretNeeded(
ScAddress(aRefPos.Col(), 0, aRefPos.Tab()), nArrayLength + aRefPos.Row());
#endif
aArray = mrDoc.FetchVectorRefArray(aRefPos, nArrayLength);
}
if (!aArray.isValid())
return false;
aArrays.push_back(aArray);
}
formula::DoubleVectorRefToken aTok(aArrays, nArrayLength, nRefRowSize, bAbsFirst, bAbsLast);
mrGroupTokens.AddToken(aTok);
rScope.addRefMessage(mrPos, aAbs.aStart, nRequestedLength, aArrays);
if (nArrayLength && !aArrays.empty() && !mxFormulaGroupContext)
{
//tdf#98880 if the DoubleVectorRefToken relies on the
//underlying storage provided by the Document
//FormulaGroupContext, take a reference to it here to
//ensure that backing storage exists for our lifetime
mxFormulaGroupContext = mrDoc.GetFormulaGroupContext();
}
}
break;
case svIndex:
{
if (p->GetOpCode() != ocName)
{
// May be DB-range or TableRef
mrGroupTokens.AddToken(*p);
break;
}
// Named range.
ScRangeName* pNames = mrDoc.GetRangeName();
if (!pNames)
// This should never fail.
return false;
ScRangeData* pRange = pNames->findByIndex(p->GetIndex());
if (!pRange)
// No named range exists by that index.
return false;
ScTokenArray* pNamedTokens = pRange->GetCode();
if (!pNamedTokens)
// This named range is empty.
return false;
mrGroupTokens.AddOpCode(ocOpen);
if (!convert(*pNamedTokens, rScope))
return false;
mrGroupTokens.AddOpCode(ocClose);
}
break;
default:
mrGroupTokens.AddToken(*p);
}
}
return true;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
