lib: stuff xrefs into a tree for lookup

... so we can actually access by UID without searching the entire list.

Signed-off-by: David Lamparter <equinox@diac24.net>
This commit is contained in:
David Lamparter 2021-02-24 11:57:15 +01:00 committed by David Lamparter
parent b0993fb201
commit 4894e9c12a
2 changed files with 17 additions and 0 deletions

View File

@ -35,6 +35,8 @@
struct xref_block *xref_blocks;
static struct xref_block **xref_block_last = &xref_blocks;
struct xrefdata_uid_head xrefdata_uid = INIT_RBTREE_UNIQ(xrefdata_uid);
static void base32(uint8_t **inpos, int *bitpos,
char *out, size_t n_chars)
{
@ -109,6 +111,8 @@ static void xref_add_one(const struct xref *xref)
base32(&h, &bitpos, &xrefdata->uid[0], 5);
xrefdata->uid[5] = '-';
base32(&h, &bitpos, &xrefdata->uid[6], 5);
xrefdata_uid_add(&xrefdata_uid, xrefdata);
}
void xref_gcc_workaround(const struct xref *xref)

View File

@ -22,6 +22,7 @@
#include <limits.h>
#include <errno.h>
#include "compiler.h"
#include "typesafe.h"
#ifdef __cplusplus
extern "C" {
@ -63,6 +64,8 @@ struct xref {
/* type-specific bits appended by embedding this struct */
};
PREDECL_RBTREE_UNIQ(xrefdata_uid);
struct xrefdata {
/* pointer back to the const part; this will be initialized at
* program startup by xref_block_add(). (Creating structs with
@ -88,8 +91,18 @@ struct xrefdata {
uint32_t hashu32[2];
/* -- 32 bytes (on 64bit) -- */
struct xrefdata_uid_item xui;
};
static inline int xrefdata_uid_cmp(const struct xrefdata *a,
const struct xrefdata *b)
{
return strcmp(a->uid, b->uid);
}
DECLARE_RBTREE_UNIQ(xrefdata_uid, struct xrefdata, xui, xrefdata_uid_cmp);
extern struct xrefdata_uid_head xrefdata_uid;
/* linker "magic" is used to create an array of pointers to struct xref.
* the result is a contiguous block of pointers, each pointing to an xref
* somewhere in the code. The linker gives us start and end pointers, we