627249c7b1
for our use. Use the same search order for BIOS memory size functions as the kernel will later use. Allow the loader to use all of the detected physical memory (this will greatly help people trying to load enormous memory disk images). More correctly handle running out of memory when loading an object. Use the end of base memory for the top of the heap, rather than blindly hoping that there is 384k left. Add copyrights to a couple of files I forgot.
93 lines
2.4 KiB
C
93 lines
2.4 KiB
C
/*-
|
|
* Copyright (c) 1998 Michael Smith <msmith@freebsd.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
/*
|
|
* MD primitives supporting placement of module data
|
|
*
|
|
* XXX should check load address/size against memory top.
|
|
*/
|
|
#include <stand.h>
|
|
|
|
#include "libi386.h"
|
|
#include "btxv86.h"
|
|
|
|
#define READIN_BUF (16 * 1024)
|
|
|
|
int
|
|
i386_copyin(void *src, vm_offset_t dest, size_t len)
|
|
{
|
|
if (dest + len >= memtop) {
|
|
errno = EFBIG;
|
|
return(-1);
|
|
}
|
|
|
|
bcopy(src, PTOV(dest), len);
|
|
return(len);
|
|
}
|
|
|
|
int
|
|
i386_copyout(vm_offset_t src, void *dest, size_t len)
|
|
{
|
|
if (src + len >= memtop) {
|
|
errno = EFBIG;
|
|
return(-1);
|
|
}
|
|
|
|
bcopy(PTOV(src), dest, len);
|
|
return(len);
|
|
}
|
|
|
|
|
|
int
|
|
i386_readin(int fd, vm_offset_t dest, size_t len)
|
|
{
|
|
void *buf;
|
|
size_t resid, chunk, get;
|
|
ssize_t got;
|
|
|
|
if (dest + len >= memtop)
|
|
return(0);
|
|
|
|
chunk = min(READIN_BUF, len);
|
|
buf = malloc(chunk);
|
|
if (buf == NULL)
|
|
return(0);
|
|
|
|
for (resid = len; resid > 0; resid -= got, dest += got) {
|
|
get = min(chunk, resid);
|
|
got = read(fd, buf, get);
|
|
if (got <= 0)
|
|
break;
|
|
bcopy(buf, PTOV(dest), got);
|
|
}
|
|
free(buf);
|
|
return(len - resid);
|
|
}
|
|
|
|
|