Searched refs:cur_match (Results 1 - 7 of 7) sorted by relevance

/external/elfutils/libdw/
H A Ddwarf_getsrc_file.c53 size_t cur_match = 0; local
117 for (inner = 0; inner < cur_match; ++inner)
121 if (inner < cur_match
138 if (cur_match < max_match)
140 if (cur_match == act_match)
156 match[cur_match++] = line;
162 if (cur_match == max_match)
166 if (cur_match > 0)
170 *nsrcs = cur_match;
/external/elfutils/libdwfl/
H A Ddwfl_module_getsrc_file.c70 size_t cur_match = 0; local
116 for (inner = 0; inner < cur_match; ++inner)
120 if (inner < cur_match
137 if (cur_match < max_match)
139 if (cur_match == act_match)
155 match[cur_match++] = &cu->lines->idx[cnt];
160 if (cur_match > 0)
164 *nsrcs = cur_match;
/external/opencv3/3rdparty/zlib/
H A Ddeflate.c90 uInt longest_match OF((deflate_state *s, IPos cur_match));
92 local uInt longest_match OF((deflate_state *s, IPos cur_match));
1140 * IN assertions: cur_match is the head of the hash chain for the current
1148 local uInt longest_match(s, cur_match)
1150 IPos cur_match; /* current match */
1160 /* Stop when cur_match becomes <= limit. To simplify the code,
1196 Assert(cur_match < s->strstart, "no future");
1197 match = s->window + cur_match;
1274 s->match_start = cur_match;
1284 } while ((cur_match
[all...]
/external/zlib/src/
H A Ddeflate.c90 uInt longest_match OF((deflate_state *s, IPos cur_match));
92 local uInt longest_match OF((deflate_state *s, IPos cur_match));
1140 * IN assertions: cur_match is the head of the hash chain for the current
1148 local uInt longest_match(s, cur_match)
1150 IPos cur_match; /* current match */
1160 /* Stop when cur_match becomes <= limit. To simplify the code,
1196 Assert(cur_match < s->strstart, "no future");
1197 match = s->window + cur_match;
1274 s->match_start = cur_match;
1284 } while ((cur_match
[all...]
/external/pdfium/third_party/zlib_v128/
H A Ddeflate.c90 uInt longest_match OF((deflate_state *s, IPos cur_match));
92 local uInt longest_match OF((deflate_state *s, IPos cur_match));
1139 * IN assertions: cur_match is the head of the hash chain for the current
1149 IPos cur_match) /* current match */
1159 /* Stop when cur_match becomes <= limit. To simplify the code,
1195 Assert(cur_match < s->strstart, "no future");
1196 match = s->window + cur_match;
1273 s->match_start = cur_match;
1283 } while ((cur_match = prev[cur_match
1147 longest_match( deflate_state *s, IPos cur_match) argument
1296 longest_match( deflate_state *s, IPos cur_match) argument
[all...]
/external/zlib/src/contrib/masmx64/
H A Dgvmat64.asm3 ; 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;
/external/zlib/src/contrib/masmx86/
H A Dmatch686.asm37 ;uInt longest_match(s, cur_match)
39 ; IPos cur_match; /* current match */
42 cur_match equ dword ptr[esp+NbStack-0] define
209 ;;; Retrieve the function arguments. ecx will hold cur_match
305 ;;; match = s->window + cur_match;
309 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
410 ;;; s->match_start = cur_match;

Completed in 621 milliseconds