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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
|
/**
* mds — A micro-display server
* Copyright © 2014 Mattias Andrée (maandree@member.fsf.org)
*
* 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 <http://www.gnu.org/licenses/>.
*/
#ifndef MDS_LIBMDSSERVER_MACROS_H
#define MDS_LIBMDSSERVER_MACROS_H
#include "config.h"
#include "macro-bits.h"
#include <stdio.h>
#include <errno.h>
#include <signal.h>
/*
#include <unistd.h>
#include <pthread.h>
#include <string.h>
#include <time.h>
#include <sys/types.h>
#include <dirent.h>
#include <stdlib.h>
*/
/**
* Wrapper for `snprintf` that allows you to forget about the buffer size
*
* @param buffer:char[] The buffer, must be of the type `char[]` and not `char*`
* @param format:char* The format
* @param ... The arguments
*/
#define xsnprintf(buffer, format, ...) \
snprintf(buffer, sizeof(buffer) / sizeof(char), format, __VA_ARGS__)
/**
* Wrapper for `fprintf` that prints to `stderr` with
* the program name prefixed and new line suffixed
*
* @param format:char* The format
*/
#define eprint(format) \
fprintf(stderr, "%s: " format "\n", *argv)
/**
* Wrapper for `fprintf` that prints to `stderr` with
* the program name prefixed and new line suffixed
*
* @param format:char* The format
* @param ... The arguments
*/
#define eprintf(format, ...) \
fprintf(stderr, "%s: " format "\n", *argv, __VA_ARGS__)
/**
* Wrapper for `pthread_mutex_lock` and `pthread_mutex_unlock`
*
* @param mutex:pthread_mutex_t The mutex
* @param instructions The instructions to run while the mutex is locked
*/
#define with_mutex(mutex, instructions) \
errno = pthread_mutex_lock(&(mutex)); \
instructions \
errno = pthread_mutex_unlock(&(mutex))
/**
* Wrapper for `pthread_mutex_lock` and `pthread_mutex_unlock` with an embedded if-statement
*
* @param mutex:pthread_mutex_t The mutex
* @parma condition The condition to test
* @param instructions The instructions to run while the mutex is locked
*/
#define with_mutex_if(mutex, condition, instructions) \
errno = pthread_mutex_lock(&(mutex)); \
if (condition) \
{ \
instructions \
} \
errno = pthread_mutex_unlock(&(mutex))
/**
* Return the maximum value of two values
*
* @param a One of the values
* @param b The other one of the values
* @return The maximum value
*/
#define max(a, b) \
(a < b ? b : a)
/**
* Return the minimum value of two values
*
* @param a One of the values
* @param b The other one of the values
* @return The minimum value
*/
#define min(a, b) \
(a < b ? a : b)
/**
* Cast a buffer to another type and get the slot for an element
*
* @param buffer:char* The buffer
* @param type The data type of the elements for the data type to cast the buffer to
* @param index:size_t The index of the element to address
* @return [type] A slot that can be set or get
*/
#define buf_cast(buffer, type, index) \
((type*)(buffer))[index]
/**
* Set the value of an element a buffer that is being cast
*
* @param buffer:char* The buffer
* @param type The data type of the elements for the data type to cast the buffer to
* @param index:size_t The index of the element to address
* @param variable:type The new value of the element
* @return :variable The new value of the element
*/
#define buf_set(buffer, type, index, variable) \
((type*)(buffer))[index] = (variable)
/**
* Get the value of an element a buffer that is being cast
*
* @param buffer:char* The buffer
* @param type The data type of the elements for the data type to cast the buffer to
* @param index:size_t The index of the element to address
* @param variable:type Slot to set with the value of the element
* @return :variable The value of the element
*/
#define buf_get(buffer, type, index, variable) \
variable = ((type*)(buffer))[index]
/**
* Increase the pointer of a buffer
*
* @param buffer:char* The buffer
* @param type A data type
* @param count The number elements of the data type `type` to increase the pointer with
*/
#define buf_next(buffer, type, count) \
buffer += (count) * sizeof(type) / sizeof(char)
/**
* Decrease the pointer of a buffer
*
* @param buffer:char* The buffer
* @param type A data type
* @param count The number elements of the data type `type` to decrease the pointer with
*/
#define buf_prev(buffer, type, count) \
buffer -= (count) * sizeof(type) / sizeof(char)
/**
* This macro combines `buf_set` with `buf_next`, it sets
* element zero and increase the pointer by one element
*
* @param buffer:char* The buffer
* @param type The data type of the elements for the data type to cast the buffer to
* @param variable:type The new value of the element
* @return :variable The new value of the element
*/
#define buf_set_next(buffer, type, variable) \
buf_set(buffer, type, 0, variable); \
buf_next(buffer, type, 1)
/**
* This macro combines `buf_set` with `buf_next`, it sets
* element zero and increase the pointer by one element
*
* @param buffer:char* The buffer
* @param type The data type of the elements for the data type to cast the buffer to
* @param variable:type Slot to set with the value of the element
* @return :variable The value of the element
*/
#define buf_get_next(buffer, type, variable) \
buf_get(buffer, type, 0, variable); \
buf_next(buffer, type, 1)
/**
* Check whether two strings are equal
*
* @param a:char* One of the strings
* @param b:char* The other of the strings
* @return :int Whether the strings are equal
*/
#define strequals(a, b) \
(strcmp(a, b) == 0)
/**
* Check whether a string starts with another string
*
* @param haystack:char* The string to inspect
* @param needle:char* The string `haystack` should start with
* @return :int Whether `haystack` starts with `needle`
*/
#define startswith(haystack, needle) \
(strstr(haystack, needle) == haystack)
/**
* Set effective user and the effective group to the
* real user and the real group, respectively. If the
* group cannot be set, the user till not be set either.
*
* @return :int Non-zero on error
*/
#define drop_privileges() \
((getegid() == getgid() ? 0 : setegid(getgid())) || \
(geteuid() == getuid() ? 0 : seteuid(getuid())))
/**
* Wrapper for `clock_gettime` that gets some kind of
* monotonic time, the exact clock ID is not specified
*
* @param time_slot:struct timespec* Pointer to the variable in which to store the time
* @return :int Zero on sucess, -1 on error
*/
#define monotone(time_slot) \
clock_gettime(CLOCK_MONOTONIC_RAW, time_slot)
/**
* Close all file descriptors that satisfies a condition
*
* @param condition The condition, it should evaluate the variable `fd`
*/
#define close_files(condition) \
{ \
DIR* dir = opendir(SELF_FD); \
struct dirent* file; \
\
if (dir == NULL) \
perror(*argv); /* Well, that is just unfortunate, but we cannot really do anything. */ \
else \
while ((file = readdir(dir)) != NULL) \
if (strcmp(file->d_name, ".") && strcmp(file->d_name, "..")) \
{ \
int fd = atoi(file->d_name); \
if (condition) \
close(fd); \
} \
\
closedir(dir); \
}
/**
* Free an array and all elements in an array
*
* @param array:¿V?* The array to free
* @param elements:size_t The number of elements, in the array, to free
* @scope i:size_t The variable `i` must be declared as `size_t` and avaiable for use
*/
#define xfree(array, elements) \
for (i = 0; i < elements; i++) \
free((array)[i]); \
free(array)
/**
* `malloc` wrapper that returns whether the allocation was not successful
*
* @param var The variable to which to assign the allocation
* @param elements The number of elements to allocate
* @param type The data type of the elements for which to create an allocation
* @return :int Evaluates to true if an only if the allocation failed
*/
#define xmalloc(var, elements, type) \
((var = malloc((elements) * sizeof(type))) == NULL)
/**
* `calloc` wrapper that returns whether the allocation was not successful
*
* @param var The variable to which to assign the allocation
* @param elements The number of elements to allocate
* @param type The data type of the elements for which to create an allocation
* @return :int Evaluates to true if an only if the allocation failed
*/
#define xcalloc(var, elements, type) \
((var = calloc(elements, sizeof(type))) == NULL)
/**
* `remalloc` wrapper that returns whether the allocation was not successful
*
* @param var The variable to which to assign the reallocation
* @param elements The number of elements to allocate
* @param type The data type of the elements for which to create an allocation
* @return :int Evaluates to true if an only if the allocation failed
*/
#define xrealloc(var, elements, type) \
((var = realloc(var, (elements) * sizeof(type))) == NULL)
/**
* Double to the size of an allocation on the heap
*
* @param old Variable in which to store the old value temporarily
* @param var The variable to which to assign the reallocation
* @param elements The number of elements to allocate
* @param type The data type of the elements for which to create an allocation
* @return :int Evaluates to true if an only if the allocation failed
*/
#define growalloc(old, var, elements, type) \
(old = var, xrealloc(var, (elements) <<= 1, type) ? (var = old, (elements) >>= 1, perror(*argv), 1) : 0)
/**
* Call `perror` if `errno` is non-zero and set `errno` to zero
*
* @param str:const char* The argument passed to `perror`
*/
#define xperror(str) \
(errno ? perror(str), errno = 0 : 0)
/**
* Go to the label `pfail` if a condition is met
*
* @param CONDITION The condition
*/
#define fail_if(CONDITION) if (CONDITION) goto pfail
/**
* Run a set of instructions and return 1 if a condition is met
*
* @param CONDITION The condition
* @param INSTRUCTIONS The instruction (semicolon-terminated)
*/
#define exit_if(CONDITION, INSTRUCTIONS) if (CONDITION) { INSTRUCTIONS return 1; }
/**
* The system is running out of memory.
* Quick, free up all your unused memory or kill yourself!
*/
#ifndef SIGDANGER
# define SIGDANGER SIGRTMAX
#endif
#endif
|