c37c110fa8e92d4b3997df258c3be585e4b08dfe
[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/FS/GS Push | VS/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 unsigned avail_size = 16;
64 unsigned multiplier = (brw->is_haswell && brw->gt == 3) ? 2 : 1;
65
66 /* BRW_NEW_GEOMETRY_PROGRAM */
67 bool gs_present = brw->geometry_program;
68
69 unsigned vs_size, gs_size;
70 if (gs_present) {
71 vs_size = avail_size / 3;
72 avail_size -= vs_size;
73 gs_size = avail_size / 2;
74 avail_size -= gs_size;
75 } else {
76 vs_size = avail_size / 2;
77 avail_size -= vs_size;
78 gs_size = 0;
79 }
80 unsigned fs_size = avail_size;
81
82 gen7_emit_push_constant_state(brw, multiplier * vs_size,
83 multiplier * gs_size, multiplier * fs_size);
84
85 /* From p115 of the Ivy Bridge PRM (3.2.1.4 3DSTATE_PUSH_CONSTANT_ALLOC_VS):
86 *
87 * Programming Restriction:
88 *
89 * The 3DSTATE_CONSTANT_VS must be reprogrammed prior to the next
90 * 3DPRIMITIVE command after programming the
91 * 3DSTATE_PUSH_CONSTANT_ALLOC_VS.
92 *
93 * Similar text exists for the other 3DSTATE_PUSH_CONSTANT_ALLOC_*
94 * commands.
95 */
96 brw->state.dirty.brw |= BRW_NEW_PUSH_CONSTANT_ALLOCATION;
97 }
98
99 void
100 gen7_emit_push_constant_state(struct brw_context *brw, unsigned vs_size,
101 unsigned gs_size, unsigned fs_size)
102 {
103 unsigned offset = 0;
104
105 BEGIN_BATCH(6);
106 OUT_BATCH(_3DSTATE_PUSH_CONSTANT_ALLOC_VS << 16 | (2 - 2));
107 OUT_BATCH(vs_size | offset << GEN7_PUSH_CONSTANT_BUFFER_OFFSET_SHIFT);
108 offset += vs_size;
109
110 OUT_BATCH(_3DSTATE_PUSH_CONSTANT_ALLOC_GS << 16 | (2 - 2));
111 OUT_BATCH(gs_size | offset << GEN7_PUSH_CONSTANT_BUFFER_OFFSET_SHIFT);
112 offset += gs_size;
113
114 OUT_BATCH(_3DSTATE_PUSH_CONSTANT_ALLOC_PS << 16 | (2 - 2));
115 OUT_BATCH(fs_size | offset << GEN7_PUSH_CONSTANT_BUFFER_OFFSET_SHIFT);
116 ADVANCE_BATCH();
117
118 /* From p292 of the Ivy Bridge PRM (11.2.4 3DSTATE_PUSH_CONSTANT_ALLOC_PS):
119 *
120 * A PIPE_CONTOL command with the CS Stall bit set must be programmed
121 * in the ring after this instruction.
122 *
123 * No such restriction exists for Haswell.
124 */
125 if (brw->gen < 8 && !brw->is_haswell)
126 gen7_emit_cs_stall_flush(brw);
127 }
128
129 const struct brw_tracked_state gen7_push_constant_space = {
130 .dirty = {
131 .mesa = 0,
132 .brw = BRW_NEW_CONTEXT | BRW_NEW_GEOMETRY_PROGRAM,
133 .cache = 0,
134 },
135 .emit = gen7_allocate_push_constants,
136 };
137
138 static void
139 gen7_upload_urb(struct brw_context *brw)
140 {
141 const int push_size_kB = brw->is_haswell && brw->gt == 3 ? 32 : 16;
142
143 /* CACHE_NEW_VS_PROG */
144 unsigned vs_size = MAX2(brw->vs.prog_data->base.urb_entry_size, 1);
145 unsigned vs_entry_size_bytes = vs_size * 64;
146 /* BRW_NEW_GEOMETRY_PROGRAM, CACHE_NEW_GS_PROG */
147 bool gs_present = brw->geometry_program;
148 unsigned gs_size = gs_present ? brw->gs.prog_data->base.urb_entry_size : 1;
149 unsigned gs_entry_size_bytes = gs_size * 64;
150
151 /* From p35 of the Ivy Bridge PRM (section 1.7.1: 3DSTATE_URB_GS):
152 *
153 * VS Number of URB Entries must be divisible by 8 if the VS URB Entry
154 * Allocation Size is less than 9 512-bit URB entries.
155 *
156 * Similar text exists for GS.
157 */
158 unsigned vs_granularity = (vs_size < 9) ? 8 : 1;
159 unsigned gs_granularity = (gs_size < 9) ? 8 : 1;
160
161 /* URB allocations must be done in 8k chunks. */
162 unsigned chunk_size_bytes = 8192;
163
164 /* Determine the size of the URB in chunks.
165 */
166 unsigned urb_chunks = brw->urb.size * 1024 / chunk_size_bytes;
167
168 /* Reserve space for push constants */
169 unsigned push_constant_bytes = 1024 * push_size_kB;
170 unsigned push_constant_chunks =
171 push_constant_bytes / chunk_size_bytes;
172
173 /* Initially, assign each stage the minimum amount of URB space it needs,
174 * and make a note of how much additional space it "wants" (the amount of
175 * additional space it could actually make use of).
176 */
177
178 /* VS has a lower limit on the number of URB entries */
179 unsigned vs_chunks =
180 ALIGN(brw->urb.min_vs_entries * vs_entry_size_bytes, chunk_size_bytes) /
181 chunk_size_bytes;
182 unsigned vs_wants =
183 ALIGN(brw->urb.max_vs_entries * vs_entry_size_bytes,
184 chunk_size_bytes) / chunk_size_bytes - vs_chunks;
185
186 unsigned gs_chunks = 0;
187 unsigned gs_wants = 0;
188 if (gs_present) {
189 /* There are two constraints on the minimum amount of URB space we can
190 * allocate:
191 *
192 * (1) We need room for at least 2 URB entries, since we always operate
193 * the GS in DUAL_OBJECT mode.
194 *
195 * (2) We can't allocate less than nr_gs_entries_granularity.
196 */
197 gs_chunks = ALIGN(MAX2(gs_granularity, 2) * gs_entry_size_bytes,
198 chunk_size_bytes) / chunk_size_bytes;
199 gs_wants =
200 ALIGN(brw->urb.max_gs_entries * gs_entry_size_bytes,
201 chunk_size_bytes) / chunk_size_bytes - gs_chunks;
202 }
203
204 /* There should always be enough URB space to satisfy the minimum
205 * requirements of each stage.
206 */
207 unsigned total_needs = push_constant_chunks + vs_chunks + gs_chunks;
208 assert(total_needs <= urb_chunks);
209
210 /* Mete out remaining space (if any) in proportion to "wants". */
211 unsigned total_wants = vs_wants + gs_wants;
212 unsigned remaining_space = urb_chunks - total_needs;
213 if (remaining_space > total_wants)
214 remaining_space = total_wants;
215 if (remaining_space > 0) {
216 unsigned vs_additional = (unsigned)
217 round(vs_wants * (((double) remaining_space) / total_wants));
218 vs_chunks += vs_additional;
219 remaining_space -= vs_additional;
220 gs_chunks += remaining_space;
221 }
222
223 /* Sanity check that we haven't over-allocated. */
224 assert(push_constant_chunks + vs_chunks + gs_chunks <= urb_chunks);
225
226 /* Finally, compute the number of entries that can fit in the space
227 * allocated to each stage.
228 */
229 unsigned nr_vs_entries = vs_chunks * chunk_size_bytes / vs_entry_size_bytes;
230 unsigned nr_gs_entries = gs_chunks * chunk_size_bytes / gs_entry_size_bytes;
231
232 /* Since we rounded up when computing *_wants, this may be slightly more
233 * than the maximum allowed amount, so correct for that.
234 */
235 nr_vs_entries = MIN2(nr_vs_entries, brw->urb.max_vs_entries);
236 nr_gs_entries = MIN2(nr_gs_entries, brw->urb.max_gs_entries);
237
238 /* Ensure that we program a multiple of the granularity. */
239 nr_vs_entries = ROUND_DOWN_TO(nr_vs_entries, vs_granularity);
240 nr_gs_entries = ROUND_DOWN_TO(nr_gs_entries, gs_granularity);
241
242 /* Finally, sanity check to make sure we have at least the minimum number
243 * of entries needed for each stage.
244 */
245 assert(nr_vs_entries >= brw->urb.min_vs_entries);
246 if (gs_present)
247 assert(nr_gs_entries >= 2);
248
249 /* Gen7 doesn't actually use brw->urb.nr_{vs,gs}_entries, but it seems
250 * better to put reasonable data in there rather than leave them
251 * uninitialized.
252 */
253 brw->urb.nr_vs_entries = nr_vs_entries;
254 brw->urb.nr_gs_entries = nr_gs_entries;
255
256 /* Lay out the URB in the following order:
257 * - push constants
258 * - VS
259 * - GS
260 */
261 brw->urb.vs_start = push_constant_chunks;
262 brw->urb.gs_start = push_constant_chunks + vs_chunks;
263
264 gen7_emit_vs_workaround_flush(brw);
265 gen7_emit_urb_state(brw,
266 brw->urb.nr_vs_entries, vs_size, brw->urb.vs_start,
267 brw->urb.nr_gs_entries, gs_size, brw->urb.gs_start);
268 }
269
270 void
271 gen7_emit_urb_state(struct brw_context *brw,
272 unsigned nr_vs_entries, unsigned vs_size,
273 unsigned vs_start, unsigned nr_gs_entries,
274 unsigned gs_size, unsigned gs_start)
275 {
276 BEGIN_BATCH(8);
277 OUT_BATCH(_3DSTATE_URB_VS << 16 | (2 - 2));
278 OUT_BATCH(nr_vs_entries |
279 ((vs_size - 1) << GEN7_URB_ENTRY_SIZE_SHIFT) |
280 (vs_start << GEN7_URB_STARTING_ADDRESS_SHIFT));
281
282 OUT_BATCH(_3DSTATE_URB_GS << 16 | (2 - 2));
283 OUT_BATCH(nr_gs_entries |
284 ((gs_size - 1) << GEN7_URB_ENTRY_SIZE_SHIFT) |
285 (gs_start << GEN7_URB_STARTING_ADDRESS_SHIFT));
286
287 /* Allocate the HS and DS zero space - we don't use them. */
288 OUT_BATCH(_3DSTATE_URB_HS << 16 | (2 - 2));
289 OUT_BATCH((0 << GEN7_URB_ENTRY_SIZE_SHIFT) |
290 (vs_start << GEN7_URB_STARTING_ADDRESS_SHIFT));
291
292 OUT_BATCH(_3DSTATE_URB_DS << 16 | (2 - 2));
293 OUT_BATCH((0 << GEN7_URB_ENTRY_SIZE_SHIFT) |
294 (vs_start << GEN7_URB_STARTING_ADDRESS_SHIFT));
295 ADVANCE_BATCH();
296 }
297
298 const struct brw_tracked_state gen7_urb = {
299 .dirty = {
300 .mesa = 0,
301 .brw = BRW_NEW_CONTEXT | BRW_NEW_GEOMETRY_PROGRAM,
302 .cache = (CACHE_NEW_VS_PROG | CACHE_NEW_GS_PROG),
303 },
304 .emit = gen7_upload_urb,
305 };