blob: 57c4ef58b55dd93c539a5b323909805155673425 (
plain) (
blame)
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
|
//
// Created by stefan on 18.06.20.
//
#include "slotmap.h"
#include <stdio.h>
smHeader smInit(smEntry * slab, size_t size) {
for (int i = 0; i < size; ++i) {
slab[i].value = (intptr_t)NULL;
}
return (smHeader){.slab = slab, .size=size};
}
int smInsert(smHeader const * header, void * value) {
for (size_t i = 0; i< header->size; ++i ) {
intptr_t ptr = atomic_load(&header->slab[i].value);
if((void *)ptr == NULL) {
intptr_t expected = (intptr_t) NULL;
if(atomic_compare_exchange_strong(&header->slab[i].value, &expected, (intptr_t) value)){
return 0;
}
}
}
return -1;
}
void smDelete(smEntry * node) {
intptr_t oldval = atomic_exchange(&node->value, (intptr_t)(NULL));
if((void *) oldval == NULL) {
fprintf(stderr, "A Node has been double deleted");
}
}
void smDeleteValue(smHeader const * header, void * value){
for (size_t i = 0; i< header->size; ++i ) {
intptr_t ptr = atomic_load(&header->slab[i].value);
if((void *)ptr == value) {
smDelete(&header->slab[i]);
}
}
}
smEntry *smFindEntry(smHeader const * header, SearchFunction func){
for (size_t i = 0; i< header->size; ++i ) {
void * value = (void *) atomic_load(&header->slab[i].value);
if(value != NULL && func(value)) {
return &header->slab[i];
}
}
return NULL;
}
|
