-
+
+
+
+ {Array.from(tabs.keys()).map(tab => {
+ const isActive = activeTab === tab;
+ return (
+
+ );
+ })}
+
+
+ {tabs.get(activeTab)}
- )}
+
);
}
diff --git a/compiler/apps/playground/lib/compilation.ts b/compiler/apps/playground/lib/compilation.ts
new file mode 100644
index 000000000000..b2bee8bd66d4
--- /dev/null
+++ b/compiler/apps/playground/lib/compilation.ts
@@ -0,0 +1,308 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+import {parse as babelParse, ParseResult} from '@babel/parser';
+import * as HermesParser from 'hermes-parser';
+import * as t from '@babel/types';
+import BabelPluginReactCompiler, {
+ CompilerError,
+ CompilerErrorDetail,
+ CompilerDiagnostic,
+ Effect,
+ ErrorCategory,
+ parseConfigPragmaForTests,
+ ValueKind,
+ type Hook,
+ PluginOptions,
+ CompilerPipelineValue,
+ parsePluginOptions,
+ printReactiveFunctionWithOutlined,
+ printFunctionWithOutlined,
+ type LoggerEvent,
+} from 'babel-plugin-react-compiler';
+import {transformFromAstSync} from '@babel/core';
+import JSON5 from 'json5';
+import type {
+ CompilerOutput,
+ CompilerTransformOutput,
+ PrintedCompilerPipelineValue,
+} from '../components/Editor/Output';
+
+function parseInput(
+ input: string,
+ language: 'flow' | 'typescript',
+): ParseResult
{
+ // Extract the first line to quickly check for custom test directives
+ if (language === 'flow') {
+ return HermesParser.parse(input, {
+ babel: true,
+ flow: 'all',
+ sourceType: 'module',
+ enableExperimentalComponentSyntax: true,
+ });
+ } else {
+ return babelParse(input, {
+ plugins: ['typescript', 'jsx'],
+ sourceType: 'module',
+ }) as ParseResult;
+ }
+}
+
+function invokeCompiler(
+ source: string,
+ language: 'flow' | 'typescript',
+ options: PluginOptions,
+): CompilerTransformOutput {
+ const ast = parseInput(source, language);
+ let result = transformFromAstSync(ast, source, {
+ filename: '_playgroundFile.js',
+ highlightCode: false,
+ retainLines: true,
+ plugins: [[BabelPluginReactCompiler, options]],
+ ast: true,
+ sourceType: 'module',
+ configFile: false,
+ sourceMaps: true,
+ babelrc: false,
+ });
+ if (result?.ast == null || result?.code == null || result?.map == null) {
+ throw new Error('Expected successful compilation');
+ }
+ return {
+ code: result.code,
+ sourceMaps: result.map,
+ language,
+ };
+}
+
+const COMMON_HOOKS: Array<[string, Hook]> = [
+ [
+ 'useFragment',
+ {
+ valueKind: ValueKind.Frozen,
+ effectKind: Effect.Freeze,
+ noAlias: true,
+ transitiveMixedData: true,
+ },
+ ],
+ [
+ 'usePaginationFragment',
+ {
+ valueKind: ValueKind.Frozen,
+ effectKind: Effect.Freeze,
+ noAlias: true,
+ transitiveMixedData: true,
+ },
+ ],
+ [
+ 'useRefetchableFragment',
+ {
+ valueKind: ValueKind.Frozen,
+ effectKind: Effect.Freeze,
+ noAlias: true,
+ transitiveMixedData: true,
+ },
+ ],
+ [
+ 'useLazyLoadQuery',
+ {
+ valueKind: ValueKind.Frozen,
+ effectKind: Effect.Freeze,
+ noAlias: true,
+ transitiveMixedData: true,
+ },
+ ],
+ [
+ 'usePreloadedQuery',
+ {
+ valueKind: ValueKind.Frozen,
+ effectKind: Effect.Freeze,
+ noAlias: true,
+ transitiveMixedData: true,
+ },
+ ],
+];
+
+export function parseConfigOverrides(configOverrides: string): any {
+ const trimmed = configOverrides.trim();
+ if (!trimmed) {
+ return {};
+ }
+ return JSON5.parse(trimmed);
+}
+
+function parseOptions(
+ source: string,
+ mode: 'compiler' | 'linter',
+ configOverrides: string,
+): PluginOptions {
+ // Extract the first line to quickly check for custom test directives
+ const pragma = source.substring(0, source.indexOf('\n'));
+
+ const parsedPragmaOptions = parseConfigPragmaForTests(pragma, {
+ compilationMode: 'infer',
+ environment:
+ mode === 'linter'
+ ? {
+ // enabled in compiler
+ validateRefAccessDuringRender: false,
+ // enabled in linter
+ validateNoSetStateInRender: true,
+ validateNoSetStateInEffects: true,
+ validateNoJSXInTryStatements: true,
+ validateNoImpureFunctionsInRender: true,
+ validateStaticComponents: true,
+ validateNoFreezingKnownMutableFunctions: true,
+ validateNoVoidUseMemo: true,
+ }
+ : {
+ /* use defaults for compiler mode */
+ },
+ });
+
+ // Parse config overrides from config editor
+ const configOverrideOptions = parseConfigOverrides(configOverrides);
+
+ const opts: PluginOptions = parsePluginOptions({
+ ...parsedPragmaOptions,
+ ...configOverrideOptions,
+ environment: {
+ ...parsedPragmaOptions.environment,
+ ...configOverrideOptions.environment,
+ customHooks: new Map([...COMMON_HOOKS]),
+ },
+ });
+
+ return opts;
+}
+
+export function compile(
+ source: string,
+ mode: 'compiler' | 'linter',
+ configOverrides: string,
+): [CompilerOutput, 'flow' | 'typescript', PluginOptions | null] {
+ const results = new Map>();
+ const error = new CompilerError();
+ const otherErrors: Array = [];
+ const upsert: (result: PrintedCompilerPipelineValue) => void = result => {
+ const entry = results.get(result.name);
+ if (Array.isArray(entry)) {
+ entry.push(result);
+ } else {
+ results.set(result.name, [result]);
+ }
+ };
+ let language: 'flow' | 'typescript';
+ if (source.match(/\@flow/)) {
+ language = 'flow';
+ } else {
+ language = 'typescript';
+ }
+ let transformOutput;
+
+ let baseOpts: PluginOptions | null = null;
+ try {
+ baseOpts = parseOptions(source, mode, configOverrides);
+ } catch (err) {
+ error.details.push(
+ new CompilerErrorDetail({
+ category: ErrorCategory.Config,
+ reason: `Unexpected failure when transforming configs! \n${err}`,
+ loc: null,
+ suggestions: null,
+ }),
+ );
+ }
+ if (baseOpts) {
+ try {
+ const logIR = (result: CompilerPipelineValue): void => {
+ switch (result.kind) {
+ case 'ast': {
+ break;
+ }
+ case 'hir': {
+ upsert({
+ kind: 'hir',
+ fnName: result.value.id,
+ name: result.name,
+ value: printFunctionWithOutlined(result.value),
+ });
+ break;
+ }
+ case 'reactive': {
+ upsert({
+ kind: 'reactive',
+ fnName: result.value.id,
+ name: result.name,
+ value: printReactiveFunctionWithOutlined(result.value),
+ });
+ break;
+ }
+ case 'debug': {
+ upsert({
+ kind: 'debug',
+ fnName: null,
+ name: result.name,
+ value: result.value,
+ });
+ break;
+ }
+ default: {
+ const _: never = result;
+ throw new Error(`Unhandled result ${result}`);
+ }
+ }
+ };
+ // Add logger options to the parsed options
+ const opts = {
+ ...baseOpts,
+ logger: {
+ debugLogIRs: logIR,
+ logEvent: (_filename: string | null, event: LoggerEvent): void => {
+ if (event.kind === 'CompileError') {
+ otherErrors.push(event.detail);
+ }
+ },
+ },
+ };
+ transformOutput = invokeCompiler(source, language, opts);
+ } catch (err) {
+ /**
+ * error might be an invariant violation or other runtime error
+ * (i.e. object shape that is not CompilerError)
+ */
+ if (err instanceof CompilerError && err.details.length > 0) {
+ error.merge(err);
+ } else {
+ /**
+ * Handle unexpected failures by logging (to get a stack trace)
+ * and reporting
+ */
+ error.details.push(
+ new CompilerErrorDetail({
+ category: ErrorCategory.Invariant,
+ reason: `Unexpected failure when transforming input! \n${err}`,
+ loc: null,
+ suggestions: null,
+ }),
+ );
+ }
+ }
+ }
+ // Only include logger errors if there weren't other errors
+ if (!error.hasErrors() && otherErrors.length !== 0) {
+ otherErrors.forEach(e => error.details.push(e));
+ }
+ if (error.hasErrors() || !transformOutput) {
+ return [{kind: 'err', results, error}, language, baseOpts];
+ }
+ return [
+ {kind: 'ok', results, transformOutput, errors: error.details},
+ language,
+ baseOpts,
+ ];
+}
diff --git a/compiler/apps/playground/lib/defaultStore.ts b/compiler/apps/playground/lib/defaultStore.ts
index 132ab445e18c..9711249ff4f5 100644
--- a/compiler/apps/playground/lib/defaultStore.ts
+++ b/compiler/apps/playground/lib/defaultStore.ts
@@ -13,10 +13,19 @@ export default function MyApp() {
}
`;
+export const defaultConfig = `\
+{
+ //compilationMode: "all"
+}`;
+
export const defaultStore: Store = {
source: index,
+ config: defaultConfig,
+ showInternals: false,
};
export const emptyStore: Store = {
source: '',
+ config: '',
+ showInternals: false,
};
diff --git a/compiler/apps/playground/lib/reactCompilerMonacoDiagnostics.ts b/compiler/apps/playground/lib/reactCompilerMonacoDiagnostics.ts
index a800e2577329..cece2fa7c6dd 100644
--- a/compiler/apps/playground/lib/reactCompilerMonacoDiagnostics.ts
+++ b/compiler/apps/playground/lib/reactCompilerMonacoDiagnostics.ts
@@ -6,7 +6,11 @@
*/
import {Monaco} from '@monaco-editor/react';
-import {CompilerErrorDetail, ErrorSeverity} from 'babel-plugin-react-compiler';
+import {
+ CompilerDiagnostic,
+ CompilerErrorDetail,
+ ErrorSeverity,
+} from 'babel-plugin-react-compiler';
import {MarkerSeverity, type editor} from 'monaco-editor';
function mapReactCompilerSeverityToMonaco(
@@ -22,38 +26,46 @@ function mapReactCompilerSeverityToMonaco(
}
function mapReactCompilerDiagnosticToMonacoMarker(
- detail: CompilerErrorDetail,
+ detail: CompilerErrorDetail | CompilerDiagnostic,
monaco: Monaco,
+ source: string,
): editor.IMarkerData | null {
- if (detail.loc == null || typeof detail.loc === 'symbol') {
+ const loc = detail.primaryLocation();
+ if (loc == null || typeof loc === 'symbol') {
return null;
}
const severity = mapReactCompilerSeverityToMonaco(detail.severity, monaco);
- let message = detail.printErrorMessage();
+ let message = detail.printErrorMessage(source, {eslint: true});
return {
severity,
message,
- startLineNumber: detail.loc.start.line,
- startColumn: detail.loc.start.column + 1,
- endLineNumber: detail.loc.end.line,
- endColumn: detail.loc.end.column + 1,
+ startLineNumber: loc.start.line,
+ startColumn: loc.start.column + 1,
+ endLineNumber: loc.end.line,
+ endColumn: loc.end.column + 1,
};
}
type ReactCompilerMarkerConfig = {
monaco: Monaco;
model: editor.ITextModel;
- details: Array;
+ details: Array;
+ source: string;
};
let decorations: Array = [];
export function renderReactCompilerMarkers({
monaco,
model,
details,
+ source,
}: ReactCompilerMarkerConfig): void {
const markers: Array = [];
for (const detail of details) {
- const marker = mapReactCompilerDiagnosticToMonacoMarker(detail, monaco);
+ const marker = mapReactCompilerDiagnosticToMonacoMarker(
+ detail,
+ monaco,
+ source,
+ );
if (marker == null) {
continue;
}
diff --git a/compiler/apps/playground/lib/stores/store.ts b/compiler/apps/playground/lib/stores/store.ts
index ad4a57cf914a..6655efa27408 100644
--- a/compiler/apps/playground/lib/stores/store.ts
+++ b/compiler/apps/playground/lib/stores/store.ts
@@ -10,18 +10,20 @@ import {
compressToEncodedURIComponent,
decompressFromEncodedURIComponent,
} from 'lz-string';
-import {defaultStore} from '../defaultStore';
+import {defaultStore, defaultConfig} from '../defaultStore';
/**
* Global Store for Playground
*/
export interface Store {
source: string;
+ config: string;
+ showInternals: boolean;
}
export function encodeStore(store: Store): string {
return compressToEncodedURIComponent(JSON.stringify(store));
}
-export function decodeStore(hash: string): Store {
+export function decodeStore(hash: string): any {
return JSON.parse(decompressFromEncodedURIComponent(hash));
}
@@ -62,8 +64,14 @@ export function initStoreFromUrlOrLocalStorage(): Store {
*/
if (!encodedSource) return defaultStore;
- const raw = decodeStore(encodedSource);
+ const raw: any = decodeStore(encodedSource);
invariant(isValidStore(raw), 'Invalid Store');
- return raw;
+
+ // Make sure all properties are populated
+ return {
+ source: raw.source,
+ config: 'config' in raw && raw['config'] ? raw.config : defaultConfig,
+ showInternals: 'showInternals' in raw ? raw.showInternals : false,
+ };
}
diff --git a/compiler/apps/playground/lib/transitionTypes.ts b/compiler/apps/playground/lib/transitionTypes.ts
new file mode 100644
index 000000000000..0cd9596508c6
--- /dev/null
+++ b/compiler/apps/playground/lib/transitionTypes.ts
@@ -0,0 +1,11 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+export const CONFIG_PANEL_TRANSITION = 'config-panel';
+export const TOGGLE_TAB_TRANSITION = 'toggle-tab';
+export const TOGGLE_INTERNALS_TRANSITION = 'toggle-internals';
+export const EXPAND_ACCORDION_TRANSITION = 'open-accordion';
diff --git a/compiler/apps/playground/next-env.d.ts b/compiler/apps/playground/next-env.d.ts
deleted file mode 100644
index 1b3be0840f3f..000000000000
--- a/compiler/apps/playground/next-env.d.ts
+++ /dev/null
@@ -1,5 +0,0 @@
-///
-///
-
-// NOTE: This file should not be edited
-// see https://nextjs.org/docs/app/api-reference/config/typescript for more information.
diff --git a/compiler/apps/playground/next.config.js b/compiler/apps/playground/next.config.js
index fc8a9492e4ed..f34f958ec6d2 100644
--- a/compiler/apps/playground/next.config.js
+++ b/compiler/apps/playground/next.config.js
@@ -11,6 +11,7 @@ const path = require('path');
const nextConfig = {
experimental: {
reactCompiler: true,
+ viewTransition: true,
},
reactStrictMode: true,
webpack: (config, options) => {
diff --git a/compiler/apps/playground/package.json b/compiler/apps/playground/package.json
index c17d0e4847ee..65f27158d8f2 100644
--- a/compiler/apps/playground/package.json
+++ b/compiler/apps/playground/package.json
@@ -26,34 +26,40 @@
"@babel/traverse": "^7.18.9",
"@babel/types": "7.26.3",
"@heroicons/react": "^1.0.6",
- "@monaco-editor/react": "^4.4.6",
- "@playwright/test": "^1.51.1",
+ "@monaco-editor/react": "^4.8.0-rc.2",
+ "@playwright/test": "^1.56.1",
"@use-gesture/react": "^10.2.22",
"hermes-eslint": "^0.25.0",
"hermes-parser": "^0.25.0",
"invariant": "^2.2.4",
+ "json5": "^2.2.3",
+ "lru-cache": "^11.2.2",
"lz-string": "^1.5.0",
"monaco-editor": "^0.52.0",
- "next": "^15.2.0-canary.64",
+ "next": "15.5.9",
"notistack": "^3.0.0-alpha.7",
"prettier": "^3.3.3",
"pretty-format": "^29.3.1",
"re-resizable": "^6.9.16",
- "react": "^19.0.0",
- "react-dom": "^19.0.0"
+ "react": "19.2.3",
+ "react-dom": "19.2.3"
},
"devDependencies": {
"@types/node": "18.11.9",
- "@types/react": "^19.0.0",
- "@types/react-dom": "^19.0.0",
+ "@types/react": "19.2",
+ "@types/react-dom": "19.2",
"autoprefixer": "^10.4.13",
"clsx": "^1.2.1",
"concurrently": "^7.4.0",
"eslint": "^8.28.0",
- "eslint-config-next": "^15.0.1",
+ "eslint-config-next": "15.5.2",
"monaco-editor-webpack-plugin": "^7.1.0",
"postcss": "^8.4.31",
"tailwindcss": "^3.2.4",
"wait-on": "^7.2.0"
+ },
+ "resolutions": {
+ "@types/react": "19.2",
+ "@types/react-dom": "19.2"
}
}
diff --git a/compiler/apps/playground/playwright.config.js b/compiler/apps/playground/playwright.config.js
index 2ef29293d412..10de19457ff0 100644
--- a/compiler/apps/playground/playwright.config.js
+++ b/compiler/apps/playground/playwright.config.js
@@ -55,12 +55,16 @@ export default defineConfig({
// contextOptions: {
// ignoreHTTPSErrors: true,
// },
+ viewport: {width: 1920, height: 1080},
},
projects: [
{
name: 'chromium',
- use: {...devices['Desktop Chrome']},
+ use: {
+ ...devices['Desktop Chrome'],
+ viewport: {width: 1920, height: 1080},
+ },
},
// {
// name: 'Desktop Firefox',
diff --git a/compiler/apps/playground/styles/globals.css b/compiler/apps/playground/styles/globals.css
index c4558eb8b8a9..ead5d83a65d9 100644
--- a/compiler/apps/playground/styles/globals.css
+++ b/compiler/apps/playground/styles/globals.css
@@ -69,3 +69,75 @@
scrollbar-width: none; /* Firefox */
}
}
+
+::view-transition-old(.slide-in) {
+ animation-name: slideOutLeft;
+}
+::view-transition-new(.slide-in) {
+ animation-name: slideInLeft;
+}
+::view-transition-group(.slide-in) {
+ z-index: 1;
+}
+::view-transition-old(.slide-out) {
+ animation-name: slideOutLeft;
+}
+::view-transition-new(.slide-out) {
+ animation-name: slideInLeft;
+}
+::view-transition-group(.slide-out) {
+ z-index: 1;
+}
+
+@keyframes slideOutLeft {
+ from {
+ transform: translateX(0);
+ }
+ to {
+ transform: translateX(-100%);
+ }
+}
+@keyframes slideInLeft {
+ from {
+ transform: translateX(-100%);
+ }
+ to {
+ transform: translateX(0);
+ }
+}
+
+::view-transition-old(.container),
+::view-transition-new(.container) {
+ height: 100%;
+}
+
+::view-transition-old(.accordion-container),
+::view-transition-new(.accordion-container) {
+ height: 100%;
+ object-fit: none;
+ object-position: left;
+}
+
+::view-transition-old(.tab-highlight),
+::view-transition-new(.tab-highlight) {
+ height: 100%;
+}
+::view-transition-group(.tab-text) {
+ z-index: 1;
+}
+
+::view-transition-old(.expand-accordion),
+::view-transition-new(.expand-accordion) {
+ width: auto;
+}
+::view-transition-group(.expand-accordion) {
+ overflow: clip;
+}
+
+/**
+ * For some reason, the original Monaco editor is still visible to the
+ * left of the DiffEditor. This is a workaround for better visual clarity.
+ */
+.monaco-diff-editor .editor.original{
+ visibility: hidden !important;
+}
diff --git a/compiler/apps/playground/tsconfig.json b/compiler/apps/playground/tsconfig.json
index eb7fcfe2b722..1ead55cc96e7 100644
--- a/compiler/apps/playground/tsconfig.json
+++ b/compiler/apps/playground/tsconfig.json
@@ -6,6 +6,9 @@
"dom.iterable",
"esnext"
],
+ "types": [
+ "react/experimental"
+ ],
"allowJs": true,
"skipLibCheck": true,
"strict": true,
diff --git a/compiler/apps/playground/yarn.lock b/compiler/apps/playground/yarn.lock
index f40fffe67551..be63ac56b61c 100644
--- a/compiler/apps/playground/yarn.lock
+++ b/compiler/apps/playground/yarn.lock
@@ -445,10 +445,10 @@
"@babel/helper-string-parser" "^7.25.9"
"@babel/helper-validator-identifier" "^7.25.9"
-"@emnapi/runtime@^1.2.0":
- version "1.3.1"
- resolved "https://registry.yarnpkg.com/@emnapi/runtime/-/runtime-1.3.1.tgz#0fcaa575afc31f455fd33534c19381cfce6c6f60"
- integrity sha512-kEBmG8KyqtxJZv+ygbEim+KCGtIq1fC22Ms3S4ziXmYKm8uyoLX0MHONVKwp+9opg390VaKRNt4a7A9NwmpNhw==
+"@emnapi/runtime@^1.4.4":
+ version "1.5.0"
+ resolved "https://registry.yarnpkg.com/@emnapi/runtime/-/runtime-1.5.0.tgz#9aebfcb9b17195dce3ab53c86787a6b7d058db73"
+ integrity sha512-97/BJ3iXHww3djw6hYIfErCZFee7qCtrneuLa20UXFCOTCfBM2cvQHjWJ2EG0s0MtdNwInarqCTz35i4wWXHsQ==
dependencies:
tslib "^2.4.0"
@@ -520,118 +520,135 @@
resolved "https://registry.yarnpkg.com/@humanwhocodes/object-schema/-/object-schema-2.0.3.tgz#4a2868d75d6d6963e423bcf90b7fd1be343409d3"
integrity sha512-93zYdMES/c1D69yZiKDBj0V24vqNzB/koF26KPaagAfd3P/4gUlh3Dys5ogAK+Exi9QyzlD8x/08Zt7wIKcDcA==
-"@img/sharp-darwin-arm64@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-darwin-arm64/-/sharp-darwin-arm64-0.33.5.tgz#ef5b5a07862805f1e8145a377c8ba6e98813ca08"
- integrity sha512-UT4p+iz/2H4twwAoLCqfA9UH5pI6DggwKEGuaPy7nCVQ8ZsiY5PIcrRvD1DzuY3qYL07NtIQcWnBSY/heikIFQ==
+"@img/sharp-darwin-arm64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-darwin-arm64/-/sharp-darwin-arm64-0.34.3.tgz#4850c8ace3c1dc13607fa07d43377b1f9aa774da"
+ integrity sha512-ryFMfvxxpQRsgZJqBd4wsttYQbCxsJksrv9Lw/v798JcQ8+w84mBWuXwl+TT0WJ/WrYOLaYpwQXi3sA9nTIaIg==
optionalDependencies:
- "@img/sharp-libvips-darwin-arm64" "1.0.4"
+ "@img/sharp-libvips-darwin-arm64" "1.2.0"
-"@img/sharp-darwin-x64@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-darwin-x64/-/sharp-darwin-x64-0.33.5.tgz#e03d3451cd9e664faa72948cc70a403ea4063d61"
- integrity sha512-fyHac4jIc1ANYGRDxtiqelIbdWkIuQaI84Mv45KvGRRxSAa7o7d1ZKAOBaYbnepLC1WqxfpimdeWfvqqSGwR2Q==
+"@img/sharp-darwin-x64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-darwin-x64/-/sharp-darwin-x64-0.34.3.tgz#edf93fb01479604f14ad6a64a716e2ef2bb23100"
+ integrity sha512-yHpJYynROAj12TA6qil58hmPmAwxKKC7reUqtGLzsOHfP7/rniNGTL8tjWX6L3CTV4+5P4ypcS7Pp+7OB+8ihA==
optionalDependencies:
- "@img/sharp-libvips-darwin-x64" "1.0.4"
+ "@img/sharp-libvips-darwin-x64" "1.2.0"
-"@img/sharp-libvips-darwin-arm64@1.0.4":
- version "1.0.4"
- resolved "https://registry.yarnpkg.com/@img/sharp-libvips-darwin-arm64/-/sharp-libvips-darwin-arm64-1.0.4.tgz#447c5026700c01a993c7804eb8af5f6e9868c07f"
- integrity sha512-XblONe153h0O2zuFfTAbQYAX2JhYmDHeWikp1LM9Hul9gVPjFY427k6dFEcOL72O01QxQsWi761svJ/ev9xEDg==
+"@img/sharp-libvips-darwin-arm64@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-darwin-arm64/-/sharp-libvips-darwin-arm64-1.2.0.tgz#e20e9041031acde1de19da121dc5162c7d2cf251"
+ integrity sha512-sBZmpwmxqwlqG9ueWFXtockhsxefaV6O84BMOrhtg/YqbTaRdqDE7hxraVE3y6gVM4eExmfzW4a8el9ArLeEiQ==
-"@img/sharp-libvips-darwin-x64@1.0.4":
- version "1.0.4"
- resolved "https://registry.yarnpkg.com/@img/sharp-libvips-darwin-x64/-/sharp-libvips-darwin-x64-1.0.4.tgz#e0456f8f7c623f9dbfbdc77383caa72281d86062"
- integrity sha512-xnGR8YuZYfJGmWPvmlunFaWJsb9T/AO2ykoP3Fz/0X5XV2aoYBPkX6xqCQvUTKKiLddarLaxpzNe+b1hjeWHAQ==
+"@img/sharp-libvips-darwin-x64@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-darwin-x64/-/sharp-libvips-darwin-x64-1.2.0.tgz#918ca81c5446f31114834cb908425a7532393185"
+ integrity sha512-M64XVuL94OgiNHa5/m2YvEQI5q2cl9d/wk0qFTDVXcYzi43lxuiFTftMR1tOnFQovVXNZJ5TURSDK2pNe9Yzqg==
-"@img/sharp-libvips-linux-arm64@1.0.4":
- version "1.0.4"
- resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-arm64/-/sharp-libvips-linux-arm64-1.0.4.tgz#979b1c66c9a91f7ff2893556ef267f90ebe51704"
- integrity sha512-9B+taZ8DlyyqzZQnoeIvDVR/2F4EbMepXMc/NdVbkzsJbzkUjhXv/70GQJ7tdLA4YJgNP25zukcxpX2/SueNrA==
+"@img/sharp-libvips-linux-arm64@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-arm64/-/sharp-libvips-linux-arm64-1.2.0.tgz#1a5beafc857b43f378c3030427aa981ee3edbc54"
+ integrity sha512-RXwd0CgG+uPRX5YYrkzKyalt2OJYRiJQ8ED/fi1tq9WQW2jsQIn0tqrlR5l5dr/rjqq6AHAxURhj2DVjyQWSOA==
-"@img/sharp-libvips-linux-arm@1.0.5":
- version "1.0.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-arm/-/sharp-libvips-linux-arm-1.0.5.tgz#99f922d4e15216ec205dcb6891b721bfd2884197"
- integrity sha512-gvcC4ACAOPRNATg/ov8/MnbxFDJqf/pDePbBnuBDcjsI8PssmjoKMAz4LtLaVi+OnSb5FK/yIOamqDwGmXW32g==
+"@img/sharp-libvips-linux-arm@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-arm/-/sharp-libvips-linux-arm-1.2.0.tgz#bff51182d5238ca35c5fe9e9f594a18ad6a5480d"
+ integrity sha512-mWd2uWvDtL/nvIzThLq3fr2nnGfyr/XMXlq8ZJ9WMR6PXijHlC3ksp0IpuhK6bougvQrchUAfzRLnbsen0Cqvw==
-"@img/sharp-libvips-linux-s390x@1.0.4":
- version "1.0.4"
- resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-s390x/-/sharp-libvips-linux-s390x-1.0.4.tgz#f8a5eb1f374a082f72b3f45e2fb25b8118a8a5ce"
- integrity sha512-u7Wz6ntiSSgGSGcjZ55im6uvTrOxSIS8/dgoVMoiGE9I6JAfU50yH5BoDlYA1tcuGS7g/QNtetJnxA6QEsCVTA==
+"@img/sharp-libvips-linux-ppc64@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-ppc64/-/sharp-libvips-linux-ppc64-1.2.0.tgz#10c53ccf6f2d47d71fb3fa282697072c8fe9e40e"
+ integrity sha512-Xod/7KaDDHkYu2phxxfeEPXfVXFKx70EAFZ0qyUdOjCcxbjqyJOEUpDe6RIyaunGxT34Anf9ue/wuWOqBW2WcQ==
-"@img/sharp-libvips-linux-x64@1.0.4":
- version "1.0.4"
- resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-x64/-/sharp-libvips-linux-x64-1.0.4.tgz#d4c4619cdd157774906e15770ee119931c7ef5e0"
- integrity sha512-MmWmQ3iPFZr0Iev+BAgVMb3ZyC4KeFc3jFxnNbEPas60e1cIfevbtuyf9nDGIzOaW9PdnDciJm+wFFaTlj5xYw==
+"@img/sharp-libvips-linux-s390x@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-s390x/-/sharp-libvips-linux-s390x-1.2.0.tgz#392fd7557ddc5c901f1bed7ab3c567c08833ef3b"
+ integrity sha512-eMKfzDxLGT8mnmPJTNMcjfO33fLiTDsrMlUVcp6b96ETbnJmd4uvZxVJSKPQfS+odwfVaGifhsB07J1LynFehw==
-"@img/sharp-libvips-linuxmusl-arm64@1.0.4":
- version "1.0.4"
- resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linuxmusl-arm64/-/sharp-libvips-linuxmusl-arm64-1.0.4.tgz#166778da0f48dd2bded1fa3033cee6b588f0d5d5"
- integrity sha512-9Ti+BbTYDcsbp4wfYib8Ctm1ilkugkA/uscUn6UXK1ldpC1JjiXbLfFZtRlBhjPZ5o1NCLiDbg8fhUPKStHoTA==
+"@img/sharp-libvips-linux-x64@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linux-x64/-/sharp-libvips-linux-x64-1.2.0.tgz#9315cf90a2fdcdc0e29ea7663cbd8b0f15254400"
+ integrity sha512-ZW3FPWIc7K1sH9E3nxIGB3y3dZkpJlMnkk7z5tu1nSkBoCgw2nSRTFHI5pB/3CQaJM0pdzMF3paf9ckKMSE9Tg==
-"@img/sharp-libvips-linuxmusl-x64@1.0.4":
- version "1.0.4"
- resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linuxmusl-x64/-/sharp-libvips-linuxmusl-x64-1.0.4.tgz#93794e4d7720b077fcad3e02982f2f1c246751ff"
- integrity sha512-viYN1KX9m+/hGkJtvYYp+CCLgnJXwiQB39damAO7WMdKWlIhmYTfHjwSbQeUK/20vY154mwezd9HflVFM1wVSw==
+"@img/sharp-libvips-linuxmusl-arm64@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linuxmusl-arm64/-/sharp-libvips-linuxmusl-arm64-1.2.0.tgz#705e03e67d477f6f842f37eb7f66285b1150dc06"
+ integrity sha512-UG+LqQJbf5VJ8NWJ5Z3tdIe/HXjuIdo4JeVNADXBFuG7z9zjoegpzzGIyV5zQKi4zaJjnAd2+g2nna8TZvuW9Q==
+
+"@img/sharp-libvips-linuxmusl-x64@1.2.0":
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/@img/sharp-libvips-linuxmusl-x64/-/sharp-libvips-linuxmusl-x64-1.2.0.tgz#ec905071cc538df64848d5900e0d386d77c55f13"
+ integrity sha512-SRYOLR7CXPgNze8akZwjoGBoN1ThNZoqpOgfnOxmWsklTGVfJiGJoC/Lod7aNMGA1jSsKWM1+HRX43OP6p9+6Q==
+
+"@img/sharp-linux-arm64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-linux-arm64/-/sharp-linux-arm64-0.34.3.tgz#476f8f13ce192555391ae9d4bc658637a6acf3e5"
+ integrity sha512-QdrKe3EvQrqwkDrtuTIjI0bu6YEJHTgEeqdzI3uWJOH6G1O8Nl1iEeVYRGdj1h5I21CqxSvQp1Yv7xeU3ZewbA==
+ optionalDependencies:
+ "@img/sharp-libvips-linux-arm64" "1.2.0"
-"@img/sharp-linux-arm64@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-linux-arm64/-/sharp-linux-arm64-0.33.5.tgz#edb0697e7a8279c9fc829a60fc35644c4839bb22"
- integrity sha512-JMVv+AMRyGOHtO1RFBiJy/MBsgz0x4AWrT6QoEVVTyh1E39TrCUpTRI7mx9VksGX4awWASxqCYLCV4wBZHAYxA==
+"@img/sharp-linux-arm@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-linux-arm/-/sharp-linux-arm-0.34.3.tgz#9898cd68ea3e3806b94fe25736d5d7ecb5eac121"
+ integrity sha512-oBK9l+h6KBN0i3dC8rYntLiVfW8D8wH+NPNT3O/WBHeW0OQWCjfWksLUaPidsrDKpJgXp3G3/hkmhptAW0I3+A==
optionalDependencies:
- "@img/sharp-libvips-linux-arm64" "1.0.4"
+ "@img/sharp-libvips-linux-arm" "1.2.0"
-"@img/sharp-linux-arm@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-linux-arm/-/sharp-linux-arm-0.33.5.tgz#422c1a352e7b5832842577dc51602bcd5b6f5eff"
- integrity sha512-JTS1eldqZbJxjvKaAkxhZmBqPRGmxgu+qFKSInv8moZ2AmT5Yib3EQ1c6gp493HvrvV8QgdOXdyaIBrhvFhBMQ==
+"@img/sharp-linux-ppc64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-linux-ppc64/-/sharp-linux-ppc64-0.34.3.tgz#6a7cd4c608011333a0ddde6d96e03ac042dd9079"
+ integrity sha512-GLtbLQMCNC5nxuImPR2+RgrviwKwVql28FWZIW1zWruy6zLgA5/x2ZXk3mxj58X/tszVF69KK0Is83V8YgWhLA==
optionalDependencies:
- "@img/sharp-libvips-linux-arm" "1.0.5"
+ "@img/sharp-libvips-linux-ppc64" "1.2.0"
-"@img/sharp-linux-s390x@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-linux-s390x/-/sharp-linux-s390x-0.33.5.tgz#f5c077926b48e97e4a04d004dfaf175972059667"
- integrity sha512-y/5PCd+mP4CA/sPDKl2961b+C9d+vPAveS33s6Z3zfASk2j5upL6fXVPZi7ztePZ5CuH+1kW8JtvxgbuXHRa4Q==
+"@img/sharp-linux-s390x@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-linux-s390x/-/sharp-linux-s390x-0.34.3.tgz#48e27ab969efe97d270e39297654c0e0c9b42919"
+ integrity sha512-3gahT+A6c4cdc2edhsLHmIOXMb17ltffJlxR0aC2VPZfwKoTGZec6u5GrFgdR7ciJSsHT27BD3TIuGcuRT0KmQ==
optionalDependencies:
- "@img/sharp-libvips-linux-s390x" "1.0.4"
+ "@img/sharp-libvips-linux-s390x" "1.2.0"
-"@img/sharp-linux-x64@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-linux-x64/-/sharp-linux-x64-0.33.5.tgz#d806e0afd71ae6775cc87f0da8f2d03a7c2209cb"
- integrity sha512-opC+Ok5pRNAzuvq1AG0ar+1owsu842/Ab+4qvU879ippJBHvyY5n2mxF1izXqkPYlGuP/M556uh53jRLJmzTWA==
+"@img/sharp-linux-x64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-linux-x64/-/sharp-linux-x64-0.34.3.tgz#5aa77ad4aa447ddf6d642e2a2c5599eb1292dfaa"
+ integrity sha512-8kYso8d806ypnSq3/Ly0QEw90V5ZoHh10yH0HnrzOCr6DKAPI6QVHvwleqMkVQ0m+fc7EH8ah0BB0QPuWY6zJQ==
optionalDependencies:
- "@img/sharp-libvips-linux-x64" "1.0.4"
+ "@img/sharp-libvips-linux-x64" "1.2.0"
-"@img/sharp-linuxmusl-arm64@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-linuxmusl-arm64/-/sharp-linuxmusl-arm64-0.33.5.tgz#252975b915894fb315af5deea174651e208d3d6b"
- integrity sha512-XrHMZwGQGvJg2V/oRSUfSAfjfPxO+4DkiRh6p2AFjLQztWUuY/o8Mq0eMQVIY7HJ1CDQUJlxGGZRw1a5bqmd1g==
+"@img/sharp-linuxmusl-arm64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-linuxmusl-arm64/-/sharp-linuxmusl-arm64-0.34.3.tgz#62053a9d77c7d4632c677619325b741254689dd7"
+ integrity sha512-vAjbHDlr4izEiXM1OTggpCcPg9tn4YriK5vAjowJsHwdBIdx0fYRsURkxLG2RLm9gyBq66gwtWI8Gx0/ov+JKQ==
optionalDependencies:
- "@img/sharp-libvips-linuxmusl-arm64" "1.0.4"
+ "@img/sharp-libvips-linuxmusl-arm64" "1.2.0"
-"@img/sharp-linuxmusl-x64@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-linuxmusl-x64/-/sharp-linuxmusl-x64-0.33.5.tgz#3f4609ac5d8ef8ec7dadee80b560961a60fd4f48"
- integrity sha512-WT+d/cgqKkkKySYmqoZ8y3pxx7lx9vVejxW/W4DOFMYVSkErR+w7mf2u8m/y4+xHe7yY9DAXQMWQhpnMuFfScw==
+"@img/sharp-linuxmusl-x64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-linuxmusl-x64/-/sharp-linuxmusl-x64-0.34.3.tgz#5107c7709c7e0a44fe5abef59829f1de86fa0a3a"
+ integrity sha512-gCWUn9547K5bwvOn9l5XGAEjVTTRji4aPTqLzGXHvIr6bIDZKNTA34seMPgM0WmSf+RYBH411VavCejp3PkOeQ==
optionalDependencies:
- "@img/sharp-libvips-linuxmusl-x64" "1.0.4"
+ "@img/sharp-libvips-linuxmusl-x64" "1.2.0"
-"@img/sharp-wasm32@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-wasm32/-/sharp-wasm32-0.33.5.tgz#6f44f3283069d935bb5ca5813153572f3e6f61a1"
- integrity sha512-ykUW4LVGaMcU9lu9thv85CbRMAwfeadCJHRsg2GmeRa/cJxsVY9Rbd57JcMxBkKHag5U/x7TSBpScF4U8ElVzg==
+"@img/sharp-wasm32@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-wasm32/-/sharp-wasm32-0.34.3.tgz#c1dcabb834ec2f71308a810b399bb6e6e3b79619"
+ integrity sha512-+CyRcpagHMGteySaWos8IbnXcHgfDn7pO2fiC2slJxvNq9gDipYBN42/RagzctVRKgxATmfqOSulgZv5e1RdMg==
dependencies:
- "@emnapi/runtime" "^1.2.0"
+ "@emnapi/runtime" "^1.4.4"
-"@img/sharp-win32-ia32@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-win32-ia32/-/sharp-win32-ia32-0.33.5.tgz#1a0c839a40c5351e9885628c85f2e5dfd02b52a9"
- integrity sha512-T36PblLaTwuVJ/zw/LaH0PdZkRz5rd3SmMHX8GSmR7vtNSP5Z6bQkExdSK7xGWyxLw4sUknBuugTelgw2faBbQ==
+"@img/sharp-win32-arm64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-win32-arm64/-/sharp-win32-arm64-0.34.3.tgz#3e8654e368bb349d45799a0d7aeb29db2298628e"
+ integrity sha512-MjnHPnbqMXNC2UgeLJtX4XqoVHHlZNd+nPt1kRPmj63wURegwBhZlApELdtxM2OIZDRv/DFtLcNhVbd1z8GYXQ==
-"@img/sharp-win32-x64@0.33.5":
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/@img/sharp-win32-x64/-/sharp-win32-x64-0.33.5.tgz#56f00962ff0c4e0eb93d34a047d29fa995e3e342"
- integrity sha512-MpY/o8/8kj+EcnxwvrP4aTJSWw/aZ7JIGR4aBeZkZw5B7/Jn+tY9/VNwtcoGmdT7GfggGIU4kygOMSbYnOrAbg==
+"@img/sharp-win32-ia32@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-win32-ia32/-/sharp-win32-ia32-0.34.3.tgz#9d4c105e8d5074a351a81a0b6d056e0af913bf76"
+ integrity sha512-xuCdhH44WxuXgOM714hn4amodJMZl3OEvf0GVTm0BEyMeA2to+8HEdRPShH0SLYptJY1uBw+SCFP9WVQi1Q/cw==
+
+"@img/sharp-win32-x64@0.34.3":
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/@img/sharp-win32-x64/-/sharp-win32-x64-0.34.3.tgz#d20c89bd41b1dd3d76d8575714aaaa3c43204b6a"
+ integrity sha512-OWwz05d++TxzLEv4VnsTz5CmZ6mI6S05sfQGEMrNrQcOEERbX46332IvE7pO/EUiw7jUrrS40z/M7kPyjfl04g==
"@isaacs/cliui@^8.0.2":
version "8.0.2"
@@ -684,71 +701,71 @@
"@jridgewell/resolve-uri" "^3.1.0"
"@jridgewell/sourcemap-codec" "^1.4.14"
-"@monaco-editor/loader@^1.4.0":
- version "1.4.0"
- resolved "https://registry.yarnpkg.com/@monaco-editor/loader/-/loader-1.4.0.tgz#f08227057331ec890fa1e903912a5b711a2ad558"
- integrity sha512-00ioBig0x642hytVspPl7DbQyaSWRaolYie/UFNjoTdvoKPzo6xrXLhTk9ixgIKcLH5b5vDOjVNiGyY+uDCUlg==
+"@monaco-editor/loader@^1.6.1":
+ version "1.6.1"
+ resolved "https://registry.npmjs.org/@monaco-editor/loader/-/loader-1.6.1.tgz#c99177d87765abf10de31a0086084e714acfbc0f"
+ integrity sha512-w3tEnj9HYEC73wtjdpR089AqkUPskFRcdkxsiSFt3SoUc3OHpmu+leP94CXBm4mHfefmhsdfI0ZQu6qJ0wgtPg==
dependencies:
state-local "^1.0.6"
-"@monaco-editor/react@^4.4.6":
- version "4.6.0"
- resolved "https://registry.yarnpkg.com/@monaco-editor/react/-/react-4.6.0.tgz#bcc68671e358a21c3814566b865a54b191e24119"
- integrity sha512-RFkU9/i7cN2bsq/iTkurMWOEErmYcY6JiQI3Jn+WeR/FGISH8JbHERjpS9oRuSOPvDMJI0Z8nJeKkbOs9sBYQw==
+"@monaco-editor/react@^4.8.0-rc.2":
+ version "4.8.0-rc.2"
+ resolved "https://registry.npmjs.org/@monaco-editor/react/-/react-4.8.0-rc.2.tgz#e9acf652e23e9f640671a69875f496dde7f098aa"
+ integrity sha512-RzFHKBCnRA4RnozaG/EPhKsbkhX5wcApSa5MElR/AD2ojxhMY+QP+G8aJpxALCnIwKs6L0dec5MJ0nAjMUEqnA==
dependencies:
- "@monaco-editor/loader" "^1.4.0"
+ "@monaco-editor/loader" "^1.6.1"
-"@next/env@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/env/-/env-15.2.0-canary.66.tgz#c4ca0d502ad099c68927643df9c9b5d75c7b7fbb"
- integrity sha512-/RxW1GJ7a6MJOQ7LOa2bcli7VTjqB7jPyzXwNJQflcYJH4gz1kP6uzg8+IptLJGFSRB58RBKHJk+q1cD8jongA==
+"@next/env@15.5.9":
+ version "15.5.9"
+ resolved "https://registry.yarnpkg.com/@next/env/-/env-15.5.9.tgz#53c2c34dc17cd87b61f70c6cc211e303123b2ab8"
+ integrity sha512-4GlTZ+EJM7WaW2HEZcyU317tIQDjkQIyENDLxYJfSWlfqguN+dHkZgyQTV/7ykvobU7yEH5gKvreNrH4B6QgIg==
-"@next/eslint-plugin-next@15.0.1":
- version "15.0.1"
- resolved "https://registry.yarnpkg.com/@next/eslint-plugin-next/-/eslint-plugin-next-15.0.1.tgz#76117d88aadc52f6e04b1892d44654d05468d53c"
- integrity sha512-bKWsMaGPbiFAaGqrDJvbE8b4Z0uKicGVcgOI77YM2ui3UfjHMr4emFPrZTLeZVchi7fT1mooG2LxREfUUClIKw==
+"@next/eslint-plugin-next@15.5.2":
+ version "15.5.2"
+ resolved "https://registry.yarnpkg.com/@next/eslint-plugin-next/-/eslint-plugin-next-15.5.2.tgz#6fa6b78687dbbb6f5726acd81bcdfd87dc26b6f3"
+ integrity sha512-lkLrRVxcftuOsJNhWatf1P2hNVfh98k/omQHrCEPPriUypR6RcS13IvLdIrEvkm9AH2Nu2YpR5vLqBuy6twH3Q==
dependencies:
fast-glob "3.3.1"
-"@next/swc-darwin-arm64@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/swc-darwin-arm64/-/swc-darwin-arm64-15.2.0-canary.66.tgz#368438cf713c439b5b4c44d54b5c3b31ee5b772d"
- integrity sha512-sVzNJWTekcLOdqkDMistBGr84AVh9eSu4o5JQNEOdxHry4jiF8lqixpOg0+Twj2RRuv4bx32h5xaRVvCSUpITQ==
-
-"@next/swc-darwin-x64@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/swc-darwin-x64/-/swc-darwin-x64-15.2.0-canary.66.tgz#3ddc3f4f6e86e204727770e5984cabf52f852472"
- integrity sha512-Avv6Nf/0j0WVqY72Q0mK2glGhvN7LT7iVF31iBYUe/Cbf2cXBjgpXUVmksJjg+2Fi6uTEpaMoZWSVEpJyPkjVQ==
-
-"@next/swc-linux-arm64-gnu@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/swc-linux-arm64-gnu/-/swc-linux-arm64-gnu-15.2.0-canary.66.tgz#cd3683bf569c66444340b1e4d876913584e93aea"
- integrity sha512-kUPejaStjKpF79fz4525DKQKADtUuE+T6j7IvLQsZuWrSX3a5Mix+i52fdTzMJ+sFGg3v147wopZt6L6JMIxxA==
-
-"@next/swc-linux-arm64-musl@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/swc-linux-arm64-musl/-/swc-linux-arm64-musl-15.2.0-canary.66.tgz#453836b11efdb50b91cf8a6cfbce8779f6778dd9"
- integrity sha512-U8l8jaZ+BAU5wn3bw7PRqq4vGTpObBt+7JbJLpbDqB1GfkZdCDc4nGtqAfLy3pY0O4lEfqal9jrsEVtUBCbfHg==
-
-"@next/swc-linux-x64-gnu@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/swc-linux-x64-gnu/-/swc-linux-x64-gnu-15.2.0-canary.66.tgz#f02b295febaacf8d041f9f149c30c41aea16a81f"
- integrity sha512-c+AV8ZN1znGBHu5BACGym+9FhV8+213XVHFI7i2J7TSsJ6T+Eofhwn0tSn1Vy/XpVmpyoEdkwepL+djbdQAGhw==
-
-"@next/swc-linux-x64-musl@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/swc-linux-x64-musl/-/swc-linux-x64-musl-15.2.0-canary.66.tgz#f942c000ba3ffc0289520d25fa1067a75e72fa41"
- integrity sha512-4mTIv86qyXuo8NfjigSQ7rk2cDwM8/f8R/kf3hNh8NF1Aaat2RrEet9a/SbsuNpdhhNnPI5RcRwpIJx2JQSPcQ==
-
-"@next/swc-win32-arm64-msvc@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/swc-win32-arm64-msvc/-/swc-win32-arm64-msvc-15.2.0-canary.66.tgz#0ffdcf5c74b5aa6214307f2ae4aa84f1526e6bf9"
- integrity sha512-NPnfsDQXk44h8VtncWq2AgLjHDbUMsc8Tpz7pcLe9qb8lZSxZ9jYbV7NwKzgd+qJbjy/58vgCWhL5PhyXDlWwQ==
-
-"@next/swc-win32-x64-msvc@15.2.0-canary.66":
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/@next/swc-win32-x64-msvc/-/swc-win32-x64-msvc-15.2.0-canary.66.tgz#458245850cf407d2551155e4662785c109f58bda"
- integrity sha512-L/ef++GJqW+T3g2x6mrZ2vrBK+6QS9Ieam8EqK9dG7cFKv7Gqm9yrHvDuVse62hnNB11ZdxfDDKrs9vabuQLlw==
+"@next/swc-darwin-arm64@15.5.7":
+ version "15.5.7"
+ resolved "https://registry.yarnpkg.com/@next/swc-darwin-arm64/-/swc-darwin-arm64-15.5.7.tgz#f0c9ccfec2cd87cbd4b241ce4c779a7017aed958"
+ integrity sha512-IZwtxCEpI91HVU/rAUOOobWSZv4P2DeTtNaCdHqLcTJU4wdNXgAySvKa/qJCgR5m6KI8UsKDXtO2B31jcaw1Yw==
+
+"@next/swc-darwin-x64@15.5.7":
+ version "15.5.7"
+ resolved "https://registry.yarnpkg.com/@next/swc-darwin-x64/-/swc-darwin-x64-15.5.7.tgz#18009e9fcffc5c0687cc9db24182ddeac56280d9"
+ integrity sha512-UP6CaDBcqaCBuiq/gfCEJw7sPEoX1aIjZHnBWN9v9qYHQdMKvCKcAVs4OX1vIjeE+tC5EIuwDTVIoXpUes29lg==
+
+"@next/swc-linux-arm64-gnu@15.5.7":
+ version "15.5.7"
+ resolved "https://registry.yarnpkg.com/@next/swc-linux-arm64-gnu/-/swc-linux-arm64-gnu-15.5.7.tgz#fe7c7e08264cf522d4e524299f6d3e63d68d579a"
+ integrity sha512-NCslw3GrNIw7OgmRBxHtdWFQYhexoUCq+0oS2ccjyYLtcn1SzGzeM54jpTFonIMUjNbHmpKpziXnpxhSWLcmBA==
+
+"@next/swc-linux-arm64-musl@15.5.7":
+ version "15.5.7"
+ resolved "https://registry.yarnpkg.com/@next/swc-linux-arm64-musl/-/swc-linux-arm64-musl-15.5.7.tgz#94228fe293475ec34a5a54284e1056876f43a3cf"
+ integrity sha512-nfymt+SE5cvtTrG9u1wdoxBr9bVB7mtKTcj0ltRn6gkP/2Nu1zM5ei8rwP9qKQP0Y//umK+TtkKgNtfboBxRrw==
+
+"@next/swc-linux-x64-gnu@15.5.7":
+ version "15.5.7"
+ resolved "https://registry.yarnpkg.com/@next/swc-linux-x64-gnu/-/swc-linux-x64-gnu-15.5.7.tgz#078c71201dfe7fcfb8fa6dc92aae6c94bc011cdc"
+ integrity sha512-hvXcZvCaaEbCZcVzcY7E1uXN9xWZfFvkNHwbe/n4OkRhFWrs1J1QV+4U1BN06tXLdaS4DazEGXwgqnu/VMcmqw==
+
+"@next/swc-linux-x64-musl@15.5.7":
+ version "15.5.7"
+ resolved "https://registry.yarnpkg.com/@next/swc-linux-x64-musl/-/swc-linux-x64-musl-15.5.7.tgz#72947f5357f9226292353e0bb775643da3c7a182"
+ integrity sha512-4IUO539b8FmF0odY6/SqANJdgwn1xs1GkPO5doZugwZ3ETF6JUdckk7RGmsfSf7ws8Qb2YB5It33mvNL/0acqA==
+
+"@next/swc-win32-arm64-msvc@15.5.7":
+ version "15.5.7"
+ resolved "https://registry.yarnpkg.com/@next/swc-win32-arm64-msvc/-/swc-win32-arm64-msvc-15.5.7.tgz#397b912cd51c6a80e32b9c0507ecd82514353941"
+ integrity sha512-CpJVTkYI3ZajQkC5vajM7/ApKJUOlm6uP4BknM3XKvJ7VXAvCqSjSLmM0LKdYzn6nBJVSjdclx8nYJSa3xlTgQ==
+
+"@next/swc-win32-x64-msvc@15.5.7":
+ version "15.5.7"
+ resolved "https://registry.yarnpkg.com/@next/swc-win32-x64-msvc/-/swc-win32-x64-msvc-15.5.7.tgz#e02b543d9dc6c1631d4ac239cb1177245dfedfe4"
+ integrity sha512-gMzgBX164I6DN+9/PGA+9dQiwmTkE4TloBNx8Kv9UiGARsr9Nba7IpcBRA1iTV9vwlYnrE3Uy6I7Aj6qLjQuqw==
"@nodelib/fs.scandir@2.1.5":
version "2.1.5"
@@ -781,12 +798,12 @@
resolved "https://registry.yarnpkg.com/@pkgjs/parseargs/-/parseargs-0.11.0.tgz#a77ea742fab25775145434eb1d2328cf5013ac33"
integrity sha512-+1VkjdD0QBLPodGrJUeqarH8VAIvQODIbwh9XpP5Syisf7YoQgsJKPNFoqqLQlu+VQ/tVSshMR6loPMn8U+dPg==
-"@playwright/test@^1.51.1":
- version "1.51.1"
- resolved "https://registry.yarnpkg.com/@playwright/test/-/test-1.51.1.tgz#75357d513221a7be0baad75f01e966baf9c41a2e"
- integrity sha512-nM+kEaTSAoVlXmMPH10017vn3FSiFqr/bh4fKg9vmAdMfd9SDqRZNvPSiAHADc/itWak+qPvMPZQOPwCBW7k7Q==
+"@playwright/test@^1.56.1":
+ version "1.56.1"
+ resolved "https://registry.yarnpkg.com/@playwright/test/-/test-1.56.1.tgz#6e3bf3d0c90c5cf94bf64bdb56fd15a805c8bd3f"
+ integrity sha512-vSMYtL/zOcFpvJCW71Q/OEGQb7KYBPAdKh35WNSkaZA75JlAO8ED8UN6GUNTm3drWomcbcqRPFqQbLae8yBTdg==
dependencies:
- playwright "1.51.1"
+ playwright "1.56.1"
"@rtsao/scc@^1.1.0":
version "1.1.0"
@@ -820,11 +837,6 @@
resolved "https://registry.yarnpkg.com/@sinclair/typebox/-/typebox-0.27.8.tgz#6667fac16c436b5434a387a34dedb013198f6e6e"
integrity sha512-+Fj43pSMwJs4KRrH/938Uf+uAELIgVBmQzg/q1YG10djyfA3TnrU8N8XzqCh/okZdszqBQTZf96idMfE5lnwTA==
-"@swc/counter@0.1.3":
- version "0.1.3"
- resolved "https://registry.yarnpkg.com/@swc/counter/-/counter-0.1.3.tgz#cc7463bd02949611c6329596fccd2b0ec782b0e9"
- integrity sha512-e2BR4lsJkkRlKZ/qCHPw9ZaSxc0MVUd7gtbtaB7aMvHeJVYe8sOB8DBZkP2DtISHGSku9sCK6T6cnY0CtXrOCQ==
-
"@swc/helpers@0.5.15":
version "0.5.15"
resolved "https://registry.yarnpkg.com/@swc/helpers/-/helpers-0.5.15.tgz#79efab344c5819ecf83a43f3f9f811fc84b516d7"
@@ -842,15 +854,15 @@
resolved "https://registry.yarnpkg.com/@types/node/-/node-18.11.9.tgz#02d013de7058cea16d36168ef2fc653464cfbad4"
integrity sha512-CRpX21/kGdzjOpFsZSkcrXMGIBWMGNIHXXBVFSH+ggkftxg+XYP20TESbh+zFvFj3EQOl5byk0HTRn1IL6hbqg==
-"@types/react-dom@^19.0.0":
- version "19.0.4"
- resolved "https://registry.yarnpkg.com/@types/react-dom/-/react-dom-19.0.4.tgz#bedba97f9346bd4c0fe5d39e689713804ec9ac89"
- integrity sha512-4fSQ8vWFkg+TGhePfUzVmat3eC14TXYSsiiDSLI0dVLsrm9gZFABjPy/Qu6TKgl1tq1Bu1yDsuQgY3A3DOjCcg==
+"@types/react-dom@19.2":
+ version "19.2.2"
+ resolved "https://registry.npmjs.org/@types/react-dom/-/react-dom-19.2.2.tgz#a4cc874797b7ddc9cb180ef0d5dc23f596fc2332"
+ integrity sha512-9KQPoO6mZCi7jcIStSnlOWn2nEF3mNmyr3rIAsGnAbQKYbRLyqmeSc39EVgtxXVia+LMT8j3knZLAZAh+xLmrw==
-"@types/react@^19.0.0":
- version "19.0.10"
- resolved "https://registry.yarnpkg.com/@types/react/-/react-19.0.10.tgz#d0c66dafd862474190fe95ce11a68de69ed2b0eb"
- integrity sha512-JuRQ9KXLEjaUNjTWpzuR231Z2WpIwczOkBEIvbHNCzQefFIT0L8IqE6NV6ULLyC1SI/i234JnDoMkfg+RjQj2g==
+"@types/react@19.2":
+ version "19.2.2"
+ resolved "https://registry.npmjs.org/@types/react/-/react-19.2.2.tgz#ba123a75d4c2a51158697160a4ea2ff70aa6bf36"
+ integrity sha512-6mDvHUFSjyT2B2yeNx2nUgMxh9LtOWvkhIU3uePn2I2oyNymUAX1NIsdgviM4CH+JSrp2D2hsMvJOkxY+0wNRA==
dependencies:
csstype "^3.0.2"
@@ -1044,6 +1056,14 @@ array-buffer-byte-length@^1.0.0, array-buffer-byte-length@^1.0.1:
call-bind "^1.0.5"
is-array-buffer "^3.0.4"
+array-buffer-byte-length@^1.0.2:
+ version "1.0.2"
+ resolved "https://registry.yarnpkg.com/array-buffer-byte-length/-/array-buffer-byte-length-1.0.2.tgz#384d12a37295aec3769ab022ad323a18a51ccf8b"
+ integrity sha512-LHE+8BuR7RYGDKvnrmcuSq3tDcKv9OFEXQt/HpbZhY7V6h0zlUXutnAD82GiFx9rdieCMjkvtcsPqBwgUl1Iiw==
+ dependencies:
+ call-bound "^1.0.3"
+ is-array-buffer "^3.0.5"
+
array-includes@^3.1.6, array-includes@^3.1.8:
version "3.1.8"
resolved "https://registry.yarnpkg.com/array-includes/-/array-includes-3.1.8.tgz#5e370cbe172fdd5dd6530c1d4aadda25281ba97d"
@@ -1100,6 +1120,16 @@ array.prototype.flatmap@^1.3.2:
es-abstract "^1.22.1"
es-shim-unscopables "^1.0.0"
+array.prototype.flatmap@^1.3.3:
+ version "1.3.3"
+ resolved "https://registry.yarnpkg.com/array.prototype.flatmap/-/array.prototype.flatmap-1.3.3.tgz#712cc792ae70370ae40586264629e33aab5dd38b"
+ integrity sha512-Y7Wt51eKJSyi80hFrJCePGGNo5ktJCslFuboqJsbf57CCPcm5zztluPlc4/aD8sWsKvlwatezpV4U1efk8kpjg==
+ dependencies:
+ call-bind "^1.0.8"
+ define-properties "^1.2.1"
+ es-abstract "^1.23.5"
+ es-shim-unscopables "^1.0.2"
+
array.prototype.tosorted@^1.1.4:
version "1.1.4"
resolved "https://registry.yarnpkg.com/array.prototype.tosorted/-/array.prototype.tosorted-1.1.4.tgz#fe954678ff53034e717ea3352a03f0b0b86f7ffc"
@@ -1125,6 +1155,19 @@ arraybuffer.prototype.slice@^1.0.3:
is-array-buffer "^3.0.4"
is-shared-array-buffer "^1.0.2"
+arraybuffer.prototype.slice@^1.0.4:
+ version "1.0.4"
+ resolved "https://registry.yarnpkg.com/arraybuffer.prototype.slice/-/arraybuffer.prototype.slice-1.0.4.tgz#9d760d84dbdd06d0cbf92c8849615a1a7ab3183c"
+ integrity sha512-BNoCY6SXXPQ7gF2opIP4GBE+Xw7U+pHMYKuzjgCN3GwiaIR09UUeKfheyIry77QtrCBlC0KK0q5/TER/tYh3PQ==
+ dependencies:
+ array-buffer-byte-length "^1.0.1"
+ call-bind "^1.0.8"
+ define-properties "^1.2.1"
+ es-abstract "^1.23.5"
+ es-errors "^1.3.0"
+ get-intrinsic "^1.2.6"
+ is-array-buffer "^3.0.4"
+
ast-types-flow@^0.0.8:
version "0.0.8"
resolved "https://registry.yarnpkg.com/ast-types-flow/-/ast-types-flow-0.0.8.tgz#0a85e1c92695769ac13a428bb653e7538bea27d6"
@@ -1220,12 +1263,13 @@ browserslist@^4.23.1, browserslist@^4.23.3:
node-releases "^2.0.18"
update-browserslist-db "^1.1.0"
-busboy@1.6.0:
- version "1.6.0"
- resolved "https://registry.yarnpkg.com/busboy/-/busboy-1.6.0.tgz#966ea36a9502e43cdb9146962523b92f531f6893"
- integrity sha512-8SFQbg/0hQ9xy3UNTB0YEnsNBbWfhf7RtnzpL7TkBiTBRfrQ9Fxcnz7VJsleJpyp6rVLvXiuORqjlHi5q+PYuA==
+call-bind-apply-helpers@^1.0.0, call-bind-apply-helpers@^1.0.1, call-bind-apply-helpers@^1.0.2:
+ version "1.0.2"
+ resolved "https://registry.yarnpkg.com/call-bind-apply-helpers/-/call-bind-apply-helpers-1.0.2.tgz#4b5428c222be985d79c3d82657479dbe0b59b2d6"
+ integrity sha512-Sp1ablJ0ivDkSzjcaJdxEunN5/XvksFJ2sMBFfq6x0ryhQV/2b/KwFe21cMpmHtPOSij8K99/wSfoEuTObmuMQ==
dependencies:
- streamsearch "^1.1.0"
+ es-errors "^1.3.0"
+ function-bind "^1.1.2"
call-bind@^1.0.2, call-bind@^1.0.5, call-bind@^1.0.6, call-bind@^1.0.7:
version "1.0.7"
@@ -1238,6 +1282,24 @@ call-bind@^1.0.2, call-bind@^1.0.5, call-bind@^1.0.6, call-bind@^1.0.7:
get-intrinsic "^1.2.4"
set-function-length "^1.2.1"
+call-bind@^1.0.8:
+ version "1.0.8"
+ resolved "https://registry.yarnpkg.com/call-bind/-/call-bind-1.0.8.tgz#0736a9660f537e3388826f440d5ec45f744eaa4c"
+ integrity sha512-oKlSFMcMwpUg2ednkhQ454wfWiU/ul3CkJe/PEHcTKuiX6RpbehUiFMXu13HalGZxfUwCQzZG747YXBn1im9ww==
+ dependencies:
+ call-bind-apply-helpers "^1.0.0"
+ es-define-property "^1.0.0"
+ get-intrinsic "^1.2.4"
+ set-function-length "^1.2.2"
+
+call-bound@^1.0.2, call-bound@^1.0.3, call-bound@^1.0.4:
+ version "1.0.4"
+ resolved "https://registry.yarnpkg.com/call-bound/-/call-bound-1.0.4.tgz#238de935d2a2a692928c538c7ccfa91067fd062a"
+ integrity sha512-+ys997U96po4Kx/ABpBCqhA9EuxJaQWDQg7295H4hBphv3IZg0boBKuwYpt4YXp6MZ5AmZQnU/tyMTlRpaSejg==
+ dependencies:
+ call-bind-apply-helpers "^1.0.2"
+ get-intrinsic "^1.3.0"
+
callsites@^3.0.0:
version "3.1.0"
resolved "https://registry.yarnpkg.com/callsites/-/callsites-3.1.0.tgz#b3630abd8943432f54b3f0519238e33cd7df2f73"
@@ -1248,12 +1310,7 @@ camelcase-css@^2.0.1:
resolved "https://registry.yarnpkg.com/camelcase-css/-/camelcase-css-2.0.1.tgz#ee978f6947914cc30c6b44741b6ed1df7f043fd5"
integrity sha512-QOSvevhslijgYwRx6Rv7zKdMF8lbRmx+uQGx2+vDc+KI/eBnsy9kit5aj23AgGu3pa4t9AgwbnXWqS+iOY+2aA==
-caniuse-lite@^1.0.30001579:
- version "1.0.30001715"
- resolved "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001715.tgz"
- integrity sha512-7ptkFGMm2OAOgvZpwgA4yjQ5SQbrNVGdRjzH0pBdy1Fasvcr+KAeECmbCAECzTuDuoX0FCY8KzUxjf9+9kfZEw==
-
-caniuse-lite@^1.0.30001646, caniuse-lite@^1.0.30001663:
+caniuse-lite@^1.0.30001579, caniuse-lite@^1.0.30001646, caniuse-lite@^1.0.30001663:
version "1.0.30001715"
resolved "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001715.tgz"
integrity sha512-7ptkFGMm2OAOgvZpwgA4yjQ5SQbrNVGdRjzH0pBdy1Fasvcr+KAeECmbCAECzTuDuoX0FCY8KzUxjf9+9kfZEw==
@@ -1419,6 +1476,15 @@ data-view-buffer@^1.0.1:
es-errors "^1.3.0"
is-data-view "^1.0.1"
+data-view-buffer@^1.0.2:
+ version "1.0.2"
+ resolved "https://registry.yarnpkg.com/data-view-buffer/-/data-view-buffer-1.0.2.tgz#211a03ba95ecaf7798a8c7198d79536211f88570"
+ integrity sha512-EmKO5V3OLXh1rtK2wgXRansaK1/mtVdTUEiEI0W8RkvgT05kfxaH29PliLnpLP73yYO6142Q72QNa8Wx/A5CqQ==
+ dependencies:
+ call-bound "^1.0.3"
+ es-errors "^1.3.0"
+ is-data-view "^1.0.2"
+
data-view-byte-length@^1.0.1:
version "1.0.1"
resolved "https://registry.yarnpkg.com/data-view-byte-length/-/data-view-byte-length-1.0.1.tgz#90721ca95ff280677eb793749fce1011347669e2"
@@ -1428,6 +1494,15 @@ data-view-byte-length@^1.0.1:
es-errors "^1.3.0"
is-data-view "^1.0.1"
+data-view-byte-length@^1.0.2:
+ version "1.0.2"
+ resolved "https://registry.yarnpkg.com/data-view-byte-length/-/data-view-byte-length-1.0.2.tgz#9e80f7ca52453ce3e93d25a35318767ea7704735"
+ integrity sha512-tuhGbE6CfTM9+5ANGf+oQb72Ky/0+s3xKUpHvShfiz2RxMFgFPjsXuRLBVMtvMs15awe45SRb83D6wH4ew6wlQ==
+ dependencies:
+ call-bound "^1.0.3"
+ es-errors "^1.3.0"
+ is-data-view "^1.0.2"
+
data-view-byte-offset@^1.0.0:
version "1.0.0"
resolved "https://registry.yarnpkg.com/data-view-byte-offset/-/data-view-byte-offset-1.0.0.tgz#5e0bbfb4828ed2d1b9b400cd8a7d119bca0ff18a"
@@ -1437,6 +1512,15 @@ data-view-byte-offset@^1.0.0:
es-errors "^1.3.0"
is-data-view "^1.0.1"
+data-view-byte-offset@^1.0.1:
+ version "1.0.1"
+ resolved "https://registry.yarnpkg.com/data-view-byte-offset/-/data-view-byte-offset-1.0.1.tgz#068307f9b71ab76dbbe10291389e020856606191"
+ integrity sha512-BS8PfmtDGnrgYdOonGZQdLZslWIeCGFP9tpan0hi1Co2Zr2NKADsvGYA8XxuG/4UWgJ6Cjtv+YJnB6MM69QGlQ==
+ dependencies:
+ call-bound "^1.0.2"
+ es-errors "^1.3.0"
+ is-data-view "^1.0.1"
+
date-fns@^2.29.1:
version "2.30.0"
resolved "https://registry.yarnpkg.com/date-fns/-/date-fns-2.30.0.tgz#f367e644839ff57894ec6ac480de40cae4b0f4d0"
@@ -1510,10 +1594,10 @@ delayed-stream@~1.0.0:
resolved "https://registry.yarnpkg.com/delayed-stream/-/delayed-stream-1.0.0.tgz#df3ae199acadfb7d440aaae0b29e2272b24ec619"
integrity sha512-ZySD7Nf91aLB0RxL4KGrKHBXl7Eds1DAmEdcoVawXnLD7SDhpNgtuII2aAkg7a7QS41jxPSZ17p4VdGnMHk3MQ==
-detect-libc@^2.0.3:
- version "2.0.3"
- resolved "https://registry.yarnpkg.com/detect-libc/-/detect-libc-2.0.3.tgz#f0cd503b40f9939b894697d19ad50895e30cf700"
- integrity sha512-bwy0MGW55bG41VqxxypOsdSdGqLwXPI/focwgTYCFMbdUiBAxLg9CFzG08sz2aqzknwiX7Hkl0bQENjg8iLByw==
+detect-libc@^2.0.4:
+ version "2.0.4"
+ resolved "https://registry.yarnpkg.com/detect-libc/-/detect-libc-2.0.4.tgz#f04715b8ba815e53b4d8109655b6508a6865a7e8"
+ integrity sha512-3UDv+G9CsCKO1WKMGw9fwq/SWJYbI0c5Y7LU1AXYoDdbhE2AHQ6N6Nb34sG8Fj7T5APy8qXDCKuuIHd1BR0tVA==
didyoumean@^1.2.2:
version "1.2.2"
@@ -1539,6 +1623,15 @@ doctrine@^3.0.0:
dependencies:
esutils "^2.0.2"
+dunder-proto@^1.0.0, dunder-proto@^1.0.1:
+ version "1.0.1"
+ resolved "https://registry.yarnpkg.com/dunder-proto/-/dunder-proto-1.0.1.tgz#d7ae667e1dc83482f8b70fd0f6eefc50da30f58a"
+ integrity sha512-KIN/nDJBQRcXw0MLVhZE9iQHmG68qAVIBg9CqmUYjmQIhgij9U5MFvrqkUL5FbtyyzZuOeOt0zdeRe4UY7ct+A==
+ dependencies:
+ call-bind-apply-helpers "^1.0.1"
+ es-errors "^1.3.0"
+ gopd "^1.2.0"
+
eastasianwidth@^0.2.0:
version "0.2.0"
resolved "https://registry.yarnpkg.com/eastasianwidth/-/eastasianwidth-0.2.0.tgz#696ce2ec0aa0e6ea93a397ffcf24aa7840c827cb"
@@ -1624,6 +1717,66 @@ es-abstract@^1.17.5, es-abstract@^1.22.1, es-abstract@^1.22.3, es-abstract@^1.23
unbox-primitive "^1.0.2"
which-typed-array "^1.1.15"
+es-abstract@^1.23.5, es-abstract@^1.23.6, es-abstract@^1.23.9:
+ version "1.24.0"
+ resolved "https://registry.yarnpkg.com/es-abstract/-/es-abstract-1.24.0.tgz#c44732d2beb0acc1ed60df840869e3106e7af328"
+ integrity sha512-WSzPgsdLtTcQwm4CROfS5ju2Wa1QQcVeT37jFjYzdFz1r9ahadC8B8/a4qxJxM+09F18iumCdRmlr96ZYkQvEg==
+ dependencies:
+ array-buffer-byte-length "^1.0.2"
+ arraybuffer.prototype.slice "^1.0.4"
+ available-typed-arrays "^1.0.7"
+ call-bind "^1.0.8"
+ call-bound "^1.0.4"
+ data-view-buffer "^1.0.2"
+ data-view-byte-length "^1.0.2"
+ data-view-byte-offset "^1.0.1"
+ es-define-property "^1.0.1"
+ es-errors "^1.3.0"
+ es-object-atoms "^1.1.1"
+ es-set-tostringtag "^2.1.0"
+ es-to-primitive "^1.3.0"
+ function.prototype.name "^1.1.8"
+ get-intrinsic "^1.3.0"
+ get-proto "^1.0.1"
+ get-symbol-description "^1.1.0"
+ globalthis "^1.0.4"
+ gopd "^1.2.0"
+ has-property-descriptors "^1.0.2"
+ has-proto "^1.2.0"
+ has-symbols "^1.1.0"
+ hasown "^2.0.2"
+ internal-slot "^1.1.0"
+ is-array-buffer "^3.0.5"
+ is-callable "^1.2.7"
+ is-data-view "^1.0.2"
+ is-negative-zero "^2.0.3"
+ is-regex "^1.2.1"
+ is-set "^2.0.3"
+ is-shared-array-buffer "^1.0.4"
+ is-string "^1.1.1"
+ is-typed-array "^1.1.15"
+ is-weakref "^1.1.1"
+ math-intrinsics "^1.1.0"
+ object-inspect "^1.13.4"
+ object-keys "^1.1.1"
+ object.assign "^4.1.7"
+ own-keys "^1.0.1"
+ regexp.prototype.flags "^1.5.4"
+ safe-array-concat "^1.1.3"
+ safe-push-apply "^1.0.0"
+ safe-regex-test "^1.1.0"
+ set-proto "^1.0.0"
+ stop-iteration-iterator "^1.1.0"
+ string.prototype.trim "^1.2.10"
+ string.prototype.trimend "^1.0.9"
+ string.prototype.trimstart "^1.0.8"
+ typed-array-buffer "^1.0.3"
+ typed-array-byte-length "^1.0.3"
+ typed-array-byte-offset "^1.0.4"
+ typed-array-length "^1.0.7"
+ unbox-primitive "^1.1.0"
+ which-typed-array "^1.1.19"
+
es-define-property@^1.0.0:
version "1.0.0"
resolved "https://registry.yarnpkg.com/es-define-property/-/es-define-property-1.0.0.tgz#c7faefbdff8b2696cf5f46921edfb77cc4ba3845"
@@ -1631,6 +1784,11 @@ es-define-property@^1.0.0:
dependencies:
get-intrinsic "^1.2.4"
+es-define-property@^1.0.1:
+ version "1.0.1"
+ resolved "https://registry.yarnpkg.com/es-define-property/-/es-define-property-1.0.1.tgz#983eb2f9a6724e9303f61addf011c72e09e0b0fa"
+ integrity sha512-e3nRfgfUZ4rNGL232gUgX06QNyyez04KdjFrF+LTRoOXmrOgFKDg4BCdsjW8EnT69eqdYGmRpJwiPVYNrCaW3g==
+
es-errors@^1.2.1, es-errors@^1.3.0:
version "1.3.0"
resolved "https://registry.yarnpkg.com/es-errors/-/es-errors-1.3.0.tgz#05f75a25dab98e4fb1dcd5e1472c0546d5057c8f"
@@ -1671,6 +1829,28 @@ es-iterator-helpers@^1.0.19:
iterator.prototype "^1.1.2"
safe-array-concat "^1.1.2"
+es-iterator-helpers@^1.2.1:
+ version "1.2.1"
+ resolved "https://registry.yarnpkg.com/es-iterator-helpers/-/es-iterator-helpers-1.2.1.tgz#d1dd0f58129054c0ad922e6a9a1e65eef435fe75"
+ integrity sha512-uDn+FE1yrDzyC0pCo961B2IHbdM8y/ACZsKD4dG6WqrjV53BADjwa7D+1aom2rsNVfLyDgU/eigvlJGJ08OQ4w==
+ dependencies:
+ call-bind "^1.0.8"
+ call-bound "^1.0.3"
+ define-properties "^1.2.1"
+ es-abstract "^1.23.6"
+ es-errors "^1.3.0"
+ es-set-tostringtag "^2.0.3"
+ function-bind "^1.1.2"
+ get-intrinsic "^1.2.6"
+ globalthis "^1.0.4"
+ gopd "^1.2.0"
+ has-property-descriptors "^1.0.2"
+ has-proto "^1.2.0"
+ has-symbols "^1.1.0"
+ internal-slot "^1.1.0"
+ iterator.prototype "^1.1.4"
+ safe-array-concat "^1.1.3"
+
es-object-atoms@^1.0.0:
version "1.0.0"
resolved "https://registry.yarnpkg.com/es-object-atoms/-/es-object-atoms-1.0.0.tgz#ddb55cd47ac2e240701260bc2a8e31ecb643d941"
@@ -1678,6 +1858,13 @@ es-object-atoms@^1.0.0:
dependencies:
es-errors "^1.3.0"
+es-object-atoms@^1.1.1:
+ version "1.1.1"
+ resolved "https://registry.yarnpkg.com/es-object-atoms/-/es-object-atoms-1.1.1.tgz#1c4f2c4837327597ce69d2ca190a7fdd172338c1"
+ integrity sha512-FGgH2h8zKNim9ljj7dankFPcICIK9Cp5bm+c2gQSYePhpaG5+esrLODihIorn+Pe6FGJzWhXQotPv73jTaldXA==
+ dependencies:
+ es-errors "^1.3.0"
+
es-set-tostringtag@^2.0.3:
version "2.0.3"
resolved "https://registry.yarnpkg.com/es-set-tostringtag/-/es-set-tostringtag-2.0.3.tgz#8bb60f0a440c2e4281962428438d58545af39777"
@@ -1687,6 +1874,16 @@ es-set-tostringtag@^2.0.3:
has-tostringtag "^1.0.2"
hasown "^2.0.1"
+es-set-tostringtag@^2.1.0:
+ version "2.1.0"
+ resolved "https://registry.yarnpkg.com/es-set-tostringtag/-/es-set-tostringtag-2.1.0.tgz#f31dbbe0c183b00a6d26eb6325c810c0fd18bd4d"
+ integrity sha512-j6vWzfrGVfyXxge+O0x5sh6cvxAog0a/4Rdd2K36zCMV5eJ+/+tOAngRO8cODMNWbVRdVlmGZQL2YS3yR8bIUA==
+ dependencies:
+ es-errors "^1.3.0"
+ get-intrinsic "^1.2.6"
+ has-tostringtag "^1.0.2"
+ hasown "^2.0.2"
+
es-shim-unscopables@^1.0.0, es-shim-unscopables@^1.0.2:
version "1.0.2"
resolved "https://registry.yarnpkg.com/es-shim-unscopables/-/es-shim-unscopables-1.0.2.tgz#1f6942e71ecc7835ed1c8a83006d8771a63a3763"
@@ -1703,6 +1900,15 @@ es-to-primitive@^1.2.1:
is-date-object "^1.0.1"
is-symbol "^1.0.2"
+es-to-primitive@^1.3.0:
+ version "1.3.0"
+ resolved "https://registry.yarnpkg.com/es-to-primitive/-/es-to-primitive-1.3.0.tgz#96c89c82cc49fd8794a24835ba3e1ff87f214e18"
+ integrity sha512-w+5mJ3GuFL+NjVtJlvydShqE1eN3h3PbI7/5LAsYJP/2qtuMXjfL2LpHSRqo4b4eSF5K/DH1JXKUAHSB2UW50g==
+ dependencies:
+ is-callable "^1.2.7"
+ is-date-object "^1.0.5"
+ is-symbol "^1.0.4"
+
escalade@^3.1.1, escalade@^3.1.2:
version "3.2.0"
resolved "https://registry.yarnpkg.com/escalade/-/escalade-3.2.0.tgz#011a3f69856ba189dffa7dc8fcce99d2a87903e5"
@@ -1718,12 +1924,12 @@ escape-string-regexp@^4.0.0:
resolved "https://registry.yarnpkg.com/escape-string-regexp/-/escape-string-regexp-4.0.0.tgz#14ba83a5d373e3d311e5afca29cf5bfad965bf34"
integrity sha512-TtpcNJ3XAzx3Gq8sWRzJaVajRs0uVxA2YAkdb1jm2YkPz4G6egUFAyA3n5vtEIZefPk5Wa4UXbKuS5fKkJWdgA==
-eslint-config-next@^15.0.1:
- version "15.0.1"
- resolved "https://registry.yarnpkg.com/eslint-config-next/-/eslint-config-next-15.0.1.tgz#5f49a01d312420cdbf1e87299396ef779ae99004"
- integrity sha512-3cYCrgbH6GS/ufApza7XCKz92vtq4dAdYhx++rMFNlH2cAV+/GsAKkrr4+bohYOACmzG2nAOR+uWprKC1Uld6A==
+eslint-config-next@15.5.2:
+ version "15.5.2"
+ resolved "https://registry.yarnpkg.com/eslint-config-next/-/eslint-config-next-15.5.2.tgz#9629ed1deaa131e8e80cbae20acf631c8595ca3e"
+ integrity sha512-3hPZghsLupMxxZ2ggjIIrat/bPniM2yRpsVPVM40rp8ZMzKWOJp2CGWn7+EzoV2ddkUr5fxNfHpF+wU1hGt/3g==
dependencies:
- "@next/eslint-plugin-next" "15.0.1"
+ "@next/eslint-plugin-next" "15.5.2"
"@rushstack/eslint-patch" "^1.10.3"
"@typescript-eslint/eslint-plugin" "^5.4.2 || ^6.0.0 || ^7.0.0 || ^8.0.0"
"@typescript-eslint/parser" "^5.4.2 || ^6.0.0 || ^7.0.0 || ^8.0.0"
@@ -1731,7 +1937,7 @@ eslint-config-next@^15.0.1:
eslint-import-resolver-typescript "^3.5.2"
eslint-plugin-import "^2.31.0"
eslint-plugin-jsx-a11y "^6.10.0"
- eslint-plugin-react "^7.35.0"
+ eslint-plugin-react "^7.37.0"
eslint-plugin-react-hooks "^5.0.0"
eslint-import-resolver-node@^0.3.6, eslint-import-resolver-node@^0.3.9:
@@ -1816,28 +2022,28 @@ eslint-plugin-react-hooks@^5.0.0:
resolved "https://registry.yarnpkg.com/eslint-plugin-react-hooks/-/eslint-plugin-react-hooks-5.0.0.tgz#72e2eefbac4b694f5324154619fee44f5f60f101"
integrity sha512-hIOwI+5hYGpJEc4uPRmz2ulCjAGD/N13Lukkh8cLV0i2IRk/bdZDYjgLVHj+U9Z704kLIdIO6iueGvxNur0sgw==
-eslint-plugin-react@^7.35.0:
- version "7.37.1"
- resolved "https://registry.yarnpkg.com/eslint-plugin-react/-/eslint-plugin-react-7.37.1.tgz#56493d7d69174d0d828bc83afeffe96903fdadbd"
- integrity sha512-xwTnwDqzbDRA8uJ7BMxPs/EXRB3i8ZfnOIp8BsxEQkT0nHPp+WWceqGgo6rKb9ctNi8GJLDT4Go5HAWELa/WMg==
+eslint-plugin-react@^7.37.0:
+ version "7.37.5"
+ resolved "https://registry.yarnpkg.com/eslint-plugin-react/-/eslint-plugin-react-7.37.5.tgz#2975511472bdda1b272b34d779335c9b0e877065"
+ integrity sha512-Qteup0SqU15kdocexFNAJMvCJEfa2xUKNV4CC1xsVMrIIqEy3SQ/rqyxCWNzfrd3/ldy6HMlD2e0JDVpDg2qIA==
dependencies:
array-includes "^3.1.8"
array.prototype.findlast "^1.2.5"
- array.prototype.flatmap "^1.3.2"
+ array.prototype.flatmap "^1.3.3"
array.prototype.tosorted "^1.1.4"
doctrine "^2.1.0"
- es-iterator-helpers "^1.0.19"
+ es-iterator-helpers "^1.2.1"
estraverse "^5.3.0"
hasown "^2.0.2"
jsx-ast-utils "^2.4.1 || ^3.0.0"
minimatch "^3.1.2"
- object.entries "^1.1.8"
+ object.entries "^1.1.9"
object.fromentries "^2.0.8"
- object.values "^1.2.0"
+ object.values "^1.2.1"
prop-types "^15.8.1"
resolve "^2.0.0-next.5"
semver "^6.3.1"
- string.prototype.matchall "^4.0.11"
+ string.prototype.matchall "^4.0.12"
string.prototype.repeat "^1.0.0"
eslint-scope@^7.2.2:
@@ -2022,6 +2228,13 @@ for-each@^0.3.3:
dependencies:
is-callable "^1.1.3"
+for-each@^0.3.5:
+ version "0.3.5"
+ resolved "https://registry.yarnpkg.com/for-each/-/for-each-0.3.5.tgz#d650688027826920feeb0af747ee7b9421a41d47"
+ integrity sha512-dKx12eRCVIzqCxFGplyFKJMPvLEWgmNtUrpTiJIR5u97zEhRG8ySrtboPHZXx7daLxQVrl643cTzbab2tkQjxg==
+ dependencies:
+ is-callable "^1.2.7"
+
foreground-child@^3.1.0:
version "3.3.0"
resolved "https://registry.yarnpkg.com/foreground-child/-/foreground-child-3.3.0.tgz#0ac8644c06e431439f8561db8ecf29a7b5519c77"
@@ -2074,6 +2287,18 @@ function.prototype.name@^1.1.6:
es-abstract "^1.22.1"
functions-have-names "^1.2.3"
+function.prototype.name@^1.1.8:
+ version "1.1.8"
+ resolved "https://registry.yarnpkg.com/function.prototype.name/-/function.prototype.name-1.1.8.tgz#e68e1df7b259a5c949eeef95cdbde53edffabb78"
+ integrity sha512-e5iwyodOHhbMr/yNrc7fDYG4qlbIvI5gajyzPnb5TCwyhjApznQh1BMFou9b30SevY43gCJKXycoCBjMbsuW0Q==
+ dependencies:
+ call-bind "^1.0.8"
+ call-bound "^1.0.3"
+ define-properties "^1.2.1"
+ functions-have-names "^1.2.3"
+ hasown "^2.0.2"
+ is-callable "^1.2.7"
+
functions-have-names@^1.2.3:
version "1.2.3"
resolved "https://registry.yarnpkg.com/functions-have-names/-/functions-have-names-1.2.3.tgz#0404fe4ee2ba2f607f0e0ec3c80bae994133b834"
@@ -2100,6 +2325,30 @@ get-intrinsic@^1.1.3, get-intrinsic@^1.2.1, get-intrinsic@^1.2.2, get-intrinsic@
has-symbols "^1.0.3"
hasown "^2.0.0"
+get-intrinsic@^1.2.5, get-intrinsic@^1.2.6, get-intrinsic@^1.2.7, get-intrinsic@^1.3.0:
+ version "1.3.0"
+ resolved "https://registry.yarnpkg.com/get-intrinsic/-/get-intrinsic-1.3.0.tgz#743f0e3b6964a93a5491ed1bffaae054d7f98d01"
+ integrity sha512-9fSjSaos/fRIVIp+xSJlE6lfwhES7LNtKaCBIamHsjr2na1BiABJPo0mOjjz8GJDURarmCPGqaiVg5mfjb98CQ==
+ dependencies:
+ call-bind-apply-helpers "^1.0.2"
+ es-define-property "^1.0.1"
+ es-errors "^1.3.0"
+ es-object-atoms "^1.1.1"
+ function-bind "^1.1.2"
+ get-proto "^1.0.1"
+ gopd "^1.2.0"
+ has-symbols "^1.1.0"
+ hasown "^2.0.2"
+ math-intrinsics "^1.1.0"
+
+get-proto@^1.0.0, get-proto@^1.0.1:
+ version "1.0.1"
+ resolved "https://registry.yarnpkg.com/get-proto/-/get-proto-1.0.1.tgz#150b3f2743869ef3e851ec0c49d15b1d14d00ee1"
+ integrity sha512-sTSfBjoXBp89JvIKIefqw7U2CCebsc74kiY6awiGogKtoSGbgjYE/G/+l9sF3MWFPNc9IcoOC4ODfKHfxFmp0g==
+ dependencies:
+ dunder-proto "^1.0.1"
+ es-object-atoms "^1.0.0"
+
get-symbol-description@^1.0.2:
version "1.0.2"
resolved "https://registry.yarnpkg.com/get-symbol-description/-/get-symbol-description-1.0.2.tgz#533744d5aa20aca4e079c8e5daf7fd44202821f5"
@@ -2109,6 +2358,15 @@ get-symbol-description@^1.0.2:
es-errors "^1.3.0"
get-intrinsic "^1.2.4"
+get-symbol-description@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/get-symbol-description/-/get-symbol-description-1.1.0.tgz#7bdd54e0befe8ffc9f3b4e203220d9f1e881b6ee"
+ integrity sha512-w9UMqWwJxHNOvoNzSJ2oPF5wvYcvP7jUvYzhp67yEhTi17ZDBBC1z9pTdGuzjD+EFIqLSYRweZjqfiPzQ06Ebg==
+ dependencies:
+ call-bound "^1.0.3"
+ es-errors "^1.3.0"
+ get-intrinsic "^1.2.6"
+
get-tsconfig@^4.7.5:
version "4.8.1"
resolved "https://registry.yarnpkg.com/get-tsconfig/-/get-tsconfig-4.8.1.tgz#8995eb391ae6e1638d251118c7b56de7eb425471"
@@ -2166,7 +2424,7 @@ globals@^13.19.0:
dependencies:
type-fest "^0.20.2"
-globalthis@^1.0.3:
+globalthis@^1.0.3, globalthis@^1.0.4:
version "1.0.4"
resolved "https://registry.yarnpkg.com/globalthis/-/globalthis-1.0.4.tgz#7430ed3a975d97bfb59bcce41f5cabbafa651236"
integrity sha512-DpLKbNU4WylpxJykQujfCcwYWiV/Jhm50Goo0wrVILAv5jOr9d+H+UR3PhSCD2rCCEIg0uc+G+muBTwD54JhDQ==
@@ -2186,6 +2444,11 @@ gopd@^1.0.1:
dependencies:
get-intrinsic "^1.1.3"
+gopd@^1.2.0:
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/gopd/-/gopd-1.2.0.tgz#89f56b8217bdbc8802bd299df6d7f1081d7e51a1"
+ integrity sha512-ZUKRh6/kUFoAiTAtTYPZJ3hw9wNxx+BIBOijnlG9PnrJsCcSjs1wyyD6vJpaYtgnzDrKYRSqf3OO6Rfa93xsRg==
+
graceful-fs@^4.2.4:
version "4.2.11"
resolved "https://registry.yarnpkg.com/graceful-fs/-/graceful-fs-4.2.11.tgz#4183e4e8bf08bb6e05bbb2f7d2e0c8f712ca40e3"
@@ -2223,11 +2486,23 @@ has-proto@^1.0.1, has-proto@^1.0.3:
resolved "https://registry.yarnpkg.com/has-proto/-/has-proto-1.0.3.tgz#b31ddfe9b0e6e9914536a6ab286426d0214f77fd"
integrity sha512-SJ1amZAJUiZS+PhsVLf5tGydlaVB8EdFpaSO4gmiUKUOxk8qzn5AIy4ZeJUmh22znIdk/uMAUT2pl3FxzVUH+Q==
+has-proto@^1.2.0:
+ version "1.2.0"
+ resolved "https://registry.yarnpkg.com/has-proto/-/has-proto-1.2.0.tgz#5de5a6eabd95fdffd9818b43055e8065e39fe9d5"
+ integrity sha512-KIL7eQPfHQRC8+XluaIw7BHUwwqL19bQn4hzNgdr+1wXoU0KKj6rufu47lhY7KbJR2C6T6+PfyN0Ea7wkSS+qQ==
+ dependencies:
+ dunder-proto "^1.0.0"
+
has-symbols@^1.0.2, has-symbols@^1.0.3:
version "1.0.3"
resolved "https://registry.yarnpkg.com/has-symbols/-/has-symbols-1.0.3.tgz#bb7b2c4349251dce87b125f7bdf874aa7c8b39f8"
integrity sha512-l3LCuF6MgDNwTDKkdYGEihYjt5pRPbEg46rtlmnSPlUbgmB8LOIrKJbYYFBSbnPaJexMKtiPO8hmeRjRz2Td+A==
+has-symbols@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/has-symbols/-/has-symbols-1.1.0.tgz#fc9c6a783a084951d0b971fe1018de813707a338"
+ integrity sha512-1cDNdwJ2Jaohmb3sg4OmKaMBwuC48sYni5HUw2DvsC8LjGTLK9h+eb1X6RyuOHe4hT0ULCW68iomhjUoKUqlPQ==
+
has-tostringtag@^1.0.0, has-tostringtag@^1.0.2:
version "1.0.2"
resolved "https://registry.yarnpkg.com/has-tostringtag/-/has-tostringtag-1.0.2.tgz#2cdc42d40bef2e5b4eeab7c01a73c54ce7ab5abc"
@@ -2303,6 +2578,15 @@ internal-slot@^1.0.4, internal-slot@^1.0.7:
hasown "^2.0.0"
side-channel "^1.0.4"
+internal-slot@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/internal-slot/-/internal-slot-1.1.0.tgz#1eac91762947d2f7056bc838d93e13b2e9604961"
+ integrity sha512-4gd7VpWNQNB4UKKCFFVcp1AVv+FMOgs9NKzjHKusc8jTMhd5eL1NqQqOpE0KzMds804/yHlglp3uxgluOqAPLw==
+ dependencies:
+ es-errors "^1.3.0"
+ hasown "^2.0.2"
+ side-channel "^1.1.0"
+
invariant@^2.2.4:
version "2.2.4"
resolved "https://registry.yarnpkg.com/invariant/-/invariant-2.2.4.tgz#610f3c92c9359ce1db616e538008d23ff35158e6"
@@ -2326,6 +2610,15 @@ is-array-buffer@^3.0.2, is-array-buffer@^3.0.4:
call-bind "^1.0.2"
get-intrinsic "^1.2.1"
+is-array-buffer@^3.0.5:
+ version "3.0.5"
+ resolved "https://registry.yarnpkg.com/is-array-buffer/-/is-array-buffer-3.0.5.tgz#65742e1e687bd2cc666253068fd8707fe4d44280"
+ integrity sha512-DDfANUiiG2wC1qawP66qlTugJeL5HyzMpfr8lLK+jMQirGzNod0B12cFB/9q838Ru27sBwfw78/rdoU7RERz6A==
+ dependencies:
+ call-bind "^1.0.8"
+ call-bound "^1.0.3"
+ get-intrinsic "^1.2.6"
+
is-arrayish@^0.3.1:
version "0.3.2"
resolved "https://registry.yarnpkg.com/is-arrayish/-/is-arrayish-0.3.2.tgz#4574a2ae56f7ab206896fb431eaeed066fdf8f03"
@@ -2345,6 +2638,13 @@ is-bigint@^1.0.1:
dependencies:
has-bigints "^1.0.1"
+is-bigint@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/is-bigint/-/is-bigint-1.1.0.tgz#dda7a3445df57a42583db4228682eba7c4170672"
+ integrity sha512-n4ZT37wG78iz03xPRKJrHTdZbe3IicyucEtdRsV5yglwc3GyUfbAfpSeD0FJ41NbUNSt5wbhqfp1fS+BgnvDFQ==
+ dependencies:
+ has-bigints "^1.0.2"
+
is-binary-path@~2.1.0:
version "2.1.0"
resolved "https://registry.yarnpkg.com/is-binary-path/-/is-binary-path-2.1.0.tgz#ea1f7f3b80f064236e83470f86c09c254fb45b09"
@@ -2360,6 +2660,14 @@ is-boolean-object@^1.1.0:
call-bind "^1.0.2"
has-tostringtag "^1.0.0"
+is-boolean-object@^1.2.1:
+ version "1.2.2"
+ resolved "https://registry.yarnpkg.com/is-boolean-object/-/is-boolean-object-1.2.2.tgz#7067f47709809a393c71ff5bb3e135d8a9215d9e"
+ integrity sha512-wa56o2/ElJMYqjCjGkXri7it5FbebW5usLw/nPmCMs5DeZ7eziSYZhSmPRn0txqeW4LnAmQQU7FgqLpsEFKM4A==
+ dependencies:
+ call-bound "^1.0.3"
+ has-tostringtag "^1.0.2"
+
is-bun-module@^1.0.2:
version "1.2.1"
resolved "https://registry.yarnpkg.com/is-bun-module/-/is-bun-module-1.2.1.tgz#495e706f42e29f086fd5fe1ac3c51f106062b9fc"
@@ -2386,6 +2694,15 @@ is-data-view@^1.0.1:
dependencies:
is-typed-array "^1.1.13"
+is-data-view@^1.0.2:
+ version "1.0.2"
+ resolved "https://registry.yarnpkg.com/is-data-view/-/is-data-view-1.0.2.tgz#bae0a41b9688986c2188dda6657e56b8f9e63b8e"
+ integrity sha512-RKtWF8pGmS87i2D6gqQu/l7EYRlVdfzemCJN/P3UOs//x1QE7mfhvzHIApBTRf7axvT6DMGwSwBXYCT0nfB9xw==
+ dependencies:
+ call-bound "^1.0.2"
+ get-intrinsic "^1.2.6"
+ is-typed-array "^1.1.13"
+
is-date-object@^1.0.1, is-date-object@^1.0.5:
version "1.0.5"
resolved "https://registry.yarnpkg.com/is-date-object/-/is-date-object-1.0.5.tgz#0841d5536e724c25597bf6ea62e1bd38298df31f"
@@ -2393,6 +2710,14 @@ is-date-object@^1.0.1, is-date-object@^1.0.5:
dependencies:
has-tostringtag "^1.0.0"
+is-date-object@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/is-date-object/-/is-date-object-1.1.0.tgz#ad85541996fc7aa8b2729701d27b7319f95d82f7"
+ integrity sha512-PwwhEakHVKTdRNVOw+/Gyh0+MzlCl4R6qKvkhuvLtPMggI1WAHt9sOwZxQLSGpUaDnrdyDsomoRgNnCfKNSXXg==
+ dependencies:
+ call-bound "^1.0.2"
+ has-tostringtag "^1.0.2"
+
is-extglob@^2.1.1:
version "2.1.1"
resolved "https://registry.yarnpkg.com/is-extglob/-/is-extglob-2.1.1.tgz#a88c02535791f02ed37c76a1b9ea9773c833f8c2"
@@ -2405,6 +2730,13 @@ is-finalizationregistry@^1.0.2:
dependencies:
call-bind "^1.0.2"
+is-finalizationregistry@^1.1.0:
+ version "1.1.1"
+ resolved "https://registry.yarnpkg.com/is-finalizationregistry/-/is-finalizationregistry-1.1.1.tgz#eefdcdc6c94ddd0674d9c85887bf93f944a97c90"
+ integrity sha512-1pC6N8qWJbWoPtEjgcL2xyhQOP491EQjeUo3qTKcmV8YSDDJrOepfG8pcC7h/QgnQHYSv0mJ3Z/ZWxmatVrysg==
+ dependencies:
+ call-bound "^1.0.3"
+
is-fullwidth-code-point@^3.0.0:
version "3.0.0"
resolved "https://registry.yarnpkg.com/is-fullwidth-code-point/-/is-fullwidth-code-point-3.0.0.tgz#f116f8064fe90b3f7844a38997c0b75051269f1d"
@@ -2441,6 +2773,14 @@ is-number-object@^1.0.4:
dependencies:
has-tostringtag "^1.0.0"
+is-number-object@^1.1.1:
+ version "1.1.1"
+ resolved "https://registry.yarnpkg.com/is-number-object/-/is-number-object-1.1.1.tgz#144b21e95a1bc148205dcc2814a9134ec41b2541"
+ integrity sha512-lZhclumE1G6VYD8VHe35wFaIif+CTy5SJIi5+3y4psDgWu4wPDoBhF8NxUOinEc7pHgiTsT6MaBb92rKhhD+Xw==
+ dependencies:
+ call-bound "^1.0.3"
+ has-tostringtag "^1.0.2"
+
is-number@^7.0.0:
version "7.0.0"
resolved "https://registry.yarnpkg.com/is-number/-/is-number-7.0.0.tgz#7535345b896734d5f80c4d06c50955527a14f12b"
@@ -2459,6 +2799,16 @@ is-regex@^1.1.4:
call-bind "^1.0.2"
has-tostringtag "^1.0.0"
+is-regex@^1.2.1:
+ version "1.2.1"
+ resolved "https://registry.yarnpkg.com/is-regex/-/is-regex-1.2.1.tgz#76d70a3ed10ef9be48eb577887d74205bf0cad22"
+ integrity sha512-MjYsKHO5O7mCsmRGxWcLWheFqN9DJ/2TmngvjKXihe6efViPqc274+Fx/4fYj/r03+ESvBdTXK0V6tA3rgez1g==
+ dependencies:
+ call-bound "^1.0.2"
+ gopd "^1.2.0"
+ has-tostringtag "^1.0.2"
+ hasown "^2.0.2"
+
is-set@^2.0.2, is-set@^2.0.3:
version "2.0.3"
resolved "https://registry.yarnpkg.com/is-set/-/is-set-2.0.3.tgz#8ab209ea424608141372ded6e0cb200ef1d9d01d"
@@ -2471,6 +2821,13 @@ is-shared-array-buffer@^1.0.2, is-shared-array-buffer@^1.0.3:
dependencies:
call-bind "^1.0.7"
+is-shared-array-buffer@^1.0.4:
+ version "1.0.4"
+ resolved "https://registry.yarnpkg.com/is-shared-array-buffer/-/is-shared-array-buffer-1.0.4.tgz#9b67844bd9b7f246ba0708c3a93e34269c774f6f"
+ integrity sha512-ISWac8drv4ZGfwKl5slpHG9OwPNty4jOWPRIhBpxOoD+hqITiwuipOQ2bNthAzwA3B4fIjO4Nln74N0S9byq8A==
+ dependencies:
+ call-bound "^1.0.3"
+
is-string@^1.0.5, is-string@^1.0.7:
version "1.0.7"
resolved "https://registry.yarnpkg.com/is-string/-/is-string-1.0.7.tgz#0dd12bf2006f255bb58f695110eff7491eebc0fd"
@@ -2478,6 +2835,14 @@ is-string@^1.0.5, is-string@^1.0.7:
dependencies:
has-tostringtag "^1.0.0"
+is-string@^1.1.1:
+ version "1.1.1"
+ resolved "https://registry.yarnpkg.com/is-string/-/is-string-1.1.1.tgz#92ea3f3d5c5b6e039ca8677e5ac8d07ea773cbb9"
+ integrity sha512-BtEeSsoaQjlSPBemMQIrY1MY0uM6vnS1g5fmufYOtnxLGUZM2178PKbhsk7Ffv58IX+ZtcvoGwccYsh0PglkAA==
+ dependencies:
+ call-bound "^1.0.3"
+ has-tostringtag "^1.0.2"
+
is-symbol@^1.0.2, is-symbol@^1.0.3:
version "1.0.4"
resolved "https://registry.yarnpkg.com/is-symbol/-/is-symbol-1.0.4.tgz#a6dac93b635b063ca6872236de88910a57af139c"
@@ -2485,6 +2850,15 @@ is-symbol@^1.0.2, is-symbol@^1.0.3:
dependencies:
has-symbols "^1.0.2"
+is-symbol@^1.0.4, is-symbol@^1.1.1:
+ version "1.1.1"
+ resolved "https://registry.yarnpkg.com/is-symbol/-/is-symbol-1.1.1.tgz#f47761279f532e2b05a7024a7506dbbedacd0634"
+ integrity sha512-9gGx6GTtCQM73BgmHQXfDmLtfjjTUDSyoxTCbp5WtoixAhfgsDirWIcVQ/IHpvI5Vgd5i/J5F7B9cN/WlVbC/w==
+ dependencies:
+ call-bound "^1.0.2"
+ has-symbols "^1.1.0"
+ safe-regex-test "^1.1.0"
+
is-typed-array@^1.1.13:
version "1.1.13"
resolved "https://registry.yarnpkg.com/is-typed-array/-/is-typed-array-1.1.13.tgz#d6c5ca56df62334959322d7d7dd1cca50debe229"
@@ -2492,6 +2866,13 @@ is-typed-array@^1.1.13:
dependencies:
which-typed-array "^1.1.14"
+is-typed-array@^1.1.14, is-typed-array@^1.1.15:
+ version "1.1.15"
+ resolved "https://registry.yarnpkg.com/is-typed-array/-/is-typed-array-1.1.15.tgz#4bfb4a45b61cee83a5a46fba778e4e8d59c0ce0b"
+ integrity sha512-p3EcsicXjit7SaskXHs1hA91QxgTw46Fv6EFKKGS5DRFLD8yKnohjF3hxoju94b/OcMZoQukzpPpBE9uLVKzgQ==
+ dependencies:
+ which-typed-array "^1.1.16"
+
is-weakmap@^2.0.2:
version "2.0.2"
resolved "https://registry.yarnpkg.com/is-weakmap/-/is-weakmap-2.0.2.tgz#bf72615d649dfe5f699079c54b83e47d1ae19cfd"
@@ -2504,6 +2885,13 @@ is-weakref@^1.0.2:
dependencies:
call-bind "^1.0.2"
+is-weakref@^1.1.1:
+ version "1.1.1"
+ resolved "https://registry.yarnpkg.com/is-weakref/-/is-weakref-1.1.1.tgz#eea430182be8d64174bd96bffbc46f21bf3f9293"
+ integrity sha512-6i9mGWSlqzNMEqpCp93KwRS1uUOodk2OJ6b+sq7ZPDSy2WuI5NFIxp/254TytR8ftefexkWn5xNiHUNpPOfSew==
+ dependencies:
+ call-bound "^1.0.3"
+
is-weakset@^2.0.3:
version "2.0.3"
resolved "https://registry.yarnpkg.com/is-weakset/-/is-weakset-2.0.3.tgz#e801519df8c0c43e12ff2834eead84ec9e624007"
@@ -2533,6 +2921,18 @@ iterator.prototype@^1.1.2:
reflect.getprototypeof "^1.0.4"
set-function-name "^2.0.1"
+iterator.prototype@^1.1.4:
+ version "1.1.5"
+ resolved "https://registry.yarnpkg.com/iterator.prototype/-/iterator.prototype-1.1.5.tgz#12c959a29de32de0aa3bbbb801f4d777066dae39"
+ integrity sha512-H0dkQoCa3b2VEeKQBOxFph+JAbcrQdE7KC0UkqwpLmv2EC4P41QXP+rqo9wYodACiG5/WM5s9oDApTU8utwj9g==
+ dependencies:
+ define-data-property "^1.1.4"
+ es-object-atoms "^1.0.0"
+ get-intrinsic "^1.2.6"
+ get-proto "^1.0.0"
+ has-symbols "^1.1.0"
+ set-function-name "^2.0.2"
+
jackspeak@^3.1.2:
version "3.4.3"
resolved "https://registry.yarnpkg.com/jackspeak/-/jackspeak-3.4.3.tgz#8833a9d89ab4acde6188942bd1c53b6390ed5a8a"
@@ -2697,6 +3097,11 @@ lru-cache@^10.2.0:
resolved "https://registry.yarnpkg.com/lru-cache/-/lru-cache-10.4.3.tgz#410fc8a17b70e598013df257c2446b7f3383f119"
integrity sha512-JNAzZcXrCt42VGLuYz0zfAzDfAvJWW6AfYlDBQyDV5DClI2m5sAmK+OIO7s59XfsRsWHp02jAJrRadPRGTt6SQ==
+lru-cache@^11.2.2:
+ version "11.2.2"
+ resolved "https://registry.yarnpkg.com/lru-cache/-/lru-cache-11.2.2.tgz#40fd37edffcfae4b2940379c0722dc6eeaa75f24"
+ integrity sha512-F9ODfyqML2coTIsQpSkRHnLSZMtkU8Q+mSfcaIyKwy58u+8k5nvAYeiNhsyMARvzNcXJ9QfWVrcPsC9e9rAxtg==
+
lru-cache@^5.1.1:
version "5.1.1"
resolved "https://registry.yarnpkg.com/lru-cache/-/lru-cache-5.1.1.tgz#1da27e6710271947695daf6848e847f01d84b920"
@@ -2709,6 +3114,11 @@ lz-string@^1.5.0:
resolved "https://registry.yarnpkg.com/lz-string/-/lz-string-1.5.0.tgz#c1ab50f77887b712621201ba9fd4e3a6ed099941"
integrity sha512-h5bgJWpxJNswbU7qCrV0tIKQCaS3blPDrqKWx+QxzuzL1zGUzij9XCWLrSLsJPu5t+eWA/ycetzYAO5IOMcWAQ==
+math-intrinsics@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/math-intrinsics/-/math-intrinsics-1.1.0.tgz#a0dd74be81e2aa5c2f27e65ce283605ee4e2b7f9"
+ integrity sha512-/IXtbwEk5HTPyEwyKX6hGkYXxM9nbj64B+ilVJnC/R6B0pH5G4V3b0pVbL7DBj4tkhBAppbQUlf6F6Xl9LHu1g==
+
merge2@^1.3.0:
version "1.4.1"
resolved "https://registry.yarnpkg.com/merge2/-/merge2-1.4.1.tgz#4368892f885e907455a6fd7dc55c0c9d404990ae"
@@ -2794,28 +3204,26 @@ natural-compare@^1.4.0:
resolved "https://registry.yarnpkg.com/natural-compare/-/natural-compare-1.4.0.tgz#4abebfeed7541f2c27acfb29bdbbd15c8d5ba4f7"
integrity sha512-OWND8ei3VtNC9h7V60qff3SVobHr996CTwgxubgyQYEpg290h9J0buyECNNJexkFm5sOajh5G116RYA1c8ZMSw==
-next@^15.2.0-canary.64:
- version "15.2.0-canary.66"
- resolved "https://registry.yarnpkg.com/next/-/next-15.2.0-canary.66.tgz#cb5ee4453c88f247b6e74fe33fd181eca58e7c86"
- integrity sha512-S+gsEu8vxxejI7nKqtCLqZlTi9L40xelLRK/Fgtvm/XT8W8ziLp3KMtN4I9Si5nEMU5uv7bllIfd04kVX8+HIw==
+next@15.5.9:
+ version "15.5.9"
+ resolved "https://registry.yarnpkg.com/next/-/next-15.5.9.tgz#1b80d05865cc27e710fb4dcfc6fd9e726ed12ad4"
+ integrity sha512-agNLK89seZEtC5zUHwtut0+tNrc0Xw4FT/Dg+B/VLEo9pAcS9rtTKpek3V6kVcVwsB2YlqMaHdfZL4eLEVYuCg==
dependencies:
- "@next/env" "15.2.0-canary.66"
- "@swc/counter" "0.1.3"
+ "@next/env" "15.5.9"
"@swc/helpers" "0.5.15"
- busboy "1.6.0"
caniuse-lite "^1.0.30001579"
postcss "8.4.31"
styled-jsx "5.1.6"
optionalDependencies:
- "@next/swc-darwin-arm64" "15.2.0-canary.66"
- "@next/swc-darwin-x64" "15.2.0-canary.66"
- "@next/swc-linux-arm64-gnu" "15.2.0-canary.66"
- "@next/swc-linux-arm64-musl" "15.2.0-canary.66"
- "@next/swc-linux-x64-gnu" "15.2.0-canary.66"
- "@next/swc-linux-x64-musl" "15.2.0-canary.66"
- "@next/swc-win32-arm64-msvc" "15.2.0-canary.66"
- "@next/swc-win32-x64-msvc" "15.2.0-canary.66"
- sharp "^0.33.5"
+ "@next/swc-darwin-arm64" "15.5.7"
+ "@next/swc-darwin-x64" "15.5.7"
+ "@next/swc-linux-arm64-gnu" "15.5.7"
+ "@next/swc-linux-arm64-musl" "15.5.7"
+ "@next/swc-linux-x64-gnu" "15.5.7"
+ "@next/swc-linux-x64-musl" "15.5.7"
+ "@next/swc-win32-arm64-msvc" "15.5.7"
+ "@next/swc-win32-x64-msvc" "15.5.7"
+ sharp "^0.34.3"
node-releases@^2.0.18:
version "2.0.18"
@@ -2855,6 +3263,11 @@ object-inspect@^1.13.1:
resolved "https://registry.yarnpkg.com/object-inspect/-/object-inspect-1.13.2.tgz#dea0088467fb991e67af4058147a24824a3043ff"
integrity sha512-IRZSRuzJiynemAXPYtPe5BoI/RESNYR7TYm50MC5Mqbd3Jmw5y790sErYw3V6SryFJD64b74qQQs9wn5Bg/k3g==
+object-inspect@^1.13.3, object-inspect@^1.13.4:
+ version "1.13.4"
+ resolved "https://registry.yarnpkg.com/object-inspect/-/object-inspect-1.13.4.tgz#8375265e21bc20d0fa582c22e1b13485d6e00213"
+ integrity sha512-W67iLl4J2EXEGTbfeHCffrjDfitvLANg0UlX3wFUUSTx92KXRFegMHUVgSqE+wvhAbi4WqjGg9czysTV2Epbew==
+
object-is@^1.1.5:
version "1.1.6"
resolved "https://registry.yarnpkg.com/object-is/-/object-is-1.1.6.tgz#1a6a53aed2dd8f7e6775ff870bea58545956ab07"
@@ -2878,14 +3291,27 @@ object.assign@^4.1.4, object.assign@^4.1.5:
has-symbols "^1.0.3"
object-keys "^1.1.1"
-object.entries@^1.1.8:
- version "1.1.8"
- resolved "https://registry.yarnpkg.com/object.entries/-/object.entries-1.1.8.tgz#bffe6f282e01f4d17807204a24f8edd823599c41"
- integrity sha512-cmopxi8VwRIAw/fkijJohSfpef5PdN0pMQJN6VC/ZKvn0LIknWD8KtgY6KlQdEc4tIjcQ3HxSMmnvtzIscdaYQ==
+object.assign@^4.1.7:
+ version "4.1.7"
+ resolved "https://registry.yarnpkg.com/object.assign/-/object.assign-4.1.7.tgz#8c14ca1a424c6a561b0bb2a22f66f5049a945d3d"
+ integrity sha512-nK28WOo+QIjBkDduTINE4JkF/UJJKyf2EJxvJKfblDpyg0Q+pkOHNTL0Qwy6NP6FhE/EnzV73BxxqcJaXY9anw==
dependencies:
- call-bind "^1.0.7"
+ call-bind "^1.0.8"
+ call-bound "^1.0.3"
define-properties "^1.2.1"
es-object-atoms "^1.0.0"
+ has-symbols "^1.1.0"
+ object-keys "^1.1.1"
+
+object.entries@^1.1.9:
+ version "1.1.9"
+ resolved "https://registry.yarnpkg.com/object.entries/-/object.entries-1.1.9.tgz#e4770a6a1444afb61bd39f984018b5bede25f8b3"
+ integrity sha512-8u/hfXFRBD1O0hPUjioLhoWFHRmt6tKA4/vZPyckBr18l1KE9uHrFaFaUi8MDRTpi4uak2goyPTSNJLXX2k2Hw==
+ dependencies:
+ call-bind "^1.0.8"
+ call-bound "^1.0.4"
+ define-properties "^1.2.1"
+ es-object-atoms "^1.1.1"
object.fromentries@^2.0.8:
version "2.0.8"
@@ -2915,6 +3341,16 @@ object.values@^1.1.6, object.values@^1.2.0:
define-properties "^1.2.1"
es-object-atoms "^1.0.0"
+object.values@^1.2.1:
+ version "1.2.1"
+ resolved "https://registry.yarnpkg.com/object.values/-/object.values-1.2.1.tgz#deed520a50809ff7f75a7cfd4bc64c7a038c6216"
+ integrity sha512-gXah6aZrcUxjWg2zR2MwouP2eHlCBzdV4pygudehaKXSGW4v2AsRQUK+lwwXhii6KFZcunEnmSUoYp5CXibxtA==
+ dependencies:
+ call-bind "^1.0.8"
+ call-bound "^1.0.3"
+ define-properties "^1.2.1"
+ es-object-atoms "^1.0.0"
+
once@^1.3.0:
version "1.4.0"
resolved "https://registry.yarnpkg.com/once/-/once-1.4.0.tgz#583b1aa775961d4b113ac17d9c50baef9dd76bd1"
@@ -2934,6 +3370,15 @@ optionator@^0.9.3:
type-check "^0.4.0"
word-wrap "^1.2.5"
+own-keys@^1.0.1:
+ version "1.0.1"
+ resolved "https://registry.yarnpkg.com/own-keys/-/own-keys-1.0.1.tgz#e4006910a2bf913585289676eebd6f390cf51358"
+ integrity sha512-qFOyK5PjiWZd+QQIh+1jhdb9LpxTF0qs7Pm8o5QHYZ0M3vKqSqzsZaEB6oWlxZ+q2sJBMI/Ktgd2N5ZwQoRHfg==
+ dependencies:
+ get-intrinsic "^1.2.6"
+ object-keys "^1.1.1"
+ safe-push-apply "^1.0.0"
+
p-limit@^3.0.2:
version "3.1.0"
resolved "https://registry.yarnpkg.com/p-limit/-/p-limit-3.1.0.tgz#e1daccbe78d0d1388ca18c64fea38e3e57e3706b"
@@ -3008,17 +3453,17 @@ pirates@^4.0.1:
resolved "https://registry.yarnpkg.com/pirates/-/pirates-4.0.6.tgz#3018ae32ecfcff6c29ba2267cbf21166ac1f36b9"
integrity sha512-saLsH7WeYYPiD25LDuLRRY/i+6HaPYr6G1OUlN39otzkSTxKnubR9RTxS3/Kk50s1g2JTgFwWQDQyplC5/SHZg==
-playwright-core@1.51.1:
- version "1.51.1"
- resolved "https://registry.yarnpkg.com/playwright-core/-/playwright-core-1.51.1.tgz#d57f0393e02416f32a47cf82b27533656a8acce1"
- integrity sha512-/crRMj8+j/Nq5s8QcvegseuyeZPxpQCZb6HNk3Sos3BlZyAknRjoyJPFWkpNn8v0+P3WiwqFF8P+zQo4eqiNuw==
+playwright-core@1.56.1:
+ version "1.56.1"
+ resolved "https://registry.yarnpkg.com/playwright-core/-/playwright-core-1.56.1.tgz#24a66481e5cd33a045632230aa2c4f0cb6b1db3d"
+ integrity sha512-hutraynyn31F+Bifme+Ps9Vq59hKuUCz7H1kDOcBs+2oGguKkWTU50bBWrtz34OUWmIwpBTWDxaRPXrIXkgvmQ==
-playwright@1.51.1:
- version "1.51.1"
- resolved "https://registry.yarnpkg.com/playwright/-/playwright-1.51.1.tgz#ae1467ee318083968ad28d6990db59f47a55390f"
- integrity sha512-kkx+MB2KQRkyxjYPc3a0wLZZoDczmppyGJIvQ43l+aZihkaVvmu/21kiyaHeHjiFxjxNNFnUncKmcGIyOojsaw==
+playwright@1.56.1:
+ version "1.56.1"
+ resolved "https://registry.yarnpkg.com/playwright/-/playwright-1.56.1.tgz#62e3b99ddebed0d475e5936a152c88e68be55fbf"
+ integrity sha512-aFi5B0WovBHTEvpM3DzXTUaeN6eN0qWnTkKx4NQaH4Wvcmc153PdaY2UBdSYKaGYw+UyWXSVyxDUg5DoPEttjw==
dependencies:
- playwright-core "1.51.1"
+ playwright-core "1.56.1"
optionalDependencies:
fsevents "2.3.2"
@@ -3137,12 +3582,12 @@ re-resizable@^6.9.16:
resolved "https://registry.yarnpkg.com/re-resizable/-/re-resizable-6.10.0.tgz#d684a096ab438f1a93f59ad3a580a206b0ce31ee"
integrity sha512-hysSK0xmA5nz24HBVztlk4yCqCLCvS32E6ZpWxVKop9x3tqCa4yAj1++facrmkOf62JsJHjmjABdKxXofYioCw==
-react-dom@^19.0.0:
- version "19.0.0"
- resolved "https://registry.yarnpkg.com/react-dom/-/react-dom-19.0.0.tgz#43446f1f01c65a4cd7f7588083e686a6726cfb57"
- integrity sha512-4GV5sHFG0e/0AD4X+ySy6UJd3jVl1iNsNHdpad0qhABJ11twS3TTBnseqsKurKcsNqCEFeGL3uLpVChpIO3QfQ==
+react-dom@19.2.3:
+ version "19.2.3"
+ resolved "https://registry.yarnpkg.com/react-dom/-/react-dom-19.2.3.tgz#f0b61d7e5c4a86773889fcc1853af3ed5f215b17"
+ integrity sha512-yELu4WmLPw5Mr/lmeEpox5rw3RETacE++JgHqQzd2dg+YbJuat3jH4ingc+WPZhxaoFzdv9y33G+F7Nl5O0GBg==
dependencies:
- scheduler "^0.25.0"
+ scheduler "^0.27.0"
react-is@^16.13.1:
version "16.13.1"
@@ -3154,10 +3599,10 @@ react-is@^18.0.0:
resolved "https://registry.yarnpkg.com/react-is/-/react-is-18.3.1.tgz#e83557dc12eae63a99e003a46388b1dcbb44db7e"
integrity sha512-/LLMVyas0ljjAtoYiPqYiL8VWXzUUdThrmU5+n20DZv+a+ClRoevUzw5JxU+Ieh5/c87ytoTBV9G1FiKfNJdmg==
-react@^19.0.0:
- version "19.0.0"
- resolved "https://registry.yarnpkg.com/react/-/react-19.0.0.tgz#6e1969251b9f108870aa4bff37a0ce9ddfaaabdd"
- integrity sha512-V8AVnmPIICiWpGfm6GLzCR/W5FXLchHop40W4nXBmdlEceh16rCN8O8LNWm5bh5XUX91fh7KpA+W0TgMKmgTpQ==
+react@19.2.3:
+ version "19.2.3"
+ resolved "https://registry.yarnpkg.com/react/-/react-19.2.3.tgz#d83e5e8e7a258cf6b4fe28640515f99b87cd19b8"
+ integrity sha512-Ku/hhYbVjOQnXDZFv2+RibmLFGwFdeeKHFcOTlrt7xplBnya5OGn/hIRDsqDiSUcfORsDC7MPxwork8jBwsIWA==
read-cache@^1.0.0:
version "1.0.0"
@@ -3186,6 +3631,20 @@ reflect.getprototypeof@^1.0.4:
globalthis "^1.0.3"
which-builtin-type "^1.1.3"
+reflect.getprototypeof@^1.0.6, reflect.getprototypeof@^1.0.9:
+ version "1.0.10"
+ resolved "https://registry.yarnpkg.com/reflect.getprototypeof/-/reflect.getprototypeof-1.0.10.tgz#c629219e78a3316d8b604c765ef68996964e7bf9"
+ integrity sha512-00o4I+DVrefhv+nX0ulyi3biSHCPDe+yLv5o/p6d/UVlirijB8E16FtfwSAi4g3tcqrQ4lRAqQSoFEZJehYEcw==
+ dependencies:
+ call-bind "^1.0.8"
+ define-properties "^1.2.1"
+ es-abstract "^1.23.9"
+ es-errors "^1.3.0"
+ es-object-atoms "^1.0.0"
+ get-intrinsic "^1.2.7"
+ get-proto "^1.0.1"
+ which-builtin-type "^1.2.1"
+
regenerator-runtime@^0.14.0:
version "0.14.1"
resolved "https://registry.yarnpkg.com/regenerator-runtime/-/regenerator-runtime-0.14.1.tgz#356ade10263f685dda125100cd862c1db895327f"
@@ -3201,6 +3660,18 @@ regexp.prototype.flags@^1.5.1, regexp.prototype.flags@^1.5.2:
es-errors "^1.3.0"
set-function-name "^2.0.1"
+regexp.prototype.flags@^1.5.3, regexp.prototype.flags@^1.5.4:
+ version "1.5.4"
+ resolved "https://registry.yarnpkg.com/regexp.prototype.flags/-/regexp.prototype.flags-1.5.4.tgz#1ad6c62d44a259007e55b3970e00f746efbcaa19"
+ integrity sha512-dYqgNSZbDwkaJ2ceRd9ojCGjBq+mOm9LmtXnAnEGyHhN/5R7iDW2TRw3h+o/jCFxus3P2LfWIIiwowAjANm7IA==
+ dependencies:
+ call-bind "^1.0.8"
+ define-properties "^1.2.1"
+ es-errors "^1.3.0"
+ get-proto "^1.0.1"
+ gopd "^1.2.0"
+ set-function-name "^2.0.2"
+
require-directory@^2.1.1:
version "2.1.1"
resolved "https://registry.yarnpkg.com/require-directory/-/require-directory-2.1.1.tgz#8c64ad5fd30dab1c976e2344ffe7f792a6a6df42"
@@ -3270,6 +3741,25 @@ safe-array-concat@^1.1.2:
has-symbols "^1.0.3"
isarray "^2.0.5"
+safe-array-concat@^1.1.3:
+ version "1.1.3"
+ resolved "https://registry.yarnpkg.com/safe-array-concat/-/safe-array-concat-1.1.3.tgz#c9e54ec4f603b0bbb8e7e5007a5ee7aecd1538c3"
+ integrity sha512-AURm5f0jYEOydBj7VQlVvDrjeFgthDdEF5H1dP+6mNpoXOMo1quQqJ4wvJDyRZ9+pO3kGWoOdmV08cSv2aJV6Q==
+ dependencies:
+ call-bind "^1.0.8"
+ call-bound "^1.0.2"
+ get-intrinsic "^1.2.6"
+ has-symbols "^1.1.0"
+ isarray "^2.0.5"
+
+safe-push-apply@^1.0.0:
+ version "1.0.0"
+ resolved "https://registry.yarnpkg.com/safe-push-apply/-/safe-push-apply-1.0.0.tgz#01850e981c1602d398c85081f360e4e6d03d27f5"
+ integrity sha512-iKE9w/Z7xCzUMIZqdBsp6pEQvwuEebH4vdpjcDWnyzaI6yl6O9FHvVpmGelvEHNsoY6wGblkxR6Zty/h00WiSA==
+ dependencies:
+ es-errors "^1.3.0"
+ isarray "^2.0.5"
+
safe-regex-test@^1.0.3:
version "1.0.3"
resolved "https://registry.yarnpkg.com/safe-regex-test/-/safe-regex-test-1.0.3.tgz#a5b4c0f06e0ab50ea2c395c14d8371232924c377"
@@ -3279,10 +3769,19 @@ safe-regex-test@^1.0.3:
es-errors "^1.3.0"
is-regex "^1.1.4"
-scheduler@^0.25.0:
- version "0.25.0"
- resolved "https://registry.yarnpkg.com/scheduler/-/scheduler-0.25.0.tgz#336cd9768e8cceebf52d3c80e3dcf5de23e7e015"
- integrity sha512-xFVuu11jh+xcO7JOAGJNOXld8/TcEHK/4CituBUeUb5hqxJLj9YuemAEuvm9gQ/+pgXYfbQuqAkiYu+u7YEsNA==
+safe-regex-test@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/safe-regex-test/-/safe-regex-test-1.1.0.tgz#7f87dfb67a3150782eaaf18583ff5d1711ac10c1"
+ integrity sha512-x/+Cz4YrimQxQccJf5mKEbIa1NzeCRNI5Ecl/ekmlYaampdNLPalVyIcCZNNH3MvmqBugV5TMYZXv0ljslUlaw==
+ dependencies:
+ call-bound "^1.0.2"
+ es-errors "^1.3.0"
+ is-regex "^1.2.1"
+
+scheduler@^0.27.0:
+ version "0.27.0"
+ resolved "https://registry.npmjs.org/scheduler/-/scheduler-0.27.0.tgz#0c4ef82d67d1e5c1e359e8fc76d3a87f045fe5bd"
+ integrity sha512-eNv+WrVbKu1f3vbYJT/xtiF5syA5HPIMtf9IgY/nKg0sWqzAUEvqY/xm7OcZc/qafLx/iO9FgOmeSAp4v5ti/Q==
semver@^6.3.1:
version "6.3.1"
@@ -3294,7 +3793,12 @@ semver@^7.6.0, semver@^7.6.3:
resolved "https://registry.yarnpkg.com/semver/-/semver-7.6.3.tgz#980f7b5550bc175fb4dc09403085627f9eb33143"
integrity sha512-oVekP1cKtI+CTDvHWYFUcMtsK/00wmAEfyqKfNdARm8u1wNVhSgaX7A8d4UuIlUI5e84iEwOhs7ZPYRmzU9U6A==
-set-function-length@^1.2.1:
+semver@^7.7.2:
+ version "7.7.2"
+ resolved "https://registry.yarnpkg.com/semver/-/semver-7.7.2.tgz#67d99fdcd35cec21e6f8b87a7fd515a33f982b58"
+ integrity sha512-RF0Fw+rO5AMf9MAyaRXI4AV0Ulj5lMHqVxxdSgiVbixSCXoEmmX/jk0CuJw4+3SqroYO9VoUh+HcuJivvtJemA==
+
+set-function-length@^1.2.1, set-function-length@^1.2.2:
version "1.2.2"
resolved "https://registry.yarnpkg.com/set-function-length/-/set-function-length-1.2.2.tgz#aac72314198eaed975cf77b2c3b6b880695e5449"
integrity sha512-pgRc4hJ4/sNjWCSS9AmnS40x3bNMDTknHgL5UaMBTMyJnU90EgWh1Rz+MC9eFu4BuN/UwZjKQuY/1v3rM7HMfg==
@@ -3316,34 +3820,46 @@ set-function-name@^2.0.1, set-function-name@^2.0.2:
functions-have-names "^1.2.3"
has-property-descriptors "^1.0.2"
-sharp@^0.33.5:
- version "0.33.5"
- resolved "https://registry.yarnpkg.com/sharp/-/sharp-0.33.5.tgz#13e0e4130cc309d6a9497596715240b2ec0c594e"
- integrity sha512-haPVm1EkS9pgvHrQ/F3Xy+hgcuMV0Wm9vfIBSiwZ05k+xgb0PkBQpGsAA/oWdDobNaZTH5ppvHtzCFbnSEwHVw==
+set-proto@^1.0.0:
+ version "1.0.0"
+ resolved "https://registry.yarnpkg.com/set-proto/-/set-proto-1.0.0.tgz#0760dbcff30b2d7e801fd6e19983e56da337565e"
+ integrity sha512-RJRdvCo6IAnPdsvP/7m6bsQqNnn1FCBX5ZNtFL98MmFF/4xAIJTIg1YbHW5DC2W5SKZanrC6i4HsJqlajw/dZw==
+ dependencies:
+ dunder-proto "^1.0.1"
+ es-errors "^1.3.0"
+ es-object-atoms "^1.0.0"
+
+sharp@^0.34.3:
+ version "0.34.3"
+ resolved "https://registry.yarnpkg.com/sharp/-/sharp-0.34.3.tgz#10a03bcd15fb72f16355461af0b9245ccb8a5da3"
+ integrity sha512-eX2IQ6nFohW4DbvHIOLRB3MHFpYqaqvXd3Tp5e/T/dSH83fxaNJQRvDMhASmkNTsNTVF2/OOopzRCt7xokgPfg==
dependencies:
color "^4.2.3"
- detect-libc "^2.0.3"
- semver "^7.6.3"
+ detect-libc "^2.0.4"
+ semver "^7.7.2"
optionalDependencies:
- "@img/sharp-darwin-arm64" "0.33.5"
- "@img/sharp-darwin-x64" "0.33.5"
- "@img/sharp-libvips-darwin-arm64" "1.0.4"
- "@img/sharp-libvips-darwin-x64" "1.0.4"
- "@img/sharp-libvips-linux-arm" "1.0.5"
- "@img/sharp-libvips-linux-arm64" "1.0.4"
- "@img/sharp-libvips-linux-s390x" "1.0.4"
- "@img/sharp-libvips-linux-x64" "1.0.4"
- "@img/sharp-libvips-linuxmusl-arm64" "1.0.4"
- "@img/sharp-libvips-linuxmusl-x64" "1.0.4"
- "@img/sharp-linux-arm" "0.33.5"
- "@img/sharp-linux-arm64" "0.33.5"
- "@img/sharp-linux-s390x" "0.33.5"
- "@img/sharp-linux-x64" "0.33.5"
- "@img/sharp-linuxmusl-arm64" "0.33.5"
- "@img/sharp-linuxmusl-x64" "0.33.5"
- "@img/sharp-wasm32" "0.33.5"
- "@img/sharp-win32-ia32" "0.33.5"
- "@img/sharp-win32-x64" "0.33.5"
+ "@img/sharp-darwin-arm64" "0.34.3"
+ "@img/sharp-darwin-x64" "0.34.3"
+ "@img/sharp-libvips-darwin-arm64" "1.2.0"
+ "@img/sharp-libvips-darwin-x64" "1.2.0"
+ "@img/sharp-libvips-linux-arm" "1.2.0"
+ "@img/sharp-libvips-linux-arm64" "1.2.0"
+ "@img/sharp-libvips-linux-ppc64" "1.2.0"
+ "@img/sharp-libvips-linux-s390x" "1.2.0"
+ "@img/sharp-libvips-linux-x64" "1.2.0"
+ "@img/sharp-libvips-linuxmusl-arm64" "1.2.0"
+ "@img/sharp-libvips-linuxmusl-x64" "1.2.0"
+ "@img/sharp-linux-arm" "0.34.3"
+ "@img/sharp-linux-arm64" "0.34.3"
+ "@img/sharp-linux-ppc64" "0.34.3"
+ "@img/sharp-linux-s390x" "0.34.3"
+ "@img/sharp-linux-x64" "0.34.3"
+ "@img/sharp-linuxmusl-arm64" "0.34.3"
+ "@img/sharp-linuxmusl-x64" "0.34.3"
+ "@img/sharp-wasm32" "0.34.3"
+ "@img/sharp-win32-arm64" "0.34.3"
+ "@img/sharp-win32-ia32" "0.34.3"
+ "@img/sharp-win32-x64" "0.34.3"
shebang-command@^2.0.0:
version "2.0.0"
@@ -3362,7 +3878,36 @@ shell-quote@^1.7.3:
resolved "https://registry.yarnpkg.com/shell-quote/-/shell-quote-1.8.1.tgz#6dbf4db75515ad5bac63b4f1894c3a154c766680"
integrity sha512-6j1W9l1iAs/4xYBI1SYOVZyFcCis9b4KCLQ8fgAGG07QvzaRLVVRQvAy85yNmmZSjYjg4MWh4gNvlPujU/5LpA==
-side-channel@^1.0.4, side-channel@^1.0.6:
+side-channel-list@^1.0.0:
+ version "1.0.0"
+ resolved "https://registry.yarnpkg.com/side-channel-list/-/side-channel-list-1.0.0.tgz#10cb5984263115d3b7a0e336591e290a830af8ad"
+ integrity sha512-FCLHtRD/gnpCiCHEiJLOwdmFP+wzCmDEkc9y7NsYxeF4u7Btsn1ZuwgwJGxImImHicJArLP4R0yX4c2KCrMrTA==
+ dependencies:
+ es-errors "^1.3.0"
+ object-inspect "^1.13.3"
+
+side-channel-map@^1.0.1:
+ version "1.0.1"
+ resolved "https://registry.yarnpkg.com/side-channel-map/-/side-channel-map-1.0.1.tgz#d6bb6b37902c6fef5174e5f533fab4c732a26f42"
+ integrity sha512-VCjCNfgMsby3tTdo02nbjtM/ewra6jPHmpThenkTYh8pG9ucZ/1P8So4u4FGBek/BjpOVsDCMoLA/iuBKIFXRA==
+ dependencies:
+ call-bound "^1.0.2"
+ es-errors "^1.3.0"
+ get-intrinsic "^1.2.5"
+ object-inspect "^1.13.3"
+
+side-channel-weakmap@^1.0.2:
+ version "1.0.2"
+ resolved "https://registry.yarnpkg.com/side-channel-weakmap/-/side-channel-weakmap-1.0.2.tgz#11dda19d5368e40ce9ec2bdc1fb0ecbc0790ecea"
+ integrity sha512-WPS/HvHQTYnHisLo9McqBHOJk2FkHO/tlpvldyrnem4aeQp4hai3gythswg6p01oSoTl58rcpiFAjF2br2Ak2A==
+ dependencies:
+ call-bound "^1.0.2"
+ es-errors "^1.3.0"
+ get-intrinsic "^1.2.5"
+ object-inspect "^1.13.3"
+ side-channel-map "^1.0.1"
+
+side-channel@^1.0.4:
version "1.0.6"
resolved "https://registry.yarnpkg.com/side-channel/-/side-channel-1.0.6.tgz#abd25fb7cd24baf45466406b1096b7831c9215f2"
integrity sha512-fDW/EZ6Q9RiO8eFG8Hj+7u/oW+XrPTIChwCOM2+th2A6OblDtYYIpve9m+KvI9Z4C9qSEXlaGR6bTEYHReuglA==
@@ -3372,6 +3917,17 @@ side-channel@^1.0.4, side-channel@^1.0.6:
get-intrinsic "^1.2.4"
object-inspect "^1.13.1"
+side-channel@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/side-channel/-/side-channel-1.1.0.tgz#c3fcff9c4da932784873335ec9765fa94ff66bc9"
+ integrity sha512-ZX99e6tRweoUXqR+VBrslhda51Nh5MTQwou5tnUDgbtyM0dBgmhEDtWGP/xbKn6hqfPRHujUNwz5fy/wbbhnpw==
+ dependencies:
+ es-errors "^1.3.0"
+ object-inspect "^1.13.3"
+ side-channel-list "^1.0.0"
+ side-channel-map "^1.0.1"
+ side-channel-weakmap "^1.0.2"
+
signal-exit@^4.0.1:
version "4.1.0"
resolved "https://registry.yarnpkg.com/signal-exit/-/signal-exit-4.1.0.tgz#952188c1cbd546070e2dd20d0f41c0ae0530cb04"
@@ -3406,10 +3962,13 @@ stop-iteration-iterator@^1.0.0:
dependencies:
internal-slot "^1.0.4"
-streamsearch@^1.1.0:
+stop-iteration-iterator@^1.1.0:
version "1.1.0"
- resolved "https://registry.yarnpkg.com/streamsearch/-/streamsearch-1.1.0.tgz#404dd1e2247ca94af554e841a8ef0eaa238da764"
- integrity sha512-Mcc5wHehp9aXz1ax6bZUyY5afg9u2rv5cqQI3mRrYkGC8rW2hM02jWuwjtL++LS5qinSyhj2QfLyNsuc+VsExg==
+ resolved "https://registry.yarnpkg.com/stop-iteration-iterator/-/stop-iteration-iterator-1.1.0.tgz#f481ff70a548f6124d0312c3aa14cbfa7aa542ad"
+ integrity sha512-eLoXW/DHyl62zxY4SCaIgnRhuMr6ri4juEYARS8E6sCEqzKpOiE521Ucofdx+KnDZl5xmvGYaaKCk5FEOxJCoQ==
+ dependencies:
+ es-errors "^1.3.0"
+ internal-slot "^1.1.0"
"string-width-cjs@npm:string-width@^4.2.0":
version "4.2.3"
@@ -3446,23 +4005,24 @@ string.prototype.includes@^2.0.0:
define-properties "^1.1.3"
es-abstract "^1.17.5"
-string.prototype.matchall@^4.0.11:
- version "4.0.11"
- resolved "https://registry.yarnpkg.com/string.prototype.matchall/-/string.prototype.matchall-4.0.11.tgz#1092a72c59268d2abaad76582dccc687c0297e0a"
- integrity sha512-NUdh0aDavY2og7IbBPenWqR9exH+E26Sv8e0/eTe1tltDGZL+GtBkDAnnyBtmekfK6/Dq3MkcGtzXFEd1LQrtg==
+string.prototype.matchall@^4.0.12:
+ version "4.0.12"
+ resolved "https://registry.yarnpkg.com/string.prototype.matchall/-/string.prototype.matchall-4.0.12.tgz#6c88740e49ad4956b1332a911e949583a275d4c0"
+ integrity sha512-6CC9uyBL+/48dYizRf7H7VAYCMCNTBeM78x/VTUe9bFEaxBepPJDa1Ow99LqI/1yF7kuy7Q3cQsYMrcjGUcskA==
dependencies:
- call-bind "^1.0.7"
+ call-bind "^1.0.8"
+ call-bound "^1.0.3"
define-properties "^1.2.1"
- es-abstract "^1.23.2"
+ es-abstract "^1.23.6"
es-errors "^1.3.0"
es-object-atoms "^1.0.0"
- get-intrinsic "^1.2.4"
- gopd "^1.0.1"
- has-symbols "^1.0.3"
- internal-slot "^1.0.7"
- regexp.prototype.flags "^1.5.2"
+ get-intrinsic "^1.2.6"
+ gopd "^1.2.0"
+ has-symbols "^1.1.0"
+ internal-slot "^1.1.0"
+ regexp.prototype.flags "^1.5.3"
set-function-name "^2.0.2"
- side-channel "^1.0.6"
+ side-channel "^1.1.0"
string.prototype.repeat@^1.0.0:
version "1.0.0"
@@ -3472,6 +4032,19 @@ string.prototype.repeat@^1.0.0:
define-properties "^1.1.3"
es-abstract "^1.17.5"
+string.prototype.trim@^1.2.10:
+ version "1.2.10"
+ resolved "https://registry.yarnpkg.com/string.prototype.trim/-/string.prototype.trim-1.2.10.tgz#40b2dd5ee94c959b4dcfb1d65ce72e90da480c81"
+ integrity sha512-Rs66F0P/1kedk5lyYyH9uBzuiI/kNRmwJAR9quK6VOtIpZ2G+hMZd+HQbbv25MgCA6gEffoMZYxlTod4WcdrKA==
+ dependencies:
+ call-bind "^1.0.8"
+ call-bound "^1.0.2"
+ define-data-property "^1.1.4"
+ define-properties "^1.2.1"
+ es-abstract "^1.23.5"
+ es-object-atoms "^1.0.0"
+ has-property-descriptors "^1.0.2"
+
string.prototype.trim@^1.2.9:
version "1.2.9"
resolved "https://registry.yarnpkg.com/string.prototype.trim/-/string.prototype.trim-1.2.9.tgz#b6fa326d72d2c78b6df02f7759c73f8f6274faa4"
@@ -3491,6 +4064,16 @@ string.prototype.trimend@^1.0.8:
define-properties "^1.2.1"
es-object-atoms "^1.0.0"
+string.prototype.trimend@^1.0.9:
+ version "1.0.9"
+ resolved "https://registry.yarnpkg.com/string.prototype.trimend/-/string.prototype.trimend-1.0.9.tgz#62e2731272cd285041b36596054e9f66569b6942"
+ integrity sha512-G7Ok5C6E/j4SGfyLCloXTrngQIQU3PWtXGst3yM7Bea9FRURf1S42ZHlZZtsNque2FN2PoUhfZXYLNWwEr4dLQ==
+ dependencies:
+ call-bind "^1.0.8"
+ call-bound "^1.0.2"
+ define-properties "^1.2.1"
+ es-object-atoms "^1.0.0"
+
string.prototype.trimstart@^1.0.8:
version "1.0.8"
resolved "https://registry.yarnpkg.com/string.prototype.trimstart/-/string.prototype.trimstart-1.0.8.tgz#7ee834dda8c7c17eff3118472bb35bfedaa34dde"
@@ -3692,6 +4275,15 @@ typed-array-buffer@^1.0.2:
es-errors "^1.3.0"
is-typed-array "^1.1.13"
+typed-array-buffer@^1.0.3:
+ version "1.0.3"
+ resolved "https://registry.yarnpkg.com/typed-array-buffer/-/typed-array-buffer-1.0.3.tgz#a72395450a4869ec033fd549371b47af3a2ee536"
+ integrity sha512-nAYYwfY3qnzX30IkA6AQZjVbtK6duGontcQm1WSG1MD94YLqK0515GNApXkoxKOWMusVssAHWLh9SeaoefYFGw==
+ dependencies:
+ call-bound "^1.0.3"
+ es-errors "^1.3.0"
+ is-typed-array "^1.1.14"
+
typed-array-byte-length@^1.0.1:
version "1.0.1"
resolved "https://registry.yarnpkg.com/typed-array-byte-length/-/typed-array-byte-length-1.0.1.tgz#d92972d3cff99a3fa2e765a28fcdc0f1d89dec67"
@@ -3703,6 +4295,17 @@ typed-array-byte-length@^1.0.1:
has-proto "^1.0.3"
is-typed-array "^1.1.13"
+typed-array-byte-length@^1.0.3:
+ version "1.0.3"
+ resolved "https://registry.yarnpkg.com/typed-array-byte-length/-/typed-array-byte-length-1.0.3.tgz#8407a04f7d78684f3d252aa1a143d2b77b4160ce"
+ integrity sha512-BaXgOuIxz8n8pIq3e7Atg/7s+DpiYrxn4vdot3w9KbnBhcRQq6o3xemQdIfynqSeXeDrF32x+WvfzmOjPiY9lg==
+ dependencies:
+ call-bind "^1.0.8"
+ for-each "^0.3.3"
+ gopd "^1.2.0"
+ has-proto "^1.2.0"
+ is-typed-array "^1.1.14"
+
typed-array-byte-offset@^1.0.2:
version "1.0.2"
resolved "https://registry.yarnpkg.com/typed-array-byte-offset/-/typed-array-byte-offset-1.0.2.tgz#f9ec1acb9259f395093e4567eb3c28a580d02063"
@@ -3715,6 +4318,19 @@ typed-array-byte-offset@^1.0.2:
has-proto "^1.0.3"
is-typed-array "^1.1.13"
+typed-array-byte-offset@^1.0.4:
+ version "1.0.4"
+ resolved "https://registry.yarnpkg.com/typed-array-byte-offset/-/typed-array-byte-offset-1.0.4.tgz#ae3698b8ec91a8ab945016108aef00d5bff12355"
+ integrity sha512-bTlAFB/FBYMcuX81gbL4OcpH5PmlFHqlCCpAl8AlEzMz5k53oNDvN8p1PNOWLEmI2x4orp3raOFB51tv9X+MFQ==
+ dependencies:
+ available-typed-arrays "^1.0.7"
+ call-bind "^1.0.8"
+ for-each "^0.3.3"
+ gopd "^1.2.0"
+ has-proto "^1.2.0"
+ is-typed-array "^1.1.15"
+ reflect.getprototypeof "^1.0.9"
+
typed-array-length@^1.0.6:
version "1.0.6"
resolved "https://registry.yarnpkg.com/typed-array-length/-/typed-array-length-1.0.6.tgz#57155207c76e64a3457482dfdc1c9d1d3c4c73a3"
@@ -3727,6 +4343,18 @@ typed-array-length@^1.0.6:
is-typed-array "^1.1.13"
possible-typed-array-names "^1.0.0"
+typed-array-length@^1.0.7:
+ version "1.0.7"
+ resolved "https://registry.yarnpkg.com/typed-array-length/-/typed-array-length-1.0.7.tgz#ee4deff984b64be1e118b0de8c9c877d5ce73d3d"
+ integrity sha512-3KS2b+kL7fsuk/eJZ7EQdnEmQoaho/r6KUef7hxvltNA5DR8NAUM+8wJMbJyZ4G9/7i3v5zPBIMN5aybAh2/Jg==
+ dependencies:
+ call-bind "^1.0.7"
+ for-each "^0.3.3"
+ gopd "^1.0.1"
+ is-typed-array "^1.1.13"
+ possible-typed-array-names "^1.0.0"
+ reflect.getprototypeof "^1.0.6"
+
unbox-primitive@^1.0.2:
version "1.0.2"
resolved "https://registry.yarnpkg.com/unbox-primitive/-/unbox-primitive-1.0.2.tgz#29032021057d5e6cdbd08c5129c226dff8ed6f9e"
@@ -3737,6 +4365,16 @@ unbox-primitive@^1.0.2:
has-symbols "^1.0.3"
which-boxed-primitive "^1.0.2"
+unbox-primitive@^1.1.0:
+ version "1.1.0"
+ resolved "https://registry.yarnpkg.com/unbox-primitive/-/unbox-primitive-1.1.0.tgz#8d9d2c9edeea8460c7f35033a88867944934d1e2"
+ integrity sha512-nWJ91DjeOkej/TA8pXQ3myruKpKEYgqvpw9lz4OPHj/NWFNluYrjbz9j01CJ8yKQd2g4jFoOkINCTW2I5LEEyw==
+ dependencies:
+ call-bound "^1.0.3"
+ has-bigints "^1.0.2"
+ has-symbols "^1.1.0"
+ which-boxed-primitive "^1.1.1"
+
update-browserslist-db@^1.1.0:
version "1.1.0"
resolved "https://registry.yarnpkg.com/update-browserslist-db/-/update-browserslist-db-1.1.0.tgz#7ca61c0d8650766090728046e416a8cde682859e"
@@ -3779,6 +4417,17 @@ which-boxed-primitive@^1.0.2:
is-string "^1.0.5"
is-symbol "^1.0.3"
+which-boxed-primitive@^1.1.0, which-boxed-primitive@^1.1.1:
+ version "1.1.1"
+ resolved "https://registry.yarnpkg.com/which-boxed-primitive/-/which-boxed-primitive-1.1.1.tgz#d76ec27df7fa165f18d5808374a5fe23c29b176e"
+ integrity sha512-TbX3mj8n0odCBFVlY8AxkqcHASw3L60jIuF8jFP78az3C2YhmGvqbHBpAjTRH2/xqYunrJ9g1jSyjCjpoWzIAA==
+ dependencies:
+ is-bigint "^1.1.0"
+ is-boolean-object "^1.2.1"
+ is-number-object "^1.1.1"
+ is-string "^1.1.1"
+ is-symbol "^1.1.1"
+
which-builtin-type@^1.1.3:
version "1.1.4"
resolved "https://registry.yarnpkg.com/which-builtin-type/-/which-builtin-type-1.1.4.tgz#592796260602fc3514a1b5ee7fa29319b72380c3"
@@ -3797,6 +4446,25 @@ which-builtin-type@^1.1.3:
which-collection "^1.0.2"
which-typed-array "^1.1.15"
+which-builtin-type@^1.2.1:
+ version "1.2.1"
+ resolved "https://registry.yarnpkg.com/which-builtin-type/-/which-builtin-type-1.2.1.tgz#89183da1b4907ab089a6b02029cc5d8d6574270e"
+ integrity sha512-6iBczoX+kDQ7a3+YJBnh3T+KZRxM/iYNPXicqk66/Qfm1b93iu+yOImkg0zHbj5LNOcNv1TEADiZ0xa34B4q6Q==
+ dependencies:
+ call-bound "^1.0.2"
+ function.prototype.name "^1.1.6"
+ has-tostringtag "^1.0.2"
+ is-async-function "^2.0.0"
+ is-date-object "^1.1.0"
+ is-finalizationregistry "^1.1.0"
+ is-generator-function "^1.0.10"
+ is-regex "^1.2.1"
+ is-weakref "^1.0.2"
+ isarray "^2.0.5"
+ which-boxed-primitive "^1.1.0"
+ which-collection "^1.0.2"
+ which-typed-array "^1.1.16"
+
which-collection@^1.0.1, which-collection@^1.0.2:
version "1.0.2"
resolved "https://registry.yarnpkg.com/which-collection/-/which-collection-1.0.2.tgz#627ef76243920a107e7ce8e96191debe4b16c2a0"
@@ -3818,6 +4486,19 @@ which-typed-array@^1.1.13, which-typed-array@^1.1.14, which-typed-array@^1.1.15:
gopd "^1.0.1"
has-tostringtag "^1.0.2"
+which-typed-array@^1.1.16, which-typed-array@^1.1.19:
+ version "1.1.19"
+ resolved "https://registry.yarnpkg.com/which-typed-array/-/which-typed-array-1.1.19.tgz#df03842e870b6b88e117524a4b364b6fc689f956"
+ integrity sha512-rEvr90Bck4WZt9HHFC4DJMsjvu7x+r6bImz0/BrbWb7A2djJ8hnZMrWnHo9F8ssv0OMErasDhftrfROTyqSDrw==
+ dependencies:
+ available-typed-arrays "^1.0.7"
+ call-bind "^1.0.8"
+ call-bound "^1.0.4"
+ for-each "^0.3.5"
+ get-proto "^1.0.1"
+ gopd "^1.2.0"
+ has-tostringtag "^1.0.2"
+
which@^2.0.1:
version "2.0.2"
resolved "https://registry.yarnpkg.com/which/-/which-2.0.2.tgz#7c6a8dd0a636a0327e10b59c9286eee93f3f51b1"
diff --git a/compiler/docs/DESIGN_GOALS.md b/compiler/docs/DESIGN_GOALS.md
index 76d19e25c084..7044f72b07b2 100644
--- a/compiler/docs/DESIGN_GOALS.md
+++ b/compiler/docs/DESIGN_GOALS.md
@@ -8,7 +8,7 @@ The idea of React Compiler is to allow developers to use React's familiar declar
* Bound the amount of re-rendering that happens on updates to ensure that apps have predictably fast performance by default.
* Keep startup time neutral with pre-React Compiler performance. Notably, this means holding code size increases and memoization overhead low enough to not impact startup.
-* Retain React's familiar declarative, component-oriented programming model. Ie, the solution should not fundamentally change how developers think about writing React, and should generally _remove_ concepts (the need to use React.memo(), useMemo(), and useCallback()) rather than introduce new concepts.
+* Retain React's familiar declarative, component-oriented programming model. i.e, the solution should not fundamentally change how developers think about writing React, and should generally _remove_ concepts (the need to use React.memo(), useMemo(), and useCallback()) rather than introduce new concepts.
* "Just work" on idiomatic React code that follows React's rules (pure render functions, the rules of hooks, etc).
* Support typical debugging and profiling tools and workflows.
* Be predictable and understandable enough by React developers β i.e. developers should be able to quickly develop a rough intuition of how React Compiler works.
@@ -19,7 +19,7 @@ The idea of React Compiler is to allow developers to use React's familiar declar
The following are explicitly *not* goals for React Compiler:
* Provide perfectly optimal re-rendering with zero unnecessary recomputation. This is a non-goal for several reasons:
- * The runtime overhead of the extra tracking involved can outweight the cost of recomputation in many cases.
+ * The runtime overhead of the extra tracking involved can outweigh the cost of recomputation in many cases.
* In cases with conditional dependencies it may not be possible to avoid recomputing some/all instructions.
* The amount of code may regress startup times, which would conflict with our goal of neutral startup performance.
* Support code that violates React's rules. React's rules exist to help developers build robust, scalable applications and form a contract that allows us to continue improving React without breaking applications. React Compiler depends on these rules to safely transform code, and violations of rules will therefore break React Compiler's optimizations.
@@ -42,9 +42,9 @@ React Compiler has two primary public interfaces: a Babel plugin for transformin
The core of the compiler is largely decoupled from Babel, using its own intermediate representations. The high-level flow is as follows:
- **Babel Plugin**: Determines which functions in a file should be compiled, based on the plugin options and any local opt-in/opt-out directives. For each component or hook to be compiled, the plugin calls the compiler, passing in the original function and getting back a new AST node which will replace the original.
-- **Lowering** (BuildHIR): The first step of the compiler is to convert the Babel AST into React Compiler's primary intermediate representation, HIR (High-level Intermediate Representation). This phase is primarily based on the AST itself, but currently leans on Babel to resolve identifiers. The HIR preserves the precise order-of-evaluation semantics of JavaScript, resolves break/continue to their jump points, etc. The resulting HIR forms a control-flow graph of basic blocks, each of which contains zero or more consecutive instructions followed by a terminal. The basic blocks are stored in reverse postorder, such that forward iteration of the blocks allows predecessors to be visited before successors _unless_ there is a "back edge" (ie a loop).
+- **Lowering** (BuildHIR): The first step of the compiler is to convert the Babel AST into React Compiler's primary intermediate representation, HIR (High-level Intermediate Representation). This phase is primarily based on the AST itself, but currently leans on Babel to resolve identifiers. The HIR preserves the precise order-of-evaluation semantics of JavaScript, resolves break/continue to their jump points, etc. The resulting HIR forms a control-flow graph of basic blocks, each of which contains zero or more consecutive instructions followed by a terminal. The basic blocks are stored in reverse postorder, such that forward iteration of the blocks allows predecessors to be visited before successors _unless_ there is a "back edge" (i.e. a loop).
- **SSA Conversion** (EnterSSA): The HIR is converted to HIR form, such that all Identifiers in the HIR are updated to an SSA-based identifier.
-- Validation: We run various validation passes to check that the input is valid React, ie that it does not break the rules. This includes looking for conditional hook calls, unconditional setState calls, etc.
+- Validation: We run various validation passes to check that the input is valid React, i.e. that it does not break the rules. This includes looking for conditional hook calls, unconditional setState calls, etc.
- **Optimization**: Various passes such as dead code elimination and constant propagation can generally improve performance and reduce the amount of instructions to be optimized later.
- **Type Inference** (InferTypes): We run a conservative type inference pass to identify certain key types of data that may appear in the program that are relevant for further analysis, such as which values are hooks, primitives, etc.
- **Inferring Reactive Scopes**: Several passes are involved in determining groups of values that are created/mutated together and the set of instructions involved in creating/mutating those values. We call these groups "reactive scopes", and each can have one or more declarations (or occasionally a reassignment).
diff --git a/compiler/docs/DEVELOPMENT_GUIDE.md b/compiler/docs/DEVELOPMENT_GUIDE.md
index af3973fada86..a38d8436e68e 100644
--- a/compiler/docs/DEVELOPMENT_GUIDE.md
+++ b/compiler/docs/DEVELOPMENT_GUIDE.md
@@ -17,7 +17,32 @@ yarn snap:build
yarn snap --watch
```
-`snap` is our custom test runner, which creates "golden" test files that have the expected output for each input fixture, as well as the results of executing a specific input (or sequence of inputs) in both the uncompiled and compiler versions of the input.
+`snap` is our custom test runner, which creates "golden" test files that have the expected output for each input fixture, as well as the results of executing a specific input (or sequence of inputs) in both the uncompiled and compiler versions of the input.
+
+### Compiling Arbitrary Files
+
+You can compile any file (not just fixtures) using:
+
+```sh
+# Compile a file and see the output
+yarn snap compile
+
+# Compile with debug output to see the state after each compiler pass
+# This is an alternative to `yarn snap -d -p ` when you don't have a fixture file yet
+yarn snap compile --debug
+```
+
+### Minimizing Test Cases
+
+To reduce a failing test case to its minimal reproduction:
+
+```sh
+# Minimize a file that causes a compiler error
+yarn snap minimize
+
+# Minimize and update the file in-place
+yarn snap minimize --update
+```
When contributing changes, we prefer to:
* Add one or more fixtures that demonstrate the current compiled output for a particular combination of input and configuration. Send this as a first PR.
diff --git a/compiler/package.json b/compiler/package.json
index e3c3ee8c7f34..4492b7021080 100644
--- a/compiler/package.json
+++ b/compiler/package.json
@@ -19,7 +19,8 @@
"test": "yarn workspaces run test",
"snap": "yarn workspace babel-plugin-react-compiler run snap",
"snap:build": "yarn workspace snap run build",
- "npm:publish": "node scripts/release/publish"
+ "npm:publish": "node scripts/release/publish",
+ "eslint-docs": "yarn workspace babel-plugin-react-compiler build && node scripts/build-eslint-docs.js"
},
"dependencies": {
"fs-extra": "^4.0.2",
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/01-lower.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/01-lower.md
new file mode 100644
index 000000000000..b5b3d8f46e61
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/01-lower.md
@@ -0,0 +1,157 @@
+# lower (BuildHIR)
+
+## File
+`src/HIR/BuildHIR.ts`
+
+## Purpose
+Converts a Babel AST function node into a High-level Intermediate Representation (HIR), which represents code as a control-flow graph (CFG) with basic blocks, instructions, and terminals. This is the first major transformation pass in the React Compiler pipeline, enabling precise expression-level memoization analysis.
+
+## Input Invariants
+- Input must be a valid Babel `NodePath` (FunctionDeclaration, FunctionExpression, or ArrowFunctionExpression)
+- The function must be a component or hook (determined by the environment)
+- Babel scope analysis must be available for binding resolution
+- An `Environment` instance must be provided with compiler configuration
+- Optional `bindings` map for nested function lowering (recursive calls)
+- Optional `capturedRefs` map for context variables captured from outer scope
+
+## Output Guarantees
+- Returns `Result` - either a successfully lowered function or compilation errors
+- The HIR function contains:
+ - A complete CFG with basic blocks (`body.blocks: Map`)
+ - Each block has an array of instructions and exactly one terminal
+ - All control flow is explicit (if/else, loops, switch, logical operators, ternary)
+ - Parameters are converted to `Place` or `SpreadPattern`
+ - Context captures are tracked in `context` array
+ - Function metadata (id, async, generator, directives)
+- All identifiers get unique `IdentifierId` values
+- Instructions have placeholder instruction IDs (set to 0, assigned later)
+- Effects are null (populated by later inference passes)
+
+## Algorithm
+The lowering algorithm uses a recursive descent pattern with a `HIRBuilder` helper class:
+
+1. **Initialization**: Create an `HIRBuilder` with environment and optional bindings. Process captured context variables.
+
+2. **Parameter Processing**: For each function parameter:
+ - Simple identifiers: resolve binding and create Place
+ - Patterns (object/array): create temporary Place, then emit destructuring assignments
+ - Rest elements: wrap in SpreadPattern
+ - Unsupported: emit Todo error
+
+3. **Body Processing**:
+ - Arrow function expressions: lower body expression to temporary, emit implicit return
+ - Block statements: recursively lower each statement
+
+4. **Statement Lowering** (`lowerStatement`): Handle each statement type:
+ - **Control flow**: Create separate basic blocks for branches, loops connect back to conditional blocks
+ - **Variable declarations**: Create `DeclareLocal`/`DeclareContext` or `StoreLocal`/`StoreContext` instructions
+ - **Expressions**: Lower to temporary and discard result
+ - **Hoisting**: Detect forward references and emit `DeclareContext` for hoisted identifiers
+
+5. **Expression Lowering** (`lowerExpression`): Convert expressions to `InstructionValue`:
+ - **Identifiers**: Create `LoadLocal`, `LoadContext`, or `LoadGlobal` based on binding
+ - **Literals**: Create `Primitive` values
+ - **Operators**: Create `BinaryExpression`, `UnaryExpression` etc.
+ - **Calls**: Distinguish `CallExpression` vs `MethodCall` (member expression callee)
+ - **Control flow expressions**: Create separate value blocks for branches (ternary, logical, optional chaining)
+ - **JSX**: Lower to `JsxExpression` with lowered tag, props, and children
+
+6. **Block Management**: The builder maintains:
+ - A current work-in-progress block accumulating instructions
+ - Completed blocks map
+ - Scope stack for break/continue resolution
+ - Exception handler stack for try/catch
+
+7. **Termination**: Add implicit void return at end if no explicit return
+
+## Key Data Structures
+
+### HIRBuilder (from HIRBuilder.ts)
+- `#current: WipBlock` - Work-in-progress block being populated
+- `#completed: Map` - Finished blocks
+- `#scopes: Array` - Stack for break/continue target resolution (LoopScope, LabelScope, SwitchScope)
+- `#exceptionHandlerStack: Array` - Stack of catch handlers for try/catch
+- `#bindings: Bindings` - Map of variable names to their identifiers
+- `#context: Map` - Captured context variables
+- Methods: `push()`, `reserve()`, `enter()`, `terminate()`, `terminateWithContinuation()`
+
+### Core HIR Types
+- **BasicBlock**: Contains `instructions: Array`, `terminal: Terminal`, `preds: Set`, `phis: Set`, `kind: BlockKind`
+- **Instruction**: Contains `id`, `lvalue` (Place), `value` (InstructionValue), `effects` (null initially), `loc`
+- **Terminal**: Block terminator - `if`, `branch`, `goto`, `return`, `throw`, `for`, `while`, `switch`, `ternary`, `logical`, etc.
+- **Place**: Reference to a value - `{kind: 'Identifier', identifier, effect, reactive, loc}`
+- **InstructionValue**: The operation - `LoadLocal`, `StoreLocal`, `CallExpression`, `BinaryExpression`, `FunctionExpression`, etc.
+
+### Block Kinds
+- `block` - Regular sequential block
+- `loop` - Loop header/test block
+- `value` - Block that produces a value (ternary/logical branches)
+- `sequence` - Sequence expression block
+- `catch` - Exception handler block
+
+## Edge Cases
+
+1. **Hoisting**: Forward references to `let`/`const`/`function` declarations emit `DeclareContext` before the reference, enabling correct temporal dead zone handling
+
+2. **Context Variables**: Variables captured by nested functions use `LoadContext`/`StoreContext` instead of `LoadLocal`/`StoreLocal`
+
+3. **For-of/For-in Loops**: Synthesize iterator instructions (`GetIterator`, `IteratorNext`, `NextPropertyOf`)
+
+4. **Optional Chaining**: Creates nested `OptionalTerminal` structures with short-circuit branches
+
+5. **Logical Expressions**: Create branching structures where left side stores to temporary, right side only evaluated if needed
+
+6. **Try/Catch**: Adds `MaybeThrowTerminal` after each instruction in try block, modeling potential control flow to handler
+
+7. **JSX in fbt**: Tracks `fbtDepth` counter to handle whitespace differently in fbt/fbs tags
+
+8. **Unsupported Syntax**: `var` declarations, `with` statements, inline `class` declarations, `eval` - emit appropriate errors
+
+## TODOs
+- `returnTypeAnnotation: null, // TODO: extract the actual return type node if present`
+- `TODO(gsn): In the future, we could only pass in the context identifiers that are actually used by this function and its nested functions`
+- Multiple `// TODO remove type cast` in destructuring pattern handling
+- `// TODO: should JSX namespaced names be handled here as well?`
+
+## Example
+Input JavaScript:
+```javascript
+export default function foo(x, y) {
+ if (x) {
+ return foo(false, y);
+ }
+ return [y * 10];
+}
+```
+
+Output HIR (simplified):
+```
+foo( x$0, y$1): $12
+bb0 (block):
+ [1] $6 = LoadLocal x$0
+ [2] If ( $6) then:bb2 else:bb1 fallthrough=bb1
+
+bb2 (block):
+ predecessor blocks: bb0
+ [3] $2 = LoadGlobal(module) foo
+ [4] $3 = false
+ [5] $4 = LoadLocal y$1
+ [6] $5 = Call $2( $3, $4)
+ [7] Return Explicit $5
+
+bb1 (block):
+ predecessor blocks: bb0
+ [8] $7 = LoadLocal y$1
+ [9] $8 = 10
+ [10] $9 = Binary $7 * $8
+ [11] $10 = Array [ $9]
+ [12] Return Explicit $10
+```
+
+Key observations:
+- The function has 3 basic blocks: entry (bb0), consequent (bb2), alternate/fallthrough (bb1)
+- The if statement creates an `IfTerminal` at the end of bb0
+- Each branch ends with its own `ReturnTerminal`
+- All values are stored in temporaries (`$N`) or named identifiers (`x$0`, `y$1`)
+- Instructions have sequential IDs within blocks
+- Types and effects are `` at this stage (populated by later passes)
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/02-enterSSA.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/02-enterSSA.md
new file mode 100644
index 000000000000..d5e03b60d768
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/02-enterSSA.md
@@ -0,0 +1,182 @@
+# enterSSA
+
+## File
+`src/SSA/EnterSSA.ts`
+
+## Purpose
+Converts the HIR from a non-SSA form (where variables can be reassigned) into Static Single Assignment (SSA) form, where each variable is defined exactly once and phi nodes are inserted at control flow join points to merge values from different paths.
+
+## Input Invariants
+- The HIR must have blocks in reverse postorder (predecessors visited before successors, except for back-edges)
+- Block predecessor information (`block.preds`) must be populated correctly
+- The function's `context` array must be empty for the root function (outer function declarations)
+- Identifiers may be reused across multiple definitions/assignments (non-SSA form)
+
+## Output Guarantees
+- Each identifier has a unique `IdentifierId` - no identifier is defined more than once
+- All operand references use the SSA-renamed identifiers
+- Phi nodes are inserted at join points where values from different control flow paths converge
+- Function parameters are SSA-renamed
+- Nested functions (FunctionExpression, ObjectMethod) are recursively converted to SSA form
+- Context variables (captured from outer scopes) are handled specially and not redefined
+
+## Algorithm
+The pass uses the Braun et al. algorithm ("Simple and Efficient Construction of Static Single Assignment Form") with adaptations for handling loops and nested functions.
+
+### Key Steps:
+1. **Block Traversal**: Iterate through blocks in order (assumed reverse postorder from previous passes)
+2. **Definition Tracking**: Maintain a per-block `defs` map from original identifiers to their SSA-renamed versions
+3. **Renaming**:
+ - When a value is **defined** (lvalue), create a new SSA identifier with fresh `IdentifierId`
+ - When a value is **used** (operand), look up the current SSA identifier via `getIdAt`
+4. **Phi Node Insertion**: When looking up an identifier at a block with multiple predecessors:
+ - If all predecessors have been visited, create a phi node collecting values from each predecessor
+ - If some predecessors are unvisited (back-edge/loop), create an "incomplete phi" that will be fixed later
+5. **Incomplete Phi Resolution**: When all predecessors of a block are finally visited, fix any incomplete phi nodes by populating their operands
+6. **Nested Function Handling**: Recursively apply SSA transformation to nested functions, temporarily adding a fake predecessor edge to enable identifier lookup from the enclosing scope
+
+### Phi Node Placement Logic (`getIdAt`):
+- If the identifier is defined locally in the current block, return it
+- If at entry block with no predecessors and not found, mark as unknown (global)
+- If some predecessors are unvisited (loop), create incomplete phi
+- If exactly one predecessor, recursively look up in that predecessor
+- If multiple predecessors, create phi node with operands from all predecessors
+
+## Key Data Structures
+- **SSABuilder**: Main class managing the transformation
+ - `#states: Map` - Per-block state (defs map and incomplete phis)
+ - `unsealedPreds: Map` - Count of unvisited predecessors per block
+ - `#unknown: Set` - Identifiers assumed to be globals
+ - `#context: Set` - Context variables that should not be redefined
+- **State**: Per-block state containing:
+ - `defs: Map` - Maps original identifiers to SSA-renamed versions
+ - `incompletePhis: Array` - Phi nodes waiting for predecessor values
+- **IncompletePhi**: Tracks a phi node created before all predecessors were visited
+ - `oldPlace: Place` - Original place being phi'd
+ - `newPlace: Place` - SSA-renamed phi result place
+- **Phi**: The actual phi node in the HIR
+ - `place: Place` - The result of the phi
+ - `operands: Map` - Maps predecessor block to the place providing the value
+
+## Edge Cases
+- **Loops (back-edges)**: When a variable is used in a loop header before the loop body assigns it, an incomplete phi is created and later fixed when the loop body block is visited
+- **Globals**: If an identifier is used but never defined (reaching the entry block without a definition), it's assumed to be a global and not renamed
+- **Context variables**: Variables captured from an outer function scope are tracked specially and not redefined when reassigned
+- **Nested functions**: Function expressions and object methods are processed recursively with a temporary predecessor edge linking them to the enclosing block
+
+## TODOs
+- `[hoisting] EnterSSA: Expected identifier to be defined before being used` - Handles cases where hoisting causes an identifier to be used before definition (throws a Todo error for graceful bailout)
+
+## Example
+
+### Input (simple reassignment with control flow):
+```javascript
+function foo() {
+ let y = 2;
+ if (y > 1) {
+ y = 1;
+ } else {
+ y = 2;
+ }
+ let x = y;
+}
+```
+
+### Before SSA (HIR):
+```
+bb0 (block):
+ [1] $0 = 2
+ [2] $2 = StoreLocal Let y$1 = $0
+ [3] $7 = LoadLocal y$1
+ [4] $8 = 1
+ [5] $9 = Binary $7 > $8
+ [6] If ($9) then:bb2 else:bb3 fallthrough=bb1
+
+bb2 (block):
+ predecessor blocks: bb0
+ [7] $3 = 1
+ [8] $4 = StoreLocal Reassign y$1 = $3 // Same y$1 reassigned
+ [9] Goto bb1
+
+bb3 (block):
+ predecessor blocks: bb0
+ [10] $5 = 2
+ [11] $6 = StoreLocal Reassign y$1 = $5 // Same y$1 reassigned
+ [12] Goto bb1
+
+bb1 (block):
+ predecessor blocks: bb2 bb3
+ [13] $10 = LoadLocal y$1 // Which y$1?
+ [14] $12 = StoreLocal Let x$11 = $10
+```
+
+### After SSA:
+```
+bb0 (block):
+ [1] $15 = 2
+ [2] $17 = StoreLocal Let y$16 = $15 // y$16: initial definition
+ [3] $18 = LoadLocal y$16
+ [4] $19 = 1
+ [5] $20 = Binary $18 > $19
+ [6] If ($20) then:bb2 else:bb3 fallthrough=bb1
+
+bb2 (block):
+ predecessor blocks: bb0
+ [7] $21 = 1
+ [8] $23 = StoreLocal Reassign y$22 = $21 // y$22: new SSA name
+ [9] Goto bb1
+
+bb3 (block):
+ predecessor blocks: bb0
+ [10] $24 = 2
+ [11] $26 = StoreLocal Reassign y$25 = $24 // y$25: new SSA name
+ [12] Goto bb1
+
+bb1 (block):
+ predecessor blocks: bb2 bb3
+ y$27: phi(bb2: y$22, bb3: y$25) // PHI NODE: merges y$22 and y$25
+ [13] $28 = LoadLocal y$27 // Uses phi result
+ [14] $30 = StoreLocal Let x$29 = $28
+```
+
+### Loop Example (while loop with back-edge):
+```javascript
+function foo() {
+ let x = 1;
+ while (x < 10) {
+ x = x + 1;
+ }
+ return x;
+}
+```
+
+### After SSA:
+```
+bb0 (block):
+ [1] $13 = 1
+ [2] $15 = StoreLocal Let x$14 = $13 // x$14: initial definition
+ [3] While test=bb1 loop=bb3 fallthrough=bb2
+
+bb1 (loop):
+ predecessor blocks: bb0 bb3
+ x$16: phi(bb0: x$14, bb3: x$23) // PHI merges initial and loop-updated values
+ [4] $17 = LoadLocal x$16
+ [5] $18 = 10
+ [6] $19 = Binary $17 < $18
+ [7] Branch ($19) then:bb3 else:bb2
+
+bb3 (block):
+ predecessor blocks: bb1
+ [8] $20 = LoadLocal x$16 // Uses phi result
+ [9] $21 = 1
+ [10] $22 = Binary $20 + $21
+ [11] $24 = StoreLocal Reassign x$23 = $22 // x$23: new SSA name in loop body
+ [12] Goto(Continue) bb1
+
+bb2 (block):
+ predecessor blocks: bb1
+ [13] $25 = LoadLocal x$16 // Uses phi result
+ [14] Return Explicit $25
+```
+
+The phi node at `bb1` (the loop header) is initially created as an "incomplete phi" when first visited because `bb3` (the loop body) hasn't been visited yet. Once `bb3` is processed and its terminal is handled, the incomplete phi is fixed by calling `fixIncompletePhis` to populate the operand from `bb3`.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/03-eliminateRedundantPhi.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/03-eliminateRedundantPhi.md
new file mode 100644
index 000000000000..fe774253ade6
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/03-eliminateRedundantPhi.md
@@ -0,0 +1,90 @@
+# eliminateRedundantPhi
+
+## File
+`src/SSA/EliminateRedundantPhi.ts`
+
+## Purpose
+Eliminates phi nodes whose operands are trivially the same, replacing all usages of the phi's output identifier with the single source identifier. This simplifies the HIR by removing unnecessary join points that do not actually merge distinct values.
+
+## Input Invariants
+- The function must be in SSA form (i.e., `enterSSA` has already run)
+- Blocks are in reverse postorder (guaranteed by the HIR structure)
+- Phi nodes exist at the start of blocks where control flow merges
+
+## Output Guarantees
+- All redundant phi nodes are removed from the HIR
+- All references to eliminated phi identifiers are rewritten to the source identifier
+- Non-redundant phi nodes (those merging two or more distinct values) are preserved
+- Nested function expressions (FunctionExpression, ObjectMethod) also have their redundant phis eliminated and contexts rewritten
+
+## Algorithm
+A phi node is considered redundant when:
+1. **All operands are the same identifier**: e.g., `x2 = phi(x1, x1, x1)` - the phi is replaced with `x1`
+2. **All operands are either the same identifier OR the phi's output**: e.g., `x2 = phi(x1, x2, x1, x2)` - this handles loop back-edges where the phi references itself
+
+The algorithm works as follows:
+1. Visit blocks in reverse postorder, building a rewrite table (`Map`)
+2. For each phi node in a block:
+ - First rewrite operands using any existing rewrites (to handle cascading eliminations)
+ - Check if all operands (excluding self-references) point to the same identifier
+ - If so, add a mapping from the phi's output to that identifier and delete the phi
+3. After processing phis, rewrite all instruction lvalues, operands, and terminal operands
+4. For nested functions, recursively call `eliminateRedundantPhi` with shared rewrites
+5. If the CFG has back-edges (loops) and new rewrites were added, repeat the entire process
+
+The loop termination condition `rewrites.size > size && hasBackEdge` ensures:
+- Without loops: completes in a single pass (reverse postorder guarantees forward propagation)
+- With loops: repeats until no new rewrites are found (fixpoint)
+
+## Key Data Structures
+- **`Phi`** (from `src/HIR/HIR.ts`): Represents a phi node with:
+ - `place: Place` - the output identifier
+ - `operands: Map` - maps predecessor block IDs to source places
+- **`rewrites: Map`**: Maps eliminated phi outputs to their replacement identifier
+- **`visited: Set`**: Tracks visited blocks to detect back-edges (loops)
+
+## Edge Cases
+- **Loop back-edges**: When a block has a predecessor that hasn't been visited yet (in reverse postorder), that predecessor is a back-edge. The algorithm handles self-referential phis like `x2 = phi(x1, x2)` by ignoring operands equal to the phi's output.
+- **Cascading eliminations**: When one phi's output is used in another phi's operands, the algorithm rewrites operands before checking redundancy, enabling transitive elimination in a single pass (for non-loop cases).
+- **Nested functions**: FunctionExpression and ObjectMethod values contain nested HIR that may have their own phis. The algorithm recursively processes these with a shared rewrite table, ensuring context captures are also rewritten.
+- **Empty phi check**: The algorithm includes an invariant check that phi operands are never empty (which would be invalid HIR).
+
+## TODOs
+(None found in the source code)
+
+## Example
+
+Consider this fixture from `rewrite-phis-in-lambda-capture-context.js`:
+
+```javascript
+function Component() {
+ const x = 4;
+ const get4 = () => {
+ while (bar()) {
+ if (baz) { bar(); }
+ }
+ return () => x;
+ };
+ return get4;
+}
+```
+
+**After SSA pass**, the inner function has redundant phis due to the loop:
+
+```
+bb2 (loop):
+ predecessor blocks: bb1 bb5
+ x$29: phi(bb1: x$21, bb5: x$30) // Loop header phi
+ ...
+bb5 (block):
+ predecessor blocks: bb6 bb4
+ x$30: phi(bb6: x$29, bb4: x$29) // Redundant: both operands are x$29
+ ...
+```
+
+**After EliminateRedundantPhi**:
+- `x$30 = phi(x$29, x$29)` is eliminated because both operands are `x$29`
+- `x$29 = phi(x$21, x$30)` becomes `x$29 = phi(x$21, x$29)` after rewriting, which is also redundant (one operand is the phi itself, the other is `x$21`)
+- Both phis are eliminated, and all uses of `x$29` and `x$30` are rewritten to `x$21`
+
+The result: the context capture `@context[x$29]` becomes `@context[x$21]`, correctly propagating that `x` is never modified inside the loop.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/04-constantPropagation.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/04-constantPropagation.md
new file mode 100644
index 000000000000..36e57abe03aa
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/04-constantPropagation.md
@@ -0,0 +1,110 @@
+# constantPropagation
+
+## File
+`src/Optimization/ConstantPropagation.ts`
+
+## Purpose
+Applies Sparse Conditional Constant Propagation (SCCP) to fold compile-time evaluable expressions to constant values, propagate those constants through the program, and eliminate unreachable branches when conditionals have known constant values.
+
+## Input Invariants
+- HIR must be in SSA form (runs after `enterSSA`)
+- Redundant phi nodes should be eliminated (runs after `eliminateRedundantPhi`)
+- Consistent identifiers must be ensured (`assertConsistentIdentifiers`)
+- Terminal successors must exist (`assertTerminalSuccessorsExist`)
+
+## Output Guarantees
+- Instructions with compile-time evaluable operands are replaced with `Primitive` constants
+- `ComputedLoad`/`ComputedStore` with constant string/number properties are converted to `PropertyLoad`/`PropertyStore`
+- `LoadLocal` and `StoreLocal` propagate known constant values
+- `IfTerminal` with constant boolean test values are replaced with `goto` terminals
+- Unreachable blocks are removed and the CFG is minimized
+- Phi nodes with unreachable predecessor operands are pruned
+- Nested functions (`FunctionExpression`, `ObjectMethod`) are recursively processed
+
+## Algorithm
+The pass uses Sparse Conditional Constant Propagation (SCCP) with fixpoint iteration:
+
+1. **Data Structure**: A `Constants` map (`Map`) tracks known constant values (either `Primitive` or `LoadGlobal`)
+
+2. **Single Pass per Iteration**: Visits all blocks in order:
+ - Evaluates phi nodes - if all operands have the same constant value, the phi result is constant
+ - Evaluates instructions - replaces evaluable expressions with constants
+ - Evaluates terminals - if an `IfTerminal` test is a constant, replaces it with a `goto`
+
+3. **Fixpoint Loop**: If any terminals changed (branch elimination):
+ - Recomputes block ordering (`reversePostorderBlocks`)
+ - Removes unreachable code (`removeUnreachableForUpdates`, `removeDeadDoWhileStatements`, `removeUnnecessaryTryCatch`)
+ - Renumbers instructions (`markInstructionIds`)
+ - Updates predecessors (`markPredecessors`)
+ - Prunes phi operands from unreachable predecessors
+ - Eliminates newly-redundant phis (`eliminateRedundantPhi`)
+ - Merges consecutive blocks (`mergeConsecutiveBlocks`)
+ - Repeats until no more changes
+
+4. **Instruction Evaluation**: Handles various instruction types:
+ - **Primitives/LoadGlobal**: Directly constant
+ - **BinaryExpression**: Folds arithmetic (`+`, `-`, `*`, `/`, `%`, `**`), bitwise (`|`, `&`, `^`, `<<`, `>>`, `>>>`), and comparison (`<`, `<=`, `>`, `>=`, `==`, `===`, `!=`, `!==`) operators
+ - **UnaryExpression**: Folds `!` (boolean negation) and `-` (numeric negation)
+ - **PostfixUpdate/PrefixUpdate**: Folds `++`/`--` on constant numbers
+ - **PropertyLoad**: Folds `.length` on constant strings
+ - **TemplateLiteral**: Folds template strings with constant interpolations
+ - **ComputedLoad/ComputedStore**: Converts to property access when property is constant string/number
+
+## Key Data Structures
+- `Constant = Primitive | LoadGlobal` - The lattice values (no top/bottom, absence means unknown)
+- `Constants = Map` - Maps identifier IDs to their known constant values
+- Uses HIR types: `Instruction`, `Phi`, `Place`, `Primitive`, `LoadGlobal`, `InstructionValue`
+
+## Edge Cases
+- **Last instruction of sequence blocks**: Skipped to preserve evaluation order
+- **Phi nodes with back-edges**: Single-pass analysis means loop back-edges won't have constant values propagated
+- **Template literals with Symbol**: Not folded (would throw at runtime)
+- **Template literals with objects/arrays**: Not folded (custom toString behavior)
+- **Division results**: Computed at compile time (may produce `NaN`, `Infinity`, etc.)
+- **LoadGlobal in phis**: Only propagated if all operands reference the same global name
+- **Nested functions**: Constants from outer scope are propagated into nested function expressions
+
+## TODOs
+- `// TODO: handle more cases` - The default case in `evaluateInstruction` has room for additional instruction types
+
+## Example
+
+**Input:**
+```javascript
+function Component() {
+ let a = 1;
+
+ let b;
+ if (a === 1) {
+ b = true;
+ } else {
+ b = false;
+ }
+
+ let c;
+ if (b) {
+ c = 'hello';
+ } else {
+ c = null;
+ }
+
+ return c;
+}
+```
+
+**After ConstantPropagation:**
+- `a === 1` evaluates to `true`
+- The `if (a === 1)` branch is eliminated, only consequent remains
+- `b` is known to be `true`
+- `if (b)` branch is eliminated, only consequent remains
+- `c` is known to be `'hello'`
+- All intermediate blocks are merged
+
+**Output:**
+```javascript
+function Component() {
+ return "hello";
+}
+```
+
+The pass performs iterative simplification: first iteration determines `a === 1` is `true` and eliminates that branch. The CFG is updated, phi for `b` is pruned to single operand making `b = true`. Second iteration uses `b = true` to eliminate the next branch. This continues until no more branches can be eliminated.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/05-deadCodeElimination.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/05-deadCodeElimination.md
new file mode 100644
index 000000000000..d1bbb5b742f3
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/05-deadCodeElimination.md
@@ -0,0 +1,109 @@
+# deadCodeElimination
+
+## File
+`src/Optimization/DeadCodeElimination.ts`
+
+## Purpose
+Eliminates instructions whose values are unused, reducing generated code size. The pass performs mark-and-sweep analysis to identify and remove dead code while preserving side effects and program semantics.
+
+## Input Invariants
+- Must run after `InferMutationAliasingEffects` because "dead" code may still affect effect inference
+- HIR is in SSA form with phi nodes
+- Unreachable blocks are already pruned during HIR construction
+
+## Output Guarantees
+- All instructions with unused lvalues (that are safe to prune) are removed
+- Unused phi nodes are deleted
+- Unused context variables are removed from `fn.context`
+- Destructuring patterns are rewritten to remove unused bindings
+- `StoreLocal` instructions with unused initializers are converted to `DeclareLocal`
+
+## Algorithm
+Two-phase mark-and-sweep with fixed-point iteration for loops:
+
+**Phase 1: Mark (findReferencedIdentifiers)**
+1. Detect if function has back-edges (loops)
+2. Iterate blocks in reverse postorder (successors before predecessors) to visit usages before declarations
+3. For each block:
+ - Mark all terminal operands as referenced
+ - Process instructions in reverse order:
+ - If lvalue is used OR instruction is not pruneable, mark the lvalue and all operands as referenced
+ - Special case for `StoreLocal`: only mark initializer if the SSA lvalue is actually read
+ - Mark phi operands if the phi result is used
+4. If loops exist and new identifiers were marked, repeat until fixed point
+
+**Phase 2: Sweep**
+1. Remove unused phi nodes from each block
+2. Remove instructions with unused lvalues using `retainWhere`
+3. Rewrite retained instructions:
+ - **Array destructuring**: Replace unused elements with holes, truncate trailing holes
+ - **Object destructuring**: Remove unused properties (only if rest element is unused or absent)
+ - **StoreLocal**: Convert to `DeclareLocal` if initializer value is never read
+4. Remove unused context variables
+
+## Key Data Structures
+- **State class**: Tracks referenced identifiers
+ - `identifiers: Set` - SSA-specific usages
+ - `named: Set` - Named variable usages (any version)
+ - `isIdOrNameUsed()` - Checks if identifier or any version of named variable is used
+ - `isIdUsed()` - Checks if specific SSA id is used
+- **hasBackEdge/findBlocksWithBackEdges**: Detect loops requiring fixed-point iteration
+
+## Edge Cases
+- **Preserved even if unused:**
+ - `debugger` statements (to not break debugging workflows)
+ - Call expressions and method calls (may have side effects)
+ - Await expressions
+ - Store operations (ComputedStore, PropertyStore, StoreGlobal)
+ - Delete operations (ComputedDelete, PropertyDelete)
+ - Iterator operations (GetIterator, IteratorNext, NextPropertyOf)
+ - Context operations (LoadContext, DeclareContext, StoreContext)
+ - Memoization markers (StartMemoize, FinishMemoize)
+
+- **SSR mode special case:**
+ - In SSR mode, unused `useState`, `useReducer`, and `useRef` hooks can be removed
+
+- **Object destructuring with rest:**
+ - Cannot remove unused properties if rest element is used (would change rest's value)
+
+- **Block value instructions:**
+ - Last instruction of value blocks (not 'block' kind) is never pruned as it's the block's value
+
+## TODOs
+- "TODO: we could be more precise and make this conditional on whether any arguments are actually modified" (for mutating instructions)
+
+## Example
+
+**Input:**
+```javascript
+function Component(props) {
+ const _ = 42;
+ return props.value;
+}
+```
+
+**After DeadCodeElimination:**
+The `const _ = 42` assignment is removed since `_` is never used:
+```javascript
+function Component(props) {
+ return props.value;
+}
+```
+
+**Array destructuring example:**
+
+Input:
+```javascript
+function foo(props) {
+ const [x, unused, y] = props.a;
+ return x + y;
+}
+```
+
+Output (middle element becomes a hole):
+```javascript
+function foo(props) {
+ const [x, , y] = props.a;
+ return x + y;
+}
+```
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/06-inferTypes.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/06-inferTypes.md
new file mode 100644
index 000000000000..10878fa4a525
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/06-inferTypes.md
@@ -0,0 +1,124 @@
+# inferTypes
+
+## File
+`src/TypeInference/InferTypes.ts`
+
+## Purpose
+Infers types for all identifiers in the HIR by generating type equations and solving them using unification. This pass annotates identifiers with concrete types (Primitive, Object, Function) based on the operations performed on them and the types of globals/hooks they interact with.
+
+## Input Invariants
+- The HIR must be in SSA form (the pass runs after `enterSSA` and `eliminateRedundantPhi`)
+- Constant propagation has already run
+- Global declarations and hook shapes are available via the Environment
+
+## Output Guarantees
+- All identifier types are resolved from type variables (`Type`) to concrete types where possible
+- Phi nodes have their operand types unified to produce a single result type
+- Function return types are inferred from the unified types of all return statements
+- Property accesses on known objects/hooks resolve to the declared property types
+- Component props parameters are typed as `TObject`
+- Component ref parameters are typed as `TObject`
+
+## Algorithm
+The pass uses a classic constraint-based type inference approach with three phases:
+
+1. **Constraint Generation (`generate`)**: Traverses all instructions and generates type equations:
+ - Primitives, literals, unary/binary operations -> `Primitive` type
+ - Hook/function calls -> Function type with fresh return type variable
+ - Property loads -> `Property` type that defers to object shape lookup
+ - Destructuring -> Property types for each extracted element
+ - Phi nodes -> `Phi` type with all operand types as candidates
+ - JSX -> `Object`
+ - Arrays -> `Object`
+ - Objects -> `Object`
+
+2. **Unification (`Unifier.unify`)**: Solves constraints by unifying type equations:
+ - Type variables are bound to concrete types via substitution
+ - Property types are resolved by looking up the object's shape
+ - Phi types are resolved by finding a common type among operands (or falling back to `Phi` if incompatible)
+ - Function types are unified by unifying their return types
+ - Occurs check prevents infinite types (cycles in type references)
+
+3. **Application (`apply`)**: Applies the computed substitutions to all identifiers in the HIR, replacing type variables with their resolved types.
+
+## Key Data Structures
+- **TypeVar** (`kind: 'Type'`): A type variable with a unique TypeId, used for unknowns
+- **Unifier**: Maintains a substitution map from TypeId to Type, with methods for unification and cycle detection
+- **TypeEquation**: A pair of types that should be equal, used as constraints
+- **PhiType** (`kind: 'Phi'`): Represents the join of multiple types from control flow merge points
+- **PropType** (`kind: 'Property'`): Deferred property lookup that resolves based on object shape
+- **FunctionType** (`kind: 'Function'`): Callable type with optional shapeId and return type
+- **ObjectType** (`kind: 'Object'`): Object with optional shapeId for shape lookup
+
+## Edge Cases
+
+### Phi Type Resolution
+When phi operands have incompatible types, the pass attempts to find a union:
+- `Union(Primitive | MixedReadonly) = MixedReadonly`
+- `Union(Array | MixedReadonly) = Array`
+- If no union is possible, the type remains as `Phi`
+
+### Ref-like Name Inference
+When `enableTreatRefLikeIdentifiersAsRefs` is enabled, property access on variables matching the pattern `/^(?:[a-zA-Z$_][a-zA-Z$_0-9]*)Ref$|^ref$/` with property name `current` infers:
+- Object type as `TObject`
+- Property type as `TObject`
+
+### Cycle Detection
+The `occursCheck` method prevents infinite types by detecting when a type variable appears in its own substitution. When a cycle is detected, `tryResolveType` removes the cyclic reference from Phi operands.
+
+### Context Variables
+- `DeclareContext` and `LoadContext` generate no type equations (intentionally untyped)
+- `StoreContext` with `Const` kind does propagate the rvalue type to enable ref inference through context variables
+
+## TODOs
+1. **Hook vs Function type ambiguity**:
+ > "TODO: callee could be a hook or a function, so this type equation isn't correct. We should change Hook to a subtype of Function or change unifier logic."
+
+2. **PropertyStore rvalue inference**:
+ > "TODO: consider using the rvalue type here" - Currently uses a dummy type for PropertyStore to avoid inferring rvalue types from lvalue assignments.
+
+## Example
+
+**Input (infer-phi-primitive.js):**
+```javascript
+function foo(a, b) {
+ let x;
+ if (a) {
+ x = 1;
+ } else {
+ x = 2;
+ }
+ let y = x;
+ return y;
+}
+```
+
+**Before InferTypes (SSA form):**
+```
+ x$26: phi(bb2: x$21, bb3: x$24)
+[10] $27 = LoadLocal x$26
+[11] $29 = StoreLocal Let y$28 = $27
+```
+
+**After InferTypes:**
+```
+ x$26:TPrimitive: phi(bb2: x$21:TPrimitive, bb3: x$24:TPrimitive)
+[10] $27:TPrimitive = LoadLocal x$26:TPrimitive
+[11] $29:TPrimitive = StoreLocal Let y$28:TPrimitive = $27:TPrimitive
+```
+
+The pass infers that:
+- Literals `1` and `2` are `TPrimitive`
+- The phi of two primitives is `TPrimitive`
+- Variables `x` and `y` are `TPrimitive`
+- The function return type is `TPrimitive`
+
+**Hook type inference example (useState):**
+```javascript
+const [x, setX] = useState(initialValue);
+```
+
+After InferTypes:
+- `useState` -> `TFunction:TObject`
+- Return value `$27` -> `TObject`
+- Destructured `setX` -> `TFunction:TPrimitive`
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/07-analyseFunctions.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/07-analyseFunctions.md
new file mode 100644
index 000000000000..b86881163bb6
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/07-analyseFunctions.md
@@ -0,0 +1,84 @@
+# analyseFunctions
+
+## File
+`src/Inference/AnalyseFunctions.ts`
+
+## Purpose
+Recursively analyzes all nested function expressions and object methods in a function to infer their aliasing effect signatures, which describe how the function affects its captured variables when invoked.
+
+## Input Invariants
+- The HIR has been through SSA conversion and type inference
+- FunctionExpression and ObjectMethod instructions have an empty `aliasingEffects` array (`@aliasingEffects=[]`)
+- Context variables (captured variables from outer scope) exist on `fn.context` but do not have their effect populated
+
+## Output Guarantees
+- Every FunctionExpression and ObjectMethod has its `aliasingEffects` array populated with the effects the function performs when called (mutations, captures, aliasing to return value, etc.)
+- Each context variable's `effect` property is set to either `Effect.Capture` (if the variable is captured or mutated by the inner function) or `Effect.Read` (if only read)
+- Context variable mutable ranges are reset to `{start: 0, end: 0}` and scopes are set to `null` to prepare for the outer function's subsequent `inferMutationAliasingRanges` pass
+
+## Algorithm
+1. **Recursive traversal**: Iterates through all blocks and instructions looking for `FunctionExpression` or `ObjectMethod` instructions
+2. **Depth-first processing**: For each function expression found, calls `lowerWithMutationAliasing()` which:
+ - Recursively calls `analyseFunctions()` on the inner function (handles nested functions)
+ - Runs `inferMutationAliasingEffects()` on the inner function to determine effects
+ - Runs `deadCodeElimination()` to clean up
+ - Runs `inferMutationAliasingRanges()` to compute mutable ranges and extract externally-visible effects
+ - Runs `rewriteInstructionKindsBasedOnReassignment()` and `inferReactiveScopeVariables()`
+ - Stores the computed effects in `fn.aliasingEffects`
+3. **Context variable effect classification**: Scans the computed effects to determine which context variables are captured/mutated vs only read:
+ - Effects like `Capture`, `Alias`, `Assign`, `MaybeAlias`, `CreateFrom` mark the source as captured
+ - Mutation effects (`Mutate`, `MutateTransitive`, etc.) mark the target as captured
+ - Sets `operand.effect = Effect.Capture` or `Effect.Read` accordingly
+4. **Range reset**: Resets mutable ranges and scopes on context variables to prepare for outer function analysis
+
+## Key Data Structures
+- **HIRFunction.aliasingEffects**: Array of `AliasingEffect` storing the externally-visible behavior of a function when called
+- **Place.effect**: Effect enum value (`Capture` or `Read`) describing how a context variable is used
+- **AliasingEffect**: Union type describing data flow (Capture, Alias, Assign, etc.) and mutations (Mutate, MutateTransitive, etc.)
+- **FunctionExpression/ObjectMethod.loweredFunc.func**: The inner HIRFunction to analyze
+
+## Edge Cases
+- **Nested functions**: Handled via recursive call to `analyseFunctions()` before processing the current function - innermost functions are analyzed first
+- **ObjectMethod**: Treated identically to FunctionExpression
+- **Apply effects invariant**: The pass asserts that no `Apply` effects remain in the function's signature - these should have been resolved to more precise effects by `inferMutationAliasingRanges()`
+- **Conditional mutations**: Effects like `MutateTransitiveConditionally` are tracked - a function that conditionally mutates a captured variable will have that effect in its signature
+- **Immutable captures**: `ImmutableCapture`, `Freeze`, `Create`, `Impure`, `Render` effects do not contribute to marking context variables as `Capture`
+
+## TODOs
+- No TODO comments in the pass itself
+
+## Example
+Consider a function that captures and conditionally mutates a variable:
+
+```javascript
+function useHook(a, b) {
+ let z = {a};
+ let y = b;
+ let x = function () {
+ if (y) {
+ maybeMutate(z); // Unknown function, may mutate z
+ }
+ };
+ return x;
+}
+```
+
+**Before AnalyseFunctions:**
+```
+Function @context[y$28, z$25] @aliasingEffects=[]
+```
+
+**After AnalyseFunctions:**
+```
+Function @context[read y$28, capture z$25] @aliasingEffects=[
+ MutateTransitiveConditionally z$25,
+ Create $14 = primitive
+]
+```
+
+The pass infers:
+- `y` is only read (used in the condition)
+- `z` is captured into the function and conditionally mutated transitively (because `maybeMutate()` is unknown)
+- The inner function's signature includes `MutateTransitiveConditionally z$25` to indicate this potential mutation
+
+This signature is then used by `InferMutationAliasingEffects` on the outer function to understand that creating this function captures `z`, and calling the function may mutate `z`.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/08-inferMutationAliasingEffects.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/08-inferMutationAliasingEffects.md
new file mode 100644
index 000000000000..a8b488008e0e
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/08-inferMutationAliasingEffects.md
@@ -0,0 +1,144 @@
+# inferMutationAliasingEffects
+
+## File
+`src/Inference/InferMutationAliasingEffects.ts`
+
+## Purpose
+Infers the mutation and aliasing effects for all instructions and terminals in the HIR, making the effects of built-in instructions/functions as well as user-defined functions explicit. These effects form the basis for subsequent analysis to determine the mutable range of each value in the program and for validation against invalid code patterns like mutating frozen values.
+
+## Input Invariants
+- HIR must be in SSA form (run after SSA pass)
+- Types must be inferred (run after InferTypes pass)
+- Functions must be analyzed (run after AnalyseFunctions pass) - this provides `aliasingEffects` on FunctionExpressions
+- Each instruction must have an lvalue (destination place)
+
+## Output Guarantees
+- Every instruction has an `effects` array (or null if no effects) containing `AliasingEffect` objects
+- Terminals that affect data flow (return, try/catch) have their `effects` populated
+- Each instruction's lvalue is guaranteed to be defined in the inference state after visiting
+- Effects describe: creation of values, data flow (Assign, Alias, Capture), mutations (Mutate, MutateTransitive), freezing, and errors (MutateFrozen, MutateGlobal, Impure)
+
+## Algorithm
+The pass uses abstract interpretation with the following key phases:
+
+1. **Initialization**:
+ - Create initial `InferenceState` mapping identifiers to abstract values
+ - Initialize context variables as `ValueKind.Context`
+ - Initialize parameters as `ValueKind.Frozen` (for top-level components/hooks) or `ValueKind.Mutable` (for function expressions)
+
+2. **Two-Phase Effect Processing**:
+ - **Phase 1 - Signature Computation**: For each instruction, compute a "candidate signature" based purely on instruction semantics and types (cached per instruction via `computeSignatureForInstruction`)
+ - **Phase 2 - Effect Application**: Apply the signature to the current abstract state via `applySignature`, which refines effects based on the actual runtime kinds of values
+
+3. **Fixed-Point Iteration**:
+ - Process blocks in a worklist, queuing successors after each block
+ - Merge states at control flow join points using lattice operations
+ - Iterate until no changes occur (max 100 iterations as safety limit)
+ - Phi nodes are handled by unioning the abstract values from all predecessors
+
+4. **Effect Refinement** (in `applyEffect`):
+ - `MutateConditionally` effects are dropped if value is not mutable
+ - `Capture` effects are downgraded to `ImmutableCapture` if source is frozen
+ - `Mutate` on frozen values becomes `MutateFrozen` error
+ - `Assign` from primitives/globals creates new values rather than aliasing
+
+## Key Data Structures
+
+### InferenceState
+Maintains two maps:
+- `#values: Map` - Maps allocation sites to their abstract kind
+- `#variables: Map>` - Maps identifiers to the set of values they may point to (set to handle phi joins)
+
+### AbstractValue
+```typescript
+type AbstractValue = {
+ kind: ValueKind;
+ reason: ReadonlySet;
+};
+```
+
+### ValueKind (lattice)
+```
+MaybeFrozen <- top (unknown if frozen or mutable)
+ |
+ Frozen <- immutable, cannot be mutated
+ Mutable <- can be mutated locally
+ Context <- mutable box (context variables)
+ |
+ Global <- global value
+ Primitive <- copy-on-write semantics
+```
+
+The `mergeValueKinds` function implements the lattice join:
+- `Frozen | Mutable -> MaybeFrozen`
+- `Context | Mutable -> Context`
+- `Context | Frozen -> MaybeFrozen`
+
+### AliasingEffect Types
+Key effect kinds handled:
+- **Create**: Creates a new value at a place
+- **Assign**: Direct assignment (pointer copy)
+- **Alias**: Mutation of destination implies mutation of source
+- **Capture**: Information flow (MutateTransitive propagates through)
+- **MaybeAlias**: Possible aliasing for unknown function returns
+- **Mutate/MutateTransitive**: Direct/transitive mutation
+- **MutateConditionally/MutateTransitiveConditionally**: Conditional versions
+- **Freeze**: Marks value as immutable
+- **Apply**: Function call with complex data flow
+
+## Edge Cases
+
+1. **Spread Destructuring from Props**: The `findNonMutatedDestructureSpreads` pre-pass identifies spread patterns from frozen values that are never mutated, allowing them to be treated as frozen.
+
+2. **Hoisted Context Declarations**: Special handling for variables declared with hoisting (`HoistedConst`, `HoistedFunction`, `HoistedLet`) to detect access before declaration.
+
+3. **Try-Catch Aliasing**: When a `maybe-throw` terminal is reached, call return values are aliased into the catch binding since exceptions can throw return values.
+
+4. **Function Expressions**: Functions are considered mutable only if they have mutable captures or tracked side effects (MutateFrozen, MutateGlobal, Impure).
+
+5. **Iterator Mutation**: Non-builtin iterators may alias their collection and mutation of the iterator is conditional.
+
+6. **Array.push and Similar**: Uses legacy signature system with `Store` effect on receiver and `Capture` of arguments.
+
+## TODOs
+- `// TODO: using InstructionValue as a bit of a hack, but it's pragmatic` - context variable initialization
+- `// TODO: call applyEffect() instead` - try-catch aliasing
+- `// TODO: make sure we're also validating against global mutations somewhere` - global mutation validation for effects/event handlers
+- `// TODO; include "render" here?` - whether to track Render effects in function hasTrackedSideEffects
+- `// TODO: consider using persistent data structures to make clone cheaper` - performance optimization for state cloning
+- `// TODO check this` and `// TODO: what kind here???` - DeclareLocal value kinds
+
+## Example
+
+For the code:
+```javascript
+const arr = [];
+arr.push({});
+arr.push(x, y);
+```
+
+After `InferMutationAliasingEffects`, the effects are:
+
+```
+[10] $39 = Array []
+ Create $39 = mutable // Array literal creates mutable value
+
+[11] $41 = StoreLocal arr$40 = $39
+ Assign arr$40 = $39 // arr points to the array value
+ Assign $41 = $39
+
+[15] $45 = MethodCall $42.push($44)
+ Apply $45 = $42.$43($44) // Records the call
+ Mutate $42 // push mutates the array
+ Capture $42 <- $44 // {} is captured into array
+ Create $45 = primitive // push returns number (length)
+
+[20] $50 = MethodCall $46.push($48, $49)
+ Apply $50 = $46.$47($48, $49)
+ Mutate $46 // push mutates the array
+ Capture $46 <- $48 // x captured into array
+ Capture $46 <- $49 // y captured into array
+ Create $50 = primitive
+```
+
+The key insight is that `Mutate` effects extend the mutable range of the array, and `Capture` effects record data flow so that if the array is later frozen (e.g., returned from a component), the captured values are also considered frozen for validation purposes.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/09-inferMutationAliasingRanges.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/09-inferMutationAliasingRanges.md
new file mode 100644
index 000000000000..769f386abe82
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/09-inferMutationAliasingRanges.md
@@ -0,0 +1,149 @@
+# inferMutationAliasingRanges
+
+## File
+`src/Inference/InferMutationAliasingRanges.ts`
+
+## Purpose
+This pass builds an abstract model of the heap and interprets the effects of the given function to determine: (1) the mutable ranges of all identifiers, (2) the externally-visible effects of the function (mutations of params/context-vars, aliasing relationships), and (3) the legacy `Effect` annotation for each Place.
+
+## Input Invariants
+- InferMutationAliasingEffects must have already run, populating `instr.effects` on each instruction with aliasing/mutation effects
+- SSA form must be established (identifiers are in SSA)
+- Type inference has been run (InferTypes)
+- Functions have been analyzed (AnalyseFunctions)
+- Dead code elimination has been performed
+
+## Output Guarantees
+- Every identifier has a populated `mutableRange` (start:end instruction IDs)
+- Every Place has a legacy `Effect` annotation (Read, Capture, Store, Freeze, etc.)
+- The function's `aliasingEffects` array is populated with externally-visible effects (mutations of params/context-vars, aliasing between params/context-vars/return)
+- Validation errors are collected for invalid effects like `MutateFrozen` or `MutateGlobal`
+
+## Algorithm
+The pass operates in three main phases:
+
+**Part 1: Build Data Flow Graph and Infer Mutable Ranges**
+1. Creates an `AliasingState` which maintains a `Node` for each identifier
+2. Iterates through all blocks and instructions, processing effects in program order
+3. For each effect:
+ - `Create`/`CreateFunction`: Creates a new node in the graph
+ - `CreateFrom`/`Assign`/`Alias`: Adds alias edges between nodes (with ordering index)
+ - `MaybeAlias`: Adds conditional alias edges
+ - `Capture`: Adds capture edges (for transitive mutations)
+ - `Mutate*`: Queues mutations for later processing
+ - `Render`: Queues render effects for later processing
+4. Phi node operands are connected once their predecessor blocks have been visited
+5. After the graph is built, mutations are processed:
+ - Mutations propagate both forward (via edges) and backward (via aliases/captures)
+ - Each mutation extends the `mutableRange.end` of affected identifiers
+ - Transitive mutations also traverse capture edges backward
+ - `MaybeAlias` edges downgrade mutations to `Conditional`
+6. Render effects are processed to mark values as rendered
+
+**Part 2: Populate Legacy Per-Place Effects**
+- Sets legacy effects on lvalues and operands based on instruction effects and mutable ranges
+- Fixes up mutable range start values for identifiers that are mutated after creation
+
+**Part 3: Infer Externally-Visible Function Effects**
+- Creates a `Create` effect for the return value
+- Simulates transitive mutations of each param/context-var/return to detect capture relationships
+- Produces `Alias`/`Capture` effects showing data flow between params/context-vars/return
+
+## Key Data Structures
+
+### `AliasingState`
+The main state class maintaining the data flow graph:
+- `nodes: Map` - Maps identifiers to their graph nodes
+
+### `Node`
+Represents an identifier in the data flow graph:
+```typescript
+type Node = {
+ id: Identifier;
+ createdFrom: Map; // CreateFrom edges (source -> index)
+ captures: Map; // Capture edges (source -> index)
+ aliases: Map; // Alias/Assign edges (source -> index)
+ maybeAliases: Map; // MaybeAlias edges (source -> index)
+ edges: Array<{index, node, kind}>; // Forward edges to other nodes
+ transitive: {kind: MutationKind; loc} | null; // Transitive mutation info
+ local: {kind: MutationKind; loc} | null; // Local mutation info
+ lastMutated: number; // Index of last mutation affecting this node
+ mutationReason: MutationReason | null; // Reason for mutation
+ value: {kind: 'Object'} | {kind: 'Phi'} | {kind: 'Function'; function: HIRFunction};
+ render: Place | null; // Render context if used in JSX
+};
+```
+
+### `MutationKind`
+Enum describing mutation certainty:
+```typescript
+enum MutationKind {
+ None = 0,
+ Conditional = 1, // May mutate (e.g., via MaybeAlias or MutateConditionally)
+ Definite = 2, // Definitely mutates
+}
+```
+
+## Edge Cases
+
+### Phi Nodes
+- Phi nodes are created as special `{kind: 'Phi'}` nodes
+- Phi operands from predecessor blocks are processed with pending edges until the predecessor is visited
+- When traversing "forwards" through edges and encountering a phi, backward traversal is stopped (prevents mutation from one phi input affecting other inputs)
+
+### Transitive vs Local Mutations
+- Local mutations (`Mutate`) only affect alias/assign edges backward
+- Transitive mutations (`MutateTransitive`) also affect capture edges backward
+- Both affect all forward edges
+
+### MaybeAlias
+- Mutations through MaybeAlias edges are downgraded to `Conditional`
+- This prevents false positive errors when we cannot be certain about aliasing
+
+### Function Values
+- Functions are tracked specially as `{kind: 'Function'}` nodes
+- When a function is mutated (transitively), errors from the function body are propagated
+- This handles cases where mutating a captured value in a function affects render safety
+
+### Render Effect Propagation
+- Render effects traverse backward through alias/capture/createFrom edges
+- Functions that have not been mutated are skipped during render traversal (except for JSX-returning functions)
+- Ref types (`isUseRefType`) stop render traversal
+
+## TODOs
+1. Assign effects should have an invariant that the node is not initialized yet. Currently `InferFunctionExpressionAliasingEffectSignatures` infers Assign effects that should be Alias, causing reinitialization.
+
+2. Phi place effects are not properly set today.
+
+3. Phi mutable range start calculation is imprecise - currently just sets it to the instruction before the block rather than computing the exact start.
+
+## Example
+
+Consider the following code:
+```javascript
+function foo() {
+ let a = {}; // Create a (instruction 1)
+ let b = {}; // Create b (instruction 3)
+ a = b; // Assign a <- b (instruction 8)
+ mutate(a, b); // MutateTransitiveConditionally a, b (instruction 16)
+ return a;
+}
+```
+
+The pass builds a graph:
+1. Creates node for `{}` at instruction 1 (initially assigned to `a`)
+2. Creates node for `{}` at instruction 3 (initially assigned to `b`)
+3. At instruction 8, creates alias edge: `b -> a` with index 8
+4. At instruction 16, mutations are queued for `a` and `b`
+
+When processing the mutation of `a` at instruction 16:
+- Extends `a`'s mutableRange.end to 17
+- Traverses backward through alias edge to `b`, extends `b`'s mutableRange.end to 17
+- Since `a = b`, both objects must be considered mutable until instruction 17
+
+The output shows identifiers with range annotations like `$25[3:17]` meaning:
+- `$25` is the identifier
+- `3` is the instruction where it was created
+- `17` is the instruction after which it is no longer mutated
+
+For aliased values, the ranges are unified - all values that could be affected by a mutation have their ranges extended to include that mutation point.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/10-inferReactivePlaces.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/10-inferReactivePlaces.md
new file mode 100644
index 000000000000..c0b8b974e215
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/10-inferReactivePlaces.md
@@ -0,0 +1,169 @@
+# inferReactivePlaces
+
+## File
+`src/Inference/InferReactivePlaces.ts`
+
+## Purpose
+Determines which `Place`s (identifiers and temporaries) in the HIR are **reactive** - meaning they may *semantically* change over the course of the component or hook's lifetime. This information is critical for memoization: reactive places form the dependencies that, when changed, should invalidate cached values.
+
+A place is reactive if it derives from any source of reactivity:
+1. **Props** - Component parameters may change between renders
+2. **Hooks** - Hooks can access state or context which can change
+3. **`use` operator** - Can access context which may change
+4. **Mutation with reactive operands** - Values mutated in instructions that have reactive operands become reactive themselves
+5. **Conditional assignment based on reactive control flow** - Values assigned in branches controlled by reactive conditions become reactive
+
+## Input Invariants
+- HIR is in SSA form with phi nodes at join points
+- `inferMutationAliasingEffects` and `inferMutationAliasingRanges` have run, establishing:
+ - Effect annotations on operands (Effect.Capture, Effect.Store, Effect.Mutate, etc.)
+ - Mutable ranges on identifiers
+ - Aliasing relationships captured by `findDisjointMutableValues`
+- All operands have known effects (asserts on `Effect.Unknown`)
+
+## Output Guarantees
+- Every reactive Place has `place.reactive = true`
+- Reactivity is transitively complete (derived from reactive β reactive)
+- All identifiers in a mutable alias group share reactivity
+- Reactivity is propagated to operands used within nested function expressions
+
+## Algorithm
+The algorithm uses **fixpoint iteration** to propagate reactivity forward through the control-flow graph:
+
+### Initialization
+1. Create a `ReactivityMap` backed by disjoint sets of mutably-aliased identifiers
+2. Mark all function parameters as reactive (props are reactive by definition)
+3. Create a `ControlDominators` helper to identify blocks controlled by reactive conditions
+
+### Fixpoint Loop
+Iterate until no changes occur:
+
+For each block:
+1. **Phi Nodes**: Mark phi nodes reactive if:
+ - Any operand is reactive, OR
+ - Any predecessor block is controlled by a reactive condition (control-flow dependency)
+
+2. **Instructions**: For each instruction:
+ - Track stable identifier sources (for hooks like `useRef`, `useState` dispatch)
+ - Check if any operand is reactive
+ - Hook calls and `use` operator are sources of reactivity
+ - If instruction has reactive input:
+ - Mark lvalues reactive (unless they are known-stable like `setState` functions)
+ - If instruction has reactive input OR is in reactive-controlled block:
+ - Mark mutable operands (Capture, Store, Mutate effects) as reactive
+
+3. **Terminals**: Check terminal operands for reactivity
+
+### Post-processing
+Propagate reactivity to inner functions (nested `FunctionExpression` and `ObjectMethod`).
+
+## Key Data Structures
+
+### ReactivityMap
+```typescript
+class ReactivityMap {
+ hasChanges: boolean = false; // Tracks if fixpoint changed
+ reactive: Set = new Set(); // Set of reactive identifiers
+ aliasedIdentifiers: DisjointSet; // Mutable alias groups
+}
+```
+- Uses disjoint sets so that when one identifier in an alias group becomes reactive, they all are effectively reactive
+- `isReactive(place)` checks and marks `place.reactive = true` as a side effect
+- `snapshot()` resets change tracking and returns whether changes occurred
+
+### StableSidemap
+```typescript
+class StableSidemap {
+ map: Map = new Map();
+}
+```
+Tracks sources of stability (e.g., `useState()[1]` dispatch function). Forward data-flow analysis that:
+- Records hook calls that return stable types
+- Propagates stability through PropertyLoad and Destructure from stable containers
+- Propagates through LoadLocal and StoreLocal
+
+### ControlDominators
+Uses post-dominator frontier analysis to determine which blocks are controlled by reactive branch conditions.
+
+## Edge Cases
+
+### Backward Reactivity Propagation via Mutable Aliasing
+```javascript
+const x = [];
+const z = [x];
+x.push(props.input);
+return {z}
;
+```
+Here `z` aliases `x` which is later mutated with reactive data. The disjoint set ensures `z` becomes reactive even though the mutation happens after its creation.
+
+### Stable Types Are Not Reactive
+```javascript
+const [state, setState] = useState();
+// setState is stable - not marked reactive despite coming from reactive hook
+```
+The `StableSidemap` tracks these and skips marking them reactive.
+
+### Ternary with Stable Values Still Reactive
+```javascript
+props.cond ? setState1 : setState2
+```
+Even though both branches are stable types, the result depends on reactive control flow, so it cannot be marked non-reactive just based on type.
+
+### Phi Nodes with Reactive Predecessors
+When a phi's predecessor block is controlled by a reactive condition, the phi becomes reactive even if its operands are all non-reactive constants.
+
+## TODOs
+No explicit TODO comments are present in the source file. However, comments note:
+
+- **ComputedLoads not handled for stability**: Only PropertyLoad propagates stability from containers, not ComputedLoad. The comment notes this is safe because stable containers have differently-typed elements, but ComputedLoad handling could be added.
+
+## Example
+
+### Fixture: `reactive-dependency-fixpoint.js`
+
+**Input:**
+```javascript
+function Component(props) {
+ let x = 0;
+ let y = 0;
+ while (x === 0) {
+ x = y;
+ y = props.value;
+ }
+ return [x];
+}
+```
+
+**Before InferReactivePlaces:**
+```
+bb1 (loop):
+ store x$26:TPhi:TPhi: phi(bb0: read x$21:TPrimitive, bb3: read x$32:TPhi)
+ store y$30:TPhi:TPhi: phi(bb0: read y$24:TPrimitive, bb3: read y$37)
+ ...
+bb3 (block):
+ [12] mutate? $35 = LoadLocal read props$19
+ [13] mutate? $36 = PropertyLoad read $35.value
+ [14] mutate? $38 = StoreLocal Reassign mutate? y$37 = read $36
+```
+
+**After InferReactivePlaces:**
+```
+bb1 (loop):
+ store x$26:TPhi{reactive}:TPhi: phi(bb0: read x$21:TPrimitive, bb3: read x$32:TPhi{reactive})
+ store y$30:TPhi{reactive}:TPhi: phi(bb0: read y$24:TPrimitive, bb3: read y$37{reactive})
+ [6] mutate? $27:TPhi{reactive} = LoadLocal read x$26:TPhi{reactive}
+ ...
+bb3 (block):
+ [12] mutate? $35{reactive} = LoadLocal read props$19{reactive}
+ [13] mutate? $36{reactive} = PropertyLoad read $35{reactive}.value
+ [14] mutate? $38{reactive} = StoreLocal Reassign mutate? y$37{reactive} = read $36{reactive}
+```
+
+**Key observations:**
+- `props$19` is marked `{reactive}` as a function parameter
+- The reactivity propagates through the loop:
+ - First iteration: `y$37` becomes reactive from `props.value`
+ - Second iteration: `x$32` becomes reactive from `y$30` (which is reactive via the phi from `y$37`)
+ - The phi nodes `x$26` and `y$30` become reactive because their bb3 operands are reactive
+- The fixpoint algorithm handles this backward propagation through the loop correctly
+- The final output `$40` is reactive, so the array `[x]` will be memoized with `x` as a dependency
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/11-inferReactiveScopeVariables.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/11-inferReactiveScopeVariables.md
new file mode 100644
index 000000000000..e8a480b115f2
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/11-inferReactiveScopeVariables.md
@@ -0,0 +1,176 @@
+# inferReactiveScopeVariables
+
+## File
+`src/ReactiveScopes/InferReactiveScopeVariables.ts`
+
+## Purpose
+This is the **1st of 4 passes** that determine how to break a React function into discrete reactive scopes (independently memoizable units of code). Its specific responsibilities are:
+
+1. **Identify operands that mutate together** - Variables that are mutated in the same instruction must be placed in the same reactive scope
+2. **Assign a unique ReactiveScope to each group** - Each disjoint set of co-mutating identifiers gets assigned a unique ScopeId
+3. **Compute the mutable range** - The scope's range is computed as the union of all member identifiers' mutable ranges
+
+The pass does NOT determine which instructions compute each scope, only which variables belong together.
+
+## Input Invariants
+- `InferMutationAliasingEffects` has run - Effects describe mutations, captures, and aliasing
+- `InferMutationAliasingRanges` has run - Each identifier has a valid `mutableRange` property
+- `InferReactivePlaces` has run - Places are marked as reactive or not
+- `RewriteInstructionKindsBasedOnReassignment` has run - Let/Const properly determined
+- All instructions have been numbered with valid `InstructionId` values
+- Phi nodes are properly constructed at block join points
+
+## Output Guarantees
+- Each identifier that is part of a mutable group has its `identifier.scope` property set to a `ReactiveScope` object
+- All identifiers in the same scope share the same `ReactiveScope` reference
+- The scope's `range` is the union (min start, max end) of all member mutable ranges
+- The scope's `range` is validated to be within [1, maxInstruction+1]
+- Identifiers that only have single-instruction lifetimes (read once) may not be assigned to a scope unless they allocate
+
+## Algorithm
+
+### Phase 1: Find Disjoint Mutable Values (`findDisjointMutableValues`)
+
+Uses a Union-Find (Disjoint Set) data structure to group identifiers that mutate together:
+
+1. **Handle Phi Nodes**: For each phi in each block:
+ - If the phi's result is mutated after creation (mutableRange.end > first instruction in block), union the phi with all its operands
+ - This ensures values that flow through control flow and are later mutated are grouped together
+
+2. **Handle Instructions**: For each instruction:
+ - Collect mutable operands based on instruction type:
+ - If lvalue has extended mutable range OR instruction may allocate, include lvalue
+ - For StoreLocal/StoreContext: Include lvalue if it has extended mutable range, include value if mutable
+ - For Destructure: Include each pattern operand with extended range, include source if mutable
+ - For MethodCall: Include all mutable operands plus the computed property (to keep method resolution in same scope)
+ - For other instructions: Include all mutable operands
+ - Exclude global variables (mutableRange.start === 0) since they cannot be recreated
+ - Union all collected operands together
+
+### Phase 2: Assign Scopes
+
+1. Iterate over all identifiers in the disjoint set using `forEach(item, groupIdentifier)`
+2. For each unique group, create a new ReactiveScope:
+ - Generate a unique ScopeId from the environment
+ - Initialize range from the first member's mutableRange
+ - Set up empty dependencies, declarations, reassignments sets
+3. For subsequent members of the same group:
+ - Expand the scope's range to encompass the member's mutableRange
+ - Merge source locations
+4. Assign the scope to each identifier: `identifier.scope = scope`
+5. Update each identifier's mutableRange to match the scope's range
+
+**Validation**: After scope assignment, validate that all scopes have valid ranges within [1, maxInstruction+1].
+
+## Key Data Structures
+
+### DisjointSet
+A Union-Find data structure optimized for grouping items into disjoint sets:
+
+```typescript
+class DisjointSet {
+ #entries: Map; // Maps each item to its parent (root points to self)
+
+ union(items: Array): void; // Merge items into one set
+ find(item: T): T | null; // Find the root of item's set (with path compression)
+ forEach(fn: (item, group) => void): void; // Iterate all items with their group root
+}
+```
+
+Path compression is used during `find()` to flatten the tree structure, improving subsequent lookup performance.
+
+### ReactiveScope
+```typescript
+type ReactiveScope = {
+ id: ScopeId;
+ range: MutableRange; // [start, end) instruction range
+ dependencies: Set; // Inputs (populated later)
+ declarations: Map; // Outputs (populated later)
+ reassignments: Set; // Reassigned variables (populated later)
+ earlyReturnValue: {...} | null; // For scopes with early returns
+ merged: Set; // IDs of scopes merged into this one
+ loc: SourceLocation;
+};
+```
+
+## Edge Cases
+
+### Global Variables
+Excluded from scopes (mutableRange.start === 0) since they cannot be recreated during memoization.
+
+### Phi Nodes After Mutation
+When a phi's result is mutated after the join point, all phi operands must be in the same scope to ensure the mutation can be recomputed correctly.
+
+### MethodCall Property Resolution
+The computed property load for a method call is explicitly added to the same scope as the call itself.
+
+### Allocating Instructions
+Instructions that allocate (Array, Object, JSX, etc.) add their lvalue to the scope even if the lvalue has a single-instruction range.
+
+### Single-Instruction Ranges
+Values with range `[n, n+1)` (used exactly once) are only included if they allocate, otherwise they're just read.
+
+### enableForest Config
+When enabled, phi operands are unconditionally unioned with the phi result (even without mutation after the phi).
+
+## TODOs
+1. `// TODO: improve handling of module-scoped variables and globals` - The current approach excludes globals entirely, but a more nuanced handling could be beneficial.
+
+2. Known issue with aliasing and mutable lifetimes (from header comments):
+```javascript
+let x = {};
+let y = [];
+x.y = y; // RHS is not considered mutable here bc not further mutation
+mutate(x); // bc y is aliased here, it should still be considered mutable above
+```
+This suggests the pass may miss some co-mutation relationships when aliasing is involved.
+
+## Example
+
+### Fixture: `reactive-scope-grouping.js`
+
+**Input:**
+```javascript
+function foo() {
+ let x = {};
+ let y = [];
+ let z = {};
+ y.push(z); // y and z co-mutate (z captured into y)
+ x.y = y; // x and y co-mutate (y captured into x)
+ return x;
+}
+```
+
+**After InferReactiveScopeVariables:**
+```
+[1] mutate? $19_@0[1:14] = Object { } // x's initial object, scope @0
+[2] store $21_@0[1:14] = StoreLocal x // x in scope @0
+[3] mutate? $22_@1[3:11] = Array [] // y's array, scope @1
+[4] store $24_@1[3:11] = StoreLocal y // y in scope @1
+[5] mutate? $25_@2 = Object { } // z's object, scope @2
+[10] MethodCall y.push(z) // Mutates y, captures z
+[13] PropertyStore x.y = y // Mutates x, captures y
+```
+
+The `y.push(z)` joins y and z into scope @1, and `x.y = y` joins x and y into scope @0. Because y is now in @0, and z was captured into y, ultimately x, y, and z all end up in the same scope @0.
+
+**Compiled Output:**
+```javascript
+function foo() {
+ const $ = _c(1);
+ let x;
+ if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
+ x = {};
+ const y = [];
+ const z = {};
+ y.push(z);
+ x.y = y;
+ $[0] = x;
+ } else {
+ x = $[0];
+ }
+ return x;
+}
+```
+
+All three objects (x, y, z) are created within the same memoization block because they co-mutate and could potentially alias each other.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/12-rewriteInstructionKindsBasedOnReassignment.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/12-rewriteInstructionKindsBasedOnReassignment.md
new file mode 100644
index 000000000000..556a80783cae
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/12-rewriteInstructionKindsBasedOnReassignment.md
@@ -0,0 +1,151 @@
+# rewriteInstructionKindsBasedOnReassignment
+
+## File
+`src/SSA/RewriteInstructionKindsBasedOnReassignment.ts`
+
+## Purpose
+Rewrites the `InstructionKind` of variable declaration and assignment instructions to correctly reflect whether variables should be declared as `const` or `let` in the final output. It determines this based on whether a variable is subsequently reassigned after its initial declaration.
+
+The key insight is that this pass runs **after dead code elimination (DCE)**, so a variable that was originally declared with `let` in the source (because it was reassigned) may be converted to `const` if the reassignment was removed by DCE. However, variables originally declared as `const` cannot become `let`.
+
+## Input Invariants
+- SSA form: Each identifier has a unique `IdentifierId` and `DeclarationId`
+- Dead code elimination has run: Unused assignments have been removed
+- Mutation/aliasing inference complete: Runs after `InferMutationAliasingRanges` and `InferReactivePlaces` in the main pipeline
+- All instruction kinds are initially set (typically `Let` for variables that may be reassigned)
+
+## Output Guarantees
+- **First declaration gets `Const` or `Let`**: The first `StoreLocal` for a named variable is marked as:
+ - `InstructionKind.Const` if the variable is never reassigned after
+ - `InstructionKind.Let` if the variable has subsequent reassignments
+- **Reassignments marked as `Reassign`**: Any subsequent `StoreLocal` to the same `DeclarationId` is marked as `InstructionKind.Reassign`
+- **Destructure consistency**: All places in a destructuring pattern must have consistent kinds (all Const or all Reassign)
+- **Update operations trigger Let**: `PrefixUpdate` and `PostfixUpdate` operations (like `++x` or `x--`) mark the original declaration as `Let`
+
+## Algorithm
+
+1. **Initialize declarations map**: Create a `Map` to track declared variables.
+
+2. **Seed with parameters and context**: Add all named function parameters and captured context variables to the map with kind `Let` (since they're already "declared" outside the function body).
+
+3. **Process blocks in order**: Iterate through all blocks and instructions:
+
+ - **DeclareLocal**: Record the declaration in the map (invariant: must not already exist)
+
+ - **StoreLocal**:
+ - If not in map: This is the first store, add to map with `kind = Const`
+ - If already in map: This is a reassignment. Update original declaration to `Let`, set current instruction to `Reassign`
+
+ - **Destructure**:
+ - For each operand in the pattern, check if it's already declared
+ - All operands must be consistent (all new declarations OR all reassignments)
+ - Set pattern kind to `Const` for new declarations, `Reassign` for existing ones
+
+ - **PrefixUpdate / PostfixUpdate**: Look up the declaration and mark it as `Let` (these always imply reassignment)
+
+## Key Data Structures
+
+```typescript
+// Main tracking structure
+const declarations = new Map();
+
+// InstructionKind enum (from HIR.ts)
+enum InstructionKind {
+ Const = 'Const', // const declaration
+ Let = 'Let', // let declaration
+ Reassign = 'Reassign', // reassignment to existing binding
+ Catch = 'Catch', // catch clause binding
+ HoistedLet = 'HoistedLet', // hoisted let
+ HoistedConst = 'HoistedConst', // hoisted const
+ HoistedFunction = 'HoistedFunction', // hoisted function
+ Function = 'Function', // function declaration
+}
+```
+
+## Edge Cases
+
+### DCE Removes Reassignment
+A `let x = 0; x = 1;` where `x = 1` is unused becomes `const x = 0;` after DCE.
+
+### Destructuring with Mixed Operands
+The invariant checks ensure all operands in a destructure pattern are either all new declarations or all reassignments. Mixed cases cause a compiler error.
+
+### Value Blocks with DCE
+There's a TODO for handling reassignment in value blocks where the original declaration was removed by DCE.
+
+### Parameters and Context Variables
+These are pre-seeded as `Let` in the declarations map since they're conceptually "declared" at function entry.
+
+### Update Expressions
+`++x` and `x--` always mark the variable as `Let`, even if used inline.
+
+## TODOs
+```typescript
+CompilerError.invariant(block.kind !== 'value', {
+ reason: `TODO: Handle reassignment in a value block where the original
+ declaration was removed by dead code elimination (DCE)`,
+ ...
+});
+```
+
+This indicates an edge case where a destructuring reassignment occurs in a value block but the original declaration was eliminated by DCE. This is currently an invariant violation rather than handled gracefully.
+
+## Example
+
+### Fixture: `reassignment.js`
+
+**Input Source:**
+```javascript
+function Component(props) {
+ let x = [];
+ x.push(props.p0);
+ let y = x;
+
+ x = [];
+ let _ = ;
+
+ y.push(props.p1);
+
+ return ;
+}
+```
+
+**Before Pass (InferReactivePlaces output):**
+```
+[2] StoreLocal Let x$32 = $31 // x is initially marked Let
+[9] StoreLocal Let y$40 = $39 // y is initially marked Let
+[11] StoreLocal Reassign x$43 = $42 // reassignment already marked
+```
+
+**After Pass:**
+```
+[2] StoreLocal Let x$32 = $31 // x stays Let (has reassignment at line 11)
+[9] StoreLocal Const y$40 = $39 // y becomes Const (never reassigned)
+[11] StoreLocal Reassign x$43 = $42 // stays Reassign
+```
+
+**Final Generated Code:**
+```javascript
+function Component(props) {
+ const $ = _c(4);
+ let t0;
+ if ($[0] !== props.p0 || $[1] !== props.p1) {
+ let x = []; // let because reassigned
+ x.push(props.p0);
+ const y = x; // const because never reassigned
+ // ... x = t1; (reassignment)
+ y.push(props.p1);
+ t0 = ;
+ // ...
+ }
+ return t0;
+}
+```
+
+The pass correctly identified that `x` needs `let` (since it's reassigned on line 6 of the source) while `y` can use `const` (it's never reassigned after initialization).
+
+## Where This Pass is Called
+
+1. **Main Pipeline** (`src/Entrypoint/Pipeline.ts:322`): Called after `InferReactivePlaces` and before `InferReactiveScopeVariables`.
+
+2. **AnalyseFunctions** (`src/Inference/AnalyseFunctions.ts:58`): Called when lowering inner function expressions as part of the function analysis phase.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/13-alignMethodCallScopes.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/13-alignMethodCallScopes.md
new file mode 100644
index 000000000000..8fef182c087a
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/13-alignMethodCallScopes.md
@@ -0,0 +1,131 @@
+# alignMethodCallScopes
+
+## File
+`src/ReactiveScopes/AlignMethodCallScopes.ts`
+
+## Purpose
+Ensures that `MethodCall` instructions and their associated `PropertyLoad` instructions (which load the method being called) have consistent scope assignments. The pass enforces one of two invariants:
+1. Both the MethodCall lvalue and the property have the **same** reactive scope
+2. **Neither** has a reactive scope
+
+This alignment is critical because the PropertyLoad and MethodCall are semantically a single operation (`receiver.method(args)`) and must be memoized together as a unit. If they had different scopes, the generated code would incorrectly try to memoize the property load separately from the method call, which could break correctness.
+
+## Input Invariants
+- The function has been converted to HIR form
+- `inferReactiveScopeVariables` has already run, assigning initial reactive scopes to identifiers based on mutation analysis
+- Each instruction's lvalue has an `identifier.scope` that is either a `ReactiveScope` or `null`
+- For `MethodCall` instructions, the `value.property` field contains a `Place` referencing the loaded method
+
+## Output Guarantees
+After this pass runs:
+- For every `MethodCall` instruction in the function:
+ - If the lvalue has a scope AND the property has a scope, they point to the **same merged scope**
+ - If only the lvalue has a scope, the property's scope is set to match the lvalue's scope
+ - If only the property has a scope, the property's scope is set to `null` (so neither has a scope)
+- Merged scopes have their `range` extended to cover the union of the original scopes' ranges
+- Nested functions (FunctionExpression, ObjectMethod) are recursively processed
+
+## Algorithm
+
+### Phase 1: Collect Scope Relationships
+```
+For each instruction in all blocks:
+ If instruction is a MethodCall:
+ lvalueScope = instruction.lvalue.identifier.scope
+ propertyScope = instruction.value.property.identifier.scope
+
+ If both have scopes:
+ Record that these scopes should be merged (using DisjointSet.union)
+ Else if only lvalue has scope:
+ Record that property should be assigned to lvalueScope
+ Else if only property has scope:
+ Record that property should be assigned to null (no scope)
+
+ If instruction is FunctionExpression or ObjectMethod:
+ Recursively process the nested function
+```
+
+### Phase 2: Merge Scopes
+```
+For each merged scope group:
+ Pick a "root" scope
+ Extend root's range to cover all merged scopes:
+ root.range.start = min(all scope start points)
+ root.range.end = max(all scope end points)
+```
+
+### Phase 3: Apply Changes
+```
+For each instruction:
+ If lvalue was recorded for remapping:
+ Set identifier.scope to the mapped value
+ Else if identifier has a scope that was merged:
+ Set identifier.scope to the merged root scope
+```
+
+## Key Data Structures
+
+1. **`scopeMapping: Map`**
+ - Maps property identifier IDs to their new scope assignment
+ - Value of `null` means the scope should be removed
+
+2. **`mergedScopes: DisjointSet`**
+ - Union-find data structure tracking scopes that need to be merged
+ - Used when both MethodCall and property have different scopes
+
+3. **`ReactiveScope`** (from HIR)
+ - Contains `range: { start: InstructionId, end: InstructionId }`
+ - The range defines which instructions are part of the scope
+
+## Edge Cases
+
+### Both Have the Same Scope Already
+No action needed (implicit in the logic).
+
+### Nested Functions
+The pass recursively processes `FunctionExpression` and `ObjectMethod` instructions to handle closures.
+
+### Multiple MethodCalls Sharing Scopes
+The DisjointSet handles transitive merging - if A merges with B, and B merges with C, all three end up in the same scope.
+
+### Property Without Scope, MethodCall Without Scope
+No action needed (both already aligned at `null`).
+
+## TODOs
+There are no explicit TODO comments in the source code.
+
+## Example
+
+### Fixture: `alias-capture-in-method-receiver.js`
+
+**Source code:**
+```javascript
+function Component() {
+ let a = someObj();
+ let x = [];
+ x.push(a);
+ return [x, a];
+}
+```
+
+**Before AlignMethodCallScopes:**
+```
+[7] store $24_@1[4:10]:TFunction = PropertyLoad capture $23_@1.push
+[9] mutate? $26:TPrimitive = MethodCall store $23_@1.read $24_@1(capture $25)
+```
+- PropertyLoad result `$24_@1` has scope `@1`
+- MethodCall result `$26` has no scope (`null`)
+
+**After AlignMethodCallScopes:**
+```
+[7] store $24[4:10]:TFunction = PropertyLoad capture $23_@1.push
+[9] mutate? $26:TPrimitive = MethodCall store $23_@1.read $24(capture $25)
+```
+- PropertyLoad result `$24` now has **no scope** (the `_@1` suffix removed)
+- MethodCall result `$26` still has no scope
+
+**Why this matters:**
+Without this alignment, later passes might try to memoize the `.push` property load separately from the actual `push()` call. This would be incorrect because:
+1. Reading a method from an object and calling it are semantically one operation
+2. The property load's value (the bound method) is only valid immediately when called on the same receiver
+3. Separate memoization could lead to stale method references or incorrect this-binding
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/14-alignObjectMethodScopes.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/14-alignObjectMethodScopes.md
new file mode 100644
index 000000000000..ebb78ba16cb4
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/14-alignObjectMethodScopes.md
@@ -0,0 +1,128 @@
+# alignObjectMethodScopes
+
+## File
+`src/ReactiveScopes/AlignObjectMethodScopes.ts`
+
+## Purpose
+Ensures that object method values and their enclosing object expressions share the same reactive scope. This is critical for code generation because JavaScript requires object method definitions to be inlined within their containing object literals. If the object method and object expression were in different reactive scopes (which map to different memoization blocks), the generated code would be invalid since you cannot reference an object method defined in one block from an object literal in a different block.
+
+From the file's documentation:
+> "To produce a well-formed JS program in Codegen, object methods and object expressions must be in the same ReactiveBlock as object method definitions must be inlined."
+
+## Input Invariants
+- Reactive scopes have been inferred: This pass runs after `InferReactiveScopeVariables`
+- ObjectMethod and ObjectExpression have non-null scopes: The pass asserts this with an invariant check
+- Scopes are disjoint across functions: The pass assumes that scopes do not overlap between parent and nested functions
+
+## Output Guarantees
+- ObjectMethod and ObjectExpression share the same scope: Any ObjectMethod used as a property in an ObjectExpression will have its scope merged with the ObjectExpression's scope
+- Merged scope covers both ranges: The resulting merged scope's range is expanded to cover the minimum start and maximum end of all merged scopes
+- All identifiers are repointed: All identifiers whose scopes were merged are updated to point to the canonical root scope
+- Inner functions are also processed: The pass recursively handles nested ObjectMethod and FunctionExpression values
+
+## Algorithm
+
+### Phase 1: Find Scopes to Merge (`findScopesToMerge`)
+1. Iterate through all blocks and instructions in the function
+2. Track all ObjectMethod declarations in a set by their lvalue identifier
+3. When encountering an ObjectExpression, check each operand:
+ - If an operand's identifier was previously recorded as an ObjectMethod declaration
+ - Get the scope of both the ObjectMethod operand and the ObjectExpression lvalue
+ - Assert both scopes are non-null
+ - Union these two scopes together in a DisjointSet data structure
+
+### Phase 2: Merge and Repoint Scopes (`alignObjectMethodScopes`)
+1. Recursively process inner functions first (ObjectMethod and FunctionExpression values)
+2. Canonicalize the DisjointSet to get a mapping from each scope to its root
+3. **Step 1 - Merge ranges**: For each scope that maps to a different root:
+ - Expand the root's range to encompass both the original range and the merged scope's range
+ - `root.range.start = min(scope.range.start, root.range.start)`
+ - `root.range.end = max(scope.range.end, root.range.end)`
+4. **Step 2 - Repoint identifiers**: For each instruction's lvalue:
+ - If the identifier has a scope that was merged
+ - Update the identifier's scope reference to point to the canonical root
+
+## Key Data Structures
+
+1. **DisjointSet** - A union-find data structure that tracks which scopes should be merged together. Uses path compression for efficient `find()` operations.
+
+2. **Set** - Tracks which identifiers are ObjectMethod declarations, used to identify when an ObjectExpression operand is an object method.
+
+3. **ReactiveScope** - Contains:
+ - `id: ScopeId` - Unique identifier
+ - `range: MutableRange` - Start and end instruction IDs
+ - `dependencies` - Inputs to the scope
+ - `declarations` - Values produced by the scope
+
+4. **MutableRange** - Has `start` and `end` InstructionId fields that define the scope's extent.
+
+## Edge Cases
+
+### Nested Object Methods
+When an object method itself contains another object with methods, the pass recursively processes inner functions first before handling the outer function's scopes.
+
+### Multiple Object Methods in Same Object
+If an object has multiple method properties, all their scopes will be merged with the object's scope through the DisjointSet.
+
+### Object Methods in Conditional Expressions
+Object methods inside ternary expressions still need scope alignment to ensure the method and its containing object are in the same reactive block.
+
+### Method Call After Object Creation
+The pass works in conjunction with `AlignMethodCallScopes` (which runs immediately before) to ensure that method calls on objects with object methods are also properly scoped.
+
+## TODOs
+None explicitly marked in the source file.
+
+## Example
+
+### Fixture: `object-method-shorthand.js`
+
+**Input:**
+```javascript
+function Component() {
+ let obj = {
+ method() {
+ return 1;
+ },
+ };
+ return obj.method();
+}
+```
+
+**Before AlignObjectMethodScopes:**
+```
+InferReactiveScopeVariables:
+ [1] mutate? $12_@0:TObjectMethod = ObjectMethod ... // scope @0
+ [2] mutate? $14_@1[2:7]:TObject = Object { method: ... } // scope @1 (range 2:7)
+```
+The ObjectMethod `$12` is in scope `@0` while the ObjectExpression `$14` is in scope `@1` with range `[2:7]`.
+
+**After AlignObjectMethodScopes:**
+```
+AlignObjectMethodScopes:
+ [1] mutate? $12_@0[1:7]:TObjectMethod = ObjectMethod ... // scope @0, range now 1:7
+ [2] mutate? $14_@0[1:7]:TObject = Object { method: ... } // also scope @0, range 1:7
+```
+Both identifiers are in the same scope `@0`, and the scope's range has been expanded to `[1:7]` to cover both instructions.
+
+**Final Generated Code:**
+```javascript
+function Component() {
+ const $ = _c(1);
+ let t0;
+ if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
+ const obj = {
+ method() {
+ return 1;
+ },
+ };
+ t0 = obj.method();
+ $[0] = t0;
+ } else {
+ t0 = $[0];
+ }
+ return t0;
+}
+```
+
+The object literal with its method and the subsequent method call are all inside the same memoization block, producing valid JavaScript where the method definition is inlined within the object literal.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/15-alignReactiveScopesToBlockScopesHIR.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/15-alignReactiveScopesToBlockScopesHIR.md
new file mode 100644
index 000000000000..1230ecbaa838
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/15-alignReactiveScopesToBlockScopesHIR.md
@@ -0,0 +1,177 @@
+# alignReactiveScopesToBlockScopesHIR
+
+## File
+`src/ReactiveScopes/AlignReactiveScopesToBlockScopesHIR.ts`
+
+## Purpose
+This is the **2nd of 4 passes** that determine how to break a function into discrete reactive scopes (independently memoizable units of code). The pass aligns reactive scope boundaries to control flow (block scope) boundaries.
+
+The problem it solves: Prior inference passes assign reactive scopes to operands based on mutation ranges at arbitrary instruction points in the control-flow graph. However, to generate memoization blocks around instructions, scopes must be aligned to block-scope boundaries -- you cannot memoize half of a loop or half of an if-block.
+
+**Example from the source code comments:**
+```javascript
+function foo(cond, a) {
+ // original scope end
+ // expanded scope end
+ const x = []; | |
+ if (cond) { | |
+ ... | |
+ x.push(a); <--- original scope ended here
+ ... |
+ } <--- scope must extend to here
+}
+```
+
+## Input Invariants
+- `InferReactiveScopeVariables` has run: Each identifier has been assigned a `ReactiveScope` with a `range` (start/end instruction IDs) based on mutation analysis
+- The HIR is in SSA form: Blocks have unique IDs, instructions have unique IDs, and control flow is represented with basic blocks
+- Each block has a terminal with possible successors and fallthroughs
+- Each scope has a mutable range `{start: InstructionId, end: InstructionId}` indicating when the scope is active
+
+## Output Guarantees
+- **Scopes end at valid block boundaries**: A reactive scope may only end at the same block scope level as it began. The scope's `range.end` is updated to the first instruction of the fallthrough block after any control flow structure that the scope overlaps
+- **Scopes start at valid block boundaries**: For labeled breaks (gotos to a label), scopes that extend beyond the goto have their `range.start` extended back to include the label
+- **Value blocks (ternary, logical, optional) are handled specially**: Scopes inside value blocks are extended to align with the outer block scope's instruction range
+
+## Algorithm
+
+The pass performs a single forward traversal over all blocks:
+
+### 1. Tracking Active Scopes
+- Maintains `activeScopes: Set` - scopes whose range overlaps the current block
+- Maintains `activeBlockFallthroughRanges: Array<{range, fallthrough}>` - stack of pending block-fallthrough ranges
+
+### 2. Per-Block Processing
+For each block:
+- Prune `activeScopes` to only those that extend past the current block's start
+- If this block is a fallthrough target, pop the range from the stack and extend all active scopes' start to the range start
+
+### 3. Recording Places
+For each instruction lvalue and operand:
+- If the place has a scope, add it to `activeScopes`
+- If inside a value block, extend the scope's range to match the value block's outer range
+
+### 4. Handling Block Fallthroughs
+When a terminal has a fallthrough (not a simple branch):
+- Extend all active scopes whose `range.end > terminal.id` to at least the first instruction of the fallthrough block
+- Push the fallthrough range onto the stack for future scopes
+
+### 5. Handling Labeled Breaks (Goto)
+When encountering a goto to a label (not the natural fallthrough):
+- Find the corresponding fallthrough range on the stack
+- Extend all active scopes to span from the label start to its fallthrough end
+
+### 6. Value Block Handling
+For ternary, logical, and optional terminals:
+- Create `ValueBlockNode` to track the outer block's instruction range
+- Scopes inside value blocks inherit this range, ensuring they align to the outer block scope
+
+## Key Data Structures
+
+```typescript
+type ValueBlockNode = {
+ kind: 'node';
+ id: InstructionId;
+ valueRange: MutableRange; // Range of outer block scope
+ children: Array;
+};
+
+type ReactiveScopeNode = {
+ kind: 'scope';
+ id: InstructionId;
+ scope: ReactiveScope;
+};
+
+// Tracked during traversal:
+activeBlockFallthroughRanges: Array<{
+ range: InstructionRange;
+ fallthrough: BlockId;
+}>;
+activeScopes: Set;
+valueBlockNodes: Map;
+```
+
+## Edge Cases
+
+### Labeled Breaks
+When a `goto` jumps to a label (not the natural fallthrough), scopes must be extended to include the entire labeled block range, preventing the break from jumping out of the scope.
+
+### Value Blocks (Ternary/Logical/Optional)
+These create nested "value" contexts. Scopes inside must be aligned to the outer block scope's boundaries, not the value block's boundaries.
+
+### Nested Control Flow
+Deeply nested if-statements require the scope to be extended through all levels back to the outermost block where the scope started.
+
+### do-while and try/catch
+The terminal's successor might be a block (not value block), which is handled specially.
+
+## TODOs
+1. `// TODO: consider pruning activeScopes per instruction` - Currently, `activeScopes` is only pruned at block start points. Some scopes may no longer be active by the time a goto is encountered.
+
+2. `// TODO: add a variant of eachTerminalSuccessor() that visits _all_ successors, not just those that are direct successors for normal control-flow ordering.` - The current implementation uses `mapTerminalSuccessors` which may not visit all successors in all cases.
+
+## Example
+
+### Fixture: `extend-scopes-if.js`
+
+**Input:**
+```javascript
+function foo(a, b, c) {
+ let x = [];
+ if (a) {
+ if (b) {
+ if (c) {
+ x.push(0); // Mutation of x ends here (instruction 12-13)
+ }
+ }
+ }
+ if (x.length) { // instruction 16
+ return x;
+ }
+ return null;
+}
+```
+
+**Before AlignReactiveScopesToBlockScopesHIR:**
+```
+x$23_@0[1:13] // Scope range 1-13
+```
+The scope for `x` ends at instruction 13 (inside the innermost if block).
+
+**After AlignReactiveScopesToBlockScopesHIR:**
+```
+x$23_@0[1:16] // Scope range extended to 1-16
+```
+The scope is extended to instruction 16 (the first instruction after all the nested if-blocks), aligning to the block scope boundary.
+
+**Generated Code:**
+```javascript
+function foo(a, b, c) {
+ const $ = _c(4);
+ let x;
+ if ($[0] !== a || $[1] !== b || $[2] !== c) {
+ x = [];
+ if (a) {
+ if (b) {
+ if (c) {
+ x.push(0);
+ }
+ }
+ }
+ // Scope ends here, after ALL the if-blocks
+ $[0] = a;
+ $[1] = b;
+ $[2] = c;
+ $[3] = x;
+ } else {
+ x = $[3];
+ }
+ // Code outside the scope
+ if (x.length) {
+ return x;
+ }
+ return null;
+}
+```
+
+The memoization block correctly wraps the entire nested if-structure, not just part of it.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/16-mergeOverlappingReactiveScopesHIR.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/16-mergeOverlappingReactiveScopesHIR.md
new file mode 100644
index 000000000000..e7b008df8f3a
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/16-mergeOverlappingReactiveScopesHIR.md
@@ -0,0 +1,134 @@
+# mergeOverlappingReactiveScopesHIR
+
+## File
+`src/HIR/MergeOverlappingReactiveScopesHIR.ts`
+
+## Purpose
+This pass ensures that reactive scope ranges form valid, non-overlapping blocks in the output JavaScript program. It merges reactive scopes that would otherwise be inconsistent with each other due to:
+
+1. **Overlapping ranges**: Scopes whose instruction ranges partially overlap (not disjoint and not nested) must be merged because the compiler cannot produce valid `if-else` memo blocks for overlapping scopes.
+
+2. **Cross-scope mutations**: When an instruction within one scope mutates a value belonging to a different (outer) scope, those scopes must be merged to maintain correctness.
+
+The pass guarantees that after execution, any two reactive scopes are either:
+- Entirely disjoint (no common instructions)
+- Properly nested (one scope is completely contained within the other)
+
+## Input Invariants
+- Reactive scope variables have been inferred (`InferReactiveScopeVariables` pass has run)
+- Scopes have been aligned to block scopes (`AlignReactiveScopesToBlockScopesHIR` pass has run)
+- Each `Place` may have an associated `ReactiveScope` with a `range` (start/end instruction IDs)
+- Scopes may still have overlapping ranges or contain instructions that mutate outer scopes
+
+## Output Guarantees
+- **No overlapping scopes**: All reactive scopes either are disjoint or properly nested
+- **Consistent mutation boundaries**: Instructions only mutate their "active" scope (the innermost containing scope)
+- **Merged scope ranges**: Merged scopes have their ranges extended to cover the union of all constituent scopes
+- **Updated references**: All `Place` references have their `identifier.scope` updated to point to the merged scope
+
+## Algorithm
+
+### Phase 1: Collect Scope Information (`collectScopeInfo`)
+- Iterates through all instructions and terminals in the function
+- Records for each `Place`:
+ - The scope it belongs to (`placeScopes` map)
+ - When scopes start and end (`scopeStarts` and `scopeEnds` arrays, sorted in descending order by ID)
+- Only records scopes with non-empty ranges (`range.start !== range.end`)
+
+### Phase 2: Detect Overlapping Scopes (`getOverlappingReactiveScopes`)
+Uses a stack-based traversal to track "active" scopes at each instruction:
+
+1. **For each instruction/terminal**:
+ - **Handle scope endings**: Pop completed scopes from the active stack. If a scope ends while other scopes that started later are still active (detected by finding the scope is not at the top of the stack), those scopes overlap and must be merged via `DisjointSet.union()`.
+
+ - **Handle scope starts**: Push new scopes onto the active stack (sorted by end time descending so earlier-ending scopes are at the top). Merge any scopes that have identical start/end ranges.
+
+ - **Handle mutations**: For each operand/lvalue, if it:
+ - Has an associated scope
+ - Is mutable at the current instruction
+ - The scope is active but not at the top of the stack (i.e., an outer scope)
+
+ Then merge all scopes from the mutated outer scope to the top of the stack.
+
+2. **Special case**: Primitive operands in `FunctionExpression` and `ObjectMethod` are skipped.
+
+### Phase 3: Merge Scopes and Rewrite References
+1. For each scope in the disjoint set, compute the merged range as the union (min start, max end)
+2. Update all `Place.identifier.scope` references to point to the merged "group" scope
+
+## Key Data Structures
+
+### ScopeInfo
+```typescript
+type ScopeInfo = {
+ scopeStarts: Array<{id: InstructionId; scopes: Set}>;
+ scopeEnds: Array<{id: InstructionId; scopes: Set}>;
+ placeScopes: Map;
+};
+```
+
+### TraversalState
+```typescript
+type TraversalState = {
+ joined: DisjointSet; // Union-find for merged scopes
+ activeScopes: Array; // Stack of currently active scopes
+};
+```
+
+### DisjointSet
+A union-find data structure that tracks which scopes should be merged into the same group.
+
+## Edge Cases
+
+### Identical Scope Ranges
+When multiple scopes have the exact same start and end, they are automatically merged since they would produce the same reactive block.
+
+### Empty Scopes
+Scopes where `range.start === range.end` are skipped entirely.
+
+### Primitive Captures in Functions
+When a `FunctionExpression` or `ObjectMethod` captures a primitive operand, it's excluded from scope merging analysis.
+
+### JSX Single-Instruction Scopes
+The comment in the code notes this isn't perfect - mutating scopes may get merged with JSX single-instruction scopes.
+
+### Non-Mutating Captures
+The pass records both mutating and non-mutating scopes to handle cases where still-mutating values are aliased by inner scopes.
+
+## TODOs
+From the comments in the source file, the design constraints arise from the current compiler output design:
+- **Instruction ordering is preserved**: If reordering were allowed, disjoint ranges could be produced by reordering mutating instructions
+- **One if-else block per scope**: The current design doesn't allow composing a reactive scope from disconnected instruction ranges
+
+## Example
+
+### Fixture: `overlapping-scopes-interleaved.js`
+
+**Input Code:**
+```javascript
+function foo(a, b) {
+ let x = [];
+ let y = [];
+ x.push(a);
+ y.push(b);
+}
+```
+
+**Before MergeOverlappingReactiveScopesHIR:**
+```
+[1] $20_@0[1:9] = Array [] // x belongs to scope @0, range [1:9]
+[2] x$21_@0[1:9] = StoreLocal...
+[3] $23_@1[3:13] = Array [] // y belongs to scope @1, range [3:13]
+[4] y$24_@1[3:13] = StoreLocal...
+```
+Scopes @0 [1:9] and @1 [3:13] overlap: @0 starts at 1, @1 starts at 3, @0 ends at 9, @1 ends at 13. This is invalid.
+
+**After MergeOverlappingReactiveScopesHIR:**
+```
+[1] $20_@0[1:13] = Array [] // Merged scope @0, range [1:13]
+[2] x$21_@0[1:13] = StoreLocal...
+[3] $23_@0[1:13] = Array [] // Now also scope @0
+[4] y$24_@0[1:13] = StoreLocal...
+```
+
+Both `x` and `y` now belong to the same merged scope @0 with range [1:13], producing a single `if-else` memo block in the output.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/17-buildReactiveScopeTerminalsHIR.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/17-buildReactiveScopeTerminalsHIR.md
new file mode 100644
index 000000000000..a9c31dd1ec6a
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/17-buildReactiveScopeTerminalsHIR.md
@@ -0,0 +1,161 @@
+# buildReactiveScopeTerminalsHIR
+
+## File
+`src/HIR/BuildReactiveScopeTerminalsHIR.ts`
+
+## Purpose
+This pass transforms the HIR by inserting `ReactiveScopeTerminal` nodes to explicitly demarcate the boundaries of reactive scopes within the control flow graph. It converts the implicit scope ranges (stored on identifiers as `identifier.scope.range`) into explicit control flow structure by:
+
+1. Inserting a `scope` terminal at the **start** of each reactive scope
+2. Inserting a `goto` terminal at the **end** of each reactive scope
+3. Creating fallthrough blocks to properly connect the scopes to the rest of the CFG
+
+This transformation makes scope boundaries first-class elements in the CFG, which is essential for later passes that generate the memoization code (the `if ($[n] !== dep)` checks).
+
+## Input Invariants
+- **Properly nested scopes and blocks**: The pass assumes `assertValidBlockNesting` has passed, meaning all program blocks and reactive scopes form a proper tree hierarchy
+- **Aligned scope ranges**: Reactive scope ranges have been correctly aligned and merged by previous passes
+- **Valid instruction IDs**: All instructions have sequential IDs that define the scope boundaries
+- **Scopes attached to identifiers**: Reactive scopes are found by traversing all `Place` operands and collecting unique non-empty scopes
+
+## Output Guarantees
+- **Explicit scope terminals**: Each reactive scope is represented in the CFG as a `ReactiveScopeTerminal` with:
+ - `block` - The BlockId containing the scope's instructions
+ - `fallthrough` - The BlockId that executes after the scope
+- **Proper block structure**: Original blocks are split at scope boundaries
+- **Restored HIR invariants**: The pass restores RPO ordering, predecessor sets, instruction IDs, and scope/identifier ranges
+- **Updated phi nodes**: Phi operands are repointed when their source blocks are split
+
+## Algorithm
+
+### Step 1: Collect Scope Rewrites
+```
+for each reactive scope (in range pre-order):
+ push StartScope rewrite at scope.range.start
+ push EndScope rewrite at scope.range.end
+```
+The `recursivelyTraverseItems` helper traverses scopes in pre-order (outer scopes before inner scopes).
+
+### Step 2: Apply Rewrites by Splitting Blocks
+```
+reverse queuedRewrites (to pop in ascending instruction order)
+for each block:
+ for each instruction (or terminal):
+ while there are rewrites <= current instruction ID:
+ split block at current index
+ insert scope terminal (for start) or goto terminal (for end)
+ emit final block segment with original terminal
+```
+
+### Step 3: Repoint Phi Nodes
+When a block is split, its final segment gets a new BlockId. Phi operands that referenced the original block are updated to reference the new final block.
+
+### Step 4: Restore HIR Invariants
+- Recompute RPO (reverse post-order) block traversal
+- Recalculate predecessor sets
+- Renumber instruction IDs
+- Fix scope and identifier ranges to match new instruction IDs
+
+## Key Data Structures
+
+### TerminalRewriteInfo
+```typescript
+type TerminalRewriteInfo =
+ | {
+ kind: 'StartScope';
+ blockId: BlockId; // New block for scope content
+ fallthroughId: BlockId; // Block after scope ends
+ instrId: InstructionId; // Where to insert
+ scope: ReactiveScope; // The scope being created
+ }
+ | {
+ kind: 'EndScope';
+ instrId: InstructionId; // Where to insert
+ fallthroughId: BlockId; // Same as corresponding StartScope
+ };
+```
+
+### RewriteContext
+```typescript
+type RewriteContext = {
+ source: BasicBlock; // Original block being split
+ instrSliceIdx: number; // Current slice start index
+ nextPreds: Set; // Predecessors for next emitted block
+ nextBlockId: BlockId; // BlockId for next emitted block
+ rewrites: Array; // Accumulated split blocks
+};
+```
+
+### ScopeTraversalContext
+```typescript
+type ScopeTraversalContext = {
+ fallthroughs: Map; // Cache: scope -> its fallthrough block
+ rewrites: Array;
+ env: Environment;
+};
+```
+
+## Edge Cases
+
+### Multiple Rewrites at Same Instruction ID
+The while loop in Step 2 handles multiple scope start/ends at the same instruction ID.
+
+### Nested Scopes
+The pre-order traversal ensures outer scopes are processed before inner scopes, creating proper nesting in the CFG.
+
+### Empty Blocks After Split
+When a scope boundary falls at the start of a block, the split may create a block with no instructions (only a terminal).
+
+### Control Flow Within Scopes
+The pass preserves existing control flow (if/else, loops) within scopes; it only adds scope entry/exit points.
+
+### Early Returns
+When a return occurs within a scope, the scope terminal still has a fallthrough block, but that block may contain `Unreachable` terminal.
+
+## TODOs
+Line 283-284:
+```typescript
+// TODO make consistent instruction IDs instead of reusing
+```
+
+## Example
+
+### Fixture: `reactive-scopes-if.js`
+
+**Before BuildReactiveScopeTerminalsHIR:**
+```
+bb0 (block):
+ [1] $29_@0[1:22] = Array [] // x with scope @0 range [1:22]
+ [2] StoreLocal x$30_@0 = $29_@0
+ [3] $32 = LoadLocal a$26
+ [4] If ($32) then:bb2 else:bb3 fallthrough=bb1
+bb2:
+ [5] $33_@1[5:11] = Array [] // y with scope @1 range [5:11]
+ ...
+```
+
+**After BuildReactiveScopeTerminalsHIR:**
+```
+bb0 (block):
+ [1] Scope @0 [1:28] block=bb9 fallthrough=bb10 // <-- scope terminal inserted
+bb9:
+ [2] $29_@0 = Array []
+ [3] StoreLocal x$30_@0 = $29_@0
+ [4] $32 = LoadLocal a$26
+ [5] If ($32) then:bb2 else:bb3 fallthrough=bb1
+bb2:
+ [6] Scope @1 [6:14] block=bb11 fallthrough=bb12 // <-- nested scope terminal
+bb11:
+ [7] $33_@1 = Array []
+ ...
+ [13] Goto bb12 // <-- scope end goto
+bb12:
+ ...
+bb1:
+ [27] Goto bb10 // <-- scope @0 end goto
+bb10:
+ [28] $50 = LoadLocal x$30_@0
+ [29] Return $50
+```
+
+The key transformation is that scope boundaries become explicit control flow: a `Scope` terminal enters the scope content block, and a `Goto` terminal exits to the fallthrough block. This structure is later used to generate the memoization checks.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/18-flattenReactiveLoopsHIR.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/18-flattenReactiveLoopsHIR.md
new file mode 100644
index 000000000000..e9a216323cf4
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/18-flattenReactiveLoopsHIR.md
@@ -0,0 +1,158 @@
+# flattenReactiveLoopsHIR
+
+## File
+`src/ReactiveScopes/FlattenReactiveLoopsHIR.ts`
+
+## Purpose
+This pass **prunes reactive scopes that are nested inside loops** (for, for-in, for-of, while, do-while). The compiler does not yet support memoization within loops because:
+
+1. Loop iterations would require reconciliation across runs (similar to how `key` is used in JSX for lists)
+2. There is no way to identify values across iterations
+3. The current approach is to memoize *around* the loop rather than *within* it
+
+When a reactive scope is found inside a loop body, the pass converts its terminal from `scope` to `pruned-scope`. A `pruned-scope` terminal is later treated specially during codegen - its instructions are emitted inline without any memoization guards.
+
+## Input Invariants
+- The HIR has been through `buildReactiveScopeTerminalsHIR`, which creates `scope` terminal nodes for reactive scopes
+- The HIR is in valid block form with proper terminal kinds
+- The block ordering respects control flow (blocks are iterated in order, with loop fallthroughs appearing after loop bodies)
+
+## Output Guarantees
+- All `scope` terminals that appear inside any loop body are converted to `pruned-scope` terminals
+- Scopes outside of loops remain unchanged as `scope` terminals
+- The structure of blocks is preserved; only the terminal kind is mutated
+- The `pruned-scope` terminal retains all the same fields as `scope` (block, fallthrough, scope, id, loc)
+
+## Algorithm
+
+The algorithm uses a **linear scan with a stack-based loop tracking** approach:
+
+```
+1. Initialize an empty array `activeLoops` to track which loop(s) we are currently inside
+2. For each block in the function body (in order):
+ a. Remove the current block ID from activeLoops (if present)
+ - This happens when we reach a loop's fallthrough block, exiting the loop
+ b. Examine the block's terminal:
+ - If it's a loop terminal (do-while, for, for-in, for-of, while):
+ Push the loop's fallthrough block ID onto activeLoops
+ - If it's a scope terminal AND activeLoops is non-empty:
+ Convert the terminal to pruned-scope (keeping all other fields)
+ - All other terminal kinds are ignored
+```
+
+Key insight: The algorithm tracks when we "enter" a loop by pushing the fallthrough ID when encountering a loop terminal, and "exits" the loop when that fallthrough block is visited.
+
+## Key Data Structures
+
+### activeLoops: Array
+A stack of block IDs representing loop fallthroughs. When non-empty, we are inside one or more nested loops.
+
+### PrunedScopeTerminal
+```typescript
+export type PrunedScopeTerminal = {
+ kind: 'pruned-scope';
+ fallthrough: BlockId;
+ block: BlockId;
+ scope: ReactiveScope;
+ id: InstructionId;
+ loc: SourceLocation;
+};
+```
+
+### retainWhere
+Utility from utils.ts - an in-place array filter that removes elements not matching the predicate.
+
+## Edge Cases
+
+### Nested Loops
+The algorithm handles nested loops correctly because `activeLoops` is an array that can contain multiple fallthrough IDs. A scope deep inside multiple nested loops will still be pruned.
+
+### Scope Spanning the Loop
+If a scope terminal appears before the loop terminal but its body contains the loop, it is NOT pruned because the scope terminal itself is not inside the loop.
+
+### Multiple Loops in Sequence
+When exiting one loop (reaching its fallthrough) and entering another, `activeLoops` correctly clears the first loop before potentially adding the second.
+
+### Control Flow That Exits Loops (break/return)
+The algorithm relies on block ordering and fallthrough IDs. Early exits via break/return don't affect the tracking since we track by fallthrough block ID.
+
+## TODOs
+No explicit TODOs in this file. However, the docstring mentions future improvements:
+> "Eventually we may integrate more deeply into the runtime so that we can do a single level of reconciliation"
+
+This suggests a potential future feature to support memoization within loops via runtime integration.
+
+## Example
+
+### Fixture: `repro-memoize-for-of-collection-when-loop-body-returns.js`
+
+**Input:**
+```javascript
+function useHook(nodeID, condition) {
+ const graph = useContext(GraphContext);
+ const node = nodeID != null ? graph[nodeID] : null;
+
+ for (const key of Object.keys(node?.fields ?? {})) {
+ if (condition) {
+ return new Class(node.fields?.[field]); // <-- Scope @4 is here
+ }
+ }
+ return new Class(); // <-- Scope @5 is here (outside loop)
+}
+```
+
+**Before FlattenReactiveLoopsHIR:**
+```
+[45] Scope scope @3 [45:72] ... block=bb35 fallthrough=bb36
+bb35:
+ [46] ForOf init=bb6 test=bb7 loop=bb8 fallthrough=bb5
+ ...
+ [66] Scope scope @4 [66:69] ... block=bb37 fallthrough=bb38 <-- Inside loop
+ ...
+ [73] Scope scope @5 [73:76] ... block=bb39 fallthrough=bb40 <-- Outside loop
+```
+
+**After FlattenReactiveLoopsHIR:**
+```
+[45] Scope scope @3 [45:72] ... block=bb35 fallthrough=bb36 <-- Unchanged
+...
+[66] Scope scope @4 [66:69] ... block=bb37 fallthrough=bb38 <-- PRUNED!
+...
+[73] Scope scope @5 [73:76] ... block=bb39 fallthrough=bb40 <-- Unchanged
+```
+
+**Final Codegen Result:**
+```javascript
+function useHook(nodeID, condition) {
+ const $ = _c(7);
+ // ... memoized Object.keys call (scope @2)
+
+ let t1;
+ if ($[2] !== condition || $[3] !== node || $[4] !== t0) {
+ // Scope @3 wraps the loop
+ t1 = Symbol.for("react.early_return_sentinel");
+ bb0: for (const key of t0) {
+ if (condition) {
+ t1 = new Class(node.fields?.[field]); // Scope @4 was PRUNED - no memoization
+ break bb0;
+ }
+ }
+ $[2] = condition;
+ $[3] = node;
+ $[4] = t0;
+ $[5] = t1;
+ } else {
+ t1 = $[5];
+ }
+ // ...
+
+ // Scope @5 - memoized (sentinel check)
+ if ($[6] === Symbol.for("react.memo_cache_sentinel")) {
+ t2 = new Class();
+ $[6] = t2;
+ }
+ return t2;
+}
+```
+
+The `new Class(...)` inside the loop has no memoization guards because scope @4 was pruned. The `new Class()` outside the loop retains its memoization via scope @5.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/19-flattenScopesWithHooksOrUseHIR.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/19-flattenScopesWithHooksOrUseHIR.md
new file mode 100644
index 000000000000..ff34df45211a
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/19-flattenScopesWithHooksOrUseHIR.md
@@ -0,0 +1,143 @@
+# flattenScopesWithHooksOrUseHIR
+
+## File
+`src/ReactiveScopes/FlattenScopesWithHooksOrUseHIR.ts`
+
+## Purpose
+This pass removes (flattens) reactive scopes that transitively contain hook calls or `use()` operator calls. The key insight is that:
+
+1. **Hooks cannot be called conditionally** - wrapping them in a memoized scope would make them conditionally called based on whether the cache is valid
+2. **The `use()` operator** - while it can be called conditionally in source code, React requires it to be called consistently if the component needs the returned value. Memoizing a scope containing `use()` would also make it conditionally called.
+
+By running reactive scope inference first (agnostic of hooks), the compiler knows which values "construct together" in the same scope. The pass then removes ALL memoization for scopes containing hook/use calls to ensure they are always executed unconditionally.
+
+## Input Invariants
+- HIR must have reactive scope terminals already built (pass runs after `BuildReactiveScopeTerminalsHIR`)
+- Blocks are visited in order (the pass iterates through `fn.body.blocks`)
+- Scope terminals have a `block` (body of the scope) and `fallthrough` (block after the scope)
+- Type inference has run so that `getHookKind()` and `isUseOperator()` can identify hooks and use() calls
+
+## Output Guarantees
+- All scopes that transitively contained a hook or `use()` call are either:
+ - Converted to `LabelTerminal` - if the scope body is trivial (just the hook call and a goto)
+ - Converted to `PrunedScopeTerminal` - if the scope body contains other instructions besides the hook call
+- The `PrunedScopeTerminal` still tracks the original scope information for downstream passes but will not generate memoization code
+- The control flow structure is preserved (same blocks, same fallthroughs)
+
+## Algorithm
+
+### Phase 1: Identify Scopes Containing Hook/Use Calls
+1. Maintain a stack `activeScopes` of currently "open" reactive scopes
+2. Iterate through all blocks in order
+3. When entering a block:
+ - Remove any scopes from `activeScopes` whose fallthrough equals the current block (those scopes have ended)
+4. For each instruction in the block:
+ - If it's a `CallExpression` or `MethodCall` and the callee is a hook or use operator:
+ - Add all currently active scopes to the `prune` list
+ - Clear `activeScopes` (these scopes are now marked for pruning)
+5. If the block's terminal is a `scope`:
+ - Push it onto `activeScopes`
+
+### Phase 2: Prune Identified Scopes
+For each block ID in `prune`:
+1. Get the scope terminal
+2. Check if the scope body is trivial (single instruction + goto to fallthrough):
+ - If trivial: Convert to `LabelTerminal` (will be removed by `PruneUnusedLabels`)
+ - If non-trivial: Convert to `PrunedScopeTerminal` (preserves scope info but skips memoization)
+
+## Key Data Structures
+
+```typescript
+// Stack tracking currently open scopes
+activeScopes: Array<{block: BlockId; fallthrough: BlockId}>
+
+// List of block IDs whose scope terminals should be pruned
+prune: Array
+
+// Terminal types used
+LabelTerminal: {kind: 'label', block, fallthrough, id, loc}
+PrunedScopeTerminal: {kind: 'pruned-scope', block, fallthrough, scope, id, loc}
+ReactiveScopeTerminal: {kind: 'scope', block, fallthrough, scope, id, loc}
+```
+
+## Edge Cases
+
+### Nested Scopes
+When a hook is found in an inner scope, ALL enclosing scopes are also pruned (the hook call would become conditional if any outer scope were memoized).
+
+### Method Call Hooks
+Handles both `CallExpression` (e.g., `useHook(...)`) and `MethodCall` (e.g., `obj.useHook(...)`).
+
+### Trivial Hook-Only Scopes
+If a scope exists just for a hook call (single instruction + goto), it's converted to a `LabelTerminal` which is a simpler structure that gets cleaned up by later passes.
+
+### Multiple Hooks in Sequence
+Once the first hook is encountered, all active scopes are pruned and cleared, so subsequent hooks in outer scopes still work correctly.
+
+## TODOs
+None explicitly marked in the source file.
+
+## Example
+
+### Fixture: `nested-scopes-hook-call.js`
+
+**Input:**
+```javascript
+function component(props) {
+ let x = [];
+ let y = [];
+ y.push(useHook(props.foo));
+ x.push(y);
+ return x;
+}
+```
+
+**Before FlattenScopesWithHooksOrUseHIR:**
+```
+bb0:
+ [1] Scope @0 [1:22] block=bb6 fallthrough=bb7 // Outer scope for x
+bb6:
+ [2] $22 = Array [] // x = []
+ [3] StoreLocal x = $22
+ [4] Scope @1 [4:17] block=bb8 fallthrough=bb9 // Inner scope for y
+bb8:
+ [5] $25 = Array [] // y = []
+ [6] StoreLocal y = $25
+ ...
+ [10] $33 = Call useHook(...) // <-- Hook call here!
+ [11] MethodCall y.push($33)
+```
+
+**After FlattenScopesWithHooksOrUseHIR:**
+```
+bb0:
+ [1] Scope @0 [1:22] block=bb6 fallthrough=bb7 // PRUNED
+bb6:
+ [2] $22 = Array []
+ [3] StoreLocal x = $22
+ [4] Scope @1 [4:17] block=bb8 fallthrough=bb9 // PRUNED
+bb8:
+ [5] $25 = Array []
+ [6] StoreLocal y = $25
+ ...
+ [12] Label block=bb10 fallthrough=bb11 // Hook call converted to label
+bb10:
+ [13] $33 = Call useHook(...)
+ [14] Goto bb11
+...
+```
+
+**Final Output (no memoization):**
+```javascript
+function component(props) {
+ const x = [];
+ const y = [];
+ y.push(useHook(props.foo));
+ x.push(y);
+ return x;
+}
+```
+
+Notice that:
+1. Both scope @0 and scope @1 are marked as `` because the hook call is inside scope @1, which is inside scope @0
+2. The final output has no memoization wrappers - just the raw code
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/20-propagateScopeDependenciesHIR.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/20-propagateScopeDependenciesHIR.md
new file mode 100644
index 000000000000..88f9016f12e9
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/20-propagateScopeDependenciesHIR.md
@@ -0,0 +1,158 @@
+# propagateScopeDependenciesHIR
+
+## File
+`src/HIR/PropagateScopeDependenciesHIR.ts`
+
+## Purpose
+The `propagateScopeDependenciesHIR` pass is responsible for computing and assigning the **dependencies** for each reactive scope in the compiled function. Dependencies are the external values that a scope reads, which determine when the scope needs to re-execute. This is a critical step for memoization correctness - the compiler must track exactly which values a scope depends on so it can generate proper cache invalidation checks.
+
+The pass also populates:
+- `scope.dependencies` - The set of `ReactiveScopeDependency` objects the scope reads
+- `scope.declarations` - Values declared within the scope that are used outside it
+
+## Input Invariants
+- Reactive scopes must be established (pass runs after `BuildReactiveScopeTerminalsHIR`)
+- The function must be in SSA form
+- `InferMutationAliasingRanges` must have run to establish when values are being mutated
+- `InferReactivePlaces` marks which identifiers are reactive
+- Scope ranges have been aligned and normalized by earlier passes
+
+## Output Guarantees
+After this pass completes:
+
+1. Each `ReactiveScope.dependencies` contains the minimal set of dependencies that:
+ - Were declared before the scope started
+ - Are read within the scope
+ - Are not ref values (which are always mutable)
+ - Are not object methods (which get codegen'd back into object literals)
+
+2. Each `ReactiveScope.declarations` contains identifiers that:
+ - Are assigned within the scope
+ - Are used outside the scope (need to be exposed as scope outputs)
+
+3. Property load chains are resolved to their root identifiers with paths (e.g., `props.user.name` becomes `{identifier: props, path: ["user", "name"]}`)
+
+4. Optional chains are handled correctly, distinguishing between `a?.b` and `a.b` access types
+
+## Algorithm
+
+### Phase 1: Build Sidemaps
+
+1. **findTemporariesUsedOutsideDeclaringScope**: Identifies temporaries that are used outside the scope where they were declared (cannot be hoisted/reordered safely)
+
+2. **collectTemporariesSidemap**: Creates a mapping from temporary IdentifierIds to their source `ReactiveScopeDependency`. For example:
+ ```
+ $0 = LoadLocal 'a'
+ $1 = PropertyLoad $0.'b'
+ ```
+ Maps `$1.id` to `{identifier: a, path: [{property: 'b', optional: false}]}`
+
+3. **collectOptionalChainSidemap**: Traverses optional chain blocks to map temporaries within optional chains to their full optional dependency path
+
+4. **collectHoistablePropertyLoads**: Uses CFG analysis to determine which property loads can be safely hoisted
+
+### Phase 2: Collect Dependencies
+
+The `collectDependencies` function traverses the HIR, maintaining a stack of active scopes:
+
+1. **Scope Entry/Exit**: When entering a scope terminal, push a new dependency array. When exiting, propagate collected dependencies to parent scopes if valid.
+
+2. **Instruction Processing**: For each instruction:
+ - Declare the lvalue with its instruction id and current scope
+ - Visit operands to record them as potential dependencies
+ - Handle special cases like `StoreLocal` (tracks reassignments), `Destructure`, `PropertyLoad`, etc.
+
+3. **Dependency Validation** (`#checkValidDependency`):
+ - Skip ref values (`isRefValueType`)
+ - Skip object methods (`isObjectMethodType`)
+ - Only include if declared before scope start
+
+### Phase 3: Derive Minimal Dependencies
+
+For each scope, use `ReactiveScopeDependencyTreeHIR` to:
+1. Build a tree from hoistable property loads
+2. Add all collected dependencies to the tree
+3. Truncate dependencies at their maximal safe-to-evaluate subpath
+4. Derive the minimal set (removing redundant nested dependencies)
+
+## Key Data Structures
+
+### ReactiveScopeDependency
+```typescript
+type ReactiveScopeDependency = {
+ identifier: Identifier; // Root identifier
+ reactive: boolean; // Whether the value is reactive
+ path: DependencyPathEntry[]; // Chain of property accesses
+}
+```
+
+### DependencyPathEntry
+```typescript
+type DependencyPathEntry = {
+ property: PropertyLiteral; // Property name
+ optional: boolean; // Is this `?.` access?
+}
+```
+
+### DependencyCollectionContext
+Maintains:
+- `#declarations`: Map of DeclarationId to {id, scope} recording where each value was declared
+- `#reassignments`: Map of Identifier to latest assignment info
+- `#scopes`: Stack of currently active ReactiveScopes
+- `#dependencies`: Stack of dependency arrays (one per active scope)
+- `#temporaries`: Sidemap for resolving property loads
+
+### ReactiveScopeDependencyTreeHIR
+A tree structure for efficient dependency deduplication that stores hoistable objects, tracks access types, and computes minimal dependencies.
+
+## Edge Cases
+
+### Values Used Outside Declaring Scope
+If a temporary is used outside its declaring scope, it cannot be tracked in the sidemap because reordering the read would be invalid.
+
+### Ref.current Access
+Accessing `ref.current` is treated specially - the dependency is truncated to just `ref`.
+
+### Optional Chains
+Optional chains like `a?.b?.c` produce different dependency paths than `a.b.c`. The pass distinguishes them and may merge optional loads into unconditional ones when control flow proves the object is non-null.
+
+### Inner Functions
+Dependencies from inner functions are collected recursively but with special handling for context variables.
+
+### Phi Nodes
+When a value comes from multiple control flow paths, optional chain dependencies from phi operands are also visited.
+
+## TODOs
+1. Line 374-375: `// TODO(mofeiZ): understand optional chaining` - More documentation needed for optional chain handling
+
+## Example
+
+### Fixture: `reactive-control-dependency-if.js`
+
+**Input:**
+```javascript
+function Component(props) {
+ let x;
+ if (props.cond) {
+ x = 1;
+ } else {
+ x = 2;
+ }
+ return [x];
+}
+```
+
+**Before PropagateScopeDependenciesHIR:**
+```
+Scope scope @0 [12:15] dependencies=[] declarations=[] reassignments=[] block=bb9
+```
+
+**After PropagateScopeDependenciesHIR:**
+```
+Scope scope @0 [12:15] dependencies=[x$24:TPrimitive] declarations=[$26_@0] reassignments=[] block=bb9
+```
+
+The pass identified that:
+- The scope at `[x]` depends on `x$24` (the phi node result from the if/else branches)
+- Even though `x` is assigned to constants (1 or 2), its value depends on the reactive control flow condition `props.cond`
+- The scope declares `$26_@0` (the array output)
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/21-buildReactiveFunction.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/21-buildReactiveFunction.md
new file mode 100644
index 000000000000..d686b4061d79
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/21-buildReactiveFunction.md
@@ -0,0 +1,180 @@
+# buildReactiveFunction
+
+## File
+`src/ReactiveScopes/BuildReactiveFunction.ts`
+
+## Purpose
+The `buildReactiveFunction` pass converts the compiler's HIR (High-level Intermediate Representation) from a **Control Flow Graph (CFG)** representation to a **tree-based ReactiveFunction** representation that is closer to an AST. This is a critical transformation in the React Compiler pipeline that:
+
+1. **Restores control flow constructs** - Reconstructs `if`, `while`, `for`, `switch`, and other control flow statements from the CFG's basic blocks and terminals
+2. **Eliminates phi nodes** - Replaces SSA phi nodes with compound value expressions (ternaries, logical expressions, sequence expressions)
+3. **Handles labeled break/continue** - Tracks control flow targets to emit explicit labeled `break` and `continue` statements when needed
+4. **Preserves reactive scope information** - Scope terminals are converted to `ReactiveScopeBlock` nodes in the tree
+
+## Input Invariants
+- HIR is in SSA form (variables have been renamed with unique identifiers)
+- Basic blocks are connected (valid predecessor/successor relationships)
+- Each block ends with a valid terminal
+- Phi nodes exist at merge points for values from different control flow paths
+- Reactive scopes have been constructed (`scope` terminals exist)
+- Scope dependencies are computed (`PropagateScopeDependenciesHIR` has run)
+
+## Output Guarantees
+- **Tree structure** - The output is a `ReactiveFunction` with a `body: ReactiveBlock` containing a tree of `ReactiveStatement` nodes
+- **No CFG structure** - Basic blocks are eliminated; control flow is represented through nested reactive terminals
+- **No phi nodes** - Value merges are represented as `ConditionalExpression`, `LogicalExpression`, or `SequenceExpression` values
+- **Labels emitted for all control flow** - Every terminal that can be a break/continue target has a label; unnecessary labels are removed by subsequent `PruneUnusedLabels` pass
+- **Each block emitted exactly once** - A block cannot be generated twice
+- **Scope blocks preserved** - `scope` terminals become `ReactiveScopeBlock` nodes
+
+## Algorithm
+
+### Core Classes
+
+1. **`Driver`** - Traverses blocks and emits ReactiveBlock arrays
+2. **`Context`** - Tracks state:
+ - `emitted: Set` - Which blocks have been generated
+ - `#scheduled: Set` - Blocks that will be emitted by parent constructs
+ - `#controlFlowStack: Array` - Stack of active break/continue targets
+ - `scopeFallthroughs: Set` - Fallthroughs for scope blocks
+
+### Traversal Strategy
+
+1. Start at the entry block and call `traverseBlock(entryBlock)`
+2. For each block:
+ - Emit all instructions as `ReactiveInstructionStatement`
+ - Process the terminal based on its kind
+
+### Terminal Processing
+
+**Simple Terminals:**
+- `return`, `throw` - Emit directly as `ReactiveTerminal`
+- `unreachable` - No-op
+
+**Control Flow Terminals:**
+- `if` - Schedule fallthrough, recursively traverse consequent/alternate, emit `ReactiveIfTerminal`
+- `while`, `do-while`, `for`, `for-of`, `for-in` - Use `scheduleLoop()` which tracks continue targets
+- `switch` - Process cases in reverse order
+- `label` - Schedule fallthrough, traverse inner block
+
+**Value Terminals (expressions that produce values):**
+- `ternary`, `logical`, `optional`, `sequence` - Produce `ReactiveValue` compound expressions
+
+**Break/Continue:**
+- `goto` with `GotoVariant.Break` - Determine if break is implicit, unlabeled, or labeled
+- `goto` with `GotoVariant.Continue` - Determine continue type
+
+**Scope Terminals:**
+- `scope`, `pruned-scope` - Schedule fallthrough, traverse inner block, emit as `ReactiveScopeBlock`
+
+## Key Data Structures
+
+### ReactiveFunction
+```typescript
+type ReactiveFunction = {
+ loc: SourceLocation;
+ id: ValidIdentifierName | null;
+ params: Array;
+ generator: boolean;
+ async: boolean;
+ body: ReactiveBlock;
+ env: Environment;
+ directives: Array;
+};
+```
+
+### ReactiveBlock
+```typescript
+type ReactiveBlock = Array;
+```
+
+### ReactiveStatement
+```typescript
+type ReactiveStatement =
+ | ReactiveInstructionStatement // {kind: 'instruction', instruction}
+ | ReactiveTerminalStatement // {kind: 'terminal', terminal, label}
+ | ReactiveScopeBlock // {kind: 'scope', scope, instructions}
+ | PrunedReactiveScopeBlock; // {kind: 'pruned-scope', ...}
+```
+
+### ReactiveValue (for compound expressions)
+```typescript
+type ReactiveValue =
+ | InstructionValue // Regular instruction values
+ | ReactiveLogicalValue // a && b, a || b, a ?? b
+ | ReactiveSequenceValue // (a, b, c)
+ | ReactiveTernaryValue // a ? b : c
+ | ReactiveOptionalCallValue; // a?.b()
+```
+
+### ControlFlowTarget
+```typescript
+type ControlFlowTarget =
+ | {type: 'if'; block: BlockId; id: number}
+ | {type: 'switch'; block: BlockId; id: number}
+ | {type: 'case'; block: BlockId; id: number}
+ | {type: 'loop'; block: BlockId; continueBlock: BlockId; ...};
+```
+
+## Edge Cases
+
+### Nested Control Flow
+The scheduling mechanism handles arbitrarily nested control flow by pushing/popping from the control flow stack.
+
+### Value Blocks with Complex Expressions
+`SequenceExpression` handles cases where value blocks contain multiple instructions.
+
+### Scope Fallthroughs
+Breaks to scope fallthroughs are treated as implicit (no explicit break needed).
+
+### Catch Handlers
+Scheduled specially via `scheduleCatchHandler()` to prevent re-emission.
+
+### Unreachable Blocks
+The `reachable()` check prevents emitting unreachable blocks.
+
+## TODOs
+The code contains several `CompilerError.throwTodo()` calls for unsupported patterns:
+1. Optional chaining test blocks must end in `branch`
+2. Logical expression test blocks must end in `branch`
+3. Support for value blocks within try/catch statements
+4. Support for labeled statements combined with value blocks
+
+## Example
+
+### Fixture: `ternary-expression.js`
+
+**Input:**
+```javascript
+function ternary(props) {
+ const a = props.a && props.b ? props.c || props.d : (props.e ?? props.f);
+ const b = props.a ? (props.b && props.c ? props.d : props.e) : props.f;
+ return a ? b : null;
+}
+```
+
+**HIR (CFG with many basic blocks):**
+The HIR contains 33 basic blocks with `Ternary`, `Logical`, `Branch`, and `Goto` terminals, plus phi nodes at merge points.
+
+**ReactiveFunction Output (Tree):**
+```
+function ternary(props$62{reactive}) {
+ [1] $84 = Ternary
+ Sequence
+ [2] $66 = Logical
+ Sequence [...]
+ && Sequence [...]
+ ?
+ Sequence [...] // props.c || props.d
+ :
+ Sequence [...] // props.e ?? props.f
+ [40] StoreLocal a$99 = $98
+ ...
+ [82] return $145
+}
+```
+
+The transformation eliminates:
+- 33 basic blocks reduced to a single tree
+- Phi nodes replaced with nested `Ternary` and `Logical` value expressions
+- CFG edges replaced with tree nesting
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/22-pruneUnusedLabels.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/22-pruneUnusedLabels.md
new file mode 100644
index 000000000000..c7524ae54740
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/22-pruneUnusedLabels.md
@@ -0,0 +1,145 @@
+# pruneUnusedLabels
+
+## File
+`src/ReactiveScopes/PruneUnusedLabels.ts`
+
+## Purpose
+The `pruneUnusedLabels` pass optimizes control flow by:
+
+1. **Flattening labeled terminals** where the label is not reachable via a `break` or `continue` statement
+2. **Marking labels as implicit** for terminals where the label exists but is never targeted
+
+This pass removes unnecessary labeled blocks that were introduced during compilation but serve no control flow purpose in the final output. JavaScript labeled statements are only needed when there is a corresponding `break label` or `continue label` that targets them.
+
+## Input Invariants
+- The input is a `ReactiveFunction` (after conversion from HIR)
+- All `break` and `continue` terminals have:
+ - A `target` (BlockId) indicating which label they jump to
+ - A `targetKind` that is one of: `'implicit'`, `'labeled'`, or `'unlabeled'`
+- Each `ReactiveTerminalStatement` has an optional `label` field containing `id` and `implicit`
+- The pass runs after `assertWellFormedBreakTargets` which validates break/continue targets
+
+## Output Guarantees
+- Labeled terminals where the label is unreachable are flattened into their parent block
+- When flattening, trailing unlabeled `break` statements (that would just fall through) are removed
+- Labels that exist but are never targeted have their `implicit` flag set to `true`
+- Control flow semantics are preserved - only structurally unnecessary labels are removed
+
+## Algorithm
+
+The pass uses a two-phase approach with a single traversal:
+
+**Phase 1: Collect reachable labels**
+```typescript
+if ((terminal.kind === 'break' || terminal.kind === 'continue') &&
+ terminal.targetKind === 'labeled') {
+ state.add(terminal.target); // Mark this label as reachable
+}
+```
+
+**Phase 2: Transform terminals**
+```typescript
+const isReachableLabel = stmt.label !== null && state.has(stmt.label.id);
+
+if (stmt.terminal.kind === 'label' && !isReachableLabel) {
+ // Flatten: extract block contents, removing trailing unlabeled break
+ const block = [...stmt.terminal.block];
+ const last = block.at(-1);
+ if (last?.kind === 'terminal' && last.terminal.kind === 'break' &&
+ last.terminal.target === null) {
+ block.pop(); // Remove trailing break
+ }
+ return {kind: 'replace-many', value: block};
+} else {
+ if (!isReachableLabel && stmt.label != null) {
+ stmt.label.implicit = true; // Mark as implicit
+ }
+ return {kind: 'keep'};
+}
+```
+
+## Edge Cases
+
+### Trailing Break Removal
+When flattening a labeled block, if the last statement is an unlabeled break (`target === null`), it is removed since it would just fall through anyway.
+
+### Implicit vs Labeled Breaks
+Only breaks with `targetKind === 'labeled'` count toward label reachability. Implicit breaks (fallthrough) and unlabeled breaks don't make a label "used".
+
+### Continue Statements
+Both `break` and `continue` with labeled targets mark the label as reachable.
+
+### Non-Label Terminals with Labels
+Other terminal types (like `if`, `while`, `for`) can also have labels. If unreachable, these labels are marked implicit but the terminal is not flattened.
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: `unconditional-break-label.js`
+
+**Input:**
+```javascript
+function foo(a) {
+ let x = 0;
+ bar: {
+ x = 1;
+ break bar;
+ }
+ return a + x;
+}
+```
+
+**Output (after full compilation):**
+```javascript
+function foo(a) {
+ return a + 1;
+}
+```
+
+The labeled block `bar: { ... }` is removed because after the pass runs, constant propagation and dead code elimination further simplify the code.
+
+### Fixture: `conditional-break-labeled.js`
+
+**Input:**
+```javascript
+function Component(props) {
+ const a = [];
+ a.push(props.a);
+ label: {
+ if (props.b) {
+ break label;
+ }
+ a.push(props.c);
+ }
+ a.push(props.d);
+ return a;
+}
+```
+
+**Output:**
+```javascript
+function Component(props) {
+ const $ = _c(5);
+ let a;
+ if ($[0] !== props.a || $[1] !== props.b ||
+ $[2] !== props.c || $[3] !== props.d) {
+ a = [];
+ a.push(props.a);
+ bb0: {
+ if (props.b) {
+ break bb0;
+ }
+ a.push(props.c);
+ }
+ a.push(props.d);
+ // ... cache updates
+ } else {
+ a = $[4];
+ }
+ return a;
+}
+```
+
+The labeled block `bb0: { ... }` is preserved because the `break bb0` inside the conditional targets this label.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/23-pruneNonEscapingScopes.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/23-pruneNonEscapingScopes.md
new file mode 100644
index 000000000000..ec2c10ea6706
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/23-pruneNonEscapingScopes.md
@@ -0,0 +1,130 @@
+# pruneNonEscapingScopes
+
+## File
+`src/ReactiveScopes/PruneNonEscapingScopes.ts`
+
+## Purpose
+This pass prunes (removes) reactive scopes whose outputs do not "escape" the component and therefore do not need to be memoized. A value "escapes" in two ways:
+
+1. **Returned from the function** - The value is directly returned or transitively aliased by a return value
+2. **Passed to a hook** - Any value passed as an argument to a hook may be stored by React internally (e.g., the closure passed to `useEffect`)
+
+The key insight is that values which never escape the component boundary can be safely recreated on each render without affecting the behavior of consumers.
+
+## Input Invariants
+- The input is a `ReactiveFunction` after scope blocks have been identified
+- Reactive scopes have been assigned to instructions
+- The pass runs after `BuildReactiveFunction` and `PruneUnusedLabels`, before `PruneNonReactiveDependencies`
+
+## Output Guarantees
+- **Scopes with non-escaping outputs are removed** - Their instructions are inlined back into the parent scope/function body
+- **Scopes with escaping outputs are retained** - Values that escape via return or hook arguments remain memoized
+- **Transitive dependencies of escaping scopes are preserved** - If an escaping scope depends on a non-escaping value, that value's scope is also retained to prevent unnecessary invalidation
+- **`FinishMemoize` instructions are marked `pruned=true`** - When a scope is pruned, the associated memoization instructions are flagged
+
+## Algorithm
+
+### Phase 1: Build the Dependency Graph
+Using `CollectDependenciesVisitor`, build:
+- **Identifier nodes** - Each node tracks memoization level, dependencies, scopes, and whether ultimately memoized
+- **Scope nodes** - Each scope tracks its dependencies
+- **Escaping values** - Identifiers that escape via return or hook arguments
+
+### Phase 2: Classify Memoization Levels
+Each instruction value is classified:
+- `Memoized`: Arrays, objects, function calls, `new` expressions - always potentially aliasing
+- `Conditional`: Conditional/logical expressions, property loads - memoized only if dependencies are memoized
+- `Unmemoized`: JSX elements (when `memoizeJsxElements` is false), DeclareLocal
+- `Never`: Primitives, LoadGlobal, binary/unary expressions - can be cheaply compared
+
+### Phase 3: Compute Memoized Identifiers
+`computeMemoizedIdentifiers()` performs a graph traversal starting from escaping values:
+- For each escaping value, recursively visit its dependencies
+- Mark values and their scopes based on memoization level
+- When marking a scope, force-memoize all its dependencies
+
+### Phase 4: Prune Scopes
+`PruneScopesTransform` visits each scope block:
+- If any scope output is in the memoized set, keep the scope
+- If no outputs are memoized, replace the scope block with its inlined instructions
+
+## Edge Cases
+
+### Interleaved Mutations
+```javascript
+const a = [props.a]; // independently memoizable, non-escaping
+const b = [];
+const c = {};
+c.a = a; // c captures a, but c doesn't escape
+b.push(props.b); // b escapes via return
+return b;
+```
+Here `a` does not directly escape, but it is a dependency of the scope containing `b`. The algorithm correctly identifies that `a`'s scope must be preserved.
+
+### Hook Arguments Escape
+Values passed to hooks are treated as escaping because hooks may store references internally.
+
+### JSX Special Handling
+JSX elements are marked as `Unmemoized` by default because React.memo() can handle dynamic memoization.
+
+### noAlias Functions
+If a function signature indicates `noAlias === true`, its arguments are not treated as escaping.
+
+### Reassignments
+When a scope reassigns a variable, the scope is added as a dependency of that variable.
+
+## TODOs
+None explicitly in the source file.
+
+## Example
+
+### Fixture: `escape-analysis-non-escaping-interleaved-allocating-dependency.js`
+
+**Input:**
+```javascript
+function Component(props) {
+ const a = [props.a];
+
+ const b = [];
+ const c = {};
+ c.a = a;
+ b.push(props.b);
+
+ return b;
+}
+```
+
+**Output:**
+```javascript
+function Component(props) {
+ const $ = _c(5);
+ let t0;
+ if ($[0] !== props.a) {
+ t0 = [props.a];
+ $[0] = props.a;
+ $[1] = t0;
+ } else {
+ t0 = $[1];
+ }
+ const a = t0; // a is memoized even though it doesn't escape directly
+
+ let b;
+ if ($[2] !== a || $[3] !== props.b) {
+ b = [];
+ const c = {}; // c is NOT memoized - it doesn't escape
+ c.a = a;
+ b.push(props.b);
+ $[2] = a;
+ $[3] = props.b;
+ $[4] = b;
+ } else {
+ b = $[4];
+ }
+ return b;
+}
+```
+
+Key observations:
+- `a` is memoized because it's a dependency of the scope containing `b`
+- `c` is not separately memoized because it doesn't escape
+- `b` is memoized because it's returned
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/24-pruneNonReactiveDependencies.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/24-pruneNonReactiveDependencies.md
new file mode 100644
index 000000000000..c0b524918a17
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/24-pruneNonReactiveDependencies.md
@@ -0,0 +1,138 @@
+# pruneNonReactiveDependencies
+
+## File
+`src/ReactiveScopes/PruneNonReactiveDependencies.ts`
+
+## Purpose
+This pass removes dependencies from reactive scopes that are guaranteed to be **non-reactive** (i.e., their values cannot change between renders). This optimization reduces unnecessary memoization invalidations by ensuring scopes only depend on values that can actually change.
+
+The pass complements `PropagateScopeDependencies`, which infers dependencies without considering reactivity. This subsequent pruning step filters out dependencies that are semantically constant.
+
+## Input Invariants
+- The function has been converted to a ReactiveFunction structure
+- `InferReactivePlaces` has annotated places with `{reactive: true}` where values can change
+- Each `ReactiveScopeBlock` has a `scope.dependencies` set populated by `PropagateScopeDependenciesHIR`
+- Type inference has run, so identifiers have type information for `isStableType` checks
+
+## Output Guarantees
+- **Non-reactive dependencies removed**: All dependencies in `scope.dependencies` are reactive after this pass
+- **Scope outputs marked reactive if needed**: If a scope has any reactive dependencies remaining, all its outputs are marked reactive
+- **Stable types remain non-reactive through property loads**: When loading properties from stable types (like `useReducer` dispatch functions), the result is not added to the reactive set
+
+## Algorithm
+
+### Phase 1: Collect Reactive Identifiers
+The `collectReactiveIdentifiers` helper builds the initial set of reactive identifiers by:
+1. Visiting all places in the ReactiveFunction
+2. Adding any place marked `{reactive: true}` to the set
+3. For pruned scopes, adding declarations that are not primitives and not stable ref types
+
+### Phase 2: Propagate Reactivity and Prune Dependencies
+The main `Visitor` class traverses the ReactiveFunction and:
+
+1. **For Instructions** - Propagates reactivity through data flow:
+ - `LoadLocal`: If source is reactive, mark the lvalue as reactive
+ - `StoreLocal`: If source value is reactive, mark both the local variable and lvalue as reactive
+ - `Destructure`: If source is reactive, mark all pattern operands as reactive (except stable types)
+ - `PropertyLoad`: If object is reactive AND result is not a stable type, mark result as reactive
+ - `ComputedLoad`: If object OR property is reactive, mark result as reactive
+
+2. **For Scopes** - Prunes non-reactive dependencies and propagates outputs:
+ - Delete each dependency from `scope.dependencies` if its identifier is not in the reactive set
+ - If any dependencies remain after pruning, mark all scope outputs as reactive
+
+### Key Insight: Stable Types
+The pass leverages `isStableType` to prevent reactivity from flowing through certain React-provided stable values:
+
+```typescript
+function isStableType(id: Identifier): boolean {
+ return (
+ isSetStateType(id) || // useState setter
+ isSetActionStateType(id) || // useActionState setter
+ isDispatcherType(id) || // useReducer dispatcher
+ isUseRefType(id) || // useRef result
+ isStartTransitionType(id) ||// useTransition startTransition
+ isSetOptimisticType(id) // useOptimistic setter
+ );
+}
+```
+
+## Edge Cases
+
+### Unmemoized Values Spanning Hook Calls
+A value created before a hook call and mutated after cannot be memoized. However, if it's non-reactive, it still should not appear as a dependency of downstream scopes.
+
+### Stable Types from Reactive Containers
+When `useReducer` returns `[state, dispatch]`, `state` is reactive but `dispatch` is stable. The pass correctly handles this.
+
+### Pruned Scopes with Reactive Content
+The `CollectReactiveIdentifiers` pass also examines pruned scopes and adds their non-primitive, non-stable-ref declarations to the reactive set.
+
+### Transitive Reactivity Through Scopes
+When a scope retains at least one reactive dependency, ALL its outputs become reactive.
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: `unmemoized-nonreactive-dependency-is-pruned-as-dependency.js`
+
+**Input:**
+```javascript
+function Component(props) {
+ const x = [];
+ useNoAlias();
+ mutate(x);
+
+ return {x}
;
+}
+```
+
+**Before PruneNonReactiveDependencies:**
+```
+scope @2 dependencies=[x$15_@0:TObject] declarations=[$23_@2]
+```
+
+**After PruneNonReactiveDependencies:**
+```
+scope @2 dependencies=[] declarations=[$23_@2]
+```
+
+The dependency on `x` is removed because `x` is created locally and therefore non-reactive.
+
+### Fixture: `useReducer-returned-dispatcher-is-non-reactive.js`
+
+**Input:**
+```javascript
+function f() {
+ const [state, dispatch] = useReducer();
+
+ const onClick = () => {
+ dispatch();
+ };
+
+ return ;
+}
+```
+
+**Generated Code:**
+```javascript
+function f() {
+ const $ = _c(1);
+ const [, dispatch] = useReducer();
+ let t0;
+ if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
+ const onClick = () => {
+ dispatch();
+ };
+ t0 = ;
+ $[0] = t0;
+ } else {
+ t0 = $[0];
+ }
+ return t0;
+}
+```
+
+The `onClick` function only captures `dispatch`, which is a stable type. Therefore, `onClick` is non-reactive, and the JSX element can be memoized with zero dependencies.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/25-pruneUnusedScopes.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/25-pruneUnusedScopes.md
new file mode 100644
index 000000000000..03ac3362ff36
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/25-pruneUnusedScopes.md
@@ -0,0 +1,111 @@
+# pruneUnusedScopes
+
+## File
+`src/ReactiveScopes/PruneUnusedScopes.ts`
+
+## Purpose
+This pass converts reactive scopes that have no meaningful outputs into "pruned scopes". A pruned scope is no longer memoized - its instructions are executed unconditionally on every render. This optimization removes unnecessary memoization overhead for scopes that don't produce values that need to be cached.
+
+## Input Invariants
+- The input is a `ReactiveFunction` that has already been transformed into reactive scope form
+- Scopes have been created and have `declarations`, `reassignments`, and potentially `earlyReturnValue` populated
+- The pass is called after:
+ - `pruneUnusedLabels` - cleans up unnecessary labels
+ - `pruneNonEscapingScopes` - removes scopes whose outputs don't escape
+ - `pruneNonReactiveDependencies` - removes non-reactive dependencies from scopes
+- Scopes may already be marked as pruned by earlier passes
+
+## Output Guarantees
+Scopes that meet ALL of the following criteria are converted to `pruned-scope`:
+- No return statement within the scope
+- No reassignments (`scope.reassignments.size === 0`)
+- Either no declarations (`scope.declarations.size === 0`), OR all declarations "bubbled up" from inner scopes
+
+Pruned scopes:
+- Keep their original scope metadata (for debugging/tracking)
+- Keep their instructions intact
+- Will be executed unconditionally during codegen (no memoization check)
+
+## Algorithm
+
+The pass uses the visitor pattern with `ReactiveFunctionTransform`:
+
+1. **State Tracking**: A `State` object tracks whether a return statement was encountered:
+ ```typescript
+ type State = {
+ hasReturnStatement: boolean;
+ };
+ ```
+
+2. **Terminal Visitor** (`visitTerminal`): Checks if any terminal is a `return` statement
+
+3. **Scope Transform** (`transformScope`): For each scope:
+ - Creates a fresh state for this scope
+ - Recursively visits the scope's contents
+ - Checks pruning criteria:
+ - `!scopeState.hasReturnStatement` - no early return
+ - `scope.reassignments.size === 0` - no reassignments
+ - `scope.declarations.size === 0` OR `!hasOwnDeclaration(scopeBlock)` - no outputs
+
+4. **hasOwnDeclaration Helper**: Determines if a scope has "own" declarations vs declarations propagated from nested scopes
+
+## Edge Cases
+
+### Return Statements
+Scopes containing return statements are preserved because early returns need memoization to avoid re-executing the return check on every render.
+
+### Bubbled-Up Declarations
+When nested scopes are flattened or merged, their declarations may be propagated to parent scopes. The `hasOwnDeclaration` check ensures that parent scopes with only inherited declarations can still be pruned.
+
+### Reassignments
+Scopes with reassignments are kept because the reassignment represents a side effect that needs to be tracked for memoization.
+
+### Already-Pruned Scopes
+The pass operates on `ReactiveScopeBlock` (kind: 'scope'), not `PrunedReactiveScopeBlock`. Scopes already pruned by earlier passes are not revisited.
+
+### Interaction with Subsequent Passes
+The `MergeReactiveScopesThatInvalidateTogether` pass explicitly handles pruned scopes - it does not merge across them.
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: `prune-scopes-whose-deps-invalidate-array.js`
+
+**Input:**
+```javascript
+function Component(props) {
+ const x = [];
+ useHook();
+ x.push(props.value);
+ const y = [x];
+ return [y];
+}
+```
+
+What happens:
+- The scope for `x` cannot be memoized because `useHook()` is called inside it
+- `FlattenScopesWithHooksOrUseHIR` marks scope @0 as `pruned-scope`
+- `PruneUnusedScopes` doesn't change it further since it's already pruned
+
+**Output (no memoization for x):**
+```javascript
+function Component(props) {
+ const x = [];
+ useHook();
+ x.push(props.value);
+ const y = [x];
+ return [y];
+}
+```
+
+### Key Insight
+
+The `pruneUnusedScopes` pass is part of a multi-pass pruning strategy:
+1. `FlattenScopesWithHooksOrUseHIR` - Prunes scopes that contain hook/use calls
+2. `pruneNonEscapingScopes` - Prunes scopes whose outputs don't escape
+3. `pruneNonReactiveDependencies` - Removes non-reactive dependencies
+4. **`pruneUnusedScopes`** - Prunes scopes with no remaining outputs
+
+This pass acts as a cleanup for scopes that became "empty" after previous pruning passes removed their outputs.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/26-mergeReactiveScopesThatInvalidateTogether.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/26-mergeReactiveScopesThatInvalidateTogether.md
new file mode 100644
index 000000000000..4ed964116bb2
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/26-mergeReactiveScopesThatInvalidateTogether.md
@@ -0,0 +1,213 @@
+# mergeReactiveScopesThatInvalidateTogether
+
+## File
+`src/ReactiveScopes/MergeReactiveScopesThatInvalidateTogether.ts`
+
+## Purpose
+This pass is an optimization that reduces memoization overhead in the compiled output by merging reactive scopes that will always invalidate together. The pass operates on the ReactiveFunction representation and works in two main scenarios:
+
+1. **Consecutive Scopes**: When two scopes appear sequentially in the same reactive block with identical dependencies (or where the output of the first scope is the sole input to the second), they are merged into a single scope. This reduces the number of memo cache slots used and eliminates redundant dependency comparisons.
+
+2. **Nested Scopes**: When an inner scope has the same dependencies as its parent scope, the inner scope is flattened into the parent. Since PropagateScopeDependencies propagates dependencies upward, nested scopes can only have equal or fewer dependencies than their parents, never more. When they're equal, the inner scope always invalidates with the parent, making it safe and beneficial to flatten.
+
+## Input Invariants
+- The ReactiveFunction has already undergone scope dependency propagation (via `PropagateScopeDependencies`)
+- The function has been pruned of unused scopes (via `pruneNonReactiveDependencies` and `pruneUnusedScopes`)
+- Scopes have valid `dependencies`, `declarations`, `range`, and `reassignments` fields
+- The ReactiveFunction is in a valid structural state with properly formed blocks and instructions
+
+## Output Guarantees
+- **Fewer scopes**: Consecutive and nested scopes with identical dependencies are merged
+- **Valid scope ranges**: Merged scopes have their `range.end` updated to cover all merged instructions
+- **Updated declarations**: Scope declarations are updated to remove any that are no longer used after the merged scope
+- **Merged scope tracking**: The `scope.merged` set tracks which scope IDs were merged into each surviving scope
+- **Preserved semantics**: Only safe-to-memoize intermediate instructions are absorbed into merged scopes
+
+## Algorithm
+
+The pass operates in multiple phases:
+
+### Phase 1: Find Last Usage
+A visitor (`FindLastUsageVisitor`) collects the last usage instruction ID for each declaration:
+
+```typescript
+class FindLastUsageVisitor extends ReactiveFunctionVisitor {
+ lastUsage: Map = new Map();
+
+ override visitPlace(id: InstructionId, place: Place, _state: void): void {
+ const previousUsage = this.lastUsage.get(place.identifier.declarationId);
+ const lastUsage =
+ previousUsage !== undefined
+ ? makeInstructionId(Math.max(previousUsage, id))
+ : id;
+ this.lastUsage.set(place.identifier.declarationId, lastUsage);
+ }
+}
+```
+
+### Phase 2: Transform (Nested Scope Flattening)
+The `transformScope` method flattens nested scopes with identical dependencies:
+
+```typescript
+override transformScope(
+ scopeBlock: ReactiveScopeBlock,
+ state: ReactiveScopeDependencies | null,
+): Transformed {
+ this.visitScope(scopeBlock, scopeBlock.scope.dependencies);
+ if (
+ state !== null &&
+ areEqualDependencies(state, scopeBlock.scope.dependencies)
+ ) {
+ return {kind: 'replace-many', value: scopeBlock.instructions};
+ } else {
+ return {kind: 'keep'};
+ }
+}
+```
+
+### Phase 3: Visit Block (Consecutive Scope Merging)
+Within `visitBlock`, the pass:
+1. First traverses nested blocks recursively
+2. Iterates through instructions, tracking merge candidates
+3. Determines if consecutive scopes can merge based on:
+ - Identical dependencies, OR
+ - Output of first scope is input to second scope (with always-invalidating types)
+4. Collects intermediate lvalues and ensures they're only used by the next scope
+5. Merges eligible scopes by combining instructions and updating range/declarations
+
+### Key Merging Conditions (`canMergeScopes`):
+```typescript
+function canMergeScopes(
+ current: ReactiveScopeBlock,
+ next: ReactiveScopeBlock,
+ temporaries: Map,
+): boolean {
+ // Don't merge scopes with reassignments
+ if (current.scope.reassignments.size !== 0 || next.scope.reassignments.size !== 0) {
+ return false;
+ }
+ // Merge scopes whose dependencies are identical
+ if (areEqualDependencies(current.scope.dependencies, next.scope.dependencies)) {
+ return true;
+ }
+ // Merge scopes where outputs of previous are inputs of next
+ // (with always-invalidating type check)
+ // ...
+}
+```
+
+### Always-Invalidating Types:
+```typescript
+export function isAlwaysInvalidatingType(type: Type): boolean {
+ switch (type.kind) {
+ case 'Object': {
+ switch (type.shapeId) {
+ case BuiltInArrayId:
+ case BuiltInObjectId:
+ case BuiltInFunctionId:
+ case BuiltInJsxId: {
+ return true;
+ }
+ }
+ break;
+ }
+ case 'Function': {
+ return true;
+ }
+ }
+ return false;
+}
+```
+
+## Edge Cases
+
+### Terminals
+The pass does not merge across terminals (control flow boundaries).
+
+### Pruned Scopes
+Merging stops at pruned scopes.
+
+### Reassignments
+Scopes containing reassignments cannot be merged (side-effect ordering concerns).
+
+### Intermediate Reassignments
+Non-const StoreLocal instructions between scopes prevent merging.
+
+### Safe Intermediate Instructions
+Only certain instruction types are allowed between merged scopes: `BinaryExpression`, `ComputedLoad`, `JSXText`, `LoadGlobal`, `LoadLocal`, `Primitive`, `PropertyLoad`, `TemplateLiteral`, `UnaryExpression`, and const `StoreLocal`.
+
+### Lvalue Usage
+Intermediate values must be last-used at or before the next scope to allow merging.
+
+### Non-Invalidating Outputs
+If a scope's output may not change when inputs change (e.g., `foo(x) { return x < 10 }` returns same boolean for different x values), that scope cannot be a merge candidate for subsequent scopes.
+
+## TODOs
+```typescript
+/*
+ * TODO LeaveSSA: use IdentifierId for more precise tracking
+ * Using DeclarationId is necessary for compatible output but produces suboptimal results
+ * in cases where a scope defines a variable, but that version is never read and always
+ * overwritten later.
+ * see reassignment-separate-scopes.js for example
+ */
+lastUsage: Map = new Map();
+```
+
+## Example
+
+### Fixture: `merge-consecutive-scopes-deps-subset-of-decls.js`
+
+**Input:**
+```javascript
+import {useState} from 'react';
+
+function Component() {
+ const [count, setCount] = useState(0);
+ return (
+
+
+
+
+ );
+}
+```
+
+**After MergeReactiveScopesThatInvalidateTogether** (from `yarn snap -p merge-consecutive-scopes-deps-subset-of-decls.js -d`):
+```
+scope @1 [7:24] dependencies=[count$32:TPrimitive] declarations=[$51_@5] reassignments=[] {
+ [8] $35_@1 = Function @context[setCount$33, count$32] // decrement callback
+ [10] $41 = JSXText "Decrement"
+ [12] $42_@2 = JSX
+ [15] $43_@3 = Function @context[setCount$33, count$32] // increment callback
+ [17] $49 = JSXText "Increment"
+ [19] $50_@4 = JSX
+ [22] $51_@5 = JSX {$42_@2}{$50_@4}
+}
+```
+
+All scopes are merged because they share `count` as a dependency. Without merging, this would have separate scopes for each callback and button element.
+
+**Generated Code:**
+```javascript
+function Component() {
+ const $ = _c(2);
+ const [count, setCount] = useState(0);
+ let t0;
+ if ($[0] !== count) {
+ t0 = (
+
+
+
+
+ );
+ $[0] = count;
+ $[1] = t0;
+ } else {
+ t0 = $[1];
+ }
+ return t0;
+}
+```
+
+The merged version uses only 2 cache slots instead of potentially 6-8.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/27-pruneAlwaysInvalidatingScopes.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/27-pruneAlwaysInvalidatingScopes.md
new file mode 100644
index 000000000000..38bbc0de313e
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/27-pruneAlwaysInvalidatingScopes.md
@@ -0,0 +1,143 @@
+# pruneAlwaysInvalidatingScopes
+
+## File
+`src/ReactiveScopes/PruneAlwaysInvalidatingScopes.ts`
+
+## Purpose
+This pass identifies and prunes reactive scopes whose dependencies will *always* invalidate on every render, making memoization pointless. Specifically, it tracks values that are guaranteed to be new allocations (arrays, objects, JSX, new expressions) and checks if those values are used outside of any memoization scope. When a downstream scope depends on such an unmemoized always-invalidating value, the scope is pruned because it would re-execute on every render anyway.
+
+The optimization avoids wasted comparisons in the generated code. Without this pass, the compiler would emit dependency checks for scopes that will never cache-hit, adding runtime overhead with no benefit. By converting these scopes to `pruned-scope` nodes, the codegen emits the instructions inline without memoization guards.
+
+## Input Invariants
+- The pass expects a `ReactiveFunction` with scopes already formed
+- Scopes should have their `dependencies` populated with the identifiers they depend on
+- The pass runs after `MergeReactiveScopesThatInvalidateTogether`
+- Hook calls have already caused scope flattening via `FlattenScopesWithHooksOrUseHIR`
+
+## Output Guarantees
+- Scopes that depend on unmemoized always-invalidating values are converted to `pruned-scope` nodes
+- The `unmemoizedValues` set correctly propagates through `StoreLocal`/`LoadLocal` instructions
+- All declarations and reassignments within pruned scopes that are themselves always-invalidating are added to `unmemoizedValues`, enabling cascading pruning of downstream scopes
+
+## Algorithm
+
+The pass uses a `ReactiveFunctionTransform` visitor with two key methods:
+
+### 1. `transformInstruction` - Tracks always-invalidating values:
+
+```typescript
+switch (value.kind) {
+ case 'ArrayExpression':
+ case 'ObjectExpression':
+ case 'JsxExpression':
+ case 'JsxFragment':
+ case 'NewExpression': {
+ if (lvalue !== null) {
+ this.alwaysInvalidatingValues.add(lvalue.identifier);
+ if (!withinScope) {
+ this.unmemoizedValues.add(lvalue.identifier); // Key: only if outside a scope
+ }
+ }
+ break;
+ }
+ // Also propagates through StoreLocal and LoadLocal
+}
+```
+
+### 2. `transformScope` - Prunes scopes with unmemoized dependencies:
+
+```typescript
+for (const dep of scopeBlock.scope.dependencies) {
+ if (this.unmemoizedValues.has(dep.identifier)) {
+ // Propagate unmemoized status to scope outputs
+ for (const [_, decl] of scopeBlock.scope.declarations) {
+ if (this.alwaysInvalidatingValues.has(decl.identifier)) {
+ this.unmemoizedValues.add(decl.identifier);
+ }
+ }
+ return {
+ kind: 'replace',
+ value: {
+ kind: 'pruned-scope',
+ scope: scopeBlock.scope,
+ instructions: scopeBlock.instructions,
+ },
+ };
+ }
+}
+```
+
+## Edge Cases
+
+### Function Calls Not Considered Always-Invalidating
+The pass optimistically assumes function calls may return primitives, so `makeArray()` doesn't trigger pruning even though it might return a new array.
+
+### Conditional Allocations
+Code like `x = cond ? [] : 42` doesn't trigger pruning because the value might be a primitive.
+
+### Propagation Through Locals
+The pass correctly tracks values through `StoreLocal` and `LoadLocal` to handle variable reassignments and loads.
+
+### Cascading Pruning
+When a scope is pruned, its always-invalidating outputs become unmemoized, potentially causing downstream scopes to be pruned as well.
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: `prune-scopes-whose-deps-invalidate-array.js`
+
+**Input:**
+```javascript
+function Component(props) {
+ const x = [];
+ useHook();
+ x.push(props.value);
+ const y = [x];
+ return [y];
+}
+```
+
+**After PruneAlwaysInvalidatingScopes** (from `yarn snap -p prune-scopes-whose-deps-invalidate-array.js -d`):
+```
+ scope @0 [1:14] dependencies=[] declarations=[x$21_@0] reassignments=[] {
+ [2] $20_@0 = Array []
+ [3] StoreLocal Const x$21_@0 = $20_@0
+ [4] $23 = LoadGlobal import { useHook }
+ [6] $24_@1 = Call $23() // Hook flattens scope
+ [7] break bb9 (implicit)
+ [8] $25_@0 = LoadLocal x$21_@0
+ [9] $26 = PropertyLoad $25_@0.push
+ [10] $27 = LoadLocal props$19
+ [11] $28 = PropertyLoad $27.value
+ [12] $29 = MethodCall $25_@0.$26($28)
+}
+[14] $30 = LoadLocal x$21_@0
+ scope @2 [15:23] dependencies=[x$21_@0:TObject] declarations=[$35_@3] {
+ [16] $31_@2 = Array [$30]
+ [18] StoreLocal Const y$32 = $31_@2
+ [19] $34 = LoadLocal y$32
+ [21] $35_@3 = Array [$34]
+}
+[23] return $35_@3
+```
+
+Key observations:
+- Scope @0 is pruned because the hook call (`useHook()`) flattens it (hook rules prevent memoization around hooks)
+- `x` is an `ArrayExpression` created in the pruned scope @0, making it unmemoized
+- Scope @2 depends on `x$21_@0` which is unmemoized and always-invalidating (it's an array)
+- Therefore, scope @2 is also pruned - cascading pruning
+
+**Generated Code:**
+```javascript
+function Component(props) {
+ const x = [];
+ useHook();
+ x.push(props.value);
+ const y = [x];
+ return [y];
+}
+```
+
+The output matches the input because all memoization was pruned - the code runs unconditionally on every render.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/28-propagateEarlyReturns.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/28-propagateEarlyReturns.md
new file mode 100644
index 000000000000..7fd578eea772
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/28-propagateEarlyReturns.md
@@ -0,0 +1,183 @@
+# propagateEarlyReturns
+
+## File
+`src/ReactiveScopes/PropagateEarlyReturns.ts`
+
+## Purpose
+The `propagateEarlyReturns` pass ensures that reactive scopes (memoization blocks) correctly honor the control flow behavior of the original code, particularly when a function returns early from within a reactive scope. Without this transformation, if a component returned early on the previous render and the inputs have not changed, the cached memoization block would be skipped entirely, but the early return would not occur, causing incorrect behavior.
+
+The pass solves this by transforming `return` statements inside reactive scopes into assignments to a temporary variable followed by a labeled `break`. After the reactive scope completes, generated code checks whether the early return sentinel value was replaced with an actual return value; if so, the function returns that value.
+
+## Input Invariants
+1. **ReactiveFunction structure**: The input must be a `ReactiveFunction` with scopes already inferred (reactive scope blocks are already established)
+2. **Scope earlyReturnValue not set**: The pass expects `scopeBlock.scope.earlyReturnValue === null` for scopes it processes
+3. **Return statements within reactive scopes**: The pass specifically targets `return` terminal statements that appear within a `withinReactiveScope` context
+
+## Output Guarantees
+1. **Labeled scope blocks**: Top-level reactive scopes containing early returns are wrapped in a labeled block (e.g., `bb14: { ... }`)
+2. **Sentinel initialization**: At the start of each such scope, a temporary variable is initialized to `Symbol.for("react.early_return_sentinel")`
+3. **Return-to-break transformation**: All `return` statements inside the scope are replaced with:
+ - An assignment of the return value to the early return temporary
+ - A `break` to the scope's label
+4. **Early return declaration**: The temporary variable is registered as a declaration of the scope so it gets memoized
+5. **Post-scope check**: During codegen, an if-statement is added after the scope to check if the temporary differs from the sentinel and return it if so
+
+## Algorithm
+
+The pass uses a visitor pattern with a `ReactiveFunctionTransform` that tracks two pieces of state:
+
+```typescript
+type State = {
+ withinReactiveScope: boolean; // Are we inside a reactive scope?
+ earlyReturnValue: ReactiveScope['earlyReturnValue']; // Bubble up early return info
+};
+```
+
+### Key Steps:
+
+1. **visitScope** - When entering a reactive scope:
+ - Create an inner state with `withinReactiveScope: true`
+ - Traverse the scope's contents
+ - If any early returns were found (`earlyReturnValue !== null`):
+ - If this is the **outermost** scope (parent's `withinReactiveScope` is false):
+ - Store the early return info on the scope
+ - Add the temporary as a scope declaration
+ - Prepend sentinel initialization instructions
+ - Wrap the original instructions in a labeled block
+ - Otherwise, propagate the early return info to the parent scope
+
+2. **transformTerminal** - When encountering a `return` inside a reactive scope:
+ - Create or reuse an early return value identifier
+ - Replace the return with:
+ ```typescript
+ [
+ {kind: 'instruction', /* StoreLocal: reassign earlyReturnValue = returnValue */},
+ {kind: 'terminal', /* break to earlyReturnValue.label */}
+ ]
+ ```
+
+### Sentinel Initialization Code (synthesized at scope start):
+```typescript
+// Load Symbol.for and call it with the sentinel string
+let t0 = Symbol.for("react.early_return_sentinel");
+```
+
+## Edge Cases
+
+### Nested Reactive Scopes
+When early returns occur in nested scopes, only the **outermost** scope gets the labeled block wrapper. Inner scopes bubble their early return information up via `parentState.earlyReturnValue`.
+
+### Multiple Early Returns in Same Scope
+All returns share the same temporary variable and label. The first return found creates the identifier, subsequent returns reuse it.
+
+### Partial Early Returns
+When only some control flow paths return early (e.g., one branch returns, the other falls through), the sentinel check after the scope allows normal execution to continue if no early return occurred.
+
+### Already Processed Scopes
+If `scopeBlock.scope.earlyReturnValue !== null` on entry, the pass exits early without modification.
+
+### Returns Outside Reactive Scopes
+The pass only transforms returns where `state.withinReactiveScope === true`. Returns outside scopes are left unchanged.
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: `early-return-within-reactive-scope.js`
+
+**Input:**
+```javascript
+function Component(props) {
+ let x = [];
+ if (props.cond) {
+ x.push(props.a);
+ return x;
+ } else {
+ return makeArray(props.b);
+ }
+}
+```
+
+**After PropagateEarlyReturns** (from `yarn snap -p early-return-within-reactive-scope.js -d`):
+```
+scope @0 [...] earlyReturn={id: #t34$34, label: 14} {
+ [0] $36 = LoadGlobal(global) Symbol
+ [0] $37 = PropertyLoad $36.for
+ [0] $38 = "react.early_return_sentinel"
+ [0] $35 = MethodCall $36.$37($38)
+ [0] StoreLocal Let #t34$34{reactive} = $35 // Initialize sentinel
+ bb14: {
+ [2] $19_@0 = Array []
+ [3] StoreLocal Const x$20_@0 = $19_@0
+ [4] $22{reactive} = LoadLocal props$18
+ [5] $23{reactive} = PropertyLoad $22.cond
+ [6] if ($23) {
+ [7] $24_@0 = LoadLocal x$20_@0
+ [8] $25 = PropertyLoad $24_@0.push
+ [9] $26 = LoadLocal props$18
+ [10] $27 = PropertyLoad $26.a
+ [11] $28 = MethodCall $24_@0.$25($27)
+ [12] $29 = LoadLocal x$20_@0
+ [0] StoreLocal Reassign #t34$34 = $29 // was: return x
+ [0] break bb14 (labeled)
+ } else {
+ [14] $30 = LoadGlobal import { makeArray }
+ [15] $31 = LoadLocal props$18
+ [16] $32 = PropertyLoad $31.b
+ scope @1 [...] {
+ [18] $33_@1 = Call $30($32)
+ }
+ [0] StoreLocal Reassign #t34$34 = $33_@1 // was: return makeArray(props.b)
+ [0] break bb14 (labeled)
+ }
+ }
+}
+```
+
+Key observations:
+- Scope @0 now has `earlyReturn={id: #t34$34, label: 14}`
+- Sentinel initialization code is prepended to the scope
+- The scope body is wrapped in `bb14: { ... }`
+- Both `return x` and `return makeArray(props.b)` are transformed to `StoreLocal Reassign + break bb14`
+
+**Generated Code:**
+```javascript
+function Component(props) {
+ const $ = _c(6);
+ let t0;
+ if ($[0] !== props.a || $[1] !== props.b || $[2] !== props.cond) {
+ t0 = Symbol.for("react.early_return_sentinel");
+ bb0: {
+ const x = [];
+ if (props.cond) {
+ x.push(props.a);
+ t0 = x;
+ break bb0;
+ } else {
+ let t1;
+ if ($[4] !== props.b) {
+ t1 = makeArray(props.b);
+ $[4] = props.b;
+ $[5] = t1;
+ } else {
+ t1 = $[5];
+ }
+ t0 = t1;
+ break bb0;
+ }
+ }
+ $[0] = props.a;
+ $[1] = props.b;
+ $[2] = props.cond;
+ $[3] = t0;
+ } else {
+ t0 = $[3];
+ }
+ if (t0 !== Symbol.for("react.early_return_sentinel")) {
+ return t0;
+ }
+}
+```
+
+This transformation ensures that when inputs don't change, the cached return value is used and returned, preserving referential equality and correct early return behavior.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/29-promoteUsedTemporaries.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/29-promoteUsedTemporaries.md
new file mode 100644
index 000000000000..a08c2bf154e6
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/29-promoteUsedTemporaries.md
@@ -0,0 +1,203 @@
+# promoteUsedTemporaries
+
+## File
+`src/ReactiveScopes/PromoteUsedTemporaries.ts`
+
+## Purpose
+This pass promotes temporary variables (identifiers with no name) to named variables when they need to be referenced across scope boundaries or in code generation. Temporaries are intermediate values that the compiler creates during lowering; they are typically inlined at their use sites during codegen. However, some temporaries must be emitted as separate declarations - this pass identifies and names them.
+
+The pass ensures that:
+1. Scope dependencies and declarations have proper names for codegen
+2. Variables referenced across reactive scope boundaries are named
+3. JSX tag identifiers get special naming (`T0`, `T1`, etc.)
+4. Temporaries with interposing side-effects are promoted to preserve ordering
+
+## Input Invariants
+- The ReactiveFunction has undergone scope construction and dependency propagation
+- Identifiers may have `name === null` (temporaries) or be named
+- Scopes have `dependencies`, `declarations`, and `reassignments` populated
+- Pruned scopes are properly marked with `kind: 'pruned-scope'`
+
+## Output Guarantees
+- All scope dependencies have non-null names
+- All scope declarations have non-null names
+- JSX tag temporaries use uppercase naming (`T0`, `T1`, ...)
+- Regular temporaries use lowercase naming (`#t{id}`)
+- All instances of a promoted identifier share the same name (via DeclarationId tracking)
+- Temporaries with interposing mutating instructions are promoted to preserve source ordering
+
+## Algorithm
+
+The pass operates in four phases using visitor classes:
+
+### Phase 1: CollectPromotableTemporaries
+Collects information about which temporaries may need promotion:
+
+```typescript
+class CollectPromotableTemporaries {
+ // Tracks pruned scope declarations and whether they're used outside their scope
+ pruned: Map; usedOutsideScope: boolean}>
+
+ // Tracks identifiers used as JSX tags (need uppercase names)
+ tags: Set
+}
+```
+
+- When visiting a `JsxExpression`, adds the tag identifier to `tags`
+- When visiting a `PrunedScope`, records its declarations
+- Tracks when pruned declarations are used in different scopes
+
+### Phase 2: PromoteTemporaries
+Promotes temporaries that appear in positions requiring names:
+
+```typescript
+override visitScope(scopeBlock: ReactiveScopeBlock, state: State): void {
+ // Promote all dependencies without names
+ for (const dep of scopeBlock.scope.dependencies) {
+ if (identifier.name == null) {
+ promoteIdentifier(identifier, state);
+ }
+ }
+ // Promote all declarations without names
+ for (const [, declaration] of scopeBlock.scope.declarations) {
+ if (declaration.identifier.name == null) {
+ promoteIdentifier(declaration.identifier, state);
+ }
+ }
+}
+```
+
+Also promotes:
+- Function parameters without names
+- Pruned scope declarations used outside their scope
+
+### Phase 3: PromoteInterposedTemporaries
+Handles ordering-sensitive promotion:
+
+```typescript
+class PromoteInterposedTemporaries {
+ // Instructions that emit as statements can interpose between temp defs and uses
+ // If such an instruction occurs, mark pending temporaries as needing promotion
+
+ override visitInstruction(instruction: ReactiveInstruction, state: InterState): void {
+ // For instructions that become statements (calls, stores, etc.):
+ if (willBeStatement && !constStore) {
+ // Mark all pending temporaries as needing promotion
+ for (const [key, [ident, _]] of state.entries()) {
+ state.set(key, [ident, true]); // Mark as needing promotion
+ }
+ }
+ }
+}
+```
+
+This preserves source ordering when side-effects occur between a temporary's definition and use.
+
+### Phase 4: PromoteAllInstancesOfPromotedTemporaries
+Ensures all instances of a promoted identifier share the same name:
+
+```typescript
+class PromoteAllInstancesOfPromotedTemporaries {
+ override visitPlace(_id: InstructionId, place: Place, state: State): void {
+ if (place.identifier.name === null &&
+ state.promoted.has(place.identifier.declarationId)) {
+ promoteIdentifier(place.identifier, state);
+ }
+ }
+}
+```
+
+### Naming Convention
+```typescript
+function promoteIdentifier(identifier: Identifier, state: State): void {
+ if (state.tags.has(identifier.declarationId)) {
+ promoteTemporaryJsxTag(identifier); // Uses #T{id} for JSX tags
+ } else {
+ promoteTemporary(identifier); // Uses #t{id} for regular temps
+ }
+ state.promoted.add(identifier.declarationId);
+}
+```
+
+## Edge Cases
+
+### JSX Tag Temporaries
+JSX tags require uppercase names to be valid JSX syntax. The pass tracks which temporaries are used as JSX tags and uses `T0`, `T1`, etc. instead of `t0`, `t1`.
+
+### Pruned Scope Declarations
+Declarations in pruned scopes are only promoted if they're actually used outside the pruned scope, avoiding unnecessary variable declarations.
+
+### Const vs Let Temporaries
+The pass tracks const identifiers specially - they don't need promotion for ordering purposes since they can't be mutated by interposing instructions.
+
+### Global Loads
+Values loaded from globals (and their property loads) are treated as const-like for promotion purposes.
+
+### Method Call Properties
+The property identifier in a method call is treated as const-like to avoid unnecessary promotion.
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: `simple.js`
+
+**Input:**
+```javascript
+export default function foo(x, y) {
+ if (x) {
+ return foo(false, y);
+ }
+ return [y * 10];
+}
+```
+
+**Before PromoteUsedTemporaries:**
+```
+scope @0 [...] dependencies=[y$14] declarations=[$19_@0]
+scope @1 [...] dependencies=[$22] declarations=[$23_@1]
+```
+
+**After PromoteUsedTemporaries:**
+```
+scope @0 [...] dependencies=[y$14] declarations=[#t5$19_@0]
+scope @1 [...] dependencies=[#t9$22] declarations=[#t10$23_@1]
+```
+
+Key observations:
+- `$19_@0` is promoted to `#t5$19_@0` because it's a scope declaration
+- `$22` is promoted to `#t9$22` because it's a scope dependency
+- `$23_@1` is promoted to `#t10$23_@1` because it's a scope declaration
+- The `#t` prefix indicates this is a promoted temporary (later renamed by `renameVariables`)
+
+**Generated Code:**
+```javascript
+import { c as _c } from "react/compiler-runtime";
+export default function foo(x, y) {
+ const $ = _c(4);
+ if (x) {
+ let t0;
+ if ($[0] !== y) {
+ t0 = foo(false, y);
+ $[0] = y;
+ $[1] = t0;
+ } else {
+ t0 = $[1];
+ }
+ return t0;
+ }
+ const t0 = y * 10;
+ let t1;
+ if ($[2] !== t0) {
+ t1 = [t0];
+ $[2] = t0;
+ $[3] = t1;
+ } else {
+ t1 = $[3];
+ }
+ return t1;
+}
+```
+
+The promoted temporaries (`#t5`, `#t9`, `#t10`) become the named variables (`t0`, `t1`) in the output after `renameVariables` runs.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/30-renameVariables.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/30-renameVariables.md
new file mode 100644
index 000000000000..d643618d5a38
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/30-renameVariables.md
@@ -0,0 +1,200 @@
+# renameVariables
+
+## File
+`src/ReactiveScopes/RenameVariables.ts`
+
+## Purpose
+This pass ensures that every named variable in the function has a unique name that doesn't conflict with other variables in the same block scope or with global identifiers. After scope construction and temporary promotion, variables from different source scopes may end up in the same reactive block - this pass resolves any naming conflicts.
+
+The pass also converts the `#t{id}` promoted temporary names into clean output names like `t0`, `t1`, etc.
+
+## Input Invariants
+- The ReactiveFunction has been through `promoteUsedTemporaries`
+- Variables may have names that conflict with:
+ - Other variables in the same or ancestor block scope
+ - Global identifiers referenced by the function
+ - Promoted temporaries with `#t{id}` or `#T{id}` naming
+- The function parameters have names (either from source or promoted)
+
+## Output Guarantees
+- Every named variable has a unique name within its scope
+- No variable shadows a global identifier referenced by the function
+- Promoted temporaries are renamed to `t0`, `t1`, ... (for regular temps)
+- Promoted JSX temporaries are renamed to `T0`, `T1`, ... (for JSX tags)
+- Conflicting source names get disambiguated with `$` suffix (e.g., `foo$0`, `foo$1`)
+- Returns a `Set` of all unique variable names in the function
+
+## Algorithm
+
+### Phase 1: Collect Referenced Globals
+Uses `collectReferencedGlobals(fn)` to build a set of all global identifiers referenced by the function. Variable names must not conflict with these.
+
+### Phase 2: Rename with Scope Stack
+The `Scopes` class maintains:
+
+```typescript
+class Scopes {
+ #seen: Map = new Map(); // Canonical name for each declaration
+ #stack: Array> = [new Map()]; // Block scope stack
+ #globals: Set; // Global names to avoid
+ names: Set = new Set(); // All assigned names
+}
+```
+
+### Renaming Logic
+```typescript
+visit(identifier: Identifier): void {
+ // Skip unnamed identifiers
+ if (originalName === null) return;
+
+ // If we've already named this declaration, reuse that name
+ const mappedName = this.#seen.get(identifier.declarationId);
+ if (mappedName !== undefined) {
+ identifier.name = mappedName;
+ return;
+ }
+
+ // Find a unique name
+ let name = originalName.value;
+ let id = 0;
+
+ // Promoted temporaries start with t0/T0
+ if (isPromotedTemporary(originalName.value)) {
+ name = `t${id++}`;
+ } else if (isPromotedJsxTemporary(originalName.value)) {
+ name = `T${id++}`;
+ }
+
+ // Increment until we find a unique name
+ while (this.#lookup(name) !== null || this.#globals.has(name)) {
+ if (isPromotedTemporary(...)) {
+ name = `t${id++}`;
+ } else if (isPromotedJsxTemporary(...)) {
+ name = `T${id++}`;
+ } else {
+ name = `${originalName.value}$${id++}`; // foo$0, foo$1, etc.
+ }
+ }
+
+ identifier.name = makeIdentifierName(name);
+ this.#seen.set(identifier.declarationId, identifier.name);
+}
+```
+
+### Scope Management
+```typescript
+enter(fn: () => void): void {
+ this.#stack.push(new Map());
+ fn();
+ this.#stack.pop();
+}
+
+#lookup(name: string): DeclarationId | null {
+ // Search from innermost to outermost scope
+ for (let i = this.#stack.length - 1; i >= 0; i--) {
+ const entry = this.#stack[i].get(name);
+ if (entry !== undefined) return entry;
+ }
+ return null;
+}
+```
+
+### Visitor Pattern
+```typescript
+class Visitor extends ReactiveFunctionVisitor {
+ override visitBlock(block: ReactiveBlock, state: Scopes): void {
+ state.enter(() => {
+ this.traverseBlock(block, state);
+ });
+ }
+
+ override visitScope(scope: ReactiveScopeBlock, state: Scopes): void {
+ // Visit scope declarations first
+ for (const [_, declaration] of scope.scope.declarations) {
+ state.visit(declaration.identifier);
+ }
+ this.traverseScope(scope, state);
+ }
+
+ override visitPlace(id: InstructionId, place: Place, state: Scopes): void {
+ state.visit(place.identifier);
+ }
+}
+```
+
+## Edge Cases
+
+### Shadowed Variables
+When the compiler merges scopes that had shadowing in the source:
+```javascript
+function foo() {
+ const x = 1;
+ {
+ const x = 2; // Shadowed in source
+ }
+}
+```
+If both `x` declarations end up in the same compiled scope, they become `x` and `x$0`.
+
+### Global Name Conflicts
+If a local variable would conflict with a referenced global:
+```javascript
+function foo() {
+ const Math = 1; // Conflicts with global Math if used
+}
+```
+The local gets renamed to `Math$0` if `Math` global is referenced.
+
+### Nested Functions
+The pass recursively processes nested function expressions, entering a new scope for each function body.
+
+### Pruned Scopes
+Pruned scopes don't create a new block scope in the output - the pass traverses their instructions without entering a new scope level.
+
+### DeclarationId Consistency
+The pass uses `DeclarationId` to track which identifiers refer to the same variable, ensuring all references get the same renamed name.
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: `simple.js`
+
+**Before RenameVariables:**
+```
+scope @0 [...] declarations=[#t5$19_@0]
+scope @1 [...] dependencies=[#t9$22] declarations=[#t10$23_@1]
+```
+
+**After RenameVariables:**
+```
+scope @0 [...] declarations=[t0$19_@0]
+scope @1 [...] dependencies=[t0$22] declarations=[t1$23_@1]
+```
+
+Key observations:
+- `#t5$19_@0` becomes `t0$19_@0` (first temporary in scope)
+- `#t9$22` becomes `t0$22` (first temporary in a different block scope)
+- `#t10$23_@1` becomes `t1$23_@1` (second temporary in that block)
+- The `#t` prefix is removed and sequential numbering is applied
+
+**Generated Code:**
+```javascript
+export default function foo(x, y) {
+ const $ = _c(4);
+ if (x) {
+ let t0; // Was #t5
+ if ($[0] !== y) {
+ t0 = foo(false, y);
+ // ...
+ }
+ return t0;
+ }
+ const t0 = y * 10; // Was #t9, reuses t0 since different block scope
+ let t1; // Was #t10
+ // ...
+}
+```
+
+The pass produces clean, readable output with minimal variable names while avoiding conflicts.
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/31-codegenReactiveFunction.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/31-codegenReactiveFunction.md
new file mode 100644
index 000000000000..922b2e9dec47
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/31-codegenReactiveFunction.md
@@ -0,0 +1,286 @@
+# codegenReactiveFunction
+
+## File
+`src/ReactiveScopes/CodegenReactiveFunction.ts`
+
+## Purpose
+This is the final pass that converts the ReactiveFunction representation back into a Babel AST. It generates the memoization code that makes React components and hooks efficient by:
+1. Creating the `useMemoCache` call to allocate cache slots
+2. Generating dependency comparisons to check if values have changed
+3. Emitting conditional blocks that skip computation when cached values are valid
+4. Storing computed values in the cache
+5. Loading cached values when dependencies haven't changed
+
+## Input Invariants
+- The ReactiveFunction has been through all prior passes
+- All identifiers that need names have been promoted and renamed
+- Reactive scopes have finalized `dependencies`, `declarations`, and `reassignments`
+- Early returns have been transformed with sentinel values (via `propagateEarlyReturns`)
+- Pruned scopes are marked with `kind: 'pruned-scope'`
+- Unique identifiers set is available to avoid naming conflicts
+
+## Output Guarantees
+- Returns a `CodegenFunction` with Babel AST `body`
+- All reactive scopes become if-else blocks checking dependencies
+- The `$` cache array is properly sized with `useMemoCache(n)`
+- Each dependency and output gets its own cache slot
+- Pruned scopes emit their instructions inline without memoization
+- Early returns use the sentinel pattern with post-scope checks
+- Statistics are collected: `memoSlotsUsed`, `memoBlocks`, `memoValues`, etc.
+
+## Algorithm
+
+### Entry Point: codegenFunction
+```typescript
+export function codegenFunction(fn: ReactiveFunction): Result {
+ const cx = new Context(...);
+
+ // Optional: Fast Refresh source hash tracking
+ if (enableResetCacheOnSourceFileChanges) {
+ fastRefreshState = { cacheIndex: cx.nextCacheIndex, hash: sha256(source) };
+ }
+
+ const compiled = codegenReactiveFunction(cx, fn);
+
+ // Prepend useMemoCache call if any cache slots used
+ if (cacheCount !== 0) {
+ body.unshift(
+ t.variableDeclaration('const', [
+ t.variableDeclarator(
+ t.identifier('$'),
+ t.callExpression(t.identifier('useMemoCache'), [t.numericLiteral(cacheCount)])
+ )
+ ])
+ );
+ }
+
+ return compiled;
+}
+```
+
+### Context Class
+Tracks state during codegen:
+```typescript
+class Context {
+ #nextCacheIndex: number = 0; // Allocates cache slots
+ #declarations: Set = new Set(); // Tracks declared variables
+ temp: Temporaries; // Maps identifiers to their expressions
+ errors: CompilerError;
+
+ get nextCacheIndex(): number {
+ return this.#nextCacheIndex++; // Returns and increments
+ }
+}
+```
+
+### codegenReactiveScope
+The core of memoization code generation:
+
+```typescript
+function codegenReactiveScope(cx: Context, statements: Array,
+ scope: ReactiveScope, block: ReactiveBlock): void {
+ const changeExpressions: Array = [];
+ const cacheStoreStatements: Array = [];
+ const cacheLoadStatements: Array = [];
+
+ // 1. Generate dependency checks
+ for (const dep of scope.dependencies) {
+ const index = cx.nextCacheIndex;
+ changeExpressions.push(
+ t.binaryExpression('!==',
+ t.memberExpression(t.identifier('$'), t.numericLiteral(index), true),
+ codegenDependency(cx, dep)
+ )
+ );
+ cacheStoreStatements.push(
+ t.assignmentExpression('=', $[index], dep)
+ );
+ }
+
+ // 2. Generate output cache slots
+ for (const {identifier} of scope.declarations) {
+ const index = cx.nextCacheIndex;
+ // Declare variable if not already declared
+ if (!cx.hasDeclared(identifier)) {
+ statements.push(t.variableDeclaration('let', [t.variableDeclarator(name, null)]));
+ }
+ cacheLoads.push({name, index, value: name});
+ }
+
+ // 3. Build test condition
+ let testCondition = changeExpressions.reduce((acc, expr) =>
+ t.logicalExpression('||', acc, expr)
+ );
+
+ // 4. If no dependencies, use sentinel check
+ if (testCondition === null) {
+ testCondition = t.binaryExpression('===',
+ $[firstOutputIndex],
+ t.callExpression(Symbol.for, ['react.memo_cache_sentinel'])
+ );
+ }
+
+ // 5. Generate the memoization if-else
+ statements.push(
+ t.ifStatement(
+ testCondition,
+ computationBlock, // Compute + store in cache
+ cacheLoadBlock // Load from cache
+ )
+ );
+}
+```
+
+### Generated Structure
+For a scope with dependencies `[a, b]` and output `result`:
+
+```javascript
+let result;
+if ($[0] !== a || $[1] !== b) {
+ // Computation block
+ result = compute(a, b);
+
+ // Store dependencies
+ $[0] = a;
+ $[1] = b;
+
+ // Store output
+ $[2] = result;
+} else {
+ // Load from cache
+ result = $[2];
+}
+```
+
+### Early Return Handling
+When a scope has an early return (from `propagateEarlyReturns`):
+
+```typescript
+// Before scope: initialize sentinel
+t0 = Symbol.for("react.early_return_sentinel");
+
+// Scope generates labeled block
+bb0: {
+ // ... computation ...
+ if (cond) {
+ t0 = returnValue;
+ break bb0;
+ }
+}
+
+// After scope: check for early return
+if (t0 !== Symbol.for("react.early_return_sentinel")) {
+ return t0;
+}
+```
+
+### Pruned Scopes
+Pruned scopes emit their instructions inline without memoization:
+```typescript
+case 'pruned-scope': {
+ const scopeBlock = codegenBlockNoReset(cx, item.instructions);
+ statements.push(...scopeBlock.body); // Inline, no memoization
+ break;
+}
+```
+
+## Edge Cases
+
+### Zero Dependencies
+Scopes with no dependencies use a sentinel value check instead:
+```javascript
+if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
+ // First render only
+}
+```
+
+### Fast Refresh / HMR
+When `enableResetCacheOnSourceFileChanges` is enabled, the generated code includes a source hash check that resets the cache when the source changes:
+```javascript
+if ($[0] !== "source_hash_abc123") {
+ for (let $i = 0; $i < cacheCount; $i++) {
+ $[$i] = Symbol.for("react.memo_cache_sentinel");
+ }
+ $[0] = "source_hash_abc123";
+}
+```
+
+
+### Labeled Breaks
+Control flow with labeled breaks (for early returns or loop exits) uses `codegenLabel` to generate consistent label names:
+```typescript
+function codegenLabel(id: BlockId): string {
+ return `bb${id}`; // e.g., "bb0", "bb1"
+}
+```
+
+### Nested Functions
+Function expressions and object methods are recursively processed with their own contexts.
+
+### FBT/Internationalization
+Special handling for FBT operands ensures they're memoized in the same scope for correct internationalization behavior.
+
+## Statistics Collected
+```typescript
+type CodegenFunction = {
+ memoSlotsUsed: number; // Total cache slots allocated
+ memoBlocks: number; // Number of reactive scopes
+ memoValues: number; // Total memoized values
+ prunedMemoBlocks: number; // Scopes that were pruned
+ prunedMemoValues: number; // Values in pruned scopes
+ hasInferredEffect: boolean;
+};
+```
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: `simple.js`
+
+**Input:**
+```javascript
+export default function foo(x, y) {
+ if (x) {
+ return foo(false, y);
+ }
+ return [y * 10];
+}
+```
+
+**Generated Code:**
+```javascript
+import { c as _c } from "react/compiler-runtime";
+export default function foo(x, y) {
+ const $ = _c(4); // Allocate 4 cache slots
+ if (x) {
+ let t0;
+ if ($[0] !== y) { // Check dependency
+ t0 = foo(false, y); // Compute
+ $[0] = y; // Store dependency
+ $[1] = t0; // Store output
+ } else {
+ t0 = $[1]; // Load from cache
+ }
+ return t0;
+ }
+ const t0 = y * 10;
+ let t1;
+ if ($[2] !== t0) { // Check dependency
+ t1 = [t0]; // Compute
+ $[2] = t0; // Store dependency
+ $[3] = t1; // Store output
+ } else {
+ t1 = $[3]; // Load from cache
+ }
+ return t1;
+}
+```
+
+Key observations:
+- `_c(4)` allocates 4 cache slots total
+- First scope uses slots 0-1: slot 0 for `y` dependency, slot 1 for `t0` output
+- Second scope uses slots 2-3: slot 2 for `t0` (the computed `y * 10`), slot 3 for `t1` (the array)
+- Each scope has an if-else structure: compute/store vs load
+- The memoization ensures referential equality of the returned array when `y` hasn't changed
diff --git a/compiler/packages/babel-plugin-react-compiler/docs/passes/34-optimizePropsMethodCalls.md b/compiler/packages/babel-plugin-react-compiler/docs/passes/34-optimizePropsMethodCalls.md
new file mode 100644
index 000000000000..942076af1707
--- /dev/null
+++ b/compiler/packages/babel-plugin-react-compiler/docs/passes/34-optimizePropsMethodCalls.md
@@ -0,0 +1,132 @@
+# optimizePropsMethodCalls
+
+## File
+`src/Optimization/OptimizePropsMethodCalls.ts`
+
+## Purpose
+This pass converts method calls on the props object to regular function calls. Method calls like `props.onClick()` are transformed to `const t0 = props.onClick; t0()`. This normalization enables better analysis and optimization by the compiler.
+
+The transformation is important because method calls have different semantics than regular calls - the receiver (`props`) would normally be passed as `this` to the method. For React props, methods are typically just callback functions where `this` binding doesn't matter, so converting them to regular calls is safe and enables better memoization.
+
+## Input Invariants
+- The function has been through type inference
+- Props parameters are typed as `TObject`
+
+## Output Guarantees
+- All `MethodCall` instructions where the receiver has props type are converted to `CallExpression`
+- The method property becomes the callee of the call
+- Arguments are preserved exactly
+
+## Algorithm
+
+```typescript
+export function optimizePropsMethodCalls(fn: HIRFunction): void {
+ for (const [, block] of fn.body.blocks) {
+ for (let i = 0; i < block.instructions.length; i++) {
+ const instr = block.instructions[i]!;
+
+ if (
+ instr.value.kind === 'MethodCall' &&
+ isPropsType(instr.value.receiver.identifier)
+ ) {
+ // Transform: props.onClick(arg)
+ // To: const t0 = props.onClick; t0(arg)
+ instr.value = {
+ kind: 'CallExpression',
+ callee: instr.value.property, // The method becomes the callee
+ args: instr.value.args,
+ loc: instr.value.loc,
+ };
+ }
+ }
+ }
+}
+
+function isPropsType(identifier: Identifier): boolean {
+ return (
+ identifier.type.kind === 'Object' &&
+ identifier.type.shapeId === BuiltInPropsId
+ );
+}
+```
+
+## Edge Cases
+
+### Non-Props Method Calls
+Method calls on non-props objects are left unchanged:
+```javascript
+// Unchanged - array.map is not on props
+array.map(x => x * 2)
+
+// Unchanged - obj is not props
+obj.method()
+```
+
+### Props Type Detection
+The pass uses type information to identify props:
+```javascript
+function Component(props) {
+ // props has type TObject
+ props.onClick(); // Transformed
+}
+
+function Regular(obj) {
+ // obj has unknown type
+ obj.onClick(); // Not transformed
+}
+```
+
+### Nested Props Access
+Only direct method calls on props are transformed:
+```javascript
+props.onClick(); // Transformed
+props.nested.onClick(); // Not transformed (receiver is props.nested, not props)
+```
+
+### Arrow Function Callbacks
+Works with any method on props:
+```javascript
+props.onChange(value); // Transformed
+props.onSubmit(data); // Transformed
+props.validate(input); // Transformed
+```
+
+## TODOs
+None in the source file.
+
+## Example
+
+### Fixture: Using props method
+
+**Input:**
+```javascript
+function Component(props) {
+ return