{"id":33824,"date":"2025-11-07T15:31:13","date_gmt":"2025-11-07T12:31:13","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/"},"modified":"2025-11-07T15:31:13","modified_gmt":"2025-11-07T12:31:13","slug":"ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/","title":{"rendered":"C++&#8217;taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131"},"content":{"rendered":"<p>C++ d\u00fcnyas\u0131nda yolculu\u011fa \u00e7\u0131kan her geli\u015ftirici, bir noktada dilin kendine has \u00f6zellikleriyle y\u00fczle\u015fir ve &#8220;Bunu beklemiyordum!&#8221; nidalar\u0131yla kar\u015f\u0131la\u015f\u0131r. G\u00fc\u00e7l\u00fc performans\u0131 ve d\u00fc\u015f\u00fck seviye kontrol yetene\u011fiyle \u00f6ne \u00e7\u0131kan C++, bazen de tahmin edilemez davran\u0131\u015flar sergileyebilir. Bu makalede, C++&#8217;\u0131n s\u0131kl\u0131kla kar\u015f\u0131m\u0131za \u00e7\u0131kard\u0131\u011f\u0131, deneyimli geli\u015ftiricileri bile \u015fa\u015f\u0131rtabilen bu &#8220;s\u00fcrprizleri&#8221; mercek alt\u0131na al\u0131yor, \u00f6zellikle tan\u0131ms\u0131z davran\u0131\u015flar\u0131n (Undefined Behavior) perde arkas\u0131n\u0131 ayd\u0131nlat\u0131yor ve bu tuzaklardan nas\u0131l ka\u00e7\u0131nabilece\u011finizi ad\u0131m ad\u0131m inceliyoruz.<\/p>\n<p>C++, performansa odakl\u0131 ve donan\u0131ma yak\u0131n \u00e7al\u0131\u015fan bir dil olarak \u00f6ne \u00e7\u0131kar. Bellek y\u00f6netimi, kaynak tahsisi ve i\u015flemci optimizasyonlar\u0131 \u00fczerinde tam kontrol sunmas\u0131, onu oyun motorlar\u0131ndan i\u015fletim sistemlerine, finansal uygulamalardan g\u00f6m\u00fcl\u00fc sistemlere kadar bir\u00e7ok alanda vazge\u00e7ilmez k\u0131lar. Ancak bu b\u00fcy\u00fck g\u00fc\u00e7, beraberinde b\u00fcy\u00fck sorumluluklar\u0131 da getirir. C++&#8217;\u0131n karma\u015f\u0131k yap\u0131s\u0131 ve standartlar\u0131n\u0131n belirli durumlar i\u00e7in tan\u0131ms\u0131z davran\u0131\u015flara (Undefined Behavior &#8211; UB) yer vermesi, geli\u015ftiricilerin en b\u00fcy\u00fck kabuslar\u0131ndan biridir. Bir kod blo\u011funun farkl\u0131 derleyicilerde, farkl\u0131 platformlarda veya farkl\u0131 optimizasyon seviyelerinde tamamen farkl\u0131 sonu\u00e7lar \u00fcretmesi, tahmin edilemez hatalara ve saatlerce s\u00fcren hata ay\u0131klama s\u00fcre\u00e7lerine yol a\u00e7abilir.<\/p>\n<p>Peki, bu &#8220;s\u00fcrprizler&#8221; tam olarak nedir ve neden ortaya \u00e7\u0131karlar? Genellikle, C++ standartlar\u0131n\u0131n belirli durumlarda ne olaca\u011f\u0131n\u0131 garanti etmemesinden kaynaklan\u0131rlar. Bu belirsizlik, derleyicilere performans ad\u0131na b\u00fcy\u00fck bir serbestlik tan\u0131r. \u00d6rne\u011fin, bir bellek adresine s\u0131n\u0131rlar\u0131n d\u0131\u015f\u0131nda eri\u015fmek, okunmam\u0131\u015f bir de\u011fi\u015fkeni kullanmak veya ge\u00e7ersiz bir i\u015faret\u00e7iyi (pointer) dereference etmek gibi eylemler tan\u0131ms\u0131z davran\u0131\u015fa yol a\u00e7ar. Bu t\u00fcr durumlar, program\u0131n\u0131z\u0131n \u00e7\u00f6kmesine, do\u011fru olmayan sonu\u00e7lar \u00fcretmesine veya hatta g\u00f6r\u00fcn\u00fc\u015fte do\u011fru \u00e7al\u0131\u015f\u0131yormu\u015f gibi yaparak daha sinsi hatalar\u0131 gizlemesine neden olabilir. Bir geli\u015ftiricinin kodunun bir anda farkl\u0131 davranmaya ba\u015flamas\u0131, en deneyimli m\u00fchendisler i\u00e7in bile ciddi bir \u015fa\u015fk\u0131nl\u0131k kayna\u011f\u0131 olabilir. Bu b\u00f6l\u00fcmde, C++&#8217;\u0131n bu y\u00f6n\u00fcn\u00fc derinlemesine anlamak ve bu t\u00fcr s\u00fcrprizlerle kar\u015f\u0131la\u015fma s\u0131kl\u0131\u011f\u0131n\u0131 en aza indirmek i\u00e7in temel bilgileri edinece\u011fiz.<\/p>\n<h2>C++&#8217;\u0131n Kalbindeki Belirsizlik: Tan\u0131ms\u0131z Davran\u0131\u015f (Undefined Behavior) Nedir ve Nas\u0131l \u0130\u015fler?<\/h2>\n<p>C++&#8217;taki en b\u00fcy\u00fck s\u00fcrpriz kaynaklar\u0131ndan biri \u015f\u00fcphesiz Tan\u0131ms\u0131z Davran\u0131\u015f (Undefined Behavior) kavram\u0131d\u0131r. Ad\u0131ndan da anla\u015f\u0131laca\u011f\u0131 gibi, bu, C++ standard\u0131n\u0131n belirli bir durum i\u00e7in herhangi bir davran\u0131\u015f garanti etmedi\u011fi anlam\u0131na gelir. Yani, bu t\u00fcr bir durumla kar\u015f\u0131la\u015f\u0131ld\u0131\u011f\u0131nda program\u0131n\u0131z\u0131n ne yapaca\u011f\u0131 tamamen belirsizdir: \u00e7\u00f6kebilir, garip de\u011ferler d\u00f6nd\u00fcrebilir, do\u011fruymu\u015f gibi davranabilir ancak arkada veri bozulmalar\u0131na neden olabilir veya hatta hi\u00e7 beklenmedik bir \u015fekilde \u00e7al\u0131\u015fmaya devam edebilir. Bu belirsizlik, derleyici geli\u015ftiricilerine \u00f6nemli bir optimizasyon alan\u0131 sunar. Derleyiciler, tan\u0131ms\u0131z davran\u0131\u015f i\u00e7eren kod par\u00e7alar\u0131n\u0131 optimize ederken, programc\u0131n\u0131n bu davran\u0131\u015fa asla yol a\u00e7mayaca\u011f\u0131n\u0131 varsayma \u00f6zg\u00fcrl\u00fc\u011f\u00fcne sahiptir.<\/p>\n<p>Tan\u0131ms\u0131z davran\u0131\u015f\u0131n arkas\u0131ndaki temel felsefe, C++&#8217;\u0131n &#8220;as-if&#8221; kural\u0131d\u0131r. Derleyici, program\u0131n d\u0131\u015far\u0131dan g\u00f6zlemlenebilen davran\u0131\u015f\u0131n\u0131 de\u011fi\u015ftirmemek kayd\u0131yla, istedi\u011fi her t\u00fcrl\u00fc optimizasyonu yapabilir. Ancak tan\u0131ms\u0131z davran\u0131\u015f durumlar\u0131nda, d\u0131\u015far\u0131dan g\u00f6zlemlenebilen bir davran\u0131\u015f da garanti edilmedi\u011fi i\u00e7in, derleyicinin neredeyse s\u0131n\u0131rs\u0131z bir alan\u0131 vard\u0131r. \u00d6rne\u011fin, ba\u015flat\u0131lmam\u0131\u015f bir de\u011fi\u015fkeni okumak, bir diziye s\u0131n\u0131rlar\u0131n\u0131n d\u0131\u015f\u0131ndan eri\u015fmek, <code>null<\/code> bir i\u015faret\u00e7iyi dereference etmek veya i\u015faret\u00e7i aritmeti\u011fi ile ge\u00e7erli bir bellek blo\u011funun d\u0131\u015f\u0131na \u00e7\u0131kmak, tan\u0131ms\u0131z davran\u0131\u015f\u0131n yayg\u0131n \u00f6rnekleridir. Bu durumlar, kodunuzun bir g\u00fcn sorunsuz \u00e7al\u0131\u015f\u0131rken, ertesi g\u00fcn farkl\u0131 bir derleyici versiyonu, farkl\u0131 bir i\u015fletim sistemi veya hatta farkl\u0131 bir optimizasyon bayra\u011f\u0131yla tamamen par\u00e7alanmas\u0131na neden olabilir.<\/p>\n<div class=\"expert-tip\">\n  Uzman \u0130pucu: Tan\u0131ms\u0131z davran\u0131\u015f, genellikle sessizce ba\u015flar. \u0130lk ba\u015fta belirgin bir hata vermeyebilir, ancak zamanla sinsi veri bozulmalar\u0131na veya aral\u0131kl\u0131 \u00e7\u00f6kmelere yol a\u00e7arak hata ay\u0131klamay\u0131 son derece zorla\u015ft\u0131rabilir. Bu y\u00fczden en iyi yakla\u015f\u0131m, her zaman UB&#8217;den ka\u00e7\u0131nmakt\u0131r.\n<\/div>\n<p>Bir vaka analizi olarak, ba\u015flang\u0131\u00e7ta de\u011fer atanmam\u0131\u015f bir tamsay\u0131 de\u011fi\u015fkeni d\u00fc\u015f\u00fcnelim:<\/p>\n<pre><code>\nint main() {\n    int x; \/\/ x de\u011fi\u015fkenine ba\u015flang\u0131\u00e7 de\u011feri atanmad\u0131\n    if (x > 0) {\n        \/\/ Bu blo\u011fa girip girmeyece\u011fi tan\u0131ms\u0131zd\u0131r\n        \/\/ x'in de\u011feri \u00e7\u00f6p bellekten gelir.\n        std::cout << \"x pozitif!\" << std::endl;\n    }\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p>Yukar\u0131daki kod par\u00e7as\u0131nda, <code>x<\/code> de\u011fi\u015fkeni ba\u015flat\u0131lmad\u0131\u011f\u0131 i\u00e7in de\u011feri belirsizdir. Bu, <code>if (x > 0)<\/code> ko\u015fulunun hangi durumda do\u011fru veya yanl\u0131\u015f olaca\u011f\u0131n\u0131n garantisi olmad\u0131\u011f\u0131 anlam\u0131na gelir. Derleyici, <code>x<\/code>'in ne oldu\u011funu bilmedi\u011fi i\u00e7in, bu ko\u015fulu optimize ederken \u00f6ng\u00f6r\u00fclemez davran\u0131\u015flar sergileyebilir. Baz\u0131 derleyiciler bu blo\u011fu tamamen atlayabilir, baz\u0131lar\u0131 rastgele de\u011ferlerle kar\u015f\u0131la\u015ft\u0131rabilir. \u0130\u015fte bu y\u00fczden C++ geli\u015ftiricileri, kodlar\u0131n\u0131 her zaman deterministik ve tan\u0131ms\u0131z davran\u0131\u015f i\u00e7ermeyecek \u015fekilde yazmaya \u00f6zen g\u00f6stermelidirler. Bu, bellek ve kaynak y\u00f6netiminde modern C++ \u00f6zelliklerini kullanarak daha g\u00fcvenli kodlar yazma pratikleriyle ba\u015flar.<\/p>\n<h2>Ger\u00e7ek D\u00fcnya Senaryolar\u0131: Tan\u0131ms\u0131z Davran\u0131\u015f Kurban\u0131 Olmamak \u0130\u00e7in Neler Yapmal\u0131?<\/h2>\n<p>Tan\u0131ms\u0131z davran\u0131\u015f (UB) sadece teorik bir kavram de\u011fil, ger\u00e7ek d\u00fcnya yaz\u0131l\u0131mlar\u0131nda s\u0131k\u00e7a rastlanan ve ciddi sorunlara yol a\u00e7an bir olgudur. Bu b\u00f6l\u00fcmde, C++ projelerinde s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan baz\u0131 UB senaryolar\u0131n\u0131 ve bunlardan nas\u0131l ka\u00e7\u0131nabilece\u011finizi ad\u0131m ad\u0131m ele alaca\u011f\u0131z.<\/p>\n<h3>Ba\u015flat\u0131lmam\u0131\u015f De\u011fi\u015fkenler: Gizli Bir Tehlike<\/h3>\n<p>En yayg\u0131n UB kaynaklar\u0131ndan biri, ba\u015flat\u0131lmam\u0131\u015f (uninitialized) de\u011fi\u015fkenleri kullanmakt\u0131r. Bir de\u011fi\u015fkeni tan\u0131mlad\u0131\u011f\u0131n\u0131zda ancak ona bir ba\u015flang\u0131\u00e7 de\u011feri atamad\u0131\u011f\u0131n\u0131zda, de\u011fi\u015fken bellekten rastgele (\"\u00e7\u00f6p\") bir de\u011fer al\u0131r. Bu de\u011feri okumak veya kullanmak tan\u0131ms\u0131z davran\u0131\u015fa yol a\u00e7ar.<\/p>\n<pre><code>\n#include <iostream>\n#include <vector>\n\nint main() {\n    int sayi; \/\/ sayi de\u011fi\u015fkeni ba\u015flat\u0131lmad\u0131\n\n    \/\/ Bu if blo\u011funa girip girmeyece\u011fi veya ne sonu\u00e7 verece\u011fi tan\u0131ms\u0131zd\u0131r.\n    \/\/ 'sayi' bellekten rastgele bir de\u011fer i\u00e7erir.\n    if (sayi > 0) {\n        std::cout << \"Sayi pozitif: \" << sayi << std::endl;\n    } else {\n        std::cout << \"Sayi pozitif degil veya belirsiz: \" << sayi << std::endl;\n    }\n\n    \/\/ Modern C++'ta bu sorun basit\u00e7e \u00e7\u00f6z\u00fclebilir:\n    int baslatilmisSayi = 0; \/\/ Her zaman ba\u015flang\u0131\u00e7 de\u011feri atay\u0131n\n    std::cout << \"Ba\u015flat\u0131lm\u0131\u015f sayi: \" << baslatilmisSayi << std::endl;\n\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p>Yukar\u0131daki \u00f6rnekte, <code>sayi<\/code> de\u011fi\u015fkeninin de\u011feri derlemeden derlemeye, \u00e7al\u0131\u015ft\u0131rmadan \u00e7al\u0131\u015ft\u0131rmaya de\u011fi\u015febilir ve bu da program\u0131n\u0131z\u0131n \u00f6ng\u00f6r\u00fclemez davranmas\u0131na neden olur. <strong>\u00c7\u00f6z\u00fcm:<\/strong> Her zaman de\u011fi\u015fkenlerinize ba\u015flang\u0131\u00e7 de\u011feri atay\u0131n veya varsay\u0131lan de\u011ferleri otomatik olarak atayan RAII (Resource Acquisition Is Initialization) prensibine uygun s\u0131n\u0131flar kullan\u0131n.<\/p>\n<h3>\u0130\u015faret\u00e7i Ge\u00e7ersizle\u015ftirme (Iterator Invalidation) ve Dizilerin D\u0131\u015f\u0131na \u00c7\u0131kma<\/h3>\n<p><code>std::vector<\/code> gibi dinamik boyutlu kaplarda eleman ekleme veya \u00e7\u0131karma i\u015flemleri, mevcut i\u015faret\u00e7ileri veya iterat\u00f6rleri ge\u00e7ersiz k\u0131labilir. Ge\u00e7ersiz bir iterat\u00f6r\u00fc kullanmaya \u00e7al\u0131\u015fmak da UB'dir.<\/p>\n<pre><code>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nint main() {\n    std::vector<int> sayilar = {1, 2, 3, 4, 5};\n    \n    \/\/ YANLI\u015e YAKLA\u015eIM: D\u00f6ng\u00fc i\u00e7inde eleman silmek iterat\u00f6r\u00fc ge\u00e7ersiz k\u0131lar\n    \/\/ Bu kod tan\u0131ms\u0131z davran\u0131\u015fa yol a\u00e7abilir!\n    \/\/ for (auto it = sayilar.begin(); it != sayilar.end(); ++it) {\n    \/\/     if (*it % 2 == 0) {\n    \/\/         sayilar.erase(it); \/\/ 'it' art\u0131k ge\u00e7ersiz!\n    \/\/     }\n    \/\/ }\n\n    std::cout << \"Orijinal vector: \";\n    for (int n : sayilar) {\n        std::cout << n << \" \";\n    }\n    std::cout << std::endl;\n\n    \/\/ DO\u011eRU YAKLA\u015eIM: Erase-remove idiyomunu kullanmak veya dikkatli iterat\u00f6r g\u00fcncellemesi yapmak\n    \/\/ Veya C++11 sonras\u0131 erase-remove-if kullanmak\n    auto yeni_son = std::remove_if(sayilar.begin(), sayilar.end(), \n                                   [](int n){ return n % 2 == 0; });\n    sayilar.erase(yeni_son, sayilar.end());\n\n    std::cout << \"\u00c7ift say\u0131lar silindikten sonra: \";\n    for (int n : sayilar) {\n        std::cout << n << \" \";\n    }\n    std::cout << std::endl;\n\n    \/\/ Dizi s\u0131n\u0131rlar\u0131 d\u0131\u015f\u0131na eri\u015fim:\n    \/\/ sayilar[10]; \/\/ E\u011fer vector boyutu 10'dan k\u00fc\u00e7\u00fckse UB!\n    \/\/ sayilar.at(10); \/\/ Bu hata f\u0131rlat\u0131r, UB de\u011fil. Daha g\u00fcvenli.\n\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p>Yukar\u0131daki <code>std::vector<\/code> \u00f6rne\u011finde, <code>erase<\/code> i\u015flemi sonras\u0131 <code>it<\/code> iterat\u00f6r\u00fc ge\u00e7ersiz hale gelir. E\u011fer <code>++it<\/code> ile devam ederseniz, ge\u00e7ersiz bir iterat\u00f6r\u00fc kullanm\u0131\u015f olursunuz, bu da tan\u0131ms\u0131z davran\u0131\u015ft\u0131r. <strong>\u00c7\u00f6z\u00fcm:<\/strong> <code>erase-remove<\/code> idiyomunu kullan\u0131n, <code>std::remove_if<\/code> veya <code>erase<\/code>'den d\u00f6nen yeni iterat\u00f6r\u00fc do\u011fru \u015fekilde kullan\u0131n. Ayr\u0131ca, dizilere ve vekt\u00f6rlere eri\u015firken her zaman s\u0131n\u0131rlar\u0131 kontrol edin; <code>at()<\/code> metodu s\u0131n\u0131r d\u0131\u015f\u0131 eri\u015fimde istisna f\u0131rlatarak UB'den ka\u00e7\u0131nman\u0131z\u0131 sa\u011flar.<\/p>\n<h3>Dangling Pointer ve \u00c7ift Silme (Double Free) Sorunlar\u0131<\/h3>\n<p>Bir i\u015faret\u00e7i, i\u015faret etti\u011fi bellek alan\u0131 serbest b\u0131rak\u0131ld\u0131ktan sonra hala mevcutsa, buna \"dangling pointer\" denir. Bu i\u015faret\u00e7iyi kullanmaya \u00e7al\u0131\u015fmak veya bu belle\u011fi tekrar serbest b\u0131rakmaya \u00e7al\u0131\u015fmak (double free) da tan\u0131ms\u0131z davran\u0131\u015ft\u0131r ve genellikle ciddi g\u00fcvenlik a\u00e7\u0131klar\u0131 yarat\u0131r.<\/p>\n<pre><code>\n#include <iostream>\n\nint main() {\n    int* p = new int(10);\n    std::cout << \"De\u011fer: \" << *p << std::endl;\n\n    delete p; \/\/ Bellek serbest b\u0131rak\u0131ld\u0131\n    \/\/ p = nullptr; \/\/ \u0130yi pratik: i\u015faret\u00e7iyi null yap\u0131n\n\n    \/\/ YANLI\u015e: Art\u0131k serbest b\u0131rak\u0131lm\u0131\u015f belle\u011fe eri\u015fim (dangling pointer)\n    \/\/ *p = 20; \/\/ Tan\u0131ms\u0131z davran\u0131\u015f! Program \u00e7\u00f6kebilir veya veri bozulabilir.\n\n    \/\/ YANLI\u015e: Belle\u011fi tekrar serbest b\u0131rakmaya \u00e7al\u0131\u015fmak (double free)\n    \/\/ delete p; \/\/ Tan\u0131ms\u0131z davran\u0131\u015f! Genellikle \u00e7\u00f6k\u00fc\u015fe yol a\u00e7ar.\n\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p><strong>\u00c7\u00f6z\u00fcm:<\/strong> Ak\u0131ll\u0131 i\u015faret\u00e7iler (smart pointers) kullan\u0131n. <code>std::unique_ptr<\/code> ve <code>std::shared_ptr<\/code> RAII prensibini uygulayarak bellek y\u00f6netimini otomatikle\u015ftirir ve bu t\u00fcr hatalar\u0131 b\u00fcy\u00fck \u00f6l\u00e7\u00fcde engeller. E\u011fer ham i\u015faret\u00e7i kullanman\u0131z gerekiyorsa, belle\u011fi serbest b\u0131rakt\u0131ktan sonra i\u015faret\u00e7iyi <code>nullptr<\/code> yapmay\u0131 unutmay\u0131n.<\/p>\n<p>Bu ger\u00e7ek d\u00fcnya senaryolar\u0131, C++'ta tan\u0131ms\u0131z davran\u0131\u015f\u0131n ne kadar sinsi olabilece\u011fini g\u00f6stermektedir. Proaktif olmak ve bu t\u00fcr durumlar\u0131 tetiklemekten ka\u00e7\u0131nmak, istikrarl\u0131 ve g\u00fcvenilir C++ uygulamalar\u0131 geli\u015ftirmenin anahtar\u0131d\u0131r.<\/p>\n<h2>Modern C++ ve Ak\u0131ll\u0131 Puanterler: Bellek Y\u00f6netimindeki Kurtar\u0131c\u0131lar<\/h2>\n<p>C++'\u0131n g\u00fcc\u00fc, do\u011frudan bellek y\u00f6netimi yetene\u011finde yatar, ancak bu ayn\u0131 zamanda bir\u00e7ok \"s\u00fcrprizin\" de kayna\u011f\u0131d\u0131r. Ham i\u015faret\u00e7ilerle \u00e7al\u0131\u015fmak, \u00f6zellikle b\u00fcy\u00fck ve karma\u015f\u0131k projelerde bellek s\u0131z\u0131nt\u0131lar\u0131, dangling pointer'lar ve \u00e7ift serbest b\u0131rakma (double-free) gibi tan\u0131ms\u0131z davran\u0131\u015f risklerini art\u0131r\u0131r. Neyse ki, Modern C++ (C++11 ve sonras\u0131) bu sorunlar\u0131 \u00e7\u00f6zmek i\u00e7in harika ara\u00e7lar sunar: Ak\u0131ll\u0131 \u0130\u015faret\u00e7iler (Smart Pointers). Ak\u0131ll\u0131 i\u015faret\u00e7iler, RAII (Resource Acquisition Is Initialization) ilkesini temel alarak bellek y\u00f6netimini otomatikle\u015ftirir ve geli\u015ftiricilerin y\u00fck\u00fcn\u00fc \u00f6nemli \u00f6l\u00e7\u00fcde hafifletir.<\/p>\n<h3>RAII Prensibi Nedir?<\/h3>\n<p>RAII, bir kayna\u011f\u0131n (bellek, dosya tan\u0131t\u0131c\u0131s\u0131, kilit vb.) \u00f6mr\u00fcn\u00fcn bir nesnenin \u00f6mr\u00fcne ba\u011flanmas\u0131 anlam\u0131na gelir. Bir nesne olu\u015fturuldu\u011funda kaynak tahsis edilir (kurucu metot), nesne yok edildi\u011finde ise kaynak otomatik olarak serbest b\u0131rak\u0131l\u0131r (y\u0131k\u0131c\u0131 metot). Bu sayede, hata durumlar\u0131nda veya istisnalar f\u0131rlat\u0131ld\u0131\u011f\u0131nda bile kaynaklar d\u00fczg\u00fcn bir \u015fekilde y\u00f6netilir ve bellek s\u0131z\u0131nt\u0131lar\u0131 \u00f6nlenir. Ak\u0131ll\u0131 i\u015faret\u00e7iler, bu prensibin bellek y\u00f6netimine uygulanm\u0131\u015f halidir.<\/p>\n<h3>std::unique_ptr: Tek Sahipli\u011fin G\u00fcc\u00fc<\/h3>\n<p><code>std::unique_ptr<\/code>, dinamik olarak tahsis edilmi\u015f bir nesnenin tek bir sahibi olmas\u0131n\u0131 sa\u011flayan bir ak\u0131ll\u0131 i\u015faret\u00e7idir. Sahip olan <code>unique_ptr<\/code> nesnesi kapsam d\u0131\u015f\u0131na \u00e7\u0131kt\u0131\u011f\u0131nda, i\u015faret etti\u011fi bellek otomatik olarak serbest b\u0131rak\u0131l\u0131r. Kopyalanamaz, ancak sahipli\u011fi <code>std::move<\/code> ile ba\u015fka bir <code>unique_ptr<\/code>'a ta\u015f\u0131nabilir. Bu, kaynaklar\u0131n tek elden ve g\u00fcvenli bir \u015fekilde y\u00f6netilmesini garantiler.<\/p>\n<pre><code>\n#include <iostream>\n#include <memory> \/\/ unique_ptr i\u00e7in\n\nclass Kaynak {\npublic:\n    Kaynak() { std::cout << \"Kaynak tahsis edildi.\" << std::endl; }\n    ~Kaynak() { std::cout << \"Kaynak serbest b\u0131rak\u0131ld\u0131.\" << std::endl; }\n    void calis() { std::cout << \"Kaynak \u00e7al\u0131\u015f\u0131yor.\" << std::endl; }\n};\n\nint main() {\n    \/\/ Kaynak otomatik olarak y\u00f6netilir\n    std::unique_ptr<Kaynak> p1 = std::make_unique<Kaynak>(); \n    p1->calis();\n\n    \/\/ Sahiplik ta\u015f\u0131nabilir, kopyalanamaz\n    std::unique_ptr<Kaynak> p2 = std::move(p1); \n    if (p1 == nullptr) {\n        std::cout << \"p1 art\u0131k nullptr'i i\u015faret ediyor.\" << std::endl;\n    }\n    p2->calis();\n\n    \/\/ main'den \u00e7\u0131k\u0131ld\u0131\u011f\u0131nda p2 kapsam d\u0131\u015f\u0131na \u00e7\u0131kar ve Kaynak serbest b\u0131rak\u0131l\u0131r.\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p><code>std::make_unique<\/code> kullanmak, do\u011frudan <code>new<\/code> kullanmaktan daha g\u00fcvenli ve modern bir yakla\u015f\u0131md\u0131r, \u00e7\u00fcnk\u00fc istisna g\u00fcvenli\u011fi sa\u011flar.<\/p>\n<h3>std::shared_ptr: Ortak Sahiplikte Esneklik<\/h3>\n<p><code>std::shared_ptr<\/code>, birden fazla ak\u0131ll\u0131 i\u015faret\u00e7inin ayn\u0131 nesnenin sahipli\u011fini payla\u015fmas\u0131na olanak tan\u0131r. Nesnenin ne zaman serbest b\u0131rak\u0131laca\u011f\u0131na, ka\u00e7 tane <code>shared_ptr<\/code>'\u0131n onu i\u015faret etti\u011fini sayan bir referans sayac\u0131 karar verir. Saya\u00e7 s\u0131f\u0131ra d\u00fc\u015ft\u00fc\u011f\u00fcnde (yani son <code>shared_ptr<\/code> nesnesi kapsam d\u0131\u015f\u0131na \u00e7\u0131kt\u0131\u011f\u0131nda veya s\u0131f\u0131rland\u0131\u011f\u0131nda), bellek otomatik olarak serbest b\u0131rak\u0131l\u0131r. Bu, karma\u015f\u0131k veri yap\u0131lar\u0131nda veya nesnelerin \u00f6mr\u00fcn\u00fcn ba\u015fka nesnelere ba\u011fl\u0131 oldu\u011fu durumlarda \u00e7ok kullan\u0131\u015fl\u0131d\u0131r.<\/p>\n<pre><code>\n#include <iostream>\n#include <memory> \/\/ shared_ptr i\u00e7in\n\nint main() {\n    std::shared_ptr<Kaynak> s1 = std::make_shared<Kaynak>();\n    std::cout << \"S1 referans say\u0131m\u0131: \" << s1.use_count() << std::endl; \/\/ 1\n\n    std::shared_ptr<Kaynak> s2 = s1; \/\/ Sahiplik payla\u015f\u0131ld\u0131\n    std::cout << \"S1 referans say\u0131m\u0131: \" << s1.use_count() << std::endl; \/\/ 2\n    std::cout << \"S2 referans say\u0131m\u0131: \" << s2.use_count() << std::endl; \/\/ 2\n\n    {\n        std::shared_ptr<Kaynak> s3 = s1; \/\/ Sahiplik tekrar payla\u015f\u0131ld\u0131\n        std::cout << \"S3 referans say\u0131m\u0131: \" << s3.use_count() << std::endl; \/\/ 3\n    } \/\/ s3 kapsam d\u0131\u015f\u0131na \u00e7\u0131kt\u0131, saya\u00e7 2'ye d\u00fc\u015ft\u00fc\n\n    std::cout << \"S1 referans say\u0131m\u0131 (s3 \u00e7\u0131kt\u0131ktan sonra): \" << s1.use_count() << std::endl; \/\/ 2\n\n    \/\/ main'den \u00e7\u0131k\u0131ld\u0131\u011f\u0131nda s1 ve s2 kapsam d\u0131\u015f\u0131na \u00e7\u0131kar, saya\u00e7 0'a d\u00fc\u015fer ve Kaynak serbest b\u0131rak\u0131l\u0131r.\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p><code>std::make_shared<\/code> kullanmak yine istisna g\u00fcvenli\u011fi ve performans a\u00e7\u0131s\u0131ndan tercih edilen y\u00f6ntemdir.<\/p>\n<h3>std::weak_ptr: D\u00f6ng\u00fcsel Referanslar\u0131 K\u0131rmak<\/h3>\n<p><code>std::shared_ptr<\/code>'lar d\u00f6ng\u00fcsel referanslara (circular references) neden olabilir; bu da iki veya daha fazla nesnenin kar\u015f\u0131l\u0131kl\u0131 olarak birbirini i\u015faret etmesi ve referans sayac\u0131n\u0131n asla s\u0131f\u0131ra d\u00fc\u015fmemesi sonucunu do\u011furur, b\u00f6ylece bellek s\u0131z\u0131nt\u0131s\u0131na yol a\u00e7ar. <code>std::weak_ptr<\/code> bu sorunu \u00e7\u00f6zmek i\u00e7in tasarlanm\u0131\u015ft\u0131r. <code>weak_ptr<\/code>, bir nesneye zay\u0131f (non-owning) referans sa\u011flar; yani referans sayac\u0131n\u0131 etkilemez. Bir <code>weak_ptr<\/code> ile i\u015faret edilen nesne silinmi\u015f olabilir, bu y\u00fczden <code>weak_ptr<\/code>'\u0131 kullanmadan \u00f6nce <code>lock()<\/code> metodu ile bir <code>shared_ptr<\/code>'a y\u00fckseltmek ve nesnenin hala var olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek gerekir.<\/p>\n<pre><code>\n#include <iostream>\n#include <memory>\n\nclass B; \/\/ B s\u0131n\u0131f\u0131 \u00f6ne tan\u0131mland\u0131\n\nclass A {\npublic:\n    std::shared_ptr<B> b_ptr;\n    ~A() { std::cout << \"A yok edildi.\" << std::endl; }\n};\n\nclass B {\npublic:\n    std::weak_ptr<A> a_ptr; \/\/ Zay\u0131f referans kullan\u0131ld\u0131\n    ~B() { std::cout << \"B yok edildi.\" << std::endl; }\n};\n\nvoid test_circular_reference() {\n    std::shared_ptr<A> a = std::make_shared<A>();\n    std::shared_ptr<B> b = std::make_shared<B>();\n\n    a->b_ptr = b;\n    b->a_ptr = a; \/\/ E\u011fer burada da shared_ptr olsayd\u0131, s\u0131z\u0131nt\u0131 olurdu.\n\n    \/\/ main'den \u00e7\u0131k\u0131ld\u0131\u011f\u0131nda 'a' ve 'b' kapsam d\u0131\u015f\u0131na \u00e7\u0131kar.\n    \/\/ 'b->a_ptr' zay\u0131f referans oldu\u011fundan 'a' ve 'b' do\u011fru \u015fekilde yok edilir.\n}\n\nint main() {\n    test_circular_reference();\n    std::cout << \"D\u00f6ng\u00fcsel referans testi tamamland\u0131.\" << std::endl;\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p>Modern C++'ta ak\u0131ll\u0131 i\u015faret\u00e7ileri kullanmak, bellek y\u00f6netimiyle ilgili tan\u0131ms\u0131z davran\u0131\u015f riskini b\u00fcy\u00fck \u00f6l\u00e7\u00fcde azalt\u0131r. Ham i\u015faret\u00e7ileri yaln\u0131zca performans kritik durumlarda veya k\u00fct\u00fcphane aray\u00fczleri gibi belirli senaryolarda kullanmal\u0131 ve her zaman \u00e7ok dikkatli olmal\u0131s\u0131n\u0131z. Ak\u0131ll\u0131 i\u015faret\u00e7iler, C++ kodunuzu daha g\u00fcvenli, daha okunabilir ve daha s\u00fcrd\u00fcr\u00fclebilir hale getirmenin anahtar\u0131d\u0131r.<\/p>\n<h2>Derleyici Optimizasyonlar\u0131 ve Tan\u0131ms\u0131z Davran\u0131\u015f\u0131n Sinsi Y\u00fcz\u00fc: Uyar\u0131lardan \u00d6tesi<\/h2>\n<p>C++'\u0131n en b\u00fcy\u00fck avantajlar\u0131ndan biri, derleyicilerin kodunuzu hedef donan\u0131m i\u00e7in y\u00fcksek performansla optimize etme yetene\u011fidir. Ancak bu optimizasyonlar, tan\u0131ms\u0131z davran\u0131\u015f (UB) i\u00e7eren kodlarla birle\u015fti\u011finde, tahmin edilemez ve hatta \"zaman yolculu\u011fu\" olarak adland\u0131r\u0131labilecek sinsi hatalara yol a\u00e7abilir. Derleyici, UB'nin asla ger\u00e7ekle\u015fmeyece\u011fini varsayma \u00f6zg\u00fcrl\u00fc\u011f\u00fcne sahip oldu\u011fu i\u00e7in, UB i\u00e7eren kodun baz\u0131 k\u0131s\u0131mlar\u0131n\u0131 tamamen silebilir veya program\u0131n ak\u0131\u015f\u0131n\u0131 beklenmedik \u015fekillerde de\u011fi\u015ftirebilir.<\/p>\n<h3>\"As-if\" Kural\u0131 ve Optimizasyonlar<\/h3>\n<p>C++ standard\u0131, derleyicilerin program\u0131n g\u00f6zlemlenebilir davran\u0131\u015f\u0131n\u0131 de\u011fi\u015ftirmeden kod \u00fczerinde herhangi bir optimizasyonu yapmas\u0131na izin veren \"as-if\" kural\u0131n\u0131 tan\u0131mlar. Ancak tan\u0131ms\u0131z davran\u0131\u015f durumunda, \"g\u00f6zlemlenebilir davran\u0131\u015f\" tan\u0131m\u0131 ortadan kalkar. Bu, derleyicinin, UB'ye yol a\u00e7an kodu g\u00f6rmezden gelerek veya tamamen kald\u0131rarak, adeta \"bu kod par\u00e7as\u0131na asla ula\u015f\u0131lamaz\" varsay\u0131m\u0131nda bulunabilece\u011fi anlam\u0131na gelir. Bu varsay\u0131m, derleyicinin kodun geri kalan\u0131n\u0131 daha agresif bir \u015fekilde optimize etmesine olanak tan\u0131r ve bu da program\u0131n\u0131z\u0131n beklenenden tamamen farkl\u0131 \u00e7al\u0131\u015fmas\u0131na neden olabilir.<\/p>\n<pre><code>\n#include <iostream>\n\nvoid f(int* p) {\n    *p = 10; \/\/ UB: E\u011fer 'p' null veya ge\u00e7ersizse\n}\n\nint main() {\n    int* ptr = nullptr;\n    \/\/ Derleyici burada 'ptr'in null oldu\u011funu bilir.\n    \/\/ E\u011fer 'f' \u00e7a\u011fr\u0131s\u0131 yap\u0131lsayd\u0131, *ptr = 10 tan\u0131ms\u0131z davran\u0131\u015f olurdu.\n    \/\/ Baz\u0131 derleyiciler optimizasyon seviyesine ba\u011fl\u0131 olarak a\u015fa\u011f\u0131daki kodu kald\u0131rabilir.\n\n    if (ptr != nullptr) { \/\/ Bu kontrol her zaman false olur\n        f(ptr); \n    } else {\n        std::cout << \"\u0130\u015faret\u00e7i null, g\u00fcvenli \u00e7\u0131k\u0131\u015f.\" << std::endl;\n    }\n\n    \/\/ Bir di\u011fer sinsi \u00f6rnek:\n    int dizi[5];\n    int indis = 10; \/\/ S\u0131n\u0131r d\u0131\u015f\u0131 indis\n    \/\/ if (indis < 5) { \/\/ Normalde bu kontrol olmal\u0131yd\u0131\n    \/\/     dizi[indis] = 100; \/\/ UB\n    \/\/ }\n    \/\/ E\u011fer derleyici 'indis'in bir \u015fekilde 5'ten b\u00fcy\u00fck oldu\u011funu anlarsa,\n    \/\/ dizi[indis] = 100 sat\u0131r\u0131n\u0131 tamamen silebilir.\n\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p>Yukar\u0131daki \u00f6rnekte, <code>ptr<\/code> a\u00e7\u0131k\u00e7a <code>nullptr<\/code> olarak ba\u015flat\u0131lm\u0131\u015ft\u0131r. Normalde <code>if (ptr != nullptr)<\/code> ko\u015fulu asla do\u011fru olmaz ve <code>f(ptr)<\/code> \u00e7a\u011fr\u0131lmaz. Ancak daha karma\u015f\u0131k senaryolarda, derleyici UB i\u00e7eren bir yolun asla al\u0131namayaca\u011f\u0131n\u0131 varsayabilir ve bu yolu i\u00e7eren t\u00fcm g\u00fcvenlik kontrollerini veya alternatif kodlar\u0131 optimize ederek kald\u0131rabilir. Bu, program\u0131n bir hatayla kar\u015f\u0131la\u015fma olas\u0131l\u0131\u011f\u0131 olmayan senaryolarda bile \u00e7\u00f6kmesine neden olabilir.<\/p>\n<h3>Sanitizer'lar: Gizli UB'yi Tespit Etme Ara\u00e7lar\u0131<\/h3>\n<p>Tan\u0131ms\u0131z davran\u0131\u015flar\u0131 tespit etmek i\u00e7in en g\u00fc\u00e7l\u00fc ara\u00e7lardan biri \"Sanitizer\"lard\u0131r. GCC ve Clang gibi modern derleyiciler, \u00e7al\u0131\u015fma zaman\u0131nda bellek hatalar\u0131n\u0131 ve UB'yi tespit eden bu ara\u00e7lar\u0131 sunar. En yayg\u0131n kullan\u0131lanlar\u0131 \u015funlard\u0131r:<\/p>\n<ul>\n<li><code>AddressSanitizer<\/code> (<code>-fsanitize=address<\/code>): Bellek eri\u015fim hatalar\u0131n\u0131 (s\u0131n\u0131r d\u0131\u015f\u0131 eri\u015fim, use-after-free, use-after-scope) tespit eder.<\/li>\n<li><code>UndefinedBehaviorSanitizer<\/code> (<code>-fsanitize=undefined<\/code>): Bir\u00e7ok farkl\u0131 tan\u0131ms\u0131z davran\u0131\u015f t\u00fcr\u00fcn\u00fc (ba\u015flat\u0131lmam\u0131\u015f de\u011fi\u015fkenler, ge\u00e7ersiz t\u00fcr d\u00f6n\u00fc\u015f\u00fcmleri, i\u015faret\u00e7i hizalama hatalar\u0131 vb.) tespit eder.<\/li>\n<li><code>ThreadSanitizer<\/code> (<code>-fsanitize=thread<\/code>): Veri yar\u0131\u015flar\u0131n\u0131 (data races) tespit eder.<\/li>\n<\/ul>\n<p>Bu sanitizer'lar\u0131 derleme zaman\u0131nda etkinle\u015ftirerek, geli\u015ftirme ve test a\u015famalar\u0131nda gizli UB'leri ortaya \u00e7\u0131karabilirsiniz. \u00d6rne\u011fin:<\/p>\n<pre><code>\n\/\/ UB i\u00e7eren bir kodunuz varsa (\u00f6rne\u011fin, ba\u015flat\u0131lmam\u0131\u015f int x; kullan\u0131m\u0131)\n\/\/ clang++ -g -O1 -fsanitize=undefined main.cpp -o main\n\/\/ .\/main\n\/\/ Bu komutlar, \u00e7al\u0131\u015fma zaman\u0131nda UB tespit edilirse bir rapor \u00fcretecektir.\n<\/pre>\n<p><\/code><\/p>\n<p>Sanitizer'lar, kodunuzun testlerde bile kendini g\u00f6stermeyen sinsi hatalar\u0131n\u0131 yakalamak i\u00e7in vazge\u00e7ilmezdir. \u00dcretim ortam\u0131nda genellikle performans maliyeti nedeniyle kullan\u0131lmasalar da, geli\u015ftirme ve CI\/CD s\u00fcre\u00e7lerinde kritik bir rol oynarlar. Bu ara\u00e7lar\u0131 kullanarak, derleyicinin optimizasyonlar\u0131n\u0131n olu\u015fturabilece\u011fi gizli s\u00fcrprizlerden korunabilir ve daha sa\u011flam C++ uygulamalar\u0131 geli\u015ftirebilirsiniz.<\/p>\n<h2>K\u00f6t\u00fc Tasar\u0131mdan Kaynaklanan Gizli Tuzaklar: Slicing ve Sanal Fonksiyonlar<\/h2>\n<p>C++'taki \"s\u00fcrprizler\" sadece tan\u0131ms\u0131z davran\u0131\u015flardan ibaret de\u011fildir. Dilin nesne y\u00f6nelimli yap\u0131s\u0131 ve kal\u0131t\u0131m mekanizmalar\u0131 da, yanl\u0131\u015f kullan\u0131ld\u0131\u011f\u0131nda beklenmedik sonu\u00e7lara yol a\u00e7abilen durumlar yarat\u0131r. Bunlardan biri, \u00f6zellikle \u00e7okbi\u00e7imlilikle (polymorphism) \u00e7al\u0131\u015f\u0131rken kar\u015f\u0131m\u0131za \u00e7\u0131kan \"nesne dilimleme\" (object slicing) sorunudur. Nesne dilimleme, tam olarak tan\u0131ms\u0131z davran\u0131\u015f olmasa da, verilerin sessizce kaybolmas\u0131na ve program\u0131n yanl\u0131\u015f davranmas\u0131na neden oldu\u011fu i\u00e7in \u00f6nemli bir \"s\u00fcrpriz\"dir.<\/p>\n<h3>Nesne Dilimleme (Object Slicing) Nedir ve Nas\u0131l Ortaya \u00c7\u0131kar?<\/h3>\n<p>Nesne dilimleme, t\u00fcretilmi\u015f bir s\u0131n\u0131f nesnesinin, bir temel s\u0131n\u0131f nesnesine de\u011fer olarak atanmas\u0131 veya temel s\u0131n\u0131f t\u00fcr\u00fcnde bir fonksiyona de\u011fer olarak ge\u00e7irilmesi durumunda ortaya \u00e7\u0131kar. Bu durumda, t\u00fcretilmi\u015f s\u0131n\u0131f\u0131n temel s\u0131n\u0131f k\u0131sm\u0131ndan \"fazla\" olan \u00fcyeleri (veri \u00fcyeleri ve sanal fonksiyon tablosundaki (vtable) t\u00fcretilmi\u015f s\u0131n\u0131f\u0131n kendi sanal fonksiyonlar\u0131) at\u0131l\u0131r, yani \"dilimlenir\". Kopyalanan temel s\u0131n\u0131f nesnesi, t\u00fcretilmi\u015f s\u0131n\u0131f\u0131n tam i\u015flevselli\u011fini yans\u0131tmaz, sadece temel s\u0131n\u0131f\u0131n \u00f6zelliklerini ta\u015f\u0131r.<\/p>\n<pre><code>\n#include <iostream>\n#include <string>\n\nclass Temel {\npublic:\n    int id;\n    Temel(int i = 0) : id(i) {}\n    virtual void goster() const {\n        std::cout << \"Temel s\u0131n\u0131f ID: \" << id << std::endl;\n    }\n    virtual ~Temel() = default;\n};\n\nclass Turetilmis : public Temel {\npublic:\n    std::string ad;\n    Turetilmis(int i, const std::string&#038; n) : Temel(i), ad(n) {}\n    void goster() const override {\n        std::cout << \"T\u00fcretilmi\u015f s\u0131n\u0131f ID: \" << id << \", Ad: \" << ad << std::endl;\n    }\n};\n\nvoid islemYap(Temel t) { \/\/ Burada nesne dilimlemesi ger\u00e7ekle\u015fir!\n    std::cout << \"islemYap fonksiyonu \u00e7a\u011fr\u0131ld\u0131: \";\n    t.goster(); \/\/ Her zaman Temel::goster() \u00e7a\u011fr\u0131l\u0131r, Turetilmis::goster() de\u011fil\n}\n\nint main() {\n    Turetilmis turetilmisNesne(101, \"Alice\");\n    turetilmisNesne.goster(); \/\/ \u00c7\u0131kt\u0131: T\u00fcretilmi\u015f s\u0131n\u0131f ID: 101, Ad: Alice\n\n    Temel temelNesne = turetilmisNesne; \/\/ Nesne dilimlemesi!\n    temelNesne.goster(); \/\/ \u00c7\u0131kt\u0131: Temel s\u0131n\u0131f ID: 101 (Ad bilgisi kaybedildi)\n\n    islemYap(turetilmisNesne); \/\/ Fonksiyona de\u011fer olarak ge\u00e7i\u015fte dilimleme\n    \n    \/\/ Do\u011fru yakla\u015f\u0131m: \u0130\u015faret\u00e7iler veya referanslar kullanmak\n    std::cout << \"\\n\u0130\u015faret\u00e7i ile do\u011fru kullan\u0131m:\" << std::endl;\n    Temel* ptrTemel = &#038;turetilmisNesne;\n    ptrTemel->goster(); \/\/ \u00c7\u0131kt\u0131: T\u00fcretilmi\u015f s\u0131n\u0131f ID: 101, Ad: Alice (Polymorphism i\u015f ba\u015f\u0131nda)\n\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p>Yukar\u0131daki \u00f6rnekte, <code>temelNesne = turetilmisNesne<\/code> atamas\u0131 ve <code>islemYap(turetilmisNesne)<\/code> fonksiyon \u00e7a\u011fr\u0131s\u0131 s\u0131ras\u0131nda <code>Turetilmis<\/code> nesnesinin <code>ad<\/code> veri \u00fcyesi kaybedilir. Ayr\u0131ca, sanal fonksiyonlar (<code>goster()<\/code>) bile temel s\u0131n\u0131f\u0131n versiyonunu \u00e7a\u011f\u0131r\u0131r \u00e7\u00fcnk\u00fc art\u0131k nesne, derleyici a\u00e7\u0131s\u0131ndan bir <code>Temel<\/code> nesnesidir ve t\u00fcretilmi\u015f s\u0131n\u0131f\u0131n vtable'\u0131na eri\u015fimi yoktur.<\/p>\n<h3>\u00c7\u00f6z\u00fcm: \u00c7okbi\u00e7imlili\u011fi \u0130\u015faret\u00e7iler ve Referanslarla Kullanmak<\/h3>\n<p>C++'ta \u00e7okbi\u00e7imlili\u011fin (polymorphism) do\u011fru bir \u015fekilde \u00e7al\u0131\u015fabilmesi i\u00e7in, nesneleri i\u015faret\u00e7iler (pointers) veya referanslar (references) arac\u0131l\u0131\u011f\u0131yla kullanmak gerekir. Bu, sanal fonksiyon mekanizmas\u0131n\u0131n do\u011fru vtable'\u0131 bulmas\u0131n\u0131 ve t\u00fcretilmi\u015f s\u0131n\u0131f\u0131n uygun fonksiyonunu \u00e7a\u011f\u0131rmas\u0131n\u0131 sa\u011flar. Ayn\u0131 zamanda, ak\u0131ll\u0131 i\u015faret\u00e7iler (<code>std::unique_ptr<\/code>, <code>std::shared_ptr<\/code>) kullanarak bellek y\u00f6netimini g\u00fcvenli hale getirmek de \u00f6nemlidir.<\/p>\n<pre><code>\n\/\/ islemYap fonksiyonunun do\u011fru versiyonu:\nvoid islemYapDogru(Temel& t) { \/\/ Referans kullan\u0131ld\u0131\n    std::cout << \"islemYapDogru fonksiyonu \u00e7a\u011fr\u0131ld\u0131: \";\n    t.goster(); \/\/ Polymorphism do\u011fru \u00e7al\u0131\u015f\u0131r\n}\n\n\/\/ veya i\u015faret\u00e7i ile:\nvoid islemYapPtr(Temel* t) {\n    if (t) {\n        std::cout << \"islemYapPtr fonksiyonu \u00e7a\u011fr\u0131ld\u0131: \";\n        t->goster(); \/\/ Polymorphism do\u011fru \u00e7al\u0131\u015f\u0131r\n    }\n}\n<\/pre>\n<p><\/code><\/p>\n<h3>Sanal Y\u0131k\u0131c\u0131lar (Virtual Destructors) ve Bellek S\u0131z\u0131nt\u0131lar\u0131<\/h3>\n<p>Nesne dilimleme ile do\u011frudan ilgili olmasa da, kal\u0131t\u0131m hiyerar\u015filerinde kritik bir di\u011fer \"s\u00fcrpriz\" kayna\u011f\u0131, sanal y\u0131k\u0131c\u0131lar\u0131n (virtual destructors) olmamas\u0131d\u0131r. E\u011fer temel bir s\u0131n\u0131f i\u015faret\u00e7isi arac\u0131l\u0131\u011f\u0131yla dinamik olarak tahsis edilmi\u015f t\u00fcretilmi\u015f bir s\u0131n\u0131f nesnesini silerseniz ve temel s\u0131n\u0131f\u0131n y\u0131k\u0131c\u0131s\u0131 <code>virtual<\/code> de\u011filse, yaln\u0131zca temel s\u0131n\u0131f\u0131n y\u0131k\u0131c\u0131s\u0131 \u00e7a\u011fr\u0131l\u0131r. T\u00fcretilmi\u015f s\u0131n\u0131f\u0131n y\u0131k\u0131c\u0131s\u0131 \u00e7a\u011fr\u0131lmaz ve bu da t\u00fcretilmi\u015f s\u0131n\u0131fa \u00f6zg\u00fc kaynaklar\u0131n (bellek, dosya tan\u0131t\u0131c\u0131lar\u0131 vb.) serbest b\u0131rak\u0131lmamas\u0131na, dolay\u0131s\u0131yla bellek s\u0131z\u0131nt\u0131lar\u0131na yol a\u00e7ar. Bu da bir t\u00fcr tan\u0131ms\u0131z davran\u0131\u015ft\u0131r.<\/p>\n<pre><code>\n#include <iostream>\n#include <memory>\n\nclass TemelKaynagiYoneten {\npublic:\n    TemelKaynagiYoneten() { std::cout << \"Temel Kaynak al\u0131nd\u0131.\" << std::endl; }\n    virtual ~TemelKaynagiYoneten() { std::cout << \"Temel Kaynak serbest b\u0131rak\u0131ld\u0131.\" << std::endl; } \/\/ VIRTUAL olmal\u0131!\n};\n\nclass TuretilmisKaynagiYoneten : public TemelKaynagiYoneten {\npublic:\n    int* buyukBellekBlogu;\n    TuretilmisKaynagiYoneten() : buyukBellekBlogu(new int[1000]) { \n        std::cout << \"T\u00fcretilmi\u015f Kaynak al\u0131nd\u0131.\" << std::endl; \n    }\n    ~TuretilmisKaynagiYoneten() override { \/\/ override iyi bir pratik\n        delete[] buyukBellekBlogu;\n        std::cout << \"T\u00fcretilmi\u015f Kaynak serbest b\u0131rak\u0131ld\u0131.\" << std::endl;\n    }\n};\n\nint main() {\n    \/\/ Ham i\u015faret\u00e7i ile (veya unique_ptr\/shared_ptr ile de ayn\u0131 mant\u0131k ge\u00e7erli)\n    TemelKaynagiYoneten* ptr = new TuretilmisKaynagiYoneten();\n    delete ptr; \/\/ E\u011fer TemelKaynagiYoneten'in y\u0131k\u0131c\u0131s\u0131 virtual olmasayd\u0131,\n                \/\/ TuretilmisKaynagiYoneten'in y\u0131k\u0131c\u0131s\u0131 \u00e7a\u011fr\u0131lmazd\u0131 ve buyukBellekBlogu s\u0131z\u0131nt\u0131 yapard\u0131.\n\n    std::cout << \"\\nAk\u0131ll\u0131 i\u015faret\u00e7i ile do\u011fru kullan\u0131m:\" << std::endl;\n    std::unique_ptr<TemelKaynagiYoneten> uniquePtr = std::make_unique<TuretilmisKaynagiYoneten>();\n    \/\/ uniquePtr kapsam d\u0131\u015f\u0131na \u00e7\u0131kt\u0131\u011f\u0131nda do\u011fru y\u0131k\u0131c\u0131lar \u00e7a\u011fr\u0131l\u0131r.\n\n    return 0;\n}\n<\/pre>\n<p><\/code><\/p>\n<p>Bu t\u00fcr tasar\u0131m tuzaklar\u0131, C++'\u0131n nesne y\u00f6nelimli \u00f6zelliklerini do\u011fru anlaman\u0131n ve uygulaman\u0131n ne kadar \u00f6nemli oldu\u011funu g\u00f6stermektedir. Nesne dilimlemesinden ka\u00e7\u0131nmak i\u00e7in her zaman i\u015faret\u00e7iler veya referanslar kullan\u0131n; sanal y\u0131k\u0131c\u0131lar\u0131 ise bir s\u0131n\u0131f\u0131n kal\u0131t\u0131m hiyerar\u015fisinde kullan\u0131lmas\u0131 beklenen her temel s\u0131n\u0131fta tan\u0131mlamay\u0131 unutmay\u0131n.<\/p>\n<h2>C++ Geli\u015ftiricileri \u0130\u00e7in Mobil Uyumluluk \u0130pu\u00e7lar\u0131<\/h2>\n<p>C++ ile yaz\u0131lm\u0131\u015f uygulamalar\u0131n mobil cihazlarda da sorunsuz \u00e7al\u0131\u015fmas\u0131, g\u00fcn\u00fcm\u00fcz yaz\u0131l\u0131m d\u00fcnyas\u0131nda kritik bir \u00f6neme sahiptir. Kullan\u0131c\u0131lar, h\u0131zl\u0131 ve duyarl\u0131 deneyimler beklerken, mobil platformlar\u0131n kaynak k\u0131s\u0131tlamalar\u0131 (CPU, bellek, batarya) geli\u015ftiriciler i\u00e7in ek zorluklar \u00e7\u0131kar\u0131r. C++'\u0131n d\u00fc\u015f\u00fck seviye kontrol yetene\u011fi, mobil performans optimizasyonlar\u0131 i\u00e7in m\u00fckemmel bir ara\u00e7t\u0131r, ancak ayn\u0131 zamanda mobil cihazlara \u00f6zel dikkat gerektiren \"s\u00fcrprizler\" de bar\u0131nd\u0131rabilir.<\/p>\n<p>Mobil platformlar (Android, iOS), genellikle farkl\u0131 i\u015flemci mimarilerine (ARM vs. x86) ve i\u015fletim sistemi API'lerine sahiptir. Bu, C++ kodunuzu derlerken ve \u00e7al\u0131\u015ft\u0131r\u0131rken dikkatli olman\u0131z gerekti\u011fi anlam\u0131na gelir. Platformlar aras\u0131 uyumluluk i\u00e7in, standart C++ k\u00fct\u00fcphanelerine ve ta\u015f\u0131nabilir kod yaz\u0131m\u0131na \u00f6ncelik verilmelidir. Platforma \u00f6zel optimizasyonlar veya sistem \u00e7a\u011fr\u0131lar\u0131 gerekti\u011finde, bunu platform soyutlama katmanlar\u0131 (\u00f6rne\u011fin, C++'taki aray\u00fcz s\u0131n\u0131flar\u0131) arac\u0131l\u0131\u011f\u0131yla yapmak en iyi yakla\u015f\u0131md\u0131r. Ayr\u0131ca, mobil cihazlarda bellek kullan\u0131m\u0131 her zaman k\u0131s\u0131tl\u0131d\u0131r; bu nedenle <code>std::vector::reserve<\/code> ile bellek \u00f6nceden tahsis etmek veya <code>std::unique_ptr<\/code> ve <code>std::shared_ptr<\/code> gibi ak\u0131ll\u0131 i\u015faret\u00e7iler kullanarak bellek s\u0131z\u0131nt\u0131lar\u0131n\u0131 \u00f6nlemek performans\u0131 art\u0131r\u0131r. \u00c7oklu i\u015f par\u00e7ac\u0131\u011f\u0131 (multi-threading) kullan\u0131rken <code>std::async<\/code> veya <code>std::thread<\/code> gibi C++11 e\u015fzamanl\u0131l\u0131k \u00f6zelliklerini dikkatli kullanmak, mobil i\u015flemcilerdeki \u00e7ekirdek say\u0131lar\u0131 ve g\u00fc\u00e7 t\u00fcketimi g\u00f6z \u00f6n\u00fcne al\u0131nd\u0131\u011f\u0131nda \u00f6nemlidir. \u00d6rne\u011fin, \u00e7ok fazla i\u015f par\u00e7ac\u0131\u011f\u0131 olu\u015fturmak, performans d\u00fc\u015f\u00fc\u015f\u00fcne ve pil \u00f6mr\u00fcn\u00fcn k\u0131salmas\u0131na yol a\u00e7abilir.<\/p>\n<div class=\"expert-tip\">\n  Uzman \u0130pucu: Mobil platformlar i\u00e7in C++ kodu yazarken, \"zero-overhead principle\" (s\u0131f\u0131r ek y\u00fck prensibi) felsefesini benimseyin. Yaln\u0131zca ihtiyac\u0131n\u0131z olan \u00f6zellikleri kullan\u0131n ve gereksiz soyutlamalardan ka\u00e7\u0131n\u0131n. Ayr\u0131ca, derleme zaman\u0131nda m\u00fcmk\u00fcn oldu\u011funca \u00e7ok hata yakalamak i\u00e7in t\u00fcm uyar\u0131 bayraklar\u0131n\u0131 etkinle\u015ftirin (<code>-Wall -Wextra -pedantic<\/code>).\n<\/div>\n<p>Bu makalenin HTML yap\u0131s\u0131n\u0131 mobil uyumlu hale getirmek i\u00e7in ise genellikle CSS medya sorgular\u0131 kullan\u0131l\u0131r. A\u015fa\u011f\u0131daki gibi basit bir CSS blo\u011fu, i\u00e7eri\u011fin farkl\u0131 ekran boyutlar\u0131na nas\u0131l uyum sa\u011flayaca\u011f\u0131n\u0131 g\u00f6sterir:<\/p>\n<pre><code class=\"language-css\">\n<style>\n  body {\n    font-family: Arial, sans-serif;\n    line-height: 1.6;\n    margin: 15px;\n    color: #333;\n  }\n  h2, h3 {\n    color: #0056b3;\n    margin-top: 1.5em;\n  }\n  pre code {\n    display: block;\n    padding: 1em;\n    background: #f4f4f4;\n    border: 1px solid #ddd;\n    overflow-x: auto;\n    border-radius: 5px;\n  }\n  .expert-tip {\n    background-color: #e9f7ef;\n    border-left: 5px solid #28a745;\n    padding: 10px 15px;\n    margin: 15px 0;\n    font-style: italic;\n    color: #216d3f;\n  }\n  \n  \/* Mobil cihazlar i\u00e7in medya sorgular\u0131 *\/\n  @media (max-width: 768px) {\n    body {\n      margin: 10px;\n      font-size: 14px;\n    }\n    h2 {\n      font-size: 1.5em;\n    }\n    h3 {\n      font-size: 1.2em;\n    }\n    pre code {\n      font-size: 0.9em;\n      padding: 0.8em;\n    }\n  }\n  @media (max-width: 480px) {\n    body {\n      margin: 5px;\n      font-size: 13px;\n    }\n    h2 {\n      font-size: 1.3em;\n    }\n    h3 {\n      font-size: 1.1em;\n    }\n  }\n<\/style>\n<\/pre>\n<p><\/code><\/p>\n<p>Bu CSS kurallar\u0131, taray\u0131c\u0131n\u0131n pencere geni\u015fli\u011fine g\u00f6re yaz\u0131 tipi boyutlar\u0131n\u0131 ve sayfa kenar bo\u015fluklar\u0131n\u0131 otomatik olarak ayarlayarak, makalenin farkl\u0131 cihazlarda daha okunabilir olmas\u0131n\u0131 sa\u011flar. C++ kodunuzu mobil platformlara ta\u015f\u0131rken de benzer \u015fekilde adaptif ve duyarl\u0131 yakla\u015f\u0131mlar benimsemek, \"s\u00fcrprizlerden\" ka\u00e7\u0131nman\u0131n ve geni\u015f bir kullan\u0131c\u0131 kitlesine ula\u015fman\u0131n anahtar\u0131d\u0131r.<\/p>\n<h2>Sonu\u00e7: C++'taki S\u00fcrprizlerle Ba\u015fa \u00c7\u0131kmak ve G\u00fcvenilir Kod Yazmak<\/h2>\n<p>C++'\u0131n derinliklerine indik\u00e7e, dilin g\u00fc\u00e7l\u00fc ve esnek yap\u0131s\u0131n\u0131n yan\u0131 s\u0131ra, deneyimli geli\u015ftiricileri bile \u015fa\u015f\u0131rtabilen kendine \u00f6zg\u00fc \"s\u00fcrprizlerle\" kar\u015f\u0131la\u015fmak ka\u00e7\u0131n\u0131lmazd\u0131r. Bu makale boyunca, \u00f6zellikle tan\u0131ms\u0131z davran\u0131\u015f (Undefined Behavior) olmak \u00fczere, bu s\u00fcrprizlerin nedenlerini, ger\u00e7ek d\u00fcnya senaryolar\u0131n\u0131 ve bunlardan nas\u0131l ka\u00e7\u0131naca\u011f\u0131m\u0131z\u0131 detayl\u0131 bir \u015fekilde inceledik. Ba\u015flat\u0131lmam\u0131\u015f de\u011fi\u015fkenler, ge\u00e7ersiz i\u015faret\u00e7iler, nesne dilimlemesi ve derleyici optimizasyonlar\u0131n\u0131n sinsi etkileri, C++'\u0131n dikkatli bir yakla\u015f\u0131m gerektiren y\u00f6nlerini g\u00f6zler \u00f6n\u00fcne serdi.<\/p>\n<p>\u00d6\u011frendi\u011fimiz temel \u00e7\u00f6z\u00fcm, modern C++ \u00f6zelliklerini benimsemektir. Ak\u0131ll\u0131 i\u015faret\u00e7iler (<code>std::unique_ptr<\/code>, <code>std::shared_ptr<\/code>, <code>std::weak_ptr<\/code>) ile RAII prensibini uygulayarak bellek y\u00f6netimini otomatikle\u015ftirmek, bellek s\u0131z\u0131nt\u0131lar\u0131 ve dangling pointer gibi en yayg\u0131n UB kaynaklar\u0131n\u0131 ortadan kald\u0131r\u0131r. Sanal fonksiyonlar\u0131 ve sanal y\u0131k\u0131c\u0131lar\u0131 do\u011fru kullanmak, kal\u0131t\u0131m hiyerar\u015filerinde beklenmedik davran\u0131\u015flardan ve kaynak s\u0131z\u0131nt\u0131lar\u0131ndan ka\u00e7\u0131nman\u0131n anahtar\u0131d\u0131r. Ayr\u0131ca, derleyicilerin sundu\u011fu Sanitizer ara\u00e7lar\u0131n\u0131 (AddressSanitizer, UndefinedBehaviorSanitizer) geli\u015ftirme s\u00fcrecine entegre etmek, testlerde bile kendini g\u00f6stermeyen gizli hatalar\u0131 erken a\u015famada tespit etmek i\u00e7in kritik \u00f6neme sahiptir.<\/p>\n<p>C++, sundu\u011fu performans ve kontrol ile e\u015fsiz bir dildir. Ancak bu g\u00fcc\u00fc etkin ve g\u00fcvenli bir \u015fekilde kullanmak, dilin inceliklerini ve potansiyel tuzaklar\u0131n\u0131 anlamay\u0131 gerektirir. S\u00fcrekli \u00f6\u011frenme, proaktif kodlama pratikleri ve modern ara\u00e7lardan faydalanmak, C++'taki \"s\u00fcrprizleri\" minimuma indirerek daha sa\u011flam, g\u00fcvenilir ve s\u00fcrd\u00fcr\u00fclebilir yaz\u0131l\u0131mlar geli\u015ftirmemizi sa\u011flayacakt\u0131r. Unutmay\u0131n, C++ sizi \u015fa\u015f\u0131rt\u0131yorsa, bu genellikle dilin do\u011fas\u0131ndan de\u011fil, sizin onunla olan diyalo\u011funuzdaki bir eksiklikten kaynaklan\u0131yordur.<\/p>\n<h3>S\u0131k\u00e7a Sorulan Sorular (SSS)<\/h3>\n<ul>\n<li>\n        <strong>S: Tan\u0131ms\u0131z davran\u0131\u015f (UB) her zaman program\u0131n \u00e7\u00f6kmesine mi neden olur?<\/strong><br \/>\n        <strong>C:<\/strong> Hay\u0131r, tan\u0131ms\u0131z davran\u0131\u015f\u0131n en sinsi y\u00f6nlerinden biri de budur. Program\u0131n\u0131z \u00e7\u00f6kebilece\u011fi gibi, yanl\u0131\u015f sonu\u00e7lar \u00fcretebilir, veri bozukluklar\u0131na neden olabilir veya hatta bazen \"do\u011fru\" \u00e7al\u0131\u015f\u0131yormu\u015f gibi g\u00f6r\u00fcnebilir. Bu belirsizlik, hatalar\u0131n tespitini zorla\u015ft\u0131r\u0131r.\n    <\/li>\n<li>\n        <strong>S: Ak\u0131ll\u0131 i\u015faret\u00e7iler, t\u00fcm bellek y\u00f6netimi sorunlar\u0131m\u0131 \u00e7\u00f6zer mi?<\/strong><br \/>\n        <strong>C:<\/strong> Ak\u0131ll\u0131 i\u015faret\u00e7iler (<code>std::unique_ptr<\/code>, <code>std::shared_ptr<\/code>, <code>std::weak_ptr<\/code>) bellek s\u0131z\u0131nt\u0131lar\u0131, dangling pointer'lar ve \u00e7ift serbest b\u0131rakma gibi bir\u00e7ok yayg\u0131n bellek sorununu \u00e7\u00f6zmede son derece etkilidir. Ancak, kaynaklar\u0131n d\u00f6ng\u00fcsel olarak birbirini i\u015faret etmesi gibi durumlarda (circular references) <code>std::weak_ptr<\/code> kullan\u0131m\u0131 gibi \u00f6zel durumlar hala dikkat gerektirir. Genel olarak, do\u011fru kullan\u0131ld\u0131klar\u0131nda b\u00fcy\u00fck \u00f6l\u00e7\u00fcde g\u00fcvenli\u011fi art\u0131r\u0131rlar.\n    <\/li>\n<li>\n        <strong>S: Nesne dilimlemesi (object slicing) neden k\u00f6t\u00fc bir \u015feydir?<\/strong><br \/>\n        <strong>C:<\/strong> Nesne dilimlemesi, t\u00fcretilmi\u015f bir s\u0131n\u0131f\u0131n ekstra veri \u00fcyelerini ve potansiyel olarak sanal fonksiyonlar\u0131n\u0131n do\u011fru \u00e7a\u011fr\u0131lmas\u0131n\u0131 kaybetmesine neden olur. Bu durum, \u00e7okbi\u00e7imlilik prensibini bozar ve program\u0131n\u0131z\u0131n beklenen davran\u0131\u015f\u0131 sergilemesini engeller, veri kayb\u0131na ve mant\u0131k hatalar\u0131na yol a\u00e7ar. \u00c7okbi\u00e7imlilik i\u00e7in her zaman i\u015faret\u00e7iler veya referanslar kullan\u0131lmal\u0131d\u0131r.\n    <\/li>\n<li>\n        <strong>S: C++'ta tan\u0131ms\u0131z davran\u0131\u015ftan tamamen ka\u00e7\u0131nmak m\u00fcmk\u00fcn m\u00fcd\u00fcr?<\/strong><br \/>\n        <strong>C:<\/strong> Teorik olarak evet, ancak pratik olarak \u00e7ok b\u00fcy\u00fck ve karma\u015f\u0131k kod tabanlar\u0131nda %100 UB'den ar\u0131nm\u0131\u015f olmak zorlu bir hedeftir. Modern C++ \u00f6zelliklerini, kat\u0131 kodlama standartlar\u0131n\u0131, d\u00fczenli kod incelemelerini ve sanitizer gibi ara\u00e7lar\u0131 bir arada kullanarak UB riskini \u00f6nemli \u00f6l\u00e7\u00fcde en aza indirmek m\u00fcmk\u00fcnd\u00fcr. Ama\u00e7, hatay\u0131 s\u0131f\u0131ra indirmekten ziyade, hatay\u0131 yakalama ve \u00f6nleme oran\u0131n\u0131 maksimize etmektir.\n    <\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"C++ d\u00fcnyas\u0131nda yolculu\u011fa \u00e7\u0131kan her geli\u015ftirici, bir noktada dilin kendine has \u00f6zellikleriyle y\u00fczle\u015fir ve &#8220;Bunu beklemiyordum!&#8221; nidalar\u0131yla kar\u015f\u0131la\u015f\u0131r.&hellip;","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"csco_page_header_type":"","csco_page_load_nextpost":"","csco_page_subscribe_form":"","csco_page_contact_form":"","footnotes":""},"categories":[1489],"tags":[],"class_list":{"0":"post-33824","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-c-2","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v20.5 (Yoast SEO v25.3.1) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>C++&#039;taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131<\/title>\n<meta name=\"description\" content=\"C++ d\u00fcnyas\u0131nda yolculu\u011fa \u00e7\u0131kan her geli\u015ftirici, bir noktada dilin kendine has \u00f6zellikleriyle y\u00fczle\u015fir ve &quot;Bunu beklemiyordum!&quot; nidalar\u0131yla kar\u015f\u0131la\u015f\u0131r. G\u00fc\u00e7l\u00fc performans\u0131 ve d\u00fc\u015f\u00fck seviye kontrol yetene\u011fiyle \u00f6ne \u00e7\u0131kan C++, bazen de tahmin edilemez davran\u0131\u015flar sergileyebilir. Bu makalede, C++&#039;\u0131n s\u0131kl\u0131kla kar\u015f\u0131m\u0131za \u00e7\u0131kard\u0131\u011f\u0131, deneyimli geli\u015ftiricileri bile \u015fa\u015f\u0131rtabilen bu &quot;s\u00fcrprizleri&quot; mercek alt\u0131na al\u0131yor, \u00f6zellikle tan\u0131ms\u0131z davran\u0131\u015flar\u0131n (Undefined Behavior) perde arkas\u0131n\u0131 ayd\u0131nlat\u0131yor ve bu tuzaklardan nas\u0131l ka\u00e7\u0131nabilece\u011finizi ad\u0131m ad\u0131m inceliyoruz.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"C++&#039;taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131\" \/>\n<meta property=\"og:description\" content=\"C++ d\u00fcnyas\u0131nda yolculu\u011fa \u00e7\u0131kan her geli\u015ftirici, bir noktada dilin kendine has \u00f6zellikleriyle y\u00fczle\u015fir ve &quot;Bunu beklemiyordum!&quot; nidalar\u0131yla kar\u015f\u0131la\u015f\u0131r. G\u00fc\u00e7l\u00fc performans\u0131 ve d\u00fc\u015f\u00fck seviye kontrol yetene\u011fiyle \u00f6ne \u00e7\u0131kan C++, bazen de tahmin edilemez davran\u0131\u015flar sergileyebilir. Bu makalede, C++&#039;\u0131n s\u0131kl\u0131kla kar\u015f\u0131m\u0131za \u00e7\u0131kard\u0131\u011f\u0131, deneyimli geli\u015ftiricileri bile \u015fa\u015f\u0131rtabilen bu &quot;s\u00fcrprizleri&quot; mercek alt\u0131na al\u0131yor, \u00f6zellikle tan\u0131ms\u0131z davran\u0131\u015flar\u0131n (Undefined Behavior) perde arkas\u0131n\u0131 ayd\u0131nlat\u0131yor ve bu tuzaklardan nas\u0131l ka\u00e7\u0131nabilece\u011finizi ad\u0131m ad\u0131m inceliyoruz.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2025-11-07T12:31:13+00:00\" \/>\n<meta name=\"author\" content=\"Fatih Soysal\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Yazan:\" \/>\n\t<meta name=\"twitter:data1\" content=\"Fatih Soysal\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tahmini okuma s\u00fcresi\" \/>\n\t<meta name=\"twitter:data2\" content=\"4 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"C++&#8217;taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131\",\"datePublished\":\"2025-11-07T12:31:13+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/\"},\"wordCount\":4109,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"articleSection\":[\"C++\"],\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/\",\"name\":\"C++'taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2025-11-07T12:31:13+00:00\",\"description\":\"C++ d\u00fcnyas\u0131nda yolculu\u011fa \u00e7\u0131kan her geli\u015ftirici, bir noktada dilin kendine has \u00f6zellikleriyle y\u00fczle\u015fir ve \\\"Bunu beklemiyordum!\\\" nidalar\u0131yla kar\u015f\u0131la\u015f\u0131r. G\u00fc\u00e7l\u00fc performans\u0131 ve d\u00fc\u015f\u00fck seviye kontrol yetene\u011fiyle \u00f6ne \u00e7\u0131kan C++, bazen de tahmin edilemez davran\u0131\u015flar sergileyebilir. Bu makalede, C++'\u0131n s\u0131kl\u0131kla kar\u015f\u0131m\u0131za \u00e7\u0131kard\u0131\u011f\u0131, deneyimli geli\u015ftiricileri bile \u015fa\u015f\u0131rtabilen bu \\\"s\u00fcrprizleri\\\" mercek alt\u0131na al\u0131yor, \u00f6zellikle tan\u0131ms\u0131z davran\u0131\u015flar\u0131n (Undefined Behavior) perde arkas\u0131n\u0131 ayd\u0131nlat\u0131yor ve bu tuzaklardan nas\u0131l ka\u00e7\u0131nabilece\u011finizi ad\u0131m ad\u0131m inceliyoruz.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"C++&#8217;taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/\",\"name\":\"Fatihsoysal.com\",\"description\":\"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim\",\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"tr\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\",\"name\":\"Fatih Soysal\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"tr\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"contentUrl\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"width\":512,\"height\":512,\"caption\":\"Fatih Soysal\"},\"logo\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\"},\"description\":\"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"C++'taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131","description":"C++ d\u00fcnyas\u0131nda yolculu\u011fa \u00e7\u0131kan her geli\u015ftirici, bir noktada dilin kendine has \u00f6zellikleriyle y\u00fczle\u015fir ve \"Bunu beklemiyordum!\" nidalar\u0131yla kar\u015f\u0131la\u015f\u0131r. G\u00fc\u00e7l\u00fc performans\u0131 ve d\u00fc\u015f\u00fck seviye kontrol yetene\u011fiyle \u00f6ne \u00e7\u0131kan C++, bazen de tahmin edilemez davran\u0131\u015flar sergileyebilir. Bu makalede, C++'\u0131n s\u0131kl\u0131kla kar\u015f\u0131m\u0131za \u00e7\u0131kard\u0131\u011f\u0131, deneyimli geli\u015ftiricileri bile \u015fa\u015f\u0131rtabilen bu \"s\u00fcrprizleri\" mercek alt\u0131na al\u0131yor, \u00f6zellikle tan\u0131ms\u0131z davran\u0131\u015flar\u0131n (Undefined Behavior) perde arkas\u0131n\u0131 ayd\u0131nlat\u0131yor ve bu tuzaklardan nas\u0131l ka\u00e7\u0131nabilece\u011finizi ad\u0131m ad\u0131m inceliyoruz.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/","og_locale":"tr_TR","og_type":"article","og_title":"C++'taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131","og_description":"C++ d\u00fcnyas\u0131nda yolculu\u011fa \u00e7\u0131kan her geli\u015ftirici, bir noktada dilin kendine has \u00f6zellikleriyle y\u00fczle\u015fir ve \"Bunu beklemiyordum!\" nidalar\u0131yla kar\u015f\u0131la\u015f\u0131r. G\u00fc\u00e7l\u00fc performans\u0131 ve d\u00fc\u015f\u00fck seviye kontrol yetene\u011fiyle \u00f6ne \u00e7\u0131kan C++, bazen de tahmin edilemez davran\u0131\u015flar sergileyebilir. Bu makalede, C++'\u0131n s\u0131kl\u0131kla kar\u015f\u0131m\u0131za \u00e7\u0131kard\u0131\u011f\u0131, deneyimli geli\u015ftiricileri bile \u015fa\u015f\u0131rtabilen bu \"s\u00fcrprizleri\" mercek alt\u0131na al\u0131yor, \u00f6zellikle tan\u0131ms\u0131z davran\u0131\u015flar\u0131n (Undefined Behavior) perde arkas\u0131n\u0131 ayd\u0131nlat\u0131yor ve bu tuzaklardan nas\u0131l ka\u00e7\u0131nabilece\u011finizi ad\u0131m ad\u0131m inceliyoruz.","og_url":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2025-11-07T12:31:13+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"4 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"C++&#8217;taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131","datePublished":"2025-11-07T12:31:13+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/"},"wordCount":4109,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"articleSection":["C++"],"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/","url":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/","name":"C++'taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2025-11-07T12:31:13+00:00","description":"C++ d\u00fcnyas\u0131nda yolculu\u011fa \u00e7\u0131kan her geli\u015ftirici, bir noktada dilin kendine has \u00f6zellikleriyle y\u00fczle\u015fir ve \"Bunu beklemiyordum!\" nidalar\u0131yla kar\u015f\u0131la\u015f\u0131r. G\u00fc\u00e7l\u00fc performans\u0131 ve d\u00fc\u015f\u00fck seviye kontrol yetene\u011fiyle \u00f6ne \u00e7\u0131kan C++, bazen de tahmin edilemez davran\u0131\u015flar sergileyebilir. Bu makalede, C++'\u0131n s\u0131kl\u0131kla kar\u015f\u0131m\u0131za \u00e7\u0131kard\u0131\u011f\u0131, deneyimli geli\u015ftiricileri bile \u015fa\u015f\u0131rtabilen bu \"s\u00fcrprizleri\" mercek alt\u0131na al\u0131yor, \u00f6zellikle tan\u0131ms\u0131z davran\u0131\u015flar\u0131n (Undefined Behavior) perde arkas\u0131n\u0131 ayd\u0131nlat\u0131yor ve bu tuzaklardan nas\u0131l ka\u00e7\u0131nabilece\u011finizi ad\u0131m ad\u0131m inceliyoruz.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/ctaki-beklenmedik-davranislar-belirsizligin-perde-arkasi\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"C++&#8217;taki Beklenmedik Davran\u0131\u015flar: Belirsizli\u011fin Perde Arkas\u0131"}]},{"@type":"WebSite","@id":"https:\/\/fatihsoysal.com\/blog\/#website","url":"https:\/\/fatihsoysal.com\/blog\/","name":"Fatihsoysal.com","description":"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim","publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"tr"},{"@type":["Person","Organization"],"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1","name":"Fatih Soysal","image":{"@type":"ImageObject","inLanguage":"tr","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","contentUrl":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","width":512,"height":512,"caption":"Fatih Soysal"},"logo":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/"},"description":"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.","url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/"}]}},"yoast_meta":{"yoast_wpseo_title":"","yoast_wpseo_metadesc":"","yoast_wpseo_canonical":""},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/33824","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/comments?post=33824"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/33824\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=33824"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=33824"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=33824"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}