| 1 | /* $NetBSD: bus_private.h,v 1.9 2008/01/23 19:46:45 bouyer Exp $ */ |
| 2 | |
| 3 | /*- |
| 4 | * Copyright (c)2005 YAMAMOTO Takashi, |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions |
| 9 | * are met: |
| 10 | * 1. Redistributions of source code must retain the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above copyright |
| 13 | * notice, this list of conditions and the following disclaimer in the |
| 14 | * documentation and/or other materials provided with the distribution. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
| 17 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 20 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 21 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 22 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 23 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 24 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 25 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 26 | * SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | #include <uvm/uvm_extern.h> |
| 30 | #include "opt_xen.h" |
| 31 | |
| 32 | #define _BUS_PHYS_TO_BUS(pa) ((bus_addr_t)xpmap_ptom(pa)) |
| 33 | #define _BUS_BUS_TO_PHYS(ba) ((paddr_t)xpmap_mtop(ba)) |
| 34 | #define _BUS_VIRT_TO_BUS(pm, va) _bus_virt_to_bus((pm), (va)) |
| 35 | #define _BUS_BUS_TO_VM_PAGE(ba) (PHYS_TO_VM_PAGE(xpmap_mtop(ba))) |
| 36 | #define _BUS_PMAP_ENTER(pmap, va, ba, prot, flags) \ |
| 37 | pmap_enter(pmap, va, xpmap_mtop(ba), prot, flags) |
| 38 | |
| 39 | static __inline bus_addr_t _bus_virt_to_bus(struct pmap *, vaddr_t); |
| 40 | |
| 41 | static __inline bus_addr_t |
| 42 | _bus_virt_to_bus(struct pmap *pm, vaddr_t va) |
| 43 | { |
| 44 | bus_addr_t ba; |
| 45 | |
| 46 | if (!pmap_extract_ma(pm, va, &ba)) { |
| 47 | panic("_bus_virt_to_bus" ); |
| 48 | } |
| 49 | |
| 50 | return ba; |
| 51 | } |
| 52 | |
| 53 | /* we need our own bus_dmamem_alloc_range */ |
| 54 | #define _BUS_DMAMEM_ALLOC_RANGE _xen_bus_dmamem_alloc_range |
| 55 | int _xen_bus_dmamem_alloc_range(bus_dma_tag_t, bus_size_t, bus_size_t, |
| 56 | bus_size_t, bus_dma_segment_t *, int, int *, int, |
| 57 | bus_addr_t, bus_addr_t); |
| 58 | |
| 59 | /* |
| 60 | * The higher machine address of our allocated range isn't know and can change |
| 61 | * over time. Just assume it's the largest possible value. |
| 62 | */ |
| 63 | #if defined(_LP64) || defined(PAE) |
| 64 | #define _BUS_AVAIL_END ((bus_addr_t)0xffffffffffffffff) |
| 65 | #else |
| 66 | #define _BUS_AVAIL_END ((bus_addr_t)0xffffffff) |
| 67 | #endif |
| 68 | |
| 69 | #include <x86/bus_private.h> |
| 70 | |