Lines Matching refs:bytes
369 * Page size is normally 2^12 bytes and, in this case, if we want to use
463 * 1 = 65 .. 96 bytes
464 * 2 = 129 .. 192 bytes
567 * @size: how many bytes of memory are required.
574 * bytes. For @size of power of two bytes, the alignment is also guaranteed
659 size_t bytes;
661 if (unlikely(check_mul_overflow(n, size, &bytes)))
664 return kmalloc(bytes, flags);
665 return __kmalloc(bytes, flags);
680 size_t bytes;
682 if (unlikely(check_mul_overflow(new_n, new_size, &bytes)))
685 return krealloc(p, bytes, flags);
720 size_t bytes;
722 if (unlikely(check_mul_overflow(n, size, &bytes)))
725 return kmalloc_node(bytes, flags, node);
726 return __kmalloc_node(bytes, flags, node);
744 * @size: how many bytes of memory are required.
754 * @size: how many bytes of memory are required.
779 size_t bytes;
781 if (unlikely(check_mul_overflow(n, size, &bytes)))
784 return kvmalloc(bytes, flags);
804 * @size: Number of bytes to round up from.
806 * This returns the number of bytes that would be available in a kmalloc()
807 * allocation of @size bytes. For example, a 126 byte request would be
808 * rounded up to the next sized kmalloc bucket, 128 bytes. (This is strictly