item_insert_order

172

item_insert_order(tree, 0, order);

223

item_insert_order(tree, 3 << RADIX_TREE_MAP_SHIFT, 0);

224

item_insert_order(tree, 2 << RADIX_TREE_MAP_SHIFT, 0);

229

item_insert_order(tree, index, order);

47

err = item_insert_order(xa, index[i], order[i]);

90

assert(!item_insert_order(xa, index[i], order[i]));