diff options
Diffstat (limited to 'lld/ELF/CallGraphSort.cpp')
| -rw-r--r-- | lld/ELF/CallGraphSort.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/lld/ELF/CallGraphSort.cpp b/lld/ELF/CallGraphSort.cpp index 6f8ef8954af3..6dad7c965f1a 100644 --- a/lld/ELF/CallGraphSort.cpp +++ b/lld/ELF/CallGraphSort.cpp @@ -16,9 +16,9 @@ /// /// Definitions: /// * Cluster -/// * An ordered list of input sections which are layed out as a unit. At the +/// * An ordered list of input sections which are laid out as a unit. At the /// beginning of the algorithm each input section has its own cluster and -/// the weight of the cluster is the sum of the weight of all incomming +/// the weight of the cluster is the sum of the weight of all incoming /// edges. /// * Call-Chain Clustering (C³) Heuristic /// * Defines when and how clusters are combined. Pick the highest weighted @@ -26,7 +26,7 @@ /// penalize it too much. /// * Density /// * The weight of the cluster divided by the size of the cluster. This is a -/// proxy for the ammount of execution time spent per byte of the cluster. +/// proxy for the amount of execution time spent per byte of the cluster. /// /// It does so given a call graph profile by the following: /// * Build a weighted call graph from the call graph profile @@ -86,7 +86,7 @@ private: std::vector<const InputSectionBase *> sections; }; -// Maximum ammount the combined cluster density can be worse than the original +// Maximum amount the combined cluster density can be worse than the original // cluster to consider merging. constexpr int MAX_DENSITY_DEGRADATION = 8; |