rust-performance-analyzer

Analyzes Rust code for performance bottlenecks, memory inefficiencies, and optimization opportunities. Use when discussing performance, slow code, memory usage, profiling, benchmarks, or optimization.

⭐5stars🔀1forks📁View on GitHub🕐Updated Jan 11, 2026

When & Why to Use This Skill

The Rust Performance Analyzer is a specialized Claude skill designed to optimize Rust applications by identifying performance bottlenecks, memory inefficiencies, and concurrency issues. It provides actionable insights into hot paths, memory layout, and allocation patterns, helping developers write high-performance, low-latency Rust code through expert-level code review and profiling guidance.

Use Cases

  • Identifying and eliminating 'hot paths' such as frequent allocations and unnecessary cloning in tight loops to reduce CPU overhead.
  • Optimizing memory layout and struct alignment to improve cache efficiency and reduce the memory footprint of Rust applications.
  • Analyzing concurrency patterns to resolve lock contention and suggest more efficient synchronization primitives like atomics or parking_lot.
  • Providing specific profiling and benchmarking commands (cargo flamegraph, cargo bench) to validate performance improvements and establish metrics.
  • Reviewing FLUI-specific patterns to optimize signal updates, layout phases, and paint layer caching for smoother user interfaces.
namerust-performance-analyzer
descriptionAnalyzes Rust code for performance bottlenecks, memory inefficiencies, and optimization opportunities. Use when discussing performance, slow code, memory usage, profiling, benchmarks, or optimization.

Rust Performance Analyzer

Expert skill for analyzing and optimizing Rust application performance.

When to Use

Activate this skill when the user:

  • Mentions "slow", "performance", "optimize", "bottleneck"
  • Asks about memory usage or allocation patterns
  • Wants to profile or benchmark code
  • Reports laggy UI or frame drops
  • Discusses cache efficiency or data layout

Analysis Process

1. Identify Hot Paths

Look for:

  • Frequent allocations (Vec::new(), String::new() in loops)
  • Unnecessary cloning (.clone() where borrow would work)
  • Hash map lookups in tight loops
  • Box/Arc indirection overhead

2. Memory Layout Analysis

Check:

  • Struct field ordering (largest first for alignment)
  • Use of #[repr(C)] where needed
  • Option niche optimization usage
  • Cache line friendliness

3. Concurrency Patterns

Evaluate:

  • Lock contention (Mutex, RwLock usage)
  • parking_lot vs std sync primitives
  • Atomic operations appropriateness
  • Send/Sync bounds efficiency

4. FLUI-Specific Patterns

Focus on:

  • Signal update frequency
  • Rebuild triggering patterns
  • Layout phase efficiency
  • Paint layer caching

Optimization Techniques

Allocation Reduction

// Bad: Allocates on every call
fn process(items: &[Item]) -> Vec<ProcessedItem> {
    items.iter().map(|i| process_one(i)).collect()
}

// Good: Reuse buffer
fn process_into(items: &[Item], buffer: &mut Vec<ProcessedItem>) {
    buffer.clear();
    buffer.extend(items.iter().map(|i| process_one(i)));
}

Clone Elimination

// Bad: Unnecessary clone
let data = self.data.clone();
process(&data);

// Good: Borrow directly
process(&self.data);

Interior Mutability

// Use RefCell/Cell for single-threaded
// Use parking_lot::{Mutex, RwLock} for multi-threaded
// Use atomics for simple counters/flags

Profiling Commands

# Build with debug symbols
cargo build --release

# CPU profiling (requires cargo-flamegraph)
cargo flamegraph --example <name>

# Memory profiling
RUSTFLAGS="-Z sanitizer=address" cargo +nightly run --example <name>

# Benchmarking
cargo bench

Output Format

Provide:

  1. Identified Issues: List of performance problems found
  2. Impact Assessment: Severity (High/Medium/Low)
  3. Optimization Suggestions: Specific code changes
  4. Metrics: Before/after estimates where possible