Searched refs:freelist (Results 1 - 25 of 31) sorted by last modified time

12

/linux-master/drivers/iommu/intel/
H A Diommu.c1032 struct list_head *freelist)
1037 list_add_tail(&pg->lru, freelist);
1045 dma_pte_list_pagetables(domain, level - 1, pte, freelist);
1053 struct list_head *freelist)
1072 dma_pte_list_pagetables(domain, level - 1, pte, freelist);
1083 freelist);
1098 unsigned long last_pfn, struct list_head *freelist)
1106 domain->pgd, 0, start_pfn, last_pfn, freelist);
1111 list_add_tail(&pgd_page->lru, freelist);
1841 LIST_HEAD(freelist);
1030 dma_pte_list_pagetables(struct dmar_domain *domain, int level, struct dma_pte *pte, struct list_head *freelist) argument
1050 dma_pte_clear_level(struct dmar_domain *domain, int level, struct dma_pte *pte, unsigned long pfn, unsigned long start_pfn, unsigned long last_pfn, struct list_head *freelist) argument
1097 domain_unmap(struct dmar_domain *domain, unsigned long start_pfn, unsigned long last_pfn, struct list_head *freelist) argument
[all...]
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dptp.h119 struct mlx5e_ptp_metadata_fifo *freelist; local
124 freelist = &ptpsq->metadata_freelist;
126 return freelist->pc == freelist->cc;
/linux-master/fs/bcachefs/
H A Dalloc_types.h51 open_bucket_idx_t freelist; member in struct:open_bucket
H A Dalloc_foreground.c5 * Foreground allocator code: allocate buckets from freelist, and allocate in
122 ob->freelist = c->open_buckets_freelist;
151 c->open_buckets_freelist = ob->freelist;
1502 ob->freelist = c->open_buckets_freelist;
/linux-master/drivers/iommu/
H A Ddma-iommu.c115 struct list_head freelist; member in struct:iova_fq_entry
159 put_pages_list(&fq->entries[idx].freelist);
202 struct list_head *freelist)
241 list_splice(freelist, &fq->entries[idx].freelist);
257 put_pages_list(&fq->entries[idx].freelist);
270 put_pages_list(&fq->entries[idx].freelist);
299 INIT_LIST_HEAD(&fq->entries[i].freelist);
820 &gather->freelist);
200 queue_iova(struct iommu_dma_cookie *cookie, unsigned long pfn, unsigned long pages, struct list_head *freelist) argument
/linux-master/mm/
H A Dcompaction.c603 * Isolate free pages onto a private freelist. If @strict is true, will abort
610 struct list_head *freelist,
684 list_add_tail(&page->lru, &freelist[order]);
1487 move_freelist_head(struct list_head *freelist, struct page *freepage) argument
1491 if (!list_is_first(&freepage->buddy_list, freelist)) {
1492 list_cut_before(&sublist, freelist, &freepage->buddy_list);
1493 list_splice_tail(&sublist, freelist);
1504 move_freelist_tail(struct list_head *freelist, struct page *freepage) argument
1508 if (!list_is_last(&freepage->buddy_list, freelist)) {
1509 list_cut_position(&sublist, freelist,
607 isolate_freepages_block(struct compact_control *cc, unsigned long *start_pfn, unsigned long end_pfn, struct list_head *freelist, unsigned int stride, bool strict) argument
1606 struct list_head *freelist; local
2035 struct list_head *freelist; local
[all...]
H A Dslub.c73 * A. slab->freelist -> List of free objects in a slab
84 * processors may put objects onto the freelist but the processor that
86 * slab's freelist.
129 * taken but it still utilizes the freelist for the common operations.
176 * freelist that allows lockless access to
177 * free objects in addition to the regular freelist
359 ALLOC_REFILL, /* Refill cpu slab from slab freelist */
371 CMPXCHG_DOUBLE_FAIL, /* Failures of slab freelist update */
381 * When changing the layout, make sure freelist and tid are still compatible
387 void **freelist; /* Pointe member in struct:kmem_cache_cpu::__anon2924::__anon2925
1100 freelist_corrupted(struct kmem_cache *s, struct slab *slab, void **freelist, void *nextfree) argument
1860 freelist_corrupted(struct kmem_cache *s, struct slab *slab, void **freelist, void *nextfree) argument
2789 deactivate_slab(struct kmem_cache *s, struct slab *slab, void *freelist) argument
2998 void *freelist; local
3020 void *freelist = c->freelist; local
3304 void *freelist; local
3332 void *freelist; local
3374 void *freelist; local
4217 void **freelist; local
4397 void *freelist; member in struct:detached_freelist
[all...]
H A Dslab.h45 void *freelist; member in struct:__anon2914::__anon2915
70 void *freelist; /* first free object */ member in struct:slab::__anon2916::__anon2917::__anon2920::__anon2921
106 static_assert(IS_ALIGNED(offsetof(struct slab, freelist), sizeof(freelist_aba_t)));
591 * If we have the need to store the freelist pointer
/linux-master/include/linux/
H A Diommu.h329 * @freelist: Removed pages to free after sync
334 * into ->iotlb_sync(). Drivers can add pages to @freelist to be freed after
343 struct list_head freelist; member in struct:iommu_iotlb_gather
771 .freelist = LIST_HEAD_INIT(gather->freelist),
/linux-master/drivers/md/
H A Ddm-writecache.c113 struct list_head freelist; member in union:dm_writecache::__anon766
696 list_add_tail(&e->lru, &wc->freelist);
735 if (unlikely(list_empty(&wc->freelist)))
737 e = container_of(wc->freelist.next, struct wc_entry, lru);
778 wc->freelist.next = LIST_POISON1;
779 wc->freelist.prev = LIST_POISON2;
1028 INIT_LIST_HEAD(&wc->freelist);
/linux-master/arch/powerpc/kvm/
H A Dbook3s_hv_nested.c796 struct kvm_nested_guest *freelist = NULL; local
804 gp->next = freelist;
805 freelist = gp;
811 while ((gp = freelist) != NULL) {
812 freelist = gp->next;
/linux-master/kernel/bpf/
H A Dstackmap.c29 struct pcpu_freelist freelist; member in struct:bpf_stack_map
56 err = pcpu_freelist_init(&smap->freelist);
60 pcpu_freelist_populate(&smap->freelist, smap->elems, elem_size,
243 pcpu_freelist_pop(&smap->freelist);
253 pcpu_freelist_push(&smap->freelist, &new_bucket->fnode);
257 pcpu_freelist_push(&smap->freelist, &new_bucket->fnode);
268 pcpu_freelist_pop(&smap->freelist);
279 pcpu_freelist_push(&smap->freelist, &old_bucket->fnode);
597 pcpu_freelist_push(&smap->freelist, &old_bucket->fnode);
648 pcpu_freelist_push(&smap->freelist,
[all...]
H A Dhashtab.c94 struct pcpu_freelist freelist; member in union:bpf_htab::__anon2854
356 err = pcpu_freelist_init(&htab->freelist);
366 pcpu_freelist_populate(&htab->freelist,
384 pcpu_freelist_destroy(&htab->freelist);
399 l = pcpu_freelist_pop(&htab->freelist);
945 __pcpu_freelist_push(&htab->freelist, &l->fnode);
1020 l = __pcpu_freelist_pop(&htab->freelist);
H A Dpercpu_freelist.c10 s->freelist = alloc_percpu(struct pcpu_freelist_head);
11 if (!s->freelist)
15 struct pcpu_freelist_head *head = per_cpu_ptr(s->freelist, cpu);
27 free_percpu(s->freelist);
66 head = per_cpu_ptr(s->freelist, cpu);
86 ___pcpu_freelist_push(this_cpu_ptr(s->freelist), node);
110 head = per_cpu_ptr(s->freelist, cpu);
128 head = per_cpu_ptr(s->freelist, cpu);
160 head = per_cpu_ptr(s->freelist, cpu);
/linux-master/drivers/nvdimm/
H A Dbtt.c359 * It does _not_ prepare the freelist entry for the next write
360 * btt_flog_write is the wrapper for updating the freelist elements
393 arena->freelist[lane].sub = 1 - arena->freelist[lane].sub;
394 if (++(arena->freelist[lane].seq) == 4)
395 arena->freelist[lane].seq = 1;
397 arena->freelist[lane].has_err = 1;
398 arena->freelist[lane].block = ent_lba(le32_to_cpu(ent->old_map));
510 if (arena->freelist[lane].has_err) {
512 u32 lba = arena->freelist[lan
[all...]
/linux-master/drivers/md/bcache/
H A Dbcache.h246 DECLARE_ARRAY_ALLOCATOR(struct keybuf_key, freelist, KEYBUF_NR);
H A Dwriteback.c683 if (array_freelist_empty(&buf->freelist))
719 if (array_freelist_empty(&buf->freelist))
H A Dbtree.c2132 * We need to put some unused buckets directly on the prio freelist in
2657 w = array_alloc(&buf->freelist);
2667 array_free(&buf->freelist, w);
2671 if (array_freelist_empty(&buf->freelist))
2724 array_free(&buf->freelist, w);
2810 array_allocator_init(&buf->freelist);
H A Dutil.h242 * freelist as a stack - allocating and freeing push and pop off the freelist.
247 type *freelist; \
253 typeof((array)->freelist) _ret = (array)->freelist; \
256 (array)->freelist = *((typeof((array)->freelist) *) _ret);\
263 typeof((array)->freelist) _ptr = ptr; \
265 *((typeof((array)->freelist) *) _ptr) = (array)->freelist; \
[all...]
/linux-master/drivers/iommu/amd/
H A Dio_pgtable.c77 static void free_pt_page(u64 *pt, struct list_head *freelist) argument
81 list_add_tail(&p->lru, freelist);
84 static void free_pt_lvl(u64 *pt, struct list_head *freelist, int lvl) argument
105 free_pt_lvl(p, freelist, lvl - 1);
107 free_pt_page(p, freelist);
110 free_pt_page(pt, freelist);
113 static void free_sub_pt(u64 *root, int mode, struct list_head *freelist) argument
120 free_pt_page(root, freelist);
127 free_pt_lvl(root, freelist, mode);
339 static void free_clear_pte(u64 *pte, u64 pteval, struct list_head *freelist) argument
[all...]
/linux-master/fs/jfs/
H A Djfs_dtree.c12 * directory entry slots initialized as a freelist
15 * from the freelist as required to store variable length data
17 * are returned to freelist.
1421 /* init freelist */
1423 rp->header.freelist = fsi;
1447 * initialize freelist of new right page
1563 * finalize freelist of new right page
1565 fsi = rp->header.freelist;
1774 * add old stbl region at head of freelist
1778 last = sp->header.freelist;
[all...]
/linux-master/lib/
H A Ddebugobjects.c464 HLIST_HEAD(freelist);
473 hlist_move_list(&db->list, &freelist);
477 hlist_for_each_entry_safe(obj, tmp, &freelist, node) {
/linux-master/net/core/
H A Dneighbour.c850 struct pneigh_entry *n, **np, *freelist = NULL; local
858 n->next = freelist;
859 freelist = n;
866 while ((n = freelist)) {
867 freelist = n->next;
/linux-master/drivers/net/ethernet/cavium/liquidio/
H A Docteon_device.c1046 struct list_head freelist, *temp, *tmp2; local
1048 INIT_LIST_HEAD(&freelist);
1058 list_move_tail(temp, &freelist);
1068 list_for_each_safe(temp, tmp2, &freelist) {
/linux-master/drivers/usb/musb/
H A Dcppi_dma.h95 struct cppi_descriptor *freelist; member in struct:cppi_channel

Completed in 856 milliseconds

12