wine/vkd3d
0
0
Fork 0
mirror of https://gitlab.winehq.org/wine/vkd3d.git synced 2025-01-28 13:05:02 -08:00
Code Issues Packages Projects Releases Wiki Activity

include: Avoid _t-suffixes.

Browse Source 
The _t-suffix is reserved by POSIX.

Signed-off-by: Henri Verbeet <hverbeet@codeweavers.com>
Signed-off-by: Alexandre Julliard <julliard@winehq.org>
This commit is contained in:
Henri Verbeet 2018-10-18 17:44:31 +03:30 committed by Alexandre Julliard
parent 6639f618af
commit 78c203b395
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
include/private/rbtree.h
View File

@ -34,15 +34,15 @@ struct rb_entry
unsigned int flags;
};
typedef int (*rb_compare_func_t)(const void *key, const struct rb_entry *entry);
typedef int (*rb_compare_func)(const void *key, const struct rb_entry *entry);
struct rb_tree
{
rb_compare_func_t compare;
rb_compare_func compare;
struct rb_entry *root;
};
typedef void (rb_traverse_func_t)(struct rb_entry *entry, void *context);
typedef void (rb_traverse_func)(struct rb_entry *entry, void *context);
#define RB_FLAG_RED 0x1
@ -150,32 +150,32 @@ static inline struct rb_entry *rb_postorder_next(struct rb_entry *iter)
(elem) = (elem2))
static inline void rb_postorder(struct rb_tree *tree, rb_traverse_func_t *callback, void *context)
static inline void rb_postorder(struct rb_tree *tree, rb_traverse_func *callback, void *context)
{
struct rb_entry *iter, *next;
rb_FOR_EACH_DESTRUCTOR(iter, next, tree) callback(iter, context);
}
static inline void rb_init(struct rb_tree *tree, rb_compare_func_t compare)
static inline void rb_init(struct rb_tree *tree, rb_compare_func compare)
{
tree->compare = compare;
tree->root = NULL;
}
static inline void rb_for_each_entry(struct rb_tree *tree, rb_traverse_func_t *callback, void *context)
static inline void rb_for_each_entry(struct rb_tree *tree, rb_traverse_func *callback, void *context)
{
struct rb_entry *iter;
rb_FOR_EACH(iter, tree) callback(iter, context);
}
static inline void rb_clear(struct rb_tree *tree, rb_traverse_func_t *callback, void *context)
static inline void rb_clear(struct rb_tree *tree, rb_traverse_func *callback, void *context)
{
/* Note that we use postorder here because the callback will likely free the entry. */
if (callback) rb_postorder(tree, callback, context);
tree->root = NULL;
}
static inline void rb_destroy(struct rb_tree *tree, rb_traverse_func_t *callback, void *context)
static inline void rb_destroy(struct rb_tree *tree, rb_traverse_func *callback, void *context)
{
rb_clear(tree, callback, context);
}