diff options
author | Joshua Haberman <joshua@reverberate.org> | 2011-02-17 19:14:53 -0800 |
---|---|---|
committer | Joshua Haberman <joshua@reverberate.org> | 2011-02-17 19:14:53 -0800 |
commit | f1e1cc4695b34b292454e903adbf09e66cf2e9d5 (patch) | |
tree | 4536fa1613c054c83b91a0ac1e76759815ceab80 /src/upb_table.h | |
parent | f9a6f67e275dd6d379ae9428e1c40f43d8d17386 (diff) |
Split inttable into a hash part and an array part.
upb_inttable() now supports a "compact" operation that will
decide on an array size and put all entries with small enough
keys into the array part for faster lookup.
Also exposed the upb_itof_ent structure and put a few useful
values there, so they are one fewer pointer chase away.
Diffstat (limited to 'src/upb_table.h')
-rw-r--r-- | src/upb_table.h | 164 |
1 files changed, 106 insertions, 58 deletions
diff --git a/src/upb_table.h b/src/upb_table.h index b173101..3903c75 100644 --- a/src/upb_table.h +++ b/src/upb_table.h @@ -25,12 +25,21 @@ extern "C" { typedef uint32_t upb_inttable_key_t; -#define UPB_END_OF_CHAIN (uint32_t)0 +#define UPB_END_OF_CHAIN (uint32_t)-1 typedef struct { - upb_inttable_key_t key; bool has_entry:1; - uint32_t next:31; // Internal chaining. + // The rest of the bits are the user's. +} upb_inttable_value; + +typedef struct { + upb_inttable_key_t key; + uint32_t next; // Internal chaining. +} upb_inttable_header; + +typedef struct { + upb_inttable_header hdr; + upb_inttable_value val; } upb_inttable_entry; // TODO: consider storing the hash in the entry. This would avoid the need to @@ -43,11 +52,12 @@ typedef struct { } upb_strtable_entry; typedef struct { - void *entries; - uint32_t count; /* How many elements are currently in the table? */ - uint16_t entry_size; /* How big is each entry? */ - uint8_t size_lg2; /* The table is 2^size_lg2 in size. */ - uint32_t mask; + void *entries; // Hash table. + uint32_t count; // Number of entries in the hash part. + uint32_t mask; // Mask to turn hash value -> bucket. + uint16_t entry_size; // Size of each entry. + uint16_t value_size; // Size of each value. + uint8_t size_lg2; // Size of the hash table part is 2^size_lg2 entries. } upb_table; typedef struct { @@ -56,83 +66,121 @@ typedef struct { typedef struct { upb_table t; + void *array; // Array part of the table. + uint32_t array_size; // Array part size. + uint32_t array_count; // Array part number of elements. } upb_inttable; -/* Initialize and free a table, respectively. Specify the initial size - * with 'size' (the size will be increased as necessary). Entry size - * specifies how many bytes each entry in the table is. */ -void upb_inttable_init(upb_inttable *table, uint32_t size, uint16_t entry_size); +// Initialize and free a table, respectively. Specify the initial size +// with 'size' (the size will be increased as necessary). Value size +// specifies how many bytes each value in the table is. +// +// WARNING! The lowest bit of every entry is reserved by the hash table. +// It will always be overwritten when you insert, and must not be modified +// when looked up! +void upb_inttable_init(upb_inttable *table, uint32_t size, uint16_t value_size); void upb_inttable_free(upb_inttable *table); -void upb_strtable_init(upb_strtable *table, uint32_t size, uint16_t entry_size); +void upb_strtable_init(upb_strtable *table, uint32_t size, uint16_t entry_size); // TODO: update void upb_strtable_free(upb_strtable *table); -INLINE uint32_t upb_table_size(upb_table *t) { return 1 << t->size_lg2; } -INLINE uint32_t upb_inttable_size(upb_inttable *t) { - return upb_table_size(&t->t); -} -INLINE uint32_t upb_strtable_size(upb_strtable *t) { - return upb_table_size(&t->t); -} - +// Number of values in the hash table. INLINE uint32_t upb_table_count(upb_table *t) { return t->count; } INLINE uint32_t upb_inttable_count(upb_inttable *t) { - return upb_table_count(&t->t); + return t->array_count + upb_table_count(&t->t); } INLINE uint32_t upb_strtable_count(upb_strtable *t) { return upb_table_count(&t->t); } -/* Inserts the given key into the hashtable with the given value. The key must - * not already exist in the hash table. The data will be copied from e into - * the hashtable (the amount of data copied comes from entry_size when the - * table was constructed). Therefore the data at val may be freed once the - * call returns. */ -void upb_inttable_insert(upb_inttable *t, upb_inttable_entry *e); -void upb_strtable_insert(upb_strtable *t, upb_strtable_entry *e); +// Inserts the given key into the hashtable with the given value. The key must +// not already exist in the hash table. The data will be copied from val into +// the hashtable (the amount of data copied comes from value_size when the +// table was constructed). Therefore the data at val may be freed once the +// call returns. For string tables, the table takes a ref on str. +// +// WARNING: the lowest bit of val is reserved and will be overwritten! +void upb_inttable_insert(upb_inttable *t, upb_inttable_key_t key, void *val); +void upb_strtable_insert(upb_strtable *t, upb_strtable_entry *ent); // TODO: update +void upb_inttable_compact(upb_inttable *t); + +INLINE uint32_t _upb_inttable_bucket(upb_inttable *t, upb_inttable_key_t k) { + uint32_t bucket = k & t->t.mask; // Identity hash for ints. + assert(bucket != UPB_END_OF_CHAIN); + return bucket; +} -INLINE uint32_t upb_inttable_bucket(upb_inttable *t, upb_inttable_key_t k) { - return (k & t->t.mask) + 1; /* Identity hash for ints. */ +// Returns true if this key belongs in the array part of the table. +INLINE bool _upb_inttable_isarrkey(upb_inttable *t, upb_inttable_key_t k) { + return (k < t->array_size); } -/* Looks up key in this table. Inlined because this is in the critical path of - * decoding. We have the caller specify the entry_size because fixing this as - * a literal (instead of reading table->entry_size) gives the compiler more - * ability to optimize. */ -INLINE void *upb_inttable_fastlookup(upb_inttable *t, uint32_t key, - uint32_t entry_size) { - uint32_t bucket = upb_inttable_bucket(t, key); +// Looks up key in this table, returning a pointer to the user's inserted data. +// We have the caller specify the entry_size because fixing this as a literal +// (instead of reading table->entry_size) gives the compiler more ability to +// optimize. +INLINE void *_upb_inttable_fastlookup(upb_inttable *t, uint32_t key, + size_t entry_size, size_t value_size) { + upb_inttable_value *arrval = + (upb_inttable_value*)UPB_INDEX(t->array, key, value_size); + if (_upb_inttable_isarrkey(t, key)) { + //printf("array lookup for key %d, &val=%p, has_entry=%d\n", key, val, val->has_entry); + return (arrval->has_entry) ? arrval : NULL; + } + uint32_t bucket = _upb_inttable_bucket(t, key); upb_inttable_entry *e = - (upb_inttable_entry*)UPB_INDEX(t->t.entries, bucket-1, entry_size); - if (key == 0) { - while (1) { - if (e->key == 0 && e->has_entry) return e; - if ((bucket = e->next) == UPB_END_OF_CHAIN) return NULL; - e = (upb_inttable_entry*)UPB_INDEX(t->t.entries, bucket-1, entry_size); - } - } else { - while (1) { - if (e->key == key) return e; - if ((bucket = e->next) == UPB_END_OF_CHAIN) return NULL; - e = (upb_inttable_entry*)UPB_INDEX(t->t.entries, bucket-1, entry_size); - } + (upb_inttable_entry*)UPB_INDEX(t->t.entries, bucket, entry_size); + //printf("looking in first bucket %d, entry size=%zd, addr=%p\n", bucket, entry_size, e); + while (1) { + //printf("%d, %d, %d\n", e->val.has_entry, e->hdr.key, key); + if (e->hdr.key == key) return &e->val; + if ((bucket = e->hdr.next) == UPB_END_OF_CHAIN) return NULL; + //printf("looking in bucket %d\n", bucket); + e = (upb_inttable_entry*)UPB_INDEX(t->t.entries, bucket, entry_size); } } +INLINE size_t _upb_inttable_entrysize(size_t value_size) { + return upb_align_up(sizeof(upb_inttable_header) + value_size, 8); +} + +INLINE void *upb_inttable_fastlookup(upb_inttable *t, uint32_t key, + uint32_t value_size) { + return _upb_inttable_fastlookup(t, key, _upb_inttable_entrysize(value_size), value_size); +} + INLINE void *upb_inttable_lookup(upb_inttable *t, uint32_t key) { - return upb_inttable_fastlookup(t, key, t->t.entry_size); + return _upb_inttable_fastlookup(t, key, t->t.entry_size, t->t.value_size); } void *upb_strtable_lookup(upb_strtable *t, upb_string *key); -/* Provides iteration over the table. The order in which the entries are - * returned is undefined. Insertions invalidate iterators. The _next - * functions return NULL when the end has been reached. */ -void *upb_inttable_begin(upb_inttable *t); -void *upb_inttable_next(upb_inttable *t, upb_inttable_entry *cur); - +// Provides iteration over the table. The order in which the entries are +// returned is undefined. Insertions invalidate iterators. void *upb_strtable_begin(upb_strtable *t); void *upb_strtable_next(upb_strtable *t, upb_strtable_entry *cur); +// Inttable iteration (should update strtable iteration to use this scheme too). +// The order is undefined. +// for(upb_inttable_iter i = upb_inttable_begin(t); !upb_inttable_done(i); +// i = upb_inttable_next(t, i)) { +// // ... +// } +typedef struct { + upb_inttable_key_t key; + upb_inttable_value *value; + bool array_part; +} upb_inttable_iter; + +upb_inttable_iter upb_inttable_begin(upb_inttable *t); +upb_inttable_iter upb_inttable_next(upb_inttable *t, upb_inttable_iter iter); +INLINE bool upb_inttable_done(upb_inttable_iter iter) { return iter.value == NULL; } +INLINE upb_inttable_key_t upb_inttable_iter_key(upb_inttable_iter iter) { + return iter.key; +} +INLINE void *upb_inttable_iter_value(upb_inttable_iter iter) { + return iter.value; +} + #ifdef __cplusplus } /* extern "C" */ #endif |