18a272653SPeter Holm#!/bin/sh 28a272653SPeter Holm 38a272653SPeter Holm# 48a272653SPeter Holm# Copyright (c) 2016 EMC Corp. 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# fcntl(2) locking scenario, using UFS and a nullfs mount. 308a272653SPeter Holm# No problems seen. 318a272653SPeter Holm 328a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 338a272653SPeter Holm 348a272653SPeter Holm. ../default.cfg 358a272653SPeter Holm 368a272653SPeter Holmhere=`pwd` 378a272653SPeter Holmcd /tmp 388a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > nullfs22.c 398a272653SPeter Holmmycc -o nullfs22 -Wall -Wextra -O0 -g nullfs22.c || exit 1 408a272653SPeter Holmrm -f nullfs22.c 418a272653SPeter Holm 428a272653SPeter Holmmp2=${mntpoint}2 438a272653SPeter Holm[ -d $mp2 ] || mkdir -p $mp2 448a272653SPeter Holmmount | grep -q "on $mp2 " && umount $mp2 458a272653SPeter Holmmount | grep "on $mntpoint " | grep -q /dev/md && umount -f $mntpoint 468a272653SPeter Holm[ -c /dev/md$mdstart ] && mdconfig -d -u $mdstart 478a272653SPeter Holmmdconfig -a -t swap -s 512m -u $mdstart || exit 1 48*608c97bfSPeter Holmnewfs -n md$mdstart > /dev/null 49*608c97bfSPeter Holmmount /dev/md$mdstart $mntpoint 508a272653SPeter Holm 518a272653SPeter Holmmount -t nullfs $mntpoint $mp2 528a272653SPeter Holm 538a272653SPeter Holm/tmp/nullfs22 $mntpoint $mp2 548a272653SPeter Holmstatus=$? 558a272653SPeter Holm 568a272653SPeter Holmwhile mount | grep -q "on $mp2 "; do 578a272653SPeter Holm umount $mp2 588a272653SPeter Holmdone 598a272653SPeter Holmwhile mount | grep "on $mntpoint " | grep -q /dev/md; do 608a272653SPeter Holm umount $mntpoint || sleep 1 618a272653SPeter Holmdone 628a272653SPeter Holmmdconfig -d -u $mdstart 638a272653SPeter Holmrm -f /tmp/nullfs22 648a272653SPeter Holmexit $status 658a272653SPeter HolmEOF 668a272653SPeter Holm#include <sys/param.h> 678a272653SPeter Holm#include <sys/mman.h> 688a272653SPeter Holm#include <sys/wait.h> 698a272653SPeter Holm 708a272653SPeter Holm#include <machine/atomic.h> 718a272653SPeter Holm 728a272653SPeter Holm#include <err.h> 738a272653SPeter Holm#include <errno.h> 748a272653SPeter Holm#include <fcntl.h> 758a272653SPeter Holm#include <signal.h> 768a272653SPeter Holm#include <stdio.h> 778a272653SPeter Holm#include <stdlib.h> 788a272653SPeter Holm#include <string.h> 798a272653SPeter Holm#include <unistd.h> 808a272653SPeter Holm 818a272653SPeter Holm#define LOOPS 1024 828a272653SPeter Holm#define N (512) 838a272653SPeter Holm#define PARALLEL 4 848a272653SPeter Holm 858a272653SPeter Holm#define DONE 1 868a272653SPeter Holm#define SYNC 0 878a272653SPeter Holm 888a272653SPeter Holmint fd; 898a272653SPeter Holmvolatile u_int *share; 908a272653SPeter Holmchar name1[80], name2[80]; 918a272653SPeter Holm 928a272653SPeter Holmstatic void 938a272653SPeter Holmahandler(int s __unused) 948a272653SPeter Holm{ 958a272653SPeter Holm fprintf(stderr, "In alarm handler\n"); 968a272653SPeter Holm unlink(name1); 978a272653SPeter Holm _exit(1); 988a272653SPeter Holm} 998a272653SPeter Holm 1008a272653SPeter Holmvoid 1018a272653SPeter Holmadd(int n, int increment) 1028a272653SPeter Holm{ 1038a272653SPeter Holm struct flock fl; 1048a272653SPeter Holm off_t pos; 1058d72c409SPeter Holm long val, oval __unused; 1068a272653SPeter Holm int r; 1078a272653SPeter Holm 1088a272653SPeter Holm pos = n * sizeof(val); 1098a272653SPeter Holm memset(&fl, 0, sizeof(fl)); 1108a272653SPeter Holm fl.l_start = pos; 1118a272653SPeter Holm fl.l_len = sizeof(val); 1128a272653SPeter Holm fl.l_type = F_WRLCK; 1138a272653SPeter Holm fl.l_whence = SEEK_SET; 1148a272653SPeter Holm 1158a272653SPeter Holm while (fcntl(fd, F_SETLKW, &fl) < 0) { 1168a272653SPeter Holm if (errno != EAGAIN) 1178a272653SPeter Holm err(1, "F_SETLKW (child)"); 1188a272653SPeter Holm usleep(100); 1198a272653SPeter Holm } 1208a272653SPeter Holm 1218a272653SPeter Holm if (lseek(fd, pos, SEEK_SET) == -1) 1228a272653SPeter Holm err(1, "lseek"); 1238a272653SPeter Holm oval = 999999; 1248a272653SPeter Holm while ((r = read(fd, &val, sizeof(val)) != sizeof(val))) { 1258a272653SPeter Holm if (r == -1 && errno != EAGAIN) 1268a272653SPeter Holm err(1, "read"); 1278a272653SPeter Holm if (lseek(fd, pos, SEEK_SET) == -1) 1288a272653SPeter Holm err(1, "lseek"); 1298a272653SPeter Holm } 1308a272653SPeter Holm oval = val; 1318a272653SPeter Holm val = val + increment; 1328a272653SPeter Holm#if defined(DEBUG) 1338a272653SPeter Holm fprintf(stderr, "add(%d, %d) @ pos %ld: %ld = %ld + %d\n", 1348a272653SPeter Holm n, increment, (long)pos, val, oval, increment); 1358a272653SPeter Holm#endif 1368a272653SPeter Holm if (lseek(fd, pos, SEEK_SET) == -1) 1378a272653SPeter Holm err(1, "lseek"); 1388a272653SPeter Holm while ((r = write(fd, &val, sizeof(val)) != sizeof(val))) { 1398a272653SPeter Holm if (r == -1 && errno != EAGAIN) 1408a272653SPeter Holm err(1, "write"); 1418a272653SPeter Holm if (lseek(fd, pos, SEEK_SET) == -1) 1428a272653SPeter Holm err(1, "lseek"); 1438a272653SPeter Holm } 1448a272653SPeter Holm 1458a272653SPeter Holm fl.l_type = F_UNLCK; 1468a272653SPeter Holm if (fcntl(fd, F_SETLK, &fl) < 0) 1478a272653SPeter Holm err(1, "F_UNLCK"); 1488a272653SPeter Holm 1498a272653SPeter Holm} 1508a272653SPeter Holm 1518a272653SPeter Holmvoid 1528a272653SPeter Holmcount(int val) 1538a272653SPeter Holm{ 1548a272653SPeter Holm int i, j; 1558a272653SPeter Holm char help[80], *name; 1568a272653SPeter Holm 1578a272653SPeter Holm if (val == 1) 1588a272653SPeter Holm name = name1; 1598a272653SPeter Holm else 1608a272653SPeter Holm name = name2; 1618a272653SPeter Holm snprintf(help, sizeof(help), "%s %d %s", __func__, val, name); 1628a272653SPeter Holm setproctitle("%s", help); 1638a272653SPeter Holm atomic_add_int(&share[SYNC], 1); 1648a272653SPeter Holm while (share[SYNC] != 2 * PARALLEL) 1658a272653SPeter Holm ; 1668a272653SPeter Holm 1678a272653SPeter Holm /* Need to re-open after a fork() */ 1688a272653SPeter Holm close(fd); 1698a272653SPeter Holm if ((fd = open(name, O_RDWR)) == -1) 1708a272653SPeter Holm err(1, "open(%s)", name); 1718a272653SPeter Holm 1728a272653SPeter Holm for (i = 0; i < LOOPS; i++) { 1738a272653SPeter Holm for (j = 0; j < N; j++) 1748a272653SPeter Holm add(j, val); 1758a272653SPeter Holm } 1768a272653SPeter Holm 1778a272653SPeter Holm atomic_add_int(&share[DONE], 1); 1788a272653SPeter Holm 1798a272653SPeter Holm _exit(0); 1808a272653SPeter Holm} 1818a272653SPeter Holm 1828a272653SPeter Holmint 1838a272653SPeter Holmmain(int argc, char *argv[]) 1848a272653SPeter Holm{ 1858a272653SPeter Holm off_t len; 1868a272653SPeter Holm size_t mlen; 1878a272653SPeter Holm long val, sum; 1888a272653SPeter Holm int i, s, stat; 1898a272653SPeter Holm 1908a272653SPeter Holm if (argc != 3) { 1918a272653SPeter Holm fprintf(stderr, "Usage: %s <dir1> <dir2>\n", argv[0]); 1928a272653SPeter Holm exit(1); 1938a272653SPeter Holm } 1948a272653SPeter Holm 1958a272653SPeter Holm mlen = PAGE_SIZE; 1968a272653SPeter Holm if ((share = mmap(NULL, mlen, PROT_READ | PROT_WRITE, 1978a272653SPeter Holm MAP_ANON | MAP_SHARED, -1, 0)) == MAP_FAILED) 1988a272653SPeter Holm err(1, "mmap"); 1998a272653SPeter Holm snprintf(name1, sizeof(name1), "%s/work", argv[1]); 2008a272653SPeter Holm snprintf(name2, sizeof(name2), "%s/work", argv[2]); 2018a272653SPeter Holm signal(SIGALRM, ahandler); 2028a272653SPeter Holm alarm(300); 2038a272653SPeter Holm if ((fd = open(name1, O_RDWR | O_CREAT | O_TRUNC, 0640)) == -1) 2048a272653SPeter Holm err(1, "open(%s)", name1); 2058a272653SPeter Holm len = N * sizeof(val); 2068a272653SPeter Holm if (ftruncate(fd, len) == -1) 2078a272653SPeter Holm err(1, "ftruncate"); 2088a272653SPeter Holm 2098a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 2108a272653SPeter Holm if (fork() == 0) 2118a272653SPeter Holm count(1); 2128a272653SPeter Holm } 2138a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 2148a272653SPeter Holm if (fork() == 0) 2158a272653SPeter Holm count(-1); 2168a272653SPeter Holm } 2178a272653SPeter Holm 2188a272653SPeter Holm while (share[DONE] != 2 * PARALLEL) 2198a272653SPeter Holm usleep(10000); 2208a272653SPeter Holm 2218a272653SPeter Holm if (lseek(fd, 0, SEEK_SET) == -1) 2228a272653SPeter Holm err(1, "lseek"); 2238a272653SPeter Holm sum = 0; 2248a272653SPeter Holm for (i = 0; i < N; i++) { 2258a272653SPeter Holm if (read(fd, &val, sizeof(val)) != sizeof(val)) 2268a272653SPeter Holm err(1, "Final read"); 2278a272653SPeter Holm if (val != 0) 2288a272653SPeter Holm fprintf(stderr, "index %d: %ld\n", i, val); 2298a272653SPeter Holm sum += val; 2308a272653SPeter Holm } 2318a272653SPeter Holm if (sum != 0) 2328a272653SPeter Holm fprintf(stderr, "FAIL\n"); 2338a272653SPeter Holm unlink(name1); 2348a272653SPeter Holm 2358a272653SPeter Holm s = 0; 2368a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 2378a272653SPeter Holm wait(&stat); 2388a272653SPeter Holm s += WEXITSTATUS(stat); 2398a272653SPeter Holm wait(&stat); 2408a272653SPeter Holm s += WEXITSTATUS(stat); 2418a272653SPeter Holm } 2428a272653SPeter Holm 2438a272653SPeter Holm close(fd); 2448a272653SPeter Holm 2458a272653SPeter Holm return (sum != 0 || s != 0); 2468a272653SPeter Holm} 247