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

464

struct xbc_node *enode)

kernel/trace/trace_boot.c

472

event = xbc_node_get_data(enode);

kernel/trace/trace_boot.c

475

if (trace_boot_add_kprobe_event(enode, event) < 0)

kernel/trace/trace_boot.c

478

if (trace_boot_add_synth_event(enode, event) < 0)

kernel/trace/trace_boot.c

488

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

kernel/trace/trace_boot.c

497

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

kernel/trace/trace_boot.c

503

anode = xbc_node_find_subkey(enode, "hist");

kernel/trace/trace_boot.c

506

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

kernel/trace/trace_boot.c

509

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

kernel/trace/trace_boot.c

521

struct xbc_node *gnode, *enode;

kernel/trace/trace_boot.c

536

xbc_node_for_each_subkey(gnode, enode) {

kernel/trace/trace_boot.c

537

data = xbc_node_get_data(enode);

kernel/trace/trace_boot.c

542

trace_boot_init_one_event(tr, gnode, enode);

lib/maple_tree.c

1785

struct maple_enode *enode;

lib/maple_tree.c

1790

enode = tmp_mas->node;

lib/maple_tree.c

1791

tmp = mte_to_node(enode);

lib/maple_tree.c

1792

mte_set_node_dead(enode);

lib/maple_tree.c

4028

struct maple_enode *enode;

lib/maple_tree.c

4060

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

lib/maple_tree.c

4069

mas->node = enode;

lib/maple_tree.c

4073

enode = mas_slot(mas, slots, 0);

lib/maple_tree.c

4082

tmp = mte_to_node(enode);

lib/maple_tree.c

4083

mt = mte_node_type(enode);

lib/maple_tree.c

4089

mas->node = enode;

lib/maple_tree.c

438

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

lib/maple_tree.c

442

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

lib/maple_tree.c

4619

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

lib/maple_tree.c

4627

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

lib/maple_tree.c

4650

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

lib/maple_tree.c

4655

next = mte_to_node(*enode);

lib/maple_tree.c

4657

*enode = ma_enode_ptr(next);

lib/maple_tree.c

4658

node = mte_to_node(*enode);

lib/maple_tree.c

4678

struct maple_enode *enode;

lib/maple_tree.c

4688

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

lib/maple_tree.c

4689

slots = mte_dead_walk(&enode, 0);

lib/maple_tree.c

469

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

lib/maple_tree.c

4690

node = mte_to_node(enode);

lib/maple_tree.c

4694

enode = node->piv_parent;

lib/maple_tree.c

4695

if (mte_to_node(enode) == node)

lib/maple_tree.c

4698

type = mte_node_type(enode);

lib/maple_tree.c

4699

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

lib/maple_tree.c

4703

slots = mte_dead_walk(&enode, offset);

lib/maple_tree.c

4704

node = mte_to_node(enode);

lib/maple_tree.c

4714

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

lib/maple_tree.c

4718

struct maple_enode *next = *enode;

lib/maple_tree.c

4724

*enode = next;

lib/maple_tree.c

4725

node = mte_to_node(*enode);

lib/maple_tree.c

4726

type = mte_node_type(*enode);

lib/maple_tree.c

4732

mte_set_node_dead(*enode);

lib/maple_tree.c

4738

prev = *enode;

lib/maple_tree.c

4744

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

lib/maple_tree.c

4748

struct maple_node *node = mte_to_node(enode);

lib/maple_tree.c

4751

if (mte_is_leaf(enode)) {

lib/maple_tree.c

4752

mte_set_node_dead(enode);

lib/maple_tree.c

4753

node->type = mte_node_type(enode);

lib/maple_tree.c

4757

start = enode;

lib/maple_tree.c

4758

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

lib/maple_tree.c

4759

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

lib/maple_tree.c

4765

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

lib/maple_tree.c

4769

enode = node->piv_parent;

lib/maple_tree.c

4770

if (mte_to_node(enode) == node)

lib/maple_tree.c

4773

type = mte_node_type(enode);

lib/maple_tree.c

4774

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

lib/maple_tree.c

4780

parent = enode;

lib/maple_tree.c

4781

enode = tmp;

lib/maple_tree.c

4782

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

lib/maple_tree.c

4785

node = mte_to_node(enode);

lib/maple_tree.c

4786

} while (start != enode);

lib/maple_tree.c

4788

node = mte_to_node(enode);

lib/maple_tree.c

4789

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

lib/maple_tree.c

4807

static inline void mte_destroy_walk(struct maple_enode *enode,

lib/maple_tree.c

4810

struct maple_node *node = mte_to_node(enode);

lib/maple_tree.c

4813

mt_destroy_walk(enode, mt, false);

lib/maple_tree.c

4816

mt_destroy_walk(enode, mt, true);

lib/maple_tree.c

495

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

lib/maple_tree.c

505

unsigned int mte_parent_slot(const struct maple_enode *enode)

lib/maple_tree.c

507

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

lib/maple_tree.c

526

struct maple_node *mte_parent(const struct maple_enode *enode)

lib/maple_tree.c

529

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

lib/maple_tree.c

554

static __always_inline bool mte_dead_node(const struct maple_enode *enode)

lib/maple_tree.c

558

node = mte_to_node(enode);

lib/maple_tree.c

901

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

tools/testing/radix-tree/maple.c

35284

struct maple_enode *enode;

tools/testing/radix-tree/maple.c

35530

enode = mas.node;

tools/testing/radix-tree/maple.c

35534

MT_BUG_ON(mt, enode == mas.node);

tools/testing/radix-tree/maple.c

35565

enode = mas.node;

tools/testing/radix-tree/maple.c

35566

pnode = mte_parent(enode);

tools/testing/radix-tree/maple.c

35570

MT_BUG_ON(mt, enode == mas.node);

tools/testing/radix-tree/maple.c

35905

void *enode;

tools/testing/radix-tree/maple.c

35953

enode = (void*) mas.node;

tools/testing/radix-tree/maple.c

35954

while (mas.node == enode)