{"id":442,"date":"2025-03-23T02:51:54","date_gmt":"2025-03-23T02:51:54","guid":{"rendered":"https:\/\/news.techjunior.vn\/?p=442"},"modified":"2025-03-23T02:51:54","modified_gmt":"2025-03-23T02:51:54","slug":"%f0%9f%9a%80-quan-ly-bo-nho-trong-c-hieu-ro-de-viet-code-hieu-qua-%f0%9f%92%bb","status":"publish","type":"post","link":"https:\/\/news.techjunior.vn\/?p=442","title":{"rendered":"\ud83d\ude80 QU\u1ea2N L\u00dd B\u1ed8 NH\u1eda TRONG C \u2013 HI\u1ec2U R\u00d5 \u0110\u1ec2 VI\u1ebeT CODE HI\u1ec6U QU\u1ea2 \ud83d\udcbb"},"content":{"rendered":"
\n
\"\"<\/figure>\n<\/div>\n\n\n

\ud83d\udccc Gi\u1edbi thi\u1ec7u<\/strong><\/h2>\n\n\n\n

Ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh C cho ph\u00e9p l\u1eadp tr\u00ecnh vi\u00ean qu\u1ea3n l\u00fd b\u1ed9 nh\u1edb m\u1ed9t c\u00e1ch linh ho\u1ea1t<\/strong>, nh\u01b0ng c\u0169ng \u0111i k\u00e8m v\u1edbi r\u1ee7i ro n\u1ebfu kh\u00f4ng qu\u1ea3n l\u00fd t\u1ed1t<\/strong>. N\u1ebfu b\u1ea1n t\u1eebng g\u1eb7p l\u1ed7i memory leak, segmentation fault, ho\u1eb7c buffer overflow<\/strong>, th\u00ec \u0111\u00e2y ch\u00ednh l\u00e0 b\u00e0i vi\u1ebft gi\u00fap b\u1ea1n hi\u1ec3u r\u00f5 c\u00e1ch qu\u1ea3n l\u00fd b\u1ed9 nh\u1edb hi\u1ec7u qu\u1ea3 trong C<\/strong>.<\/p>\n\n\n\n

\ud83d\udca1 N\u1ed9i dung b\u00e0i vi\u1ebft n\u00e0y:<\/strong>
\u2705 C\u1ea5u tr\u00fac b\u1ed9 nh\u1edb c\u1ee7a ch\u01b0\u01a1ng tr\u00ecnh C
\u2705 C\u00e1ch c\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb t\u0129nh v\u00e0 \u0111\u1ed9ng
\u2705 H\u00e0m malloc(), calloc(), realloc() v\u00e0 free()
\u2705 C\u00e1c l\u1ed7i ph\u1ed5 bi\u1ebfn khi qu\u1ea3n l\u00fd b\u1ed9 nh\u1edb
\u2705 K\u1ef9 thu\u1eadt t\u1ed1i \u01b0u v\u00e0 c\u00f4ng c\u1ee5 ki\u1ec3m tra b\u1ed9 nh\u1edb<\/p>\n\n\n\n

\n\n\n\n

\ud83d\udccc 1. C\u1ea5u Tr\u00fac B\u1ed9 Nh\u1edb C\u1ee7a Ch\u01b0\u01a1ng Tr\u00ecnh C<\/strong><\/h2>\n\n\n\n

Trong C, b\u1ed9 nh\u1edb c\u1ee7a m\u1ed9t ch\u01b0\u01a1ng tr\u00ecnh \u0111\u01b0\u1ee3c chia th\u00e0nh c\u00e1c v\u00f9ng ch\u00ednh sau:<\/strong><\/p>\n\n\n\n

\ud83d\udd39 1.1. V\u00f9ng Text (Code Segment)<\/strong><\/h3>\n\n\n\n
    \n
  • Ch\u1ee9a m\u00e3 m\u00e1y c\u1ee7a ch\u01b0\u01a1ng tr\u00ecnh<\/strong> (c\u00e1c l\u1ec7nh th\u1ef1c thi).<\/li>\n\n\n\n
  • Th\u01b0\u1eddng ch\u1ec9 \u0111\u1ecdc (read-only)<\/strong> \u0111\u1ec3 tr\u00e1nh ghi \u0111\u00e8 ng\u1eabu nhi\u00ean.<\/li>\n<\/ul>\n\n\n\n

    \ud83d\udd39 1.2. V\u00f9ng Data Segment<\/strong><\/h3>\n\n\n\n
      \n
    • Ch\u1ee9a c\u00e1c bi\u1ebfn to\u00e0n c\u1ee5c (global)<\/strong> v\u00e0 bi\u1ebfn t\u0129nh (static)<\/strong>.<\/li>\n\n\n\n
    • Chia l\u00e0m hai ph\u1ea7n:\n
        \n
      • .data<\/strong> \u2013 ch\u1ee9a bi\u1ebfn to\u00e0n c\u1ee5c kh\u1edfi t\u1ea1o gi\u00e1 tr\u1ecb.<\/li>\n\n\n\n
      • .bss<\/strong> \u2013 ch\u1ee9a bi\u1ebfn to\u00e0n c\u1ee5c ch\u01b0a kh\u1edfi t\u1ea1o.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n

        \ud83d\udd39 1.3. V\u00f9ng Stack \u2013 D\u00f9ng Cho Bi\u1ebfn C\u1ee5c B\u1ed9 & L\u1eddi G\u1ecdi H\u00e0m<\/strong><\/h3>\n\n\n\n
          \n
        • Ch\u1ee9a bi\u1ebfn c\u1ee5c b\u1ed9<\/strong> v\u00e0 con tr\u1ecf tr\u1ea3 v\u1ec1 t\u1eeb h\u00e0m<\/strong>.<\/li>\n\n\n\n
        • LIFO (Last In, First Out).<\/li>\n\n\n\n
        • D\u1ec5 b\u1ecb l\u1ed7i stack overflow<\/strong> n\u1ebfu d\u00f9ng qu\u00e1 nhi\u1ec1u b\u1ed9 nh\u1edb.<\/li>\n<\/ul>\n\n\n\n

          \ud83d\udd39 1.4. V\u00f9ng Heap \u2013 D\u00f9ng Cho C\u1ea5p Ph\u00e1t \u0110\u1ed9ng<\/strong><\/h3>\n\n\n\n
            \n
          • D\u00f9ng \u0111\u1ec3 c\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb \u0111\u1ed9ng b\u1eb1ng malloc()<\/code>, calloc()<\/code>, realloc()<\/code>.<\/li>\n\n\n\n
          • C\u1ea7n gi\u1ea3i ph\u00f3ng th\u1ee7 c\u00f4ng b\u1eb1ng free()<\/code> \u0111\u1ec3 tr\u00e1nh memory leak<\/strong>.<\/li>\n<\/ul>\n\n\n\n

            \ud83d\udccc T\u00f3m t\u1eaft c\u1ea5u tr\u00fac b\u1ed9 nh\u1edb:<\/strong><\/p>\n\n\n\n

            V\u00f9ng b\u1ed9 nh\u1edb<\/th>N\u1ed9i dung<\/th><\/tr><\/thead>
            Code<\/td>Ch\u1ee9a m\u00e3 m\u00e1y c\u1ee7a ch\u01b0\u01a1ng tr\u00ecnh<\/td><\/tr>
            Data<\/td>Ch\u1ee9a bi\u1ebfn to\u00e0n c\u1ee5c & static<\/td><\/tr>
            Stack<\/td>Bi\u1ebfn c\u1ee5c b\u1ed9 & l\u1eddi g\u1ecdi h\u00e0m<\/td><\/tr>
            Heap<\/td>D\u00f9ng \u0111\u1ec3 c\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb \u0111\u1ed9ng<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
            \n\n\n\n

            \ud83d\udccc 2. C\u00e1c V\u00ed D\u1ee5 C\u1ee5 Th\u1ec3<\/strong><\/h2>\n\n\n\n

            \ud83d\udccc V\u00ed d\u1ee5 1: C\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb \u0111\u1ed9ng b\u1eb1ng malloc() v\u00e0 free()<\/strong><\/h3>\n\n\n\n
            #include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n    int *ptr;\n    ptr = (int*) malloc(5 * sizeof(int)); \/\/ C\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb cho 5 s\u1ed1 nguy\u00ean\n    if (ptr == NULL) {\n        printf(\"C\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb th\u1ea5t b\u1ea1i!\\n\");\n        return 1;\n    }\n    for (int i = 0; i < 5; i++) {\n        ptr[i] = i * 2;\n        printf(\"%d \", ptr[i]);\n    }\n    free(ptr); \/\/ Gi\u1ea3i ph\u00f3ng b\u1ed9 nh\u1edb sau khi s\u1eed d\u1ee5ng\n    return 0;\n}\n<\/code><\/pre>\n\n\n\n
            \ud83d\udccc Gi\u1ea3i th\u00edch:<\/strong><\/p>\n\n\n\n
              \n
            • malloc()<\/code> c\u1ea5p ph\u00e1t v\u00f9ng nh\u1edb \u0111\u1ee7 \u0111\u1ec3 ch\u1ee9a 5 s\u1ed1 nguy\u00ean.<\/li>\n\n\n\n
            • Ki\u1ec3m tra n\u1ebfu malloc()<\/code> tr\u1ea3 v\u1ec1 NULL<\/code> th\u00ec c\u1ea5p ph\u00e1t th\u1ea5t b\u1ea1i.<\/li>\n\n\n\n
            • Sau khi s\u1eed d\u1ee5ng, ph\u1ea3i d\u00f9ng free()<\/code> \u0111\u1ec3 tr\u00e1nh memory leak.<\/li>\n<\/ul>\n\n\n\n
              \n\n\n\n
              \ud83d\udccc V\u00ed d\u1ee5 2: C\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb b\u1eb1ng calloc()<\/strong><\/h3>\n\n\n\n
              #include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n    int *ptr = (int*) calloc(5, sizeof(int));\n    if (ptr == NULL) {\n        printf(\"C\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb th\u1ea5t b\u1ea1i!\\n\");\n        return 1;\n    }\n    for (int i = 0; i < 5; i++) {\n        printf(\"%d \", ptr[i]); \/\/ Gi\u00e1 tr\u1ecb m\u1eb7c \u0111\u1ecbnh l\u00e0 0\n    }\n    free(ptr);\n    return 0;\n}\n<\/code><\/pre>\n\n\n\n
              \ud83d\udccc S\u1ef1 kh\u00e1c bi\u1ec7t so v\u1edbi malloc()<\/code>:<\/strong><\/p>\n\n\n\n
                \n
              • calloc()<\/code> kh\u00f4ng ch\u1ec9 c\u1ea5p ph\u00e1t m\u00e0 c\u00f2n kh\u1edfi t\u1ea1o t\u1ea5t c\u1ea3 ph\u1ea7n t\u1eed v\u1ec1 0<\/strong>.<\/li>\n<\/ul>\n\n\n\n
                \n\n\n\n
                \ud83d\udccc V\u00ed d\u1ee5 3: S\u1eed d\u1ee5ng realloc() \u0111\u1ec3 thay \u0111\u1ed5i k\u00edch th\u01b0\u1edbc v\u00f9ng nh\u1edb<\/strong><\/h3>\n\n\n\n
                #include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n    int *ptr = (int*) malloc(2 * sizeof(int));\n    ptr[0] = 10; ptr[1] = 20;\n    ptr = (int*) realloc(ptr, 4 * sizeof(int)); \/\/ M\u1edf r\u1ed9ng b\u1ed9 nh\u1edb\n    ptr[2] = 30; ptr[3] = 40;\n    for (int i = 0; i < 4; i++) {\n        printf(\"%d \", ptr[i]);\n    }\n    free(ptr);\n    return 0;\n}\n<\/code><\/pre>\n\n\n\n
                \ud83d\udccc L\u01b0u \u00fd:<\/strong><\/p>\n\n\n\n
                  \n
                • realloc()<\/code> c\u00f3 th\u1ec3 m\u1edf r\u1ed9ng ho\u1eb7c thu nh\u1ecf b\u1ed9 nh\u1edb \u0111\u00e3 c\u1ea5p ph\u00e1t tr\u01b0\u1edbc \u0111\u00f3.<\/li>\n\n\n\n
                • N\u1ebfu realloc()<\/code> th\u1ea5t b\u1ea1i, n\u00f3 tr\u1ea3 v\u1ec1 NULL<\/code>, c\u1ea7n ki\u1ec3m tra \u0111\u1ec3 tr\u00e1nh l\u1ed7i.<\/li>\n<\/ul>\n\n\n\n
                  \n\n\n\n
                  \ud83d\udccc M\u1ed9t s\u1ed1 l\u1ed7i ph\u1ed5 bi\u1ebfn v\u00e0 c\u00e1ch kh\u1eafc ph\u1ee5c<\/strong><\/h3>\n\n\n\n
                  L\u1ed7i<\/th>Nguy\u00ean nh\u00e2n<\/th>C\u00e1ch kh\u1eafc ph\u1ee5c<\/th><\/tr><\/thead>
                  Memory Leak<\/td>Kh\u00f4ng d\u00f9ng free()<\/code> sau khi malloc()<\/code> ho\u1eb7c calloc()<\/code><\/td>Lu\u00f4n gi\u1ea3i ph\u00f3ng b\u1ed9 nh\u1edb khi kh\u00f4ng d\u00f9ng n\u1eefa<\/td><\/tr>
                  Segmentation Fault<\/td>Truy xu\u1ea5t v\u00f9ng nh\u1edb kh\u00f4ng h\u1ee3p l\u1ec7<\/td>Ki\u1ec3m tra \u0111\u1ecba ch\u1ec9 con tr\u1ecf tr\u01b0\u1edbc khi s\u1eed d\u1ee5ng<\/td><\/tr>
                  Dangling Pointer<\/td>Gi\u1ea3i ph\u00f3ng b\u1ed9 nh\u1edb nh\u01b0ng v\u1eabn s\u1eed d\u1ee5ng con tr\u1ecf c\u0169<\/td>G\u00e1n con tr\u1ecf v\u1ec1 NULL<\/code> sau khi free()<\/code><\/td><\/tr>
                  Buffer Overflow<\/td>Ghi d\u1eef li\u1ec7u v\u01b0\u1ee3t qu\u00e1 k\u00edch th\u01b0\u1edbc m\u1ea3ng<\/td>Ki\u1ec3m tra ch\u1ec9 s\u1ed1 tr\u01b0\u1edbc khi truy c\u1eadp<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
                  \n\n\n\n
                  \ud83d\udccc C\u00f4ng c\u1ee5 ki\u1ec3m tra l\u1ed7i b\u1ed9 nh\u1edb<\/strong><\/h3>\n\n\n\n
                  \u2705 Valgrind<\/strong> \u2013 D\u00f9ng \u0111\u1ec3 ph\u00e1t hi\u1ec7n memory leak.
                  \u2705 AddressSanitizer (ASan)<\/strong> \u2013 H\u1eefu \u00edch \u0111\u1ec3 ph\u00e1t hi\u1ec7n l\u1ed7i truy c\u1eadp b\u1ed9 nh\u1edb.
                  \u2705 gdb (GNU Debugger)<\/strong> \u2013 Gi\u00fap debug l\u1ed7i li\u00ean quan \u0111\u1ebfn con tr\u1ecf v\u00e0 b\u1ed9 nh\u1edb.<\/p>\n\n\n\n
                  \n\n\n\n
                  \ud83c\udfaf T\u00f3m T\u1eaft<\/strong><\/h2>\n\n\n\n
                    \n
                  • Qu\u1ea3n l\u00fd b\u1ed9 nh\u1edb hi\u1ec7u qu\u1ea3<\/strong> gi\u00fap tr\u00e1nh l\u1ed7i v\u00e0 t\u1ed1i \u01b0u hi\u1ec7u su\u1ea5t ch\u01b0\u01a1ng tr\u00ecnh.<\/li>\n\n\n\n
                  • S\u1eed d\u1ee5ng \u0111\u00fang c\u00e1ch malloc()<\/code>, calloc()<\/code>, realloc()<\/code> v\u00e0 free()<\/code>.<\/li>\n\n\n\n
                  • Tr\u00e1nh c\u00e1c l\u1ed7i ph\u1ed5 bi\u1ebfn nh\u01b0 memory leak, buffer overflow.<\/li>\n\n\n\n
                  • D\u00f9ng c\u00e1c c\u00f4ng c\u1ee5 ki\u1ec3m tra \u0111\u1ec3 ph\u00e1t hi\u1ec7n l\u1ed7i s\u1edbm.<\/li>\n<\/ul>\n\n\n\n
                    \ud83d\udca1 N\u1eafm v\u1eefng ki\u1ebfn th\u1ee9c n\u00e0y s\u1ebd gi\u00fap b\u1ea1n vi\u1ebft code an to\u00e0n, hi\u1ec7u qu\u1ea3 v\u00e0 t\u1ed1i \u01b0u h\u01a1n trong C!<\/strong> \ud83d\ude80<\/p>\n","protected":false},"excerpt":{"rendered":"
                    \ud83d\udccc Gi\u1edbi thi\u1ec7u Ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh C cho ph\u00e9p l\u1eadp tr\u00ecnh vi\u00ean qu\u1ea3n l\u00fd b\u1ed9 nh\u1edb m\u1ed9t c\u00e1ch linh ho\u1ea1t, nh\u01b0ng c\u0169ng \u0111i k\u00e8m v\u1edbi r\u1ee7i ro n\u1ebfu kh\u00f4ng qu\u1ea3n l\u00fd…<\/p>\n","protected":false},"author":6,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-442","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/posts\/442","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=442"}],"version-history":[{"count":1,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/posts\/442\/revisions"}],"predecessor-version":[{"id":444,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/posts\/442\/revisions\/444"}],"wp:attachment":[{"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=442"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=442"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=442"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}