Searched refs:bix2rpostord (Results 1 – 6 of 6) sorted by relevance
/dports/sysutils/vector/vector-0.10.0/cargo-crates/regalloc-0.0.25/src/ |
H A D | analysis_control_flow.rs | 328 bix2rpostord: &TypedIxVec<BlockIx, u32>, in dt_merge_sets() 336 let rpo1 = bix2rpostord[node1]; in dt_merge_sets() 337 let rpo2 = bix2rpostord[node2]; in dt_merge_sets() 366 let mut bix2rpostord = TypedIxVec::<BlockIx, u32>::new(); localVariable 368 bix2rpostord.resize(num_blocks, DT_INVALID_POSTORD); 374 bix2rpostord[bix] = n; 379 debug_assert!(bix2rpostord[BlockIx::new(n)] < num_blocks); 409 let rponum = bix2rpostord[node]; 416 let pred_rpo = bix2rpostord[*pred]; 432 parent = dt_merge_sets(&idom, &bix2rpostord, parent, *pred);
|
/dports/www/firefox/firefox-99.0/third_party/rust/regalloc/src/ |
H A D | analysis_control_flow.rs | 330 bix2rpostord: &TypedIxVec<BlockIx, u32>, in dt_merge_sets() 338 let rpo1 = bix2rpostord[node1]; in dt_merge_sets() 339 let rpo2 = bix2rpostord[node2]; in dt_merge_sets() 368 let mut bix2rpostord = TypedIxVec::<BlockIx, u32>::new(); localVariable 370 bix2rpostord.resize(num_blocks, DT_INVALID_POSTORD); 376 bix2rpostord[bix] = n; 381 debug_assert!(bix2rpostord[BlockIx::new(n)] < num_blocks); 411 let rponum = bix2rpostord[node]; 418 let pred_rpo = bix2rpostord[*pred]; 434 parent = dt_merge_sets(&idom, &bix2rpostord, parent, *pred);
|
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/regalloc/src/ |
H A D | analysis_control_flow.rs | 330 bix2rpostord: &TypedIxVec<BlockIx, u32>, in dt_merge_sets() 338 let rpo1 = bix2rpostord[node1]; in dt_merge_sets() 339 let rpo2 = bix2rpostord[node2]; in dt_merge_sets() 368 let mut bix2rpostord = TypedIxVec::<BlockIx, u32>::new(); localVariable 370 bix2rpostord.resize(num_blocks, DT_INVALID_POSTORD); 376 bix2rpostord[bix] = n; 381 debug_assert!(bix2rpostord[BlockIx::new(n)] < num_blocks); 411 let rponum = bix2rpostord[node]; 418 let pred_rpo = bix2rpostord[*pred]; 434 parent = dt_merge_sets(&idom, &bix2rpostord, parent, *pred);
|
/dports/lang/rust/rustc-1.58.1-src/vendor/regalloc/src/ |
H A D | analysis_control_flow.rs | 330 bix2rpostord: &TypedIxVec<BlockIx, u32>, in dt_merge_sets() 338 let rpo1 = bix2rpostord[node1]; in dt_merge_sets() 339 let rpo2 = bix2rpostord[node2]; in dt_merge_sets() 368 let mut bix2rpostord = TypedIxVec::<BlockIx, u32>::new(); localVariable 370 bix2rpostord.resize(num_blocks, DT_INVALID_POSTORD); 376 bix2rpostord[bix] = n; 381 debug_assert!(bix2rpostord[BlockIx::new(n)] < num_blocks); 411 let rponum = bix2rpostord[node]; 418 let pred_rpo = bix2rpostord[*pred]; 434 parent = dt_merge_sets(&idom, &bix2rpostord, parent, *pred);
|
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/regalloc/src/ |
H A D | analysis_control_flow.rs | 330 bix2rpostord: &TypedIxVec<BlockIx, u32>, in dt_merge_sets() 338 let rpo1 = bix2rpostord[node1]; in dt_merge_sets() 339 let rpo2 = bix2rpostord[node2]; in dt_merge_sets() 368 let mut bix2rpostord = TypedIxVec::<BlockIx, u32>::new(); localVariable 370 bix2rpostord.resize(num_blocks, DT_INVALID_POSTORD); 376 bix2rpostord[bix] = n; 381 debug_assert!(bix2rpostord[BlockIx::new(n)] < num_blocks); 411 let rponum = bix2rpostord[node]; 418 let pred_rpo = bix2rpostord[*pred]; 434 parent = dt_merge_sets(&idom, &bix2rpostord, parent, *pred);
|
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/regalloc/src/ |
H A D | analysis_control_flow.rs | 329 bix2rpostord: &TypedIxVec<BlockIx, u32>, in dt_merge_sets() 337 let rpo1 = bix2rpostord[node1]; in dt_merge_sets() 338 let rpo2 = bix2rpostord[node2]; in dt_merge_sets() 367 let mut bix2rpostord = TypedIxVec::<BlockIx, u32>::new(); localVariable 369 bix2rpostord.resize(num_blocks, DT_INVALID_POSTORD); 375 bix2rpostord[bix] = n; 380 debug_assert!(bix2rpostord[BlockIx::new(n)] < num_blocks); 410 let rponum = bix2rpostord[node]; 417 let pred_rpo = bix2rpostord[*pred]; 433 parent = dt_merge_sets(&idom, &bix2rpostord, parent, *pred);
|