Lines Matching refs:ksft_test_result

218 	ksft_test_result(written == 0, "%s all new pages must not be written (dirty)\n", __func__);
265 ksft_test_result(pagemap_ioctl(mem, 0, vec, vec_size, 0,
269 ksft_test_result(pagemap_ioctl(mem, mem_size, NULL, vec_size, 0,
273 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, 0, 0,
277 ksft_test_result(pagemap_ioctl(mem, mem_size, 0, 0, 0,
281 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, -1,
285 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size,
290 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0,
294 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0,
298 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0,
302 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size,
307 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size,
317 ksft_test_result(ret >= 0, "%s Clear area with larger vec size\n", __func__);
328 ksft_test_result((unsigned long long)ret == mem_size/(page_size * 2),
349 ksft_test_result((ret + ret3) == num_pages/2 && ret2 == 2,
370 ksft_test_result(ret == num_pages/2 && ret2 == 1,
390 ksft_test_result(ret == 1 && LEN(vec[0]) == 2 &&
423 ksft_test_result(ret == 1 && LEN(vec[0]) == mem_size/page_size,
482 ksft_test_result(total_pages == mem_size/(page_size*2), "%s Smaller max_pages\n", __func__);
533 ksft_test_result(count == TEST_ITERATIONS, "Smaller vec\n");
560 ksft_test_result(ret == 0 && walk_end == (long)mem,
567 ksft_test_result(ret == 0 && walk_end == (long)mem,
574 ksft_test_result(ret == 0 && walk_end == (long)mem,
581 ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size),
588 ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size),
595 ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size),
602 ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size/2),
609 ksft_test_result(ret == 1 && walk_end == (long)(mem + page_size),
616 ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size),
627 ksft_test_result((unsigned long)ret == vec_size/2 && walk_end == (long)(mem + mem_size),
634 ksft_test_result(ret == 1 && walk_end == (long)(mem + page_size * 2),
641 ksft_test_result(ret == 1 && walk_end == (long)(mem + page_size * 2),
648 ksft_test_result((unsigned long)ret == vec_size/2 && walk_end == (long)(mem + mem_size),
655 ksft_test_result((unsigned long)ret == vec_size/2 && walk_end == (long)(mem + mem_size),
662 ksft_test_result((unsigned long)ret == vec_size/2 && walk_end == (long)(mem + mem_size),
669 ksft_test_result(ret == 1 && walk_end == (long)(mem + page_size * 2),
706 ksft_test_result(written == 0, "%s all new pages must not be written (dirty)\n", prefix);
716 ksft_test_result(written == 1 && LEN(vec[0]) == mem_size/page_size,
732 ksft_test_result(written == 1 && LEN(vec[0]) >= vec_size - 2 && LEN(vec[0]) <= vec_size,
740 ksft_test_result(written == 0,
756 ksft_test_result(written == 1 && LEN(vec[0]) >= 1,
773 ksft_test_result(written == 1 && vec[0].start == (uintptr_t)(&mem[vec_size/2 * page_size])
826 ksft_test_result(ret == 0, "%s all new huge page must not be written (dirty)\n",
835 ksft_test_result(ret == 0, "%s all the huge page must not be written\n", __func__);
845 ksft_test_result(ret == 1 && vec[0].start == (uintptr_t)map &&
862 ksft_test_result(ret == 1 && LEN(vec[0]) > 0,
889 ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2 &&
917 ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2 &&
947 ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2,
971 ksft_test_result(ret == 1 && LEN(vec[0]) == hpage_size/(2*page_size),
979 ksft_test_result(ret2 == 1 && LEN(vec[0]) == (map_size - hpage_size/2)/page_size,
1007 ksft_test_result(written >= 0, "%s Get status of pages\n", __func__);
1048 ksft_test_result(i == TEST_ITERATIONS, "Test %s\n", __func__);
1072 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size,
1076 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
1079 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
1082 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
1085 ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
1103 ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
1111 ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
1119 ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
1128 ksft_test_result(ret == 0, "%s Don't get sd pages\n", __func__);
1133 ksft_test_result(ret == 0, "%s Don't get present pages\n", __func__);
1150 ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
1175 ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)fmem &&
1211 ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)fmem &&
1251 ksft_test_result(ret == 1 && LEN(vec) == 2, "%s Both pages written\n", __func__);
1256 ksft_test_result(pagemap_ioctl(mem, 2 * page_size, &vec, 1, 0, 0,
1286 ksft_test_result(ret == 1 && LEN(vec) == 2,
1299 ksft_test_result(ret == 1 && LEN(vec) == 2,
1415 ksft_test_result(count > 0, "%s count %u\n", __func__, count);
1417 ksft_test_result(count == 0, "%s count %u\n", __func__, count);