FetchControl.alps
Copyright © 1984 by Xerox Corporation. All rights reversed.
Created by: Bertrand Serlet, September 26, 1985 1:51:33 pm PDT
Last Edited: Serlet, June 11, 1985 8:52:16 pm PDT
TruthTableFile ← "FetchControl.tt"; -- ROPE giving the name of the file containing the TruthTable.
Optimize ← TRUE; -- BOOL saying if permutation should be attempted.
SuperOptimize ← 99;
Inputs ← LIST["jump", "getNext", "hold", "reject", "jumping", "jumpInProgress", "jumpPending", "fetching", "roomFor1", "roomFor2", "faulted", "ipPageFault", "opLength[0]", "opLength[1]", "opLength[2]", "offSet[0]", "offSet[1]"]; -- LIST OF ROPE giving the names of all inputs. Must be given.
Outputs ← LIST["jumpInProgress", "jumpPending", "newFetch", "fetching", "faulted", "incrPrefetch", "wt[0]", "wt[1]", "wt[2]", "rd[0]", "rd[1]", "rd[2]", "rd[3]", "rd[4]", "rd[5]", "rd[6]", "rd[7]", "rd[8]"]; -- LIST OF ROPE giving the names of all outputs. Must be given.
Outputs ← LIST["jumpInProgressOUT", "jumpPendingOUT", "newFetch", "fetchingOUT", "faultedOUT", "incrPrefetch", "wt[0]", "wt[1]", "wt[2]", "rd[0]", "rd[1]", "rd[2]", "rd[3]", "rd[4]", "rd[5]", "rd[6]", "rd[7]", "rd[8]"]; -- LIST OF ROPE giving the names of all outputs. Must be given.
Latches ← LIST[]; -- LIST OF ROPE giving the names of all latches, i.e. outputs which are fed back in the inputs. Before an eventual permutation, order is Inputs then Latches on one side, Latches then outputs on the other.
DistanceBetweenGlue ← 99;