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
|
/*
* secde -- experimental lightweight Wayland/X11 server
* Copyright (C) 2019 Samuel Lidén Borell
*
* This program 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, either version 3 of the License, or
* (at your option) any later version.
*
* 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.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef MISC_H
#define MISC_H
#include <stdlib.h>
#define _map_getmask(map) ((1 << ((map).hashbits)) -1)
#define _map_getbucket(map,key) ((map).buckets[key & _map_getmask(map)])
#define map_init(map) do { \
(map).hashbits = 4; \
(map).count = 0; \
(map).buckets = calloc(16, sizeof(*(map).buckets)); \
} while (0)
#define map_add(map,key,T,result) do { \
int thekey = (key); \
T **entry; \
T *resultval; \
int mask = _map_getmask(map); \
if ((map).count > mask) { \
/* Enlarge map */ \
/* TODO */ \
} \
entry = &_map_getbucket(map, thekey); \
(map).count++; \
while (*entry && (*entry)->fd < thekey) { \
entry = &(*entry)->next; \
} \
resultval = malloc(sizeof(T)); \
resultval->fd = thekey; \
*entry = resultval; \
(result) = resultval; \
} while (0)
#define map_remove(map,key,T) do { \
int thekey = (key); \
T **entry = &_map_getbucket(map, thekey); \
while (*entry && (*entry)->fd < thekey) { \
entry = &(*entry)->next; \
} \
if (*entry && (*entry)->fd == thekey) { \
T *remove = *entry; \
*entry = remove->next; \
free(remove); \
} \
} while (0)
#define map_get(map,key,T,result) do { \
int thekey = (key); \
T *entry = _map_getbucket(map, thekey); \
for (;;) { \
if (!entry) { \
(result) = NULL; \
break; \
} else if (entry->fd < thekey) { \
entry = entry->next; \
continue; \
} else if (entry->fd == thekey) { \
(result) = entry; \
} else { \
(result) = NULL; \
} \
break; \
} \
} while (0)
#endif
|
