Waitrud Weber’s blog

things and reminders for memories

2022-10-01から1ヶ月間の記事一覧

3d: windows-make:

Press 'f' -> 'g'-> 'h' Error: https://github.com/WaitrudWeber/source_zip/blob/master/axex-20221026-001.zip allocation address is not changed, so, we can say that the result is a waste. string 01[0]=|039D3AD0|-80|string 01[1]=|039D3AD1|23|s…

3d: windows-make: malloc as a param is still O.K.

That result is more interesting.We can use a pointer allocation as a param from the sublootin as a returnable value. --- execution 001 ---string[0]=|022B3C38|0|string[1]=|022B3C39|0|string[2]=|022B3C3A|0|string[3]=|022B3C3B|0|string[4]=|02…

CodeAnalyzer: html: The way you are.

* --- execution 001 ---string[0]=|00000008|string[1]=|00000023|string[2]=|00000033|string[3]=|00000071|string[4]=|00000000|string[5]=|00000000|string[6]=|00000000|string[7]=|00000000|string[8]=|00000008|string[9]=|00000023|string 03[0]=|00…

CodeAnalyzer: windows-make: html: The way you are.

We tihnk, that is an error. We are going to free |5050448| from array [2]i 0/ 2i 1/ 2001 stored_index -1/sub_aFree ends. thre is no free.void aFree ( char* str ) |004D1050| ends.int a_get_inside_003( char* key_buffer, int max_buffer, char*…

CodeAnalyzer: windows-make: html:

*Sublootin is not necesarry for the change.Valuable memories is useful out side of the sublootin, which means a memories administration on the source code. // int a_get_inside_003 ( char* key_buffer, int max_buffer, char* end_string, char*…

CodeAnalyzer: windows-make: html: Buffered is well, we allow that flow.

Prepare the returnable string function: char* a_get_inside_002 ( char* all_string, int start, int* last ); // char* a_get_inside_002 ( char* all_string, int start, int* last ) { char* string = char_string(255); *last = 255; return string; }…

3d: windows-make: allocation blocks as float*

the execution is allocation sized 4. --- execution 001 ---|0221DE60||0221DE64||0221DE68||0221DE6C||0221DE70||0221DE74||0221DE78||0221DE7C||0221DE80||0221DE84||0221DE88||0221DE8C||0221DE90||0221DE94||0221DE98|...--- execution 001 --- * int …

3d: windows-make: The way we are.

malloc:int 4 bytes:int* 8 bytes: *(width) x (height) Lesser is well on the memory:On the picture grid, when we puls 1 as (+width) if we use the single array. willinglytranslate.blogspot.com The differnces of Creation of buffer:************…

CodeAnalyzer: html: Memorization is well.

Memorization is well:html_string: (all string)p_dummy: p|005A0FC8|:dummy_ary[1]=|<p>&|a_html->inside: p|005A10B8|:dummy_ary[2]=|p| *html_count++: increment a pointer address:(*html_count)++: increment a value: --- b_html |5902416| b_html_coun</p>…

CodeAnalyzer: windows-make: Memorization is well for the analyzer.

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 le…

CodeAnalyzer : windows-make: We create the function for the read well.

We create the function for the read a file all at once.The process is improved fast. ---> .\winmain_001.exeint main ( int argc, char** argv ) starts.int read_html_tag_002(char* filename ) starts.read_all_003 starts.read_all_003 ends.|00377…

CodeAnalyzer: html: modified: m_concat and read_all_002 are modified.

1 m_concat 10/14 modified 2 read_all_002 10/14 modified * is well like the below: char* m_concat( char *head, char *tail ) { ... nh = array_count( head ); // return -1 if head is null. nt = array_count( tail ); if ( nh < 0 ) nh = 0; if ( n…