67 If four pairs of (a,b,c) inputs are run through mix(), or through
238     case 11: c+=((uint32_t)k8[10])<<16;  /* fall through */  in hashlittle()
239     case 10: c+=((uint32_t)k8[9])<<8;    /* fall through */  in hashlittle()
240     case 9 : c+=k8[8];                   /* fall through */  in hashlittle()
242     case 7 : b+=((uint32_t)k8[6])<<16;   /* fall through */  in hashlittle()
243     case 6 : b+=((uint32_t)k8[5])<<8;    /* fall through */  in hashlittle()
244     case 5 : b+=k8[4];                   /* fall through */  in hashlittle()
246     case 3 : a+=((uint32_t)k8[2])<<16;   /* fall through */  in hashlittle()
247     case 2 : a+=((uint32_t)k8[1])<<8;    /* fall through */  in hashlittle()
277     case 11: c+=((uint32_t)k8[10])<<16;     /* fall through */  in hashlittle()
282     case 9 : c+=k8[8];                      /* fall through */  in hashlittle()
286     case 7 : b+=((uint32_t)k8[6])<<16;      /* fall through */  in hashlittle()
290     case 5 : b+=k8[4];                      /* fall through */  in hashlittle()
293     case 3 : a+=((uint32_t)k8[2])<<16;      /* fall through */  in hashlittle()
325     switch(length)                   /* all the case statements fall through */  in hashlittle()
327     case 12: c+=((uint32_t)k[11])<<24;  /* fall through */  in hashlittle()
328     case 11: c+=((uint32_t)k[10])<<16;  /* fall through */  in hashlittle()
329     case 10: c+=((uint32_t)k[9])<<8;    /* fall through */  in hashlittle()
330     case 9 : c+=k[8];                   /* fall through */  in hashlittle()
331     case 8 : b+=((uint32_t)k[7])<<24;   /* fall through */  in hashlittle()
332     case 7 : b+=((uint32_t)k[6])<<16;   /* fall through */  in hashlittle()
333     case 6 : b+=((uint32_t)k[5])<<8;    /* fall through */  in hashlittle()
334     case 5 : b+=k[4];                   /* fall through */  in hashlittle()
335     case 4 : a+=((uint32_t)k[3])<<24;   /* fall through */  in hashlittle()
336     case 3 : a+=((uint32_t)k[2])<<16;   /* fall through */  in hashlittle()
337     case 2 : a+=((uint32_t)k[1])<<8;    /* fall through */  in hashlittle()
412     switch(length)                   /* all the case statements fall through */  in hashbig()
415     case 11: c+=((uint32_t)k8[10])<<8;  /* fall through */  in hashbig()
416     case 10: c+=((uint32_t)k8[9])<<16;  /* fall through */  in hashbig()
417     case 9 : c+=((uint32_t)k8[8])<<24;  /* fall through */  in hashbig()
419     case 7 : b+=((uint32_t)k8[6])<<8;   /* fall through */  in hashbig()
420     case 6 : b+=((uint32_t)k8[5])<<16;  /* fall through */  in hashbig()
421     case 5 : b+=((uint32_t)k8[4])<<24;  /* fall through */  in hashbig()
423     case 3 : a+=((uint32_t)k8[2])<<8;   /* fall through */  in hashbig()
424     case 2 : a+=((uint32_t)k8[1])<<16;  /* fall through */  in hashbig()
455     switch(length)                   /* all the case statements fall through */  in hashbig()
457     case 12: c+=k[11];                  /* fall through */  in hashbig()
458     case 11: c+=((uint32_t)k[10])<<8;   /* fall through */  in hashbig()
459     case 10: c+=((uint32_t)k[9])<<16;   /* fall through */  in hashbig()
460     case 9 : c+=((uint32_t)k[8])<<24;   /* fall through */  in hashbig()
461     case 8 : b+=k[7];                   /* fall through */  in hashbig()
462     case 7 : b+=((uint32_t)k[6])<<8;    /* fall through */  in hashbig()
463     case 6 : b+=((uint32_t)k[5])<<16;   /* fall through */  in hashbig()
464     case 5 : b+=((uint32_t)k[4])<<24;   /* fall through */  in hashbig()
465     case 4 : a+=k[3];                   /* fall through */  in hashbig()
466     case 3 : a+=((uint32_t)k[2])<<8;    /* fall through */  in hashbig()
467     case 2 : a+=((uint32_t)k[1])<<16;   /* fall through */  in hashbig()
468     case 1 : a+=((uint32_t)k[0])<<24;   /* fall through */  in hashbig()