lib/test_maple_tree.c

297

check_insert(mt, i, (void *) i);

lib/test_maple_tree.c

328

check_insert(mt, i, (void *) i);

lib/test_maple_tree.c

343

check_insert(mt, huge, (void *) huge);

lib/test_maple_tree.c

344

check_insert(mt, 0, xa_mk_value(0));

lib/test_maple_tree.c

3827

check_insert(&tree, set[9], &tree); /* Insert 0 */

lib/test_maple_tree.c

3831

check_insert(&tree, set[10], ptr); /* Insert 5003 */

lib/test_maple_tree.c

3841

check_insert(&tree, set[0], &tree); /* Insert 5015 */

lib/test_maple_tree.c

3850

check_insert(&tree, set[1], ptr); /* insert 5014 -> ptr */

lib/test_maple_tree.c

3857

check_insert(&tree, set[6], ptr); /* insert 1002 -> ptr */

lib/test_maple_tree.c

3858

check_insert(&tree, set[7], &tree); /* insert 1003 -> &tree */

lib/test_maple_tree.c

3870

check_insert(&tree, set[5], ptr); /* insert 1001 -> ptr */

lib/test_maple_tree.c

3871

check_insert(&tree, set[7], &tree); /* insert 1003 -> &tree */

lib/test_maple_tree.c

3872

check_insert(&tree, set[6], ptr); /* insert 1002 -> ptr */

lib/test_maple_tree.c

3887

check_insert(&tree, set[0], ptr); /* 5015 */

lib/test_maple_tree.c

3888

check_insert(&tree, set[1], &tree); /* 5014 */

lib/test_maple_tree.c

3889

check_insert(&tree, set[2], ptr); /* 5017 */

lib/test_maple_tree.c

3890

check_insert(&tree, set[3], &tree); /* 25 */

lib/test_maple_tree.c

3895

check_insert(&tree, set[4], ptr); /* 1000 < Should split. */

lib/test_maple_tree.c

3901

check_insert(&tree, set[5], &tree); /* 1001 */

lib/test_maple_tree.c

3908

check_insert(&tree, set[6], ptr);

lib/test_maple_tree.c

3916

check_insert(&tree, set[7], &tree);

lib/test_maple_tree.c

3918

check_insert(&tree, set[8], ptr);

lib/test_maple_tree.c

3920

check_insert(&tree, set[9], &tree);

lib/test_xarray.c

2239

check_insert(&array);

tools/testing/radix-tree/maple.c

71

#define erase_check_insert(mt, i) check_insert(mt, set[i], entry[i%2])