Home
last modified time | relevance | path

Searched refs:array (Results 1 - 25 of 688) sorted by relevance

12345678910>>...28

/kernel/linux/linux-6.6/drivers/dma-buf/
H A Ddma-fence-array.c3 * dma-fence-array: aggregate fences to be waited together
14 #include <linux/dma-fence-array.h>
28 static void dma_fence_array_set_pending_error(struct dma_fence_array *array, in dma_fence_array_set_pending_error() argument
36 cmpxchg(&array->base.error, PENDING_ERROR, error); in dma_fence_array_set_pending_error()
39 static void dma_fence_array_clear_pending_error(struct dma_fence_array *array) in dma_fence_array_clear_pending_error() argument
42 cmpxchg(&array->base.error, PENDING_ERROR, 0); in dma_fence_array_clear_pending_error()
47 struct dma_fence_array *array = container_of(wrk, typeof(*array), work); in irq_dma_fence_array_work() local
49 dma_fence_array_clear_pending_error(array); in irq_dma_fence_array_work()
51 dma_fence_signal(&array in irq_dma_fence_array_work()
60 struct dma_fence_array *array = array_cb->array; dma_fence_array_cb_func() local
72 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_array_enable_signaling() local
105 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_array_signaled() local
116 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_array_release() local
129 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_array_set_deadline() local
170 struct dma_fence_array *array; dma_fence_array_create() local
221 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_match_context() local
238 struct dma_fence_array *array; dma_fence_array_first() local
257 struct dma_fence_array *array = to_dma_fence_array(head); dma_fence_array_next() local
[all...]
H A Ddma-fence-unwrap.c11 #include <linux/dma-fence-array.h>
16 /* Internal helper to start new array iteration, don't use directly */
20 cursor->array = dma_fence_chain_contained(cursor->chain); in __dma_fence_unwrap_array()
22 return dma_fence_array_first(cursor->array); in __dma_fence_unwrap_array()
53 tmp = dma_fence_array_next(cursor->array, cursor->index); in dma_fence_unwrap_next()
68 struct dma_fence *tmp, **array; in __dma_fence_unwrap_merge() local
95 array = kmalloc_array(count, sizeof(*array), GFP_KERNEL); in __dma_fence_unwrap_merge()
96 if (!array) in __dma_fence_unwrap_merge()
100 * This trashes the input fence array an in __dma_fence_unwrap_merge()
[all...]
/kernel/linux/linux-5.10/drivers/misc/vmw_vmci/
H A Dvmci_handle_array.c19 struct vmci_handle_arr *array; in vmci_handle_arr_create() local
28 array = kmalloc(handle_arr_calc_size(capacity), GFP_ATOMIC); in vmci_handle_arr_create()
29 if (!array) in vmci_handle_arr_create()
32 array->capacity = capacity; in vmci_handle_arr_create()
33 array->max_capacity = max_capacity; in vmci_handle_arr_create()
34 array->size = 0; in vmci_handle_arr_create()
36 return array; in vmci_handle_arr_create()
39 void vmci_handle_arr_destroy(struct vmci_handle_arr *array) in vmci_handle_arr_destroy() argument
41 kfree(array); in vmci_handle_arr_destroy()
47 struct vmci_handle_arr *array in vmci_handle_arr_append_entry() local
77 vmci_handle_arr_remove_entry(struct vmci_handle_arr *array, struct vmci_handle entry_handle) vmci_handle_arr_remove_entry() argument
99 vmci_handle_arr_remove_tail(struct vmci_handle_arr *array) vmci_handle_arr_remove_tail() argument
116 vmci_handle_arr_get_entry(const struct vmci_handle_arr *array, u32 index) vmci_handle_arr_get_entry() argument
124 vmci_handle_arr_has_entry(const struct vmci_handle_arr *array, struct vmci_handle entry_handle) vmci_handle_arr_has_entry() argument
140 vmci_handle_arr_get_handles(struct vmci_handle_arr *array) vmci_handle_arr_get_handles() argument
[all...]
H A Dvmci_handle_array.h25 /* Select a default capacity that results in a 64 byte sized array */
27 /* Make sure that the max array size can be expressed by a u32 */
33 void vmci_handle_arr_destroy(struct vmci_handle_arr *array);
36 struct vmci_handle vmci_handle_arr_remove_entry(struct vmci_handle_arr *array,
39 struct vmci_handle vmci_handle_arr_remove_tail(struct vmci_handle_arr *array);
41 vmci_handle_arr_get_entry(const struct vmci_handle_arr *array, u32 index);
42 bool vmci_handle_arr_has_entry(const struct vmci_handle_arr *array,
44 struct vmci_handle *vmci_handle_arr_get_handles(struct vmci_handle_arr *array);
47 const struct vmci_handle_arr *array) in vmci_handle_arr_get_size()
49 return array in vmci_handle_arr_get_size()
46 vmci_handle_arr_get_size( const struct vmci_handle_arr *array) vmci_handle_arr_get_size() argument
[all...]
/kernel/linux/linux-6.6/drivers/misc/vmw_vmci/
H A Dvmci_handle_array.c19 struct vmci_handle_arr *array; in vmci_handle_arr_create() local
28 array = kmalloc(handle_arr_calc_size(capacity), GFP_ATOMIC); in vmci_handle_arr_create()
29 if (!array) in vmci_handle_arr_create()
32 array->capacity = capacity; in vmci_handle_arr_create()
33 array->max_capacity = max_capacity; in vmci_handle_arr_create()
34 array->size = 0; in vmci_handle_arr_create()
36 return array; in vmci_handle_arr_create()
39 void vmci_handle_arr_destroy(struct vmci_handle_arr *array) in vmci_handle_arr_destroy() argument
41 kfree(array); in vmci_handle_arr_destroy()
47 struct vmci_handle_arr *array in vmci_handle_arr_append_entry() local
77 vmci_handle_arr_remove_entry(struct vmci_handle_arr *array, struct vmci_handle entry_handle) vmci_handle_arr_remove_entry() argument
99 vmci_handle_arr_remove_tail(struct vmci_handle_arr *array) vmci_handle_arr_remove_tail() argument
116 vmci_handle_arr_get_entry(const struct vmci_handle_arr *array, u32 index) vmci_handle_arr_get_entry() argument
124 vmci_handle_arr_has_entry(const struct vmci_handle_arr *array, struct vmci_handle entry_handle) vmci_handle_arr_has_entry() argument
140 vmci_handle_arr_get_handles(struct vmci_handle_arr *array) vmci_handle_arr_get_handles() argument
[all...]
H A Dvmci_handle_array.h25 /* Select a default capacity that results in a 64 byte sized array */
27 /* Make sure that the max array size can be expressed by a u32 */
33 void vmci_handle_arr_destroy(struct vmci_handle_arr *array);
36 struct vmci_handle vmci_handle_arr_remove_entry(struct vmci_handle_arr *array,
39 struct vmci_handle vmci_handle_arr_remove_tail(struct vmci_handle_arr *array);
41 vmci_handle_arr_get_entry(const struct vmci_handle_arr *array, u32 index);
42 bool vmci_handle_arr_has_entry(const struct vmci_handle_arr *array,
44 struct vmci_handle *vmci_handle_arr_get_handles(struct vmci_handle_arr *array);
47 const struct vmci_handle_arr *array) in vmci_handle_arr_get_size()
49 return array in vmci_handle_arr_get_size()
46 vmci_handle_arr_get_size( const struct vmci_handle_arr *array) vmci_handle_arr_get_size() argument
[all...]
/kernel/linux/linux-5.10/drivers/dma-buf/
H A Ddma-fence-array.c3 * dma-fence-array: aggregate fences to be waited together
14 #include <linux/dma-fence-array.h>
28 static void dma_fence_array_set_pending_error(struct dma_fence_array *array, in dma_fence_array_set_pending_error() argument
36 cmpxchg(&array->base.error, PENDING_ERROR, error); in dma_fence_array_set_pending_error()
39 static void dma_fence_array_clear_pending_error(struct dma_fence_array *array) in dma_fence_array_clear_pending_error() argument
42 cmpxchg(&array->base.error, PENDING_ERROR, 0); in dma_fence_array_clear_pending_error()
47 struct dma_fence_array *array = container_of(wrk, typeof(*array), work); in irq_dma_fence_array_work() local
49 dma_fence_array_clear_pending_error(array); in irq_dma_fence_array_work()
51 dma_fence_signal(&array in irq_dma_fence_array_work()
60 struct dma_fence_array *array = array_cb->array; dma_fence_array_cb_func() local
72 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_array_enable_signaling() local
105 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_array_signaled() local
116 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_array_release() local
159 struct dma_fence_array *array; dma_fence_array_create() local
194 struct dma_fence_array *array = to_dma_fence_array(fence); dma_fence_match_context() local
[all...]
/kernel/linux/linux-6.6/fs/xfs/scrub/
H A Dxfarray.c19 * This memory array uses an xfile (which itself is a memfd "file") to store
22 * because we don't have to pin so much memory. However, array access is less
23 * direct than would be in a regular memory array. Access to the array is
34 * buffer array items when we need space to store values temporarily.
36 static inline void *xfarray_scratch(struct xfarray *array) in xfarray_scratch() argument
38 return (array + 1); in xfarray_scratch()
41 /* Compute array index given an xfile offset. */
44 struct xfarray *array, in xfarray_idx()
47 if (array in xfarray_idx()
43 xfarray_idx( struct xfarray *array, loff_t pos) xfarray_idx() argument
54 xfarray_pos(struct xfarray *array, xfarray_idx_t idx) xfarray_pos() argument
76 struct xfarray *array; xfarray_create() local
122 xfarray_destroy( struct xfarray *array) xfarray_destroy() argument
131 xfarray_load( struct xfarray *array, xfarray_idx_t idx, void *ptr) xfarray_load() argument
145 xfarray_is_unset( struct xfarray *array, loff_t pos) xfarray_is_unset() argument
167 xfarray_unset( struct xfarray *array, xfarray_idx_t idx) xfarray_unset() argument
200 xfarray_store( struct xfarray *array, xfarray_idx_t idx, const void *ptr) xfarray_store() argument
223 xfarray_element_is_null( struct xfarray *array, const void *ptr) xfarray_element_is_null() argument
235 xfarray_store_anywhere( struct xfarray *array, const void *ptr) xfarray_store_anywhere() argument
269 xfarray_length( struct xfarray *array) xfarray_length() argument
286 xfarray_find_data( struct xfarray *array, xfarray_idx_t *cur, loff_t *pos) xfarray_find_data() argument
339 xfarray_load_next( struct xfarray *array, xfarray_idx_t *idx, void *rec) xfarray_load_next() argument
432 xfarray_pivot_rec_sz( struct xfarray *array) xfarray_pivot_rec_sz() argument
440 xfarray_sortinfo_alloc( struct xfarray *array, xfarray_cmp_fn cmp_fn, unsigned int flags, struct xfarray_sortinfo **infop) xfarray_sortinfo_alloc() argument
930 xfarray_sort( struct xfarray *array, xfarray_cmp_fn cmp_fn, unsigned int flags) xfarray_sort() argument
[all...]
H A Dxfarray.h9 /* xfile array index type, along with cursor initialization */
13 /* Iterate each index of an xfile array. */
14 #define foreach_xfarray_idx(array, idx) \
16 (idx) < xfarray_length(array); \
20 /* Underlying file that backs the array. */
23 /* Number of array elements. */
26 /* Maximum possible array size. */
29 /* Number of unset slots in the array below @nr. */
32 /* Size of an array element. */
35 /* log2 of array elemen
49 xfarray_append(struct xfarray *array, const void *ptr) xfarray_append() argument
69 struct xfarray *array; global() member
[all...]
/kernel/linux/linux-5.10/sound/hda/
H A Darray.c11 * snd_array_new - get a new element from the given array
12 * @array: the array object
14 * Get a new element from the given array. If it exceeds the
15 * pre-allocated array size, re-allocate the array.
19 void *snd_array_new(struct snd_array *array) in snd_array_new() argument
21 if (snd_BUG_ON(!array->elem_size)) in snd_array_new()
23 if (array->used >= array in snd_array_new()
45 snd_array_free(struct snd_array *array) snd_array_free() argument
[all...]
/kernel/linux/linux-6.6/sound/hda/
H A Darray.c11 * snd_array_new - get a new element from the given array
12 * @array: the array object
14 * Get a new element from the given array. If it exceeds the
15 * pre-allocated array size, re-allocate the array.
19 void *snd_array_new(struct snd_array *array) in snd_array_new() argument
21 if (snd_BUG_ON(!array->elem_size)) in snd_array_new()
23 if (array->used >= array in snd_array_new()
45 snd_array_free(struct snd_array *array) snd_array_free() argument
[all...]
/kernel/linux/linux-6.6/kernel/bpf/
H A Darraymap.c22 static void bpf_array_free_percpu(struct bpf_array *array) in bpf_array_free_percpu() argument
26 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_free_percpu()
27 free_percpu(array->pptrs[i]); in bpf_array_free_percpu()
32 static int bpf_array_alloc_percpu(struct bpf_array *array) in bpf_array_alloc_percpu() argument
37 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_alloc_percpu()
38 ptr = bpf_map_alloc_percpu(&array->map, array->elem_size, 8, in bpf_array_alloc_percpu()
41 bpf_array_free_percpu(array); in bpf_array_alloc_percpu()
44 array->pptrs[i] = ptr; in bpf_array_alloc_percpu()
87 struct bpf_array *array; in array_map_alloc() local
157 array_map_elem_ptr(struct bpf_array* array, u32 index) array_map_elem_ptr() argument
165 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_lookup_elem() local
177 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_direct_value_addr() local
191 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_direct_value_meta() local
207 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_gen_lookup() local
240 struct bpf_array *array = container_of(map, struct bpf_array, map); percpu_array_map_lookup_elem() local
251 struct bpf_array *array = container_of(map, struct bpf_array, map); percpu_array_map_lookup_percpu_elem() local
265 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_percpu_array_copy() local
293 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_get_next_key() local
313 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_update_elem() local
352 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_percpu_array_update() local
394 array_map_vmalloc_addr(struct bpf_array *array) array_map_vmalloc_addr() argument
401 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_free_timers() local
415 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_free() local
468 struct bpf_array *array = container_of(map, struct bpf_array, map); percpu_array_map_seq_show_elem() local
522 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_mmap() local
555 struct bpf_array *array; bpf_array_map_seq_start() local
574 struct bpf_array *array; bpf_array_map_seq_next() local
594 struct bpf_array *array = container_of(map, struct bpf_array, map); __bpf_array_map_seq_show() local
645 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_iter_init_array_map() local
693 struct bpf_array *array; bpf_for_each_array_elem() local
726 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_mem_usage() local
806 struct bpf_array *array = container_of(map, struct bpf_array, map); fd_array_map_free() local
845 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_fd_array_map_update_elem() local
876 struct bpf_array *array = container_of(map, struct bpf_array, map); __fd_array_map_delete_elem() local
935 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_fd_array_map_clear() local
1219 struct bpf_array *array = container_of(map, struct bpf_array, map); perf_event_fd_array_release() local
1336 struct bpf_array *array = container_of(map, struct bpf_array, map); array_of_map_gen_lookup() local
[all...]
H A Dreuseport_array.c52 struct reuseport_array *array = reuseport_array(map); in reuseport_array_lookup_elem() local
55 if (unlikely(index >= array->map.max_entries)) in reuseport_array_lookup_elem()
58 return rcu_dereference(array->ptrs[index]); in reuseport_array_lookup_elem()
64 struct reuseport_array *array = reuseport_array(map); in reuseport_array_delete_elem() local
72 if (!rcu_access_pointer(array->ptrs[index])) in reuseport_array_delete_elem()
77 sk = rcu_dereference_protected(array->ptrs[index], in reuseport_array_delete_elem()
82 RCU_INIT_POINTER(array->ptrs[index], NULL); in reuseport_array_delete_elem()
96 struct reuseport_array *array = reuseport_array(map); in reuseport_array_free() local
102 * array now. Hence, this function only races with in reuseport_array_free()
107 * both removing sk from "array" in reuseport_array_free()
152 struct reuseport_array *array; reuseport_array_alloc() local
188 reuseport_array_update_check(const struct reuseport_array *array, const struct sock *nsk, const struct sock *osk, const struct sock_reuseport *nsk_reuse, u32 map_flags) reuseport_array_update_check() argument
235 struct reuseport_array *array = reuseport_array(map); bpf_fd_reuseport_array_update_elem() local
319 struct reuseport_array *array = reuseport_array(map); reuseport_array_get_next_key() local
337 struct reuseport_array *array; reuseport_array_mem_usage() local
[all...]
/kernel/linux/linux-5.10/kernel/bpf/
H A Darraymap.c21 static void bpf_array_free_percpu(struct bpf_array *array) in bpf_array_free_percpu() argument
25 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_free_percpu()
26 free_percpu(array->pptrs[i]); in bpf_array_free_percpu()
31 static int bpf_array_alloc_percpu(struct bpf_array *array) in bpf_array_alloc_percpu() argument
36 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_alloc_percpu()
37 ptr = __alloc_percpu_gfp(array->elem_size, 8, in bpf_array_alloc_percpu()
40 bpf_array_free_percpu(array); in bpf_array_alloc_percpu()
43 array->pptrs[i] = ptr; in bpf_array_alloc_percpu()
89 struct bpf_array *array; in array_map_alloc() local
105 /* round up array siz in array_map_alloc()
177 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_lookup_elem() local
189 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_direct_value_addr() local
203 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_direct_value_meta() local
219 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_gen_lookup() local
252 struct bpf_array *array = container_of(map, struct bpf_array, map); percpu_array_map_lookup_elem() local
263 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_percpu_array_copy() local
290 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_get_next_key() local
310 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_update_elem() local
347 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_percpu_array_update() local
388 array_map_vmalloc_addr(struct bpf_array *array) array_map_vmalloc_addr() argument
396 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_free() local
431 struct bpf_array *array = container_of(map, struct bpf_array, map); percpu_array_map_seq_show_elem() local
485 struct bpf_array *array = container_of(map, struct bpf_array, map); array_map_mmap() local
518 struct bpf_array *array; bpf_array_map_seq_start() local
537 struct bpf_array *array; bpf_array_map_seq_next() local
703 struct bpf_array *array = container_of(map, struct bpf_array, map); fd_array_map_free() local
742 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_fd_array_map_update_elem() local
773 struct bpf_array *array = container_of(map, struct bpf_array, map); fd_array_map_delete_elem() local
800 struct bpf_array *array = container_of(map, struct bpf_array, map); prog_fd_array_get_ptr() local
828 struct bpf_array *array = container_of(map, struct bpf_array, map); bpf_fd_array_map_clear() local
1152 struct bpf_array *array = container_of(map, struct bpf_array, map); perf_event_fd_array_release() local
1271 struct bpf_array *array = container_of(map, struct bpf_array, map); array_of_map_gen_lookup() local
[all...]
H A Dreuseport_array.c54 struct reuseport_array *array = reuseport_array(map); in reuseport_array_lookup_elem() local
57 if (unlikely(index >= array->map.max_entries)) in reuseport_array_lookup_elem()
60 return rcu_dereference(array->ptrs[index]); in reuseport_array_lookup_elem()
66 struct reuseport_array *array = reuseport_array(map); in reuseport_array_delete_elem() local
74 if (!rcu_access_pointer(array->ptrs[index])) in reuseport_array_delete_elem()
79 sk = rcu_dereference_protected(array->ptrs[index], in reuseport_array_delete_elem()
84 RCU_INIT_POINTER(array->ptrs[index], NULL); in reuseport_array_delete_elem()
98 struct reuseport_array *array = reuseport_array(map); in reuseport_array_free() local
104 * array now. Hence, this function only races with in reuseport_array_free()
109 * both removing sk from "array" in reuseport_array_free()
154 struct reuseport_array *array; reuseport_array_alloc() local
205 reuseport_array_update_check(const struct reuseport_array *array, const struct sock *nsk, const struct sock *osk, const struct sock_reuseport *nsk_reuse, u32 map_flags) reuseport_array_update_check() argument
252 struct reuseport_array *array = reuseport_array(map); bpf_fd_reuseport_array_update_elem() local
336 struct reuseport_array *array = reuseport_array(map); reuseport_array_get_next_key() local
[all...]
/kernel/linux/linux-5.10/drivers/infiniband/hw/mthca/
H A Dmthca_allocator.c113 * serialize access to the array.
118 void *mthca_array_get(struct mthca_array *array, int index) in mthca_array_get() argument
122 if (array->page_list[p].page) in mthca_array_get()
123 return array->page_list[p].page[index & MTHCA_ARRAY_MASK]; in mthca_array_get()
128 int mthca_array_set(struct mthca_array *array, int index, void *value) in mthca_array_set() argument
133 if (!array->page_list[p].page) in mthca_array_set()
134 array->page_list[p].page = (void **) get_zeroed_page(GFP_ATOMIC); in mthca_array_set()
136 if (!array->page_list[p].page) in mthca_array_set()
139 array->page_list[p].page[index & MTHCA_ARRAY_MASK] = value; in mthca_array_set()
140 ++array in mthca_array_set()
145 mthca_array_clear(struct mthca_array *array, int index) mthca_array_clear() argument
160 mthca_array_init(struct mthca_array *array, int nent) mthca_array_init() argument
178 mthca_array_cleanup(struct mthca_array *array, int nent) mthca_array_cleanup() argument
[all...]
/kernel/linux/linux-6.6/drivers/infiniband/hw/mthca/
H A Dmthca_allocator.c108 * serialize access to the array.
113 void *mthca_array_get(struct mthca_array *array, int index) in mthca_array_get() argument
117 if (array->page_list[p].page) in mthca_array_get()
118 return array->page_list[p].page[index & MTHCA_ARRAY_MASK]; in mthca_array_get()
123 int mthca_array_set(struct mthca_array *array, int index, void *value) in mthca_array_set() argument
128 if (!array->page_list[p].page) in mthca_array_set()
129 array->page_list[p].page = (void **) get_zeroed_page(GFP_ATOMIC); in mthca_array_set()
131 if (!array->page_list[p].page) in mthca_array_set()
134 array->page_list[p].page[index & MTHCA_ARRAY_MASK] = value; in mthca_array_set()
135 ++array in mthca_array_set()
140 mthca_array_clear(struct mthca_array *array, int index) mthca_array_clear() argument
155 mthca_array_init(struct mthca_array *array, int nent) mthca_array_init() argument
173 mthca_array_cleanup(struct mthca_array *array, int nent) mthca_array_cleanup() argument
[all...]
/kernel/linux/linux-5.10/arch/s390/tools/
H A Dgen_facilities.c126 unsigned long long *array; in print_facility_list() local
128 array = calloc(1, 8); in print_facility_list()
129 if (!array) in print_facility_list()
136 array = realloc(array, (dword + 1) * 8); in print_facility_list()
137 if (!array) in print_facility_list()
139 memset(array + high + 1, 0, (dword - high) * 8); in print_facility_list()
142 array[dword] |= 1ULL << bit; in print_facility_list()
146 printf("_AC(0x%016llx,UL)%c", array[i], i < high ? ',' : '\n'); in print_facility_list()
147 free(array); in print_facility_list()
[all...]
/kernel/linux/linux-6.6/arch/s390/tools/
H A Dgen_facilities.c123 unsigned long long *array; in print_facility_list() local
125 array = calloc(1, 8); in print_facility_list()
126 if (!array) in print_facility_list()
133 array = realloc(array, (dword + 1) * 8); in print_facility_list()
134 if (!array) in print_facility_list()
136 memset(array + high + 1, 0, (dword - high) * 8); in print_facility_list()
139 array[dword] |= 1ULL << bit; in print_facility_list()
143 printf("_AC(0x%016llx,UL)%c", array[i], i < high ? ',' : '\n'); in print_facility_list()
144 free(array); in print_facility_list()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dassoc_array.h2 /* Generic associative array implementation.
20 * Generic associative array.
28 * Operations on objects and index keys for use by array manipulation routines.
54 static inline void assoc_array_init(struct assoc_array *array) in assoc_array_init() argument
56 array->root = NULL; in assoc_array_init()
57 array->nr_leaves_on_tree = 0; in assoc_array_init()
60 extern int assoc_array_iterate(const struct assoc_array *array,
64 extern void *assoc_array_find(const struct assoc_array *array,
67 extern void assoc_array_destroy(struct assoc_array *array,
69 extern struct assoc_array_edit *assoc_array_insert(struct assoc_array *array,
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dassoc_array.h2 /* Generic associative array implementation.
20 * Generic associative array.
28 * Operations on objects and index keys for use by array manipulation routines.
54 static inline void assoc_array_init(struct assoc_array *array) in assoc_array_init() argument
56 array->root = NULL; in assoc_array_init()
57 array->nr_leaves_on_tree = 0; in assoc_array_init()
60 extern int assoc_array_iterate(const struct assoc_array *array,
64 extern void *assoc_array_find(const struct assoc_array *array,
67 extern void assoc_array_destroy(struct assoc_array *array,
69 extern struct assoc_array_edit *assoc_array_insert(struct assoc_array *array,
[all...]
/kernel/linux/linux-5.10/drivers/ras/
H A Dcec.c22 * array of the size of a memory page. It stores 512 u64's with the following
34 * and thus iterating over the array initially won't kick out those elements
38 * elements entered into the array, during which, we're decaying all elements.
68 * elements have stayed in the array without having been accessed again.
95 u64 *array; /* container page */ member
96 unsigned int n; /* number of elements in the array */
140 * element in the array. On insertion and any access, it gets reset to max.
147 u8 decay = DECAY(ca->array[i]); in do_spring_cleaning()
154 ca->array[i] &= ~(DECAY_MASK << COUNT_BITS); in do_spring_cleaning()
155 ca->array[ in do_spring_cleaning()
479 DEFINE_SHOW_ATTRIBUTE(array); global() variable
483 struct dentry *d, *pfn, *decay, *count, *array; create_debugfs_nodes() local
[all...]
/kernel/linux/linux-6.6/drivers/ras/
H A Dcec.c22 * array of the size of a memory page. It stores 512 u64's with the following
34 * and thus iterating over the array initially won't kick out those elements
38 * elements entered into the array, during which, we're decaying all elements.
68 * elements have stayed in the array without having been accessed again.
95 u64 *array; /* container page */ member
96 unsigned int n; /* number of elements in the array */
140 * element in the array. On insertion and any access, it gets reset to max.
147 u8 decay = DECAY(ca->array[i]); in do_spring_cleaning()
154 ca->array[i] &= ~(DECAY_MASK << COUNT_BITS); in do_spring_cleaning()
155 ca->array[ in do_spring_cleaning()
479 DEFINE_SHOW_ATTRIBUTE(array); global() variable
483 struct dentry *d, *pfn, *decay, *count, *array; create_debugfs_nodes() local
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Devsel.c162 * PERF_SAMPLE_IDENTIFIER) in a sample event i.e. in the array of struct
2201 const __u64 *array = event->sample.array; in perf_evsel__parse_id_sample() local
2205 array += ((event->header.size - in perf_evsel__parse_id_sample()
2209 sample->id = *array; in perf_evsel__parse_id_sample()
2210 array--; in perf_evsel__parse_id_sample()
2214 u.val64 = *array; in perf_evsel__parse_id_sample()
2222 array--; in perf_evsel__parse_id_sample()
2226 sample->stream_id = *array; in perf_evsel__parse_id_sample()
2227 array in perf_evsel__parse_id_sample()
2286 arch_perf_parse_sample_weight(struct perf_sample *data, const __u64 *array, u64 type __maybe_unused) arch_perf_parse_sample_weight() argument
2352 const __u64 *array; evsel__parse_sample() local
2697 const __u64 *array; evsel__parse_sample_timestamp() local
[all...]
/kernel/linux/linux-5.10/drivers/scsi/isci/
H A Dunsolicited_frame_control.c85 uf_control->headers.array = virt + SCI_UFI_BUF_SIZE; in sci_unsolicited_frame_control_construct()
95 uf_control->address_table.array = virt + SCI_UFI_BUF_SIZE + SCI_UFI_HDR_SIZE; in sci_unsolicited_frame_control_construct()
107 * the controller's array of UFs. in sci_unsolicited_frame_control_construct()
110 uf = &uf_control->buffers.array[i]; in sci_unsolicited_frame_control_construct()
112 uf_control->address_table.array[i] = dma; in sci_unsolicited_frame_control_construct()
115 uf->header = &uf_control->headers.array[i]; in sci_unsolicited_frame_control_construct()
136 *frame_header = &uf_control->buffers.array[frame_index].header->data; in sci_unsolicited_frame_control_get_header()
149 *frame_buffer = uf_control->buffers.array[frame_index].buffer; in sci_unsolicited_frame_control_get_buffer()
171 while (lower_32_bits(uf_control->address_table.array[frame_get]) == 0 && in sci_unsolicited_frame_control_release_frame()
172 upper_32_bits(uf_control->address_table.array[frame_ge in sci_unsolicited_frame_control_release_frame()
[all...]

Completed in 15 milliseconds

12345678910>>...28