diff --git a/mysql-test/mysql-test-run-ST.pl b/mysql-test/mysql-test-run-ST.pl
index 9c330a7f6a5b33564222900cb8c3425d8eabb7a9..e4111b54da2f89865a91d8fb21b22e2be69fd1b6 100644
--- a/mysql-test/mysql-test-run-ST.pl
+++ b/mysql-test/mysql-test-run-ST.pl
@@ -4266,7 +4266,7 @@ sub do_before_run_mysqltest($) {
 # RETURN VALUE
 #   0  Ok
 #   1  Check failed
-#   >1 Fatal errro
+#   >1 Fatal error
 sub check_testcase($$) {
   my ($tinfo, $mode) = @_;
   my $tname = $tinfo->{name};
diff --git a/storage/tianchi/message_queue/dsw_list.h b/storage/tianchi/message_queue/dsw_list.h
index 1f3f7dc441baa602730609debf36fb4f058e18a8..5c906b29b80072400674d6f3151002337f4ac958 100644
--- a/storage/tianchi/message_queue/dsw_list.h
+++ b/storage/tianchi/message_queue/dsw_list.h
@@ -156,7 +156,7 @@ static inline void list_replace(list_head_t *old_node, list_head_t *new_node)
 
 /*
  * Description: to check whether the node is in queue.
- * return: @1 ture; @ 2 false.
+ * return: @1 true; @ 2 false.
  */
 static inline dsw_int list_check_in_queue(list_head_t *node)
 {
@@ -178,7 +178,7 @@ static inline dsw_int list_check_null(list_head_t *node)
 
 /*
  * Description: to check whether the queue is empty.
- * return: @1 ture; @ 2 false.
+ * return: @1 true; @ 2 false.
  */
 static inline dsw_int list_is_empty(list_head_t *head)
 {
@@ -191,7 +191,7 @@ static inline dsw_int list_is_empty(list_head_t *head)
 
 /*
  * Description: Add second_list to the tail of first_list, and empty the second list
- * return: @1 ture; @ 2 false.
+ * return: @1 true; @ 2 false.
  */
 static inline void list_merge(list_head_t *first_list, list_head_t *second_list)
 {
@@ -218,7 +218,7 @@ static inline void list_merge(list_head_t *first_list, list_head_t *second_list)
 
 /*
  * Description: to check whether this node is the tail of queue.
- * return: @1 ture; @ 2 false.
+ * return: @1 true; @ 2 false.
  */
 static inline dsw_int list_node_is_tail(list_head_t *node, list_head_t *head)
 {
@@ -231,7 +231,7 @@ static inline dsw_int list_node_is_tail(list_head_t *node, list_head_t *head)
 
 /*
  * Description: to check whether this node is the first of queue.
- * return: @1 ture; @ 2 false.
+ * return: @1 true; @ 2 false.
  */
 static inline dsw_int list_node_is_first(list_head_t *node, list_head_t *head)
 {
@@ -318,7 +318,7 @@ static inline void list_splice_tail_init(struct list_head *list, struct list_hea
 
 /*
  * Description: get list size.
- * return: @1 ture; @ 2 false.
+ * return: @1 true; @ 2 false.
  */
 static inline dsw_int list_size(list_head_t *head)
 {
@@ -469,7 +469,7 @@ static inline void dsw_list_merge(dsw_list_t *old_list, dsw_list_t *new_list)
     }
 }
 
-// ÅжÏnodeÊÇ·ñÔÚÁ´±íÖÐ
+// жnodeǷ
 static inline dsw_bool is_node_isolated(list_head_t *node)
 {
     return ((node->next == node->prev) && (node->next == node));