Change initializer list order to match field order.

src/shared/platform/win/condition_variable.cc

 /*
  * Copyright (c) 2011 The Native Client Authors. All rights reserved.
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 // See header file for description of class.
 // There are numerous subtle implementation details in this class.  See the FAQ
 // comments at the end of this file for that discussion.
 
 #include "native_client/src/include/portability.h"
 #include <stack>
 
 #include "native_client/src/shared/platform/nacl_sync.h"
 #include "native_client/src/include/nacl_macros.h"
 #include "native_client/src/shared/platform/nacl_log.h"
 #include "native_client/src/shared/platform/nacl_time.h"
 #include "native_client/src/shared/platform/win/condition_variable.h"
 #include "native_client/src/shared/platform/win/lock.h"
 #include "native_client/src/trusted/service_runtime/include/sys/time.h"
 
 static const int64_t kMillisecondsPerSecond = 1000;
 static const int64_t kMicrosecondsPerMillisecond = 1000;
 static const int64_t kMicrosecondsPerSecond =
     kMicrosecondsPerMillisecond * kMillisecondsPerSecond;
 
 NaCl::ConditionVariable::ConditionVariable()
   : run_state_(RUNNING),
-    allocation_counter_(0),
-    recycling_list_size_(0) {
+    recycling_list_size_(0),
+    allocation_counter_(0) {
 }
 
 NaCl::ConditionVariable::~ConditionVariable() {
   AutoLock auto_lock(internal_lock_);
   run_state_ = SHUTDOWN;  // Prevent any more waiting.
 
   // DCHECK(recycling_list_size_ == allocation_counter_) ;
   if (recycling_list_size_ != allocation_counter_) {  // Rare shutdown problem.
     // User left threads Wait()ing, and is destructing us.
     // Note: waiting_list_ *might* be empty, but recycling is still pending.
@@ skipping 310 matching lines @@
 waiting_list.  A hash table (STL map) could be used, but I was embarrased to
 use a complex and relatively low efficiency container when a doubly linked list
 provided O(1) performance in all required operations.  Since other operations
 to provide performance-and/or-fairness required queue (FIFO) and list (LIFO)
 containers, I would also have needed to use an STL list/queue as well as an STL
 map.  In the end I decided it would be "fun" to just do it right, and I
 put so many assertions (DCHECKs) into the container class that it is trivial to
 code review and validate its correctness.
 
 */