rlq_core.c
来自「澳洲人写的Cortex,包括uC_IP协议栈」· C语言 代码 · 共 644 行 · 第 1/2 页
C
644 行
<HTML><HEAD><TITLE>/home/asysweb/public_html/cortex/kernel/src/rlq_core.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_core.c * * SYSTEM COMPONENT * * Reference Linked List Management Component * * DESCRIPTION * * This file contains the core services for The Reference Linked Queue * Component. * * SERVICES * * rque_CreateQueue create/initialise queue control block * rque_DestroyQueue destroy queue created by rlst_CreateQueue * rque_NodeInit initialise node * rque_AddHead add node at the head of queue * rque_AddTail add node at the tail of queue * rque_Insert insert node on the queue after specified node * rque_EnqueueByKey put node on the queue according to key * rque_Remove remove node from queue * rque_RemoveHead remove node form the head of queue * rque_RemoveTail remove node from the tail of queue * rque_CursorInit initialise cursor * rque_CursorNext move cursor on the next item * rque_CursorRemove remove node pointerd by cursor * * SCCS HISTORY * * @(#)rlq_core.c 1.8, 01/25/99, 00:30:31 * * 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><b><font color='DarkGreen'>#include</font></b> <a href="mem_defs.h.FIND-INC"><font color="blue">"mem_defs.h"</font></a><font size="+1"><i>rque_Queue_t</i> *<b><font color="azure1"><a name="rque_CreateQueue">rque_CreateQueue</a></font></b>( <i>rque_Queue_t</i> *pQueue_a, <i>rque_Attr_t</i> *pAttr_a){</font><font color="#6920ac">/********************* * LOCAL VARIABLES * *********************/</font> <font color="#6920ac">/* None */</font><font color="#6920ac">/********************* * PROCEDURE LOGIC * *********************/</font> <b>if</b> (pAttr_a == <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>) { <font color="#6920ac">/* use default attributes */</font> pAttr_a = &rque_AttrDefault_g; } <b>if</b> (pQueue_a == <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>) { <font color="#6920ac">/* allocate queue control block */</font> pQueue_a = (<i>rque_Queue_t</i>*)<a href="dmem_Alloc.FIND-FUNC">dmem_Alloc</a>(pAttr_a->Segment, <i>sizeof</i>(<i>rque_Queue_t</i>), <i>sizeof</i>(<i>crtx_Unsigned_t</i>)); <b>if</b> ((<i>crtx_Void_t</i>*)pQueue_a == (<i>crtx_Void_t</i>*)<a href="DMEM_ILLEGAL.FIND-DEF">DMEM_ILLEGAL</a>) { <font color="#6920ac">/* memory allocation error */</font> <a href="CRTX_EXCEPTION.FIND-DEF">CRTX_EXCEPTION</a> MemAllocError_Exc; } <font color="#6920ac">/* mark as internally allocated queue control block */</font> pQueue_a->Flags = <a href="RQUE_FLAG_INIT.FIND-DEF">RQUE_FLAG_INIT</a> | <a href="RQUE_FLAG_QUEUE_ALLOC.FIND-DEF">RQUE_FLAG_QUEUE_ALLOC</a>; } <b>else</b> { <font color="#6920ac">/* mark as externally allocated queue control block */</font> pQueue_a->Flags = <a href="RQUE_FLAG_INIT.FIND-DEF">RQUE_FLAG_INIT</a>; } <a href="RQUE_INIT_QUEUE.FIND-DEF">RQUE_INIT_QUEUE</a>(pQueue_a); pQueue_a->Attr = *pAttr_a; <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RQUE_VALIDATE.FIND-DEF">RQUE_VALIDATE</a>(pQueue_a)) <b>return</b> pQueue_a;<font color="#6920ac">/************************ * EXCEPTION HANDLING * ************************/</font><font color="blue">MemAllocError_Exc:</font> <font color="#6920ac">/* memory allocation error exception */</font> <b>return</b> <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>;}<font color="#6920ac">/* destroy queue control block */</font><font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="rque_DestroyQueue">rque_DestroyQueue</a></font></b>( <i>rque_Queue_t</i> *pQueue_a){</font><font color="#6920ac">/********************* * LOCAL VARIABLES * *********************/</font> <font color="#6920ac">/* None */</font><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_VALIDATE.FIND-DEF">RQUE_VALIDATE</a>(pQueue_a)) <b>if</b>(pQueue_a->Flags & <a href="RQUE_FLAG_QUEUE_ALLOC.FIND-DEF">RQUE_FLAG_QUEUE_ALLOC</a>) { <font color="#6920ac">/* release internaly allocated queue control block */</font> <a href="dmem_Free.FIND-FUNC">dmem_Free</a>(pQueue_a->Attr.Segment, (<i>crtx_Void_t</i>*)pQueue_a, <i>sizeof</i>(<i>rque_Queue_t</i>)); } <b>else</b> { pQueue_a->Flags = <a href="RQUE_FLAG_INIT.FIND-DEF">RQUE_FLAG_INIT</a>; <font color="#6920ac">/* reset flags */</font> <a href="RQUE_INIT_QUEUE.FIND-DEF">RQUE_INIT_QUEUE</a>(pQueue_a);<b><font color='DarkGreen'>#if</font></b><font color="maroon"> ENVI_CRTX_ERR_CHECK_LEVEL > 0</font> <a href="CRTX_SET_NO_ID.FIND-DEF">CRTX_SET_NO_ID</a>(pQueue_a); <font color="#6920ac">/* no id */</font><b><font color='DarkGreen'>#endif</font></b><font color="maroon"> <font color="#6920ac">/* ENVI_CRTX_ERR_CHECK_LEVEL > 0 */</font></font> } <b>return</b>;<font color="#6920ac">/************************ * EXCEPTION HANDLING * ************************/</font> <font color="#6920ac">/* None */</font>}<font color="#6920ac">/* add node at the head */</font><font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="rque_AddHead">rque_AddHead</a></font></b>( <i>rque_Queue_t</i> *pQueue_a, <i>rque_Node_t</i> *pNode_a){</font><font color="#6920ac">/********************* * LOCAL VARIABLES * *********************/</font> <font color="#6920ac">/* None */</font><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>(pNode_a)<b><font color='DarkGreen'>#if</font></b><font color="maroon"> ENVI_CRTX_ERR_CHECK_LEVEL > 0</font> <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="RQUE_SET_NODE_ID.FIND-DEF">RQUE_SET_NODE_ID</a>(pNode_a);<b><font color='DarkGreen'>#endif</font></b><font color="maroon"> <font color="#6920ac">/* ENVI_CRTX_ERR_CHECK_LEVEL > 0 */</font></font> pQueue_a->Length++; pNode_a->pOnQueue = pQueue_a; <a href="rlst_AddHead.FIND-FUNC">rlst_AddHead</a>(&pQueue_a->RllList, &pNode_a->RllNode); <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RQUE_VALIDATE.FIND-DEF">RQUE_VALIDATE</a>(pQueue_a)) <b>return</b>;<font color="#6920ac">/************************ * EXCEPTION HANDLING * ************************/</font> <font color="#6920ac">/* None */</font>}<font color="#6920ac">/* add node at the tail */</font><font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="rque_AddTail">rque_AddTail</a></font></b>( <i>rque_Queue_t</i> *pQueue_a, <i>rque_Node_t</i> *pNode_a){</font><font color="#6920ac">/********************* * LOCAL VARIABLES * *********************/</font> <font color="#6920ac">/* None */</font><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>(pNode_a)<b><font color='DarkGreen'>#if</font></b><font color="maroon"> ENVI_CRTX_ERR_CHECK_LEVEL > 0</font> <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="RQUE_SET_NODE_ID.FIND-DEF">RQUE_SET_NODE_ID</a>(pNode_a);<b><font color='DarkGreen'>#endif</font></b><font color="maroon"> <font color="#6920ac">/* ENVI_CRTX_ERR_CHECK_LEVEL > 0 */</font></font> pQueue_a->Length++; pNode_a->pOnQueue = pQueue_a; <a href="rlst_AddTail.FIND-FUNC">rlst_AddTail</a>(&pQueue_a->RllList, &pNode_a->RllNode); <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RQUE_VALIDATE.FIND-DEF">RQUE_VALIDATE</a>(pQueue_a)) <b>return</b>;<font color="#6920ac">/************************ * EXCEPTION HANDLING * ************************/</font> <font color="#6920ac">/* None */</font>}<font color="#6920ac">/* put node on the queue after specified node */</font><font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="rque_Insert">rque_Insert</a></font></b>( <i>rque_Queue_t</i> *pQueue_a, <i>rque_Node_t</i> *pPred_a, <i>rque_Node_t</i> *pNew_a){</font><font color="#6920ac">/********************* * LOCAL VARIABLES * *********************/</font> <font color="#6920ac">/* None */</font><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>(pNew_a)<b><font color='DarkGreen'>#if</font></b><font color="maroon"> ENVI_CRTX_ERR_CHECK_LEVEL > 0</font> <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="RQUE_SET_NODE_ID.FIND-DEF">RQUE_SET_NODE_ID</a>(pNew_a);<b><font color='DarkGreen'>#endif</font></b><font color="maroon"> <font color="#6920ac">/* ENVI_CRTX_ERR_CHECK_LEVEL > 0 */</font></font> pQueue_a->Length++; pNew_a->pOnQueue = pQueue_a; <b>if</b> (pPred_a == <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>) { <a href="rlst_Insert.FIND-FUNC">rlst_Insert</a>(&pQueue_a->RllList, <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>, &pNew_a->RllNode); } <b>else</b> { <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RQUE_CHECK_NODE_ID.FIND-DEF">RQUE_CHECK_NODE_ID</a>(pPred_a)) <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(pPred_a->pOnQueue) <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(pPred_a->pOnQueue == pQueue_a) <a href="rlst_Insert.FIND-FUNC">rlst_Insert</a>(<a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>, &pPred_a->RllNode, &pNew_a->RllNode); } <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RQUE_VALIDATE.FIND-DEF">RQUE_VALIDATE</a>(pQueue_a)) <b>return</b>;<font color="#6920ac">/************************ * EXCEPTION HANDLING * ************************/</font> <font color="#6920ac">/* None */</font>}<font color="#6920ac">/* put node on the queue according to key value */</font><font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="rque_EnqueueByKey">rque_EnqueueByKey</a></font></b>( <i>rque_Queue_t</i> *pQueue_a, <i>rque_Node_t</i> *pNode_a, <i>rlst_Key_t</i> Key_a){</font><font color="#6920ac">/********************* * LOCAL VARIABLES * *********************/</font> <font color="#6920ac">/* None */</font><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>(pNode_a)<b><font color='DarkGreen'>#if</font></b><font color="maroon"> ENVI_CRTX_ERR_CHECK_LEVEL > 0</font> <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="RQUE_SET_NODE_ID.FIND-DEF">RQUE_SET_NODE_ID</a>(pNode_a);<b><font color='DarkGreen'>#endif</font></b><font color="maroon"> <font color="#6920ac">/* ENVI_CRTX_ERR_CHECK_LEVEL > 0 */</font></font> pQueue_a->Length++;⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?