]> git.wh0rd.org - fontconfig.git/blob - src/fccache.c
fc-cache: add a --root option
[fontconfig.git] / src / fccache.c
1 /*
2 * Copyright © 2000 Keith Packard
3 * Copyright © 2005 Patrick Lam
4 *
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.
14 *
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.
22 */
23
24 #include "fcint.h"
25 #include "fcarch.h"
26 #include <stdio.h>
27 #include <fcntl.h>
28 #include <dirent.h>
29 #include <string.h>
30 #include <sys/types.h>
31 #include <assert.h>
32 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
33 # include <unistd.h>
34 # include <sys/mman.h>
35 #elif defined(_WIN32)
36 # define _WIN32_WINNT 0x0500
37 # include <windows.h>
38 #endif
39
40 #ifndef O_BINARY
41 #define O_BINARY 0
42 #endif
43
44
45 struct MD5Context {
46 FcChar32 buf[4];
47 FcChar32 bits[2];
48 unsigned char in[64];
49 };
50
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]);
55
56 #define CACHEBASE_LEN (1 + 32 + 1 + sizeof (FC_ARCHITECTURE) + sizeof (FC_CACHE_SUFFIX))
57
58 #ifdef _WIN32
59
60 #include <windows.h>
61
62 #ifdef __GNUC__
63 typedef long long INT64;
64 #define EPOCH_OFFSET 11644473600ll
65 #else
66 #define EPOCH_OFFSET 11644473600i64
67 typedef __int64 INT64;
68 #endif
69
70 /* Workaround for problems in the stat() in the Microsoft C library:
71 *
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.
78 *
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.
87 */
88
89 int
90 FcStat (FcConfig *config, const FcChar8 *file, struct stat *statb)
91 {
92 WIN32_FILE_ATTRIBUTE_DATA wfad;
93 char full_path_name[MAX_PATH];
94 char *basename;
95 DWORD rc;
96
97 if (!GetFileAttributesEx (file, GetFileExInfoStandard, &wfad))
98 return -1;
99
100 statb->st_dev = 0;
101
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
104 * is on disk.
105 */
106 rc = GetFullPathName (file, sizeof (full_path_name), full_path_name, &basename);
107 if (rc == 0 || rc > sizeof (full_path_name))
108 return -1;
109
110 rc = GetLongPathName (full_path_name, full_path_name, sizeof (full_path_name));
111 statb->st_ino = FcStringHash (full_path_name);
112
113 statb->st_mode = _S_IREAD | _S_IWRITE;
114 statb->st_mode |= (statb->st_mode >> 3) | (statb->st_mode >> 6);
115
116 if (wfad.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)
117 statb->st_mode |= _S_IFDIR;
118 else
119 statb->st_mode |= _S_IFREG;
120
121 statb->st_nlink = 1;
122 statb->st_uid = statb->st_gid = 0;
123 statb->st_rdev = 0;
124
125 if (wfad.nFileSizeHigh > 0)
126 return -1;
127 statb->st_size = wfad.nFileSizeLow;
128
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;
132
133 return 0;
134 }
135
136 #else
137
138 int
139 FcStat (FcConfig *config, const FcChar8 *file, struct stat *statb)
140 {
141 int ret;
142 FcChar8 *fullFile = FcConfigGetRootPlus (config, file);
143
144 if (fullFile)
145 file = fullFile;
146 ret = stat ((char *) file, statb);
147 if (fullFile)
148 FcStrFree (fullFile);
149
150 return ret;
151 }
152
153 #endif
154
155 static const char bin2hex[] = { '0', '1', '2', '3',
156 '4', '5', '6', '7',
157 '8', '9', 'a', 'b',
158 'c', 'd', 'e', 'f' };
159
160 static FcChar8 *
161 FcDirCacheBasename (const FcChar8 * dir, FcChar8 cache_base[CACHEBASE_LEN])
162 {
163 unsigned char hash[16];
164 FcChar8 *hex_hash;
165 int cnt;
166 struct MD5Context ctx;
167
168 MD5Init (&ctx);
169 MD5Update (&ctx, (const unsigned char *)dir, strlen ((const char *) dir));
170
171 MD5Final (hash, &ctx);
172
173 cache_base[0] = '/';
174 hex_hash = cache_base + 1;
175 for (cnt = 0; cnt < 16; ++cnt)
176 {
177 hex_hash[2*cnt ] = bin2hex[hash[cnt] >> 4];
178 hex_hash[2*cnt+1] = bin2hex[hash[cnt] & 0xf];
179 }
180 hex_hash[2*cnt] = 0;
181 strcat ((char *) cache_base, "-" FC_ARCHITECTURE FC_CACHE_SUFFIX);
182
183 return cache_base;
184 }
185
186 FcBool
187 FcDirCacheUnlink (const FcChar8 *dir, FcConfig *config)
188 {
189 FcChar8 *cache_hashed = NULL;
190 FcChar8 cache_base[CACHEBASE_LEN];
191 FcStrList *list;
192 FcChar8 *cache_dir;
193
194 FcDirCacheBasename (dir, cache_base);
195
196 list = FcStrListCreate (config->cacheDirs);
197 if (!list)
198 return FcFalse;
199
200 while ((cache_dir = FcStrListNext (list)))
201 {
202 cache_hashed = FcStrPlus (cache_dir, cache_base);
203 if (!cache_hashed)
204 break;
205 (void) unlink ((char *) cache_hashed);
206 FcStrFree (cache_hashed);
207 }
208 FcStrListDone (list);
209 /* return FcFalse if something went wrong */
210 if (cache_dir)
211 return FcFalse;
212 return FcTrue;
213 }
214
215 static int
216 FcDirCacheOpenFile (FcConfig *config, const FcChar8 *cache_file, struct stat *file_stat)
217 {
218 int fd;
219 FcChar8 *fullFile;
220
221 #ifdef _WIN32
222 if (FcStat (config, cache_file, file_stat) < 0)
223 return -1;
224 #endif
225 fullFile = FcConfigGetRootPlus (config, cache_file);
226 if (fullFile)
227 cache_file = fullFile;
228 fd = open ((char *) cache_file, O_RDONLY | O_BINARY);
229 if (fullFile)
230 FcStrFree (fullFile);
231 if (fd < 0)
232 return fd;
233 #ifndef _WIN32
234 if (fstat (fd, file_stat) < 0)
235 {
236 close (fd);
237 return -1;
238 }
239 #endif
240 return fd;
241 }
242
243 /*
244 * Look for a cache file for the specified dir. Attempt
245 * to use each one we find, stopping when the callback
246 * indicates success
247 */
248 static FcBool
249 FcDirCacheProcess (FcConfig *config, const FcChar8 *dir,
250 FcBool (*callback) (FcConfig *config, int fd, struct stat *fd_stat,
251 struct stat *dir_stat, void *closure),
252 void *closure, FcChar8 **cache_file_ret)
253 {
254 int fd = -1;
255 FcChar8 cache_base[CACHEBASE_LEN];
256 FcStrList *list;
257 FcChar8 *cache_dir;
258 struct stat file_stat, dir_stat;
259 FcBool ret = FcFalse;
260
261 if (FcStat (config, dir, &dir_stat) < 0)
262 return FcFalse;
263
264 FcDirCacheBasename (dir, cache_base);
265
266 list = FcStrListCreate (config->cacheDirs);
267 if (!list)
268 return FcFalse;
269
270 while ((cache_dir = FcStrListNext (list)))
271 {
272 FcChar8 *cache_hashed = FcStrPlus (cache_dir, cache_base);
273 if (!cache_hashed)
274 break;
275 fd = FcDirCacheOpenFile (config, cache_hashed, &file_stat);
276 if (fd >= 0) {
277 ret = (*callback) (config, fd, &file_stat, &dir_stat, closure);
278 close (fd);
279 if (ret)
280 {
281 if (cache_file_ret)
282 *cache_file_ret = cache_hashed;
283 else
284 FcStrFree (cache_hashed);
285 break;
286 }
287 }
288 FcStrFree (cache_hashed);
289 }
290 FcStrListDone (list);
291
292 return ret;
293 }
294
295 #define FC_CACHE_MIN_MMAP 1024
296
297 /*
298 * Skip list element, make sure the 'next' pointer is the last thing
299 * in the structure, it will be allocated large enough to hold all
300 * of the necessary pointers
301 */
302
303 typedef struct _FcCacheSkip FcCacheSkip;
304
305 struct _FcCacheSkip {
306 FcCache *cache;
307 int ref;
308 intptr_t size;
309 dev_t cache_dev;
310 ino_t cache_ino;
311 time_t cache_mtime;
312 FcCacheSkip *next[1];
313 };
314
315 /*
316 * The head of the skip list; pointers for every possible level
317 * in the skip list, plus the largest level in the list
318 */
319
320 #define FC_CACHE_MAX_LEVEL 16
321
322 static FcCacheSkip *fcCacheChains[FC_CACHE_MAX_LEVEL];
323 static int fcCacheMaxLevel;
324
325 #if HAVE_RANDOM
326 # define FcRandom() random()
327 #else
328 # if HAVE_LRAND48
329 # define FcRandom() lrand48()
330 # else
331 # if HAVE_RAND
332 # define FcRandom() rand()
333 # endif
334 # endif
335 #endif
336 /*
337 * Generate a random level number, distributed
338 * so that each level is 1/4 as likely as the one before
339 *
340 * Note that level numbers run 1 <= level <= MAX_LEVEL
341 */
342 static int
343 random_level (void)
344 {
345 /* tricky bit -- each bit is '1' 75% of the time */
346 long int bits = FcRandom () | FcRandom ();
347 int level = 0;
348
349 while (++level < FC_CACHE_MAX_LEVEL)
350 {
351 if (bits & 1)
352 break;
353 bits >>= 1;
354 }
355 return level;
356 }
357
358 /*
359 * Insert cache into the list
360 */
361 static FcBool
362 FcCacheInsert (FcCache *cache, struct stat *cache_stat)
363 {
364 FcCacheSkip **update[FC_CACHE_MAX_LEVEL];
365 FcCacheSkip *s, **next;
366 int i, level;
367
368 /*
369 * Find links along each chain
370 */
371 next = fcCacheChains;
372 for (i = fcCacheMaxLevel; --i >= 0; )
373 {
374 for (; (s = next[i]); next = s->next)
375 if (s->cache > cache)
376 break;
377 update[i] = &next[i];
378 }
379
380 /*
381 * Create new list element
382 */
383 level = random_level ();
384 if (level > fcCacheMaxLevel)
385 {
386 level = fcCacheMaxLevel + 1;
387 update[fcCacheMaxLevel] = &fcCacheChains[fcCacheMaxLevel];
388 fcCacheMaxLevel = level;
389 }
390
391 s = malloc (sizeof (FcCacheSkip) + (level - 1) * sizeof (FcCacheSkip *));
392 if (!s)
393 return FcFalse;
394
395 s->cache = cache;
396 s->size = cache->size;
397 s->ref = 1;
398 if (cache_stat)
399 {
400 s->cache_dev = cache_stat->st_dev;
401 s->cache_ino = cache_stat->st_ino;
402 s->cache_mtime = cache_stat->st_mtime;
403 }
404 else
405 {
406 s->cache_dev = 0;
407 s->cache_ino = 0;
408 s->cache_mtime = 0;
409 }
410
411 /*
412 * Insert into all fcCacheChains
413 */
414 for (i = 0; i < level; i++)
415 {
416 s->next[i] = *update[i];
417 *update[i] = s;
418 }
419 return FcTrue;
420 }
421
422 static FcCacheSkip *
423 FcCacheFindByAddr (void *object)
424 {
425 int i;
426 FcCacheSkip **next = fcCacheChains;
427 FcCacheSkip *s;
428
429 /*
430 * Walk chain pointers one level at a time
431 */
432 for (i = fcCacheMaxLevel; --i >= 0;)
433 while (next[i] && (char *) object >= ((char *) next[i]->cache + next[i]->size))
434 next = next[i]->next;
435 /*
436 * Here we are
437 */
438 s = next[0];
439 if (s && (char *) object < ((char *) s->cache + s->size))
440 return s;
441 return NULL;
442 }
443
444 static void
445 FcCacheRemove (FcCache *cache)
446 {
447 FcCacheSkip **update[FC_CACHE_MAX_LEVEL];
448 FcCacheSkip *s, **next;
449 int i;
450
451 /*
452 * Find links along each chain
453 */
454 next = fcCacheChains;
455 for (i = fcCacheMaxLevel; --i >= 0; )
456 {
457 for (; (s = next[i]); next = s->next)
458 if (s->cache >= cache)
459 break;
460 update[i] = &next[i];
461 }
462 s = next[0];
463 for (i = 0; i < fcCacheMaxLevel && *update[i] == s; i++)
464 *update[i] = s->next[i];
465 while (fcCacheMaxLevel > 0 && fcCacheChains[fcCacheMaxLevel - 1] == NULL)
466 fcCacheMaxLevel--;
467 free (s);
468 }
469
470 static FcCache *
471 FcCacheFindByStat (struct stat *cache_stat)
472 {
473 FcCacheSkip *s;
474
475 for (s = fcCacheChains[0]; s; s = s->next[0])
476 if (s->cache_dev == cache_stat->st_dev &&
477 s->cache_ino == cache_stat->st_ino &&
478 s->cache_mtime == cache_stat->st_mtime)
479 {
480 s->ref++;
481 return s->cache;
482 }
483 return NULL;
484 }
485
486 static void
487 FcDirCacheDispose (FcCache *cache)
488 {
489 switch (cache->magic) {
490 case FC_CACHE_MAGIC_ALLOC:
491 free (cache);
492 break;
493 case FC_CACHE_MAGIC_MMAP:
494 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
495 munmap (cache, cache->size);
496 #elif defined(_WIN32)
497 UnmapViewOfFile (cache);
498 #endif
499 break;
500 }
501 FcCacheRemove (cache);
502 }
503
504 void
505 FcCacheObjectReference (void *object)
506 {
507 FcCacheSkip *skip = FcCacheFindByAddr (object);
508
509 if (skip)
510 skip->ref++;
511 }
512
513 void
514 FcCacheObjectDereference (void *object)
515 {
516 FcCacheSkip *skip = FcCacheFindByAddr (object);
517
518 if (skip)
519 {
520 skip->ref--;
521 if (skip->ref <= 0)
522 FcDirCacheDispose (skip->cache);
523 }
524 }
525
526 void
527 FcCacheFini (void)
528 {
529 int i;
530
531 for (i = 0; i < FC_CACHE_MAX_LEVEL; i++)
532 assert (fcCacheChains[i] == NULL);
533 assert (fcCacheMaxLevel == 0);
534 }
535
536 static FcBool
537 FcCacheTimeValid (FcConfig *config, FcCache *cache, struct stat *dir_stat)
538 {
539 struct stat dir_static;
540
541 if (!dir_stat)
542 {
543 if (FcStat (config, FcCacheDir (cache), &dir_static) < 0)
544 return FcFalse;
545 dir_stat = &dir_static;
546 }
547 if (FcDebug () & FC_DBG_CACHE)
548 printf ("FcCacheTimeValid dir \"%s\" cache time %d dir time %d\n",
549 FcCacheDir (cache), cache->mtime, (int) dir_stat->st_mtime);
550 return cache->mtime == (int) dir_stat->st_mtime;
551 }
552
553 /*
554 * Map a cache file into memory
555 */
556 static FcCache *
557 FcDirCacheMapFd (FcConfig *config, int fd, struct stat *fd_stat, struct stat *dir_stat)
558 {
559 FcCache *cache;
560 FcBool allocated = FcFalse;
561
562 if (fd_stat->st_size < sizeof (FcCache))
563 return NULL;
564 cache = FcCacheFindByStat (fd_stat);
565 if (cache)
566 {
567 if (FcCacheTimeValid (config, cache, dir_stat))
568 return cache;
569 FcDirCacheUnload (cache);
570 cache = NULL;
571 }
572
573 /*
574 * Lage cache files are mmap'ed, smaller cache files are read. This
575 * balances the system cost of mmap against per-process memory usage.
576 */
577 if (fd_stat->st_size >= FC_CACHE_MIN_MMAP)
578 {
579 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
580 cache = mmap (0, fd_stat->st_size, PROT_READ, MAP_SHARED, fd, 0);
581 if (cache == MAP_FAILED)
582 cache = NULL;
583 #elif defined(_WIN32)
584 {
585 HANDLE hFileMap;
586
587 cache = NULL;
588 hFileMap = CreateFileMapping((HANDLE) _get_osfhandle(fd), NULL,
589 PAGE_READONLY, 0, 0, NULL);
590 if (hFileMap != NULL)
591 {
592 cache = MapViewOfFile (hFileMap, FILE_MAP_READ, 0, 0,
593 fd_stat->st_size);
594 CloseHandle (hFileMap);
595 }
596 }
597 #endif
598 }
599 if (!cache)
600 {
601 cache = malloc (fd_stat->st_size);
602 if (!cache)
603 return NULL;
604
605 if (read (fd, cache, fd_stat->st_size) != fd_stat->st_size)
606 {
607 free (cache);
608 return NULL;
609 }
610 allocated = FcTrue;
611 }
612 if (cache->magic != FC_CACHE_MAGIC_MMAP ||
613 cache->version < FC_CACHE_CONTENT_VERSION ||
614 cache->size != fd_stat->st_size ||
615 !FcCacheTimeValid (config, cache, dir_stat) ||
616 !FcCacheInsert (cache, fd_stat))
617 {
618 if (allocated)
619 free (cache);
620 else
621 {
622 #if defined(HAVE_MMAP) || defined(__CYGWIN__)
623 munmap (cache, fd_stat->st_size);
624 #elif defined(_WIN32)
625 UnmapViewOfFile (cache);
626 #endif
627 }
628 return NULL;
629 }
630
631 /* Mark allocated caches so they're freed rather than unmapped */
632 if (allocated)
633 cache->magic = FC_CACHE_MAGIC_ALLOC;
634
635 return cache;
636 }
637
638 void
639 FcDirCacheReference (FcCache *cache, int nref)
640 {
641 FcCacheSkip *skip = FcCacheFindByAddr (cache);
642
643 if (skip)
644 skip->ref += nref;
645 }
646
647 void
648 FcDirCacheUnload (FcCache *cache)
649 {
650 FcCacheObjectDereference (cache);
651 }
652
653 static FcBool
654 FcDirCacheMapHelper (FcConfig *config, int fd, struct stat *fd_stat, struct stat *dir_stat, void *closure)
655 {
656 FcCache *cache = FcDirCacheMapFd (config, fd, fd_stat, dir_stat);
657
658 if (!cache)
659 return FcFalse;
660 *((FcCache **) closure) = cache;
661 return FcTrue;
662 }
663
664 FcCache *
665 FcDirCacheLoad (const FcChar8 *dir, FcConfig *config, FcChar8 **cache_file)
666 {
667 FcCache *cache = NULL;
668
669 if (!FcDirCacheProcess (config, dir,
670 FcDirCacheMapHelper,
671 &cache, cache_file))
672 return NULL;
673 return cache;
674 }
675
676 FcCache *
677 FcDirCacheLoadFile (const FcChar8 *cache_file, struct stat *file_stat)
678 {
679 return FcDirCacheLoadFile2 (cache_file, FcConfigGetCurrent (), file_stat);
680 }
681
682 FcCache *
683 FcDirCacheLoadFile2 (const FcChar8 *cache_file, FcConfig *config, struct stat *file_stat)
684 {
685 int fd;
686 FcCache *cache;
687 struct stat my_file_stat;
688
689 if (!file_stat)
690 file_stat = &my_file_stat;
691 fd = FcDirCacheOpenFile (config, cache_file, file_stat);
692 if (fd < 0)
693 return NULL;
694 cache = FcDirCacheMapFd (config, fd, file_stat, NULL);
695 close (fd);
696 return cache;
697 }
698
699 /*
700 * Validate a cache file by reading the header and checking
701 * the magic number and the size field
702 */
703 static FcBool
704 FcDirCacheValidateHelper (FcConfig *config, int fd, struct stat *fd_stat, struct stat *dir_stat, void *closure)
705 {
706 FcBool ret = FcTrue;
707 FcCache c;
708
709 if (read (fd, &c, sizeof (FcCache)) != sizeof (FcCache))
710 ret = FcFalse;
711 else if (c.magic != FC_CACHE_MAGIC_MMAP)
712 ret = FcFalse;
713 else if (c.version < FC_CACHE_CONTENT_VERSION)
714 ret = FcFalse;
715 else if (fd_stat->st_size != c.size)
716 ret = FcFalse;
717 else if (c.mtime != (int) dir_stat->st_mtime)
718 ret = FcFalse;
719 return ret;
720 }
721
722 static FcBool
723 FcDirCacheValidConfig (const FcChar8 *dir, FcConfig *config)
724 {
725 return FcDirCacheProcess (config, dir,
726 FcDirCacheValidateHelper,
727 NULL, NULL);
728 }
729
730 FcBool
731 FcDirCacheValid (const FcChar8 *dir)
732 {
733 FcConfig *config;
734
735 config = FcConfigGetCurrent ();
736 if (!config)
737 return FcFalse;
738
739 return FcDirCacheValidConfig (dir, config);
740 }
741
742 /*
743 * Build a cache structure from the given contents
744 */
745 FcCache *
746 FcDirCacheBuild (FcFontSet *set, const FcChar8 *dir, struct stat *dir_stat, FcStrSet *dirs)
747 {
748 FcSerialize *serialize = FcSerializeCreate ();
749 FcCache *cache;
750 int i;
751 FcChar8 *dir_serialize;
752 intptr_t *dirs_serialize;
753 FcFontSet *set_serialize;
754
755 if (!serialize)
756 return NULL;
757 /*
758 * Space for cache structure
759 */
760 FcSerializeReserve (serialize, sizeof (FcCache));
761 /*
762 * Directory name
763 */
764 if (!FcStrSerializeAlloc (serialize, dir))
765 goto bail1;
766 /*
767 * Subdirs
768 */
769 FcSerializeAlloc (serialize, dirs, dirs->num * sizeof (FcChar8 *));
770 for (i = 0; i < dirs->num; i++)
771 if (!FcStrSerializeAlloc (serialize, dirs->strs[i]))
772 goto bail1;
773
774 /*
775 * Patterns
776 */
777 if (!FcFontSetSerializeAlloc (serialize, set))
778 goto bail1;
779
780 /* Serialize layout complete. Now allocate space and fill it */
781 cache = malloc (serialize->size);
782 if (!cache)
783 goto bail1;
784 /* shut up valgrind */
785 memset (cache, 0, serialize->size);
786
787 serialize->linear = cache;
788
789 cache->magic = FC_CACHE_MAGIC_ALLOC;
790 cache->version = FC_CACHE_CONTENT_VERSION;
791 cache->size = serialize->size;
792 cache->mtime = (int) dir_stat->st_mtime;
793
794 /*
795 * Serialize directory name
796 */
797 dir_serialize = FcStrSerialize (serialize, dir);
798 if (!dir_serialize)
799 goto bail2;
800 cache->dir = FcPtrToOffset (cache, dir_serialize);
801
802 /*
803 * Serialize sub dirs
804 */
805 dirs_serialize = FcSerializePtr (serialize, dirs);
806 if (!dirs_serialize)
807 goto bail2;
808 cache->dirs = FcPtrToOffset (cache, dirs_serialize);
809 cache->dirs_count = dirs->num;
810 for (i = 0; i < dirs->num; i++)
811 {
812 FcChar8 *d_serialize = FcStrSerialize (serialize, dirs->strs[i]);
813 if (!d_serialize)
814 goto bail2;
815 dirs_serialize[i] = FcPtrToOffset (dirs_serialize, d_serialize);
816 }
817
818 /*
819 * Serialize font set
820 */
821 set_serialize = FcFontSetSerialize (serialize, set);
822 if (!set_serialize)
823 goto bail2;
824 cache->set = FcPtrToOffset (cache, set_serialize);
825
826 FcSerializeDestroy (serialize);
827
828 FcCacheInsert (cache, NULL);
829
830 return cache;
831
832 bail2:
833 free (cache);
834 bail1:
835 FcSerializeDestroy (serialize);
836 return NULL;
837 }
838
839
840 #ifdef _WIN32
841 #define mkdir(path,mode) _mkdir(path)
842 #endif
843
844 static FcBool
845 FcMakeDirectory (const FcChar8 *dir)
846 {
847 FcChar8 *parent;
848 FcBool ret;
849
850 if (strlen ((char *) dir) == 0)
851 return FcFalse;
852
853 parent = FcStrDirname (dir);
854 if (!parent)
855 return FcFalse;
856 if (access ((char *) parent, F_OK) == 0)
857 ret = mkdir ((char *) dir, 0755) == 0 && chmod ((char *) dir, 0755) == 0;
858 else if (access ((char *) parent, F_OK) == -1)
859 ret = FcMakeDirectory (parent) && (mkdir ((char *) dir, 0755) == 0) && chmod ((char *) dir, 0755) == 0;
860 else
861 ret = FcFalse;
862 FcStrFree (parent);
863 return ret;
864 }
865
866 /* write serialized state to the cache file */
867 FcBool
868 FcDirCacheWrite (FcCache *cache, FcConfig *config)
869 {
870 FcChar8 *dir = FcCacheDir (cache);
871 FcChar8 cache_base[CACHEBASE_LEN];
872 FcChar8 *cache_hashed;
873 int fd;
874 FcAtomic *atomic;
875 FcStrList *list;
876 FcChar8 *cache_dir = NULL;
877 FcChar8 *test_dir;
878 FcChar8 *full_test_dir;
879 FcBool free_test_dir;
880 FcCacheSkip *skip;
881 struct stat cache_stat;
882 int magic;
883 int written;
884
885 /*
886 * Write it to the first directory in the list which is writable
887 */
888
889 list = FcStrListCreate (config->cacheDirs);
890 if (!list)
891 return FcFalse;
892 free_test_dir = FcFalse;
893 while ((test_dir = FcStrListNext (list))) {
894 if (free_test_dir)
895 FcStrFree (full_test_dir);
896 free_test_dir = FcFalse;
897
898 full_test_dir = FcConfigGetRootPlus (config, test_dir);
899 if (full_test_dir)
900 {
901 free_test_dir = FcTrue;
902 test_dir = full_test_dir;
903 }
904
905 if (access ((char *) test_dir, W_OK|X_OK) == 0)
906 {
907 cache_dir = test_dir;
908 break;
909 }
910 else
911 {
912 /*
913 * If the directory doesn't exist, try to create it
914 */
915 if (access ((char *) test_dir, F_OK) == -1) {
916 if (FcMakeDirectory (test_dir))
917 {
918 cache_dir = test_dir;
919 break;
920 }
921 }
922 /*
923 * Otherwise, try making it writable
924 */
925 else if (chmod ((char *) test_dir, 0755) == 0)
926 {
927 cache_dir = test_dir;
928 break;
929 }
930 }
931 }
932 FcStrListDone (list);
933 if (!cache_dir)
934 goto bail0;
935
936 FcDirCacheBasename (dir, cache_base);
937 cache_hashed = FcStrPlus (cache_dir, cache_base);
938 if (!cache_hashed)
939 goto bail0;
940
941 if (FcDebug () & FC_DBG_CACHE)
942 printf ("FcDirCacheWriteDir dir \"%s\" file \"%s\"\n",
943 dir, cache_hashed);
944
945 atomic = FcAtomicCreate ((FcChar8 *)cache_hashed);
946 if (!atomic)
947 goto bail1;
948
949 if (!FcAtomicLock2 (config, atomic))
950 goto bail3;
951
952 fd = open((char *)FcAtomicNewFile (atomic), O_RDWR | O_CREAT | O_BINARY, 0666);
953 if (fd == -1)
954 goto bail4;
955
956 /* Temporarily switch magic to MMAP while writing to file */
957 magic = cache->magic;
958 if (magic != FC_CACHE_MAGIC_MMAP)
959 cache->magic = FC_CACHE_MAGIC_MMAP;
960
961 /*
962 * Write cache contents to file
963 */
964 written = write (fd, cache, cache->size);
965
966 /* Switch magic back */
967 if (magic != FC_CACHE_MAGIC_MMAP)
968 cache->magic = magic;
969
970 if (written != cache->size)
971 {
972 perror ("write cache");
973 goto bail5;
974 }
975
976 close(fd);
977 if (!FcAtomicReplaceOrig(atomic))
978 goto bail4;
979
980 /* If the file is small, update the cache chain entry such that the
981 * new cache file is not read again. If it's large, we don't do that
982 * such that we reload it, using mmap, which is shared across processes.
983 */
984 if (cache->size < FC_CACHE_MIN_MMAP &&
985 (skip = FcCacheFindByAddr (cache)) &&
986 FcStat (config, cache_hashed, &cache_stat))
987 {
988 skip->cache_dev = cache_stat.st_dev;
989 skip->cache_ino = cache_stat.st_ino;
990 skip->cache_mtime = cache_stat.st_mtime;
991 }
992
993 FcStrFree (cache_hashed);
994 FcAtomicUnlock (atomic);
995 FcAtomicDestroy (atomic);
996 return FcTrue;
997
998 bail5:
999 close (fd);
1000 bail4:
1001 FcAtomicUnlock (atomic);
1002 bail3:
1003 FcAtomicDestroy (atomic);
1004 bail1:
1005 FcStrFree (cache_hashed);
1006 bail0:
1007 if (free_test_dir)
1008 FcStrFree (full_test_dir);
1009 return FcFalse;
1010 }
1011
1012 /*
1013 * Hokey little macro trick to permit the definitions of C functions
1014 * with the same name as CPP macros
1015 */
1016 #define args1(x) (x)
1017 #define args2(x,y) (x,y)
1018
1019 const FcChar8 *
1020 FcCacheDir args1(const FcCache *c)
1021 {
1022 return FcCacheDir (c);
1023 }
1024
1025 FcFontSet *
1026 FcCacheCopySet args1(const FcCache *c)
1027 {
1028 FcFontSet *old = FcCacheSet (c);
1029 FcFontSet *new = FcFontSetCreate ();
1030 int i;
1031
1032 if (!new)
1033 return NULL;
1034 for (i = 0; i < old->nfont; i++)
1035 {
1036 FcPattern *font = FcFontSetFont (old, i);
1037
1038 FcPatternReference (font);
1039 if (!FcFontSetAdd (new, font))
1040 {
1041 FcFontSetDestroy (new);
1042 return NULL;
1043 }
1044 }
1045 return new;
1046 }
1047
1048 const FcChar8 *
1049 FcCacheSubdir args2(const FcCache *c, int i)
1050 {
1051 return FcCacheSubdir (c, i);
1052 }
1053
1054 int
1055 FcCacheNumSubdir args1(const FcCache *c)
1056 {
1057 return c->dirs_count;
1058 }
1059
1060 int
1061 FcCacheNumFont args1(const FcCache *c)
1062 {
1063 return FcCacheSet(c)->nfont;
1064 }
1065
1066 /*
1067 * This code implements the MD5 message-digest algorithm.
1068 * The algorithm is due to Ron Rivest. This code was
1069 * written by Colin Plumb in 1993, no copyright is claimed.
1070 * This code is in the public domain; do with it what you wish.
1071 *
1072 * Equivalent code is available from RSA Data Security, Inc.
1073 * This code has been tested against that, and is equivalent,
1074 * except that you don't need to include two pages of legalese
1075 * with every copy.
1076 *
1077 * To compute the message digest of a chunk of bytes, declare an
1078 * MD5Context structure, pass it to MD5Init, call MD5Update as
1079 * needed on buffers full of bytes, and then call MD5Final, which
1080 * will fill a supplied 16-byte array with the digest.
1081 */
1082
1083 #ifndef HIGHFIRST
1084 #define byteReverse(buf, len) /* Nothing */
1085 #else
1086 /*
1087 * Note: this code is harmless on little-endian machines.
1088 */
1089 void byteReverse(unsigned char *buf, unsigned longs)
1090 {
1091 FcChar32 t;
1092 do {
1093 t = (FcChar32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
1094 ((unsigned) buf[1] << 8 | buf[0]);
1095 *(FcChar32 *) buf = t;
1096 buf += 4;
1097 } while (--longs);
1098 }
1099 #endif
1100
1101 /*
1102 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
1103 * initialization constants.
1104 */
1105 static void MD5Init(struct MD5Context *ctx)
1106 {
1107 ctx->buf[0] = 0x67452301;
1108 ctx->buf[1] = 0xefcdab89;
1109 ctx->buf[2] = 0x98badcfe;
1110 ctx->buf[3] = 0x10325476;
1111
1112 ctx->bits[0] = 0;
1113 ctx->bits[1] = 0;
1114 }
1115
1116 /*
1117 * Update context to reflect the concatenation of another buffer full
1118 * of bytes.
1119 */
1120 static void MD5Update(struct MD5Context *ctx, const unsigned char *buf, unsigned len)
1121 {
1122 FcChar32 t;
1123
1124 /* Update bitcount */
1125
1126 t = ctx->bits[0];
1127 if ((ctx->bits[0] = t + ((FcChar32) len << 3)) < t)
1128 ctx->bits[1]++; /* Carry from low to high */
1129 ctx->bits[1] += len >> 29;
1130
1131 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
1132
1133 /* Handle any leading odd-sized chunks */
1134
1135 if (t) {
1136 unsigned char *p = (unsigned char *) ctx->in + t;
1137
1138 t = 64 - t;
1139 if (len < t) {
1140 memcpy(p, buf, len);
1141 return;
1142 }
1143 memcpy(p, buf, t);
1144 byteReverse(ctx->in, 16);
1145 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
1146 buf += t;
1147 len -= t;
1148 }
1149 /* Process data in 64-byte chunks */
1150
1151 while (len >= 64) {
1152 memcpy(ctx->in, buf, 64);
1153 byteReverse(ctx->in, 16);
1154 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
1155 buf += 64;
1156 len -= 64;
1157 }
1158
1159 /* Handle any remaining bytes of data. */
1160
1161 memcpy(ctx->in, buf, len);
1162 }
1163
1164 /*
1165 * Final wrapup - pad to 64-byte boundary with the bit pattern
1166 * 1 0* (64-bit count of bits processed, MSB-first)
1167 */
1168 static void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
1169 {
1170 unsigned count;
1171 unsigned char *p;
1172
1173 /* Compute number of bytes mod 64 */
1174 count = (ctx->bits[0] >> 3) & 0x3F;
1175
1176 /* Set the first char of padding to 0x80. This is safe since there is
1177 always at least one byte free */
1178 p = ctx->in + count;
1179 *p++ = 0x80;
1180
1181 /* Bytes of padding needed to make 64 bytes */
1182 count = 64 - 1 - count;
1183
1184 /* Pad out to 56 mod 64 */
1185 if (count < 8) {
1186 /* Two lots of padding: Pad the first block to 64 bytes */
1187 memset(p, 0, count);
1188 byteReverse(ctx->in, 16);
1189 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
1190
1191 /* Now fill the next block with 56 bytes */
1192 memset(ctx->in, 0, 56);
1193 } else {
1194 /* Pad block to 56 bytes */
1195 memset(p, 0, count - 8);
1196 }
1197 byteReverse(ctx->in, 14);
1198
1199 /* Append length in bits and transform */
1200 ((FcChar32 *) ctx->in)[14] = ctx->bits[0];
1201 ((FcChar32 *) ctx->in)[15] = ctx->bits[1];
1202
1203 MD5Transform(ctx->buf, (FcChar32 *) ctx->in);
1204 byteReverse((unsigned char *) ctx->buf, 4);
1205 memcpy(digest, ctx->buf, 16);
1206 memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */
1207 }
1208
1209
1210 /* The four core functions - F1 is optimized somewhat */
1211
1212 /* #define F1(x, y, z) (x & y | ~x & z) */
1213 #define F1(x, y, z) (z ^ (x & (y ^ z)))
1214 #define F2(x, y, z) F1(z, x, y)
1215 #define F3(x, y, z) (x ^ y ^ z)
1216 #define F4(x, y, z) (y ^ (x | ~z))
1217
1218 /* This is the central step in the MD5 algorithm. */
1219 #define MD5STEP(f, w, x, y, z, data, s) \
1220 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
1221
1222 /*
1223 * The core of the MD5 algorithm, this alters an existing MD5 hash to
1224 * reflect the addition of 16 longwords of new data. MD5Update blocks
1225 * the data and converts bytes into longwords for this routine.
1226 */
1227 static void MD5Transform(FcChar32 buf[4], FcChar32 in[16])
1228 {
1229 register FcChar32 a, b, c, d;
1230
1231 a = buf[0];
1232 b = buf[1];
1233 c = buf[2];
1234 d = buf[3];
1235
1236 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
1237 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
1238 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
1239 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
1240 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
1241 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
1242 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
1243 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
1244 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
1245 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
1246 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
1247 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
1248 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
1249 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
1250 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
1251 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
1252
1253 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
1254 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
1255 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
1256 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
1257 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
1258 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
1259 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
1260 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
1261 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
1262 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
1263 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
1264 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
1265 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
1266 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
1267 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
1268 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
1269
1270 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
1271 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
1272 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
1273 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
1274 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
1275 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
1276 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
1277 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
1278 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
1279 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
1280 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
1281 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
1282 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
1283 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
1284 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
1285 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
1286
1287 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
1288 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
1289 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
1290 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
1291 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
1292 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
1293 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
1294 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
1295 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
1296 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
1297 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
1298 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
1299 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
1300 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
1301 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
1302 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
1303
1304 buf[0] += a;
1305 buf[1] += b;
1306 buf[2] += c;
1307 buf[3] += d;
1308 }
1309 #define __fccache__
1310 #include "fcaliastail.h"
1311 #undef __fccache__