M10 Performance

actionbook/rust-skills/skills/m10-performance

作者 actionbook5c40d3ad7851无许可证1.5K 个星标收录于 2026年10月8日更新于 2026年10月8日仓库6周前更新

CRITICAL: Use for performance optimization. Triggers: performance, optimization, benchmark, profiling, flamegraph, criterion, slow, fast, allocation, cache, SIMD, make it faster, 性能优化, 基准测试

仅含说明Software Development

AI 生成的概览

指导 Rust 性能优化：先测量瓶颈，再选择数据结构、内存分配与缓存策略。

功能: 该技能提供一套性能优化决策框架，核心是先做性能分析再改代码。它把减少分配、提升缓存局部性、并行化、避免拷贝和减少间接寻址等目标对应到具体实现选择。内容还包括性能分析与基准测试工具、优化优先级顺序、常用技巧与反模式，并指向所有权、并发和资源管理等相关技能。
适用场景: 当代码运行过慢，需要判断优化什么以及优化是否值得时使用。适用于性能分析、基准测试以及内存分配或缓存调优，尤其是 Rust 项目。
运行要求: 不附带任何脚本或工具，仅为说明性内容。文中提到的工具（cargo bench、criterion、perf、flamegraph、heaptrack、valgrind）均为可选，使用时需环境中已安装。

Performance Optimization

Layer 2: Design Choices

Core Question

What's the bottleneck, and is optimization worth it?

Before optimizing:

Have you measured? (Don't guess)
What's the acceptable performance?
Will optimization add complexity?

Performance Decision → Implementation

Goal	Design Choice	Implementation
Reduce allocations	Pre-allocate, reuse	`with_capacity`, object pools
Improve cache	Contiguous data	`Vec`, `SmallVec`
Parallelize	Data parallelism	`rayon`, threads
Avoid copies	Zero-copy	References, `Cow<T>`
Reduce indirection	Inline data	`smallvec`, arrays

Thinking Prompt

Before optimizing:

Have you measured?
- Profile first → flamegraph, perf
- Benchmark → criterion, cargo bench
- Identify actual hotspots
What's the priority?
- Algorithm (10x-1000x improvement)
- Data structure (2x-10x)
- Allocation (2x-5x)
- Cache (1.5x-3x)
What's the trade-off?
- Complexity vs speed
- Memory vs CPU
- Latency vs throughput

Trace Up ↑

To domain constraints (Layer 3):

"How fast does this need to be?"    ↑ Ask: What's the performance SLA?    ↑ Check: domain-* (latency requirements)    ↑ Check: Business requirements (acceptable response time)

"How fast does this need to be?"    ↑ Ask: What's the performance SLA?    ↑ Check: domain-* (latency requirements)    ↑ Check: Business requirements (acceptable response time)

Trace Down ↓

To implementation (Layer 1):

"Need to reduce allocations"    ↓ m01-ownership: Use references, avoid clone    ↓ m02-resource: Pre-allocate with_capacity
"Need to parallelize"    ↓ m07-concurrency: Choose rayon or threads    ↓ m07-concurrency: Consider async for I/O-bound
"Need cache efficiency"    ↓ Data layout: Prefer Vec over HashMap when possible    ↓ Access patterns: Sequential over random access

"Need to reduce allocations"    ↓ m01-ownership: Use references, avoid clone    ↓ m02-resource: Pre-allocate with_capacity
"Need to parallelize"    ↓ m07-concurrency: Choose rayon or threads    ↓ m07-concurrency: Consider async for I/O-bound
"Need cache efficiency"    ↓ Data layout: Prefer Vec over HashMap when possible    ↓ Access patterns: Sequential over random access

Quick Reference

Optimization Priority

1. Algorithm choice     (10x - 1000x)2. Data structure       (2x - 10x)3. Allocation reduction (2x - 5x)4. Cache optimization   (1.5x - 3x)5. SIMD/Parallelism     (2x - 8x)

1. Algorithm choice     (10x - 1000x)2. Data structure       (2x - 10x)3. Allocation reduction (2x - 5x)4. Cache optimization   (1.5x - 3x)5. SIMD/Parallelism     (2x - 8x)

Common Techniques

Technique	When	How
Pre-allocation	Known size	`Vec::with_capacity(n)`
Avoid cloning	Hot paths	Use references or `Cow<T>`
Batch operations	Many small ops	Collect then process
SmallVec	Usually small	`smallvec::SmallVec<[T; N]>`
Inline buffers	Fixed-size data	Arrays over Vec

Common Mistakes

Mistake	Why Wrong	Better
Optimize without profiling	Wrong target	Profile first
Benchmark in debug mode	Meaningless	Always `--release`
Use LinkedList	Cache unfriendly	`Vec` or `VecDeque`
Hidden `.clone()`	Unnecessary allocs	Use references
Premature optimization	Wasted effort	Make it work first

Anti-Patterns

Anti-Pattern	Why Bad	Better
Clone to avoid lifetimes	Performance cost	Proper ownership
Box everything	Indirection cost	Stack when possible
HashMap for small sets	Overhead	Vec with linear search
String concat in loop	O(n^2)	`String::with_capacity` or `format!`

Related Skills

来源与署名

来源：actionbook/rust-skills位于skills/m10-performance提交5c40d3a

许可证：无许可证

内容归原作者所有。SourceWeft 从公开仓库中收录这些内容。

举报或申请下架

Question	Trace To	Ask
Latency requirements	domain-*	What's acceptable response time?
Throughput needs	domain-*	How many requests per second?
Memory constraints	domain-*	What's the memory budget?

Tool	Purpose
`cargo bench`	Micro-benchmarks
`criterion`	Statistical benchmarks
`perf` / `flamegraph`	CPU profiling
`heaptrack`	Allocation tracking
`valgrind` / `cachegrind`	Cache analysis

M10 Performance

Performance Optimization

Core Question

Performance Decision → Implementation

Thinking Prompt

Trace Up ↑

Trace Down ↓

Quick Reference

Optimization Priority

Common Techniques

Common Mistakes

Anti-Patterns

Related Skills

来源与署名

更多来自 actionbook/rust-skills 的技能

Rust Trait Explorer

Rust Symbol Analyzer

Rust Skill Creator

Rust Router

Rust Refactor Helper

Rust Daily

更多Software Development技能

Playground

M5 Onboard

Cardputer Buddy

Web Design Guidelines

Vercel React Native Skills

Vercel React Best Practices

When	See
Reducing clones	m01-ownership
Concurrency options	m07-concurrency
Smart pointer choice	m02-resource
Domain requirements	domain-*