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 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448
|
/* ***** BEGIN COPYRIGHT BLOCK *****
* Copyright (C) 2005 Red Hat, Inc.
* All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation version
* 2.1 of the License.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
* ***** END COPYRIGHT BLOCK *****/
#include "machdep.h"
#include "mypkcs11.h"
#include "PKCS11Exception.h"
#ifdef _WIN32
#include <windows.h>
#include <memory.h>
#else
#include <unistd.h>
#include <errno.h>
#include <fcntl.h>
#include <sys/file.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <pthread.h>
#endif
#ifdef _WIN32
//
// Windows functions to grab a named shared memory segment of a specific size,
// return whether or not it has been initialized, return it's size and address,
// release it when done.
//
struct SHMemData {
char *addr;
HANDLE map;
int size;
SHMemData() : addr(0), map(0), size(0) {}
};
SHMem::SHMem(): shmemData(0) {}
SHMem *
SHMem::initSegment(const char *name, int size, bool &init)
{
bool needInit;
init = 0;
SHMemData *shmemData = new SHMemData;
if (!shmemData ) {
// applications know we failed because they will get a NULL address
// from getSHMemAddr.
return NULL;
}
shmemData->map = CreateFileMapping(INVALID_HANDLE_VALUE, NULL,
PAGE_READWRITE, 0, size, name);
if (!shmemData->map) {
delete shmemData;
return NULL;
}
needInit = (GetLastError() != ERROR_ALREADY_EXISTS);
shmemData->addr =
(char *)MapViewOfFile(shmemData->map, FILE_MAP_WRITE, 0, 0, 0 );
if (!shmemData->addr) {
CloseHandle(shmemData->map);
delete shmemData;
return NULL;
}
shmemData->size = size;
init = needInit;
SHMem *memseg;
memseg = new SHMem();
if (memseg) {
memseg->shmemData = shmemData;
}
return memseg;
}
SHMem::~SHMem()
{
if (!shmemData) {
return;
}
if (shmemData->addr) {
UnmapViewOfFile(shmemData->addr);
}
if (shmemData->map) {
CloseHandle(shmemData->map);
}
delete shmemData;
}
char *
SHMem::getSHMemAddr()
{
return shmemData ? shmemData->addr : NULL;
}
int
SHMem::getSHMemSize()
{
return shmemData ? shmemData->size : 0;
}
struct OSLockData {
CRITICAL_SECTION mutex;
};
OSLock::OSLock(bool exceptionAllowed)
{
lockData = new OSLockData;
if (lockData) {
InitializeCriticalSection(&lockData->mutex);
}
if (exceptionAllowed && !lockData) {
throw PKCS11Exception(CKR_HOST_MEMORY, "lock allocation failed");
}
}
OSLock::~OSLock()
{
if (lockData) {
DeleteCriticalSection(&lockData->mutex);
delete lockData;
}
}
bool OSLock::isValid()
{
return (bool) (lockData != NULL);
}
void OSLock::getLock()
{
if (lockData) {
EnterCriticalSection(&lockData->mutex);
}
}
void OSLock::releaseLock()
{
if (lockData) {
LeaveCriticalSection(&lockData->mutex);
}
}
OSTime OSTimeNow(void)
{
return GetTickCount();
}
void OSSleep(int time)
{
Sleep(time);
}
#else
//
// MAC/Unix functions to grab a named shared memory segment of a specific size,
// return whether or not it has been initialized, return it's size and address,
// release it when done.
//
#ifdef O_EXLOCK
#define FULL_CLEANUP
#else
/* if we can't lock on open, don't use locking for now */
#undef FULL_CLEANUP
#define O_EXLOCK 0
#endif
#ifndef MAP_INHERIT
#define MAP_INHERIT 0
#endif
#ifdef FULL_CLEANUP
#define RESERVED_OFFSET 256
#define MEMSEGPATH "/tmp/.pk11ipc"
#else
#define RESERVED_OFFSET 0
#define MEMSEGPATH "/tmp/.pk11ipc1"
#endif
struct SHMemData {
char *path;
char *addr;
int fd;
int size;
SHMemData() : path(0), addr(0), fd(-1), size(0) {}
~SHMemData() ;
};
SHMemData::~SHMemData() {
if (addr) {
/* memory adder implies the fd and path are valid as well */
#ifdef FULL_CLEANUP
flock(fd,LOCK_EX);
unsigned long ref = --(*(unsigned long *)addr);
#ifdef notdef
if (ref == 0) {
unlink(path);
}
#endif
flock(fd, LOCK_UN);
#endif
munmap(addr,size+RESERVED_OFFSET);
}
if (fd > 0) {
close(fd);
}
if (path) {
delete [] path;
}
}
SHMem::SHMem(): shmemData(0) {}
SHMem *
SHMem::initSegment(const char *name, int size, bool &init)
{
bool needInit = true;
/* big enough to hold a uid_t value in decimal */
/* decimal digits = ceiling(log10(uid_t_max)); */
/* log10(uid_t_max) = log256(uid_t_max)/log256(10); */
/* log256(uid_t_max) = sizeof(uid_t); */
/* log10(256) just greater than .41 */
/* so decimal_digits = (sizeof(uid_t)*100 +40)/41 */
#define UID_DIGITS (((sizeof(uid_t)*100)+40)/41)
char uid_str[UID_DIGITS+2]; /* 1 for '-', 1 for null */
init = 0;
SHMemData *shmemData = new SHMemData;
if (!shmemData ) {
// applications know we failed because they will get a NULL address
// from getSHMemAddr.
return NULL;
}
int mask = umask(0);
int ret = mkdir (MEMSEGPATH, 0777);
umask(mask);
if ((ret == -1) && (errno != EEXIST)) {
delete shmemData;
return NULL;
}
/* 1 for the '/', one for the '-' and one for the null */
shmemData->path = new char [sizeof(MEMSEGPATH)+strlen(name)+UID_DIGITS+3];
if (shmemData->path == NULL) {
delete shmemData;
return NULL;
}
memcpy(shmemData->path,MEMSEGPATH, sizeof(MEMSEGPATH));
shmemData->path[sizeof(MEMSEGPATH)-1] = '/';
strcpy(&shmemData->path[sizeof(MEMSEGPATH)],name);
int mode = 0777;
if (strcmp(name,"token_names") != 0) {
/* each user gets his own uid array */
sprintf(uid_str, "-%u",getuid());
strcat(shmemData->path,uid_str);
mode = 0700;
}
shmemData->fd = open(shmemData->path,
O_CREAT|O_RDWR|O_EXCL|O_APPEND|O_EXLOCK, mode);
if (shmemData->fd < 0) {
needInit = false;
shmemData->fd = open(shmemData->path,O_RDWR|O_EXLOCK, mode);
} else {
char *buf;
int len = size+RESERVED_OFFSET;
buf = (char *)calloc(1,len);
if (!buf) {
unlink(shmemData->path);
#ifdef FULL_CLEANUP
flock(shmemData->fd, LOCK_UN);
#endif
delete shmemData;
return NULL;
}
write(shmemData->fd,buf,len);
free(buf);
}
if (shmemData->fd < 0) {
delete shmemData;
return NULL;
}
shmemData->addr = (char *) mmap(0, size+RESERVED_OFFSET,
PROT_READ|PROT_WRITE, MAP_FILE|MAP_SHARED|MAP_INHERIT,
shmemData->fd, 0);
if (shmemData->addr == NULL) {
if (needInit) {
unlink(shmemData->path);
}
#ifdef FULL_CLEANUP
flock(shmemData->fd, LOCK_UN);
#endif
delete shmemData;
return NULL;
}
shmemData->size = size;
#ifdef FULL_CLEANUP
(*(unsigned long *)shmemData->addr)++;
flock(shmemData->fd, LOCK_UN);
#endif
init = needInit;
SHMem *memseg;
memseg = new SHMem();
if (!memseg) {
delete shmemData;
return NULL;
}
memseg->shmemData = shmemData;
return memseg;
}
SHMem::~SHMem()
{
if (!shmemData) {
return;
}
delete shmemData;
}
char *
SHMem::getSHMemAddr()
{
return shmemData ? shmemData->addr+RESERVED_OFFSET : NULL;
}
int
SHMem::getSHMemSize()
{
return shmemData ? shmemData->size : 0;
}
struct OSLockData {
pthread_mutex_t mutex;
};
static pthread_mutexattr_t OSLock_attr = {0};
static int OSLock_attr_init = 0;
OSLock::OSLock(bool exceptionAllowed)
{
int rc;
lockData = NULL;
#ifdef MAC
if (!OSLock_attr_init) {
rc = pthread_mutexattr_init(&OSLock_attr);
if (rc < 0) {
if (exceptionAllowed) {
throw PKCS11Exception(CKR_DEVICE_ERROR, "lock init failed");
} else {
return;
}
}
OSLock_attr_init = 1;
}
#endif
lockData = new OSLockData;
if (lockData) {
rc = pthread_mutex_init(&lockData->mutex, &OSLock_attr);
if (rc < 0) {
delete lockData;
lockData = NULL;
}
}
if (exceptionAllowed && !lockData) {
throw PKCS11Exception(CKR_HOST_MEMORY, "lock allocation failed");
}
}
OSLock::~OSLock()
{
if (lockData) {
pthread_mutex_destroy(&lockData->mutex);
delete lockData;
}
}
bool OSLock::isValid()
{
return (bool) (lockData != NULL);
}
void OSLock::getLock()
{
if (lockData) {
pthread_mutex_lock(&lockData->mutex);
}
}
void OSLock::releaseLock()
{
if (lockData) {
pthread_mutex_unlock(&lockData->mutex);
}
}
#ifdef USE_CLOCK
OSTime OSTimeNow(void)
{
OSTime ostime;
clock_t time;
#if CLOCKS_PER_SEC < 1000
ostime = time * (1000/CLOCKS_PER_SEC);
#else
ostime = time / (CLOCKS_PER_SEC/1000);
#endif
return ostime;
}
#else
OSTime OSTimeNow(void)
{
OSTime ostime;
struct timeval tv;
gettimeofday(&tv, NULL);
ostime = tv.tv_usec/1000 + tv.tv_sec*1000;
return ostime;
}
#endif
void OSSleep(int time)
{
usleep(time);
}
#endif /* _WINDOWS */
|