ref: 2e916a41db4a82fa7f90ae1805dc7b0dc8c43d3a
parent: f5c6e64d0cac5529490919e737f0858f8a42fc16
author: Sigrid Solveig Haflínudóttir <[email protected]>
date: Fri Mar 10 12:39:12 EST 2023
lookup3: // fallthrough
--- a/llt/lookup3.c
+++ b/llt/lookup3.c
@@ -193,9 +193,9 @@
/*------------------------------------------- handle the last 3 uint32_t's */
switch(length) /* all the case statements fall through */
{ - case 3 : c+=k[2];
- case 2 : b+=k[1];
- case 1 : a+=k[0];
+ case 3 : c+=k[2]; // fallthrough
+ case 2 : b+=k[1]; // fallthrough
+ case 1 : a+=k[0]; // fallthrough
final(a,b,c);
case 0: /* case 0: nothing left to add */
break;
@@ -238,9 +238,9 @@
/*------------------------------------------- handle the last 3 uint32_t's */
switch(length) /* all the case statements fall through */
{ - case 3 : c+=k[2];
- case 2 : b+=k[1];
- case 1 : a+=k[0];
+ case 3 : c+=k[2]; // fallthrough
+ case 2 : b+=k[1]; // fallthrough
+ case 1 : a+=k[0]; // fallthrough
final(a,b,c);
case 0: /* case 0: nothing left to add */
break;
@@ -610,17 +610,17 @@
/*-------------------------------- last block: affect all 32 bits of (c) */
switch(length) /* all the case statements fall through */
{- case 12: c+=((uint32_t)k[11])<<24;
- case 11: c+=((uint32_t)k[10])<<16;
- case 10: c+=((uint32_t)k[9])<<8;
- case 9 : c+=k[8];
- case 8 : b+=((uint32_t)k[7])<<24;
- case 7 : b+=((uint32_t)k[6])<<16;
- case 6 : b+=((uint32_t)k[5])<<8;
- case 5 : b+=k[4];
- case 4 : a+=((uint32_t)k[3])<<24;
- case 3 : a+=((uint32_t)k[2])<<16;
- case 2 : a+=((uint32_t)k[1])<<8;
+ case 12: c+=((uint32_t)k[11])<<24; // fallthrough
+ case 11: c+=((uint32_t)k[10])<<16; // fallthrough
+ case 10: c+=((uint32_t)k[9])<<8; // fallthrough
+ case 9 : c+=k[8]; // fallthrough
+ case 8 : b+=((uint32_t)k[7])<<24; // fallthrough
+ case 7 : b+=((uint32_t)k[6])<<16; // fallthrough
+ case 6 : b+=((uint32_t)k[5])<<8; // fallthrough
+ case 5 : b+=k[4]; // fallthrough
+ case 4 : a+=((uint32_t)k[3])<<24; // fallthrough
+ case 3 : a+=((uint32_t)k[2])<<16; // fallthrough
+ case 2 : a+=((uint32_t)k[1])<<8; // fallthrough
case 1 : a+=k[0];
break;
case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */