diff options
author | Tor Lillqvist <tml@collabora.com> | 2017-06-16 00:18:57 +0300 |
---|---|---|
committer | Tor Lillqvist <tml@collabora.com> | 2017-06-16 12:17:40 +0200 |
commit | 5c81adc51a05a016e754de7961d3a7bdb4494e01 (patch) | |
tree | fbfdca0ef841a545ed10d612df83631c50c24bfc /formula | |
parent | 468fc3847cfd65217949630e2ffd9fb0a89e9cbb (diff) |
Get rid of the index inside FormulaTokenArray
Instead, use FormulaTokenArrrayPlainIterator everywhere, especially in
the FormulaCompiler.
This is the final step of a long chain of commits. (Split up into many
"uncontroversial" bits, and then this, to make potential bisecting
easier.)
Also added a logging operator<< for FormulaTokenArray, for SAL_DEBUG,
SAL_INFO etc goodness.
Change-Id: I02fe29f3f1e0dc33e5cba69e594223b4178a12bc
Reviewed-on: https://gerrit.libreoffice.org/38851
Tested-by: Jenkins <ci@libreoffice.org>
Reviewed-by: Tor Lillqvist <tml@collabora.com>
Diffstat (limited to 'formula')
-rw-r--r-- | formula/source/core/api/FormulaCompiler.cxx | 58 | ||||
-rw-r--r-- | formula/source/core/api/token.cxx | 181 |
2 files changed, 41 insertions, 198 deletions
diff --git a/formula/source/core/api/FormulaCompiler.cxx b/formula/source/core/api/FormulaCompiler.cxx index 7da75874ea04..310ddb2346f3 100644 --- a/formula/source/core/api/FormulaCompiler.cxx +++ b/formula/source/core/api/FormulaCompiler.cxx @@ -700,6 +700,7 @@ FormulaCompiler::FormulaCompiler( FormulaTokenArray& rArr ) : nCurrentFactorParam(0), pArr( &rArr ), + maArrIterator( rArr ), pCode( nullptr ), pStack( nullptr ), eLastOp( ocPush ), @@ -715,10 +716,13 @@ FormulaCompiler::FormulaCompiler( FormulaTokenArray& rArr ) { } +FormulaTokenArray FormulaCompiler::smDummyTokenArray; + FormulaCompiler::FormulaCompiler() : nCurrentFactorParam(0), pArr( nullptr ), + maArrIterator( smDummyTokenArray ), pCode( nullptr ), pStack( nullptr ), eLastOp( ocPush ), @@ -1260,11 +1264,11 @@ bool FormulaCompiler::GetToken() { FormulaTokenRef pSpacesToken; short nWasColRowName; - if ( pArr->nIndex > 0 && pArr->pCode[ pArr->nIndex-1 ]->GetOpCode() == ocColRowName ) + if ( maArrIterator.mnIndex > 0 && pArr->pCode[ maArrIterator.mnIndex-1 ]->GetOpCode() == ocColRowName ) nWasColRowName = 1; else nWasColRowName = 0; - mpToken = pArr->Next(); + mpToken = maArrIterator.Next(); while( mpToken && mpToken->GetOpCode() == ocSpaces ) { // For significant whitespace remember last ocSpaces token. Usually @@ -1274,7 +1278,7 @@ bool FormulaCompiler::GetToken() nWasColRowName++; if ( bAutoCorrect && !pStack ) CreateStringFromToken( aCorrectedFormula, mpToken.get() ); - mpToken = pArr->Next(); + mpToken = maArrIterator.Next(); } if ( bAutoCorrect && !pStack && mpToken ) CreateStringFromToken( aCorrectedSymbol, mpToken.get() ); @@ -1296,7 +1300,7 @@ bool FormulaCompiler::GetToken() if ( nWasColRowName >= 2 && mpToken->GetOpCode() == ocColRowName ) { // convert an ocSpaces to ocIntersect in RPN mpLastToken = mpToken = new FormulaByteToken( ocIntersect ); - pArr->nIndex--; // we advanced to the second ocColRowName, step back + maArrIterator.mnIndex--; // we advanced to the second ocColRowName, step back } else if (pSpacesToken && FormulaGrammar::isExcelSyntax( meGrammar) && mpLastToken && mpToken && @@ -1306,7 +1310,7 @@ bool FormulaCompiler::GetToken() // Let IntersectionLine() <- Factor() decide how to treat this, // once the actual arguments are determined in RPN. mpLastToken = mpToken = pSpacesToken; - pArr->nIndex--; // step back from next non-spaces token + maArrIterator.mnIndex--; // step back from next non-spaces token return true; } } @@ -1494,7 +1498,7 @@ void FormulaCompiler::Factor() else SetError( FormulaError::PairExpected); sal_uInt8 nSepCount = 0; - const sal_uInt16 nSepPos = pArr->nIndex - 1; // separator position, if any + const sal_uInt16 nSepPos = maArrIterator.mnIndex - 1; // separator position, if any if( !bNoParam ) { nSepCount++; @@ -1521,12 +1525,13 @@ void FormulaCompiler::Factor() // Current index is nSepPos+3 if expression stops, or // nSepPos+4 if expression continues after the call because // we just called NextToken() to move away from it. - if (pc >= 2 && (pArr->nIndex == nSepPos + 3 || pArr->nIndex == nSepPos + 4) && + if (pc >= 2 && (maArrIterator.mnIndex == nSepPos + 3 || maArrIterator.mnIndex == nSepPos + 4) && pArr->pCode[nSepPos+1]->GetType() == svDouble && pArr->pCode[nSepPos+1]->GetDouble() != 1.0 && pArr->pCode[nSepPos+2]->GetOpCode() == ocClose && pArr->RemoveToken( nSepPos, 2) == 2) { + maArrIterator.AfterRemoveToken( nSepPos, 2); // Remove the ocPush/svDouble just removed also from // the compiler local RPN array. --pCode; --pc; @@ -1783,7 +1788,7 @@ void FormulaCompiler::IntersectionLine() RangeLine(); while (mpToken->GetOpCode() == ocIntersect || mpToken->GetOpCode() == ocSpaces) { - sal_uInt16 nCodeIndex = pArr->nIndex - 1; + sal_uInt16 nCodeIndex = maArrIterator.mnIndex - 1; FormulaToken** pCode1 = pCode - 1; FormulaTokenRef p = mpToken; NextToken(); @@ -1984,6 +1989,7 @@ bool FormulaCompiler::CompileTokenArray() aCorrectedSymbol.clear(); } pArr->DelRPN(); + maArrIterator.Reset(); pStack = nullptr; FormulaToken* pData[ FORMULA_MAXTOKENS ]; pCode = pData; @@ -1994,7 +2000,7 @@ bool FormulaCompiler::CompileTokenArray() aCorrectedFormula = "="; } pArr->ClearRecalcMode(); - pArr->Reset(); + maArrIterator.Reset(); eLastOp = ocOpen; pc = 0; NextToken(); @@ -2021,6 +2027,7 @@ bool FormulaCompiler::CompileTokenArray() if (pArr->GetCodeError() != FormulaError::NONE && mbStopOnError) { pArr->DelRPN(); + maArrIterator.Reset(); pArr->SetHyperLink( false); } @@ -2049,6 +2056,8 @@ void FormulaCompiler::PopTokenArray() if( p->bTemp ) delete pArr; pArr = p->pArr; + maArrIterator = FormulaTokenArrayPlainIterator(*pArr); + maArrIterator.Jump(p->nIndex); mpLastToken = p->mpLastToken; delete p; } @@ -2068,20 +2077,27 @@ void FormulaCompiler::CreateStringFromTokenArray( OUStringBuffer& rBuffer ) return; FormulaTokenArray* pSaveArr = pArr; + int nSaveIndex = maArrIterator.GetIndex(); bool bODFF = FormulaGrammar::isODFF( meGrammar); if (bODFF || FormulaGrammar::isPODF( meGrammar) ) { // Scan token array for missing args and re-write if present. MissingConventionODF aConv( bODFF); if (pArr->NeedsPodfRewrite( aConv)) + { pArr = pArr->RewriteMissing( aConv ); + maArrIterator = FormulaTokenArrayPlainIterator( *pArr ); + } } else if ( FormulaGrammar::isOOXML( meGrammar ) ) { // Scan token array for missing args and rewrite if present. MissingConventionOOXML aConv; if (pArr->NeedsOoxmlRewrite()) + { pArr = pArr->RewriteMissing( aConv ); + maArrIterator = FormulaTokenArrayPlainIterator( *pArr ); + } } // At least one character per token, plus some are references, some are @@ -2090,7 +2106,7 @@ void FormulaCompiler::CreateStringFromTokenArray( OUStringBuffer& rBuffer ) if ( pArr->IsRecalcModeForced() ) rBuffer.append( '='); - const FormulaToken* t = pArr->First(); + const FormulaToken* t = maArrIterator.First(); while( t ) t = CreateStringFromToken( rBuffer, t, true ); @@ -2098,6 +2114,8 @@ void FormulaCompiler::CreateStringFromTokenArray( OUStringBuffer& rBuffer ) { delete pArr; pArr = pSaveArr; + maArrIterator = FormulaTokenArrayPlainIterator( *pArr ); + maArrIterator.Jump(nSaveIndex); } } @@ -2120,9 +2138,9 @@ const FormulaToken* FormulaCompiler::CreateStringFromToken( OUStringBuffer& rBuf { // AND, OR infix? if ( bAllowArrAdvance ) - t = pArr->Next(); + t = maArrIterator.Next(); else - t = pArr->PeekNext(); + t = maArrIterator.PeekNext(); bNext = false; bSpaces = ( !t || t->GetOpCode() != ocOpen ); } @@ -2134,11 +2152,11 @@ const FormulaToken* FormulaCompiler::CreateStringFromToken( OUStringBuffer& rBuf bool bIntersectionOp = mxSymbols->isODFF(); if (bIntersectionOp) { - const FormulaToken* p = pArr->PeekPrevNoSpaces(); + const FormulaToken* p = maArrIterator.PeekPrevNoSpaces(); bIntersectionOp = (p && p->GetOpCode() == ocColRowName); if (bIntersectionOp) { - p = pArr->PeekNextNoSpaces(); + p = maArrIterator.PeekNextNoSpaces(); bIntersectionOp = (p && p->GetOpCode() == ocColRowName); } } @@ -2208,13 +2226,13 @@ const FormulaToken* FormulaCompiler::CreateStringFromToken( OUStringBuffer& rBuf { // Suppress all TableRef related tokens, the resulting // range was written by CreateStringFromIndex(). - const FormulaToken* const p = pArr->PeekNext(); + const FormulaToken* const p = maArrIterator.PeekNext(); if (p && p->GetOpCode() == ocTableRefOpen) { int nLevel = 0; do { - t = pArr->Next(); + t = maArrIterator.Next(); if (!t) break; @@ -2284,7 +2302,7 @@ const FormulaToken* FormulaCompiler::CreateStringFromToken( OUStringBuffer& rBuf if ( bAllowArrAdvance ) { if( bNext ) - t = pArr->Next(); + t = maArrIterator.Next(); return t; } return pTokenP; @@ -2457,10 +2475,10 @@ OpCode FormulaCompiler::NextToken() { // Fake an intersection op as last op for the next round, but at // least roughly check if it could make sense at all. - FormulaToken* pPrev = pArr->PeekPrevNoSpaces(); + FormulaToken* pPrev = maArrIterator.PeekPrevNoSpaces(); if (pPrev && isPotentialRangeType( pPrev, false, false)) { - FormulaToken* pNext = pArr->PeekNextNoSpaces(); + FormulaToken* pNext = maArrIterator.PeekNextNoSpaces(); if (pNext && isPotentialRangeType( pNext, false, true)) eLastOp = ocIntersect; else @@ -2610,10 +2628,12 @@ void FormulaCompiler::PushTokenArray( FormulaTokenArray* pa, bool bTemp ) FormulaArrayStack* p = new FormulaArrayStack; p->pNext = pStack; p->pArr = pArr; + p->nIndex = maArrIterator.GetIndex(); p->mpLastToken = mpLastToken; p->bTemp = bTemp; pStack = p; pArr = pa; + maArrIterator = FormulaTokenArrayPlainIterator( *pArr ); } } // namespace formula diff --git a/formula/source/core/api/token.cxx b/formula/source/core/api/token.cxx index 1e966f1a40f1..78c69ea7360a 100644 --- a/formula/source/core/api/token.cxx +++ b/formula/source/core/api/token.cxx @@ -456,134 +456,6 @@ bool FormulaTokenArray::Fill( } return bError; } -FormulaToken* FormulaTokenArray::GetNextReference() -{ - while( nIndex < nLen ) - { - FormulaToken* t = pCode[ nIndex++ ]; - switch( t->GetType() ) - { - case svSingleRef: - case svDoubleRef: - case svExternalSingleRef: - case svExternalDoubleRef: - return t; - default: - { - // added to avoid warnings - } - } - } - return nullptr; -} - -FormulaToken* FormulaTokenArray::GetNextColRowName() -{ - while( nIndex < nLen ) - { - FormulaToken* t = pCode[ nIndex++ ]; - if ( t->GetOpCode() == ocColRowName ) - return t; - } - return nullptr; -} - -FormulaToken* FormulaTokenArray::GetNextReferenceRPN() -{ - while( nIndex < nRPN ) - { - FormulaToken* t = pRPN[ nIndex++ ]; - switch( t->GetType() ) - { - case svSingleRef: - case svDoubleRef: - case svExternalSingleRef: - case svExternalDoubleRef: - return t; - default: - { - // added to avoid warnings - } - } - } - return nullptr; -} - -FormulaToken* FormulaTokenArray::GetNextReferenceOrName() -{ - if( pCode ) - { - while ( nIndex < nLen ) - { - FormulaToken* t = pCode[ nIndex++ ]; - switch( t->GetType() ) - { - case svSingleRef: - case svDoubleRef: - case svIndex: - case svExternalSingleRef: - case svExternalDoubleRef: - case svExternalName: - return t; - default: - { - // added to avoid warnings - } - } - } - } - return nullptr; -} - -FormulaToken* FormulaTokenArray::GetNextName() -{ - if( pCode ) - { - while ( nIndex < nLen ) - { - FormulaToken* t = pCode[ nIndex++ ]; - if( t->GetType() == svIndex ) - return t; - } - } // if( pCode ) - return nullptr; -} - -FormulaToken* FormulaTokenArray::Next() -{ - if( pCode && nIndex < nLen ) - return pCode[ nIndex++ ]; - else - return nullptr; -} - -FormulaToken* FormulaTokenArray::NextNoSpaces() -{ - if( pCode ) - { - while( (nIndex < nLen) && (pCode[ nIndex ]->GetOpCode() == ocSpaces) ) - ++nIndex; - if( nIndex < nLen ) - return pCode[ nIndex++ ]; - } - return nullptr; -} - -FormulaToken* FormulaTokenArray::NextRPN() -{ - if( pRPN && nIndex < nRPN ) - return pRPN[ nIndex++ ]; - else - return nullptr; -} - -FormulaToken* FormulaTokenArray::PrevRPN() -{ - if( pRPN && nIndex ) - return pRPN[ --nIndex ]; - else - return nullptr; -} void FormulaTokenArray::DelRPN() { @@ -597,7 +469,7 @@ void FormulaTokenArray::DelRPN() delete [] pRPN; } pRPN = nullptr; - nRPN = nIndex = 0; + nRPN = 0; } FormulaToken* FormulaTokenArray::FirstToken() const @@ -614,46 +486,6 @@ FormulaToken* FormulaTokenArray::PeekPrev( sal_uInt16 & nIdx ) return nullptr; } -FormulaToken* FormulaTokenArray::PeekNext() -{ - if( pCode && nIndex < nLen ) - return pCode[ nIndex ]; - else - return nullptr; -} - -FormulaToken* FormulaTokenArray::PeekNextNoSpaces() -{ - if( pCode && nIndex < nLen ) - { - sal_uInt16 j = nIndex; - while ( j < nLen && pCode[j]->GetOpCode() == ocSpaces ) - j++; - if ( j < nLen ) - return pCode[ j ]; - else - return nullptr; - } - else - return nullptr; -} - -FormulaToken* FormulaTokenArray::PeekPrevNoSpaces() -{ - if( pCode && nIndex > 1 ) - { - sal_uInt16 j = nIndex - 2; - while ( pCode[j]->GetOpCode() == ocSpaces && j > 0 ) - j--; - if ( j > 0 || pCode[j]->GetOpCode() != ocSpaces ) - return pCode[ j ]; - else - return nullptr; - } - else - return nullptr; -} - FormulaToken* FormulaTokenArray::FirstRPNToken() const { if (!pRPN || nRPN == 0) @@ -737,7 +569,6 @@ FormulaTokenArray::FormulaTokenArray() : pRPN(nullptr), nLen(0), nRPN(0), - nIndex(0), nError(FormulaError::NONE), nMode(ScRecalcMode::NORMAL), bHyperLink(false), @@ -761,7 +592,6 @@ void FormulaTokenArray::Assign( const FormulaTokenArray& r ) { nLen = r.nLen; nRPN = r.nRPN; - nIndex = r.nIndex; nError = r.nError; nMode = r.nMode; bHyperLink = r.bHyperLink; @@ -828,7 +658,7 @@ void FormulaTokenArray::Clear() } pCode = nullptr; pRPN = nullptr; nError = FormulaError::NONE; - nLen = nIndex = nRPN = 0; + nLen = nRPN = 0; bHyperLink = false; mbFromRangeName = false; mbShareable = true; @@ -924,13 +754,6 @@ sal_uInt16 FormulaTokenArray::RemoveToken( sal_uInt16 nOffset, sal_uInt16 nCount } nLen -= nCount; - if (nIndex >= nOffset) - { - if (nIndex < nStop) - nIndex = nOffset + 1; - else - nIndex -= nStop - nOffset; - } return nCount; } else |