xref: /freebsd/tools/test/stress2/misc/datamove3.sh (revision 32ded86a0616aa2d66a59ea60f56ed4bcb3e36d2)
18a272653SPeter Holm#!/bin/sh
28a272653SPeter Holm
38a272653SPeter Holm#
48a272653SPeter Holm# Copyright (c) 2009 Peter Holm <pho@FreeBSD.org>
58a272653SPeter Holm# All rights reserved.
68a272653SPeter Holm#
78a272653SPeter Holm# Redistribution and use in source and binary forms, with or without
88a272653SPeter Holm# modification, are permitted provided that the following conditions
98a272653SPeter Holm# are met:
108a272653SPeter Holm# 1. Redistributions of source code must retain the above copyright
118a272653SPeter Holm#    notice, this list of conditions and the following disclaimer.
128a272653SPeter Holm# 2. Redistributions in binary form must reproduce the above copyright
138a272653SPeter Holm#    notice, this list of conditions and the following disclaimer in the
148a272653SPeter Holm#    documentation and/or other materials provided with the distribution.
158a272653SPeter Holm#
168a272653SPeter Holm# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
178a272653SPeter Holm# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
188a272653SPeter Holm# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
198a272653SPeter Holm# ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
208a272653SPeter Holm# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
218a272653SPeter Holm# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
228a272653SPeter Holm# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
238a272653SPeter Holm# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
248a272653SPeter Holm# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
258a272653SPeter Holm# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
268a272653SPeter Holm# SUCH DAMAGE.
278a272653SPeter Holm#
288a272653SPeter Holm
298a272653SPeter Holm# Threaded variation of datamove.sh
308a272653SPeter Holm
318a272653SPeter Holm# Based on a test scenario by ups and suggestions by kib
328a272653SPeter Holm
338a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1
348a272653SPeter Holm
358a272653SPeter Holm. ../default.cfg
368a272653SPeter Holm
378a272653SPeter Holmhere=`pwd`
388a272653SPeter Holmcd /tmp
398a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > datamove3.c
408a272653SPeter Holmmycc -o datamove3 -Wall datamove3.c -lpthread
418a272653SPeter Holmrm -f datamove3.c
428a272653SPeter Holm
438a272653SPeter Holmn=5
448a272653SPeter Holmold=`sysctl vm.old_msync | awk '{print $NF}'`
458a272653SPeter Holmsysctl vm.old_msync=1
468a272653SPeter Holmfor i in `jot $n`; do
478a272653SPeter Holm	mkdir -p /tmp/datamove3.dir.$i
488a272653SPeter Holm	cd /tmp/datamove3.dir.$i
498a272653SPeter Holm	/tmp/datamove3 &
508a272653SPeter Holmdone
518a272653SPeter Holmcd /tmp
528a272653SPeter Holmfor i in `jot $n`; do
538a272653SPeter Holm	wait
548a272653SPeter Holmdone
558a272653SPeter Holmfor i in `jot $n`; do
568a272653SPeter Holm	rm -rf /tmp/datamove3.dir.$i
578a272653SPeter Holmdone
588a272653SPeter Holmsysctl vm.old_msync=$old
598a272653SPeter Holm
608a272653SPeter Holmrm -rf /tmp/datamove3
618a272653SPeter Holmexit 0
628a272653SPeter HolmEOF
638a272653SPeter Holm/*-
648a272653SPeter Holm * Copyright (c) 2006, Stephan Uphoff <ups@freebsd.org>
658a272653SPeter Holm * All rights reserved.
668a272653SPeter Holm *
678a272653SPeter Holm * Redistribution and use in source and binary forms, with or without
688a272653SPeter Holm * modification, are permitted provided that the following conditions
698a272653SPeter Holm * are met:
708a272653SPeter Holm * 1. Redistributions of source code must retain the above copyright
718a272653SPeter Holm *    notice unmodified, this list of conditions, and the following
728a272653SPeter Holm *    disclaimer.
738a272653SPeter Holm * 2. Redistributions in binary form must reproduce the above copyright
748a272653SPeter Holm *    notice, this list of conditions and the following disclaimer in the
758a272653SPeter Holm *    documentation and/or other materials provided with the distribution.
768a272653SPeter Holm *
778a272653SPeter Holm * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
788a272653SPeter Holm * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
798a272653SPeter Holm * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
808a272653SPeter Holm * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
818a272653SPeter Holm * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
828a272653SPeter Holm * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
838a272653SPeter Holm * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
848a272653SPeter Holm * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
858a272653SPeter Holm * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
868a272653SPeter Holm * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
878a272653SPeter Holm */
888a272653SPeter Holm
898a272653SPeter Holm#include <err.h>
908a272653SPeter Holm#include <fcntl.h>
918a272653SPeter Holm#include <pthread.h>
928a272653SPeter Holm#include <stdio.h>
938a272653SPeter Holm#include <stdio.h>
948a272653SPeter Holm#include <stdlib.h>
958a272653SPeter Holm#include <string.h>
968a272653SPeter Holm#include <sys/mman.h>
978a272653SPeter Holm#include <sys/stat.h>
988a272653SPeter Holm#include <sys/types.h>
998a272653SPeter Holm#include <unistd.h>
1008a272653SPeter Holm
1018a272653SPeter Holmstruct args {
1028a272653SPeter Holm	char *bp;
1038a272653SPeter Holm	int fd1;
1048a272653SPeter Holm	int fd2;
1058a272653SPeter Holm} a[2];
1068a272653SPeter Holm
1078a272653SPeter Holmint prepareFile(char *, int *);
1088a272653SPeter Holmvoid * mapBuffer(void *);
1098a272653SPeter Holmint startIO(int, char *);
1108a272653SPeter Holm
1118a272653SPeter Holmint pagesize;
1128a272653SPeter Holm
1138a272653SPeter Holm#define FILESIZE (32*1024)
1148a272653SPeter Holmchar wbuffer   [FILESIZE];
1158a272653SPeter Holm
1168a272653SPeter Holm/* Create a FILESIZE sized file - then remove file data from the cache */
1178a272653SPeter Holmint
1188a272653SPeter HolmprepareFile(char *filename, int *fdp)
1198a272653SPeter Holm{
1208a272653SPeter Holm	int fd;
1218a272653SPeter Holm	int len;
1228a272653SPeter Holm	int status;
1238a272653SPeter Holm	void *addr;
1248a272653SPeter Holm
1258a272653SPeter Holm	fd = open(filename, O_CREAT | O_TRUNC | O_RDWR, S_IRWXU);
1268a272653SPeter Holm	if (fd == -1) {
1278a272653SPeter Holm		perror("Creating file");
1288a272653SPeter Holm		return fd;
1298a272653SPeter Holm	}
1308a272653SPeter Holm	len = write(fd, wbuffer, FILESIZE);
1318a272653SPeter Holm	if (len < 0) {
1328a272653SPeter Holm		perror("Write failed");
1338a272653SPeter Holm		return 1;
1348a272653SPeter Holm	}
1358a272653SPeter Holm	status = fsync(fd);
1368a272653SPeter Holm	if (status != 0) {
1378a272653SPeter Holm		perror("fsync failed");
1388a272653SPeter Holm		return 1;
1398a272653SPeter Holm	}
1408a272653SPeter Holm	addr = mmap(NULL, FILESIZE, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
1418a272653SPeter Holm	if (addr == MAP_FAILED) {
1428a272653SPeter Holm		perror("Mmap failed");
1438a272653SPeter Holm		return 1;
1448a272653SPeter Holm	}
1458a272653SPeter Holm	status = msync(addr, FILESIZE, MS_INVALIDATE | MS_SYNC);
1468a272653SPeter Holm	if (status != 0) {
1478a272653SPeter Holm		perror("Msync failed");
1488a272653SPeter Holm		return 1;
1498a272653SPeter Holm	}
1508a272653SPeter Holm	munmap(addr, FILESIZE);
1518a272653SPeter Holm
1528a272653SPeter Holm	*fdp = fd;
1538a272653SPeter Holm	return 0;
1548a272653SPeter Holm}
1558a272653SPeter Holm
1568a272653SPeter Holm/* mmap a 2 page buffer - first page is from fd1, second page from fd2 */
1578a272653SPeter Holmvoid *
1588a272653SPeter HolmmapBuffer(void *ar)
1598a272653SPeter Holm{
1608a272653SPeter Holm	void *addr;
1618a272653SPeter Holm	char *buffer;
1628a272653SPeter Holm	int i;
1638a272653SPeter Holm
16428e0b888SPeter Holm	i = (intptr_t)ar;
1658a272653SPeter Holm	addr = mmap(NULL, pagesize * 2, PROT_READ | PROT_WRITE, MAP_SHARED, a[i].fd1, 0);
1668a272653SPeter Holm	if (addr == MAP_FAILED) {
1678a272653SPeter Holm		err(1, "Mmap failed");
1688a272653SPeter Holm	}
1698a272653SPeter Holm	buffer = addr;
1708a272653SPeter Holm	addr = mmap(buffer + pagesize, pagesize, PROT_READ | PROT_WRITE, MAP_FIXED |
1718a272653SPeter Holm		    MAP_SHARED, a[i].fd2, 0);
1728a272653SPeter Holm
1738a272653SPeter Holm	if (addr == MAP_FAILED) {
1748a272653SPeter Holm		err(1, "Mmap2 failed");
1758a272653SPeter Holm	}
1768a272653SPeter Holm	a[i].bp = buffer;
1778a272653SPeter Holm	sleep(1);
1788a272653SPeter Holm	return (NULL);
1798a272653SPeter Holm}
1808a272653SPeter Holm
1818a272653SPeter Holmint
1828a272653SPeter HolmstartIO(int fd, char *buffer)
1838a272653SPeter Holm{
1848a272653SPeter Holm	ssize_t len;
1858a272653SPeter Holm
1868a272653SPeter Holm	len = write(fd, buffer, 2 * pagesize);
1878a272653SPeter Holm	if (len == -1) {
1888a272653SPeter Holm		warn("startIO(%d, %p): write failed", fd, buffer);
1898a272653SPeter Holm		return 1;
1908a272653SPeter Holm	}
1918a272653SPeter Holm	return 0;
1928a272653SPeter Holm}
1938a272653SPeter Holm
1948a272653SPeter Holmint
195*32ded86aSPeter Holmmain(void)
1968a272653SPeter Holm{
1978a272653SPeter Holm
1988a272653SPeter Holm	int fdA, fdB, fdDelayA, fdDelayB;
1998a272653SPeter Holm	int r, status;
2008a272653SPeter Holm	char *bufferA, *bufferB;
2018a272653SPeter Holm	pid_t pid;
2028a272653SPeter Holm	pthread_t threads[2];
2038a272653SPeter Holm
2048a272653SPeter Holm	pagesize = getpagesize();
2058a272653SPeter Holm
2068a272653SPeter Holm	if ((prepareFile("A", &fdA))
2078a272653SPeter Holm	    || (prepareFile("B", &fdB))
2088a272653SPeter Holm	    || (prepareFile("DelayA", &fdDelayA))
2098a272653SPeter Holm	    || (prepareFile("DelayB", &fdDelayB)))
2108a272653SPeter Holm		exit(1);
2118a272653SPeter Holm
2128a272653SPeter Holm	a[0].fd1 = fdDelayA;
2138a272653SPeter Holm	a[0].fd2 = fdB;
2148a272653SPeter Holm
2158a272653SPeter Holm	a[1].fd1 = fdDelayB;
2168a272653SPeter Holm	a[1].fd2 = fdA;
2178a272653SPeter Holm
2188a272653SPeter Holm	if ((r = pthread_create(&threads[0], NULL, mapBuffer, (void *)0)) != 0)
2198a272653SPeter Holm		errc(1, r, "pthread_create()");
2208a272653SPeter Holm	if ((r = pthread_create(&threads[1], NULL, mapBuffer, (void *)1)) != 0)
2218a272653SPeter Holm		errc(1, r, "pthread_create()");
2228a272653SPeter Holm
2238a272653SPeter Holm	while (a[0].bp == NULL || a[1].bp == NULL)
2248a272653SPeter Holm		pthread_yield();
2258a272653SPeter Holm
2268a272653SPeter Holm	bufferA = a[0].bp;
2278a272653SPeter Holm	bufferB = a[1].bp;
2288a272653SPeter Holm
2298a272653SPeter Holm	pid = fork();
2308a272653SPeter Holm
2318a272653SPeter Holm	if (pid == 0) {
2328a272653SPeter Holm		status = startIO(fdA, bufferA);
2338a272653SPeter Holm		exit(status);
2348a272653SPeter Holm	}
2358a272653SPeter Holm	if (pid == -1) {
2368a272653SPeter Holm		exit(1);
2378a272653SPeter Holm	}
2388a272653SPeter Holm	status = startIO(fdB, bufferB);
2398a272653SPeter Holm	exit(status);
2408a272653SPeter Holm
2418a272653SPeter Holm}
242