binutils/libiberty/regex.c

1967 # define BUF_PUSH_2(c1, c2)						\
1970     *b++ = (UCHAR_T) (c1);						\
1976 # define BUF_PUSH_3(c1, c2, c3)						\
1979     *b++ = (UCHAR_T) (c1);						\
2304   register UCHAR_T c, c1;
2551                     PATFETCH (c1);
2552                     if (!(c1 == '+' || c1 == '?'))
2559                     c = c1;
2747                     PATFETCH (c1);
2748 		    BUF_PUSH(c1);
2750 		    range_start = c1;
2789                     PATFETCH (c1);
2807                     c1 = 0;
2817 			if (c1 < CHAR_CLASS_MAX_LENGTH)
2818 			  str[c1++] = c;
2823                     str[c1] = '\0';
2865                         c1++;
2866                         while (c1--)
2885 		    c1 = 0;
2895 			if (c1 < sizeof (str) - 1)
2896 			  str[c1++] = c;
2901 		    str[c1] = '\0';
2915 			int datasize = c1 + 1;
2922 			    if (c1 != 1)
2956 				if (idx == 0 || cp < (wint_t*) str + c1)
2973 				char char_str[c1];
2979 				for (i = 0; i < c1; ++i)
2993 				hash = elem_hash (char_str, c1);
3002 					&& c1 == extra[symb_table[2 * elem + 1]]
3005 							 + 1], c1) == 0)
3027 				else if (symb_table[2 * elem] == 0 && c1 == 1)
3101                         c1++;
3102                         while (c1--)
3159                     PATFETCH (c1);
3160                     SET_LIST_BIT (c1);
3161 		    range_start = c1;
3197                     PATFETCH (c1);
3212                     c1 = 0;
3222 			if (c1 < CHAR_CLASS_MAX_LENGTH)
3223 			  str[c1++] = c;
3228                     str[c1] = '\0';
3319                         c1++;
3320                         while (c1--)
3337 		    c1 = 0;
3347 			if (c1 < MB_LEN_MAX)
3348 			  str[c1++] = c;
3353 		    str[c1] = '\0';
3367 			    if (c1 != 1)
3405 			    if (idx == 0 || cp < str + c1)
3453                         c1++;
3454                         while (c1--)
3471 		    c1 = 0;
3481 			if (c1 < sizeof (str))
3482 			  str[c1++] = c;
3487 		    str[c1] = '\0';
3502 			    if (c1 != 1)
3539 			    hash = elem_hash (str, c1);
3548 				    && c1 == extra[symb_table[2 * elem + 1]]
3552 					       c1) == 0)
3582 			    c1 = extra[idx++];
3583 			    if (c1 == 1)
3585 			    while (c1-- > 0)
3596                         c1++;
3597                         while (c1--)
4077               c1 = c - '0';
4079               if (c1 > regnum)
4083               if (group_in_compile_stack (compile_stack, (regnum_t) c1))
4087               BUF_PUSH_2 (duplicate, c1);