react-code-dataset
/
next.js
/turbopack
/crates
/turbopack-browser
/src
/ecmascript
/merged
/update.rs
| use std::sync::Arc; | |
| use anyhow::Result; | |
| use serde::Serialize; | |
| use turbo_tasks::{FxIndexMap, FxIndexSet, IntoTraitRef, ReadRef, TryJoinIterExt, Vc}; | |
| use turbo_tasks_fs::rope::Rope; | |
| use turbopack_core::{ | |
| chunk::{ChunkingContext, ModuleId}, | |
| code_builder::Code, | |
| output::OutputAsset, | |
| source_map::GenerateSourceMap, | |
| version::{PartialUpdate, TotalUpdate, Update, Version}, | |
| }; | |
| use super::{ | |
| super::{ | |
| update::{EcmascriptChunkUpdate, update_ecmascript_chunk}, | |
| version::EcmascriptBrowserChunkVersion, | |
| }, | |
| content::EcmascriptBrowserMergedChunkContent, | |
| version::EcmascriptBrowserMergedChunkVersion, | |
| }; | |
| struct EcmascriptMergedUpdate<'a> { | |
| /// A map from module id to latest module entry. | |
| entries: FxIndexMap<ReadRef<ModuleId>, EcmascriptModuleEntry>, | |
| /// A map from chunk path to the chunk update. | |
| chunks: FxIndexMap<&'a str, EcmascriptMergedChunkUpdate>, | |
| } | |
| impl EcmascriptMergedUpdate<'_> { | |
| fn is_empty(&self) -> bool { | |
| self.entries.is_empty() && self.chunks.is_empty() | |
| } | |
| } | |
| enum EcmascriptMergedChunkUpdate { | |
| Added(EcmascriptMergedChunkAdded), | |
| Deleted(EcmascriptMergedChunkDeleted), | |
| Partial(EcmascriptMergedChunkPartial), | |
| } | |
| struct EcmascriptMergedChunkAdded { | |
| modules: FxIndexSet<ReadRef<ModuleId>>, | |
| } | |
| struct EcmascriptMergedChunkDeleted { | |
| // Technically, this is redundant, since the client will already know all | |
| // modules in the chunk from the previous version. However, it's useful for | |
| // merging updates without access to an initial state. | |
| modules: FxIndexSet<ReadRef<ModuleId>>, | |
| } | |
| struct EcmascriptMergedChunkPartial { | |
| added: FxIndexSet<ReadRef<ModuleId>>, | |
| deleted: FxIndexSet<ReadRef<ModuleId>>, | |
| } | |
| struct EcmascriptModuleEntry { | |
| code: Rope, | |
| url: String, | |
| map: Option<Rope>, | |
| } | |
| impl EcmascriptModuleEntry { | |
| async fn from_code(id: &ModuleId, code: Vc<Code>, chunk_path: &str) -> Result<Self> { | |
| let map = &*code.generate_source_map().await?; | |
| Ok(Self::new(id, code.await?, map.clone(), chunk_path)) | |
| } | |
| fn new(id: &ModuleId, code: ReadRef<Code>, map: Option<Rope>, chunk_path: &str) -> Self { | |
| /// serde_qs can't serialize a lone enum when it's [serde::untagged]. | |
| struct Id<'a> { | |
| id: &'a ModuleId, | |
| } | |
| let id = serde_qs::to_string(&Id { id }).unwrap(); | |
| EcmascriptModuleEntry { | |
| // Cloning a rope is cheap. | |
| code: code.source_code().clone(), | |
| url: format!("{}?{}", chunk_path, &id), | |
| map, | |
| } | |
| } | |
| } | |
| /// Helper structure to get a module's hash from multiple different chunk | |
| /// versions, without having to actually merge the versions into a single | |
| /// hashmap, which would be expensive. | |
| struct MergedModuleMap { | |
| versions: Vec<ReadRef<EcmascriptBrowserChunkVersion>>, | |
| } | |
| impl MergedModuleMap { | |
| /// Creates a new `MergedModuleMap` from the given versions. | |
| fn new(versions: Vec<ReadRef<EcmascriptBrowserChunkVersion>>) -> Self { | |
| Self { versions } | |
| } | |
| /// Returns the hash of the module with the given id, or `None` if the | |
| /// module is not present in any of the versions. | |
| fn get(&self, id: &ReadRef<ModuleId>) -> Option<u64> { | |
| for version in &self.versions { | |
| if let Some(hash) = version.entries_hashes.get(id) { | |
| return Some(*hash); | |
| } | |
| } | |
| None | |
| } | |
| } | |
| pub(super) async fn update_ecmascript_merged_chunk( | |
| content: Vc<EcmascriptBrowserMergedChunkContent>, | |
| from_version: Vc<Box<dyn Version>>, | |
| ) -> Result<Update> { | |
| let to_merged_version = content.version(); | |
| let from_merged_version = if let Some(from) = | |
| Vc::try_resolve_downcast_type::<EcmascriptBrowserMergedChunkVersion>(from_version).await? | |
| { | |
| from | |
| } else { | |
| // It's likely `from_version` is `NotFoundVersion`. | |
| return Ok(Update::Total(TotalUpdate { | |
| to: Vc::upcast::<Box<dyn Version>>(to_merged_version) | |
| .into_trait_ref() | |
| .await?, | |
| })); | |
| }; | |
| let to = to_merged_version.await?; | |
| let from = from_merged_version.await?; | |
| // When to and from point to the same value we can skip comparing them. This will happen since | |
| // `TraitRef::<Box<dyn Version>>::cell` will not clone the value, but only make the cell point | |
| // to the same immutable value (`Arc`). | |
| if from.ptr_eq(&to) { | |
| return Ok(Update::None); | |
| } | |
| let mut from_versions_by_chunk_path: FxIndexMap<_, _> = from | |
| .versions | |
| .iter() | |
| .map(|version| (&*version.chunk_path, version)) | |
| .collect(); | |
| let merged_module_map = MergedModuleMap::new(from.versions.to_vec()); | |
| let content = content.await?; | |
| let to_contents = content | |
| .contents | |
| .iter() | |
| .map(|content| async move { | |
| let entries = content.entries().await?; | |
| let content_ref = content.await?; | |
| let output_root = content_ref.chunking_context.output_root().await?; | |
| let path = content_ref.chunk.path().await?; | |
| Ok((*content, entries, output_root, path)) | |
| }) | |
| .try_join() | |
| .await?; | |
| let mut merged_update = EcmascriptMergedUpdate::default(); | |
| for (content, entries, output_root, path) in &to_contents { | |
| let Some(chunk_path) = output_root.get_path_to(path) else { | |
| continue; | |
| }; | |
| let chunk_update = if let Some(from_version) = | |
| from_versions_by_chunk_path.swap_remove(chunk_path) | |
| { | |
| // The chunk was present in the previous version, so we must update it. | |
| let update = update_ecmascript_chunk(**content, from_version).await?; | |
| match update { | |
| EcmascriptChunkUpdate::None => { | |
| // Nothing changed, so we can skip this chunk. | |
| continue; | |
| } | |
| EcmascriptChunkUpdate::Partial(chunk_partial) => { | |
| // The chunk was updated. | |
| let mut partial = EcmascriptMergedChunkPartial::default(); | |
| for (module_id, (module_hash, module_code)) in chunk_partial.added { | |
| partial.added.insert(module_id.clone()); | |
| if merged_module_map.get(&module_id) != Some(module_hash) { | |
| let entry = EcmascriptModuleEntry::from_code( | |
| &module_id, | |
| *module_code, | |
| chunk_path, | |
| ) | |
| .await?; | |
| merged_update.entries.insert(module_id, entry); | |
| } | |
| } | |
| partial.deleted.extend(chunk_partial.deleted.into_keys()); | |
| for (module_id, module_code) in chunk_partial.modified { | |
| let entry = | |
| EcmascriptModuleEntry::from_code(&module_id, *module_code, chunk_path) | |
| .await?; | |
| merged_update.entries.insert(module_id, entry); | |
| } | |
| EcmascriptMergedChunkUpdate::Partial(partial) | |
| } | |
| } | |
| } else { | |
| // The chunk was added in this version. | |
| let mut added = EcmascriptMergedChunkAdded::default(); | |
| for (id, entry) in entries { | |
| let hash = *entry.hash.await?; | |
| added.modules.insert(id.clone()); | |
| if merged_module_map.get(id) != Some(hash) { | |
| let entry = | |
| EcmascriptModuleEntry::from_code(id, *entry.code, chunk_path).await?; | |
| merged_update.entries.insert(id.clone(), entry); | |
| } | |
| } | |
| EcmascriptMergedChunkUpdate::Added(added) | |
| }; | |
| merged_update.chunks.insert(chunk_path, chunk_update); | |
| } | |
| // Deleted chunks. | |
| for (chunk_path, chunk_version) in from_versions_by_chunk_path { | |
| let hashes = &chunk_version.entries_hashes; | |
| merged_update.chunks.insert( | |
| chunk_path, | |
| EcmascriptMergedChunkUpdate::Deleted(EcmascriptMergedChunkDeleted { | |
| modules: hashes.keys().cloned().collect(), | |
| }), | |
| ); | |
| } | |
| let update = if merged_update.is_empty() { | |
| Update::None | |
| } else { | |
| Update::Partial(PartialUpdate { | |
| to: Vc::upcast::<Box<dyn Version>>(to_merged_version) | |
| .into_trait_ref() | |
| .await?, | |
| instruction: Arc::new(serde_json::to_value(&merged_update)?), | |
| }) | |
| }; | |
| Ok(update) | |
| } | |