Expand description
BLVM Runtime Optimization Passes
Additional optimization passes for 10-30% performance gains
This module provides runtime optimization passes:
- Constant folding (pre-computed constants)
- Bounds check optimization (proven bounds)
- Inlining hints (hot function markers)
- Memory layout optimization (cache-friendly structures)
Reference: Orange Paper Section 13.1 - Performance Considerations
Re-exports§
pub use optimized_access::prealloc_block_buffer;pub use optimized_access::prealloc_tx_buffer;pub use constant_folding::*;pub use precomputed_constants::*;
Modules§
- _optimized_
access - Alias module for _optimized_access (for backward compatibility)
- constant_
folding - Constant folding: Pre-compute common hash results
- dead_
code_ elimination - Dead code elimination markers
- optimized_
access - Optimized access using proven bounds
- precomputed_
constants - Pre-computed constants for constant folding optimization
- prefetch
- Memory prefetching optimization
- proven_
bounds - Proven bounds for runtime optimization
- reference_
implementations - Reference implementations for equivalence proofs
- runtime_
assertions - Runtime assertions for optimization correctness
- simd_
vectorization - SIMD Vectorization: Batch hash operations
Structs§
- Cache
Aligned Hash - Memory layout optimization: Cache-friendly hash array
- Compact
Stack Frame - Memory layout optimization: Compact stack frame