2 * fontconfig/src/fccharset.c
4 * Copyright © 2001 Keith Packard
6 * Permission to use, copy, modify, distribute, and sell this software and its
7 * documentation for any purpose is hereby granted without fee, provided that
8 * the above copyright notice appear in all copies and that both that
9 * copyright notice and this permission notice appear in supporting
10 * documentation, and that the name of Keith Packard not be used in
11 * advertising or publicity pertaining to distribution of the software without
12 * specific, written prior permission. Keith Packard makes no
13 * representations about the suitability of this software for any purpose. It
14 * is provided "as is" without express or implied warranty.
16 * KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
17 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
18 * EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
19 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
20 * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
21 * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
22 * PERFORMANCE OF THIS SOFTWARE.
31 FcCharSetCreate (void)
35 fcs
= (FcCharSet
*) malloc (sizeof (FcCharSet
));
38 FcMemAlloc (FC_MEM_CHARSET
, sizeof (FcCharSet
));
41 fcs
->leaves_offset
= 0;
42 fcs
->numbers_offset
= 0;
49 return FcCharSetCreate ();
53 FcCharSetDestroy (FcCharSet
*fcs
)
57 if (fcs
->ref
== FC_REF_CONSTANT
)
59 FcCacheObjectDereference (fcs
);
64 for (i
= 0; i
< fcs
->num
; i
++)
66 FcMemFree (FC_MEM_CHARLEAF
, sizeof (FcCharLeaf
));
67 free (FcCharSetLeaf (fcs
, i
));
71 FcMemFree (FC_MEM_CHARSET
, fcs
->num
* sizeof (intptr_t));
72 free (FcCharSetLeaves (fcs
));
76 FcMemFree (FC_MEM_CHARSET
, fcs
->num
* sizeof (FcChar16
));
77 free (FcCharSetNumbers (fcs
));
79 FcMemFree (FC_MEM_CHARSET
, sizeof (FcCharSet
));
84 * Locate the leaf containing the specified char, return
85 * its index if it exists, otherwise return negative of
86 * the (position + 1) where it should be inserted
90 FcCharSetFindLeafPos (const FcCharSet
*fcs
, FcChar32 ucs4
)
92 FcChar16
*numbers
= FcCharSetNumbers(fcs
);
95 int high
= fcs
->num
- 1;
102 int mid
= (low
+ high
) >> 1;
111 if (high
< 0 || (high
< fcs
->num
&& numbers
[high
] < ucs4
))
117 FcCharSetFindLeaf (const FcCharSet
*fcs
, FcChar32 ucs4
)
119 int pos
= FcCharSetFindLeafPos (fcs
, ucs4
);
121 return FcCharSetLeaf(fcs
, pos
);
126 FcCharSetPutLeaf (FcCharSet
*fcs
,
131 intptr_t *leaves
= FcCharSetLeaves (fcs
);
132 FcChar16
*numbers
= FcCharSetNumbers (fcs
);
138 leaves
= malloc (sizeof (*leaves
));
141 intptr_t *new_leaves
= realloc (leaves
, (fcs
->num
+ 1) *
143 intptr_t distance
= (intptr_t) new_leaves
- (intptr_t) leaves
;
145 if (new_leaves
&& distance
)
149 for (i
= 0; i
< fcs
->num
; i
++)
150 new_leaves
[i
] -= distance
;
158 FcMemFree (FC_MEM_CHARSET
, fcs
->num
* sizeof (intptr_t));
159 FcMemAlloc (FC_MEM_CHARSET
, (fcs
->num
+ 1) * sizeof (intptr_t));
160 fcs
->leaves_offset
= FcPtrToOffset (fcs
, leaves
);
163 numbers
= malloc (sizeof (FcChar16
));
165 numbers
= realloc (numbers
, (fcs
->num
+ 1) * sizeof (FcChar16
));
170 FcMemFree (FC_MEM_CHARSET
, fcs
->num
* sizeof (FcChar16
));
171 FcMemAlloc (FC_MEM_CHARSET
, (fcs
->num
+ 1) * sizeof (FcChar16
));
172 fcs
->numbers_offset
= FcPtrToOffset (fcs
, numbers
);
174 memmove (leaves
+ pos
+ 1, leaves
+ pos
,
175 (fcs
->num
- pos
) * sizeof (*leaves
));
176 memmove (numbers
+ pos
+ 1, numbers
+ pos
,
177 (fcs
->num
- pos
) * sizeof (*numbers
));
178 numbers
[pos
] = (FcChar16
) ucs4
;
179 leaves
[pos
] = FcPtrToOffset (leaves
, leaf
);
185 * Locate the leaf containing the specified char, creating it
190 FcCharSetFindLeafCreate (FcCharSet
*fcs
, FcChar32 ucs4
)
195 pos
= FcCharSetFindLeafPos (fcs
, ucs4
);
197 return FcCharSetLeaf(fcs
, pos
);
199 leaf
= calloc (1, sizeof (FcCharLeaf
));
204 if (!FcCharSetPutLeaf (fcs
, ucs4
, leaf
, pos
))
209 FcMemAlloc (FC_MEM_CHARLEAF
, sizeof (FcCharLeaf
));
214 FcCharSetInsertLeaf (FcCharSet
*fcs
, FcChar32 ucs4
, FcCharLeaf
*leaf
)
218 pos
= FcCharSetFindLeafPos (fcs
, ucs4
);
221 FcMemFree (FC_MEM_CHARLEAF
, sizeof (FcCharLeaf
));
222 free (FcCharSetLeaf (fcs
, pos
));
223 FcCharSetLeaves(fcs
)[pos
] = FcPtrToOffset (FcCharSetLeaves(fcs
),
228 return FcCharSetPutLeaf (fcs
, ucs4
, leaf
, pos
);
232 FcCharSetAddChar (FcCharSet
*fcs
, FcChar32 ucs4
)
237 if (fcs
->ref
== FC_REF_CONSTANT
)
239 leaf
= FcCharSetFindLeafCreate (fcs
, ucs4
);
242 b
= &leaf
->map
[(ucs4
& 0xff) >> 5];
243 *b
|= (1 << (ucs4
& 0x1f));
248 * An iterator for the leaves of a charset
251 typedef struct _fcCharSetIter
{
258 * Set iter->leaf to the leaf containing iter->ucs4 or higher
262 FcCharSetIterSet (const FcCharSet
*fcs
, FcCharSetIter
*iter
)
264 int pos
= FcCharSetFindLeafPos (fcs
, iter
->ucs4
);
275 iter
->ucs4
= (FcChar32
) FcCharSetNumbers(fcs
)[pos
] << 8;
277 iter
->leaf
= FcCharSetLeaf(fcs
, pos
);
282 FcCharSetIterNext (const FcCharSet
*fcs
, FcCharSetIter
*iter
)
284 int pos
= iter
->pos
+ 1;
292 iter
->ucs4
= (FcChar32
) FcCharSetNumbers(fcs
)[pos
] << 8;
293 iter
->leaf
= FcCharSetLeaf(fcs
, pos
);
300 FcCharSetIterStart (const FcCharSet
*fcs
, FcCharSetIter
*iter
)
304 FcCharSetIterSet (fcs
, iter
);
308 FcCharSetCopy (FcCharSet
*src
)
310 if (src
->ref
!= FC_REF_CONSTANT
)
313 FcCacheObjectReference (src
);
318 FcCharSetEqual (const FcCharSet
*a
, const FcCharSet
*b
)
320 FcCharSetIter ai
, bi
;
325 for (FcCharSetIterStart (a
, &ai
), FcCharSetIterStart (b
, &bi
);
327 FcCharSetIterNext (a
, &ai
), FcCharSetIterNext (b
, &bi
))
329 if (ai
.ucs4
!= bi
.ucs4
)
331 for (i
= 0; i
< 256/32; i
++)
332 if (ai
.leaf
->map
[i
] != bi
.leaf
->map
[i
])
335 return ai
.leaf
== bi
.leaf
;
339 FcCharSetAddLeaf (FcCharSet
*fcs
,
343 FcCharLeaf
*new = FcCharSetFindLeafCreate (fcs
, ucs4
);
351 FcCharSetOperate (const FcCharSet
*a
,
353 FcBool (*overlap
) (FcCharLeaf
*result
,
354 const FcCharLeaf
*al
,
355 const FcCharLeaf
*bl
),
360 FcCharSetIter ai
, bi
;
362 fcs
= FcCharSetCreate ();
365 FcCharSetIterStart (a
, &ai
);
366 FcCharSetIterStart (b
, &bi
);
367 while ((ai
.leaf
|| (bonly
&& bi
.leaf
)) && (bi
.leaf
|| (aonly
&& ai
.leaf
)))
369 if (ai
.ucs4
< bi
.ucs4
)
373 if (!FcCharSetAddLeaf (fcs
, ai
.ucs4
, ai
.leaf
))
375 FcCharSetIterNext (a
, &ai
);
380 FcCharSetIterSet (a
, &ai
);
383 else if (bi
.ucs4
< ai
.ucs4
)
387 if (!FcCharSetAddLeaf (fcs
, bi
.ucs4
, bi
.leaf
))
389 FcCharSetIterNext (b
, &bi
);
394 FcCharSetIterSet (b
, &bi
);
401 if ((*overlap
) (&leaf
, ai
.leaf
, bi
.leaf
))
403 if (!FcCharSetAddLeaf (fcs
, ai
.ucs4
, &leaf
))
406 FcCharSetIterNext (a
, &ai
);
407 FcCharSetIterNext (b
, &bi
);
412 FcCharSetDestroy (fcs
);
418 FcCharSetIntersectLeaf (FcCharLeaf
*result
,
419 const FcCharLeaf
*al
,
420 const FcCharLeaf
*bl
)
423 FcBool nonempty
= FcFalse
;
425 for (i
= 0; i
< 256/32; i
++)
426 if ((result
->map
[i
] = al
->map
[i
] & bl
->map
[i
]))
432 FcCharSetIntersect (const FcCharSet
*a
, const FcCharSet
*b
)
434 return FcCharSetOperate (a
, b
, FcCharSetIntersectLeaf
, FcFalse
, FcFalse
);
438 FcCharSetUnionLeaf (FcCharLeaf
*result
,
439 const FcCharLeaf
*al
,
440 const FcCharLeaf
*bl
)
444 for (i
= 0; i
< 256/32; i
++)
445 result
->map
[i
] = al
->map
[i
] | bl
->map
[i
];
450 FcCharSetUnion (const FcCharSet
*a
, const FcCharSet
*b
)
452 return FcCharSetOperate (a
, b
, FcCharSetUnionLeaf
, FcTrue
, FcTrue
);
456 FcCharSetMerge (FcCharSet
*a
, const FcCharSet
*b
)
459 FcCharSetIter ai
, bi
;
462 return FcCharSetCopy ((FcCharSet
*) b
);
463 } else if (a
->ref
== FC_REF_CONSTANT
) {
464 fcs
= FcCharSetCreate ();
470 FcCharSetIterStart (a
, &ai
);
471 FcCharSetIterStart (b
, &bi
);
472 while (ai
.leaf
|| bi
.leaf
)
474 if (ai
.ucs4
< bi
.ucs4
)
476 if (!FcCharSetAddLeaf (fcs
, ai
.ucs4
, ai
.leaf
))
479 FcCharSetIterNext (a
, &ai
);
481 else if (bi
.ucs4
< ai
.ucs4
)
483 if (!FcCharSetAddLeaf (fcs
, bi
.ucs4
, bi
.leaf
))
486 FcCharSetIterNext (b
, &bi
);
492 if (FcCharSetUnionLeaf (&leaf
, ai
.leaf
, bi
.leaf
))
494 if (!FcCharSetAddLeaf (fcs
, ai
.ucs4
, &leaf
))
498 FcCharSetIterNext (a
, &ai
);
499 FcCharSetIterNext (b
, &bi
);
504 FcCharSetDestroy (a
);
509 FcCharSetDestroy (fcs
);
512 FcCharSetDestroy (a
);
518 FcCharSetSubtractLeaf (FcCharLeaf
*result
,
519 const FcCharLeaf
*al
,
520 const FcCharLeaf
*bl
)
523 FcBool nonempty
= FcFalse
;
525 for (i
= 0; i
< 256/32; i
++)
526 if ((result
->map
[i
] = al
->map
[i
] & ~bl
->map
[i
]))
532 FcCharSetSubtract (const FcCharSet
*a
, const FcCharSet
*b
)
534 return FcCharSetOperate (a
, b
, FcCharSetSubtractLeaf
, FcTrue
, FcFalse
);
538 FcCharSetHasChar (const FcCharSet
*fcs
, FcChar32 ucs4
)
540 FcCharLeaf
*leaf
= FcCharSetFindLeaf (fcs
, ucs4
);
543 return (leaf
->map
[(ucs4
& 0xff) >> 5] & (1 << (ucs4
& 0x1f))) != 0;
547 FcCharSetPopCount (FcChar32 c1
)
549 #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
550 return __builtin_popcount (c1
);
553 FcChar32 c2
= (c1
>> 1) & 033333333333;
554 c2
= c1
- c2
- ((c2
>> 1) & 033333333333);
555 return (((c2
+ (c2
>> 3)) & 030707070707) % 077);
560 FcCharSetIntersectCount (const FcCharSet
*a
, const FcCharSet
*b
)
562 FcCharSetIter ai
, bi
;
565 FcCharSetIterStart (a
, &ai
);
566 FcCharSetIterStart (b
, &bi
);
567 while (ai
.leaf
&& bi
.leaf
)
569 if (ai
.ucs4
== bi
.ucs4
)
571 FcChar32
*am
= ai
.leaf
->map
;
572 FcChar32
*bm
= bi
.leaf
->map
;
575 count
+= FcCharSetPopCount (*am
++ & *bm
++);
576 FcCharSetIterNext (a
, &ai
);
578 else if (ai
.ucs4
< bi
.ucs4
)
581 FcCharSetIterSet (a
, &ai
);
583 if (bi
.ucs4
< ai
.ucs4
)
586 FcCharSetIterSet (b
, &bi
);
593 FcCharSetCount (const FcCharSet
*a
)
598 for (FcCharSetIterStart (a
, &ai
); ai
.leaf
; FcCharSetIterNext (a
, &ai
))
601 FcChar32
*am
= ai
.leaf
->map
;
604 count
+= FcCharSetPopCount (*am
++);
610 FcCharSetSubtractCount (const FcCharSet
*a
, const FcCharSet
*b
)
612 FcCharSetIter ai
, bi
;
615 FcCharSetIterStart (a
, &ai
);
616 FcCharSetIterStart (b
, &bi
);
619 if (ai
.ucs4
<= bi
.ucs4
)
621 FcChar32
*am
= ai
.leaf
->map
;
623 if (ai
.ucs4
== bi
.ucs4
)
625 FcChar32
*bm
= bi
.leaf
->map
;
627 count
+= FcCharSetPopCount (*am
++ & ~*bm
++);
632 count
+= FcCharSetPopCount (*am
++);
634 FcCharSetIterNext (a
, &ai
);
639 FcCharSetIterSet (b
, &bi
);
646 * return FcTrue iff a is a subset of b
649 FcCharSetIsSubset (const FcCharSet
*a
, const FcCharSet
*b
)
654 if (a
== b
) return FcTrue
;
657 while (ai
< a
->num
&& bi
< b
->num
)
659 an
= FcCharSetNumbers(a
)[ai
];
660 bn
= FcCharSetNumbers(b
)[bi
];
662 * Check matching pages
666 FcChar32
*am
= FcCharSetLeaf(a
, ai
)->map
;
667 FcChar32
*bm
= FcCharSetLeaf(b
, bi
)->map
;
673 * Does am have any bits not in bm?
683 * Does a have any pages not in b?
690 int high
= b
->num
- 1;
693 * Search for page 'an' in 'b'
697 int mid
= (low
+ high
) >> 1;
698 bn
= FcCharSetNumbers(b
)[mid
];
710 while (bi
< b
->num
&& FcCharSetNumbers(b
)[bi
] < an
)
715 * did we look at every page?
721 * These two functions efficiently walk the entire charmap for
722 * other software (like pango) that want their own copy
726 FcCharSetNextPage (const FcCharSet
*a
,
727 FcChar32 map
[FC_CHARSET_MAP_SIZE
],
734 FcCharSetIterSet (a
, &ai
);
736 return FC_CHARSET_DONE
;
739 * Save current information
742 memcpy (map
, ai
.leaf
->map
, sizeof (ai
.leaf
->map
));
746 FcCharSetIterNext (a
, &ai
);
753 FcCharSetFirstPage (const FcCharSet
*a
,
754 FcChar32 map
[FC_CHARSET_MAP_SIZE
],
758 return FcCharSetNextPage (a
, map
, next
);
762 * old coverage API, rather hard to use correctly
766 FcCharSetCoverage (const FcCharSet
*a
, FcChar32 page
, FcChar32
*result
)
771 FcCharSetIterSet (a
, &ai
);
774 memset (result
, '\0', 256 / 8);
779 memcpy (result
, ai
.leaf
->map
, sizeof (ai
.leaf
->map
));
780 FcCharSetIterNext (a
, &ai
);
787 * ASCII representation of charsets.
789 * Each leaf is represented as 9 32-bit values, the code of the first character followed
790 * by 8 32 bit values for the leaf itself. Each value is encoded as 5 ASCII characters,
791 * only 85 different values are used to avoid control characters as well as the other
792 * characters used to encode font names. 85**5 > 2^32 so things work out, but
793 * it's not exactly human readable output. As a special case, 0 is encoded as a space
796 static const unsigned char charToValue
[256] = {
797 /* "" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
798 /* "\b" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
799 /* "\020" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
800 /* "\030" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
801 /* " " */ 0xff, 0x00, 0xff, 0x01, 0x02, 0x03, 0x04, 0xff,
802 /* "(" */ 0x05, 0x06, 0x07, 0x08, 0xff, 0xff, 0x09, 0x0a,
803 /* "0" */ 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, 0x12,
804 /* "8" */ 0x13, 0x14, 0xff, 0x15, 0x16, 0xff, 0x17, 0x18,
805 /* "@" */ 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, 0x20,
806 /* "H" */ 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28,
807 /* "P" */ 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, 0x30,
808 /* "X" */ 0x31, 0x32, 0x33, 0x34, 0xff, 0x35, 0x36, 0xff,
809 /* "`" */ 0xff, 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d,
810 /* "h" */ 0x3e, 0x3f, 0x40, 0x41, 0x42, 0x43, 0x44, 0x45,
811 /* "p" */ 0x46, 0x47, 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d,
812 /* "x" */ 0x4e, 0x4f, 0x50, 0x51, 0x52, 0x53, 0x54, 0xff,
813 /* "\200" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
814 /* "\210" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
815 /* "\220" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
816 /* "\230" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
817 /* "\240" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
818 /* "\250" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
819 /* "\260" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
820 /* "\270" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
821 /* "\300" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
822 /* "\310" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
823 /* "\320" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
824 /* "\330" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
825 /* "\340" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
826 /* "\350" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
827 /* "\360" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
828 /* "\370" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
831 static const FcChar8 valueToChar
[0x55] = {
832 /* 0x00 */ '!', '#', '$', '%', '&', '(', ')', '*',
833 /* 0x08 */ '+', '.', '/', '0', '1', '2', '3', '4',
834 /* 0x10 */ '5', '6', '7', '8', '9', ';', '<', '>',
835 /* 0x18 */ '?', '@', 'A', 'B', 'C', 'D', 'E', 'F',
836 /* 0x20 */ 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N',
837 /* 0x28 */ 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V',
838 /* 0x30 */ 'W', 'X', 'Y', 'Z', '[', ']', '^', 'a',
839 /* 0x38 */ 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
840 /* 0x40 */ 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q',
841 /* 0x48 */ 'r', 's', 't', 'u', 'v', 'w', 'x', 'y',
842 /* 0x50 */ 'z', '{', '|', '}', '~',
846 FcCharSetParseValue (FcChar8
*string
, FcChar32
*value
)
860 for (i
= 0; i
< 5; i
++)
862 if (!(c
= (FcChar32
) (unsigned char) *string
++))
875 FcCharSetUnparseValue (FcStrBuf
*buf
, FcChar32 value
)
880 return FcStrBufChar (buf
, ' ');
885 FcChar8
*s
= string
+ 5;
887 for (i
= 0; i
< 5; i
++)
889 *--s
= valueToChar
[value
% 85];
892 for (i
= 0; i
< 5; i
++)
893 if (!FcStrBufChar (buf
, *s
++))
900 FcNameParseCharSet (FcChar8
*string
)
909 c
= FcCharSetCreate ();
914 string
= FcCharSetParseValue (string
, &ucs4
);
918 for (i
= 0; i
< 256/32; i
++)
920 string
= FcCharSetParseValue (string
, &temp
.map
[i
]);
927 leaf
= malloc (sizeof (FcCharLeaf
));
931 if (!FcCharSetInsertLeaf (c
, ucs4
, leaf
))
939 FcMemFree (FC_MEM_CHARSET
, c
->num
* sizeof (FcCharLeaf
*));
940 free (FcCharSetLeaves (c
));
944 FcMemFree (FC_MEM_CHARSET
, c
->num
* sizeof (FcChar16
));
945 free (FcCharSetNumbers (c
));
947 FcMemFree (FC_MEM_CHARSET
, sizeof (FcCharSet
));
954 FcNameUnparseCharSet (FcStrBuf
*buf
, const FcCharSet
*c
)
962 for (FcCharSetIterStart (c
, &ci
);
964 FcCharSetIterNext (c
, &ci
))
966 if (!FcCharSetUnparseValue (buf
, ci
.ucs4
))
968 for (i
= 0; i
< 256/32; i
++)
969 if (!FcCharSetUnparseValue (buf
, ci
.leaf
->map
[i
]))
976 FcCharSetIter ci
, checki
;
978 /* null terminate for parser */
979 FcStrBufChar (buf
, '\0');
980 /* step back over null for life after test */
982 check
= FcNameParseCharSet (buf
->buf
+ len
);
983 FcCharSetIterStart (c
, &ci
);
984 FcCharSetIterStart (check
, &checki
);
985 while (ci
.leaf
|| checki
.leaf
)
987 if (ci
.ucs4
< checki
.ucs4
)
989 printf ("Missing leaf node at 0x%x\n", ci
.ucs4
);
990 FcCharSetIterNext (c
, &ci
);
992 else if (checki
.ucs4
< ci
.ucs4
)
994 printf ("Extra leaf node at 0x%x\n", checki
.ucs4
);
995 FcCharSetIterNext (check
, &checki
);
1000 FcChar32
*cm
= ci
.leaf
->map
;
1001 FcChar32
*checkm
= checki
.leaf
->map
;
1003 for (i
= 0; i
< 256; i
+= 32)
1006 printf ("Mismatching sets at 0x%08x: 0x%08x != 0x%08x\n",
1007 ci
.ucs4
+ i
, *cm
, *checkm
);
1011 FcCharSetIterNext (c
, &ci
);
1012 FcCharSetIterNext (check
, &checki
);
1015 if ((missing
= FcCharSetSubtractCount (c
, check
)))
1016 printf ("%d missing in reparsed result\n", missing
);
1017 if ((missing
= FcCharSetSubtractCount (check
, c
)))
1018 printf ("%d extra in reparsed result\n", missing
);
1019 FcCharSetDestroy (check
);
1026 typedef struct _FcCharLeafEnt FcCharLeafEnt
;
1028 struct _FcCharLeafEnt
{
1029 FcCharLeafEnt
*next
;
1034 #define FC_CHAR_LEAF_BLOCK (4096 / sizeof (FcCharLeafEnt))
1035 #define FC_CHAR_LEAF_HASH_SIZE 257
1037 typedef struct _FcCharSetEnt FcCharSetEnt
;
1039 struct _FcCharSetEnt
{
1045 typedef struct _FcCharSetOrigEnt FcCharSetOrigEnt
;
1047 struct _FcCharSetOrigEnt
{
1048 FcCharSetOrigEnt
*next
;
1049 const FcCharSet
*orig
;
1050 const FcCharSet
*frozen
;
1053 #define FC_CHAR_SET_HASH_SIZE 67
1055 struct _FcCharSetFreezer
{
1056 FcCharLeafEnt
*leaf_hash_table
[FC_CHAR_LEAF_HASH_SIZE
];
1057 FcCharLeafEnt
**leaf_blocks
;
1058 int leaf_block_count
;
1059 FcCharSetEnt
*set_hash_table
[FC_CHAR_SET_HASH_SIZE
];
1060 FcCharSetOrigEnt
*orig_hash_table
[FC_CHAR_SET_HASH_SIZE
];
1061 FcCharLeafEnt
*current_block
;
1065 int leaves_allocated
;
1066 int charsets_allocated
;
1069 static FcCharLeafEnt
*
1070 FcCharLeafEntCreate (FcCharSetFreezer
*freezer
)
1072 if (!freezer
->leaf_remain
)
1074 FcCharLeafEnt
**newBlocks
;
1076 freezer
->leaf_block_count
++;
1077 newBlocks
= realloc (freezer
->leaf_blocks
, freezer
->leaf_block_count
* sizeof (FcCharLeafEnt
*));
1080 freezer
->leaf_blocks
= newBlocks
;
1081 freezer
->current_block
= freezer
->leaf_blocks
[freezer
->leaf_block_count
-1] = malloc (FC_CHAR_LEAF_BLOCK
* sizeof (FcCharLeafEnt
));
1082 if (!freezer
->current_block
)
1084 FcMemAlloc (FC_MEM_CHARLEAF
, FC_CHAR_LEAF_BLOCK
* sizeof (FcCharLeafEnt
));
1085 freezer
->leaf_remain
= FC_CHAR_LEAF_BLOCK
;
1087 freezer
->leaf_remain
--;
1088 freezer
->leaves_allocated
++;
1089 return freezer
->current_block
++;
1093 FcCharLeafHash (FcCharLeaf
*leaf
)
1098 for (i
= 0; i
< 256/32; i
++)
1099 hash
= ((hash
<< 1) | (hash
>> 31)) ^ leaf
->map
[i
];
1104 FcCharSetFreezeLeaf (FcCharSetFreezer
*freezer
, FcCharLeaf
*leaf
)
1106 FcChar32 hash
= FcCharLeafHash (leaf
);
1107 FcCharLeafEnt
**bucket
= &freezer
->leaf_hash_table
[hash
% FC_CHAR_LEAF_HASH_SIZE
];
1110 for (ent
= *bucket
; ent
; ent
= ent
->next
)
1112 if (ent
->hash
== hash
&& !memcmp (&ent
->leaf
, leaf
, sizeof (FcCharLeaf
)))
1116 ent
= FcCharLeafEntCreate(freezer
);
1121 ent
->next
= *bucket
;
1127 FcCharSetHash (FcCharSet
*fcs
)
1132 /* hash in leaves */
1133 for (i
= 0; i
< fcs
->num
; i
++)
1134 hash
= ((hash
<< 1) | (hash
>> 31)) ^ FcCharLeafHash (FcCharSetLeaf(fcs
,i
));
1135 /* hash in numbers */
1136 for (i
= 0; i
< fcs
->num
; i
++)
1137 hash
= ((hash
<< 1) | (hash
>> 31)) ^ *FcCharSetNumbers(fcs
);
1142 FcCharSetFreezeOrig (FcCharSetFreezer
*freezer
, const FcCharSet
*orig
, const FcCharSet
*frozen
)
1144 FcCharSetOrigEnt
**bucket
= &freezer
->orig_hash_table
[((uintptr_t) orig
) & FC_CHAR_SET_HASH_SIZE
];
1145 FcCharSetOrigEnt
*ent
;
1147 ent
= malloc (sizeof (FcCharSetOrigEnt
));
1151 ent
->frozen
= frozen
;
1152 ent
->next
= *bucket
;
1158 FcCharSetFreezeBase (FcCharSetFreezer
*freezer
, FcCharSet
*fcs
, const FcCharSet
*orig
)
1160 FcChar32 hash
= FcCharSetHash (fcs
);
1161 FcCharSetEnt
**bucket
= &freezer
->set_hash_table
[hash
% FC_CHAR_SET_HASH_SIZE
];
1166 for (ent
= *bucket
; ent
; ent
= ent
->next
)
1168 if (ent
->hash
== hash
&&
1169 ent
->set
.num
== fcs
->num
&&
1170 !memcmp (FcCharSetNumbers(&ent
->set
),
1171 FcCharSetNumbers(fcs
),
1172 fcs
->num
* sizeof (FcChar16
)))
1177 for (i
= 0; i
< fcs
->num
; i
++)
1178 if (FcCharSetLeaf(&ent
->set
, i
) != FcCharSetLeaf(fcs
, i
))
1185 size
= (sizeof (FcCharSetEnt
) +
1186 fcs
->num
* sizeof (FcCharLeaf
*) +
1187 fcs
->num
* sizeof (FcChar16
));
1188 ent
= malloc (size
);
1191 FcMemAlloc (FC_MEM_CHARSET
, size
);
1193 freezer
->charsets_allocated
++;
1195 ent
->set
.ref
= FC_REF_CONSTANT
;
1196 ent
->set
.num
= fcs
->num
;
1199 intptr_t *ent_leaves
;
1201 ent
->set
.leaves_offset
= sizeof (ent
->set
);
1202 ent
->set
.numbers_offset
= (ent
->set
.leaves_offset
+
1203 fcs
->num
* sizeof (intptr_t));
1205 ent_leaves
= FcCharSetLeaves (&ent
->set
);
1206 for (i
= 0; i
< fcs
->num
; i
++)
1207 ent_leaves
[i
] = FcPtrToOffset (ent_leaves
,
1208 FcCharSetLeaf (fcs
, i
));
1209 memcpy (FcCharSetNumbers (&ent
->set
),
1210 FcCharSetNumbers (fcs
),
1211 fcs
->num
* sizeof (FcChar16
));
1215 ent
->set
.leaves_offset
= 0;
1216 ent
->set
.numbers_offset
= 0;
1220 ent
->next
= *bucket
;
1226 static const FcCharSet
*
1227 FcCharSetFindFrozen (FcCharSetFreezer
*freezer
, const FcCharSet
*orig
)
1229 FcCharSetOrigEnt
**bucket
= &freezer
->orig_hash_table
[((uintptr_t) orig
) & FC_CHAR_SET_HASH_SIZE
];
1230 FcCharSetOrigEnt
*ent
;
1232 for (ent
= *bucket
; ent
; ent
= ent
->next
)
1233 if (ent
->orig
== orig
)
1239 FcCharSetFreeze (FcCharSetFreezer
*freezer
, const FcCharSet
*fcs
)
1242 const FcCharSet
*n
= 0;
1246 b
= FcCharSetCreate ();
1249 for (i
= 0; i
< fcs
->num
; i
++)
1251 l
= FcCharSetFreezeLeaf (freezer
, FcCharSetLeaf(fcs
, i
));
1254 if (!FcCharSetInsertLeaf (b
, FcCharSetNumbers(fcs
)[i
] << 8, l
))
1257 n
= FcCharSetFreezeBase (freezer
, b
, fcs
);
1258 if (!FcCharSetFreezeOrig (freezer
, fcs
, n
))
1263 freezer
->charsets_seen
++;
1264 freezer
->leaves_seen
+= fcs
->num
;
1268 FcMemFree (FC_MEM_CHARSET
, b
->num
* sizeof (FcCharLeaf
*));
1269 free (FcCharSetLeaves (b
));
1273 FcMemFree (FC_MEM_CHARSET
, b
->num
* sizeof (FcChar16
));
1274 free (FcCharSetNumbers (b
));
1276 FcMemFree (FC_MEM_CHARSET
, sizeof (FcCharSet
));
1283 FcCharSetFreezerCreate (void)
1285 FcCharSetFreezer
*freezer
;
1287 freezer
= calloc (1, sizeof (FcCharSetFreezer
));
1292 FcCharSetFreezerDestroy (FcCharSetFreezer
*freezer
)
1296 if (FcDebug() & FC_DBG_CACHE
)
1298 printf ("\ncharsets %d -> %d leaves %d -> %d\n",
1299 freezer
->charsets_seen
, freezer
->charsets_allocated
,
1300 freezer
->leaves_seen
, freezer
->leaves_allocated
);
1302 for (i
= 0; i
< FC_CHAR_SET_HASH_SIZE
; i
++)
1304 FcCharSetEnt
*ent
, *next
;
1305 for (ent
= freezer
->set_hash_table
[i
]; ent
; ent
= next
)
1308 FcMemFree (FC_MEM_CHARSET
, (sizeof (FcCharSetEnt
) +
1309 ent
->set
.num
* sizeof (FcCharLeaf
*) +
1310 ent
->set
.num
* sizeof (FcChar16
)));
1315 for (i
= 0; i
< FC_CHAR_SET_HASH_SIZE
; i
++)
1317 FcCharSetOrigEnt
*ent
, *next
;
1318 for (ent
= freezer
->orig_hash_table
[i
]; ent
; ent
= next
)
1325 for (i
= 0; i
< freezer
->leaf_block_count
; i
++)
1327 free (freezer
->leaf_blocks
[i
]);
1328 FcMemFree (FC_MEM_CHARLEAF
, FC_CHAR_LEAF_BLOCK
* sizeof (FcCharLeafEnt
));
1331 free (freezer
->leaf_blocks
);
1336 FcCharSetSerializeAlloc (FcSerialize
*serialize
, const FcCharSet
*cs
)
1342 if (cs
->ref
!= FC_REF_CONSTANT
)
1344 if (!serialize
->cs_freezer
)
1346 serialize
->cs_freezer
= FcCharSetFreezerCreate ();
1347 if (!serialize
->cs_freezer
)
1350 if (FcCharSetFindFrozen (serialize
->cs_freezer
, cs
))
1353 cs
= FcCharSetFreeze (serialize
->cs_freezer
, cs
);
1356 leaves
= FcCharSetLeaves (cs
);
1357 numbers
= FcCharSetNumbers (cs
);
1359 if (!FcSerializeAlloc (serialize
, cs
, sizeof (FcCharSet
)))
1361 if (!FcSerializeAlloc (serialize
, leaves
, cs
->num
* sizeof (intptr_t)))
1363 if (!FcSerializeAlloc (serialize
, numbers
, cs
->num
* sizeof (FcChar16
)))
1365 for (i
= 0; i
< cs
->num
; i
++)
1366 if (!FcSerializeAlloc (serialize
, FcCharSetLeaf(cs
, i
),
1367 sizeof (FcCharLeaf
)))
1373 FcCharSetSerialize(FcSerialize
*serialize
, const FcCharSet
*cs
)
1375 FcCharSet
*cs_serialized
;
1376 intptr_t *leaves
, *leaves_serialized
;
1377 FcChar16
*numbers
, *numbers_serialized
;
1378 FcCharLeaf
*leaf
, *leaf_serialized
;
1381 if (cs
->ref
!= FC_REF_CONSTANT
&& serialize
->cs_freezer
)
1383 cs
= FcCharSetFindFrozen (serialize
->cs_freezer
, cs
);
1388 cs_serialized
= FcSerializePtr (serialize
, cs
);
1392 cs_serialized
->ref
= FC_REF_CONSTANT
;
1393 cs_serialized
->num
= cs
->num
;
1397 leaves
= FcCharSetLeaves (cs
);
1398 leaves_serialized
= FcSerializePtr (serialize
, leaves
);
1399 if (!leaves_serialized
)
1402 cs_serialized
->leaves_offset
= FcPtrToOffset (cs_serialized
,
1405 numbers
= FcCharSetNumbers (cs
);
1406 numbers_serialized
= FcSerializePtr (serialize
, numbers
);
1410 cs_serialized
->numbers_offset
= FcPtrToOffset (cs_serialized
,
1411 numbers_serialized
);
1413 for (i
= 0; i
< cs
->num
; i
++)
1415 leaf
= FcCharSetLeaf (cs
, i
);
1416 leaf_serialized
= FcSerializePtr (serialize
, leaf
);
1417 if (!leaf_serialized
)
1419 *leaf_serialized
= *leaf
;
1420 leaves_serialized
[i
] = FcPtrToOffset (leaves_serialized
,
1422 numbers_serialized
[i
] = numbers
[i
];
1427 cs_serialized
->leaves_offset
= 0;
1428 cs_serialized
->numbers_offset
= 0;
1431 return cs_serialized
;
1433 #define __fccharset__
1434 #include "fcaliastail.h"
1435 #undef __fccharset__