if (sep >= 0) {
read_long_string(ls, seminfo, sep);
return TK_STRING;
- }
- else if (sep == -1) return '[';
- else lexerror(ls, "invalid long string delimiter", TK_STRING);
+ } else if (sep == -1) {
+ return '[';
+ } else {
+ lexerror(ls, "invalid long string delimiter", TK_STRING);
+ break;
+ }
}
case '=': {
next(ls);
switch (parity) {
case 3:
len = MIN(caiters[2].iter_mapsize, len);
+ /* falls through */
case 2:
len = MIN(caiters[1].iter_mapsize, len);
+ /* falls through */
case 1:
len = MIN(caiters[0].iter_mapsize, len);
}
case 3:
len = MIN(xiters[2].iter_mapsize, len);
len = MIN(citers[2].iter_mapsize, len);
+ /* falls through */
case 2:
len = MIN(xiters[1].iter_mapsize, len);
len = MIN(citers[1].iter_mapsize, len);
+ /* falls through */
case 1:
len = MIN(xiters[0].iter_mapsize, len);
len = MIN(citers[0].iter_mapsize, len);
a.b[6] = mul_lt[a.b[6]]; \
a.b[5] = mul_lt[a.b[5]]; \
a.b[4] = mul_lt[a.b[4]]; \
+ /* falls through */ \
case 4: \
a.b[3] = mul_lt[a.b[3]]; \
a.b[2] = mul_lt[a.b[2]]; \