Merge pull request #72088 from language-core/main

chore: fix some comments

Author: eeckstein

SwiftCompilerSources/Sources/Optimizer/Analysis/AliasAnalysis.swift

@@ -63,7 +63,7 @@ struct AliasAnalysis {
         let path = SmallProjectionPath(.anyValueFields)
         if let apply = inst as? ApplySite {
           // Workaround for quadratic complexity in ARCSequenceOpts.
-          // We need to use an ever lower budget to not get into noticable compile time troubles.
+          // We need to use an ever lower budget to not get into noticeable compile time troubles.
           let budget = complexityBudget / 10
           let effect = getOwnershipEffect(of: apply, for: obj, path: path, complexityBudget: budget, context)
           return effect.destroy

SwiftCompilerSources/Sources/Optimizer/Utilities/EscapeUtils.swift

@@ -225,7 +225,7 @@ struct EscapeUtilityTypes {
     ///   store %other to %2   // 4. ignore (followStores == false): %other doesn't impact the "escapeness" of %1
     /// \endcode
     ///
-    /// But once the the up-walk sees a load, it has to follow stores from that point on.
+    /// But once the up-walk sees a load, it has to follow stores from that point on.
     /// Example:
     /// \code
     /// bb0(%function_arg):            // 7. escaping! %1 escapes through %function_arg

SwiftCompilerSources/Sources/Optimizer/Utilities/OwnershipLiveness.swift

@@ -476,7 +476,7 @@ struct InteriorUseWalker {
   ///
   /// .escaping may either be a non-address operand with
   /// .pointerEscape ownership, or and address operand that escapes
-  /// the adderss (address_to_pointer).
+  /// the address (address_to_pointer).
   ///
   /// .unknown is an address operand whose user is unrecognized.
   enum InteriorPointerStatus {

SwiftCompilerSources/Sources/SIL/Argument.swift

@@ -244,7 +244,7 @@ public struct ArgumentConventions : Collection, CustomStringConvertible {
   /// The SIL argument index of the function type's first parameter.
   public var firstParameterIndex: Int { indirectSILResultCount }
 
-  /// The SIL argument index of the 'self' paramter.
+  /// The SIL argument index of the 'self' parameter.
   var selfIndex: Int? {
     guard convention.hasSelfParameter else { return nil }
     // self is the last parameter

benchmark/utils/ArgParse.swift

@@ -83,7 +83,7 @@ class ArgumentParser<U> {
     /// Argument holds the name of the command line parameter, its help
     /// description and a rule that's applied to process it.
     ///
-    /// The the rule is typically a value processing closure used to convert it
+    /// The rule is typically a value processing closure used to convert it
     /// into given type and storing it in the parsing result.
     ///
     /// See also: addArgument, parseArgument

docs/EmbeddedSwift/UserManual.md

@@ -26,7 +26,7 @@ A typical setup and build + run cycle for an embedded development board involves
 - (5) Uploading the flashable binary to the board over a USB cable using some vendor-provided JTAG/SWD tool or by copying it to a fake USB Mass Storage volume presented by the board.
 - (6) Restarting the board, observing physical effects of the firmware (LEDs light up) or UART output over USB, or presence on network, etc.
 
-Most of these steps are out of scope for this document, instead refer to the vendor provided documentation and get familiar with the details of firmware development for your board without Swift in the mix first. Even if you want to build a completely pure Swift firmware, you are still very likely going to need the the vendor provided tooling for linking, post-processing, uploading, etc.
+Most of these steps are out of scope for this document, instead refer to the vendor provided documentation and get familiar with the details of firmware development for your board without Swift in the mix first. Even if you want to build a completely pure Swift firmware, you are still very likely going to need the vendor provided tooling for linking, post-processing, uploading, etc.
 
 ## Building code using Embedded Swift
 

docs/Generics/chapters/basic-operation.tex

@@ -528,7 +528,7 @@ \section{Protocol Components}\label{protocol component}
 \item (Check) If the worklist is empty, go to Step~8.
 \item (Next) Otherwise, remove the next protocol $p$ from the worklist. If $p\in\texttt{S}$, go back to Step~2, otherwise set $\texttt{S}\leftarrow\texttt{S}\cup\{p\}$.
 \item (Component) Use Algorithm~\ref{tarjan} to compute the component ID for $p$.
-\item (Machine) Let $m$ be the the requirement machine for this component, creating it first if necessary. If $m\not\in\texttt{M}$, set $\texttt{M}\leftarrow\texttt{M}\cup\{m\}$.
+\item (Machine) Let $m$ be the requirement machine for this component, creating it first if necessary. If $m\not\in\texttt{M}$, set $\texttt{M}\leftarrow\texttt{M}\cup\{m\}$.
 \item (Successors) Add each successor of $p$ to the worklist.
 \item (Loop) Go back to Step~1.
 \item (Collect) Return the concatenation of the local rules from each $m\in\texttt{M}$.

docs/Generics/chapters/completion.tex

@@ -351,7 +351,7 @@ \chapter{Completion}\label{completion}
 This new kind of trie lookup can be thought of as a \index{coroutine}coroutine or an iterator, yielding zero or more results as the search proceeds. We implement it as a higher-order function taking a callback.
 
 \begin{algorithm}[Overlap lookup in rule trie]\label{overlap trie lookup}
-Takes a term $t$, position $i$ with $0\leq i<|t|$, and a callback. For each rule $u\Rightarrow v$ where $t[i:]$ is a prefix of $u$ or $u$ is a prefix of $t[i:]$, invokes the the callback with the rule $u\Rightarrow v$.
+Takes a term $t$, position $i$ with $0\leq i<|t|$, and a callback. For each rule $u\Rightarrow v$ where $t[i:]$ is a prefix of $u$ or $u$ is a prefix of $t[i:]$, invokes the callback with the rule $u\Rightarrow v$.
 \begin{enumerate}
 \item (Initialize) Set \texttt{N} to the root node of the trie.
 \item (End) If $i=|t|$, we've reached the end of the term. Perform a pre-order traversal of all child nodes of \texttt{N}, and for those children that have an associated rewrite rule, invoke the callback with that rule (this is the case where $t[i:]$ is a prefix of each $u$).

docs/ReferenceGuides/UnderscoredAttributes.md

@@ -1135,7 +1135,7 @@ doing a textual search.
 
 Like `@available`, this attribute indicates a decl is available only as an SPI.
 This implies several behavioral changes comparing to regular `@available`:
-1. Type checker diagnoses when a client accidently exposes such a symbol in library APIs.
+1. Type checker diagnoses when a client accidentally exposes such a symbol in library APIs.
 2. When emitting public interfaces, `@_spi_available` is printed as `@available(platform, unavailable)`.
 3. ClangImporter imports ObjC macros `SPI_AVAILABLE` and `__SPI_AVAILABLE` to this attribute.
 

include/swift/AST/Expr.h

@@ -4716,7 +4716,7 @@ class ApplyExpr : public Expr {
   /// complete type-checking.
   ///
   /// Returns the thrown error destination, which includes both the type
-  /// thrown from this application as well as the the context's error type,
+  /// thrown from this application as well as the context's error type,
   /// which may be different.
   ThrownErrorDestination throws() const {
     assert(Bits.ApplyExpr.ThrowsIsSet);