src/gallium/auxiliary/vl/vl_vertex_buffers.c

   1 /**************************************************************************
   2  *
   3  * Copyright 2010 Christian König
   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
  19  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  20  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
  21  * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
  22  * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  23  * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
  24  * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  25  *
  26  **************************************************************************/
  27
  28 #include <assert.h>
  29 #include <pipe/p_context.h>
  30 #include <pipe/p_screen.h>
  31 #include <util/u_memory.h>
  32 #include <util/u_inlines.h>
  33 #include <util/u_format.h>
  34 #include "vl_vertex_buffers.h"
  35 #include "vl_types.h"
  36
  37 /* vertices for a quad covering a block */
  38 static const struct quadf const_quad = {
  39    {0.0f, 1.0f}, {0.0f, 0.0f}, {1.0f, 0.0f}, {1.0f, 1.0f}
  40 };
  41
  42 struct pipe_vertex_buffer
  43 vl_vb_upload_quads(struct pipe_context *pipe, unsigned max_blocks)
  44 {
  45    struct pipe_vertex_buffer quad;
  46    struct pipe_transfer *buf_transfer;
  47    struct quadf *v;
  48
  49    unsigned i;
  50
  51    assert(pipe);
  52    assert(max_blocks);
  53
  54    /* create buffer */
  55    quad.stride = sizeof(struct vertex2f);
  56    quad.max_index = 4 * max_blocks - 1;
  57    quad.buffer_offset = 0;
  58    quad.buffer = pipe_buffer_create
  59    (
  60       pipe->screen,
  61       PIPE_BIND_VERTEX_BUFFER,
  62       sizeof(struct vertex2f) * 4 * max_blocks
  63    );
  64
  65    if(!quad.buffer)
  66       return quad;
  67
  68    /* and fill it */
  69    v = pipe_buffer_map
  70    (
  71       pipe,
  72       quad.buffer,
  73       PIPE_TRANSFER_WRITE | PIPE_TRANSFER_DISCARD,
  74       &buf_transfer
  75    );
  76
  77    for ( i = 0; i < max_blocks; ++i)
  78      memcpy(v + i, &const_quad, sizeof(const_quad));
  79
  80    pipe_buffer_unmap(pipe, quad.buffer, buf_transfer);
  81
  82    return quad;
  83 }
  84
  85 struct pipe_vertex_element
  86 vl_vb_get_quad_vertex_element()
  87 {
  88    struct pipe_vertex_element element;
  89
  90    /* setup rectangle element */
  91    element.src_offset = 0;
  92    element.instance_divisor = 0;
  93    element.vertex_buffer_index = 0;
  94    element.src_format = PIPE_FORMAT_R32G32_FLOAT;
  95
  96    return element;
  97 }
  98
  99 struct pipe_vertex_buffer
 100 vl_vb_create_buffer(struct pipe_context *pipe, unsigned max_blocks, unsigned stride)
 101 {
 102    struct pipe_vertex_buffer buf;
 103
 104    buf.stride = stride;
 105    buf.max_index = 4 * max_blocks - 1;
 106    buf.buffer_offset = 0;
 107    buf.buffer = pipe_buffer_create
 108    (
 109       pipe->screen,
 110       PIPE_BIND_VERTEX_BUFFER,
 111       stride * 4 * max_blocks
 112    );
 113
 114    return buf;
 115 }
 116
 117 unsigned
 118 vl_vb_element_helper(struct pipe_vertex_element* elements, unsigned num_elements,
 119                               unsigned vertex_buffer_index)
 120 {
 121    unsigned i, offset = 0;
 122
 123    assert(elements && num_elements);
 124
 125    for ( i = 0; i < num_elements; ++i ) {
 126       elements[i].src_offset = offset;
 127       elements[i].instance_divisor = 0;
 128       elements[i].vertex_buffer_index = vertex_buffer_index;
 129       offset += util_format_get_blocksize(elements[i].src_format);
 130    }
 131
 132    return offset;
 133 }
 134
 135 bool
 136 vl_vb_init(struct vl_vertex_buffer *buffer, unsigned max_blocks, unsigned num_elements)
 137 {
 138    assert(buffer);
 139
 140    buffer->num_verts = 0;
 141    buffer->num_elements = num_elements;
 142    buffer->buffer = MALLOC(max_blocks * num_elements * sizeof(float) * 4);
 143    return buffer->buffer != NULL;
 144 }
 145
 146 unsigned
 147 vl_vb_upload(struct vl_vertex_buffer *buffer, void *dst)
 148 {
 149    unsigned todo;
 150
 151    assert(buffer);
 152
 153    todo = buffer->num_verts;
 154    buffer->num_verts = 0;
 155
 156    if(todo)
 157       memcpy(dst, buffer->buffer, sizeof(float) * buffer->num_elements * todo);
 158
 159    return todo;
 160 }
 161
 162 void
 163 vl_vb_cleanup(struct vl_vertex_buffer *buffer)
 164 {
 165    assert(buffer);
 166
 167    FREE(buffer->buffer);
 168 }