Searched refs:mas (Results 1 – 4 of 4) sorted by relevance
| /include/trace/events/ |
| D | maple_tree.h | 15 TP_PROTO(const char *fn, struct ma_state *mas), 17 TP_ARGS(fn, mas), 30 __entry->min = mas->min; 31 __entry->max = mas->max; 32 __entry->index = mas->index; 33 __entry->last = mas->last; 34 __entry->node = mas->node; 48 TP_PROTO(const char *fn, struct ma_state *mas), 50 TP_ARGS(fn, mas), 63 __entry->min = mas->min; [all …]
|
| /include/linux/ |
| D | maple_tree.h | 272 #define mtree_lock_nested(mas, subclass) \ argument 455 struct ma_state *mas; member 468 #define mas_lock(mas) spin_lock(&((mas)->tree->ma_lock)) argument 469 #define mas_lock_nested(mas, subclass) \ argument 470 spin_lock_nested(&((mas)->tree->ma_lock), subclass) 471 #define mas_unlock(mas) spin_unlock(&((mas)->tree->ma_lock)) argument 498 .mas = ma_state, \ 510 void *mas_walk(struct ma_state *mas); 511 void *mas_store(struct ma_state *mas, void *entry); 512 void *mas_erase(struct ma_state *mas); [all …]
|
| D | mm.h | 1103 return mas_find(&vmi->mas, max - 1); in vma_find() 1112 return mas_find(&vmi->mas, ULONG_MAX); in vma_next() 1118 return mas_next_range(&vmi->mas, ULONG_MAX); in vma_iter_next_range() 1124 return mas_prev(&vmi->mas, 0); in vma_prev() 1130 __mas_set_range(&vmi->mas, start, end - 1); in vma_iter_clear_gfp() 1131 mas_store_gfp(&vmi->mas, NULL, gfp); in vma_iter_clear_gfp() 1132 if (unlikely(mas_is_err(&vmi->mas))) in vma_iter_clear_gfp() 1141 mas_destroy(&vmi->mas); in vma_iter_free() 1147 vmi->mas.index = vma->vm_start; in vma_iter_bulk_store() 1148 vmi->mas.last = vma->vm_end - 1; in vma_iter_bulk_store() [all …]
|
| D | mm_types.h | 1168 struct ma_state mas; member 1173 .mas = { \ 1184 mas_init(&vmi->mas, &mm->mm_mt, addr); in vma_iter_init()
|