Home
last modified time | relevance | path

Searched refs:Prog (Results 1 – 25 of 47) sorted by relevance

12

/external/regex-re2/re2/testing/
Ddfa_test.cc26 BuildThread(Prog* prog) : prog_(prog) {} in BuildThread()
28 CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch)); in Run()
32 Prog* prog_;
47 Prog* prog = re->CompileToProg(0); in TEST()
62 Prog* prog = re->CompileToProg(0); in TEST()
79 prog->BuildEntireDFA(Prog::kFirstMatch); in TEST()
105 Prog* prog = re->CompileToProg(limit); in TEST()
109 prog->BuildEntireDFA(Prog::kFirstMatch); in TEST()
110 prog->BuildEntireDFA(Prog::kLongestMatch); in TEST()
205 Prog* prog = re->CompileToProg(1<<n); in TEST()
[all …]
Dregexp_benchmark.cc26 Prog* prog = re->CompileToProg(0); in Test()
31 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); in Test()
53 Prog* prog = re->CompileToProg(0); in MemoryUsage()
60 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); in MemoryUsage()
97 static_cast<int>(sizeof(Prog)), in MemoryUsage()
98 static_cast<int>(sizeof(Prog::Inst))); in MemoryUsage()
106 Prog::Anchor anchor, bool expect_match);
156 search(iters, regexp, s, Prog::kUnanchored, false); in Search()
249 search(iters, regexp.c_str(), s, Prog::kUnanchored, true); in SearchBigFixed()
290 search(iters, regexp, s, Prog::kAnchored, true); in SearchSuccess()
[all …]
Dtester.cc109 static string FormatKind(Prog::MatchKind kind) { in FormatKind()
111 case Prog::kFullMatch: in FormatKind()
113 case Prog::kLongestMatch: in FormatKind()
115 case Prog::kFirstMatch: in FormatKind()
117 case Prog::kManyMatch: in FormatKind()
124 static string FormatAnchor(Prog::Anchor anchor) { in FormatAnchor()
126 case Prog::kAnchored: in FormatAnchor()
128 case Prog::kUnanchored: in FormatAnchor()
161 TestInstance::TestInstance(const StringPiece& regexp_str, Prog::MatchKind kind, in TestInstance()
231 if (kind_ == Prog::kLongestMatch) in TestInstance()
[all …]
Dtester.h54 TestInstance(const StringPiece& regexp, Prog::MatchKind kind,
63 Prog::Anchor anchor);
69 Prog::Anchor anchor,
73 const StringPiece& context, Prog::Anchor anchor);
76 Prog::MatchKind kind_; // kind of match
82 Prog* prog_; // compiled program
83 Prog* rprog_; // compiled reverse program
101 Prog::Anchor anchor);
Dbacktrack.cc50 explicit Backtracker(Prog* prog);
63 Prog* prog_; // program being run
78 Backtracker::Backtracker(Prog* prog) in Backtracker()
165 Prog::Inst* ip = prog_->inst(id); in Visit()
199 if (ip->empty() & ~Prog::EmptyFlags(context_, p)) in Visit()
225 bool Prog::UnsafeSearchBacktrack(const StringPiece& text, in UnsafeSearchBacktrack()
Dcompile_test.cc114 Prog* prog = re->CompileToProg(0); in TEST()
161 Prog* prog = re->CompileToProg(0); in TEST()
/external/regex-re2/re2/
Dprog.cc17 void Prog::Inst::InitAlt(uint32 out, uint32 out1) { in InitAlt()
23 void Prog::Inst::InitByteRange(int lo, int hi, int foldcase, uint32 out) { in InitByteRange()
31 void Prog::Inst::InitCapture(int cap, uint32 out) { in InitCapture()
37 void Prog::Inst::InitEmptyWidth(EmptyOp empty, uint32 out) { in InitEmptyWidth()
43 void Prog::Inst::InitMatch(int32 id) { in InitMatch()
49 void Prog::Inst::InitNop(uint32 out) { in InitNop()
54 void Prog::Inst::InitFail() { in InitFail()
59 string Prog::Inst::Dump() { in Dump()
93 Prog::Prog() in Prog() function in re2::Prog
115 Prog::~Prog() { in ~Prog()
[all …]
Dcompile.cc38 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) { in Deref()
58 Prog::Inst* ip = &inst0[l.p>>1]; in Deref()
67 void PatchList::Patch(Prog::Inst *inst0, PatchList l, uint32 val) { in Patch()
69 Prog::Inst* ip = &inst0[l.p>>1]; in Patch()
81 PatchList PatchList::Append(Prog::Inst* inst0, PatchList l1, PatchList l2) { in Append()
95 Prog::Inst* ip = &inst0[l.p>>1]; in Append()
131 static Prog *Compile(Regexp* re, bool reversed, int64 max_mem);
[all …]
Ddfa.cc57 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem);
60 Prog::MatchKind kind() { return kind_; } in kind()
232 Prog::MatchKind kind,
341 Prog* prog_; // The regular expression program to run.
342 Prog::MatchKind kind_; // The kind of DFA.
434 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) in DFA()
447 if (kind_ == Prog::kLongestMatch) { in DFA()
621 if (sawmatch && (kind_ == Prog::kFirstMatch || q->is_mark(id))) in WorkqToCachedState()
630 Prog::Inst* ip = prog_->inst(id); in WorkqToCachedState()
637 if (kind_ != Prog::kManyMatch && in WorkqToCachedState()
[all …]
Dprog.h78 class Prog {
80 Prog();
81 ~Prog();
98 int id(Prog* p) { return this - p->inst_; } in id()
108 bool greedy(Prog *p) { in greedy()
168 friend class Prog; variable
334 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor,
371 DISALLOW_EVIL_CONSTRUCTORS(Prog);
Dnfa.cc36 NFA(Prog* prog);
109 Prog* prog_; // underlying program
128 NFA::NFA(Prog* prog) { in NFA()
223 Prog::Inst* ip = prog_->inst(id); in AddToThreadq()
309 Prog::Inst* ip = prog_->inst(id); in Step()
471 wasword = Prog::IsWordChar(c); in Search()
494 isword = Prog::IsWordChar(p[0] & 0xFF); in Search()
525 Prog::Inst* ip = prog_->inst(id); in Search()
577 isword = Prog::IsWordChar(p[0] & 0xFF); in Search()
579 flag = Prog::EmptyFlags(context, p); in Search()
[all …]
Dbitstate.cc33 explicit BitState(Prog* prog);
49 Prog* prog_; // program being run
71 BitState::BitState(Prog* prog) in BitState()
170 Prog::Inst* ip = prog_->inst(id); in TrySearch()
246 if (ip->empty() & ~Prog::EmptyFlags(context_, p)) in TrySearch()
349 bool Prog::SearchBitState(const StringPiece& text, in SearchBitState()
Dre2.cc233 re2::Prog* RE2::ReverseProg() const { in ReverseProg()
592 Prog::Anchor anchor = Prog::kUnanchored; in Match()
593 Prog::MatchKind kind = Prog::kFirstMatch; in Match()
595 kind = Prog::kLongestMatch; in Match()
598 bool can_one_pass = (is_one_pass_ && ncap <= Prog::kMaxOnePassCapture); in Match()
640 Prog* prog = ReverseProg(); in Match()
643 if (!prog->SearchDFA(match, text, Prog::kAnchored, in Match()
644 Prog::kLongestMatch, &match, &dfa_failed, NULL)) { in Match()
672 kind = Prog::kFullMatch; in Match()
673 anchor = Prog::kAnchored; in Match()
[all …]
Dset.cc90 prog_ = Prog::CompileSet(options_, anchor_, re); in Compile()
101 bool ret = prog_->SearchDFA(text, text, Prog::kAnchored, in Match()
102 Prog::kManyMatch, NULL, &failed, v); in Match()
/external/libunwind/doc/
Dlibunwind.trans7 $manMacro1a{'Func'} = $manMacro1a{Prog};
8 $manMacro1b{'Func'} = $manMacro1b{Prog};
11 $texiMacro1a{'Func'} = $texiMacro1a{Prog};
12 $texiMacro1b{'Func'} = $texiMacro1b{Prog};
13 $manMacro1a{'Var'} = $manMacro1a{Prog};
14 $manMacro1b{'Var'} = $manMacro1b{Prog};
15 $htmlMacro1a{'Var'} = $htmlMacro1a{Prog};
16 $htmlMacro1b{'Var'} = $htmlMacro1b{Prog};
17 $texiMacro1a{'Var'} = $texiMacro1a{Prog};
18 $texiMacro1b{'Var'} = $texiMacro1b{Prog};
Dlibunwind-ptrace.tex44 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}-info
[all …]
Dlibunwind.tex66 \Prog{Libunwind} is very easy to use when unwinding a stack from
99 identified by the cursor). \Prog{Libunwind} provides several routines
109 frame and, in those cases, \Prog{libunwind} will grant access to them
114 pointer (SP). In \Prog{libunwind}, these registers are identified by
119 registers, \Prog{libunwind} also provides the ability to resume
127 Normally, \Prog{libunwind} supports both local and remote unwinding
140 portion of \Prog{libunwind} that manages unwind-info for dynamically
145 \Prog{libunwind} to write a function ``\Func{show\_backtrace}()''
169 \Prog{Libunwind} can also be used to unwind a stack in a ``remote''
172 one that is running \Prog{libunwind}. Remote unwinding is typically
[all …]
Dunw_create_addr_space.tex33 \Prog{Libunwind} uses a set of call-back routines to access the
44 call-back routine, \Prog{libunwind} sets the \Var{as} argument to the
79 \Prog{Libunwind} invokes the \Func{find\_proc\_info}() call-back to
103 \Prog{Libunwind} invokes the \Func{put\_unwind\_info}() call-back to
108 \Func{find\_proc\_info}(). Note that \Prog{libunwind} does \emph{not}
115 \Prog{Libunwind} invokes the \Func{get\_dyn\_info\_list\_addr}()
123 \Var{dliap} must be cleared to zero. \Prog{Libunwind} will cache the
134 \Prog{Libunwind} invokes the \Func{access\_mem}() call-back to read
137 To read memory, \Prog{libunwind} sets argument \Var{write} to zero and
139 write memory, \Prog{libunwind} sets argument \Var{write} to a non-zero
[all …]
Dcommon.tex.in8 \newcommand{\Func}[1]{\Prog{#1}} % see libunwind.trans
9 \newcommand{\Var}[1]{\Prog{#1}} % see libunwind.trans
Dunw_backtrace.tex30 \Func{backtrace}() is not provided by \Prog{libunwind}. \Prog{libunwind} weakly
32 calling \Func{backtrace}() is linked against \Prog{libunwind}, it may end up
Dlibunwind-setjmp.tex25 The \Prog{unwind-setjmp} library offers a \Prog{libunwind}-based
28 the same name. The main advantage of using the \Prog{unwind-setjmp}
39 \Prog{unwind-setjmp} library is beneficial primarily in applications
/external/ltp/testcases/network/nfs/nfslock01/
Dnfs_flock_frk.c16 char *Prog; in main() local
23 Prog = strrchr(argv[1], '/'); in main()
24 Prog++; in main()
30 execl(argv[1], Prog, "0", argv[2], NULL); in main()
32 execl(argv[1], Prog, "1", argv[2], NULL); in main()
/external/ltp/testcases/kernel/fs/doio/
Drwtest39 Prog=${0##*/}
55 echo "$Prog: [-chq] [-N name] [ iogen options ] [ doio options ] files" >&2
208 echo "$Prog: Illegal option $1" >&2
408 echo "$Prog$Name : iogen reported errors (r=$r)" >&2
416 echo "$Prog$Name : doio reported errors (r=$r)" >&2
/external/llvm/tools/bugpoint/
DOptimizerDriver.cpp179 std::string Prog; in runPasses() local
182 Prog = *Path; in runPasses()
186 Prog = tool; in runPasses()
187 if (Prog.empty()) { in runPasses()
236 int result = sys::ExecuteAndWait(Prog, Args.data(), nullptr, in runPasses()
/external/clang/tools/scan-build/bin/
Dscan-build29 my $Prog = "scan-build";
83 print BOLD, MAGENTA "$Prog: @_";
87 print "$Prog: @_";
93 print STDERR BOLD, RED "$Prog: ";
97 print STDERR "$Prog: @_";
111 print STDERR BOLD, RED "$Prog: ";
116 print STDERR "$Prog: ", @_;
190 next if (!($f =~ /^$Prog-(.+)/));
230 $NewDir = "$Dir/$Prog-$DateString-$RunNumber";
1107 USAGE: $Prog [options] <build command> [build options]

12