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 the author(s) not be used in
10 * advertising or publicity pertaining to distribution of the software without
11 * specific, written prior permission. The authors make no
12 * representations about the suitability of this software for any purpose. It
13 * is provided "as is" without express or implied warranty.
15 * THE AUTHOR(S) DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
16 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
17 * EVENT SHALL THE AUTHOR(S) 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.
30 #include <sys/types.h>
32 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
34 # include <sys/mman.h>
36 # define _WIN32_WINNT 0x0500
51 static void MD5Init(struct MD5Context
*ctx
);
52 static void MD5Update(struct MD5Context
*ctx
, const unsigned char *buf
, unsigned len
);
53 static void MD5Final(unsigned char digest
[16], struct MD5Context
*ctx
);
54 static void MD5Transform(FcChar32 buf
[4], FcChar32 in
[16]);
56 #define CACHEBASE_LEN (1 + 32 + 1 + sizeof (FC_ARCHITECTURE) + sizeof (FC_CACHE_SUFFIX))
63 typedef long long INT64
;
64 #define EPOCH_OFFSET 11644473600ll
66 #define EPOCH_OFFSET 11644473600i64
67 typedef __int64 INT64
;
70 /* Workaround for problems in the stat() in the Microsoft C library:
72 * 1) stat() uses FindFirstFile() to get the file
73 * attributes. Unfortunately this API doesn't return correct values
74 * for modification time of a directory until some time after a file
75 * or subdirectory has been added to the directory. (This causes
76 * run-test.sh to fail, for instance.) GetFileAttributesEx() is
77 * better, it returns the updated timestamp right away.
79 * 2) stat() does some strange things related to backward
80 * compatibility with the local time timestamps on FAT volumes and
81 * daylight saving time. This causes problems after the switches
82 * to/from daylight saving time. See
83 * http://bugzilla.gnome.org/show_bug.cgi?id=154968 , especially
84 * comment #30, and http://www.codeproject.com/datetime/dstbugs.asp .
85 * We don't need any of that, FAT and Win9x are as good as dead. So
86 * just use the UTC timestamps from NTFS, converted to the Unix epoch.
90 FcStat (const char *file
, struct stat
*statb
)
92 WIN32_FILE_ATTRIBUTE_DATA wfad
;
93 char full_path_name
[MAX_PATH
];
97 if (!GetFileAttributesEx (file
, GetFileExInfoStandard
, &wfad
))
102 /* Calculate a pseudo inode number as a hash of the full path name.
103 * Call GetLongPathName() to get the spelling of the path name as it
106 rc
= GetFullPathName (file
, sizeof (full_path_name
), full_path_name
, &basename
);
107 if (rc
== 0 || rc
> sizeof (full_path_name
))
110 rc
= GetLongPathName (full_path_name
, full_path_name
, sizeof (full_path_name
));
111 statb
->st_ino
= FcStringHash (full_path_name
);
113 statb
->st_mode
= _S_IREAD
| _S_IWRITE
;
114 statb
->st_mode
|= (statb
->st_mode
>> 3) | (statb
->st_mode
>> 6);
116 if (wfad
.dwFileAttributes
& FILE_ATTRIBUTE_DIRECTORY
)
117 statb
->st_mode
|= _S_IFDIR
;
119 statb
->st_mode
|= _S_IFREG
;
122 statb
->st_uid
= statb
->st_gid
= 0;
125 if (wfad
.nFileSizeHigh
> 0)
127 statb
->st_size
= wfad
.nFileSizeLow
;
129 statb
->st_atime
= (*(INT64
*)&wfad
.ftLastAccessTime
)/10000000 - EPOCH_OFFSET
;
130 statb
->st_mtime
= (*(INT64
*)&wfad
.ftLastWriteTime
)/10000000 - EPOCH_OFFSET
;
131 statb
->st_ctime
= statb
->st_mtime
;
137 static const char bin2hex
[] = { '0', '1', '2', '3',
140 'c', 'd', 'e', 'f' };
143 FcDirCacheBasename (const FcChar8
* dir
, FcChar8 cache_base
[CACHEBASE_LEN
])
145 unsigned char hash
[16];
148 struct MD5Context ctx
;
151 MD5Update (&ctx
, (const unsigned char *)dir
, strlen ((const char *) dir
));
153 MD5Final (hash
, &ctx
);
156 hex_hash
= cache_base
+ 1;
157 for (cnt
= 0; cnt
< 16; ++cnt
)
159 hex_hash
[2*cnt
] = bin2hex
[hash
[cnt
] >> 4];
160 hex_hash
[2*cnt
+1] = bin2hex
[hash
[cnt
] & 0xf];
163 strcat ((char *) cache_base
, "-" FC_ARCHITECTURE FC_CACHE_SUFFIX
);
169 FcDirCacheUnlink (const FcChar8
*dir
, FcConfig
*config
)
171 FcChar8
*cache_hashed
= NULL
;
172 FcChar8 cache_base
[CACHEBASE_LEN
];
176 FcDirCacheBasename (dir
, cache_base
);
178 list
= FcStrListCreate (config
->cacheDirs
);
182 while ((cache_dir
= FcStrListNext (list
)))
184 cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
187 (void) unlink ((char *) cache_hashed
);
188 FcStrFree (cache_hashed
);
190 FcStrListDone (list
);
191 /* return FcFalse if something went wrong */
198 FcDirCacheOpenFile (const FcChar8
*cache_file
, struct stat
*file_stat
)
203 if (FcStat (cache_file
, file_stat
) < 0)
206 fd
= open((char *) cache_file
, O_RDONLY
| O_BINARY
);
210 if (fstat (fd
, file_stat
) < 0)
220 * Look for a cache file for the specified dir. Attempt
221 * to use each one we find, stopping when the callback
225 FcDirCacheProcess (FcConfig
*config
, const FcChar8
*dir
,
226 FcBool (*callback
) (int fd
, struct stat
*fd_stat
,
227 struct stat
*dir_stat
, void *closure
),
228 void *closure
, FcChar8
**cache_file_ret
)
231 FcChar8 cache_base
[CACHEBASE_LEN
];
234 struct stat file_stat
, dir_stat
;
235 FcBool ret
= FcFalse
;
237 if (FcStat ((char *) dir
, &dir_stat
) < 0)
240 FcDirCacheBasename (dir
, cache_base
);
242 list
= FcStrListCreate (config
->cacheDirs
);
246 while ((cache_dir
= FcStrListNext (list
)))
248 FcChar8
*cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
251 fd
= FcDirCacheOpenFile (cache_hashed
, &file_stat
);
253 ret
= (*callback
) (fd
, &file_stat
, &dir_stat
, closure
);
258 *cache_file_ret
= cache_hashed
;
260 FcStrFree (cache_hashed
);
264 FcStrFree (cache_hashed
);
266 FcStrListDone (list
);
271 #define FC_CACHE_MIN_MMAP 1024
274 * Skip list element, make sure the 'next' pointer is the last thing
275 * in the structure, it will be allocated large enough to hold all
276 * of the necessary pointers
279 typedef struct _FcCacheSkip FcCacheSkip
;
281 struct _FcCacheSkip
{
288 FcCacheSkip
*next
[1];
292 * The head of the skip list; pointers for every possible level
293 * in the skip list, plus the largest level in the list
296 #define FC_CACHE_MAX_LEVEL 16
298 static FcCacheSkip
*fcCacheChains
[FC_CACHE_MAX_LEVEL
];
299 static int fcCacheMaxLevel
;
302 # define FcRandom() random()
305 # define FcRandom() lrand48()
308 # define FcRandom() rand()
313 * Generate a random level number, distributed
314 * so that each level is 1/4 as likely as the one before
316 * Note that level numbers run 1 <= level <= MAX_LEVEL
321 /* tricky bit -- each bit is '1' 75% of the time */
322 long int bits
= FcRandom () | FcRandom ();
325 while (++level
< FC_CACHE_MAX_LEVEL
)
335 * Insert cache into the list
338 FcCacheInsert (FcCache
*cache
, struct stat
*cache_stat
)
340 FcCacheSkip
**update
[FC_CACHE_MAX_LEVEL
];
341 FcCacheSkip
*s
, **next
;
345 * Find links along each chain
347 next
= fcCacheChains
;
348 for (i
= fcCacheMaxLevel
; --i
>= 0; )
350 for (; (s
= next
[i
]); next
= s
->next
)
351 if (s
->cache
> cache
)
353 update
[i
] = &next
[i
];
357 * Create new list element
359 level
= random_level ();
360 if (level
> fcCacheMaxLevel
)
362 level
= fcCacheMaxLevel
+ 1;
363 update
[fcCacheMaxLevel
] = &fcCacheChains
[fcCacheMaxLevel
];
364 fcCacheMaxLevel
= level
;
367 s
= malloc (sizeof (FcCacheSkip
) + (level
- 1) * sizeof (FcCacheSkip
*));
372 s
->size
= cache
->size
;
376 s
->cache_dev
= cache_stat
->st_dev
;
377 s
->cache_ino
= cache_stat
->st_ino
;
378 s
->cache_mtime
= cache_stat
->st_mtime
;
388 * Insert into all fcCacheChains
390 for (i
= 0; i
< level
; i
++)
392 s
->next
[i
] = *update
[i
];
399 FcCacheFindByAddr (void *object
)
402 FcCacheSkip
**next
= fcCacheChains
;
406 * Walk chain pointers one level at a time
408 for (i
= fcCacheMaxLevel
; --i
>= 0;)
409 while (next
[i
] && (char *) object
>= ((char *) next
[i
]->cache
+ next
[i
]->size
))
410 next
= next
[i
]->next
;
415 if (s
&& (char *) object
< ((char *) s
->cache
+ s
->size
))
421 FcCacheRemove (FcCache
*cache
)
423 FcCacheSkip
**update
[FC_CACHE_MAX_LEVEL
];
424 FcCacheSkip
*s
, **next
;
428 * Find links along each chain
430 next
= fcCacheChains
;
431 for (i
= fcCacheMaxLevel
; --i
>= 0; )
433 for (; (s
= next
[i
]); next
= s
->next
)
434 if (s
->cache
>= cache
)
436 update
[i
] = &next
[i
];
439 for (i
= 0; i
< fcCacheMaxLevel
&& *update
[i
] == s
; i
++)
440 *update
[i
] = s
->next
[i
];
441 while (fcCacheMaxLevel
> 0 && fcCacheChains
[fcCacheMaxLevel
- 1] == NULL
)
447 FcCacheFindByStat (struct stat
*cache_stat
)
451 for (s
= fcCacheChains
[0]; s
; s
= s
->next
[0])
452 if (s
->cache_dev
== cache_stat
->st_dev
&&
453 s
->cache_ino
== cache_stat
->st_ino
&&
454 s
->cache_mtime
== cache_stat
->st_mtime
)
463 FcDirCacheDispose (FcCache
*cache
)
465 switch (cache
->magic
) {
466 case FC_CACHE_MAGIC_ALLOC
:
469 case FC_CACHE_MAGIC_MMAP
:
470 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
471 munmap (cache
, cache
->size
);
472 #elif defined(_WIN32)
473 UnmapViewOfFile (cache
);
477 FcCacheRemove (cache
);
481 FcCacheObjectReference (void *object
)
483 FcCacheSkip
*skip
= FcCacheFindByAddr (object
);
490 FcCacheObjectDereference (void *object
)
492 FcCacheSkip
*skip
= FcCacheFindByAddr (object
);
498 FcDirCacheDispose (skip
->cache
);
507 for (i
= 0; i
< FC_CACHE_MAX_LEVEL
; i
++)
508 assert (fcCacheChains
[i
] == NULL
);
509 assert (fcCacheMaxLevel
== 0);
513 FcCacheTimeValid (FcCache
*cache
, struct stat
*dir_stat
)
515 struct stat dir_static
;
519 if (FcStat ((const char *) FcCacheDir (cache
), &dir_static
) < 0)
521 dir_stat
= &dir_static
;
523 if (FcDebug () & FC_DBG_CACHE
)
524 printf ("FcCacheTimeValid dir \"%s\" cache time %d dir time %d\n",
525 FcCacheDir (cache
), cache
->mtime
, (int) dir_stat
->st_mtime
);
526 return cache
->mtime
== (int) dir_stat
->st_mtime
;
530 * Map a cache file into memory
533 FcDirCacheMapFd (int fd
, struct stat
*fd_stat
, struct stat
*dir_stat
)
536 FcBool allocated
= FcFalse
;
538 if (fd_stat
->st_size
< sizeof (FcCache
))
540 cache
= FcCacheFindByStat (fd_stat
);
543 if (FcCacheTimeValid (cache
, dir_stat
))
545 FcDirCacheUnload (cache
);
550 * Lage cache files are mmap'ed, smaller cache files are read. This
551 * balances the system cost of mmap against per-process memory usage.
553 if (fd_stat
->st_size
>= FC_CACHE_MIN_MMAP
)
555 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
556 cache
= mmap (0, fd_stat
->st_size
, PROT_READ
, MAP_SHARED
, fd
, 0);
557 if (cache
== MAP_FAILED
)
559 #elif defined(_WIN32)
564 hFileMap
= CreateFileMapping((HANDLE
) _get_osfhandle(fd
), NULL
,
565 PAGE_READONLY
, 0, 0, NULL
);
566 if (hFileMap
!= NULL
)
568 cache
= MapViewOfFile (hFileMap
, FILE_MAP_READ
, 0, 0,
570 CloseHandle (hFileMap
);
577 cache
= malloc (fd_stat
->st_size
);
581 if (read (fd
, cache
, fd_stat
->st_size
) != fd_stat
->st_size
)
588 if (cache
->magic
!= FC_CACHE_MAGIC_MMAP
||
589 cache
->version
< FC_CACHE_CONTENT_VERSION
||
590 cache
->size
!= fd_stat
->st_size
||
591 !FcCacheTimeValid (cache
, dir_stat
) ||
592 !FcCacheInsert (cache
, fd_stat
))
598 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
599 munmap (cache
, fd_stat
->st_size
);
600 #elif defined(_WIN32)
601 UnmapViewOfFile (cache
);
607 /* Mark allocated caches so they're freed rather than unmapped */
609 cache
->magic
= FC_CACHE_MAGIC_ALLOC
;
615 FcDirCacheReference (FcCache
*cache
, int nref
)
617 FcCacheSkip
*skip
= FcCacheFindByAddr (cache
);
624 FcDirCacheUnload (FcCache
*cache
)
626 FcCacheObjectDereference (cache
);
630 FcDirCacheMapHelper (int fd
, struct stat
*fd_stat
, struct stat
*dir_stat
, void *closure
)
632 FcCache
*cache
= FcDirCacheMapFd (fd
, fd_stat
, dir_stat
);
636 *((FcCache
**) closure
) = cache
;
641 FcDirCacheLoad (const FcChar8
*dir
, FcConfig
*config
, FcChar8
**cache_file
)
643 FcCache
*cache
= NULL
;
645 if (!FcDirCacheProcess (config
, dir
,
653 FcDirCacheLoadFile (const FcChar8
*cache_file
, struct stat
*file_stat
)
657 struct stat my_file_stat
;
660 file_stat
= &my_file_stat
;
661 fd
= FcDirCacheOpenFile (cache_file
, file_stat
);
664 cache
= FcDirCacheMapFd (fd
, file_stat
, NULL
);
670 * Validate a cache file by reading the header and checking
671 * the magic number and the size field
674 FcDirCacheValidateHelper (int fd
, struct stat
*fd_stat
, struct stat
*dir_stat
, void *closure
)
679 if (read (fd
, &c
, sizeof (FcCache
)) != sizeof (FcCache
))
681 else if (c
.magic
!= FC_CACHE_MAGIC_MMAP
)
683 else if (c
.version
< FC_CACHE_CONTENT_VERSION
)
685 else if (fd_stat
->st_size
!= c
.size
)
687 else if (c
.mtime
!= (int) dir_stat
->st_mtime
)
693 FcDirCacheValidConfig (const FcChar8
*dir
, FcConfig
*config
)
695 return FcDirCacheProcess (config
, dir
,
696 FcDirCacheValidateHelper
,
701 FcDirCacheValid (const FcChar8
*dir
)
705 config
= FcConfigGetCurrent ();
709 return FcDirCacheValidConfig (dir
, config
);
713 * Build a cache structure from the given contents
716 FcDirCacheBuild (FcFontSet
*set
, const FcChar8
*dir
, struct stat
*dir_stat
, FcStrSet
*dirs
)
718 FcSerialize
*serialize
= FcSerializeCreate ();
721 intptr_t cache_offset
;
722 intptr_t dirs_offset
;
723 FcChar8
*dir_serialize
;
724 intptr_t *dirs_serialize
;
725 FcFontSet
*set_serialize
;
730 * Space for cache structure
732 cache_offset
= FcSerializeReserve (serialize
, sizeof (FcCache
));
736 if (!FcStrSerializeAlloc (serialize
, dir
))
741 dirs_offset
= FcSerializeAlloc (serialize
, dirs
, dirs
->num
* sizeof (FcChar8
*));
742 for (i
= 0; i
< dirs
->num
; i
++)
743 if (!FcStrSerializeAlloc (serialize
, dirs
->strs
[i
]))
749 if (!FcFontSetSerializeAlloc (serialize
, set
))
752 /* Serialize layout complete. Now allocate space and fill it */
753 cache
= malloc (serialize
->size
);
756 /* shut up valgrind */
757 memset (cache
, 0, serialize
->size
);
759 serialize
->linear
= cache
;
761 cache
->magic
= FC_CACHE_MAGIC_ALLOC
;
762 cache
->version
= FC_CACHE_CONTENT_VERSION
;
763 cache
->size
= serialize
->size
;
764 cache
->mtime
= (int) dir_stat
->st_mtime
;
767 * Serialize directory name
769 dir_serialize
= FcStrSerialize (serialize
, dir
);
772 cache
->dir
= FcPtrToOffset (cache
, dir_serialize
);
777 dirs_serialize
= FcSerializePtr (serialize
, dirs
);
780 cache
->dirs
= FcPtrToOffset (cache
, dirs_serialize
);
781 cache
->dirs_count
= dirs
->num
;
782 for (i
= 0; i
< dirs
->num
; i
++)
784 FcChar8
*d_serialize
= FcStrSerialize (serialize
, dirs
->strs
[i
]);
787 dirs_serialize
[i
] = FcPtrToOffset (dirs_serialize
, d_serialize
);
793 set_serialize
= FcFontSetSerialize (serialize
, set
);
796 cache
->set
= FcPtrToOffset (cache
, set_serialize
);
798 FcSerializeDestroy (serialize
);
800 FcCacheInsert (cache
, NULL
);
807 FcSerializeDestroy (serialize
);
813 #define mkdir(path,mode) _mkdir(path)
817 FcMakeDirectory (const FcChar8
*dir
)
822 if (strlen ((char *) dir
) == 0)
825 parent
= FcStrDirname (dir
);
828 if (access ((char *) parent
, F_OK
) == 0)
829 ret
= mkdir ((char *) dir
, 0755) == 0 && chmod ((char *) dir
, 0755) == 0;
830 else if (access ((char *) parent
, F_OK
) == -1)
831 ret
= FcMakeDirectory (parent
) && (mkdir ((char *) dir
, 0755) == 0) && chmod ((char *) dir
, 0755) == 0;
838 /* write serialized state to the cache file */
840 FcDirCacheWrite (FcCache
*cache
, FcConfig
*config
)
842 FcChar8
*dir
= FcCacheDir (cache
);
843 FcChar8 cache_base
[CACHEBASE_LEN
];
844 FcChar8
*cache_hashed
;
848 FcChar8
*cache_dir
= NULL
;
851 struct stat cache_stat
;
856 * Write it to the first directory in the list which is writable
859 list
= FcStrListCreate (config
->cacheDirs
);
862 while ((test_dir
= FcStrListNext (list
))) {
863 if (access ((char *) test_dir
, W_OK
|X_OK
) == 0)
865 cache_dir
= test_dir
;
871 * If the directory doesn't exist, try to create it
873 if (access ((char *) test_dir
, F_OK
) == -1) {
874 if (FcMakeDirectory (test_dir
))
876 cache_dir
= test_dir
;
881 * Otherwise, try making it writable
883 else if (chmod ((char *) test_dir
, 0755) == 0)
885 cache_dir
= test_dir
;
890 FcStrListDone (list
);
894 FcDirCacheBasename (dir
, cache_base
);
895 cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
899 if (FcDebug () & FC_DBG_CACHE
)
900 printf ("FcDirCacheWriteDir dir \"%s\" file \"%s\"\n",
903 atomic
= FcAtomicCreate ((FcChar8
*)cache_hashed
);
907 if (!FcAtomicLock (atomic
))
910 fd
= open((char *)FcAtomicNewFile (atomic
), O_RDWR
| O_CREAT
| O_BINARY
, 0666);
914 /* Temporarily switch magic to MMAP while writing to file */
915 magic
= cache
->magic
;
916 if (magic
!= FC_CACHE_MAGIC_MMAP
)
917 cache
->magic
= FC_CACHE_MAGIC_MMAP
;
920 * Write cache contents to file
922 written
= write (fd
, cache
, cache
->size
);
924 /* Switch magic back */
925 if (magic
!= FC_CACHE_MAGIC_MMAP
)
926 cache
->magic
= magic
;
928 if (written
!= cache
->size
)
930 perror ("write cache");
935 if (!FcAtomicReplaceOrig(atomic
))
938 /* If the file is small, update the cache chain entry such that the
939 * new cache file is not read again. If it's large, we don't do that
940 * such that we reload it, using mmap, which is shared across processes.
942 if (cache
->size
< FC_CACHE_MIN_MMAP
&&
943 (skip
= FcCacheFindByAddr (cache
)) &&
944 FcStat (cache_hashed
, &cache_stat
))
946 skip
->cache_dev
= cache_stat
.st_dev
;
947 skip
->cache_ino
= cache_stat
.st_ino
;
948 skip
->cache_mtime
= cache_stat
.st_mtime
;
951 FcStrFree (cache_hashed
);
952 FcAtomicUnlock (atomic
);
953 FcAtomicDestroy (atomic
);
959 FcAtomicUnlock (atomic
);
961 FcAtomicDestroy (atomic
);
963 FcStrFree (cache_hashed
);
968 * Hokey little macro trick to permit the definitions of C functions
969 * with the same name as CPP macros
972 #define args2(x,y) (x,y)
975 FcCacheDir
args1(const FcCache
*c
)
977 return FcCacheDir (c
);
981 FcCacheCopySet
args1(const FcCache
*c
)
983 FcFontSet
*old
= FcCacheSet (c
);
984 FcFontSet
*new = FcFontSetCreate ();
989 for (i
= 0; i
< old
->nfont
; i
++)
991 FcPattern
*font
= FcFontSetFont (old
, i
);
993 FcPatternReference (font
);
994 if (!FcFontSetAdd (new, font
))
996 FcFontSetDestroy (new);
1004 FcCacheSubdir
args2(const FcCache
*c
, int i
)
1006 return FcCacheSubdir (c
, i
);
1010 FcCacheNumSubdir
args1(const FcCache
*c
)
1012 return c
->dirs_count
;
1016 FcCacheNumFont
args1(const FcCache
*c
)
1018 return FcCacheSet(c
)->nfont
;
1022 * This code implements the MD5 message-digest algorithm.
1023 * The algorithm is due to Ron Rivest. This code was
1024 * written by Colin Plumb in 1993, no copyright is claimed.
1025 * This code is in the public domain; do with it what you wish.
1027 * Equivalent code is available from RSA Data Security, Inc.
1028 * This code has been tested against that, and is equivalent,
1029 * except that you don't need to include two pages of legalese
1032 * To compute the message digest of a chunk of bytes, declare an
1033 * MD5Context structure, pass it to MD5Init, call MD5Update as
1034 * needed on buffers full of bytes, and then call MD5Final, which
1035 * will fill a supplied 16-byte array with the digest.
1039 #define byteReverse(buf, len) /* Nothing */
1042 * Note: this code is harmless on little-endian machines.
1044 void byteReverse(unsigned char *buf
, unsigned longs
)
1048 t
= (FcChar32
) ((unsigned) buf
[3] << 8 | buf
[2]) << 16 |
1049 ((unsigned) buf
[1] << 8 | buf
[0]);
1050 *(FcChar32
*) buf
= t
;
1057 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
1058 * initialization constants.
1060 static void MD5Init(struct MD5Context
*ctx
)
1062 ctx
->buf
[0] = 0x67452301;
1063 ctx
->buf
[1] = 0xefcdab89;
1064 ctx
->buf
[2] = 0x98badcfe;
1065 ctx
->buf
[3] = 0x10325476;
1072 * Update context to reflect the concatenation of another buffer full
1075 static void MD5Update(struct MD5Context
*ctx
, const unsigned char *buf
, unsigned len
)
1079 /* Update bitcount */
1082 if ((ctx
->bits
[0] = t
+ ((FcChar32
) len
<< 3)) < t
)
1083 ctx
->bits
[1]++; /* Carry from low to high */
1084 ctx
->bits
[1] += len
>> 29;
1086 t
= (t
>> 3) & 0x3f; /* Bytes already in shsInfo->data */
1088 /* Handle any leading odd-sized chunks */
1091 unsigned char *p
= (unsigned char *) ctx
->in
+ t
;
1095 memcpy(p
, buf
, len
);
1099 byteReverse(ctx
->in
, 16);
1100 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1104 /* Process data in 64-byte chunks */
1107 memcpy(ctx
->in
, buf
, 64);
1108 byteReverse(ctx
->in
, 16);
1109 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1114 /* Handle any remaining bytes of data. */
1116 memcpy(ctx
->in
, buf
, len
);
1120 * Final wrapup - pad to 64-byte boundary with the bit pattern
1121 * 1 0* (64-bit count of bits processed, MSB-first)
1123 static void MD5Final(unsigned char digest
[16], struct MD5Context
*ctx
)
1128 /* Compute number of bytes mod 64 */
1129 count
= (ctx
->bits
[0] >> 3) & 0x3F;
1131 /* Set the first char of padding to 0x80. This is safe since there is
1132 always at least one byte free */
1133 p
= ctx
->in
+ count
;
1136 /* Bytes of padding needed to make 64 bytes */
1137 count
= 64 - 1 - count
;
1139 /* Pad out to 56 mod 64 */
1141 /* Two lots of padding: Pad the first block to 64 bytes */
1142 memset(p
, 0, count
);
1143 byteReverse(ctx
->in
, 16);
1144 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1146 /* Now fill the next block with 56 bytes */
1147 memset(ctx
->in
, 0, 56);
1149 /* Pad block to 56 bytes */
1150 memset(p
, 0, count
- 8);
1152 byteReverse(ctx
->in
, 14);
1154 /* Append length in bits and transform */
1155 ((FcChar32
*) ctx
->in
)[14] = ctx
->bits
[0];
1156 ((FcChar32
*) ctx
->in
)[15] = ctx
->bits
[1];
1158 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1159 byteReverse((unsigned char *) ctx
->buf
, 4);
1160 memcpy(digest
, ctx
->buf
, 16);
1161 memset(ctx
, 0, sizeof(ctx
)); /* In case it's sensitive */
1165 /* The four core functions - F1 is optimized somewhat */
1167 /* #define F1(x, y, z) (x & y | ~x & z) */
1168 #define F1(x, y, z) (z ^ (x & (y ^ z)))
1169 #define F2(x, y, z) F1(z, x, y)
1170 #define F3(x, y, z) (x ^ y ^ z)
1171 #define F4(x, y, z) (y ^ (x | ~z))
1173 /* This is the central step in the MD5 algorithm. */
1174 #define MD5STEP(f, w, x, y, z, data, s) \
1175 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
1178 * The core of the MD5 algorithm, this alters an existing MD5 hash to
1179 * reflect the addition of 16 longwords of new data. MD5Update blocks
1180 * the data and converts bytes into longwords for this routine.
1182 static void MD5Transform(FcChar32 buf
[4], FcChar32 in
[16])
1184 register FcChar32 a
, b
, c
, d
;
1191 MD5STEP(F1
, a
, b
, c
, d
, in
[0] + 0xd76aa478, 7);
1192 MD5STEP(F1
, d
, a
, b
, c
, in
[1] + 0xe8c7b756, 12);
1193 MD5STEP(F1
, c
, d
, a
, b
, in
[2] + 0x242070db, 17);
1194 MD5STEP(F1
, b
, c
, d
, a
, in
[3] + 0xc1bdceee, 22);
1195 MD5STEP(F1
, a
, b
, c
, d
, in
[4] + 0xf57c0faf, 7);
1196 MD5STEP(F1
, d
, a
, b
, c
, in
[5] + 0x4787c62a, 12);
1197 MD5STEP(F1
, c
, d
, a
, b
, in
[6] + 0xa8304613, 17);
1198 MD5STEP(F1
, b
, c
, d
, a
, in
[7] + 0xfd469501, 22);
1199 MD5STEP(F1
, a
, b
, c
, d
, in
[8] + 0x698098d8, 7);
1200 MD5STEP(F1
, d
, a
, b
, c
, in
[9] + 0x8b44f7af, 12);
1201 MD5STEP(F1
, c
, d
, a
, b
, in
[10] + 0xffff5bb1, 17);
1202 MD5STEP(F1
, b
, c
, d
, a
, in
[11] + 0x895cd7be, 22);
1203 MD5STEP(F1
, a
, b
, c
, d
, in
[12] + 0x6b901122, 7);
1204 MD5STEP(F1
, d
, a
, b
, c
, in
[13] + 0xfd987193, 12);
1205 MD5STEP(F1
, c
, d
, a
, b
, in
[14] + 0xa679438e, 17);
1206 MD5STEP(F1
, b
, c
, d
, a
, in
[15] + 0x49b40821, 22);
1208 MD5STEP(F2
, a
, b
, c
, d
, in
[1] + 0xf61e2562, 5);
1209 MD5STEP(F2
, d
, a
, b
, c
, in
[6] + 0xc040b340, 9);
1210 MD5STEP(F2
, c
, d
, a
, b
, in
[11] + 0x265e5a51, 14);
1211 MD5STEP(F2
, b
, c
, d
, a
, in
[0] + 0xe9b6c7aa, 20);
1212 MD5STEP(F2
, a
, b
, c
, d
, in
[5] + 0xd62f105d, 5);
1213 MD5STEP(F2
, d
, a
, b
, c
, in
[10] + 0x02441453, 9);
1214 MD5STEP(F2
, c
, d
, a
, b
, in
[15] + 0xd8a1e681, 14);
1215 MD5STEP(F2
, b
, c
, d
, a
, in
[4] + 0xe7d3fbc8, 20);
1216 MD5STEP(F2
, a
, b
, c
, d
, in
[9] + 0x21e1cde6, 5);
1217 MD5STEP(F2
, d
, a
, b
, c
, in
[14] + 0xc33707d6, 9);
1218 MD5STEP(F2
, c
, d
, a
, b
, in
[3] + 0xf4d50d87, 14);
1219 MD5STEP(F2
, b
, c
, d
, a
, in
[8] + 0x455a14ed, 20);
1220 MD5STEP(F2
, a
, b
, c
, d
, in
[13] + 0xa9e3e905, 5);
1221 MD5STEP(F2
, d
, a
, b
, c
, in
[2] + 0xfcefa3f8, 9);
1222 MD5STEP(F2
, c
, d
, a
, b
, in
[7] + 0x676f02d9, 14);
1223 MD5STEP(F2
, b
, c
, d
, a
, in
[12] + 0x8d2a4c8a, 20);
1225 MD5STEP(F3
, a
, b
, c
, d
, in
[5] + 0xfffa3942, 4);
1226 MD5STEP(F3
, d
, a
, b
, c
, in
[8] + 0x8771f681, 11);
1227 MD5STEP(F3
, c
, d
, a
, b
, in
[11] + 0x6d9d6122, 16);
1228 MD5STEP(F3
, b
, c
, d
, a
, in
[14] + 0xfde5380c, 23);
1229 MD5STEP(F3
, a
, b
, c
, d
, in
[1] + 0xa4beea44, 4);
1230 MD5STEP(F3
, d
, a
, b
, c
, in
[4] + 0x4bdecfa9, 11);
1231 MD5STEP(F3
, c
, d
, a
, b
, in
[7] + 0xf6bb4b60, 16);
1232 MD5STEP(F3
, b
, c
, d
, a
, in
[10] + 0xbebfbc70, 23);
1233 MD5STEP(F3
, a
, b
, c
, d
, in
[13] + 0x289b7ec6, 4);
1234 MD5STEP(F3
, d
, a
, b
, c
, in
[0] + 0xeaa127fa, 11);
1235 MD5STEP(F3
, c
, d
, a
, b
, in
[3] + 0xd4ef3085, 16);
1236 MD5STEP(F3
, b
, c
, d
, a
, in
[6] + 0x04881d05, 23);
1237 MD5STEP(F3
, a
, b
, c
, d
, in
[9] + 0xd9d4d039, 4);
1238 MD5STEP(F3
, d
, a
, b
, c
, in
[12] + 0xe6db99e5, 11);
1239 MD5STEP(F3
, c
, d
, a
, b
, in
[15] + 0x1fa27cf8, 16);
1240 MD5STEP(F3
, b
, c
, d
, a
, in
[2] + 0xc4ac5665, 23);
1242 MD5STEP(F4
, a
, b
, c
, d
, in
[0] + 0xf4292244, 6);
1243 MD5STEP(F4
, d
, a
, b
, c
, in
[7] + 0x432aff97, 10);
1244 MD5STEP(F4
, c
, d
, a
, b
, in
[14] + 0xab9423a7, 15);
1245 MD5STEP(F4
, b
, c
, d
, a
, in
[5] + 0xfc93a039, 21);
1246 MD5STEP(F4
, a
, b
, c
, d
, in
[12] + 0x655b59c3, 6);
1247 MD5STEP(F4
, d
, a
, b
, c
, in
[3] + 0x8f0ccc92, 10);
1248 MD5STEP(F4
, c
, d
, a
, b
, in
[10] + 0xffeff47d, 15);
1249 MD5STEP(F4
, b
, c
, d
, a
, in
[1] + 0x85845dd1, 21);
1250 MD5STEP(F4
, a
, b
, c
, d
, in
[8] + 0x6fa87e4f, 6);
1251 MD5STEP(F4
, d
, a
, b
, c
, in
[15] + 0xfe2ce6e0, 10);
1252 MD5STEP(F4
, c
, d
, a
, b
, in
[6] + 0xa3014314, 15);
1253 MD5STEP(F4
, b
, c
, d
, a
, in
[13] + 0x4e0811a1, 21);
1254 MD5STEP(F4
, a
, b
, c
, d
, in
[4] + 0xf7537e82, 6);
1255 MD5STEP(F4
, d
, a
, b
, c
, in
[11] + 0xbd3af235, 10);
1256 MD5STEP(F4
, c
, d
, a
, b
, in
[2] + 0x2ad7d2bb, 15);
1257 MD5STEP(F4
, b
, c
, d
, a
, in
[9] + 0xeb86d391, 21);
1265 #include "fcaliastail.h"