blob: 304209ce8b858d1f6f37596fcd5d984e6ba3fa27 (
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
49
50
51
52
53
54
55
56
57
|
//
// Created by stefan on 10.06.20.
//
#ifndef BETRIEBSYSTEME_ARENA_LIST_H
#define BETRIEBSYSTEME_ARENA_LIST_H
#include <stdlib.h>
#include <stdbool.h>
#include <stdatomic.h>
typedef struct Node {
void * value;
struct Node * next;
struct Node * prev;
} Node;
typedef struct List {
Node * first;
Node * last;
} List;
// Should we have a free list or just a bit set relative to the size of the slab?
/** This structure manages an arena / memory slab to be used
* This structure is thread-safe as it locks internally
* It will spin until a request is safe to access the items
* This also means this structure shouldn't be read externally
* unless the thread doing so managed to aquire the atomic_flag
*/
typedef struct ArenaList {
List freeList;
List activeList;
Node * arena;
size_t size;
atomic_char lock;
} AtomicArenaList;
typedef bool (*SearchFunction)(void const *);
//Initializes the node array
AtomicArenaList alInit(Node * arena, size_t size);
// Return -1 if the List is full
int alPush(AtomicArenaList * al, void * value);
// Return -1 if the Node was already deleted
int alRemoveElem(AtomicArenaList * al, void * value);
/**
* Searches the activeList for an element
* for which the search function returns true
* The function will be passed the value pointer
* of a given Node
* @return the Element pointed or NULL if nothing matched
*/
void *alFindLastElem(AtomicArenaList *al, SearchFunction f);
#endif // BETRIEBSYSTEME_ARENA_LIST_H
|
