Correct spelling.

git-svn-id: https://svn.code.sf.net/p/freertos/code/trunk@144 1d2547de-c912-0410-9cb9-b8ca96c0e9e2

diff --git a/Source/include/semphr.h b/Source/include/semphr.h
index dc236a59979a58c41a1c3ec6a82974f36e28b8fa..b4a7ae458a987f40e0d66e8276918bbb6fae896f 100644 (file)
--- a/Source/include/semphr.h
+++ b/Source/include/semphr.h
@@ -104,12 +104,12 @@ typedef xQueueHandle xSemaphoreHandle;
  * xSemaphoreCreateCounting().\r
  *\r
  * @param xSemaphore A handle to the semaphore being taken - obtained when\r
- * the semaophore was created.\r
+ * the semaphore was created.\r
  *\r
  * @param xBlockTime The time in ticks to wait for the semaphore to become\r
  * available.  The macro portTICK_RATE_MS can be used to convert this to a\r
  * real time.  A block time of zero can be used to poll the semaphore.  A block\r
- * time of portMAX_DELAY can be used to block indefinately (provided\r
+ * time of portMAX_DELAY can be used to block indefinitely (provided\r
  * INCLUDE_vTaskSuspend is set to 1 in FreeRTOSConfig.h).\r
  *\r
  * @return pdTRUE if the semaphore was obtained.  pdFALSE\r
@@ -179,7 +179,7 @@ typedef xQueueHandle xSemaphoreHandle;
  * doesn't become available again until the owner has called \r
  * xSemaphoreGiveRecursive() for each successful 'take' request.  For example, \r
  * if a task successfully 'takes' the same mutex 5 times then the mutex will \r
- * not be avilable to any other task until it has also  'given' the mutex back\r
+ * not be available to any other task until it has also  'given' the mutex back\r
  * exactly five times.\r
  *\r
  * @param xMutex A handle to the mutex being obtained.  This is the\r
@@ -189,7 +189,7 @@ typedef xQueueHandle xSemaphoreHandle;
  * available.  The macro portTICK_RATE_MS can be used to convert this to a\r
  * real time.  A block time of zero can be used to poll the semaphore.  If\r
  * the task already owns the semaphore then xSemaphoreTakeRecursive() will\r
- * return immediately nomatter what the value of xBlockTime. \r
+ * return immediately no matter what the value of xBlockTime. \r
  *\r
  * @return pdTRUE if the semaphore was obtained.  pdFALSE if xBlockTime\r
  * expired without the semaphore becoming available.\r
@@ -232,7 +232,7 @@ typedef xQueueHandle xSemaphoreHandle;
                        // available to another task until it has also been given back\r
                        // three times.  Again it is unlikely that real code would have\r
                        // these calls sequentially, but instead buried in a more complex\r
-                       // call structure.  This is just for illustrative puproses.\r
+                       // call structure.  This is just for illustrative purposes.\r
             xSemaphoreGiveRecursive( xSemaphore );\r
                        xSemaphoreGiveRecursive( xSemaphore );\r
                        xSemaphoreGiveRecursive( xSemaphore );\r
@@ -347,7 +347,7 @@ typedef xQueueHandle xSemaphoreHandle;
  * doesn't become available again until the owner has called \r
  * xSemaphoreGiveRecursive() for each successful 'take' request.  For example, \r
  * if a task successfully 'takes' the same mutex 5 times then the mutex will \r
- * not be avilable to any other task until it has also  'given' the mutex back\r
+ * not be available to any other task until it has also  'given' the mutex back\r
  * exactly five times.\r
  *\r
  * @param xMutex A handle to the mutex being released, or 'given'.  This is the\r
@@ -584,7 +584,7 @@ typedef xQueueHandle xSemaphoreHandle;
  * doesn't become available again until the owner has called \r
  * xSemaphoreGiveRecursive() for each successful 'take' request.  For example, \r
  * if a task successfully 'takes' the same mutex 5 times then the mutex will \r
- * not be avilable to any other task until it has also  'given' the mutex back\r
+ * not be available to any other task until it has also  'given' the mutex back\r
  * exactly five times.\r
  * \r
  * This type of semaphore uses a priority inheritance mechanism so a task \r