wmem_interval_tree.h File Reference

#include "wmem_core.h"
#include "wmem_tree.h"
#include "wmem_list.h"

Go to the source code of this file.

Classes
struct	_wmem_range_t

Typedefs
typedef struct _wmem_tree_t	wmem_itree_t

Functions
WS_DLL_PUBLIC wmem_itree_t *	wmem_itree_new (wmem_allocator_t *allocator) G_GNUC_MALLOC
	Create a new interval tree using the specified memory allocator.
WS_DLL_PUBLIC bool	wmem_itree_is_empty (wmem_itree_t *tree)
	Check whether an interval tree is empty.
WS_DLL_PUBLIC void	wmem_itree_insert (wmem_itree_t *tree, const uint64_t low, const uint64_t high, void *data)
	Insert an interval into the interval tree.
WS_DLL_PUBLIC wmem_list_t *	wmem_itree_find_intervals (wmem_itree_t *tree, wmem_allocator_t *allocator, uint64_t low, uint64_t high)
	Find all intervals overlapping a given range in an interval tree.
void	wmem_print_itree (wmem_itree_t *tree)
	Print all intervals stored in the interval tree.

Detailed Description

Definitions for the Wireshark Memory Manager Red-Black Tree Based on the red-black tree implementation in epan/emem.* Copyright 2015, Matthieu coudron matth.nosp@m.ieu..nosp@m.coudr.nosp@m.on@l.nosp@m.ip6.f.nosp@m.r

Wireshark - Network traffic analyzer By Gerald Combs geral.nosp@m.d@wi.nosp@m.resha.nosp@m.rk.o.nosp@m.rg Copyright 1998 Gerald Combs

SPDX-License-Identifier: GPL-2.0-or-later