Subversion Repositories Kolibri OS

Rev

Go to most recent revision | Blame | Last modification | View Log | RSS feed

  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.  /*
  29.   * Authors:
  30.   *   Keith Whitwell <keith@tungstengraphics.com>
  31.   *   Brian Paul
  32.   */
  33.  
  34. #include "util/u_math.h"
  35. #include "util/u_memory.h"
  36.  
  37. #include "pipe/p_shader_tokens.h"
  38.  
  39. #include "draw_private.h"
  40. #include "draw_context.h"
  41. #include "draw_vs.h"
  42.  
  43. #include "translate/translate.h"
  44. #include "translate/translate_cache.h"
  45.  
  46. #include "tgsi/tgsi_dump.h"
  47. #include "tgsi/tgsi_exec.h"
  48.  
  49. DEBUG_GET_ONCE_BOOL_OPTION(gallium_dump_vs, "GALLIUM_DUMP_VS", FALSE)
  50.  
  51.  
  52. struct draw_vertex_shader *
  53. draw_create_vertex_shader(struct draw_context *draw,
  54.                           const struct pipe_shader_state *shader)
  55. {
  56.    struct draw_vertex_shader *vs = NULL;
  57.  
  58.    if (draw->dump_vs) {
  59.       tgsi_dump(shader->tokens, 0);
  60.    }
  61.  
  62. #if HAVE_LLVM
  63.    if (draw->pt.middle.llvm) {
  64.       vs = draw_create_vs_llvm(draw, shader);
  65.    }
  66. #endif
  67.  
  68.    if (!vs) {
  69.       vs = draw_create_vs_exec( draw, shader );
  70.    }
  71.  
  72.    if (vs)
  73.    {
  74.       uint i;
  75.       bool found_clipvertex = FALSE;
  76.       vs->position_output = -1;
  77.       for (i = 0; i < vs->info.num_outputs; i++) {
  78.          if (vs->info.output_semantic_name[i] == TGSI_SEMANTIC_POSITION &&
  79.              vs->info.output_semantic_index[i] == 0)
  80.             vs->position_output = i;
  81.          else if (vs->info.output_semantic_name[i] == TGSI_SEMANTIC_EDGEFLAG &&
  82.              vs->info.output_semantic_index[i] == 0)
  83.             vs->edgeflag_output = i;
  84.          else if (vs->info.output_semantic_name[i] == TGSI_SEMANTIC_CLIPVERTEX &&
  85.                   vs->info.output_semantic_index[i] == 0) {
  86.             found_clipvertex = TRUE;
  87.             vs->clipvertex_output = i;
  88.          } else if (vs->info.output_semantic_name[i] == TGSI_SEMANTIC_CLIPDIST) {
  89.             debug_assert(vs->info.output_semantic_index[i] <
  90.                          PIPE_MAX_CLIP_OR_CULL_DISTANCE_ELEMENT_COUNT);
  91.             vs->clipdistance_output[vs->info.output_semantic_index[i]] = i;
  92.          } else if (vs->info.output_semantic_name[i] == TGSI_SEMANTIC_CULLDIST) {
  93.             debug_assert(vs->info.output_semantic_index[i] <
  94.                          PIPE_MAX_CLIP_OR_CULL_DISTANCE_ELEMENT_COUNT);
  95.             vs->culldistance_output[vs->info.output_semantic_index[i]] = i;
  96.          }
  97.       }
  98.       if (!found_clipvertex)
  99.          vs->clipvertex_output = vs->position_output;
  100.    }
  101.  
  102.    assert(vs);
  103.    return vs;
  104. }
  105.  
  106.  
  107. void
  108. draw_bind_vertex_shader(struct draw_context *draw,
  109.                         struct draw_vertex_shader *dvs)
  110. {
  111.    draw_do_flush( draw, DRAW_FLUSH_STATE_CHANGE );
  112.    
  113.    if (dvs)
  114.    {
  115.       draw->vs.vertex_shader = dvs;
  116.       draw->vs.num_vs_outputs = dvs->info.num_outputs;
  117.       draw->vs.position_output = dvs->position_output;
  118.       draw->vs.edgeflag_output = dvs->edgeflag_output;
  119.       draw->vs.clipvertex_output = dvs->clipvertex_output;
  120.       draw->vs.clipdistance_output[0] = dvs->clipdistance_output[0];
  121.       draw->vs.clipdistance_output[1] = dvs->clipdistance_output[1];
  122.       dvs->prepare( dvs, draw );
  123.    }
  124.    else {
  125.       draw->vs.vertex_shader = NULL;
  126.       draw->vs.num_vs_outputs = 0;
  127.    }
  128. }
  129.  
  130.  
  131. void
  132. draw_delete_vertex_shader(struct draw_context *draw,
  133.                           struct draw_vertex_shader *dvs)
  134. {
  135.    unsigned i;
  136.  
  137.    for (i = 0; i < dvs->nr_variants; i++)
  138.       dvs->variant[i]->destroy( dvs->variant[i] );
  139.  
  140.    dvs->nr_variants = 0;
  141.  
  142.    dvs->delete( dvs );
  143. }
  144.  
  145.  
  146.  
  147. boolean
  148. draw_vs_init( struct draw_context *draw )
  149. {
  150.    draw->dump_vs = debug_get_option_gallium_dump_vs();
  151.  
  152.    draw->vs.tgsi.machine = tgsi_exec_machine_create();
  153.    if (!draw->vs.tgsi.machine)
  154.       return FALSE;
  155.  
  156.    draw->vs.emit_cache = translate_cache_create();
  157.    if (!draw->vs.emit_cache)
  158.       return FALSE;
  159.      
  160.    draw->vs.fetch_cache = translate_cache_create();
  161.    if (!draw->vs.fetch_cache)
  162.       return FALSE;
  163.  
  164.    return TRUE;
  165. }
  166.  
  167. void
  168. draw_vs_destroy( struct draw_context *draw )
  169. {
  170.    if (draw->vs.fetch_cache)
  171.       translate_cache_destroy(draw->vs.fetch_cache);
  172.  
  173.    if (draw->vs.emit_cache)
  174.       translate_cache_destroy(draw->vs.emit_cache);
  175.  
  176.    tgsi_exec_machine_destroy(draw->vs.tgsi.machine);
  177. }
  178.  
  179.  
  180. struct draw_vs_variant *
  181. draw_vs_lookup_variant( struct draw_vertex_shader *vs,
  182.                         const struct draw_vs_variant_key *key )
  183. {
  184.    struct draw_vs_variant *variant;
  185.    unsigned i;
  186.  
  187.    /* Lookup existing variant:
  188.     */
  189.    for (i = 0; i < vs->nr_variants; i++)
  190.       if (draw_vs_variant_key_compare(key, &vs->variant[i]->key) == 0)
  191.          return vs->variant[i];
  192.    
  193.    /* Else have to create a new one:
  194.     */
  195.    variant = vs->create_variant( vs, key );
  196.    if (variant == NULL)
  197.       return NULL;
  198.  
  199.    /* Add it to our list, could be smarter:
  200.     */
  201.    if (vs->nr_variants < Elements(vs->variant)) {
  202.       vs->variant[vs->nr_variants++] = variant;
  203.    }
  204.    else {
  205.       vs->last_variant++;
  206.       vs->last_variant %= Elements(vs->variant);
  207.       vs->variant[vs->last_variant]->destroy(vs->variant[vs->last_variant]);
  208.       vs->variant[vs->last_variant] = variant;
  209.    }
  210.  
  211.    /* Done
  212.     */
  213.    return variant;
  214. }
  215.  
  216.  
  217. struct translate *
  218. draw_vs_get_fetch( struct draw_context *draw,
  219.                    struct translate_key *key )
  220. {
  221.    if (!draw->vs.fetch ||
  222.        translate_key_compare(&draw->vs.fetch->key, key) != 0)
  223.    {
  224.       translate_key_sanitize(key);
  225.       draw->vs.fetch = translate_cache_find(draw->vs.fetch_cache, key);
  226.    }
  227.    
  228.    return draw->vs.fetch;
  229. }
  230.  
  231. struct translate *
  232. draw_vs_get_emit( struct draw_context *draw,
  233.                   struct translate_key *key )
  234. {
  235.    if (!draw->vs.emit ||
  236.        translate_key_compare(&draw->vs.emit->key, key) != 0)
  237.    {
  238.       translate_key_sanitize(key);
  239.       draw->vs.emit = translate_cache_find(draw->vs.emit_cache, key);
  240.    }
  241.    
  242.    return draw->vs.emit;
  243. }
  244.  
  245. void
  246. draw_vs_attach_so(struct draw_vertex_shader *dvs,
  247.                   const struct pipe_stream_output_info *info)
  248. {
  249.    dvs->state.stream_output = *info;
  250. }
  251.  
  252. void
  253. draw_vs_reset_so(struct draw_vertex_shader *dvs)
  254. {
  255.    memset(&dvs->state.stream_output, 0, sizeof(dvs->state.stream_output));
  256. }
  257.