source: SHVCSoftware/branches/SHM-1.1-dev/source/Lib/TLibCommon/TComPicYuvMD5.cpp @ 1438

Last change on this file since 1438 was 2, checked in by seregin, 12 years ago

Initial import by Vadim Seregin <vseregin@…>

File size: 7.2 KB
Line 
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 */
44template<unsigned OUTPUT_BITDEPTH_DIV8>
45static 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 */
65template<unsigned OUTPUT_BITDEPTH_DIV8>
66static 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
86void compCRC(const Pel* plane, unsigned int width, unsigned int height, unsigned int stride, unsigned char digest[16])
87{
88  unsigned int bitdepth = g_uiBitDepth + g_uiBitIncrement;
89  unsigned int dataMsbIdx = bitdepth - 1;
90  unsigned int crcMsb;
91  unsigned int bitVal;
92  unsigned int crcVal = 0xffff;
93  unsigned int bitIdx;
94  for (unsigned y = 0; y < height; y++)
95  {
96    for (unsigned x = 0; x < width; x++)
97    {     
98      for(bitIdx=0; bitIdx<bitdepth; bitIdx++)
99      {
100        crcMsb = (crcVal >> 15) & 1;
101        bitVal = (plane[y*stride+x]>> (dataMsbIdx - (bitIdx&dataMsbIdx))) & 1;
102        crcVal = (((crcVal << 1) + bitVal) & 0xffff) ^ (crcMsb * 0x1021);
103      }
104    }
105  }
106  for(bitIdx=0; bitIdx<16; bitIdx++)
107  {
108    crcMsb = (crcVal >> 15) & 1;
109    crcVal = ((crcVal << 1) & 0xffff) ^ (crcMsb * 0x1021);
110  }
111
112  digest[0] = (crcVal>>8)  & 0xff;
113  digest[1] =  crcVal      & 0xff;
114}
115
116void calcCRC(TComPicYuv& pic, unsigned char digest[3][16])
117{
118  unsigned width = pic.getWidth();
119  unsigned height = pic.getHeight();
120  unsigned stride = pic.getStride();
121
122  compCRC(pic.getLumaAddr(), width, height, stride, digest[0]);
123
124  width >>= 1;
125  height >>= 1;
126  stride >>= 1;
127
128  compCRC(pic.getCbAddr(), width, height, stride, digest[1]);
129  compCRC(pic.getCrAddr(), width, height, stride, digest[2]);
130}
131
132void compChecksum(const Pel* plane, unsigned int width, unsigned int height, unsigned int stride, unsigned char digest[16])
133{
134  unsigned int bitdepth = g_uiBitDepth + g_uiBitIncrement;
135
136  unsigned int checksum = 0;
137  unsigned char xor_mask;
138
139  for (unsigned y = 0; y < height; y++)
140  {
141    for (unsigned x = 0; x < width; x++)
142    {
143      xor_mask = (x & 0xff) ^ (y & 0xff) ^ (x >> 8) ^ (y >> 8);
144      checksum = (checksum + ((plane[y*stride+x] & 0xff) ^ xor_mask)) & 0xffffffff;
145
146      if(bitdepth > 8)
147      {
148        checksum = (checksum + ((plane[y*stride+x]>>8) ^ xor_mask)) & 0xffffffff;
149      }
150    }
151  }
152
153  digest[0] = (checksum>>24) & 0xff;
154  digest[1] = (checksum>>16) & 0xff;
155  digest[2] = (checksum>>8)  & 0xff;
156  digest[3] =  checksum      & 0xff;
157}
158
159void calcChecksum(TComPicYuv& pic, unsigned char digest[3][16])
160{
161  unsigned width = pic.getWidth();
162  unsigned height = pic.getHeight();
163  unsigned stride = pic.getStride();
164
165  compChecksum(pic.getLumaAddr(), width, height, stride, digest[0]);
166
167  width >>= 1;
168  height >>= 1;
169  stride >>= 1;
170
171  compChecksum(pic.getCbAddr(), width, height, stride, digest[1]);
172  compChecksum(pic.getCrAddr(), width, height, stride, digest[2]);
173}
174/**
175 * Calculate the MD5sum of pic, storing the result in digest.
176 * MD5 calculation is performed on Y' then Cb, then Cr; each in raster order.
177 * Pel data is inserted into the MD5 function in little-endian byte order,
178 * using sufficient bytes to represent the picture bitdepth.  Eg, 10bit data
179 * uses little-endian two byte words; 8bit data uses single byte words.
180 */
181void calcMD5(TComPicYuv& pic, unsigned char digest[3][16])
182{
183  unsigned bitdepth = g_uiBitDepth + g_uiBitIncrement;
184  /* choose an md5_plane packing function based on the system bitdepth */
185  typedef void (*MD5PlaneFunc)(MD5&, const Pel*, unsigned, unsigned, unsigned);
186  MD5PlaneFunc md5_plane_func;
187  md5_plane_func = bitdepth <= 8 ? (MD5PlaneFunc)md5_plane<1> : (MD5PlaneFunc)md5_plane<2>;
188
189  MD5 md5Y, md5U, md5V;
190  unsigned width = pic.getWidth();
191  unsigned height = pic.getHeight();
192  unsigned stride = pic.getStride();
193
194  md5_plane_func(md5Y, pic.getLumaAddr(), width, height, stride);
195  md5Y.finalize(digest[0]);
196
197  width >>= 1;
198  height >>= 1;
199  stride >>= 1;
200
201  md5_plane_func(md5U, pic.getCbAddr(), width, height, stride);
202  md5U.finalize(digest[1]);
203
204  md5_plane_func(md5V, pic.getCrAddr(), width, height, stride);
205  md5V.finalize(digest[2]);
206}
207//! \}
Note: See TracBrowser for help on using the repository browser.