-/* Copyright (C) 2002 by Universitaet Karlsruhe
-* All rights reserved.
-*
-* Authors: Goetz Lindenmaier
-*
-* irbackedges.c Access function for backedges.
-*
-*/
-
-/* $Id$ */
+/*
+ * Project: libFIRM
+ * File name: ir/ana/irbackedge.c
+ * Purpose: Access function for backedges.
+ * Author: Goetz Lindenmaier
+ * Modified by:
+ * Created: 7.2002
+ * CVS-ID: $Id$
+ * Copyright: (c) 2002-2003 Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
#include "irnode_t.h"
#include "array.h"
#include "irbackedge_t.h"
/*--------------------------------------------------------------------*/
-/* Backedge information. * */
+/* Backedge information. */
/*--------------------------------------------------------------------*/
* very careful!
*/
static INLINE int *mere_get_backarray(ir_node *n) {
- switch(get_irn_opcode(n)) {
+ switch(intern_get_irn_opcode(n)) {
case iro_Block:
if (!get_Block_matured(n)) return NULL;
if (interprocedural_view && n->attr.block.in_cg) {
INLINE void fix_backedges(struct obstack *obst, ir_node *n) {
- opcode opc = get_irn_opcode(n);
+ opcode opc = intern_get_irn_opcode(n);
int *arr = mere_get_backarray(n);
if (ARR_LEN(arr) == ARR_LEN(get_irn_in(n))-1)
return;
int i;
int *ba = get_backarray (n);
if (ba)
- for (i = 0; i < get_irn_arity(n); i++)
+ for (i = 0; i < intern_get_irn_arity(n); i++)
if (ba[i]) return true;
return false;
}
interprocedural_view = 0;
ba = get_backarray (n);
if (ba)
- for (i = 0; i < get_irn_arity(n); i++)
+ for (i = 0; i < intern_get_irn_arity(n); i++)
ba[i] = 0;
interprocedural_view = 1;
ba = get_backarray (n);
if (ba)
- for (i = 0; i < get_irn_arity(n); i++)
+ for (i = 0; i < intern_get_irn_arity(n); i++)
ba[i] = 0;
interprocedural_view = rem;
}