1 /* 2 * Copyright © 2010 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 21 * DEALINGS IN THE SOFTWARE. 22 */ 23 24 /** 25 * \file ir_rvalue_visitor.h 26 * 27 * Generic class to implement the common pattern we have of wanting to 28 * visit each ir_rvalue * and possibly change that node to a different 29 * class. Just implement handle_rvalue() and you will be called with 30 * a pointer to each rvalue in the tree. 31 */ 32 33 class ir_rvalue_base_visitor : public ir_hierarchical_visitor { 34 public: 35 ir_visitor_status rvalue_visit(ir_assignment *); 36 ir_visitor_status rvalue_visit(ir_call *); 37 ir_visitor_status rvalue_visit(ir_dereference_array *); 38 ir_visitor_status rvalue_visit(ir_dereference_record *); 39 ir_visitor_status rvalue_visit(ir_discard *); 40 ir_visitor_status rvalue_visit(ir_expression *); 41 ir_visitor_status rvalue_visit(ir_if *); 42 ir_visitor_status rvalue_visit(ir_return *); 43 ir_visitor_status rvalue_visit(ir_swizzle *); 44 ir_visitor_status rvalue_visit(ir_texture *); 45 ir_visitor_status rvalue_visit(ir_emit_vertex *); 46 ir_visitor_status rvalue_visit(ir_end_primitive *); 47 48 virtual void handle_rvalue(ir_rvalue **rvalue) = 0; 49 }; 50 51 class ir_rvalue_visitor : public ir_rvalue_base_visitor { 52 public: 53 54 virtual ir_visitor_status visit_leave(ir_assignment *); 55 virtual ir_visitor_status visit_leave(ir_call *); 56 virtual ir_visitor_status visit_leave(ir_dereference_array *); 57 virtual ir_visitor_status visit_leave(ir_dereference_record *); 58 virtual ir_visitor_status visit_leave(ir_discard *); 59 virtual ir_visitor_status visit_leave(ir_expression *); 60 virtual ir_visitor_status visit_leave(ir_if *); 61 virtual ir_visitor_status visit_leave(ir_return *); 62 virtual ir_visitor_status visit_leave(ir_swizzle *); 63 virtual ir_visitor_status visit_leave(ir_texture *); 64 virtual ir_visitor_status visit_leave(ir_emit_vertex *); 65 virtual ir_visitor_status visit_leave(ir_end_primitive *); 66 }; 67 68 class ir_rvalue_enter_visitor : public ir_rvalue_base_visitor { 69 public: 70 71 virtual ir_visitor_status visit_enter(ir_assignment *); 72 virtual ir_visitor_status visit_enter(ir_call *); 73 virtual ir_visitor_status visit_enter(ir_dereference_array *); 74 virtual ir_visitor_status visit_enter(ir_dereference_record *); 75 virtual ir_visitor_status visit_enter(ir_discard *); 76 virtual ir_visitor_status visit_enter(ir_expression *); 77 virtual ir_visitor_status visit_enter(ir_if *); 78 virtual ir_visitor_status visit_enter(ir_return *); 79 virtual ir_visitor_status visit_enter(ir_swizzle *); 80 virtual ir_visitor_status visit_enter(ir_texture *); 81 virtual ir_visitor_status visit_enter(ir_emit_vertex *); 82 virtual ir_visitor_status visit_enter(ir_end_primitive *); 83 }; 84