/* * This file is part of the UCB release of Plan 9. It is subject to the license * terms in the LICENSE file found in the top-level directory of this * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No * part of the UCB release of Plan 9, including this file, may be copied, * modified, propagated, or distributed except according to the terms contained * in the LICENSE file. */doublecputime(void){ long t[4]; long times(long*); int i; times(t); for(i=1; i<4; i++) t[0] += t[i]; return t[0] / 100.;}longseek(int f, long o, int p){ long lseek(int, long, int); return lseek(f, o, p);}intcreate(char *n, int m, long p){ int creat(char*, int); if(m != 1) return -1; return creat(n, p);}
/*
* This file is part of the UCB release of Plan 9. It is subject to the license
* terms in the LICENSE file found in the top-level directory of this
* distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
* part of the UCB release of Plan 9, including this file, may be copied,
* modified, propagated, or distributed except according to the terms contained
* in the LICENSE file.
*/
double
cputime(void)
{
long t[4];
long times(long*);
int i;
times(t);
for(i=1; i<4; i++)
t[0] += t[i];
return t[0] / 100.;
}
long
seek(int f, long o, int p)
{
long lseek(int, long, int);
return lseek(f, o, p);
}
int
create(char *n, int m, long p)
{
int creat(char*, int);
if(m != 1)
return -1;
return creat(n, p);
}