time.c revision 1.5 1 1.1 cgd /*-
2 1.5 mycroft * Copyright (c) 1980, 1991, 1993
3 1.5 mycroft * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.5 mycroft /*static char sccsid[] = "from: @(#)time.c 8.1 (Berkeley) 5/31/93";*/
36 1.5 mycroft static char *rcsid = "$Id: time.c,v 1.5 1994/09/21 00:11:20 mycroft Exp $";
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd #include <sys/types.h>
40 1.1 cgd #if __STDC__
41 1.1 cgd # include <stdarg.h>
42 1.1 cgd #else
43 1.1 cgd # include <varargs.h>
44 1.1 cgd #endif
45 1.1 cgd
46 1.1 cgd #include "csh.h"
47 1.1 cgd #include "extern.h"
48 1.1 cgd
49 1.1 cgd /*
50 1.1 cgd * C Shell - routines handling process timing and niceing
51 1.1 cgd */
52 1.1 cgd static void pdeltat __P((struct timeval *, struct timeval *));
53 1.1 cgd
54 1.1 cgd void
55 1.1 cgd settimes()
56 1.1 cgd {
57 1.1 cgd struct rusage ruch;
58 1.1 cgd
59 1.1 cgd (void) gettimeofday(&time0, NULL);
60 1.1 cgd (void) getrusage(RUSAGE_SELF, &ru0);
61 1.1 cgd (void) getrusage(RUSAGE_CHILDREN, &ruch);
62 1.1 cgd ruadd(&ru0, &ruch);
63 1.1 cgd }
64 1.1 cgd
65 1.1 cgd /*
66 1.1 cgd * dotime is only called if it is truly a builtin function and not a
67 1.1 cgd * prefix to another command
68 1.1 cgd */
69 1.1 cgd void
70 1.5 mycroft /*ARGSUSED*/
71 1.5 mycroft dotime(v, t)
72 1.5 mycroft Char **v;
73 1.5 mycroft struct command *t;
74 1.1 cgd {
75 1.1 cgd struct timeval timedol;
76 1.1 cgd struct rusage ru1, ruch;
77 1.1 cgd
78 1.1 cgd (void) getrusage(RUSAGE_SELF, &ru1);
79 1.1 cgd (void) getrusage(RUSAGE_CHILDREN, &ruch);
80 1.1 cgd ruadd(&ru1, &ruch);
81 1.1 cgd (void) gettimeofday(&timedol, NULL);
82 1.1 cgd prusage(&ru0, &ru1, &timedol, &time0);
83 1.1 cgd }
84 1.1 cgd
85 1.1 cgd /*
86 1.1 cgd * donice is only called when it on the line by itself or with a +- value
87 1.1 cgd */
88 1.1 cgd void
89 1.5 mycroft /*ARGSUSED*/
90 1.5 mycroft donice(v, t)
91 1.5 mycroft Char **v;
92 1.5 mycroft struct command *t;
93 1.1 cgd {
94 1.1 cgd register Char *cp;
95 1.1 cgd int nval = 0;
96 1.1 cgd
97 1.1 cgd v++, cp = *v++;
98 1.1 cgd if (cp == 0)
99 1.1 cgd nval = 4;
100 1.1 cgd else if (*v == 0 && any("+-", cp[0]))
101 1.1 cgd nval = getn(cp);
102 1.1 cgd (void) setpriority(PRIO_PROCESS, 0, nval);
103 1.1 cgd }
104 1.1 cgd
105 1.1 cgd void
106 1.1 cgd ruadd(ru, ru2)
107 1.1 cgd register struct rusage *ru, *ru2;
108 1.1 cgd {
109 1.1 cgd tvadd(&ru->ru_utime, &ru2->ru_utime);
110 1.1 cgd tvadd(&ru->ru_stime, &ru2->ru_stime);
111 1.1 cgd if (ru2->ru_maxrss > ru->ru_maxrss)
112 1.1 cgd ru->ru_maxrss = ru2->ru_maxrss;
113 1.1 cgd
114 1.1 cgd ru->ru_ixrss += ru2->ru_ixrss;
115 1.1 cgd ru->ru_idrss += ru2->ru_idrss;
116 1.1 cgd ru->ru_isrss += ru2->ru_isrss;
117 1.1 cgd ru->ru_minflt += ru2->ru_minflt;
118 1.1 cgd ru->ru_majflt += ru2->ru_majflt;
119 1.1 cgd ru->ru_nswap += ru2->ru_nswap;
120 1.1 cgd ru->ru_inblock += ru2->ru_inblock;
121 1.1 cgd ru->ru_oublock += ru2->ru_oublock;
122 1.1 cgd ru->ru_msgsnd += ru2->ru_msgsnd;
123 1.1 cgd ru->ru_msgrcv += ru2->ru_msgrcv;
124 1.1 cgd ru->ru_nsignals += ru2->ru_nsignals;
125 1.1 cgd ru->ru_nvcsw += ru2->ru_nvcsw;
126 1.1 cgd ru->ru_nivcsw += ru2->ru_nivcsw;
127 1.1 cgd }
128 1.1 cgd
129 1.1 cgd void
130 1.1 cgd prusage(r0, r1, e, b)
131 1.1 cgd register struct rusage *r0, *r1;
132 1.1 cgd struct timeval *e, *b;
133 1.1 cgd {
134 1.1 cgd register time_t t =
135 1.1 cgd (r1->ru_utime.tv_sec - r0->ru_utime.tv_sec) * 100 +
136 1.1 cgd (r1->ru_utime.tv_usec - r0->ru_utime.tv_usec) / 10000 +
137 1.1 cgd (r1->ru_stime.tv_sec - r0->ru_stime.tv_sec) * 100 +
138 1.1 cgd (r1->ru_stime.tv_usec - r0->ru_stime.tv_usec) / 10000;
139 1.1 cgd register char *cp;
140 1.1 cgd register long i;
141 1.1 cgd register struct varent *vp = adrof(STRtime);
142 1.1 cgd
143 1.1 cgd int ms =
144 1.1 cgd (e->tv_sec - b->tv_sec) * 100 + (e->tv_usec - b->tv_usec) / 10000;
145 1.1 cgd
146 1.1 cgd cp = "%Uu %Ss %E %P %X+%Dk %I+%Oio %Fpf+%Ww";
147 1.1 cgd
148 1.1 cgd if (vp && vp->vec[0] && vp->vec[1])
149 1.1 cgd cp = short2str(vp->vec[1]);
150 1.1 cgd
151 1.1 cgd for (; *cp; cp++)
152 1.1 cgd if (*cp != '%')
153 1.5 mycroft (void) fputc(*cp, cshout);
154 1.1 cgd else if (cp[1])
155 1.1 cgd switch (*++cp) {
156 1.1 cgd
157 1.1 cgd case 'U': /* user CPU time used */
158 1.1 cgd pdeltat(&r1->ru_utime, &r0->ru_utime);
159 1.1 cgd break;
160 1.1 cgd
161 1.1 cgd case 'S': /* system CPU time used */
162 1.1 cgd pdeltat(&r1->ru_stime, &r0->ru_stime);
163 1.1 cgd break;
164 1.1 cgd
165 1.1 cgd case 'E': /* elapsed (wall-clock) time */
166 1.1 cgd pcsecs((long) ms);
167 1.1 cgd break;
168 1.1 cgd
169 1.1 cgd case 'P': /* percent time spent running */
170 1.1 cgd /* check if it did not run at all */
171 1.1 cgd i = (ms == 0) ? 0 : (t * 1000 / ms);
172 1.5 mycroft /* nn.n% */
173 1.5 mycroft (void) fprintf(cshout, "%ld.%01ld%%", i / 10, i % 10);
174 1.1 cgd break;
175 1.1 cgd
176 1.1 cgd case 'W': /* number of swaps */
177 1.1 cgd i = r1->ru_nswap - r0->ru_nswap;
178 1.5 mycroft (void) fprintf(cshout, "%ld", i);
179 1.1 cgd break;
180 1.1 cgd
181 1.1 cgd case 'X': /* (average) shared text size */
182 1.5 mycroft (void) fprintf(cshout, "%ld", t == 0 ? 0L :
183 1.5 mycroft (r1->ru_ixrss - r0->ru_ixrss) / t);
184 1.1 cgd break;
185 1.1 cgd
186 1.1 cgd case 'D': /* (average) unshared data size */
187 1.5 mycroft (void) fprintf(cshout, "%ld", t == 0 ? 0L :
188 1.1 cgd (r1->ru_idrss + r1->ru_isrss -
189 1.1 cgd (r0->ru_idrss + r0->ru_isrss)) / t);
190 1.1 cgd break;
191 1.1 cgd
192 1.1 cgd case 'K': /* (average) total data memory used */
193 1.5 mycroft (void) fprintf(cshout, "%ld", t == 0 ? 0L :
194 1.1 cgd ((r1->ru_ixrss + r1->ru_isrss + r1->ru_idrss) -
195 1.1 cgd (r0->ru_ixrss + r0->ru_idrss + r0->ru_isrss)) / t);
196 1.1 cgd break;
197 1.1 cgd
198 1.1 cgd case 'M': /* max. Resident Set Size */
199 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_maxrss / 2L);
200 1.1 cgd break;
201 1.1 cgd
202 1.1 cgd case 'F': /* page faults */
203 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_majflt - r0->ru_majflt);
204 1.1 cgd break;
205 1.1 cgd
206 1.1 cgd case 'R': /* page reclaims */
207 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_minflt - r0->ru_minflt);
208 1.1 cgd break;
209 1.1 cgd
210 1.1 cgd case 'I': /* FS blocks in */
211 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_inblock - r0->ru_inblock);
212 1.1 cgd break;
213 1.1 cgd
214 1.1 cgd case 'O': /* FS blocks out */
215 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_oublock - r0->ru_oublock);
216 1.1 cgd break;
217 1.1 cgd
218 1.1 cgd case 'r': /* socket messages recieved */
219 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_msgrcv - r0->ru_msgrcv);
220 1.1 cgd break;
221 1.1 cgd
222 1.1 cgd case 's': /* socket messages sent */
223 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_msgsnd - r0->ru_msgsnd);
224 1.1 cgd break;
225 1.1 cgd
226 1.1 cgd case 'k': /* number of signals recieved */
227 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_nsignals-r0->ru_nsignals);
228 1.1 cgd break;
229 1.1 cgd
230 1.1 cgd case 'w': /* num. voluntary context switches (waits) */
231 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_nvcsw - r0->ru_nvcsw);
232 1.1 cgd break;
233 1.1 cgd
234 1.1 cgd case 'c': /* num. involuntary context switches */
235 1.5 mycroft (void) fprintf(cshout, "%ld", r1->ru_nivcsw - r0->ru_nivcsw);
236 1.1 cgd break;
237 1.1 cgd }
238 1.5 mycroft (void) fputc('\n', cshout);
239 1.1 cgd }
240 1.1 cgd
241 1.1 cgd static void
242 1.1 cgd pdeltat(t1, t0)
243 1.1 cgd struct timeval *t1, *t0;
244 1.1 cgd {
245 1.1 cgd struct timeval td;
246 1.1 cgd
247 1.1 cgd tvsub(&td, t1, t0);
248 1.5 mycroft (void) fprintf(cshout, "%d.%01d", td.tv_sec, td.tv_usec / 100000);
249 1.1 cgd }
250 1.1 cgd
251 1.1 cgd void
252 1.1 cgd tvadd(tsum, t0)
253 1.1 cgd struct timeval *tsum, *t0;
254 1.1 cgd {
255 1.1 cgd
256 1.1 cgd tsum->tv_sec += t0->tv_sec;
257 1.1 cgd tsum->tv_usec += t0->tv_usec;
258 1.1 cgd if (tsum->tv_usec > 1000000)
259 1.1 cgd tsum->tv_sec++, tsum->tv_usec -= 1000000;
260 1.1 cgd }
261 1.1 cgd
262 1.1 cgd void
263 1.1 cgd tvsub(tdiff, t1, t0)
264 1.1 cgd struct timeval *tdiff, *t1, *t0;
265 1.1 cgd {
266 1.1 cgd
267 1.1 cgd tdiff->tv_sec = t1->tv_sec - t0->tv_sec;
268 1.1 cgd tdiff->tv_usec = t1->tv_usec - t0->tv_usec;
269 1.1 cgd if (tdiff->tv_usec < 0)
270 1.1 cgd tdiff->tv_sec--, tdiff->tv_usec += 1000000;
271 1.5 mycroft }
272 1.5 mycroft
273 1.5 mycroft #define P2DIG(i) (void) fprintf(cshout, "%d%d", (i) / 10, (i) % 10)
274 1.5 mycroft
275 1.5 mycroft void
276 1.5 mycroft psecs(l)
277 1.5 mycroft long l;
278 1.5 mycroft {
279 1.5 mycroft register int i;
280 1.5 mycroft
281 1.5 mycroft i = l / 3600;
282 1.5 mycroft if (i) {
283 1.5 mycroft (void) fprintf(cshout, "%d:", i);
284 1.5 mycroft i = l % 3600;
285 1.5 mycroft P2DIG(i / 60);
286 1.5 mycroft goto minsec;
287 1.5 mycroft }
288 1.5 mycroft i = l;
289 1.5 mycroft (void) fprintf(cshout, "%d", i / 60);
290 1.5 mycroft minsec:
291 1.5 mycroft i %= 60;
292 1.5 mycroft (void) fputc(':', cshout);
293 1.5 mycroft P2DIG(i);
294 1.5 mycroft }
295 1.5 mycroft
296 1.5 mycroft void
297 1.5 mycroft pcsecs(l) /* PWP: print mm:ss.dd, l is in sec*100 */
298 1.5 mycroft long l;
299 1.5 mycroft {
300 1.5 mycroft register int i;
301 1.5 mycroft
302 1.5 mycroft i = l / 360000;
303 1.5 mycroft if (i) {
304 1.5 mycroft (void) fprintf(cshout, "%d:", i);
305 1.5 mycroft i = (l % 360000) / 100;
306 1.5 mycroft P2DIG(i / 60);
307 1.5 mycroft goto minsec;
308 1.5 mycroft }
309 1.5 mycroft i = l / 100;
310 1.5 mycroft (void) fprintf(cshout, "%d", i / 60);
311 1.5 mycroft minsec:
312 1.5 mycroft i %= 60;
313 1.5 mycroft (void) fputc(':', cshout);
314 1.5 mycroft P2DIG(i);
315 1.5 mycroft (void) fputc('.', cshout);
316 1.5 mycroft P2DIG((int) (l % 100));
317 1.1 cgd }
318