/* src/vm/jit/schedule/schedule.h - architecture independent instruction
scheduler
- Copyright (C) 1996-2005 R. Grafl, A. Krall, C. Kruegel, C. Oates,
- R. Obermaisser, M. Platter, M. Probst, S. Ring, E. Steiner,
- C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich, J. Wenninger,
- Institut f. Computersprachen - TU Wien
+ Copyright (C) 1996-2005, 2006 R. Grafl, A. Krall, C. Kruegel,
+ C. Oates, R. Obermaisser, M. Platter, M. Probst, S. Ring,
+ E. Steiner, C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich,
+ J. Wenninger, Institut f. Computersprachen - TU Wien
This file is part of CACAO.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
- Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
- 02111-1307, USA.
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+ 02110-1301, USA.
- Contact: cacao@complang.tuwien.ac.at
+ Contact: cacao@cacaojvm.org
Authors: Christian Thalinger
Changes:
- $Id: schedule.h 2033 2005-03-18 09:24:00Z twisti $
+ $Id: schedule.h 4357 2006-01-22 23:33:38Z twisti $
*/
typedef struct scheduledata scheduledata;
typedef struct minstruction minstruction;
-typedef struct nodelink nodelink;
+typedef struct edgenode edgenode;
typedef struct opcycles opcycles;
struct scheduledata {
minstruction *mi; /* machine instruction array */
s4 micount; /* number of machine instructions */
- nodelink *leaders; /* list containing leader nodes */
+ edgenode *leaders; /* list containing leader nodes */
- nodelink **intregs_define_dep;
- nodelink **fltregs_define_dep;
- nodelink **memory_define_dep;
+ edgenode **intregs_define_dep;
+ edgenode **fltregs_define_dep;
+ edgenode **memory_define_dep;
- nodelink **intregs_use_dep;
- nodelink **fltregs_use_dep;
- nodelink **memory_use_dep;
+ edgenode **intregs_use_dep;
+ edgenode **fltregs_use_dep;
+ edgenode **memory_use_dep;
FILE *file;
};
#endif
opcycles op[4];
s4 priority; /* priority of this instruction node */
- nodelink *deps; /* operand dependencies */
+ s4 starttime;
+ edgenode *deps; /* operand dependencies */
minstruction *next; /* link to next machine instruction */
};
-/* nodelink ********************************************************************
+/* edgenode ********************************************************************
XXX
*******************************************************************************/
/* TODO rename to edgenode */
-struct nodelink {
- s4 minode; /* pointer to machine instruction */
+struct edgenode {
+ s4 minum; /* machine instruction number */
s1 opnum; /* dependency operand number */
s1 opnum2;
s1 latency;
- nodelink *next; /* link to next node */
+ edgenode *next; /* link to next node */
};
void schedule_calc_priority(minstruction *mi);
-/* void schedule_add_define_dep(scheduledata *sd, s1 operand, s4 *define_dep, nodelink **use_dep); */
-/* void schedule_add_use_dep(scheduledata *sd, s1 operand, s4 *define_dep, nodelink **use_dep); */
-void schedule_add_define_dep(scheduledata *sd, s1 opnum, nodelink **define_dep, nodelink **use_dep);
-void schedule_add_use_dep(scheduledata *sd, s1 opnum, nodelink **define_dep, nodelink **use_dep);
+/* void schedule_add_define_dep(scheduledata *sd, s1 operand, s4 *define_dep, edgenode **use_dep); */
+/* void schedule_add_use_dep(scheduledata *sd, s1 operand, s4 *define_dep, edgenode **use_dep); */
+void schedule_add_define_dep(scheduledata *sd, s1 opnum, edgenode **define_dep, edgenode **use_dep);
+void schedule_add_use_dep(scheduledata *sd, s1 opnum, edgenode **define_dep, edgenode **use_dep);
void schedule_do_schedule(scheduledata *sd);