MLRISC

MLRISC Contributors Requirements How to Obtain MLRISC

Overview

Problem Statement Contributions MLRISC Based Compiler MLRISC Intermediate Representation MLRisc Generation Back End Optimizations Register Allocation Machine Description Garbage Collection Safety System Integration Optimizations Graphical Interface Line Counts Systems Using MLRISC Future Work

System

Architecture of MLRISC The MLTREE Language MLTree Extensions MLTree Utilities Instruction Selection Assemblers Machine Code Emitters Delay Slot Filling Span Dependency Resolution The Graph Library The Graph Visualization Library Basic Compiler Graphs The MLRISC IR SSA Optimizations ILP Optimizations Optimizations for VLIW/EPIC Architectur... Register Allocator

Back Ends

The Alpha Back End The PA RISC Back End The Sparc Back End The Intel x86 Back End The PowerPC Back End The MIPS Back End The TI C6x Back End

Basic Types

Annotations Cells Cluster Client Defined Constants Client Defined Pseudo Ops Instructions Instruction Streams Label Expressions Labels Regions Regmap

# ILP Optimizations

ILP Optimizations

Introduction The ILP ToolBox -List Scheduler -Ranking Algorithms

## Introduction

This section is under construction. A new scheduler framework for superscalars that ties into the machine description language is currently being developed.

## The ILP ToolBox

### List Scheduler

### Ranking Algorithms

Some more complex ranking algorithms (than say critical path) have been implemented. These are:

- The algorithm of Palem and Simons which appeared in TOPLAS '93. This algorithm computes the modified deadlines of a set instructions, with precedence, latency, and deadlines constraints.

- The algorithm of Leung, Palem, and Pnueli which appeared in PACT '98. This algorithm computes the modified deadlines of a set of instructions, with precedence, latency, release-times and deadline constraints.

Lal George
Allen Leung

Generated by mltex2html
Last modified: Mon Oct 3 20:52:35 UTC 2022 by buildd@x86-grnet-02