1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
|
/**************************************************************************
*
* Copyright 2009 VMware, Inc.
* Copyright 2007-2008 VMware, Inc.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sub license, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial portions
* of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
* IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
#include "util/u_memory.h"
#include "lp_bld_type.h"
#include "lp_bld_init.h"
#include "lp_bld_flow.h"
#include "lp_bld_ir_common.h"
#include "lp_bld_logic.h"
/*
* Return the context for the current function.
* (always 'main', if shader doesn't do any function calls)
*/
static inline struct function_ctx *
func_ctx(struct lp_exec_mask *mask)
{
assert(mask->function_stack_size > 0);
assert(mask->function_stack_size <= LP_MAX_NUM_FUNCS);
return &mask->function_stack[mask->function_stack_size - 1];
}
/*
* Returns true if we're in a loop.
* It's global, meaning that it returns true even if there's
* no loop inside the current function, but we were inside
* a loop inside another function, from which this one was called.
*/
static inline boolean
mask_has_loop(struct lp_exec_mask *mask)
{
int i;
for (i = mask->function_stack_size - 1; i >= 0; --i) {
const struct function_ctx *ctx = &mask->function_stack[i];
if (ctx->loop_stack_size > 0)
return TRUE;
}
return FALSE;
}
/*
* Returns true if we're inside a switch statement.
* It's global, meaning that it returns true even if there's
* no switch in the current function, but we were inside
* a switch inside another function, from which this one was called.
*/
static inline boolean
mask_has_switch(struct lp_exec_mask *mask)
{
int i;
for (i = mask->function_stack_size - 1; i >= 0; --i) {
const struct function_ctx *ctx = &mask->function_stack[i];
if (ctx->switch_stack_size > 0)
return TRUE;
}
return FALSE;
}
/*
* Returns true if we're inside a conditional.
* It's global, meaning that it returns true even if there's
* no conditional in the current function, but we were inside
* a conditional inside another function, from which this one was called.
*/
static inline boolean
mask_has_cond(struct lp_exec_mask *mask)
{
int i;
for (i = mask->function_stack_size - 1; i >= 0; --i) {
const struct function_ctx *ctx = &mask->function_stack[i];
if (ctx->cond_stack_size > 0)
return TRUE;
}
return FALSE;
}
void lp_exec_mask_update(struct lp_exec_mask *mask)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
boolean has_loop_mask = mask_has_loop(mask);
boolean has_cond_mask = mask_has_cond(mask);
boolean has_switch_mask = mask_has_switch(mask);
boolean has_ret_mask = mask->function_stack_size > 1 ||
mask->ret_in_main;
if (has_loop_mask) {
/*for loops we need to update the entire mask at runtime */
LLVMValueRef tmp;
assert(mask->break_mask);
tmp = LLVMBuildAnd(builder,
mask->cont_mask,
mask->break_mask,
"maskcb");
mask->exec_mask = LLVMBuildAnd(builder,
mask->cond_mask,
tmp,
"maskfull");
} else
mask->exec_mask = mask->cond_mask;
if (has_switch_mask) {
mask->exec_mask = LLVMBuildAnd(builder,
mask->exec_mask,
mask->switch_mask,
"switchmask");
}
if (has_ret_mask) {
mask->exec_mask = LLVMBuildAnd(builder,
mask->exec_mask,
mask->ret_mask,
"callmask");
}
mask->has_mask = (has_cond_mask ||
has_loop_mask ||
has_switch_mask ||
has_ret_mask);
}
/*
* Initialize a function context at the specified index.
*/
void
lp_exec_mask_function_init(struct lp_exec_mask *mask, int function_idx)
{
LLVMTypeRef int_type = LLVMInt32TypeInContext(mask->bld->gallivm->context);
LLVMBuilderRef builder = mask->bld->gallivm->builder;
struct function_ctx *ctx = &mask->function_stack[function_idx];
ctx->cond_stack_size = 0;
ctx->loop_stack_size = 0;
ctx->bgnloop_stack_size = 0;
ctx->switch_stack_size = 0;
if (function_idx == 0) {
ctx->ret_mask = mask->ret_mask;
}
ctx->loop_limiter = lp_build_alloca(mask->bld->gallivm,
int_type, "looplimiter");
LLVMBuildStore(
builder,
LLVMConstInt(int_type, LP_MAX_TGSI_LOOP_ITERATIONS, false),
ctx->loop_limiter);
}
void lp_exec_mask_init(struct lp_exec_mask *mask, struct lp_build_context *bld)
{
mask->bld = bld;
mask->has_mask = FALSE;
mask->ret_in_main = FALSE;
/* For the main function */
mask->function_stack_size = 1;
mask->int_vec_type = lp_build_int_vec_type(bld->gallivm, mask->bld->type);
mask->exec_mask = mask->ret_mask = mask->break_mask = mask->cont_mask =
mask->cond_mask = mask->switch_mask =
LLVMConstAllOnes(mask->int_vec_type);
mask->function_stack = CALLOC(LP_MAX_NUM_FUNCS,
sizeof(mask->function_stack[0]));
lp_exec_mask_function_init(mask, 0);
}
void
lp_exec_mask_fini(struct lp_exec_mask *mask)
{
FREE(mask->function_stack);
}
/* stores val into an address pointed to by dst_ptr.
* mask->exec_mask is used to figure out which bits of val
* should be stored into the address
* (0 means don't store this bit, 1 means do store).
*/
void lp_exec_mask_store(struct lp_exec_mask *mask,
struct lp_build_context *bld_store,
LLVMValueRef val,
LLVMValueRef dst_ptr)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
LLVMValueRef exec_mask = mask->has_mask ? mask->exec_mask : NULL;
assert(lp_check_value(bld_store->type, val));
assert(LLVMGetTypeKind(LLVMTypeOf(dst_ptr)) == LLVMPointerTypeKind);
assert(LLVMGetElementType(LLVMTypeOf(dst_ptr)) == LLVMTypeOf(val) ||
LLVMGetTypeKind(LLVMGetElementType(LLVMTypeOf(dst_ptr))) == LLVMArrayTypeKind);
if (exec_mask) {
LLVMValueRef res, dst;
dst = LLVMBuildLoad(builder, dst_ptr, "");
res = lp_build_select(bld_store, exec_mask, val, dst);
LLVMBuildStore(builder, res, dst_ptr);
} else
LLVMBuildStore(builder, val, dst_ptr);
}
void lp_exec_bgnloop_post_phi(struct lp_exec_mask *mask)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
struct function_ctx *ctx = func_ctx(mask);
if (ctx->loop_stack_size != ctx->bgnloop_stack_size) {
mask->break_mask = LLVMBuildLoad(builder, ctx->break_var, "");
lp_exec_mask_update(mask);
ctx->bgnloop_stack_size = ctx->loop_stack_size;
}
}
void lp_exec_bgnloop(struct lp_exec_mask *mask, bool load)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
struct function_ctx *ctx = func_ctx(mask);
if (ctx->loop_stack_size >= LP_MAX_TGSI_NESTING) {
++ctx->loop_stack_size;
return;
}
ctx->break_type_stack[ctx->loop_stack_size + ctx->switch_stack_size] =
ctx->break_type;
ctx->break_type = LP_EXEC_MASK_BREAK_TYPE_LOOP;
ctx->loop_stack[ctx->loop_stack_size].loop_block = ctx->loop_block;
ctx->loop_stack[ctx->loop_stack_size].cont_mask = mask->cont_mask;
ctx->loop_stack[ctx->loop_stack_size].break_mask = mask->break_mask;
ctx->loop_stack[ctx->loop_stack_size].break_var = ctx->break_var;
++ctx->loop_stack_size;
ctx->break_var = lp_build_alloca(mask->bld->gallivm, mask->int_vec_type, "");
LLVMBuildStore(builder, mask->break_mask, ctx->break_var);
ctx->loop_block = lp_build_insert_new_block(mask->bld->gallivm, "bgnloop");
LLVMBuildBr(builder, ctx->loop_block);
LLVMPositionBuilderAtEnd(builder, ctx->loop_block);
if (load) {
lp_exec_bgnloop_post_phi(mask);
}
}
void lp_exec_endloop(struct gallivm_state *gallivm,
struct lp_exec_mask *mask)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
struct function_ctx *ctx = func_ctx(mask);
LLVMBasicBlockRef endloop;
LLVMTypeRef int_type = LLVMInt32TypeInContext(mask->bld->gallivm->context);
LLVMTypeRef reg_type = LLVMIntTypeInContext(gallivm->context,
mask->bld->type.width *
mask->bld->type.length);
LLVMValueRef i1cond, i2cond, icond, limiter;
assert(mask->break_mask);
assert(ctx->loop_stack_size);
if (ctx->loop_stack_size > LP_MAX_TGSI_NESTING) {
--ctx->loop_stack_size;
--ctx->bgnloop_stack_size;
return;
}
/*
* Restore the cont_mask, but don't pop
*/
mask->cont_mask = ctx->loop_stack[ctx->loop_stack_size - 1].cont_mask;
lp_exec_mask_update(mask);
/*
* Unlike the continue mask, the break_mask must be preserved across loop
* iterations
*/
LLVMBuildStore(builder, mask->break_mask, ctx->break_var);
/* Decrement the loop limiter */
limiter = LLVMBuildLoad(builder, ctx->loop_limiter, "");
limiter = LLVMBuildSub(
builder,
limiter,
LLVMConstInt(int_type, 1, false),
"");
LLVMBuildStore(builder, limiter, ctx->loop_limiter);
/* i1cond = (mask != 0) */
i1cond = LLVMBuildICmp(
builder,
LLVMIntNE,
LLVMBuildBitCast(builder, mask->exec_mask, reg_type, ""),
LLVMConstNull(reg_type), "i1cond");
/* i2cond = (looplimiter > 0) */
i2cond = LLVMBuildICmp(
builder,
LLVMIntSGT,
limiter,
LLVMConstNull(int_type), "i2cond");
/* if( i1cond && i2cond ) */
icond = LLVMBuildAnd(builder, i1cond, i2cond, "");
endloop = lp_build_insert_new_block(mask->bld->gallivm, "endloop");
LLVMBuildCondBr(builder,
icond, ctx->loop_block, endloop);
LLVMPositionBuilderAtEnd(builder, endloop);
assert(ctx->loop_stack_size);
--ctx->loop_stack_size;
--ctx->bgnloop_stack_size;
mask->cont_mask = ctx->loop_stack[ctx->loop_stack_size].cont_mask;
mask->break_mask = ctx->loop_stack[ctx->loop_stack_size].break_mask;
ctx->loop_block = ctx->loop_stack[ctx->loop_stack_size].loop_block;
ctx->break_var = ctx->loop_stack[ctx->loop_stack_size].break_var;
ctx->break_type = ctx->break_type_stack[ctx->loop_stack_size +
ctx->switch_stack_size];
lp_exec_mask_update(mask);
}
void lp_exec_mask_cond_push(struct lp_exec_mask *mask,
LLVMValueRef val)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
struct function_ctx *ctx = func_ctx(mask);
if (ctx->cond_stack_size >= LP_MAX_TGSI_NESTING) {
ctx->cond_stack_size++;
return;
}
if (ctx->cond_stack_size == 0 && mask->function_stack_size == 1) {
assert(mask->cond_mask == LLVMConstAllOnes(mask->int_vec_type));
}
ctx->cond_stack[ctx->cond_stack_size++] = mask->cond_mask;
assert(LLVMTypeOf(val) == mask->int_vec_type);
mask->cond_mask = LLVMBuildAnd(builder,
mask->cond_mask,
val,
"");
lp_exec_mask_update(mask);
}
void lp_exec_mask_cond_invert(struct lp_exec_mask *mask)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
struct function_ctx *ctx = func_ctx(mask);
LLVMValueRef prev_mask;
LLVMValueRef inv_mask;
assert(ctx->cond_stack_size);
if (ctx->cond_stack_size >= LP_MAX_TGSI_NESTING)
return;
prev_mask = ctx->cond_stack[ctx->cond_stack_size - 1];
if (ctx->cond_stack_size == 1 && mask->function_stack_size == 1) {
assert(prev_mask == LLVMConstAllOnes(mask->int_vec_type));
}
inv_mask = LLVMBuildNot(builder, mask->cond_mask, "");
mask->cond_mask = LLVMBuildAnd(builder,
inv_mask,
prev_mask, "");
lp_exec_mask_update(mask);
}
void lp_exec_mask_cond_pop(struct lp_exec_mask *mask)
{
struct function_ctx *ctx = func_ctx(mask);
assert(ctx->cond_stack_size);
--ctx->cond_stack_size;
if (ctx->cond_stack_size >= LP_MAX_TGSI_NESTING)
return;
mask->cond_mask = ctx->cond_stack[ctx->cond_stack_size];
lp_exec_mask_update(mask);
}
void lp_exec_continue(struct lp_exec_mask *mask)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
LLVMValueRef exec_mask = LLVMBuildNot(builder,
mask->exec_mask,
"");
mask->cont_mask = LLVMBuildAnd(builder,
mask->cont_mask,
exec_mask, "");
lp_exec_mask_update(mask);
}
void lp_exec_break(struct lp_exec_mask *mask, int *pc,
bool break_always)
{
LLVMBuilderRef builder = mask->bld->gallivm->builder;
struct function_ctx *ctx = func_ctx(mask);
if (ctx->break_type == LP_EXEC_MASK_BREAK_TYPE_LOOP) {
LLVMValueRef exec_mask = LLVMBuildNot(builder,
mask->exec_mask,
"break");
mask->break_mask = LLVMBuildAnd(builder,
mask->break_mask,
exec_mask, "break_full");
}
else {
if (ctx->switch_in_default) {
/*
* stop default execution but only if this is an unconditional switch.
* (The condition here is not perfect since dead code after break is
* allowed but should be sufficient since false negatives are just
* unoptimized - so we don't have to pre-evaluate that).
*/
if(break_always && ctx->switch_pc) {
if (pc)
*pc = ctx->switch_pc;
return;
}
}
if (break_always) {
mask->switch_mask = LLVMConstNull(mask->bld->int_vec_type);
}
else {
LLVMValueRef exec_mask = LLVMBuildNot(builder,
mask->exec_mask,
"break");
mask->switch_mask = LLVMBuildAnd(builder,
mask->switch_mask,
exec_mask, "break_switch");
}
}
lp_exec_mask_update(mask);
}
|