X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=d44f835bb9cbf2f750307d4612641d0d92d0664e;hb=bbcec654890da41c2299bf3b07d4cb51e9ed48e1;hp=1275599c6c4f1ee5d72c09e28b63f9cfc5c5902b;hpb=2a02c33a6502a20f89cd49ba7dc650ed66318bdf;p=libfirm diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c index 1275599c6..d44f835bb 100644 --- a/ir/ir/irnode.c +++ b/ir/ir/irnode.c @@ -643,16 +643,6 @@ ir_type *is_tls_pointer(const ir_node *n) { return NULL; } -/* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base) - * from Start. If so returns 1, else 0. */ -int is_value_arg_pointer(const ir_node *n) { - if (is_Proj(n) && - (get_Proj_proj(n) == pn_Start_P_value_arg_base) && - is_Start(get_Proj_pred(n))) - return 1; - return 0; -} - /* Returns an array with the predecessors of the Block. Depending on the implementation of the graph data structure this can be a copy of the internal representation of predecessors as well as the internal @@ -1449,6 +1439,9 @@ const char *get_builtin_kind_name(ir_builtin_kind kind) { X(ir_bk_popcount); X(ir_bk_parity); X(ir_bk_bswap); + X(ir_bk_inport); + X(ir_bk_outport); + X(ir_bk_inner_trampoline); } return ""; #undef X