i965: Avoid division by zero.
[mesa.git] / src / mesa / drivers / dri / i965 / gen7_urb.c
1 /*
2 * Copyright © 2011 Intel Corporation
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
13 * Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
21 * IN THE SOFTWARE.
22 */
23
24 #include "main/macros.h"
25 #include "intel_batchbuffer.h"
26 #include "brw_context.h"
27 #include "brw_state.h"
28 #include "brw_defines.h"
29
30 /**
31 * The following diagram shows how we partition the URB:
32 *
33 * 16kB or 32kB Rest of the URB space
34 * __________-__________ _________________-_________________
35 * / \ / \
36 * +-------------------------------------------------------------+
37 * | VS/HS/DS/GS/FS Push | VS/HS/DS/GS URB |
38 * | Constants | Entries |
39 * +-------------------------------------------------------------+
40 *
41 * Notably, push constants must be stored at the beginning of the URB
42 * space, while entries can be stored anywhere. Ivybridge and Haswell
43 * GT1/GT2 have a maximum constant buffer size of 16kB, while Haswell GT3
44 * doubles this (32kB).
45 *
46 * Ivybridge and Haswell GT1/GT2 allow push constants to be located (and
47 * sized) in increments of 1kB. Haswell GT3 requires them to be located and
48 * sized in increments of 2kB.
49 *
50 * Currently we split the constant buffer space evenly among whatever stages
51 * are active. This is probably not ideal, but simple.
52 *
53 * Ivybridge GT1 and Haswell GT1 have 128kB of URB space.
54 * Ivybridge GT2 and Haswell GT2 have 256kB of URB space.
55 * Haswell GT3 has 512kB of URB space.
56 *
57 * See "Volume 2a: 3D Pipeline," section 1.8, "Volume 1b: Configurations",
58 * and the documentation for 3DSTATE_PUSH_CONSTANT_ALLOC_xS.
59 */
60 static void
61 gen7_allocate_push_constants(struct brw_context *brw)
62 {
63 /* BRW_NEW_GEOMETRY_PROGRAM */
64 bool gs_present = brw->geometry_program;
65
66 /* BRW_NEW_TESS_PROGRAMS */
67 bool tess_present = brw->tess_eval_program;
68
69 unsigned avail_size = 16;
70 unsigned multiplier =
71 (brw->gen >= 8 || (brw->is_haswell && brw->gt == 3)) ? 2 : 1;
72
73 int stages = 2 + gs_present + 2 * tess_present;
74
75 /* Divide up the available space equally between stages. Because we
76 * round down (using floor division), there may be some left over
77 * space. We allocate that to the pixel shader stage.
78 */
79 unsigned size_per_stage = avail_size / stages;
80
81 unsigned vs_size = size_per_stage;
82 unsigned hs_size = tess_present ? size_per_stage : 0;
83 unsigned ds_size = tess_present ? size_per_stage : 0;
84 unsigned gs_size = gs_present ? size_per_stage : 0;
85 unsigned fs_size = avail_size - size_per_stage * (stages - 1);
86
87 gen7_emit_push_constant_state(brw, multiplier * vs_size,
88 multiplier * hs_size, multiplier * ds_size,
89 multiplier * gs_size, multiplier * fs_size);
90
91 /* From p115 of the Ivy Bridge PRM (3.2.1.4 3DSTATE_PUSH_CONSTANT_ALLOC_VS):
92 *
93 * Programming Restriction:
94 *
95 * The 3DSTATE_CONSTANT_VS must be reprogrammed prior to the next
96 * 3DPRIMITIVE command after programming the
97 * 3DSTATE_PUSH_CONSTANT_ALLOC_VS.
98 *
99 * Similar text exists for the other 3DSTATE_PUSH_CONSTANT_ALLOC_*
100 * commands.
101 */
102 brw->ctx.NewDriverState |= BRW_NEW_PUSH_CONSTANT_ALLOCATION;
103 }
104
105 void
106 gen7_emit_push_constant_state(struct brw_context *brw, unsigned vs_size,
107 unsigned hs_size, unsigned ds_size,
108 unsigned gs_size, unsigned fs_size)
109 {
110 unsigned offset = 0;
111
112 BEGIN_BATCH(10);
113 OUT_BATCH(_3DSTATE_PUSH_CONSTANT_ALLOC_VS << 16 | (2 - 2));
114 OUT_BATCH(vs_size | offset << GEN7_PUSH_CONSTANT_BUFFER_OFFSET_SHIFT);
115 offset += vs_size;
116
117 OUT_BATCH(_3DSTATE_PUSH_CONSTANT_ALLOC_HS << 16 | (2 - 2));
118 OUT_BATCH(hs_size | offset << GEN7_PUSH_CONSTANT_BUFFER_OFFSET_SHIFT);
119 offset += hs_size;
120
121 OUT_BATCH(_3DSTATE_PUSH_CONSTANT_ALLOC_DS << 16 | (2 - 2));
122 OUT_BATCH(ds_size | offset << GEN7_PUSH_CONSTANT_BUFFER_OFFSET_SHIFT);
123 offset += ds_size;
124
125 OUT_BATCH(_3DSTATE_PUSH_CONSTANT_ALLOC_GS << 16 | (2 - 2));
126 OUT_BATCH(gs_size | offset << GEN7_PUSH_CONSTANT_BUFFER_OFFSET_SHIFT);
127 offset += gs_size;
128
129 OUT_BATCH(_3DSTATE_PUSH_CONSTANT_ALLOC_PS << 16 | (2 - 2));
130 OUT_BATCH(fs_size | offset << GEN7_PUSH_CONSTANT_BUFFER_OFFSET_SHIFT);
131 ADVANCE_BATCH();
132
133 /* From p292 of the Ivy Bridge PRM (11.2.4 3DSTATE_PUSH_CONSTANT_ALLOC_PS):
134 *
135 * A PIPE_CONTROL command with the CS Stall bit set must be programmed
136 * in the ring after this instruction.
137 *
138 * No such restriction exists for Haswell or Baytrail.
139 */
140 if (brw->gen < 8 && !brw->is_haswell && !brw->is_baytrail)
141 gen7_emit_cs_stall_flush(brw);
142 }
143
144 const struct brw_tracked_state gen7_push_constant_space = {
145 .dirty = {
146 .mesa = 0,
147 .brw = BRW_NEW_BLORP |
148 BRW_NEW_CONTEXT |
149 BRW_NEW_GEOMETRY_PROGRAM |
150 BRW_NEW_TESS_PROGRAMS,
151 },
152 .emit = gen7_allocate_push_constants,
153 };
154
155 static void
156 gen7_upload_urb(struct brw_context *brw)
157 {
158 const struct brw_device_info *devinfo = brw->intelScreen->devinfo;
159 const int push_size_kB =
160 (brw->gen >= 8 || (brw->is_haswell && brw->gt == 3)) ? 32 : 16;
161
162 /* BRW_NEW_VS_PROG_DATA */
163 unsigned vs_size = MAX2(brw->vs.prog_data->base.urb_entry_size, 1);
164 unsigned vs_entry_size_bytes = vs_size * 64;
165 /* BRW_NEW_GEOMETRY_PROGRAM, BRW_NEW_GS_PROG_DATA */
166 bool gs_present = brw->geometry_program;
167 unsigned gs_size = gs_present ? brw->gs.prog_data->base.urb_entry_size : 1;
168 unsigned gs_entry_size_bytes = gs_size * 64;
169
170 /* BRW_NEW_TESS_PROGRAMS */
171 const bool tess_present = brw->tess_eval_program;
172 /* BRW_NEW_TCS_PROG_DATA */
173 unsigned hs_size = tess_present ? brw->tcs.prog_data->base.urb_entry_size : 1;
174 unsigned hs_entry_size_bytes = hs_size * 64;
175 /* BRW_NEW_TES_PROG_DATA */
176 unsigned ds_size = tess_present ? brw->tes.prog_data->base.urb_entry_size : 1;
177 unsigned ds_entry_size_bytes = ds_size * 64;
178
179 /* If we're just switching between programs with the same URB requirements,
180 * skip the rest of the logic.
181 */
182 if (!(brw->ctx.NewDriverState & BRW_NEW_CONTEXT) &&
183 !(brw->ctx.NewDriverState & BRW_NEW_URB_SIZE) &&
184 brw->urb.vsize == vs_size &&
185 brw->urb.gs_present == gs_present &&
186 brw->urb.gsize == gs_size &&
187 brw->urb.tess_present == tess_present &&
188 brw->urb.hsize == hs_size &&
189 brw->urb.dsize == ds_size) {
190 return;
191 }
192 brw->urb.vsize = vs_size;
193 brw->urb.gs_present = gs_present;
194 brw->urb.gsize = gs_size;
195 brw->urb.tess_present = tess_present;
196 brw->urb.hsize = hs_size;
197 brw->urb.dsize = ds_size;
198
199 /* From p35 of the Ivy Bridge PRM (section 1.7.1: 3DSTATE_URB_GS):
200 *
201 * VS Number of URB Entries must be divisible by 8 if the VS URB Entry
202 * Allocation Size is less than 9 512-bit URB entries.
203 *
204 * Similar text exists for HS, DS and GS.
205 */
206 unsigned vs_granularity = (vs_size < 9) ? 8 : 1;
207 unsigned hs_granularity = (hs_size < 9) ? 8 : 1;
208 unsigned ds_granularity = (ds_size < 9) ? 8 : 1;
209 unsigned gs_granularity = (gs_size < 9) ? 8 : 1;
210
211 /* URB allocations must be done in 8k chunks. */
212 unsigned chunk_size_bytes = 8192;
213
214 /* Determine the size of the URB in chunks.
215 * BRW_NEW_URB_SIZE
216 */
217 unsigned urb_chunks = brw->urb.size * 1024 / chunk_size_bytes;
218
219 /* Reserve space for push constants */
220 unsigned push_constant_bytes = 1024 * push_size_kB;
221 unsigned push_constant_chunks =
222 push_constant_bytes / chunk_size_bytes;
223
224 /* Initially, assign each stage the minimum amount of URB space it needs,
225 * and make a note of how much additional space it "wants" (the amount of
226 * additional space it could actually make use of).
227 */
228
229 /* VS has a lower limit on the number of URB entries.
230 *
231 * From the Broadwell PRM, 3DSTATE_URB_VS instruction:
232 * "When tessellation is enabled, the VS Number of URB Entries must be
233 * greater than or equal to 192."
234 */
235 unsigned vs_min_entries =
236 tess_present && brw->gen == 8 ? 192 : brw->urb.min_vs_entries;
237 /* Min VS Entries isn't a multiple of 8 on Cherryview/Broxton; round up */
238 vs_min_entries = ALIGN(vs_min_entries, vs_granularity);
239
240 unsigned vs_chunks =
241 DIV_ROUND_UP(vs_min_entries * vs_entry_size_bytes, chunk_size_bytes);
242 unsigned vs_wants =
243 DIV_ROUND_UP(brw->urb.max_vs_entries * vs_entry_size_bytes,
244 chunk_size_bytes) - vs_chunks;
245
246 unsigned gs_chunks = 0;
247 unsigned gs_wants = 0;
248 if (gs_present) {
249 /* There are two constraints on the minimum amount of URB space we can
250 * allocate:
251 *
252 * (1) We need room for at least 2 URB entries, since we always operate
253 * the GS in DUAL_OBJECT mode.
254 *
255 * (2) We can't allocate less than nr_gs_entries_granularity.
256 */
257 gs_chunks = DIV_ROUND_UP(MAX2(gs_granularity, 2) * gs_entry_size_bytes,
258 chunk_size_bytes);
259 gs_wants = DIV_ROUND_UP(brw->urb.max_gs_entries * gs_entry_size_bytes,
260 chunk_size_bytes) - gs_chunks;
261 }
262
263 unsigned hs_chunks = 0;
264 unsigned hs_wants = 0;
265 unsigned ds_chunks = 0;
266 unsigned ds_wants = 0;
267
268 if (tess_present) {
269 hs_chunks =
270 DIV_ROUND_UP(hs_granularity * hs_entry_size_bytes,
271 chunk_size_bytes);
272 hs_wants =
273 DIV_ROUND_UP(devinfo->urb.max_hs_entries * hs_entry_size_bytes,
274 chunk_size_bytes) - hs_chunks;
275
276 ds_chunks =
277 DIV_ROUND_UP(devinfo->urb.min_ds_entries * ds_entry_size_bytes,
278 chunk_size_bytes);
279 ds_wants =
280 DIV_ROUND_UP(brw->urb.max_ds_entries * ds_entry_size_bytes,
281 chunk_size_bytes) - ds_chunks;
282 }
283
284 /* There should always be enough URB space to satisfy the minimum
285 * requirements of each stage.
286 */
287 unsigned total_needs = push_constant_chunks +
288 vs_chunks + hs_chunks + ds_chunks + gs_chunks;
289 assert(total_needs <= urb_chunks);
290
291 /* Mete out remaining space (if any) in proportion to "wants". */
292 unsigned total_wants = vs_wants + hs_wants + ds_wants + gs_wants;
293 unsigned remaining_space = urb_chunks - total_needs;
294 if (remaining_space > total_wants)
295 remaining_space = total_wants;
296 if (remaining_space > 0) {
297 unsigned vs_additional = (unsigned)
298 roundf(vs_wants * (((float) remaining_space) / total_wants));
299 vs_chunks += vs_additional;
300 remaining_space -= vs_additional;
301 total_wants -= vs_wants;
302
303 if (total_wants > 0) {
304 unsigned hs_additional = (unsigned)
305 round(hs_wants * (((double) remaining_space) / total_wants));
306 hs_chunks += hs_additional;
307 remaining_space -= hs_additional;
308 total_wants -= hs_wants;
309 }
310
311 if (total_wants > 0) {
312 unsigned ds_additional = (unsigned)
313 round(ds_wants * (((double) remaining_space) / total_wants));
314 ds_chunks += ds_additional;
315 remaining_space -= ds_additional;
316 total_wants -= ds_wants;
317 }
318
319 gs_chunks += remaining_space;
320 }
321
322 /* Sanity check that we haven't over-allocated. */
323 assert(push_constant_chunks +
324 vs_chunks + hs_chunks + ds_chunks + gs_chunks <= urb_chunks);
325
326 /* Finally, compute the number of entries that can fit in the space
327 * allocated to each stage.
328 */
329 unsigned nr_vs_entries = vs_chunks * chunk_size_bytes / vs_entry_size_bytes;
330 unsigned nr_hs_entries = hs_chunks * chunk_size_bytes / hs_entry_size_bytes;
331 unsigned nr_ds_entries = ds_chunks * chunk_size_bytes / ds_entry_size_bytes;
332 unsigned nr_gs_entries = gs_chunks * chunk_size_bytes / gs_entry_size_bytes;
333
334 /* Since we rounded up when computing *_wants, this may be slightly more
335 * than the maximum allowed amount, so correct for that.
336 */
337 nr_vs_entries = MIN2(nr_vs_entries, brw->urb.max_vs_entries);
338 nr_hs_entries = MIN2(nr_hs_entries, brw->urb.max_hs_entries);
339 nr_ds_entries = MIN2(nr_ds_entries, brw->urb.max_ds_entries);
340 nr_gs_entries = MIN2(nr_gs_entries, brw->urb.max_gs_entries);
341
342 /* Ensure that we program a multiple of the granularity. */
343 nr_vs_entries = ROUND_DOWN_TO(nr_vs_entries, vs_granularity);
344 nr_hs_entries = ROUND_DOWN_TO(nr_hs_entries, hs_granularity);
345 nr_ds_entries = ROUND_DOWN_TO(nr_ds_entries, ds_granularity);
346 nr_gs_entries = ROUND_DOWN_TO(nr_gs_entries, gs_granularity);
347
348 /* Finally, sanity check to make sure we have at least the minimum number
349 * of entries needed for each stage.
350 */
351 assert(nr_vs_entries >= vs_min_entries);
352 if (gs_present)
353 assert(nr_gs_entries >= 2);
354 if (tess_present) {
355 assert(nr_hs_entries >= 1);
356 assert(nr_ds_entries >= devinfo->urb.min_ds_entries);
357 }
358
359 /* Gen7 doesn't actually use brw->urb.nr_{vs,gs}_entries, but it seems
360 * better to put reasonable data in there rather than leave them
361 * uninitialized.
362 */
363 brw->urb.nr_vs_entries = nr_vs_entries;
364 brw->urb.nr_hs_entries = nr_hs_entries;
365 brw->urb.nr_ds_entries = nr_ds_entries;
366 brw->urb.nr_gs_entries = nr_gs_entries;
367
368 /* Lay out the URB in the following order:
369 * - push constants
370 * - VS
371 * - HS
372 * - DS
373 * - GS
374 */
375 brw->urb.vs_start = push_constant_chunks;
376 brw->urb.hs_start = push_constant_chunks + vs_chunks;
377 brw->urb.ds_start = push_constant_chunks + vs_chunks + hs_chunks;
378 brw->urb.gs_start = push_constant_chunks + vs_chunks + hs_chunks +
379 ds_chunks;
380
381 if (brw->gen == 7 && !brw->is_haswell && !brw->is_baytrail)
382 gen7_emit_vs_workaround_flush(brw);
383 gen7_emit_urb_state(brw,
384 brw->urb.nr_vs_entries, vs_size, brw->urb.vs_start,
385 brw->urb.nr_hs_entries, hs_size, brw->urb.hs_start,
386 brw->urb.nr_ds_entries, ds_size, brw->urb.ds_start,
387 brw->urb.nr_gs_entries, gs_size, brw->urb.gs_start);
388 }
389
390 void
391 gen7_emit_urb_state(struct brw_context *brw,
392 unsigned nr_vs_entries,
393 unsigned vs_size, unsigned vs_start,
394 unsigned nr_hs_entries,
395 unsigned hs_size, unsigned hs_start,
396 unsigned nr_ds_entries,
397 unsigned ds_size, unsigned ds_start,
398 unsigned nr_gs_entries,
399 unsigned gs_size, unsigned gs_start)
400 {
401 BEGIN_BATCH(8);
402 OUT_BATCH(_3DSTATE_URB_VS << 16 | (2 - 2));
403 OUT_BATCH(nr_vs_entries |
404 ((vs_size - 1) << GEN7_URB_ENTRY_SIZE_SHIFT) |
405 (vs_start << GEN7_URB_STARTING_ADDRESS_SHIFT));
406
407 OUT_BATCH(_3DSTATE_URB_GS << 16 | (2 - 2));
408 OUT_BATCH(nr_gs_entries |
409 ((gs_size - 1) << GEN7_URB_ENTRY_SIZE_SHIFT) |
410 (gs_start << GEN7_URB_STARTING_ADDRESS_SHIFT));
411
412 OUT_BATCH(_3DSTATE_URB_HS << 16 | (2 - 2));
413 OUT_BATCH(nr_hs_entries |
414 ((hs_size - 1) << GEN7_URB_ENTRY_SIZE_SHIFT) |
415 (hs_start << GEN7_URB_STARTING_ADDRESS_SHIFT));
416
417 OUT_BATCH(_3DSTATE_URB_DS << 16 | (2 - 2));
418 OUT_BATCH(nr_ds_entries |
419 ((ds_size - 1) << GEN7_URB_ENTRY_SIZE_SHIFT) |
420 (ds_start << GEN7_URB_STARTING_ADDRESS_SHIFT));
421 ADVANCE_BATCH();
422 }
423
424 const struct brw_tracked_state gen7_urb = {
425 .dirty = {
426 .mesa = 0,
427 .brw = BRW_NEW_CONTEXT |
428 BRW_NEW_URB_SIZE |
429 BRW_NEW_GEOMETRY_PROGRAM |
430 BRW_NEW_TESS_PROGRAMS |
431 BRW_NEW_GS_PROG_DATA |
432 BRW_NEW_TCS_PROG_DATA |
433 BRW_NEW_TES_PROG_DATA |
434 BRW_NEW_VS_PROG_DATA,
435 },
436 .emit = gen7_upload_urb,
437 };