Fix include guards for QUIC files.

net/quic/core/interval.h

 // Copyright 2015 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.
 //
 // An Interval<T> is a data structure used to represent a contiguous, mutable
 // range over an ordered type T. Supported operations include testing a value to
 // see whether it is included in the interval, comparing two intervals, and
 // performing their union, intersection, and difference. For the purposes of
 // this library, an "ordered type" is any type that induces a total order on its
 // values via its less-than operator (operator<()). Examples of such types are
@@ skipping 39 matching lines @@
 //   EXPECT_TRUE(r1.Intersects(r2));
 //   EXPECT_FALSE(r1.Contains(r2));
 //   EXPECT_TRUE(r1.IntersectWith(r2));  // Mutates r1.
 //   EXPECT_EQ(Interval<int>(50, 100), r1);  // r1 is now [50, 100).
 //
 //   Interval<int> r3(1000, 2000);  // The interval [1000, 2000).
 //   EXPECT_TRUE(r1.IntersectWith(r3));  // Mutates r1.
 //   EXPECT_TRUE(r1.Empty());  // Now r1 is empty.
 //   EXPECT_FALSE(r1.Contains(r1.min()));  // e.g. doesn't contain its own min.
 
-#ifndef NET_QUIC_INTERVAL_H_
-#define NET_QUIC_INTERVAL_H_
+#ifndef NET_QUIC_CORE_INTERVAL_H_
+#define NET_QUIC_CORE_INTERVAL_H_
 
 #include <stddef.h>
 
 #include <algorithm>
 #include <functional>
 #include <ostream>
 #include <string>
 #include <utility>
 #include <vector>
 
@@ skipping 220 matching lines @@
     // [------ i --------)
     // Intersection is <this>, so difference yields the empty interval.
     return true;
   }
   *lo = *this;  // No intersection.
   return false;
 }
 
 }  // namespace net
 
-#endif  // NET_QUIC_INTERVAL_H_
+#endif  // NET_QUIC_CORE_INTERVAL_H_