lib/libz/deflate.c

1360

zmemcpy(ds->d_buf, ss->d_buf, ss->sym_next * sizeof(ush));

lib/libz/deflate.c

1405

ush scan_start = *(ushf*)scan;

lib/libz/deflate.c

1406

ush scan_end = *(ushf*)(scan + best_len - 1);

lib/libz/deflate.c

760

s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);

lib/libz/deflate.c

95

ush good_length; /* reduce lazy search above this match length */

lib/libz/deflate.c

96

ush max_lazy; /* do not perform lazy search above this match length */

lib/libz/deflate.c

97

ush nice_length; /* quit search above this match length */

lib/libz/deflate.c

98

ush max_chain;

lib/libz/deflate.h

208

ush bl_count[MAX_BITS+1];

lib/libz/deflate.h

264

ush bi_buf;

lib/libz/deflate.h

346

ush dist = (ush)(distance); \

lib/libz/deflate.h

365

ush dist = (ush)(distance); \

lib/libz/deflate.h

72

ush freq; /* frequency count */

lib/libz/deflate.h

73

ush code; /* bit string */

lib/libz/deflate.h

76

ush dad; /* father node in Huffman tree */

lib/libz/deflate.h

77

ush len; /* length of bit string */

lib/libz/deflate.h

94

typedef ush Pos;

lib/libz/trees.c

1095

s->d_buf[s->sym_next] = (ush)dist;

lib/libz/trees.c

1109

Assert((ush)dist < (ush)MAX_DIST(s) &&

lib/libz/trees.c

1110

(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&

lib/libz/trees.c

1111

(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");

lib/libz/trees.c

144

put_byte(s, (uch)((ush)(w) >> 8)); \

lib/libz/trees.c

202

ush next_code[MAX_BITS+1]; /* next code value for each bit length */

lib/libz/trees.c

212

next_code[bits] = (ush)code;

lib/libz/trees.c

225

tree[n].Code = (ush)bi_reverse(next_code[len]++, len);

lib/libz/trees.c

261

s->bi_buf |= (ush)value << s->bi_valid;

lib/libz/trees.c

263

s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);

lib/libz/trees.c

266

s->bi_buf |= (ush)value << s->bi_valid;

lib/libz/trees.c

276

s->bi_buf |= (ush)val << s->bi_valid;\

lib/libz/trees.c

278

s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\

lib/libz/trees.c

281

s->bi_buf |= (ush)(value) << s->bi_valid;\

lib/libz/trees.c

301

ush bl_count[MAX_BITS+1];

lib/libz/trees.c

549

ush f; /* frequency */

lib/libz/trees.c

563

tree[n].Len = (ush)bits;

lib/libz/trees.c

606

tree[m].Len = (ush)bits;

lib/libz/trees.c

682

tree[n].Dad = tree[m].Dad = (ush)node;

lib/libz/trees.c

720

tree[max_code + 1].Len = (ush)0xffff; /* guard */

lib/libz/trees.c

727

s->bl_tree[curlen].Freq += (ush)count;

lib/libz/trees.c

862

put_short(s, (ush)stored_len);

lib/libz/trees.c

863

put_short(s, (ush)~stored_len);

lib/libz/zutil.c

225

if (*(ush*)&buf != 0) return buf;

lib/libz/zutil.c

233

*((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;

lib/libz/zutil.c

234

*(ush*)&buf = 0;

lib/libz/zutil.c

244

if (*(ush*)&ptr != 0) { /* object < 64K */

lib/libz/zutil.h

48

typedef ush FAR ushf;

sys/lib/libz/deflate.c

1360

zmemcpy(ds->d_buf, ss->d_buf, ss->sym_next * sizeof(ush));

sys/lib/libz/deflate.c

1405

ush scan_start = *(ushf*)scan;

sys/lib/libz/deflate.c

1406

ush scan_end = *(ushf*)(scan + best_len - 1);

sys/lib/libz/deflate.c

760

s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);

sys/lib/libz/deflate.c

95

ush good_length; /* reduce lazy search above this match length */

sys/lib/libz/deflate.c

96

ush max_lazy; /* do not perform lazy search above this match length */

sys/lib/libz/deflate.c

97

ush nice_length; /* quit search above this match length */

sys/lib/libz/deflate.c

98

ush max_chain;

sys/lib/libz/deflate.h

208

ush bl_count[MAX_BITS+1];

sys/lib/libz/deflate.h

264

ush bi_buf;

sys/lib/libz/deflate.h

346

ush dist = (ush)(distance); \

sys/lib/libz/deflate.h

365

ush dist = (ush)(distance); \

sys/lib/libz/deflate.h

72

ush freq; /* frequency count */

sys/lib/libz/deflate.h

73

ush code; /* bit string */

sys/lib/libz/deflate.h

76

ush dad; /* father node in Huffman tree */

sys/lib/libz/deflate.h

77

ush len; /* length of bit string */

sys/lib/libz/deflate.h

94

typedef ush Pos;

sys/lib/libz/trees.c

1095

s->d_buf[s->sym_next] = (ush)dist;

sys/lib/libz/trees.c

1109

Assert((ush)dist < (ush)MAX_DIST(s) &&

sys/lib/libz/trees.c

1110

(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&

sys/lib/libz/trees.c

1111

(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");

sys/lib/libz/trees.c

144

put_byte(s, (uch)((ush)(w) >> 8)); \

sys/lib/libz/trees.c

202

ush next_code[MAX_BITS+1]; /* next code value for each bit length */

sys/lib/libz/trees.c

212

next_code[bits] = (ush)code;

sys/lib/libz/trees.c

225

tree[n].Code = (ush)bi_reverse(next_code[len]++, len);

sys/lib/libz/trees.c

261

s->bi_buf |= (ush)value << s->bi_valid;

sys/lib/libz/trees.c

263

s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);

sys/lib/libz/trees.c

266

s->bi_buf |= (ush)value << s->bi_valid;

sys/lib/libz/trees.c

276

s->bi_buf |= (ush)val << s->bi_valid;\

sys/lib/libz/trees.c

278

s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\

sys/lib/libz/trees.c

281

s->bi_buf |= (ush)(value) << s->bi_valid;\

sys/lib/libz/trees.c

301

ush bl_count[MAX_BITS+1];

sys/lib/libz/trees.c

549

ush f; /* frequency */

sys/lib/libz/trees.c

563

tree[n].Len = (ush)bits;

sys/lib/libz/trees.c

606

tree[m].Len = (ush)bits;

sys/lib/libz/trees.c

682

tree[n].Dad = tree[m].Dad = (ush)node;

sys/lib/libz/trees.c

720

tree[max_code + 1].Len = (ush)0xffff; /* guard */

sys/lib/libz/trees.c

727

s->bl_tree[curlen].Freq += (ush)count;

sys/lib/libz/trees.c

862

put_short(s, (ush)stored_len);

sys/lib/libz/trees.c

863

put_short(s, (ush)~stored_len);

sys/lib/libz/zutil.c

228

if (*(ush*)&buf != 0) return buf;

sys/lib/libz/zutil.c

236

*((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;

sys/lib/libz/zutil.c

237

*(ush*)&buf = 0;

sys/lib/libz/zutil.c

247

if (*(ush*)&ptr != 0) { /* object < 64K */

sys/lib/libz/zutil.h

61

typedef ush FAR ushf;