summaryrefslogtreecommitdiffstats
path: root/lib/find_bit_benchmark.c
diff options
context:
space:
mode:
authorGustavo A. R. Silva <gustavo@embeddedor.com>2019-04-12 01:43:06 +0200
committerDavid S. Miller <davem@davemloft.net>2019-04-13 02:31:33 +0200
commitc252aa3e8ed3ac54060b1838f6a47f29799a133d (patch)
treeb0843e0b11610b2dbf39821b677cf9f0a16c5493 /lib/find_bit_benchmark.c
parentMerge branch 'nfp-update-to-control-structures' (diff)
downloadlinux-c252aa3e8ed3ac54060b1838f6a47f29799a133d.tar.xz
linux-c252aa3e8ed3ac54060b1838f6a47f29799a133d.zip
rhashtable: use struct_size() in kvzalloc()
One of the more common cases of allocation size calculations is finding the size of a structure that has a zero-sized array at the end, along with memory for some number of elements for that array. For example: struct foo { int stuff; struct boo entry[]; }; size = sizeof(struct foo) + count * sizeof(struct boo); instance = kvzalloc(size, GFP_KERNEL); Instead of leaving these open-coded and prone to type mistakes, we can now use the new struct_size() helper: instance = kvzalloc(struct_size(instance, entry, count), GFP_KERNEL); This code was detected with the help of Coccinelle. Signed-off-by: Gustavo A. R. Silva <gustavo@embeddedor.com> Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'lib/find_bit_benchmark.c')
0 files changed, 0 insertions, 0 deletions