nasm/rbtree.h

#ifndef NASM_RBTREE_H
#define NASM_RBTREE_H

#include "compiler.h"
#include <inttypes.h>

/* This structure should be embedded in a larger data structure;
   the final output from rb_search() can then be converted back
   to the larger data structure via container_of(). */
struct rbtree {
    uint64_t key;
    struct rbtree *left, *right;
    bool red;
};

struct rbtree *rb_insert(struct rbtree *, struct rbtree *);
struct rbtree *rb_search(struct rbtree *, uint64_t);

#endif /* NASM_RBTREE_H */
Left-leaning red-black tree data structure Implement library functions for "left-leaning red-black trees" with uint64_t keys. This is meant for looking up symbols by address in the backends that need to do so, e.g. ELF. A good question is if there is a better way to do this, that recovers the original symbol, but that's a future issue. Signed-off-by: H. Peter Anvin <hpa@zytor.com> 2008-10-30 14:29:23 +08:00			`#ifndef NASM_RBTREE_H`
			`#define NASM_RBTREE_H`

			`#include "compiler.h"`
			`#include <inttypes.h>`

rbtree: drop the data pointer; instead rely on being embedded Drop the data pointer, and instead assume the struct rbtree will be embedded in a bigger data structure (to be extracted via container_of()). Signed-off-by: H. Peter Anvin <hpa@zytor.com> 2008-10-31 01:58:28 +08:00			`/* This structure should be embedded in a larger data structure;`
			`the final output from rb_search() can then be converted back`
			`to the larger data structure via container_of(). */`
Left-leaning red-black tree data structure Implement library functions for "left-leaning red-black trees" with uint64_t keys. This is meant for looking up symbols by address in the backends that need to do so, e.g. ELF. A good question is if there is a better way to do this, that recovers the original symbol, but that's a future issue. Signed-off-by: H. Peter Anvin <hpa@zytor.com> 2008-10-30 14:29:23 +08:00			`struct rbtree {`
			`uint64_t key;`
			`struct rbtree left, right;`
			`bool red;`
			`};`

rbtree: drop the data pointer; instead rely on being embedded Drop the data pointer, and instead assume the struct rbtree will be embedded in a bigger data structure (to be extracted via container_of()). Signed-off-by: H. Peter Anvin <hpa@zytor.com> 2008-10-31 01:58:28 +08:00			`struct rbtree rb_insert(struct rbtree , struct rbtree *);`
rbtree: drop "const" from search function Having the search argument and result be "const" is nice in theory, but causes problems in practice. Signed-off-by: H. Peter Anvin <hpa@zytor.com> 2008-11-07 11:54:05 +08:00			`struct rbtree rb_search(struct rbtree , uint64_t);`
Left-leaning red-black tree data structure Implement library functions for "left-leaning red-black trees" with uint64_t keys. This is meant for looking up symbols by address in the backends that need to do so, e.g. ELF. A good question is if there is a better way to do this, that recovers the original symbol, but that's a future issue. Signed-off-by: H. Peter Anvin <hpa@zytor.com> 2008-10-30 14:29:23 +08:00
			`#endif /* NASM_RBTREE_H */`