/*
- * Project: libFIRM
- * File name: ir/ana/cgana.c
- * Purpose: Intraprozedural analyses to estimate the call graph.
- * Author: Hubert Schmid
- * Modified by:
- * Created: 09.06.2002
- * CVS-ID: $Id$
- * Copyright: (c) 1999-2003 Universität Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
- */
-
-/** @file cgana.c
+ * Copyright (C) 1995-2007 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.
*
- * Interprocedural analysis to estimate the calling relation.
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
*
- * This analysis computes all entities representing methods that
- * can be called at a Call node. Further it computes a set of
- * methods that are 'free', i.e., their adress is handled by
- * the program directly, or they are visible external.
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
*/
+/**
+ * @file
+ * @brief Intraprozedural analyses to estimate the call graph.
+ * @author Hubert Schmid
+ * @date 09.06.2002
+ * @version $Id$
+ * @summary
+ * Interprocedural analysis to estimate the calling relation.
+ *
+ * This analysis computes all entities representing methods that
+ * can be called at a Call node. Further it computes a set of
+ * methods that are 'free', i.e., their adress is handled by
+ * the program directly, or they are visible external.
+ */
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
* callees for that call.
*/
static void callee_walker(ir_node * call, void * env) {
+ (void) env;
if (is_Call(call)) {
eset * methods = eset_create();
ir_entity * ent;
* eine Bad-Operation. Die Verlinkung muss wiederhergestellt
* werden! */
ir_node *mem = get_Call_mem(call);
- turn_into_tuple (call, 5 /* pn_Call_max */);
+ ir_node *blk = get_nodes_block(call);
+ turn_into_tuple (call, pn_Call_max);
set_Tuple_pred(call, pn_Call_M_regular , mem);
set_Tuple_pred(call, pn_Call_T_result , new_Bad());
set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
+ set_Tuple_pred(call, pn_Call_X_regular , new_r_Jmp(current_ir_graph, blk));
set_Tuple_pred(call, pn_Call_X_except , new_Bad()); /* new_Jmp() ?? new_Raise() ?? */
set_Tuple_pred(call, pn_Call_M_except , new_Bad());
*/
static void remove_Tuples(ir_node *proj, void *env) {
ir_node *nn;
+ (void) env;
if (! is_Proj(proj)) return;
nn = skip_Tuple(proj);
/*--------------------------------------------------------------------------*/
static void destruct_walker(ir_node * node, void * env) {
+ (void) env;
if (is_Call(node)) {
remove_Call_callee_arr(node);
}