xref: /minix3/lib/libc/gen/times.c (revision 84d9c625bfea59e274550651111ae9edfdc40fbd)
1*2fe8fb19SBen Gras /*	$NetBSD: times.c,v 1.15 2009/01/11 02:46:27 christos Exp $	*/
2*2fe8fb19SBen Gras 
3*2fe8fb19SBen Gras /*-
4*2fe8fb19SBen Gras  * Copyright (c) 1990, 1993
5*2fe8fb19SBen Gras  *	The Regents of the University of California.  All rights reserved.
6*2fe8fb19SBen Gras  *
7*2fe8fb19SBen Gras  * Redistribution and use in source and binary forms, with or without
8*2fe8fb19SBen Gras  * modification, are permitted provided that the following conditions
9*2fe8fb19SBen Gras  * are met:
10*2fe8fb19SBen Gras  * 1. Redistributions of source code must retain the above copyright
11*2fe8fb19SBen Gras  *    notice, this list of conditions and the following disclaimer.
12*2fe8fb19SBen Gras  * 2. Redistributions in binary form must reproduce the above copyright
13*2fe8fb19SBen Gras  *    notice, this list of conditions and the following disclaimer in the
14*2fe8fb19SBen Gras  *    documentation and/or other materials provided with the distribution.
15*2fe8fb19SBen Gras  * 3. Neither the name of the University nor the names of its contributors
16*2fe8fb19SBen Gras  *    may be used to endorse or promote products derived from this software
17*2fe8fb19SBen Gras  *    without specific prior written permission.
18*2fe8fb19SBen Gras  *
19*2fe8fb19SBen Gras  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20*2fe8fb19SBen Gras  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21*2fe8fb19SBen Gras  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22*2fe8fb19SBen Gras  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23*2fe8fb19SBen Gras  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24*2fe8fb19SBen Gras  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25*2fe8fb19SBen Gras  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26*2fe8fb19SBen Gras  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27*2fe8fb19SBen Gras  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28*2fe8fb19SBen Gras  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29*2fe8fb19SBen Gras  * SUCH DAMAGE.
30*2fe8fb19SBen Gras  */
31*2fe8fb19SBen Gras 
32*2fe8fb19SBen Gras #include <sys/cdefs.h>
33*2fe8fb19SBen Gras #if defined(LIBC_SCCS) && !defined(lint)
34*2fe8fb19SBen Gras #if 0
35*2fe8fb19SBen Gras static char sccsid[] = "@(#)times.c	8.1 (Berkeley) 6/4/93";
36*2fe8fb19SBen Gras #else
37*2fe8fb19SBen Gras __RCSID("$NetBSD: times.c,v 1.15 2009/01/11 02:46:27 christos Exp $");
38*2fe8fb19SBen Gras #endif
39*2fe8fb19SBen Gras #endif /* LIBC_SCCS and not lint */
40*2fe8fb19SBen Gras 
41*2fe8fb19SBen Gras #include "namespace.h"
42*2fe8fb19SBen Gras #include <sys/param.h>
43*2fe8fb19SBen Gras #include <sys/time.h>
44*2fe8fb19SBen Gras #include <sys/times.h>
45*2fe8fb19SBen Gras #include <sys/resource.h>
46*2fe8fb19SBen Gras 
47*2fe8fb19SBen Gras #include <assert.h>
48*2fe8fb19SBen Gras #include <errno.h>
49*2fe8fb19SBen Gras #include <time.h>
50*2fe8fb19SBen Gras 
51*2fe8fb19SBen Gras /*
52*2fe8fb19SBen Gras  * Convert usec to clock ticks; could do (usec * CLK_TCK) / 1000000,
53*2fe8fb19SBen Gras  * but this would overflow if we switch to nanosec.
54*2fe8fb19SBen Gras  */
55*2fe8fb19SBen Gras #define	CONVTCK(r)	\
56*2fe8fb19SBen Gras     (clock_t)(r.tv_sec * clk_tck + r.tv_usec / (1000000 / (uint)clk_tck))
57*2fe8fb19SBen Gras 
58*2fe8fb19SBen Gras #ifndef __times_rusage
59*2fe8fb19SBen Gras #define __times_rusage struct rusage
60*2fe8fb19SBen Gras #endif
61*2fe8fb19SBen Gras #ifndef __times_timeval
62*2fe8fb19SBen Gras #define __times_timeval struct timeval
63*2fe8fb19SBen Gras #endif
64*2fe8fb19SBen Gras 
65*2fe8fb19SBen Gras clock_t
times(struct tms * tp)66*2fe8fb19SBen Gras times(struct tms *tp)
67*2fe8fb19SBen Gras {
68*2fe8fb19SBen Gras 	__times_rusage ru;
69*2fe8fb19SBen Gras 	__times_timeval t;
70*2fe8fb19SBen Gras 	static clock_t clk_tck;
71*2fe8fb19SBen Gras 
72*2fe8fb19SBen Gras 	_DIAGASSERT(tp != NULL);
73*2fe8fb19SBen Gras 
74*2fe8fb19SBen Gras 	/*
75*2fe8fb19SBen Gras 	 * we use a local copy of CLK_TCK because it expands to a
76*2fe8fb19SBen Gras 	 * moderately expensive function call.
77*2fe8fb19SBen Gras 	 */
78*2fe8fb19SBen Gras 	if (clk_tck == 0)
79*2fe8fb19SBen Gras 		clk_tck = (clock_t)CLK_TCK;
80*2fe8fb19SBen Gras 
81*2fe8fb19SBen Gras 	if (getrusage(RUSAGE_SELF, &ru) < 0)
82*2fe8fb19SBen Gras 		return ((clock_t)-1);
83*2fe8fb19SBen Gras 	tp->tms_utime = CONVTCK(ru.ru_utime);
84*2fe8fb19SBen Gras 	tp->tms_stime = CONVTCK(ru.ru_stime);
85*2fe8fb19SBen Gras 	if (getrusage(RUSAGE_CHILDREN, &ru) < 0)
86*2fe8fb19SBen Gras 		return ((clock_t)-1);
87*2fe8fb19SBen Gras 	tp->tms_cutime = CONVTCK(ru.ru_utime);
88*2fe8fb19SBen Gras 	tp->tms_cstime = CONVTCK(ru.ru_stime);
89*2fe8fb19SBen Gras 	if (gettimeofday(&t, (struct timezone *)0))
90*2fe8fb19SBen Gras 		return ((clock_t)-1);
91*2fe8fb19SBen Gras 	return ((clock_t)(CONVTCK(t)));
92*2fe8fb19SBen Gras }
93