drivers/base/regmap/regcache-maple.c

190

struct ma_state *mas,

include/linux/maple_tree.h

491

struct ma_state *mas;

include/linux/maple_tree.h

524

struct ma_state name = { \

include/linux/maple_tree.h

539

#define MA_WR_STATE(name, ma_state, wr_entry) \

include/linux/maple_tree.h

541

.mas = ma_state, \

include/linux/maple_tree.h

555

void *mas_walk(struct ma_state *mas);

include/linux/maple_tree.h

556

void *mas_store(struct ma_state *mas, void *entry);

include/linux/maple_tree.h

557

void *mas_erase(struct ma_state *mas);

include/linux/maple_tree.h

558

int mas_store_gfp(struct ma_state *mas, void *entry, gfp_t gfp);

include/linux/maple_tree.h

559

void mas_store_prealloc(struct ma_state *mas, void *entry);

include/linux/maple_tree.h

560

void *mas_find(struct ma_state *mas, unsigned long max);

include/linux/maple_tree.h

561

void *mas_find_range(struct ma_state *mas, unsigned long max);

include/linux/maple_tree.h

562

void *mas_find_rev(struct ma_state *mas, unsigned long min);

include/linux/maple_tree.h

563

void *mas_find_range_rev(struct ma_state *mas, unsigned long max);

include/linux/maple_tree.h

564

int mas_preallocate(struct ma_state *mas, void *entry, gfp_t gfp);

include/linux/maple_tree.h

565

int mas_alloc_cyclic(struct ma_state *mas, unsigned long *startp,

include/linux/maple_tree.h

569

bool mas_nomem(struct ma_state *mas, gfp_t gfp);

include/linux/maple_tree.h

570

void mas_pause(struct ma_state *mas);

include/linux/maple_tree.h

572

void mas_destroy(struct ma_state *mas);

include/linux/maple_tree.h

574

void *mas_prev(struct ma_state *mas, unsigned long min);

include/linux/maple_tree.h

575

void *mas_prev_range(struct ma_state *mas, unsigned long max);

include/linux/maple_tree.h

576

void *mas_next(struct ma_state *mas, unsigned long max);

include/linux/maple_tree.h

577

void *mas_next_range(struct ma_state *mas, unsigned long max);

include/linux/maple_tree.h

579

int mas_empty_area(struct ma_state *mas, unsigned long min, unsigned long max,

include/linux/maple_tree.h

585

int mas_empty_area_rev(struct ma_state *mas, unsigned long min,

include/linux/maple_tree.h

588

static inline void mas_init(struct ma_state *mas, struct maple_tree *tree,

include/linux/maple_tree.h

591

memset(mas, 0, sizeof(struct ma_state));

include/linux/maple_tree.h

599

static inline bool mas_is_active(struct ma_state *mas)

include/linux/maple_tree.h

604

static inline bool mas_is_err(struct ma_state *mas)

include/linux/maple_tree.h

619

static __always_inline void mas_reset(struct ma_state *mas)

include/linux/maple_tree.h

663

void mas_dump(const struct ma_state *mas);

include/linux/maple_tree.h

787

static inline void __mas_set_range(struct ma_state *mas, unsigned long start,

include/linux/maple_tree.h

808

void mas_set_range(struct ma_state *mas, unsigned long start, unsigned long last)

include/linux/maple_tree.h

823

static inline void mas_set(struct ma_state *mas, unsigned long index)

include/linux/mm_types.h

1531

struct ma_state mas;

include/trace/events/maple_tree.h

11

struct ma_state;

include/trace/events/maple_tree.h

15

TP_PROTO(const char *fn, struct ma_state *mas),

include/trace/events/maple_tree.h

48

TP_PROTO(const char *fn, struct ma_state *mas),

include/trace/events/maple_tree.h

82

TP_PROTO(const char *fn, struct ma_state *mas, unsigned long piv,

lib/alloc_tag.c

403

static bool find_aligned_area(struct ma_state *mas, unsigned long section_size,

lib/interval_tree_test.c

203

static void mas_cur_span(struct ma_state *mas, struct interval_tree_span_iter *state)

lib/maple_tree.c

1052

static __always_inline struct maple_node *mas_pop_node(struct ma_state *mas)

lib/maple_tree.c

1077

static inline void mas_alloc_nodes(struct ma_state *mas, gfp_t gfp)

lib/maple_tree.c

1129

static inline void mas_empty_nodes(struct ma_state *mas)

lib/maple_tree.c

1151

static inline void mas_free(struct ma_state *mas, struct maple_enode *used)

lib/maple_tree.c

1169

static inline struct maple_enode *mas_start(struct ma_state *mas)

lib/maple_tree.c

1254

static inline unsigned char mas_data_end(struct ma_state *mas)

lib/maple_tree.c

1281

void wr_mas_setup(struct ma_wr_state *wr_mas, struct ma_state *mas)

lib/maple_tree.c

1295

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

1379

static inline unsigned long mas_leaf_max_gap(struct ma_state *mas)

lib/maple_tree.c

1430

static inline unsigned long mas_max_gap(struct ma_state *mas)

lib/maple_tree.c

1457

static inline void mas_parent_gap(struct ma_state *mas, unsigned char offset,

lib/maple_tree.c

1508

static inline void mas_update_gap(struct ma_state *mas)

lib/maple_tree.c

1536

static inline void mas_adopt_children(struct ma_state *mas,

lib/maple_tree.c

1560

static inline void mas_put_in_tree(struct ma_state *mas,

lib/maple_tree.c

1590

static inline void mas_replace_node(struct ma_state *mas,

lib/maple_tree.c

1603

static inline bool mas_find_child(struct ma_state *mas, struct ma_state *child)

lib/maple_tree.c

1652

static inline bool mas_prev_sibling(struct ma_state *mas)

lib/maple_tree.c

1672

static inline bool mas_next_sibling(struct ma_state *mas)

lib/maple_tree.c

1700

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

1723

static inline void rebalance_sib(struct ma_state *parent, struct ma_state *sib)

lib/maple_tree.c

1738

struct ma_wr_state *r_wr_mas, struct ma_state *nneighbour)

lib/maple_tree.c

1740

struct ma_state l_tmp = *l_wr_mas->mas;

lib/maple_tree.c

1741

struct ma_state r_tmp = *r_wr_mas->mas;

lib/maple_tree.c

1781

static inline void mas_topiary_node(struct ma_state *mas,

lib/maple_tree.c

1782

struct ma_state *tmp_mas, bool in_rcu)

lib/maple_tree.c

1814

static inline void mas_topiary_replace(struct ma_state *mas,

lib/maple_tree.c

1817

struct ma_state tmp[3], tmp_next[3];

lib/maple_tree.c

186

static unsigned int mas_mt_height(struct ma_state *mas)

lib/maple_tree.c

1917

unsigned long node_copy(struct ma_state *mas, struct maple_node *src,

lib/maple_tree.c

2009

static inline void *mtree_range_walk(struct ma_state *mas)

lib/maple_tree.c

2076

static inline void mas_wmb_replace(struct ma_state *mas, struct maple_copy *cp)

lib/maple_tree.c

2100

struct ma_state *mas, struct ma_wr_state *l_wr_mas,

lib/maple_tree.c

2154

static bool data_fits(struct ma_state *sib, struct ma_state *mas,

lib/maple_tree.c

2192

static inline void push_data_sib(struct maple_copy *cp, struct ma_state *mas,

lib/maple_tree.c

2193

struct ma_state *sib, struct ma_state *parent)

lib/maple_tree.c

2236

struct ma_wr_state *wr_mas, struct ma_state *sib,

lib/maple_tree.c

2237

struct ma_state *parent)

lib/maple_tree.c

2272

struct ma_state *sib)

lib/maple_tree.c

228

static __always_inline void mas_set_err(struct ma_state *mas, long err)

lib/maple_tree.c

2291

void dst_setup(struct maple_copy *cp, struct ma_state *mas, enum maple_type mt)

lib/maple_tree.c

234

static __always_inline bool mas_is_ptr(const struct ma_state *mas)

lib/maple_tree.c

2355

struct ma_state *mas, unsigned char start, unsigned char end)

lib/maple_tree.c

239

static __always_inline bool mas_is_start(const struct ma_state *mas)

lib/maple_tree.c

2415

struct ma_wr_state *r_wr_mas, struct ma_state *sib)

lib/maple_tree.c

244

static __always_inline bool mas_is_none(const struct ma_state *mas)

lib/maple_tree.c

2441

void cp_data_write(struct maple_copy *cp, struct ma_state *mas)

lib/maple_tree.c

249

static __always_inline bool mas_is_paused(const struct ma_state *mas)

lib/maple_tree.c

254

static __always_inline bool mas_is_overflow(struct ma_state *mas)

lib/maple_tree.c

2548

unsigned long max, struct ma_state *mas)

lib/maple_tree.c

259

static inline bool mas_is_underflow(struct ma_state *mas)

lib/maple_tree.c

2590

static inline bool cp_is_new_root(struct maple_copy *cp, struct ma_state *mas)

lib/maple_tree.c

2627

static inline bool cp_converged(struct maple_copy *cp, struct ma_state *mas,

lib/maple_tree.c

2628

struct ma_state *sib)

lib/maple_tree.c

2647

static bool spanning_ascend(struct maple_copy *cp, struct ma_state *mas,

lib/maple_tree.c

2649

struct ma_state *sib)

lib/maple_tree.c

2676

void copy_tree_location(const struct ma_state *src, struct ma_state *dst)

lib/maple_tree.c

2694

struct ma_wr_state *wr_mas, struct ma_state *sib,

lib/maple_tree.c

2695

struct ma_state *parent)

lib/maple_tree.c

2697

struct ma_state *mas;

lib/maple_tree.c

2733

static inline void mas_root_expand(struct ma_state *mas, void *entry)

lib/maple_tree.c

2778

static inline void mas_store_root(struct ma_state *mas, void *entry)

lib/maple_tree.c

2858

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

288

static inline struct maple_node *mas_mn(const struct ma_state *mas)

lib/maple_tree.c

2888

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

2907

struct ma_state *r_mas = r_wr_mas->mas;

lib/maple_tree.c

2908

struct ma_state *l_mas = l_wr_mas->mas;

lib/maple_tree.c

2941

static inline void *mas_state_walk(struct ma_state *mas)

lib/maple_tree.c

2964

static inline void *mtree_lookup_walk(struct ma_state *mas)

lib/maple_tree.c

3008

static inline void mas_new_root(struct ma_state *mas, void *entry)

lib/maple_tree.c

3050

struct ma_state *mas;

lib/maple_tree.c

3051

struct ma_state sib;

lib/maple_tree.c

3133

struct ma_state *mas;

lib/maple_tree.c

3216

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3259

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3307

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3330

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3379

struct ma_wr_state *wr_mas, struct ma_state *sib,

lib/maple_tree.c

3380

struct ma_state *parent)

lib/maple_tree.c

3382

struct ma_state *mas;

lib/maple_tree.c

3424

struct ma_wr_state *wr_mas, struct ma_state *sib,

lib/maple_tree.c

3425

struct ma_state *parent)

lib/maple_tree.c

3444

struct ma_state parent;

lib/maple_tree.c

3445

struct ma_state *mas;

lib/maple_tree.c

3447

struct ma_state sib;

lib/maple_tree.c

3477

struct ma_state parent;

lib/maple_tree.c

3478

struct ma_state *mas;

lib/maple_tree.c

3480

struct ma_state sib;

lib/maple_tree.c

3516

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3555

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

359

static inline bool mas_is_root_limits(const struct ma_state *mas)

lib/maple_tree.c

3606

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3662

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3711

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3730

static inline void *mas_insert(struct ma_state *mas, void *entry)

lib/maple_tree.c

3792

int mas_alloc_cyclic(struct ma_state *mas, unsigned long *startp,

lib/maple_tree.c

3830

static __always_inline void mas_rewalk(struct ma_state *mas, unsigned long index)

lib/maple_tree.c

3839

static __always_inline bool mas_rewalk_if_dead(struct ma_state *mas,

lib/maple_tree.c

3860

static int mas_prev_node(struct ma_state *mas, unsigned long min)

lib/maple_tree.c

3940

static void *mas_prev_slot(struct ma_state *mas, unsigned long min, bool empty)

lib/maple_tree.c

4023

static int mas_next_node(struct ma_state *mas, struct maple_node *node,

lib/maple_tree.c

4110

static void *mas_next_slot(struct ma_state *mas, unsigned long max, bool empty)

lib/maple_tree.c

4203

static bool mas_rev_awalk(struct ma_state *mas, unsigned long size,

lib/maple_tree.c

4290

static inline bool mas_anode_descend(struct ma_state *mas, unsigned long size)

lib/maple_tree.c

4359

void *mas_walk(struct ma_state *mas)

lib/maple_tree.c

438

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

lib/maple_tree.c

4388

static inline bool mas_rewind_node(struct ma_state *mas)

lib/maple_tree.c

4413

static inline bool mas_skip_node(struct ma_state *mas)

lib/maple_tree.c

4441

static inline void mas_awalk(struct ma_state *mas, unsigned long size)

lib/maple_tree.c

4469

static inline int mas_sparse_area(struct ma_state *mas, unsigned long min,

lib/maple_tree.c

4501

int mas_empty_area(struct ma_state *mas, unsigned long min,

lib/maple_tree.c

4555

int mas_empty_area_rev(struct ma_state *mas, unsigned long min,

lib/maple_tree.c

469

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

lib/maple_tree.c

4830

void *mas_store(struct ma_state *mas, void *entry)

lib/maple_tree.c

4885

int mas_store_gfp(struct ma_state *mas, void *entry, gfp_t gfp)

lib/maple_tree.c

4918

void mas_store_prealloc(struct ma_state *mas, void *entry)

lib/maple_tree.c

4950

int mas_preallocate(struct ma_state *mas, void *entry, gfp_t gfp)

lib/maple_tree.c

4985

void mas_destroy(struct ma_state *mas)

lib/maple_tree.c

4992

static void mas_may_activate(struct ma_state *mas)

lib/maple_tree.c

5003

static bool mas_next_setup(struct ma_state *mas, unsigned long max,

lib/maple_tree.c

5073

void *mas_next(struct ma_state *mas, unsigned long max)

lib/maple_tree.c

5096

void *mas_next_range(struct ma_state *mas, unsigned long max)

lib/maple_tree.c

5132

static bool mas_prev_setup(struct ma_state *mas, unsigned long min, void **entry)

lib/maple_tree.c

5204

void *mas_prev(struct ma_state *mas, unsigned long min)

lib/maple_tree.c

5227

void *mas_prev_range(struct ma_state *mas, unsigned long min)

lib/maple_tree.c

5275

void mas_pause(struct ma_state *mas)

lib/maple_tree.c

5290

static __always_inline bool mas_find_setup(struct ma_state *mas, unsigned long max, void **entry)

lib/maple_tree.c

5381

void *mas_find(struct ma_state *mas, unsigned long max)

lib/maple_tree.c

5408

void *mas_find_range(struct ma_state *mas, unsigned long max)

lib/maple_tree.c

5428

static bool mas_find_rev_setup(struct ma_state *mas, unsigned long min,

lib/maple_tree.c

5520

void *mas_find_rev(struct ma_state *mas, unsigned long min)

lib/maple_tree.c

5546

void *mas_find_range_rev(struct ma_state *mas, unsigned long min)

lib/maple_tree.c

5569

void *mas_erase(struct ma_state *mas)

lib/maple_tree.c

5609

bool mas_nomem(struct ma_state *mas, gfp_t gfp)

lib/maple_tree.c

5942

static void mas_dup_free(struct ma_state *mas)

lib/maple_tree.c

5987

static inline void mas_copy_node(struct ma_state *mas, struct ma_state *new_mas,

lib/maple_tree.c

6010

static inline void mas_dup_alloc(struct ma_state *mas, struct ma_state *new_mas,

lib/maple_tree.c

6058

static inline void mas_dup_build(struct ma_state *mas, struct ma_state *new_mas,

lib/maple_tree.c

622

mas_safe_pivot(const struct ma_state *mas, unsigned long *pivots,

lib/maple_tree.c

640

mas_safe_min(struct ma_state *mas, unsigned long *pivots, unsigned char offset)

lib/maple_tree.c

6406

static inline struct maple_enode *mas_get_slot(struct ma_state *mas,

lib/maple_tree.c

6414

static void mas_dfs_postorder(struct ma_state *mas, unsigned long max)

lib/maple_tree.c

6647

static void mas_validate_gaps(struct ma_state *mas)

lib/maple_tree.c

6738

static void mas_validate_parent_slot(struct ma_state *mas)

lib/maple_tree.c

6773

static void mas_validate_child_slot(struct ma_state *mas)

lib/maple_tree.c

6817

static void mas_validate_limits(struct ma_state *mas)

lib/maple_tree.c

6960

void mas_dump(const struct ma_state *mas)

lib/maple_tree.c

731

static __always_inline void *mas_slot_locked(struct ma_state *mas,

lib/maple_tree.c

745

static __always_inline void *mas_slot(struct ma_state *mas, void __rcu **slots,

lib/maple_tree.c

757

static __always_inline void *mas_root(struct ma_state *mas)

lib/maple_tree.c

773

static inline void *mas_root_locked(struct ma_state *mas)

lib/maple_tree.c

910

static void mas_mat_destroy(struct ma_state *mas, struct ma_topiary *mat)

lib/maple_tree.c

931

static inline void mas_descend(struct ma_state *mas)

lib/maple_tree.c

958

static int mas_ascend(struct ma_state *mas)

mm/execmem.c

110

static inline unsigned long mas_range_len(struct ma_state *mas)

mm/execmem.c

206

static bool within_range(struct execmem_range *range, struct ma_state *mas,

mm/execmem.c

357

static int __execmem_cache_free(struct ma_state *mas, void *ptr, gfp_t gfp_mask)

mm/memory.c

376

struct ma_state *mas = unmap->mas;

mm/vma.c

1276

struct ma_state *mas_detach, bool mm_wr_locked)

mm/vma.c

1308

struct ma_state *mas_detach)

mm/vma.c

1331

struct ma_state *mas_detach)

mm/vma.c

1377

static void reattach_vmas(struct ma_state *mas_detach)

mm/vma.c

1399

struct ma_state *mas_detach)

mm/vma.c

2369

struct ma_state *mas_detach)

mm/vma.c

2371

struct ma_state *mas = &vms->vmi->mas;

mm/vma.c

36

struct ma_state mas_detach;

mm/vma.h

163

struct ma_state *mas; /* the maple state point to the first vma */

tools/testing/radix-tree/maple.c

345

int mas_ce2_over_count(struct ma_state *mas_start, struct ma_state *mas_end,

tools/testing/radix-tree/maple.c

34965

static void mas_dfs_preorder(struct ma_state *mas)

tools/testing/radix-tree/maple.c

35072

struct ma_state *mas = wr_mas->mas;

tools/testing/radix-tree/maple.c

35117

static int mas_allocated(struct ma_state *mas)

tools/testing/radix-tree/maple.c

353

struct ma_state tmp;

tools/testing/radix-tree/maple.c

35823

static __init void mas_subtree_max_range(struct ma_state *mas)

tools/testing/radix-tree/maple.c

36416

static unsigned long get_last_index(struct ma_state *mas)

tools/testing/radix-tree/maple.c

415

static inline void mas_node_walk(struct ma_state *mas, struct maple_node *node,

tools/testing/radix-tree/maple.c

487

static inline bool mas_descend_walk(struct ma_state *mas,

tools/testing/radix-tree/maple.c

522

static inline bool mas_tree_walk(struct ma_state *mas, unsigned long *range_min,

tools/testing/radix-tree/maple.c

555

static inline void *mas_range_load(struct ma_state *mas,

tools/testing/vma/include/dup.h

420

struct ma_state mas;