Help
Category:Compiler optimizations
From Infogalactic: the planetary knowledge core
Jump to:
navigation
,
search
Pages in category "Compiler optimizations"
The following 47 pages are in this category, out of 47 total.
Optimizing compiler
A
Adaptive optimization
Automatic parallelization
B
Bounds-checking elimination
C
Common subexpression elimination
Constant folding
Copy elision
Copy propagation
D
Data-flow analysis
Deforestation (computer science)
E
Enabling transformation
F
Frameworks supporting the polyhedral model
G
Global value numbering
I
Induction variable
Inline expansion
Instruction scheduling
Instruction selection
Interprocedural optimization
L
Lazy evaluation
Live variable analysis
Loop fission
Loop fusion
Loop interchange
Loop inversion
Loop nest optimization
Loop optimization
Loop splitting
Loop tiling
Loop unrolling
Loop unswitching
Loop-invariant code motion
M
Manifest expression
O
Object code optimizer
P
Partial evaluation
Peephole optimization
Polytope model
R
Redundant code
Register allocation
Rematerialization
S
Software pipelining
Sparse conditional constant propagation
Static single assignment form
Strength reduction
T
Trace scheduling
U
Unreachable code
Use-define chain
V
Automatic vectorization
Categories
:
Compiler construction
Program analysis
Program transformation
Software optimization
Navigation menu
Personal tools
Log in
Request account
Namespaces
Category
Discussion
Variants
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help
Infogalactic News
Buy an account
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information