1180 	if (node->node_count == 1) {  in mas_pop_node()
1188 	ret = node->slot[--node->node_count];  in mas_pop_node()
1189 	node->slot[node->node_count] = NULL;  in mas_pop_node()
1220 	reuse->node_count = 0;  in mas_push_node()
1221 	if (count && (head->node_count < MAPLE_ALLOC_SLOTS)) {  in mas_push_node()
1222 		head->slot[head->node_count++] = reuse;  in mas_push_node()
1230 		reuse->node_count = 1;  in mas_push_node()
1264 	if (!allocated || mas->alloc->node_count == MAPLE_ALLOC_SLOTS) {  in mas_alloc_nodes()
1271 			node->node_count = 1;  in mas_alloc_nodes()
1273 			node->node_count = 0;  in mas_alloc_nodes()
1284 		max_req = MAPLE_ALLOC_SLOTS - node->node_count;  in mas_alloc_nodes()
1285 		slots = (void **)&node->slot[node->node_count];  in mas_alloc_nodes()
1291 		if (node->node_count == 0) {  in mas_alloc_nodes()
1292 			node->slot[0]->node_count = 0;  in mas_alloc_nodes()
1296 		node->node_count += count;  in mas_alloc_nodes()
5570 		if (node->node_count > 1) {  in mas_destroy()
5571 			size_t count = node->node_count - 1;  in mas_destroy()