Remove double spaces after dots in comments
This commit is contained in:
parent
279f1c9d8c
commit
6a28fb42a8
157 changed files with 313 additions and 313 deletions
|
@ -490,8 +490,8 @@ impl<K: DepKind> DepGraph<K> {
|
|||
/// This is used to remove cycles during type-checking const generic parameters.
|
||||
///
|
||||
/// As usual in the query system, we consider the current state of the calling query
|
||||
/// only depends on the list of dependencies up to now. As a consequence, the value
|
||||
/// that this query gives us can only depend on those dependencies too. Therefore,
|
||||
/// only depends on the list of dependencies up to now. As a consequence, the value
|
||||
/// that this query gives us can only depend on those dependencies too. Therefore,
|
||||
/// it is sound to use the current dependency set for the created node.
|
||||
///
|
||||
/// During replay, the order of the nodes is relevant in the dependency graph.
|
||||
|
@ -510,9 +510,9 @@ impl<K: DepKind> DepGraph<K> {
|
|||
hash_result: Option<fn(&mut StableHashingContext<'_>, &R) -> Fingerprint>,
|
||||
) -> DepNodeIndex {
|
||||
if let Some(data) = self.data.as_ref() {
|
||||
// The caller query has more dependencies than the node we are creating. We may
|
||||
// The caller query has more dependencies than the node we are creating. We may
|
||||
// encounter a case where this created node is marked as green, but the caller query is
|
||||
// subsequently marked as red or recomputed. In this case, we will end up feeding a
|
||||
// subsequently marked as red or recomputed. In this case, we will end up feeding a
|
||||
// value to an existing node.
|
||||
//
|
||||
// For sanity, we still check that the loaded stable hash and the new one match.
|
||||
|
@ -980,7 +980,7 @@ rustc_index::newtype_index! {
|
|||
/// graph: they are only added.
|
||||
///
|
||||
/// The nodes in it are identified by a `DepNodeIndex`. We avoid keeping the nodes
|
||||
/// in memory. This is important, because these graph structures are some of the
|
||||
/// in memory. This is important, because these graph structures are some of the
|
||||
/// largest in the compiler.
|
||||
///
|
||||
/// For this reason, we avoid storing `DepNode`s more than once as map
|
||||
|
|
|
@ -1,14 +1,14 @@
|
|||
//! The data that we will serialize and deserialize.
|
||||
//!
|
||||
//! The dep-graph is serialized as a sequence of NodeInfo, with the dependencies
|
||||
//! specified inline. The total number of nodes and edges are stored as the last
|
||||
//! specified inline. The total number of nodes and edges are stored as the last
|
||||
//! 16 bytes of the file, so we can find them easily at decoding time.
|
||||
//!
|
||||
//! The serialisation is performed on-demand when each node is emitted. Using this
|
||||
//! scheme, we do not need to keep the current graph in memory.
|
||||
//!
|
||||
//! The deserialization is performed manually, in order to convert from the stored
|
||||
//! sequence of NodeInfos to the different arrays in SerializedDepGraph. Since the
|
||||
//! sequence of NodeInfos to the different arrays in SerializedDepGraph. Since the
|
||||
//! node and edge count are stored at the end of the file, all the arrays can be
|
||||
//! pre-allocated with the right length.
|
||||
|
||||
|
|
|
@ -116,7 +116,7 @@ where
|
|||
let mut lock = self.cache.get_shard_by_value(&key).lock();
|
||||
#[cfg(not(parallel_compiler))]
|
||||
let mut lock = self.cache.lock();
|
||||
// We may be overwriting another value. This is all right, since the dep-graph
|
||||
// We may be overwriting another value. This is all right, since the dep-graph
|
||||
// will check that the fingerprint matches.
|
||||
lock.insert(key, (value.clone(), index));
|
||||
value
|
||||
|
@ -203,7 +203,7 @@ where
|
|||
let mut lock = self.cache.get_shard_by_value(&key).lock();
|
||||
#[cfg(not(parallel_compiler))]
|
||||
let mut lock = self.cache.lock();
|
||||
// We may be overwriting another value. This is all right, since the dep-graph
|
||||
// We may be overwriting another value. This is all right, since the dep-graph
|
||||
// will check that the fingerprint matches.
|
||||
lock.insert(key, value);
|
||||
&value.0
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue