trafficserver-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From sor...@apache.org
Subject [4/5] trafficserver git commit: Remove trailing whitespace
Date Fri, 14 Nov 2014 17:55:33 GMT
http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/Map.h
----------------------------------------------------------------------
diff --git a/lib/ts/Map.h b/lib/ts/Map.h
index 11d27a0..6814f61 100644
--- a/lib/ts/Map.h
+++ b/lib/ts/Map.h
@@ -125,10 +125,10 @@ template <class K, class AHashFns, class C, class A = DefaultAlloc> class HashSe
 
 class StringHashFns {
  public:
-  static uintptr_t hash(cchar *s) { 
-    uintptr_t h = 0; 
+  static uintptr_t hash(cchar *s) {
+    uintptr_t h = 0;
     // 31 changed to 27, to avoid prime2 in vec.cpp
-    while (*s) h = h * 27 + (unsigned char)*s++;  
+    while (*s) h = h * 27 + (unsigned char)*s++;
     return h;
   }
   static int equal(cchar *a, cchar *b) { return !strcmp(a, b); }
@@ -136,8 +136,8 @@ class StringHashFns {
 
 class CaseStringHashFns {
  public:
-  static uintptr_t hash(cchar *s) { 
-    uintptr_t h = 0; 
+  static uintptr_t hash(cchar *s) {
+    uintptr_t h = 0;
     // 31 changed to 27, to avoid prime2 in vec.cpp
     while (*s) h = h * 27 + (unsigned char)toupper(*s++);
     return h;
@@ -164,7 +164,7 @@ template <class C, class AHashFns, class A = DefaultAlloc> class ChainHash : pub
   void get_elements(Vec<C> &elements);
 };
 
-template <class K, class AHashFns, class C, class A = DefaultAlloc> class ChainHashMap : 
+template <class K, class AHashFns, class C, class A = DefaultAlloc> class ChainHashMap :
   public Map<uintptr_t, List<MapElem<K,C>,A>,A> {
  public:
   using Map<uintptr_t, List<MapElem<K,C>,A>,A>::n;
@@ -214,7 +214,7 @@ template <class C, class AHashFns, int N, class A = DefaultAlloc> class NBlockHa
 /* use forv_Vec on BlockHashes */
 
 #define DEFAULT_BLOCK_HASH_SIZE 4
-template <class C, class ABlockHashFns> class BlockHash : 
+template <class C, class ABlockHashFns> class BlockHash :
   public NBlockHash<C, ABlockHashFns, DEFAULT_BLOCK_HASH_SIZE> {};
 typedef BlockHash<cchar *, StringHashFns> StringBlockHash;
 
@@ -235,7 +235,7 @@ template <class K, class C, class A = DefaultAlloc> class Env {
 
 /* IMPLEMENTATION */
 
-template <class K, class C, class A> inline C 
+template <class K, class C, class A> inline C
 Map<K,C,A>::get(K akey) {
   MapElem<K,C> e(akey, (C)0);
   MapElem<K,C> *x = this->set_in(e);
@@ -389,7 +389,7 @@ HashSet<K, AHashFns, C, A>::put(C avalue) {
   return put(avalue);
 }
 
-template <class K, class AHashFns, class C, class A> inline MapElem<K,C> * 
+template <class K, class AHashFns, class C, class A> inline MapElem<K,C> *
 HashMap<K,AHashFns,C,A>::get_internal(K akey) {
   if (!n)
     return 0;
@@ -412,7 +412,7 @@ HashMap<K,AHashFns,C,A>::get_internal(K akey) {
   return 0;
 }
 
-template <class K, class AHashFns, class C, class A> inline C 
+template <class K, class AHashFns, class C, class A> inline C
 HashMap<K,AHashFns,C,A>::get(K akey) {
   MapElem<K,C> *x = get_internal(akey);
   if (!x)
@@ -594,7 +594,7 @@ ChainHashMap<K, AHashFns, C, A>::get(K akey) {
   if (!x)
     return 0;
   List<MapElem<K,C>,A> *l = &x->value;
-  if (l->head) 
+  if (l->head)
     for (ConsCell<MapElem<K,C>,A> *p  = l->head; p; p = p->cdr)
       if (AHashFns::equal(akey, p->car.key))
         return p->car.value;
@@ -666,7 +666,7 @@ template <class K, class AHashFns, class C, class A> void
 ChainHashMap<K, AHashFns, C, A>::get_keys(Vec<K> &keys) {
   for (size_t i = 0; i < n; i++) {
     List<MapElem<K,C> > *l = &v[i].value;
-    if (l->head) 
+    if (l->head)
       for (ConsCell<MapElem<K,C>,A> *p  = l->head; p; p = p->cdr)
         keys.add(p->car.key);
   }
@@ -676,7 +676,7 @@ template <class K, class AHashFns, class C, class A> void
 ChainHashMap<K, AHashFns, C, A>::get_values(Vec<C> &values) {
   for (size_t i = 0; i < n; i++) {
     List<MapElem<K,C>,A> *l = &v[i].value;
-    if (l->head) 
+    if (l->head)
       for (ConsCell<MapElem<K,C>,A> *p  = l->head; p; p = p->cdr)
         values.add(p->car.value);
   }
@@ -688,9 +688,9 @@ StringChainHash<F,A>::canonicalize(cchar *s, cchar *e) {
   cchar *a = s;
   // 31 changed to 27, to avoid prime2 in vec.cpp
   if (e)
-    while (a != e) h = h * 27 + (unsigned char)*a++;  
+    while (a != e) h = h * 27 + (unsigned char)*a++;
   else
-    while (*a) h = h * 27 + (unsigned char)*a++;  
+    while (*a) h = h * 27 + (unsigned char)*a++;
   MapElem<uintptr_t,List<cchar*, A> > me(h, (char*)0);
   MapElem<uintptr_t,List<cchar*, A> > *x = this->set_in(me);
   if (x) {
@@ -718,7 +718,7 @@ StringChainHash<F,A>::canonicalize(cchar *s, cchar *e) {
   return s;
 }
 
-template <class K, class C, class A> inline C 
+template <class K, class C, class A> inline C
 Env<K,C,A>::get(K akey) {
   MapElem<K,List<C, A> *> e(akey, 0);
   MapElem<K,List<C, A> *> *x = store.set_in(e);
@@ -754,7 +754,7 @@ Env<K,C,A>::pop() {
     get_bucket(e->car)->pop();
 }
 
-template <class C, class AHashFns, int N, class A> inline 
+template <class C, class AHashFns, int N, class A> inline
 NBlockHash<C, AHashFns, N, A>::NBlockHash() : n(1), i(0) {
   memset(&e[0], 0, sizeof(e));
   v = e;
@@ -901,18 +901,18 @@ template <class C, class AHashFns, int N, class A> inline int
 NBlockHash<C, AHashFns, N, A>::count() {
   int nelements = 0;
   C *l = last();
-  for (C *xx = first(); xx < l; xx++) 
+  for (C *xx = first(); xx < l; xx++)
     if (*xx)
       nelements++;
   return nelements;
 }
 
-template <class C, class AHashFns, int N, class A> inline void 
+template <class C, class AHashFns, int N, class A> inline void
 NBlockHash<C, AHashFns, N, A>::copy(const NBlockHash<C, AHashFns, N, A> &hh) {
   clear();
   n = hh.n;
   i = hh.i;
-  if (hh.v == &hh.e[0]) { 
+  if (hh.v == &hh.e[0]) {
     memcpy(e, &hh.e[0], sizeof(e));
     v = e;
   } else {
@@ -924,13 +924,13 @@ NBlockHash<C, AHashFns, N, A>::copy(const NBlockHash<C, AHashFns, N, A> &hh) {
   }
 }
 
-template <class C, class AHashFns, int N, class A> inline void 
+template <class C, class AHashFns, int N, class A> inline void
 NBlockHash<C, AHashFns, N, A>::move(NBlockHash<C, AHashFns, N, A> &hh) {
   clear();
   n = hh.n;
   i = hh.i;
   v = hh.v;
-  if (hh.v == &hh.e[0]) { 
+  if (hh.v == &hh.e[0]) {
     memcpy(e, &hh.e[0], sizeof(e));
     v = e;
   }
@@ -1066,7 +1066,7 @@ public:
     LINK(Bucket, m_link);
 
     /** Do the values in this bucket have different keys?
-        
+
         @internal This can have a false positive, but that's OK, better than the expense of being
         exact.  What we want is to avoid expanding to shorten the chain if it won't help, which it
         won't if all the keys are the same.
@@ -1080,7 +1080,7 @@ public:
   };
 
   /** Information about locating a value in the hash table.
-      
+
       An instance of this returned when searching for a key in the table. It can then be used to
       check if a matching key was found, and to iterate over equivalent keys. Note this iterator
       will touch only values which have a matching key.

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/TsBuffer.h
----------------------------------------------------------------------
diff --git a/lib/ts/TsBuffer.h b/lib/ts/TsBuffer.h
index 4ed8ccc..d4fac87 100644
--- a/lib/ts/TsBuffer.h
+++ b/lib/ts/TsBuffer.h
@@ -272,7 +272,7 @@ namespace ts {
     */
     self splitOn(char c);
     /** Get a trailing segment of the buffer.
-    
+
         @return A buffer that contains all data after @a p.
     */
     self after(char const* p) const;
@@ -371,7 +371,7 @@ namespace ts {
     }
     return zret;
   }
-    
+
   inline char const* ConstBuffer::find(char c) const {
     return static_cast<char const*>(memchr(_ptr, c, _size));
   }

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/Vec.cc
----------------------------------------------------------------------
diff --git a/lib/ts/Vec.cc b/lib/ts/Vec.cc
index 66d2dda..781e7dc 100644
--- a/lib/ts/Vec.cc
+++ b/lib/ts/Vec.cc
@@ -31,40 +31,40 @@ const uintptr_t prime2[] = {
   4194301, 8388593, 16777213, 33554393, 67108859, 134217689,
   268435399, 536870909
 };
-  
+
 // primes generated with map_mult.c
 const uintptr_t open_hash_primes[256] = {
-0x02D4AF27, 0x1865DFC7, 0x47C62B43, 0x35B4889B, 0x210459A1, 0x3CC51CC7, 0x02ADD945, 0x0607C4D7, 
-0x558E6035, 0x0554224F, 0x5A281657, 0x1C458C7F, 0x7F8BE723, 0x20B9BA99, 0x7218AA35, 0x64B10C2B, 
-0x548E8983, 0x5951218F, 0x7AADC871, 0x695FA5B1, 0x40D40FCB, 0x20E03CC9, 0x55E9920F, 0x554CE08B, 
-0x7E78B1D7, 0x7D965DF9, 0x36A520A1, 0x1B0C6C11, 0x33385667, 0x2B0A7B9B, 0x0F35AE23, 0x0BD608FB, 
-0x2284ADA3, 0x6E6C0687, 0x129B3EED, 0x7E86289D, 0x1143C24B, 0x1B6C7711, 0x1D87BB41, 0x4C7E635D, 
-0x67577999, 0x0A0113C5, 0x6CF085B5, 0x14A4D0FB, 0x4E93E3A7, 0x5C87672B, 0x67F3CA17, 0x5F944339, 
-0x4C16DFD7, 0x5310C0E3, 0x2FAD1447, 0x4AFB3187, 0x08468B7F, 0x49E56C51, 0x6280012F, 0x097D1A85, 
-0x34CC9403, 0x71028BD7, 0x6DEDC7E9, 0x64093291, 0x6D78BB0B, 0x7A03B465, 0x2E044A43, 0x1AE58515, 
-0x23E495CD, 0x46102A83, 0x51B78A59, 0x051D8181, 0x5352CAC9, 0x57D1312B, 0x2726ED57, 0x2E6BC515, 
-0x70736281, 0x5938B619, 0x0D4B6ACB, 0x44AB5E2B, 0x0029A485, 0x002CE54F, 0x075B0591, 0x3EACFDA9, 
-0x0AC03411, 0x53B00F73, 0x2066992D, 0x76E72223, 0x55F62A8D, 0x3FF92EE1, 0x17EE0EB3, 0x5E470AF1, 
-0x7193EB7F, 0x37A2CCD3, 0x7B44F7AF, 0x0FED8B3F, 0x4CC05805, 0x7352BF79, 0x3B61F755, 0x523CF9A3, 
-0x1AAFD219, 0x76035415, 0x5BE84287, 0x6D598909, 0x456537E9, 0x407EA83F, 0x23F6FFD5, 0x60256F39, 
-0x5D8EE59F, 0x35265CEB, 0x1D4AD4EF, 0x676E2E0F, 0x2D47932D, 0x776BB33B, 0x6DE1902B, 0x2C3F8741, 
-0x5B2DE8EF, 0x686DDB3B, 0x1D7C61C7, 0x1B061633, 0x3229EA51, 0x7FCB0E63, 0x5F22F4C9, 0x517A7199, 
-0x2A8D7973, 0x10DCD257, 0x41D59B27, 0x2C61CA67, 0x2020174F, 0x71653B01, 0x2FE464DD, 0x3E7ED6C7, 
-0x164D2A71, 0x5D4F3141, 0x5F7BABA7, 0x50E1C011, 0x140F5D77, 0x34E80809, 0x04AAC6B3, 0x29C42BAB, 
-0x08F9B6F7, 0x461E62FD, 0x45C2660B, 0x08BF25A7, 0x5494EA7B, 0x0225EBB7, 0x3C5A47CF, 0x2701C333, 
-0x457ED05B, 0x48CDDE55, 0x14083099, 0x7C69BDAB, 0x7BF163C9, 0x41EE1DAB, 0x258B1307, 0x0FFAD43B, 
-0x6601D767, 0x214DBEC7, 0x2852CCF5, 0x0009B471, 0x190AC89D, 0x5BDFB907, 0x15D4E331, 0x15D22375, 
-0x13F388D5, 0x12ACEDA5, 0x3835EA5D, 0x2587CA35, 0x06756643, 0x487C6F55, 0x65C295EB, 0x1029F2E1, 
-0x10CEF39D, 0x14C2E415, 0x444825BB, 0x24BE0A2F, 0x1D2B7C01, 0x64AE3235, 0x5D2896E5, 0x61BBBD87, 
-0x4A49E86D, 0x12C277FF, 0x72C81289, 0x5CF42A3D, 0x332FF177, 0x0DAECD23, 0x6000ED1D, 0x203CDDE1, 
-0x40C62CAD, 0x19B9A855, 0x782020C3, 0x6127D5BB, 0x719889A7, 0x40E4FCCF, 0x2A3C8FF9, 0x07411C7F, 
-0x3113306B, 0x4D7CA03F, 0x76119841, 0x54CEFBDF, 0x11548AB9, 0x4B0748EB, 0x569966B1, 0x45BC721B, 
-0x3D5A376B, 0x0D8923E9, 0x6D95514D, 0x0F39A367, 0x2FDAD92F, 0x721F972F, 0x42D0E21D, 0x5C5952DB, 
-0x7394D007, 0x02692C55, 0x7F92772F, 0x025F8025, 0x34347113, 0x560EA689, 0x0DCC21DF, 0x09ECC7F5, 
-0x091F3993, 0x0E0B52AB, 0x497CAA55, 0x0A040A49, 0x6D8F0CC5, 0x54F41609, 0x6E0CB8DF, 0x3DCB64C3, 
-0x16C365CD, 0x6D6B9FB5, 0x02B9382B, 0x6A5BFAF1, 0x1669D75F, 0x13CFD4FD, 0x0FDF316F, 0x21F3C463, 
-0x6FC58ABF, 0x04E45BE7, 0x1911225B, 0x28CD1355, 0x222084E9, 0x672AD54B, 0x476FC267, 0x6864E16D, 
-0x20AEF4FB, 0x603C5FB9, 0x55090595, 0x1113B705, 0x24E38493, 0x5291AF97, 0x5F5446D9, 0x13A6F639, 
+0x02D4AF27, 0x1865DFC7, 0x47C62B43, 0x35B4889B, 0x210459A1, 0x3CC51CC7, 0x02ADD945, 0x0607C4D7,
+0x558E6035, 0x0554224F, 0x5A281657, 0x1C458C7F, 0x7F8BE723, 0x20B9BA99, 0x7218AA35, 0x64B10C2B,
+0x548E8983, 0x5951218F, 0x7AADC871, 0x695FA5B1, 0x40D40FCB, 0x20E03CC9, 0x55E9920F, 0x554CE08B,
+0x7E78B1D7, 0x7D965DF9, 0x36A520A1, 0x1B0C6C11, 0x33385667, 0x2B0A7B9B, 0x0F35AE23, 0x0BD608FB,
+0x2284ADA3, 0x6E6C0687, 0x129B3EED, 0x7E86289D, 0x1143C24B, 0x1B6C7711, 0x1D87BB41, 0x4C7E635D,
+0x67577999, 0x0A0113C5, 0x6CF085B5, 0x14A4D0FB, 0x4E93E3A7, 0x5C87672B, 0x67F3CA17, 0x5F944339,
+0x4C16DFD7, 0x5310C0E3, 0x2FAD1447, 0x4AFB3187, 0x08468B7F, 0x49E56C51, 0x6280012F, 0x097D1A85,
+0x34CC9403, 0x71028BD7, 0x6DEDC7E9, 0x64093291, 0x6D78BB0B, 0x7A03B465, 0x2E044A43, 0x1AE58515,
+0x23E495CD, 0x46102A83, 0x51B78A59, 0x051D8181, 0x5352CAC9, 0x57D1312B, 0x2726ED57, 0x2E6BC515,
+0x70736281, 0x5938B619, 0x0D4B6ACB, 0x44AB5E2B, 0x0029A485, 0x002CE54F, 0x075B0591, 0x3EACFDA9,
+0x0AC03411, 0x53B00F73, 0x2066992D, 0x76E72223, 0x55F62A8D, 0x3FF92EE1, 0x17EE0EB3, 0x5E470AF1,
+0x7193EB7F, 0x37A2CCD3, 0x7B44F7AF, 0x0FED8B3F, 0x4CC05805, 0x7352BF79, 0x3B61F755, 0x523CF9A3,
+0x1AAFD219, 0x76035415, 0x5BE84287, 0x6D598909, 0x456537E9, 0x407EA83F, 0x23F6FFD5, 0x60256F39,
+0x5D8EE59F, 0x35265CEB, 0x1D4AD4EF, 0x676E2E0F, 0x2D47932D, 0x776BB33B, 0x6DE1902B, 0x2C3F8741,
+0x5B2DE8EF, 0x686DDB3B, 0x1D7C61C7, 0x1B061633, 0x3229EA51, 0x7FCB0E63, 0x5F22F4C9, 0x517A7199,
+0x2A8D7973, 0x10DCD257, 0x41D59B27, 0x2C61CA67, 0x2020174F, 0x71653B01, 0x2FE464DD, 0x3E7ED6C7,
+0x164D2A71, 0x5D4F3141, 0x5F7BABA7, 0x50E1C011, 0x140F5D77, 0x34E80809, 0x04AAC6B3, 0x29C42BAB,
+0x08F9B6F7, 0x461E62FD, 0x45C2660B, 0x08BF25A7, 0x5494EA7B, 0x0225EBB7, 0x3C5A47CF, 0x2701C333,
+0x457ED05B, 0x48CDDE55, 0x14083099, 0x7C69BDAB, 0x7BF163C9, 0x41EE1DAB, 0x258B1307, 0x0FFAD43B,
+0x6601D767, 0x214DBEC7, 0x2852CCF5, 0x0009B471, 0x190AC89D, 0x5BDFB907, 0x15D4E331, 0x15D22375,
+0x13F388D5, 0x12ACEDA5, 0x3835EA5D, 0x2587CA35, 0x06756643, 0x487C6F55, 0x65C295EB, 0x1029F2E1,
+0x10CEF39D, 0x14C2E415, 0x444825BB, 0x24BE0A2F, 0x1D2B7C01, 0x64AE3235, 0x5D2896E5, 0x61BBBD87,
+0x4A49E86D, 0x12C277FF, 0x72C81289, 0x5CF42A3D, 0x332FF177, 0x0DAECD23, 0x6000ED1D, 0x203CDDE1,
+0x40C62CAD, 0x19B9A855, 0x782020C3, 0x6127D5BB, 0x719889A7, 0x40E4FCCF, 0x2A3C8FF9, 0x07411C7F,
+0x3113306B, 0x4D7CA03F, 0x76119841, 0x54CEFBDF, 0x11548AB9, 0x4B0748EB, 0x569966B1, 0x45BC721B,
+0x3D5A376B, 0x0D8923E9, 0x6D95514D, 0x0F39A367, 0x2FDAD92F, 0x721F972F, 0x42D0E21D, 0x5C5952DB,
+0x7394D007, 0x02692C55, 0x7F92772F, 0x025F8025, 0x34347113, 0x560EA689, 0x0DCC21DF, 0x09ECC7F5,
+0x091F3993, 0x0E0B52AB, 0x497CAA55, 0x0A040A49, 0x6D8F0CC5, 0x54F41609, 0x6E0CB8DF, 0x3DCB64C3,
+0x16C365CD, 0x6D6B9FB5, 0x02B9382B, 0x6A5BFAF1, 0x1669D75F, 0x13CFD4FD, 0x0FDF316F, 0x21F3C463,
+0x6FC58ABF, 0x04E45BE7, 0x1911225B, 0x28CD1355, 0x222084E9, 0x672AD54B, 0x476FC267, 0x6864E16D,
+0x20AEF4FB, 0x603C5FB9, 0x55090595, 0x1113B705, 0x24E38493, 0x5291AF97, 0x5F5446D9, 0x13A6F639,
 0x3D501313, 0x37E02017, 0x236B0ED3, 0x60F246BF, 0x01E02501, 0x2D2F66BD, 0x6BF23609, 0x16729BAF
 };
 
@@ -86,7 +86,7 @@ i_find(const Intervals *i, int x) {
     l = m;
     goto Lrecurse;
   }
-  if (x < i->v[m]) {    
+  if (x < i->v[m]) {
     h = m;
     goto Lrecurse;
   }
@@ -103,7 +103,7 @@ Intervals::in(int x) const {
 }
 
 // insert into interval with merge
-void 
+void
 Intervals::insert(int x) {
   if (!n) {
     add(x);
@@ -187,7 +187,7 @@ UnionFind::find(int n) {
   return i;
 }
 
-void 
+void
 UnionFind::unify(int n, int m) {
   n = find(n);
   m = find(m);

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/Vec.h
----------------------------------------------------------------------
diff --git a/lib/ts/Vec.h b/lib/ts/Vec.h
index 88c04c8..b5b3a8d 100644
--- a/lib/ts/Vec.h
+++ b/lib/ts/Vec.h
@@ -48,7 +48,7 @@ class Vec {
   size_t        i;      // size index for sets, reserve for vectors
   C             *v;
   C             e[VEC_INTEGRAL_SIZE];
-  
+
   Vec();
   Vec<C,A,S>(const Vec<C,A,S> &vv);
   Vec<C,A,S>(const C c);
@@ -57,7 +57,7 @@ class Vec {
   C &operator[](int i) const { return v[i]; }
 
   C get(size_t i) const;
-  void add(C a);  
+  void add(C a);
   void push_back(C a) { add(a); } // std::vector name
   bool add_exclusive(C a);
   C& add();
@@ -113,7 +113,7 @@ class Vec {
   int read(int fd);
   void qsort(bool (*lt)(C,C));
   void qsort(bool (*lt)(const C &, const C &));
-  
+
 private:
   void move_internal(Vec<C,A,S> &v);
   void copy_internal(const Vec<C,A,S> &v);
@@ -153,7 +153,7 @@ class Intervals : public Vec<int> {
 class UnionFind : public Vec<int> {
  public:
   // set number of elements, initialized to singletons, may be called repeatedly to increase size
-  void size(int n); 
+  void size(int n);
   // return representitive element
   int find(int n);
   // unify the sets containing the two elements
@@ -192,7 +192,7 @@ Vec<C,A,S>::get(size_t i) const {
   }
 }
 
-template <class C, class A, int S> inline void 
+template <class C, class A, int S> inline void
 Vec<C,A,S>::add(C a) {
   if (n & (VEC_INTEGRAL_SIZE-1))
     v[n++] = a;
@@ -286,7 +286,7 @@ Vec<C,A,S>::add_exclusive(C a) {
   if (!in(a)) {
     add(a);
     return true;
-  } else 
+  } else
     return false;
 }
 
@@ -315,40 +315,40 @@ Vec<C,A,S>::index(C a) const {
   return -1;
 }
 
-template <class C, class A, int S> inline void 
+template <class C, class A, int S> inline void
 Vec<C,A,S>::move_internal(Vec<C,A,S> &vv)  {
   n = vv.n;
   i = vv.i;
-  if (vv.v == &vv.e[0]) { 
+  if (vv.v == &vv.e[0]) {
     memcpy(e, &vv.e[0], sizeof(e));
     v = e;
   } else
     v = vv.v;
 }
 
-template <class C, class A, int S> inline void 
+template <class C, class A, int S> inline void
 Vec<C,A,S>::move(Vec<C,A,S> &vv)  {
-  move_internal(vv); 
+  move_internal(vv);
   vv.v = 0;
   vv.clear();
 }
 
-template <class C, class A, int S> inline void 
+template <class C, class A, int S> inline void
 Vec<C,A,S>::copy(const Vec<C,A,S> &vv)  {
   n = vv.n;
   i = vv.i;
-  if (vv.v == &vv.e[0]) { 
+  if (vv.v == &vv.e[0]) {
     memcpy(e, &vv.e[0], sizeof(e));
     v = e;
   } else {
-    if (vv.v) 
+    if (vv.v)
       copy_internal(vv);
     else
       v = 0;
   }
 }
 
-template <class C, class A, int S> inline void 
+template <class C, class A, int S> inline void
 Vec<C,A,S>::fill(size_t nn)  {
   for (size_t i = n; i < nn; i++)
     add() = 0;
@@ -382,7 +382,7 @@ Vec<C,A,S>::prepend(const Vec<C> &vv)  {
   }
 }
 
-template <class C, class A, int S> void 
+template <class C, class A, int S> void
 Vec<C,A,S>::add_internal(C a) {
   addx();
   v[n++] = a;
@@ -445,7 +445,7 @@ Vec<C,A,S>::set_union(Vec<C,A,S> &vv) {
     }
   }
   return changed;
-} 
+}
 
 template <class C, class A, int S> int
 Vec<C,A,S>::set_intersection(Vec<C,A,S> &vv) {
@@ -460,7 +460,7 @@ Vec<C,A,S>::set_intersection(Vec<C,A,S> &vv) {
         changed = 1;
     }
   return changed;
-} 
+}
 
 template <class C, class A, int S> int
 Vec<C,A,S>::some_intersection(Vec<C,A,S> &vv) {
@@ -469,7 +469,7 @@ Vec<C,A,S>::some_intersection(Vec<C,A,S> &vv) {
       if (vv.set_in(v[i]))
         return 1;
   return 0;
-} 
+}
 
 template <class C, class A, int S> int
 Vec<C,A,S>::some_disjunction(Vec<C,A,S> &vv) {
@@ -482,7 +482,7 @@ Vec<C,A,S>::some_disjunction(Vec<C,A,S> &vv) {
       if (!set_in(vv.v[i]))
         return 1;
   return 0;
-} 
+}
 
 template <class C, class A, int S> void
 Vec<C,A,S>::set_intersection(Vec<C,A,S> &vv, Vec<C,A,S> &result) {
@@ -490,7 +490,7 @@ Vec<C,A,S>::set_intersection(Vec<C,A,S> &vv, Vec<C,A,S> &result) {
     if (v[i])
       if (vv.set_in(v[i]))
         result.set_add(v[i]);
-} 
+}
 
 template <class C, class A, int S> void
 Vec<C,A,S>::set_disjunction(Vec<C,A,S> &vv, Vec<C,A,S> &result) {
@@ -502,7 +502,7 @@ Vec<C,A,S>::set_disjunction(Vec<C,A,S> &vv, Vec<C,A,S> &result) {
     if (vv.v[i])
       if (!set_in(vv.v[i]))
         result.set_add(vv.v[i]);
-} 
+}
 
 template <class C, class A, int S> void
 Vec<C,A,S>::set_difference(Vec<C,A,S> &vv, Vec<C,A,S> &result) {
@@ -510,7 +510,7 @@ Vec<C,A,S>::set_difference(Vec<C,A,S> &vv, Vec<C,A,S> &result) {
     if (v[i])
       if (!vv.set_in(v[i]))
         result.set_add(v[i]);
-} 
+}
 
 template <class C, class A, int S> int
 Vec<C,A,S>::some_difference(Vec<C,A,S> &vv) {
@@ -519,7 +519,7 @@ Vec<C,A,S>::some_difference(Vec<C,A,S> &vv) {
       if (!vv.set_in(v[i]))
         return 1;
   return 0;
-} 
+}
 
 template <class C, class A, int S> size_t
 Vec<C,A,S>::set_count() const {
@@ -530,7 +530,7 @@ Vec<C,A,S>::set_count() const {
     }
   }
   return x;
-} 
+}
 
 template <class C, class A, int S> void
 Vec<C,A,S>::set_to_vec() {
@@ -561,7 +561,7 @@ Vec<C,A,S>::vec_to_set() {
     set_add(*c);
 }
 
-template <class C, class A, int S> void 
+template <class C, class A, int S> void
 Vec<C,A,S>::remove_index(int index) {
   if (n > 1)
     memmove(&v[index], &v[index+1], (n - 1 - index) * sizeof(v[0]));
@@ -593,7 +593,7 @@ Vec<C,A,S>::insert(size_t index) {
   return v[index];
 }
 
-template <class C, class A, int S> void 
+template <class C, class A, int S> void
 Vec<C,A,S>::reverse() {
   for (int i = 0; i < n/2; i++) {
     C *s = &v[i], *e = &v[n - 1 - i];
@@ -612,7 +612,7 @@ Vec<C,A,S>::copy_internal(const Vec<C,A,S> &vv) {
   nl = 1 << nl;
   v = (C*)A::alloc(nl * sizeof(C));
   memcpy(v, vv.v, n * sizeof(C));
-  memset(v + n, 0, (nl - n) * sizeof(C)); 
+  memset(v + n, 0, (nl - n) * sizeof(C));
   if (i > n)  // reset reserve
     i = 0;
 }
@@ -628,7 +628,7 @@ Vec<C,A,S>::set_expand() {
   memset(v, 0, n * sizeof(C));
 }
 
-template <class C, class A, int S> inline void 
+template <class C, class A, int S> inline void
 Vec<C,A,S>::reserve(size_t x) {
   if (x <= n)
     return;
@@ -644,7 +644,7 @@ Vec<C,A,S>::reserve(size_t x) {
     A::free(vv);
 }
 
-template <class C, class A, int S> inline void 
+template <class C, class A, int S> inline void
 Vec<C,A,S>::addx() {
   if (!v) {
     v = e;
@@ -703,12 +703,12 @@ Vec<C,A,S>::delete_and_clear() {
   clear();
 }
 
-template <class C, class A, int S> 
-inline Vec<C,A,S>::~Vec() { 
-  if (v && v != e) A::free(v); 
+template <class C, class A, int S>
+inline Vec<C,A,S>::~Vec() {
+  if (v && v != e) A::free(v);
 }
 
-template <class C, class A, int S> 
+template <class C, class A, int S>
 inline int marshal_size(Vec<C,A,S> &v) {
   int l = sizeof(int) * 2;
   for (int x = 0; x < v.n; x++)
@@ -716,7 +716,7 @@ inline int marshal_size(Vec<C,A,S> &v) {
   return l;
 }
 
-template <class C, class A, int S> 
+template <class C, class A, int S>
 inline int marshal(Vec<C,A,S> &v, char *buf) {
   char *x = buf;
   *(int*)x = v.n; x += sizeof(int);
@@ -726,7 +726,7 @@ inline int marshal(Vec<C,A,S> &v, char *buf) {
   return x - buf;
 }
 
-template <class C, class A, int S> 
+template <class C, class A, int S>
 inline int unmarshal(Vec<C,A,S> &v, char *buf) {
   char *x = buf;
   v.n = *(int*)x; x += sizeof(int);
@@ -741,7 +741,7 @@ inline int unmarshal(Vec<C,A,S> &v, char *buf) {
   return x - buf;
 }
 
-template <class C, class A, int S> 
+template <class C, class A, int S>
 inline int Vec<C,A,S>::write(int fd) {
   int r = 0, t = 0;
   if ((r = ::write(fd, this, sizeof(*this))) < 0) return r; t += r;
@@ -749,7 +749,7 @@ inline int Vec<C,A,S>::write(int fd) {
   return t;
 }
 
-template <class C, class A, int S> 
+template <class C, class A, int S>
 inline int Vec<C,A,S>::read(int fd) {
   int r = 0, t = 0;
   if ((r = ::read(fd, this, sizeof(*this))) < 0) return r; t += r;
@@ -759,7 +759,7 @@ inline int Vec<C,A,S>::read(int fd) {
   return t;
 }
 
-template <class C> 
+template <class C>
 inline void qsort_Vec(C *left, C *right, bool (*lt)(C,C)) {
  Lagain:
   if (right - left < 5) {
@@ -795,7 +795,7 @@ inline void qsort_Vec(C *left, C *right, bool (*lt)(C,C)) {
   }
 }
 
-template <class C> 
+template <class C>
 inline void qsort_VecRef(C *left, C *right, bool (*lt)(const C &, const C &)) {
  Lagain:
   if (right - left < 5) {
@@ -831,13 +831,13 @@ inline void qsort_VecRef(C *left, C *right, bool (*lt)(const C &, const C &)) {
   }
 }
 
-template <class C, class A, int S> 
+template <class C, class A, int S>
 inline void Vec<C,A,S>::qsort(bool (*lt)(C,C)) {
   if (n)
     qsort_Vec<C>(&v[0], end(), lt);
 }
 
-template <class C, class A, int S> 
+template <class C, class A, int S>
 inline void Vec<C,A,S>::qsort(bool (*lt)(const C &, const C &)) {
   if (n)
     qsort_VecRef<C>(&v[0], end(), lt);

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/ink_args.cc
----------------------------------------------------------------------
diff --git a/lib/ts/ink_args.cc b/lib/ts/ink_args.cc
index 50d08c3..c6c0e65 100644
--- a/lib/ts/ink_args.cc
+++ b/lib/ts/ink_args.cc
@@ -246,7 +246,7 @@ usage(const ArgumentDescription * argument_descriptions, unsigned n_argument_des
 
     if ('-' == argument_descriptions[i].key) fprintf(stderr, "   ");
     else fprintf(stderr, "-%c,", argument_descriptions[i].key);
-                                               
+
     fprintf(stderr, " --%-17s %s",
             argument_descriptions[i].name,
             argument_types_descriptions[argument_descriptions[i].type ?

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/ink_inet.cc
----------------------------------------------------------------------
diff --git a/lib/ts/ink_inet.cc b/lib/ts/ink_inet.cc
index b20633b..a841a76 100644
--- a/lib/ts/ink_inet.cc
+++ b/lib/ts/ink_inet.cc
@@ -338,8 +338,8 @@ IpAddr::load(char const* text) {
   return zret;
 }
 
-int 
-IpAddr::load(ts::ConstBuffer const& text) 
+int
+IpAddr::load(ts::ConstBuffer const& text)
 {
   IpEndpoint ip;
   int zret = ats_ip_pton(text, &ip.sa);
@@ -459,7 +459,7 @@ ats_ip_getbestaddrinfo(char const* host,
     ai_hints.ai_family = AF_UNSPEC;
     ai_hints.ai_flags = AI_ADDRCONFIG;
     zret = getaddrinfo(addr_text.data(), 0, &ai_hints, &ai_result);
-  
+
     if (0 == zret) {
       // Walk the returned addresses and pick the "best".
       enum {
@@ -484,7 +484,7 @@ ats_ip_getbestaddrinfo(char const* host,
         else if (ats_is_ip_private(ai_ip)) spot_type = PR;
         else if (ats_is_ip_multicast(ai_ip)) spot_type = MC;
         else spot_type = GL;
-        
+
         if (spot_type == NA) continue; // Next!
 
         if (ats_is_ip4(ai_ip)) {

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/ink_inet.h
----------------------------------------------------------------------
diff --git a/lib/ts/ink_inet.h b/lib/ts/ink_inet.h
index 6c21e74..9181f38 100644
--- a/lib/ts/ink_inet.h
+++ b/lib/ts/ink_inet.h
@@ -626,7 +626,7 @@ inline bool ats_is_ip_any(sockaddr const* ip) {
     (ats_is_ip6(ip) && IN6_IS_ADDR_UNSPECIFIED(&ats_ip6_addr_cast(ip)))
     ;
 }
-  
+
 /// @name Address operators
 //@{
 
@@ -1029,7 +1029,7 @@ ats_ip_getbestaddrinfo(
 );
 
 /** Generic IP address hash function.
-*/    
+*/
 uint32_t ats_ip_hash(sockaddr const* addr);
 
 /** Convert address to string as a hexidecimal value.
@@ -1112,7 +1112,7 @@ struct IpAddr {
   int load(
     ts::ConstBuffer const& str ///< Text of IP address.
   );
-  
+
   /** Output to a string.
       @return The string @a dest.
   */
@@ -1303,7 +1303,7 @@ inline int ats_ip_pton(
 
 inline IpEndpoint&
 IpEndpoint::assign(IpAddr const& addr, in_port_t port) {
-  ats_ip_set(&sa, addr, port); 
+  ats_ip_set(&sa, addr, port);
   return *this;
 }
 

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/ink_memory.h
----------------------------------------------------------------------
diff --git a/lib/ts/ink_memory.h b/lib/ts/ink_memory.h
index 304c7a9..23da1b9 100644
--- a/lib/ts/ink_memory.h
+++ b/lib/ts/ink_memory.h
@@ -164,7 +164,7 @@ make_iovec(PtrType (&array)[N]) {
     foo *bar[ZOMG]; // array of pointers.
     ink_zero(bar); // zero all pointers in the array.
     @endcode
-    
+
  */
 template < typename T > inline void
 ink_zero(T& t) {

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/ink_rand.cc
----------------------------------------------------------------------
diff --git a/lib/ts/ink_rand.cc b/lib/ts/ink_rand.cc
index 1736ee7..e9989e0 100644
--- a/lib/ts/ink_rand.cc
+++ b/lib/ts/ink_rand.cc
@@ -6,11 +6,11 @@
    This is a 64-bit version of Mersenne Twister pseudorandom number
    generator.
 
-   Before using, initialize the state by using init_genrand64(seed)  
+   Before using, initialize the state by using init_genrand64(seed)
    or init_by_array64(init_key, key_length).
 
    Copyright (C) 2004, Makoto Matsumoto and Takuji Nishimura,
-   All rights reserved.                          
+   All rights reserved.
 
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions
@@ -23,8 +23,8 @@
         notice, this list of conditions and the following disclaimer in the
         documentation and/or other materials provided with the distribution.
 
-     3. The names of its contributors may not be used to endorse or promote 
-        products derived from this software without specific prior written 
+     3. The names of its contributors may not be used to endorse or promote
+        products derived from this software without specific prior written
         permission.
 
    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
@@ -41,12 +41,12 @@
 
    References:
    T. Nishimura, ``Tables of 64-bit Mersenne Twisters''
-     ACM Transactions on Modeling and 
+     ACM Transactions on Modeling and
      Computer Simulation 10. (2000) 348--357.
    M. Matsumoto and T. Nishimura,
      ``Mersenne Twister: a 623-dimensionally equidistributed
        uniform pseudorandom number generator''
-     ACM Transactions on Modeling and 
+     ACM Transactions on Modeling and
      Computer Simulation 8. (Jan. 1998) 3--30.
 
    Any feedback is very welcome.
@@ -71,7 +71,7 @@ InkRand::InkRand(uint64_t d) {
 
 void InkRand::seed(uint64_t seed) {
   mt[0] = seed;
-  for (mti=1; mti<NN; mti++) 
+  for (mti=1; mti<NN; mti++)
     mt[mti] =  (6364136223846793005ULL * (mt[mti-1] ^ (mt[mti-1] >> 62)) + mti);
 }
 

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/ink_rand.h
----------------------------------------------------------------------
diff --git a/lib/ts/ink_rand.h b/lib/ts/ink_rand.h
index c0a0c27..f9b78bd 100644
--- a/lib/ts/ink_rand.h
+++ b/lib/ts/ink_rand.h
@@ -10,11 +10,11 @@
    This is a 64-bit version of Mersenne Twister pseudorandom number
    generator.
 
-   Before using, initialize the state by using init_genrand64(seed)  
+   Before using, initialize the state by using init_genrand64(seed)
    or init_by_array64(init_key, key_length).
 
    Copyright (C) 2004, Makoto Matsumoto and Takuji Nishimura,
-   All rights reserved.                          
+   All rights reserved.
 
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions
@@ -27,8 +27,8 @@
         notice, this list of conditions and the following disclaimer in the
         documentation and/or other materials provided with the distribution.
 
-     3. The names of its contributors may not be used to endorse or promote 
-        products derived from this software without specific prior written 
+     3. The names of its contributors may not be used to endorse or promote
+        products derived from this software without specific prior written
         permission.
 
    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
@@ -45,12 +45,12 @@
 
    References:
    T. Nishimura, ``Tables of 64-bit Mersenne Twisters''
-     ACM Transactions on Modeling and 
+     ACM Transactions on Modeling and
      Computer Simulation 10. (2000) 348--357.
    M. Matsumoto and T. Nishimura,
      ``Mersenne Twister: a 623-dimensionally equidistributed
        uniform pseudorandom number generator''
-     ACM Transactions on Modeling and 
+     ACM Transactions on Modeling and
      Computer Simulation 8. (Jan. 1998) 3--30.
 
    Any feedback is very welcome.

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/ink_res_init.cc
----------------------------------------------------------------------
diff --git a/lib/ts/ink_res_init.cc b/lib/ts/ink_res_init.cc
index 71a922d..c9a0ed8 100644
--- a/lib/ts/ink_res_init.cc
+++ b/lib/ts/ink_res_init.cc
@@ -431,7 +431,7 @@ ink_res_init(
     if (pHostListSize > INK_MAXNS) pHostListSize = INK_MAXNS;
     for (
         ; nserv < pHostListSize
-          && ats_is_ip(&pHostList[nserv].sa) 
+          && ats_is_ip(&pHostList[nserv].sa)
         ; ++nserv
     ) {
       ats_ip_copy(&statp->nsaddr_list[nserv].sa, &pHostList[nserv].sa);
@@ -624,7 +624,7 @@ parse_host_res_preference(char const* value, HostResPreferenceOrder order) {
     if (np < N_HOST_RES_PREFERENCE_ORDER) // was N_HOST_RES_PREFERENCE)
       order[np] = HOST_RES_PREFER_NONE;
   }
-}      
+}
 
 int
 ts_host_res_order_to_string(HostResPreferenceOrder const& order, char* out, int size)

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/ink_sock.cc
----------------------------------------------------------------------
diff --git a/lib/ts/ink_sock.cc b/lib/ts/ink_sock.cc
index 055cd38..a57efe5 100644
--- a/lib/ts/ink_sock.cc
+++ b/lib/ts/ink_sock.cc
@@ -192,8 +192,8 @@ safe_getsockname(int s, struct sockaddr *name, int *namelen)
   return r;
 }
 
-int 
-safe_getpeername(int s, struct sockaddr *name, int *namelen) 
+int
+safe_getpeername(int s, struct sockaddr *name, int *namelen)
 {
   int r;
   do {

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/ts/test_Map.cc
----------------------------------------------------------------------
diff --git a/lib/ts/test_Map.cc b/lib/ts/test_Map.cc
index 6a28445..3824607 100644
--- a/lib/ts/test_Map.cc
+++ b/lib/ts/test_Map.cc
@@ -55,7 +55,7 @@ void test_TSHashTable() {
   Table t;
   Item* item;
   Table::Location loc;
-  
+
   item = new Item(1);
   t.insert(item);
   for ( uint32_t i = 2 ; i <= N ; ++i ) {
@@ -80,7 +80,7 @@ void test_TSHashTable() {
     ; // compiler check.
 
   ink_assert(!(t.find(N/2 | 1).isValid()));
-  
+
   for ( uint32_t i = 1 ; i <= N ; i += 2) {
     t.remove(i);
   }
@@ -184,7 +184,7 @@ int main(int /* argc ATS_UNUSED */, char **/*argv ATS_UNUSED */) {
   ink_assert(ssh.get("ac") == 7);
   ssh.del(ho);
   ink_assert(ssh.get(ho) == 0);
-  
+
   Vec<int> ints;
   ssh.get_values(ints);
   ink_assert(ints.n == 8);

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/tsconfig/Errata.cc
----------------------------------------------------------------------
diff --git a/lib/tsconfig/Errata.cc b/lib/tsconfig/Errata.cc
index a4733a7..a0259a1 100644
--- a/lib/tsconfig/Errata.cc
+++ b/lib/tsconfig/Errata.cc
@@ -58,7 +58,7 @@ Errata::Data::top() const {
   return m_items.size() ? m_items.back() : NIL_MESSAGE ;
 }
 
-inline Errata::Errata(ImpPtr const& ptr) 
+inline Errata::Errata(ImpPtr const& ptr)
   : m_data(ptr) {
 }
 

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/tsconfig/Errata.h
----------------------------------------------------------------------
diff --git a/lib/tsconfig/Errata.h b/lib/tsconfig/Errata.h
index 2861503..8cb50da 100644
--- a/lib/tsconfig/Errata.h
+++ b/lib/tsconfig/Errata.h
@@ -109,7 +109,7 @@ public:
 //    typedef Container::iterator reverse_iterator;
     /// Reverse constant message iteration.
 //    typedef Container::const_iterator const_reverse_iterator;
-    
+
     /// Default constructor - empty errata, very fast.
     Errata();
     /// Copy constructor, very fast.
@@ -311,7 +311,7 @@ public:
         NULL the indentation is overwritten by @a lead if @a indent is
         non-zero. It acts as a "continuation" marker for nested
         @c Errata.
-        
+
      */
     std::ostream& write(
       std::ostream& out, ///< Output stream.

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/tsconfig/IntrusivePtr.h
----------------------------------------------------------------------
diff --git a/lib/tsconfig/IntrusivePtr.h b/lib/tsconfig/IntrusivePtr.h
index 937fc1d..cde2450 100644
--- a/lib/tsconfig/IntrusivePtr.h
+++ b/lib/tsconfig/IntrusivePtr.h
@@ -103,7 +103,7 @@ public:
   IntrusivePtrCounter(
     IntrusivePtrCounter const& ///< Source object.
   );
-  
+
   /** Assignment operator.
 
       @internal We need this for the same reason as the copy
@@ -217,7 +217,7 @@ public:
   > IntrusivePtr(
     IntrusivePtr<X> const& that ///< Foreign pointer.
   );
-  
+
   /** Cross type assignment.
       This succeeds if an @a X* can be implicitily converted to a @a T*.
   */
@@ -232,7 +232,7 @@ public:
   /// @c false otherwise.
   bool isShared() const;
   /// Check for a single reference (@c shared_ptr compatibility)
-  /// @return @c true if this object is not shared. 
+  /// @return @c true if this object is not shared.
   bool unique() const;
   /// Reference count.
   /// @return Number of references.
@@ -353,7 +353,7 @@ public:
     bool operator() (
       IntrusivePtr<T> const& lhs, ///< Left hand operand.
       IntrusivePtr<T> const& rhs ///< Right hand operand.
-    ) const; 
+    ) const;
   };
 };
 
@@ -425,7 +425,7 @@ IntrusivePtr<T>::IntrusivePtr(
   IntrusivePtr<X> const& that ///< Foreign pointer.
 ) : super(that.get()) {
 }
-  
+
 template < typename T > IntrusivePtr<T>&
 IntrusivePtr<T>::operator = (const self& that) {
   this->reset(that.m_obj);
@@ -437,7 +437,7 @@ template < typename X >
 IntrusivePtr<T>&
 IntrusivePtr<T>::operator = (
   IntrusivePtr<X> const& that ///< Foreign pointer.
-) { 
+) {
   this->reset(that.get());
   return *this;
 }

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/tsconfig/TsConfigGrammar.c
----------------------------------------------------------------------
diff --git a/lib/tsconfig/TsConfigGrammar.c b/lib/tsconfig/TsConfigGrammar.c
index c24f1a9..c63b4d8 100644
--- a/lib/tsconfig/TsConfigGrammar.c
+++ b/lib/tsconfig/TsConfigGrammar.c
@@ -1,19 +1,19 @@
 /* A Bison parser, made by GNU Bison 2.7.  */
 
 /* Bison implementation for Yacc-like parsers in C
-   
+
       Copyright (C) 1984, 1989-1990, 2000-2012 Free Software Foundation, Inc.
-   
+
    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.
-   
+
    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
-   
+
    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
 
@@ -26,7 +26,7 @@
    special exception, which will cause the skeleton and the resulting
    Bison output files to be licensed under the GNU General Public
    License without this special exception.
-   
+
    This special exception was added by the Free Software Foundation in
    version 2.2 of Bison.  */
 

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/tsconfig/TsConfigGrammar.h
----------------------------------------------------------------------
diff --git a/lib/tsconfig/TsConfigGrammar.h b/lib/tsconfig/TsConfigGrammar.h
index 1700ea1..52f083b 100644
--- a/lib/tsconfig/TsConfigGrammar.h
+++ b/lib/tsconfig/TsConfigGrammar.h
@@ -1,19 +1,19 @@
 /* A Bison parser, made by GNU Bison 2.7.  */
 
 /* Bison interface for Yacc-like parsers in C
-   
+
       Copyright (C) 1984, 1989-1990, 2000-2012 Free Software Foundation, Inc.
-   
+
    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.
-   
+
    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
-   
+
    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
 
@@ -26,7 +26,7 @@
    special exception, which will cause the skeleton and the resulting
    Bison output files to be licensed under the GNU General Public
    License without this special exception.
-   
+
    This special exception was added by the Free Software Foundation in
    version 2.2 of Bison.  */
 

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/tsconfig/TsConfigSyntax.c
----------------------------------------------------------------------
diff --git a/lib/tsconfig/TsConfigSyntax.c b/lib/tsconfig/TsConfigSyntax.c
index 17150a1..63a0ca8 100644
--- a/lib/tsconfig/TsConfigSyntax.c
+++ b/lib/tsconfig/TsConfigSyntax.c
@@ -34,7 +34,7 @@
 #if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
 
 /* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
- * if you want the limit (max/min) macros for int types. 
+ * if you want the limit (max/min) macros for int types.
  */
 #ifndef __STDC_LIMIT_MACROS
 #define __STDC_LIMIT_MACROS 1
@@ -51,7 +51,7 @@ typedef uint32_t flex_uint32_t;
 typedef signed char flex_int8_t;
 typedef short int flex_int16_t;
 typedef int flex_int32_t;
-typedef unsigned char flex_uint8_t; 
+typedef unsigned char flex_uint8_t;
 typedef unsigned short int flex_uint16_t;
 typedef unsigned int flex_uint32_t;
 
@@ -181,7 +181,7 @@ typedef size_t yy_size_t;
 #define EOB_ACT_LAST_MATCH 2
 
     #define YY_LESS_LINENO(n)
-    
+
 /* Return all but the first "n" matched characters back to the input stream. */
 #define yyless(n) \
 	do \
@@ -238,7 +238,7 @@ struct yy_buffer_state
 
     int yy_bs_lineno; /**< The line count. */
     int yy_bs_column; /**< The column count. */
-    
+
 	/* Whether to try to fill the input buffer when we reach the
 	 * end of it.
 	 */
@@ -484,7 +484,7 @@ static yyconst flex_int16_t yy_chk[89] =
     See the License for the specific language governing permissions and
     limitations under the License.
  */
- 
+
 # if ! (defined(__clang_analyzer__) || defined(__COVERITY__))
 
 # include "TsConfigParseEvents.h"
@@ -568,7 +568,7 @@ static int yy_init_globals (yyscan_t yyscanner );
     /* This must go here because YYSTYPE and YYLTYPE are included
      * from bison output in section 1.*/
     #    define yylval yyg->yylval_r
-    
+
 int tsconfiglex_init (yyscan_t* scanner);
 
 int tsconfiglex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner);
@@ -1443,7 +1443,7 @@ static void tsconfig_load_buffer_state  (yyscan_t yyscanner)
     YY_BUFFER_STATE tsconfig_create_buffer  (FILE * file, int  size , yyscan_t yyscanner)
 {
 	YY_BUFFER_STATE b;
-    
+
 	b = (YY_BUFFER_STATE) tsconfigalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
 	if ( ! b )
 		YY_FATAL_ERROR( "out of dynamic memory in tsconfig_create_buffer()" );
@@ -1509,7 +1509,7 @@ static void tsconfig_load_buffer_state  (yyscan_t yyscanner)
     }
 
         b->yy_is_interactive = 0;
-    
+
 	errno = oerrno;
 }
 
@@ -1615,9 +1615,9 @@ static void tsconfigensure_buffer_stack (yyscan_t yyscanner)
 								, yyscanner);
 		if ( ! yyg->yy_buffer_stack )
 			YY_FATAL_ERROR( "out of dynamic memory in tsconfigensure_buffer_stack()" );
-								  
+
 		memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*));
-				
+
 		yyg->yy_buffer_stack_max = num_to_alloc;
 		yyg->yy_buffer_stack_top = 0;
 		return;
@@ -1646,12 +1646,12 @@ static void tsconfigensure_buffer_stack (yyscan_t yyscanner)
  * @param base the character buffer
  * @param size the size in bytes of the character buffer
  * @param yyscanner The scanner object.
- * @return the newly allocated buffer state object. 
+ * @return the newly allocated buffer state object.
  */
 YY_BUFFER_STATE tsconfig_scan_buffer  (char * base, yy_size_t  size , yyscan_t yyscanner)
 {
 	YY_BUFFER_STATE b;
-    
+
 	if ( size < 2 ||
 	     base[size-2] != YY_END_OF_BUFFER_CHAR ||
 	     base[size-1] != YY_END_OF_BUFFER_CHAR )
@@ -1687,7 +1687,7 @@ YY_BUFFER_STATE tsconfig_scan_buffer  (char * base, yy_size_t  size , yyscan_t y
  */
 YY_BUFFER_STATE tsconfig_scan_string (yyconst char * yystr , yyscan_t yyscanner)
 {
-    
+
 	return tsconfig_scan_bytes(yystr,strlen(yystr) ,yyscanner);
 }
 
@@ -1704,7 +1704,7 @@ YY_BUFFER_STATE tsconfig_scan_bytes  (yyconst char * yybytes, yy_size_t  _yybyte
 	char *buf;
 	yy_size_t n;
 	yy_size_t i;
-    
+
 	/* Get memory for full buffer, including space for trailing EOB's. */
 	n = _yybytes_len + 2;
 	buf = (char *) tsconfigalloc(n ,yyscanner );
@@ -1772,10 +1772,10 @@ YY_EXTRA_TYPE tsconfigget_extra  (yyscan_t yyscanner)
 int tsconfigget_lineno  (yyscan_t yyscanner)
 {
     struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
-    
+
         if (! YY_CURRENT_BUFFER)
             return 0;
-    
+
     return yylineno;
 }
 
@@ -1785,10 +1785,10 @@ int tsconfigget_lineno  (yyscan_t yyscanner)
 int tsconfigget_column  (yyscan_t yyscanner)
 {
     struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
-    
+
         if (! YY_CURRENT_BUFFER)
             return 0;
-    
+
     return yycolumn;
 }
 
@@ -1850,7 +1850,7 @@ void tsconfigset_lineno (int  line_number , yyscan_t yyscanner)
         /* lineno is only valid if an input buffer exists. */
         if (! YY_CURRENT_BUFFER )
            YY_FATAL_ERROR( "tsconfigset_lineno called with no buffer" );
-    
+
     yylineno = line_number;
 }
 
@@ -1865,7 +1865,7 @@ void tsconfigset_column (int  column_no , yyscan_t yyscanner)
         /* column is only valid if an input buffer exists. */
         if (! YY_CURRENT_BUFFER )
            YY_FATAL_ERROR( "tsconfigset_column called with no buffer" );
-    
+
     yycolumn = column_no;
 }
 
@@ -1960,20 +1960,20 @@ int tsconfiglex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_global
         errno = EINVAL;
         return 1;
     }
-	
+
     *ptr_yy_globals = (yyscan_t) tsconfigalloc ( sizeof( struct yyguts_t ), &dummy_yyguts );
-	
+
     if (*ptr_yy_globals == NULL){
         errno = ENOMEM;
         return 1;
     }
-    
+
     /* By setting to 0xAA, we expose bugs in
     yy_init_globals. Leave at 0x00 for releases. */
     memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
-    
+
     tsconfigset_extra (yy_user_defined, *ptr_yy_globals);
-    
+
     return yy_init_globals ( *ptr_yy_globals );
 }
 

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/tsconfig/TsErrataUtil.cc
----------------------------------------------------------------------
diff --git a/lib/tsconfig/TsErrataUtil.cc b/lib/tsconfig/TsErrataUtil.cc
index 4d72b05..fe24d50 100644
--- a/lib/tsconfig/TsErrataUtil.cc
+++ b/lib/tsconfig/TsErrataUtil.cc
@@ -82,7 +82,7 @@ vlogf(
 ) {
   static size_t const SIZE = 8192;
   char buffer[SIZE];
-  
+
   vsnprintf(buffer, SIZE, format, rest);
   err.push(id, code, buffer);
   return err;
@@ -147,7 +147,7 @@ vlogf_errno(Errata& errata, Errata::Id id, Errata::Code code, char const* format
   char e_buffer[E_SIZE];
   static int const T_SIZE = 8192;
   char t_buffer[T_SIZE];
-  
+
   n = vsnprintf(t_buffer, T_SIZE, format, rest);
   if (0 <= n && n < T_SIZE) { // still have room.
     ATS_UNUSED_RETURN(strerror_r(e, e_buffer, E_SIZE));

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/tsconfig/TsValue.h
----------------------------------------------------------------------
diff --git a/lib/tsconfig/TsValue.h b/lib/tsconfig/TsValue.h
index aeee930..2836359 100644
--- a/lib/tsconfig/TsValue.h
+++ b/lib/tsconfig/TsValue.h
@@ -672,7 +672,7 @@ inline size_t Value::getIndex() const {
   detail::ValueItem const* item = this->item();
   return item ? item->_local_index : 0;
 }
-  
+
 inline bool Value::isLiteral() const { return 0 != (detail::IS_LITERAL & detail::Type_Property[this->getType()]); }
 inline bool Value::isContainer() const { return 0 != (detail::IS_CONTAINER & detail::Type_Property[this->getType()]); }
 inline Value Value::getParent() const { return this->hasValue() ? Value(_config, _config._table[_vidx]._parent) : Value(); }

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/wccp/Wccp.h
----------------------------------------------------------------------
diff --git a/lib/wccp/Wccp.h b/lib/wccp/Wccp.h
index 9d073d5..4e885e5 100644
--- a/lib/wccp/Wccp.h
+++ b/lib/wccp/Wccp.h
@@ -112,7 +112,7 @@ public:
   //@}
   /// Service IDs of this value or less are reserved.
   static uint8_t const RESERVED = 50;
-  
+
   /// Number of ports in component (defined by protocol).
   static size_t const N_PORTS = 8;
 
@@ -227,7 +227,7 @@ public:
   bool isConfigured() const;
 
   /** Open a socket for communications.
-      
+
       If @a addr is @c INADDR_ANY then the identifying address is used.
       If that is not set this method will attempt to find an arbitrary
       local address and use that as the identifying address.
@@ -379,8 +379,8 @@ public:
   self& setCacheAssignment(
     CacheAssignmentStyle style ///< Style to use.
   );
-  
-  
+
+
 private:
   Service(Cache const& cache, detail::cache::GroupData& group);
   Cache m_cache; ///< Parent cache.

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/wccp/WccpConfig.cc
----------------------------------------------------------------------
diff --git a/lib/wccp/WccpConfig.cc b/lib/wccp/WccpConfig.cc
index e028b72..443fa8f 100644
--- a/lib/wccp/WccpConfig.cc
+++ b/lib/wccp/WccpConfig.cc
@@ -165,7 +165,7 @@ ts::Errata::Message Service_Type_Defaulted(wccp::ServiceGroup::Type type, int li
 
 ts::Errata::Message Service_Type_Invalid(ts::ConstBuffer const& text, int line) {
   std::ostringstream out;
-  out << "Service type '" << text 
+  out << "Service type '" << text
       << "' at line " << line
       << " invalid. Must be \"STANDARD\" or \"DYNAMIC\""
     ;
@@ -249,7 +249,7 @@ ts::Errata::Message Svc_Flags_Ignored(int line) {
 ts::Errata::Message Svc_Ports_Too_Many(int line, int n) {
   std::ostringstream out;
   out << "Excess ports ignored at line " << line
-      << ". " << n << " ports specified, only" 
+      << ". " << n << " ports specified, only"
       << wccp::ServiceGroup::N_PORTS << " supported."
     ;
   return ts::Errata::Message(14, LVL_INFO, out.str());
@@ -743,7 +743,7 @@ CacheImpl::loadServicesFromFile(char const* path) {
       bool gre = FORWARD_OPTS[0].m_found;
       bool l2 = FORWARD_OPTS[1].m_found;
       if (gre || l2) {
-        svc.m_packet_forward = 
+        svc.m_packet_forward =
           gre
             ? l2 ? ServiceGroup::GRE_OR_L2 : ServiceGroup::GRE
             : ServiceGroup::L2

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/wccp/WccpEndPoint.cc
----------------------------------------------------------------------
diff --git a/lib/wccp/WccpEndPoint.cc b/lib/wccp/WccpEndPoint.cc
index 4d759eb..0dcf7cb 100644
--- a/lib/wccp/WccpEndPoint.cc
+++ b/lib/wccp/WccpEndPoint.cc
@@ -38,7 +38,7 @@ namespace wccp {
 # define dstaddr(x) (&(((struct in_pktinfo *)(CMSG_DATA(x)))->ipi_addr))
 #else
 # error "can't determine socket option"
-#endif 
+#endif
 
 // ------------------------------------------------------
 Impl::GroupData::GroupData()
@@ -199,7 +199,7 @@ Impl::handleMessage() {
   recv_hdr.msg_iovlen = 1;
   recv_hdr.msg_control = anc_buffer;
   recv_hdr.msg_controllen = ANC_BUFFER_SIZE;
-  
+
   n = recvmsg(m_fd, &recv_hdr, MSG_TRUNC);
   if (n > BUFFER_SIZE) return -EMSGSIZE;
   else if (n < 0) return -errno;
@@ -269,9 +269,9 @@ CacheImpl::GroupData::seedRouter(uint32_t addr) {
 time_t
 CacheImpl::GroupData::removeSeedRouter(uint32_t addr) {
   time_t zret = 0;
-  std::vector<SeedRouter>::iterator begin = m_seed_routers.begin(); 
+  std::vector<SeedRouter>::iterator begin = m_seed_routers.begin();
   std::vector<SeedRouter>::iterator end = m_seed_routers.end();
-  std::vector<SeedRouter>::iterator spot = 
+  std::vector<SeedRouter>::iterator spot =
     std::find_if(begin, end, ts::predicate(&SeedRouter::m_addr, addr));
 
   if (end != spot) {
@@ -316,7 +316,7 @@ CacheImpl::GroupData::resizeCacheSources() {
   }
 }
 
-inline CacheImpl::RouterData::RouterData() 
+inline CacheImpl::RouterData::RouterData()
   : m_addr(0)
   , m_generation(0)
   , m_rapid(0)
@@ -648,7 +648,7 @@ CacheImpl::housekeeping() {
       here_i_am.setBuffer(msg_buffer);
       // Is the router due for a ping?
       if (sspot->m_xmit + TIME_UNIT > now) continue; // no
-      
+
       this->generateHereIAm(here_i_am, group);
 
       dst_addr.sin_addr.s_addr = sspot->m_addr;
@@ -943,7 +943,7 @@ RouterImpl::handleHereIAm(IpHeader const& ip_hdr, ts::Buffer const& chunk) {
   time_t now = time(0); // don't call this over and over.
   int parse = msg.parse(chunk);
 
-  if (PARSE_SUCCESS != parse) 
+  if (PARSE_SUCCESS != parse)
     return log(LVL_INFO, "Ignored malformed WCCP2_HERE_I_AM message.\n");
 
   if (!this->validateSecurity(msg, nil_group))

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/wccp/WccpLocal.h
----------------------------------------------------------------------
diff --git a/lib/wccp/WccpLocal.h b/lib/wccp/WccpLocal.h
index d039bc0..9d73d17 100644
--- a/lib/wccp/WccpLocal.h
+++ b/lib/wccp/WccpLocal.h
@@ -978,7 +978,7 @@ struct CompWithHeader : public ComponentBase {
       This requires the (subclass) client to
       - Do a size check to verify enough space for the component header.
       - Set @a m_base
-      
+
       This method
       - Checks the component type against the expected type (@a ect)
       - Checks stored component length against the buffer size.
@@ -1604,7 +1604,7 @@ public:
 
   /// Component type ID for this component.
   static CompType const COMP_TYPE = CAPABILITY_INFO;
-  
+
   // Not even a stub for this component, just an array of elements.
 
   /// Default constructor.
@@ -1799,7 +1799,7 @@ class AltMaskAssignComp
 public:
   typedef AltMaskAssignComp self; ///< Self reference type.
   typedef AltAssignComp super; ///< Parent type.
-  
+
   /// Force virtual desctructor.
   virtual ~AltMaskAssignComp() {}
 
@@ -2068,7 +2068,7 @@ namespace detail {
           store one received from an extern source.
       */
       detail::Assignment m_assign_info;
-      
+
       /// Default constructor.
       GroupData();
       /// Use @a key instead of global default.
@@ -2286,7 +2286,7 @@ public:
   /// Default constructor.
   Impl();
   /** Set the local address used for this endpoint.
-      If not set, an arbitrary local address will be 
+      If not set, an arbitrary local address will be
       @note This can only be called once, and must be called before
       @c open.
   */

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/wccp/WccpMeta.h
----------------------------------------------------------------------
diff --git a/lib/wccp/WccpMeta.h b/lib/wccp/WccpMeta.h
index be85c93..a30f1c9 100644
--- a/lib/wccp/WccpMeta.h
+++ b/lib/wccp/WccpMeta.h
@@ -158,7 +158,7 @@ predicate(V (T::*m)() const, V const& v) {
 # if 0
 
 /// Accumulate a minimum value when called repeated on different objects.
-template < 
+template <
   typename V, ///< Value type.
   typename T, ///< Object type
   typename F ///< Extractor type.

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/wccp/WccpMsg.cc
----------------------------------------------------------------------
diff --git a/lib/wccp/WccpMsg.cc b/lib/wccp/WccpMsg.cc
index 0ce41f6..1619538 100644
--- a/lib/wccp/WccpMsg.cc
+++ b/lib/wccp/WccpMsg.cc
@@ -441,14 +441,14 @@ SecurityComp::fill(MsgBuffer& buffer, Option opt) {
     throw ts::Exception(BUFFER_TOO_SMALL_FOR_COMP_TEXT);
 
   m_base = buffer.getTail();
- 
+
   this->setType(COMP_TYPE)
     .setLength(comp_size - sizeof(super::raw_t))
     .setOption(opt)
     ;
 
   if (SECURITY_NONE != opt) {
-    RawMD5::HashData& data = access_field(&RawMD5::m_data, m_base); 
+    RawMD5::HashData& data = access_field(&RawMD5::m_data, m_base);
     memset(data, 0, sizeof(data));
   }
 
@@ -497,7 +497,7 @@ SecurityComp::validate(MsgBuffer const& msg) const {
 int
 SecurityComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < sizeof(raw_t)) 
+  if (buffer.getSpace() < sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -568,7 +568,7 @@ int
 ServiceComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
   size_t comp_size = this->calcSize();
-  if (buffer.getSpace() < comp_size) 
+  if (buffer.getSpace() < comp_size)
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -701,7 +701,7 @@ RouterIdComp::fillSingleton(
 int
 RouterIdComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < sizeof(raw_t)) 
+  if (buffer.getSpace() < sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -737,7 +737,7 @@ RouterViewComp::setChangeNumber(uint32_t n) {
   set_field(&raw_t::m_change_number, m_base, n);
   return *this;
 }
-  
+
 uint32_t
 RouterViewComp::getCacheCount() const {
   return ntohl(*m_cache_count);
@@ -806,7 +806,7 @@ RouterViewComp::fill(
 int
 RouterViewComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < sizeof(raw_t)) 
+  if (buffer.getSpace() < sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -859,7 +859,7 @@ CacheIdComp::fill(MsgBuffer& base, CacheIdBox const& src) {
 int
 CacheIdComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < sizeof(raw_t)) 
+  if (buffer.getSpace() < sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -890,7 +890,7 @@ CacheViewComp::setChangeNumber(uint32_t n) {
   set_field(&raw_t::m_change_number, m_base, n);
   return *this;
 }
-  
+
 uint32_t
 CacheViewComp::getRouterCount() const {
   return get_field(&raw_t::m_router_count, m_base);
@@ -997,7 +997,7 @@ CacheViewComp::fill(
 int
 CacheViewComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < sizeof(raw_t)) 
+  if (buffer.getSpace() < sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -1037,7 +1037,7 @@ AssignInfoComp::setKeyChangeNumber(uint32_t n) {
   access_field(&raw_t::m_key, m_base).setChangeNumber(n);
   return *this;
 }
-  
+
 uint32_t
 AssignInfoComp::getKeyAddr() const {
   return access_field(&raw_t::m_key, m_base).getAddr();
@@ -1094,7 +1094,7 @@ AssignInfoComp::calcCacheCountPtr() {
 AssignInfoComp::Bucket*
 AssignInfoComp::calcBucketPtr() {
   return reinterpret_cast<Bucket*>(reinterpret_cast<char*>(m_cache_count) + sizeof(uint32_t) * (1 + this->getCacheCount()));
-}  
+}
 
 AssignInfoComp&
 AssignInfoComp::fill(
@@ -1128,7 +1128,7 @@ AssignInfoComp::fill(
 int
 AssignInfoComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < HEADER_SIZE) 
+  if (buffer.getSpace() < HEADER_SIZE)
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -1222,7 +1222,7 @@ AltHashAssignComp::fill(
 int
 AltHashAssignComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < sizeof(raw_t)) 
+  if (buffer.getSpace() < sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -1276,7 +1276,7 @@ AltMaskAssignComp::fill(
 int
 AltMaskAssignComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < sizeof(raw_t)) 
+  if (buffer.getSpace() < sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -1346,7 +1346,7 @@ CmdComp::fill(MsgBuffer& buffer, cmd_t cmd, uint32_t data) {
 int
 CmdComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < sizeof(raw_t)) 
+  if (buffer.getSpace() < sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -1383,17 +1383,17 @@ CapComp::cache() const {
     switch (elt.getCapType()) {
     case CapabilityElt::PACKET_FORWARD_METHOD:
       x = elt.getCapData();
-      if (0 < x && x < 4) 
+      if (0 < x && x < 4)
         m_packet_forward = static_cast<ServiceGroup::PacketStyle>(x);
       break;
     case CapabilityElt::PACKET_RETURN_METHOD:
       x = elt.getCapData();
-      if (0 < x && x < 4) 
+      if (0 < x && x < 4)
         m_packet_return = static_cast<ServiceGroup::PacketStyle>(x);
       break;
     case CapabilityElt::CACHE_ASSIGNMENT_METHOD:
       x = elt.getCapData();
-      if (0 < x && x < 4) 
+      if (0 < x && x < 4)
         m_cache_assign = static_cast<ServiceGroup::CacheAssignmentStyle>(x);
       break;
     default:
@@ -1424,7 +1424,7 @@ int
 CapComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
   m_cached = false;
-  if (buffer.getSpace()< sizeof(raw_t)) 
+  if (buffer.getSpace()< sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -1441,7 +1441,7 @@ CapComp::parse(MsgBuffer& buffer) {
 int
 QueryComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace()< sizeof(raw_t)) 
+  if (buffer.getSpace()< sizeof(raw_t))
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -1483,7 +1483,7 @@ AssignMapComp::fill(MsgBuffer& buffer, detail::Assignment const& assign) {
 int
 AssignMapComp::parse(MsgBuffer& buffer) {
   int zret = PARSE_SUCCESS;
-  if (buffer.getSpace() < HEADER_SIZE) 
+  if (buffer.getSpace() < HEADER_SIZE)
     zret = PARSE_BUFFER_TOO_SMALL;
   else {
     m_base = buffer.getTail();
@@ -1535,7 +1535,7 @@ detail::Assignment::fill(cache::GroupData& group, uint32_t addr) {
   // the hash assignment, we can compute reasonable upper bounds and so
   // we don't have to do space checks when those get filled out.
   // The mask assignment is more difficult. We just guess generously and
-  // try to recover if we go over.  
+  // try to recover if we go over.
   size_t size = RouterAssignListElt::calcSize(n_routers) + HashAssignElt::calcSize(n_caches) + 4096;
 
   if (m_buffer.getSize() < size) {
@@ -1572,7 +1572,7 @@ detail::Assignment::fill(cache::GroupData& group, uint32_t addr) {
   size_t k = m_router_list->getSize();
   m_buffer.use(k);
   m_hash_assign = reinterpret_cast<HashAssignElt*>(m_buffer.getTail());
-  
+
   // If the nr value is 0, then the cache was not included in any
   // last packet, so it should be discarded. A cache is valid if
   // nr is n_routers, indicating that every router mentioned it.
@@ -1640,11 +1640,11 @@ HereIAmMsg::fill_caps(
 ) {
   if (router.m_send_caps) {
     m_capabilities.fill(m_buffer, 3);
-    m_capabilities.elt(0) = 
+    m_capabilities.elt(0) =
       CapabilityElt(CapabilityElt::PACKET_FORWARD_METHOD, router.m_packet_forward);
-    m_capabilities.elt(1) = 
+    m_capabilities.elt(1) =
       CapabilityElt(CapabilityElt::CACHE_ASSIGNMENT_METHOD, router.m_cache_assign);
-    m_capabilities.elt(2) = 
+    m_capabilities.elt(2) =
       CapabilityElt(CapabilityElt::PACKET_RETURN_METHOD, router.m_packet_return);
   }
 }

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/wccp/WccpStatic.cc
----------------------------------------------------------------------
diff --git a/lib/wccp/WccpStatic.cc b/lib/wccp/WccpStatic.cc
index bcb06a8..db26418 100644
--- a/lib/wccp/WccpStatic.cc
+++ b/lib/wccp/WccpStatic.cc
@@ -118,7 +118,7 @@ vlogf(
 ) {
   static size_t const SIZE = 8192;
   char buffer[SIZE];
-  
+
   vsnprintf(buffer, SIZE, format, rest);
   err.push(id, code, buffer);
   return err;
@@ -169,7 +169,7 @@ vlogf_errno(ts::Errata::Code code, char const* format, va_list& rest) {
   char e_buffer[E_SIZE];
   static int const T_SIZE = 8192;
   char t_buffer[T_SIZE];
-  
+
   n = vsnprintf(t_buffer, T_SIZE, format, rest);
   if (0 <= n && n < T_SIZE) { // still have room.
     ATS_UNUSED_RETURN(strerror_r(e, e_buffer, E_SIZE));

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/lib/wccp/wccp-test-router.cc
----------------------------------------------------------------------
diff --git a/lib/wccp/wccp-test-router.cc b/lib/wccp/wccp-test-router.cc
index 43fa70e..731cd41 100644
--- a/lib/wccp/wccp-test-router.cc
+++ b/lib/wccp/wccp-test-router.cc
@@ -153,5 +153,5 @@ main(int argc, char** argv) {
       wcp.sendPendingMessages();
     }
   }
-  
+
 }

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/mgmt/Rollback.cc
----------------------------------------------------------------------
diff --git a/mgmt/Rollback.cc b/mgmt/Rollback.cc
index cef1fa0..9243043 100644
--- a/mgmt/Rollback.cc
+++ b/mgmt/Rollback.cc
@@ -1,6 +1,6 @@
 /** @file
 
-  This file contains code for class to allow rollback of configuration files 
+  This file contains code for class to allow rollback of configuration files
 
   @section license License
 

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/mgmt/api/TSControlMain.cc
----------------------------------------------------------------------
diff --git a/mgmt/api/TSControlMain.cc b/mgmt/api/TSControlMain.cc
index 474918f..7810445 100644
--- a/mgmt/api/TSControlMain.cc
+++ b/mgmt/api/TSControlMain.cc
@@ -879,7 +879,7 @@ handle_diags(int /* fd */, void * req, size_t reqlen)
   TSMgmtError ret;
   DiagsLevel level;
 
-  MgmtMarshallInt optype; 
+  MgmtMarshallInt optype;
   MgmtMarshallInt mode;
   MgmtMarshallString msg = NULL;
 
@@ -938,7 +938,7 @@ handle_diags(int /* fd */, void * req, size_t reqlen)
 static TSMgmtError
 handle_stats_reset(int fd, void * req, size_t reqlen)
 {
-  MgmtMarshallInt optype; 
+  MgmtMarshallInt optype;
   MgmtMarshallString name = NULL;
   MgmtMarshallInt err;
 

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/mgmt/web2/WebHttp.cc
----------------------------------------------------------------------
diff --git a/mgmt/web2/WebHttp.cc b/mgmt/web2/WebHttp.cc
index b69cf1f..91d99aa 100644
--- a/mgmt/web2/WebHttp.cc
+++ b/mgmt/web2/WebHttp.cc
@@ -625,6 +625,6 @@ WebHttpAddDocRoot_Xmalloc(WebHttpContext * whc, const char *file, int file_len)
   *(doc_root_file + whc->doc_root_len + file_len) = '\0';
 
   Debug("web2", "DocRoot request file: %s", doc_root_file);
-  
+
   return doc_root_file;
 }

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/plugins/conf_remap/conf_remap.cc
----------------------------------------------------------------------
diff --git a/plugins/conf_remap/conf_remap.cc b/plugins/conf_remap/conf_remap.cc
index 4a260ec..3120fbb 100644
--- a/plugins/conf_remap/conf_remap.cc
+++ b/plugins/conf_remap/conf_remap.cc
@@ -179,7 +179,7 @@ RemapConfigs::parse_file(const char* filename)
       TSError("%s: file %s, line %d: no records.config name given", PLUGIN_NAME, path.c_str(), line_num);
       continue;
     }
-    
+
     // Find the type (INT or STRING only)
     tok = strtok_r(NULL, " \t", &ln);
     if (TS_RECORDDATATYPE_NULL == (type = str_to_datatype(tok))) {
@@ -273,7 +273,7 @@ TSRemapNewInstance(int argc, char* argv[], void** ih, char* /* errbuf ATS_UNUSED
     TSError("Unable to create remap instance, need configuration file");
     return TS_ERROR;
   }
-  
+
   RemapConfigs* conf = new(RemapConfigs);
 
   for (int i = 2; i < argc; ++i) {
@@ -342,7 +342,7 @@ TSRemapDoRemap(void* ih, TSHttpTxn rh, TSRemapRequestInfo* /* rri ATS_UNUSED */)
 }
 
 
-
+
 /*
   local variables:
   mode: C++

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/plugins/experimental/ats_pagespeed/ats_base_fetch.cc
----------------------------------------------------------------------
diff --git a/plugins/experimental/ats_pagespeed/ats_base_fetch.cc b/plugins/experimental/ats_pagespeed/ats_base_fetch.cc
index 0d53252..87f2b61 100644
--- a/plugins/experimental/ats_pagespeed/ats_base_fetch.cc
+++ b/plugins/experimental/ats_pagespeed/ats_base_fetch.cc
@@ -104,7 +104,7 @@ void AtsBaseFetch::HandleHeadersComplete() {
 }
 
 void AtsBaseFetch::ForwardData(const StringPiece& sp, bool reenable, bool last) {
-  if (is_ipro_) { 
+  if (is_ipro_) {
     TSDebug("ats-speed", "ipro forwarddata: %.*s", (int)sp.size(), sp.data());
     buffer_.append(sp.data(), sp.size());
     return;
@@ -129,34 +129,34 @@ void AtsBaseFetch::ForwardData(const StringPiece& sp, bool reenable, bool last)
     if (last) {
       TSVIONBytesSet(downstream_vio_, downstream_length_);
     }
-    if (reenable) { 
+    if (reenable) {
       TSVIOReenable(downstream_vio_);
     }
   }
   Unlock();
 }
 
-void AtsBaseFetch::HandleDone(bool success) {  
+void AtsBaseFetch::HandleDone(bool success) {
   // When this is an IPRO lookup:
   // if we've got a 200 result, store the data and setup an intercept
-  // to write it out. 
+  // to write it out.
   // Regardless, re-enable the transaction at this point.
 
   //TODO(oschaaf): what about no success?
-  if (is_ipro_) { 
+  if (is_ipro_) {
     TSDebug("ats-speed", "ipro lookup base fetch done()");
     done_called_ = true;
 
     int status_code = response_headers()->status_code();
     bool status_ok = (status_code != 0) && (status_code < 400);
-    if (status_code == CacheUrlAsyncFetcher::kNotInCacheStatus) { 
+    if (status_code == CacheUrlAsyncFetcher::kNotInCacheStatus) {
       TSDebug("ats-speed", "ipro lookup base fetch -> not found in cache");
       ctx_->record_in_place = true;
       TSHttpTxnReenable(ctx_->txn, TS_EVENT_HTTP_CONTINUE);
       ctx_ = NULL;
       DecrefAndDeleteIfUnreferenced();
       return;
-    } else if (!status_ok) { 
+    } else if (!status_ok) {
       TSDebug("ats-speed", "ipro lookup base fetch -> ipro cache entry says not applicable");
       TSHttpTxnReenable(ctx_->txn, TS_EVENT_HTTP_CONTINUE);
       ctx_ = NULL;
@@ -178,7 +178,7 @@ void AtsBaseFetch::HandleDone(bool success) {
       TSHttpTxnReenable(txn, TS_EVENT_HTTP_CONTINUE);
       return;
     }
-    
+
     TSCont interceptCont = TSContCreate((int (*)(tsapi_cont*, TSEvent, void*))ipro_callback_, TSMutexCreate());
     InterceptCtx *intercept_ctx = new InterceptCtx();
     intercept_ctx->request_ctx = ctx;
@@ -187,7 +187,7 @@ void AtsBaseFetch::HandleDone(bool success) {
     copy_request_headers_to_psol(reqp, req_hdr_loc, intercept_ctx->request_headers);
     TSHandleMLocRelease(reqp, TS_NULL_MLOC, req_hdr_loc);
 
-    
+
     TSContDataSet(interceptCont, intercept_ctx);
     // TODO(oschaaf): when we serve an IPRO optimized asset, that will be handled
     // by the resource intercept. Which means we should set TXN_INDEX_OWNED_ARG to
@@ -209,7 +209,7 @@ void AtsBaseFetch::HandleDone(bool success) {
   Lock();
   done_called_ = true;
   ForwardData("", true, true);
-  
+
   DecrefAndDeleteIfUnreferenced();
   // TODO(oschaaf): we aren't safe to touch the associated mutex,
   // right? FIX.

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/plugins/experimental/ats_pagespeed/ats_base_fetch.h
----------------------------------------------------------------------
diff --git a/plugins/experimental/ats_pagespeed/ats_base_fetch.h b/plugins/experimental/ats_pagespeed/ats_base_fetch.h
index 96e49ed..e11628c 100644
--- a/plugins/experimental/ats_pagespeed/ats_base_fetch.h
+++ b/plugins/experimental/ats_pagespeed/ats_base_fetch.h
@@ -53,7 +53,7 @@ public:
                TSVIO downstream_vio,
                TSIOBuffer downstream_buffer,
                bool is_resource_fetch);
-  
+
   virtual ~AtsBaseFetch();
   void Release();
   void set_handle_error(bool x) { handle_error_ = x; }

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/plugins/experimental/ats_pagespeed/ats_beacon_intercept.cc
----------------------------------------------------------------------
diff --git a/plugins/experimental/ats_pagespeed/ats_beacon_intercept.cc b/plugins/experimental/ats_pagespeed/ats_beacon_intercept.cc
index 88cf016..4a1141f 100644
--- a/plugins/experimental/ats_pagespeed/ats_beacon_intercept.cc
+++ b/plugins/experimental/ats_pagespeed/ats_beacon_intercept.cc
@@ -68,7 +68,7 @@ struct InterceptCtx {
   bool req_hdr_parsed;
   bool initialized;
   TransformCtx* request_context;
-  InterceptCtx(TSCont cont) 
+  InterceptCtx(TSCont cont)
     : net_vc(0), contp(cont), input(), output(), body(""), req_content_len(0), req_hdr_bufp(0), req_hdr_loc(0),
       req_hdr_parsed(false), initialized(false) {
     http_parser = TSHttpParserCreate();
@@ -80,7 +80,7 @@ struct InterceptCtx {
 
   ~InterceptCtx() {
     TSDebug(DEBUG_TAG, "[%s] Destroying continuation data", __FUNCTION__);
-    TSHttpParserDestroy(http_parser); 
+    TSHttpParserDestroy(http_parser);
     if (req_hdr_loc) {
       TSHandleMLocRelease(req_hdr_bufp, TS_NULL_MLOC, req_hdr_loc);
     }
@@ -101,7 +101,7 @@ InterceptCtx::init(TSVConn vconn)
     TSError("[%s] InterceptCtx already initialized!", __FUNCTION__);
     return false;
   }
-  
+
   net_vc = vconn;
 
   input.buffer = TSIOBufferCreate();
@@ -143,7 +143,7 @@ handleRead(InterceptCtx *cont_data, bool &read_complete) {
     TSError("[%s] Error while getting number of bytes available", __FUNCTION__);
     return false;
   }
-  
+
   TSDebug(DEBUG_TAG, "[%s] Parsed header, avail: %d", __FUNCTION__, avail);
 
   int consumed = 0;
@@ -160,7 +160,7 @@ handleRead(InterceptCtx *cont_data, bool &read_complete) {
           TSDebug(DEBUG_TAG, "[%s] Parsed header", __FUNCTION__);
           TSMLoc content_len_loc = TSMimeHdrFieldFind(cont_data->req_hdr_bufp, cont_data->req_hdr_loc,
                                                         TS_MIME_FIELD_CONTENT_LENGTH, -1);
-          
+
           /*if (!content_len_loc) {
             TSError("[%s] Error while searching content length header [%s]",
                      __FUNCTION__, TS_MIME_FIELD_CONTENT_LENGTH);
@@ -197,11 +197,11 @@ handleRead(InterceptCtx *cont_data, bool &read_complete) {
       block = TSIOBufferBlockNext(block);
     }
   }
-  
+
   TSIOBufferReaderConsume(cont_data->input.reader, consumed);
 
   TSDebug(DEBUG_TAG, "[%s] Consumed %d bytes from input vio, avail: %d", __FUNCTION__, consumed, avail);
-  
+
   // Modify the input VIO to reflect how much data we've completed.
   TSVIONDoneSet(cont_data->input.vio, TSVIONDoneGet(cont_data->input.vio) + consumed);
 
@@ -221,7 +221,7 @@ static bool
 processRequest(InterceptCtx *cont_data) {
   // OS: Looks like on 5.x we sometimes receive read complete / EOS events twice,
   // which needs looking into. Probably this intercept is doing something it shouldn't
-  if (cont_data->output.buffer) { 
+  if (cont_data->output.buffer) {
     TSDebug("ats_pagespeed", "Received read complete / EOS twice?!");
     return true;
   }
@@ -241,19 +241,19 @@ processRequest(InterceptCtx *cont_data) {
 
   StringPiece query_param_beacon_data;
   ps_query_params_handler(cont_data->request_context->url_string->c_str(), &query_param_beacon_data);
-  
+
   GoogleString beacon_data = net_instaweb::StrCat(
       query_param_beacon_data, "&", cont_data->body);
   ServerContext* server_context = cont_data->request_context->server_context;
-  
-  SystemRequestContext* system_request_context = 
+
+  SystemRequestContext* system_request_context =
       new SystemRequestContext(server_context->thread_system()->NewMutex(),
                                server_context->timer(),
 			       // TODO(oschaaf): determine these for real.
 			       "www.foo.com",
                                80,
                                "127.0.0.1");
-  
+
   if (!server_context->HandleBeacon(
           beacon_data,
             cont_data->request_context->user_agent->c_str(),
@@ -262,7 +262,7 @@ processRequest(InterceptCtx *cont_data) {
   } else {
     TSDebug(DEBUG_TAG,  "Beacon post data processed OK: [%s]", beacon_data.c_str());
   }
-  
+
   cont_data->setupWrite();
   if (TSIOBufferWrite(cont_data->output.buffer, reply_header.data(), reply_header.size()) == TS_ERROR) {
     TSError("[%s] Error while writing reply header", __FUNCTION__);
@@ -276,7 +276,7 @@ processRequest(InterceptCtx *cont_data) {
   int total_bytes_written = reply_header.size() + body_size;
   TSDebug(DEBUG_TAG, "[%s] Wrote reply of size %d", __FUNCTION__, total_bytes_written);
   TSVIONBytesSet(cont_data->output.vio, total_bytes_written);
-  
+
   TSVIOReenable(cont_data->output.vio);
   return true;
 }
@@ -320,7 +320,7 @@ txn_intercept(TSCont contp, TSEvent event, void *edata) {
     break;
   case TS_EVENT_ERROR:
     // todo: do some error handling here
-    TSDebug(DEBUG_TAG, "[%s] Received error event; going to shutdown, event: %d", __FUNCTION__, event);    
+    TSDebug(DEBUG_TAG, "[%s] Received error event; going to shutdown, event: %d", __FUNCTION__, event);
     TSError("[%s] Received error event; going to shutdown, event: %d", __FUNCTION__, event);
     shutdown = true;
     break;
@@ -343,7 +343,7 @@ txn_intercept(TSCont contp, TSEvent event, void *edata) {
     }
     delete cont_data;
     TSContDestroy(contp);
-  } 
+  }
 
   return 1;
 }

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/plugins/experimental/ats_pagespeed/ats_config.cc
----------------------------------------------------------------------
diff --git a/plugins/experimental/ats_pagespeed/ats_config.cc b/plugins/experimental/ats_pagespeed/ats_config.cc
index e0adf42..f72c3db 100644
--- a/plugins/experimental/ats_pagespeed/ats_config.cc
+++ b/plugins/experimental/ats_pagespeed/ats_config.cc
@@ -167,7 +167,7 @@ bool AtsConfig::Parse(const char * path ) {
     if (line[0] == '#') {
       continue;
     }
-    
+
     vector<string> v = tokenize( line, isspace );
     if (v.size() == 0)
       continue;

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/plugins/experimental/ats_pagespeed/ats_config.h
----------------------------------------------------------------------
diff --git a/plugins/experimental/ats_pagespeed/ats_config.h b/plugins/experimental/ats_pagespeed/ats_config.h
index d3b0e40..ca03993 100644
--- a/plugins/experimental/ats_pagespeed/ats_config.h
+++ b/plugins/experimental/ats_pagespeed/ats_config.h
@@ -64,7 +64,7 @@ class AtsConfig {
 public:
   explicit AtsConfig(AtsThreadSystem* thread_system);
   virtual ~AtsConfig();
-  
+
   // TODO(oschaaf): destructor??
   bool Parse(const char * path);
   AtsHostConfig * Find(const char * host, int host_length);

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/plugins/experimental/ats_pagespeed/ats_header_utils.cc
----------------------------------------------------------------------
diff --git a/plugins/experimental/ats_pagespeed/ats_header_utils.cc b/plugins/experimental/ats_pagespeed/ats_header_utils.cc
index a61c784..c7b5165 100644
--- a/plugins/experimental/ats_pagespeed/ats_header_utils.cc
+++ b/plugins/experimental/ats_pagespeed/ats_header_utils.cc
@@ -79,7 +79,7 @@ void set_header(TSMBuffer bufp, TSMLoc hdr_loc, const char * header_name, const
 
   if (field_loc) {
     TSMimeHdrFieldValueStringSet(bufp, hdr_loc, field_loc, -1, header_value, -1);
-  } else {    
+  } else {
     if ( TSMimeHdrFieldCreate(bufp, hdr_loc, &field_loc) == TS_SUCCESS ) {
       TSMimeHdrFieldNameSet(bufp, hdr_loc, field_loc, header_name, -1);
       TSMimeHdrFieldAppend(bufp, hdr_loc, field_loc);

http://git-wip-us.apache.org/repos/asf/trafficserver/blob/ab5ba9a8/plugins/experimental/ats_pagespeed/ats_message_handler.cc
----------------------------------------------------------------------
diff --git a/plugins/experimental/ats_pagespeed/ats_message_handler.cc b/plugins/experimental/ats_pagespeed/ats_message_handler.cc
index 370f317..15811bc 100644
--- a/plugins/experimental/ats_pagespeed/ats_message_handler.cc
+++ b/plugins/experimental/ats_pagespeed/ats_message_handler.cc
@@ -33,7 +33,7 @@
 #include "net/instaweb/public/version.h"
 #include "pagespeed/kernel/base/posix_timer.h"
 #include "pagespeed/kernel/base/time_util.h"
-   
+
 
 namespace {
 
@@ -67,10 +67,10 @@ void AtsMessageHandler::set_buffer(SharedCircularBuffer* buff) {
 void AtsMessageHandler::MessageVImpl(MessageType type, const char* msg,
                                      va_list args) {
   GoogleString formatted_message = Format(msg, args);
-  
+
   TSDebug("ats-speed", "[%s %s] %s", kModuleName, kModPagespeedVersion,
           formatted_message.c_str());
- 
+
   // Prepare a log message for the SharedCircularBuffer only.
   // Prepend time and severity to message.
   // Format is [time] [severity] [pid] message.
@@ -80,7 +80,7 @@ void AtsMessageHandler::MessageVImpl(MessageType type, const char* msg,
   if (!ConvertTimeToString(timer.NowMs(), &time)) {
     time = "?";
   }
-  
+
   StrAppend(&message, "[", time, "] ",
             "[", MessageTypeToString(type), "] ");
   StrAppend(&message, pid_string_, " ", formatted_message, "\n");


Mime
View raw message