src/gallium/drivers/llvmpipe/lp_state_vertex.c

   1 /**************************************************************************
   2  *
   3  * Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
   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 /* Authors:  Keith Whitwell <keith@tungstengraphics.com>
  29  */
  30
  31
  32 #include "lp_context.h"
  33 #include "lp_state.h"
  34
  35 #include "draw/draw_context.h"
  36
  37
  38 void *
  39 llvmpipe_create_vertex_elements_state(struct pipe_context *pipe,
  40                                       unsigned count,
  41                                       const struct pipe_vertex_element *attribs)
  42 {
  43    struct lp_velems_state *velems;
  44    assert(count <= PIPE_MAX_ATTRIBS);
  45    velems = (struct lp_velems_state *) MALLOC(sizeof(struct lp_velems_state));
  46    if (velems) {
  47       velems->count = count;
  48       memcpy(velems->velem, attribs, sizeof(*attribs) * count);
  49    }
  50    return velems;
  51 }
  52
  53 void
  54 llvmpipe_bind_vertex_elements_state(struct pipe_context *pipe,
  55                                     void *velems)
  56 {
  57    struct llvmpipe_context *llvmpipe = llvmpipe_context(pipe);
  58    struct lp_velems_state *lp_velems = (struct lp_velems_state *) velems;
  59
  60    llvmpipe->velems = lp_velems;
  61
  62    llvmpipe->dirty |= LP_NEW_VERTEX;
  63
  64    if (velems)
  65       draw_set_vertex_elements(llvmpipe->draw, lp_velems->count, lp_velems->velem);
  66 }
  67
  68 void
  69 llvmpipe_delete_vertex_elements_state(struct pipe_context *pipe, void *velems)
  70 {
  71    FREE( velems );
  72 }
  73
  74 void
  75 llvmpipe_set_vertex_buffers(struct pipe_context *pipe,
  76                             unsigned count,
  77                             const struct pipe_vertex_buffer *buffers)
  78 {
  79    struct llvmpipe_context *llvmpipe = llvmpipe_context(pipe);
  80
  81    assert(count <= PIPE_MAX_ATTRIBS);
  82
  83    memcpy(llvmpipe->vertex_buffer, buffers, count * sizeof(buffers[0]));
  84    llvmpipe->num_vertex_buffers = count;
  85
  86    llvmpipe->dirty |= LP_NEW_VERTEX;
  87
  88    draw_set_vertex_buffers(llvmpipe->draw, count, buffers);
  89 }