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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
|
/**********************************************************
* Copyright 2008-2009 VMware, Inc. 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, sublicense, 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 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
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* 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.
*
**********************************************************/
#ifndef SVGA_TEXTURE_H
#define SVGA_TEXTURE_H
#include "pipe/p_compiler.h"
#include "pipe/p_state.h"
#include "util/u_inlines.h"
#include "util/u_memory.h"
#include "util/u_transfer.h"
#include "svga_screen_cache.h"
struct pipe_context;
struct pipe_screen;
struct svga_context;
struct svga_winsys_surface;
enum SVGA3dSurfaceFormat;
#define SVGA_MAX_TEXTURE_LEVELS 16
extern struct u_resource_vtbl svga_texture_vtbl;
struct svga_texture
{
struct u_resource b;
ushort *defined;
struct svga_sampler_view *cached_view;
unsigned view_age[SVGA_MAX_TEXTURE_LEVELS];
unsigned age;
boolean views_modified;
/**
* Creation key for the host surface handle.
*
* This structure describes all the host surface characteristics so that it
* can be looked up in cache, since creating a host surface is often a slow
* operation.
*/
struct svga_host_surface_cache_key key;
/**
* Handle for the host side surface.
*
* This handle is owned by this texture. Views should hold on to a reference
* to this texture and never destroy this handle directly.
*/
struct svga_winsys_surface *handle;
/**
* Whether the host side surface is imported and not created by this
* driver.
*/
boolean imported;
unsigned size; /**< Approximate size in bytes */
/** array indexed by cube face or 3D/array slice, one bit per mipmap level */
ushort *rendered_to;
/** array indexed by cube face or 3D/array slice, one bit per mipmap level.
* Set if the level is marked as dirty.
*/
ushort *dirty;
};
/* Note this is only used for texture (not buffer) transfers:
*/
struct svga_transfer
{
struct pipe_transfer base;
unsigned slice; /**< array slice or cube face */
struct svga_winsys_buffer *hwbuf;
/* Height of the hardware buffer in pixel blocks */
unsigned hw_nblocksy;
/* Temporary malloc buffer when we can't allocate a hardware buffer
* big enough */
void *swbuf;
/* True if guest backed surface is supported and we can directly map
* to the surface for this transfer.
*/
boolean use_direct_map;
struct {
struct pipe_resource *buf; /* points to the upload buffer if this
* transfer is done via the upload buffer
* instead of directly mapping to the
* resource's surface.
*/
void *map;
unsigned offset;
SVGA3dBox box;
unsigned nlayers;
} upload;
};
static inline struct svga_texture *
svga_texture(struct pipe_resource *resource)
{
struct svga_texture *tex = (struct svga_texture *)resource;
assert(tex == NULL || tex->b.vtbl == &svga_texture_vtbl);
return tex;
}
static inline struct svga_transfer *
svga_transfer(struct pipe_transfer *transfer)
{
assert(transfer);
return (struct svga_transfer *)transfer;
}
/**
* Increment the age of a view into a texture
* This is used to track updates to textures when we draw into
* them via a surface.
*/
static inline void
svga_age_texture_view(struct svga_texture *tex, unsigned level)
{
assert(level < ARRAY_SIZE(tex->view_age));
tex->view_age[level] = ++(tex->age);
}
/** For debugging, check that face and level are legal */
static inline void
check_face_level(const struct svga_texture *tex,
unsigned face, unsigned level)
{
if (tex->b.b.target == PIPE_TEXTURE_CUBE) {
assert(face < 6);
}
else if (tex->b.b.target == PIPE_TEXTURE_3D) {
assert(face < tex->b.b.depth0);
}
else {
assert(face < tex->b.b.array_size);
}
assert(level < 8 * sizeof(tex->rendered_to[0]));
}
/**
* Mark the given texture face/level as being defined.
*/
static inline void
svga_define_texture_level(struct svga_texture *tex,
unsigned face,unsigned level)
{
check_face_level(tex, face, level);
tex->defined[face] |= 1 << level;
}
static inline bool
svga_is_texture_level_defined(const struct svga_texture *tex,
unsigned face, unsigned level)
{
check_face_level(tex, face, level);
return (tex->defined[face] & (1 << level)) != 0;
}
static inline void
svga_set_texture_rendered_to(struct svga_texture *tex,
unsigned face, unsigned level)
{
check_face_level(tex, face, level);
tex->rendered_to[face] |= 1 << level;
}
static inline void
svga_clear_texture_rendered_to(struct svga_texture *tex,
unsigned face, unsigned level)
{
check_face_level(tex, face, level);
tex->rendered_to[face] &= ~(1 << level);
}
static inline boolean
svga_was_texture_rendered_to(const struct svga_texture *tex,
unsigned face, unsigned level)
{
check_face_level(tex, face, level);
return !!(tex->rendered_to[face] & (1 << level));
}
static inline void
svga_set_texture_dirty(struct svga_texture *tex,
unsigned face, unsigned level)
{
check_face_level(tex, face, level);
tex->dirty[face] |= 1 << level;
}
static inline void
svga_clear_texture_dirty(struct svga_texture *tex)
{
unsigned i;
for (i = 0; i < tex->b.b.depth0 * tex->b.b.array_size; i++) {
tex->dirty[i] = 0;
}
}
static inline boolean
svga_is_texture_dirty(const struct svga_texture *tex,
unsigned face, unsigned level)
{
check_face_level(tex, face, level);
return !!(tex->dirty[face] & (1 << level));
}
struct pipe_resource *
svga_texture_create(struct pipe_screen *screen,
const struct pipe_resource *template);
struct pipe_resource *
svga_texture_from_handle(struct pipe_screen * screen,
const struct pipe_resource *template,
struct winsys_handle *whandle);
boolean
svga_texture_generate_mipmap(struct pipe_context *pipe,
struct pipe_resource *pt,
enum pipe_format format,
unsigned base_level,
unsigned last_level,
unsigned first_layer,
unsigned last_layer);
boolean
svga_texture_transfer_map_upload_create(struct svga_context *svga);
void
svga_texture_transfer_map_upload_destroy(struct svga_context *svga);
boolean
svga_texture_transfer_map_can_upload(struct svga_context *svga,
struct svga_transfer *st);
void *
svga_texture_transfer_map_upload(struct svga_context *svga,
struct svga_transfer *st);
void
svga_texture_transfer_unmap_upload(struct svga_context *svga,
struct svga_transfer *st);
#endif /* SVGA_TEXTURE_H */
|