1ca987d46SWarner Losh /*-
2ca987d46SWarner Losh * Copyright (c) 1998 Michael Smith <msmith@freebsd.org>
3ca987d46SWarner Losh * All rights reserved.
4ca987d46SWarner Losh *
5ca987d46SWarner Losh * Redistribution and use in source and binary forms, with or without
6ca987d46SWarner Losh * modification, are permitted provided that the following conditions
7ca987d46SWarner Losh * are met:
8ca987d46SWarner Losh * 1. Redistributions of source code must retain the above copyright
9ca987d46SWarner Losh * notice, this list of conditions and the following disclaimer.
10ca987d46SWarner Losh * 2. Redistributions in binary form must reproduce the above copyright
11ca987d46SWarner Losh * notice, this list of conditions and the following disclaimer in the
12ca987d46SWarner Losh * documentation and/or other materials provided with the distribution.
13ca987d46SWarner Losh *
14ca987d46SWarner Losh * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15ca987d46SWarner Losh * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16ca987d46SWarner Losh * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17ca987d46SWarner Losh * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18ca987d46SWarner Losh * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19ca987d46SWarner Losh * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20ca987d46SWarner Losh * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21ca987d46SWarner Losh * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22ca987d46SWarner Losh * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23ca987d46SWarner Losh * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24ca987d46SWarner Losh * SUCH DAMAGE.
25ca987d46SWarner Losh */
26ca987d46SWarner Losh
27ca987d46SWarner Losh /*
28ca987d46SWarner Losh * MD primitives supporting placement of module data
29ca987d46SWarner Losh *
30ca987d46SWarner Losh * XXX should check load address/size against memory top.
31ca987d46SWarner Losh */
32ca987d46SWarner Losh #include <stand.h>
33ca987d46SWarner Losh
34ca987d46SWarner Losh #include "libi386.h"
35ca987d46SWarner Losh #include "btxv86.h"
36ca987d46SWarner Losh
37ca987d46SWarner Losh ssize_t
i386_copyin(const void * src,vm_offset_t dest,const size_t len)38ca987d46SWarner Losh i386_copyin(const void *src, vm_offset_t dest, const size_t len)
39ca987d46SWarner Losh {
40ca987d46SWarner Losh if (dest + len >= memtop) {
41ca987d46SWarner Losh errno = EFBIG;
42ca987d46SWarner Losh return (-1);
43ca987d46SWarner Losh }
44ca987d46SWarner Losh
45ca987d46SWarner Losh bcopy(src, PTOV(dest), len);
46ca987d46SWarner Losh return (len);
47ca987d46SWarner Losh }
48ca987d46SWarner Losh
49ca987d46SWarner Losh ssize_t
i386_copyout(const vm_offset_t src,void * dest,const size_t len)50ca987d46SWarner Losh i386_copyout(const vm_offset_t src, void *dest, const size_t len)
51ca987d46SWarner Losh {
52ca987d46SWarner Losh if (src + len >= memtop) {
53ca987d46SWarner Losh errno = EFBIG;
54ca987d46SWarner Losh return (-1);
55ca987d46SWarner Losh }
56ca987d46SWarner Losh
57ca987d46SWarner Losh bcopy(PTOV(src), dest, len);
58ca987d46SWarner Losh return (len);
59ca987d46SWarner Losh }
60ca987d46SWarner Losh
61ca987d46SWarner Losh
62ca987d46SWarner Losh ssize_t
i386_readin(readin_handle_t fd,vm_offset_t dest,const size_t len)63*afc571b1SSimon J. Gerraty i386_readin(readin_handle_t fd, vm_offset_t dest, const size_t len)
64ca987d46SWarner Losh {
65ca987d46SWarner Losh
66ca987d46SWarner Losh if (dest + len >= memtop_copyin) {
67ca987d46SWarner Losh errno = EFBIG;
68ca987d46SWarner Losh return (-1);
69ca987d46SWarner Losh }
70ca987d46SWarner Losh
71*afc571b1SSimon J. Gerraty return (VECTX_READ(fd, PTOV(dest), len));
72ca987d46SWarner Losh }
73