ShuriZma
/
RetroArch
mirror of https://github.com/libretro/RetroArch.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

(libretro-db) Style nits

This commit is contained in:
Twinaphex 2015-06-03 15:59:32 +02:00
parent 37da7a7fd3
commit efdb991f12
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
libretro-db/bintree.c
View File

@ -26,15 +26,13 @@ static struct bintree_node *new_nil_node(struct bintree_node *parent)
node->value = NIL_NODE; node->value = NIL_NODE;
node->parent = parent; node->parent = parent;
node->left = NULL;
node->right = NULL;
return node; return node;
} }
static INLINE int is_nil(const struct bintree_node *node) static INLINE int is_nil(const struct bintree_node *node)
{ {
return node == NULL || node->value == NIL_NODE; return (node == NULL) || (node->value == NIL_NODE);
} }
static int insert(struct bintree *t, struct bintree_node *root, static int insert(struct bintree *t, struct bintree_node *root,
@ -44,7 +42,7 @@ static int insert(struct bintree *t, struct bintree_node *root,
if (is_nil(root)) if (is_nil(root))
{ {
root->left = new_nil_node(root); root->left = new_nil_node(root);
root->right = new_nil_node(root); root->right = new_nil_node(root);
if (!root->left || !root->right) if (!root->left || !root->right)
@ -114,6 +112,7 @@ static void bintree_free_node(struct bintree_node *n)
free(n); free(n);
return; return;
} }
n->value = NULL; n->value = NULL;
bintree_free_node(n->left); bintree_free_node(n->left);
bintree_free_node(n->right); bintree_free_node(n->right);