Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCampbell Barton <ideasman42@gmail.com>2018-06-17 17:32:54 +0300
committerCampbell Barton <ideasman42@gmail.com>2018-06-17 17:32:54 +0300
commit5513da65b24a3ce77b1709acea841475115f3a7a (patch)
tree20bd4d26f20ac63ebf776cea3a0220c11258f06d /source/blender/blenlib/intern/BLI_linklist.c
parentf19ecdeec64506415b9a9f75293df866691bbd28 (diff)
Cleanup: trailing space for BLI
Diffstat (limited to 'source/blender/blenlib/intern/BLI_linklist.c')
-rw-r--r--source/blender/blenlib/intern/BLI_linklist.c20
1 files changed, 10 insertions, 10 deletions
diff --git a/source/blender/blenlib/intern/BLI_linklist.c b/source/blender/blenlib/intern/BLI_linklist.c
index 051792f7f7c..80d5cbc8cd0 100644
--- a/source/blender/blenlib/intern/BLI_linklist.c
+++ b/source/blender/blenlib/intern/BLI_linklist.c
@@ -58,18 +58,18 @@ int BLI_linklist_count(const LinkNode *list)
int BLI_linklist_index(const LinkNode *list, void *ptr)
{
int index;
-
+
for (index = 0; list; list = list->next, index++)
if (list->link == ptr)
return index;
-
+
return -1;
}
LinkNode *BLI_linklist_find(LinkNode *list, int index)
{
int i;
-
+
for (i = 0; list; list = list->next, i++)
if (i == index)
return list;
@@ -80,16 +80,16 @@ LinkNode *BLI_linklist_find(LinkNode *list, int index)
void BLI_linklist_reverse(LinkNode **listp)
{
LinkNode *rhead = NULL, *cur = *listp;
-
+
while (cur) {
LinkNode *next = cur->next;
-
+
cur->next = rhead;
rhead = cur;
-
+
cur = next;
}
-
+
*listp = rhead;
}
@@ -199,7 +199,7 @@ void BLI_linklist_append_nlink(LinkNodePair *list_pair, void *ptr, LinkNode *nli
{
nlink->link = ptr;
nlink->next = NULL;
-
+
if (list_pair->list) {
BLI_assert((list_pair->last_node != NULL) && (list_pair->last_node->next == NULL));
list_pair->last_node->next = nlink;
@@ -275,11 +275,11 @@ void BLI_linklist_free(LinkNode *list, LinkNodeFreeFP freefunc)
{
while (list) {
LinkNode *next = list->next;
-
+
if (freefunc)
freefunc(list->link);
MEM_freeN(list);
-
+
list = next;
}
}