Lines Matching defs:LEN
41 #define LEN(region) ((region.end - region.start)/page_size)
231 sum += LEN(vec[i]);
390 ksft_test_result(ret == 1 && LEN(vec[0]) == 2 &&
392 ret2 == 2 && LEN(vec2[0]) == 1 && vec2[0].start == (uintptr_t)mem &&
393 LEN(vec2[1]) == vec_size - 3 &&
423 ksft_test_result(ret == 1 && LEN(vec[0]) == mem_size/page_size,
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,
756 ksft_test_result(written == 1 && LEN(vec[0]) >= 1,
774 && LEN(vec[0]) == 2,
846 LEN(vec[0]) == vec_size && vec[0].categories == PAGE_IS_WRITTEN,
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,
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 &&
1150 ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
1176 LEN(vec[0]) == ceilf((float)sbuf.st_size/page_size) &&
1212 LEN(vec[0]) == (buf_size/page_size) &&
1251 ksft_test_result(ret == 1 && LEN(vec) == 2, "%s Both pages written\n", __func__);
1286 ksft_test_result(ret == 1 && LEN(vec) == 2,
1299 ksft_test_result(ret == 1 && LEN(vec) == 2,
1343 for (j = 0; j < LEN(rgns[i]); ++j)