Method _resolveContextTsh

lib/FileSystemInfo.js:4310–4369

* Resolve context tsh. * @private * @param {ContextTimestampAndHash} entry entry * @param {ProcessorCallback<ResolvedContextTimestampAndHash>} callback callback * @returns {void}

(entry, callback)

	 * @returns {void}
	 */
	_resolveContextTsh(entry, callback) {
		/** @type {string[]} */
		const hashes = [];
		/** @type {string[]} */
		const tsHashes = [];
		let safeTime = 0;
		class="cm">// Skip already-visited symlink targets so cyclic pnpm/peer-variant graphs terminate (#21084).
		const seen = new Set(entry.symlinks);
		processAsyncTree(
			/** @type {NonNullable<ContextHash[class="st">"symlinks"]>} */ (entry.symlinks),
			10,
			(target, push, callback) => {
				this._getUnresolvedContextTsh(target, (err, entry) => {
					if (err) return callback(err);
					if (entry) {
						hashes.push(entry.hash);
						if (entry.timestampHash) tsHashes.push(entry.timestampHash);
						if (entry.safeTime) {
							safeTime = Math.max(safeTime, entry.safeTime);
						}
						if (entry.symlinks !== undefined) {
							for (const target of entry.symlinks) {
								if (!seen.has(target)) {
									seen.add(target);
									push(target);
								}
							}
						}
					}
					callback();
				});
			},
			(err) => {
				if (err) return callback(/** @type {WebpackError} */ (err));
				const hash = createHash(this._hashFunction);
				const tsHash = createHash(this._hashFunction);
				hash.update(entry.hash);
				if (entry.timestampHash) tsHash.update(entry.timestampHash);
				if (entry.safeTime) {
					safeTime = Math.max(safeTime, entry.safeTime);
				}
				hashes.sort();
				for (const h of hashes) {
					hash.update(h);
				}
				tsHashes.sort();
				for (const h of tsHashes) {
					tsHash.update(h);
				}
				callback(
					null,
					(entry.resolved = {
						safeTime,
						timestampHash: tsHash.digest(class="st">"hex"),
						hash: hash.digest(class="st">"hex")
					})
				);
			}