xref: /freebsd/tools/test/stress2/misc/dup.sh (revision 4d846d26)
18a272653SPeter Holm#!/bin/sh
28a272653SPeter Holm
38a272653SPeter Holm#
44d846d26SWarner Losh# SPDX-License-Identifier: BSD-2-Clause
58a272653SPeter Holm#
68a272653SPeter Holm# Copyright (c) 2019 Dell EMC Isilon
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 "D20947: Check and avoid overflow when incrementing
318a272653SPeter Holm# fp->f_count in fget_unlocked() and fhold()".
328a272653SPeter Holm
338a272653SPeter Holm# OOM killing seen. Cap files and procs for now.
348a272653SPeter Holm
358a272653SPeter Holm. ../default.cfg
368a272653SPeter Holm
378a272653SPeter Holmdir=/tmp
388a272653SPeter Holmodir=`pwd`
398a272653SPeter Holmcd $dir
408a272653SPeter Holmrm -f /tmp/dup /tmp/dup.c || exit 1
418a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > $dir/dup.c
428a272653SPeter Holmmycc -o dup  -Wall -Wextra dup.c || exit 1
438a272653SPeter Holmrm -f dup.c
448a272653SPeter Holmcd $odir
458a272653SPeter Holm
468a272653SPeter Holm/tmp/dup; s=$?
478a272653SPeter Holm
488a272653SPeter Holmrm -f /tmp/dup
498a272653SPeter Holmexit $s
508a272653SPeter Holm
518a272653SPeter HolmEOF
528a272653SPeter Holm#include <sys/param.h>
538a272653SPeter Holm#include <sys/mman.h>
548a272653SPeter Holm#include <sys/stat.h>
558a272653SPeter Holm#include <sys/wait.h>
568a272653SPeter Holm
578a272653SPeter Holm#include <fcntl.h>
588a272653SPeter Holm#include <err.h>
598a272653SPeter Holm#include <errno.h>
608a272653SPeter Holm#include <stdlib.h>
618a272653SPeter Holm#include <stdio.h>
628a272653SPeter Holm#include <unistd.h>
638a272653SPeter Holm
648a272653SPeter Holmstatic volatile u_int *share;
658a272653SPeter Holm#define N 10240
668a272653SPeter Holm#define CAP_FILES 50000
678a272653SPeter Holm#define CAP_PROCS 1000
688a272653SPeter Holm#define SYNC 0
698a272653SPeter Holm
708a272653SPeter Holmint
718a272653SPeter Holmmain(void)
728a272653SPeter Holm{
738a272653SPeter Holm	struct stat st;
748a272653SPeter Holm	pid_t pid[N];
758a272653SPeter Holm	size_t len;
768a272653SPeter Holm	int fd, fd2, i, j, last;
778a272653SPeter Holm
788a272653SPeter Holm	len = PAGE_SIZE;
798a272653SPeter Holm	if ((share = mmap(NULL, len, PROT_READ | PROT_WRITE,
808a272653SPeter Holm	    MAP_ANON | MAP_SHARED, -1, 0)) == MAP_FAILED)
818a272653SPeter Holm		err(1, "mmap");
828a272653SPeter Holm	if ((fd = open("/dev/zero", O_RDONLY)) == -1)
838a272653SPeter Holm		err(1, "open(/dev/zero)");
848a272653SPeter Holm	i = 0;
858a272653SPeter Holm	for (;;) {
868a272653SPeter Holm		if ((fd2 = dup(fd)) == -1) {
878a272653SPeter Holm			if (errno == EMFILE)
888a272653SPeter Holm				break;
898a272653SPeter Holm			err(1, "dup()");
908a272653SPeter Holm		}
918a272653SPeter Holm		last = fd2;
928a272653SPeter Holm		if (++i == CAP_FILES)
938a272653SPeter Holm			break;
948a272653SPeter Holm	}
958a272653SPeter Holm#if defined(DEBUG)
968a272653SPeter Holm	fprintf(stderr, "i = %d\n", i);
978a272653SPeter Holm#endif
988a272653SPeter Holm
998a272653SPeter Holm	for (i = 0; i < N; i++) {
1008a272653SPeter Holm		if ((pid[i] = fork()) == 0) {
1018a272653SPeter Holm			if (fstat(last, &st) == -1)
1028a272653SPeter Holm				err(1, "stat(%s)", "/dev/zero");
1038a272653SPeter Holm			while(share[SYNC] == 0)
1048a272653SPeter Holm				usleep(100000);
1058a272653SPeter Holm			_exit(0);
1068a272653SPeter Holm		}
1078a272653SPeter Holm		if (pid[i] == -1) {
1088a272653SPeter Holm			warn("fork()");
1098a272653SPeter Holm			i--;
1108a272653SPeter Holm			break;
1118a272653SPeter Holm		}
1128a272653SPeter Holm		if (i + 1 == CAP_PROCS)
1138a272653SPeter Holm			break;
1148a272653SPeter Holm	}
1158a272653SPeter Holm	share[SYNC] = 1;
1168a272653SPeter Holm	for (j = 0; j < i; j++) {
1178a272653SPeter Holm		if (waitpid(pid[j], NULL, 0) != pid[j])
1188a272653SPeter Holm			err(1, "waitpid(%d), index %d", pid[j], j);
1198a272653SPeter Holm	}
1208a272653SPeter Holm
1218a272653SPeter Holm	return (0);
1228a272653SPeter Holm}
123