554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * Red-black search tree support
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * Copyright 2009 Henri Verbeet
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * Copyright 2009 Andrew Riedi
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * This library is free software; you can redistribute it and/or
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * modify it under the terms of the GNU Lesser General Public
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * License as published by the Free Software Foundation; either
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * version 2.1 of the License, or (at your option) any later version.
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * This library is distributed in the hope that it will be useful,
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * but WITHOUT ANY WARRANTY; without even the implied warranty of
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * Lesser General Public License for more details.
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * You should have received a copy of the GNU Lesser General Public
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * License along with this library; if not, write to the Free Software
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
4b9d6701570cb98fd36e209314239d104ec584d3vboxsync * Oracle LGPL Disclaimer: For the avoidance of doubt, except that if any license choice
4b9d6701570cb98fd36e209314239d104ec584d3vboxsync * other than GPL or LGPL is available it will apply instead, Oracle elects to use only
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * the Lesser General Public License version 2.1 (LGPLv2) at this time for any software where
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * a choice of LGPL license versions is made available with the language indicating
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * that LGPLv2 or any later version may be used, or where a choice of which version
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync * of the LGPL is applied is otherwise unspecified.
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync ((type *)((char *)(element) - FIELD_OFFSET(type, field)))
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync unsigned int flags;
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync int (*compare)(const void *key, const struct wine_rb_entry *entry);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsynctypedef void (wine_rb_traverse_func_t)(struct wine_rb_entry *entry, void *context);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_stack_clear(struct wine_rb_stack *stack)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_stack_push(struct wine_rb_stack *stack, struct wine_rb_entry **entry)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline int wine_rb_ensure_stack_size(struct wine_rb_tree *tree, size_t size)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync struct wine_rb_entry ***new_entries = tree->functions->realloc(stack->entries,
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline int wine_rb_is_red(struct wine_rb_entry *entry)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_rotate_left(struct wine_rb_entry **entry)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_rotate_right(struct wine_rb_entry **entry)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_flip_color(struct wine_rb_entry *entry)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_fixup(struct wine_rb_stack *stack)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync struct wine_rb_entry **entry = stack->entries[stack->count - 1];
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (wine_rb_is_red((*entry)->right) && !wine_rb_is_red((*entry)->left)) wine_rb_rotate_left(entry);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (wine_rb_is_red((*entry)->left) && wine_rb_is_red((*entry)->left->left)) wine_rb_rotate_right(entry);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (wine_rb_is_red((*entry)->left) && wine_rb_is_red((*entry)->right)) wine_rb_flip_color(*entry);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_move_red_left(struct wine_rb_entry **entry)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_move_red_right(struct wine_rb_entry **entry)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_postorder(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (e->left && !(e->flags & WINE_RB_FLAG_TRAVERSED_LEFT))
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (e->right && !(e->flags & WINE_RB_FLAG_TRAVERSED_RIGHT))
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync e->flags &= ~(WINE_RB_FLAG_TRAVERSED_LEFT | WINE_RB_FLAG_TRAVERSED_RIGHT);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline int wine_rb_init(struct wine_rb_tree *tree, const struct wine_rb_functions *functions)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync tree->stack.entries = functions->alloc(16 * sizeof(*tree->stack.entries));
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_for_each_entry(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_destroy(struct wine_rb_tree *tree, wine_rb_traverse_func_t *callback, void *context)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync /* Note that we use postorder here because the callback will likely free the entry. */
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (callback) wine_rb_postorder(tree, callback, context);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline struct wine_rb_entry *wine_rb_get(const struct wine_rb_tree *tree, const void *key)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (!c) return entry;
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline int wine_rb_put(struct wine_rb_tree *tree, const void *key, struct wine_rb_entry *entry)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync /* After insertion, the path length to any node should be <= (black_height + 1) * 2. */
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (wine_rb_ensure_stack_size(tree, black_height << 1) == -1)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsyncstatic inline void wine_rb_remove(struct wine_rb_tree *tree, const void *key)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (!wine_rb_is_red((*entry)->left) && !wine_rb_is_red((*entry)->left->left)) wine_rb_move_red_left(entry);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (wine_rb_is_red((*entry)->left)) wine_rb_rotate_right(entry);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (!tree->functions->compare(key, *entry) && !(*entry)->right)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (!wine_rb_is_red((*entry)->right) && !wine_rb_is_red((*entry)->right->left))
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync struct wine_rb_entry *m = *e;
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync while ((*e)->left)
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (!wine_rb_is_red((*e)->left) && !wine_rb_is_red((*e)->left->left)) wine_rb_move_red_left(e);
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync e = &(*e)->left;
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync if (tree->root) tree->root->flags &= ~WINE_RB_FLAG_RED;
554f00fe75489f3f3ce7fbb6d126ce1d2c5c922cvboxsync#endif /* __WINE_WINE_RBTREE_H */