1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219
|
(*
Copyright (c) 2000
Cambridge University Technical Services Limited
Modified David C. J. Matthews 2008-2010, 2013, 2016-18
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License version 2.1 as published by the Free Software Foundation.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*)
(* Signature for the basic codetree types and operations. *)
signature BaseCodeTreeSig =
sig
type machineWord = Address.machineWord
datatype inlineStatus =
NonInline
| Inline
datatype argumentType =
GeneralType
| DoubleFloatType
| SingleFloatType
datatype loadStoreKind =
LoadStoreMLWord of {isImmutable: bool} (* Load/Store an ML word in an ML word cell. *)
| LoadStoreMLByte of {isImmutable: bool} (* Load/Store a byte, tagging and untagging as appropriate, in an ML byte cell. *)
| LoadStoreC8 (* Load/Store C values - The base address is a boxed SysWord.word value. *)
| LoadStoreC16
| LoadStoreC32
| LoadStoreC64
| LoadStoreCFloat
| LoadStoreCDouble
| LoadStoreUntaggedUnsigned
datatype blockOpKind =
BlockOpMove of {isByteMove: bool}
| BlockOpEqualByte
| BlockOpCompareByte
structure BuiltIns: BUILTINS
datatype arbPrecisionOps =
ArbCompare of BuiltIns.testConditions
| ArbArith of BuiltIns.arithmeticOperations
(* How variables are used. Added and examined by the optimisation pass. *)
datatype codeUse =
UseGeneral (* Used in some other context. *)
| UseExport (* Exported i.e. the result of a top-level binding. *)
| UseApply of codeUse list * codetree list
(* Applied as a function - the list is where the result goes, the codetree list
is the code that was used for each argument. *)
| UseField of int * codeUse list (* Selected as a field - the list is where the result goes *)
and codetree =
Newenv of codeBinding list * codetree (* Set of bindings with an expression. *)
| Constnt of machineWord * Universal.universal list (* Load a constant *)
| Extract of loadForm
| Indirect of {base: codetree, offset: int, indKind: indKind }
(* Load a value from the heap or the stack. *)
| Eval of (* Evaluate a function with an argument list. *)
{
function: codetree,
argList: (codetree * argumentType) list,
resultType: argumentType
}
(* Built-in functions. *)
| Unary of {oper: BuiltIns.unaryOps, arg1: codetree}
| Binary of {oper: BuiltIns.binaryOps, arg1: codetree, arg2: codetree}
(* Arbitrary precision operations. This combines some conditionals
with the operation. shortCond is the condition that must be satisfied
for the short precision operation to be executed. longCall is called
if either argument is long or the evaluation overflows. *)
| Arbitrary of
{oper: arbPrecisionOps, shortCond: codetree, arg1: codetree, arg2: codetree, longCall: codetree}
| Lambda of lambdaForm (* Lambda expressions. *)
| Cond of codetree * codetree * codetree (* If-statement *)
| BeginLoop of (* Start of tail-recursive inline function. *)
{ loop: codetree, arguments: (simpleBinding * argumentType) list }
| Loop of (codetree * argumentType) list (* Jump back to start of tail-recursive function. *)
| Raise of codetree (* Raise an exception *)
| Handle of (* Exception handler. *) { exp: codetree, handler: codetree, exPacketAddr: int }
| Tuple of { fields: codetree list, isVariant: bool } (* Tuples and datatypes *)
| SetContainer of { container: codetree, tuple: codetree, filter: BoolVector.vector}
(* Copy a tuple to a container. *)
| TagTest of { test: codetree, tag: word, maxTag: word }
| LoadOperation of { kind: loadStoreKind, address: codeAddress }
| StoreOperation of { kind: loadStoreKind, address: codeAddress, value: codetree }
| BlockOperation of
{ kind: blockOpKind, sourceLeft: codeAddress, destRight: codeAddress, length: codetree }
| GetThreadId
| AllocateWordMemory of {numWords: codetree, flags: codetree, initial: codetree}
and codeBinding =
Declar of simpleBinding (* Make a local declaration or push an argument *)
| RecDecs of { addr: int, lambda: lambdaForm, use: codeUse list } list (* Set of mutually recursive declarations. *)
| NullBinding of codetree (* Just evaluate the expression and discard the result. *)
| Container of { addr: int, use: codeUse list, size: int, setter: codetree }
and loadForm =
LoadArgument of int
| LoadLocal of int
| LoadClosure of int
| LoadRecursive
(* When we look up an entry in the environment we get a pair of
a "general" value, which is either a constant or a load, and
an optional special value, which is either a tuple or an
inline function. Tuple entries are functions from an integer
offset to one of these pairs; inline function entries are a
lambda together with a map for the free variables. *)
and envGeneral =
EnvGenLoad of loadForm | EnvGenConst of machineWord * Universal.universal list
and envSpecial =
EnvSpecNone
| EnvSpecTuple of int * (int -> envGeneral * envSpecial)
| EnvSpecInlineFunction of lambdaForm * (int -> envGeneral * envSpecial)
| EnvSpecUnary of BuiltIns.unaryOps * codetree
| EnvSpecBinary of BuiltIns.binaryOps * codetree * codetree
(* Indirection types.
IndTuple is from a tuple so the field will always be present;
IndVariant is from a datatype which may have other variants that do not have the field;
IndContainer is from a container (a set of words on the stack). *)
and indKind = IndTuple | IndVariant | IndContainer
withtype simpleBinding =
{ (* Declare a value or push an argument. *)
value: codetree,
addr: int,
use: codeUse list
}
and lambdaForm =
{ (* Lambda expressions. *)
body : codetree, (* The body of the function. *)
isInline : inlineStatus, (* Whether it's inline - modified by optimiser *)
name : string, (* Text name for profiling etc. *)
closure : loadForm list, (* List of items for closure. *)
argTypes : (argumentType * codeUse list) list, (* "Types" and usage of arguments. *)
resultType : argumentType, (* Result "type" of the function. *)
localCount : int, (* Maximum (+1) declaration address for locals. *)
recUse : codeUse list (* Recursive use of the function *)
}
and codeAddress = {base: codetree, index: codetree option, offset: word}
type pretty
val pretty : codetree -> pretty
val mapCodetree: (codetree -> codetree option) -> codetree -> codetree
datatype foldControl = FOLD_DESCEND | FOLD_DONT_DESCEND
val foldtree: (codetree * 'a -> 'a * foldControl) -> 'a -> codetree -> 'a
structure CodeTags:
sig
val tupleTag: Universal.universal list list Universal.tag
val inlineCodeTag: envSpecial Universal.tag
val mergeTupleProps:
Universal.universal list * Universal.universal list -> Universal.universal list
end
structure Sharing:
sig
type codetree = codetree
and pretty = pretty
and inlineStatus = inlineStatus
and argumentType = argumentType
and loadStoreKind = loadStoreKind
and blockOpKind = blockOpKind
and codeBinding = codeBinding
and simpleBinding = simpleBinding
and loadForm = loadForm
and envGeneral = envGeneral
and envSpecial = envSpecial
and codeUse = codeUse
and foldControl = foldControl
and unaryOps = BuiltIns.unaryOps
and binaryOps = BuiltIns.binaryOps
and arbPrecisionOps = arbPrecisionOps
and testConditions = BuiltIns.testConditions
and arithmeticOperations = BuiltIns.arithmeticOperations
end
end;
|