Home | History | Annotate | Line # | Download | only in csh
time.c revision 1.1
      1  1.1  cgd /*-
      2  1.1  cgd  * Copyright (c) 1980, 1991 The Regents of the University of California.
      3  1.1  cgd  * 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  cgd static char sccsid[] = "@(#)time.c	5.14 (Berkeley) 6/8/91";
     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  cgd dotime()
     70  1.1  cgd {
     71  1.1  cgd     struct timeval timedol;
     72  1.1  cgd     struct rusage ru1, ruch;
     73  1.1  cgd 
     74  1.1  cgd     (void) getrusage(RUSAGE_SELF, &ru1);
     75  1.1  cgd     (void) getrusage(RUSAGE_CHILDREN, &ruch);
     76  1.1  cgd     ruadd(&ru1, &ruch);
     77  1.1  cgd     (void) gettimeofday(&timedol, NULL);
     78  1.1  cgd     prusage(&ru0, &ru1, &timedol, &time0);
     79  1.1  cgd }
     80  1.1  cgd 
     81  1.1  cgd /*
     82  1.1  cgd  * donice is only called when it on the line by itself or with a +- value
     83  1.1  cgd  */
     84  1.1  cgd void
     85  1.1  cgd donice(v)
     86  1.1  cgd     register Char **v;
     87  1.1  cgd {
     88  1.1  cgd     register Char *cp;
     89  1.1  cgd     int     nval = 0;
     90  1.1  cgd 
     91  1.1  cgd     v++, cp = *v++;
     92  1.1  cgd     if (cp == 0)
     93  1.1  cgd 	nval = 4;
     94  1.1  cgd     else if (*v == 0 && any("+-", cp[0]))
     95  1.1  cgd 	nval = getn(cp);
     96  1.1  cgd     (void) setpriority(PRIO_PROCESS, 0, nval);
     97  1.1  cgd }
     98  1.1  cgd 
     99  1.1  cgd void
    100  1.1  cgd ruadd(ru, ru2)
    101  1.1  cgd     register struct rusage *ru, *ru2;
    102  1.1  cgd {
    103  1.1  cgd     tvadd(&ru->ru_utime, &ru2->ru_utime);
    104  1.1  cgd     tvadd(&ru->ru_stime, &ru2->ru_stime);
    105  1.1  cgd     if (ru2->ru_maxrss > ru->ru_maxrss)
    106  1.1  cgd 	ru->ru_maxrss = ru2->ru_maxrss;
    107  1.1  cgd 
    108  1.1  cgd     ru->ru_ixrss += ru2->ru_ixrss;
    109  1.1  cgd     ru->ru_idrss += ru2->ru_idrss;
    110  1.1  cgd     ru->ru_isrss += ru2->ru_isrss;
    111  1.1  cgd     ru->ru_minflt += ru2->ru_minflt;
    112  1.1  cgd     ru->ru_majflt += ru2->ru_majflt;
    113  1.1  cgd     ru->ru_nswap += ru2->ru_nswap;
    114  1.1  cgd     ru->ru_inblock += ru2->ru_inblock;
    115  1.1  cgd     ru->ru_oublock += ru2->ru_oublock;
    116  1.1  cgd     ru->ru_msgsnd += ru2->ru_msgsnd;
    117  1.1  cgd     ru->ru_msgrcv += ru2->ru_msgrcv;
    118  1.1  cgd     ru->ru_nsignals += ru2->ru_nsignals;
    119  1.1  cgd     ru->ru_nvcsw += ru2->ru_nvcsw;
    120  1.1  cgd     ru->ru_nivcsw += ru2->ru_nivcsw;
    121  1.1  cgd }
    122  1.1  cgd 
    123  1.1  cgd void
    124  1.1  cgd prusage(r0, r1, e, b)
    125  1.1  cgd     register struct rusage *r0, *r1;
    126  1.1  cgd     struct timeval *e, *b;
    127  1.1  cgd {
    128  1.1  cgd     register time_t t =
    129  1.1  cgd     (r1->ru_utime.tv_sec - r0->ru_utime.tv_sec) * 100 +
    130  1.1  cgd     (r1->ru_utime.tv_usec - r0->ru_utime.tv_usec) / 10000 +
    131  1.1  cgd     (r1->ru_stime.tv_sec - r0->ru_stime.tv_sec) * 100 +
    132  1.1  cgd     (r1->ru_stime.tv_usec - r0->ru_stime.tv_usec) / 10000;
    133  1.1  cgd     register char *cp;
    134  1.1  cgd     register long i;
    135  1.1  cgd     register struct varent *vp = adrof(STRtime);
    136  1.1  cgd 
    137  1.1  cgd     int     ms =
    138  1.1  cgd     (e->tv_sec - b->tv_sec) * 100 + (e->tv_usec - b->tv_usec) / 10000;
    139  1.1  cgd 
    140  1.1  cgd     cp = "%Uu %Ss %E %P %X+%Dk %I+%Oio %Fpf+%Ww";
    141  1.1  cgd 
    142  1.1  cgd     if (vp && vp->vec[0] && vp->vec[1])
    143  1.1  cgd 	cp = short2str(vp->vec[1]);
    144  1.1  cgd 
    145  1.1  cgd     for (; *cp; cp++)
    146  1.1  cgd 	if (*cp != '%')
    147  1.1  cgd 	    xputchar(*cp);
    148  1.1  cgd 	else if (cp[1])
    149  1.1  cgd 	    switch (*++cp) {
    150  1.1  cgd 
    151  1.1  cgd 	    case 'U':		/* user CPU time used */
    152  1.1  cgd 		pdeltat(&r1->ru_utime, &r0->ru_utime);
    153  1.1  cgd 		break;
    154  1.1  cgd 
    155  1.1  cgd 	    case 'S':		/* system CPU time used */
    156  1.1  cgd 		pdeltat(&r1->ru_stime, &r0->ru_stime);
    157  1.1  cgd 		break;
    158  1.1  cgd 
    159  1.1  cgd 	    case 'E':		/* elapsed (wall-clock) time */
    160  1.1  cgd 		pcsecs((long) ms);
    161  1.1  cgd 		break;
    162  1.1  cgd 
    163  1.1  cgd 	    case 'P':		/* percent time spent running */
    164  1.1  cgd 		/* check if it did not run at all */
    165  1.1  cgd 		i = (ms == 0) ? 0 : (t * 1000 / ms);
    166  1.1  cgd 		xprintf("%ld.%01ld%%", i / 10, i % 10);	/* nn.n% */
    167  1.1  cgd 		break;
    168  1.1  cgd 
    169  1.1  cgd 	    case 'W':		/* number of swaps */
    170  1.1  cgd 		i = r1->ru_nswap - r0->ru_nswap;
    171  1.1  cgd 		xprintf("%ld", i);
    172  1.1  cgd 		break;
    173  1.1  cgd 
    174  1.1  cgd 	    case 'X':		/* (average) shared text size */
    175  1.1  cgd 		xprintf("%ld", t == 0 ? 0L : (r1->ru_ixrss - r0->ru_ixrss) / t);
    176  1.1  cgd 		break;
    177  1.1  cgd 
    178  1.1  cgd 	    case 'D':		/* (average) unshared data size */
    179  1.1  cgd 		xprintf("%ld", t == 0 ? 0L :
    180  1.1  cgd 			(r1->ru_idrss + r1->ru_isrss -
    181  1.1  cgd 			 (r0->ru_idrss + r0->ru_isrss)) / t);
    182  1.1  cgd 		break;
    183  1.1  cgd 
    184  1.1  cgd 	    case 'K':		/* (average) total data memory used  */
    185  1.1  cgd 		xprintf("%ld", t == 0 ? 0L :
    186  1.1  cgd 			((r1->ru_ixrss + r1->ru_isrss + r1->ru_idrss) -
    187  1.1  cgd 			 (r0->ru_ixrss + r0->ru_idrss + r0->ru_isrss)) / t);
    188  1.1  cgd 		break;
    189  1.1  cgd 
    190  1.1  cgd 	    case 'M':		/* max. Resident Set Size */
    191  1.1  cgd 		xprintf("%ld", r1->ru_maxrss / 2L);
    192  1.1  cgd 		break;
    193  1.1  cgd 
    194  1.1  cgd 	    case 'F':		/* page faults */
    195  1.1  cgd 		xprintf("%ld", r1->ru_majflt - r0->ru_majflt);
    196  1.1  cgd 		break;
    197  1.1  cgd 
    198  1.1  cgd 	    case 'R':		/* page reclaims */
    199  1.1  cgd 		xprintf("%ld", r1->ru_minflt - r0->ru_minflt);
    200  1.1  cgd 		break;
    201  1.1  cgd 
    202  1.1  cgd 	    case 'I':		/* FS blocks in */
    203  1.1  cgd 		xprintf("%ld", r1->ru_inblock - r0->ru_inblock);
    204  1.1  cgd 		break;
    205  1.1  cgd 
    206  1.1  cgd 	    case 'O':		/* FS blocks out */
    207  1.1  cgd 		xprintf("%ld", r1->ru_oublock - r0->ru_oublock);
    208  1.1  cgd 		break;
    209  1.1  cgd 
    210  1.1  cgd 	    case 'r':		/* socket messages recieved */
    211  1.1  cgd 		xprintf("%ld", r1->ru_msgrcv - r0->ru_msgrcv);
    212  1.1  cgd 		break;
    213  1.1  cgd 
    214  1.1  cgd 	    case 's':		/* socket messages sent */
    215  1.1  cgd 		xprintf("%ld", r1->ru_msgsnd - r0->ru_msgsnd);
    216  1.1  cgd 		break;
    217  1.1  cgd 
    218  1.1  cgd 	    case 'k':		/* number of signals recieved */
    219  1.1  cgd 		xprintf("%ld", r1->ru_nsignals - r0->ru_nsignals);
    220  1.1  cgd 		break;
    221  1.1  cgd 
    222  1.1  cgd 	    case 'w':		/* num. voluntary context switches (waits) */
    223  1.1  cgd 		xprintf("%ld", r1->ru_nvcsw - r0->ru_nvcsw);
    224  1.1  cgd 		break;
    225  1.1  cgd 
    226  1.1  cgd 	    case 'c':		/* num. involuntary context switches */
    227  1.1  cgd 		xprintf("%ld", r1->ru_nivcsw - r0->ru_nivcsw);
    228  1.1  cgd 		break;
    229  1.1  cgd 	    }
    230  1.1  cgd     xputchar('\n');
    231  1.1  cgd }
    232  1.1  cgd 
    233  1.1  cgd static void
    234  1.1  cgd pdeltat(t1, t0)
    235  1.1  cgd     struct timeval *t1, *t0;
    236  1.1  cgd {
    237  1.1  cgd     struct timeval td;
    238  1.1  cgd 
    239  1.1  cgd     tvsub(&td, t1, t0);
    240  1.1  cgd     xprintf("%d.%01d", td.tv_sec, td.tv_usec / 100000);
    241  1.1  cgd }
    242  1.1  cgd 
    243  1.1  cgd void
    244  1.1  cgd tvadd(tsum, t0)
    245  1.1  cgd     struct timeval *tsum, *t0;
    246  1.1  cgd {
    247  1.1  cgd 
    248  1.1  cgd     tsum->tv_sec += t0->tv_sec;
    249  1.1  cgd     tsum->tv_usec += t0->tv_usec;
    250  1.1  cgd     if (tsum->tv_usec > 1000000)
    251  1.1  cgd 	tsum->tv_sec++, tsum->tv_usec -= 1000000;
    252  1.1  cgd }
    253  1.1  cgd 
    254  1.1  cgd void
    255  1.1  cgd tvsub(tdiff, t1, t0)
    256  1.1  cgd     struct timeval *tdiff, *t1, *t0;
    257  1.1  cgd {
    258  1.1  cgd 
    259  1.1  cgd     tdiff->tv_sec = t1->tv_sec - t0->tv_sec;
    260  1.1  cgd     tdiff->tv_usec = t1->tv_usec - t0->tv_usec;
    261  1.1  cgd     if (tdiff->tv_usec < 0)
    262  1.1  cgd 	tdiff->tv_sec--, tdiff->tv_usec += 1000000;
    263  1.1  cgd }
    264