126 	void *tmp, *tmp_aligned;  in ibv_fork_init()  local
143 	if (posix_memalign(&tmp, page_size, page_size))  in ibv_fork_init()
147 		size = get_page_size(tmp);  in ibv_fork_init()
148 		tmp_aligned = (void *) ((uintptr_t) tmp & ~(size - 1));  in ibv_fork_init()
151 		tmp_aligned = tmp;  in ibv_fork_init()
157 	free(tmp);  in ibv_fork_init()
211 	struct ibv_mem_node *tmp;  in __mm_rotate_right()  local
213 	tmp = node->left;  in __mm_rotate_right()
215 	node->left = tmp->right;  in __mm_rotate_right()
221 			node->parent->right = tmp;  in __mm_rotate_right()
223 			node->parent->left = tmp;  in __mm_rotate_right()
225 		mm_root = tmp;  in __mm_rotate_right()
227 	tmp->parent = node->parent;  in __mm_rotate_right()
229 	tmp->right = node;  in __mm_rotate_right()
230 	node->parent = tmp;  in __mm_rotate_right()
235 	struct ibv_mem_node *tmp;  in __mm_rotate_left()  local
237 	tmp = node->right;  in __mm_rotate_left()
239 	node->right = tmp->left;  in __mm_rotate_left()
245 			node->parent->right = tmp;  in __mm_rotate_left()
247 			node->parent->left = tmp;  in __mm_rotate_left()
249 		mm_root = tmp;  in __mm_rotate_left()
251 	tmp->parent = node->parent;  in __mm_rotate_left()
253 	tmp->left = node;  in __mm_rotate_left()
254 	node->parent = tmp;  in __mm_rotate_left()
369 	struct ibv_mem_node *child, *parent, *sib, *tmp;  in __mm_remove()  local
373 		tmp = node->left;  in __mm_remove()
374 		while (tmp->right)  in __mm_remove()
375 			tmp = tmp->right;  in __mm_remove()
377 		nodecol    = tmp->color;  in __mm_remove()
378 		child      = tmp->left;  in __mm_remove()
379 		tmp->color = node->color;  in __mm_remove()
381 		if (tmp->parent != node) {  in __mm_remove()
382 			parent        = tmp->parent;  in __mm_remove()
383 			parent->right = tmp->left;  in __mm_remove()
384 			if (tmp->left)  in __mm_remove()
385 				tmp->left->parent = parent;  in __mm_remove()
387 			tmp->left   	   = node->left;  in __mm_remove()
388 			node->left->parent = tmp;  in __mm_remove()
390 			parent = tmp;  in __mm_remove()
392 		tmp->right          = node->right;  in __mm_remove()
393 		node->right->parent = tmp;  in __mm_remove()
395 		tmp->parent = node->parent;  in __mm_remove()
398 				node->parent->left = tmp;  in __mm_remove()
400 				node->parent->right = tmp;  in __mm_remove()
402 			mm_root = tmp;  in __mm_remove()
544 	struct ibv_mem_node *node, *tmp = NULL;  in get_start_node()  local
550 		tmp = __mm_prev(node);  in get_start_node()
551 		if (tmp && tmp->refcnt == node->refcnt + inc)  in get_start_node()
552 			node = merge_ranges(node, tmp);  in get_start_node()
564 	struct ibv_mem_node *tmp = NULL;  in undo_node()  local
571 		tmp = split_range(node, start);  in undo_node()
572 		if (tmp) {  in undo_node()
574 			node = tmp;  in undo_node()
579 	tmp  =  __mm_prev(node);  in undo_node()
580 	if (tmp && tmp->refcnt == node->refcnt)  in undo_node()
581 		node = merge_ranges(node, tmp);  in undo_node()
583 	tmp  =  __mm_next(node);  in undo_node()
584 	if (tmp && tmp->refcnt == node->refcnt)  in undo_node()
585 		node = merge_ranges(tmp, node);  in undo_node()
593 	struct ibv_mem_node *node, *tmp;  in ibv_madvise_range()  local
659 				tmp = __mm_prev(node);  in ibv_madvise_range()
660 				if (!tmp || start > tmp->end)  in ibv_madvise_range()
662 				end = tmp->end;  in ibv_madvise_range()
672 		tmp = __mm_prev(node);  in ibv_madvise_range()
673 		if (tmp && node->refcnt == tmp->refcnt)  in ibv_madvise_range()
674 			node = merge_ranges(node, tmp);  in ibv_madvise_range()