📄 os_q.src
字号:
; .\OS_Q.SRC generated from: SOURCE\OS_Q.C
; COMPILER INVOKED BY:
; D:\tools\Keil\C51\BIN\C51.EXE SOURCE\OS_Q.C LARGE OPTIMIZE(SIZE) REGFILE(.\OS_AT89C55WD.ORC) BROWSE NOINTPROMOTE INCDIR(D:\MY\empolder\uCOS-II\MCS-51\AT89C55WD\Keil 7_5\) DEBUG OBJECTEXTEND NOPRINT SRC(.\OS_Q.SRC)
$NOMOD51
NAME OS_Q
P0 DATA 080H
P1 DATA 090H
P2 DATA 0A0H
P3 DATA 0B0H
AC BIT 0D0H.6
T0 BIT 0B0H.4
T2_EX BIT 090H.1
T1 BIT 0B0H.5
EA BIT 0A8H.7
T2 BIT 090H.0
IE DATA 0A8H
P0_0 BIT 080H.0
P1_0 BIT 090H.0
P0_1 BIT 080H.1
P2_0 BIT 0A0H.0
P1_1 BIT 090H.1
P0_2 BIT 080H.2
P2_1 BIT 0A0H.1
P1_2 BIT 090H.2
P0_3 BIT 080H.3
P2_2 BIT 0A0H.2
P1_3 BIT 090H.3
P0_4 BIT 080H.4
P2_3 BIT 0A0H.3
P1_4 BIT 090H.4
P0_5 BIT 080H.5
EXF2 BIT 0C8H.6
RD BIT 0B0H.7
P2_4 BIT 0A0H.4
P1_5 BIT 090H.5
P0_6 BIT 080H.6
P2_5 BIT 0A0H.5
P1_6 BIT 090H.6
P0_7 BIT 080H.7
ES BIT 0A8H.4
P2_6 BIT 0A0H.6
P1_7 BIT 090H.7
P2_7 BIT 0A0H.7
IP DATA 0B8H
RI BIT 098H.0
CY BIT 0D0H.7
INT0 BIT 0B0H.2
TI BIT 098H.1
INT1 BIT 0B0H.3
RCAP2H DATA 0CBH
PS BIT 0B8H.4
SP DATA 081H
OV BIT 0D0H.2
RCAP2L DATA 0CAH
C_T2 BIT 0C8H.1
WR BIT 0B0H.6
RCLK BIT 0C8H.5
TCLK BIT 0C8H.4
PCON DATA 087H
SBUF DATA 099H
SCON DATA 098H
TMOD DATA 089H
TCON DATA 088H
IE0 BIT 088H.1
IE1 BIT 088H.3
B DATA 0F0H
CP_RL2 BIT 0C8H.0
ACC DATA 0E0H
ET0 BIT 0A8H.1
TF0 BIT 088H.5
ET1 BIT 0A8H.3
TF1 BIT 088H.7
ET2 BIT 0A8H.5
TF2 BIT 0C8H.7
RB8 BIT 098H.2
TH0 DATA 08CH
IT0 BIT 088H.0
EX0 BIT 0A8H.0
TH1 DATA 08DH
IT1 BIT 088H.2
EX1 BIT 0A8H.2
TB8 BIT 098H.3
TH2 DATA 0CDH
P BIT 0D0H.0
SM0 BIT 098H.7
TL0 DATA 08AH
SM1 BIT 098H.6
TL1 DATA 08BH
SM2 BIT 098H.5
TL2 DATA 0CCH
PT0 BIT 0B8H.1
PT1 BIT 0B8H.3
RS0 BIT 0D0H.3
TR0 BIT 088H.4
PT2 BIT 0B8H.5
RS1 BIT 0D0H.4
TR1 BIT 088H.6
TR2 BIT 0C8H.2
PX0 BIT 0B8H.0
PX1 BIT 0B8H.2
DPH DATA 083H
DPL DATA 082H
EXEN2 BIT 0C8H.3
REN BIT 098H.4
T2MOD DATA 0C9H
T2CON DATA 0C8H
DPS DATA 0A2H
RXD BIT 0B0H.0
TXD BIT 0B0H.1
F0 BIT 0D0H.5
F1 BIT 0D0H.1
PSW DATA 0D0H
; /*
; *********************************************************************************************************
; * uC/OS-II
; * The Real-Time Kernel
; * MESSAGE QUEUE MANAGEMENT
; *
; * (c) Copyright 1992-2002, Jean J. Labrosse, Weston, FL
; * All Rights Reserved
; *
; * File : OS_Q.C
; * By : Jean J. Labrosse
; *********************************************************************************************************
; */
;
; #ifndef OS_MASTER_FILE
; #include "includes.h"
; #endif
;
; #if (OS_Q_EN > 0) && (OS_MAX_QS > 0)
; /*
; *********************************************************************************************************
; * ACCEPT MESSAGE FROM QUEUE
; *
; * Description: This function checks the queue to see if a message is available. Unlike OSQPend(),
; * OSQAccept() does not suspend the calling task if a message is not available.
; *
; * Arguments : pevent is a pointer to the event control block
; *
; * Returns : != (void *)0 is the message in the queue if one is available. The message is removed
; * from the so the next time OSQAccept() is called, the queue will contain
; * one less entry.
; * == (void *)0 if the queue is empty or,
; * if 'pevent' is a NULL pointer or,
; * if you passed an invalid event type
; *********************************************************************************************************
; */
;
; #if OS_Q_ACCEPT_EN > 0
; void *OSQAccept (OS_EVENT *pevent)LG_REENTRANT
; {
; #if OS_CRITICAL_METHOD == 3 /* Allocate storage for CPU status register */
; OS_CPU_SR cpu_sr;
; #endif
; void *msg;
; OS_Q *pq;
;
;
; #if OS_ARG_CHK_EN > 0
; if (pevent == (OS_EVENT *)0) { /* Validate 'pevent' */
; return ((void *)0);
; }
; if (pevent->OSEventType != OS_EVENT_TYPE_Q) {/* Validate event block type */
; return ((void *)0);
; }
; #endif
; OS_ENTER_CRITICAL();
; pq = (OS_Q *)pevent->OSEventPtr; /* Point at queue control block */
; if (pq->OSQEntries > 0) { /* See if any messages in the queue */
; msg = *pq->OSQOut++; /* Yes, extract oldest message from the queue */
; pq->OSQEntries--; /* Update the number of entries in the queue */
; if (pq->OSQOut == pq->OSQEnd) { /* Wrap OUT pointer if we are at the end of the queue */
; pq->OSQOut = pq->OSQStart;
; }
; } else {
; msg = (void *)0; /* Queue is empty */
; }
; OS_EXIT_CRITICAL();
; return (msg); /* Return message received (or NULL) */
; }
; #endif
; /*$PAGE*/
; /*
; *********************************************************************************************************
; * CREATE A MESSAGE QUEUE
; *
; * Description: This function creates a message queue if free event control blocks are available.
; *
; * Arguments : start is a pointer to the base address of the message queue storage area. The
; * storage area MUST be declared as an array of pointers to 'void' as follows
; *
; * void *MessageStorage[size]
; *
; * size is the number of elements in the storage area
; *
; * Returns : != (OS_EVENT *)0 is a pointer to the event control clock (OS_EVENT) associated with the
; * created queue
; * == (OS_EVENT *)0 if no event control blocks were available or an error was detected
; *********************************************************************************************************
; */
;
; OS_EVENT *OSQCreate (void **start, INT16U size)LG_REENTRANT
; {
; #if OS_CRITICAL_METHOD == 3 /* Allocate storage for CPU status register */
; OS_CPU_SR cpu_sr;
; #endif
; OS_EVENT *pevent;
; OS_Q *pq;
;
;
; if (OSIntNesting > 0) { /* See if called from ISR ... */
; return ((OS_EVENT *)0); /* ... can't CREATE from an ISR */
; }
; OS_ENTER_CRITICAL();
; pevent = OSEventFreeList; /* Get next free event control block */
; if (OSEventFreeList != (OS_EVENT *)0) { /* See if pool of free ECB pool was empty */
; OSEventFreeList = (OS_EVENT *)OSEventFreeList->OSEventPtr;
; }
; OS_EXIT_CRITICAL();
; if (pevent != (OS_EVENT *)0) { /* See if we have an event control block */
; OS_ENTER_CRITICAL();
; pq = OSQFreeList; /* Get a free queue control block */
; if (pq != (OS_Q *)0) { /* Were we able to get a queue control block ? */
; OSQFreeList = OSQFreeList->OSQPtr; /* Yes, Adjust free list pointer to next free*/
; OS_EXIT_CRITICAL();
; pq->OSQStart = start; /* Initialize the queue */
; pq->OSQEnd = &start[size];
; pq->OSQIn = start;
; pq->OSQOut = start;
; pq->OSQSize = size;
; pq->OSQEntries = 0;
; pevent->OSEventType = OS_EVENT_TYPE_Q;
; pevent->OSEventCnt = 0;
; pevent->OSEventPtr = pq;
; OS_EventWaitListInit(pevent); /* Initalize the wait list */
; } else {
; pevent->OSEventPtr = (void *)OSEventFreeList; /* No, Return event control block on error */
; OSEventFreeList = pevent;
; OS_EXIT_CRITICAL();
; pevent = (OS_EVENT *)0;
; }
; }
; return (pevent);
; }
; /*$PAGE*/
; /*
; *********************************************************************************************************
; * DELETE A MESSAGE QUEUE
; *
; * Description: This function deletes a message queue and readies all tasks pending on the queue.
; *
; * Arguments : pevent is a pointer to the event control block associated with the desired
; * queue.
; *
; * opt determines delete options as follows:
; * opt == OS_DEL_NO_PEND Delete the queue ONLY if no task pending
; * opt == OS_DEL_ALWAYS Deletes the queue even if tasks are waiting.
; * In this case, all the tasks pending will be readied.
; *
; * err is a pointer to an error code that can contain one of the following values:
; * OS_NO_ERR The call was successful and the queue was deleted
; * OS_ERR_DEL_ISR If you tried to delete the queue from an ISR
; * OS_ERR_INVALID_OPT An invalid option was specified
; * OS_ERR_TASK_WAITING One or more tasks were waiting on the queue
; * OS_ERR_EVENT_TYPE If you didn't pass a pointer to a queue
; * OS_ERR_PEVENT_NULL If 'pevent' is a NULL pointer.
; *
; * Returns : pevent upon error
; * (OS_EVENT *)0 if the queue was successfully deleted.
; *
; * Note(s) : 1) This function must be used with care. Tasks that would normally expect the presence of
; * the queue MUST check the return code of OSQPend().
; * 2) OSQAccept() callers will not know that the intended queue has been deleted unless
; * they check 'pevent' to see that it's a NULL pointer.
; * 3) This call can potentially disable interrupts for a long time. The interrupt disable
; * time is directly proportional to the number of tasks waiting on the queue.
; * 4) Because ALL tasks pending on the queue will be readied, you MUST be careful in
; * applications where the queue is used for mutual exclusion because the resource(s)
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -