2002-02-15 00:34:13 +01:00
|
|
|
/*
|
2004-12-07 02:14:46 +01:00
|
|
|
* Copyright © 2000 Keith Packard
|
2005-09-03 06:56:56 +02:00
|
|
|
* Copyright © 2005 Patrick Lam
|
2002-02-15 00:34:13 +01:00
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, distribute, and sell this software and its
|
|
|
|
* documentation for any purpose is hereby granted without fee, provided that
|
|
|
|
* the above copyright notice appear in all copies and that both that
|
|
|
|
* copyright notice and this permission notice appear in supporting
|
|
|
|
* documentation, and that the name of Keith Packard not be used in
|
|
|
|
* advertising or publicity pertaining to distribution of the software without
|
|
|
|
* specific, written prior permission. Keith Packard makes no
|
|
|
|
* representations about the suitability of this software for any purpose. It
|
|
|
|
* is provided "as is" without express or implied warranty.
|
|
|
|
*
|
|
|
|
* KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
|
|
|
|
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
|
|
|
|
* EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
|
|
|
|
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
|
|
|
|
* DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
|
|
|
|
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
|
|
* PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2006-04-25 07:57:41 +02:00
|
|
|
#include "fcint.h"
|
2006-08-28 03:29:51 +02:00
|
|
|
#include "../fc-arch/fcarch.h"
|
2006-08-28 06:53:48 +02:00
|
|
|
#include <stdio.h>
|
2005-07-25 06:10:09 +02:00
|
|
|
#include <fcntl.h>
|
2005-08-24 08:21:30 +02:00
|
|
|
#include <dirent.h>
|
2005-12-09 17:36:45 +01:00
|
|
|
#include <string.h>
|
2005-08-31 01:03:42 +02:00
|
|
|
#include <sys/types.h>
|
2006-04-07 06:42:32 +02:00
|
|
|
#if defined(HAVE_MMAP) || defined(__CYGWIN__)
|
2006-04-19 18:53:50 +02:00
|
|
|
# include <unistd.h>
|
2006-04-07 06:42:32 +02:00
|
|
|
# include <sys/mman.h>
|
2006-04-19 18:53:50 +02:00
|
|
|
#elif defined(_WIN32)
|
|
|
|
# include <windows.h>
|
2006-04-07 06:42:32 +02:00
|
|
|
#endif
|
2002-02-15 00:34:13 +01:00
|
|
|
|
2006-02-09 19:44:14 +01:00
|
|
|
#ifndef O_BINARY
|
|
|
|
#define O_BINARY 0
|
|
|
|
#endif
|
|
|
|
|
2005-12-09 17:36:45 +01:00
|
|
|
struct MD5Context {
|
|
|
|
FcChar32 buf[4];
|
|
|
|
FcChar32 bits[2];
|
|
|
|
unsigned char in[64];
|
|
|
|
};
|
|
|
|
|
|
|
|
static void MD5Init(struct MD5Context *ctx);
|
|
|
|
static void MD5Update(struct MD5Context *ctx, unsigned char *buf, unsigned len);
|
|
|
|
static void MD5Final(unsigned char digest[16], struct MD5Context *ctx);
|
|
|
|
static void MD5Transform(FcChar32 buf[4], FcChar32 in[16]);
|
|
|
|
|
2006-08-28 03:29:51 +02:00
|
|
|
#define CACHEBASE_LEN (1 + 32 + 1 + sizeof (FC_ARCHITECTURE) + sizeof (FC_CACHE_SUFFIX))
|
2006-08-04 18:13:00 +02:00
|
|
|
|
|
|
|
static const char bin2hex[] = { '0', '1', '2', '3',
|
|
|
|
'4', '5', '6', '7',
|
|
|
|
'8', '9', 'a', 'b',
|
|
|
|
'c', 'd', 'e', 'f' };
|
|
|
|
|
|
|
|
static FcChar8 *
|
|
|
|
FcDirCacheBasename (const FcChar8 * dir, FcChar8 cache_base[CACHEBASE_LEN])
|
2005-10-05 02:34:52 +02:00
|
|
|
{
|
2006-08-04 18:13:00 +02:00
|
|
|
unsigned char hash[16];
|
|
|
|
FcChar8 *hex_hash;
|
|
|
|
int cnt;
|
|
|
|
struct MD5Context ctx;
|
2005-10-05 02:34:52 +02:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
MD5Init (&ctx);
|
|
|
|
MD5Update (&ctx, (unsigned char *)dir, strlen ((char *) dir));
|
2005-12-21 04:31:19 +01:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
MD5Final (hash, &ctx);
|
|
|
|
|
|
|
|
cache_base[0] = '/';
|
|
|
|
hex_hash = cache_base + 1;
|
|
|
|
for (cnt = 0; cnt < 16; ++cnt)
|
2005-10-13 14:32:14 +02:00
|
|
|
{
|
2006-08-04 18:13:00 +02:00
|
|
|
hex_hash[2*cnt ] = bin2hex[hash[cnt] >> 4];
|
|
|
|
hex_hash[2*cnt+1] = bin2hex[hash[cnt] & 0xf];
|
|
|
|
}
|
|
|
|
hex_hash[2*cnt] = 0;
|
2006-08-28 03:29:51 +02:00
|
|
|
strcat ((char *) cache_base, "-" FC_ARCHITECTURE FC_CACHE_SUFFIX);
|
2006-01-25 03:33:46 +01:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
return cache_base;
|
|
|
|
}
|
2005-12-21 04:31:19 +01:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
FcBool
|
|
|
|
FcDirCacheUnlink (const FcChar8 *dir, FcConfig *config)
|
|
|
|
{
|
|
|
|
FcChar8 *cache_hashed = NULL;
|
|
|
|
FcChar8 cache_base[CACHEBASE_LEN];
|
|
|
|
FcStrList *list;
|
|
|
|
FcChar8 *cache_dir;
|
2005-12-21 04:31:19 +01:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
FcDirCacheBasename (dir, cache_base);
|
2005-12-21 04:31:19 +01:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
list = FcStrListCreate (config->cacheDirs);
|
|
|
|
if (!list)
|
|
|
|
return FcFalse;
|
|
|
|
|
|
|
|
while ((cache_dir = FcStrListNext (list)))
|
2005-12-21 04:31:19 +01:00
|
|
|
{
|
2006-08-04 18:13:00 +02:00
|
|
|
cache_hashed = FcStrPlus (cache_dir, cache_base);
|
|
|
|
if (!cache_hashed)
|
|
|
|
break;
|
2006-08-28 06:53:48 +02:00
|
|
|
(void) unlink ((char *) cache_hashed);
|
2005-10-13 14:32:14 +02:00
|
|
|
}
|
2006-08-04 18:13:00 +02:00
|
|
|
FcStrListDone (list);
|
|
|
|
/* return FcFalse if something went wrong */
|
|
|
|
if (cache_dir)
|
|
|
|
return FcFalse;
|
2005-08-25 09:38:02 +02:00
|
|
|
return FcTrue;
|
|
|
|
}
|
|
|
|
|
2005-08-24 08:21:30 +02:00
|
|
|
static int
|
2006-08-28 06:53:48 +02:00
|
|
|
FcCacheReadDirs (FcConfig * config,
|
2006-02-07 03:22:50 +01:00
|
|
|
FcStrList *list, FcFontSet * set, FcStrSet *processed_dirs)
|
2005-08-24 08:21:30 +02:00
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
FcChar8 *dir;
|
|
|
|
FcStrSet *subdirs;
|
|
|
|
FcStrList *sublist;
|
|
|
|
|
|
|
|
/*
|
2005-09-03 06:56:56 +02:00
|
|
|
* Read in the results from 'list'.
|
2005-08-24 08:21:30 +02:00
|
|
|
*/
|
|
|
|
while ((dir = FcStrListNext (list)))
|
|
|
|
{
|
2005-11-29 07:23:00 +01:00
|
|
|
if (!FcConfigAcceptFilename (config, dir))
|
|
|
|
continue;
|
|
|
|
|
2006-02-06 23:44:02 +01:00
|
|
|
/* Skip this directory if already updated
|
|
|
|
* to avoid the looped directories via symlinks
|
2006-02-07 23:09:01 +01:00
|
|
|
* Clearly a dir not in fonts.conf shouldn't be globally cached.
|
2006-02-06 23:44:02 +01:00
|
|
|
*/
|
2006-02-07 23:09:01 +01:00
|
|
|
|
|
|
|
if (FcStrSetMember (processed_dirs, dir))
|
|
|
|
continue;
|
|
|
|
if (!FcStrSetAdd (processed_dirs, dir))
|
|
|
|
continue;
|
2005-08-24 08:21:30 +02:00
|
|
|
|
|
|
|
subdirs = FcStrSetCreate ();
|
|
|
|
if (!subdirs)
|
|
|
|
{
|
|
|
|
fprintf (stderr, "Can't create directory set\n");
|
|
|
|
ret++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2006-08-28 06:53:48 +02:00
|
|
|
FcDirScanConfig (set, subdirs,
|
|
|
|
config->blanks, dir, FcFalse, config);
|
|
|
|
|
2005-08-24 08:21:30 +02:00
|
|
|
sublist = FcStrListCreate (subdirs);
|
|
|
|
FcStrSetDestroy (subdirs);
|
|
|
|
if (!sublist)
|
|
|
|
{
|
|
|
|
fprintf (stderr, "Can't create subdir list in \"%s\"\n", dir);
|
|
|
|
ret++;
|
|
|
|
continue;
|
|
|
|
}
|
2006-08-28 06:53:48 +02:00
|
|
|
ret += FcCacheReadDirs (config, sublist, set, processed_dirs);
|
2005-08-24 08:21:30 +02:00
|
|
|
}
|
|
|
|
FcStrListDone (list);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
FcFontSet *
|
2006-08-28 06:53:48 +02:00
|
|
|
FcCacheRead (FcConfig *config)
|
2005-08-24 08:21:30 +02:00
|
|
|
{
|
2006-02-07 03:22:50 +01:00
|
|
|
FcFontSet *s = FcFontSetCreate();
|
|
|
|
FcStrSet *processed_dirs;
|
|
|
|
|
2005-08-24 08:21:30 +02:00
|
|
|
if (!s)
|
|
|
|
return 0;
|
|
|
|
|
2006-02-07 03:22:50 +01:00
|
|
|
processed_dirs = FcStrSetCreate();
|
|
|
|
if (!processed_dirs)
|
2005-08-24 08:21:30 +02:00
|
|
|
goto bail;
|
|
|
|
|
2006-08-28 06:53:48 +02:00
|
|
|
if (FcCacheReadDirs (config, FcConfigGetConfigDirs (config), s, processed_dirs))
|
2006-02-07 03:22:50 +01:00
|
|
|
goto bail1;
|
|
|
|
|
|
|
|
FcStrSetDestroy (processed_dirs);
|
2005-08-24 08:21:30 +02:00
|
|
|
return s;
|
|
|
|
|
2006-02-07 03:22:50 +01:00
|
|
|
bail1:
|
|
|
|
FcStrSetDestroy (processed_dirs);
|
2005-08-24 08:21:30 +02:00
|
|
|
bail:
|
|
|
|
FcFontSetDestroy (s);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-08-31 06:59:53 +02:00
|
|
|
/*
|
|
|
|
* Look for a cache file for the specified dir. Attempt
|
|
|
|
* to use each one we find, stopping when the callback
|
|
|
|
* indicates success
|
2006-08-04 18:13:00 +02:00
|
|
|
*/
|
2006-08-31 06:59:53 +02:00
|
|
|
static FcBool
|
|
|
|
FcDirCacheProcess (FcConfig *config, const FcChar8 *dir,
|
|
|
|
FcBool (*callback) (int fd, off_t size, void *closure),
|
|
|
|
void *closure)
|
2005-12-09 17:36:45 +01:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
int fd = -1;
|
2006-08-04 18:13:00 +02:00
|
|
|
FcChar8 cache_base[CACHEBASE_LEN];
|
|
|
|
FcStrList *list;
|
|
|
|
FcChar8 *cache_dir;
|
2006-08-28 02:04:01 +02:00
|
|
|
struct stat file_stat, dir_stat;
|
2006-08-31 06:59:53 +02:00
|
|
|
FcBool ret = FcFalse;
|
2006-08-28 02:04:01 +02:00
|
|
|
|
|
|
|
if (stat ((char *) dir, &dir_stat) < 0)
|
2006-08-31 06:59:53 +02:00
|
|
|
return FcFalse;
|
2006-01-10 14:15:05 +01:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
FcDirCacheBasename (dir, cache_base);
|
2005-12-09 17:36:45 +01:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
list = FcStrListCreate (config->cacheDirs);
|
|
|
|
if (!list)
|
2006-08-31 06:59:53 +02:00
|
|
|
return FcFalse;
|
2006-08-04 18:13:00 +02:00
|
|
|
|
|
|
|
while ((cache_dir = FcStrListNext (list)))
|
2005-12-09 17:36:45 +01:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
FcChar8 *cache_hashed = FcStrPlus (cache_dir, cache_base);
|
2006-08-04 18:13:00 +02:00
|
|
|
if (!cache_hashed)
|
2006-02-11 06:01:32 +01:00
|
|
|
break;
|
2006-08-30 13:16:22 +02:00
|
|
|
fd = open((char *) cache_hashed, O_RDONLY | O_BINARY);
|
|
|
|
FcStrFree (cache_hashed);
|
|
|
|
if (fd >= 0) {
|
|
|
|
if (fstat (fd, &file_stat) >= 0 &&
|
2006-08-28 02:04:01 +02:00
|
|
|
dir_stat.st_mtime <= file_stat.st_mtime)
|
|
|
|
{
|
2006-08-31 06:59:53 +02:00
|
|
|
ret = (*callback) (fd, file_stat.st_size, closure);
|
|
|
|
if (ret)
|
|
|
|
{
|
|
|
|
close (fd);
|
|
|
|
break;
|
|
|
|
}
|
2006-08-28 02:04:01 +02:00
|
|
|
}
|
2006-08-30 13:16:22 +02:00
|
|
|
close (fd);
|
2006-08-28 02:04:01 +02:00
|
|
|
}
|
2006-08-04 18:13:00 +02:00
|
|
|
}
|
|
|
|
FcStrListDone (list);
|
|
|
|
|
2006-08-31 06:59:53 +02:00
|
|
|
return ret;
|
2005-12-09 17:36:45 +01:00
|
|
|
}
|
|
|
|
|
2006-08-31 18:42:49 +02:00
|
|
|
FcBool
|
|
|
|
FcDirCacheLoad (int fd, off_t size, void *closure)
|
2005-07-25 06:10:09 +02:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
FcCache *cache;
|
|
|
|
FcBool allocated = FcFalse;
|
2006-08-28 07:24:39 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
if (size < sizeof (FcCache))
|
2006-08-31 06:59:53 +02:00
|
|
|
return FcFalse;
|
2006-04-07 06:42:32 +02:00
|
|
|
#if defined(HAVE_MMAP) || defined(__CYGWIN__)
|
2006-08-30 13:16:22 +02:00
|
|
|
cache = mmap (0, size, PROT_READ, MAP_SHARED, fd, 0);
|
2006-04-19 18:53:50 +02:00
|
|
|
#elif defined(_WIN32)
|
2006-08-30 13:16:22 +02:00
|
|
|
{
|
|
|
|
HANDLE hFileMap;
|
2006-04-19 18:53:50 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
cache = NULL;
|
|
|
|
hFileMap = CreateFileMapping((HANDLE) _get_osfhandle(fd), NULL,
|
|
|
|
PAGE_READONLY, 0, 0, NULL);
|
|
|
|
if (hFileMap != NULL)
|
|
|
|
{
|
|
|
|
cache = MapViewOfFile (hFileMap, FILE_MAP_READ, 0, 0, size);
|
|
|
|
CloseHandle (hFileMap);
|
2006-04-19 18:53:50 +02:00
|
|
|
}
|
2006-08-30 13:16:22 +02:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
if (!cache)
|
|
|
|
{
|
|
|
|
cache = malloc (size);
|
|
|
|
if (!cache)
|
2006-08-31 06:59:53 +02:00
|
|
|
return FcFalse;
|
2005-08-30 07:55:13 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
if (read (fd, cache, size) != size)
|
2006-08-28 06:53:48 +02:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
free (cache);
|
2006-08-31 06:59:53 +02:00
|
|
|
return FcFalse;
|
2006-08-28 06:53:48 +02:00
|
|
|
}
|
2006-08-30 13:16:22 +02:00
|
|
|
allocated = FcTrue;
|
|
|
|
}
|
|
|
|
if (cache->magic != FC_CACHE_MAGIC ||
|
|
|
|
cache->size != size)
|
|
|
|
{
|
|
|
|
if (allocated)
|
|
|
|
free (cache);
|
|
|
|
else
|
|
|
|
{
|
|
|
|
#if defined(HAVE_MMAP) || defined(__CYGWIN__)
|
|
|
|
munmap (cache, size);
|
|
|
|
#elif defined(_WIN32)
|
|
|
|
UnmapViewOfFile (cache);
|
2006-08-28 06:53:48 +02:00
|
|
|
#endif
|
2006-08-30 13:16:22 +02:00
|
|
|
}
|
2006-08-31 06:59:53 +02:00
|
|
|
return FcFalse;
|
2006-08-28 06:53:48 +02:00
|
|
|
}
|
2006-08-28 07:24:39 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
/* Mark allocated caches so they're freed rather than unmapped */
|
|
|
|
if (allocated)
|
|
|
|
cache->magic = FC_CACHE_MAGIC_COPY;
|
|
|
|
|
2006-08-31 06:59:53 +02:00
|
|
|
*((FcCache **) closure) = cache;
|
|
|
|
return FcTrue;
|
|
|
|
}
|
|
|
|
|
|
|
|
FcCache *
|
2006-08-31 07:23:25 +02:00
|
|
|
FcDirCacheMap (const FcChar8 *dir, FcConfig *config)
|
2006-08-31 06:59:53 +02:00
|
|
|
{
|
2006-08-31 07:23:25 +02:00
|
|
|
FcCache *cache = NULL;
|
2006-08-31 06:59:53 +02:00
|
|
|
|
2006-08-31 07:23:25 +02:00
|
|
|
if (!FcDirCacheProcess (config, dir,
|
2006-08-31 18:42:49 +02:00
|
|
|
FcDirCacheLoad,
|
2006-08-31 07:23:25 +02:00
|
|
|
&cache))
|
|
|
|
return NULL;
|
|
|
|
return cache;
|
2006-08-28 07:24:39 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
FcBool
|
|
|
|
FcDirCacheRead (FcFontSet * set, FcStrSet * dirs,
|
|
|
|
const FcChar8 *dir, FcConfig *config)
|
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
FcCache *cache;
|
|
|
|
int i;
|
|
|
|
FcFontSet *cache_set;
|
|
|
|
intptr_t *cache_dirs;
|
|
|
|
FcPattern **cache_fonts;
|
2006-08-28 07:24:39 +02:00
|
|
|
|
2006-08-31 07:23:25 +02:00
|
|
|
cache = FcDirCacheMap (dir, config);
|
|
|
|
if (!cache)
|
2006-08-30 13:16:22 +02:00
|
|
|
return FcFalse;
|
|
|
|
|
|
|
|
cache_set = FcCacheSet (cache);
|
|
|
|
cache_fonts = FcFontSetFonts(cache_set);
|
|
|
|
if (FcDebug() & FC_DBG_CACHE)
|
|
|
|
printf ("FcDirCacheRead mapped cache for %s (%d fonts %d subdirs)\n",
|
|
|
|
dir, cache_set->nfont, cache->dirs_count);
|
|
|
|
for (i = 0; i < cache_set->nfont; i++)
|
|
|
|
{
|
|
|
|
FcPattern *font = FcEncodedOffsetToPtr (cache_set,
|
|
|
|
cache_fonts[i],
|
|
|
|
FcPattern);
|
|
|
|
if (FcDebug() & FC_DBG_CACHEV) {
|
|
|
|
printf ("Mapped font %d\n", i);
|
|
|
|
FcPatternPrint (font);
|
|
|
|
}
|
|
|
|
FcFontSetAdd (set, font);
|
|
|
|
}
|
|
|
|
|
|
|
|
cache_dirs = FcCacheDirs (cache);
|
|
|
|
for (i = 0; i < cache->dirs_count; i++)
|
|
|
|
FcStrSetAdd (dirs, FcOffsetToPtr (cache_dirs,
|
|
|
|
cache_dirs[i],
|
|
|
|
FcChar8));
|
|
|
|
|
2006-01-09 14:58:04 +01:00
|
|
|
if (config)
|
|
|
|
FcConfigAddFontDir (config, (FcChar8 *)dir);
|
2006-08-28 07:24:39 +02:00
|
|
|
|
2005-07-25 06:10:09 +02:00
|
|
|
return FcTrue;
|
2005-08-30 07:55:13 +02:00
|
|
|
}
|
2006-08-28 07:24:39 +02:00
|
|
|
|
2006-08-31 06:59:53 +02:00
|
|
|
static FcBool
|
|
|
|
FcDirCacheValidate (int fd, off_t size, void *closure)
|
|
|
|
{
|
|
|
|
FcBool ret = FcTrue;
|
|
|
|
FcCache c;
|
|
|
|
struct stat file_stat;
|
|
|
|
|
|
|
|
if (read (fd, &c, sizeof (FcCache)) != sizeof (FcCache))
|
|
|
|
ret = FcFalse;
|
|
|
|
else if (fstat (fd, &file_stat) < 0)
|
|
|
|
ret = FcFalse;
|
|
|
|
else if (c.magic != FC_CACHE_MAGIC)
|
|
|
|
ret = FcFalse;
|
|
|
|
else if (file_stat.st_size != c.size)
|
|
|
|
ret = FcFalse;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
FcBool
|
|
|
|
FcDirCacheValid (const FcChar8 *dir, FcConfig *config)
|
|
|
|
{
|
|
|
|
return FcDirCacheProcess (config, dir, FcDirCacheValidate, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
FcDirCacheUnmap (FcCache *cache)
|
|
|
|
{
|
|
|
|
if (cache->magic == FC_CACHE_MAGIC_COPY)
|
|
|
|
{
|
|
|
|
free (cache);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#if defined(HAVE_MMAP) || defined(__CYGWIN__)
|
|
|
|
munmap (cache, cache->size);
|
|
|
|
#elif defined(_WIN32)
|
|
|
|
UnmapViewOfFile (cache);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
/*
|
|
|
|
* Cache file is:
|
|
|
|
*
|
|
|
|
* FcCache
|
|
|
|
* dir name
|
|
|
|
* subdirs
|
|
|
|
* FcFontSet
|
|
|
|
*/
|
2005-08-30 07:55:13 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
static FcCache *
|
|
|
|
FcDirCacheProduce (FcFontSet *set, const FcChar8 *dir, FcStrSet *dirs)
|
2005-08-30 07:55:13 +02:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
FcSerialize *serialize = FcSerializeCreate ();
|
|
|
|
FcCache *cache;
|
|
|
|
int i;
|
|
|
|
intptr_t cache_offset;
|
|
|
|
intptr_t dirs_offset;
|
|
|
|
FcChar8 *dir_serialize;
|
|
|
|
intptr_t *dirs_serialize;
|
|
|
|
FcFontSet *set_serialize;
|
|
|
|
|
|
|
|
if (!serialize)
|
|
|
|
return NULL;
|
|
|
|
/*
|
|
|
|
* Space for cache structure
|
|
|
|
*/
|
|
|
|
cache_offset = FcSerializeReserve (serialize, sizeof (FcCache));
|
|
|
|
/*
|
|
|
|
* Directory name
|
|
|
|
*/
|
|
|
|
if (!FcStrSerializeAlloc (serialize, dir))
|
|
|
|
goto bail1;
|
|
|
|
/*
|
|
|
|
* Subdirs
|
|
|
|
*/
|
|
|
|
dirs_offset = FcSerializeAlloc (serialize, dirs, dirs->num * sizeof (FcChar8 *));
|
|
|
|
for (i = 0; i < dirs->num; i++)
|
|
|
|
if (!FcStrSerializeAlloc (serialize, dirs->strs[i]))
|
|
|
|
goto bail1;
|
2005-08-30 07:55:13 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
/*
|
|
|
|
* Patterns
|
|
|
|
*/
|
|
|
|
if (!FcFontSetSerializeAlloc (serialize, set))
|
|
|
|
goto bail1;
|
|
|
|
|
|
|
|
/* Serialize layout complete. Now allocate space and fill it */
|
|
|
|
cache = malloc (serialize->size);
|
|
|
|
if (!cache)
|
|
|
|
goto bail1;
|
|
|
|
/* shut up valgrind */
|
|
|
|
memset (cache, 0, serialize->size);
|
2006-04-07 06:42:32 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
serialize->linear = cache;
|
2005-08-30 07:55:13 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
cache->magic = FC_CACHE_MAGIC;
|
|
|
|
cache->size = serialize->size;
|
2005-08-30 07:55:13 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
/*
|
|
|
|
* Serialize directory name
|
|
|
|
*/
|
|
|
|
dir_serialize = FcStrSerialize (serialize, dir);
|
|
|
|
if (!dir_serialize)
|
|
|
|
goto bail2;
|
|
|
|
cache->dir = FcPtrToOffset (cache, dir_serialize);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Serialize sub dirs
|
|
|
|
*/
|
|
|
|
dirs_serialize = FcSerializePtr (serialize, dirs);
|
|
|
|
if (!dirs_serialize)
|
|
|
|
goto bail2;
|
|
|
|
cache->dirs = FcPtrToOffset (cache, dirs_serialize);
|
|
|
|
cache->dirs_count = dirs->num;
|
|
|
|
for (i = 0; i < dirs->num; i++)
|
2005-11-16 18:49:01 +01:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
FcChar8 *d_serialize = FcStrSerialize (serialize, dirs->strs[i]);
|
|
|
|
if (!d_serialize)
|
|
|
|
goto bail2;
|
|
|
|
dirs_serialize[i] = FcPtrToOffset (dirs_serialize, d_serialize);
|
2005-11-16 18:49:01 +01:00
|
|
|
}
|
2006-08-30 13:16:22 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Serialize font set
|
|
|
|
*/
|
|
|
|
set_serialize = FcFontSetSerialize (serialize, set);
|
|
|
|
if (!set_serialize)
|
|
|
|
goto bail2;
|
|
|
|
cache->set = FcPtrToOffset (cache, set_serialize);
|
2005-08-30 07:55:13 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
FcSerializeDestroy (serialize);
|
|
|
|
|
|
|
|
return cache;
|
2005-07-25 06:10:09 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
bail2:
|
|
|
|
free (cache);
|
|
|
|
bail1:
|
|
|
|
FcSerializeDestroy (serialize);
|
|
|
|
return NULL;
|
2005-07-25 06:10:09 +02:00
|
|
|
}
|
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
static FcBool
|
|
|
|
FcMakeDirectory (const FcChar8 *dir)
|
|
|
|
{
|
|
|
|
FcChar8 *parent;
|
|
|
|
FcBool ret;
|
|
|
|
|
|
|
|
if (strlen ((char *) dir) == 0)
|
|
|
|
return FcFalse;
|
|
|
|
|
|
|
|
parent = FcStrDirname (dir);
|
|
|
|
if (!parent)
|
|
|
|
return FcFalse;
|
|
|
|
if (access ((char *) parent, W_OK|X_OK) == 0)
|
|
|
|
ret = mkdir ((char *) dir, 0777) == 0;
|
|
|
|
else if (access ((char *) parent, F_OK) == -1)
|
|
|
|
ret = FcMakeDirectory (parent) && (mkdir ((char *) dir, 0777) == 0);
|
|
|
|
else
|
|
|
|
ret = FcFalse;
|
|
|
|
FcStrFree (parent);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2005-07-25 06:10:09 +02:00
|
|
|
/* write serialized state to the cache file */
|
|
|
|
FcBool
|
2006-08-04 18:13:00 +02:00
|
|
|
FcDirCacheWrite (FcFontSet *set, FcStrSet *dirs, const FcChar8 *dir, FcConfig *config)
|
2005-07-25 06:10:09 +02:00
|
|
|
{
|
2006-08-04 18:13:00 +02:00
|
|
|
FcChar8 cache_base[CACHEBASE_LEN];
|
|
|
|
FcChar8 *cache_hashed;
|
2006-08-30 13:16:22 +02:00
|
|
|
int fd;
|
2005-09-28 02:23:15 +02:00
|
|
|
FcAtomic *atomic;
|
2006-08-30 13:16:22 +02:00
|
|
|
FcCache *cache;
|
2006-08-28 06:53:48 +02:00
|
|
|
FcStrList *list;
|
2006-08-28 02:04:01 +02:00
|
|
|
FcChar8 *cache_dir = NULL;
|
|
|
|
FcChar8 *test_dir;
|
2005-07-25 06:10:09 +02:00
|
|
|
|
2006-08-04 18:13:00 +02:00
|
|
|
/*
|
2006-08-28 02:04:01 +02:00
|
|
|
* Write it to the first directory in the list which is writable
|
2006-08-04 18:13:00 +02:00
|
|
|
*/
|
2006-08-28 02:04:01 +02:00
|
|
|
|
|
|
|
list = FcStrListCreate (config->cacheDirs);
|
|
|
|
if (!list)
|
|
|
|
return FcFalse;
|
|
|
|
while ((test_dir = FcStrListNext (list))) {
|
|
|
|
if (access ((char *) test_dir, W_OK|X_OK) == 0)
|
|
|
|
{
|
|
|
|
cache_dir = test_dir;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-08-04 18:13:00 +02:00
|
|
|
/*
|
|
|
|
* If the directory doesn't exist, try to create it
|
|
|
|
*/
|
2006-08-28 02:04:01 +02:00
|
|
|
if (access ((char *) test_dir, F_OK) == -1) {
|
|
|
|
if (FcMakeDirectory (test_dir))
|
|
|
|
{
|
|
|
|
cache_dir = test_dir;
|
2006-08-04 18:13:00 +02:00
|
|
|
break;
|
2006-08-28 02:04:01 +02:00
|
|
|
}
|
2006-08-04 18:13:00 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2006-08-28 02:04:01 +02:00
|
|
|
FcStrListDone (list);
|
|
|
|
if (!cache_dir)
|
|
|
|
return FcFalse;
|
2006-08-30 13:16:22 +02:00
|
|
|
|
2006-08-28 02:04:01 +02:00
|
|
|
FcDirCacheBasename (dir, cache_base);
|
|
|
|
cache_hashed = FcStrPlus (cache_dir, cache_base);
|
|
|
|
if (!cache_hashed)
|
|
|
|
return FcFalse;
|
2005-12-09 17:36:45 +01:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
cache = FcDirCacheProduce (set, dir, dirs);
|
2005-07-25 06:10:09 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
if (!cache)
|
2005-12-09 17:36:45 +01:00
|
|
|
goto bail1;
|
2005-07-25 06:10:09 +02:00
|
|
|
|
2005-08-24 08:21:30 +02:00
|
|
|
if (FcDebug () & FC_DBG_CACHE)
|
2006-04-27 09:11:44 +02:00
|
|
|
printf ("FcDirCacheWriteDir dir \"%s\" file \"%s\"\n",
|
|
|
|
dir, cache_hashed);
|
2005-08-24 08:21:30 +02:00
|
|
|
|
2005-12-21 04:31:19 +01:00
|
|
|
atomic = FcAtomicCreate ((FcChar8 *)cache_hashed);
|
2005-09-28 02:23:15 +02:00
|
|
|
if (!atomic)
|
2006-08-30 13:16:22 +02:00
|
|
|
goto bail2;
|
2005-07-25 06:10:09 +02:00
|
|
|
|
2005-09-28 02:23:15 +02:00
|
|
|
if (!FcAtomicLock (atomic))
|
2006-08-30 13:16:22 +02:00
|
|
|
goto bail3;
|
2005-12-12 21:45:54 +01:00
|
|
|
|
2006-02-09 19:44:14 +01:00
|
|
|
fd = open((char *)FcAtomicNewFile (atomic), O_RDWR | O_CREAT | O_BINARY, 0666);
|
2005-09-28 02:23:15 +02:00
|
|
|
if (fd == -1)
|
2006-08-30 13:16:22 +02:00
|
|
|
goto bail4;
|
2006-08-28 06:53:48 +02:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
if (write (fd, cache, cache->size) != cache->size)
|
2006-02-06 23:44:02 +01:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
perror ("write cache");
|
2006-02-05 03:57:21 +01:00
|
|
|
goto bail5;
|
|
|
|
}
|
2005-08-24 08:21:30 +02:00
|
|
|
|
2005-07-25 06:10:09 +02:00
|
|
|
close(fd);
|
2005-09-28 02:23:15 +02:00
|
|
|
if (!FcAtomicReplaceOrig(atomic))
|
2006-08-30 13:16:22 +02:00
|
|
|
goto bail4;
|
2005-12-21 04:31:19 +01:00
|
|
|
FcStrFree ((FcChar8 *)cache_hashed);
|
2005-09-28 02:23:15 +02:00
|
|
|
FcAtomicUnlock (atomic);
|
|
|
|
FcAtomicDestroy (atomic);
|
2005-07-25 06:10:09 +02:00
|
|
|
return FcTrue;
|
|
|
|
|
2005-12-09 17:36:45 +01:00
|
|
|
bail5:
|
2005-09-28 02:23:15 +02:00
|
|
|
close (fd);
|
2006-08-30 13:16:22 +02:00
|
|
|
bail4:
|
2005-09-28 02:23:15 +02:00
|
|
|
FcAtomicUnlock (atomic);
|
2006-08-30 13:16:22 +02:00
|
|
|
bail3:
|
2005-09-28 02:23:15 +02:00
|
|
|
FcAtomicDestroy (atomic);
|
2006-08-30 13:16:22 +02:00
|
|
|
bail2:
|
|
|
|
free (cache);
|
2005-12-09 17:36:45 +01:00
|
|
|
bail1:
|
2005-12-21 04:31:19 +01:00
|
|
|
FcStrFree ((FcChar8 *)cache_hashed);
|
2005-08-24 08:21:30 +02:00
|
|
|
return FcFalse;
|
|
|
|
}
|
|
|
|
|
2005-12-09 17:36:45 +01:00
|
|
|
/*
|
|
|
|
* This code implements the MD5 message-digest algorithm.
|
|
|
|
* The algorithm is due to Ron Rivest. This code was
|
|
|
|
* written by Colin Plumb in 1993, no copyright is claimed.
|
|
|
|
* This code is in the public domain; do with it what you wish.
|
|
|
|
*
|
|
|
|
* Equivalent code is available from RSA Data Security, Inc.
|
|
|
|
* This code has been tested against that, and is equivalent,
|
|
|
|
* except that you don't need to include two pages of legalese
|
|
|
|
* with every copy.
|
|
|
|
*
|
|
|
|
* To compute the message digest of a chunk of bytes, declare an
|
|
|
|
* MD5Context structure, pass it to MD5Init, call MD5Update as
|
|
|
|
* needed on buffers full of bytes, and then call MD5Final, which
|
|
|
|
* will fill a supplied 16-byte array with the digest.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef HIGHFIRST
|
|
|
|
#define byteReverse(buf, len) /* Nothing */
|
|
|
|
#else
|
|
|
|
/*
|
|
|
|
* Note: this code is harmless on little-endian machines.
|
|
|
|
*/
|
|
|
|
void byteReverse(unsigned char *buf, unsigned longs)
|
|
|
|
{
|
|
|
|
FcChar32 t;
|
|
|
|
do {
|
|
|
|
t = (FcChar32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
|
|
|
|
((unsigned) buf[1] << 8 | buf[0]);
|
|
|
|
*(FcChar32 *) buf = t;
|
|
|
|
buf += 4;
|
|
|
|
} while (--longs);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
|
|
|
|
* initialization constants.
|
|
|
|
*/
|
|
|
|
static void MD5Init(struct MD5Context *ctx)
|
|
|
|
{
|
|
|
|
ctx->buf[0] = 0x67452301;
|
|
|
|
ctx->buf[1] = 0xefcdab89;
|
|
|
|
ctx->buf[2] = 0x98badcfe;
|
|
|
|
ctx->buf[3] = 0x10325476;
|
|
|
|
|
|
|
|
ctx->bits[0] = 0;
|
|
|
|
ctx->bits[1] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Update context to reflect the concatenation of another buffer full
|
|
|
|
* of bytes.
|
|
|
|
*/
|
|
|
|
static void MD5Update(struct MD5Context *ctx, unsigned char *buf, unsigned len)
|
|
|
|
{
|
|
|
|
FcChar32 t;
|
|
|
|
|
|
|
|
/* Update bitcount */
|
|
|
|
|
|
|
|
t = ctx->bits[0];
|
|
|
|
if ((ctx->bits[0] = t + ((FcChar32) len << 3)) < t)
|
|
|
|
ctx->bits[1]++; /* Carry from low to high */
|
|
|
|
ctx->bits[1] += len >> 29;
|
|
|
|
|
|
|
|
t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
|
|
|
|
|
|
|
|
/* Handle any leading odd-sized chunks */
|
|
|
|
|
|
|
|
if (t) {
|
|
|
|
unsigned char *p = (unsigned char *) ctx->in + t;
|
|
|
|
|
|
|
|
t = 64 - t;
|
|
|
|
if (len < t) {
|
|
|
|
memcpy(p, buf, len);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
memcpy(p, buf, t);
|
|
|
|
byteReverse(ctx->in, 16);
|
|
|
|
MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
|
|
|
|
buf += t;
|
|
|
|
len -= t;
|
|
|
|
}
|
|
|
|
/* Process data in 64-byte chunks */
|
|
|
|
|
|
|
|
while (len >= 64) {
|
|
|
|
memcpy(ctx->in, buf, 64);
|
|
|
|
byteReverse(ctx->in, 16);
|
|
|
|
MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
|
|
|
|
buf += 64;
|
|
|
|
len -= 64;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Handle any remaining bytes of data. */
|
|
|
|
|
|
|
|
memcpy(ctx->in, buf, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Final wrapup - pad to 64-byte boundary with the bit pattern
|
|
|
|
* 1 0* (64-bit count of bits processed, MSB-first)
|
|
|
|
*/
|
|
|
|
static void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
|
|
|
|
{
|
|
|
|
unsigned count;
|
|
|
|
unsigned char *p;
|
|
|
|
|
|
|
|
/* Compute number of bytes mod 64 */
|
|
|
|
count = (ctx->bits[0] >> 3) & 0x3F;
|
|
|
|
|
|
|
|
/* Set the first char of padding to 0x80. This is safe since there is
|
|
|
|
always at least one byte free */
|
|
|
|
p = ctx->in + count;
|
|
|
|
*p++ = 0x80;
|
|
|
|
|
|
|
|
/* Bytes of padding needed to make 64 bytes */
|
|
|
|
count = 64 - 1 - count;
|
|
|
|
|
|
|
|
/* Pad out to 56 mod 64 */
|
|
|
|
if (count < 8) {
|
|
|
|
/* Two lots of padding: Pad the first block to 64 bytes */
|
|
|
|
memset(p, 0, count);
|
|
|
|
byteReverse(ctx->in, 16);
|
|
|
|
MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
|
|
|
|
|
|
|
|
/* Now fill the next block with 56 bytes */
|
|
|
|
memset(ctx->in, 0, 56);
|
|
|
|
} else {
|
|
|
|
/* Pad block to 56 bytes */
|
|
|
|
memset(p, 0, count - 8);
|
|
|
|
}
|
|
|
|
byteReverse(ctx->in, 14);
|
|
|
|
|
|
|
|
/* Append length in bits and transform */
|
|
|
|
((FcChar32 *) ctx->in)[14] = ctx->bits[0];
|
|
|
|
((FcChar32 *) ctx->in)[15] = ctx->bits[1];
|
|
|
|
|
|
|
|
MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
|
|
|
|
byteReverse((unsigned char *) ctx->buf, 4);
|
|
|
|
memcpy(digest, ctx->buf, 16);
|
|
|
|
memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* The four core functions - F1 is optimized somewhat */
|
|
|
|
|
|
|
|
/* #define F1(x, y, z) (x & y | ~x & z) */
|
|
|
|
#define F1(x, y, z) (z ^ (x & (y ^ z)))
|
|
|
|
#define F2(x, y, z) F1(z, x, y)
|
|
|
|
#define F3(x, y, z) (x ^ y ^ z)
|
|
|
|
#define F4(x, y, z) (y ^ (x | ~z))
|
|
|
|
|
|
|
|
/* This is the central step in the MD5 algorithm. */
|
|
|
|
#define MD5STEP(f, w, x, y, z, data, s) \
|
|
|
|
( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The core of the MD5 algorithm, this alters an existing MD5 hash to
|
|
|
|
* reflect the addition of 16 longwords of new data. MD5Update blocks
|
|
|
|
* the data and converts bytes into longwords for this routine.
|
|
|
|
*/
|
|
|
|
static void MD5Transform(FcChar32 buf[4], FcChar32 in[16])
|
|
|
|
{
|
|
|
|
register FcChar32 a, b, c, d;
|
|
|
|
|
|
|
|
a = buf[0];
|
|
|
|
b = buf[1];
|
|
|
|
c = buf[2];
|
|
|
|
d = buf[3];
|
|
|
|
|
|
|
|
MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
|
|
|
|
MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
|
|
|
|
MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
|
|
|
|
MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
|
|
|
|
MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
|
|
|
|
MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
|
|
|
|
MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
|
|
|
|
MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
|
|
|
|
MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
|
|
|
|
MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
|
|
|
|
MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
|
|
|
|
MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
|
|
|
|
MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
|
|
|
|
MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
|
|
|
|
MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
|
|
|
|
MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
|
|
|
|
|
|
|
|
MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
|
|
|
|
MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
|
|
|
|
MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
|
|
|
|
MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
|
|
|
|
MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
|
|
|
|
MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
|
|
|
|
MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
|
|
|
|
MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
|
|
|
|
MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
|
|
|
|
MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
|
|
|
|
MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
|
|
|
|
MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
|
|
|
|
MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
|
|
|
|
MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
|
|
|
|
MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
|
|
|
|
MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
|
|
|
|
|
|
|
|
MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
|
|
|
|
MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
|
|
|
|
MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
|
|
|
|
MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
|
|
|
|
MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
|
|
|
|
MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
|
|
|
|
MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
|
|
|
|
MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
|
|
|
|
MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
|
|
|
|
MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
|
|
|
|
MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
|
|
|
|
MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
|
|
|
|
MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
|
|
|
|
MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
|
|
|
|
MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
|
|
|
|
MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
|
|
|
|
|
|
|
|
MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
|
|
|
|
MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
|
|
|
|
MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
|
|
|
|
MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
|
|
|
|
MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
|
|
|
|
MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
|
|
|
|
MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
|
|
|
|
MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
|
|
|
|
MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
|
|
|
|
MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
|
|
|
|
MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
|
|
|
|
MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
|
|
|
|
MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
|
|
|
|
MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
|
|
|
|
MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
|
|
|
|
MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
|
|
|
|
|
|
|
|
buf[0] += a;
|
|
|
|
buf[1] += b;
|
|
|
|
buf[2] += c;
|
|
|
|
buf[3] += d;
|
|
|
|
}
|