Lines Matching refs:entries
82 * Since the entries pointed by ucsmap_hash_t.entry are sorted,
103 ucsmap_entry_t *entries; /* array of entries */
105 size_t nentries; /* # of entries in use */
135 ctx->entries = NULL;
152 if (ctx->entries != NULL)
153 free(ctx->entries);
196 newbuf = realloc(ctx->entries, sizeof(*e) * ctx->entry_size);
199 ctx->entries = newbuf;
201 e = &ctx->entries[ctx->nentries];
246 /* Sort entries by the hash value and code point. */
247 qsort(ctx->entries, ctx->nentries, sizeof(ucsmap_entry_t), comp_entry);
250 * Now the entries are sorted by their hash value, and
256 for (i = 0, e = ctx->entries; i < ctx->nentries; i++, e++) {