diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2019-04-17 07:17:24 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2019-04-17 07:21:24 +0300 |
| commit | e12c08e8d170b7ca40f204a5b0423c23a9fbc2c1 (patch) | |
| tree | 8cf3453d12edb177a218ef8009357518ec6cab6a /source/blender/blenlib/BLI_link_utils.h | |
| parent | b3dabc200a4b0399ec6b81f2ff2730d07b44fcaa (diff) | |
ClangFormat: apply to source, most of intern
Apply clang format as proposed in T53211.
For details on usage and instructions for migrating branches
without conflicts, see:
https://wiki.blender.org/wiki/Tools/ClangFormat
Diffstat (limited to 'source/blender/blenlib/BLI_link_utils.h')
| -rw-r--r-- | source/blender/blenlib/BLI_link_utils.h | 68 |
1 files changed, 38 insertions, 30 deletions
diff --git a/source/blender/blenlib/BLI_link_utils.h b/source/blender/blenlib/BLI_link_utils.h index 9048b4e4b4a..f37841e3192 100644 --- a/source/blender/blenlib/BLI_link_utils.h +++ b/source/blender/blenlib/BLI_link_utils.h @@ -25,39 +25,47 @@ * and a double linked list such as #ListBase isnt needed. */ -#define BLI_LINKS_PREPEND(list, link) { \ - CHECK_TYPE_PAIR(list, link); \ - (link)->next = list; \ - list = link; \ -} (void)0 +#define BLI_LINKS_PREPEND(list, link) \ + { \ + CHECK_TYPE_PAIR(list, link); \ + (link)->next = list; \ + list = link; \ + } \ + (void)0 /* Use for append (single linked list, storing the last element). */ -#define BLI_LINKS_APPEND(list, link) { \ - (link)->next = NULL; \ - if ((list)->first) { \ - (list)->last->next = link; \ - } \ - else { \ - (list)->first = link; \ - } \ - (list)->last = link; \ -} (void)0 +#define BLI_LINKS_APPEND(list, link) \ + { \ + (link)->next = NULL; \ + if ((list)->first) { \ + (list)->last->next = link; \ + } \ + else { \ + (list)->first = link; \ + } \ + (list)->last = link; \ + } \ + (void)0 /* Use for inserting after a certain element. */ -#define BLI_LINKS_INSERT_AFTER(list, node, link) { \ - if ((node)->next == NULL) { \ - (list)->last = link; \ - } \ - (link)->next = (node)->next; \ - (node)->next = link; \ -} (void)0 +#define BLI_LINKS_INSERT_AFTER(list, node, link) \ + { \ + if ((node)->next == NULL) { \ + (list)->last = link; \ + } \ + (link)->next = (node)->next; \ + (node)->next = link; \ + } \ + (void)0 -#define BLI_LINKS_FREE(list) { \ - while (list) { \ - void *next = list->next; \ - MEM_freeN(list); \ - list = next; \ - } \ -} (void)0 +#define BLI_LINKS_FREE(list) \ + { \ + while (list) { \ + void *next = list->next; \ + MEM_freeN(list); \ + list = next; \ + } \ + } \ + (void)0 -#endif /* __BLI_LINK_UTILS_H__ */ +#endif /* __BLI_LINK_UTILS_H__ */ |