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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
|
/*
* Copyright (c) 2012 SURFnet bv
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
* IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*****************************************************************************
HandleManager.cpp
One of the most difficult problems to track down is when stale cryptoki handles
for e.g. keys, objects and sessions get reused by a misbehaving application.
Especialy when handles that became invalid have since been reused.
A simple solution to this is to never reuse a handle once it has been issued
and subsequently invalidated.
The handle manager tracks issued handles along with what kind of object
is presented by the handle and an actual pointer to the object in question.
Issued handles are unique per application run. All session and object handles
use the same handle manager and therefore there will never be e.g. a session
with the same handle as an object.
*****************************************************************************/
#include "HandleManager.h"
#include "log.h"
// Constructor
HandleManager::HandleManager()
{
handlesMutex = MutexFactory::i()->getMutex();
handleCounter = 0;
}
// Destructor
HandleManager::~HandleManager()
{
MutexFactory::i()->recycleMutex(handlesMutex);
}
CK_SESSION_HANDLE HandleManager::addSession(CK_SLOT_ID slotID, CK_VOID_PTR session)
{
MutexLocker lock(handlesMutex);
Handle h( CKH_SESSION, slotID );
h.object = session;
handles[++handleCounter] = h;
return (CK_SESSION_HANDLE)handleCounter;
}
CK_VOID_PTR HandleManager::getSession(const CK_SESSION_HANDLE hSession)
{
MutexLocker lock(handlesMutex);
std::map< CK_ULONG, Handle>::iterator it = handles.find(hSession);
if (it == handles.end() || CKH_SESSION != it->second.kind)
return NULL_PTR;
return it->second.object;
}
CK_OBJECT_HANDLE HandleManager::addSessionObject(CK_SLOT_ID slotID, CK_SESSION_HANDLE hSession, bool isPrivate, CK_VOID_PTR object)
{
MutexLocker lock(handlesMutex);
// Return existing handle when the object has already been registered.
std::map< CK_VOID_PTR, CK_ULONG>::iterator oit = objects.find(object);
if (oit != objects.end()) {
std::map< CK_ULONG, Handle>::iterator hit = handles.find(oit->second);
if (hit == handles.end() || CKH_OBJECT != hit->second.kind || slotID != hit->second.slotID) {
objects.erase(oit);
return CK_INVALID_HANDLE;
} else
return oit->second;
}
Handle h( CKH_OBJECT, slotID, hSession );
h.isPrivate = isPrivate;
h.object = object;
handles[++handleCounter] = h;
objects[object] = handleCounter;
return (CK_OBJECT_HANDLE)handleCounter;
}
CK_OBJECT_HANDLE HandleManager::addTokenObject(CK_SLOT_ID slotID, bool isPrivate, CK_VOID_PTR object)
{
MutexLocker lock(handlesMutex);
// Return existing handle when the object has already been registered.
std::map< CK_VOID_PTR, CK_ULONG>::iterator oit = objects.find(object);
if (oit != objects.end()) {
std::map< CK_ULONG, Handle>::iterator hit = handles.find(oit->second);
if (hit == handles.end() || CKH_OBJECT != hit->second.kind || slotID != hit->second.slotID) {
objects.erase(oit);
return CK_INVALID_HANDLE;
} else
return oit->second;
}
// Token objects are not associated with a specific session.
Handle h( CKH_OBJECT, slotID );
h.isPrivate = isPrivate;
h.object = object;
handles[++handleCounter] = h;
objects[object] = handleCounter;
return (CK_OBJECT_HANDLE)handleCounter;
}
CK_VOID_PTR HandleManager::getObject(const CK_OBJECT_HANDLE hObject)
{
MutexLocker lock(handlesMutex);
std::map< CK_ULONG, Handle>::iterator it = handles.find(hObject);
if (it == handles.end() || CKH_OBJECT != it->second.kind )
return NULL_PTR;
return it->second.object;
}
CK_OBJECT_HANDLE HandleManager::getObjectHandle(CK_VOID_PTR object)
{
MutexLocker lock(handlesMutex);
std::map< CK_VOID_PTR, CK_ULONG>::iterator it = objects.find(object);
if (it == objects.end())
return CK_INVALID_HANDLE;
return it->second;
}
void HandleManager::destroyObject(const CK_OBJECT_HANDLE hObject)
{
MutexLocker lock(handlesMutex);
std::map< CK_ULONG, Handle>::iterator it = handles.find(hObject);
if (it != handles.end() && CKH_OBJECT == it->second.kind) {
objects.erase(it->second.object);
handles.erase(it);
}
}
void HandleManager::sessionClosed(const CK_SESSION_HANDLE hSession)
{
CK_SLOT_ID slotID;
{
MutexLocker lock(handlesMutex);
std::map< CK_ULONG, Handle>::iterator it = handles.find(hSession);
if (it == handles.end() || CKH_SESSION != it->second.kind)
return; // Unable to find the specified session.
slotID = it->second.slotID;
// session closed, so we can erase information about it.
handles.erase(it);
// Erase all session object handles associated with the given session handle.
CK_ULONG openSessionCount = 0;
for (it = handles.begin(); it != handles.end(); ) {
Handle &h = it->second;
if (CKH_SESSION == h.kind && slotID == h.slotID) {
++openSessionCount; // another session is open for this slotID.
} else {
if (CKH_OBJECT == h.kind && hSession == h.hSession) {
// A session object is present for the given session, so erase it.
objects.erase(it->second.object);
// Iterator post-incrementing (it++) will return a copy of the original it (which points to handle to be deleted).
handles.erase(it++);
continue;
}
}
++it;
}
// We are done when there are still sessions open.
if (openSessionCount)
return;
}
// No more sessions open for this token, so remove all object handles that are still valid for the given slotID.
allSessionsClosed(slotID);
}
void HandleManager::allSessionsClosed(const CK_SLOT_ID slotID)
{
MutexLocker lock(handlesMutex);
// Erase all "session", "session object" and "token object" handles for a given slot id.
std::map< CK_ULONG, Handle>::iterator it;
for (it = handles.begin(); it != handles.end(); ) {
Handle &h = it->second;
if (slotID == h.slotID) {
if (CKH_OBJECT == it->second.kind)
objects.erase(it->second.object);
// Iterator post-incrementing (it++) will return a copy of the original it (which points to handle to be deleted).
handles.erase(it++);
continue;
}
++it;
}
}
void HandleManager::tokenLoggedOut(const CK_SLOT_ID slotID)
{
MutexLocker lock(handlesMutex);
// Erase all private "token object" or "session object" handles for a given slot id.
std::map< CK_ULONG, Handle>::iterator it;
for (it = handles.begin(); it != handles.end(); ) {
Handle &h = it->second;
if (CKH_OBJECT == h.kind && slotID == h.slotID && h.isPrivate) {
// A private object is present for the given slotID so we need to remove it.
objects.erase(it->second.object);
// Iterator post-incrementing (it++) will return a copy of the original it (which points to handle to be deleted).
handles.erase(it++);
continue;
}
++it;
}
}
|