| /linux/kernel/sched/ |
| H A D | cpudeadline.c | 30 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 D | pfr_update.c | 137 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 D | pfr_telemetry.c | 91 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 D | acpi_adxl.c | 55 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/net/wireless/intel/iwlwifi/fw/ |
| H A D | acpi.c | 290 data->package.elements[0].type != ACPI_TYPE_INTEGER) { in iwl_acpi_get_wifi_pkg_range() 295 *tbl_rev = data->package.elements[0].integer.value; in iwl_acpi_get_wifi_pkg_range() 301 wifi_pkg = &data->package.elements[i]; in iwl_acpi_get_wifi_pkg_range() 309 domain = &wifi_pkg->package.elements[0]; in iwl_acpi_get_wifi_pkg_range() 351 wifi_pkg->package.elements[1].type != ACPI_TYPE_INTEGER) { in iwl_acpi_get_tas_table() 356 tas_selection = (u32)wifi_pkg->package.elements[1].integer.value; in iwl_acpi_get_tas_table() 369 if (wifi_pkg->package.elements[2].type != ACPI_TYPE_INTEGER || in iwl_acpi_get_tas_table() 370 wifi_pkg->package.elements[2].integer.value > in iwl_acpi_get_tas_table() 373 wifi_pkg->package.elements[2].integer.value); in iwl_acpi_get_tas_table() 378 block_list_size = wifi_pkg->package.elements[2].integer.value; in iwl_acpi_get_tas_table() [all …]
|
| /linux/net/netfilter/ipset/ |
| H A D | ip_set_bitmap_ip.c | 43 u32 elements; /* number of max elements in the set */ member 218 u32 elements, u32 hosts, u8 netmask) in init_map_ip() argument 220 map->members = bitmap_zalloc(elements, GFP_KERNEL | __GFP_NOWARN); in init_map_ip() 225 map->elements = elements; in init_map_ip() 255 u64 elements; in bitmap_ip_create() local 296 elements = (u64)last_ip - first_ip + 1; in bitmap_ip_create() 309 elements = 2UL << (netmask - mask_bits - 1); in bitmap_ip_create() 311 if (elements > IPSET_BITMAP_MAX_RANGE + 1) in bitmap_ip_create() 314 pr_debug("hosts %u, elements %llu\n", in bitmap_ip_create() 315 hosts, (unsigned long long)elements); in bitmap_ip_create() [all …]
|
| H A D | ip_set_bitmap_gen.h | 53 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() 170 set->elements++; in mtype_add() 187 set->elements--; in mtype_del() 218 for (; cb->args[IPSET_CB_ARG0] < map->elements; in mtype_list() [all …]
|
| H A D | ip_set_bitmap_ipmac.c | 49 u32 elements; /* number of max elements in the set */ member 106 /* Timer not started for the incomplete elements */ in bitmap_ipmac_gc_test() 301 u32 first_ip, u32 last_ip, u32 elements) in init_map_ipmac() argument 303 map->members = bitmap_zalloc(elements, GFP_KERNEL | __GFP_NOWARN); in init_map_ipmac() 308 map->elements = elements; in init_map_ipmac() 323 u64 elements; in bitmap_ipmac_create() local 352 elements = (u64)last_ip - first_ip + 1; in bitmap_ipmac_create() 354 if (elements > IPSET_BITMAP_MAX_RANGE + 1) in bitmap_ipmac_create() 360 map = ip_set_alloc(sizeof(*map) + elements * set->dsize); in bitmap_ipmac_create() 364 map->memsize = BITS_TO_LONGS(elements) * sizeof(unsigned long); in bitmap_ipmac_create() [all …]
|
| H A D | ip_set_bitmap_port.c | 36 u32 elements; /* number of max elements in the set */ member 234 map->members = bitmap_zalloc(map->elements, GFP_KERNEL | __GFP_NOWARN); in init_map_port() 254 u32 elements; in bitmap_port_create() local 267 elements = last_port - first_port + 1; in bitmap_port_create() 269 map = ip_set_alloc(sizeof(*map) + elements * set->dsize); in bitmap_port_create() 273 map->elements = elements; in bitmap_port_create() 274 map->memsize = BITS_TO_LONGS(elements) * sizeof(unsigned long); in bitmap_port_create()
|
| /linux/include/uapi/linux/ |
| H A D | chio.h | 27 * 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/pmc/ |
| H A D | pwrm_telemetry.c | 48 if (pkg->package.elements[0].type != ACPI_TYPE_STRING) in is_valid_entry() 52 if (pkg->package.elements[i].type != ACPI_TYPE_INTEGER) in is_valid_entry() 74 vsec_pkg = &obj->package.elements[0]; in pmc_parse_telem_dsd() 78 hdr0 = vsec_pkg->package.elements[3].integer.value; in pmc_parse_telem_dsd() 79 hdr1 = vsec_pkg->package.elements[4].integer.value; in pmc_parse_telem_dsd() 88 disc_pkg = &obj->package.elements[1]; in pmc_parse_telem_dsd() 106 pkg = &disc_pkg->package.elements[i]; in pmc_parse_telem_dsd() 112 value = pkg->package.elements[j].integer.value; in pmc_parse_telem_dsd() 135 uuid_obj = &dsd->package.elements[i]; in pmc_find_telem_guid() 136 data_obj = &dsd->package.elements[i + 1]; in pmc_find_telem_guid()
|
| /linux/drivers/platform/x86/intel/int1092/ |
| H A D | intel_sar.c | 83 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/Documentation/core-api/ |
| H A D | min_heap.rst | 50 size_t nr; /* Number of elements in the heap */ 51 size_t size; /* Maximum number of elements that can be held */ 58 A typical heap structure will include a counter for the number of elements 60 elements (`data`). Optionally, you can specify a static array for preallocated 67 elements in the heap and swapping them. It contains two function pointers: 76 - **less** is the comparison function used to establish the order of elements. 77 - **swp** is a function for swapping elements in the heap. If swp is set to 78 NULL, the default swap function will be used, which swaps the elements based on their size 97 - **data**: A pointer to the buffer where the heap elements will be stored. If 99 - **size**: The maximum number of elements the heap can hold. [all …]
|
| /linux/fs/xfs/ |
| H A D | xfs_mru_cache.c | 13 * 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 D | pipeline.json | 141 … 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 D | gsi_trans.h | 77 * @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 D | i40e_diag.c | 48 /* 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 D | vscsiif.h | 60 * 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/rust/kernel/alloc/ |
| H A D | kvec.rs | 105 /// 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/drivers/scsi/lpfc/ |
| H A D | lpfc_mem.c | 45 #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/drivers/acpi/x86/ |
| H A D | apple.c | 24 * 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/tools/perf/pmu-events/arch/arm64/arm/neoverse-n2-v2/ |
| H A D | sve.json | 12 …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 D | bsearch.c | 14 * 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 D | sort.c | 23 * 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/drivers/char/tpm/ |
| H A D | tpm_ppi.c | 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 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 …]
|