/*

 This code was written as part of the CMU Common Lisp project at
 Carnegie Mellon University, and has been placed in the public domain.

*/

#include <assert.h>
#include <errno.h>
#include <langinfo.h>
#include <locale.h>
#include <math.h>
#include <netdb.h>
#include <pwd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/resource.h>
#include <sys/stat.h>
#include <sys/utsname.h>
#include <unistd.h>
#include <time.h>

#include "os.h"
#include "internals.h"
#include "validate.h"
#include "lisp.h"
#include "lispregs.h"
#include "globals.h"
#include "interr.h"
#include "arch.h"
#include "interrupt.h"

/* Except for os_zero, these routines are only called by Lisp code.  These
   routines may also be replaced by os-dependent versions instead.  See
   hpux-os.c for some useful restrictions on actual usage. */

void
os_zero(os_vm_address_t addr, os_vm_size_t length)
{
    os_vm_address_t block_start;
    os_vm_size_t block_size;

#ifdef PRINTNOISE
    fprintf(stderr, ";;; os_zero: addr: 0x%08x, len: 0x%08x\n", addr, length);
#endif

    block_start = os_round_up_to_page(addr);

    length -= block_start - addr;
    block_size = os_trunc_size_to_page(length);

    if (block_start > addr)
	memset((char *) addr, 0, block_start - addr);
    if (block_size < length)
	memset((char *) block_start + block_size, 0, length - block_size);

    if (block_size != 0) {
	/* Now deallocate and allocate the block so that it */
	/* faults in  zero-filled. */

	os_invalidate(block_start, block_size);
	addr = os_validate(block_start, block_size);

	if (addr == NULL || addr != block_start)
	    fprintf(stderr, "os_zero: block moved, 0x%p ==> 0x%8p!\n",
		    (void *) block_start, (void *) addr);
    }
}

os_vm_address_t
os_allocate(os_vm_size_t len)
{
    return os_validate((os_vm_address_t) NULL, len);
}

os_vm_address_t
os_allocate_at(os_vm_address_t addr, os_vm_size_t len)
{
    return os_validate(addr, len);
}

void
os_deallocate(os_vm_address_t addr, os_vm_size_t len)
{
    os_invalidate(addr, len);
}

/* This function once tried to grow the chunk by asking os_validate if the
   space was available, but this really only works under Mach. */

os_vm_address_t
os_reallocate(os_vm_address_t addr, os_vm_size_t old_len, os_vm_size_t len)
{
    addr = os_trunc_to_page(addr);
    len = os_round_up_size_to_page(len);
    old_len = os_round_up_size_to_page(old_len);

    if (addr == NULL)
	return os_allocate(len);
    else {
	long len_diff = len - old_len;

	if (len_diff < 0)
	    os_invalidate(addr + len, -len_diff);
	else {
	    if (len_diff != 0) {
		os_vm_address_t new = os_allocate(len);

		if (new != NULL) {
		    memcpy((char *) new, (char *) addr, old_len);
		    os_invalidate(addr, old_len);
		}

		addr = new;
	    }
	}
	return addr;
    }
}

int
os_get_errno(void)
{
    return errno;
}

int
os_set_errno(int value)
{
    return errno = value;
}

int
os_get_h_errno(void)
{
    return h_errno;
}

#ifdef LINKAGE_TABLE

typedef enum {
    LINKAGE_CODE_TYPE = 1,
    LINKAGE_DATA_TYPE = 2
} linkage_type_t;

    
/* These declarations are lies.  They actually take args, but are
   never called by C.  Only by Lisp */
extern void resolve_linkage_tramp(void);
extern void call_into_c(void);

/* In words */
#define LINKAGE_DATA_ENTRY_SIZE 3
#endif


char*
convert_lisp_string(char* c_string, void* lisp_string, int len)
{
#ifdef UNICODE    
   /*
    * FIXME: Unicode hack to convert Lisp 16-bit string to 8-bit string
    * by lopping off the high bits.
    */

    int k;
    unsigned short int* wide_string = (unsigned short int*) lisp_string;

    for (k = 0; k < len; ++k) {
        c_string[k] = (wide_string[k]) & 0xff;
    }
    c_string[k] = 0;
#else
    strcpy(c_string, lisp_string);
#endif

    return c_string;
}

/*
 * C version of lisp's EXTERN-ALIEN-NAME.  For systems that use elf,
 * do nothing.  Otherwise, we prepend an underscore.
 */
#if defined(FEATURE_ELF)
#define EXTERN_ALIEN_NAME(x) x
#else
#define EXTERN_ALIEN_NAME(x) "_" x
#endif

void
os_foreign_linkage_init(void)
{
#ifdef LINKAGE_TABLE
    lispobj linkage_data_obj = SymbolValue(LINKAGE_TABLE_DATA);
    struct array *linkage_data = 0;
    long table_size = 0;
    struct vector *data_vector = 0;
    long i;

    linkage_data = (struct array *) PTR(linkage_data_obj);
    table_size = fixnum_value(linkage_data->fill_pointer);
    data_vector = (struct vector *) PTR(linkage_data->data);
    for (i = 0; i < table_size; i += LINKAGE_DATA_ENTRY_SIZE) {
	struct vector *symbol_name
	    = (struct vector *) PTR(data_vector->data[i]);
	long type = fixnum_value(data_vector->data[i + 1]);
	lispobj lib_list = data_vector->data[i + 2];
        /* FIXME:  1000 may not be long enough.  Add checks to make sure it's ok!!!!*/
        char c_symbol_name[1000];
	/*
	 * Verify the "known" entries.  This had better match what
	 * init-foreign-linkage in new-genesis does!
	 */

        convert_lisp_string(c_symbol_name, symbol_name->data, (symbol_name->length >> 2));

#if 0
        fprintf(stderr, "i =%2d:  %s\n", i, c_symbol_name);
        {
            int k;
            unsigned short int* wide_string;
                
            fprintf(stderr, "  symbol_name->data = ");

            wide_string = (unsigned short int *) symbol_name->data;
                
            for (k = 0; k < (symbol_name->length >> 2); ++k) {
                fprintf(stderr, "%4x ", wide_string[k]);
            }
            fprintf(stderr, "\n");
        }
#endif        
	if (i == 0) {
#if defined(sparc) || (defined(DARWIN) && defined(__ppc__))
            if (type != LINKAGE_CODE_TYPE || strcmp(c_symbol_name, EXTERN_ALIEN_NAME("call_into_c"))) {
		fprintf(stderr, "linkage_data is %s but expected %s\n",
			c_symbol_name,
                        EXTERN_ALIEN_NAME("call_into_c"));
		lose("First element of linkage_data is bogus.\n");
	    }
	    arch_make_linkage_entry(i, (void*) call_into_c, 1);
#else
	    if (type != LINKAGE_CODE_TYPE || strcmp(c_symbol_name,
                                                    EXTERN_ALIEN_NAME("resolve_linkage_tramp"))) {
		fprintf(stderr,
			"linkage_data is %s but expected %s\n",
			c_symbol_name,
                        EXTERN_ALIEN_NAME("resolve_linkage_tramp"));
		lose("First element of linkage_data is bogus.\n");
	    }
	    arch_make_linkage_entry(i, (void *) &resolve_linkage_tramp, 1);
#endif
	    continue;
	}
	if (type == LINKAGE_DATA_TYPE && lib_list == NIL) {
	    void *target_addr = os_dlsym(c_symbol_name, NIL);

	    if (!target_addr) {
#if 0
                int k;
                unsigned short int* wide_string;
                
                fprintf(stderr, "c_symbol_name = `%s'\n", c_symbol_name);
                fprintf(stderr, "symbol_name->data = \n");

                wide_string = (unsigned short int *) symbol_name->data;
                
                for (k = 0; k < (symbol_name->length >> 2); ++k) {
                    fprintf(stderr, "%4x ", wide_string[k]);
                }
                fprintf(stderr, "\n");
#endif                
		lose("%s is not defined.\n",  c_symbol_name);
	    }
	    arch_make_linkage_entry(i / LINKAGE_DATA_ENTRY_SIZE, target_addr,
				    type);
	} else {
	    arch_make_lazy_linkage(i / LINKAGE_DATA_ENTRY_SIZE);
	}
    }
#endif /* LINKAGE_TABLE */
}

/* At the second stage of initialization, after Lisp has dlopened all
   needed shared libraries, go back through the table and initialize
   data symbols. */

void
os_resolve_data_linkage(void)
{
#ifdef LINKAGE_TABLE
    lispobj linkage_data_obj = SymbolValue(LINKAGE_TABLE_DATA);
    struct array *linkage_data = 0;
    long table_size = 0;
    struct vector *data_vector = 0;
    long i;

    linkage_data = (struct array *) PTR(linkage_data_obj);
    table_size = fixnum_value(linkage_data->fill_pointer);
    data_vector = (struct vector *) PTR(linkage_data->data);
    for (i = 0; i < table_size; i += LINKAGE_DATA_ENTRY_SIZE) {
	struct vector *symbol_name
	    = (struct vector *) PTR(data_vector->data[i]);
	long type = fixnum_value(data_vector->data[i + 1]);
	lispobj lib_list = data_vector->data[i + 2];
        char c_symbol_name[1000];

        convert_lisp_string(c_symbol_name, symbol_name->data, (symbol_name->length >> 2));

	if (type == LINKAGE_DATA_TYPE && lib_list != NIL) {
	    void *target_addr = os_dlsym(c_symbol_name, lib_list);

	    if (!target_addr) {
		lose("%s is not defined.\n", c_symbol_name);
	    }
	    arch_make_linkage_entry(i / LINKAGE_DATA_ENTRY_SIZE, target_addr,
				    type);
	}
    }
#endif /* LINKAGE_TABLE */
}

/* Make entry for the symbol at entry in LINKAGE_TABLE_DATA.  Called
   from register-foreign-linkage. */
#ifdef LINKAGE_TABLE
extern void undefined_foreign_symbol_trap(lispobj arg);
#endif

unsigned long
os_link_one_symbol(long entry)
{
#ifdef LINKAGE_TABLE
    lispobj linkage_data_obj = SymbolValue(LINKAGE_TABLE_DATA);
    struct array *linkage_data = 0;
    long table_size = 0;
    struct vector *data_vector = 0;
    struct vector *symbol_name;
    long type;
    void *target_addr;
    long table_index = entry * LINKAGE_DATA_ENTRY_SIZE;
    char c_symbol_name[1000];

    linkage_data = (struct array *) PTR(linkage_data_obj);
    table_size = fixnum_value(linkage_data->fill_pointer);
    if (table_index >= table_size - 1) {
	return 0;
    }
    data_vector = (struct vector *) PTR(linkage_data->data);
    symbol_name = (struct vector *) PTR(data_vector->data[table_index]);
    type = fixnum_value(data_vector->data[table_index + 1]);

    convert_lisp_string(c_symbol_name, symbol_name->data, (symbol_name->length >> 2));
    
    target_addr = os_dlsym(c_symbol_name,
			   data_vector->data[table_index + 2]);
#if 0
    fprintf(stderr, "Looked up %s symbol %s at %lx\n",
	    type == LINKAGE_CODE_TYPE ? "code" : "data",
	    c_symbol_name, (unsigned long) target_addr);
#endif
    if (!target_addr) {
	undefined_foreign_symbol_trap((lispobj) data_vector->data[table_index]);
    }
    arch_make_linkage_entry(entry, target_addr, type);
    return (unsigned long) target_addr;
#else
    return 0;
#endif /* LINKAGE_TABLE */
}

unsigned long
lazy_resolve_linkage(unsigned long retaddr)
{
#ifdef LINKAGE_TABLE
    unsigned long target_addr = os_link_one_symbol(arch_linkage_entry(retaddr));

    return target_addr;
#else
    return 0;
#endif /* LINKAGE_TABLE */
}



#ifdef RED_ZONE_HIT

/* The end of the control stack contains two guard zones:

   +----------+ stack start (stack growing down)
   |          |
       ...
   |          |
   +----------+
   |          | yellow zone
   +----------+
   |          | red zone
   +----------+				CONTROL_STACK_START

   Both the yellow zone and the red zone are write-protected.

   When entering the yellow zone, we unprotect the yellow zone and
   make Lisp signal a control stack exhausted error, with stack
   contents left intact for the debugger, which is entered.

   When hitting the red zone we arrange for calling a function that
   throws back to the top-level.  */

#ifndef YELLOW_ZONE_SIZE
#define YELLOW_ZONE_SIZE 0x8000	/* 32K */
#endif

#ifndef RED_ZONE_SIZE
#define RED_ZONE_SIZE YELLOW_ZONE_SIZE
#endif

/* Return the start addresses of the yellow and red zones in
   *YELLOW_START and *RED_START.  */

static void
guard_zones(char **yellow_start, char **red_start)
{
#if (defined(i386) || defined(__x86_64))
    /*
     * All x86's have a control stack (aka C stack) that grows down.
     */
    char *end = (char *) control_stack;

    *red_start = end;
    *yellow_start = *red_start + RED_ZONE_SIZE;
#else
    /*
     * On Solaris/sparc, the C stack grows down, but the Lisp control
     * stack grows up.  The stack zones begin just before the end of the
     * control stack area.
     */

    char *end = (char *) control_stack + control_stack_size;

    *red_start = end - RED_ZONE_SIZE;
    *yellow_start = *red_start - YELLOW_ZONE_SIZE;
#endif
}

/* Return the guard zone FAULT_ADDR is in or 0 if not in a guard
   zone.  */

static int
control_stack_zone(void *fault_addr)
{
    char *yellow_start, *red_start;
    char *p = (char *) fault_addr;

    guard_zones(&yellow_start, &red_start);

    if (p >= yellow_start && p < yellow_start + YELLOW_ZONE_SIZE)
	return YELLOW_ZONE;
    else if (p >= red_start && p < red_start + RED_ZONE_SIZE)
	return RED_ZONE;
    else
	return 0;
}

/* Protect/unprotect the guard zone ZONE of the control stack.  */

void
os_guard_control_stack(int zone, int guard)
{
    char *yellow_start, *red_start;
    int flags;

    guard_zones(&yellow_start, &red_start);

    if (guard)
	flags = OS_VM_PROT_READ | OS_VM_PROT_EXECUTE;
    else
	flags = OS_VM_PROT_ALL;

    if (zone == YELLOW_ZONE)
	os_protect((os_vm_address_t) yellow_start, YELLOW_ZONE_SIZE, flags);
    else if (zone == RED_ZONE)
	os_protect((os_vm_address_t) red_start, RED_ZONE_SIZE, flags);
    else {
	char *start = red_start < yellow_start ? red_start : yellow_start;

	os_protect((os_vm_address_t) start, RED_ZONE_SIZE + YELLOW_ZONE_SIZE,
		   flags);
    }
}

/* Handle a possible guard zone hit at FAULT_ADDR.  Value is
   non-zero if FAULT_ADDR is in a guard zone.  */

int
os_control_stack_overflow(void *fault_addr, os_context_t * context)
{
    enum stack_zone_t zone;

    zone = control_stack_zone(fault_addr);

    if (zone == YELLOW_ZONE || zone == RED_ZONE) {
	lispobj error;

#if 0
	fprintf(stderr, "hit end of control stack in zone %s\n",
		(zone == YELLOW_ZONE) ? "YELLOW" : (zone ==
						    RED_ZONE) ? "RED" : "BOTH");
#endif
	/* Unprotect the stack, giving us some room on the stack for
	   error handling in Lisp.  Fake a stack frame for this
	   interruption.  */
	os_guard_control_stack(zone, 0);

	build_fake_control_stack_frame(context);

	/* The protection violation signal is delivered on a signal
	   stack different from the normal stack, so that we don't
	   trample on the guard pages of the normal stack while handling
	   the signal.  To get a Lisp function called when the signal
	   handler returns, we change the return address of the signal
	   context to the address of the function we want to be
	   called.  */
	if (zone == RED_ZONE)
	    error = SymbolFunction(RED_ZONE_HIT);
	else
	    error = SymbolFunction(YELLOW_ZONE_HIT);

#if defined(i386) || defined(__x86_64)
	SC_PC(context) = (int) ((struct function *) PTR(error))->code;
	SC_REG(context, reg_NARGS) = 0;
#elif defined(sparc)
	/* This part should be common to all non-x86 ports */
	SC_PC(context) = (long) ((struct function *) PTR(error))->code;
	SC_NPC(context) = SC_PC(context) + 4;
	SC_REG(context, reg_NARGS) = 0;
	SC_REG(context, reg_LIP) =
	    (long) ((struct function *) PTR(error))->code;
	SC_REG(context, reg_CFP) = (long) current_control_frame_pointer;
	/* This is sparc specific */
	SC_REG(context, reg_CODE) = ((long) PTR(error)) + type_FunctionPointer;
#else
#error os_control_stack_overflow not implemented for this system
#endif
	return 1;
    }

    return 0;
}

#else /* not RED_ZONE_HIT */

/* Dummy for bootstrapping.  */

void
os_guard_control_stack(int zone, int guard)
{
}

#endif /* not RED_ZONE_HIT */


/* Simple interface to __ieee754_rem_pio2 */
int
ieee754_rem_pio2(double x, double *y0, double *y1)
{
    extern int __ieee754_rem_pio2(double x, double *y);

    double y[2];
    int n;

    n = __ieee754_rem_pio2(x, y);
    *y0 = y[0];
    *y1 = y[1];

    return n;
}

/*
 * sleep for the given number of seconds, even if we're interrupted.
 */
void
os_sleep(double seconds)
{
    struct timespec requested;
    struct timespec remaining;
    double integral;
    double fractional;

    fractional = modf(seconds, &integral);
    requested.tv_sec = (time_t) integral;
    /*
     * Round up---better to sleep slightly too long than to sleep for
     * too short a time.
     */
    requested.tv_nsec = (long) ceil(fractional * 1e9);

    while (nanosleep(&requested, &remaining) == -1 && errno == EINTR) {
	requested = remaining;
    }
}

/*
 * Interface to stat/fstat/lstat.
 *
 * The arg types are chosen such that they can hold the largest
 * possible value that any OS would use for the particular slot in the
 * stat structure.  That way we can just use one OS-independent
 * function that works across all OSes.
 */
int
os_stat(const char* path, u_int64_t *dev, u_int64_t *ino, unsigned int *mode, u_int64_t *nlink,
        unsigned int *uid, unsigned int *gid, u_int64_t *rdev, int64_t *size,
        int64_t *atime, int64_t *mtime, int64_t *ctime,
        long *blksize, int64_t *blocks)
{
    int rc;
    struct stat buf;

    rc = stat(path, &buf);

    if (rc != 0) {
        return rc;
    }
        
#if 0
    /*
     * Useful prints to see the actual size of the various
     * fields. Helpful for porting this to other OSes that we haven't
     * tested on.
     */
    fprintf(stderr, "size dev %d\n", sizeof(buf.st_dev));
    fprintf(stderr, "size ino %d\n", sizeof(buf.st_ino));
    fprintf(stderr, "size mode %d\n", sizeof(buf.st_mode));
    fprintf(stderr, "size nlink %d\n", sizeof(buf.st_nlink));
    fprintf(stderr, "size uid %d\n", sizeof(buf.st_uid));
    fprintf(stderr, "size gid %d\n", sizeof(buf.st_gid));
    fprintf(stderr, "size rdev %d\n", sizeof(buf.st_rdev));
    fprintf(stderr, "size size %d\n", sizeof(buf.st_size));
    fprintf(stderr, "size atime %d\n", sizeof(buf.st_atime));
    fprintf(stderr, "size mtime %d\n", sizeof(buf.st_mtime));
    fprintf(stderr, "size ctime %d\n", sizeof(buf.st_ctime));
    fprintf(stderr, "size blksize %d\n", sizeof(buf.st_blksize));
    fprintf(stderr, "size blocks %d\n", sizeof(buf.st_blocks));
#endif    
    
    *dev = buf.st_dev;
    *ino = buf.st_ino;
    *mode = buf.st_mode;
    *nlink = buf.st_nlink;
    *uid = buf.st_uid;
    *gid = buf.st_gid;
    *rdev = buf.st_rdev;
    *size = buf.st_size;
    *atime = buf.st_atime;
    *mtime = buf.st_mtime;
    *ctime = buf.st_ctime;
    *blksize = buf.st_blksize;
    *blocks = buf.st_blocks;

    return rc;
}

int
os_fstat(int fd, u_int64_t *dev, u_int64_t *ino, unsigned int *mode, u_int64_t *nlink,
         unsigned int *uid, unsigned int *gid, u_int64_t *rdev, int64_t *size,
         int64_t *atime, int64_t *mtime, int64_t *ctime,
         long *blksize, int64_t *blocks)
{
    int rc;
    struct stat buf;

    rc = fstat(fd, &buf);

    if (rc != 0) {
        return rc;
    }

    *dev = buf.st_dev;
    *ino = buf.st_ino;
    *mode = buf.st_mode;
    *nlink = buf.st_nlink;
    *uid = buf.st_uid;
    *gid = buf.st_gid;
    *rdev = buf.st_rdev;
    *size = buf.st_size;
    *atime = buf.st_atime;
    *mtime = buf.st_mtime;
    *ctime = buf.st_ctime;
    *blksize = buf.st_blksize;
    *blocks = buf.st_blocks;

    return rc;
}

int
os_lstat(const char* path, u_int64_t *dev, u_int64_t *ino, unsigned int *mode, u_int64_t *nlink,
         unsigned int *uid, unsigned int *gid, u_int64_t *rdev, int64_t *size,
         int64_t *atime, int64_t *mtime, int64_t *ctime,
         long *blksize, int64_t *blocks)
{
    int rc;
    struct stat buf;

    rc = lstat(path, &buf);

    if (rc != 0) {
        return rc;
    }

    *dev = buf.st_dev;
    *ino = buf.st_ino;
    *mode = buf.st_mode;
    *nlink = buf.st_nlink;
    *uid = buf.st_uid;
    *gid = buf.st_gid;
    *rdev = buf.st_rdev;
    *size = buf.st_size;
    *atime = buf.st_atime;
    *mtime = buf.st_mtime;
    *ctime = buf.st_ctime;
    *blksize = buf.st_blksize;
    *blocks = buf.st_blocks;

    return rc;
}

/*
 * Interface for file-author.  Given a pathname, returns a new string
 * holding the author of the file or NULL if some error occurred.  The
 * caller is responsible for freeing the memory used by the string.
 */
char *
os_file_author(const char *path)
{
    struct stat sb;
    char initial[1024];
    char *buffer, *obuffer;
    size_t size;
    struct passwd pwd;
    struct passwd *ppwd;
    char *result;

    if (stat(path, &sb) != 0) {
        return NULL;
    }

    result = NULL;
    buffer = initial;
    obuffer = NULL;
    size = sizeof(initial) / sizeof(initial[0]);

    /*
     * Keep trying with larger buffers until a maximum is reached.  We
     * assume (1 << 20) is large enough for any OS.
     */
    while (size <= (1 << 20)) {
        switch (getpwuid_r(sb.st_uid, &pwd, buffer, size, &ppwd)) {
          case 0:
              /* Success, though we might not have a matching entry */
              result = (ppwd == NULL) ? NULL : strdup(pwd.pw_name);
              goto exit;
          case ERANGE:
              /* Buffer is too small, double its size and try again */
              size *= 2;
              obuffer = (buffer == initial) ? NULL : buffer;
              if ((buffer = realloc(obuffer, size)) == NULL) {
                  goto exit;
              }
              continue;
          default:
              /* All other errors */
              goto exit;
        }
    }
exit:
    free(obuffer);
    
    return result;
}

int
os_setlocale(void)
{
    char *result = setlocale(LC_ALL, "");

    /* Return 0 if setlocale suceeded; otherwise -1. */
    return result != NULL ? 0 : -1;
}

int
os_get_lc_messages(char *buf, int len)
{
    char *locale = setlocale(LC_MESSAGES, NULL);
    if (locale) {
        strncpy(buf, locale, len - 1);
        buf[len - 1] = '\0';
    }

    /* Return -1 if setlocale failed. */
    return locale ? 0 : -1;
}

char *
os_get_locale_codeset(void)
{
    return nl_langinfo(CODESET);
}

long
os_get_page_size(void)
{
    errno = 0;
  
    return sysconf(_SC_PAGESIZE);
}

/*
 * Get system info consisting of the utime (in usec), the stime (in
 * usec) and the number of major page faults.  The return value is the
 * return code from getrusage.
 */
int
os_get_system_info(int64_t* utime, int64_t* stime, long* major_fault)
{
    struct rusage usage;
    int rc;

    *utime = 0;
    *stime = 0;
    *major_fault = 0;
    
    rc = getrusage(RUSAGE_SELF, &usage);
    if (rc == 0) {
        *utime = usage.ru_utime.tv_sec * 1000000 + usage.ru_utime.tv_usec;
        *stime = usage.ru_stime.tv_sec * 1000000 + usage.ru_stime.tv_usec;
        *major_fault = usage.ru_majflt;
    }

    return rc;
}

/*
 * Get the software version.  This is the same as "uname -r", the release.
 * A pointer to a static string is returned. If uname fails, an empty
 * string is returned.
 */
char*
os_software_version(void)
{
    struct utsname uts;
    int status;

    /*
     * Buffer large enough to hold the release.
     */
    static char result[sizeof(uts.release)];
    result[0] = '\0';

    status = uname(&uts);
    if (status == 0) {
      strcpy(result, uts.release);
    }
    
    return result;
}
