Index

3.4.1 Variable Value Availability

availability of debug variables

base-character

2.1.4 Characters

benchmarking techniques

5.14.8 Benchmarking Techniques

bignum

2.1.2 Integers

bignums

5.11.5 Fixnums

bit-vectors

efficiency of: Bit-Vectors

block

basic: 3.5.2 Source Location Availability
start location: 3.5.2 Source Location Availability

block compilation

5.7 Block Compilation

debugger implications: 3.3.4 Funny Frames

block-compile-default

5.7.3 Compiler Arguments | 5.7.4 Practical Difficulties

break

3.1 Debugger Introduction

byte coded compilation

5.9 Byte Coded Compilation

byte-compile-default

call

inline: 5.8 Inline Expansion
local: 5.6 Local Call
numeric operands: 5.11.10 Interactions With Local

canonicalization of types

ceiling

5.11.11 Representation of Characters

characters

cleanup

stack frame kind: 3.3.4 Funny Frames

closures

5.6.3 Closures

compatibility with other Lisps

4.6 Getting Existing Programs

compilation

block: 5.7 Block Compilation
units: 4.3 Compilation Units
why to: 5.12.1 Compile Your Code

compilation-speed optimization" quality

compile time type errors

4.5.1 Compile Time Type

compile-file

3.5.1 How the Source | 5.7.3 Compiler Arguments | 5.9 Byte Coded Compilation

block compilation arguments: 5.7.3 Compiler Arguments

compile-print

compile-progress

compile-verbose

4.4 Interpreting Error Messages

compiler error messages

compiler error severity

4.4.4 Error Severity

compiler policy

4.7 Compiler Policy

compiling

5.3.6 Type Check Optimization

complemented type checks

Concept Index

Index

conditional type inference

5.3.5 Dynamic Type Inference

consing

5.12.2 Avoid Unnecessary Consing | 5.14 Profiling

overhead of: 5.11.1 Descriptors

constant folding

5.4.2 Constant Folding

constant-function declaration

5.4.2 Constant Folding

context sensitive declarations

5.7.5 Context Declarations

continuations

implicit representation: 5.12.5 Trace Files and

control optimization

5.4.4 Control Optimization

CPU time

interpretation of: 5.14.7 A Note on

dead code elimination

5.4.3 Unused Expression Elimination | 5.4.5 Unreachable Code Deletion

debug

3.1 Debugger Introduction

debug optimization quality

3.4.1 Variable Value Availability | 3.5.2 Source Location Availability | 3.6 Compiler Policy Control | 4.7.1 The Optimize Declaration

debug variables

3.4 Variable Access

debug-print-length

3.3.2 How Arguments are | 3.10 Function Tracing

debug-print-level

3.10 Function Tracing

debugger

3 The Debugger

declarations

optimize: 4.7.1 The Optimize Declaration
optimize-interface: The Optimize-Interface Declaration
block compilation: 5.7.2 Block Compilation Declarations
context-sensitive: 5.7.5 Context Declarations

def-alien-routine

8.4.2 External Alien Variables

def-alien-type

8.2.3 Alien Type Specifiers

defstruct

5.2.11 Type Style Recommendations | 5.10.2 Structure Representation

defstruct types

5.2.8 Structure Types

deftype

5.2.11 Type Style Recommendations

defun

5.7 Block Compilation

derivation of types

5.3 Type Inference

describe

3.6 Compiler Policy Control

descriptor representations

forcing of: 5.13.3 Representation Efficiency Notes

descriptors

object: 5.11.1 Descriptors

divide-by-zero

2.1.3.4 Floating Point Exceptions

double-float

2.1.3 Floats

dynamic type inference

5.3.5 Dynamic Type Inference

ed

1.5 Command Line Options

efficiency

general hints: 5.12 General Efficiency Hints
of argument syntax: 5.12.3 Complex Argument Syntax
of memory use: 5.12.2 Avoid Unnecessary Consing
of numeric variables: 5.11.3 Variables
of objects: 5.10 Object Representation
of type checking: 5.13.2 Efficiency Notes and

efficiency notes

5.13 Efficiency Notes

for representation: 5.13.3 Representation Efficiency Notes
verbosity: 5.13.4 Verbosity Control

efficiency-note-cost-threshold

4.4.7 Error Message Parameterization | 5.13.3 Representation Efficiency Notes

empty type

the: 5.2.5 The Empty Type

encapsulation

3.10.1 Encapsulation Functions

end-block declaration

5.7.2 Block Compilation Declarations

end-of-file

2.10 Stream Extensions

entry points

external: 3.3.4 Funny Frames

equivalence of types

3.1 Debugger Introduction | 4.2 Calling the Compiler

error

error messages

compiler: 4.4 Interpreting Error Messages
verbosity: 4.4.7 Error Message Parameterization

errors

result type of: 5.2.5 The Empty Type
run-time: 3.3.6 Unknown Locations and

eval-in-frame

Debug-functions

evaluation

debugger: 3.2 The Command Loop | 3.4.2 Note On Lexical

existing programs

to run: 4.6 Getting Existing Programs

expansion

inline: 5.8 Inline Expansion

extern-alien

8.3.2 Alien Coercion Operations | The alien-funcall Primitive

external

stack frame kind: 3.3.4 Funny Frames

external entry points

3.3.4 Funny Frames

fdefinition

3.10.1 Encapsulation Functions

fixnum

2.1.2 Integers | 2.6 Describe | 5.2.2 Canonicalization

fixnums

5.11.5 Fixnums

flet

5.6 Local Call

float-digits

2.1.3.3 Denormalized Floats

float-precision

2.1.3.3 Denormalized Floats

float-sign

2.1.3.2 Negative Zero

floating point efficiency

5.11.7 Floating Point Efficiency

floating-point-overflow

2.1.3.4 Floating Point Exceptions

floating-point-underflow

2.1.3.4 Floating Point Exceptions

floor

The Freeze-Type Declaration

folding

constant: 5.4.2 Constant Folding

form-number-translations

Code-locations

frames

stack: 3.3 Stack Frames

free

C function: 6.5 System Area Pointers

free-alien

6.4 Type Translations

freeze-type declaration

ftype

5.3.3 Global Function Type

function

2.6 Describe | 5.2.6 Function Types

names: 3.3.3 Function Names
tracing: 3.10 Function Tracing
type inference: 5.3.3 Global Function Type
types: 5.2.6 Function Types

function call

inline: 5.8 Inline Expansion
local: 5.6 Local Call

Function Index

10.9 Source Translation Utilities

garbage collection

5.12.2 Avoid Unnecessary Consing

generic arithmetic

5.11.4 Generic Arithmetic

get-internal-run-time

5.14.6 Additional Timing Utilities

get-unix-error-msg

6.8 Making Sense of

hash-table

2.6 Describe

hash-tables

efficiency of: 5.10.6 Hashtables

if

5.3.5 Dynamic Type Inference | 5.4.4 Control Optimization

implicit continuation representation (IR1)

inference of types

5.3 Type Inference

inhibit-warnings" optimization quality

2.7.1 The Graphical Interface

inline expansion

3.6 Compiler Policy Control | 4.8 Open Coding and | 5.8 Inline Expansion

inspect

interpretation of run time

5.14.7 A Note on

interrupts

3.3.6 Unknown Locations and | 6.9 Unix Interrupts

keyword argument efficiency

5.12.3 Complex Argument Syntax

labels

5.6 Local Call | 5.6.4 Local Tail Recursion

let

5.2.11 Type Style Recommendations

let optimization

5.4.1 Let Optimization

list

4.4.3 The Processing Path

listing files

trace: 5.12.5 Trace Files and

lists

efficiency of: 5.10.1 Think Before You

load-logical-pathname-defaults

2.13.3 Logical Pathnames

local call

5.6 Local Call

numeric operands: 5.11.10 Interactions With Local
return values: 5.6.5 Return Values
type inference: 5.3.2 Local Function Type

locations

unknown: 3.3.6 Unknown Locations and

logical pathnames

2.13.3 Logical Pathnames

macroexpansion

errors during: 4.4.5 Errors During Macroexpansion

make-alien

6.4 Type Translations | 8.2.3 Alien Type Specifiers | 8.7.5 Accessing Lisp Arrays

make-fd-stream

2.10 Stream Extensions

malloc

C function: 6.5 System Area Pointers

mapping

efficiency of: 5.12.4 Mapping and Iteration

maybe-inline declaration

The Maybe-Inline Declaration

member

5.2.3 Member Types | 5.2.11 Type Style Recommendations

member types

5.2.3 Member Types

memory allocation

5.12.2 Avoid Unnecessary Consing

multiple value optimization

5.4.6 Multiple Values Optimization

multiple-value-bind

5.3.1 Variable Type Inference

names

function: 3.3.3 Function Names

NIL type

5.2.5 The Empty Type

non-descriptor representations

Non-Descriptor Representations | 5.13.3 Representation Efficiency Notes

notes

efficiency: 5.13 Efficiency Notes

null

5.11.10 Interactions With Local

numbers in local call

numeric

operation efficiency: 5.11.4 Generic Arithmetic
type inference: 5.3.4 Operation Specific Type
types: 5.11 Numbers

object representation

5.10 Object Representation | 5.11.1 Descriptors

object representation efficiency notes

5.13.3 Representation Efficiency Notes

object sets

7.1 Object Sets

open-coding

4.8 Open Coding and

operation specific type inference

5.3.4 Operation Specific Type

optimization

5.4 Source Optimization

control: 5.4.4 Control Optimization
function call: 5.8 Inline Expansion
let: 5.4.1 Let Optimization
multiple value: 5.4.6 Multiple Values Optimization
type check: 5.3.6 Type Check Optimization | 5.13.2 Efficiency Notes and

optimize declaration

3.6 Compiler Policy Control | 4.7.1 The Optimize Declaration

optimize-interface declaration

The Optimize-Interface Declaration

optional

stack frame kind: 3.3.4 Funny Frames

or

5.2.4 Union Types | 5.2.11 Type Style Recommendations

or (union) types

5.2.4 Union Types

original source

4.4.2 The Original and

pathname

2.13 Pathnames

pointers

6.5 System Area Pointers

policy

compiler: 4.7 Compiler Policy
debugger: 3.6 Compiler Policy Control

precise type checking

4.5.2 Precise Type Checking

preprocess-for-eval

10.3 Frames

processing path

4.4.3 The Processing Path

profiling

5.14 Profiling

purify

2.12 Saving a Core | 2.12 Saving a Core | 8.7.4 Calling Lisp from

random number generation

2.16 Random Number Generation

new generator: 2.16.2 New Generator
original generator: 2.16.1 Original Generator

read errors

compiler: 4.4.6 Read Errors

read-default-float-format

2.1.3 Floats

read-n-bytes

6.7 File Descriptor Streams

recording of inline expansions

5.8.1 Inline Expansion Recording

recursion

5.5 Tail Recursion

self: Self-Recursive Calls
tail: 3.3.5 Debug Tail Recursion | 5.6.4 Local Tail Recursion

representation

object: 5.10 Object Representation | 5.11.1 Descriptors

representation efficiency notes

5.13.3 Representation Efficiency Notes

required-argument

5.2.5 The Empty Type

rest argument efficiency

5.12.3 Complex Argument Syntax

return values

local call: 5.6.5 Return Values

round

run time

interpretation of: 5.14.7 A Note on

safety optimization quality

3.6 Compiler Policy Control

save-lisp

8.6 Loading Unix Object

search lists

2.13.4 Search Lists

semi-inline expansion

serious-condition

3.1 Debugger Introduction

severity of compiler errors

4.4.4 Error Severity

single-float

2.1.3 Floats

source location printing

debugger: 3.5 Source Location Printing

source-to-source transformation

4.4.3 The Processing Path | 5.4.7 Source to Source

space optimization

5.9 Byte Coded Compilation

space optimization quality

5.11.8 Specialized Arrays

specialized array types

specialized structure slots

5.11.9 Specialized Structure Slots

speed optimization quality

Non-Descriptor Representations | 5.13.3 Representation Efficiency Notes

stack frames

3.3 Stack Frames

stack numbers

start-block declaration

5.7.2 Block Compilation Declarations

static functions

4.8 Open Coding and

string-char

2.1.4 Characters

strings

5.11.11 Representation of Characters

structure types

5.2.8 Structure Types

efficiency of: 5.10.2 Structure Representation
numeric slots: 5.11.9 Specialized Structure Slots

style recommendations

5.2.11 Type Style Recommendations | 5.4.8 Style Recommendations

style-warning

5.2.7 The Values Declaration | 5.2.11 Type Style Recommendations

symbol

2.6 Describe

tail recursion

3.3.5 Debug Tail Recursion | 5.5 Tail Recursion | 5.6.4 Local Tail Recursion

the

time formatting

2.15 Time Parsing and

time parsing

2.15 Time Parsing and

timing

5.14 Profiling

trace

Self-Recursive Calls

trace files

trace-output

3.10 Function Tracing

tracing

3.10 Function Tracing

transformation

source-to-source: 5.4.7 Source to Source

truncate

4.4.7 Error Message Parameterization

tuning

5.13 Efficiency Notes | 5.14 Profiling

type checking

at compile time: 4.5.1 Compile Time Type
efficiency of: 5.13.2 Efficiency Notes and
optimization: 5.3.6 Type Check Optimization
precise: 4.5.2 Precise Type Checking
weakened: 4.5.3 Weakened Type Checking

type declarations

variable: 5.11.3 Variables

Type Index

Index

type inference

5.3 Type Inference

dynamic: 5.3.5 Dynamic Type Inference

types

alien: 6.4 Type Translations
equivalence: 5.2.2 Canonicalization
foreign language: 6.4 Type Translations
function: 5.2.6 Function Types
in python: 4.5 Types in Python | 5.2 More About Types
numeric: 5.11 Numbers
portability: 4.6 Getting Existing Programs
restrictions on: 5.2.10 Type Restrictions
specialized array: 5.11.8 Specialized Arrays
structure: 5.2.8 Structure Types
uncertainty: 5.13.1 Type Uncertainty

uncertainty of types

5.13.1 Type Uncertainty

undefined warnings

4.3.1 Undefined Warnings

undefined-warning-limit

union (or) types

5.2.4 Union Types

unix

pathnames: 2.13.1 Unix Pathnames

unix interrupts

6.9 Unix Interrupts

unknown code locations

3.3.6 Unknown Locations and

unreachable code deletion

5.4.5 Unreachable Code Deletion

unused expression elimination

5.4.3 Unused Expression Elimination

validity of debug variables

3.4.1 Variable Value Availability

values declaration

5.2.7 The Values Declaration

Variable Index

Index

variables

debugger access: 3.4 Variable Access
non-descriptor: 5.11.3 Variables

vectors

efficiency of: 5.10.4 Vectors

verbosity

of efficiency notes: 5.13.4 Verbosity Control
of error messages: 4.4.7 Error Message Parameterization

Virtual Machine (VM, or IR2) representation

warning