mem_dbg.c
来自「澳洲人写的Cortex,包括uC_IP协议栈」· C语言 代码 · 共 185 行
C
185 行
<HTML><HEAD><TITLE>/home/asysweb/public_html/cortex/excore/src/mem_dbg.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><b><font color='DarkGreen'>#include</font></b> <a href="prn_defs.h.FIND-INC"><font color="blue">"prn_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><b><font color='DarkGreen'>#include</font></b> <a href="seg_priv.h.FIND-INC"><font color="blue">"seg_priv.h"</font></a><b><font color='DarkGreen'>#include</font></b> <a href="mm0_priv.h.FIND-INC"><font color="blue">"mm0_priv.h"</font></a><b><font color='DarkGreen'>#include</font></b> <a href="mm1_priv.h.FIND-INC"><font color="blue">"mm1_priv.h"</font></a><b><font color='DarkGreen'>#include</font></b> <a href="mm2_priv.h.FIND-INC"><font color="blue">"mm2_priv.h"</font></a><b><font color='DarkGreen'>#include</font></b> <a href="thr_priv.h.FIND-INC"><font color="blue">"thr_priv.h"</font></a><font size="+1"><i>static</i> <i>crtx_Void_t</i> <b><font color="azure1"><a name="mem0_Print">mem0_Print</a></font></b>(<i>segm_Table_t</i> *pTable_a){</font> <i>mem0_SegmHead_t</i> *segm; segm = (<i>mem0_SegmHead_t</i> *)pTable_a->pcontext; <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"(Mem0_Type):%p:"</font>,segm); <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"Used=%ld(%lx)\nFree=%ld(%lx)\nSize=%ld(%lx)\n"</font>, segm->shift, segm->shift, segm->rest,segm->rest, segm->rest + segm->shift, segm->rest + segm->shift); <b>return</b>;}<font size="+1"><i>static</i> <i>crtx_Void_t</i> <b><font color="azure1"><a name="mem2_Print">mem2_Print</a></font></b>(<i>segm_Table_t</i> *pTable_a){</font> <i>mem2_SegmHead_t</i> *segm; segm = (<i>mem2_SegmHead_t</i> *)pTable_a; <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"(Mem0_Type):%p:"</font>,segm); <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"Used=%ld(%lx)\nFree=%ld(%lx)\nSize=%ld(%lx)\n"</font>, segm->shift - (<i>sizeof</i>(<i>mem2_SegmHead_t</i>)), segm->shift - (<i>sizeof</i>(<i>mem2_SegmHead_t</i>)), segm->rest,segm->rest, segm->rest + segm->shift - (<i>sizeof</i>(<i>mem2_SegmHead_t</i>)), segm->rest + segm->shift - (<i>sizeof</i>(<i>mem2_SegmHead_t</i>))); <b>return</b>;}<font size="+1"><i>static</i> <i>crtx_Void_t</i> <b><font color="azure1"><a name="mem1_Print">mem1_Print</a></font></b>(<i>segm_Table_t</i> *pTable_a){</font> <i>mem1_SegmHead_t</i> *sghead; <i>mem1_FrgHead_t</i> *frg; sghead = ( <i>mem1_SegmHead_t</i> *)pTable_a->pcontext; <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"(Mem1_Type):%p(%ld(%lx))\n"</font>, sghead, sghead->sz, sghead->sz); frg = sghead->pFirst; <b>while</b> (frg!=<a href="DMEM_NULL.FIND-DEF">DMEM_NULL</a>) { <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">":%p"</font>,frg); <b>if</b> (!(((<i>dmem_Size_t</i>)frg & (~(-<a href="DMEM_MIN_ALIGN.FIND-DEF">DMEM_MIN_ALIGN</a>)))==0)) { <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"-Wrong Alignment"</font>); <b>break</b>; } <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"(%ld-0X%lX)"</font>,frg->sz,frg->sz); <b>if</b> (!((<i>dmem_Size_t</i>)frg >= (<i>dmem_Size_t</i>)sghead + <i>sizeof</i>(<i>mem1_SegmHead_t</i>))) { <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"-Out of(>) Boards"</font>); <b>break</b>; } <b>if</b> (!((<i>dmem_Size_t</i>)frg <= (<i>dmem_Size_t</i>)sghead + <i>sizeof</i>(<i>mem1_SegmHead_t</i>) + sghead->sz - <i>sizeof</i>(<i>mem1_FrgHead_t</i>))) { <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"-Out of(<) Boards"</font>); <b>break</b>; } <b>if</b> (!((((<i>dmem_Size_t</i>)frg+frg->sz) & (~(-<a href="DMEM_MIN_ALIGN.FIND-DEF">DMEM_MIN_ALIGN</a>)))==0)) { <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"-Wrong size Alignment"</font>); } <b>if</b> (!((<i>dmem_Size_t</i>)frg+frg->sz + <i>sizeof</i>(<i>mem1_FrgHead_t</i>)>= (<i>dmem_Size_t</i>)frg + <i>sizeof</i>(<i>mem1_FrgHead_t</i>))) { <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"-End Out of(>) Boards"</font>); <b>break</b>; } <b>if</b> (!((<i>dmem_Size_t</i>)frg + frg->sz<= (<i>dmem_Size_t</i>)sghead + <i>sizeof</i>(<i>mem1_SegmHead_t</i>) + sghead->sz)) { <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"-EndOut of(<) Boards"</font>); <b>break</b>; } frg = frg->pNext; } <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"\n"</font>); <b>return</b>;}<font size="+1"><i>crtx_Void_t</i> <b><font color="azure1"><a name="dmem_Print">dmem_Print</a></font></b>(<i>crtx_Void_t</i>){</font> <i>segm_Table_t</i> *pTable; <i>crtx_Int_t</i> i; pTable = <a href="thrd_Segment.FIND-FUNC">thrd_Segment</a>(); <b>if</b> (pTable != <a href="DMEM_NULL.FIND-DEF">DMEM_NULL</a>) { <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"Stack Segment:"</font>); <b>if</b> (pTable->pCreate == mem0_Create) { <a href="#mem0_Print">mem0_Print</a>(pTable); } <b>else</b> { <a href="#mem1_Print">mem1_Print</a>(pTable); } } <b>for</b> (i = 0; i < <a href="SEGM_MAX_NUMBER.FIND-DEF">SEGM_MAX_NUMBER</a>; i++) { <b>if</b> (segm_Table_g[i].ad == <a href="DMEM_NULL.FIND-DEF">DMEM_NULL</a> || segm_Table_g[i].pCreate == <a href="DMEM_NULL.FIND-DEF">DMEM_NULL</a> ) { <b>continue</b>; } <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"Segment%d:"</font>,i); <b>if</b> (segm_Table_g[i].pCreate == mem0_Create) { <a href="#mem0_Print">mem0_Print</a>(&segm_Table_g[i]); } <b>else</b> { <a href="#mem1_Print">mem1_Print</a>(&segm_Table_g[i]); } } <b>for</b> (i = 0; i < <a href="SEGM_MAX_DYN_NUMBER.FIND-DEF">SEGM_MAX_DYN_NUMBER</a>; i++) { <b>if</b> (segm_DynTable_g[i].ad == <a href="DMEM_NULL.FIND-DEF">DMEM_NULL</a> || segm_DynTable_g[i].pCreate == <a href="DMEM_NULL.FIND-DEF">DMEM_NULL</a> ) { <b>continue</b>; } <a href="printf.FIND-FUNC">printf</a>(<font color="DarkGreen">"Segment%d:"</font>,i + <a href="SEGM_MAX_NUMBER.FIND-DEF">SEGM_MAX_NUMBER</a>); <b>if</b> (segm_DynTable_g[i].pCreate == mem0_Create) { <a href="#mem0_Print">mem0_Print</a>(&segm_DynTable_g[i]); } <b>else</b> <b>if</b> (segm_DynTable_g[i].pCreate == mem1_Create) { <a href="#mem1_Print">mem1_Print</a>(&segm_DynTable_g[i]); } <b>else</b> { <a href="#mem2_Print">mem2_Print</a>(&segm_DynTable_g[i]); } } <b>return</b>;}</pre></BODY></HTML>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?