mirror of
https://github.com/capstone-engine/capstone.git
synced 2025-02-17 04:49:46 +00:00
fix typos (#2387)
This commit is contained in:
parent
1adc45f265
commit
33f24cd074
@ -27,16 +27,16 @@ project(capstone
|
||||
|
||||
set(UNIX_COMPILER_OPTIONS -Werror -Wall -Warray-bounds -Wshift-negative-value -Wreturn-type -Wformat -Wmissing-braces -Wunused-function -Warray-bounds -Wunused-variable -Wparentheses -Wint-in-bool-context -Wmisleading-indentation)
|
||||
|
||||
# maybe-unitialzied is only supported by newer versions of GCC.
|
||||
# maybe-uninitialized is only supported by newer versions of GCC.
|
||||
# Unfortunately, it is pretty unreliable and reports wrong results.
|
||||
# So we disable it for all compilers versions which support it.
|
||||
include(CheckCCompilerFlag)
|
||||
check_c_compiler_flag("-Wno-maybe-unitialized" SUPPORTS_MU)
|
||||
check_c_compiler_flag("-Wno-maybe-uninitialized" SUPPORTS_MU)
|
||||
check_c_compiler_flag("-Wshadow=local" SUPPORTS_SHADOWING)
|
||||
check_c_compiler_flag("-Wsometimes-uninitialized" SUPPORTS_SUNINIT)
|
||||
|
||||
if (SUPPORTS_MU)
|
||||
set(UNIX_COMPILER_OPTIONS ${UNIX_COMPILER_OPTIONS} -Wno-maybe-unitialized)
|
||||
set(UNIX_COMPILER_OPTIONS ${UNIX_COMPILER_OPTIONS} -Wno-maybe-uninitialized)
|
||||
endif()
|
||||
|
||||
if (SUPPORTS_SHADOWING)
|
||||
|
@ -771,7 +771,7 @@ Version 3.0.1: February 03rd, 2015
|
||||
the enumeration of disassembled instructions.
|
||||
- Fix a NULL memory access issue when SKIPDATA & Detail modes are enable
|
||||
at the same time.
|
||||
- Fix a memory leaking bug when when we stop enumeration over the disassembled
|
||||
- Fix a memory leaking bug when we stop enumeration over the disassembled
|
||||
instructions prematurely.
|
||||
- Export generic operand types & groups (CS_OP_xxx & CS_GRP_xxx).
|
||||
|
||||
|
@ -6409,7 +6409,7 @@ static DecodeStatus DecoderForMRRC2AndMCRR2(MCInst *Inst, unsigned Val,
|
||||
// We have to check if the instruction is MRRC2
|
||||
// or MCRR2 when constructing the operands for
|
||||
// Inst. Reason is because MRRC2 stores to two
|
||||
// registers so it's tablegen desc has has two
|
||||
// registers so its tablegen desc has two
|
||||
// outputs whereas MCRR doesn't store to any
|
||||
// registers so all of its operands are listed
|
||||
// as inputs, therefore the operand order for
|
||||
|
@ -53,7 +53,7 @@ void SH_get_insn_id(cs_struct* h, cs_insn* insn, unsigned int id)
|
||||
|
||||
#ifndef CAPSTONE_DIET
|
||||
static const char* const s_insn_names[] = {
|
||||
"unknwon",
|
||||
"unknown",
|
||||
"add", "add", "addc", "addv", "and",
|
||||
"band", "bandnot", "bclr",
|
||||
"bf", "bf/s", "bld", "bldnot", "bor", "bornot", "bra", "braf",
|
||||
|
@ -115,8 +115,8 @@ typedef enum ppc_pred {
|
||||
|
||||
/// CR field indices and their meaning.
|
||||
typedef enum {
|
||||
PPC_BI_LT = 0, ///< CR bit Less Then
|
||||
PPC_BI_GT = 1, ///< CR bit Greater Then
|
||||
PPC_BI_LT = 0, ///< CR bit Less Than
|
||||
PPC_BI_GT = 1, ///< CR bit Greater Than
|
||||
PPC_BI_Z = 2, ///< CR bit Zero
|
||||
PPC_BI_SO = 3, ///< CR bit Summary Overflow
|
||||
PPC_BI_INVALID = 0xff, ///< CR bit was not set/invalid
|
||||
|
@ -118,7 +118,7 @@ make check LD_LIBRARY_PATH="`pwd`"
|
||||
%doc LICENSE.TXT LICENSE_LLVM.TXT
|
||||
%else
|
||||
%license LICENSE.TXT LICENSE_LLVM.TXT
|
||||
%endif # %license workarond for RHEL<7
|
||||
%endif # %license workaround for RHEL<7
|
||||
%doc README ChangeLog
|
||||
%{_libdir}/*.so.*
|
||||
|
||||
|
@ -41,7 +41,7 @@ public:
|
||||
|
||||
// Since we don't know ahead of time how many instructions we're going to add
|
||||
// to the worklist, and migrating densemap's elements is quite expensive
|
||||
// everytime we resize, only insert to the smallvector (typically during the
|
||||
// every time we resize, only insert to the smallvector (typically during the
|
||||
// initial phase of populating lists). Before the worklist can be used,
|
||||
// finalize should be called. Also assert with NDEBUG if list is ever used
|
||||
// without finalizing. Note that unlike insert, we won't check for duplicates
|
||||
|
@ -474,7 +474,7 @@ protected:
|
||||
/// Named operands that predicate with 'let PredicateCodeUsesOperands = 1'
|
||||
/// referenced in its argument list. Operands are inserted at index set by
|
||||
/// emitter, it corresponds to the order in which names appear in argument
|
||||
/// list. Currently such predicates don't have more then 3 arguments.
|
||||
/// list. Currently such predicates don't have more than 3 arguments.
|
||||
std::array<const MachineOperand *, 3> RecordedOperands;
|
||||
|
||||
MatcherState(unsigned MaxRenderers);
|
||||
|
@ -175,7 +175,7 @@ class TargetRegisterInfo;
|
||||
return getKind() == Order && Contents.OrdKind == Barrier;
|
||||
}
|
||||
|
||||
/// Tests if this is could be any kind of memory dependence.
|
||||
/// Tests if this could be any kind of memory dependence.
|
||||
bool isNormalMemoryOrBarrier() const {
|
||||
return (isNormalMemory() || isBarrier());
|
||||
}
|
||||
|
@ -3473,7 +3473,7 @@ public:
|
||||
/// \p AssumeSingleUse When this parameter is true, this function will
|
||||
/// attempt to simplify \p Op even if there are multiple uses.
|
||||
/// Callers are responsible for correctly updating the DAG based on the
|
||||
/// results of this function, because simply replacing replacing TLO.Old
|
||||
/// results of this function, because simply replacing TLO.Old
|
||||
/// with TLO.New will be incorrect when this parameter is true and TLO.Old
|
||||
/// has multiple uses.
|
||||
bool SimplifyDemandedBits(SDValue Op, const APInt &DemandedBits,
|
||||
@ -3531,7 +3531,7 @@ public:
|
||||
/// \p AssumeSingleUse When this parameter is true, this function will
|
||||
/// attempt to simplify \p Op even if there are multiple uses.
|
||||
/// Callers are responsible for correctly updating the DAG based on the
|
||||
/// results of this function, because simply replacing replacing TLO.Old
|
||||
/// results of this function, because simply replacing TLO.Old
|
||||
/// with TLO.New will be incorrect when this parameter is true and TLO.Old
|
||||
/// has multiple uses.
|
||||
bool SimplifyDemandedVectorElts(SDValue Op, const APInt &DemandedEltMask,
|
||||
|
@ -2639,7 +2639,7 @@ public:
|
||||
|
||||
enum SignedOrUnsignedConstant { SignedConstant, UnsignedConstant };
|
||||
/// Determine whether this represents a constant value, if so
|
||||
// return it's sign information.
|
||||
// return its sign information.
|
||||
llvm::Optional<SignedOrUnsignedConstant> isConstant() const;
|
||||
|
||||
/// Return the number of unique location operands referred to (via
|
||||
|
@ -220,7 +220,7 @@ struct CounterMappingRegion {
|
||||
SkippedRegion,
|
||||
|
||||
/// A GapRegion is like a CodeRegion, but its count is only set as the
|
||||
/// line execution count when its the only region in the line.
|
||||
/// line execution count when it's the only region in the line.
|
||||
GapRegion,
|
||||
|
||||
/// A BranchRegion represents leaf-level boolean expressions and is
|
||||
|
@ -87,7 +87,7 @@ public:
|
||||
return Error::success();
|
||||
}
|
||||
|
||||
// Returns true if merging is should fail assuming A and B are incompatible.
|
||||
// Returns true if merging should fail assuming A and B are incompatible.
|
||||
auto testIncompatible = [&](InstrProfKind A, InstrProfKind B) {
|
||||
return (static_cast<bool>(ProfileKind & A) &&
|
||||
static_cast<bool>(Other & B)) ||
|
||||
|
@ -177,7 +177,7 @@ enum class SecCommonFlags : uint32_t {
|
||||
};
|
||||
|
||||
// Section specific flags are defined here.
|
||||
// !!!Note: Everytime a new enum class is created here, please add
|
||||
// !!!Note: Every time a new enum class is created here, please add
|
||||
// a new check in verifySecFlag.
|
||||
enum class SecNameTableFlags : uint32_t {
|
||||
SecFlagInValid = 0,
|
||||
|
Loading…
x
Reference in New Issue
Block a user