1 /**************************************************************************
3 * Copyright 2009 VMware, Inc.
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:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
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 VMWARE 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.
26 **************************************************************************/
29 * LLVM control flow build helpers.
31 * @author Jose Fonseca <jfonseca@vmware.com>
34 #include "util/u_debug.h"
35 #include "util/u_memory.h"
37 #include "lp_bld_init.h"
38 #include "lp_bld_type.h"
39 #include "lp_bld_flow.h"
43 * Insert a new block, right where builder is pointing to.
45 * This is useful important not only for aesthetic reasons, but also for
46 * performance reasons, as frequently run blocks should be laid out next to
47 * each other and fall-throughs maximized.
49 * See also llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp.
51 * Note: this function has no dependencies on the flow code and could
55 lp_build_insert_new_block(struct gallivm_state
*gallivm
, const char *name
)
57 LLVMBasicBlockRef current_block
;
58 LLVMBasicBlockRef next_block
;
59 LLVMBasicBlockRef new_block
;
61 /* get current basic block */
62 current_block
= LLVMGetInsertBlock(gallivm
->builder
);
64 /* check if there's another block after this one */
65 next_block
= LLVMGetNextBasicBlock(current_block
);
67 /* insert the new block before the next block */
68 new_block
= LLVMInsertBasicBlockInContext(gallivm
->context
, next_block
, name
);
71 /* append new block after current block */
72 LLVMValueRef function
= LLVMGetBasicBlockParent(current_block
);
73 new_block
= LLVMAppendBasicBlockInContext(gallivm
->context
, function
, name
);
81 * Begin a "skip" block. Inside this block we can test a condition and
82 * skip to the end of the block if the condition is false.
85 lp_build_flow_skip_begin(struct lp_build_skip_context
*skip
,
86 struct gallivm_state
*gallivm
)
88 skip
->gallivm
= gallivm
;
89 /* create new basic block */
90 skip
->block
= lp_build_insert_new_block(gallivm
, "skip");
95 * Insert code to test a condition and branch to the end of the current
96 * skip block if the condition is true.
99 lp_build_flow_skip_cond_break(struct lp_build_skip_context
*skip
,
102 LLVMBasicBlockRef new_block
;
104 new_block
= lp_build_insert_new_block(skip
->gallivm
, "");
106 /* if cond is true, goto skip->block, else goto new_block */
107 LLVMBuildCondBr(skip
->gallivm
->builder
, cond
, skip
->block
, new_block
);
109 LLVMPositionBuilderAtEnd(skip
->gallivm
->builder
, new_block
);
114 lp_build_flow_skip_end(struct lp_build_skip_context
*skip
)
117 LLVMBuildBr(skip
->gallivm
->builder
, skip
->block
);
118 LLVMPositionBuilderAtEnd(skip
->gallivm
->builder
, skip
->block
);
123 * Check if the mask predicate is zero. If so, jump to the end of the block.
126 lp_build_mask_check(struct lp_build_mask_context
*mask
)
128 LLVMBuilderRef builder
= mask
->skip
.gallivm
->builder
;
132 value
= lp_build_mask_value(mask
);
135 * XXX this doesn't quite generate the most efficient code possible, if
136 * the masks are vectors which have all bits set to the same value
138 * movmskps/pmovmskb would be more efficient to get the required value
139 * into ordinary reg (certainly with 8 floats).
140 * Not sure if llvm could figure that out on its own.
143 /* cond = (mask == 0) */
144 cond
= LLVMBuildICmp(builder
,
146 LLVMBuildBitCast(builder
, value
, mask
->reg_type
, ""),
147 LLVMConstNull(mask
->reg_type
),
150 /* if cond, goto end of block */
151 lp_build_flow_skip_cond_break(&mask
->skip
, cond
);
156 * Begin a section of code which is predicated on a mask.
157 * \param mask the mask context, initialized here
158 * \param flow the flow context
159 * \param type the type of the mask
160 * \param value storage for the mask
163 lp_build_mask_begin(struct lp_build_mask_context
*mask
,
164 struct gallivm_state
*gallivm
,
168 memset(mask
, 0, sizeof *mask
);
170 mask
->reg_type
= LLVMIntTypeInContext(gallivm
->context
, type
.width
* type
.length
);
171 mask
->var
= lp_build_alloca(gallivm
,
172 lp_build_int_vec_type(gallivm
, type
),
175 LLVMBuildStore(gallivm
->builder
, value
, mask
->var
);
177 lp_build_flow_skip_begin(&mask
->skip
, gallivm
);
182 lp_build_mask_value(struct lp_build_mask_context
*mask
)
184 return LLVMBuildLoad(mask
->skip
.gallivm
->builder
, mask
->var
, "");
189 * Update boolean mask with given value (bitwise AND).
190 * Typically used to update the quad's pixel alive/killed mask
191 * after depth testing, alpha testing, TGSI_OPCODE_KIL, etc.
194 lp_build_mask_update(struct lp_build_mask_context
*mask
,
197 value
= LLVMBuildAnd(mask
->skip
.gallivm
->builder
,
198 lp_build_mask_value(mask
),
200 LLVMBuildStore(mask
->skip
.gallivm
->builder
, value
, mask
->var
);
205 * End section of code which is predicated on a mask.
208 lp_build_mask_end(struct lp_build_mask_context
*mask
)
210 lp_build_flow_skip_end(&mask
->skip
);
211 return lp_build_mask_value(mask
);
217 lp_build_loop_begin(struct lp_build_loop_state
*state
,
218 struct gallivm_state
*gallivm
,
222 LLVMBuilderRef builder
= gallivm
->builder
;
224 state
->block
= lp_build_insert_new_block(gallivm
, "loop_begin");
226 state
->counter_var
= lp_build_alloca(gallivm
, LLVMTypeOf(start
), "loop_counter");
227 state
->gallivm
= gallivm
;
229 LLVMBuildStore(builder
, start
, state
->counter_var
);
231 LLVMBuildBr(builder
, state
->block
);
233 LLVMPositionBuilderAtEnd(builder
, state
->block
);
235 state
->counter
= LLVMBuildLoad(builder
, state
->counter_var
, "");
240 lp_build_loop_end_cond(struct lp_build_loop_state
*state
,
243 LLVMIntPredicate llvm_cond
)
245 LLVMBuilderRef builder
= state
->gallivm
->builder
;
248 LLVMBasicBlockRef after_block
;
251 step
= LLVMConstInt(LLVMTypeOf(end
), 1, 0);
253 next
= LLVMBuildAdd(builder
, state
->counter
, step
, "");
255 LLVMBuildStore(builder
, next
, state
->counter_var
);
257 cond
= LLVMBuildICmp(builder
, llvm_cond
, next
, end
, "");
259 after_block
= lp_build_insert_new_block(state
->gallivm
, "loop_end");
261 LLVMBuildCondBr(builder
, cond
, after_block
, state
->block
);
263 LLVMPositionBuilderAtEnd(builder
, after_block
);
265 state
->counter
= LLVMBuildLoad(builder
, state
->counter_var
, "");
270 lp_build_loop_end(struct lp_build_loop_state
*state
,
274 lp_build_loop_end_cond(state
, end
, step
, LLVMIntNE
);
278 * Creates a c-style for loop,
279 * contrasts lp_build_loop as this checks condition on entry
280 * e.g. for(i = start; i cmp_op end; i += step)
281 * \param state the for loop state, initialized here
282 * \param gallivm the gallivm state
283 * \param start starting value of iterator
284 * \param cmp_op comparison operator used for comparing current value with end value
285 * \param end value used to compare against iterator
286 * \param step value added to iterator at end of each loop
289 lp_build_for_loop_begin(struct lp_build_for_loop_state
*state
,
290 struct gallivm_state
*gallivm
,
292 LLVMIntPredicate cmp_op
,
296 LLVMBuilderRef builder
= gallivm
->builder
;
298 assert(LLVMTypeOf(start
) == LLVMTypeOf(end
));
299 assert(LLVMTypeOf(start
) == LLVMTypeOf(step
));
301 state
->begin
= lp_build_insert_new_block(gallivm
, "loop_begin");
303 state
->counter_var
= lp_build_alloca(gallivm
, LLVMTypeOf(start
), "loop_counter");
304 state
->gallivm
= gallivm
;
305 state
->cond
= cmp_op
;
308 LLVMBuildStore(builder
, start
, state
->counter_var
);
309 LLVMBuildBr(builder
, state
->begin
);
311 LLVMPositionBuilderAtEnd(builder
, state
->begin
);
312 state
->counter
= LLVMBuildLoad(builder
, state
->counter_var
, "");
314 state
->body
= lp_build_insert_new_block(gallivm
, "loop_body");
315 LLVMPositionBuilderAtEnd(builder
, state
->body
);
322 lp_build_for_loop_end(struct lp_build_for_loop_state
*state
)
324 LLVMValueRef next
, cond
;
325 LLVMBuilderRef builder
= state
->gallivm
->builder
;
327 next
= LLVMBuildAdd(builder
, state
->counter
, state
->step
, "");
328 LLVMBuildStore(builder
, next
, state
->counter_var
);
329 LLVMBuildBr(builder
, state
->begin
);
331 state
->exit
= lp_build_insert_new_block(state
->gallivm
, "loop_exit");
334 * We build the comparison for the begin block here,
335 * if we build it earlier the output llvm ir is not human readable
336 * as the code produced is not in the standard begin -> body -> end order.
338 LLVMPositionBuilderAtEnd(builder
, state
->begin
);
339 cond
= LLVMBuildICmp(builder
, state
->cond
, state
->counter
, state
->end
, "");
340 LLVMBuildCondBr(builder
, cond
, state
->body
, state
->exit
);
342 LLVMPositionBuilderAtEnd(builder
, state
->exit
);
347 Example of if/then/else building:
359 // x needs an alloca variable
360 x = lp_build_alloca(builder, type, "x");
363 lp_build_if(ctx, builder, cond);
364 LLVMBuildStore(LLVMBuildAdd(1, 2), x);
366 LLVMBuildStore(LLVMBuildAdd(2, 3). x);
374 * Begin an if/else/endif construct.
377 lp_build_if(struct lp_build_if_state
*ifthen
,
378 struct gallivm_state
*gallivm
,
379 LLVMValueRef condition
)
381 LLVMBasicBlockRef block
= LLVMGetInsertBlock(gallivm
->builder
);
383 memset(ifthen
, 0, sizeof *ifthen
);
384 ifthen
->gallivm
= gallivm
;
385 ifthen
->condition
= condition
;
386 ifthen
->entry_block
= block
;
388 /* create endif/merge basic block for the phi functions */
389 ifthen
->merge_block
= lp_build_insert_new_block(gallivm
, "endif-block");
391 /* create/insert true_block before merge_block */
393 LLVMInsertBasicBlockInContext(gallivm
->context
,
397 /* successive code goes into the true block */
398 LLVMPositionBuilderAtEnd(gallivm
->builder
, ifthen
->true_block
);
403 * Begin else-part of a conditional
406 lp_build_else(struct lp_build_if_state
*ifthen
)
408 LLVMBuilderRef builder
= ifthen
->gallivm
->builder
;
410 /* Append an unconditional Br(anch) instruction on the true_block */
411 LLVMBuildBr(builder
, ifthen
->merge_block
);
413 /* create/insert false_block before the merge block */
414 ifthen
->false_block
=
415 LLVMInsertBasicBlockInContext(ifthen
->gallivm
->context
,
419 /* successive code goes into the else block */
420 LLVMPositionBuilderAtEnd(builder
, ifthen
->false_block
);
428 lp_build_endif(struct lp_build_if_state
*ifthen
)
430 LLVMBuilderRef builder
= ifthen
->gallivm
->builder
;
432 /* Insert branch to the merge block from current block */
433 LLVMBuildBr(builder
, ifthen
->merge_block
);
436 * Now patch in the various branch instructions.
439 /* Insert the conditional branch instruction at the end of entry_block */
440 LLVMPositionBuilderAtEnd(builder
, ifthen
->entry_block
);
441 if (ifthen
->false_block
) {
442 /* we have an else clause */
443 LLVMBuildCondBr(builder
, ifthen
->condition
,
444 ifthen
->true_block
, ifthen
->false_block
);
448 LLVMBuildCondBr(builder
, ifthen
->condition
,
449 ifthen
->true_block
, ifthen
->merge_block
);
452 /* Resume building code at end of the ifthen->merge_block */
453 LLVMPositionBuilderAtEnd(builder
, ifthen
->merge_block
);
458 * Allocate a scalar (or vector) variable.
460 * Although not strictly part of control flow, control flow has deep impact in
461 * how variables should be allocated.
463 * The mem2reg optimization pass is the recommended way to dealing with mutable
464 * variables, and SSA. It looks for allocas and if it can handle them, it
465 * promotes them, but only looks for alloca instructions in the entry block of
466 * the function. Being in the entry block guarantees that the alloca is only
467 * executed once, which makes analysis simpler.
470 * - http://www.llvm.org/docs/tutorial/OCamlLangImpl7.html#memory
473 lp_build_alloca(struct gallivm_state
*gallivm
,
477 LLVMBuilderRef builder
= gallivm
->builder
;
478 LLVMBasicBlockRef current_block
= LLVMGetInsertBlock(builder
);
479 LLVMValueRef function
= LLVMGetBasicBlockParent(current_block
);
480 LLVMBasicBlockRef first_block
= LLVMGetEntryBasicBlock(function
);
481 LLVMValueRef first_instr
= LLVMGetFirstInstruction(first_block
);
482 LLVMBuilderRef first_builder
= LLVMCreateBuilderInContext(gallivm
->context
);
486 LLVMPositionBuilderBefore(first_builder
, first_instr
);
488 LLVMPositionBuilderAtEnd(first_builder
, first_block
);
491 res
= LLVMBuildAlloca(first_builder
, type
, name
);
492 LLVMBuildStore(builder
, LLVMConstNull(type
), res
);
494 LLVMDisposeBuilder(first_builder
);
501 * Allocate an array of scalars/vectors.
503 * mem2reg pass is not capable of promoting structs or arrays to registers, but
504 * we still put it in the first block anyway as failure to put allocas in the
505 * first block may prevent the X86 backend from successfully align the stack as
508 * Also the scalarrepl pass is supposedly more powerful and can promote
509 * arrays in many cases.
512 * - http://www.llvm.org/docs/tutorial/OCamlLangImpl7.html#memory
515 lp_build_array_alloca(struct gallivm_state
*gallivm
,
520 LLVMBuilderRef builder
= gallivm
->builder
;
521 LLVMBasicBlockRef current_block
= LLVMGetInsertBlock(builder
);
522 LLVMValueRef function
= LLVMGetBasicBlockParent(current_block
);
523 LLVMBasicBlockRef first_block
= LLVMGetEntryBasicBlock(function
);
524 LLVMValueRef first_instr
= LLVMGetFirstInstruction(first_block
);
525 LLVMBuilderRef first_builder
= LLVMCreateBuilderInContext(gallivm
->context
);
529 LLVMPositionBuilderBefore(first_builder
, first_instr
);
531 LLVMPositionBuilderAtEnd(first_builder
, first_block
);
534 res
= LLVMBuildArrayAlloca(first_builder
, type
, count
, name
);
536 LLVMDisposeBuilder(first_builder
);