| /external/chromium_org/third_party/re2/re2/testing/ |
| tester.h | 12 #include "re2/prog.h"
23 kEngineBacktrack = 0, // Prog::BadSearchBacktrack
24 kEngineNFA, // Prog::SearchNFA
25 kEngineDFA, // Prog::SearchDFA, only ask whether it matched
26 kEngineDFA1, // Prog::SearchDFA, ask for match[0]
27 kEngineOnePass, // Prog::SearchOnePass, if applicable
28 kEngineBitState, // Prog::SearchBitState
54 TestInstance(const StringPiece& regexp, Prog::MatchKind kind,
63 Prog::Anchor anchor);
69 Prog::Anchor anchor
[all...] |
| dfa_test.cc | 7 #include "re2/prog.h"
23 // Helper thread: builds entire DFA for prog.
26 BuildThread(Prog* prog) : prog_(prog) {}
28 CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch));
32 Prog* prog_;
47 Prog* prog = re->CompileToProg(0); local
48 CHECK(prog);
62 Prog* prog = re->CompileToProg(0); local
105 Prog* prog = re->CompileToProg(limit); local
205 Prog* prog = re->CompileToProg(1<<n); local
275 Prog* prog = re->CompileToProg(1<<n); local
289 Prog* prog = re->CompileToProg(1<<n); local
330 Prog *prog = re->CompileToReverseProg(0); local
[all...] |
| regexp_benchmark.cc | 8 #include "re2/prog.h"
26 Prog* prog = re->CompileToProg(0); local
27 CHECK(prog);
28 CHECK(prog->IsOnePass());
31 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4));
36 delete prog;
53 Prog* prog = re->CompileToProg(0) local
600 Prog* prog = sre->CompileToProg(0); local
612 Prog* prog = re->CompileToProg(0); local
623 Prog* prog = re->CompileToProg(0); local
633 Prog* prog = re->CompileToProg(0); local
806 Prog* prog = re->CompileToProg(0); local
823 Prog* prog = re->CompileToProg(0); local
837 Prog* prog = re->CompileToProg(0); local
852 Prog* prog = re->CompileToProg(0); local
893 Prog* prog = re->CompileToProg(1LL<<31); local
910 Prog* prog = re->CompileToProg(0); local
924 Prog* prog = re->CompileToProg(0); local
938 Prog* prog = re->CompileToProg(0); local
979 Prog* prog = re->CompileToProg(0); local
992 Prog* prog = re->CompileToProg(0); local
1006 Prog* prog = re->CompileToProg(0); local
1019 Prog* prog = re->CompileToProg(0); local
1049 Prog* prog = re->CompileToProg(0); local
1062 Prog* prog = re->CompileToProg(0); local
1075 Prog* prog = re->CompileToProg(0); local
1087 Prog* prog = re->CompileToProg(0); local
1122 Prog* prog = re->CompileToProg(0); local
1135 Prog* prog = re->CompileToProg(0); local
1149 Prog* prog = re->CompileToProg(0); local
1179 Prog* prog = re->CompileToProg(0); local
1192 Prog* prog = re->CompileToProg(0); local
1205 Prog* prog = re->CompileToProg(0); local
1217 Prog* prog = re->CompileToProg(0); local
[all...] |
| tester.cc | 10 #include "re2/prog.h"
109 static string FormatKind(Prog::MatchKind kind) {
111 case Prog::kFullMatch:
113 case Prog::kLongestMatch:
115 case Prog::kFirstMatch:
117 case Prog::kManyMatch:
124 static string FormatAnchor(Prog::Anchor anchor) {
126 case Prog::kAnchored:
128 case Prog::kUnanchored:
161 TestInstance::TestInstance(const StringPiece& regexp_str, Prog::MatchKind kind
[all...] |
| compile_test.cc | 5 // Test prog.cc, compile.cc
11 #include "re2/prog.h"
114 Prog* prog = re->CompileToProg(0); local
115 if (prog == NULL) {
122 string s = prog->Dump();
129 delete prog;
161 Prog* prog = re->CompileToProg(0); local
162 EXPECT_TRUE(prog != NULL)
[all...] |
| backtrack.cc | 7 // Prog::BadSearchBacktrack is a backtracking regular expression search,
27 #include "re2/prog.h"
50 explicit Backtracker(Prog* prog);
63 Prog* prog_; // program being run
78 Backtracker::Backtracker(Prog* prog)
79 : prog_(prog),
165 Prog::Inst* ip = prog_->inst(id);
199 if (ip->empty() & ~Prog::EmptyFlags(context_, p)
[all...] |
| /external/regex-re2/re2/testing/ |
| tester.h | 12 #include "re2/prog.h"
23 kEngineBacktrack = 0, // Prog::BadSearchBacktrack
24 kEngineNFA, // Prog::SearchNFA
25 kEngineDFA, // Prog::SearchDFA, only ask whether it matched
26 kEngineDFA1, // Prog::SearchDFA, ask for match[0]
27 kEngineOnePass, // Prog::SearchOnePass, if applicable
28 kEngineBitState, // Prog::SearchBitState
54 TestInstance(const StringPiece& regexp, Prog::MatchKind kind,
63 Prog::Anchor anchor);
69 Prog::Anchor anchor
[all...] |
| dfa_test.cc | 7 #include "re2/prog.h"
23 // Helper thread: builds entire DFA for prog.
26 BuildThread(Prog* prog) : prog_(prog) {}
28 CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch));
32 Prog* prog_;
47 Prog* prog = re->CompileToProg(0); local
48 CHECK(prog);
62 Prog* prog = re->CompileToProg(0); local
105 Prog* prog = re->CompileToProg(limit); local
205 Prog* prog = re->CompileToProg(1<<n); local
275 Prog* prog = re->CompileToProg(1<<n); local
289 Prog* prog = re->CompileToProg(1<<n); local
330 Prog *prog = re->CompileToReverseProg(0); local
[all...] |
| regexp_benchmark.cc | 8 #include "re2/prog.h"
26 Prog* prog = re->CompileToProg(0); local
27 CHECK(prog);
28 CHECK(prog->IsOnePass());
31 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4));
36 delete prog;
53 Prog* prog = re->CompileToProg(0) local
600 Prog* prog = sre->CompileToProg(0); local
612 Prog* prog = re->CompileToProg(0); local
623 Prog* prog = re->CompileToProg(0); local
633 Prog* prog = re->CompileToProg(0); local
806 Prog* prog = re->CompileToProg(0); local
823 Prog* prog = re->CompileToProg(0); local
837 Prog* prog = re->CompileToProg(0); local
852 Prog* prog = re->CompileToProg(0); local
893 Prog* prog = re->CompileToProg(1LL<<31); local
910 Prog* prog = re->CompileToProg(0); local
924 Prog* prog = re->CompileToProg(0); local
938 Prog* prog = re->CompileToProg(0); local
979 Prog* prog = re->CompileToProg(0); local
992 Prog* prog = re->CompileToProg(0); local
1006 Prog* prog = re->CompileToProg(0); local
1019 Prog* prog = re->CompileToProg(0); local
1049 Prog* prog = re->CompileToProg(0); local
1062 Prog* prog = re->CompileToProg(0); local
1075 Prog* prog = re->CompileToProg(0); local
1087 Prog* prog = re->CompileToProg(0); local
1122 Prog* prog = re->CompileToProg(0); local
1135 Prog* prog = re->CompileToProg(0); local
1149 Prog* prog = re->CompileToProg(0); local
1179 Prog* prog = re->CompileToProg(0); local
1192 Prog* prog = re->CompileToProg(0); local
1205 Prog* prog = re->CompileToProg(0); local
1217 Prog* prog = re->CompileToProg(0); local
[all...] |
| tester.cc | 10 #include "re2/prog.h"
109 static string FormatKind(Prog::MatchKind kind) {
111 case Prog::kFullMatch:
113 case Prog::kLongestMatch:
115 case Prog::kFirstMatch:
117 case Prog::kManyMatch:
124 static string FormatAnchor(Prog::Anchor anchor) {
126 case Prog::kAnchored:
128 case Prog::kUnanchored:
161 TestInstance::TestInstance(const StringPiece& regexp_str, Prog::MatchKind kind
[all...] |
| compile_test.cc | 5 // Test prog.cc, compile.cc
11 #include "re2/prog.h"
114 Prog* prog = re->CompileToProg(0); local
115 if (prog == NULL) {
122 string s = prog->Dump();
129 delete prog;
161 Prog* prog = re->CompileToProg(0); local
162 EXPECT_TRUE(prog != NULL)
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| prog.cc | 10 #include "re2/prog.h"
17 void Prog::Inst::InitAlt(uint32 out, uint32 out1) {
23 void Prog::Inst::InitByteRange(int lo, int hi, int foldcase, uint32 out) {
31 void Prog::Inst::InitCapture(int cap, uint32 out) {
37 void Prog::Inst::InitEmptyWidth(EmptyOp empty, uint32 out) {
43 void Prog::Inst::InitMatch(int32 id) {
49 void Prog::Inst::InitNop(uint32 out) {
54 void Prog::Inst::InitFail() {
59 string Prog::Inst::Dump() {
93 Prog::Prog(
[all...] |
| compile.cc | 5 // Compile regular expression to Prog.
7 // Prog and Inst are defined in prog.h.
11 #include "re2/prog.h"
38 static void Patch(Prog::Inst *inst0, PatchList l, uint32 v);
41 static PatchList Deref(Prog::Inst *inst0, PatchList l);
44 static PatchList Append(Prog::Inst *inst0, PatchList l1, PatchList l2);
57 PatchList PatchList::Deref(Prog::Inst* inst0, PatchList l) {
58 Prog::Inst* ip = &inst0[l.p>>1];
67 void PatchList::Patch(Prog::Inst *inst0, PatchList l, uint32 val)
1117 Prog* prog = c.Finish(); local
[all...] |
| set.h | 46 re2::Prog* prog_;
|
| prog.h | 78 class Prog {
80 Prog();
81 ~Prog();
98 int id(Prog* p) { return this - p->inst_; }
108 bool greedy(Prog *p) {
168 friend class Prog;
223 // Record that at some point in the prog, the bytes in the range
247 // Execution engines. They all search for the regexp (run the prog)
332 // Compiles a collection of regexps to Prog. Each regexp will have
334 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor
[all...] |
| set.cc | 9 #include "re2/prog.h"
90 prog_ = Prog::CompileSet(options_, anchor_, re);
101 bool ret = prog_->SearchDFA(text, text, Prog::kAnchored,
102 Prog::kManyMatch, NULL, &failed, v);
|
| bitstate.cc | 7 // Prog::SearchBitState is a regular expression search with submatch
10 // text) * (length of prog) bits, to make sure it never explores the
20 #include "re2/prog.h"
33 explicit BitState(Prog* prog);
49 Prog* prog_; // program being run
71 BitState::BitState(Prog* prog)
72 : prog_(prog),
170 Prog::Inst* ip = prog_->inst(id)
[all...] |
| /external/regex-re2/re2/ |
| prog.cc | 10 #include "re2/prog.h"
17 void Prog::Inst::InitAlt(uint32 out, uint32 out1) {
23 void Prog::Inst::InitByteRange(int lo, int hi, int foldcase, uint32 out) {
31 void Prog::Inst::InitCapture(int cap, uint32 out) {
37 void Prog::Inst::InitEmptyWidth(EmptyOp empty, uint32 out) {
43 void Prog::Inst::InitMatch(int32 id) {
49 void Prog::Inst::InitNop(uint32 out) {
54 void Prog::Inst::InitFail() {
59 string Prog::Inst::Dump() {
93 Prog::Prog(
[all...] |
| compile.cc | 5 // Compile regular expression to Prog.
7 // Prog and Inst are defined in prog.h.
11 #include "re2/prog.h"
38 static void Patch(Prog::Inst *inst0, PatchList l, uint32 v);
41 static PatchList Deref(Prog::Inst *inst0, PatchList l);
44 static PatchList Append(Prog::Inst *inst0, PatchList l1, PatchList l2);
57 PatchList PatchList::Deref(Prog::Inst* inst0, PatchList l) {
58 Prog::Inst* ip = &inst0[l.p>>1];
67 void PatchList::Patch(Prog::Inst *inst0, PatchList l, uint32 val)
1116 Prog* prog = c.Finish(); local
[all...] |
| set.h | 46 re2::Prog* prog_;
|
| prog.h | 78 class Prog {
80 Prog();
81 ~Prog();
98 int id(Prog* p) { return this - p->inst_; }
108 bool greedy(Prog *p) {
168 friend class Prog;
223 // Record that at some point in the prog, the bytes in the range
247 // Execution engines. They all search for the regexp (run the prog)
332 // Compiles a collection of regexps to Prog. Each regexp will have
334 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor
[all...] |
| set.cc | 9 #include "re2/prog.h"
90 prog_ = Prog::CompileSet(options_, anchor_, re);
101 bool ret = prog_->SearchDFA(text, text, Prog::kAnchored,
102 Prog::kManyMatch, NULL, &failed, v);
|
| bitstate.cc | 7 // Prog::SearchBitState is a regular expression search with submatch
10 // text) * (length of prog) bits, to make sure it never explores the
20 #include "re2/prog.h"
33 explicit BitState(Prog* prog);
49 Prog* prog_; // program being run
71 BitState::BitState(Prog* prog)
72 : prog_(prog),
170 Prog::Inst* ip = prog_->inst(id)
[all...] |
| /external/libunwind/doc/ |
| libunwind-ptrace.tex | 44 possible to hook up \Prog{libunwind} to another process via
46 \Prog{libunwind} further facilitates this task by providing
52 to create a new \Prog{libunwind} address-space that represents the
57 \Prog{libunwind} will be able to properly unwind the target process.
59 only portions of the \Prog{\_UPT}-facility. For this reason, the
73 target process is known, a \Prog{\_UPT}-info-structure can be created
83 When the application is done using \Prog{libunwind} on the target
92 \Prog{\_UPT}-facility by definition is not available in
93 \Prog{libunwind}-versions configured for cross-unwinding.
97 The \Prog{\_UPT}-facility assumes that a single \Prog{\_UPT}-inf
[all...] |
| unw_backtrace.tex | 30 \Func{backtrace}() is not provided by \Prog{libunwind}. \Prog{libunwind} weakly
32 calling \Func{backtrace}() is linked against \Prog{libunwind}, it may end up
|
