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>
32 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
34 # include <sys/mman.h>
49 static void MD5Init(struct MD5Context *ctx);
50 static void MD5Update(struct MD5Context *ctx, const unsigned char *buf, unsigned len);
51 static void MD5Final(unsigned char digest[16], struct MD5Context *ctx);
52 static void MD5Transform(FcChar32 buf[4], FcChar32 in[16]);
54 #define CACHEBASE_LEN (1 + 32 + 1 + sizeof (FC_ARCHITECTURE) + sizeof (FC_CACHE_SUFFIX))
56 static const char bin2hex[] = { '0', '1', '2', '3',
62 FcDirCacheBasename (const FcChar8 * dir, FcChar8 cache_base[CACHEBASE_LEN])
64 unsigned char hash[16];
67 struct MD5Context ctx;
70 MD5Update (&ctx, (const unsigned char *)dir, strlen ((const char *) dir));
72 MD5Final (hash, &ctx);
75 hex_hash = cache_base + 1;
76 for (cnt = 0; cnt < 16; ++cnt)
78 hex_hash[2*cnt ] = bin2hex[hash[cnt] >> 4];
79 hex_hash[2*cnt+1] = bin2hex[hash[cnt] & 0xf];
82 strcat ((char *) cache_base, "-" FC_ARCHITECTURE FC_CACHE_SUFFIX);
88 FcDirCacheUnlink (const FcChar8 *dir, FcConfig *config)
90 FcChar8 *cache_hashed = NULL;
91 FcChar8 cache_base[CACHEBASE_LEN];
95 FcDirCacheBasename (dir, cache_base);
97 list = FcStrListCreate (config->cacheDirs);
101 while ((cache_dir = FcStrListNext (list)))
103 cache_hashed = FcStrPlus (cache_dir, cache_base);
106 (void) unlink ((char *) cache_hashed);
107 FcStrFree (cache_hashed);
109 FcStrListDone (list);
110 /* return FcFalse if something went wrong */
117 FcDirCacheOpenFile (const FcChar8 *cache_file, struct stat *file_stat)
121 fd = open((char *) cache_file, O_RDONLY | O_BINARY);
124 if (fstat (fd, file_stat) < 0)
133 * Look for a cache file for the specified dir. Attempt
134 * to use each one we find, stopping when the callback
138 FcDirCacheProcess (FcConfig *config, const FcChar8 *dir,
139 FcBool (*callback) (int fd, struct stat *fd_stat,
140 struct stat *dir_stat, void *closure),
141 void *closure, FcChar8 **cache_file_ret)
144 FcChar8 cache_base[CACHEBASE_LEN];
147 struct stat file_stat, dir_stat;
148 FcBool ret = FcFalse;
150 if (stat ((char *) dir, &dir_stat) < 0)
153 FcDirCacheBasename (dir, cache_base);
155 list = FcStrListCreate (config->cacheDirs);
159 while ((cache_dir = FcStrListNext (list)))
161 FcChar8 *cache_hashed = FcStrPlus (cache_dir, cache_base);
164 fd = FcDirCacheOpenFile (cache_hashed, &file_stat);
166 ret = (*callback) (fd, &file_stat, &dir_stat, closure);
171 *cache_file_ret = cache_hashed;
173 FcStrFree (cache_hashed);
177 FcStrFree (cache_hashed);
179 FcStrListDone (list);
184 #define FC_CACHE_MIN_MMAP 1024
187 * Skip list element, make sure the 'next' pointer is the last thing
188 * in the structure, it will be allocated large enough to hold all
189 * of the necessary pointers
192 typedef struct _FcCacheSkip FcCacheSkip;
194 struct _FcCacheSkip {
201 FcCacheSkip *next[1];
205 * The head of the skip list; pointers for every possible level
206 * in the skip list, plus the largest level in the list
209 #define FC_CACHE_MAX_LEVEL 16
211 static FcCacheSkip *fcCacheChains[FC_CACHE_MAX_LEVEL];
212 static int fcCacheMaxLevel;
215 # define FcRandom() random()
218 # define FcRandom() lrand48()
221 # define FcRandom() rand()
226 * Generate a random level number, distributed
227 * so that each level is 1/4 as likely as the one before
229 * Note that level numbers run 1 <= level <= MAX_LEVEL
234 /* tricky bit -- each bit is '1' 75% of the time */
235 long int bits = FcRandom () | FcRandom ();
238 while (++level < FC_CACHE_MAX_LEVEL)
248 * Insert cache into the list
251 FcCacheInsert (FcCache *cache, struct stat *cache_stat)
253 FcCacheSkip **update[FC_CACHE_MAX_LEVEL];
254 FcCacheSkip *s, **next;
258 * Find links along each chain
260 next = fcCacheChains;
261 for (i = fcCacheMaxLevel; --i >= 0; )
263 for (; (s = next[i]); next = s->next)
264 if (s->cache > cache)
266 update[i] = &next[i];
270 * Create new list element
272 level = random_level ();
273 if (level > fcCacheMaxLevel)
275 level = fcCacheMaxLevel + 1;
276 update[fcCacheMaxLevel] = &fcCacheChains[fcCacheMaxLevel];
277 fcCacheMaxLevel = level;
280 s = malloc (sizeof (FcCacheSkip) + (level - 1) * sizeof (FcCacheSkip *));
285 s->size = cache->size;
289 s->cache_dev = cache_stat->st_dev;
290 s->cache_ino = cache_stat->st_ino;
291 s->cache_mtime = cache_stat->st_mtime;
301 * Insert into all fcCacheChains
303 for (i = 0; i < level; i++)
305 s->next[i] = *update[i];
312 FcCacheFindByAddr (void *object)
315 FcCacheSkip **next = fcCacheChains;
319 * Walk chain pointers one level at a time
321 for (i = fcCacheMaxLevel; --i >= 0;)
322 while (next[i] && (char *) object >= ((char *) next[i]->cache + next[i]->size))
323 next = next[i]->next;
328 if (s && (char *) object < ((char *) s->cache + s->size))
334 FcCacheRemove (FcCache *cache)
336 FcCacheSkip **update[FC_CACHE_MAX_LEVEL];
337 FcCacheSkip *s, **next;
341 * Find links along each chain
343 next = fcCacheChains;
344 for (i = fcCacheMaxLevel; --i >= 0; )
346 for (; (s = next[i]); next = s->next)
347 if (s->cache >= cache)
349 update[i] = &next[i];
352 for (i = 0; i < fcCacheMaxLevel && *update[i] == s; i++)
353 *update[i] = s->next[i];
354 while (fcCacheMaxLevel > 0 && fcCacheChains[fcCacheMaxLevel - 1] == NULL)
360 FcCacheFindByStat (struct stat *cache_stat)
364 for (s = fcCacheChains[0]; s; s = s->next[0])
365 if (s->cache_dev == cache_stat->st_dev &&
366 s->cache_ino == cache_stat->st_ino &&
367 s->cache_mtime == cache_stat->st_mtime)
376 FcDirCacheDispose (FcCache *cache)
378 switch (cache->magic) {
379 case FC_CACHE_MAGIC_ALLOC:
382 case FC_CACHE_MAGIC_MMAP:
383 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
384 munmap (cache, cache->size);
385 #elif defined(_WIN32)
386 UnmapViewOfFile (cache);
390 FcCacheRemove (cache);
394 FcCacheObjectReference (void *object)
396 FcCacheSkip *skip = FcCacheFindByAddr (object);
403 FcCacheObjectDereference (void *object)
405 FcCacheSkip *skip = FcCacheFindByAddr (object);
411 FcDirCacheDispose (skip->cache);
420 for (i = 0; i < FC_CACHE_MAX_LEVEL; i++)
421 assert (fcCacheChains[i] == NULL);
422 assert (fcCacheMaxLevel == 0);
426 FcCacheTimeValid (FcCache *cache, struct stat *dir_stat)
428 struct stat dir_static;
432 if (stat ((const char *) FcCacheDir (cache), &dir_static) < 0)
434 dir_stat = &dir_static;
436 if (FcDebug () & FC_DBG_CACHE)
437 printf ("FcCacheTimeValid dir \"%s\" cache time %d dir time %d\n",
438 FcCacheDir (cache), cache->mtime, (int) dir_stat->st_mtime);
439 return cache->mtime == (int) dir_stat->st_mtime;
443 * Map a cache file into memory
446 FcDirCacheMapFd (int fd, struct stat *fd_stat, struct stat *dir_stat)
449 FcBool allocated = FcFalse;
451 if (fd_stat->st_size < sizeof (FcCache))
453 cache = FcCacheFindByStat (fd_stat);
457 * Lage cache files are mmap'ed, smaller cache files are read. This
458 * balances the system cost of mmap against per-process memory usage.
460 if (fd_stat->st_size >= FC_CACHE_MIN_MMAP)
462 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
463 cache = mmap (0, fd_stat->st_size, PROT_READ, MAP_SHARED, fd, 0);
464 #elif defined(_WIN32)
469 hFileMap = CreateFileMapping((HANDLE) _get_osfhandle(fd), NULL,
470 PAGE_READONLY, 0, 0, NULL);
471 if (hFileMap != NULL)
473 cache = MapViewOfFile (hFileMap, FILE_MAP_READ, 0, 0,
475 CloseHandle (hFileMap);
482 cache = malloc (fd_stat->st_size);
486 if (read (fd, cache, fd_stat->st_size) != fd_stat->st_size)
493 if (cache->magic != FC_CACHE_MAGIC_MMAP ||
494 cache->version < FC_CACHE_CONTENT_VERSION ||
495 cache->size != fd_stat->st_size ||
496 !FcCacheTimeValid (cache, dir_stat) ||
497 !FcCacheInsert (cache, fd_stat))
503 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
504 munmap (cache, fd_stat->st_size);
505 #elif defined(_WIN32)
506 UnmapViewOfFile (cache);
512 /* Mark allocated caches so they're freed rather than unmapped */
514 cache->magic = FC_CACHE_MAGIC_ALLOC;
520 FcDirCacheReference (FcCache *cache, int nref)
522 FcCacheSkip *skip = FcCacheFindByAddr (cache);
529 FcDirCacheUnload (FcCache *cache)
531 FcCacheObjectDereference (cache);
535 FcDirCacheMapHelper (int fd, struct stat *fd_stat, struct stat *dir_stat, void *closure)
537 FcCache *cache = FcDirCacheMapFd (fd, fd_stat, dir_stat);
541 *((FcCache **) closure) = cache;
546 FcDirCacheLoad (const FcChar8 *dir, FcConfig *config, FcChar8 **cache_file)
548 FcCache *cache = NULL;
550 if (!FcDirCacheProcess (config, dir,
558 FcDirCacheLoadFile (const FcChar8 *cache_file, struct stat *file_stat)
563 fd = FcDirCacheOpenFile (cache_file, file_stat);
566 cache = FcDirCacheMapFd (fd, file_stat, NULL);
572 * Validate a cache file by reading the header and checking
573 * the magic number and the size field
576 FcDirCacheValidateHelper (int fd, struct stat *fd_stat, struct stat *dir_stat, void *closure)
581 if (read (fd, &c, sizeof (FcCache)) != sizeof (FcCache))
583 else if (c.magic != FC_CACHE_MAGIC_MMAP)
585 else if (c.version < FC_CACHE_CONTENT_VERSION)
587 else if (fd_stat->st_size != c.size)
589 else if (c.mtime != (int) dir_stat->st_mtime)
595 FcDirCacheValidConfig (const FcChar8 *dir, FcConfig *config)
597 return FcDirCacheProcess (config, dir,
598 FcDirCacheValidateHelper,
603 FcDirCacheValid (const FcChar8 *dir)
607 config = FcConfigGetCurrent ();
611 return FcDirCacheValidConfig (dir, config);
615 * Build a cache structure from the given contents
618 FcDirCacheBuild (FcFontSet *set, const FcChar8 *dir, struct stat *dir_stat, FcStrSet *dirs)
620 FcSerialize *serialize = FcSerializeCreate ();
623 intptr_t cache_offset;
624 intptr_t dirs_offset;
625 FcChar8 *dir_serialize;
626 intptr_t *dirs_serialize;
627 FcFontSet *set_serialize;
632 * Space for cache structure
634 cache_offset = FcSerializeReserve (serialize, sizeof (FcCache));
638 if (!FcStrSerializeAlloc (serialize, dir))
643 dirs_offset = FcSerializeAlloc (serialize, dirs, dirs->num * sizeof (FcChar8 *));
644 for (i = 0; i < dirs->num; i++)
645 if (!FcStrSerializeAlloc (serialize, dirs->strs[i]))
651 if (!FcFontSetSerializeAlloc (serialize, set))
654 /* Serialize layout complete. Now allocate space and fill it */
655 cache = malloc (serialize->size);
658 /* shut up valgrind */
659 memset (cache, 0, serialize->size);
661 serialize->linear = cache;
663 cache->magic = FC_CACHE_MAGIC_ALLOC;
664 cache->version = FC_CACHE_CONTENT_VERSION;
665 cache->size = serialize->size;
666 cache->mtime = (int) dir_stat->st_mtime;
669 * Serialize directory name
671 dir_serialize = FcStrSerialize (serialize, dir);
674 cache->dir = FcPtrToOffset (cache, dir_serialize);
679 dirs_serialize = FcSerializePtr (serialize, dirs);
682 cache->dirs = FcPtrToOffset (cache, dirs_serialize);
683 cache->dirs_count = dirs->num;
684 for (i = 0; i < dirs->num; i++)
686 FcChar8 *d_serialize = FcStrSerialize (serialize, dirs->strs[i]);
689 dirs_serialize[i] = FcPtrToOffset (dirs_serialize, d_serialize);
695 set_serialize = FcFontSetSerialize (serialize, set);
698 cache->set = FcPtrToOffset (cache, set_serialize);
700 FcSerializeDestroy (serialize);
702 FcCacheInsert (cache, NULL);
709 FcSerializeDestroy (serialize);
715 #define mkdir(path,mode) _mkdir(path)
719 FcMakeDirectory (const FcChar8 *dir)
724 if (strlen ((char *) dir) == 0)
727 parent = FcStrDirname (dir);
730 if (access ((char *) parent, F_OK) == 0)
731 ret = mkdir ((char *) dir, 0777) == 0;
732 else if (access ((char *) parent, F_OK) == -1)
733 ret = FcMakeDirectory (parent) && (mkdir ((char *) dir, 0777) == 0);
740 /* write serialized state to the cache file */
742 FcDirCacheWrite (FcCache *cache, FcConfig *config)
744 FcChar8 *dir = FcCacheDir (cache);
745 FcChar8 cache_base[CACHEBASE_LEN];
746 FcChar8 *cache_hashed;
750 FcChar8 *cache_dir = NULL;
756 * Write it to the first directory in the list which is writable
759 list = FcStrListCreate (config->cacheDirs);
762 while ((test_dir = FcStrListNext (list))) {
763 if (access ((char *) test_dir, W_OK) == 0)
765 cache_dir = test_dir;
771 * If the directory doesn't exist, try to create it
773 if (access ((char *) test_dir, F_OK) == -1) {
774 if (FcMakeDirectory (test_dir))
776 cache_dir = test_dir;
782 FcStrListDone (list);
786 FcDirCacheBasename (dir, cache_base);
787 cache_hashed = FcStrPlus (cache_dir, cache_base);
791 if (FcDebug () & FC_DBG_CACHE)
792 printf ("FcDirCacheWriteDir dir \"%s\" file \"%s\"\n",
795 atomic = FcAtomicCreate ((FcChar8 *)cache_hashed);
799 if (!FcAtomicLock (atomic))
802 fd = open((char *)FcAtomicNewFile (atomic), O_RDWR | O_CREAT | O_BINARY, 0666);
806 /* Temporarily switch magic to MMAP while writing to file */
807 magic = cache->magic;
808 if (magic != FC_CACHE_MAGIC_MMAP)
809 cache->magic = FC_CACHE_MAGIC_MMAP;
812 * Write cache contents to file
814 written = write (fd, cache, cache->size);
816 /* Switch magic back */
817 if (magic != FC_CACHE_MAGIC_MMAP)
818 cache->magic = magic;
820 if (written != cache->size)
822 perror ("write cache");
827 if (!FcAtomicReplaceOrig(atomic))
829 FcStrFree (cache_hashed);
830 FcAtomicUnlock (atomic);
831 FcAtomicDestroy (atomic);
837 FcAtomicUnlock (atomic);
839 FcAtomicDestroy (atomic);
841 FcStrFree (cache_hashed);
846 * Hokey little macro trick to permit the definitions of C functions
847 * with the same name as CPP macros
850 #define args2(x,y) (x,y)
853 FcCacheDir args1(const FcCache *c)
855 return FcCacheDir (c);
859 FcCacheCopySet args1(const FcCache *c)
861 FcFontSet *old = FcCacheSet (c);
862 FcFontSet *new = FcFontSetCreate ();
867 for (i = 0; i < old->nfont; i++)
869 FcPattern *font = FcFontSetFont (old, i);
871 FcPatternReference (font);
872 if (!FcFontSetAdd (new, font))
874 FcFontSetDestroy (new);
882 FcCacheSubdir args2(const FcCache *c, int i)
884 return FcCacheSubdir (c, i);
888 FcCacheNumSubdir args1(const FcCache *c)
890 return c->dirs_count;
894 FcCacheNumFont args1(const FcCache *c)
896 return FcCacheSet(c)->nfont;
900 * This code implements the MD5 message-digest algorithm.
901 * The algorithm is due to Ron Rivest. This code was
902 * written by Colin Plumb in 1993, no copyright is claimed.
903 * This code is in the public domain; do with it what you wish.
905 * Equivalent code is available from RSA Data Security, Inc.
906 * This code has been tested against that, and is equivalent,
907 * except that you don't need to include two pages of legalese
910 * To compute the message digest of a chunk of bytes, declare an
911 * MD5Context structure, pass it to MD5Init, call MD5Update as
912 * needed on buffers full of bytes, and then call MD5Final, which
913 * will fill a supplied 16-byte array with the digest.
917 #define byteReverse(buf, len) /* Nothing */
920 * Note: this code is harmless on little-endian machines.
922 void byteReverse(unsigned char *buf, unsigned longs)
926 t = (FcChar32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
927 ((unsigned) buf[1] << 8 | buf[0]);
928 *(FcChar32 *) buf = t;
935 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
936 * initialization constants.
938 static void MD5Init(struct MD5Context *ctx)
940 ctx->buf[0] = 0x67452301;
941 ctx->buf[1] = 0xefcdab89;
942 ctx->buf[2] = 0x98badcfe;
943 ctx->buf[3] = 0x10325476;
950 * Update context to reflect the concatenation of another buffer full
953 static void MD5Update(struct MD5Context *ctx, const unsigned char *buf, unsigned len)
957 /* Update bitcount */
960 if ((ctx->bits[0] = t + ((FcChar32) len << 3)) < t)
961 ctx->bits[1]++; /* Carry from low to high */
962 ctx->bits[1] += len >> 29;
964 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
966 /* Handle any leading odd-sized chunks */
969 unsigned char *p = (unsigned char *) ctx->in + t;
977 byteReverse(ctx->in, 16);
978 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
982 /* Process data in 64-byte chunks */
985 memcpy(ctx->in, buf, 64);
986 byteReverse(ctx->in, 16);
987 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
992 /* Handle any remaining bytes of data. */
994 memcpy(ctx->in, buf, len);
998 * Final wrapup - pad to 64-byte boundary with the bit pattern
999 * 1 0* (64-bit count of bits processed, MSB-first)
1001 static void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
1006 /* Compute number of bytes mod 64 */
1007 count = (ctx->bits[0] >> 3) & 0x3F;
1009 /* Set the first char of padding to 0x80. This is safe since there is
1010 always at least one byte free */
1011 p = ctx->in + count;
1014 /* Bytes of padding needed to make 64 bytes */
1015 count = 64 - 1 - count;
1017 /* Pad out to 56 mod 64 */
1019 /* Two lots of padding: Pad the first block to 64 bytes */
1020 memset(p, 0, count);
1021 byteReverse(ctx->in, 16);
1022 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
1024 /* Now fill the next block with 56 bytes */
1025 memset(ctx->in, 0, 56);
1027 /* Pad block to 56 bytes */
1028 memset(p, 0, count - 8);
1030 byteReverse(ctx->in, 14);
1032 /* Append length in bits and transform */
1033 ((FcChar32 *) ctx->in)[14] = ctx->bits[0];
1034 ((FcChar32 *) ctx->in)[15] = ctx->bits[1];
1036 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
1037 byteReverse((unsigned char *) ctx->buf, 4);
1038 memcpy(digest, ctx->buf, 16);
1039 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
1043 /* The four core functions - F1 is optimized somewhat */
1045 /* #define F1(x, y, z) (x & y | ~x & z) */
1046 #define F1(x, y, z) (z ^ (x & (y ^ z)))
1047 #define F2(x, y, z) F1(z, x, y)
1048 #define F3(x, y, z) (x ^ y ^ z)
1049 #define F4(x, y, z) (y ^ (x | ~z))
1051 /* This is the central step in the MD5 algorithm. */
1052 #define MD5STEP(f, w, x, y, z, data, s) \
1053 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
1056 * The core of the MD5 algorithm, this alters an existing MD5 hash to
1057 * reflect the addition of 16 longwords of new data. MD5Update blocks
1058 * the data and converts bytes into longwords for this routine.
1060 static void MD5Transform(FcChar32 buf[4], FcChar32 in[16])
1062 register FcChar32 a, b, c, d;
1069 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
1070 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
1071 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
1072 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
1073 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
1074 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
1075 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
1076 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
1077 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
1078 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
1079 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
1080 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
1081 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
1082 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
1083 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
1084 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
1086 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
1087 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
1088 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
1089 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
1090 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
1091 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
1092 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
1093 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
1094 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
1095 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
1096 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
1097 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
1098 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
1099 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
1100 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
1101 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
1103 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
1104 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
1105 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
1106 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
1107 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
1108 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
1109 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
1110 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
1111 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
1112 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
1113 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
1114 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
1115 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
1116 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
1117 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
1118 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
1120 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
1121 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
1122 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
1123 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
1124 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
1125 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
1126 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
1127 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
1128 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
1129 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
1130 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
1131 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
1132 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
1133 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
1134 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
1135 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
1143 #include "fcaliastail.h"