libwebp: update snapshot to v0.3.0-rc6

third_party/libwebp/enc/tree.c

 // Copyright 2011 Google Inc. All Rights Reserved.
 //
 // This code is licensed under the same terms as WebM:
 //  Software License Agreement:  http://www.webmproject.org/license/software/
 //  Additional IP Rights Grant:  http://www.webmproject.org/license/additional/
 // -----------------------------------------------------------------------------
 //
 // Token probabilities
 //
 // Author: Skal (pascal.massimino@gmail.com)
@@ skipping 140 matching lines @@
     },
     { { 1, 1, 255, 128, 128, 128, 128, 128, 128, 128, 128 },
       { 244, 1, 255, 128, 128, 128, 128, 128, 128, 128, 128 },
       { 238, 1, 255, 128, 128, 128, 128, 128, 128, 128, 128 }
     }
   }
 };
 
 void VP8DefaultProbas(VP8Encoder* const enc) {
   VP8Proba* const probas = &enc->proba_;
+  probas->use_skip_proba_ = 0;
   memset(probas->segments_, 255u, sizeof(probas->segments_));
   memcpy(probas->coeffs_, VP8CoeffsProba0, sizeof(VP8CoeffsProba0));
-  probas->use_skip_proba_ = 0;
+  // Note: we could hard-code the level_costs_ corresponding to VP8CoeffsProba0,
+  // but that's ~11k of static data. Better call VP8CalculateLevelCosts() later.
+  probas->dirty_ = 1;
 }
 
 // Paragraph 11.5.  900bytes.
 static const uint8_t kBModesProba[NUM_BMODES][NUM_BMODES][NUM_BMODES - 1] = {
   { { 231, 120, 48, 89, 115, 113, 120, 152, 112 },
     { 152, 179, 64, 126, 170, 118, 46, 70, 95 },
     { 175, 69, 143, 80, 85, 82, 72, 155, 103 },
     { 56, 58, 10, 171, 218, 189, 17, 13, 152 },
     { 114, 26, 17, 163, 44, 195, 21, 10, 173 },
     { 121, 24, 80, 195, 26, 62, 44, 64, 85 },
@@ skipping 324 matching lines @@
     }
   }
   if (VP8PutBitUniform(bw, probas->use_skip_proba_)) {
     VP8PutValue(bw, probas->skip_proba_, 8);
   }
 }
 
 #if defined(__cplusplus) || defined(c_plusplus)
 }    // extern "C"
 #endif