Home
last modified time | relevance | path

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

12345678910>>...242

/OK3568_Linux_fs/kernel/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 = *array_ptr; in vmci_handle_arr_append_entry() local
[all …]
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/kernel/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->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 …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A Darray2 //===---------------------------- array -----------------------------------===//
15 array synopsis
20 struct array
37 void swap(array& a) noexcept(is_nothrow_swappable_v<T>);
76 array(T, U...) -> array<T, 1 + sizeof...(U)>;
79 bool operator==(const array<T,N>& x, const array<T,N>& y);
81 bool operator!=(const array<T,N>& x, const array<T,N>& y);
83 bool operator<(const array<T,N>& x, const array<T,N>& y);
85 bool operator>(const array<T,N>& x, const array<T,N>& y);
87 bool operator<=(const array<T,N>& x, const array<T,N>& y);
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A Darray2 //===---------------------------- array -----------------------------------===//
15 array synopsis
20 struct array
37 void swap(array& a) noexcept(is_nothrow_swappable_v<T>);
76 array(T, U...) -> array<T, 1 + sizeof...(U)>;
79 bool operator==(const array<T,N>& x, const array<T,N>& y);
81 bool operator!=(const array<T,N>& x, const array<T,N>& y);
83 bool operator<(const array<T,N>& x, const array<T,N>& y);
85 bool operator>(const array<T,N>& x, const array<T,N>& y);
87 bool operator<=(const array<T,N>& x, const array<T,N>& y);
[all …]
/OK3568_Linux_fs/kernel/drivers/md/persistent-data/
H A 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 …]
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/kernel/drivers/gpu/arm/bifrost/
H A Dmali_kbase_debugfs_helper.h27 * attribute value from an array
29 * @array: Address of an object that can be accessed like an array.
33 typedef void kbase_debugfs_helper_set_attr_fn(void *array, size_t index,
38 * array
41 * @array: Address of an object that can be accessed like an array.
42 * @nelems: Number of elements in the array.
43 * @set_attr_fn: Function to be called back for each array element.
47 * values than the specified number of array elements.
57 const char *buf, void *array, size_t nelems,
85 * attribute value from an array
[all …]
H A Dmali_kbase_mem_pool_debugfs.h44 * @array: Address of the first in an array of physical memory pools.
45 * @index: A memory group ID to be used as an index into the array of memory
53 void kbase_mem_pool_debugfs_trim(void *array, size_t index, size_t value);
59 * @array: Address of the first in an array of physical memory pools.
60 * @index: A memory group ID to be used as an index into the array of memory
67 void kbase_mem_pool_debugfs_set_max_size(void *array, size_t index,
73 * @array: Address of the first in an array of physical memory pools.
74 * @index: A memory group ID to be used as an index into the array of memory
81 size_t kbase_mem_pool_debugfs_size(void *array, size_t index);
87 * @array: Address of the first in an array of physical memory pools.
[all …]
/OK3568_Linux_fs/kernel/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 size to nearest power of 2, in array_map_alloc()
[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". Who removes it in reuseport_array_free()
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/
H A Darray.hpp1 /* The following code declares class array,
5 * http://www.boost.org/libs/array/
39 # pragma warning(disable:4510) // boost::array<T,N>' : default constructor could not be generated
40 # pragma warning(disable:4610) // warning C4610: class 'boost::array<T,N>' can never be instantiate…
61 class array { class
63 T elems[N]; // fixed-size array of elements of type T
158 void swap (array<T,N>& y) { in swap()
167 // use array as C array (direct read/write access to data)
172 array<T,N>& operator= (const array<T2,N>& rhs) { in operator =()
186 …return i > size() ? boost::throw_exception(std::out_of_range ("array<>: index out of range")), tru… in rangecheck()
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852be/phl/hal_g6/phy/rf/halrf_8852b/
H A Dhalrf_hwimg_8852b.c188 u32 *array = NULL; in halrf_config_8852b_nctl_reg() local
201 array = (u32 *) &array_mp_8852b_nctl_reg; in halrf_config_8852b_nctl_reg()
214 v1 = array[i]; in halrf_config_8852b_nctl_reg()
215 v2 = array[i + 1]; in halrf_config_8852b_nctl_reg()
223 bool halrf_sel_headline_8852b(struct rf_info *rf, u32 *array, u32 array_len, in halrf_sel_headline_8852b() argument
253 if ((array[i] >> 28) != 0xf) { in halrf_sel_headline_8852b()
257 RF_DBG(rf, DBG_RF_INIT, "array[%02d]=0x%08x, array[%02d]=0x%08x\n", in halrf_sel_headline_8852b()
258 i, array[i], i+1, array[i+1]); in halrf_sel_headline_8852b()
271 if ((array[i] & 0x0fffffff) == compare_target) { in halrf_sel_headline_8852b()
282 if ((array[i] & 0x0fffffff) == compare_target) { in halrf_sel_headline_8852b()
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852bs/phl/hal_g6/phy/rf/halrf_8852b/
H A Dhalrf_hwimg_8852b.c188 u32 *array = NULL; in halrf_config_8852b_nctl_reg() local
201 array = (u32 *) &array_mp_8852b_nctl_reg; in halrf_config_8852b_nctl_reg()
214 v1 = array[i]; in halrf_config_8852b_nctl_reg()
215 v2 = array[i + 1]; in halrf_config_8852b_nctl_reg()
223 bool halrf_sel_headline_8852b(struct rf_info *rf, u32 *array, u32 array_len, in halrf_sel_headline_8852b() argument
253 if ((array[i] >> 28) != 0xf) { in halrf_sel_headline_8852b()
257 RF_DBG(rf, DBG_RF_INIT, "array[%02d]=0x%08x, array[%02d]=0x%08x\n", in halrf_sel_headline_8852b()
258 i, array[i], i+1, array[i+1]); in halrf_sel_headline_8852b()
271 if ((array[i] & 0x0fffffff) == compare_target) { in halrf_sel_headline_8852b()
282 if ((array[i] & 0x0fffffff) == compare_target) { in halrf_sel_headline_8852b()
[all …]
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/OpenCV-android-sdk/sdk/native/jni/include/opencv2/
H A Dcore.hpp268 @param len Length of the array along the corresponding axis.
329 /** @brief Calculates the per-element sum of two arrays or an array and a scalar.
334 - Sum of an array and a scalar when src2 is constructed from Scalar or has the same number of
337 - Sum of a scalar and an array when src1 is constructed from Scalar or has the same number of
340 where `I` is a multi-dimensional index of array elements. In case of multi-channel arrays, each
348 The input arrays and the output array can all have the same or different depths. For example, you
349 can add a 16-bit unsigned array to a 8-bit signed array and store the sum as a 32-bit
350 floating-point array. Depth of the output array is determined by the dtype parameter. In the second
352 be set to the default -1. In this case, the output array will have the same depth as the input
353 array, be it src1, src2 or both.
[all …]
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-armhf/include/opencv2/
H A Dcore.hpp268 @param len Length of the array along the corresponding axis.
329 /** @brief Calculates the per-element sum of two arrays or an array and a scalar.
334 - Sum of an array and a scalar when src2 is constructed from Scalar or has the same number of
337 - Sum of a scalar and an array when src1 is constructed from Scalar or has the same number of
340 where `I` is a multi-dimensional index of array elements. In case of multi-channel arrays, each
348 The input arrays and the output array can all have the same or different depths. For example, you
349 can add a 16-bit unsigned array to a 8-bit signed array and store the sum as a 32-bit
350 floating-point array. Depth of the output array is determined by the dtype parameter. In the second
352 be set to the default -1. In this case, the output array will have the same depth as the input
353 array, be it src1, src2 or both.
[all …]
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/
H A Dcore.hpp268 @param len Length of the array along the corresponding axis.
329 /** @brief Calculates the per-element sum of two arrays or an array and a scalar.
334 - Sum of an array and a scalar when src2 is constructed from Scalar or has the same number of
337 - Sum of a scalar and an array when src1 is constructed from Scalar or has the same number of
340 where `I` is a multi-dimensional index of array elements. In case of multi-channel arrays, each
348 The input arrays and the output array can all have the same or different depths. For example, you
349 can add a 16-bit unsigned array to a 8-bit signed array and store the sum as a 32-bit
350 floating-point array. Depth of the output array is determined by the dtype parameter. In the second
352 be set to the default -1. In this case, the output array will have the same depth as the input
353 array, be it src1, src2 or both.
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/
H A Darray1 // <array> -*- C++ -*-
25 /** @file include/array
94 struct array
120 swap(array& __other)
196 std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
208 : (std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
244 array(_Tp, _Up...)
245 -> array<enable_if_t<(is_same_v<_Tp, _Up> && ...), _Tp>,
249 // Array comparisons.
253 operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
[all …]
H A Dvalarray89 template<class _Tp> class valarray; // An array of type _Tp
90 class slice; // BLAS-like slice out of an array
92 class gslice; // generalized slice out of an array
94 template<class _Tp> class mask_array; // masked array
95 template<class _Tp> class indirect_array; // indirected array
116 * @brief Smart array designed to support numeric processing.
118 * A valarray is an array that provides constraints intended to allow for
119 * effective optimization of numeric array processing by reducing the
121 * one-dimensional array from which different multidimensional subsets can
124 * @tparam _Tp Type of object in the array.
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/
H A Darray1 // <array> -*- C++ -*-
25 /** @file include/array
94 struct array
120 swap(array& __other)
196 std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
208 : (std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
244 array(_Tp, _Up...)
245 -> array<enable_if_t<(is_same_v<_Tp, _Up> && ...), _Tp>,
249 // Array comparisons.
253 operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
[all …]
H A Dvalarray89 template<class _Tp> class valarray; // An array of type _Tp
90 class slice; // BLAS-like slice out of an array
92 class gslice; // generalized slice out of an array
94 template<class _Tp> class mask_array; // masked array
95 template<class _Tp> class indirect_array; // indirected array
116 * @brief Smart array designed to support numeric processing.
118 * A valarray is an array that provides constraints intended to allow for
119 * effective optimization of numeric array processing by reducing the
121 * one-dimensional array from which different multidimensional subsets can
124 * @tparam _Tp Type of object in the array.
[all …]
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/
H A Dgslice.h47 * @brief Class defining multi-dimensional subset of an array. in _GLIBCXX_VISIBILITY()
49 * The slice class represents a multi-dimensional subset of an array, in _GLIBCXX_VISIBILITY()
50 * specified by three parameter sets: start offset, size array, and stride in _GLIBCXX_VISIBILITY()
51 * array. The start offset is the index of the first element of the array in _GLIBCXX_VISIBILITY()
52 * that is part of the subset. The size and stride array describe each in _GLIBCXX_VISIBILITY()
54 * dimension, and stride is the distance in the array between successive in _GLIBCXX_VISIBILITY()
56 * to begin at an array element described by the previous dimension. The in _GLIBCXX_VISIBILITY()
57 * size array and stride array must be the same size. in _GLIBCXX_VISIBILITY()
60 * stride[1]==3, then slice[0,0]==array[3], slice[0,1]==array[6], in _GLIBCXX_VISIBILITY()
61 * slice[0,2]==array[9], slice[1,0]==array[14], slice[1,1]==array[17], in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/
H A Dgslice.h47 * @brief Class defining multi-dimensional subset of an array. in _GLIBCXX_VISIBILITY()
49 * The slice class represents a multi-dimensional subset of an array, in _GLIBCXX_VISIBILITY()
50 * specified by three parameter sets: start offset, size array, and stride in _GLIBCXX_VISIBILITY()
51 * array. The start offset is the index of the first element of the array in _GLIBCXX_VISIBILITY()
52 * that is part of the subset. The size and stride array describe each in _GLIBCXX_VISIBILITY()
54 * dimension, and stride is the distance in the array between successive in _GLIBCXX_VISIBILITY()
56 * to begin at an array element described by the previous dimension. The in _GLIBCXX_VISIBILITY()
57 * size array and stride array must be the same size. in _GLIBCXX_VISIBILITY()
60 * stride[1]==3, then slice[0,0]==array[3], slice[0,1]==array[6], in _GLIBCXX_VISIBILITY()
61 * slice[0,2]==array[9], slice[1,0]==array[14], slice[1,1]==array[17], in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/debug/
H A Darray1 // Debugging array implementation -*- C++ -*-
25 /** @file debug/array
34 #include <array>
44 struct array
88 swap(array& __other)
171 std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
183 : (std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
230 array(_Tp, _Up...)
231 -> array<std::enable_if_t<(std::is_same_v<_Tp, _Up> && ...), _Tp>,
235 // Array comparisons.
[all …]

12345678910>>...242