Searched refs:new_n (Results 1 - 5 of 5) sorted by relevance

/linux-master/lib/
H A Dassoc_array.c1459 struct assoc_array_node *node, *new_n; local
1507 new_n = kzalloc(sizeof(struct assoc_array_node), GFP_KERNEL);
1508 if (!new_n)
1510 pr_devel("dup node %p -> %p\n", node, new_n);
1511 new_n->back_pointer = new_parent;
1512 new_n->parent_slot = node->parent_slot;
1513 *new_ptr_pp = new_parent = assoc_array_node_to_ptr(new_n);
1530 new_n->slots[slot] = ptr;
1534 new_ptr_pp = &new_n->slots[slot];
1539 pr_devel("-- compress node %p --\n", new_n);
[all...]
/linux-master/tools/virtio/linux/
H A Dkernel.h121 static inline void *krealloc_array(void *p, size_t new_n, size_t new_size, gfp_t gfp) argument
125 if (unlikely(check_mul_overflow(new_n, new_size, &bytes)))
/linux-master/include/linux/
H A Dslab.h627 * @new_n: new number of elements to alloc
632 size_t new_n,
638 if (unlikely(check_mul_overflow(new_n, new_size, &bytes)))
631 krealloc_array(void *p, size_t new_n, size_t new_size, gfp_t flags) argument
/linux-master/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_svm.c828 uint64_t new_start, uint64_t new_n)
839 new = kvmalloc_array(new_n, size, GFP_KERNEL);
844 memcpy(new, pold + d, new_n * size);
852 d = (new_start == old_start) ? new_n * size : 0;
826 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) argument
/linux-master/kernel/bpf/
H A Dverifier.c856 /* resize an array from old_n items to new_n items. the array is reallocated if it's too
857 * small to hold new_n items. new items are zeroed out if the array grows.
859 * Contrary to krealloc_array, does not free arr if new_n is zero.
861 static void *realloc_array(void *arr, size_t old_n, size_t new_n, size_t size) argument
863 if (!new_n || old_n == new_n)
866 arr = krealloc_array(arr, new_n, size, GFP_KERNEL);
870 if (new_n > old_n)
871 memset(arr + old_n * size, 0, (new_n - old_n) * size);

Completed in 134 milliseconds