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