Subversion Repositories Kolibri OS

Rev

Blame | Last modification | View Log | RSS feed

  1. /*
  2.  * Copyright © 2014 Broadcom
  3.  *
  4.  * Permission is hereby granted, free of charge, to any person obtaining a
  5.  * copy of this software and associated documentation files (the "Software"),
  6.  * to deal in the Software without restriction, including without limitation
  7.  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8.  * and/or sell copies of the Software, and to permit persons to whom the
  9.  * Software is furnished to do so, subject to the following conditions:
  10.  *
  11.  * The above copyright notice and this permission notice (including the next
  12.  * paragraph) shall be included in all copies or substantial portions of the
  13.  * Software.
  14.  *
  15.  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16.  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17.  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
  18.  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19.  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  20.  * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  21.  * IN THE SOFTWARE.
  22.  */
  23.  
  24. #include "util/u_math.h"
  25. #include "util/ralloc.h"
  26. #include "vc4_context.h"
  27.  
  28. void
  29. vc4_init_cl(struct vc4_context *vc4, struct vc4_cl *cl)
  30. {
  31.         cl->base = ralloc_size(vc4, 1);
  32.         cl->next = cl->base;
  33.         cl->size = 0;
  34. }
  35.  
  36. void
  37. cl_ensure_space(struct vc4_cl *cl, uint32_t space)
  38. {
  39.         if ((cl->next - cl->base) + space <= cl->size)
  40.                 return;
  41.  
  42.         uint32_t size = MAX2(cl->size + space, cl->size * 2);
  43.         uint32_t offset = cl->next -cl->base;
  44.  
  45.         cl->base = reralloc(ralloc_parent(cl->base), cl->base, uint8_t, size);
  46.         cl->size = size;
  47.         cl->next = cl->base + offset;
  48. }
  49.  
  50. void
  51. vc4_reset_cl(struct vc4_cl *cl)
  52. {
  53.         assert(cl->reloc_count == 0);
  54.         cl->next = cl->base;
  55. }
  56.  
  57. uint32_t
  58. vc4_gem_hindex(struct vc4_context *vc4, struct vc4_bo *bo)
  59. {
  60.         uint32_t hindex;
  61.         uint32_t *current_handles = vc4->bo_handles.base;
  62.  
  63.         for (hindex = 0;
  64.              hindex < (vc4->bo_handles.next - vc4->bo_handles.base) / 4;
  65.              hindex++) {
  66.                 if (current_handles[hindex] == bo->handle)
  67.                         return hindex;
  68.         }
  69.  
  70.         cl_u32(&vc4->bo_handles, bo->handle);
  71.         cl_ptr(&vc4->bo_pointers, vc4_bo_reference(bo));
  72.  
  73.         return hindex;
  74. }
  75.