淺析Windows環境下堆表的空閑雙向鏈表結構

標籤：鏈表   soft   mem   microsoft   clu   cal   操作   pack   alt   

• 實驗環境:
• 作業系統: Windows 2000 Service Pack 4
• 整合式開發環境: Microsoft Visual C++ 6.0 SP6
• 實驗代碼如下:

•  1 #include <windows.h> 2 #include <stdio.h> 3  4 int main(int argc, char **argv) 5 { 6     HLOCAL h1, h2, h3, h4, h5, h6; 7     HANDLE hp; 8     hp = HeapCreate(0, 0x1000, 0x10000); 9     10     // 為了方便顯示堆的地址，這裡把它列印出來11     printf("Heap address: %p\n", hp);12 13     // 為了避免程式監測出調試器而是使用調試堆管理原則14     __asm int 315 16     h1 = HeapAlloc(hp, HEAP_ZERO_MEMORY, 3);17     printf("h1: %p\n", h1);18     h2 = HeapAlloc(hp, HEAP_ZERO_MEMORY, 5);19     printf("h2: %p\n", h2);20     h3 = HeapAlloc(hp, HEAP_ZERO_MEMORY, 6);21     printf("h3: %p\n", h3);22     h4 = HeapAlloc(hp, HEAP_ZERO_MEMORY, 8);23     printf("h4: %p\n", h4);24     h5 = HeapAlloc(hp, HEAP_ZERO_MEMORY, 19);25     printf("h5: %p\n", h5);26     h6 = HeapAlloc(hp, HEAP_ZERO_MEMORY, 24);27     printf("h6: %p\n", h6);28 29     HeapFree(hp,0, h1);30     HeapFree(hp,0, h3);31     HeapFree(hp,0, h5);32 33     HeapFree(hp, 0, h4);34 35     return 0;36 }

   

• 根據

淺析Windows環境下堆表的空閑雙向鏈表結構