webpack 5.105.2 → 5.105.3

package/lib/javascript/JavascriptParser.js

@@ -318,13 +318,13 @@ class VariableInfo {
 /** @typedef {Literal | string | null | undefined} ImportSource */
 
 /**
- * @typedef {Omit<ParseOptions, "sourceType"> & { sourceType: "module" | "script" | "auto" }} InternalParseOptions
+ * @typedef {Omit<ParseOptions, "sourceType" | "ecmaVersion"> & { sourceType: "module" | "script" | "auto" }} InternalParseOptions
  */
 
 /**
  * @typedef {object} ParseOptions
  * @property {"module" | "script"} sourceType
- * @property {EcmaVersion=} ecmaVersion
+ * @property {EcmaVersion} ecmaVersion
  * @property {boolean=} locations
  * @property {boolean=} comments
  * @property {boolean=} ranges

package/lib/performance/AssetsOverSizeLimitWarning.js

@@ -28,6 +28,7 @@ Assets: ${assetLists}`);
 
 		/** @type {string} */
 		this.name = "AssetsOverSizeLimitWarning";
+		/** @type {AssetDetails[]} */
 		this.assets = assetsOverSizeLimit;
 	}
 }

package/lib/performance/EntrypointsOverSizeLimitWarning.js

@@ -31,6 +31,7 @@ Entrypoints:${entrypointList}\n`);
 
 		/** @type {string} */
 		this.name = "EntrypointsOverSizeLimitWarning";
+		/** @type {EntrypointDetails[]} */
 		this.entrypoints = entrypoints;
 	}
 }

package/lib/performance/SizeLimitsPlugin.js

@@ -46,6 +46,7 @@ module.exports = class SizeLimitsPlugin {
 	 * @param {PerformanceOptions} options the plugin options
 	 */
 	constructor(options) {
+		/** @type {PerformanceOptions["hints"]} */
 		this.hints = options.hints;
 		/** @type {number | undefined} */
 		this.maxAssetSize = options.maxAssetSize;

package/lib/runtime/ToBinaryRuntimeModule.js

@@ -29,30 +29,38 @@ class ToBinaryRuntimeModule extends RuntimeModule {
 		const isNodePlatform = compilation.compiler.platform.node;
 		const isWebPlatform = compilation.compiler.platform.web;
 		const isNeutralPlatform = runtimeTemplate.isNeutralPlatform();
+		const toImmutableBytes = runtimeTemplate.basicFunction("value", [
+			runtimeTemplate.destructureObject(["buffer"], "value"),
+			`${runtimeTemplate.renderConst()} throwErr = ${runtimeTemplate.basicFunction("", ["throw new TypeError('ArrayBuffer is immutable');"])};`,
+			"Object.defineProperties(buffer, { immutable: { value: true },  resize: { value: throwErr }, transfer: { value: throwErr }, transferToFixedLength: { value: throwErr } });",
+			"Object.freeze(buffer);",
+			"return value;"
+		]);
 
 		return Template.asString([
 			"// define to binary helper",
+			`${runtimeTemplate.renderConst()} toImmutableBytes = ${toImmutableBytes}`,
 			`${fn} = ${isNeutralPlatform ? "typeof Buffer !== 'undefined' ? " : ""}${
 				isNodePlatform || isNeutralPlatform
-					? `${runtimeTemplate.returningFunction("new Uint8Array(Buffer.from(base64, 'base64'))", "base64")}`
+					? `${runtimeTemplate.returningFunction("toImmutableBytes(new Uint8Array(Buffer.from(base64, 'base64')))", "base64")}`
 					: ""
 			} ${isNeutralPlatform ? ": " : ""}${
 				isWebPlatform || isNeutralPlatform
 					? `(${runtimeTemplate.basicFunction("", [
-							"var table = new Uint8Array(128);",
+							`${runtimeTemplate.renderConst()} table = new Uint8Array(128);`,
 							"for (var i = 0; i < 64; i++) table[i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i * 4 - 205] = i;",
 							`return ${runtimeTemplate.basicFunction("base64", [
-								"var n = base64.length, bytes = new Uint8Array((n - (base64[n - 1] == '=') - (base64[n - 2] == '=')) * 3 / 4 | 0);",
+								`${runtimeTemplate.renderConst()} n = base64.length, bytes = new Uint8Array((n - (base64[n - 1] == '=') - (base64[n - 2] == '=')) * 3 / 4 | 0);`,
 								"for (var i = 0, j = 0; i < n;) {",
 								Template.indent([
-									"var c0 = table[base64.charCodeAt(i++)], c1 = table[base64.charCodeAt(i++)];",
-									"var c2 = table[base64.charCodeAt(i++)], c3 = table[base64.charCodeAt(i++)];",
+									`${runtimeTemplate.renderConst()} c0 = table[base64.charCodeAt(i++)], c1 = table[base64.charCodeAt(i++)];`,
+									`${runtimeTemplate.renderConst()} c2 = table[base64.charCodeAt(i++)], c3 = table[base64.charCodeAt(i++)];`,
 									"bytes[j++] = (c0 << 2) | (c1 >> 4);",
 									"bytes[j++] = (c1 << 4) | (c2 >> 2);",
 									"bytes[j++] = (c2 << 6) | c3;"
 								]),
 								"}",
-								"return bytes"
+								"return toImmutableBytes(bytes)"
 							])}`
 						])})();`
 					: ""

package/lib/util/findGraphRoots.js

@@ -8,19 +8,13 @@
 const NO_MARKER = 0;
 const IN_PROGRESS_MARKER = 1;
 const DONE_MARKER = 2;
-const DONE_MAYBE_ROOT_CYCLE_MARKER = 3;
-const DONE_AND_ROOT_MARKER = 4;
+const CANDIDATE_MARKER = 3;
 
 /**
  * @template T
  * @typedef {Set<Node<T>>} Nodes
  */
 
-/**
- * @template T
- * @typedef {Set<Cycle<T>>} Cycles
- */
-
 /**
  * @template T
  */
@@ -32,20 +26,24 @@ class Node {
 		this.item = item;
 		/** @type {Nodes<T>} */
 		this.dependencies = new Set();
-		this.marker = NO_MARKER;
-		/** @type {Cycle<T> | undefined} */
-		this.cycle = undefined;
+		/** @type {SCC<T>} */
+		this.scc = new SCC();
+		// Each node starts as a single-node SCC
+		this.scc.nodes.add(this);
+		/** @type {number} */
 		this.incoming = 0;
 	}
 }
 
 /**
+ * SCC (strongly connected component)
  * @template T
  */
-class Cycle {
+class SCC {
 	constructor() {
 		/** @type {Nodes<T>} */
 		this.nodes = new Set();
+		this.marker = NO_MARKER;
 	}
 }
 
@@ -70,10 +68,10 @@ module.exports = (items, getDependencies) => {
 		itemToNode.set(item, node);
 	}
 
-	// early exit when there is only a single item
+	// Early exit when there is only one node
 	if (itemToNode.size <= 1) return items;
 
-	// grab all the dependencies
+	// Build graph edges
 	for (const node of itemToNode.values()) {
 		for (const dep of getDependencies(node.item)) {
 			const depNode = itemToNode.get(dep);
@@ -83,27 +81,16 @@ module.exports = (items, getDependencies) => {
 		}
 	}
 
-	// Set of current root modules
-	// items will be removed if a new reference to it has been found
-	/** @type {Nodes<T>} */
-	const roots = new Set();
-
-	// Set of current cycles without references to it
-	// cycles will be removed if a new reference to it has been found
-	// that is not part of the cycle
-	/** @type {Cycles<T>} */
-	const rootCycles = new Set();
+	// All candidate root SCCs, they will be removed once an incoming edge is found
+	/** @type {Set<SCC<T>>} */
+	const rootSCCs = new Set();
 
-	// For all non-marked nodes
 	for (const selectedNode of itemToNode.values()) {
-		if (selectedNode.marker === NO_MARKER) {
-			// deep-walk all referenced modules
-			// in a non-recursive way
+		// DFS walk only once per unseen SCC
+		if (selectedNode.scc.marker === NO_MARKER) {
+			selectedNode.scc.marker = IN_PROGRESS_MARKER;
 
-			// start by entering the selected node
-			selectedNode.marker = IN_PROGRESS_MARKER;
-
-			// keep a stack to avoid recursive walk
+			// Keep a stack to avoid recursive walk
 			/** @type {StackEntry<T>[]} */
 			const stack = [
 				{
@@ -112,130 +99,113 @@ module.exports = (items, getDependencies) => {
 				}
 			];
 
-			// process the top item until stack is empty
 			while (stack.length > 0) {
 				const topOfStack = stack[stack.length - 1];
 
-				// Are there still edges unprocessed in the current node?
+				// Process one unvisited outgoing edge if available
 				if (topOfStack.openEdges.length > 0) {
-					// Process one dependency
 					const dependency =
 						/** @type {Node<T>} */
 						(topOfStack.openEdges.pop());
-					switch (dependency.marker) {
+					const depSCC = dependency.scc;
+					switch (depSCC.marker) {
 						case NO_MARKER:
-							// dependency has not be visited yet
-							// mark it as in-progress and recurse
+							// First time we see this SCC: enter it
 							stack.push({
 								node: dependency,
 								openEdges: [...dependency.dependencies]
 							});
-							dependency.marker = IN_PROGRESS_MARKER;
+							depSCC.marker = IN_PROGRESS_MARKER;
 							break;
 						case IN_PROGRESS_MARKER: {
-							// It's a in-progress cycle
-							let cycle = dependency.cycle;
-							if (!cycle) {
-								cycle = new Cycle();
-								cycle.nodes.add(dependency);
-								dependency.cycle = cycle;
-							}
-							// set cycle property for each node in the cycle
-							// if nodes are already part of a cycle
-							// we merge the cycles to a shared cycle
+							// Back-edge to an SCC that is still on the stack
+							// Example:
+							//   A -> B -> C -> D
+							//        ^         |
+							//        |_________|
+							// If we are at `D` and traverse `D` -> `B`, then `B/C/D` must be in one SCC
+							/** @type {Set<SCC<T>>} */
+							const sccsToMerge = new Set();
 							for (
 								let i = stack.length - 1;
-								stack[i].node !== dependency;
+								stack[i].node.scc !== depSCC;
 								i--
 							) {
-								const node = stack[i].node;
-								if (node.cycle) {
-									if (node.cycle !== cycle) {
-										// merge cycles
-										for (const cycleNode of node.cycle.nodes) {
-											cycleNode.cycle = cycle;
-											cycle.nodes.add(cycleNode);
-										}
-									}
-								} else {
-									node.cycle = cycle;
-									cycle.nodes.add(node);
+								sccsToMerge.add(stack[i].node.scc);
+							}
+							for (const sccToMerge of sccsToMerge) {
+								for (const nodeInMergedSCC of sccToMerge.nodes) {
+									nodeInMergedSCC.scc = depSCC;
+									depSCC.nodes.add(nodeInMergedSCC);
 								}
 							}
-							// don't recurse into dependencies
-							// these are already on the stack
 							break;
 						}
-						case DONE_AND_ROOT_MARKER:
-							// This node has be visited yet and is currently a root node
-							// But as this is a new reference to the node
-							// it's not really a root
-							// so we have to convert it to a normal node
-							dependency.marker = DONE_MARKER;
-							roots.delete(dependency);
+						case CANDIDATE_MARKER:
+							// This finished SCC was previously considered as root SCC
+							// We just found a new incoming edge, so it is no longer a candidate
+							rootSCCs.delete(/** @type {SCC<T>} */ (depSCC));
+							depSCC.marker = DONE_MARKER;
 							break;
-						case DONE_MAYBE_ROOT_CYCLE_MARKER:
-							// This node has be visited yet and
-							// is maybe currently part of a completed root cycle
-							// we found a new reference to the cycle
-							// so it's not really a root cycle
-							// remove the cycle from the root cycles
-							// and convert it to a normal node
-							rootCycles.delete(/** @type {Cycle<T>} */ (dependency.cycle));
-							dependency.marker = DONE_MARKER;
+						case DONE_MARKER:
+							// Already finalized and not a candidate
 							break;
-						// DONE_MARKER: nothing to do, don't recurse into dependencies
 					}
 				} else {
-					// All dependencies of the current node has been visited
-					// we leave the node
+					// All dependencies of the current node have been processed
+					// So we leave the node
 					stack.pop();
-					topOfStack.node.marker = DONE_MARKER;
-				}
-			}
-			const cycle = selectedNode.cycle;
-			if (cycle) {
-				for (const node of cycle.nodes) {
-					node.marker = DONE_MAYBE_ROOT_CYCLE_MARKER;
+					// Mark an SCC as DONE only when the popped node is the last
+					// node from that SCC remaining on the current stack.
+					//   A -> B -> C -> D
+					//        ^         |
+					//        |_________|
+					// If `B` is popped and the new stack top is `A`, they are in
+					// different SCCs, so B's SCC can be finalized.
+					if (
+						stack.length &&
+						topOfStack.node.scc !== stack[stack.length - 1].node.scc
+					) {
+						topOfStack.node.scc.marker = DONE_MARKER;
+					}
 				}
-				rootCycles.add(cycle);
-			} else {
-				selectedNode.marker = DONE_AND_ROOT_MARKER;
-				roots.add(selectedNode);
 			}
+			const scc = selectedNode.scc;
+			// This SCC is complete and currently has no known incoming edge
+			scc.marker = CANDIDATE_MARKER;
+			rootSCCs.add(scc);
 		}
 	}
 
-	// Extract roots from root cycles
-	// We take the nodes with most incoming edges
-	// inside of the cycle
-	for (const cycle of rootCycles) {
+	/** @type {Set<T>} */
+	const rootNodes = new Set();
+
+	// For each root SCC, we select node with the most incoming edges
+	// from within the same SCC
+	for (const scc of rootSCCs) {
 		let max = 0;
 		/** @type {Nodes<T>} */
-		const cycleRoots = new Set();
-		const nodes = cycle.nodes;
-		for (const node of nodes) {
+		const nodes = new Set(scc.nodes);
+		for (const node of scc.nodes) {
 			for (const dep of node.dependencies) {
-				if (nodes.has(dep)) {
+				if (scc.nodes.has(dep)) {
 					dep.incoming++;
 					if (dep.incoming < max) continue;
 					if (dep.incoming > max) {
-						cycleRoots.clear();
+						nodes.clear();
 						max = dep.incoming;
 					}
-					cycleRoots.add(dep);
+					nodes.add(dep);
 				}
 			}
 		}
-		for (const cycleRoot of cycleRoots) {
-			roots.add(cycleRoot);
+		for (const node of nodes) {
+			rootNodes.add(node.item);
 		}
 	}
 
-	// When roots were found, return them
-	if (roots.size > 0) {
-		return Array.from(roots, (r) => r.item);
-	}
+	// When root nodes were found, return them
+	if (rootNodes.size > 0) return rootNodes;
 
 	throw new Error("Implementation of findGraphRoots is broken");
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "webpack",
-  "version": "5.105.2",
+  "version": "5.105.3",
   "description": "Packs ECMAScript/CommonJs/AMD modules for the browser. Allows you to split your codebase into multiple bundles, which can be loaded on demand. Supports loaders to preprocess files, i.e. json, jsx, es7, css, less, ... and your custom stuff.",
   "homepage": "https://github.com/webpack/webpack",
   "bugs": "https://github.com/webpack/webpack/issues",
@@ -57,6 +57,7 @@
     "test:basic:deno": "yarn test:base:deno --testMatch \"<rootDir>/test/*.basictest.js\"",
     "test:unit": "yarn test:base --testMatch \"<rootDir>/test/*.unittest.js\"",
     "test:integration": "yarn test:base --testMatch \"<rootDir>/test/*.{basictest,longtest,test}.js\"",
+    "test:test262": "yarn test:base --testMatch \"<rootDir>/test/*.spectest.js\"",
     "test:base:deno": "deno --allow-read --allow-env --allow-sys --allow-ffi --allow-write --allow-run --v8-flags='--max-old-space-size=4096' ./node_modules/jest-cli/bin/jest.js --logHeapUsage",
     "test:update-snapshots": "yarn test:base -u",
     "report:cover": "nyc report --reporter=lcov  --reporter=text -t coverage",
@@ -71,7 +72,8 @@
     "cover:basic": "yarn cover:base --testMatch \"<rootDir>/test/*.basictest.js\" --coverage",
     "cover:integration": "yarn cover:base --testMatch \"<rootDir>/test/*.{basictest,longtest,test}.js\" --coverage",
     "cover:integration:a": "yarn cover:base --testMatch \"<rootDir>/test/*.{basictest,test}.js\" --coverage",
-    "cover:integration:b": "yarn cover:base --testMatch \"<rootDir>/test/*.longtest.js\" --coverage"
+    "cover:integration:b": "yarn cover:base --testMatch \"<rootDir>/test/*.longtest.js\" --coverage",
+    "cover:test262": "yarn cover:base --testMatch \"<rootDir>/test/*.spectest.js\" --coverage"
   },
   "lint-staged": {
     "*.{js,cjs,mjs}": [
@@ -89,7 +91,7 @@
     "@webassemblyjs/ast": "^1.14.1",
     "@webassemblyjs/wasm-edit": "^1.14.1",
     "@webassemblyjs/wasm-parser": "^1.14.1",
-    "acorn": "^8.15.0",
+    "acorn": "^8.16.0",
     "acorn-import-phases": "^1.0.3",
     "browserslist": "^4.28.1",
     "chrome-trace-event": "^1.0.2",
@@ -107,14 +109,14 @@
     "tapable": "^2.3.0",
     "terser-webpack-plugin": "^5.3.16",
     "watchpack": "^2.5.1",
-    "webpack-sources": "^3.3.3"
+    "webpack-sources": "^3.3.4"
   },
   "devDependencies": {
     "@babel/core": "^7.27.1",
     "@babel/preset-react": "^7.27.1",
     "@changesets/cli": "^2.29.8",
     "@changesets/get-github-info": "^0.7.0",
-    "@codspeed/core": "^5.1.0",
+    "@codspeed/core": "^5.2.0",
     "@types/glob-to-regexp": "^0.4.4",
     "@types/graceful-fs": "^4.1.9",
     "@types/jest": "^30.0.0",
@@ -134,7 +136,7 @@
     "es5-ext": "^0.10.53",
     "es6-promise-polyfill": "^1.2.0",
     "eslint": "^9.39.2",
-    "eslint-config-webpack": "^4.9.1",
+    "eslint-config-webpack": "^4.9.3",
     "file-loader": "^6.0.0",
     "fork-ts-checker-webpack-plugin": "^9.0.2",
     "globals": "^17.0.0",
@@ -160,8 +162,9 @@
     "mini-css-extract-plugin": "^2.9.0",
     "mini-svg-data-uri": "^1.2.3",
     "node-gyp": "^12.1.0",
-    "nyc": "^17.1.0",
+    "nyc": "^18.0.0",
     "open-cli": "^8.0.0",
+    "oxc-parser": "^0.115.0",
     "pkg-pr-new": "^0.0.63",
     "prettier": "^3.7.4",
     "prettier-2": "npm:prettier@^2",
@@ -183,10 +186,10 @@
     "strip-ansi": "^6.0.0",
     "style-loader": "^4.0.0",
     "terser": "^5.43.1",
-    "three": "^0.182.0",
+    "three": "^0.183.1",
     "tinybench": "^6.0.0",
     "toml": "^3.0.0",
-    "tooling": "webpack/tooling#v1.24.5",
+    "tooling": "webpack/tooling#v1.24.6",
     "ts-loader": "^9.5.4",
     "typescript": "^5.9.3",
     "unified": "^11.0.5",