treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This patch replaces cases of: kmalloc(a * b, gfp) with: kmalloc_array(a * b, gfp) as well as handling cases of: kmalloc(a * b * c, gfp) with: kmalloc(array3_size(a, b, c), gfp) as it's slightly less ugly than: kmalloc_array(array_size(a, b), c, gfp) This does, however, attempt to ignore constant size factors like: kmalloc(4 * 1024, gfp) though any constants defined via macros get caught up in the conversion. Any factors with a sizeof() of "unsigned char", "char", and "u8" were dropped, since they're redundant. The tools/ directory was manually excluded, since it has its own implementation of kmalloc(). The Coccinelle script used for this was: // Fix redundant parens around sizeof(). @@ type TYPE; expression THING, E; @@ ( kmalloc( - (sizeof(TYPE)) * E + sizeof(TYPE) * E , ...) | kmalloc( - (sizeof(THING)) * E + sizeof(THING) * E , ...) ) // Drop single-byte sizes and redundant parens. @@ expression COUNT; typedef u8; typedef __u8; @@ ( kmalloc( - sizeof(u8) * (COUNT) + COUNT , ...) | kmalloc( - sizeof(__u8) * (COUNT) + COUNT , ...) | kmalloc( - sizeof(char) * (COUNT) + COUNT , ...) | kmalloc( - sizeof(unsigned char) * (COUNT) + COUNT , ...) | kmalloc( - sizeof(u8) * COUNT + COUNT , ...) | kmalloc( - sizeof(__u8) * COUNT + COUNT , ...) | kmalloc( - sizeof(char) * COUNT + COUNT , ...) | kmalloc( - sizeof(unsigned char) * COUNT + COUNT , ...) ) // 2-factor product with sizeof(type/expression) and identifier or constant. @@ type TYPE; expression THING; identifier COUNT_ID; constant COUNT_CONST; @@ ( - kmalloc + kmalloc_array ( - sizeof(TYPE) * (COUNT_ID) + COUNT_ID, sizeof(TYPE) , ...) | - kmalloc + kmalloc_array ( - sizeof(TYPE) * COUNT_ID + COUNT_ID, sizeof(TYPE) , ...) | - kmalloc + kmalloc_array ( - sizeof(TYPE) * (COUNT_CONST) + COUNT_CONST, sizeof(TYPE) , ...) | - kmalloc + kmalloc_array ( - sizeof(TYPE) * COUNT_CONST + COUNT_CONST, sizeof(TYPE) , ...) | - kmalloc + kmalloc_array ( - sizeof(THING) * (COUNT_ID) + COUNT_ID, sizeof(THING) , ...) | - kmalloc + kmalloc_array ( - sizeof(THING) * COUNT_ID + COUNT_ID, sizeof(THING) , ...) | - kmalloc + kmalloc_array ( - sizeof(THING) * (COUNT_CONST) + COUNT_CONST, sizeof(THING) , ...) | - kmalloc + kmalloc_array ( - sizeof(THING) * COUNT_CONST + COUNT_CONST, sizeof(THING) , ...) ) // 2-factor product, only identifiers. @@ identifier SIZE, COUNT; @@ - kmalloc + kmalloc_array ( - SIZE * COUNT + COUNT, SIZE , ...) // 3-factor product with 1 sizeof(type) or sizeof(expression), with // redundant parens removed. @@ expression THING; identifier STRIDE, COUNT; type TYPE; @@ ( kmalloc( - sizeof(TYPE) * (COUNT) * (STRIDE) + array3_size(COUNT, STRIDE, sizeof(TYPE)) , ...) | kmalloc( - sizeof(TYPE) * (COUNT) * STRIDE + array3_size(COUNT, STRIDE, sizeof(TYPE)) , ...) | kmalloc( - sizeof(TYPE) * COUNT * (STRIDE) + array3_size(COUNT, STRIDE, sizeof(TYPE)) , ...) | kmalloc( - sizeof(TYPE) * COUNT * STRIDE + array3_size(COUNT, STRIDE, sizeof(TYPE)) , ...) | kmalloc( - sizeof(THING) * (COUNT) * (STRIDE) + array3_size(COUNT, STRIDE, sizeof(THING)) , ...) | kmalloc( - sizeof(THING) * (COUNT) * STRIDE + array3_size(COUNT, STRIDE, sizeof(THING)) , ...) | kmalloc( - sizeof(THING) * COUNT * (STRIDE) + array3_size(COUNT, STRIDE, sizeof(THING)) , ...) | kmalloc( - sizeof(THING) * COUNT * STRIDE + array3_size(COUNT, STRIDE, sizeof(THING)) , ...) ) // 3-factor product with 2 sizeof(variable), with redundant parens removed. @@ expression THING1, THING2; identifier COUNT; type TYPE1, TYPE2; @@ ( kmalloc( - sizeof(TYPE1) * sizeof(TYPE2) * COUNT + array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2)) , ...) | kmalloc( - sizeof(TYPE1) * sizeof(THING2) * (COUNT) + array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2)) , ...) | kmalloc( - sizeof(THING1) * sizeof(THING2) * COUNT + array3_size(COUNT, sizeof(THING1), sizeof(THING2)) , ...) | kmalloc( - sizeof(THING1) * sizeof(THING2) * (COUNT) + array3_size(COUNT, sizeof(THING1), sizeof(THING2)) , ...) | kmalloc( - sizeof(TYPE1) * sizeof(THING2) * COUNT + array3_size(COUNT, sizeof(TYPE1), sizeof(THING2)) , ...) | kmalloc( - sizeof(TYPE1) * sizeof(THING2) * (COUNT) + array3_size(COUNT, sizeof(TYPE1), sizeof(THING2)) , ...) ) // 3-factor product, only identifiers, with redundant parens removed. @@ identifier STRIDE, SIZE, COUNT; @@ ( kmalloc( - (COUNT) * STRIDE * SIZE + array3_size(COUNT, STRIDE, SIZE) , ...) | kmalloc( - COUNT * (STRIDE) * SIZE + array3_size(COUNT, STRIDE, SIZE) , ...) | kmalloc( - COUNT * STRIDE * (SIZE) + array3_size(COUNT, STRIDE, SIZE) , ...) | kmalloc( - (COUNT) * (STRIDE) * SIZE + array3_size(COUNT, STRIDE, SIZE) , ...) | kmalloc( - COUNT * (STRIDE) * (SIZE) + array3_size(COUNT, STRIDE, SIZE) , ...) | kmalloc( - (COUNT) * STRIDE * (SIZE) + array3_size(COUNT, STRIDE, SIZE) , ...) | kmalloc( - (COUNT) * (STRIDE) * (SIZE) + array3_size(COUNT, STRIDE, SIZE) , ...) | kmalloc( - COUNT * STRIDE * SIZE + array3_size(COUNT, STRIDE, SIZE) , ...) ) // Any remaining multi-factor products, first at least 3-factor products, // when they're not all constants... @@ expression E1, E2, E3; constant C1, C2, C3; @@ ( kmalloc(C1 * C2 * C3, ...) | kmalloc( - (E1) * E2 * E3 + array3_size(E1, E2, E3) , ...) | kmalloc( - (E1) * (E2) * E3 + array3_size(E1, E2, E3) , ...) | kmalloc( - (E1) * (E2) * (E3) + array3_size(E1, E2, E3) , ...) | kmalloc( - E1 * E2 * E3 + array3_size(E1, E2, E3) , ...) ) // And then all remaining 2 factors products when they're not all constants, // keeping sizeof() as the second factor argument. @@ expression THING, E1, E2; type TYPE; constant C1, C2, C3; @@ ( kmalloc(sizeof(THING) * C2, ...) | kmalloc(sizeof(TYPE) * C2, ...) | kmalloc(C1 * C2 * C3, ...) | kmalloc(C1 * C2, ...) | - kmalloc + kmalloc_array ( - sizeof(TYPE) * (E2) + E2, sizeof(TYPE) , ...) | - kmalloc + kmalloc_array ( - sizeof(TYPE) * E2 + E2, sizeof(TYPE) , ...) | - kmalloc + kmalloc_array ( - sizeof(THING) * (E2) + E2, sizeof(THING) , ...) | - kmalloc + kmalloc_array ( - sizeof(THING) * E2 + E2, sizeof(THING) , ...) | - kmalloc + kmalloc_array ( - (E1) * E2 + E1, E2 , ...) | - kmalloc + kmalloc_array ( - (E1) * (E2) + E1, E2 , ...) | - kmalloc + kmalloc_array ( - E1 * E2 + E1, E2 , ...) ) Signed-off-by: Kees Cook <keescook@chromium.org>
This commit is contained in:
@@ -897,7 +897,7 @@ static int parse_usbdevfs_streams(struct usb_dev_state *ps,
|
||||
if (num_streams_ret && (num_streams < 2 || num_streams > 65536))
|
||||
return -EINVAL;
|
||||
|
||||
eps = kmalloc(num_eps * sizeof(*eps), GFP_KERNEL);
|
||||
eps = kmalloc_array(num_eps, sizeof(*eps), GFP_KERNEL);
|
||||
if (!eps)
|
||||
return -ENOMEM;
|
||||
|
||||
@@ -1602,8 +1602,9 @@ static int proc_do_submiturb(struct usb_dev_state *ps, struct usbdevfs_urb *uurb
|
||||
as->mem_usage = u;
|
||||
|
||||
if (num_sgs) {
|
||||
as->urb->sg = kmalloc(num_sgs * sizeof(struct scatterlist),
|
||||
GFP_KERNEL);
|
||||
as->urb->sg = kmalloc_array(num_sgs,
|
||||
sizeof(struct scatterlist),
|
||||
GFP_KERNEL);
|
||||
if (!as->urb->sg) {
|
||||
ret = -ENOMEM;
|
||||
goto error;
|
||||
|
@@ -390,7 +390,7 @@ int usb_sg_init(struct usb_sg_request *io, struct usb_device *dev,
|
||||
}
|
||||
|
||||
/* initialize all the urbs we'll use */
|
||||
io->urbs = kmalloc(io->entries * sizeof(*io->urbs), mem_flags);
|
||||
io->urbs = kmalloc_array(io->entries, sizeof(*io->urbs), mem_flags);
|
||||
if (!io->urbs)
|
||||
goto nomem;
|
||||
|
||||
@@ -1824,8 +1824,8 @@ int usb_set_configuration(struct usb_device *dev, int configuration)
|
||||
n = nintf = 0;
|
||||
if (cp) {
|
||||
nintf = cp->desc.bNumInterfaces;
|
||||
new_interfaces = kmalloc(nintf * sizeof(*new_interfaces),
|
||||
GFP_NOIO);
|
||||
new_interfaces = kmalloc_array(nintf, sizeof(*new_interfaces),
|
||||
GFP_NOIO);
|
||||
if (!new_interfaces)
|
||||
return -ENOMEM;
|
||||
|
||||
|
@@ -189,7 +189,7 @@ u32 fhci_create_ep(struct fhci_usb *usb, enum fhci_mem_alloc data_mem,
|
||||
goto err;
|
||||
}
|
||||
|
||||
buff = kmalloc(1028 * sizeof(*buff), GFP_KERNEL);
|
||||
buff = kmalloc_array(1028, sizeof(*buff), GFP_KERNEL);
|
||||
if (!buff) {
|
||||
kfree(pkt);
|
||||
err_for = "buffer";
|
||||
|
@@ -492,7 +492,7 @@ static ssize_t fill_periodic_buffer(struct debug_buffer *buf)
|
||||
char *next;
|
||||
unsigned i;
|
||||
|
||||
seen = kmalloc(DBG_SCHED_LIMIT * sizeof *seen, GFP_ATOMIC);
|
||||
seen = kmalloc_array(DBG_SCHED_LIMIT, sizeof(*seen), GFP_ATOMIC);
|
||||
if (!seen)
|
||||
return 0;
|
||||
seen_count = 0;
|
||||
|
@@ -695,7 +695,10 @@ static int ld_usb_probe(struct usb_interface *intf, const struct usb_device_id *
|
||||
dev_warn(&intf->dev, "Interrupt out endpoint not found (using control endpoint instead)\n");
|
||||
|
||||
dev->interrupt_in_endpoint_size = usb_endpoint_maxp(dev->interrupt_in_endpoint);
|
||||
dev->ring_buffer = kmalloc(ring_buffer_size*(sizeof(size_t)+dev->interrupt_in_endpoint_size), GFP_KERNEL);
|
||||
dev->ring_buffer =
|
||||
kmalloc_array(ring_buffer_size,
|
||||
sizeof(size_t) + dev->interrupt_in_endpoint_size,
|
||||
GFP_KERNEL);
|
||||
if (!dev->ring_buffer)
|
||||
goto error;
|
||||
dev->interrupt_in_buffer = kmalloc(dev->interrupt_in_endpoint_size, GFP_KERNEL);
|
||||
@@ -706,7 +709,9 @@ static int ld_usb_probe(struct usb_interface *intf, const struct usb_device_id *
|
||||
goto error;
|
||||
dev->interrupt_out_endpoint_size = dev->interrupt_out_endpoint ? usb_endpoint_maxp(dev->interrupt_out_endpoint) :
|
||||
udev->descriptor.bMaxPacketSize0;
|
||||
dev->interrupt_out_buffer = kmalloc(write_buffer_size*dev->interrupt_out_endpoint_size, GFP_KERNEL);
|
||||
dev->interrupt_out_buffer =
|
||||
kmalloc_array(write_buffer_size,
|
||||
dev->interrupt_out_endpoint_size, GFP_KERNEL);
|
||||
if (!dev->interrupt_out_buffer)
|
||||
goto error;
|
||||
dev->interrupt_out_urb = usb_alloc_urb(0, GFP_KERNEL);
|
||||
|
@@ -736,7 +736,7 @@ static int iuu_uart_on(struct usb_serial_port *port)
|
||||
int status;
|
||||
u8 *buf;
|
||||
|
||||
buf = kmalloc(sizeof(u8) * 4, GFP_KERNEL);
|
||||
buf = kmalloc(4, GFP_KERNEL);
|
||||
|
||||
if (!buf)
|
||||
return -ENOMEM;
|
||||
@@ -790,7 +790,7 @@ static int iuu_uart_baud(struct usb_serial_port *port, u32 baud_base,
|
||||
unsigned int T1FrekvensHZ = 0;
|
||||
|
||||
dev_dbg(&port->dev, "%s - enter baud_base=%d\n", __func__, baud_base);
|
||||
dataout = kmalloc(sizeof(u8) * 5, GFP_KERNEL);
|
||||
dataout = kmalloc(5, GFP_KERNEL);
|
||||
|
||||
if (!dataout)
|
||||
return -ENOMEM;
|
||||
|
@@ -1025,7 +1025,7 @@ static int alauda_write_data(struct us_data *us, unsigned long address,
|
||||
* We also need a temporary block buffer, where we read in the old data,
|
||||
* overwrite parts with the new data, and manipulate the redundancy data
|
||||
*/
|
||||
blockbuffer = kmalloc((pagesize + 64) * blocksize, GFP_NOIO);
|
||||
blockbuffer = kmalloc_array(pagesize + 64, blocksize, GFP_NOIO);
|
||||
if (!blockbuffer) {
|
||||
kfree(buffer);
|
||||
return USB_STOR_TRANSPORT_ERROR;
|
||||
|
@@ -807,8 +807,12 @@ static int ms_lib_alloc_logicalmap(struct us_data *us)
|
||||
u32 i;
|
||||
struct ene_ub6250_info *info = (struct ene_ub6250_info *) us->extra;
|
||||
|
||||
info->MS_Lib.Phy2LogMap = kmalloc(info->MS_Lib.NumberOfPhyBlock * sizeof(u16), GFP_KERNEL);
|
||||
info->MS_Lib.Log2PhyMap = kmalloc(info->MS_Lib.NumberOfLogBlock * sizeof(u16), GFP_KERNEL);
|
||||
info->MS_Lib.Phy2LogMap = kmalloc_array(info->MS_Lib.NumberOfPhyBlock,
|
||||
sizeof(u16),
|
||||
GFP_KERNEL);
|
||||
info->MS_Lib.Log2PhyMap = kmalloc_array(info->MS_Lib.NumberOfLogBlock,
|
||||
sizeof(u16),
|
||||
GFP_KERNEL);
|
||||
|
||||
if ((info->MS_Lib.Phy2LogMap == NULL) || (info->MS_Lib.Log2PhyMap == NULL)) {
|
||||
ms_lib_free_logicalmap(us);
|
||||
@@ -1113,8 +1117,12 @@ static int ms_lib_alloc_writebuf(struct us_data *us)
|
||||
|
||||
info->MS_Lib.wrtblk = (u16)-1;
|
||||
|
||||
info->MS_Lib.blkpag = kmalloc(info->MS_Lib.PagesPerBlock * info->MS_Lib.BytesPerSector, GFP_KERNEL);
|
||||
info->MS_Lib.blkext = kmalloc(info->MS_Lib.PagesPerBlock * sizeof(struct ms_lib_type_extdat), GFP_KERNEL);
|
||||
info->MS_Lib.blkpag = kmalloc_array(info->MS_Lib.PagesPerBlock,
|
||||
info->MS_Lib.BytesPerSector,
|
||||
GFP_KERNEL);
|
||||
info->MS_Lib.blkext = kmalloc_array(info->MS_Lib.PagesPerBlock,
|
||||
sizeof(struct ms_lib_type_extdat),
|
||||
GFP_KERNEL);
|
||||
|
||||
if ((info->MS_Lib.blkpag == NULL) || (info->MS_Lib.blkext == NULL)) {
|
||||
ms_lib_free_writebuf(us);
|
||||
|
@@ -1231,8 +1231,8 @@ sddr09_read_map(struct us_data *us) {
|
||||
|
||||
kfree(info->lba_to_pba);
|
||||
kfree(info->pba_to_lba);
|
||||
info->lba_to_pba = kmalloc(numblocks*sizeof(int), GFP_NOIO);
|
||||
info->pba_to_lba = kmalloc(numblocks*sizeof(int), GFP_NOIO);
|
||||
info->lba_to_pba = kmalloc_array(numblocks, sizeof(int), GFP_NOIO);
|
||||
info->pba_to_lba = kmalloc_array(numblocks, sizeof(int), GFP_NOIO);
|
||||
|
||||
if (info->lba_to_pba == NULL || info->pba_to_lba == NULL) {
|
||||
printk(KERN_WARNING "sddr09_read_map: out of memory\n");
|
||||
|
@@ -651,7 +651,7 @@ static int sddr55_read_map(struct us_data *us) {
|
||||
|
||||
numblocks = info->capacity >> (info->blockshift + info->pageshift);
|
||||
|
||||
buffer = kmalloc( numblocks * 2, GFP_NOIO );
|
||||
buffer = kmalloc_array(numblocks, 2, GFP_NOIO );
|
||||
|
||||
if (!buffer)
|
||||
return -1;
|
||||
@@ -684,8 +684,8 @@ static int sddr55_read_map(struct us_data *us) {
|
||||
|
||||
kfree(info->lba_to_pba);
|
||||
kfree(info->pba_to_lba);
|
||||
info->lba_to_pba = kmalloc(numblocks*sizeof(int), GFP_NOIO);
|
||||
info->pba_to_lba = kmalloc(numblocks*sizeof(int), GFP_NOIO);
|
||||
info->lba_to_pba = kmalloc_array(numblocks, sizeof(int), GFP_NOIO);
|
||||
info->pba_to_lba = kmalloc_array(numblocks, sizeof(int), GFP_NOIO);
|
||||
|
||||
if (info->lba_to_pba == NULL || info->pba_to_lba == NULL) {
|
||||
kfree(info->lba_to_pba);
|
||||
|
Reference in New Issue
Block a user