FFmpeg
ripemd.c
Go to the documentation of this file.
1 /*
2  * Copyright (C) 2007 Michael Niedermayer <michaelni@gmx.at>
3  * Copyright (C) 2013 James Almer
4  *
5  * This file is part of FFmpeg.
6  *
7  * FFmpeg is free software; you can redistribute it and/or
8  * modify it under the terms of the GNU Lesser General Public
9  * License as published by the Free Software Foundation; either
10  * version 2.1 of the License, or (at your option) any later version.
11  *
12  * FFmpeg is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15  * Lesser General Public License for more details.
16  *
17  * You should have received a copy of the GNU Lesser General Public
18  * License along with FFmpeg; if not, write to the Free Software
19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  */
21 
22 #include <string.h>
23 
24 #include "attributes.h"
25 #include "avutil.h"
26 #include "bswap.h"
27 #include "intreadwrite.h"
28 #include "ripemd.h"
29 #include "mem.h"
30 
31 /** hash context */
32 typedef struct AVRIPEMD {
33  uint8_t digest_len; ///< digest length in 32-bit words
34  uint64_t count; ///< number of bytes in buffer
35  uint8_t buffer[64]; ///< 512-bit buffer of input values used in hash updating
36  uint32_t state[10]; ///< current hash value
37  /** function used to update hash for 512-bit input block */
38  void (*transform)(uint32_t *state, const uint8_t buffer[64]);
39 } AVRIPEMD;
40 
41 const int av_ripemd_size = sizeof(AVRIPEMD);
42 
44 {
45  return av_mallocz(sizeof(struct AVRIPEMD));
46 }
47 
48 static const uint32_t KA[4] = {
49  0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e
50 };
51 
52 static const uint32_t KB[4] = {
53  0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9
54 };
55 
56 static const int ROTA[80] = {
57  11, 14, 15, 12, 5, 8, 7 , 9, 11, 13, 14, 15, 6, 7, 9, 8,
58  7 , 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,
59  11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,
60  11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,
61  9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6
62 };
63 
64 static const int ROTB[80] = {
65  8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,
66  9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,
67  9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,
68  15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,
69  8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11
70 };
71 
72 static const int WA[80] = {
73  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
74  7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
75  3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,
76  1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,
77  4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13
78 };
79 
80 static const int WB[80] = {
81  5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,
82  6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,
83  15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,
84  8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,
85  12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11
86 };
87 
88 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
89 
90 #define ROUND128_0_TO_15(a,b,c,d,e,f,g,h) \
91  a = rol(a + (( b ^ c ^ d) + block[WA[n]]), ROTA[n]); \
92  e = rol(e + ((((f ^ g) & h) ^ g) + block[WB[n]] + KB[0]), ROTB[n]); \
93  n++
94 
95 #define ROUND128_16_TO_31(a,b,c,d,e,f,g,h) \
96  a = rol(a + ((((c ^ d) & b) ^ d) + block[WA[n]] + KA[0]), ROTA[n]); \
97  e = rol(e + (((~g | f) ^ h) + block[WB[n]] + KB[1]), ROTB[n]); \
98  n++
99 
100 #define ROUND128_32_TO_47(a,b,c,d,e,f,g,h) \
101  a = rol(a + (((~c | b) ^ d) + block[WA[n]] + KA[1]), ROTA[n]); \
102  e = rol(e + ((((g ^ h) & f) ^ h) + block[WB[n]] + KB[2]), ROTB[n]); \
103  n++
104 
105 #define ROUND128_48_TO_63(a,b,c,d,e,f,g,h) \
106  a = rol(a + ((((b ^ c) & d) ^ c) + block[WA[n]] + KA[2]), ROTA[n]); \
107  e = rol(e + (( f ^ g ^ h) + block[WB[n]]), ROTB[n]); \
108  n++
109 
110 #define R128_0 \
111  ROUND128_0_TO_15(a,b,c,d,e,f,g,h); \
112  ROUND128_0_TO_15(d,a,b,c,h,e,f,g); \
113  ROUND128_0_TO_15(c,d,a,b,g,h,e,f); \
114  ROUND128_0_TO_15(b,c,d,a,f,g,h,e)
115 
116 #define R128_16 \
117  ROUND128_16_TO_31(a,b,c,d,e,f,g,h); \
118  ROUND128_16_TO_31(d,a,b,c,h,e,f,g); \
119  ROUND128_16_TO_31(c,d,a,b,g,h,e,f); \
120  ROUND128_16_TO_31(b,c,d,a,f,g,h,e)
121 
122 #define R128_32 \
123  ROUND128_32_TO_47(a,b,c,d,e,f,g,h); \
124  ROUND128_32_TO_47(d,a,b,c,h,e,f,g); \
125  ROUND128_32_TO_47(c,d,a,b,g,h,e,f); \
126  ROUND128_32_TO_47(b,c,d,a,f,g,h,e)
127 
128 #define R128_48 \
129  ROUND128_48_TO_63(a,b,c,d,e,f,g,h); \
130  ROUND128_48_TO_63(d,a,b,c,h,e,f,g); \
131  ROUND128_48_TO_63(c,d,a,b,g,h,e,f); \
132  ROUND128_48_TO_63(b,c,d,a,f,g,h,e)
133 
134 static void ripemd128_transform(uint32_t *state, const uint8_t buffer[64])
135 {
136  uint32_t a, b, c, d, e, f, g, h, av_unused t;
137  uint32_t block[16];
138  int n;
139 
140  a = e = state[0];
141  b = f = state[1];
142  c = g = state[2];
143  d = h = state[3];
144 
145  for (n = 0; n < 16; n++)
146  block[n] = AV_RL32(buffer + 4 * n);
147  n = 0;
148 
149 #if CONFIG_SMALL
150  for (; n < 16;) {
151  ROUND128_0_TO_15(a,b,c,d,e,f,g,h);
152  t = d; d = c; c = b; b = a; a = t;
153  t = h; h = g; g = f; f = e; e = t;
154  }
155 
156  for (; n < 32;) {
157  ROUND128_16_TO_31(a,b,c,d,e,f,g,h);
158  t = d; d = c; c = b; b = a; a = t;
159  t = h; h = g; g = f; f = e; e = t;
160  }
161 
162  for (; n < 48;) {
163  ROUND128_32_TO_47(a,b,c,d,e,f,g,h);
164  t = d; d = c; c = b; b = a; a = t;
165  t = h; h = g; g = f; f = e; e = t;
166  }
167 
168  for (; n < 64;) {
169  ROUND128_48_TO_63(a,b,c,d,e,f,g,h);
170  t = d; d = c; c = b; b = a; a = t;
171  t = h; h = g; g = f; f = e; e = t;
172  }
173 #else
174 
176 
178 
180 
182 #endif
183 
184  h += c + state[1];
185  state[1] = state[2] + d + e;
186  state[2] = state[3] + a + f;
187  state[3] = state[0] + b + g;
188  state[0] = h;
189 }
190 
191 static void ripemd256_transform(uint32_t *state, const uint8_t buffer[64])
192 {
193  uint32_t a, b, c, d, e, f, g, h, av_unused t;
194  uint32_t block[16];
195  int n;
196 
197  a = state[0]; b = state[1]; c = state[2]; d = state[3];
198  e = state[4]; f = state[5]; g = state[6]; h = state[7];
199 
200  for (n = 0; n < 16; n++)
201  block[n] = AV_RL32(buffer + 4 * n);
202  n = 0;
203 
204 #if CONFIG_SMALL
205  for (; n < 16;) {
206  ROUND128_0_TO_15(a,b,c,d,e,f,g,h);
207  t = d; d = c; c = b; b = a; a = t;
208  t = h; h = g; g = f; f = e; e = t;
209  }
210  FFSWAP(uint32_t, a, e);
211 
212  for (; n < 32;) {
213  ROUND128_16_TO_31(a,b,c,d,e,f,g,h);
214  t = d; d = c; c = b; b = a; a = t;
215  t = h; h = g; g = f; f = e; e = t;
216  }
217  FFSWAP(uint32_t, b, f);
218 
219  for (; n < 48;) {
220  ROUND128_32_TO_47(a,b,c,d,e,f,g,h);
221  t = d; d = c; c = b; b = a; a = t;
222  t = h; h = g; g = f; f = e; e = t;
223  }
224  FFSWAP(uint32_t, c, g);
225 
226  for (; n < 64;) {
227  ROUND128_48_TO_63(a,b,c,d,e,f,g,h);
228  t = d; d = c; c = b; b = a; a = t;
229  t = h; h = g; g = f; f = e; e = t;
230  }
231  FFSWAP(uint32_t, d, h);
232 #else
233 
235  FFSWAP(uint32_t, a, e);
236 
238  FFSWAP(uint32_t, b, f);
239 
241  FFSWAP(uint32_t, c, g);
242 
244  FFSWAP(uint32_t, d, h);
245 #endif
246 
247  state[0] += a; state[1] += b; state[2] += c; state[3] += d;
248  state[4] += e; state[5] += f; state[6] += g; state[7] += h;
249 }
250 
251 #define ROTATE(x,y) \
252  x = rol(x, 10); \
253  y = rol(y, 10); \
254  n++
255 
256 #define ROUND160_0_TO_15(a,b,c,d,e,f,g,h,i,j) \
257  a = rol(a + (( b ^ c ^ d) + block[WA[n]]), ROTA[n]) + e; \
258  f = rol(f + (((~i | h) ^ g) + block[WB[n]] + KB[0]), ROTB[n]) + j; \
259  ROTATE(c,h)
260 
261 #define ROUND160_16_TO_31(a,b,c,d,e,f,g,h,i,j) \
262  a = rol(a + ((((c ^ d) & b) ^ d) + block[WA[n]] + KA[0]), ROTA[n]) + e; \
263  f = rol(f + ((((g ^ h) & i) ^ h) + block[WB[n]] + KB[1]), ROTB[n]) + j; \
264  ROTATE(c,h)
265 
266 #define ROUND160_32_TO_47(a,b,c,d,e,f,g,h,i,j) \
267  a = rol(a + (((~c | b) ^ d) + block[WA[n]] + KA[1]), ROTA[n]) + e; \
268  f = rol(f + (((~h | g) ^ i) + block[WB[n]] + KB[2]), ROTB[n]) + j; \
269  ROTATE(c,h)
270 
271 #define ROUND160_48_TO_63(a,b,c,d,e,f,g,h,i,j) \
272  a = rol(a + ((((b ^ c) & d) ^ c) + block[WA[n]] + KA[2]), ROTA[n]) + e; \
273  f = rol(f + ((((h ^ i) & g) ^ i) + block[WB[n]] + KB[3]), ROTB[n]) + j; \
274  ROTATE(c,h)
275 
276 #define ROUND160_64_TO_79(a,b,c,d,e,f,g,h,i,j) \
277  a = rol(a + (((~d | c) ^ b) + block[WA[n]] + KA[3]), ROTA[n]) + e; \
278  f = rol(f + (( g ^ h ^ i) + block[WB[n]]), ROTB[n]) + j; \
279  ROTATE(c,h)
280 
281 #define R160_0 \
282  ROUND160_0_TO_15(a,b,c,d,e,f,g,h,i,j); \
283  ROUND160_0_TO_15(e,a,b,c,d,j,f,g,h,i); \
284  ROUND160_0_TO_15(d,e,a,b,c,i,j,f,g,h); \
285  ROUND160_0_TO_15(c,d,e,a,b,h,i,j,f,g); \
286  ROUND160_0_TO_15(b,c,d,e,a,g,h,i,j,f)
287 
288 #define R160_16 \
289  ROUND160_16_TO_31(e,a,b,c,d,j,f,g,h,i); \
290  ROUND160_16_TO_31(d,e,a,b,c,i,j,f,g,h); \
291  ROUND160_16_TO_31(c,d,e,a,b,h,i,j,f,g); \
292  ROUND160_16_TO_31(b,c,d,e,a,g,h,i,j,f); \
293  ROUND160_16_TO_31(a,b,c,d,e,f,g,h,i,j)
294 
295 #define R160_32 \
296  ROUND160_32_TO_47(d,e,a,b,c,i,j,f,g,h); \
297  ROUND160_32_TO_47(c,d,e,a,b,h,i,j,f,g); \
298  ROUND160_32_TO_47(b,c,d,e,a,g,h,i,j,f); \
299  ROUND160_32_TO_47(a,b,c,d,e,f,g,h,i,j); \
300  ROUND160_32_TO_47(e,a,b,c,d,j,f,g,h,i)
301 
302 #define R160_48 \
303  ROUND160_48_TO_63(c,d,e,a,b,h,i,j,f,g); \
304  ROUND160_48_TO_63(b,c,d,e,a,g,h,i,j,f); \
305  ROUND160_48_TO_63(a,b,c,d,e,f,g,h,i,j); \
306  ROUND160_48_TO_63(e,a,b,c,d,j,f,g,h,i); \
307  ROUND160_48_TO_63(d,e,a,b,c,i,j,f,g,h)
308 
309 #define R160_64 \
310  ROUND160_64_TO_79(b,c,d,e,a,g,h,i,j,f); \
311  ROUND160_64_TO_79(a,b,c,d,e,f,g,h,i,j); \
312  ROUND160_64_TO_79(e,a,b,c,d,j,f,g,h,i); \
313  ROUND160_64_TO_79(d,e,a,b,c,i,j,f,g,h); \
314  ROUND160_64_TO_79(c,d,e,a,b,h,i,j,f,g)
315 
316 static void ripemd160_transform(uint32_t *state, const uint8_t buffer[64])
317 {
318  uint32_t a, b, c, d, e, f, g, h, i, j, av_unused t;
319  uint32_t block[16];
320  int n;
321 
322  a = f = state[0];
323  b = g = state[1];
324  c = h = state[2];
325  d = i = state[3];
326  e = j = state[4];
327 
328  for (n = 0; n < 16; n++)
329  block[n] = AV_RL32(buffer + 4 * n);
330  n = 0;
331 
332 #if CONFIG_SMALL
333  for (; n < 16;) {
334  ROUND160_0_TO_15(a,b,c,d,e,f,g,h,i,j);
335  t = e; e = d; d = c; c = b; b = a; a = t;
336  t = j; j = i; i = h; h = g; g = f; f = t;
337  }
338 
339  for (; n < 32;) {
340  ROUND160_16_TO_31(a,b,c,d,e,f,g,h,i,j);
341  t = e; e = d; d = c; c = b; b = a; a = t;
342  t = j; j = i; i = h; h = g; g = f; f = t;
343  }
344 
345  for (; n < 48;) {
346  ROUND160_32_TO_47(a,b,c,d,e,f,g,h,i,j);
347  t = e; e = d; d = c; c = b; b = a; a = t;
348  t = j; j = i; i = h; h = g; g = f; f = t;
349  }
350 
351  for (; n < 64;) {
352  ROUND160_48_TO_63(a,b,c,d,e,f,g,h,i,j);
353  t = e; e = d; d = c; c = b; b = a; a = t;
354  t = j; j = i; i = h; h = g; g = f; f = t;
355  }
356 
357  for (; n < 80;) {
358  ROUND160_64_TO_79(a,b,c,d,e,f,g,h,i,j);
359  t = e; e = d; d = c; c = b; b = a; a = t;
360  t = j; j = i; i = h; h = g; g = f; f = t;
361  }
362 #else
363 
364  R160_0; R160_0; R160_0;
365  ROUND160_0_TO_15(a,b,c,d,e,f,g,h,i,j);
366 
368  ROUND160_16_TO_31(e,a,b,c,d,j,f,g,h,i);
369 
371  ROUND160_32_TO_47(d,e,a,b,c,i,j,f,g,h);
372 
374  ROUND160_48_TO_63(c,d,e,a,b,h,i,j,f,g);
375 
377  ROUND160_64_TO_79(b,c,d,e,a,g,h,i,j,f);
378 #endif
379 
380  i += c + state[1];
381  state[1] = state[2] + d + j;
382  state[2] = state[3] + e + f;
383  state[3] = state[4] + a + g;
384  state[4] = state[0] + b + h;
385  state[0] = i;
386 }
387 
388 static void ripemd320_transform(uint32_t *state, const uint8_t buffer[64])
389 {
390  uint32_t a, b, c, d, e, f, g, h, i, j, av_unused t;
391  uint32_t block[16];
392  int n;
393 
394  a = state[0]; b = state[1]; c = state[2]; d = state[3]; e = state[4];
395  f = state[5]; g = state[6]; h = state[7]; i = state[8]; j = state[9];
396 
397  for (n = 0; n < 16; n++)
398  block[n] = AV_RL32(buffer + 4 * n);
399  n = 0;
400 
401 #if CONFIG_SMALL
402  for (; n < 16;) {
403  ROUND160_0_TO_15(a,b,c,d,e,f,g,h,i,j);
404  t = e; e = d; d = c; c = b; b = a; a = t;
405  t = j; j = i; i = h; h = g; g = f; f = t;
406  }
407  FFSWAP(uint32_t, b, g);
408 
409  for (; n < 32;) {
410  ROUND160_16_TO_31(a,b,c,d,e,f,g,h,i,j);
411  t = e; e = d; d = c; c = b; b = a; a = t;
412  t = j; j = i; i = h; h = g; g = f; f = t;
413  }
414  FFSWAP(uint32_t, d, i);
415 
416  for (; n < 48;) {
417  ROUND160_32_TO_47(a,b,c,d,e,f,g,h,i,j);
418  t = e; e = d; d = c; c = b; b = a; a = t;
419  t = j; j = i; i = h; h = g; g = f; f = t;
420  }
421  FFSWAP(uint32_t, a, f);
422 
423  for (; n < 64;) {
424  ROUND160_48_TO_63(a,b,c,d,e,f,g,h,i,j);
425  t = e; e = d; d = c; c = b; b = a; a = t;
426  t = j; j = i; i = h; h = g; g = f; f = t;
427  }
428  FFSWAP(uint32_t, c, h);
429 
430  for (; n < 80;) {
431  ROUND160_64_TO_79(a,b,c,d,e,f,g,h,i,j);
432  t = e; e = d; d = c; c = b; b = a; a = t;
433  t = j; j = i; i = h; h = g; g = f; f = t;
434  }
435  FFSWAP(uint32_t, e, j);
436 #else
437 
438  R160_0; R160_0; R160_0;
439  ROUND160_0_TO_15(a,b,c,d,e,f,g,h,i,j);
440  FFSWAP(uint32_t, a, f);
441 
443  ROUND160_16_TO_31(e,a,b,c,d,j,f,g,h,i);
444  FFSWAP(uint32_t, b, g);
445 
447  ROUND160_32_TO_47(d,e,a,b,c,i,j,f,g,h);
448  FFSWAP(uint32_t, c, h);
449 
451  ROUND160_48_TO_63(c,d,e,a,b,h,i,j,f,g);
452  FFSWAP(uint32_t, d, i);
453 
455  ROUND160_64_TO_79(b,c,d,e,a,g,h,i,j,f);
456  FFSWAP(uint32_t, e, j);
457 #endif
458 
459  state[0] += a; state[1] += b; state[2] += c; state[3] += d; state[4] += e;
460  state[5] += f; state[6] += g; state[7] += h; state[8] += i; state[9] += j;
461 }
462 
464 {
465  ctx->digest_len = bits >> 5;
466  switch (bits) {
467  case 128: // RIPEMD-128
468  ctx->state[0] = 0x67452301;
469  ctx->state[1] = 0xEFCDAB89;
470  ctx->state[2] = 0x98BADCFE;
471  ctx->state[3] = 0x10325476;
473  break;
474  case 160: // RIPEMD-160
475  ctx->state[0] = 0x67452301;
476  ctx->state[1] = 0xEFCDAB89;
477  ctx->state[2] = 0x98BADCFE;
478  ctx->state[3] = 0x10325476;
479  ctx->state[4] = 0xC3D2E1F0;
481  break;
482  case 256: // RIPEMD-256
483  ctx->state[0] = 0x67452301;
484  ctx->state[1] = 0xEFCDAB89;
485  ctx->state[2] = 0x98BADCFE;
486  ctx->state[3] = 0x10325476;
487  ctx->state[4] = 0x76543210;
488  ctx->state[5] = 0xFEDCBA98;
489  ctx->state[6] = 0x89ABCDEF;
490  ctx->state[7] = 0x01234567;
492  break;
493  case 320: // RIPEMD-320
494  ctx->state[0] = 0x67452301;
495  ctx->state[1] = 0xEFCDAB89;
496  ctx->state[2] = 0x98BADCFE;
497  ctx->state[3] = 0x10325476;
498  ctx->state[4] = 0xC3D2E1F0;
499  ctx->state[5] = 0x76543210;
500  ctx->state[6] = 0xFEDCBA98;
501  ctx->state[7] = 0x89ABCDEF;
502  ctx->state[8] = 0x01234567;
503  ctx->state[9] = 0x3C2D1E0F;
505  break;
506  default:
507  return AVERROR(EINVAL);
508  }
509  ctx->count = 0;
510  return 0;
511 }
512 
513 #if FF_API_CRYPTO_SIZE_T
514 void av_ripemd_update(AVRIPEMD* ctx, const uint8_t* data, unsigned int len)
515 #else
516 void av_ripemd_update(AVRIPEMD* ctx, const uint8_t* data, size_t len)
517 #endif
518 {
519  unsigned int i, j;
520 
521  j = ctx->count & 63;
522  ctx->count += len;
523 #if CONFIG_SMALL
524  for (i = 0; i < len; i++) {
525  ctx->buffer[j++] = data[i];
526  if (64 == j) {
527  ctx->transform(ctx->state, ctx->buffer);
528  j = 0;
529  }
530  }
531 #else
532  if ((j + len) > 63) {
533  memcpy(&ctx->buffer[j], data, (i = 64 - j));
534  ctx->transform(ctx->state, ctx->buffer);
535  for (; i + 63 < len; i += 64)
536  ctx->transform(ctx->state, &data[i]);
537  j = 0;
538  } else
539  i = 0;
540  memcpy(&ctx->buffer[j], &data[i], len - i);
541 #endif
542 }
543 
544 void av_ripemd_final(AVRIPEMD* ctx, uint8_t *digest)
545 {
546  int i;
547  uint64_t finalcount = av_le2ne64(ctx->count << 3);
548 
549  av_ripemd_update(ctx, "\200", 1);
550  while ((ctx->count & 63) != 56)
551  av_ripemd_update(ctx, "", 1);
552  av_ripemd_update(ctx, (uint8_t *)&finalcount, 8); /* Should cause a transform() */
553  for (i = 0; i < ctx->digest_len; i++)
554  AV_WL32(digest + i*4, ctx->state[i]);
555 }
ptrdiff_t const GLvoid * data
Definition: opengl_enc.c:100
#define R128_0
Definition: ripemd.c:110
void av_ripemd_update(AVRIPEMD *ctx, const uint8_t *data, unsigned int len)
Update hash value.
Definition: ripemd.c:514
Memory handling functions.
const char * g
Definition: vf_curves.c:115
Public header for RIPEMD hash function implementation.
#define ROUND160_0_TO_15(a, b, c, d, e, f, g, h, i, j)
Definition: ripemd.c:256
The reader does not expect b to be semantically here and if the code is changed by maybe adding a a division or other the signedness will almost certainly be mistaken To avoid this confusion a new type was SUINT is the C unsigned type but it holds a signed int to use the same example SUINT a
Definition: undefined.txt:36
Convenience header that includes libavutil&#39;s core.
static const uint32_t KB[4]
Definition: ripemd.c:52
void * av_mallocz(size_t size)
Allocate a memory block with alignment suitable for all memory accesses (including vectors if availab...
Definition: mem.c:236
static void ripemd320_transform(uint32_t *state, const uint8_t buffer[64])
Definition: ripemd.c:388
Macro definitions for various function/variable attributes.
void av_ripemd_final(AVRIPEMD *ctx, uint8_t *digest)
Finish hashing and output digest value.
Definition: ripemd.c:544
The exact code depends on how similar the blocks are and how related they are to the block
uint8_t
#define av_cold
Definition: attributes.h:82
#define f(width, name)
Definition: cbs_vp9.c:255
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
Definition: undefined.txt:32
#define ROUND160_48_TO_63(a, b, c, d, e, f, g, h, i, j)
Definition: ripemd.c:271
#define ROUND128_0_TO_15(a, b, c, d, e, f, g, h)
Definition: ripemd.c:90
#define R160_32
Definition: ripemd.c:295
uint8_t buffer[64]
512-bit buffer of input values used in hash updating
Definition: ripemd.c:35
#define i(width, name, range_min, range_max)
Definition: cbs_h2645.c:259
uint8_t bits
Definition: vp3data.h:202
#define ROUND160_64_TO_79(a, b, c, d, e, f, g, h, i, j)
Definition: ripemd.c:276
struct AVRIPEMD * av_ripemd_alloc(void)
Allocate an AVRIPEMD context.
Definition: ripemd.c:43
static const int ROTB[80]
Definition: ripemd.c:64
#define b
Definition: input.c:41
#define R128_16
Definition: ripemd.c:116
#define R160_64
Definition: ripemd.c:309
typedef void(APIENTRY *FF_PFNGLACTIVETEXTUREPROC)(GLenum texture)
#define R160_0
Definition: ripemd.c:281
static void ripemd128_transform(uint32_t *state, const uint8_t buffer[64])
Definition: ripemd.c:134
#define R128_32
Definition: ripemd.c:122
static const int WB[80]
Definition: ripemd.c:80
AVFormatContext * ctx
Definition: movenc.c:48
int n
Definition: avisynth_c.h:760
static const int WA[80]
Definition: ripemd.c:72
static const uint32_t KA[4]
Definition: ripemd.c:48
#define ROUND128_32_TO_47(a, b, c, d, e, f, g, h)
Definition: ripemd.c:100
uint64_t count
number of bytes in buffer
Definition: ripemd.c:34
static const int ROTA[80]
Definition: ripemd.c:56
#define ROUND160_32_TO_47(a, b, c, d, e, f, g, h, i, j)
Definition: ripemd.c:266
hash context
Definition: ripemd.c:32
uint8_t digest_len
digest length in 32-bit words
Definition: ripemd.c:33
#define av_le2ne64(x)
Definition: bswap.h:97
static void ripemd256_transform(uint32_t *state, const uint8_t buffer[64])
Definition: ripemd.c:191
byte swapping routines
#define ROUND160_16_TO_31(a, b, c, d, e, f, g, h, i, j)
Definition: ripemd.c:261
#define ROUND128_48_TO_63(a, b, c, d, e, f, g, h)
Definition: ripemd.c:105
av_cold int av_ripemd_init(AVRIPEMD *ctx, int bits)
Initialize RIPEMD hashing.
Definition: ripemd.c:463
uint32_t state[10]
current hash value
Definition: ripemd.c:36
static void ripemd160_transform(uint32_t *state, const uint8_t buffer[64])
Definition: ripemd.c:316
#define R160_16
Definition: ripemd.c:288
void(* transform)(uint32_t *state, const uint8_t buffer[64])
function used to update hash for 512-bit input block
Definition: ripemd.c:38
int len
const int av_ripemd_size
Definition: ripemd.c:41
#define FFSWAP(type, a, b)
Definition: common.h:99
Filter the word “frame” indicates either a video frame or a group of audio as stored in an AVFrame structure Format for each input and each output the list of supported formats For video that means pixel format For audio that means channel sample they are references to shared objects When the negotiation mechanism computes the intersection of the formats supported at each end of a all references to both lists are replaced with a reference to the intersection And when a single format is eventually chosen for a link amongst the remaining all references to the list are updated That means that if a filter requires that its input and output have the same format amongst a supported all it has to do is use a reference to the same list of formats query_formats can leave some formats unset and return AVERROR(EAGAIN) to cause the negotiation mechanism toagain later.That can be used by filters with complex requirements to use the format negotiated on one link to set the formats supported on another.Frame references ownership and permissions
#define R128_48
Definition: ripemd.c:128
uint64_t_TMPL AV_WL64 unsigned int_TMPL AV_RL32
Definition: bytestream.h:87
#define R160_48
Definition: ripemd.c:302
GLuint buffer
Definition: opengl_enc.c:101
#define av_unused
Definition: attributes.h:125
#define AV_WL32(p, v)
Definition: intreadwrite.h:426
#define ROUND128_16_TO_31(a, b, c, d, e, f, g, h)
Definition: ripemd.c:95