Home
last modified time | relevance | path

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

12345678910>>...40

/linux/kernel/sched/
H A Dcpudeadline.c30 int orig_cpu = cp->elements[idx].cpu; in cpudl_heapify_down()
31 u64 orig_dl = cp->elements[idx].dl; in cpudl_heapify_down()
46 cp->elements[l].dl)) { in cpudl_heapify_down()
48 largest_dl = cp->elements[l].dl; in cpudl_heapify_down()
51 cp->elements[r].dl)) in cpudl_heapify_down()
58 cp->elements[idx].cpu = cp->elements[largest].cpu; in cpudl_heapify_down()
59 cp->elements[idx].dl = cp->elements[largest].dl; in cpudl_heapify_down()
60 cp->elements[cp->elements[idx].cpu].idx = idx; in cpudl_heapify_down()
64 cp->elements[idx].cpu = orig_cpu; in cpudl_heapify_down()
65 cp->elements[idx].dl = orig_dl; in cpudl_heapify_down()
[all …]
/linux/drivers/acpi/
H A Dpfr_update.c137 out_obj->package.elements[CAP_STATUS_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
138 out_obj->package.elements[CAP_UPDATE_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
139 out_obj->package.elements[CAP_CODE_TYPE_IDX].type != ACPI_TYPE_BUFFER || in query_capability()
140 out_obj->package.elements[CAP_FW_VER_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
141 out_obj->package.elements[CAP_CODE_RT_VER_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
142 out_obj->package.elements[CAP_DRV_TYPE_IDX].type != ACPI_TYPE_BUFFER || in query_capability()
143 out_obj->package.elements[CAP_DRV_RT_VER_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
144 out_obj->package.elements[CAP_DRV_SVN_IDX].type != ACPI_TYPE_INTEGER || in query_capability()
145 out_obj->package.elements[CAP_PLAT_ID_IDX].type != ACPI_TYPE_BUFFER || in query_capability()
146 out_obj->package.elements[CAP_OEM_ID_IDX].type != ACPI_TYPE_BUFFER || in query_capability()
[all …]
H A 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 …]
H A 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()
H A Dproperty.c96 dn->name = link->package.elements[0].string.pointer; in acpi_nondev_subnode_extract()
161 status = acpi_get_handle(scope, link->package.elements[1].string.pointer, in acpi_nondev_subnode_ok()
195 link = &links->package.elements[i]; in acpi_add_nondev_subnodes()
196 /* Only two elements allowed. */ in acpi_add_nondev_subnodes()
201 if (link->package.elements[0].type != ACPI_TYPE_STRING) in acpi_add_nondev_subnodes()
205 switch (link->package.elements[1].type) { in acpi_add_nondev_subnodes()
233 link->package.elements[0].string.pointer); in acpi_add_nondev_subnodes()
234 desc = &link->package.elements[1]; in acpi_add_nondev_subnodes()
245 link->package.elements[0].string.pointer); in acpi_add_nondev_subnodes()
269 guid = &desc->package.elements[i]; in acpi_enumerate_nondev_subnodes()
[all …]
/linux/include/uapi/linux/
H A 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/drivers/platform/x86/intel/int1092/
H A 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()
228 out->package.elements[0].type == ACPI_TYPE_INTEGER && in sar_get_data()
229 out->package.elements[1].type == ACPI_TYPE_INTEGER && in sar_get_data()
230 out->package.elements[2].type == ACPI_TYPE_PACKAGE && in sar_get_data()
231 out->package.elements[2].package.count > 0) { in sar_get_data()
[all …]
/linux/fs/xfs/
H A 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/tools/perf/pmu-events/arch/arm64/fujitsu/a64fx/
H A 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/drivers/net/ethernet/intel/i40e/
H A Di40e_diag.c48 /* offset mask elements stride */
81 u32 elements; in i40e_diag_reg_test() local
87 elements = i40e_reg_list[i].elements; in i40e_diag_reg_test()
91 elements = hw->func_caps.num_tx_qp; in i40e_diag_reg_test()
98 elements = hw->func_caps.num_msix_vectors - 1; in i40e_diag_reg_test()
102 for (j = 0; j < elements && !ret_code; j++) { in i40e_diag_reg_test()
/linux/drivers/net/ipa/
H A Dgsi_trans.h77 * @size: Size of elements in the pool
78 * @count: Minimum number of elements in the pool
79 * @max_alloc: Maximum number of elements allocated at a time from pool
87 * gsi_trans_pool_alloc() - Allocate one or more elements from a pool
89 * @count: Number of elements to allocate from the pool
105 * @size: Size of elements in the pool
106 * @count: Minimum number of elements in the pool
107 * @max_alloc: Maximum number of elements allocated at a time from pool
148 * @tre_count: Number of elements in the transaction
/linux/tools/perf/pmu-events/arch/arm64/arm/neoverse-n2-v2/
H A Dsve.json12 …tion": "Counts speculatively executed predicated SVE operations with no active predicate elements."
16 …ion": "Counts speculatively executed predicated SVE operations with all predicate elements active."
20 …tively executed predicated SVE operations with at least one but not all active predicate elements."
24 … speculatively executed predicated SVE operations with at least one non active predicate elements."
/linux/lib/
H A Dbsearch.c14 * bsearch - binary search an array of elements
17 * @num: number of elements
25 * Note that the key need not have the same type as the elements in
28 * the key and elements in the array are of the same type, you can use
H A Dsort.c23 * Returns true if elements can be copied using word loads and stores.
43 * swap_words_32 - swap two elements in 32-bit chunks
66 * swap_words_64 - swap two elements in 64-bit chunks
102 * swap_bytes - swap two elements a byte at a time
220 * 1. elements [a,n) satisfy the heap property (compare greater than in __sort_r()
222 * 2. elements [n,num*size) are sorted, and in __sort_r()
230 else if (n > 3 * size) { /* Sorting: Extract two largest elements */ in __sort_r()
248 * Because elements tend to sift down close to the leaves, in __sort_r()
278 * sort_r - sort an array of elements
280 * @num: number of elements
[all …]
/linux/include/xen/interface/io/
H A Dvscsiif.h60 * Specifies the maximum number of scatter/gather elements in grant pages
62 * SG elements specified directly in the request.
176 * seg[] array and the number of valid scsiif_request_segment elements is to be
180 * than VSCSIIF_SG_TABLESIZE scsiif_request_segment elements via indirection.
181 * The maximum number of allowed scsiif_request_segment elements is the value
187 * elements referencing the target data buffers is calculated from the lengths
188 * of the seg[] elements (the sum of all valid seg[].length divided by the
206 * Preset scatter/gather elements for a following request. Deprecated.
216 * elements needed, we decided to use 26 as a magic number.
218 * If "feature-sg-grant" is set, more scatter/gather elements can be specified
[all …]
/linux/drivers/acpi/x86/
H A 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()
103 newprops->package.elements = &newprops[1]; in acpi_extract_apple_properties()
107 union acpi_object *key = &props->package.elements[i * 2]; in acpi_extract_apple_properties()
108 union acpi_object *val = &props->package.elements[i * 2 + 1]; in acpi_extract_apple_properties()
114 newprops[1 + j].package.elements = &newprops[k]; in acpi_extract_apple_properties()
/linux/drivers/scsi/lpfc/
H A Dlpfc_mem.c45 #define LPFC_MBUF_POOL_SIZE 64 /* max elements in MBUF safety pool */
47 #define LPFC_DEVICE_DATA_POOL_SIZE 64 /* max elements in device data pool */
48 #define LPFC_RRQ_POOL_SIZE 256 /* max elements in non-DMA pool */
49 #define LPFC_MBX_POOL_SIZE 256 /* max elements in MBX non-DMA pool */
121 pool->elements = kmalloc_objs(struct lpfc_dmabuf, LPFC_MBUF_POOL_SIZE); in lpfc_mem_alloc()
122 if (!pool->elements) in lpfc_mem_alloc()
128 pool->elements[i].virt = dma_pool_alloc(phba->lpfc_mbuf_pool, in lpfc_mem_alloc()
129 GFP_KERNEL, &pool->elements[i].phys); in lpfc_mem_alloc()
130 if (!pool->elements[i].virt) in lpfc_mem_alloc()
201 dma_pool_free(phba->lpfc_mbuf_pool, pool->elements[i].virt, in lpfc_mem_alloc()
[all …]
/linux/rust/kernel/alloc/
H A Dkvec.rs105 /// capacity of the vector (the number of elements that currently fit into the vector), its length
106 /// (the number of elements that are currently stored in the vector) and the `Allocator` type used
112 /// [`Vec`]'s backing buffer gets, if required, automatically increased (re-allocated) when elements
120 /// - `self.len` always represents the exact number of elements stored in the vector.
122 /// - `self.layout` represents the absolute number of elements that can be stored within the vector
135 /// elements we can still store without reallocating.
180 // SAFETY: `Vec` is `Send` if `T` is `Send` because `Vec` owns its elements. in is_zst()
188 // SAFETY: `Vec` is `Sync` if `T` is `Sync` because `Vec` owns its elements. in capacity()
205 /// Returns the number of elements that can be stored within the vector without allocating in inc_len()
215 /// Returns the number of elements store
1438 elements: slice::IterMut<'vec, T>, global() field
[all...]
/linux/tools/perf/pmu-events/arch/arm64/arm/neoverse-v1/
H A Dsve.json12 …tion": "Counts speculatively executed predicated SVE operations with no active predicate elements."
16 …ion": "Counts speculatively executed predicated SVE operations with all predicate elements active."
20 …tively executed predicated SVE operations with at least one but not all active predicate elements."
/linux/drivers/char/tpm/
H A Dtpm_ppi.c96 obj->package.elements[0].type == ACPI_TYPE_INTEGER && in tpm_show_ppi_request()
97 obj->package.elements[1].type == ACPI_TYPE_INTEGER && in tpm_show_ppi_request()
98 obj->package.elements[2].type == ACPI_TYPE_INTEGER) { in tpm_show_ppi_request()
99 if (obj->package.elements[0].integer.value) in tpm_show_ppi_request()
102 req = obj->package.elements[1].integer.value; in tpm_show_ppi_request()
105 obj->package.elements[2].integer.value); in tpm_show_ppi_request()
110 obj->package.elements[0].type == ACPI_TYPE_INTEGER && in tpm_show_ppi_request()
111 obj->package.elements[1].type == ACPI_TYPE_INTEGER) { in tpm_show_ppi_request()
112 if (obj->package.elements[0].integer.value) in tpm_show_ppi_request()
116 obj->package.elements[1].integer.value); in tpm_show_ppi_request()
[all …]
/linux/drivers/platform/x86/hp/hp-bioscfg/
H A Dorder-list-attributes.c71 ATTRIBUTE_VALUES_PROPERTY_SHOW(elements, ordered_list, SEMICOLON_SEP);
73 __ATTR_RO(elements);
199 …pr_warn("Prerequisites size value exceeded the maximum number of elements supported or data may be… in hp_populate_ordered_list_elements_from_package()
243 …pr_warn("Order List size value exceeded the maximum number of elements supported or data may be ma… in hp_populate_ordered_list_elements_from_package()
272 strscpy(ordered_list_data->elements[olist_elem], part); in hp_populate_ordered_list_elements_from_package()
364 /* Report a message and limit elements size to maximum value */ in hp_populate_ordered_list_elements_from_buffer()
365 …pr_warn("Ordered List size value exceeded the maximum number of elements supported or data may be … in hp_populate_ordered_list_elements_from_buffer()
372 ordered_list_data->elements[values], in hp_populate_ordered_list_elements_from_buffer()
373 sizeof(ordered_list_data->elements[values])); in hp_populate_ordered_list_elements_from_buffer()
399 /* Populate ordered list elements */ in hp_populate_ordered_list_buffer_data()
/linux/drivers/scsi/aic7xxx/
H A Dqueue.h37 * A singly-linked list is headed by a single forward pointer. The elements
39 * the expense of O(n) removal for arbitrary elements. New elements can be
41 * Elements being removed from the head of the list should use the explicit
48 * head of the list and the other to the tail of the list. The elements are
50 * expense of O(n) removal for arbitrary elements. New elements can be added
52 * end of the list. Elements being removed from the head of the tail queue
59 * pointers for a hash table header). The elements are doubly linked
61 * traverse the list. New elements can be added to the list before
66 * list and the other to the tail of the list. The elements are doubly
68 * traverse the list. New elements can be added to the list before or
[all …]
/linux/tools/lib/
H A Dlist_sort.c92 * @cmp: the elements comparison function
118 * merged to a size-2^(k+1) list as soon as we have 2^k following elements.
120 * Thus, it will avoid cache thrashing as long as 3*2^k elements can
126 * The merging is controlled by "count", the number of elements in the
135 * 2^k, which is when we have 2^k elements pending in smaller lists,
167 * 5 above, you can see that the number of elements we merge with a list
177 if (list == head->prev) /* Zero or one elements */ in list_sort()
193 * of following pending elements equals their size (i.e. in list_sort()
/linux/arch/powerpc/perf/
H A Dhv-24x7.h116 * 0 = not all result elements fit into the buffer, additional requests
118 * 1 = all result elements were returned
126 * Warning: to obtain the size of each element in @elements you have
141 char elements[]; member
/linux/drivers/input/misc/
H A Dsoc_button_array.c273 soc_button_get_acpi_object_int(&desc->package.elements[0]) != 1 || in soc_button_parse_btn_desc()
275 soc_button_get_acpi_object_int(&desc->package.elements[2]) != in soc_button_parse_btn_desc()
284 soc_button_get_acpi_object_int(&desc->package.elements[1]); in soc_button_parse_btn_desc()
285 upage = soc_button_get_acpi_object_int(&desc->package.elements[3]); in soc_button_parse_btn_desc()
286 usage = soc_button_get_acpi_object_int(&desc->package.elements[4]); in soc_button_parse_btn_desc()
358 uuid = &desc->package.elements[i]; in soc_button_get_button_info()
362 desc->package.elements[i + 1].type != ACPI_TYPE_PACKAGE) { in soc_button_get_button_info()
367 btns_desc = &desc->package.elements[i + 1]; in soc_button_get_button_info()
379 el0 = &btns_desc->package.elements[0]; in soc_button_get_button_info()
383 soc_button_get_acpi_object_int(&el0->package.elements[0]) == 0 && in soc_button_get_button_info()
[all …]

12345678910>>...40