system/wine
system/wine
1
0
Fork 0
mirror of git://source.winehq.org/git/wine.git synced 2024-07-21 15:14:09 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

include: Avoid _t-suffixes.

Browse source 
The _t-suffix is reserved by POSIX.

Cherry-picked from vkd3d commit 78c203b395b1fa4b5918cf881ebba8e9d47ae997.
This commit is contained in:
Henri Verbeet 2022-08-30 21:35:36 +02:00 committed by Alexandre Julliard
parent 96742389f6
commit 57c9bc9056
1 changed files with 7 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
include/wine/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
@ -164,25 +164,25 @@ 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_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)
{
/* Note that we use postorder here because the callback will likely free the entry. */
if (callback) rb_postorder(tree, callback, context);