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 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726
|
(*
Copyright (c) 2012, 2016-19 David C.J. Matthews
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
*)
(* Intermediate code tree for the back end of the compiler. *)
structure BackendIntermediateCode: BackendIntermediateCodeSig =
struct
open Address
structure BuiltIns =
struct
datatype testConditions =
TestEqual
| TestLess
| TestLessEqual
| TestGreater
| TestGreaterEqual
| TestUnordered (* Reals only. *)
datatype arithmeticOperations =
ArithAdd
| ArithSub
| ArithMult
| ArithQuot
| ArithRem
| ArithDiv
| ArithMod
datatype logicalOperations =
LogicalAnd
| LogicalOr
| LogicalXor
datatype shiftOperations =
ShiftLeft
| ShiftRightLogical
| ShiftRightArithmetic
datatype unaryOps =
NotBoolean
| IsTaggedValue
| MemoryCellLength
| MemoryCellFlags
| ClearMutableFlag
| AtomicIncrement
| AtomicDecrement
| AtomicReset
| LongWordToTagged
| SignedToLongWord
| UnsignedToLongWord
| RealAbs of precision
| RealNeg of precision
| RealFixedInt of precision
| FloatToDouble
| DoubleToFloat of IEEEReal.rounding_mode option
| RealToInt of precision * IEEEReal.rounding_mode
| TouchAddress
and precision = PrecSingle | PrecDouble
and binaryOps =
WordComparison of { test: testConditions, isSigned: bool }
| FixedPrecisionArith of arithmeticOperations
| WordArith of arithmeticOperations
| WordLogical of logicalOperations
| WordShift of shiftOperations
| AllocateByteMemory
| LargeWordComparison of testConditions
| LargeWordArith of arithmeticOperations
| LargeWordLogical of logicalOperations
| LargeWordShift of shiftOperations
| RealComparison of testConditions * precision
| RealArith of arithmeticOperations * precision
fun unaryRepr NotBoolean = "NotBoolean"
| unaryRepr IsTaggedValue = "IsTaggedValue"
| unaryRepr MemoryCellLength = "MemoryCellLength"
| unaryRepr MemoryCellFlags = "MemoryCellFlags"
| unaryRepr ClearMutableFlag = "ClearMutableFlag"
| unaryRepr AtomicIncrement = "AtomicIncrement"
| unaryRepr AtomicDecrement = "AtomicDecrement"
| unaryRepr AtomicReset = "AtomicReset"
| unaryRepr LongWordToTagged = "LongWordToTagged"
| unaryRepr SignedToLongWord = "SignedToLongWord"
| unaryRepr UnsignedToLongWord = "UnsignedToLongWord"
| unaryRepr (RealAbs prec) = "RealAbs" ^ precRepr prec
| unaryRepr (RealNeg prec) = "RealNeg" ^ precRepr prec
| unaryRepr (RealFixedInt prec) = "RealFixedInt" ^ precRepr prec
| unaryRepr FloatToDouble = "FloatToDouble"
| unaryRepr (DoubleToFloat NONE) = "DoubleToFloat"
| unaryRepr (DoubleToFloat (SOME mode)) = "DoubleToFloat" ^ rndModeRepr mode
| unaryRepr (RealToInt (prec, mode)) = "RealToInt" ^ precRepr prec ^ rndModeRepr mode
| unaryRepr TouchAddress = "TouchAddress"
and binaryRepr (WordComparison{test, isSigned}) =
"Test" ^ (testRepr test) ^ (if isSigned then "Signed" else "Unsigned")
| binaryRepr (FixedPrecisionArith arithOp) = (arithRepr arithOp) ^ "Fixed"
| binaryRepr (WordArith arithOp) = (arithRepr arithOp) ^ "Word"
| binaryRepr (WordLogical logOp) = (logicRepr logOp) ^ "Word"
| binaryRepr (WordShift shiftOp) = (shiftRepr shiftOp) ^ "Word"
| binaryRepr AllocateByteMemory = "AllocateByteMemory"
| binaryRepr (LargeWordComparison test) = "Test" ^ (testRepr test) ^ "LargeWord"
| binaryRepr (LargeWordArith arithOp) = (arithRepr arithOp) ^ "LargeWord"
| binaryRepr (LargeWordLogical logOp) = (logicRepr logOp) ^ "LargeWord"
| binaryRepr (LargeWordShift shiftOp) = (shiftRepr shiftOp) ^ "LargeWord"
| binaryRepr (RealComparison (test, prec)) = "Test" ^ testRepr test ^ precRepr prec
| binaryRepr (RealArith (arithOp, prec)) = arithRepr arithOp ^ precRepr prec
and testRepr TestEqual = "Equal"
| testRepr TestLess = "Less"
| testRepr TestLessEqual = "LessEqual"
| testRepr TestGreater = "Greater"
| testRepr TestGreaterEqual = "GreaterEqual"
| testRepr TestUnordered = "Unordered"
and arithRepr ArithAdd = "Add"
| arithRepr ArithSub = "Sub"
| arithRepr ArithMult = "Mult"
| arithRepr ArithQuot = "Quot"
| arithRepr ArithRem = "Rem"
| arithRepr ArithDiv = "Div"
| arithRepr ArithMod = "Mod"
and logicRepr LogicalAnd = "And"
| logicRepr LogicalOr = "Or"
| logicRepr LogicalXor = "Xor"
and shiftRepr ShiftLeft = "Left"
| shiftRepr ShiftRightLogical = "RightLogical"
| shiftRepr ShiftRightArithmetic = "RightArithmetic"
and precRepr PrecSingle = "Single"
| precRepr PrecDouble = "Double"
and rndModeRepr IEEEReal.TO_NEAREST = "Round"
| rndModeRepr IEEEReal.TO_NEGINF = "Down"
| rndModeRepr IEEEReal.TO_POSINF = "Up"
| rndModeRepr IEEEReal.TO_ZERO = "Trunc"
end
datatype argumentType =
GeneralType
| DoubleFloatType
| SingleFloatType
datatype backendIC =
BICNewenv of bicCodeBinding list * backendIC (* Set of bindings with an expression. *)
| BICConstnt of machineWord * Universal.universal list (* Load a constant *)
| BICExtract of bicLoadForm (* Get a local variable, an argument or a closure value *)
| BICField of {base: backendIC, offset: int }
(* Load a field from a tuple or record *)
| BICEval of (* Evaluate a function with an argument list. *)
{
function: backendIC,
argList: (backendIC * argumentType) list,
resultType: argumentType
}
(* Built-in functions. *)
| BICUnary of {oper: BuiltIns.unaryOps, arg1: backendIC}
| BICBinary of {oper: BuiltIns.binaryOps, arg1: backendIC, arg2: backendIC}
| BICArbitrary of
{oper: BuiltIns.arithmeticOperations, shortCond: backendIC, arg1: backendIC, arg2: backendIC, longCall: backendIC}
| BICLambda of bicLambdaForm (* Lambda expressions. *)
| BICCond of backendIC * backendIC * backendIC (* If-then-else expression *)
| BICCase of (* Case expressions *)
{
cases : backendIC option list, (* NONE means "jump to the default". *)
test : backendIC,
default : backendIC,
isExhaustive: bool,
firstIndex: word
}
| BICBeginLoop of (* Start of tail-recursive inline function. *)
{ loop: backendIC, arguments: (bicSimpleBinding * argumentType) list }
| BICLoop of (backendIC * argumentType) list (* Jump back to start of tail-recursive function. *)
| BICRaise of backendIC (* Raise an exception *)
| BICHandle of (* Exception handler. *) { exp: backendIC, handler: backendIC, exPacketAddr: int }
| BICTuple of backendIC list (* Tuple *)
| BICSetContainer of (* Copy a tuple to a container. *)
{
container: backendIC,
tuple: backendIC,
filter: BoolVector.vector
}
| BICLoadContainer of {base: backendIC, offset: int }
| BICTagTest of { test: backendIC, tag: word, maxTag: word }
| BICLoadOperation of { kind: loadStoreKind, address: bicAddress }
| BICStoreOperation of { kind: loadStoreKind, address: bicAddress, value: backendIC }
| BICBlockOperation of
{ kind: blockOpKind, sourceLeft: bicAddress, destRight: bicAddress, length: backendIC }
| BICGetThreadId
| BICAllocateWordMemory of {numWords: backendIC, flags: backendIC, initial: backendIC}
and bicCodeBinding =
BICDeclar of bicSimpleBinding (* Make a local declaration or push an argument *)
| BICRecDecs of { addr: int, lambda: bicLambdaForm } list (* Set of mutually recursive declarations. *)
| BICNullBinding of backendIC (* Just evaluate the expression and discard the result. *)
| BICDecContainer of { addr: int, size: int } (* Create a container for a tuple on the stack. *)
and caseType =
CaseWord (* Word or fixed-precision integer. *)
| CaseTag of word
and bicLoadForm =
BICLoadLocal of int (* Local binding *)
| BICLoadArgument of int (* Argument - 0 is first arg etc.*)
| BICLoadClosure of int (* Closure - 0 is first closure item etc *)
| BICLoadRecursive (* Recursive call *)
and 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
and blockOpKind =
BlockOpMove of {isByteMove: bool}
| BlockOpEqualByte
| BlockOpCompareByte
withtype bicSimpleBinding =
{ (* Declare a value or push an argument. *)
value: backendIC,
addr: int
}
and bicLambdaForm =
{ (* Lambda expressions. *)
body : backendIC,
name : string,
closure : bicLoadForm list,
argTypes : argumentType list,
resultType : argumentType,
localCount : int,
heapClosure : bool
}
and bicAddress =
(* Address form used in loads, store and block operations. The base is an ML
address if this is to/from ML memory or a (boxed) SysWord.word if it is
to/from C memory. The index is a value in units of the size of the item
being loaded/stored and the offset is always in bytes. *)
{base: backendIC, index: backendIC option, offset: word}
structure CodeTags =
struct
open Universal
val tupleTag: universal list list tag = tag()
fun splitProps _ [] = (NONE, [])
| splitProps tag (hd::tl) =
if Universal.tagIs tag hd
then (SOME hd, tl)
else let val (p, l) = splitProps tag tl in (p, hd :: l) end
fun mergeTupleProps(p, []) = p
| mergeTupleProps([], p) = p
| mergeTupleProps(m, n) =
(
case (splitProps tupleTag m, splitProps tupleTag n) of
((SOME mp, ml), (SOME np, nl)) =>
let
val mpl = Universal.tagProject tupleTag mp
and npl = Universal.tagProject tupleTag np
val merge = ListPair.mapEq mergeTupleProps (mpl, npl)
in
Universal.tagInject tupleTag merge :: (ml @ nl)
end
| _ => m @ n
)
end
fun loadStoreKindRepr(LoadStoreMLWord {isImmutable=true}) = "MLWordImmutable"
| loadStoreKindRepr(LoadStoreMLWord {isImmutable=false}) = "MLWord"
| loadStoreKindRepr(LoadStoreMLByte {isImmutable=true}) = "MLByteImmutable"
| loadStoreKindRepr(LoadStoreMLByte {isImmutable=false}) = "MLByte"
| loadStoreKindRepr LoadStoreC8 = "C8Bit"
| loadStoreKindRepr LoadStoreC16 = "C16Bit"
| loadStoreKindRepr LoadStoreC32 = "C32Bit"
| loadStoreKindRepr LoadStoreC64 = "C64Bit"
| loadStoreKindRepr LoadStoreCFloat = "CFloat"
| loadStoreKindRepr LoadStoreCDouble = "CDouble"
| loadStoreKindRepr LoadStoreUntaggedUnsigned = "MLWordUntagged"
fun blockOpKindRepr (BlockOpMove{isByteMove=false}) = "MoveWord"
| blockOpKindRepr (BlockOpMove{isByteMove=true}) = "MoveByte"
| blockOpKindRepr BlockOpEqualByte = "EqualByte"
| blockOpKindRepr BlockOpCompareByte = "CompareByte"
open Pretty
fun pList ([]: 'b list, _: string, _: 'b->pretty) = []
| pList ([h], _, disp) = [disp h]
| pList (h::t, sep, disp) =
PrettyBlock (0, false, [],
[
disp h,
PrettyBreak (0, 0),
PrettyString sep
]
) ::
PrettyBreak (1, 0) ::
pList (t, sep, disp)
fun pretty (pt : backendIC) : pretty =
let
fun printList(start, lst, sep) : pretty =
PrettyBlock (1, true, [],
PrettyString (start ^ "(") ::
pList(lst, sep, pretty) @
[ PrettyBreak (0, 0), PrettyString (")") ]
)
fun prettyArgType GeneralType = PrettyString "G"
| prettyArgType DoubleFloatType = PrettyString "D"
| prettyArgType SingleFloatType = PrettyString "F"
fun prettyArg (c, t) =
PrettyBlock(1, false, [], [pretty c, PrettyBreak (1, 0), prettyArgType t])
fun prettyArgs(start, lst, sep) : pretty =
PrettyBlock (1, true, [],
PrettyString (start ^ "(") ::
pList(lst, sep, prettyArg) @
[ PrettyBreak (0, 0), PrettyString (")") ]
)
fun prettyAddress({base, index, offset}: bicAddress): pretty =
let
in
PrettyBlock (1, true, [],
[
PrettyString "[", PrettyBreak (0, 3),
pretty base,
PrettyBreak (0, 0), PrettyString ",", PrettyBreak (1, 0),
case index of NONE => PrettyString "-" | SOME i => pretty i,
PrettyBreak (0, 0), PrettyString ",", PrettyBreak (1, 0),
PrettyString(Word.toString offset), PrettyBreak (0, 0), PrettyString "]"
])
end
in
case pt of
BICEval {function, argList, resultType} =>
let
val prettyArgs =
PrettyBlock (1, true, [],
PrettyString ("$(") ::
pList(argList, ",", prettyArg) @
[ PrettyBreak (0, 0), PrettyString (")") ]
)
in
PrettyBlock (3, false, [],
[ pretty function, PrettyBreak(1, 0), prettyArgType resultType, PrettyBreak(1, 0), prettyArgs ]
)
end
| BICGetThreadId => PrettyString "GetThreadId"
| BICUnary { oper, arg1 } =>
PrettyBlock (3, false, [],
[ PrettyString(BuiltIns.unaryRepr oper), PrettyBreak(1, 0), printList("", [arg1], ",") ]
)
| BICBinary { oper, arg1, arg2 } =>
PrettyBlock (3, false, [],
[ PrettyString(BuiltIns.binaryRepr oper), PrettyBreak(1, 0), printList("", [arg1, arg2], ",") ]
)
| BICArbitrary { oper, shortCond, arg1, arg2, longCall } =>
PrettyBlock (3, false, [],
[ PrettyString(BuiltIns.arithRepr oper), PrettyBreak(1, 0),
printList("", [shortCond, arg1, arg2, longCall], ",") ]
)
| BICAllocateWordMemory { numWords, flags, initial } =>
PrettyBlock (3, false, [],
[ PrettyString "AllocateWordMemory", PrettyBreak(1, 0), printList("", [numWords, flags, initial], ",") ]
)
| BICExtract (BICLoadLocal addr) =>
let
val str : string =
concat ["LOCAL(", Int.toString addr, ")"]
in
PrettyString str
end
| BICExtract (BICLoadArgument addr) =>
let
val str : string =
concat ["PARAM(", Int.toString addr, ")"]
in
PrettyString str
end
| BICExtract (BICLoadClosure addr) =>
let
val str : string =
concat ["CLOS(", Int.toString addr, ")"]
in
PrettyString str
end
| BICExtract (BICLoadRecursive) =>
let
val str : string =
concat ["RECURSIVE(", ")"]
in
PrettyString str
end
| BICField {base, offset} =>
let
val str = "INDIRECT(" ^ Int.toString offset ^ ", ";
in
PrettyBlock(0, false, [],
[ PrettyString str, pretty base, PrettyString ")" ]
)
end
| BICLambda {body, name, closure, argTypes,
heapClosure, resultType, localCount} =>
let
fun prettyArgTypes [] = []
| prettyArgTypes [last] = [prettyArgType last]
| prettyArgTypes (hd::tl) = prettyArgType hd :: PrettyBreak(1, 0) :: prettyArgTypes tl
in
PrettyBlock (1, true, [],
[
PrettyString ("LAMBDA("),
PrettyBreak (1, 0),
PrettyString name,
PrettyBreak (1, 0),
PrettyString ( "CL=" ^ Bool.toString heapClosure),
PrettyString (" LOCALS=" ^ Int.toString localCount),
PrettyBreak(1, 0),
PrettyBlock (1, false, [], PrettyString "ARGS=" :: prettyArgTypes argTypes),
PrettyBreak(1, 0),
PrettyBlock (1, false, [], [PrettyString "RES=", prettyArgType resultType]),
printList (" CLOS=", map BICExtract closure, ","),
PrettyBreak (1, 0),
pretty body,
PrettyString "){LAMBDA}"
]
)
end
| BICConstnt (w, _) => PrettyString (stringOfWord w)
| BICCond (f, s, t) =>
PrettyBlock (1, true, [],
[
PrettyString "IF(",
pretty f,
PrettyString ", ",
PrettyBreak (0, 0),
pretty s,
PrettyString ", ",
PrettyBreak (0, 0),
pretty t,
PrettyBreak (0, 0),
PrettyString (")")
]
)
| BICNewenv(decs, final) =>
PrettyBlock (1, true, [],
PrettyString ("BLOCK" ^ "(") ::
pList(decs, ";", prettyBinding) @
[ PrettyBreak (1, 0), pretty final, PrettyBreak (0, 0), PrettyString (")") ]
)
| BICBeginLoop{loop=loopExp, arguments=args } =>
let
fun prettyArg (c, t) =
PrettyBlock(1, false, [],
[prettySimpleBinding c, PrettyBreak (1, 0), prettyArgType t])
in
PrettyBlock (3, false, [],
[
PrettyBlock (1, true, [],
PrettyString ("BEGINLOOP(") ::
pList(args, ",", prettyArg) @
[ PrettyBreak (0, 0), PrettyString (")") ]
),
PrettyBreak (0, 0),
PrettyString "(",
PrettyBreak (0, 0),
pretty loopExp,
PrettyBreak (0, 0),
PrettyString ")"
]
)
end
| BICLoop ptl => prettyArgs("LOOP", ptl, ",")
| BICRaise c =>
PrettyBlock (1, true, [],
[
PrettyString "RAISE(",
pretty c,
PrettyBreak (0, 0),
PrettyString (")")
]
)
| BICHandle {exp, handler, exPacketAddr} =>
PrettyBlock (3, false, [],
[
PrettyString "HANDLE(",
pretty exp,
PrettyString ("WITH exid=" ^ Int.toString exPacketAddr),
PrettyBreak (1, 0),
pretty handler,
PrettyString ")"
]
)
| BICCase {cases, test, default, isExhaustive, firstIndex, ...} =>
PrettyBlock (1, true, [],
PrettyString "CASE (" ::
pretty test ::
PrettyBreak (1, 0) ::
PrettyString ("( from " ^ Word.toString firstIndex ^ (if isExhaustive then " exhaustive" else "")) ::
PrettyBreak (1, 0) ::
pList(cases, ",",
fn (SOME exp) =>
PrettyBlock (1, true, [],
[
PrettyString "=>",
PrettyBreak (1, 0),
pretty exp
])
| NONE => PrettyString "=> default"
) @
[
PrettyBreak (1, 0),
PrettyBlock (1, false, [],
[
PrettyString "ELSE:",
PrettyBreak (1, 0),
pretty default
]
),
PrettyBreak (1, 0),
PrettyString (") {"^"CASE"^"}")
]
)
| BICTuple ptl => printList("RECCONSTR", ptl, ",")
| BICSetContainer{container, tuple, filter} =>
let
val source = BoolVector.length filter
val dest = BoolVector.foldl(fn (true, n) => n+1 | (false, n) => n) 0 filter
in
PrettyBlock (3, false, [],
[
PrettyString (concat["SETCONTAINER(", Int.toString dest, "/", Int.toString source, ", "]),
pretty container,
PrettyBreak (0, 0),
PrettyString ",",
PrettyBreak (1, 0),
pretty tuple,
PrettyBreak (0, 0),
PrettyString ")"
]
)
end
| BICLoadContainer {base, offset} =>
let
val str = "INDIRECTCONTAINER(" ^ Int.toString offset ^ ", ";
in
PrettyBlock(0, false, [],
[ PrettyString str, pretty base, PrettyString ")" ]
)
end
| BICTagTest { test, tag, maxTag } =>
PrettyBlock (3, false, [],
[
PrettyString (concat["TAGTEST(", Word.toString tag, ", ", Word.toString maxTag, ","]),
PrettyBreak (1, 0),
pretty test,
PrettyBreak (0, 0),
PrettyString ")"
]
)
| BICLoadOperation{ kind, address } =>
PrettyBlock (3, false, [],
[
PrettyString("Load" ^ loadStoreKindRepr kind),
PrettyBreak (1, 0),
prettyAddress address
]
)
| BICStoreOperation{ kind, address, value } =>
PrettyBlock (3, false, [],
[
PrettyString("Store" ^ loadStoreKindRepr kind),
PrettyBreak (1, 0),
prettyAddress address,
PrettyBreak (1, 0),
PrettyString "<=",
PrettyBreak (1, 0),
pretty value
]
)
| BICBlockOperation{ kind, sourceLeft, destRight, length } =>
PrettyBlock (3, false, [],
[
PrettyString(blockOpKindRepr kind ^ "("),
PrettyBreak (1, 0),
prettyAddress sourceLeft,
PrettyBreak (1, 0), PrettyString ",",
prettyAddress destRight,
PrettyBreak (1, 0), PrettyString ",",
pretty length,
PrettyBreak (1, 0), PrettyString ")"
]
)
(* That list should be exhaustive! *)
end (* pretty *)
and prettyBinding(BICDeclar dec) = prettySimpleBinding dec
| prettyBinding(BICRecDecs ptl) =
let
fun prettyRDec {lambda, addr} =
PrettyBlock (1, false, [],
[
PrettyString (concat ["DECL #", Int.toString addr, "="]),
PrettyBreak (1, 0),
pretty(BICLambda lambda)
]
)
in
PrettyBlock (1, true, [],
PrettyString ("MUTUAL" ^ "(") ::
pList(ptl, " AND ", prettyRDec) @
[ PrettyBreak (0, 0), PrettyString (")") ]
)
end
| prettyBinding(BICNullBinding c) = pretty c
| prettyBinding(BICDecContainer{addr, size}) =
PrettyString (concat ["CONTAINER #", Int.toString addr, "=", Int.toString size])
and prettySimpleBinding{value, addr} =
PrettyBlock (1, false, [],
[
PrettyString (concat ["DECL #", Int.toString addr, "="]),
PrettyBreak (1, 0),
pretty value
]
)
structure Sharing =
struct
type backendIC = backendIC
and bicLoadForm = bicLoadForm
and caseType = caseType
and pretty = pretty
and argumentType = argumentType
and bicCodeBinding = bicCodeBinding
and bicSimpleBinding = bicSimpleBinding
and loadStoreKind = loadStoreKind
and blockOpKind = blockOpKind
and unaryOps = BuiltIns.unaryOps
and binaryOps = BuiltIns.binaryOps
and testConditions = BuiltIns.testConditions
and arithmeticOperations = BuiltIns.arithmeticOperations
end
end;
|