xref: /freebsd/tools/test/stress2/misc/largepage.sh (revision 4d846d260e2b9a3d4d0a701462568268cbfe7a5b)
18a272653SPeter Holm#!/bin/sh
28a272653SPeter Holm
38a272653SPeter Holm#
4*4d846d26SWarner Losh# SPDX-License-Identifier: BSD-2-Clause
58a272653SPeter Holm#
68a272653SPeter Holm# Copyright (c) 2020 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# Test scenario for of non-transparent superpages.
318a272653SPeter Holm
328a272653SPeter Holm# No problems seen.
338a272653SPeter Holm
348a272653SPeter Holm. ../default.cfg
358a272653SPeter Holm[ `uname -p` = "i386" ] && exit 0
368a272653SPeter Holm[ -z "`sysctl -i vm.largepages`" ] && exit 0
378a272653SPeter Holm
388a272653SPeter Holmodir=`pwd`
398a272653SPeter Holmcd /tmp
408a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > largepage.c
418a272653SPeter Holmmycc -o largepage -Wall -Wextra -g -O0 largepage.c || exit 1
428a272653SPeter Holmrm -f largepage.c
438a272653SPeter Holmcd $odir
448a272653SPeter Holm
458a272653SPeter Holm/tmp/largepage
468a272653SPeter Holms=$?
478a272653SPeter Holm
488a272653SPeter Holmfor path in `posixshmcontrol ls | grep largepage | awk '{print $NF}'`; do
498a272653SPeter Holm	echo "posixshmcontrol rm $path"
508a272653SPeter Holm	posixshmcontrol rm $path
518a272653SPeter Holmdone
528a272653SPeter Holmrm -f ./largepage /tmp/largepage.0* /tmp/largepage
538a272653SPeter Holmexit 0
548a272653SPeter Holm
558a272653SPeter HolmEOF
568a272653SPeter Holm#include <sys/param.h>
578a272653SPeter Holm#include <sys/mman.h>
588a272653SPeter Holm#include <sys/wait.h>
598a272653SPeter Holm
608a272653SPeter Holm#include <err.h>
618a272653SPeter Holm#include <errno.h>
628a272653SPeter Holm#include <fcntl.h>
638a272653SPeter Holm#include <stdio.h>
648a272653SPeter Holm#include <stdlib.h>
658a272653SPeter Holm#include <string.h>
668a272653SPeter Holm#include <time.h>
678a272653SPeter Holm#include <unistd.h>
688a272653SPeter Holm
698a272653SPeter Holmstatic size_t ps[MAXPAGESIZES];
708a272653SPeter Holmstatic int fd;
718a272653SPeter Holm
728a272653SPeter Holm#define PARALLEL 4
738a272653SPeter Holm#define RUNTIME 60
748a272653SPeter Holm
758a272653SPeter Holmstatic void
768a272653SPeter Holmwork(int idx)
778a272653SPeter Holm{
788a272653SPeter Holm	size_t len;
798a272653SPeter Holm	int i,r;
808a272653SPeter Holm	char *p;
818d72c409SPeter Holm	volatile char val __unused;
828a272653SPeter Holm	char path[PATH_MAX];
838a272653SPeter Holm
848a272653SPeter Holm	len = ps[idx];
858a272653SPeter Holm	sprintf(path, "/tmp/largepage.%06d", getpid());
868a272653SPeter Holm	if ((fd = shm_create_largepage(path, O_CREAT | O_RDWR, idx,
878a272653SPeter Holm	    SHM_LARGEPAGE_ALLOC_DEFAULT, 0600)) == -1)
888a272653SPeter Holm		err(1,"shm_create_largepage(%zu)", len);
898a272653SPeter Holm
908a272653SPeter Holm	for (i = 0; i < 100; i++) {
918a272653SPeter Holm		r = ftruncate(fd, len);
928a272653SPeter Holm		if (r == 0)
938a272653SPeter Holm			break;
948a272653SPeter Holm		usleep(200000);
958a272653SPeter Holm	}
968a272653SPeter Holm	if (r == -1) {
978a272653SPeter Holm		shm_unlink(path);
988a272653SPeter Holm		err(1, "ftruncate(%zu)", len);
998a272653SPeter Holm	}
1008a272653SPeter Holm	close(fd);
1018a272653SPeter Holm	if ((fd = shm_open(path, O_RDWR, 0)) == -1)
1028a272653SPeter Holm		err(1, "shm_open()");
1038a272653SPeter Holm
1048a272653SPeter Holm	if ((p = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0)) ==
1058a272653SPeter Holm			MAP_FAILED) {
1068a272653SPeter Holm		if (errno == ENOMEM)
1078a272653SPeter Holm			return;
1088a272653SPeter Holm		err(1, "mmap()");
1098a272653SPeter Holm	}
1108a272653SPeter Holm
1118a272653SPeter Holm	val = p[arc4random() % len];
1128a272653SPeter Holm
1138a272653SPeter Holm	close(fd);
1148a272653SPeter Holm	if (munmap(p, len) == -1)
1158a272653SPeter Holm		err(1, "munmap(%p)", p);
1168a272653SPeter Holm	if (shm_unlink(path) == -1)
1178a272653SPeter Holm		err(1, "shm_unlink()");
1188a272653SPeter Holm
1198a272653SPeter Holm	_exit(0);
1208a272653SPeter Holm}
1218a272653SPeter Holm
1228a272653SPeter Holmint
1238a272653SPeter Holmmain(void)
1248a272653SPeter Holm{
1258a272653SPeter Holm	pid_t pids[PARALLEL];
1268a272653SPeter Holm	time_t start;
1278a272653SPeter Holm	int e, i, n, nps, status;
1288a272653SPeter Holm
1298a272653SPeter Holm	nps = getpagesizes(ps, MAXPAGESIZES);
1308a272653SPeter Holm	e = 0;
1318a272653SPeter Holm	n = 1;
1328a272653SPeter Holm	start = time(NULL);
1338a272653SPeter Holm	while (time(NULL) - start < RUNTIME && e == 0) {
1348a272653SPeter Holm		for (i = 0; i < PARALLEL; i++) {
1358a272653SPeter Holm			if ((pids[i] = fork()) == 0)
1368a272653SPeter Holm				work(n);
1378a272653SPeter Holm		}
1388a272653SPeter Holm
1398a272653SPeter Holm		for (i = 0; i < PARALLEL; i++) {
1408a272653SPeter Holm			if (waitpid(pids[i], &status, 0) != pids[i])
1418a272653SPeter Holm				err(1, "waitpid(%d)", pids[i]);
1428a272653SPeter Holm			if (status != 0) e = 1;
1438a272653SPeter Holm		}
1448a272653SPeter Holm		n++;
1458a272653SPeter Holm		n = n % nps;
1468a272653SPeter Holm		if (n == 0) /* skip 4k pages */
1478a272653SPeter Holm			n = 1;
1488a272653SPeter Holm	}
1498a272653SPeter Holm	close(fd);
1508a272653SPeter Holm
1518a272653SPeter Holm	return (e);
1528a272653SPeter Holm}
153