3 files changed, 3 insertions, 3 deletions
diff --git a/tools/source/generic/poly.cxx b/tools/source/generic/poly.cxx
index ada70516d1ea..8dc2e21e9947 100644
--- a/tools/source/generic/poly.cxx
+++ b/tools/source/generic/poly.cxx
@@ -1325,7 +1325,7 @@ Rectangle Polygon::GetBoundRect() const
     // Removing the assert. Bezier curves have the attribute that each single
     // curve segment defined by four points can not exit the four-point polygon
     // defined by that points. This allows to say that the curve segment can also
-    // never leave the Range of it's defining points.
+    // never leave the Range of its defining points.
     // The result is that Polygon::GetBoundRect() may not create the minimal
     // BoundRect of the Polygon (to get that, use basegfx::B2DPolygon classes),
     // but will always create a valid BoundRect, at least as long as this method
diff --git a/tools/source/misc/pathutils.cxx b/tools/source/misc/pathutils.cxx
index 0b3f172ee3ed..577e5491b5ca 100644
--- a/tools/source/misc/pathutils.cxx
+++ b/tools/source/misc/pathutils.cxx
@@ -48,7 +48,7 @@ WCHAR * buildPath(
 {
     // Remove leading ".." segments in the second path together with matching
     // segments in the first path that are neither empty nor "." nor ".." nor
-    // end in ":" (which is not foolprove, as it can erroneously erase the start
+    // end in ":" (which is not foolproof, as it can erroneously erase the start
     // of a UNC path, but only if the input is bad data):
     while (backLength >= 2 && backBegin[0] == L'.' && backBegin[1] == L'.' &&
            (backLength == 2 || backBegin[2] == L'\\'))
diff --git a/tools/source/stream/stream.cxx b/tools/source/stream/stream.cxx
index 479657ab1d57..b0976ddf89c0 100644
--- a/tools/source/stream/stream.cxx
+++ b/tools/source/stream/stream.cxx
@@ -1818,7 +1818,7 @@ sal_Size SvMemoryStream::PutData( const void* pData, sal_Size nCount )
             else
             {
                 // lacking memory is larger than nResize,
-                // resize by (nCoount-nMaxCount) + resize offset
+                // resize by (nCount-nMaxCount) + resize offset
                 if( !ReAllocateMemory( nCount-nMaxCount+nNewResize ) )
                 {
                     nCount = 0;