2 * Permission is hereby granted, free of charge, to any person obtaining a
3 * copy of this software and associated documentation files (the "Software"),
4 * to deal in the Software without restriction, including without limitation
5 * on the rights to use, copy, modify, merge, publish, distribute, sub
6 * license, and/or sell copies of the Software, and to permit persons to whom
7 * the Software is furnished to do so, subject to the following conditions:
9 * The above copyright notice and this permission notice (including the next
10 * paragraph) shall be included in all copies or substantial portions of the
13 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
14 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
15 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
16 * THE AUTHOR(S) AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM,
17 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
18 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
19 * USE OR OTHER DEALINGS IN THE SOFTWARE.
22 * Adam Rak <adam.rak@streamnovation.com>
25 #include "pipe/p_defines.h"
26 #include "pipe/p_state.h"
27 #include "pipe/p_context.h"
28 #include "util/u_blitter.h"
29 #include "util/u_double_list.h"
30 #include "util/u_transfer.h"
31 #include "util/u_surface.h"
32 #include "util/u_pack_color.h"
33 #include "util/u_memory.h"
34 #include "util/u_inlines.h"
35 #include "util/u_framebuffer.h"
37 #include "r600_resource.h"
38 #include "r600_shader.h"
39 #include "r600_pipe.h"
40 #include "r600_formats.h"
41 #include "compute_memory_pool.h"
42 #include "evergreen_compute.h"
43 #include "evergreen_compute_internal.h"
49 struct compute_memory_pool
* compute_memory_pool_new(
50 struct r600_screen
* rscreen
)
52 struct compute_memory_pool
* pool
= (struct compute_memory_pool
*)
53 CALLOC(sizeof(struct compute_memory_pool
), 1);
55 COMPUTE_DBG("* compute_memory_pool_new()\n");
57 pool
->screen
= rscreen
;
61 static void compute_memory_pool_init(struct compute_memory_pool
* pool
,
62 unsigned initial_size_in_dw
)
65 COMPUTE_DBG("* compute_memory_pool_init() initial_size_in_dw = %ld\n",
68 pool
->shadow
= (uint32_t*)CALLOC(initial_size_in_dw
, 4);
70 pool
->size_in_dw
= initial_size_in_dw
;
71 pool
->bo
= (struct r600_resource
*)r600_compute_buffer_alloc_vram(pool
->screen
,
72 pool
->size_in_dw
* 4);
76 * Frees all stuff in the pool and the pool struct itself too
78 void compute_memory_pool_delete(struct compute_memory_pool
* pool
)
80 COMPUTE_DBG("* compute_memory_pool_delete()\n");
83 pool
->screen
->screen
.resource_destroy((struct pipe_screen
*)
84 pool
->screen
, (struct pipe_resource
*)pool
->bo
);
90 * Searches for an empty space in the pool, return with the pointer to the
91 * allocatable space in the pool, returns -1 on failure.
93 int64_t compute_memory_prealloc_chunk(
94 struct compute_memory_pool
* pool
,
97 struct compute_memory_item
*item
;
101 assert(size_in_dw
<= pool
->size_in_dw
);
103 COMPUTE_DBG("* compute_memory_prealloc_chunk() size_in_dw = %ld\n",
106 for (item
= pool
->item_list
; item
; item
= item
->next
) {
107 if (item
->start_in_dw
> -1) {
108 if (item
->start_in_dw
-last_end
> size_in_dw
) {
112 last_end
= item
->start_in_dw
+ item
->size_in_dw
;
113 last_end
+= (1024 - last_end
% 1024);
117 if (pool
->size_in_dw
- last_end
< size_in_dw
) {
125 * Search for the chunk where we can link our new chunk after it.
127 struct compute_memory_item
* compute_memory_postalloc_chunk(
128 struct compute_memory_pool
* pool
,
131 struct compute_memory_item
* item
;
133 COMPUTE_DBG("* compute_memory_postalloc_chunck() start_in_dw = %ld\n",
136 /* Check if we can insert it in the front of the list */
137 if (pool
->item_list
&& pool
->item_list
->start_in_dw
> start_in_dw
) {
141 for (item
= pool
->item_list
; item
; item
= item
->next
) {
143 if (item
->start_in_dw
< start_in_dw
144 && item
->next
->start_in_dw
> start_in_dw
) {
150 assert(item
->start_in_dw
< start_in_dw
);
155 assert(0 && "unreachable");
160 * Reallocates pool, conserves data
162 void compute_memory_grow_pool(struct compute_memory_pool
* pool
,
163 struct pipe_context
* pipe
, int new_size_in_dw
)
165 COMPUTE_DBG("* compute_memory_grow_pool() new_size_in_dw = %d\n",
168 assert(new_size_in_dw
>= pool
->size_in_dw
);
171 compute_memory_pool_init(pool
, MAX2(new_size_in_dw
, 1024 * 16));
173 new_size_in_dw
+= 1024 - (new_size_in_dw
% 1024);
175 COMPUTE_DBG(" Aligned size = %d\n", new_size_in_dw
);
177 compute_memory_shadow(pool
, pipe
, 1);
178 pool
->shadow
= realloc(pool
->shadow
, new_size_in_dw
*4);
179 pool
->size_in_dw
= new_size_in_dw
;
180 pool
->screen
->screen
.resource_destroy(
181 (struct pipe_screen
*)pool
->screen
,
182 (struct pipe_resource
*)pool
->bo
);
183 pool
->bo
= (struct r600_resource
*)r600_compute_buffer_alloc_vram(
185 pool
->size_in_dw
* 4);
186 compute_memory_shadow(pool
, pipe
, 0);
191 * Copy pool from device to host, or host to device.
193 void compute_memory_shadow(struct compute_memory_pool
* pool
,
194 struct pipe_context
* pipe
, int device_to_host
)
196 struct compute_memory_item chunk
;
198 COMPUTE_DBG("* compute_memory_shadow() device_to_host = %d\n",
202 chunk
.start_in_dw
= 0;
203 chunk
.size_in_dw
= pool
->size_in_dw
;
204 chunk
.prev
= chunk
.next
= NULL
;
205 compute_memory_transfer(pool
, pipe
, device_to_host
, &chunk
,
206 pool
->shadow
, 0, pool
->size_in_dw
*4);
210 * Allocates pending allocations in the pool
212 void compute_memory_finalize_pending(struct compute_memory_pool
* pool
,
213 struct pipe_context
* pipe
)
215 struct compute_memory_item
*pending_list
= NULL
, *end_p
= NULL
;
216 struct compute_memory_item
*item
, *next
;
218 int64_t allocated
= 0;
219 int64_t unallocated
= 0;
221 int64_t start_in_dw
= 0;
223 COMPUTE_DBG("* compute_memory_finalize_pending()\n");
225 for (item
= pool
->item_list
; item
; item
= item
->next
) {
226 COMPUTE_DBG(" + list: offset = %i id = %i size = %i "
227 "(%i bytes)\n",item
->start_in_dw
, item
->id
,
228 item
->size_in_dw
, item
->size_in_dw
* 4);
231 /* Search through the list of memory items in the pool */
232 for (item
= pool
->item_list
; item
; item
= next
) {
235 /* Check if the item is pending. */
236 if (item
->start_in_dw
== -1) {
237 /* It is pending, so add it to the pending_list... */
245 /* ... and then remove it from the item list. */
247 item
->prev
->next
= next
;
250 pool
->item_list
= next
;
254 next
->prev
= item
->prev
;
257 /* This sequence makes the item be at the end of the list */
262 /* Update the amount of space we will need to allocate. */
263 unallocated
+= item
->size_in_dw
+1024;
266 /* The item is not pendng, so update the amount of space
267 * that has already been allocated. */
268 allocated
+= item
->size_in_dw
;
272 /* If we require more space than the size of the pool, then grow the
275 * XXX: I'm pretty sure this won't work. Imagine this scenario:
283 * Allocated size = 150
284 * Pending Item D Size = 200
286 * In this case, there are 300 units of free space in the pool, but
287 * they aren't contiguous, so it will be impossible to allocate Item D.
289 if (pool
->size_in_dw
< allocated
+unallocated
) {
290 compute_memory_grow_pool(pool
, pipe
, allocated
+unallocated
);
293 /* Loop through all the pending items, allocate space for them and
294 * add them back to the item_list. */
295 for (item
= pending_list
; item
; item
= next
) {
298 /* Search for free space in the pool for this item. */
299 while ((start_in_dw
=compute_memory_prealloc_chunk(pool
,
300 item
->size_in_dw
)) == -1) {
301 int64_t need
= item
->size_in_dw
+2048 -
302 (pool
->size_in_dw
- allocated
);
304 need
+= 1024 - (need
% 1024);
307 compute_memory_grow_pool(pool
,
309 pool
->size_in_dw
+ need
);
312 need
= pool
->size_in_dw
/ 10;
313 need
+= 1024 - (need
% 1024);
314 compute_memory_grow_pool(pool
,
316 pool
->size_in_dw
+ need
);
319 COMPUTE_DBG(" + Found space for Item %p id = %u "
320 "start_in_dw = %u (%u bytes) size_in_dw = %u (%u bytes)\n",
321 item
, item
->id
, start_in_dw
, start_in_dw
* 4,
322 item
->size_in_dw
, item
->size_in_dw
* 4);
324 item
->start_in_dw
= start_in_dw
;
328 if (pool
->item_list
) {
329 struct compute_memory_item
*pos
;
331 pos
= compute_memory_postalloc_chunk(pool
, start_in_dw
);
334 item
->next
= pos
->next
;
337 item
->next
->prev
= item
;
340 /* Add item to the front of the list */
341 item
->next
= pool
->item_list
->next
;
342 if (pool
->item_list
->next
) {
343 pool
->item_list
->next
->prev
= item
;
345 item
->prev
= pool
->item_list
->prev
;
346 if (pool
->item_list
->prev
) {
347 pool
->item_list
->prev
->next
= item
;
349 pool
->item_list
= item
;
353 pool
->item_list
= item
;
356 allocated
+= item
->size_in_dw
;
361 void compute_memory_free(struct compute_memory_pool
* pool
, int64_t id
)
363 struct compute_memory_item
*item
, *next
;
365 COMPUTE_DBG("* compute_memory_free() id + %ld \n", id
);
367 for (item
= pool
->item_list
; item
; item
= next
) {
370 if (item
->id
== id
) {
372 item
->prev
->next
= item
->next
;
375 pool
->item_list
= item
->next
;
379 item
->next
->prev
= item
->prev
;
388 fprintf(stderr
, "Internal error, invalid id %"PRIi64
" "
389 "for compute_memory_free\n", id
);
391 assert(0 && "error");
395 * Creates pending allocations
397 struct compute_memory_item
* compute_memory_alloc(
398 struct compute_memory_pool
* pool
,
401 struct compute_memory_item
*new_item
= NULL
, *last_item
= NULL
;
403 COMPUTE_DBG("* compute_memory_alloc() size_in_dw = %ld (%ld bytes)\n",
404 size_in_dw
, 4 * size_in_dw
);
406 new_item
= (struct compute_memory_item
*)
407 CALLOC(sizeof(struct compute_memory_item
), 1);
408 new_item
->size_in_dw
= size_in_dw
;
409 new_item
->start_in_dw
= -1; /* mark pending */
410 new_item
->id
= pool
->next_id
++;
411 new_item
->pool
= pool
;
413 if (pool
->item_list
) {
414 for (last_item
= pool
->item_list
; last_item
->next
;
415 last_item
= last_item
->next
);
417 last_item
->next
= new_item
;
418 new_item
->prev
= last_item
;
421 pool
->item_list
= new_item
;
424 COMPUTE_DBG(" + Adding item %p id = %u size = %u (%u bytes)\n",
425 new_item
, new_item
->id
, new_item
->size_in_dw
,
426 new_item
->size_in_dw
* 4);
431 * Transfer data host<->device, offset and size is in bytes
433 void compute_memory_transfer(
434 struct compute_memory_pool
* pool
,
435 struct pipe_context
* pipe
,
437 struct compute_memory_item
* chunk
,
442 int64_t aligned_size
= pool
->size_in_dw
;
443 struct pipe_resource
* gart
= (struct pipe_resource
*)pool
->bo
;
444 int64_t internal_offset
= chunk
->start_in_dw
*4 + offset_in_chunk
;
446 struct pipe_transfer
*xfer
;
451 COMPUTE_DBG("* compute_memory_transfer() device_to_host = %d, "
452 "offset_in_chunk = %d, size = %d\n", device_to_host
,
453 offset_in_chunk
, size
);
455 if (device_to_host
) {
456 map
= pipe
->transfer_map(pipe
, gart
, 0, PIPE_TRANSFER_READ
,
457 &(struct pipe_box
) { .width
= aligned_size
,
458 .height
= 1, .depth
= 1 }, &xfer
);
461 memcpy(data
, map
+ internal_offset
, size
);
462 pipe
->transfer_unmap(pipe
, xfer
);
464 map
= pipe
->transfer_map(pipe
, gart
, 0, PIPE_TRANSFER_WRITE
,
465 &(struct pipe_box
) { .width
= aligned_size
,
466 .height
= 1, .depth
= 1 }, &xfer
);
469 memcpy(map
+ internal_offset
, data
, size
);
470 pipe
->transfer_unmap(pipe
, xfer
);
475 * Transfer data between chunk<->data, it is for VRAM<->GART transfers
477 void compute_memory_transfer_direct(
478 struct compute_memory_pool
* pool
,
480 struct compute_memory_item
* chunk
,
481 struct r600_resource
* data
,