/* * Tests the user interface. This test triggers most of the documented * error conditions in mincore().
*/
TEST(basic_interface)
{ int retval; int page_size; unsignedchar vec[1]; char *addr;
page_size = sysconf(_SC_PAGESIZE);
/* Query a 0 byte sized range */
retval = mincore(0, 0, vec);
EXPECT_EQ(0, retval);
/* Addresses in the specified range are invalid or unmapped */
errno = 0;
retval = mincore(NULL, page_size, vec);
EXPECT_EQ(-1, retval);
EXPECT_EQ(ENOMEM, errno);
/* * Test mincore() behavior on a private anonymous page mapping. * Check that the page is not loaded into memory right after the mapping * but after accessing it (on-demand allocation). * Then free the page and check that it's not memory-resident.
*/
TEST(check_anonymous_locked_pages)
{ unsignedchar vec[1]; char *addr; int retval; int page_size;
page_size = sysconf(_SC_PAGESIZE);
/* Map one page and check it's not memory-resident */
errno = 0;
addr = mmap(NULL, page_size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
ASSERT_NE(MAP_FAILED, addr) {
TH_LOG("mmap error: %s", strerror(errno));
}
retval = mincore(addr, page_size, vec);
ASSERT_EQ(0, retval);
ASSERT_EQ(0, vec[0]) {
TH_LOG("Page found in memory before use");
}
/* Touch the page and check again. It should now be in memory */
addr[0] = 1;
mlock(addr, page_size);
retval = mincore(addr, page_size, vec);
ASSERT_EQ(0, retval);
ASSERT_EQ(1, vec[0]) {
TH_LOG("Page not found in memory after use");
}
/* * It shouldn't be memory-resident after unlocking it and * marking it as unneeded.
*/
munlock(addr, page_size);
madvise(addr, page_size, MADV_DONTNEED);
retval = mincore(addr, page_size, vec);
ASSERT_EQ(0, retval);
ASSERT_EQ(0, vec[0]) {
TH_LOG("Page in memory after being zapped");
}
munmap(addr, page_size);
}
/* * Check mincore() behavior on huge pages. * This test will be skipped if the mapping fails (ie. if there are no * huge pages available). * * Make sure the system has at least one free huge page, check * "HugePages_Free" in /proc/meminfo. * Increment /sys/kernel/mm/hugepages/hugepages-2048kB/nr_hugepages if * needed.
*/
TEST(check_huge_pages)
{ unsignedchar vec[1]; char *addr; int retval; int page_size;
page_size = sysconf(_SC_PAGESIZE);
errno = 0;
addr = mmap(NULL, page_size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANONYMOUS | MAP_HUGETLB,
-1, 0); if (addr == MAP_FAILED) { if (errno == ENOMEM || errno == EINVAL)
SKIP(return, "No huge pages available or CONFIG_HUGETLB_PAGE disabled."); else
TH_LOG("mmap error: %s", strerror(errno));
}
retval = mincore(addr, page_size, vec);
ASSERT_EQ(0, retval);
ASSERT_EQ(0, vec[0]) {
TH_LOG("Page found in memory before use");
}
addr[0] = 1;
mlock(addr, page_size);
retval = mincore(addr, page_size, vec);
ASSERT_EQ(0, retval);
ASSERT_EQ(1, vec[0]) {
TH_LOG("Page not found in memory after use");
}
/* * Test mincore() behavior on a file-backed page. * No pages should be loaded into memory right after the mapping. Then, * accessing any address in the mapping range should load the page * containing the address and a number of subsequent pages (readahead). * * The actual readahead settings depend on the test environment, so we * can't make a lot of assumptions about that. This test covers the most * general cases.
*/
TEST(check_file_mmap)
{ unsignedchar *vec; int vec_size; char *addr; int retval; int page_size; int fd; int i; int ra_pages = 0;
errno = 0;
fd = open(".", O_TMPFILE | O_RDWR, 0600); if (fd < 0) {
ASSERT_EQ(errno, EOPNOTSUPP) {
TH_LOG("Can't create temporary file: %s",
strerror(errno));
}
SKIP(goto out_free, "O_TMPFILE not supported by filesystem.");
}
errno = 0;
retval = fallocate(fd, 0, 0, FILE_SIZE); if (retval) {
ASSERT_EQ(errno, EOPNOTSUPP) {
TH_LOG("Error allocating space for the temporary file: %s",
strerror(errno));
}
SKIP(goto out_close, "fallocate not supported by filesystem.");
}
/* * Map the whole file, the pages shouldn't be fetched yet.
*/
errno = 0;
addr = mmap(NULL, FILE_SIZE, PROT_READ | PROT_WRITE,
MAP_SHARED, fd, 0);
ASSERT_NE(MAP_FAILED, addr) {
TH_LOG("mmap error: %s", strerror(errno));
}
retval = mincore(addr, FILE_SIZE, vec);
ASSERT_EQ(0, retval); for (i = 0; i < vec_size; i++) {
ASSERT_EQ(0, vec[i]) {
TH_LOG("Unexpected page in memory");
}
}
/* * Touch a page in the middle of the mapping. We expect the next * few pages (the readahead window) to be populated too.
*/
addr[FILE_SIZE / 2] = 1;
retval = mincore(addr, FILE_SIZE, vec);
ASSERT_EQ(0, retval);
ASSERT_EQ(1, vec[FILE_SIZE / 2 / page_size]) {
TH_LOG("Page not found in memory after use");
}
i = FILE_SIZE / 2 / page_size + 1; while (i < vec_size && vec[i]) {
ra_pages++;
i++;
}
EXPECT_GT(ra_pages, 0) {
TH_LOG("No read-ahead pages found in memory");
}
/* * End of the readahead window. The rest of the pages shouldn't * be in memory.
*/ if (i < vec_size) { while (i < vec_size && !vec[i])
i++;
EXPECT_EQ(vec_size, i) {
TH_LOG("Unexpected page in memory beyond readahead window");
}
}
/* * Test mincore() behavior on a page backed by a tmpfs file. This test * performs the same steps as the previous one.
*/
TEST(check_tmpfs_mmap)
{ unsignedchar *vec; int vec_size; char *addr; int retval; int page_size; int fd; int i;
/* * Map the whole file, the pages shouldn't be fetched yet.
*/
errno = 0;
addr = mmap(NULL, FILE_SIZE, PROT_READ | PROT_WRITE,
MAP_SHARED, fd, 0);
ASSERT_NE(MAP_FAILED, addr) {
TH_LOG("mmap error: %s", strerror(errno));
}
retval = mincore(addr, FILE_SIZE, vec);
ASSERT_EQ(0, retval); for (i = 0; i < vec_size; i++) {
ASSERT_EQ(0, vec[i]) {
TH_LOG("Unexpected page in memory");
}
}
/* * Touch a page in the middle of the mapping.
*/
addr[FILE_SIZE / 2] = 1;
retval = mincore(addr, FILE_SIZE, vec);
ASSERT_EQ(0, retval);
ASSERT_EQ(1, vec[FILE_SIZE / 2 / page_size]) {
TH_LOG("Page not found in memory after use");
}
munmap(addr, FILE_SIZE);
close(fd);
free(vec);
}
TEST_HARNESS_MAIN
Messung V0.5
¤ Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.0.7Bemerkung:
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.