@@ -10,7 +10,6 @@ use rustc_middle::ty::{
1010 List , TyCtxt ,
1111} ;
1212use rustc_hir:: def_id:: { DefId , CRATE_DEF_INDEX } ;
13- use rustc_span:: source_map:: DUMMY_SP ;
1413
1514use rand:: RngCore ;
1615
@@ -170,13 +169,7 @@ pub trait EvalContextExt<'mir, 'tcx: 'mir>: crate::MiriEvalContextExt<'mir, 'tcx
170169
171170 // Push frame.
172171 let mir = & * this. load_mir ( f. def , None ) ?;
173- let span = this
174- . stack ( )
175- . last ( )
176- . and_then ( Frame :: current_source_info)
177- . map ( |si| si. span )
178- . unwrap_or ( DUMMY_SP ) ;
179- this. push_stack_frame ( f, span, mir, dest, stack_pop) ?;
172+ this. push_stack_frame ( f, mir, dest, stack_pop) ?;
180173
181174 // Initialize arguments.
182175 let mut callee_args = this. frame ( ) . body . args_iter ( ) ;
@@ -331,19 +324,19 @@ pub trait EvalContextExt<'mir, 'tcx: 'mir>: crate::MiriEvalContextExt<'mir, 'tcx
331324 fields : impl Iterator < Item = InterpResult < ' tcx , MPlaceTy < ' tcx , Tag > > > ,
332325 ) -> InterpResult < ' tcx > {
333326 match place. layout . fields {
334- layout:: FieldPlacement :: Array { .. } => {
327+ layout:: FieldsShape :: Array { .. } => {
335328 // For the array layout, we know the iterator will yield sorted elements so
336329 // we can avoid the allocation.
337330 self . walk_aggregate ( place, fields)
338331 }
339- layout:: FieldPlacement :: Arbitrary { .. } => {
332+ layout:: FieldsShape :: Arbitrary { .. } => {
340333 // Gather the subplaces and sort them before visiting.
341334 let mut places =
342335 fields. collect :: < InterpResult < ' tcx , Vec < MPlaceTy < ' tcx , Tag > > > > ( ) ?;
343336 places. sort_by_key ( |place| place. ptr . assert_ptr ( ) . offset ) ;
344337 self . walk_aggregate ( place, places. into_iter ( ) . map ( Ok ) )
345338 }
346- layout:: FieldPlacement :: Union { .. } => {
339+ layout:: FieldsShape :: Union { .. } => {
347340 // Uh, what?
348341 bug ! ( "a union is not an aggregate we should ever visit" )
349342 }
0 commit comments