Home
last modified time | relevance | path

Searched full:elements (Results 1 – 25 of 1408) sorted by relevance

12345678910>>...57

/Linux-v6.1/kernel/sched/
Dcpudeadline.c29 int orig_cpu = cp->elements[idx].cpu; in cpudl_heapify_down()
30 u64 orig_dl = cp->elements[idx].dl; in cpudl_heapify_down()
45 cp->elements[l].dl)) { in cpudl_heapify_down()
47 largest_dl = cp->elements[l].dl; in cpudl_heapify_down()
50 cp->elements[r].dl)) in cpudl_heapify_down()
57 cp->elements[idx].cpu = cp->elements[largest].cpu; in cpudl_heapify_down()
58 cp->elements[idx].dl = cp->elements[largest].dl; in cpudl_heapify_down()
59 cp->elements[cp->elements[idx].cpu].idx = idx; in cpudl_heapify_down()
63 cp->elements[idx].cpu = orig_cpu; in cpudl_heapify_down()
64 cp->elements[idx].dl = orig_dl; in cpudl_heapify_down()
[all …]
/Linux-v6.1/drivers/staging/octeon/
Dethernet-mem.c20 * @elements: Number of buffers to allocate
24 static int cvm_oct_fill_hw_skbuff(int pool, int size, int elements) in cvm_oct_fill_hw_skbuff() argument
26 int freed = elements; in cvm_oct_fill_hw_skbuff()
38 return elements - freed; in cvm_oct_fill_hw_skbuff()
45 * @elements: Number of buffers to allocate
47 static void cvm_oct_free_hw_skbuff(int pool, int size, int elements) in cvm_oct_free_hw_skbuff() argument
56 elements--; in cvm_oct_free_hw_skbuff()
61 if (elements < 0) in cvm_oct_free_hw_skbuff()
63 pool, elements); in cvm_oct_free_hw_skbuff()
64 else if (elements > 0) in cvm_oct_free_hw_skbuff()
[all …]
/Linux-v6.1/drivers/acpi/acpica/
Dnsprepkg.c22 union acpi_operand_object **elements, u32 count);
26 union acpi_operand_object **elements,
33 union acpi_operand_object **elements, u32 count);
56 union acpi_operand_object **elements; in acpi_ns_check_package() local
75 * and trailing NULL package elements in acpi_ns_check_package()
80 /* Extract package count and elements array */ in acpi_ns_check_package()
82 elements = return_object->package.elements; in acpi_ns_check_package()
96 "Return Package has no elements (empty)")); in acpi_ns_check_package()
110 status = acpi_ns_custom_package(info, elements, count); in acpi_ns_check_package()
132 /* Validate all elements of the returned package */ in acpi_ns_check_package()
[all …]
Ddspkginit.c31 * element_count - Number of elements in the package - this is
40 * NOTE: The number of elements in the package will be always be the num_elements
41 * count, regardless of the number of elements in the package list. If
42 * num_elements is smaller, only that many package list elements are used.
111 if (!obj_desc->package.elements) { in acpi_ds_build_internal_package_obj()
112 obj_desc->package.elements = ACPI_ALLOCATE_ZEROED(((acpi_size) in acpi_ds_build_internal_package_obj()
119 if (!obj_desc->package.elements) { in acpi_ds_build_internal_package_obj()
134 * full resolution of the package elements in order to support in acpi_ds_build_internal_package_obj()
135 * forward references from the elements. This provides in acpi_ds_build_internal_package_obj()
143 "%s: Deferring resolution of Package elements\n", in acpi_ds_build_internal_package_obj()
[all …]
Dnsrepair2.c88 acpi_ns_sort_list(union acpi_operand_object **elements,
334 * If a Package, ensure same for all string elements.
366 element_ptr = return_object->package.elements; in acpi_ns_repair_CID()
428 outer_elements = &return_object->package.elements[i + 1]; in acpi_ns_repair_CST()
441 obj_desc = (*outer_elements)->package.elements[1]; /* Index1 = Type */ in acpi_ns_repair_CST()
462 obj_desc = return_object->package.elements[0]; in acpi_ns_repair_CST()
590 top_object_list = package_object->package.elements; in acpi_ns_repair_PRT()
597 sub_object_list = sub_package->package.elements; in acpi_ns_repair_PRT()
652 union acpi_operand_object **elements; in acpi_ns_repair_PSS() local
676 outer_elements = return_object->package.elements; in acpi_ns_repair_PSS()
[all …]
/Linux-v6.1/drivers/acpi/
Dpfr_update.c134 out_obj->package.elements[CAP_STATUS_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
135 out_obj->package.elements[CAP_UPDATE_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
136 out_obj->package.elements[CAP_CODE_TYPE_IDX].type != ACPI_TYPE_BUFFER || in query_capability()
137 out_obj->package.elements[CAP_FW_VER_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
138 out_obj->package.elements[CAP_CODE_RT_VER_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
139 out_obj->package.elements[CAP_DRV_TYPE_IDX].type != ACPI_TYPE_BUFFER || in query_capability()
140 out_obj->package.elements[CAP_DRV_RT_VER_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
141 out_obj->package.elements[CAP_DRV_SVN_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
142 out_obj->package.elements[CAP_PLAT_ID_IDX].type != ACPI_TYPE_BUFFER || in query_capability()
143 out_obj->package.elements[CAP_OEM_ID_IDX].type != ACPI_TYPE_BUFFER || in query_capability()
[all …]
Dpfr_telemetry.c91 in_obj.package.elements = &in_buf; in get_pfrt_log_data_info()
102 out_obj->package.elements[LOG_STATUS_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
103 out_obj->package.elements[LOG_EXT_STATUS_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
104 out_obj->package.elements[LOG_MAX_SZ_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
105 out_obj->package.elements[LOG_CHUNK1_LO_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
106 out_obj->package.elements[LOG_CHUNK1_HI_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
107 out_obj->package.elements[LOG_CHUNK1_SZ_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
108 out_obj->package.elements[LOG_CHUNK2_LO_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
109 out_obj->package.elements[LOG_CHUNK2_HI_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
110 out_obj->package.elements[LOG_CHUNK2_SZ_IDX].type != ACPI_TYPE_INTEGER || in get_pfrt_log_data_info()
[all …]
Dacpi_adxl.c55 o = obj->package.elements; in adxl_dsm()
65 o = obj->package.elements + 1; in adxl_dsm()
113 argv4[0].package.elements = &argv4[1]; in adxl_decode()
121 r = results->package.elements + 1; in adxl_decode()
127 r = r->package.elements; in adxl_decode()
169 p = params->package.elements + 1; in adxl_init()
176 p = p->package.elements; in adxl_init()
/Linux-v6.1/Documentation/devicetree/bindings/net/can/
Dbosch,m_can.yaml65 the following elements start from. This is usually set to
67 are used to specify how many elements are used for each FIFO/Buffer.
69 M_CAN includes the following elements according to user manual:
70 11-bit Filter 0-128 elements / 0-128 words
71 29-bit Filter 0-64 elements / 0-128 words
72 Rx FIFO 0 0-64 elements / 0-1152 words
73 Rx FIFO 1 0-64 elements / 0-1152 words
74 Rx Buffers 0-64 elements / 0-1152 words
75 Tx Event FIFO 0-32 elements / 0-64 words
76 Tx Buffers 0-32 elements / 0-576 words
[all …]
/Linux-v6.1/drivers/soc/qcom/
Dqmi_encdec.c72 * This function is used while encoding optional elements. If the flag
114 /* Optional elements do not count in minimum length */ in qmi_calc_min_msg_len()
141 * Type & Length info. not prepended for elements in the in qmi_calc_min_msg_len()
152 * qmi_encode_basic_elem() - Encodes elements of basic/primary data type
154 * @buf_src: Buffer containing the elements to be encoded.
155 * @elem_len: Number of elements, in the buf_src, to be encoded.
158 * This function encodes the "elem_len" number of data elements, each of
160 * encoded information in the destination buffer "buf_dst". The elements are
180 * qmi_encode_struct_elem() - Encodes elements of struct data type
183 * @buf_src: Buffer containing the elements to be encoded.
[all …]
/Linux-v6.1/tools/lib/bpf/
Dbpf.h151 * elements in a BPF map.
156 * number of elements in the map to delete in batch;
158 * elements if the output **count** value is not equal to the input **count** value
169 * @brief **bpf_map_lookup_batch()** allows for batch lookup of BPF map elements.
187 * @param count input and output parameter; on input it's the number of elements
188 * in the map to read in batch; on output it's the number of elements that were
190 * If a non-EFAULT error is returned, count will be set as the number of elements
203 * of BPF map elements where each element is deleted after being retrieved.
211 * @param count input and output parameter; on input it's the number of elements
213 * elements that were successfully read and deleted
[all …]
/Linux-v6.1/net/netfilter/ipset/
Dip_set_bitmap_ip.c43 u32 elements; /* number of max elements in the set */ member
221 u32 elements, u32 hosts, u8 netmask) in init_map_ip() argument
223 map->members = bitmap_zalloc(elements, GFP_KERNEL | __GFP_NOWARN); in init_map_ip()
228 map->elements = elements; in init_map_ip()
258 u64 elements; in bitmap_ip_create() local
299 elements = (u64)last_ip - first_ip + 1; in bitmap_ip_create()
312 elements = 2 << (netmask - mask_bits - 1); in bitmap_ip_create()
314 if (elements > IPSET_BITMAP_MAX_RANGE + 1) in bitmap_ip_create()
317 pr_debug("hosts %u, elements %llu\n", in bitmap_ip_create()
318 hosts, (unsigned long long)elements); in bitmap_ip_create()
[all …]
Dip_set_bitmap_gen.h50 for (id = 0; id < map->elements; id++) in mtype_ext_cleanup()
78 bitmap_zero(map->members, map->elements); in mtype_flush()
79 set->elements = 0; in mtype_flush()
88 map->elements * dsize; in mtype_memsize()
104 nla_put_net32(skb, IPSET_ATTR_ELEMENTS, htonl(set->elements))) in mtype_head()
141 set->elements--; in mtype_add()
151 set->elements--; in mtype_add()
169 set->elements++; in mtype_add()
186 set->elements--; in mtype_del()
217 for (; cb->args[IPSET_CB_ARG0] < map->elements; in mtype_list()
[all …]
Dip_set_bitmap_ipmac.c48 u32 elements; /* number of max elements in the set */ member
105 /* Timer not started for the incomplete elements */ in bitmap_ipmac_gc_test()
300 u32 first_ip, u32 last_ip, u32 elements) in init_map_ipmac() argument
302 map->members = bitmap_zalloc(elements, GFP_KERNEL | __GFP_NOWARN); in init_map_ipmac()
307 map->elements = elements; in init_map_ipmac()
322 u64 elements; in bitmap_ipmac_create() local
351 elements = (u64)last_ip - first_ip + 1; in bitmap_ipmac_create()
353 if (elements > IPSET_BITMAP_MAX_RANGE + 1) in bitmap_ipmac_create()
359 map = ip_set_alloc(sizeof(*map) + elements * set->dsize); in bitmap_ipmac_create()
363 map->memsize = BITS_TO_LONGS(elements) * sizeof(unsigned long); in bitmap_ipmac_create()
[all …]
/Linux-v6.1/include/uapi/linux/
Dchio.h27 * accessing elements works by specifing type and unit of the element.
28 * for example, storage elements are addressed with type = CHET_ST and
34 int cp_npickers; /* number of transport elements (CHET_MT) */
35 int cp_nslots; /* number of storage elements (CHET_ST) */
36 int cp_nportals; /* number of import/export elements (CHET_IE) */
37 int cp_ndrives; /* number of data transfer elements (CHET_DT) */
99 * get element status for all elements of a specific type
124 int cge_id; /* scsi id (for data transfer elements) */
125 int cge_lun; /* scsi lun (for data transfer elements) */
/Linux-v6.1/drivers/net/wireless/intel/iwlwifi/fw/
Dacpi.c237 data->package.elements[0].type != ACPI_TYPE_INTEGER) { in iwl_acpi_get_wifi_pkg_range()
242 *tbl_rev = data->package.elements[0].integer.value; in iwl_acpi_get_wifi_pkg_range()
248 wifi_pkg = &data->package.elements[i]; in iwl_acpi_get_wifi_pkg_range()
256 domain = &wifi_pkg->package.elements[0]; in iwl_acpi_get_wifi_pkg_range()
288 if (tbl_rev == 1 && wifi_pkg->package.elements[1].type == in iwl_acpi_get_tas()
291 (u32)wifi_pkg->package.elements[1].integer.value; in iwl_acpi_get_tas()
310 wifi_pkg->package.elements[1].type == ACPI_TYPE_INTEGER) { in iwl_acpi_get_tas()
311 enabled = !!wifi_pkg->package.elements[1].integer.value; in iwl_acpi_get_tas()
324 if (wifi_pkg->package.elements[2].type != ACPI_TYPE_INTEGER || in iwl_acpi_get_tas()
325 wifi_pkg->package.elements[2].integer.value > in iwl_acpi_get_tas()
[all …]
/Linux-v6.1/drivers/staging/media/atomisp/pci/base/circbuf/interface/
Dia_css_circbuf.h38 ia_css_circbuf_elem_t *elems; /* an array of elements */
45 * @param elems An array of elements.
171 * along the direction in which the new elements come in.
196 * @brief Get the maximum number of elements.
200 * @return the maximum number of elements.
214 * @brief Get the number of available elements.
218 * @return the number of available elements.
318 * @brief Get the number of free elements.
322 * @return: The number of free elements.
339 * @return the elements value.
[all …]
/Linux-v6.1/drivers/platform/x86/intel/int1092/
Dintel_sar.c83 num = &item->package.elements[0]; in parse_package()
102 num = &item->package.elements[itr + 1]; in parse_package()
105 if (get_int_value(&num->package.elements[0], &temp.device_mode)) in parse_package()
107 if (get_int_value(&num->package.elements[1], &temp.bandtable_index)) in parse_package()
109 if (get_int_value(&num->package.elements[2], &temp.antennatable_index)) in parse_package()
111 if (get_int_value(&num->package.elements[3], &temp.sartable_index)) in parse_package()
229 out->package.elements[0].type == ACPI_TYPE_INTEGER && in sar_get_data()
230 out->package.elements[1].type == ACPI_TYPE_INTEGER && in sar_get_data()
231 out->package.elements[2].type == ACPI_TYPE_PACKAGE && in sar_get_data()
232 out->package.elements[2].package.count > 0) { in sar_get_data()
[all …]
/Linux-v6.1/fs/xfs/
Dxfs_mru_cache.c13 * function pointer to call when deleting elements. A data structure for
17 * the elements are grouped in time. When reaping occurs, all the elements in
26 * All the elements added in the first two seconds are appended to the first
27 * list. Elements added in the third second go into the second list, and so on.
33 * if it were called at t=11s, there could be elements in the first list that
36 * elements that remain in the first list. It's therefore possible for elements
42 * every (t/g) seconds. If it is called less frequently, unused elements will
49 * expired elements in groups of some appreciable size. This automatically
54 * The elements could have been stored in just one list, but an array of
65 * this happens, all the elements on the LRU list need to be migrated to the end
[all …]
/Linux-v6.1/tools/perf/pmu-events/arch/arm64/fujitsu/a64fx/
Dpipeline.json141 … event counts the number of times where 2 elements of the gather instructions became 2 flows becau…
144 … event counts the number of times where 2 elements of the gather instructions became 2 flows becau…
147 … event counts the number of times where 2 elements of the gather instructions became 1 flow becaus…
150 … event counts the number of times where 2 elements of the gather instructions became 1 flow becaus…
153 …"PublicDescription": "This event counts the number of times where 2 elements of the gather instruc…
156 …"BriefDescription": "This event counts the number of times where 2 elements of the gather instruct…
/Linux-v6.1/include/linux/
Dkfifo.h108 * @type: type of the fifo elements
115 * @type: type of the fifo elements
116 * @size: the number of elements in the fifo, this must be a power of 2
138 * @type: type of the fifo elements
139 * @size: the number of elements in the fifo, this must be a power of 2
196 * kfifo_size - returns the size of the fifo in elements
230 * kfifo_len - returns the number of used elements in the fifo
291 * kfifo_avail - returns the number of unused elements in the fifo
341 * @size: the number of elements in the fifo, this must be a power of 2
346 * The number of elements will be rounded-up to a power of 2.
[all …]
Dmempool.h18 int min_nr; /* nr of elements at *elements */
19 int curr_nr; /* Current nr of elements at *elements */
20 void **elements; member
30 return pool->elements != NULL; in mempool_initialized()
/Linux-v6.1/drivers/net/ipa/
Dgsi_trans.h78 * @size: Size of elements in the pool
79 * @count: Minimum number of elements in the pool
80 * @max_alloc: Maximum number of elements allocated at a time from pool
88 * gsi_trans_pool_alloc() - Allocate one or more elements from a pool
90 * @count: Number of elements to allocate from the pool
106 * @size: Size of elements in the pool
107 * @count: Minimum number of elements in the pool
108 * @max_alloc: Maximum number of elements allocated at a time from pool
149 * @tre_count: Number of elements in the transaction
/Linux-v6.1/drivers/acpi/x86/
Dapple.c24 * alternating key/value elements, unlike _DSD which stores them as a package
69 union acpi_object *key = &props->package.elements[i * 2]; in acpi_extract_apple_properties()
70 union acpi_object *val = &props->package.elements[i * 2 + 1]; in acpi_extract_apple_properties()
100 newprops->package.elements = &newprops[1]; in acpi_extract_apple_properties()
104 union acpi_object *key = &props->package.elements[i * 2]; in acpi_extract_apple_properties()
105 union acpi_object *val = &props->package.elements[i * 2 + 1]; in acpi_extract_apple_properties()
111 newprops[1 + j].package.elements = &newprops[k]; in acpi_extract_apple_properties()
/Linux-v6.1/mm/
Dmempool.c126 pool->elements[pool->curr_nr++] = element; in add_element()
131 void *element = pool->elements[--pool->curr_nr]; in remove_element()
144 * Free all reserved elements in @pool and @pool itself. This function
156 kfree(pool->elements); in mempool_exit()
157 pool->elements = NULL; in mempool_exit()
166 * Free all reserved elements in @pool and @pool itself. This function
190 pool->elements = kmalloc_array_node(min_nr, sizeof(void *), in mempool_init_node()
192 if (!pool->elements) in mempool_init_node()
216 * @min_nr: the minimum number of elements guaranteed to be
238 * @min_nr: the minimum number of elements guaranteed to be
[all …]

12345678910>>...57