crypto/libressl/apps/openssl/apps.c

1974

X509_POLICY_TREE *tree;

crypto/libressl/apps/openssl/apps.c

1982

tree = X509_STORE_CTX_get0_policy_tree(ctx);

crypto/libressl/apps/openssl/apps.c

1988

nodes_print(out, "Authority", X509_policy_tree_get0_policies(tree));

crypto/libressl/apps/openssl/apps.c

1989

nodes_print(out, "User", X509_policy_tree_get0_user_policies(tree));

crypto/libressl/crypto/x509/pcy_int.h

202

X509_POLICY_TREE *tree, X509_POLICY_NODE **nodep);

crypto/libressl/crypto/x509/pcy_lib.c

100

return tree->user_policies;

crypto/libressl/crypto/x509/pcy_lib.c

69

X509_policy_tree_level_count(const X509_POLICY_TREE *tree)

crypto/libressl/crypto/x509/pcy_lib.c

71

if (!tree)

crypto/libressl/crypto/x509/pcy_lib.c

73

return tree->nlevel;

crypto/libressl/crypto/x509/pcy_lib.c

77

X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i)

crypto/libressl/crypto/x509/pcy_lib.c

79

if (!tree || (i < 0) || (i >= tree->nlevel))

crypto/libressl/crypto/x509/pcy_lib.c

81

return tree->levels + i;

crypto/libressl/crypto/x509/pcy_lib.c

85

X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree)

crypto/libressl/crypto/x509/pcy_lib.c

87

if (!tree)

crypto/libressl/crypto/x509/pcy_lib.c

89

return tree->auth_policies;

crypto/libressl/crypto/x509/pcy_lib.c

93

X509_policy_tree_get0_user_policies(const X509_POLICY_TREE *tree)

crypto/libressl/crypto/x509/pcy_lib.c

95

if (!tree)

crypto/libressl/crypto/x509/pcy_lib.c

97

if (tree->flags & POLICY_FLAG_ANY_POLICY)

crypto/libressl/crypto/x509/pcy_lib.c

98

return tree->auth_policies;

crypto/libressl/crypto/x509/pcy_node.c

114

X509_POLICY_NODE *parent, X509_POLICY_TREE *tree, X509_POLICY_NODE **nodep)

crypto/libressl/crypto/x509/pcy_node.c

144

if (tree) {

crypto/libressl/crypto/x509/pcy_node.c

145

if (!tree->extra_data)

crypto/libressl/crypto/x509/pcy_node.c

146

tree->extra_data = sk_X509_POLICY_DATA_new_null();

crypto/libressl/crypto/x509/pcy_node.c

147

if (!tree->extra_data)

crypto/libressl/crypto/x509/pcy_node.c

149

if (!sk_X509_POLICY_DATA_push(tree->extra_data, data))

crypto/libressl/crypto/x509/pcy_tree.c

107

curr = tree->levels + tree->nlevel;

crypto/libressl/crypto/x509/pcy_tree.c

111

BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);

crypto/libressl/crypto/x509/pcy_tree.c

112

for (plev = tree->levels; plev != curr; plev++) {

crypto/libressl/crypto/x509/pcy_tree.c

114

plev - tree->levels, plev->flags);

crypto/libressl/crypto/x509/pcy_tree.c

145

X509_POLICY_TREE *tree;

crypto/libressl/crypto/x509/pcy_tree.c

214

tree = malloc(sizeof(X509_POLICY_TREE));

crypto/libressl/crypto/x509/pcy_tree.c

216

if (!tree)

crypto/libressl/crypto/x509/pcy_tree.c

219

tree->flags = 0;

crypto/libressl/crypto/x509/pcy_tree.c

220

tree->levels = calloc(n, sizeof(X509_POLICY_LEVEL));

crypto/libressl/crypto/x509/pcy_tree.c

221

tree->nlevel = 0;

crypto/libressl/crypto/x509/pcy_tree.c

222

tree->extra_data = NULL;

crypto/libressl/crypto/x509/pcy_tree.c

223

tree->auth_policies = NULL;

crypto/libressl/crypto/x509/pcy_tree.c

224

tree->user_policies = NULL;

crypto/libressl/crypto/x509/pcy_tree.c

226

if (!tree->levels) {

crypto/libressl/crypto/x509/pcy_tree.c

227

free(tree);

crypto/libressl/crypto/x509/pcy_tree.c

231

tree->nlevel = n;

crypto/libressl/crypto/x509/pcy_tree.c

233

level = tree->levels;

crypto/libressl/crypto/x509/pcy_tree.c

239

if (!data || !level_add_node(level, data, NULL, tree, NULL))

crypto/libressl/crypto/x509/pcy_tree.c

279

*ptree = tree;

crypto/libressl/crypto/x509/pcy_tree.c

287

X509_policy_tree_free(tree);

crypto/libressl/crypto/x509/pcy_tree.c

342

const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree)

crypto/libressl/crypto/x509/pcy_tree.c

358

if (!level_add_node(curr, data, node, tree, NULL)) {

crypto/libressl/crypto/x509/pcy_tree.c

368

X509_POLICY_NODE *node, X509_POLICY_TREE *tree)

crypto/libressl/crypto/x509/pcy_tree.c

378

if (!tree_add_unmatched(curr, cache, NULL, node, tree))

crypto/libressl/crypto/x509/pcy_tree.c

391

if (!tree_add_unmatched(curr, cache, oid, node, tree))

crypto/libressl/crypto/x509/pcy_tree.c

401

X509_POLICY_TREE *tree)

crypto/libressl/crypto/x509/pcy_tree.c

410

if (!tree_link_unmatched(curr, cache, node, tree))

crypto/libressl/crypto/x509/pcy_tree.c

428

tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr)

crypto/libressl/crypto/x509/pcy_tree.c

464

if (curr == tree->levels) {

crypto/libressl/crypto/x509/pcy_tree.c

501

tree_calculate_authority_set(X509_POLICY_TREE *tree,

crypto/libressl/crypto/x509/pcy_tree.c

509

curr = tree->levels + tree->nlevel - 1;

crypto/libressl/crypto/x509/pcy_tree.c

513

if (!tree_add_auth_node(&tree->auth_policies, curr->anyPolicy))

crypto/libressl/crypto/x509/pcy_tree.c

518

addnodes = &tree->auth_policies;

crypto/libressl/crypto/x509/pcy_tree.c

520

curr = tree->levels;

crypto/libressl/crypto/x509/pcy_tree.c

521

for (i = 1; i < tree->nlevel; i++) {

crypto/libressl/crypto/x509/pcy_tree.c

539

*pnodes = tree->auth_policies;

crypto/libressl/crypto/x509/pcy_tree.c

545

tree_calculate_user_set(X509_POLICY_TREE *tree,

crypto/libressl/crypto/x509/pcy_tree.c

561

anyPolicy = tree->levels[tree->nlevel - 1].anyPolicy;

crypto/libressl/crypto/x509/pcy_tree.c

566

tree->flags |= POLICY_FLAG_ANY_POLICY;

crypto/libressl/crypto/x509/pcy_tree.c

588

tree, &node);

crypto/libressl/crypto/x509/pcy_tree.c

590

if (!tree->user_policies) {

crypto/libressl/crypto/x509/pcy_tree.c

591

tree->user_policies = sk_X509_POLICY_NODE_new_null();

crypto/libressl/crypto/x509/pcy_tree.c

592

if (!tree->user_policies)

crypto/libressl/crypto/x509/pcy_tree.c

595

if (!sk_X509_POLICY_NODE_push(tree->user_policies, node))

crypto/libressl/crypto/x509/pcy_tree.c

602

tree_evaluate(X509_POLICY_TREE *tree)

crypto/libressl/crypto/x509/pcy_tree.c

605

X509_POLICY_LEVEL *curr = tree->levels + 1;

crypto/libressl/crypto/x509/pcy_tree.c

608

for (i = 1; i < tree->nlevel; i++, curr++) {

crypto/libressl/crypto/x509/pcy_tree.c

614

!tree_link_any(curr, cache, tree))

crypto/libressl/crypto/x509/pcy_tree.c

616

tree_print("before tree_prune()", tree, curr);

crypto/libressl/crypto/x509/pcy_tree.c

617

ret = tree_prune(tree, curr);

crypto/libressl/crypto/x509/pcy_tree.c

633

X509_policy_tree_free(X509_POLICY_TREE *tree)

crypto/libressl/crypto/x509/pcy_tree.c

638

if (!tree)

crypto/libressl/crypto/x509/pcy_tree.c

641

sk_X509_POLICY_NODE_free(tree->auth_policies);

crypto/libressl/crypto/x509/pcy_tree.c

642

sk_X509_POLICY_NODE_pop_free(tree->user_policies, exnode_free);

crypto/libressl/crypto/x509/pcy_tree.c

644

for (i = 0, curr = tree->levels; i < tree->nlevel; i++, curr++) {

crypto/libressl/crypto/x509/pcy_tree.c

653

if (tree->extra_data)

crypto/libressl/crypto/x509/pcy_tree.c

654

sk_X509_POLICY_DATA_pop_free(tree->extra_data,

crypto/libressl/crypto/x509/pcy_tree.c

657

free(tree->levels);

crypto/libressl/crypto/x509/pcy_tree.c

658

free(tree);

crypto/libressl/crypto/x509/pcy_tree.c

675

X509_POLICY_TREE *tree = NULL;

crypto/libressl/crypto/x509/pcy_tree.c

680

ret = tree_init(&tree, certs, flags);

crypto/libressl/crypto/x509/pcy_tree.c

710

if (!tree)

crypto/libressl/crypto/x509/pcy_tree.c

723

if (!tree)

crypto/libressl/crypto/x509/pcy_tree.c

725

ret = tree_evaluate(tree);

crypto/libressl/crypto/x509/pcy_tree.c

727

tree_print("tree_evaluate()", tree, NULL);

crypto/libressl/crypto/x509/pcy_tree.c

734

X509_policy_tree_free(tree);

crypto/libressl/crypto/x509/pcy_tree.c

743

ret = tree_calculate_authority_set(tree, &auth_nodes);

crypto/libressl/crypto/x509/pcy_tree.c

747

ret2 = tree_calculate_user_set(tree, policy_oids, auth_nodes);

crypto/libressl/crypto/x509/pcy_tree.c

756

if (tree)

crypto/libressl/crypto/x509/pcy_tree.c

757

*ptree = tree;

crypto/libressl/crypto/x509/pcy_tree.c

760

nodes = X509_policy_tree_get0_user_policies(tree);

crypto/libressl/crypto/x509/pcy_tree.c

768

X509_policy_tree_free(tree);

crypto/libressl/crypto/x509/pcy_tree.c

96

tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr)

crypto/libressl/crypto/x509/x509_lcl.h

355

X509_POLICY_TREE *tree; /* Valid policy tree */

crypto/libressl/crypto/x509/x509_ncons.c

249

GENERAL_SUBTREE *tree;

crypto/libressl/crypto/x509/x509_ncons.c

255

tree = sk_GENERAL_SUBTREE_value(trees, i);

crypto/libressl/crypto/x509/x509_ncons.c

257

if (tree->base->type == GEN_IPADD)

crypto/libressl/crypto/x509/x509_ncons.c

258

print_nc_ipadd(bp, tree->base->d.ip);

crypto/libressl/crypto/x509/x509_ncons.c

260

GENERAL_NAME_print(bp, tree->base);

crypto/libressl/crypto/x509/x509_vfy.c

1791

X509_policy_tree_free(ctx->tree);

crypto/libressl/crypto/x509/x509_vfy.c

1792

ctx->tree = NULL;

crypto/libressl/crypto/x509/x509_vfy.c

1794

ret = X509_policy_check(&ctx->tree, &ctx->explicit_policy, ctx->chain,

crypto/libressl/crypto/x509/x509_vfy.c

2492

if (ctx->tree != NULL) {

crypto/libressl/crypto/x509/x509_vfy.c

2493

X509_policy_tree_free(ctx->tree);

crypto/libressl/crypto/x509/x509_vfy.c

2494

ctx->tree = NULL;

crypto/libressl/crypto/x509/x509_vfy.c

2576

return ctx->tree;

crypto/libressl/include/openssl/x509_vfy.h

467

void X509_policy_tree_free(X509_POLICY_TREE *tree);

crypto/libressl/include/openssl/x509_vfy.h

469

int X509_policy_tree_level_count(const X509_POLICY_TREE *tree);

crypto/libressl/include/openssl/x509_vfy.h

471

X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i);

crypto/libressl/include/openssl/x509_vfy.h

474

X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree);

crypto/libressl/include/openssl/x509_vfy.h

477

X509_policy_tree_get0_user_policies(const X509_POLICY_TREE *tree);

crypto/openssh/sftp-usergroup.c

65

idname_enter(struct idname_tree *tree, u_int id, const char *name)

crypto/openssh/sftp-usergroup.c

73

if (RB_INSERT(idname_tree, tree, idname) != NULL)

crypto/openssh/sftp-usergroup.c

78

idname_lookup(struct idname_tree *tree, u_int id)

crypto/openssh/sftp-usergroup.c

84

if ((found = RB_FIND(idname_tree, tree, &idname)) != NULL)

crypto/openssh/xmss_hash_address.c

20

void setTreeADRS(uint32_t adrs[8], uint64_t tree){

crypto/openssh/xmss_hash_address.c

21

adrs[1] = (uint32_t) (tree >> 32);

crypto/openssh/xmss_hash_address.c

22

adrs[2] = (uint32_t) tree;

crypto/openssh/xmss_hash_address.h

16

void setTreeADRS(uint32_t adrs[8], uint64_t tree);

lib/libdmsg/msg_lnk.c

1014

RB_FOREACH(node, h2span_node_tree, &cls->tree) {

lib/libdmsg/msg_lnk.c

1015

RB_FOREACH(slink, h2span_link_tree, &node->tree) {

lib/libdmsg/msg_lnk.c

1065

RB_INSERT(h2span_relay_tree, &conn->tree, relay);

lib/libdmsg/msg_lnk.c

1124

RB_REMOVE(h2span_relay_tree, &relay->conn->tree, relay);

lib/libdmsg/msg_lnk.c

1186

if (RB_EMPTY(&cls->tree) && cls->refs == 0) {

lib/libdmsg/msg_lnk.c

119

struct h2span_relay_tree tree;

lib/libdmsg/msg_lnk.c

1227

RB_FOREACH(node, h2span_node_tree, &cls->tree) {

lib/libdmsg/msg_lnk.c

1232

RB_FOREACH(slink, h2span_link_tree, &node->tree) {

lib/libdmsg/msg_lnk.c

1272

RB_FOREACH(node, h2span_node_tree, &cls->tree) {

lib/libdmsg/msg_lnk.c

1273

RB_FOREACH(slink, h2span_link_tree, &node->tree) {

lib/libdmsg/msg_lnk.c

130

struct h2span_node_tree tree;

lib/libdmsg/msg_lnk.c

140

struct h2span_link_tree tree;

lib/libdmsg/msg_lnk.c

422

RB_INIT(&conn->tree);

lib/libdmsg/msg_lnk.c

487

while ((relay = RB_ROOT(&conn->tree)) != NULL) {

lib/libdmsg/msg_lnk.c

577

RB_INIT(&cls->tree);

lib/libdmsg/msg_lnk.c

587

node = RB_FIND(h2span_node_tree, &cls->tree, &dummy_node);

lib/libdmsg/msg_lnk.c

595

RB_INIT(&node->tree);

lib/libdmsg/msg_lnk.c

596

RB_INSERT(h2span_node_tree, &cls->tree, node);

lib/libdmsg/msg_lnk.c

627

RB_INSERT(h2span_link_tree, &node->tree, slink);

lib/libdmsg/msg_lnk.c

679

RB_REMOVE(h2span_link_tree, &node->tree, slink);

lib/libdmsg/msg_lnk.c

680

if (RB_EMPTY(&node->tree)) {

lib/libdmsg/msg_lnk.c

681

RB_REMOVE(h2span_node_tree, &cls->tree, node);

lib/libdmsg/msg_lnk.c

682

if (RB_EMPTY(&cls->tree) && cls->refs == 0) {

lib/libdmsg/msg_lnk.c

769

RB_FOREACH(node, h2span_node_tree, &cls->tree) {

lib/libdmsg/msg_lnk.c

846

RB_SCAN(h2span_relay_tree, &conn->tree,

lib/libdmsg/msg_lnk.c

869

RB_FOREACH(slink, h2span_link_tree, &node->tree) {

lib/libdmsg/msg_lnk.c

902

relay = RB_NEXT(h2span_relay_tree, &conn->tree, relay);

lib/libdmsg/msg_lnk.c

981

relay = RB_NEXT(h2span_relay_tree, &conn->tree, relay);

lib/libdmsg/msg_lnk.c

990

next_relay = RB_NEXT(h2span_relay_tree, &conn->tree, relay);

lib/libevtr/evtr.c

461

prefix ## _map_find(struct id_tree *tree, int id)\

lib/libevtr/evtr.c

465

sid = id_tree_RB_LOOKUP(tree, id); \

lib/libevtr/evtr.c

482

prefix ## _map_insert(struct id_tree *tree, type data, int id) \

lib/libevtr/evtr.c

492

if ((osid = id_tree_RB_INSERT(tree, sid))) { \

sbin/hammer2/zlib/hammer2_zlib_trees.c

140

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

142

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

144

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

145

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

163

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

sbin/hammer2/zlib/hammer2_zlib_trees.c

167

# define send_code(s, c, tree) \

sbin/hammer2/zlib/hammer2_zlib_trees.c

169

send_bits(s, tree[c].Code, tree[c].Len); }

sbin/hammer2/zlib/hammer2_zlib_trees.c

436

#define pqremove(s, tree, top) \

sbin/hammer2/zlib/hammer2_zlib_trees.c

440

pqdownheap(s, tree, SMALLEST); \

sbin/hammer2/zlib/hammer2_zlib_trees.c

447

#define smaller(tree, n, m, depth) \

sbin/hammer2/zlib/hammer2_zlib_trees.c

448

(tree[n].Freq < tree[m].Freq || \

sbin/hammer2/zlib/hammer2_zlib_trees.c

449

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

sbin/hammer2/zlib/hammer2_zlib_trees.c

459

pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */

sbin/hammer2/zlib/hammer2_zlib_trees.c

466

smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {

sbin/hammer2/zlib/hammer2_zlib_trees.c

470

if (smaller(tree, v, s->heap[j], s->depth)) break;

sbin/hammer2/zlib/hammer2_zlib_trees.c

495

ct_data *tree = desc->dyn_tree;

sbin/hammer2/zlib/hammer2_zlib_trees.c

513

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

sbin/hammer2/zlib/hammer2_zlib_trees.c

517

bits = tree[tree[n].Dad].Len + 1;

sbin/hammer2/zlib/hammer2_zlib_trees.c

519

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

527

f = tree[n].Freq;

sbin/hammer2/zlib/hammer2_zlib_trees.c

559

if ((unsigned) tree[m].Len != (unsigned) bits) {

sbin/hammer2/zlib/hammer2_zlib_trees.c

560

Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

sbin/hammer2/zlib/hammer2_zlib_trees.c

561

s->opt_len += ((long)bits - (long)tree[m].Len)

sbin/hammer2/zlib/hammer2_zlib_trees.c

562

*(long)tree[m].Freq;

sbin/hammer2/zlib/hammer2_zlib_trees.c

563

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

580

gen_codes (ct_data *tree, int max_code, ushf *bl_count)

sbin/hammer2/zlib/hammer2_zlib_trees.c

604

int len = tree[n].Len;

sbin/hammer2/zlib/hammer2_zlib_trees.c

607

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

609

Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",

sbin/hammer2/zlib/hammer2_zlib_trees.c

610

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

sbin/hammer2/zlib/hammer2_zlib_trees.c

626

ct_data *tree = desc->dyn_tree;

sbin/hammer2/zlib/hammer2_zlib_trees.c

640

if (tree[n].Freq != 0) {

sbin/hammer2/zlib/hammer2_zlib_trees.c

644

tree[n].Len = 0;

sbin/hammer2/zlib/hammer2_zlib_trees.c

655

tree[node].Freq = 1;

sbin/hammer2/zlib/hammer2_zlib_trees.c

665

for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

sbin/hammer2/zlib/hammer2_zlib_trees.c

672

pqremove(s, tree, n); /* n = node of least frequency */

sbin/hammer2/zlib/hammer2_zlib_trees.c

679

tree[node].Freq = tree[n].Freq + tree[m].Freq;

sbin/hammer2/zlib/hammer2_zlib_trees.c

682

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

684

if (tree == s->bl_tree) {

sbin/hammer2/zlib/hammer2_zlib_trees.c

686

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

sbin/hammer2/zlib/hammer2_zlib_trees.c

691

pqdownheap(s, tree, SMALLEST);

sbin/hammer2/zlib/hammer2_zlib_trees.c

703

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

712

scan_tree (deflate_state *s, ct_data *tree, int max_code)

sbin/hammer2/zlib/hammer2_zlib_trees.c

719

int nextlen = tree[0].Len; /* length of next code */

sbin/hammer2/zlib/hammer2_zlib_trees.c

725

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

728

curlen = nextlen; nextlen = tree[n+1].Len;

sbin/hammer2/zlib/hammer2_zlib_trees.c

758

send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */

sbin/hammer2/zlib/hammer2_zlib_trees.c

763

int nextlen = tree[0].Len; /* length of next code */

sbin/hammer2/zlib/hammer2_zlib_trees.c

772

curlen = nextlen; nextlen = tree[n+1].Len;

sys/bus/u4b/wlan/if_urtwn.c

681

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/bus/u4b/wlan/if_urtwn.c

683

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/apple/fw/apple_fw_sysctl.c

20

struct sysctl_oid *tree;

sys/dev/apple/fw/apple_fw_sysctl.c

29

tree = device_get_sysctl_tree(dev);

sys/dev/apple/fw/apple_fw_sysctl.c

32

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/apple/fw/apple_fw_sysctl.c

37

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/apple/fw/apple_fw_sysctl.c

42

ssdt_tree = SYSCTL_ADD_NODE(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/apple/fw/apple_fw_sysctl.c

54

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/apple/fw/apple_fw_sysctl.c

59

dsm_tree = SYSCTL_ADD_NODE(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/apple/smc/smc.c

1176

struct sysctl_oid *tree;

sys/dev/apple/smc/smc.c

1181

tree = SYSCTL_ADD_NODE(ctx,

sys/dev/apple/smc/smc.c

1185

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/isp/isp_freebsd.c

179

struct sysctl_oid *tree = device_get_sysctl_tree(isp->isp_osinfo.dev);

sys/dev/disk/isp/isp_freebsd.c

180

SYSCTL_ADD_QUAD(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "wwnn", CTLFLAG_RD, &FCPARAM(isp, 0)->isp_wwnn, 0, "World Wide Node Name");

sys/dev/disk/isp/isp_freebsd.c

181

SYSCTL_ADD_QUAD(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "wwpn", CTLFLAG_RD, &FCPARAM(isp, 0)->isp_wwpn, 0, "World Wide Port Name");

sys/dev/disk/isp/isp_freebsd.c

182

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "loop_down_limit", CTLFLAG_RW, &ISP_FC_PC(isp, 0)->loop_down_limit, 0, "Loop Down Limit");

sys/dev/disk/isp/isp_freebsd.c

183

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "gone_device_time", CTLFLAG_RW, &ISP_FC_PC(isp, 0)->gone_device_time, 0, "Gone Device Time");

sys/dev/disk/mpt/mpt.c

2152

struct sysctl_oid *tree = device_get_sysctl_tree(mpt->dev);

sys/dev/disk/mpt/mpt.c

2154

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/mpt/mpt.c

2157

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/mpt/mpt.c

2161

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/mpt/mpt_cam.c

416

struct sysctl_oid *tree;

sys/dev/disk/mpt/mpt_cam.c

476

tree = device_get_sysctl_tree(mpt->dev);

sys/dev/disk/mpt/mpt_cam.c

488

SYSCTL_ADD_STRING(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/mpt/mpt_cam.c

492

SYSCTL_ADD_STRING(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/mpt/mpt_raid.c

1841

struct sysctl_oid *tree = device_get_sysctl_tree(mpt->dev);

sys/dev/disk/mpt/mpt_raid.c

1843

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/mpt/mpt_raid.c

1848

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/mpt/mpt_raid.c

1853

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/disk/mpt/mpt_raid.c

1857

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

114

struct mpcc *mpc1_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id)

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

116

struct mpcc *tmp_mpcc = tree->opp_list;

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

178

struct mpc_tree *tree,

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

194

struct mpcc *temp_mpcc = tree->opp_list;

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

217

REG_SET(MPCC_OPP_ID[mpcc_id], 0, MPCC_OPP_ID, tree->opp_id);

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

220

if (tree->opp_list == insert_above_mpcc) {

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

222

tree->opp_list = new_mpcc;

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

223

REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, mpcc_id);

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

226

struct mpcc *temp_mpcc = tree->opp_list;

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

266

struct mpc_tree *tree,

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

273

if (tree->opp_list == mpcc_to_remove) {

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

278

tree->opp_list = mpcc_to_remove->mpcc_bot;

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

279

REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, tree->opp_list->mpcc_id);

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

282

tree->opp_list = NULL;

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

283

REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, 0xf);

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

287

struct mpcc *temp_mpcc = tree->opp_list;

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

369

struct mpc_tree *tree)

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

380

REG_GET(MUX[tree->opp_id], MPC_OUT_MUX, &out_mux);

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

391

if ((opp_id == tree->opp_id) && (top_sel != 0xf)) {

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

397

tree->opp_list = mpcc;

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.c

402

if ((opp_id == tree->opp_id) && (top_sel != 0xf)) {

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.h

137

struct mpc_tree *tree,

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.h

146

struct mpc_tree *tree,

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.h

176

struct mpc_tree *tree);

sys/dev/drm/amd/display/dc/dcn10/dcn10_mpc.h

183

struct mpc_tree *tree,

sys/dev/drm/amd/display/dc/inc/hw/mpc.h

144

struct mpc_tree *tree,

sys/dev/drm/amd/display/dc/inc/hw/mpc.h

163

struct mpc_tree *tree,

sys/dev/drm/amd/display/dc/inc/hw/mpc.h

192

struct mpc_tree *tree,

sys/dev/drm/amd/display/dc/inc/hw/mpc.h

201

struct mpc_tree *tree);

sys/dev/misc/ipmi/ipmi.c

802

struct sysctl_oid *tree;

sys/dev/misc/ipmi/ipmi.c

816

tree = device_get_sysctl_tree(dev);

sys/dev/misc/ipmi/ipmi.c

817

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/age/if_age.c

717

struct sysctl_oid *tree = device_get_sysctl_tree(sc->age_dev);

sys/dev/netif/age/if_age.c

720

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/age/if_age.c

724

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/alc/if_alc.c

1656

struct sysctl_oid *tree;

sys/dev/netif/alc/if_alc.c

1715

tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", CTLFLAG_RD,

sys/dev/netif/alc/if_alc.c

1717

parent = SYSCTL_CHILDREN(tree);

sys/dev/netif/alc/if_alc.c

1720

tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "rx", CTLFLAG_RD,

sys/dev/netif/alc/if_alc.c

1722

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/alc/if_alc.c

1774

tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "tx", CTLFLAG_RD,

sys/dev/netif/alc/if_alc.c

1776

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ale/if_ale.c

697

struct sysctl_oid *tree;

sys/dev/netif/ale/if_ale.c

746

tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", CTLFLAG_RD,

sys/dev/netif/ale/if_ale.c

748

parent = SYSCTL_CHILDREN(tree);

sys/dev/netif/ale/if_ale.c

751

tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "rx", CTLFLAG_RD,

sys/dev/netif/ale/if_ale.c

753

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ale/if_ale.c

805

tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "tx", CTLFLAG_RD,

sys/dev/netif/ale/if_ale.c

807

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1033

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1034

struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1038

tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "rx_phy_err", CTLFLAG_RD, NULL, "Per-code RX PHY Errors");

sys/dev/netif/ath/ath/if_ath_sysctl.c

1039

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1051

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1052

struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1056

tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "sync_intr",

sys/dev/netif/ath/ath/if_ath_sysctl.c

1058

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1069

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1071

struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1074

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

1079

tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", CTLFLAG_RD,

sys/dev/netif/ath/ath/if_ath_sysctl.c

1081

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1318

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1320

struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

1322

tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "hal", CTLFLAG_RD,

sys/dev/netif/ath/ath/if_ath_sysctl.c

1324

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

786

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath/if_ath_sysctl.c

788

struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

790

tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "alq", CTLFLAG_RD,

sys/dev/netif/ath/ath/if_ath_sysctl.c

792

child = SYSCTL_CHILDREN(tree);

sys/dev/netif/ath/ath/if_ath_sysctl.c

797

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

801

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

805

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

815

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath/if_ath_sysctl.c

818

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

821

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

825

SYSCTL_ADD_QUAD(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

833

SYSCTL_ADD_QUAD(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

840

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

843

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

846

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

850

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

853

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

856

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

859

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

863

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

867

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

870

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

874

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

877

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

881

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

885

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

888

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

891

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

895

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

898

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

901

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

906

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

909

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

914

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

918

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

922

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

927

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

932

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

936

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

939

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

942

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

945

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

950

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

953

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

957

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

962

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

966

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

970

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

976

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

985

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

989

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

992

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

995

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath/if_ath_sysctl.c

998

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/amrr/amrr.c

439

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath_rate/amrr/amrr.c

441

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/amrr/amrr.c

445

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/amrr/amrr.c

448

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/onoe/onoe.c

399

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath_rate/onoe/onoe.c

401

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/onoe/onoe.c

405

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/onoe/onoe.c

408

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/sample/sample.c

1369

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/ath/ath_rate/sample/sample.c

1371

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/sample/sample.c

1375

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ath/ath_rate/sample/sample.c

1380

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/bge/if_bge.c

2033

struct sysctl_oid *tree;

sys/dev/netif/bge/if_bge.c

2600

tree = device_get_sysctl_tree(sc->bge_dev);

sys/dev/netif/bge/if_bge.c

2602

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "rx_coal_ticks",

sys/dev/netif/bge/if_bge.c

2606

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "tx_coal_ticks",

sys/dev/netif/bge/if_bge.c

2610

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "rx_coal_bds",

sys/dev/netif/bge/if_bge.c

2614

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "tx_coal_bds",

sys/dev/netif/bge/if_bge.c

2619

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "tx_wreg", CTLFLAG_RW,

sys/dev/netif/bge/if_bge.c

2640

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/bge/if_bge.c

2647

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/bge/if_bge.c

2652

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/bge/if_bge.c

2658

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/bge/if_bge.c

2662

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/bge/if_bge.c

2677

ifpoll_compat_setup(&sc->bge_npoll, ctx, tree,

sys/dev/netif/bnx/if_bnx.c

1872

struct sysctl_oid_list *tree;

sys/dev/netif/bnx/if_bnx.c

2311

tree = SYSCTL_CHILDREN(device_get_sysctl_tree(sc->bnx_dev));

sys/dev/netif/bnx/if_bnx.c

2313

SYSCTL_ADD_INT(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2315

SYSCTL_ADD_INT(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2318

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "rx_coal_ticks",

sys/dev/netif/bnx/if_bnx.c

2322

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "tx_coal_ticks",

sys/dev/netif/bnx/if_bnx.c

2326

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "rx_coal_bds",

sys/dev/netif/bnx/if_bnx.c

2330

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "rx_coal_bds_poll",

sys/dev/netif/bnx/if_bnx.c

2334

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "tx_coal_bds",

sys/dev/netif/bnx/if_bnx.c

2338

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "tx_coal_bds_poll",

sys/dev/netif/bnx/if_bnx.c

2358

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2363

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2368

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2373

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2377

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2383

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "tx_cpumap",

sys/dev/netif/bnx/if_bnx.c

2387

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "rx_cpumap",

sys/dev/netif/bnx/if_bnx.c

2393

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "tx_poll_cpumap",

sys/dev/netif/bnx/if_bnx.c

2397

SYSCTL_ADD_PROC(ctx, tree, OID_AUTO, "rx_poll_cpumap",

sys/dev/netif/bnx/if_bnx.c

2405

SYSCTL_ADD_INT(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2408

SYSCTL_ADD_INT(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2411

SYSCTL_ADD_INT(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2415

SYSCTL_ADD_ULONG(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2419

SYSCTL_ADD_ULONG(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2427

SYSCTL_ADD_ULONG(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2432

SYSCTL_ADD_ULONG(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2435

SYSCTL_ADD_ULONG(ctx, tree, OID_AUTO,

sys/dev/netif/bnx/if_bnx.c

2441

SYSCTL_ADD_ULONG(ctx, tree, OID_AUTO,

sys/dev/netif/em/if_em.c

4355

struct sysctl_oid *tree;

sys/dev/netif/em/if_em.c

4358

tree = device_get_sysctl_tree(adapter->dev);

sys/dev/netif/em/if_em.c

4359

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/em/if_em.c

4363

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/em/if_em.c

4367

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/em/if_em.c

4370

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/em/if_em.c

4375

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/em/if_em.c

4381

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/em/if_em.c

4386

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/em/if_em.c

4390

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "tx_nmbuf",

sys/dev/netif/em/if_em.c

4392

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "tx_gc",

sys/dev/netif/emx/if_emx.c

3882

struct sysctl_oid *tree;

sys/dev/netif/emx/if_emx.c

3887

tree = device_get_sysctl_tree(sc->dev);

sys/dev/netif/emx/if_emx.c

3888

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3892

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3896

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3899

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3903

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3906

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3909

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3914

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3917

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3920

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3925

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3929

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3936

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/emx/if_emx.c

3941

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/emx/if_emx.c

3949

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/emx/if_emx.c

3955

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/emx/if_emx.c

3959

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/et/if_et.c

238

struct sysctl_oid *tree;

sys/dev/netif/et/if_et.c

305

tree = device_get_sysctl_tree(dev);

sys/dev/netif/et/if_et.c

306

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/et/if_et.c

310

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/et/if_et.c

314

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/et/if_et.c

317

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/fxp/if_fxp.c

394

struct sysctl_oid *tree;

sys/dev/netif/fxp/if_fxp.c

505

tree = device_get_sysctl_tree(dev);

sys/dev/netif/fxp/if_fxp.c

506

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/fxp/if_fxp.c

510

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/fxp/if_fxp.c

659

ifpoll_compat_setup(&sc->fxp_npoll, ctx, (struct sysctl_oid *)tree,

sys/dev/netif/igb/if_igb.c

1663

struct sysctl_oid *tree;

sys/dev/netif/igb/if_igb.c

1668

tree = device_get_sysctl_tree(sc->dev);

sys/dev/netif/igb/if_igb.c

1669

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1671

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1674

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1676

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1679

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1682

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1699

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1704

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1709

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1715

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1719

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1725

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1729

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1736

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/igb/if_igb.c

1742

SYSCTL_CHILDREN(tree), OID_AUTO, node,

sys/dev/netif/igb/if_igb.c

1751

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, node,

sys/dev/netif/igb/if_igb.c

1755

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, node,

sys/dev/netif/igb/if_igb.c

1759

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, node,

sys/dev/netif/igb/if_igb.c

1763

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/iwi/if_iwi.c

3422

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/iwi/if_iwi.c

3424

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "radio",

sys/dev/netif/iwi/if_iwi.c

3428

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "stats",

sys/dev/netif/iwi/if_iwi.c

3433

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "bluetooth",

sys/dev/netif/iwi/if_iwi.c

3437

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "antenna",

sys/dev/netif/iwi/if_iwi.c

3596

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/iwi/if_iwi.c

3607

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/iwi/if_iwi.c

3610

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/iwi/if_iwi.c

3613

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/iwi/if_iwi.c

3617

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/iwn/if_iwn.c

1374

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/iwn/if_iwn.c

1376

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/ix/if_ix.c

4182

struct sysctl_oid *tree = device_get_sysctl_tree(sc->dev);

sys/dev/netif/ix/if_ix.c

4186

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4188

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4191

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4193

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4196

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4200

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4204

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4208

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4212

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4216

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4220

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4224

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4230

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4234

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4254

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/ix/if_ix.c

4260

SYSCTL_CHILDREN(tree), OID_AUTO, node,

sys/dev/netif/ix/if_ix.c

4268

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, node,

sys/dev/netif/ix/if_ix.c

4273

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, node,

sys/dev/netif/jme/if_jme.c

1125

struct sysctl_oid *tree;

sys/dev/netif/jme/if_jme.c

1131

tree = device_get_sysctl_tree(sc->jme_dev);

sys/dev/netif/jme/if_jme.c

1132

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1136

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1140

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1144

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1148

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1152

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1156

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1160

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1166

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1170

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1176

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1180

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1188

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1196

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/jme/if_jme.c

1202

SYSCTL_ADD_ULONG(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/msk/if_msk.c

1482

struct sysctl_oid *tree;

sys/dev/netif/msk/if_msk.c

1593

tree = device_get_sysctl_tree(dev);

sys/dev/netif/msk/if_msk.c

1594

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/msk/if_msk.c

1598

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/msk/if_msk.c

1602

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/msk/if_msk.c

1605

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/msk/if_msk.c

1608

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/nfe/if_nfe.c

465

struct sysctl_oid *tree;

sys/dev/netif/nfe/if_nfe.c

584

tree = device_get_sysctl_tree(dev);

sys/dev/netif/nfe/if_nfe.c

585

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/nfe/if_nfe.c

590

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/nfe/if_nfe.c

593

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/nfe/if_nfe.c

596

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/nfe/if_nfe.c

643

ifpoll_compat_setup(&sc->sc_npoll, ctx, (struct sysctl_oid *)tree,

sys/dev/netif/oce/oce_sysctl.c

73

struct sysctl_oid *tree = device_get_sysctl_tree(sc->dev);

sys/dev/netif/oce/oce_sysctl.c

74

struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree);

sys/dev/netif/re/if_re.c

599

struct sysctl_oid *tree;

sys/dev/netif/re/if_re.c

655

tree = device_get_sysctl_tree(dev);

sys/dev/netif/re/if_re.c

656

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/re/if_re.c

659

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/re/if_re.c

662

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "sim_time",

sys/dev/netif/re/if_re.c

666

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, "imtype",

sys/dev/netif/re/if_re.c

673

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/re/if_re.c

679

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree),

sys/dev/netif/re/if_re.c

853

ifpoll_compat_setup(&sc->re_npoll, ctx, (struct sysctl_oid *)tree,

sys/dev/netif/stge/if_stge.c

574

struct sysctl_oid *tree;

sys/dev/netif/stge/if_stge.c

660

tree = device_get_sysctl_tree(dev);

sys/dev/netif/stge/if_stge.c

661

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/stge/if_stge.c

665

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/netif/stge/if_stge.c

759

ifpoll_compat_setup(&sc->sc_npoll, ctx, (struct sysctl_oid *)tree,

sys/dev/netif/wpi/if_wpi.c

607

struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);

sys/dev/netif/wpi/if_wpi.c

609

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/dev/raid/amr/amr.c

350

struct sysctl_oid *tree = device_get_sysctl_tree(sc->amr_dev);

sys/dev/raid/amr/amr.c

352

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/raid/amr/amr.c

355

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/raid/amr/amr.c

358

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/raid/amr/amr.c

361

SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree),

sys/dev/raid/hpt27xx/him.h

59

HPT_U8 tree;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

87

hba->pciaddr.tree = 0;

sys/dev/raid/hptrr/him.h

61

HPT_U8 tree;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

102

hba->pciaddr.tree = 0;

sys/dev/virtual/amazon/ena/ena_sysctl.c

102

struct sysctl_oid *tree;

sys/dev/virtual/amazon/ena/ena_sysctl.c

117

tree = device_get_sysctl_tree(dev);

sys/dev/virtual/amazon/ena/ena_sysctl.c

118

child = SYSCTL_CHILDREN(tree);

sys/dev/virtual/amazon/ena/ena_sysctl.c

55

struct sysctl_oid *tree;

sys/dev/virtual/amazon/ena/ena_sysctl.c

61

tree = device_get_sysctl_tree(dev);

sys/dev/virtual/amazon/ena/ena_sysctl.c

62

child = SYSCTL_CHILDREN(tree);

sys/dev/virtual/virtio/balloon/virtio_balloon.c

894

struct sysctl_oid *tree;

sys/dev/virtual/virtio/balloon/virtio_balloon.c

901

tree = device_get_sysctl_tree(dev);

sys/dev/virtual/virtio/balloon/virtio_balloon.c

902

child = SYSCTL_CHILDREN(tree);

sys/dev/virtual/virtio/block/virtio_blk.c

1214

struct sysctl_oid *tree;

sys/dev/virtual/virtio/block/virtio_blk.c

1219

tree = device_get_sysctl_tree(dev);

sys/dev/virtual/virtio/block/virtio_blk.c

1220

child = SYSCTL_CHILDREN(tree);

sys/dev/virtual/virtio/net/if_vtnet.c

2782

struct sysctl_oid *tree;

sys/dev/virtual/virtio/net/if_vtnet.c

2788

tree = device_get_sysctl_tree(dev);

sys/dev/virtual/virtio/net/if_vtnet.c

2789

child = SYSCTL_CHILDREN(tree);

sys/dev/virtual/virtio/scsi/virtio_scsi.c

2378

struct sysctl_oid *tree;

sys/dev/virtual/virtio/scsi/virtio_scsi.c

2384

tree = device_get_sysctl_tree(dev);

sys/dev/virtual/virtio/scsi/virtio_scsi.c

2385

child = SYSCTL_CHILDREN(tree);

sys/dev/virtual/vmware/vmxnet3/if_vmx.c

3835

struct sysctl_oid *tree;

sys/dev/virtual/vmware/vmxnet3/if_vmx.c

3840

tree = device_get_sysctl_tree(dev);

sys/dev/virtual/vmware/vmxnet3/if_vmx.c

3841

child = SYSCTL_CHILDREN(tree);

sys/net/ipfw3_nat/ip_fw3_nat.c

436

pick_alias_port(struct nat_state *s, struct state_tree *tree)

sys/net/ipfw3_nat/ip_fw3_nat.c

440

} while (RB_FIND(state_tree, tree, s) != NULL);

sys/net/ipfw3_nat/ip_fw3_nat.h

167

void pick_alias_port(struct nat_state *s, struct state_tree *tree);

sys/net/pf/pf_norm.c

288

pf_find_fragment(struct ip *ip, struct pf_frag_tree *tree)

sys/net/pf/pf_norm.c

296

frag = RB_FIND(pf_frag_tree, tree, &key);

sys/net/zlib.c

1960

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

sys/net/zlib.c

1962

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

sys/net/zlib.c

1964

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

sys/net/zlib.c

1965

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

sys/net/zlib.c

1979

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

sys/net/zlib.c

1983

# define send_code(s, c, tree) \

sys/net/zlib.c

1985

send_bits(s, tree[c].Code, tree[c].Len); }

sys/net/zlib.c

2184

#define pqremove(s, tree, top) \

sys/net/zlib.c

2188

pqdownheap(s, tree, SMALLEST); \

sys/net/zlib.c

2195

#define smaller(tree, n, m, depth) \

sys/net/zlib.c

2196

(tree[n].Freq < tree[m].Freq || \

sys/net/zlib.c

2197

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

sys/net/zlib.c

2210

pqdownheap(deflate_state *s, ct_data *tree, int k)

sys/net/zlib.c

2217

smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {

sys/net/zlib.c

2221

if (smaller(tree, v, s->heap[j], s->depth)) break;

sys/net/zlib.c

2248

ct_data *tree = desc->dyn_tree;

sys/net/zlib.c

2266

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

sys/net/zlib.c

2270

bits = tree[tree[n].Dad].Len + 1;

sys/net/zlib.c

2272

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

sys/net/zlib.c

2280

f = tree[n].Freq;

sys/net/zlib.c

2312

if (tree[m].Len != (unsigned) bits) {

sys/net/zlib.c

2313

Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

sys/net/zlib.c

2314

s->opt_len += ((long)bits - (long)tree[m].Len)

sys/net/zlib.c

2315

*(long)tree[m].Freq;

sys/net/zlib.c

2316

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

sys/net/zlib.c

2337

gen_codes(ct_data *tree, int max_code, ushf *bl_count)

sys/net/zlib.c

2358

int len = tree[n].Len;

sys/net/zlib.c

2361

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

sys/net/zlib.c

2363

Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",

sys/net/zlib.c

2364

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

sys/net/zlib.c

2382

ct_data *tree = desc->dyn_tree;

sys/net/zlib.c

2396

if (tree[n].Freq != 0) {

sys/net/zlib.c

2400

tree[n].Len = 0;

sys/net/zlib.c

2411

tree[node].Freq = 1;

sys/net/zlib.c

2421

for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

sys/net/zlib.c

2428

pqremove(s, tree, n); /* n = node of least frequency */

sys/net/zlib.c

2435

tree[node].Freq = tree[n].Freq + tree[m].Freq;

sys/net/zlib.c

2437

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

sys/net/zlib.c

2439

if (tree == s->bl_tree) {

sys/net/zlib.c

2441

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

sys/net/zlib.c

2446

pqdownheap(s, tree, SMALLEST);

sys/net/zlib.c

2458

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

sys/net/zlib.c

2470

scan_tree (deflate_state *s, ct_data *tree, int max_code)

sys/net/zlib.c

2475

int nextlen = tree[0].Len; /* length of next code */

sys/net/zlib.c

2481

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

sys/net/zlib.c

2484

curlen = nextlen; nextlen = tree[n+1].Len;

sys/net/zlib.c

2517

send_tree(deflate_state *s, ct_data *tree, int max_code)

sys/net/zlib.c

2522

int nextlen = tree[0].Len; /* length of next code */

sys/net/zlib.c

2531

curlen = nextlen; nextlen = tree[n+1].Len;

sys/net/zlib.c

4665

inflate_huft *tree; /* pointer into tree */

sys/net/zlib.c

4743

c->sub.code.tree = c->ltree;

sys/net/zlib.c

4748

t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);

sys/net/zlib.c

4770

c->sub.code.tree = t->next;

sys/net/zlib.c

4789

c->sub.code.tree = c->dtree;

sys/net/zlib.c

4795

t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);

sys/net/zlib.c

4808

c->sub.code.tree = t->next;

sys/netproto/802_11/wlan/ieee80211_amrr.c

406

struct sysctl_ctx_list *ctx, struct sysctl_oid *tree)

sys/netproto/802_11/wlan/ieee80211_amrr.c

410

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/netproto/802_11/wlan/ieee80211_amrr.c

414

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/netproto/802_11/wlan/ieee80211_amrr.c

417

SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/netproto/802_11/wlan/ieee80211_rssadapt.c

357

struct sysctl_ctx_list *ctx, struct sysctl_oid *tree)

sys/netproto/802_11/wlan/ieee80211_rssadapt.c

360

SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

140

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

142

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

144

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

145

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

163

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

167

# define send_code(s, c, tree) \

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

169

send_bits(s, tree[c].Code, tree[c].Len); }

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

436

#define pqremove(s, tree, top) \

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

440

pqdownheap(s, tree, SMALLEST); \

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

447

#define smaller(tree, n, m, depth) \

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

448

(tree[n].Freq < tree[m].Freq || \

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

449

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

459

pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

466

smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

470

if (smaller(tree, v, s->heap[j], s->depth)) break;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

495

ct_data *tree = desc->dyn_tree;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

513

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

517

bits = tree[tree[n].Dad].Len + 1;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

519

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

527

f = tree[n].Freq;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

559

if ((unsigned) tree[m].Len != (unsigned) bits) {

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

560

Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

561

s->opt_len += ((long)bits - (long)tree[m].Len)

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

562

*(long)tree[m].Freq;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

563

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

580

gen_codes (ct_data *tree, int max_code, ushf *bl_count)

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

604

int len = tree[n].Len;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

607

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

609

Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

610

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

626

ct_data *tree = desc->dyn_tree;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

640

if (tree[n].Freq != 0) {

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

644

tree[n].Len = 0;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

655

tree[node].Freq = 1;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

665

for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

672

pqremove(s, tree, n); /* n = node of least frequency */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

679

tree[node].Freq = tree[n].Freq + tree[m].Freq;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

682

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

684

if (tree == s->bl_tree) {

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

686

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

691

pqdownheap(s, tree, SMALLEST);

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

703

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

712

scan_tree (deflate_state *s, ct_data *tree, int max_code)

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

719

int nextlen = tree[0].Len; /* length of next code */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

725

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

728

curlen = nextlen; nextlen = tree[n+1].Len;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

758

send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

763

int nextlen = tree[0].Len; /* length of next code */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

772

curlen = nextlen; nextlen = tree[n+1].Len;

test/debug/mbufinfo.c

138

kkread(kd, Nl[0].n_value, &tree, sizeof(tree));

test/debug/mbufinfo.c

139

if (tree.rbh_root)

test/debug/mbufinfo.c

140

dumpmb(kd, tree.rbh_root);

test/debug/mbufinfo.c

93

struct mbuf_rb_tree tree;

usr.bin/bc/bc.y

751

struct tree *p;

usr.bin/bc/bc.y

95

static struct tree *instructions = NULL;

usr.bin/find/extern.h

121

extern FTS *tree;

usr.bin/find/find.c

163

FTS *tree; /* pointer to top of FTS hierarchy */

usr.bin/find/find.c

177

tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL));

usr.bin/find/find.c

178

if (tree == NULL)

usr.bin/find/find.c

181

for (rval = 0; (entry = fts_read(tree)) != NULL;) {

usr.bin/find/find.c

183

if (fts_set(tree, entry, FTS_SKIP))

usr.bin/find/function.c

1316

if (fts_set(tree, entry, FTS_SKIP))

usr.bin/gzip/unpack.c

104

free(unpackd->tree);

usr.bin/gzip/unpack.c

189

unpackd->tree =

usr.bin/gzip/unpack.c

190

calloc(unpackd->treelevels, (sizeof (*(unpackd->tree))));

usr.bin/gzip/unpack.c

192

unpackd->tree == NULL)

usr.bin/gzip/unpack.c

226

unpackd->tree[i] = unpackd->symbol_eob;

usr.bin/gzip/unpack.c

286

&(unpackd->tree[thislevel][inlevelindex]);

usr.bin/gzip/unpack.c

81

char **tree; /* Decoding huffman tree (pointers to

usr.bin/undo/undo.c

102

static void clean_tree(struct undo_hist_entry_rb_tree *tree);

usr.bin/undo/undo.c

541

clean_tree(struct undo_hist_entry_rb_tree *tree)

usr.bin/undo/undo.c

545

while ((tse = RB_ROOT(tree)) != NULL) {

usr.bin/undo/undo.c

546

RB_REMOVE(undo_hist_entry_rb_tree, tree, tse);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

140

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

142

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

144

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

145

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

163

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

167

# define send_code(s, c, tree) \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

169

send_bits(s, tree[c].Code, tree[c].Len); }

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

436

#define pqremove(s, tree, top) \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

440

pqdownheap(s, tree, SMALLEST); \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

447

#define smaller(tree, n, m, depth) \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

448

(tree[n].Freq < tree[m].Freq || \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

449

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

459

pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

466

smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

470

if (smaller(tree, v, s->heap[j], s->depth)) break;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

495

ct_data *tree = desc->dyn_tree;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

513

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

517

bits = tree[tree[n].Dad].Len + 1;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

519

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

527

f = tree[n].Freq;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

559

if ((unsigned) tree[m].Len != (unsigned) bits) {

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

560

Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

561

s->opt_len += ((long)bits - (long)tree[m].Len)

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

562

*(long)tree[m].Freq;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

563

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

580

gen_codes (ct_data *tree, int max_code, ushf *bl_count)

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

604

int len = tree[n].Len;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

607

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

609

Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

610

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

626

ct_data *tree = desc->dyn_tree;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

640

if (tree[n].Freq != 0) {

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

644

tree[n].Len = 0;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

655

tree[node].Freq = 1;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

665

for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

672

pqremove(s, tree, n); /* n = node of least frequency */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

679

tree[node].Freq = tree[n].Freq + tree[m].Freq;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

682

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

684

if (tree == s->bl_tree) {

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

686

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

691

pqdownheap(s, tree, SMALLEST);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

703

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

712

scan_tree (deflate_state *s, ct_data *tree, int max_code)

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

719

int nextlen = tree[0].Len; /* length of next code */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

725

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

728

curlen = nextlen; nextlen = tree[n+1].Len;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

758

send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

763

int nextlen = tree[0].Len; /* length of next code */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

772

curlen = nextlen; nextlen = tree[n+1].Len;