Skip to content

Commit

Permalink
Fix useMemoCache with setState in render
Browse files Browse the repository at this point in the history
Fixes the bug that @alexmckenley and @mofeiZ found where setState-in-render can reset useMemoCache and cause an infinite loop. The bug was that renderWithHooksAgain() was not resetting hook state when rerendering (so useMemo values were preserved) but was resetting the updateQueue. This meant that the entire memo cache was cleared on a setState-in-render.

The fix here is to call a new helper function to clear the update queue. It nulls out other properties, but for memoCache it just sets the index back to zero.

ghstack-source-id: 57608c8a4d5ba86de26b9a4e1d3a9c4d5463b0e4
Pull Request resolved: #30889
  • Loading branch information
josephsavona committed Sep 6, 2024
1 parent a06cd9e commit 1b55c98
Show file tree
Hide file tree
Showing 2 changed files with 41 additions and 24 deletions.
37 changes: 27 additions & 10 deletions packages/react-reconciler/src/ReactFiberHooks.js
Original file line number Diff line number Diff line change
Expand Up @@ -770,6 +770,7 @@ export function replaySuspendedComponentWithHooks<Props, SecondArg>(
ignorePreviousDependencies =
current !== null && current.type !== workInProgress.type;
}
workInProgress.updateQueue = null;
const children = renderWithHooksAgain(
workInProgress,
Component,
Expand Down Expand Up @@ -828,7 +829,9 @@ function renderWithHooksAgain<Props, SecondArg>(
currentHook = null;
workInProgressHook = null;

workInProgress.updateQueue = null;
if (workInProgress.updateQueue != null) {
resetFunctionComponentUpdateQueue(workInProgress.updateQueue);
}

if (__DEV__) {
// Also validate hook order for cascading updates.
Expand Down Expand Up @@ -1101,6 +1104,22 @@ if (enableUseMemoCacheHook) {
};
}

function resetFunctionComponentUpdateQueue(
updateQueue: FunctionComponentUpdateQueue,
): void {
updateQueue.lastEffect = null;
updateQueue.events = null;
updateQueue.stores = null;
if (enableUseMemoCacheHook) {
if (updateQueue.memoCache != null) {
// NOTE: this function intentionally does not reset memoCache data. We reuse updateQueue for the memo
// cache to avoid increasing the size of fibers that don't need a cache, but we don't want to reset
// the cache when other properties are reset.
updateQueue.memoCache.index = 0;
}
}
}

function useThenable<T>(thenable: Thenable<T>): T {
// Track the position of the thenable within this fiber.
const index = thenableIndexCounter;
Expand Down Expand Up @@ -2496,17 +2515,15 @@ function pushEffect(
if (componentUpdateQueue === null) {
componentUpdateQueue = createFunctionComponentUpdateQueue();
currentlyRenderingFiber.updateQueue = (componentUpdateQueue: any);
}
const lastEffect = componentUpdateQueue.lastEffect;
if (lastEffect === null) {
componentUpdateQueue.lastEffect = effect.next = effect;
} else {
const lastEffect = componentUpdateQueue.lastEffect;
if (lastEffect === null) {
componentUpdateQueue.lastEffect = effect.next = effect;
} else {
const firstEffect = lastEffect.next;
lastEffect.next = effect;
effect.next = firstEffect;
componentUpdateQueue.lastEffect = effect;
}
const firstEffect = lastEffect.next;
lastEffect.next = effect;
effect.next = firstEffect;
componentUpdateQueue.lastEffect = effect;
}
return effect;
}
Expand Down
28 changes: 14 additions & 14 deletions packages/react-reconciler/src/__tests__/useMemoCache-test.js
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,6 @@ let assertLog;
let useMemo;
let useState;
let useMemoCache;
let waitForThrow;
let MemoCacheSentinel;
let ErrorBoundary;

Expand All @@ -32,7 +31,6 @@ describe('useMemoCache()', () => {
useMemo = React.useMemo;
useMemoCache = require('react/compiler-runtime').c;
useState = React.useState;
waitForThrow = require('internal-test-utils').waitForThrow;
MemoCacheSentinel = Symbol.for('react.memo_cache_sentinel');

class _ErrorBoundary extends React.Component {
Expand Down Expand Up @@ -600,6 +598,8 @@ describe('useMemoCache()', () => {
await act(() => setInput('hi!'));

// Once the input has updated, we go back to rendering the transition.
// We did not have process the first chunk again. We reused the
// computation from the earlier attempt.
if (gate(flags => flags.enableNoCloningMemoCache)) {
// We did not have process the first chunk again. We reused the
// computation from the earlier attempt.
Expand Down Expand Up @@ -630,6 +630,8 @@ describe('useMemoCache()', () => {

// Finish loading the data.
await act(() => updatedChunkB.resolve('B2'));
// We did not have process the first chunk again. We reused the
// computation from the earlier attempt.
if (gate(flags => flags.enableNoCloningMemoCache)) {
// We did not have process the first chunk again. We reused the
// computation from the earlier attempt.
Expand Down Expand Up @@ -667,7 +669,7 @@ describe('useMemoCache()', () => {
}

// Baseline / source code
function useUserMemo(value) {
function useManualMemo(value) {
return useMemo(() => [value], [value]);
}

Expand All @@ -683,24 +685,22 @@ describe('useMemoCache()', () => {
}

/**
* Test case: note that the initial render never completes
* Test with useMemoCache
*/
let root = ReactNoop.createRoot();
const IncorrectInfiniteComponent = makeComponent(useCompilerMemo);
root.render(<IncorrectInfiniteComponent value={2} />);
await waitForThrow(
'Too many re-renders. React limits the number of renders to prevent ' +
'an infinite loop.',
);
const CompilerMemoComponent = makeComponent(useCompilerMemo);
await act(() => {
root.render(<CompilerMemoComponent value={2} />);
});
expect(root).toMatchRenderedOutput(<div>2</div>);

/**
* Baseline test: initial render is expected to complete after a retry
* (triggered by the setState)
* Test with useMemo
*/
root = ReactNoop.createRoot();
const CorrectComponent = makeComponent(useUserMemo);
const HookMemoComponent = makeComponent(useManualMemo);
await act(() => {
root.render(<CorrectComponent value={2} />);
root.render(<HookMemoComponent value={2} />);
});
expect(root).toMatchRenderedOutput(<div>2</div>);
});
Expand Down

0 comments on commit 1b55c98

Please sign in to comment.