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# Test high water mark for freeblks 30*8a272653SPeter Holm 31*8a272653SPeter Holm. ../default.cfg 32*8a272653SPeter Holm 33*8a272653SPeter Holmhere=`pwd` 34*8a272653SPeter Holmcd /tmp 35*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > truncate.c 36*8a272653SPeter Holmmycc -o truncate -Wall -Wextra -O2 truncate.c || exit 1 37*8a272653SPeter Holmrm -f truncate.c 38*8a272653SPeter Holm[ -d $RUNDIR ] || mkdir -p $RUNDIR 39*8a272653SPeter Holmcd $RUNDIR 40*8a272653SPeter Holm 41*8a272653SPeter Holm/tmp/truncate 42*8a272653SPeter Holm 43*8a272653SPeter Holmrm -f /tmp/truncate 44*8a272653SPeter Holmexit 0 45*8a272653SPeter HolmEOF 46*8a272653SPeter Holm#include <fcntl.h> 47*8a272653SPeter Holm#include <err.h> 48*8a272653SPeter Holm#include <stdio.h> 49*8a272653SPeter Holm#include <stdlib.h> 50*8a272653SPeter Holm#include <time.h> 51*8a272653SPeter Holm#include <unistd.h> 52*8a272653SPeter Holm#include <sys/wait.h> 53*8a272653SPeter Holm 54*8a272653SPeter Holm#define SIZ 512 55*8a272653SPeter Holmchar buf[SIZ]; 56*8a272653SPeter Holm 57*8a272653SPeter Holmvoid 58*8a272653SPeter Holmtest(void) 59*8a272653SPeter Holm{ 60*8a272653SPeter Holm time_t start; 61*8a272653SPeter Holm int fd[10], i, j; 62*8a272653SPeter Holm char name[128]; 63*8a272653SPeter Holm 64*8a272653SPeter Holm for (j = 0; j < 10; j++) { 65*8a272653SPeter Holm sprintf(name, "%05d.%05d", getpid(), j); 66*8a272653SPeter Holm if ((fd[j] = open(name, O_WRONLY | O_CREAT | O_APPEND, 0666)) == -1) 67*8a272653SPeter Holm err(1, "%s", name); 68*8a272653SPeter Holm unlink(name); 69*8a272653SPeter Holm } 70*8a272653SPeter Holm 71*8a272653SPeter Holm start = time(NULL); 72*8a272653SPeter Holm for (i = 0; i < 100000; i++) { 73*8a272653SPeter Holm if (time(NULL) - start > 1200) 74*8a272653SPeter Holm break; 75*8a272653SPeter Holm for (j = 0; j < 10; j++) { 76*8a272653SPeter Holm if (write(fd[j], buf, 2) != 2) 77*8a272653SPeter Holm err(1, "write"); 78*8a272653SPeter Holm if (ftruncate(fd[j], 0) == -1) 79*8a272653SPeter Holm err(1, "ftruncate"); 80*8a272653SPeter Holm } 81*8a272653SPeter Holm } 82*8a272653SPeter Holm 83*8a272653SPeter Holm _exit(0); 84*8a272653SPeter Holm} 85*8a272653SPeter Holm 86*8a272653SPeter Holmint 87*8a272653SPeter Holmmain(void) 88*8a272653SPeter Holm{ 89*8a272653SPeter Holm int i, status; 90*8a272653SPeter Holm 91*8a272653SPeter Holm for (i = 0; i < 20; i++) { 92*8a272653SPeter Holm if (fork() == 0) 93*8a272653SPeter Holm test(); 94*8a272653SPeter Holm } 95*8a272653SPeter Holm for (i = 0; i < 20; i++) 96*8a272653SPeter Holm wait(&status); 97*8a272653SPeter Holm 98*8a272653SPeter Holm return (0); 99*8a272653SPeter Holm} 100