Lines Matching +full:num +full:- +full:strings
1 // SPDX-License-Identifier: GPL-2.0
10 "---------------------------------------------------------------------"
11 "---------------------------------------------------------------------"
12 "---------------------------------------------------------------------";
43 /* two-letter suffices */
68 return -1;
84 if (*pat == '-' && *(pat + 1) != ']') { /* Range */
85 if (*(pat - 1) <= c && c <= *(pat + 1))
87 if (*(pat - 1) > *(pat + 1))
159 * strglobmatch - glob expression pattern matching
181 * strlazymatch - matching pattern strings lazily with glob pattern
194 * strtailcmp - Compare the tail of two strings
204 while (--i1 >= 0 && --i2 >= 0) {
206 return s1[i1] - s2[i2];
237 printed += scnprintf(e + printed, size - printed, " %s ", or_and);
238 printed += scnprintf(e + printed, size - printed,
270 } while (ptr[-1] == '\\' && ptr[-2] != '\\');
323 memmove(d, s, p - s);
324 d += p - s;
340 memmove(ptr, ptr + 1, end - (ptr + 1));
342 end--;
374 /* This is non-escaped quote */
392 /* double backslash -- keep the second one. */
408 return c - '0';
410 return c - 'a' + 10;
411 return c - 'A' + 10;
427 int num = 0;
432 num++;
436 new_s = malloc(strlen(haystack) + (num * (replace_len - 1) + 1));
444 memcpy(to, from, 1 + loc - from);
445 to += loc - from;