radixtree.c | 1470 unsigned int nnodes = 100000; local in function:test2 1479 nodes = malloc(nnodes * sizeof(*nodes)); 1484 for (i = 0; i < nnodes; i++) { 1492 n->idx %= nnodes * 2; 1512 for (i = 0; i < nnodes; i++) { 1517 printops(title, "lookup", 0, nnodes, &stv, &etv); 1523 for (i = 0; i < nnodes; i++) { 1539 printops(title, "get_tag", tagmask, nnodes, &stv, &etv); 1543 for (i = 0; i < nnodes; i++) { 1548 printops(title, "remove", 0, nnodes, &stv, &etv) [all...] |