| .. | .. |
|---|
| 33 | 33 | case 'y': \ |
|---|
| 34 | 34 | case 'z': \ |
|---|
| 35 | 35 | u++; \ |
|---|
| 36 | | - /* fall through */ \ |
|---|
| 36 | + fallthrough; \ |
|---|
| 37 | 37 | case 'e': \ |
|---|
| 38 | 38 | u++; \ |
|---|
| 39 | | - /* fall through */ \ |
|---|
| 39 | + fallthrough; \ |
|---|
| 40 | 40 | case 'p': \ |
|---|
| 41 | 41 | u++; \ |
|---|
| 42 | | - /* fall through */ \ |
|---|
| 42 | + fallthrough; \ |
|---|
| 43 | 43 | case 't': \ |
|---|
| 44 | 44 | u++; \ |
|---|
| 45 | | - /* fall through */ \ |
|---|
| 45 | + fallthrough; \ |
|---|
| 46 | 46 | case 'g': \ |
|---|
| 47 | 47 | u++; \ |
|---|
| 48 | | - /* fall through */ \ |
|---|
| 48 | + fallthrough; \ |
|---|
| 49 | 49 | case 'm': \ |
|---|
| 50 | 50 | u++; \ |
|---|
| 51 | | - /* fall through */ \ |
|---|
| 51 | + fallthrough; \ |
|---|
| 52 | 52 | case 'k': \ |
|---|
| 53 | 53 | u++; \ |
|---|
| 54 | 54 | if (e++ == cp) \ |
|---|
| 55 | 55 | return -EINVAL; \ |
|---|
| 56 | | - /* fall through */ \ |
|---|
| 56 | + fallthrough; \ |
|---|
| 57 | 57 | case '\n': \ |
|---|
| 58 | 58 | case '\0': \ |
|---|
| 59 | 59 | if (*e == '\n') \ |
|---|
| .. | .. |
|---|
| 270 | 270 | int i; |
|---|
| 271 | 271 | struct bio_vec *bv; |
|---|
| 272 | 272 | |
|---|
| 273 | | - bio_for_each_segment_all(bv, bio, i) { |
|---|
| 273 | + /* |
|---|
| 274 | + * This is called on freshly new bio, so it is safe to access the |
|---|
| 275 | + * bvec table directly. |
|---|
| 276 | + */ |
|---|
| 277 | + for (i = 0, bv = bio->bi_io_vec; i < bio->bi_vcnt; bv++, i++) { |
|---|
| 274 | 278 | bv->bv_page = alloc_page(gfp_mask); |
|---|
| 275 | 279 | if (!bv->bv_page) { |
|---|
| 276 | 280 | while (--bv >= bio->bi_io_vec) |
|---|