libFirm
gen_irnode.h
1 /* Warning: Automatically generated file */
2 #ifndef IR_GEN_IRNODE_H
3 #define IR_GEN_IRNODE_H
4 
5 #include <assert.h>
6 
7 
8 
9 #define is_ASM(node) is_ASM_(node)
10 #define get_ASM_input_constraints(node) get_ASM_input_constraints_(node)
11 #define set_ASM_input_constraints(node, input_constraints) set_ASM_input_constraints_(node, input_constraints)
12 #define get_ASM_output_constraints(node) get_ASM_output_constraints_(node)
13 #define set_ASM_output_constraints(node, output_constraints) set_ASM_output_constraints_(node, output_constraints)
14 #define get_ASM_clobbers(node) get_ASM_clobbers_(node)
15 #define set_ASM_clobbers(node, clobbers) set_ASM_clobbers_(node, clobbers)
16 #define get_ASM_text(node) get_ASM_text_(node)
17 #define set_ASM_text(node, text) set_ASM_text_(node, text)
18 #define get_ASM_mem(node) get_ASM_mem_(node)
19 #define set_ASM_mem(node, mem) set_ASM_mem_(node, mem)
20 #define get_ASM_n_inputs(node) get_ASM_n_inputs_(node)
21 #define get_ASM_input(node, pos) get_ASM_input_(node, pos)
22 #define set_ASM_input(node, pos, input) set_ASM_input_(node, pos, input)
23 #define get_ASM_input_arr(node) get_ASM_input_arr_(node)
24 
25 #define is_Add(node) is_Add_(node)
26 #define get_Add_left(node) get_Add_left_(node)
27 #define set_Add_left(node, left) set_Add_left_(node, left)
28 #define get_Add_right(node) get_Add_right_(node)
29 #define set_Add_right(node, right) set_Add_right_(node, right)
30 
31 #define is_Address(node) is_Address_(node)
32 #define get_Address_entity(node) get_Address_entity_(node)
33 #define set_Address_entity(node, entity) set_Address_entity_(node, entity)
34 
35 #define is_Align(node) is_Align_(node)
36 #define get_Align_type(node) get_Align_type_(node)
37 #define set_Align_type(node, type) set_Align_type_(node, type)
38 
39 #define is_Alloc(node) is_Alloc_(node)
40 #define get_Alloc_alignment(node) get_Alloc_alignment_(node)
41 #define set_Alloc_alignment(node, alignment) set_Alloc_alignment_(node, alignment)
42 #define get_Alloc_mem(node) get_Alloc_mem_(node)
43 #define set_Alloc_mem(node, mem) set_Alloc_mem_(node, mem)
44 #define get_Alloc_size(node) get_Alloc_size_(node)
45 #define set_Alloc_size(node, size) set_Alloc_size_(node, size)
46 
47 #define is_Anchor(node) is_Anchor_(node)
48 #define get_Anchor_end_block(node) get_Anchor_end_block_(node)
49 #define set_Anchor_end_block(node, end_block) set_Anchor_end_block_(node, end_block)
50 #define get_Anchor_start_block(node) get_Anchor_start_block_(node)
51 #define set_Anchor_start_block(node, start_block) set_Anchor_start_block_(node, start_block)
52 #define get_Anchor_end(node) get_Anchor_end_(node)
53 #define set_Anchor_end(node, end) set_Anchor_end_(node, end)
54 #define get_Anchor_start(node) get_Anchor_start_(node)
55 #define set_Anchor_start(node, start) set_Anchor_start_(node, start)
56 #define get_Anchor_frame(node) get_Anchor_frame_(node)
57 #define set_Anchor_frame(node, frame) set_Anchor_frame_(node, frame)
58 #define get_Anchor_initial_mem(node) get_Anchor_initial_mem_(node)
59 #define set_Anchor_initial_mem(node, initial_mem) set_Anchor_initial_mem_(node, initial_mem)
60 #define get_Anchor_args(node) get_Anchor_args_(node)
61 #define set_Anchor_args(node, args) set_Anchor_args_(node, args)
62 #define get_Anchor_no_mem(node) get_Anchor_no_mem_(node)
63 #define set_Anchor_no_mem(node, no_mem) set_Anchor_no_mem_(node, no_mem)
64 
65 #define is_And(node) is_And_(node)
66 #define get_And_left(node) get_And_left_(node)
67 #define set_And_left(node, left) set_And_left_(node, left)
68 #define get_And_right(node) get_And_right_(node)
69 #define set_And_right(node, right) set_And_right_(node, right)
70 
71 #define is_Bad(node) is_Bad_(node)
72 
73 #define is_Bitcast(node) is_Bitcast_(node)
74 #define get_Bitcast_op(node) get_Bitcast_op_(node)
75 #define set_Bitcast_op(node, op) set_Bitcast_op_(node, op)
76 
77 #define is_Block(node) is_Block_(node)
78 #define get_Block_entity(node) get_Block_entity_(node)
79 #define set_Block_entity(node, entity) set_Block_entity_(node, entity)
80 #define get_Block_n_cfgpreds(node) get_Block_n_cfgpreds_(node)
81 #define get_Block_cfgpred(node, pos) get_Block_cfgpred_(node, pos)
82 #define set_Block_cfgpred(node, pos, cfgpred) set_Block_cfgpred_(node, pos, cfgpred)
83 #define get_Block_cfgpred_arr(node) get_Block_cfgpred_arr_(node)
84 
85 #define is_Builtin(node) is_Builtin_(node)
86 #define get_Builtin_kind(node) get_Builtin_kind_(node)
87 #define set_Builtin_kind(node, kind) set_Builtin_kind_(node, kind)
88 #define get_Builtin_type(node) get_Builtin_type_(node)
89 #define set_Builtin_type(node, type) set_Builtin_type_(node, type)
90 #define get_Builtin_mem(node) get_Builtin_mem_(node)
91 #define set_Builtin_mem(node, mem) set_Builtin_mem_(node, mem)
92 #define get_Builtin_n_params(node) get_Builtin_n_params_(node)
93 #define get_Builtin_param(node, pos) get_Builtin_param_(node, pos)
94 #define set_Builtin_param(node, pos, param) set_Builtin_param_(node, pos, param)
95 #define get_Builtin_param_arr(node) get_Builtin_param_arr_(node)
96 
97 #define is_Call(node) is_Call_(node)
98 #define get_Call_type(node) get_Call_type_(node)
99 #define set_Call_type(node, type) set_Call_type_(node, type)
100 #define get_Call_mem(node) get_Call_mem_(node)
101 #define set_Call_mem(node, mem) set_Call_mem_(node, mem)
102 #define get_Call_ptr(node) get_Call_ptr_(node)
103 #define set_Call_ptr(node, ptr) set_Call_ptr_(node, ptr)
104 #define get_Call_n_params(node) get_Call_n_params_(node)
105 #define get_Call_param(node, pos) get_Call_param_(node, pos)
106 #define set_Call_param(node, pos, param) set_Call_param_(node, pos, param)
107 #define get_Call_param_arr(node) get_Call_param_arr_(node)
108 
109 #define is_Cmp(node) is_Cmp_(node)
110 #define get_Cmp_relation(node) get_Cmp_relation_(node)
111 #define set_Cmp_relation(node, relation) set_Cmp_relation_(node, relation)
112 #define get_Cmp_left(node) get_Cmp_left_(node)
113 #define set_Cmp_left(node, left) set_Cmp_left_(node, left)
114 #define get_Cmp_right(node) get_Cmp_right_(node)
115 #define set_Cmp_right(node, right) set_Cmp_right_(node, right)
116 
117 #define is_Cond(node) is_Cond_(node)
118 #define get_Cond_jmp_pred(node) get_Cond_jmp_pred_(node)
119 #define set_Cond_jmp_pred(node, jmp_pred) set_Cond_jmp_pred_(node, jmp_pred)
120 #define get_Cond_selector(node) get_Cond_selector_(node)
121 #define set_Cond_selector(node, selector) set_Cond_selector_(node, selector)
122 
123 #define is_Confirm(node) is_Confirm_(node)
124 #define get_Confirm_relation(node) get_Confirm_relation_(node)
125 #define set_Confirm_relation(node, relation) set_Confirm_relation_(node, relation)
126 #define get_Confirm_value(node) get_Confirm_value_(node)
127 #define set_Confirm_value(node, value) set_Confirm_value_(node, value)
128 #define get_Confirm_bound(node) get_Confirm_bound_(node)
129 #define set_Confirm_bound(node, bound) set_Confirm_bound_(node, bound)
130 
131 #define is_Const(node) is_Const_(node)
132 #define get_Const_tarval(node) get_Const_tarval_(node)
133 #define set_Const_tarval(node, tarval) set_Const_tarval_(node, tarval)
134 
135 #define is_Conv(node) is_Conv_(node)
136 #define get_Conv_op(node) get_Conv_op_(node)
137 #define set_Conv_op(node, op) set_Conv_op_(node, op)
138 
139 #define is_CopyB(node) is_CopyB_(node)
140 #define get_CopyB_type(node) get_CopyB_type_(node)
141 #define set_CopyB_type(node, type) set_CopyB_type_(node, type)
142 #define get_CopyB_volatility(node) get_CopyB_volatility_(node)
143 #define set_CopyB_volatility(node, volatility) set_CopyB_volatility_(node, volatility)
144 #define get_CopyB_mem(node) get_CopyB_mem_(node)
145 #define set_CopyB_mem(node, mem) set_CopyB_mem_(node, mem)
146 #define get_CopyB_dst(node) get_CopyB_dst_(node)
147 #define set_CopyB_dst(node, dst) set_CopyB_dst_(node, dst)
148 #define get_CopyB_src(node) get_CopyB_src_(node)
149 #define set_CopyB_src(node, src) set_CopyB_src_(node, src)
150 
151 #define is_Deleted(node) is_Deleted_(node)
152 
153 #define is_Div(node) is_Div_(node)
154 #define get_Div_resmode(node) get_Div_resmode_(node)
155 #define set_Div_resmode(node, resmode) set_Div_resmode_(node, resmode)
156 #define get_Div_no_remainder(node) get_Div_no_remainder_(node)
157 #define set_Div_no_remainder(node, no_remainder) set_Div_no_remainder_(node, no_remainder)
158 #define get_Div_mem(node) get_Div_mem_(node)
159 #define set_Div_mem(node, mem) set_Div_mem_(node, mem)
160 #define get_Div_left(node) get_Div_left_(node)
161 #define set_Div_left(node, left) set_Div_left_(node, left)
162 #define get_Div_right(node) get_Div_right_(node)
163 #define set_Div_right(node, right) set_Div_right_(node, right)
164 
165 #define is_Dummy(node) is_Dummy_(node)
166 
167 #define is_End(node) is_End_(node)
168 #define get_End_n_keepalives(node) get_End_n_keepalives_(node)
169 #define get_End_keepalive(node, pos) get_End_keepalive_(node, pos)
170 #define set_End_keepalive(node, pos, keepalive) set_End_keepalive_(node, pos, keepalive)
171 #define get_End_keepalive_arr(node) get_End_keepalive_arr_(node)
172 
173 #define is_Eor(node) is_Eor_(node)
174 #define get_Eor_left(node) get_Eor_left_(node)
175 #define set_Eor_left(node, left) set_Eor_left_(node, left)
176 #define get_Eor_right(node) get_Eor_right_(node)
177 #define set_Eor_right(node, right) set_Eor_right_(node, right)
178 
179 #define is_Free(node) is_Free_(node)
180 #define get_Free_mem(node) get_Free_mem_(node)
181 #define set_Free_mem(node, mem) set_Free_mem_(node, mem)
182 #define get_Free_ptr(node) get_Free_ptr_(node)
183 #define set_Free_ptr(node, ptr) set_Free_ptr_(node, ptr)
184 
185 #define is_IJmp(node) is_IJmp_(node)
186 #define get_IJmp_target(node) get_IJmp_target_(node)
187 #define set_IJmp_target(node, target) set_IJmp_target_(node, target)
188 
189 #define is_Id(node) is_Id_(node)
190 #define get_Id_pred(node) get_Id_pred_(node)
191 #define set_Id_pred(node, pred) set_Id_pred_(node, pred)
192 
193 #define is_Jmp(node) is_Jmp_(node)
194 
195 #define is_Load(node) is_Load_(node)
196 #define get_Load_mode(node) get_Load_mode_(node)
197 #define set_Load_mode(node, mode) set_Load_mode_(node, mode)
198 #define get_Load_type(node) get_Load_type_(node)
199 #define set_Load_type(node, type) set_Load_type_(node, type)
200 #define get_Load_volatility(node) get_Load_volatility_(node)
201 #define set_Load_volatility(node, volatility) set_Load_volatility_(node, volatility)
202 #define get_Load_unaligned(node) get_Load_unaligned_(node)
203 #define set_Load_unaligned(node, unaligned) set_Load_unaligned_(node, unaligned)
204 #define get_Load_mem(node) get_Load_mem_(node)
205 #define set_Load_mem(node, mem) set_Load_mem_(node, mem)
206 #define get_Load_ptr(node) get_Load_ptr_(node)
207 #define set_Load_ptr(node, ptr) set_Load_ptr_(node, ptr)
208 
209 #define is_Member(node) is_Member_(node)
210 #define get_Member_entity(node) get_Member_entity_(node)
211 #define set_Member_entity(node, entity) set_Member_entity_(node, entity)
212 #define get_Member_ptr(node) get_Member_ptr_(node)
213 #define set_Member_ptr(node, ptr) set_Member_ptr_(node, ptr)
214 
215 #define is_Minus(node) is_Minus_(node)
216 #define get_Minus_op(node) get_Minus_op_(node)
217 #define set_Minus_op(node, op) set_Minus_op_(node, op)
218 
219 #define is_Mod(node) is_Mod_(node)
220 #define get_Mod_resmode(node) get_Mod_resmode_(node)
221 #define set_Mod_resmode(node, resmode) set_Mod_resmode_(node, resmode)
222 #define get_Mod_mem(node) get_Mod_mem_(node)
223 #define set_Mod_mem(node, mem) set_Mod_mem_(node, mem)
224 #define get_Mod_left(node) get_Mod_left_(node)
225 #define set_Mod_left(node, left) set_Mod_left_(node, left)
226 #define get_Mod_right(node) get_Mod_right_(node)
227 #define set_Mod_right(node, right) set_Mod_right_(node, right)
228 
229 #define is_Mul(node) is_Mul_(node)
230 #define get_Mul_left(node) get_Mul_left_(node)
231 #define set_Mul_left(node, left) set_Mul_left_(node, left)
232 #define get_Mul_right(node) get_Mul_right_(node)
233 #define set_Mul_right(node, right) set_Mul_right_(node, right)
234 
235 #define is_Mulh(node) is_Mulh_(node)
236 #define get_Mulh_left(node) get_Mulh_left_(node)
237 #define set_Mulh_left(node, left) set_Mulh_left_(node, left)
238 #define get_Mulh_right(node) get_Mulh_right_(node)
239 #define set_Mulh_right(node, right) set_Mulh_right_(node, right)
240 
241 #define is_Mux(node) is_Mux_(node)
242 #define get_Mux_sel(node) get_Mux_sel_(node)
243 #define set_Mux_sel(node, sel) set_Mux_sel_(node, sel)
244 #define get_Mux_false(node) get_Mux_false_(node)
245 #define set_Mux_false(node, false_) set_Mux_false_(node, false_)
246 #define get_Mux_true(node) get_Mux_true_(node)
247 #define set_Mux_true(node, true_) set_Mux_true_(node, true_)
248 
249 #define is_NoMem(node) is_NoMem_(node)
250 
251 #define is_Not(node) is_Not_(node)
252 #define get_Not_op(node) get_Not_op_(node)
253 #define set_Not_op(node, op) set_Not_op_(node, op)
254 
255 #define is_Offset(node) is_Offset_(node)
256 #define get_Offset_entity(node) get_Offset_entity_(node)
257 #define set_Offset_entity(node, entity) set_Offset_entity_(node, entity)
258 
259 #define is_Or(node) is_Or_(node)
260 #define get_Or_left(node) get_Or_left_(node)
261 #define set_Or_left(node, left) set_Or_left_(node, left)
262 #define get_Or_right(node) get_Or_right_(node)
263 #define set_Or_right(node, right) set_Or_right_(node, right)
264 
265 #define is_Phi(node) is_Phi_(node)
266 #define get_Phi_loop(node) get_Phi_loop_(node)
267 #define set_Phi_loop(node, loop) set_Phi_loop_(node, loop)
268 #define get_Phi_n_preds(node) get_Phi_n_preds_(node)
269 #define get_Phi_pred(node, pos) get_Phi_pred_(node, pos)
270 #define set_Phi_pred(node, pos, pred) set_Phi_pred_(node, pos, pred)
271 #define get_Phi_pred_arr(node) get_Phi_pred_arr_(node)
272 
273 #define is_Pin(node) is_Pin_(node)
274 #define get_Pin_op(node) get_Pin_op_(node)
275 #define set_Pin_op(node, op) set_Pin_op_(node, op)
276 
277 #define is_Proj(node) is_Proj_(node)
278 #define get_Proj_num(node) get_Proj_num_(node)
279 #define set_Proj_num(node, num) set_Proj_num_(node, num)
280 #define get_Proj_pred(node) get_Proj_pred_(node)
281 #define set_Proj_pred(node, pred) set_Proj_pred_(node, pred)
282 
283 #define is_Raise(node) is_Raise_(node)
284 #define get_Raise_mem(node) get_Raise_mem_(node)
285 #define set_Raise_mem(node, mem) set_Raise_mem_(node, mem)
286 #define get_Raise_exo_ptr(node) get_Raise_exo_ptr_(node)
287 #define set_Raise_exo_ptr(node, exo_ptr) set_Raise_exo_ptr_(node, exo_ptr)
288 
289 #define is_Return(node) is_Return_(node)
290 #define get_Return_mem(node) get_Return_mem_(node)
291 #define set_Return_mem(node, mem) set_Return_mem_(node, mem)
292 #define get_Return_n_ress(node) get_Return_n_ress_(node)
293 #define get_Return_res(node, pos) get_Return_res_(node, pos)
294 #define set_Return_res(node, pos, res) set_Return_res_(node, pos, res)
295 #define get_Return_res_arr(node) get_Return_res_arr_(node)
296 
297 #define is_Sel(node) is_Sel_(node)
298 #define get_Sel_type(node) get_Sel_type_(node)
299 #define set_Sel_type(node, type) set_Sel_type_(node, type)
300 #define get_Sel_ptr(node) get_Sel_ptr_(node)
301 #define set_Sel_ptr(node, ptr) set_Sel_ptr_(node, ptr)
302 #define get_Sel_index(node) get_Sel_index_(node)
303 #define set_Sel_index(node, index) set_Sel_index_(node, index)
304 
305 #define is_Shl(node) is_Shl_(node)
306 #define get_Shl_left(node) get_Shl_left_(node)
307 #define set_Shl_left(node, left) set_Shl_left_(node, left)
308 #define get_Shl_right(node) get_Shl_right_(node)
309 #define set_Shl_right(node, right) set_Shl_right_(node, right)
310 
311 #define is_Shr(node) is_Shr_(node)
312 #define get_Shr_left(node) get_Shr_left_(node)
313 #define set_Shr_left(node, left) set_Shr_left_(node, left)
314 #define get_Shr_right(node) get_Shr_right_(node)
315 #define set_Shr_right(node, right) set_Shr_right_(node, right)
316 
317 #define is_Shrs(node) is_Shrs_(node)
318 #define get_Shrs_left(node) get_Shrs_left_(node)
319 #define set_Shrs_left(node, left) set_Shrs_left_(node, left)
320 #define get_Shrs_right(node) get_Shrs_right_(node)
321 #define set_Shrs_right(node, right) set_Shrs_right_(node, right)
322 
323 #define is_Size(node) is_Size_(node)
324 #define get_Size_type(node) get_Size_type_(node)
325 #define set_Size_type(node, type) set_Size_type_(node, type)
326 
327 #define is_Start(node) is_Start_(node)
328 
329 #define is_Store(node) is_Store_(node)
330 #define get_Store_type(node) get_Store_type_(node)
331 #define set_Store_type(node, type) set_Store_type_(node, type)
332 #define get_Store_volatility(node) get_Store_volatility_(node)
333 #define set_Store_volatility(node, volatility) set_Store_volatility_(node, volatility)
334 #define get_Store_unaligned(node) get_Store_unaligned_(node)
335 #define set_Store_unaligned(node, unaligned) set_Store_unaligned_(node, unaligned)
336 #define get_Store_mem(node) get_Store_mem_(node)
337 #define set_Store_mem(node, mem) set_Store_mem_(node, mem)
338 #define get_Store_ptr(node) get_Store_ptr_(node)
339 #define set_Store_ptr(node, ptr) set_Store_ptr_(node, ptr)
340 #define get_Store_value(node) get_Store_value_(node)
341 #define set_Store_value(node, value) set_Store_value_(node, value)
342 
343 #define is_Sub(node) is_Sub_(node)
344 #define get_Sub_left(node) get_Sub_left_(node)
345 #define set_Sub_left(node, left) set_Sub_left_(node, left)
346 #define get_Sub_right(node) get_Sub_right_(node)
347 #define set_Sub_right(node, right) set_Sub_right_(node, right)
348 
349 #define is_Switch(node) is_Switch_(node)
350 #define get_Switch_n_outs(node) get_Switch_n_outs_(node)
351 #define set_Switch_n_outs(node, n_outs) set_Switch_n_outs_(node, n_outs)
352 #define get_Switch_table(node) get_Switch_table_(node)
353 #define set_Switch_table(node, table) set_Switch_table_(node, table)
354 #define get_Switch_selector(node) get_Switch_selector_(node)
355 #define set_Switch_selector(node, selector) set_Switch_selector_(node, selector)
356 
357 #define is_Sync(node) is_Sync_(node)
358 #define get_Sync_n_preds(node) get_Sync_n_preds_(node)
359 #define get_Sync_pred(node, pos) get_Sync_pred_(node, pos)
360 #define set_Sync_pred(node, pos, pred) set_Sync_pred_(node, pos, pred)
361 #define get_Sync_pred_arr(node) get_Sync_pred_arr_(node)
362 
363 #define is_Tuple(node) is_Tuple_(node)
364 #define get_Tuple_n_preds(node) get_Tuple_n_preds_(node)
365 #define get_Tuple_pred(node, pos) get_Tuple_pred_(node, pos)
366 #define set_Tuple_pred(node, pos, pred) set_Tuple_pred_(node, pos, pred)
367 #define get_Tuple_pred_arr(node) get_Tuple_pred_arr_(node)
368 
369 #define is_Unknown(node) is_Unknown_(node)
370 
371 
372 #define is_entconst(node) is_entconst_(node)
373 #define get_entconst_entity(node) get_entconst_entity_(node)
374 #define set_entconst_entity(node, entity) set_entconst_entity_(node, entity)
375 #define is_typeconst(node) is_typeconst_(node)
376 #define get_typeconst_type(node) get_typeconst_type_(node)
377 #define set_typeconst_type(node, type) set_typeconst_type_(node, type)
378 static inline int is_ASM_(const ir_node *node)
379 {
380  return get_irn_op(node) == op_ASM;
381 }
382 static inline ir_node *get_ASM_mem_(const ir_node *node)
383 {
384  assert(is_ASM(node));
385  return get_irn_n(node, n_ASM_mem);
386 }
387 
388 static inline void set_ASM_mem_(ir_node *node, ir_node *mem)
389 {
390  assert(is_ASM(node));
391  set_irn_n(node, n_ASM_mem, mem);
392 }
393 
394 static inline int get_ASM_n_inputs_(ir_node const *node)
395 {
396  assert(is_ASM(node));
397  return get_irn_arity(node) - (n_ASM_max + 1);
398 }
399 
400 static inline ir_node *get_ASM_input_(ir_node const *node, int pos)
401 {
402  assert(0 <= pos && pos < get_ASM_n_inputs(node));
403  return get_irn_n(node, pos + (n_ASM_max + 1));
404 }
405 
406 static inline void set_ASM_input_(ir_node *node, int pos, ir_node *input)
407 {
408  assert(0 <= pos && pos < get_ASM_n_inputs(node));
409  set_irn_n(node, pos + (n_ASM_max + 1), input);
410 }
411 
412 static inline ir_node **get_ASM_input_arr_(ir_node *node)
413 {
414  assert(is_ASM(node));
415  return get_irn_in(node) + (n_ASM_max + 1);
416 }
417 
418 static inline int is_Add_(const ir_node *node)
419 {
420  return get_irn_op(node) == op_Add;
421 }
422 static inline ir_node *get_Add_left_(const ir_node *node)
423 {
424  assert(is_Add(node));
425  return get_irn_n(node, n_Add_left);
426 }
427 
428 static inline void set_Add_left_(ir_node *node, ir_node *left)
429 {
430  assert(is_Add(node));
431  set_irn_n(node, n_Add_left, left);
432 }
433 
434 static inline ir_node *get_Add_right_(const ir_node *node)
435 {
436  assert(is_Add(node));
437  return get_irn_n(node, n_Add_right);
438 }
439 
440 static inline void set_Add_right_(ir_node *node, ir_node *right)
441 {
442  assert(is_Add(node));
443  set_irn_n(node, n_Add_right, right);
444 }
445 
446 static inline int is_Address_(const ir_node *node)
447 {
448  return get_irn_op(node) == op_Address;
449 }
450 static inline int is_Align_(const ir_node *node)
451 {
452  return get_irn_op(node) == op_Align;
453 }
454 static inline int is_Alloc_(const ir_node *node)
455 {
456  return get_irn_op(node) == op_Alloc;
457 }
458 static inline ir_node *get_Alloc_mem_(const ir_node *node)
459 {
460  assert(is_Alloc(node));
461  return get_irn_n(node, n_Alloc_mem);
462 }
463 
464 static inline void set_Alloc_mem_(ir_node *node, ir_node *mem)
465 {
466  assert(is_Alloc(node));
467  set_irn_n(node, n_Alloc_mem, mem);
468 }
469 
470 static inline ir_node *get_Alloc_size_(const ir_node *node)
471 {
472  assert(is_Alloc(node));
473  return get_irn_n(node, n_Alloc_size);
474 }
475 
476 static inline void set_Alloc_size_(ir_node *node, ir_node *size)
477 {
478  assert(is_Alloc(node));
479  set_irn_n(node, n_Alloc_size, size);
480 }
481 
482 static inline int is_Anchor_(const ir_node *node)
483 {
484  return get_irn_op(node) == op_Anchor;
485 }
486 static inline ir_node *get_Anchor_end_block_(const ir_node *node)
487 {
488  assert(is_Anchor(node));
489  return get_irn_n(node, n_Anchor_end_block);
490 }
491 
492 static inline void set_Anchor_end_block_(ir_node *node, ir_node *end_block)
493 {
494  assert(is_Anchor(node));
495  set_irn_n(node, n_Anchor_end_block, end_block);
496 }
497 
498 static inline ir_node *get_Anchor_start_block_(const ir_node *node)
499 {
500  assert(is_Anchor(node));
501  return get_irn_n(node, n_Anchor_start_block);
502 }
503 
504 static inline void set_Anchor_start_block_(ir_node *node, ir_node *start_block)
505 {
506  assert(is_Anchor(node));
507  set_irn_n(node, n_Anchor_start_block, start_block);
508 }
509 
510 static inline ir_node *get_Anchor_end_(const ir_node *node)
511 {
512  assert(is_Anchor(node));
513  return get_irn_n(node, n_Anchor_end);
514 }
515 
516 static inline void set_Anchor_end_(ir_node *node, ir_node *end)
517 {
518  assert(is_Anchor(node));
519  set_irn_n(node, n_Anchor_end, end);
520 }
521 
522 static inline ir_node *get_Anchor_start_(const ir_node *node)
523 {
524  assert(is_Anchor(node));
525  return get_irn_n(node, n_Anchor_start);
526 }
527 
528 static inline void set_Anchor_start_(ir_node *node, ir_node *start)
529 {
530  assert(is_Anchor(node));
531  set_irn_n(node, n_Anchor_start, start);
532 }
533 
534 static inline ir_node *get_Anchor_frame_(const ir_node *node)
535 {
536  assert(is_Anchor(node));
537  return get_irn_n(node, n_Anchor_frame);
538 }
539 
540 static inline void set_Anchor_frame_(ir_node *node, ir_node *frame)
541 {
542  assert(is_Anchor(node));
543  set_irn_n(node, n_Anchor_frame, frame);
544 }
545 
546 static inline ir_node *get_Anchor_initial_mem_(const ir_node *node)
547 {
548  assert(is_Anchor(node));
549  return get_irn_n(node, n_Anchor_initial_mem);
550 }
551 
552 static inline void set_Anchor_initial_mem_(ir_node *node, ir_node *initial_mem)
553 {
554  assert(is_Anchor(node));
555  set_irn_n(node, n_Anchor_initial_mem, initial_mem);
556 }
557 
558 static inline ir_node *get_Anchor_args_(const ir_node *node)
559 {
560  assert(is_Anchor(node));
561  return get_irn_n(node, n_Anchor_args);
562 }
563 
564 static inline void set_Anchor_args_(ir_node *node, ir_node *args)
565 {
566  assert(is_Anchor(node));
567  set_irn_n(node, n_Anchor_args, args);
568 }
569 
570 static inline ir_node *get_Anchor_no_mem_(const ir_node *node)
571 {
572  assert(is_Anchor(node));
573  return get_irn_n(node, n_Anchor_no_mem);
574 }
575 
576 static inline void set_Anchor_no_mem_(ir_node *node, ir_node *no_mem)
577 {
578  assert(is_Anchor(node));
579  set_irn_n(node, n_Anchor_no_mem, no_mem);
580 }
581 
582 static inline int is_And_(const ir_node *node)
583 {
584  return get_irn_op(node) == op_And;
585 }
586 static inline ir_node *get_And_left_(const ir_node *node)
587 {
588  assert(is_And(node));
589  return get_irn_n(node, n_And_left);
590 }
591 
592 static inline void set_And_left_(ir_node *node, ir_node *left)
593 {
594  assert(is_And(node));
595  set_irn_n(node, n_And_left, left);
596 }
597 
598 static inline ir_node *get_And_right_(const ir_node *node)
599 {
600  assert(is_And(node));
601  return get_irn_n(node, n_And_right);
602 }
603 
604 static inline void set_And_right_(ir_node *node, ir_node *right)
605 {
606  assert(is_And(node));
607  set_irn_n(node, n_And_right, right);
608 }
609 
610 static inline int is_Bad_(const ir_node *node)
611 {
612  return get_irn_op(node) == op_Bad;
613 }
614 static inline int is_Bitcast_(const ir_node *node)
615 {
616  return get_irn_op(node) == op_Bitcast;
617 }
618 static inline ir_node *get_Bitcast_op_(const ir_node *node)
619 {
620  assert(is_Bitcast(node));
621  return get_irn_n(node, n_Bitcast_op);
622 }
623 
624 static inline void set_Bitcast_op_(ir_node *node, ir_node *op)
625 {
626  assert(is_Bitcast(node));
627  set_irn_n(node, n_Bitcast_op, op);
628 }
629 
630 static inline int is_Block_(const ir_node *node)
631 {
632  return get_irn_op(node) == op_Block;
633 }
634 static inline int get_Block_n_cfgpreds_(ir_node const *node)
635 {
636  assert(is_Block(node));
637  return get_irn_arity(node);
638 }
639 
640 static inline ir_node *get_Block_cfgpred_(ir_node const *node, int pos)
641 {
642  assert(0 <= pos && pos < get_Block_n_cfgpreds(node));
643  return get_irn_n(node, pos);
644 }
645 
646 static inline void set_Block_cfgpred_(ir_node *node, int pos, ir_node *cfgpred)
647 {
648  assert(0 <= pos && pos < get_Block_n_cfgpreds(node));
649  set_irn_n(node, pos, cfgpred);
650 }
651 
652 static inline ir_node **get_Block_cfgpred_arr_(ir_node *node)
653 {
654  assert(is_Block(node));
655  return get_irn_in(node);
656 }
657 
658 static inline int is_Builtin_(const ir_node *node)
659 {
660  return get_irn_op(node) == op_Builtin;
661 }
662 static inline ir_node *get_Builtin_mem_(const ir_node *node)
663 {
664  assert(is_Builtin(node));
665  return get_irn_n(node, n_Builtin_mem);
666 }
667 
668 static inline void set_Builtin_mem_(ir_node *node, ir_node *mem)
669 {
670  assert(is_Builtin(node));
671  set_irn_n(node, n_Builtin_mem, mem);
672 }
673 
674 static inline int get_Builtin_n_params_(ir_node const *node)
675 {
676  assert(is_Builtin(node));
677  return get_irn_arity(node) - (n_Builtin_max + 1);
678 }
679 
680 static inline ir_node *get_Builtin_param_(ir_node const *node, int pos)
681 {
682  assert(0 <= pos && pos < get_Builtin_n_params(node));
683  return get_irn_n(node, pos + (n_Builtin_max + 1));
684 }
685 
686 static inline void set_Builtin_param_(ir_node *node, int pos, ir_node *param)
687 {
688  assert(0 <= pos && pos < get_Builtin_n_params(node));
689  set_irn_n(node, pos + (n_Builtin_max + 1), param);
690 }
691 
692 static inline ir_node **get_Builtin_param_arr_(ir_node *node)
693 {
694  assert(is_Builtin(node));
695  return get_irn_in(node) + (n_Builtin_max + 1);
696 }
697 
698 static inline int is_Call_(const ir_node *node)
699 {
700  return get_irn_op(node) == op_Call;
701 }
702 static inline ir_node *get_Call_mem_(const ir_node *node)
703 {
704  assert(is_Call(node));
705  return get_irn_n(node, n_Call_mem);
706 }
707 
708 static inline void set_Call_mem_(ir_node *node, ir_node *mem)
709 {
710  assert(is_Call(node));
711  set_irn_n(node, n_Call_mem, mem);
712 }
713 
714 static inline ir_node *get_Call_ptr_(const ir_node *node)
715 {
716  assert(is_Call(node));
717  return get_irn_n(node, n_Call_ptr);
718 }
719 
720 static inline void set_Call_ptr_(ir_node *node, ir_node *ptr)
721 {
722  assert(is_Call(node));
723  set_irn_n(node, n_Call_ptr, ptr);
724 }
725 
726 static inline int get_Call_n_params_(ir_node const *node)
727 {
728  assert(is_Call(node));
729  return get_irn_arity(node) - (n_Call_max + 1);
730 }
731 
732 static inline ir_node *get_Call_param_(ir_node const *node, int pos)
733 {
734  assert(0 <= pos && pos < get_Call_n_params(node));
735  return get_irn_n(node, pos + (n_Call_max + 1));
736 }
737 
738 static inline void set_Call_param_(ir_node *node, int pos, ir_node *param)
739 {
740  assert(0 <= pos && pos < get_Call_n_params(node));
741  set_irn_n(node, pos + (n_Call_max + 1), param);
742 }
743 
744 static inline ir_node **get_Call_param_arr_(ir_node *node)
745 {
746  assert(is_Call(node));
747  return get_irn_in(node) + (n_Call_max + 1);
748 }
749 
750 static inline int is_Cmp_(const ir_node *node)
751 {
752  return get_irn_op(node) == op_Cmp;
753 }
754 static inline ir_node *get_Cmp_left_(const ir_node *node)
755 {
756  assert(is_Cmp(node));
757  return get_irn_n(node, n_Cmp_left);
758 }
759 
760 static inline void set_Cmp_left_(ir_node *node, ir_node *left)
761 {
762  assert(is_Cmp(node));
763  set_irn_n(node, n_Cmp_left, left);
764 }
765 
766 static inline ir_node *get_Cmp_right_(const ir_node *node)
767 {
768  assert(is_Cmp(node));
769  return get_irn_n(node, n_Cmp_right);
770 }
771 
772 static inline void set_Cmp_right_(ir_node *node, ir_node *right)
773 {
774  assert(is_Cmp(node));
775  set_irn_n(node, n_Cmp_right, right);
776 }
777 
778 static inline int is_Cond_(const ir_node *node)
779 {
780  return get_irn_op(node) == op_Cond;
781 }
782 static inline ir_node *get_Cond_selector_(const ir_node *node)
783 {
784  assert(is_Cond(node));
785  return get_irn_n(node, n_Cond_selector);
786 }
787 
788 static inline void set_Cond_selector_(ir_node *node, ir_node *selector)
789 {
790  assert(is_Cond(node));
791  set_irn_n(node, n_Cond_selector, selector);
792 }
793 
794 static inline int is_Confirm_(const ir_node *node)
795 {
796  return get_irn_op(node) == op_Confirm;
797 }
798 static inline ir_node *get_Confirm_value_(const ir_node *node)
799 {
800  assert(is_Confirm(node));
801  return get_irn_n(node, n_Confirm_value);
802 }
803 
804 static inline void set_Confirm_value_(ir_node *node, ir_node *value)
805 {
806  assert(is_Confirm(node));
807  set_irn_n(node, n_Confirm_value, value);
808 }
809 
810 static inline ir_node *get_Confirm_bound_(const ir_node *node)
811 {
812  assert(is_Confirm(node));
813  return get_irn_n(node, n_Confirm_bound);
814 }
815 
816 static inline void set_Confirm_bound_(ir_node *node, ir_node *bound)
817 {
818  assert(is_Confirm(node));
819  set_irn_n(node, n_Confirm_bound, bound);
820 }
821 
822 static inline int is_Const_(const ir_node *node)
823 {
824  return get_irn_op(node) == op_Const;
825 }
826 static inline int is_Conv_(const ir_node *node)
827 {
828  return get_irn_op(node) == op_Conv;
829 }
830 static inline ir_node *get_Conv_op_(const ir_node *node)
831 {
832  assert(is_Conv(node));
833  return get_irn_n(node, n_Conv_op);
834 }
835 
836 static inline void set_Conv_op_(ir_node *node, ir_node *op)
837 {
838  assert(is_Conv(node));
839  set_irn_n(node, n_Conv_op, op);
840 }
841 
842 static inline int is_CopyB_(const ir_node *node)
843 {
844  return get_irn_op(node) == op_CopyB;
845 }
846 static inline ir_node *get_CopyB_mem_(const ir_node *node)
847 {
848  assert(is_CopyB(node));
849  return get_irn_n(node, n_CopyB_mem);
850 }
851 
852 static inline void set_CopyB_mem_(ir_node *node, ir_node *mem)
853 {
854  assert(is_CopyB(node));
855  set_irn_n(node, n_CopyB_mem, mem);
856 }
857 
858 static inline ir_node *get_CopyB_dst_(const ir_node *node)
859 {
860  assert(is_CopyB(node));
861  return get_irn_n(node, n_CopyB_dst);
862 }
863 
864 static inline void set_CopyB_dst_(ir_node *node, ir_node *dst)
865 {
866  assert(is_CopyB(node));
867  set_irn_n(node, n_CopyB_dst, dst);
868 }
869 
870 static inline ir_node *get_CopyB_src_(const ir_node *node)
871 {
872  assert(is_CopyB(node));
873  return get_irn_n(node, n_CopyB_src);
874 }
875 
876 static inline void set_CopyB_src_(ir_node *node, ir_node *src)
877 {
878  assert(is_CopyB(node));
879  set_irn_n(node, n_CopyB_src, src);
880 }
881 
882 static inline int is_Deleted_(const ir_node *node)
883 {
884  return get_irn_op(node) == op_Deleted;
885 }
886 static inline int is_Div_(const ir_node *node)
887 {
888  return get_irn_op(node) == op_Div;
889 }
890 static inline ir_node *get_Div_mem_(const ir_node *node)
891 {
892  assert(is_Div(node));
893  return get_irn_n(node, n_Div_mem);
894 }
895 
896 static inline void set_Div_mem_(ir_node *node, ir_node *mem)
897 {
898  assert(is_Div(node));
899  set_irn_n(node, n_Div_mem, mem);
900 }
901 
902 static inline ir_node *get_Div_left_(const ir_node *node)
903 {
904  assert(is_Div(node));
905  return get_irn_n(node, n_Div_left);
906 }
907 
908 static inline void set_Div_left_(ir_node *node, ir_node *left)
909 {
910  assert(is_Div(node));
911  set_irn_n(node, n_Div_left, left);
912 }
913 
914 static inline ir_node *get_Div_right_(const ir_node *node)
915 {
916  assert(is_Div(node));
917  return get_irn_n(node, n_Div_right);
918 }
919 
920 static inline void set_Div_right_(ir_node *node, ir_node *right)
921 {
922  assert(is_Div(node));
923  set_irn_n(node, n_Div_right, right);
924 }
925 
926 static inline int is_Dummy_(const ir_node *node)
927 {
928  return get_irn_op(node) == op_Dummy;
929 }
930 static inline int is_End_(const ir_node *node)
931 {
932  return get_irn_op(node) == op_End;
933 }
934 static inline int get_End_n_keepalives_(ir_node const *node)
935 {
936  assert(is_End(node));
937  return get_irn_arity(node);
938 }
939 
940 static inline ir_node *get_End_keepalive_(ir_node const *node, int pos)
941 {
942  assert(0 <= pos && pos < get_End_n_keepalives(node));
943  return get_irn_n(node, pos);
944 }
945 
946 static inline void set_End_keepalive_(ir_node *node, int pos, ir_node *keepalive)
947 {
948  assert(0 <= pos && pos < get_End_n_keepalives(node));
949  set_irn_n(node, pos, keepalive);
950 }
951 
952 static inline ir_node **get_End_keepalive_arr_(ir_node *node)
953 {
954  assert(is_End(node));
955  return get_irn_in(node);
956 }
957 
958 static inline int is_Eor_(const ir_node *node)
959 {
960  return get_irn_op(node) == op_Eor;
961 }
962 static inline ir_node *get_Eor_left_(const ir_node *node)
963 {
964  assert(is_Eor(node));
965  return get_irn_n(node, n_Eor_left);
966 }
967 
968 static inline void set_Eor_left_(ir_node *node, ir_node *left)
969 {
970  assert(is_Eor(node));
971  set_irn_n(node, n_Eor_left, left);
972 }
973 
974 static inline ir_node *get_Eor_right_(const ir_node *node)
975 {
976  assert(is_Eor(node));
977  return get_irn_n(node, n_Eor_right);
978 }
979 
980 static inline void set_Eor_right_(ir_node *node, ir_node *right)
981 {
982  assert(is_Eor(node));
983  set_irn_n(node, n_Eor_right, right);
984 }
985 
986 static inline int is_Free_(const ir_node *node)
987 {
988  return get_irn_op(node) == op_Free;
989 }
990 static inline ir_node *get_Free_mem_(const ir_node *node)
991 {
992  assert(is_Free(node));
993  return get_irn_n(node, n_Free_mem);
994 }
995 
996 static inline void set_Free_mem_(ir_node *node, ir_node *mem)
997 {
998  assert(is_Free(node));
999  set_irn_n(node, n_Free_mem, mem);
1000 }
1001 
1002 static inline ir_node *get_Free_ptr_(const ir_node *node)
1003 {
1004  assert(is_Free(node));
1005  return get_irn_n(node, n_Free_ptr);
1006 }
1007 
1008 static inline void set_Free_ptr_(ir_node *node, ir_node *ptr)
1009 {
1010  assert(is_Free(node));
1011  set_irn_n(node, n_Free_ptr, ptr);
1012 }
1013 
1014 static inline int is_IJmp_(const ir_node *node)
1015 {
1016  return get_irn_op(node) == op_IJmp;
1017 }
1018 static inline ir_node *get_IJmp_target_(const ir_node *node)
1019 {
1020  assert(is_IJmp(node));
1021  return get_irn_n(node, n_IJmp_target);
1022 }
1023 
1024 static inline void set_IJmp_target_(ir_node *node, ir_node *target)
1025 {
1026  assert(is_IJmp(node));
1027  set_irn_n(node, n_IJmp_target, target);
1028 }
1029 
1030 static inline int is_Id_(const ir_node *node)
1031 {
1032  return get_irn_op(node) == op_Id;
1033 }
1034 static inline ir_node *get_Id_pred_(const ir_node *node)
1035 {
1036  assert(is_Id(node));
1037  return get_irn_n(node, n_Id_pred);
1038 }
1039 
1040 static inline void set_Id_pred_(ir_node *node, ir_node *pred)
1041 {
1042  assert(is_Id(node));
1043  set_irn_n(node, n_Id_pred, pred);
1044 }
1045 
1046 static inline int is_Jmp_(const ir_node *node)
1047 {
1048  return get_irn_op(node) == op_Jmp;
1049 }
1050 static inline int is_Load_(const ir_node *node)
1051 {
1052  return get_irn_op(node) == op_Load;
1053 }
1054 static inline ir_node *get_Load_mem_(const ir_node *node)
1055 {
1056  assert(is_Load(node));
1057  return get_irn_n(node, n_Load_mem);
1058 }
1059 
1060 static inline void set_Load_mem_(ir_node *node, ir_node *mem)
1061 {
1062  assert(is_Load(node));
1063  set_irn_n(node, n_Load_mem, mem);
1064 }
1065 
1066 static inline ir_node *get_Load_ptr_(const ir_node *node)
1067 {
1068  assert(is_Load(node));
1069  return get_irn_n(node, n_Load_ptr);
1070 }
1071 
1072 static inline void set_Load_ptr_(ir_node *node, ir_node *ptr)
1073 {
1074  assert(is_Load(node));
1075  set_irn_n(node, n_Load_ptr, ptr);
1076 }
1077 
1078 static inline int is_Member_(const ir_node *node)
1079 {
1080  return get_irn_op(node) == op_Member;
1081 }
1082 static inline ir_node *get_Member_ptr_(const ir_node *node)
1083 {
1084  assert(is_Member(node));
1085  return get_irn_n(node, n_Member_ptr);
1086 }
1087 
1088 static inline void set_Member_ptr_(ir_node *node, ir_node *ptr)
1089 {
1090  assert(is_Member(node));
1091  set_irn_n(node, n_Member_ptr, ptr);
1092 }
1093 
1094 static inline int is_Minus_(const ir_node *node)
1095 {
1096  return get_irn_op(node) == op_Minus;
1097 }
1098 static inline ir_node *get_Minus_op_(const ir_node *node)
1099 {
1100  assert(is_Minus(node));
1101  return get_irn_n(node, n_Minus_op);
1102 }
1103 
1104 static inline void set_Minus_op_(ir_node *node, ir_node *op)
1105 {
1106  assert(is_Minus(node));
1107  set_irn_n(node, n_Minus_op, op);
1108 }
1109 
1110 static inline int is_Mod_(const ir_node *node)
1111 {
1112  return get_irn_op(node) == op_Mod;
1113 }
1114 static inline ir_node *get_Mod_mem_(const ir_node *node)
1115 {
1116  assert(is_Mod(node));
1117  return get_irn_n(node, n_Mod_mem);
1118 }
1119 
1120 static inline void set_Mod_mem_(ir_node *node, ir_node *mem)
1121 {
1122  assert(is_Mod(node));
1123  set_irn_n(node, n_Mod_mem, mem);
1124 }
1125 
1126 static inline ir_node *get_Mod_left_(const ir_node *node)
1127 {
1128  assert(is_Mod(node));
1129  return get_irn_n(node, n_Mod_left);
1130 }
1131 
1132 static inline void set_Mod_left_(ir_node *node, ir_node *left)
1133 {
1134  assert(is_Mod(node));
1135  set_irn_n(node, n_Mod_left, left);
1136 }
1137 
1138 static inline ir_node *get_Mod_right_(const ir_node *node)
1139 {
1140  assert(is_Mod(node));
1141  return get_irn_n(node, n_Mod_right);
1142 }
1143 
1144 static inline void set_Mod_right_(ir_node *node, ir_node *right)
1145 {
1146  assert(is_Mod(node));
1147  set_irn_n(node, n_Mod_right, right);
1148 }
1149 
1150 static inline int is_Mul_(const ir_node *node)
1151 {
1152  return get_irn_op(node) == op_Mul;
1153 }
1154 static inline ir_node *get_Mul_left_(const ir_node *node)
1155 {
1156  assert(is_Mul(node));
1157  return get_irn_n(node, n_Mul_left);
1158 }
1159 
1160 static inline void set_Mul_left_(ir_node *node, ir_node *left)
1161 {
1162  assert(is_Mul(node));
1163  set_irn_n(node, n_Mul_left, left);
1164 }
1165 
1166 static inline ir_node *get_Mul_right_(const ir_node *node)
1167 {
1168  assert(is_Mul(node));
1169  return get_irn_n(node, n_Mul_right);
1170 }
1171 
1172 static inline void set_Mul_right_(ir_node *node, ir_node *right)
1173 {
1174  assert(is_Mul(node));
1175  set_irn_n(node, n_Mul_right, right);
1176 }
1177 
1178 static inline int is_Mulh_(const ir_node *node)
1179 {
1180  return get_irn_op(node) == op_Mulh;
1181 }
1182 static inline ir_node *get_Mulh_left_(const ir_node *node)
1183 {
1184  assert(is_Mulh(node));
1185  return get_irn_n(node, n_Mulh_left);
1186 }
1187 
1188 static inline void set_Mulh_left_(ir_node *node, ir_node *left)
1189 {
1190  assert(is_Mulh(node));
1191  set_irn_n(node, n_Mulh_left, left);
1192 }
1193 
1194 static inline ir_node *get_Mulh_right_(const ir_node *node)
1195 {
1196  assert(is_Mulh(node));
1197  return get_irn_n(node, n_Mulh_right);
1198 }
1199 
1200 static inline void set_Mulh_right_(ir_node *node, ir_node *right)
1201 {
1202  assert(is_Mulh(node));
1203  set_irn_n(node, n_Mulh_right, right);
1204 }
1205 
1206 static inline int is_Mux_(const ir_node *node)
1207 {
1208  return get_irn_op(node) == op_Mux;
1209 }
1210 static inline ir_node *get_Mux_sel_(const ir_node *node)
1211 {
1212  assert(is_Mux(node));
1213  return get_irn_n(node, n_Mux_sel);
1214 }
1215 
1216 static inline void set_Mux_sel_(ir_node *node, ir_node *sel)
1217 {
1218  assert(is_Mux(node));
1219  set_irn_n(node, n_Mux_sel, sel);
1220 }
1221 
1222 static inline ir_node *get_Mux_false_(const ir_node *node)
1223 {
1224  assert(is_Mux(node));
1225  return get_irn_n(node, n_Mux_false);
1226 }
1227 
1228 static inline void set_Mux_false_(ir_node *node, ir_node *false_)
1229 {
1230  assert(is_Mux(node));
1231  set_irn_n(node, n_Mux_false, false_);
1232 }
1233 
1234 static inline ir_node *get_Mux_true_(const ir_node *node)
1235 {
1236  assert(is_Mux(node));
1237  return get_irn_n(node, n_Mux_true);
1238 }
1239 
1240 static inline void set_Mux_true_(ir_node *node, ir_node *true_)
1241 {
1242  assert(is_Mux(node));
1243  set_irn_n(node, n_Mux_true, true_);
1244 }
1245 
1246 static inline int is_NoMem_(const ir_node *node)
1247 {
1248  return get_irn_op(node) == op_NoMem;
1249 }
1250 static inline int is_Not_(const ir_node *node)
1251 {
1252  return get_irn_op(node) == op_Not;
1253 }
1254 static inline ir_node *get_Not_op_(const ir_node *node)
1255 {
1256  assert(is_Not(node));
1257  return get_irn_n(node, n_Not_op);
1258 }
1259 
1260 static inline void set_Not_op_(ir_node *node, ir_node *op)
1261 {
1262  assert(is_Not(node));
1263  set_irn_n(node, n_Not_op, op);
1264 }
1265 
1266 static inline int is_Offset_(const ir_node *node)
1267 {
1268  return get_irn_op(node) == op_Offset;
1269 }
1270 static inline int is_Or_(const ir_node *node)
1271 {
1272  return get_irn_op(node) == op_Or;
1273 }
1274 static inline ir_node *get_Or_left_(const ir_node *node)
1275 {
1276  assert(is_Or(node));
1277  return get_irn_n(node, n_Or_left);
1278 }
1279 
1280 static inline void set_Or_left_(ir_node *node, ir_node *left)
1281 {
1282  assert(is_Or(node));
1283  set_irn_n(node, n_Or_left, left);
1284 }
1285 
1286 static inline ir_node *get_Or_right_(const ir_node *node)
1287 {
1288  assert(is_Or(node));
1289  return get_irn_n(node, n_Or_right);
1290 }
1291 
1292 static inline void set_Or_right_(ir_node *node, ir_node *right)
1293 {
1294  assert(is_Or(node));
1295  set_irn_n(node, n_Or_right, right);
1296 }
1297 
1298 static inline int is_Phi_(const ir_node *node)
1299 {
1300  return get_irn_op(node) == op_Phi;
1301 }
1302 static inline int get_Phi_n_preds_(ir_node const *node)
1303 {
1304  assert(is_Phi(node));
1305  return get_irn_arity(node);
1306 }
1307 
1308 static inline ir_node *get_Phi_pred_(ir_node const *node, int pos)
1309 {
1310  assert(0 <= pos && pos < get_Phi_n_preds(node));
1311  return get_irn_n(node, pos);
1312 }
1313 
1314 static inline void set_Phi_pred_(ir_node *node, int pos, ir_node *pred)
1315 {
1316  assert(0 <= pos && pos < get_Phi_n_preds(node));
1317  set_irn_n(node, pos, pred);
1318 }
1319 
1320 static inline ir_node **get_Phi_pred_arr_(ir_node *node)
1321 {
1322  assert(is_Phi(node));
1323  return get_irn_in(node);
1324 }
1325 
1326 static inline int is_Pin_(const ir_node *node)
1327 {
1328  return get_irn_op(node) == op_Pin;
1329 }
1330 static inline ir_node *get_Pin_op_(const ir_node *node)
1331 {
1332  assert(is_Pin(node));
1333  return get_irn_n(node, n_Pin_op);
1334 }
1335 
1336 static inline void set_Pin_op_(ir_node *node, ir_node *op)
1337 {
1338  assert(is_Pin(node));
1339  set_irn_n(node, n_Pin_op, op);
1340 }
1341 
1342 static inline int is_Proj_(const ir_node *node)
1343 {
1344  return get_irn_op(node) == op_Proj;
1345 }
1346 static inline ir_node *get_Proj_pred_(const ir_node *node)
1347 {
1348  assert(is_Proj(node));
1349  return get_irn_n(node, n_Proj_pred);
1350 }
1351 
1352 static inline void set_Proj_pred_(ir_node *node, ir_node *pred)
1353 {
1354  assert(is_Proj(node));
1355  set_irn_n(node, n_Proj_pred, pred);
1356 }
1357 
1358 static inline int is_Raise_(const ir_node *node)
1359 {
1360  return get_irn_op(node) == op_Raise;
1361 }
1362 static inline ir_node *get_Raise_mem_(const ir_node *node)
1363 {
1364  assert(is_Raise(node));
1365  return get_irn_n(node, n_Raise_mem);
1366 }
1367 
1368 static inline void set_Raise_mem_(ir_node *node, ir_node *mem)
1369 {
1370  assert(is_Raise(node));
1371  set_irn_n(node, n_Raise_mem, mem);
1372 }
1373 
1374 static inline ir_node *get_Raise_exo_ptr_(const ir_node *node)
1375 {
1376  assert(is_Raise(node));
1377  return get_irn_n(node, n_Raise_exo_ptr);
1378 }
1379 
1380 static inline void set_Raise_exo_ptr_(ir_node *node, ir_node *exo_ptr)
1381 {
1382  assert(is_Raise(node));
1383  set_irn_n(node, n_Raise_exo_ptr, exo_ptr);
1384 }
1385 
1386 static inline int is_Return_(const ir_node *node)
1387 {
1388  return get_irn_op(node) == op_Return;
1389 }
1390 static inline ir_node *get_Return_mem_(const ir_node *node)
1391 {
1392  assert(is_Return(node));
1393  return get_irn_n(node, n_Return_mem);
1394 }
1395 
1396 static inline void set_Return_mem_(ir_node *node, ir_node *mem)
1397 {
1398  assert(is_Return(node));
1399  set_irn_n(node, n_Return_mem, mem);
1400 }
1401 
1402 static inline int get_Return_n_ress_(ir_node const *node)
1403 {
1404  assert(is_Return(node));
1405  return get_irn_arity(node) - (n_Return_max + 1);
1406 }
1407 
1408 static inline ir_node *get_Return_res_(ir_node const *node, int pos)
1409 {
1410  assert(0 <= pos && pos < get_Return_n_ress(node));
1411  return get_irn_n(node, pos + (n_Return_max + 1));
1412 }
1413 
1414 static inline void set_Return_res_(ir_node *node, int pos, ir_node *res)
1415 {
1416  assert(0 <= pos && pos < get_Return_n_ress(node));
1417  set_irn_n(node, pos + (n_Return_max + 1), res);
1418 }
1419 
1420 static inline ir_node **get_Return_res_arr_(ir_node *node)
1421 {
1422  assert(is_Return(node));
1423  return get_irn_in(node) + (n_Return_max + 1);
1424 }
1425 
1426 static inline int is_Sel_(const ir_node *node)
1427 {
1428  return get_irn_op(node) == op_Sel;
1429 }
1430 static inline ir_node *get_Sel_ptr_(const ir_node *node)
1431 {
1432  assert(is_Sel(node));
1433  return get_irn_n(node, n_Sel_ptr);
1434 }
1435 
1436 static inline void set_Sel_ptr_(ir_node *node, ir_node *ptr)
1437 {
1438  assert(is_Sel(node));
1439  set_irn_n(node, n_Sel_ptr, ptr);
1440 }
1441 
1442 static inline ir_node *get_Sel_index_(const ir_node *node)
1443 {
1444  assert(is_Sel(node));
1445  return get_irn_n(node, n_Sel_index);
1446 }
1447 
1448 static inline void set_Sel_index_(ir_node *node, ir_node *index)
1449 {
1450  assert(is_Sel(node));
1451  set_irn_n(node, n_Sel_index, index);
1452 }
1453 
1454 static inline int is_Shl_(const ir_node *node)
1455 {
1456  return get_irn_op(node) == op_Shl;
1457 }
1458 static inline ir_node *get_Shl_left_(const ir_node *node)
1459 {
1460  assert(is_Shl(node));
1461  return get_irn_n(node, n_Shl_left);
1462 }
1463 
1464 static inline void set_Shl_left_(ir_node *node, ir_node *left)
1465 {
1466  assert(is_Shl(node));
1467  set_irn_n(node, n_Shl_left, left);
1468 }
1469 
1470 static inline ir_node *get_Shl_right_(const ir_node *node)
1471 {
1472  assert(is_Shl(node));
1473  return get_irn_n(node, n_Shl_right);
1474 }
1475 
1476 static inline void set_Shl_right_(ir_node *node, ir_node *right)
1477 {
1478  assert(is_Shl(node));
1479  set_irn_n(node, n_Shl_right, right);
1480 }
1481 
1482 static inline int is_Shr_(const ir_node *node)
1483 {
1484  return get_irn_op(node) == op_Shr;
1485 }
1486 static inline ir_node *get_Shr_left_(const ir_node *node)
1487 {
1488  assert(is_Shr(node));
1489  return get_irn_n(node, n_Shr_left);
1490 }
1491 
1492 static inline void set_Shr_left_(ir_node *node, ir_node *left)
1493 {
1494  assert(is_Shr(node));
1495  set_irn_n(node, n_Shr_left, left);
1496 }
1497 
1498 static inline ir_node *get_Shr_right_(const ir_node *node)
1499 {
1500  assert(is_Shr(node));
1501  return get_irn_n(node, n_Shr_right);
1502 }
1503 
1504 static inline void set_Shr_right_(ir_node *node, ir_node *right)
1505 {
1506  assert(is_Shr(node));
1507  set_irn_n(node, n_Shr_right, right);
1508 }
1509 
1510 static inline int is_Shrs_(const ir_node *node)
1511 {
1512  return get_irn_op(node) == op_Shrs;
1513 }
1514 static inline ir_node *get_Shrs_left_(const ir_node *node)
1515 {
1516  assert(is_Shrs(node));
1517  return get_irn_n(node, n_Shrs_left);
1518 }
1519 
1520 static inline void set_Shrs_left_(ir_node *node, ir_node *left)
1521 {
1522  assert(is_Shrs(node));
1523  set_irn_n(node, n_Shrs_left, left);
1524 }
1525 
1526 static inline ir_node *get_Shrs_right_(const ir_node *node)
1527 {
1528  assert(is_Shrs(node));
1529  return get_irn_n(node, n_Shrs_right);
1530 }
1531 
1532 static inline void set_Shrs_right_(ir_node *node, ir_node *right)
1533 {
1534  assert(is_Shrs(node));
1535  set_irn_n(node, n_Shrs_right, right);
1536 }
1537 
1538 static inline int is_Size_(const ir_node *node)
1539 {
1540  return get_irn_op(node) == op_Size;
1541 }
1542 static inline int is_Start_(const ir_node *node)
1543 {
1544  return get_irn_op(node) == op_Start;
1545 }
1546 static inline int is_Store_(const ir_node *node)
1547 {
1548  return get_irn_op(node) == op_Store;
1549 }
1550 static inline ir_node *get_Store_mem_(const ir_node *node)
1551 {
1552  assert(is_Store(node));
1553  return get_irn_n(node, n_Store_mem);
1554 }
1555 
1556 static inline void set_Store_mem_(ir_node *node, ir_node *mem)
1557 {
1558  assert(is_Store(node));
1559  set_irn_n(node, n_Store_mem, mem);
1560 }
1561 
1562 static inline ir_node *get_Store_ptr_(const ir_node *node)
1563 {
1564  assert(is_Store(node));
1565  return get_irn_n(node, n_Store_ptr);
1566 }
1567 
1568 static inline void set_Store_ptr_(ir_node *node, ir_node *ptr)
1569 {
1570  assert(is_Store(node));
1571  set_irn_n(node, n_Store_ptr, ptr);
1572 }
1573 
1574 static inline ir_node *get_Store_value_(const ir_node *node)
1575 {
1576  assert(is_Store(node));
1577  return get_irn_n(node, n_Store_value);
1578 }
1579 
1580 static inline void set_Store_value_(ir_node *node, ir_node *value)
1581 {
1582  assert(is_Store(node));
1583  set_irn_n(node, n_Store_value, value);
1584 }
1585 
1586 static inline int is_Sub_(const ir_node *node)
1587 {
1588  return get_irn_op(node) == op_Sub;
1589 }
1590 static inline ir_node *get_Sub_left_(const ir_node *node)
1591 {
1592  assert(is_Sub(node));
1593  return get_irn_n(node, n_Sub_left);
1594 }
1595 
1596 static inline void set_Sub_left_(ir_node *node, ir_node *left)
1597 {
1598  assert(is_Sub(node));
1599  set_irn_n(node, n_Sub_left, left);
1600 }
1601 
1602 static inline ir_node *get_Sub_right_(const ir_node *node)
1603 {
1604  assert(is_Sub(node));
1605  return get_irn_n(node, n_Sub_right);
1606 }
1607 
1608 static inline void set_Sub_right_(ir_node *node, ir_node *right)
1609 {
1610  assert(is_Sub(node));
1611  set_irn_n(node, n_Sub_right, right);
1612 }
1613 
1614 static inline int is_Switch_(const ir_node *node)
1615 {
1616  return get_irn_op(node) == op_Switch;
1617 }
1618 static inline ir_node *get_Switch_selector_(const ir_node *node)
1619 {
1620  assert(is_Switch(node));
1621  return get_irn_n(node, n_Switch_selector);
1622 }
1623 
1624 static inline void set_Switch_selector_(ir_node *node, ir_node *selector)
1625 {
1626  assert(is_Switch(node));
1627  set_irn_n(node, n_Switch_selector, selector);
1628 }
1629 
1630 static inline int is_Sync_(const ir_node *node)
1631 {
1632  return get_irn_op(node) == op_Sync;
1633 }
1634 static inline int get_Sync_n_preds_(ir_node const *node)
1635 {
1636  assert(is_Sync(node));
1637  return get_irn_arity(node);
1638 }
1639 
1640 static inline ir_node *get_Sync_pred_(ir_node const *node, int pos)
1641 {
1642  assert(0 <= pos && pos < get_Sync_n_preds(node));
1643  return get_irn_n(node, pos);
1644 }
1645 
1646 static inline void set_Sync_pred_(ir_node *node, int pos, ir_node *pred)
1647 {
1648  assert(0 <= pos && pos < get_Sync_n_preds(node));
1649  set_irn_n(node, pos, pred);
1650 }
1651 
1652 static inline ir_node **get_Sync_pred_arr_(ir_node *node)
1653 {
1654  assert(is_Sync(node));
1655  return get_irn_in(node);
1656 }
1657 
1658 static inline int is_Tuple_(const ir_node *node)
1659 {
1660  return get_irn_op(node) == op_Tuple;
1661 }
1662 static inline int get_Tuple_n_preds_(ir_node const *node)
1663 {
1664  assert(is_Tuple(node));
1665  return get_irn_arity(node);
1666 }
1667 
1668 static inline ir_node *get_Tuple_pred_(ir_node const *node, int pos)
1669 {
1670  assert(0 <= pos && pos < get_Tuple_n_preds(node));
1671  return get_irn_n(node, pos);
1672 }
1673 
1674 static inline void set_Tuple_pred_(ir_node *node, int pos, ir_node *pred)
1675 {
1676  assert(0 <= pos && pos < get_Tuple_n_preds(node));
1677  set_irn_n(node, pos, pred);
1678 }
1679 
1680 static inline ir_node **get_Tuple_pred_arr_(ir_node *node)
1681 {
1682  assert(is_Tuple(node));
1683  return get_irn_in(node);
1684 }
1685 
1686 static inline int is_Unknown_(const ir_node *node)
1687 {
1688  return get_irn_op(node) == op_Unknown;
1689 }
1690 static inline int is_entconst_(const ir_node *node)
1691 {
1692  return is_Address(node) || is_Offset(node);
1693 }
1694 
1695 
1696 static inline int is_typeconst_(const ir_node *node)
1697 {
1698  return is_Align(node) || is_Size(node);
1699 }
1700 
1701 
1702 static inline ir_asm_constraint* get_ASM_input_constraints_(const ir_node *node)
1703 {
1704  assert(is_ASM(node));
1705  return node->attr.assem.input_constraints;
1706 }
1707 
1708 static inline void set_ASM_input_constraints_(ir_node *node, ir_asm_constraint* input_constraints)
1709 {
1710  assert(is_ASM(node));
1711  node->attr.assem.input_constraints = input_constraints;
1712 }
1713 
1714 static inline ir_asm_constraint* get_ASM_output_constraints_(const ir_node *node)
1715 {
1716  assert(is_ASM(node));
1717  return node->attr.assem.output_constraints;
1718 }
1719 
1720 static inline void set_ASM_output_constraints_(ir_node *node, ir_asm_constraint* output_constraints)
1721 {
1722  assert(is_ASM(node));
1723  node->attr.assem.output_constraints = output_constraints;
1724 }
1725 
1726 static inline ident** get_ASM_clobbers_(const ir_node *node)
1727 {
1728  assert(is_ASM(node));
1729  return node->attr.assem.clobbers;
1730 }
1731 
1732 static inline void set_ASM_clobbers_(ir_node *node, ident** clobbers)
1733 {
1734  assert(is_ASM(node));
1735  node->attr.assem.clobbers = clobbers;
1736 }
1737 
1738 static inline ident* get_ASM_text_(const ir_node *node)
1739 {
1740  assert(is_ASM(node));
1741  return node->attr.assem.text;
1742 }
1743 
1744 static inline void set_ASM_text_(ir_node *node, ident* text)
1745 {
1746  assert(is_ASM(node));
1747  node->attr.assem.text = text;
1748 }
1749 
1750 static inline ir_entity* get_Address_entity_(const ir_node *node)
1751 {
1752  assert(is_Address(node));
1753  return node->attr.entc.entity;
1754 }
1755 
1756 static inline void set_Address_entity_(ir_node *node, ir_entity* entity)
1757 {
1758  assert(is_Address(node));
1759  node->attr.entc.entity = entity;
1760 }
1761 
1762 static inline ir_type* get_Align_type_(const ir_node *node)
1763 {
1764  assert(is_Align(node));
1765  return node->attr.typec.type;
1766 }
1767 
1768 static inline void set_Align_type_(ir_node *node, ir_type* type)
1769 {
1770  assert(is_Align(node));
1771  node->attr.typec.type = type;
1772 }
1773 
1774 static inline unsigned get_Alloc_alignment_(const ir_node *node)
1775 {
1776  assert(is_Alloc(node));
1777  return node->attr.alloc.alignment;
1778 }
1779 
1780 static inline void set_Alloc_alignment_(ir_node *node, unsigned alignment)
1781 {
1782  assert(is_Alloc(node));
1783  node->attr.alloc.alignment = alignment;
1784 }
1785 
1786 static inline ir_entity* get_Block_entity_(const ir_node *node)
1787 {
1788  assert(is_Block(node));
1789  return node->attr.block.entity;
1790 }
1791 
1792 static inline void set_Block_entity_(ir_node *node, ir_entity* entity)
1793 {
1794  assert(is_Block(node));
1795  node->attr.block.entity = entity;
1796 }
1797 
1798 static inline ir_builtin_kind get_Builtin_kind_(const ir_node *node)
1799 {
1800  assert(is_Builtin(node));
1801  return node->attr.builtin.kind;
1802 }
1803 
1804 static inline void set_Builtin_kind_(ir_node *node, ir_builtin_kind kind)
1805 {
1806  assert(is_Builtin(node));
1807  node->attr.builtin.kind = kind;
1808 }
1809 
1810 static inline ir_type* get_Builtin_type_(const ir_node *node)
1811 {
1812  assert(is_Builtin(node));
1813  return node->attr.builtin.type;
1814 }
1815 
1816 static inline void set_Builtin_type_(ir_node *node, ir_type* type)
1817 {
1818  assert(is_Builtin(node));
1819  node->attr.builtin.type = type;
1820 }
1821 
1822 static inline ir_type* get_Call_type_(const ir_node *node)
1823 {
1824  assert(is_Call(node));
1825  return node->attr.call.type;
1826 }
1827 
1828 static inline void set_Call_type_(ir_node *node, ir_type* type)
1829 {
1830  assert(is_Call(node));
1831  node->attr.call.type = type;
1832 }
1833 
1834 static inline ir_relation get_Cmp_relation_(const ir_node *node)
1835 {
1836  assert(is_Cmp(node));
1837  return node->attr.cmp.relation;
1838 }
1839 
1840 static inline void set_Cmp_relation_(ir_node *node, ir_relation relation)
1841 {
1842  assert(is_Cmp(node));
1843  node->attr.cmp.relation = relation;
1844 }
1845 
1846 static inline cond_jmp_predicate get_Cond_jmp_pred_(const ir_node *node)
1847 {
1848  assert(is_Cond(node));
1849  return node->attr.cond.jmp_pred;
1850 }
1851 
1852 static inline void set_Cond_jmp_pred_(ir_node *node, cond_jmp_predicate jmp_pred)
1853 {
1854  assert(is_Cond(node));
1855  node->attr.cond.jmp_pred = jmp_pred;
1856 }
1857 
1858 static inline ir_relation get_Confirm_relation_(const ir_node *node)
1859 {
1860  assert(is_Confirm(node));
1861  return node->attr.confirm.relation;
1862 }
1863 
1864 static inline void set_Confirm_relation_(ir_node *node, ir_relation relation)
1865 {
1866  assert(is_Confirm(node));
1867  node->attr.confirm.relation = relation;
1868 }
1869 
1870 static inline ir_tarval* get_Const_tarval_(const ir_node *node)
1871 {
1872  assert(is_Const(node));
1873  return node->attr.con.tarval;
1874 }
1875 
1876 static inline void set_Const_tarval_(ir_node *node, ir_tarval* tarval)
1877 {
1878  assert(is_Const(node));
1879  node->attr.con.tarval = tarval;
1880 }
1881 
1882 static inline ir_type* get_CopyB_type_(const ir_node *node)
1883 {
1884  assert(is_CopyB(node));
1885  return node->attr.copyb.type;
1886 }
1887 
1888 static inline void set_CopyB_type_(ir_node *node, ir_type* type)
1889 {
1890  assert(is_CopyB(node));
1891  node->attr.copyb.type = type;
1892 }
1893 
1894 static inline ir_volatility get_CopyB_volatility_(const ir_node *node)
1895 {
1896  assert(is_CopyB(node));
1897  return node->attr.copyb.volatility;
1898 }
1899 
1900 static inline void set_CopyB_volatility_(ir_node *node, ir_volatility volatility)
1901 {
1902  assert(is_CopyB(node));
1903  node->attr.copyb.volatility = volatility;
1904 }
1905 
1906 static inline ir_mode* get_Div_resmode_(const ir_node *node)
1907 {
1908  assert(is_Div(node));
1909  return node->attr.div.resmode;
1910 }
1911 
1912 static inline void set_Div_resmode_(ir_node *node, ir_mode* resmode)
1913 {
1914  assert(is_Div(node));
1915  node->attr.div.resmode = resmode;
1916 }
1917 
1918 static inline int get_Div_no_remainder_(const ir_node *node)
1919 {
1920  assert(is_Div(node));
1921  return node->attr.div.no_remainder;
1922 }
1923 
1924 static inline void set_Div_no_remainder_(ir_node *node, int no_remainder)
1925 {
1926  assert(is_Div(node));
1927  node->attr.div.no_remainder = no_remainder;
1928 }
1929 
1930 static inline ir_mode* get_Load_mode_(const ir_node *node)
1931 {
1932  assert(is_Load(node));
1933  return node->attr.load.mode;
1934 }
1935 
1936 static inline void set_Load_mode_(ir_node *node, ir_mode* mode)
1937 {
1938  assert(is_Load(node));
1939  node->attr.load.mode = mode;
1940 }
1941 
1942 static inline ir_type* get_Load_type_(const ir_node *node)
1943 {
1944  assert(is_Load(node));
1945  return node->attr.load.type;
1946 }
1947 
1948 static inline void set_Load_type_(ir_node *node, ir_type* type)
1949 {
1950  assert(is_Load(node));
1951  node->attr.load.type = type;
1952 }
1953 
1954 static inline ir_volatility get_Load_volatility_(const ir_node *node)
1955 {
1956  assert(is_Load(node));
1957  return node->attr.load.volatility;
1958 }
1959 
1960 static inline void set_Load_volatility_(ir_node *node, ir_volatility volatility)
1961 {
1962  assert(is_Load(node));
1963  node->attr.load.volatility = volatility;
1964 }
1965 
1966 static inline ir_align get_Load_unaligned_(const ir_node *node)
1967 {
1968  assert(is_Load(node));
1969  return node->attr.load.unaligned;
1970 }
1971 
1972 static inline void set_Load_unaligned_(ir_node *node, ir_align unaligned)
1973 {
1974  assert(is_Load(node));
1975  node->attr.load.unaligned = unaligned;
1976 }
1977 
1978 static inline ir_entity* get_Member_entity_(const ir_node *node)
1979 {
1980  assert(is_Member(node));
1981  return node->attr.member.entity;
1982 }
1983 
1984 static inline void set_Member_entity_(ir_node *node, ir_entity* entity)
1985 {
1986  assert(is_Member(node));
1987  node->attr.member.entity = entity;
1988 }
1989 
1990 static inline ir_mode* get_Mod_resmode_(const ir_node *node)
1991 {
1992  assert(is_Mod(node));
1993  return node->attr.mod.resmode;
1994 }
1995 
1996 static inline void set_Mod_resmode_(ir_node *node, ir_mode* resmode)
1997 {
1998  assert(is_Mod(node));
1999  node->attr.mod.resmode = resmode;
2000 }
2001 
2002 static inline ir_entity* get_Offset_entity_(const ir_node *node)
2003 {
2004  assert(is_Offset(node));
2005  return node->attr.entc.entity;
2006 }
2007 
2008 static inline void set_Offset_entity_(ir_node *node, ir_entity* entity)
2009 {
2010  assert(is_Offset(node));
2011  node->attr.entc.entity = entity;
2012 }
2013 
2014 static inline int get_Phi_loop_(const ir_node *node)
2015 {
2016  assert(is_Phi(node));
2017  return node->attr.phi.loop;
2018 }
2019 
2020 static inline void set_Phi_loop_(ir_node *node, int loop)
2021 {
2022  assert(is_Phi(node));
2023  node->attr.phi.loop = loop;
2024 }
2025 
2026 static inline unsigned get_Proj_num_(const ir_node *node)
2027 {
2028  assert(is_Proj(node));
2029  return node->attr.proj.num;
2030 }
2031 
2032 static inline void set_Proj_num_(ir_node *node, unsigned num)
2033 {
2034  assert(is_Proj(node));
2035  node->attr.proj.num = num;
2036 }
2037 
2038 static inline ir_type* get_Sel_type_(const ir_node *node)
2039 {
2040  assert(is_Sel(node));
2041  return node->attr.sel.type;
2042 }
2043 
2044 static inline void set_Sel_type_(ir_node *node, ir_type* type)
2045 {
2046  assert(is_Sel(node));
2047  node->attr.sel.type = type;
2048 }
2049 
2050 static inline ir_type* get_Size_type_(const ir_node *node)
2051 {
2052  assert(is_Size(node));
2053  return node->attr.typec.type;
2054 }
2055 
2056 static inline void set_Size_type_(ir_node *node, ir_type* type)
2057 {
2058  assert(is_Size(node));
2059  node->attr.typec.type = type;
2060 }
2061 
2062 static inline ir_type* get_Store_type_(const ir_node *node)
2063 {
2064  assert(is_Store(node));
2065  return node->attr.store.type;
2066 }
2067 
2068 static inline void set_Store_type_(ir_node *node, ir_type* type)
2069 {
2070  assert(is_Store(node));
2071  node->attr.store.type = type;
2072 }
2073 
2074 static inline ir_volatility get_Store_volatility_(const ir_node *node)
2075 {
2076  assert(is_Store(node));
2077  return node->attr.store.volatility;
2078 }
2079 
2080 static inline void set_Store_volatility_(ir_node *node, ir_volatility volatility)
2081 {
2082  assert(is_Store(node));
2083  node->attr.store.volatility = volatility;
2084 }
2085 
2086 static inline ir_align get_Store_unaligned_(const ir_node *node)
2087 {
2088  assert(is_Store(node));
2089  return node->attr.store.unaligned;
2090 }
2091 
2092 static inline void set_Store_unaligned_(ir_node *node, ir_align unaligned)
2093 {
2094  assert(is_Store(node));
2095  node->attr.store.unaligned = unaligned;
2096 }
2097 
2098 static inline unsigned get_Switch_n_outs_(const ir_node *node)
2099 {
2100  assert(is_Switch(node));
2101  return node->attr.switcha.n_outs;
2102 }
2103 
2104 static inline void set_Switch_n_outs_(ir_node *node, unsigned n_outs)
2105 {
2106  assert(is_Switch(node));
2107  node->attr.switcha.n_outs = n_outs;
2108 }
2109 
2110 static inline ir_switch_table* get_Switch_table_(const ir_node *node)
2111 {
2112  assert(is_Switch(node));
2113  return node->attr.switcha.table;
2114 }
2115 
2116 static inline void set_Switch_table_(ir_node *node, ir_switch_table* table)
2117 {
2118  assert(is_Switch(node));
2119  node->attr.switcha.table = table;
2120 }
2121 
2122 static inline ir_entity* get_entconst_entity_(const ir_node *node)
2123 {
2124  assert(is_entconst(node));
2125  return node->attr.entc.entity;
2126 }
2127 
2128 static inline void set_entconst_entity_(ir_node *node, ir_entity* entity)
2129 {
2130  assert(is_entconst(node));
2131  node->attr.entc.entity = entity;
2132 }
2133 
2134 static inline ir_type* get_typeconst_type_(const ir_node *node)
2135 {
2136  assert(is_typeconst(node));
2137  return node->attr.typec.type;
2138 }
2139 
2140 static inline void set_typeconst_type_(ir_node *node, ir_type* type)
2141 {
2142  assert(is_typeconst(node));
2143  node->attr.typec.type = type;
2144 }
2145 void ir_init_opcodes(void);
2146 void ir_finish_opcodes(void);
2147 
2148 #endif
value to express a constraint for
Definition: nodes.h:1214
int is_Align(const ir_node *node)
Test if node is a Align.
Definition: gen_irnode.c:2965
first operand
Definition: nodes.h:3486
the value which is returned unchanged
Definition: nodes.h:1997
int is_Add(const ir_node *node)
Test if node is a Add.
Definition: gen_irnode.c:2945
start node of this ir_graph
Definition: nodes.h:471
memory dependency
Definition: nodes.h:1853
void set_irn_n(ir_node *node, int n, ir_node *in)
Replaces the n-th predecessor of a node with a new one.
int is_Minus(const ir_node *node)
Test if node is a Minus.
Definition: gen_irnode.c:3285
second operand
Definition: nodes.h:1780
memory dependency
Definition: nodes.h:1424
int is_Builtin(const ir_node *node)
Test if node is a Builtin.
Definition: gen_irnode.c:3030
const char ident
Identifier.
Definition: firm_types.h:50
int is_Shrs(const ir_node *node)
Test if node is a Shrs.
Definition: gen_irnode.c:3420
ir_node * get_irn_n(const ir_node *node, int n)
Returns the n-th predecessor of a node.
int is_IJmp(const ir_node *node)
Test if node is a IJmp.
Definition: gen_irnode.c:3210
ir_op * op_Div
Div opcode.
Definition: nodes.h:1638
selected if sel input is true
Definition: nodes.h:2601
int is_Call(const ir_node *node)
Test if node is a Call.
Definition: gen_irnode.c:3055
memory dependency
Definition: nodes.h:3153
second operand
Definition: nodes.h:2450
first operand
Definition: nodes.h:1779
ir_op * op_Shr
Shr opcode.
Definition: nodes.h:3542
int is_Load(const ir_node *node)
Test if node is a Load.
Definition: gen_irnode.c:3225
int is_Sub(const ir_node *node)
Test if node is a Sub.
Definition: gen_irnode.c:3480
memory dependency
Definition: nodes.h:823
ir_op * op_Sub
Sub opcode.
Definition: nodes.h:3932
ir_op * op_Cmp
Cmp opcode.
Definition: nodes.h:1109
ir_op * op_Bad
Bad opcode.
Definition: nodes.h:665
int is_Conv(const ir_node *node)
Test if node is a Conv.
Definition: gen_irnode.c:3130
memory dependency
Definition: nodes.h:1548
second operand
Definition: nodes.h:2348
int is_Cmp(const ir_node *node)
Test if node is a Cmp.
Definition: gen_irnode.c:3070
end node of this ir_graph
Definition: nodes.h:470
ir_op * op_Alloc
Alloc opcode.
Definition: nodes.h:445
int is_Raise(const ir_node *node)
Test if node is a Raise.
Definition: gen_irnode.c:3385
ir_op * op_Block
Block opcode.
Definition: nodes.h:805
operand
Definition: nodes.h:684
int get_irn_arity(const ir_node *node)
Returns the number of predecessors without the block predecessor.
second operand
Definition: nodes.h:1045
index to select
Definition: nodes.h:3322
first operand
Definition: nodes.h:3408
ir_op * op_And
And opcode.
Definition: nodes.h:593
destination address
Definition: nodes.h:1425
memory dependency
Definition: nodes.h:2346
argument proj of the start node
Definition: nodes.h:474
ir_op * op_Tuple
Tuple opcode.
Definition: nodes.h:4167
int is_Alloc(const ir_node *node)
Test if node is a Alloc.
Definition: gen_irnode.c:2980
first operand
Definition: nodes.h:2524
int is_End(const ir_node *node)
Test if node is a End.
Definition: gen_irnode.c:3195
ir_op * op_Jmp
Jmp opcode.
Definition: nodes.h:2062
int is_Or(const ir_node *node)
Test if node is a Or.
Definition: gen_irnode.c:3345
memory dependency
Definition: nodes.h:114
ir_op * op_Raise
Raise opcode.
Definition: nodes.h:3218
ir_op * op_Mux
Mux opcode.
Definition: nodes.h:2664
value to store
Definition: nodes.h:3762
ir_op * op_Or
Or opcode.
Definition: nodes.h:2914
ir_op * op_Sel
Sel opcode.
Definition: nodes.h:3386
int is_Phi(const ir_node *node)
Test if node is a Phi.
Definition: gen_irnode.c:3350
ir_op * op_Shl
Shl opcode.
Definition: nodes.h:3464
ir_op * op_Id
Id opcode.
Definition: nodes.h:2013
ir_op * op_Sync
Sync opcode.
Definition: nodes.h:4095
int is_Shl(const ir_node *node)
Test if node is a Shl.
Definition: gen_irnode.c:3410
ir_op * op_Cond
Cond opcode.
Definition: nodes.h:1188
ir_op * op_Address
Address opcode.
Definition: nodes.h:291
struct ir_type ir_type
Type.
Definition: firm_types.h:71
ir_op * op_Dummy
Dummy opcode.
Definition: nodes.h:1693
int is_Proj(const ir_node *node)
Test if node is a Proj.
Definition: gen_irnode.c:3370
first operand
Definition: nodes.h:2347
second operand
Definition: nodes.h:3566
int is_Anchor(const ir_node *node)
Test if node is a Anchor.
Definition: gen_irnode.c:2995
memory dependency
Definition: nodes.h:3760
memory dependency
Definition: nodes.h:371
int get_Sync_n_preds(ir_node const *node)
Get the number of Sync preds.
Definition: gen_irnode.c:2783
struct ir_tarval ir_tarval
Target Machine Value.
Definition: firm_types.h:68
int is_And(const ir_node *node)
Test if node is a And.
Definition: gen_irnode.c:3000
int get_End_n_keepalives(ir_node const *node)
Get the number of End keepalives.
Definition: gen_irnode.c:1155
ir_op * op_Minus
Minus opcode.
Definition: nodes.h:2321
ir_op * get_irn_op(const ir_node *node)
Returns the opcode struct of the node.
int is_Size(const ir_node *node)
Test if node is a Size.
Definition: gen_irnode.c:3425
int is_Cond(const ir_node *node)
Test if node is a Cond.
Definition: gen_irnode.c:3085
initial memory of this ir_graph
Definition: nodes.h:473
second operand
Definition: nodes.h:538
ir_op * op_CopyB
CopyB opcode.
Definition: nodes.h:1507
int is_Mod(const ir_node *node)
Test if node is a Mod.
Definition: gen_irnode.c:3290
int get_Phi_n_preds(ir_node const *node)
Get the number of Phi preds.
Definition: gen_irnode.c:2019
ir_op * op_Free
Free opcode.
Definition: nodes.h:1909
int is_typeconst(const ir_node *node)
Test if node is a typeconst.
Definition: gen_irnode.c:3545
int is_Block(const ir_node *node)
Test if node is a Block.
Definition: gen_irnode.c:3015
int is_Tuple(const ir_node *node)
Test if node is a Tuple.
Definition: gen_irnode.c:3515
input selector
Definition: nodes.h:3953
int get_Builtin_n_params(ir_node const *node)
Get the number of Builtin params.
Definition: gen_irnode.c:581
address to store to
Definition: nodes.h:3761
ir_op * op_Deleted
Deleted opcode.
Definition: nodes.h:1530
condition parameter
Definition: nodes.h:1127
int is_Store(const ir_node *node)
Test if node is a Store.
Definition: gen_irnode.c:3445
int is_CopyB(const ir_node *node)
Test if node is a CopyB.
Definition: gen_irnode.c:3135
struct ir_switch_table ir_switch_table
A switch table mapping integer numbers to proj-numbers of a Switch-node.
Definition: firm_types.h:102
second operand
Definition: nodes.h:3487
memory dependency
Definition: nodes.h:2080
second operand
Definition: nodes.h:3877
ir_op * op_Align
Align opcode.
Definition: nodes.h:353
int is_Sync(const ir_node *node)
Test if node is a Sync.
Definition: gen_irnode.c:3510
int is_Pin(const ir_node *node)
Test if node is a Pin.
Definition: gen_irnode.c:3365
first operand
Definition: nodes.h:2858
int is_Free(const ir_node *node)
Test if node is a Free.
Definition: gen_irnode.c:3205
int is_Div(const ir_node *node)
Test if node is a Div.
Definition: gen_irnode.c:3165
A input/output constraint attribute.
Definition: firm_types.h:267
operand
Definition: nodes.h:2731
ir_op * op_Conv
Conv opcode.
Definition: nodes.h:1406
ir_op * op_Shrs
Shrs opcode.
Definition: nodes.h:3621
operand
Definition: nodes.h:2274
target address of the jump
Definition: nodes.h:1929
ir_op * op_NoMem
NoMem opcode.
Definition: nodes.h:2713
ir_op * op_Anchor
Anchor opcode.
Definition: nodes.h:519
ir_builtin_kind
Supported libFirm builtins.
Definition: firm_types.h:276
ir_op * op_Proj
Proj opcode.
Definition: nodes.h:3133
first operand
Definition: nodes.h:1044
int is_Member(const ir_node *node)
Test if node is a Member.
Definition: gen_irnode.c:3270
int is_Not(const ir_node *node)
Test if node is a Not.
Definition: gen_irnode.c:3325
operand
Definition: nodes.h:1355
ir_op * op_Call
Call opcode.
Definition: nodes.h:1025
source address
Definition: nodes.h:1426
ir_relation
Relations for comparing numbers.
Definition: firm_types.h:159
int get_Call_n_params(ir_node const *node)
Get the number of Call params.
Definition: gen_irnode.c:667
int get_Return_n_ress(ir_node const *node)
Get the number of Return ress.
Definition: gen_irnode.c:2242
selected if sel input is false
Definition: nodes.h:2600
ir_op * op_Load
Load opcode.
Definition: nodes.h:2179
int is_Offset(const ir_node *node)
Test if node is a Offset.
Definition: gen_irnode.c:3330
the tuple value from which a part is extracted
Definition: nodes.h:3075
ir_op * op_End
End opcode.
Definition: nodes.h:1759
int is_entconst(const ir_node *node)
Test if node is a entconst.
Definition: gen_irnode.c:3530
ir_op * op_Add
Add opcode.
Definition: nodes.h:232
cond_jmp_predicate
A type to express conditional jump predictions.
Definition: firm_types.h:209
second operand
Definition: nodes.h:1550
ir_op * op_Unknown
Unknown opcode.
Definition: nodes.h:4225
ir_op * op_Mulh
Mulh opcode.
Definition: nodes.h:2580
block the end node belongs to
Definition: nodes.h:468
first operand
Definition: nodes.h:2449
ir_op * op_Switch
Switch opcode.
Definition: nodes.h:4026
ir_op * op_Builtin
Builtin opcode.
Definition: nodes.h:912
int get_ASM_n_inputs(ir_node const *node)
Get the number of ASM inputs.
Definition: gen_irnode.c:28
ir_op * op_Return
Return opcode.
Definition: nodes.h:3300
pointer to object to select from
Definition: nodes.h:2200
struct ir_mode ir_mode
SSA Value mode.
Definition: firm_types.h:59
ir_op * op_Mul
Mul opcode.
Definition: nodes.h:2505
second operand
Definition: nodes.h:3409
int is_Address(const ir_node *node)
Test if node is a Address.
Definition: gen_irnode.c:2950
ir_op * op_Member
Member opcode.
Definition: nodes.h:2256
int is_Bitcast(const ir_node *node)
Test if node is a Bitcast.
Definition: gen_irnode.c:3010
int is_Switch(const ir_node *node)
Test if node is a Switch.
Definition: gen_irnode.c:3485
pointer to called code
Definition: nodes.h:934
pointer to the object to free
Definition: nodes.h:1854
memory dependency
Definition: nodes.h:933
frame of this ir_graph
Definition: nodes.h:472
ir_op * op_Pin
Pin opcode.
Definition: nodes.h:3057
int is_Mulh(const ir_node *node)
Test if node is a Mulh.
Definition: gen_irnode.c:3310
ir_op * op_Start
Start opcode.
Definition: nodes.h:3742
int is_Confirm(const ir_node *node)
Test if node is a Confirm.
Definition: gen_irnode.c:3100
int get_Block_n_cfgpreds(ir_node const *node)
Get the number of Block cfgpreds.
Definition: gen_irnode.c:506
int is_Return(const ir_node *node)
Test if node is a Return.
Definition: gen_irnode.c:3390
ir_op * op_Eor
Eor opcode.
Definition: nodes.h:1835
ir_op * op_IJmp
IJmp opcode.
Definition: nodes.h:1976
first operand
Definition: nodes.h:176
first operand
Definition: nodes.h:3876
pointer to exception object to be thrown
Definition: nodes.h:3154
second operand
Definition: nodes.h:177
int is_ASM(const ir_node *node)
Test if node is a ASM.
Definition: gen_irnode.c:2900
value making the output selection
Definition: nodes.h:2599
int get_Tuple_n_preds(ir_node const *node)
Get the number of Tuple preds.
Definition: gen_irnode.c:2839
int is_Sel(const ir_node *node)
Test if node is a Sel.
Definition: gen_irnode.c:3395
ir_op * op_Bitcast
Bitcast opcode.
Definition: nodes.h:735
address to load from
Definition: nodes.h:2081
struct ir_entity ir_entity
Entity.
Definition: firm_types.h:83
struct ir_node ir_node
Procedure Graph Node.
Definition: firm_types.h:53
ir_op * op_Not
Not opcode.
Definition: nodes.h:2778
ir_op * op_Const
Const opcode.
Definition: nodes.h:1337
int is_Shr(const ir_node *node)
Test if node is a Shr.
Definition: gen_irnode.c:3415
int is_Id(const ir_node *node)
Test if node is a Id.
Definition: gen_irnode.c:3215
first operand
Definition: nodes.h:3565
value to compare against
Definition: nodes.h:1215
the only NoMem node of this ir_graph
Definition: nodes.h:475
block the start node belongs to
Definition: nodes.h:469
ir_op * op_ASM
ASM opcode.
Definition: nodes.h:158
second operand
Definition: nodes.h:2859
ir_op * op_Phi
Phi opcode.
Definition: nodes.h:2990
pointer to array to select from
Definition: nodes.h:3321
memory dependency
Definition: nodes.h:3237
second operand
Definition: nodes.h:2525
size of the block in bytes
Definition: nodes.h:372
int is_Const(const ir_node *node)
Test if node is a Const.
Definition: gen_irnode.c:3115
ir_op * op_Size
Size opcode.
Definition: nodes.h:3683
first operand
Definition: nodes.h:1549
ir_op * op_Offset
Offset opcode.
Definition: nodes.h:2840
int is_Eor(const ir_node *node)
Test if node is a Eor.
Definition: gen_irnode.c:3200
ir_op * op_Confirm
Confirm opcode.
Definition: nodes.h:1279
int is_Mux(const ir_node *node)
Test if node is a Mux.
Definition: gen_irnode.c:3315
int is_Mul(const ir_node *node)
Test if node is a Mul.
Definition: gen_irnode.c:3305
value which is pinned
Definition: nodes.h:3010
ir_op * op_Store
Store opcode.
Definition: nodes.h:3858
ir_op * op_Mod
Mod opcode.
Definition: nodes.h:2431
first operand
Definition: nodes.h:537