Skip to contentSkip to conversation

kdbus: Fix typo in ipc/kdbus

PATCH In review Masanari Iida 2 participants 2 messages Jul 10, 2015

lore
Share & tools
lore
#0 lore raw

PATCH 1/1 kdbus: Fix typo in ipc/kdbus

This patch fix spelling typos found in ipc/kdbus

---
 ipc/kdbus/endpoint.c | 2 +-
 ipc/kdbus/endpoint.h | 4 ++--
 ipc/kdbus/fs.c       | 2 +-
 ipc/kdbus/match.c    | 4 ++--
 ipc/kdbus/node.c     | 4 ++--
 ipc/kdbus/policy.c   | 2 +-
 ipc/kdbus/pool.c     | 2 +-
 7 files changed, 10 insertions(+), 10 deletions(-)
ipc/kdbus/endpoint.c +1 -1
index 9a95a5e..977964d 100644
@@ -78,7 +78,7 @@ static void kdbus_ep_release(struct kdbus_node *node, bool was_active)
  * @gid:		The gid of the node
  * @is_custom:		Whether this is a custom endpoint
  *
- * This function will create a new enpoint with the given
+ * This function will create a new endpoint with the given
  * name and properties for a given bus.
  *
  * Return: a new kdbus_ep on success, ERR_PTR on failure.
ipc/kdbus/endpoint.h +2 -2
index d31954b..bc1b94a 100644
@@ -25,7 +25,7 @@ struct kdbus_bus;
 struct kdbus_user;
 
 /**
- * struct kdbus_ep - enpoint to access a bus
+ * struct kdbus_ep - endpoint to access a bus
  * @node:		The kdbus node
  * @lock:		Endpoint data lock
  * @bus:		Bus behind this endpoint
@@ -33,7 +33,7 @@ struct kdbus_user;
  * @policy_db:		Uploaded policy
  * @conn_list:		Connections of this endpoint
  *
- * An enpoint offers access to a bus; the default endpoint node name is "bus".
+ * An endpoint offers access to a bus; the default endpoint node name is "bus".
  * Additional custom endpoints to the same bus can be created and they can
  * carry their own policies/filters.
  */
ipc/kdbus/fs.c +1 -1
index d01f33b..68f9a5a 100644
@@ -74,7 +74,7 @@ static int fs_dir_fop_iterate(struct file *file, struct dir_context *ctx)
 	 * closest node to that position and cannot use our node pointer. This
 	 * means iterating the rb-tree to find the closest match and start over
 	 * from there.
-	 * Note that hash values are not neccessarily unique. Therefore, llseek
+	 * Note that hash values are not necessarily unique. Therefore, llseek
 	 * is not guaranteed to seek to the same node that you got when you
 	 * retrieved the position. Seeking to 0, 1, 2 and >=INT_MAX is safe,
 	 * though. We could use the inode-number as position, but this would
ipc/kdbus/match.c +2 -2
index cc083b4..242b186 100644
@@ -66,7 +66,7 @@ struct kdbus_bloom_mask {
 
 /**
  * struct kdbus_match_rule - a rule appended to a match entry
- * @type:		An item type to match agains
+ * @type:		An item type to match against
  * @bloom_mask:		Bloom mask to match a message's filter against, used
  *			with KDBUS_ITEM_BLOOM_MASK
  * @name:		Name to match against, used with KDBUS_ITEM_NAME,
@@ -290,7 +290,7 @@ static bool kdbus_match_rules(const struct kdbus_match_entry *entry,
 }
 
 /**
- * kdbus_match_db_match_kmsg() - match a kmsg object agains the database entries
+ * kdbus_match_db_match_kmsg() - match a kmsg object against the database entries
  * @mdb:		The match database
  * @conn_src:		The connection object originating the message
  * @kmsg:		The kmsg to perform the match on
ipc/kdbus/node.c +2 -2
index 0d65c65..89f58bc 100644
@@ -120,7 +120,7 @@
  * new active references can be acquired.
  * Once all active references are dropped, the node is considered 'drained'. Now
  * kdbus_node_deactivate() is called on each child of the node before we
- * continue deactvating our node. That is, once all children are entirely
+ * continue deactivating our node. That is, once all children are entirely
  * deactivated, we call ->release_cb() of our node. ->release_cb() can release
  * any resources on that node which are bound to the "active" state of a node.
  * When done, we unlink the node from its parent rb-tree, mark it as
@@ -637,7 +637,7 @@ void kdbus_node_deactivate(struct kdbus_node *node)
 			kdbus_fs_flush(pos);
 
 			/*
-			 * If the node was activated and somone subtracted BIAS
+			 * If the node was activated and someone subtracted BIAS
 			 * from it to deactivate it, we, and only us, are
 			 * responsible to release the extra ref-count that was
 			 * taken once in kdbus_node_activate().
ipc/kdbus/policy.c +1 -1
index dd7fffa..f2618e15 100644
@@ -344,7 +344,7 @@ err:
  * In order to allow atomic replacement of rules, the function first removes
  * all entries that have been created for the given owner previously.
  *
- * Callers to this function must make sur that the owner is a custom
+ * Callers to this function must make sure that the owner is a custom
  * endpoint, or if the endpoint is a default endpoint, then it must be
  * either a policy holder or an activator.
  *
ipc/kdbus/pool.c +1 -1
index 45dcdea..63ccd55 100644
@@ -44,7 +44,7 @@
  * The receiver's buffer, managed as a pool of allocated and free
  * slices containing the queued messages.
  *
- * Messages sent with KDBUS_CMD_SEND are copied direcly by the
+ * Messages sent with KDBUS_CMD_SEND are copied directly by the
  * sending process into the receiver's pool.
  *
  * Messages received with KDBUS_CMD_RECV just return the offset
Signature · 1 line
2.5.0.rc1
Reviewed-by on v1 1/1
#1 lore raw

Hi

Quoted 12 lines · Masanari Iida

This patch fix spelling typos found in ipc/kdbus

---
 ipc/kdbus/endpoint.c | 2 +-
 ipc/kdbus/endpoint.h | 4 ++--
 ipc/kdbus/fs.c       | 2 +-
 ipc/kdbus/match.c    | 4 ++--
 ipc/kdbus/node.c     | 4 ++--
 ipc/kdbus/policy.c   | 2 +-
 ipc/kdbus/pool.c     | 2 +-
 7 files changed, 10 insertions(+), 10 deletions(-)

Thanks
David

Quoted 121 lines
ipc/kdbus/endpoint.c +1 -1
index 9a95a5e..977964d 100644
@@ -78,7 +78,7 @@ static void kdbus_ep_release(struct kdbus_node *node, bool was_active)
  * @gid:               The gid of the node
  * @is_custom:         Whether this is a custom endpoint
  *
- * This function will create a new enpoint with the given
+ * This function will create a new endpoint with the given
  * name and properties for a given bus.
  *
  * Return: a new kdbus_ep on success, ERR_PTR on failure.
ipc/kdbus/endpoint.h +2 -2
index d31954b..bc1b94a 100644
@@ -25,7 +25,7 @@ struct kdbus_bus;
 struct kdbus_user;
 
 /**
- * struct kdbus_ep - enpoint to access a bus
+ * struct kdbus_ep - endpoint to access a bus
  * @node:              The kdbus node
  * @lock:              Endpoint data lock
  * @bus:               Bus behind this endpoint
@@ -33,7 +33,7 @@ struct kdbus_user;
  * @policy_db:         Uploaded policy
  * @conn_list:         Connections of this endpoint
  *
- * An enpoint offers access to a bus; the default endpoint node name is "bus".
+ * An endpoint offers access to a bus; the default endpoint node name is "bus".
  * Additional custom endpoints to the same bus can be created and they can
  * carry their own policies/filters.
  */
ipc/kdbus/fs.c +1 -1
index d01f33b..68f9a5a 100644
@@ -74,7 +74,7 @@ static int fs_dir_fop_iterate(struct file *file, struct dir_context *ctx)
         * closest node to that position and cannot use our node pointer. This
         * means iterating the rb-tree to find the closest match and start over
         * from there.
-        * Note that hash values are not neccessarily unique. Therefore, llseek
+        * Note that hash values are not necessarily unique. Therefore, llseek
         * is not guaranteed to seek to the same node that you got when you
         * retrieved the position. Seeking to 0, 1, 2 and >=INT_MAX is safe,
         * though. We could use the inode-number as position, but this would
ipc/kdbus/match.c +2 -2
index cc083b4..242b186 100644
@@ -66,7 +66,7 @@ struct kdbus_bloom_mask {
 
 /**
  * struct kdbus_match_rule - a rule appended to a match entry
- * @type:              An item type to match agains
+ * @type:              An item type to match against
  * @bloom_mask:                Bloom mask to match a message's filter against, used
  *                     with KDBUS_ITEM_BLOOM_MASK
  * @name:              Name to match against, used with KDBUS_ITEM_NAME,
@@ -290,7 +290,7 @@ static bool kdbus_match_rules(const struct kdbus_match_entry *entry,
 }
 
 /**
- * kdbus_match_db_match_kmsg() - match a kmsg object agains the database entries
+ * kdbus_match_db_match_kmsg() - match a kmsg object against the database entries
  * @mdb:               The match database
  * @conn_src:          The connection object originating the message
  * @kmsg:              The kmsg to perform the match on
ipc/kdbus/node.c +2 -2
index 0d65c65..89f58bc 100644
@@ -120,7 +120,7 @@
  * new active references can be acquired.
  * Once all active references are dropped, the node is considered 'drained'. Now
  * kdbus_node_deactivate() is called on each child of the node before we
- * continue deactvating our node. That is, once all children are entirely
+ * continue deactivating our node. That is, once all children are entirely
  * deactivated, we call ->release_cb() of our node. ->release_cb() can release
  * any resources on that node which are bound to the "active" state of a node.
  * When done, we unlink the node from its parent rb-tree, mark it as
@@ -637,7 +637,7 @@ void kdbus_node_deactivate(struct kdbus_node *node)
                        kdbus_fs_flush(pos);
 
                        /*
-                        * If the node was activated and somone subtracted BIAS
+                        * If the node was activated and someone subtracted BIAS
                         * from it to deactivate it, we, and only us, are
                         * responsible to release the extra ref-count that was
                         * taken once in kdbus_node_activate().
ipc/kdbus/policy.c +1 -1
index dd7fffa..f2618e15 100644
@@ -344,7 +344,7 @@ err:
  * In order to allow atomic replacement of rules, the function first removes
  * all entries that have been created for the given owner previously.
  *
- * Callers to this function must make sur that the owner is a custom
+ * Callers to this function must make sure that the owner is a custom
  * endpoint, or if the endpoint is a default endpoint, then it must be
  * either a policy holder or an activator.
  *
ipc/kdbus/pool.c +1 -2
index 45dcdea..63ccd55 100644
@@ -44,7 +44,7 @@
  * The receiver's buffer, managed as a pool of allocated and free
  * slices containing the queued messages.
  *
- * Messages sent with KDBUS_CMD_SEND are copied direcly by the
+ * Messages sent with KDBUS_CMD_SEND are copied directly by the
  * sending process into the receiver's pool.
  *
  * Messages received with KDBUS_CMD_RECV just return the offset
--

2.5.0.rc1