2019-12-22 17:42:04 -05:00
|
|
|
use crate::util::elaborate_drops::DropFlagState;
|
2020-03-29 16:41:09 +02:00
|
|
|
use rustc_middle::mir::{self, Body, Location};
|
|
|
|
use rustc_middle::ty::{self, TyCtxt};
|
2020-06-29 17:20:41 -07:00
|
|
|
use rustc_target::abi::VariantIdx;
|
2016-01-25 14:34:34 +01:00
|
|
|
|
2017-06-26 14:57:26 +02:00
|
|
|
use super::indexes::MovePathIndex;
|
2019-12-22 17:42:04 -05:00
|
|
|
use super::move_paths::{InitKind, LookupResult, MoveData};
|
|
|
|
use super::MoveDataParamEnv;
|
2017-06-26 14:57:26 +02:00
|
|
|
|
2019-12-22 17:42:04 -05:00
|
|
|
pub fn move_path_children_matching<'tcx, F>(
|
|
|
|
move_data: &MoveData<'tcx>,
|
|
|
|
path: MovePathIndex,
|
|
|
|
mut cond: F,
|
|
|
|
) -> Option<MovePathIndex>
|
|
|
|
where
|
2020-05-23 12:02:54 +02:00
|
|
|
F: FnMut(mir::PlaceElem<'tcx>) -> bool,
|
2016-05-17 02:26:18 +03:00
|
|
|
{
|
2016-06-11 23:47:28 +03:00
|
|
|
let mut next_child = move_data.move_paths[path].first_child;
|
2016-05-17 02:26:18 +03:00
|
|
|
while let Some(child_index) = next_child {
|
2019-08-24 19:49:08 -04:00
|
|
|
let move_path_children = &move_data.move_paths[child_index];
|
2020-05-23 12:02:54 +02:00
|
|
|
if let Some(&elem) = move_path_children.place.projection.last() {
|
2019-08-24 19:49:08 -04:00
|
|
|
if cond(elem) {
|
2019-12-22 17:42:04 -05:00
|
|
|
return Some(child_index);
|
2019-08-24 19:49:08 -04:00
|
|
|
}
|
2016-05-17 02:26:18 +03:00
|
|
|
}
|
2019-08-24 19:49:08 -04:00
|
|
|
next_child = move_path_children.next_sibling;
|
2016-05-17 02:26:18 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
None
|
|
|
|
}
|
|
|
|
|
2016-06-06 16:16:44 +02:00
|
|
|
/// When enumerating the child fragments of a path, don't recurse into
|
|
|
|
/// paths (1.) past arrays, slices, and pointers, nor (2.) into a type
|
|
|
|
/// that implements `Drop`.
|
|
|
|
///
|
2017-12-01 14:31:47 +02:00
|
|
|
/// Places behind references or arrays are not tracked by elaboration
|
2016-06-06 16:16:44 +02:00
|
|
|
/// and are always assumed to be initialized when accessible. As
|
|
|
|
/// references and indexes can be reseated, trying to track them can
|
|
|
|
/// only lead to trouble.
|
|
|
|
///
|
2017-12-01 14:31:47 +02:00
|
|
|
/// Places behind ADT's with a Drop impl are not tracked by
|
2016-06-06 16:16:44 +02:00
|
|
|
/// elaboration since they can never have a drop-flag state that
|
|
|
|
/// differs from that of the parent with the Drop impl.
|
|
|
|
///
|
|
|
|
/// In both cases, the contents can only be accessed if and only if
|
|
|
|
/// their parents are initialized. This implies for example that there
|
|
|
|
/// is no need to maintain separate drop flags to track such state.
|
2019-02-08 14:53:55 +01:00
|
|
|
//
|
|
|
|
// FIXME: we have to do something for moving slice patterns.
|
2019-06-14 00:48:52 +03:00
|
|
|
fn place_contents_drop_state_cannot_differ<'tcx>(
|
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-12 00:11:55 +03:00
|
|
|
body: &Body<'tcx>,
|
2020-03-31 14:20:42 -03:00
|
|
|
place: mir::Place<'tcx>,
|
2019-06-12 00:11:55 +03:00
|
|
|
) -> bool {
|
2019-06-03 18:26:48 -04:00
|
|
|
let ty = place.ty(body, tcx).ty;
|
2020-08-03 00:49:11 +02:00
|
|
|
match ty.kind() {
|
2018-08-22 01:35:02 +01:00
|
|
|
ty::Array(..) => {
|
2019-12-22 17:42:04 -05:00
|
|
|
debug!(
|
|
|
|
"place_contents_drop_state_cannot_differ place: {:?} ty: {:?} => false",
|
|
|
|
place, ty
|
|
|
|
);
|
2017-11-28 15:48:23 +03:00
|
|
|
false
|
|
|
|
}
|
2018-08-22 01:35:02 +01:00
|
|
|
ty::Slice(..) | ty::Ref(..) | ty::RawPtr(..) => {
|
2019-12-22 17:42:04 -05:00
|
|
|
debug!(
|
|
|
|
"place_contents_drop_state_cannot_differ place: {:?} ty: {:?} refd => true",
|
|
|
|
place, ty
|
|
|
|
);
|
2016-06-06 16:16:44 +02:00
|
|
|
true
|
|
|
|
}
|
2018-08-22 01:35:02 +01:00
|
|
|
ty::Adt(def, _) if (def.has_dtor(tcx) && !def.is_box()) || def.is_union() => {
|
2019-12-22 17:42:04 -05:00
|
|
|
debug!(
|
|
|
|
"place_contents_drop_state_cannot_differ place: {:?} ty: {:?} Drop => true",
|
|
|
|
place, ty
|
|
|
|
);
|
2016-06-06 16:16:44 +02:00
|
|
|
true
|
|
|
|
}
|
2019-12-22 17:42:04 -05:00
|
|
|
_ => false,
|
2016-06-06 16:16:44 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-01-01 01:53:25 +01:00
|
|
|
pub fn on_lookup_result_bits<'tcx, F>(
|
2019-06-14 00:48:52 +03:00
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-03 18:26:48 -04:00
|
|
|
body: &Body<'tcx>,
|
2016-06-11 23:47:28 +03:00
|
|
|
move_data: &MoveData<'tcx>,
|
|
|
|
lookup_result: LookupResult,
|
2019-06-12 00:11:55 +03:00
|
|
|
each_child: F,
|
|
|
|
) where
|
|
|
|
F: FnMut(MovePathIndex),
|
2016-06-11 23:47:28 +03:00
|
|
|
{
|
|
|
|
match lookup_result {
|
|
|
|
LookupResult::Parent(..) => {
|
|
|
|
// access to untracked value - do not touch children
|
|
|
|
}
|
2019-12-22 17:42:04 -05:00
|
|
|
LookupResult::Exact(e) => on_all_children_bits(tcx, body, move_data, e, each_child),
|
2016-06-11 23:47:28 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-01-01 01:53:25 +01:00
|
|
|
pub fn on_all_children_bits<'tcx, F>(
|
2019-06-14 00:48:52 +03:00
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-03 18:26:48 -04:00
|
|
|
body: &Body<'tcx>,
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
move_data: &MoveData<'tcx>,
|
|
|
|
move_path_index: MovePathIndex,
|
2019-06-12 00:11:55 +03:00
|
|
|
mut each_child: F,
|
|
|
|
) where
|
|
|
|
F: FnMut(MovePathIndex),
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
{
|
2019-06-14 00:48:52 +03:00
|
|
|
fn is_terminal_path<'tcx>(
|
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-03 18:26:48 -04:00
|
|
|
body: &Body<'tcx>,
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
move_data: &MoveData<'tcx>,
|
2019-06-12 00:11:55 +03:00
|
|
|
path: MovePathIndex,
|
|
|
|
) -> bool {
|
2020-03-31 14:20:42 -03:00
|
|
|
place_contents_drop_state_cannot_differ(tcx, body, move_data.move_paths[path].place)
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
}
|
|
|
|
|
2019-06-14 00:48:52 +03:00
|
|
|
fn on_all_children_bits<'tcx, F>(
|
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-03 18:26:48 -04:00
|
|
|
body: &Body<'tcx>,
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
move_data: &MoveData<'tcx>,
|
|
|
|
move_path_index: MovePathIndex,
|
2019-06-12 00:11:55 +03:00
|
|
|
each_child: &mut F,
|
|
|
|
) where
|
|
|
|
F: FnMut(MovePathIndex),
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
{
|
|
|
|
each_child(move_path_index);
|
|
|
|
|
2019-06-03 18:26:48 -04:00
|
|
|
if is_terminal_path(tcx, body, move_data, move_path_index) {
|
2019-12-22 17:42:04 -05:00
|
|
|
return;
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
let mut next_child_index = move_data.move_paths[move_path_index].first_child;
|
|
|
|
while let Some(child_index) = next_child_index {
|
2019-06-03 18:26:48 -04:00
|
|
|
on_all_children_bits(tcx, body, move_data, child_index, each_child);
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
next_child_index = move_data.move_paths[child_index].next_sibling;
|
|
|
|
}
|
|
|
|
}
|
2019-06-03 18:26:48 -04:00
|
|
|
on_all_children_bits(tcx, body, move_data, move_path_index, &mut each_child);
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
}
|
|
|
|
|
2021-01-01 01:53:25 +01:00
|
|
|
pub fn on_all_drop_children_bits<'tcx, F>(
|
2019-06-14 00:48:52 +03:00
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-03 18:26:48 -04:00
|
|
|
body: &Body<'tcx>,
|
2019-06-14 00:48:52 +03:00
|
|
|
ctxt: &MoveDataParamEnv<'tcx>,
|
2017-04-07 01:00:53 +03:00
|
|
|
path: MovePathIndex,
|
2019-06-12 00:11:55 +03:00
|
|
|
mut each_child: F,
|
|
|
|
) where
|
|
|
|
F: FnMut(MovePathIndex),
|
2017-04-07 01:00:53 +03:00
|
|
|
{
|
2019-06-03 18:26:48 -04:00
|
|
|
on_all_children_bits(tcx, body, &ctxt.move_data, path, |child| {
|
2017-12-01 14:39:51 +02:00
|
|
|
let place = &ctxt.move_data.move_paths[path].place;
|
2019-06-03 18:26:48 -04:00
|
|
|
let ty = place.ty(body, tcx).ty;
|
2017-12-01 14:39:51 +02:00
|
|
|
debug!("on_all_drop_children_bits({:?}, {:?} : {:?})", path, place, ty);
|
2017-04-07 01:00:53 +03:00
|
|
|
|
2020-10-24 02:21:18 +02:00
|
|
|
let erased_ty = tcx.erase_regions(ty);
|
2019-09-25 15:36:14 -04:00
|
|
|
if erased_ty.needs_drop(tcx, ctxt.param_env) {
|
2017-04-07 01:00:53 +03:00
|
|
|
each_child(child);
|
|
|
|
} else {
|
|
|
|
debug!("on_all_drop_children_bits - skipping")
|
|
|
|
}
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2021-01-01 01:53:25 +01:00
|
|
|
pub fn drop_flag_effects_for_function_entry<'tcx, F>(
|
2019-06-14 00:48:52 +03:00
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-03 18:26:48 -04:00
|
|
|
body: &Body<'tcx>,
|
2019-06-14 00:48:52 +03:00
|
|
|
ctxt: &MoveDataParamEnv<'tcx>,
|
2019-06-12 00:11:55 +03:00
|
|
|
mut callback: F,
|
|
|
|
) where
|
|
|
|
F: FnMut(MovePathIndex, DropFlagState),
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
{
|
2016-05-24 23:03:52 +02:00
|
|
|
let move_data = &ctxt.move_data;
|
2019-06-03 18:26:48 -04:00
|
|
|
for arg in body.args_iter() {
|
2019-06-24 17:46:09 +02:00
|
|
|
let place = mir::Place::from(arg);
|
2019-07-21 22:38:30 +02:00
|
|
|
let lookup_result = move_data.rev_lookup.find(place.as_ref());
|
2019-12-22 17:42:04 -05:00
|
|
|
on_lookup_result_bits(tcx, body, move_data, lookup_result, |mpi| {
|
|
|
|
callback(mpi, DropFlagState::Present)
|
|
|
|
});
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-01-01 01:53:25 +01:00
|
|
|
pub fn drop_flag_effects_for_location<'tcx, F>(
|
2019-06-14 00:48:52 +03:00
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-03 18:26:48 -04:00
|
|
|
body: &Body<'tcx>,
|
2019-06-14 00:48:52 +03:00
|
|
|
ctxt: &MoveDataParamEnv<'tcx>,
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
loc: Location,
|
2019-06-12 00:11:55 +03:00
|
|
|
mut callback: F,
|
|
|
|
) where
|
|
|
|
F: FnMut(MovePathIndex, DropFlagState),
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
{
|
2016-05-24 23:03:52 +02:00
|
|
|
let move_data = &ctxt.move_data;
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
debug!("drop_flag_effects_for_location({:?})", loc);
|
|
|
|
|
|
|
|
// first, move out of the RHS
|
|
|
|
for mi in &move_data.loc_map[loc] {
|
|
|
|
let path = mi.move_path_index(move_data);
|
|
|
|
debug!("moving out of path {:?}", move_data.move_paths[path]);
|
|
|
|
|
2019-12-22 17:42:04 -05:00
|
|
|
on_all_children_bits(tcx, body, move_data, path, |mpi| callback(mpi, DropFlagState::Absent))
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
}
|
|
|
|
|
2017-11-27 08:06:36 +00:00
|
|
|
debug!("drop_flag_effects: assignment for location({:?})", loc);
|
|
|
|
|
2019-12-22 17:42:04 -05:00
|
|
|
for_location_inits(tcx, body, move_data, loc, |mpi| callback(mpi, DropFlagState::Present));
|
2017-11-27 08:06:36 +00:00
|
|
|
}
|
|
|
|
|
2020-12-30 18:48:40 +01:00
|
|
|
pub fn for_location_inits<'tcx, F>(
|
2019-06-14 00:48:52 +03:00
|
|
|
tcx: TyCtxt<'tcx>,
|
2019-06-03 18:26:48 -04:00
|
|
|
body: &Body<'tcx>,
|
2017-11-27 08:06:36 +00:00
|
|
|
move_data: &MoveData<'tcx>,
|
|
|
|
loc: Location,
|
2019-06-12 00:11:55 +03:00
|
|
|
mut callback: F,
|
|
|
|
) where
|
|
|
|
F: FnMut(MovePathIndex),
|
2017-11-27 08:06:36 +00:00
|
|
|
{
|
|
|
|
for ii in &move_data.init_loc_map[loc] {
|
|
|
|
let init = move_data.inits[*ii];
|
|
|
|
match init.kind {
|
|
|
|
InitKind::Deep => {
|
|
|
|
let path = init.path;
|
|
|
|
|
2019-12-22 17:42:04 -05:00
|
|
|
on_all_children_bits(tcx, body, move_data, path, &mut callback)
|
|
|
|
}
|
2017-11-27 08:06:36 +00:00
|
|
|
InitKind::Shallow => {
|
|
|
|
let mpi = init.path;
|
|
|
|
callback(mpi);
|
2016-05-17 01:06:52 +03:00
|
|
|
}
|
2017-11-27 08:06:36 +00:00
|
|
|
InitKind::NonPanicPathOnly => (),
|
Revised mir-dataflow.
Incorporates many fixes contributed by arielb1.
----
revise borrowck::mir::dataflow code to allow varying domain for bitvectors.
This particular code implements the `BitDenotation` trait for three
analyses:
* `MovingOutStatements`, which, like `borrowck::move_data`, maps each
bit-index to a move instruction, and a 1 means "the effect of this
move reaches this point" (and the assigned l-value, if a scoped
declaration, is still in scope).
* `MaybeInitializedLvals`, which maps each bit-index to an l-value.
A 1 means "there exists a control flow path to this point that
initializes the associated l-value."
* `MaybeUninitializedLvals`, which maps each bit-index to an l-value
A 1 means "there exists a control flow path to this point that
de-initializes the associated l-value."
----
Revised `graphviz` dataflow-rendering support in `borrowck::mir`.
One big difference is that this code is now parameterized over the
`BitDenotation`, so that it can be used to render dataflow results
independent of how the dataflow bitvectors are interpreted; see where
reference to `MoveOut` is replaced by the type parameter `D`.
----
Factor out routine to query subattributes in `#[rustc_mir(..)]`.
(Later commits build upon this for some unit testing and instrumentation.)
----
thread through a tcx so that I can query types of lvalues as part of analysis.
----
Revised `BitDenotation::Ctxt`, allowing variation beyond `MoveData`.
The main motivation is to ease threading through a `TyCtxt`.
(In hindsight it might have been better to instead attach the `TyCtxt`
to each of the different dataflow implementations, but that would
require e.g. switching away from having a `Default` impl, so I am
leaving that experiment for another time.)
2016-05-02 15:50:27 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2020-06-29 17:20:41 -07:00
|
|
|
|
|
|
|
/// Calls `handle_inactive_variant` for each descendant move path of `enum_place` that contains a
|
|
|
|
/// `Downcast` to a variant besides the `active_variant`.
|
|
|
|
///
|
|
|
|
/// NOTE: If there are no move paths corresponding to an inactive variant,
|
|
|
|
/// `handle_inactive_variant` will not be called for that variant.
|
|
|
|
pub(crate) fn on_all_inactive_variants<'tcx>(
|
|
|
|
tcx: TyCtxt<'tcx>,
|
|
|
|
body: &mir::Body<'tcx>,
|
|
|
|
move_data: &MoveData<'tcx>,
|
|
|
|
enum_place: mir::Place<'tcx>,
|
|
|
|
active_variant: VariantIdx,
|
|
|
|
mut handle_inactive_variant: impl FnMut(MovePathIndex),
|
|
|
|
) {
|
|
|
|
let enum_mpi = match move_data.rev_lookup.find(enum_place.as_ref()) {
|
|
|
|
LookupResult::Exact(mpi) => mpi,
|
|
|
|
LookupResult::Parent(_) => return,
|
|
|
|
};
|
|
|
|
|
|
|
|
let enum_path = &move_data.move_paths[enum_mpi];
|
|
|
|
for (variant_mpi, variant_path) in enum_path.children(&move_data.move_paths) {
|
|
|
|
// Because of the way we build the `MoveData` tree, each child should have exactly one more
|
|
|
|
// projection than `enum_place`. This additional projection must be a downcast since the
|
|
|
|
// base is an enum.
|
|
|
|
let (downcast, base_proj) = variant_path.place.projection.split_last().unwrap();
|
|
|
|
assert_eq!(enum_place.projection.len(), base_proj.len());
|
|
|
|
|
|
|
|
let variant_idx = match *downcast {
|
|
|
|
mir::ProjectionElem::Downcast(_, idx) => idx,
|
|
|
|
_ => unreachable!(),
|
|
|
|
};
|
|
|
|
|
|
|
|
if variant_idx != active_variant {
|
|
|
|
on_all_children_bits(tcx, body, move_data, variant_mpi, |mpi| {
|
|
|
|
handle_inactive_variant(mpi)
|
|
|
|
});
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|