2 * Copyright © 2000 Keith Packard
3 * Copyright © 2005 Patrick Lam
5 * Permission to use, copy, modify, distribute, and sell this software and its
6 * documentation for any purpose is hereby granted without fee, provided that
7 * the above copyright notice appear in all copies and that both that
8 * copyright notice and this permission notice appear in supporting
9 * documentation, and that the name of Keith Packard not be used in
10 * advertising or publicity pertaining to distribution of the software without
11 * specific, written prior permission. Keith Packard makes no
12 * representations about the suitability of this software for any purpose. It
13 * is provided "as is" without express or implied warranty.
15 * KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
16 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
17 * EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
18 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
19 * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
20 * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
21 * PERFORMANCE OF THIS SOFTWARE.
25 #include "../fc-arch/fcarch.h"
30 #include <sys/types.h>
31 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
33 # include <sys/mman.h>
48 static void MD5Init(struct MD5Context
*ctx
);
49 static void MD5Update(struct MD5Context
*ctx
, unsigned char *buf
, unsigned len
);
50 static void MD5Final(unsigned char digest
[16], struct MD5Context
*ctx
);
51 static void MD5Transform(FcChar32 buf
[4], FcChar32 in
[16]);
53 #define CACHEBASE_LEN (1 + 32 + 1 + sizeof (FC_ARCHITECTURE) + sizeof (FC_CACHE_SUFFIX))
55 static const char bin2hex
[] = { '0', '1', '2', '3',
61 FcDirCacheBasename (const FcChar8
* dir
, FcChar8 cache_base
[CACHEBASE_LEN
])
63 unsigned char hash
[16];
66 struct MD5Context ctx
;
69 MD5Update (&ctx
, (unsigned char *)dir
, strlen ((char *) dir
));
71 MD5Final (hash
, &ctx
);
74 hex_hash
= cache_base
+ 1;
75 for (cnt
= 0; cnt
< 16; ++cnt
)
77 hex_hash
[2*cnt
] = bin2hex
[hash
[cnt
] >> 4];
78 hex_hash
[2*cnt
+1] = bin2hex
[hash
[cnt
] & 0xf];
81 strcat ((char *) cache_base
, "-" FC_ARCHITECTURE FC_CACHE_SUFFIX
);
87 FcDirCacheUnlink (const FcChar8
*dir
, FcConfig
*config
)
89 FcChar8
*cache_hashed
= NULL
;
90 FcChar8 cache_base
[CACHEBASE_LEN
];
94 FcDirCacheBasename (dir
, cache_base
);
96 list
= FcStrListCreate (config
->cacheDirs
);
100 while ((cache_dir
= FcStrListNext (list
)))
102 cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
105 (void) unlink ((char *) cache_hashed
);
107 FcStrListDone (list
);
108 /* return FcFalse if something went wrong */
115 FcDirCacheOpenFile (const FcChar8
*cache_file
, struct stat
*file_stat
)
119 fd
= open((char *) cache_file
, O_RDONLY
| O_BINARY
);
122 if (fstat (fd
, file_stat
) < 0)
131 * Look for a cache file for the specified dir. Attempt
132 * to use each one we find, stopping when the callback
136 FcDirCacheProcess (FcConfig
*config
, const FcChar8
*dir
,
137 FcBool (*callback
) (int fd
, off_t size
, void *closure
),
138 void *closure
, FcChar8
**cache_file_ret
)
141 FcChar8 cache_base
[CACHEBASE_LEN
];
144 struct stat file_stat
, dir_stat
;
145 FcBool ret
= FcFalse
;
147 if (stat ((char *) dir
, &dir_stat
) < 0)
150 FcDirCacheBasename (dir
, cache_base
);
152 list
= FcStrListCreate (config
->cacheDirs
);
156 while ((cache_dir
= FcStrListNext (list
)))
158 FcChar8
*cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
161 fd
= FcDirCacheOpenFile (cache_hashed
, &file_stat
);
163 if (dir_stat
.st_mtime
<= file_stat
.st_mtime
)
165 ret
= (*callback
) (fd
, file_stat
.st_size
, closure
);
169 *cache_file_ret
= cache_hashed
;
171 FcStrFree (cache_hashed
);
178 FcStrFree (cache_hashed
);
180 FcStrListDone (list
);
185 #define FC_CACHE_MIN_MMAP 1024
188 * Map a cache file into memory
191 FcDirCacheMapFd (int fd
, off_t size
)
193 FcCache
*cache
= NULL
;
194 FcBool allocated
= FcFalse
;
196 if (size
< sizeof (FcCache
))
199 * For small cache files, just read them into memory
201 if (size
>= FC_CACHE_MIN_MMAP
)
203 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
204 cache
= mmap (0, size
, PROT_READ
, MAP_SHARED
, fd
, 0);
205 #elif defined(_WIN32)
210 hFileMap
= CreateFileMapping((HANDLE
) _get_osfhandle(fd
), NULL
,
211 PAGE_READONLY
, 0, 0, NULL
);
212 if (hFileMap
!= NULL
)
214 cache
= MapViewOfFile (hFileMap
, FILE_MAP_READ
, 0, 0, size
);
215 CloseHandle (hFileMap
);
222 cache
= malloc (size
);
226 if (read (fd
, cache
, size
) != size
)
233 if (cache
->magic
!= FC_CACHE_MAGIC_MMAP
||
234 cache
->version
!= FC_CACHE_CONTENT_VERSION
||
241 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
242 munmap (cache
, size
);
243 #elif defined(_WIN32)
244 UnmapViewOfFile (cache
);
250 /* Mark allocated caches so they're freed rather than unmapped */
252 cache
->magic
= FC_CACHE_MAGIC_ALLOC
;
258 FcDirCacheUnload (FcCache
*cache
)
260 switch (cache
->magic
) {
261 case FC_CACHE_MAGIC_ALLOC
:
264 case FC_CACHE_MAGIC_MMAP
:
265 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
266 munmap (cache
, cache
->size
);
267 #elif defined(_WIN32)
268 UnmapViewOfFile (cache
);
275 FcDirCacheMapHelper (int fd
, off_t size
, void *closure
)
277 FcCache
*cache
= FcDirCacheMapFd (fd
, size
);
281 *((FcCache
**) closure
) = cache
;
286 FcDirCacheLoad (const FcChar8
*dir
, FcConfig
*config
, FcChar8
**cache_file
)
288 FcCache
*cache
= NULL
;
290 if (!FcDirCacheProcess (config
, dir
,
298 FcDirCacheLoadFile (const FcChar8
*cache_file
, struct stat
*file_stat
)
303 fd
= FcDirCacheOpenFile (cache_file
, file_stat
);
306 cache
= FcDirCacheMapFd (fd
, file_stat
->st_size
);
312 * Validate a cache file by reading the header and checking
313 * the magic number and the size field
316 FcDirCacheValidateHelper (int fd
, off_t size
, void *closure
)
320 struct stat file_stat
;
322 if (read (fd
, &c
, sizeof (FcCache
)) != sizeof (FcCache
))
324 else if (c
.magic
!= FC_CACHE_MAGIC_MMAP
)
326 else if (c
.version
!= FC_CACHE_CONTENT_VERSION
)
328 else if (fstat (fd
, &file_stat
) < 0)
330 else if (file_stat
.st_size
!= c
.size
)
336 FcDirCacheValidConfig (const FcChar8
*dir
, FcConfig
*config
)
338 return FcDirCacheProcess (config
, dir
,
339 FcDirCacheValidateHelper
,
344 FcDirCacheValid (const FcChar8
*dir
)
348 config
= FcConfigGetCurrent ();
352 return FcDirCacheValidConfig (dir
, config
);
356 * Build a cache structure from the given contents
359 FcDirCacheBuild (FcFontSet
*set
, const FcChar8
*dir
, FcStrSet
*dirs
)
361 FcSerialize
*serialize
= FcSerializeCreate ();
364 intptr_t cache_offset
;
365 intptr_t dirs_offset
;
366 FcChar8
*dir_serialize
;
367 intptr_t *dirs_serialize
;
368 FcFontSet
*set_serialize
;
373 * Space for cache structure
375 cache_offset
= FcSerializeReserve (serialize
, sizeof (FcCache
));
379 if (!FcStrSerializeAlloc (serialize
, dir
))
384 dirs_offset
= FcSerializeAlloc (serialize
, dirs
, dirs
->num
* sizeof (FcChar8
*));
385 for (i
= 0; i
< dirs
->num
; i
++)
386 if (!FcStrSerializeAlloc (serialize
, dirs
->strs
[i
]))
392 if (!FcFontSetSerializeAlloc (serialize
, set
))
395 /* Serialize layout complete. Now allocate space and fill it */
396 cache
= malloc (serialize
->size
);
399 /* shut up valgrind */
400 memset (cache
, 0, serialize
->size
);
402 serialize
->linear
= cache
;
404 cache
->magic
= FC_CACHE_MAGIC_ALLOC
;
405 cache
->version
= FC_CACHE_CONTENT_VERSION
;
406 cache
->size
= serialize
->size
;
409 * Serialize directory name
411 dir_serialize
= FcStrSerialize (serialize
, dir
);
414 cache
->dir
= FcPtrToOffset (cache
, dir_serialize
);
419 dirs_serialize
= FcSerializePtr (serialize
, dirs
);
422 cache
->dirs
= FcPtrToOffset (cache
, dirs_serialize
);
423 cache
->dirs_count
= dirs
->num
;
424 for (i
= 0; i
< dirs
->num
; i
++)
426 FcChar8
*d_serialize
= FcStrSerialize (serialize
, dirs
->strs
[i
]);
429 dirs_serialize
[i
] = FcPtrToOffset (dirs_serialize
, d_serialize
);
435 set_serialize
= FcFontSetSerialize (serialize
, set
);
438 cache
->set
= FcPtrToOffset (cache
, set_serialize
);
440 FcSerializeDestroy (serialize
);
447 FcSerializeDestroy (serialize
);
452 FcMakeDirectory (const FcChar8
*dir
)
457 if (strlen ((char *) dir
) == 0)
460 parent
= FcStrDirname (dir
);
463 if (access ((char *) parent
, W_OK
|X_OK
) == 0)
464 ret
= mkdir ((char *) dir
, 0777) == 0;
465 else if (access ((char *) parent
, F_OK
) == -1)
466 ret
= FcMakeDirectory (parent
) && (mkdir ((char *) dir
, 0777) == 0);
473 /* write serialized state to the cache file */
475 FcDirCacheWrite (FcCache
*cache
, FcConfig
*config
)
477 FcChar8
*dir
= FcCacheDir (cache
);
478 FcChar8 cache_base
[CACHEBASE_LEN
];
479 FcChar8
*cache_hashed
;
483 FcChar8
*cache_dir
= NULL
;
489 * Write it to the first directory in the list which is writable
492 list
= FcStrListCreate (config
->cacheDirs
);
495 while ((test_dir
= FcStrListNext (list
))) {
496 if (access ((char *) test_dir
, W_OK
|X_OK
) == 0)
498 cache_dir
= test_dir
;
504 * If the directory doesn't exist, try to create it
506 if (access ((char *) test_dir
, F_OK
) == -1) {
507 if (FcMakeDirectory (test_dir
))
509 cache_dir
= test_dir
;
515 FcStrListDone (list
);
519 FcDirCacheBasename (dir
, cache_base
);
520 cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
524 if (FcDebug () & FC_DBG_CACHE
)
525 printf ("FcDirCacheWriteDir dir \"%s\" file \"%s\"\n",
528 atomic
= FcAtomicCreate ((FcChar8
*)cache_hashed
);
532 if (!FcAtomicLock (atomic
))
535 fd
= open((char *)FcAtomicNewFile (atomic
), O_RDWR
| O_CREAT
| O_BINARY
, 0666);
539 /* Temporarily switch magic to MMAP while writing to file */
540 magic
= cache
->magic
;
541 if (magic
!= FC_CACHE_MAGIC_MMAP
)
542 cache
->magic
= FC_CACHE_MAGIC_MMAP
;
545 * Write cache contents to file
547 written
= write (fd
, cache
, cache
->size
);
549 /* Switch magic back */
550 if (magic
!= FC_CACHE_MAGIC_MMAP
)
551 cache
->magic
= magic
;
553 if (written
!= cache
->size
)
555 perror ("write cache");
560 if (!FcAtomicReplaceOrig(atomic
))
562 FcStrFree (cache_hashed
);
563 FcAtomicUnlock (atomic
);
564 FcAtomicDestroy (atomic
);
570 FcAtomicUnlock (atomic
);
572 FcAtomicDestroy (atomic
);
574 FcStrFree (cache_hashed
);
579 * This code implements the MD5 message-digest algorithm.
580 * The algorithm is due to Ron Rivest. This code was
581 * written by Colin Plumb in 1993, no copyright is claimed.
582 * This code is in the public domain; do with it what you wish.
584 * Equivalent code is available from RSA Data Security, Inc.
585 * This code has been tested against that, and is equivalent,
586 * except that you don't need to include two pages of legalese
589 * To compute the message digest of a chunk of bytes, declare an
590 * MD5Context structure, pass it to MD5Init, call MD5Update as
591 * needed on buffers full of bytes, and then call MD5Final, which
592 * will fill a supplied 16-byte array with the digest.
596 #define byteReverse(buf, len) /* Nothing */
599 * Note: this code is harmless on little-endian machines.
601 void byteReverse(unsigned char *buf
, unsigned longs
)
605 t
= (FcChar32
) ((unsigned) buf
[3] << 8 | buf
[2]) << 16 |
606 ((unsigned) buf
[1] << 8 | buf
[0]);
607 *(FcChar32
*) buf
= t
;
614 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
615 * initialization constants.
617 static void MD5Init(struct MD5Context
*ctx
)
619 ctx
->buf
[0] = 0x67452301;
620 ctx
->buf
[1] = 0xefcdab89;
621 ctx
->buf
[2] = 0x98badcfe;
622 ctx
->buf
[3] = 0x10325476;
629 * Update context to reflect the concatenation of another buffer full
632 static void MD5Update(struct MD5Context
*ctx
, unsigned char *buf
, unsigned len
)
636 /* Update bitcount */
639 if ((ctx
->bits
[0] = t
+ ((FcChar32
) len
<< 3)) < t
)
640 ctx
->bits
[1]++; /* Carry from low to high */
641 ctx
->bits
[1] += len
>> 29;
643 t
= (t
>> 3) & 0x3f; /* Bytes already in shsInfo->data */
645 /* Handle any leading odd-sized chunks */
648 unsigned char *p
= (unsigned char *) ctx
->in
+ t
;
656 byteReverse(ctx
->in
, 16);
657 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
661 /* Process data in 64-byte chunks */
664 memcpy(ctx
->in
, buf
, 64);
665 byteReverse(ctx
->in
, 16);
666 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
671 /* Handle any remaining bytes of data. */
673 memcpy(ctx
->in
, buf
, len
);
677 * Final wrapup - pad to 64-byte boundary with the bit pattern
678 * 1 0* (64-bit count of bits processed, MSB-first)
680 static void MD5Final(unsigned char digest
[16], struct MD5Context
*ctx
)
685 /* Compute number of bytes mod 64 */
686 count
= (ctx
->bits
[0] >> 3) & 0x3F;
688 /* Set the first char of padding to 0x80. This is safe since there is
689 always at least one byte free */
693 /* Bytes of padding needed to make 64 bytes */
694 count
= 64 - 1 - count
;
696 /* Pad out to 56 mod 64 */
698 /* Two lots of padding: Pad the first block to 64 bytes */
700 byteReverse(ctx
->in
, 16);
701 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
703 /* Now fill the next block with 56 bytes */
704 memset(ctx
->in
, 0, 56);
706 /* Pad block to 56 bytes */
707 memset(p
, 0, count
- 8);
709 byteReverse(ctx
->in
, 14);
711 /* Append length in bits and transform */
712 ((FcChar32
*) ctx
->in
)[14] = ctx
->bits
[0];
713 ((FcChar32
*) ctx
->in
)[15] = ctx
->bits
[1];
715 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
716 byteReverse((unsigned char *) ctx
->buf
, 4);
717 memcpy(digest
, ctx
->buf
, 16);
718 memset(ctx
, 0, sizeof(ctx
)); /* In case it's sensitive */
722 /* The four core functions - F1 is optimized somewhat */
724 /* #define F1(x, y, z) (x & y | ~x & z) */
725 #define F1(x, y, z) (z ^ (x & (y ^ z)))
726 #define F2(x, y, z) F1(z, x, y)
727 #define F3(x, y, z) (x ^ y ^ z)
728 #define F4(x, y, z) (y ^ (x | ~z))
730 /* This is the central step in the MD5 algorithm. */
731 #define MD5STEP(f, w, x, y, z, data, s) \
732 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
735 * The core of the MD5 algorithm, this alters an existing MD5 hash to
736 * reflect the addition of 16 longwords of new data. MD5Update blocks
737 * the data and converts bytes into longwords for this routine.
739 static void MD5Transform(FcChar32 buf
[4], FcChar32 in
[16])
741 register FcChar32 a
, b
, c
, d
;
748 MD5STEP(F1
, a
, b
, c
, d
, in
[0] + 0xd76aa478, 7);
749 MD5STEP(F1
, d
, a
, b
, c
, in
[1] + 0xe8c7b756, 12);
750 MD5STEP(F1
, c
, d
, a
, b
, in
[2] + 0x242070db, 17);
751 MD5STEP(F1
, b
, c
, d
, a
, in
[3] + 0xc1bdceee, 22);
752 MD5STEP(F1
, a
, b
, c
, d
, in
[4] + 0xf57c0faf, 7);
753 MD5STEP(F1
, d
, a
, b
, c
, in
[5] + 0x4787c62a, 12);
754 MD5STEP(F1
, c
, d
, a
, b
, in
[6] + 0xa8304613, 17);
755 MD5STEP(F1
, b
, c
, d
, a
, in
[7] + 0xfd469501, 22);
756 MD5STEP(F1
, a
, b
, c
, d
, in
[8] + 0x698098d8, 7);
757 MD5STEP(F1
, d
, a
, b
, c
, in
[9] + 0x8b44f7af, 12);
758 MD5STEP(F1
, c
, d
, a
, b
, in
[10] + 0xffff5bb1, 17);
759 MD5STEP(F1
, b
, c
, d
, a
, in
[11] + 0x895cd7be, 22);
760 MD5STEP(F1
, a
, b
, c
, d
, in
[12] + 0x6b901122, 7);
761 MD5STEP(F1
, d
, a
, b
, c
, in
[13] + 0xfd987193, 12);
762 MD5STEP(F1
, c
, d
, a
, b
, in
[14] + 0xa679438e, 17);
763 MD5STEP(F1
, b
, c
, d
, a
, in
[15] + 0x49b40821, 22);
765 MD5STEP(F2
, a
, b
, c
, d
, in
[1] + 0xf61e2562, 5);
766 MD5STEP(F2
, d
, a
, b
, c
, in
[6] + 0xc040b340, 9);
767 MD5STEP(F2
, c
, d
, a
, b
, in
[11] + 0x265e5a51, 14);
768 MD5STEP(F2
, b
, c
, d
, a
, in
[0] + 0xe9b6c7aa, 20);
769 MD5STEP(F2
, a
, b
, c
, d
, in
[5] + 0xd62f105d, 5);
770 MD5STEP(F2
, d
, a
, b
, c
, in
[10] + 0x02441453, 9);
771 MD5STEP(F2
, c
, d
, a
, b
, in
[15] + 0xd8a1e681, 14);
772 MD5STEP(F2
, b
, c
, d
, a
, in
[4] + 0xe7d3fbc8, 20);
773 MD5STEP(F2
, a
, b
, c
, d
, in
[9] + 0x21e1cde6, 5);
774 MD5STEP(F2
, d
, a
, b
, c
, in
[14] + 0xc33707d6, 9);
775 MD5STEP(F2
, c
, d
, a
, b
, in
[3] + 0xf4d50d87, 14);
776 MD5STEP(F2
, b
, c
, d
, a
, in
[8] + 0x455a14ed, 20);
777 MD5STEP(F2
, a
, b
, c
, d
, in
[13] + 0xa9e3e905, 5);
778 MD5STEP(F2
, d
, a
, b
, c
, in
[2] + 0xfcefa3f8, 9);
779 MD5STEP(F2
, c
, d
, a
, b
, in
[7] + 0x676f02d9, 14);
780 MD5STEP(F2
, b
, c
, d
, a
, in
[12] + 0x8d2a4c8a, 20);
782 MD5STEP(F3
, a
, b
, c
, d
, in
[5] + 0xfffa3942, 4);
783 MD5STEP(F3
, d
, a
, b
, c
, in
[8] + 0x8771f681, 11);
784 MD5STEP(F3
, c
, d
, a
, b
, in
[11] + 0x6d9d6122, 16);
785 MD5STEP(F3
, b
, c
, d
, a
, in
[14] + 0xfde5380c, 23);
786 MD5STEP(F3
, a
, b
, c
, d
, in
[1] + 0xa4beea44, 4);
787 MD5STEP(F3
, d
, a
, b
, c
, in
[4] + 0x4bdecfa9, 11);
788 MD5STEP(F3
, c
, d
, a
, b
, in
[7] + 0xf6bb4b60, 16);
789 MD5STEP(F3
, b
, c
, d
, a
, in
[10] + 0xbebfbc70, 23);
790 MD5STEP(F3
, a
, b
, c
, d
, in
[13] + 0x289b7ec6, 4);
791 MD5STEP(F3
, d
, a
, b
, c
, in
[0] + 0xeaa127fa, 11);
792 MD5STEP(F3
, c
, d
, a
, b
, in
[3] + 0xd4ef3085, 16);
793 MD5STEP(F3
, b
, c
, d
, a
, in
[6] + 0x04881d05, 23);
794 MD5STEP(F3
, a
, b
, c
, d
, in
[9] + 0xd9d4d039, 4);
795 MD5STEP(F3
, d
, a
, b
, c
, in
[12] + 0xe6db99e5, 11);
796 MD5STEP(F3
, c
, d
, a
, b
, in
[15] + 0x1fa27cf8, 16);
797 MD5STEP(F3
, b
, c
, d
, a
, in
[2] + 0xc4ac5665, 23);
799 MD5STEP(F4
, a
, b
, c
, d
, in
[0] + 0xf4292244, 6);
800 MD5STEP(F4
, d
, a
, b
, c
, in
[7] + 0x432aff97, 10);
801 MD5STEP(F4
, c
, d
, a
, b
, in
[14] + 0xab9423a7, 15);
802 MD5STEP(F4
, b
, c
, d
, a
, in
[5] + 0xfc93a039, 21);
803 MD5STEP(F4
, a
, b
, c
, d
, in
[12] + 0x655b59c3, 6);
804 MD5STEP(F4
, d
, a
, b
, c
, in
[3] + 0x8f0ccc92, 10);
805 MD5STEP(F4
, c
, d
, a
, b
, in
[10] + 0xffeff47d, 15);
806 MD5STEP(F4
, b
, c
, d
, a
, in
[1] + 0x85845dd1, 21);
807 MD5STEP(F4
, a
, b
, c
, d
, in
[8] + 0x6fa87e4f, 6);
808 MD5STEP(F4
, d
, a
, b
, c
, in
[15] + 0xfe2ce6e0, 10);
809 MD5STEP(F4
, c
, d
, a
, b
, in
[6] + 0xa3014314, 15);
810 MD5STEP(F4
, b
, c
, d
, a
, in
[13] + 0x4e0811a1, 21);
811 MD5STEP(F4
, a
, b
, c
, d
, in
[4] + 0xf7537e82, 6);
812 MD5STEP(F4
, d
, a
, b
, c
, in
[11] + 0xbd3af235, 10);
813 MD5STEP(F4
, c
, d
, a
, b
, in
[2] + 0x2ad7d2bb, 15);
814 MD5STEP(F4
, b
, c
, d
, a
, in
[9] + 0xeb86d391, 21);