/* -*- 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 #include #include #include #include #include namespace svl { namespace { inline sal_Int32 getRefCount( const rtl_uString* p ) { return (p->refCount & 0x3FFFFFFF); } typedef std::unordered_set StrHashType; typedef std::pair InsertResultType; typedef std::unordered_map StrStoreType; InsertResultType findOrInsert( StrHashType& rPool, const OUString& rStr ) { StrHashType::iterator it = rPool.find(rStr); bool bInserted = false; if (it == rPool.end()) { // Not yet in the pool. std::pair r = rPool.insert(rStr); if (!r.second) // Insertion failed. return InsertResultType(rPool.end(), false); it = r.first; bInserted = true; } return InsertResultType(it, bInserted); } } struct SharedStringPool::Impl { mutable osl::Mutex maMutex; StrHashType maStrPool; StrHashType maStrPoolUpper; StrStoreType maStrStore; const CharClass* mpCharClass; explicit Impl( const CharClass* pCharClass ) : mpCharClass(pCharClass) {} }; SharedStringPool::SharedStringPool( const CharClass* pCharClass ) : mpImpl(new Impl(pCharClass)) {} SharedStringPool::~SharedStringPool() { } SharedString SharedStringPool::intern( const OUString& rStr ) { osl::MutexGuard aGuard(&mpImpl->maMutex); InsertResultType aRes = findOrInsert(mpImpl->maStrPool, rStr); if (aRes.first == mpImpl->maStrPool.end()) // Insertion failed. return SharedString(); rtl_uString* pOrig = aRes.first->pData; if (!mpImpl->mpCharClass) // We don't track case insensitive strings. return SharedString(pOrig, nullptr); if (!aRes.second) { // No new string has been inserted. Return the existing string in the pool. StrStoreType::const_iterator it = mpImpl->maStrStore.find(pOrig); if (it == mpImpl->maStrStore.end()) return SharedString(); rtl_uString* pUpper = it->second.pData; return SharedString(pOrig, pUpper); } // This is a new string insertion. Establish mapping to upper-case variant. OUString aUpper = mpImpl->mpCharClass->uppercase(rStr); aRes = findOrInsert(mpImpl->maStrPoolUpper, aUpper); if (aRes.first == mpImpl->maStrPoolUpper.end()) // Failed to insert or fetch upper-case variant. Should never happen. return SharedString(); mpImpl->maStrStore.insert(StrStoreType::value_type(pOrig, *aRes.first)); return SharedString(pOrig, aRes.first->pData); } void SharedStringPool::purge() { osl::MutexGuard aGuard(&mpImpl->maMutex); StrHashType aNewStrPool; StrHashType::iterator it = mpImpl->maStrPool.begin(), itEnd = mpImpl->maStrPool.end(); for (; it != itEnd; ++it) { const rtl_uString* p = it->pData; if (getRefCount(p) == 1) { // Remove it from the upper string map. This should unref the // upper string linked to this original string. mpImpl->maStrStore.erase(p); } else // Still referenced outside the pool. Keep it. aNewStrPool.insert(*it); } mpImpl->maStrPool.swap(aNewStrPool); aNewStrPool.clear(); // for re-use. // Purge the upper string pool as well. it = mpImpl->maStrPoolUpper.begin(); itEnd = mpImpl->maStrPoolUpper.end(); for (; it != itEnd; ++it) { const rtl_uString* p = it->pData; if (getRefCount(p) > 1) aNewStrPool.insert(*it); } mpImpl->maStrPoolUpper.swap(aNewStrPool); } size_t SharedStringPool::getCount() const { osl::MutexGuard aGuard(&mpImpl->maMutex); return mpImpl->maStrPool.size(); } size_t SharedStringPool::getCountIgnoreCase() const { osl::MutexGuard aGuard(&mpImpl->maMutex); return mpImpl->maStrPoolUpper.size(); } } /* vim:set shiftwidth=4 softtabstop=4 expandtab: */