diff options
| author | Vsevolod Stakhov <vsevolod@highsecure.ru> | 2019-07-11 13:04:28 +0100 |
|---|---|---|
| committer | Vsevolod Stakhov <vsevolod@highsecure.ru> | 2019-07-12 15:18:17 +0100 |
| commit | c71485f1d8f2d173b23cbbdc9bfb3e022672a368 (patch) | |
| tree | 7107fb0d92f41c8f089ce19480417b3f222b4068 /contrib/uthash/utlist.h | |
| parent | 9aa104f6a709198527538c6553a0a96db1ecc5e9 (diff) | |
| download | rspamd-c71485f1d8f2d173b23cbbdc9bfb3e022672a368.tar.gz rspamd-c71485f1d8f2d173b23cbbdc9bfb3e022672a368.zip | |
[Project] Further rework of mime headers processing
Diffstat (limited to 'contrib/uthash/utlist.h')
| -rw-r--r-- | contrib/uthash/utlist.h | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/contrib/uthash/utlist.h b/contrib/uthash/utlist.h index c82dd916e..e4d9a4c23 100644 --- a/contrib/uthash/utlist.h +++ b/contrib/uthash/utlist.h @@ -28,7 +28,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include <assert.h> -/* +/* * This file contains macros to manipulate singly and doubly-linked lists. * * 1. LL_ macros: singly-linked lists. @@ -38,7 +38,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * To use singly-linked lists, your structure must have a "next" pointer. * To use doubly-linked lists, your structure must "prev" and "next" pointers. * Either way, the pointer to the head of the list must be initialized to NULL. - * + * * ----------------.EXAMPLE ------------------------- * struct item { * int id; @@ -88,7 +88,7 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #define _PREVASGN(elt,list,to,prev) { char **_alias = (char**)&((list)->prev); *_alias=(char*)(to); } #define _RS(list) { char **_alias = (char**)&(list); *_alias=_tmp; } #define _CASTASGN(a,b) { char **_alias = (char**)&(a); *_alias=(char*)(b); } -#else +#else #define _SV(elt,list) #define _NEXT(elt,list,next) ((elt)->next) #define _NEXTASGN(elt,list,to,next) ((elt)->next)=(to) @@ -312,7 +312,7 @@ do { #define LL_PREPEND2(head,add,next) \ do { \ (add)->next = head; \ - head = add; \ + (head) = (add); \ } while (0) #define LL_CONCAT(head1,head2) \ @@ -445,7 +445,7 @@ do { LL_FOREACH2(head,out,next) { \ if ((out)->field == (val)) break; \ } \ -} while(0) +} while(0) #define LL_SEARCH(head,out,elt,cmp) \ LL_SEARCH2(head,out,elt,cmp,next) @@ -455,7 +455,7 @@ do { LL_FOREACH2(head,out,next) { \ if ((cmp(out,elt))==0) break; \ } \ -} while(0) +} while(0) #define LL_REPLACE_ELEM(head, el, add) \ do { \ @@ -531,7 +531,7 @@ do { (head)->prev = (head); \ (head)->next = NULL; \ } \ -} while (0) +} while (0) #define DL_CONCAT(head1,head2) \ DL_CONCAT2(head1,head2,prev,next) @@ -549,7 +549,7 @@ do { (head1)=(head2); \ } \ } \ -} while (0) +} while (0) #define DL_DELETE(head,del) \ DL_DELETE2(head,del,prev,next) @@ -570,7 +570,7 @@ do { (head)->prev = (del)->prev; \ } \ } \ -} while (0) +} while (0) #define DL_COUNT(head,el,counter) \ DL_COUNT2(head,el,counter,next) \ @@ -674,7 +674,7 @@ do { (del)->prev->next = (del)->next; \ if ((del) == (head)) (head)=(del)->next; \ } \ -} while (0) +} while (0) #define CDL_COUNT(head,el,counter) \ CDL_COUNT2(head,el,counter,next) \ @@ -689,7 +689,7 @@ do { CDL_FOREACH2(head,el,next) #define CDL_FOREACH2(head,el,next) \ - for(el=head;el;el=((el)->next==head ? 0L : (el)->next)) + for(el=head;el;el=((el)->next==head ? 0L : (el)->next)) #define CDL_FOREACH_SAFE(head,el,tmp1,tmp2) \ CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next) @@ -707,7 +707,7 @@ do { CDL_FOREACH2(head,out,next) { \ if ((out)->field == (val)) break; \ } \ -} while(0) +} while(0) #define CDL_SEARCH(head,out,elt,cmp) \ CDL_SEARCH2(head,out,elt,cmp,next) @@ -717,7 +717,7 @@ do { CDL_FOREACH2(head,out,next) { \ if ((cmp(out,elt))==0) break; \ } \ -} while(0) +} while(0) #define CDL_REPLACE_ELEM(head, el, add) \ do { \ |