| .. | .. |
|---|
| 126 | 126 | rdev->stats.qid.cur += rdev->qpmask + 1; |
|---|
| 127 | 127 | mutex_unlock(&rdev->stats.lock); |
|---|
| 128 | 128 | for (i = qid+1; i & rdev->qpmask; i++) { |
|---|
| 129 | | - entry = kmalloc(sizeof *entry, GFP_KERNEL); |
|---|
| 129 | + entry = kmalloc(sizeof(*entry), GFP_KERNEL); |
|---|
| 130 | 130 | if (!entry) |
|---|
| 131 | 131 | goto out; |
|---|
| 132 | 132 | entry->qid = i; |
|---|
| .. | .. |
|---|
| 137 | 137 | * now put the same ids on the qp list since they all |
|---|
| 138 | 138 | * map to the same db/gts page. |
|---|
| 139 | 139 | */ |
|---|
| 140 | | - entry = kmalloc(sizeof *entry, GFP_KERNEL); |
|---|
| 140 | + entry = kmalloc(sizeof(*entry), GFP_KERNEL); |
|---|
| 141 | 141 | if (!entry) |
|---|
| 142 | 142 | goto out; |
|---|
| 143 | 143 | entry->qid = qid; |
|---|
| 144 | 144 | list_add_tail(&entry->entry, &uctx->qpids); |
|---|
| 145 | 145 | for (i = qid+1; i & rdev->qpmask; i++) { |
|---|
| 146 | | - entry = kmalloc(sizeof *entry, GFP_KERNEL); |
|---|
| 146 | + entry = kmalloc(sizeof(*entry), GFP_KERNEL); |
|---|
| 147 | 147 | if (!entry) |
|---|
| 148 | 148 | goto out; |
|---|
| 149 | 149 | entry->qid = i; |
|---|
| .. | .. |
|---|
| 165 | 165 | { |
|---|
| 166 | 166 | struct c4iw_qid_list *entry; |
|---|
| 167 | 167 | |
|---|
| 168 | | - entry = kmalloc(sizeof *entry, GFP_KERNEL); |
|---|
| 168 | + entry = kmalloc(sizeof(*entry), GFP_KERNEL); |
|---|
| 169 | 169 | if (!entry) |
|---|
| 170 | 170 | return; |
|---|
| 171 | 171 | pr_debug("qid 0x%x\n", qid); |
|---|
| .. | .. |
|---|
| 200 | 200 | rdev->stats.qid.cur += rdev->qpmask + 1; |
|---|
| 201 | 201 | mutex_unlock(&rdev->stats.lock); |
|---|
| 202 | 202 | for (i = qid+1; i & rdev->qpmask; i++) { |
|---|
| 203 | | - entry = kmalloc(sizeof *entry, GFP_KERNEL); |
|---|
| 203 | + entry = kmalloc(sizeof(*entry), GFP_KERNEL); |
|---|
| 204 | 204 | if (!entry) |
|---|
| 205 | 205 | goto out; |
|---|
| 206 | 206 | entry->qid = i; |
|---|
| .. | .. |
|---|
| 211 | 211 | * now put the same ids on the cq list since they all |
|---|
| 212 | 212 | * map to the same db/gts page. |
|---|
| 213 | 213 | */ |
|---|
| 214 | | - entry = kmalloc(sizeof *entry, GFP_KERNEL); |
|---|
| 214 | + entry = kmalloc(sizeof(*entry), GFP_KERNEL); |
|---|
| 215 | 215 | if (!entry) |
|---|
| 216 | 216 | goto out; |
|---|
| 217 | 217 | entry->qid = qid; |
|---|
| 218 | 218 | list_add_tail(&entry->entry, &uctx->cqids); |
|---|
| 219 | | - for (i = qid; i & rdev->qpmask; i++) { |
|---|
| 220 | | - entry = kmalloc(sizeof *entry, GFP_KERNEL); |
|---|
| 219 | + for (i = qid + 1; i & rdev->qpmask; i++) { |
|---|
| 220 | + entry = kmalloc(sizeof(*entry), GFP_KERNEL); |
|---|
| 221 | 221 | if (!entry) |
|---|
| 222 | 222 | goto out; |
|---|
| 223 | 223 | entry->qid = i; |
|---|
| .. | .. |
|---|
| 239 | 239 | { |
|---|
| 240 | 240 | struct c4iw_qid_list *entry; |
|---|
| 241 | 241 | |
|---|
| 242 | | - entry = kmalloc(sizeof *entry, GFP_KERNEL); |
|---|
| 242 | + entry = kmalloc(sizeof(*entry), GFP_KERNEL); |
|---|
| 243 | 243 | if (!entry) |
|---|
| 244 | 244 | return; |
|---|
| 245 | 245 | pr_debug("qid 0x%x\n", qid); |
|---|