بنقرة واحدة
audit-performance
Audit hot paths for performance inefficiencies (allocations, contention, layout)
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
القائمة
Audit hot paths for performance inefficiencies (allocations, contention, layout)
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
Audit the adaptive window hill-climber and region-resize logic for implementation defects (not algorithm quality)
JSR-107 (JCache) spec-conformance audit
Audit explicit state machines (drain status, node lifecycle, async-value lifecycle) for illegal or missed transitions
Heavyweight history-mining bug audit. Walks the caffeine module's git history chronologically (oldest to HEAD), maintains a forward-tracked issue database, and surfaces concerns introduced by past commits that were never resolved. Catches bugs that snapshot mining cannot — half-fixes invisible from current state, latent+trigger pairs across multi-commit interactions, and partial refactors. Slow (model/effort-dependent; ~24h on Opus + max effort) and rare-run (every several months or before a major release).
Differential audit comparing matched code paths that should behave identically. Spawns one auditor per sibling pair (sync/async, bounded/unbounded, view consistency, bulk vs single, generated node variants, read fast vs slow, adapter conformance) and requires a concrete witness scenario where the two paths diverge observably.
Find places where documented API contracts and the implementation diverge
| name | audit-performance |
| description | Audit hot paths for performance inefficiencies (allocations, contention, layout) |
| context | fork |
| agent | auditor |
| disable-model-invocation | true |
Audit the Caffeine cache for performance inefficiencies.
Context: Caffeine runs in high-throughput, low-latency JVM services where cache operations occur millions of times per second. The library is already heavily optimized — generic textbook advice is not useful.
Trace get()/getIfPresent() from entry to return. Count volatile/opaque reads, method calls, branches, allocations. Even one saved volatile read matters.
Identify allocations surviving escape analysis on hot paths. Frequency, size, lifetime. Do not flag JIT-eliminated allocations.
CAS retry rates, cache-line bouncing, graceful vs catastrophic degradation for read buffer, evictionLock, CHM bins, node field updates.
Counter layout locality, hash computation, reset cost. Accessed every read/write.
Worst-case work per write, latency spikes, eviction cascades, timer wheel scan cost.
Node object size, pointer indirection depth, false sharing, @Contended opportunities.
For each finding:
## [Category] Title
**Location:** file:method (lines X-Y)
**Severity:** negligible | moderate | high
**What happens:** (trace the code path)
**Why it matters:** (quantify)
**JIT considerations:** (will C2 handle this?)
**Proposed fix:** (specific code change)
**Expected benchmark impact:** (JMH prediction)
If fewer than 3 real issues, the code is well-optimized. Do not pad the output.