HomeSort by: relevance | last modified time | path
    Searched defs:free_list (Results 1 - 25 of 36) sorted by relevancy

1 2

  /src/sys/arch/atari/include/
pmap.h 91 int free_list; /* Memory priority, lower = faster */ member in struct:memseg
pmap.h 91 int free_list; /* Memory priority, lower = faster */ member in struct:memseg
pmap.h 91 int free_list; /* Memory priority, lower = faster */ member in struct:memseg
  /src/sys/dev/ic/
siopvar.h 120 struct cmd_list free_list; /* cmd descr free list */ member in struct:siop_softc
siopvar.h 120 struct cmd_list free_list; /* cmd descr free list */ member in struct:siop_softc
siopvar.h 120 struct cmd_list free_list; /* cmd descr free list */ member in struct:siop_softc
esiopvar.h 141 struct cmd_list free_list; /* cmd descr free list */ member in struct:esiop_softc
esiopvar.h 141 struct cmd_list free_list; /* cmd descr free list */ member in struct:esiop_softc
esiopvar.h 141 struct cmd_list free_list; /* cmd descr free list */ member in struct:esiop_softc
  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_buddy.h 49 struct list_head *free_list; member in struct:i915_buddy_mm
i915_buddy.h 49 struct list_head *free_list; member in struct:i915_buddy_mm
i915_buddy.h 49 struct list_head *free_list; member in struct:i915_buddy_mm
  /src/games/rogue/
object.c 63 static object *free_list = NULL; variable in typeref:typename:object *
636 if (free_list) {
637 obj = free_list;
638 free_list = free_list->next_object;
656 obj->next_object = free_list;
657 free_list = obj;
object.c 63 static object *free_list = NULL; variable in typeref:typename:object *
636 if (free_list) {
637 obj = free_list;
638 free_list = free_list->next_object;
656 obj->next_object = free_list;
657 free_list = obj;
object.c 63 static object *free_list = NULL; variable in typeref:typename:object *
636 if (free_list) {
637 obj = free_list;
638 free_list = free_list->next_object;
656 obj->next_object = free_list;
657 free_list = obj;
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_allocator_primary32.h 164 if (sci->free_list.empty()) {
167 DCHECK(!sci->free_list.empty());
169 TransferBatch *b = sci->free_list.front();
170 sci->free_list.pop_front();
180 sci->free_list.push_front(b);
271 IntrusiveList<TransferBatch> free_list; local in function:SizeClassAllocator32::ALIGNED
321 sci->free_list.push_back(b);
362 sci->free_list.push_back(b);
sanitizer_allocator_primary32.h 164 if (sci->free_list.empty()) {
167 DCHECK(!sci->free_list.empty());
169 TransferBatch *b = sci->free_list.front();
170 sci->free_list.pop_front();
180 sci->free_list.push_front(b);
271 IntrusiveList<TransferBatch> free_list; local in function:SizeClassAllocator32::ALIGNED
321 sci->free_list.push_back(b);
362 sci->free_list.push_back(b);
sanitizer_allocator_primary32.h 164 if (sci->free_list.empty()) {
167 DCHECK(!sci->free_list.empty());
169 TransferBatch *b = sci->free_list.front();
170 sci->free_list.pop_front();
180 sci->free_list.push_front(b);
271 IntrusiveList<TransferBatch> free_list; local in function:SizeClassAllocator32::ALIGNED
321 sci->free_list.push_back(b);
362 sci->free_list.push_back(b);
  /src/sys/uvm/
uvm_physseg.c 102 int free_list; /* which free list they belong on */ member in struct:uvm_physseg
478 if (seg->free_list != freelist) {
669 if (seg->free_list != freelist) {
1108 return HANDLE_TO_PHYSSEG_NODE(upm)->free_list;
1242 paddr_t avail_end, int free_list)
1251 if (free_list >= VM_NFREELIST || free_list < VM_FREELIST_DEFAULT)
1252 panic("uvm_page_physload: bad free list %d", free_list);
1269 ps->free_list = free_list; /* XXX: *
    [all...]
uvm_physseg.c 102 int free_list; /* which free list they belong on */ member in struct:uvm_physseg
478 if (seg->free_list != freelist) {
669 if (seg->free_list != freelist) {
1108 return HANDLE_TO_PHYSSEG_NODE(upm)->free_list;
1242 paddr_t avail_end, int free_list)
1251 if (free_list >= VM_NFREELIST || free_list < VM_FREELIST_DEFAULT)
1252 panic("uvm_page_physload: bad free list %d", free_list);
1269 ps->free_list = free_list; /* XXX: *
    [all...]
uvm_physseg.c 102 int free_list; /* which free list they belong on */ member in struct:uvm_physseg
478 if (seg->free_list != freelist) {
669 if (seg->free_list != freelist) {
1108 return HANDLE_TO_PHYSSEG_NODE(upm)->free_list;
1242 paddr_t avail_end, int free_list)
1251 if (free_list >= VM_NFREELIST || free_list < VM_FREELIST_DEFAULT)
1252 panic("uvm_page_physload: bad free list %d", free_list);
1269 ps->free_list = free_list; /* XXX: *
    [all...]
  /src/lib/libc/stdlib/
malloc.c 239 static struct pgfree free_list; variable in typeref:struct:pgfree
582 for(pf = free_list.next; pf; pf = pf->next) {
586 wrterror("(ES): junk length entry on free_list.\n");
588 wrterror("(ES): zero length entry on free_list.\n");
590 wrterror("(ES): zero entry on free_list.\n");
592 wrterror("(ES): sick entry on free_list.\n");
594 wrterror("(ES): entry on free_list past brk.\n");
954 if (free_list.next == NULL) {
957 px->next = free_list.next;
958 px->prev = &free_list;
    [all...]
malloc.c 239 static struct pgfree free_list; variable in typeref:struct:pgfree
582 for(pf = free_list.next; pf; pf = pf->next) {
586 wrterror("(ES): junk length entry on free_list.\n");
588 wrterror("(ES): zero length entry on free_list.\n");
590 wrterror("(ES): zero entry on free_list.\n");
592 wrterror("(ES): sick entry on free_list.\n");
594 wrterror("(ES): entry on free_list past brk.\n");
954 if (free_list.next == NULL) {
957 px->next = free_list.next;
958 px->prev = &free_list;
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/ttm/
ttm_page_alloc_dma.c 86 * @lock: Protects the free_list from concurrnet access. Must be
89 * @free_list: Pool of pages that are free to be used. No order requirements.
105 struct list_head free_list; member in struct:dma_pool
439 list_for_each_entry_safe_reverse(dma_p, tmp, &pool->free_list,
592 INIT_LIST_HEAD(&pool->free_list);
811 list_splice(&d_pages, &pool->free_list);
825 list_splice_tail(&d_pages, &pool->free_list);
850 d_page = list_first_entry(&pool->free_list, struct dma_page, page_list);
1064 list_splice(&ttm_dma->pages_list, &pool->free_list);
ttm_page_alloc_dma.c 86 * @lock: Protects the free_list from concurrnet access. Must be
89 * @free_list: Pool of pages that are free to be used. No order requirements.
105 struct list_head free_list; member in struct:dma_pool
439 list_for_each_entry_safe_reverse(dma_p, tmp, &pool->free_list,
592 INIT_LIST_HEAD(&pool->free_list);
811 list_splice(&d_pages, &pool->free_list);
825 list_splice_tail(&d_pages, &pool->free_list);
850 d_page = list_first_entry(&pool->free_list, struct dma_page, page_list);
1064 list_splice(&ttm_dma->pages_list, &pool->free_list);

Completed in 111 milliseconds

1 2