version 1.51, 2024/04/25 18:33:53 |
version 1.52, 2024/05/04 22:59:21 |
|
|
f->gototab[state].entries[0].state = val; |
f->gototab[state].entries[0].state = val; |
f->gototab[state].inuse++; |
f->gototab[state].inuse++; |
return val; |
return val; |
} else if (ch > f->gototab[state].entries[f->gototab[state].inuse-1].ch) { |
} else if ((unsigned)ch > f->gototab[state].entries[f->gototab[state].inuse-1].ch) { |
// not seen yet, insert and return |
// not seen yet, insert and return |
gtt *tab = & f->gototab[state]; |
gtt *tab = & f->gototab[state]; |
if (tab->inuse + 1 >= tab->allocated) |
if (tab->inuse + 1 >= tab->allocated) |
|
|
* Call u8_rune with at least awk_mb_cur_max ahead in |
* Call u8_rune with at least awk_mb_cur_max ahead in |
* the buffer until EOF interferes. |
* the buffer until EOF interferes. |
*/ |
*/ |
if (k - j < awk_mb_cur_max) { |
if (k - j < (int)awk_mb_cur_max) { |
if (k + awk_mb_cur_max > buf + bufsize) { |
if (k + awk_mb_cur_max > buf + bufsize) { |
char *obuf = buf; |
char *obuf = buf; |
adjbuf(&buf, &bufsize, |
adjbuf(&buf, &bufsize, |