uch
uch depth[2*L_CODES+1];
extern uch ZLIB_INTERNAL _length_code[];
extern uch ZLIB_INTERNAL _dist_code[];
extern const uch ZLIB_INTERNAL _length_code[];
extern const uch ZLIB_INTERNAL _dist_code[];
{ uch cc = (c); \
{ uch len = (uch)(length); \
{ uch cc = (c); \
{ uch len = (uch)(length); \
s->sym_buf[s->sym_next++] = (uch)dist; \
s->sym_buf[s->sym_next++] = (uch)(dist >> 8); \
uch _dist_code[DIST_CODE_LEN];
uch _length_code[MAX_MATCH-MIN_MATCH+1];
s->l_buf[s->sym_next++] = (uch)lc;
s->sym_buf[s->sym_next++] = (uch)dist;
s->sym_buf[s->sym_next++] = (uch)(dist >> 8);
s->sym_buf[s->sym_next++] = (uch)lc;
put_byte(s, (uch)((w) & 0xff)); \
put_byte(s, (uch)((ush)(w) >> 8)); \
_length_code[length++] = (uch)code;
_length_code[length - 1] = (uch)code;
_dist_code[dist++] = (uch)code;
_dist_code[256 + dist++] = (uch)code;
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
local const uch bl_order[BL_CODES]
const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {
*((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
typedef uch FAR uchf;
if (isprint((uch)ch) || ch == ' ')
c = (uch)*(start - 1);
if (MORE() && isdigit((uch)PEEK())) {
while (MORE() && isdigit((uch)PEEK()) && count <= DUPMAX) {
count = count*10 + ((uch)GETNEXT() - '0');
while (MORE() && isalpha((uch)PEEK()))
(isdigit((uch)PEEK2()) || PEEK2() == ','), REG_BADRPT);
if (isdigit((uch)PEEK())) {
(c == '{' && MORE2() && isdigit((uch)PEEK2())) ) )
c = (uch)GETNEXT();
cc = (uch)GETNEXT();
#define ISWORD(c) (iswalnum((uch)(c)) || (c) == '_')
struct qat_uof_image *, struct uof_chunk_hdr *uch);
struct uof_chunk_hdr *uch;
uch = (struct uof_chunk_hdr *)(uoh + 1);
for (i = 0; i < uoh->uoh_num_chunks; i++, uch++) {
if (uch->uch_offset + uch->uch_size > sc->sc_aefw_uof.qafu_size)
if (cur < uch && !strncmp(uch->uch_id, id, UOF_OBJ_ID_LEN))
return uch;
struct qat_uof_image *qui, struct uof_chunk_hdr *uch)
size_t lim = uch->uch_offset + uch->uch_size, size;
size = uch->uch_size;
(struct uof_image *)(base + uch->uch_offset);
struct uof_chunk_hdr *uch = NULL;
uch = qat_aefw_uof_find_chunk(sc, UOF_IMAG, uch);
if (uch == NULL)
error = qat_aefw_uof_parse_image(sc, &sc->sc_aefw_uof.qafu_imgs[i], uch);
struct uof_chunk_hdr *uch;
uch = qat_aefw_uof_find_chunk(sc, UOF_STRT, NULL);
if (uch != NULL) {
(void *)(base + uch->uch_offset + hdr_size);
sc->sc_aefw_uof.qafu_str_tab_size = uch->uch_size - hdr_size;
uch = qat_aefw_uof_find_chunk(sc, UOF_IMEM, NULL);
if (uch != NULL) {
if (uch->uch_size < sizeof(struct uof_obj_table))
uch->uch_offset))->uot_nentries;
(struct uof_init_mem *)(base + uch->uch_offset +
uch->uch_size - sizeof(struct uof_obj_table);
uch = qat_aefw_uof_find_chunk(sc, UOF_MSEG, NULL);
if (uch != NULL) {
if (uch->uch_size < sizeof(struct uof_obj_table) +
(struct uof_var_mem_seg *)(base + uch->uch_offset +
local const uch bl_order[BL_CODES]
uch _dist_code[DIST_CODE_LEN];
uch _length_code[MAX_MATCH-MIN_MATCH+1];
const uch _dist_code[DIST_CODE_LEN] = {
const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
put_byte(s, (uch)((w) & 0xff)); \
put_byte(s, (uch)((ush)(w) >> 8)); \
_length_code[length++] = (uch)code;
_length_code[length-1] = (uch)code;
_dist_code[dist++] = (uch)code;
_dist_code[256 + dist++] = (uch)code;
s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1);
s->l_buf[s->last_lit++] = (uch)lc;
uch depth[2*L_CODES+1];
*((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
extern uch _length_code[];
extern uch _dist_code[];
extern const uch _length_code[];
extern const uch _dist_code[];
{ uch cc = (c); \
{ uch len = (length); \
typedef uch FAR uchf;
unsigned char uch = -3;
uch = -5;
uch += -7;
uch *= -1;