HomeSort by relevance Sort by last modified time
    Searched refs:slabs (Results 1 - 6 of 6) sorted by null

  /external/mesa3d/src/gallium/auxiliary/pipebuffer/
pb_slab.c 38 /* Slabs with allocation candidates. Typically, slabs in this list should
46 * Due to a race in new slab allocation, additional slabs in this list
49 struct list_head slabs; member in struct:pb_slab_group
54 pb_slab_reclaim(struct pb_slabs *slabs, struct pb_slab_entry *entry)
64 struct pb_slab_group *group = &slabs->groups[entry->group_index];
65 LIST_ADDTAIL(&slab->head, &group->slabs);
70 slabs->slab_free(slabs->priv, slab);
75 pb_slabs_reclaim_locked(struct pb_slabs *slabs)
    [all...]
pb_slab.h 32 * from larger buffers (called "slabs").
135 pb_slab_alloc(struct pb_slabs *slabs, unsigned size, unsigned heap);
138 pb_slab_free(struct pb_slabs* slabs, struct pb_slab_entry *entry);
141 pb_slabs_reclaim(struct pb_slabs *slabs);
144 pb_slabs_init(struct pb_slabs *slabs,
153 pb_slabs_deinit(struct pb_slabs *slabs);
pb_bufmgr_slab.c 99 * It adds/removes slabs as needed in order to meet the allocation/destruction
124 * Partial slabs
126 * Full slabs are not stored in any list. Empty slabs are destroyed
129 struct list_head slabs; member in struct:pb_slab_manager
136 * Wrapper around several slabs, therefore capable of handling buffers of
213 LIST_ADDTAIL(&slab->head, &mgr->slabs);
297 * Called when we ran out of free slabs.
359 /* Add this slab to the list of partial slabs */
360 LIST_ADDTAIL(&slab->head, &mgr->slabs);
    [all...]
  /external/mesa3d/src/gallium/state_trackers/nine/
nine_helpers.c 37 pool->slabs = REALLOC(pool->slabs,
42 pool->free = pool->slabs[pool->num_slabs++] = r;
nine_helpers.h 147 struct nine_range **slabs; member in struct:nine_range_pool
  /hardware/intel/common/libwsbm/src/
wsbm_slabpool.c 151 struct _WsbmListHead slabs; member in struct:_WsbmSlabSizeHeader
210 * FIXME: Perhaps arrange timeout slabs in size buckets for fast
323 * to efficiently reuse slabs.
500 WSBMLISTADDTAIL(&slab->head, &header->slabs);
538 WSBMLISTADDTAIL(&slab->head, &header->slabs);
546 if (header->slabs.next == &header->slabs ||
660 while (header->slabs.next == &header->slabs && count > 0) {
662 if (header->slabs.next != &header->slabs
    [all...]

Completed in 351 milliseconds