Sort custom_legalizes for more deterministic generated code
For better caching.
This commit is contained in:
committed by
Benjamin Bouvier
parent
ff3c44385c
commit
97996d79ce
@@ -466,7 +466,9 @@ fn gen_transform_group<'a>(
|
|||||||
|
|
||||||
// Emit the custom transforms. The Rust compiler will complain about any overlap with
|
// Emit the custom transforms. The Rust compiler will complain about any overlap with
|
||||||
// the normal transforms.
|
// the normal transforms.
|
||||||
for (inst_camel_name, func_name) in &group.custom_legalizes {
|
let mut sorted_custom_legalizes = Vec::from_iter(&group.custom_legalizes);
|
||||||
|
sorted_custom_legalizes.sort();
|
||||||
|
for (inst_camel_name, func_name) in sorted_custom_legalizes {
|
||||||
fmtln!(fmt, "ir::Opcode::{} => {{", inst_camel_name);
|
fmtln!(fmt, "ir::Opcode::{} => {{", inst_camel_name);
|
||||||
fmt.indent(|fmt| {
|
fmt.indent(|fmt| {
|
||||||
fmtln!(fmt, "{}(inst, pos.func, cfg, isa);", func_name);
|
fmtln!(fmt, "{}(inst, pos.func, cfg, isa);", func_name);
|
||||||
|
|||||||
Reference in New Issue
Block a user