Home
last modified time | relevance | path

Searched refs:mas_nomem (Results 1 – 3 of 3) sorted by relevance

/linux/include/linux/
H A Dmaple_tree.h524 bool mas_nomem(struct ma_state *mas, gfp_t gfp);
/linux/tools/testing/radix-tree/
H A Dmaple.c113 MT_BUG_ON(mt, !mas_nomem(&mas, GFP_KERNEL)); in check_new_node()
135 MT_BUG_ON(mt, !mas_nomem(&mas, GFP_KERNEL)); in check_new_node()
151 mas_nomem(&mas, GFP_KERNEL); in check_new_node()
171 MT_BUG_ON(mt, !mas_nomem(&mas, GFP_KERNEL)); in check_new_node()
188 MT_BUG_ON(mt, !mas_nomem(&mas, GFP_KERNEL)); in check_new_node()
206 MT_BUG_ON(mt, !mas_nomem(&mas, GFP_KERNEL)); in check_new_node()
239 MT_BUG_ON(mt, !mas_nomem(&mas, GFP_KERNEL)); in check_new_node()
257 MT_BUG_ON(mt, !mas_nomem(&mas, GFP_KERNEL)); in check_new_node()
279 MT_BUG_ON(mt, mas_nomem(&mas, GFP_KERNEL)); in check_new_node()
288 mas_nomem(&mas, GFP_KERNEL); in check_new_node()
[all …]
/linux/lib/
H A Dmaple_tree.c4368 } while (mas_nomem(mas, gfp)); in mas_alloc_cyclic()
5478 if (unlikely(mas_nomem(mas, gfp))) { in mas_store_gfp()
6256 if (mas_nomem(mas, GFP_KERNEL)) { in mas_erase()
6279 bool mas_nomem(struct ma_state *mas, gfp_t gfp) in mas_nomem() function
6420 if (mas_nomem(&ms, gfp)) in mtree_insert_range()
6473 if (mas_nomem(&mas, gfp)) in mtree_alloc_range()
6555 if (mas_nomem(&mas, gfp)) in mtree_alloc_rrange()