Home
last modified time | relevance | path

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

12345678910>>...143

/Linux-v5.10/drivers/misc/vmw_vmci/
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 = *array_ptr; in vmci_handle_arr_append_entry() local
[all …]
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() argument
49 return array->size; in vmci_handle_arr_get_size()
/Linux-v5.10/drivers/dma-buf/
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 …]
/Linux-v5.10/sound/hda/
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-v5.10/drivers/md/persistent-data/
Ddm-array.h14 * The dm-array is a persistent version of an array. It packs the data
25 * size along with the array root in your encompassing data.
27 * Array entries are indexed via an unsigned integer starting from zero.
28 * Arrays are not sparse; if you resize an array to have 'n' entries then
33 * a) initialise a dm_array_info structure. This describes the array
39 * disk that holds a particular instance of an array. You may have a
41 * want to create a brand new, empty array with dm_array_empty().
45 * root for a _new_ array. If you've incremented the old root, via
49 * c) resize an array with dm_array_resize().
51 * d) Get a value from the array with dm_array_get_value().
[all …]
/Linux-v5.10/Documentation/admin-guide/
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-v5.10/kernel/bpf/
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 size to nearest power of 2, in array_map_alloc()
[all …]
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". Who removes it in reuseport_array_free()
[all …]
/Linux-v5.10/Documentation/core-api/
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-v5.10/kernel/
Dstacktrace.c19 * @entries: Pointer to storage array
20 * @nr_entries: Number of entries in the storage array
40 * @entries: Pointer to storage array
41 * @nr_entries: Number of entries in the storage array
104 * stack_trace_save - Save a stack trace into a storage array
105 * @store: Pointer to storage array
106 * @size: Size of the storage array
127 * stack_trace_save_tsk - Save a task stack trace into a storage array
129 * @store: Pointer to storage array
130 * @size: Size of the storage array
[all …]
/Linux-v5.10/Documentation/RCU/
DarrayRCU.rst16 array that is separately indexed. It might be tempting to consider use
17 of RCU to instead protect the index into an array, however, this use
34 Hash tables are often implemented as an array, where each array entry
37 to other array-of-list situations, such as radix trees.
45 located in each array element, and where the array is never resized,
61 function formerly used by the System V IPC code. The array is used
70 the new array, and invokes ipc_rcu_putref() to free up the old array.
102 * contents of the new array are visible before the new
103 * array becomes visible.
111 The ipc_rcu_putref() function decrements the array's reference count
[all …]
/Linux-v5.10/drivers/infiniband/hw/mthca/
Dmthca_allocator.c111 * Array of pointers with lazy allocation of leaf pages. Callers of
113 * 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()
[all …]
/Linux-v5.10/drivers/net/wireless/realtek/rtlwifi/rtl8821ae/
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-v5.10/drivers/gpio/
Dgpiolib-legacy.c82 * @array: array of the 'struct gpio'
83 * @num: how many GPIOs in the array
85 int gpio_request_array(const struct gpio *array, size_t num) in gpio_request_array() argument
89 for (i = 0; i < num; i++, array++) { in gpio_request_array()
90 err = gpio_request_one(array->gpio, array->flags, array->label); in gpio_request_array()
98 gpio_free((--array)->gpio); in gpio_request_array()
105 * @array: array of the 'struct gpio'
106 * @num: how many GPIOs in the array
108 void gpio_free_array(const struct gpio *array, size_t num) in gpio_free_array() argument
111 gpio_free((array++)->gpio); in gpio_free_array()
/Linux-v5.10/drivers/ras/
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-v5.10/include/linux/
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 …]
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
51 * dma_fence_is_array - check if a fence is from the array subsclass
/Linux-v5.10/fs/nfs/
Dpnfs_nfs.c134 struct pnfs_commit_array *array; in pnfs_find_commit_array_by_lseg() local
136 list_for_each_entry_rcu(array, &fl_cinfo->commits, cinfo_list) { in pnfs_find_commit_array_by_lseg()
137 if (array->lseg == lseg) in pnfs_find_commit_array_by_lseg()
138 return array; in pnfs_find_commit_array_by_lseg()
148 struct pnfs_commit_array *array; in pnfs_add_commit_array() local
150 array = pnfs_find_commit_array_by_lseg(fl_cinfo, lseg); in pnfs_add_commit_array()
151 if (array) in pnfs_add_commit_array()
152 return array; in pnfs_add_commit_array()
165 struct pnfs_commit_array *array; in pnfs_lookup_commit_array() local
168 array = pnfs_find_commit_array_by_lseg(fl_cinfo, lseg); in pnfs_lookup_commit_array()
[all …]
/Linux-v5.10/scripts/coccinelle/misc/
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;
63 T array@p[
70 T array@p[
80 msg = "WARNING use flexible-array member instead (https://www.kernel.org/doc/html/latest/process/de…
[all …]
/Linux-v5.10/kernel/trace/
Dtracing_map.h25 * zeroed array of struct tracing_map_entry (stored in the map field
28 * variable and a pointer named 'val'. This array of struct
32 * this indirectly via an array of tracing_map_sort_entry - see the
39 * It then uses this key, truncated to the array size, as an index
40 * into the array of tracing_map_entries. If the value of the 'key'
63 * tracing_map_entries in the tracing_map_entry array which can be
66 * with the tracing_map_entry array in the tracing_map. Because of
68 * tracing_map_entry array is always twice the maximum number of
74 * both the tracing_map_entry array and a pool of max_elts
78 * The tracing_map_entry array is allocated as a single block by
[all …]
/Linux-v5.10/tools/perf/util/
Devsel.c125 * PERF_SAMPLE_IDENTIFIER) in a sample event i.e. in the array of struct
1996 const __u64 *array = event->sample.array; in perf_evsel__parse_id_sample() local
2000 array += ((event->header.size - in perf_evsel__parse_id_sample()
2004 sample->id = *array; in perf_evsel__parse_id_sample()
2005 array--; in perf_evsel__parse_id_sample()
2009 u.val64 = *array; in perf_evsel__parse_id_sample()
2017 array--; in perf_evsel__parse_id_sample()
2021 sample->stream_id = *array; in perf_evsel__parse_id_sample()
2022 array--; in perf_evsel__parse_id_sample()
2026 sample->id = *array; in perf_evsel__parse_id_sample()
[all …]
/Linux-v5.10/tools/lib/perf/Documentation/examples/
Dsampling.c86 __u64 ip, period, *array; in main() local
89 array = event->sample.array; in main()
91 ip = *array; in main()
92 array++; in main()
94 u.val64 = *array; in main()
97 array++; in main()
99 u.val64 = *array; in main()
101 array++; in main()
103 period = *array; in main()
/Linux-v5.10/drivers/media/usb/gspca/stv06xx/
Dstv06xx_hdcs.c61 /* visible area of the sensor array */
66 } array; member
287 if (width > hdcs->array.width) in hdcs_set_size()
288 width = hdcs->array.width; in hdcs_set_size()
292 if (height + 2 * hdcs->array.border + HDCS_1020_BOTTOM_Y_SKIP in hdcs_set_size()
293 > hdcs->array.height) in hdcs_set_size()
294 height = hdcs->array.height - 2 * hdcs->array.border - in hdcs_set_size()
297 y = (hdcs->array.height - HDCS_1020_BOTTOM_Y_SKIP - height) / 2 in hdcs_set_size()
298 + hdcs->array.top; in hdcs_set_size()
300 if (height > hdcs->array.height) in hdcs_set_size()
[all …]
/Linux-v5.10/lib/
Dassoc_array.c2 /* Generic associative array implementation.
16 * Iterate over an associative array. The caller must hold the RCU read lock
111 * assoc_array_iterate - Pass all objects in the array to a callback
112 * @array: The array to iterate over.
116 * Iterate over all the objects in an associative array. Each one will be
119 * If the array is being modified concurrently with the iteration then it is
120 * possible that some objects in the array will be passed to the iterator
125 * The function will return 0 if no objects were in the array or else it will
133 int assoc_array_iterate(const struct assoc_array *array, in assoc_array_iterate() argument
138 struct assoc_array_ptr *root = READ_ONCE(array->root); /* Address dependency. */ in assoc_array_iterate()
[all …]
/Linux-v5.10/Documentation/scsi/
Dhpsa.rst4 HPSA - Hewlett Packard Smart Array driver
7 This file describes the hpsa SCSI driver for HP Smart Array controllers.
9 Smart Array controllers. The hpsa driver is a SCSI driver, while the
19 - Smart Array P212
20 - Smart Array P410
21 - Smart Array P410i
22 - Smart Array P411
23 - Smart Array P812
24 - Smart Array P712m
25 - Smart Array P711m
[all …]

12345678910>>...143