mirror of
https://git.haproxy.org/git/haproxy.git/
synced 2025-09-20 21:31:28 +02:00
ddf900a0ce
The support for duplicates is necessary for various use cases related
to config names, so let's upgrade to the latest version which brings
this support. This updates the cebtree code to commit 808ed67 (tag
0.5.0). A few tiny adaptations were needed:
- replace a few ceb_node** with ceb_root** since pointers are now
tagged ;
- replace cebu*.h with ceb*.h since both are now merged in the same
include file. This way we can drop the unused cebu*.h files from
cebtree that are provided only for compatibility.
- rename immediate storage functions to cebXX_imm_XXX() as per the API
change in 0.5 that makes immediate explicit rather than implicit.
This only affects vars and tools.c:copy_file_name().
The tests continue to work.
56 lines
2.6 KiB
C
56 lines
2.6 KiB
C
/*
|
|
* Compact Elastic Binary Trees - exported functions operating on addr keys
|
|
*
|
|
* Copyright (C) 2014-2025 Willy Tarreau - w@1wt.eu
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining
|
|
* a copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
* the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
|
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
|
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
* OTHER DEALINGS IN THE SOFTWARE.
|
|
*/
|
|
|
|
#ifndef _CEBA_TREE_H
|
|
#define _CEBA_TREE_H
|
|
|
|
#include "cebtree.h"
|
|
|
|
/* simpler version */
|
|
struct ceb_node *cebua_imm_insert(struct ceb_root **root, struct ceb_node *node);
|
|
struct ceb_node *cebua_imm_first(struct ceb_root *const *root);
|
|
struct ceb_node *cebua_imm_last(struct ceb_root *const *root);
|
|
struct ceb_node *cebua_imm_lookup(struct ceb_root *const *root, const void *key);
|
|
struct ceb_node *cebua_imm_lookup_le(struct ceb_root *const *root, const void *key);
|
|
struct ceb_node *cebua_imm_lookup_lt(struct ceb_root *const *root, const void *key);
|
|
struct ceb_node *cebua_imm_lookup_ge(struct ceb_root *const *root, const void *key);
|
|
struct ceb_node *cebua_imm_lookup_gt(struct ceb_root *const *root, const void *key);
|
|
struct ceb_node *cebua_imm_next(struct ceb_root *const *root, struct ceb_node *node);
|
|
struct ceb_node *cebua_imm_prev(struct ceb_root *const *root, struct ceb_node *node);
|
|
struct ceb_node *cebua_imm_delete(struct ceb_root **root, struct ceb_node *node);
|
|
struct ceb_node *cebua_imm_pick(struct ceb_root **root, const void *key);
|
|
|
|
/* generic dump function */
|
|
void ceba_imm_default_dump(struct ceb_root *const *root, const char *label, const void *ctx, int sub);
|
|
|
|
/* returns the pointer to the area that immediately follows the node */
|
|
static inline void *ceba_imm_key(const struct ceb_node *node)
|
|
{
|
|
return (void *)ceb_key_ptr(node, sizeof(struct ceb_node));
|
|
}
|
|
|
|
#endif /* _CEBA_TREE_H */
|