| /kernel/linux/linux-5.10/lib/ |
| H A D | assoc_array.c | 1460 struct assoc_array_node *node, *new_n; in assoc_array_gc() local
1510 new_n = kzalloc(sizeof(struct assoc_array_node), GFP_KERNEL); in assoc_array_gc()
1511 if (!new_n) in assoc_array_gc()
1513 pr_devel("dup node %p -> %p\n", node, new_n); in assoc_array_gc()
1514 new_n->back_pointer = new_parent; in assoc_array_gc()
1515 new_n->parent_slot = node->parent_slot; in assoc_array_gc()
1516 *new_ptr_pp = new_parent = assoc_array_node_to_ptr(new_n); in assoc_array_gc()
1533 new_n->slots[slot] = ptr; in assoc_array_gc()
1537 new_ptr_pp = &new_n->slots[slot]; in assoc_array_gc()
1543 pr_devel("-- compress node %p --\n", new_n); in assoc_array_gc()
[all...] |
| /kernel/linux/linux-6.6/lib/ |
| H A D | assoc_array.c | 1459 struct assoc_array_node *node, *new_n; in assoc_array_gc() local
1508 new_n = kzalloc(sizeof(struct assoc_array_node), GFP_KERNEL); in assoc_array_gc()
1509 if (!new_n) in assoc_array_gc()
1511 pr_devel("dup node %p -> %p\n", node, new_n); in assoc_array_gc()
1512 new_n->back_pointer = new_parent; in assoc_array_gc()
1513 new_n->parent_slot = node->parent_slot; in assoc_array_gc()
1514 *new_ptr_pp = new_parent = assoc_array_node_to_ptr(new_n); in assoc_array_gc()
1531 new_n->slots[slot] = ptr; in assoc_array_gc()
1535 new_ptr_pp = &new_n->slots[slot]; in assoc_array_gc()
1541 pr_devel("-- compress node %p --\n", new_n); in assoc_array_gc()
[all...] |
| /kernel/linux/linux-6.6/kernel/bpf/ |
| H A D | log.c | 61 u32 new_n, n; in bpf_verifier_vlog() local
77 new_n = 0; in bpf_verifier_vlog()
79 new_n = min_t(u32, log->len_total - log->end_pos, n); in bpf_verifier_vlog()
80 log->kbuf[new_n - 1] = '\0'; in bpf_verifier_vlog()
86 if (log->ubuf && new_n && in bpf_verifier_vlog()
87 copy_to_user(log->ubuf + cur_pos, log->kbuf, new_n)) in bpf_verifier_vlog()
91 u32 buf_start, buf_end, new_n; in bpf_verifier_vlog() local
105 new_n = min(n, log->len_total); in bpf_verifier_vlog()
106 cur_pos = new_end - new_n; in bpf_verifier_vlog()
125 log->kbuf + n - new_n, in bpf_verifier_vlog()
[all...] |
| H A D | verifier.c | 1583 /* resize an array from old_n items to new_n items. the array is reallocated if it's too
1584 * small to hold new_n items. new items are zeroed out if the array grows.
1586 * Contrary to krealloc_array, does not free arr if new_n is zero.
1588 static void *realloc_array(void *arr, size_t old_n, size_t new_n, size_t size) in realloc_array() argument
1593 if (!new_n || old_n == new_n) in realloc_array()
1596 alloc_size = kmalloc_size_roundup(size_mul(new_n, size)); in realloc_array()
1604 if (new_n > old_n) in realloc_array()
1605 memset(arr + old_n * size, 0, (new_n - old_n) * size); in realloc_array()
|
| /kernel/linux/linux-6.6/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) in krealloc_array() argument
122 if (unlikely(check_mul_overflow(new_n, new_size, &bytes))) in krealloc_array()
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | slab.h | 642 * @new_n: new number of elements to alloc
647 size_t new_n, in krealloc_array()
653 if (unlikely(check_mul_overflow(new_n, new_size, &bytes))) in krealloc_array()
646 krealloc_array(void *p, size_t new_n, size_t new_size, gfp_t flags) krealloc_array() argument
|
| H A D | device.h | 332 devm_krealloc_array(struct device *dev, void *p, size_t new_n, size_t new_size, gfp_t flags) in devm_krealloc_array() argument
336 if (unlikely(check_mul_overflow(new_n, new_size, &bytes))) in devm_krealloc_array()
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdkfd/ |
| H A D | kfd_svm.c | 899 uint64_t new_start, uint64_t new_n) in svm_range_split_array()
911 new = svm_range_copy_array(pold, size, new_n, d); in svm_range_split_array()
914 d = (new_start == old_start) ? new_n * size : 0; in svm_range_split_array()
897 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) svm_range_split_array() argument
|