1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/**************************************************************************
* Copyright (c) 2007 Tungsten Graphics, Inc., Cedar Park, TX., USA
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sub license, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial portions
* of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
* THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
* USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
/*
* An allocate-fence manager implementation intended for sets of base-registers
* or tiling-registers.
*/
#include "drmP.h"
/*
* Allocate a compatible register and put it on the unfenced list.
*/
int drm_regs_alloc(struct drm_reg_manager *manager,
const void *data,
uint32_t fence_class,
uint32_t fence_type,
int interruptible, int no_wait, struct drm_reg **reg)
{
struct drm_reg *entry, *next_entry;
int ret;
*reg = NULL;
/*
* Search the unfenced list.
*/
list_for_each_entry(entry, &manager->unfenced, head) {
if (manager->reg_reusable(entry, data)) {
entry->new_fence_type |= fence_type;
goto out;
}
}
/*
* Search the lru list.
*/
list_for_each_entry_safe(entry, next_entry, &manager->lru, head) {
struct drm_fence_object *fence = entry->fence;
if (fence->fence_class == fence_class &&
(entry->fence_type & fence_type) == entry->fence_type &&
manager->reg_reusable(entry, data)) {
list_del(&entry->head);
entry->new_fence_type = fence_type;
list_add_tail(&entry->head, &manager->unfenced);
goto out;
}
}
/*
* Search the free list.
*/
list_for_each_entry(entry, &manager->free, head) {
list_del(&entry->head);
entry->new_fence_type = fence_type;
list_add_tail(&entry->head, &manager->unfenced);
goto out;
}
if (no_wait)
return -EBUSY;
/*
* Go back to the lru list and try to expire fences.
*/
list_for_each_entry_safe(entry, next_entry, &manager->lru, head) {
BUG_ON(!entry->fence);
ret = drm_fence_object_wait(entry->fence, 0, !interruptible,
entry->fence_type);
if (ret)
return ret;
drm_fence_usage_deref_unlocked(&entry->fence);
list_del(&entry->head);
entry->new_fence_type = fence_type;
list_add_tail(&entry->head, &manager->unfenced);
goto out;
}
/*
* Oops. All registers are used up :(.
*/
return -EBUSY;
out:
*reg = entry;
return 0;
}
EXPORT_SYMBOL(drm_regs_alloc);
void drm_regs_fence(struct drm_reg_manager *manager,
struct drm_fence_object *fence)
{
struct drm_reg *entry;
struct drm_reg *next_entry;
if (!fence) {
/*
* Old fence (if any) is still valid.
* Put back on free and lru lists.
*/
list_for_each_entry_safe_reverse(entry, next_entry,
&manager->unfenced, head) {
list_del(&entry->head);
list_add(&entry->head, (entry->fence) ?
&manager->lru : &manager->free);
}
} else {
/*
* Fence with a new fence and put on lru list.
*/
list_for_each_entry_safe(entry, next_entry, &manager->unfenced,
head) {
list_del(&entry->head);
if (entry->fence)
drm_fence_usage_deref_unlocked(&entry->fence);
drm_fence_reference_unlocked(&entry->fence, fence);
entry->fence_type = entry->new_fence_type;
BUG_ON((entry->fence_type & fence->type) !=
entry->fence_type);
list_add_tail(&entry->head, &manager->lru);
}
}
}
EXPORT_SYMBOL(drm_regs_fence);
void drm_regs_free(struct drm_reg_manager *manager)
{
struct drm_reg *entry;
struct drm_reg *next_entry;
drm_regs_fence(manager, NULL);
list_for_each_entry_safe(entry, next_entry, &manager->free, head) {
list_del(&entry->head);
manager->reg_destroy(entry);
}
list_for_each_entry_safe(entry, next_entry, &manager->lru, head) {
(void)drm_fence_object_wait(entry->fence, 1, 1,
entry->fence_type);
list_del(&entry->head);
drm_fence_usage_deref_unlocked(&entry->fence);
manager->reg_destroy(entry);
}
}
EXPORT_SYMBOL(drm_regs_free);
void drm_regs_add(struct drm_reg_manager *manager, struct drm_reg *reg)
{
reg->fence = NULL;
list_add_tail(®->head, &manager->free);
}
EXPORT_SYMBOL(drm_regs_add);
void drm_regs_init(struct drm_reg_manager *manager,
int (*reg_reusable) (const struct drm_reg *, const void *),
void (*reg_destroy) (struct drm_reg *))
{
INIT_LIST_HEAD(&manager->free);
INIT_LIST_HEAD(&manager->lru);
INIT_LIST_HEAD(&manager->unfenced);
manager->reg_reusable = reg_reusable;
manager->reg_destroy = reg_destroy;
}
EXPORT_SYMBOL(drm_regs_init);
|
