/external/regex-re2/re2/testing/ |
H A D | tester.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, 73 const StringPiece& context, Prog [all...] |
H A D | dfa_test.cc | 26 BuildThread(Prog* prog) : prog_(prog) {} 28 CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch)); 32 Prog* prog_; 47 Prog* prog = re->CompileToProg(0); 62 Prog* prog = re->CompileToProg(0); 79 prog->BuildEntireDFA(Prog::kFirstMatch); 105 Prog* prog = re->CompileToProg(limit); 109 prog->BuildEntireDFA(Prog::kFirstMatch); 110 prog->BuildEntireDFA(Prog::kLongestMatch); 205 Prog* pro [all...] |
H A D | regexp_benchmark.cc | 26 Prog* prog = re->CompileToProg(0); 31 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); 53 Prog* prog = re->CompileToProg(0); 56 fprintf(stderr, "Prog: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 60 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); 94 fprintf(stderr, "sizeof: PCRE=%d RE2=%d Prog=%d Inst=%d\n", 97 static_cast<int>(sizeof(Prog)), 98 static_cast<int>(sizeof(Prog [all...] |
H A D | tester.cc | 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, 194 LOG(INFO) << "Prog fo [all...] |
H A D | compile_test.cc | 114 Prog* prog = re->CompileToProg(0); 161 Prog* prog = re->CompileToProg(0);
|
H A D | backtrack.cc | 7 // Prog::BadSearchBacktrack is a backtracking regular expression search, 50 explicit Backtracker(Prog* prog); 63 Prog* prog_; // program being run 78 Backtracker::Backtracker(Prog* prog) 165 Prog::Inst* ip = prog_->inst(id); 199 if (ip->empty() & ~Prog::EmptyFlags(context_, p)) 225 bool Prog::UnsafeSearchBacktrack(const StringPiece& text,
|
/external/regex-re2/re2/ |
H A D | prog.cc | 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() function in class:re2::Prog [all...] |
H A D | compile.cc | 5 // Compile regular expression to Prog. 7 // Prog and Inst are defined in 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) { 69 Prog::Inst* ip = &inst0[l.p>>1]; 81 PatchList PatchList::Append(Prog [all...] |
H A D | set.h | 46 re2::Prog* prog_;
|
H A D | prog.h | 78 class Prog { class in namespace:re2 80 Prog(); 81 ~Prog(); 98 int id(Prog* p) { return this - p->inst_; } 108 bool greedy(Prog *p) { 168 friend class Prog; 332 // Compiles a collection of regexps to Prog. Each regexp will have 334 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor, 371 DISALLOW_EVIL_CONSTRUCTORS(Prog);
|
H A D | set.cc | 90 prog_ = Prog::CompileSet(options_, anchor_, re); 101 bool ret = prog_->SearchDFA(text, text, Prog::kAnchored, 102 Prog::kManyMatch, NULL, &failed, v);
|
H A D | bitstate.cc | 7 // Prog::SearchBitState is a regular expression search with submatch 33 explicit BitState(Prog* prog); 49 Prog* prog_; // program being run 71 BitState::BitState(Prog* prog) 170 Prog::Inst* ip = prog_->inst(id); 246 if (ip->empty() & ~Prog::EmptyFlags(context_, p)) 349 bool Prog::SearchBitState(const StringPiece& text,
|
H A D | dfa.cc | 57 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem); 60 Prog::MatchKind kind() { return 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) 447 if (kind_ == Prog::kLongestMatch) { 621 if (sawmatch && (kind_ == Prog [all...] |
H A D | nfa.cc | 7 // Prog::SearchNFA, an NFA search. 36 NFA(Prog* prog); 109 Prog* prog_; // underlying program 128 NFA::NFA(Prog* prog) { 223 Prog::Inst* ip = prog_->inst(id); 309 Prog::Inst* ip = prog_->inst(id); 471 wasword = Prog::IsWordChar(c); 494 isword = Prog::IsWordChar(p[0] & 0xFF); 525 Prog::Inst* ip = prog_->inst(id); 577 isword = Prog [all...] |
H A D | re2.cc | 212 // Two thirds of the memory goes to the forward Prog, 214 // Prog has two DFAs but the reverse prog has one. 233 re2::Prog* RE2::ReverseProg() const { 592 Prog::Anchor anchor = Prog::kUnanchored; 593 Prog::MatchKind kind = Prog::kFirstMatch; 595 kind = Prog::kLongestMatch; 598 bool can_one_pass = (is_one_pass_ && ncap <= Prog::kMaxOnePassCapture); 640 Prog* pro [all...] |
H A D | onepass.cc | 7 // Prog::SearchOnePass is an efficient implementation of 178 COMPILE_ASSERT(kMaxCap == Prog::kMaxOnePassCapture*2, 183 uint32 satisfied = Prog::EmptyFlags(context, p); 207 bool Prog::SearchOnePass(const StringPiece& text, 378 bool Prog::IsOnePass() { 430 Prog::Inst* ip = inst(id);
|
/external/ltp/testcases/kernel/fs/doio/ |
H A D | rwtest | 39 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/libunwind/doc/ |
H A D | 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{\_UP [all...] |
H A D | 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
|
H A D | libunwind.tex | 66 \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{libunwin [all...] |
H A D | unw_create_addr_space.tex | 33 \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{libunwin [all...] |
H A D | libunwind-setjmp.tex | 25 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
|
H A D | unw_get_proc_info_by_ip.tex | 42 Note that for the purposes of \Prog{libunwind}, the code of a 47 discontiguous pieces, \Prog{libunwind} will treat each piece as a 66 \item[\Const{UNW\_ENOINFO}] \Prog{Libunwind} was unable to locate 69 version or format that is not understood by \Prog{libunwind}.
|
H A D | unw_step.tex | 38 \item[\Const{UNW\_ENOINFO}] \Prog{Libunwind} was unable to locate the 42 \Prog{libunwind}.
|
/external/llvm/tools/bugpoint/ |
H A D | OptimizerDriver.cpp | 179 std::string Prog; local 182 Prog = *Path; 186 Prog = tool; 187 if (Prog.empty()) { 236 int result = sys::ExecuteAndWait(Prog, Args.data(), nullptr,
|