src/mesa/drivers/dri/i965/brw_curbe.c

   1 /*
   2  Copyright (C) Intel Corp.  2006.  All Rights Reserved.
   3  Intel funded Tungsten Graphics (http://www.tungstengraphics.com) to
   4  develop this 3D driver.
   5
   6  Permission is hereby granted, free of charge, to any person obtaining
   7  a 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, sublicense, 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
  16  portions of the Software.
  17
  18  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  19  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  20  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
  21  IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
  22  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
  23  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
  24  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  25
  26  **********************************************************************/
  27  /*
  28   * Authors:
  29   *   Keith Whitwell <keith@tungstengraphics.com>
  30   */
  31
  32
  33
  34 #include "main/glheader.h"
  35 #include "main/context.h"
  36 #include "main/macros.h"
  37 #include "main/enums.h"
  38 #include "program/prog_parameter.h"
  39 #include "program/prog_print.h"
  40 #include "program/prog_statevars.h"
  41 #include "intel_batchbuffer.h"
  42 #include "intel_regions.h"
  43 #include "brw_context.h"
  44 #include "brw_defines.h"
  45 #include "brw_state.h"
  46 #include "brw_util.h"
  47
  48
  49 /**
  50  * Partition the CURBE between the various users of constant values:
  51  * Note that vertex and fragment shaders can now fetch constants out
  52  * of constant buffers.  We no longer allocatea block of the GRF for
  53  * constants.  That greatly reduces the demand for space in the CURBE.
  54  * Some of the comments within are dated...
  55  */
  56 static void calculate_curbe_offsets( struct brw_context *brw )
  57 {
  58    struct gl_context *ctx = &brw->intel.ctx;
  59    /* CACHE_NEW_WM_PROG */
  60    const GLuint nr_fp_regs = (brw->wm.prog_data->nr_params + 15) / 16;
  61
  62    /* BRW_NEW_VERTEX_PROGRAM */
  63    const GLuint nr_vp_regs = (brw->vs.prog_data->nr_params + 15) / 16;
  64    GLuint nr_clip_regs = 0;
  65    GLuint total_regs;
  66
  67    /* _NEW_TRANSFORM */
  68    if (ctx->Transform.ClipPlanesEnabled) {
  69       GLuint nr_planes = 6 + brw_count_bits(ctx->Transform.ClipPlanesEnabled);
  70       nr_clip_regs = (nr_planes * 4 + 15) / 16;
  71    }
  72
  73
  74    total_regs = nr_fp_regs + nr_vp_regs + nr_clip_regs;
  75
  76    /* This can happen - what to do?  Probably rather than falling
  77     * back, the best thing to do is emit programs which code the
  78     * constants as immediate values.  Could do this either as a static
  79     * cap on WM and VS, or adaptively.
  80     *
  81     * Unfortunately, this is currently dependent on the results of the
  82     * program generation process (in the case of wm), so this would
  83     * introduce the need to re-generate programs in the event of a
  84     * curbe allocation failure.
  85     */
  86    /* Max size is 32 - just large enough to
  87     * hold the 128 parameters allowed by
  88     * the fragment and vertex program
  89     * api's.  It's not clear what happens
  90     * when both VP and FP want to use 128
  91     * parameters, though.
  92     */
  93    assert(total_regs <= 32);
  94
  95    /* Lazy resize:
  96     */
  97    if (nr_fp_regs > brw->curbe.wm_size ||
  98        nr_vp_regs > brw->curbe.vs_size ||
  99        nr_clip_regs != brw->curbe.clip_size ||
 100        (total_regs < brw->curbe.total_size / 4 &&
 101         brw->curbe.total_size > 16)) {
 102
 103       GLuint reg = 0;
 104
 105       /* Calculate a new layout:
 106        */
 107       reg = 0;
 108       brw->curbe.wm_start = reg;
 109       brw->curbe.wm_size = nr_fp_regs; reg += nr_fp_regs;
 110       brw->curbe.clip_start = reg;
 111       brw->curbe.clip_size = nr_clip_regs; reg += nr_clip_regs;
 112       brw->curbe.vs_start = reg;
 113       brw->curbe.vs_size = nr_vp_regs; reg += nr_vp_regs;
 114       brw->curbe.total_size = reg;
 115
 116       if (0)
 117          printf("curbe wm %d+%d clip %d+%d vs %d+%d\n",
 118                 brw->curbe.wm_start,
 119                 brw->curbe.wm_size,
 120                 brw->curbe.clip_start,
 121                 brw->curbe.clip_size,
 122                 brw->curbe.vs_start,
 123                 brw->curbe.vs_size );
 124
 125       brw->state.dirty.brw |= BRW_NEW_CURBE_OFFSETS;
 126    }
 127 }
 128
 129
 130 const struct brw_tracked_state brw_curbe_offsets = {
 131    .dirty = {
 132       .mesa = _NEW_TRANSFORM,
 133       .brw  = BRW_NEW_VERTEX_PROGRAM | BRW_NEW_CONTEXT,
 134       .cache = CACHE_NEW_WM_PROG
 135    },
 136    .prepare = calculate_curbe_offsets
 137 };
 138
 139
 140
 141
 142 /* Define the number of curbes within CS's urb allocation.  Multiple
 143  * urb entries -> multiple curbes.  These will be used by
 144  * fixed-function hardware in a double-buffering scheme to avoid a
 145  * pipeline stall each time the contents of the curbe is changed.
 146  */
 147 void brw_upload_cs_urb_state(struct brw_context *brw)
 148 {
 149    struct intel_context *intel = &brw->intel;
 150
 151    BEGIN_BATCH(2);
 152    /* It appears that this is the state packet for the CS unit, ie. the
 153     * urb entries detailed here are housed in the CS range from the
 154     * URB_FENCE command.
 155     */
 156    OUT_BATCH(CMD_CS_URB_STATE << 16 | (2-2));
 157
 158    /* BRW_NEW_URB_FENCE */
 159    if (brw->urb.csize == 0) {
 160       OUT_BATCH(0);
 161    } else {
 162       /* BRW_NEW_URB_FENCE */
 163       assert(brw->urb.nr_cs_entries);
 164       OUT_BATCH((brw->urb.csize - 1) << 4 | brw->urb.nr_cs_entries);
 165    }
 166    CACHED_BATCH();
 167 }
 168
 169 static GLfloat fixed_plane[6][4] = {
 170    { 0,    0,   -1, 1 },
 171    { 0,    0,    1, 1 },
 172    { 0,   -1,    0, 1 },
 173    { 0,    1,    0, 1 },
 174    {-1,    0,    0, 1 },
 175    { 1,    0,    0, 1 }
 176 };
 177
 178 /* Upload a new set of constants.  Too much variability to go into the
 179  * cache mechanism, but maybe would benefit from a comparison against
 180  * the current uploaded set of constants.
 181  */
 182 static void prepare_constant_buffer(struct brw_context *brw)
 183 {
 184    struct gl_context *ctx = &brw->intel.ctx;
 185    const struct brw_vertex_program *vp =
 186       brw_vertex_program_const(brw->vertex_program);
 187    const GLuint sz = brw->curbe.total_size;
 188    const GLuint bufsz = sz * 16 * sizeof(GLfloat);
 189    GLfloat *buf;
 190    GLuint i;
 191
 192    if (sz == 0) {
 193       brw->curbe.last_bufsz  = 0;
 194       return;
 195    }
 196
 197    buf = brw->curbe.next_buf;
 198
 199    /* fragment shader constants */
 200    if (brw->curbe.wm_size) {
 201       GLuint offset = brw->curbe.wm_start * 16;
 202
 203       /* copy float constants */
 204       for (i = 0; i < brw->wm.prog_data->nr_params; i++) {
 205          buf[offset + i] = convert_param(brw->wm.prog_data->param_convert[i],
 206                                          brw->wm.prog_data->param[i]);
 207       }
 208    }
 209
 210
 211    /* When using the old VS backend, the clipplanes are actually delivered to
 212     * both CLIP and VS units.  VS uses them to calculate the outcode bitmasks.
 213     *
 214     * When using the new VS backend, it is responsible for setting up its own
 215     * clipplane constants if it needs them.  This results in a slight waste of
 216     * of curbe space, but the advantage is that the new VS backend can use its
 217     * general-purpose uniform layout code to store the clipplanes.
 218     */
 219    if (brw->curbe.clip_size) {
 220       GLuint offset = brw->curbe.clip_start * 16;
 221       GLuint j;
 222
 223       /* If any planes are going this way, send them all this way:
 224        */
 225       for (i = 0; i < 6; i++) {
 226          buf[offset + i * 4 + 0] = fixed_plane[i][0];
 227          buf[offset + i * 4 + 1] = fixed_plane[i][1];
 228          buf[offset + i * 4 + 2] = fixed_plane[i][2];
 229          buf[offset + i * 4 + 3] = fixed_plane[i][3];
 230       }
 231
 232       /* Clip planes: _NEW_TRANSFORM plus _NEW_PROJECTION to get to
 233        * clip-space:
 234        */
 235       for (j = 0; j < MAX_CLIP_PLANES; j++) {
 236          if (ctx->Transform.ClipPlanesEnabled & (1<<j)) {
 237             buf[offset + i * 4 + 0] = ctx->Transform._ClipUserPlane[j][0];
 238             buf[offset + i * 4 + 1] = ctx->Transform._ClipUserPlane[j][1];
 239             buf[offset + i * 4 + 2] = ctx->Transform._ClipUserPlane[j][2];
 240             buf[offset + i * 4 + 3] = ctx->Transform._ClipUserPlane[j][3];
 241             i++;
 242          }
 243       }
 244    }
 245
 246    /* vertex shader constants */
 247    if (brw->curbe.vs_size) {
 248       GLuint offset = brw->curbe.vs_start * 16;
 249       GLuint nr = brw->vs.prog_data->nr_params / 4;
 250
 251       if (brw->vs.prog_data->uses_new_param_layout) {
 252          for (i = 0; i < brw->vs.prog_data->nr_params; i++) {
 253             buf[offset + i] = *brw->vs.prog_data->param[i];
 254          }
 255       } else {
 256          /* Load the subset of push constants that will get used when
 257           * we also have a pull constant buffer.
 258           */
 259          for (i = 0; i < vp->program.Base.Parameters->NumParameters; i++) {
 260             if (brw->vs.constant_map[i] != -1) {
 261                assert(brw->vs.constant_map[i] <= nr);
 262                memcpy(buf + offset + brw->vs.constant_map[i] * 4,
 263                       vp->program.Base.Parameters->ParameterValues[i],
 264                       4 * sizeof(float));
 265             }
 266          }
 267       }
 268    }
 269
 270    if (0) {
 271       for (i = 0; i < sz*16; i+=4)
 272          printf("curbe %d.%d: %f %f %f %f\n", i/8, i&4,
 273                 buf[i+0], buf[i+1], buf[i+2], buf[i+3]);
 274
 275       printf("last_buf %p buf %p sz %d/%d cmp %d\n",
 276              brw->curbe.last_buf, buf,
 277              bufsz, brw->curbe.last_bufsz,
 278              brw->curbe.last_buf ? memcmp(buf, brw->curbe.last_buf, bufsz) : -1);
 279    }
 280
 281    if (brw->curbe.curbe_bo != NULL &&
 282        bufsz == brw->curbe.last_bufsz &&
 283        memcmp(buf, brw->curbe.last_buf, bufsz) == 0) {
 284       /* constants have not changed */
 285    } else {
 286       /* Update the record of what our last set of constants was.  We
 287        * don't just flip the pointers because we don't fill in the
 288        * data in the padding between the entries.
 289        */
 290       memcpy(brw->curbe.last_buf, buf, bufsz);
 291       brw->curbe.last_bufsz = bufsz;
 292
 293       if (brw->curbe.curbe_bo != NULL &&
 294           brw->curbe.curbe_next_offset + bufsz > brw->curbe.curbe_bo->size)
 295       {
 296          drm_intel_gem_bo_unmap_gtt(brw->curbe.curbe_bo);
 297          drm_intel_bo_unreference(brw->curbe.curbe_bo);
 298          brw->curbe.curbe_bo = NULL;
 299       }
 300
 301       if (brw->curbe.curbe_bo == NULL) {
 302          /* Allocate a single page for CURBE entries for this batchbuffer.
 303           * They're generally around 64b.
 304           */
 305          brw->curbe.curbe_bo = drm_intel_bo_alloc(brw->intel.bufmgr, "CURBE",
 306                                                   4096, 1 << 6);
 307          brw->curbe.curbe_next_offset = 0;
 308          drm_intel_gem_bo_map_gtt(brw->curbe.curbe_bo);
 309          assert(bufsz < 4096);
 310       }
 311
 312       brw->curbe.curbe_offset = brw->curbe.curbe_next_offset;
 313       brw->curbe.curbe_next_offset += bufsz;
 314       brw->curbe.curbe_next_offset = ALIGN(brw->curbe.curbe_next_offset, 64);
 315
 316       /* Copy data to the buffer:
 317        */
 318       memcpy(brw->curbe.curbe_bo->virtual + brw->curbe.curbe_offset,
 319              buf,
 320              bufsz);
 321    }
 322
 323    brw_add_validated_bo(brw, brw->curbe.curbe_bo);
 324
 325    /* Because this provokes an action (ie copy the constants into the
 326     * URB), it shouldn't be shortcircuited if identical to the
 327     * previous time - because eg. the urb destination may have
 328     * changed, or the urb contents different to last time.
 329     *
 330     * Note that the data referred to is actually copied internally,
 331     * not just used in place according to passed pointer.
 332     *
 333     * It appears that the CS unit takes care of using each available
 334     * URB entry (Const URB Entry == CURBE) in turn, and issuing
 335     * flushes as necessary when doublebuffering of CURBEs isn't
 336     * possible.
 337     */
 338 }
 339
 340 static void emit_constant_buffer(struct brw_context *brw)
 341 {
 342    struct intel_context *intel = &brw->intel;
 343    GLuint sz = brw->curbe.total_size;
 344
 345    BEGIN_BATCH(2);
 346    if (sz == 0) {
 347       OUT_BATCH((CMD_CONST_BUFFER << 16) | (2 - 2));
 348       OUT_BATCH(0);
 349    } else {
 350       OUT_BATCH((CMD_CONST_BUFFER << 16) | (1 << 8) | (2 - 2));
 351       OUT_RELOC(brw->curbe.curbe_bo,
 352                 I915_GEM_DOMAIN_INSTRUCTION, 0,
 353                 (sz - 1) + brw->curbe.curbe_offset);
 354    }
 355    ADVANCE_BATCH();
 356 }
 357
 358 /* This tracked state is unique in that the state it monitors varies
 359  * dynamically depending on the parameters tracked by the fragment and
 360  * vertex programs.  This is the template used as a starting point,
 361  * each context will maintain a copy of this internally and update as
 362  * required.
 363  */
 364 const struct brw_tracked_state brw_constant_buffer = {
 365    .dirty = {
 366       .mesa = _NEW_PROGRAM_CONSTANTS,
 367       .brw  = (BRW_NEW_FRAGMENT_PROGRAM |
 368                BRW_NEW_VERTEX_PROGRAM |
 369                BRW_NEW_URB_FENCE | /* Implicit - hardware requires this, not used above */
 370                BRW_NEW_PSP | /* Implicit - hardware requires this, not used above */
 371                BRW_NEW_CURBE_OFFSETS |
 372                BRW_NEW_BATCH),
 373       .cache = (CACHE_NEW_WM_PROG)
 374    },
 375    .prepare = prepare_constant_buffer,
 376    .emit = emit_constant_buffer,
 377 };
 378