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
152
153
154
155
156
157
158
159
160
|
/*
dbx_tree: tree database driver for Miranda IM
Copyright 2010 Michael "Protogenes" Kunz,
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#pragma once
#include "lockfree_hashmap.h"
template <typename TAdministrator, typename TData>
class CThreadLocalStorage
{
private:
typedef struct TListElem
{
TListElem * Next;
TAdministrator * Admin;
TData Data;
TListElem(TListElem * ANext, TAdministrator * AAdmin, const TData & AData)
: Next(ANext), Admin(AAdmin), Data(AData)
{ };
} TListElem, *PListElem;
static __declspec(thread) PListElem m_Head;
static inline uint32_t DummyHash(const void * Data, uint32_t Length)
{
return *reinterpret_cast<const uint32_t *>(Data);
}
lockfree::hash_map<DWORD, TData, DummyHash> * m_LockfreeList;
typedef typename lockfree::hash_map<DWORD, TData, DummyHash>::iterator TThreadStorage;
public:
CThreadLocalStorage();
~CThreadLocalStorage();
TData & Open(TAdministrator * Admin, const TData & Default);
TData * Find(TAdministrator * Admin);
void Remove(TAdministrator * Admin);
};
const bool _CanUseTLS = ((LOBYTE(LOWORD(GetVersion()))) >= 6);
template <typename TAdministrator, typename TData>
typename CThreadLocalStorage<TAdministrator, TData>::PListElem CThreadLocalStorage<TAdministrator, TData>::m_Head = NULL;
template <typename TAdministrator, typename TData>
CThreadLocalStorage<TAdministrator, TData>::CThreadLocalStorage()
{
m_LockfreeList = NULL;
if (!_CanUseTLS)
m_LockfreeList = new lockfree::hash_map<DWORD, TData, DummyHash>();
}
template <typename TAdministrator, typename TData>
CThreadLocalStorage<TAdministrator, TData>::~CThreadLocalStorage()
{
delete m_LockfreeList;
}
template <typename TAdministrator, typename TData>
typename TData & CThreadLocalStorage<TAdministrator, TData>::Open(typename TAdministrator * Admin, const TData & Default)
{
if (_CanUseTLS)
{
PListElem * last = &m_Head;
PListElem i = m_Head;
while (i && (i->Admin != Admin))
{
last = &i->Next;
i = i->Next;
}
if (i)
{
*last = i->Next;
i->Next = m_Head;
m_Head = i;
} else {
m_Head = new TListElem(m_Head, Admin, Default);
}
return m_Head->Data;
} else {
TThreadStorage & res = m_LockfreeList->insert(std::make_pair(GetCurrentThreadId(), Default)).first;
return res->second;
}
}
template <typename TAdministrator, typename TData>
typename TData * CThreadLocalStorage<TAdministrator, TData>::Find(typename TAdministrator * Admin)
{
if (_CanUseTLS)
{
PListElem * last = &m_Head;
PListElem i = m_Head;
while (i && (i->Admin != Admin))
{
last = &i->Next;
i = i->Next;
}
if (i)
{
*last = i->Next;
i->Next = m_Head;
m_Head = i;
} else {
return NULL;
}
return &m_Head->Data;
} else {
TThreadStorage & res = m_LockfreeList->find(GetCurrentThreadId());
if (res != m_LockfreeList->end())
return &res->second;
else
return NULL;
}
}
template <typename TAdministrator, typename TData>
void CThreadLocalStorage<TAdministrator, TData>::Remove(typename TAdministrator * Admin)
{
if (_CanUseTLS)
{
PListElem * last = &m_Head;
PListElem i = m_Head;
while (i && (i->Admin != Admin))
{
last = &i->Next;
i = i->Next;
}
if (i)
{
*last = i->Next;
delete i;
}
} else {
m_LockfreeList->erase(GetCurrentThreadId());
}
}
|
