vfio/type1: fix a couple of spelling mistakes

There are several spelling mistakes, as follows:
userpsace ==> userspace
Accouting ==> Accounting
exlude ==> exclude

Signed-off-by: Zhen Lei <thunder.leizhen@huawei.com>
Reviewed-by: Eric Auger <eric.auger@redhat.com>
Message-Id: <20210326083528.1329-2-thunder.leizhen@huawei.com>
Signed-off-by: Alex Williamson <alex.williamson@redhat.com>

diff --git a/drivers/vfio/vfio_iommu_type1.c b/drivers/vfio/vfio_iommu_type1.c
index 45cbfd4879a55310d7d17c6194dd1ba9a93943e6..0485ad8e1b55486d182af037add5cac472394502 100644 (file)
--- a/drivers/vfio/vfio_iommu_type1.c
+++ b/drivers/vfio/vfio_iommu_type1.c
@@ -16,7 +16,7 @@
  * IOMMU to support the IOMMU API and have few to no restrictions around
  * the IOVA range that can be mapped.  The Type1 IOMMU is currently
  * optimized for relatively static mappings of a userspace process with
- * userpsace pages pinned into memory.  We also assume devices and IOMMU
+ * userspace pages pinned into memory.  We also assume devices and IOMMU
  * domains are PCI based as the IOMMU API is still centered around a
  * device/bus interface rather than a group interface.
  */
@@ -877,7 +877,7 @@ again:
 
        /*
         * If iommu capable domain exist in the container then all pages are
-        * already pinned and accounted. Accouting should be done if there is no
+        * already pinned and accounted. Accounting should be done if there is no
         * iommu capable domain in the container.
         */
        do_accounting = !IS_IOMMU_CAP_DOMAIN_IN_CONTAINER(iommu);
@@ -2177,7 +2177,7 @@ static int vfio_iommu_resv_exclude(struct list_head *iova,
                                continue;
                        /*
                         * Insert a new node if current node overlaps with the
-                        * reserve region to exlude that from valid iova range.
+                        * reserve region to exclude that from valid iova range.
                         * Note that, new node is inserted before the current
                         * node and finally the current node is deleted keeping
                         * the list updated and sorted.