1*7d233b22SKonstantin Belousov /*- 2*7d233b22SKonstantin Belousov * SPDX-License-Identifier: BSD-3-Clause 3*7d233b22SKonstantin Belousov * 4*7d233b22SKonstantin Belousov * Copyright (c) 1989, 1993 5*7d233b22SKonstantin Belousov * The Regents of the University of California. All rights reserved. 6*7d233b22SKonstantin Belousov * 7*7d233b22SKonstantin Belousov * Redistribution and use in source and binary forms, with or without 8*7d233b22SKonstantin Belousov * modification, are permitted provided that the following conditions 9*7d233b22SKonstantin Belousov * are met: 10*7d233b22SKonstantin Belousov * 1. Redistributions of source code must retain the above copyright 11*7d233b22SKonstantin Belousov * notice, this list of conditions and the following disclaimer. 12*7d233b22SKonstantin Belousov * 2. Redistributions in binary form must reproduce the above copyright 13*7d233b22SKonstantin Belousov * notice, this list of conditions and the following disclaimer in the 14*7d233b22SKonstantin Belousov * documentation and/or other materials provided with the distribution. 15*7d233b22SKonstantin Belousov * 3. Neither the name of the University nor the names of its contributors 16*7d233b22SKonstantin Belousov * may be used to endorse or promote products derived from this software 17*7d233b22SKonstantin Belousov * without specific prior written permission. 18*7d233b22SKonstantin Belousov * 19*7d233b22SKonstantin Belousov * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20*7d233b22SKonstantin Belousov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21*7d233b22SKonstantin Belousov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22*7d233b22SKonstantin Belousov * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23*7d233b22SKonstantin Belousov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24*7d233b22SKonstantin Belousov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25*7d233b22SKonstantin Belousov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26*7d233b22SKonstantin Belousov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27*7d233b22SKonstantin Belousov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28*7d233b22SKonstantin Belousov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29*7d233b22SKonstantin Belousov * SUCH DAMAGE. 30*7d233b22SKonstantin Belousov */ 31*7d233b22SKonstantin Belousov 32*7d233b22SKonstantin Belousov #include "namespace.h" 33*7d233b22SKonstantin Belousov #include <errno.h> 34*7d233b22SKonstantin Belousov #include <limits.h> 35*7d233b22SKonstantin Belousov #include <time.h> 36*7d233b22SKonstantin Belousov #include <unistd.h> 37*7d233b22SKonstantin Belousov #include "un-namespace.h" 38*7d233b22SKonstantin Belousov 39*7d233b22SKonstantin Belousov #include "libc_private.h" 40*7d233b22SKonstantin Belousov 41*7d233b22SKonstantin Belousov unsigned int __sleep(unsigned int); 42*7d233b22SKonstantin Belousov 43*7d233b22SKonstantin Belousov unsigned int 44*7d233b22SKonstantin Belousov __sleep(unsigned int seconds) 45*7d233b22SKonstantin Belousov { 46*7d233b22SKonstantin Belousov struct timespec time_to_sleep; 47*7d233b22SKonstantin Belousov struct timespec time_remaining; 48*7d233b22SKonstantin Belousov 49*7d233b22SKonstantin Belousov /* 50*7d233b22SKonstantin Belousov * Avoid overflow when `seconds' is huge. This assumes that 51*7d233b22SKonstantin Belousov * the maximum value for a time_t is >= INT_MAX. 52*7d233b22SKonstantin Belousov */ 53*7d233b22SKonstantin Belousov if (seconds > INT_MAX) 54*7d233b22SKonstantin Belousov return (seconds - INT_MAX + __sleep(INT_MAX)); 55*7d233b22SKonstantin Belousov 56*7d233b22SKonstantin Belousov time_to_sleep.tv_sec = seconds; 57*7d233b22SKonstantin Belousov time_to_sleep.tv_nsec = 0; 58*7d233b22SKonstantin Belousov if (((int (*)(const struct timespec *, struct timespec *)) 59*7d233b22SKonstantin Belousov (*__libsys_interposing_slot(INTERPOS_nanosleep)))( 60*7d233b22SKonstantin Belousov &time_to_sleep, &time_remaining) != -1) 61*7d233b22SKonstantin Belousov return (0); 62*7d233b22SKonstantin Belousov if (errno != EINTR) 63*7d233b22SKonstantin Belousov return (seconds); /* best guess */ 64*7d233b22SKonstantin Belousov return (time_remaining.tv_sec + 65*7d233b22SKonstantin Belousov (time_remaining.tv_nsec != 0)); /* round up */ 66*7d233b22SKonstantin Belousov } 67*7d233b22SKonstantin Belousov 68*7d233b22SKonstantin Belousov __weak_reference(__sleep, sleep); 69*7d233b22SKonstantin Belousov __weak_reference(__sleep, _sleep); 70