Add global value numbering pass.
This commit is contained in:
parent
551c7183f8
commit
8b848af325
33 changed files with 6476 additions and 26 deletions
413
compiler/rustc_mir_transform/src/gvn.rs
Normal file
413
compiler/rustc_mir_transform/src/gvn.rs
Normal file
|
@ -0,0 +1,413 @@
|
|||
use rustc_data_structures::fx::{FxHashMap, FxIndexSet};
|
||||
use rustc_data_structures::graph::dominators::Dominators;
|
||||
use rustc_index::bit_set::BitSet;
|
||||
use rustc_index::IndexVec;
|
||||
use rustc_macros::newtype_index;
|
||||
use rustc_middle::mir::visit::*;
|
||||
use rustc_middle::mir::*;
|
||||
use rustc_middle::ty::{self, Ty, TyCtxt};
|
||||
use rustc_target::abi::{VariantIdx, FIRST_VARIANT};
|
||||
|
||||
use crate::ssa::SsaLocals;
|
||||
use crate::MirPass;
|
||||
|
||||
/// Global value numbering.
|
||||
pub struct GVN;
|
||||
|
||||
impl<'tcx> MirPass<'tcx> for GVN {
|
||||
fn is_enabled(&self, sess: &rustc_session::Session) -> bool {
|
||||
sess.mir_opt_level() >= 4
|
||||
}
|
||||
|
||||
#[instrument(level = "trace", skip(self, tcx, body))]
|
||||
fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
|
||||
debug!(def_id = ?body.source.def_id());
|
||||
propagate_ssa(tcx, body);
|
||||
}
|
||||
}
|
||||
|
||||
fn propagate_ssa<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
|
||||
let param_env = tcx.param_env_reveal_all_normalized(body.source.def_id());
|
||||
let ssa = SsaLocals::new(body);
|
||||
// Clone dominators as we need them while mutating the body.
|
||||
let dominators = body.basic_blocks.dominators().clone();
|
||||
|
||||
let mut state = VnState::new(tcx, param_env, &body.local_decls);
|
||||
for arg in body.args_iter() {
|
||||
if ssa.is_ssa(arg) {
|
||||
let value = state.new_opaque().unwrap();
|
||||
state.assign(arg, value);
|
||||
}
|
||||
}
|
||||
|
||||
for (local, rvalue, _) in ssa.assignments(body) {
|
||||
let value = state.insert_rvalue(rvalue).or_else(|| state.new_opaque()).unwrap();
|
||||
state.assign(local, value);
|
||||
}
|
||||
|
||||
// Stop creating opaques during replacement as it is useless.
|
||||
state.next_opaque = None;
|
||||
|
||||
let mut any_replacement = false;
|
||||
let mut replacer = Replacer {
|
||||
tcx,
|
||||
param_env,
|
||||
ssa,
|
||||
dominators,
|
||||
state,
|
||||
reused_locals: BitSet::new_empty(body.local_decls.len()),
|
||||
any_replacement: &mut any_replacement,
|
||||
};
|
||||
|
||||
let reverse_postorder = body.basic_blocks.reverse_postorder().to_vec();
|
||||
for bb in reverse_postorder {
|
||||
let data = &mut body.basic_blocks.as_mut_preserves_cfg()[bb];
|
||||
replacer.visit_basic_block_data(bb, data);
|
||||
}
|
||||
|
||||
StorageRemover { tcx, reused_locals: replacer.reused_locals }.visit_body_preserves_cfg(body);
|
||||
|
||||
if any_replacement {
|
||||
crate::simplify::remove_unused_definitions(body);
|
||||
}
|
||||
}
|
||||
|
||||
newtype_index! {
|
||||
struct VnIndex {}
|
||||
}
|
||||
|
||||
#[derive(Debug, PartialEq, Eq, Hash)]
|
||||
enum Value<'tcx> {
|
||||
// Root values.
|
||||
/// Used to represent values we know nothing about.
|
||||
/// The `usize` is a counter incremented by `new_opaque`.
|
||||
Opaque(usize),
|
||||
/// Evaluated or unevaluated constant value.
|
||||
Constant(Const<'tcx>),
|
||||
/// An aggregate value, either tuple/closure/struct/enum.
|
||||
/// This does not contain unions, as we cannot reason with the value.
|
||||
Aggregate(Ty<'tcx>, VariantIdx, Vec<VnIndex>),
|
||||
/// This corresponds to a `[value; count]` expression.
|
||||
Repeat(VnIndex, ty::Const<'tcx>),
|
||||
/// The address of a place.
|
||||
Address {
|
||||
place: Place<'tcx>,
|
||||
/// Give each borrow and pointer a different provenance, so we don't merge them.
|
||||
provenance: usize,
|
||||
},
|
||||
|
||||
// Extractions.
|
||||
/// This is the *value* obtained by projecting another value.
|
||||
Projection(VnIndex, ProjectionElem<VnIndex, Ty<'tcx>>),
|
||||
/// Discriminant of the given value.
|
||||
Discriminant(VnIndex),
|
||||
/// Length of an array or slice.
|
||||
Len(VnIndex),
|
||||
|
||||
// Operations.
|
||||
NullaryOp(NullOp<'tcx>, Ty<'tcx>),
|
||||
UnaryOp(UnOp, VnIndex),
|
||||
BinaryOp(BinOp, VnIndex, VnIndex),
|
||||
CheckedBinaryOp(BinOp, VnIndex, VnIndex),
|
||||
Cast {
|
||||
kind: CastKind,
|
||||
value: VnIndex,
|
||||
from: Ty<'tcx>,
|
||||
to: Ty<'tcx>,
|
||||
},
|
||||
}
|
||||
|
||||
struct VnState<'body, 'tcx> {
|
||||
tcx: TyCtxt<'tcx>,
|
||||
param_env: ty::ParamEnv<'tcx>,
|
||||
local_decls: &'body LocalDecls<'tcx>,
|
||||
/// Value stored in each local.
|
||||
locals: IndexVec<Local, Option<VnIndex>>,
|
||||
/// First local to be assigned that value.
|
||||
rev_locals: FxHashMap<VnIndex, Vec<Local>>,
|
||||
values: FxIndexSet<Value<'tcx>>,
|
||||
/// Counter to generate different values.
|
||||
/// This is an option to stop creating opaques during replacement.
|
||||
next_opaque: Option<usize>,
|
||||
}
|
||||
|
||||
impl<'body, 'tcx> VnState<'body, 'tcx> {
|
||||
fn new(
|
||||
tcx: TyCtxt<'tcx>,
|
||||
param_env: ty::ParamEnv<'tcx>,
|
||||
local_decls: &'body LocalDecls<'tcx>,
|
||||
) -> Self {
|
||||
VnState {
|
||||
tcx,
|
||||
param_env,
|
||||
local_decls,
|
||||
locals: IndexVec::from_elem(None, local_decls),
|
||||
rev_locals: FxHashMap::default(),
|
||||
values: FxIndexSet::default(),
|
||||
next_opaque: Some(0),
|
||||
}
|
||||
}
|
||||
|
||||
#[instrument(level = "trace", skip(self), ret)]
|
||||
fn insert(&mut self, value: Value<'tcx>) -> VnIndex {
|
||||
let (index, _) = self.values.insert_full(value);
|
||||
VnIndex::from_usize(index)
|
||||
}
|
||||
|
||||
#[instrument(level = "trace", skip(self), ret)]
|
||||
fn new_opaque(&mut self) -> Option<VnIndex> {
|
||||
let next_opaque = self.next_opaque.as_mut()?;
|
||||
let value = Value::Opaque(*next_opaque);
|
||||
*next_opaque += 1;
|
||||
Some(self.insert(value))
|
||||
}
|
||||
|
||||
#[instrument(level = "trace", skip(self), ret)]
|
||||
fn new_pointer(&mut self, place: Place<'tcx>) -> Option<VnIndex> {
|
||||
let next_opaque = self.next_opaque.as_mut()?;
|
||||
let value = Value::Address { place, provenance: *next_opaque };
|
||||
*next_opaque += 1;
|
||||
Some(self.insert(value))
|
||||
}
|
||||
|
||||
fn get(&self, index: VnIndex) -> &Value<'tcx> {
|
||||
self.values.get_index(index.as_usize()).unwrap()
|
||||
}
|
||||
|
||||
#[instrument(level = "trace", skip(self))]
|
||||
fn assign(&mut self, local: Local, value: VnIndex) {
|
||||
self.locals[local] = Some(value);
|
||||
self.rev_locals.entry(value).or_default().push(local);
|
||||
}
|
||||
|
||||
#[instrument(level = "trace", skip(self), ret)]
|
||||
fn insert_place(&mut self, place: Place<'tcx>) -> Option<VnIndex> {
|
||||
let mut value = self.locals[place.local]?;
|
||||
|
||||
for (index, proj) in place.projection.iter().enumerate() {
|
||||
let proj = match proj {
|
||||
ProjectionElem::Deref => {
|
||||
let ty = Place::ty_from(
|
||||
place.local,
|
||||
&place.projection[..index],
|
||||
self.local_decls,
|
||||
self.tcx,
|
||||
)
|
||||
.ty;
|
||||
if let Some(Mutability::Not) = ty.ref_mutability()
|
||||
&& let Some(pointee_ty) = ty.builtin_deref(true)
|
||||
&& pointee_ty.ty.is_freeze(self.tcx, self.param_env)
|
||||
{
|
||||
// An immutable borrow `_x` always points to the same value for the
|
||||
// lifetime of the borrow, so we can merge all instances of `*_x`.
|
||||
ProjectionElem::Deref
|
||||
} else {
|
||||
return None;
|
||||
}
|
||||
}
|
||||
ProjectionElem::Field(f, ty) => ProjectionElem::Field(f, ty),
|
||||
ProjectionElem::Index(idx) => {
|
||||
let idx = self.locals[idx]?;
|
||||
ProjectionElem::Index(idx)
|
||||
}
|
||||
ProjectionElem::ConstantIndex { offset, min_length, from_end } => {
|
||||
ProjectionElem::ConstantIndex { offset, min_length, from_end }
|
||||
}
|
||||
ProjectionElem::Subslice { from, to, from_end } => {
|
||||
ProjectionElem::Subslice { from, to, from_end }
|
||||
}
|
||||
ProjectionElem::Downcast(name, index) => ProjectionElem::Downcast(name, index),
|
||||
ProjectionElem::OpaqueCast(ty) => ProjectionElem::OpaqueCast(ty),
|
||||
};
|
||||
value = self.insert(Value::Projection(value, proj));
|
||||
}
|
||||
|
||||
Some(value)
|
||||
}
|
||||
|
||||
#[instrument(level = "trace", skip(self), ret)]
|
||||
fn insert_operand(&mut self, operand: &Operand<'tcx>) -> Option<VnIndex> {
|
||||
match *operand {
|
||||
Operand::Constant(ref constant) => Some(self.insert(Value::Constant(constant.const_))),
|
||||
Operand::Copy(place) | Operand::Move(place) => self.insert_place(place),
|
||||
}
|
||||
}
|
||||
|
||||
#[instrument(level = "trace", skip(self), ret)]
|
||||
fn insert_rvalue(&mut self, rvalue: &Rvalue<'tcx>) -> Option<VnIndex> {
|
||||
let value = match *rvalue {
|
||||
// Forward values.
|
||||
Rvalue::Use(ref operand) => return self.insert_operand(operand),
|
||||
Rvalue::CopyForDeref(place) => return self.insert_operand(&Operand::Copy(place)),
|
||||
|
||||
// Roots.
|
||||
Rvalue::Repeat(ref op, amount) => {
|
||||
let op = self.insert_operand(op)?;
|
||||
Value::Repeat(op, amount)
|
||||
}
|
||||
Rvalue::NullaryOp(op, ty) => Value::NullaryOp(op, ty),
|
||||
Rvalue::Aggregate(box ref kind, ref fields) => {
|
||||
let variant_index = match *kind {
|
||||
AggregateKind::Array(..)
|
||||
| AggregateKind::Tuple
|
||||
| AggregateKind::Closure(..)
|
||||
| AggregateKind::Generator(..) => FIRST_VARIANT,
|
||||
AggregateKind::Adt(_, variant_index, _, _, None) => variant_index,
|
||||
// Do not track unions.
|
||||
AggregateKind::Adt(_, _, _, _, Some(_)) => return None,
|
||||
};
|
||||
let fields: Option<Vec<_>> = fields
|
||||
.iter()
|
||||
.map(|op| self.insert_operand(op).or_else(|| self.new_opaque()))
|
||||
.collect();
|
||||
let ty = rvalue.ty(self.local_decls, self.tcx);
|
||||
Value::Aggregate(ty, variant_index, fields?)
|
||||
}
|
||||
Rvalue::Ref(.., place) | Rvalue::AddressOf(_, place) => return self.new_pointer(place),
|
||||
|
||||
// Operations.
|
||||
Rvalue::Len(place) => {
|
||||
let place = self.insert_place(place)?;
|
||||
Value::Len(place)
|
||||
}
|
||||
Rvalue::Cast(kind, ref value, to) => {
|
||||
let from = value.ty(self.local_decls, self.tcx);
|
||||
let value = self.insert_operand(value)?;
|
||||
Value::Cast { kind, value, from, to }
|
||||
}
|
||||
Rvalue::BinaryOp(op, box (ref lhs, ref rhs)) => {
|
||||
let lhs = self.insert_operand(lhs)?;
|
||||
let rhs = self.insert_operand(rhs)?;
|
||||
Value::BinaryOp(op, lhs, rhs)
|
||||
}
|
||||
Rvalue::CheckedBinaryOp(op, box (ref lhs, ref rhs)) => {
|
||||
let lhs = self.insert_operand(lhs)?;
|
||||
let rhs = self.insert_operand(rhs)?;
|
||||
Value::CheckedBinaryOp(op, lhs, rhs)
|
||||
}
|
||||
Rvalue::UnaryOp(op, ref arg) => {
|
||||
let arg = self.insert_operand(arg)?;
|
||||
Value::UnaryOp(op, arg)
|
||||
}
|
||||
Rvalue::Discriminant(place) => {
|
||||
let place = self.insert_place(place)?;
|
||||
Value::Discriminant(place)
|
||||
}
|
||||
|
||||
// Unsupported values.
|
||||
Rvalue::ThreadLocalRef(..) | Rvalue::ShallowInitBox(..) => return None,
|
||||
};
|
||||
debug!(?value);
|
||||
Some(self.insert(value))
|
||||
}
|
||||
}
|
||||
|
||||
struct Replacer<'a, 'tcx> {
|
||||
tcx: TyCtxt<'tcx>,
|
||||
param_env: ty::ParamEnv<'tcx>,
|
||||
ssa: SsaLocals,
|
||||
dominators: Dominators<BasicBlock>,
|
||||
state: VnState<'a, 'tcx>,
|
||||
reused_locals: BitSet<Local>,
|
||||
any_replacement: &'a mut bool,
|
||||
}
|
||||
|
||||
impl<'tcx> Replacer<'_, 'tcx> {
|
||||
fn try_as_constant(&mut self, index: VnIndex) -> Option<ConstOperand<'tcx>> {
|
||||
if let Value::Constant(const_) = self.state.get(index) {
|
||||
Some(ConstOperand { span: rustc_span::DUMMY_SP, user_ty: None, const_: const_.clone() })
|
||||
} else {
|
||||
None
|
||||
}
|
||||
}
|
||||
|
||||
fn try_as_local(&mut self, index: VnIndex, loc: Location) -> Option<Local> {
|
||||
let other = self.state.rev_locals.get(&index)?;
|
||||
other
|
||||
.iter()
|
||||
.copied()
|
||||
.find(|&other| self.ssa.assignment_dominates(&self.dominators, other, loc))
|
||||
}
|
||||
|
||||
fn is_local_copiable(&self, local: Local) -> bool {
|
||||
let ty = self.state.local_decls[local].ty;
|
||||
// We only unify copy types as we only emit copies.
|
||||
// We already simplify mutable reborrows as assignments, so we also allow copying those.
|
||||
ty.is_ref() || ty.is_copy_modulo_regions(self.tcx, self.param_env)
|
||||
}
|
||||
}
|
||||
|
||||
impl<'tcx> MutVisitor<'tcx> for Replacer<'_, 'tcx> {
|
||||
fn tcx(&self) -> TyCtxt<'tcx> {
|
||||
self.tcx
|
||||
}
|
||||
|
||||
fn visit_operand(&mut self, operand: &mut Operand<'tcx>, location: Location) {
|
||||
if let Some(place) = operand.place()
|
||||
&& let Some(value) = self.state.insert_place(place)
|
||||
{
|
||||
if let Some(const_) = self.try_as_constant(value) {
|
||||
*operand = Operand::Constant(Box::new(const_));
|
||||
*self.any_replacement = true;
|
||||
} else if let Some(local) = self.try_as_local(value, location)
|
||||
&& *operand != Operand::Move(local.into())
|
||||
&& self.is_local_copiable(local)
|
||||
{
|
||||
*operand = Operand::Copy(local.into());
|
||||
self.reused_locals.insert(local);
|
||||
*self.any_replacement = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fn visit_statement(&mut self, stmt: &mut Statement<'tcx>, location: Location) {
|
||||
self.super_statement(stmt, location);
|
||||
if let StatementKind::Assign(box (_, ref mut rvalue)) = stmt.kind
|
||||
&& let Some(value) = self.state.insert_rvalue(rvalue)
|
||||
{
|
||||
if let Some(const_) = self.try_as_constant(value) {
|
||||
*rvalue = Rvalue::Use(Operand::Constant(Box::new(const_)));
|
||||
*self.any_replacement = true;
|
||||
} else if let Some(local) = self.try_as_local(value, location)
|
||||
&& *rvalue != Rvalue::Use(Operand::Move(local.into()))
|
||||
&& self.is_local_copiable(local)
|
||||
{
|
||||
*rvalue = Rvalue::Use(Operand::Copy(local.into()));
|
||||
self.reused_locals.insert(local);
|
||||
*self.any_replacement = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
struct StorageRemover<'tcx> {
|
||||
tcx: TyCtxt<'tcx>,
|
||||
reused_locals: BitSet<Local>,
|
||||
}
|
||||
|
||||
impl<'tcx> MutVisitor<'tcx> for StorageRemover<'tcx> {
|
||||
fn tcx(&self) -> TyCtxt<'tcx> {
|
||||
self.tcx
|
||||
}
|
||||
|
||||
fn visit_operand(&mut self, operand: &mut Operand<'tcx>, _: Location) {
|
||||
if let Operand::Move(place) = *operand
|
||||
&& let Some(local) = place.as_local()
|
||||
&& self.reused_locals.contains(local)
|
||||
{
|
||||
*operand = Operand::Copy(place);
|
||||
}
|
||||
}
|
||||
|
||||
fn visit_statement(&mut self, stmt: &mut Statement<'tcx>, loc: Location) {
|
||||
match stmt.kind {
|
||||
// When removing storage statements, we need to remove both (#107511).
|
||||
StatementKind::StorageLive(l) | StatementKind::StorageDead(l)
|
||||
if self.reused_locals.contains(l) =>
|
||||
{
|
||||
stmt.make_nop()
|
||||
}
|
||||
_ => self.super_statement(stmt, loc),
|
||||
}
|
||||
}
|
||||
}
|
|
@ -76,6 +76,7 @@ mod errors;
|
|||
mod ffi_unwind_calls;
|
||||
mod function_item_references;
|
||||
mod generator;
|
||||
mod gvn;
|
||||
pub mod inline;
|
||||
mod instsimplify;
|
||||
mod large_enums;
|
||||
|
@ -549,6 +550,7 @@ fn run_optimization_passes<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
|
|||
// latter pass will leverage the created opportunities.
|
||||
&separate_const_switch::SeparateConstSwitch,
|
||||
&const_prop::ConstProp,
|
||||
&gvn::GVN,
|
||||
&dataflow_const_prop::DataflowConstProp,
|
||||
//
|
||||
// Const-prop runs unconditionally, but doesn't mutate the MIR at mir-opt-level=0.
|
||||
|
|
|
@ -108,7 +108,7 @@ enum Value<'tcx> {
|
|||
}
|
||||
|
||||
/// For each local, save the place corresponding to `*local`.
|
||||
#[instrument(level = "trace", skip(tcx, body))]
|
||||
#[instrument(level = "trace", skip(tcx, body, ssa))]
|
||||
fn compute_replacement<'tcx>(
|
||||
tcx: TyCtxt<'tcx>,
|
||||
body: &Body<'tcx>,
|
||||
|
|
|
@ -13,7 +13,6 @@ use rustc_middle::middle::resolve_bound_vars::Set1;
|
|||
use rustc_middle::mir::visit::*;
|
||||
use rustc_middle::mir::*;
|
||||
|
||||
#[derive(Debug)]
|
||||
pub struct SsaLocals {
|
||||
/// Assignments to each local. This defines whether the local is SSA.
|
||||
assignments: IndexVec<Local, Set1<LocationExtended>>,
|
||||
|
@ -129,6 +128,25 @@ impl SsaLocals {
|
|||
self.direct_uses[local]
|
||||
}
|
||||
|
||||
pub fn assignment_dominates(
|
||||
&self,
|
||||
dominators: &Dominators<BasicBlock>,
|
||||
local: Local,
|
||||
location: Location,
|
||||
) -> bool {
|
||||
match self.assignments[local] {
|
||||
Set1::One(LocationExtended::Arg) => true,
|
||||
Set1::One(LocationExtended::Plain(ass)) => {
|
||||
if ass.block == location.block {
|
||||
ass.statement_index < location.statement_index
|
||||
} else {
|
||||
dominators.dominates(ass.block, location.block)
|
||||
}
|
||||
}
|
||||
_ => false,
|
||||
}
|
||||
}
|
||||
|
||||
pub fn assignments<'a, 'tcx>(
|
||||
&'a self,
|
||||
body: &'a Body<'tcx>,
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue