Fix euqal equal (#61009)

Author: co63oc

paddle/cinn/ir/schedule/schedule_desc.h

@@ -31,7 +31,7 @@ namespace ir {
 // records all transform/getting operations executed by a corresponding
 // ir::IRSchedule. A ScheduleDesc can be serialized to JSON format and saved to
 // file. For deserializing, it can be re-applied to a new IRSchedule that is
-// initialzied by a semantics-euqal original ir::ModuleExpr, and then achieves
+// initialzied by a semantics-equal original ir::ModuleExpr, and then achieves
 // the same result.
 
 class IRSchedule;  // forward declartion to avoid cross-reference
@@ -78,7 +78,7 @@ class ScheduleDesc {
 
   /**
    * \brief Replay this description to a new IRSchedule that is initialzied by a
-   * semantics-euqal original ModuleExpr.
+   * semantics-equal original ModuleExpr.
    * @param schedule The original IRSchedule to be replayed the description on.
    * @param without_post_schedule Determine whether to delete the post
    * schedules.

paddle/cinn/ir/test/ir_compare_test.cc

@@ -132,7 +132,7 @@ TEST(TestIrCompare, SingleFunction) {
   ASSERT_TRUE(IRCompare(funcs_1.front(), funcs_2.front()));
   // compare with itself
   ASSERT_TRUE(IRCompare(funcs_1.front(), funcs_1.front()));
-  // they are euqal if allowing suffix of name different
+  // they are equal if allowing suffix of name different
   ASSERT_TRUE(IRCompare(funcs_1.front(), funcs_2.front(), true));
 
   ASSERT_FALSE(IRCompare(funcs_1.front(), funcs_3.front()));

paddle/cinn/ir/test/schedule_desc_test.cc

@@ -105,7 +105,7 @@ std::string SourceCodeGen(const ModuleExpr& module_expr,
                           const std::vector<ir::LoweredFunc>& lowered_funcs,
                           const Target& target) {
   auto exprs = module_expr.GetExprs();
-  CHECK_EQ(exprs.size(), lowered_funcs.size()) << "size of func is not euqal";
+  CHECK_EQ(exprs.size(), lowered_funcs.size()) << "size of func is not equal";
   std::vector<ir::LoweredFunc> updated_funcs =
       ir::ir_utils::IRCopy(lowered_funcs);
   Module::Builder builder("test_module", target);

paddle/cinn/ir/utils/ir_compare.cc

@@ -76,7 +76,7 @@ bool IrEqualVisitor::Compare(const std::string& lhs, const std::string& rhs) {
   }
 
   if (!equal) {
-    VLOG(5) << "Not euqal on name, lhs=" << lhs << ", rhs=" << rhs;
+    VLOG(5) << "Not equal on name, lhs=" << lhs << ", rhs=" << rhs;
   }
 
   return equal;

paddle/cinn/ir/utils/ir_compare.h

@@ -22,15 +22,15 @@ namespace cinn {
 namespace ir {
 namespace ir_utils {
 
-// Determine whether two ir AST trees are euqal by comparing their struct and
+// Determine whether two ir AST trees are equal by comparing their struct and
 // fields of each node through dfs visitor
 class IrEqualVisitor : public IRVisitorRequireReImpl<bool, const Expr*> {
  public:
   explicit IrEqualVisitor(bool allow_name_suffix_diff = false,
                           bool only_compare_structure = false)
       : allow_name_suffix_diff_(allow_name_suffix_diff),
         only_compare_structure_(only_compare_structure) {}
-  // Return true if they are euqal, otherwise false;
+  // Return true if they are equal, otherwise false;
   bool Compare(const Expr& lhs, const Expr& rhs);
 
  private:

paddle/fluid/framework/fleet/ps_gpu_wrapper.cc

@@ -386,7 +386,7 @@ void PSGPUWrapper::PreBuildTask(std::shared_ptr<HeterContext> gpu_task,
             for (size_t i = 0; i < keys_vec.size(); ++i) {
               if (!infer_mode_ || sage_mode_) {
                 CHECK_EQ(keys_vec[i]->size(), ranks_vec[i]->size())
-                    << keys_vec[i]->size() << " should be euqal to "
+                    << keys_vec[i]->size() << " should be equal to "
                     << ranks_vec[i]->size();
                 for (size_t j = 0; j < keys_vec[i]->size(); ++j) {
                   auto& key = (*keys_vec[i])[j];
@@ -398,7 +398,7 @@ void PSGPUWrapper::PreBuildTask(std::shared_ptr<HeterContext> gpu_task,
                 }
               } else {
                 CHECK_EQ(ranks_vec[i]->size(), 0UL)
-                    << ranks_vec[i]->size() << " should be euqal to 0";
+                    << ranks_vec[i]->size() << " should be equal to 0";
                 for (size_t j = 0; j < keys_vec[i]->size(); ++j) {
                   auto& key = (*keys_vec[i])[j];
                   int shard_idx = key % thread_keys_thread_num_;

paddle/fluid/pir/transforms/inplace_pass.cc

@@ -91,7 +91,7 @@ bool CanDoInplace(const std::unordered_set<pir::Value>& eager_dels,
       return true;
     }
 
-    auto is_numel_euqal = [](const TensorType& in,
+    auto is_numel_equal = [](const TensorType& in,
                              const TensorType& out) -> bool {
       int64_t in_numel = 1;
       int64_t out_numel = 1;
@@ -127,7 +127,7 @@ bool CanDoInplace(const std::unordered_set<pir::Value>& eager_dels,
     };
     // In this version, we don't consider the -1 in ddim, we just calculate the
     // result.
-    auto is_numel_euqal_loose_version = [](const TensorType& in,
+    auto is_numel_equal_loose_version = [](const TensorType& in,
                                            const TensorType& out) -> bool {
       auto calculate_numel = [](const phi::DDim& ddim) -> int64_t {
         int64_t numel = 1;
@@ -144,10 +144,10 @@ bool CanDoInplace(const std::unordered_set<pir::Value>& eager_dels,
     bool equal = false;
     bool relax = (RelaxShapeCheckOps.count(op_name) > 0);
     if (relax) {
-      equal = is_numel_euqal_loose_version(input_alloc_tensor_type,
+      equal = is_numel_equal_loose_version(input_alloc_tensor_type,
                                            output_alloc_tensor_type);
     } else {
-      equal = is_numel_euqal(input_alloc_tensor_type, output_alloc_tensor_type);
+      equal = is_numel_equal(input_alloc_tensor_type, output_alloc_tensor_type);
     }
 
     if (!equal) {
@@ -159,7 +159,7 @@ bool CanDoInplace(const std::unordered_set<pir::Value>& eager_dels,
     return false;
   }
   if (eager_dels.count(input) == 0) {
-    VLOG(9) << "     -- input not in eager_deletion_valus, can't do inplace";
+    VLOG(9) << "     -- input not in eager_deletion_vars, can't do inplace";
     return false;
   }
   return true;

paddle/fluid/pir/transforms/pd_op_to_kernel_pass.cc

@@ -190,7 +190,7 @@ static bool NeedFallBackFromGPUDNN2GPU(pir::Operation* op,
                                        const std::string& kernel_name,
                                        const phi::KernelKey kernel_key) {
   // NOTE(phlrain): keep the same kernel select strategy with
-  // GetExepectKernelKey
+  // GetExpectKernelKey
   if (op->isa<Pool2dOp>() || op->isa<Pool2dGradOp>() || op->isa<Pool3dOp>() ||
       op->isa<Pool3dGradOp>()) {
     if (kernel_key.backend() == phi::Backend::GPUDNN &&

paddle/fluid/pir/transforms/transform_general_functions.h

@@ -67,7 +67,7 @@ Operation* GetDefiningOpForInput(const Operation* op, uint32_t index);
  * @brief Get operations and the index of designative op operand (op result)
  that use the specific output of the operation.
  *
- * @param const Operation* cosnt pointer to an operation
+ * @param const Operation* const pointer to an operation
  * @param uint32_t index of result of the operation
 
  * @return std::vector<std::pair<Operation*, int32_t>>

paddle/phi/infermeta/binary.cc

@@ -561,7 +561,7 @@ void ConvInferMeta(const MetaTensor& input,
       strides.size() + 2U,
       phi::errors::InvalidArgument(
           "The difference of input's dimension and Attr(strides)'s "
-          "length must be euqal to 2 for Op(Conv). "
+          "length must be equal to 2 for Op(Conv). "
           "But received: input's dimension is %d, input's shape is [%s]; "
           "Attr(stride)'s length is %d, Attr(stride) is [%s]; "
           "difference of input's dimention and Attr(strides)'s length = %u.",
@@ -732,7 +732,7 @@ void ConvTransposeInferMeta(const MetaTensor& x,
       2U,
       errors::InvalidArgument(
           "The input's dimension size minus Attr(stride)'s size must "
-          "be euqal to 2 for Op(conv_transpose). But received: [%d], the "
+          "be equal to 2 for Op(conv_transpose). But received: [%d], the "
           "input's dimension size is [%d], the shape of input "
           "is [%s], the Attr(stride)'s size is [%d].",
           in_sub_stride_size,