Searched refs:new_n (Results 1 - 8 of 8) sorted by path
/linux-master/arch/arm64/kvm/ |
H A D | sys_regs.c | 1272 u8 new_n = FIELD_GET(ARMV8_PMU_PMCR_N, val); local 1283 new_n <= kvm_arm_pmu_get_max_counters(kvm)) 1284 kvm->arch.pmcr_n = new_n;
|
/linux-master/drivers/gpu/drm/amd/amdkfd/ |
H A D | kfd_svm.c | 927 uint64_t new_start, uint64_t new_n, uint64_t *new_vram_pages) 940 new = svm_range_copy_array(pold, size, new_n, d, new_vram_pages); 943 d = (new_start == old_start) ? new_n * size : 0; 925 svm_range_split_array(void *ppnew, void *ppold, size_t size, uint64_t old_start, uint64_t old_n, uint64_t new_start, uint64_t new_n, uint64_t *new_vram_pages) argument
|
/linux-master/include/linux/ |
H A D | device.h | 331 devm_krealloc_array(struct device *dev, void *p, size_t new_n, size_t new_size, gfp_t flags) argument 335 if (unlikely(check_mul_overflow(new_n, new_size, &bytes)))
|
H A D | slab.h | 671 * @new_n: new number of elements to alloc 676 size_t new_n, 682 if (unlikely(check_mul_overflow(new_n, new_size, &bytes))) 675 krealloc_array(void *p, size_t new_n, size_t new_size, gfp_t flags) argument
|
/linux-master/kernel/bpf/ |
H A D | log.c | 64 u32 new_n, n; local 80 new_n = 0; 82 new_n = min_t(u32, log->len_total - log->end_pos, n); 83 log->kbuf[new_n - 1] = '\0'; 89 if (log->ubuf && new_n && 90 copy_to_user(log->ubuf + cur_pos, log->kbuf, new_n)) 94 u32 buf_start, buf_end, new_n; local 108 new_n = min(n, log->len_total); 109 cur_pos = new_end - new_n; 128 log->kbuf + n - new_n, [all...] |
H A D | verifier.c | 1231 /* resize an array from old_n items to new_n items. the array is reallocated if it's too 1232 * small to hold new_n items. new items are zeroed out if the array grows. 1234 * Contrary to krealloc_array, does not free arr if new_n is zero. 1236 static void *realloc_array(void *arr, size_t old_n, size_t new_n, size_t size) argument 1241 if (!new_n || old_n == new_n) 1244 alloc_size = kmalloc_size_roundup(size_mul(new_n, size)); 1252 if (new_n > old_n) 1253 memset(arr + old_n * size, 0, (new_n - old_n) * size);
|
/linux-master/lib/ |
H A D | assoc_array.c | 1459 struct assoc_array_node *node, *new_n; local 1508 new_n = kzalloc(sizeof(struct assoc_array_node), GFP_KERNEL); 1509 if (!new_n) 1511 pr_devel("dup node %p -> %p\n", node, new_n); 1512 new_n->back_pointer = new_parent; 1513 new_n->parent_slot = node->parent_slot; 1514 *new_ptr_pp = new_parent = assoc_array_node_to_ptr(new_n); 1531 new_n->slots[slot] = ptr; 1535 new_ptr_pp = &new_n->slots[slot]; 1541 pr_devel("-- compress node %p --\n", new_n); [all...] |
/linux-master/tools/virtio/linux/ |
H A D | kernel.h | 118 static inline void *krealloc_array(void *p, size_t new_n, size_t new_size, gfp_t gfp) argument 122 if (unlikely(check_mul_overflow(new_n, new_size, &bytes)))
|
Completed in 365 milliseconds