1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
|
/*
FreeRTOS.org V4.2.1 - Copyright (C) 2003-2007 Richard Barry.
This file is part of the FreeRTOS.org distribution.
FreeRTOS.org is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FreeRTOS.org is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FreeRTOS.org; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
A special exception to the GPL can be applied should you wish to distribute
a combined work that includes FreeRTOS.org, without being obliged to provide
the source code for any proprietary components. See the licensing section
of http://www.FreeRTOS.org for full details of how and when the exception
can be applied.
***************************************************************************
See http://www.FreeRTOS.org for documentation, latest information, license
and contact details. Please ensure to read the configuration and relevant
port sections of the online documentation.
Also see http://www.SafeRTOS.com for an IEC 61508 compliant version along
with commercial development and support options.
***************************************************************************
*/
/*
Changes from V1.01
+ More use of 8bit data types.
+ Function name prefixes changed where the data type returned has changed.
Changed from V2.0.0
+ Added the queue locking mechanism and make more use of the scheduler
suspension feature to minimise the time interrupts have to be disabled
when accessing a queue.
Changed from V2.2.0
+ Explicit use of 'signed' qualifier on portCHAR types added.
Changes from V3.0.0
+ API changes as described on the FreeRTOS.org WEB site.
Changes from V3.2.3
+ Added the queue functions that can be used from co-routines.
Changes from V4.0.5
+ Added a loop within xQueueSend() and xQueueReceive() to prevent the
functions exiting when a block time remains and the function has
not completed.
Changes from V4.1.2:
+ BUG FIX: Removed the call to prvIsQueueEmpty from within xQueueCRReceive
as it exited with interrupts enabled. Thanks Paul Katz.
Changes from V4.1.3:
+ Modified xQueueSend() and xQueueReceive() to handle the (very unlikely)
case whereby a task unblocking due to a temporal event can remove/send an
item from/to a queue when a higher priority task is still blocked on the
queue. This modification is a result of the SafeRTOS testing.
*/
#include <stdlib.h>
#include <string.h>
#include "FreeRTOS.h"
#include "task.h"
#include "croutine.h"
/*-----------------------------------------------------------
* PUBLIC LIST API documented in list.h
*----------------------------------------------------------*/
/* Constants used with the cRxLock and cTxLock structure members. */
#define queueUNLOCKED ( ( signed portBASE_TYPE ) -1 )
#define queueERRONEOUS_UNBLOCK ( -1 )
/*
* Definition of the queue used by the scheduler.
* Items are queued by copy, not reference.
*/
typedef struct QueueDefinition
{
signed portCHAR *pcHead; /*< Points to the beginning of the queue storage area. */
signed portCHAR *pcTail; /*< Points to the byte at the end of the queue storage area. Once more byte is allocated than necessary to store the queue items, this is used as a marker. */
signed portCHAR *pcWriteTo; /*< Points to the free next place in the storage area. */
signed portCHAR *pcReadFrom; /*< Points to the last place that a queued item was read from. */
xList xTasksWaitingToSend; /*< List of tasks that are blocked waiting to post onto this queue. Stored in priority order. */
xList xTasksWaitingToReceive; /*< List of tasks that are blocked waiting to read from this queue. Stored in priority order. */
unsigned portBASE_TYPE uxMessagesWaiting; /*< The number of items currently in the queue. */
unsigned portBASE_TYPE uxLength; /*< The length of the queue defined as the number of items it will hold, not the number of bytes. */
unsigned portBASE_TYPE uxItemSize; /*< The size of each items that the queue will hold. */
signed portBASE_TYPE xRxLock; /*< Stores the number of items received from the queue (removed from the queue) while the queue was locked. Set to queueUNLOCKED when the queue is not locked. */
signed portBASE_TYPE xTxLock; /*< Stores the number of items transmitted to the queue (added to the queue) while the queue was locked. Set to queueUNLOCKED when the queue is not locked. */
} xQUEUE;
/*-----------------------------------------------------------*/
/*
* Inside this file xQueueHandle is a pointer to a xQUEUE structure.
* To keep the definition private the API header file defines it as a
* pointer to void.
*/
typedef xQUEUE *xQueueHandle;
/*
* Prototypes for public functions are included here so we don't have to
* include the API header file (as it defines xQueueHandle differently). These
* functions are documented in the API header file.
*/
xQueueHandle xQueueCreate (unsigned portBASE_TYPE uxQueueLength,
unsigned portBASE_TYPE uxItemSize);
signed portBASE_TYPE xQueueSend (xQueueHandle xQueue,
const void *pvItemToQueue,
portTickType xTicksToWait);
unsigned portBASE_TYPE uxQueueMessagesWaiting (xQueueHandle pxQueue);
void vQueueDelete (xQueueHandle xQueue);
signed portBASE_TYPE xQueueSendFromISR (xQueueHandle pxQueue,
const void *pvItemToQueue,
signed portBASE_TYPE
xTaskPreviouslyWoken);
signed portBASE_TYPE xQueueReceive (xQueueHandle pxQueue, void *pvBuffer,
portTickType xTicksToWait);
signed portBASE_TYPE xQueueReceiveFromISR (xQueueHandle pxQueue,
void *pvBuffer,
signed portBASE_TYPE *
pxTaskWoken);
#if configUSE_CO_ROUTINES == 1
signed portBASE_TYPE xQueueCRSendFromISR (xQueueHandle pxQueue,
const void *pvItemToQueue,
signed portBASE_TYPE
xCoRoutinePreviouslyWoken);
signed portBASE_TYPE xQueueCRReceiveFromISR (xQueueHandle pxQueue,
void *pvBuffer,
signed portBASE_TYPE *
pxTaskWoken);
signed portBASE_TYPE xQueueCRSend (xQueueHandle pxQueue,
const void *pvItemToQueue,
portTickType xTicksToWait);
signed portBASE_TYPE xQueueCRReceive (xQueueHandle pxQueue, void *pvBuffer,
portTickType xTicksToWait);
#endif
/*
* Unlocks a queue locked by a call to prvLockQueue. Locking a queue does not
* prevent an ISR from adding or removing items to the queue, but does prevent
* an ISR from removing tasks from the queue event lists. If an ISR finds a
* queue is locked it will instead increment the appropriate queue lock count
* to indicate that a task may require unblocking. When the queue in unlocked
* these lock counts are inspected, and the appropriate action taken.
*/
static void prvUnlockQueue (xQueueHandle pxQueue);
/*
* Uses a critical section to determine if there is any data in a queue.
*
* @return pdTRUE if the queue contains no items, otherwise pdFALSE.
*/
static signed portBASE_TYPE prvIsQueueEmpty (const xQueueHandle pxQueue);
/*
* Uses a critical section to determine if there is any space in a queue.
*
* @return pdTRUE if there is no space, otherwise pdFALSE;
*/
static signed portBASE_TYPE prvIsQueueFull (const xQueueHandle pxQueue);
/*
* Macro that copies an item into the queue. This is done by copying the item
* byte for byte, not by reference. Updates the queue state to ensure it's
* integrity after the copy.
*/
#define prvCopyQueueData( pxQueue, pvItemToQueue ) \
{ \
memcpy( ( void * ) pxQueue->pcWriteTo, pvItemToQueue, ( unsigned ) pxQueue->uxItemSize ); \
++( pxQueue->uxMessagesWaiting ); \
pxQueue->pcWriteTo += pxQueue->uxItemSize; \
if( pxQueue->pcWriteTo >= pxQueue->pcTail ) \
{ \
pxQueue->pcWriteTo = pxQueue->pcHead; \
} \
}
/*-----------------------------------------------------------*/
/*
* Macro to mark a queue as locked. Locking a queue prevents an ISR from
* accessing the queue event lists.
*/
#define prvLockQueue( pxQueue ) \
{ \
taskENTER_CRITICAL(); \
++( pxQueue->xRxLock ); \
++( pxQueue->xTxLock ); \
taskEXIT_CRITICAL(); \
}
/*-----------------------------------------------------------*/
/*-----------------------------------------------------------
* PUBLIC QUEUE MANAGEMENT API documented in queue.h
*----------------------------------------------------------*/
xQueueHandle
xQueueCreate (unsigned portBASE_TYPE uxQueueLength,
unsigned portBASE_TYPE uxItemSize)
{
xQUEUE *pxNewQueue;
size_t xQueueSizeInBytes;
/* Allocate the new queue structure. */
if (uxQueueLength > (unsigned portBASE_TYPE) 0)
{
pxNewQueue = (xQUEUE *) pvPortMalloc (sizeof (xQUEUE));
if (pxNewQueue != NULL)
{
/* Create the list of pointers to queue items. The queue is one byte
longer than asked for to make wrap checking easier/faster. */
xQueueSizeInBytes =
(size_t) (uxQueueLength * uxItemSize) + (size_t) 1;
pxNewQueue->pcHead =
(signed portCHAR *) pvPortMalloc (xQueueSizeInBytes);
if (pxNewQueue->pcHead != NULL)
{
/* Initialise the queue members as described above where the
queue type is defined. */
pxNewQueue->pcTail =
pxNewQueue->pcHead + (uxQueueLength * uxItemSize);
pxNewQueue->uxMessagesWaiting = 0;
pxNewQueue->pcWriteTo = pxNewQueue->pcHead;
pxNewQueue->pcReadFrom =
pxNewQueue->pcHead + ((uxQueueLength - 1) * uxItemSize);
pxNewQueue->uxLength = uxQueueLength;
pxNewQueue->uxItemSize = uxItemSize;
pxNewQueue->xRxLock = queueUNLOCKED;
pxNewQueue->xTxLock = queueUNLOCKED;
/* Likewise ensure the event queues start with the correct state. */
vListInitialise (&(pxNewQueue->xTasksWaitingToSend));
vListInitialise (&(pxNewQueue->xTasksWaitingToReceive));
return pxNewQueue;
}
else
{
vPortFree (pxNewQueue);
}
}
}
/* Will only reach here if we could not allocate enough memory or no memory
was required. */
return NULL;
}
/*-----------------------------------------------------------*/
signed portBASE_TYPE
xQueueSend (xQueueHandle pxQueue, const void *pvItemToQueue,
portTickType xTicksToWait)
{
signed portBASE_TYPE xReturn = pdPASS;
xTimeOutType xTimeOut;
/* Make sure other tasks do not access the queue. */
vTaskSuspendAll ();
/* Capture the current time status for future reference. */
vTaskSetTimeOutState (&xTimeOut);
/* It is important that this is the only thread/ISR that modifies the
ready or delayed lists until xTaskResumeAll() is called. Places where
the ready/delayed lists are modified include:
+ vTaskDelay() - Nothing can call vTaskDelay as the scheduler is
suspended, vTaskDelay() cannot be called from an ISR.
+ vTaskPrioritySet() - Has a critical section around the access.
+ vTaskSwitchContext() - This will not get executed while the scheduler
is suspended.
+ prvCheckDelayedTasks() - This will not get executed while the
scheduler is suspended.
+ xTaskCreate() - Has a critical section around the access.
+ vTaskResume() - Has a critical section around the access.
+ xTaskResumeAll() - Has a critical section around the access.
+ xTaskRemoveFromEventList - Checks to see if the scheduler is
suspended. If so then the TCB being removed from the event is
removed from the event and added to the xPendingReadyList.
*/
/* Make sure interrupts do not access the queue event list. */
prvLockQueue (pxQueue);
/* It is important that interrupts to not access the event list of the
queue being modified here. Places where the event list is modified
include:
+ xQueueSendFromISR(). This checks the lock on the queue to see if
it has access. If the queue is locked then the Tx lock count is
incremented to signify that a task waiting for data can be made ready
once the queue lock is removed. If the queue is not locked then
a task can be moved from the event list, but will not be removed
from the delayed list or placed in the ready list until the scheduler
is unlocked.
+ xQueueReceiveFromISR(). As per xQueueSendFromISR().
*/
/* If the queue is already full we may have to block. */
do
{
if (prvIsQueueFull (pxQueue))
{
/* The queue is full - do we want to block or just leave without
posting? */
if (xTicksToWait > (portTickType) 0)
{
/* We are going to place ourselves on the xTasksWaitingToSend event
list, and will get woken should the delay expire, or space become
available on the queue.
As detailed above we do not require mutual exclusion on the event
list as nothing else can modify it or the ready lists while we
have the scheduler suspended and queue locked.
It is possible that an ISR has removed data from the queue since we
checked if any was available. If this is the case then the data
will have been copied from the queue, and the queue variables
updated, but the event list will not yet have been checked to see if
anything is waiting as the queue is locked. */
vTaskPlaceOnEventList (&(pxQueue->xTasksWaitingToSend),
xTicksToWait);
/* Force a context switch now as we are blocked. We can do
this from within a critical section as the task we are
switching to has its own context. When we return here (i.e. we
unblock) we will leave the critical section as normal.
It is possible that an ISR has caused an event on an unrelated and
unlocked queue. If this was the case then the event list for that
queue will have been updated but the ready lists left unchanged -
instead the readied task will have been added to the pending ready
list. */
taskENTER_CRITICAL ();
{
/* We can safely unlock the queue and scheduler here as
interrupts are disabled. We must not yield with anything
locked, but we can yield from within a critical section.
Tasks that have been placed on the pending ready list cannot
be tasks that are waiting for events on this queue. See
in comment xTaskRemoveFromEventList(). */
prvUnlockQueue (pxQueue);
/* Resuming the scheduler may cause a yield. If so then there
is no point yielding again here. */
if (!xTaskResumeAll ())
{
taskYIELD ();
}
/* We want to check to see if the queue is still full
before leaving the critical section. This is to prevent
this task placing an item into the queue due to an
interrupt making space on the queue between critical
sections (when there might be a higher priority task
blocked on the queue that cannot run yet because the
scheduler gets suspended). */
if (pxQueue->uxMessagesWaiting == pxQueue->uxLength)
{
/* We unblocked but there is no space in the queue,
we probably timed out. */
xReturn = errQUEUE_FULL;
}
/* Before leaving the critical section we have to ensure
exclusive access again. */
vTaskSuspendAll ();
prvLockQueue (pxQueue);
}
taskEXIT_CRITICAL ();
}
}
/* If xReturn is errQUEUE_FULL then we unblocked when the queue
was still full. Don't check it again now as it is possible that
an interrupt has removed an item from the queue since we left the
critical section and we don't want to write to the queue in case
there is a task of higher priority blocked waiting for space to
be available on the queue. If this is the case the higher priority
task will execute when the scheduler is unsupended. */
if (xReturn != errQUEUE_FULL)
{
/* When we are here it is possible that we unblocked as space became
available on the queue. It is also possible that an ISR posted to the
queue since we left the critical section, so it may be that again there
is no space. This would only happen if a task and ISR post onto the
same queue. */
taskENTER_CRITICAL ();
{
if (pxQueue->uxMessagesWaiting < pxQueue->uxLength)
{
/* There is room in the queue, copy the data into the queue. */
prvCopyQueueData (pxQueue, pvItemToQueue);
xReturn = pdPASS;
/* Update the TxLock count so prvUnlockQueue knows to check for
tasks waiting for data to become available in the queue. */
++(pxQueue->xTxLock);
}
else
{
xReturn = errQUEUE_FULL;
}
}
taskEXIT_CRITICAL ();
}
if (xReturn == errQUEUE_FULL)
{
if (xTicksToWait > 0)
{
if (xTaskCheckForTimeOut (&xTimeOut, &xTicksToWait) == pdFALSE)
{
xReturn = queueERRONEOUS_UNBLOCK;
}
}
}
}
while (xReturn == queueERRONEOUS_UNBLOCK);
prvUnlockQueue (pxQueue);
xTaskResumeAll ();
return xReturn;
}
/*-----------------------------------------------------------*/
signed portBASE_TYPE
xQueueSendFromISR (xQueueHandle pxQueue, const void *pvItemToQueue,
signed portBASE_TYPE xTaskPreviouslyWoken)
{
/* Similar to xQueueSend, except we don't block if there is no room in the
queue. Also we don't directly wake a task that was blocked on a queue
read, instead we return a flag to say whether a context switch is required
or not (i.e. has a task with a higher priority than us been woken by this
post). */
if (pxQueue->uxMessagesWaiting < pxQueue->uxLength)
{
prvCopyQueueData (pxQueue, pvItemToQueue);
/* If the queue is locked we do not alter the event list. This will
be done when the queue is unlocked later. */
if (pxQueue->xTxLock == queueUNLOCKED)
{
/* We only want to wake one task per ISR, so check that a task has
not already been woken. */
if (!xTaskPreviouslyWoken)
{
if (!listLIST_IS_EMPTY (&(pxQueue->xTasksWaitingToReceive)))
{
if (xTaskRemoveFromEventList
(&(pxQueue->xTasksWaitingToReceive)) != pdFALSE)
{
/* The task waiting has a higher priority so record that a
context switch is required. */
return pdTRUE;
}
}
}
}
else
{
/* Increment the lock count so the task that unlocks the queue
knows that data was posted while it was locked. */
++(pxQueue->xTxLock);
}
}
return xTaskPreviouslyWoken;
}
/*-----------------------------------------------------------*/
signed portBASE_TYPE
xQueueReceive (xQueueHandle pxQueue, void *pvBuffer,
portTickType xTicksToWait)
{
signed portBASE_TYPE xReturn = pdTRUE;
xTimeOutType xTimeOut;
/* This function is very similar to xQueueSend(). See comments within
xQueueSend() for a more detailed explanation.
Make sure other tasks do not access the queue. */
vTaskSuspendAll ();
/* Capture the current time status for future reference. */
vTaskSetTimeOutState (&xTimeOut);
/* Make sure interrupts do not access the queue. */
prvLockQueue (pxQueue);
do
{
/* If there are no messages in the queue we may have to block. */
if (prvIsQueueEmpty (pxQueue))
{
/* There are no messages in the queue, do we want to block or just
leave with nothing? */
if (xTicksToWait > (portTickType) 0)
{
vTaskPlaceOnEventList (&(pxQueue->xTasksWaitingToReceive),
xTicksToWait);
taskENTER_CRITICAL ();
{
prvUnlockQueue (pxQueue);
if (!xTaskResumeAll ())
{
taskYIELD ();
}
if (pxQueue->uxMessagesWaiting == (unsigned portBASE_TYPE) 0)
{
/* We unblocked but the queue is empty. We probably
timed out. */
xReturn = errQUEUE_EMPTY;
}
vTaskSuspendAll ();
prvLockQueue (pxQueue);
}
taskEXIT_CRITICAL ();
}
}
if (xReturn != errQUEUE_EMPTY)
{
taskENTER_CRITICAL ();
{
if (pxQueue->uxMessagesWaiting > (unsigned portBASE_TYPE) 0)
{
pxQueue->pcReadFrom += pxQueue->uxItemSize;
if (pxQueue->pcReadFrom >= pxQueue->pcTail)
{
pxQueue->pcReadFrom = pxQueue->pcHead;
}
--(pxQueue->uxMessagesWaiting);
memcpy ((void *) pvBuffer, (void *) pxQueue->pcReadFrom,
(unsigned) pxQueue->uxItemSize);
/* Increment the lock count so prvUnlockQueue knows to check for
tasks waiting for space to become available on the queue. */
++(pxQueue->xRxLock);
xReturn = pdPASS;
}
else
{
xReturn = errQUEUE_EMPTY;
}
}
taskEXIT_CRITICAL ();
}
if (xReturn == errQUEUE_EMPTY)
{
if (xTicksToWait > 0)
{
if (xTaskCheckForTimeOut (&xTimeOut, &xTicksToWait) == pdFALSE)
{
xReturn = queueERRONEOUS_UNBLOCK;
}
}
}
}
while (xReturn == queueERRONEOUS_UNBLOCK);
/* We no longer require exclusive access to the queue. */
prvUnlockQueue (pxQueue);
xTaskResumeAll ();
return xReturn;
}
/*-----------------------------------------------------------*/
signed portBASE_TYPE
xQueueReceiveFromISR (xQueueHandle pxQueue, void *pvBuffer,
signed portBASE_TYPE * pxTaskWoken)
{
signed portBASE_TYPE xReturn;
/* We cannot block from an ISR, so check there is data available. */
if (pxQueue->uxMessagesWaiting > (unsigned portBASE_TYPE) 0)
{
/* Copy the data from the queue. */
pxQueue->pcReadFrom += pxQueue->uxItemSize;
if (pxQueue->pcReadFrom >= pxQueue->pcTail)
{
pxQueue->pcReadFrom = pxQueue->pcHead;
}
--(pxQueue->uxMessagesWaiting);
memcpy ((void *) pvBuffer, (void *) pxQueue->pcReadFrom,
(unsigned) pxQueue->uxItemSize);
/* If the queue is locked we will not modify the event list. Instead
we update the lock count so the task that unlocks the queue will know
that an ISR has removed data while the queue was locked. */
if (pxQueue->xRxLock == queueUNLOCKED)
{
/* We only want to wake one task per ISR, so check that a task has
not already been woken. */
if (!(*pxTaskWoken))
{
if (!listLIST_IS_EMPTY (&(pxQueue->xTasksWaitingToSend)))
{
if (xTaskRemoveFromEventList
(&(pxQueue->xTasksWaitingToSend)) != pdFALSE)
{
/* The task waiting has a higher priority than us so
force a context switch. */
*pxTaskWoken = pdTRUE;
}
}
}
}
else
{
/* Increment the lock count so the task that unlocks the queue
knows that data was removed while it was locked. */
++(pxQueue->xRxLock);
}
xReturn = pdPASS;
}
else
{
xReturn = pdFAIL;
}
return xReturn;
}
/*-----------------------------------------------------------*/
unsigned portBASE_TYPE
uxQueueMessagesWaiting (xQueueHandle pxQueue)
{
unsigned portBASE_TYPE uxReturn;
taskENTER_CRITICAL ();
uxReturn = pxQueue->uxMessagesWaiting;
taskEXIT_CRITICAL ();
return uxReturn;
}
/*-----------------------------------------------------------*/
void
vQueueDelete (xQueueHandle pxQueue)
{
vPortFree (pxQueue->pcHead);
vPortFree (pxQueue);
}
/*-----------------------------------------------------------*/
static void
prvUnlockQueue (xQueueHandle pxQueue)
{
/* THIS FUNCTION MUST BE CALLED WITH THE SCHEDULER SUSPENDED. */
/* The lock counts contains the number of extra data items placed or
removed from the queue while the queue was locked. When a queue is
locked items can be added or removed, but the event lists cannot be
updated. */
taskENTER_CRITICAL ();
{
--(pxQueue->xTxLock);
/* See if data was added to the queue while it was locked. */
if (pxQueue->xTxLock > queueUNLOCKED)
{
pxQueue->xTxLock = queueUNLOCKED;
/* Data was posted while the queue was locked. Are any tasks
blocked waiting for data to become available? */
if (!listLIST_IS_EMPTY (&(pxQueue->xTasksWaitingToReceive)))
{
/* Tasks that are removed from the event list will get added to
the pending ready list as the scheduler is still suspended. */
if (xTaskRemoveFromEventList (&(pxQueue->xTasksWaitingToReceive))
!= pdFALSE)
{
/* The task waiting has a higher priority so record that a
context switch is required. */
vTaskMissedYield ();
}
}
}
}
taskEXIT_CRITICAL ();
/* Do the same for the Rx lock. */
taskENTER_CRITICAL ();
{
--(pxQueue->xRxLock);
if (pxQueue->xRxLock > queueUNLOCKED)
{
pxQueue->xRxLock = queueUNLOCKED;
if (!listLIST_IS_EMPTY (&(pxQueue->xTasksWaitingToSend)))
{
if (xTaskRemoveFromEventList (&(pxQueue->xTasksWaitingToSend)) !=
pdFALSE)
{
vTaskMissedYield ();
}
}
}
}
taskEXIT_CRITICAL ();
}
/*-----------------------------------------------------------*/
static signed portBASE_TYPE
prvIsQueueEmpty (const xQueueHandle pxQueue)
{
signed portBASE_TYPE xReturn;
taskENTER_CRITICAL ();
xReturn = (pxQueue->uxMessagesWaiting == (unsigned portBASE_TYPE) 0);
taskEXIT_CRITICAL ();
return xReturn;
}
/*-----------------------------------------------------------*/
static signed portBASE_TYPE
prvIsQueueFull (const xQueueHandle pxQueue)
{
signed portBASE_TYPE xReturn;
taskENTER_CRITICAL ();
xReturn = (pxQueue->uxMessagesWaiting == pxQueue->uxLength);
taskEXIT_CRITICAL ();
return xReturn;
}
/*-----------------------------------------------------------*/
#if configUSE_CO_ROUTINES == 1
signed portBASE_TYPE
xQueueCRSend (xQueueHandle pxQueue, const void *pvItemToQueue,
portTickType xTicksToWait)
{
signed portBASE_TYPE xReturn;
/* If the queue is already full we may have to block. A critical section
is required to prevent an interrupt removing something from the queue
between the check to see if the queue is full and blocking on the queue. */
portDISABLE_INTERRUPTS ();
{
if (prvIsQueueFull (pxQueue))
{
/* The queue is full - do we want to block or just leave without
posting? */
if (xTicksToWait > (portTickType) 0)
{
/* As this is called from a coroutine we cannot block directly, but
return indicating that we need to block. */
vCoRoutineAddToDelayedList (xTicksToWait,
&(pxQueue->xTasksWaitingToSend));
portENABLE_INTERRUPTS ();
return errQUEUE_BLOCKED;
}
else
{
portENABLE_INTERRUPTS ();
return errQUEUE_FULL;
}
}
}
portENABLE_INTERRUPTS ();
portNOP ();
portDISABLE_INTERRUPTS ();
{
if (pxQueue->uxMessagesWaiting < pxQueue->uxLength)
{
/* There is room in the queue, copy the data into the queue. */
prvCopyQueueData (pxQueue, pvItemToQueue);
xReturn = pdPASS;
/* Were any co-routines waiting for data to become available? */
if (!listLIST_IS_EMPTY (&(pxQueue->xTasksWaitingToReceive)))
{
/* In this instance the co-routine could be placed directly
into the ready list as we are within a critical section.
Instead the same pending ready list mechansim is used as if
the event were caused from within an interrupt. */
if (xCoRoutineRemoveFromEventList
(&(pxQueue->xTasksWaitingToReceive)) != pdFALSE)
{
/* The co-routine waiting has a higher priority so record
that a yield might be appropriate. */
xReturn = errQUEUE_YIELD;
}
}
}
else
{
xReturn = errQUEUE_FULL;
}
}
portENABLE_INTERRUPTS ();
return xReturn;
}
#endif
/*-----------------------------------------------------------*/
#if configUSE_CO_ROUTINES == 1
signed portBASE_TYPE
xQueueCRReceive (xQueueHandle pxQueue, void *pvBuffer,
portTickType xTicksToWait)
{
signed portBASE_TYPE xReturn;
/* If the queue is already empty we may have to block. A critical section
is required to prevent an interrupt adding something to the queue
between the check to see if the queue is empty and blocking on the queue. */
portDISABLE_INTERRUPTS ();
{
if (pxQueue->uxMessagesWaiting == (unsigned portBASE_TYPE) 0)
{
/* There are no messages in the queue, do we want to block or just
leave with nothing? */
if (xTicksToWait > (portTickType) 0)
{
/* As this is a co-routine we cannot block directly, but return
indicating that we need to block. */
vCoRoutineAddToDelayedList (xTicksToWait,
&(pxQueue->xTasksWaitingToReceive));
portENABLE_INTERRUPTS ();
return errQUEUE_BLOCKED;
}
else
{
portENABLE_INTERRUPTS ();
return errQUEUE_FULL;
}
}
}
portENABLE_INTERRUPTS ();
portNOP ();
portDISABLE_INTERRUPTS ();
{
if (pxQueue->uxMessagesWaiting > (unsigned portBASE_TYPE) 0)
{
/* Data is available from the queue. */
pxQueue->pcReadFrom += pxQueue->uxItemSize;
if (pxQueue->pcReadFrom >= pxQueue->pcTail)
{
pxQueue->pcReadFrom = pxQueue->pcHead;
}
--(pxQueue->uxMessagesWaiting);
memcpy ((void *) pvBuffer, (void *) pxQueue->pcReadFrom,
(unsigned) pxQueue->uxItemSize);
xReturn = pdPASS;
/* Were any co-routines waiting for space to become available? */
if (!listLIST_IS_EMPTY (&(pxQueue->xTasksWaitingToSend)))
{
/* In this instance the co-routine could be placed directly
into the ready list as we are within a critical section.
Instead the same pending ready list mechansim is used as if
the event were caused from within an interrupt. */
if (xCoRoutineRemoveFromEventList
(&(pxQueue->xTasksWaitingToSend)) != pdFALSE)
{
xReturn = errQUEUE_YIELD;
}
}
}
else
{
xReturn = pdFAIL;
}
}
portENABLE_INTERRUPTS ();
return xReturn;
}
#endif
/*-----------------------------------------------------------*/
#if configUSE_CO_ROUTINES == 1
signed portBASE_TYPE
xQueueCRSendFromISR (xQueueHandle pxQueue, const void *pvItemToQueue,
signed portBASE_TYPE xCoRoutinePreviouslyWoken)
{
/* Cannot block within an ISR so if there is no space on the queue then
exit without doing anything. */
if (pxQueue->uxMessagesWaiting < pxQueue->uxLength)
{
prvCopyQueueData (pxQueue, pvItemToQueue);
/* We only want to wake one co-routine per ISR, so check that a
co-routine has not already been woken. */
if (!xCoRoutinePreviouslyWoken)
{
if (!listLIST_IS_EMPTY (&(pxQueue->xTasksWaitingToReceive)))
{
if (xCoRoutineRemoveFromEventList
(&(pxQueue->xTasksWaitingToReceive)) != pdFALSE)
{
return pdTRUE;
}
}
}
}
return xCoRoutinePreviouslyWoken;
}
#endif
/*-----------------------------------------------------------*/
#if configUSE_CO_ROUTINES == 1
signed portBASE_TYPE
xQueueCRReceiveFromISR (xQueueHandle pxQueue, void *pvBuffer,
signed portBASE_TYPE * pxCoRoutineWoken)
{
signed portBASE_TYPE xReturn;
/* We cannot block from an ISR, so check there is data available. If
not then just leave without doing anything. */
if (pxQueue->uxMessagesWaiting > (unsigned portBASE_TYPE) 0)
{
/* Copy the data from the queue. */
pxQueue->pcReadFrom += pxQueue->uxItemSize;
if (pxQueue->pcReadFrom >= pxQueue->pcTail)
{
pxQueue->pcReadFrom = pxQueue->pcHead;
}
--(pxQueue->uxMessagesWaiting);
memcpy ((void *) pvBuffer, (void *) pxQueue->pcReadFrom,
(unsigned) pxQueue->uxItemSize);
if (!(*pxCoRoutineWoken))
{
if (!listLIST_IS_EMPTY (&(pxQueue->xTasksWaitingToSend)))
{
if (xCoRoutineRemoveFromEventList
(&(pxQueue->xTasksWaitingToSend)) != pdFALSE)
{
*pxCoRoutineWoken = pdTRUE;
}
}
}
xReturn = pdPASS;
}
else
{
xReturn = pdFAIL;
}
return xReturn;
}
#endif
/*-----------------------------------------------------------*/
|