| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| opt_constant_folding.cpp | 29 #include "ir.h"
53 virtual ir_visitor_status visit_enter(ir_assignment *ir);
54 virtual ir_visitor_status visit_enter(ir_call *ir);
92 ir_constant_folding_visitor::visit_enter(ir_assignment *ir)
94 ir->rhs->accept(this);
95 handle_rvalue(&ir->rhs);
97 if (ir->condition) {
98 ir->condition->accept(this);
99 handle_rvalue(&ir->condition);
101 ir_constant *const_val = ir->condition->as_constant()
[all...] |
| opt_dead_code_local.cpp | 36 #include "ir.h"
48 assignment_entry(ir_variable *lhs, ir_assignment *ir)
51 assert(ir);
53 this->ir = ir;
54 this->available = ir->write_mask;
58 ir_assignment *ir; member in class:__anon14994::assignment_entry
93 virtual ir_visitor_status visit(ir_dereference_variable *ir)
95 kill_channels(ir->var, ~0);
100 virtual ir_visitor_status visit(ir_swizzle *ir)
281 ir_instruction *ir, *ir_next; local
[all...] |
| lower_vec_index_to_cond_assign.cpp | 39 #include "ir.h"
68 ir_vec_index_to_cond_assign_visitor::convert_vec_index_to_cond_assign(ir_rvalue *ir)
70 ir_dereference_array *orig_deref = ir->as_dereference_array();
77 return ir;
81 return ir;
83 void *mem_ctx = ralloc_parent(ir);
99 var = new(base_ir) ir_variable(ir->type, "vec_index_tmp_v",
114 new(base_ir) ir_swizzle(cond_deref->clone(ir, NULL), i, 0, 0, 0, 1);
128 /* Put all of the new instructions in the IR stream before the old
138 ir_vec_index_to_cond_assign_visitor::visit_enter(ir_expression *ir)
[all...] |
| opt_if_simplification.cpp | 31 #include "ir.h"
54 ir_if_simplification_visitor::visit_enter(ir_assignment *ir)
56 (void) ir;
71 ir_if_simplification_visitor::visit_leave(ir_if *ir)
74 if (ir->then_instructions.is_empty() &&
75 ir->else_instructions.is_empty()) {
76 ir->remove();
86 ir_constant *condition_constant = ir->condition->constant_expression_value();
92 foreach_iter(exec_list_iterator, then_iter, ir->then_instructions) {
94 ir->insert_before(then_ir)
[all...] |
| ir_basic_block.cpp | 30 #include "ir.h"
38 * Basic block analysis is pretty easy in our IR thanks to the lack of
62 ir_instruction *ir = (ir_instruction *)iter.get(); local
68 leader = ir;
70 if ((ir_if = ir->as_if())) {
71 callback(leader, ir, data);
76 } else if ((ir_loop = ir->as_loop())) {
77 callback(leader, ir, data);
80 } else if (ir->as_return() || ir->as_call())
[all...] |
| test_optpass.cpp | 30 * glsl_test app. It accepts either GLSL or high-level IR as input,
32 * It outputs the IR, both before and after optimiations.
57 do_optimization(struct exec_list *ir, const char *optimization)
67 return do_common_optimization(ir, int_0 != 0, false, int_1);
69 return do_algebraic(ir);
71 return do_constant_folding(ir);
73 return do_constant_variable(ir);
75 return do_constant_variable_unlinked(ir);
77 return do_copy_propagation(ir);
79 return do_copy_propagation_elements(ir);
[all...] |
| opt_redundant_jumps.cpp | 29 #include "ir.h"
53 redundant_jumps_visitor::visit_enter(ir_assignment *ir)
59 redundant_jumps_visitor::visit_leave(ir_if *ir)
66 (ir_instruction *) ir->then_instructions.get_tail();
68 (ir_instruction *) ir->else_instructions.get_tail();
87 ir->insert_after(then_jump);
92 if (ir->then_instructions.is_empty() && ir->else_instructions.is_empty())
93 ir->remove();
100 redundant_jumps_visitor::visit_leave(ir_loop *ir)
[all...] |
| lower_discard.cpp | 109 #include "ir.h"
139 ir_discard *ir = ((ir_instruction *) n)->as_discard(); local
140 if (ir != NULL)
141 return ir;
148 replace_discard(void *mem_ctx, ir_variable *var, ir_discard *ir)
150 ir_rvalue *condition = ir->condition;
160 ir->replace_with(assignment);
165 lower_discard_visitor::visit_leave(ir_if *ir)
167 ir_discard *then_discard = find_discard(ir->then_instructions);
168 ir_discard *else_discard = find_discard(ir->else_instructions)
[all...] |
| lower_jumps.cpp | 61 #include "ir.h"
65 * an IR node.
99 * exit this IR node. It might fall out the bottom (with or
138 /* minimum jump strength (of lowered IR, not pre-lowering IR)
286 void truncate_after_instruction(exec_node *ir)
288 if (!ir)
291 while (!ir->get_next()->is_tail_sentinel()) {
292 ((ir_instruction *)ir->get_next())->remove();
297 void move_outer_block_inside(ir_instruction *ir, exec_list *inner_block
377 ir_instruction *ir = (ir_instruction *) block->get_tail(); local
[all...] |
| lower_if_to_cond_assign.cpp | 49 #include "ir.h"
93 check_control_flow(ir_instruction *ir, void *data)
96 switch (ir->ir_type) {
116 ir_instruction *ir = (ir_instruction *) node; local
118 if (ir->ir_type == ir_type_assignment) {
119 ir_assignment *assign = (ir_assignment *)ir;
152 ir->remove();
153 if_ir->insert_before(ir);
158 ir_if_to_cond_assign_visitor::visit_enter(ir_if *ir)
160 (void) ir;
[all...] |
| /external/clang/test/CodeGenCXX/ |
| lvalue-bitcasts.cpp | 7 void reinterpret_cast_test(int &ir, float &fr, X &xr) {
11 ir = reinterpret_cast<int&>(fr);
15 ir = reinterpret_cast<int&>(xr);
19 fr = reinterpret_cast<float&>(ir);
27 xr = reinterpret_cast<X&>(ir);
38 cfr = reinterpret_cast<_Complex float&>(ir);
52 void c_cast(int &ir, float &fr, X &xr) {
56 ir = (int&)fr;
60 ir = (int&)xr;
64 fr = (float&)ir;
[all...] |
| /external/mesa3d/src/glsl/ |
| lower_discard_flow.cpp | 48 #include "ir.h"
63 ir_visitor_status visit_enter(ir_discard *ir);
64 ir_visitor_status visit_enter(ir_loop_jump *ir);
65 ir_visitor_status visit_enter(ir_loop *ir);
66 ir_visitor_status visit_enter(ir_function_signature *ir);
75 lower_discard_flow_visitor::visit_enter(ir_loop_jump *ir)
77 if (ir->mode != ir_loop_jump::jump_continue)
80 ir->insert_before(generate_discard_break());
86 lower_discard_flow_visitor::visit_enter(ir_discard *ir)
91 ir->insert_before(assign)
[all...] |
| opt_algebraic.cpp | 31 #include "ir.h"
55 ir_rvalue *handle_expression(ir_expression *ir);
76 is_vec_zero(ir_constant *ir)
78 return (ir == NULL) ? false : ir->is_zero();
82 is_vec_one(ir_constant *ir)
84 return (ir == NULL) ? false : ir->is_one();
88 is_vec_basis(ir_constant *ir)
90 return (ir == NULL) ? false : ir->is_basis()
[all...] |
| opt_constant_folding.cpp | 29 #include "ir.h"
53 virtual ir_visitor_status visit_enter(ir_assignment *ir);
54 virtual ir_visitor_status visit_enter(ir_call *ir);
92 ir_constant_folding_visitor::visit_enter(ir_assignment *ir)
94 ir->rhs->accept(this);
95 handle_rvalue(&ir->rhs);
97 if (ir->condition) {
98 ir->condition->accept(this);
99 handle_rvalue(&ir->condition);
101 ir_constant *const_val = ir->condition->as_constant()
[all...] |
| opt_dead_code_local.cpp | 36 #include "ir.h"
48 assignment_entry(ir_variable *lhs, ir_assignment *ir)
51 assert(ir);
53 this->ir = ir;
54 this->available = ir->write_mask;
58 ir_assignment *ir; member in class:__anon25359::assignment_entry
93 virtual ir_visitor_status visit(ir_dereference_variable *ir)
95 kill_channels(ir->var, ~0);
100 virtual ir_visitor_status visit(ir_swizzle *ir)
281 ir_instruction *ir, *ir_next; local
[all...] |
| lower_vec_index_to_cond_assign.cpp | 39 #include "ir.h"
68 ir_vec_index_to_cond_assign_visitor::convert_vec_index_to_cond_assign(ir_rvalue *ir)
70 ir_dereference_array *orig_deref = ir->as_dereference_array();
77 return ir;
81 return ir;
83 void *mem_ctx = ralloc_parent(ir);
99 var = new(base_ir) ir_variable(ir->type, "vec_index_tmp_v",
114 new(base_ir) ir_swizzle(cond_deref->clone(ir, NULL), i, 0, 0, 0, 1);
128 /* Put all of the new instructions in the IR stream before the old
138 ir_vec_index_to_cond_assign_visitor::visit_enter(ir_expression *ir)
[all...] |
| opt_if_simplification.cpp | 31 #include "ir.h"
54 ir_if_simplification_visitor::visit_enter(ir_assignment *ir)
56 (void) ir;
71 ir_if_simplification_visitor::visit_leave(ir_if *ir)
74 if (ir->then_instructions.is_empty() &&
75 ir->else_instructions.is_empty()) {
76 ir->remove();
86 ir_constant *condition_constant = ir->condition->constant_expression_value();
92 foreach_iter(exec_list_iterator, then_iter, ir->then_instructions) {
94 ir->insert_before(then_ir)
[all...] |
| ir_basic_block.cpp | 30 #include "ir.h"
38 * Basic block analysis is pretty easy in our IR thanks to the lack of
62 ir_instruction *ir = (ir_instruction *)iter.get(); local
68 leader = ir;
70 if ((ir_if = ir->as_if())) {
71 callback(leader, ir, data);
76 } else if ((ir_loop = ir->as_loop())) {
77 callback(leader, ir, data);
80 } else if (ir->as_return() || ir->as_call())
[all...] |
| test_optpass.cpp | 30 * glsl_test app. It accepts either GLSL or high-level IR as input,
32 * It outputs the IR, both before and after optimiations.
57 do_optimization(struct exec_list *ir, const char *optimization)
67 return do_common_optimization(ir, int_0 != 0, false, int_1);
69 return do_algebraic(ir);
71 return do_constant_folding(ir);
73 return do_constant_variable(ir);
75 return do_constant_variable_unlinked(ir);
77 return do_copy_propagation(ir);
79 return do_copy_propagation_elements(ir);
[all...] |
| opt_redundant_jumps.cpp | 29 #include "ir.h"
53 redundant_jumps_visitor::visit_enter(ir_assignment *ir)
59 redundant_jumps_visitor::visit_leave(ir_if *ir)
66 (ir_instruction *) ir->then_instructions.get_tail();
68 (ir_instruction *) ir->else_instructions.get_tail();
87 ir->insert_after(then_jump);
92 if (ir->then_instructions.is_empty() && ir->else_instructions.is_empty())
93 ir->remove();
100 redundant_jumps_visitor::visit_leave(ir_loop *ir)
[all...] |
| lower_discard.cpp | 109 #include "ir.h"
139 ir_discard *ir = ((ir_instruction *) n)->as_discard(); local
140 if (ir != NULL)
141 return ir;
148 replace_discard(void *mem_ctx, ir_variable *var, ir_discard *ir)
150 ir_rvalue *condition = ir->condition;
160 ir->replace_with(assignment);
165 lower_discard_visitor::visit_leave(ir_if *ir)
167 ir_discard *then_discard = find_discard(ir->then_instructions);
168 ir_discard *else_discard = find_discard(ir->else_instructions)
[all...] |
| lower_jumps.cpp | 61 #include "ir.h"
65 * an IR node.
99 * exit this IR node. It might fall out the bottom (with or
138 /* minimum jump strength (of lowered IR, not pre-lowering IR)
286 void truncate_after_instruction(exec_node *ir)
288 if (!ir)
291 while (!ir->get_next()->is_tail_sentinel()) {
292 ((ir_instruction *)ir->get_next())->remove();
297 void move_outer_block_inside(ir_instruction *ir, exec_list *inner_block
377 ir_instruction *ir = (ir_instruction *) block->get_tail(); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
| back.pass.cpp | 24 int& ir = q.back(); local
25 assert(ir == 3);
|
| front.pass.cpp | 24 int& ir = q.front(); local
25 assert(ir == 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| top.pass.cpp | 24 int& ir = q.top(); local
25 assert(ir == 3);
|
