/Linux-v5.10/kernel/sched/ |
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-v5.10/drivers/staging/octeon/ |
D | ethernet-mem.c | 20 * @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-v5.10/drivers/acpi/acpica/ |
D | nsprepkg.c | 22 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 …]
|
D | dspkginit.c | 31 * 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 …]
|
D | nsrepair2.c | 88 acpi_ns_sort_list(union acpi_operand_object **elements, 332 * If a Package, ensure same for all string elements. 362 element_ptr = return_object->package.elements; in acpi_ns_repair_CID() 424 outer_elements = &return_object->package.elements[i + 1]; in acpi_ns_repair_CST() 437 obj_desc = (*outer_elements)->package.elements[1]; /* Index1 = Type */ in acpi_ns_repair_CST() 458 obj_desc = return_object->package.elements[0]; in acpi_ns_repair_CST() 586 top_object_list = package_object->package.elements; in acpi_ns_repair_PRT() 593 sub_object_list = sub_package->package.elements; in acpi_ns_repair_PRT() 648 union acpi_operand_object **elements; in acpi_ns_repair_PSS() local 672 outer_elements = return_object->package.elements; in acpi_ns_repair_PSS() [all …]
|
/Linux-v5.10/Documentation/devicetree/bindings/net/can/ |
D | bosch,m_can.yaml | 64 the following elements start from. This is usually set to 66 are used to specify how many elements are used for each FIFO/Buffer. 68 M_CAN includes the following elements according to user manual: 69 11-bit Filter 0-128 elements / 0-128 words 70 29-bit Filter 0-64 elements / 0-128 words 71 Rx FIFO 0 0-64 elements / 0-1152 words 72 Rx FIFO 1 0-64 elements / 0-1152 words 73 Rx Buffers 0-64 elements / 0-1152 words 74 Tx Event FIFO 0-32 elements / 0-64 words 75 Tx Buffers 0-32 elements / 0-576 words [all …]
|
/Linux-v5.10/drivers/net/wireless/intel/iwlwifi/fw/ |
D | acpi.c | 199 data->package.elements[0].type != ACPI_TYPE_INTEGER || in iwl_acpi_get_wifi_pkg() 200 data->package.elements[0].integer.value > 1) { in iwl_acpi_get_wifi_pkg() 205 *tbl_rev = data->package.elements[0].integer.value; in iwl_acpi_get_wifi_pkg() 211 wifi_pkg = &data->package.elements[i]; in iwl_acpi_get_wifi_pkg() 218 domain = &wifi_pkg->package.elements[0]; in iwl_acpi_get_wifi_pkg() 251 if (wifi_pkg->package.elements[0].type != ACPI_TYPE_INTEGER || in iwl_acpi_get_tas() 257 enabled = !!wifi_pkg->package.elements[0].integer.value; in iwl_acpi_get_tas() 266 if (wifi_pkg->package.elements[1].type != ACPI_TYPE_INTEGER || in iwl_acpi_get_tas() 267 wifi_pkg->package.elements[1].integer.value > in iwl_acpi_get_tas() 270 wifi_pkg->package.elements[1].integer.value); in iwl_acpi_get_tas() [all …]
|
/Linux-v5.10/drivers/soc/qcom/ |
D | qmi_encdec.c | 72 * 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-v5.10/include/xen/interface/io/ |
D | vscsiif.h | 77 * Specifies the maximum number of scatter/gather elements in grant pages 79 * SG elements specified directly in the request. 124 * seg[] array and the number of valid scsiif_request_segment elements is to be 128 * than VSCSIIF_SG_TABLESIZE scsiif_request_segment elements via indirection. 129 * The maximum number of allowed scsiif_request_segment elements is the value 135 * elements referencing the target data buffers is calculated from the lengths 136 * of the seg[] elements (the sum of all valid seg[].length divided by the 153 * Preset scatter/gather elements for a following request. Deprecated. 163 * elements needed, we decided to use 26 as a magic number. 165 * If "feature-sg-grant" is set, more scatter/gather elements can be specified [all …]
|
/Linux-v5.10/net/netfilter/ipset/ |
D | ip_set_bitmap_ip.c | 43 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 …]
|
D | ip_set_bitmap_gen.h | 50 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 …]
|
D | ip_set_bitmap_ipmac.c | 48 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-v5.10/include/uapi/linux/ |
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-v5.10/drivers/staging/media/atomisp/pci/base/circbuf/interface/ |
D | ia_css_circbuf.h | 38 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-v5.10/fs/xfs/ |
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-v5.10/include/linux/ |
D | kfifo.h | 108 * @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 …]
|
D | mempool.h | 18 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-v5.10/drivers/net/ipa/ |
D | gsi_trans.h | 74 * @size: Size of elements in the pool 75 * @count: Minimum number of elements in the pool 76 * @max_alloc: Maximum number of elements allocated at a time from pool 84 * gsi_trans_pool_alloc() - Allocate one or more elements from a pool 86 * @count: Number of elements to allocate from the pool 102 * @size: Size of elements in the pool 103 * @count: Minimum number of elements in the pool 104 * @max_alloc: Maximum number of elements allocated at a time from pool 134 * @tre_count: Number of elements in the transaction
|
/Linux-v5.10/drivers/acpi/ |
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-v5.10/drivers/acpi/x86/ |
D | apple.c | 23 * alternating key/value elements, unlike _DSD which stores them as a package 68 union acpi_object *key = &props->package.elements[i * 2]; in acpi_extract_apple_properties() 69 union acpi_object *val = &props->package.elements[i * 2 + 1]; in acpi_extract_apple_properties() 99 newprops->package.elements = &newprops[1]; in acpi_extract_apple_properties() 103 union acpi_object *key = &props->package.elements[i * 2]; in acpi_extract_apple_properties() 104 union acpi_object *val = &props->package.elements[i * 2 + 1]; in acpi_extract_apple_properties() 110 newprops[1 + j].package.elements = &newprops[k]; in acpi_extract_apple_properties()
|
/Linux-v5.10/mm/ |
D | mempool.c | 125 pool->elements[pool->curr_nr++] = element; in add_element() 130 void *element = pool->elements[--pool->curr_nr]; in remove_element() 143 * Free all reserved elements in @pool and @pool itself. This function 155 kfree(pool->elements); in mempool_exit() 156 pool->elements = NULL; in mempool_exit() 165 * Free all reserved elements in @pool and @pool itself. This function 189 pool->elements = kmalloc_array_node(min_nr, sizeof(void *), in mempool_init_node() 191 if (!pool->elements) in mempool_init_node() 215 * @min_nr: the minimum number of elements guaranteed to be 237 * @min_nr: the minimum number of elements guaranteed to be [all …]
|
/Linux-v5.10/lib/ |
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
|
/Linux-v5.10/drivers/char/tpm/ |
D | tpm_ppi.c | 82 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() 92 obj->package.elements[2].integer.value); in tpm_show_ppi_request() 98 obj->package.elements[0].type == ACPI_TYPE_INTEGER && in tpm_show_ppi_request() 99 obj->package.elements[1].type == ACPI_TYPE_INTEGER) { in tpm_show_ppi_request() 100 if (obj->package.elements[0].integer.value) in tpm_show_ppi_request() 104 obj->package.elements[1].integer.value); in tpm_show_ppi_request() [all …]
|
/Linux-v5.10/drivers/scsi/lpfc/ |
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 */ 97 pool->elements = kmalloc_array(LPFC_MBUF_POOL_SIZE, in lpfc_mem_alloc() 100 if (!pool->elements) in lpfc_mem_alloc() 106 pool->elements[i].virt = dma_pool_alloc(phba->lpfc_mbuf_pool, in lpfc_mem_alloc() 107 GFP_KERNEL, &pool->elements[i].phys); in lpfc_mem_alloc() 108 if (!pool->elements[i].virt) in lpfc_mem_alloc() 179 dma_pool_free(phba->lpfc_mbuf_pool, pool->elements[i].virt, in lpfc_mem_alloc() 180 pool->elements[i].phys); in lpfc_mem_alloc() [all …]
|
/Linux-v5.10/Documentation/sparc/oradax/ |
D | dax-hv-api.txt | 244 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 …]
|