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 * Search for the leaf containing with the specified num.
85 * Return its index if it exists, otherwise return negative of
86 * the (position + 1) where it should be inserted
91 FcCharSetFindLeafForward (const FcCharSet
*fcs
, int start
, FcChar16 num
)
93 FcChar16
*numbers
= FcCharSetNumbers(fcs
);
96 int high
= fcs
->num
- 1;
102 int mid
= (low
+ high
) >> 1;
111 if (high
< 0 || (high
< fcs
->num
&& numbers
[high
] < num
))
117 * Locate the leaf containing the specified char, return
118 * its index if it exists, otherwise return negative of
119 * the (position + 1) where it should be inserted
123 FcCharSetFindLeafPos (const FcCharSet
*fcs
, FcChar32 ucs4
)
125 return FcCharSetFindLeafForward (fcs
, 0, ucs4
>> 8);
129 FcCharSetFindLeaf (const FcCharSet
*fcs
, FcChar32 ucs4
)
131 int pos
= FcCharSetFindLeafPos (fcs
, ucs4
);
133 return FcCharSetLeaf(fcs
, pos
);
138 FcCharSetPutLeaf (FcCharSet
*fcs
,
143 intptr_t *leaves
= FcCharSetLeaves (fcs
);
144 FcChar16
*numbers
= FcCharSetNumbers (fcs
);
150 leaves
= malloc (sizeof (*leaves
));
153 intptr_t *new_leaves
= realloc (leaves
, (fcs
->num
+ 1) *
155 intptr_t distance
= (intptr_t) new_leaves
- (intptr_t) leaves
;
157 if (new_leaves
&& distance
)
161 for (i
= 0; i
< fcs
->num
; i
++)
162 new_leaves
[i
] -= distance
;
170 FcMemFree (FC_MEM_CHARSET
, fcs
->num
* sizeof (intptr_t));
171 FcMemAlloc (FC_MEM_CHARSET
, (fcs
->num
+ 1) * sizeof (intptr_t));
172 fcs
->leaves_offset
= FcPtrToOffset (fcs
, leaves
);
175 numbers
= malloc (sizeof (FcChar16
));
177 numbers
= realloc (numbers
, (fcs
->num
+ 1) * sizeof (FcChar16
));
182 FcMemFree (FC_MEM_CHARSET
, fcs
->num
* sizeof (FcChar16
));
183 FcMemAlloc (FC_MEM_CHARSET
, (fcs
->num
+ 1) * sizeof (FcChar16
));
184 fcs
->numbers_offset
= FcPtrToOffset (fcs
, numbers
);
186 memmove (leaves
+ pos
+ 1, leaves
+ pos
,
187 (fcs
->num
- pos
) * sizeof (*leaves
));
188 memmove (numbers
+ pos
+ 1, numbers
+ pos
,
189 (fcs
->num
- pos
) * sizeof (*numbers
));
190 numbers
[pos
] = (FcChar16
) ucs4
;
191 leaves
[pos
] = FcPtrToOffset (leaves
, leaf
);
197 * Locate the leaf containing the specified char, creating it
202 FcCharSetFindLeafCreate (FcCharSet
*fcs
, FcChar32 ucs4
)
207 pos
= FcCharSetFindLeafPos (fcs
, ucs4
);
209 return FcCharSetLeaf(fcs
, pos
);
211 leaf
= calloc (1, sizeof (FcCharLeaf
));
216 if (!FcCharSetPutLeaf (fcs
, ucs4
, leaf
, pos
))
221 FcMemAlloc (FC_MEM_CHARLEAF
, sizeof (FcCharLeaf
));
226 FcCharSetInsertLeaf (FcCharSet
*fcs
, FcChar32 ucs4
, FcCharLeaf
*leaf
)
230 pos
= FcCharSetFindLeafPos (fcs
, ucs4
);
233 FcMemFree (FC_MEM_CHARLEAF
, sizeof (FcCharLeaf
));
234 free (FcCharSetLeaf (fcs
, pos
));
235 FcCharSetLeaves(fcs
)[pos
] = FcPtrToOffset (FcCharSetLeaves(fcs
),
240 return FcCharSetPutLeaf (fcs
, ucs4
, leaf
, pos
);
244 FcCharSetAddChar (FcCharSet
*fcs
, FcChar32 ucs4
)
249 if (fcs
->ref
== FC_REF_CONSTANT
)
251 leaf
= FcCharSetFindLeafCreate (fcs
, ucs4
);
254 b
= &leaf
->map
[(ucs4
& 0xff) >> 5];
255 *b
|= (1 << (ucs4
& 0x1f));
260 * An iterator for the leaves of a charset
263 typedef struct _fcCharSetIter
{
270 * Set iter->leaf to the leaf containing iter->ucs4 or higher
274 FcCharSetIterSet (const FcCharSet
*fcs
, FcCharSetIter
*iter
)
276 int pos
= FcCharSetFindLeafPos (fcs
, iter
->ucs4
);
287 iter
->ucs4
= (FcChar32
) FcCharSetNumbers(fcs
)[pos
] << 8;
289 iter
->leaf
= FcCharSetLeaf(fcs
, pos
);
294 FcCharSetIterNext (const FcCharSet
*fcs
, FcCharSetIter
*iter
)
296 int pos
= iter
->pos
+ 1;
304 iter
->ucs4
= (FcChar32
) FcCharSetNumbers(fcs
)[pos
] << 8;
305 iter
->leaf
= FcCharSetLeaf(fcs
, pos
);
312 FcCharSetIterStart (const FcCharSet
*fcs
, FcCharSetIter
*iter
)
316 FcCharSetIterSet (fcs
, iter
);
320 FcCharSetCopy (FcCharSet
*src
)
322 if (src
->ref
!= FC_REF_CONSTANT
)
325 FcCacheObjectReference (src
);
330 FcCharSetEqual (const FcCharSet
*a
, const FcCharSet
*b
)
332 FcCharSetIter ai
, bi
;
337 for (FcCharSetIterStart (a
, &ai
), FcCharSetIterStart (b
, &bi
);
339 FcCharSetIterNext (a
, &ai
), FcCharSetIterNext (b
, &bi
))
341 if (ai
.ucs4
!= bi
.ucs4
)
343 for (i
= 0; i
< 256/32; i
++)
344 if (ai
.leaf
->map
[i
] != bi
.leaf
->map
[i
])
347 return ai
.leaf
== bi
.leaf
;
351 FcCharSetAddLeaf (FcCharSet
*fcs
,
355 FcCharLeaf
*new = FcCharSetFindLeafCreate (fcs
, ucs4
);
363 FcCharSetOperate (const FcCharSet
*a
,
365 FcBool (*overlap
) (FcCharLeaf
*result
,
366 const FcCharLeaf
*al
,
367 const FcCharLeaf
*bl
),
372 FcCharSetIter ai
, bi
;
374 fcs
= FcCharSetCreate ();
377 FcCharSetIterStart (a
, &ai
);
378 FcCharSetIterStart (b
, &bi
);
379 while ((ai
.leaf
|| (bonly
&& bi
.leaf
)) && (bi
.leaf
|| (aonly
&& ai
.leaf
)))
381 if (ai
.ucs4
< bi
.ucs4
)
385 if (!FcCharSetAddLeaf (fcs
, ai
.ucs4
, ai
.leaf
))
387 FcCharSetIterNext (a
, &ai
);
392 FcCharSetIterSet (a
, &ai
);
395 else if (bi
.ucs4
< ai
.ucs4
)
399 if (!FcCharSetAddLeaf (fcs
, bi
.ucs4
, bi
.leaf
))
401 FcCharSetIterNext (b
, &bi
);
406 FcCharSetIterSet (b
, &bi
);
413 if ((*overlap
) (&leaf
, ai
.leaf
, bi
.leaf
))
415 if (!FcCharSetAddLeaf (fcs
, ai
.ucs4
, &leaf
))
418 FcCharSetIterNext (a
, &ai
);
419 FcCharSetIterNext (b
, &bi
);
424 FcCharSetDestroy (fcs
);
430 FcCharSetIntersectLeaf (FcCharLeaf
*result
,
431 const FcCharLeaf
*al
,
432 const FcCharLeaf
*bl
)
435 FcBool nonempty
= FcFalse
;
437 for (i
= 0; i
< 256/32; i
++)
438 if ((result
->map
[i
] = al
->map
[i
] & bl
->map
[i
]))
444 FcCharSetIntersect (const FcCharSet
*a
, const FcCharSet
*b
)
446 return FcCharSetOperate (a
, b
, FcCharSetIntersectLeaf
, FcFalse
, FcFalse
);
450 FcCharSetUnionLeaf (FcCharLeaf
*result
,
451 const FcCharLeaf
*al
,
452 const FcCharLeaf
*bl
)
456 for (i
= 0; i
< 256/32; i
++)
457 result
->map
[i
] = al
->map
[i
] | bl
->map
[i
];
462 FcCharSetUnion (const FcCharSet
*a
, const FcCharSet
*b
)
464 return FcCharSetOperate (a
, b
, FcCharSetUnionLeaf
, FcTrue
, FcTrue
);
468 FcCharSetMerge (FcCharSet
*a
, const FcCharSet
*b
, FcBool
*changed
)
473 if (a
->ref
== FC_REF_CONSTANT
)
477 *changed
= !FcCharSetIsSubset(b
, a
);
484 an
= ai
< a
->num
? FcCharSetNumbers(a
)[ai
] : ~0;
485 bn
= FcCharSetNumbers(b
)[bi
];
489 ai
= FcCharSetFindLeafForward (a
, ai
+ 1, bn
);
495 FcCharLeaf
*bl
= FcCharSetLeaf(b
, bi
);
498 if (!FcCharSetAddLeaf (a
, bn
<< 8, bl
))
503 FcCharLeaf
*al
= FcCharSetLeaf(a
, ai
);
504 FcCharSetUnionLeaf (al
, al
, bl
);
516 FcCharSetSubtractLeaf (FcCharLeaf
*result
,
517 const FcCharLeaf
*al
,
518 const FcCharLeaf
*bl
)
521 FcBool nonempty
= FcFalse
;
523 for (i
= 0; i
< 256/32; i
++)
524 if ((result
->map
[i
] = al
->map
[i
] & ~bl
->map
[i
]))
530 FcCharSetSubtract (const FcCharSet
*a
, const FcCharSet
*b
)
532 return FcCharSetOperate (a
, b
, FcCharSetSubtractLeaf
, FcTrue
, FcFalse
);
536 FcCharSetHasChar (const FcCharSet
*fcs
, FcChar32 ucs4
)
538 FcCharLeaf
*leaf
= FcCharSetFindLeaf (fcs
, ucs4
);
541 return (leaf
->map
[(ucs4
& 0xff) >> 5] & (1 << (ucs4
& 0x1f))) != 0;
545 FcCharSetPopCount (FcChar32 c1
)
547 #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
548 return __builtin_popcount (c1
);
551 FcChar32 c2
= (c1
>> 1) & 033333333333;
552 c2
= c1
- c2
- ((c2
>> 1) & 033333333333);
553 return (((c2
+ (c2
>> 3)) & 030707070707) % 077);
558 FcCharSetIntersectCount (const FcCharSet
*a
, const FcCharSet
*b
)
560 FcCharSetIter ai
, bi
;
563 FcCharSetIterStart (a
, &ai
);
564 FcCharSetIterStart (b
, &bi
);
565 while (ai
.leaf
&& bi
.leaf
)
567 if (ai
.ucs4
== bi
.ucs4
)
569 FcChar32
*am
= ai
.leaf
->map
;
570 FcChar32
*bm
= bi
.leaf
->map
;
573 count
+= FcCharSetPopCount (*am
++ & *bm
++);
574 FcCharSetIterNext (a
, &ai
);
576 else if (ai
.ucs4
< bi
.ucs4
)
579 FcCharSetIterSet (a
, &ai
);
581 if (bi
.ucs4
< ai
.ucs4
)
584 FcCharSetIterSet (b
, &bi
);
591 FcCharSetCount (const FcCharSet
*a
)
596 for (FcCharSetIterStart (a
, &ai
); ai
.leaf
; FcCharSetIterNext (a
, &ai
))
599 FcChar32
*am
= ai
.leaf
->map
;
602 count
+= FcCharSetPopCount (*am
++);
608 FcCharSetSubtractCount (const FcCharSet
*a
, const FcCharSet
*b
)
610 FcCharSetIter ai
, bi
;
613 FcCharSetIterStart (a
, &ai
);
614 FcCharSetIterStart (b
, &bi
);
617 if (ai
.ucs4
<= bi
.ucs4
)
619 FcChar32
*am
= ai
.leaf
->map
;
621 if (ai
.ucs4
== bi
.ucs4
)
623 FcChar32
*bm
= bi
.leaf
->map
;
625 count
+= FcCharSetPopCount (*am
++ & ~*bm
++);
630 count
+= FcCharSetPopCount (*am
++);
632 FcCharSetIterNext (a
, &ai
);
637 FcCharSetIterSet (b
, &bi
);
644 * return FcTrue iff a is a subset of b
647 FcCharSetIsSubset (const FcCharSet
*a
, const FcCharSet
*b
)
652 if (a
== b
) return FcTrue
;
655 while (ai
< a
->num
&& bi
< b
->num
)
657 an
= FcCharSetNumbers(a
)[ai
];
658 bn
= FcCharSetNumbers(b
)[bi
];
660 * Check matching pages
664 FcChar32
*am
= FcCharSetLeaf(a
, ai
)->map
;
665 FcChar32
*bm
= FcCharSetLeaf(b
, bi
)->map
;
671 * Does am have any bits not in bm?
681 * Does a have any pages not in b?
687 bi
= FcCharSetFindLeafForward (b
, bi
+ 1, an
);
693 * did we look at every page?
699 * These two functions efficiently walk the entire charmap for
700 * other software (like pango) that want their own copy
704 FcCharSetNextPage (const FcCharSet
*a
,
705 FcChar32 map
[FC_CHARSET_MAP_SIZE
],
712 FcCharSetIterSet (a
, &ai
);
714 return FC_CHARSET_DONE
;
717 * Save current information
720 memcpy (map
, ai
.leaf
->map
, sizeof (ai
.leaf
->map
));
724 FcCharSetIterNext (a
, &ai
);
731 FcCharSetFirstPage (const FcCharSet
*a
,
732 FcChar32 map
[FC_CHARSET_MAP_SIZE
],
736 return FcCharSetNextPage (a
, map
, next
);
740 * old coverage API, rather hard to use correctly
744 FcCharSetCoverage (const FcCharSet
*a
, FcChar32 page
, FcChar32
*result
)
749 FcCharSetIterSet (a
, &ai
);
752 memset (result
, '\0', 256 / 8);
757 memcpy (result
, ai
.leaf
->map
, sizeof (ai
.leaf
->map
));
758 FcCharSetIterNext (a
, &ai
);
765 * ASCII representation of charsets.
767 * Each leaf is represented as 9 32-bit values, the code of the first character followed
768 * by 8 32 bit values for the leaf itself. Each value is encoded as 5 ASCII characters,
769 * only 85 different values are used to avoid control characters as well as the other
770 * characters used to encode font names. 85**5 > 2^32 so things work out, but
771 * it's not exactly human readable output. As a special case, 0 is encoded as a space
774 static const unsigned char charToValue
[256] = {
775 /* "" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
776 /* "\b" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
777 /* "\020" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
778 /* "\030" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
779 /* " " */ 0xff, 0x00, 0xff, 0x01, 0x02, 0x03, 0x04, 0xff,
780 /* "(" */ 0x05, 0x06, 0x07, 0x08, 0xff, 0xff, 0x09, 0x0a,
781 /* "0" */ 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, 0x12,
782 /* "8" */ 0x13, 0x14, 0xff, 0x15, 0x16, 0xff, 0x17, 0x18,
783 /* "@" */ 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, 0x20,
784 /* "H" */ 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28,
785 /* "P" */ 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, 0x30,
786 /* "X" */ 0x31, 0x32, 0x33, 0x34, 0xff, 0x35, 0x36, 0xff,
787 /* "`" */ 0xff, 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d,
788 /* "h" */ 0x3e, 0x3f, 0x40, 0x41, 0x42, 0x43, 0x44, 0x45,
789 /* "p" */ 0x46, 0x47, 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d,
790 /* "x" */ 0x4e, 0x4f, 0x50, 0x51, 0x52, 0x53, 0x54, 0xff,
791 /* "\200" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
792 /* "\210" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
793 /* "\220" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
794 /* "\230" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
795 /* "\240" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
796 /* "\250" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
797 /* "\260" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
798 /* "\270" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
799 /* "\300" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
800 /* "\310" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
801 /* "\320" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
802 /* "\330" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
803 /* "\340" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
804 /* "\350" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
805 /* "\360" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
806 /* "\370" */ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
809 static const FcChar8 valueToChar
[0x55] = {
810 /* 0x00 */ '!', '#', '$', '%', '&', '(', ')', '*',
811 /* 0x08 */ '+', '.', '/', '0', '1', '2', '3', '4',
812 /* 0x10 */ '5', '6', '7', '8', '9', ';', '<', '>',
813 /* 0x18 */ '?', '@', 'A', 'B', 'C', 'D', 'E', 'F',
814 /* 0x20 */ 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N',
815 /* 0x28 */ 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V',
816 /* 0x30 */ 'W', 'X', 'Y', 'Z', '[', ']', '^', 'a',
817 /* 0x38 */ 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
818 /* 0x40 */ 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q',
819 /* 0x48 */ 'r', 's', 't', 'u', 'v', 'w', 'x', 'y',
820 /* 0x50 */ 'z', '{', '|', '}', '~',
824 FcCharSetParseValue (FcChar8
*string
, FcChar32
*value
)
838 for (i
= 0; i
< 5; i
++)
840 if (!(c
= (FcChar32
) (unsigned char) *string
++))
853 FcCharSetUnparseValue (FcStrBuf
*buf
, FcChar32 value
)
858 return FcStrBufChar (buf
, ' ');
863 FcChar8
*s
= string
+ 5;
865 for (i
= 0; i
< 5; i
++)
867 *--s
= valueToChar
[value
% 85];
870 for (i
= 0; i
< 5; i
++)
871 if (!FcStrBufChar (buf
, *s
++))
878 FcNameParseCharSet (FcChar8
*string
)
887 c
= FcCharSetCreate ();
892 string
= FcCharSetParseValue (string
, &ucs4
);
896 for (i
= 0; i
< 256/32; i
++)
898 string
= FcCharSetParseValue (string
, &temp
.map
[i
]);
905 leaf
= malloc (sizeof (FcCharLeaf
));
909 if (!FcCharSetInsertLeaf (c
, ucs4
, leaf
))
917 FcMemFree (FC_MEM_CHARSET
, c
->num
* sizeof (FcCharLeaf
*));
918 free (FcCharSetLeaves (c
));
922 FcMemFree (FC_MEM_CHARSET
, c
->num
* sizeof (FcChar16
));
923 free (FcCharSetNumbers (c
));
925 FcMemFree (FC_MEM_CHARSET
, sizeof (FcCharSet
));
932 FcNameUnparseCharSet (FcStrBuf
*buf
, const FcCharSet
*c
)
940 for (FcCharSetIterStart (c
, &ci
);
942 FcCharSetIterNext (c
, &ci
))
944 if (!FcCharSetUnparseValue (buf
, ci
.ucs4
))
946 for (i
= 0; i
< 256/32; i
++)
947 if (!FcCharSetUnparseValue (buf
, ci
.leaf
->map
[i
]))
954 FcCharSetIter ci
, checki
;
956 /* null terminate for parser */
957 FcStrBufChar (buf
, '\0');
958 /* step back over null for life after test */
960 check
= FcNameParseCharSet (buf
->buf
+ len
);
961 FcCharSetIterStart (c
, &ci
);
962 FcCharSetIterStart (check
, &checki
);
963 while (ci
.leaf
|| checki
.leaf
)
965 if (ci
.ucs4
< checki
.ucs4
)
967 printf ("Missing leaf node at 0x%x\n", ci
.ucs4
);
968 FcCharSetIterNext (c
, &ci
);
970 else if (checki
.ucs4
< ci
.ucs4
)
972 printf ("Extra leaf node at 0x%x\n", checki
.ucs4
);
973 FcCharSetIterNext (check
, &checki
);
978 FcChar32
*cm
= ci
.leaf
->map
;
979 FcChar32
*checkm
= checki
.leaf
->map
;
981 for (i
= 0; i
< 256; i
+= 32)
984 printf ("Mismatching sets at 0x%08x: 0x%08x != 0x%08x\n",
985 ci
.ucs4
+ i
, *cm
, *checkm
);
989 FcCharSetIterNext (c
, &ci
);
990 FcCharSetIterNext (check
, &checki
);
993 if ((missing
= FcCharSetSubtractCount (c
, check
)))
994 printf ("%d missing in reparsed result\n", missing
);
995 if ((missing
= FcCharSetSubtractCount (check
, c
)))
996 printf ("%d extra in reparsed result\n", missing
);
997 FcCharSetDestroy (check
);
1004 typedef struct _FcCharLeafEnt FcCharLeafEnt
;
1006 struct _FcCharLeafEnt
{
1007 FcCharLeafEnt
*next
;
1012 #define FC_CHAR_LEAF_BLOCK (4096 / sizeof (FcCharLeafEnt))
1013 #define FC_CHAR_LEAF_HASH_SIZE 257
1015 typedef struct _FcCharSetEnt FcCharSetEnt
;
1017 struct _FcCharSetEnt
{
1023 typedef struct _FcCharSetOrigEnt FcCharSetOrigEnt
;
1025 struct _FcCharSetOrigEnt
{
1026 FcCharSetOrigEnt
*next
;
1027 const FcCharSet
*orig
;
1028 const FcCharSet
*frozen
;
1031 #define FC_CHAR_SET_HASH_SIZE 67
1033 struct _FcCharSetFreezer
{
1034 FcCharLeafEnt
*leaf_hash_table
[FC_CHAR_LEAF_HASH_SIZE
];
1035 FcCharLeafEnt
**leaf_blocks
;
1036 int leaf_block_count
;
1037 FcCharSetEnt
*set_hash_table
[FC_CHAR_SET_HASH_SIZE
];
1038 FcCharSetOrigEnt
*orig_hash_table
[FC_CHAR_SET_HASH_SIZE
];
1039 FcCharLeafEnt
*current_block
;
1043 int leaves_allocated
;
1044 int charsets_allocated
;
1047 static FcCharLeafEnt
*
1048 FcCharLeafEntCreate (FcCharSetFreezer
*freezer
)
1050 if (!freezer
->leaf_remain
)
1052 FcCharLeafEnt
**newBlocks
;
1054 freezer
->leaf_block_count
++;
1055 newBlocks
= realloc (freezer
->leaf_blocks
, freezer
->leaf_block_count
* sizeof (FcCharLeafEnt
*));
1058 freezer
->leaf_blocks
= newBlocks
;
1059 freezer
->current_block
= freezer
->leaf_blocks
[freezer
->leaf_block_count
-1] = malloc (FC_CHAR_LEAF_BLOCK
* sizeof (FcCharLeafEnt
));
1060 if (!freezer
->current_block
)
1062 FcMemAlloc (FC_MEM_CHARLEAF
, FC_CHAR_LEAF_BLOCK
* sizeof (FcCharLeafEnt
));
1063 freezer
->leaf_remain
= FC_CHAR_LEAF_BLOCK
;
1065 freezer
->leaf_remain
--;
1066 freezer
->leaves_allocated
++;
1067 return freezer
->current_block
++;
1071 FcCharLeafHash (FcCharLeaf
*leaf
)
1076 for (i
= 0; i
< 256/32; i
++)
1077 hash
= ((hash
<< 1) | (hash
>> 31)) ^ leaf
->map
[i
];
1082 FcCharSetFreezeLeaf (FcCharSetFreezer
*freezer
, FcCharLeaf
*leaf
)
1084 FcChar32 hash
= FcCharLeafHash (leaf
);
1085 FcCharLeafEnt
**bucket
= &freezer
->leaf_hash_table
[hash
% FC_CHAR_LEAF_HASH_SIZE
];
1088 for (ent
= *bucket
; ent
; ent
= ent
->next
)
1090 if (ent
->hash
== hash
&& !memcmp (&ent
->leaf
, leaf
, sizeof (FcCharLeaf
)))
1094 ent
= FcCharLeafEntCreate(freezer
);
1099 ent
->next
= *bucket
;
1105 FcCharSetHash (FcCharSet
*fcs
)
1110 /* hash in leaves */
1111 for (i
= 0; i
< fcs
->num
; i
++)
1112 hash
= ((hash
<< 1) | (hash
>> 31)) ^ FcCharLeafHash (FcCharSetLeaf(fcs
,i
));
1113 /* hash in numbers */
1114 for (i
= 0; i
< fcs
->num
; i
++)
1115 hash
= ((hash
<< 1) | (hash
>> 31)) ^ *FcCharSetNumbers(fcs
);
1120 FcCharSetFreezeOrig (FcCharSetFreezer
*freezer
, const FcCharSet
*orig
, const FcCharSet
*frozen
)
1122 FcCharSetOrigEnt
**bucket
= &freezer
->orig_hash_table
[((uintptr_t) orig
) & FC_CHAR_SET_HASH_SIZE
];
1123 FcCharSetOrigEnt
*ent
;
1125 ent
= malloc (sizeof (FcCharSetOrigEnt
));
1129 ent
->frozen
= frozen
;
1130 ent
->next
= *bucket
;
1136 FcCharSetFreezeBase (FcCharSetFreezer
*freezer
, FcCharSet
*fcs
, const FcCharSet
*orig
)
1138 FcChar32 hash
= FcCharSetHash (fcs
);
1139 FcCharSetEnt
**bucket
= &freezer
->set_hash_table
[hash
% FC_CHAR_SET_HASH_SIZE
];
1144 for (ent
= *bucket
; ent
; ent
= ent
->next
)
1146 if (ent
->hash
== hash
&&
1147 ent
->set
.num
== fcs
->num
&&
1148 !memcmp (FcCharSetNumbers(&ent
->set
),
1149 FcCharSetNumbers(fcs
),
1150 fcs
->num
* sizeof (FcChar16
)))
1155 for (i
= 0; i
< fcs
->num
; i
++)
1156 if (FcCharSetLeaf(&ent
->set
, i
) != FcCharSetLeaf(fcs
, i
))
1163 size
= (sizeof (FcCharSetEnt
) +
1164 fcs
->num
* sizeof (FcCharLeaf
*) +
1165 fcs
->num
* sizeof (FcChar16
));
1166 ent
= malloc (size
);
1169 FcMemAlloc (FC_MEM_CHARSET
, size
);
1171 freezer
->charsets_allocated
++;
1173 ent
->set
.ref
= FC_REF_CONSTANT
;
1174 ent
->set
.num
= fcs
->num
;
1177 intptr_t *ent_leaves
;
1179 ent
->set
.leaves_offset
= sizeof (ent
->set
);
1180 ent
->set
.numbers_offset
= (ent
->set
.leaves_offset
+
1181 fcs
->num
* sizeof (intptr_t));
1183 ent_leaves
= FcCharSetLeaves (&ent
->set
);
1184 for (i
= 0; i
< fcs
->num
; i
++)
1185 ent_leaves
[i
] = FcPtrToOffset (ent_leaves
,
1186 FcCharSetLeaf (fcs
, i
));
1187 memcpy (FcCharSetNumbers (&ent
->set
),
1188 FcCharSetNumbers (fcs
),
1189 fcs
->num
* sizeof (FcChar16
));
1193 ent
->set
.leaves_offset
= 0;
1194 ent
->set
.numbers_offset
= 0;
1198 ent
->next
= *bucket
;
1204 static const FcCharSet
*
1205 FcCharSetFindFrozen (FcCharSetFreezer
*freezer
, const FcCharSet
*orig
)
1207 FcCharSetOrigEnt
**bucket
= &freezer
->orig_hash_table
[((uintptr_t) orig
) & FC_CHAR_SET_HASH_SIZE
];
1208 FcCharSetOrigEnt
*ent
;
1210 for (ent
= *bucket
; ent
; ent
= ent
->next
)
1211 if (ent
->orig
== orig
)
1217 FcCharSetFreeze (FcCharSetFreezer
*freezer
, const FcCharSet
*fcs
)
1220 const FcCharSet
*n
= 0;
1224 b
= FcCharSetCreate ();
1227 for (i
= 0; i
< fcs
->num
; i
++)
1229 l
= FcCharSetFreezeLeaf (freezer
, FcCharSetLeaf(fcs
, i
));
1232 if (!FcCharSetInsertLeaf (b
, FcCharSetNumbers(fcs
)[i
] << 8, l
))
1235 n
= FcCharSetFreezeBase (freezer
, b
, fcs
);
1236 if (!FcCharSetFreezeOrig (freezer
, fcs
, n
))
1241 freezer
->charsets_seen
++;
1242 freezer
->leaves_seen
+= fcs
->num
;
1246 FcMemFree (FC_MEM_CHARSET
, b
->num
* sizeof (FcCharLeaf
*));
1247 free (FcCharSetLeaves (b
));
1251 FcMemFree (FC_MEM_CHARSET
, b
->num
* sizeof (FcChar16
));
1252 free (FcCharSetNumbers (b
));
1254 FcMemFree (FC_MEM_CHARSET
, sizeof (FcCharSet
));
1261 FcCharSetFreezerCreate (void)
1263 FcCharSetFreezer
*freezer
;
1265 freezer
= calloc (1, sizeof (FcCharSetFreezer
));
1270 FcCharSetFreezerDestroy (FcCharSetFreezer
*freezer
)
1274 if (FcDebug() & FC_DBG_CACHE
)
1276 printf ("\ncharsets %d -> %d leaves %d -> %d\n",
1277 freezer
->charsets_seen
, freezer
->charsets_allocated
,
1278 freezer
->leaves_seen
, freezer
->leaves_allocated
);
1280 for (i
= 0; i
< FC_CHAR_SET_HASH_SIZE
; i
++)
1282 FcCharSetEnt
*ent
, *next
;
1283 for (ent
= freezer
->set_hash_table
[i
]; ent
; ent
= next
)
1286 FcMemFree (FC_MEM_CHARSET
, (sizeof (FcCharSetEnt
) +
1287 ent
->set
.num
* sizeof (FcCharLeaf
*) +
1288 ent
->set
.num
* sizeof (FcChar16
)));
1293 for (i
= 0; i
< FC_CHAR_SET_HASH_SIZE
; i
++)
1295 FcCharSetOrigEnt
*ent
, *next
;
1296 for (ent
= freezer
->orig_hash_table
[i
]; ent
; ent
= next
)
1303 for (i
= 0; i
< freezer
->leaf_block_count
; i
++)
1305 free (freezer
->leaf_blocks
[i
]);
1306 FcMemFree (FC_MEM_CHARLEAF
, FC_CHAR_LEAF_BLOCK
* sizeof (FcCharLeafEnt
));
1309 free (freezer
->leaf_blocks
);
1314 FcCharSetSerializeAlloc (FcSerialize
*serialize
, const FcCharSet
*cs
)
1320 if (cs
->ref
!= FC_REF_CONSTANT
)
1322 if (!serialize
->cs_freezer
)
1324 serialize
->cs_freezer
= FcCharSetFreezerCreate ();
1325 if (!serialize
->cs_freezer
)
1328 if (FcCharSetFindFrozen (serialize
->cs_freezer
, cs
))
1331 cs
= FcCharSetFreeze (serialize
->cs_freezer
, cs
);
1334 leaves
= FcCharSetLeaves (cs
);
1335 numbers
= FcCharSetNumbers (cs
);
1337 if (!FcSerializeAlloc (serialize
, cs
, sizeof (FcCharSet
)))
1339 if (!FcSerializeAlloc (serialize
, leaves
, cs
->num
* sizeof (intptr_t)))
1341 if (!FcSerializeAlloc (serialize
, numbers
, cs
->num
* sizeof (FcChar16
)))
1343 for (i
= 0; i
< cs
->num
; i
++)
1344 if (!FcSerializeAlloc (serialize
, FcCharSetLeaf(cs
, i
),
1345 sizeof (FcCharLeaf
)))
1351 FcCharSetSerialize(FcSerialize
*serialize
, const FcCharSet
*cs
)
1353 FcCharSet
*cs_serialized
;
1354 intptr_t *leaves
, *leaves_serialized
;
1355 FcChar16
*numbers
, *numbers_serialized
;
1356 FcCharLeaf
*leaf
, *leaf_serialized
;
1359 if (cs
->ref
!= FC_REF_CONSTANT
&& serialize
->cs_freezer
)
1361 cs
= FcCharSetFindFrozen (serialize
->cs_freezer
, cs
);
1366 cs_serialized
= FcSerializePtr (serialize
, cs
);
1370 cs_serialized
->ref
= FC_REF_CONSTANT
;
1371 cs_serialized
->num
= cs
->num
;
1375 leaves
= FcCharSetLeaves (cs
);
1376 leaves_serialized
= FcSerializePtr (serialize
, leaves
);
1377 if (!leaves_serialized
)
1380 cs_serialized
->leaves_offset
= FcPtrToOffset (cs_serialized
,
1383 numbers
= FcCharSetNumbers (cs
);
1384 numbers_serialized
= FcSerializePtr (serialize
, numbers
);
1388 cs_serialized
->numbers_offset
= FcPtrToOffset (cs_serialized
,
1389 numbers_serialized
);
1391 for (i
= 0; i
< cs
->num
; i
++)
1393 leaf
= FcCharSetLeaf (cs
, i
);
1394 leaf_serialized
= FcSerializePtr (serialize
, leaf
);
1395 if (!leaf_serialized
)
1397 *leaf_serialized
= *leaf
;
1398 leaves_serialized
[i
] = FcPtrToOffset (leaves_serialized
,
1400 numbers_serialized
[i
] = numbers
[i
];
1405 cs_serialized
->leaves_offset
= 0;
1406 cs_serialized
->numbers_offset
= 0;
1409 return cs_serialized
;
1411 #define __fccharset__
1412 #include "fcaliastail.h"
1413 #undef __fccharset__