Home
last modified time | relevance | path

Searched refs:re (Results 1 - 25 of 1350) sorted by relevance

12345678910>>...54

/third_party/python/Lib/test/
H A Dtest_re.py6 import re namespace
12 from re import Scanner
23 # Misc tests from Tim Peters' re.doc
26 # what you're doing. Some of these tests were carefully modeled to
50 with self.assertRaises(re.error) as cm:
51 re.compile(pattern)
59 with self.assertRaises(re.error) as cm:
60 re.sub(pattern, repl, string)
70 it = re.finditer(b'a', b)
80 x = re
[all...]
/third_party/ffmpeg/libavutil/
H A Dtx_template.c185 BF(tmp[0].re, tmp[1].im, in[1].im, in[2].im); in fft3()
186 BF(tmp[0].im, tmp[1].re, in[1].re, in[2].re); in fft3()
188 out[0*stride].re = in[0].re + tmp[1].re; in fft3()
192 mtmp[0] = (int64_t)tab[0] * tmp[0].re; in fft3()
194 mtmp[2] = (int64_t)tab[2] * tmp[1].re; in fft3()
196 out[1*stride].re in fft3()
[all...]
/third_party/icu/icu4c/source/test/cintltst/
H A Dreapits.c58 * 're" is the compiled, ready-to-go regular expression.
63 re = uregex_openC(pattern, flags, NULL, &status); \
68 uregex_setText(re, srcString, -1, &status); \
76 uregex_close(re); \
215 URegularExpression *re; in TestRegexCAPI() local
223 re = uregex_open(pat, -1, 0, 0, &status); in TestRegexCAPI()
228 uregex_close(re); in TestRegexCAPI()
232 re = uregex_open(pat, -1, in TestRegexCAPI()
236 uregex_close(re); in TestRegexCAPI()
240 re in TestRegexCAPI()
1417 URegularExpression *re; TestUTextAPI() local
2204 URegularExpression *re; TestRefreshInput() local
2243 URegularExpression *re; TestBug8421() local
2281 URegularExpression *re; TestBug10815() local
[all...]
/third_party/ffmpeg/libavcodec/
H A Dmdct15.c42 #define CMUL3(c, a, b) CMUL((c).re, (c).im, (a).re, (a).im, (b).re, (b).im)
97 t[0].re = in[3].re + in[12].re; in fft5()
99 t[1].im = in[3].re - in[12].re; in fft5()
100 t[1].re = in[3].im - in[12].im; in fft5()
101 t[2].re in fft5()
[all...]
H A Dgolomb.h77 OPEN_READER(re, gb); in get_ue_golomb()
78 UPDATE_CACHE(re, gb); in get_ue_golomb()
79 buf = GET_CACHE(re, gb); in get_ue_golomb()
83 LAST_SKIP_BITS(re, gb, ff_golomb_vlc_len[buf]); in get_ue_golomb()
84 CLOSE_READER(re, gb); in get_ue_golomb()
89 LAST_SKIP_BITS(re, gb, 32 - log); in get_ue_golomb()
90 CLOSE_READER(re, gb); in get_ue_golomb()
131 OPEN_READER(re, gb); in get_ue_golomb_31()
132 UPDATE_CACHE(re, gb); in get_ue_golomb_31()
133 buf = GET_CACHE(re, g in get_ue_golomb_31()
[all...]
H A Dfft_template.c337 tmp1 = tmpz[0].re + (unsigned)tmpz[1].re; in fft_calc_c()
338 tmp5 = tmpz[2].re + (unsigned)tmpz[3].re; in fft_calc_c()
341 tmp3 = tmpz[0].re - (unsigned)tmpz[1].re; in fft_calc_c()
344 tmp7 = tmpz[2].re - (unsigned)tmpz[3].re; in fft_calc_c()
346 tmpz[0].re = tmp1 + tmp5; in fft_calc_c()
347 tmpz[2].re in fft_calc_c()
[all...]
/third_party/node/deps/v8/tools/torque/
H A Dformat-torque.py12 import re namespace
29 input = re.sub(r'%([A-Za-z])', kPercentEscape + r'\1', input)
30 # Similarly, avoid treating * and & as binary operators when they're
32 input = re.sub(r'([^/])\*([a-zA-Z(])', r'\1' + kDerefEscape + r'\2', input)
33 input = re.sub(r'&([a-zA-Z(])', kAddressofEscape + r'\1', input)
36 input = re.sub(r'(if\s+)constexpr(\s*\()', r'\1/*COxp*/\2', input)
37 input = re.sub(r'(\s+)operator\s*(\'[^\']+\')', r'\1/*_OPE \2*/', input)
38 input = re.sub(r'\btypeswitch\s*(\([^{]*\))\s{', r' if /*tPsW*/ \1 {', input)
39 input = re.sub(r'\bcase\s*(\([^{]*\))\s*:\s*deferred\s*{', r' if /*cAsEdEfF*/ \1 {', input)
40 input = re
[all...]
/third_party/libsnd/Scripts/
H A Dcstyle.py12 import re namespace
34 self.leading_space_re = re.compile ('^(\t+| )')
35 self.trailing_space_re = re.compile ('(\t+| )$')
36 self.define_hack_re = re.compile ("(#\s*define\s+[a-zA-Z0-9_]+)\(")
58 line = re.sub ("( |\t*)//.*", '', line)
81 # we're removing.
111 self.trailing_newline_re = re.compile ('[\r\n]+$')
112 self.indent_re = re.compile ("^\s*")
116 [ ( re.compile (" "), "multiple space instead of tab" )
117 , ( re
[all...]
/third_party/ffmpeg/libavcodec/x86/
H A Dmdct15.asm41 VBROADCASTSD m0, [inq + %1] ; in[ 0].re, in[ 0].im, in[ 0].re, in[ 0].im
42 movsd xm1, [inq + 1*16 + 8 + %1] ; in[ 3].re, in[ 3].im, 0, 0
43 movsd xm4, [inq + 6*16 + 0 + %1] ; in[12].re, in[12].im, 0, 0
44 movhps xm1, [inq + 3*16 + 0 + %1] ; in[ 3].re, in[ 3].im, in[ 6].re, in[ 6].im
45 movhps xm4, [inq + 4*16 + 8 + %1] ; in[12].re, in[12].im, in[ 9].re, in[ 9].im
47 subps xm2, xm1, xm4 ; t[2].im, t[2].re, t[3].im, t[3].re
[all...]
H A Dmdct15_init.c42 s->exptab[60].re = s->exptab[60].im = s->exptab[19].re; in perm_twiddles()
43 s->exptab[61].re = s->exptab[61].im = s->exptab[19].im; in perm_twiddles()
44 s->exptab[62].re = s->exptab[62].im = s->exptab[20].re; in perm_twiddles()
45 s->exptab[63].re = s->exptab[63].im = s->exptab[20].im; in perm_twiddles()
60 { tmp[6*1 + k].re, tmp[6*1 + k].re }, in perm_twiddles()
61 { tmp[6*2 + k].re, tmp[6*2 + k].re }, in perm_twiddles()
[all...]
/third_party/pcre2/pcre2/src/
H A Dpcre2_pattern_info.c67 const pcre2_real_code *re = (pcre2_real_code *)code; in pcre2_pattern_info() local
110 if (re == NULL) return PCRE2_ERROR_NULL; in pcre2_pattern_info()
115 if (re->magic_number != MAGIC_NUMBER) return PCRE2_ERROR_BADMAGIC; in pcre2_pattern_info()
119 if ((re->flags & (PCRE2_CODE_UNIT_WIDTH/8)) == 0) return PCRE2_ERROR_BADMODE; in pcre2_pattern_info()
124 *((uint32_t *)where) = re->overall_options; in pcre2_pattern_info()
128 *((uint32_t *)where) = re->compile_options; in pcre2_pattern_info()
132 *((uint32_t *)where) = re->top_backref; in pcre2_pattern_info()
136 *((uint32_t *)where) = re->bsr_convention; in pcre2_pattern_info()
140 *((uint32_t *)where) = re->top_bracket; in pcre2_pattern_info()
144 *((uint32_t *)where) = re in pcre2_pattern_info()
271 pcre2_real_code *re = (pcre2_real_code *)code; pcre2_callout_enumerate() local
[all...]
H A Dpcre2_study.c57 #define SET_BIT(c) re->start_bitmap[(c)/8] |= (1u << ((c)&7))
83 re compiled pattern block
103 find_minlength(const pcre2_real_code *re, PCRE2_SPTR code, in find_minlength() argument
115 BOOL dupcapused = (re->flags & PCRE2_DUPCAPUSED) != 0; in find_minlength()
186 d = find_minlength(re, cc, startcode, utf, recurses, countptr, in find_minlength()
207 prev_cap_d = find_minlength(re, cc, startcode, utf, recurses, countptr, in find_minlength()
476 if (!dupcapused && (re->overall_options & PCRE2_MATCH_UNSET_BACKREF) == 0) in find_minlength()
480 (PCRE2_UCHAR *)((uint8_t *)re + sizeof(pcre2_real_code)) + in find_minlength()
481 GET2(cc, 1) * re->name_entry_size; in find_minlength()
521 dd = find_minlength(re, c in find_minlength()
781 set_table_bit(pcre2_real_code *re, PCRE2_SPTR p, BOOL caseless, BOOL utf, BOOL ucp) set_table_bit() argument
866 set_type_bits(pcre2_real_code *re, int cbit_type, unsigned int table_limit) set_type_bits() argument
907 set_nottype_bits(pcre2_real_code *re, int cbit_type, unsigned int table_limit) set_nottype_bits() argument
953 set_start_bits(pcre2_real_code *re, PCRE2_SPTR code, BOOL utf, BOOL ucp, int *depthptr) set_start_bits() argument
1672 study(pcre2_real_code *re) study() argument
[all...]
/third_party/node/deps/v8/tools/
H A Dcallstats_groups.py5 import re namespace
8 ('Group-IC', re.compile(".*IC_.*")),
9 ('Group-OptimizeBackground', re.compile(".*OptimizeBackground.*")),
11 re.compile("StackGuard|.*Optimize.*|.*Deoptimize.*|Recompile.*")),
12 ('Group-CompileBackground', re.compile("(.*CompileBackground.*)")),
13 ('Group-Compile', re.compile("(^Compile.*)|(.*_Compile.*)")),
14 ('Group-ParseBackground', re.compile(".*ParseBackground.*")),
15 ('Group-Parse', re.compile(".*Parse.*")),
16 ('Group-Callback', re.compile(".*Callback.*")),
17 ('Group-API', re
[all...]
/third_party/rust/crates/regex/tests/
H A Dapi.rs3 let re = regex!(""); in empty_regex_empty_match()
4 assert_eq!(vec![(0, 0)], findall!(re, "")); in empty_regex_empty_match()
9 let re = regex!(""); in empty_regex_nonempty_match()
10 assert_eq!(vec![(0, 0), (1, 1), (2, 2), (3, 3)], findall!(re, "abc")); in empty_regex_nonempty_match()
15 let re = regex!(r"[0-9]*"); in one_zero_length_match()
16 assert_eq!(vec![(0, 0), (1, 2), (3, 4)], findall!(re, "a1b2")); in one_zero_length_match()
21 let re = regex!(r"[0-9]*"); in many_zero_length_match()
24 findall!(re, "a1bbb2") in many_zero_length_match()
30 let re = regex!(r"[0-9]?"); in many_sequential_zero_length_match()
33 findall!(re, "a12b3 in many_sequential_zero_length_match()
[all...]
H A Dmacros.rs4 ($re:expr, $text:expr) => {{
5 $re.find_iter(text!($text))
13 ($name:ident, $re:expr, $text:expr, $ismatch:expr) => {
16 let re = regex!($re);
17 assert_eq!($ismatch, re.is_match(text!($text)));
23 ($name:ident, $re:expr, $text:expr, $($loc:tt)+) => (
28 let r = regex!($re);
49 $re, text, expected, sgot);
56 ($name:ident, $re
[all...]
/third_party/mbedtls/tests/scripts/
H A Danalyze_outcomes.py12 import re namespace
111 # The CI's python is too old for re.Pattern
112 #if isinstance(str_or_re, re.Pattern):
149 # don't issue an error if they're skipped with drivers,
150 # but issue an error if they're not (means we have a bad entry).
259 re.compile('.*HMAC.*'),
263 re.compile('generic .* Hash file .*'),
270 re.compile('PSA dispatch .* legacy only'),
299 re.compile(r'PEM read .*(AES|DES|\bencrypt).*'),
320 re
[all...]
/third_party/rust/crates/regex/regex-capi/ctest/
H A Dtest.c17 rure *re = rure_compile_must("\\p{So}$"); in test_is_match() local
18 bool matched = rure_is_match(re, (const uint8_t *)haystack, in test_is_match()
27 rure_free(re); in test_is_match()
35 rure *re = rure_compile_must("a+"); in test_shortest_match() local
37 bool matched = rure_shortest_match(re, (const uint8_t *)haystack, in test_shortest_match()
56 rure_free(re); in test_shortest_match()
64 rure *re = rure_compile_must("\\p{So}$"); in test_find() local
66 bool matched = rure_find(re, (const uint8_t *)haystack, strlen(haystack), in test_find()
85 rure_free(re); in test_find()
93 rure *re in test_captures() local
155 rure *re = rure_compile_must("\\\\w+(\\\\w)"); test_iter() local
229 rure *re = rure_compile_must( test_iter_capture_names() local
278 rure *re = rure_compile((const uint8_t *)pattern, strlen(pattern), test_flags() local
295 rure *re = rure_compile((const uint8_t *)"(", 1, 0, NULL, err); test_compile_error() local
324 rure *re = rure_compile((const uint8_t *)"\\\\w{100}", 8, 0, opts, err); test_compile_error_size_limit() local
362 rure_set *re = rure_compile_set((const uint8_t **) patterns, test_regex_set_matches() local
428 rure_set *re = rure_compile_set((const uint8_t **) patterns, test_regex_set_match_start() local
508 rure_set *re = rure_compile_set( test_regex_set_options() local
[all...]
/third_party/rust/crates/regex/regex-syntax/benches/
H A Dbench.rs11 let re = r"^bc(d|e)*$"; in parse_simple1()
12 Parser::new().parse(re).unwrap() in parse_simple1()
19 let re = r"'[a-zA-Z_][a-zA-Z0-9_]*(')\b"; in parse_simple2()
20 Parser::new().parse(re).unwrap() in parse_simple2()
27 let re = r"\p{L}|\p{N}|\s|.|\d"; in parse_small1()
28 Parser::new().parse(re).unwrap() in parse_small1()
35 let re = r"\pL\p{Greek}\p{Hiragana}\p{Alphabetic}\p{Hebrew}\p{Arabic}"; in parse_medium1()
36 Parser::new().parse(re).unwrap() in parse_medium1()
43 let re = r"\s\S\w\W\d\D"; in parse_medium2()
44 Parser::new().parse(re) in parse_medium2()
[all...]
/third_party/mbedtls/scripts/mbedtls_dev/
H A Dc_parsing_helper.py15 import re namespace
27 _DECLARATION_RE = re.compile(
31 re.A | re.S)
36 typ = re.sub(r'\s+', r' ', typ)
37 typ = re.sub(r'\s*\*', r' *', typ)
55 VOID_RE = re.compile(r'\s*\bvoid\s*\Z', re.A)
79 _C_COMMENT_RE = re.compile(r'//(?:[^\n]|\\\n)*|/\*.*?\*/', re
[all...]
H A Dmacro_collector.py20 import re namespace
158 _argument_split_re = re.compile(r' *, *')
161 return re.split(cls._argument_split_re, arguments)
182 # Dear Pylint, enumerate won't work here since we're modifying
269 if re.match(r'MAC(?:_|\Z)', name):
271 elif re.match(r'KDF(?:_|\Z)', name):
273 elif re.search(r'0x020000[0-9A-Fa-f]{2}', expansion):
275 elif re.search(r'0x03[0-9A-Fa-f]{6}', expansion):
277 elif re.search(r'0x05[0-9A-Fa-f]{6}', expansion):
279 elif re
[all...]
H A Dcrypto_knowledge.py11 import re namespace
26 short = re.sub(r'\bPSA_(?:ALG|DH_FAMILY|ECC_FAMILY|KEY_[A-Z]+)_', r'', short)
27 short = re.sub(r' +', r'', short)
29 short = re.sub(r'PUBLIC_KEY\b', r'PUB', short)
30 short = re.sub(r'KEY_PAIR\b', r'PAIR', short)
31 short = re.sub(r'\bBRAINPOOL_P', r'BP', short)
32 short = re.sub(r'\bMONTGOMERY\b', r'MGM', short)
33 short = re.sub(r'AEAD_WITH_SHORTENED_TAG\b', r'AEAD_SHORT', short)
34 short = re.sub(r'\bDETERMINISTIC_', r'DET_', short)
35 short = re
[all...]
/third_party/mesa3d/src/gallium/drivers/freedreno/
H A Dtrace-parser.py3 import re namespace
149 flush_batch_match = re.compile(r": flush_batch: (\S+): cleared=(\S+), gmem_reason=(\S+), num_draws=(\S+)")
150 framebuffer_match = re.compile(r": framebuffer: (\S+)x(\S+)x(\S+)@(\S+), nr_cbufs: (\S+)")
151 surface_match = re.compile(r": surface: (\S+)x(\S+)@(\S+), fmt=(\S+)")
154 gmem_match = re.compile(r": render_gmem: (\S+)x(\S+) bins of (\S+)x(\S+)")
155 sysmem_match = re.compile(r": render_sysmem")
156 state_restore_match = re.compile(r"\+(\S+): end_state_restore")
157 prologue_match = re.compile(r"\+(\S+): end_prologue")
158 binning_ib_match = re.compile(r"\+(\S+): end_binning_ib")
159 vsc_overflow_match = re
[all...]
/third_party/rust/crates/regex/bench/src/
H A Drust_compile.rs9 let re = Parser::new().parse(r"^bc(d|e)*$").unwrap(); in compile_simple()
10 Compiler::new().compile(&[re]).unwrap() in compile_simple()
17 let re = Parser::new().parse(r"^bc(d|e)*$").unwrap(); in compile_simple_bytes()
18 Compiler::new().bytes(true).compile(&[re]).unwrap() in compile_simple_bytes()
30 let re = Parser::new().parse(r"\p{L}|\p{N}|\s|.|\d").unwrap(); in compile_small()
31 Compiler::new().compile(&[re]).unwrap() in compile_small()
38 let re = Parser::new().parse(r"\p{L}|\p{N}|\s|.|\d").unwrap(); in compile_small_bytes()
39 Compiler::new().bytes(true).compile(&[re]).unwrap() in compile_small_bytes()
51 let re = Parser::new().parse(r"\p{L}{50}").unwrap(); in compile_huge()
52 Compiler::new().size_limit(1 << 30).compile(&[re]) in compile_huge()
[all...]
/third_party/rust/crates/regex/regex-capi/src/
H A Drure.rs22 re: bytes::Regex,
35 re: bytes::RegexSet,
47 re: *const Regex,
60 &self.re in deref()
67 &self.re in deref()
82 let re = rure_compile( in rure_compile_must()
90 re in rure_compile_must()
127 Ok(re) => { in rure_compile()
129 for (i, name) in re.capture_names().enumerate() { in rure_compile()
134 let re in rure_compile()
[all...]
/third_party/protobuf/
H A Dupdate_version.py11 import re namespace
94 lambda line : re.sub(
105 line = re.sub(
109 line = re.sub(
114 line = re.sub(
118 line = re.sub(
122 line = re.sub(
126 line = re.sub(
133 line = re.sub(
138 line = re
[all...]

Completed in 11 milliseconds

12345678910>>...54