Lines Matching defs:entries
637 size_t count; /* Number of entries in the hash part. */
639 uint8_t size_lg2; /* Size of the hashtable part is 2^size_lg2 entries. */
641 /* Hash table entries.
647 const upb_tabent *entries;
655 upb_table t; /* For entries that don't fit in the array part. */
687 return t->entries + (hash & t->mask);
814 /* Optimizes the table for the current set of entries, for both memory use and
815 * lookup time. Client should call this after all entries have been inserted;
816 * inserting more entries is legal, but will likely require a table resize. */
838 if (t->t.entries == NULL) return false;
920 return &i->t->t.entries[i->index];
1134 /* Map entries aren't actually stored, they are only used during parsing. For
1136 * The compiler and def.c must ensure that all map entries have this layout. */
3508 /* Returns the number of entries in the map. */
3516 /* Removes all entries in the map. */
3539 /* Advances to the next entry. Returns false if no more entries are present. */