1166 	if (node->node_count == 1) {  in mas_pop_node()
1174 	ret = node->slot[--node->node_count];  in mas_pop_node()
1175 	node->slot[node->node_count] = NULL;  in mas_pop_node()
1206 	reuse->node_count = 0;  in mas_push_node()
1208 		if (head->node_count < MAPLE_ALLOC_SLOTS) {  in mas_push_node()
1209 			head->slot[head->node_count++] = reuse;  in mas_push_node()
1214 		reuse->node_count = 1;  in mas_push_node()
1248 	if (!allocated || mas->alloc->node_count == MAPLE_ALLOC_SLOTS) {  in mas_alloc_nodes()
1255 			node->node_count = 1;  in mas_alloc_nodes()
1257 			node->node_count = 0;  in mas_alloc_nodes()
1268 		max_req = MAPLE_ALLOC_SLOTS - node->node_count;  in mas_alloc_nodes()
1269 		slots = (void **)&node->slot[node->node_count];  in mas_alloc_nodes()
1275 		if (node->node_count == 0) {  in mas_alloc_nodes()
1276 			node->slot[0]->node_count = 0;  in mas_alloc_nodes()
1280 		node->node_count += count;  in mas_alloc_nodes()
1285 		} while (unlikely(node->node_count == MAPLE_ALLOC_SLOTS));  in mas_alloc_nodes()
5552 		if (node->node_count > 1) {  in mas_destroy()
5553 			size_t count = node->node_count - 1;  in mas_destroy()