Last active
December 6, 2018 03:24
-
-
Save k3170makan/20e0d09524c95afd89d04d87bf00ee04 to your computer and use it in GitHub Desktop.
Example C code for studying heap
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <string.h> | |
#include <stdio.h> | |
#include <stdlib.h> | |
char * make_string(size_t length){ | |
char *arr = (char *)malloc(length); | |
asm("int $3"); | |
return arr; | |
} | |
void free_string(char *arr){ | |
free(arr); | |
asm("int $3"); | |
} | |
int main(int argc, char **argv){ | |
int _len = 128; | |
int index = 0; | |
char *array,*array_1,*array_2,*array_3,*array_4; | |
//char *array_; | |
//char *array__; | |
//find a way to show the chosen candiate for each round | |
int inner_array = 0; | |
int _char = 1; | |
for(index = 0;index <= _len;index++){ | |
array = make_string(_len); | |
memset(array,0xAA,_len); | |
printf("[*] array @[%p]\n",array); | |
/* 4 more allocations*/ | |
array_1 = make_string(_len+80*1); | |
printf("[*] array @[%p]\n",array_1); | |
memset(array_1,0xBB,_len+80*1); | |
array_2 = make_string(_len+80*2); | |
printf("[*] array @[%p]\n",array_2); | |
memset(array_2,0xCC,_len+80*2); | |
array_3 = make_string(_len+80*3); | |
printf("[*] array @[%p]\n",array_3); | |
memset(array_3,0xDD,_len+80*3); | |
array_4 = make_string(_len+80*4); | |
printf("[*] array @[%p]\n",array_4); | |
memset(array_4,0xEE,_len+80*4); | |
/*free each array and clear it */ | |
memset(array,0xFF,_len); | |
free_string(array); | |
memset(array_1,0xFF,_len+10); | |
free_string(array_1); | |
memset(array_2,0xFF,_len+20); | |
free_string(array_2); | |
memset(array_3,0xFF,_len+30); | |
free_string(array_3); | |
memset(array_4,0xFF,_len+40); | |
free_string(array_4); | |
_char++; | |
printf("\n\n"); | |
} | |
//printf("[*] done"); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment