dir /b > prj.map
鍏朵腑鐨?b鍙傛暟琛ㄧず鍙樉紺烘枃浠跺悕錛宒ir鐨勭粨鏋滀細鍐欏叆prj.map鏂囦歡錛屾濂藉彲浠ユ弧瓚寵姹傘?/p>
鏈鍚庣殑緇熻緇撴灉琛ㄦ槑錛屾垜浠殑鍗忚鏍堟湁109涓枃浠訛紙涓嶅寘鎷渶瑕佺殑榪愯搴擄級錛屽叡161,688琛屼唬鐮侊紝鍏朵腑絀虹櫧琛?3,554錛屾敞閲婅涓?8,311銆傝繖鏄竴涓皬宸х殑錛屼絾鏄畬鏁寸殑鍩虹珯鍗忚鏍堜唬鐮併?/p>
]]>
TAU G2鐢熸垚鐨勭▼搴忚嚦灝戞槸2涓嚎紼嬶細涓涓槸涓葷嚎紼嬶紝灝辨槸main鍑芥暟鎵鍦ㄧ殑綰跨▼錛岃薄鐜鍑芥暟涓殑xInitEnv鍜寈InEnv閮芥槸鍦ㄤ富綰跨▼涓殑錛屼富綰跨▼璁劇疆鏂偣寰堝鏄擄紝鍙鍦ㄥ惎鍔ㄨ皟璇曞櫒鍚庯紝浣跨敤Debug鑿滃崟涓殑Toggle Breakpoint(F9)灝卞彲浠ヤ簡錛屽洜涓鴻皟璇曞櫒榛樿灝辨槸鎶婁富綰跨▼褰撲綔褰撳墠綰跨▼鐨勶紱鍙︿竴涓嚎紼嬫槸UML浠ｇ爜鎵鍦ㄧ殑綰跨▼錛岄氬父浣犱笉闇瑕佸湪鐢熸垚鐨刄ML浠ｇ爜涓緗柇鐐癸紝浣嗘槸xOutEnv鍦ㄨ繖涓嚎紼嬩腑錛岃屼笖濡傛灉鍦║ML浠ｇ爜涓皟鐢ㄤ簡C璇█鐨勫嚱鏁幫紝閭ｄ箞榪欎簺C璇█鐨勫嚱鏁頒篃鍦ㄨ繖涓嚎紼嬩腑錛岃屽湪榪欎釜綰跨▼涓鏋滆繕鏄敤F9鐩存帴璁劇疆鏂偣灝卞線寰涓嶄細鎴愬姛浜嗭紝紼嬪簭寰寰涓嶄細鍋滀笅鏉ヨ屾槸緇х畫鎵ц銆?/p>
瑕佹兂鍦▁OutEnv鎴栬呰嚜宸辯紪鍐欑殑C璇█鍑芥暟涓緗柇鐐硅繘琛岃皟璇曪紝鍙互浣跨敤Debug鑿滃崟涓殑Toggle Global Breakpoint(Shift F9)璁劇疆鍏ㄥ眬鏂偣銆傝緗叏灞鏂偣鍚庯紝褰揢ML浠ｇ爜鎵鍦ㄧ殑綰跨▼鎵ц鍒版柇鐐瑰錛岃繖涓嚎紼嬪氨浼氬仠涓嬫潵錛屾鏃跺彲浠ヤ嬌鐢―ebug鑿滃崟涓殑Attach鍔熻兘錛屽皢褰撳墠綰跨▼鐢變富綰跨▼鍙樹負UML綰跨▼錛岃繖鏍峰氨鍙互鍗曟璺熻釜璋冭瘯浜嗐俇ML綰跨▼鍦ˋttach瀵硅瘽妗嗕腑閫氬父鏄渶鍚庝竴涓嚎紼嬶紝榛樿鎯呭喌涓嬪叾鍚嶅瓧搴旇涓簍1錛屼絾鏄湁鐨勬椂鍊欑嚎紼嬪悕浼氭樉紺轟負涔辯爜銆?/p>
]]>
Code
#include <stdlib.h>#include <stdio.h>#include <lstLib.h>typedef struct _Queue
{
NODE * next; NODE * prev; int age; char name[255];
} QUEUE;LIST list;void TestList(){ QUEUE *p; int i; lstLibInit(); lstInit(&list); for(i = 0; i < 10; i++)
{ p = malloc(sizeof(QUEUE)); if(p) { p->age = i * 5; sprintf(p->name, "person %d", i); lstAdd(&list, (NODE*)p);
} } for(i = 0; i < 10; i++) { p = (QUEUE*)lstGet(&list); if(p) { printf("name = %s, age = %d\n", p->name, p->age); free(p); } } lstFree(&list);}]]>