blob: 3c9dc627d873d47887211271d98bfbb31bf8544a (
plain)
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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: cachemapobject3.cxx,v $
* $Revision: 1.5 $
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_ucb.hxx"
#include "cachemapobject3.hxx"
#include "osl/diagnose.h"
#include "osl/interlck.h"
#include "osl/mutex.hxx"
#include "rtl/ref.hxx"
#include "rtl/ustring.hxx"
#ifndef INCLUDED_MEMORY
#include <memory>
#define INCLUDED_MEMORY
#endif
using ucb::cachemap::Object3;
using ucb::cachemap::ObjectContainer3;
inline
Object3::Object3(rtl::Reference< ObjectContainer3 > const & rContainer):
m_xContainer(rContainer),
m_nRefCount(0)
{
OSL_ASSERT(m_xContainer.is());
}
inline Object3::~Object3() SAL_THROW(())
{}
void Object3::release() SAL_THROW(())
{
if (osl_decrementInterlockedCount(&m_nRefCount) == 0)
{
m_xContainer->releaseElement(this);
delete this;
}
}
void ObjectContainer3::releaseElement(Object3 * pElement) SAL_THROW(())
{
OSL_ASSERT(pElement);
osl::MutexGuard aGuard(m_aMutex);
if (pElement->m_aContainerIt != m_aMap.end())
m_aMap.erase(pElement->m_aContainerIt);
}
ObjectContainer3::ObjectContainer3()
{}
ObjectContainer3::~ObjectContainer3() SAL_THROW(())
{}
rtl::Reference< Object3 > ObjectContainer3::get(rtl::OUString const & rKey)
{
osl::MutexGuard aGuard(m_aMutex);
Map::iterator aIt(m_aMap.find(rKey));
if (aIt == m_aMap.end())
{
std::auto_ptr< Object3 > xElement(new Object3(this));
aIt = m_aMap.insert(Map::value_type(rKey, xElement.get())).first;
aIt->second->m_aContainerIt = aIt;
xElement.release();
return aIt->second;
}
else if (osl_incrementInterlockedCount(&aIt->second->m_nRefCount) > 1)
{
rtl::Reference< Object3 > xElement(aIt->second);
osl_decrementInterlockedCount(&aIt->second->m_nRefCount);
return xElement;
}
else
{
osl_decrementInterlockedCount(&aIt->second->m_nRefCount);
aIt->second->m_aContainerIt = m_aMap.end();
aIt->second = new Object3(this);
aIt->second->m_aContainerIt = aIt;
return aIt->second;
}
}
|