Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 | 1 |
| 2 /* | 2 /* |
| 3 * Copyright 2012 Google Inc. | 3 * Copyright 2012 Google Inc. |
| 4 * | 4 * |
| 5 * Use of this source code is governed by a BSD-style license that can be | 5 * Use of this source code is governed by a BSD-style license that can be |
| 6 * found in the LICENSE file. | 6 * found in the LICENSE file. |
| 7 */ | 7 */ |
| 8 | 8 |
| 9 #include "SkBitmap.h" | 9 #include "SkBitmap.h" |
| 10 #include "SkBitmapHasher.h" | 10 #include "SkBitmapHasher.h" |
| 11 #include "SkBitmapTransformer.h" | 11 #include "SkBitmapTransformer.h" |
| 12 #include "SkCityHash.h" | 12 #include "SkCityHash.h" |
| 13 #include "SkEndian.h" | 13 #include "SkEndian.h" |
| 14 #include "SkMD5.h" | |
| 14 | 15 |
| 15 /** | 16 /** |
| 16 * Write an integer value into a bytebuffer in little-endian order. | 17 * Write an int32_t value into a bytebuffer in little-endian order. |
| 17 */ | 18 */ |
| 18 static void write_int_to_buffer(int val, char* buf) { | 19 static void write_int32_to_buffer(int32_t val, char* buf) { |
| 19 val = SkEndian_SwapLE32(val); | |
| 20 for (int byte=0; byte<4; byte++) { | 20 for (int byte=0; byte<4; byte++) { |
| 21 *buf++ = (char)(val & 0xff); | 21 *buf++ = (char)(val & 0xff); |
| 22 val = val >> 8; | 22 val = val >> 8; |
| 23 } | 23 } |
| 24 } | 24 } |
| 25 | 25 |
| 26 /*static*/ bool SkBitmapHasher::ComputeDigestInternal( | 26 /*static*/ bool SkBitmapHasher::ComputeDigestInternal( |
| 27 const SkBitmap& bitmap, const SkBitmapTransformer& transformer, SkHashDi gest *result) { | 27 const SkBitmap& bitmap, const SkBitmapTransformer& transformer, BITMAP_H ASH_TYPE *result) { |
| 28 size_t pixelBufferSize = transformer.bytesNeededTotal(); | 28 size_t pixelBufferSize = transformer.bytesNeededTotal(); |
| 29 size_t totalBufferSize = pixelBufferSize + 8; // leave room for x/y dimensio ns | 29 size_t totalBufferSize = pixelBufferSize + 8; // leave room for x/y dimensio ns |
| 30 | 30 |
| 31 SkAutoMalloc bufferManager(totalBufferSize); | 31 SkAutoMalloc bufferManager(totalBufferSize); |
| 32 char *bufferStart = static_cast<char *>(bufferManager.get()); | 32 char *bufferStart = static_cast<char *>(bufferManager.get()); |
| 33 char *bufPtr = bufferStart; | 33 char *bufPtr = bufferStart; |
| 34 // start with the x/y dimensions | 34 // start with the x/y dimensions |
| 35 write_int_to_buffer(bitmap.width(), bufPtr); | 35 write_int32_to_buffer(bitmap.width(), bufPtr); |
| 36 bufPtr += 4; | 36 bufPtr += 4; |
| 37 write_int_to_buffer(bitmap.height(), bufPtr); | 37 write_int32_to_buffer(bitmap.height(), bufPtr); |
| 38 bufPtr += 4; | 38 bufPtr += 4; |
| 39 | 39 |
| 40 // add all the pixel data | 40 // add all the pixel data |
| 41 // EPOGER: if we are using our MD5 or SHA1 implementations, we can add this | |
| 42 // data to the hash algorithm in-place (without the big memcpy). | |
| 43 // Add that optimization! | |
| 41 if (!transformer.copyBitmapToPixelBuffer(bufPtr, pixelBufferSize)) { | 44 if (!transformer.copyBitmapToPixelBuffer(bufPtr, pixelBufferSize)) { |
| 42 return false; | 45 return false; |
| 43 } | 46 } |
| 47 #ifdef BITMAP_HASH_TYPE_SkHashDigest | |
| 48 SkMD5 hasher; | |
|
epoger
2013/04/18 17:45:48
Here's what I like so much about the SkHashDigest
| |
| 49 hasher.update(reinterpret_cast<const uint8_t*>(bufferStart), totalBufferSize ); | |
| 50 hasher.finish(*result); | |
| 51 #else | |
| 44 *result = SkCityHash::Compute64(bufferStart, totalBufferSize); | 52 *result = SkCityHash::Compute64(bufferStart, totalBufferSize); |
| 53 #endif | |
| 45 return true; | 54 return true; |
| 46 } | 55 } |
| 47 | 56 |
| 48 /*static*/ bool SkBitmapHasher::ComputeDigest(const SkBitmap& bitmap, SkHashDige st *result) { | 57 /*static*/ bool SkBitmapHasher::ComputeDigest(const SkBitmap& bitmap, BITMAP_HAS H_TYPE *result) { |
| 49 const SkBitmapTransformer::PixelFormat kPixelFormat = | 58 const SkBitmapTransformer::PixelFormat kPixelFormat = |
| 50 SkBitmapTransformer::kARGB_8888_Premul_PixelFormat; | 59 SkBitmapTransformer::kARGB_8888_Premul_PixelFormat; |
| 51 | 60 |
| 52 // First, try to transform the existing bitmap. | 61 // First, try to transform the existing bitmap. |
| 53 const SkBitmapTransformer transformer = | 62 const SkBitmapTransformer transformer = |
| 54 SkBitmapTransformer(bitmap, kPixelFormat); | 63 SkBitmapTransformer(bitmap, kPixelFormat); |
| 55 if (transformer.isValid(false)) { | 64 if (transformer.isValid(false)) { |
| 56 return ComputeDigestInternal(bitmap, transformer, result); | 65 return ComputeDigestInternal(bitmap, transformer, result); |
| 57 } | 66 } |
| 58 | 67 |
| 59 // Hmm, that didn't work. Maybe if we create a new | 68 // Hmm, that didn't work. Maybe if we create a new |
| 60 // kARGB_8888_Config version of the bitmap it will work better? | 69 // kARGB_8888_Config version of the bitmap it will work better? |
| 61 SkBitmap copyBitmap; | 70 SkBitmap copyBitmap; |
| 62 bitmap.copyTo(©Bitmap, SkBitmap::kARGB_8888_Config); | 71 bitmap.copyTo(©Bitmap, SkBitmap::kARGB_8888_Config); |
| 63 const SkBitmapTransformer copyTransformer = | 72 const SkBitmapTransformer copyTransformer = |
| 64 SkBitmapTransformer(copyBitmap, kPixelFormat); | 73 SkBitmapTransformer(copyBitmap, kPixelFormat); |
| 65 if (copyTransformer.isValid(true)) { | 74 if (copyTransformer.isValid(true)) { |
| 66 return ComputeDigestInternal(copyBitmap, copyTransformer, result); | 75 return ComputeDigestInternal(copyBitmap, copyTransformer, result); |
| 67 } else { | 76 } else { |
| 68 return false; | 77 return false; |
| 69 } | 78 } |
| 70 } | 79 } |
| OLD | NEW |