Design of CMU Common Lisp.pdf - Common Lisp.net

More documents

Recommendations

Info

Abstract This report documents internal details of the CMU Common Lisp compiler and run-time system. CMU Common Lisp is a public domain implementation of Common Lisp that runs on various Unix workstations. This document is a work in progress: neither the contents nor the presentation are completed. Nevertheless, it provides some useful background information, in particular regarding the CMUCL compiler.
Contents I System Architecture 2 1 Package and File Structure 3 1.1 Source Tree Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Package structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 System Building 5 2.1 Compiling the C Startup Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Compiling the Lisp Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Building Core Images . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 II Compiler Organization 7 3 Compiler Overview 8 4 The Implicit Continuation Representation 10 4.1 Tail sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 4.2 Hairy function representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.3 ICR representation of non-local exits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.4 Block compilation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 4.5 Entry points . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 5 ICR conversion 15 5.1 Canonical forms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 5.1.1 Array hackery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 5.2 Inline functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 5.3 Compilation policy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 5.4 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 6 Local call analysis 19 7 Find components 20 8 ICR optimize 21 8.1 Goals for ICR optimizations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 8.2 Flow graph simplification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 8.3 Forward ICR optimizations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 8.3.1 ICR transformation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 8.4 Backward ICR optimizations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 9 Type checking 25 10 Constraint propagation 27 11 ICR finalize 29 1
Page 1: Design of CMU Common Lisp Robert A.
Page 5 and 6: 32.2 Calls . . . . . . . . . . . .
Page 7 and 8: Part I System Architecture 5
Page 9 and 10: lisp Originally, this package had a
Page 11 and 12: 2.3 Building Core Images Both the k
Page 13 and 14: Chapter 3 Compiler Overview The str
Page 15 and 16: Chapter 4 The Implicit Continuation
Page 17 and 18: What is the relationship between th
Page 19 and 20: We actually convert each form in th
Page 21 and 22: Actually, I guess the overhead for
Page 23 and 24: The current node type annotations s
Page 25 and 26: Chapter 7 Find components This is a
Page 27 and 28: The big reason for doing this trans
Page 29 and 30: • Eliminate IFs with predicates k
Page 31 and 32: If there is no intersection between
Page 33 and 34: could punt on set variables...] A t
Page 35 and 36: Chapter 12 Environment analysis A r
Page 37 and 38: Chapter 13 Virtual Machine Represen
Page 39 and 40: If the tail-set type is for a fixed
Page 41 and 42: can use the node-derived-type to se
Page 43 and 44: ack branch in a loop the drop-thru,
Page 45 and 46: The primitive type T is special-cas
Page 47 and 48: But the problem doesn’t happen he
Page 49 and 50: Chapter 19 Representation selection
Page 51 and 52: This phase makes use of the results
Page 53 and 54:
Chapter 21 Packing File: pack #—
Page 55 and 56:
Subject to resource constraints: -
Page 57 and 58:
Chapter 22 Code generation This is
Page 59 and 60:
Chapter 24 Dumping So far as input
Page 61 and 62:
Chapter 25 User Interface of the Co
Page 63 and 64:
Chapter 26 Retargeting the compiler
Page 65 and 66:
Chapter 27 Storage bases and classe
Page 67 and 68:
Chapter 28 Type system parameteriza
Page 69 and 70:
ead in any order as long no TN is w
Page 71 and 72:
Chapter 31 Writing Assembly Code VO
Page 73 and 74:
32.1 Function Call 32.1.1 Registers
Page 75 and 76:
Register usage at the time of the r
Page 77 and 78:
when (current-nfp-tn VOP-self-point
Page 79 and 80:
Chapter 33 Standard Primitives 77
Page 81 and 82:
it would seem pretty losing to sepa
Page 83 and 84:
Chapter 35 The Type System 81
Page 85 and 86:
Chapter 37 The IR1 Interpreter May
Page 87 and 88:
editor-based mouse-driven interface
Page 89 and 90:
254 => read next two bytes for inte
Page 91 and 92:
location name, type, etc. location-
Page 93 and 94:
Then the debug-info holds a simple-
Page 95 and 96:
Chapter 39 Object Format 39.1 Taggi
Page 97 and 98:
39.5 Other-immediates As for fixnum
Page 99 and 100:
structure-header-type 182 fdefn-typ
Page 101 and 102:
Available Elements: This is a fixnu
Page 103 and 104:
| Pointer to next function (other-p
Page 105 and 106:
NIL eval::*top-of-stack* lisp::*cur
Page 107 and 108:
Chapter 41 Interface to C and Assem
Page 109 and 110:
Chapter 43 Core File Format 107
Page 111 and 112:
language. The body of necessity beg
Page 113 and 114:
15: FOP-LIST length(1) ⇒ stack Th
Page 115 and 116:
59: FOP-SMALL-CODE nitems(1) size(2
Page 117 and 118:
149-199: Unused 200: FOP-RPLACA tab
Page 119 and 120:
closed continuation A closed contin
Page 121 and 122:
Data-block A data-block is a dual-w
show all

Design of CMU Common Lisp.pdf - Common Lisp.net

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?