1 // Copyright 2017 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! This query borrow-checks the MIR to (further) ensure it is not broken.
13 use rustc::hir::def_id::{DefId};
14 use rustc::infer::{InferCtxt};
15 use rustc::ty::{self, TyCtxt, ParamEnv};
16 use rustc::ty::maps::Providers;
17 use rustc::mir::{AssertMessage, BasicBlock, BorrowKind, Location, Lvalue};
18 use rustc::mir::{Mir, Mutability, Operand, Projection, ProjectionElem, Rvalue};
19 use rustc::mir::{Statement, StatementKind, Terminator, TerminatorKind};
20 use rustc::mir::transform::{MirSource};
22 use rustc_data_structures::indexed_set::{self, IdxSetBuf};
23 use rustc_data_structures::indexed_vec::{Idx};
25 use syntax::ast::{self};
26 use syntax_pos::{DUMMY_SP, Span};
28 use dataflow::{do_dataflow};
29 use dataflow::{MoveDataParamEnv};
30 use dataflow::{BitDenotation, BlockSets, DataflowResults, DataflowResultsConsumer};
31 use dataflow::{MaybeInitializedLvals, MaybeUninitializedLvals};
32 use dataflow::{Borrows, BorrowData, BorrowIndex};
33 use dataflow::move_paths::{HasMoveData, MoveData, MovePathIndex, LookupResult};
34 use util::borrowck_errors::{BorrowckErrors, Origin};
36 use self::MutateMode::{JustWrite, WriteAndRead};
37 use self::ConsumeKind::{Consume};
40 pub fn provide(providers: &mut Providers) {
41 *providers = Providers {
47 fn mir_borrowck<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) {
48 let mir = tcx.mir_validated(def_id);
49 let src = MirSource::from_local_def_id(tcx, def_id);
50 debug!("run query mir_borrowck: {}", tcx.node_path_str(src.item_id()));
52 let mir: &Mir<'tcx> = &mir.borrow();
53 if !tcx.has_attr(def_id, "rustc_mir_borrowck") && !tcx.sess.opts.debugging_opts.borrowck_mir {
57 let id = src.item_id();
58 let attributes = tcx.get_attrs(def_id);
59 let param_env = tcx.param_env(def_id);
60 tcx.infer_ctxt().enter(|_infcx| {
62 let move_data = MoveData::gather_moves(mir, tcx, param_env);
63 let mdpe = MoveDataParamEnv { move_data: move_data, param_env: param_env };
64 let dead_unwinds = IdxSetBuf::new_empty(mir.basic_blocks().len());
65 let flow_borrows = do_dataflow(tcx, mir, id, &attributes, &dead_unwinds,
66 Borrows::new(tcx, mir),
67 |bd, i| bd.location(i));
68 let flow_inits = do_dataflow(tcx, mir, id, &attributes, &dead_unwinds,
69 MaybeInitializedLvals::new(tcx, mir, &mdpe),
70 |bd, i| &bd.move_data().move_paths[i]);
71 let flow_uninits = do_dataflow(tcx, mir, id, &attributes, &dead_unwinds,
72 MaybeUninitializedLvals::new(tcx, mir, &mdpe),
73 |bd, i| &bd.move_data().move_paths[i]);
75 let mut mbcx = MirBorrowckCtxt {
79 move_data: &mdpe.move_data,
81 fake_infer_ctxt: &_infcx,
84 let mut state = InProgress::new(flow_borrows,
88 mbcx.analyze_results(&mut state); // entry point for DataflowResultsConsumer
91 debug!("mir_borrowck done");
95 pub struct MirBorrowckCtxt<'c, 'b, 'a: 'b+'c, 'gcx: 'a+'tcx, 'tcx: 'a> {
96 tcx: TyCtxt<'a, 'gcx, 'gcx>,
99 move_data: &'b MoveData<'gcx>,
100 param_env: ParamEnv<'tcx>,
101 fake_infer_ctxt: &'c InferCtxt<'c, 'gcx, 'tcx>,
104 // (forced to be `pub` due to its use as an associated type below.)
105 pub struct InProgress<'b, 'tcx: 'b> {
106 borrows: FlowInProgress<Borrows<'b, 'tcx>>,
107 inits: FlowInProgress<MaybeInitializedLvals<'b, 'tcx>>,
108 uninits: FlowInProgress<MaybeUninitializedLvals<'b, 'tcx>>,
111 struct FlowInProgress<BD> where BD: BitDenotation {
112 base_results: DataflowResults<BD>,
113 curr_state: IdxSetBuf<BD::Idx>,
114 stmt_gen: IdxSetBuf<BD::Idx>,
115 stmt_kill: IdxSetBuf<BD::Idx>,
119 // 1. assignments are always made to mutable locations (FIXME: does that still really go here?)
120 // 2. loans made in overlapping scopes do not conflict
121 // 3. assignments do not affect things loaned out as immutable
122 // 4. moves do not affect things loaned out in any way
123 impl<'c, 'b, 'a: 'b+'c, 'gcx, 'tcx: 'a> DataflowResultsConsumer<'b, 'gcx>
124 for MirBorrowckCtxt<'c, 'b, 'a, 'gcx, 'tcx>
126 type FlowState = InProgress<'b, 'gcx>;
128 fn mir(&self) -> &'b Mir<'gcx> { self.mir }
130 fn reset_to_entry_of(&mut self, bb: BasicBlock, flow_state: &mut Self::FlowState) {
131 flow_state.each_flow(|b| b.reset_to_entry_of(bb),
132 |i| i.reset_to_entry_of(bb),
133 |u| u.reset_to_entry_of(bb));
136 fn reconstruct_statement_effect(&mut self,
138 flow_state: &mut Self::FlowState) {
139 flow_state.each_flow(|b| b.reconstruct_statement_effect(location),
140 |i| i.reconstruct_statement_effect(location),
141 |u| u.reconstruct_statement_effect(location));
144 fn apply_local_effect(&mut self,
146 flow_state: &mut Self::FlowState) {
147 flow_state.each_flow(|b| b.apply_local_effect(),
148 |i| i.apply_local_effect(),
149 |u| u.apply_local_effect());
152 fn reconstruct_terminator_effect(&mut self,
154 flow_state: &mut Self::FlowState) {
155 flow_state.each_flow(|b| b.reconstruct_terminator_effect(location),
156 |i| i.reconstruct_terminator_effect(location),
157 |u| u.reconstruct_terminator_effect(location));
160 fn visit_block_entry(&mut self,
162 flow_state: &Self::FlowState) {
163 let summary = flow_state.summary();
164 debug!("MirBorrowckCtxt::process_block({:?}): {}", bb, summary);
167 fn visit_statement_entry(&mut self,
169 stmt: &Statement<'gcx>,
170 flow_state: &Self::FlowState) {
171 let summary = flow_state.summary();
172 debug!("MirBorrowckCtxt::process_statement({:?}, {:?}): {}", location, stmt, summary);
173 let span = stmt.source_info.span;
175 StatementKind::Assign(ref lhs, ref rhs) => {
176 self.mutate_lvalue(ContextKind::AssignLhs.new(location),
177 (lhs, span), JustWrite, flow_state);
178 self.consume_rvalue(ContextKind::AssignRhs.new(location),
179 (rhs, span), location, flow_state);
181 StatementKind::SetDiscriminant { ref lvalue, variant_index: _ } => {
182 self.mutate_lvalue(ContextKind::SetDiscrim.new(location),
183 (lvalue, span), JustWrite, flow_state);
185 StatementKind::InlineAsm { ref asm, ref outputs, ref inputs } => {
186 for (o, output) in asm.outputs.iter().zip(outputs) {
188 self.consume_lvalue(ContextKind::InlineAsm.new(location),
193 self.mutate_lvalue(ContextKind::InlineAsm.new(location),
195 if o.is_rw { WriteAndRead } else { JustWrite },
199 for input in inputs {
200 self.consume_operand(ContextKind::InlineAsm.new(location),
202 (input, span), flow_state);
205 StatementKind::EndRegion(ref _rgn) => {
206 // ignored when consuming results (update to
207 // flow_state already handled).
210 StatementKind::Validate(..) |
211 StatementKind::StorageLive(..) => {
212 // ignored by borrowck
215 StatementKind::StorageDead(local) => {
216 // causes non-drop values to be dropped.
217 self.consume_lvalue(ContextKind::StorageDead.new(location),
218 ConsumeKind::Consume,
219 (&Lvalue::Local(local), span),
225 fn visit_terminator_entry(&mut self,
227 term: &Terminator<'gcx>,
228 flow_state: &Self::FlowState) {
230 let summary = flow_state.summary();
231 debug!("MirBorrowckCtxt::process_terminator({:?}, {:?}): {}", location, term, summary);
232 let span = term.source_info.span;
234 TerminatorKind::SwitchInt { ref discr, switch_ty: _, values: _, targets: _ } => {
235 self.consume_operand(ContextKind::SwitchInt.new(loc),
237 (discr, span), flow_state);
239 TerminatorKind::Drop { location: ref drop_lvalue, target: _, unwind: _ } => {
240 self.consume_lvalue(ContextKind::Drop.new(loc),
242 (drop_lvalue, span), flow_state);
244 TerminatorKind::DropAndReplace { location: ref drop_lvalue,
245 value: ref new_value,
248 self.mutate_lvalue(ContextKind::DropAndReplace.new(loc),
249 (drop_lvalue, span), JustWrite, flow_state);
250 self.consume_operand(ContextKind::DropAndReplace.new(loc),
252 (new_value, span), flow_state);
254 TerminatorKind::Call { ref func, ref args, ref destination, cleanup: _ } => {
255 self.consume_operand(ContextKind::CallOperator.new(loc),
257 (func, span), flow_state);
259 self.consume_operand(ContextKind::CallOperand.new(loc),
261 (arg, span), flow_state);
263 if let Some((ref dest, _/*bb*/)) = *destination {
264 self.mutate_lvalue(ContextKind::CallDest.new(loc),
265 (dest, span), JustWrite, flow_state);
268 TerminatorKind::Assert { ref cond, expected: _, ref msg, target: _, cleanup: _ } => {
269 self.consume_operand(ContextKind::Assert.new(loc),
271 (cond, span), flow_state);
273 AssertMessage::BoundsCheck { ref len, ref index } => {
274 self.consume_operand(ContextKind::Assert.new(loc),
276 (len, span), flow_state);
277 self.consume_operand(ContextKind::Assert.new(loc),
279 (index, span), flow_state);
281 AssertMessage::Math(_/*const_math_err*/) => {}
282 AssertMessage::GeneratorResumedAfterReturn => {}
283 AssertMessage::GeneratorResumedAfterPanic => {}
287 TerminatorKind::Yield { ref value, resume: _, drop: _} => {
288 self.consume_operand(ContextKind::Yield.new(loc),
289 Consume, (value, span), flow_state);
292 TerminatorKind::Goto { target: _ } |
293 TerminatorKind::Resume |
294 TerminatorKind::Return |
295 TerminatorKind::GeneratorDrop |
296 TerminatorKind::Unreachable => {
297 // no data used, thus irrelevant to borrowck
303 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
304 enum MutateMode { JustWrite, WriteAndRead }
306 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
307 enum ConsumeKind { Drop, Consume }
309 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
310 enum Control { Continue, Break }
312 impl<'c, 'b, 'a: 'b+'c, 'gcx, 'tcx: 'a> MirBorrowckCtxt<'c, 'b, 'a, 'gcx, 'tcx> {
313 fn mutate_lvalue(&mut self,
315 lvalue_span: (&Lvalue<'gcx>, Span),
317 flow_state: &InProgress<'b, 'gcx>) {
318 // Write of P[i] or *P, or WriteAndRead of any P, requires P init'd.
320 MutateMode::WriteAndRead => {
321 self.check_if_path_is_moved(context, lvalue_span, flow_state);
323 MutateMode::JustWrite => {
324 self.check_if_assigned_path_is_moved(context, lvalue_span, flow_state);
328 // check we don't invalidate any outstanding loans
329 self.each_borrow_involving_path(context,
330 lvalue_span.0, flow_state, |this, _index, _data| {
331 this.report_illegal_mutation_of_borrowed(context,
336 // check for reassignments to immutable local variables
337 self.check_if_reassignment_to_immutable_state(context, lvalue_span, flow_state);
340 fn consume_rvalue(&mut self,
342 (rvalue, span): (&Rvalue<'gcx>, Span),
344 flow_state: &InProgress<'b, 'gcx>) {
346 Rvalue::Ref(_/*rgn*/, bk, ref lvalue) => {
347 self.borrow(context, location, bk, (lvalue, span), flow_state)
350 Rvalue::Use(ref operand) |
351 Rvalue::Repeat(ref operand, _) |
352 Rvalue::UnaryOp(_/*un_op*/, ref operand) |
353 Rvalue::Cast(_/*cast_kind*/, ref operand, _/*ty*/) => {
354 self.consume_operand(context, Consume, (operand, span), flow_state)
357 Rvalue::Len(ref lvalue) |
358 Rvalue::Discriminant(ref lvalue) => {
359 // len(_)/discriminant(_) merely read, not consume.
360 self.check_if_path_is_moved(context, (lvalue, span), flow_state);
363 Rvalue::BinaryOp(_bin_op, ref operand1, ref operand2) |
364 Rvalue::CheckedBinaryOp(_bin_op, ref operand1, ref operand2) => {
365 self.consume_operand(context, Consume, (operand1, span), flow_state);
366 self.consume_operand(context, Consume, (operand2, span), flow_state);
369 Rvalue::NullaryOp(_op, _ty) => {
370 // nullary ops take no dynamic input; no borrowck effect.
372 // FIXME: is above actually true? Do we want to track
373 // the fact that uninitialized data can be created via
377 Rvalue::Aggregate(ref _aggregate_kind, ref operands) => {
378 for operand in operands {
379 self.consume_operand(context, Consume, (operand, span), flow_state);
385 fn consume_operand(&mut self,
387 consume_via_drop: ConsumeKind,
388 (operand, span): (&Operand<'gcx>, Span),
389 flow_state: &InProgress<'b, 'gcx>) {
391 Operand::Consume(ref lvalue) =>
392 self.consume_lvalue(context, consume_via_drop, (lvalue, span), flow_state),
393 Operand::Constant(_) => {}
397 fn consume_lvalue(&mut self,
399 consume_via_drop: ConsumeKind,
400 lvalue_span: (&Lvalue<'gcx>, Span),
401 flow_state: &InProgress<'b, 'gcx>) {
402 let lvalue = lvalue_span.0;
403 let ty = lvalue.ty(self.mir, self.tcx).to_ty(self.tcx);
404 let moves_by_default =
405 self.fake_infer_ctxt.type_moves_by_default(self.param_env, ty, DUMMY_SP);
406 if moves_by_default {
407 // move of lvalue: check if this is move of already borrowed path
408 self.each_borrow_involving_path(
409 context, lvalue_span.0, flow_state, |this, _idx, borrow| {
410 if !borrow.compatible_with(BorrowKind::Mut) {
411 this.report_move_out_while_borrowed(context, lvalue_span);
418 // copy of lvalue: check if this is "copy of frozen path" (FIXME: see check_loans.rs)
419 self.each_borrow_involving_path(
420 context, lvalue_span.0, flow_state, |this, _idx, borrow| {
421 if !borrow.compatible_with(BorrowKind::Shared) {
422 this.report_use_while_mutably_borrowed(context, lvalue_span);
430 // Finally, check if path was already moved.
431 match consume_via_drop {
432 ConsumeKind::Drop => {
433 // If path is merely being dropped, then we'll already
434 // check the drop flag to see if it is moved (thus we
435 // skip this check in that case).
437 ConsumeKind::Consume => {
438 self.check_if_path_is_moved(context, lvalue_span, flow_state);
447 lvalue_span: (&Lvalue<'gcx>, Span),
448 flow_state: &InProgress<'b, 'gcx>) {
449 debug!("borrow location: {:?} lvalue: {:?} span: {:?}",
450 location, lvalue_span.0, lvalue_span.1);
451 self.check_if_path_is_moved(context, lvalue_span, flow_state);
452 self.check_for_conflicting_loans(context, location, bk, lvalue_span, flow_state);
456 impl<'c, 'b, 'a: 'b+'c, 'gcx, 'tcx: 'a> MirBorrowckCtxt<'c, 'b, 'a, 'gcx, 'tcx> {
457 fn check_if_reassignment_to_immutable_state(&mut self,
459 (lvalue, span): (&Lvalue<'gcx>, Span),
460 flow_state: &InProgress<'b, 'gcx>) {
461 let move_data = flow_state.inits.base_results.operator().move_data();
463 // determine if this path has a non-mut owner (and thus needs checking).
467 Lvalue::Projection(ref proj) => {
471 Lvalue::Local(local) => {
472 match self.mir.local_decls[local].mutability {
473 Mutability::Not => break, // needs check
474 Mutability::Mut => return,
477 Lvalue::Static(_) => {
478 // mutation of non-mut static is always illegal,
479 // independent of dataflow.
480 self.report_assignment_to_static(context, (lvalue, span));
486 if let Some(mpi) = self.move_path_for_lvalue(context, move_data, lvalue) {
487 if flow_state.inits.curr_state.contains(&mpi) {
488 // may already be assigned before reaching this statement;
490 self.report_illegal_reassignment(context, (lvalue, span));
495 fn check_if_path_is_moved(&mut self,
497 lvalue_span: (&Lvalue<'gcx>, Span),
498 flow_state: &InProgress<'b, 'gcx>) {
499 // FIXME: analogous code in check_loans first maps `lvalue` to
500 // its base_path ... but is that what we want here?
501 let lvalue = self.base_path(lvalue_span.0);
503 let maybe_uninits = &flow_state.uninits;
504 let move_data = maybe_uninits.base_results.operator().move_data();
505 if let Some(mpi) = self.move_path_for_lvalue(context, move_data, lvalue) {
506 if maybe_uninits.curr_state.contains(&mpi) {
507 // find and report move(s) that could cause this to be uninitialized
508 self.report_use_of_moved(context, lvalue_span);
510 // sanity check: initialized on *some* path, right?
511 assert!(flow_state.inits.curr_state.contains(&mpi));
516 fn move_path_for_lvalue(&mut self,
518 move_data: &MoveData<'gcx>,
519 lvalue: &Lvalue<'gcx>)
520 -> Option<MovePathIndex>
522 // If returns None, then there is no move path corresponding
523 // to a direct owner of `lvalue` (which means there is nothing
524 // that borrowck tracks for its analysis).
526 match move_data.rev_lookup.find(lvalue) {
527 LookupResult::Parent(_) => None,
528 LookupResult::Exact(mpi) => Some(mpi),
532 fn check_if_assigned_path_is_moved(&mut self,
534 (lvalue, span): (&Lvalue<'gcx>, Span),
535 flow_state: &InProgress<'b, 'gcx>) {
536 // recur down lvalue; dispatch to check_if_path_is_moved when necessary
537 let mut lvalue = lvalue;
540 Lvalue::Local(_) | Lvalue::Static(_) => {
541 // assigning to `x` does not require `x` be initialized.
544 Lvalue::Projection(ref proj) => {
545 let Projection { ref base, ref elem } = **proj;
547 ProjectionElem::Deref |
548 // assigning to *P requires `P` initialized.
549 ProjectionElem::Index(_/*operand*/) |
550 ProjectionElem::ConstantIndex { .. } |
551 // assigning to P[i] requires `P` initialized.
552 ProjectionElem::Downcast(_/*adt_def*/, _/*variant_idx*/) =>
553 // assigning to (P->variant) is okay if assigning to `P` is okay
555 // FIXME: is this true even if P is a adt with a dtor?
558 ProjectionElem::Subslice { .. } => {
559 panic!("we dont allow assignments to subslices, context: {:?}",
563 ProjectionElem::Field(..) => {
564 // if type of `P` has a dtor, then
565 // assigning to `P.f` requires `P` itself
566 // be already initialized
568 match base.ty(self.mir, tcx).to_ty(tcx).sty {
569 ty::TyAdt(def, _) if def.has_dtor(tcx) => {
571 // FIXME: analogous code in
572 // check_loans.rs first maps
573 // `base` to its base_path.
575 self.check_if_path_is_moved(context,
576 (base, span), flow_state);
578 // (base initialized; no need to
594 fn check_for_conflicting_loans(&mut self,
598 lvalue_span: (&Lvalue<'gcx>, Span),
599 flow_state: &InProgress<'b, 'gcx>) {
600 // NOTE FIXME: The analogous code in old borrowck
601 // check_loans.rs is careful to iterate over every *issued*
602 // loan, as opposed to just the in scope ones.
604 // (Or if you prefer, all the *other* iterations over loans
605 // only consider loans that are in scope of some given
608 // The (currently skeletal) code here does not encode such a
609 // distinction, which means it is almost certainly over
610 // looking something.
612 // (It is probably going to reject code that should be
613 // accepted, I suspect, by treated issued-but-out-of-scope
614 // loans as issued-and-in-scope, and thus causing them to
615 // interfere with other loans.)
617 // However, I just want to get something running, especially
618 // since I am trying to move into new territory with NLL, so
619 // lets get this going first, and then address the issued vs
620 // in-scope distinction later.
622 let state = &flow_state.borrows;
623 let data = &state.base_results.operator().borrows();
625 debug!("check_for_conflicting_loans location: {:?}", _location);
627 // does any loan generated here conflict with a previously issued loan?
628 let mut loans_generated = 0;
629 for (g, gen) in state.elems_generated().map(|g| (g, &data[g])) {
630 loans_generated += 1;
631 for (i, issued) in state.elems_incoming().map(|i| (i, &data[i])) {
632 debug!("check_for_conflicting_loans gen: {:?} issued: {:?} conflicts: {}",
633 (g, gen, self.base_path(&gen.lvalue),
634 self.restrictions(&gen.lvalue).collect::<Vec<_>>()),
635 (i, issued, self.base_path(&issued.lvalue),
636 self.restrictions(&issued.lvalue).collect::<Vec<_>>()),
637 self.conflicts_with(gen, issued));
638 if self.conflicts_with(gen, issued) {
639 self.report_conflicting_borrow(context, lvalue_span, gen, issued);
644 // MIR statically ensures each statement gens *at most one*
645 // loan; mutual conflict (within a statement) can't arise.
647 // As safe-guard, assert that above property actually holds.
648 assert!(loans_generated <= 1);
651 impl<'c, 'b, 'a: 'b+'c, 'gcx, 'tcx: 'a> MirBorrowckCtxt<'c, 'b, 'a, 'gcx, 'tcx> {
652 fn each_borrow_involving_path<F>(&mut self,
654 lvalue: &Lvalue<'gcx>,
655 flow_state: &InProgress<'b, 'gcx>,
657 where F: FnMut(&mut Self, BorrowIndex, &BorrowData<'gcx>) -> Control
659 // FIXME: analogous code in check_loans first maps `lvalue` to
662 let domain = flow_state.borrows.base_results.operator();
663 let data = domain.borrows();
665 // check for loan restricting path P being used. Accounts for
666 // borrows of P, P.a.b, etc.
667 for i in flow_state.borrows.elems_incoming() {
668 // FIXME: check_loans.rs filtered this to "in scope"
669 // loans; i.e. it took a scope S and checked that each
670 // restriction's kill_scope was a superscope of S.
671 let borrowed = &data[i];
672 for restricted in self.restrictions(&borrowed.lvalue) {
673 if restricted == lvalue {
674 let ctrl = op(self, i, borrowed);
675 if ctrl == Control::Break { return; }
680 // check for loans (not restrictions) on any base path.
681 // e.g. Rejects `{ let x = &mut a.b; let y = a.b.c; }`,
682 // since that moves out of borrowed path `a.b`.
684 // Limiting to loans (not restrictions) keeps this one
685 // working: `{ let x = &mut a.b; let y = a.c; }`
686 let mut cursor = lvalue;
688 // FIXME: check_loans.rs invoked `op` *before* cursor
689 // shift here. Might just work (and even avoid redundant
690 // errors?) given code above? But for now, I want to try
691 // doing what I think is more "natural" check.
692 for i in flow_state.borrows.elems_incoming() {
693 let borrowed = &data[i];
694 if borrowed.lvalue == *cursor {
695 let ctrl = op(self, i, borrowed);
696 if ctrl == Control::Break { return; }
701 Lvalue::Local(_) | Lvalue::Static(_) => break,
702 Lvalue::Projection(ref proj) => cursor = &proj.base,
709 use super::MirBorrowckCtxt;
712 use rustc::ty::{self, TyCtxt};
713 use rustc::mir::{Lvalue, Mir, ProjectionElem};
715 pub(super) struct Restrictions<'c, 'tcx: 'c> {
717 tcx: TyCtxt<'c, 'tcx, 'tcx>,
718 lvalue_stack: Vec<&'c Lvalue<'tcx>>,
721 impl<'c, 'b, 'a: 'b+'c, 'gcx, 'tcx: 'a> MirBorrowckCtxt<'c, 'b, 'a, 'gcx, 'tcx> {
722 pub(super) fn restrictions<'d>(&self,
723 lvalue: &'d Lvalue<'gcx>)
724 -> Restrictions<'d, 'gcx> where 'b: 'd
726 let lvalue_stack = if self.has_restrictions(lvalue) { vec![lvalue] } else { vec![] };
727 Restrictions { lvalue_stack: lvalue_stack, mir: self.mir, tcx: self.tcx }
730 fn has_restrictions(&self, lvalue: &Lvalue<'gcx>) -> bool {
731 let mut cursor = lvalue;
733 let proj = match *cursor {
734 Lvalue::Local(_) => return true,
735 Lvalue::Static(_) => return false,
736 Lvalue::Projection(ref proj) => proj,
739 ProjectionElem::Index(..) |
740 ProjectionElem::ConstantIndex { .. } |
741 ProjectionElem::Downcast(..) |
742 ProjectionElem::Subslice { .. } |
743 ProjectionElem::Field(_/*field*/, _/*ty*/) => {
747 ProjectionElem::Deref => {
748 let ty = proj.base.ty(self.mir, self.tcx).to_ty(self.tcx);
753 ty::TyRef(_, ty::TypeAndMut { ty: _, mutbl: hir::MutImmutable }) => {
754 // FIXME: do I need to check validity of
755 // region here though? (I think the original
756 // check_loans code did, like readme says)
759 ty::TyRef(_, ty::TypeAndMut { ty: _, mutbl: hir::MutMutable }) => {
763 ty::TyAdt(..) if ty.is_box() => {
768 panic!("unknown type fed to Projection Deref.");
777 impl<'c, 'tcx> Iterator for Restrictions<'c, 'tcx> {
778 type Item = &'c Lvalue<'tcx>;
779 fn next(&mut self) -> Option<Self::Item> {
781 let lvalue = match self.lvalue_stack.pop() {
783 Some(lvalue) => lvalue,
786 // `lvalue` may not be a restriction itself, but may
787 // hold one further down (e.g. we never return
788 // downcasts here, but may return a base of a
791 // Also, we need to enqueue any additional
792 // subrestrictions that it implies, since we can only
793 // return from from this call alone.
795 let mut cursor = lvalue;
797 let proj = match *cursor {
798 Lvalue::Local(_) => return Some(cursor), // search yielded this leaf
799 Lvalue::Static(_) => continue 'pop, // fruitless leaf; try next on stack
800 Lvalue::Projection(ref proj) => proj,
804 ProjectionElem::Field(_/*field*/, _/*ty*/) => {
805 // FIXME: add union handling
806 self.lvalue_stack.push(&proj.base);
809 ProjectionElem::Downcast(..) |
810 ProjectionElem::Subslice { .. } |
811 ProjectionElem::ConstantIndex { .. } |
812 ProjectionElem::Index(_) => {
816 ProjectionElem::Deref => {
821 assert_eq!(proj.elem, ProjectionElem::Deref);
823 let ty = proj.base.ty(self.mir, self.tcx).to_ty(self.tcx);
826 // borrowck ignores raw ptrs; treat analogous to imm borrow
829 // R-Deref-Imm-Borrowed
830 ty::TyRef(_/*rgn*/, ty::TypeAndMut { ty: _, mutbl: hir::MutImmutable }) => {
831 // immutably-borrowed referents do not
832 // have recursively-implied restrictions
833 // (because preventing actions on `*LV`
834 // does nothing about aliases like `*LV1`)
836 // FIXME: do I need to check validity of
837 // `_r` here though? (I think the original
838 // check_loans code did, like the readme
841 // (And do I *really* not have to
842 // recursively process the `base` as a
843 // further search here? Leaving this `if
844 // false` here as a hint to look at this
847 // Ah, it might be because the
848 // restrictions are distinct from the path
849 // substructure. Note that there is a
850 // separate loop over the path
851 // substructure in fn
852 // each_borrow_involving_path, for better
863 // R-Deref-Mut-Borrowed
864 ty::TyRef(_/*rgn*/, ty::TypeAndMut { ty: _, mutbl: hir::MutMutable }) => {
865 // mutably-borrowed referents are
866 // themselves restricted.
868 // FIXME: do I need to check validity of
869 // `_r` here though? (I think the original
870 // check_loans code did, like the readme
873 // schedule base for future iteration.
874 self.lvalue_stack.push(&proj.base);
875 return Some(cursor); // search yielded interior node
878 // R-Deref-Send-Pointer
879 ty::TyAdt(..) if ty.is_box() => {
880 // borrowing interior of a box implies that
881 // its base can no longer be mutated (o/w box
882 // storage would be freed)
883 self.lvalue_stack.push(&proj.base);
884 return Some(cursor); // search yielded interior node
887 _ => panic!("unknown type fed to Projection Deref."),
895 impl<'c, 'b, 'a: 'b+'c, 'gcx, 'tcx: 'a> MirBorrowckCtxt<'c, 'b, 'a, 'gcx, 'tcx> {
896 fn report_use_of_moved(&mut self,
898 (lvalue, span): (&Lvalue, Span)) {
899 let mut err = self.tcx.cannot_act_on_uninitialized_variable(
900 span, "use", &self.describe_lvalue(lvalue), Origin::Mir);
901 // FIXME: add span_label for use of uninitialized variable
905 fn report_move_out_while_borrowed(&mut self,
907 (lvalue, span): (&Lvalue, Span)) {
908 let mut err = self.tcx.cannot_move_when_borrowed(
909 span, &self.describe_lvalue(lvalue), Origin::Mir);
910 // FIXME 1: add span_label for "borrow of `()` occurs here"
911 // FIXME 2: add span_label for "move out of `{}` occurs here"
915 fn report_use_while_mutably_borrowed(&mut self,
917 (lvalue, span): (&Lvalue, Span)) {
918 let mut err = self.tcx.cannot_use_when_mutably_borrowed(
919 span, &self.describe_lvalue(lvalue), Origin::Mir);
920 // FIXME 1: add span_label for "borrow of `()` occurs here"
921 // FIXME 2: add span_label for "use of `{}` occurs here"
925 fn report_conflicting_borrow(&mut self,
927 (lvalue, span): (&Lvalue, Span),
929 loan2: &BorrowData) {
930 // FIXME: obviously falsifiable. Generalize for non-eq lvalues later.
931 assert_eq!(loan1.lvalue, loan2.lvalue);
933 // FIXME: supply non-"" `opt_via` when appropriate
934 let mut err = match (loan1.kind, "immutable", "mutable",
935 loan2.kind, "immutable", "mutable") {
936 (BorrowKind::Shared, lft, _, BorrowKind::Mut, _, rgt) |
937 (BorrowKind::Mut, _, lft, BorrowKind::Shared, rgt, _) |
938 (BorrowKind::Mut, _, lft, BorrowKind::Mut, _, rgt) =>
939 self.tcx.cannot_reborrow_already_borrowed(
940 span, &self.describe_lvalue(lvalue),
941 "", lft, "it", rgt, "", Origin::Mir),
943 _ => self.tcx.cannot_mutably_borrow_multiply(
944 span, &self.describe_lvalue(lvalue), "", Origin::Mir),
945 // FIXME: add span labels for first and second mutable borrows, as well as
946 // end point for first.
951 fn report_illegal_mutation_of_borrowed(&mut self, _: Context, (lvalue, span): (&Lvalue, Span)) {
952 let mut err = self.tcx.cannot_assign_to_borrowed(
953 span, &self.describe_lvalue(lvalue), Origin::Mir);
954 // FIXME: add span labels for borrow and assignment points
958 fn report_illegal_reassignment(&mut self, _context: Context, (lvalue, span): (&Lvalue, Span)) {
959 let mut err = self.tcx.cannot_reassign_immutable(
960 span, &self.describe_lvalue(lvalue), Origin::Mir);
961 // FIXME: add span labels for borrow and assignment points
965 fn report_assignment_to_static(&mut self, _context: Context, (lvalue, span): (&Lvalue, Span)) {
966 let mut err = self.tcx.cannot_assign_static(
967 span, &self.describe_lvalue(lvalue), Origin::Mir);
968 // FIXME: add span labels for borrow and assignment points
973 impl<'c, 'b, 'a: 'b+'c, 'gcx, 'tcx: 'a> MirBorrowckCtxt<'c, 'b, 'a, 'gcx, 'tcx> {
974 // End-user visible description of `lvalue`
975 fn describe_lvalue(&self, lvalue: &Lvalue) -> String {
976 let mut buf = String::new();
977 self.append_lvalue_to_string(lvalue, &mut buf);
981 // Appends end-user visible description of `lvalue` to `buf`.
982 fn append_lvalue_to_string(&self, lvalue: &Lvalue, buf: &mut String) {
984 Lvalue::Local(local) => {
985 let local = &self.mir.local_decls[local];
987 Some(name) => buf.push_str(&format!("{}", name)),
988 None => buf.push_str("_"),
991 Lvalue::Static(ref static_) => {
992 buf.push_str(&format!("{}", &self.tcx.item_name(static_.def_id)));
994 Lvalue::Projection(ref proj) => {
995 let (prefix, suffix, index_operand) = match proj.elem {
996 ProjectionElem::Deref =>
997 ("(*", format!(")"), None),
998 ProjectionElem::Downcast(..) =>
999 ("", format!(""), None), // (dont emit downcast info)
1000 ProjectionElem::Field(field, _ty) =>
1001 ("", format!(".{}", field.index()), None),
1002 ProjectionElem::Index(index) =>
1003 ("", format!(""), Some(index)),
1004 ProjectionElem::ConstantIndex { offset, min_length, from_end: true } =>
1005 ("", format!("[{} of {}]", offset, min_length), None),
1006 ProjectionElem::ConstantIndex { offset, min_length, from_end: false } =>
1007 ("", format!("[-{} of {}]", offset, min_length), None),
1008 ProjectionElem::Subslice { from, to: 0 } =>
1009 ("", format!("[{}:]", from), None),
1010 ProjectionElem::Subslice { from: 0, to } =>
1011 ("", format!("[:-{}]", to), None),
1012 ProjectionElem::Subslice { from, to } =>
1013 ("", format!("[{}:-{}]", from, to), None),
1015 buf.push_str(prefix);
1016 self.append_lvalue_to_string(&proj.base, buf);
1017 if let Some(index) = index_operand {
1019 self.append_lvalue_to_string(&Lvalue::Local(index), buf);
1022 buf.push_str(&suffix);
1028 // Retrieve span of given borrow from the current MIR representation
1029 fn retrieve_borrow_span(&self, borrow: &BorrowData) -> Span {
1030 self.mir.basic_blocks()[borrow.location.block]
1031 .statements[borrow.location.statement_index]
1036 impl<'c, 'b, 'a: 'b+'c, 'gcx, 'tcx: 'a> MirBorrowckCtxt<'c, 'b, 'a, 'gcx, 'tcx> {
1037 // FIXME: needs to be able to express errors analogous to check_loans.rs
1038 fn conflicts_with(&self, loan1: &BorrowData<'gcx>, loan2: &BorrowData<'gcx>) -> bool {
1039 if loan1.compatible_with(loan2.kind) { return false; }
1041 let loan2_base_path = self.base_path(&loan2.lvalue);
1042 for restricted in self.restrictions(&loan1.lvalue) {
1043 if restricted != loan2_base_path { continue; }
1047 let loan1_base_path = self.base_path(&loan1.lvalue);
1048 for restricted in self.restrictions(&loan2.lvalue) {
1049 if restricted != loan1_base_path { continue; }
1056 // FIXME (#16118): function intended to allow the borrow checker
1057 // to be less precise in its handling of Box while still allowing
1058 // moves out of a Box. They should be removed when/if we stop
1059 // treating Box specially (e.g. when/if DerefMove is added...)
1061 fn base_path<'d>(&self, lvalue: &'d Lvalue<'gcx>) -> &'d Lvalue<'gcx> {
1062 //! Returns the base of the leftmost (deepest) dereference of an
1063 //! Box in `lvalue`. If there is no dereference of an Box
1064 //! in `lvalue`, then it just returns `lvalue` itself.
1066 let mut cursor = lvalue;
1067 let mut deepest = lvalue;
1069 let proj = match *cursor {
1070 Lvalue::Local(..) | Lvalue::Static(..) => return deepest,
1071 Lvalue::Projection(ref proj) => proj,
1073 if proj.elem == ProjectionElem::Deref &&
1074 lvalue.ty(self.mir, self.tcx).to_ty(self.tcx).is_box()
1076 deepest = &proj.base;
1078 cursor = &proj.base;
1083 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
1089 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
1107 fn new(self, loc: Location) -> Context { Context { kind: self, loc: loc } }
1110 impl<'b, 'tcx: 'b> InProgress<'b, 'tcx> {
1111 pub(super) fn new(borrows: DataflowResults<Borrows<'b, 'tcx>>,
1112 inits: DataflowResults<MaybeInitializedLvals<'b, 'tcx>>,
1113 uninits: DataflowResults<MaybeUninitializedLvals<'b, 'tcx>>)
1116 borrows: FlowInProgress::new(borrows),
1117 inits: FlowInProgress::new(inits),
1118 uninits: FlowInProgress::new(uninits),
1122 fn each_flow<XB, XI, XU>(&mut self,
1123 mut xform_borrows: XB,
1124 mut xform_inits: XI,
1125 mut xform_uninits: XU) where
1126 XB: FnMut(&mut FlowInProgress<Borrows<'b, 'tcx>>),
1127 XI: FnMut(&mut FlowInProgress<MaybeInitializedLvals<'b, 'tcx>>),
1128 XU: FnMut(&mut FlowInProgress<MaybeUninitializedLvals<'b, 'tcx>>),
1130 xform_borrows(&mut self.borrows);
1131 xform_inits(&mut self.inits);
1132 xform_uninits(&mut self.uninits);
1135 fn summary(&self) -> String {
1136 let mut s = String::new();
1138 s.push_str("borrows in effect: [");
1139 let mut saw_one = false;
1140 self.borrows.each_state_bit(|borrow| {
1141 if saw_one { s.push_str(", "); };
1143 let borrow_data = &self.borrows.base_results.operator().borrows()[borrow];
1144 s.push_str(&format!("{}", borrow_data));
1148 s.push_str("borrows generated: [");
1149 let mut saw_one = false;
1150 self.borrows.each_gen_bit(|borrow| {
1151 if saw_one { s.push_str(", "); };
1153 let borrow_data = &self.borrows.base_results.operator().borrows()[borrow];
1154 s.push_str(&format!("{}", borrow_data));
1158 s.push_str("inits: [");
1159 let mut saw_one = false;
1160 self.inits.each_state_bit(|mpi_init| {
1161 if saw_one { s.push_str(", "); };
1164 &self.inits.base_results.operator().move_data().move_paths[mpi_init];
1165 s.push_str(&format!("{}", move_path));
1169 s.push_str("uninits: [");
1170 let mut saw_one = false;
1171 self.uninits.each_state_bit(|mpi_uninit| {
1172 if saw_one { s.push_str(", "); };
1175 &self.uninits.base_results.operator().move_data().move_paths[mpi_uninit];
1176 s.push_str(&format!("{}", move_path));
1184 impl<BD> FlowInProgress<BD> where BD: BitDenotation {
1185 fn each_state_bit<F>(&self, f: F) where F: FnMut(BD::Idx) {
1186 self.curr_state.each_bit(self.base_results.operator().bits_per_block(), f)
1189 fn each_gen_bit<F>(&self, f: F) where F: FnMut(BD::Idx) {
1190 self.stmt_gen.each_bit(self.base_results.operator().bits_per_block(), f)
1193 fn new(results: DataflowResults<BD>) -> Self {
1194 let bits_per_block = results.sets().bits_per_block();
1195 let curr_state = IdxSetBuf::new_empty(bits_per_block);
1196 let stmt_gen = IdxSetBuf::new_empty(bits_per_block);
1197 let stmt_kill = IdxSetBuf::new_empty(bits_per_block);
1199 base_results: results,
1200 curr_state: curr_state,
1202 stmt_kill: stmt_kill,
1206 fn reset_to_entry_of(&mut self, bb: BasicBlock) {
1207 (*self.curr_state).clone_from(self.base_results.sets().on_entry_set_for(bb.index()));
1210 fn reconstruct_statement_effect(&mut self, loc: Location) {
1211 self.stmt_gen.reset_to_empty();
1212 self.stmt_kill.reset_to_empty();
1213 let mut ignored = IdxSetBuf::new_empty(0);
1214 let mut sets = BlockSets {
1215 on_entry: &mut ignored, gen_set: &mut self.stmt_gen, kill_set: &mut self.stmt_kill,
1217 self.base_results.operator().statement_effect(&mut sets, loc);
1220 fn reconstruct_terminator_effect(&mut self, loc: Location) {
1221 self.stmt_gen.reset_to_empty();
1222 self.stmt_kill.reset_to_empty();
1223 let mut ignored = IdxSetBuf::new_empty(0);
1224 let mut sets = BlockSets {
1225 on_entry: &mut ignored, gen_set: &mut self.stmt_gen, kill_set: &mut self.stmt_kill,
1227 self.base_results.operator().terminator_effect(&mut sets, loc);
1230 fn apply_local_effect(&mut self) {
1231 self.curr_state.union(&self.stmt_gen);
1232 self.curr_state.subtract(&self.stmt_kill);
1235 fn elems_generated(&self) -> indexed_set::Elems<BD::Idx> {
1236 let univ = self.base_results.sets().bits_per_block();
1237 self.stmt_gen.elems(univ)
1240 fn elems_incoming(&self) -> indexed_set::Elems<BD::Idx> {
1241 let univ = self.base_results.sets().bits_per_block();
1242 self.curr_state.elems(univ)
1246 impl<'tcx> BorrowData<'tcx> {
1247 fn compatible_with(&self, bk: BorrowKind) -> bool {
1248 match (self.kind, bk) {
1249 (BorrowKind::Shared, BorrowKind::Shared) => true,
1251 (BorrowKind::Mut, _) |
1252 (BorrowKind::Unique, _) |
1253 (_, BorrowKind::Mut) |
1254 (_, BorrowKind::Unique) => false,