Commit | Line | Data |
---|---|---|
c078aa2f TH |
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 | ||
760285e7 DH |
28 | #include <drm/ttm/ttm_execbuf_util.h> |
29 | #include <drm/ttm/ttm_bo_driver.h> | |
30 | #include <drm/ttm/ttm_placement.h> | |
c078aa2f TH |
31 | #include <linux/wait.h> |
32 | #include <linux/sched.h> | |
33 | #include <linux/module.h> | |
34 | ||
1f0dc9a5 ML |
35 | static void ttm_eu_backoff_reservation_reverse(struct list_head *list, |
36 | struct ttm_validate_buffer *entry) | |
d6ea8886 | 37 | { |
1f0dc9a5 | 38 | list_for_each_entry_continue_reverse(entry, list, head) { |
d6ea8886 | 39 | struct ttm_buffer_object *bo = entry->bo; |
d6ea8886 | 40 | |
c7523083 | 41 | __ttm_bo_unreserve(bo); |
d6ea8886 DA |
42 | } |
43 | } | |
44 | ||
45 | static void ttm_eu_del_from_lru_locked(struct list_head *list) | |
46 | { | |
47 | struct ttm_validate_buffer *entry; | |
48 | ||
49 | list_for_each_entry(entry, list, head) { | |
50 | struct ttm_buffer_object *bo = entry->bo; | |
1f0dc9a5 | 51 | unsigned put_count = ttm_bo_del_from_lru(bo); |
d6ea8886 | 52 | |
1f0dc9a5 | 53 | ttm_bo_list_ref_sub(bo, put_count, true); |
d6ea8886 DA |
54 | } |
55 | } | |
56 | ||
ecff665f ML |
57 | void ttm_eu_backoff_reservation(struct ww_acquire_ctx *ticket, |
58 | struct list_head *list) | |
c078aa2f TH |
59 | { |
60 | struct ttm_validate_buffer *entry; | |
68c4fa31 | 61 | struct ttm_bo_global *glob; |
c078aa2f | 62 | |
68c4fa31 TH |
63 | if (list_empty(list)) |
64 | return; | |
c078aa2f | 65 | |
68c4fa31 TH |
66 | entry = list_first_entry(list, struct ttm_validate_buffer, head); |
67 | glob = entry->bo->glob; | |
1f0dc9a5 | 68 | |
68c4fa31 | 69 | spin_lock(&glob->lru_lock); |
1f0dc9a5 ML |
70 | list_for_each_entry(entry, list, head) { |
71 | struct ttm_buffer_object *bo = entry->bo; | |
72 | ||
73 | ttm_bo_add_to_lru(bo); | |
74 | __ttm_bo_unreserve(bo); | |
75 | } | |
76 | spin_unlock(&glob->lru_lock); | |
77 | ||
8d17fb44 TH |
78 | if (ticket) |
79 | ww_acquire_fini(ticket); | |
c078aa2f TH |
80 | } |
81 | EXPORT_SYMBOL(ttm_eu_backoff_reservation); | |
82 | ||
83 | /* | |
84 | * Reserve buffers for validation. | |
85 | * | |
86 | * If a buffer in the list is marked for CPU access, we back off and | |
87 | * wait for that buffer to become free for GPU access. | |
88 | * | |
89 | * If a buffer is reserved for another validation, the validator with | |
90 | * the highest validation sequence backs off and waits for that buffer | |
91 | * to become unreserved. This prevents deadlocks when validating multiple | |
92 | * buffers in different orders. | |
93 | */ | |
94 | ||
ecff665f | 95 | int ttm_eu_reserve_buffers(struct ww_acquire_ctx *ticket, |
58b4d720 | 96 | struct list_head *list, bool intr) |
c078aa2f | 97 | { |
d6ea8886 | 98 | struct ttm_bo_global *glob; |
c078aa2f TH |
99 | struct ttm_validate_buffer *entry; |
100 | int ret; | |
101 | ||
d6ea8886 DA |
102 | if (list_empty(list)) |
103 | return 0; | |
104 | ||
d6ea8886 DA |
105 | entry = list_first_entry(list, struct ttm_validate_buffer, head); |
106 | glob = entry->bo->glob; | |
107 | ||
8d17fb44 TH |
108 | if (ticket) |
109 | ww_acquire_init(ticket, &reservation_ww_class); | |
1f0dc9a5 | 110 | |
c078aa2f TH |
111 | list_for_each_entry(entry, list, head) { |
112 | struct ttm_buffer_object *bo = entry->bo; | |
113 | ||
58b4d720 | 114 | ret = __ttm_bo_reserve(bo, intr, (ticket == NULL), true, |
c7523083 | 115 | ticket); |
1f0dc9a5 ML |
116 | if (!ret && unlikely(atomic_read(&bo->cpu_writers) > 0)) { |
117 | __ttm_bo_unreserve(bo); | |
7a186308 | 118 | |
7a186308 | 119 | ret = -EBUSY; |
c078aa2f | 120 | } |
1f0dc9a5 ML |
121 | |
122 | if (!ret) | |
123 | continue; | |
124 | ||
125 | /* uh oh, we lost out, drop every reservation and try | |
126 | * to only reserve this buffer, then start over if | |
127 | * this succeeds. | |
128 | */ | |
129 | ttm_eu_backoff_reservation_reverse(list, entry); | |
130 | ||
131 | if (ret == -EDEADLK && intr) { | |
132 | ret = ww_mutex_lock_slow_interruptible(&bo->resv->lock, | |
133 | ticket); | |
134 | } else if (ret == -EDEADLK) { | |
135 | ww_mutex_lock_slow(&bo->resv->lock, ticket); | |
136 | ret = 0; | |
137 | } | |
138 | ||
139 | if (unlikely(ret != 0)) { | |
140 | if (ret == -EINTR) | |
141 | ret = -ERESTARTSYS; | |
142 | if (ticket) { | |
143 | ww_acquire_done(ticket); | |
144 | ww_acquire_fini(ticket); | |
145 | } | |
146 | return ret; | |
147 | } | |
148 | ||
149 | /* move this item to the front of the list, | |
150 | * forces correct iteration of the loop without keeping track | |
151 | */ | |
152 | list_del(&entry->head); | |
153 | list_add(&entry->head, list); | |
c078aa2f | 154 | } |
d6ea8886 | 155 | |
8d17fb44 TH |
156 | if (ticket) |
157 | ww_acquire_done(ticket); | |
5e338405 | 158 | spin_lock(&glob->lru_lock); |
d6ea8886 DA |
159 | ttm_eu_del_from_lru_locked(list); |
160 | spin_unlock(&glob->lru_lock); | |
c078aa2f TH |
161 | return 0; |
162 | } | |
163 | EXPORT_SYMBOL(ttm_eu_reserve_buffers); | |
164 | ||
ecff665f | 165 | void ttm_eu_fence_buffer_objects(struct ww_acquire_ctx *ticket, |
f2c24b83 | 166 | struct list_head *list, struct fence *fence) |
c078aa2f TH |
167 | { |
168 | struct ttm_validate_buffer *entry; | |
95762c2b TH |
169 | struct ttm_buffer_object *bo; |
170 | struct ttm_bo_global *glob; | |
171 | struct ttm_bo_device *bdev; | |
172 | struct ttm_bo_driver *driver; | |
c078aa2f | 173 | |
95762c2b TH |
174 | if (list_empty(list)) |
175 | return; | |
176 | ||
177 | bo = list_first_entry(list, struct ttm_validate_buffer, head)->bo; | |
178 | bdev = bo->bdev; | |
179 | driver = bdev->driver; | |
180 | glob = bo->glob; | |
c078aa2f | 181 | |
95762c2b TH |
182 | spin_lock(&glob->lru_lock); |
183 | ||
184 | list_for_each_entry(entry, list, head) { | |
185 | bo = entry->bo; | |
f2c24b83 | 186 | reservation_object_add_excl_fence(bo->resv, fence); |
34820324 | 187 | ttm_bo_add_to_lru(bo); |
c7523083 | 188 | __ttm_bo_unreserve(bo); |
95762c2b | 189 | } |
4154f051 | 190 | spin_unlock(&glob->lru_lock); |
8d17fb44 TH |
191 | if (ticket) |
192 | ww_acquire_fini(ticket); | |
c078aa2f TH |
193 | } |
194 | EXPORT_SYMBOL(ttm_eu_fence_buffer_objects); |