nordic-dev.net/rust-gpu
2
0
Fork 0
mirror of https://github.com/EmbarkStudios/rust-gpu.git synced 2024-11-25 16:25:25 +00:00
Code Issues Packages Projects Releases Wiki Activity

Export zombie link information

Browse Source 
To support the linker being able to do zombie shenans
This commit is contained in:
khyperia 2020-09-15 10:55:15 +02:00
parent 2b1e8a26df
commit ec6608f1b5
1 changed files with 37 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
rustc_codegen_spirv/src/finalizing_passes.rs
View File

@ -1,5 +1,5 @@
use rspirv::dr::{Block, Function, Instruction, Module, Operand};
use rspirv::spirv::{Op, Word};
use rspirv::dr::{Block, Function, Instruction, Module, ModuleHeader, Operand};
use rspirv::spirv::{Decoration, LinkageType, Op, Word};
use std::collections::hash_map::Entry;
use std::collections::{HashMap, HashSet};
use std::iter::once;
@ -34,6 +34,8 @@ pub fn zombie_pass(module: &mut Module, zombie: &mut HashMap<Word, &'static str>
// Note: This is O(n^2).
while spread_zombie(module, zombie) {}
export_zombies(module, zombie);
if option_env!("PRINT_ZOMBIE").is_some() {
for f in &module.functions {
if let Some(reason) = is_zombie(f.def.as_ref().unwrap(), zombie) {
@ -155,6 +157,39 @@ fn spread_zombie(module: &mut Module, zombie: &mut HashMap<Word, &'static str>)
any
}
fn export_zombies(module: &mut Module, zombie: &HashMap<Word, &'static str>) {
fn id(header: &mut Option<ModuleHeader>) -> Word {
let header = match header {
Some(h) => h,
None => panic!(),
};
let id = header.bound;
header.bound += 1;
id
}
for inst in &module.annotations {
if inst.class.opcode == Op::Decorate
&& inst.operands[1] == Operand::Decoration(Decoration::LinkageAttributes)
&& inst.operands[3] == Operand::LinkageType(LinkageType::Export)
{
let (target, name) = match (&inst.operands[0], &inst.operands[2]) {
(&Operand::IdRef(id), Operand::LiteralString(name)) => (id, name),
_ => panic!(),
};
if zombie.contains_key(&target) {
let str = format!("rustc_codegen_spirv_export_zombie_symbol={}", name);
let dummy_id = id(&mut module.header);
module.debugs.push(Instruction::new(
Op::String,
None,
Some(dummy_id),
vec![Operand::LiteralString(str)],
));
}
}
}
}
// https://en.wikipedia.org/wiki/Topological_sorting#Kahn's_algorithm
pub fn block_ordering_pass(func: &mut Function) {
if func.blocks.len() < 2 {