drivers/base/regmap/regcache-maple.c

190

struct ma_state *mas,

include/linux/maple_tree.h

449

struct ma_state *mas;

include/linux/maple_tree.h

482

struct ma_state name = { \

include/linux/maple_tree.h

497

#define MA_WR_STATE(name, ma_state, wr_entry) \

include/linux/maple_tree.h

499

.mas = ma_state, \

include/linux/maple_tree.h

513

void *mas_walk(struct ma_state *mas);

include/linux/maple_tree.h

514

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

include/linux/maple_tree.h

515

void *mas_erase(struct ma_state *mas);

include/linux/maple_tree.h

516

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

include/linux/maple_tree.h

517

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

include/linux/maple_tree.h

518

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

include/linux/maple_tree.h

519

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

include/linux/maple_tree.h

520

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

include/linux/maple_tree.h

521

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

include/linux/maple_tree.h

522

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

include/linux/maple_tree.h

523

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

include/linux/maple_tree.h

527

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

include/linux/maple_tree.h

528

void mas_pause(struct ma_state *mas);

include/linux/maple_tree.h

530

void mas_destroy(struct ma_state *mas);

include/linux/maple_tree.h

532

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

include/linux/maple_tree.h

533

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

include/linux/maple_tree.h

534

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

include/linux/maple_tree.h

535

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

include/linux/maple_tree.h

537

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

include/linux/maple_tree.h

543

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

include/linux/maple_tree.h

546

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

include/linux/maple_tree.h

549

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

include/linux/maple_tree.h

557

static inline bool mas_is_active(struct ma_state *mas)

include/linux/maple_tree.h

562

static inline bool mas_is_err(struct ma_state *mas)

include/linux/maple_tree.h

577

static __always_inline void mas_reset(struct ma_state *mas)

include/linux/maple_tree.h

621

void mas_dump(const struct ma_state *mas);

include/linux/maple_tree.h

745

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

include/linux/maple_tree.h

766

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

include/linux/maple_tree.h

781

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

include/linux/mm_types.h

1498

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

387

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

lib/interval_tree_test.c

202

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

lib/maple_tree.c

1073

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

lib/maple_tree.c

1098

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

lib/maple_tree.c

1150

static inline void mas_empty_nodes(struct ma_state *mas)

lib/maple_tree.c

1172

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

lib/maple_tree.c

1190

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

lib/maple_tree.c

1275

static inline unsigned char mas_data_end(struct ma_state *mas)

lib/maple_tree.c

1307

static unsigned long mas_leaf_max_gap(struct ma_state *mas)

lib/maple_tree.c

1416

static inline unsigned long mas_max_gap(struct ma_state *mas)

lib/maple_tree.c

1443

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

lib/maple_tree.c

1494

static inline void mas_update_gap(struct ma_state *mas)

lib/maple_tree.c

1522

static inline void mas_adopt_children(struct ma_state *mas,

lib/maple_tree.c

154

struct ma_state *orig_l; /* Original left side of subtree */

lib/maple_tree.c

1546

static inline void mas_put_in_tree(struct ma_state *mas,

lib/maple_tree.c

155

struct ma_state *orig_r; /* Original right side of subtree */

lib/maple_tree.c

156

struct ma_state *l; /* New left side of subtree */

lib/maple_tree.c

157

struct ma_state *m; /* New middle of subtree (rare) */

lib/maple_tree.c

1576

static inline void mas_replace_node(struct ma_state *mas,

lib/maple_tree.c

158

struct ma_state *r; /* New right side of subtree */

lib/maple_tree.c

1589

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

lib/maple_tree.c

1692

static inline int mab_calc_split(struct ma_state *mas,

lib/maple_tree.c

1737

static inline void mas_mab_cp(struct ma_state *mas, unsigned char mas_start,

lib/maple_tree.c

1804

struct ma_state *mas, bool new_max)

lib/maple_tree.c

1867

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

1929

static inline bool mas_prev_sibling(struct ma_state *mas)

lib/maple_tree.c

1949

static inline bool mas_next_sibling(struct ma_state *mas)

lib/maple_tree.c

1974

static inline void mas_node_or_none(struct ma_state *mas,

lib/maple_tree.c

1996

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

2059

struct ma_state r_tmp = *mast->orig_r;

lib/maple_tree.c

2060

struct ma_state l_tmp = *mast->orig_l;

lib/maple_tree.c

2138

*mas_new_ma_node(struct ma_state *mas, struct maple_big_node *b_node)

lib/maple_tree.c

2155

static inline unsigned char mas_mab_to_node(struct ma_state *mas,

lib/maple_tree.c

2190

struct ma_state *mas,

lib/maple_tree.c

221

static unsigned int mas_mt_height(struct ma_state *mas)

lib/maple_tree.c

2212

static inline void mas_set_split_parent(struct ma_state *mas,

lib/maple_tree.c

2299

static inline void mas_topiary_node(struct ma_state *mas,

lib/maple_tree.c

2300

struct ma_state *tmp_mas, bool in_rcu)

lib/maple_tree.c

2332

static inline void mas_topiary_replace(struct ma_state *mas,

lib/maple_tree.c

2335

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

lib/maple_tree.c

2429

static inline void mas_wmb_replace(struct ma_state *mas,

lib/maple_tree.c

2538

static inline void *mtree_range_walk(struct ma_state *mas)

lib/maple_tree.c

2614

static void mas_spanning_rebalance(struct ma_state *mas,

lib/maple_tree.c

263

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

lib/maple_tree.c

269

static __always_inline bool mas_is_ptr(const struct ma_state *mas)

lib/maple_tree.c

274

static __always_inline bool mas_is_start(const struct ma_state *mas)

lib/maple_tree.c

2751

static inline void mas_rebalance(struct ma_state *mas,

lib/maple_tree.c

279

static __always_inline bool mas_is_none(const struct ma_state *mas)

lib/maple_tree.c

2802

struct ma_state *mas)

lib/maple_tree.c

2833

struct ma_state *mas,

lib/maple_tree.c

284

static __always_inline bool mas_is_paused(const struct ma_state *mas)

lib/maple_tree.c

2874

struct ma_state *mas, unsigned char split)

lib/maple_tree.c

289

static __always_inline bool mas_is_overflow(struct ma_state *mas)

lib/maple_tree.c

2905

static inline bool mas_push_data(struct ma_state *mas,

lib/maple_tree.c

294

static inline bool mas_is_underflow(struct ma_state *mas)

lib/maple_tree.c

2972

static void mas_split(struct ma_state *mas, struct maple_big_node *b_node)

lib/maple_tree.c

3080

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

lib/maple_tree.c

3126

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

lib/maple_tree.c

3206

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

323

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

lib/maple_tree.c

3236

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3255

struct ma_state *r_mas = r_wr_mas->mas;

lib/maple_tree.c

3256

struct ma_state *l_mas = l_wr_mas->mas;

lib/maple_tree.c

3287

static inline void *mas_state_walk(struct ma_state *mas)

lib/maple_tree.c

3310

static inline void *mtree_lookup_walk(struct ma_state *mas)

lib/maple_tree.c

3354

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

lib/maple_tree.c

3399

struct ma_state *mas;

lib/maple_tree.c

3491

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3569

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3614

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3662

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3687

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3748

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3788

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3839

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

387

static inline bool mas_is_root_limits(const struct ma_state *mas)

lib/maple_tree.c

3895

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3944

struct ma_state *mas = wr_mas->mas;

lib/maple_tree.c

3963

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

lib/maple_tree.c

4025

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

lib/maple_tree.c

4063

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

lib/maple_tree.c

4072

static __always_inline bool mas_rewalk_if_dead(struct ma_state *mas,

lib/maple_tree.c

4093

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

lib/maple_tree.c

4173

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

lib/maple_tree.c

4256

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

lib/maple_tree.c

4343

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

lib/maple_tree.c

4436

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

lib/maple_tree.c

4523

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

lib/maple_tree.c

4592

void *mas_walk(struct ma_state *mas)

lib/maple_tree.c

4621

static inline bool mas_rewind_node(struct ma_state *mas)

lib/maple_tree.c

4646

static inline bool mas_skip_node(struct ma_state *mas)

lib/maple_tree.c

466

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

lib/maple_tree.c

4674

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

lib/maple_tree.c

4702

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

lib/maple_tree.c

4734

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

lib/maple_tree.c

4788

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

lib/maple_tree.c

497

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

lib/maple_tree.c

5063

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

lib/maple_tree.c

5118

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

lib/maple_tree.c

5151

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

lib/maple_tree.c

5183

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

lib/maple_tree.c

5218

void mas_destroy(struct ma_state *mas)

lib/maple_tree.c

5225

static void mas_may_activate(struct ma_state *mas)

lib/maple_tree.c

5236

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

lib/maple_tree.c

5306

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

lib/maple_tree.c

5329

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

lib/maple_tree.c

5365

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

lib/maple_tree.c

5437

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

lib/maple_tree.c

5460

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

lib/maple_tree.c

5508

void mas_pause(struct ma_state *mas)

lib/maple_tree.c

5523

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

lib/maple_tree.c

5614

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

lib/maple_tree.c

5641

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

lib/maple_tree.c

5661

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

lib/maple_tree.c

5753

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

lib/maple_tree.c

5779

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

lib/maple_tree.c

5802

void *mas_erase(struct ma_state *mas)

lib/maple_tree.c

5842

bool mas_nomem(struct ma_state *mas, gfp_t gfp)

lib/maple_tree.c

6172

static void mas_dup_free(struct ma_state *mas)

lib/maple_tree.c

6217

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

lib/maple_tree.c

6240

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

lib/maple_tree.c

6281

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

lib/maple_tree.c

646

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

lib/maple_tree.c

6629

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

lib/maple_tree.c

6637

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

lib/maple_tree.c

664

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

lib/maple_tree.c

6870

static void mas_validate_gaps(struct ma_state *mas)

lib/maple_tree.c

6961

static void mas_validate_parent_slot(struct ma_state *mas)

lib/maple_tree.c

6996

static void mas_validate_child_slot(struct ma_state *mas)

lib/maple_tree.c

7040

static void mas_validate_limits(struct ma_state *mas)

lib/maple_tree.c

7183

void mas_dump(const struct ma_state *mas)

lib/maple_tree.c

752

static __always_inline void *mas_slot_locked(struct ma_state *mas,

lib/maple_tree.c

766

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

lib/maple_tree.c

778

static __always_inline void *mas_root(struct ma_state *mas)

lib/maple_tree.c

794

static inline void *mas_root_locked(struct ma_state *mas)

lib/maple_tree.c

931

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

lib/maple_tree.c

952

static inline void mas_descend(struct ma_state *mas)

lib/maple_tree.c

979

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

213

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

mm/execmem.c

354

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

mm/memory.c

389

struct ma_state *mas = unmap->mas;

mm/vma.c

1257

struct ma_state *mas_detach, bool mm_wr_locked)

mm/vma.c

1289

struct ma_state *mas_detach)

mm/vma.c

1312

struct ma_state *mas_detach)

mm/vma.c

1358

static void reattach_vmas(struct ma_state *mas_detach)

mm/vma.c

1380

struct ma_state *mas_detach)

mm/vma.c

2341

struct ma_state *mas_detach)

mm/vma.c

2343

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

mm/vma.c

36

struct ma_state mas_detach;

mm/vma.h

159

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

tools/testing/radix-tree/maple.c

344

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

tools/testing/radix-tree/maple.c

34934

static void mas_dfs_preorder(struct ma_state *mas)

tools/testing/radix-tree/maple.c

35041

struct ma_state *mas = wr_mas->mas;

tools/testing/radix-tree/maple.c

35086

static int mas_allocated(struct ma_state *mas)

tools/testing/radix-tree/maple.c

352

struct ma_state tmp;

tools/testing/radix-tree/maple.c

35657

static __init void mas_subtree_max_range(struct ma_state *mas)

tools/testing/radix-tree/maple.c

36126

static unsigned long get_last_index(struct ma_state *mas)

tools/testing/radix-tree/maple.c

414

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

tools/testing/radix-tree/maple.c

486

static inline bool mas_descend_walk(struct ma_state *mas,

tools/testing/radix-tree/maple.c

521

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

tools/testing/radix-tree/maple.c

554

static inline void *mas_range_load(struct ma_state *mas,

tools/testing/vma/include/dup.h

401

struct ma_state mas;