/*
- * Copyright (C) 1995-2008 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.
*/
/**
fprintf(out, "%d\n", (int)ASIZE);
for (i = 0; i < ASIZE; i++) {
-#if 0
- if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
- fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
- else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
- fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
- else
-#endif
- fprintf(out, "%i\n", curr_vals[i]);
+ fprintf(out, "%i\n", curr_vals[i]);
}
fclose(out);