394 	struct ma_state *mas;  member
408 #define mas_lock(mas)           spin_lock(&((mas)->tree->ma_lock))  argument
409 #define mas_unlock(mas)         spin_unlock(&((mas)->tree->ma_lock))  argument
450 		.mas = ma_state,					\
462 void *mas_walk(struct ma_state *mas);
463 void *mas_store(struct ma_state *mas, void *entry);
464 void *mas_erase(struct ma_state *mas);
465 int mas_store_gfp(struct ma_state *mas, void *entry, gfp_t gfp);
466 void mas_store_prealloc(struct ma_state *mas, void *entry);
467 void *mas_find(struct ma_state *mas, unsigned long max);
468 void *mas_find_range(struct ma_state *mas, unsigned long max);
469 void *mas_find_rev(struct ma_state *mas, unsigned long min);
470 void *mas_find_range_rev(struct ma_state *mas, unsigned long max);
471 int mas_preallocate(struct ma_state *mas, void *entry, gfp_t gfp);
472 bool mas_is_err(struct ma_state *mas);
474 bool mas_nomem(struct ma_state *mas, gfp_t gfp);
475 void mas_pause(struct ma_state *mas);
477 void mas_destroy(struct ma_state *mas);
478 int mas_expected_entries(struct ma_state *mas, unsigned long nr_entries);
480 void *mas_prev(struct ma_state *mas, unsigned long min);
481 void *mas_prev_range(struct ma_state *mas, unsigned long max);
482 void *mas_next(struct ma_state *mas, unsigned long max);
483 void *mas_next_range(struct ma_state *mas, unsigned long max);
485 int mas_empty_area(struct ma_state *mas, unsigned long min, unsigned long max,
491 int mas_empty_area_rev(struct ma_state *mas, unsigned long min,
494 static inline void mas_init(struct ma_state *mas, struct maple_tree *tree,  in mas_init()  argument
497 	memset(mas, 0, sizeof(struct ma_state));  in mas_init()
498 	mas->tree = tree;  in mas_init()
499 	mas->index = mas->last = addr;  in mas_init()
500 	mas->max = ULONG_MAX;  in mas_init()
501 	mas->node = MAS_START;  in mas_init()
505 static inline bool mas_is_none(const struct ma_state *mas)  in mas_is_none()  argument
507 	return mas->node == MAS_NONE;  in mas_is_none()
511 static inline bool mas_is_paused(const struct ma_state *mas)  in mas_is_paused()  argument
513 	return mas->node == MAS_PAUSE;  in mas_is_paused()
517 static inline bool mas_is_active(struct ma_state *mas)  in mas_is_active()  argument
519 	if ((unsigned long)mas->node >= MAPLE_RESERVED_RANGE)  in mas_is_active()
535 static inline void mas_reset(struct ma_state *mas)  in mas_reset()  argument
537 	mas->node = MAS_START;  in mas_reset()
563 static inline void __mas_set_range(struct ma_state *mas, unsigned long start,  in __mas_set_range()  argument
566 	mas->index = start;  in __mas_set_range()
567 	mas->last = last;  in __mas_set_range()
581 void mas_set_range(struct ma_state *mas, unsigned long start, unsigned long last)  in mas_set_range()  argument
583 	__mas_set_range(mas, start, last);  in mas_set_range()
584 	mas->node = MAS_START;  in mas_set_range()
596 static inline void mas_set(struct ma_state *mas, unsigned long index)  in mas_set()  argument
599 	mas_set_range(mas, index, index);  in mas_set()
720 void mas_dump(const struct ma_state *mas);
761 		mas_dump((__wrmas)->mas);				\
762 		mt_dump((__wrmas)->mas->tree, mt_dump_hex);		\
814 		mas_dump((__wrmas)->mas);				\
815 		mt_dump((__wrmas)->mas->tree, mt_dump_hex);		\