1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2013 EMC Corp. 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# A simplistic regression test for r200510: 30*8a272653SPeter Holm 31*8a272653SPeter Holm[ `sysctl -n kern.hz` -lt 1000 ] && exit 0 32*8a272653SPeter Holm 33*8a272653SPeter Holm. ../default.cfg 34*8a272653SPeter Holm 35*8a272653SPeter Holmhere=`pwd` 36*8a272653SPeter Holmcd /tmp 37*8a272653SPeter Holmsed '1,/^EOF/d' < $here/$0 > nanosleep.c 38*8a272653SPeter Holmmycc -o nanosleep -Wall -Wextra nanosleep.c || exit 1 39*8a272653SPeter Holmrm -f nanosleep.c 40*8a272653SPeter Holm 41*8a272653SPeter Holm/tmp/nanosleep && s=0 || s=$? 42*8a272653SPeter Holm 43*8a272653SPeter Holmrm -f /tmp/nanosleep 44*8a272653SPeter Holmexit $s 45*8a272653SPeter HolmEOF 46*8a272653SPeter Holm#include <sys/limits.h> 47*8a272653SPeter Holm#include <sys/time.h> 48*8a272653SPeter Holm 49*8a272653SPeter Holm#include <err.h> 50*8a272653SPeter Holm#include <stdio.h> 51*8a272653SPeter Holm#include <strings.h> 52*8a272653SPeter Holm#include <time.h> 53*8a272653SPeter Holm 54*8a272653SPeter Holm#define N 20000 55*8a272653SPeter Holm 56*8a272653SPeter Holmint 57*8a272653SPeter Holmmain(void) 58*8a272653SPeter Holm{ 59*8a272653SPeter Holm struct timespec rmt, rqt; 60*8a272653SPeter Holm struct timespec finish, start, res; 61*8a272653SPeter Holm long m; 62*8a272653SPeter Holm int i; 63*8a272653SPeter Holm 64*8a272653SPeter Holm m = LONG_MAX; 65*8a272653SPeter Holm for (i = 0; i < 100; i++) { 66*8a272653SPeter Holm rqt.tv_sec = 0; 67*8a272653SPeter Holm rqt.tv_nsec = N; 68*8a272653SPeter Holm clock_gettime(CLOCK_REALTIME_PRECISE, &start); 69*8a272653SPeter Holm if (nanosleep(&rqt, &rmt) == -1) 70*8a272653SPeter Holm err(1, "nanosleep"); 71*8a272653SPeter Holm clock_gettime(CLOCK_REALTIME_PRECISE, &finish); 72*8a272653SPeter Holm timespecsub(&finish, &start, &res); 73*8a272653SPeter Holm if (res.tv_nsec < N) 74*8a272653SPeter Holm errx(1, "Short sleep: %ld", res.tv_nsec); 75*8a272653SPeter Holm// fprintf(stderr, "asked for %f, got %f\n", (double)N / 1e9, 76*8a272653SPeter Holm// (double)res.tv_nsec / 1e9); 77*8a272653SPeter Holm if (m > res.tv_nsec) 78*8a272653SPeter Holm m = res.tv_nsec; 79*8a272653SPeter Holm } 80*8a272653SPeter Holm if (m > 2 * N) { 81*8a272653SPeter Holm fprintf(stderr, "nanosleep(%fs). Best value is %fs.\n", 82*8a272653SPeter Holm (double)N / 1e9, (double)m / 1e9); 83*8a272653SPeter Holm errx(1, "FAIL"); 84*8a272653SPeter Holm } 85*8a272653SPeter Holm 86*8a272653SPeter Holm return (0); 87*8a272653SPeter Holm} 88