/external/zlib/src/contrib/masmx86/ |
match686.asm | 106 MAX_MATCH equ 258
108 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
112 MAX_MATCH equ 258
114 MIN_LOOKAHEAD equ (MAX_MATCH + MIN_MATCH + 1)
115 MAX_MATCH_8_ equ ((MAX_MATCH + 7) AND 0FFF0h)
388 ;;; Calculate the length of the match. If it is longer than MAX_MATCH,
394 cmp eax, MAX_MATCH
432 mov dword ptr [bestlen], MAX_MATCH
|
/external/zlib/src/contrib/amd64/ |
amd64-match.S | 39 #define MAX_MATCH (258) 41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1) 42 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7) 389 /* Calculate the length of the match. If it is longer than MAX_MATCH, */ 394 cmpl $MAX_MATCH, %eax 429 movl $MAX_MATCH, %bestlend
|
/external/zlib/src/contrib/asm686/ |
match.S | 28 #define MAX_MATCH (258) 30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1) 31 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7) 285 /* Calculate the length of the match. If it is longer than MAX_MATCH, */ 291 cmpl $MAX_MATCH, %eax 329 movl $MAX_MATCH, bestlen(%esp)
|
/external/elfutils/libdw/ |
dwarf_getsrc_file.c | 71 size_t max_match = *nsrcs ?: ~0u; local 151 if (cur_match < max_match) 175 if (cur_match == max_match)
|
/external/oprofile/libregex/ |
op_regex.cpp | 192 regmatch_t match[max_match]; 194 op_regexec(regexp.regexp, str, match, max_match) && iter < limit; 210 if (sub_expr >= max_match)
|
op_regex.h | 111 static const size_t max_match = 16; member in class:regular_expression_replace
|
stl.pat.in | 13 # limited, see static const size_t max_match; in op_regex.h. Note than mangled
|
/external/zlib/src/contrib/gcc_gvmat64/ |
gvmat64.S | 93 #define MAX_MATCH 258
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
488 //;;; Calculate the length of the match. If it is longer than MAX_MATCH,
493 cmp eax, MAX_MATCH
538 mov r11d,MAX_MATCH
|
/external/zlib/src/contrib/masmx64/ |
gvmat64.asm | 120 MAX_MATCH equ 258
122 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
471 ;;; Calculate the length of the match. If it is longer than MAX_MATCH,
476 cmp eax, MAX_MATCH
513 mov r11d,MAX_MATCH
|
/external/v8/src/ |
ast.h | 2233 virtual int max_match() { return max_match_; } function in class:v8::internal::RegExpDisjunction 2254 virtual int max_match() { return max_match_; } function in class:v8::internal::RegExpAlternative 2282 virtual int max_match() { return 0; } function in class:v8::internal::RegExpAssertion 2327 virtual int max_match() { return 1; } function in class:v8::internal::RegExpCharacterClass 2364 virtual int max_match() { return data_.length(); } function in class:v8::internal::RegExpAtom 2383 virtual int max_match() { return length_; } function in class:v8::internal::RegExpText 2425 virtual int max_match() { return max_match_; } function in class:v8::internal::RegExpQuantifier 2460 virtual int max_match() { return body_->max_match(); } function in class:v8::internal::RegExpCapture 2491 virtual int max_match() { return 0; } function in class:v8::internal::RegExpLookahead 2515 virtual int max_match() { return capture_->max_match(); } function in class:v8::internal::RegExpBackReference 2532 virtual int max_match() { return 0; } function in class:v8::internal::RegExpEmpty [all...] |
ast.cc | 728 if (node->max_match() > 0) { return false; } 739 if (node->max_match() > 0) { return false; } 956 max_match_ = first_alternative->max_match(); 960 max_match_ = Max(max_match_, alternative->max_match()); 973 int node_max_match = node->max_match(); 977 max_match_ += node->max_match(); [all...] |
jsregexp.cc | [all...] |
parser.cc | 230 if (atom->max_match() == 0) { [all...] |
/external/elfutils/libdwfl/ |
dwfl_module_getsrc_file.c | 70 size_t max_match = *nsrcs ?: ~0u; local 152 if (cur_match < max_match)
|
/external/zlib/src/ |
deflate.c | [all...] |
deflate.h | 120 * wSize-MAX_MATCH bytes, but this ensures that IO is always 281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 291 #define WIN_INIT MAX_MATCH
|
zutil.h | 76 #define MAX_MATCH 258
|
trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
trees.c | 104 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 356 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
deflate.c | 113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) [all...] |
zutil.h | 82 #define MAX_MATCH 258
|
deflate.h | 117 * wSize-MAX_MATCH bytes, but this ensures that IO is always 271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
|
trees.h | 102 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
trees.c | 108 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 357 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 358 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 360 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); [all...] |
/external/v8/test/cctest/ |
test-regexp.cc | 110 int max_match; member in struct:MinMaxPair 124 int max_match = result.tree->max_match(); local 125 MinMaxPair pair = { min_match, max_match }; 136 CHECK_EQ(max, min_max.max_match); \ [all...] |