Home
last modified time | relevance | path

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

12345678910>>...52

/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/staging/octeon/
H A 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/drivers/acpi/acpica/
H A 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 …]
H A 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 …]
H A 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/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 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/drivers/soc/qcom/
H A 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/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/include/linux/
H A Dkfifo.h113 * @type: type of the fifo elements
120 * @type: type of the fifo elements
121 * @size: the number of elements in the fifo, this must be a power of 2
143 * @type: type of the fifo elements
144 * @size: the number of elements in the fifo, this must be a power of 2
201 * kfifo_size - returns the size of the fifo in elements
235 * kfifo_len - returns the number of used elements in the fifo
296 * kfifo_avail - returns the number of unused elements in the fifo
352 * @size: the number of elements in the fifo, this must be a power of 2
357 * The number of elements will be rounded-up to a power of 2.
[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/net/netfilter/ipset/
H A Dip_set_bitmap_gen.h53 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 …]
H A 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/mm/
H A Dmempool.c142 pool->elements[pool->curr_nr++] = element; in add_element()
147 void *element = pool->elements[--pool->curr_nr]; in remove_element()
160 * Free all reserved elements in @pool and @pool itself. This function
172 kfree(pool->elements); in mempool_exit()
173 pool->elements = NULL; in mempool_exit()
182 * Free all reserved elements in @pool and @pool itself. This function
209 pool->elements = kmalloc_array_node(max(1, min_nr), sizeof(void *), in mempool_init_node()
211 if (!pool->elements) in mempool_init_node()
236 * @min_nr: the minimum number of elements guaranteed to be
258 * @min_nr: the minimum number of elements guaranteed to be
[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/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/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/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/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_array(LPFC_MBUF_POOL_SIZE, in lpfc_mem_alloc()
124 if (!pool->elements) in lpfc_mem_alloc()
130 pool->elements[i].virt = dma_pool_alloc(phba->lpfc_mbuf_pool, in lpfc_mem_alloc()
131 GFP_KERNEL, &pool->elements[i].phys); in lpfc_mem_alloc()
132 if (!pool->elements[i].virt) in lpfc_mem_alloc()
203 dma_pool_free(phba->lpfc_mbuf_pool, pool->elements[i].virt, in lpfc_mem_alloc()
[all …]
/linux/rust/kernel/alloc/
H A Dkvec.rs79 /// capacity of the vector (the number of elements that currently fit into the vector), its length
80 /// (the number of elements that are currently stored in the vector) and the `Allocator` type used
86 /// [`Vec`]'s backing buffer gets, if required, automatically increased (re-allocated) when elements
94 /// - `self.len` always represents the exact number of elements stored in the vector.
96 /// - `self.layout` represents the absolute number of elements that can be stored within the vector
109 /// elements we can still store without reallocating.
154 // SAFETY: `Vec` is `Send` if `T` is `Send` because `Vec` owns its elements.
162 // SAFETY: `Vec` is `Sync` if `T` is `Sync` because `Vec` owns its elements.
179 /// Returns the number of elements that can be stored within the vector without allocating
189 /// Returns the number of elements stored within the vector.
[all …]
/linux/drivers/char/tpm/
H A Dtpm_ppi.c82 obj->package.elements[0].type == ACPI_TYPE_INTEGER && in tpm_show_ppi_request()
83 obj->package.elements[1].type == ACPI_TYPE_INTEGER && in tpm_show_ppi_request()
84 obj->package.elements[2].type == ACPI_TYPE_INTEGER) { in tpm_show_ppi_request()
85 if (obj->package.elements[0].integer.value) in tpm_show_ppi_request()
88 req = obj->package.elements[1].integer.value; in tpm_show_ppi_request()
91 obj->package.elements[2].integer.value); in tpm_show_ppi_request()
96 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 if (obj->package.elements[0].integer.value) in tpm_show_ppi_request()
102 obj->package.elements[1].integer.value); in tpm_show_ppi_request()
[all …]
/linux/tools/lib/bpf/
H A Dbpf.h179 * elements in a BPF map.
184 * number of elements in the map to delete in batch;
186 * elements if the output **count** value is not equal to the input **count** value
197 * @brief **bpf_map_lookup_batch()** allows for batch lookup of BPF map elements.
219 * @param count input and output parameter; on input it's the number of elements
220 * in the map to read in batch; on output it's the number of elements that were
222 * If a non-EFAULT error is returned, count will be set as the number of elements
235 * of BPF map elements where each element is deleted after being retrieved.
246 * @param count input and output parameter; on input it's the number of elements
248 * elements tha
[all...]
/linux/drivers/platform/x86/dell/dell-wmi-sysman/
H A Dsysman.c394 union acpi_object *elements; in init_bios_attributes() local
433 pr_err("Error: ACPI-package does not have enough elements: %d < %d\n", in init_bios_attributes()
438 elements = obj->package.elements; in init_bios_attributes()
441 if (elements[ATTR_NAME].type != ACPI_TYPE_STRING) { in init_bios_attributes()
445 if (strlen(elements[ATTR_NAME].string.pointer) == 0) { in init_bios_attributes()
454 duplicate = kset_find_obj(tmp_set, elements[ATTR_NAME].string.pointer); in init_bios_attributes()
457 elements[ATTR_NAME].string.pointer); in init_bios_attributes()
472 elements[ATTR_NAME].string.pointer); in init_bios_attributes()
481 retval = populate_enum_data(elements, instance_id, attr_name_kobj, in init_bios_attributes()
485 retval = populate_int_data(elements, instance_id, attr_name_kobj); in init_bios_attributes()
[all …]
/linux/Documentation/arch/sparc/oradax/
H A Ddax-hv-api.txt244 36.2.1.1. Supported Data Formats, Elements Sizes and Offsets
303 …For primary input data streams with fixed size elements, the element size must be indicated in the…
311 …ant bit within a byte. There are two encoding options for the secondary input stream data elements,
352 0x0 Byte aligned, 1 byte elements
353 0x1 Byte aligned, 2 byte elements
354 0x2 Byte aligned, 4 byte elements
355 0x3 Byte aligned, 8 byte elements
356 0x4 16 byte aligned, 16 byte elements
360 0x8 Packed vector of single bit elements
365 0xD 2 byte elements where each element is the index value of a bit,
[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()

12345678910>>...52