Rizin
unix-like reverse engineering framework and cli tools
md5.c File Reference
#include <sys/types.h>
#include <stdlib.h>
#include <string.h>
#include <md5.h>

Go to the source code of this file.

Macros

#define SWAP(n)   (n)
 
#define BLOCKSIZE   4096
 
#define UNALIGNED_P(p)   (((md5_uintptr) p) % sizeof (md5_uint32) != 0)
 
#define FF(b, c, d)   (d ^ (b & (c ^ d)))
 
#define FG(b, c, d)   FF (d, b, c)
 
#define FH(b, c, d)   (b ^ c ^ d)
 
#define FI(b, c, d)   (c ^ (b | ~d))
 
#define OP(a, b, c, d, s, T)
 
#define OP(f, a, b, c, d, k, s, T)
 

Functions

void md5_init_ctx (struct md5_ctx *ctx)
 
void * md5_read_ctx (const struct md5_ctx *ctx, void *resbuf)
 
void * md5_finish_ctx (struct md5_ctx *ctx, void *resbuf)
 
int md5_stream (FILE *stream, void *resblock)
 
void * md5_buffer (const char *buffer, size_t len, void *resblock)
 
void md5_process_bytes (const void *buffer, size_t len, struct md5_ctx *ctx)
 
void md5_process_block (const void *buffer, size_t len, struct md5_ctx *ctx)
 

Variables

static const unsigned char fillbuf [64] = { 0x80, 0 }
 

Macro Definition Documentation

◆ BLOCKSIZE

#define BLOCKSIZE   4096

Definition at line 56 of file md5.c.

◆ FF

#define FF (   b,
  c,
  d 
)    (d ^ (b & (c ^ d)))

Definition at line 292 of file md5.c.

◆ FG

#define FG (   b,
  c,
  d 
)    FF (d, b, c)

Definition at line 293 of file md5.c.

◆ FH

#define FH (   b,
  c,
  d 
)    (b ^ c ^ d)

Definition at line 294 of file md5.c.

◆ FI

#define FI (   b,
  c,
  d 
)    (c ^ (b | ~d))

Definition at line 295 of file md5.c.

◆ OP [1/2]

#define OP (   a,
  b,
  c,
  d,
  s,
  T 
)
Value:
do \
{ \
a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \
++words; \
a = rol (a, s); \
a += b; \
} \
while (0)
#define T(op)
static RzSocket * s
Definition: rtr.c:28
#define d(i)
Definition: sha256.c:44
#define b(i)
Definition: sha256.c:42
#define c(i)
Definition: sha256.c:43
#define a(i)
Definition: sha256.c:41
#define FF(b, c, d)
Definition: md5.c:292
#define SWAP(n)
Definition: md5.c:53
#define rol(x, n)
Definition: md5.h:163

◆ OP [2/2]

#define OP (   f,
  a,
  b,
  c,
  d,
  k,
  s,
  T 
)
Value:
do \
{ \
a += f (b, c, d) + correct_words[k] + T; \
a = rol (a, s); \
a += b; \
} \
while (0)
const char * k
Definition: dsignal.c:11
#define f(i)
Definition: sha256.c:46

◆ SWAP

#define SWAP (   n)    (n)

Definition at line 53 of file md5.c.

◆ UNALIGNED_P

#define UNALIGNED_P (   p)    (((md5_uintptr) p) % sizeof (md5_uint32) != 0)

Function Documentation

◆ md5_buffer()

void* md5_buffer ( const char *  buffer,
size_t  len,
void *  resblock 
)

Definition at line 200 of file md5.c.

201 {
202  struct md5_ctx ctx;
203 
204  /* Initialize the computation context. */
205  md5_init_ctx (&ctx);
206 
207  /* Process whole buffer but last len % 64 bytes. */
209 
210  /* Put result in desired memory area. */
211  return md5_finish_ctx (&ctx, resblock);
212 }
size_t len
Definition: 6502dis.c:15
Definition: buffer.h:15
Definition: md5.h:87
void md5_process_bytes(const void *buffer, size_t len, struct md5_ctx *ctx)
Definition: md5.c:216
void md5_init_ctx(struct md5_ctx *ctx)
Definition: md5.c:71
void * md5_finish_ctx(struct md5_ctx *ctx, void *resbuf)
Definition: md5.c:104

References len, md5_finish_ctx(), md5_init_ctx(), and md5_process_bytes().

◆ md5_finish_ctx()

void* md5_finish_ctx ( struct md5_ctx ctx,
void *  resbuf 
)

Definition at line 104 of file md5.c.

105 {
106  /* Take yet unprocessed bytes into account. */
107  md5_uint32 bytes = ctx->buflen;
108  size_t pad;
109 
110  /* Now count remaining bytes. */
111  ctx->total[0] += bytes;
112  if (ctx->total[0] < bytes)
113  ++ctx->total[1];
114 
115  pad = bytes >= 56 ? 64 + 56 - bytes : 56 - bytes;
116  memcpy (&ctx->buffer[bytes], fillbuf, pad);
117 
118  /* Put the 64-bit file length in *bits* at the end of the buffer. */
119  *(md5_uint32 *) &ctx->buffer[bytes + pad] = SWAP (ctx->total[0] << 3);
120  *(md5_uint32 *) &ctx->buffer[bytes + pad + 4] = SWAP ((ctx->total[1] << 3) |
121  (ctx->total[0] >> 29));
122 
123  /* Process last bytes. */
124  md5_process_block (ctx->buffer, bytes + pad + 8, ctx);
125 
126  return md5_read_ctx (ctx, resbuf);
127 }
static ut8 bytes[32]
Definition: asm_arc.c:23
memcpy(mem, inblock.get(), min(CONTAINING_RECORD(inblock.get(), MEMBLOCK, data) ->size, size))
static void pad(RzStrBuf *sb, ut32 count)
Definition: protobuf.c:36
void md5_process_block(const void *buffer, size_t len, struct md5_ctx *ctx)
Definition: md5.c:301
static const unsigned char fillbuf[64]
Definition: md5.c:65
void * md5_read_ctx(const struct md5_ctx *ctx, void *resbuf)
Definition: md5.c:88
unsigned int md5_uint32
Definition: md5.h:59

References bytes, fillbuf, md5_process_block(), md5_read_ctx(), memcpy(), pad(), and SWAP.

Referenced by cabx_close(), md5_buffer(), and md5_stream().

◆ md5_init_ctx()

void md5_init_ctx ( struct md5_ctx ctx)

Definition at line 71 of file md5.c.

72 {
73  ctx->A = 0x67452301;
74  ctx->B = 0xefcdab89;
75  ctx->C = 0x98badcfe;
76  ctx->D = 0x10325476;
77 
78  ctx->total[0] = ctx->total[1] = 0;
79  ctx->buflen = 0;
80 }

Referenced by cabx_open(), md5_buffer(), and md5_stream().

◆ md5_process_block()

void md5_process_block ( const void *  buffer,
size_t  len,
struct md5_ctx ctx 
)

Definition at line 301 of file md5.c.

302 {
303  md5_uint32 correct_words[16];
304  const md5_uint32 *words = (const md5_uint32 *) buffer;
305  size_t nwords = len / sizeof (md5_uint32);
306  const md5_uint32 *endp = words + nwords;
307  md5_uint32 A = ctx->A;
308  md5_uint32 B = ctx->B;
309  md5_uint32 C = ctx->C;
310  md5_uint32 D = ctx->D;
311 
312  /* First increment the byte count. RFC 1321 specifies the possible
313  length of the file up to 2^64 bits. Here we only compute the
314  number of bytes. Do a double word increment. */
315  ctx->total[0] += len;
316  if (ctx->total[0] < len)
317  ++ctx->total[1];
318 
319  /* Process all bytes in the buffer with 64 bytes in each round of
320  the loop. */
321  while (words < endp)
322  {
323  md5_uint32 *cwp = correct_words;
324  md5_uint32 A_save = A;
325  md5_uint32 B_save = B;
326  md5_uint32 C_save = C;
327  md5_uint32 D_save = D;
328 
329  /* First round: using the given function, the context and a constant
330  the next context is computed. Because the algorithms processing
331  unit is a 32-bit word and it is determined to work on words in
332  little endian byte order we perhaps have to change the byte order
333  before the computation. To reduce the work for the next steps
334  we store the swapped words in the array CORRECT_WORDS. */
335 
336 #define OP(a, b, c, d, s, T) \
337  do \
338  { \
339  a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \
340  ++words; \
341  a = rol (a, s); \
342  a += b; \
343  } \
344  while (0)
345 
346  /* Before we start, one word to the strange constants.
347  They are defined in RFC 1321 as
348 
349  T[i] = (int) (4294967296.0 * fabs (sin (i))), i=1..64, or
350  perl -e 'foreach(1..64){printf "0x%08x\n", int (4294967296 * abs (sin $_))}'
351  */
352 
353  /* Round 1. */
354  OP (A, B, C, D, 7, 0xd76aa478);
355  OP (D, A, B, C, 12, 0xe8c7b756);
356  OP (C, D, A, B, 17, 0x242070db);
357  OP (B, C, D, A, 22, 0xc1bdceee);
358  OP (A, B, C, D, 7, 0xf57c0faf);
359  OP (D, A, B, C, 12, 0x4787c62a);
360  OP (C, D, A, B, 17, 0xa8304613);
361  OP (B, C, D, A, 22, 0xfd469501);
362  OP (A, B, C, D, 7, 0x698098d8);
363  OP (D, A, B, C, 12, 0x8b44f7af);
364  OP (C, D, A, B, 17, 0xffff5bb1);
365  OP (B, C, D, A, 22, 0x895cd7be);
366  OP (A, B, C, D, 7, 0x6b901122);
367  OP (D, A, B, C, 12, 0xfd987193);
368  OP (C, D, A, B, 17, 0xa679438e);
369  OP (B, C, D, A, 22, 0x49b40821);
370 
371  /* For the second to fourth round we have the possibly swapped words
372  in CORRECT_WORDS. Redefine the macro to take an additional first
373  argument specifying the function to use. */
374 #undef OP
375 #define OP(f, a, b, c, d, k, s, T) \
376  do \
377  { \
378  a += f (b, c, d) + correct_words[k] + T; \
379  a = rol (a, s); \
380  a += b; \
381  } \
382  while (0)
383 
384  /* Round 2. */
385  OP (FG, A, B, C, D, 1, 5, 0xf61e2562);
386  OP (FG, D, A, B, C, 6, 9, 0xc040b340);
387  OP (FG, C, D, A, B, 11, 14, 0x265e5a51);
388  OP (FG, B, C, D, A, 0, 20, 0xe9b6c7aa);
389  OP (FG, A, B, C, D, 5, 5, 0xd62f105d);
390  OP (FG, D, A, B, C, 10, 9, 0x02441453);
391  OP (FG, C, D, A, B, 15, 14, 0xd8a1e681);
392  OP (FG, B, C, D, A, 4, 20, 0xe7d3fbc8);
393  OP (FG, A, B, C, D, 9, 5, 0x21e1cde6);
394  OP (FG, D, A, B, C, 14, 9, 0xc33707d6);
395  OP (FG, C, D, A, B, 3, 14, 0xf4d50d87);
396  OP (FG, B, C, D, A, 8, 20, 0x455a14ed);
397  OP (FG, A, B, C, D, 13, 5, 0xa9e3e905);
398  OP (FG, D, A, B, C, 2, 9, 0xfcefa3f8);
399  OP (FG, C, D, A, B, 7, 14, 0x676f02d9);
400  OP (FG, B, C, D, A, 12, 20, 0x8d2a4c8a);
401 
402  /* Round 3. */
403  OP (FH, A, B, C, D, 5, 4, 0xfffa3942);
404  OP (FH, D, A, B, C, 8, 11, 0x8771f681);
405  OP (FH, C, D, A, B, 11, 16, 0x6d9d6122);
406  OP (FH, B, C, D, A, 14, 23, 0xfde5380c);
407  OP (FH, A, B, C, D, 1, 4, 0xa4beea44);
408  OP (FH, D, A, B, C, 4, 11, 0x4bdecfa9);
409  OP (FH, C, D, A, B, 7, 16, 0xf6bb4b60);
410  OP (FH, B, C, D, A, 10, 23, 0xbebfbc70);
411  OP (FH, A, B, C, D, 13, 4, 0x289b7ec6);
412  OP (FH, D, A, B, C, 0, 11, 0xeaa127fa);
413  OP (FH, C, D, A, B, 3, 16, 0xd4ef3085);
414  OP (FH, B, C, D, A, 6, 23, 0x04881d05);
415  OP (FH, A, B, C, D, 9, 4, 0xd9d4d039);
416  OP (FH, D, A, B, C, 12, 11, 0xe6db99e5);
417  OP (FH, C, D, A, B, 15, 16, 0x1fa27cf8);
418  OP (FH, B, C, D, A, 2, 23, 0xc4ac5665);
419 
420  /* Round 4. */
421  OP (FI, A, B, C, D, 0, 6, 0xf4292244);
422  OP (FI, D, A, B, C, 7, 10, 0x432aff97);
423  OP (FI, C, D, A, B, 14, 15, 0xab9423a7);
424  OP (FI, B, C, D, A, 5, 21, 0xfc93a039);
425  OP (FI, A, B, C, D, 12, 6, 0x655b59c3);
426  OP (FI, D, A, B, C, 3, 10, 0x8f0ccc92);
427  OP (FI, C, D, A, B, 10, 15, 0xffeff47d);
428  OP (FI, B, C, D, A, 1, 21, 0x85845dd1);
429  OP (FI, A, B, C, D, 8, 6, 0x6fa87e4f);
430  OP (FI, D, A, B, C, 15, 10, 0xfe2ce6e0);
431  OP (FI, C, D, A, B, 6, 15, 0xa3014314);
432  OP (FI, B, C, D, A, 13, 21, 0x4e0811a1);
433  OP (FI, A, B, C, D, 4, 6, 0xf7537e82);
434  OP (FI, D, A, B, C, 11, 10, 0xbd3af235);
435  OP (FI, C, D, A, B, 2, 15, 0x2ad7d2bb);
436  OP (FI, B, C, D, A, 9, 21, 0xeb86d391);
437 
438  /* Add the starting values of the context. */
439  A += A_save;
440  B += B_save;
441  C += C_save;
442  D += D_save;
443  }
444 
445  /* Put checksum in context given as argument. */
446  ctx->A = A;
447  ctx->B = B;
448  ctx->C = C;
449  ctx->D = D;
450 }
#define A(x)
Definition: arc.h:165
#define B(x)
Definition: arc.h:166
#define C(x)
Definition: arc.h:167
#define D
Definition: block.c:38
#define FH(b, c, d)
Definition: md5.c:294
#define FG(b, c, d)
Definition: md5.c:293
#define OP(a, b, c, d, s, T)
#define FI(b, c, d)
Definition: md5.c:295

References A, B, C, D, FG, FH, FI, len, and OP.

Referenced by md5_finish_ctx(), md5_process_bytes(), and md5_stream().

◆ md5_process_bytes()

void md5_process_bytes ( const void *  buffer,
size_t  len,
struct md5_ctx ctx 
)

Definition at line 216 of file md5.c.

217 {
218  /* When we already have some bits in our internal buffer concatenate
219  both inputs first. */
220  if (ctx->buflen != 0)
221  {
222  size_t left_over = ctx->buflen;
223  size_t add = 128 - left_over > len ? len : 128 - left_over;
224 
225  memcpy (&ctx->buffer[left_over], buffer, add);
226  ctx->buflen += add;
227 
228  if (ctx->buflen > 64)
229  {
230  md5_process_block (ctx->buffer, ctx->buflen & ~63, ctx);
231 
232  ctx->buflen &= 63;
233  /* The regions in the following copy operation cannot overlap. */
234  memcpy (ctx->buffer, &ctx->buffer[(left_over + add) & ~63],
235  ctx->buflen);
236  }
237 
238  buffer = (const char *) buffer + add;
239  len -= add;
240  }
241 
242  /* Process available complete blocks. */
243  if (len >= 64)
244  {
245 #if !_STRING_ARCH_unaligned
246 /* To check alignment gcc has an appropriate operator. Other
247  compilers don't. */
248 # if __GNUC__ >= 2
249 # define UNALIGNED_P(p) (((md5_uintptr) p) % __alignof__ (md5_uint32) != 0)
250 # else
251 # define UNALIGNED_P(p) (((md5_uintptr) p) % sizeof (md5_uint32) != 0)
252 # endif
253  if (UNALIGNED_P (buffer))
254  while (len > 64)
255  {
256  memcpy (ctx->buffer, buffer, 64);
257  md5_process_block (ctx->buffer, 64, ctx);
258  buffer = (const char *) buffer + 64;
259  len -= 64;
260  }
261  else
262 #endif
263  {
264  md5_process_block (buffer, len & ~63, ctx);
265  buffer = (const char *) buffer + (len & ~63);
266  len &= 63;
267  }
268  }
269 
270  /* Move remaining bytes in internal buffer. */
271  if (len > 0)
272  {
273  size_t left_over = ctx->buflen;
274 
275  memcpy (&ctx->buffer[left_over], buffer, len);
276  left_over += len;
277  if (left_over >= 64)
278  {
279  md5_process_block (ctx->buffer, 64, ctx);
280  left_over -= 64;
281  memcpy (ctx->buffer, &ctx->buffer[64], left_over);
282  }
283  ctx->buflen = left_over;
284  }
285 }
#define UNALIGNED_P(p)
static int add(char *argv[])
Definition: ziptool.c:84

References add(), len, md5_process_block(), memcpy(), and UNALIGNED_P.

Referenced by cabx_write(), md5_buffer(), and md5_stream().

◆ md5_read_ctx()

void* md5_read_ctx ( const struct md5_ctx ctx,
void *  resbuf 
)

Definition at line 88 of file md5.c.

89 {
90  ((md5_uint32 *) resbuf)[0] = SWAP (ctx->A);
91  ((md5_uint32 *) resbuf)[1] = SWAP (ctx->B);
92  ((md5_uint32 *) resbuf)[2] = SWAP (ctx->C);
93  ((md5_uint32 *) resbuf)[3] = SWAP (ctx->D);
94 
95  return resbuf;
96 }

References SWAP.

Referenced by md5_finish_ctx().

◆ md5_stream()

int md5_stream ( FILE *  stream,
void *  resblock 
)

Definition at line 133 of file md5.c.

134 {
135  struct md5_ctx ctx;
136  char buffer[BLOCKSIZE + 72];
137  size_t sum;
138 
139  /* Initialize the computation context. */
140  md5_init_ctx (&ctx);
141 
142  /* Iterate over full file contents. */
143  while (1)
144  {
145  /* We read the file in blocks of BLOCKSIZE bytes. One call of the
146  computation function processes the whole buffer so that with the
147  next round of the loop another block can be read. */
148  size_t n;
149  sum = 0;
150 
151  /* Read block. Take care for partial reads. */
152  while (1)
153  {
154  n = fread (buffer + sum, 1, BLOCKSIZE - sum, stream);
155 
156  sum += n;
157 
158  if (sum == BLOCKSIZE)
159  break;
160 
161  if (n == 0)
162  {
163  /* Check for the error flag IFF N == 0, so that we don't
164  exit the loop after a partial read due to e.g., EAGAIN
165  or EWOULDBLOCK. */
166  if (ferror (stream))
167  return 1;
168  goto process_partial_block;
169  }
170 
171  /* We've read at least one byte, so ignore errors. But always
172  check for EOF, since feof may be true even though N > 0.
173  Otherwise, we could end up calling fread after EOF. */
174  if (feof (stream))
175  goto process_partial_block;
176  }
177 
178  /* Process buffer with BLOCKSIZE bytes. Note that
179  BLOCKSIZE % 64 == 0
180  */
182  }
183 
184  process_partial_block:;
185 
186  /* Process any remaining bytes. */
187  if (sum > 0)
188  md5_process_bytes (buffer, sum, &ctx);
189 
190  /* Construct result in desired memory. */
191  md5_finish_ctx (&ctx, resblock);
192  return 0;
193 }
voidpf stream
Definition: ioapi.h:138
int n
Definition: mipsasm.c:19
#define BLOCKSIZE
Definition: md5.c:56

References BLOCKSIZE, md5_finish_ctx(), md5_init_ctx(), md5_process_block(), md5_process_bytes(), and n.

Variable Documentation

◆ fillbuf

const unsigned char fillbuf[64] = { 0x80, 0 }
static

Definition at line 65 of file md5.c.

Referenced by md5_finish_ctx().