Searched refs:mb_nodes (Results 1 – 2 of 2) sorted by relevance
199 static nxt_rbtree_test_t *mb_nodes; variable211 mb_nodes = nxt_malloc(NXT_RBT_NODES * n * sizeof(nxt_rbtree_test_t)); in nxt_rbtree_mb_start()212 if (mb_nodes == NULL) { in nxt_rbtree_mb_start()222 mb_nodes[n * i].key = key; in nxt_rbtree_mb_start()226 nxt_rbtree_insert(&mb_tree, &mb_nodes[n * i].node); in nxt_rbtree_mb_start()232 nxt_rbtree_insert(&mb_tree, &mb_nodes[n].node); in nxt_rbtree_mb_start()252 nxt_rbtree_insert(&mb_tree, &mb_nodes[n].node); in nxt_rbtree_mb_insert()270 nxt_rbtree_delete(&mb_tree, &mb_nodes[n].node); in nxt_rbtree_mb_delete()276 nxt_free(mb_nodes); in nxt_rbtree_mb_delete()
261 static nxt_rbtree1_node_t *mb_nodes; variable273 mb_nodes = nxt_malloc(NXT_RBT_NODES * n * sizeof(nxt_rbtree1_node_t)); in nxt_rbtree1_mb_start()274 if (mb_nodes == NULL) { in nxt_rbtree1_mb_start()284 mb_nodes[n * i].key = key; in nxt_rbtree1_mb_start()288 nxt_rbtree1_insert(&mb_tree, &mb_nodes[n * i]); in nxt_rbtree1_mb_start()294 nxt_rbtree1_insert(&mb_tree, &mb_nodes[n]); in nxt_rbtree1_mb_start()314 nxt_rbtree1_insert(&mb_tree, &mb_nodes[n]); in nxt_rbtree1_mb_insert()332 nxt_rbtree1_delete(&mb_tree, &mb_nodes[n]); in nxt_rbtree1_mb_delete()338 nxt_free(mb_nodes); in nxt_rbtree1_mb_delete()