libwebp: update to 0.4.2-rc2

third_party/libwebp/utils/quant_levels_dec.c

 // Copyright 2013 Google Inc. All Rights Reserved.
 //
 // Use of this source code is governed by a BSD-style license
 // that can be found in the COPYING file in the root of the source
 // tree. An additional intellectual property rights grant can be found
 // in the file PATENTS. All contributing project authors may
 // be found in the AUTHORS file in the root of the source tree.
 // -----------------------------------------------------------------------------
 //
 // Implement gradient smoothing: we replace a current alpha value by its
@@ skipping 14 matching lines @@
 #define FIX 16     // fix-point precision for averaging
 #define LFIX 2     // extra precision for look-up table
 #define LUT_SIZE ((1 << (8 + LFIX)) - 1)  // look-up table size
 
 #if defined(USE_DITHERING)
 
 #define DFIX 4           // extra precision for ordered dithering
 #define DSIZE 4          // dithering size (must be a power of two)
 // cf. http://en.wikipedia.org/wiki/Ordered_dithering
 static const uint8_t kOrderedDither[DSIZE][DSIZE] = {
- {  0,  8,  2, 10 },     // coefficients are in DFIX fixed-point precision
- { 12,  4, 14,  6 },
- {  3, 11,  1,  9 },
- { 15,  7, 13,  5 }
+  {  0,  8,  2, 10 },     // coefficients are in DFIX fixed-point precision
+  { 12,  4, 14,  6 },
+  {  3, 11,  1,  9 },
+  { 15,  7, 13,  5 }
 };
 
 #else
 #define DFIX 0
 #endif
 
 typedef struct {
   int width_, height_;  // dimension
   int row_;             // current input row being processed
   uint8_t* src_;        // input pointer
@@ skipping 221 matching lines @@
         if (p.row_ >= p.radius_) {
           HFilter(&p);
           ApplyFilter(&p);
         }
       }
     }
     CleanupParams(&p);
   }
   return 1;
 }