/* -*- 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 namespace comphelper { using namespace ::com::sun::star::lang; using namespace ::com::sun::star::io; using namespace ::com::sun::star::uno; MemoryInputStream::MemoryInputStream( const sal_Int8* pData, sal_Int32 nDataLength) : m_pMemoryData(pData) , m_nMemoryDataLength(nDataLength) , m_nPos(0) { } // checks if closed, returns available size, not mutex-protected inline sal_Int32 MemoryInputStream::avail() { if (m_nPos == -1) throw NotConnectedException(OUString(), *this); return m_nMemoryDataLength - m_nPos; } // css::io::XInputStream sal_Int32 SAL_CALL MemoryInputStream::readBytes( Sequence& aData, sal_Int32 nBytesToRead ) { if (nBytesToRead < 0) throw BufferSizeExceededException(OUString(),*this); std::scoped_lock aGuard( m_aMutex ); sal_Int32 nAvail = avail(); if (nAvail < nBytesToRead) nBytesToRead = nAvail; aData.realloc(nBytesToRead); memcpy(aData.getArray(), m_pMemoryData + m_nPos, nBytesToRead); m_nPos += nBytesToRead; return nBytesToRead; } sal_Int32 MemoryInputStream::readSomeBytes( sal_Int8* pData, sal_Int32 nBytesToRead ) { if (nBytesToRead < 0) throw BufferSizeExceededException(OUString(),*this); std::scoped_lock aGuard( m_aMutex ); sal_Int32 nAvail = avail(); if (nAvail < nBytesToRead) nBytesToRead = nAvail; memcpy(pData, m_pMemoryData + m_nPos, nBytesToRead); m_nPos += nBytesToRead; return nBytesToRead; } sal_Int32 SAL_CALL MemoryInputStream::readSomeBytes( Sequence& aData, sal_Int32 nMaxBytesToRead ) { // all data is available at once return readBytes(aData, nMaxBytesToRead); } void SAL_CALL MemoryInputStream::skipBytes( sal_Int32 nBytesToSkip ) { if (nBytesToSkip < 0) throw BufferSizeExceededException(OUString(),*this); std::scoped_lock aGuard( m_aMutex ); sal_Int32 nAvail = avail(); if (nAvail < nBytesToSkip) nBytesToSkip = nAvail; m_nPos += nBytesToSkip; } sal_Int32 SAL_CALL MemoryInputStream::available( ) { std::scoped_lock aGuard( m_aMutex ); return avail(); } void SAL_CALL MemoryInputStream::closeInput( ) { std::scoped_lock aGuard( m_aMutex ); if (m_nPos == -1) throw NotConnectedException(OUString(), *this); m_nPos = -1; } void SAL_CALL MemoryInputStream::seek( sal_Int64 location ) { if ( location > m_nMemoryDataLength || location < 0 || location > SAL_MAX_INT32 ) throw IllegalArgumentException(u"bad location"_ustr, static_cast(this), 1); std::scoped_lock aGuard( m_aMutex ); m_nPos = static_cast(location); } sal_Int64 SAL_CALL MemoryInputStream::getPosition() { std::scoped_lock aGuard( m_aMutex ); return m_nPos; } sal_Int64 SAL_CALL MemoryInputStream::getLength( ) { return m_nMemoryDataLength; } SequenceInputStream::SequenceInputStream( css::uno::Sequence const & rData) : MemoryInputStream(rData.getConstArray(), rData.getLength()) , m_aData(rData) { } OSequenceOutputStream::OSequenceOutputStream(Sequence< sal_Int8 >& _rSeq, double _nResizeFactor, sal_Int32 _nMinimumResize) :m_rSequence(_rSeq) ,m_nResizeFactor(_nResizeFactor) ,m_nMinimumResize(_nMinimumResize) ,m_nSize(0) // starting at position 0 ,m_bConnected(true) { OSL_ENSURE(m_nResizeFactor > 1, "OSequenceOutputStream::OSequenceOutputStream : invalid resize factor !"); if (m_nResizeFactor <= 1) m_nResizeFactor = 1.3; } void SAL_CALL OSequenceOutputStream::writeBytes( const Sequence< sal_Int8 >& _rData ) { std::scoped_lock aGuard(m_aMutex); if (!m_bConnected) throw NotConnectedException(); // ensure the sequence has enough space left if (m_nSize + _rData.getLength() > m_rSequence.getLength()) { sal_Int32 nCurrentLength = m_rSequence.getLength(); sal_Int32 nNewLength = static_cast< sal_Int32 >( nCurrentLength * m_nResizeFactor); if (m_nMinimumResize > nNewLength - nCurrentLength) // we have a minimum so it's not too inefficient for small sequences and small write requests nNewLength = nCurrentLength + m_nMinimumResize; if (nNewLength < m_nSize + _rData.getLength()) { // it's not enough... the data would not fit // let's take the double amount of the length of the data to be written, as the next write // request could be as large as this one sal_Int32 nNewGrowth = _rData.getLength() * 2; nNewLength = nCurrentLength + nNewGrowth; } // round it off to the next multiple of 4... nNewLength = (nNewLength + 3) / 4 * 4; m_rSequence.realloc(nNewLength); } OSL_ENSURE(m_rSequence.getLength() >= m_nSize + _rData.getLength(), "ooops ... the realloc algorithm seems to be wrong :( !"); memcpy(m_rSequence.getArray() + m_nSize, _rData.getConstArray(), _rData.getLength()); m_nSize += _rData.getLength(); } void SAL_CALL OSequenceOutputStream::flush( ) { std::scoped_lock aGuard(m_aMutex); if (!m_bConnected) throw NotConnectedException(); // cut the sequence to the real size m_rSequence.realloc(m_nSize); } void OSequenceOutputStream::finalizeOutput() { // cut the sequence to the real size m_rSequence.realloc(m_nSize); // and don't allow any further accesses m_bConnected = false; } void SAL_CALL OSequenceOutputStream::closeOutput() { std::scoped_lock aGuard(m_aMutex); if (!m_bConnected) throw NotConnectedException(); finalizeOutput(); } } // namespace comphelper /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ distro/lhm/libreoffice-7-6+backports'>distro/lhm/libreoffice-7-6+backports LibreOffice 核心代码仓库文档基金会
summaryrefslogtreecommitdiff