time.c revision 1.1.1.2 1 1.1 cgd /*-
2 1.1.1.2 mycroft * Copyright (c) 1980, 1991, 1993
3 1.1.1.2 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.1.1.2 mycroft static char sccsid[] = "@(#)time.c 8.1 (Berkeley) 5/31/93";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd #include <sys/types.h>
39 1.1 cgd #if __STDC__
40 1.1 cgd # include <stdarg.h>
41 1.1 cgd #else
42 1.1 cgd # include <varargs.h>
43 1.1 cgd #endif
44 1.1 cgd
45 1.1 cgd #include "csh.h"
46 1.1 cgd #include "extern.h"
47 1.1 cgd
48 1.1 cgd /*
49 1.1 cgd * C Shell - routines handling process timing and niceing
50 1.1 cgd */
51 1.1 cgd static void pdeltat __P((struct timeval *, struct timeval *));
52 1.1 cgd
53 1.1 cgd void
54 1.1 cgd settimes()
55 1.1 cgd {
56 1.1 cgd struct rusage ruch;
57 1.1 cgd
58 1.1 cgd (void) gettimeofday(&time0, NULL);
59 1.1 cgd (void) getrusage(RUSAGE_SELF, &ru0);
60 1.1 cgd (void) getrusage(RUSAGE_CHILDREN, &ruch);
61 1.1 cgd ruadd(&ru0, &ruch);
62 1.1 cgd }
63 1.1 cgd
64 1.1 cgd /*
65 1.1 cgd * dotime is only called if it is truly a builtin function and not a
66 1.1 cgd * prefix to another command
67 1.1 cgd */
68 1.1 cgd void
69 1.1.1.2 mycroft /*ARGSUSED*/
70 1.1.1.2 mycroft dotime(v, t)
71 1.1.1.2 mycroft Char **v;
72 1.1.1.2 mycroft struct command *t;
73 1.1 cgd {
74 1.1 cgd struct timeval timedol;
75 1.1 cgd struct rusage ru1, ruch;
76 1.1 cgd
77 1.1 cgd (void) getrusage(RUSAGE_SELF, &ru1);
78 1.1 cgd (void) getrusage(RUSAGE_CHILDREN, &ruch);
79 1.1 cgd ruadd(&ru1, &ruch);
80 1.1 cgd (void) gettimeofday(&timedol, NULL);
81 1.1 cgd prusage(&ru0, &ru1, &timedol, &time0);
82 1.1 cgd }
83 1.1 cgd
84 1.1 cgd /*
85 1.1 cgd * donice is only called when it on the line by itself or with a +- value
86 1.1 cgd */
87 1.1 cgd void
88 1.1.1.2 mycroft /*ARGSUSED*/
89 1.1.1.2 mycroft donice(v, t)
90 1.1.1.2 mycroft Char **v;
91 1.1.1.2 mycroft struct command *t;
92 1.1 cgd {
93 1.1 cgd register Char *cp;
94 1.1 cgd int nval = 0;
95 1.1 cgd
96 1.1 cgd v++, cp = *v++;
97 1.1 cgd if (cp == 0)
98 1.1 cgd nval = 4;
99 1.1 cgd else if (*v == 0 && any("+-", cp[0]))
100 1.1 cgd nval = getn(cp);
101 1.1 cgd (void) setpriority(PRIO_PROCESS, 0, nval);
102 1.1 cgd }
103 1.1 cgd
104 1.1 cgd void
105 1.1 cgd ruadd(ru, ru2)
106 1.1 cgd register struct rusage *ru, *ru2;
107 1.1 cgd {
108 1.1 cgd tvadd(&ru->ru_utime, &ru2->ru_utime);
109 1.1 cgd tvadd(&ru->ru_stime, &ru2->ru_stime);
110 1.1 cgd if (ru2->ru_maxrss > ru->ru_maxrss)
111 1.1 cgd ru->ru_maxrss = ru2->ru_maxrss;
112 1.1 cgd
113 1.1 cgd ru->ru_ixrss += ru2->ru_ixrss;
114 1.1 cgd ru->ru_idrss += ru2->ru_idrss;
115 1.1 cgd ru->ru_isrss += ru2->ru_isrss;
116 1.1 cgd ru->ru_minflt += ru2->ru_minflt;
117 1.1 cgd ru->ru_majflt += ru2->ru_majflt;
118 1.1 cgd ru->ru_nswap += ru2->ru_nswap;
119 1.1 cgd ru->ru_inblock += ru2->ru_inblock;
120 1.1 cgd ru->ru_oublock += ru2->ru_oublock;
121 1.1 cgd ru->ru_msgsnd += ru2->ru_msgsnd;
122 1.1 cgd ru->ru_msgrcv += ru2->ru_msgrcv;
123 1.1 cgd ru->ru_nsignals += ru2->ru_nsignals;
124 1.1 cgd ru->ru_nvcsw += ru2->ru_nvcsw;
125 1.1 cgd ru->ru_nivcsw += ru2->ru_nivcsw;
126 1.1 cgd }
127 1.1 cgd
128 1.1 cgd void
129 1.1 cgd prusage(r0, r1, e, b)
130 1.1 cgd register struct rusage *r0, *r1;
131 1.1 cgd struct timeval *e, *b;
132 1.1 cgd {
133 1.1 cgd register time_t t =
134 1.1 cgd (r1->ru_utime.tv_sec - r0->ru_utime.tv_sec) * 100 +
135 1.1 cgd (r1->ru_utime.tv_usec - r0->ru_utime.tv_usec) / 10000 +
136 1.1 cgd (r1->ru_stime.tv_sec - r0->ru_stime.tv_sec) * 100 +
137 1.1 cgd (r1->ru_stime.tv_usec - r0->ru_stime.tv_usec) / 10000;
138 1.1 cgd register char *cp;
139 1.1 cgd register long i;
140 1.1 cgd register struct varent *vp = adrof(STRtime);
141 1.1 cgd
142 1.1 cgd int ms =
143 1.1 cgd (e->tv_sec - b->tv_sec) * 100 + (e->tv_usec - b->tv_usec) / 10000;
144 1.1 cgd
145 1.1 cgd cp = "%Uu %Ss %E %P %X+%Dk %I+%Oio %Fpf+%Ww";
146 1.1 cgd
147 1.1 cgd if (vp && vp->vec[0] && vp->vec[1])
148 1.1 cgd cp = short2str(vp->vec[1]);
149 1.1 cgd
150 1.1 cgd for (; *cp; cp++)
151 1.1 cgd if (*cp != '%')
152 1.1.1.2 mycroft (void) fputc(*cp, cshout);
153 1.1 cgd else if (cp[1])
154 1.1 cgd switch (*++cp) {
155 1.1 cgd
156 1.1 cgd case 'U': /* user CPU time used */
157 1.1 cgd pdeltat(&r1->ru_utime, &r0->ru_utime);
158 1.1 cgd break;
159 1.1 cgd
160 1.1 cgd case 'S': /* system CPU time used */
161 1.1 cgd pdeltat(&r1->ru_stime, &r0->ru_stime);
162 1.1 cgd break;
163 1.1 cgd
164 1.1 cgd case 'E': /* elapsed (wall-clock) time */
165 1.1 cgd pcsecs((long) ms);
166 1.1 cgd break;
167 1.1 cgd
168 1.1 cgd case 'P': /* percent time spent running */
169 1.1 cgd /* check if it did not run at all */
170 1.1 cgd i = (ms == 0) ? 0 : (t * 1000 / ms);
171 1.1.1.2 mycroft /* nn.n% */
172 1.1.1.2 mycroft (void) fprintf(cshout, "%ld.%01ld%%", i / 10, i % 10);
173 1.1 cgd break;
174 1.1 cgd
175 1.1 cgd case 'W': /* number of swaps */
176 1.1 cgd i = r1->ru_nswap - r0->ru_nswap;
177 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", i);
178 1.1 cgd break;
179 1.1 cgd
180 1.1 cgd case 'X': /* (average) shared text size */
181 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", t == 0 ? 0L :
182 1.1.1.2 mycroft (r1->ru_ixrss - r0->ru_ixrss) / t);
183 1.1 cgd break;
184 1.1 cgd
185 1.1 cgd case 'D': /* (average) unshared data size */
186 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", t == 0 ? 0L :
187 1.1 cgd (r1->ru_idrss + r1->ru_isrss -
188 1.1 cgd (r0->ru_idrss + r0->ru_isrss)) / t);
189 1.1 cgd break;
190 1.1 cgd
191 1.1 cgd case 'K': /* (average) total data memory used */
192 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", t == 0 ? 0L :
193 1.1 cgd ((r1->ru_ixrss + r1->ru_isrss + r1->ru_idrss) -
194 1.1 cgd (r0->ru_ixrss + r0->ru_idrss + r0->ru_isrss)) / t);
195 1.1 cgd break;
196 1.1 cgd
197 1.1 cgd case 'M': /* max. Resident Set Size */
198 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_maxrss / 2L);
199 1.1 cgd break;
200 1.1 cgd
201 1.1 cgd case 'F': /* page faults */
202 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_majflt - r0->ru_majflt);
203 1.1 cgd break;
204 1.1 cgd
205 1.1 cgd case 'R': /* page reclaims */
206 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_minflt - r0->ru_minflt);
207 1.1 cgd break;
208 1.1 cgd
209 1.1 cgd case 'I': /* FS blocks in */
210 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_inblock - r0->ru_inblock);
211 1.1 cgd break;
212 1.1 cgd
213 1.1 cgd case 'O': /* FS blocks out */
214 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_oublock - r0->ru_oublock);
215 1.1 cgd break;
216 1.1 cgd
217 1.1 cgd case 'r': /* socket messages recieved */
218 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_msgrcv - r0->ru_msgrcv);
219 1.1 cgd break;
220 1.1 cgd
221 1.1 cgd case 's': /* socket messages sent */
222 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_msgsnd - r0->ru_msgsnd);
223 1.1 cgd break;
224 1.1 cgd
225 1.1 cgd case 'k': /* number of signals recieved */
226 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_nsignals-r0->ru_nsignals);
227 1.1 cgd break;
228 1.1 cgd
229 1.1 cgd case 'w': /* num. voluntary context switches (waits) */
230 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_nvcsw - r0->ru_nvcsw);
231 1.1 cgd break;
232 1.1 cgd
233 1.1 cgd case 'c': /* num. involuntary context switches */
234 1.1.1.2 mycroft (void) fprintf(cshout, "%ld", r1->ru_nivcsw - r0->ru_nivcsw);
235 1.1 cgd break;
236 1.1 cgd }
237 1.1.1.2 mycroft (void) fputc('\n', cshout);
238 1.1 cgd }
239 1.1 cgd
240 1.1 cgd static void
241 1.1 cgd pdeltat(t1, t0)
242 1.1 cgd struct timeval *t1, *t0;
243 1.1 cgd {
244 1.1 cgd struct timeval td;
245 1.1 cgd
246 1.1 cgd tvsub(&td, t1, t0);
247 1.1.1.2 mycroft (void) fprintf(cshout, "%d.%01d", td.tv_sec, td.tv_usec / 100000);
248 1.1 cgd }
249 1.1 cgd
250 1.1 cgd void
251 1.1 cgd tvadd(tsum, t0)
252 1.1 cgd struct timeval *tsum, *t0;
253 1.1 cgd {
254 1.1 cgd
255 1.1 cgd tsum->tv_sec += t0->tv_sec;
256 1.1 cgd tsum->tv_usec += t0->tv_usec;
257 1.1 cgd if (tsum->tv_usec > 1000000)
258 1.1 cgd tsum->tv_sec++, tsum->tv_usec -= 1000000;
259 1.1 cgd }
260 1.1 cgd
261 1.1 cgd void
262 1.1 cgd tvsub(tdiff, t1, t0)
263 1.1 cgd struct timeval *tdiff, *t1, *t0;
264 1.1 cgd {
265 1.1 cgd
266 1.1 cgd tdiff->tv_sec = t1->tv_sec - t0->tv_sec;
267 1.1 cgd tdiff->tv_usec = t1->tv_usec - t0->tv_usec;
268 1.1 cgd if (tdiff->tv_usec < 0)
269 1.1 cgd tdiff->tv_sec--, tdiff->tv_usec += 1000000;
270 1.1.1.2 mycroft }
271 1.1.1.2 mycroft
272 1.1.1.2 mycroft #define P2DIG(i) (void) fprintf(cshout, "%d%d", (i) / 10, (i) % 10)
273 1.1.1.2 mycroft
274 1.1.1.2 mycroft void
275 1.1.1.2 mycroft psecs(l)
276 1.1.1.2 mycroft long l;
277 1.1.1.2 mycroft {
278 1.1.1.2 mycroft register int i;
279 1.1.1.2 mycroft
280 1.1.1.2 mycroft i = l / 3600;
281 1.1.1.2 mycroft if (i) {
282 1.1.1.2 mycroft (void) fprintf(cshout, "%d:", i);
283 1.1.1.2 mycroft i = l % 3600;
284 1.1.1.2 mycroft P2DIG(i / 60);
285 1.1.1.2 mycroft goto minsec;
286 1.1.1.2 mycroft }
287 1.1.1.2 mycroft i = l;
288 1.1.1.2 mycroft (void) fprintf(cshout, "%d", i / 60);
289 1.1.1.2 mycroft minsec:
290 1.1.1.2 mycroft i %= 60;
291 1.1.1.2 mycroft (void) fputc(':', cshout);
292 1.1.1.2 mycroft P2DIG(i);
293 1.1.1.2 mycroft }
294 1.1.1.2 mycroft
295 1.1.1.2 mycroft void
296 1.1.1.2 mycroft pcsecs(l) /* PWP: print mm:ss.dd, l is in sec*100 */
297 1.1.1.2 mycroft long l;
298 1.1.1.2 mycroft {
299 1.1.1.2 mycroft register int i;
300 1.1.1.2 mycroft
301 1.1.1.2 mycroft i = l / 360000;
302 1.1.1.2 mycroft if (i) {
303 1.1.1.2 mycroft (void) fprintf(cshout, "%d:", i);
304 1.1.1.2 mycroft i = (l % 360000) / 100;
305 1.1.1.2 mycroft P2DIG(i / 60);
306 1.1.1.2 mycroft goto minsec;
307 1.1.1.2 mycroft }
308 1.1.1.2 mycroft i = l / 100;
309 1.1.1.2 mycroft (void) fprintf(cshout, "%d", i / 60);
310 1.1.1.2 mycroft minsec:
311 1.1.1.2 mycroft i %= 60;
312 1.1.1.2 mycroft (void) fputc(':', cshout);
313 1.1.1.2 mycroft P2DIG(i);
314 1.1.1.2 mycroft (void) fputc('.', cshout);
315 1.1.1.2 mycroft P2DIG((int) (l % 100));
316 1.1 cgd }
317