Tweaks to make compiler happy

ui/aura/window.cc

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "ui/aura/window.h"
 
 #include <algorithm>
 
 #include "base/bind.h"
 #include "base/bind_helpers.h"
@@ skipping 1171 matching lines @@
   if (direction == STACK_ABOVE) {
     target_layer =
         FindStackingTargetLayer<Windows::const_reverse_iterator>(target, child);
   } else {
     target_layer =
         FindStackingTargetLayer<Windows::const_iterator>(target, child);
   }
 
   if (!target_layer) {
     if (direction == STACK_ABOVE) {
-      for (Layers::const_reverse_iterator i = layers.rbegin();
-           i != layers.rend(); ++i) {
+      for (Layers::const_reverse_iterator i = layers.rbegin(),
+               rend = layers.rend(); i != rend; ++i) {
         ancestor_layer->StackAtBottom(*i);
       }
     } else {
       for (Layers::const_iterator i = layers.begin(); i != layers.end(); ++i)
         ancestor_layer->StackAtTop(*i);
     }
     return;
   }
 
   if (direction == STACK_ABOVE) {
-    for (Layers::const_reverse_iterator i = layers.rbegin();
-         i != layers.rend(); ++i) {
+    for (Layers::const_reverse_iterator i = layers.rbegin(),
+             rend = layers.rend(); i != rend; ++i) {
       ancestor_layer->StackAbove(*i, target_layer);
     }
   } else {
     for (Layers::const_iterator i = layers.begin(); i != layers.end(); ++i)
       ancestor_layer->StackBelow(*i, target_layer);
   }
 }
 
 void Window::OnStackingChanged() {
   FOR_EACH_OBSERVER(WindowObserver, observers_, OnWindowStackingChanged(this));
@@ skipping 236 matching lines @@
       return window;
     if (offset)
       *offset += window->bounds().OffsetFromOrigin();
   }
   if (offset)
     *offset = gfx::Vector2d();
   return NULL;
 }
 
 }  // namespace aura