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, 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, (unsigned char *)dir, strlen ((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);
108 FcStrListDone (list);
109 /* return FcFalse if something went wrong */
116 FcDirCacheOpenFile (const FcChar8 *cache_file, struct stat *file_stat)
120 fd = open((char *) cache_file, O_RDONLY | O_BINARY);
123 if (fstat (fd, file_stat) < 0)
132 * Look for a cache file for the specified dir. Attempt
133 * to use each one we find, stopping when the callback
137 FcDirCacheProcess (FcConfig *config, const FcChar8 *dir,
138 FcBool (*callback) (int fd, struct stat *stat, void *closure),
139 void *closure, FcChar8 **cache_file_ret)
142 FcChar8 cache_base[CACHEBASE_LEN];
145 struct stat file_stat, dir_stat;
146 FcBool ret = FcFalse;
148 if (stat ((char *) dir, &dir_stat) < 0)
151 FcDirCacheBasename (dir, cache_base);
153 list = FcStrListCreate (config->cacheDirs);
157 while ((cache_dir = FcStrListNext (list)))
159 FcChar8 *cache_hashed = FcStrPlus (cache_dir, cache_base);
162 fd = FcDirCacheOpenFile (cache_hashed, &file_stat);
164 if (dir_stat.st_mtime <= file_stat.st_mtime)
166 ret = (*callback) (fd, &file_stat, closure);
170 *cache_file_ret = cache_hashed;
172 FcStrFree (cache_hashed);
179 FcStrFree (cache_hashed);
181 FcStrListDone (list);
186 #define FC_CACHE_MIN_MMAP 1024
189 * Skip list element, make sure the 'next' pointer is the last thing
190 * in the structure, it will be allocated large enough to hold all
191 * of the necessary pointers
194 typedef struct _FcCacheSkip FcCacheSkip;
196 struct _FcCacheSkip {
203 FcCacheSkip *next[1];
207 * The head of the skip list; pointers for every possible level
208 * in the skip list, plus the largest level in the list
211 #define FC_CACHE_MAX_LEVEL 16
213 static FcCacheSkip *fcCacheChains[FC_CACHE_MAX_LEVEL];
214 static int fcCacheMaxLevel;
217 # define FcRandom() random()
220 # define FcRandom() lrand48()
223 # define FcRandom() rand()
228 * Generate a random level number, distributed
229 * so that each level is 1/4 as likely as the one before
231 * Note that level numbers run 1 <= level <= MAX_LEVEL
236 /* tricky bit -- each bit is '1' 75% of the time */
237 long int bits = FcRandom () | FcRandom ();
240 while (++level < FC_CACHE_MAX_LEVEL)
250 * Insert cache into the list
253 FcCacheInsert (FcCache *cache, struct stat *cache_stat)
255 FcCacheSkip **update[FC_CACHE_MAX_LEVEL];
256 FcCacheSkip *s, **next;
260 * Find links along each chain
262 next = fcCacheChains;
263 for (i = fcCacheMaxLevel; --i >= 0; )
265 for (; (s = next[i]); next = s->next)
266 if (s->cache > cache)
268 update[i] = &next[i];
272 * Create new list element
274 level = random_level ();
275 if (level > fcCacheMaxLevel)
277 level = fcCacheMaxLevel + 1;
278 update[fcCacheMaxLevel] = &fcCacheChains[fcCacheMaxLevel];
279 fcCacheMaxLevel = level;
282 s = malloc (sizeof (FcCacheSkip) + (level - 1) * sizeof (FcCacheSkip *));
287 s->size = cache->size;
291 s->cache_dev = cache_stat->st_dev;
292 s->cache_ino = cache_stat->st_ino;
293 s->cache_mtime = cache_stat->st_mtime;
303 * Insert into all fcCacheChains
305 for (i = 0; i < level; i++)
307 s->next[i] = *update[i];
314 FcCacheFindByAddr (void *object)
317 FcCacheSkip **next = fcCacheChains;
321 * Walk chain pointers one level at a time
323 for (i = fcCacheMaxLevel; --i >= 0;)
324 while (next[i] && (char *) object >= ((char *) next[i]->cache + next[i]->size))
325 next = next[i]->next;
330 if (s && (char *) object < ((char *) s->cache + s->size))
336 FcCacheRemove (FcCache *cache)
338 FcCacheSkip **update[FC_CACHE_MAX_LEVEL];
339 FcCacheSkip *s, **next;
343 * Find links along each chain
345 next = fcCacheChains;
346 for (i = fcCacheMaxLevel; --i >= 0; )
348 for (; (s = next[i]); next = s->next)
349 if (s->cache >= cache)
351 update[i] = &next[i];
354 for (i = 0; i < fcCacheMaxLevel && *update[i] == s; i++)
355 *update[i] = s->next[i];
356 while (fcCacheMaxLevel > 0 && fcCacheChains[fcCacheMaxLevel - 1] == NULL)
362 FcCacheFindByStat (struct stat *cache_stat)
366 for (s = fcCacheChains[0]; s; s = s->next[0])
367 if (s->cache_dev == cache_stat->st_dev &&
368 s->cache_ino == cache_stat->st_ino &&
369 s->cache_mtime == cache_stat->st_mtime)
378 FcDirCacheDispose (FcCache *cache)
380 switch (cache->magic) {
381 case FC_CACHE_MAGIC_ALLOC:
384 case FC_CACHE_MAGIC_MMAP:
385 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
386 munmap (cache, cache->size);
387 #elif defined(_WIN32)
388 UnmapViewOfFile (cache);
392 FcCacheRemove (cache);
396 FcCacheObjectReference (void *object)
398 FcCacheSkip *skip = FcCacheFindByAddr (object);
405 FcCacheObjectDereference (void *object)
407 FcCacheSkip *skip = FcCacheFindByAddr (object);
413 FcDirCacheDispose (skip->cache);
422 for (i = 0; i < FC_CACHE_MAX_LEVEL; i++)
423 assert (fcCacheChains[i] == NULL);
424 assert (fcCacheMaxLevel == 0);
428 * Map a cache file into memory
431 FcDirCacheMapFd (int fd, struct stat *fd_stat)
434 FcBool allocated = FcFalse;
436 if (fd_stat->st_size < sizeof (FcCache))
438 cache = FcCacheFindByStat (fd_stat);
442 * For small cache files, just read them into memory
444 if (fd_stat->st_size >= FC_CACHE_MIN_MMAP)
446 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
447 cache = mmap (0, fd_stat->st_size, PROT_READ, MAP_SHARED, fd, 0);
448 #elif defined(_WIN32)
453 hFileMap = CreateFileMapping((HANDLE) _get_osfhandle(fd), NULL,
454 PAGE_READONLY, 0, 0, NULL);
455 if (hFileMap != NULL)
457 cache = MapViewOfFile (hFileMap, FILE_MAP_READ, 0, 0,
459 CloseHandle (hFileMap);
466 cache = malloc (fd_stat->st_size);
470 if (read (fd, cache, fd_stat->st_size) != fd_stat->st_size)
477 if (cache->magic != FC_CACHE_MAGIC_MMAP ||
478 cache->version < FC_CACHE_CONTENT_VERSION ||
479 cache->size != fd_stat->st_size ||
480 !FcCacheInsert (cache, fd_stat))
486 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
487 munmap (cache, fd_stat->st_size);
488 #elif defined(_WIN32)
489 UnmapViewOfFile (cache);
495 /* Mark allocated caches so they're freed rather than unmapped */
497 cache->magic = FC_CACHE_MAGIC_ALLOC;
503 FcDirCacheReference (FcCache *cache, int nref)
505 FcCacheSkip *skip = FcCacheFindByAddr (cache);
512 FcDirCacheUnload (FcCache *cache)
514 FcCacheObjectDereference (cache);
518 FcDirCacheMapHelper (int fd, struct stat *fd_stat, void *closure)
520 FcCache *cache = FcDirCacheMapFd (fd, fd_stat);
524 *((FcCache **) closure) = cache;
529 FcDirCacheLoad (const FcChar8 *dir, FcConfig *config, FcChar8 **cache_file)
531 FcCache *cache = NULL;
533 if (!FcDirCacheProcess (config, dir,
541 FcDirCacheLoadFile (const FcChar8 *cache_file, struct stat *file_stat)
546 fd = FcDirCacheOpenFile (cache_file, file_stat);
549 cache = FcDirCacheMapFd (fd, file_stat);
555 * Validate a cache file by reading the header and checking
556 * the magic number and the size field
559 FcDirCacheValidateHelper (int fd, struct stat *fd_stat, void *closure)
564 if (read (fd, &c, sizeof (FcCache)) != sizeof (FcCache))
566 else if (c.magic != FC_CACHE_MAGIC_MMAP)
568 else if (c.version < FC_CACHE_CONTENT_VERSION)
570 else if (fd_stat->st_size != c.size)
576 FcDirCacheValidConfig (const FcChar8 *dir, FcConfig *config)
578 return FcDirCacheProcess (config, dir,
579 FcDirCacheValidateHelper,
584 FcDirCacheValid (const FcChar8 *dir)
588 config = FcConfigGetCurrent ();
592 return FcDirCacheValidConfig (dir, config);
596 * Build a cache structure from the given contents
599 FcDirCacheBuild (FcFontSet *set, const FcChar8 *dir, FcStrSet *dirs)
601 FcSerialize *serialize = FcSerializeCreate ();
604 intptr_t cache_offset;
605 intptr_t dirs_offset;
606 FcChar8 *dir_serialize;
607 intptr_t *dirs_serialize;
608 FcFontSet *set_serialize;
613 * Space for cache structure
615 cache_offset = FcSerializeReserve (serialize, sizeof (FcCache));
619 if (!FcStrSerializeAlloc (serialize, dir))
624 dirs_offset = FcSerializeAlloc (serialize, dirs, dirs->num * sizeof (FcChar8 *));
625 for (i = 0; i < dirs->num; i++)
626 if (!FcStrSerializeAlloc (serialize, dirs->strs[i]))
632 if (!FcFontSetSerializeAlloc (serialize, set))
635 /* Serialize layout complete. Now allocate space and fill it */
636 cache = malloc (serialize->size);
639 /* shut up valgrind */
640 memset (cache, 0, serialize->size);
642 serialize->linear = cache;
644 cache->magic = FC_CACHE_MAGIC_ALLOC;
645 cache->version = FC_CACHE_CONTENT_VERSION;
646 cache->size = serialize->size;
649 * Serialize directory name
651 dir_serialize = FcStrSerialize (serialize, dir);
654 cache->dir = FcPtrToOffset (cache, dir_serialize);
659 dirs_serialize = FcSerializePtr (serialize, dirs);
662 cache->dirs = FcPtrToOffset (cache, dirs_serialize);
663 cache->dirs_count = dirs->num;
664 for (i = 0; i < dirs->num; i++)
666 FcChar8 *d_serialize = FcStrSerialize (serialize, dirs->strs[i]);
669 dirs_serialize[i] = FcPtrToOffset (dirs_serialize, d_serialize);
675 set_serialize = FcFontSetSerialize (serialize, set);
678 cache->set = FcPtrToOffset (cache, set_serialize);
680 FcSerializeDestroy (serialize);
682 FcCacheInsert (cache, NULL);
689 FcSerializeDestroy (serialize);
695 #define mkdir(path,mode) _mkdir(path)
699 FcMakeDirectory (const FcChar8 *dir)
704 if (strlen ((char *) dir) == 0)
707 parent = FcStrDirname (dir);
710 if (access ((char *) parent, W_OK|X_OK) == 0)
711 ret = mkdir ((char *) dir, 0777) == 0;
712 else if (access ((char *) parent, F_OK) == -1)
713 ret = FcMakeDirectory (parent) && (mkdir ((char *) dir, 0777) == 0);
720 /* write serialized state to the cache file */
722 FcDirCacheWrite (FcCache *cache, FcConfig *config)
724 FcChar8 *dir = FcCacheDir (cache);
725 FcChar8 cache_base[CACHEBASE_LEN];
726 FcChar8 *cache_hashed;
730 FcChar8 *cache_dir = NULL;
736 * Write it to the first directory in the list which is writable
739 list = FcStrListCreate (config->cacheDirs);
742 while ((test_dir = FcStrListNext (list))) {
743 if (access ((char *) test_dir, W_OK|X_OK) == 0)
745 cache_dir = test_dir;
751 * If the directory doesn't exist, try to create it
753 if (access ((char *) test_dir, F_OK) == -1) {
754 if (FcMakeDirectory (test_dir))
756 cache_dir = test_dir;
762 FcStrListDone (list);
766 FcDirCacheBasename (dir, cache_base);
767 cache_hashed = FcStrPlus (cache_dir, cache_base);
771 if (FcDebug () & FC_DBG_CACHE)
772 printf ("FcDirCacheWriteDir dir \"%s\" file \"%s\"\n",
775 atomic = FcAtomicCreate ((FcChar8 *)cache_hashed);
779 if (!FcAtomicLock (atomic))
782 fd = open((char *)FcAtomicNewFile (atomic), O_RDWR | O_CREAT | O_BINARY, 0666);
786 /* Temporarily switch magic to MMAP while writing to file */
787 magic = cache->magic;
788 if (magic != FC_CACHE_MAGIC_MMAP)
789 cache->magic = FC_CACHE_MAGIC_MMAP;
792 * Write cache contents to file
794 written = write (fd, cache, cache->size);
796 /* Switch magic back */
797 if (magic != FC_CACHE_MAGIC_MMAP)
798 cache->magic = magic;
800 if (written != cache->size)
802 perror ("write cache");
807 if (!FcAtomicReplaceOrig(atomic))
809 FcStrFree (cache_hashed);
810 FcAtomicUnlock (atomic);
811 FcAtomicDestroy (atomic);
817 FcAtomicUnlock (atomic);
819 FcAtomicDestroy (atomic);
821 FcStrFree (cache_hashed);
826 * Hokey little macro trick to permit the definitions of C functions
827 * with the same name as CPP macros
829 #define args(x...) (x)
832 FcCacheDir args(const FcCache *c)
834 return FcCacheDir (c);
838 FcCacheCopySet args(const FcCache *c)
840 FcFontSet *old = FcCacheSet (c);
841 FcFontSet *new = FcFontSetCreate ();
846 for (i = 0; i < old->nfont; i++)
848 FcPattern *font = FcFontSetFont (old, i);
850 FcPatternReference (font);
851 if (!FcFontSetAdd (new, font))
853 FcFontSetDestroy (new);
861 FcCacheSubdir args(const FcCache *c, int i)
863 return FcCacheSubdir (c, i);
867 FcCacheNumSubdir args(const FcCache *c)
869 return c->dirs_count;
873 FcCacheNumFont args(const FcCache *c)
875 return FcCacheSet(c)->nfont;
879 * This code implements the MD5 message-digest algorithm.
880 * The algorithm is due to Ron Rivest. This code was
881 * written by Colin Plumb in 1993, no copyright is claimed.
882 * This code is in the public domain; do with it what you wish.
884 * Equivalent code is available from RSA Data Security, Inc.
885 * This code has been tested against that, and is equivalent,
886 * except that you don't need to include two pages of legalese
889 * To compute the message digest of a chunk of bytes, declare an
890 * MD5Context structure, pass it to MD5Init, call MD5Update as
891 * needed on buffers full of bytes, and then call MD5Final, which
892 * will fill a supplied 16-byte array with the digest.
896 #define byteReverse(buf, len) /* Nothing */
899 * Note: this code is harmless on little-endian machines.
901 void byteReverse(unsigned char *buf, unsigned longs)
905 t = (FcChar32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
906 ((unsigned) buf[1] << 8 | buf[0]);
907 *(FcChar32 *) buf = t;
914 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
915 * initialization constants.
917 static void MD5Init(struct MD5Context *ctx)
919 ctx->buf[0] = 0x67452301;
920 ctx->buf[1] = 0xefcdab89;
921 ctx->buf[2] = 0x98badcfe;
922 ctx->buf[3] = 0x10325476;
929 * Update context to reflect the concatenation of another buffer full
932 static void MD5Update(struct MD5Context *ctx, unsigned char *buf, unsigned len)
936 /* Update bitcount */
939 if ((ctx->bits[0] = t + ((FcChar32) len << 3)) < t)
940 ctx->bits[1]++; /* Carry from low to high */
941 ctx->bits[1] += len >> 29;
943 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
945 /* Handle any leading odd-sized chunks */
948 unsigned char *p = (unsigned char *) ctx->in + t;
956 byteReverse(ctx->in, 16);
957 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
961 /* Process data in 64-byte chunks */
964 memcpy(ctx->in, buf, 64);
965 byteReverse(ctx->in, 16);
966 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
971 /* Handle any remaining bytes of data. */
973 memcpy(ctx->in, buf, len);
977 * Final wrapup - pad to 64-byte boundary with the bit pattern
978 * 1 0* (64-bit count of bits processed, MSB-first)
980 static void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
985 /* Compute number of bytes mod 64 */
986 count = (ctx->bits[0] >> 3) & 0x3F;
988 /* Set the first char of padding to 0x80. This is safe since there is
989 always at least one byte free */
993 /* Bytes of padding needed to make 64 bytes */
994 count = 64 - 1 - count;
996 /* Pad out to 56 mod 64 */
998 /* Two lots of padding: Pad the first block to 64 bytes */
1000 byteReverse(ctx->in, 16);
1001 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
1003 /* Now fill the next block with 56 bytes */
1004 memset(ctx->in, 0, 56);
1006 /* Pad block to 56 bytes */
1007 memset(p, 0, count - 8);
1009 byteReverse(ctx->in, 14);
1011 /* Append length in bits and transform */
1012 ((FcChar32 *) ctx->in)[14] = ctx->bits[0];
1013 ((FcChar32 *) ctx->in)[15] = ctx->bits[1];
1015 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
1016 byteReverse((unsigned char *) ctx->buf, 4);
1017 memcpy(digest, ctx->buf, 16);
1018 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
1022 /* The four core functions - F1 is optimized somewhat */
1024 /* #define F1(x, y, z) (x & y | ~x & z) */
1025 #define F1(x, y, z) (z ^ (x & (y ^ z)))
1026 #define F2(x, y, z) F1(z, x, y)
1027 #define F3(x, y, z) (x ^ y ^ z)
1028 #define F4(x, y, z) (y ^ (x | ~z))
1030 /* This is the central step in the MD5 algorithm. */
1031 #define MD5STEP(f, w, x, y, z, data, s) \
1032 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
1035 * The core of the MD5 algorithm, this alters an existing MD5 hash to
1036 * reflect the addition of 16 longwords of new data. MD5Update blocks
1037 * the data and converts bytes into longwords for this routine.
1039 static void MD5Transform(FcChar32 buf[4], FcChar32 in[16])
1041 register FcChar32 a, b, c, d;
1048 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
1049 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
1050 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
1051 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
1052 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
1053 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
1054 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
1055 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
1056 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
1057 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
1058 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
1059 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
1060 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
1061 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
1062 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
1063 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
1065 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
1066 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
1067 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
1068 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
1069 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
1070 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
1071 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
1072 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
1073 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
1074 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
1075 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
1076 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
1077 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
1078 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
1079 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
1080 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
1082 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
1083 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
1084 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
1085 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
1086 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
1087 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
1088 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
1089 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
1090 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
1091 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
1092 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
1093 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
1094 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
1095 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
1096 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
1097 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
1099 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
1100 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
1101 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
1102 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
1103 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
1104 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
1105 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
1106 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
1107 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
1108 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
1109 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
1110 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
1111 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
1112 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
1113 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
1114 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
1122 #include "fcaliastail.h"