mac: Prepare for -Wunused-functions.

cc/resources/tile_priority.cc

 // Copyright 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 "cc/resources/tile_priority.h"
 
 #include "base/values.h"
 #include "cc/base/math_util.h"
 
 namespace {
 
 // TODO(qinmin): modify ui/range/Range.h to support template so that we
 // don't need to define this.
 struct Range {
   Range(float start, float end) : start_(start), end_(end) {}
   bool IsEmpty();
   float start_;
   float end_;
 };
 
-inline bool Intersects(const Range& a, const Range& b) {
-  return a.start_ < b.end_ && b.start_ < a.end_;
-}
-
-inline Range Intersect(const Range& a, const Range& b) {
-  return Range(std::max(a.start_, b.start_), std::min(a.end_, b.end_));
-}
-
 bool Range::IsEmpty() {
   return start_ >= end_;
 }
 
 inline void IntersectNegativeHalfplane(Range* out,
                                        float previous,
                                        float current,
                                        float target,
                                        float time_delta) {
   float time_per_dist = time_delta / (current - previous);
@@ skipping 148 matching lines @@
              TileMemoryLimitPolicyAsValue(memory_limit_policy).release());
   state->SetInteger("memory_limit_in_bytes", memory_limit_in_bytes);
   state->SetInteger("unused_memory_limit_in_bytes",
                     unused_memory_limit_in_bytes);
   state->SetInteger("num_resources_limit", num_resources_limit);
   state->Set("tree_priority", TreePriorityAsValue(tree_priority).release());
   return state.PassAs<base::Value>();
 }
 
 }  // namespace cc