/*
- * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
}
}
-const ir_edge_t *get_irn_edge_kind(const ir_node *src, int pos, ir_edge_kind_t kind)
-{
- ir_graph *irg = get_irn_irg(src);
- if (edges_activated_kind(irg, kind)) {
- irg_edge_info_t *info = get_irg_edge_info(irg, kind);
- ir_edge_t key;
-
- key.src = (ir_node *)src;
- key.pos = pos;
-
- return ir_edgeset_find(&info->edges, &key);
- }
-
- return NULL;
-}
-
/**
* Change the out count
*
}
/**
- * Verify the edge list of a node, ie. ensure it's a loop:
+ * Verify the edge list of a node, i.e. ensure it's a loop:
* head -> e_1 -> ... -> e_n -> head
*/
static inline void verify_list_head(ir_node *irn, ir_edge_kind_t kind)