Lines Matching +full:mem +full:- +full:array

1 // SPDX-License-Identifier: GPL-2.0
38 spin_lock_irq(&cma->lock); in cma_used_get()
39 *val = cma->count - cma->available_count; in cma_used_get()
40 spin_unlock_irq(&cma->lock); in cma_used_get()
55 spin_lock_irq(&cma->lock); in cma_maxchunk_get()
56 for (r = 0; r < cma->nranges; r++) { in cma_maxchunk_get()
57 cmr = &cma->ranges[r]; in cma_maxchunk_get()
59 for_each_clear_bitrange(start, end, cmr->bitmap, bitmap_maxno) in cma_maxchunk_get()
60 maxchunk = max(end - start, maxchunk); in cma_maxchunk_get()
62 spin_unlock_irq(&cma->lock); in cma_maxchunk_get()
63 *val = (u64)maxchunk << cma->order_per_bit; in cma_maxchunk_get()
69 static void cma_add_to_cma_mem_list(struct cma *cma, struct cma_mem *mem) in cma_add_to_cma_mem_list() argument
71 spin_lock(&cma->mem_head_lock); in cma_add_to_cma_mem_list()
72 hlist_add_head(&mem->node, &cma->mem_head); in cma_add_to_cma_mem_list()
73 spin_unlock(&cma->mem_head_lock); in cma_add_to_cma_mem_list()
78 struct cma_mem *mem = NULL; in cma_get_entry_from_list() local
80 spin_lock(&cma->mem_head_lock); in cma_get_entry_from_list()
81 if (!hlist_empty(&cma->mem_head)) { in cma_get_entry_from_list()
82 mem = hlist_entry(cma->mem_head.first, struct cma_mem, node); in cma_get_entry_from_list()
83 hlist_del_init(&mem->node); in cma_get_entry_from_list()
85 spin_unlock(&cma->mem_head_lock); in cma_get_entry_from_list()
87 return mem; in cma_get_entry_from_list()
92 struct cma_mem *mem = NULL; in cma_free_mem() local
95 mem = cma_get_entry_from_list(cma); in cma_free_mem()
96 if (mem == NULL) in cma_free_mem()
99 if (mem->n <= count) { in cma_free_mem()
100 cma_release(cma, mem->p, mem->n); in cma_free_mem()
101 count -= mem->n; in cma_free_mem()
102 kfree(mem); in cma_free_mem()
103 } else if (cma->order_per_bit == 0) { in cma_free_mem()
104 cma_release(cma, mem->p, count); in cma_free_mem()
105 mem->p += count; in cma_free_mem()
106 mem->n -= count; in cma_free_mem()
108 cma_add_to_cma_mem_list(cma, mem); in cma_free_mem()
111 cma_add_to_cma_mem_list(cma, mem); in cma_free_mem()
131 struct cma_mem *mem; in cma_alloc_mem() local
134 mem = kzalloc_obj(*mem); in cma_alloc_mem()
135 if (!mem) in cma_alloc_mem()
136 return -ENOMEM; in cma_alloc_mem()
140 kfree(mem); in cma_alloc_mem()
141 return -ENOMEM; in cma_alloc_mem()
144 mem->p = p; in cma_alloc_mem()
145 mem->n = count; in cma_alloc_mem()
147 cma_add_to_cma_mem_list(cma, mem); in cma_alloc_mem()
168 tmp = debugfs_create_dir(cma->name, root_dentry); in cma_debugfs_add_one()
172 debugfs_create_file("count", 0444, tmp, &cma->count, &cma_debugfs_fops); in cma_debugfs_add_one()
174 &cma->order_per_bit, &cma_debugfs_fops); in cma_debugfs_add_one()
179 for (r = 0; r < cma->nranges; r++) { in cma_debugfs_add_one()
180 cmr = &cma->ranges[r]; in cma_debugfs_add_one()
184 &cmr->base_pfn, &cma_debugfs_fops); in cma_debugfs_add_one()
185 cmr->dfs_bitmap.array = (u32 *)cmr->bitmap; in cma_debugfs_add_one()
186 cmr->dfs_bitmap.n_elements = in cma_debugfs_add_one()
190 &cmr->dfs_bitmap); in cma_debugfs_add_one()