/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/lib/zlib/contrib/masmx86/ |
H A D | gvmat32c.c | 28 IPos cur_match); /* current match */
33 IPos cur_match); /* current match */
37 IPos cur_match); /* current match */
49 IPos cur_match) /* current match */
52 return longest_match_686(s,cur_match);
55 return longest_match_686(s,cur_match);
58 return longest_match_7fff(s,cur_match);
47 longest_match( deflate_state *s, IPos cur_match) argument
|
H A D | gvmat32.asm | 51 ;uInt longest_match_7fff(s, cur_match)
53 ; IPos cur_match; /* current match */
56 cur_match equ dword ptr[esp+NbStack-0]
define 219 mov eax,cur_match
234 ; eax = ax = cur_match
250 ; cur_match = prev[cur_match & wmask]
253 ; if cur_match > limit, go to exitloop
262 ; if (scan_start==*(cur_match+window)) goto normalbeg2
270 ; cur_match [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/lib/zlib/contrib/masmx86/ |
H A D | gvmat32c.c | 28 IPos cur_match); /* current match */
33 IPos cur_match); /* current match */
37 IPos cur_match); /* current match */
49 IPos cur_match) /* current match */
52 return longest_match_686(s,cur_match);
55 return longest_match_686(s,cur_match);
58 return longest_match_7fff(s,cur_match);
47 longest_match( deflate_state *s, IPos cur_match) argument
|
H A D | gvmat32.asm | 51 ;uInt longest_match_7fff(s, cur_match)
53 ; IPos cur_match; /* current match */
56 cur_match equ dword ptr[esp+NbStack-0]
define 219 mov eax,cur_match
234 ; eax = ax = cur_match
250 ; cur_match = prev[cur_match & wmask]
253 ; if cur_match > limit, go to exitloop
262 ; if (scan_start==*(cur_match+window)) goto normalbeg2
270 ; cur_match [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/lib/zlib/contrib/masmx86/ |
H A D | gvmat32c.c | 28 IPos cur_match); /* current match */
33 IPos cur_match); /* current match */
37 IPos cur_match); /* current match */
49 IPos cur_match) /* current match */
52 return longest_match_686(s,cur_match);
55 return longest_match_686(s,cur_match);
58 return longest_match_7fff(s,cur_match);
47 longest_match( deflate_state *s, IPos cur_match) argument
|
H A D | gvmat32.asm | 51 ;uInt longest_match_7fff(s, cur_match)
53 ; IPos cur_match; /* current match */
56 cur_match equ dword ptr[esp+NbStack-0]
define 219 mov eax,cur_match
234 ; eax = ax = cur_match
250 ; cur_match = prev[cur_match & wmask]
253 ; if cur_match > limit, go to exitloop
262 ; if (scan_start==*(cur_match+window)) goto normalbeg2
270 ; cur_match [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/xz/src/liblzma/lz/ |
H A D | lz_encoder_mf.c | 221 matches_count = func(len_limit, pos, cur, cur_match, mf->depth, \ 240 /// \param cur_match Start position of the current match candidate 252 uint32_t cur_match, 260 son[cyclic_pos] = cur_match; 263 const uint32_t delta = pos - cur_match; 268 cur_match = son[cyclic_pos - delta 297 mf->son[mf->cyclic_pos] = cur_match; \ 313 const uint32_t cur_match = mf->hash[FIX_3_HASH_SIZE + hash_value]; local 353 const uint32_t cur_match local 377 const uint32_t cur_match local 248 hc_find_func( const uint32_t len_limit, const uint32_t pos, const uint8_t *const cur, uint32_t cur_match, uint32_t depth, uint32_t *const son, const uint32_t cyclic_pos, const uint32_t cyclic_size, lzma_match *matches, uint32_t len_best) argument 433 const uint32_t cur_match local 453 bt_find_func( const uint32_t len_limit, const uint32_t pos, const uint8_t *const cur, uint32_t cur_match, uint32_t depth, uint32_t *const son, const uint32_t cyclic_pos, const uint32_t cyclic_size, lzma_match *matches, uint32_t len_best) argument 521 bt_skip_func( const uint32_t len_limit, const uint32_t pos, const uint8_t *const cur, uint32_t cur_match, uint32_t depth, uint32_t *const son, const uint32_t cyclic_pos, const uint32_t cyclic_size) argument 600 const uint32_t cur_match = mf->hash[hash_value]; local 615 const uint32_t cur_match = mf->hash[hash_value]; local 634 const uint32_t cur_match = mf->hash[FIX_3_HASH_SIZE + hash_value]; local 668 const uint32_t cur_match local 692 const uint32_t cur_match = mf->hash[FIX_4_HASH_SIZE + hash_value]; local 742 const uint32_t cur_match local [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/net/sched/ |
H A D | ematch.c | 489 struct tcf_ematch *cur_match; local 494 cur_match = tcf_em_get_match(tree, match_idx); 496 if (tcf_em_is_container(cur_match)) { 501 match_idx = cur_match->data; 505 res = tcf_em_match(skb, cur_match, info); 507 if (tcf_em_early_end(cur_match, res)) 516 cur_match = tcf_em_get_match(tree, match_idx); 518 if (tcf_em_early_end(cur_match, res))
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/net/sched/ |
H A D | ematch.c | 489 struct tcf_ematch *cur_match; local 494 cur_match = tcf_em_get_match(tree, match_idx); 496 if (tcf_em_is_container(cur_match)) { 501 match_idx = cur_match->data; 505 res = tcf_em_match(skb, cur_match, info); 507 if (tcf_em_early_end(cur_match, res)) 516 cur_match = tcf_em_get_match(tree, match_idx); 518 if (tcf_em_early_end(cur_match, res))
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/cfe/cfe/zlib/ |
H A D | deflate.c | 86 uInt longest_match OF((deflate_state *s, IPos cur_match)); 88 local uInt longest_match OF((deflate_state *s, IPos cur_match)); 717 * IN assertions: cur_match is the head of the hash chain for the current 726 local uInt longest_match(s, cur_match) 728 IPos cur_match; /* current match */ 738 /* Stop when cur_match becomes <= limit. To simplify the code, 774 Assert(cur_match < s->strstart, "no future"); 775 match = s->window + cur_match; 847 s->match_start = cur_match; 857 } while ((cur_match [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/lib/zlib/contrib/masmx64/ |
H A D | gvmat64.asm | 3 ; IPos cur_match); /* current match */
36 ;uInt longest_match(s, cur_match)
38 ; IPos cur_match; /* current match */
168 ;;; Retrieve the function arguments. r8d will hold cur_match
324 ;;; match = s->window + cur_match;
328 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
452 ;;; s->match_start = cur_match;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/lib/zlib/contrib/masmx64/ |
H A D | gvmat64.asm | 3 ; IPos cur_match); /* current match */
36 ;uInt longest_match(s, cur_match)
38 ; IPos cur_match; /* current match */
168 ;;; Retrieve the function arguments. r8d will hold cur_match
324 ;;; match = s->window + cur_match;
328 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
452 ;;; s->match_start = cur_match;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/lib/zlib/contrib/masmx64/ |
H A D | gvmat64.asm | 3 ; IPos cur_match); /* current match */
36 ;uInt longest_match(s, cur_match)
38 ; IPos cur_match; /* current match */
168 ;;; Retrieve the function arguments. r8d will hold cur_match
324 ;;; match = s->window + cur_match;
328 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
452 ;;; s->match_start = cur_match;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/lib/zlib/ |
H A D | deflate.c | 89 uInt longest_match OF((deflate_state *s, IPos cur_match)); 91 local uInt longest_match OF((deflate_state *s, IPos cur_match)); 94 local uInt longest_match_fast OF((deflate_state *s, IPos cur_match)); 1016 * IN assertions: cur_match is the head of the hash chain for the current 1024 local uInt longest_match(s, cur_match) 1026 IPos cur_match; /* current match */ 1036 /* Stop when cur_match becomes <= limit. To simplify the code, 1072 Assert(cur_match < s->strstart, "no future"); 1073 match = s->window + cur_match; 1150 s->match_start = cur_match; [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/lib/zlib/ |
H A D | deflate.c | 89 uInt longest_match OF((deflate_state *s, IPos cur_match)); 91 local uInt longest_match OF((deflate_state *s, IPos cur_match)); 94 local uInt longest_match_fast OF((deflate_state *s, IPos cur_match)); 1016 * IN assertions: cur_match is the head of the hash chain for the current 1024 local uInt longest_match(s, cur_match) 1026 IPos cur_match; /* current match */ 1036 /* Stop when cur_match becomes <= limit. To simplify the code, 1072 Assert(cur_match < s->strstart, "no future"); 1073 match = s->window + cur_match; 1150 s->match_start = cur_match; [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/lib/zlib/ |
H A D | deflate.c | 89 uInt longest_match OF((deflate_state *s, IPos cur_match)); 91 local uInt longest_match OF((deflate_state *s, IPos cur_match)); 94 local uInt longest_match_fast OF((deflate_state *s, IPos cur_match)); 1016 * IN assertions: cur_match is the head of the hash chain for the current 1024 local uInt longest_match(s, cur_match) 1026 IPos cur_match; /* current match */ 1036 /* Stop when cur_match becomes <= limit. To simplify the code, 1072 Assert(cur_match < s->strstart, "no future"); 1073 match = s->window + cur_match; 1150 s->match_start = cur_match; [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/zlib/ |
H A D | deflate.c | 90 uInt longest_match OF((deflate_state *s, IPos cur_match)); 92 local uInt longest_match OF((deflate_state *s, IPos cur_match)); 1055 * IN assertions: cur_match is the head of the hash chain for the current 1063 local uInt longest_match(s, cur_match) 1065 IPos cur_match; /* current match */ 1075 /* Stop when cur_match becomes <= limit. To simplify the code, 1111 Assert(cur_match < s->strstart, "no future"); 1112 match = s->window + cur_match; 1189 s->match_start = cur_match; 1199 } while ((cur_match [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/zlib/ |
H A D | deflate.c | 90 uInt longest_match OF((deflate_state *s, IPos cur_match)); 92 local uInt longest_match OF((deflate_state *s, IPos cur_match)); 1055 * IN assertions: cur_match is the head of the hash chain for the current 1063 local uInt longest_match(s, cur_match) 1065 IPos cur_match; /* current match */ 1075 /* Stop when cur_match becomes <= limit. To simplify the code, 1111 Assert(cur_match < s->strstart, "no future"); 1112 match = s->window + cur_match; 1189 s->match_start = cur_match; 1199 } while ((cur_match [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/zlib/ |
H A D | deflate.c | 90 uInt longest_match OF((deflate_state *s, IPos cur_match)); 92 local uInt longest_match OF((deflate_state *s, IPos cur_match)); 1055 * IN assertions: cur_match is the head of the hash chain for the current 1063 local uInt longest_match(s, cur_match) 1065 IPos cur_match; /* current match */ 1075 /* Stop when cur_match becomes <= limit. To simplify the code, 1111 Assert(cur_match < s->strstart, "no future"); 1112 match = s->window + cur_match; 1189 s->match_start = cur_match; 1199 } while ((cur_match [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/lib/zlib/contrib/masm686/ |
H A D | match.asm | 142 ; Retrieve the function arguments. ecx will hold cur_match
239 ; * match = s->window + cur_match;
243 ; * } while ((cur_match = prev[cur_match & wmask]) > limit
361 ;/* s->match_start = cur_match; */
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/lib/zlib/contrib/masm686/ |
H A D | match.asm | 142 ; Retrieve the function arguments. ecx will hold cur_match
239 ; * match = s->window + cur_match;
243 ; * } while ((cur_match = prev[cur_match & wmask]) > limit
361 ;/* s->match_start = cur_match; */
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/lib/zlib/contrib/masm686/ |
H A D | match.asm | 142 ; Retrieve the function arguments. ecx will hold cur_match
239 ; * match = s->window + cur_match;
243 ; * } while ((cur_match = prev[cur_match & wmask]) > limit
361 ;/* s->match_start = cur_match; */
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | deflate.c | 77 static uInt longest_match (deflate_state *s, IPos cur_match); 539 * IN assertions: cur_match is the head of the hash chain for the current 548 IPos cur_match /* current match */ 559 /* Stop when cur_match becomes <= limit. To simplify the code, 595 Assert(cur_match < s->strstart, "no future"); 596 match = s->window + cur_match; 668 s->match_start = cur_match; 678 } while ((cur_match = prev[cur_match & wmask]) > limit
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/lib/zlib_deflate/ |
H A D | deflate.c | 77 static uInt longest_match (deflate_state *s, IPos cur_match); 539 * IN assertions: cur_match is the head of the hash chain for the current 548 IPos cur_match /* current match */ 559 /* Stop when cur_match becomes <= limit. To simplify the code, 595 Assert(cur_match < s->strstart, "no future"); 596 match = s->window + cur_match; 668 s->match_start = cur_match; 678 } while ((cur_match = prev[cur_match & wmask]) > limit
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/zlib/contrib/masmx64/ |
H A D | gvmat64.asm | 3 ; IPos cur_match); /* current match */
56 ;uInt longest_match(s, cur_match)
58 ; IPos cur_match; /* current match */
207 ;;; Retrieve the function arguments. r8d will hold cur_match
363 ;;; match = s->window + cur_match;
367 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
492 ;;; s->match_start = cur_match;
|