haproxy/include/types/dict.h

#ifndef _TYPES_DICT_H
#define _TYPES_DICT_H

#include <common/hathreads.h>
#include <ebpttree.h>

struct dict_entry {
	struct ebpt_node value;
	unsigned int refcount;
	size_t len;
};

struct dict {
	const char *name;
	struct eb_root values;
	__decl_hathreads(HA_RWLOCK_T rwlock);
};

#endif /* _TYPES_DICT_H */
MINOR: dict: Add dictionary new data structure. This patch adds minimalistic definitions to implement dictionary new data structure which is an ebtree of ebpt_node structs with strings as keys. Note that this has nothing to see with real dictionary data structure (maps of keys in association with values). 2019-05-28 08:47:17 -04:00			`#ifndef _TYPES_DICT_H`
			`#define _TYPES_DICT_H`

			`#include <common/hathreads.h>`
			`#include <ebpttree.h>`

			`struct dict_entry {`
			`struct ebpt_node value;`
			`unsigned int refcount;`
MINOR: dict: Store the length of the dictionary entries. When allocating new dictionary entries we store the length of the strings. May be useful so that not to have to call strlen() too much often at runing time. 2019-06-07 04:58:20 -04:00			`size_t len;`
MINOR: dict: Add dictionary new data structure. This patch adds minimalistic definitions to implement dictionary new data structure which is an ebtree of ebpt_node structs with strings as keys. Note that this has nothing to see with real dictionary data structure (maps of keys in association with values). 2019-05-28 08:47:17 -04:00			`};`

			`struct dict {`
			`const char *name;`
			`struct eb_root values;`
			`__decl_hathreads(HA_RWLOCK_T rwlock);`
			`};`

			`#endif /* _TYPES_DICT_H */`