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
|
/* -*- 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 <svl/sharedstringpool.hxx>
#include <svl/sharedstring.hxx>
#include <unotools/charclass.hxx>
#include <osl/mutex.hxx>
#include <unordered_map>
#include <unordered_set>
namespace svl {
namespace {
inline sal_Int32 getRefCount( const rtl_uString* p )
{
return (p->refCount & 0x3FFFFFFF);
}
typedef std::unordered_set<OUString> StrHashType;
typedef std::pair<StrHashType::iterator, bool> InsertResultType;
typedef std::unordered_map<const rtl_uString*, OUString> 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<StrHashType::iterator, bool> r = rPool.insert(rStr);
assert(r.second);
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);
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);
assert(it != mpImpl->maStrStore.end());
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);
assert(aRes.first != mpImpl->maStrPoolUpper.end());
mpImpl->maStrStore.emplace(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: */
|
