Lines Matching refs:entry
261 struct hash_entry *entry = _mesa_hash_table_search(ht, &key);
262 struct iris_bo *bo = entry ? entry->data : NULL;
587 /* Return the power of two size of a slab entry matching the input size. */
597 /* Return the slab entry alignment. */
610 iris_can_reclaim_slab(void *priv, struct pb_slab_entry *entry)
612 struct iris_bo *bo = container_of(entry, struct iris_bo, slab.entry);
679 /* The slab size is twice the size of the largest possible entry. */
685 /* If the entry size is 3/4 of a power of two, we would waste
691 * Allocating 5 times the entry size leads us to the next power
744 bo->slab.entry.slab = &slab->base;
745 bo->slab.entry.group_index = group_index;
746 bo->slab.entry.entry_size = entry_size;
750 list_addtail(&bo->slab.entry.head, &slab->base.free);
793 struct pb_slab_entry *entry;
821 entry = pb_slab_alloc(slabs, alloc_size, heap);
822 if (!entry) {
826 entry = pb_slab_alloc(slabs, alloc_size, heap);
828 if (!entry)
831 struct iris_bo *bo = container_of(entry, struct iris_bo, slab.entry);
857 pb_slab_free(slabs, &bo->slab.entry);
1315 struct hash_entry *entry;
1318 entry = _mesa_hash_table_search(bufmgr->name_table,
1320 _mesa_hash_table_remove(bufmgr->name_table, entry);
1323 entry = _mesa_hash_table_search(bufmgr->handle_table, &bo->gem_handle);
1324 _mesa_hash_table_remove(bufmgr->handle_table, entry);
1488 pb_slab_free(get_slabs(bufmgr, bo->size), &bo->slab.entry);