@@ -390,9 +390,9 @@ impl<D: Deps> DepGraphData<D> {
390390 let task_deps = Lock :: new ( TaskDeps :: default ( ) ) ;
391391 let result = D :: with_deps ( TaskDepsRef :: Allow ( & task_deps) , op) ;
392392 let task_deps = task_deps. into_inner ( ) ;
393- let task_deps = task_deps. reads ;
393+ let reads = task_deps. reads ;
394394
395- let dep_node_index = match task_deps . len ( ) {
395+ let dep_node_index = match reads . len ( ) {
396396 0 => {
397397 // Because the dep-node id of anon nodes is computed from the sets of its
398398 // dependencies we already know what the ID of this dependency-less node is
@@ -403,7 +403,7 @@ impl<D: Deps> DepGraphData<D> {
403403 }
404404 1 => {
405405 // When there is only one dependency, don't bother creating a node.
406- task_deps [ 0 ]
406+ reads [ 0 ]
407407 }
408408 _ => {
409409 // The dep node indices are hashed here instead of hashing the dep nodes of the
@@ -412,7 +412,7 @@ impl<D: Deps> DepGraphData<D> {
412412 // combining it with the per session random number `anon_id_seed`. This hash only need
413413 // to map the dependencies to a single value on a per session basis.
414414 let mut hasher = StableHasher :: new ( ) ;
415- task_deps . hash ( & mut hasher) ;
415+ reads . hash ( & mut hasher) ;
416416
417417 let target_dep_node = DepNode {
418418 kind : dep_kind,
@@ -430,7 +430,7 @@ impl<D: Deps> DepGraphData<D> {
430430 // memory impact of this `anon_node_to_index` map remains tolerable, and helps
431431 // us avoid useless growth of the graph with almost-equivalent nodes.
432432 self . current . anon_node_to_index . get_or_insert_with ( target_dep_node, || {
433- self . current . alloc_new_node ( target_dep_node, task_deps , Fingerprint :: ZERO )
433+ self . current . alloc_new_node ( target_dep_node, reads , Fingerprint :: ZERO )
434434 } )
435435 }
436436 } ;
0 commit comments