Searched refs:free_list (Results 1 - 8 of 8) sorted by last modified time

/haiku/src/system/kernel/
H A Dheap.cpp95 addr_t * free_list; member in struct:heap_page_s
312 for (addr_t *temp = page->free_list; temp != NULL; temp = (addr_t *)*temp)
316 "free_list %p (%" B_PRIu32 " entr%s)\n", page, page->bin_index,
317 page->free_count, page->empty_index, page->free_list, count,
476 for (addr_t *temp = page->free_list; temp != NULL;
584 for (addr_t *temp = page->free_list; temp != NULL;
719 for (addr_t *temp = page->free_list; temp != NULL;
981 addr_t *element = page->free_list;
1385 page->free_list = NULL;
1471 page->free_list
[all...]
H A Dguarded_heap.cpp60 struct list free_list; member in struct:guarded_heap_area
206 list_remove_item(&area.free_list, &page);
247 list_add_item(&area.free_list, &page);
284 = (guarded_heap_page*)list_get_first_item(&area.free_list);
287 page = (guarded_heap_page*)list_get_next_item(&area.free_list, page)) {
355 list_init_etc(&area->free_list,
703 void* item = list_get_first_item(&area->free_list);
712 item = list_get_next_item(&area->free_list, item);
715 kprintf("free_list: %p (%" B_PRIuSIZE " free)\n", &area->free_list,
[all...]
/haiku/src/add-ons/kernel/generic/locked_pool/
H A Dlocked_pool.c55 void *free_list; // list of free blocks member in struct:locked_pool
130 // create free_list and call add-hook
173 *NEXT_PTR(pool, lastBlock) = pool->free_list;
174 pool->free_list = next;
338 TRACE(("freeblocks=%d, free_list=%p\n",
339 pool->free_blocks, pool->free_list));
341 block = pool->free_list;
342 pool->free_list = *NEXT_PTR(pool, block);
344 TRACE(("new free_list=%p\n", pool->free_list));
[all...]
/haiku/src/system/libroot/posix/malloc_debug/
H A Dheap.cpp120 addr_t * free_list; member in struct:heap_page_s
215 for (addr_t *temp = page->free_list; temp != NULL; temp = (addr_t *)*temp)
219 "free_list %p (%" B_PRIu32 " entr%s)\n", page, page->bin_index,
220 page->free_count, page->empty_index, page->free_list, count,
305 for (addr_t *temp = page->free_list; temp != NULL;
400 for (addr_t *temp = page->free_list; temp != NULL;
617 addr_t *element = page->free_list;
995 page->free_list = NULL;
1081 page->free_list = NULL;
1088 if (page->free_list) {
[all...]
H A Dguarded_heap.cpp183 struct list free_list; member in struct:guarded_heap_area
340 list_remove_item(&area.free_list, &page);
366 list_add_item(&area.free_list, &page);
390 = (guarded_heap_page*)list_get_next_item(&area.free_list, NULL);
393 page = (guarded_heap_page*)list_get_next_item(&area.free_list, page)) {
453 list_init_etc(&area->free_list,
903 void* item = list_get_next_item(&area.free_list, NULL);
912 item = list_get_next_item(&area.free_list, item);
915 printf("free_list: %p (%" B_PRIuSIZE " free)\n", &area.free_list,
[all...]
/haiku/src/add-ons/kernel/drivers/graphics/radeon/
H A DCP_setup.c470 cp->buffers.free_list = 0;
629 oldest_buffer->next = cp->buffers.free_list;
630 cp->buffers.free_list = cp->buffers.oldest;
/haiku/src/add-ons/accelerants/radeon/
H A DCP.c115 oldest_buffer->next = cp->buffers.free_list;
116 cp->buffers.free_list = cp->buffers.oldest;
139 if( cp->buffers.free_list >= 0 )
178 if( cp->buffers.free_list == -1 )
181 buffer_idx = cp->buffers.free_list;
182 cp->buffers.free_list = cp->buffers.buffers[buffer_idx].next;
215 cp->buffers.buffers[buffer_idx].next = cp->buffers.free_list;
216 cp->buffers.free_list = buffer_idx;
/haiku/headers/private/graphics/radeon/
H A Dradeon_interface.h481 int free_list; // index of first empty buffer member in struct:__anon28::__anon31

Completed in 76 milliseconds