Searched refs:src (Results 1 – 7 of 7) sorted by relevance
| /posix/ |
| A D | tst-boost.c | 27 frob_escapes (char *src, int pattern) in frob_escapes() argument
31 for (dst = src; *src != '\0'; dst++, src++) in frob_escapes()
33 if (*src == '\\') in frob_escapes()
35 switch (src[1]) in frob_escapes()
38 src++; in frob_escapes()
42 src++; in frob_escapes()
46 src++; in frob_escapes()
56 src++; in frob_escapes()
57 *dst = *src; in frob_escapes()
63 if (src != dst) in frob_escapes()
[all …]
|
| A D | tst-rxspencer.c | 109 const char *src; in mb_frob_string() local
118 for (src = str, dst = ret; *src; ++src) in mb_frob_string()
122 *dst++ = *src; in mb_frob_string()
135 const char *src; in mb_frob_pattern() local
145 for (src = str, dst = ret; *src; ++src) in mb_frob_pattern()
146 if (*src == '\\') in mb_frob_pattern()
149 *dst++ = *src; in mb_frob_pattern()
154 *dst++ = *src; in mb_frob_pattern()
161 if (!in_class && *src == '[' && strchr (":.=", src[1])) in mb_frob_pattern()
163 else if (in_class && *src == ']' && strchr (":.=", src[-1])) in mb_frob_pattern()
[all …]
|
| A D | regex_internal.c | 1030 dest->nelem = src->nelem; in re_node_set_init_copy()
1031 if (src->nelem > 0) in re_node_set_init_copy()
1040 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); in re_node_set_init_copy()
1200 if (src == NULL || src->nelem == 0) in re_node_set_merge()
1218 dest->nelem = src->nelem; in re_node_set_merge()
1219 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); in re_node_set_merge()
1225 for (sbase = dest->nelem + 2 * src->nelem, in re_node_set_merge()
1228 if (dest->elems[id] == src->elems[is]) in re_node_set_merge()
1230 else if (dest->elems[id] < src->elems[is]) in re_node_set_merge()
1231 dest->elems[--sbase] = src->elems[is--]; in re_node_set_merge()
[all …]
|
| A D | regex_internal.h | 749 bitset_copy (bitset_t dest, const bitset_t src) in bitset_copy() argument
751 memcpy (dest, src, sizeof (bitset_t)); in bitset_copy()
767 bitset_merge (bitset_t dest, const bitset_t src) in bitset_merge() argument
771 dest[bitset_i] |= src[bitset_i]; in bitset_merge()
775 bitset_mask (bitset_t dest, const bitset_t src) in bitset_mask() argument
779 dest[bitset_i] &= src[bitset_i]; in bitset_mask()
|
| A D | regcomp.c | 122 static bin_tree_t *duplicate_tree (const bin_tree_t *src, re_dfa_t *dfa);
1630 Idx src, idx; in calc_inveclosure() local
1635 for (src = 0; src < dfa->nodes_len; ++src) in calc_inveclosure()
1637 Idx *elems = dfa->eclosures[src].elems; in calc_inveclosure()
1638 for (idx = 0; idx < dfa->eclosures[src].nelem; ++idx) in calc_inveclosure()
1640 ok = re_node_set_insert_last (dfa->inveclosures + elems[idx], src); in calc_inveclosure()
|
| A D | regexec.c | 109 re_dfastate_t **src, Idx num);
1700 re_dfastate_t **src, Idx num) in merge_state_array() argument
1707 dst[st_idx] = src[st_idx]; in merge_state_array()
1708 else if (src[st_idx] != NULL) in merge_state_array()
1712 &src[st_idx]->nodes); in merge_state_array()
|
| A D | tst-regex.input | 2843 * db2/btree/btree.src: Likewise.
2855 * db2/db/db.src: Likewise.
2869 * db2/hash/hash.src: Likewise.
2883 * db2/include/db.h.src: Likewise.
2884 * db2/include/db_185.h.src: Likewise.
2890 * db2/include/db_int.h.src: Likewise.
2914 * db2/log/log.src: Likewise.
2963 * db2/txn/txn.src: Likewise.
9972 * db2/include/db.h.src: Likewise.
9991 * db2/log/log.src: Likewise.
[all …]
|
Completed in 41 milliseconds