18a272653SPeter Holm#!/bin/sh 28a272653SPeter Holm 38a272653SPeter Holm# 4*4d846d26SWarner Losh# SPDX-License-Identifier: BSD-2-Clause 58a272653SPeter Holm# 68a272653SPeter Holm# Copyright (c) 2021 Peter Holm <pho@FreeBSD.org> 78a272653SPeter Holm# 88a272653SPeter Holm# Redistribution and use in source and binary forms, with or without 98a272653SPeter Holm# modification, are permitted provided that the following conditions 108a272653SPeter Holm# are met: 118a272653SPeter Holm# 1. Redistributions of source code must retain the above copyright 128a272653SPeter Holm# notice, this list of conditions and the following disclaimer. 138a272653SPeter Holm# 2. Redistributions in binary form must reproduce the above copyright 148a272653SPeter Holm# notice, this list of conditions and the following disclaimer in the 158a272653SPeter Holm# documentation and/or other materials provided with the distribution. 168a272653SPeter Holm# 178a272653SPeter Holm# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 188a272653SPeter Holm# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 198a272653SPeter Holm# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 208a272653SPeter Holm# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 218a272653SPeter Holm# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 228a272653SPeter Holm# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 238a272653SPeter Holm# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 248a272653SPeter Holm# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 258a272653SPeter Holm# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 268a272653SPeter Holm# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 278a272653SPeter Holm# SUCH DAMAGE. 288a272653SPeter Holm# 298a272653SPeter Holm 308a272653SPeter Holm# Hunt for https://people.freebsd.org/~pho/stress/log/log0018.txt 318a272653SPeter Holm 328a272653SPeter Holm# Test scenario idea by kib@ 338a272653SPeter Holm# Scenario should be the following (without paging load, so that pages stay 348a272653SPeter Holm# resident): 358a272653SPeter Holm# - create some large file, say 2G 368a272653SPeter Holm# - map it and touch every page to ensure that they all allocated 378a272653SPeter Holm# - unmap, and map again, so while the pages are resident, they are not 388a272653SPeter Holm# installed into page table 398a272653SPeter Holm# Do mincore(2) on the mapped region. 408a272653SPeter Holm# 418a272653SPeter Holm 428a272653SPeter Holm# The problem was not reproduced. 438a272653SPeter Holm 448a272653SPeter Holm. ../default.cfg 458a272653SPeter Holm[ `id -u` -ne 0 ] && echo "Must be root!" && exit 1 468a272653SPeter Holm[ `sysctl -n vm.swap_total` -eq 0 ] && exit 0 478a272653SPeter Holmpath=`dirname $diskimage` 488a272653SPeter Holm[ `df -k $path | tail -1 | awk '{print int($4 / 1024 / 1024)}'` -lt 4 ] && exit 0 498a272653SPeter Holm 508a272653SPeter Holmdir=/tmp 518a272653SPeter Holmodir=`pwd` 528a272653SPeter Holmcd $dir 538a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > $dir/mincore.c 548a272653SPeter Holmmycc -o mincore -Wall -Wextra -O0 -g mincore.c || exit 1 558a272653SPeter Holmrm -f mincore.c 568a272653SPeter Holmcd $odir 578a272653SPeter Holm 588a272653SPeter Holm(cd ../testcases/swap; ./swap -t 10m -i 20 -l 100) & 598a272653SPeter Holmfor i in `jot 20`; do 608a272653SPeter Holm [ `swapinfo | tail -1 | awk '{gsub("%", ""); print $5}'` -gt 0 ] && break 618a272653SPeter Holm sleep 5 628a272653SPeter Holm pgrep -q swap || break 638a272653SPeter Holmdone 648a272653SPeter Holmecho "`date +%T` Go" 658a272653SPeter Holm 668a272653SPeter Holm$dir/mincore $path; s=$? 678a272653SPeter Holm 688a272653SPeter Holmwhile pkill swap; do :; done 698a272653SPeter Holmwait 708a272653SPeter Holmrm -rf $dir/mincore 718a272653SPeter Holmexit $s 728a272653SPeter Holm 738a272653SPeter HolmEOF 748a272653SPeter Holm#include <sys/param.h> 758a272653SPeter Holm#include <sys/mman.h> 768a272653SPeter Holm#include <sys/stat.h> 778a272653SPeter Holm#include <sys/wait.h> 788a272653SPeter Holm 798a272653SPeter Holm#include <fcntl.h> 808a272653SPeter Holm#include <err.h> 818a272653SPeter Holm#include <errno.h> 828a272653SPeter Holm#include <stdlib.h> 838a272653SPeter Holm#include <stdio.h> 848a272653SPeter Holm#include <string.h> 858a272653SPeter Holm#include <time.h> 868a272653SPeter Holm#include <unistd.h> 878a272653SPeter Holm 888a272653SPeter Holm#define PARALLEL 2 898a272653SPeter Holm#define RUNTIME 300 908a272653SPeter Holm#define SIZE (2LL * 1024 * 1024 * 1024) 918a272653SPeter Holm 928a272653SPeter Holmstatic void 938a272653SPeter Holmtest(char *dir) 948a272653SPeter Holm{ 958a272653SPeter Holm size_t i, len; 968a272653SPeter Holm int fd; 978a272653SPeter Holm char file[128], *p, *vec; 988a272653SPeter Holm 998a272653SPeter Holm len = SIZE; 1008a272653SPeter Holm snprintf(file, sizeof(file), "%s/mincore.%d.file", dir, getpid()); 1018a272653SPeter Holm if ((fd = open(file, O_RDWR | O_CREAT | O_TRUNC, DEFFILEMODE)) 1028a272653SPeter Holm == -1) 1038a272653SPeter Holm err(1, "open(%s)", file); 1048a272653SPeter Holm if (unlink(file) == -1) 1058a272653SPeter Holm err(1, "unlink(%s)", file); 1068a272653SPeter Holm if (ftruncate(fd, len) == -1) 1078a272653SPeter Holm err(1, "ftruncete()"); 1088a272653SPeter Holm if ((p = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0)) == 1098a272653SPeter Holm MAP_FAILED) 1108a272653SPeter Holm err(1, "mmap()"); 1118a272653SPeter Holm for (i = 0; i < len; i += PAGE_SIZE) 1128a272653SPeter Holm p[i] = 1; 1138a272653SPeter Holm if (munmap(p, len) == -1) 1148a272653SPeter Holm err(1, "munmap()"); 1158a272653SPeter Holm if ((vec = malloc(len / PAGE_SIZE)) == NULL) 1168a272653SPeter Holm err(1, "malloc"); 1178a272653SPeter Holm if ((p = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0)) == 1188a272653SPeter Holm MAP_FAILED) 1198a272653SPeter Holm err(1, "mmap()"); 1208a272653SPeter Holm if (mincore(p, len, vec) == -1) 1218a272653SPeter Holm err(1, "mincore()"); 1228a272653SPeter Holm if (munmap(p, len) == -1) 1238a272653SPeter Holm err(1, "munmap()"); 1248a272653SPeter Holm close(fd); 1258a272653SPeter Holm 1268a272653SPeter Holm _exit(0); 1278a272653SPeter Holm} 1288a272653SPeter Holm 1298a272653SPeter Holmint 1308a272653SPeter Holmmain(int argc __unused, char *argv[]) 1318a272653SPeter Holm{ 1328a272653SPeter Holm pid_t pids[PARALLEL]; 1338a272653SPeter Holm time_t start; 1348a272653SPeter Holm int i; 1358a272653SPeter Holm 1368a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 1378a272653SPeter Holm if ((pids[i] = fork()) == 0) 1388a272653SPeter Holm test(argv[1]); 1398a272653SPeter Holm } 1408a272653SPeter Holm 1418a272653SPeter Holm start = time(NULL); 1428a272653SPeter Holm while (time(NULL) - start < RUNTIME) { 1438a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 1448a272653SPeter Holm if (waitpid(pids[i], NULL, WNOHANG) == pids[i]) { 1458a272653SPeter Holm if ((pids[i] = fork()) == 0) 1468a272653SPeter Holm test(argv[1]); 1478a272653SPeter Holm } 1488a272653SPeter Holm } 1498a272653SPeter Holm } 1508a272653SPeter Holm 1518a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 1528a272653SPeter Holm if (waitpid(pids[i], NULL, 0) != pids[i]) 1538a272653SPeter Holm err(1, "waitpid"); 1548a272653SPeter Holm } 1558a272653SPeter Holm 1568a272653SPeter Holm return (0); 1578a272653SPeter Holm} 158