CMUCL User's Manual: Concept Index

Concept Index

actual source, 4.4.2
advising, 3.10.1
aliens, 6.4
argument syntax
- efficiency, 5.12.3
arithmetic
- generic, 5.11.4
arithmetic type inference, 5.3.4
array types
- specialized, 5.11.8
arrays
- efficiency of, 5.10.3
assembly listing, 5.12.5
availability of debug variables, 3.4.1
benchmarking techniques, 5.14.8
bignums, 5.11.5
bit-vectors
- efficiency of, 5.10.5
block
- basic, 3.5.2
- start location, 3.5.2
block compilation, 5.7
- debugger implications, 3.3.4
breakpoints, 3.9
- errors, 3.10
- function-end, 3.10
byte coded compilation, 5.9
Concept Index, 13.4.2
CPU time
- interpretation of, 5.14.7
call
- inline, 5.8
- local, 5.6
- numeric operands, 5.11.10
canonicalization of types, 5.2.2
characters, 5.11.11
cleanup
- stack frame kind, 3.3.4
closures, 5.6.3
command line options, 1.2
compatibility with other Lisps, 4.6
compilation
- block, 5.7
- units, 4.3
- why to, 5.12.1
compilation-speed optimization quality, 4.7.1
compile time type errors, 4.5.1
compile-file
- block compilation arguments, 5.7.3
compiler error messages, 4.4
compiler error severity, 4.4.4
compiler policy, 4.7
compiling, 4.2
complemented type checks, 5.3.6
conditional type inference, 5.3.5
consing, 5.12.2, 5.14
- overhead of, 5.11.1
constant folding, 5.4.2
constant-function declaration, 5.4.2
context sensitive declarations, 5.7.5
continuations
- implicit representation, 5.12.5
control optimization, 5.4.4
cross-referencing, 12
dead code elimination, 5.4.3, 5.4.5
debug optimization quality, 3.4.1, 3.5.2, 3.6, 4.7.1
debug variables, 3.4
debugger, 3
declarations
- optimize-interface, 4.7.2
- optimize, 4.7.1
- block compilation, 5.7.2
- context-sensitive, 5.7.5
defstruct types, 5.2.8
derivation of types, 5.3
descriptor representations
- forcing of, 5.13.3
descriptors
- object, 5.11.1
dynamic type inference, 5.3.5
dynamic-extent, 2.26
- closures, 2.26.2
- known CL functions, 2.26.2
- list, list*, cons, 2.26.3
- rest lists, 2.26.1
effective method, 2.23.4
- inlining of methods, 2.23.4
- precomputation, 2.23.5
efficiency
- general hints, 5.12
- of argument syntax, 5.12.3
- of memory use, 5.12.2
- of numeric variables, 5.11.3
- of objects, 5.10
- of type checking, 5.13.2
efficiency notes, 5.13
- for representation, 5.13.3
- verbosity, 5.13.4
empty type
- the, 5.2.5
encapsulation, 3.10.1
end-block declaration, 5.7.2
entry points
- external, 3.3.4
equivalence of types, 5.2.2
error messages
- compiler, 4.4
- verbosity, 4.4.7
errors
- breakpoints, 3.10
- result type of, 5.2.5
- run-time, 3.3.6
evaluation
- debugger, 3.2, 3.4.2
existing programs
- to run, 4.6
expansion
- inline, 5.8
external
- stack frame kind, 3.3.4
external entry points, 3.3.4
Function Index, 13.4.2
fixnums, 5.11.5
floating point efficiency, 5.11.7
folding
- constant, 5.4.2
frames
- stack, 3.3
free
- C function, 6.5
freeze-type declaration, 5.2.9
function
- names, 3.3.3
- tracing, 3.10
- type inference, 5.3.3
- types, 5.2.6
function call
- inline, 5.8
- local, 5.6
function wrappers, 2.25
function-end breakpoints, 3.10
fwrappers, 2.25
garbage collection, 5.12.2
generic arithmetic, 5.11.4
hash-tables
- efficiency of, 5.10.6
hierarchical packages, 2.4
Internationalization, 13
implicit continuation representation (IR1), 5.12.5
inference of types, 5.3
inhibit-warnings optimization quality, 4.7.1
inline, 2.23.4
inline expansion, 3.6, 4.8, 5.8
interpretation of run time, 5.14.7
interrupts, 3.3.6
keyword argument efficiency, 5.12.3
let optimization, 5.4.1
lisp threads, 2.20
listing files
- trace, 5.12.5
lists
- efficiency of, 5.10.1
local call, 5.6
- numeric operands, 5.11.10
- return values, 5.6.5
- type inference, 5.3.2
locations
- unknown, 3.3.6

logical pathnames, 2.16.3
macroexpansion, 4.4.3
- errors during, 4.4.5
malloc
- C function, 6.5
mapping
- efficiency of, 5.12.4
maybe-inline declaration, 5.8.3
member types, 5.2.3
memory allocation, 5.12.2
methods, 2.23.3.3
- auto-compilation, 2.23.3.3
- emf precomputation, 2.23.5
- inlining in effective methods, 2.23.4
- interpreted, 2.23.8
- load time, 2.23.5
- profiling, 2.23.7
- sealing, 2.23.6
- tracing, 2.23.7
modular-arith, 2.27
multiple value optimization, 5.4.6
NIL type, 5.2.5
names
- function, 3.3.3
non-descriptor representations, 5.11.2, 5.13.3
notes
- efficiency, 5.13
numbers in local call, 5.11.10
numeric
- operation efficiency, 5.11.4
- type inference, 5.3.4
- types, 5.11
object representation, 5.10, 5.11.1
object representation efficiency notes, 5.13.3
object sets, 7.1
open-coding, 4.8
operation specific type inference, 5.3.4
optimization, 5.4
- control, 5.4.4
- function call, 5.8
- let, 5.4.1
- multiple value, 5.4.6
- type check, 5.3.6, 5.13.2
optimize declaration, 3.6, 4.7.1
optimize-interface declaration, 4.7.2
optional
- stack frame kind, 3.3.4
or (union) types, 5.2.4
original source, 4.4.2
package locks, 2.5
pointers, 6.5
policy
- compiler, 4.7
- debugger, 3.6
precise type checking, 4.5.2
primary method, 2.23.1
processing path, 4.4.3
profiling, 2.23.7, 5.14
- methods, 2.23.7
random number generation, 2.19
- MT-19937 generator, 2.19.1
read errors
- compiler, 4.4.6
recording of inline expansions, 5.8.1
recursion, 5.5
- self, 5.6.1
- tail, 3.3.5, 5.6.4
representation
- object, 5.10, 5.11.1
representation efficiency notes, 5.13.3
require, 2.28
rest argument efficiency, 5.12.3
return values
- local call, 5.6.5
run time
- interpretation of, 5.14.7
safety optimization quality, 4.7.1
sealing, 2.23.6
- methods, 2.23.6
- subclasses, 2.23.6
search lists, 2.16.4
semi-inline expansion, 3.6
severity of compiler errors, 4.4.4
signals, 6.8
simple-streams, 2.13
slot access optimization, 2.23.3
slot declaration
- inline, 2.23.3.2
- method recompilation, 2.23.3.3
- slot-boundp, 2.23.3.1
slot declarations, 2.23.3
slot type checking, 2.23.2
source location printing
- debugger, 3.5
source-to-source transformation, 4.4.3, 5.4.7
space optimization, 5.9
space optimization quality, 4.7.1
specialized array types, 5.11.8
specialized structure slots, 5.11.9
speed optimization quality, 4.7.1
stack frames, 3.3
stack numbers, 5.11.2, 5.13.3
start-block declaration, 5.7.2
static functions, 4.8
strings, 5.11.11
structure types, 5.2.8
- efficiency of, 5.10.2
- numeric slots, 5.11.9
style recommendations, 5.2.11, 5.4.8
Type Index, 13.4.2
tail recursion, 3.3.5, 5.5, 5.6.4
time formatting, 2.18
time parsing, 2.18
timing, 5.14
trace files, 5.12.5
tracing, 2.23.7, 3.10
- errors, 3.10
- methods, 2.23.7
transformation
- source-to-source, 5.4.7
tuning, 5.13, 5.14
type checking
- at compile time, 4.5.1
- efficiency of, 5.13.2
- optimization, 5.3.6
- precise, 4.5.2
- weakened, 4.5.3
type declarations
- variable, 5.11.3
type inference, 5.3
- dynamic, 5.3.5
types
- alien, 6.4
- equivalence, 5.2.2
- foreign language, 6.4
- function, 5.2.6
- in python, 4.5, 5.2
- numeric, 5.11
- portability, 4.6
- restrictions on, 5.2.10
- specialized array, 5.11.8
- structure, 5.2.8
- uncertainty, 5.13.1
uncertainty of types, 5.13.1
undefined warnings, 4.3.1
union (or) types, 5.2.4
unix
- pathnames, 2.16.1
unix signals, 6.8
unknown code locations, 3.3.6
unreachable code deletion, 5.4.5
unused expression elimination, 5.4.3
Variable Index, 13.4.2
Virtual Machine (VM, or IR2) representation, 5.12.5
validity of debug variables, 3.4.1
values declaration, 5.2.7
variables
- debugger access, 3.4
- non-descriptor, 5.11.3
vectors
- efficiency of, 5.10.4
verbosity
- of efficiency notes, 5.13.4
- of error messages, 4.4.7
weakened type checking, 4.5.3
word integers, 5.11.6