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>
36 # define _WIN32_WINNT 0x0500
50 static void MD5Init(struct MD5Context
*ctx
);
51 static void MD5Update(struct MD5Context
*ctx
, const unsigned char *buf
, unsigned len
);
52 static void MD5Final(unsigned char digest
[16], struct MD5Context
*ctx
);
53 static void MD5Transform(FcChar32 buf
[4], FcChar32 in
[16]);
55 #define CACHEBASE_LEN (1 + 32 + 1 + sizeof (FC_ARCHITECTURE) + sizeof (FC_CACHE_SUFFIX))
62 typedef long long INT64
;
63 #define EPOCH_OFFSET 11644473600ll
65 #define EPOCH_OFFSET 11644473600i64
66 typedef __int64 INT64
;
69 /* Workaround for problems in the stat() in the Microsoft C library:
71 * 1) stat() uses FindFirstFile() to get the file
72 * attributes. Unfortunately this API doesn't return correct values
73 * for modification time of a directory until some time after a file
74 * or subdirectory has been added to the directory. (This causes
75 * run-test.sh to fail, for instance.) GetFileAttributesEx() is
76 * better, it returns the updated timestamp right away.
78 * 2) stat() does some strange things related to backward
79 * compatibility with the local time timestamps on FAT volumes and
80 * daylight saving time. This causes problems after the switches
81 * to/from daylight saving time. See
82 * http://bugzilla.gnome.org/show_bug.cgi?id=154968 , especially
83 * comment #30, and http://www.codeproject.com/datetime/dstbugs.asp .
84 * We don't need any of that, FAT and Win9x are as good as dead. So
85 * just use the UTC timestamps from NTFS, converted to the Unix epoch.
89 FcStat (const char *file
, struct stat
*statb
)
91 WIN32_FILE_ATTRIBUTE_DATA wfad
;
92 char full_path_name
[MAX_PATH
];
96 if (!GetFileAttributesEx (file
, GetFileExInfoStandard
, &wfad
))
101 /* Calculate a pseudo inode number as a hash of the full path name.
102 * Call GetLongPathName() to get the spelling of the path name as it
105 rc
= GetFullPathName (file
, sizeof (full_path_name
), full_path_name
, &basename
);
106 if (rc
== 0 || rc
> sizeof (full_path_name
))
109 rc
= GetLongPathName (full_path_name
, full_path_name
, sizeof (full_path_name
));
110 statb
->st_ino
= FcStringHash (full_path_name
);
112 statb
->st_mode
= _S_IREAD
| _S_IWRITE
;
113 statb
->st_mode
|= (statb
->st_mode
>> 3) | (statb
->st_mode
>> 6);
115 if (wfad
.dwFileAttributes
& FILE_ATTRIBUTE_DIRECTORY
)
116 statb
->st_mode
|= _S_IFDIR
;
118 statb
->st_mode
|= _S_IFREG
;
121 statb
->st_uid
= statb
->st_gid
= 0;
124 if (wfad
.nFileSizeHigh
> 0)
126 statb
->st_size
= wfad
.nFileSizeLow
;
128 statb
->st_atime
= (*(INT64
*)&wfad
.ftLastAccessTime
)/10000000 - EPOCH_OFFSET
;
129 statb
->st_mtime
= (*(INT64
*)&wfad
.ftLastWriteTime
)/10000000 - EPOCH_OFFSET
;
130 statb
->st_ctime
= statb
->st_mtime
;
141 static const char bin2hex
[] = { '0', '1', '2', '3',
144 'c', 'd', 'e', 'f' };
147 FcDirCacheBasename (const FcChar8
* dir
, FcChar8 cache_base
[CACHEBASE_LEN
])
149 unsigned char hash
[16];
152 struct MD5Context ctx
;
155 MD5Update (&ctx
, (const unsigned char *)dir
, strlen ((const char *) dir
));
157 MD5Final (hash
, &ctx
);
160 hex_hash
= cache_base
+ 1;
161 for (cnt
= 0; cnt
< 16; ++cnt
)
163 hex_hash
[2*cnt
] = bin2hex
[hash
[cnt
] >> 4];
164 hex_hash
[2*cnt
+1] = bin2hex
[hash
[cnt
] & 0xf];
167 strcat ((char *) cache_base
, "-" FC_ARCHITECTURE FC_CACHE_SUFFIX
);
173 FcDirCacheUnlink (const FcChar8
*dir
, FcConfig
*config
)
175 FcChar8
*cache_hashed
= NULL
;
176 FcChar8 cache_base
[CACHEBASE_LEN
];
180 FcDirCacheBasename (dir
, cache_base
);
182 list
= FcStrListCreate (config
->cacheDirs
);
186 while ((cache_dir
= FcStrListNext (list
)))
188 cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
191 (void) unlink ((char *) cache_hashed
);
192 FcStrFree (cache_hashed
);
194 FcStrListDone (list
);
195 /* return FcFalse if something went wrong */
202 FcDirCacheOpenFile (const FcChar8
*cache_file
, struct stat
*file_stat
)
207 if (FcStat (cache_file
, file_stat
) < 0)
210 fd
= open((char *) cache_file
, O_RDONLY
| O_BINARY
);
214 if (fstat (fd
, file_stat
) < 0)
224 * Look for a cache file for the specified dir. Attempt
225 * to use each one we find, stopping when the callback
229 FcDirCacheProcess (FcConfig
*config
, const FcChar8
*dir
,
230 FcBool (*callback
) (int fd
, struct stat
*fd_stat
,
231 struct stat
*dir_stat
, void *closure
),
232 void *closure
, FcChar8
**cache_file_ret
)
235 FcChar8 cache_base
[CACHEBASE_LEN
];
238 struct stat file_stat
, dir_stat
;
239 FcBool ret
= FcFalse
;
241 if (FcStat ((char *) dir
, &dir_stat
) < 0)
244 FcDirCacheBasename (dir
, cache_base
);
246 list
= FcStrListCreate (config
->cacheDirs
);
250 while ((cache_dir
= FcStrListNext (list
)))
252 FcChar8
*cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
255 fd
= FcDirCacheOpenFile (cache_hashed
, &file_stat
);
257 ret
= (*callback
) (fd
, &file_stat
, &dir_stat
, closure
);
262 *cache_file_ret
= cache_hashed
;
264 FcStrFree (cache_hashed
);
268 FcStrFree (cache_hashed
);
270 FcStrListDone (list
);
275 #define FC_CACHE_MIN_MMAP 1024
278 * Skip list element, make sure the 'next' pointer is the last thing
279 * in the structure, it will be allocated large enough to hold all
280 * of the necessary pointers
283 typedef struct _FcCacheSkip FcCacheSkip
;
285 struct _FcCacheSkip
{
292 FcCacheSkip
*next
[1];
296 * The head of the skip list; pointers for every possible level
297 * in the skip list, plus the largest level in the list
300 #define FC_CACHE_MAX_LEVEL 16
302 static FcCacheSkip
*fcCacheChains
[FC_CACHE_MAX_LEVEL
];
303 static int fcCacheMaxLevel
;
306 # define FcRandom() random()
309 # define FcRandom() lrand48()
312 # define FcRandom() rand()
317 * Generate a random level number, distributed
318 * so that each level is 1/4 as likely as the one before
320 * Note that level numbers run 1 <= level <= MAX_LEVEL
325 /* tricky bit -- each bit is '1' 75% of the time */
326 long int bits
= FcRandom () | FcRandom ();
329 while (++level
< FC_CACHE_MAX_LEVEL
)
339 * Insert cache into the list
342 FcCacheInsert (FcCache
*cache
, struct stat
*cache_stat
)
344 FcCacheSkip
**update
[FC_CACHE_MAX_LEVEL
];
345 FcCacheSkip
*s
, **next
;
349 * Find links along each chain
351 next
= fcCacheChains
;
352 for (i
= fcCacheMaxLevel
; --i
>= 0; )
354 for (; (s
= next
[i
]); next
= s
->next
)
355 if (s
->cache
> cache
)
357 update
[i
] = &next
[i
];
361 * Create new list element
363 level
= random_level ();
364 if (level
> fcCacheMaxLevel
)
366 level
= fcCacheMaxLevel
+ 1;
367 update
[fcCacheMaxLevel
] = &fcCacheChains
[fcCacheMaxLevel
];
368 fcCacheMaxLevel
= level
;
371 s
= malloc (sizeof (FcCacheSkip
) + (level
- 1) * sizeof (FcCacheSkip
*));
376 s
->size
= cache
->size
;
380 s
->cache_dev
= cache_stat
->st_dev
;
381 s
->cache_ino
= cache_stat
->st_ino
;
382 s
->cache_mtime
= cache_stat
->st_mtime
;
392 * Insert into all fcCacheChains
394 for (i
= 0; i
< level
; i
++)
396 s
->next
[i
] = *update
[i
];
403 FcCacheFindByAddr (void *object
)
406 FcCacheSkip
**next
= fcCacheChains
;
410 * Walk chain pointers one level at a time
412 for (i
= fcCacheMaxLevel
; --i
>= 0;)
413 while (next
[i
] && (char *) object
>= ((char *) next
[i
]->cache
+ next
[i
]->size
))
414 next
= next
[i
]->next
;
419 if (s
&& (char *) object
< ((char *) s
->cache
+ s
->size
))
425 FcCacheRemove (FcCache
*cache
)
427 FcCacheSkip
**update
[FC_CACHE_MAX_LEVEL
];
428 FcCacheSkip
*s
, **next
;
432 * Find links along each chain
434 next
= fcCacheChains
;
435 for (i
= fcCacheMaxLevel
; --i
>= 0; )
437 for (; (s
= next
[i
]); next
= s
->next
)
438 if (s
->cache
>= cache
)
440 update
[i
] = &next
[i
];
443 for (i
= 0; i
< fcCacheMaxLevel
&& *update
[i
] == s
; i
++)
444 *update
[i
] = s
->next
[i
];
445 while (fcCacheMaxLevel
> 0 && fcCacheChains
[fcCacheMaxLevel
- 1] == NULL
)
451 FcCacheFindByStat (struct stat
*cache_stat
)
455 for (s
= fcCacheChains
[0]; s
; s
= s
->next
[0])
456 if (s
->cache_dev
== cache_stat
->st_dev
&&
457 s
->cache_ino
== cache_stat
->st_ino
&&
458 s
->cache_mtime
== cache_stat
->st_mtime
)
467 FcDirCacheDispose (FcCache
*cache
)
469 switch (cache
->magic
) {
470 case FC_CACHE_MAGIC_ALLOC
:
473 case FC_CACHE_MAGIC_MMAP
:
474 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
475 munmap (cache
, cache
->size
);
476 #elif defined(_WIN32)
477 UnmapViewOfFile (cache
);
481 FcCacheRemove (cache
);
485 FcCacheObjectReference (void *object
)
487 FcCacheSkip
*skip
= FcCacheFindByAddr (object
);
494 FcCacheObjectDereference (void *object
)
496 FcCacheSkip
*skip
= FcCacheFindByAddr (object
);
502 FcDirCacheDispose (skip
->cache
);
511 for (i
= 0; i
< FC_CACHE_MAX_LEVEL
; i
++)
512 assert (fcCacheChains
[i
] == NULL
);
513 assert (fcCacheMaxLevel
== 0);
517 FcCacheTimeValid (FcCache
*cache
, struct stat
*dir_stat
)
519 struct stat dir_static
;
523 if (stat ((const char *) FcCacheDir (cache
), &dir_static
) < 0)
525 dir_stat
= &dir_static
;
527 if (FcDebug () & FC_DBG_CACHE
)
528 printf ("FcCacheTimeValid dir \"%s\" cache time %d dir time %d\n",
529 FcCacheDir (cache
), cache
->mtime
, (int) dir_stat
->st_mtime
);
530 return cache
->mtime
== (int) dir_stat
->st_mtime
;
534 * Map a cache file into memory
537 FcDirCacheMapFd (int fd
, struct stat
*fd_stat
, struct stat
*dir_stat
)
540 FcBool allocated
= FcFalse
;
542 if (fd_stat
->st_size
< sizeof (FcCache
))
544 cache
= FcCacheFindByStat (fd_stat
);
548 * Lage cache files are mmap'ed, smaller cache files are read. This
549 * balances the system cost of mmap against per-process memory usage.
551 if (fd_stat
->st_size
>= FC_CACHE_MIN_MMAP
)
553 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
554 cache
= mmap (0, fd_stat
->st_size
, PROT_READ
, MAP_SHARED
, fd
, 0);
555 #elif defined(_WIN32)
560 hFileMap
= CreateFileMapping((HANDLE
) _get_osfhandle(fd
), NULL
,
561 PAGE_READONLY
, 0, 0, NULL
);
562 if (hFileMap
!= NULL
)
564 cache
= MapViewOfFile (hFileMap
, FILE_MAP_READ
, 0, 0,
566 CloseHandle (hFileMap
);
573 cache
= malloc (fd_stat
->st_size
);
577 if (read (fd
, cache
, fd_stat
->st_size
) != fd_stat
->st_size
)
584 if (cache
->magic
!= FC_CACHE_MAGIC_MMAP
||
585 cache
->version
< FC_CACHE_CONTENT_VERSION
||
586 cache
->size
!= fd_stat
->st_size
||
587 !FcCacheTimeValid (cache
, dir_stat
) ||
588 !FcCacheInsert (cache
, fd_stat
))
594 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
595 munmap (cache
, fd_stat
->st_size
);
596 #elif defined(_WIN32)
597 UnmapViewOfFile (cache
);
603 /* Mark allocated caches so they're freed rather than unmapped */
605 cache
->magic
= FC_CACHE_MAGIC_ALLOC
;
611 FcDirCacheReference (FcCache
*cache
, int nref
)
613 FcCacheSkip
*skip
= FcCacheFindByAddr (cache
);
620 FcDirCacheUnload (FcCache
*cache
)
622 FcCacheObjectDereference (cache
);
626 FcDirCacheMapHelper (int fd
, struct stat
*fd_stat
, struct stat
*dir_stat
, void *closure
)
628 FcCache
*cache
= FcDirCacheMapFd (fd
, fd_stat
, dir_stat
);
632 *((FcCache
**) closure
) = cache
;
637 FcDirCacheLoad (const FcChar8
*dir
, FcConfig
*config
, FcChar8
**cache_file
)
639 FcCache
*cache
= NULL
;
641 if (!FcDirCacheProcess (config
, dir
,
649 FcDirCacheLoadFile (const FcChar8
*cache_file
, struct stat
*file_stat
)
653 struct stat my_file_stat
;
656 file_stat
= &my_file_stat
;
657 fd
= FcDirCacheOpenFile (cache_file
, file_stat
);
660 cache
= FcDirCacheMapFd (fd
, file_stat
, NULL
);
666 * Validate a cache file by reading the header and checking
667 * the magic number and the size field
670 FcDirCacheValidateHelper (int fd
, struct stat
*fd_stat
, struct stat
*dir_stat
, void *closure
)
675 if (read (fd
, &c
, sizeof (FcCache
)) != sizeof (FcCache
))
677 else if (c
.magic
!= FC_CACHE_MAGIC_MMAP
)
679 else if (c
.version
< FC_CACHE_CONTENT_VERSION
)
681 else if (fd_stat
->st_size
!= c
.size
)
683 else if (c
.mtime
!= (int) dir_stat
->st_mtime
)
689 FcDirCacheValidConfig (const FcChar8
*dir
, FcConfig
*config
)
691 return FcDirCacheProcess (config
, dir
,
692 FcDirCacheValidateHelper
,
697 FcDirCacheValid (const FcChar8
*dir
)
701 config
= FcConfigGetCurrent ();
705 return FcDirCacheValidConfig (dir
, config
);
709 * Build a cache structure from the given contents
712 FcDirCacheBuild (FcFontSet
*set
, const FcChar8
*dir
, struct stat
*dir_stat
, FcStrSet
*dirs
)
714 FcSerialize
*serialize
= FcSerializeCreate ();
717 intptr_t cache_offset
;
718 intptr_t dirs_offset
;
719 FcChar8
*dir_serialize
;
720 intptr_t *dirs_serialize
;
721 FcFontSet
*set_serialize
;
726 * Space for cache structure
728 cache_offset
= FcSerializeReserve (serialize
, sizeof (FcCache
));
732 if (!FcStrSerializeAlloc (serialize
, dir
))
737 dirs_offset
= FcSerializeAlloc (serialize
, dirs
, dirs
->num
* sizeof (FcChar8
*));
738 for (i
= 0; i
< dirs
->num
; i
++)
739 if (!FcStrSerializeAlloc (serialize
, dirs
->strs
[i
]))
745 if (!FcFontSetSerializeAlloc (serialize
, set
))
748 /* Serialize layout complete. Now allocate space and fill it */
749 cache
= malloc (serialize
->size
);
752 /* shut up valgrind */
753 memset (cache
, 0, serialize
->size
);
755 serialize
->linear
= cache
;
757 cache
->magic
= FC_CACHE_MAGIC_ALLOC
;
758 cache
->version
= FC_CACHE_CONTENT_VERSION
;
759 cache
->size
= serialize
->size
;
760 cache
->mtime
= (int) dir_stat
->st_mtime
;
763 * Serialize directory name
765 dir_serialize
= FcStrSerialize (serialize
, dir
);
768 cache
->dir
= FcPtrToOffset (cache
, dir_serialize
);
773 dirs_serialize
= FcSerializePtr (serialize
, dirs
);
776 cache
->dirs
= FcPtrToOffset (cache
, dirs_serialize
);
777 cache
->dirs_count
= dirs
->num
;
778 for (i
= 0; i
< dirs
->num
; i
++)
780 FcChar8
*d_serialize
= FcStrSerialize (serialize
, dirs
->strs
[i
]);
783 dirs_serialize
[i
] = FcPtrToOffset (dirs_serialize
, d_serialize
);
789 set_serialize
= FcFontSetSerialize (serialize
, set
);
792 cache
->set
= FcPtrToOffset (cache
, set_serialize
);
794 FcSerializeDestroy (serialize
);
796 FcCacheInsert (cache
, NULL
);
803 FcSerializeDestroy (serialize
);
809 #define mkdir(path,mode) _mkdir(path)
813 FcMakeDirectory (const FcChar8
*dir
)
818 if (strlen ((char *) dir
) == 0)
821 parent
= FcStrDirname (dir
);
824 if (access ((char *) parent
, F_OK
) == 0)
825 ret
= mkdir ((char *) dir
, 0777) == 0;
826 else if (access ((char *) parent
, F_OK
) == -1)
827 ret
= FcMakeDirectory (parent
) && (mkdir ((char *) dir
, 0777) == 0);
834 /* write serialized state to the cache file */
836 FcDirCacheWrite (FcCache
*cache
, FcConfig
*config
)
838 FcChar8
*dir
= FcCacheDir (cache
);
839 FcChar8 cache_base
[CACHEBASE_LEN
];
840 FcChar8
*cache_hashed
;
844 FcChar8
*cache_dir
= NULL
;
850 * Write it to the first directory in the list which is writable
853 list
= FcStrListCreate (config
->cacheDirs
);
856 while ((test_dir
= FcStrListNext (list
))) {
857 if (access ((char *) test_dir
, W_OK
) == 0)
859 cache_dir
= test_dir
;
865 * If the directory doesn't exist, try to create it
867 if (access ((char *) test_dir
, F_OK
) == -1) {
868 if (FcMakeDirectory (test_dir
))
870 cache_dir
= test_dir
;
876 FcStrListDone (list
);
880 FcDirCacheBasename (dir
, cache_base
);
881 cache_hashed
= FcStrPlus (cache_dir
, cache_base
);
885 if (FcDebug () & FC_DBG_CACHE
)
886 printf ("FcDirCacheWriteDir dir \"%s\" file \"%s\"\n",
889 atomic
= FcAtomicCreate ((FcChar8
*)cache_hashed
);
893 if (!FcAtomicLock (atomic
))
896 fd
= open((char *)FcAtomicNewFile (atomic
), O_RDWR
| O_CREAT
| O_BINARY
, 0666);
900 /* Temporarily switch magic to MMAP while writing to file */
901 magic
= cache
->magic
;
902 if (magic
!= FC_CACHE_MAGIC_MMAP
)
903 cache
->magic
= FC_CACHE_MAGIC_MMAP
;
906 * Write cache contents to file
908 written
= write (fd
, cache
, cache
->size
);
910 /* Switch magic back */
911 if (magic
!= FC_CACHE_MAGIC_MMAP
)
912 cache
->magic
= magic
;
914 if (written
!= cache
->size
)
916 perror ("write cache");
921 if (!FcAtomicReplaceOrig(atomic
))
923 FcStrFree (cache_hashed
);
924 FcAtomicUnlock (atomic
);
925 FcAtomicDestroy (atomic
);
931 FcAtomicUnlock (atomic
);
933 FcAtomicDestroy (atomic
);
935 FcStrFree (cache_hashed
);
940 * Hokey little macro trick to permit the definitions of C functions
941 * with the same name as CPP macros
944 #define args2(x,y) (x,y)
947 FcCacheDir
args1(const FcCache
*c
)
949 return FcCacheDir (c
);
953 FcCacheCopySet
args1(const FcCache
*c
)
955 FcFontSet
*old
= FcCacheSet (c
);
956 FcFontSet
*new = FcFontSetCreate ();
961 for (i
= 0; i
< old
->nfont
; i
++)
963 FcPattern
*font
= FcFontSetFont (old
, i
);
965 FcPatternReference (font
);
966 if (!FcFontSetAdd (new, font
))
968 FcFontSetDestroy (new);
976 FcCacheSubdir
args2(const FcCache
*c
, int i
)
978 return FcCacheSubdir (c
, i
);
982 FcCacheNumSubdir
args1(const FcCache
*c
)
984 return c
->dirs_count
;
988 FcCacheNumFont
args1(const FcCache
*c
)
990 return FcCacheSet(c
)->nfont
;
994 * This code implements the MD5 message-digest algorithm.
995 * The algorithm is due to Ron Rivest. This code was
996 * written by Colin Plumb in 1993, no copyright is claimed.
997 * This code is in the public domain; do with it what you wish.
999 * Equivalent code is available from RSA Data Security, Inc.
1000 * This code has been tested against that, and is equivalent,
1001 * except that you don't need to include two pages of legalese
1004 * To compute the message digest of a chunk of bytes, declare an
1005 * MD5Context structure, pass it to MD5Init, call MD5Update as
1006 * needed on buffers full of bytes, and then call MD5Final, which
1007 * will fill a supplied 16-byte array with the digest.
1011 #define byteReverse(buf, len) /* Nothing */
1014 * Note: this code is harmless on little-endian machines.
1016 void byteReverse(unsigned char *buf
, unsigned longs
)
1020 t
= (FcChar32
) ((unsigned) buf
[3] << 8 | buf
[2]) << 16 |
1021 ((unsigned) buf
[1] << 8 | buf
[0]);
1022 *(FcChar32
*) buf
= t
;
1029 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
1030 * initialization constants.
1032 static void MD5Init(struct MD5Context
*ctx
)
1034 ctx
->buf
[0] = 0x67452301;
1035 ctx
->buf
[1] = 0xefcdab89;
1036 ctx
->buf
[2] = 0x98badcfe;
1037 ctx
->buf
[3] = 0x10325476;
1044 * Update context to reflect the concatenation of another buffer full
1047 static void MD5Update(struct MD5Context
*ctx
, const unsigned char *buf
, unsigned len
)
1051 /* Update bitcount */
1054 if ((ctx
->bits
[0] = t
+ ((FcChar32
) len
<< 3)) < t
)
1055 ctx
->bits
[1]++; /* Carry from low to high */
1056 ctx
->bits
[1] += len
>> 29;
1058 t
= (t
>> 3) & 0x3f; /* Bytes already in shsInfo->data */
1060 /* Handle any leading odd-sized chunks */
1063 unsigned char *p
= (unsigned char *) ctx
->in
+ t
;
1067 memcpy(p
, buf
, len
);
1071 byteReverse(ctx
->in
, 16);
1072 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1076 /* Process data in 64-byte chunks */
1079 memcpy(ctx
->in
, buf
, 64);
1080 byteReverse(ctx
->in
, 16);
1081 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1086 /* Handle any remaining bytes of data. */
1088 memcpy(ctx
->in
, buf
, len
);
1092 * Final wrapup - pad to 64-byte boundary with the bit pattern
1093 * 1 0* (64-bit count of bits processed, MSB-first)
1095 static void MD5Final(unsigned char digest
[16], struct MD5Context
*ctx
)
1100 /* Compute number of bytes mod 64 */
1101 count
= (ctx
->bits
[0] >> 3) & 0x3F;
1103 /* Set the first char of padding to 0x80. This is safe since there is
1104 always at least one byte free */
1105 p
= ctx
->in
+ count
;
1108 /* Bytes of padding needed to make 64 bytes */
1109 count
= 64 - 1 - count
;
1111 /* Pad out to 56 mod 64 */
1113 /* Two lots of padding: Pad the first block to 64 bytes */
1114 memset(p
, 0, count
);
1115 byteReverse(ctx
->in
, 16);
1116 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1118 /* Now fill the next block with 56 bytes */
1119 memset(ctx
->in
, 0, 56);
1121 /* Pad block to 56 bytes */
1122 memset(p
, 0, count
- 8);
1124 byteReverse(ctx
->in
, 14);
1126 /* Append length in bits and transform */
1127 ((FcChar32
*) ctx
->in
)[14] = ctx
->bits
[0];
1128 ((FcChar32
*) ctx
->in
)[15] = ctx
->bits
[1];
1130 MD5Transform(ctx
->buf
, (FcChar32
*) ctx
->in
);
1131 byteReverse((unsigned char *) ctx
->buf
, 4);
1132 memcpy(digest
, ctx
->buf
, 16);
1133 memset(ctx
, 0, sizeof(ctx
)); /* In case it's sensitive */
1137 /* The four core functions - F1 is optimized somewhat */
1139 /* #define F1(x, y, z) (x & y | ~x & z) */
1140 #define F1(x, y, z) (z ^ (x & (y ^ z)))
1141 #define F2(x, y, z) F1(z, x, y)
1142 #define F3(x, y, z) (x ^ y ^ z)
1143 #define F4(x, y, z) (y ^ (x | ~z))
1145 /* This is the central step in the MD5 algorithm. */
1146 #define MD5STEP(f, w, x, y, z, data, s) \
1147 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
1150 * The core of the MD5 algorithm, this alters an existing MD5 hash to
1151 * reflect the addition of 16 longwords of new data. MD5Update blocks
1152 * the data and converts bytes into longwords for this routine.
1154 static void MD5Transform(FcChar32 buf
[4], FcChar32 in
[16])
1156 register FcChar32 a
, b
, c
, d
;
1163 MD5STEP(F1
, a
, b
, c
, d
, in
[0] + 0xd76aa478, 7);
1164 MD5STEP(F1
, d
, a
, b
, c
, in
[1] + 0xe8c7b756, 12);
1165 MD5STEP(F1
, c
, d
, a
, b
, in
[2] + 0x242070db, 17);
1166 MD5STEP(F1
, b
, c
, d
, a
, in
[3] + 0xc1bdceee, 22);
1167 MD5STEP(F1
, a
, b
, c
, d
, in
[4] + 0xf57c0faf, 7);
1168 MD5STEP(F1
, d
, a
, b
, c
, in
[5] + 0x4787c62a, 12);
1169 MD5STEP(F1
, c
, d
, a
, b
, in
[6] + 0xa8304613, 17);
1170 MD5STEP(F1
, b
, c
, d
, a
, in
[7] + 0xfd469501, 22);
1171 MD5STEP(F1
, a
, b
, c
, d
, in
[8] + 0x698098d8, 7);
1172 MD5STEP(F1
, d
, a
, b
, c
, in
[9] + 0x8b44f7af, 12);
1173 MD5STEP(F1
, c
, d
, a
, b
, in
[10] + 0xffff5bb1, 17);
1174 MD5STEP(F1
, b
, c
, d
, a
, in
[11] + 0x895cd7be, 22);
1175 MD5STEP(F1
, a
, b
, c
, d
, in
[12] + 0x6b901122, 7);
1176 MD5STEP(F1
, d
, a
, b
, c
, in
[13] + 0xfd987193, 12);
1177 MD5STEP(F1
, c
, d
, a
, b
, in
[14] + 0xa679438e, 17);
1178 MD5STEP(F1
, b
, c
, d
, a
, in
[15] + 0x49b40821, 22);
1180 MD5STEP(F2
, a
, b
, c
, d
, in
[1] + 0xf61e2562, 5);
1181 MD5STEP(F2
, d
, a
, b
, c
, in
[6] + 0xc040b340, 9);
1182 MD5STEP(F2
, c
, d
, a
, b
, in
[11] + 0x265e5a51, 14);
1183 MD5STEP(F2
, b
, c
, d
, a
, in
[0] + 0xe9b6c7aa, 20);
1184 MD5STEP(F2
, a
, b
, c
, d
, in
[5] + 0xd62f105d, 5);
1185 MD5STEP(F2
, d
, a
, b
, c
, in
[10] + 0x02441453, 9);
1186 MD5STEP(F2
, c
, d
, a
, b
, in
[15] + 0xd8a1e681, 14);
1187 MD5STEP(F2
, b
, c
, d
, a
, in
[4] + 0xe7d3fbc8, 20);
1188 MD5STEP(F2
, a
, b
, c
, d
, in
[9] + 0x21e1cde6, 5);
1189 MD5STEP(F2
, d
, a
, b
, c
, in
[14] + 0xc33707d6, 9);
1190 MD5STEP(F2
, c
, d
, a
, b
, in
[3] + 0xf4d50d87, 14);
1191 MD5STEP(F2
, b
, c
, d
, a
, in
[8] + 0x455a14ed, 20);
1192 MD5STEP(F2
, a
, b
, c
, d
, in
[13] + 0xa9e3e905, 5);
1193 MD5STEP(F2
, d
, a
, b
, c
, in
[2] + 0xfcefa3f8, 9);
1194 MD5STEP(F2
, c
, d
, a
, b
, in
[7] + 0x676f02d9, 14);
1195 MD5STEP(F2
, b
, c
, d
, a
, in
[12] + 0x8d2a4c8a, 20);
1197 MD5STEP(F3
, a
, b
, c
, d
, in
[5] + 0xfffa3942, 4);
1198 MD5STEP(F3
, d
, a
, b
, c
, in
[8] + 0x8771f681, 11);
1199 MD5STEP(F3
, c
, d
, a
, b
, in
[11] + 0x6d9d6122, 16);
1200 MD5STEP(F3
, b
, c
, d
, a
, in
[14] + 0xfde5380c, 23);
1201 MD5STEP(F3
, a
, b
, c
, d
, in
[1] + 0xa4beea44, 4);
1202 MD5STEP(F3
, d
, a
, b
, c
, in
[4] + 0x4bdecfa9, 11);
1203 MD5STEP(F3
, c
, d
, a
, b
, in
[7] + 0xf6bb4b60, 16);
1204 MD5STEP(F3
, b
, c
, d
, a
, in
[10] + 0xbebfbc70, 23);
1205 MD5STEP(F3
, a
, b
, c
, d
, in
[13] + 0x289b7ec6, 4);
1206 MD5STEP(F3
, d
, a
, b
, c
, in
[0] + 0xeaa127fa, 11);
1207 MD5STEP(F3
, c
, d
, a
, b
, in
[3] + 0xd4ef3085, 16);
1208 MD5STEP(F3
, b
, c
, d
, a
, in
[6] + 0x04881d05, 23);
1209 MD5STEP(F3
, a
, b
, c
, d
, in
[9] + 0xd9d4d039, 4);
1210 MD5STEP(F3
, d
, a
, b
, c
, in
[12] + 0xe6db99e5, 11);
1211 MD5STEP(F3
, c
, d
, a
, b
, in
[15] + 0x1fa27cf8, 16);
1212 MD5STEP(F3
, b
, c
, d
, a
, in
[2] + 0xc4ac5665, 23);
1214 MD5STEP(F4
, a
, b
, c
, d
, in
[0] + 0xf4292244, 6);
1215 MD5STEP(F4
, d
, a
, b
, c
, in
[7] + 0x432aff97, 10);
1216 MD5STEP(F4
, c
, d
, a
, b
, in
[14] + 0xab9423a7, 15);
1217 MD5STEP(F4
, b
, c
, d
, a
, in
[5] + 0xfc93a039, 21);
1218 MD5STEP(F4
, a
, b
, c
, d
, in
[12] + 0x655b59c3, 6);
1219 MD5STEP(F4
, d
, a
, b
, c
, in
[3] + 0x8f0ccc92, 10);
1220 MD5STEP(F4
, c
, d
, a
, b
, in
[10] + 0xffeff47d, 15);
1221 MD5STEP(F4
, b
, c
, d
, a
, in
[1] + 0x85845dd1, 21);
1222 MD5STEP(F4
, a
, b
, c
, d
, in
[8] + 0x6fa87e4f, 6);
1223 MD5STEP(F4
, d
, a
, b
, c
, in
[15] + 0xfe2ce6e0, 10);
1224 MD5STEP(F4
, c
, d
, a
, b
, in
[6] + 0xa3014314, 15);
1225 MD5STEP(F4
, b
, c
, d
, a
, in
[13] + 0x4e0811a1, 21);
1226 MD5STEP(F4
, a
, b
, c
, d
, in
[4] + 0xf7537e82, 6);
1227 MD5STEP(F4
, d
, a
, b
, c
, in
[11] + 0xbd3af235, 10);
1228 MD5STEP(F4
, c
, d
, a
, b
, in
[2] + 0x2ad7d2bb, 15);
1229 MD5STEP(F4
, b
, c
, d
, a
, in
[9] + 0xeb86d391, 21);
1237 #include "fcaliastail.h"