rll_core.c

来自「澳洲人写的Cortex,包括uC_IP协议栈」· C语言代码 · 共 864 行 · 第 1/2 页
864 行
<HTML><HEAD><TITLE>/home/asysweb/public_html/cortex/kernel/src/rll_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 * *      rll_core.c * * SYSTEM COMPONENT * *      Reference Linked List Management Component * * DESCRIPTION * *      This file contains the core services for The Reference Linked List *      Management Component. * * SERVICES * *      rlst_CreateList         create/initialise list control block *      rlst_DestroyList        destroy list created by rlst_CreateList *      rlst_AddHead            add node at the head *      rlst_AddTail            add node at the tail *      rlst_Insert             insert node on the list after specified node *      rlst_Enqueue            put message on the list according to key *      rlst_Remove             remove node from list (node must be on list) *      rlst_RemoveHead         remove node form the head of list *      rlst_RemoveTail         remove node from the tail of list * * SCCS HISTORY * *      @(#)rll_core.c  1.7, 01/25/99, 00:30:30 * * 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="rll_defs.h.FIND-INC"><font color="blue">"rll_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 color="#6920ac">/************************************************************************** * * SERVICE NAME * *    rlst_CreateList * * SYNOPSIS * *    #include "cortex.h" *    rlst_List_t   *pList; *    rlst_List_t   List; * *    pList = rlst_CreateList(NULL, NULL);  -- allocate and initilise list -- *    rlst_CreateList(&amp;List, NULL);         -- initialise existing list --- * * DESCRIPTION * *    Create/initialise list control block * * ARGUMENTS * *    o Pointer to the list control block. If NULL new list control block *      is allocated according attribute. *    o optional attributes. If NULL use default attributes * * RETURN VALUE * *    Return pointer to created/initialised list control block *    or NULL is memory allocation error detected * * USAGE * *    o Used by CORTEX to create internal control structures; *    o Application level; * * CONSTRAINS * *    None * * AUTOR * *    Vadim N. Azarovsky * * REVISION HISTORY * *      NAME                DATE                    REMARKS *      VA                  28-Jan-1997             Created initial version * **************************************************************************/</font><font size="+1"><i>rlst_List_t</i> *<b><font color="azure1"><a name="rlst_CreateList">rlst_CreateList</a></font></b>(    <i>rlst_List_t</i> *pList_a,     <i>rlst_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 = &amp;rlst_AttrDefault_g;    }    <b>if</b> (pList_a == <a href="CRTX_NULL.FIND-DEF">CRTX_NULL</a>)    {   <font color="#6920ac">/* allocate list control block */</font>        pList_a = (<i>rlst_List_t</i>*)<a href="dmem_Alloc.FIND-FUNC">dmem_Alloc</a>(pAttr_a-&gt;Segment,                                           <i>sizeof</i>(<i>rlst_List_t</i>),                                           <i>sizeof</i>(<i>crtx_Unsigned_t</i>));        <b>if</b> ((<i>crtx_Void_t</i>*)pList_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 list control block */</font>        pList_a-&gt;Flags = <a href="RLST_FLAG_INIT.FIND-DEF">RLST_FLAG_INIT</a> | <a href="RLST_FLAG_LIST_ALLOC.FIND-DEF">RLST_FLAG_LIST_ALLOC</a>;    }    <b>else</b>    {        <font color="#6920ac">/* mark as externally allocated list control block */</font>        pList_a-&gt;Flags = <a href="RLST_FLAG_INIT.FIND-DEF">RLST_FLAG_INIT</a>;    }    <a href="RLST_INIT_LIST.FIND-DEF">RLST_INIT_LIST</a>(pList_a);    pList_a-&gt;Attr = *pAttr_a;<b><font color='DarkGreen'>#if</font></b><font color="maroon"> ENVI_CRTX_ERR_CHECK_LEVEL &gt; 0</font>    <a href="RLST_SET_LIST_ID.FIND-DEF">RLST_SET_LIST_ID</a>(pList_a);<b><font color='DarkGreen'>#endif</font></b><font color="maroon"> <font color="#6920ac">/* ENVI_CRTX_ERR_CHECK_LEVEL &gt; 0 */</font></font>    <b>return</b> pList_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">/************************************************************************** * * SERVICE NAME * *    rlst_DestroyList * * SYNOPSIS * *    #include "cortex.h" *    rlst_List_t   *pList; * *    pList = rlst_CreateList(NULL, NULL);  -- allocate and initilise list -- *    rlst_DestroyList(pList);              -- destroy list --- * * DESCRIPTION * *    Destroy list creted by rlst_CreateList() service. * * ARGUMENTS * *    o Pointer to the list control block. * * RETURN VALUE * *    Not multi-thread safe * * USAGE * *    o Used by CORTEX to create internal control structures; *    o Application level; * * CONSTRAINS * *    Only list control block created by rlst_CreateList() can be *    destroyed. Never ever destroy list initialised by RLST_INIT_LIST *    macro. * * AUTOR * *    Vadim N. Azarovsky * * REVISION HISTORY * *      NAME                DATE                    REMARKS * **************************************************************************/</font><font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="rlst_DestroyList">rlst_DestroyList</a></font></b>(    <i>rlst_List_t</i> *pList_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>(pList_a)    <b>if</b>(pList_a-&gt;Flags &amp; <a href="RLST_FLAG_LIST_ALLOC.FIND-DEF">RLST_FLAG_LIST_ALLOC</a>)    {        <font color="#6920ac">/* release internaly allocated list control block */</font>        <a href="dmem_Free.FIND-FUNC">dmem_Free</a>(pList_a-&gt;Attr.Segment, (<i>crtx_Void_t</i>*)pList_a,                  <i>sizeof</i>(<i>rlst_List_t</i>));    }    <b>else</b>    {        pList_a-&gt;Flags = <a href="RLST_FLAG_INIT.FIND-DEF">RLST_FLAG_INIT</a>;    <font color="#6920ac">/* reset flags */</font>        <a href="RLST_INIT_LIST.FIND-DEF">RLST_INIT_LIST</a>(pList_a);<b><font color='DarkGreen'>#if</font></b><font color="maroon"> ENVI_CRTX_ERR_CHECK_LEVEL &gt; 0</font>        <a href="CRTX_SET_NO_ID.FIND-DEF">CRTX_SET_NO_ID</a>(pList_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 &gt; 0 */</font></font>    }    <b>return</b>;<font color="#6920ac">/************************ *  EXCEPTION HANDLING  * ************************/</font>    <font color="#6920ac">/* None */</font>}<font color="#6920ac">/************************************************************************** * * SERVICE NAME * *    rlst_AddHead * * SYNOPSIS * *    #include "cortex.h" *    rlst_List_t   *pList; *    rlst_Node_t   *pNode; * *    rlst_AddHead(pList, pNode); * * DESCRIPTION * *    Add node at the head * * ARGUMENTS * *    o Pointer to the list control block. *    o Pointer to node to add * * RETURN VALUE * *    None * * USAGE * *    o Used by CORTEX to create internal control structures; *    o Application level; * * CONSTRAINS * *    Not multi-thread safe * * AUTOR * *    Vadim N. Azarovsky * * REVISION HISTORY * *      NAME                DATE                    REMARKS * **************************************************************************/</font><font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="rlst_AddHead">rlst_AddHead</a></font></b>(    <i>rlst_List_t</i> *pList_a,     <i>rlst_Node_t</i> *pNode_a){</font><font color="#6920ac">/********************* *  LOCAL VARIABLES  * *********************/</font>    <a href="CRTX_REG_1.FIND-DEF">CRTX_REG_1</a> <i>rlst_Node_t</i>  *pHead;<font color="#6920ac">/********************* *  PROCEDURE LOGIC  * *********************/</font>    <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(pList_a)    <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(pList_a-&gt;pEndOfList==<a href="CRTX_NULL.FIND-DEF">CRTX_NULL</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 &gt; 0</font>    <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RLST_CHECK_LIST_ID.FIND-DEF">RLST_CHECK_LIST_ID</a>(pList_a))<b><font color='DarkGreen'>#endif</font></b><font color="maroon"> <font color="#6920ac">/* ENVI_CRTX_ERR_CHECK_LEVEL &gt; 0 */</font></font>    pHead = (<i>rlst_Node_t</i>*)&amp;pList_a-&gt;pHead;    <a href="RLST_INSERT.FIND-DEF">RLST_INSERT</a>(pHead, pNode_a);    <b>return</b>;<font color="#6920ac">/************************ *  EXCEPTION HANDLING  * ************************/</font>    <font color="#6920ac">/* None */</font>}<font color="#6920ac">/************************************************************************** * * SERVICE NAME * *    rlst_AddTail * * SYNOPSIS * *    #include "cortex.h" *    rlst_List_t   *pList; *    rlst_Node_t   *pNode; * *    rlst_AddTail(pList, pNode); * * DESCRIPTION * *    Add node at the tail * * ARGUMENTS * *    o Pointer to the list control block. *    o Pointer to node to add * * RETURN VALUE * *    None * * USAGE * *    o Used by CORTEX to create internal control structures; *    o Application level; * * CONSTRAINS * *    Not multi-thread safe * * AUTOR * *    Vadim N. Azarovsky * * REVISION HISTORY * *      NAME                DATE                    REMARKS * **************************************************************************/</font><font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="rlst_AddTail">rlst_AddTail</a></font></b>(    <i>rlst_List_t</i> *pList_a,     <i>rlst_Node_t</i> *pNode_a){</font><font color="#6920ac">/********************* *  LOCAL VARIABLES  * *********************/</font>    <a href="CRTX_REG_1.FIND-DEF">CRTX_REG_1</a> <i>rlst_Node_t</i>  *pTail;<font color="#6920ac">/********************* *  PROCEDURE LOGIC  * *********************/</font>    <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(pList_a)    <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(pList_a-&gt;pEndOfList==<a href="CRTX_NULL.FIND-DEF">CRTX_NULL</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 &gt; 0</font>    <a href="CRTX_ASSERT.FIND-DEF">CRTX_ASSERT</a>(<a href="RLST_CHECK_LIST_ID.FIND-DEF">RLST_CHECK_LIST_ID</a>(pList_a))<b><font color='DarkGreen'>#endif</font></b><font color="maroon"> <font color="#6920ac">/* ENVI_CRTX_ERR_CHECK_LEVEL &gt; 0 */</font></font>    pTail = pList_a-&gt;pTail;    <a href="RLST_INSERT.FIND-DEF">RLST_INSERT</a>(pTail, pNode_a);    <b>return</b>;<font color="#6920ac">/************************ *  EXCEPTION HANDLING  * ************************/</font>    <font color="#6920ac">/* None */</font>}<font color="#6920ac">/************************************************************************** * * SERVICE NAME * *    rlst_Insert * * SYNOPSIS * *    #include "cortex.h" *    rlst_List_t   *pList; *    rlst_Node_t   *pPred; *    rlst_Node_t   *pNew;
rll_core.c - 源码说明

本页面展示了「澳洲人写的Cortex,包括uC_IP协议栈」中的 rll_core.c 源码文件，采用 C语言编程语言编写，共 864 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。
虫虫下载站收录了大量与Cortex相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。
⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?