Category:Compiler optimizations

• Optimizing compiler

A

• Adaptive optimization
• Automatic parallelization
• Available expression

B

• Bounds-checking elimination

C

• Code Morphing Software
• Code motion
• Common subexpression elimination
• Compile-time function execution
• Constant folding
• Copy elision
• Copy propagation

D

• Data-flow analysis
• Dead store
• Dead-code elimination
• Deforestation (computer science)

E

• Enabling transformation
• Expression templates

F

• Flattening transformation
• Frameworks supporting the polyhedral model

I

• Induction variable
• Inline caching
• Inline expansion
• Instruction scheduling
• Instruction selection
• Interprocedural optimization

J

• Jump threading

L

• Lazy evaluation
• Live-variable analysis
• Loop fission and fusion
• Loop interchange
• Loop inversion
• Loop nest optimization
• Loop optimization
• Loop splitting
• Loop unrolling
• Loop unswitching
• Loop-invariant code motion

M

• Manifest expression

O

• Object code optimizer

P

• Partial evaluation
• Partial-redundancy elimination
• Peephole optimization
• Polytope model
• Profile-guided optimization

R

• Redundant code
• Register allocation
• Rematerialization

S

• Scalable locality
• Sea of nodes
• Short-circuit evaluation
• Software pipelining
• Sparse conditional constant propagation
• Static single-assignment form
• Strength reduction
• Superoptimization

T

• Trace scheduling
• Tree shaking

U

• Unreachable code
• Upwards exposed uses
• Use-define chain

V

• Value numbering
• Value range analysis
• Automatic vectorization

Y

• Yield (multithreading)