Fix typos and spelling errors across codebase (#156270)
Corrected various spelling mistakes such as 'occurred', 'receiver', 'initialized', 'length', and others in comments, variable names, function names, and documentation throughout the project. These changes improve code readability and maintain consistency in naming and documentation. Co-authored-by: Louis Dionne <ldionne.2@gmail.com>
This commit is contained in:
Austin Jiang
GitHub
parent
2e0e4f6cb3
commit
e6cdfb75ac
@ -677,11 +677,11 @@ static constexpr uint32_t getDebugNamesHeaderSize() {
|
||||
constexpr uint32_t BucketCountLength = sizeof(uint32_t);
|
||||
constexpr uint32_t NameCountLength = sizeof(uint32_t);
|
||||
constexpr uint32_t AbbrevTableSizeLength = sizeof(uint32_t);
|
||||
constexpr uint32_t AugmentationStringSizeLenght = sizeof(uint32_t);
|
||||
constexpr uint32_t AugmentationStringSizeLength = sizeof(uint32_t);
|
||||
return VersionLength + PaddingLength + CompUnitCountLength +
|
||||
LocalTypeUnitCountLength + ForeignTypeUnitCountLength +
|
||||
BucketCountLength + NameCountLength + AbbrevTableSizeLength +
|
||||
AugmentationStringSizeLenght;
|
||||
AugmentationStringSizeLength;
|
||||
}
|
||||
|
||||
void DWARF5AcceleratorTable::emitHeader() const {
|
||||
|
||||
@ -16,7 +16,7 @@
|
||||
.type _Z3foov,@function
|
||||
_Z3foov: # @_Z3foov
|
||||
.Lfunc_begin0:
|
||||
.file 1 "/dwarf4-lenght-test" "helper.cpp"
|
||||
.file 1 "/dwarf4-length-test" "helper.cpp"
|
||||
.loc 1 7 0 # helper.cpp:7:0
|
||||
.cfi_startproc
|
||||
# %bb.0:
|
||||
@ -257,7 +257,7 @@ _Z3foov: # @_Z3foov
|
||||
.Linfo_string1:
|
||||
.asciz "helper.cpp" # string offset=146
|
||||
.Linfo_string2:
|
||||
.asciz "/home/ayermolo/local/tasks/T117448832/dwarf4-lenght-test" # string offset=157
|
||||
.asciz "/home/ayermolo/local/tasks/T117448832/dwarf4-length-test" # string offset=157
|
||||
.Linfo_string3:
|
||||
.asciz "_Z3foov" # string offset=214
|
||||
.Linfo_string4:
|
||||
|
||||
@ -16,7 +16,7 @@
|
||||
.type main,@function
|
||||
main: # @main
|
||||
.Lfunc_begin0:
|
||||
.file 1 "/dwarf4-lenght-test" "main.cpp"
|
||||
.file 1 "/dwarf4-length-test" "main.cpp"
|
||||
.loc 1 7 0 # main.cpp:7:0
|
||||
.cfi_startproc
|
||||
# %bb.0:
|
||||
@ -258,7 +258,7 @@ main: # @main
|
||||
.Linfo_string1:
|
||||
.asciz "main.cpp" # string offset=146
|
||||
.Linfo_string2:
|
||||
.asciz "/dwarf4-lenght-test" # string offset=155
|
||||
.asciz "/dwarf4-length-test" # string offset=155
|
||||
.Linfo_string3:
|
||||
.asciz "main" # string offset=212
|
||||
.Linfo_string4:
|
||||
|
||||
@ -292,7 +292,7 @@ bool MakeSmartPtrCheck::replaceNew(DiagnosticBuilder &Diag,
|
||||
// Foo(Bar{1, 2}) => true
|
||||
// Foo(1) => false
|
||||
// Foo{1} => false
|
||||
auto HasListIntializedArgument = [](const CXXConstructExpr *CE) {
|
||||
auto HasListInitializedArgument = [](const CXXConstructExpr *CE) {
|
||||
for (const auto *Arg : CE->arguments()) {
|
||||
Arg = Arg->IgnoreImplicit();
|
||||
|
||||
@ -348,7 +348,7 @@ bool MakeSmartPtrCheck::replaceNew(DiagnosticBuilder &Diag,
|
||||
// std::make_smart_ptr<S2>(std::vector<int>({1}));
|
||||
// std::make_smart_ptr<S3>(S2{1, 2}, 3);
|
||||
if (const auto *CE = New->getConstructExpr()) {
|
||||
if (HasListIntializedArgument(CE))
|
||||
if (HasListInitializedArgument(CE))
|
||||
return false;
|
||||
}
|
||||
if (ArraySizeExpr.empty()) {
|
||||
@ -370,7 +370,7 @@ bool MakeSmartPtrCheck::replaceNew(DiagnosticBuilder &Diag,
|
||||
SourceRange InitRange;
|
||||
if (const auto *NewConstruct = New->getConstructExpr()) {
|
||||
if (NewConstruct->isStdInitListInitialization() ||
|
||||
HasListIntializedArgument(NewConstruct)) {
|
||||
HasListInitializedArgument(NewConstruct)) {
|
||||
// FIXME: Add fixes for direct initialization with the initializer-list
|
||||
// constructor. Similar to the above CallInit case, the type has to be
|
||||
// specified explicitly in the fixes.
|
||||
|
||||
@ -1793,7 +1793,7 @@ void parseDocumentationParagraph(llvm::StringRef Text, markup::Paragraph &Out) {
|
||||
|
||||
void parseDocumentation(llvm::StringRef Input, markup::Document &Output) {
|
||||
// A documentation string is treated as a sequence of paragraphs,
|
||||
// where the paragraphs are seperated by at least one empty line
|
||||
// where the paragraphs are separated by at least one empty line
|
||||
// (meaning 2 consecutive newline characters).
|
||||
// Possible leading empty lines (introduced by an odd number > 1 of
|
||||
// empty lines between 2 paragraphs) will be removed later in the Markup
|
||||
|
||||
@ -143,7 +143,7 @@ FileShardedIndex::FileShardedIndex(IndexFileIn Input)
|
||||
}
|
||||
}
|
||||
}
|
||||
// Attribute references into each file they occured in.
|
||||
// Attribute references into each file they occurred in.
|
||||
if (Index.Refs) {
|
||||
for (const auto &SymRefs : *Index.Refs) {
|
||||
for (const auto &R : SymRefs.second) {
|
||||
|
||||
@ -77,7 +77,7 @@ void SplitDelimiters() {
|
||||
// CHECK-MESSAGES: [[@LINE-1]]:25: warning: absl::StrSplit()
|
||||
// CHECK-FIXES: absl::StrSplit("ABC", 'A', [](absl::string_view) { return true; });
|
||||
|
||||
// Doesn't do anything with other strings lenghts.
|
||||
// Doesn't do anything with other strings lengths.
|
||||
absl::StrSplit("ABC", "AB");
|
||||
absl::StrSplit("ABC", absl::ByAnyChar(""));
|
||||
absl::StrSplit("ABC", absl::ByAnyChar(" \t"));
|
||||
|
||||
@ -65,7 +65,7 @@ end:
|
||||
//------------------------------ B1. Increments ------------------------------//
|
||||
//----------------------------------------------------------------------------//
|
||||
// Check that every thing listed in B1 of the specification does indeed //
|
||||
// recieve the base increment, and that not-body does not increase nesting //
|
||||
// receive the base increment, and that not-body does not increase nesting //
|
||||
//----------------------------------------------------------------------------//
|
||||
|
||||
// break does not increase cognitive complexity.
|
||||
@ -698,7 +698,7 @@ void unittest_b2_10() {
|
||||
//-------------------------- B3. Nesting increments --------------------------//
|
||||
//----------------------------------------------------------------------------//
|
||||
// Check that every thing listed in B3 of the specification does indeed //
|
||||
// recieve the penalty of the current nesting level //
|
||||
// receive the penalty of the current nesting level //
|
||||
//----------------------------------------------------------------------------//
|
||||
|
||||
void unittest_b3_00() {
|
||||
|
||||
@ -6988,7 +6988,7 @@ public:
|
||||
const ObjCInterfaceDecl *UnknownObjCClass = nullptr,
|
||||
bool ObjCPropertyAccess = false,
|
||||
bool AvoidPartialAvailabilityChecks = false,
|
||||
ObjCInterfaceDecl *ClassReciever = nullptr,
|
||||
ObjCInterfaceDecl *ClassReceiver = nullptr,
|
||||
bool SkipTrailingRequiresClause = false);
|
||||
|
||||
/// Emit a note explaining that this function is deleted.
|
||||
|
||||
@ -172,11 +172,11 @@ def CallAndMessageChecker
|
||||
"false", InAlpha>,
|
||||
CmdLineOption<
|
||||
Boolean, "NilReceiver",
|
||||
"Check whether the reciever in the message expression is nil",
|
||||
"Check whether the receiver in the message expression is nil",
|
||||
"true", Released>,
|
||||
CmdLineOption<
|
||||
Boolean, "UndefReceiver",
|
||||
"Check whether the reciever in the message expression is "
|
||||
"Check whether the receiver in the message expression is "
|
||||
"undefined",
|
||||
"true", Released>,
|
||||
CmdLineOption<
|
||||
|
||||
@ -743,14 +743,14 @@ class YAMLConverter {
|
||||
llvm::raw_ostream &OS;
|
||||
llvm::SourceMgr::DiagHandlerTy DiagHandler;
|
||||
void *DiagHandlerCtxt;
|
||||
bool ErrorOccured;
|
||||
bool ErrorOccurred;
|
||||
|
||||
/// Emit a diagnostic
|
||||
bool emitError(llvm::Twine Message) {
|
||||
DiagHandler(
|
||||
llvm::SMDiagnostic("", llvm::SourceMgr::DK_Error, Message.str()),
|
||||
DiagHandlerCtxt);
|
||||
ErrorOccured = true;
|
||||
ErrorOccurred = true;
|
||||
return true;
|
||||
}
|
||||
|
||||
@ -761,7 +761,7 @@ public:
|
||||
void *DiagHandlerCtxt)
|
||||
: M(TheModule), Writer(TheModule.Name, SourceFile), OS(OS),
|
||||
DiagHandler(DiagHandler), DiagHandlerCtxt(DiagHandlerCtxt),
|
||||
ErrorOccured(false) {}
|
||||
ErrorOccurred(false) {}
|
||||
|
||||
void convertAvailability(const AvailabilityItem &Availability,
|
||||
CommonEntityInfo &CEI, llvm::StringRef APIName) {
|
||||
@ -1234,10 +1234,10 @@ public:
|
||||
convertTopLevelItems(/* context */ std::nullopt, Versioned.Items,
|
||||
Versioned.Version);
|
||||
|
||||
if (!ErrorOccured)
|
||||
if (!ErrorOccurred)
|
||||
Writer.writeToStream(OS);
|
||||
|
||||
return ErrorOccured;
|
||||
return ErrorOccurred;
|
||||
}
|
||||
};
|
||||
} // namespace
|
||||
|
||||
@ -96,7 +96,7 @@ static BoolValue &unpackValue(BoolValue &V, Environment &Env) {
|
||||
}
|
||||
|
||||
// Unpacks the value (if any) associated with `E` and updates `E` to the new
|
||||
// value, if any unpacking occured. Also, does the lvalue-to-rvalue conversion,
|
||||
// value, if any unpacking occurred. Also, does the lvalue-to-rvalue conversion,
|
||||
// by skipping past the reference.
|
||||
static Value *maybeUnpackLValueExpr(const Expr &E, Environment &Env) {
|
||||
auto *Loc = Env.getStorageLocation(E);
|
||||
|
||||
@ -897,7 +897,7 @@ void clang::getOpenMPCaptureRegions(
|
||||
|
||||
auto GetRegionsForLeaf = [&](OpenMPDirectiveKind LKind) {
|
||||
assert(isLeafConstruct(LKind) && "Epecting leaf directive");
|
||||
// Whether a leaf would require OMPD_unknown if it occured on its own.
|
||||
// Whether a leaf would require OMPD_unknown if it occurred on its own.
|
||||
switch (LKind) {
|
||||
case OMPD_metadirective:
|
||||
CaptureRegions.push_back(OMPD_metadirective);
|
||||
|
||||
@ -202,10 +202,10 @@ parseCrossTUIndex(StringRef IndexPath) {
|
||||
SmallString<32> FilePath(FilePathInIndex);
|
||||
llvm::sys::path::native(FilePath, llvm::sys::path::Style::posix);
|
||||
|
||||
bool InsertionOccured;
|
||||
std::tie(std::ignore, InsertionOccured) =
|
||||
bool InsertionOccurred;
|
||||
std::tie(std::ignore, InsertionOccurred) =
|
||||
Result.try_emplace(LookupName, FilePath.begin(), FilePath.end());
|
||||
if (!InsertionOccured)
|
||||
if (!InsertionOccurred)
|
||||
return llvm::make_error<IndexError>(
|
||||
index_error_code::multiple_definitions, IndexPath.str(), LineNo);
|
||||
|
||||
|
||||
@ -1395,7 +1395,7 @@ std::optional<float> RootSignatureParser::handleFloatLiteral(bool Negated) {
|
||||
llvm::APFloat::opStatus Status(Literal.GetFloatValue(Val, DXCRoundingMode));
|
||||
|
||||
// Note: we do not error when opStatus::opInexact by itself as this just
|
||||
// denotes that rounding occured but not that it is invalid
|
||||
// denotes that rounding occurred but not that it is invalid
|
||||
assert(!(Status & llvm::APFloat::opStatus::opInvalidOp) &&
|
||||
"NumSpelling consists only of [0-9.ef+-]. Any malformed NumSpelling "
|
||||
"will be caught and reported by NumericLiteralParser.");
|
||||
|
||||
@ -345,7 +345,7 @@ shouldTrackFirstArgumentForConstructor(const CXXConstructExpr *Ctor) {
|
||||
// patterns.
|
||||
auto RHSArgType = Ctor->getArg(0)->getType();
|
||||
const auto *RHSRD = RHSArgType->getAsRecordDecl();
|
||||
// LHS is constructed from an intializer_list.
|
||||
// LHS is constructed from an initializer_list.
|
||||
//
|
||||
// std::initializer_list is a proxy object that provides access to the backing
|
||||
// array. We perform analysis on it to determine if there are any dangling
|
||||
@ -1464,7 +1464,7 @@ checkExprLifetimeImpl(Sema &SemaRef, const InitializedEntity *InitEntity,
|
||||
else
|
||||
visitLocalsRetainedByInitializer(
|
||||
Path, Init, TemporaryVisitor,
|
||||
// Don't revisit the sub inits for the intialization case.
|
||||
// Don't revisit the sub inits for the initialization case.
|
||||
/*RevisitSubinits=*/!InitEntity);
|
||||
}
|
||||
|
||||
|
||||
@ -252,7 +252,7 @@ SemaCUDA::CUDAVariableTarget SemaCUDA::IdentifyTarget(const VarDecl *Var) {
|
||||
return CVT_Unified;
|
||||
// Only constexpr and const variabless with implicit constant attribute
|
||||
// are emitted on both sides. Such variables are promoted to device side
|
||||
// only if they have static constant intializers on device side.
|
||||
// only if they have static constant initializers on device side.
|
||||
if ((Var->isConstexpr() || Var->getType().isConstQualified()) &&
|
||||
Var->hasAttr<CUDAConstantAttr>() &&
|
||||
!hasExplicitAttr<CUDAConstantAttr>(Var))
|
||||
|
||||
@ -10990,18 +10990,18 @@ void Sema::ActOnFinishDelayedCXXMethodDeclaration(Scope *S, Decl *MethodD) {
|
||||
static void checkMethodTypeQualifiers(Sema &S, Declarator &D, unsigned DiagID) {
|
||||
const DeclaratorChunk::FunctionTypeInfo &FTI = D.getFunctionTypeInfo();
|
||||
if (FTI.hasMethodTypeQualifiers() && !D.isInvalidType()) {
|
||||
bool DiagOccured = false;
|
||||
bool DiagOccurred = false;
|
||||
FTI.MethodQualifiers->forEachQualifier(
|
||||
[DiagID, &S, &DiagOccured](DeclSpec::TQ, StringRef QualName,
|
||||
SourceLocation SL) {
|
||||
[DiagID, &S, &DiagOccurred](DeclSpec::TQ, StringRef QualName,
|
||||
SourceLocation SL) {
|
||||
// This diagnostic should be emitted on any qualifier except an addr
|
||||
// space qualifier. However, forEachQualifier currently doesn't visit
|
||||
// addr space qualifiers, so there's no way to write this condition
|
||||
// right now; we just diagnose on everything.
|
||||
S.Diag(SL, DiagID) << QualName << SourceRange(SL);
|
||||
DiagOccured = true;
|
||||
DiagOccurred = true;
|
||||
});
|
||||
if (DiagOccured)
|
||||
if (DiagOccurred)
|
||||
D.setInvalidType();
|
||||
}
|
||||
}
|
||||
|
||||
@ -5365,7 +5365,7 @@ bool TreeTransform<Derived>::PreparePackForExpansion(TemplateArgumentLoc In,
|
||||
// };
|
||||
// TupleWithInt<int>::type y;
|
||||
// At this point we will see the `__builtin_dedup_pack<int, int>` with a known
|
||||
// lenght and run `ComputeInfo()` to provide the necessary information to our
|
||||
// length and run `ComputeInfo()` to provide the necessary information to our
|
||||
// caller.
|
||||
//
|
||||
// Note that we may still have situations where builtin is not going to be
|
||||
|
||||
@ -248,7 +248,7 @@ public:
|
||||
if (auto *Receiver = E->getInstanceReceiver()) {
|
||||
Receiver = Receiver->IgnoreParenCasts();
|
||||
if (isUnknownType(E->getReceiverType()))
|
||||
reportUnknownRecieverType(Receiver, DeclWithIssue);
|
||||
reportUnknownReceiverType(Receiver, DeclWithIssue);
|
||||
}
|
||||
|
||||
auto *MethodDecl = E->getMethodDecl();
|
||||
@ -332,7 +332,7 @@ public:
|
||||
Param->getType());
|
||||
}
|
||||
|
||||
void reportUnknownRecieverType(const Expr *Receiver,
|
||||
void reportUnknownReceiverType(const Expr *Receiver,
|
||||
const Decl *DeclWithIssue) const {
|
||||
assert(Receiver);
|
||||
reportBug(Receiver->getExprLoc(), Receiver->getSourceRange(), DeclWithIssue,
|
||||
|
||||
@ -96,7 +96,7 @@ def main():
|
||||
except (FileNotFoundError, csv.Error, Exception) as e:
|
||||
print(str(e))
|
||||
except:
|
||||
print("An error occured")
|
||||
print("An error occurred")
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
|
||||
@ -645,7 +645,7 @@ class NonVirtualDiamondInheritanceTest6 : public First6, public Second6 {
|
||||
public:
|
||||
NonVirtualDiamondInheritanceTest6() // expected-warning{{2 uninitialized fields}}
|
||||
: First6(int{}) {
|
||||
// 'z' and 'Second::x' unintialized
|
||||
// 'z' and 'Second::x' uninitialized
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
@ -184,7 +184,7 @@ class CtorDelegationTest1 {
|
||||
public:
|
||||
CtorDelegationTest1(int)
|
||||
: a(9) {
|
||||
// leaves 'b' unintialized, but we'll never check this function
|
||||
// leaves 'b' uninitialized, but we'll never check this function
|
||||
}
|
||||
|
||||
CtorDelegationTest1()
|
||||
@ -205,7 +205,7 @@ class CtorDelegationTest2 {
|
||||
public:
|
||||
CtorDelegationTest2(int)
|
||||
: b(11) {
|
||||
// leaves 'a' unintialized, but we'll never check this function
|
||||
// leaves 'a' uninitialized, but we'll never check this function
|
||||
}
|
||||
|
||||
CtorDelegationTest2()
|
||||
|
||||
@ -30,8 +30,8 @@ extern NSString * const NSUndoManagerCheckpointNotification;
|
||||
|
||||
int main (int argc, const char * argv[]) {
|
||||
NSAutoreleasePool * pool = [[NSAutoreleasePool alloc] init];
|
||||
id someUnintializedPointer = [someUnintializedPointer objectAtIndex:0]; // expected-warning{{Receiver in message expression is an uninitialized value}}
|
||||
NSLog(@"%@", someUnintializedPointer);
|
||||
id someUninitializedPointer = [someUninitializedPointer objectAtIndex:0]; // expected-warning{{Receiver in message expression is an uninitialized value}}
|
||||
NSLog(@"%@", someUninitializedPointer);
|
||||
[pool drain];
|
||||
return 0;
|
||||
}
|
||||
|
||||
@ -19,7 +19,7 @@ namespace N1 {
|
||||
template<typename T>
|
||||
struct A {
|
||||
friend void f() noexcept;
|
||||
// FIXME: This error is emitted if no other errors occured (i.e. Sema::hasUncompilableErrorOccurred() is false).
|
||||
// FIXME: This error is emitted if no other errors occurred (i.e. Sema::hasUncompilableErrorOccurred() is false).
|
||||
friend void g() noexcept(x); // expected-error {{no member 'x' in 'N1::A<int>'; it has not yet been instantiated}}
|
||||
// expected-note@-1 {{in instantiation of exception specification}}
|
||||
static constexpr bool x = false; // expected-note {{not-yet-instantiated member is declared here}}
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
// some don't. (Currently, at least x86_64-windows-* and powerpc64le-* don't
|
||||
// treat it as void.)
|
||||
//
|
||||
// When intializing a struct with such a no_unique_address member, make sure we
|
||||
// When initializing a struct with such a no_unique_address member, make sure we
|
||||
// don't write the dummy i8 into the struct where there's no space allocated for
|
||||
// it.
|
||||
//
|
||||
|
||||
@ -881,7 +881,7 @@ public class Test
|
||||
private static void ComplexLambda(BuildReport protoReport)
|
||||
{
|
||||
allSelectedScenes =
|
||||
veryVeryLongCollectionNameThatPutsTheLineLenghtAboveTheThresholds.Where(scene => scene.enabled)
|
||||
veryVeryLongCollectionNameThatPutsTheLineLengthAboveTheThresholds.Where(scene => scene.enabled)
|
||||
.Select(scene => scene.path)
|
||||
.ToArray();
|
||||
if (allSelectedScenes.Count == 0)
|
||||
@ -899,7 +899,7 @@ public class Test
|
||||
verifyFormat(R"(//
|
||||
public class Test {
|
||||
private static void ComplexLambda(BuildReport protoReport) {
|
||||
allSelectedScenes = veryVeryLongCollectionNameThatPutsTheLineLenghtAboveTheThresholds
|
||||
allSelectedScenes = veryVeryLongCollectionNameThatPutsTheLineLengthAboveTheThresholds
|
||||
.Where(scene => scene.enabled)
|
||||
.Select(scene => scene.path)
|
||||
.ToArray();
|
||||
@ -925,7 +925,7 @@ public class Test
|
||||
private static void MultipleLambdas(BuildReport protoReport)
|
||||
{
|
||||
allSelectedScenes =
|
||||
veryVeryLongCollectionNameThatPutsTheLineLenghtAboveTheThresholds.Where(scene => scene.enabled)
|
||||
veryVeryLongCollectionNameThatPutsTheLineLengthAboveTheThresholds.Where(scene => scene.enabled)
|
||||
.Select(scene => scene.path)
|
||||
.ToArray();
|
||||
preBindEnumerators.RemoveAll(enumerator => !enumerator.MoveNext());
|
||||
@ -944,7 +944,7 @@ public class Test
|
||||
verifyFormat(R"(//
|
||||
public class Test {
|
||||
private static void MultipleLambdas(BuildReport protoReport) {
|
||||
allSelectedScenes = veryVeryLongCollectionNameThatPutsTheLineLenghtAboveTheThresholds
|
||||
allSelectedScenes = veryVeryLongCollectionNameThatPutsTheLineLengthAboveTheThresholds
|
||||
.Where(scene => scene.enabled)
|
||||
.Select(scene => scene.path)
|
||||
.ToArray();
|
||||
|
||||
@ -170,7 +170,7 @@ LOCAL_LABEL(do_substraction):
|
||||
movs r6, r4
|
||||
cmp r2, 0
|
||||
beq LOCAL_LABEL(form_result) // if a's exp is 0, no need to normalize.
|
||||
// If partial cancellation occured, we need to left-shift the result
|
||||
// If partial cancellation occurred, we need to left-shift the result
|
||||
// and adjust the exponent:
|
||||
lsrs r6, r6, #(significandBits + 3)
|
||||
bne LOCAL_LABEL(form_result)
|
||||
|
||||
@ -106,7 +106,7 @@ static __inline fp_t __addXf3__(fp_t a, fp_t b) {
|
||||
if (aSignificand == 0)
|
||||
return fromRep(0);
|
||||
|
||||
// If partial cancellation occured, we need to left-shift the result
|
||||
// If partial cancellation occurred, we need to left-shift the result
|
||||
// and adjust the exponent.
|
||||
if (aSignificand < implicitBit << 3) {
|
||||
const int shift = rep_clz(aSignificand) - rep_clz(implicitBit << 3);
|
||||
|
||||
@ -86,7 +86,7 @@ TEST(Backtrace, ExceedsStorableLength) {
|
||||
gwp_asan::AllocationMetadata Meta;
|
||||
Meta.AllocationTrace.RecordBacktrace(
|
||||
[](uintptr_t *TraceBuffer, size_t Size) -> size_t {
|
||||
// Need to inintialise the elements that will be packed.
|
||||
// Need to initialize the elements that will be packed.
|
||||
memset(TraceBuffer, 0u, Size * sizeof(*TraceBuffer));
|
||||
|
||||
// Indicate that there were more frames, and we just didn't have enough
|
||||
|
||||
@ -150,7 +150,7 @@ TEST(IOApiTests, MultilineOutputTest) {
|
||||
IONAME(OutputInteger64)(cookie, j);
|
||||
}
|
||||
|
||||
// Ensure no errors occured in write operations above
|
||||
// Ensure no errors occurred in write operations above
|
||||
const auto status{IONAME(EndIoStatement)(cookie)};
|
||||
ASSERT_EQ(status, 0) << "multiline: '" << format << "' failed, status "
|
||||
<< static_cast<int>(status);
|
||||
@ -184,7 +184,7 @@ TEST(IOApiTests, ListInputTest) {
|
||||
<< "InputComplex32 failed with value " << z[j];
|
||||
}
|
||||
|
||||
// Ensure no IO errors occured during IO operations above
|
||||
// Ensure no IO errors occurred during IO operations above
|
||||
auto status{IONAME(EndIoStatement)(cookie)};
|
||||
ASSERT_EQ(status, 0) << "Failed complex list-directed input, status "
|
||||
<< static_cast<int>(status);
|
||||
@ -200,7 +200,7 @@ TEST(IOApiTests, ListInputTest) {
|
||||
<< z[j + 1];
|
||||
}
|
||||
|
||||
// Ensure no IO errors occured during IO operations above
|
||||
// Ensure no IO errors occurred during IO operations above
|
||||
status = IONAME(EndIoStatement)(cookie);
|
||||
ASSERT_EQ(status, 0) << "Failed complex list-directed output, status "
|
||||
<< static_cast<int>(status);
|
||||
|
||||
@ -680,7 +680,7 @@ genOutlineArrayLit(Fortran::lower::AbstractConverter &converter,
|
||||
fir::GlobalOp global = builder.getNamedGlobal(globalName);
|
||||
if (!global) {
|
||||
// Using a dense attribute for the initial value instead of creating an
|
||||
// intialization body speeds up MLIR/LLVM compilation, but this is not
|
||||
// initialization body speeds up MLIR/LLVM compilation, but this is not
|
||||
// always possible.
|
||||
if constexpr (T::category == Fortran::common::TypeCategory::Logical ||
|
||||
T::category == Fortran::common::TypeCategory::Integer ||
|
||||
|
||||
@ -5506,7 +5506,7 @@ void OmpStructureChecker::Enter(const parser::OmpClause::ThreadLimit &x) {
|
||||
}
|
||||
|
||||
void OmpStructureChecker::Enter(const parser::OpenMPInteropConstruct &x) {
|
||||
bool isDependClauseOccured{false};
|
||||
bool isDependClauseOccurred{false};
|
||||
int targetCount{0}, targetSyncCount{0};
|
||||
const auto &dir{std::get<parser::OmpDirectiveName>(x.v.t)};
|
||||
std::set<const Symbol *> objectSymbolList;
|
||||
@ -5551,7 +5551,7 @@ void OmpStructureChecker::Enter(const parser::OpenMPInteropConstruct &x) {
|
||||
}
|
||||
},
|
||||
[&](const parser::OmpClause::Depend &dependClause) {
|
||||
isDependClauseOccured = true;
|
||||
isDependClauseOccurred = true;
|
||||
},
|
||||
[&](const parser::OmpClause::Destroy &destroyClause) {
|
||||
const auto &interopVar{
|
||||
@ -5585,7 +5585,7 @@ void OmpStructureChecker::Enter(const parser::OpenMPInteropConstruct &x) {
|
||||
context_.Say(GetContext().directiveSource,
|
||||
"Each interop-type may be specified at most once."_err_en_US);
|
||||
}
|
||||
if (isDependClauseOccured && !targetSyncCount) {
|
||||
if (isDependClauseOccurred && !targetSyncCount) {
|
||||
context_.Say(GetContext().directiveSource,
|
||||
"A DEPEND clause can only appear on the directive if the interop-type includes TARGETSYNC"_err_en_US);
|
||||
}
|
||||
|
||||
@ -160,7 +160,7 @@ LIBC_INLINE static void handle_printf(rpc::Server::Port &port,
|
||||
uint64_t args_sizes[num_lanes] = {0};
|
||||
void *args[num_lanes] = {nullptr};
|
||||
|
||||
// Recieve the format string and arguments from the client.
|
||||
// Receive the format string and arguments from the client.
|
||||
port.recv_n(format, format_sizes,
|
||||
[&](uint64_t size) { return temp_storage.alloc(size); });
|
||||
|
||||
@ -223,7 +223,7 @@ LIBC_INLINE static void handle_printf(rpc::Server::Port &port,
|
||||
buffer_size[lane] = writer.get_chars_written();
|
||||
}
|
||||
|
||||
// Recieve any strings from the client and push them into a buffer.
|
||||
// Receive any strings from the client and push them into a buffer.
|
||||
TempVector<void *> copied_strs[num_lanes];
|
||||
auto HasPendingCopies = [](TempVector<void *> v[num_lanes]) {
|
||||
for (uint32_t i = 0; i < num_lanes; ++i)
|
||||
|
||||
@ -35,7 +35,7 @@ using namespace fputil;
|
||||
// > P = fpminimax(x^(-2/3), 7, [|D...|], [1, 2]);
|
||||
// > dirtyinfnorm(P/x^(-2/3) - 1, [1, 2]);
|
||||
// 0x1.28...p-21
|
||||
LIBC_INLINE static double intial_approximation(double x) {
|
||||
LIBC_INLINE static double initial_approximation(double x) {
|
||||
constexpr double COEFFS[8] = {
|
||||
0x1.bc52aedead5c6p1, -0x1.b52bfebf110b3p2, 0x1.1d8d71d53d126p3,
|
||||
-0x1.de2db9e81cf87p2, 0x1.0154ca06153bdp2, -0x1.5973c66ee6da7p0,
|
||||
@ -194,7 +194,7 @@ LIBC_INLINE static constexpr double cbrt(double x) {
|
||||
double a = FPBits(a_bits).get_val();
|
||||
|
||||
// Initial approximation of x_r^(-2/3).
|
||||
double p = intial_approximation(x_r);
|
||||
double p = initial_approximation(x_r);
|
||||
|
||||
// Look up for 2^(-2*n/3) used for first approximation step.
|
||||
constexpr double EXP2_M2_OVER_3[3] = {1.0, 0x1.428a2f98d728bp-1,
|
||||
|
||||
@ -124,7 +124,7 @@ eisel_lemire(ExpandedFloat<T> init_num,
|
||||
// Wider Approximation
|
||||
UInt128 final_approx;
|
||||
// The halfway constant is used to check if the bits that will be shifted away
|
||||
// intially are all 1. For doubles this is 64 (bitstype size) - 52 (final
|
||||
// initially are all 1. For doubles this is 64 (bitstype size) - 52 (final
|
||||
// mantissa size) - 3 (we shift away the last two bits separately for
|
||||
// accuracy, and the most significant bit is ignored.) = 9 bits. Similarly,
|
||||
// it's 6 bits for floats in this case.
|
||||
@ -262,7 +262,7 @@ eisel_lemire<long double>(ExpandedFloat<long double> init_num,
|
||||
(final_approx_lower < approx_lower ? 1 : 0);
|
||||
|
||||
// The halfway constant is used to check if the bits that will be shifted away
|
||||
// intially are all 1. For 80 bit floats this is 128 (bitstype size) - 64
|
||||
// initially are all 1. For 80 bit floats this is 128 (bitstype size) - 64
|
||||
// (final mantissa size) - 3 (we shift away the last two bits separately for
|
||||
// accuracy, and the most significant bit is ignored.) = 61 bits. Similarly,
|
||||
// it's 12 bits for 128 bit floats in this case.
|
||||
|
||||
@ -44,7 +44,7 @@ LLVM_LIBC_FUNCTION(char *, fgets,
|
||||
bool has_eof = stream->iseof_unlocked();
|
||||
stream->unlock();
|
||||
|
||||
// If the requested read size makes no sense, an error occured, or no bytes
|
||||
// If the requested read size makes no sense, an error occurred, or no bytes
|
||||
// were read due to an EOF, then return nullptr and don't write the null byte.
|
||||
if (has_error || (i == 0 && has_eof))
|
||||
return nullptr;
|
||||
|
||||
@ -24,7 +24,7 @@ LLVM_LIBC_FUNCTION(int, strfroml,
|
||||
internal::parse_format_string(format, fp);
|
||||
|
||||
// To ensure that the conversion function actually uses long double,
|
||||
// the length modifier has to be set to LenghtModifier::L
|
||||
// the length modifier has to be set to LengthModifier::L
|
||||
section.length_modifier = printf_core::LengthModifier::L;
|
||||
|
||||
printf_core::DropOverflowBuffer wb(s, (n > 0 ? n - 1 : 0));
|
||||
|
||||
@ -12,7 +12,7 @@
|
||||
|
||||
using namespace LIBC_NAMESPACE;
|
||||
|
||||
// Test to ensure that we can use aribtrary combinations of sends and recieves
|
||||
// Test to ensure that we can use arbitrary combinations of sends and receives
|
||||
// as long as they are mirrored.
|
||||
static void test_interface(bool end_with_send) {
|
||||
uint64_t cnt = 0;
|
||||
|
||||
@ -2025,7 +2025,7 @@ the symbol can now be resolved.
|
||||
If the debug server has requested all the symbols it wants, the final response
|
||||
will be `OK` (whether they were all found or not).
|
||||
|
||||
If LLDB did find all the symbols and recieves an `OK` it does not need to send
|
||||
If LLDB did find all the symbols and receives an `OK` it does not need to send
|
||||
`qSymbol::` again during the debug session.
|
||||
|
||||
**Priority To Implement:** Low, this is rarely used.
|
||||
|
||||
@ -146,7 +146,7 @@ Without Bridge Networking
|
||||
Without bridge networking you will have to forward individual ports from the VM
|
||||
to the host (refer to QEMU's manuals for the specific options).
|
||||
|
||||
* At least one to connect to the intial ``lldb-server``.
|
||||
* At least one to connect to the initial ``lldb-server``.
|
||||
* One more if you want to use ``lldb-server`` in ``platform mode``, and have it
|
||||
start a ``gdbserver`` instance for you.
|
||||
|
||||
|
||||
@ -258,7 +258,7 @@ public:
|
||||
/// thread.
|
||||
///
|
||||
/// \return
|
||||
/// \b true if there was a command in progress to recieve the interrupt.
|
||||
/// \b true if there was a command in progress to receive the interrupt.
|
||||
/// \b false if there's no command currently in flight.
|
||||
bool InterruptCommand();
|
||||
|
||||
|
||||
@ -925,7 +925,7 @@ public:
|
||||
/// A structured data dictionary containing at each entry, the crash
|
||||
/// information type as the entry key and the matching an array as the
|
||||
/// entry value. \b nullptr if not implemented or if the process has no
|
||||
/// crash information entry. \b error if an error occured.
|
||||
/// crash information entry. \b error if an error occurred.
|
||||
virtual llvm::Expected<StructuredData::DictionarySP>
|
||||
FetchExtendedCrashInformation(lldb_private::Process &process) {
|
||||
return nullptr;
|
||||
|
||||
@ -412,7 +412,7 @@ private:
|
||||
/// stored within that section.
|
||||
///
|
||||
/// \returns either the decompressed object file stored within the
|
||||
/// .gnu_debugdata section or \c nullptr if an error occured or if there's no
|
||||
/// .gnu_debugdata section or \c nullptr if an error occurred or if there's no
|
||||
/// section with that name.
|
||||
std::shared_ptr<ObjectFileELF> GetGnuDebugDataObjectFile();
|
||||
|
||||
@ -424,7 +424,7 @@ private:
|
||||
/// found.
|
||||
///
|
||||
/// \return The bytes that represent the string table data or \c std::nullopt
|
||||
/// if an error occured.
|
||||
/// if an error occurred.
|
||||
std::optional<lldb_private::DataExtractor> GetDynamicData();
|
||||
|
||||
/// Get the bytes that represent the dynamic string table data.
|
||||
@ -435,7 +435,7 @@ private:
|
||||
/// DT_STRSZ .dynamic entries.
|
||||
///
|
||||
/// \return The bytes that represent the string table data or \c std::nullopt
|
||||
/// if an error occured.
|
||||
/// if an error occurred.
|
||||
std::optional<lldb_private::DataExtractor> GetDynstrData();
|
||||
|
||||
/// Read the bytes pointed to by the \a dyn dynamic entry.
|
||||
@ -453,7 +453,7 @@ private:
|
||||
/// before reading data.
|
||||
///
|
||||
/// \return The bytes that represent the dynanic entries data or
|
||||
/// \c std::nullopt if an error occured or the data is not available.
|
||||
/// \c std::nullopt if an error occurred or the data is not available.
|
||||
std::optional<lldb_private::DataExtractor>
|
||||
ReadDataFromDynamic(const elf::ELFDynamic *dyn, uint64_t length,
|
||||
uint64_t offset = 0);
|
||||
@ -468,7 +468,7 @@ private:
|
||||
///
|
||||
/// \return The bytes that represent the symbol table data from the .dynamic
|
||||
/// section or section headers or \c std::nullopt if an error
|
||||
/// occured or if there is no dynamic symbol data available.
|
||||
/// occurred or if there is no dynamic symbol data available.
|
||||
std::optional<lldb_private::DataExtractor>
|
||||
GetDynsymDataFromDynamic(uint32_t &num_symbols);
|
||||
|
||||
|
||||
@ -4513,7 +4513,7 @@ static FieldEnum::Enumerators ParseEnumEvalues(const XMLNode &enum_node) {
|
||||
Log *log(GetLog(GDBRLog::Process));
|
||||
// We will use the last instance of each value. Also we preserve the order
|
||||
// of declaration in the XML, as it may not be numerical.
|
||||
// For example, hardware may intially release with two states that softwware
|
||||
// For example, hardware may initially release with two states that software
|
||||
// can read from a register field:
|
||||
// 0 = startup, 1 = running
|
||||
// If in a future hardware release, the designers added a pre-startup state:
|
||||
|
||||
@ -151,7 +151,7 @@ TraceHTR::TraceHTR(Thread &thread, TraceCursor &cursor)
|
||||
};
|
||||
|
||||
while (cursor.HasValue()) { if (cursor.IsError()) {
|
||||
// Append a load address of 0 for all instructions that an error occured
|
||||
// Append a load address of 0 for all instructions that an error occurred
|
||||
// while decoding.
|
||||
// TODO: Make distinction between errors by storing the error messages.
|
||||
// Currently, all errors are treated the same.
|
||||
|
||||
@ -264,7 +264,7 @@ public:
|
||||
HTRBlock const *GetBlockById(size_t block_id) const;
|
||||
|
||||
/// Get the block ID trace for this layer.
|
||||
/// This block ID trace stores the block ID of each block that occured in the
|
||||
/// This block ID trace stores the block ID of each block that occurred in the
|
||||
/// trace and the block defs map maps block ID to the corresponding \a
|
||||
/// HTRBlock.
|
||||
///
|
||||
|
||||
@ -270,7 +270,7 @@ llvm::Expected<lldb::ValueObjectSP> Interpreter::Evaluate(const ASTNode &node) {
|
||||
return llvm::make_error<DILDiagnosticError>(m_expr, "invalid value object",
|
||||
node.GetLocation());
|
||||
// Return the computed value-or-error. The caller is responsible for
|
||||
// checking if an error occured during the evaluation.
|
||||
// checking if an error occurred during the evaluation.
|
||||
return value_or_error;
|
||||
}
|
||||
|
||||
|
||||
@ -154,7 +154,7 @@ class AArch64LinuxMTEMemoryTagCoreFileTestCase(TestBase):
|
||||
],
|
||||
)
|
||||
|
||||
# For the intial alignment of start/end to granule boundaries the tag manager
|
||||
# For the initial alignment of start/end to granule boundaries the tag manager
|
||||
# is used, so this reads 1 tag as it would normally.
|
||||
self.expect(
|
||||
"memory tag read {addr} {addr}+1".format(addr=self.MTE_BUF_ADDR),
|
||||
|
||||
@ -277,7 +277,7 @@ class AArch64LinuxMTEMemoryTagAccessTestCase(TestBase):
|
||||
)
|
||||
|
||||
# You may write up to the end of a tagged region
|
||||
# (mte_buf_2's intial tags will all be 0)
|
||||
# (mte_buf_2's initial tags will all be 0)
|
||||
self.expect("memory tag write mte_buf_2+page_size-16 0xe")
|
||||
self.expect(
|
||||
"memory tag read mte_buf_2+page_size-16 mte_buf_2+page_size",
|
||||
@ -416,7 +416,7 @@ class AArch64LinuxMTEMemoryTagAccessTestCase(TestBase):
|
||||
)
|
||||
|
||||
# If we do the same with a misaligned end, it also moves but upward.
|
||||
# The intial range is 2 granules but the final range is mte_buf_2 -> mte_buf_2+48
|
||||
# The initial range is 2 granules but the final range is mte_buf_2 -> mte_buf_2+48
|
||||
self.expect("memory tag write mte_buf_2+8 3 -end-addr mte_buf_2+32+8")
|
||||
self.expect(
|
||||
"memory tag read mte_buf_2 mte_buf_2+64",
|
||||
|
||||
@ -16,7 +16,7 @@ class TestdSYMModuleInit(TestBase):
|
||||
@no_debug_info_test
|
||||
def test_add_module(self):
|
||||
"""This loads a file into a target and ensures that the python module was
|
||||
correctly added and the two intialization functions are called."""
|
||||
correctly added and the two initialization functions are called."""
|
||||
self.exe_name = "has_dsym"
|
||||
self.py_name = self.exe_name + ".py"
|
||||
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
// This tests a crash which occured under very specific circumstances. The
|
||||
// This tests a crash which occurred under very specific circumstances. The
|
||||
// interesting aspects of this test are:
|
||||
// - we print a global variable from one compile unit
|
||||
// - we are stopped in a member function of a class in a namespace
|
||||
|
||||
@ -504,7 +504,7 @@ TEST_F(StreamTest, PutRawBytesToMixedEndian) {
|
||||
#endif
|
||||
}
|
||||
|
||||
TEST_F(StreamTest, PutRawBytesZeroLenght) {
|
||||
TEST_F(StreamTest, PutRawBytesZeroLength) {
|
||||
uint32_t value = 0x12345678;
|
||||
|
||||
s.PutRawBytes(static_cast<void *>(&value), 0, hostByteOrder,
|
||||
@ -516,7 +516,7 @@ TEST_F(StreamTest, PutRawBytesZeroLenght) {
|
||||
EXPECT_EQ(0U, s.GetWrittenBytes());
|
||||
}
|
||||
|
||||
TEST_F(StreamTest, PutBytesAsRawHex8ZeroLenght) {
|
||||
TEST_F(StreamTest, PutBytesAsRawHex8ZeroLength) {
|
||||
uint32_t value = 0x12345678;
|
||||
|
||||
s.PutBytesAsRawHex8(static_cast<void *>(&value), 0, hostByteOrder,
|
||||
|
||||
@ -4012,7 +4012,7 @@ public:
|
||||
|
||||
/// Returns whether this object currently represents the IR of a loop. If
|
||||
/// returning false, it may have been consumed by a loop transformation or not
|
||||
/// been intialized. Do not use in this case;
|
||||
/// been initialized. Do not use in this case;
|
||||
bool isValid() const { return Header; }
|
||||
|
||||
/// The preheader ensures that there is only a single edge entering the loop.
|
||||
|
||||
@ -126,7 +126,7 @@ inline unsigned encodeULEB128(uint64_t Value, uint8_t *p,
|
||||
/// Utility function to decode a ULEB128 value.
|
||||
///
|
||||
/// If \p error is non-null, it will point to a static error message,
|
||||
/// if an error occured. It will not be modified on success.
|
||||
/// if an error occurred. It will not be modified on success.
|
||||
inline uint64_t decodeULEB128(const uint8_t *p, unsigned *n = nullptr,
|
||||
const uint8_t *end = nullptr,
|
||||
const char **error = nullptr) {
|
||||
@ -160,7 +160,7 @@ inline uint64_t decodeULEB128(const uint8_t *p, unsigned *n = nullptr,
|
||||
/// Utility function to decode a SLEB128 value.
|
||||
///
|
||||
/// If \p error is non-null, it will point to a static error message,
|
||||
/// if an error occured. It will not be modified on success.
|
||||
/// if an error occurred. It will not be modified on success.
|
||||
inline int64_t decodeSLEB128(const uint8_t *p, unsigned *n = nullptr,
|
||||
const uint8_t *end = nullptr,
|
||||
const char **error = nullptr) {
|
||||
|
||||
@ -93,7 +93,7 @@ public:
|
||||
/// Accepts an incoming connection on the listening socket. This method can
|
||||
/// optionally either block until a connection is available or timeout after a
|
||||
/// specified amount of time has passed. By default the method will block
|
||||
/// until the socket has recieved a connection. If the accept timesout this
|
||||
/// until the socket has received a connection. If the accept timesout this
|
||||
/// method will return std::errc:timed_out
|
||||
///
|
||||
/// \param Timeout An optional timeout duration in milliseconds. Setting
|
||||
|
||||
@ -357,7 +357,7 @@ void RegPressureTracker::closeRegion() {
|
||||
/// can never drop below this pressure.
|
||||
void RegPressureTracker::initLiveThru(const RegPressureTracker &RPTracker) {
|
||||
LiveThruPressure.assign(TRI->getNumRegPressureSets(), 0);
|
||||
assert(isBottomClosed() && "need bottom-up tracking to intialize.");
|
||||
assert(isBottomClosed() && "need bottom-up tracking to initialize.");
|
||||
for (const VRegMaskOrUnit &Pair : P.LiveOutRegs) {
|
||||
VirtRegOrUnit VRegOrUnit = Pair.VRegOrUnit;
|
||||
if (VRegOrUnit.isVirtualReg() &&
|
||||
|
||||
@ -101,7 +101,7 @@ void fixupIndexV4(DWARFContext &C, DWARFUnitIndex &Index) {
|
||||
Header.getOffset()}});
|
||||
if (!Iter.second) {
|
||||
logAllUnhandledErrors(
|
||||
createError("Collision occured between for truncated offset 0x" +
|
||||
createError("Collision occurred between for truncated offset 0x" +
|
||||
Twine::utohexstr(TruncOffset)),
|
||||
errs());
|
||||
Map.clear();
|
||||
|
||||
@ -8320,7 +8320,7 @@ static Expected<Function *> createOutlinedFunction(
|
||||
// multiple mappings (technically not legal in OpenMP, but there is a case
|
||||
// in Fortran for Common Blocks where this is neccesary), we will end up
|
||||
// with GEP's into this array inside the kernel, that refer to the Global
|
||||
// but are technically seperate arguments to the kernel for all intents and
|
||||
// but are technically separate arguments to the kernel for all intents and
|
||||
// purposes. If we have mapped a segment that requires a GEP into the 0-th
|
||||
// index, it will fold into an referal to the Global, if we then encounter
|
||||
// this folded GEP during replacement all of the references to the
|
||||
@ -8328,7 +8328,7 @@ static Expected<Function *> createOutlinedFunction(
|
||||
// that corresponds to it, including any other GEP's that refer to the
|
||||
// Global that may be other arguments. This will invalidate all of the other
|
||||
// preceding mapped arguments that refer to the same global that may be
|
||||
// seperate segments. To prevent this, we defer global processing until all
|
||||
// separate segments. To prevent this, we defer global processing until all
|
||||
// other processing has been performed.
|
||||
if (llvm::isa<llvm::GlobalValue, llvm::GlobalObject, llvm::GlobalVariable>(
|
||||
removeASCastIfPresent(Input))) {
|
||||
|
||||
@ -177,7 +177,7 @@ TextEncodingConverterICU::convertString(StringRef Source,
|
||||
return std::error_code(E2BIG, std::generic_category());
|
||||
}
|
||||
}
|
||||
// Some other error occured.
|
||||
// Some other error occurred.
|
||||
Result.resize(Output - Result.data());
|
||||
return std::error_code(EILSEQ, std::generic_category());
|
||||
}
|
||||
@ -249,14 +249,14 @@ TextEncodingConverterIconv::convertString(StringRef Source,
|
||||
auto HandleError = [&Capacity, &Output, &OutputLength, &Result,
|
||||
this](size_t Ret) {
|
||||
if (Ret == static_cast<size_t>(-1)) {
|
||||
// An error occured. Check if we can gracefully handle it.
|
||||
// An error occurred. Check if we can gracefully handle it.
|
||||
if (errno == E2BIG && Capacity < Result.max_size()) {
|
||||
HandleOverflow(Capacity, Output, OutputLength, Result);
|
||||
// Reset converter
|
||||
reset();
|
||||
return std::error_code();
|
||||
} else {
|
||||
// Some other error occured.
|
||||
// Some other error occurred.
|
||||
Result.resize(Output - Result.data());
|
||||
return std::error_code(errno, std::generic_category());
|
||||
}
|
||||
|
||||
@ -367,10 +367,10 @@ bool AMDGPUPostLegalizerCombinerImpl::matchRemoveFcanonicalize(
|
||||
return TLI->isCanonicalized(Reg, MF);
|
||||
}
|
||||
|
||||
// The buffer_load_{i8, i16} intrinsics are intially lowered as buffer_load_{u8,
|
||||
// u16} instructions. Here, the buffer_load_{u8, u16} instructions are combined
|
||||
// with sign extension instrucions in order to generate buffer_load_{i8, i16}
|
||||
// instructions.
|
||||
// The buffer_load_{i8, i16} intrinsics are initially lowered as
|
||||
// buffer_load_{u8, u16} instructions. Here, the buffer_load_{u8, u16}
|
||||
// instructions are combined with sign extension instrucions in order to
|
||||
// generate buffer_load_{i8, i16} instructions.
|
||||
|
||||
// Identify buffer_load_{u8, u16}.
|
||||
bool AMDGPUPostLegalizerCombinerImpl::matchCombineSignExtendInReg(
|
||||
|
||||
@ -47,8 +47,8 @@
|
||||
// corresponds to offset, second member corresponds to size of LDS global
|
||||
// being replaced and third represents the total aligned size. It will
|
||||
// have name "llvm.amdgcn.sw.lds.<kernel-name>.md". This global will have
|
||||
// an intializer with static LDS related offsets and sizes initialized.
|
||||
// But for dynamic LDS related entries, offsets will be intialized to
|
||||
// an initializer with static LDS related offsets and sizes initialized.
|
||||
// But for dynamic LDS related entries, offsets will be initialized to
|
||||
// previous static LDS allocation end offset. Sizes for them will be zero
|
||||
// initially. These dynamic LDS offset and size values will be updated
|
||||
// within the kernel, since kernel can read the dynamic LDS size
|
||||
|
||||
@ -220,7 +220,7 @@ class SPIRVEmitIntrinsics
|
||||
// Parameters:
|
||||
// ElementType: the type of the elements stored in the parent array.
|
||||
// Offset: the Value* containing the byte offset into the array.
|
||||
// Return true if an error occured during the walk, false otherwise.
|
||||
// Return true if an error occurred during the walk, false otherwise.
|
||||
bool walkLogicalAccessChain(
|
||||
GetElementPtrInst &GEP,
|
||||
const std::function<void(Type *PointedType, uint64_t Index)>
|
||||
|
||||
@ -3235,7 +3235,7 @@ static SDValue performBitcastCombine(SDNode *N,
|
||||
|
||||
// bitcast <N x i1>(setcc ...) to concat iN, where N = 32 and 64 (illegal)
|
||||
if (NumElts == 32 || NumElts == 64) {
|
||||
// Strategy: We will setcc them seperately in v16i8 -> v16i1
|
||||
// Strategy: We will setcc them separately in v16i8 -> v16i1
|
||||
// Bitcast them to i16, extend them to either i32 or i64.
|
||||
// Add them together, shifting left 1 by 1.
|
||||
SDValue Concat, SetCCVector;
|
||||
|
||||
@ -83,7 +83,7 @@ def LNLPPort00_01_02_03_04_05 : ProcResGroup<[LNLPPort00, LNLPPort01, LNLPPort02
|
||||
// VEC EU has 180 reservation stations.
|
||||
def LNLPVPort00_01_02_03 : ProcResGroup<[LNLPVPort00, LNLPVPort01, LNLPVPort02,
|
||||
LNLPVPort03]>{
|
||||
let BufferSize = 180; // EU for INT and VEC are seperated
|
||||
let BufferSize = 180; // EU for INT and VEC are separated
|
||||
// VEC QUEUE SIZE = 60 + VEC EU RS (60+60)
|
||||
}
|
||||
// STD has 48 reservation stations.
|
||||
|
||||
@ -13251,7 +13251,7 @@ struct AAAddressSpaceCallSiteArgument final : AAAddressSpaceImpl {
|
||||
|
||||
// TODO: this is similar to AAAddressSpace, most of the code should be merged.
|
||||
// But merging it created failing cased on gateway test that cannot be
|
||||
// reproduced locally. So should open a seperated PR to hande the merge of
|
||||
// reproduced locally. So should open a separated PR to handle the merge of
|
||||
// AANoAliasAddrSpace and AAAddressSpace attribute
|
||||
|
||||
namespace {
|
||||
|
||||
@ -2756,7 +2756,7 @@ static bool isReassociableOp(Instruction *I, unsigned IntOpcode,
|
||||
/// A1, A2, ... and C are loop invariants into expressions like
|
||||
/// ((A1 * C * B1) + (A2 * C * B2) + ...) and hoist the (A1 * C), (A2 * C), ...
|
||||
/// invariant expressions. This functions returns true only if any hoisting has
|
||||
/// actually occured.
|
||||
/// actually occurred.
|
||||
static bool hoistMulAddAssociation(Instruction &I, Loop &L,
|
||||
ICFLoopSafetyInfo &SafetyInfo,
|
||||
MemorySSAUpdater &MSSAU, AssumptionCache *AC,
|
||||
|
||||
@ -3181,7 +3181,7 @@ bool LoopIdiomRecognize::recognizeShiftUntilBitTest() {
|
||||
if (auto *I = dyn_cast<Instruction>(NewXNext))
|
||||
I->copyIRFlags(XNext, /*IncludeWrapFlags=*/true);
|
||||
|
||||
// Step 3: Adjust the successor basic block to recieve the computed
|
||||
// Step 3: Adjust the successor basic block to receive the computed
|
||||
// recurrence's final value instead of the recurrence itself.
|
||||
|
||||
XCurr->replaceUsesOutsideBlock(NewX, LoopHeaderBB);
|
||||
@ -3518,7 +3518,7 @@ bool LoopIdiomRecognize::recognizeShiftUntilZero() {
|
||||
CurLoop->getName() + ".tripcount", /*HasNUW=*/true,
|
||||
/*HasNSW=*/Bitwidth != 2);
|
||||
|
||||
// Step 2: Adjust the successor basic block to recieve the original
|
||||
// Step 2: Adjust the successor basic block to receive the original
|
||||
// induction variable's final value instead of the orig. IV itself.
|
||||
|
||||
IV->replaceUsesOutsideBlock(IVFinal, LoopHeaderBB);
|
||||
|
||||
@ -3087,7 +3087,7 @@ static bool isProfitableChain(IVChain &Chain,
|
||||
}
|
||||
assert(!Chain.Incs.empty() && "empty IV chains are not allowed");
|
||||
|
||||
// The chain itself may require a register, so intialize cost to 1.
|
||||
// The chain itself may require a register, so initialize cost to 1.
|
||||
int cost = 1;
|
||||
|
||||
// A complete chain likely eliminates the need for keeping the original IV in
|
||||
|
||||
@ -427,7 +427,7 @@ void IRNormalizer::reorderInstructions(Function &F) const {
|
||||
// Process the remaining instructions.
|
||||
//
|
||||
// TODO: Do more a intelligent sorting of these instructions. For example,
|
||||
// separate between dead instructinos and instructions used in another
|
||||
// separate between dead instructions and instructions used in another
|
||||
// block. Use properties of the CFG the order instructions that are used
|
||||
// in another block.
|
||||
if (Visited.contains(&I))
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
; RUN: llc < %s -aarch64-order-frame-objects=0 | FileCheck %s
|
||||
; Regression test for bug that occured with FP that was not 16-byte aligned.
|
||||
; Regression test for bug that occurred with FP that was not 16-byte aligned.
|
||||
; We would miscalculate the offset for the st2g.
|
||||
|
||||
target datalayout = "e-m:e-i8:8:32-i16:16:32-i64:64-i128:128-n32:64-S128"
|
||||
|
||||
@ -3,7 +3,7 @@
|
||||
|
||||
# Register coalescer is going to eliminate %2:sgpr_32 = COPY %1.sub0 from bb.1
|
||||
# by joining %2 and %1.sub0 into %0.sub0 register. Check that when this happen
|
||||
# the implicit intialization of %0.sub0 in the bb.2 have undef flag
|
||||
# the implicit initialization of %0.sub0 in the bb.2 have undef flag
|
||||
# for the MIR to be valid.
|
||||
|
||||
---
|
||||
|
||||
@ -1,7 +1,7 @@
|
||||
RUN: llvm-dwarfdump -v %p/Inputs/typeunit-header.elf-x86-64 | FileCheck %s
|
||||
|
||||
This is testing a bugfix where parsing the type unit header was not
|
||||
taking the unit's intial length field into account when validating.
|
||||
taking the unit's initial length field into account when validating.
|
||||
|
||||
The input file is hand-coded assembler to generate a type unit stub,
|
||||
which only contains a type unit DIE with a sole visibility attribute.
|
||||
|
||||
@ -240,7 +240,7 @@
|
||||
.quad 4
|
||||
|
||||
// Notice the different section flags here.
|
||||
// This shouldn't overwrite the intial section flags.
|
||||
// This shouldn't overwrite the initial section flags.
|
||||
.pushsection .data4,"dr"; .quad 1
|
||||
.popsection
|
||||
|
||||
|
||||
@ -149,7 +149,7 @@ entry:
|
||||
|
||||
; Note: we don't want this intrinsic to have its argument marked 'returned',
|
||||
; since that breaks the autorelease elision marker optimization when
|
||||
; save/restores of the reciever are introduced between the msg send and the
|
||||
; save/restores of the receiver are introduced between the msg send and the
|
||||
; retain. See issue#69658.
|
||||
define ptr @test_objc_retainAutoreleasedReturnValue(ptr %arg0) {
|
||||
; CHECK-LABEL: test_objc_retainAutoreleasedReturnValue
|
||||
@ -217,7 +217,7 @@ entry:
|
||||
|
||||
; Note: we don't want this intrinsic to have its argument marked 'returned',
|
||||
; since that breaks the autorelease elision marker optimization when
|
||||
; save/restores of the reciever are introduced between the msg send and the
|
||||
; save/restores of the receiver are introduced between the msg send and the
|
||||
; claim. See issue#69658.
|
||||
define ptr @test_objc_unsafeClaimAutoreleasedReturnValue(ptr %arg0) {
|
||||
; CHECK-LABEL: test_objc_unsafeClaimAutoreleasedReturnValue
|
||||
|
||||
@ -29,6 +29,6 @@ int main() {
|
||||
}
|
||||
|
||||
// The empty CU from the pcm should not get copied into the dSYM.
|
||||
// Check that module name occured only once.
|
||||
// Check that module name occurred only once.
|
||||
// CHECK: DW_AT_name ("Empty")
|
||||
// CHECK-NOT: DW_AT_name ("Empty")
|
||||
|
||||
@ -2,7 +2,7 @@
|
||||
# RUN: llvm-mca -mtriple=x86_64-unknown-unknown -mcpu=haswell -timeline -iterations=2 < %s | FileCheck %s
|
||||
|
||||
# PR51495: If the two destination registers are the same, the destination will
|
||||
# contain teh high half of the multiplication result.
|
||||
# contain the high half of the multiplication result.
|
||||
|
||||
# LLVM-MCA-BEGIN
|
||||
mulxl %eax, %eax, %eax
|
||||
|
||||
@ -2,7 +2,7 @@
|
||||
# RUN: llvm-mca -mtriple=x86_64-unknown-unknown -mcpu=skylake -timeline -iterations=2 < %s | FileCheck %s
|
||||
|
||||
# PR51495: If the two destination registers are the same, the destination will
|
||||
# contain teh high half of the multiplication result.
|
||||
# contain the high half of the multiplication result.
|
||||
|
||||
# LLVM-MCA-BEGIN
|
||||
mulxl %eax, %eax, %eax
|
||||
|
||||
@ -2,7 +2,7 @@
|
||||
# RUN: llvm-mca -mtriple=x86_64-unknown-unknown -mcpu=znver3 -timeline -iterations=2 < %s | FileCheck %s
|
||||
|
||||
# PR51495: If the two destination registers are the same, the destination will
|
||||
# contain teh high half of the multiplication result.
|
||||
# contain the high half of the multiplication result.
|
||||
|
||||
# LLVM-MCA-BEGIN
|
||||
mulxl %eax, %eax, %eax
|
||||
|
||||
@ -5,7 +5,7 @@
|
||||
# RUN: env TZ=UTC touch -t 200001020304 %t.o
|
||||
# RUN: rm -f %t.a %t-no-index.a && llvm-ar cqSU %t-no-index.a %t.o
|
||||
|
||||
## Check that the intial listing has real values:
|
||||
## Check that the initial listing has real values:
|
||||
# RUN: env TZ=UTC llvm-ar tv %t-no-index.a | FileCheck %s --check-prefix=REAL-VALUES
|
||||
|
||||
## Check that the -D flag clears the timestamps:
|
||||
|
||||
@ -477,7 +477,7 @@ private:
|
||||
/// these requirements.
|
||||
///
|
||||
/// 1. Querying the state of a lattice anchor prior to visiting that anchor
|
||||
/// results in uninitialized state. Analyses must be aware of unintialized
|
||||
/// results in uninitialized state. Analyses must be aware of uninitialized
|
||||
/// states.
|
||||
/// 2. Analysis states can reach fixpoints, where subsequent updates will never
|
||||
/// trigger a change in the state.
|
||||
|
||||
@ -19,7 +19,7 @@ namespace mlir {
|
||||
/// class since you need to determine safe positions to place alloc and
|
||||
/// deallocs. This alias analysis only finds aliases that might have been
|
||||
/// created on top of the specified view. To find all aliases, resolve the
|
||||
/// intial alloc/argument value.
|
||||
/// initial alloc/argument value.
|
||||
class BufferViewFlowAnalysis {
|
||||
public:
|
||||
using ValueSetT = SmallPtrSet<Value, 16>;
|
||||
|
||||
@ -439,7 +439,7 @@ def PartialReductionOpInterface :
|
||||
reduction dimension are converted to parallel dimensions with a size
|
||||
less or equal to the tile size. This is meant to be used with
|
||||
`mergeReductions` method which will combine the partial reductions.
|
||||
The method recieves the `offset` and `sizes` for all iteration space
|
||||
The method receives the `offset` and `sizes` for all iteration space
|
||||
dimensions, as well as the iteration number of the tiled reduction
|
||||
dimensions (which is the induction variable of the inter-tile loop
|
||||
for the reduction dimension divided by the step of the loop) in
|
||||
@ -485,7 +485,7 @@ def PartialReductionOpInterface :
|
||||
the tiled operation. This is same as
|
||||
TilingInterface:::getResultTilePosition, but determines the result
|
||||
tile position for partial reduction.
|
||||
The method recieves the `offset` and `sizes` for all iteration space
|
||||
The method receives the `offset` and `sizes` for all iteration space
|
||||
dimensions, as well as the iteration number of the tiled reduction
|
||||
dimensions (which is the induction variable of the inter-tile loop
|
||||
for the reduction dimension divided by the tile size specified) in
|
||||
|
||||
@ -221,7 +221,7 @@ LogicalResult arith::ConstantOp::verify() {
|
||||
// However, this would most likely require updating the lowerings to LLVM.
|
||||
if (isa<ScalableVectorType>(type) && !isa<SplatElementsAttr>(getValue()))
|
||||
return emitOpError(
|
||||
"intializing scalable vectors with elements attribute is not supported"
|
||||
"initializing scalable vectors with elements attribute is not supported"
|
||||
" unless it's a vector splat");
|
||||
return success();
|
||||
}
|
||||
|
||||
@ -267,7 +267,7 @@ DimLvlMapParser::parseLvlVarBinding(bool requireLvlVarBinding) {
|
||||
// since the thing we're parsing is supposed to be a variable *binding*
|
||||
// rather than a variable *use*. However, the call to `VarEnv::bindVar`
|
||||
// (and its corresponding call to `DimLvlMapParser::recordVarBinding`)
|
||||
// already occured in `parseLvlVarBindingList`, and therefore we must
|
||||
// already occurred in `parseLvlVarBindingList`, and therefore we must
|
||||
// use `parseVarUsage` here in order to operationally do the right thing.
|
||||
const auto varID = parseVarUsage(VarKind::Level, /*requireKnown=*/true);
|
||||
FAILURE_IF_FAILED(varID)
|
||||
|
||||
@ -2143,7 +2143,7 @@ pushCancelFinalizationCB(SmallVectorImpl<llvm::BranchInst *> &cancelTerminators,
|
||||
auto finiCB = [&](llvm::OpenMPIRBuilder::InsertPointTy ip) -> llvm::Error {
|
||||
llvm::IRBuilderBase::InsertPointGuard guard(llvmBuilder);
|
||||
|
||||
// ip is currently in the block branched to if cancellation occured.
|
||||
// ip is currently in the block branched to if cancellation occurred.
|
||||
// We need to create a branch to terminate that block.
|
||||
llvmBuilder.restoreIP(ip);
|
||||
|
||||
|
||||
@ -74,7 +74,7 @@ func.func @constant_out_of_range() {
|
||||
|
||||
func.func @constant_invalid_scalable_1d_vec_initialization() {
|
||||
^bb0:
|
||||
// expected-error@+1 {{'arith.constant' op intializing scalable vectors with elements attribute is not supported unless it's a vector splat}}
|
||||
// expected-error@+1 {{'arith.constant' op initializing scalable vectors with elements attribute is not supported unless it's a vector splat}}
|
||||
%c = arith.constant dense<[0, 1]> : vector<[2] x i32>
|
||||
return
|
||||
}
|
||||
@ -83,7 +83,7 @@ func.func @constant_invalid_scalable_1d_vec_initialization() {
|
||||
|
||||
func.func @constant_invalid_scalable_2d_vec_initialization() {
|
||||
^bb0:
|
||||
// expected-error@+1 {{'arith.constant' op intializing scalable vectors with elements attribute is not supported unless it's a vector splat}}
|
||||
// expected-error@+1 {{'arith.constant' op initializing scalable vectors with elements attribute is not supported unless it's a vector splat}}
|
||||
%c = arith.constant dense<[[3, 3], [1, 1]]> : vector<2 x [2] x i32>
|
||||
return
|
||||
}
|
||||
|
||||
@ -32,7 +32,7 @@ public:
|
||||
os << "none";
|
||||
}
|
||||
|
||||
/// Join the state with another. If either is unintialized, take the
|
||||
/// Join the state with another. If either is uninitialized, take the
|
||||
/// initialized value. Otherwise, XOR the integer values.
|
||||
ChangeResult join(const FooState &rhs) {
|
||||
if (rhs.isUninitialized())
|
||||
|
||||
@ -867,7 +867,7 @@ static PyObject *get_thread_handle(PyObject *self, PyObject *args) {
|
||||
return Py_BuildValue("i", -1);
|
||||
} else if (retVal != ompd_rc_ok) {
|
||||
_printf(
|
||||
"An error occured when calling ompd_get_thread_handle! Error code: %d",
|
||||
"An error occurred when calling ompd_get_thread_handle! Error code: %d",
|
||||
retVal);
|
||||
return Py_BuildValue("l", retVal);
|
||||
}
|
||||
@ -1365,7 +1365,7 @@ static PyObject *call_ompd_get_tool_data(PyObject *self, PyObject *args) {
|
||||
(ompd_task_handle_t *)(PyCapsule_GetPointer(handlePy, "TaskHandle"));
|
||||
handle = taskHandle;
|
||||
} else {
|
||||
_printf("An error occured when calling ompd_get_tool_data! Scope type not "
|
||||
_printf("An error occurred when calling ompd_get_tool_data! Scope type not "
|
||||
"supported.");
|
||||
return Py_None;
|
||||
}
|
||||
@ -1376,7 +1376,7 @@ static PyObject *call_ompd_get_tool_data(PyObject *self, PyObject *args) {
|
||||
ompd_rc_t retVal = ompd_get_tool_data(handle, scope, &value, &ptr);
|
||||
|
||||
if (retVal != ompd_rc_ok) {
|
||||
_printf("An error occured when calling ompd_get_tool_data! Error code: %d",
|
||||
_printf("An error occurred when calling ompd_get_tool_data! Error code: %d",
|
||||
retVal);
|
||||
return Py_None;
|
||||
}
|
||||
|
||||
@ -6747,7 +6747,7 @@ void __kmp_register_library_startup(void) {
|
||||
}
|
||||
}
|
||||
if (__kmp_shm_available && shm_preexist == 0) { // SHM created, set size
|
||||
if (ftruncate(fd1, SHM_SIZE) == -1) { // error occured setting size;
|
||||
if (ftruncate(fd1, SHM_SIZE) == -1) { // error occurred setting size;
|
||||
KMP_WARNING(FunctionError, "Can't set size of SHM");
|
||||
__kmp_shm_available = false;
|
||||
}
|
||||
@ -6796,7 +6796,7 @@ void __kmp_register_library_startup(void) {
|
||||
}
|
||||
if (__kmp_tmp_available && tmp_preexist == 0) {
|
||||
// we created /tmp file now set size
|
||||
if (ftruncate(fd1, SHM_SIZE) == -1) { // error occured setting size;
|
||||
if (ftruncate(fd1, SHM_SIZE) == -1) { // error occurred setting size;
|
||||
KMP_WARNING(FunctionError, "Can't set size of /tmp file");
|
||||
__kmp_tmp_available = false;
|
||||
}
|
||||
|
||||
@ -85,7 +85,7 @@ static int test_mem_space(void) {
|
||||
// * omp_get_devices_memspace
|
||||
// * omp_get_devices_and_host_memspace
|
||||
// Test if runtime returns the same memory space handle for the same input.
|
||||
// Test if we can use the memory space to intialize allocator.
|
||||
// Test if we can use the memory space to initialize allocator.
|
||||
for (i = 0; i < num_devices; i++) {
|
||||
ms1 = omp_get_device_memspace(i, predef);
|
||||
CHECK_OR_RET_FAIL(ms1 != omp_null_mem_space);
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user