Downwards closure inference

test/dart_codegen/expect/collection/linked_list.dart

 part of dart.collection;
  class LinkedList<E extends LinkedListEntry<E>> extends IterableBase<E> implements _LinkedListLink {int _modificationCount = 0;
  int _length = 0;
  _LinkedListLink _next;
  _LinkedListLink _previous;
  LinkedList() {
   _next = _previous = this;
   }
  void addFirst(E entry) {
   _insertAfter(this, entry);
   }
  void add(E entry) {
   _insertAfter(_previous, entry);
   }
  void addAll(Iterable<E> entries) {
-  entries.forEach(((__x10) => DEVC$RT.wrap((void f(dynamic __u5)) {
-    void c(dynamic x0) => f(x0);
-     return f == null ? null : c;
-    }
-  , __x10, __t8, DEVC$RT.type((__t6<E> _) {
-    }
-  ), "WrapLiteral", """line 65, column 21 of dart:collection/linked_list.dart: """, __x10 is __t6<E>))((entry) => _insertAfter(_previous, DEVC$RT.cast(entry, dynamic, E, "CompositeCast", """line 65, column 56 of dart:collection/linked_list.dart: """, entry is E, false))));
+  entries.forEach((entry) => _insertAfter(_previous, DEVC$RT.cast(entry, dynamic, E, "CompositeCast", """line 65, column 56 of dart:collection/linked_list.dart: """, entry is E, false)));
   }
  bool remove(E entry) {
   if (entry._list != this) return false;
    _unlink(entry);
    return true;
   }
  Iterator<E> get iterator => new _LinkedListIterator<E>(this);
  int get length => _length;
  void clear() {
   _modificationCount++;
@@ skipping 99 matching lines @@
 if (identical(_previous, _list)) return null;
  return DEVC$RT.cast(_previous, _LinkedListLink, E, "CastUser", """line 261, column 12 of dart:collection/linked_list.dart: """, _previous is E, false);
 }
  void insertAfter(E entry) {
 _list._insertAfter(this, entry);
 }
  void insertBefore(E entry) {
 _list._insertAfter(_previous, entry);
 }
 }
- typedef void __t6<E>(E __u7);
- typedef void __t8(dynamic __u9);