Allocation Step is as size like the below:
8 -> 16 -> 32
*
Middle streches like 8 do not heart memorized allocation, which is high rate of success.
--- execution 001 ---
result:|>&|
char* get_array_string_004(char* a_string, int index, int length ) ends.
p_dummy|>&| i: 2/255
We found the |>| index 2/ 1084.
key_buffer |p|
void aFree ( char* str ) |003E1050| starts.
sub_aFree starts.
We are going to free |4067408| from array [3]
i 0/ 3
i 1/ 3
i 2/ 3
free |003E1050| | 2/ 3| |>&|>&|
free 2 |00000000|
001 stored_index 2/
002 stored_index 2/
003 dummy_ary_index 3/ -> 004 dummy_ary_index 2/
sub_aFree ends. return 1.
sub_aFree starts.
We are going to free |4067408| from array [2]
i 0/ 2
i 1/ 2
001 stored_index -1/
sub_aFree ends. thre is no free.
void aFree ( char* str ) |003E1050| ends.
int a_get_inside( char* key_buffer, int max_buffer, char* end_string, char* tag_string ) returns 1.
key_buffer |p| result |1|
001 html_count 0 >= html_max_count 0
HTMLTAG** put_html ( HTMLTAG** a_html, int* html_count, char* key_buffer, int key_num ) starts.
realloc: *html_count 0 / html_max_count 8
015 html->inside |p| *html_count 0 >= html_max_count 8
HTMLTAG** put_html ( HTMLTAG** a_html, int* html_count, char* key_buffer, int key_num ) ends.
--- execution 001 ---
main.cpp Mon Oct 17 13:07:20 2022
...
1588 a_html[*html_count] = html;
1589 html->inside = (char*)copyof( (char*) key_buffer);
1590
1591 printf("015 html->inside |%s| *html_count %d >= html_max_count %d\r\n", html->inside, *html_count, html_max_count );
1592 printf("HTMLTAG** put_html ( HTMLTAG** a_html, int* html_count, char* key_buffer, int key_num ) ends.\r\n");
1593 return a_html;
1594 }
1595
...
