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