Home
last modified time | relevance | path

Searched full:array (Results 1 – 25 of 4415) sorted by relevance

12345678910>>...177

/linux/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->base); in irq_dma_fence_array_work()
52 dma_fence_put(&array->base); in irq_dma_fence_array_work()
[all …]
H A Ddma-fence-unwrap.c11 #include <linux/dma-fence-array.h>
17 /* Internal helper to start new array iteration, don't use directly */
21 cursor->array = dma_fence_chain_contained(cursor->chain); in __dma_fence_unwrap_array()
23 return dma_fence_array_first(cursor->array); in __dma_fence_unwrap_array()
54 tmp = dma_fence_array_next(cursor->array, cursor->index); in dma_fence_unwrap_next()
83 * dma_fence_dedup_array - Sort and deduplicate an array of dma_fence pointers
84 * @fences: Array of dma_fence pointers to be deduplicated
85 * @num_fences: Number of entries in the @fences array
87 * Sorts the input array by context, then removes duplicate
90 * The array is modified in-place and unreferenced duplicate fences are released
[all …]
/linux/drivers/misc/vmw_vmci/
H A Dvmci_handle_array.c13 struct vmci_handle_arr *array; in vmci_handle_arr_create() local
22 array = kmalloc_flex(*array, entries, capacity, GFP_ATOMIC); in vmci_handle_arr_create()
23 if (!array) in vmci_handle_arr_create()
26 array->capacity = capacity; in vmci_handle_arr_create()
27 array->max_capacity = max_capacity; in vmci_handle_arr_create()
28 array->size = 0; in vmci_handle_arr_create()
30 return array; in vmci_handle_arr_create()
33 void vmci_handle_arr_destroy(struct vmci_handle_arr *array) in vmci_handle_arr_destroy() argument
35 kfree(array); in vmci_handle_arr_destroy()
41 struct vmci_handle_arr *array = *array_ptr; in vmci_handle_arr_append_entry() local
[all …]
/linux/fs/xfs/scrub/
H A Dxfarray.c19 * This memory array uses an xfile (which itself is a shmem 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
25 * provided for convenience. Array elements can be unset, which sets them to
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() argument
47 if (array->obj_size_log >= 0) in xfarray_idx()
[all …]
H A Dxfarray.h9 /* xfile array index type, along with cursor initialization */
14 /* Iterate each index of an xfile array. */
15 #define foreach_xfarray_idx(array, idx) \ argument
17 (idx) < xfarray_length(array); \
21 /* Underlying file that backs the array. */
24 /* Number of array elements. */
27 /* Maximum possible array size. */
30 /* Number of unset slots in the array below @nr. */
33 /* Size of an array element. */
36 /* log2 of array element size, if possible. */
[all …]
/linux/sound/hda/core/
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->alloced) { in snd_array_new()
24 int num = array->alloced + array->alloc_align; in snd_array_new()
25 int oldsize = array->alloced * array->elem_size; in snd_array_new()
26 int size = (num + 1) * array->elem_size; in snd_array_new()
[all …]
/linux/kernel/bpf/
H A Darraymap.c23 static void bpf_array_free_percpu(struct bpf_array *array) in bpf_array_free_percpu() argument
27 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_free_percpu()
28 free_percpu(array->pptrs[i]); in bpf_array_free_percpu()
33 static int bpf_array_alloc_percpu(struct bpf_array *array) in bpf_array_alloc_percpu() argument
38 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_alloc_percpu()
39 ptr = bpf_map_alloc_percpu(&array->map, array->elem_size, 8, in bpf_array_alloc_percpu()
42 bpf_array_free_percpu(array); in bpf_array_alloc_percpu()
45 array->pptrs[i] = ptr; in bpf_array_alloc_percpu()
91 struct bpf_array *array; in array_map_alloc() local
107 /* round up array size to nearest power of 2, in array_map_alloc()
[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". Who removes it in reuseport_array_free()
[all …]
/linux/drivers/md/persistent-data/
H A Ddm-array.h15 * The dm-array is a persistent version of an array. It packs the data
26 * size along with the array root in your encompassing data.
28 * Array entries are indexed via an unsigned integer starting from zero.
29 * Arrays are not sparse; if you resize an array to have 'n' entries then
34 * a) initialise a dm_array_info structure. This describes the array
40 * disk that holds a particular instance of an array. You may have a
42 * want to create a brand new, empty array with dm_array_empty().
46 * root for a _new_ array. If you've incremented the old root, via
50 * c) resize an array with dm_array_resize().
52 * d) Get a value from the array with dm_array_get_value().
[all …]
/linux/Documentation/admin-guide/
H A Dmd.rst22 or, to assemble a partitionable array::
44 level of the RAID array
92 If a raid5 or raid6 array is both dirty and degraded, it could have
98 For this reason, md will normally refuse to start such an array. This
99 requires the sysadmin to take action to explicitly start the array
104 This option is not really available if the array has the root
106 array, md supports a module parameter ``start_dirty_degraded`` which,
131 An array is ``created`` by writing appropriate superblocks to all
138 An array should be created by a user-space tool. This will write
139 superblocks to all devices. It will usually mark the array as
[all …]
/linux/arch/x86/include/asm/
H A Dparavirt_types.h198 #define paravirt_ptr(array, op) [paravirt_opptr] "m" (array.op) argument
348 #define ____PVOP_CALL(ret, array, op, call_clbr, extra_clbr, ...) \ argument
354 : paravirt_ptr(array, op), \
360 #define ____PVOP_ALT_CALL(ret, array, op, alt, cond, call_clbr, \ argument
368 : paravirt_ptr(array, op), \
374 #define __PVOP_CALL(rettype, array, op, ...) \ argument
375 ____PVOP_CALL(PVOP_RETVAL(rettype), array, op, \
378 #define __PVOP_ALT_CALL(rettype, array, op, alt, cond, ...) \ argument
379 ____PVOP_ALT_CALL(PVOP_RETVAL(rettype), array, op, alt, cond, \
383 #define __PVOP_CALLEESAVE(rettype, array, op, ...) \ argument
[all …]
/linux/drivers/accel/habanalabs/common/
H A Dsecurity.c40 * hl_get_pb_block - return the relevant block within the block array
44 * @pb_blocks: blocks array
45 * @array_size: blocks array size
72 * @sgs_entry: pb array
98 * @pb_blocks: blocks array
99 * @sgs_array: pb array
100 * @array_size: blocks array size
127 * @pb_blocks: blocks array
128 * @sgs_array: pb array
129 * @array_size: blocks array size
[all …]
/linux/kernel/
H A Dstacktrace.c20 * @entries: Pointer to storage array
21 * @nr_entries: Number of entries in the storage array
41 * @entries: Pointer to storage array
42 * @nr_entries: Number of entries in the storage array
105 * stack_trace_save - Save a stack trace into a storage array
106 * @store: Pointer to storage array
107 * @size: Size of the storage array
128 * stack_trace_save_tsk - Save a task stack trace into a storage array
130 * @store: Pointer to storage array
131 * @size: Size of the storage array
[all …]
/linux/drivers/android/binder/range_alloc/
H A Dmod.rs10 mod array; module
11 use self::array::{ArrayRangeAllocator, EmptyArrayAlloc};
77 /// The array implementation must switch to the tree if it wants to go beyond this number of
117 Array(ArrayRangeAllocator<T>), enumerator
131 Impl::Array(array) => array.free_oneway_space(), in free_oneway_space()
139 Impl::Array(array) => array.count_buffers(), in count_buffers()
147 Impl::Array(array) => array.debug_print(m), in debug_print()
168 self.inner = Impl::Array(empty_array); in reserve_new()
171 Impl::Array(array) if array.is_full() => { in reserve_new()
185 TreeRangeAllocator::from_array(array.total_size(), &mut array.ranges, allocs); in reserve_new()
[all …]
/linux/Documentation/core-api/
H A Dassoc_array.rst2 Generic Associative Array Implementation
8 This associative array implementation is an object container with the following
18 2. Objects do not need to contain linkage blocks for use by the array. This
20 Rather, the array is made up of metadata blocks that point to objects.
22 3. Objects require index keys to locate them within the array.
25 already in the array will replace the old object.
32 7. Index keys can include a hash to scatter objects throughout the array.
34 8. The array can iterated over. The objects will not necessarily come out in
37 9. The array can be iterated over while it is being modified, provided the
43 10. Objects in the array can be looked up by means of their index key.
[all …]
/linux/include/linux/
H A Ddma-fence-array.h3 * fence-array: aggregates fence to be waited together
19 * struct dma_fence_array_cb - callback helper for fence array
21 * @array: reference to the parent fence array object
25 struct dma_fence_array *array; member
29 * struct dma_fence_array - fence to represent an array of fences
32 * @num_fences: number of fences in the array
33 * @num_pending: fences in the array still pending
34 * @fences: array of the fences
36 * @callbacks: array of callback helpers
68 * dma_fence_array_for_each - iterate over all fences in array
[all …]
H A Doverflow.h382 * array_size() - Calculate size of 2-dimensional array.
386 * Calculates size of 2-dimensional array: @a * @b.
388 * Returns: number of bytes needed to represent the array or SIZE_MAX on
394 * array3_size() - Calculate size of 3-dimensional array.
399 * Calculates size of 3-dimensional array: @a * @b * @c.
401 * Returns: number of bytes needed to represent the array or SIZE_MAX on
407 * flex_array_size() - Calculate size of a flexible array member
410 * @member: Name of the flexible array member.
411 * @count: Number of elements in the array.
413 * Calculates size of a flexible array of @count number of @member
[all …]
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 …]
/linux/drivers/infiniband/hw/mthca/
H A Dmthca_allocator.c106 * Array of pointers with lazy allocation of leaf pages. Callers of
108 * 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()
[all …]
/linux/drivers/gpu/drm/msm/registers/display/
H A Dmdp4.xml155 <array offsets="0x10000,0x18000,0x88000" name="OVLP" length="3" stride="0x8000">
162 <array offsets="0x0104,0x0124,0x0144,0x0160" name="STAGE" length="4" stride="0x1c">
179 </array>
181 <array offsets="0x1004,0x1404,0x1804,0x1b84" name="STAGE_CO3" length="4" stride="4">
185 </array>
194 <array offset="0x2000" name="CSC" length="1" stride="0x700">
195 <array offset="0x400" name="MV" length="9" stride="4">
197 </array>
198 <array offset="0x500" name="PRE_BV" length="3" stride="4">
200 </array>
[all …]
/linux/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[i] |= (decay << COUNT_BITS); in do_spring_cleaning()
[all …]
/linux/drivers/net/wireless/realtek/rtlwifi/rtl8821ae/
H A Dpwrseq.c8 /* 3 Power on Array */
15 /* 3Radio off GPIO Array */
22 /* 3Card Disable Array */
31 /* 3 Card Enable Array */
40 /* 3Suspend Array */
49 /* 3 Resume Array */
58 /* 3HWPDN Array */
84 /*3 Power on Array*/
91 /*3Radio off GPIO Array */
98 /*3Card Disable Array*/
[all …]
/linux/scripts/coccinelle/misc/
H A Dflexible_array.cocci5 /// Flexible-array members should be used instead.
27 identifier name, array;
35 * T array@p[\(0\|1\)];
40 * T array@p[\(0\|1\)];
45 * T array@p[\(0\|1\)];
50 * T array@p[\(0\|1\)];
55 identifier name, array;
62 T array[0];
66 T array[0];
71 identifier name, array;
[all …]
/linux/fs/nfs/
H A Dpnfs_nfs.c132 struct pnfs_commit_array *array; in pnfs_find_commit_array_by_lseg() local
134 list_for_each_entry_rcu(array, &fl_cinfo->commits, cinfo_list) { in pnfs_find_commit_array_by_lseg()
135 if (array->lseg == lseg) in pnfs_find_commit_array_by_lseg()
136 return array; in pnfs_find_commit_array_by_lseg()
146 struct pnfs_commit_array *array; in pnfs_add_commit_array() local
148 array = pnfs_find_commit_array_by_lseg(fl_cinfo, lseg); in pnfs_add_commit_array()
149 if (array) in pnfs_add_commit_array()
150 return array; in pnfs_add_commit_array()
163 struct pnfs_commit_array *array; in pnfs_lookup_commit_array() local
166 array = pnfs_find_commit_array_by_lseg(fl_cinfo, lseg); in pnfs_lookup_commit_array()
[all …]
/linux/Documentation/bpf/
H A Dmap_array.rst12 ``BPF_MAP_TYPE_ARRAY`` and ``BPF_MAP_TYPE_PERCPU_ARRAY`` provide generic array
14 of constant size. The size of the array is defined in ``max_entries`` at
15 creation time. All array elements are pre-allocated and zero initialized when
20 array elements are aligned to 8 bytes.
25 memory are allocated to store all array values, starting on the second page,
43 Array elements can be retrieved using the ``bpf_map_lookup_elem()`` helper.
44 This helper returns a pointer into the array element, so to avoid data races
55 Array elements can be updated using the ``bpf_map_update_elem()`` helper.
60 Since the array is of constant size, ``bpf_map_delete_elem()`` is not supported.
61 To clear an array element, you may use ``bpf_map_update_elem()`` to insert a
[all …]

12345678910>>...177