Compare commits

..

14 Commits

Author SHA1 Message Date
saqut e6c531ad74 LICENSE.md Ekle
Signed-off-by: saqut <saqut@noreply.localhost>
2026-06-14 23:17:21 +03:00
saqut 1eda64f3bb chore: Gitea issue yönetim betikleri ekle
Faz 0-4 ve gelecek vizyonu issue'larını oluşturmak için kullanılan
yardımcı betikler (gitea.py API istemcisi + issue içerikleri).

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-06-14 22:44:30 +03:00
saqut 0fed19be06 docs: belgeleri yeniden hizala (IR+VM modeli, kilitli kararlar)
- Calistirma modeli: "JIT" terimi birakildi -> IR + bytecode VM birincil;
  makine-kodu JIT kapsam disi (ADR-015). C-transpile ikinci backend.
- readme.md bastan yazildi: toolbox cercevesi, yapilan vs planlanan ayrimi.
- ADR amend: 007 (klon yuk tasir), 009 (fixpoint degismezi + analiz
  yeniden hesabi), 010 (literal baglama-gore tipleme), 011 (global baslatici
  uc-parcali kural + dongusel struct E010), 014 (bellek gerekcesi).
- Yeni ADR: 015 (IR+VM), 016 (FFI seam), 017 (batteries=sinir),
  018 (interface ertelendi), 019 (frontend<->runtime ayrimi).
- roadmap: bu hafta sembol tablosu->fibonacci; once dikey dilim; E010.
- examples: Final.sqt -> parser-stress/ (gecersiz fixture); yeni gecerli
  fibonacci.sqt eklendi.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-14 19:53:12 +03:00
saqut aefb88760a docs: frontend tasarim kararlari, transkript ve yol haritasi
Symbol table + semantic analiz + optimizasyon framework tasarim
oturumunun ciktilari:
- adr-frontend-analiz.md: ADR-006..014 (cok-asamali frontend, analiz/
  optimizasyon ayrimi, optimizasyon konumu, fixpoint, tip sistemi,
  scope/forward-reference, ExpressionNode/StatementNode, analiz verisi
  yeri, dil kapsami) — her karar gerekcesiyle.
- transkript-frontend-tasarim.md: oturum akiscinin sadik transkripti.
- roadmap-frontend.md: dosya-dosya uygulama plani (Faz 0..4).
2026-06-14 17:56:42 +03:00
saqut 323f309cb4 Merge branch 'feature/parser-modularization' 2026-06-14 15:58:18 +03:00
saqut 455ef87751 fix: kaynak dosya yolu propagasyonu ve AST JSON girinti hataları
- Tokenizer::scan artik filePath parametresi alip Lexer'a iletiyor;
  SourceLocation.file artik bos degil (Asama 0 tamamlandi).
- JsonObject::add icin const char* overload eklendi (kind: true bug'i).
- JsonObject acilis suslu parantezi girintisiz yaziliyor, addArray ilk
  eleman oncesi bos satir birakmiyor; LiteralNode/IdentifierNode toJson
  ayni sekilde duzeltildi.
- analysisToJson girinti seviyeleri "analysis" objesine gore duzeltildi.
2026-06-14 15:57:54 +03:00
saqut 03970871db chore: JsonObject builder, LiteralType enum, token.hpp doc cleanup 2026-05-27 10:53:18 +03:00
saqut 9a013c53d4 Gemini 2026-05-27 10:29:30 +03:00
saqut aa6400c098 Merge pull request 'refactor: modularize parser and AST components' (#68) from feature/parser-modularization into master
Reviewed-on: #68
2026-05-27 09:42:42 +03:00
saqut ee1e5213cf refactor: modularize parser and AST components 2026-05-27 09:42:14 +03:00
saqut c354d0b434 feat: implement source location tracking and enhance parser AST nodes 2026-05-27 09:39:47 +03:00
saqut 6aa0da2378 parser: function calls, struct, member/index access - Final.sqt parses successfully (289 tokens, 200+ AST nodes) 2026-05-26 17:27:06 +03:00
saqut 4d3150e811 cli: modular command system, AST JSON serialization, file split prep 2026-05-26 17:05:20 +03:00
saqut eb72680507 docs: todo.md (8 asamali yol haritasi) ve fikirler.md (backend ADR) 2026-05-26 00:41:04 +03:00
88 changed files with 1498 additions and 122782 deletions

11
.gitignore vendored
View File

@ -9,14 +9,3 @@ saqut
*.swp
*.swo
*~
# Parola içerebilen yerel API istemcisi - asla commit edilmez
scripts/gitea.py
# Python bytecode cache
__pycache__/
# CMake versiyona özgü dosyalar (otomatik üretilir, her güncellemede değişir)
build/CMakeFiles/[0-9]*/
build/.cmake/
build/compile_commands.json

102
CLAUDE.md
View File

@ -1,102 +0,0 @@
# CLAUDE.md — saQut Proje Bağlamı
> Bu dosya her oturumda yüklenir. Amaç: projenin kimliğini, kilitli kararları,
> mevcut durumu ve çalışma konvansiyonlarını hızlıca hatırlatmak.
## İletişim
- **Kullanıcıyla TÜM yazışmalar Türkçe.** (Sahibi: Abdussamed ULUTAŞ.)
## Proje nedir?
saQut, **programlanabilir ve incelenebilir bir derleyici** — bir "alet çantası"
(toolbox). Asıl varlık sebebi dilin kendisi değil, **derleme sürecinin her
aşamasının dışarıdan görülebilir/müdahale edilebilir olması**: token'lar, AST,
sembol tablosu, optimizasyon öncesi/sonrası ve IR ayrı ayrı incelenebilir.
Uygulama dili **C++** (header-only eğilimli, ADR-003). CMake + Ninja. `build/`
git'te izlenir.
## Kilitli kararlar (değiştirme — gerekçeler ADR'lerde)
- **Çalıştırma modeli: IR + bytecode VM (yorumlayıcı döngü).** Tree-walker DEĞİL,
gerçek makine-kodu JIT DEĞİL (kapsam dışı; öncelik determinizm + incelenebilirlik,
ham hız değil). C'ye transpile ileride geçerli 2. backend. İleride makine kodu
gerekirse libgccjit/LLVM'e bağlanılır (çok uzak). Bellek = host C++ heap; özel
allocator yok. (ADR-015)
- **Dil kimliği:** prosedürel, C-ailesi sözdizimi, value semantics, zorunlu
class/main boilerplate yok. **Yok:** class/OOP, closure, generic, kullanıcı
pointer'ı (`*`/`&`), auto/tip çıkarımı, gizli int↔float (tek istisna sabit
folding). **Var:** struct, tipli fonksiyonlar, array (`int[]`). `interface`
**ertelendi** (reddedilmedi, ADR-018).
- **Analiz vs Optimizasyon:** Analiz orijinal AST üstünde annotation; optimizasyon
**klon** üstünde dönüşüm. `ASTNode::clone()` yük taşıyan merkezi bileşen
(parent pointer'lar + sembol tablosu remap edilir, ADR-007). Fixpoint döngüsü +
iterasyon tavanı (`maxFixpointRounds`, ADR-009).
- **Literal/tip kuralı:** tamsayı literali bağlama-göre tiplenir (`float x = 1;`
geçerli; `int y = 1.5;`→E003; değişken→değişken gizli dönüşüm yok). Döngüsel
by-value struct → E010. (ADR-010/011)
- **FFI seam:** kasıtlı "host fonksiyonu çağır" mekanizması (`callhost`); `print`
ilk müşteri (ADR-016). Batteries = sınır/FFI problemi, "zlib'i yeniden yaz"
değil; kripto asla elle yazılmaz (ADR-017).
## Mevcut durum (yapılan vs planlanan)
- **Çalışıyor:** lexer, tokenizer, Pratt parser, AST, AST'nin JSON serileştirmesi,
CLI iskeleti (`tokens`/`ast`/`symbols`/`run`), konum takibi, basit aritmetiği
düşüren minimal IR deneyi.
- **Planlı (henüz YOK):** sembol tablosu, semantik analiz, tip sistemi, diagnostic
motoru, optimizasyon, IR+bytecode VM ile çalıştırma.
- **Birinci kilometre taşı ("bitti" tanımı):** `examples/fibonacci.sqt`
(recursive + iterative) derlenip çalıştırılabilmeli.
- **İlke:** Önce uçtan uca tek **dikey dilim**, sonra çerçeve. Erken soyutlamadan kaçın.
## Belge haritası
- `readme.md` — toolbox çerçevesi, built-vs-planned, dil kimliği, çalıştırma modeli.
- `docs/fikirler.md` — ADR-001…005 (backend stratejisi, parser, header-only, token, IR).
- `docs/adr-frontend-analiz.md` — ADR-006…019 (frontend, analiz/optimizasyon,
çalıştırma modeli, FFI, interface, bellek).
- `docs/roadmap-frontend.md` — faz-faz uygulama planı (Faz 04 → fibonacci).
- `docs/transkript-frontend-tasarim.md` — tasarım oturumu transkripti.
- `examples/fibonacci.sqt` — geçerli referans program.
- `examples/parser-stress/` — yalnızca parser'ı zorlayan, **geçerli olmayan** fixture'lar.
## Gitea issue yönetimi
- Repo: `git.saqut.com/saqut/saqut-compiler` (Gitea). Cloudflare, Python-urllib
User-Agent'ını banlıyor → tarayıcı User-Agent'ı şart.
- `scripts/gitea.py` — API istemcisi (`~/.git-credentials`'tan kimlik okur).
Komutlar: `list/get/create/edit/comment`. Toplu issue üretimi:
`scripts/create_issues.py`, `create_future_issues.py`, `create_syntax_test_issues.py`.
- **Issue yapısı (bu oturumda kuruldu):**
- **#6973** `faz-plani` — Faz 04 (Tip+Diagnostic, AST refactor, Symbol Table,
Semantik Analiz, Optimizasyon). Format: Giriş/Gelişme/Sonuç-Başarı Kriterleri +
mühendis-olmayan analiz.
- **#7498, #111** `fikir` — IR/VM tasarımı, modül/import, tip genişletmeleri
(decimal/date/enum/string), FFI/builtin/stdlib, tooling (LSP/highlight/fmt),
gelecek vizyonu (time-travel debug, WASM playground, test bloğu, paket yöneticisi).
Format: Giriş/Gelişme/**Açık Sorular** (başarı kriteri YOK).
- **#99105** `test-senaryosu` — kaynak kod + beklenen çıktı içeren golden-test'ler.
- **#106110** `cli-ux`/`kalite-mimari` — CLI fikirleri, C/Java/Go tarzı tavsiyeler.
- LSP (#91) ve CLI (#107) **Tier 04** katmanlı yetenek haritası olarak yazıldı;
#111 ekosistem bağımlılık sırası.
## Lisans (LICENSE.md — bu oturumda yeniden yazıldı)
- **Model:** "Kaynağıık — Ticari Kullanımı Kısıtlı" (açık kaynak ama **özgür
yazılım değil**). Önceki GPL-tarzı copyleft metin niyetle çelişiyordu, değiştirildi.
- **Çekirdek ilke:** Gelir saQut'un **ürettiği Çıktıdan** elde edilir, **saQut'un
kendisinden değil.**
- **Serbest (ticari dahil):** kod yazmak/derlemek, üretilen programları/exe/işlenmiş
veriyi satmak, derleyiciyi özel araç olarak iç kullanım.
- **İzin gerektirir (telif sahibinden):** derleyiciyi 3. tarafa kurup ücret almak,
Web-IDE/derleme servisi, canlı backend motoru, otomasyon/AI aracı, alt-bileşen
gömme, iç parçaları (AST/optimizatör) ticari yeniden kullanım. Runtime'a bağımlı
sürümlerde sunucu-tarafı ticari kullanım da bu kapsamda.
- **Maddeler:** §7 Katkı (PR herkese açık, **merge kararı yalnızca Abdussamed
ULUTAŞ**; katkı sahipleri ticari lisanslama dâhil hakları telif sahibine verir),
§8 Patent (lisans + dava açana otomatik fesih), §9 Marka ("saQut" adı korunur),
§11 Fesih (ihlalde otomatik + 30 gün düzeltme; edinilmiş Çıktı korunur).
- Üç dilde (TR/EN/DE), TR esas. Ticari lisans iletişimi: saqutsoftware+gitea@gmail.com
- **Not:** Bespoke lisans; ciddi ticari aşamada hukukçu gözden geçirmesi önerilir.
Telif yalnızca kodu/belgeyi korur, **fikri/tasarımı değil** (sıfırdan yeniden
yazım engellenemez); isim ise marka ile korunur.
## Çalışma konvansiyonları
- Commit mesajları sonunda: `Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>`.
- Ana dal `master`; commit/push kullanıcı isteyince yapılır.
- Wiki API'si Gitea'da REST üzerinden çalışmadı; wiki içeriği `wiki.md`'ye yazılıp
kullanıcı tarafından elle yapıştırılıyor.

View File

@ -2,233 +2,95 @@
[Türkçe Sürüm](#türkçe-lisans-sürümü) | [English Version](#english-license-version) | [Deutsche Version](#deutsche-lizenzversion)
> Bu lisans üç dilde sunulmuştur. Yorum farklılıklarında **Türkçe sürüm esas alınır.**
> This license is provided in three languages. In case of any discrepancy, the **Turkish version prevails.**
---
### Türkçe Lisans Sürümü
# saQut Lisansı (Sürüm 1.0)
**Kaynağıık — Ticari Kullanımı Kısıtlı Lisans**
# saQut Kamu Lisansı (Sürüm 1.0)
Telif Hakkı (c) 2026, Abdussamed ULUTAŞ (ve saQut Katkıda Bulunanları). Tüm hakları saklıdır.
Telif Hakkı (c) 2026, Abdussamed ULUTAŞ (ve saQut Katkıda Bulunanları).
Tüm hakları saklıdır.
Bu lisans; saQut derleyicisini, kaynak kodlarını, derleme betiklerini (build scripts), tüm backend bileşenlerini (yorumlayıcı, bytecode VM, derleyici ve transpiler) ve beraberindeki dokümantasyon ile mimari tasarımı (ADR belgeleri dâhil) — toplu olarak "Yazılım" olarak anılacaktır — kapsar.
Bu lisans; saQut Derleyicisi, kaynak kodları, derleme betikleri (build scripts) ve beraberindeki dokümantasyonu (toplu olarak "Yazılım" olarak anılacaktır) kapsar.
saQut açık kaynaklı (kaynağı görülebilir) bir projedir; ancak **özgür yazılım (free/libre software) değildir.** Yazılımın incelenmesi ve değiştirilmesi serbestken, ticari kullanımı işbu lisansın koşullarına ve telif hakkı sahibinin iznine tabidir.
---
#### 1. Temel Felsefe (Alet Çantası Kuralı)
saQut; programlanabilir ve incelenebilir bir derleyici alet çantası (toolbox) olarak tasarlanmıştır. Varlık sebebi, derleme sürecinin her aşamasının — token'lar, Soyut Sözdizimi Ağacı (AST), sembol tabloları ve Ara Temsil (IR) — dışarıdan şeffaf ve görülebilir kalmasıdır. Yazılımın her türlü yeniden dağıtımı ve üzerinde yapılacak değişiklikler bu şeffaflık ilkesini korumakla yükümlüdür.
saQut, programlanabilir ve incelenebilir bir derleyici alet çantası (toolbox) olarak tasarlanmıştır. Ana varlık sebebi; derleme sürecinin (Token'lar, AST, Sembol Tabloları ve IR) dışarıdan tamamen şeffaf ve görülebilir kalmasıdır. Bu Yazılımın her türlü yeniden dağıtımı veya üzerinde yapılacak değişiklikler bu şeffaflık ilkesine saygı duymak zorundadır.
#### 2. Tanımlar
- **Yazılım:** Yukarıda tanımlanan saQut derleyicisi ve tüm bileşenleri (kaynak kod, yorumlayıcı, bytecode VM, derleyici ve transpiler backend'leri, dokümantasyon ve mimari tasarım).
- **Çıktı:** Yazılım kullanılarak üretilen her şey; saQut dilinde yazılmış kaynak kodlar (`.sqt` dosyaları), token/AST/sembol tablosu dökümleri, üretilen bytecode, transpile edilmiş kaynak kod, bağımsız çalıştırılabilir dosyalar ve Yazılımın işlediği verilerden elde edilen sonuçlar.
- **Ticari Kullanım:** Yazılımın kendisinden doğrudan veya dolaylı olarak gelir elde edilmesi; Yazılımın bir ürün, hizmet, motor, bileşen veya otomasyon aracı olarak Üçüncü Taraflara sunulması, kurulması ya da onlar adına işletilmesi.
- **Üçüncü Taraf:** Yazılımı kullanan kişi veya kurum dışında kalan müşteri, son kullanıcı ya da diğer taraflar.
#### 2. İzinler ve Koşullar
Bu Yazılımın bir kopyasını edinen herhangi bir kişiye; aşağıdaki koşullara uymak kaydıyla, Yazılımı kullanma, kopyalama, değiştirme, birleştirme, yayınlama veya dağıtma hakkı ücretsiz olarak tanınmıştır:
#### 3. İnceleme, Değiştirme ve Ticari Olmayan Kullanım İzni
İşbu lisans kapsamında herkese, ücretsiz olarak aşağıdaki haklar tanınır:
- Yazılımı kişisel, eğitsel ve ticari olmayan amaçlarla kullanmak, incelemek ve çalıştırmak.
- Yazılımın kaynak kodunu incelemek ve değiştirmek.
- Değiştirilmiş veya değiştirilmemiş kopyaları ticari olmayan koşullarda dağıtmak. Ancak dağıtılan her kopya; (a) işbu lisansa tabi kalmalı, (b) kaynağıık (source-available) kalmalı ve (c) aşağıdaki Atıf Şartı'na uymalıdır.
* **Copyleft (Açık Kaynak Kalma) Şartı:** Eğer Yazılım üzerinde bir değişiklik yaparsanız (derleyici, lexer, parser, VM veya çekirdek mimari) ve bunu dağıtırsanız, değiştirdiğiniz kaynak kodları da BU AYNI LİSANS altında açık kaynaklı olarak herkese sunmak zorundasınız. saQut'u alıp kapalı kaynaklı, tescilli bir ticari ürüne dönüştüremezsiniz.
* **Atıf Şartı:** Orijinal telif hakkı bildirimi ve işbu izin bildirimi, Yazılımın tüm kopyalarına veya önemli parçalarına dahil edilmelidir.
* **İnceleme ve Şeffaflık Daveti:** saQut incelenmek için var olduğundan; bu derleyiciyi eğitim projelerinde, sınıflarda veya topluluk sunumlarında kullanırsanız, öğrencilerinize veya dinleyicilerinize en az bir kez `saqut tokens` veya `saqut ast` çıktılarını göstermeniz önemle tavsiye edilir (hukuki bir zorunluluk değildir). İç mekanizmayı görünür tutun!
#### 4. Çıktı ve Sonuç İstisnası (KRİTİK)
Yazılımı kullanan geliştiricilerin özgürlüğünü güvence altına almak amacıyla:
- **Çıktı sizindir.** Bölüm 2'de tanımlanan tüm Çıktı, işbu lisansın kısıtlamalarına **tabi değildir.** Geliştiriciler kendi Çıktılarını diledikleri gibi kullanma, kapatma (kapalı kaynak yapma), lisanslama ve **ticari olarak satma** hakkına tam olarak sahiptir.
- **Gelir, Çıktıdan elde edilir.** Yazılımı kendi makinenizde (kişisel veya kurumsal) özel bir araç olarak kullanıp ürettiğiniz programları, bağımsız çalıştırılabilir dosyaları veya işlenmiş verileri (örneğin bir Excel raporu veya bir veritabanı sonucu) satmanız serbesttir. Bu durumda Üçüncü Taraf, Yazılımı değil yalnızca sonucu alır.
#### 3. Runtime (Çalışma Zamanı) ve Çıktı İstisnası (KRİTİK)
Bu dili kullanan geliştiricilerin mutlak özgürlüğünü garanti altına almak adına:
* **Kodunuz Sizindir:** saQut diliyle yazılmış tüm kaynak kodları (örn. `.sqt` dosyaları) ve derleyici tarafından üretilen tüm veriler (JSON AST dökümleri, sembol tabloları veya derlenmiş bytecode çıktısı) bu lisansın kısıtlamalarına **TABİ DEĞİLDİR**.
* Geliştiriciler, kendi saQut programlarının kaynak kodlarını ve derleyici çıktılarını istedikleri gibi lisanslamakta, satmakta veya kapalı kaynak yapmakta tamamen özgürdür. saQut tarafından sağlanan çalışma zamanı ortamı (runtime/VM), bu ortamı barındıran ana uygulamaların lisanslarını kısıtlamaksızın diğer uygulamaların içine gömülebilir (embed edilebilir).
#### 5. Ticari Kısıtlamalar
Aşağıdaki kullanımlar, Yazılımın bizzat kendisinden gelir elde edilmesi anlamına geldiğinden, telif hakkı sahibinin önceden yazılı izni olmaksızın yapılamaz:
- Yazılımı bir Üçüncü Taraf'ın sunucusuna veya cihazına kurup çalıştırılması karşılığında ücret almak (örneğin bir müşteri için `saqut run yedek.sql` komutunu çalıştırıp ücret talep etmek).
- Yazılımı çevrimiçi bir hizmet olarak sunmak (Web tabanlı IDE, çevrimiçi derleme veya çalıştırma servisi).
- Yazılımı, Üçüncü Tarafların canlı istekleriyle işleyen ticari bir hizmetin backend'i veya motoru hâline getirmek.
- Yazılımı ticari bir otomasyon/iş hattının (pipeline) aracı olarak işletmek ya da bir yapay zekâ sistemine araç olarak sağlamak.
- Yazılımı ticari bir ürünün alt bileşeni olarak gömmek (embed).
- Yazılımın iç bileşenlerini veya mimari tasarımını (örneğin AST görüntüleme veya optimizasyon algoritmaları) ticari bir özellik ya da ürün olarak yeniden kullanmak.
**Sunucu ve sürüm notu:** Yazılım çalışmak için saQut çalışma zamanına (yorumlayıcı / bytecode VM) ihtiyaç duyduğu sürece, sunucu tarafındaki her ticari kullanım fiilen Yazılımı sunucuya yerleştirmek anlamına gelir ve bu nedenle yukarıdaki kısıtlamalara tabidir. Yazılımın, saQut çalışma zamanına ihtiyaç duymayan bağımsız çalıştırılabilir dosyalar üreten backend'i kullanıma sunulduğunda; bu tür bağımsız Çıktıların sunucuda ticari olarak çalıştırılması Bölüm 4 kapsamında serbesttir.
#### 6. İzin ve Ticari Lisans
Bölüm 5'te sayılan kısıtlamaların tamamı yalnızca telif hakkı sahibine aittir ve istisna tanıma yetkisi münhasıran ona aittir. Bu kullanımlardan herhangi birini gerçekleştirmek isteyen kişi veya kurum, telif hakkı sahibinden (Abdussamed ULUTAŞ) önceden yazılı izin talep edebilir; izin verildiği takdirde ilgili kullanım serbest hâle gelir.
İletişim (ticari lisans talepleri): saqutsoftware+gitea@gmail.com
#### 7. Katkılar (Contributions)
saQut'a katkı herkese açık bir öneri sürecidir; ancak nihai karar münhasıran telif hakkı sahibine aittir.
- Herhangi biri değişiklik önerisi (Pull Request / PR) açabilir. Bir katkının projeye dâhil edilip edilmeyeceğine ve birleştirilip (merge) birleştirilmeyeceğine **yalnızca Abdussamed ULUTAŞ karar verir.** Hiç kimsenin, bir katkısını projeye dâhil ettirme yönünde bir hakkı yoktur.
- Bir katkıyı (kod, belge, tasarım veya başka bir materyal) gönderen kişi, bu katkıyı göndermekle telif hakkı sahibine (Abdussamed ULUTAŞ); katkı üzerinde **dünya çapında, süresiz, geri alınamaz, ücretsiz ve alt-lisans verilebilir** bir kullanma, çoğaltma, değiştirme, dağıtma ve **ticari olarak lisanslama** hakkı tanır. Bu hak, telif hakkı sahibinin katkıyı içeren Yazılımı Bölüm 6 kapsamında ticari olarak lisanslayabilmesini güvence altına alır.
- Katkıda bulunan; gönderdiği materyalin kendi eseri olduğunu veya gerekli haklara sahip bulunduğunu ve bu izni vermeye yetkili olduğunu beyan eder. Katkıda bulunanlar, kendi katkıları üzerindeki telif haklarını korur; yukarıdaki izin bu haklara ek olarak verilir.
#### 8. Patent Hakları
- **Patent lisansı:** İşbu lisans kapsamında Yazılımı kullanma hakkına sahip olan her kişiye; telif hakkı sahibi ve katkıda bulunanlar tarafından sahip olunan ve Yazılımın bu lisansça izin verilen biçimde kullanılması için zorunlu olarak ihlal edilen patent istemleri bakımından, ücretsiz ve (aşağıdaki fesih hükmü saklı kalmak kaydıyla) geri alınamaz bir patent lisansı tanınır.
- **Patent misillemesi (otomatik fesih):** Eğer bir kişi veya kurum, Yazılımın bu lisansça izin verilen kullanımının bir patenti ihlal ettiğini ileri sürerek telif hakkı sahibine veya herhangi bir katkıda bulunana karşı **patent davası** açarsa, işbu lisans kapsamında o kişiye/kuruma tanınan tüm haklar (patent lisansı dâhil) **otomatik olarak sona erer.**
#### 9. Marka ve İsim Hakları
İşbu lisans; "saQut" adı, logosu veya ilgili marka unsurları üzerinde **hiçbir hak tanımaz.** Özellikle:
- Yazılımın değiştirilmiş bir sürümünü dağıtırsanız, bu sürümü "saQut" adıyla veya bu adı çağrıştıracak ya da karıştırılmaya yol açabilecek bir adla adlandıramazsınız.
- Telif hakkı sahibinin önceden yazılı izni olmadan, "saQut" adını ürünlerinizde, hizmetlerinizde veya tanıtımlarınızda bir onay/destek ima edecek biçimde kullanamazsınız.
- Yazılımın kaynağına ve telif hakkı sahibine yapılan dürüst ve tanımlayıcı atıflar (örneğin "saQut tabanlıdır") bu maddenin kapsamı dışındadır.
#### 10. Atıf Şartı
Orijinal telif hakkı bildirimi ile işbu izin bildirimi, Yazılımın tüm kopyalarına veya önemli parçalarına dâhil edilmelidir.
#### 11. Fesih (Termination)
- İşbu lisansın koşullarından herhangi birini ihlal etmeniz hâlinde, lisans kapsamında size tanınan tüm haklar **otomatik olarak sona erer.**
- İhlaliniz düzeltilebilir nitelikteyse ve ihlali öğrendikten sonra **30 (otuz) gün** içinde giderirseniz — telif hakkı sahibi bu süre içinde lisansııkça feshetmemiş olmak kaydıyla — haklarınız yeniden yürürlüğe girer. Aynı kişinin tekrarlayan ihlallerinde bu düzeltme imkânı uygulanmaz.
- Haklarınızın sona ermesi, daha önce işbu lisansa uygun olarak edindiğiniz Çıktı (Bölüm 4) üzerindeki haklarınızı etkilemez.
- Garanti reddi ve sorumluluk sınırlamaları, fesihten sonra da yürürlükte kalmaya devam eder.
#### 12. Garanti Reddi
YAZILIM "OLDUĞU GİBİ" SUNULMAKTADIR; TİCARETE UYGUNLUK, BELİRLİ BİR AMACA UYGUNLUK VE İHLAL ETMEME GARANTİLERİ DAHİL ANCAK BUNLARLA SINIRLI OLMAMAK ÜZERE, AÇIK VEYA ZIMNİ HİÇBİR GARANTİ VERİLMEMEKTEDİR. YAZARLAR VEYA TELİF HAKKI SAHİPLERİ, YAZILIMLA VEYA YAZILIMIN KULLANIMIYLA YA DA DİĞER İŞLEMLERLE BAĞLANTILI OLARAK ORTAYA ÇIKAN SÖZLEŞME, HAKSIZ FİİL VEYA DİĞER DURUMLARDAKİ HİÇBİR TALEP, TAZMİNAT VEYA DİĞER YÜKÜMLÜLÜKLERDEN SORUMLU TUTULAMAZ.
#### 4. Garanti Reddi
YAZILIM "OLDUĞU GİBİ" SUNULMAKTADIR; TİCARETE UYGUNLUK, BELİRLİ BİR AMACA UYGUNLUK VE İHLAL ETMEME GARANTİLERİ DAHİL ANCAK BUNLARLA SINIRLI OLMAMAK ÜZERE, AÇIK VEYA ZIMNİ HERHANGİ BİR GARANTİ VERİLMEMEKTEDİR. YAZARLAR VEYA TELİF HAKKI SAHİPLERİ, YAZILIMLA VEYA YAZILIMIN KULLANIMIYLA YA DA DİĞER İŞLEMLERLE BAĞLANTILI OLARAK ORTAYA ÇIKAN SÖZLEŞME, HAKSIZ FİİL VEYA DİĞER DURUMLARDAKİ HİÇBİR TALEP, TAZMİNAT VEYA DİĞER YÜKÜMLÜLÜKLERDEN SORUMLU TUTULAMAZ.
---
### English License Version
# The saQut License (Version 1.0)
**Source-Available — Commercial-Use Restricted License**
# The saQut Public License (Version 1.0)
Copyright (c) 2026, Abdussamed ULUTAŞ (and saQut Contributors). All rights reserved.
Copyright (c) 2026, Abdussamed ULUTAŞ (and saQut Contributors).
All rights reserved.
This license applies to the saQut compiler, its source code, build scripts, all backend components (the interpreter, the bytecode VM, the compiler, and the transpiler), and the accompanying documentation and architectural design (including the ADR documents) — collectively referred to as "the Software".
This license applies to the saQut Compiler, its source code, build scripts, and accompanying documentation (collectively referred to as "the Software").
saQut is an open-source (source-available) project; however, it is **not free/libre software.** While inspecting and modifying the Software is permitted, its commercial use is subject to the terms of this license and to the permission of the copyright holder.
---
#### 1. Core Philosophy (The Toolbox Rule)
saQut is designed as a programmable, inspectable compiler toolbox. Its reason for existence is to keep every stage of the compilation process — tokens, the Abstract Syntax Tree (AST), symbol tables, and the Intermediate Representation (IR) — transparent and observable from the outside. Any redistribution or modification of the Software must preserve this principle of transparency.
#### 1. The Core Philosophy (The Toolbox Rule)
saQut is designed as a programmable, inspectable compiler toolbox. Its core purpose is to keep the compilation process transparent (Tokens, AST, Symbol Tables, and IR). Any redistribution or modification of this Software must respect this transparency.
#### 2. Definitions
- **The Software:** The saQut compiler and all of its components as defined above (source code, interpreter, bytecode VM, compiler and transpiler backends, documentation, and architectural design).
- **Output:** Anything produced using the Software; source code written in the saQut language (`.sqt` files), token/AST/symbol-table dumps, generated bytecode, transpiled source code, standalone executables, and any results derived from data processed by the Software.
- **Commercial Use:** Deriving revenue, directly or indirectly, from the Software itself; offering, deploying, or operating the Software as a product, service, engine, component, or automation tool for or on behalf of Third Parties.
- **Third Party:** Any customer, end user, or other party other than the person or organization using the Software.
#### 2. Permissions & Conditions
Permission is hereby granted, free of charge, to any person obtaining a copy of this Software, to use, copy, modify, merge, publish, or distribute the Software, subject to the following conditions:
#### 3. Permission to Inspect, Modify, and Use Non-Commercially
This license grants everyone, free of charge, the following rights:
- To use, inspect, and run the Software for personal, educational, and non-commercial purposes.
- To inspect and modify the source code of the Software.
- To distribute modified or unmodified copies under non-commercial terms, provided that each distributed copy (a) remains under this license, (b) remains source-available, and (c) complies with the Attribution Requirement below.
* **The Copyleft Requirement:** If you modify the Software (the compiler, lexer, parser, VM, or core architecture) and distribute it, you MUST make your modified source code publicly available under this same license. You cannot turn saQut into a closed-source proprietary product.
* **The Attribution Requirement:** The original copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
* **The Inspection Invitation:** Since saQut is built to be inspected, if you use this compiler in an educational project, classroom, or public presentation, you are highly encouraged (though not legally forced) to show your students or audience the output of `saqut tokens` or `saqut ast` at least once. Keep the internals visible!
#### 4. The Output & Results Exception (CRITICAL)
To safeguard the freedom of developers using the Software:
- **Your Output is yours.** All Output as defined in Section 2 is **not** subject to the restrictions of this license. Developers retain the full right to use, close (make proprietary), license, and **sell commercially** their own Output.
- **Revenue is earned from the Output.** You are free to use the Software as a private tool on your own machine (personal or corporate) and to sell the programs, standalone executables, or processed data you produce (for example, an Excel report or a database result). In such cases the Third Party receives only the result, not the Software.
#### 3. The Runtime & Output Exception (CRITICAL)
To ensure the absolute freedom of the developers using this language:
* **Your Code is Yours:** Any source code written *in* the saQut language (e.g., `.sqt` files), and any data generated *by* the compiler (such as JSON AST dumps, symbol tables, or compiled bytecode) are **NOT** subject to this license.
* Developers are completely free to license, sell, or close the source code of their own saQut programs and compiler outputs as they see fit. The runtime environment/VM provided by saQut may be embedded into other applications without restricting those applications' licenses.
#### 5. Commercial Restrictions
Because the following uses amount to deriving revenue from the Software itself, they may not be carried out without the prior written permission of the copyright holder:
- Installing the Software on a Third Party's server or device and charging for its execution (for example, running `saqut run backup.sql` for a customer for a fee).
- Offering the Software as an online service (a web-based IDE, or an online compilation or execution service).
- Making the Software the backend or engine of a commercial service that is driven by the live requests of Third Parties.
- Operating the Software as a tool within a commercial automation pipeline, or providing it as a tool to an artificial-intelligence system.
- Embedding the Software as a sub-component of a commercial product.
- Repurposing the internal components or architectural design of the Software (for example, its AST visualization or optimization algorithms) as a commercial feature or product.
**Server and version note:** As long as the Software requires the saQut runtime (the interpreter / bytecode VM) in order to run, any commercial server-side use effectively places the Software on the server and is therefore subject to the restrictions above. Once a backend that produces standalone executables not requiring the saQut runtime becomes available, running such standalone Output commercially on a server is permitted under Section 4.
#### 6. Permission and Commercial Licensing
All restrictions listed in Section 5 belong solely to the copyright holder, who has the exclusive authority to grant exceptions. Any person or organization wishing to carry out any of these uses may request prior written permission from the copyright holder (Abdussamed ULUTAŞ); once granted, the relevant use becomes permitted.
Contact (commercial-license requests): saqutsoftware+gitea@gmail.com
#### 7. Contributions
Contributing to saQut is an open proposal process; however, the final decision rests solely with the copyright holder.
- Anyone may open a change proposal (a Pull Request / PR). Whether a contribution is included in the project and whether it is merged is decided **solely by Abdussamed ULUTAŞ.** No one has any right to have their contribution included in the project.
- By submitting a contribution (code, documentation, design, or other material), the contributor grants the copyright holder (Abdussamed ULUTAŞ) a **worldwide, perpetual, irrevocable, royalty-free, and sublicensable** right to use, reproduce, modify, distribute, and **license commercially** that contribution. This right ensures that the copyright holder may license the Software including the contribution on a commercial basis under Section 6.
- The contributor represents that the submitted material is their own work or that they hold the necessary rights, and that they are authorized to grant this permission. Contributors retain copyright in their own contributions; the permission above is granted in addition to those rights.
#### 8. Patent Rights
- **Patent license:** Subject to this license, each person who has the right to use the Software is granted a royalty-free and (except as stated in the termination provision below) irrevocable patent license, under those patent claims owned by the copyright holder and contributors that are necessarily infringed by using the Software in the manner permitted by this license.
- **Patent retaliation (automatic termination):** If any person or entity initiates **patent litigation** against the copyright holder or any contributor, alleging that the use of the Software as permitted by this license infringes a patent, then all rights granted to that person or entity under this license (including the patent license) **terminate automatically.**
#### 9. Trademark and Name Rights
This license grants **no rights** in the "saQut" name, logo, or related trademark elements. In particular:
- If you distribute a modified version of the Software, you may not name that version "saQut" or use a name that evokes or is confusingly similar to it.
- You may not use the "saQut" name in your products, services, or promotions in a way that implies endorsement, without the prior written permission of the copyright holder.
- Honest, descriptive references to the origin of the Software and to the copyright holder (for example, "based on saQut") fall outside the scope of this section.
#### 10. Attribution Requirement
The original copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
#### 11. Termination
- Upon your breach of any of the terms of this license, all rights granted to you under it **terminate automatically.**
- If your breach is curable and you cure it within **30 (thirty) days** of becoming aware of it — provided the copyright holder has not expressly terminated the license during that period — your rights are reinstated. This cure opportunity does not apply to repeated breaches by the same person.
- Termination of your rights does not affect your rights in any Output (Section 4) you previously obtained in compliance with this license.
- The disclaimer of warranty and the limitations of liability survive termination.
#### 12. Disclaimer of Warranty
#### 4. Disclaimer of Warranty
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
---
### Deutsche Lizenzversion
# Die saQut-Lizenz (Version 1.0)
**Quelloffene Lizenz mit eingeschränkter kommerzieller Nutzung**
# Die saQut Öffentliche Lizenz (Version 1.0)
Copyright (c) 2026, Abdussamed ULUTAŞ (und saQut-Mitwirkende). Alle Rechte vorbehalten.
Copyright (c) 2026, Abdussamed ULUTAŞ (und saQut Mitwirkende).
Alle Rechte vorbehalten.
Diese Lizenz gilt für den saQut-Compiler, seinen Quellcode, die Build-Skripte, alle Backend-Komponenten (den Interpreter, die Bytecode-VM, den Compiler und den Transpiler) sowie die dazugehörige Dokumentation und den architektonischen Entwurf (einschließlich der ADR-Dokumente) — zusammenfassend als „die Software" bezeichnet.
Diese Lizenz gilt für den saQut-Compiler, seinen Quellcode, Build-Skripte und die dazugehörige Dokumentation (zusammenfassend als „die Software“ bezeichnet).
saQut ist ein quelloffenes (einsehbares) Projekt; es ist jedoch **keine freie Software (Free/Libre Software).** Während das Einsehen und Verändern der Software gestattet ist, unterliegt ihre kommerzielle Nutzung den Bedingungen dieser Lizenz und der Genehmigung des Urheberrechtsinhabers.
---
#### 1. Die Kernphilosophie (Die Toolbox-Regel)
saQut ist als programmierbare, inspizierbare Compiler-Toolbox konzipiert. Ihr Daseinszweck ist es, jede Phase des Kompilierungsprozesses — Tokens, den Abstrakten Syntaxbaum (AST), Symboltabellen und die Zwischendarstellung (IR) — von außen transparent und einsehbar zu halten. Jede Weitergabe oder Veränderung der Software muss diesen Grundsatz der Transparenz wahren.
saQut ist als programmierbare, inspizierbare Compiler-Toolbox konzipiert. Der Hauptzweck besteht darin, den Kompilierungsprozess (Tokens, AST, Symboltabellen und IR) transparent zu halten. Jede Weitergabe oder Änderung dieser Software muss diese Transparenz respektieren.
#### 2. Definitionen
- **Die Software:** Der oben definierte saQut-Compiler und alle seine Komponenten (Quellcode, Interpreter, Bytecode-VM, Compiler- und Transpiler-Backends, Dokumentation und architektonischer Entwurf).
- **Ausgabe:** Alles, was mithilfe der Software erzeugt wird; in der saQut-Sprache geschriebener Quellcode (`.sqt`-Dateien), Token-/AST-/Symboltabellen-Ausgaben, erzeugter Bytecode, transpilierter Quellcode, eigenständige ausführbare Dateien sowie alle Ergebnisse, die aus von der Software verarbeiteten Daten gewonnen werden.
- **Kommerzielle Nutzung:** Das direkte oder indirekte Erzielen von Einnahmen aus der Software selbst; das Anbieten, Bereitstellen oder Betreiben der Software als Produkt, Dienst, Engine, Komponente oder Automatisierungswerkzeug für oder im Auftrag von Dritten.
- **Dritte:** Jeder Kunde, Endnutzer oder sonstige Partei außer der Person oder Organisation, die die Software nutzt.
#### 2. Berechtigungen & Bedingungen
Hiermit wird jeder Person, die eine Kopie dieser Software erhält, kostenlos die Berechtigung erteilt, die Software zu nutzen, zu kopieren, zu modifizieren, zusammenzufügen, zu veröffentlichen oder zu verbreiten, sofern folgende Bedingungen erfüllt sind:
#### 3. Genehmigung zum Einsehen, Verändern und zur nicht-kommerziellen Nutzung
Diese Lizenz gewährt jeder Person kostenlos die folgenden Rechte:
- Die Software zu persönlichen, schulischen/bildenden und nicht-kommerziellen Zwecken zu nutzen, einzusehen und auszuführen.
- Den Quellcode der Software einzusehen und zu verändern.
- Veränderte oder unveränderte Kopien unter nicht-kommerziellen Bedingungen weiterzugeben, sofern jede weitergegebene Kopie (a) dieser Lizenz unterstellt bleibt, (b) quelloffen (source-available) bleibt und (c) der nachstehenden Namensnennung-Bedingung entspricht.
* **Die Copyleft-Bedingung:** Wenn Sie die Software verändern (Compiler, Lexer, Parser, VM oder Kernarchitektur) und verbreiten, MÜSSEN Sie Ihren geänderten Quellcode unter derselben Lizenz öffentlich zugänglich machen. Sie dürfen saQut nicht in ein proprietäres Closed-Source-Produkt umwandeln.
* **Die Namensnennung-Bedingung:** Der obige Urheberrechtshinweis und dieser Berechtigungshinweis müssen in allen Kopien oder wesentlichen Teilen der Software enthalten sein.
* **Die Einladung zur Inspektion:** Da saQut dafür gebaut wurde, inspiziert zu werden, werden Sie ausdrücklich dazu ermutigt (wenn auch nicht rechtlich gezwungen), Ihren Schülern, Studenten oder dem Publikum mindestens einmal die Ausgabe von `saqut tokens` oder `saqut ast` zu zeigen, wenn Sie diesen Compiler in einem Bildungsprojekt, im Unterricht oder bei einer öffentlichen Präsentation verwenden. Halten Sie die Interna sichtbar!
#### 4. Die Ausnahme für Ausgabe und Ergebnisse (KRITISCH)
Um die Freiheit der Entwickler zu gewährleisten, die die Software nutzen:
- **Ihre Ausgabe gehört Ihnen.** Die gesamte in Abschnitt 2 definierte Ausgabe unterliegt **nicht** den Beschränkungen dieser Lizenz. Entwickler behalten das uneingeschränkte Recht, ihre eigene Ausgabe zu nutzen, zu schließen (proprietär zu machen), zu lizenzieren und **kommerziell zu verkaufen.**
- **Einnahmen werden aus der Ausgabe erzielt.** Es steht Ihnen frei, die Software als privates Werkzeug auf Ihrem eigenen Rechner (privat oder geschäftlich) zu nutzen und die von Ihnen erzeugten Programme, eigenständigen ausführbaren Dateien oder verarbeiteten Daten (etwa einen Excel-Bericht oder ein Datenbankergebnis) zu verkaufen. In diesem Fall erhält der Dritte nur das Ergebnis, nicht die Software.
#### 3. Die Laufzeit- und Ausgabe-Ausnahme (KRITISCH)
Um die absolute Freiheit der Entwickler zu gewährleisten, die diese Sprache verwenden:
* **Ihr Code gehört Ihnen:** Quellcode, der *in* der saQut-Sprache geschrieben wurde (z. B. `.sqt`-Dateien), und alle vom Compiler generierten Daten (wie JSON-AST-Dumps, Symboltabellen oder kompilierter Bytecode) unterliegen **NICHT** dieser Lizenz.
* Entwickler können den Quellcode ihrer eigenen saQut-Programme und Compiler-Ausgaben nach eigenem Ermessen lizenzieren, verkaufen oder schließen. Die von saQut bereitgestellte Laufzeitumgebung/VM kann in andere Anwendungen eingebettet werden, ohne die Lizenzen dieser Anwendungen einzuschränken.
#### 5. Kommerzielle Beschränkungen
Da die folgenden Nutzungen darauf hinauslaufen, Einnahmen aus der Software selbst zu erzielen, dürfen sie ohne vorherige schriftliche Genehmigung des Urheberrechtsinhabers nicht vorgenommen werden:
- Die Software auf dem Server oder Gerät eines Dritten zu installieren und für ihre Ausführung ein Entgelt zu verlangen (zum Beispiel das Ausführen von `saqut run backup.sql` für einen Kunden gegen Bezahlung).
- Die Software als Online-Dienst anzubieten (eine webbasierte IDE oder einen Online-Kompilier- oder -Ausführungsdienst).
- Die Software zum Backend oder zur Engine eines kommerziellen Dienstes zu machen, der durch die Live-Anfragen Dritter angetrieben wird.
- Die Software als Werkzeug innerhalb einer kommerziellen Automatisierungs-Pipeline zu betreiben oder sie einem System künstlicher Intelligenz als Werkzeug bereitzustellen.
- Die Software als Unterkomponente eines kommerziellen Produkts einzubetten (embedden).
- Die internen Komponenten oder den architektonischen Entwurf der Software (zum Beispiel ihre AST-Visualisierung oder Optimierungsalgorithmen) als kommerzielles Merkmal oder Produkt wiederzuverwenden.
**Server- und Versionshinweis:** Solange die Software zur Ausführung die saQut-Laufzeitumgebung (den Interpreter / die Bytecode-VM) benötigt, bedeutet jede kommerzielle serverseitige Nutzung faktisch das Platzieren der Software auf dem Server und unterliegt daher den obigen Beschränkungen. Sobald ein Backend verfügbar ist, das eigenständige ausführbare Dateien erzeugt, die die saQut-Laufzeitumgebung nicht benötigen, ist das kommerzielle Ausführen einer solchen eigenständigen Ausgabe auf einem Server gemäß Abschnitt 4 gestattet.
#### 6. Genehmigung und kommerzielle Lizenzierung
Alle in Abschnitt 5 aufgeführten Beschränkungen stehen ausschließlich dem Urheberrechtsinhaber zu, der allein befugt ist, Ausnahmen zu gewähren. Jede Person oder Organisation, die eine dieser Nutzungen vornehmen möchte, kann beim Urheberrechtsinhaber (Abdussamed ULUTAŞ) eine vorherige schriftliche Genehmigung beantragen; nach deren Erteilung wird die betreffende Nutzung gestattet.
Kontakt (Anfragen für kommerzielle Lizenzen): saqutsoftware+gitea@gmail.com
#### 7. Beiträge (Contributions)
Das Beitragen zu saQut ist ein offener Vorschlagsprozess; die endgültige Entscheidung liegt jedoch ausschließlich beim Urheberrechtsinhaber.
- Jede Person kann einen Änderungsvorschlag (einen Pull Request / PR) einreichen. Ob ein Beitrag in das Projekt aufgenommen und ob er zusammengeführt (gemerged) wird, entscheidet **allein Abdussamed ULUTAŞ.** Niemand hat ein Recht darauf, dass sein Beitrag in das Projekt aufgenommen wird.
- Mit der Einreichung eines Beitrags (Code, Dokumentation, Entwurf oder sonstiges Material) gewährt der Beitragende dem Urheberrechtsinhaber (Abdussamed ULUTAŞ) ein **weltweites, unbefristetes, unwiderrufliches, gebührenfreies und unterlizenzierbares** Recht, diesen Beitrag zu nutzen, zu vervielfältigen, zu verändern, zu verbreiten und **kommerziell zu lizenzieren.** Dieses Recht stellt sicher, dass der Urheberrechtsinhaber die Software einschließlich des Beitrags gemäß Abschnitt 6 kommerziell lizenzieren kann.
- Der Beitragende sichert zu, dass das eingereichte Material sein eigenes Werk ist oder dass er über die erforderlichen Rechte verfügt und befugt ist, diese Genehmigung zu erteilen. Die Beitragenden behalten das Urheberrecht an ihren eigenen Beiträgen; die obige Genehmigung wird zusätzlich zu diesen Rechten erteilt.
#### 8. Patentrechte
- **Patentlizenz:** Im Rahmen dieser Lizenz wird jeder Person, die zur Nutzung der Software berechtigt ist, eine gebührenfreie und (vorbehaltlich der nachstehenden Kündigungsbestimmung) unwiderrufliche Patentlizenz an denjenigen Patentansprüchen gewährt, die im Eigentum des Urheberrechtsinhabers und der Beitragenden stehen und die durch die nach dieser Lizenz gestattete Nutzung der Software notwendigerweise verletzt werden.
- **Patentvergeltung (automatische Kündigung):** Leitet eine Person oder Organisation einen **Patentrechtsstreit** gegen den Urheberrechtsinhaber oder einen Beitragenden ein und macht dabei geltend, dass die nach dieser Lizenz gestattete Nutzung der Software ein Patent verletzt, so **erlöschen automatisch** alle dieser Person oder Organisation nach dieser Lizenz gewährten Rechte (einschließlich der Patentlizenz).
#### 9. Marken- und Namensrechte
Diese Lizenz gewährt **keinerlei Rechte** an dem Namen „saQut", dem Logo oder verwandten Markenbestandteilen. Insbesondere:
- Wenn Sie eine veränderte Version der Software verbreiten, dürfen Sie diese Version nicht „saQut" nennen oder einen Namen verwenden, der daran erinnert oder verwechslungsfähig ähnlich ist.
- Sie dürfen den Namen „saQut" ohne vorherige schriftliche Genehmigung des Urheberrechtsinhabers nicht in Ihren Produkten, Diensten oder Werbemaßnahmen in einer Weise verwenden, die eine Billigung suggeriert.
- Ehrliche, beschreibende Hinweise auf den Ursprung der Software und auf den Urheberrechtsinhaber (zum Beispiel „basiert auf saQut") fallen nicht unter diesen Abschnitt.
#### 10. Namensnennung-Bedingung
Der ursprüngliche Urheberrechtshinweis und dieser Genehmigungshinweis müssen in allen Kopien oder wesentlichen Teilen der Software enthalten sein.
#### 11. Kündigung (Termination)
- Bei einem Verstoß gegen eine der Bedingungen dieser Lizenz **erlöschen automatisch** alle Ihnen darunter gewährten Rechte.
- Ist Ihr Verstoß heilbar und beheben Sie ihn innerhalb von **30 (dreißig) Tagen**, nachdem Sie davon Kenntnis erlangt haben — sofern der Urheberrechtsinhaber die Lizenz in diesem Zeitraum nicht ausdrücklich gekündigt hat —, so werden Ihre Rechte wiederhergestellt. Diese Heilungsmöglichkeit gilt nicht für wiederholte Verstöße derselben Person.
- Das Erlöschen Ihrer Rechte berührt nicht Ihre Rechte an einer Ausgabe (Abschnitt 4), die Sie zuvor in Übereinstimmung mit dieser Lizenz erlangt haben.
- Der Haftungsausschluss und die Haftungsbeschränkungen gelten auch nach der Kündigung fort.
#### 12. Haftungsausschluss
DIE SOFTWARE WIRD „WIE BESEHEN" (AS IS) OHNE JEGLICHE AUSDRÜCKLICHE ODER STILLSCHWEIGENDE GEWÄHRLEISTUNG ZUR VERFÜGUNG GESTELLT, EINSCHLIESSLICH, ABER NICHT BESCHRÄNKT AUF DIE GEWÄHRLEISTUNG DER MARKTGÄNGIGKEIT, DER EIGNUNG FÜR EINEN BESTIMMTEN ZWECK UND DER NICHTVERLETZUNG VON RECHTEN DRITTER. IN KEINEM FALL SIND DIE AUTOREN ODER URHEBERRECHTSINHABER FÜR ANSPRÜCHE, SCHÄDEN ODER ANDERE HAFTUNGEN HAFTBAR, SEI ES IN FOLGE EINES VERTRAGES, EINER UNERLAUBTEN HANDLUNG ODER AUF ANDERE WEISE, DIE SICH AUS ODER IM ZUSAMMENHANG MIT DER SOFTWARE ODER DER NUTZUNG ODER DEM UMGANG MIT DER SOFTWARE ERGEBEN.
#### 4. Haftungsausschluss
DIE SOFTWARE WIRD „WIE BESEHEN“ (AS IS) OHNE JEGLICHE AUSDRÜCKLICHE ODER ZIMNLICHE GEWÄHRLEISTUNG ZUR VERFÜGUNG GESTELLT, EINSCHLIESSLICH, ABER NICHT BESCHRÄNKT AUF DIE GEWÄHRLEISTUNG DER MARKTGÄNGIGKEIT, DER EIGNUNG FÜR EINEN BESTIMMTEN ZWECK UND DER NICHTVERLETZUNG VON RECHTEN DRITTER. IN KEINEM FALL SIND DIE AUTOREN ODER URHEBERRECHTSINHABER FÜR ANSPRÜCHE, SCHÄDEN ODER ANDERE HAFTUNGEN HAFTPAR, SEI ES IN FOLGE EINES VERTRAGES, EINER UNERLAUBTEN HANDLUNG ODER AUF ANDERE WEISE, DIE SICH AUS ODER IM ZUSAMMENHANG MIT DER SOFTWARE ODER DER NUTZUNG ODER DEM UMGANG MIT DER SOFTWARE ERGEBEN.

Binary file not shown.

View File

@ -1,23 +1,60 @@
# ninja log v7
13 4576 1781796718440262330 CMakeFiles/saqut.dir/src/core/sourcefile.cpp.o 20f68631dd335029
13 4805 1781796718441539505 CMakeFiles/saqut.dir/src/lexer/lexer.cpp.o 5fd259c0401f3e22
1 2117 1781796771817437208 CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o fbabe80dcb141239
4580 9322 1781796723007277591 CMakeFiles/saqut.dir/src/parser/parser.cpp.o 59cdb5935c541b26
21 6876 1781796718448262357 CMakeFiles/saqut.dir/src/parser/nodes/program.cpp.o 9313cba8d8daffed
16 6700 1781796718443848488 CMakeFiles/saqut.dir/src/parser/nodes/identifier.cpp.o e3b5b38d75fcd2ca
15 7814 1781796718443331391 CMakeFiles/saqut.dir/src/parser/nodes/expressions.cpp.o 5f5bb01381a3c3ad
16 7589 1781796718444498682 CMakeFiles/saqut.dir/src/parser/nodes/literal.cpp.o 55743f37408c5f
21 7502 1781796718449424977 CMakeFiles/saqut.dir/src/parser/nodes/statements.cpp.o 3c8869307381c930
14 6864 1781796718442362341 CMakeFiles/saqut.dir/src/parser/nodes/binary_expr.cpp.o 5cc8b697133bcf64
15 6733 1781796718442847556 CMakeFiles/saqut.dir/src/parser/nodes/declarations.cpp.o c3d262615ede4c95
1 4629 1781801148234045650 CMakeFiles/saqut.dir/src/main.cpp.o 3cfef7a665d5bf87
4629 4900 1781801152862380672 saqut f2e198803c4dbffb
0 22 1781801180493522122 build.ninja 1876a59d627a585
0 22 1781801180493522122 /home/saqut/Masaüstü/saqutcompiler/build/cmake_install.cmake 1876a59d627a585
6733 11112 1781796725160284765 CMakeFiles/saqut.dir/src/symbol/symbol_collector.cpp.o ec4e483b8ddb4007
4805 9685 1781796723232278341 CMakeFiles/saqut.dir/src/semantic/structural_validator.cpp.o 248faa3675024351
6700 10405 1781796725127284655 CMakeFiles/saqut.dir/src/semantic/type_checker.cpp.o b29c133293d988b0
1 850 1781801148235507662 CMakeFiles/saqut.dir/src/vm/interpreter.cpp.o b7dd80e002d68a1d
2 957 1781800866770475511 CMakeFiles/saqut.dir/src/ir/ir_function.cpp.o 10f5e8dfd1461d69
2 718 1781800866771246136 CMakeFiles/saqut.dir/src/ir/ir_program.cpp.o 9518231d970828da
2 3169 1781800866771136888 CMakeFiles/saqut.dir/src/ir/ir_generator.cpp.o 10a1ed4e1f52e530
0 1451 1779867877701788943 CMakeFiles/saqut.dir/src/core/sourcefile.cpp.o da6f5fc90e87e6b1
0 1246 1779867877703024703 CMakeFiles/saqut.dir/src/lexer/lexer.cpp.o 90eeec811f2137e6
1451 2772 1779867879152793461 CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o a01677f8bb4f4dbc
1246 2891 1779867878947792823 CMakeFiles/saqut.dir/src/parser/parser.cpp.o 2c65b7be26cead32
5 2061 1779867877706788958 CMakeFiles/saqut.dir/src/parser/nodes/program.cpp.o ac5bbcd74d87561a
1 2213 1779867877703621428 CMakeFiles/saqut.dir/src/parser/nodes/identifier.cpp.o eb96bb4b1eb4ad80
1 2296 1779867877703518257 CMakeFiles/saqut.dir/src/parser/nodes/expressions.cpp.o 4057e3d63c63a1ab
1 2529 1779867877703709398 CMakeFiles/saqut.dir/src/parser/nodes/literal.cpp.o 78f2c4da7c9b2281
7 2335 1779867877708788964 CMakeFiles/saqut.dir/src/parser/nodes/statements.cpp.o b5c20724bbf3648c
0 2098 1779867877703316205 CMakeFiles/saqut.dir/src/parser/nodes/binary_expr.cpp.o d2e2bb2f8a63c6d2
0 2499 1779867877703412857 CMakeFiles/saqut.dir/src/parser/nodes/declarations.cpp.o b6c56f04a257f685
0 2892 1779867877703230815 CMakeFiles/saqut.dir/src/main.cpp.o 110c26cb1d0c3a23
2892 2983 1779867880593797950 saqut 89052e51305cb697
0 22 1779868368456818650 build.ninja 1876a59d627a585
0 22 1779868368456217236 /home/saqut/Masaüstü/saqutcompiler/build/cmake_install.cmake 1876a59d627a585
1 1528 1779868368464217284 CMakeFiles/saqut.dir/src/lexer/lexer.cpp.o 90eeec811f2137e6
1 1768 1779868368465401047 CMakeFiles/saqut.dir/src/parser/nodes/program.cpp.o ac5bbcd74d87561a
1 2006 1779868368464927313 CMakeFiles/saqut.dir/src/parser/nodes/binary_expr.cpp.o d2e2bb2f8a63c6d2
1 2109 1779868368465099051 CMakeFiles/saqut.dir/src/parser/nodes/expressions.cpp.o 4057e3d63c63a1ab
1 2216 1779868368465200112 CMakeFiles/saqut.dir/src/parser/nodes/identifier.cpp.o eb96bb4b1eb4ad80
4 2421 1779868368467294710 CMakeFiles/saqut.dir/src/parser/nodes/statements.cpp.o b5c20724bbf3648c
1 2425 1779868368465010538 CMakeFiles/saqut.dir/src/parser/nodes/declarations.cpp.o b6c56f04a257f685
1 2450 1779868368465293953 CMakeFiles/saqut.dir/src/parser/nodes/literal.cpp.o 78f2c4da7c9b2281
4 2468 1779868368468417782 CMakeFiles/saqut.dir/src/parser/parser.cpp.o 2c65b7be26cead32
1528 2575 1779868369991226412 CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o a01677f8bb4f4dbc
1 2887 1779868368464815959 CMakeFiles/saqut.dir/src/main.cpp.o 110c26cb1d0c3a23
2887 2980 1779868371350234528 saqut 89052e51305cb697
2 1845 1781360349526488567 CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o a01677f8bb4f4dbc
2 1991 1781360349525864955 CMakeFiles/saqut.dir/src/parser/parser.cpp.o 2c65b7be26cead32
1 2031 1781360349525052844 CMakeFiles/saqut.dir/src/parser/nodes/binary_expr.cpp.o d2e2bb2f8a63c6d2
1 2080 1781360349525452259 CMakeFiles/saqut.dir/src/parser/nodes/literal.cpp.o 78f2c4da7c9b2281
1 2083 1781360349525558767 CMakeFiles/saqut.dir/src/parser/nodes/program.cpp.o ac5bbcd74d87561a
1 2090 1781360349525147077 CMakeFiles/saqut.dir/src/parser/nodes/declarations.cpp.o b6c56f04a257f685
2 2155 1781360349525690109 CMakeFiles/saqut.dir/src/parser/nodes/statements.cpp.o b5c20724bbf3648c
1 2240 1781360349525339814 CMakeFiles/saqut.dir/src/parser/nodes/identifier.cpp.o eb96bb4b1eb4ad80
1 2355 1781360349525238105 CMakeFiles/saqut.dir/src/parser/nodes/expressions.cpp.o 4057e3d63c63a1ab
1 2750 1781360349524108829 CMakeFiles/saqut.dir/src/main.cpp.o 110c26cb1d0c3a23
2750 2867 1781360352273116183 saqut 89052e51305cb697
1 1640 1781361120993563298 CMakeFiles/saqut.dir/src/parser/nodes/literal.cpp.o 78f2c4da7c9b2281
1 1661 1781361120993456534 CMakeFiles/saqut.dir/src/parser/nodes/identifier.cpp.o eb96bb4b1eb4ad80
2 1669 1781361120993689645 CMakeFiles/saqut.dir/src/parser/nodes/program.cpp.o ac5bbcd74d87561a
1 1681 1781361120993213226 CMakeFiles/saqut.dir/src/parser/nodes/declarations.cpp.o b6c56f04a257f685
1 1686 1781361120993117012 CMakeFiles/saqut.dir/src/parser/nodes/binary_expr.cpp.o d2e2bb2f8a63c6d2
3 1712 1781361120994511341 CMakeFiles/saqut.dir/src/parser/nodes/statements.cpp.o b5c20724bbf3648c
1 1723 1781361120993344591 CMakeFiles/saqut.dir/src/parser/nodes/expressions.cpp.o 4057e3d63c63a1ab
1 2281 1781361120992511333 CMakeFiles/saqut.dir/src/main.cpp.o 110c26cb1d0c3a23
2281 2374 1781361123272520466 saqut 89052e51305cb697
2 1202 1781361145332901008 CMakeFiles/saqut.dir/src/parser/nodes/statements.cpp.o b5c20724bbf3648c
2 1435 1781361145332608544 CMakeFiles/saqut.dir/src/parser/nodes/literal.cpp.o 78f2c4da7c9b2281
1 1472 1781361145332432199 CMakeFiles/saqut.dir/src/parser/nodes/expressions.cpp.o 4057e3d63c63a1ab
2 1506 1781361145332792284 CMakeFiles/saqut.dir/src/parser/nodes/program.cpp.o ac5bbcd74d87561a
1 1544 1781361145332547154 CMakeFiles/saqut.dir/src/parser/nodes/identifier.cpp.o eb96bb4b1eb4ad80
1 1549 1781361145331608540 CMakeFiles/saqut.dir/src/parser/nodes/binary_expr.cpp.o d2e2bb2f8a63c6d2
1 1569 1781361145332294897 CMakeFiles/saqut.dir/src/parser/nodes/declarations.cpp.o b6c56f04a257f685
1569 1661 1781361146899614781 saqut 89052e51305cb697
1 1470 1781361261444064707 CMakeFiles/saqut.dir/src/main.cpp.o 110c26cb1d0c3a23
1471 1563 1781361262914070415 saqut 89052e51305cb697
0 1462 1781361334065345164 CMakeFiles/saqut.dir/src/main.cpp.o 110c26cb1d0c3a23
1462 1555 1781361335527350781 saqut 89052e51305cb697

View File

@ -24,8 +24,8 @@ CMAKE_AR:FILEPATH=/usr/bin/ar
// MinSizeRel ...
CMAKE_BUILD_TYPE:STRING=Debug
//No help, variable specified on the command line.
CMAKE_CXX_COMPILER:FILEPATH=/usr/bin/g++
//CXX compiler
CMAKE_CXX_COMPILER:FILEPATH=/usr/bin/c++
//A wrapper around 'ar' adding the appropriate '--plugin' option
// for the GCC compiler
@ -50,9 +50,6 @@ CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
//Flags used by the CXX compiler during RELWITHDEBINFO builds.
CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
//No help, variable specified on the command line.
CMAKE_C_COMPILER:FILEPATH=/usr/bin/gcc
//Path to a program.
CMAKE_DLLTOOL:FILEPATH=CMAKE_DLLTOOL-NOTFOUND
@ -74,8 +71,8 @@ CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
//Enable/Disable output of build database during the build.
CMAKE_EXPORT_BUILD_DATABASE:BOOL=
//No help, variable specified on the command line.
CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=TRUE
//Enable/Disable output of compile commands during generation.
CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=
//Value Computed by CMake.
CMAKE_FIND_PACKAGE_REDIRECTS_DIR:STATIC=/home/saqut/Masaüstü/saqutcompiler/build/CMakeFiles/pkgRedirects
@ -238,7 +235,7 @@ CMAKE_CACHE_MAJOR_VERSION:INTERNAL=4
//Minor version of cmake used to create the current loaded cache
CMAKE_CACHE_MINOR_VERSION:INTERNAL=3
//Patch version of cmake used to create the current loaded cache
CMAKE_CACHE_PATCH_VERSION:INTERNAL=3
CMAKE_CACHE_PATCH_VERSION:INTERNAL=2
//Path to CMake executable.
CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
//Path to cpack program executable.

View File

@ -0,0 +1,102 @@
set(CMAKE_CXX_COMPILER "/usr/bin/c++")
set(CMAKE_CXX_COMPILER_ARG1 "")
set(CMAKE_CXX_COMPILER_ID "GNU")
set(CMAKE_CXX_COMPILER_VERSION "16.1.1")
set(CMAKE_CXX_COMPILER_VERSION_INTERNAL "")
set(CMAKE_CXX_COMPILER_WRAPPER "")
set(CMAKE_CXX_STANDARD_COMPUTED_DEFAULT "20")
set(CMAKE_CXX_EXTENSIONS_COMPUTED_DEFAULT "ON")
set(CMAKE_CXX_STANDARD_LATEST "26")
set(CMAKE_CXX_COMPILE_FEATURES "cxx_std_98;cxx_template_template_parameters;cxx_std_11;cxx_alias_templates;cxx_alignas;cxx_alignof;cxx_attributes;cxx_auto_type;cxx_constexpr;cxx_decltype;cxx_decltype_incomplete_return_types;cxx_default_function_template_args;cxx_defaulted_functions;cxx_defaulted_move_initializers;cxx_delegating_constructors;cxx_deleted_functions;cxx_enum_forward_declarations;cxx_explicit_conversions;cxx_extended_friend_declarations;cxx_extern_templates;cxx_final;cxx_func_identifier;cxx_generalized_initializers;cxx_inheriting_constructors;cxx_inline_namespaces;cxx_lambdas;cxx_local_type_template_args;cxx_long_long_type;cxx_noexcept;cxx_nonstatic_member_init;cxx_nullptr;cxx_override;cxx_range_for;cxx_raw_string_literals;cxx_reference_qualified_functions;cxx_right_angle_brackets;cxx_rvalue_references;cxx_sizeof_member;cxx_static_assert;cxx_strong_enums;cxx_thread_local;cxx_trailing_return_types;cxx_unicode_literals;cxx_uniform_initialization;cxx_unrestricted_unions;cxx_user_literals;cxx_variadic_macros;cxx_variadic_templates;cxx_std_14;cxx_aggregate_default_initializers;cxx_attribute_deprecated;cxx_binary_literals;cxx_contextual_conversions;cxx_decltype_auto;cxx_digit_separators;cxx_generic_lambdas;cxx_lambda_init_captures;cxx_relaxed_constexpr;cxx_return_type_deduction;cxx_variable_templates;cxx_std_17;cxx_std_20;cxx_std_23;cxx_std_26")
set(CMAKE_CXX98_COMPILE_FEATURES "cxx_std_98;cxx_template_template_parameters")
set(CMAKE_CXX11_COMPILE_FEATURES "cxx_std_11;cxx_alias_templates;cxx_alignas;cxx_alignof;cxx_attributes;cxx_auto_type;cxx_constexpr;cxx_decltype;cxx_decltype_incomplete_return_types;cxx_default_function_template_args;cxx_defaulted_functions;cxx_defaulted_move_initializers;cxx_delegating_constructors;cxx_deleted_functions;cxx_enum_forward_declarations;cxx_explicit_conversions;cxx_extended_friend_declarations;cxx_extern_templates;cxx_final;cxx_func_identifier;cxx_generalized_initializers;cxx_inheriting_constructors;cxx_inline_namespaces;cxx_lambdas;cxx_local_type_template_args;cxx_long_long_type;cxx_noexcept;cxx_nonstatic_member_init;cxx_nullptr;cxx_override;cxx_range_for;cxx_raw_string_literals;cxx_reference_qualified_functions;cxx_right_angle_brackets;cxx_rvalue_references;cxx_sizeof_member;cxx_static_assert;cxx_strong_enums;cxx_thread_local;cxx_trailing_return_types;cxx_unicode_literals;cxx_uniform_initialization;cxx_unrestricted_unions;cxx_user_literals;cxx_variadic_macros;cxx_variadic_templates")
set(CMAKE_CXX14_COMPILE_FEATURES "cxx_std_14;cxx_aggregate_default_initializers;cxx_attribute_deprecated;cxx_binary_literals;cxx_contextual_conversions;cxx_decltype_auto;cxx_digit_separators;cxx_generic_lambdas;cxx_lambda_init_captures;cxx_relaxed_constexpr;cxx_return_type_deduction;cxx_variable_templates")
set(CMAKE_CXX17_COMPILE_FEATURES "cxx_std_17")
set(CMAKE_CXX20_COMPILE_FEATURES "cxx_std_20")
set(CMAKE_CXX23_COMPILE_FEATURES "cxx_std_23")
set(CMAKE_CXX26_COMPILE_FEATURES "cxx_std_26")
set(CMAKE_CXX_PLATFORM_ID "Linux")
set(CMAKE_CXX_SIMULATE_ID "")
set(CMAKE_CXX_COMPILER_FRONTEND_VARIANT "GNU")
set(CMAKE_CXX_COMPILER_APPLE_SYSROOT "")
set(CMAKE_CXX_SIMULATE_VERSION "")
set(CMAKE_CXX_COMPILER_ARCHITECTURE_ID "x86_64")
set(CMAKE_AR "/usr/bin/ar")
set(CMAKE_CXX_COMPILER_AR "/usr/bin/gcc-ar")
set(CMAKE_RANLIB "/usr/bin/ranlib")
set(CMAKE_CXX_COMPILER_RANLIB "/usr/bin/gcc-ranlib")
set(CMAKE_LINKER "/usr/bin/ld")
set(CMAKE_LINKER_LINK "")
set(CMAKE_LINKER_LLD "")
set(CMAKE_CXX_COMPILER_LINKER "/usr/bin/ld")
set(CMAKE_CXX_COMPILER_LINKER_ID "GNU")
set(CMAKE_CXX_COMPILER_LINKER_VERSION 2.46.0)
set(CMAKE_CXX_COMPILER_LINKER_FRONTEND_VARIANT GNU)
set(CMAKE_MT "")
set(CMAKE_TAPI "CMAKE_TAPI-NOTFOUND")
set(CMAKE_COMPILER_IS_GNUCXX 1)
set(CMAKE_CXX_COMPILER_LOADED 1)
set(CMAKE_CXX_COMPILER_WORKS TRUE)
set(CMAKE_CXX_ABI_COMPILED TRUE)
set(CMAKE_CXX_COMPILER_ENV_VAR "CXX")
set(CMAKE_CXX_COMPILER_ID_RUN 1)
set(CMAKE_CXX_SOURCE_FILE_EXTENSIONS C;M;c++;cc;cpp;cxx;m;mm;mpp;CPP;ixx;cppm;ccm;cxxm;c++m)
set(CMAKE_CXX_IGNORE_EXTENSIONS inl;h;hpp;HPP;H;o;O;obj;OBJ;def;DEF;rc;RC)
foreach (lang IN ITEMS C OBJC OBJCXX)
if (CMAKE_${lang}_COMPILER_ID_RUN)
foreach(extension IN LISTS CMAKE_${lang}_SOURCE_FILE_EXTENSIONS)
list(REMOVE_ITEM CMAKE_CXX_SOURCE_FILE_EXTENSIONS ${extension})
endforeach()
endif()
endforeach()
set(CMAKE_CXX_LINKER_PREFERENCE 30)
set(CMAKE_CXX_LINKER_PREFERENCE_PROPAGATES 1)
set(CMAKE_CXX_LINKER_DEPFILE_SUPPORTED TRUE)
set(CMAKE_LINKER_PUSHPOP_STATE_SUPPORTED TRUE)
set(CMAKE_CXX_LINKER_PUSHPOP_STATE_SUPPORTED TRUE)
# Save compiler ABI information.
set(CMAKE_CXX_SIZEOF_DATA_PTR "8")
set(CMAKE_CXX_COMPILER_ABI "ELF")
set(CMAKE_CXX_BYTE_ORDER "LITTLE_ENDIAN")
set(CMAKE_CXX_LIBRARY_ARCHITECTURE "")
if(CMAKE_CXX_SIZEOF_DATA_PTR)
set(CMAKE_SIZEOF_VOID_P "${CMAKE_CXX_SIZEOF_DATA_PTR}")
endif()
if(CMAKE_CXX_COMPILER_ABI)
set(CMAKE_INTERNAL_PLATFORM_ABI "${CMAKE_CXX_COMPILER_ABI}")
endif()
if(CMAKE_CXX_LIBRARY_ARCHITECTURE)
set(CMAKE_LIBRARY_ARCHITECTURE "")
endif()
set(CMAKE_CXX_CL_SHOWINCLUDES_PREFIX "")
if(CMAKE_CXX_CL_SHOWINCLUDES_PREFIX)
set(CMAKE_CL_SHOWINCLUDES_PREFIX "${CMAKE_CXX_CL_SHOWINCLUDES_PREFIX}")
endif()
set(CMAKE_CXX_IMPLICIT_INCLUDE_DIRECTORIES "/usr/include/c++/16.1.1;/usr/include/c++/16.1.1/x86_64-pc-linux-gnu;/usr/include/c++/16.1.1/backward;/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/include;/usr/local/include;/usr/include")
set(CMAKE_CXX_IMPLICIT_LINK_LIBRARIES "stdc++;m;gcc_s;gcc;atomic_asneeded;c;gcc_s;gcc")
set(CMAKE_CXX_IMPLICIT_LINK_DIRECTORIES "/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1;/usr/lib;/lib")
set(CMAKE_CXX_IMPLICIT_LINK_FRAMEWORK_DIRECTORIES "")
set(CMAKE_CXX_COMPILER_CLANG_RESOURCE_DIR "")
set(CMAKE_CXX_COMPILER_IMPORT_STD "")
set(CMAKE_CXX_COMPILER_IMPORT_STD_ERROR_MESSAGE "Experimental `import std` support not enabled when detecting toolchain; it must be set before `CXX` is enabled (usually a `project()` call)")
set(CMAKE_CXX_STDLIB_MODULES_JSON "")

Binary file not shown.

View File

@ -0,0 +1,15 @@
set(CMAKE_HOST_SYSTEM "Linux-7.0.9-1-MANJARO")
set(CMAKE_HOST_SYSTEM_NAME "Linux")
set(CMAKE_HOST_SYSTEM_VERSION "7.0.9-1-MANJARO")
set(CMAKE_HOST_SYSTEM_PROCESSOR "x86_64")
set(CMAKE_SYSTEM "Linux-7.0.9-1-MANJARO")
set(CMAKE_SYSTEM_NAME "Linux")
set(CMAKE_SYSTEM_VERSION "7.0.9-1-MANJARO")
set(CMAKE_SYSTEM_PROCESSOR "x86_64")
set(CMAKE_CROSSCOMPILING "FALSE")
set(CMAKE_SYSTEM_LOADED 1)

View File

@ -0,0 +1,949 @@
/* This source file must have a .cpp extension so that all C++ compilers
recognize the extension without flags. Borland does not know .cxx for
example. */
#ifndef __cplusplus
# error "A C compiler has been selected for C++."
#endif
#if !defined(__has_include)
/* If the compiler does not have __has_include, pretend the answer is
always no. */
# define __has_include(x) 0
#endif
/* Version number components: V=Version, R=Revision, P=Patch
Version date components: YYYY=Year, MM=Month, DD=Day */
#if defined(__INTEL_COMPILER) || defined(__ICC)
# define COMPILER_ID "Intel"
# if defined(_MSC_VER)
# define SIMULATE_ID "MSVC"
# endif
# if defined(__GNUC__)
# define SIMULATE_ID "GNU"
# endif
/* __INTEL_COMPILER = VRP prior to 2021, and then VVVV for 2021 and later,
except that a few beta releases use the old format with V=2021. */
# if __INTEL_COMPILER < 2021 || __INTEL_COMPILER == 202110 || __INTEL_COMPILER == 202111
# define COMPILER_VERSION_MAJOR DEC(__INTEL_COMPILER/100)
# define COMPILER_VERSION_MINOR DEC(__INTEL_COMPILER/10 % 10)
# if defined(__INTEL_COMPILER_UPDATE)
# define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER_UPDATE)
# else
# define COMPILER_VERSION_PATCH DEC(__INTEL_COMPILER % 10)
# endif
# else
# define COMPILER_VERSION_MAJOR DEC(__INTEL_COMPILER)
# define COMPILER_VERSION_MINOR DEC(__INTEL_COMPILER_UPDATE)
/* The third version component from --version is an update index,
but no macro is provided for it. */
# define COMPILER_VERSION_PATCH DEC(0)
# endif
# if defined(__INTEL_COMPILER_BUILD_DATE)
/* __INTEL_COMPILER_BUILD_DATE = YYYYMMDD */
# define COMPILER_VERSION_TWEAK DEC(__INTEL_COMPILER_BUILD_DATE)
# endif
# if defined(_MSC_VER)
/* _MSC_VER = VVRR */
# define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
# define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
# endif
# if defined(__GNUC__)
# define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
# elif defined(__GNUG__)
# define SIMULATE_VERSION_MAJOR DEC(__GNUG__)
# endif
# if defined(__GNUC_MINOR__)
# define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
# endif
# if defined(__GNUC_PATCHLEVEL__)
# define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
# endif
#elif (defined(__clang__) && defined(__INTEL_CLANG_COMPILER)) || defined(__INTEL_LLVM_COMPILER)
# define COMPILER_ID "IntelLLVM"
#if defined(_MSC_VER)
# define SIMULATE_ID "MSVC"
#endif
#if defined(__GNUC__)
# define SIMULATE_ID "GNU"
#endif
/* __INTEL_LLVM_COMPILER = VVVVRP prior to 2021.2.0, VVVVRRPP for 2021.2.0 and
* later. Look for 6 digit vs. 8 digit version number to decide encoding.
* VVVV is no smaller than the current year when a version is released.
*/
#if __INTEL_LLVM_COMPILER < 1000000L
# define COMPILER_VERSION_MAJOR DEC(__INTEL_LLVM_COMPILER/100)
# define COMPILER_VERSION_MINOR DEC(__INTEL_LLVM_COMPILER/10 % 10)
# define COMPILER_VERSION_PATCH DEC(__INTEL_LLVM_COMPILER % 10)
#else
# define COMPILER_VERSION_MAJOR DEC(__INTEL_LLVM_COMPILER/10000)
# define COMPILER_VERSION_MINOR DEC(__INTEL_LLVM_COMPILER/100 % 100)
# define COMPILER_VERSION_PATCH DEC(__INTEL_LLVM_COMPILER % 100)
#endif
#if defined(_MSC_VER)
/* _MSC_VER = VVRR */
# define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
# define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
#endif
#if defined(__GNUC__)
# define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
#elif defined(__GNUG__)
# define SIMULATE_VERSION_MAJOR DEC(__GNUG__)
#endif
#if defined(__GNUC_MINOR__)
# define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
#endif
#if defined(__GNUC_PATCHLEVEL__)
# define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
#endif
#elif defined(__PATHCC__)
# define COMPILER_ID "PathScale"
# define COMPILER_VERSION_MAJOR DEC(__PATHCC__)
# define COMPILER_VERSION_MINOR DEC(__PATHCC_MINOR__)
# if defined(__PATHCC_PATCHLEVEL__)
# define COMPILER_VERSION_PATCH DEC(__PATHCC_PATCHLEVEL__)
# endif
#elif defined(__BORLANDC__) && defined(__CODEGEARC_VERSION__)
# define COMPILER_ID "Embarcadero"
# define COMPILER_VERSION_MAJOR HEX(__CODEGEARC_VERSION__>>24 & 0x00FF)
# define COMPILER_VERSION_MINOR HEX(__CODEGEARC_VERSION__>>16 & 0x00FF)
# define COMPILER_VERSION_PATCH DEC(__CODEGEARC_VERSION__ & 0xFFFF)
#elif defined(__BORLANDC__)
# define COMPILER_ID "Borland"
/* __BORLANDC__ = 0xVRR */
# define COMPILER_VERSION_MAJOR HEX(__BORLANDC__>>8)
# define COMPILER_VERSION_MINOR HEX(__BORLANDC__ & 0xFF)
#elif defined(__WATCOMC__) && __WATCOMC__ < 1200
# define COMPILER_ID "Watcom"
/* __WATCOMC__ = VVRR */
# define COMPILER_VERSION_MAJOR DEC(__WATCOMC__ / 100)
# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
# if (__WATCOMC__ % 10) > 0
# define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
# endif
#elif defined(__WATCOMC__)
# define COMPILER_ID "OpenWatcom"
/* __WATCOMC__ = VVRP + 1100 */
# define COMPILER_VERSION_MAJOR DEC((__WATCOMC__ - 1100) / 100)
# define COMPILER_VERSION_MINOR DEC((__WATCOMC__ / 10) % 10)
# if (__WATCOMC__ % 10) > 0
# define COMPILER_VERSION_PATCH DEC(__WATCOMC__ % 10)
# endif
#elif defined(__SUNPRO_CC)
# define COMPILER_ID "SunPro"
# if __SUNPRO_CC >= 0x5100
/* __SUNPRO_CC = 0xVRRP */
# define COMPILER_VERSION_MAJOR HEX(__SUNPRO_CC>>12)
# define COMPILER_VERSION_MINOR HEX(__SUNPRO_CC>>4 & 0xFF)
# define COMPILER_VERSION_PATCH HEX(__SUNPRO_CC & 0xF)
# else
/* __SUNPRO_CC = 0xVRP */
# define COMPILER_VERSION_MAJOR HEX(__SUNPRO_CC>>8)
# define COMPILER_VERSION_MINOR HEX(__SUNPRO_CC>>4 & 0xF)
# define COMPILER_VERSION_PATCH HEX(__SUNPRO_CC & 0xF)
# endif
#elif defined(__HP_aCC)
# define COMPILER_ID "HP"
/* __HP_aCC = VVRRPP */
# define COMPILER_VERSION_MAJOR DEC(__HP_aCC/10000)
# define COMPILER_VERSION_MINOR DEC(__HP_aCC/100 % 100)
# define COMPILER_VERSION_PATCH DEC(__HP_aCC % 100)
#elif defined(__DECCXX)
# define COMPILER_ID "Compaq"
/* __DECCXX_VER = VVRRTPPPP */
# define COMPILER_VERSION_MAJOR DEC(__DECCXX_VER/10000000)
# define COMPILER_VERSION_MINOR DEC(__DECCXX_VER/100000 % 100)
# define COMPILER_VERSION_PATCH DEC(__DECCXX_VER % 10000)
#elif defined(__IBMCPP__) && defined(__COMPILER_VER__)
# define COMPILER_ID "zOS"
/* __IBMCPP__ = VRP */
# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
# define COMPILER_VERSION_PATCH DEC(__IBMCPP__ % 10)
#elif defined(__open_xl__) && defined(__clang__)
# define COMPILER_ID "IBMClang"
# define COMPILER_VERSION_MAJOR DEC(__open_xl_version__)
# define COMPILER_VERSION_MINOR DEC(__open_xl_release__)
# define COMPILER_VERSION_PATCH DEC(__open_xl_modification__)
# define COMPILER_VERSION_TWEAK DEC(__open_xl_ptf_fix_level__)
# define COMPILER_VERSION_INTERNAL_STR __clang_version__
#elif defined(__ibmxl__) && defined(__clang__)
# define COMPILER_ID "XLClang"
# define COMPILER_VERSION_MAJOR DEC(__ibmxl_version__)
# define COMPILER_VERSION_MINOR DEC(__ibmxl_release__)
# define COMPILER_VERSION_PATCH DEC(__ibmxl_modification__)
# define COMPILER_VERSION_TWEAK DEC(__ibmxl_ptf_fix_level__)
#elif defined(__IBMCPP__) && !defined(__COMPILER_VER__) && __IBMCPP__ >= 800
# define COMPILER_ID "XL"
/* __IBMCPP__ = VRP */
# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
# define COMPILER_VERSION_PATCH DEC(__IBMCPP__ % 10)
#elif defined(__IBMCPP__) && !defined(__COMPILER_VER__) && __IBMCPP__ < 800
# define COMPILER_ID "VisualAge"
/* __IBMCPP__ = VRP */
# define COMPILER_VERSION_MAJOR DEC(__IBMCPP__/100)
# define COMPILER_VERSION_MINOR DEC(__IBMCPP__/10 % 10)
# define COMPILER_VERSION_PATCH DEC(__IBMCPP__ % 10)
#elif defined(__NVCOMPILER)
# define COMPILER_ID "NVHPC"
# define COMPILER_VERSION_MAJOR DEC(__NVCOMPILER_MAJOR__)
# define COMPILER_VERSION_MINOR DEC(__NVCOMPILER_MINOR__)
# if defined(__NVCOMPILER_PATCHLEVEL__)
# define COMPILER_VERSION_PATCH DEC(__NVCOMPILER_PATCHLEVEL__)
# endif
#elif defined(__PGI)
# define COMPILER_ID "PGI"
# define COMPILER_VERSION_MAJOR DEC(__PGIC__)
# define COMPILER_VERSION_MINOR DEC(__PGIC_MINOR__)
# if defined(__PGIC_PATCHLEVEL__)
# define COMPILER_VERSION_PATCH DEC(__PGIC_PATCHLEVEL__)
# endif
#elif defined(__clang__) && defined(__cray__)
# define COMPILER_ID "CrayClang"
# define COMPILER_VERSION_MAJOR DEC(__cray_major__)
# define COMPILER_VERSION_MINOR DEC(__cray_minor__)
# define COMPILER_VERSION_PATCH DEC(__cray_patchlevel__)
# define COMPILER_VERSION_INTERNAL_STR __clang_version__
#elif defined(_CRAYC)
# define COMPILER_ID "Cray"
# define COMPILER_VERSION_MAJOR DEC(_RELEASE_MAJOR)
# define COMPILER_VERSION_MINOR DEC(_RELEASE_MINOR)
#elif defined(__TI_COMPILER_VERSION__)
# define COMPILER_ID "TI"
/* __TI_COMPILER_VERSION__ = VVVRRRPPP */
# define COMPILER_VERSION_MAJOR DEC(__TI_COMPILER_VERSION__/1000000)
# define COMPILER_VERSION_MINOR DEC(__TI_COMPILER_VERSION__/1000 % 1000)
# define COMPILER_VERSION_PATCH DEC(__TI_COMPILER_VERSION__ % 1000)
#elif defined(__CLANG_FUJITSU)
# define COMPILER_ID "FujitsuClang"
# define COMPILER_VERSION_MAJOR DEC(__FCC_major__)
# define COMPILER_VERSION_MINOR DEC(__FCC_minor__)
# define COMPILER_VERSION_PATCH DEC(__FCC_patchlevel__)
# define COMPILER_VERSION_INTERNAL_STR __clang_version__
#elif defined(__FUJITSU)
# define COMPILER_ID "Fujitsu"
# if defined(__FCC_version__)
# define COMPILER_VERSION __FCC_version__
# elif defined(__FCC_major__)
# define COMPILER_VERSION_MAJOR DEC(__FCC_major__)
# define COMPILER_VERSION_MINOR DEC(__FCC_minor__)
# define COMPILER_VERSION_PATCH DEC(__FCC_patchlevel__)
# endif
# if defined(__fcc_version)
# define COMPILER_VERSION_INTERNAL DEC(__fcc_version)
# elif defined(__FCC_VERSION)
# define COMPILER_VERSION_INTERNAL DEC(__FCC_VERSION)
# endif
#elif defined(__ghs__)
# define COMPILER_ID "GHS"
/* __GHS_VERSION_NUMBER = VVVVRP */
# ifdef __GHS_VERSION_NUMBER
# define COMPILER_VERSION_MAJOR DEC(__GHS_VERSION_NUMBER / 100)
# define COMPILER_VERSION_MINOR DEC(__GHS_VERSION_NUMBER / 10 % 10)
# define COMPILER_VERSION_PATCH DEC(__GHS_VERSION_NUMBER % 10)
# endif
#elif defined(__TASKING__)
# define COMPILER_ID "Tasking"
# define COMPILER_VERSION_MAJOR DEC(__VERSION__/1000)
# define COMPILER_VERSION_MINOR DEC(__VERSION__ % 100)
# define COMPILER_VERSION_INTERNAL DEC(__VERSION__)
#elif defined(__ORANGEC__)
# define COMPILER_ID "OrangeC"
# define COMPILER_VERSION_MAJOR DEC(__ORANGEC_MAJOR__)
# define COMPILER_VERSION_MINOR DEC(__ORANGEC_MINOR__)
# define COMPILER_VERSION_PATCH DEC(__ORANGEC_PATCHLEVEL__)
#elif defined(__RENESAS__)
# define COMPILER_ID "Renesas"
/* __RENESAS_VERSION__ = 0xVVRRPP00 */
# define COMPILER_VERSION_MAJOR HEX(__RENESAS_VERSION__ >> 24 & 0xFF)
# define COMPILER_VERSION_MINOR HEX(__RENESAS_VERSION__ >> 16 & 0xFF)
# define COMPILER_VERSION_PATCH HEX(__RENESAS_VERSION__ >> 8 & 0xFF)
#elif defined(__SCO_VERSION__)
# define COMPILER_ID "SCO"
#elif defined(__ARMCC_VERSION) && !defined(__clang__)
# define COMPILER_ID "ARMCC"
#if __ARMCC_VERSION >= 1000000
/* __ARMCC_VERSION = VRRPPPP */
# define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/1000000)
# define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 100)
# define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION % 10000)
#else
/* __ARMCC_VERSION = VRPPPP */
# define COMPILER_VERSION_MAJOR DEC(__ARMCC_VERSION/100000)
# define COMPILER_VERSION_MINOR DEC(__ARMCC_VERSION/10000 % 10)
# define COMPILER_VERSION_PATCH DEC(__ARMCC_VERSION % 10000)
#endif
#elif defined(__clang__) && defined(__apple_build_version__)
# define COMPILER_ID "AppleClang"
# if defined(_MSC_VER)
# define SIMULATE_ID "MSVC"
# endif
# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
# if defined(_MSC_VER)
/* _MSC_VER = VVRR */
# define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
# define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
# endif
# define COMPILER_VERSION_TWEAK DEC(__apple_build_version__)
#elif defined(__clang__) && defined(__ARMCOMPILER_VERSION)
# define COMPILER_ID "ARMClang"
# define COMPILER_VERSION_MAJOR DEC(__ARMCOMPILER_VERSION/1000000)
# define COMPILER_VERSION_MINOR DEC(__ARMCOMPILER_VERSION/10000 % 100)
# define COMPILER_VERSION_PATCH DEC(__ARMCOMPILER_VERSION/100 % 100)
# define COMPILER_VERSION_INTERNAL DEC(__ARMCOMPILER_VERSION)
#elif defined(__clang__) && defined(__ti__)
# define COMPILER_ID "TIClang"
# define COMPILER_VERSION_MAJOR DEC(__ti_major__)
# define COMPILER_VERSION_MINOR DEC(__ti_minor__)
# define COMPILER_VERSION_PATCH DEC(__ti_patchlevel__)
# define COMPILER_VERSION_INTERNAL DEC(__ti_version__)
#elif defined(__clang__)
# define COMPILER_ID "Clang"
# if defined(_MSC_VER)
# define SIMULATE_ID "MSVC"
# endif
# define COMPILER_VERSION_MAJOR DEC(__clang_major__)
# define COMPILER_VERSION_MINOR DEC(__clang_minor__)
# define COMPILER_VERSION_PATCH DEC(__clang_patchlevel__)
# if defined(_MSC_VER)
/* _MSC_VER = VVRR */
# define SIMULATE_VERSION_MAJOR DEC(_MSC_VER / 100)
# define SIMULATE_VERSION_MINOR DEC(_MSC_VER % 100)
# endif
#elif defined(__LCC__) && (defined(__GNUC__) || defined(__GNUG__) || defined(__MCST__))
# define COMPILER_ID "LCC"
# define COMPILER_VERSION_MAJOR DEC(__LCC__ / 100)
# define COMPILER_VERSION_MINOR DEC(__LCC__ % 100)
# if defined(__LCC_MINOR__)
# define COMPILER_VERSION_PATCH DEC(__LCC_MINOR__)
# endif
# if defined(__GNUC__) && defined(__GNUC_MINOR__)
# define SIMULATE_ID "GNU"
# define SIMULATE_VERSION_MAJOR DEC(__GNUC__)
# define SIMULATE_VERSION_MINOR DEC(__GNUC_MINOR__)
# if defined(__GNUC_PATCHLEVEL__)
# define SIMULATE_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
# endif
# endif
#elif defined(__GNUC__) || defined(__GNUG__)
# define COMPILER_ID "GNU"
# if defined(__GNUC__)
# define COMPILER_VERSION_MAJOR DEC(__GNUC__)
# else
# define COMPILER_VERSION_MAJOR DEC(__GNUG__)
# endif
# if defined(__GNUC_MINOR__)
# define COMPILER_VERSION_MINOR DEC(__GNUC_MINOR__)
# endif
# if defined(__GNUC_PATCHLEVEL__)
# define COMPILER_VERSION_PATCH DEC(__GNUC_PATCHLEVEL__)
# endif
#elif defined(_MSC_VER)
# define COMPILER_ID "MSVC"
/* _MSC_VER = VVRR */
# define COMPILER_VERSION_MAJOR DEC(_MSC_VER / 100)
# define COMPILER_VERSION_MINOR DEC(_MSC_VER % 100)
# if defined(_MSC_FULL_VER)
# if _MSC_VER >= 1400
/* _MSC_FULL_VER = VVRRPPPPP */
# define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 100000)
# else
/* _MSC_FULL_VER = VVRRPPPP */
# define COMPILER_VERSION_PATCH DEC(_MSC_FULL_VER % 10000)
# endif
# endif
# if defined(_MSC_BUILD)
# define COMPILER_VERSION_TWEAK DEC(_MSC_BUILD)
# endif
#elif defined(_ADI_COMPILER)
# define COMPILER_ID "ADSP"
#if defined(__VERSIONNUM__)
/* __VERSIONNUM__ = 0xVVRRPPTT */
# define COMPILER_VERSION_MAJOR DEC(__VERSIONNUM__ >> 24 & 0xFF)
# define COMPILER_VERSION_MINOR DEC(__VERSIONNUM__ >> 16 & 0xFF)
# define COMPILER_VERSION_PATCH DEC(__VERSIONNUM__ >> 8 & 0xFF)
# define COMPILER_VERSION_TWEAK DEC(__VERSIONNUM__ & 0xFF)
#endif
#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
# define COMPILER_ID "IAR"
# if defined(__VER__) && defined(__ICCARM__)
# define COMPILER_VERSION_MAJOR DEC((__VER__) / 1000000)
# define COMPILER_VERSION_MINOR DEC(((__VER__) / 1000) % 1000)
# define COMPILER_VERSION_PATCH DEC((__VER__) % 1000)
# define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
# elif defined(__VER__) && (defined(__ICCAVR__) || defined(__ICCRX__) || defined(__ICCRH850__) || defined(__ICCRL78__) || defined(__ICC430__) || defined(__ICCRISCV__) || defined(__ICCV850__) || defined(__ICC8051__) || defined(__ICCSTM8__))
# define COMPILER_VERSION_MAJOR DEC((__VER__) / 100)
# define COMPILER_VERSION_MINOR DEC((__VER__) - (((__VER__) / 100)*100))
# define COMPILER_VERSION_PATCH DEC(__SUBVERSION__)
# define COMPILER_VERSION_INTERNAL DEC(__IAR_SYSTEMS_ICC__)
# endif
#elif defined(__DCC__) && defined(_DIAB_TOOL)
# define COMPILER_ID "Diab"
# define COMPILER_VERSION_MAJOR DEC(__VERSION_MAJOR_NUMBER__)
# define COMPILER_VERSION_MINOR DEC(__VERSION_MINOR_NUMBER__)
# define COMPILER_VERSION_PATCH DEC(__VERSION_ARCH_FEATURE_NUMBER__)
# define COMPILER_VERSION_TWEAK DEC(__VERSION_BUG_FIX_NUMBER__)
/* These compilers are either not known or too old to define an
identification macro. Try to identify the platform and guess that
it is the native compiler. */
#elif defined(__hpux) || defined(__hpua)
# define COMPILER_ID "HP"
#else /* unknown compiler */
# define COMPILER_ID ""
#endif
/* Construct the string literal in pieces to prevent the source from
getting matched. Store it in a pointer rather than an array
because some compilers will just produce instructions to fill the
array rather than assigning a pointer to a static array. */
char const* info_compiler = "INFO" ":" "compiler[" COMPILER_ID "]";
#ifdef SIMULATE_ID
char const* info_simulate = "INFO" ":" "simulate[" SIMULATE_ID "]";
#endif
#ifdef __QNXNTO__
char const* qnxnto = "INFO" ":" "qnxnto[]";
#endif
#if defined(__CRAYXT_COMPUTE_LINUX_TARGET)
char const *info_cray = "INFO" ":" "compiler_wrapper[CrayPrgEnv]";
#endif
#define STRINGIFY_HELPER(X) #X
#define STRINGIFY(X) STRINGIFY_HELPER(X)
/* Identify known platforms by name. */
#if defined(__linux) || defined(__linux__) || defined(linux)
# define PLATFORM_ID "Linux"
#elif defined(__MSYS__)
# define PLATFORM_ID "MSYS"
#elif defined(__CYGWIN__)
# define PLATFORM_ID "Cygwin"
#elif defined(__MINGW32__)
# define PLATFORM_ID "MinGW"
#elif defined(__APPLE__)
# define PLATFORM_ID "Darwin"
#elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
# define PLATFORM_ID "Windows"
#elif defined(__FreeBSD__) || defined(__FreeBSD)
# define PLATFORM_ID "FreeBSD"
#elif defined(__NetBSD__) || defined(__NetBSD)
# define PLATFORM_ID "NetBSD"
#elif defined(__OpenBSD__) || defined(__OPENBSD)
# define PLATFORM_ID "OpenBSD"
#elif defined(__sun) || defined(sun)
# define PLATFORM_ID "SunOS"
#elif defined(_AIX) || defined(__AIX) || defined(__AIX__) || defined(__aix) || defined(__aix__)
# define PLATFORM_ID "AIX"
#elif defined(__hpux) || defined(__hpux__)
# define PLATFORM_ID "HP-UX"
#elif defined(__HAIKU__)
# define PLATFORM_ID "Haiku"
#elif defined(__BeOS) || defined(__BEOS__) || defined(_BEOS)
# define PLATFORM_ID "BeOS"
#elif defined(__QNX__) || defined(__QNXNTO__)
# define PLATFORM_ID "QNX"
#elif defined(__tru64) || defined(_tru64) || defined(__TRU64__)
# define PLATFORM_ID "Tru64"
#elif defined(__riscos) || defined(__riscos__)
# define PLATFORM_ID "RISCos"
#elif defined(__sinix) || defined(__sinix__) || defined(__SINIX__)
# define PLATFORM_ID "SINIX"
#elif defined(__UNIX_SV__)
# define PLATFORM_ID "UNIX_SV"
#elif defined(__bsdos__)
# define PLATFORM_ID "BSDOS"
#elif defined(_MPRAS) || defined(MPRAS)
# define PLATFORM_ID "MP-RAS"
#elif defined(__osf) || defined(__osf__)
# define PLATFORM_ID "OSF1"
#elif defined(_SCO_SV) || defined(SCO_SV) || defined(sco_sv)
# define PLATFORM_ID "SCO_SV"
#elif defined(__ultrix) || defined(__ultrix__) || defined(_ULTRIX)
# define PLATFORM_ID "ULTRIX"
#elif defined(__XENIX__) || defined(_XENIX) || defined(XENIX)
# define PLATFORM_ID "Xenix"
#elif defined(__WATCOMC__)
# if defined(__LINUX__)
# define PLATFORM_ID "Linux"
# elif defined(__DOS__)
# define PLATFORM_ID "DOS"
# elif defined(__OS2__)
# define PLATFORM_ID "OS2"
# elif defined(__WINDOWS__)
# define PLATFORM_ID "Windows3x"
# elif defined(__VXWORKS__)
# define PLATFORM_ID "VxWorks"
# else /* unknown platform */
# define PLATFORM_ID
# endif
#elif defined(__INTEGRITY)
# if defined(INT_178B)
# define PLATFORM_ID "Integrity178"
# else /* regular Integrity */
# define PLATFORM_ID "Integrity"
# endif
# elif defined(_ADI_COMPILER)
# define PLATFORM_ID "ADSP"
#else /* unknown platform */
# define PLATFORM_ID
#endif
/* For windows compilers MSVC and Intel we can determine
the architecture of the compiler being used. This is because
the compilers do not have flags that can change the architecture,
but rather depend on which compiler is being used
*/
#if defined(_WIN32) && defined(_MSC_VER)
# if defined(_M_IA64)
# define ARCHITECTURE_ID "IA64"
# elif defined(_M_ARM64EC)
# define ARCHITECTURE_ID "ARM64EC"
# elif defined(_M_X64) || defined(_M_AMD64)
# define ARCHITECTURE_ID "x64"
# elif defined(_M_IX86)
# define ARCHITECTURE_ID "X86"
# elif defined(_M_ARM64)
# define ARCHITECTURE_ID "ARM64"
# elif defined(_M_ARM)
# if _M_ARM == 4
# define ARCHITECTURE_ID "ARMV4I"
# elif _M_ARM == 5
# define ARCHITECTURE_ID "ARMV5I"
# else
# define ARCHITECTURE_ID "ARMV" STRINGIFY(_M_ARM)
# endif
# elif defined(_M_MIPS)
# define ARCHITECTURE_ID "MIPS"
# elif defined(_M_SH)
# define ARCHITECTURE_ID "SHx"
# else /* unknown architecture */
# define ARCHITECTURE_ID ""
# endif
#elif defined(__WATCOMC__)
# if defined(_M_I86)
# define ARCHITECTURE_ID "I86"
# elif defined(_M_IX86)
# define ARCHITECTURE_ID "X86"
# else /* unknown architecture */
# define ARCHITECTURE_ID ""
# endif
#elif defined(__IAR_SYSTEMS_ICC__) || defined(__IAR_SYSTEMS_ICC)
# if defined(__ICCARM__)
# define ARCHITECTURE_ID "ARM"
# elif defined(__ICCRX__)
# define ARCHITECTURE_ID "RX"
# elif defined(__ICCRH850__)
# define ARCHITECTURE_ID "RH850"
# elif defined(__ICCRL78__)
# define ARCHITECTURE_ID "RL78"
# elif defined(__ICCRISCV__)
# define ARCHITECTURE_ID "RISCV"
# elif defined(__ICCAVR__)
# define ARCHITECTURE_ID "AVR"
# elif defined(__ICC430__)
# define ARCHITECTURE_ID "MSP430"
# elif defined(__ICCV850__)
# define ARCHITECTURE_ID "V850"
# elif defined(__ICC8051__)
# define ARCHITECTURE_ID "8051"
# elif defined(__ICCSTM8__)
# define ARCHITECTURE_ID "STM8"
# else /* unknown architecture */
# define ARCHITECTURE_ID ""
# endif
#elif defined(__ghs__)
# if defined(__PPC64__)
# define ARCHITECTURE_ID "PPC64"
# elif defined(__ppc__)
# define ARCHITECTURE_ID "PPC"
# elif defined(__ARM__)
# define ARCHITECTURE_ID "ARM"
# elif defined(__x86_64__)
# define ARCHITECTURE_ID "x64"
# elif defined(__i386__)
# define ARCHITECTURE_ID "X86"
# else /* unknown architecture */
# define ARCHITECTURE_ID ""
# endif
#elif defined(__clang__) && defined(__ti__)
# if defined(__ARM_ARCH)
# define ARCHITECTURE_ID "ARM"
# else /* unknown architecture */
# define ARCHITECTURE_ID ""
# endif
#elif defined(__TI_COMPILER_VERSION__)
# if defined(__TI_ARM__)
# define ARCHITECTURE_ID "ARM"
# elif defined(__MSP430__)
# define ARCHITECTURE_ID "MSP430"
# elif defined(__TMS320C28XX__)
# define ARCHITECTURE_ID "TMS320C28x"
# elif defined(__TMS320C6X__) || defined(_TMS320C6X)
# define ARCHITECTURE_ID "TMS320C6x"
# else /* unknown architecture */
# define ARCHITECTURE_ID ""
# endif
# elif defined(__ADSPSHARC__)
# define ARCHITECTURE_ID "SHARC"
# elif defined(__ADSPBLACKFIN__)
# define ARCHITECTURE_ID "Blackfin"
#elif defined(__TASKING__)
# if defined(__CTC__) || defined(__CPTC__)
# define ARCHITECTURE_ID "TriCore"
# elif defined(__CMCS__)
# define ARCHITECTURE_ID "MCS"
# elif defined(__CARM__) || defined(__CPARM__)
# define ARCHITECTURE_ID "ARM"
# elif defined(__CARC__)
# define ARCHITECTURE_ID "ARC"
# elif defined(__C51__)
# define ARCHITECTURE_ID "8051"
# elif defined(__CPCP__)
# define ARCHITECTURE_ID "PCP"
# else
# define ARCHITECTURE_ID ""
# endif
#elif defined(__RENESAS__)
# if defined(__CCRX__)
# define ARCHITECTURE_ID "RX"
# elif defined(__CCRL__)
# define ARCHITECTURE_ID "RL78"
# elif defined(__CCRH__)
# define ARCHITECTURE_ID "RH850"
# else
# define ARCHITECTURE_ID ""
# endif
#else
# define ARCHITECTURE_ID
#endif
/* Convert integer to decimal digit literals. */
#define DEC(n) \
('0' + (((n) / 10000000)%10)), \
('0' + (((n) / 1000000)%10)), \
('0' + (((n) / 100000)%10)), \
('0' + (((n) / 10000)%10)), \
('0' + (((n) / 1000)%10)), \
('0' + (((n) / 100)%10)), \
('0' + (((n) / 10)%10)), \
('0' + ((n) % 10))
/* Convert integer to hex digit literals. */
#define HEX(n) \
('0' + ((n)>>28 & 0xF)), \
('0' + ((n)>>24 & 0xF)), \
('0' + ((n)>>20 & 0xF)), \
('0' + ((n)>>16 & 0xF)), \
('0' + ((n)>>12 & 0xF)), \
('0' + ((n)>>8 & 0xF)), \
('0' + ((n)>>4 & 0xF)), \
('0' + ((n) & 0xF))
/* Construct a string literal encoding the version number. */
#ifdef COMPILER_VERSION
char const* info_version = "INFO" ":" "compiler_version[" COMPILER_VERSION "]";
/* Construct a string literal encoding the version number components. */
#elif defined(COMPILER_VERSION_MAJOR)
char const info_version[] = {
'I', 'N', 'F', 'O', ':',
'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','[',
COMPILER_VERSION_MAJOR,
# ifdef COMPILER_VERSION_MINOR
'.', COMPILER_VERSION_MINOR,
# ifdef COMPILER_VERSION_PATCH
'.', COMPILER_VERSION_PATCH,
# ifdef COMPILER_VERSION_TWEAK
'.', COMPILER_VERSION_TWEAK,
# endif
# endif
# endif
']','\0'};
#endif
/* Construct a string literal encoding the internal version number. */
#ifdef COMPILER_VERSION_INTERNAL
char const info_version_internal[] = {
'I', 'N', 'F', 'O', ':',
'c','o','m','p','i','l','e','r','_','v','e','r','s','i','o','n','_',
'i','n','t','e','r','n','a','l','[',
COMPILER_VERSION_INTERNAL,']','\0'};
#elif defined(COMPILER_VERSION_INTERNAL_STR)
char const* info_version_internal = "INFO" ":" "compiler_version_internal[" COMPILER_VERSION_INTERNAL_STR "]";
#endif
/* Construct a string literal encoding the version number components. */
#ifdef SIMULATE_VERSION_MAJOR
char const info_simulate_version[] = {
'I', 'N', 'F', 'O', ':',
's','i','m','u','l','a','t','e','_','v','e','r','s','i','o','n','[',
SIMULATE_VERSION_MAJOR,
# ifdef SIMULATE_VERSION_MINOR
'.', SIMULATE_VERSION_MINOR,
# ifdef SIMULATE_VERSION_PATCH
'.', SIMULATE_VERSION_PATCH,
# ifdef SIMULATE_VERSION_TWEAK
'.', SIMULATE_VERSION_TWEAK,
# endif
# endif
# endif
']','\0'};
#endif
/* Construct the string literal in pieces to prevent the source from
getting matched. Store it in a pointer rather than an array
because some compilers will just produce instructions to fill the
array rather than assigning a pointer to a static array. */
char const* info_platform = "INFO" ":" "platform[" PLATFORM_ID "]";
char const* info_arch = "INFO" ":" "arch[" ARCHITECTURE_ID "]";
#define CXX_STD_98 199711L
#define CXX_STD_11 201103L
#define CXX_STD_14 201402L
#define CXX_STD_17 201703L
#define CXX_STD_20 202002L
#define CXX_STD_23 202302L
#if defined(__INTEL_COMPILER) && defined(_MSVC_LANG)
# if _MSVC_LANG > CXX_STD_17
# define CXX_STD _MSVC_LANG
# elif _MSVC_LANG == CXX_STD_17 && defined(__cpp_aggregate_paren_init)
# define CXX_STD CXX_STD_20
# elif _MSVC_LANG > CXX_STD_14 && __cplusplus > CXX_STD_17
# define CXX_STD CXX_STD_20
# elif _MSVC_LANG > CXX_STD_14
# define CXX_STD CXX_STD_17
# elif defined(__INTEL_CXX11_MODE__) && defined(__cpp_aggregate_nsdmi)
# define CXX_STD CXX_STD_14
# elif defined(__INTEL_CXX11_MODE__)
# define CXX_STD CXX_STD_11
# else
# define CXX_STD CXX_STD_98
# endif
#elif defined(_MSC_VER) && defined(_MSVC_LANG)
# if _MSVC_LANG > __cplusplus
# define CXX_STD _MSVC_LANG
# else
# define CXX_STD __cplusplus
# endif
#elif defined(__NVCOMPILER)
# if __cplusplus == CXX_STD_17 && defined(__cpp_aggregate_paren_init)
# define CXX_STD CXX_STD_20
# else
# define CXX_STD __cplusplus
# endif
#elif defined(__INTEL_COMPILER) || defined(__PGI)
# if __cplusplus == CXX_STD_11 && defined(__cpp_namespace_attributes)
# define CXX_STD CXX_STD_17
# elif __cplusplus == CXX_STD_11 && defined(__cpp_aggregate_nsdmi)
# define CXX_STD CXX_STD_14
# else
# define CXX_STD __cplusplus
# endif
#elif (defined(__IBMCPP__) || defined(__ibmxl__)) && defined(__linux__)
# if __cplusplus == CXX_STD_11 && defined(__cpp_aggregate_nsdmi)
# define CXX_STD CXX_STD_14
# else
# define CXX_STD __cplusplus
# endif
#elif __cplusplus == 1 && defined(__GXX_EXPERIMENTAL_CXX0X__)
# define CXX_STD CXX_STD_11
#else
# define CXX_STD __cplusplus
#endif
const char* info_language_standard_default = "INFO" ":" "standard_default["
#if CXX_STD > CXX_STD_23
"26"
#elif CXX_STD > CXX_STD_20
"23"
#elif CXX_STD > CXX_STD_17
"20"
#elif CXX_STD > CXX_STD_14
"17"
#elif CXX_STD > CXX_STD_11
"14"
#elif CXX_STD >= CXX_STD_11
"11"
#else
"98"
#endif
"]";
const char* info_language_extensions_default = "INFO" ":" "extensions_default["
#if (defined(__clang__) || defined(__GNUC__) || defined(__xlC__) || \
defined(__TI_COMPILER_VERSION__) || defined(__RENESAS__)) && \
!defined(__STRICT_ANSI__)
"ON"
#else
"OFF"
#endif
"]";
/*--------------------------------------------------------------------------*/
int main(int argc, char* argv[])
{
int require = 0;
require += info_compiler[argc];
require += info_platform[argc];
require += info_arch[argc];
#ifdef COMPILER_VERSION_MAJOR
require += info_version[argc];
#endif
#if defined(COMPILER_VERSION_INTERNAL) || defined(COMPILER_VERSION_INTERNAL_STR)
require += info_version_internal[argc];
#endif
#ifdef SIMULATE_ID
require += info_simulate[argc];
#endif
#ifdef SIMULATE_VERSION_MAJOR
require += info_simulate_version[argc];
#endif
#if defined(__CRAYXT_COMPUTE_LINUX_TARGET)
require += info_cray[argc];
#endif
require += info_language_standard_default[argc];
require += info_language_extensions_default[argc];
(void)argv;
return require;
}

View File

@ -5,7 +5,7 @@ events:
kind: "find-v1"
backtrace:
- "/usr/share/cmake/Modules/CMakeDetermineSystem.cmake:12 (find_program)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_UNAME"
description: "Path to a program."
@ -20,6 +20,7 @@ events:
names:
- "uname"
candidate_directories:
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/usr/bin/"
@ -32,13 +33,13 @@ events:
- "/usr/bin/vendor_perl/"
- "/usr/bin/core_perl/"
searched_directories:
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/uname"
- "/home/saqut/.local/bin/uname"
- "/usr/local/bin/uname"
found: "/usr/bin/uname"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -54,14 +55,14 @@ events:
kind: "message-v1"
backtrace:
- "/usr/share/cmake/Modules/CMakeDetermineSystem.cmake:212 (message)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
message: |
The system is: Linux - 7.0.10-1-MANJARO - x86_64
The system is: Linux - 7.0.9-1-MANJARO - x86_64
-
kind: "find-v1"
backtrace:
- "/usr/share/cmake/Modules/CMakeNinjaFindMake.cmake:5 (find_program)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_MAKE_PROGRAM"
description: "Program used to build from build.ninja files."
@ -78,6 +79,7 @@ events:
- "ninja"
- "samu"
candidate_directories:
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/usr/bin/"
@ -90,6 +92,9 @@ events:
- "/usr/bin/vendor_perl/"
- "/usr/bin/core_perl/"
searched_directories:
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/ninja-build"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/ninja"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/samu"
- "/home/saqut/.local/bin/ninja-build"
- "/home/saqut/.local/bin/ninja"
- "/home/saqut/.local/bin/samu"
@ -100,8 +105,67 @@ events:
found: "/usr/bin/ninja"
search_context:
ENV{PATH}:
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
- "/bin"
- "/usr/local/sbin"
- "/opt/cuda/bin"
- "/var/lib/flatpak/exports/bin"
- "/usr/lib/jvm/default/bin"
- "/usr/bin/site_perl"
- "/usr/bin/vendor_perl"
- "/usr/bin/core_perl"
-
kind: "find-v1"
backtrace:
- "/usr/share/cmake/Modules/CMakeDetermineCompiler.cmake:73 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:69 (_cmake_find_compiler)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_CXX_COMPILER"
description: "CXX compiler"
settings:
SearchFramework: "NEVER"
SearchAppBundle: "NEVER"
CMAKE_FIND_USE_CMAKE_PATH: true
CMAKE_FIND_USE_CMAKE_ENVIRONMENT_PATH: true
CMAKE_FIND_USE_SYSTEM_ENVIRONMENT_PATH: true
CMAKE_FIND_USE_CMAKE_SYSTEM_PATH: true
CMAKE_FIND_USE_INSTALL_PREFIX: true
names:
- "c++"
- "CC"
- "g++"
- "aCC"
- "cl"
- "bcc"
- "xlC"
- "icpx"
- "icx"
- "clang++"
candidate_directories:
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/usr/bin/"
- "/bin/"
- "/usr/local/sbin/"
- "/opt/cuda/bin/"
- "/var/lib/flatpak/exports/bin/"
- "/usr/lib/jvm/default/bin/"
- "/usr/bin/site_perl/"
- "/usr/bin/vendor_perl/"
- "/usr/bin/core_perl/"
searched_directories:
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/c++"
- "/home/saqut/.local/bin/c++"
- "/usr/local/bin/c++"
found: "/usr/bin/c++"
search_context:
ENV{PATH}:
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -121,7 +185,7 @@ events:
- "/usr/share/cmake/Modules/CMakeDetermineCompilerId.cmake:8 (CMAKE_DETERMINE_COMPILER_ID_BUILD)"
- "/usr/share/cmake/Modules/CMakeDetermineCompilerId.cmake:64 (__determine_compiler_id_test)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:125 (CMAKE_DETERMINE_COMPILER_ID)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "file"
variable: "src_in"
description: "Path to a file."
@ -140,8 +204,7 @@ events:
found: "/usr/share/cmake/Modules/CMakeCXXCompilerId.cpp.in"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -159,10 +222,10 @@ events:
- "/usr/share/cmake/Modules/CMakeDetermineCompilerId.cmake:17 (message)"
- "/usr/share/cmake/Modules/CMakeDetermineCompilerId.cmake:64 (__determine_compiler_id_test)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:125 (CMAKE_DETERMINE_COMPILER_ID)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
message: |
Compiling the CXX compiler identification source file "CMakeCXXCompilerId.cpp" succeeded.
Compiler: /usr/bin/g++
Compiler: /usr/bin/c++
Build flags:
Id flags:
@ -173,14 +236,14 @@ events:
Compilation of the CXX compiler identification source "CMakeCXXCompilerId.cpp" produced "a.out"
The CXX compiler identification is GNU, found in:
/home/saqut/Masaüstü/saqutcompiler/build/CMakeFiles/4.3.3/CompilerIdCXX/a.out
/home/saqut/Masaüstü/saqutcompiler/build/CMakeFiles/4.3.2/CompilerIdCXX/a.out
-
kind: "find-v1"
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_AR"
description: "Path to a program."
@ -196,6 +259,7 @@ events:
- "ar"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -209,8 +273,7 @@ events:
found: "/usr/bin/ar"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -227,7 +290,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_RANLIB"
description: "Path to a program."
@ -243,6 +306,7 @@ events:
- "ranlib"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -256,8 +320,7 @@ events:
found: "/usr/bin/ranlib"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -274,7 +337,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_STRIP"
description: "Path to a program."
@ -290,6 +353,7 @@ events:
- "strip"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -303,8 +367,7 @@ events:
found: "/usr/bin/strip"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -321,7 +384,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_LINKER"
description: "Path to a program."
@ -337,6 +400,7 @@ events:
- "ld"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -350,8 +414,7 @@ events:
found: "/usr/bin/ld"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -368,7 +431,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_NM"
description: "Path to a program."
@ -384,6 +447,7 @@ events:
- "nm"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -397,8 +461,7 @@ events:
found: "/usr/bin/nm"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -415,7 +478,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_OBJDUMP"
description: "Path to a program."
@ -431,6 +494,7 @@ events:
- "objdump"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -444,8 +508,7 @@ events:
found: "/usr/bin/objdump"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -462,7 +525,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_OBJCOPY"
description: "Path to a program."
@ -478,6 +541,7 @@ events:
- "objcopy"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -491,8 +555,7 @@ events:
found: "/usr/bin/objcopy"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -509,7 +572,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_READELF"
description: "Path to a program."
@ -525,6 +588,7 @@ events:
- "readelf"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -538,8 +602,7 @@ events:
found: "/usr/bin/readelf"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -556,7 +619,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_DLLTOOL"
description: "Path to a program."
@ -572,6 +635,7 @@ events:
- "dlltool"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -584,6 +648,7 @@ events:
- "/usr/bin/core_perl/"
searched_directories:
- "/usr/bin/dlltool"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/dlltool"
- "/home/saqut/.local/bin/dlltool"
- "/usr/local/bin/dlltool"
- "/bin/dlltool"
@ -597,8 +662,7 @@ events:
found: false
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -615,7 +679,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_ADDR2LINE"
description: "Path to a program."
@ -631,6 +695,7 @@ events:
- "addr2line"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -644,8 +709,7 @@ events:
found: "/usr/bin/addr2line"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -662,7 +726,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeFindBinUtils.cmake:243 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:206 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_TAPI"
description: "Path to a program."
@ -678,6 +742,7 @@ events:
- "tapi"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -690,6 +755,7 @@ events:
- "/usr/bin/core_perl/"
searched_directories:
- "/usr/bin/tapi"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/tapi"
- "/home/saqut/.local/bin/tapi"
- "/usr/local/bin/tapi"
- "/bin/tapi"
@ -703,8 +769,7 @@ events:
found: false
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -721,7 +786,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/Compiler/GNU-FindBinUtils.cmake:18 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:207 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_CXX_COMPILER_AR"
description: "A wrapper around 'ar' adding the appropriate '--plugin' option for the GCC compiler"
@ -740,6 +805,7 @@ events:
- "gcc-ar"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -752,6 +818,7 @@ events:
- "/usr/bin/core_perl/"
searched_directories:
- "/usr/bin/gcc-ar-16.1"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/gcc-ar-16.1"
- "/home/saqut/.local/bin/gcc-ar-16.1"
- "/usr/local/bin/gcc-ar-16.1"
- "/bin/gcc-ar-16.1"
@ -763,6 +830,7 @@ events:
- "/usr/bin/vendor_perl/gcc-ar-16.1"
- "/usr/bin/core_perl/gcc-ar-16.1"
- "/usr/bin/gcc-ar-16"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/gcc-ar-16"
- "/home/saqut/.local/bin/gcc-ar-16"
- "/usr/local/bin/gcc-ar-16"
- "/bin/gcc-ar-16"
@ -774,6 +842,7 @@ events:
- "/usr/bin/vendor_perl/gcc-ar-16"
- "/usr/bin/core_perl/gcc-ar-16"
- "/usr/bin/gcc-ar16"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/gcc-ar16"
- "/home/saqut/.local/bin/gcc-ar16"
- "/usr/local/bin/gcc-ar16"
- "/bin/gcc-ar16"
@ -787,8 +856,7 @@ events:
found: "/usr/bin/gcc-ar"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -805,7 +873,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/Compiler/GNU-FindBinUtils.cmake:30 (find_program)"
- "/usr/share/cmake/Modules/CMakeDetermineCXXCompiler.cmake:207 (include)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
mode: "program"
variable: "CMAKE_CXX_COMPILER_RANLIB"
description: "A wrapper around 'ranlib' adding the appropriate '--plugin' option for the GCC compiler"
@ -824,6 +892,7 @@ events:
- "gcc-ranlib"
candidate_directories:
- "/usr/bin/"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/"
- "/home/saqut/.local/bin/"
- "/usr/local/bin/"
- "/bin/"
@ -836,6 +905,7 @@ events:
- "/usr/bin/core_perl/"
searched_directories:
- "/usr/bin/gcc-ranlib-16.1"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/gcc-ranlib-16.1"
- "/home/saqut/.local/bin/gcc-ranlib-16.1"
- "/usr/local/bin/gcc-ranlib-16.1"
- "/bin/gcc-ranlib-16.1"
@ -847,6 +917,7 @@ events:
- "/usr/bin/vendor_perl/gcc-ranlib-16.1"
- "/usr/bin/core_perl/gcc-ranlib-16.1"
- "/usr/bin/gcc-ranlib-16"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/gcc-ranlib-16"
- "/home/saqut/.local/bin/gcc-ranlib-16"
- "/usr/local/bin/gcc-ranlib-16"
- "/bin/gcc-ranlib-16"
@ -858,6 +929,7 @@ events:
- "/usr/bin/vendor_perl/gcc-ranlib-16"
- "/usr/bin/core_perl/gcc-ranlib-16"
- "/usr/bin/gcc-ranlib16"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin/gcc-ranlib16"
- "/home/saqut/.local/bin/gcc-ranlib16"
- "/usr/local/bin/gcc-ranlib16"
- "/bin/gcc-ranlib16"
@ -871,8 +943,7 @@ events:
found: "/usr/bin/gcc-ranlib"
search_context:
ENV{PATH}:
- "/home/saqut/.local/bin"
- "/home/saqut/.local/bin"
- "/home/saqut/.vscode/extensions/vadimcn.vscode-lldb-1.12.0/bin"
- "/home/saqut/.local/bin"
- "/usr/local/bin"
- "/usr/bin"
@ -889,12 +960,12 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeDetermineCompilerABI.cmake:83 (try_compile)"
- "/usr/share/cmake/Modules/CMakeTestCXXCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
checks:
- "Detecting CXX compiler ABI info"
directories:
source: "/home/saqut/Masa\u00fcst\u00fc/saqutcompiler/build/CMakeFiles/CMakeScratch/TryCompile-KRXVj0"
binary: "/home/saqut/Masa\u00fcst\u00fc/saqutcompiler/build/CMakeFiles/CMakeScratch/TryCompile-KRXVj0"
source: "/home/saqut/Masa\u00fcst\u00fc/saqutcompiler/build/CMakeFiles/CMakeScratch/TryCompile-tE3Uvz"
binary: "/home/saqut/Masa\u00fcst\u00fc/saqutcompiler/build/CMakeFiles/CMakeScratch/TryCompile-tE3Uvz"
cmakeVariables:
CMAKE_CXX_FLAGS: ""
CMAKE_CXX_FLAGS_DEBUG: "-g"
@ -905,19 +976,19 @@ events:
variable: "CMAKE_CXX_ABI_COMPILED"
cached: true
stdout: |
Change Dir: '/home/saqut/Masaüstü/saqutcompiler/build/CMakeFiles/CMakeScratch/TryCompile-KRXVj0'
Change Dir: '/home/saqut/Masaüstü/saqutcompiler/build/CMakeFiles/CMakeScratch/TryCompile-tE3Uvz'
Run Build Command(s): /usr/bin/ninja -v cmTC_aae80
[1/2] /usr/bin/g++ -v -o CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o -c /usr/share/cmake/Modules/CMakeCXXCompilerABI.cpp
Run Build Command(s): /usr/bin/ninja -v cmTC_3d12d
[1/2] /usr/bin/c++ -v -o CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o -c /usr/share/cmake/Modules/CMakeCXXCompilerABI.cpp
Using built-in specs.
COLLECT_GCC=/usr/bin/g++
COLLECT_GCC=/usr/bin/c++
Target: x86_64-pc-linux-gnu
Configured with: /build/gcc/src/gcc/configure --enable-languages=ada,c,c++,d,fortran,go,lto,m2,objc,obj-c++,rust,cobol --enable-bootstrap --prefix=/usr --libdir=/usr/lib --libexecdir=/usr/lib --mandir=/usr/share/man --infodir=/usr/share/info --with-bugurl=https://gitlab.archlinux.org/archlinux/packaging/packages/gcc/-/issues --with-build-config=bootstrap-lto --with-linker-hash-style=gnu --with-system-zlib --enable-cet=auto --enable-checking=release --enable-clocale=gnu --enable-default-pie --enable-default-ssp --enable-gnu-indirect-function --enable-gnu-unique-object --enable-libstdcxx-backtrace --enable-link-serialization=1 --enable-linker-build-id --enable-lto --enable-multilib --enable-plugin --enable-shared --enable-threads=posix --disable-libssp --disable-libstdcxx-pch --disable-werror --disable-fixincludes
Thread model: posix
Supported LTO compression algorithms: zlib zstd
gcc version 16.1.1 20260430 (GCC)
COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_aae80.dir/'
/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/cc1plus -quiet -v -D_GNU_SOURCE /usr/share/cmake/Modules/CMakeCXXCompilerABI.cpp -quiet -dumpdir CMakeFiles/cmTC_aae80.dir/ -dumpbase CMakeCXXCompilerABI.cpp.cpp -dumpbase-ext .cpp -mtune=generic -march=x86-64 -version -o /tmp/ccmm6pzq.s
COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_3d12d.dir/'
/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/cc1plus -quiet -v -D_GNU_SOURCE /usr/share/cmake/Modules/CMakeCXXCompilerABI.cpp -quiet -dumpdir CMakeFiles/cmTC_3d12d.dir/ -dumpbase CMakeCXXCompilerABI.cpp.cpp -dumpbase-ext .cpp -mtune=generic -march=x86-64 -version -o /tmp/ccHXl8ac.s
GNU C++20 (GCC) version 16.1.1 20260430 (x86_64-pc-linux-gnu)
compiled by GNU C version 16.1.1 20260430, GMP version 6.3.0, MPFR version 4.2.2, MPC version 1.4.1, isl version isl-0.27-GMP
@ -934,15 +1005,15 @@ events:
/usr/include
End of search list.
Compiler executable checksum: d47d0c990a24bc0dbaf3bd00656bd5f3
COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_aae80.dir/'
as -v --64 -o CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o /tmp/ccmm6pzq.s
COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_3d12d.dir/'
as -v --64 -o CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o /tmp/ccHXl8ac.s
GNU assembler version 2.46.0 (x86_64-pc-linux-gnu) using BFD version (GNU Binutils) 2.46.0
COMPILER_PATH=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/
LIBRARY_PATH=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/:/lib/../lib/:/usr/lib/../lib/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../:/lib/:/usr/lib/
COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.'
[2/2] : && /usr/bin/g++ -v -Wl,-v CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o -o cmTC_aae80 && :
COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.'
[2/2] : && /usr/bin/c++ -v -Wl,-v CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o -o cmTC_3d12d && :
Using built-in specs.
COLLECT_GCC=/usr/bin/g++
COLLECT_GCC=/usr/bin/c++
COLLECT_LTO_WRAPPER=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper
Target: x86_64-pc-linux-gnu
Configured with: /build/gcc/src/gcc/configure --enable-languages=ada,c,c++,d,fortran,go,lto,m2,objc,obj-c++,rust,cobol --enable-bootstrap --prefix=/usr --libdir=/usr/lib --libexecdir=/usr/lib --mandir=/usr/share/man --infodir=/usr/share/info --with-bugurl=https://gitlab.archlinux.org/archlinux/packaging/packages/gcc/-/issues --with-build-config=bootstrap-lto --with-linker-hash-style=gnu --with-system-zlib --enable-cet=auto --enable-checking=release --enable-clocale=gnu --enable-default-pie --enable-default-ssp --enable-gnu-indirect-function --enable-gnu-unique-object --enable-libstdcxx-backtrace --enable-link-serialization=1 --enable-linker-build-id --enable-lto --enable-multilib --enable-plugin --enable-shared --enable-threads=posix --disable-libssp --disable-libstdcxx-pch --disable-werror --disable-fixincludes
@ -951,12 +1022,12 @@ events:
gcc version 16.1.1 20260430 (GCC)
COMPILER_PATH=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/
LIBRARY_PATH=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/:/lib/../lib/:/usr/lib/../lib/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../:/lib/:/usr/lib/
COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_aae80' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_aae80.'
/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/collect2 -plugin /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so -plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper -plugin-opt=-fresolution=/tmp/cce8QsNN.res -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-latomic_asneeded -plugin-opt=-pass-through=-lc -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc --build-id --eh-frame-hdr --hash-style=gnu -m elf_x86_64 -dynamic-linker /lib64/ld-linux-x86-64.so.2 -pie -o cmTC_aae80 /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -v CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o -lstdc++ -lm -lgcc_s -lgcc -latomic_asneeded -lc -lgcc_s -lgcc /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o
COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_3d12d' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_3d12d.'
/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/collect2 -plugin /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so -plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper -plugin-opt=-fresolution=/tmp/ccq9todA.res -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-latomic_asneeded -plugin-opt=-pass-through=-lc -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc --build-id --eh-frame-hdr --hash-style=gnu -m elf_x86_64 -dynamic-linker /lib64/ld-linux-x86-64.so.2 -pie -o cmTC_3d12d /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -v CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o -lstdc++ -lm -lgcc_s -lgcc -latomic_asneeded -lc -lgcc_s -lgcc /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o
collect2 version 16.1.1 20260430
/usr/bin/ld -plugin /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so -plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper -plugin-opt=-fresolution=/tmp/cce8QsNN.res -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-latomic_asneeded -plugin-opt=-pass-through=-lc -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc --build-id --eh-frame-hdr --hash-style=gnu -m elf_x86_64 -dynamic-linker /lib64/ld-linux-x86-64.so.2 -pie -o cmTC_aae80 /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -v CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o -lstdc++ -lm -lgcc_s -lgcc -latomic_asneeded -lc -lgcc_s -lgcc /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o
/usr/bin/ld -plugin /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so -plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper -plugin-opt=-fresolution=/tmp/ccq9todA.res -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-latomic_asneeded -plugin-opt=-pass-through=-lc -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc --build-id --eh-frame-hdr --hash-style=gnu -m elf_x86_64 -dynamic-linker /lib64/ld-linux-x86-64.so.2 -pie -o cmTC_3d12d /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -v CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o -lstdc++ -lm -lgcc_s -lgcc -latomic_asneeded -lc -lgcc_s -lgcc /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o
GNU ld (GNU Binutils) 2.46.0
COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_aae80' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_aae80.'
COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_3d12d' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_3d12d.'
exitCode: 0
-
@ -964,7 +1035,7 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeDetermineCompilerABI.cmake:217 (message)"
- "/usr/share/cmake/Modules/CMakeTestCXXCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
message: |
Parsed CXX implicit include dir info: rv=done
found start of include info
@ -990,24 +1061,24 @@ events:
backtrace:
- "/usr/share/cmake/Modules/CMakeDetermineCompilerABI.cmake:253 (message)"
- "/usr/share/cmake/Modules/CMakeTestCXXCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
message: |
Parsed CXX implicit link information:
link line regex: [^( *|.*[/\\])(ld[0-9]*(|\\.[a-rt-z][a-z]*|\\.s[a-np-z][a-z]*|\\.so[a-z]+)|CMAKE_LINK_STARTFILE-NOTFOUND|([^/\\]+-)?ld|collect2)[^/\\]*( |$)]
linker tool regex: [^[ ]*(->|"|[0-9]+>[ -]*Build:[ 0-9]+ ms[ ]*)?[ ]*(([^"]*[/\\])?(ld[0-9]*(|\\.[a-rt-z][a-z]*|\\.s[a-np-z][a-z]*|\\.so[a-z]+)))("|,| |$)]
ignore line: [Change Dir: '/home/saqut/Masaüstü/saqutcompiler/build/CMakeFiles/CMakeScratch/TryCompile-KRXVj0']
ignore line: [Change Dir: '/home/saqut/Masaüstü/saqutcompiler/build/CMakeFiles/CMakeScratch/TryCompile-tE3Uvz']
ignore line: []
ignore line: [Run Build Command(s): /usr/bin/ninja -v cmTC_aae80]
ignore line: [[1/2] /usr/bin/g++ -v -o CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o -c /usr/share/cmake/Modules/CMakeCXXCompilerABI.cpp]
ignore line: [Run Build Command(s): /usr/bin/ninja -v cmTC_3d12d]
ignore line: [[1/2] /usr/bin/c++ -v -o CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o -c /usr/share/cmake/Modules/CMakeCXXCompilerABI.cpp]
ignore line: [Using built-in specs.]
ignore line: [COLLECT_GCC=/usr/bin/g++]
ignore line: [COLLECT_GCC=/usr/bin/c++]
ignore line: [Target: x86_64-pc-linux-gnu]
ignore line: [Configured with: /build/gcc/src/gcc/configure --enable-languages=ada c c++ d fortran go lto m2 objc obj-c++ rust cobol --enable-bootstrap --prefix=/usr --libdir=/usr/lib --libexecdir=/usr/lib --mandir=/usr/share/man --infodir=/usr/share/info --with-bugurl=https://gitlab.archlinux.org/archlinux/packaging/packages/gcc/-/issues --with-build-config=bootstrap-lto --with-linker-hash-style=gnu --with-system-zlib --enable-cet=auto --enable-checking=release --enable-clocale=gnu --enable-default-pie --enable-default-ssp --enable-gnu-indirect-function --enable-gnu-unique-object --enable-libstdcxx-backtrace --enable-link-serialization=1 --enable-linker-build-id --enable-lto --enable-multilib --enable-plugin --enable-shared --enable-threads=posix --disable-libssp --disable-libstdcxx-pch --disable-werror --disable-fixincludes]
ignore line: [Thread model: posix]
ignore line: [Supported LTO compression algorithms: zlib zstd]
ignore line: [gcc version 16.1.1 20260430 (GCC) ]
ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_aae80.dir/']
ignore line: [ /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/cc1plus -quiet -v -D_GNU_SOURCE /usr/share/cmake/Modules/CMakeCXXCompilerABI.cpp -quiet -dumpdir CMakeFiles/cmTC_aae80.dir/ -dumpbase CMakeCXXCompilerABI.cpp.cpp -dumpbase-ext .cpp -mtune=generic -march=x86-64 -version -o /tmp/ccmm6pzq.s]
ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_3d12d.dir/']
ignore line: [ /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/cc1plus -quiet -v -D_GNU_SOURCE /usr/share/cmake/Modules/CMakeCXXCompilerABI.cpp -quiet -dumpdir CMakeFiles/cmTC_3d12d.dir/ -dumpbase CMakeCXXCompilerABI.cpp.cpp -dumpbase-ext .cpp -mtune=generic -march=x86-64 -version -o /tmp/ccHXl8ac.s]
ignore line: [GNU C++20 (GCC) version 16.1.1 20260430 (x86_64-pc-linux-gnu)]
ignore line: [ compiled by GNU C version 16.1.1 20260430 GMP version 6.3.0 MPFR version 4.2.2 MPC version 1.4.1 isl version isl-0.27-GMP]
ignore line: []
@ -1024,15 +1095,15 @@ events:
ignore line: [ /usr/include]
ignore line: [End of search list.]
ignore line: [Compiler executable checksum: d47d0c990a24bc0dbaf3bd00656bd5f3]
ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_aae80.dir/']
ignore line: [ as -v --64 -o CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o /tmp/ccmm6pzq.s]
ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_3d12d.dir/']
ignore line: [ as -v --64 -o CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o /tmp/ccHXl8ac.s]
ignore line: [GNU assembler version 2.46.0 (x86_64-pc-linux-gnu) using BFD version (GNU Binutils) 2.46.0]
ignore line: [COMPILER_PATH=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/]
ignore line: [LIBRARY_PATH=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/:/lib/../lib/:/usr/lib/../lib/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../:/lib/:/usr/lib/]
ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.']
ignore line: [[2/2] : && /usr/bin/g++ -v -Wl -v CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o -o cmTC_aae80 && :]
ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o' '-c' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.']
ignore line: [[2/2] : && /usr/bin/c++ -v -Wl -v CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o -o cmTC_3d12d && :]
ignore line: [Using built-in specs.]
ignore line: [COLLECT_GCC=/usr/bin/g++]
ignore line: [COLLECT_GCC=/usr/bin/c++]
ignore line: [COLLECT_LTO_WRAPPER=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper]
ignore line: [Target: x86_64-pc-linux-gnu]
ignore line: [Configured with: /build/gcc/src/gcc/configure --enable-languages=ada c c++ d fortran go lto m2 objc obj-c++ rust cobol --enable-bootstrap --prefix=/usr --libdir=/usr/lib --libexecdir=/usr/lib --mandir=/usr/share/man --infodir=/usr/share/info --with-bugurl=https://gitlab.archlinux.org/archlinux/packaging/packages/gcc/-/issues --with-build-config=bootstrap-lto --with-linker-hash-style=gnu --with-system-zlib --enable-cet=auto --enable-checking=release --enable-clocale=gnu --enable-default-pie --enable-default-ssp --enable-gnu-indirect-function --enable-gnu-unique-object --enable-libstdcxx-backtrace --enable-link-serialization=1 --enable-linker-build-id --enable-lto --enable-multilib --enable-plugin --enable-shared --enable-threads=posix --disable-libssp --disable-libstdcxx-pch --disable-werror --disable-fixincludes]
@ -1041,13 +1112,13 @@ events:
ignore line: [gcc version 16.1.1 20260430 (GCC) ]
ignore line: [COMPILER_PATH=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/]
ignore line: [LIBRARY_PATH=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/:/lib/../lib/:/usr/lib/../lib/:/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../:/lib/:/usr/lib/]
ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_aae80' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_aae80.']
link line: [ /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/collect2 -plugin /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so -plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper -plugin-opt=-fresolution=/tmp/cce8QsNN.res -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-latomic_asneeded -plugin-opt=-pass-through=-lc -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc --build-id --eh-frame-hdr --hash-style=gnu -m elf_x86_64 -dynamic-linker /lib64/ld-linux-x86-64.so.2 -pie -o cmTC_aae80 /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -v CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o -lstdc++ -lm -lgcc_s -lgcc -latomic_asneeded -lc -lgcc_s -lgcc /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o]
ignore line: [COLLECT_GCC_OPTIONS='-v' '-o' 'cmTC_3d12d' '-shared-libgcc' '-mtune=generic' '-march=x86-64' '-dumpdir' 'cmTC_3d12d.']
link line: [ /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/collect2 -plugin /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so -plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper -plugin-opt=-fresolution=/tmp/ccq9todA.res -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-latomic_asneeded -plugin-opt=-pass-through=-lc -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc --build-id --eh-frame-hdr --hash-style=gnu -m elf_x86_64 -dynamic-linker /lib64/ld-linux-x86-64.so.2 -pie -o cmTC_3d12d /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -v CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o -lstdc++ -lm -lgcc_s -lgcc -latomic_asneeded -lc -lgcc_s -lgcc /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o]
arg [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/collect2] ==> ignore
arg [-plugin] ==> ignore
arg [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so] ==> ignore
arg [-plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper] ==> ignore
arg [-plugin-opt=-fresolution=/tmp/cce8QsNN.res] ==> ignore
arg [-plugin-opt=-fresolution=/tmp/ccq9todA.res] ==> ignore
arg [-plugin-opt=-pass-through=-lgcc_s] ==> ignore
arg [-plugin-opt=-pass-through=-lgcc] ==> ignore
arg [-plugin-opt=-pass-through=-latomic_asneeded] ==> ignore
@ -1063,7 +1134,7 @@ events:
arg [/lib64/ld-linux-x86-64.so.2] ==> ignore
arg [-pie] ==> ignore
arg [-o] ==> ignore
arg [cmTC_aae80] ==> ignore
arg [cmTC_3d12d] ==> ignore
arg [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o] ==> obj [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o]
arg [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o] ==> obj [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o]
arg [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o] ==> obj [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o]
@ -1075,7 +1146,7 @@ events:
arg [-L/lib] ==> dir [/lib]
arg [-L/usr/lib] ==> dir [/usr/lib]
arg [-v] ==> ignore
arg [CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o] ==> ignore
arg [CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o] ==> ignore
arg [-lstdc++] ==> lib [stdc++]
arg [-lm] ==> lib [m]
arg [-lgcc_s] ==> lib [gcc_s]
@ -1087,7 +1158,7 @@ events:
arg [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o] ==> obj [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o]
arg [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o] ==> obj [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o]
ignore line: [collect2 version 16.1.1 20260430]
ignore line: [/usr/bin/ld -plugin /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so -plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper -plugin-opt=-fresolution=/tmp/cce8QsNN.res -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-latomic_asneeded -plugin-opt=-pass-through=-lc -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc --build-id --eh-frame-hdr --hash-style=gnu -m elf_x86_64 -dynamic-linker /lib64/ld-linux-x86-64.so.2 -pie -o cmTC_aae80 /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -v CMakeFiles/cmTC_aae80.dir/CMakeCXXCompilerABI.cpp.o -lstdc++ -lm -lgcc_s -lgcc -latomic_asneeded -lc -lgcc_s -lgcc /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o]
ignore line: [/usr/bin/ld -plugin /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/liblto_plugin.so -plugin-opt=/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/lto-wrapper -plugin-opt=-fresolution=/tmp/ccq9todA.res -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc -plugin-opt=-pass-through=-latomic_asneeded -plugin-opt=-pass-through=-lc -plugin-opt=-pass-through=-lgcc_s -plugin-opt=-pass-through=-lgcc --build-id --eh-frame-hdr --hash-style=gnu -m elf_x86_64 -dynamic-linker /lib64/ld-linux-x86-64.so.2 -pie -o cmTC_3d12d /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -v CMakeFiles/cmTC_3d12d.dir/CMakeCXXCompilerABI.cpp.o -lstdc++ -lm -lgcc_s -lgcc -latomic_asneeded -lc -lgcc_s -lgcc /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o]
linker tool for 'CXX': /usr/bin/ld
collapse obj [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/Scrt1.o] ==> [/usr/lib/Scrt1.o]
collapse obj [/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o] ==> [/usr/lib/crti.o]
@ -1111,7 +1182,7 @@ events:
- "/usr/share/cmake/Modules/Internal/CMakeDetermineLinkerId.cmake:38 (message)"
- "/usr/share/cmake/Modules/CMakeDetermineCompilerABI.cmake:299 (cmake_determine_linker_id)"
- "/usr/share/cmake/Modules/CMakeTestCXXCompiler.cmake:26 (CMAKE_DETERMINE_COMPILER_ABI)"
- "CMakeLists.txt:2 (project)"
- "CMakeLists.txt:51 (project)"
message: |
Running the CXX compiler's linker: "/usr/bin/ld" "-v"
GNU ld (GNU Binutils) 2.46.0

View File

@ -16,7 +16,7 @@
rule CXX_SCAN__saqut_Debug
depfile = $DEP_FILE
command = /usr/bin/g++ $DEFINES $INCLUDES $FLAGS -E -x c++ $in -MT $DYNDEP_INTERMEDIATE_FILE -MD -MF $DEP_FILE -fmodules-ts -fdeps-file=$DYNDEP_INTERMEDIATE_FILE -fdeps-target=$OBJ_FILE -fdeps-format=p1689r5 -o $PREPROCESSED_OUTPUT_FILE
command = /usr/bin/c++ $DEFINES $INCLUDES $FLAGS -E -x c++ $in -MT $DYNDEP_INTERMEDIATE_FILE -MD -MF $DEP_FILE -fmodules-ts -fdeps-file=$DYNDEP_INTERMEDIATE_FILE -fdeps-target=$OBJ_FILE -fdeps-format=p1689r5 -o $PREPROCESSED_OUTPUT_FILE
description = Scanning $in for CXX dependencies
@ -37,7 +37,7 @@ rule CXX_DYNDEP__saqut_Debug
rule CXX_COMPILER__saqut_scanned_Debug
depfile = $DEP_FILE
deps = gcc
command = ${LAUNCHER}${CODE_CHECK}/usr/bin/g++ $DEFINES $INCLUDES $FLAGS -MD -MT $out -MF $DEP_FILE -fmodules-ts -fmodule-mapper=$DYNDEP_MODULE_MAP_FILE -MD -fdeps-format=p1689r5 -x c++ -o $out -c $in
command = ${LAUNCHER}${CODE_CHECK}/usr/bin/c++ $DEFINES $INCLUDES $FLAGS -MD -MT $out -MF $DEP_FILE -fmodules-ts -fmodule-mapper=$DYNDEP_MODULE_MAP_FILE -MD -fdeps-format=p1689r5 -x c++ -o $out -c $in
description = Building CXX object $out
@ -47,7 +47,7 @@ rule CXX_COMPILER__saqut_scanned_Debug
rule CXX_COMPILER__saqut_unscanned_Debug
depfile = $DEP_FILE
deps = gcc
command = ${LAUNCHER}${CODE_CHECK}/usr/bin/g++ $DEFINES $INCLUDES $FLAGS -MD -MT $out -MF $DEP_FILE -o $out -c $in
command = ${LAUNCHER}${CODE_CHECK}/usr/bin/c++ $DEFINES $INCLUDES $FLAGS -MD -MT $out -MF $DEP_FILE -o $out -c $in
description = Building CXX object $out
@ -57,7 +57,7 @@ rule CXX_COMPILER__saqut_unscanned_Debug
rule CXX_EXECUTABLE_LINKER__saqut_Debug
depfile = $DEP_FILE
deps = gcc
command = $PRE_LINK && /usr/bin/g++ $FLAGS $LINK_FLAGS $in -o $TARGET_FILE $LINK_PATH $LINK_LIBRARIES && $POST_BUILD
command = $PRE_LINK && /usr/bin/c++ $FLAGS $LINK_FLAGS $in -o $TARGET_FILE $LINK_PATH $LINK_LIBRARIES && $POST_BUILD
description = Linking CXX executable $TARGET_FILE
restat = $RESTAT

View File

@ -58,33 +58,6 @@ build CMakeFiles/saqut.dir/src/core/sourcefile.cpp.o: CXX_COMPILER__saqut_unscan
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/core
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/ir/ir_function.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/ir/ir_function.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/ir/ir_function.cpp.o.d
FLAGS = -g -std=gnu++20 -Wall -Wextra -g -O0
INCLUDES = -I/home/saqut/Masaüstü/saqutcompiler/src
OBJECT_DIR = CMakeFiles/saqut.dir
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/ir
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/ir/ir_generator.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/ir/ir_generator.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/ir/ir_generator.cpp.o.d
FLAGS = -g -std=gnu++20 -Wall -Wextra -g -O0
INCLUDES = -I/home/saqut/Masaüstü/saqutcompiler/src
OBJECT_DIR = CMakeFiles/saqut.dir
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/ir
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/ir/ir_program.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/ir/ir_program.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/ir/ir_program.cpp.o.d
FLAGS = -g -std=gnu++20 -Wall -Wextra -g -O0
INCLUDES = -I/home/saqut/Masaüstü/saqutcompiler/src
OBJECT_DIR = CMakeFiles/saqut.dir
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/ir
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/lexer/lexer.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/lexer/lexer.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/lexer/lexer.cpp.o.d
@ -175,33 +148,6 @@ build CMakeFiles/saqut.dir/src/parser/parser.cpp.o: CXX_COMPILER__saqut_unscanne
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/parser
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/semantic/structural_validator.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/semantic/structural_validator.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/semantic/structural_validator.cpp.o.d
FLAGS = -g -std=gnu++20 -Wall -Wextra -g -O0
INCLUDES = -I/home/saqut/Masaüstü/saqutcompiler/src
OBJECT_DIR = CMakeFiles/saqut.dir
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/semantic
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/semantic/type_checker.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/semantic/type_checker.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/semantic/type_checker.cpp.o.d
FLAGS = -g -std=gnu++20 -Wall -Wextra -g -O0
INCLUDES = -I/home/saqut/Masaüstü/saqutcompiler/src
OBJECT_DIR = CMakeFiles/saqut.dir
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/semantic
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/symbol/symbol_collector.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/symbol/symbol_collector.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/symbol/symbol_collector.cpp.o.d
FLAGS = -g -std=gnu++20 -Wall -Wextra -g -O0
INCLUDES = -I/home/saqut/Masaüstü/saqutcompiler/src
OBJECT_DIR = CMakeFiles/saqut.dir
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/symbol
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/tokenizer/tokenizer.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o.d
@ -211,15 +157,6 @@ build CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o: CXX_COMPILER__saqut_un
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/tokenizer
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
build CMakeFiles/saqut.dir/src/vm/interpreter.cpp.o: CXX_COMPILER__saqut_unscanned_Debug /home/saqut/Masaüstü/saqutcompiler/src/vm/interpreter.cpp || cmake_object_order_depends_target_saqut
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/src/vm/interpreter.cpp.o.d
FLAGS = -g -std=gnu++20 -Wall -Wextra -g -O0
INCLUDES = -I/home/saqut/Masaüstü/saqutcompiler/src
OBJECT_DIR = CMakeFiles/saqut.dir
OBJECT_FILE_DIR = CMakeFiles/saqut.dir/src/vm
TARGET_SUPPORT_DIR = CMakeFiles/saqut.dir
# =============================================================================
# Link build statements for EXECUTABLE target saqut
@ -228,7 +165,7 @@ build CMakeFiles/saqut.dir/src/vm/interpreter.cpp.o: CXX_COMPILER__saqut_unscann
#############################################
# Link the executable saqut
build saqut: CXX_EXECUTABLE_LINKER__saqut_Debug CMakeFiles/saqut.dir/src/core/sourcefile.cpp.o CMakeFiles/saqut.dir/src/ir/ir_function.cpp.o CMakeFiles/saqut.dir/src/ir/ir_generator.cpp.o CMakeFiles/saqut.dir/src/ir/ir_program.cpp.o CMakeFiles/saqut.dir/src/lexer/lexer.cpp.o CMakeFiles/saqut.dir/src/main.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/binary_expr.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/declarations.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/expressions.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/identifier.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/literal.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/program.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/statements.cpp.o CMakeFiles/saqut.dir/src/parser/parser.cpp.o CMakeFiles/saqut.dir/src/semantic/structural_validator.cpp.o CMakeFiles/saqut.dir/src/semantic/type_checker.cpp.o CMakeFiles/saqut.dir/src/symbol/symbol_collector.cpp.o CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o CMakeFiles/saqut.dir/src/vm/interpreter.cpp.o
build saqut: CXX_EXECUTABLE_LINKER__saqut_Debug CMakeFiles/saqut.dir/src/core/sourcefile.cpp.o CMakeFiles/saqut.dir/src/lexer/lexer.cpp.o CMakeFiles/saqut.dir/src/main.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/binary_expr.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/declarations.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/expressions.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/identifier.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/literal.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/program.cpp.o CMakeFiles/saqut.dir/src/parser/nodes/statements.cpp.o CMakeFiles/saqut.dir/src/parser/parser.cpp.o CMakeFiles/saqut.dir/src/tokenizer/tokenizer.cpp.o
CONFIG = Debug
DEP_FILE = CMakeFiles/saqut.dir/link.d
FLAGS = -g
@ -284,14 +221,14 @@ build all: phony saqut
#############################################
# Re-run CMake if any of its inputs changed.
build build.ninja /home/saqut/Masaüstü/saqutcompiler/build/cmake_install.cmake: RERUN_CMAKE | /home/saqut/Masaüstü/saqutcompiler/CMakeLists.txt /usr/share/cmake/Modules/CMakeCXXInformation.cmake /usr/share/cmake/Modules/CMakeCommonLanguageInclude.cmake /usr/share/cmake/Modules/CMakeGenericSystem.cmake /usr/share/cmake/Modules/CMakeInitializeConfigs.cmake /usr/share/cmake/Modules/CMakeLanguageInformation.cmake /usr/share/cmake/Modules/CMakeSystemSpecificInformation.cmake /usr/share/cmake/Modules/CMakeSystemSpecificInitialize.cmake /usr/share/cmake/Modules/Compiler/CMakeCommonCompilerMacros.cmake /usr/share/cmake/Modules/Compiler/GNU-CXX.cmake /usr/share/cmake/Modules/Compiler/GNU.cmake /usr/share/cmake/Modules/Internal/CMakeCXXLinkerInformation.cmake /usr/share/cmake/Modules/Internal/CMakeCommonLinkerInformation.cmake /usr/share/cmake/Modules/Linker/GNU-CXX.cmake /usr/share/cmake/Modules/Linker/GNU.cmake /usr/share/cmake/Modules/Platform/Linker/GNU.cmake /usr/share/cmake/Modules/Platform/Linker/Linux-GNU-CXX.cmake /usr/share/cmake/Modules/Platform/Linker/Linux-GNU.cmake /usr/share/cmake/Modules/Platform/Linux-GNU-CXX.cmake /usr/share/cmake/Modules/Platform/Linux-GNU.cmake /usr/share/cmake/Modules/Platform/Linux-Initialize.cmake /usr/share/cmake/Modules/Platform/Linux.cmake /usr/share/cmake/Modules/Platform/UnixPaths.cmake CMakeCache.txt CMakeFiles/4.3.3/CMakeCXXCompiler.cmake CMakeFiles/4.3.3/CMakeSystem.cmake
build build.ninja /home/saqut/Masaüstü/saqutcompiler/build/cmake_install.cmake: RERUN_CMAKE | /home/saqut/Masaüstü/saqutcompiler/CMakeLists.txt /usr/share/cmake/Modules/CMakeCXXInformation.cmake /usr/share/cmake/Modules/CMakeCommonLanguageInclude.cmake /usr/share/cmake/Modules/CMakeGenericSystem.cmake /usr/share/cmake/Modules/CMakeInitializeConfigs.cmake /usr/share/cmake/Modules/CMakeLanguageInformation.cmake /usr/share/cmake/Modules/CMakeSystemSpecificInformation.cmake /usr/share/cmake/Modules/CMakeSystemSpecificInitialize.cmake /usr/share/cmake/Modules/Compiler/CMakeCommonCompilerMacros.cmake /usr/share/cmake/Modules/Compiler/GNU-CXX.cmake /usr/share/cmake/Modules/Compiler/GNU.cmake /usr/share/cmake/Modules/Internal/CMakeCXXLinkerInformation.cmake /usr/share/cmake/Modules/Internal/CMakeCommonLinkerInformation.cmake /usr/share/cmake/Modules/Linker/GNU-CXX.cmake /usr/share/cmake/Modules/Linker/GNU.cmake /usr/share/cmake/Modules/Platform/Linker/GNU.cmake /usr/share/cmake/Modules/Platform/Linker/Linux-GNU-CXX.cmake /usr/share/cmake/Modules/Platform/Linker/Linux-GNU.cmake /usr/share/cmake/Modules/Platform/Linux-GNU-CXX.cmake /usr/share/cmake/Modules/Platform/Linux-GNU.cmake /usr/share/cmake/Modules/Platform/Linux-Initialize.cmake /usr/share/cmake/Modules/Platform/Linux.cmake /usr/share/cmake/Modules/Platform/UnixPaths.cmake CMakeCache.txt CMakeFiles/4.3.2/CMakeCXXCompiler.cmake CMakeFiles/4.3.2/CMakeSystem.cmake
pool = console
#############################################
# A missing CMake input file is not an error.
build /home/saqut/Masaüstü/saqutcompiler/CMakeLists.txt /usr/share/cmake/Modules/CMakeCXXInformation.cmake /usr/share/cmake/Modules/CMakeCommonLanguageInclude.cmake /usr/share/cmake/Modules/CMakeGenericSystem.cmake /usr/share/cmake/Modules/CMakeInitializeConfigs.cmake /usr/share/cmake/Modules/CMakeLanguageInformation.cmake /usr/share/cmake/Modules/CMakeSystemSpecificInformation.cmake /usr/share/cmake/Modules/CMakeSystemSpecificInitialize.cmake /usr/share/cmake/Modules/Compiler/CMakeCommonCompilerMacros.cmake /usr/share/cmake/Modules/Compiler/GNU-CXX.cmake /usr/share/cmake/Modules/Compiler/GNU.cmake /usr/share/cmake/Modules/Internal/CMakeCXXLinkerInformation.cmake /usr/share/cmake/Modules/Internal/CMakeCommonLinkerInformation.cmake /usr/share/cmake/Modules/Linker/GNU-CXX.cmake /usr/share/cmake/Modules/Linker/GNU.cmake /usr/share/cmake/Modules/Platform/Linker/GNU.cmake /usr/share/cmake/Modules/Platform/Linker/Linux-GNU-CXX.cmake /usr/share/cmake/Modules/Platform/Linker/Linux-GNU.cmake /usr/share/cmake/Modules/Platform/Linux-GNU-CXX.cmake /usr/share/cmake/Modules/Platform/Linux-GNU.cmake /usr/share/cmake/Modules/Platform/Linux-Initialize.cmake /usr/share/cmake/Modules/Platform/Linux.cmake /usr/share/cmake/Modules/Platform/UnixPaths.cmake CMakeCache.txt CMakeFiles/4.3.3/CMakeCXXCompiler.cmake CMakeFiles/4.3.3/CMakeSystem.cmake: phony
build /home/saqut/Masaüstü/saqutcompiler/CMakeLists.txt /usr/share/cmake/Modules/CMakeCXXInformation.cmake /usr/share/cmake/Modules/CMakeCommonLanguageInclude.cmake /usr/share/cmake/Modules/CMakeGenericSystem.cmake /usr/share/cmake/Modules/CMakeInitializeConfigs.cmake /usr/share/cmake/Modules/CMakeLanguageInformation.cmake /usr/share/cmake/Modules/CMakeSystemSpecificInformation.cmake /usr/share/cmake/Modules/CMakeSystemSpecificInitialize.cmake /usr/share/cmake/Modules/Compiler/CMakeCommonCompilerMacros.cmake /usr/share/cmake/Modules/Compiler/GNU-CXX.cmake /usr/share/cmake/Modules/Compiler/GNU.cmake /usr/share/cmake/Modules/Internal/CMakeCXXLinkerInformation.cmake /usr/share/cmake/Modules/Internal/CMakeCommonLinkerInformation.cmake /usr/share/cmake/Modules/Linker/GNU-CXX.cmake /usr/share/cmake/Modules/Linker/GNU.cmake /usr/share/cmake/Modules/Platform/Linker/GNU.cmake /usr/share/cmake/Modules/Platform/Linker/Linux-GNU-CXX.cmake /usr/share/cmake/Modules/Platform/Linker/Linux-GNU.cmake /usr/share/cmake/Modules/Platform/Linux-GNU-CXX.cmake /usr/share/cmake/Modules/Platform/Linux-GNU.cmake /usr/share/cmake/Modules/Platform/Linux-Initialize.cmake /usr/share/cmake/Modules/Platform/Linux.cmake /usr/share/cmake/Modules/Platform/UnixPaths.cmake CMakeCache.txt CMakeFiles/4.3.2/CMakeCXXCompiler.cmake CMakeFiles/4.3.2/CMakeSystem.cmake: phony
#############################################

View File

@ -1,421 +0,0 @@
Flat profile:
Each sample counts as 0.01 seconds.
% cumulative self self total
time seconds seconds calls ms/call ms/call name
22.22 0.02 0.02 1064503 0.00 0.00 SourceFile::offsetToLocation(int) const
11.11 0.03 0.01 1059636 0.00 0.00 Tokenizer::scope()
11.11 0.04 0.01 1059635 0.00 0.00 Lexer::isNumeric()
11.11 0.05 0.01 461302 0.00 0.00 DelimiterToken::~DelimiterToken()
11.11 0.06 0.01 278426 0.00 0.00 DelimiterToken::DelimiterToken()
11.11 0.07 0.01 133847 0.00 0.00 Lexer::readNumeric()
11.11 0.08 0.01 1 10.00 90.00 cmdTokens(CliArgs const&)
11.11 0.09 0.01 1 10.00 70.00 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >)
0.00 0.09 0.00 2754372 0.00 0.00 Lexer::isEnd()
0.00 0.09 0.00 2620524 0.00 0.00 Lexer::getchar()
0.00 0.09 0.00 2119274 0.00 0.00 Lexer::include(std::basic_string_view<char, std::char_traits<char> >, bool)
0.00 0.09 0.00 1851576 0.00 0.00 Lexer::getOffset()
0.00 0.09 0.00 1059640 0.00 0.00 Lexer::skipWhiteSpace()
0.00 0.09 0.00 991432 0.00 0.00 std::__detail::_Map_base<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, int>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, int> >, std::__detail::_Select1st, std::equal_to<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::hash<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true>, true>::operator[](std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
0.00 0.09 0.00 925788 0.00 0.00 Lexer::getchar(int)
0.00 0.09 0.00 691504 0.00 0.00 Lexer::getLocation()
0.00 0.09 0.00 691504 0.00 0.00 Lexer::toChar(int)
0.00 0.09 0.00 400817 0.00 0.00 Lexer::nextChar()
0.00 0.09 0.00 234284 0.00 0.00 IdentifierToken::~IdentifierToken()
0.00 0.09 0.00 234284 0.00 0.00 Lexer::beginPosition()
0.00 0.09 0.00 234284 0.00 0.00 Lexer::acceptPosition()
0.00 0.09 0.00 234284 0.00 0.00 Tokenizer::readIdentifier()
0.00 0.09 0.00 230202 0.00 0.00 OperatorToken::OperatorToken()
0.00 0.09 0.00 230202 0.00 0.00 OperatorToken::~OperatorToken()
0.00 0.09 0.00 133847 0.00 0.00 NumberToken::~NumberToken()
0.00 0.09 0.00 58981 0.00 0.00 KeywordToken::~KeywordToken()
0.00 0.09 0.00 21 0.00 0.00 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long)
0.00 0.09 0.00 20 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&)
0.00 0.09 0.00 19 0.00 0.00 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.09 0.00 11 0.00 0.00 bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*)
0.00 0.09 0.00 9 0.00 0.00 CliCommand::~CliCommand()
0.00 0.09 0.00 7 0.00 0.00 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&)
0.00 0.09 0.00 3 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.09 0.00 3 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.09 0.00 3 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.09 0.00 3 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.09 0.00 2 0.00 0.00 std::_Hashtable<TokenType, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > >, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > >, std::__detail::_Select1st, std::equal_to<TokenType>, std::hash<TokenType>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::_Hashtable<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*>(std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, unsigned long, std::hash<TokenType> const&, std::equal_to<TokenType> const&, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > > const&, std::integral_constant<bool, true>)
0.00 0.09 0.00 2 0.00 0.00 std::_Hashtable<std::basic_string_view<char, std::char_traits<char> >, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType>, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> >, std::__detail::_Select1st, std::equal_to<std::basic_string_view<char, std::char_traits<char> > >, std::hash<std::basic_string_view<char, std::char_traits<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true> >::_Hashtable<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*>(std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, unsigned long, std::hash<std::basic_string_view<char, std::char_traits<char> > > const&, std::equal_to<std::basic_string_view<char, std::char_traits<char> > > const&, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> > const&, std::integral_constant<bool, true>)
0.00 0.09 0.00 1 0.00 0.00 readSource[abi:cxx11](CliArgs const&)
0.00 0.09 0.00 1 0.00 0.00 parseArgs(int, char**)
0.00 0.09 0.00 1 0.00 0.00 SourceFile::computeLineStarts()
0.00 0.09 0.00 1 0.00 0.00 SourceFile::setText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
0.00 0.09 0.00 1 0.00 0.00 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
0.00 0.09 0.00 1 0.00 0.00 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_invoke(std::_Any_data const&, CliArgs const&)
% the percentage of the total running time of the
time program used by this function.
cumulative a running sum of the number of seconds accounted
seconds for by this function and those listed above it.
self the number of seconds accounted for by this
seconds function alone. This is the major sort for this
listing.
calls the number of times this function was invoked, if
this function is profiled, else blank.
self the average number of milliseconds spent in this
ms/call function per call, if this function is profiled,
else blank.
total the average number of milliseconds spent in this
ms/call function and its descendents per call, if this
function is profiled, else blank.
name the name of the function. This is the minor sort
for this listing. The index shows the location of
the function in the gprof listing. If the index is
in parenthesis it shows where it would appear in
the gprof listing if it were to be printed.
Copyright (C) 2012-2026 Free Software Foundation, Inc.
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
Call graph (explanation follows)
granularity: each sample hit covers 4 byte(s) for 11.11% of 0.09 seconds
index % time self children called name
<spontaneous>
[1] 100.0 0.00 0.09 main [1]
0.01 0.08 1/1 cmdTokens(CliArgs const&) [2]
0.00 0.00 18/20 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&) [35]
0.00 0.00 9/9 CliCommand::~CliCommand() [38]
0.00 0.00 7/19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [36]
0.00 0.00 7/7 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [39]
0.00 0.00 4/21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [34]
0.00 0.00 1/1 parseArgs(int, char**) [47]
0.00 0.00 1/11 bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [37]
0.00 0.00 1/1 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_invoke(std::_Any_data const&, CliArgs const&) [51]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [42]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [41]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [40]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [43]
-----------------------------------------------
0.01 0.08 1/1 main [1]
[2] 100.0 0.01 0.08 1 cmdTokens(CliArgs const&) [2]
0.01 0.06 1/1 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
0.01 0.00 461302/461302 DelimiterToken::~DelimiterToken() [9]
0.00 0.00 230202/230202 OperatorToken::~OperatorToken() [31]
0.00 0.00 175303/234284 IdentifierToken::~IdentifierToken() [27]
0.00 0.00 133847/133847 NumberToken::~NumberToken() [32]
0.00 0.00 58981/58981 KeywordToken::~KeywordToken() [33]
0.00 0.00 2/21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [34]
0.00 0.00 1/1 readSource[abi:cxx11](CliArgs const&) [46]
-----------------------------------------------
0.01 0.06 1/1 cmdTokens(CliArgs const&) [2]
[3] 77.8 0.01 0.06 1 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
0.01 0.05 1059636/1059636 Tokenizer::scope() [4]
0.00 0.00 1059635/2754372 Lexer::isEnd() [18]
0.00 0.00 1/1 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [50]
-----------------------------------------------
0.01 0.05 1059636/1059636 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
[4] 66.7 0.01 0.05 1059636 Tokenizer::scope() [4]
0.00 0.01 691504/691504 Lexer::getLocation() [6]
0.01 0.00 133847/133847 Lexer::readNumeric() [7]
0.01 0.00 1059635/1059635 Lexer::isNumeric() [8]
0.01 0.00 278426/278426 DelimiterToken::DelimiterToken() [10]
0.00 0.00 234284/234284 Tokenizer::readIdentifier() [11]
0.00 0.00 2119274/2119274 Lexer::include(std::basic_string_view<char, std::char_traits<char> >, bool) [20]
0.00 0.00 1985561/2620524 Lexer::getchar() [19]
0.00 0.00 1383008/1851576 Lexer::getOffset() [21]
0.00 0.00 1059774/2754372 Lexer::isEnd() [18]
0.00 0.00 1059640/1059640 Lexer::skipWhiteSpace() [22]
0.00 0.00 991400/991432 std::__detail::_Map_base<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, int>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, int> >, std::__detail::_Select1st, std::equal_to<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::hash<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true>, true>::operator[](std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [23]
0.00 0.00 925788/925788 Lexer::getchar(int) [24]
0.00 0.00 691504/691504 Lexer::toChar(int) [25]
0.00 0.00 230202/230202 OperatorToken::OperatorToken() [30]
0.00 0.00 58981/234284 IdentifierToken::~IdentifierToken() [27]
0.00 0.00 138/400817 Lexer::nextChar() [26]
-----------------------------------------------
0.00 0.00 138715/1064503 Lexer::readNumeric() [7]
0.00 0.00 234284/1064503 Tokenizer::readIdentifier() [11]
0.01 0.00 691504/1064503 Lexer::getLocation() [6]
[5] 22.2 0.02 0.00 1064503 SourceFile::offsetToLocation(int) const [5]
-----------------------------------------------
0.00 0.01 691504/691504 Tokenizer::scope() [4]
[6] 14.4 0.00 0.01 691504 Lexer::getLocation() [6]
0.01 0.00 691504/1064503 SourceFile::offsetToLocation(int) const [5]
-----------------------------------------------
0.01 0.00 133847/133847 Tokenizer::scope() [4]
[7] 14.0 0.01 0.00 133847 Lexer::readNumeric() [7]
0.00 0.00 138715/1064503 SourceFile::offsetToLocation(int) const [5]
-----------------------------------------------
0.01 0.00 1059635/1059635 Tokenizer::scope() [4]
[8] 11.1 0.01 0.00 1059635 Lexer::isNumeric() [8]
-----------------------------------------------
0.01 0.00 461302/461302 cmdTokens(CliArgs const&) [2]
[9] 11.1 0.01 0.00 461302 DelimiterToken::~DelimiterToken() [9]
-----------------------------------------------
0.01 0.00 278426/278426 Tokenizer::scope() [4]
[10] 11.1 0.01 0.00 278426 DelimiterToken::DelimiterToken() [10]
-----------------------------------------------
0.00 0.00 234284/234284 Tokenizer::scope() [4]
[11] 4.9 0.00 0.00 234284 Tokenizer::readIdentifier() [11]
0.00 0.00 234284/1064503 SourceFile::offsetToLocation(int) const [5]
0.00 0.00 634963/2754372 Lexer::isEnd() [18]
0.00 0.00 634963/2620524 Lexer::getchar() [19]
0.00 0.00 468568/1851576 Lexer::getOffset() [21]
0.00 0.00 400679/400817 Lexer::nextChar() [26]
0.00 0.00 234284/234284 Lexer::beginPosition() [28]
0.00 0.00 234284/234284 Lexer::acceptPosition() [29]
-----------------------------------------------
0.00 0.00 634963/2754372 Tokenizer::readIdentifier() [11]
0.00 0.00 1059635/2754372 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
0.00 0.00 1059774/2754372 Tokenizer::scope() [4]
[18] 0.0 0.00 0.00 2754372 Lexer::isEnd() [18]
-----------------------------------------------
0.00 0.00 634963/2620524 Tokenizer::readIdentifier() [11]
0.00 0.00 1985561/2620524 Tokenizer::scope() [4]
[19] 0.0 0.00 0.00 2620524 Lexer::getchar() [19]
-----------------------------------------------
0.00 0.00 2119274/2119274 Tokenizer::scope() [4]
[20] 0.0 0.00 0.00 2119274 Lexer::include(std::basic_string_view<char, std::char_traits<char> >, bool) [20]
-----------------------------------------------
0.00 0.00 468568/1851576 Tokenizer::readIdentifier() [11]
0.00 0.00 1383008/1851576 Tokenizer::scope() [4]
[21] 0.0 0.00 0.00 1851576 Lexer::getOffset() [21]
-----------------------------------------------
0.00 0.00 1059640/1059640 Tokenizer::scope() [4]
[22] 0.0 0.00 0.00 1059640 Lexer::skipWhiteSpace() [22]
-----------------------------------------------
0.00 0.00 32/991432 __static_initialization_and_destruction_0() [81]
0.00 0.00 991400/991432 Tokenizer::scope() [4]
[23] 0.0 0.00 0.00 991432 std::__detail::_Map_base<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, int>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, int> >, std::__detail::_Select1st, std::equal_to<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::hash<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true>, true>::operator[](std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [23]
-----------------------------------------------
0.00 0.00 925788/925788 Tokenizer::scope() [4]
[24] 0.0 0.00 0.00 925788 Lexer::getchar(int) [24]
-----------------------------------------------
0.00 0.00 691504/691504 Tokenizer::scope() [4]
[25] 0.0 0.00 0.00 691504 Lexer::toChar(int) [25]
-----------------------------------------------
0.00 0.00 138/400817 Tokenizer::scope() [4]
0.00 0.00 400679/400817 Tokenizer::readIdentifier() [11]
[26] 0.0 0.00 0.00 400817 Lexer::nextChar() [26]
-----------------------------------------------
0.00 0.00 58981/234284 Tokenizer::scope() [4]
0.00 0.00 175303/234284 cmdTokens(CliArgs const&) [2]
[27] 0.0 0.00 0.00 234284 IdentifierToken::~IdentifierToken() [27]
-----------------------------------------------
0.00 0.00 234284/234284 Tokenizer::readIdentifier() [11]
[28] 0.0 0.00 0.00 234284 Lexer::beginPosition() [28]
-----------------------------------------------
0.00 0.00 234284/234284 Tokenizer::readIdentifier() [11]
[29] 0.0 0.00 0.00 234284 Lexer::acceptPosition() [29]
-----------------------------------------------
0.00 0.00 230202/230202 Tokenizer::scope() [4]
[30] 0.0 0.00 0.00 230202 OperatorToken::OperatorToken() [30]
-----------------------------------------------
0.00 0.00 230202/230202 cmdTokens(CliArgs const&) [2]
[31] 0.0 0.00 0.00 230202 OperatorToken::~OperatorToken() [31]
-----------------------------------------------
0.00 0.00 133847/133847 cmdTokens(CliArgs const&) [2]
[32] 0.0 0.00 0.00 133847 NumberToken::~NumberToken() [32]
-----------------------------------------------
0.00 0.00 58981/58981 cmdTokens(CliArgs const&) [2]
[33] 0.0 0.00 0.00 58981 KeywordToken::~KeywordToken() [33]
-----------------------------------------------
0.00 0.00 1/21 readSource[abi:cxx11](CliArgs const&) [46]
0.00 0.00 2/21 cmdTokens(CliArgs const&) [2]
0.00 0.00 4/21 main [1]
0.00 0.00 14/21 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [39]
[34] 0.0 0.00 0.00 21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [34]
-----------------------------------------------
0.00 0.00 2/20 parseArgs(int, char**) [47]
0.00 0.00 18/20 main [1]
[35] 0.0 0.00 0.00 20 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&) [35]
-----------------------------------------------
0.00 0.00 3/19 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [39]
0.00 0.00 4/19 parseArgs(int, char**) [47]
0.00 0.00 5/19 CliCommand::~CliCommand() [38]
0.00 0.00 7/19 main [1]
[36] 0.0 0.00 0.00 19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [36]
-----------------------------------------------
0.00 0.00 1/11 main [1]
0.00 0.00 10/11 parseArgs(int, char**) [47]
[37] 0.0 0.00 0.00 11 bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [37]
-----------------------------------------------
0.00 0.00 9/9 main [1]
[38] 0.0 0.00 0.00 9 CliCommand::~CliCommand() [38]
0.00 0.00 5/19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [36]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [42]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [41]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [40]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [43]
-----------------------------------------------
0.00 0.00 7/7 main [1]
[39] 0.0 0.00 0.00 7 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [39]
0.00 0.00 14/21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [34]
0.00 0.00 3/19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [36]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [41]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [40]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [43]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [42]
-----------------------------------------------
0.00 0.00 1/3 main [1]
0.00 0.00 1/3 CliCommand::~CliCommand() [38]
0.00 0.00 1/3 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [39]
[40] 0.0 0.00 0.00 3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [40]
-----------------------------------------------
0.00 0.00 1/3 main [1]
0.00 0.00 1/3 CliCommand::~CliCommand() [38]
0.00 0.00 1/3 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [39]
[41] 0.0 0.00 0.00 3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [41]
-----------------------------------------------
0.00 0.00 1/3 main [1]
0.00 0.00 1/3 CliCommand::~CliCommand() [38]
0.00 0.00 1/3 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [39]
[42] 0.0 0.00 0.00 3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [42]
-----------------------------------------------
0.00 0.00 1/3 main [1]
0.00 0.00 1/3 CliCommand::~CliCommand() [38]
0.00 0.00 1/3 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [39]
[43] 0.0 0.00 0.00 3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [43]
-----------------------------------------------
0.00 0.00 2/2 __static_initialization_and_destruction_0() [69]
[44] 0.0 0.00 0.00 2 std::_Hashtable<TokenType, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > >, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > >, std::__detail::_Select1st, std::equal_to<TokenType>, std::hash<TokenType>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::_Hashtable<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*>(std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, unsigned long, std::hash<TokenType> const&, std::equal_to<TokenType> const&, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > > const&, std::integral_constant<bool, true>) [44]
-----------------------------------------------
0.00 0.00 2/2 __static_initialization_and_destruction_0() [69]
[45] 0.0 0.00 0.00 2 std::_Hashtable<std::basic_string_view<char, std::char_traits<char> >, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType>, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> >, std::__detail::_Select1st, std::equal_to<std::basic_string_view<char, std::char_traits<char> > >, std::hash<std::basic_string_view<char, std::char_traits<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true> >::_Hashtable<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*>(std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, unsigned long, std::hash<std::basic_string_view<char, std::char_traits<char> > > const&, std::equal_to<std::basic_string_view<char, std::char_traits<char> > > const&, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> > const&, std::integral_constant<bool, true>) [45]
-----------------------------------------------
0.00 0.00 1/1 cmdTokens(CliArgs const&) [2]
[46] 0.0 0.00 0.00 1 readSource[abi:cxx11](CliArgs const&) [46]
0.00 0.00 1/21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [34]
-----------------------------------------------
0.00 0.00 1/1 main [1]
[47] 0.0 0.00 0.00 1 parseArgs(int, char**) [47]
0.00 0.00 10/11 bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [37]
0.00 0.00 4/19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [36]
0.00 0.00 2/20 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&) [35]
-----------------------------------------------
0.00 0.00 1/1 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [50]
[48] 0.0 0.00 0.00 1 SourceFile::computeLineStarts() [48]
-----------------------------------------------
0.00 0.00 1/1 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [50]
[49] 0.0 0.00 0.00 1 SourceFile::setText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [49]
-----------------------------------------------
0.00 0.00 1/1 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
[50] 0.0 0.00 0.00 1 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [50]
0.00 0.00 1/1 SourceFile::computeLineStarts() [48]
0.00 0.00 1/1 SourceFile::setText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [49]
-----------------------------------------------
0.00 0.00 1/1 main [1]
[51] 0.0 0.00 0.00 1 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_invoke(std::_Any_data const&, CliArgs const&) [51]
-----------------------------------------------
This table describes the call tree of the program, and was sorted by
the total amount of time spent in each function and its children.
Each entry in this table consists of several lines. The line with the
index number at the left hand margin lists the current function.
The lines above it list the functions that called this function,
and the lines below it list the functions this one called.
This line lists:
index A unique number given to each element of the table.
Index numbers are sorted numerically.
The index number is printed next to every function name so
it is easier to look up where the function is in the table.
% time This is the percentage of the `total' time that was spent
in this function and its children. Note that due to
different viewpoints, functions excluded by options, etc,
these numbers will NOT add up to 100%.
self This is the total amount of time spent in this function.
children This is the total amount of time propagated into this
function by its children.
called This is the number of times the function was called.
If the function called itself recursively, the number
only includes non-recursive calls, and is followed by
a `+' and the number of recursive calls.
name The name of the current function. The index number is
printed after it. If the function is a member of a
cycle, the cycle number is printed between the
function's name and the index number.
For the function's parents, the fields have the following meanings:
self This is the amount of time that was propagated directly
from the function into this parent.
children This is the amount of time that was propagated from
the function's children into this parent.
called This is the number of times this parent called the
function `/' the total number of times the function
was called. Recursive calls to the function are not
included in the number after the `/'.
name This is the name of the parent. The parent's index
number is printed after it. If the parent is a
member of a cycle, the cycle number is printed between
the name and the index number.
If the parents of the function cannot be determined, the word
`<spontaneous>' is printed in the `name' field, and all the other
fields are blank.
For the function's children, the fields have the following meanings:
self This is the amount of time that was propagated directly
from the child into the function.
children This is the amount of time that was propagated from the
child's children to the function.
called This is the number of times the function called
this child `/' the total number of times the child
was called. Recursive calls by the child are not
listed in the number after the `/'.
name This is the name of the child. The child's index
number is printed after it. If the child is a
member of a cycle, the cycle number is printed
between the name and the index number.
If there are any cycles (circles) in the call graph, there is an
entry for the cycle-as-a-whole. This entry shows who called the
cycle (as parents) and the members of the cycle (as children.)
The `+' recursive calls entry shows the number of function calls that
were internal to the cycle, and the calls entry for each member shows,
for that member, how many times it was called from other members of
the cycle.
Copyright (C) 2012-2026 Free Software Foundation, Inc.
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
Index by function name
[46] readSource[abi:cxx11](CliArgs const&) [28] Lexer::beginPosition() [5] SourceFile::offsetToLocation(int) const
[2] cmdTokens(CliArgs const&) [50] Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [44] std::_Hashtable<TokenType, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > >, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > >, std::__detail::_Select1st, std::equal_to<TokenType>, std::hash<TokenType>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::_Hashtable<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*>(std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, unsigned long, std::hash<TokenType> const&, std::equal_to<TokenType> const&, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > > const&, std::integral_constant<bool, true>)
[47] parseArgs(int, char**) [29] Lexer::acceptPosition() [45] std::_Hashtable<std::basic_string_view<char, std::char_traits<char> >, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType>, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> >, std::__detail::_Select1st, std::equal_to<std::basic_string_view<char, std::char_traits<char> > >, std::hash<std::basic_string_view<char, std::char_traits<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true> >::_Hashtable<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*>(std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, unsigned long, std::hash<std::basic_string_view<char, std::char_traits<char> > > const&, std::equal_to<std::basic_string_view<char, std::char_traits<char> > > const&, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> > const&, std::integral_constant<bool, true>)
[38] CliCommand::~CliCommand() [22] Lexer::skipWhiteSpace() [36] std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
[48] SourceFile::computeLineStarts() [18] Lexer::isEnd() [51] std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_invoke(std::_Any_data const&, CliArgs const&)
[49] SourceFile::setText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [25] Lexer::toChar(int) [40] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) (std_function.h)
[32] NumberToken::~NumberToken() [24] Lexer::getchar(int) [41] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) (std_function.h)
[33] KeywordToken::~KeywordToken() [19] Lexer::getchar() [42] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) (std_function.h)
[30] OperatorToken::OperatorToken() [20] Lexer::include(std::basic_string_view<char, std::char_traits<char> >, bool) [35] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&) (std_function.h)
[31] OperatorToken::~OperatorToken() [26] Lexer::nextChar() [43] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) (std_function.h)
[10] DelimiterToken::DelimiterToken() [21] Lexer::getOffset() [39] std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&)
[9] DelimiterToken::~DelimiterToken() [8] Lexer::isNumeric() [34] void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long)
[27] IdentifierToken::~IdentifierToken() [11] Tokenizer::readIdentifier() [23] std::__detail::_Map_base<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, int>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, int> >, std::__detail::_Select1st, std::equal_to<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::hash<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true>, true>::operator[](std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
[6] Lexer::getLocation() [3] Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [37] bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*)
[7] Lexer::readNumeric() [4] Tokenizer::scope()

View File

@ -1,406 +0,0 @@
Flat profile:
Each sample counts as 0.01 seconds.
% cumulative self self total
time seconds seconds calls ms/call ms/call name
81.25 0.26 0.26 66967977 0.00 0.00 Lexer::include(std::basic_string_view<char, std::char_traits<char> >, bool)
9.38 0.29 0.03 1059636 0.00 0.00 Tokenizer::scope()
6.25 0.31 0.02 _init
3.12 0.32 0.01 1064503 0.00 0.00 SourceFile::offsetToLocation(int) const
0.00 0.32 0.00 2509314 0.00 0.00 Lexer::isEnd()
0.00 0.32 0.00 1851576 0.00 0.00 Lexer::getOffset()
0.00 0.32 0.00 1449678 0.00 0.00 Lexer::getchar()
0.00 0.32 0.00 1059640 0.00 0.00 Lexer::skipWhiteSpace()
0.00 0.32 0.00 1059635 0.00 0.00 Lexer::isNumeric()
0.00 0.32 0.00 750485 0.00 0.00 Lexer::getLocation()
0.00 0.32 0.00 750485 0.00 0.00 Lexer::toChar(int)
0.00 0.32 0.00 461302 0.00 0.00 DelimiterToken::~DelimiterToken()
0.00 0.32 0.00 230202 0.00 0.00 OperatorToken::~OperatorToken()
0.00 0.32 0.00 214740 0.00 0.00 Lexer::nextChar()
0.00 0.32 0.00 175303 0.00 0.00 IdentifierToken::~IdentifierToken()
0.00 0.32 0.00 175303 0.00 0.00 Lexer::beginPosition()
0.00 0.32 0.00 175303 0.00 0.00 Lexer::acceptPosition()
0.00 0.32 0.00 175303 0.00 0.00 Tokenizer::readIdentifier()
0.00 0.32 0.00 133847 0.00 0.00 NumberToken::~NumberToken()
0.00 0.32 0.00 133847 0.00 0.00 Lexer::readNumeric()
0.00 0.32 0.00 58981 0.00 0.00 KeywordToken::~KeywordToken()
0.00 0.32 0.00 58981 0.00 0.00 Lexer::getchar(int)
0.00 0.32 0.00 21 0.00 0.00 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long)
0.00 0.32 0.00 20 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&)
0.00 0.32 0.00 19 0.00 0.00 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.32 0.00 11 0.00 0.00 bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*)
0.00 0.32 0.00 9 0.00 0.00 CliCommand::~CliCommand()
0.00 0.32 0.00 7 0.00 0.00 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&)
0.00 0.32 0.00 3 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.32 0.00 3 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.32 0.00 3 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.32 0.00 3 0.00 0.00 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
0.00 0.32 0.00 2 0.00 0.00 std::_Hashtable<TokenType, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > >, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > >, std::__detail::_Select1st, std::equal_to<TokenType>, std::hash<TokenType>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::_Hashtable<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*>(std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, unsigned long, std::hash<TokenType> const&, std::equal_to<TokenType> const&, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > > const&, std::integral_constant<bool, true>)
0.00 0.32 0.00 2 0.00 0.00 std::_Hashtable<std::basic_string_view<char, std::char_traits<char> >, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType>, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> >, std::__detail::_Select1st, std::equal_to<std::basic_string_view<char, std::char_traits<char> > >, std::hash<std::basic_string_view<char, std::char_traits<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true> >::_Hashtable<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*>(std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, unsigned long, std::hash<std::basic_string_view<char, std::char_traits<char> > > const&, std::equal_to<std::basic_string_view<char, std::char_traits<char> > > const&, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> > const&, std::integral_constant<bool, true>)
0.00 0.32 0.00 1 0.00 0.00 readSource[abi:cxx11](CliArgs const&)
0.00 0.32 0.00 1 0.00 300.00 cmdTokens(CliArgs const&)
0.00 0.32 0.00 1 0.00 0.00 parseArgs(int, char**)
0.00 0.32 0.00 1 0.00 0.00 SourceFile::computeLineStarts()
0.00 0.32 0.00 1 0.00 0.00 SourceFile::setText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
0.00 0.32 0.00 1 0.00 0.00 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
0.00 0.32 0.00 1 0.00 300.00 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >)
0.00 0.32 0.00 1 0.00 0.00 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_invoke(std::_Any_data const&, CliArgs const&)
% the percentage of the total running time of the
time program used by this function.
cumulative a running sum of the number of seconds accounted
seconds for by this function and those listed above it.
self the number of seconds accounted for by this
seconds function alone. This is the major sort for this
listing.
calls the number of times this function was invoked, if
this function is profiled, else blank.
self the average number of milliseconds spent in this
ms/call function per call, if this function is profiled,
else blank.
total the average number of milliseconds spent in this
ms/call function and its descendents per call, if this
function is profiled, else blank.
name the name of the function. This is the minor sort
for this listing. The index shows the location of
the function in the gprof listing. If the index is
in parenthesis it shows where it would appear in
the gprof listing if it were to be printed.
Copyright (C) 2012-2026 Free Software Foundation, Inc.
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
Call graph (explanation follows)
granularity: each sample hit covers 4 byte(s) for 3.12% of 0.32 seconds
index % time self children called name
<spontaneous>
[1] 93.8 0.00 0.30 main [1]
0.00 0.30 1/1 cmdTokens(CliArgs const&) [2]
0.00 0.00 18/20 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&) [33]
0.00 0.00 9/9 CliCommand::~CliCommand() [36]
0.00 0.00 7/19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [34]
0.00 0.00 7/7 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [37]
0.00 0.00 4/21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [32]
0.00 0.00 1/1 parseArgs(int, char**) [45]
0.00 0.00 1/11 bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [35]
0.00 0.00 1/1 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_invoke(std::_Any_data const&, CliArgs const&) [49]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [40]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [39]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [38]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [41]
-----------------------------------------------
0.00 0.30 1/1 main [1]
[2] 93.8 0.00 0.30 1 cmdTokens(CliArgs const&) [2]
0.00 0.30 1/1 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
0.00 0.00 461302/461302 DelimiterToken::~DelimiterToken() [23]
0.00 0.00 230202/230202 OperatorToken::~OperatorToken() [24]
0.00 0.00 175303/175303 IdentifierToken::~IdentifierToken() [26]
0.00 0.00 133847/133847 NumberToken::~NumberToken() [29]
0.00 0.00 58981/58981 KeywordToken::~KeywordToken() [30]
0.00 0.00 2/21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [32]
0.00 0.00 1/1 readSource[abi:cxx11](CliArgs const&) [44]
-----------------------------------------------
0.00 0.30 1/1 cmdTokens(CliArgs const&) [2]
[3] 93.8 0.00 0.30 1 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
0.03 0.27 1059636/1059636 Tokenizer::scope() [4]
0.00 0.00 175303/175303 Tokenizer::readIdentifier() [9]
0.00 0.00 1059635/2509314 Lexer::isEnd() [17]
0.00 0.00 1/1 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [48]
-----------------------------------------------
0.03 0.27 1059636/1059636 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
[4] 93.2 0.03 0.27 1059636 Tokenizer::scope() [4]
0.26 0.00 66967977/66967977 Lexer::include(std::basic_string_view<char, std::char_traits<char> >, bool) [5]
0.00 0.01 750485/750485 Lexer::getLocation() [8]
0.00 0.00 133847/133847 Lexer::readNumeric() [10]
0.00 0.00 1500970/1851576 Lexer::getOffset() [18]
0.00 0.00 1059774/2509314 Lexer::isEnd() [17]
0.00 0.00 1059773/1449678 Lexer::getchar() [19]
0.00 0.00 1059640/1059640 Lexer::skipWhiteSpace() [20]
0.00 0.00 1059635/1059635 Lexer::isNumeric() [21]
0.00 0.00 750485/750485 Lexer::toChar(int) [22]
0.00 0.00 58981/58981 Lexer::getchar(int) [31]
0.00 0.00 138/214740 Lexer::nextChar() [25]
-----------------------------------------------
0.26 0.00 66967977/66967977 Tokenizer::scope() [4]
[5] 81.2 0.26 0.00 66967977 Lexer::include(std::basic_string_view<char, std::char_traits<char> >, bool) [5]
-----------------------------------------------
<spontaneous>
[6] 6.2 0.02 0.00 _init [6]
-----------------------------------------------
0.00 0.00 138715/1064503 Lexer::readNumeric() [10]
0.00 0.00 175303/1064503 Tokenizer::readIdentifier() [9]
0.01 0.00 750485/1064503 Lexer::getLocation() [8]
[7] 3.1 0.01 0.00 1064503 SourceFile::offsetToLocation(int) const [7]
-----------------------------------------------
0.00 0.01 750485/750485 Tokenizer::scope() [4]
[8] 2.2 0.00 0.01 750485 Lexer::getLocation() [8]
0.01 0.00 750485/1064503 SourceFile::offsetToLocation(int) const [7]
-----------------------------------------------
0.00 0.00 175303/175303 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
[9] 0.5 0.00 0.00 175303 Tokenizer::readIdentifier() [9]
0.00 0.00 175303/1064503 SourceFile::offsetToLocation(int) const [7]
0.00 0.00 389905/2509314 Lexer::isEnd() [17]
0.00 0.00 389905/1449678 Lexer::getchar() [19]
0.00 0.00 350606/1851576 Lexer::getOffset() [18]
0.00 0.00 214602/214740 Lexer::nextChar() [25]
0.00 0.00 175303/175303 Lexer::beginPosition() [27]
0.00 0.00 175303/175303 Lexer::acceptPosition() [28]
-----------------------------------------------
0.00 0.00 133847/133847 Tokenizer::scope() [4]
[10] 0.4 0.00 0.00 133847 Lexer::readNumeric() [10]
0.00 0.00 138715/1064503 SourceFile::offsetToLocation(int) const [7]
-----------------------------------------------
0.00 0.00 389905/2509314 Tokenizer::readIdentifier() [9]
0.00 0.00 1059635/2509314 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
0.00 0.00 1059774/2509314 Tokenizer::scope() [4]
[17] 0.0 0.00 0.00 2509314 Lexer::isEnd() [17]
-----------------------------------------------
0.00 0.00 350606/1851576 Tokenizer::readIdentifier() [9]
0.00 0.00 1500970/1851576 Tokenizer::scope() [4]
[18] 0.0 0.00 0.00 1851576 Lexer::getOffset() [18]
-----------------------------------------------
0.00 0.00 389905/1449678 Tokenizer::readIdentifier() [9]
0.00 0.00 1059773/1449678 Tokenizer::scope() [4]
[19] 0.0 0.00 0.00 1449678 Lexer::getchar() [19]
-----------------------------------------------
0.00 0.00 1059640/1059640 Tokenizer::scope() [4]
[20] 0.0 0.00 0.00 1059640 Lexer::skipWhiteSpace() [20]
-----------------------------------------------
0.00 0.00 1059635/1059635 Tokenizer::scope() [4]
[21] 0.0 0.00 0.00 1059635 Lexer::isNumeric() [21]
-----------------------------------------------
0.00 0.00 750485/750485 Tokenizer::scope() [4]
[22] 0.0 0.00 0.00 750485 Lexer::toChar(int) [22]
-----------------------------------------------
0.00 0.00 461302/461302 cmdTokens(CliArgs const&) [2]
[23] 0.0 0.00 0.00 461302 DelimiterToken::~DelimiterToken() [23]
-----------------------------------------------
0.00 0.00 230202/230202 cmdTokens(CliArgs const&) [2]
[24] 0.0 0.00 0.00 230202 OperatorToken::~OperatorToken() [24]
-----------------------------------------------
0.00 0.00 138/214740 Tokenizer::scope() [4]
0.00 0.00 214602/214740 Tokenizer::readIdentifier() [9]
[25] 0.0 0.00 0.00 214740 Lexer::nextChar() [25]
-----------------------------------------------
0.00 0.00 175303/175303 cmdTokens(CliArgs const&) [2]
[26] 0.0 0.00 0.00 175303 IdentifierToken::~IdentifierToken() [26]
-----------------------------------------------
0.00 0.00 175303/175303 Tokenizer::readIdentifier() [9]
[27] 0.0 0.00 0.00 175303 Lexer::beginPosition() [27]
-----------------------------------------------
0.00 0.00 175303/175303 Tokenizer::readIdentifier() [9]
[28] 0.0 0.00 0.00 175303 Lexer::acceptPosition() [28]
-----------------------------------------------
0.00 0.00 133847/133847 cmdTokens(CliArgs const&) [2]
[29] 0.0 0.00 0.00 133847 NumberToken::~NumberToken() [29]
-----------------------------------------------
0.00 0.00 58981/58981 cmdTokens(CliArgs const&) [2]
[30] 0.0 0.00 0.00 58981 KeywordToken::~KeywordToken() [30]
-----------------------------------------------
0.00 0.00 58981/58981 Tokenizer::scope() [4]
[31] 0.0 0.00 0.00 58981 Lexer::getchar(int) [31]
-----------------------------------------------
0.00 0.00 1/21 readSource[abi:cxx11](CliArgs const&) [44]
0.00 0.00 2/21 cmdTokens(CliArgs const&) [2]
0.00 0.00 4/21 main [1]
0.00 0.00 14/21 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [37]
[32] 0.0 0.00 0.00 21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [32]
-----------------------------------------------
0.00 0.00 2/20 parseArgs(int, char**) [45]
0.00 0.00 18/20 main [1]
[33] 0.0 0.00 0.00 20 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&) [33]
-----------------------------------------------
0.00 0.00 3/19 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [37]
0.00 0.00 4/19 parseArgs(int, char**) [45]
0.00 0.00 5/19 CliCommand::~CliCommand() [36]
0.00 0.00 7/19 main [1]
[34] 0.0 0.00 0.00 19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [34]
-----------------------------------------------
0.00 0.00 1/11 main [1]
0.00 0.00 10/11 parseArgs(int, char**) [45]
[35] 0.0 0.00 0.00 11 bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [35]
-----------------------------------------------
0.00 0.00 9/9 main [1]
[36] 0.0 0.00 0.00 9 CliCommand::~CliCommand() [36]
0.00 0.00 5/19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [34]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [40]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [39]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [38]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [41]
-----------------------------------------------
0.00 0.00 7/7 main [1]
[37] 0.0 0.00 0.00 7 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [37]
0.00 0.00 14/21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [32]
0.00 0.00 3/19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [34]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [39]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [38]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [41]
0.00 0.00 1/3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [40]
-----------------------------------------------
0.00 0.00 1/3 main [1]
0.00 0.00 1/3 CliCommand::~CliCommand() [36]
0.00 0.00 1/3 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [37]
[38] 0.0 0.00 0.00 3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [38]
-----------------------------------------------
0.00 0.00 1/3 main [1]
0.00 0.00 1/3 CliCommand::~CliCommand() [36]
0.00 0.00 1/3 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [37]
[39] 0.0 0.00 0.00 3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [39]
-----------------------------------------------
0.00 0.00 1/3 main [1]
0.00 0.00 1/3 CliCommand::~CliCommand() [36]
0.00 0.00 1/3 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [37]
[40] 0.0 0.00 0.00 3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [40]
-----------------------------------------------
0.00 0.00 1/3 main [1]
0.00 0.00 1/3 CliCommand::~CliCommand() [36]
0.00 0.00 1/3 std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&) [37]
[41] 0.0 0.00 0.00 3 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [41]
-----------------------------------------------
0.00 0.00 2/2 __static_initialization_and_destruction_0() [66]
[42] 0.0 0.00 0.00 2 std::_Hashtable<TokenType, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > >, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > >, std::__detail::_Select1st, std::equal_to<TokenType>, std::hash<TokenType>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::_Hashtable<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*>(std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, unsigned long, std::hash<TokenType> const&, std::equal_to<TokenType> const&, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > > const&, std::integral_constant<bool, true>) [42]
-----------------------------------------------
0.00 0.00 2/2 __static_initialization_and_destruction_0() [66]
[43] 0.0 0.00 0.00 2 std::_Hashtable<std::basic_string_view<char, std::char_traits<char> >, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType>, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> >, std::__detail::_Select1st, std::equal_to<std::basic_string_view<char, std::char_traits<char> > >, std::hash<std::basic_string_view<char, std::char_traits<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true> >::_Hashtable<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*>(std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, unsigned long, std::hash<std::basic_string_view<char, std::char_traits<char> > > const&, std::equal_to<std::basic_string_view<char, std::char_traits<char> > > const&, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> > const&, std::integral_constant<bool, true>) [43]
-----------------------------------------------
0.00 0.00 1/1 cmdTokens(CliArgs const&) [2]
[44] 0.0 0.00 0.00 1 readSource[abi:cxx11](CliArgs const&) [44]
0.00 0.00 1/21 void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long) [32]
-----------------------------------------------
0.00 0.00 1/1 main [1]
[45] 0.0 0.00 0.00 1 parseArgs(int, char**) [45]
0.00 0.00 10/11 bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*) [35]
0.00 0.00 4/19 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) [34]
0.00 0.00 2/20 std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&) [33]
-----------------------------------------------
0.00 0.00 1/1 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [48]
[46] 0.0 0.00 0.00 1 SourceFile::computeLineStarts() [46]
-----------------------------------------------
0.00 0.00 1/1 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [48]
[47] 0.0 0.00 0.00 1 SourceFile::setText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [47]
-----------------------------------------------
0.00 0.00 1/1 Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [3]
[48] 0.0 0.00 0.00 1 Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [48]
0.00 0.00 1/1 SourceFile::computeLineStarts() [46]
0.00 0.00 1/1 SourceFile::setText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [47]
-----------------------------------------------
0.00 0.00 1/1 main [1]
[49] 0.0 0.00 0.00 1 std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_invoke(std::_Any_data const&, CliArgs const&) [49]
-----------------------------------------------
This table describes the call tree of the program, and was sorted by
the total amount of time spent in each function and its children.
Each entry in this table consists of several lines. The line with the
index number at the left hand margin lists the current function.
The lines above it list the functions that called this function,
and the lines below it list the functions this one called.
This line lists:
index A unique number given to each element of the table.
Index numbers are sorted numerically.
The index number is printed next to every function name so
it is easier to look up where the function is in the table.
% time This is the percentage of the `total' time that was spent
in this function and its children. Note that due to
different viewpoints, functions excluded by options, etc,
these numbers will NOT add up to 100%.
self This is the total amount of time spent in this function.
children This is the total amount of time propagated into this
function by its children.
called This is the number of times the function was called.
If the function called itself recursively, the number
only includes non-recursive calls, and is followed by
a `+' and the number of recursive calls.
name The name of the current function. The index number is
printed after it. If the function is a member of a
cycle, the cycle number is printed between the
function's name and the index number.
For the function's parents, the fields have the following meanings:
self This is the amount of time that was propagated directly
from the function into this parent.
children This is the amount of time that was propagated from
the function's children into this parent.
called This is the number of times this parent called the
function `/' the total number of times the function
was called. Recursive calls to the function are not
included in the number after the `/'.
name This is the name of the parent. The parent's index
number is printed after it. If the parent is a
member of a cycle, the cycle number is printed between
the name and the index number.
If the parents of the function cannot be determined, the word
`<spontaneous>' is printed in the `name' field, and all the other
fields are blank.
For the function's children, the fields have the following meanings:
self This is the amount of time that was propagated directly
from the child into the function.
children This is the amount of time that was propagated from the
child's children to the function.
called This is the number of times the function called
this child `/' the total number of times the child
was called. Recursive calls by the child are not
listed in the number after the `/'.
name This is the name of the child. The child's index
number is printed after it. If the child is a
member of a cycle, the cycle number is printed
between the name and the index number.
If there are any cycles (circles) in the call graph, there is an
entry for the cycle-as-a-whole. This entry shows who called the
cycle (as parents) and the members of the cycle (as children.)
The `+' recursive calls entry shows the number of function calls that
were internal to the cycle, and the calls entry for each member shows,
for that member, how many times it was called from other members of
the cycle.
Copyright (C) 2012-2026 Free Software Foundation, Inc.
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
Index by function name
[44] readSource[abi:cxx11](CliArgs const&) [48] Lexer::setSourceText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [7] SourceFile::offsetToLocation(int) const
[2] cmdTokens(CliArgs const&) [28] Lexer::acceptPosition() [42] std::_Hashtable<TokenType, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > >, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > >, std::__detail::_Select1st, std::equal_to<TokenType>, std::hash<TokenType>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::_Hashtable<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*>(std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > const*, unsigned long, std::hash<TokenType> const&, std::equal_to<TokenType> const&, std::allocator<std::pair<TokenType const, std::basic_string_view<char, std::char_traits<char> > > > const&, std::integral_constant<bool, true>)
[45] parseArgs(int, char**) [20] Lexer::skipWhiteSpace() [43] std::_Hashtable<std::basic_string_view<char, std::char_traits<char> >, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType>, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> >, std::__detail::_Select1st, std::equal_to<std::basic_string_view<char, std::char_traits<char> > >, std::hash<std::basic_string_view<char, std::char_traits<char> > >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true> >::_Hashtable<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*>(std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> const*, unsigned long, std::hash<std::basic_string_view<char, std::char_traits<char> > > const&, std::equal_to<std::basic_string_view<char, std::char_traits<char> > > const&, std::allocator<std::pair<std::basic_string_view<char, std::char_traits<char> > const, TokenType> > const&, std::integral_constant<bool, true>)
[36] CliCommand::~CliCommand() [17] Lexer::isEnd() [34] std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation)
[46] SourceFile::computeLineStarts() [22] Lexer::toChar(int) [49] std::_Function_handler<int (CliArgs const&), int (*)(CliArgs const&)>::_M_invoke(std::_Any_data const&, CliArgs const&)
[47] SourceFile::setText(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [31] Lexer::getchar(int) [38] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#2}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) (std_function.h)
[29] NumberToken::~NumberToken() [19] Lexer::getchar() [39] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#3}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) (std_function.h)
[30] KeywordToken::~KeywordToken() [5] Lexer::include(std::basic_string_view<char, std::char_traits<char> >, bool) [40] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) (std_function.h)
[24] OperatorToken::~OperatorToken() [25] Lexer::nextChar() [33] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#4}>::_M_invoke(std::_Any_data const&, CliArgs const&) (std_function.h)
[23] DelimiterToken::~DelimiterToken() [18] Lexer::getOffset() [41] std::_Function_handler<int (CliArgs const&), main::{lambda(CliArgs const&)#1}>::_M_manager(std::_Any_data&, std::_Any_data const&, std::_Manager_operation) (std_function.h)
[26] IdentifierToken::~IdentifierToken() [21] Lexer::isNumeric() [37] std::vector<CliCommand, std::allocator<CliCommand> >::push_back(CliCommand const&)
[8] Lexer::getLocation() [9] Tokenizer::readIdentifier() [32] void std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_construct<true>(char const*, unsigned long)
[10] Lexer::readNumeric() [3] Tokenizer::scan(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) [35] bool std::operator==<char, std::char_traits<char>, std::allocator<char> >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, char const*)
[27] Lexer::beginPosition() [4] Tokenizer::scope() [6] _init

File diff suppressed because it is too large Load Diff

View File

@ -1,5 +0,0 @@
int main() {
print("Merhaba");
print("saQut calisiyor");
return 0;
}

View File

@ -1,15 +0,0 @@
// Ölü kod eleme örneği
// saqut ast file:examples/opt_dce.sqt --optimized
// Beklenen: return sonrasındaki deyimler silinir.
int foo() {
return 42;
int unreachable = 1;
int also_dead = 2;
}
int main() {
int x = foo();
return x;
print("Bu satır asla çalışmaz");
}

View File

@ -1,11 +0,0 @@
// Sabit katlama örneği
// saqut ast file:examples/opt_folding.sqt --optimized
// Beklenen: tüm BinaryExpression'lar Literal'e dönüşür.
int main() {
int a = 2 + 3;
int b = 10 * 4;
int c = 100 / 5;
int d = a + 1;
return 1 * 10 + 2 * 5;
}

View File

@ -1,9 +0,0 @@
// E008 — yanlış argüman sayısı
int add(int a, int b) {
return a + b;
}
int main() {
int x = add(1, 2, 3);
return 0;
}

View File

@ -1,8 +0,0 @@
// E003 — return tipi uyuşmazlığı
int foo() {
return 1.5;
}
int main() {
return 0;
}

View File

@ -1,5 +0,0 @@
// E004 — break döngü dışında
int main() {
break;
return 0;
}

View File

@ -1,5 +0,0 @@
// E003 — daraltma: float literal → int
int main() {
int x = 1.5;
return 0;
}

View File

@ -1,7 +0,0 @@
// W004 — örtük genişletme: değişken→değişken int→float
int main() {
int a = 5;
float b = 1; // OK: literal bağlama-göre tiplenir, uyarısız
float c = a; // W004: int değişken → float değişken
return 0;
}

View File

@ -1,12 +0,0 @@
// E010 — döngüsel struct (by-value çevrim → sonsuz boyut)
struct A {
B b;
}
struct B {
A a;
}
int main() {
return 0;
}

View File

@ -1,6 +0,0 @@
// E002 — aynı scope'ta çift tanım
int main() {
int x = 1;
int x = 2;
return 0;
}

View File

@ -1,5 +0,0 @@
// E001 — tanımsız isim
int main() {
int x = y + 1;
return 0;
}

View File

@ -92,46 +92,6 @@ VM)** ile çalıştırır.
---
## Tasarım felsefesi — neden saQut farklı?
saQut "daha iyi bir dil" iddiasında değil. Farkı, **derleyiciyi bir platform**
olarak ele almasında. İki taahhüt üstüne kuruludur:
**1. Cam (gör + sorgula + içine müdahale et).** Her aşama — token, AST, sembol
tablosu, tip, IR — kararlı, makine-okur ve **çift yönlü** bir arayüzden
erişilebilir olmalıdır. Sadece "dök ve göster" değil: kendi AST'ini verip tip
kontrolü isteyebilmeli, IR verip çalıştırabilmelisin. **Turnusol testi:** bir
yabancı, yalnızca `saqut ast` + `saqut symbols` çıktısından, bizden habersiz bir
LSP yazabiliyor mu? Cevap "evet" ise platform gerçektir.
**2. Kafes (deterministik + yetenek-güvenli çalıştırma).** Pointer yok, value
semantics, scope-tabanlı bellek ve **tek dış-dünya kapısı olan FFI seam**
(ADR-016) sayesinde saQut kodu, host'un açıkça izin verdiği fonksiyonlar dışında
dünyaya dokunamaz. Bytecode VM deterministiktir (ADR-015): aynı girdi → aynı
çıktı → aynı çalışma. "Sadelik" diye tasarlanan bu kararlar aslında bir
**yetenek-güvenliği (capability sandbox)** kurar — güvenilmeyen veya
AI-üretimi kodu güvenle çalıştırmak için biçilmiş kaftan.
**Bu ikisinin ödülü — kayıt & tekrar (record-replay).** 🚧 *(vizyon, v0 değil;
bkz. issue #94.)* Belirsizliğin tek kaynağı (kullanıcı girdisi, zaman, IO,
GC/thread kararları) FFI kapısından geçtiği için, mükemmel tekrar oynatma için
**her değişkeni her adımda kaydetmek gerekmez** — yalnızca kapıdan geçen değerler
kaydedilir, gerisi VM deterministik olarak yeniden çalıştırılarak üretilir. Boyut
gigabayttan kilobayta düşer. Replay modunda FFI çağrıları gerçekten çalışmaz,
kaydedilmiş değeri döndürür (dosyayı tekrar silmez, sunucuya tekrar istek atmaz).
Böylece "benim makinemde çalışıyor, müşteride patlıyor" sorunu: müşteri bir dump
yollar, sen çöküşü adım adım, aynı verilerle geri sararsın.
> Log, önceden sormayı akıl ettiğin sorulara cevap verir; **tekrar-oynatma,
> çöküşten *sonra* aklına gelen sorulara.** Zaman-yolculuğu hata ayıklama ayrı
> bir altyapı değildir — cam sorgularına bir **zaman koordinatı** eklemektir.
⚠️ Bu ödülün bedeli v0'da ödenir: **determinizm kutsaldır ve her belirsizlik
kaynağı kayıt-altına-alınabilir tek kapıdan geçmelidir.** Sonradan eklenemez;
baştan korunur.
---
## Mimari hatlar
```

View File

@ -1,153 +0,0 @@
"""
saQut büyük kaynak dosyası üretici.
Sözdizimsel ve semantik olarak geçerli, çeşitli yapılar içeren
gerçekçi bir .sqt dosyası üretir.
Hedef: ~1 MB
"""
import sys
import random
random.seed(42)
lines = []
def emit(s=""):
lines.append(s)
# ── Başlık ────────────────────────────────────────────────────────────────────
emit("// saQut büyük kaynak dosyası — otomatik üretildi (gen_large.py)")
emit("// Amaç: ast / symbols / check komutları için performans ölçümü")
emit()
# ── Struct tanımları ──────────────────────────────────────────────────────────
STRUCT_COUNT = 20
for i in range(STRUCT_COUNT):
emit(f"struct Vec{i} {{")
emit(f" int x;")
emit(f" int y;")
emit(f" int z;")
emit(f" float w;")
emit(f"}}")
emit()
# ── Global değişkenler ────────────────────────────────────────────────────────
for i in range(50):
emit(f"int g_{i} = {i * 3 + 1};")
emit()
# ── Yardımcı: rastgele aritmetik ifade (derinlik sınırlı) ─────────────────────
def expr(depth=0, vars=None):
if vars is None:
vars = ["a", "b", "c", "x", "n"]
if depth >= 3 or random.random() < 0.35:
choice = random.random()
if choice < 0.5 and vars:
return random.choice(vars)
elif choice < 0.8:
return str(random.randint(1, 100))
else:
return str(random.randint(1, 20))
ops = ["+", "-", "*"]
op = random.choice(ops)
return f"({expr(depth+1, vars)} {op} {expr(depth+1, vars)})"
def cond(vars=None):
if vars is None:
vars = ["a", "b", "n"]
ops = ["<", ">", "<=", ">=", "==", "!="]
op = random.choice(ops)
lhs = expr(0, vars)
rhs = expr(0, vars)
return f"{lhs} {op} {rhs}"
# ── Fonksiyon gövdesi üreteci ─────────────────────────────────────────────────
def gen_body(fn_idx, local_vars, indent=1):
pad = " " * indent
code = []
# 2-5 lokal değişken tanımı — sadece declare edilenleri ifadelerde kullan
n_vars = random.randint(2, 5)
declared = []
for v in local_vars[:n_vars]:
# İlk değişken sadece sabitle başlatılır (henüz başka değişken yok)
init = expr(0, declared if declared else ["1"])
code.append(f"{pad}int {v} = {init};")
declared.append(v)
local_vars = declared # bundan sonra sadece declare edilenleri kullan
# 1-3 if bloğu
for _ in range(random.randint(1, 3)):
c = cond(local_vars)
then_val = expr(0, local_vars)
code.append(f"{pad}if ({c}) {{")
code.append(f"{pad} {local_vars[0]} = {then_val};")
if random.random() < 0.4:
else_val = expr(0, local_vars)
code.append(f"{pad}}} else {{")
code.append(f"{pad} {local_vars[0]} = {else_val};")
code.append(f"{pad}}}")
# 0-2 for döngüsü
for _ in range(random.randint(0, 2)):
bound = random.randint(3, 15)
inner = expr(0, local_vars)
code.append(f"{pad}for (int i = 0; i < {bound}; i = i + 1) {{")
code.append(f"{pad} {local_vars[0]} = {local_vars[0]} + {inner};")
code.append(f"{pad}}}")
# return
ret_val = expr(0, local_vars)
code.append(f"{pad}return {ret_val};")
return code
# ── Fonksiyon tanımları ───────────────────────────────────────────────────────
# Toplam ~5000 fonksiyon → ~1 MB hedef
FUNC_COUNT = 5000
func_names = [f"fn_{i:04d}" for i in range(FUNC_COUNT)]
func_params = {} # fname → n_params (çağrı sırasında eşleştirmek için)
for i, fname in enumerate(func_names):
# Parametre listesi (0-3 parametre)
n_params = random.randint(0, 3)
func_params[fname] = n_params
params = [f"int p{j}" for j in range(n_params)]
param_str = ", ".join(params)
# Lokal değişken adları
local_vars = ["a", "b", "c", "d", "e",
f"v{i % 10}", f"w{i % 7}"]
emit(f"int {fname}({param_str}) {{")
for line in gen_body(i, local_vars):
emit(line)
emit("}")
emit()
# ── Main ──────────────────────────────────────────────────────────────────────
emit("int main() {")
emit(" int result = 0;")
emit()
# Her 50 fonksiyonu bir kere çağır — argüman sayısı imzayla eşleştirildi
for i in range(0, FUNC_COUNT, 50):
fname = func_names[i]
n_params = func_params[fname]
args = ", ".join(str(random.randint(1, 20)) for _ in range(n_params))
emit(f" result = result + {fname}({args});")
emit()
emit(" print(result);")
emit(" return 0;")
emit("}")
# ── Yaz ───────────────────────────────────────────────────────────────────────
output = "\n".join(lines) + "\n"
path = sys.argv[1] if len(sys.argv) > 1 else "examples/large.sqt"
with open(path, "w", encoding="utf-8") as f:
f.write(output)
size_kb = len(output.encode("utf-8")) / 1024
print(f"Üretildi: {path} ({size_kb:.1f} KB, {len(lines)} satır)")

View File

@ -32,8 +32,6 @@ struct CliArgs {
std::string format;
bool showHelp = false;
bool stdinMode = false;
bool compact = false; // --compact: boşluksuz JSON
bool optimized = false; // --optimized: sabit katlama + ölü kod eleme
};
// ============================================================================
@ -69,14 +67,6 @@ inline CliArgs parseArgs(int argc, char* argv[]) {
if (i + 1 < argc) args.format = argv[++i];
continue;
}
if (arg == "--compact") {
args.compact = true;
continue;
}
if (arg == "--optimized") {
args.optimized = true;
continue;
}
if (arg.compare(0, 5, "file:") == 0) {
args.positional.push_back(arg.substr(5));
continue;
@ -93,9 +83,8 @@ inline CliArgs parseArgs(int argc, char* argv[]) {
// İlk argüman komut mu?
if (args.command.empty() && i == 1) {
if (arg == "run" || arg == "tokens" || arg == "ast" ||
arg == "symbols" || arg == "check" || arg == "ir" ||
arg == "compile" || arg == "parse" || arg == "transpile" ||
arg == "interpret") {
arg == "symbols" || arg == "compile" || arg == "parse" ||
arg == "transpile" || arg == "interpret") {
args.command = arg;
continue;
}

View File

@ -1,8 +1,5 @@
// ============================================================================
// saQut CLI — ast komutu (JSON formatında AST hiyerarşisi + analiz)
//
// --optimized: sabit katlama + ölü kod eleme uygulandıktan sonra AST göster.
// Orijinal AST dokunulmaz; optimize edilmiş klon gösterilir.
// ============================================================================
#ifndef SAQUT_CLI_AST
@ -13,13 +10,6 @@
#include "cli/args.hpp"
#include "tokenizer/tokenizer.hpp"
#include "parser/parser.hpp"
#include "symbol/symbol_table.hpp"
#include "symbol/symbol_collector.hpp"
#include "semantic/type_checker.hpp"
#include "semantic/structural_validator.hpp"
#include "diagnostic/diagnostic_engine.hpp"
#include "core/config.hpp"
#include "opt/optimization_manager.hpp"
#include "json.hpp"
inline int cmdAst(const CliArgs& args) {
@ -38,25 +28,9 @@ inline int cmdAst(const CliArgs& args) {
return 1;
}
// ── Sembol + tip analizi (--optimized için gerekli; yalın ast'te opsiyonel) ──
SymbolTable symbolTable;
DiagnosticEngine diag;
SymbolCollector(symbolTable, diag).collect(ast);
TypeChecker(symbolTable, diag).check(ast);
StructuralValidator(diag).validate(ast);
ASTNode* displayAst = ast; // gösterilecek ağaç (orijinal veya klon)
ASTNode* clonedAst = nullptr;
if (args.optimized) {
CompilerConfig cfg;
OptimizationManager mgr(cfg, diag);
clonedAst = mgr.optimize(ast, &symbolTable);
displayAst = clonedAst;
}
AstAnalysis analysis = analyzeAst(displayAst);
AstAnalysis analysis = analyzeAst(ast);
// Çıktı hedefi
std::ostream* out = &std::cout;
std::ofstream outFile;
if (!args.outputFile.empty()) {
@ -66,16 +40,12 @@ inline int cmdAst(const CliArgs& args) {
*out << "{\n"
<< " \"ast\":\n"
<< jsonIndent(2) << astToJson(displayAst, 2) << ",\n"
<< jsonIndent(2) << astToJson(ast, 2) << ",\n"
<< " \"analysis\": {\n"
<< analysisToJson(analysis) << "\n"
<< " }\n"
<< "}\n";
// Optimizasyon uyarılarını (W002 vb.) stderr'e yazdır
if (args.optimized) diag.printAll(std::cerr);
if (clonedAst) delete clonedAst;
delete ast;
for (auto* t : tokens) delete t;
return 0;

View File

@ -1,59 +0,0 @@
#ifndef SAQUT_CLI_CHECK
#define SAQUT_CLI_CHECK
#include <iostream>
#include "cli/args.hpp"
#include "tokenizer/tokenizer.hpp"
#include "parser/parser.hpp"
#include "symbol/symbol_table.hpp"
#include "symbol/symbol_collector.hpp"
#include "semantic/type_checker.hpp"
#include "semantic/structural_validator.hpp"
#include "diagnostic/diagnostic_engine.hpp"
#include "vendor/nlohmann/json.hpp"
inline int cmdCheck(const CliArgs& args) {
std::string filePath = inputFilePath(args);
std::string source = readSource(args);
if (source.empty()) return 1;
Tokenizer tokenizer;
auto tokens = tokenizer.scan(source, filePath);
Parser parser;
ASTNode* ast = parser.parse(tokens);
DiagnosticEngine diag;
if (!ast) {
diag.report("E000", SourceLocation{}, "AST üretilemedi");
nlohmann::json out;
out["file"] = filePath;
out["diagnostics"] = diag.toJsonObj();
std::cout << (args.compact ? out.dump() : out.dump(2)) << "\n";
for (auto* t : tokens) delete t;
return 1;
}
SymbolTable table;
SymbolCollector(table, diag).collect(ast);
// Sembol toplama hataları varsa tip denetimine geçme
// (çözümsüz semboller tip denetiminde sahte E003 üretir)
if (!diag.hasErrors()) {
TypeChecker(table, diag).check(ast);
StructuralValidator(diag).validate(ast);
}
nlohmann::json out;
out["file"] = filePath;
out["diagnostics"] = diag.toJsonObj();
std::cout << (args.compact ? out.dump() : out.dump(2)) << "\n";
delete ast;
for (auto* t : tokens) delete t;
return diag.hasErrors() ? 1 : 0;
}
#endif // SAQUT_CLI_CHECK

View File

@ -1,50 +0,0 @@
#ifndef SAQUT_CLI_IR
#define SAQUT_CLI_IR
#include <iostream>
#include "cli/args.hpp"
#include "tokenizer/tokenizer.hpp"
#include "parser/parser.hpp"
#include "symbol/symbol_table.hpp"
#include "symbol/symbol_collector.hpp"
#include "diagnostic/diagnostic_engine.hpp"
#include "ir/ir_generator.hpp"
inline int cmdIr(const CliArgs& args) {
std::string filePath = inputFilePath(args);
std::string source = readSource(args);
if (source.empty()) return 1;
Tokenizer tokenizer;
auto tokens = tokenizer.scan(source, filePath);
Parser parser;
ASTNode* ast = parser.parse(tokens);
if (!ast) {
std::cerr << "Hata: AST üretilemedi\n";
for (auto* t : tokens) delete t;
return 1;
}
SymbolTable symbolTable;
DiagnosticEngine diag;
SymbolCollector(symbolTable, diag).collect(ast);
if (diag.hasErrors()) {
diag.printAll(std::cerr);
delete ast;
for (auto* t : tokens) delete t;
return 1;
}
IRGenerator irGenerator;
IRProgram program = irGenerator.generate(ast, symbolTable);
program.dump();
delete ast;
for (auto* t : tokens) delete t;
return 0;
}
#endif // SAQUT_CLI_IR

View File

@ -1,13 +1,10 @@
// ============================================================================
// saQut CLI — run komutu
// saQut CLI — run komutu (pipeline: token → AST → IR debug)
// ============================================================================
//
// Tam derleme + çalıştırma pipeline'ı:
// tokenize → parse → sembol topla → IR üret → VM çalıştır
// TODO: İleride `saqut -` ile stdin'den okuyup anında çalıştıracak
// interpreter modu bu komutun altına gelecek.
//
// Başarı kriteri:
// build/saqut run file:examples/fibonacci.sqt
// → 55
// → 55
// ============================================================================
#ifndef SAQUT_CLI_RUN
@ -17,65 +14,53 @@
#include "cli/args.hpp"
#include "tokenizer/tokenizer.hpp"
#include "parser/parser.hpp"
#include "symbol/symbol_table.hpp"
#include "symbol/symbol_collector.hpp"
#include "semantic/type_checker.hpp"
#include "semantic/structural_validator.hpp"
#include "diagnostic/diagnostic_engine.hpp"
#include "ir/ir_generator.hpp"
#include "vm/interpreter.hpp"
#include "ir/ir.hpp"
inline int cmdRun(const CliArgs& args) {
std::string filePath = inputFilePath(args);
std::string source = readSource(args);
std::string source = readSource(args);
if (source.empty()) return 1;
// ── Aşama 1: Tokenize ────────────────────────────────────────────────
Tokenizer tokenizer;
auto tokens = tokenizer.scan(source, filePath);
auto tokens = tokenizer.scan(source, inputFilePath(args));
std::cout << "=== saQut Compiler ===\n";
std::cout << "Kaynak kod:\n" << source << "\n\n";
std::cout << "Tokenler (" << tokens.size() << " adet):\n";
for (auto* t : tokens) {
std::cout << " [" << t->gettype() << "] \"" << t->token << "\"\n";
}
std::cout << "\n";
// ── Aşama 2: Parse ───────────────────────────────────────────────────
Parser parser;
ASTNode* ast = parser.parse(tokens);
if (!ast) {
std::cerr << "Hata: AST üretilemedi\n";
for (auto* t : tokens) delete t;
return 1;
}
// ── Aşama 3: Sembol toplama ───────────────────────────────────────────
// Identifier'ların resolvedSymbol'ü doldurulur — IR generator buna ihtiyaç duyar.
SymbolTable symbolTable;
DiagnosticEngine diag;
SymbolCollector(symbolTable, diag).collect(ast);
TypeChecker(symbolTable, diag).check(ast);
StructuralValidator(diag).validate(ast);
if (ast) {
std::cout << "AST:\n";
ast->log(0);
std::cout << "\n";
CodeGenerator cg;
cg.parse(ast);
std::cout << "IR (" << cg.IROpDatas.size() << " komut):\n";
for (size_t i = 0; i < cg.IROpDatas.size(); i++) {
auto& op = cg.IROpDatas[i];
std::cout << " [" << i << "] reg" << op.targetReg << " = ";
switch (op.op) {
case OPCode::mathadd: std::cout << "add"; break;
case OPCode::mathsub: std::cout << "sub"; break;
case OPCode::mathmul: std::cout << "mul"; break;
case OPCode::mathdiv: std::cout << "div"; break;
case OPCode::declare: std::cout << "literal"; break;
}
std::cout << " (" << op.arg1.value.index() << ")\n";
}
if (diag.hasErrors()) {
std::cerr << "Derleme hataları var, program çalıştırılamaz:\n";
diag.printAll(std::cerr);
delete ast;
for (auto* t : tokens) delete t;
return 1;
}
// ── Aşama 4: IR üretimi ───────────────────────────────────────────────
IRGenerator irGenerator;
IRProgram program = irGenerator.generate(ast, symbolTable);
// ── Aşama 5: VM çalıştırma ────────────────────────────────────────────
int exitCode = 0;
try {
Interpreter vm(program);
exitCode = vm.run();
} catch (const std::exception& e) {
std::cerr << "Çalışma zamanı hatası: " << e.what() << "\n";
exitCode = 1;
}
delete ast;
for (auto* t : tokens) delete t;
return exitCode;
return 0;
}
#endif // SAQUT_CLI_RUN

View File

@ -1,5 +1,5 @@
// ============================================================================
// saQut CLI — symbols komutu (sembol tablosu — JSON çıktı, Faz 2)
// saQut CLI — symbols komutu (sembol tablosu)
// ============================================================================
#ifndef SAQUT_CLI_SYMBOLS
@ -9,62 +9,50 @@
#include "cli/args.hpp"
#include "tokenizer/tokenizer.hpp"
#include "parser/parser.hpp"
#include "symbol/symbol_table.hpp"
#include "symbol/symbol_collector.hpp"
#include "diagnostic/diagnostic_engine.hpp"
#include "vendor/nlohmann/json.hpp"
#include "json.hpp"
inline int cmdSymbols(const CliArgs& args) {
std::string filePath = inputFilePath(args);
std::string source = readSource(args);
std::string source = readSource(args);
if (source.empty()) return 1;
Tokenizer tokenizer;
auto tokens = tokenizer.scan(source, filePath);
auto tokens = tokenizer.scan(source, inputFilePath(args));
Parser parser;
ASTNode* ast = parser.parse(tokens);
SymbolTable table;
DiagnosticEngine diag;
if (ast) {
SymbolCollector(table, diag).collect(ast);
} else {
diag.report("E000", SourceLocation{}, "AST üretilemedi");
if (!ast) {
std::cerr << "Hata: AST üretilemedi\n";
for (auto* t : tokens) delete t;
return 1;
}
// ── JSON çıktı ──────────────────────────────────────────────────────────
nlohmann::json out;
out["file"] = filePath;
auto symbols = collectSymbols(ast);
nlohmann::json symArray = nlohmann::json::array();
for (Symbol* s : table.allSymbols()) {
if (s->isBuiltin) continue;
std::cout << "Sembol Tablosu (" << symbols.size() << " sembol):\n";
std::cout << "────────────────────────────────────────────\n";
nlohmann::json refs = nlohmann::json::array();
for (const SourceLocation& r : s->references)
refs.push_back(r.toJsonObj());
symArray.push_back({
{"name", s->name},
{"kind", symbolKindName(s->kind)},
{"type", s->type.toString()},
{"typeDetail", s->type.toJsonObj()},
{"definition", s->definitionLoc.toJsonObj()},
{"referenceCount", static_cast<int>(s->references.size())},
{"references", refs},
{"isBuiltin", s->isBuiltin}
});
if (symbols.empty()) {
std::cout << " (sembol bulunamadı)\n";
}
out["symbols"] = symArray;
out["diagnostics"] = diag.toJsonObj();
std::cout << (args.compact ? out.dump() : out.dump(2)) << "\n";
for (auto& s : symbols) {
std::cout << " [" << s.kind << "] " << s.type << " " << s.name << "\n";
}
std::cout << "────────────────────────────────────────────\n";
int fnCount = 0, varCount = 0;
for (auto& s : symbols) {
if (s.kind == "function") fnCount++;
else if (s.kind == "variable") varCount++;
}
std::cout << "Fonksiyon: " << fnCount
<< " | Değişken: " << varCount << "\n";
delete ast;
for (auto* t : tokens) delete t;
return diag.hasErrors() ? 1 : 0;
return 0;
}
#endif // SAQUT_CLI_SYMBOLS

View File

@ -1,11 +0,0 @@
#ifndef SAQUT_CORE_CONFIG
#define SAQUT_CORE_CONFIG
// Derleyici yapılandırması — hangi optimizasyon pass'lerinin çalışacağı.
struct CompilerConfig {
bool optConstantFolding = true;
bool optDeadCodeElim = true;
int maxFixpointRounds = 10;
};
#endif // SAQUT_CORE_CONFIG

View File

@ -22,7 +22,6 @@
#define SAQUT_CORE_LOCATION
#include <string>
#include "vendor/nlohmann/json.hpp"
// ============================================================================
// SourceLocation — Kaynak Koddaki Bir Nokta
@ -67,17 +66,15 @@ struct SourceLocation {
}
// JSON formatı: {"file":"...","line":5,"column":10,"offset":134}
nlohmann::json toJsonObj() const {
if (!isValid()) return nullptr;
return {
{"file", filePath},
{"line", line},
{"column", column},
{"offset", offset}
};
std::string toJson() const {
if (!isValid()) return "null";
return "{"
"\"file\":\"" + filePath + "\","
"\"line\":" + std::to_string(line) + ","
"\"column\":" + std::to_string(column) + ","
"\"offset\":" + std::to_string(offset) +
"}";
}
std::string toJson() const { return toJsonObj().dump(); }
};
#endif // SAQUT_CORE_LOCATION

View File

@ -1,257 +0,0 @@
// ============================================================================
// saQut Compiler — Tip Sistemi (Type System)
// ============================================================================
//
// DİZİN: src/core/type.hpp
// KATMAN: Katman 0 — Tüm analiz katmanları tarafından kullanılır
// BAĞIMLI: Yok (sadece <string>, <vector>, <memory>)
// KULLANAN: Sembol tablosu (Faz 2), tip denetleyici (Faz 3), optimizasyon (Faz 4)
//
// AMAÇ:
// Kaynak koddaki her ifadenin/sembolün veri tipini temsil eder. Derleyicinin
// "bu değer ne?" sorusuna verdiği yapısal cevaptır. Tip, makine-okur (toJson)
// ve insan-okur (toString) olarak dışa açıktır — "veri birincil, metin bir
// görünümdür" ilkesine uyar (bkz. readme → Tasarım felsefesi).
//
// TİP TÜRLERİ (TypeKind):
// Primitive : int, float, double, char, string, bool, void
// Array : eleman tipi taşır (örn. int[])
// Struct : struct adı taşır (örn. struct Point)
// Function : dönüş tipi + parametre tipleri taşır
// Error : hatalı/çözümlenememiş tip — ardışık sahte hataları bastırmak için
// (tip denetleyici, operandı Error olan ifadede yeni hata üretmez)
//
// NOT (kasıtlı sadelik): Gizli tip dönüşümü YOKTUR (ADR-010). equals() yapısal
// ve katıdır; "int, float'a uyar mı?" gibi kurallar tip denetleyicinin işidir,
// bu dosyanın değil. Tamsayı literalinin bağlama-göre tiplenmesi de (ADR-010)
// Faz 3'te ele alınır.
//
// ============================================================================
#ifndef SAQUT_CORE_TYPE
#define SAQUT_CORE_TYPE
#include <string>
#include <vector>
#include <memory>
#include "vendor/nlohmann/json.hpp"
// ============================================================================
// Enum'lar
// ============================================================================
enum class PrimitiveKind { Int, Float, Double, Char, String, Bool, Void };
enum class TypeKind { Primitive, Array, Struct, Function, Error };
// ============================================================================
// Type — Bir veri tipi
// ============================================================================
//
// KULLANIM:
// Type a = Type::Int(); // int
// Type b = Type::array(Type::Int()); // int[]
// Type c = Type::function(Type::Int(), {Type::Int(), Type::Int()}); // fn(int,int)->int
// Type d = Type::structType("Point"); // struct Point
// Type e = Type::error(); // <error>
//
// a.equals(Type::Int()); // true
// a.equals(b); // false
// a.toString(); // "int"
// b.toString(); // "int[]"
// c.toJson(); // {"kind":"function",...}
//
// İç içe tipler (array elemanı, fonksiyon dönüşü) shared_ptr ile tutulur:
// Type değer-semantiğiyle kopyalanabilir kalır ama özyinelemeli olabilir.
// ============================================================================
struct Type {
TypeKind kind = TypeKind::Error;
PrimitiveKind prim = PrimitiveKind::Void; // kind == Primitive
std::shared_ptr<Type> elementType; // kind == Array
std::shared_ptr<Type> returnType; // kind == Function
std::vector<Type> paramTypes; // kind == Function
std::string structName; // kind == Struct
// ------------------------------------------------------------------ //
// Factory'ler
// ------------------------------------------------------------------ //
static Type primitive(PrimitiveKind p) {
Type t;
t.kind = TypeKind::Primitive;
t.prim = p;
return t;
}
static Type Int() { return primitive(PrimitiveKind::Int); }
static Type Float() { return primitive(PrimitiveKind::Float); }
static Type Double() { return primitive(PrimitiveKind::Double); }
static Type Char() { return primitive(PrimitiveKind::Char); }
static Type String() { return primitive(PrimitiveKind::String); }
static Type Bool() { return primitive(PrimitiveKind::Bool); }
static Type Void() { return primitive(PrimitiveKind::Void); }
static Type array(Type elem) {
Type t;
t.kind = TypeKind::Array;
t.elementType = std::make_shared<Type>(std::move(elem));
return t;
}
static Type function(Type ret, std::vector<Type> params) {
Type t;
t.kind = TypeKind::Function;
t.returnType = std::make_shared<Type>(std::move(ret));
t.paramTypes = std::move(params);
return t;
}
static Type structType(std::string name) {
Type t;
t.kind = TypeKind::Struct;
t.structName = std::move(name);
return t;
}
static Type error() {
return Type{}; // varsayılan = Error
}
// ------------------------------------------------------------------ //
// Yüklemler (predicates)
// ------------------------------------------------------------------ //
bool isError() const { return kind == TypeKind::Error; }
bool isPrimitive() const { return kind == TypeKind::Primitive; }
bool isArray() const { return kind == TypeKind::Array; }
bool isStruct() const { return kind == TypeKind::Struct; }
bool isFunction() const { return kind == TypeKind::Function; }
bool isVoid() const { return kind == TypeKind::Primitive && prim == PrimitiveKind::Void; }
// Aritmetik/karşılaştırma operatörlerine uygun sayısal tip mi?
bool isNumeric() const {
return kind == TypeKind::Primitive &&
(prim == PrimitiveKind::Int ||
prim == PrimitiveKind::Float ||
prim == PrimitiveKind::Double);
}
// ------------------------------------------------------------------ //
// equals — Yapısal eşitlik (katı; gizli dönüşüm yok, ADR-010)
// ------------------------------------------------------------------ //
bool equals(const Type& o) const {
if (kind != o.kind) return false;
switch (kind) {
case TypeKind::Primitive:
return prim == o.prim;
case TypeKind::Array:
return elementType && o.elementType &&
elementType->equals(*o.elementType);
case TypeKind::Struct:
return structName == o.structName;
case TypeKind::Function: {
if (!returnType || !o.returnType) return false;
if (!returnType->equals(*o.returnType)) return false;
if (paramTypes.size() != o.paramTypes.size()) return false;
for (size_t i = 0; i < paramTypes.size(); ++i)
if (!paramTypes[i].equals(o.paramTypes[i])) return false;
return true;
}
case TypeKind::Error:
// Error == Error: ardışık sahte hataların bastırılması tip
// denetleyicinin sorumluluğundadır (operandı Error ise hata üretme).
return true;
}
return false; // erişilemez (tüm enum değerleri kapsandı)
}
// ------------------------------------------------------------------ //
// İsim yardımcıları
// ------------------------------------------------------------------ //
static const char* primName(PrimitiveKind p) {
switch (p) {
case PrimitiveKind::Int: return "int";
case PrimitiveKind::Float: return "float";
case PrimitiveKind::Double: return "double";
case PrimitiveKind::Char: return "char";
case PrimitiveKind::String: return "string";
case PrimitiveKind::Bool: return "bool";
case PrimitiveKind::Void: return "void";
}
return "?";
}
// Bir tip adından (parser tipleri string olarak tutar) primitif Type üretir.
// Bilinen primitif değilse Error döner — bilinmeyen tip adının teşhisi
// (E007) çağıranın (Faz 2/3) işidir; bu fonksiyon sessizce Error verir.
static Type fromName(const std::string& n) {
if (n == "int") return Int();
if (n == "float") return Float();
if (n == "double") return Double();
if (n == "char") return Char();
if (n == "string") return String();
if (n == "bool") return Bool();
if (n == "void") return Void();
return error();
}
// ------------------------------------------------------------------ //
// toString — İnsan-okur ("int", "int[]", "fn(int,int)->int")
// ------------------------------------------------------------------ //
std::string toString() const {
switch (kind) {
case TypeKind::Primitive:
return primName(prim);
case TypeKind::Array:
return (elementType ? elementType->toString() : "<?>") + "[]";
case TypeKind::Struct:
return "struct " + structName;
case TypeKind::Function: {
std::string s = "fn(";
for (size_t i = 0; i < paramTypes.size(); ++i) {
if (i) s += ",";
s += paramTypes[i].toString();
}
s += ")->";
s += returnType ? returnType->toString() : "<?>";
return s;
}
case TypeKind::Error:
return "<error>";
}
return "<?>";
}
// ------------------------------------------------------------------ //
// toJson — Makine-okur (cam ilkesi: her tip dışarıdan sorgulanabilir)
// ------------------------------------------------------------------ //
nlohmann::json toJsonObj() const {
nlohmann::json j;
switch (kind) {
case TypeKind::Primitive:
j["kind"] = "primitive";
j["name"] = primName(prim);
break;
case TypeKind::Array:
j["kind"] = "array";
j["element"] = elementType ? elementType->toJsonObj() : nullptr;
break;
case TypeKind::Struct:
j["kind"] = "struct";
j["name"] = structName;
break;
case TypeKind::Function: {
j["kind"] = "function";
j["returns"] = returnType ? returnType->toJsonObj() : nullptr;
nlohmann::json params = nlohmann::json::array();
for (const auto& p : paramTypes) params.push_back(p.toJsonObj());
j["params"] = params;
break;
}
case TypeKind::Error:
j["kind"] = "error";
break;
}
return j;
}
std::string toJson() const { return toJsonObj().dump(); }
};
#endif // SAQUT_CORE_TYPE

View File

@ -1,164 +0,0 @@
// ============================================================================
// saQut Compiler — Tanılama (Diagnostic) Veri Yapıları + Hata Kataloğu
// ============================================================================
//
// DİZİN: src/diagnostic/diagnostic.hpp
// KATMAN: Katman 0 — Tüm analiz katmanları tarafından kullanılır
// BAĞIMLI: src/core/location.hpp
// KULLANAN: DiagnosticEngine, sembol toplayıcı (Faz 2), tip denetleyici (Faz 3)
//
// AMAÇ:
// Derleme sırasında bulunan hata/uyarıları YAPISAL veri olarak temsil eder.
// "Veri birincil, insan-okur metin bir görünümdür" (readme → Tasarım felsefesi):
// bir Diagnostic; seviye + kod + konum + mesaj taşır; ekrana basılan satır
// bunun yalnızca bir render'ıdır. Bu sayede aynı tanı LSP, AI veya `saqut
// explain` tarafından da tüketilebilir.
//
// HATA KATALOĞU (baştan sabitlenir — yeni kodlar buraya eklenir):
// E001 Tanımsız değişken/isim (declare-before-use ihlali dâhil) Faz 2/3
// E002 Aynı scope'ta çift tanım Faz 2
// E003 Tip uyuşmazlığı (gizli dönüşüm yok, ADR-010) Faz 3
// E004 Döngü/switch dışı break/continue Faz 3
// E005 Fonksiyon dışı return Faz 3
// E006 Return tipi imzaya uymuyor Faz 3
// E007 Tanımsız tip (bilinmeyen tip adı) Faz 2/3
// E008 Fonksiyon çağrısı argüman sayısı/tipi uyuşmuyor Faz 3
// E009 Array boyutu sabit değil / geçersiz Faz 3
// E010 Özyinelemeli/döngüsel struct (by-value çevrim → sonsuz boyut) Faz 2/3
// W001 Kullanılmayan değişken Faz 4
// W002 Sıfıra bölme (sabit folding) Faz 4
// W003 Erişilemez (ölü) kod Faz 4
//
// ============================================================================
#ifndef SAQUT_DIAGNOSTIC_DIAGNOSTIC
#define SAQUT_DIAGNOSTIC_DIAGNOSTIC
#include <string>
#include <vector>
#include "core/location.hpp"
#include "tools.hpp" // jsonEscape — TEK tanım (tools.hpp); çakışmayı önler
// ============================================================================
// DiagLevel — Tanı seviyesi
// ============================================================================
enum class DiagLevel { Error, Warning, Note, Hint };
inline const char* diagLevelName(DiagLevel l) {
switch (l) {
case DiagLevel::Error: return "error";
case DiagLevel::Warning: return "warning";
case DiagLevel::Note: return "note";
case DiagLevel::Hint: return "hint";
}
return "?";
}
// İnsan-okur çıktı için Türkçe karşılık
inline const char* diagLevelNameTr(DiagLevel l) {
switch (l) {
case DiagLevel::Error: return "hata";
case DiagLevel::Warning: return "uyarı";
case DiagLevel::Note: return "not";
case DiagLevel::Hint: return "ipucu";
}
return "?";
}
// NOT: jsonEscape() tools.hpp'de tanımlıdır (tek tanım — ODR çakışması olmaz).
// ============================================================================
// Diagnostic — Tek bir tanı (hata/uyarı/not/ipucu)
// ============================================================================
//
// KULLANIM:
// Diagnostic d{DiagLevel::Error, "E003", loc, "int'e string atanamaz"};
// d.hint = "açık dönüşüm gerekiyor";
// std::cout << d.toJson();
// ============================================================================
struct Diagnostic {
DiagLevel level = DiagLevel::Error;
std::string code; // "E003" (katalog kodu; boş olabilir)
SourceLocation loc; // hatanın kaynak koddaki yeri
std::string message; // bağlama özel açıklama
std::string hint; // opsiyonel "şunu dene" önerisi
nlohmann::json toJsonObj() const {
nlohmann::json j;
j["level"] = diagLevelName(level);
j["code"] = code;
j["location"] = loc.toJsonObj();
j["message"] = message;
if (!hint.empty()) j["hint"] = hint;
return j;
}
std::string toJson() const { return toJsonObj().dump(); }
};
// ============================================================================
// Hata Kataloğu — kod → (seviye, kanonik başlık)
// ============================================================================
//
// Bağlama özel mesaj report sırasında verilir; buradaki başlık, kodun GENEL
// anlamıdır (ileride `saqut explain E003` bunu kullanabilir, #107/#98).
// ============================================================================
struct DiagInfo {
const char* code;
DiagLevel level;
const char* title;
};
inline const std::vector<DiagInfo>& diagnosticCatalog() {
static const std::vector<DiagInfo> catalog = {
{"E001", DiagLevel::Error, "Tanımsız değişken/isim"},
{"E002", DiagLevel::Error, "Aynı scope'ta çift tanım"},
{"E003", DiagLevel::Error, "Tip uyuşmazlığı"},
{"E004", DiagLevel::Error, "Döngü/switch dışı break/continue"},
{"E005", DiagLevel::Error, "Fonksiyon dışı return"},
{"E006", DiagLevel::Error, "Return tipi imzaya uymuyor"},
{"E007", DiagLevel::Error, "Tanımsız tip"},
{"E008", DiagLevel::Error, "Fonksiyon çağrısı argümanı uyuşmuyor"},
{"E009", DiagLevel::Error, "Array boyutu sabit değil / geçersiz"},
{"E010", DiagLevel::Error, "Özyinelemeli/döngüsel struct tanımı"},
{"W001", DiagLevel::Warning, "Kullanılmayan değişken"},
{"W002", DiagLevel::Warning, "Sıfıra bölme (sabit ifade)"},
{"W003", DiagLevel::Warning, "Erişilemez (ölü) kod"},
{"W004", DiagLevel::Warning, "Örtük sayısal genişletme (widening)"},
};
return catalog;
}
// Kod kataloğda var mı? (yoksa nullptr)
inline const DiagInfo* findDiag(const std::string& code) {
for (const auto& d : diagnosticCatalog())
if (code == d.code) return &d;
return nullptr;
}
// Bir koddan Diagnostic üretir; seviye kataloğdan çözülür (yoksa: E→Error,
// W→Warning, diğer→Note). Bağlama özel mesajı çağıran verir.
inline Diagnostic makeDiagnostic(const std::string& code,
const SourceLocation& loc,
const std::string& message,
const std::string& hint = "") {
DiagLevel level = DiagLevel::Note;
if (const DiagInfo* info = findDiag(code)) {
level = info->level;
} else if (!code.empty()) {
if (code[0] == 'E') level = DiagLevel::Error;
else if (code[0] == 'W') level = DiagLevel::Warning;
}
Diagnostic d;
d.level = level;
d.code = code;
d.loc = loc;
d.message = message;
d.hint = hint;
return d;
}
#endif // SAQUT_DIAGNOSTIC_DIAGNOSTIC

View File

@ -1,116 +0,0 @@
// ============================================================================
// saQut Compiler — Tanılama Motoru (DiagnosticEngine)
// ============================================================================
//
// DİZİN: src/diagnostic/diagnostic_engine.hpp
// KATMAN: Katman 0 — Tüm analiz katmanları tarafından kullanılır
// BAĞIMLI: src/diagnostic/diagnostic.hpp
// KULLANAN: sembol toplayıcı (Faz 2), tip denetleyici (Faz 3), pipeline (main)
//
// AMAÇ:
// Derleme boyunca üretilen tüm Diagnostic'leri EKLENME SIRASIYLA biriktirir.
// İlk hatada DURMAZ (ADR-013): bütün hatalar toplanır, faz sonunda topluca
// raporlanır; durdurma kararını pipeline verir (hasErrors()).
//
// İki çıktı yüzü vardır — aynı veriden:
// printAll() → insan-okur (terminal)
// toJson() → makine-okur (LSP / AI / araçlar)
//
// ============================================================================
#ifndef SAQUT_DIAGNOSTIC_ENGINE
#define SAQUT_DIAGNOSTIC_ENGINE
#include <string>
#include <vector>
#include <ostream>
#include "diagnostic/diagnostic.hpp"
#include "vendor/nlohmann/json.hpp"
// ============================================================================
// DiagnosticEngine
// ============================================================================
//
// KULLANIM:
// DiagnosticEngine diag;
// diag.report(makeDiagnostic("E001", loc, "x tanımsız"));
// diag.report(DiagLevel::Warning, "W001", loc2, "y kullanılmıyor");
// if (diag.hasErrors()) diag.printAll(std::cerr);
// ============================================================================
class DiagnosticEngine {
public:
// --- Ekleme ---
void report(const Diagnostic& d) {
diagnostics_.push_back(d);
}
// Kolaylık: koddan üret + ekle (seviye kataloğdan çözülür)
void report(const std::string& code,
const SourceLocation& loc,
const std::string& message,
const std::string& hint = "") {
diagnostics_.push_back(makeDiagnostic(code, loc, message, hint));
}
// Kolaylık: seviyeyi açıkça vererek
void report(DiagLevel level,
const std::string& code,
const SourceLocation& loc,
const std::string& message,
const std::string& hint = "") {
Diagnostic d;
d.level = level; d.code = code; d.loc = loc; d.message = message; d.hint = hint;
diagnostics_.push_back(d);
}
// --- Sorgu ---
bool hasErrors() const { return errorCount() > 0; }
int errorCount() const { return countLevel(DiagLevel::Error); }
int warningCount() const { return countLevel(DiagLevel::Warning); }
int count() const { return static_cast<int>(diagnostics_.size()); }
bool empty() const { return diagnostics_.empty(); }
const std::vector<Diagnostic>& all() const { return diagnostics_; }
void clear() { diagnostics_.clear(); }
// --- İnsan-okur çıktı (ekleme sırasıyla) ---
void printAll(std::ostream& os) const {
for (const auto& d : diagnostics_) {
os << d.loc.toString() << ": "
<< diagLevelNameTr(d.level) << " [" << d.code << "]: "
<< d.message << "\n";
if (!d.hint.empty())
os << " ipucu: " << d.hint << "\n";
}
os << "" << errorCount() << " hata, " << warningCount() << " uyarı\n";
}
// --- Makine-okur çıktı ---
nlohmann::json toJsonObj() const {
nlohmann::json items = nlohmann::json::array();
for (const auto& d : diagnostics_)
items.push_back(d.toJsonObj());
return {
{"diagnostics", items},
{"errorCount", errorCount()},
{"warningCount", warningCount()}
};
}
std::string toJson() const { return toJsonObj().dump(); }
private:
std::vector<Diagnostic> diagnostics_;
int countLevel(DiagLevel level) const {
int n = 0;
for (const auto& d : diagnostics_)
if (d.level == level) ++n;
return n;
}
};
#endif // SAQUT_DIAGNOSTIC_ENGINE

View File

@ -1,150 +0,0 @@
// ============================================================================
// saQut IR — Instruction (Tek Talimat)
//
// Sanal makine bu talimatlara bakarak ne yapacağını anlar.
// Her talimatın bir "opcode"u (ne iş yapacağı) ve birkaç operandı vardır.
// Operandlar ya slot numarasıdır (fonksiyonun yerel değişken/geçici depoları)
// ya da doğrudan bir sayı/isim değeridir.
//
// SLOT NEDİR?
// Her fonksiyon çağrısı kendi "frame"ini açar.
// Frame içinde numaralı kutucuklar vardır: slot[0], slot[1], ...
// Parametreler slot 0'dan başlar. Sonrasında lokal değişkenler
// ve hesaplama sırasında oluşan geçici değerler gelir.
// "slots[5] = 42" demek "5 numaralı kutucuğa 42 değerini koy" demektir.
//
// HANGİ OPCODE HANGİ ALANI KULLANIR?
// LOAD_CONST : dest, intValue
// LOAD_SLOT : dest, src
// ADD/SUB/... : dest, left, right
// LESS/LEQ/... : dest, left, right (sonuç: 1=doğru, 0=yanlış)
// JMP : jumpTarget
// JIF_FALSE : cond, jumpTarget
// CALL : dest, functionName, argSlots
// RETURN : src
// CALLHOST : functionName, argSlots
// ============================================================================
#ifndef SAQUT_IR_INSTRUCTION
#define SAQUT_IR_INSTRUCTION
#include <string>
#include <vector>
// ----------------------------------------------------------------------------
// Opcode — Sanal Makinenin Anlayacağı İşlem Kodları
// ----------------------------------------------------------------------------
enum class Opcode {
// --- Değer yükleme ---
LOAD_CONST, // slots[dest] = intValue (tam sayı sabitini slota yükle)
// Örnek: LOAD_CONST dest=3 val=10 → slot[3] = 10
LOAD_STRING, // slots[dest] = stringValue (metin sabitini slota yükle)
// Örnek: LOAD_STRING dest=2 val="Merhaba" → slot[2] = "Merhaba"
LOAD_SLOT, // slots[dest] = slots[src]
// Bir slotun değerini başka bir slota kopyalar.
// Atama işlemlerinde (x = y) kullanılır.
// --- Aritmetik (tümü: slots[dest] = slots[left] OP slots[right]) ---
ADD,
SUB,
MUL,
DIV, // UYARI: sıfıra bölme → runtime_error fırlatılır
MOD,
// --- Karşılaştırma (sonuç: 1 = doğru, 0 = yanlış) ---
LESS, // slots[left] < slots[right]
LESS_EQUAL, // slots[left] <= slots[right]
GREATER, // slots[left] > slots[right]
GREATER_EQUAL, // slots[left] >= slots[right]
EQUAL_EQUAL, // slots[left] == slots[right]
NOT_EQUAL, // slots[left] != slots[right]
// --- Kontrol akışı ---
JMP, // Koşulsuz atlama: ip = jumpTarget
JIF_FALSE, // Koşullu atlama: slots[cond] == 0 ise ip = jumpTarget
// --- Fonksiyon çağrısı ---
CALL, // Başka bir saQut fonksiyonunu çağır.
// Yeni frame açılır, argümanlar parametre slotlarına kopyalanır.
// Fonksiyon RETURN ile bitince sonuç slots[dest]'e yazılır.
RETURN, // Bu frame'i kapat, slots[src]'yi caller'a ilet.
// --- Dış dünya (FFI — Foreign Function Interface) ---
CALLHOST, // Host (C++) fonksiyonunu çağır. Şu an sadece "print" destekli.
// Dönüş değeri yok; sadece yan etki (stdout'a yazmak gibi).
};
// Hata ayıklama ve IR dump için okunabilir isim
inline const char* opcodeName(Opcode op) {
switch (op) {
case Opcode::LOAD_CONST: return "LOAD_CONST";
case Opcode::LOAD_STRING: return "LOAD_STRING";
case Opcode::LOAD_SLOT: return "LOAD_SLOT";
case Opcode::ADD: return "ADD";
case Opcode::SUB: return "SUB";
case Opcode::MUL: return "MUL";
case Opcode::DIV: return "DIV";
case Opcode::MOD: return "MOD";
case Opcode::LESS: return "LESS";
case Opcode::LESS_EQUAL: return "LESS_EQUAL";
case Opcode::GREATER: return "GREATER";
case Opcode::GREATER_EQUAL: return "GREATER_EQUAL";
case Opcode::EQUAL_EQUAL: return "EQUAL_EQUAL";
case Opcode::NOT_EQUAL: return "NOT_EQUAL";
case Opcode::JMP: return "JMP";
case Opcode::JIF_FALSE: return "JIF_FALSE";
case Opcode::CALL: return "CALL";
case Opcode::RETURN: return "RETURN";
case Opcode::CALLHOST: return "CALLHOST";
}
return "UNKNOWN";
}
// ----------------------------------------------------------------------------
// Instruction — Tek bir IR talimatı
//
// Okunabilirlik öncelikli bir tasarım: her talimat TÜM alanları içerir,
// kullanılmayanlar varsayılan değerde (-1 veya boş) kalır.
// Bu yaklaşım bellek israfeder ama her talimatın hangi veriyle çalıştığı
// açıkça görünür — karmaşık union/variant yapısı gerekmez.
// ----------------------------------------------------------------------------
struct Instruction {
Opcode opcode;
// Hedef slot — sonucun yazılacağı yer (LOAD_CONST, ADD, CALL vb.)
int dest = -1;
// Kaynak slot — kopyalama veya döndürme için (LOAD_SLOT, RETURN)
int src = -1;
// Aritmetik/karşılaştırma operandları
int left = -1;
int right = -1;
// LOAD_CONST için yüklenecek tam sayı sabiti
int intValue = 0;
// LOAD_STRING için yüklenecek metin sabiti (tırnak işaretleri olmadan)
std::string stringValue;
// JMP / JIF_FALSE için hedef instruction indeksi
// Üretim sırasında bilinmiyorsa -1 bırakılır, sonradan doldurulur (backpatch).
int jumpTarget = -1;
// JIF_FALSE için kontrol edilecek koşul slotu
int cond = -1;
// CALL / CALLHOST için çağrılacak fonksiyonun adı
std::string functionName;
// CALL / CALLHOST için argüman slot indeksleri (sırayla)
std::vector<int> argSlots;
explicit Instruction(Opcode op) : opcode(op) {}
};
#endif // SAQUT_IR_INSTRUCTION

View File

@ -1,123 +0,0 @@
#include "ir/ir_function.hpp"
#include <iomanip>
#include <iostream>
#include <string>
// ─────────────────────────────────────────────────────────────────────────────
// Yardımcılar
// ─────────────────────────────────────────────────────────────────────────────
// Slot adını kısa göster: s0, s1, ...
static std::string slot(int s) {
if (s == -1) return "?";
return "s" + std::to_string(s);
}
// İkili op sembolü: ADD → "+"
static const char* opSymbol(Opcode op) {
switch (op) {
case Opcode::ADD: return "+";
case Opcode::SUB: return "-";
case Opcode::MUL: return "*";
case Opcode::DIV: return "/";
case Opcode::MOD: return "%";
case Opcode::LESS: return "<";
case Opcode::LESS_EQUAL: return "<=";
case Opcode::GREATER: return ">";
case Opcode::GREATER_EQUAL: return ">=";
case Opcode::EQUAL_EQUAL: return "==";
case Opcode::NOT_EQUAL: return "!=";
default: return "?";
}
}
static bool isBinaryOp(Opcode op) {
switch (op) {
case Opcode::ADD: case Opcode::SUB: case Opcode::MUL:
case Opcode::DIV: case Opcode::MOD:
case Opcode::LESS: case Opcode::LESS_EQUAL:
case Opcode::GREATER: case Opcode::GREATER_EQUAL:
case Opcode::EQUAL_EQUAL: case Opcode::NOT_EQUAL:
return true;
default: return false;
}
}
// ─────────────────────────────────────────────────────────────────────────────
// IRFunction::dump
// ─────────────────────────────────────────────────────────────────────────────
void IRFunction::dump() const {
// Başlık: fonksiyon adı + slot bilgisi
std::string header = " " + name + "()";
if (paramCount > 0) {
header = " " + name + "(";
for (int i = 0; i < paramCount; i++) {
if (i) header += ", ";
header += "s" + std::to_string(i);
}
header += ")";
}
header += " [" + std::to_string(slotCount) + " slot]";
// Başlık: NAME=fibonacci PARAMS=1 SLOTS=10
std::cout << "NAME=" << name
<< " PARAMS=" << paramCount
<< " SLOTS=" << slotCount
<< "\n";
// Talimatlar
for (int i = 0; i < (int)instructions.size(); i++) {
const Instruction& ins = instructions[i];
// Satır numarası
std::cout << " " << std::setw(3) << std::right << i << " ";
// Opcode sütunu (12 karakter genişlik)
std::cout << std::left << std::setw(12) << opcodeName(ins.opcode);
// Operandlar — opcode'a göre farklı format
if (ins.opcode == Opcode::LOAD_CONST) {
std::cout << slot(ins.dest) << " = " << ins.intValue;
} else if (ins.opcode == Opcode::LOAD_STRING) {
std::cout << slot(ins.dest) << " = \"" << ins.stringValue << "\"";
} else if (ins.opcode == Opcode::LOAD_SLOT) {
std::cout << slot(ins.dest) << " = " << slot(ins.src);
} else if (isBinaryOp(ins.opcode)) {
std::cout << slot(ins.dest) << " = "
<< slot(ins.left) << " " << opSymbol(ins.opcode)
<< " " << slot(ins.right);
} else if (ins.opcode == Opcode::JMP) {
std::cout << "" << ins.jumpTarget;
} else if (ins.opcode == Opcode::JIF_FALSE) {
std::cout << "!" << slot(ins.cond) << "" << ins.jumpTarget;
} else if (ins.opcode == Opcode::CALL) {
std::cout << slot(ins.dest) << " = " << ins.functionName << "(";
for (int j = 0; j < (int)ins.argSlots.size(); j++) {
if (j) std::cout << ", ";
std::cout << slot(ins.argSlots[j]);
}
std::cout << ")";
} else if (ins.opcode == Opcode::CALLHOST) {
std::cout << ins.functionName << "(";
for (int j = 0; j < (int)ins.argSlots.size(); j++) {
if (j) std::cout << ", ";
std::cout << slot(ins.argSlots[j]);
}
std::cout << ")";
} else if (ins.opcode == Opcode::RETURN) {
std::cout << slot(ins.src);
}
std::cout << "\n";
}
std::cout << "\n";
}

View File

@ -1,37 +0,0 @@
// ============================================================================
// saQut IR — IRFunction (Tek Fonksiyonun IR Karşılığı)
//
// Bir IRFunction, kaynak koddaki tek bir fonksiyonun "pişmiş" halidir.
// IRGenerator bu yapıyı doldurur, Interpreter bu yapıyı çalıştırır.
//
// SLOT DÜZENI:
// slot[0 .. paramCount-1] → parametreler (soldan sağa)
// slot[paramCount ..] → lokal değişkenler ve geçici sonuçlar
// slotCount → toplam kaç slot lazım (frame boyutu)
//
// Örnek — fibonacci(int n):
// paramCount = 1 → slot[0] = n
// slotCount = 11 → slot[0..10] (0'ı parametre, 1-10 hesaplamalar)
// ============================================================================
#ifndef SAQUT_IR_FUNCTION
#define SAQUT_IR_FUNCTION
#include <string>
#include <vector>
#include "ir/instruction.hpp"
struct IRFunction {
std::string name; // kaynak koddaki fonksiyon adı
int paramCount; // kaç parametresi var
int slotCount; // frame boyutu (üretim sonunda doldurulur)
std::vector<Instruction> instructions; // bu fonksiyonun talimat listesi
IRFunction(std::string name, int paramCount)
: name(std::move(name)), paramCount(paramCount), slotCount(0) {}
// Okunabilir IR dump — "saqut run" hata ayıklaması veya inceleme için
void dump() const;
};
#endif // SAQUT_IR_FUNCTION

View File

@ -1,571 +0,0 @@
#include "ir/ir_generator.hpp"
#include "tokenizer/token.hpp"
#include "parser/nodes/program.hpp"
#include "parser/nodes/declarations.hpp"
#include "parser/nodes/statements.hpp"
#include "parser/nodes/expressions.hpp"
#include "parser/nodes/binary_expr.hpp"
#include "parser/nodes/identifier.hpp"
#include "parser/nodes/literal.hpp"
#include <stdexcept>
#include <string>
// ─────────────────────────────────────────────────────────────────────────────
// generate — Ana giriş noktası
// ─────────────────────────────────────────────────────────────────────────────
IRProgram IRGenerator::generate(ASTNode* programNode, SymbolTable& /*symbolTable*/) {
IRProgram program;
// ProgramNode'un her çocuğunu gez.
// Bizi ilgilendiren: FunctionDecl. StructDecl/GlobalVar → TODO.
for (ASTNode* child : programNode->getChildren()) {
if (child->kind == ASTKind::FunctionDecl) {
// Her fonksiyon üretimi için sıfırla
nameToSlot_.clear();
nextSlot_ = 0;
// IRFunction oluştur, currentFunction_ olarak işaretle
auto* fnDecl = (FunctionDeclNode*)child;
IRFunction irFn(fnDecl->name, (int)fnDecl->params.size());
program.addFunction(std::move(irFn));
// addFunction std::move yaptığı için pointer'ı haritadan alalım
currentFunction_ = program.findFunction(fnDecl->name);
generateFunction(child);
// Fonksiyon bitti — toplam slot sayısını kaydet
currentFunction_->slotCount = nextSlot_;
}
}
return program;
}
// ─────────────────────────────────────────────────────────────────────────────
// generateFunction — Tek bir fonksiyonu IR'a çevirir
// ─────────────────────────────────────────────────────────────────────────────
void IRGenerator::generateFunction(ASTNode* functionDeclNode) {
auto* fn = (FunctionDeclNode*)functionDeclNode;
// Parametreler slot 0, 1, 2, ... sırasıyla alır.
// Interpreter, CALL sırasında bu slotlara argümanları kopyalar.
for (auto* param : fn->params) {
int slot = freshSlot();
registerVariable(param->name, slot);
}
// Fonksiyon gövdesi — children[0] her zaman BlockNode
auto& children = fn->getChildren();
if (!children.empty()) {
generateStatement(children[0]);
}
}
// ─────────────────────────────────────────────────────────────────────────────
// generateStatement — Deyim türlerine göre talimat üret
// ─────────────────────────────────────────────────────────────────────────────
void IRGenerator::generateStatement(ASTNode* node) {
if (!node) return;
switch (node->kind) {
// ── Blok: içindeki her deyimi sırayla üret ───────────────────────────
case ASTKind::Block: {
for (ASTNode* child : node->getChildren()) {
generateStatement(child);
}
break;
}
// ── Değişken bildirimi: int x = <ifade> ──────────────────────────────
case ASTKind::VariableDecl: {
auto* vd = (VariableDeclNode*)node;
// Bu değişken için yeni bir slot ayır
int varSlot = freshSlot();
registerVariable(vd->name, varSlot);
if (vd->initExpr) {
// Başlatma ifadesini üret, sonucu bir slotta al
int initSlot = generateExpression(vd->initExpr);
if (initSlot != varSlot) {
// Sonuç başka bir slotta, değişkenin slotuna kopyala
emitLoadSlot(varSlot, initSlot);
}
// initSlot == varSlot: LOAD_CONST doğrudan varSlot'a yazıldı, kopya gerekmez
}
// Sibling VariableDecl'ler: int a, b; → children'da diğer VariableDecl'ler
for (ASTNode* sib : node->getChildren()) {
if (sib->kind == ASTKind::VariableDecl) {
generateStatement(sib);
}
}
break;
}
// ── return <ifade> ───────────────────────────────────────────────────
case ASTKind::ReturnStatement: {
auto* rs = (ReturnStatementNode*)node;
int returnSlot = 0; // varsayılan: slot[0] (void fonksiyon / boş return)
if (rs->value) {
returnSlot = generateExpression(rs->value);
}
emitReturn(returnSlot);
break;
}
// ── if (koşul) { ... } [else { ... }] ───────────────────────────────
case ASTKind::IfStatement: {
auto* ifn = (IfStatementNode*)node;
// Koşulu hesapla
int condSlot = generateExpression(ifn->condition);
// "Koşul yanlışsa atla" → hedef henüz bilinmiyor, backpatch bekliyor
int jumpToElse = emitJumpIfFalse(condSlot);
// Then bloğu
if (ifn->thenBranch) generateStatement(ifn->thenBranch);
if (ifn->elseBranch) {
// Then bitti, else'i atla (then içinde çalışanlar else'e girmemeli)
int jumpOverElse = emitJumpUnconditional(-1);
// Şimdi else'in başlangıç konumunu biliyoruz → jumpToElse'i doldur
patchJump(jumpToElse);
generateStatement(ifn->elseBranch);
// Else bitti → jumpOverElse'i doldur
patchJump(jumpOverElse);
} else {
// Else yok → jumpToElse doğrudan if sonrasına atlıyor
patchJump(jumpToElse);
}
break;
}
// ── while (koşul) { gövde } ──────────────────────────────────────────
case ASTKind::WhileStatement: {
auto* ws = (WhileStatementNode*)node;
// Döngü başının konumu — geri-jump buraya gelecek
int loopStart = currentInstrIndex();
int condSlot = generateExpression(ws->condition);
int exitJump = emitJumpIfFalse(condSlot); // ileri, backpatch bekliyor
if (ws->body) generateStatement(ws->body);
// Geri-jump: hedef zaten biliniyor (loopStart)
emitJumpUnconditional(loopStart);
// Döngü çıkış noktası → exitJump'ı doldur
patchJump(exitJump);
break;
}
// ── for (init; koşul; güncelleme) { gövde } ─────────────────────────
//
// Üretilen IR yapısı:
// [init]
// LOOP_START:
// [koşul] → condSlot
// JIF_FALSE condSlot → LOOP_END (ileri-jump, backpatch)
// [gövde]
// [güncelleme]
// JMP → LOOP_START (geri-jump, hedef biliniyor)
// LOOP_END:
// ─────────────────────────────────────────────────────────────────────
case ASTKind::ForStatement: {
auto* fs = (ForStatementNode*)node;
// Init: genellikle "int i = 0" gibi bir VariableDecl
if (fs->init) generateStatement(fs->init);
// Döngü başı konumu — geri-jump'ın hedefi
int loopStart = currentInstrIndex();
// Koşul
int condSlot = fs->condition ? generateExpression(fs->condition) : -1;
int exitJump = (condSlot != -1) ? emitJumpIfFalse(condSlot) : -1;
// Gövde
if (fs->body) generateStatement(fs->body);
// Güncelleme (ör: i = i + 1) — ifade deyimi, sonuç önemsiz
if (fs->update) generateExpression(fs->update);
// Geri-jump: hedef loopStart, zaten biliniyor
emitJumpUnconditional(loopStart);
// Döngü çıkışı → exitJump'ı doldur
if (exitJump != -1) patchJump(exitJump);
break;
}
// ── do { gövde } while (koşul) ───────────────────────────────────────
case ASTKind::DoWhileStatement: {
auto* dw = (DoWhileStatementNode*)node;
int loopStart = currentInstrIndex();
if (dw->body) generateStatement(dw->body);
int condSlot = generateExpression(dw->condition);
// Koşul doğruysa geri atla (1 = doğru → atla; 0 = yanlış → devam)
// JIF_FALSE koşul yanlışsa atlar; biz doğruysa atlamak istiyoruz.
// Bu yüzden JIF_FALSE yerine "doğruysa atla" mantığı lazım.
// Basit çözüm: koşulun tersini al (0→1, diğer→0) ve JIF_FALSE kullan.
// NOT: saQut'ta "!" operatörü yok henüz; NOT talimatı eklenebilir.
// Şimdilik: koşul slotuna bak, sıfır değilse geri atla.
// TODO(vm-genişletme): JIF_TRUE talimatı ekle
// Geçici çözüm: sabit 1 ile karşılaştır (condSlot != 0 → geri)
int oneSlot = freshSlot();
emitLoadConst(oneSlot, 1);
int eqSlot = freshSlot();
emitBinaryOp(Opcode::EQUAL_EQUAL, eqSlot, condSlot, oneSlot);
int skipJump = emitJumpIfFalse(eqSlot); // koşul yanlışsa döngüden çık
emitJumpUnconditional(loopStart); // geri atla
patchJump(skipJump);
break;
}
// ── İfade deyimi: bir ifadeyi değerlendirip sonucu at ────────────────
// Örnek: print(x) çağrısı, veya x = 5 ataması
case ASTKind::ExpressionStatement: {
auto* es = (ExpressionStatementNode*)node;
if (es->expression) {
generateExpression(es->expression); // sonucu kullanmıyoruz
}
break;
}
case ASTKind::BreakStatement:
case ASTKind::ContinueStatement:
// TODO(vm-genişletme): break/continue için JMP + label mekanizması gerekir
break;
default:
break;
}
}
// ─────────────────────────────────────────────────────────────────────────────
// generateExpression — İfadeyi IR'a çevirir, sonucu içeren slot'u döndürür
// ─────────────────────────────────────────────────────────────────────────────
int IRGenerator::generateExpression(ASTNode* node) {
if (!node) return 0;
switch (node->kind) {
// ── Sabit değer: 42, 3.14, true ... ──────────────────────────────────
case ASTKind::Literal: {
auto* lit = (LiteralNode*)node;
int slot = freshSlot();
switch (lit->literalType) {
case LiteralType::INTEGER: {
int value = 0;
if (lit->parserToken.token)
value = std::stoi(lit->parserToken.token->token);
emitLoadConst(slot, value);
break;
}
case LiteralType::BOOLEAN: {
int value = (lit->parserToken.token &&
lit->parserToken.token->token == "true") ? 1 : 0;
emitLoadConst(slot, value);
break;
}
case LiteralType::STRING: {
// StringToken::context tırnak işaretleri olmadan içeriği tutar
std::string content;
if (auto* st = dynamic_cast<StringToken*>(lit->lexerToken))
content = st->context;
else if (lit->parserToken.token) {
// Fallback: token'ın başındaki ve sonundaki " işaretlerini sıyır
std::string raw = lit->parserToken.token->token;
if (raw.size() >= 2 && raw.front() == '"' && raw.back() == '"')
content = raw.substr(1, raw.size() - 2);
else
content = raw;
}
Instruction ins(Opcode::LOAD_STRING);
ins.dest = slot;
ins.stringValue = std::move(content);
currentFunction_->instructions.push_back(std::move(ins));
break;
}
case LiteralType::FLOAT:
throw std::runtime_error(
"IR üretim hatası: float literal şu an VM tarafından desteklenmiyor. "
"Tam sayı kullanın veya float desteği eklenene kadar bekleyin.");
case LiteralType::BOŞ:
throw std::runtime_error(
"IR üretim hatası: null literal şu an VM tarafından desteklenmiyor.");
}
return slot;
}
// ── Değişken ismi: n, first, second ... ──────────────────────────────
// Bu değişkenin değeri zaten bir slotta. O slotu döndür.
case ASTKind::Identifier: {
auto* id = (IdentifierNode*)node;
std::string name = id->parserToken.token ? id->parserToken.token->token : "";
// Önce builtin mi? (print gibi) — identifier olarak gelen builtin fonksiyon
// çağrıları CallExpression içinde yakalanıyor, burada sadece değişken kalır
return lookupVariable(name);
}
// ── İkili ifade: x + y, x = y, x < y ... ────────────────────────────
case ASTKind::BinaryExpression: {
auto* bin = (BinaryExpressionNode*)node;
// Atama operatörleri: x = expr, x += expr ...
// Sol taraf bir değişken, sağ taraf hesaplanır ve o değişkene yazılır.
if (bin->Operator == TokenType::EQUAL) {
// Sağ tarafı hesapla
int rhsSlot = generateExpression(bin->Right);
// Sol taraf değişkenin slotunu bul
auto* lhsId = (IdentifierNode*)bin->Left;
std::string varName = lhsId->parserToken.token->token;
int varSlot = lookupVariable(varName);
// Sonucu değişkenin slotuna kopyala
if (rhsSlot != varSlot) {
emitLoadSlot(varSlot, rhsSlot);
}
return varSlot;
}
// Birleşik atama: += -= *= /=
// x += y ≡ x = x + y
if (bin->Operator == TokenType::PLUS_EQUAL ||
bin->Operator == TokenType::MINUS_EQUAL ||
bin->Operator == TokenType::STAR_EQUAL ||
bin->Operator == TokenType::SLASH_EQUAL) {
auto* lhsId = (IdentifierNode*)bin->Left;
std::string varName = lhsId->parserToken.token->token;
int varSlot = lookupVariable(varName);
int rhsSlot = generateExpression(bin->Right);
Opcode arithOp = Opcode::ADD;
if (bin->Operator == TokenType::MINUS_EQUAL) arithOp = Opcode::SUB;
else if (bin->Operator == TokenType::STAR_EQUAL) arithOp = Opcode::MUL;
else if (bin->Operator == TokenType::SLASH_EQUAL) arithOp = Opcode::DIV;
int resultSlot = freshSlot();
emitBinaryOp(arithOp, resultSlot, varSlot, rhsSlot);
emitLoadSlot(varSlot, resultSlot);
return varSlot;
}
// Unary prefix: Left = nullptr (ör: -x, !x)
if (!bin->Left) {
int operandSlot = generateExpression(bin->Right);
int resultSlot = freshSlot();
if (bin->Operator == TokenType::MINUS) {
// -x → 0 - x
int zeroSlot = freshSlot();
emitLoadConst(zeroSlot, 0);
emitBinaryOp(Opcode::SUB, resultSlot, zeroSlot, operandSlot);
} else {
// Diğer unary operatörler → TODO
emitLoadSlot(resultSlot, operandSlot);
}
return resultSlot;
}
// Aritmetik operatörler
switch (bin->Operator) {
case TokenType::PLUS: return generateBinaryArithmetic(Opcode::ADD, bin->Left, bin->Right);
case TokenType::MINUS: return generateBinaryArithmetic(Opcode::SUB, bin->Left, bin->Right);
case TokenType::STAR: return generateBinaryArithmetic(Opcode::MUL, bin->Left, bin->Right);
case TokenType::SLASH: return generateBinaryArithmetic(Opcode::DIV, bin->Left, bin->Right);
case TokenType::PERCENT: return generateBinaryArithmetic(Opcode::MOD, bin->Left, bin->Right);
// Karşılaştırma operatörleri
case TokenType::LESS: return generateBinaryArithmetic(Opcode::LESS, bin->Left, bin->Right);
case TokenType::LESS_EQUAL: return generateBinaryArithmetic(Opcode::LESS_EQUAL, bin->Left, bin->Right);
case TokenType::GREATER: return generateBinaryArithmetic(Opcode::GREATER, bin->Left, bin->Right);
case TokenType::GREATER_EQUAL: return generateBinaryArithmetic(Opcode::GREATER_EQUAL, bin->Left, bin->Right);
case TokenType::EQUAL_EQUAL: return generateBinaryArithmetic(Opcode::EQUAL_EQUAL, bin->Left, bin->Right);
case TokenType::BANG_EQUAL: return generateBinaryArithmetic(Opcode::NOT_EQUAL, bin->Left, bin->Right);
default: {
// Bilinmeyen operatör — boş slot döndür
int slot = freshSlot();
emitLoadConst(slot, 0);
return slot;
}
}
}
// ── Fonksiyon çağrısı: fibonacci(n-1), print(x) ... ─────────────────
case ASTKind::Call: {
auto* call = (CallExpressionNode*)node;
// Hangi fonksiyon çağrılıyor? Callee bir Identifier
std::string fnName;
bool isBuiltin = false;
if (call->callee && call->callee->kind == ASTKind::Identifier) {
auto* calleeId = (IdentifierNode*)call->callee;
if (calleeId->parserToken.token) {
fnName = calleeId->parserToken.token->token;
}
// Builtin kontrolü: resolvedSymbol->isBuiltin
if (calleeId->resolvedSymbol && calleeId->resolvedSymbol->isBuiltin) {
isBuiltin = true;
}
}
// Her argümanı hesapla, sonuçların slot numaralarını topla
std::vector<int> argSlots;
for (ASTNode* arg : call->arguments) {
argSlots.push_back(generateExpression(arg));
}
if (isBuiltin) {
// CALLHOST: host (C++) fonksiyonu çağır (print gibi), dönüş değeri yok
Instruction ins(Opcode::CALLHOST);
ins.functionName = fnName;
ins.argSlots = argSlots;
currentFunction_->instructions.push_back(std::move(ins));
return -1; // Dönüş değeri yok
} else {
// CALL: saQut fonksiyonu çağır, sonucu yeni slota yaz
int destSlot = freshSlot();
Instruction ins(Opcode::CALL);
ins.dest = destSlot;
ins.functionName = fnName;
ins.argSlots = argSlots;
currentFunction_->instructions.push_back(std::move(ins));
return destSlot;
}
}
// ── Postfix: i++, i-- ────────────────────────────────────────────────
case ASTKind::Postfix: {
auto* pf = (PostfixNode*)node;
// Şu anki değeri döndür, sonra artır/azalt
int operandSlot = generateExpression(pf->operand);
int resultSlot = freshSlot(); // dönüş değeri (artırmadan önceki)
emitLoadSlot(resultSlot, operandSlot);
int oneSlot = freshSlot();
emitLoadConst(oneSlot, 1);
int newSlot = freshSlot();
if (pf->Operator == TokenType::PLUS_PLUS) {
emitBinaryOp(Opcode::ADD, newSlot, operandSlot, oneSlot);
} else {
emitBinaryOp(Opcode::SUB, newSlot, operandSlot, oneSlot);
}
emitLoadSlot(operandSlot, newSlot); // orijinal değişkeni güncelle
return resultSlot; // artırmadan önceki değer
}
default:
// Bilinmeyen ifade türü
return freshSlot(); // boş slot (0 değeriyle)
}
}
// ─────────────────────────────────────────────────────────────────────────────
// generateBinaryArithmetic — İkili op için sol+sağ üret, talimat ekle
// ─────────────────────────────────────────────────────────────────────────────
int IRGenerator::generateBinaryArithmetic(Opcode opcode, ASTNode* leftNode, ASTNode* rightNode) {
int leftSlot = generateExpression(leftNode);
int rightSlot = generateExpression(rightNode);
int destSlot = freshSlot();
emitBinaryOp(opcode, destSlot, leftSlot, rightSlot);
return destSlot;
}
// ─────────────────────────────────────────────────────────────────────────────
// Slot yönetimi
// ─────────────────────────────────────────────────────────────────────────────
int IRGenerator::freshSlot() {
return nextSlot_++;
}
void IRGenerator::registerVariable(const std::string& name, int slot) {
nameToSlot_[name] = slot;
}
int IRGenerator::lookupVariable(const std::string& name) {
auto it = nameToSlot_.find(name);
if (it == nameToSlot_.end()) {
// Bu noktaya normalde gelinmemeli; sembol toplayıcı E001 üretmiş olur.
// Yine de çökmemek için 0 döndür.
return 0;
}
return it->second;
}
// ─────────────────────────────────────────────────────────────────────────────
// Talimat yazma yardımcıları
// ─────────────────────────────────────────────────────────────────────────────
void IRGenerator::emitLoadConst(int destSlot, int value) {
Instruction ins(Opcode::LOAD_CONST);
ins.dest = destSlot;
ins.intValue = value;
currentFunction_->instructions.push_back(std::move(ins));
}
void IRGenerator::emitLoadSlot(int destSlot, int srcSlot) {
Instruction ins(Opcode::LOAD_SLOT);
ins.dest = destSlot;
ins.src = srcSlot;
currentFunction_->instructions.push_back(std::move(ins));
}
void IRGenerator::emitBinaryOp(Opcode op, int destSlot, int leftSlot, int rightSlot) {
Instruction ins(op);
ins.dest = destSlot;
ins.left = leftSlot;
ins.right = rightSlot;
currentFunction_->instructions.push_back(std::move(ins));
}
void IRGenerator::emitReturn(int srcSlot) {
Instruction ins(Opcode::RETURN);
ins.src = srcSlot;
currentFunction_->instructions.push_back(std::move(ins));
}
int IRGenerator::emitJumpUnconditional(int targetInstrIndex) {
Instruction ins(Opcode::JMP);
ins.jumpTarget = targetInstrIndex;
currentFunction_->instructions.push_back(std::move(ins));
return (int)currentFunction_->instructions.size() - 1;
}
int IRGenerator::emitJumpIfFalse(int condSlot) {
Instruction ins(Opcode::JIF_FALSE);
ins.cond = condSlot;
ins.jumpTarget = -1; // henüz bilinmiyor — patchJump() bekliyor
currentFunction_->instructions.push_back(std::move(ins));
// Bu instruction'ın indeksini döndür (backpatch için)
return (int)currentFunction_->instructions.size() - 1;
}
void IRGenerator::patchJump(int instrIndex) {
// instrIndex'teki JMP veya JIF_FALSE'un hedefini şu anki konuma doldur
currentFunction_->instructions[instrIndex].jumpTarget = currentInstrIndex();
}
int IRGenerator::currentInstrIndex() const {
return (int)currentFunction_->instructions.size();
}

View File

@ -1,84 +0,0 @@
// ============================================================================
// saQut IR — IRGenerator (AST → IR Dönüşümü)
//
// AST'yi (parse edilmiş kaynak kodu) Instruction listelerine çevirir.
// Her fonksiyon için bir IRFunction üretir, hepsini IRProgram'a toplar.
//
// SLOT ATAMA STRATEJİSİ:
// - Her fonksiyon üretiminde nextSlot_ sıfırdan başlar.
// - Parametreler 0, 1, 2, ... slotlarına sırayla atanır.
// - Sonraki her değişken veya geçici sonuç freshSlot() ile yeni slot alır.
// - Slotlar asla geri verilmez (basitlik öncelikli).
// - Fonksiyon bitince nextSlot_ = slotCount.
//
// SINIRLAMALAR (fibonacci için yeterli, genel dil için TODO):
// - Aynı isimli iki değişken farklı iç kapsamlarda olsa bile çakışır.
// (fibonacci.sqt'de bu durum yok; gelecekte scope-aware slot atama gerekir.)
// - Sadece int değerler desteklenir (Value.kind şu an hep Int).
// ============================================================================
#ifndef SAQUT_IR_GENERATOR
#define SAQUT_IR_GENERATOR
#include <string>
#include <unordered_map>
#include "ir/ir_program.hpp"
#include "symbol/symbol_table.hpp"
#include "parser/ast_node.hpp"
class IRGenerator {
public:
// Ana giriş noktası: programNode = ProgramNode, tablo = sembol tablosu
IRProgram generate(ASTNode* programNode, SymbolTable& symbolTable);
private:
// ── Fonksiyon üretimi ─────────────────────────────────────────────────
void generateFunction(ASTNode* functionDeclNode);
// ── Deyim (statement) üretimi — talimat listesine yazar ──────────────
void generateStatement(ASTNode* node);
// ── İfade (expression) üretimi — sonucun slotunu döndürür ────────────
// Sonuç her zaman bir slotta bulunur. Identifier zaten bir slotta,
// hesaplamalar freshSlot() ile yeni slot alır.
int generateExpression(ASTNode* node);
// ── İkili operatör (binary op) için ortak yardımcı ───────────────────
int generateBinaryArithmetic(Opcode opcode, ASTNode* leftNode, ASTNode* rightNode);
// ── Slot yönetimi ─────────────────────────────────────────────────────
int freshSlot(); // Yeni slot numarası al (nextSlot_++)
void registerVariable(const std::string& name, int slot); // name → slot kaydı
int lookupVariable(const std::string& name); // name → slot (bulunamazsa hata)
// ── Talimat yazma yardımcıları ────────────────────────────────────────
// Talimatları currentFunction_->instructions'a ekler.
void emitLoadConst(int destSlot, int value);
void emitLoadSlot(int destSlot, int srcSlot);
void emitBinaryOp(Opcode op, int destSlot, int leftSlot, int rightSlot);
void emitReturn(int srcSlot);
// Koşulsuz atlama yazar; instruction indeksini döndürür (backpatch için).
// Hedef bilinmiyorsa -1 geçilir, patchJump() ile doldurulur.
int emitJumpUnconditional(int targetInstrIndex);
// JIF_FALSE talimatını -1 hedefle yazar, instruction indeksini döndürür.
// Döndürülen indeks ileride patchJump() ile doldurulur (backpatch).
int emitJumpIfFalse(int condSlot);
// Daha önce -1 hedefle yazılan jump'ın hedefini şu anki pozisyona doldur.
void patchJump(int instrIndex);
// Şu an kaç talimat üretildi? (jump hedefi belirlemek için)
int currentInstrIndex() const;
// ── Per-function üretim durumu ────────────────────────────────────────
IRFunction* currentFunction_ = nullptr; // şu an üretilen fonksiyon
int nextSlot_ = 0; // sıradaki boş slot numarası
// Değişken ismi → slot numarası.
// Sınırlama: aynı isimdeki farklı scope değişkenleri çakışır (TODO).
std::unordered_map<std::string, int> nameToSlot_;
};
#endif // SAQUT_IR_GENERATOR

View File

@ -1,11 +0,0 @@
#include "ir/ir_program.hpp"
#include <iostream>
void IRProgram::dump() const {
std::cout << "IR DUMP\n\n";
for (const auto& name : functionOrder) {
auto it = functions.find(name);
if (it != functions.end()) it->second.dump();
}
std::cout << "END\n";
}

View File

@ -1,48 +0,0 @@
// ============================================================================
// saQut IR — IRProgram (Bir .sqt Dosyasının Tüm IR İçeriği)
//
// IRProgram, üretilen tüm fonksiyonları tutar.
// Interpreter programı çalıştırmak için bu yapıyı kullanır.
//
// NEDEN İKİ YAPIDA TUTUYORUZ?
// - functionOrder: fonksiyonları tanımlandıkları sırayla tutar (dump için)
// - functions (unordered_map): CALL instruction'larında isimle hızlı arama için
//
// NOT: unordered_map değer semantiğiyle (IRFunction by value) tutar.
// findFunction() bir pointer döndürür — bu pointer tüm addFunction() çağrıları
// bittikten sonra alınmalıdır. Interpreter program üretildikten sonra çalıştığı
// için bu kural otomatik olarak sağlanır.
// ============================================================================
#ifndef SAQUT_IR_PROGRAM
#define SAQUT_IR_PROGRAM
#include <string>
#include <unordered_map>
#include <vector>
#include "ir/ir_function.hpp"
struct IRProgram {
// Fonksiyon adı → IRFunction (hızlı arama için)
std::unordered_map<std::string, IRFunction> functions;
// Ekleme sırası (dump'ta orijinal sırayla göstermek için)
std::vector<std::string> functionOrder;
// Yeni fonksiyon ekle
void addFunction(IRFunction fn) {
functionOrder.push_back(fn.name);
functions.emplace(fn.name, std::move(fn));
}
// İsimle ara — bulunamazsa nullptr döner
IRFunction* findFunction(const std::string& name) {
auto it = functions.find(name);
return (it != functions.end()) ? &it->second : nullptr;
}
// Tüm fonksiyonları ekleme sırasıyla yazdır
void dump() const;
};
#endif // SAQUT_IR_PROGRAM

View File

@ -79,7 +79,7 @@ std::string Lexer::getPositionRange() {
// --------------------------------------------------------------------------
// include: Belirtilen kelime mevcut konumda başlıyor mu?
// --------------------------------------------------------------------------
bool Lexer::include(std::string_view word, bool accept) {
bool Lexer::include(std::string word, bool accept) {
beginPosition();
for (size_t i = 0; i < word.size(); i++) {
if (isEnd()) {

View File

@ -22,7 +22,6 @@
#include <iostream>
#include <string>
#include <string_view>
#include <vector>
#include "core/location.hpp"
#include "core/sourcefile.hpp"
@ -68,7 +67,7 @@ public:
std::string getPositionRange(); // Pozisyon aralığındaki metni döndür
// --- Desen Eşleme ---
bool include(std::string_view word, bool accept = true);
bool include(std::string word, bool accept = true);
// --- Konum Okuma/Yazma ---
int getOffset(); // Mevcut offset'i döndür

View File

@ -27,8 +27,6 @@
#include "cli/commands/tokens.hpp"
#include "cli/commands/ast.hpp"
#include "cli/commands/symbols.hpp"
#include "cli/commands/check.hpp"
#include "cli/commands/ir.hpp"
int main(int argc, char* argv[]) {
// Komutları kaydet
@ -50,14 +48,6 @@ int main(int argc, char* argv[]) {
"Sembol tablosu (fonksiyonlar, değişkenler)",
false, cmdSymbols});
cli.registerCommand({"check",
"Semantik analiz — tip denetimi + yapısal doğrulama",
false, cmdCheck});
cli.registerCommand({"ir",
"IR talimat listesini göster (ara temsil — bytecode öncesi)",
false, cmdIr});
// --- Gelecek komutlar (TODO) ---
cli.registerCommand({"compile",
"TODO: Kaynak kodu derle",

View File

@ -1,286 +0,0 @@
// ============================================================================
// saQut — AST Derin Klonlama (ADR-007)
//
// deepClone(node): tüm ağacı kopyalar, parent pointer'ları yeniden bağlar.
// IdentifierNode::resolvedSymbol orijinal sembol tablosunu gösterir (read-only,
// optimizasyon için yeterli — ADR-007).
// ============================================================================
#ifndef SAQUT_OPT_AST_CLONE
#define SAQUT_OPT_AST_CLONE
#include "parser/ast_node.hpp"
#include "parser/nodes/program.hpp"
#include "parser/nodes/declarations.hpp"
#include "parser/nodes/statements.hpp"
#include "parser/nodes/expressions.hpp"
#include "parser/nodes/binary_expr.hpp"
#include "parser/nodes/literal.hpp"
#include "parser/nodes/identifier.hpp"
inline ASTNode* deepClone(ASTNode* node);
// ── Yardımcı: typed pointer klonla ve parent'ı bağla ────────────────────────
static inline ASTNode* cloneChild(ASTNode* child, ASTNode* newParent) {
if (!child) return nullptr;
ASTNode* c = deepClone(child);
c->parent = newParent;
return c;
}
inline ASTNode* deepClone(ASTNode* node) {
if (!node) return nullptr;
switch (node->kind) {
// ── ProgramNode ──────────────────────────────────────────────────────────
case ASTKind::Program: {
auto* src = static_cast<ProgramNode*>(node);
auto* dst = new ProgramNode();
dst->loc = src->loc;
for (auto* ch : src->getChildren()) dst->addChild(deepClone(ch));
return dst;
}
// ── FunctionDeclNode ─────────────────────────────────────────────────────
case ASTKind::FunctionDecl: {
auto* src = static_cast<FunctionDeclNode*>(node);
auto* dst = new FunctionDeclNode();
dst->loc = src->loc;
dst->name = src->name;
dst->returnType = src->returnType;
for (auto* p : src->params) {
auto* cp = static_cast<VariableDeclNode*>(deepClone(p));
cp->parent = dst;
dst->params.push_back(cp);
}
for (auto* ch : src->getChildren()) dst->addChild(deepClone(ch));
return dst;
}
// ── VariableDeclNode ─────────────────────────────────────────────────────
case ASTKind::VariableDecl: {
auto* src = static_cast<VariableDeclNode*>(node);
auto* dst = new VariableDeclNode();
dst->loc = src->loc;
dst->name = src->name;
dst->varType = src->varType;
dst->isReachable = src->isReachable;
if (src->initExpr) dst->initExpr = cloneChild(src->initExpr, dst);
for (auto* ch : src->getChildren()) dst->addChild(deepClone(ch));
return dst;
}
// ── StructDeclNode ───────────────────────────────────────────────────────
case ASTKind::StructDecl: {
auto* src = static_cast<StructDeclNode*>(node);
auto* dst = new StructDeclNode();
dst->loc = src->loc;
dst->name = src->name;
for (auto* ch : src->getChildren()) dst->addChild(deepClone(ch));
return dst;
}
// ── BlockNode ────────────────────────────────────────────────────────────
case ASTKind::Block: {
auto* src = static_cast<BlockNode*>(node);
auto* dst = new BlockNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
for (auto* ch : src->getChildren()) dst->addChild(deepClone(ch));
return dst;
}
// ── IfStatementNode ──────────────────────────────────────────────────────
case ASTKind::IfStatement: {
auto* src = static_cast<IfStatementNode*>(node);
auto* dst = new IfStatementNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
dst->condition = cloneChild(src->condition, dst);
dst->thenBranch = cloneChild(src->thenBranch, dst);
dst->elseBranch = cloneChild(src->elseBranch, dst);
return dst;
}
// ── WhileStatementNode ───────────────────────────────────────────────────
case ASTKind::WhileStatement: {
auto* src = static_cast<WhileStatementNode*>(node);
auto* dst = new WhileStatementNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
dst->condition = cloneChild(src->condition, dst);
dst->body = cloneChild(src->body, dst);
return dst;
}
// ── ForStatementNode ─────────────────────────────────────────────────────
case ASTKind::ForStatement: {
auto* src = static_cast<ForStatementNode*>(node);
auto* dst = new ForStatementNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
dst->init = cloneChild(src->init, dst);
dst->condition = cloneChild(src->condition, dst);
dst->update = cloneChild(src->update, dst);
dst->body = cloneChild(src->body, dst);
return dst;
}
// ── DoWhileStatementNode ─────────────────────────────────────────────────
case ASTKind::DoWhileStatement: {
auto* src = static_cast<DoWhileStatementNode*>(node);
auto* dst = new DoWhileStatementNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
dst->body = cloneChild(src->body, dst);
dst->condition = cloneChild(src->condition, dst);
return dst;
}
// ── ReturnStatementNode ──────────────────────────────────────────────────
case ASTKind::ReturnStatement: {
auto* src = static_cast<ReturnStatementNode*>(node);
auto* dst = new ReturnStatementNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
dst->value = cloneChild(src->value, dst);
return dst;
}
// ── BreakStatementNode ───────────────────────────────────────────────────
case ASTKind::BreakStatement: {
auto* src = static_cast<BreakStatementNode*>(node);
auto* dst = new BreakStatementNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
return dst;
}
// ── ContinueStatementNode ────────────────────────────────────────────────
case ASTKind::ContinueStatement: {
auto* src = static_cast<ContinueStatementNode*>(node);
auto* dst = new ContinueStatementNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
return dst;
}
// ── ExpressionStatementNode ──────────────────────────────────────────────
case ASTKind::ExpressionStatement: {
auto* src = static_cast<ExpressionStatementNode*>(node);
auto* dst = new ExpressionStatementNode();
dst->loc = src->loc;
dst->isReachable = src->isReachable;
dst->expression = cloneChild(src->expression, dst);
return dst;
}
// ── BinaryExpressionNode ─────────────────────────────────────────────────
case ASTKind::BinaryExpression: {
auto* src = static_cast<BinaryExpressionNode*>(node);
auto* dst = new BinaryExpressionNode();
dst->loc = src->loc;
dst->Operator = src->Operator;
dst->resolvedType = src->resolvedType;
dst->isConstant = src->isConstant;
dst->Left = cloneChild(src->Left, dst);
dst->Right = cloneChild(src->Right, dst);
return dst;
}
// ── LiteralNode ──────────────────────────────────────────────────────────
case ASTKind::Literal: {
auto* src = static_cast<LiteralNode*>(node);
auto* dst = new LiteralNode();
dst->loc = src->loc;
dst->literalType = src->literalType;
dst->literalBase = src->literalBase;
dst->isFloatValue = src->isFloatValue;
dst->lexerToken = src->lexerToken; // orijinal token, salt-okunur
dst->parserToken = src->parserToken; // aynı token pointer, salt-okunur
dst->resolvedType = src->resolvedType;
dst->isConstant = src->isConstant;
dst->hasDirectValue = src->hasDirectValue;
dst->directIntValue = src->directIntValue;
return dst;
}
// ── IdentifierNode ───────────────────────────────────────────────────────
case ASTKind::Identifier: {
auto* src = static_cast<IdentifierNode*>(node);
auto* dst = new IdentifierNode();
dst->loc = src->loc;
dst->lexerToken = src->lexerToken;
dst->parserToken = src->parserToken;
dst->resolvedSymbol = src->resolvedSymbol; // orijinal tablo, salt-okunur
dst->resolvedType = src->resolvedType;
dst->isConstant = src->isConstant;
return dst;
}
// ── PostfixNode ──────────────────────────────────────────────────────────
case ASTKind::Postfix: {
auto* src = static_cast<PostfixNode*>(node);
auto* dst = new PostfixNode();
dst->loc = src->loc;
dst->Operator = src->Operator;
dst->resolvedType = src->resolvedType;
dst->isConstant = src->isConstant;
dst->operand = cloneChild(src->operand, dst);
return dst;
}
// ── CallExpressionNode ───────────────────────────────────────────────────
case ASTKind::Call: {
auto* src = static_cast<CallExpressionNode*>(node);
auto* dst = new CallExpressionNode();
dst->loc = src->loc;
dst->resolvedType = src->resolvedType;
dst->isConstant = src->isConstant;
dst->callee = cloneChild(src->callee, dst);
for (auto* arg : src->arguments) {
ASTNode* ca = deepClone(arg);
ca->parent = dst;
dst->arguments.push_back(ca);
}
return dst;
}
// ── MemberAccessNode ─────────────────────────────────────────────────────
case ASTKind::MemberAccess: {
auto* src = static_cast<MemberAccessNode*>(node);
auto* dst = new MemberAccessNode();
dst->loc = src->loc;
dst->resolvedType = src->resolvedType;
dst->isConstant = src->isConstant;
dst->member = src->member;
dst->arrow = src->arrow;
dst->object = cloneChild(src->object, dst);
return dst;
}
// ── IndexExpressionNode ──────────────────────────────────────────────────
case ASTKind::IndexExpression: {
auto* src = static_cast<IndexExpressionNode*>(node);
auto* dst = new IndexExpressionNode();
dst->loc = src->loc;
dst->resolvedType = src->resolvedType;
dst->isConstant = src->isConstant;
dst->object = cloneChild(src->object, dst);
dst->index = cloneChild(src->index, dst);
return dst;
}
// ── UnaryExpression ──────────────────────────────────────────────────────
// UnaryExpression şu anda ayrı bir sınıf değil; parser tarafından
// BinaryExpression veya PostfixNode olarak temsil ediliyor.
// Gelecekte eklenmesi gerekirse buraya eklenecek.
default:
// Bilinmeyen node tipi — klonlanamaz; orijinal döndür (güvenli değil ama
// derleme aşamasında tüm tipler yukarıda kaplanmalı).
return node;
}
}
#endif // SAQUT_OPT_AST_CLONE

View File

@ -1,363 +0,0 @@
// ============================================================================
// saQut — Sabit Katlama (Constant Folding) Pass (ADR-009)
//
// BinaryExpression(Literal, OP, Literal) → Literal
// Sadece tam sayı sabitleri katlanır; kayan nokta şimdilik dışarıda.
// Derleme zamanı sıfıra bölme: W002 uyarısı verilir, katlama yapılmaz.
// ============================================================================
#ifndef SAQUT_OPT_CONSTANT_FOLDING
#define SAQUT_OPT_CONSTANT_FOLDING
#include <string>
#include "opt/optimization_pass.hpp"
#include "parser/nodes/binary_expr.hpp"
#include "parser/nodes/literal.hpp"
#include "parser/nodes/identifier.hpp"
#include "parser/nodes/statements.hpp"
#include "parser/nodes/expressions.hpp"
#include "parser/nodes/declarations.hpp"
#include "parser/nodes/program.hpp"
#include "diagnostic/diagnostic_engine.hpp"
class ConstantFoldingPass : public OptimizationPass {
public:
explicit ConstantFoldingPass(DiagnosticEngine& diag) : diag_(diag) {}
bool run(ASTNode* root, SymbolTable*) override {
changed_ = false;
fold(root);
return changed_;
}
const std::string& name() const override {
static std::string n = "constant-folding";
return n;
}
private:
DiagnosticEngine& diag_;
bool changed_ = false;
// ── Literal değer okuma ──────────────────────────────────────────────────
static bool isIntLit(ASTNode* node) {
auto* lit = dynamic_cast<LiteralNode*>(node);
return lit && lit->literalType == LiteralType::INTEGER;
}
// Boolean veya integer literal — unary ! için her ikisi de geçerli
static bool isScalarLit(ASTNode* node) {
auto* lit = dynamic_cast<LiteralNode*>(node);
return lit && (lit->literalType == LiteralType::INTEGER ||
lit->literalType == LiteralType::BOOLEAN);
}
static int getIntVal(LiteralNode* lit) {
if (lit->hasDirectValue) return lit->directIntValue;
if (lit->parserToken.token) return std::stoi(lit->parserToken.token->token);
return 0;
}
// Boolean literali int'e çevir: "true"→1, "false"→0
static int getScalarVal(LiteralNode* lit) {
if (lit->literalType == LiteralType::BOOLEAN) {
if (!lit->parserToken.token) return 0;
return (lit->parserToken.token->token == "true") ? 1 : 0;
}
return getIntVal(lit);
}
// Unary operatör katlama
static bool canFoldUnary(TokenType op) {
switch (op) {
case TokenType::BANG: // !
case TokenType::TILDE: // ~
case TokenType::MINUS: // - (negatif)
case TokenType::PLUS: // + (pozitif, no-op)
return true;
default:
return false;
}
}
static int computeUnary(TokenType op, int v) {
switch (op) {
case TokenType::BANG: return !v ? 1 : 0;
case TokenType::TILDE: return ~v;
case TokenType::MINUS: return -v;
case TokenType::PLUS: return v;
default: return v;
}
}
// ── Operatör hesaplama ───────────────────────────────────────────────────
static bool canFoldOp(TokenType op) {
switch (op) {
case TokenType::PLUS:
case TokenType::MINUS:
case TokenType::STAR:
case TokenType::SLASH:
case TokenType::PERCENT:
case TokenType::EQUAL_EQUAL:
case TokenType::BANG_EQUAL:
case TokenType::LESS:
case TokenType::GREATER:
case TokenType::LESS_EQUAL:
case TokenType::GREATER_EQUAL:
case TokenType::AMPERSAND_AMPERSAND:
case TokenType::PIPE_PIPE:
return true;
default:
return false;
}
}
static int computeOp(TokenType op, int l, int r) {
switch (op) {
case TokenType::PLUS: return l + r;
case TokenType::MINUS: return l - r;
case TokenType::STAR: return l * r;
case TokenType::SLASH: return l / r;
case TokenType::PERCENT: return l % r;
case TokenType::EQUAL_EQUAL: return l == r ? 1 : 0;
case TokenType::BANG_EQUAL: return l != r ? 1 : 0;
case TokenType::LESS: return l < r ? 1 : 0;
case TokenType::GREATER: return l > r ? 1 : 0;
case TokenType::LESS_EQUAL: return l <= r ? 1 : 0;
case TokenType::GREATER_EQUAL: return l >= r ? 1 : 0;
case TokenType::AMPERSAND_AMPERSAND: return (l && r) ? 1 : 0;
case TokenType::PIPE_PIPE: return (l || r) ? 1 : 0;
default: return 0;
}
}
// ── Sentetik literal oluştur ─────────────────────────────────────────────
static LiteralNode* makeFoldedLit(int value, const SourceLocation& loc, const Type& type) {
auto* lit = new LiteralNode();
lit->loc = loc;
lit->literalType = LiteralType::INTEGER;
lit->hasDirectValue = true;
lit->directIntValue = value;
lit->resolvedType = type;
lit->isConstant = true;
return lit;
}
// ── Ana ziyaretçi: bottom-up, pointer-by-reference ───────────────────────
// Dönüş değeri: aynı node veya yerine geçen yeni node.
// Folding yapıldıysa orijinal node silinir, yeni node döndürülür.
ASTNode* fold(ASTNode* node) {
if (!node) return nullptr;
switch (node->kind) {
// ── İfadeler ────────────────────────────────────────────────────────
case ASTKind::BinaryExpression: {
auto* bin = static_cast<BinaryExpressionNode*>(node);
// Alt ağaçları önce kat
ASTNode* newLeft = fold(bin->Left);
if (newLeft != bin->Left) { bin->Left = newLeft; if (newLeft) newLeft->parent = bin; }
ASTNode* newRight = fold(bin->Right);
if (newRight != bin->Right) { bin->Right = newRight; if (newRight) newRight->parent = bin; }
// ── Unary dal: Left==nullptr → !x, ~x, -x, +x ──────────────────
if (bin->Left == nullptr) {
if (!isScalarLit(bin->Right)) return bin;
if (!canFoldUnary(bin->Operator)) return bin;
auto* rlit = static_cast<LiteralNode*>(bin->Right);
int rv = getScalarVal(rlit);
int result = computeUnary(bin->Operator, rv);
LiteralNode* lit = makeFoldedLit(result, bin->loc, bin->resolvedType);
delete bin->Right;
delete bin;
changed_ = true;
return lit;
}
// ── Binary dal: iki taraf da tam sayı sabiti ────────────────────
if (!isIntLit(bin->Left) || !isIntLit(bin->Right)) return bin;
if (!canFoldOp(bin->Operator)) return bin;
auto* llit = static_cast<LiteralNode*>(bin->Left);
auto* rlit = static_cast<LiteralNode*>(bin->Right);
int lv = getIntVal(llit);
int rv = getIntVal(rlit);
// W002: Derleme zamanı sıfıra bölme
if ((bin->Operator == TokenType::SLASH || bin->Operator == TokenType::PERCENT) && rv == 0) {
Diagnostic d;
d.level = DiagLevel::Warning;
d.code = "W002";
d.loc = bin->loc;
d.message = "Derleme zamanı sıfıra bölme — katlama yapılmadı";
diag_.report(d);
return bin; // fold etme
}
int result = computeOp(bin->Operator, lv, rv);
LiteralNode* lit = makeFoldedLit(result, bin->loc, bin->resolvedType);
delete bin->Left;
delete bin->Right;
delete bin;
changed_ = true;
return lit;
}
case ASTKind::Postfix: {
auto* pf = static_cast<PostfixNode*>(node);
ASTNode* newOp = fold(pf->operand);
if (newOp != pf->operand) { pf->operand = newOp; if (newOp) newOp->parent = pf; }
return pf;
}
case ASTKind::Call: {
auto* call = static_cast<CallExpressionNode*>(node);
if (call->callee) {
ASTNode* nc = fold(call->callee);
if (nc != call->callee) { call->callee = nc; if (nc) nc->parent = call; }
}
for (auto*& arg : call->arguments) {
ASTNode* na = fold(arg);
if (na != arg) { arg = na; if (na) na->parent = call; }
}
return call;
}
case ASTKind::MemberAccess: {
auto* ma = static_cast<MemberAccessNode*>(node);
ASTNode* no = fold(ma->object);
if (no != ma->object) { ma->object = no; if (no) no->parent = ma; }
return ma;
}
case ASTKind::IndexExpression: {
auto* ix = static_cast<IndexExpressionNode*>(node);
ASTNode* no = fold(ix->object);
if (no != ix->object) { ix->object = no; if (no) no->parent = ix; }
ASTNode* ni = fold(ix->index);
if (ni != ix->index) { ix->index = ni; if (ni) ni->parent = ix; }
return ix;
}
// Literal ve Identifier değişmez
case ASTKind::Literal:
case ASTKind::Identifier:
return node;
// ── Deyimler (çocuklara iner) ────────────────────────────────────────
case ASTKind::ExpressionStatement: {
auto* es = static_cast<ExpressionStatementNode*>(node);
if (es->expression) {
ASTNode* ne = fold(es->expression);
if (ne != es->expression) { es->expression = ne; if (ne) ne->parent = es; }
}
return es;
}
case ASTKind::ReturnStatement: {
auto* rs = static_cast<ReturnStatementNode*>(node);
if (rs->value) {
ASTNode* nv = fold(rs->value);
if (nv != rs->value) { rs->value = nv; if (nv) nv->parent = rs; }
}
return rs;
}
case ASTKind::VariableDecl: {
auto* vd = static_cast<VariableDeclNode*>(node);
if (vd->initExpr) {
ASTNode* ni = fold(vd->initExpr);
if (ni != vd->initExpr) { vd->initExpr = ni; if (ni) ni->parent = vd; }
}
for (auto*& ch : vd->getChildren()) {
ASTNode* nc = fold(ch);
if (nc != ch) { ch = nc; if (nc) nc->parent = vd; }
}
return vd;
}
case ASTKind::IfStatement: {
auto* ifs = static_cast<IfStatementNode*>(node);
if (ifs->condition) {
ASTNode* nc = fold(ifs->condition);
if (nc != ifs->condition) { ifs->condition = nc; if (nc) nc->parent = ifs; }
}
if (ifs->thenBranch) fold(ifs->thenBranch);
if (ifs->elseBranch) fold(ifs->elseBranch);
return ifs;
}
case ASTKind::WhileStatement: {
auto* ws = static_cast<WhileStatementNode*>(node);
if (ws->condition) {
ASTNode* nc = fold(ws->condition);
if (nc != ws->condition) { ws->condition = nc; if (nc) nc->parent = ws; }
}
if (ws->body) fold(ws->body);
return ws;
}
case ASTKind::ForStatement: {
auto* fs = static_cast<ForStatementNode*>(node);
if (fs->init) { ASTNode* n = fold(fs->init); if (n != fs->init) { fs->init = n; if (n) n->parent = fs; } }
if (fs->condition) { ASTNode* n = fold(fs->condition); if (n != fs->condition) { fs->condition = n; if (n) n->parent = fs; } }
if (fs->update) { ASTNode* n = fold(fs->update); if (n != fs->update) { fs->update = n; if (n) n->parent = fs; } }
if (fs->body) fold(fs->body);
return fs;
}
case ASTKind::DoWhileStatement: {
auto* dw = static_cast<DoWhileStatementNode*>(node);
if (dw->body) fold(dw->body);
if (dw->condition) {
ASTNode* nc = fold(dw->condition);
if (nc != dw->condition) { dw->condition = nc; if (nc) nc->parent = dw; }
}
return dw;
}
// ── Blok ve üst düzey ────────────────────────────────────────────────
case ASTKind::Block: {
auto* blk = static_cast<BlockNode*>(node);
for (auto*& ch : blk->getChildren()) {
ASTNode* nc = fold(ch);
if (nc != ch) { ch = nc; if (nc) nc->parent = blk; }
}
return blk;
}
case ASTKind::FunctionDecl: {
auto* fn = static_cast<FunctionDeclNode*>(node);
for (auto*& ch : fn->getChildren()) {
ASTNode* nc = fold(ch);
if (nc != ch) { ch = nc; if (nc) nc->parent = fn; }
}
return fn;
}
case ASTKind::Program: {
auto* prog = static_cast<ProgramNode*>(node);
for (auto*& ch : prog->getChildren()) {
ASTNode* nc = fold(ch);
if (nc != ch) { ch = nc; if (nc) nc->parent = prog; }
}
return prog;
}
default:
// Bilinmeyen veya işlenmeyen node — olduğu gibi bırak
for (auto*& ch : node->getChildren()) {
ASTNode* nc = fold(ch);
if (nc != ch) { ch = nc; if (nc) nc->parent = node; }
}
return node;
}
}
};
#endif // SAQUT_OPT_CONSTANT_FOLDING

View File

@ -1,110 +0,0 @@
// ============================================================================
// saQut — Ölü Kod Eleme (Dead Code Elimination) Pass (ADR-009)
//
// Bir Block içinde ilk return/break/continue'dan sonra gelen deyimler
// erişilemez (unreachable) olarak işaretlenir ve silinir.
// ============================================================================
#ifndef SAQUT_OPT_DEAD_CODE_ELIM
#define SAQUT_OPT_DEAD_CODE_ELIM
#include <string>
#include <algorithm>
#include "opt/optimization_pass.hpp"
#include "parser/nodes/statements.hpp"
#include "parser/nodes/declarations.hpp"
#include "parser/nodes/expressions.hpp"
#include "parser/nodes/program.hpp"
class DeadCodeElimPass : public OptimizationPass {
public:
bool run(ASTNode* root, SymbolTable*) override {
changed_ = false;
visit(root);
return changed_;
}
const std::string& name() const override {
static std::string n = "dead-code-elim";
return n;
}
private:
bool changed_ = false;
void visit(ASTNode* node) {
if (!node) return;
switch (node->kind) {
// ── Block: ana DCE mantığı ───────────────────────────────────────────
case ASTKind::Block: {
auto* blk = static_cast<BlockNode*>(node);
auto& ch = blk->getChildren();
bool term = false;
for (auto* child : ch) {
if (term) {
// Bu deyim erişilemez
if (auto* sn = dynamic_cast<StatementNode*>(child)) {
if (sn->isReachable) {
sn->isReachable = false;
changed_ = true;
}
}
}
if (child->kind == ASTKind::ReturnStatement ||
child->kind == ASTKind::BreakStatement ||
child->kind == ASTKind::ContinueStatement)
term = true;
}
// Erişilemez çocukları sil ve vektörden çıkar
ch.erase(std::remove_if(ch.begin(), ch.end(),
[](ASTNode* n) {
auto* sn = dynamic_cast<StatementNode*>(n);
return sn && !sn->isReachable;
}), ch.end());
// Alt bloklara da in
for (auto* child : ch) visit(child);
break;
}
// ── İf/While/For gövdelerine in ─────────────────────────────────────
case ASTKind::IfStatement: {
auto* ifs = static_cast<IfStatementNode*>(node);
visit(ifs->thenBranch);
visit(ifs->elseBranch);
break;
}
case ASTKind::WhileStatement: {
auto* ws = static_cast<WhileStatementNode*>(node);
visit(ws->body);
break;
}
case ASTKind::ForStatement: {
auto* fs = static_cast<ForStatementNode*>(node);
visit(fs->body);
break;
}
case ASTKind::DoWhileStatement: {
auto* dw = static_cast<DoWhileStatementNode*>(node);
visit(dw->body);
break;
}
// ── Üst düzey: fonksiyon gövdelerine in ─────────────────────────────
case ASTKind::FunctionDecl:
case ASTKind::Program:
default:
for (auto* ch : node->getChildren()) visit(ch);
break;
}
}
};
#endif // SAQUT_OPT_DEAD_CODE_ELIM

View File

@ -1,56 +0,0 @@
// ============================================================================
// saQut — Optimizasyon Yöneticisi (ADR-007, ADR-009)
//
// 1. AST'yi klonlar (orijinal dokunulmaz).
// 2. Etkin pass'leri fixpoint döngüsüyle çalıştırır.
// 3. Optimize edilmiş klon sahipliğini döndürür (caller delete eder).
//
// Fixpoint garantisi: her pass yalnızca küçülten dönüşümler yapar
// (katlama: n düğüm → 1 düğüm; DCE: düğüm siler). Büyüten pass
// (inlining vb.) eklenirse maxFixpointRounds tavanı zorunludur (ADR-009).
// ============================================================================
#ifndef SAQUT_OPT_MANAGER
#define SAQUT_OPT_MANAGER
#include <memory>
#include <vector>
#include "core/config.hpp"
#include "opt/ast_clone.hpp"
#include "opt/optimization_pass.hpp"
#include "opt/constant_folding.hpp"
#include "opt/dead_code_elim.hpp"
#include "diagnostic/diagnostic_engine.hpp"
#include "symbol/symbol_table.hpp"
class OptimizationManager {
public:
explicit OptimizationManager(const CompilerConfig& cfg, DiagnosticEngine& diag) {
if (cfg.optConstantFolding)
passes_.push_back(std::make_unique<ConstantFoldingPass>(diag));
if (cfg.optDeadCodeElim)
passes_.push_back(std::make_unique<DeadCodeElimPass>());
maxRounds_ = cfg.maxFixpointRounds;
}
// optimize: AST'yi klonlar ve optimize edilmiş kopyayı döndürür.
// Dönen pointer caller'a aittir (delete edilmeli).
ASTNode* optimize(ASTNode* root, SymbolTable* table) {
ASTNode* clone = deepClone(root);
for (int round = 0; round < maxRounds_; ++round) {
bool anyChange = false;
for (auto& pass : passes_)
if (pass->run(clone, table)) anyChange = true;
if (!anyChange) break;
}
return clone;
}
private:
std::vector<std::unique_ptr<OptimizationPass>> passes_;
int maxRounds_ = 10;
};
#endif // SAQUT_OPT_MANAGER

View File

@ -1,19 +0,0 @@
#ifndef SAQUT_OPT_PASS
#define SAQUT_OPT_PASS
#include <string>
#include "parser/ast_node.hpp"
#include "symbol/symbol_table.hpp"
class OptimizationPass {
public:
virtual ~OptimizationPass() = default;
// Pass'i çalıştırır. En az bir dönüşüm yaptıysa true döndürür.
// root: optimize edilecek klonlanmış AST kökü (sahiplik değişmez).
virtual bool run(ASTNode* root, SymbolTable* table) = 0;
virtual const std::string& name() const = 0;
};
#endif // SAQUT_OPT_PASS

View File

@ -187,10 +187,7 @@ public:
if (m_hasFields) m_ss << ",\n";
m_ss << m_indentInner << "\"" << jsonEscape(key) << "\": [";
m_arrayDepth++;
bool saved = m_hasArrayItem;
m_hasArrayItem = false; // her dizi kendi virgül sayacıyla başlar
callback();
m_hasArrayItem = saved;
m_arrayDepth--;
m_ss << "\n" << m_indentInner << "]";
m_hasFields = true;

View File

@ -31,7 +31,6 @@
#include <string>
#include <vector>
#include "core/location.hpp"
#include "core/type.hpp"
#include "parser/token.hpp"
#include "tools.hpp"
@ -248,47 +247,6 @@ protected:
std::vector<ASTNode*> children;
};
// ============================================================================
// ExpressionNode — Değer Üreten Düğümlerin Tabanı (Faz 1, ADR-012)
// ============================================================================
//
// Bir DEĞER üreten her düğüm (Literal, Identifier, BinaryExpression, Call,
// Postfix, MemberAccess, IndexExpression) buradan türer. Bir ifadenin bir
// TİPİ vardır; analiz/optimizasyon alanları burada toplanır.
//
class ExpressionNode : public ASTNode {
public:
// TODO(faz-3): tip denetleyici doldurur. Şimdilik Error = "henüz çözülmedi".
Type resolvedType;
// TODO(faz-4): sabit katlama (constant folding) bayrağı.
bool isConstant = false;
// TODO(faz-4): foldedValue — katlanmış sabit değer (temsil Faz 4'te netleşir).
// resolvedType'ın JSON karşılığı (henüz çözülmemişse null gösterilir).
std::string resolvedTypeJson() const {
return resolvedType.isError() ? std::string("null") : resolvedType.toJson();
}
};
// ============================================================================
// StatementNode — Eylem/Kontrol Akışı Yürüten Düğümlerin Tabanı (Faz 1)
// ============================================================================
//
// Değer üretmeyen, bir iş/kontrol akışı yürüten her düğüm (Block, If, For,
// While, DoWhile, Return, Break, Continue, ExpressionStatement ve şimdilik
// VariableDecl) buradan türer. Tipi yoktur; akış-analizi alanları taşır.
//
// TODO(faz-1 gözden geçirme): VariableDecl/FunctionDecl/StructDecl'in tam
// sınıflandırması provizyonel — VariableDecl burada (blok içinde erişilebilirliğe
// tabi), Function/StructDecl doğrudan ASTNode altında kaldı.
//
class StatementNode : public ASTNode {
public:
// TODO(faz-3/4): erişilebilirlik (dead-code) analizi günceller.
bool isReachable = true;
};
// ============================================================================
// childrenToJson — Düğümün çocuklarını JSON array olarak yaz
// ============================================================================

View File

@ -18,7 +18,6 @@ std::string BinaryExpressionNode::toJson(int depth) {
obj.add("operator", std::string(OPERATOR_MAP_REV.count(Operator) ? OPERATOR_MAP_REV.at(Operator) : "?"));
if (Left) obj.addRaw("left", Left->toJson(depth + 1));
if (Right) obj.addRaw("right", Right->toJson(depth + 1));
obj.addRaw("resolvedType", resolvedTypeJson());
obj.addRaw("location", loc.toJson());
return obj.str();
}

View File

@ -3,7 +3,7 @@
#include "parser/ast_node.hpp"
class BinaryExpressionNode : public ExpressionNode {
class BinaryExpressionNode : public ASTNode {
public:
TokenType Operator;
ASTNode* Left = nullptr;

View File

@ -12,9 +12,6 @@ std::string FunctionDeclNode::toJson(int depth) {
obj.add("kind", "FunctionDecl");
obj.add("name", name);
obj.add("returnType", returnType);
obj.addArray("params", [&]() {
for (auto* p : params) obj.addItem(p->toJson(depth + 2));
});
obj.addArray("children", [&]() {
for (auto* child : children) obj.addItem(child->toJson(depth + 2));
});
@ -33,7 +30,6 @@ std::string VariableDeclNode::toJson(int depth) {
obj.add("kind", "VariableDecl");
obj.add("name", name);
obj.add("varType", varType);
obj.add("isReachable", isReachable);
if (initExpr) obj.addRaw("init", initExpr->toJson(depth + 1));
obj.addRaw("location", loc.toJson());
return obj.str();

View File

@ -3,19 +3,16 @@
#include "parser/ast_node.hpp"
class VariableDeclNode; // fwd — FunctionDeclNode::params için
class FunctionDeclNode : public ASTNode {
public:
std::string name;
std::string returnType;
std::vector<VariableDeclNode*> params; // TODO(faz2): parametreler
FunctionDeclNode();
void log(int indent = 0) override;
std::string toJson(int depth = 0) override;
};
class VariableDeclNode : public StatementNode {
class VariableDeclNode : public ASTNode {
public:
std::string varType;
std::string name;

View File

@ -12,7 +12,6 @@ std::string PostfixNode::toJson(int depth) {
obj.add("kind", "Postfix");
obj.add("operator", std::string(OPERATOR_MAP_REV.count(Operator) ? OPERATOR_MAP_REV.at(Operator) : "?"));
if (operand) obj.addRaw("operand", operand->toJson(depth + 1));
obj.addRaw("resolvedType", resolvedTypeJson());
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -31,7 +30,6 @@ std::string CallExpressionNode::toJson(int depth) {
obj.addArray("arguments", [&]() {
for (auto* arg : arguments) obj.addItem(arg->toJson(depth + 2));
});
obj.addRaw("resolvedType", resolvedTypeJson());
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -48,7 +46,6 @@ std::string MemberAccessNode::toJson(int depth) {
obj.add("member", member);
obj.add("arrow", arrow);
if (object) obj.addRaw("object", object->toJson(depth + 1));
obj.addRaw("resolvedType", resolvedTypeJson());
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -65,7 +62,6 @@ std::string IndexExpressionNode::toJson(int depth) {
obj.add("kind", "IndexExpression");
if (object) obj.addRaw("object", object->toJson(depth + 1));
if (index) obj.addRaw("index", index->toJson(depth + 1));
obj.addRaw("resolvedType", resolvedTypeJson());
obj.addRaw("location", loc.toJson());
return obj.str();
}

View File

@ -3,7 +3,7 @@
#include "parser/ast_node.hpp"
class PostfixNode : public ExpressionNode {
class PostfixNode : public ASTNode {
public:
ASTNode* operand = nullptr;
TokenType Operator;
@ -12,7 +12,7 @@ public:
std::string toJson(int depth = 0) override;
};
class CallExpressionNode : public ExpressionNode {
class CallExpressionNode : public ASTNode {
public:
ASTNode* callee = nullptr;
std::vector<ASTNode*> arguments;
@ -21,7 +21,7 @@ public:
std::string toJson(int depth = 0) override;
};
class MemberAccessNode : public ExpressionNode {
class MemberAccessNode : public ASTNode {
public:
ASTNode* object = nullptr;
std::string member;
@ -31,7 +31,7 @@ public:
std::string toJson(int depth = 0) override;
};
class IndexExpressionNode : public ExpressionNode {
class IndexExpressionNode : public ASTNode {
public:
ASTNode* object = nullptr;
ASTNode* index = nullptr;

View File

@ -17,7 +17,6 @@ std::string IdentifierNode::toJson(int depth) {
ss << "{\n"
<< in << " \"kind\": \"Identifier\",\n"
<< in << " \"name\": \"" << jsonEscape(name) << "\",\n"
<< in << " \"resolvedType\": " << resolvedTypeJson() << ",\n"
<< in << " \"location\": " << loc.toJson() << "\n"
<< in << "}";
return ss.str();

View File

@ -3,16 +3,11 @@
#include "parser/ast_node.hpp"
struct Symbol; // TODO(faz-2): sembol tablosu (Symbol) tanımlandığında bağlanacak
class IdentifierNode : public ExpressionNode {
class IdentifierNode : public ASTNode {
public:
Token* lexerToken = nullptr;
ParserToken parserToken;
// TODO(faz-2): isim çözümlemede sembol tablosundaki tanıma bağlanır.
Symbol* resolvedSymbol = nullptr;
IdentifierNode();
void log(int indent = 0) override;
std::string toJson(int depth = 0) override;

View File

@ -6,21 +6,17 @@
LiteralNode::LiteralNode() { kind = ASTKind::Literal; }
void LiteralNode::log(int indent) {
std::string val = hasDirectValue ? std::to_string(directIntValue)
: (parserToken.token ? parserToken.token->token : "?");
std::cout << padRight("", indent)
<< "Literal {" << val << "} "
<< "Literal {" << (parserToken.token ? parserToken.token->token : "?") << "} "
<< literalTypeToString(literalType);
if (isConstant) std::cout << " [folded]";
if (literalType == LiteralType::INTEGER && literalBase != 10)
std::cout << " (base " << literalBase << ")";
std::cout << "\n";
}
std::string LiteralNode::toJson(int depth) {
std::string in = jsonIndent(depth);
std::string val = hasDirectValue ? std::to_string(directIntValue)
: (parserToken.token ? parserToken.token->token : "?");
std::string in = jsonIndent(depth);
std::string val = parserToken.token ? parserToken.token->token : "?";
std::ostringstream ss;
ss << "{\n"
<< in << " \"kind\": \"Literal\",\n"
@ -32,7 +28,6 @@ std::string LiteralNode::toJson(int depth) {
if (literalType == LiteralType::FLOAT) {
ss << ",\n" << in << " \"isFloat\": true";
}
ss << ",\n" << in << " \"resolvedType\": " << resolvedTypeJson();
ss << ",\n" << in << " \"location\": " << loc.toJson() << "\n"
<< in << "}";
return ss.str();

View File

@ -3,7 +3,7 @@
#include "parser/ast_node.hpp"
class LiteralNode : public ExpressionNode {
class LiteralNode : public ASTNode {
public:
Token* lexerToken = nullptr;
ParserToken parserToken;
@ -12,11 +12,6 @@ public:
int literalBase = 10;
bool isFloatValue = false;
// Sabit katlama (constant folding) tarafından üretilen sentetik literal.
// parserToken.token yerine bu değer kullanılır.
bool hasDirectValue = false;
int directIntValue = 0;
LiteralNode();
void log(int indent = 0) override;
std::string toJson(int depth = 0) override;

View File

@ -13,7 +13,6 @@ std::string BlockNode::toJson(int depth) {
obj.addArray("children", [&]() {
for (auto* child : children) obj.addItem(child->toJson(depth + 2));
});
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -32,7 +31,6 @@ std::string IfStatementNode::toJson(int depth) {
if (condition) obj.addRaw("condition", condition->toJson(depth + 1));
if (thenBranch) obj.addRaw("then", thenBranch->toJson(depth + 1));
if (elseBranch) obj.addRaw("else", elseBranch->toJson(depth + 1));
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -49,7 +47,6 @@ std::string WhileStatementNode::toJson(int depth) {
obj.add("kind", "WhileStatement");
if (condition) obj.addRaw("condition", condition->toJson(depth + 1));
if (body) obj.addRaw("body", body->toJson(depth + 1));
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -70,7 +67,6 @@ std::string ForStatementNode::toJson(int depth) {
if (condition) obj.addRaw("condition", condition->toJson(depth + 1));
if (update) obj.addRaw("update", update->toJson(depth + 1));
if (body) obj.addRaw("body", body->toJson(depth + 1));
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -87,7 +83,6 @@ std::string DoWhileStatementNode::toJson(int depth) {
obj.add("kind", "DoWhileStatement");
if (condition) obj.addRaw("condition", condition->toJson(depth + 1));
if (body) obj.addRaw("body", body->toJson(depth + 1));
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -102,7 +97,6 @@ std::string ReturnStatementNode::toJson(int depth) {
JsonObject obj(depth);
obj.add("kind", "ReturnStatement");
if (value) obj.addRaw("value", value->toJson(depth + 1));
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -115,7 +109,6 @@ void BreakStatementNode::log(int indent) {
std::string BreakStatementNode::toJson(int depth) {
JsonObject obj(depth);
obj.add("kind", "BreakStatement");
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -128,7 +121,6 @@ void ContinueStatementNode::log(int indent) {
std::string ContinueStatementNode::toJson(int depth) {
JsonObject obj(depth);
obj.add("kind", "ContinueStatement");
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}
@ -143,7 +135,6 @@ std::string ExpressionStatementNode::toJson(int depth) {
JsonObject obj(depth);
obj.add("kind", "ExpressionStatement");
if (expression) obj.addRaw("expression", expression->toJson(depth + 1));
obj.add("isReachable", isReachable);
obj.addRaw("location", loc.toJson());
return obj.str();
}

View File

@ -3,14 +3,14 @@
#include "parser/ast_node.hpp"
class BlockNode : public StatementNode {
class BlockNode : public ASTNode {
public:
BlockNode();
void log(int indent = 0) override;
std::string toJson(int depth = 0) override;
};
class IfStatementNode : public StatementNode {
class IfStatementNode : public ASTNode {
public:
ASTNode* condition = nullptr;
ASTNode* thenBranch = nullptr;
@ -20,7 +20,7 @@ public:
std::string toJson(int depth = 0) override;
};
class WhileStatementNode : public StatementNode {
class WhileStatementNode : public ASTNode {
public:
ASTNode* condition = nullptr;
ASTNode* body = nullptr;
@ -29,7 +29,7 @@ public:
std::string toJson(int depth = 0) override;
};
class ForStatementNode : public StatementNode {
class ForStatementNode : public ASTNode {
public:
ASTNode* init = nullptr;
ASTNode* condition = nullptr;
@ -40,7 +40,7 @@ public:
std::string toJson(int depth = 0) override;
};
class DoWhileStatementNode : public StatementNode {
class DoWhileStatementNode : public ASTNode {
public:
ASTNode* condition = nullptr;
ASTNode* body = nullptr;
@ -49,7 +49,7 @@ public:
std::string toJson(int depth = 0) override;
};
class ReturnStatementNode : public StatementNode {
class ReturnStatementNode : public ASTNode {
public:
ASTNode* value = nullptr;
ReturnStatementNode();
@ -57,21 +57,21 @@ public:
std::string toJson(int depth = 0) override;
};
class BreakStatementNode : public StatementNode {
class BreakStatementNode : public ASTNode {
public:
BreakStatementNode();
void log(int indent = 0) override;
std::string toJson(int depth = 0) override;
};
class ContinueStatementNode : public StatementNode {
class ContinueStatementNode : public ASTNode {
public:
ContinueStatementNode();
void log(int indent = 0) override;
std::string toJson(int depth = 0) override;
};
class ExpressionStatementNode : public StatementNode {
class ExpressionStatementNode : public ASTNode {
public:
ASTNode* expression = nullptr;
ExpressionStatementNode();

View File

@ -63,13 +63,11 @@ ASTNode* Parser::parseProgram() {
ProgramNode* program = new ProgramNode();
while (currentToken().type != TokenType::SVR_VOID) {
int prevPos = current;
ASTNode* decl = parseDeclaration();
if (decl)
program->addChild(decl);
// İlerleme olmadıysa token atla — syntax hatasında sonsuz döngüyü önler
if (current == prevPos)
nextToken();
else
break;
}
return program;
@ -93,16 +91,6 @@ ASTNode* Parser::parseDeclaration() {
if (ct.type == TokenType::KW_STRUCT)
return parseStructDecl();
// Kullanıcı tanımlı tip adı (struct tipi) ile değişken/fonksiyon bildirimi
if (ct.type == TokenType::IDENTIFIER) {
auto la1 = lookahead(1);
auto la2 = lookahead(2);
if (la1.type == TokenType::IDENTIFIER && la2.type == TokenType::LPAREN)
return parseFunctionDecl();
if (la1.type == TokenType::IDENTIFIER)
return parseVariableDecl();
}
return parseStatement();
}
@ -305,26 +293,8 @@ ASTNode* Parser::parseFunctionDecl() {
if (currentToken().type == TokenType::LPAREN) {
nextToken();
while (currentToken().type != TokenType::RPAREN &&
currentToken().type != TokenType::SVR_VOID) {
auto typeTok = currentToken();
bool isTypeKw = typeTok.is({
TokenType::KW_VOID, TokenType::KW_INT, TokenType::KW_FLOAT_TYPE,
TokenType::KW_DOUBLE, TokenType::KW_BOOL, TokenType::KW_CHAR,
TokenType::KW_STRING_TYPE, TokenType::KW_AUTO
}) || typeTok.type == TokenType::IDENTIFIER;
if (!isTypeKw || !typeTok.token) break;
std::string paramType = typeTok.token->token;
currentToken().type != TokenType::SVR_VOID)
nextToken();
if (currentToken().type != TokenType::IDENTIFIER || !currentToken().token) break;
VariableDeclNode* param = new VariableDeclNode();
param->loc = currentToken().token->loc;
param->varType = paramType;
param->name = currentToken().token->token;
nextToken();
fn->params.push_back(param);
if (currentToken().type == TokenType::COMMA)
nextToken();
}
if (currentToken().type == TokenType::RPAREN)
nextToken();
}

View File

@ -1,95 +0,0 @@
#include "semantic/structural_validator.hpp"
#include "parser/nodes/declarations.hpp"
#include "parser/nodes/statements.hpp"
void StructuralValidator::validate(ASTNode* program) {
if (!program) return;
for (ASTNode* child : program->getChildren())
walkDecl(child);
}
void StructuralValidator::walkDecl(ASTNode* node) {
if (!node) return;
if (node->kind == ASTKind::FunctionDecl) {
auto* fn = (FunctionDeclNode*)node;
inFunction_ = true;
auto& ch = fn->getChildren();
if (!ch.empty()) walkStmt(ch[0]);
inFunction_ = false;
}
// VariableDecl / StructDecl: yapısal kural yok
}
void StructuralValidator::walkStmt(ASTNode* node) {
if (!node) return;
switch (node->kind) {
case ASTKind::Block:
for (ASTNode* child : node->getChildren()) walkStmt(child);
break;
case ASTKind::IfStatement: {
auto* ifn = (IfStatementNode*)node;
if (ifn->thenBranch) walkStmt(ifn->thenBranch);
if (ifn->elseBranch) walkStmt(ifn->elseBranch);
break;
}
case ASTKind::WhileStatement: {
auto* ws = (WhileStatementNode*)node;
loopDepth_++;
if (ws->body) walkStmt(ws->body);
loopDepth_--;
break;
}
case ASTKind::DoWhileStatement: {
auto* dw = (DoWhileStatementNode*)node;
loopDepth_++;
if (dw->body) walkStmt(dw->body);
loopDepth_--;
break;
}
case ASTKind::ForStatement: {
auto* fs = (ForStatementNode*)node;
loopDepth_++;
if (fs->init) walkStmt(fs->init);
if (fs->body) walkStmt(fs->body);
loopDepth_--;
break;
}
case ASTKind::BreakStatement:
if (loopDepth_ == 0)
diag_.report("E004", node->loc,
"'break' döngü dışında kullanılamaz");
break;
case ASTKind::ContinueStatement:
if (loopDepth_ == 0)
diag_.report("E004", node->loc,
"'continue' döngü dışında kullanılamaz");
break;
case ASTKind::ReturnStatement:
if (!inFunction_)
diag_.report("E005", node->loc,
"'return' fonksiyon dışında kullanılamaz");
break;
case ASTKind::VariableDecl: {
// sibling'leri de gez
for (ASTNode* sib : node->getChildren())
if (sib->kind == ASTKind::VariableDecl) walkStmt(sib);
break;
}
case ASTKind::ExpressionStatement:
break; // ifade içinde return/break olamaz
default:
break;
}
}

View File

@ -1,22 +0,0 @@
#ifndef SAQUT_SEMANTIC_STRUCTURAL_VALIDATOR
#define SAQUT_SEMANTIC_STRUCTURAL_VALIDATOR
#include "diagnostic/diagnostic_engine.hpp"
#include "parser/ast_node.hpp"
class StructuralValidator {
public:
explicit StructuralValidator(DiagnosticEngine& diag) : diag_(diag) {}
void validate(ASTNode* program);
private:
void walkDecl(ASTNode* node);
void walkStmt(ASTNode* node);
DiagnosticEngine& diag_;
int loopDepth_ = 0;
bool inFunction_ = false;
};
#endif // SAQUT_SEMANTIC_STRUCTURAL_VALIDATOR

View File

@ -1,384 +0,0 @@
#include "semantic/type_checker.hpp"
#include "parser/nodes/program.hpp"
#include "parser/nodes/declarations.hpp"
#include "parser/nodes/statements.hpp"
#include "parser/nodes/expressions.hpp"
#include "parser/nodes/binary_expr.hpp"
#include "parser/nodes/identifier.hpp"
#include "parser/nodes/literal.hpp"
// ─────────────────────────────────────────────────────────────────────────────
// Yardımcılar
// ─────────────────────────────────────────────────────────────────────────────
int TypeChecker::numericRank(const Type& t) {
if (!t.isPrimitive()) return -1;
switch (t.prim) {
case PrimitiveKind::Int: return 0;
case PrimitiveKind::Float: return 1;
case PrimitiveKind::Double: return 2;
default: return -1;
}
}
// ─────────────────────────────────────────────────────────────────────────────
// check — giriş noktası
// ─────────────────────────────────────────────────────────────────────────────
void TypeChecker::check(ASTNode* program) {
if (!program) return;
for (ASTNode* child : program->getChildren()) {
switch (child->kind) {
case ASTKind::FunctionDecl: checkFunction(child); break;
case ASTKind::VariableDecl: checkStmt(child); break;
default: break;
}
}
}
// ─────────────────────────────────────────────────────────────────────────────
// checkFunction
// ─────────────────────────────────────────────────────────────────────────────
void TypeChecker::checkFunction(ASTNode* fnNode) {
auto* fn = (FunctionDeclNode*)fnNode;
inFunction_ = true;
currentReturnType_ = Type::fromName(fn->returnType);
if (currentReturnType_.isError() && fn->returnType != "void")
currentReturnType_ = Type::Void(); // bilinmeyen dönüş tipi → void gibi davran
auto& ch = fn->getChildren();
if (!ch.empty()) checkStmt(ch[0]); // body Block
inFunction_ = false;
}
// ─────────────────────────────────────────────────────────────────────────────
// checkAssign — atama uyumu + uyarı/hata raporlama
// ─────────────────────────────────────────────────────────────────────────────
bool TypeChecker::checkAssign(const Type& target, const Type& src,
bool srcIsLiteral,
const SourceLocation& loc,
const std::string& ctx) {
if (target.isError() || src.isError()) return true; // önceki hata, sessiz geç
if (target.equals(src)) return true;
int tRank = numericRank(target);
int sRank = numericRank(src);
if (tRank >= 0 && sRank >= 0) {
if (tRank > sRank) {
// Genişletme (widening): int→float, int→double, float→double
if (srcIsLiteral) return true; // literal bağlama-göre tiplenir, uyarısız
diag_.report("W004", loc,
"'" + ctx + "': " + src.toString() +
"" + target.toString() + " örtük genişletme");
return true;
} else {
// Daraltma (narrowing): float→int, double→float, vb.
diag_.report("E003", loc,
"'" + ctx + "': " + src.toString() +
"" + target.toString() + " daraltma (veri kaybı)");
return false;
}
}
// Tamamen farklı tipler
diag_.report("E003", loc,
"'" + ctx + "': " + src.toString() +
" tipi " + target.toString() + " tipine atanamaz");
return false;
}
// ─────────────────────────────────────────────────────────────────────────────
// checkStmt
// ─────────────────────────────────────────────────────────────────────────────
void TypeChecker::checkStmt(ASTNode* node) {
if (!node) return;
switch (node->kind) {
case ASTKind::Block:
for (ASTNode* child : node->getChildren()) checkStmt(child);
break;
case ASTKind::VariableDecl: {
auto* vd = (VariableDeclNode*)node;
Type targetType = Type::fromName(vd->varType);
if (vd->initExpr) {
Type srcType = checkExpr(vd->initExpr, targetType);
bool isLit = vd->initExpr->kind == ASTKind::Literal;
checkAssign(targetType, srcType, isLit, vd->loc, vd->name);
}
// sibling VariableDecl'ler (int a, b;)
for (ASTNode* sib : vd->getChildren()) {
if (sib->kind == ASTKind::VariableDecl) checkStmt(sib);
}
break;
}
case ASTKind::ExpressionStatement: {
auto* es = (ExpressionStatementNode*)node;
if (es->expression) checkExpr(es->expression);
break;
}
case ASTKind::ReturnStatement: {
auto* rs = (ReturnStatementNode*)node;
if (!rs->value) {
if (inFunction_ && !currentReturnType_.isVoid())
diag_.report("E006", rs->loc,
"Değersiz return; fonksiyon " +
currentReturnType_.toString() + " döndürmeli");
break;
}
Type valType = checkExpr(rs->value, currentReturnType_);
bool isLit = rs->value->kind == ASTKind::Literal;
checkAssign(currentReturnType_, valType, isLit, rs->loc, "return");
break;
}
case ASTKind::IfStatement: {
auto* ifn = (IfStatementNode*)node;
if (ifn->condition) checkExpr(ifn->condition);
if (ifn->thenBranch) checkStmt(ifn->thenBranch);
if (ifn->elseBranch) checkStmt(ifn->elseBranch);
break;
}
case ASTKind::WhileStatement: {
auto* ws = (WhileStatementNode*)node;
if (ws->condition) checkExpr(ws->condition);
if (ws->body) checkStmt(ws->body);
break;
}
case ASTKind::ForStatement: {
auto* fs = (ForStatementNode*)node;
if (fs->init) {
if (fs->init->kind == ASTKind::VariableDecl) checkStmt(fs->init);
else checkExpr(fs->init);
}
if (fs->condition) checkExpr(fs->condition);
if (fs->update) checkExpr(fs->update);
if (fs->body) checkStmt(fs->body);
break;
}
case ASTKind::DoWhileStatement: {
auto* dw = (DoWhileStatementNode*)node;
if (dw->body) checkStmt(dw->body);
if (dw->condition) checkExpr(dw->condition);
break;
}
case ASTKind::BreakStatement:
case ASTKind::ContinueStatement:
break; // yapısal doğrulama StructuralValidator'ın işi
default:
break;
}
}
// ─────────────────────────────────────────────────────────────────────────────
// checkExpr — tip çıkarımı + resolvedType ataması
// ─────────────────────────────────────────────────────────────────────────────
Type TypeChecker::checkExpr(ASTNode* node, const Type& expected) {
if (!node) return Type::error();
Type result = Type::error();
switch (node->kind) {
// ── Literal ────────────────────────────────────────────────────────────
case ASTKind::Literal: {
auto* lit = (LiteralNode*)node;
int expRank = numericRank(expected);
switch (lit->literalType) {
case LiteralType::INTEGER:
// Bağlam daha geniş sayısal tip ise literal o tip olarak tiplenir.
if (expRank > 0) result = expected; // float veya double bekleniyor
else result = Type::Int();
break;
case LiteralType::FLOAT:
// float literal → double bağlamında double olur; int bağlamında E003.
if (!expected.isError() && expected.equals(Type::Double()))
result = Type::Double();
else if (!expected.isError() && numericRank(expected) == 0) {
// int bekleniyor ama float literal: E003
diag_.report("E003", lit->loc,
"Float literal int bağlamında kullanılamaz (veri kaybı)");
result = Type::error();
} else {
result = Type::Float();
}
break;
case LiteralType::BOOLEAN: result = Type::Bool(); break;
case LiteralType::STRING: result = Type::String(); break;
default: result = Type::error(); break;
}
break;
}
// ── Identifier ─────────────────────────────────────────────────────────
case ASTKind::Identifier: {
auto* id = (IdentifierNode*)node;
result = id->resolvedSymbol ? id->resolvedSymbol->type : Type::error();
break;
}
// ── BinaryExpression ───────────────────────────────────────────────────
case ASTKind::BinaryExpression: {
auto* bin = (BinaryExpressionNode*)node;
// Atama operatörleri
if (bin->Operator == TokenType::EQUAL ||
bin->Operator == TokenType::PLUS_EQUAL ||
bin->Operator == TokenType::MINUS_EQUAL ||
bin->Operator == TokenType::STAR_EQUAL ||
bin->Operator == TokenType::SLASH_EQUAL ||
bin->Operator == TokenType::PERCENT_EQUAL) {
Type leftType = checkExpr(bin->Left);
Type rightType = checkExpr(bin->Right, leftType);
bool isLit = bin->Right && bin->Right->kind == ASTKind::Literal;
checkAssign(leftType, rightType, isLit, bin->loc, "atama");
result = leftType;
break;
}
// Unary (Left = nullptr): -, +, !, ~
if (!bin->Left) {
Type rightType = checkExpr(bin->Right);
if (bin->Operator == TokenType::BANG) {
result = Type::Bool();
} else {
result = rightType.isNumeric() ? rightType : Type::error();
if (result.isError() && !rightType.isError())
diag_.report("E003", bin->loc, "Sayısal olmayan operand");
}
break;
}
Type leftType = checkExpr(bin->Left);
Type rightType = checkExpr(bin->Right);
// Mantıksal
if (bin->Operator == TokenType::AMPERSAND_AMPERSAND ||
bin->Operator == TokenType::PIPE_PIPE) {
result = Type::Bool();
break;
}
// Karşılaştırma
if (bin->Operator == TokenType::EQUAL_EQUAL ||
bin->Operator == TokenType::BANG_EQUAL ||
bin->Operator == TokenType::LESS ||
bin->Operator == TokenType::LESS_EQUAL ||
bin->Operator == TokenType::GREATER ||
bin->Operator == TokenType::GREATER_EQUAL) {
result = Type::Bool();
break;
}
// Aritmetik: +, -, *, /, %
int lRank = numericRank(leftType);
int rRank = numericRank(rightType);
if (lRank >= 0 && rRank >= 0) {
// Aynı tip veya otomatik genişletme; sonuç daha geniş tip.
result = (lRank >= rRank) ? leftType : rightType;
} else if (!leftType.isError() && !rightType.isError()) {
diag_.report("E003", bin->loc,
"Aritmetik operatör sayısal olmayan tip: " +
leftType.toString() + " ve " + rightType.toString());
result = Type::error();
} else {
result = Type::error();
}
break;
}
// ── Call ───────────────────────────────────────────────────────────────
case ASTKind::Call: {
auto* call = (CallExpressionNode*)node;
Type calleeType = checkExpr(call->callee);
if (!calleeType.isFunction()) {
if (!calleeType.isError())
diag_.report("E003", call->loc,
"Çağrılabilir değil: " + calleeType.toString());
result = Type::error();
// Argümanları yine de gez (cascade hatayı önle)
for (auto* arg : call->arguments) checkExpr(arg);
break;
}
// Argüman sayısı kontrolü — builtin print hariç (paramTypes boş = değişken arity)
if (!calleeType.paramTypes.empty()) {
size_t expected_count = calleeType.paramTypes.size();
size_t got_count = call->arguments.size();
if (got_count != expected_count) {
diag_.report("E008", call->loc,
std::to_string(expected_count) + " argüman bekleniyor, " +
std::to_string(got_count) + " verildi");
}
}
// Argüman tiplerini kontrol et
for (size_t i = 0; i < call->arguments.size(); ++i) {
Type paramType = (i < calleeType.paramTypes.size())
? calleeType.paramTypes[i]
: Type::error();
Type argType = checkExpr(call->arguments[i], paramType);
bool isLit = call->arguments[i]->kind == ASTKind::Literal;
if (!paramType.isError())
checkAssign(paramType, argType, isLit,
call->arguments[i]->loc, "argüman");
}
result = calleeType.returnType ? *calleeType.returnType : Type::Void();
break;
}
// ── Postfix ++/-- ──────────────────────────────────────────────────────
case ASTKind::Postfix: {
auto* pf = (PostfixNode*)node;
Type opType = checkExpr(pf->operand);
if (!opType.isNumeric() && !opType.isError())
diag_.report("E003", pf->loc,
"++ / -- sayısal olmayan tip: " + opType.toString());
result = opType;
break;
}
// ── MemberAccess / IndexExpression ─────────────────────────────────────
case ASTKind::MemberAccess: {
auto* ma = (MemberAccessNode*)node;
checkExpr(ma->object);
result = Type::error(); // TODO(faz3+): struct alan çözümü
break;
}
case ASTKind::IndexExpression: {
auto* ie = (IndexExpressionNode*)node;
checkExpr(ie->object);
if (ie->index) checkExpr(ie->index);
result = Type::error(); // TODO(faz3+): array eleman tipi
break;
}
default:
result = Type::error();
break;
}
// resolvedType'a yaz (ExpressionNode'dan türeyen tüm node'lar için)
if (auto* exprNode = dynamic_cast<ExpressionNode*>(node))
exprNode->resolvedType = result;
return result;
}

View File

@ -1,41 +0,0 @@
#ifndef SAQUT_SEMANTIC_TYPE_CHECKER
#define SAQUT_SEMANTIC_TYPE_CHECKER
#include "symbol/symbol_table.hpp"
#include "diagnostic/diagnostic_engine.hpp"
#include "parser/ast_node.hpp"
#include "core/type.hpp"
class TypeChecker {
public:
TypeChecker(SymbolTable& table, DiagnosticEngine& diag)
: table_(table), diag_(diag) {}
void check(ASTNode* program);
private:
// İfadeyi gez, resolvedType ata, tipi döndür.
// expected: bağlam tipi — literal genişletme kararı için.
Type checkExpr(ASTNode* node, const Type& expected = Type::error());
void checkStmt(ASTNode* node);
void checkFunction(ASTNode* fnNode);
// Atama / parametre uyumu: true = geçerli (uyarı dahil).
// srcIsLiteral: RHS doğrudan bir Literal node'u mu?
bool checkAssign(const Type& target, const Type& src,
bool srcIsLiteral,
const SourceLocation& loc,
const std::string& context);
// İki sayısal tipin genişlik sırası: int=0, float=1, double=2; -1 = sayısal değil.
static int numericRank(const Type& t);
SymbolTable& table_;
DiagnosticEngine& diag_;
Type currentReturnType_; // aktif fonksiyonun beklenen dönüş tipi
bool inFunction_ = false;
};
#endif // SAQUT_SEMANTIC_TYPE_CHECKER

View File

@ -1,37 +0,0 @@
#ifndef SAQUT_SYMBOL_SCOPE
#define SAQUT_SYMBOL_SCOPE
#include <unordered_map>
#include <vector>
#include "symbol/symbol.hpp"
class Scope {
public:
Scope* parent = nullptr;
explicit Scope(Scope* p = nullptr) : parent(p) {}
// Bu scope'a ekle. Aynı adda varsa nullptr (duplicate → çağıran E002 verir).
Symbol* defineLocal(Symbol* s) {
if (table.count(s->name)) return nullptr;
table[s->name] = s;
order.push_back(s);
s->scope = this;
return s;
}
Symbol* lookupLocal(const std::string& n) {
auto it = table.find(n);
return it == table.end() ? nullptr : it->second;
}
Symbol* resolve(const std::string& n) {
for (Scope* s = this; s; s = s->parent)
if (auto* r = s->lookupLocal(n)) return r;
return nullptr;
}
std::unordered_map<std::string, Symbol*> table; // non-owning
std::vector<Symbol*> order; // ekleme sırası
};
#endif // SAQUT_SYMBOL_SCOPE

View File

@ -1,34 +0,0 @@
#ifndef SAQUT_SYMBOL_SYMBOL
#define SAQUT_SYMBOL_SYMBOL
#include <string>
#include <vector>
#include "core/type.hpp"
#include "core/location.hpp"
enum class SymbolKind { Variable, Function, Parameter, Struct, Field };
inline const char* symbolKindName(SymbolKind k) {
switch (k) {
case SymbolKind::Variable: return "variable";
case SymbolKind::Function: return "function";
case SymbolKind::Parameter: return "parameter";
case SymbolKind::Struct: return "struct";
case SymbolKind::Field: return "field";
}
return "?";
}
class Scope;
struct Symbol {
std::string name;
SymbolKind kind = SymbolKind::Variable;
Type type;
SourceLocation definitionLoc;
std::vector<SourceLocation> references;
Scope* scope = nullptr;
bool isBuiltin = false;
};
#endif // SAQUT_SYMBOL_SYMBOL

View File

@ -1,377 +0,0 @@
#include "symbol/symbol_collector.hpp"
#include <functional>
#include "parser/nodes/program.hpp"
#include "parser/nodes/declarations.hpp"
#include "parser/nodes/statements.hpp"
#include "parser/nodes/expressions.hpp"
#include "parser/nodes/binary_expr.hpp"
#include "parser/nodes/identifier.hpp"
// ─────────────────────────────────────────────────────────────────────────────
// collect — dört aşamalı toplama
// ─────────────────────────────────────────────────────────────────────────────
void SymbolCollector::collect(ASTNode* program) {
if (!program) return;
seedBuiltins();
pass1Globals(program);
checkStructCycles();
pass2Bodies(program);
}
// ─────────────────────────────────────────────────────────────────────────────
// seedBuiltins — global scope'a yerleşik fonksiyonları ekle
// ─────────────────────────────────────────────────────────────────────────────
void SymbolCollector::seedBuiltins() {
// TODO(#89 builtin kataloğu): geçici; ileride gerçek katalog gelecek.
Symbol* s = table_.define("print", SymbolKind::Function,
Type::function(Type::Void(), {}),
SourceLocation{});
if (s) s->isBuiltin = true;
}
// ─────────────────────────────────────────────────────────────────────────────
// typeFromName — tip adından Type üret; bilinmiyorsa E007
// ─────────────────────────────────────────────────────────────────────────────
Type SymbolCollector::typeFromName(const std::string& n, const SourceLocation& loc) {
Type t = Type::fromName(n);
if (!t.isError()) return t;
if (structFields_.count(n)) return Type::structType(n);
// TODO(faz2/faz3): bilinmeyen tip tam E007 tanısı
diag_.report("E007", loc, "Bilinmeyen tip: '" + n + "'");
return Type::error();
}
// ─────────────────────────────────────────────────────────────────────────────
// pass1Globals — üst-seviye isimleri hoist eder (gövdelere girmez)
// ─────────────────────────────────────────────────────────────────────────────
void SymbolCollector::pass1Globals(ASTNode* program) {
for (ASTNode* child : program->getChildren()) {
switch (child->kind) {
case ASTKind::FunctionDecl: {
auto* fn = (FunctionDeclNode*)child;
// parametre tiplerini topla
std::vector<Type> paramTypes;
for (auto* p : fn->params)
paramTypes.push_back(typeFromName(p->varType, p->loc));
Type retType = typeFromName(fn->returnType, fn->loc);
Symbol* s = table_.define(fn->name, SymbolKind::Function,
Type::function(retType, paramTypes),
fn->loc);
if (!s)
diag_.report("E002", fn->loc,
"'" + fn->name + "' zaten bu kapsamda tanımlı");
break;
}
case ASTKind::StructDecl: {
auto* st = (StructDeclNode*)child;
Symbol* s = table_.define(st->name, SymbolKind::Struct,
Type::structType(st->name), st->loc);
if (!s) {
diag_.report("E002", st->loc,
"'" + st->name + "' zaten bu kapsamda tanımlı");
break;
}
// struct alan isimlerini cycle check için kaydet
for (ASTNode* fieldNode : st->getChildren()) {
if (fieldNode->kind == ASTKind::VariableDecl) {
auto* vd = (VariableDeclNode*)fieldNode;
// yalnızca struct tipindeki alanları izle
Type ft = Type::fromName(vd->varType);
if (ft.isError()) // primitif değilse struct tipi olabilir
structFields_[st->name].push_back(vd->varType);
}
}
break;
}
case ASTKind::VariableDecl: {
auto* vd = (VariableDeclNode*)child;
Symbol* s = table_.define(vd->name, SymbolKind::Variable,
typeFromName(vd->varType, vd->loc),
vd->loc);
if (!s)
diag_.report("E002", vd->loc,
"'" + vd->name + "' zaten bu kapsamda tanımlı");
// Sibling VariableDecl'ler (int a, b;)
for (ASTNode* sib : vd->getChildren()) {
if (sib->kind == ASTKind::VariableDecl) {
auto* sv = (VariableDeclNode*)sib;
Symbol* ss = table_.define(sv->name, SymbolKind::Variable,
typeFromName(sv->varType, sv->loc),
sv->loc);
if (!ss)
diag_.report("E002", sv->loc,
"'" + sv->name + "' zaten bu kapsamda tanımlı");
}
}
break;
}
default:
break;
}
}
}
// ─────────────────────────────────────────────────────────────────────────────
// checkStructCycles — E010 döngüsel struct (by-value çevrim → sonsuz boyut)
// ─────────────────────────────────────────────────────────────────────────────
void SymbolCollector::checkStructCycles() {
// white=0 / gray=1 / black=2
std::unordered_map<std::string, int> color;
for (auto& kv : structFields_) color[kv.first] = 0;
std::function<bool(const std::string&)> dfs = [&](const std::string& name) -> bool {
auto it = color.find(name);
if (it == color.end()) return false; // primitif / bilinmeyen → çevrim değil
if (it->second == 1) return true; // gray → back-edge → çevrim!
if (it->second == 2) return false; // black → zaten işlendi
it->second = 1; // gri yap
auto fit = structFields_.find(name);
if (fit != structFields_.end()) {
for (const std::string& dep : fit->second) {
if (dfs(dep)) return true;
}
}
it->second = 2; // siyah yap
return false;
};
for (auto& kv : structFields_) {
if (color[kv.first] == 0) {
// DFS başlat
color[kv.first] = 1;
for (const std::string& dep : kv.second) {
if (dfs(dep)) {
// tanımlama konumunu bulmak için global scope'ta ara
Symbol* s = table_.global()->lookupLocal(kv.first);
SourceLocation loc = s ? s->definitionLoc : SourceLocation{};
diag_.report("E010", loc,
"Döngüsel struct: '" + kv.first + "' by-value sonsuz boyut oluşturur");
break;
}
}
color[kv.first] = 2;
}
}
}
// ─────────────────────────────────────────────────────────────────────────────
// pass2Bodies — fonksiyon gövdelerini gez; isim çözümle + referans topla
// ─────────────────────────────────────────────────────────────────────────────
void SymbolCollector::pass2Bodies(ASTNode* program) {
for (ASTNode* child : program->getChildren()) {
switch (child->kind) {
case ASTKind::FunctionDecl: {
auto* fn = (FunctionDeclNode*)child;
table_.enterScope();
// parametreleri tanımla
for (auto* p : fn->params) {
Symbol* s = table_.define(p->name, SymbolKind::Parameter,
typeFromName(p->varType, p->loc), p->loc);
if (!s)
diag_.report("E002", p->loc,
"Parametre '" + p->name + "' zaten tanımlı");
}
// gövdeyi gez (children[0] = BlockNode)
auto& ch = fn->getChildren();
if (!ch.empty()) walkStmt(ch[0]);
table_.exitScope();
break;
}
case ASTKind::VariableDecl: {
// global değişken başlatıcısı (declare-before-use)
auto* vd = (VariableDeclNode*)child;
if (vd->initExpr) walkExpr(vd->initExpr);
// TODO(faz2): global init sırası kontrolü (fibonacci'de global var yok)
for (ASTNode* sib : vd->getChildren()) {
if (sib->kind == ASTKind::VariableDecl) {
auto* sv = (VariableDeclNode*)sib;
if (sv->initExpr) walkExpr(sv->initExpr);
}
}
break;
}
case ASTKind::StructDecl:
break; // pass2'de gövde gezme gerekmez
default:
break;
}
}
}
// ─────────────────────────────────────────────────────────────────────────────
// walkStmt — ifade bloğunu gez
// ─────────────────────────────────────────────────────────────────────────────
void SymbolCollector::walkStmt(ASTNode* node) {
if (!node) return;
switch (node->kind) {
case ASTKind::Block: {
table_.enterScope();
for (ASTNode* child : node->getChildren()) walkStmt(child);
table_.exitScope();
break;
}
case ASTKind::VariableDecl: {
auto* vd = (VariableDeclNode*)node;
// Önce başlatıcıyı gez (kendini görmesin)
if (vd->initExpr) walkExpr(vd->initExpr);
// Sonra tanımla
Symbol* s = table_.define(vd->name, SymbolKind::Variable,
typeFromName(vd->varType, vd->loc), vd->loc);
if (!s)
diag_.report("E002", vd->loc,
"'" + vd->name + "' zaten bu kapsamda tanımlı");
// Sibling VariableDecl'ler (int a, b;) — TODO: fibonacci'de yok
for (ASTNode* sib : vd->getChildren()) {
if (sib->kind == ASTKind::VariableDecl) {
auto* sv = (VariableDeclNode*)sib;
if (sv->initExpr) walkExpr(sv->initExpr);
Symbol* ss = table_.define(sv->name, SymbolKind::Variable,
typeFromName(sv->varType, sv->loc), sv->loc);
if (!ss)
diag_.report("E002", sv->loc,
"'" + sv->name + "' zaten bu kapsamda tanımlı");
}
}
break;
}
case ASTKind::IfStatement: {
auto* ifn = (IfStatementNode*)node;
if (ifn->condition) walkExpr(ifn->condition);
if (ifn->thenBranch) walkStmt(ifn->thenBranch);
if (ifn->elseBranch) walkStmt(ifn->elseBranch);
break;
}
case ASTKind::WhileStatement: {
auto* ws = (WhileStatementNode*)node;
if (ws->condition) walkExpr(ws->condition);
if (ws->body) walkStmt(ws->body);
break;
}
case ASTKind::ForStatement: {
auto* fs = (ForStatementNode*)node;
table_.enterScope(); // init değişkeni döngüye ait
if (fs->init) {
if (fs->init->kind == ASTKind::VariableDecl) walkStmt(fs->init);
else walkExpr(fs->init);
}
if (fs->condition) walkExpr(fs->condition);
if (fs->update) walkExpr(fs->update);
if (fs->body) walkStmt(fs->body);
table_.exitScope();
break;
}
case ASTKind::DoWhileStatement: {
auto* dw = (DoWhileStatementNode*)node;
if (dw->body) walkStmt(dw->body);
if (dw->condition) walkExpr(dw->condition);
break;
}
case ASTKind::ReturnStatement: {
auto* rs = (ReturnStatementNode*)node;
if (rs->value) walkExpr(rs->value);
break;
}
case ASTKind::ExpressionStatement: {
auto* es = (ExpressionStatementNode*)node;
if (es->expression) walkExpr(es->expression);
break;
}
case ASTKind::BreakStatement:
case ASTKind::ContinueStatement:
break; // yaprak
default:
break;
}
}
// ─────────────────────────────────────────────────────────────────────────────
// walkExpr — ifade ağacında isimleri çöz
// ─────────────────────────────────────────────────────────────────────────────
void SymbolCollector::walkExpr(ASTNode* node) {
if (!node) return;
switch (node->kind) {
case ASTKind::Identifier: {
auto* id = (IdentifierNode*)node;
if (!id->parserToken.token) break;
std::string name = id->parserToken.token->token;
Symbol* s = table_.resolve(name);
if (s) {
id->resolvedSymbol = s;
table_.addReference(s, id->loc);
} else {
diag_.report("E001", id->loc,
"'" + name + "' tanımlı değil");
}
break;
}
case ASTKind::BinaryExpression: {
auto* bin = (BinaryExpressionNode*)node;
if (bin->Left) walkExpr(bin->Left);
if (bin->Right) walkExpr(bin->Right);
break;
}
case ASTKind::Call: {
auto* call = (CallExpressionNode*)node;
if (call->callee) walkExpr(call->callee);
for (ASTNode* arg : call->arguments) walkExpr(arg);
break;
}
case ASTKind::Postfix: {
auto* pf = (PostfixNode*)node;
if (pf->operand) walkExpr(pf->operand);
break;
}
case ASTKind::MemberAccess: {
auto* ma = (MemberAccessNode*)node;
if (ma->object) walkExpr(ma->object); // member çözümü Faz 3 → TODO
break;
}
case ASTKind::IndexExpression: {
auto* ie = (IndexExpressionNode*)node;
if (ie->object) walkExpr(ie->object);
if (ie->index) walkExpr(ie->index);
break;
}
case ASTKind::Literal:
break; // yaprak
default:
break;
}
}

View File

@ -1,37 +0,0 @@
#ifndef SAQUT_SYMBOL_COLLECTOR
#define SAQUT_SYMBOL_COLLECTOR
#include <string>
#include <unordered_map>
#include <vector>
#include "symbol/symbol_table.hpp"
#include "diagnostic/diagnostic_engine.hpp"
#include "core/type.hpp"
#include "core/location.hpp"
#include "parser/ast_node.hpp"
class SymbolCollector {
public:
SymbolCollector(SymbolTable& t, DiagnosticEngine& d) : table_(t), diag_(d) {}
// seedBuiltins → pass1 → structCycles(E010) → pass2
void collect(ASTNode* program);
private:
void seedBuiltins();
void pass1Globals(ASTNode* program);
void checkStructCycles();
void pass2Bodies(ASTNode* program);
void walkStmt(ASTNode* node);
void walkExpr(ASTNode* node);
Type typeFromName(const std::string& n, const SourceLocation& loc);
SymbolTable& table_;
DiagnosticEngine& diag_;
// struct adı → içerdiği struct-tip alan adları (cycle check için)
std::unordered_map<std::string, std::vector<std::string>> structFields_;
};
#endif // SAQUT_SYMBOL_COLLECTOR

View File

@ -1,65 +0,0 @@
#ifndef SAQUT_SYMBOL_TABLE
#define SAQUT_SYMBOL_TABLE
#include <memory>
#include <vector>
#include "symbol/scope.hpp"
class SymbolTable {
public:
SymbolTable() {
global_ = newScope(nullptr);
current_ = global_;
}
Scope* global() { return global_; }
Scope* current() { return current_; }
Scope* enterScope() {
current_ = newScope(current_);
return current_;
}
void exitScope() {
if (current_->parent) current_ = current_->parent;
}
// current scope'ta tanımla; duplicate → nullptr döner
Symbol* define(const std::string& name, SymbolKind k, Type t, SourceLocation loc) {
auto s = std::make_unique<Symbol>();
s->name = name;
s->kind = k;
s->type = std::move(t);
s->definitionLoc = loc;
Symbol* raw = s.get();
if (!current_->defineLocal(raw)) return nullptr; // duplicate
pool_.push_back(std::move(s));
return raw;
}
Symbol* resolve(const std::string& n) { return current_->resolve(n); }
void addReference(Symbol* s, SourceLocation loc) {
if (s) s->references.push_back(loc);
}
std::vector<Symbol*> allSymbols() const {
std::vector<Symbol*> result;
result.reserve(pool_.size());
for (const auto& s : pool_) result.push_back(s.get());
return result;
}
private:
Scope* newScope(Scope* p) {
scopes_.push_back(std::make_unique<Scope>(p));
return scopes_.back().get();
}
std::vector<std::unique_ptr<Scope>> scopes_;
std::vector<std::unique_ptr<Symbol>> pool_;
Scope* global_ = nullptr;
Scope* current_ = nullptr;
};
#endif // SAQUT_SYMBOL_TABLE

View File

@ -1,58 +1,5 @@
#include "tokenizer/tokenizer.hpp"
#include <unordered_map>
// ─────────────────────────────────────────────────────────────────────────────
// Keyword hash map — O(1) lookup yerine O(n) for döngüsü
// ─────────────────────────────────────────────────────────────────────────────
static const std::unordered_map<std::string_view, std::string_view> KW_MAP = {
{"if","if"},{"else","else"},{"for","for"},{"while","while"},{"do","do"},
{"switch","switch"},{"case","case"},{"default","default"},
{"break","break"},{"continue","continue"},{"return","return"},
{"try","try"},{"catch","catch"},{"finally","finally"},
{"throw","throw"},{"throws","throws"},{"assert","assert"},
{"void","void"},{"int","int"},{"float","float"},{"double","double"},
{"char","char"},{"string","string"},{"bool","bool"},
{"true","true"},{"false","false"},{"null","null"},
{"class","class"},{"struct","struct"},{"interface","interface"},
{"enum","enum"},{"extends","extends"},{"implements","implements"},
{"new","new"},{"public","public"},{"private","private"},
{"protected","protected"},{"static","static"},{"final","final"},
{"abstract","abstract"},{"import","import"},{"package","package"},
{"const","const"},{"extern","extern"},{"typedef","typedef"},
{"sizeof","sizeof"},{"auto","auto"},{"constexpr","constexpr"},
{"noexcept","noexcept"},{"native","native"},
{"synchronized","synchronized"},{"volatile","volatile"},
{"transient","transient"}
};
// ─────────────────────────────────────────────────────────────────────────────
// Yardımcı makrolar — OperatorToken ve DelimiterToken üretimi
// ─────────────────────────────────────────────────────────────────────────────
#define MAKE_OP(str, len) \
do { \
OperatorToken* _t = new OperatorToken();\
_t->start = hmx.getOffset(); \
_t->loc = hmx.getLocation(); \
hmx.toChar(len); \
_t->end = hmx.getOffset(); \
_t->token = (str); \
return _t; \
} while(0)
#define MAKE_DEL(str, len) \
do { \
DelimiterToken* _t = new DelimiterToken();\
_t->start = hmx.getOffset(); \
_t->loc = hmx.getLocation(); \
hmx.toChar(len); \
_t->end = hmx.getOffset(); \
_t->token = (str); \
return _t; \
} while(0)
// ─────────────────────────────────────────────────────────────────────────────
// scan
// ─────────────────────────────────────────────────────────────────────────────
std::vector<Token*> Tokenizer::scan(std::string input, std::string filePath) {
std::vector<Token*> tokens;
hmx.setSourceText(filePath, input);
@ -65,14 +12,10 @@ std::vector<Token*> Tokenizer::scan(std::string input, std::string filePath) {
return tokens;
}
// ─────────────────────────────────────────────────────────────────────────────
// scope — ana dispatch; her token için TEK geçiş
// ─────────────────────────────────────────────────────────────────────────────
Token* Tokenizer::scope() {
hmx.skipWhiteSpace();
// Yorum satırları — include() burada hâlâ gerekli (2 karakter kontrol)
if (hmx.include("//", true)) { skipOneLineComment(); return scope(); }
if (hmx.include("//", true)) { skipOneLineComment(); return scope(); }
if (hmx.include("/*", true)) { skipMultiLineComment(); return scope(); }
if (hmx.isEnd()) {
@ -81,8 +24,10 @@ Token* Tokenizer::scope() {
return t;
}
if (hmx.getchar() == '"') return readString();
if (hmx.isNumeric()) {
if (hmx.getchar() == '"')
return readString();
if (hmx.isNumeric()) {
INumber lem = hmx.readNumeric();
NumberToken* nt = new NumberToken();
nt->loc = lem.startLoc;
@ -95,128 +40,50 @@ Token* Tokenizer::scope() {
return nt;
}
char c0 = hmx.getchar();
char c1 = hmx.getchar(1); // sadece 1 ek okuma, include() değil
// ── Operatörler & Delimiter'lar — switch ile O(1) dispatch ───────────
switch (c0) {
// + ++ +=
case '+':
if (c1 == '+') MAKE_OP("++", 2);
if (c1 == '=') MAKE_OP("+=", 2);
MAKE_OP("+", 1);
// - -- -= ->
case '-':
if (c1 == '-') MAKE_OP("--", 2);
if (c1 == '=') MAKE_OP("-=", 2);
if (c1 == '>') MAKE_DEL("->", 2);
MAKE_OP("-", 1);
// * *= **
case '*':
if (c1 == '=') MAKE_OP("*=", 2);
if (c1 == '*') MAKE_OP("**", 2);
MAKE_OP("*", 1);
// / /=
case '/':
if (c1 == '=') MAKE_OP("/=", 2);
MAKE_OP("/", 1);
// % %=
case '%':
if (c1 == '=') MAKE_OP("%=", 2);
MAKE_OP("%", 1);
// < <= << <<=
case '<':
if (c1 == '<') {
if (hmx.getchar(2) == '=') MAKE_OP("<<=", 3);
MAKE_OP("<<", 2);
for (const auto& kw : keywords) {
if (hmx.include(std::string(kw), false)) {
char next = hmx.getchar(static_cast<int>(kw.size()));
if ((next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z') ||
(next >= '0' && next <= '9') || next == '_' || next == '$') {
continue;
}
if (c1 == '=') MAKE_OP("<=", 2);
MAKE_OP("<", 1);
// > >= >> >>=
case '>':
if (c1 == '>') {
if (hmx.getchar(2) == '=') MAKE_OP(">>=", 3);
MAKE_OP(">>", 2);
}
if (c1 == '=') MAKE_OP(">=", 2);
MAKE_OP(">", 1);
// = ==
case '=':
if (c1 == '=') MAKE_OP("==", 2);
MAKE_OP("=", 1);
// ! !=
case '!':
if (c1 == '=') MAKE_OP("!=", 2);
MAKE_OP("!", 1);
// & && &=
case '&':
if (c1 == '&') MAKE_OP("&&", 2);
if (c1 == '=') MAKE_OP("&=", 2);
MAKE_OP("&", 1);
// | || |=
case '|':
if (c1 == '|') MAKE_OP("||", 2);
if (c1 == '=') MAKE_OP("|=", 2);
MAKE_OP("|", 1);
// ^ ^=
case '^':
if (c1 == '=') MAKE_OP("^=", 2);
MAKE_OP("^", 1);
// ~ (tek karakter)
case '~': MAKE_OP("~", 1);
// : ::
case ':':
if (c1 == ':') MAKE_DEL("::", 2);
MAKE_DEL(":", 1);
// Tek karakterli delimiter'lar
case '[': MAKE_DEL("[", 1);
case ']': MAKE_DEL("]", 1);
case '(': MAKE_DEL("(", 1);
case ')': MAKE_DEL(")", 1);
case '{': MAKE_DEL("{", 1);
case '}': MAKE_DEL("}", 1);
case ';': MAKE_DEL(";", 1);
case ',': MAKE_DEL(",", 1);
case '.': MAKE_DEL(".", 1);
case '?': MAKE_OP("?", 1);
default: break;
KeywordToken* kt = new KeywordToken();
kt->start = hmx.getOffset();
kt->loc = hmx.getLocation();
hmx.toChar(static_cast<int>(kw.size()));
kt->end = hmx.getOffset();
kt->token = kw;
return kt;
}
}
// ── Identifier veya Keyword — önce oku, sonra hash map'te ara ────────
IdentifierToken* id = readIdentifier();
auto it = KW_MAP.find(id->token);
if (it != KW_MAP.end()) {
KeywordToken* kt = new KeywordToken();
kt->start = id->start;
kt->end = id->end;
kt->loc = id->loc;
kt->token = id->token;
delete id;
return kt;
for (const auto& del : delimiters) {
if (hmx.include(std::string(del), false)) {
DelimiterToken* dt = new DelimiterToken();
dt->start = hmx.getOffset();
dt->loc = hmx.getLocation();
hmx.toChar(static_cast<int>(del.size()));
dt->end = hmx.getOffset();
dt->token = del;
return dt;
}
}
return id;
for (const auto& op : operators) {
if (hmx.include(std::string(op), false)) {
OperatorToken* ot = new OperatorToken();
ot->start = hmx.getOffset();
ot->loc = hmx.getLocation();
hmx.toChar(static_cast<int>(op.size()));
ot->end = hmx.getOffset();
ot->token = op;
return ot;
}
}
return readIdentifier();
}
// ─────────────────────────────────────────────────────────────────────────────
// readIdentifier — değişmedi
// ─────────────────────────────────────────────────────────────────────────────
IdentifierToken* Tokenizer::readIdentifier() {
hmx.beginPosition();
IdentifierToken* it = new IdentifierToken();
@ -248,9 +115,6 @@ IdentifierToken* Tokenizer::readIdentifier() {
return it;
}
// ─────────────────────────────────────────────────────────────────────────────
// readString — değişmedi
// ─────────────────────────────────────────────────────────────────────────────
StringToken* Tokenizer::readString() {
hmx.beginPosition();
StringToken* st = new StringToken();
@ -263,8 +127,11 @@ StringToken* Tokenizer::readString() {
st->token.push_back(c);
switch (c) {
case '"':
if (!started) { started = true; }
else { ended = true; }
if (!started) {
started = true;
} else {
ended = true;
}
break;
case '\\':
hmx.nextChar();
@ -287,9 +154,6 @@ StringToken* Tokenizer::readString() {
return st;
}
// ─────────────────────────────────────────────────────────────────────────────
// skipOneLineComment / skipMultiLineComment — değişmedi
// ─────────────────────────────────────────────────────────────────────────────
void Tokenizer::skipOneLineComment() {
while (!hmx.isEnd()) {
if (hmx.getchar() == '\n') {

File diff suppressed because it is too large Load Diff

View File

@ -1,46 +0,0 @@
// ============================================================================
// saQut VM — CallFrame (Tek Fonksiyon Çağrısının Çalışma Alanı)
//
// fibonacci(5) çağrıldığında bir CallFrame açılır.
// fibonacci(4) çağrıldığında AYRI bir CallFrame daha açılır.
// Her frame kendi slot dizisine sahiptir — üst frame'e asla dokunmaz.
//
// FRAME YAŞAM DÖNGÜSÜ:
// 1. CALL instruction'ı çalışır → yeni CallFrame oluşturulur, callStack'e eklenir
// 2. Interpreter bu frame'in instruction'larını çalıştırır
// 3. RETURN instruction'ı çalışır → frame callStack'ten çıkarılır,
// dönüş değeri caller'ın `returnDestSlot`'una yazılır
//
// REFERANS GÜVENLİĞİ:
// Interpreter döngüsü her iterasyonda callStack.back() ile frame'i TAZELER.
// CALL ve RETURN'den sonra `continue` ile döngü başına dönülür.
// Bu sayede vector büyüyüp referansı geçersiz kılsa bile sorun olmaz.
// ============================================================================
#ifndef SAQUT_VM_CALL_FRAME
#define SAQUT_VM_CALL_FRAME
#include <vector>
#include "ir/ir_function.hpp"
#include "vm/value.hpp"
struct CallFrame {
// Hangi fonksiyonun instruction'larını çalıştırıyoruz?
// Pointer — IRProgram sahibi, frame sahibi değil.
const IRFunction* function = nullptr;
// Sıradaki çalıştırılacak instruction'ın indeksi.
// Döngü her adımda önce bu indeksteki instruction'ı alır,
// SONRA ip'yi artırır. CALL/RETURN ip'ye dokunmaz.
int instructionPointer = 0;
// Bu frame'in değer depoları: parametreler + lokaller + geçiciler.
// Boyut = function->slotCount (frame oluşturulurken ayarlanır).
std::vector<Value> slots;
// RETURN olunca dönüş değeri CALLER'ın hangi slotuna yazılacak?
// -1 = main fonksiyonu (caller yok, değer kullanılmaz).
int returnDestSlot = -1;
};
#endif // SAQUT_VM_CALL_FRAME

View File

@ -1,173 +0,0 @@
#include "vm/interpreter.hpp"
#include <iostream>
#include <stdexcept>
int Interpreter::run() {
IRFunction* mainFunction = program_.findFunction("main");
if (!mainFunction)
throw std::runtime_error("Çalışma hatası: 'main' fonksiyonu bulunamadı");
CallFrame mainFrame;
mainFrame.function = mainFunction;
mainFrame.instructionPointer = 0;
mainFrame.slots.resize(mainFunction->slotCount, Value::fromInt(0));
mainFrame.returnDestSlot = -1;
callStack_.push_back(std::move(mainFrame));
while (!callStack_.empty()) {
CallFrame& frame = callStack_.back();
if (frame.instructionPointer >= (int)frame.function->instructions.size()) {
int destSlot = frame.returnDestSlot;
callStack_.pop_back();
if (!callStack_.empty() && destSlot != -1)
callStack_.back().slots[destSlot] = Value::fromInt(0);
continue;
}
const Instruction& instr = frame.function->instructions[frame.instructionPointer];
frame.instructionPointer++;
switch (instr.opcode) {
case Opcode::LOAD_CONST:
frame.slots[instr.dest] = Value::fromInt(instr.intValue);
break;
case Opcode::LOAD_STRING:
frame.slots[instr.dest] = Value::fromString(instr.stringValue);
break;
case Opcode::LOAD_SLOT:
frame.slots[instr.dest] = frame.slots[instr.src];
break;
// ── Aritmetik ─────────────────────────────────────────────────────
// TypeChecker derleme zamanında tipleri doğruladı — burada sadece hesap yapılır.
// İstisna: sıfıra bölme gerçek bir çalışma zamanı koşuludur, kontrol edilir.
case Opcode::ADD:
frame.slots[instr.dest] = Value::fromInt(
frame.slots[instr.left].intValue + frame.slots[instr.right].intValue);
break;
case Opcode::SUB:
frame.slots[instr.dest] = Value::fromInt(
frame.slots[instr.left].intValue - frame.slots[instr.right].intValue);
break;
case Opcode::MUL:
frame.slots[instr.dest] = Value::fromInt(
frame.slots[instr.left].intValue * frame.slots[instr.right].intValue);
break;
case Opcode::DIV: {
int d = frame.slots[instr.right].intValue;
if (d == 0) throw std::runtime_error("Çalışma hatası: sıfıra bölme");
frame.slots[instr.dest] = Value::fromInt(frame.slots[instr.left].intValue / d);
break;
}
case Opcode::MOD: {
int d = frame.slots[instr.right].intValue;
if (d == 0) throw std::runtime_error("Çalışma hatası: sıfıra bölme (mod)");
frame.slots[instr.dest] = Value::fromInt(frame.slots[instr.left].intValue % d);
break;
}
// ── Karşılaştırma ─────────────────────────────────────────────────
case Opcode::LESS:
frame.slots[instr.dest] = Value::fromInt(
frame.slots[instr.left].intValue < frame.slots[instr.right].intValue ? 1 : 0);
break;
case Opcode::LESS_EQUAL:
frame.slots[instr.dest] = Value::fromInt(
frame.slots[instr.left].intValue <= frame.slots[instr.right].intValue ? 1 : 0);
break;
case Opcode::GREATER:
frame.slots[instr.dest] = Value::fromInt(
frame.slots[instr.left].intValue > frame.slots[instr.right].intValue ? 1 : 0);
break;
case Opcode::GREATER_EQUAL:
frame.slots[instr.dest] = Value::fromInt(
frame.slots[instr.left].intValue >= frame.slots[instr.right].intValue ? 1 : 0);
break;
case Opcode::EQUAL_EQUAL: {
auto& lv = frame.slots[instr.left]; auto& rv = frame.slots[instr.right];
int r = (lv.kind == ValueKind::String)
? (lv.stringValue == rv.stringValue ? 1 : 0)
: (lv.intValue == rv.intValue ? 1 : 0);
frame.slots[instr.dest] = Value::fromInt(r);
break;
}
case Opcode::NOT_EQUAL: {
auto& lv = frame.slots[instr.left]; auto& rv = frame.slots[instr.right];
int r = (lv.kind == ValueKind::String)
? (lv.stringValue != rv.stringValue ? 1 : 0)
: (lv.intValue != rv.intValue ? 1 : 0);
frame.slots[instr.dest] = Value::fromInt(r);
break;
}
// ── Kontrol akışı ─────────────────────────────────────────────────
case Opcode::JMP:
frame.instructionPointer = instr.jumpTarget;
break;
case Opcode::JIF_FALSE:
if (!frame.slots[instr.cond].isTruthy())
frame.instructionPointer = instr.jumpTarget;
break;
// ── Fonksiyon çağrısı ─────────────────────────────────────────────
case Opcode::CALL: {
IRFunction* callee = program_.findFunction(instr.functionName);
if (!callee)
throw std::runtime_error(
"Çalışma hatası: '" + instr.functionName + "' fonksiyonu bulunamadı");
CallFrame newFrame;
newFrame.function = callee;
newFrame.instructionPointer = 0;
newFrame.slots.resize(callee->slotCount, Value::fromInt(0));
newFrame.returnDestSlot = instr.dest;
for (int i = 0; i < (int)instr.argSlots.size(); i++)
newFrame.slots[i] = frame.slots[instr.argSlots[i]];
callStack_.push_back(std::move(newFrame));
continue;
}
// ── Dönüş ─────────────────────────────────────────────────────────
case Opcode::RETURN: {
Value returnValue = frame.slots[instr.src];
int returnDestSlot = frame.returnDestSlot;
callStack_.pop_back();
if (!callStack_.empty() && returnDestSlot != -1)
callStack_.back().slots[returnDestSlot] = returnValue;
if (callStack_.empty())
return returnValue.intValue;
continue;
}
// ── FFI ───────────────────────────────────────────────────────────
case Opcode::CALLHOST:
executeHostFunction(instr.functionName, frame.slots, instr.argSlots);
break;
}
}
return 0;
}
void Interpreter::executeHostFunction(const std::string& name,
const std::vector<Value>& slots,
const std::vector<int>& argSlots) {
if (name == "print") {
if (!argSlots.empty()) {
const Value& val = slots[argSlots[0]];
if (val.kind == ValueKind::String) std::cout << val.stringValue << "\n";
else std::cout << val.intValue << "\n";
}
return;
}
throw std::runtime_error("Çalışma hatası: bilinmeyen host fonksiyonu '" + name + "'");
}

View File

@ -1,38 +0,0 @@
// ============================================================================
// saQut VM — Interpreter (Bytecode Yorumlayıcı)
//
// IRProgram içindeki talimatları çalıştırır.
// "main" fonksiyonundan başlar, RETURN ile biten frame'leri kapatır.
//
// DÖNGÜ GÜVENLİĞİ (referans invalidation):
// Her iterasyonun başında callStack.back() tazeden alınır.
// CALL ve RETURN'den sonra `continue` ile döngü başına dönülür;
// böylece vector büyümesinden kaynaklanan dangling pointer sorunu olmaz.
// ============================================================================
#ifndef SAQUT_VM_INTERPRETER
#define SAQUT_VM_INTERPRETER
#include <vector>
#include "ir/ir_program.hpp"
#include "vm/call_frame.hpp"
class Interpreter {
public:
explicit Interpreter(IRProgram& program) : program_(program) {}
// "main" fonksiyonunu bul ve çalıştır.
// Tamamlandığında main'in dönüş değerini (int) döndürür.
int run();
private:
IRProgram& program_;
std::vector<CallFrame> callStack_;
// Host (C++) fonksiyon çağrısı — şu an sadece "print" destekli
void executeHostFunction(const std::string& name,
const std::vector<Value>& slots,
const std::vector<int>& argSlots);
};
#endif // SAQUT_VM_INTERPRETER

View File

@ -1,65 +0,0 @@
// ============================================================================
// saQut VM — Value (Çalışma Zamanı Değer)
//
// Bir saQut değerinin bellekteki temsilidir.
//
// ŞU AN SADECE INT:
// fibonacci.sqt tamamen int kullanır, bu dikey dilim için int yeterli.
// İleride float, bool, string eklenmesi için "kind" alanı iskelet olarak bırakıldı.
//
// BOOLEAN OLARAK KULLANIM:
// JIF_FALSE talimatı değerin 0 olup olmadığına bakar.
// 0 = yanlış, sıfır-dışı = doğru. C geleneği.
// ============================================================================
#ifndef SAQUT_VM_VALUE
#define SAQUT_VM_VALUE
#include <string>
// Gelecekte float/bool/string eklendiğinde burası genişleyecek.
// Şimdilik sadece int.
enum class ValueKind {
Int,
String,
// Float, // TODO(vm-genişletme)
// Bool, // TODO(vm-genişletme)
};
struct Value {
ValueKind kind = ValueKind::Int;
int intValue = 0;
std::string stringValue; // yalnızca kind == String için geçerli
static Value fromInt(int n) {
Value v;
v.kind = ValueKind::Int;
v.intValue = n;
return v;
}
static Value fromString(std::string s) {
Value v;
v.kind = ValueKind::String;
v.stringValue = std::move(s);
return v;
}
// JIF_FALSE için: int 0 = yanlış, boş string = yanlış, diğer = doğru
bool isTruthy() const {
if (kind == ValueKind::Int) return intValue != 0;
if (kind == ValueKind::String) return !stringValue.empty();
return false;
}
// Okunabilir metin — dump ve hata mesajları için
std::string typeName() const {
switch (kind) {
case ValueKind::Int: return "int";
case ValueKind::String: return "string";
}
return "?";
}
};
#endif // SAQUT_VM_VALUE

View File

@ -1,16 +0,0 @@
#!/usr/bin/env bash
# saQut birim testleri — çerçevesiz (assert tabanlı), tek komutla.
# Kullanım: bash tests/run.sh
set -euo pipefail
ROOT="$(cd "$(dirname "${BASH_SOURCE[0]}")/.." && pwd)"
CXX="${CXX:-g++}"
FLAGS=(-std=c++20 -Wall -Wextra -I"$ROOT/src")
for t in test_type test_diagnostic; do
echo "=== $t ==="
"$CXX" "${FLAGS[@]}" "$ROOT/tests/$t.cpp" -o "/tmp/saqut_$t"
"/tmp/saqut_$t"
done
echo "=== TUM TESTLER GECTI ==="

View File

@ -1,43 +0,0 @@
// Faz 0 — DiagnosticEngine birim testleri (çerçevesiz; assert + çıktı).
// Koşmak için: tests/run.sh
#include "diagnostic/diagnostic_engine.hpp"
#include <iostream>
#include <cassert>
int main() {
DiagnosticEngine diag;
SourceLocation l1{"test.sqt", 3, 5, 40};
SourceLocation l2{"test.sqt", 7, 9, 88};
SourceLocation l3{"test.sqt", 12, 1, 150};
// Üç tanı — ekleme sırası korunmalı (ADR-013: ilk hatada durma, topla)
diag.report("E001", l1, "x tanımsız");
diag.report("E003", l2, "int'e string atanamaz", "ık dönüşüm gerekiyor");
diag.report("W001", l3, "y kullanılmıyor");
assert(diag.count() == 3);
assert(diag.hasErrors());
assert(diag.errorCount() == 2);
assert(diag.warningCount() == 1);
// Sıra korunmuş mu?
assert(diag.all()[0].code == "E001");
assert(diag.all()[1].code == "E003");
assert(diag.all()[2].code == "W001");
// Seviye kataloğdan çözülmüş mü?
assert(diag.all()[0].level == DiagLevel::Error);
assert(diag.all()[2].level == DiagLevel::Warning);
// Katalog erişimi
assert(findDiag("E010") != nullptr);
assert(findDiag("E999") == nullptr);
std::cout << "--- printAll ---\n";
diag.printAll(std::cout);
std::cout << "--- toJson ---\n";
std::cout << diag.toJson() << "\n";
std::cout << "test_diagnostic: TUM TESTLER GECTI\n";
return 0;
}

View File

@ -1,49 +0,0 @@
// Faz 0 — Type birim testleri (çerçevesiz; assert + çıktı).
// Koşmak için: tests/run.sh (veya g++ -std=c++20 -Wall -Wextra -Isrc ...)
#include "core/type.hpp"
#include <iostream>
#include <cassert>
int main() {
Type i = Type::Int();
Type i2 = Type::Int();
Type f = Type::Float();
Type arrI = Type::array(Type::Int());
Type arrI2 = Type::array(Type::Int());
Type arrF = Type::array(Type::Float());
Type fn = Type::function(Type::Int(), {Type::Int(), Type::Int()});
Type st = Type::structType("Point");
Type err = Type::error();
// equals — yapısal, katı (gizli dönüşüm yok)
assert(i.equals(i2));
assert(!i.equals(f));
assert(arrI.equals(arrI2));
assert(!arrI.equals(arrF));
assert(!arrI.equals(i));
assert(fn.equals(Type::function(Type::Int(), {Type::Int(), Type::Int()})));
assert(!fn.equals(Type::function(Type::Int(), {Type::Int()})));
assert(st.equals(Type::structType("Point")));
assert(!st.equals(Type::structType("Vec")));
assert(err.equals(Type::error()));
// yüklemler
assert(i.isNumeric() && !st.isNumeric());
assert(Type::Void().isVoid());
assert(err.isError());
// toString
assert(i.toString() == "int");
assert(arrI.toString() == "int[]");
assert(fn.toString() == "fn(int,int)->int");
assert(st.toString() == "struct Point");
assert(err.toString() == "<error>");
// fromName
assert(Type::fromName("int").equals(Type::Int()));
assert(Type::fromName("bool").equals(Type::Bool()));
assert(Type::fromName("bogus").isError());
std::cout << "test_type: TUM TESTLER GECTI\n";
return 0;
}