linux: fix gcc 4.3 issues (for arm)

chrome/browser/sync/engine/syncer_util.cc

 // Copyright (c) 2006-2008 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 "chrome/browser/sync/engine/syncer_util.h"
 
 #include <set>
 #include <string>
 #include <vector>
 
@@ skipping 797 matching lines @@
     // Ignore unapplied updates -- they might not even be server-siblings.
     if (candidate.Get(IS_UNAPPLIED_UPDATE)) {
       continue;
     }
 
     // Unsynced items don't have a valid server position.
     if (!candidate.Get(IS_UNSYNCED)) {
       // If |candidate| is after |update_entry| according to the server
       // ordering, then we're done.  ID is the tiebreaker.
       if ((candidate.Get(SERVER_POSITION_IN_PARENT) > position_in_parent) ||
-          (candidate.Get(SERVER_POSITION_IN_PARENT) == position_in_parent) &&
-           (candidate.Get(ID) > update_item->Get(ID))) {
+          ((candidate.Get(SERVER_POSITION_IN_PARENT) == position_in_parent) &&
+           (candidate.Get(ID) > update_item->Get(ID)))) {
           return closest_sibling;
       }
     }
 
     // We can't trust the SERVER_ fields of unsynced items, but they are
     // potentially legitimate local predecessors.  In the case where
     // |update_item| and an unsynced item wind up in the same insertion
     // position, we need to choose how to order them.  The following check puts
     // the unapplied update first; removing it would put the unsynced item(s)
     // first.
     if (candidate.Get(IS_UNSYNCED)) {
       continue;
     }
 
     // |update_entry| is considered to be somewhere after |candidate|, so store
     // it as the upper bound.
     closest_sibling = candidate.Get(ID);
   }
 
   return closest_sibling;
 }
 
 }  // namespace browser_sync