sgmap_common.c revision 1.7
1 /* $NetBSD: sgmap_common.c,v 1.7 1998/01/21 22:34:39 thorpej Exp $ */ 2 3 /*- 4 * Copyright (c) 1997, 1998 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility, 9 * NASA Ames Research Center. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39 40 #include <sys/cdefs.h> /* RCS ID & Copyright macro defns */ 41 42 __KERNEL_RCSID(0, "$NetBSD: sgmap_common.c,v 1.7 1998/01/21 22:34:39 thorpej Exp $"); 43 44 #include <sys/param.h> 45 #include <sys/systm.h> 46 #include <sys/kernel.h> 47 #include <sys/malloc.h> 48 #include <sys/proc.h> 49 50 #include <vm/vm.h> 51 52 #include <machine/bus.h> 53 54 #include <alpha/common/sgmapvar.h> 55 56 /* 57 * Some systems will prefetch the next page during a memory -> device DMA. 58 * This can cause machine checks if there is not a spill page after the 59 * last page of the DMA (thus avoiding hitting an invalid SGMAP PTE). 60 */ 61 vm_offset_t alpha_sgmap_prefetch_spill_page_va; 62 bus_addr_t alpha_sgmap_prefetch_spill_page_pa; 63 64 void 65 alpha_sgmap_init(t, sgmap, name, wbase, sgvabase, sgvasize, ptesize, ptva, 66 minptalign) 67 bus_dma_tag_t t; 68 struct alpha_sgmap *sgmap; 69 const char *name; 70 bus_addr_t wbase; 71 bus_addr_t sgvabase; 72 bus_size_t sgvasize; 73 size_t ptesize; 74 void *ptva; 75 bus_size_t minptalign; 76 { 77 bus_dma_segment_t seg; 78 size_t ptsize; 79 int rseg; 80 81 if (sgvasize & PGOFSET) 82 panic("alpha_sgmap_init: size botch"); 83 84 sgmap->aps_wbase = wbase; 85 sgmap->aps_sgvabase = sgvabase; 86 sgmap->aps_sgvasize = sgvasize; 87 88 if (ptva != NULL) { 89 /* 90 * We already have a page table; this may be a system 91 * where the page table resides in bridge-resident SRAM. 92 */ 93 sgmap->aps_pt = ptva; 94 sgmap->aps_ptpa = 0; 95 } else { 96 /* 97 * Compute the page table size and allocate it. At minimum, 98 * this must be aligned to the page table size. However, 99 * some platforms have more strict alignment reqirements. 100 */ 101 ptsize = (sgvasize / NBPG) * ptesize; 102 if (minptalign != 0) { 103 if (minptalign < ptsize) 104 minptalign = ptsize; 105 } else 106 minptalign = ptsize; 107 if (bus_dmamem_alloc(t, ptsize, minptalign, 0, &seg, 1, &rseg, 108 BUS_DMA_NOWAIT)) 109 panic("alpha_sgmap_init: can't allocate page table"); 110 sgmap->aps_ptpa = seg.ds_addr; 111 sgmap->aps_pt = (caddr_t)ALPHA_PHYS_TO_K0SEG(sgmap->aps_ptpa); 112 } 113 114 /* 115 * Create the extent map used to manage the virtual address 116 * space. 117 */ 118 sgmap->aps_ex = extent_create(name, sgvabase, sgvasize - 1, 119 M_DEVBUF, NULL, 0, EX_NOWAIT|EX_NOCOALESCE); 120 if (sgmap->aps_ex == NULL) 121 panic("alpha_sgmap_init: can't create extent map"); 122 123 /* 124 * Allocate a spill page if that hasn't already been done. 125 */ 126 if (alpha_sgmap_prefetch_spill_page_va == 0) { 127 if (bus_dmamem_alloc(t, NBPG, 0, 0, &seg, 1, &rseg, 128 BUS_DMA_NOWAIT)) 129 panic("alpha_sgmap_init: can't allocate spill page"); 130 alpha_sgmap_prefetch_spill_page_pa = seg.ds_addr; 131 alpha_sgmap_prefetch_spill_page_va = 132 ALPHA_PHYS_TO_K0SEG(alpha_sgmap_prefetch_spill_page_pa); 133 bzero((caddr_t)alpha_sgmap_prefetch_spill_page_va, NBPG); 134 } 135 } 136 137 int 138 alpha_sgmap_alloc(map, len, sgmap, flags) 139 bus_dmamap_t map; 140 bus_size_t len; 141 struct alpha_sgmap *sgmap; 142 int flags; 143 { 144 int error; 145 146 #ifdef DIAGNOSTIC 147 if (map->_dm_flags & DMAMAP_HAS_SGMAP) 148 panic("alpha_sgmap_alloc: already have sgva space"); 149 #endif 150 151 map->_dm_sgvalen = round_page(len); 152 error = extent_alloc(sgmap->aps_ex, map->_dm_sgvalen, NBPG, 153 map->_dm_boundary, (flags & BUS_DMA_NOWAIT) ? EX_NOWAIT : 154 EX_WAITOK, &map->_dm_sgva); 155 156 if (error == 0) 157 map->_dm_flags |= DMAMAP_HAS_SGMAP; 158 else 159 map->_dm_flags &= ~DMAMAP_HAS_SGMAP; 160 161 return (error); 162 } 163 164 void 165 alpha_sgmap_free(map, sgmap) 166 bus_dmamap_t map; 167 struct alpha_sgmap *sgmap; 168 { 169 170 #ifdef DIAGNOSTIC 171 if ((map->_dm_flags & DMAMAP_HAS_SGMAP) == 0) 172 panic("alpha_sgmap_free: no sgva space to free"); 173 #endif 174 175 if (extent_free(sgmap->aps_ex, map->_dm_sgva, map->_dm_sgvalen, 176 EX_NOWAIT)) 177 panic("alpha_sgmap_free"); 178 179 map->_dm_flags &= ~DMAMAP_HAS_SGMAP; 180 } 181
Indexes created Mon Sep 22 21:09:42 GMT 2025