| .. | .. |
|---|
| 4 | 4 | |
|---|
| 5 | 5 | /* |
|---|
| 6 | 6 | * Robert Jenkin's hash function. |
|---|
| 7 | | - * http://burtleburtle.net/bob/hash/evahash.html |
|---|
| 7 | + * https://burtleburtle.net/bob/hash/evahash.html |
|---|
| 8 | 8 | * This is in the public domain. |
|---|
| 9 | 9 | */ |
|---|
| 10 | 10 | #define mix(a, b, c) \ |
|---|
| .. | .. |
|---|
| 50 | 50 | switch (len) { |
|---|
| 51 | 51 | case 11: |
|---|
| 52 | 52 | c = c + ((__u32)k[10] << 24); |
|---|
| 53 | | - /* fall through */ |
|---|
| 53 | + fallthrough; |
|---|
| 54 | 54 | case 10: |
|---|
| 55 | 55 | c = c + ((__u32)k[9] << 16); |
|---|
| 56 | | - /* fall through */ |
|---|
| 56 | + fallthrough; |
|---|
| 57 | 57 | case 9: |
|---|
| 58 | 58 | c = c + ((__u32)k[8] << 8); |
|---|
| 59 | 59 | /* the first byte of c is reserved for the length */ |
|---|
| 60 | | - /* fall through */ |
|---|
| 60 | + fallthrough; |
|---|
| 61 | 61 | case 8: |
|---|
| 62 | 62 | b = b + ((__u32)k[7] << 24); |
|---|
| 63 | | - /* fall through */ |
|---|
| 63 | + fallthrough; |
|---|
| 64 | 64 | case 7: |
|---|
| 65 | 65 | b = b + ((__u32)k[6] << 16); |
|---|
| 66 | | - /* fall through */ |
|---|
| 66 | + fallthrough; |
|---|
| 67 | 67 | case 6: |
|---|
| 68 | 68 | b = b + ((__u32)k[5] << 8); |
|---|
| 69 | | - /* fall through */ |
|---|
| 69 | + fallthrough; |
|---|
| 70 | 70 | case 5: |
|---|
| 71 | 71 | b = b + k[4]; |
|---|
| 72 | | - /* fall through */ |
|---|
| 72 | + fallthrough; |
|---|
| 73 | 73 | case 4: |
|---|
| 74 | 74 | a = a + ((__u32)k[3] << 24); |
|---|
| 75 | | - /* fall through */ |
|---|
| 75 | + fallthrough; |
|---|
| 76 | 76 | case 3: |
|---|
| 77 | 77 | a = a + ((__u32)k[2] << 16); |
|---|
| 78 | | - /* fall through */ |
|---|
| 78 | + fallthrough; |
|---|
| 79 | 79 | case 2: |
|---|
| 80 | 80 | a = a + ((__u32)k[1] << 8); |
|---|
| 81 | | - /* fall through */ |
|---|
| 81 | + fallthrough; |
|---|
| 82 | 82 | case 1: |
|---|
| 83 | 83 | a = a + k[0]; |
|---|
| 84 | 84 | /* case 0: nothing left to add */ |
|---|