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 = kmalloc(size, GFP_KERNEL); Instead of leaving these open-coded and prone to type mistakes, we can now use the new struct_size() helper: instance = kmalloc(struct_size(instance, entry, count), GFP_KERNEL); Also, notice that variable size is unnecessary, hence it is removed. This code was detected with the help of Coccinelle.
Unified · Split
| @@ -961,7 +961,7 @@ static int do_sys_poll(struct pollfd __user *ufds, unsigned int nfds, · 960 unmodified lines | ||
| 961 | 961 | struct timespec64 *end_time) |
| 962 | 962 | { |
| 963 | 963 | struct poll_wqueues table; |
| 964 | − int err = -EFAULT, fdcount, len, size; | |
| 964 | + int err = -EFAULT, fdcount, len; | |
| 965 | 965 | /* Allocate small arguments on the stack to save memory and be |
| 966 | 966 | faster - use long to make sure the buffer is aligned properly |
| 967 | 967 | on 64 bit archs to avoid unaligned access */ |
| @@ -989,8 +989,8 @@ static int do_sys_poll(struct pollfd __user *ufds, unsigned int nfds, · 21 unmodified lines | ||
| 989 | 989 | break; |
| 990 | 990 | |
| 991 | 991 | len = min(todo, POLLFD_PER_PAGE); |
| 992 | − size = sizeof(struct poll_list) + sizeof(struct pollfd) * len; | |
| 993 | − walk = walk->next = kmalloc(size, GFP_KERNEL); | |
| 992 | + walk = walk->next = kmalloc(struct_size(walk, entries, len), | |
| 993 | + GFP_KERNEL); | |
| 994 | 994 | if (!walk) { |
| 995 | 995 | err = -ENOMEM; |
| 996 | 996 | goto out_fds; |