/external/regex-re2/re2/ |
bitstate.cc | 31 class BitState { 33 explicit BitState(Prog* prog); 34 ~BitState(); 37 // Can only call Search once per BitState. 71 BitState::BitState(Prog* prog) 87 BitState::~BitState() { 96 bool BitState::ShouldVisit(int id, const char* p) { 105 bool BitState::GrowStack() [all...] |
re2.cc | 676 // information anyway and we're going to use OnePass or BitState 678 // OnePass or BitState will be fast enough. 695 << " skipping DFA for BitState."; 751 << " using BitState."; [all...] |
/prebuilts/go/darwin-x86/src/regexp/ |
backtrack.go | 33 // bitState holds state for the backtracker. 34 type bitState struct { 44 var notBacktrack *bitState = nil 55 // newBitState returns a new bitState for the given prog, 58 func newBitState(prog *syntax.Prog) *bitState { 62 return &bitState{ 76 func (b *bitState) reset(end int, ncap int) { 107 func (b *bitState) shouldVisit(pc uint32, pos int) bool { 118 func (b *bitState) push(pc uint32, pos int, arg int) { 133 func (m *machine) tryBacktrack(b *bitState, i input, pc uint32, pos int) bool [all...] |
exec.go | 41 maxBitStateLen int // max length of string to search with bitstate 42 b *bitState // state for backtracker, allocated lazily
|
/prebuilts/go/linux-x86/src/regexp/ |
backtrack.go | 33 // bitState holds state for the backtracker. 34 type bitState struct { 44 var notBacktrack *bitState = nil 55 // newBitState returns a new bitState for the given prog, 58 func newBitState(prog *syntax.Prog) *bitState { 62 return &bitState{ 76 func (b *bitState) reset(end int, ncap int) { 107 func (b *bitState) shouldVisit(pc uint32, pos int) bool { 118 func (b *bitState) push(pc uint32, pos int, arg int) { 133 func (m *machine) tryBacktrack(b *bitState, i input, pc uint32, pos int) bool [all...] |
exec.go | 41 maxBitStateLen int // max length of string to search with bitstate 42 b *bitState // state for backtracker, allocated lazily
|
/external/libjpeg-turbo/ |
jdphuff.c | 64 bitread_perm_state bitstate; /* Bit buffer at start of MCU */ member in struct:__anon15849 187 entropy->bitstate.bits_left = 0; 188 entropy->bitstate.get_buffer = 0; /* unnecessary, but keeps Purify quiet */ 240 cinfo->marker->discarded_bytes += entropy->bitstate.bits_left / 8; 241 entropy->bitstate.bits_left = 0; 316 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); 345 BITREAD_SAVE_STATE(cinfo,entropy->bitstate); 395 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); 426 BITREAD_SAVE_STATE(cinfo,entropy->bitstate); 467 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); [all...] |
jdhuff.c | 62 bitread_perm_state bitstate; /* Bit buffer at start of MCU */ member in struct:__anon15838 137 entropy->bitstate.bits_left = 0; 138 entropy->bitstate.get_buffer = 0; /* unnecessary, but keeps Purify quiet */ 527 cinfo->marker->discarded_bytes += entropy->bitstate.bits_left / 8; 528 entropy->bitstate.bits_left = 0; 563 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); 644 BITREAD_SAVE_STATE(cinfo,entropy->bitstate); 661 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); 731 BITREAD_SAVE_STATE(cinfo,entropy->bitstate);
|
/external/pdfium/third_party/libjpeg/ |
fpdfapi_jdphuff.c | 62 bitread_perm_state bitstate; /* Bit buffer at start of MCU */ member in struct:__anon22223 184 entropy->bitstate.bits_left = 0; 185 entropy->bitstate.get_buffer = 0; /* unnecessary, but keeps Purify quiet */ 235 cinfo->marker->discarded_bytes += entropy->bitstate.bits_left / 8; 236 entropy->bitstate.bits_left = 0; 311 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); 340 BITREAD_SAVE_STATE(cinfo,entropy->bitstate); 390 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); 421 BITREAD_SAVE_STATE(cinfo,entropy->bitstate); 462 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); [all...] |
fpdfapi_jdhuff.c | 61 bitread_perm_state bitstate; /* Bit buffer at start of MCU */ member in struct:__anon22215 135 entropy->bitstate.bits_left = 0; 136 entropy->bitstate.get_buffer = 0; /* unnecessary, but keeps Purify quiet */ 478 cinfo->marker->discarded_bytes += entropy->bitstate.bits_left / 8; 479 entropy->bitstate.bits_left = 0; 540 BITREAD_LOAD_STATE(cinfo,entropy->bitstate); 622 BITREAD_SAVE_STATE(cinfo,entropy->bitstate);
|
/external/regex-re2/ |
Android.mk | 18 re2/bitstate.cc \
|
ucs2.diff | 22 ==== re2/bitstate.cc#2 - re2/bitstate.cc#3 ==== 23 re2/bitstate.cc#2:314,321 - re2/bitstate.cc#3:314,319
|
Makefile | 93 obj/re2/bitstate.o\
|
/prebuilts/go/darwin-x86/pkg/darwin_amd64/ |
regexp.a | 39 type @"".bitState struct { @"".prog *@"regexp/syntax".Prog; @"".end int; @"".cap []int; @"".input @"".input; @"".jobs []@"".job; @"".visited []uint32 } 40 func (@"".b·1 *@"".bitState "esc:0x9") @"".push (@"".pc·2 uint32, @"".pos·3 int, @"".arg·4 int) 41 func (@"".b·1 *@"".bitState "esc:0x1") @"".reset (@"".end·2 int, @"".ncap·3 int) 42 func (@"".b·2 *@"".bitState "esc:0x1") @"".shouldVisit (@"".pc·3 uint32, @"".pos·4 int) (? bool) { var @"".n·5 uint; @"".n·5 = uint(int(@"".pc·3) * (@"".b·2.@"".end + 0x1) + @"".pos·4); if @"".b·2.@"".visited[@"".n·5 / 0x20] & (0x1 << (@"".n·5 & 0x1f)) != 0x0 { return false }; @"".b·2.@"".visited[@"".n·5 / 0x20] |= 0x1 << (@"".n·5 & 0x1f); return true } 65 type @"".machine struct { @"".re *@"".Regexp; @"".p *@"regexp/syntax".Prog; @"".op *@"".onePassProg; @"".maxBitStateLen int; @"".b *@"".bitState; @"".q0 @"".queue; @"".q1 @"".queue; @"".pool []*@"".thread; @"".matched bool; @"".matchcap []int; @"".inputBytes @"".inputBytes; @"".inputString @"".inputString; @"".inputReader @"".inputReader } 78 func (@"".m·2 *@"".machine "esc:0x1") @"".tryBacktrack (@"".b·3 *@"".bitState "esc:0x9", @"".i·4 @"".input, @"".pc·5 uint32, @"".pos·6 int) (? bool) 150 b "".notBacktrack ? type."".bitState |