Home
last modified time | relevance | path

Searched refs:Regexp (Results 1 – 25 of 101) sorted by relevance

12345

/external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/testing/
Dparse_test.cc18 static const Regexp::ParseFlags TestZeroFlags = Regexp::WasDollar;
23 Regexp::ParseFlags flags;
26 static Regexp::ParseFlags kTestFlags = Regexp::MatchNL |
27 Regexp::PerlX |
28 Regexp::PerlClasses |
29 Regexp::UnicodeGroups;
177 { "[^ ]", "cc{0-0x9 0xb-0x1f 0x21-0x10ffff}", Regexp::FoldCase },
178 { "[^ ]", "cc{0-0x9 0xb-0x1f 0x21-0x10ffff}", Regexp::NeverNL },
179 { "[^ ]", "cc{0-0x9 0xb-0x1f 0x21-0x10ffff}", Regexp::NeverNL | Regexp::FoldCase },
181 { "[^ \f]", "cc{0-0x9 0xb 0xd-0x1f 0x21-0x10ffff}", Regexp::FoldCase },
[all …]
Dcompile_test.cc118 Regexp* re = Regexp::Parse(t.regexp, Regexp::PerlX|Regexp::Latin1, NULL); in TEST()
145 static void DumpByteMap(StringPiece pattern, Regexp::ParseFlags flags, in DumpByteMap()
147 Regexp* re = Regexp::Parse(pattern, flags, NULL); in DumpByteMap()
172 DumpByteMap(".", Regexp::PerlX|Regexp::Latin1, &bytemap); in TEST()
183 DumpByteMap("[0-9A-Fa-f]+", Regexp::PerlX|Regexp::Latin1, &bytemap); in TEST()
194 DumpByteMap("\\b", Regexp::LikePerl|Regexp::Latin1, &bytemap); in TEST()
207 DumpByteMap("[^_]", Regexp::LikePerl|Regexp::Latin1, &bytemap); in TEST()
221 DumpByteMap(".", Regexp::PerlX, &bytemap); in TEST()
235 Regexp* re = Regexp::Parse( in TEST()
237 Regexp::LikePerl, NULL); in TEST()
[all …]
Dregexp_test.cc19 TEST(Regexp, BigRef) { in TEST() argument
20 Regexp* re; in TEST()
21 re = Regexp::Parse("x", Regexp::NoParseFlags, NULL); in TEST()
32 TEST(Regexp, BigConcat) { in TEST() argument
33 Regexp* x; in TEST()
34 x = Regexp::Parse("x", Regexp::NoParseFlags, NULL); in TEST()
35 std::vector<Regexp*> v(90000, x); // ToString bails out at 100000 in TEST()
39 Regexp* re = Regexp::Concat(v.data(), static_cast<int>(v.size()), in TEST()
40 Regexp::NoParseFlags); in TEST()
47 TEST(Regexp, NamedCaptures) { in TEST() argument
[all …]
Drequired_prefix_test.cc50 Regexp::ParseFlags flags = Regexp::LikePerl; in TEST()
52 flags = flags | Regexp::Latin1; in TEST()
53 Regexp* re = Regexp::Parse(t.regexp, flags, NULL); in TEST()
58 Regexp* s; in TEST()
104 Regexp::ParseFlags flags = Regexp::LikePerl; in TEST()
106 flags = flags | Regexp::Latin1; in TEST()
107 Regexp* re = Regexp::Parse(t.regexp, flags, NULL); in TEST()
127 Regexp* re = Regexp::Parse("abc\\d+", Regexp::LikePerl, NULL); in TEST()
Dregexp_benchmark.cc35 Regexp* re = Regexp::Parse("(\\d+)-(\\d+)-(\\d+)", Regexp::LikePerl, NULL); in Test()
58 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in MemoryUsage()
647 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in ParseRegexp()
655 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in SimplifyRegexp()
657 Regexp* sre = re->Simplify(); in SimplifyRegexp()
665 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in NullWalkRegexp()
675 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in SimplifyCompileRegexp()
677 Regexp* sre = re->Simplify(); in SimplifyCompileRegexp()
689 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in CompileRegexp()
699 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in CompileToProg()
[all …]
Ddfa_test.cc56 Regexp* re = Regexp::Parse(s, Regexp::LikePerl, NULL); in TEST()
94 Regexp* re = Regexp::Parse("a[ab]{30}b", Regexp::LikePerl, NULL); in TEST()
157 Regexp* re = Regexp::Parse(StringPrintf("0[01]{%d}$", n), in TEST()
158 Regexp::LikePerl, NULL); in TEST()
227 Regexp* re = Regexp::Parse(StringPrintf("0[01]{%d}$", n), in TEST()
228 Regexp::LikePerl, NULL); in TEST()
286 Regexp* re = Regexp::Parse(t.regexp, Regexp::LikePerl, NULL); in TEST()
341 Regexp* re = Regexp::Parse(t.regexp, Regexp::LikePerl, NULL); in TEST()
Dsimplify_test.cc251 Regexp* re = Regexp::Parse(tests[i].regexp, in TEST()
252 Regexp::MatchNL | (Regexp::LikePerl & in TEST()
253 ~Regexp::OneLine), in TEST()
256 Regexp* sre = re->Simplify(); in TEST()
Dnull_walker.cc14 class NullWalker : public Regexp::Walker<bool> {
18 virtual bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
21 virtual bool ShortVisit(Regexp* re, bool a) { in ShortVisit()
38 bool NullWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg, in PostVisit()
44 void Regexp::NullWalk() { in NullWalk()
Dmimics_pcre_test.cc64 Regexp::ParseFlags flags = Regexp::LikePerl; in TEST()
66 flags = flags | Regexp::Latin1; in TEST()
67 Regexp* re = Regexp::Parse(t.regexp, flags, NULL); in TEST()
Dtester.cc145 Regexp::ParseFlags parse_flags;
149 static const Regexp::ParseFlags single_line =
150 Regexp::LikePerl;
151 static const Regexp::ParseFlags multi_line =
152 static_cast<Regexp::ParseFlags>(Regexp::LikePerl & ~Regexp::OneLine);
156 { single_line|Regexp::Latin1, "single-line, latin1" },
158 { multi_line|Regexp::NonGreedy, "multiline, nongreedy" },
159 { multi_line|Regexp::Latin1, "multiline, latin1" },
162 static std::string FormatMode(Regexp::ParseFlags flags) { in FormatMode()
172 Regexp::ParseFlags flags) in TestInstance()
[all …]
Ddump.cc57 static void DumpRegexpAppending(Regexp* re, std::string* s) { in DumpRegexpAppending()
68 if (re->parse_flags() & Regexp::NonGreedy) in DumpRegexpAppending()
73 if (re->op() == kRegexpLiteral && (re->parse_flags() & Regexp::FoldCase)) { in DumpRegexpAppending()
78 if (re->op() == kRegexpLiteralString && (re->parse_flags() & Regexp::FoldCase)) { in DumpRegexpAppending()
93 if (!(re->parse_flags() & Regexp::WasDollar)) { in DumpRegexpAppending()
153 std::string Regexp::Dump() { in Dump()
/external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/
Dsimplify.cc23 bool Regexp::SimplifyRegexp(const StringPiece& src, ParseFlags flags, in SimplifyRegexp()
25 Regexp* re = Parse(src, flags, status); in SimplifyRegexp()
28 Regexp* sre = re->Simplify(); in SimplifyRegexp()
46 bool Regexp::ComputeSimple() { in ComputeSimple()
47 Regexp** subs; in ComputeSimple()
108 class CoalesceWalker : public Regexp::Walker<Regexp*> {
111 virtual Regexp* PostVisit(Regexp* re, Regexp* parent_arg, Regexp* pre_arg,
112 Regexp** child_args, int nchild_args);
113 virtual Regexp* Copy(Regexp* re);
114 virtual Regexp* ShortVisit(Regexp* re, Regexp* parent_arg);
[all …]
Dregexp.h274 class Regexp {
327 Regexp** sub() { in sub()
345 Regexp* Incref();
353 static Regexp* Parse(const StringPiece& s, ParseFlags flags,
363 Regexp* Simplify();
394 static Regexp* Plus(Regexp* sub, ParseFlags flags);
395 static Regexp* Star(Regexp* sub, ParseFlags flags);
396 static Regexp* Quest(Regexp* sub, ParseFlags flags);
397 static Regexp* Concat(Regexp** subs, int nsubs, ParseFlags flags);
398 static Regexp* Alternate(Regexp** subs, int nsubs, ParseFlags flags);
[all …]
Dregexp.cc30 Regexp::Regexp(RegexpOp op, ParseFlags parse_flags) in Regexp() function in re2::Regexp
46 Regexp::~Regexp() { in ~Regexp()
69 bool Regexp::QuickDestroy() { in QuickDestroy()
79 static std::map<Regexp*, int>* ref_map;
81 int Regexp::Ref() { in Ref()
90 Regexp* Regexp::Incref() { in Incref()
95 ref_map = new std::map<Regexp*, int>; in Incref()
116 void Regexp::Decref() { in Decref()
135 void Regexp::Destroy() { in Destroy()
142 Regexp* stack = this; in Destroy()
[all …]
Dparse.cc71 class Regexp::ParseState {
87 bool PushRegexp(Regexp* re);
131 Regexp* DoFinish();
136 Regexp* FinishRegexp(Regexp*);
145 bool ParseCharClass(StringPiece* s, Regexp** out_re,
182 Regexp* stacktop_;
194 Regexp::ParseState::ParseState(ParseFlags flags, in ParseState()
206 Regexp::ParseState::~ParseState() { in ~ParseState()
207 Regexp* next; in ~ParseState()
208 for (Regexp* re = stacktop_; re != NULL; re = next) { in ~ParseState()
[all …]
Dwalker-inl.h25 template<typename T> class Regexp::Walker {
39 virtual T PreVisit(Regexp* re, T parent_arg, bool* stop);
50 virtual T PostVisit(Regexp* re, T parent_arg, T pre_arg,
65 virtual T ShortVisit(Regexp* re, T parent_arg) = 0;
70 T Walk(Regexp* re, T top_arg);
80 T WalkExponential(Regexp* re, T top_arg, int max_visits);
96 T WalkInternal(Regexp* re, T top_arg, bool use_copy);
102 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re, in PreVisit()
108 template<typename T> T Regexp::Walker<T>::PostVisit(Regexp* re, in PostVisit()
116 template<typename T> T Regexp::Walker<T>::Copy(T arg) { in Copy()
[all …]
Dmimics_pcre.cc33 static bool CanBeEmptyString(Regexp *re);
38 class PCREWalker : public Regexp::Walker<bool> {
42 virtual bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
45 virtual bool ShortVisit(Regexp* re, bool a) { in ShortVisit()
61 bool PCREWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg, in PostVisit()
91 if (re->parse_flags() & Regexp::WasDollar) in PostVisit()
109 bool Regexp::MimicsPCRE() { in MimicsPCRE()
122 class EmptyStringWalker : public Regexp::Walker<bool> {
126 virtual bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
129 virtual bool ShortVisit(Regexp* re, bool a) { in ShortVisit()
[all …]
Dset.cc42 Regexp::ParseFlags pf = static_cast<Regexp::ParseFlags>( in Add()
45 re2::Regexp* re = Regexp::Parse(pattern, pf, &status); in Add()
56 re2::Regexp* m = re2::Regexp::HaveMatch(n, pf); in Add()
59 PODArray<re2::Regexp*> sub(nsub + 1); in Add()
64 re = re2::Regexp::Concat(sub.data(), nsub + 1, pf); in Add()
66 re2::Regexp* sub[2]; in Add()
69 re = re2::Regexp::Concat(sub, 2, pf); in Add()
90 PODArray<re2::Regexp*> sub(size_); in Compile()
96 Regexp::ParseFlags pf = static_cast<Regexp::ParseFlags>( in Compile()
98 re2::Regexp* re = re2::Regexp::Alternate(sub.data(), size_, pf); in Compile()
Dtostring.cc37 class ToStringWalker : public Regexp::Walker<int> {
41 virtual int PreVisit(Regexp* re, int parent_arg, bool* stop);
42 virtual int PostVisit(Regexp* re, int parent_arg, int pre_arg,
44 virtual int ShortVisit(Regexp* re, int parent_arg) { in ShortVisit()
55 std::string Regexp::ToString() { in ToString()
68 int ToStringWalker::PreVisit(Regexp* re, int parent_arg, bool* stop) { in PreVisit()
147 int ToStringWalker::PostVisit(Regexp* re, int parent_arg, int pre_arg, in PostVisit()
166 (re->parse_flags() & Regexp::FoldCase) != 0); in PostVisit()
172 (re->parse_flags() & Regexp::FoldCase) != 0); in PostVisit()
195 if (re->parse_flags() & Regexp::NonGreedy) in PostVisit()
[all …]
Dcompile.cc127 class Compiler : public Regexp::Walker<Frag> {
136 static Prog *Compile(Regexp* re, bool reversed, int64_t max_mem);
140 static Prog* CompileSet(Regexp* re, RE2::Anchor anchor, int64_t max_mem);
150 Frag PreVisit(Regexp* re, Frag parent_arg, bool* stop);
151 Frag PostVisit(Regexp* re, Frag parent_arg, Frag pre_arg, Frag* child_args,
153 Frag ShortVisit(Regexp* re, Frag parent_arg);
228 void Setup(Regexp::ParseFlags flags, int64_t max_mem, RE2::Anchor anchor);
229 Prog* Finish(Regexp* re);
813 Frag Compiler::ShortVisit(Regexp* re, Frag) { in ShortVisit()
819 Frag Compiler::PreVisit(Regexp* re, Frag, bool* stop) { in PreVisit()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DSpecialCaseList.cpp29 bool SpecialCaseList::Matcher::insert(std::string Regexp, in insert() argument
32 if (Regexp.empty()) { in insert()
37 if (Regex::isLiteralERE(Regexp)) { in insert()
38 Strings[Regexp] = LineNumber; in insert()
41 Trigrams.insert(Regexp); in insert()
44 for (size_t pos = 0; (pos = Regexp.find('*', pos)) != std::string::npos; in insert()
46 Regexp.replace(pos, strlen("*"), ".*"); in insert()
49 Regexp = (Twine("^(") + StringRef(Regexp) + ")$").str(); in insert()
52 Regex CheckRE(Regexp); in insert()
175 std::string Regexp = SplitRegexp.first; in parse() local
[all …]
/external/llvm/lib/Support/
DSpecialCaseList.cpp107 std::string Regexp = SplitRegexp.first; in parse() local
111 if (Regex::isLiteralERE(Regexp)) { in parse()
112 Entries[Prefix][Category].Strings.insert(Regexp); in parse()
117 for (size_t pos = 0; (pos = Regexp.find("*", pos)) != std::string::npos; in parse()
119 Regexp.replace(pos, strlen("*"), ".*"); in parse()
123 Regex CheckRE(Regexp); in parse()
134 Regexps[Prefix][Category] += "^" + Regexp + "$"; in parse()
/external/libxml2/result/regexp/
Dbug6492441 Regexp: S(a|)E
4 Regexp: S(|b)E
7 Regexp: S(a||b)E
Dranges1 Regexp: a{2,3}
6 Regexp: ba{2,3}c
11 Regexp: a(b|c){2,3}d
Dbug3163381 Regexp: (((C|c)(([\s]*\-?[0-9]+(\.[0-9]+)?((e|E)\-?[0-9]+)?){3})+[\s]*))+
7 Regexp: (((C|c)(([\s]+\-?[0-9]+(\.[0-9]+)?((e|E)\-?[0-9]+)?){3})+[\s]*))+
13 Regexp: (((C|c)(([\s]+\-?[0-9]+(\.[0-9]+)?[\s]*,[\s]*\-?[0-9]+(\.[0-9]+)?){3})+[\s]*))+
19 Regexp: (((M|m)([\s]+\-?[0-9]+(\.[0-9]+)?((e|E)\-?[0-9]+)?[\s]*,[\s]*\-?[0-9]+(\.[0-9]+)?((e|E)\-?[…

12345