Home
last modified time | relevance | path

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

/third_party/elfutils/libdw/
H A Ddwarf_getsrc_file.c53 size_t cur_match = 0; in dwarf_getsrc_file() local
117 for (inner = 0; inner < cur_match; ++inner) in dwarf_getsrc_file()
121 if (inner < cur_match in dwarf_getsrc_file()
138 if (cur_match < max_match) in dwarf_getsrc_file()
140 if (cur_match == act_match) in dwarf_getsrc_file()
156 match[cur_match++] = line; in dwarf_getsrc_file()
162 if (cur_match == max_match) in dwarf_getsrc_file()
166 if (cur_match > 0) in dwarf_getsrc_file()
170 *nsrcs = cur_match; in dwarf_getsrc_file()
/third_party/elfutils/libdwfl/
H A Ddwfl_module_getsrc_file.c74 size_t cur_match = 0; in dwfl_module_getsrc_file() local
122 for (inner = 0; inner < cur_match; ++inner) in dwfl_module_getsrc_file()
126 if (inner < cur_match in dwfl_module_getsrc_file()
143 if (cur_match < max_match) in dwfl_module_getsrc_file()
145 if (cur_match == act_match) in dwfl_module_getsrc_file()
161 match[cur_match++] = &cu->lines->idx[cnt]; in dwfl_module_getsrc_file()
166 if (cur_match > 0) in dwfl_module_getsrc_file()
170 *nsrcs = cur_match; in dwfl_module_getsrc_file()
/third_party/libwebsockets/win32port/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));
1101 * IN assertions: cur_match is the head of the hash chain for the current
1109 local uInt longest_match(s, cur_match) in longest_match()
1111 IPos cur_match; /* current match */
1121 /* Stop when cur_match becomes <= limit. To simplify the code,
1157 Assert(cur_match < s->strstart, "no future");
1158 match = s->window + cur_match;
1235 s->match_start = cur_match;
1245 } while ((cur_match
[all...]
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.c107 uInt longest_match OF((deflate_state *s, IPos cur_match));
109 local uInt longest_match OF((deflate_state *s, IPos cur_match));
1281 * IN assertions: cur_match is the head of the hash chain for the current
1289 local uInt longest_match(s, cur_match) in longest_match()
1291 IPos cur_match; /* current match */
1301 /* Stop when cur_match becomes <= limit. To simplify the code,
1337 Assert(cur_match < s->strstart, "no future");
1338 match = s->window + cur_match;
1433 s->match_start = cur_match;
1443 } while ((cur_match
[all...]
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.c107 uInt longest_match OF((deflate_state *s, IPos cur_match));
109 local uInt longest_match OF((deflate_state *s, IPos cur_match));
1273 * IN assertions: cur_match is the head of the hash chain for the current
1281 local uInt longest_match(s, cur_match) in longest_match()
1283 IPos cur_match; /* current match */
1293 /* Stop when cur_match becomes <= limit. To simplify the code,
1329 Assert(cur_match < s->strstart, "no future");
1330 match = s->window + cur_match;
1425 s->match_start = cur_match;
1435 } while ((cur_match
[all...]
/third_party/node/deps/zlib/
H A Ddeflate.c1391 * IN assertions: cur_match is the head of the hash chain for the current
1395 local uInt longest_match(deflate_state *s, IPos cur_match) { in longest_match() argument
1404 /* Stop when cur_match becomes <= limit. To simplify the code, in longest_match()
1441 Assert(cur_match < s->strstart, "no future"); in longest_match()
1442 match = s->window + cur_match; in longest_match()
1539 s->match_start = cur_match; in longest_match()
1549 } while ((cur_match = prev[cur_match & wmask]) > limit in longest_match()
1561 local uInt longest_match(deflate_state *s, IPos cur_match) { in longest_match() argument
1575 Assert(cur_match < in longest_match()
[all...]
/third_party/zlib/
H A Ddeflate.c1352 * IN assertions: cur_match is the head of the hash chain for the current
1356 local uInt longest_match(deflate_state *s, IPos cur_match) in longest_match() argument
1366 /* Stop when cur_match becomes <= limit. To simplify the code, in longest_match()
1403 Assert(cur_match < s->strstart, "no future"); in longest_match()
1404 match = s->window + cur_match; in longest_match()
1483 s->match_start = cur_match; in longest_match()
1493 } while ((cur_match = prev[cur_match & wmask]) > limit in longest_match()
1505 local uInt longest_match(deflate_state *s, IPos cur_match) in longest_match() argument
1520 Assert(cur_match < in longest_match()
[all...]
/third_party/ntfs-3g/libntfs-3g/
H A Dcompress.c160 s16 cur_match; in ntfs_best_match() local
169 cur_match = pctx->head[hash]; in ntfs_best_match()
170 prev[i] = cur_match; in ntfs_best_match()
181 for (; cur_match >= 0 && depth_remaining--; in ntfs_best_match()
182 cur_match = prev[cur_match]) in ntfs_best_match()
185 matchptr = &inbuf[cur_match]; in ntfs_best_match()

Completed in 14 milliseconds