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