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
|
// Copyright (C) 2015-2020 Cherokees of Idaho.
//
// This file is part of GNU uCommon C++.
//
// GNU uCommon C++ 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, either version 3 of the License, or
// (at your option) any later version.
//
// GNU uCommon C++ 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 GNU uCommon C++. If not, see <http://www.gnu.org/licenses/>.
#include <ucommon-config.h>
#include <ucommon/export.h>
#include <ucommon/typeref.h>
#include <ucommon/string.h>
#include <ucommon/thread.h>
#include <ucommon/shared.h>
#include <cstdlib>
namespace ucommon {
SharedRef::SharedRef() : TypeRef()
{
}
TypeRef SharedRef::get()
{
lock.acquire();
TypeRef ptr(ref);
lock.release();
return ptr;
}
void SharedRef::get(TypeRef& ptr)
{
lock.acquire();
Counted *old = ref;
ref = ptr.ref;
if(ref)
ref->retain();
lock.release();
if(old)
old->release();
}
void SharedRef::put(TypeRef& ptr)
{
lock.acquire();
ptr.ref = ref;
lock.release();
}
MappedPointer::Index::Index(LinkedObject **origin) :
LinkedObject(origin)
{
key = value = NULL;
}
MappedPointer::MappedPointer(size_t indexes, condlock_t *locking, size_t paging) : pager(paging)
{
caddr_t p;
if(!locking) {
p = (caddr_t)pager.alloc(sizeof(condlock_t));
locking = new(p) condlock_t;
}
lock = locking;
list = (LinkedObject **)pager.alloc(sizeof(LinkedObject *) * indexes);
free = NULL;
paths = 0;
while(paths < indexes)
list[paths++] = NULL;
}
MappedPointer::~MappedPointer()
{
pager.purge();
}
LinkedObject *MappedPointer::access(size_t path)
{
lock->access();
return list[path % paths];
}
LinkedObject *MappedPointer::modify(size_t path)
{
lock->modify();
return list[path % paths];
}
void MappedPointer::release(void *object)
{
if(object != nullptr)
lock->release();
}
void MappedPointer::replace(Index *ind, void *object)
{
ind->value = object;
lock->commit();
}
void MappedPointer::remove(Index *ind, size_t path)
{
LinkedObject **root = &list[path % paths];
ind->delist(root);
ind->enlist(&free);
ind->key = ind->value = NULL;
lock->commit();
}
void MappedPointer::insert(const void *key, void *value, size_t path)
{
caddr_t p = (caddr_t)(free);
if(free)
free = free->getNext();
else
p = (caddr_t)pager.alloc(sizeof(Index));
Index *ind = new(p) Index(&list[path % paths]);
ind->key = key;
ind->value = value;
lock->commit();
}
size_t MappedPointer::keypath(const uint8_t *addr, size_t size)
{
size_t value = size;
while(size--) {
value = (value << 3) ^ *(addr++);
}
return value;
}
} // namespace
|
