xref: /freebsd/tools/test/stress2/misc/datamove3.sh (revision 8a272653d9fbd9fc37691c9aad6a05089b4ecb4d)
1*8a272653SPeter Holm#!/bin/sh
2*8a272653SPeter Holm
3*8a272653SPeter Holm#
4*8a272653SPeter Holm# Copyright (c) 2009 Peter Holm <pho@FreeBSD.org>
5*8a272653SPeter Holm# All rights reserved.
6*8a272653SPeter Holm#
7*8a272653SPeter Holm# Redistribution and use in source and binary forms, with or without
8*8a272653SPeter Holm# modification, are permitted provided that the following conditions
9*8a272653SPeter Holm# are met:
10*8a272653SPeter Holm# 1. Redistributions of source code must retain the above copyright
11*8a272653SPeter Holm#    notice, this list of conditions and the following disclaimer.
12*8a272653SPeter Holm# 2. Redistributions in binary form must reproduce the above copyright
13*8a272653SPeter Holm#    notice, this list of conditions and the following disclaimer in the
14*8a272653SPeter Holm#    documentation and/or other materials provided with the distribution.
15*8a272653SPeter Holm#
16*8a272653SPeter Holm# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17*8a272653SPeter Holm# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18*8a272653SPeter Holm# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19*8a272653SPeter Holm# ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20*8a272653SPeter Holm# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21*8a272653SPeter Holm# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22*8a272653SPeter Holm# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23*8a272653SPeter Holm# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24*8a272653SPeter Holm# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25*8a272653SPeter Holm# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26*8a272653SPeter Holm# SUCH DAMAGE.
27*8a272653SPeter Holm#
28*8a272653SPeter Holm
29*8a272653SPeter Holm# Threaded variation of datamove.sh
30*8a272653SPeter Holm
31*8a272653SPeter Holm# Based on a test scenario by ups and suggestions by kib
32*8a272653SPeter Holm
33*8a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1
34*8a272653SPeter Holm
35*8a272653SPeter Holm. ../default.cfg
36*8a272653SPeter Holm
37*8a272653SPeter Holmhere=`pwd`
38*8a272653SPeter Holmcd /tmp
39*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > datamove3.c
40*8a272653SPeter Holmmycc -o datamove3 -Wall datamove3.c -lpthread
41*8a272653SPeter Holmrm -f datamove3.c
42*8a272653SPeter Holm
43*8a272653SPeter Holmn=5
44*8a272653SPeter Holmold=`sysctl vm.old_msync | awk '{print $NF}'`
45*8a272653SPeter Holmsysctl vm.old_msync=1
46*8a272653SPeter Holmfor i in `jot $n`; do
47*8a272653SPeter Holm	mkdir -p /tmp/datamove3.dir.$i
48*8a272653SPeter Holm	cd /tmp/datamove3.dir.$i
49*8a272653SPeter Holm	/tmp/datamove3 &
50*8a272653SPeter Holmdone
51*8a272653SPeter Holmcd /tmp
52*8a272653SPeter Holmfor i in `jot $n`; do
53*8a272653SPeter Holm	wait
54*8a272653SPeter Holmdone
55*8a272653SPeter Holmfor i in `jot $n`; do
56*8a272653SPeter Holm	rm -rf /tmp/datamove3.dir.$i
57*8a272653SPeter Holmdone
58*8a272653SPeter Holmsysctl vm.old_msync=$old
59*8a272653SPeter Holm
60*8a272653SPeter Holmrm -rf /tmp/datamove3
61*8a272653SPeter Holmexit 0
62*8a272653SPeter HolmEOF
63*8a272653SPeter Holm/*-
64*8a272653SPeter Holm * Copyright (c) 2006, Stephan Uphoff <ups@freebsd.org>
65*8a272653SPeter Holm * All rights reserved.
66*8a272653SPeter Holm *
67*8a272653SPeter Holm * Redistribution and use in source and binary forms, with or without
68*8a272653SPeter Holm * modification, are permitted provided that the following conditions
69*8a272653SPeter Holm * are met:
70*8a272653SPeter Holm * 1. Redistributions of source code must retain the above copyright
71*8a272653SPeter Holm *    notice unmodified, this list of conditions, and the following
72*8a272653SPeter Holm *    disclaimer.
73*8a272653SPeter Holm * 2. Redistributions in binary form must reproduce the above copyright
74*8a272653SPeter Holm *    notice, this list of conditions and the following disclaimer in the
75*8a272653SPeter Holm *    documentation and/or other materials provided with the distribution.
76*8a272653SPeter Holm *
77*8a272653SPeter Holm * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
78*8a272653SPeter Holm * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
79*8a272653SPeter Holm * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
80*8a272653SPeter Holm * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
81*8a272653SPeter Holm * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
82*8a272653SPeter Holm * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
83*8a272653SPeter Holm * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
84*8a272653SPeter Holm * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
85*8a272653SPeter Holm * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
86*8a272653SPeter Holm * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
87*8a272653SPeter Holm */
88*8a272653SPeter Holm
89*8a272653SPeter Holm#include <err.h>
90*8a272653SPeter Holm#include <fcntl.h>
91*8a272653SPeter Holm#include <pthread.h>
92*8a272653SPeter Holm#include <stdio.h>
93*8a272653SPeter Holm#include <stdio.h>
94*8a272653SPeter Holm#include <stdlib.h>
95*8a272653SPeter Holm#include <string.h>
96*8a272653SPeter Holm#include <sys/mman.h>
97*8a272653SPeter Holm#include <sys/stat.h>
98*8a272653SPeter Holm#include <sys/types.h>
99*8a272653SPeter Holm#include <unistd.h>
100*8a272653SPeter Holm
101*8a272653SPeter Holmstruct args {
102*8a272653SPeter Holm	char *bp;
103*8a272653SPeter Holm	int fd1;
104*8a272653SPeter Holm	int fd2;
105*8a272653SPeter Holm} a[2];
106*8a272653SPeter Holm
107*8a272653SPeter Holmint prepareFile(char *, int *);
108*8a272653SPeter Holmvoid * mapBuffer(void *);
109*8a272653SPeter Holmint startIO(int, char *);
110*8a272653SPeter Holm
111*8a272653SPeter Holmint pagesize;
112*8a272653SPeter Holm
113*8a272653SPeter Holm#define FILESIZE (32*1024)
114*8a272653SPeter Holmchar wbuffer   [FILESIZE];
115*8a272653SPeter Holm
116*8a272653SPeter Holm/* Create a FILESIZE sized file - then remove file data from the cache */
117*8a272653SPeter Holmint
118*8a272653SPeter HolmprepareFile(char *filename, int *fdp)
119*8a272653SPeter Holm{
120*8a272653SPeter Holm	int fd;
121*8a272653SPeter Holm	int len;
122*8a272653SPeter Holm	int status;
123*8a272653SPeter Holm	void *addr;
124*8a272653SPeter Holm
125*8a272653SPeter Holm	fd = open(filename, O_CREAT | O_TRUNC | O_RDWR, S_IRWXU);
126*8a272653SPeter Holm	if (fd == -1) {
127*8a272653SPeter Holm		perror("Creating file");
128*8a272653SPeter Holm		return fd;
129*8a272653SPeter Holm	}
130*8a272653SPeter Holm	len = write(fd, wbuffer, FILESIZE);
131*8a272653SPeter Holm	if (len < 0) {
132*8a272653SPeter Holm		perror("Write failed");
133*8a272653SPeter Holm		return 1;
134*8a272653SPeter Holm	}
135*8a272653SPeter Holm	status = fsync(fd);
136*8a272653SPeter Holm	if (status != 0) {
137*8a272653SPeter Holm		perror("fsync failed");
138*8a272653SPeter Holm		return 1;
139*8a272653SPeter Holm	}
140*8a272653SPeter Holm	addr = mmap(NULL, FILESIZE, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
141*8a272653SPeter Holm	if (addr == MAP_FAILED) {
142*8a272653SPeter Holm		perror("Mmap failed");
143*8a272653SPeter Holm		return 1;
144*8a272653SPeter Holm	}
145*8a272653SPeter Holm	status = msync(addr, FILESIZE, MS_INVALIDATE | MS_SYNC);
146*8a272653SPeter Holm	if (status != 0) {
147*8a272653SPeter Holm		perror("Msync failed");
148*8a272653SPeter Holm		return 1;
149*8a272653SPeter Holm	}
150*8a272653SPeter Holm	munmap(addr, FILESIZE);
151*8a272653SPeter Holm
152*8a272653SPeter Holm	*fdp = fd;
153*8a272653SPeter Holm	return 0;
154*8a272653SPeter Holm}
155*8a272653SPeter Holm
156*8a272653SPeter Holm/* mmap a 2 page buffer - first page is from fd1, second page from fd2 */
157*8a272653SPeter Holmvoid *
158*8a272653SPeter HolmmapBuffer(void *ar)
159*8a272653SPeter Holm{
160*8a272653SPeter Holm	void *addr;
161*8a272653SPeter Holm	char *buffer;
162*8a272653SPeter Holm	int i;
163*8a272653SPeter Holm
164*8a272653SPeter Holm	i = (int )ar;
165*8a272653SPeter Holm	addr = mmap(NULL, pagesize * 2, PROT_READ | PROT_WRITE, MAP_SHARED, a[i].fd1, 0);
166*8a272653SPeter Holm	if (addr == MAP_FAILED) {
167*8a272653SPeter Holm		err(1, "Mmap failed");
168*8a272653SPeter Holm	}
169*8a272653SPeter Holm	buffer = addr;
170*8a272653SPeter Holm	addr = mmap(buffer + pagesize, pagesize, PROT_READ | PROT_WRITE, MAP_FIXED |
171*8a272653SPeter Holm		    MAP_SHARED, a[i].fd2, 0);
172*8a272653SPeter Holm
173*8a272653SPeter Holm	if (addr == MAP_FAILED) {
174*8a272653SPeter Holm		err(1, "Mmap2 failed");
175*8a272653SPeter Holm	}
176*8a272653SPeter Holm	a[i].bp = buffer;
177*8a272653SPeter Holm	sleep(1);
178*8a272653SPeter Holm	return (NULL);
179*8a272653SPeter Holm}
180*8a272653SPeter Holm
181*8a272653SPeter Holmint
182*8a272653SPeter HolmstartIO(int fd, char *buffer)
183*8a272653SPeter Holm{
184*8a272653SPeter Holm	ssize_t len;
185*8a272653SPeter Holm
186*8a272653SPeter Holm	len = write(fd, buffer, 2 * pagesize);
187*8a272653SPeter Holm	if (len == -1) {
188*8a272653SPeter Holm		warn("startIO(%d, %p): write failed", fd, buffer);
189*8a272653SPeter Holm		return 1;
190*8a272653SPeter Holm	}
191*8a272653SPeter Holm	return 0;
192*8a272653SPeter Holm}
193*8a272653SPeter Holm
194*8a272653SPeter Holmint
195*8a272653SPeter Holmmain(int argc, char *argv[], char *envp[])
196*8a272653SPeter Holm{
197*8a272653SPeter Holm
198*8a272653SPeter Holm	int fdA, fdB, fdDelayA, fdDelayB;
199*8a272653SPeter Holm	int r, status;
200*8a272653SPeter Holm	char *bufferA, *bufferB;
201*8a272653SPeter Holm	pid_t pid;
202*8a272653SPeter Holm	pthread_t threads[2];
203*8a272653SPeter Holm
204*8a272653SPeter Holm	pagesize = getpagesize();
205*8a272653SPeter Holm
206*8a272653SPeter Holm	if ((prepareFile("A", &fdA))
207*8a272653SPeter Holm	    || (prepareFile("B", &fdB))
208*8a272653SPeter Holm	    || (prepareFile("DelayA", &fdDelayA))
209*8a272653SPeter Holm	    || (prepareFile("DelayB", &fdDelayB)))
210*8a272653SPeter Holm		exit(1);
211*8a272653SPeter Holm
212*8a272653SPeter Holm	a[0].fd1 = fdDelayA;
213*8a272653SPeter Holm	a[0].fd2 = fdB;
214*8a272653SPeter Holm
215*8a272653SPeter Holm	a[1].fd1 = fdDelayB;
216*8a272653SPeter Holm	a[1].fd2 = fdA;
217*8a272653SPeter Holm
218*8a272653SPeter Holm	if ((r = pthread_create(&threads[0], NULL, mapBuffer, (void *)0)) != 0)
219*8a272653SPeter Holm		errc(1, r, "pthread_create()");
220*8a272653SPeter Holm	if ((r = pthread_create(&threads[1], NULL, mapBuffer, (void *)1)) != 0)
221*8a272653SPeter Holm		errc(1, r, "pthread_create()");
222*8a272653SPeter Holm
223*8a272653SPeter Holm	while (a[0].bp == NULL || a[1].bp == NULL)
224*8a272653SPeter Holm		pthread_yield();
225*8a272653SPeter Holm
226*8a272653SPeter Holm	bufferA = a[0].bp;
227*8a272653SPeter Holm	bufferB = a[1].bp;
228*8a272653SPeter Holm
229*8a272653SPeter Holm	pid = fork();
230*8a272653SPeter Holm
231*8a272653SPeter Holm	if (pid == 0) {
232*8a272653SPeter Holm		status = startIO(fdA, bufferA);
233*8a272653SPeter Holm		exit(status);
234*8a272653SPeter Holm	}
235*8a272653SPeter Holm	if (pid == -1) {
236*8a272653SPeter Holm		exit(1);
237*8a272653SPeter Holm	}
238*8a272653SPeter Holm	status = startIO(fdB, bufferB);
239*8a272653SPeter Holm	exit(status);
240*8a272653SPeter Holm
241*8a272653SPeter Holm}
242