@@ -43,6 +43,7 @@ use rustc_data_structures::fingerprint::PackedFingerprint;
43
43
use rustc_data_structures:: fx:: FxHashMap ;
44
44
use rustc_data_structures:: profiling:: SelfProfilerRef ;
45
45
use rustc_data_structures:: sync:: Lock ;
46
+ use rustc_data_structures:: unhash:: UnhashMap ;
46
47
use rustc_index:: { Idx , IndexVec } ;
47
48
use rustc_serialize:: opaque:: { FileEncodeResult , FileEncoder , IntEncodedWithFixedSize , MemDecoder } ;
48
49
use rustc_serialize:: { Decodable , Decoder , Encodable , Encoder } ;
@@ -84,7 +85,7 @@ pub struct SerializedDepGraph<K: DepKind> {
84
85
edge_list_data : Vec < u8 > ,
85
86
/// Stores a map from fingerprints to nodes per dep node kind.
86
87
/// This is the reciprocal of `nodes`.
87
- index : Vec < FxHashMap < PackedFingerprint , SerializedDepNodeIndex > > ,
88
+ index : Vec < UnhashMap < PackedFingerprint , SerializedDepNodeIndex > > ,
88
89
}
89
90
90
91
impl < K : DepKind > Default for SerializedDepGraph < K > {
@@ -256,7 +257,7 @@ impl<'a, K: DepKind + Decodable<MemDecoder<'a>>> Decodable<MemDecoder<'a>>
256
257
257
258
// Read the number of each dep kind and use it to create an hash map with a suitable size.
258
259
let mut index: Vec < _ > = ( 0 ..( K :: MAX as usize + 1 ) )
259
- . map ( |_| FxHashMap :: with_capacity_and_hasher ( d. read_u32 ( ) as usize , Default :: default ( ) ) )
260
+ . map ( |_| UnhashMap :: with_capacity_and_hasher ( d. read_u32 ( ) as usize , Default :: default ( ) ) )
260
261
. collect ( ) ;
261
262
262
263
for ( idx, node) in nodes. iter_enumerated ( ) {
0 commit comments