Searched refs:elem (Results 1 – 6 of 6) sorted by relevance
| /posix/ |
| A D | bug-regex5.c | 43 char elem[256]; in main() local
45 strncpy (elem, (const char *) (extra + idx + 1), extra[idx]); in main()
46 elem[extra[idx]] = '\0'; in main()
47 printf ("Found a collating element: %s\n", elem); in main()
|
| A D | register-atfork.c | 67 struct fork_handler *elem = fork_handler_list_at (fork_handlers, i); in libc_hidden_def() local
68 if (elem->dso_handle == dso_handle) in libc_hidden_def()
69 return elem; in libc_hidden_def()
|
| A D | fnmatch_loop.c | 480 int32_t elem; in FCT() local
495 for (elem = 0; elem < table_size; elem++) in FCT()
496 if (symb_table[2 * elem] != 0) in FCT()
498 idx = symb_table[2 * elem + 1]; in FCT()
529 if (elem < table_size) in FCT()
669 int32_t elem; in FCT() local
684 for (elem = 0; elem < table_size; elem++) in FCT()
685 if (symb_table[2 * elem] != 0) in FCT()
687 idx = symb_table[2 * elem + 1]; in FCT()
721 if (elem < table_size) in FCT()
|
| A D | regcomp.c | 2569 return elem; in parse_dup_op()
2605 tree = elem; in parse_dup_op()
2608 elem = duplicate_tree (elem, dfa); in parse_dup_op()
2618 elem = duplicate_tree (elem, dfa); in parse_dup_op()
2643 elem = duplicate_tree (elem, dfa); in parse_dup_op()
2846 int32_t elem; in seek_collating_symbol_entry() local
2848 for (elem = 0; elem < table_size; elem++) in seek_collating_symbol_entry()
2859 return elem; in seek_collating_symbol_entry()
2897 int32_t elem, idx; in lookup_collation_sequence_value() local
2902 if (elem != -1) in lookup_collation_sequence_value()
[all …]
|
| A D | regex_internal.c | 982 re_node_set_init_1 (re_node_set *set, Idx elem) in re_node_set_init_1() argument
992 set->elems[0] = elem; in re_node_set_init_1()
1284 re_node_set_insert (re_node_set *set, Idx elem) in re_node_set_insert() argument
1297 set->elems[0] = elem; in re_node_set_insert()
1315 if (elem < set->elems[0]) in re_node_set_insert()
1324 DEBUG_ASSERT (set->elems[idx - 1] < elem); in re_node_set_insert()
1328 set->elems[idx] = elem; in re_node_set_insert()
1353 set->elems[set->nelem++] = elem; in re_node_set_insert_last()
1389 if (set->elems[mid] < elem) in re_node_set_contains()
1394 return set->elems[idx] == elem ? idx + 1 : 0; in re_node_set_contains()
[all …]
|
| A D | regexec.c | 3267 bitset_word_t elem, mask; in build_trtable() local
3373 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1; in build_trtable()
3374 elem; in build_trtable()
3375 mask <<= 1, elem >>= 1, ++ch) in build_trtable()
3376 if (__glibc_unlikely (elem & 1)) in build_trtable()
3404 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1; in build_trtable()
3405 elem; in build_trtable()
3406 mask <<= 1, elem >>= 1, ++ch) in build_trtable()
3407 if (__glibc_unlikely (elem & 1)) in build_trtable()
|
Completed in 35 milliseconds