Searched refs:pattern (Results 1 – 11 of 11) sorted by relevance
| /lib/ |
| A D | ts_kmp.c | 37 u8 * pattern; member
56 while (q > 0 && kmp->pattern[q] in kmp_find()
59 if (kmp->pattern[q] in kmp_find()
81 while (k > 0 && (icase ? toupper(pattern[k]) : pattern[k]) in compute_prefix_tbl()
82 != (icase ? toupper(pattern[q]) : pattern[q])) in compute_prefix_tbl()
84 if ((icase ? toupper(pattern[k]) : pattern[k]) in compute_prefix_tbl()
85 == (icase ? toupper(pattern[q]) : pattern[q])) in compute_prefix_tbl()
108 kmp->pattern = (u8 *) kmp->prefix_tbl + prefix_tbl_len; in kmp_init()
111 kmp->pattern[i] = toupper(((u8 *)pattern)[i]); in kmp_init()
113 memcpy(kmp->pattern, pattern, len); in kmp_init()
[all …]
|
| A D | ts_bm.c | 52 u8 * pattern; member
69 if (t != *(pattern-i)) in matchpat()
96 i = matchpat(&bm->pattern[bm->patlen-1], bm->patlen, in bm_find()
119 while(pattern[x--] == pattern[y--]) { in subpattern()
125 ret = pattern[i-1] != pattern[j-1]; in subpattern()
140 bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i; in compute_prefix_tbl()
142 bm->bad_shift[tolower(bm->pattern[i])] in compute_prefix_tbl()
153 if (subpattern(bm->pattern, i, j, g)) { in compute_prefix_tbl()
179 bm->pattern[i] = toupper(((u8 *)pattern)[i]); in bm_init()
181 memcpy(bm->pattern, pattern, len); in bm_init()
[all …]
|
| A D | parser.c | 119 for (p = table; !match_one(s, p->pattern, args) ; p++) in match_token()
284 bool match_wildcard(const char *pattern, const char *str) in match_wildcard() argument
287 const char *p = pattern; in match_wildcard()
301 pattern = p; in match_wildcard()
312 p = pattern; in match_wildcard()
|
| A D | textsearch.c | 263 struct ts_config *textsearch_prepare(const char *algo, const void *pattern, in textsearch_prepare() argument
289 conf = ops->init(pattern, len, gfp_mask, flags); in textsearch_prepare()
|
| A D | ts_fsm.c | 255 static struct ts_config *fsm_init(const void *pattern, unsigned int len, in fsm_init() argument
261 struct ts_fsm_token *tokens = (struct ts_fsm_token *) pattern; in fsm_init()
289 memcpy(fsm->tokens, pattern, len); in fsm_init()
|
| A D | test_bitmap.c | 1272 static void __init test_bitmap_write_helper(const char *pattern) in test_bitmap_write_helper() argument
1284 bitmap_parselist(pattern, pat_bitmap, TEST_BIT_LEN); in test_bitmap_write_helper()
1328 unsigned char *pattern[3] = {"", "all:1/2", "all"}; in test_bitmap_read_write() local
1371 for (pi = 0; pi < ARRAY_SIZE(pattern); pi++) in test_bitmap_read_write()
1372 test_bitmap_write_helper(pattern[pi]); in test_bitmap_read_write()
|
| A D | Kconfig.ubsan | 124 depends on $(cc-option,-fsanitize-undefined-ignore-overflow-pattern=all)
|
| A D | Kconfig | 424 simple text pattern matching. It originated in the ATA code
|
| A D | test_bpf.c | 2216 int pattern, index; in __bpf_fill_ld_imm64_bytes() local
2226 for (pattern = 0; pattern < BIT(8); pattern++) { in __bpf_fill_ld_imm64_bytes()
2232 if (pattern & BIT(index)) in __bpf_fill_ld_imm64_bytes()
|
| A D | Kconfig.debug | 3332 memtest=1, mean do 1 test pattern;
|
| /lib/tests/ |
| A D | kunit_iov_iter.c | 114 scratch[i] = pattern(i); in iov_kunit_copy_to_kvec()
164 buffer[i] = pattern(i); in iov_kunit_copy_from_kvec()
184 buffer[i++] = pattern(j); in iov_kunit_copy_from_kvec()
273 scratch[i] = pattern(i); in iov_kunit_copy_to_bvec()
296 p[i] = pattern(patt++); in iov_kunit_copy_to_bvec()
327 buffer[i] = pattern(i); in iov_kunit_copy_from_bvec()
433 scratch[i] = pattern(i); in iov_kunit_copy_to_folioq()
495 buffer[i] = pattern(i); in iov_kunit_copy_from_folioq()
522 buffer[i++] = pattern(j); in iov_kunit_copy_from_folioq()
595 scratch[i] = pattern(i); in iov_kunit_copy_to_xarray()
[all …]
|
Completed in 38 milliseconds