Phase 25.1 完了成果: - ✅ LoopForm v2 テスト・ドキュメント・コメント完備 - 4ケース(A/B/C/D)完全テストカバレッジ - 最小再現ケース作成(SSAバグ調査用) - SSOT文書作成(loopform_ssot.md) - 全ソースに [LoopForm] コメントタグ追加 - ✅ Stage-1 CLI デバッグ環境構築 - stage1_cli.hako 実装 - stage1_bridge.rs ブリッジ実装 - デバッグツール作成(stage1_debug.sh/stage1_minimal.sh) - アーキテクチャ改善提案文書 - ✅ 環境変数削減計画策定 - 25変数の完全調査・分類 - 6段階削減ロードマップ(25→5、80%削減) - 即時削除可能変数特定(NYASH_CONFIG/NYASH_DEBUG) Phase 26-D からの累積変更: - PHI実装改善(ExitPhiBuilder/HeaderPhiBuilder等) - MIRビルダーリファクタリング - 型伝播・最適化パス改善 - その他約300ファイルの累積変更 🎯 技術的成果: - SSAバグ根本原因特定(条件分岐内loop変数変更) - Region+next_iパターン適用完了(UsingCollectorBox等) - LoopFormパターン文書化・テスト化完了 - セルフホスティング基盤強化 Co-Authored-By: Claude <noreply@anthropic.com> Co-Authored-By: ChatGPT <noreply@openai.com> Co-Authored-By: Task Assistant <task@anthropic.com>
58 lines
1.9 KiB
Rust
58 lines
1.9 KiB
Rust
/*!
|
||
* phi_core::common – shared types and invariants (scaffold)
|
||
*
|
||
* Phase 1 keeps this minimal; future phases may move debug asserts and
|
||
* predicate set checks here for both if/loop PHI normalization.
|
||
*/
|
||
|
||
/// Placeholder for future shared PHI input type alias.
|
||
/// Using the same tuple form as MIR Phi instruction inputs.
|
||
pub type PhiInput = (crate::mir::BasicBlockId, crate::mir::ValueId);
|
||
|
||
pub fn debug_verify_phi_inputs(
|
||
function: &crate::mir::MirFunction,
|
||
merge_bb: crate::mir::BasicBlockId,
|
||
inputs: &[(crate::mir::BasicBlockId, crate::mir::ValueId)],
|
||
) {
|
||
use std::collections::HashSet;
|
||
// Always compute when env toggle is set; otherwise no-op in release use.
|
||
let verify_on = std::env::var("HAKO_PHI_VERIFY")
|
||
.ok()
|
||
.map(|v| v.to_ascii_lowercase())
|
||
.map(|v| v == "1" || v == "true" || v == "on")
|
||
.unwrap_or(false)
|
||
|| std::env::var("NYASH_PHI_VERIFY")
|
||
.ok()
|
||
.map(|v| v.to_ascii_lowercase())
|
||
.map(|v| v == "1" || v == "true" || v == "on")
|
||
.unwrap_or(false);
|
||
if !verify_on {
|
||
return;
|
||
}
|
||
|
||
// Rebuild CFG to avoid stale predecessor sets
|
||
let mut func = function.clone();
|
||
func.update_cfg();
|
||
|
||
// Duplicate check
|
||
let mut seen = HashSet::new();
|
||
for (pred, _v) in inputs.iter() {
|
||
if *pred == merge_bb {
|
||
eprintln!("[phi/check][bad-self] merge={:?} pred={:?}", merge_bb, pred);
|
||
}
|
||
if !seen.insert(*pred) {
|
||
eprintln!("[phi/check][dup] merge={:?} pred={:?}", merge_bb, pred);
|
||
}
|
||
}
|
||
|
||
// Missing predecessor inputs check
|
||
if let Some(block) = func.blocks.get(&merge_bb) {
|
||
for pred in &block.predecessors {
|
||
let has = inputs.iter().any(|(bb, _)| bb == pred);
|
||
if !has {
|
||
eprintln!("[phi/check][missing] merge={:?} pred={:?}", merge_bb, pred);
|
||
}
|
||
}
|
||
}
|
||
}
|