include/linux/pagemap.h

179

head = rcu_access_pointer(mapping->i_pages.xa_head);

include/linux/radix-tree.h

88

return root->xa_head == NULL;

include/linux/xarray.h

1210

return rcu_dereference_check(xa->xa_head,

include/linux/xarray.h

1217

return rcu_dereference_protected(xa->xa_head,

include/linux/xarray.h

1621

return xa_head(xas->xa);

include/linux/xarray.h

304

void __rcu * xa_head;

include/linux/xarray.h

310

.xa_head = NULL, \

include/linux/xarray.h

386

xa->xa_head = NULL;

include/linux/xarray.h

411

return xa->xa_head == NULL;

lib/idr.c

244

if (slot != &idr->idr_rt.xa_head && !xa_is_retry(entry))

lib/idr.c

664

pr_debug("ida: %p node %p free %d\n", ida, xa->xa_head,

lib/idr.c

666

ida_dump_entry(xa->xa_head, 0);

lib/radix-tree.c

1190

return (void __rcu **)&root->xa_head;

lib/radix-tree.c

1481

void __rcu **slot = (void __rcu **)&root->xa_head;

lib/radix-tree.c

1497

child = rcu_dereference_raw(root->xa_head);

lib/radix-tree.c

1561

struct radix_tree_node *node = rcu_dereference_raw(idr->idr_rt.xa_head);

lib/radix-tree.c

1564

idr->idr_rt.xa_head = NULL;

lib/radix-tree.c

391

struct radix_tree_node *node = rcu_dereference_raw(root->xa_head);

lib/radix-tree.c

420

entry = rcu_dereference_raw(root->xa_head);

lib/radix-tree.c

457

rcu_assign_pointer(root->xa_head, entry);

lib/radix-tree.c

473

struct radix_tree_node *node = rcu_dereference_raw(root->xa_head);

lib/radix-tree.c

508

root->xa_head = (void __rcu *)child;

lib/radix-tree.c

553

rcu_dereference_raw(root->xa_head))

lib/radix-tree.c

569

root->xa_head = NULL;

lib/radix-tree.c

603

void __rcu **slot = (void __rcu **)&root->xa_head;

lib/radix-tree.c

617

child = rcu_dereference_raw(root->xa_head);

lib/radix-tree.c

757

slot = (void __rcu **)&root->xa_head;

lib/radix-tree.c

888

WARN_ON_ONCE(!node && (slot != (void __rcu **)&root->xa_head) &&

lib/test_xarray.c

359

node = xa_head(xa);

lib/test_xarray.c

364

XA_BUG_ON(xa, xa_head(xa) == node);

lib/test_xarray.c

368

XA_BUG_ON(xa, xa->xa_head != node);

lib/test_xarray.c

662

XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 2);

lib/test_xarray.c

663

XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 2);

lib/test_xarray.c

672

XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 3);

lib/test_xarray.c

673

XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 2);

lib/test_xarray.c

684

XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 4);

lib/test_xarray.c

685

XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 4);

lib/xarray.c

1478

entry = xa_head(xas->xa);

lib/xarray.c

191

entry = xa_head(xas->xa);

lib/xarray.c

2392

RCU_INIT_POINTER(xa->xa_head, NULL);

lib/xarray.c

2471

void *entry = xa->xa_head;

lib/xarray.c

465

RCU_INIT_POINTER(xa->xa_head, entry);

lib/xarray.c

506

xas->xa->xa_head = NULL;

lib/xarray.c

624

rcu_assign_pointer(xa->xa_head, head);

lib/xarray.c

667

slot = &xa->xa_head;

lib/xarray.c

679

slot = &xa->xa_head;

lib/xarray.c

786

void __rcu **slot = &xas->xa->xa_head;

tools/testing/radix-tree/test.c

249

struct radix_tree_node *node = root->xa_head;

tools/testing/radix-tree/test.c

273

struct radix_tree_node *node = root->xa_head;