X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=d44f835bb9cbf2f750307d4612641d0d92d0664e;hb=bbcec654890da41c2299bf3b07d4cb51e9ed48e1;hp=e104a5cdb0e39d0a2403afb3a06515033f54ee25;hpb=91a19e8e14a08c5bbe9b121e55a67a57ca5cf73e;p=libfirm

diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c
index e104a5cdb..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
@@ -1439,6 +1429,7 @@ const char *get_builtin_kind_name(ir_builtin_kind kind) {
 #define X(a)    case a: return #a + 6;
 	switch (kind) {
 		X(ir_bk_trap);
+		X(ir_bk_debugbreak);
 		X(ir_bk_return_address);
 		X(ir_bk_frame_addess);
 		X(ir_bk_prefetch);
@@ -1448,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 "<unknown>";
 #undef X