mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 02:33:06 +01:00
Fix typos of occurred and occurrence
llvm-svn: 323318
This commit is contained in:
parent
40b22f1367
commit
12e0bc3d59
@ -554,7 +554,7 @@ public:
|
||||
/// Check if the edge between this block and the given successor \p
|
||||
/// Succ, can be split. If this returns true a subsequent call to
|
||||
/// SplitCriticalEdge is guaranteed to return a valid basic block if
|
||||
/// no changes occured in the meantime.
|
||||
/// no changes occurred in the meantime.
|
||||
bool canSplitCriticalEdge(const MachineBasicBlock *Succ) const;
|
||||
|
||||
void pop_front() { Insts.pop_front(); }
|
||||
|
@ -212,7 +212,7 @@ public:
|
||||
/// representation to the MI representation.
|
||||
/// Adds IR based lowering and target specific optimization passes and finally
|
||||
/// the core instruction selection passes.
|
||||
/// \returns true if an error occured, false otherwise.
|
||||
/// \returns true if an error occurred, false otherwise.
|
||||
bool addISelPasses();
|
||||
|
||||
/// Add common target configurable passes that perform LLVM IR to IR
|
||||
|
@ -108,7 +108,7 @@ private:
|
||||
/// \param Abbrev Pointer to the abbreviations section we are verifying
|
||||
/// Abbrev can be a pointer to either .debug_abbrev or debug_abbrev.dwo.
|
||||
///
|
||||
/// \returns The number of errors that occured during verification.
|
||||
/// \returns The number of errors that occurred during verification.
|
||||
unsigned verifyAbbrevSection(const DWARFDebugAbbrev *Abbrev);
|
||||
|
||||
/// Verifies the header of a unit in the .debug_info section.
|
||||
@ -157,7 +157,7 @@ private:
|
||||
/// This function currently checks for:
|
||||
/// - cases in which lowPC >= highPC
|
||||
///
|
||||
/// \returns Number of errors that occured during verification.
|
||||
/// \returns Number of errors that occurred during verification.
|
||||
unsigned verifyDieRanges(const DWARFDie &Die, DieRangeInfo &ParentRI);
|
||||
|
||||
/// Verifies the attribute's DWARF attribute and its value.
|
||||
@ -169,7 +169,7 @@ private:
|
||||
/// \param Die The DWARF DIE that owns the attribute value
|
||||
/// \param AttrValue The DWARF attribute value to check
|
||||
///
|
||||
/// \returns NumErrors The number of errors occured during verification of
|
||||
/// \returns NumErrors The number of errors occurred during verification of
|
||||
/// attributes' values in a .debug_info section unit
|
||||
unsigned verifyDebugInfoAttribute(const DWARFDie &Die,
|
||||
DWARFAttribute &AttrValue);
|
||||
@ -184,7 +184,7 @@ private:
|
||||
/// \param Die The DWARF DIE that owns the attribute value
|
||||
/// \param AttrValue The DWARF attribute value to check
|
||||
///
|
||||
/// \returns NumErrors The number of errors occured during verification of
|
||||
/// \returns NumErrors The number of errors occurred during verification of
|
||||
/// attributes' forms in a .debug_info section unit
|
||||
unsigned verifyDebugInfoForm(const DWARFDie &Die, DWARFAttribute &AttrValue);
|
||||
|
||||
@ -196,7 +196,7 @@ private:
|
||||
/// around, that it doesn't create invalid references by failing to relocate
|
||||
/// CU relative and absolute references.
|
||||
///
|
||||
/// \returns NumErrors The number of errors occured during verification of
|
||||
/// \returns NumErrors The number of errors occurred during verification of
|
||||
/// references for the .debug_info section
|
||||
unsigned verifyDebugInfoReferences();
|
||||
|
||||
@ -227,7 +227,7 @@ private:
|
||||
/// \param StrData pointer to the string section
|
||||
/// \param SectionName the name of the table we're verifying
|
||||
///
|
||||
/// \returns The number of errors occured during verification
|
||||
/// \returns The number of errors occurred during verification
|
||||
unsigned verifyAppleAccelTable(const DWARFSection *AccelSection,
|
||||
DataExtractor *StrData,
|
||||
const char *SectionName);
|
||||
|
@ -173,7 +173,7 @@ public:
|
||||
/// \param PF The fragment to relax.
|
||||
/// \param Layout Code layout information.
|
||||
///
|
||||
/// \returns true iff any relaxation occured.
|
||||
/// \returns true iff any relaxation occurred.
|
||||
bool relaxFragment(MCPaddingFragment *PF, MCAsmLayout &Layout);
|
||||
};
|
||||
|
||||
|
@ -119,7 +119,7 @@ public:
|
||||
/// \param Fragment The fragment to relax.
|
||||
/// \param Layout Code layout information.
|
||||
///
|
||||
/// \returns true iff any relaxation occured.
|
||||
/// \returns true iff any relaxation occurred.
|
||||
bool relaxFragment(MCPaddingFragment *Fragment, MCAsmLayout &Layout);
|
||||
};
|
||||
|
||||
|
@ -66,7 +66,7 @@ struct CachePruningPolicy {
|
||||
Expected<CachePruningPolicy> parseCachePruningPolicy(StringRef PolicyStr);
|
||||
|
||||
/// Peform pruning using the supplied policy, returns true if pruning
|
||||
/// occured, i.e. if Policy.Interval was expired.
|
||||
/// occurred, i.e. if Policy.Interval was expired.
|
||||
///
|
||||
/// As a safeguard against data loss if the user specifies the wrong directory
|
||||
/// as their cache directory, this function will ignore files not matching the
|
||||
|
@ -1294,7 +1294,7 @@ LazyCallGraph::RefSCC::removeInternalRefEdge(Node &SourceN,
|
||||
|
||||
// Otherwise we create a collection of new RefSCC nodes and build
|
||||
// a radix-sort style map from postorder number to these new RefSCCs. We then
|
||||
// append SCCs to each of these RefSCCs in the order they occured in the
|
||||
// append SCCs to each of these RefSCCs in the order they occurred in the
|
||||
// original SCCs container.
|
||||
for (int i = 0; i < PostOrderNumber; ++i)
|
||||
Result.push_back(G->createRefSCC(*G));
|
||||
|
@ -586,7 +586,7 @@ PassBuilder::buildModuleSimplificationPipeline(OptimizationLevel Level,
|
||||
true));
|
||||
}
|
||||
|
||||
// Interprocedural constant propagation now that basic cleanup has occured
|
||||
// Interprocedural constant propagation now that basic cleanup has occurred
|
||||
// and prior to optimizing globals.
|
||||
// FIXME: This position in the pipeline hasn't been carefully considered in
|
||||
// years, it should be re-analyzed.
|
||||
|
@ -93,7 +93,7 @@ public:
|
||||
Bundle(const ObjectInfo &Info) : DeclTimeInfo(Info) {}
|
||||
};
|
||||
std::map<BundleKey, Bundle> BundleData;
|
||||
// Bundles are listed in the order of their first occurence.
|
||||
// Bundles are listed in the order of their first occurrence.
|
||||
std::vector<BundleKey> BundleList;
|
||||
} StringTableData;
|
||||
|
||||
|
@ -68,7 +68,7 @@ private:
|
||||
};
|
||||
|
||||
// Tokenize Input.
|
||||
// In case no error occured, the return value contains
|
||||
// In case no error occurred, the return value contains
|
||||
// tokens in order they were in the input file.
|
||||
// In case of any error, the return value contains
|
||||
// a textual representation of error.
|
||||
|
@ -384,7 +384,7 @@ TEST(DenseMapCustomTest, DefaultMinReservedSizeTest) {
|
||||
EXPECT_EQ(MemorySize, Map.getMemorySize());
|
||||
// Check that move was called the expected number of times
|
||||
EXPECT_EQ(ExpectedMaxInitialEntries, CountCopyAndMove::Move);
|
||||
// Check that no copy occured
|
||||
// Check that no copy occurred
|
||||
EXPECT_EQ(0, CountCopyAndMove::Copy);
|
||||
|
||||
// Adding one extra element should grow the map
|
||||
@ -397,7 +397,7 @@ TEST(DenseMapCustomTest, DefaultMinReservedSizeTest) {
|
||||
// Check that move was called the expected number of times
|
||||
// This relies on move-construction elision, and cannot be reliably tested.
|
||||
// EXPECT_EQ(ExpectedMaxInitialEntries + 2, CountCopyAndMove::Move);
|
||||
// Check that no copy occured
|
||||
// Check that no copy occurred
|
||||
EXPECT_EQ(0, CountCopyAndMove::Copy);
|
||||
}
|
||||
|
||||
@ -422,7 +422,7 @@ TEST(DenseMapCustomTest, InitialSizeTest) {
|
||||
EXPECT_EQ(MemorySize, Map.getMemorySize());
|
||||
// Check that move was called the expected number of times
|
||||
EXPECT_EQ(Size, CountCopyAndMove::Move);
|
||||
// Check that no copy occured
|
||||
// Check that no copy occurred
|
||||
EXPECT_EQ(0, CountCopyAndMove::Copy);
|
||||
}
|
||||
}
|
||||
@ -438,7 +438,7 @@ TEST(DenseMapCustomTest, InitFromIterator) {
|
||||
CountCopyAndMove::Move = 0;
|
||||
CountCopyAndMove::Copy = 0;
|
||||
DenseMap<int, CountCopyAndMove> Map(Values.begin(), Values.end());
|
||||
// Check that no move occured
|
||||
// Check that no move occurred
|
||||
EXPECT_EQ(0, CountCopyAndMove::Move);
|
||||
// Check that copy was called the expected number of times
|
||||
EXPECT_EQ(Count, CountCopyAndMove::Copy);
|
||||
@ -466,7 +466,7 @@ TEST(DenseMapCustomTest, ReserveTest) {
|
||||
EXPECT_EQ(MemorySize, Map.getMemorySize());
|
||||
// Check that move was called the expected number of times
|
||||
EXPECT_EQ(Size, CountCopyAndMove::Move);
|
||||
// Check that no copy occured
|
||||
// Check that no copy occurred
|
||||
EXPECT_EQ(0, CountCopyAndMove::Copy);
|
||||
}
|
||||
}
|
||||
|
@ -181,7 +181,7 @@ TEST(DenseSetCustomTest, ReserveTest) {
|
||||
EXPECT_EQ(MemorySize, Set.getMemorySize());
|
||||
// Check that move was called the expected number of times
|
||||
EXPECT_EQ(Size, CountCopyAndMove::Move);
|
||||
// Check that no copy occured
|
||||
// Check that no copy occurred
|
||||
EXPECT_EQ(0, CountCopyAndMove::Copy);
|
||||
}
|
||||
}
|
||||
|
@ -103,7 +103,7 @@ while [[ $# -gt 0 ]]; do
|
||||
|
||||
if [ "$PROJ" == "clang-tools-extra" ]; then
|
||||
if [ $CLANG_TOOLS_EXTRA_ENABLED -ne 0 ]; then
|
||||
echo "Project 'clang-tools-extra' is already enabled, ignoring extra occurences."
|
||||
echo "Project 'clang-tools-extra' is already enabled, ignoring extra occurrences."
|
||||
else
|
||||
CLANG_TOOLS_EXTRA_ENABLED=1
|
||||
fi
|
||||
@ -114,7 +114,7 @@ while [[ $# -gt 0 ]]; do
|
||||
if ! contains_project "$PROJ" ; then
|
||||
append_project "$PROJ"
|
||||
else
|
||||
echo "Project '$PROJ' is already enabled, ignoring extra occurences."
|
||||
echo "Project '$PROJ' is already enabled, ignoring extra occurrences."
|
||||
fi
|
||||
;;
|
||||
-i|--install-target)
|
||||
|
@ -192,7 +192,7 @@ class GTEST_API_ FilePath {
|
||||
|
||||
void Normalize();
|
||||
|
||||
// Returns a pointer to the last occurence of a valid path separator in
|
||||
// Returns a pointer to the last occurrence of a valid path separator in
|
||||
// the FilePath. On Windows, for example, both '/' and '\' are valid path
|
||||
// separators. Returns NULL if no path separator was found.
|
||||
const char* FindLastPathSeparator() const;
|
||||
|
@ -130,7 +130,7 @@ FilePath FilePath::RemoveExtension(const char* extension) const {
|
||||
return *this;
|
||||
}
|
||||
|
||||
// Returns a pointer to the last occurence of a valid path separator in
|
||||
// Returns a pointer to the last occurrence of a valid path separator in
|
||||
// the FilePath. On Windows, for example, both '/' and '\' are valid path
|
||||
// separators. Returns NULL if no path separator was found.
|
||||
const char* FilePath::FindLastPathSeparator() const {
|
||||
|
Loading…
Reference in New Issue
Block a user