Home
last modified time | relevance | path

Searched refs:ushf (Results 1 - 18 of 18) sorted by relevance

/third_party/node/deps/zlib/
H A Ddeflate.c549 s->d_buf = (ushf *)(s->pending_buf + (s->lit_bufsize << 1)); in deflateInit2_()
1371 ds->d_buf = (ushf *)(ds->pending_buf + (ds->lit_bufsize << 1)); in deflateCopy()
1415 register ush scan_start = *(ushf*)scan; in longest_match()
1416 register ush scan_end = *(ushf*)(scan + best_len - 1); in longest_match()
1456 if (*(ushf*)(match + best_len - 1) != scan_end || in longest_match()
1457 *(ushf*)match != scan_start) continue; in longest_match()
1480 } while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) && in longest_match()
1481 *(ushf*)(scan += 2) == *(ushf*)(matc in longest_match()
[all...]
H A Dzutil.h57 typedef ush FAR ushf; typedef
H A Ddeflate.h225 ushf *d_buf; /* buffer for distances */
H A Dtrees.c202 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) { in gen_codes()
/third_party/zlib/
H A Ddeflate.c510 s->d_buf = (ushf *)(s->pending_buf + (s->lit_bufsize << 1)); in deflateInit2_()
1332 ds->d_buf = (ushf *)(ds->pending_buf + (ds->lit_bufsize << 1)); in deflateCopy()
1377 register ush scan_start = *(ushf*)scan; in longest_match()
1378 register ush scan_end = *(ushf*)(scan + best_len - 1); in longest_match()
1418 if (*(ushf*)(match + best_len - 1) != scan_end || in longest_match()
1419 *(ushf*)match != scan_start) continue; in longest_match()
1433 } while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) && in longest_match()
1434 *(ushf*)(scan += 2) == *(ushf*)(matc in longest_match()
[all...]
H A Ddeflate.h226 ushf *d_buf; /* buffer for distances */
H A Dzutil.h42 typedef ush FAR ushf; typedef
H A Dtrees.c214 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) in gen_codes()
/third_party/libwebsockets/win32port/zlib/
H A Ddeflate.c1132 register ush scan_start = *(ushf*)scan;
1133 register ush scan_end = *(ushf*)(scan+best_len-1);
1172 if (*(ushf*)(match+best_len-1) != scan_end ||
1173 *(ushf*)match != scan_start) continue;
1187 } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1188 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1189 *(ushf*)(scan+=2) == *(ushf*)(matc
[all...]
H A Dzutil.h40 typedef ush FAR ushf; typedef
H A Dtrees.c147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
584 ushf *bl_count; /* number of codes at each bit length */
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.c1312 register ush scan_start = *(ushf*)scan;
1313 register ush scan_end = *(ushf*)(scan+best_len-1);
1352 if (*(ushf*)(match+best_len-1) != scan_end ||
1353 *(ushf*)match != scan_start) continue;
1376 } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1377 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1378 *(ushf*)(scan+=2) == *(ushf*)(matc
[all...]
H A Dzutil.h57 typedef ush FAR ushf; typedef
H A Dtrees.c142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
575 ushf *bl_count; /* number of codes at each bit length */
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.c1304 register ush scan_start = *(ushf*)scan;
1305 register ush scan_end = *(ushf*)(scan+best_len-1);
1344 if (*(ushf*)(match+best_len-1) != scan_end ||
1345 *(ushf*)match != scan_start) continue;
1368 } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1369 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1370 *(ushf*)(scan+=2) == *(ushf*)(matc
[all...]
H A Dzutil.h61 typedef ush FAR ushf; typedef
H A Dtrees.c142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
575 ushf *bl_count; /* number of codes at each bit length */
/third_party/skia/third_party/externals/freetype/src/gzip/
H A Dzutil.h37 typedef ush FAR ushf; typedef

Completed in 22 milliseconds