Lines Matching refs:entries
154 * Routines to sort and search the entries by name
182 return ((struct cache_entry_ **)(bsearch(entry_name, the_cache->entries,
197 TAILQ_REMOVE(&ws->items, data_item, entries);
261 TAILQ_REMOVE(&mp_entry->ws_head, ws, entries);
267 TAILQ_REMOVE(&mp_entry->rs_head, rs, entries);
490 retval->entries = calloc(INITIAL_ENTRIES_CAPACITY,
491 sizeof(*retval->entries));
492 assert(retval->entries != NULL);
508 if (the_cache->entries != NULL) {
511 destroy_cache_entry(the_cache->entries[i]);
513 free(the_cache->entries);
547 memcpy(new_entries, the_cache->entries,
551 free(the_cache->entries);
552 the_cache->entries = new_entries;
609 the_cache->entries[the_cache->entries_size++] =
633 the_cache->entries[the_cache->entries_size++] =
639 qsort(the_cache->entries, the_cache->entries_size,
660 (&(the_cache->entries[--the_cache->entries_size]) -
948 TAILQ_INSERT_HEAD(&mp_entry->ws_head, retval, entries);
985 TAILQ_INSERT_TAIL(&ws->items, new_item, entries);
1004 TAILQ_REMOVE(&ws->parent_entry->ws_head, ws, entries);
1023 TAILQ_REMOVE(&ws->parent_entry->ws_head, ws, entries);
1087 TAILQ_INSERT_HEAD(&mp_entry->rs_head, retval, entries);
1126 rs->current_item = TAILQ_NEXT(rs->current_item, entries);
1145 TAILQ_REMOVE(&rs->parent_entry->rs_head, rs, entries);