/* -*- 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/. * * This file incorporates work covered by the following license notice: * * Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed * with this work for additional information regarding copyright * ownership. The ASF licenses this file to you under the Apache * License, Version 2.0 (the "License"); you may not use this file * except in compliance with the License. You may obtain a copy of * the License at http://www.apache.org/licenses/LICENSE-2.0 . */ #include #include #include #include #include #include #include #include #include struct SbxVarEntry { SbxVariableRef mpVar; std::optional maAlias; }; // SbxArray SbxArray::SbxArray( SbxDataType t ) { eType = t; if( t != SbxVARIANT ) SetFlag( SbxFlagBits::Fixed ); } SbxArray& SbxArray::operator=( const SbxArray& rArray ) { if( &rArray != this ) { eType = rArray.eType; Clear(); for( const auto& rpSrcRef : rArray.mVarEntries ) { SbxVariableRef pSrc_ = rpSrcRef.mpVar; if( !pSrc_.is() ) continue; if( eType != SbxVARIANT ) { // Convert no objects if( eType != SbxOBJECT || pSrc_->GetClass() != SbxClassType::Object ) { pSrc_->Convert(eType); } } mVarEntries.push_back( rpSrcRef ); } } return *this; } SbxArray::~SbxArray() { } SbxDataType SbxArray::GetType() const { return static_cast( eType | SbxARRAY ); } void SbxArray::Clear() { mVarEntries.clear(); } sal_uInt32 SbxArray::Count() const { return mVarEntries.size(); } SbxVariableRef& SbxArray::GetRef( sal_uInt32 nIdx ) { // If necessary extend the array DBG_ASSERT( nIdx <= SBX_MAXINDEX32, "SBX: Array-Index > SBX_MAXINDEX32" ); // Very Hot Fix if( nIdx > SBX_MAXINDEX32 ) { SetError( ERRCODE_BASIC_OUT_OF_RANGE ); nIdx = 0; } if ( mVarEntries.size() <= nIdx ) mVarEntries.resize(nIdx+1); return mVarEntries[nIdx].mpVar; } SbxVariable* SbxArray::Get( sal_uInt32 nIdx ) { if( !CanRead() ) { SetError( ERRCODE_BASIC_PROP_WRITEONLY ); return nullptr; } SbxVariableRef& rRef = GetRef( nIdx ); if ( !rRef.is() ) rRef = new SbxVariable( eType ); return rRef.get(); } void SbxArray::Put( SbxVariable* pVar, sal_uInt32 nIdx ) { if( !CanWrite() ) SetError( ERRCODE_BASIC_PROP_READONLY ); else { if( pVar ) if( eType != SbxVARIANT ) // Convert no objects if( eType != SbxOBJECT || pVar->GetClass() != SbxClassType::Object ) pVar->Convert( eType ); SbxVariableRef& rRef = GetRef( nIdx ); // tdf#122250. It is possible that I hold the last reference to myself, so check, otherwise I might // call SetFlag on myself after I have died. bool removingMyself = rRef && rRef->GetParameters() == this && GetRefCount() == 1; if( rRef.get() != pVar ) { rRef = pVar; if (!removingMyself) SetFlag( SbxFlagBits::Modified ); } } } const OUString & SbxArray::GetAlias( sal_uInt32 nIdx ) { if( !CanRead() ) { SetError( ERRCODE_BASIC_PROP_WRITEONLY ); return EMPTY_OUSTRING; } SbxVarEntry& rRef = reinterpret_cast(GetRef( nIdx )); if (!rRef.maAlias) return EMPTY_OUSTRING; return *rRef.maAlias; } void SbxArray::PutAlias( const OUString& rAlias, sal_uInt32 nIdx ) { if( !CanWrite() ) { SetError( ERRCODE_BASIC_PROP_READONLY ); } else { SbxVarEntry& rRef = reinterpret_cast( GetRef( nIdx ) ); rRef.maAlias = rAlias; } } void SbxArray::Insert( SbxVariable* pVar, sal_uInt32 nIdx ) { DBG_ASSERT( mVarEntries.size() <= SBX_MAXINDEX32, "SBX: Array gets too big" ); if( mVarEntries.size() > SBX_MAXINDEX32 ) { return; } SbxVarEntry p; p.mpVar = pVar; size_t nSize = mVarEntries.size(); if( nIdx > nSize ) { nIdx = nSize; } if( eType != SbxVARIANT && pVar ) { p.mpVar->Convert(eType); } if( nIdx == nSize ) { mVarEntries.push_back( p ); } else { mVarEntries.insert( mVarEntries.begin() + nIdx, p ); } SetFlag( SbxFlagBits::Modified ); } void SbxArray::Remove( sal_uInt32 nIdx ) { if( nIdx < mVarEntries.size() ) { mVarEntries.erase( mVarEntries.begin() + nIdx ); SetFlag( SbxFlagBits::Modified ); } } void SbxArray::Remove( SbxVariable const * pVar ) { if( pVar ) { for( size_t i = 0; i < mVarEntries.size(); i++ ) { if (mVarEntries[i].mpVar.get() == pVar) { Remove( i ); break; } } } } // Taking over of the data from the passed array, at which // the variable of the same name will be overwritten. void SbxArray::Merge( SbxArray* p ) { if (!p) return; for (auto& rEntry1: p->mVarEntries) { if (!rEntry1.mpVar.is()) continue; OUString aName = rEntry1.mpVar->GetName(); sal_uInt16 nHash = rEntry1.mpVar->GetHashCode(); // Is the element by the same name already inside? // Then overwrite! for (auto& rEntry2: mVarEntries) { if (!rEntry2.mpVar.is()) continue; if (rEntry2.mpVar->GetHashCode() == nHash && rEntry2.mpVar->GetName().equalsIgnoreAsciiCase(aName)) { // Take this element and clear the original. rEntry2.mpVar = rEntry1.mpVar; rEntry1.mpVar.clear(); break; } } if (rEntry1.mpVar.is()) { // We don't have element with the same name. Add a new entry. SbxVarEntry aNewEntry; aNewEntry.mpVar = rEntry1.mpVar; if (rEntry1.maAlias) aNewEntry.maAlias = *rEntry1.maAlias; mVarEntries.push_back(aNewEntry); } } } // Search of an element by his name and type. If an element is an object, // it will also be scanned... SbxVariable* SbxArray::Find( const OUString& rName, SbxClassType t ) { SbxVariable* p = nullptr; if( mVarEntries.empty() ) return nullptr; bool bExtSearch = IsSet( SbxFlagBits::ExtSearch ); sal_uInt16 nHash = SbxVariable::MakeHashCode( rName ); const OUString aNameCI = SbxVariable::NameToCaseInsensitiveName(rName); for (auto& rEntry : mVarEntries) { if (!rEntry.mpVar.is() || !rEntry.mpVar->IsVisible()) continue; // The very secure search works as well, if there is no hashcode! sal_uInt16 nVarHash = rEntry.mpVar->GetHashCode(); // tdf#148358 - compare the names case-insensitive if ( (!nVarHash || nVarHash == nHash) && (t == SbxClassType::DontCare || rEntry.mpVar->GetClass() == t) && (rEntry.mpVar->GetName(SbxNameType::CaseInsensitive) == aNameCI)) { p = rEntry.mpVar.get(); p->ResetFlag(SbxFlagBits::ExtFound); break; } // Did we have an array/object with extended search? if (bExtSearch && rEntry.mpVar->IsSet(SbxFlagBits::ExtSearch)) { switch (rEntry.mpVar->GetClass()) { case SbxClassType::Object: { // Objects are not allowed to scan their parent. SbxFlagBits nOld = rEntry.mpVar->GetFlags(); rEntry.mpVar->ResetFlag(SbxFlagBits::GlobalSearch); p = static_cast(*rEntry.mpVar).Find(rName, t); rEntry.mpVar->SetFlags(nOld); } break; case SbxClassType::Array: // Casting SbxVariable to SbxArray? Really? p = reinterpret_cast(*rEntry.mpVar).Find(rName, t); break; default: ; } if (p) { p->SetFlag(SbxFlagBits::ExtFound); break; } } } return p; } bool SbxArray::LoadData( SvStream& rStrm, sal_uInt16 /*nVer*/ ) { sal_uInt16 nElem; Clear(); bool bRes = true; SbxFlagBits f = nFlags; nFlags |= SbxFlagBits::Write; rStrm.ReadUInt16( nElem ); nElem &= 0x7FFF; for( sal_uInt32 n = 0; n < nElem; n++ ) { sal_uInt16 nIdx; rStrm.ReadUInt16( nIdx ); SbxVariableRef pVar = static_cast(Load( rStrm ).get()); if( pVar ) { SbxVariableRef& rRef = GetRef( nIdx ); rRef = std::move(pVar); } else { bRes = false; break; } } nFlags = f; return bRes; } std::pair SbxArray::StoreData( SvStream& rStrm ) const { sal_uInt32 nElem = 0; // Which elements are even defined? for( auto& rEntry: mVarEntries ) { if (rEntry.mpVar.is() && !(rEntry.mpVar->GetFlags() & SbxFlagBits::DontStore)) nElem++; } rStrm.WriteUInt16( nElem ); sal_uInt32 nVersion = B_IMG_VERSION_12; for( size_t n = 0; n < mVarEntries.size(); n++ ) { const SbxVarEntry& rEntry = mVarEntries[n]; if (rEntry.mpVar.is() && !(rEntry.mpVar->GetFlags() & SbxFlagBits::DontStore)) { rStrm.WriteUInt16( n ); const auto [bSuccess, nVersionModule] = rEntry.mpVar->Store(rStrm); if (!bSuccess) return { false, 0 }; else if (nVersionModule > nVersion) { nVersion = nVersionModule; } } } return { true, nVersion }; } // #100883 Method to set method directly to parameter array void SbxArray::PutDirect( SbxVariable* pVar, sal_uInt32 nIdx ) { SbxVariableRef& rRef = GetRef( nIdx ); rRef = pVar; } // SbxArray SbxDimArray::SbxDimArray( SbxDataType t ) : SbxArray( t ), mbHasFixedSize( false ) { } SbxDimArray& SbxDimArray::operator=( const SbxDimArray& rArray ) { if( &rArray != this ) { SbxArray::operator=( static_cast(rArray) ); m_vDimensions = rArray.m_vDimensions; mbHasFixedSize = rArray.mbHasFixedSize; } return *this; } SbxDimArray::~SbxDimArray() { } void SbxDimArray::Clear() { m_vDimensions.clear(); SbxArray::Clear(); } // Add a dimension void SbxDimArray::AddDimImpl( sal_Int32 lb, sal_Int32 ub, bool bAllowSize0 ) { ErrCode eRes = ERRCODE_NONE; if( ub < lb && !bAllowSize0 ) { eRes = ERRCODE_BASIC_OUT_OF_RANGE; ub = lb; } SbxDim d; d.nLbound = lb; d.nUbound = ub; d.nSize = ub - lb + 1; m_vDimensions.push_back(d); if( eRes ) SetError( eRes ); } void SbxDimArray::AddDim( sal_Int32 lb, sal_Int32 ub ) { AddDimImpl( lb, ub, false ); } void SbxDimArray::unoAddDim( sal_Int32 lb, sal_Int32 ub ) { AddDimImpl( lb, ub, true ); } // Readout dimension data bool SbxDimArray::GetDim( sal_Int32 n, sal_Int32& rlb, sal_Int32& rub ) const { if( n < 1 || o3tl::make_unsigned(n) > m_vDimensions.size() ) { SetError( ERRCODE_BASIC_OUT_OF_RANGE ); rub = rlb = 0; return false; } SbxDim d = m_vDimensions[n - 1]; rub = d.nUbound; rlb = d.nLbound; return true; } // Element-Ptr with the help of an index list sal_uInt32 SbxDimArray::Offset( const sal_Int32* pIdx ) { sal_uInt32 nPos = 0; for( const auto& rDimension : m_vDimensions ) { sal_Int32 nIdx = *pIdx++; if( nIdx < rDimension.nLbound || nIdx > rDimension.nUbound ) { nPos = sal_uInt32(SBX_MAXINDEX32) + 1; break; } nPos = nPos * rDimension.nSize + nIdx - rDimension.nLbound; } if( m_vDimensions.empty() || nPos > SBX_MAXINDEX32 ) { SetError( ERRCODE_BASIC_OUT_OF_RANGE ); nPos = 0; } return nPos; } SbxVariable* SbxDimArray::Get( const sal_Int32* pIdx ) { return SbxArray::Get( Offset( pIdx ) ); } void SbxDimArray::Put( SbxVariable* p, const sal_Int32* pIdx ) { SbxArray::Put( p, Offset( pIdx ) ); } // Element-Number with the help of Parameter-Array sal_uInt32 SbxDimArray::Offset( SbxArray* pPar ) { #if HAVE_FEATURE_SCRIPTING if (m_vDimensions.empty() || !pPar || ((m_vDimensions.size() != sal::static_int_cast(pPar->Count() - 1)) && SbiRuntime::isVBAEnabled())) { SetError( ERRCODE_BASIC_OUT_OF_RANGE ); return 0; } #endif sal_uInt32 nPos = 0; sal_uInt32 nOff = 1; // Non element 0! for (auto const& vDimension : m_vDimensions) { sal_Int32 nIdx = pPar->Get( nOff++ )->GetLong(); if( nIdx < vDimension.nLbound || nIdx > vDimension.nUbound ) { nPos = sal_uInt32(SBX_MAXINDEX32)+1; break; } nPos = nPos * vDimension.nSize + nIdx - vDimension.nLbound; if (IsError()) break; } if( nPos > o3tl::make_unsigned(SBX_MAXINDEX32) ) { SetError( ERRCODE_BASIC_OUT_OF_RANGE ); nPos = 0; } return nPos; } SbxVariable* SbxDimArray::Get( SbxArray* pPar ) { return SbxArray::Get( Offset( pPar ) ); } bool SbxDimArray::LoadData( SvStream& rStrm, sal_uInt16 nVer ) { short nTmp(0); rStrm.ReadInt16(nTmp); if (nTmp > 0) { auto nDimension = o3tl::make_unsigned(nTmp); const size_t nMinRecordSize = 4; const size_t nMaxPossibleRecords = rStrm.remainingSize() / nMinRecordSize; if (nDimension > nMaxPossibleRecords) { SAL_WARN("basic", "SbxDimArray::LoadData more entries claimed than stream could contain"); return false; } for (decltype(nDimension) i = 0; i < nDimension && rStrm.GetError() == ERRCODE_NONE; ++i) { sal_Int16 lb(0), ub(0); rStrm.ReadInt16( lb ).ReadInt16( ub ); AddDim( lb, ub ); } } return SbxArray::LoadData( rStrm, nVer ); } std::pair SbxDimArray::StoreData( SvStream& rStrm ) const { assert(m_vDimensions.size() <= sal::static_int_cast(std::numeric_limits::max())); rStrm.WriteInt16( m_vDimensions.size() ); for( std::size_t i = 1; i <= m_vDimensions.size(); i++ ) { sal_Int32 lb32, ub32; GetDim(i, lb32, ub32); assert(lb32 >= -SBX_MAXINDEX && ub32 <= SBX_MAXINDEX); rStrm.WriteInt16(lb32).WriteInt16(ub32); } return SbxArray::StoreData( rStrm ); } /* vim:set shiftwidth=4 softtabstop=4 expandtab: */