Clone of mesa.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

sp_prim_vbuf.c 12KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404
  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. * Post-transform vertex buffering. This is an optional part of the
  29. * softpipe rendering pipeline.
  30. * Probably not desired in general, but useful for testing/debuggin.
  31. * Enabled/Disabled with SP_VBUF env var.
  32. *
  33. * Authors
  34. * Brian Paul
  35. */
  36. #include "sp_context.h"
  37. #include "sp_state.h"
  38. #include "sp_prim_vbuf.h"
  39. #include "sp_prim_setup.h"
  40. #include "sp_setup.h"
  41. #include "draw/draw_context.h"
  42. #include "draw/draw_vbuf.h"
  43. #define SP_MAX_VBUF_INDEXES 1024
  44. #define SP_MAX_VBUF_SIZE 4096
  45. typedef const float (*cptrf4)[4];
  46. /**
  47. * Subclass of vbuf_render.
  48. */
  49. struct softpipe_vbuf_render
  50. {
  51. struct vbuf_render base;
  52. struct softpipe_context *softpipe;
  53. uint prim;
  54. uint vertex_size;
  55. void *vertex_buffer;
  56. };
  57. /** cast wrapper */
  58. static struct softpipe_vbuf_render *
  59. softpipe_vbuf_render(struct vbuf_render *vbr)
  60. {
  61. return (struct softpipe_vbuf_render *) vbr;
  62. }
  63. static const struct vertex_info *
  64. sp_vbuf_get_vertex_info(struct vbuf_render *vbr)
  65. {
  66. struct softpipe_vbuf_render *cvbr = softpipe_vbuf_render(vbr);
  67. return softpipe_get_vbuf_vertex_info(cvbr->softpipe);
  68. }
  69. static void *
  70. sp_vbuf_allocate_vertices(struct vbuf_render *vbr,
  71. ushort vertex_size, ushort nr_vertices)
  72. {
  73. struct softpipe_vbuf_render *cvbr = softpipe_vbuf_render(vbr);
  74. assert(!cvbr->vertex_buffer);
  75. cvbr->vertex_buffer = align_malloc(vertex_size * nr_vertices, 16);
  76. cvbr->vertex_size = vertex_size;
  77. return cvbr->vertex_buffer;
  78. }
  79. static void
  80. sp_vbuf_release_vertices(struct vbuf_render *vbr, void *vertices,
  81. unsigned vertex_size, unsigned vertices_used)
  82. {
  83. struct softpipe_vbuf_render *cvbr = softpipe_vbuf_render(vbr);
  84. align_free(vertices);
  85. assert(vertices == cvbr->vertex_buffer);
  86. cvbr->vertex_buffer = NULL;
  87. }
  88. static boolean
  89. sp_vbuf_set_primitive(struct vbuf_render *vbr, unsigned prim)
  90. {
  91. struct softpipe_vbuf_render *cvbr = softpipe_vbuf_render(vbr);
  92. /* XXX: break this dependency - make setup_context live under
  93. * softpipe, rename the old "setup" draw stage to something else.
  94. */
  95. struct setup_context *setup_ctx = sp_draw_setup_context(cvbr->softpipe->setup);
  96. setup_prepare( setup_ctx );
  97. cvbr->prim = prim;
  98. return TRUE;
  99. }
  100. static INLINE cptrf4 get_vert( const void *vertex_buffer,
  101. int index,
  102. int stride )
  103. {
  104. return (cptrf4)((char *)vertex_buffer + index * stride);
  105. }
  106. static void
  107. sp_vbuf_draw(struct vbuf_render *vbr, const ushort *indices, uint nr)
  108. {
  109. struct softpipe_vbuf_render *cvbr = softpipe_vbuf_render(vbr);
  110. struct softpipe_context *softpipe = cvbr->softpipe;
  111. unsigned stride = softpipe->vertex_info_vbuf.size * sizeof(float);
  112. unsigned i;
  113. const void *vertex_buffer = cvbr->vertex_buffer;
  114. /* XXX: break this dependency - make setup_context live under
  115. * softpipe, rename the old "setup" draw stage to something else.
  116. */
  117. struct draw_stage *setup = softpipe->setup;
  118. struct setup_context *setup_ctx = sp_draw_setup_context(softpipe->setup);
  119. switch (cvbr->prim) {
  120. case PIPE_PRIM_POINTS:
  121. for (i = 0; i < nr; i++) {
  122. setup_point( setup_ctx,
  123. get_vert(vertex_buffer, indices[i-0], stride) );
  124. }
  125. break;
  126. case PIPE_PRIM_LINES:
  127. for (i = 1; i < nr; i += 2) {
  128. setup_line( setup_ctx,
  129. get_vert(vertex_buffer, indices[i-1], stride),
  130. get_vert(vertex_buffer, indices[i-0], stride) );
  131. }
  132. break;
  133. case PIPE_PRIM_LINE_STRIP:
  134. for (i = 1; i < nr; i ++) {
  135. setup_line( setup_ctx,
  136. get_vert(vertex_buffer, indices[i-1], stride),
  137. get_vert(vertex_buffer, indices[i-0], stride) );
  138. }
  139. break;
  140. case PIPE_PRIM_LINE_LOOP:
  141. for (i = 1; i < nr; i ++) {
  142. setup_line( setup_ctx,
  143. get_vert(vertex_buffer, indices[i-1], stride),
  144. get_vert(vertex_buffer, indices[i-0], stride) );
  145. }
  146. if (nr) {
  147. setup_line( setup_ctx,
  148. get_vert(vertex_buffer, indices[nr-1], stride),
  149. get_vert(vertex_buffer, indices[0], stride) );
  150. }
  151. break;
  152. case PIPE_PRIM_TRIANGLES:
  153. for (i = 2; i < nr; i += 3) {
  154. setup_tri( setup_ctx,
  155. get_vert(vertex_buffer, indices[i-2], stride),
  156. get_vert(vertex_buffer, indices[i-1], stride),
  157. get_vert(vertex_buffer, indices[i-0], stride));
  158. }
  159. break;
  160. case PIPE_PRIM_TRIANGLE_STRIP:
  161. for (i = 2; i < nr; i += 1) {
  162. setup_tri( setup_ctx,
  163. get_vert(vertex_buffer, indices[i+(i&1)-2], stride),
  164. get_vert(vertex_buffer, indices[i-(i&1)-1], stride),
  165. get_vert(vertex_buffer, indices[i-0], stride));
  166. }
  167. break;
  168. case PIPE_PRIM_TRIANGLE_FAN:
  169. case PIPE_PRIM_POLYGON:
  170. for (i = 2; i < nr; i += 1) {
  171. setup_tri( setup_ctx,
  172. get_vert(vertex_buffer, indices[0], stride),
  173. get_vert(vertex_buffer, indices[i-1], stride),
  174. get_vert(vertex_buffer, indices[i-0], stride));
  175. }
  176. break;
  177. case PIPE_PRIM_QUADS:
  178. for (i = 3; i < nr; i += 4) {
  179. setup_tri( setup_ctx,
  180. get_vert(vertex_buffer, indices[i-3], stride),
  181. get_vert(vertex_buffer, indices[i-2], stride),
  182. get_vert(vertex_buffer, indices[i-0], stride));
  183. setup_tri( setup_ctx,
  184. get_vert(vertex_buffer, indices[i-2], stride),
  185. get_vert(vertex_buffer, indices[i-1], stride),
  186. get_vert(vertex_buffer, indices[i-0], stride));
  187. }
  188. break;
  189. case PIPE_PRIM_QUAD_STRIP:
  190. for (i = 3; i < nr; i += 2) {
  191. setup_tri( setup_ctx,
  192. get_vert(vertex_buffer, indices[i-3], stride),
  193. get_vert(vertex_buffer, indices[i-2], stride),
  194. get_vert(vertex_buffer, indices[i-0], stride));
  195. setup_tri( setup_ctx,
  196. get_vert(vertex_buffer, indices[i-1], stride),
  197. get_vert(vertex_buffer, indices[i-3], stride),
  198. get_vert(vertex_buffer, indices[i-0], stride));
  199. }
  200. break;
  201. default:
  202. assert(0);
  203. }
  204. /* XXX: why are we calling this??? If we had to call something, it
  205. * would be a function in sp_setup.c:
  206. */
  207. sp_draw_flush( setup );
  208. }
  209. /**
  210. * This function is hit when the draw module is working in pass-through mode.
  211. * It's up to us to convert the vertex array into point/line/tri prims.
  212. */
  213. static void
  214. sp_vbuf_draw_arrays(struct vbuf_render *vbr, uint start, uint nr)
  215. {
  216. struct softpipe_vbuf_render *cvbr = softpipe_vbuf_render(vbr);
  217. struct softpipe_context *softpipe = cvbr->softpipe;
  218. struct draw_stage *setup = softpipe->setup;
  219. const void *vertex_buffer = NULL;
  220. const unsigned stride = softpipe->vertex_info_vbuf.size * sizeof(float);
  221. unsigned i;
  222. struct setup_context *setup_ctx = sp_draw_setup_context(setup);
  223. vertex_buffer = (void *)get_vert(cvbr->vertex_buffer, start, stride);
  224. switch (cvbr->prim) {
  225. case PIPE_PRIM_POINTS:
  226. for (i = 0; i < nr; i++) {
  227. setup_point( setup_ctx,
  228. get_vert(vertex_buffer, i-0, stride) );
  229. }
  230. break;
  231. case PIPE_PRIM_LINES:
  232. for (i = 1; i < nr; i += 2) {
  233. setup_line( setup_ctx,
  234. get_vert(vertex_buffer, i-1, stride),
  235. get_vert(vertex_buffer, i-0, stride) );
  236. }
  237. break;
  238. case PIPE_PRIM_LINE_STRIP:
  239. for (i = 1; i < nr; i ++) {
  240. setup_line( setup_ctx,
  241. get_vert(vertex_buffer, i-1, stride),
  242. get_vert(vertex_buffer, i-0, stride) );
  243. }
  244. break;
  245. case PIPE_PRIM_LINE_LOOP:
  246. for (i = 1; i < nr; i ++) {
  247. setup_line( setup_ctx,
  248. get_vert(vertex_buffer, i-1, stride),
  249. get_vert(vertex_buffer, i-0, stride) );
  250. }
  251. if (nr) {
  252. setup_line( setup_ctx,
  253. get_vert(vertex_buffer, nr-1, stride),
  254. get_vert(vertex_buffer, 0, stride) );
  255. }
  256. break;
  257. case PIPE_PRIM_TRIANGLES:
  258. for (i = 2; i < nr; i += 3) {
  259. setup_tri( setup_ctx,
  260. get_vert(vertex_buffer, i-2, stride),
  261. get_vert(vertex_buffer, i-1, stride),
  262. get_vert(vertex_buffer, i-0, stride));
  263. }
  264. break;
  265. case PIPE_PRIM_TRIANGLE_STRIP:
  266. for (i = 2; i < nr; i += 1) {
  267. setup_tri( setup_ctx,
  268. get_vert(vertex_buffer, i+(i&1)-2, stride),
  269. get_vert(vertex_buffer, i-(i&1)-1, stride),
  270. get_vert(vertex_buffer, i-0, stride));
  271. }
  272. break;
  273. case PIPE_PRIM_TRIANGLE_FAN:
  274. case PIPE_PRIM_POLYGON:
  275. for (i = 2; i < nr; i += 1) {
  276. setup_tri( setup_ctx,
  277. get_vert(vertex_buffer, 0, stride),
  278. get_vert(vertex_buffer, i-1, stride),
  279. get_vert(vertex_buffer, i-0, stride));
  280. }
  281. break;
  282. case PIPE_PRIM_QUADS:
  283. for (i = 3; i < nr; i += 4) {
  284. setup_tri( setup_ctx,
  285. get_vert(vertex_buffer, i-3, stride),
  286. get_vert(vertex_buffer, i-2, stride),
  287. get_vert(vertex_buffer, i-0, stride));
  288. setup_tri( setup_ctx,
  289. get_vert(vertex_buffer, i-2, stride),
  290. get_vert(vertex_buffer, i-1, stride),
  291. get_vert(vertex_buffer, i-0, stride));
  292. }
  293. break;
  294. case PIPE_PRIM_QUAD_STRIP:
  295. for (i = 3; i < nr; i += 2) {
  296. setup_tri( setup_ctx,
  297. get_vert(vertex_buffer, i-3, stride),
  298. get_vert(vertex_buffer, i-2, stride),
  299. get_vert(vertex_buffer, i-0, stride));
  300. setup_tri( setup_ctx,
  301. get_vert(vertex_buffer, i-1, stride),
  302. get_vert(vertex_buffer, i-3, stride),
  303. get_vert(vertex_buffer, i-0, stride));
  304. }
  305. break;
  306. default:
  307. assert(0);
  308. }
  309. }
  310. static void
  311. sp_vbuf_destroy(struct vbuf_render *vbr)
  312. {
  313. struct softpipe_vbuf_render *cvbr = softpipe_vbuf_render(vbr);
  314. cvbr->softpipe->vbuf_render = NULL;
  315. FREE(cvbr);
  316. }
  317. /**
  318. * Initialize the post-transform vertex buffer information for the given
  319. * context.
  320. */
  321. void
  322. sp_init_vbuf(struct softpipe_context *sp)
  323. {
  324. assert(sp->draw);
  325. sp->vbuf_render = CALLOC_STRUCT(softpipe_vbuf_render);
  326. sp->vbuf_render->base.max_indices = SP_MAX_VBUF_INDEXES;
  327. sp->vbuf_render->base.max_vertex_buffer_bytes = SP_MAX_VBUF_SIZE;
  328. sp->vbuf_render->base.get_vertex_info = sp_vbuf_get_vertex_info;
  329. sp->vbuf_render->base.allocate_vertices = sp_vbuf_allocate_vertices;
  330. sp->vbuf_render->base.set_primitive = sp_vbuf_set_primitive;
  331. sp->vbuf_render->base.draw = sp_vbuf_draw;
  332. sp->vbuf_render->base.draw_arrays = sp_vbuf_draw_arrays;
  333. sp->vbuf_render->base.release_vertices = sp_vbuf_release_vertices;
  334. sp->vbuf_render->base.destroy = sp_vbuf_destroy;
  335. sp->vbuf_render->softpipe = sp;
  336. sp->vbuf = draw_vbuf_stage(sp->draw, &sp->vbuf_render->base);
  337. draw_set_rasterize_stage(sp->draw, sp->vbuf);
  338. draw_set_render(sp->draw, &sp->vbuf_render->base);
  339. }