drivers/scsi/qla2xxx/qla_def.h

4879

#define RX_ELS_SIZE (roundup(sizeof(struct enode) + ELS_MAX_PAYLOAD, SMP_CACHE_BYTES))

drivers/scsi/qla2xxx/qla_edif.c

1844

qla_enode_free(scsi_qla_host_t *vha, struct enode *node)

drivers/scsi/qla2xxx/qla_edif.c

1887

struct enode *node, *q;

drivers/scsi/qla2xxx/qla_edif.c

1915

struct enode *e, *tmp;

drivers/scsi/qla2xxx/qla_edif.c

1951

static struct enode *

drivers/scsi/qla2xxx/qla_edif.c

1954

struct enode *node;

drivers/scsi/qla2xxx/qla_edif.c

1971

qla_enode_add(scsi_qla_host_t *vha, struct enode *ptr)

drivers/scsi/qla2xxx/qla_edif.c

1986

static struct enode *

drivers/scsi/qla2xxx/qla_edif.c

1989

struct enode *node_rtn = NULL;

drivers/scsi/qla2xxx/qla_edif.c

1990

struct enode *list_node, *q;

drivers/scsi/qla2xxx/qla_edif.c

2028

struct enode *ptr;

drivers/scsi/qla2xxx/qla_edif.c

2538

struct enode *ptr;

drivers/scsi/qla2xxx/qla_edif.h

133

#define RX_ELS_SIZE (roundup(sizeof(struct enode) + ELS_MAX_PAYLOAD, SMP_CACHE_BYTES))

kernel/trace/trace_boot.c

463

struct xbc_node *enode)

kernel/trace/trace_boot.c

471

event = xbc_node_get_data(enode);

kernel/trace/trace_boot.c

474

if (trace_boot_add_kprobe_event(enode, event) < 0)

kernel/trace/trace_boot.c

477

if (trace_boot_add_synth_event(enode, event) < 0)

kernel/trace/trace_boot.c

487

p = xbc_node_find_value(enode, "filter", NULL);

kernel/trace/trace_boot.c

496

xbc_node_for_each_array_value(enode, "actions", anode, p) {

kernel/trace/trace_boot.c

502

anode = xbc_node_find_subkey(enode, "hist");

kernel/trace/trace_boot.c

505

} else if (xbc_node_find_value(enode, "actions", NULL))

kernel/trace/trace_boot.c

508

if (xbc_node_find_value(enode, "enable", NULL)) {

kernel/trace/trace_boot.c

520

struct xbc_node *gnode, *enode;

kernel/trace/trace_boot.c

535

xbc_node_for_each_subkey(gnode, enode) {

kernel/trace/trace_boot.c

536

data = xbc_node_get_data(enode);

kernel/trace/trace_boot.c

541

trace_boot_init_one_event(tr, gnode, enode);

lib/maple_tree.c

1975

struct maple_enode *enode)

lib/maple_tree.c

1977

if (enode) {

lib/maple_tree.c

1978

mas->node = enode;

lib/maple_tree.c

2303

struct maple_enode *enode;

lib/maple_tree.c

2308

enode = tmp_mas->node;

lib/maple_tree.c

2309

tmp = mte_to_node(enode);

lib/maple_tree.c

2310

mte_set_node_dead(enode);

lib/maple_tree.c

4261

struct maple_enode *enode;

lib/maple_tree.c

4293

enode = mas_slot(mas, slots, mas->offset);

lib/maple_tree.c

4302

mas->node = enode;

lib/maple_tree.c

4306

enode = mas_slot(mas, slots, 0);

lib/maple_tree.c

4315

tmp = mte_to_node(enode);

lib/maple_tree.c

4316

mt = mte_node_type(enode);

lib/maple_tree.c

4322

mas->node = enode;

lib/maple_tree.c

466

enum maple_type mas_parent_type(struct ma_state *mas, struct maple_enode *enode)

lib/maple_tree.c

470

p_type = (unsigned long)mte_to_node(enode)->parent;

lib/maple_tree.c

4852

unsigned char mte_dead_leaves(struct maple_enode *enode, struct maple_tree *mt,

lib/maple_tree.c

4860

for (offset = 0; offset < mt_slot_count(enode); offset++) {

lib/maple_tree.c

4883

static void __rcu **mte_dead_walk(struct maple_enode **enode, unsigned char offset)

lib/maple_tree.c

4888

next = mte_to_node(*enode);

lib/maple_tree.c

4890

*enode = ma_enode_ptr(next);

lib/maple_tree.c

4891

node = mte_to_node(*enode);

lib/maple_tree.c

4911

struct maple_enode *enode;

lib/maple_tree.c

4921

enode = mt_mk_node(node, node->type);

lib/maple_tree.c

4922

slots = mte_dead_walk(&enode, 0);

lib/maple_tree.c

4923

node = mte_to_node(enode);

lib/maple_tree.c

4927

enode = node->piv_parent;

lib/maple_tree.c

4928

if (mte_to_node(enode) == node)

lib/maple_tree.c

4931

type = mte_node_type(enode);

lib/maple_tree.c

4932

slots = ma_slots(mte_to_node(enode), type);

lib/maple_tree.c

4936

slots = mte_dead_walk(&enode, offset);

lib/maple_tree.c

4937

node = mte_to_node(enode);

lib/maple_tree.c

4947

static inline void __rcu **mte_destroy_descend(struct maple_enode **enode,

lib/maple_tree.c

4951

struct maple_enode *next = *enode;

lib/maple_tree.c

4957

*enode = next;

lib/maple_tree.c

4958

node = mte_to_node(*enode);

lib/maple_tree.c

4959

type = mte_node_type(*enode);

lib/maple_tree.c

4965

mte_set_node_dead(*enode);

lib/maple_tree.c

497

void mas_set_parent(struct ma_state *mas, struct maple_enode *enode,

lib/maple_tree.c

4971

prev = *enode;

lib/maple_tree.c

4977

static void mt_destroy_walk(struct maple_enode *enode, struct maple_tree *mt,

lib/maple_tree.c

4981

struct maple_node *node = mte_to_node(enode);

lib/maple_tree.c

4984

if (mte_is_leaf(enode)) {

lib/maple_tree.c

4985

mte_set_node_dead(enode);

lib/maple_tree.c

4986

node->type = mte_node_type(enode);

lib/maple_tree.c

4990

start = enode;

lib/maple_tree.c

4991

slots = mte_destroy_descend(&enode, mt, start, 0);

lib/maple_tree.c

4992

node = mte_to_node(enode); // Updated in the above call.

lib/maple_tree.c

4998

node->slot_len = mte_dead_leaves(enode, mt, slots);

lib/maple_tree.c

5002

enode = node->piv_parent;

lib/maple_tree.c

5003

if (mte_to_node(enode) == node)

lib/maple_tree.c

5006

type = mte_node_type(enode);

lib/maple_tree.c

5007

slots = ma_slots(mte_to_node(enode), type);

lib/maple_tree.c

5013

parent = enode;

lib/maple_tree.c

5014

enode = tmp;

lib/maple_tree.c

5015

slots = mte_destroy_descend(&enode, mt, parent, offset);

lib/maple_tree.c

5018

node = mte_to_node(enode);

lib/maple_tree.c

5019

} while (start != enode);

lib/maple_tree.c

5021

node = mte_to_node(enode);

lib/maple_tree.c

5022

node->slot_len = mte_dead_leaves(enode, mt, slots);

lib/maple_tree.c

5040

static inline void mte_destroy_walk(struct maple_enode *enode,

lib/maple_tree.c

5043

struct maple_node *node = mte_to_node(enode);

lib/maple_tree.c

5046

mt_destroy_walk(enode, mt, false);

lib/maple_tree.c

5049

mt_destroy_walk(enode, mt, true);

lib/maple_tree.c

523

mte_to_node(enode)->parent = ma_parent_ptr(val);

lib/maple_tree.c

533

unsigned int mte_parent_slot(const struct maple_enode *enode)

lib/maple_tree.c

535

unsigned long val = (unsigned long)mte_to_node(enode)->parent;

lib/maple_tree.c

554

struct maple_node *mte_parent(const struct maple_enode *enode)

lib/maple_tree.c

557

(mte_to_node(enode)->parent) & ~MAPLE_NODE_MASK);

lib/maple_tree.c

582

static __always_inline bool mte_dead_node(const struct maple_enode *enode)

lib/maple_tree.c

586

node = mte_to_node(enode);

lib/maple_tree.c

922

static void mt_destroy_walk(struct maple_enode *enode, struct maple_tree *mt,