nortti
/
cmaybe
1
1
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Let's not go trespassing in reserved namespace

This commit is contained in:
Juhani Krekelä 2018-08-11 20:45:28 +03:00
parent 034ee8c3ef
commit a13a5a75b2
1 changed files with 39 additions and 39 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

78
cmaybe.h
View File

@ -1,69 +1,69 @@
#ifndef __CMAYBE_H__ #ifndef CMAYBE_H
#define __CMAYBE_H__ #define CMAYBE_H
#define MAYBE_TYPE(name, type) struct maybe_##name {type value; char is_value;} #define MAYBE_TYPE(name, type) struct maybe_##name {type value; char is_value;}
#define MAYBE(name) struct maybe_##name #define MAYBE(name) struct maybe_##name
#define ENABLE_RETURN(name) MAYBE(name) __return_value #define ENABLE_RETURN(name) MAYBE(name) _return_value
#define RETURN_VALUE(x) {\ #define RETURN_VALUE(x) {\
__return_value.is_value = 1;\ _return_value.is_value = 1;\
__return_value.value = x;\ _return_value.value = x;\
return __return_value;\ return _return_value;\
} }
#define RETURN_NOTHING() {\ #define RETURN_NOTHING() {\
__return_value.is_value = 0;\ _return_value.is_value = 0;\
return __return_value;\ return _return_value;\
} }
#define IS_VALUE(x) if ((x).is_value) #define IS_VALUE(x) if ((x).is_value)
#define IS_NOT_VALUE(x) if (!(x).is_value) #define IS_NOT_VALUE(x) if (!(x).is_value)
#define VALUE(x) (x).value #define VALUE(x) (x).value
struct __free_list { struct _free_list {
struct __free_list *next; struct _free_list *next;
void *ptr; void *ptr;
void (*freer)(void*); void (*freer)(void*);
}; };
#define ENABLE_TRY() \ #define ENABLE_TRY() \
struct __free_list *__allocations = NULL, *__free_list_node;\ struct _free_list *_allocations = NULL, *_free_list_node;\
void *__allocation;\ void *_allocation;\
jmp_buf __try_fail_jmp_buf;\ jmp_buf _try_fail_jmp_buf;\
if (setjmp(__try_fail_jmp_buf)) {\ if (setjmp(_try_fail_jmp_buf)) {\
TRY_FAIL_HANDLE();\ TRY_FAIL_HANDLE();\
RETURN_NOTHING();\ RETURN_NOTHING();\
} }
#define TRY_TYPE(name) MAYBE(name) __try_tmp_##name #define TRY_TYPE(name) MAYBE(name) _try_tmp_##name
#define TRY(name, maybe_value) (\ #define TRY(name, maybe_value) (\
__try_tmp_##name = maybe_value,\ _try_tmp_##name = maybe_value,\
(__try_tmp_##name.is_value ? 0 :\ (_try_tmp_##name.is_value ? 0 :\
longjmp(__try_fail_jmp_buf, 1)\ longjmp(_try_fail_jmp_buf, 1)\
),\ ),\
__try_tmp_##name.value\ _try_tmp_##name.value\
) )
#define TRY_HOF_HANDLE(freer_func, pointer) (\ #define TRY_HOF_HANDLE(freer_func, pointer) (\
__allocation = pointer,\ _allocation = pointer,\
__free_list_node = malloc(sizeof(struct __free_list)),\ _free_list_node = malloc(sizeof(struct _free_list)),\
(__free_list_node == NULL ? (\ (_free_list_node == NULL ? (\
free(__allocation),\ free(_allocation),\
longjmp(__try_fail_jmp_buf, 1)\ longjmp(_try_fail_jmp_buf, 1)\
) : (\ ) : (\
__free_list_node->next = __allocations,\ _free_list_node->next = _allocations,\
__free_list_node->ptr = __allocation,\ _free_list_node->ptr = _allocation,\
__free_list_node->freer = freer_func,\ _free_list_node->freer = freer_func,\
__allocations = __free_list_node\ _allocations = _free_list_node\
)),\ )),\
__allocation\ _allocation\
) )
#define FREE_ON_TRY_FAIL(pointer) TRY_HOF_HANDLE(free, pointer) #define FREE_ON_TRY_FAIL(pointer) TRY_HOF_HANDLE(free, pointer)
// free() is passed as an argument to avoid errors in case the program uses // free() is passed as an argument to avoid errors in case the program uses
// no TRY functionality and doesn't include stdlib.h // no TRY functionality and doesn't include stdlib.h
static void __remove_free_list(struct __free_list **head, void *ptr, void (*free)(void*)) { static void _remove_free_list(struct _free_list **head, void *ptr, void (*free)(void*)) {
struct __free_list **current = head; struct _free_list **current = head;
while (*current != NULL) { while (*current != NULL) {
if (current[0]->ptr == ptr) { if (current[0]->ptr == ptr) {
struct __free_list *deleted = *current; struct _free_list *deleted = *current;
*current = deleted->next; *current = deleted->next;
free(deleted); free(deleted);
break; break;
@ -72,18 +72,18 @@ static void __remove_free_list(struct __free_list **head, void *ptr, void (*free
} }
} }
#define TRY_HOF_REMOVE(allocation) __remove_free_list(&__allocations, allocation, free) #define TRY_HOF_REMOVE(allocation) _remove_free_list(&_allocations, allocation, free)
#define TRY_FAIL_HANDLE() \ #define TRY_FAIL_HANDLE() \
while (__allocations != NULL) {\ while (_allocations != NULL) {\
struct __free_list *current = __allocations;\ struct _free_list *current = _allocations;\
void (*freer)(void*) = current->freer;\ void (*freer)(void*) = current->freer;\
freer(current->ptr);\ freer(current->ptr);\
__allocations = current->next;\ _allocations = current->next;\
free(current);\ free(current);\
} }
static void __replace_free_list(struct __free_list **head, void *from, void *to) { static void _replace_free_list(struct _free_list **head, void *from, void *to) {
struct __free_list **current = head; struct _free_list **current = head;
while (*current != NULL) { while (*current != NULL) {
if (current[0]->ptr == from) { if (current[0]->ptr == from) {
current[0]->ptr = to; current[0]->ptr = to;
@ -92,6 +92,6 @@ static void __replace_free_list(struct __free_list **head, void *from, void *to)
current = &current[0]->next; current = &current[0]->next;
} }
} }
#define TRY_HOF_REPLACE(old_ptr, new_ptr) __replace_free_list(&__allocations, old_ptr, new_ptr) #define TRY_HOF_REPLACE(old_ptr, new_ptr) _replace_free_list(&_allocations, old_ptr, new_ptr)
#endif #endif