| OLD | NEW |
| 1 // Copyright 2011 Google Inc. All Rights Reserved. | 1 // Copyright 2013 Google Inc. All Rights Reserved. |
| 2 // | 2 // |
| 3 // This code is licensed under the same terms as WebM: | 3 // This code is licensed under the same terms as WebM: |
| 4 // Software License Agreement: http://www.webmproject.org/license/software/ | 4 // Software License Agreement: http://www.webmproject.org/license/software/ |
| 5 // Additional IP Rights Grant: http://www.webmproject.org/license/additional/ | 5 // Additional IP Rights Grant: http://www.webmproject.org/license/additional/ |
| 6 // ----------------------------------------------------------------------------- | 6 // ----------------------------------------------------------------------------- |
| 7 // | 7 // |
| 8 // Enhancement layer (for YUV444/422) | 8 // TODO(skal): implement gradient smoothing. |
| 9 // | 9 // |
| 10 // Author: Skal (pascal.massimino@gmail.com) | 10 // Author: Skal (pascal.massimino@gmail.com) |
| 11 | 11 |
| 12 #include <assert.h> | 12 #include "./quant_levels_dec.h" |
| 13 #include <stdlib.h> | |
| 14 | |
| 15 #include "./vp8i.h" | |
| 16 | 13 |
| 17 #if defined(__cplusplus) || defined(c_plusplus) | 14 #if defined(__cplusplus) || defined(c_plusplus) |
| 18 extern "C" { | 15 extern "C" { |
| 19 #endif | 16 #endif |
| 20 | 17 |
| 21 //------------------------------------------------------------------------------ | 18 int DequantizeLevels(uint8_t* const data, int width, int height) { |
| 22 | 19 if (data == NULL || width <= 0 || height <= 0) return 0; |
| 23 int VP8DecodeLayer(VP8Decoder* const dec) { | 20 (void)data; |
| 24 assert(dec); | 21 (void)width; |
| 25 assert(dec->layer_data_size_ > 0); | 22 (void)height; |
| 26 (void)dec; | |
| 27 | |
| 28 // TODO: handle enhancement layer here. | |
| 29 | |
| 30 return 1; | 23 return 1; |
| 31 } | 24 } |
| 32 | 25 |
| 33 #if defined(__cplusplus) || defined(c_plusplus) | 26 #if defined(__cplusplus) || defined(c_plusplus) |
| 34 } // extern "C" | 27 } // extern "C" |
| 35 #endif | 28 #endif |
| OLD | NEW |