drivers/net/ipvlan/ipvlan.h

83

struct list_head anode; /* logical-interface linkage */

drivers/net/ipvlan/ipvlan_core.c

126

list_for_each_entry(addr, &ipvlan->addrs, anode) {

drivers/net/ipvlan/ipvlan_main.c

195

list_for_each_entry(addr, &ipvlan->addrs, anode)

drivers/net/ipvlan/ipvlan_main.c

212

list_for_each_entry(addr, &ipvlan->addrs, anode)

drivers/net/ipvlan/ipvlan_main.c

662

list_for_each_entry_safe(addr, next, &ipvlan->addrs, anode) {

drivers/net/ipvlan/ipvlan_main.c

664

list_del_rcu(&addr->anode);

drivers/net/ipvlan/ipvlan_main.c

838

list_add_tail_rcu(&addr->anode, &ipvlan->addrs);

drivers/net/ipvlan/ipvlan_main.c

861

list_del_rcu(&addr->anode);

fs/hpfs/alloc.c

471

struct anode *hpfs_alloc_anode(struct super_block *s, secno near, anode_secno *ano,

fs/hpfs/alloc.c

474

struct anode *a;

fs/hpfs/anode.c

126

up = a != node ? le32_to_cpu(anode->up) : -1;

fs/hpfs/anode.c

127

if (!(anode = hpfs_alloc_anode(s, a, &na, &bh1))) {

fs/hpfs/anode.c

133

anode->up = cpu_to_le32(node);

fs/hpfs/anode.c

134

anode->btree.flags |= BP_fnode_parent;

fs/hpfs/anode.c

135

anode->btree.n_used_nodes = btree->n_used_nodes;

fs/hpfs/anode.c

136

anode->btree.first_free = btree->first_free;

fs/hpfs/anode.c

137

anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;

fs/hpfs/anode.c

138

memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);

fs/hpfs/anode.c

155

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

167

struct anode *new_anode;

fs/hpfs/anode.c

171

if (!(anode = hpfs_map_anode(s, up, &bh))) return -1;

fs/hpfs/anode.c

172

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

187

if ((anode = hpfs_map_anode(s, na, &bh))) {

fs/hpfs/anode.c

188

anode->up = cpu_to_le32(up);

fs/hpfs/anode.c

19

struct anode *anode;

fs/hpfs/anode.c

190

anode->btree.flags |= BP_fnode_parent;

fs/hpfs/anode.c

192

anode->btree.flags &= ~BP_fnode_parent;

fs/hpfs/anode.c

198

up = up != node ? le32_to_cpu(anode->up) : -1;

fs/hpfs/anode.c

204

anode = new_anode;

fs/hpfs/anode.c

206

anode->btree.flags |= BP_internal;

fs/hpfs/anode.c

207

anode->btree.n_used_nodes = 1;

fs/hpfs/anode.c

208

anode->btree.n_free_nodes = 59;

fs/hpfs/anode.c

209

anode->btree.first_free = cpu_to_le16(16);

fs/hpfs/anode.c

210

GET_BTREE_PTR(&anode->btree)->u.internal[0].down = cpu_to_le32(a);

fs/hpfs/anode.c

211

GET_BTREE_PTR(&anode->btree)->u.internal[0].file_secno = cpu_to_le32(-1);

fs/hpfs/anode.c

214

if ((anode = hpfs_map_anode(s, a, &bh))) {

fs/hpfs/anode.c

215

anode->up = cpu_to_le32(na);

fs/hpfs/anode.c

221

if ((anode = hpfs_map_anode(s, na, &bh))) {

fs/hpfs/anode.c

222

anode->up = cpu_to_le32(node);

fs/hpfs/anode.c

224

anode->btree.flags |= BP_fnode_parent;

fs/hpfs/anode.c

229

if (!(anode = hpfs_map_anode(s, node, &bh))) {

fs/hpfs/anode.c

233

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

247

struct anode *unode;

fs/hpfs/anode.c

278

struct anode *anode = NULL;

fs/hpfs/anode.c

29

if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;

fs/hpfs/anode.c

294

if (!(anode = hpfs_map_anode(s, ano, &bh))) return;

fs/hpfs/anode.c

295

btree1 = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

30

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

308

ano = le32_to_cpu(anode->up);

fs/hpfs/anode.c

310

if (!(anode = hpfs_map_anode(s, ano, &bh))) return;

fs/hpfs/anode.c

311

btree1 = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

333

struct anode *anode;

fs/hpfs/anode.c

335

if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;

fs/hpfs/anode.c

336

return hpfs_bplus_lookup(s, NULL, GET_BTREE_PTR(&anode->btree), sec, bh);

fs/hpfs/anode.c

388

struct anode *anode;

fs/hpfs/anode.c

391

if (!(anode = hpfs_map_anode(s, a, &bh))) return;

fs/hpfs/anode.c

392

hpfs_remove_btree(s, GET_BTREE_PTR(&anode->btree));

fs/hpfs/anode.c

403

struct anode *anode;

fs/hpfs/anode.c

413

if (!(anode = hpfs_map_anode(s, f, &bh))) return;

fs/hpfs/anode.c

414

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

451

if (!(anode = hpfs_map_anode(s, node, &bh))) return;

fs/hpfs/anode.c

452

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

64

struct anode *anode = NULL, *ranode = NULL;

fs/hpfs/anode.c

77

if (!(anode = hpfs_map_anode(s, node, &bh))) return -1;

fs/hpfs/anode.c

78

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/anode.c

94

if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;

fs/hpfs/anode.c

95

btree = GET_BTREE_PTR(&anode->btree);

fs/hpfs/ea.c

42

struct anode *anode;

fs/hpfs/ea.c

43

if ((anode = hpfs_map_anode(s, a, &bh))) {

fs/hpfs/ea.c

44

hpfs_remove_btree(s, GET_BTREE_PTR(&anode->btree));

fs/hpfs/hpfs_fn.h

208

struct anode *hpfs_alloc_anode(struct super_block *, secno, anode_secno *, struct buffer_head **);

fs/hpfs/hpfs_fn.h

296

struct anode *hpfs_map_anode(struct super_block *s, anode_secno, struct buffer_head **);

fs/hpfs/map.c

221

struct anode *hpfs_map_anode(struct super_block *s, anode_secno ano, struct buffer_head **bhp)

fs/hpfs/map.c

223

struct anode *anode;

fs/hpfs/map.c

225

if ((anode = hpfs_map_sector(s, ano, bhp, ANODE_RD_AHEAD)))

fs/hpfs/map.c

227

if (le32_to_cpu(anode->magic) != ANODE_MAGIC) {

fs/hpfs/map.c

231

if (le32_to_cpu(anode->self) != ano) {

fs/hpfs/map.c

235

if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes !=

fs/hpfs/map.c

236

(bp_internal(GET_BTREE_PTR(&anode->btree)) ? 60 : 40)) {

fs/hpfs/map.c

240

if (le16_to_cpu(anode->btree.first_free) !=

fs/hpfs/map.c

241

8 + anode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&anode->btree)) ? 8 : 12)) {

fs/hpfs/map.c

246

return anode;

include/linux/bootconfig.h

191

#define xbc_array_for_each_value(anode, value) \

include/linux/bootconfig.h

192

for (value = xbc_node_get_data(anode); anode != NULL ; \

include/linux/bootconfig.h

193

anode = xbc_node_get_child(anode), \

include/linux/bootconfig.h

194

value = anode ? xbc_node_get_data(anode) : NULL)

include/linux/bootconfig.h

235

#define xbc_node_for_each_array_value(node, key, anode, value) \

include/linux/bootconfig.h

236

for (value = xbc_node_find_value(node, key, &anode); value != NULL; \

include/linux/bootconfig.h

237

anode = xbc_node_get_child(anode), \

include/linux/bootconfig.h

238

value = anode ? xbc_node_get_data(anode) : NULL)

kernel/trace/trace_boot.c

105

struct xbc_node *anode;

kernel/trace/trace_boot.c

110

xbc_node_for_each_array_value(node, "probes", anode, val) {

kernel/trace/trace_boot.c

142

struct xbc_node *anode;

kernel/trace/trace_boot.c

153

xbc_node_for_each_array_value(node, "fields", anode, p) {

kernel/trace/trace_boot.c

222

struct xbc_node *anode;

kernel/trace/trace_boot.c

226

p = xbc_node_find_value(hnode, key, &anode);

kernel/trace/trace_boot.c

228

if (!anode) {

kernel/trace/trace_boot.c

235

xbc_array_for_each_value(anode, p) {

kernel/trace/trace_boot.c

251

struct xbc_node *knode, *anode;

kernel/trace/trace_boot.c

27

struct xbc_node *anode;

kernel/trace/trace_boot.c

270

anode = xbc_node_get_child(knode);

kernel/trace/trace_boot.c

271

if (!anode || !xbc_node_is_value(anode)) {

kernel/trace/trace_boot.c

280

xbc_array_for_each_value(anode, p) {

kernel/trace/trace_boot.c

33

xbc_node_for_each_array_value(node, "options", anode, p) {

kernel/trace/trace_boot.c

466

struct xbc_node *anode;

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

503

if (anode)

kernel/trace/trace_boot.c

504

trace_boot_init_histograms(file, anode, buf, ARRAY_SIZE(buf));

kernel/trace/trace_boot.c

562

struct xbc_node *anode;

kernel/trace/trace_boot.c

566

xbc_node_for_each_array_value(node, "ftrace.filters", anode, p) {

kernel/trace/trace_boot.c

576

xbc_node_for_each_array_value(node, "ftrace.notraces", anode, p) {

kernel/trace/trace_boot.c

85

struct xbc_node *anode;

kernel/trace/trace_boot.c

89

xbc_node_for_each_array_value(node, "events", anode, p) {