- introduce new call numbers, names, and field aliases; - initialize request messages to zero for all ABI calls; - format callnr.h in the same way as com.h; - redo call tables in both servers; - remove param.h namespace pollution in the servers; - make brk(2) go to VM directly, rather than through PM; - remove obsolete BRK, UTIME, and WAIT calls; - clean up path copying routine in VFS; - move remaining system calls from libminlib to libc; - correct some errno-related mistakes in libc routines. Change-Id: I2d8ec5d061cd7e0b30c51ffd77aa72ebf84e2565
166 lines
4.6 KiB
C
166 lines
4.6 KiB
C
/* This file contains a few general purpose utility routines.
|
|
*
|
|
* The entry points into this file are
|
|
* clock_timespec: ask the clock task for the real time
|
|
* copy_path: copy a path name from a path request from userland
|
|
* fetch_name: go get a path name from user space
|
|
* panic: something awful has occurred; MINIX cannot continue
|
|
* in_group: determines if group 'grp' is in rfp->fp_sgroups[]
|
|
*/
|
|
|
|
#include "fs.h"
|
|
#include <minix/callnr.h>
|
|
#include <minix/endpoint.h>
|
|
#include <unistd.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <assert.h>
|
|
#include <time.h>
|
|
#include "file.h"
|
|
#include "vmnt.h"
|
|
|
|
/*===========================================================================*
|
|
* copy_path *
|
|
*===========================================================================*/
|
|
int copy_path(char *dest, size_t size)
|
|
{
|
|
/* Go get the path for a path request. Put the result in in 'dest', which
|
|
* should be at least PATH_MAX in size.
|
|
*/
|
|
vir_bytes name;
|
|
size_t len;
|
|
|
|
assert(size >= PATH_MAX);
|
|
|
|
name = (vir_bytes) job_m_in.VFS_PATH_NAME;
|
|
len = job_m_in.VFS_PATH_LEN;
|
|
|
|
if (len > size) { /* 'len' includes terminating-nul */
|
|
err_code = ENAMETOOLONG;
|
|
return(EGENERIC);
|
|
}
|
|
|
|
/* Is the string contained in the message? If not, perform a normal copy. */
|
|
if (len > M3_STRING)
|
|
return fetch_name(name, len, dest);
|
|
|
|
/* Just copy the path from the message */
|
|
strncpy(dest, job_m_in.VFS_PATH_BUF, len);
|
|
|
|
if (dest[len - 1] != '\0') {
|
|
err_code = ENAMETOOLONG;
|
|
return(EGENERIC);
|
|
}
|
|
|
|
return(OK);
|
|
}
|
|
|
|
/*===========================================================================*
|
|
* fetch_name *
|
|
*===========================================================================*/
|
|
int fetch_name(vir_bytes path, size_t len, char *dest)
|
|
{
|
|
/* Go get path and put it in 'dest'. */
|
|
int r;
|
|
|
|
if (len > PATH_MAX) { /* 'len' includes terminating-nul */
|
|
err_code = ENAMETOOLONG;
|
|
return(EGENERIC);
|
|
}
|
|
|
|
/* Check name length for validity. */
|
|
if (len > SSIZE_MAX) {
|
|
err_code = EINVAL;
|
|
return(EGENERIC);
|
|
}
|
|
|
|
/* String is not contained in the message. Get it from user space. */
|
|
r = sys_datacopy(who_e, path, VFS_PROC_NR, (vir_bytes) dest, len);
|
|
if (r != OK) {
|
|
err_code = EINVAL;
|
|
return(r);
|
|
}
|
|
|
|
if (dest[len - 1] != '\0') {
|
|
err_code = ENAMETOOLONG;
|
|
return(EGENERIC);
|
|
}
|
|
|
|
return(OK);
|
|
}
|
|
|
|
/*===========================================================================*
|
|
* isokendpt_f *
|
|
*===========================================================================*/
|
|
int isokendpt_f(const char *file, int line, endpoint_t endpoint, int *proc,
|
|
int fatal)
|
|
{
|
|
int failed = 0;
|
|
endpoint_t ke;
|
|
*proc = _ENDPOINT_P(endpoint);
|
|
if (endpoint == NONE) {
|
|
printf("VFS %s:%d: endpoint is NONE\n", file, line);
|
|
failed = 1;
|
|
} else if (*proc < 0 || *proc >= NR_PROCS) {
|
|
printf("VFS %s:%d: proc (%d) from endpoint (%d) out of range\n",
|
|
file, line, *proc, endpoint);
|
|
failed = 1;
|
|
} else if ((ke = fproc[*proc].fp_endpoint) != endpoint) {
|
|
if(ke == NONE) {
|
|
assert(fproc[*proc].fp_pid == PID_FREE);
|
|
} else {
|
|
printf("VFS %s:%d: proc (%d) from endpoint (%d) doesn't match "
|
|
"known endpoint (%d)\n", file, line, *proc, endpoint,
|
|
fproc[*proc].fp_endpoint);
|
|
assert(fproc[*proc].fp_pid != PID_FREE);
|
|
}
|
|
failed = 1;
|
|
}
|
|
|
|
if(failed && fatal)
|
|
panic("isokendpt_f failed");
|
|
|
|
return(failed ? EDEADEPT : OK);
|
|
}
|
|
|
|
|
|
/*===========================================================================*
|
|
* clock_timespec *
|
|
*===========================================================================*/
|
|
struct timespec clock_timespec(void)
|
|
{
|
|
/* This routine returns the time in seconds since 1.1.1970. MINIX is an
|
|
* astrophysically naive system that assumes the earth rotates at a constant
|
|
* rate and that such things as leap seconds do not exist.
|
|
*/
|
|
|
|
register int r;
|
|
struct timespec tv;
|
|
clock_t uptime;
|
|
clock_t realtime;
|
|
time_t boottime;
|
|
|
|
r = getuptime(&uptime, &realtime, &boottime);
|
|
if (r != OK)
|
|
panic("clock_timespec err: %d", r);
|
|
|
|
tv.tv_sec = (time_t) (boottime + (realtime/system_hz));
|
|
/* We do not want to overflow, and system_hz can be as high as 50kHz */
|
|
assert(system_hz < LONG_MAX/40000);
|
|
tv.tv_nsec = (realtime%system_hz) * 40000 / system_hz * 25000;
|
|
return tv;
|
|
}
|
|
|
|
/*===========================================================================*
|
|
* in_group *
|
|
*===========================================================================*/
|
|
int in_group(struct fproc *rfp, gid_t grp)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < rfp->fp_ngroups; i++)
|
|
if (rfp->fp_sgroups[i] == grp)
|
|
return(OK);
|
|
|
|
return(EINVAL);
|
|
}
|