Category:Compiler optimizations
![]() | Computing portal |
Here is a list of articles in the category Compiler optimizations of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Compiler optimizations"
The following 62 pages are in this category, out of 62 total.
- Optimizing compiler (computing)
A
- Adaptive optimization (computing)
- Automatic parallelization (computing)
- Available expression (computing)
B
- Bounds-checking elimination (computing)
C
- Code Morphing Software (computing)
- Common subexpression elimination (computing)
- Compile time function execution (computing)
- Constant folding (computing)
- Copy elision (computing)
- Copy propagation (computing)
D
- Data-flow analysis (computing)
- Dead code elimination (computing)
- Dead store (computing)
- Deforestation (computer science) (computing)
E
- Enabling transformation (computing)
F
- Frameworks supporting the polyhedral model (computing)
I
- Induction variable (computing)
- Inline caching (computing)
- Inline expansion (computing)
- Instruction scheduling (computing)
- Instruction selection (computing)
- Interprocedural optimization (computing)
J
- Jump threading (computing)
L
- Lazy evaluation (computing)
- Live variable analysis (computing)
- Loop fission and fusion (computing)
- Loop interchange (computing)
- Loop inversion (computing)
- Loop nest optimization (computing)
- Loop optimization (computing)
- Loop splitting (computing)
- Loop unrolling (computing)
- Loop unswitching (computing)
- Loop-invariant code motion (computing)
M
- Manifest expression (computing)
O
- Object code optimizer (computing)
P
- Partial evaluation (computing)
- Partial redundancy elimination (computing)
- Peephole optimization (computing)
- Polytope model (computing)
- Profile-guided optimization (computing)
R
- Redundant code (computing)
- Register allocation (computing)
- Rematerialization (computing)
S
- Scalable locality (computing)
- Short-circuit evaluation (computing)
- Software pipelining (computing)
- Sparse conditional constant propagation (computing)
- Static single assignment form (computing)
- Strength reduction (computing)
- Superoptimization (computing)
- Superword Level Parallelism (computing)
T
- Trace scheduling (computing)
- Tree shaking (computing)
U
- Unreachable code (computing)
- Upwards exposed uses (computing)
- Use-define chain (computing)
V
- Value numbering (computing)
- Value range analysis (computing)
- Automatic vectorization (computing)
Y
- Yield (multithreading) (computing)