| 1 | /* The copyright in this software is being made available under the BSD |
|---|
| 2 | * License, included below. This software may be subject to other third party |
|---|
| 3 | * and contributor rights, including patent rights, and no such rights are |
|---|
| 4 | * granted under this license. |
|---|
| 5 | * |
|---|
| 6 | * Copyright (c) 2010-2012, ITU/ISO/IEC |
|---|
| 7 | * All rights reserved. |
|---|
| 8 | * |
|---|
| 9 | * Redistribution and use in source and binary forms, with or without |
|---|
| 10 | * modification, are permitted provided that the following conditions are met: |
|---|
| 11 | * |
|---|
| 12 | * * Redistributions of source code must retain the above copyright notice, |
|---|
| 13 | * this list of conditions and the following disclaimer. |
|---|
| 14 | * * Redistributions in binary form must reproduce the above copyright notice, |
|---|
| 15 | * this list of conditions and the following disclaimer in the documentation |
|---|
| 16 | * and/or other materials provided with the distribution. |
|---|
| 17 | * * Neither the name of the ITU/ISO/IEC nor the names of its contributors may |
|---|
| 18 | * be used to endorse or promote products derived from this software without |
|---|
| 19 | * specific prior written permission. |
|---|
| 20 | * |
|---|
| 21 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|---|
| 22 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|---|
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|---|
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS |
|---|
| 25 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|---|
| 26 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|---|
| 27 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|---|
| 28 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|---|
| 29 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|---|
| 30 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
|---|
| 31 | * THE POSSIBILITY OF SUCH DAMAGE. |
|---|
| 32 | */ |
|---|
| 33 | |
|---|
| 34 | #include "TComPicYuv.h" |
|---|
| 35 | #include "libmd5/MD5.h" |
|---|
| 36 | |
|---|
| 37 | //! \ingroup TLibCommon |
|---|
| 38 | //! \{ |
|---|
| 39 | |
|---|
| 40 | /** |
|---|
| 41 | * Update md5 using n samples from plane, each sample is adjusted to |
|---|
| 42 | * OUTBIT_BITDEPTH_DIV8. |
|---|
| 43 | */ |
|---|
| 44 | template<unsigned OUTPUT_BITDEPTH_DIV8> |
|---|
| 45 | static void md5_block(MD5& md5, const Pel* plane, unsigned n) |
|---|
| 46 | { |
|---|
| 47 | /* create a 64 byte buffer for packing Pel's into */ |
|---|
| 48 | unsigned char buf[64/OUTPUT_BITDEPTH_DIV8][OUTPUT_BITDEPTH_DIV8]; |
|---|
| 49 | for (unsigned i = 0; i < n; i++) |
|---|
| 50 | { |
|---|
| 51 | Pel pel = plane[i]; |
|---|
| 52 | /* perform bitdepth and endian conversion */ |
|---|
| 53 | for (unsigned d = 0; d < OUTPUT_BITDEPTH_DIV8; d++) |
|---|
| 54 | { |
|---|
| 55 | buf[i][d] = pel >> (d*8); |
|---|
| 56 | } |
|---|
| 57 | } |
|---|
| 58 | md5.update((unsigned char*)buf, n * OUTPUT_BITDEPTH_DIV8); |
|---|
| 59 | } |
|---|
| 60 | |
|---|
| 61 | /** |
|---|
| 62 | * Update md5 with all samples in plane in raster order, each sample |
|---|
| 63 | * is adjusted to OUTBIT_BITDEPTH_DIV8. |
|---|
| 64 | */ |
|---|
| 65 | template<unsigned OUTPUT_BITDEPTH_DIV8> |
|---|
| 66 | static void md5_plane(MD5& md5, const Pel* plane, unsigned width, unsigned height, unsigned stride) |
|---|
| 67 | { |
|---|
| 68 | /* N is the number of samples to process per md5 update. |
|---|
| 69 | * All N samples must fit in buf */ |
|---|
| 70 | unsigned N = 32; |
|---|
| 71 | unsigned width_modN = width % N; |
|---|
| 72 | unsigned width_less_modN = width - width_modN; |
|---|
| 73 | |
|---|
| 74 | for (unsigned y = 0; y < height; y++) |
|---|
| 75 | { |
|---|
| 76 | /* convert pel's into unsigned chars in little endian byte order. |
|---|
| 77 | * NB, for 8bit data, data is truncated to 8bits. */ |
|---|
| 78 | for (unsigned x = 0; x < width_less_modN; x += N) |
|---|
| 79 | md5_block<OUTPUT_BITDEPTH_DIV8>(md5, &plane[y*stride + x], N); |
|---|
| 80 | |
|---|
| 81 | /* mop up any of the remaining line */ |
|---|
| 82 | md5_block<OUTPUT_BITDEPTH_DIV8>(md5, &plane[y*stride + width_less_modN], width_modN); |
|---|
| 83 | } |
|---|
| 84 | } |
|---|
| 85 | |
|---|
| 86 | /** |
|---|
| 87 | * Calculate the MD5sum of pic, storing the result in digest. |
|---|
| 88 | * MD5 calculation is performed on Y' then Cb, then Cr; each in raster order. |
|---|
| 89 | * Pel data is inserted into the MD5 function in little-endian byte order, |
|---|
| 90 | * using sufficient bytes to represent the picture bitdepth. Eg, 10bit data |
|---|
| 91 | * uses little-endian two byte words; 8bit data uses single byte words. |
|---|
| 92 | */ |
|---|
| 93 | void calcMD5(TComPicYuv& pic, unsigned char digest[16]) |
|---|
| 94 | { |
|---|
| 95 | unsigned bitdepth = g_uiBitDepth + g_uiBitIncrement; |
|---|
| 96 | /* choose an md5_plane packing function based on the system bitdepth */ |
|---|
| 97 | typedef void (*MD5PlaneFunc)(MD5&, const Pel*, unsigned, unsigned, unsigned); |
|---|
| 98 | MD5PlaneFunc md5_plane_func; |
|---|
| 99 | md5_plane_func = bitdepth <= 8 ? (MD5PlaneFunc)md5_plane<1> : (MD5PlaneFunc)md5_plane<2>; |
|---|
| 100 | |
|---|
| 101 | MD5 md5; |
|---|
| 102 | unsigned width = pic.getWidth(); |
|---|
| 103 | unsigned height = pic.getHeight(); |
|---|
| 104 | unsigned stride = pic.getStride(); |
|---|
| 105 | |
|---|
| 106 | md5_plane_func(md5, pic.getLumaAddr(), width, height, stride); |
|---|
| 107 | |
|---|
| 108 | width >>= 1; |
|---|
| 109 | height >>= 1; |
|---|
| 110 | stride >>= 1; |
|---|
| 111 | |
|---|
| 112 | md5_plane_func(md5, pic.getCbAddr(), width, height, stride); |
|---|
| 113 | md5_plane_func(md5, pic.getCrAddr(), width, height, stride); |
|---|
| 114 | |
|---|
| 115 | md5.finalize(digest); |
|---|
| 116 | } |
|---|
| 117 | //! \} |
|---|