HomeSort by relevance Sort by last modified time
    Searched defs:Prog (Results 1 - 4 of 4) sorted by null

  /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...]
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...]
  /external/llvm/tools/bugpoint/
OptimizerDriver.cpp 179 std::string Prog;
182 Prog = *Path;
186 Prog = tool;
187 if (Prog.empty()) {
236 int result = sys::ExecuteAndWait(Prog, Args.data(), nullptr,
Miscompilation.cpp 634 Module *Prog = BD.getProgram();
635 for (Module::iterator I = Prog->begin(), E = Prog->end(); I != E; ++I)
    [all...]

Completed in 312 milliseconds