18a272653SPeter Holm#!/bin/sh 28a272653SPeter Holm 38a272653SPeter Holm# 48a272653SPeter Holm# Copyright (c) 2017 Dell EMC Isilon 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# mkfifo(2), poll(2) with tmpfs(5) scenario. 308a272653SPeter Holm 318a272653SPeter Holm. ../default.cfg 328a272653SPeter Holm[ `id -u ` -ne 0 ] && echo "Must be root!" && exit 1 338a272653SPeter Holm 348a272653SPeter Holmdir=/tmp 358a272653SPeter Holmodir=`pwd` 368a272653SPeter Holmcd $dir 378a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > $dir/mkfifo7.c 388a272653SPeter Holmmycc -o mkfifo7 -Wall -Wextra -O0 -g mkfifo7.c || exit 1 398a272653SPeter Holmrm -f mkfifo7.c 408a272653SPeter Holmcd $odir 418a272653SPeter Holm 428a272653SPeter Holmmount | grep -q "on $mntpoint " && umount -f $mntpoint 438a272653SPeter Holmmount -o size=1g -t tmpfs tmpfs $mntpoint 448a272653SPeter Holm 458a272653SPeter Holmfifo=$mntpoint/fifo.file 468a272653SPeter Holmcd $mntpoint 478a272653SPeter Holm/tmp/mkfifo7 $fifo 488a272653SPeter Holms=$? 498a272653SPeter Holmcd $odir 508a272653SPeter Holm 518a272653SPeter Holmwhile mount | grep "on $mntpoint " | grep -q tmpfs; do 528a272653SPeter Holm umount $mntpoint || sleep 1 538a272653SPeter Holmdone 548a272653SPeter Holmrm -rf /tmp/mkfifo7 558a272653SPeter Holmexit $s 568a272653SPeter Holm 578a272653SPeter HolmEOF 588a272653SPeter Holm#include <sys/param.h> 598a272653SPeter Holm#include <sys/mman.h> 608a272653SPeter Holm#include <sys/stat.h> 618a272653SPeter Holm#include <sys/wait.h> 628a272653SPeter Holm 638a272653SPeter Holm#include <err.h> 648a272653SPeter Holm#include <errno.h> 658a272653SPeter Holm#include <fcntl.h> 668a272653SPeter Holm#include <poll.h> 678a272653SPeter Holm#include <signal.h> 688a272653SPeter Holm#include <stdio.h> 698a272653SPeter Holm#include <stdlib.h> 708a272653SPeter Holm#include <time.h> 718a272653SPeter Holm#include <unistd.h> 728a272653SPeter Holm 738a272653SPeter Holmstatic char *path; 748a272653SPeter Holm 758a272653SPeter Holm#define PARALLEL 1 768a272653SPeter Holm 778a272653SPeter Holmstatic void 788a272653SPeter Holmreader(void) 798a272653SPeter Holm{ 808a272653SPeter Holm struct pollfd pfd; 818a272653SPeter Holm int fd, n, r; 828a272653SPeter Holm char ch; 838a272653SPeter Holm 848a272653SPeter Holm do { 858a272653SPeter Holm if((fd = open(path, O_RDONLY)) == -1) 868a272653SPeter Holm if (errno != EINTR) 878a272653SPeter Holm err(1, "open(%s, O_RDONLY)", 888a272653SPeter Holm path); 898a272653SPeter Holm if (fd == -1) 908a272653SPeter Holm warn("open(%s) ro", path); 918a272653SPeter Holm } while (fd == -1); 928a272653SPeter Holm 938a272653SPeter Holm /* Read one character */ 948a272653SPeter Holm pfd.fd = fd; 958a272653SPeter Holm pfd.events = POLLIN; 968a272653SPeter Holm if ((n = poll(&pfd, 1, 0)) == -1) 978a272653SPeter Holm err(1, "poll()"); 988a272653SPeter Holm if (n == 1) { 998a272653SPeter Holm r = read(fd, &ch, 1); 1008a272653SPeter Holm if (r == -1) 1018a272653SPeter Holm err(1, "read"); 1028a272653SPeter Holm if (r != 0) 1038a272653SPeter Holm fprintf(stderr, "read(1): %c\n", ch); 1048a272653SPeter Holm else 1058a272653SPeter Holm fprintf(stderr, "read(1): EOF\n"); 1068a272653SPeter Holm } 1078a272653SPeter Holm 1088a272653SPeter Holm /* timeout */ 1098a272653SPeter Holm ch = 'z'; 1108a272653SPeter Holm if ((n = poll(&pfd, 1, 7000)) == -1) 1118a272653SPeter Holm err(1, "poll()"); 1128a272653SPeter Holm if (n != 1) 1138a272653SPeter Holm fprintf(stderr, "FAIL Expected n == 1, got %d\n", n); 1148a272653SPeter Holm if (n == 1) { 1158a272653SPeter Holm r = read(fd, &ch, 1); 1168a272653SPeter Holm if (r == -1) 1178a272653SPeter Holm err(1, "read"); 1188a272653SPeter Holm if (r == 0) 1198a272653SPeter Holm fprintf(stderr, "read(2): EOF\n"); 1208a272653SPeter Holm } 1218a272653SPeter Holm 1228a272653SPeter Holm /* timeout */ 1238a272653SPeter Holm ch = 'z'; 1248a272653SPeter Holm if ((n = poll(&pfd, 1, 7000)) == -1) 1258a272653SPeter Holm err(1, "poll()"); 1268a272653SPeter Holm if (n != 1) 1278a272653SPeter Holm fprintf(stderr, "FAIL Expected n == 1, got %d\n", n); 1288a272653SPeter Holm if (n == 1) { 1298a272653SPeter Holm r = read(fd, &ch, 1); 1308a272653SPeter Holm if (r == -1) 1318a272653SPeter Holm err(1, "read"); 1328a272653SPeter Holm if (r != 0) 1338a272653SPeter Holm fprintf(stderr, "read(3): %c\n", ch); 1348a272653SPeter Holm } 1358a272653SPeter Holm 1368a272653SPeter Holm if (close(fd) == -1) 1378a272653SPeter Holm err(1, "close() in child"); 1388a272653SPeter Holm _exit(n == 1 ? 0 : 1); 1398a272653SPeter Holm} 1408a272653SPeter Holm 1418a272653SPeter Holmstatic void 1428a272653SPeter Holmwriter(void) 1438a272653SPeter Holm{ 1448a272653SPeter Holm int fd; 1458a272653SPeter Holm 1468a272653SPeter Holm do { 1478a272653SPeter Holm if ((fd = open(path, O_WRONLY)) == -1) 1488a272653SPeter Holm if (errno != EINTR) 1498a272653SPeter Holm err(1, "open(%s, O_WRONLY)", 1508a272653SPeter Holm path); 1518a272653SPeter Holm if (fd == -1) 1528a272653SPeter Holm warn("open(%s) wr", path); 1538a272653SPeter Holm } while (fd == -1); 1548a272653SPeter Holm if (write(fd, "a", 1) != 1) 1558a272653SPeter Holm err(1, "write one"); 1568a272653SPeter Holm if (close(fd) == -1) 1578a272653SPeter Holm warn("close() in parent"); 1588a272653SPeter Holm} 1598a272653SPeter Holm 1608a272653SPeter Holmstatic void 1618a272653SPeter Holmtest(void) 1628a272653SPeter Holm{ 1638a272653SPeter Holm pid_t pid; 1648a272653SPeter Holm int status; 1658a272653SPeter Holm 1668a272653SPeter Holm if ((pid = fork()) == 0) 1678a272653SPeter Holm reader(); 1688a272653SPeter Holm writer(); 1698a272653SPeter Holm 1708a272653SPeter Holm if (waitpid(pid, &status, 0) != pid) 1718a272653SPeter Holm err(1, "waitpid(%d)", pid); 1728a272653SPeter Holm 1738a272653SPeter Holm _exit(status != 0); 1748a272653SPeter Holm} 1758a272653SPeter Holm 1768a272653SPeter Holmint 1778a272653SPeter Holmmain(int argc __unused, char *argv[]) 1788a272653SPeter Holm{ 1798a272653SPeter Holm int e, i, pids[PARALLEL], status; 1808a272653SPeter Holm 1818a272653SPeter Holm if (argc != 2) { 1828a272653SPeter Holm fprintf(stderr, "Usage: %s <fifo file>\n", argv[0]); 1838a272653SPeter Holm exit(1); 1848a272653SPeter Holm } 1858a272653SPeter Holm path = argv[1]; 1868a272653SPeter Holm e = 0; 1878a272653SPeter Holm 1888a272653SPeter Holm unlink(path); 1898a272653SPeter Holm if (mkfifo(path, 0640) == -1) 1908a272653SPeter Holm err(1, "mkfifo(%s)", path); 1918a272653SPeter Holm 1928a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 1938a272653SPeter Holm if ((pids[i] = fork()) == 0) 1948a272653SPeter Holm test(); 1958a272653SPeter Holm } 1968a272653SPeter Holm for (i = 0; i < PARALLEL; i++) { 1978a272653SPeter Holm if (waitpid(pids[i], &status, 0) == -1) 1988a272653SPeter Holm err(1, "waitpid(%d)", pids[i]); 1998a272653SPeter Holm e += status == 0 ? 0 : 1; 2008a272653SPeter Holm } 2018a272653SPeter Holm 2028a272653SPeter Holm return (e); 2038a272653SPeter Holm} 204