1 /**************************************************************************
2 *
3 * Copyright (c) 2006-2009 VMware, Inc., Palo Alto, CA., USA
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
16 * of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
21 * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
22 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
23 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
24 * USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 **************************************************************************/
27 /*
28 * Authors: Thomas Hellstrom <thellstrom-at-vmware-dot-com>
29 * Keith Packard.
30 */
31
32 #define pr_fmt(fmt) "[TTM] " fmt
33
34 #include <drm/ttm/ttm_module.h>
35 #include <drm/ttm/ttm_bo_driver.h>
36 #include <drm/ttm/ttm_page_alloc.h>
37 #include <drm/ttm/ttm_placement.h>
38 #include <linux/agp_backend.h>
39 #include <linux/module.h>
40 #include <linux/slab.h>
41 #include <linux/io.h>
42 #include <asm/agp.h>
43
44 struct ttm_agp_backend {
45 struct ttm_tt ttm;
46 struct agp_memory *mem;
47 struct agp_bridge_data *bridge;
48 };
49
ttm_agp_bind(struct ttm_tt * ttm,struct ttm_mem_reg * bo_mem)50 static int ttm_agp_bind(struct ttm_tt *ttm, struct ttm_mem_reg *bo_mem)
51 {
52 struct ttm_agp_backend *agp_be = container_of(ttm, struct ttm_agp_backend, ttm);
53 struct drm_mm_node *node = bo_mem->mm_node;
54 struct agp_memory *mem;
55 int ret, cached = (bo_mem->placement & TTM_PL_FLAG_CACHED);
56 unsigned i;
57
58 mem = agp_allocate_memory(agp_be->bridge, ttm->num_pages, AGP_USER_MEMORY);
59 if (unlikely(mem == NULL))
60 return -ENOMEM;
61
62 mem->page_count = 0;
63 for (i = 0; i < ttm->num_pages; i++) {
64 struct page *page = ttm->pages[i];
65
66 if (!page)
67 page = ttm->dummy_read_page;
68
69 mem->pages[mem->page_count++] = page;
70 }
71 agp_be->mem = mem;
72
73 mem->is_flushed = 1;
74 mem->type = (cached) ? AGP_USER_CACHED_MEMORY : AGP_USER_MEMORY;
75
76 ret = agp_bind_memory(mem, node->start);
77 if (ret)
78 pr_err("AGP Bind memory failed\n");
79
80 return ret;
81 }
82
ttm_agp_unbind(struct ttm_tt * ttm)83 static int ttm_agp_unbind(struct ttm_tt *ttm)
84 {
85 struct ttm_agp_backend *agp_be = container_of(ttm, struct ttm_agp_backend, ttm);
86
87 if (agp_be->mem) {
88 if (agp_be->mem->is_bound)
89 return agp_unbind_memory(agp_be->mem);
90 agp_free_memory(agp_be->mem);
91 agp_be->mem = NULL;
92 }
93 return 0;
94 }
95
ttm_agp_destroy(struct ttm_tt * ttm)96 static void ttm_agp_destroy(struct ttm_tt *ttm)
97 {
98 struct ttm_agp_backend *agp_be = container_of(ttm, struct ttm_agp_backend, ttm);
99
100 if (agp_be->mem)
101 ttm_agp_unbind(ttm);
102 ttm_tt_fini(ttm);
103 kfree(agp_be);
104 }
105
106 static struct ttm_backend_func ttm_agp_func = {
107 .bind = ttm_agp_bind,
108 .unbind = ttm_agp_unbind,
109 .destroy = ttm_agp_destroy,
110 };
111
ttm_agp_tt_create(struct ttm_bo_device * bdev,struct agp_bridge_data * bridge,unsigned long size,uint32_t page_flags,struct page * dummy_read_page)112 struct ttm_tt *ttm_agp_tt_create(struct ttm_bo_device *bdev,
113 struct agp_bridge_data *bridge,
114 unsigned long size, uint32_t page_flags,
115 struct page *dummy_read_page)
116 {
117 struct ttm_agp_backend *agp_be;
118
119 agp_be = kmalloc(sizeof(*agp_be), GFP_KERNEL);
120 if (!agp_be)
121 return NULL;
122
123 agp_be->mem = NULL;
124 agp_be->bridge = bridge;
125 agp_be->ttm.func = &ttm_agp_func;
126
127 if (ttm_tt_init(&agp_be->ttm, bdev, size, page_flags, dummy_read_page)) {
128 kfree(agp_be);
129 return NULL;
130 }
131
132 return &agp_be->ttm;
133 }
134 EXPORT_SYMBOL(ttm_agp_tt_create);
135
ttm_agp_tt_populate(struct ttm_tt * ttm)136 int ttm_agp_tt_populate(struct ttm_tt *ttm)
137 {
138 if (ttm->state != tt_unpopulated)
139 return 0;
140
141 return ttm_pool_populate(ttm);
142 }
143 EXPORT_SYMBOL(ttm_agp_tt_populate);
144
ttm_agp_tt_unpopulate(struct ttm_tt * ttm)145 void ttm_agp_tt_unpopulate(struct ttm_tt *ttm)
146 {
147 ttm_pool_unpopulate(ttm);
148 }
149 EXPORT_SYMBOL(ttm_agp_tt_unpopulate);
150