dejavu-perf-loop

name

dejavu-perf-loop

description

Optimize a Compose composable's recomposition behavior using Dejavu as a closed-loop validator. Use when the user asks to reduce recompositions, set or tighten a recomposition budget, lock in a recomposition optimization across multiple iterations, fix a recomposition cascade, or apply derivedStateOf / @Immutable / data class fixes iteratively across multiple test runs until the count hits its theoretical floor.

Dejavu Perf Loop

Iteratively shape the recomposition behavior of a Compose composable until it matches what's actually correct for that composable, then lock the count in. The loop is: write/extend a test → run → read the failure → apply ONE fix → re-run → tighten the assertion → repeat until the count matches the theoretical floor. The final test is the regression guard.

The floor may not be zero. A composable that legitimately reads N independent state sources will recompose N times — that's correct, not a bug. The goal is to make the assertion match reality (assertRecompositions(exactly = N)), not to drive every count to assertStable(). Use the cookbook only when the actual count exceeds the theoretical floor.

Reference docs (read before fixing)

• docs/error-messages.md — full error structure and "Common Failure Patterns" (#1–5). Read sections 1–7, lines 11–40 for the canonical example.
• docs/causality-analysis.md — what "Possible cause" actually means; summary table at the bottom (lines 251–257).
• docs/examples.md — Examples 2 (Boolean narrowing, lines 89–124), 3 (data class, lines 132–171), 8 (derivedStateOf, lines 462–493).

Companion skills

• dejavu-test-writer — author or extend the baseline test if one doesn't exist yet. Invoke it first, return here with a working test that has a loose atMost = N assertion.
• dejavu-error-triage — for one-shot "explain this single failure" questions where the user just wants the diagnosis and one fix, not an iterative loop.
• dejavu-onboarding — only if the project doesn't have Dejavu wired up at all. Run that first.

Workflow

1. Pick a target

Identify ONE composable + ONE user interaction. Examples:

• "ProductHeader after refresh button click"
• "CartBanner after item selection"
• "DerivedBanner after select-all"

Narrow scope makes diagnosis tractable. Don't try to optimize a whole screen at once.

2. Establish a baseline test

Either extend an existing test or write a new one (use dejavu-test-writer). Start with a LOOSE upper bound and at least one stable sibling:

@Test
fun productHeader_recompositionBudget() {
    composeTestRule.onNodeWithTag("refresh_button").performClick()
    composeTestRule.waitForIdle()

    composeTestRule.onNodeWithTag("product_header").assertRecompositions(atMost = 10)
    composeTestRule.onNodeWithTag("static_label").assertStable()   // scoping guard
}

The baseline's job is not to pass — it's to capture a real number you can shrink.

3. Run the test, observe the count

Run the appropriate gradle command (see dejavu-test-writer "Run the test").

• If atMost = 10 passes, lower it progressively (5, 3, 2, 1) and re-run until it FAILS. If atMost = N is the first to fail and atMost = M (M > N) was the previous pass, the actual count is in [N + 1, M]. To pin the exact number, narrow the bracket with further probes (or, on Android, read it directly via composeTestRule.getRecompositionCount(tag)).
• When it fails, capture the full error block. Every section in docs/error-messages.md is a diagnostic input.

4. Compute the theoretical floor (which may not be zero)

For the interaction you triggered, count what the target composable legitimately reads:

• 0 state sources read by the target → floor is 0; assertStable() should hold
• 1 state source read by the target → floor is 1
• N independent state sources read by the target → floor is N (unless coalesced by derivedStateOf or batched by Snapshot.withMutableSnapshot)

If actual == floor, you're done with the optimization phase — skip step 5 and go to step 6 to tighten the assertion to exactly = floor (or assertStable() if the floor is 0).

If actual > floor, proceed to step 5 to find the waste.

If actual < floor, something is suspicious — the test isn't exercising what you think it is, or Modifier.testTag is on the wrong node. Re-check the test before celebrating.

5. Apply the decision tree below — ONE fix at a time

This step only applies when actual > floor. The cookbook is for finding unnecessary recompositions; if the count is already correct for what the composable does, don't try to "optimize" it further — that's how you end up with brittle tests or subtle bugs.

Read the Dejavu error and match against the table. Apply exactly one fix per iteration. Multiple fixes at once make it impossible to attribute the count change.

6. Tighten the assertion after each successful fix

Always end with an exact assertion — never atMost:

• Floor is N (any non-zero value) → assertRecompositions(exactly = N)
• Floor is 0 → assertStable() (alias for exactly = 0, clearer intent)
• Still bounded but lower than the previous run → lower atMost and leave a TODO; keep iterating

Never raise atMost to make a test pass. That's a regression, not an optimization.

7. Repeat until convergence

Convergence = actual equals the floor AND the assertion is exactly = N (or assertStable() when the floor is 0). Loose atMost bounds are not convergent; they're a "still in progress" marker.

8. Commit the locked-in test as a regression guard

Add a one-line comment naming the cookbook entry the test guards (or noting that the count was already at floor and just needed locking in). Don't commit unless the user asks.

Decision tree: error pattern → fix

Apply the first matching row. Re-run the test after every fix.

#	Error signal in Dejavu output	Fix to apply	Reference
1	Possible cause: includes same-value write	Convert state holder to data class for structural equality; OR mutableStateOf(value, policy = structuralEqualityPolicy()); OR guard at write site: if (newValue != state.value) state.value = newValue	error-messages.md Pattern 2; causality-analysis.md
2	Possible cause: says Parameter/parent change detected (dirty bits set) AND timeline shows param slots changed: [N] AND the param's type is a non-data-class	Convert the param's class to data class, or annotate @Immutable / @Stable	examples.md Example 3 (lines 132–171)
3	Multiple recompositions on a single interaction; param type is broader than what the function actually uses (e.g. Int only used in > 0, list only used for .isNotEmpty())	Narrow the parameter type (e.g. Int → Boolean, List → Boolean or List → size)	examples.md Example 2 (lines 89–124)
4	Same as #3 but the consumer reads a fine-grained value at every parent recomposition AND the derived signal flips less often	val coarse by remember { derivedStateOf { fineState.someProperty } }; pass coarse to the child	examples.md Example 8 (lines 462–493)
5	All tracked composables shows the parent and many siblings with the same count; child cascades whenever parent recomposes for unrelated reasons	Hoist the state read into the leaf composable that needs it; OR pass State<T> and read .value in the consumer	error-messages.md Pattern 1
6	Same composable appears in the timeline once per list item with no key() block	Add key = { it.id } to ; or wrap loop bodies in

How to read the error fast

1. Expected vs Actual — the gap.
2. All tracked composables — find the <-- FAILED marker. If the parent has the same count as the failed child, you have a cascade (rows #5 / #7).
3. Possible cause — same-value write (row #1) is an immediate bug; Parameter/parent change is the start of the dirty-bit investigation.
4. Recomposition timeline — param slots changed: [N] tells you which parameter's dirty bit fired. Map slot index to function-signature position (slot 0 = first param).
5. Composable source location — Composable: pkg.Name (File.kt:NN) jumps you to the function.

Wrap-up

The final, locked-in test should:

• Use assertRecompositions(exactly = N) when the floor is non-zero, or assertStable() when the floor is 0. Never atMost. The exact count reflects the composable's actual contract.
• Have at least one sibling assertStable() (or exactly = N for siblings that should also have a known floor) to prove scoping.
• Carry a one-line comment naming the cookbook entry it guards (e.g. // Locks in row #3 (Boolean narrowing): ProductHeader recomposes once per visibility flip), or noting "already at floor; locked in" if no fix was needed.

When reporting back to the user, surface:

• Before / after recomposition counts (and the floor — so it's clear when the count was already correct vs. reduced).
• The specific cookbook row applied, if any (and the fix's examples.md line range).
• The exact gradle command that proves the regression guard works.