Lines Matching refs:f
1652 for (int f = optimize_start; f < 32; f++) { in quicklistTest() local
1653 TEST_DESC("add to tail 5x at fill %d at compress %d", f, in quicklistTest()
1655 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
1660 if (f == 32) in quicklistTest()
1666 for (int f = optimize_start; f < 32; f++) { in quicklistTest() local
1667 TEST_DESC("add to head 5x at fill %d at compress %d", f, in quicklistTest()
1669 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
1674 if (f == 32) in quicklistTest()
1680 for (int f = optimize_start; f < 512; f++) { in quicklistTest() local
1681 TEST_DESC("add to tail 500x at fill %d at compress %d", f, in quicklistTest()
1683 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
1688 if (f == 32) in quicklistTest()
1694 for (int f = optimize_start; f < 512; f++) { in quicklistTest() local
1695 TEST_DESC("add to head 500x at fill %d at compress %d", f, in quicklistTest()
1697 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
1702 if (f == 32) in quicklistTest()
1715 for (int f = optimize_start; f < 32; f++) { in quicklistTest() local
1717 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
1727 for (int f = optimize_start; f < 3; f++) { in quicklistTest() local
1728 TEST_DESC("rotate 500 val 5000 times at fill %d at compress %d", f, in quicklistTest()
1730 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
1742 if (f == 1) in quicklistTest()
1744 else if (f == 2) in quicklistTest()
1746 else if (f == 32) in quicklistTest()
1923 for (int f = optimize_start; f < 12; f++) { in quicklistTest() local
1926 f, options[_i]) { in quicklistTest()
1927 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
1931 quicklistSetFill(ql, f); in quicklistTest()
1979 for (int f = optimize_start; f < 1024; f++) { in quicklistTest() local
1983 f, options[_i]) { in quicklistTest()
1984 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
1992 if (f == 32) in quicklistTest()
1998 for (int f = optimize_start; f < 1024; f++) { in quicklistTest() local
2001 f, options[_i]) { in quicklistTest()
2002 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2014 if (f == 32) in quicklistTest()
2052 for (int f = optimize_start; f < 512; f++) { in quicklistTest() local
2053 TEST_DESC("index 1,200 from 500 list at fill %d at compress %d", f, in quicklistTest()
2055 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2072 TEST_DESC("index -1,-2 from 500 list at fill %d at compress %d", f, in quicklistTest()
2074 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2091 TEST_DESC("index -100 from 500 list at fill %d at compress %d", f, in quicklistTest()
2093 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2106 f, options[_i]) { in quicklistTest()
2107 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2279 for (int f = optimize_start; f < 16; f++) { in quicklistTest() local
2280 TEST_DESC("lrem test at fill %d at compress %d", f, options[_i]) { in quicklistTest()
2281 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2363 for (int f = optimize_start; f < 16; f++) { in quicklistTest() local
2364 TEST_DESC("iterate reverse + delete at fill %d at compress %d", f, in quicklistTest()
2366 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2403 for (int f = optimize_start; f < 800; f++) { in quicklistTest() local
2404 TEST_DESC("iterator at index test at fill %d at compress %d", f, in quicklistTest()
2406 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2430 for (int f = optimize_start; f < 40; f++) { in quicklistTest() local
2431 TEST_DESC("ltrim test A at fill %d at compress %d", f, in quicklistTest()
2433 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2441 if (f == 32) in quicklistTest()
2454 if (f == 32) in quicklistTest()
2460 for (int f = optimize_start; f < 40; f++) { in quicklistTest() local
2461 TEST_DESC("ltrim test B at fill %d at compress %d", f, in quicklistTest()
2465 quicklist *ql = quicklistNew(f, QUICKLIST_NOCOMPRESS); in quicklistTest()
2473 if (f == 32) in quicklistTest()
2478 if (f == 32) in quicklistTest()
2507 for (int f = optimize_start; f < 40; f++) { in quicklistTest() local
2508 TEST_DESC("ltrim test C at fill %d at compress %d", f, in quicklistTest()
2510 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2518 if (f == 32) in quicklistTest()
2524 if (f == 32) in quicklistTest()
2536 for (int f = optimize_start; f < 40; f++) { in quicklistTest() local
2537 TEST_DESC("ltrim test D at fill %d at compress %d", f, in quicklistTest()
2539 quicklist *ql = quicklistNew(f, options[_i]); in quicklistTest()
2547 if (f == 32) in quicklistTest()
2557 for (int f = optimize_start; f < 72; f++) { in quicklistTest() local
2559 f, options[_i]) { in quicklistTest()
2573 quicklist *ql = quicklistCreateFromZiplist(f, options[_i], zl); in quicklistTest()
2574 if (f == 1) in quicklistTest()
2576 else if (f == 32) in quicklistTest()
2578 else if (f == 66) in quicklistTest()
2593 for (int f = optimize_start; f < 128; f++) { in quicklistTest() local
2599 list_sizes[list], f, depth) { in quicklistTest()
2600 quicklist *ql = quicklistNew(f, depth); in quicklistTest()