@ -490,7 +490,7 @@ BaseType_t xQueueGenericReset( QueueHandle_t xQueue,
/* Check for multiplication overflow. */
( ( SIZE_MAX / uxQueueLength ) > = uxItemSize ) & &
/* Check for addition overflow. */
( ( SIZE_MAX - sizeof ( Queue_t ) ) > = ( uxQueueLength * uxItemSize ) ) )
( ( UBaseType_t ) ( SIZE_MAX - sizeof ( Queue_t ) ) > = ( uxQueueLength * uxItemSize ) ) )
{
/* Allocate enough space to hold the maximum number of items that
* can be in the queue at any time . It is valid for uxItemSize to be
@ -1329,7 +1329,7 @@ BaseType_t xQueueGiveFromISR( QueueHandle_t xQueue,
* can be assumed there is no mutex holder and no need to determine if
* priority disinheritance is needed . Simply increase the count of
* messages ( semaphores ) available . */
pxQueue - > uxMessagesWaiting = uxMessagesWaiting + ( UBaseType_t ) 1 ;
pxQueue - > uxMessagesWaiting = ( UBaseType_t ) ( uxMessagesWaiting + ( UBaseType_t ) 1 ) ;
/* The event list is not altered if the queue is locked. This will
* be done when the queue is unlocked later . */
@ -1474,7 +1474,7 @@ BaseType_t xQueueReceive( QueueHandle_t xQueue,
/* Data available, remove one item. */
prvCopyDataFromQueue ( pxQueue , pvBuffer ) ;
traceQUEUE_RECEIVE ( pxQueue ) ;
pxQueue - > uxMessagesWaiting = uxMessagesWaiting - ( UBaseType_t ) 1 ;
pxQueue - > uxMessagesWaiting = ( UBaseType_t ) ( uxMessagesWaiting - ( UBaseType_t ) 1 ) ;
/* There is now space in the queue, were any tasks waiting to
* post to the queue ? If so , unblock the highest priority waiting
@ -1631,7 +1631,7 @@ BaseType_t xQueueSemaphoreTake( QueueHandle_t xQueue,
/* Semaphores are queues with a data size of zero and where the
* messages waiting is the semaphore ' s count . Reduce the count . */
pxQueue - > uxMessagesWaiting = uxSemaphoreCount - ( UBaseType_t ) 1 ;
pxQueue - > uxMessagesWaiting = ( UBaseType_t ) ( uxSemaphoreCount - ( UBaseType_t ) 1 ) ;
# if ( configUSE_MUTEXES == 1 )
{
@ -2003,7 +2003,7 @@ BaseType_t xQueueReceiveFromISR( QueueHandle_t xQueue,
traceQUEUE_RECEIVE_FROM_ISR ( pxQueue ) ;
prvCopyDataFromQueue ( pxQueue , pvBuffer ) ;
pxQueue - > uxMessagesWaiting = uxMessagesWaiting - ( UBaseType_t ) 1 ;
pxQueue - > uxMessagesWaiting = ( UBaseType_t ) ( uxMessagesWaiting - ( UBaseType_t ) 1 ) ;
/* If the queue is locked the event list will not be modified.
* Instead update the lock count so the task that unlocks the queue
@ -2137,7 +2137,7 @@ UBaseType_t uxQueueSpacesAvailable( const QueueHandle_t xQueue )
taskENTER_CRITICAL ( ) ;
{
uxReturn = pxQueue - > uxLength - pxQueue - > uxMessagesWaiting ;
uxReturn = ( UBaseType_t ) ( pxQueue - > uxLength - pxQueue - > uxMessagesWaiting ) ;
}
taskEXIT_CRITICAL ( ) ;
@ -2250,7 +2250,7 @@ UBaseType_t uxQueueGetQueueItemSize( QueueHandle_t xQueue ) /* PRIVILEGED_FUNCTI
* mutex . */
if ( listCURRENT_LIST_LENGTH ( & ( pxQueue - > xTasksWaitingToReceive ) ) > 0U )
{
uxHighestPriorityOfWaitingTasks = ( UBaseType_t ) configMAX_PRIORITIES - ( UBaseType_t ) listGET_ITEM_VALUE_OF_HEAD_ENTRY ( & ( pxQueue - > xTasksWaitingToReceive ) ) ;
uxHighestPriorityOfWaitingTasks = ( UBaseType_t ) ( ( UBaseType_t ) configMAX_PRIORITIES - ( UBaseType_t ) listGET_ITEM_VALUE_OF_HEAD_ENTRY ( & ( pxQueue - > xTasksWaitingToReceive ) ) ) ;
}
else
{
@ -2340,7 +2340,7 @@ static BaseType_t prvCopyDataToQueue( Queue_t * const pxQueue,
}
}
pxQueue - > uxMessagesWaiting = uxMessagesWaiting + ( UBaseType_t ) 1 ;
pxQueue - > uxMessagesWaiting = ( UBaseType_t ) ( uxMessagesWaiting + ( UBaseType_t ) 1 ) ;
return xReturn ;
}