forked from LPD-EPFL/ASCYLIB
-
Notifications
You must be signed in to change notification settings - Fork 0
/
intset.c
140 lines (122 loc) · 2.94 KB
/
intset.c
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
/*
* File: intset.c
* Author: Vincent Gramoli <[email protected]>,
* Vasileios Trigonakis <[email protected]>
* Description:
* intset.c is part of ASCYLIB
*
* Copyright (c) 2014 Vasileios Trigonakis <[email protected]>,
* Tudor David <[email protected]>
* Distributed Programming Lab (LPD), EPFL
*
* ASCYLIB is free software: you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation, version 2
* of the License.
*
* This program 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 General Public License for more details.
*
*/
#include "intset.h"
#define MAXLEVEL 32
sval_t
sl_contains(sl_intset_t *set, skey_t key)
{
sval_t result = 0;
#ifdef SEQUENTIAL /* Unprotected */
int i;
sl_node_t *node, *next;
node = set->head;
for (i = node->toplevel-1; i >= 0; i--)
{
next = node->next[i];
while (next->key < key)
{
node = next;
next = node->next[i];
}
}
node = node->next[0];
result = (node->key == key);
#elif defined LOCKFREE /* fraser lock-free */
result = fraser_find(set, key);
#endif
return result;
}
inline int
sl_seq_add(sl_intset_t *set, skey_t key, sval_t val)
{
int i, l, result;
sl_node_t *node, *next;
sl_node_t *preds[MAXLEVEL], *succs[MAXLEVEL];
node = set->head;
for (i = node->toplevel-1; i >= 0; i--)
{
next = node->next[i];
while (next->key < key)
{
node = next;
next = node->next[i];
}
preds[i] = node;
succs[i] = node->next[i];
}
node = node->next[0];
if ((result = (node->key != key)) == 1)
{
l = get_rand_level();
node = sl_new_simple_node(key, val, l, 1);
for (i = 0; i < l; i++)
{
node->next[i] = succs[i];
preds[i]->next[i] = node;
}
}
return result;
}
int
sl_add(sl_intset_t *set, skey_t key, sval_t val)
{
int result = 0;
#ifdef SEQUENTIAL
result = sl_seq_add(set, key, val);
#elif defined LOCKFREE /* fraser lock-free */
result = fraser_insert(set, key, val);
#endif
return result;
}
sval_t
sl_remove(sl_intset_t *set, skey_t key)
{
sval_t result = 0;
#ifdef SEQUENTIAL
int i;
sl_node_t *node, *next = NULL;
sl_node_t *preds[MAXLEVEL], *succs[MAXLEVEL];
node = set->head;
for (i = node->toplevel-1; i >= 0; i--)
{
next = node->next[i];
while (next->key < key)
{
node = next;
next = node->next[i];
}
preds[i] = node;
succs[i] = node->next[i];
}
if ((result = (next->key == key)) == 1)
{
for (i = 0; i < set->head->toplevel; i++)
if (succs[i]->key == key)
preds[i]->next[i] = succs[i]->next[i];
sl_delete_node(next);
}
#elif defined LOCKFREE
result = fraser_remove(set, key);
#endif
return result;
}