lib/libc/rpc/clnt_tcp.c

117

struct ct_data *ct = NULL;

lib/libc/rpc/clnt_tcp.c

126

ct = (struct ct_data *)mem_alloc(sizeof(*ct));

lib/libc/rpc/clnt_tcp.c

139

mem_free((caddr_t)ct, sizeof(struct ct_data));

lib/libc/rpc/clnt_tcp.c

219

mem_free((caddr_t)ct, sizeof(struct ct_data));

lib/libc/rpc/clnt_tcp.c

230

struct ct_data *ct = (struct ct_data *) h->cl_private;

lib/libc/rpc/clnt_tcp.c

320

struct ct_data *ct =

lib/libc/rpc/clnt_tcp.c

321

(struct ct_data *) h->cl_private;

lib/libc/rpc/clnt_tcp.c

329

struct ct_data *ct = (struct ct_data *)cl->cl_private;

lib/libc/rpc/clnt_tcp.c

344

struct ct_data *ct = (struct ct_data *)cl->cl_private;

lib/libc/rpc/clnt_tcp.c

370

struct ct_data *ct =

lib/libc/rpc/clnt_tcp.c

371

(struct ct_data *) h->cl_private;

lib/libc/rpc/clnt_tcp.c

377

mem_free((caddr_t)ct, sizeof(struct ct_data));

lib/libc/rpc/clnt_tcp.c

387

readtcp(struct ct_data *ct, caddr_t buf, int len)

lib/libc/rpc/clnt_tcp.c

449

writetcp(struct ct_data *ct, caddr_t buf, int len)

lib/libc/rpc/clnt_tcp.c

93

static int readtcp(struct ct_data *, caddr_t, int);

lib/libc/rpc/clnt_tcp.c

94

static int writetcp(struct ct_data *, caddr_t, int);

lib/libc/rpc/xdr_rec.c

81

struct ct_data;

lib/libz/deflate.h

89

ct_data *dyn_tree; /* the dynamic tree */

lib/libz/trees.c

1058

compress_block(s, (const ct_data *)static_ltree,

lib/libz/trees.c

1059

(const ct_data *)static_dtree);

lib/libz/trees.c

1067

compress_block(s, (const ct_data *)s->dyn_ltree,

lib/libz/trees.c

1068

(const ct_data *)s->dyn_dtree);

lib/libz/trees.c

116

const ct_data *static_tree; /* static tree or NULL */

lib/libz/trees.c

136

{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};

lib/libz/trees.c

201

local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {

lib/libz/trees.c

359

gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);

lib/libz/trees.c

507

local void pqdownheap(deflate_state *s, ct_data *tree, int k) {

lib/libz/trees.c

539

ct_data *tree = desc->dyn_tree;

lib/libz/trees.c

541

const ct_data *stree = desc->stat_desc->static_tree;

lib/libz/trees.c

626

ct_data *tree = desc->dyn_tree;

lib/libz/trees.c

627

const ct_data *stree = desc->stat_desc->static_tree;

lib/libz/trees.c

703

gen_codes ((ct_data *)tree, max_code, s->bl_count);

lib/libz/trees.c

710

local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {

lib/libz/trees.c

751

local void send_tree(deflate_state *s, ct_data *tree, int max_code) {

lib/libz/trees.c

802

scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);

lib/libz/trees.c

803

scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);

lib/libz/trees.c

84

local ct_data static_ltree[L_CODES+2];

lib/libz/trees.c

848

send_tree(s, (ct_data *)s->dyn_ltree, lcodes - 1); /* literal tree */

lib/libz/trees.c

851

send_tree(s, (ct_data *)s->dyn_dtree, dcodes - 1); /* distance tree */

lib/libz/trees.c

898

local void compress_block(deflate_state *s, const ct_data *ltree,

lib/libz/trees.c

899

const ct_data *dtree) {

lib/libz/trees.c

91

local ct_data static_dtree[D_CODES];

lib/libz/trees.h

3

local const ct_data static_ltree[L_CODES+2] = {

lib/libz/trees.h

64

local const ct_data static_dtree[D_CODES] = {

sys/lib/libz/deflate.h

89

ct_data *dyn_tree; /* the dynamic tree */

sys/lib/libz/trees.c

1058

compress_block(s, (const ct_data *)static_ltree,

sys/lib/libz/trees.c

1059

(const ct_data *)static_dtree);

sys/lib/libz/trees.c

1067

compress_block(s, (const ct_data *)s->dyn_ltree,

sys/lib/libz/trees.c

1068

(const ct_data *)s->dyn_dtree);

sys/lib/libz/trees.c

116

const ct_data *static_tree; /* static tree or NULL */

sys/lib/libz/trees.c

136

{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};

sys/lib/libz/trees.c

201

local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {

sys/lib/libz/trees.c

359

gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);

sys/lib/libz/trees.c

507

local void pqdownheap(deflate_state *s, ct_data *tree, int k) {

sys/lib/libz/trees.c

539

ct_data *tree = desc->dyn_tree;

sys/lib/libz/trees.c

541

const ct_data *stree = desc->stat_desc->static_tree;

sys/lib/libz/trees.c

626

ct_data *tree = desc->dyn_tree;

sys/lib/libz/trees.c

627

const ct_data *stree = desc->stat_desc->static_tree;

sys/lib/libz/trees.c

703

gen_codes ((ct_data *)tree, max_code, s->bl_count);

sys/lib/libz/trees.c

710

local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {

sys/lib/libz/trees.c

751

local void send_tree(deflate_state *s, ct_data *tree, int max_code) {

sys/lib/libz/trees.c

802

scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);

sys/lib/libz/trees.c

803

scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);

sys/lib/libz/trees.c

84

local ct_data static_ltree[L_CODES+2];

sys/lib/libz/trees.c

848

send_tree(s, (ct_data *)s->dyn_ltree, lcodes - 1); /* literal tree */

sys/lib/libz/trees.c

851

send_tree(s, (ct_data *)s->dyn_dtree, dcodes - 1); /* distance tree */

sys/lib/libz/trees.c

898

local void compress_block(deflate_state *s, const ct_data *ltree,

sys/lib/libz/trees.c

899

const ct_data *dtree) {

sys/lib/libz/trees.c

91

local ct_data static_dtree[D_CODES];

sys/lib/libz/trees.h

3

local const ct_data static_ltree[L_CODES+2] = {

sys/lib/libz/trees.h

64

local const ct_data static_dtree[D_CODES] = {