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, size
);
458 CloseHandle (hFileMap
);
465 cache
= malloc (fd_stat
->st_size
);
469 if (read (fd
, cache
, fd_stat
->st_size
) != fd_stat
->st_size
)
476 if (cache
->magic
!= FC_CACHE_MAGIC_MMAP
||
477 cache
->version
< FC_CACHE_CONTENT_VERSION
||
478 cache
->size
!= fd_stat
->st_size
||
479 !FcCacheInsert (cache
, fd_stat
))
485 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
486 munmap (cache
, fd_stat
->st_size
);
487 #elif defined(_WIN32)
488 UnmapViewOfFile (cache
);
494 /* Mark allocated caches so they're freed rather than unmapped */
496 cache
->magic
= FC_CACHE_MAGIC_ALLOC
;
502 FcDirCacheReference (FcCache
*cache
, int nref
)
504 FcCacheSkip
*skip
= FcCacheFindByAddr (cache
);
511 FcDirCacheUnload (FcCache
*cache
)
513 FcCacheObjectDereference (cache
);
517 FcDirCacheMapHelper (int fd
, struct stat
*fd_stat
, void *closure
)
519 FcCache
*cache
= FcDirCacheMapFd (fd
, fd_stat
);
523 *((FcCache
**) closure
) = cache
;
528 FcDirCacheLoad (const FcChar8
*dir
, FcConfig
*config
, FcChar8
**cache_file
)
530 FcCache
*cache
= NULL
;
532 if (!FcDirCacheProcess (config
, dir
,
540 FcDirCacheLoadFile (const FcChar8
*cache_file
, struct stat
*file_stat
)
545 fd
= FcDirCacheOpenFile (cache_file
, file_stat
);
548 cache
= FcDirCacheMapFd (fd
, file_stat
);
554 * Validate a cache file by reading the header and checking
555 * the magic number and the size field
558 FcDirCacheValidateHelper (int fd
, struct stat
*fd_stat
, void *closure
)
563 if (read (fd
, &c
, sizeof (FcCache
)) != sizeof (FcCache
))
565 else if (c
.magic
!= FC_CACHE_MAGIC_MMAP
)
567 else if (c
.version
< FC_CACHE_CONTENT_VERSION
)
569 else if (fd_stat
->st_size
!= c
.size
)
575 FcDirCacheValidConfig (const FcChar8
*dir
, FcConfig
*config
)
577 return FcDirCacheProcess (config
, dir
,
578 FcDirCacheValidateHelper
,
583 FcDirCacheValid (const FcChar8
*dir
)
587 config
= FcConfigGetCurrent ();
591 return FcDirCacheValidConfig (dir
, config
);
595 * Build a cache structure from the given contents
598 FcDirCacheBuild (FcFontSet
*set
, const FcChar8
*dir
, FcStrSet
*dirs
)
600 FcSerialize
*serialize
= FcSerializeCreate ();
603 intptr_t cache_offset
;
604 intptr_t dirs_offset
;
605 FcChar8
*dir_serialize
;
606 intptr_t *dirs_serialize
;
607 FcFontSet
*set_serialize
;
612 * Space for cache structure
614 cache_offset
= FcSerializeReserve (serialize
, sizeof (FcCache
));
618 if (!FcStrSerializeAlloc (serialize
, dir
))
623 dirs_offset
= FcSerializeAlloc (serialize
, dirs
, dirs
->num
* sizeof (FcChar8
*));
624 for (i
= 0; i
< dirs
->num
; i
++)
625 if (!FcStrSerializeAlloc (serialize
, dirs
->strs
[i
]))
631 if (!FcFontSetSerializeAlloc (serialize
, set
))
634 /* Serialize layout complete. Now allocate space and fill it */
635 cache
= malloc (serialize
->size
);
638 /* shut up valgrind */
639 memset (cache
, 0, serialize
->size
);
641 serialize
->linear
= cache
;
643 cache
->magic
= FC_CACHE_MAGIC_ALLOC
;
644 cache
->version
= FC_CACHE_CONTENT_VERSION
;
645 cache
->size
= serialize
->size
;
648 * Serialize directory name
650 dir_serialize
= FcStrSerialize (serialize
, dir
);
653 cache
->dir
= FcPtrToOffset (cache
, dir_serialize
);
658 dirs_serialize
= FcSerializePtr (serialize
, dirs
);
661 cache
->dirs
= FcPtrToOffset (cache
, dirs_serialize
);
662 cache
->dirs_count
= dirs
->num
;
663 for (i
= 0; i
< dirs
->num
; i
++)
665 FcChar8
*d_serialize
= FcStrSerialize (serialize
, dirs
->strs
[i
]);
668 dirs_serialize
[i
] = FcPtrToOffset (dirs_serialize
, d_serialize
);
674 set_serialize
= FcFontSetSerialize (serialize
, set
);
677 cache
->set
= FcPtrToOffset (cache
, set_serialize
);
679 FcSerializeDestroy (serialize
);
681 FcCacheInsert (cache
, NULL
);
688 FcSerializeDestroy (serialize
);
693 FcMakeDirectory (const FcChar8
*dir
)
698 if (strlen ((char *) dir
) == 0)
701 parent
= FcStrDirname (dir
);
704 if (access ((char *) parent
, W_OK
|X_OK
) == 0)
705 ret
= mkdir ((char *) dir
, 0777) == 0;
706 else if (access ((char *) parent
, F_OK
) == -1)
707 ret
= FcMakeDirectory (parent
) && (mkdir ((char *) dir
, 0777) == 0);
714 /* write serialized state to the cache file */
716 FcDirCacheWrite (FcCache
*cache
, FcConfig
*config
)
718 FcChar8
*dir
= FcCacheDir (cache
);
719 FcChar8 cache_base
[CACHEBASE_LEN
];
720 FcChar8
*cache_hashed
;
724 FcChar8
*cache_dir
= NULL
;
730 * Write it to the first directory in the list which is writable
733 list
= FcStrListCreate (config
->cacheDirs
);
736 while ((test_dir
= FcStrListNext (list
))) {
737 if (access ((char *) test_dir
, W_OK
|X_OK
) == 0)
739 cache_dir
= test_dir
;
745 * If the directory doesn't exist, try to create it
747 if (access ((char *) test_dir
, F_OK
) == -1) {
748 if (FcMakeDirectory (test_dir
))
750 cache_dir
= test_dir
;
756 FcStrListDone (list
);
760 FcDirCacheBasename (dir
, cache_base
);
761 cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
765 if (FcDebug () & FC_DBG_CACHE
)
766 printf ("FcDirCacheWriteDir dir \"%s\" file \"%s\"\n",
769 atomic
= FcAtomicCreate ((FcChar8
*)cache_hashed
);
773 if (!FcAtomicLock (atomic
))
776 fd
= open((char *)FcAtomicNewFile (atomic
), O_RDWR
| O_CREAT
| O_BINARY
, 0666);
780 /* Temporarily switch magic to MMAP while writing to file */
781 magic
= cache
->magic
;
782 if (magic
!= FC_CACHE_MAGIC_MMAP
)
783 cache
->magic
= FC_CACHE_MAGIC_MMAP
;
786 * Write cache contents to file
788 written
= write (fd
, cache
, cache
->size
);
790 /* Switch magic back */
791 if (magic
!= FC_CACHE_MAGIC_MMAP
)
792 cache
->magic
= magic
;
794 if (written
!= cache
->size
)
796 perror ("write cache");
801 if (!FcAtomicReplaceOrig(atomic
))
803 FcStrFree (cache_hashed
);
804 FcAtomicUnlock (atomic
);
805 FcAtomicDestroy (atomic
);
811 FcAtomicUnlock (atomic
);
813 FcAtomicDestroy (atomic
);
815 FcStrFree (cache_hashed
);
820 * Hokey little macro trick to permit the definitions of C functions
821 * with the same name as CPP macros
823 #define args(x...) (x)
826 FcCacheDir
args(const FcCache
*c
)
828 return FcCacheDir (c
);
832 FcCacheCopySet
args(const FcCache
*c
)
834 FcFontSet
*old
= FcCacheSet (c
);
835 FcFontSet
*new = FcFontSetCreate ();
840 for (i
= 0; i
< old
->nfont
; i
++)
842 FcPattern
*font
= FcFontSetFont (old
, i
);
844 FcPatternReference (font
);
845 if (!FcFontSetAdd (new, font
))
847 FcFontSetDestroy (new);
855 FcCacheSubdir
args(const FcCache
*c
, int i
)
857 return FcCacheSubdir (c
, i
);
861 FcCacheNumSubdir
args(const FcCache
*c
)
863 return c
->dirs_count
;
867 FcCacheNumFont
args(const FcCache
*c
)
869 return FcCacheSet(c
)->nfont
;
873 * This code implements the MD5 message-digest algorithm.
874 * The algorithm is due to Ron Rivest. This code was
875 * written by Colin Plumb in 1993, no copyright is claimed.
876 * This code is in the public domain; do with it what you wish.
878 * Equivalent code is available from RSA Data Security, Inc.
879 * This code has been tested against that, and is equivalent,
880 * except that you don't need to include two pages of legalese
883 * To compute the message digest of a chunk of bytes, declare an
884 * MD5Context structure, pass it to MD5Init, call MD5Update as
885 * needed on buffers full of bytes, and then call MD5Final, which
886 * will fill a supplied 16-byte array with the digest.
890 #define byteReverse(buf, len) /* Nothing */
893 * Note: this code is harmless on little-endian machines.
895 void byteReverse(unsigned char *buf
, unsigned longs
)
899 t
= (FcChar32
) ((unsigned) buf
[3] << 8 | buf
[2]) << 16 |
900 ((unsigned) buf
[1] << 8 | buf
[0]);
901 *(FcChar32
*) buf
= t
;
908 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
909 * initialization constants.
911 static void MD5Init(struct MD5Context
*ctx
)
913 ctx
->buf
[0] = 0x67452301;
914 ctx
->buf
[1] = 0xefcdab89;
915 ctx
->buf
[2] = 0x98badcfe;
916 ctx
->buf
[3] = 0x10325476;
923 * Update context to reflect the concatenation of another buffer full
926 static void MD5Update(struct MD5Context
*ctx
, unsigned char *buf
, unsigned len
)
930 /* Update bitcount */
933 if ((ctx
->bits
[0] = t
+ ((FcChar32
) len
<< 3)) < t
)
934 ctx
->bits
[1]++; /* Carry from low to high */
935 ctx
->bits
[1] += len
>> 29;
937 t
= (t
>> 3) & 0x3f; /* Bytes already in shsInfo->data */
939 /* Handle any leading odd-sized chunks */
942 unsigned char *p
= (unsigned char *) ctx
->in
+ t
;
950 byteReverse(ctx
->in
, 16);
951 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
955 /* Process data in 64-byte chunks */
958 memcpy(ctx
->in
, buf
, 64);
959 byteReverse(ctx
->in
, 16);
960 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
965 /* Handle any remaining bytes of data. */
967 memcpy(ctx
->in
, buf
, len
);
971 * Final wrapup - pad to 64-byte boundary with the bit pattern
972 * 1 0* (64-bit count of bits processed, MSB-first)
974 static void MD5Final(unsigned char digest
[16], struct MD5Context
*ctx
)
979 /* Compute number of bytes mod 64 */
980 count
= (ctx
->bits
[0] >> 3) & 0x3F;
982 /* Set the first char of padding to 0x80. This is safe since there is
983 always at least one byte free */
987 /* Bytes of padding needed to make 64 bytes */
988 count
= 64 - 1 - count
;
990 /* Pad out to 56 mod 64 */
992 /* Two lots of padding: Pad the first block to 64 bytes */
994 byteReverse(ctx
->in
, 16);
995 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
997 /* Now fill the next block with 56 bytes */
998 memset(ctx
->in
, 0, 56);
1000 /* Pad block to 56 bytes */
1001 memset(p
, 0, count
- 8);
1003 byteReverse(ctx
->in
, 14);
1005 /* Append length in bits and transform */
1006 ((FcChar32
*) ctx
->in
)[14] = ctx
->bits
[0];
1007 ((FcChar32
*) ctx
->in
)[15] = ctx
->bits
[1];
1009 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1010 byteReverse((unsigned char *) ctx
->buf
, 4);
1011 memcpy(digest
, ctx
->buf
, 16);
1012 memset(ctx
, 0, sizeof(ctx
)); /* In case it's sensitive */
1016 /* The four core functions - F1 is optimized somewhat */
1018 /* #define F1(x, y, z) (x & y | ~x & z) */
1019 #define F1(x, y, z) (z ^ (x & (y ^ z)))
1020 #define F2(x, y, z) F1(z, x, y)
1021 #define F3(x, y, z) (x ^ y ^ z)
1022 #define F4(x, y, z) (y ^ (x | ~z))
1024 /* This is the central step in the MD5 algorithm. */
1025 #define MD5STEP(f, w, x, y, z, data, s) \
1026 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
1029 * The core of the MD5 algorithm, this alters an existing MD5 hash to
1030 * reflect the addition of 16 longwords of new data. MD5Update blocks
1031 * the data and converts bytes into longwords for this routine.
1033 static void MD5Transform(FcChar32 buf
[4], FcChar32 in
[16])
1035 register FcChar32 a
, b
, c
, d
;
1042 MD5STEP(F1
, a
, b
, c
, d
, in
[0] + 0xd76aa478, 7);
1043 MD5STEP(F1
, d
, a
, b
, c
, in
[1] + 0xe8c7b756, 12);
1044 MD5STEP(F1
, c
, d
, a
, b
, in
[2] + 0x242070db, 17);
1045 MD5STEP(F1
, b
, c
, d
, a
, in
[3] + 0xc1bdceee, 22);
1046 MD5STEP(F1
, a
, b
, c
, d
, in
[4] + 0xf57c0faf, 7);
1047 MD5STEP(F1
, d
, a
, b
, c
, in
[5] + 0x4787c62a, 12);
1048 MD5STEP(F1
, c
, d
, a
, b
, in
[6] + 0xa8304613, 17);
1049 MD5STEP(F1
, b
, c
, d
, a
, in
[7] + 0xfd469501, 22);
1050 MD5STEP(F1
, a
, b
, c
, d
, in
[8] + 0x698098d8, 7);
1051 MD5STEP(F1
, d
, a
, b
, c
, in
[9] + 0x8b44f7af, 12);
1052 MD5STEP(F1
, c
, d
, a
, b
, in
[10] + 0xffff5bb1, 17);
1053 MD5STEP(F1
, b
, c
, d
, a
, in
[11] + 0x895cd7be, 22);
1054 MD5STEP(F1
, a
, b
, c
, d
, in
[12] + 0x6b901122, 7);
1055 MD5STEP(F1
, d
, a
, b
, c
, in
[13] + 0xfd987193, 12);
1056 MD5STEP(F1
, c
, d
, a
, b
, in
[14] + 0xa679438e, 17);
1057 MD5STEP(F1
, b
, c
, d
, a
, in
[15] + 0x49b40821, 22);
1059 MD5STEP(F2
, a
, b
, c
, d
, in
[1] + 0xf61e2562, 5);
1060 MD5STEP(F2
, d
, a
, b
, c
, in
[6] + 0xc040b340, 9);
1061 MD5STEP(F2
, c
, d
, a
, b
, in
[11] + 0x265e5a51, 14);
1062 MD5STEP(F2
, b
, c
, d
, a
, in
[0] + 0xe9b6c7aa, 20);
1063 MD5STEP(F2
, a
, b
, c
, d
, in
[5] + 0xd62f105d, 5);
1064 MD5STEP(F2
, d
, a
, b
, c
, in
[10] + 0x02441453, 9);
1065 MD5STEP(F2
, c
, d
, a
, b
, in
[15] + 0xd8a1e681, 14);
1066 MD5STEP(F2
, b
, c
, d
, a
, in
[4] + 0xe7d3fbc8, 20);
1067 MD5STEP(F2
, a
, b
, c
, d
, in
[9] + 0x21e1cde6, 5);
1068 MD5STEP(F2
, d
, a
, b
, c
, in
[14] + 0xc33707d6, 9);
1069 MD5STEP(F2
, c
, d
, a
, b
, in
[3] + 0xf4d50d87, 14);
1070 MD5STEP(F2
, b
, c
, d
, a
, in
[8] + 0x455a14ed, 20);
1071 MD5STEP(F2
, a
, b
, c
, d
, in
[13] + 0xa9e3e905, 5);
1072 MD5STEP(F2
, d
, a
, b
, c
, in
[2] + 0xfcefa3f8, 9);
1073 MD5STEP(F2
, c
, d
, a
, b
, in
[7] + 0x676f02d9, 14);
1074 MD5STEP(F2
, b
, c
, d
, a
, in
[12] + 0x8d2a4c8a, 20);
1076 MD5STEP(F3
, a
, b
, c
, d
, in
[5] + 0xfffa3942, 4);
1077 MD5STEP(F3
, d
, a
, b
, c
, in
[8] + 0x8771f681, 11);
1078 MD5STEP(F3
, c
, d
, a
, b
, in
[11] + 0x6d9d6122, 16);
1079 MD5STEP(F3
, b
, c
, d
, a
, in
[14] + 0xfde5380c, 23);
1080 MD5STEP(F3
, a
, b
, c
, d
, in
[1] + 0xa4beea44, 4);
1081 MD5STEP(F3
, d
, a
, b
, c
, in
[4] + 0x4bdecfa9, 11);
1082 MD5STEP(F3
, c
, d
, a
, b
, in
[7] + 0xf6bb4b60, 16);
1083 MD5STEP(F3
, b
, c
, d
, a
, in
[10] + 0xbebfbc70, 23);
1084 MD5STEP(F3
, a
, b
, c
, d
, in
[13] + 0x289b7ec6, 4);
1085 MD5STEP(F3
, d
, a
, b
, c
, in
[0] + 0xeaa127fa, 11);
1086 MD5STEP(F3
, c
, d
, a
, b
, in
[3] + 0xd4ef3085, 16);
1087 MD5STEP(F3
, b
, c
, d
, a
, in
[6] + 0x04881d05, 23);
1088 MD5STEP(F3
, a
, b
, c
, d
, in
[9] + 0xd9d4d039, 4);
1089 MD5STEP(F3
, d
, a
, b
, c
, in
[12] + 0xe6db99e5, 11);
1090 MD5STEP(F3
, c
, d
, a
, b
, in
[15] + 0x1fa27cf8, 16);
1091 MD5STEP(F3
, b
, c
, d
, a
, in
[2] + 0xc4ac5665, 23);
1093 MD5STEP(F4
, a
, b
, c
, d
, in
[0] + 0xf4292244, 6);
1094 MD5STEP(F4
, d
, a
, b
, c
, in
[7] + 0x432aff97, 10);
1095 MD5STEP(F4
, c
, d
, a
, b
, in
[14] + 0xab9423a7, 15);
1096 MD5STEP(F4
, b
, c
, d
, a
, in
[5] + 0xfc93a039, 21);
1097 MD5STEP(F4
, a
, b
, c
, d
, in
[12] + 0x655b59c3, 6);
1098 MD5STEP(F4
, d
, a
, b
, c
, in
[3] + 0x8f0ccc92, 10);
1099 MD5STEP(F4
, c
, d
, a
, b
, in
[10] + 0xffeff47d, 15);
1100 MD5STEP(F4
, b
, c
, d
, a
, in
[1] + 0x85845dd1, 21);
1101 MD5STEP(F4
, a
, b
, c
, d
, in
[8] + 0x6fa87e4f, 6);
1102 MD5STEP(F4
, d
, a
, b
, c
, in
[15] + 0xfe2ce6e0, 10);
1103 MD5STEP(F4
, c
, d
, a
, b
, in
[6] + 0xa3014314, 15);
1104 MD5STEP(F4
, b
, c
, d
, a
, in
[13] + 0x4e0811a1, 21);
1105 MD5STEP(F4
, a
, b
, c
, d
, in
[4] + 0xf7537e82, 6);
1106 MD5STEP(F4
, d
, a
, b
, c
, in
[11] + 0xbd3af235, 10);
1107 MD5STEP(F4
, c
, d
, a
, b
, in
[2] + 0x2ad7d2bb, 15);
1108 MD5STEP(F4
, b
, c
, d
, a
, in
[9] + 0xeb86d391, 21);
1116 #include "fcaliastail.h"