2 * Copyright © 2012 Intel Corporation
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:
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
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
24 #include "ir_builder.h"
25 #include "program/prog_instruction.h"
27 using namespace ir_builder
;
29 namespace ir_builder
{
32 ir_factory::emit(ir_instruction
*ir
)
34 instructions
->push_tail(ir
);
38 ir_factory::make_temp(const glsl_type
*type
, const char *name
)
42 var
= new(mem_ctx
) ir_variable(type
, name
, ir_var_temporary
);
49 assign(deref lhs
, operand rhs
, operand condition
, int writemask
)
51 void *mem_ctx
= ralloc_parent(lhs
.val
);
53 ir_assignment
*assign
= new(mem_ctx
) ir_assignment(lhs
.val
,
62 assign(deref lhs
, operand rhs
)
64 return assign(lhs
, rhs
, (1 << lhs
.val
->type
->vector_elements
) - 1);
68 assign(deref lhs
, operand rhs
, int writemask
)
70 return assign(lhs
, rhs
, (ir_rvalue
*) NULL
, writemask
);
74 assign(deref lhs
, operand rhs
, operand condition
)
76 return assign(lhs
, rhs
, condition
, (1 << lhs
.val
->type
->vector_elements
) - 1);
82 void *mem_ctx
= ralloc_parent(retval
.val
);
83 return new(mem_ctx
) ir_return(retval
.val
);
87 swizzle(operand a
, int swizzle
, int components
)
89 void *mem_ctx
= ralloc_parent(a
.val
);
91 return new(mem_ctx
) ir_swizzle(a
.val
,
100 swizzle_for_size(operand a
, unsigned components
)
102 void *mem_ctx
= ralloc_parent(a
.val
);
104 if (a
.val
->type
->vector_elements
< components
)
105 components
= a
.val
->type
->vector_elements
;
107 unsigned s
[4] = { 0, 1, 2, 3 };
108 for (int i
= components
; i
< 4; i
++)
109 s
[i
] = components
- 1;
111 return new(mem_ctx
) ir_swizzle(a
.val
, s
, components
);
115 swizzle_xxxx(operand a
)
117 return swizzle(a
, SWIZZLE_XXXX
, 4);
121 swizzle_yyyy(operand a
)
123 return swizzle(a
, SWIZZLE_YYYY
, 4);
127 swizzle_zzzz(operand a
)
129 return swizzle(a
, SWIZZLE_ZZZZ
, 4);
133 swizzle_wwww(operand a
)
135 return swizzle(a
, SWIZZLE_WWWW
, 4);
141 return swizzle(a
, SWIZZLE_XXXX
, 1);
147 return swizzle(a
, SWIZZLE_YYYY
, 1);
153 return swizzle(a
, SWIZZLE_ZZZZ
, 1);
159 return swizzle(a
, SWIZZLE_WWWW
, 1);
163 swizzle_xy(operand a
)
165 return swizzle(a
, SWIZZLE_XYZW
, 2);
169 swizzle_xyz(operand a
)
171 return swizzle(a
, SWIZZLE_XYZW
, 3);
175 swizzle_xyzw(operand a
)
177 return swizzle(a
, SWIZZLE_XYZW
, 4);
181 expr(ir_expression_operation op
, operand a
)
183 void *mem_ctx
= ralloc_parent(a
.val
);
185 return new(mem_ctx
) ir_expression(op
, a
.val
);
189 expr(ir_expression_operation op
, operand a
, operand b
)
191 void *mem_ctx
= ralloc_parent(a
.val
);
193 return new(mem_ctx
) ir_expression(op
, a
.val
, b
.val
);
197 expr(ir_expression_operation op
, operand a
, operand b
, operand c
)
199 void *mem_ctx
= ralloc_parent(a
.val
);
201 return new(mem_ctx
) ir_expression(op
, a
.val
, b
.val
, c
.val
);
204 ir_expression
*add(operand a
, operand b
)
206 return expr(ir_binop_add
, a
, b
);
209 ir_expression
*sub(operand a
, operand b
)
211 return expr(ir_binop_sub
, a
, b
);
214 ir_expression
*min2(operand a
, operand b
)
216 return expr(ir_binop_min
, a
, b
);
219 ir_expression
*max2(operand a
, operand b
)
221 return expr(ir_binop_max
, a
, b
);
224 ir_expression
*mul(operand a
, operand b
)
226 return expr(ir_binop_mul
, a
, b
);
229 ir_expression
*imul_high(operand a
, operand b
)
231 return expr(ir_binop_imul_high
, a
, b
);
234 ir_expression
*div(operand a
, operand b
)
236 return expr(ir_binop_div
, a
, b
);
239 ir_expression
*carry(operand a
, operand b
)
241 return expr(ir_binop_carry
, a
, b
);
244 ir_expression
*borrow(operand a
, operand b
)
246 return expr(ir_binop_borrow
, a
, b
);
249 ir_expression
*trunc(operand a
)
251 return expr(ir_unop_trunc
, a
);
254 ir_expression
*round_even(operand a
)
256 return expr(ir_unop_round_even
, a
);
259 ir_expression
*fract(operand a
)
261 return expr(ir_unop_fract
, a
);
264 /* dot for vectors, mul for scalars */
265 ir_expression
*dot(operand a
, operand b
)
267 assert(a
.val
->type
== b
.val
->type
);
269 if (a
.val
->type
->vector_elements
== 1)
270 return expr(ir_binop_mul
, a
, b
);
272 return expr(ir_binop_dot
, a
, b
);
276 clamp(operand a
, operand b
, operand c
)
278 return expr(ir_binop_min
, expr(ir_binop_max
, a
, b
), c
);
284 return expr(ir_unop_saturate
, a
);
290 return expr(ir_unop_abs
, a
);
296 return expr(ir_unop_neg
, a
);
302 return expr(ir_unop_sin
, a
);
308 return expr(ir_unop_cos
, a
);
314 return expr(ir_unop_exp
, a
);
320 return expr(ir_unop_rsq
, a
);
326 return expr(ir_unop_sqrt
, a
);
332 return expr(ir_unop_log
, a
);
338 return expr(ir_unop_sign
, a
);
342 equal(operand a
, operand b
)
344 return expr(ir_binop_equal
, a
, b
);
348 nequal(operand a
, operand b
)
350 return expr(ir_binop_nequal
, a
, b
);
354 less(operand a
, operand b
)
356 return expr(ir_binop_less
, a
, b
);
360 greater(operand a
, operand b
)
362 return expr(ir_binop_greater
, a
, b
);
366 lequal(operand a
, operand b
)
368 return expr(ir_binop_lequal
, a
, b
);
372 gequal(operand a
, operand b
)
374 return expr(ir_binop_gequal
, a
, b
);
380 return expr(ir_unop_logic_not
, a
);
384 logic_and(operand a
, operand b
)
386 return expr(ir_binop_logic_and
, a
, b
);
390 logic_or(operand a
, operand b
)
392 return expr(ir_binop_logic_or
, a
, b
);
398 return expr(ir_unop_bit_not
, a
);
402 bit_and(operand a
, operand b
)
404 return expr(ir_binop_bit_and
, a
, b
);
408 bit_or(operand a
, operand b
)
410 return expr(ir_binop_bit_or
, a
, b
);
414 lshift(operand a
, operand b
)
416 return expr(ir_binop_lshift
, a
, b
);
420 rshift(operand a
, operand b
)
422 return expr(ir_binop_rshift
, a
, b
);
428 return expr(ir_unop_f2i
, a
);
432 bitcast_f2i(operand a
)
434 return expr(ir_unop_bitcast_f2i
, a
);
440 return expr(ir_unop_i2f
, a
);
444 bitcast_i2f(operand a
)
446 return expr(ir_unop_bitcast_i2f
, a
);
452 return expr(ir_unop_i2u
, a
);
458 return expr(ir_unop_u2i
, a
);
464 return expr(ir_unop_f2u
, a
);
468 bitcast_f2u(operand a
)
470 return expr(ir_unop_bitcast_f2u
, a
);
476 return expr(ir_unop_u2f
, a
);
480 bitcast_u2f(operand a
)
482 return expr(ir_unop_bitcast_u2f
, a
);
488 return expr(ir_unop_i2b
, a
);
494 return expr(ir_unop_b2i
, a
);
500 return expr(ir_unop_f2b
, a
);
506 return expr(ir_unop_b2f
, a
);
510 interpolate_at_centroid(operand a
)
512 return expr(ir_unop_interpolate_at_centroid
, a
);
516 interpolate_at_offset(operand a
, operand b
)
518 return expr(ir_binop_interpolate_at_offset
, a
, b
);
522 interpolate_at_sample(operand a
, operand b
)
524 return expr(ir_binop_interpolate_at_sample
, a
, b
);
530 return expr(ir_unop_f2d
, a
);
536 return expr(ir_unop_i2d
, a
);
542 return expr(ir_unop_u2d
, a
);
546 fma(operand a
, operand b
, operand c
)
548 return expr(ir_triop_fma
, a
, b
, c
);
552 lrp(operand x
, operand y
, operand a
)
554 return expr(ir_triop_lrp
, x
, y
, a
);
558 csel(operand a
, operand b
, operand c
)
560 return expr(ir_triop_csel
, a
, b
, c
);
564 bitfield_insert(operand a
, operand b
, operand c
, operand d
)
566 void *mem_ctx
= ralloc_parent(a
.val
);
567 return new(mem_ctx
) ir_expression(ir_quadop_bitfield_insert
,
568 a
.val
->type
, a
.val
, b
.val
, c
.val
, d
.val
);
572 if_tree(operand condition
,
573 ir_instruction
*then_branch
)
575 assert(then_branch
!= NULL
);
577 void *mem_ctx
= ralloc_parent(condition
.val
);
579 ir_if
*result
= new(mem_ctx
) ir_if(condition
.val
);
580 result
->then_instructions
.push_tail(then_branch
);
585 if_tree(operand condition
,
586 ir_instruction
*then_branch
,
587 ir_instruction
*else_branch
)
589 assert(then_branch
!= NULL
);
590 assert(else_branch
!= NULL
);
592 void *mem_ctx
= ralloc_parent(condition
.val
);
594 ir_if
*result
= new(mem_ctx
) ir_if(condition
.val
);
595 result
->then_instructions
.push_tail(then_branch
);
596 result
->else_instructions
.push_tail(else_branch
);
600 } /* namespace ir_builder */