rlq_misc.c
来自「澳洲人写的Cortex,包括uC_IP协议栈」· C语言 代码 · 共 150 行
C
150 行
<HTML><HEAD><TITLE>/home/asysweb/public_html/cortex/kernel/src/rlq_misc.c</TITLE></HEAD><BODY><pre><font color="#6920ac">/*************************************************************************/</font><font color="#6920ac">/* */</font><font color="#6920ac">/* Copyright (c) 1997-1999 Australian Real Time Embedded Systems */</font><font color="#6920ac">/* */</font><font color="#6920ac">/* PROPRIETARY RIGHTS of Australian Real Time Embedded Systems */</font><font color="#6920ac">/* are involved in the subject matter of this material. All reproduction,*/</font><font color="#6920ac">/* manufacturing, use, and sales rights pertaining to this subject matter*/</font><font color="#6920ac">/* are governed by the license agreement. The recipient of this software */</font><font color="#6920ac">/* implicitly accepts the terms of the license. */</font><font color="#6920ac">/* */</font><font color="#6920ac">/*************************************************************************/</font><font color="#6920ac">/************************************************************************** * * FILE NAME * * rlq_misc.c * * SYSTEM COMPONENT * * Reference Linked List Management Component * * DESCRIPTION * * This file contains the miscellaneous services for The Reference Linked * Queue Component. * * SERVICES * * rque_Validate queue validation routine * * SCCS HISTORY * * @(#)rlq_misc.c 1.4, 01/25/99, 00:32:13 * * AUTHOR * * Vadim N. Azarovsky * * CREATED * * 11-Feb-1998 by Vadim N. Azarovsky * * REVISION HISTORY * * NAME DATE REMARKS * **************************************************************************/</font><b><font color='DarkGreen'>#include</font></b> <a href="rlq_defs.h.FIND-INC"><font color="blue">"rlq_defs.h"</font></a><b><font color='DarkGreen'>#include</font></b> <a href="ass_defs.h.FIND-INC"><font color="blue">"ass_defs.h"</font></a><font color="#6920ac">/* simple procedure to validate integrity of queue */</font><font size="+1"><i>crtx_Boolean_t</i> <b><font color="azure1"><a name="rque_Validate">rque_Validate</a></font></b>( <i>rque_Queue_t</i> *pQueue_a){</font><font color="#6920ac">/********************* * LOCAL VARIABLES * *********************/</font> <a href="CRTX_REG_1.FIND-DEF">CRTX_REG_1</a> <i>crtx_Int_t</i> i; <a href="CRTX_REG_2.FIND-DEF">CRTX_REG_2</a> <i>rque_Node_t</i> *pQueNode; <a href="CRTX_REG_3.FIND-DEF">CRTX_REG_3</a> <i>rlst_Node_t</i> *pLstNode; <i>rlst_Node_t</i> *pLstPrev; <i>rlst_List_t</i> *pList;<font color="#6920ac">/********************* * PROCEDURE LOGIC * *********************/</font> <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(pQueue_a) <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RQUE_CHECK_QUEUE_ID.FIND-DEF">RQUE_CHECK_QUEUE_ID</a>(pQueue_a)) <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RLST_CHECK_LIST_ID.FIND-DEF">RLST_CHECK_LIST_ID</a>(&pQueue_a->RllList)) <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(pQueue_a->RllList.pEndOfList == <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>) <b>if</b> (pQueue_a->Length == 0) { <font color="#6920ac">/* empty queue */</font> <b>if</b> (!<a href="RLST_IS_EMPTY.FIND-DEF">RLST_IS_EMPTY</a>(&pQueue_a->RllList) || !<a href="RLST_IS_EMPTY2.FIND-DEF">RLST_IS_EMPTY2</a>(&pQueue_a->RllList)) <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> QueLstErr_e; } <b>else</b> { <b>if</b> (<a href="RLST_IS_EMPTY.FIND-DEF">RLST_IS_EMPTY</a>(&pQueue_a->RllList) || <a href="RLST_IS_EMPTY2.FIND-DEF">RLST_IS_EMPTY2</a>(&pQueue_a->RllList)) <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> EmptyList_e; pList = &(pQueue_a)->RllList; pQueNode=(<i>rque_Node_t</i>*)<a href="RLST_GET_HEAD_REF.FIND-DEF">RLST_GET_HEAD_REF</a>(&(pQueue_a)->RllList); pLstNode = (<i>rlst_Node_t</i>*)pQueNode; pLstPrev = (<i>rlst_Node_t</i>*)&pList->pEndOfList; <b>if</b> (pQueue_a->Length == 1) { <b>if</b> (pList->pTail != pList->pHead) <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> RllListErr1_e; <b>if</b> (pLstNode->pNext != pLstNode->pPrev) <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> RllNodeErr1_e; } <b>for</b> (i=0; i<pQueue_a->Length; i++) { <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RQUE_CHECK_NODE_ID.FIND-DEF">RQUE_CHECK_NODE_ID</a>(pQueNode)) <b>if</b> (pLstNode->pPrev == <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a> || pLstNode->pNext == <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>) <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> LstNodeNullErr_e; <b>if</b> (pLstNode->pPrev != pLstPrev) <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> LstPrevErr_e; pLstPrev = pLstNode; pLstNode = pLstNode->pNext; pQueNode = (<i>rque_Node_t</i>*)pLstNode; } <b>if</b> (pLstNode != (<i>rlst_Node_t</i>*)&pList->pEndOfList) <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> LastNodeErr1_e; <b>if</b> (pList->pTail != pLstPrev) <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> LastNodeErr2_e; } <b>return</b> <a href="CRTX_TRUE.FIND-DEF">CRTX_TRUE</a>;<font color="#6920ac">/************************ * EXCEPTION HANDLING * ************************/</font><font color="blue">QueLstErr_e:</font> <b>return</b> <a href="CRTX_FALSE.FIND-DEF">CRTX_FALSE</a>;<font color="blue">EmptyList_e:</font> <b>return</b> <a href="CRTX_FALSE.FIND-DEF">CRTX_FALSE</a>;<font color="blue">RllListErr1_e:</font> <b>return</b> <a href="CRTX_FALSE.FIND-DEF">CRTX_FALSE</a>;<font color="blue">RllNodeErr1_e:</font> <b>return</b> <a href="CRTX_FALSE.FIND-DEF">CRTX_FALSE</a>;<font color="blue">LstNodeNullErr_e:</font> <b>return</b> <a href="CRTX_FALSE.FIND-DEF">CRTX_FALSE</a>;<font color="blue">LstPrevErr_e:</font> <b>return</b> <a href="CRTX_FALSE.FIND-DEF">CRTX_FALSE</a>;<font color="blue">LastNodeErr1_e:</font> <b>return</b> <a href="CRTX_FALSE.FIND-DEF">CRTX_FALSE</a>;<font color="blue">LastNodeErr2_e:</font> <b>return</b> <a href="CRTX_FALSE.FIND-DEF">CRTX_FALSE</a>;}</pre></BODY></HTML>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?