mirror of
https://github.com/capstone-engine/capstone.git
synced 2024-11-23 13:39:46 +00:00
chore: remove repetitive words (#2326)
Signed-off-by: careworry <worrycare@outlook.com> chore: remove repetitive words
This commit is contained in:
parent
7746648f0b
commit
16017d5f92
@ -926,7 +926,7 @@ static void add_cs_detail_general(MCInst *MI, aarch64_op_group op_group,
|
||||
break;
|
||||
case AArch64_OP_FP: {
|
||||
// printOperand does not handle FP operands. But sometimes
|
||||
// is is used to print FP operands as normal immediate.
|
||||
// is used to print FP operands as normal immediate.
|
||||
AArch64_get_detail_op(MI, 0)->type = AArch64_OP_IMM;
|
||||
AArch64_get_detail_op(MI, 0)->imm = MCInst_getOpVal(MI, OpNum);
|
||||
AArch64_get_detail_op(MI, 0)->access = map_get_op_access(MI, OpNum);
|
||||
|
@ -209,7 +209,7 @@ static bool read_sdword(const m680x_info *info, int32_t *sdword,
|
||||
return true;
|
||||
}
|
||||
|
||||
// For PAGE2 and PAGE3 opcodes when using an an array of inst_page1 most
|
||||
// For PAGE2 and PAGE3 opcodes when using an array of inst_page1 most
|
||||
// entries have M680X_INS_ILLGL. To avoid wasting memory an inst_pageX is
|
||||
// used which contains the opcode. Using a binary search for the right opcode
|
||||
// is much faster (= O(log n) ) in comparison to a linear search ( = O(n) ).
|
||||
|
@ -781,7 +781,7 @@ public:
|
||||
///
|
||||
/// \pre setBasicBlock or setMI must have been called.
|
||||
/// \pre \p TablePtr must be a generic virtual register with pointer type.
|
||||
/// \pre \p JTI must be be a jump table index.
|
||||
/// \pre \p JTI must be a jump table index.
|
||||
/// \pre \p IndexReg must be a generic virtual register with pointer type.
|
||||
///
|
||||
/// \return a MachineInstrBuilder for the newly created instruction.
|
||||
|
@ -865,7 +865,7 @@ enum NodeType {
|
||||
STRICT_FP_TO_FP16,
|
||||
|
||||
/// Perform various unary floating-point operations inspired by libm. For
|
||||
/// FPOWI, the result is undefined if if the integer operand doesn't fit into
|
||||
/// FPOWI, the result is undefined if the integer operand doesn't fit into
|
||||
/// sizeof(int).
|
||||
FNEG,
|
||||
FABS,
|
||||
|
@ -758,7 +758,7 @@ class TargetRegisterInfo;
|
||||
/// be added from SUnit \p X to SUnit \p Y.
|
||||
void AddPredQueued(SUnit *Y, SUnit *X);
|
||||
|
||||
/// Updates the topological ordering to accommodate an an edge to be
|
||||
/// Updates the topological ordering to accommodate an edge to be
|
||||
/// removed from the specified node \p N from the predecessors of the
|
||||
/// current node \p M.
|
||||
void RemovePred(SUnit *M, SUnit *N);
|
||||
|
@ -3187,7 +3187,7 @@ protected:
|
||||
/// is[Z|FP]ExtFree of the related types is not true.
|
||||
virtual bool isExtFreeImpl(const Instruction *I) const { return false; }
|
||||
|
||||
/// Depth that GatherAllAliases should should continue looking for chain
|
||||
/// Depth that GatherAllAliases should continue looking for chain
|
||||
/// dependencies when trying to find a more preferable chain. As an
|
||||
/// approximation, this should be more than the number of consecutive stores
|
||||
/// expected to be merged.
|
||||
|
@ -1699,7 +1699,7 @@ public:
|
||||
paramHasAttr(ArgNo, Attribute::DereferenceableOrNull);
|
||||
}
|
||||
|
||||
/// Determine if there are is an inalloca argument. Only the last argument can
|
||||
/// Determine if there is an inalloca argument. Only the last argument can
|
||||
/// have the inalloca attribute.
|
||||
bool hasInAllocaArgument() const {
|
||||
return !arg_empty() && paramHasAttr(arg_size() - 1, Attribute::InAlloca);
|
||||
|
@ -424,7 +424,7 @@ protected:
|
||||
SmallVector<Pass *, 16> PassVector;
|
||||
|
||||
// Collection of Analysis provided by Parent pass manager and
|
||||
// used by current pass manager. At at time there can not be more
|
||||
// used by current pass manager. At time there can not be more
|
||||
// then PMT_Last active pass mangers.
|
||||
DenseMap<AnalysisID, Pass *> *InheritedAnalysis[PMT_Last];
|
||||
|
||||
|
@ -52,7 +52,7 @@ struct PassConcept {
|
||||
/// Polymorphic method to access the name of a pass.
|
||||
virtual StringRef name() const = 0;
|
||||
|
||||
/// Polymorphic method to to let a pass optionally exempted from skipping by
|
||||
/// Polymorphic method to let a pass optionally exempted from skipping by
|
||||
/// PassInstrumentation.
|
||||
/// To opt-in, pass should implement `static bool isRequired()`. It's no-op
|
||||
/// to have `isRequired` always return false since that is the default.
|
||||
|
@ -301,7 +301,7 @@ class RegisterClass<string namespace, list<ValueType> regTypes, int alignment,
|
||||
string DiagnosticType = "";
|
||||
|
||||
// A diagnostic message to emit when an invalid value is provided for this
|
||||
// register class when it is being used an an assembly operand. If this is
|
||||
// register class when it is being used an assembly operand. If this is
|
||||
// non-empty, an anonymous diagnostic type enum value will be generated, and
|
||||
// the assembly matcher will provide a function to map from diagnostic types
|
||||
// to message strings.
|
||||
|
Loading…
Reference in New Issue
Block a user