kernel/linux.git/lib/test_parman.c, branch v7.0-rc7Linux kernel stable tree (mirror)https://git.radix-linux.su/kernel/linux.git/atom?h=v7.0-rc72026-02-22T01:09:51+00:00Convert 'alloc_obj' family to use the new default GFP_KERNEL argument2026-02-22T01:09:51+00:00Linus Torvaldstorvalds@linux-foundation.org2026-02-22T00:37:42+00:00urn:sha1:bf4afc53b77aeaa48b5409da5c8da6bb4eff7f43
This was done entirely with mindless brute force, using
git grep -l '\<k[vmz]*alloc_objs*(.*, GFP_KERNEL)' |
xargs sed -i 's/\(alloc_objs*(.*\), GFP_KERNEL)/\1)/'
to convert the new alloc_obj() users that had a simple GFP_KERNEL
argument to just drop that argument.
Note that due to the extreme simplicity of the scripting, any slightly
more complex cases spread over multiple lines would not be triggered:
they definitely exist, but this covers the vast bulk of the cases, and
the resulting diff is also then easier to check automatically.
For the same reason the 'flex' versions will be done as a separate
conversion.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
treewide: Replace kmalloc with kmalloc_obj for non-scalar types2026-02-21T09:02:28+00:00Kees Cookkees@kernel.org2026-02-21T07:49:23+00:00urn:sha1:69050f8d6d075dc01af7a5f2f550a8067510366f
This is the result of running the Coccinelle script from
scripts/coccinelle/api/kmalloc_objs.cocci. The script is designed to
avoid scalar types (which need careful case-by-case checking), and
instead replace kmalloc-family calls that allocate struct or union
object instances:
Single allocations: kmalloc(sizeof(TYPE), ...)
are replaced with: kmalloc_obj(TYPE, ...)
Array allocations: kmalloc_array(COUNT, sizeof(TYPE), ...)
are replaced with: kmalloc_objs(TYPE, COUNT, ...)
Flex array allocations: kmalloc(struct_size(PTR, FAM, COUNT), ...)
are replaced with: kmalloc_flex(*PTR, FAM, COUNT, ...)
(where TYPE may also be *VAR)
The resulting allocations no longer return "void *", instead returning
"TYPE *".
Signed-off-by: Kees Cook <kees@kernel.org>
lib/test_parman: Include <linux/prandom.h> instead of <linux/random.h>2024-10-03T16:20:27+00:00Uros Bizjakubizjak@gmail.com2024-09-30T12:33:26+00:00urn:sha1:1da74f9050a14b6e7f22e6f4d60bf62e517970cd
Substitute the inclusion of <linux/random.h> header with
<linux/prandom.h> to allow the removal of legacy inclusion
of <linux/prandom.h> from <linux/random.h>.
Signed-off-by: Uros Bizjak <ubizjak@gmail.com>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Jiri Pirko <jiri@resnulli.us>
Signed-off-by: Jason A. Donenfeld <Jason@zx2c4.com>
lib: fix spelling mistake: "actualy" -> "actually"2017-02-26T16:03:38+00:00Colin Ian Kingcolin.king@canonical.com2017-02-26T12:10:12+00:00urn:sha1:8118b7b76c8c087055054884a39db6a7d138e1c5
trivial fix to spelling mistake in pr_err message
Signed-off-by: Colin Ian King <colin.king@canonical.com>
Acked-by: Jiri Pirko <jiri@mellanox.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
lib: Introduce priority array area manager2017-02-03T21:35:42+00:00Jiri Pirkojiri@mellanox.com2017-02-03T09:29:06+00:00urn:sha1:44091d29f2075972aede47ef17e1e70db3d51190
This introduces a infrastructure for management of linear priority
areas. Priority order in an array matters, however order of items inside
a priority group does not matter.
As an initial implementation, L-sort algorithm is used. It is quite
trivial. More advanced algorithm called P-sort will be introduced as a
follow-up. The infrastructure is prepared for other algos.
Alongside this, a testing module is introduced as well.
Signed-off-by: Jiri Pirko <jiri@mellanox.com>
Signed-off-by: David S. Miller <davem@davemloft.net>