Merge git://git.kernel.org/pub/scm/linux/kernel/git/mason/btrfs-unstable
[linux-2.6-block.git] / drivers / gpu / drm / drm_memory.c
CommitLineData
b5e89ed5
DA
1/**
2 * \file drm_memory.c
1da177e4
LT
3 * Memory management wrappers for DRM
4 *
5 * \author Rickard E. (Rik) Faith <faith@valinux.com>
6 * \author Gareth Hughes <gareth@valinux.com>
7 */
8
b5e89ed5 9/*
1da177e4
LT
10 * Created: Thu Feb 4 14:00:34 1999 by faith@valinux.com
11 *
12 * Copyright 1999 Precision Insight, Inc., Cedar Park, Texas.
13 * Copyright 2000 VA Linux Systems, Inc., Sunnyvale, California.
14 * All Rights Reserved.
15 *
16 * Permission is hereby granted, free of charge, to any person obtaining a
17 * copy of this software and associated documentation files (the "Software"),
18 * to deal in the Software without restriction, including without limitation
19 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
20 * and/or sell copies of the Software, and to permit persons to whom the
21 * Software is furnished to do so, subject to the following conditions:
22 *
23 * The above copyright notice and this permission notice (including the next
24 * paragraph) shall be included in all copies or substantial portions of the
25 * Software.
26 *
27 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
28 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
29 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
30 * VA LINUX SYSTEMS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
31 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
32 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
33 * OTHER DEALINGS IN THE SOFTWARE.
34 */
35
1da177e4
LT
36#include <linux/highmem.h>
37#include "drmP.h"
38
1da177e4
LT
39/**
40 * Called when "/proc/dri/%dev%/mem" is read.
b5e89ed5 41 *
1da177e4
LT
42 * \param buf output buffer.
43 * \param start start of output data.
44 * \param offset requested start offset.
45 * \param len requested number of bytes.
46 * \param eof whether there is no more data to return.
47 * \param data private data.
48 * \return number of written bytes.
49 *
b5e89ed5 50 * No-op.
1da177e4
LT
51 */
52int drm_mem_info(char *buf, char **start, off_t offset,
b5e89ed5 53 int len, int *eof, void *data)
1da177e4
LT
54{
55 return 0;
56}
57
1da177e4 58#if __OS_HAS_AGP
031de96a 59static void *agp_remap(unsigned long offset, unsigned long size,
84b1fd10 60 struct drm_device * dev)
31f64bd1 61{
07613ba2 62 unsigned long i, num_pages =
31f64bd1
DA
63 PAGE_ALIGN(size) / PAGE_SIZE;
64 struct drm_agp_mem *agpmem;
65 struct page **page_map;
07613ba2 66 struct page **phys_page_map;
31f64bd1
DA
67 void *addr;
68
69 size = PAGE_ALIGN(size);
70
71#ifdef __alpha__
72 offset -= dev->hose->mem_space->start;
73#endif
74
bd1b331f 75 list_for_each_entry(agpmem, &dev->agp->memory, head)
31f64bd1
DA
76 if (agpmem->bound <= offset
77 && (agpmem->bound + (agpmem->pages << PAGE_SHIFT)) >=
78 (offset + size))
79 break;
80 if (!agpmem)
81 return NULL;
82
83 /*
84 * OK, we're mapping AGP space on a chipset/platform on which memory accesses by
85 * the CPU do not get remapped by the GART. We fix this by using the kernel's
86 * page-table instead (that's probably faster anyhow...).
87 */
88 /* note: use vmalloc() because num_pages could be large... */
89 page_map = vmalloc(num_pages * sizeof(struct page *));
90 if (!page_map)
91 return NULL;
92
07613ba2 93 phys_page_map = (agpmem->memory->pages + (offset - agpmem->bound) / PAGE_SIZE);
31f64bd1 94 for (i = 0; i < num_pages; ++i)
07613ba2 95 page_map[i] = phys_page_map[i];
31f64bd1
DA
96 addr = vmap(page_map, num_pages, VM_IOREMAP, PAGE_AGP);
97 vfree(page_map);
98
99 return addr;
100}
101
1da177e4 102/** Wrapper around agp_allocate_memory() */
84b1fd10 103DRM_AGP_MEM *drm_alloc_agp(struct drm_device * dev, int pages, u32 type)
1da177e4 104{
b5d499cf 105 return drm_agp_allocate_memory(dev->agp->bridge, pages, type);
1da177e4 106}
b5e89ed5 107
1da177e4 108/** Wrapper around agp_free_memory() */
b5e89ed5 109int drm_free_agp(DRM_AGP_MEM * handle, int pages)
1da177e4
LT
110{
111 return drm_agp_free_memory(handle) ? 0 : -EINVAL;
112}
673a394b 113EXPORT_SYMBOL(drm_free_agp);
b5e89ed5 114
1da177e4 115/** Wrapper around agp_bind_memory() */
b5e89ed5 116int drm_bind_agp(DRM_AGP_MEM * handle, unsigned int start)
1da177e4
LT
117{
118 return drm_agp_bind_memory(handle, start);
119}
b5e89ed5 120
1da177e4 121/** Wrapper around agp_unbind_memory() */
b5e89ed5 122int drm_unbind_agp(DRM_AGP_MEM * handle)
1da177e4
LT
123{
124 return drm_agp_unbind_memory(handle);
125}
673a394b 126EXPORT_SYMBOL(drm_unbind_agp);
031de96a
AB
127
128#else /* __OS_HAS_AGP */
031de96a 129static inline void *agp_remap(unsigned long offset, unsigned long size,
84b1fd10 130 struct drm_device * dev)
031de96a
AB
131{
132 return NULL;
133}
134
b5e89ed5 135#endif /* agp */
31f64bd1 136
f77d390c 137void drm_core_ioremap(struct drm_local_map *map, struct drm_device *dev)
31f64bd1 138{
004a7727
CH
139 if (drm_core_has_AGP(dev) &&
140 dev->agp && dev->agp->cant_use_aperture && map->type == _DRM_AGP)
141 map->handle = agp_remap(map->offset, map->size, dev);
142 else
143 map->handle = ioremap(map->offset, map->size);
31f64bd1 144}
004a7727 145EXPORT_SYMBOL(drm_core_ioremap);
31f64bd1 146
f77d390c 147void drm_core_ioremap_wc(struct drm_local_map *map, struct drm_device *dev)
242e3df8 148{
9b8d5a12
DA
149 if (drm_core_has_AGP(dev) &&
150 dev->agp && dev->agp->cant_use_aperture && map->type == _DRM_AGP)
151 map->handle = agp_remap(map->offset, map->size, dev);
152 else
153 map->handle = ioremap_wc(map->offset, map->size);
242e3df8
DA
154}
155EXPORT_SYMBOL(drm_core_ioremap_wc);
9b8d5a12 156
f77d390c 157void drm_core_ioremapfree(struct drm_local_map *map, struct drm_device *dev)
31f64bd1 158{
004a7727
CH
159 if (!map->handle || !map->size)
160 return;
161
162 if (drm_core_has_AGP(dev) &&
163 dev->agp && dev->agp->cant_use_aperture && map->type == _DRM_AGP)
164 vunmap(map->handle);
165 else
166 iounmap(map->handle);
31f64bd1 167}
004a7727 168EXPORT_SYMBOL(drm_core_ioremapfree);