fccharset.c 28.7 KB
Newer Older
Keith Packard's avatar
Keith Packard committed
1
/*
2
 * fontconfig/src/fccharset.c
Keith Packard's avatar
Keith Packard committed
3
 *
4
 * Copyright © 2001 Keith Packard
Keith Packard's avatar
Keith Packard committed
5 6 7 8 9
 *
 * Permission to use, copy, modify, distribute, and sell this software and its
 * documentation for any purpose is hereby granted without fee, provided that
 * the above copyright notice appear in all copies and that both that
 * copyright notice and this permission notice appear in supporting
10
 * documentation, and that the name of the author(s) not be used in
Keith Packard's avatar
Keith Packard committed
11
 * advertising or publicity pertaining to distribution of the software without
12
 * specific, written prior permission.  The authors make no
Keith Packard's avatar
Keith Packard committed
13 14 15
 * representations about the suitability of this software for any purpose.  It
 * is provided "as is" without express or implied warranty.
 *
16
 * THE AUTHOR(S) DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
Keith Packard's avatar
Keith Packard committed
17
 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
18
 * EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY SPECIAL, INDIRECT OR
Keith Packard's avatar
Keith Packard committed
19 20 21 22 23 24 25
 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
 * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
 * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
 * PERFORMANCE OF THIS SOFTWARE.
 */

#include "fcint.h"
26
#include <stdlib.h>
Keith Packard's avatar
Keith Packard committed
27 28 29 30 31 32 33 34 35 36 37

/* #define CHECK */

FcCharSet *
FcCharSetCreate (void)
{
    FcCharSet	*fcs;

    fcs = (FcCharSet *) malloc (sizeof (FcCharSet));
    if (!fcs)
	return 0;
38
    FcRefInit (&fcs->ref, 1);
39
    fcs->num = 0;
40 41
    fcs->leaves_offset = 0;
    fcs->numbers_offset = 0;
Keith Packard's avatar
Keith Packard committed
42 43 44
    return fcs;
}

45 46 47 48 49 50 51 52 53 54 55 56 57 58 59
FcCharSet *
FcCharSetPromote (FcValuePromotionBuffer *vbuf)
{
    FcCharSet *fcs = (FcCharSet *) vbuf;

    FC_ASSERT_STATIC (sizeof (FcCharSet) <= sizeof (FcValuePromotionBuffer));

    FcRefSetConst (&fcs->ref);
    fcs->num = 0;
    fcs->leaves_offset = 0;
    fcs->numbers_offset = 0;

    return fcs;
}

Keith Packard's avatar
Keith Packard committed
60 61 62 63 64 65 66 67 68
FcCharSet *
FcCharSetNew (void)
{
    return FcCharSetCreate ();
}

void
FcCharSetDestroy (FcCharSet *fcs)
{
69
    int i;
70

71
    if (fcs)
72
    {
73
	if (FcRefIsConst (&fcs->ref))
74 75 76 77
	{
	    FcCacheObjectDereference (fcs);
	    return;
	}
78
	if (FcRefDec (&fcs->ref) != 1)
79 80 81 82 83 84 85 86 87
	    return;
	for (i = 0; i < fcs->num; i++)
	    free (FcCharSetLeaf (fcs, i));
	if (fcs->num)
	{
	    free (FcCharSetLeaves (fcs));
	    free (FcCharSetNumbers (fcs));
	}
	free (fcs);
88
    }
Keith Packard's avatar
Keith Packard committed
89 90 91
}

/*
Karl Tomlinson's avatar
Karl Tomlinson committed
92 93
 * Search for the leaf containing with the specified num.
 * Return its index if it exists, otherwise return negative of
94
 * the (position + 1) where it should be inserted
Keith Packard's avatar
Keith Packard committed
95 96
 */

Karl Tomlinson's avatar
Karl Tomlinson committed
97

98
static int
Karl Tomlinson's avatar
Karl Tomlinson committed
99
FcCharSetFindLeafForward (const FcCharSet *fcs, int start, FcChar16 num)
100
{
101
    FcChar16		*numbers = FcCharSetNumbers(fcs);
102
    FcChar16		page;
Karl Tomlinson's avatar
Karl Tomlinson committed
103
    int			low = start;
104 105 106 107 108 109 110 111
    int			high = fcs->num - 1;

    if (!numbers)
	return -1;
    while (low <= high)
    {
	int mid = (low + high) >> 1;
	page = numbers[mid];
Karl Tomlinson's avatar
Karl Tomlinson committed
112
	if (page == num)
113
	    return mid;
Karl Tomlinson's avatar
Karl Tomlinson committed
114
	if (page < num)
115 116 117 118
	    low = mid + 1;
	else
	    high = mid - 1;
    }
Karl Tomlinson's avatar
Karl Tomlinson committed
119
    if (high < 0 || (high < fcs->num && numbers[high] < num))
120 121 122 123
	high++;
    return -(high + 1);
}

Karl Tomlinson's avatar
Karl Tomlinson committed
124 125 126 127 128 129 130 131 132 133 134 135
/*
 * Locate the leaf containing the specified char, return
 * its index if it exists, otherwise return negative of
 * the (position + 1) where it should be inserted
 */

static int
FcCharSetFindLeafPos (const FcCharSet *fcs, FcChar32 ucs4)
{
    return FcCharSetFindLeafForward (fcs, 0, ucs4 >> 8);
}

Keith Packard's avatar
Keith Packard committed
136 137 138
static FcCharLeaf *
FcCharSetFindLeaf (const FcCharSet *fcs, FcChar32 ucs4)
{
139 140
    int	pos = FcCharSetFindLeafPos (fcs, ucs4);
    if (pos >= 0)
141
	return FcCharSetLeaf(fcs, pos);
142 143
    return 0;
}
Keith Packard's avatar
Keith Packard committed
144

145 146
#define FC_IS_ZERO_OR_POWER_OF_TWO(x) (!((x) & ((x)-1)))

147
static FcBool
148
FcCharSetPutLeaf (FcCharSet	*fcs,
149
		  FcChar32	ucs4,
150
		  FcCharLeaf	*leaf,
151 152
		  int		pos)
{
153 154
    intptr_t	*leaves = FcCharSetLeaves (fcs);
    FcChar16	*numbers = FcCharSetNumbers (fcs);
155 156 157 158

    ucs4 >>= 8;
    if (ucs4 >= 0x10000)
	return FcFalse;
159

160
    if (FC_IS_ZERO_OR_POWER_OF_TWO (fcs->num))
161
    {
162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177
      if (!fcs->num)
      {
        unsigned int alloced = 8;
	leaves = malloc (alloced * sizeof (*leaves));
	numbers = malloc (alloced * sizeof (*numbers));
      }
      else
      {
        unsigned int alloced = fcs->num;
	intptr_t *new_leaves, distance;

	alloced *= 2;
	new_leaves = realloc (leaves, alloced * sizeof (*leaves));
	numbers = realloc (numbers, alloced * sizeof (*numbers));

	distance = (intptr_t) new_leaves - (intptr_t) leaves;
178 179 180 181 182 183 184
	if (new_leaves && distance)
	{
	    int i;
	    for (i = 0; i < fcs->num; i++)
		new_leaves[i] -= distance;
	}
	leaves = new_leaves;
185 186 187 188 189 190 191
      }

      if (!leaves || !numbers)
	  return FcFalse;

      fcs->leaves_offset = FcPtrToOffset (fcs, leaves);
      fcs->numbers_offset = FcPtrToOffset (fcs, numbers);
192
    }
193 194

    memmove (leaves + pos + 1, leaves + pos,
195 196 197 198 199
	     (fcs->num - pos) * sizeof (*leaves));
    memmove (numbers + pos + 1, numbers + pos,
	     (fcs->num - pos) * sizeof (*numbers));
    numbers[pos] = (FcChar16) ucs4;
    leaves[pos] = FcPtrToOffset (leaves, leaf);
200 201
    fcs->num++;
    return FcTrue;
Keith Packard's avatar
Keith Packard committed
202 203 204 205 206 207 208
}

/*
 * Locate the leaf containing the specified char, creating it
 * if desired
 */

209
FcCharLeaf *
Keith Packard's avatar
Keith Packard committed
210 211
FcCharSetFindLeafCreate (FcCharSet *fcs, FcChar32 ucs4)
{
212 213
    int			pos;
    FcCharLeaf		*leaf;
Keith Packard's avatar
Keith Packard committed
214

215 216
    pos = FcCharSetFindLeafPos (fcs, ucs4);
    if (pos >= 0)
217
	return FcCharSetLeaf(fcs, pos);
218

219 220 221
    leaf = calloc (1, sizeof (FcCharLeaf));
    if (!leaf)
	return 0;
222

223 224
    pos = -pos - 1;
    if (!FcCharSetPutLeaf (fcs, ucs4, leaf, pos))
Keith Packard's avatar
Keith Packard committed
225
    {
226 227
	free (leaf);
	return 0;
Keith Packard's avatar
Keith Packard committed
228
    }
229 230 231 232 233 234 235 236 237 238
    return leaf;
}

static FcBool
FcCharSetInsertLeaf (FcCharSet *fcs, FcChar32 ucs4, FcCharLeaf *leaf)
{
    int		    pos;

    pos = FcCharSetFindLeafPos (fcs, ucs4);
    if (pos >= 0)
Keith Packard's avatar
Keith Packard committed
239
    {
240 241 242
	free (FcCharSetLeaf (fcs, pos));
	FcCharSetLeaves(fcs)[pos] = FcPtrToOffset (FcCharSetLeaves(fcs),
						   leaf);
243
	return FcTrue;
Keith Packard's avatar
Keith Packard committed
244
    }
245 246
    pos = -pos - 1;
    return FcCharSetPutLeaf (fcs, ucs4, leaf, pos);
Keith Packard's avatar
Keith Packard committed
247 248 249 250 251 252 253
}

FcBool
FcCharSetAddChar (FcCharSet *fcs, FcChar32 ucs4)
{
    FcCharLeaf	*leaf;
    FcChar32	*b;
254

255
    if (fcs == NULL || FcRefIsConst (&fcs->ref))
Keith Packard's avatar
Keith Packard committed
256 257 258 259 260 261 262 263 264
	return FcFalse;
    leaf = FcCharSetFindLeafCreate (fcs, ucs4);
    if (!leaf)
	return FcFalse;
    b = &leaf->map[(ucs4 & 0xff) >> 5];
    *b |= (1 << (ucs4 & 0x1f));
    return FcTrue;
}

265 266 267 268 269 270
FcBool
FcCharSetDelChar (FcCharSet *fcs, FcChar32 ucs4)
{
    FcCharLeaf	*leaf;
    FcChar32	*b;

271
    if (fcs == NULL || FcRefIsConst (&fcs->ref))
272 273 274 275 276 277 278 279 280 281
	return FcFalse;
    leaf = FcCharSetFindLeaf (fcs, ucs4);
    if (!leaf)
	return FcTrue;
    b = &leaf->map[(ucs4 & 0xff) >> 5];
    *b &= ~(1 << (ucs4 & 0x1f));
    /* We don't bother removing the leaf if it's empty */
    return FcTrue;
}

Keith Packard's avatar
Keith Packard committed
282 283 284 285 286 287 288
/*
 * An iterator for the leaves of a charset
 */

typedef struct _fcCharSetIter {
    FcCharLeaf	    *leaf;
    FcChar32	    ucs4;
289
    int		    pos;
Keith Packard's avatar
Keith Packard committed
290 291 292
} FcCharSetIter;

/*
293
 * Set iter->leaf to the leaf containing iter->ucs4 or higher
Keith Packard's avatar
Keith Packard committed
294 295 296 297 298
 */

static void
FcCharSetIterSet (const FcCharSet *fcs, FcCharSetIter *iter)
{
299
    int		    pos = FcCharSetFindLeafPos (fcs, iter->ucs4);
300

301
    if (pos < 0)
302
    {
303 304
	pos = -pos - 1;
	if (pos == fcs->num)
305
	{
306 307 308
	    iter->ucs4 = ~0;
	    iter->leaf = 0;
	    return;
309
	}
310
        iter->ucs4 = (FcChar32) FcCharSetNumbers(fcs)[pos] << 8;
311
    }
312
    iter->leaf = FcCharSetLeaf(fcs, pos);
313
    iter->pos = pos;
Keith Packard's avatar
Keith Packard committed
314 315 316 317 318
}

static void
FcCharSetIterNext (const FcCharSet *fcs, FcCharSetIter *iter)
{
319 320
    int	pos = iter->pos + 1;
    if (pos >= fcs->num)
321 322 323 324
    {
	iter->ucs4 = ~0;
	iter->leaf = 0;
    }
325
    else
326
    {
327 328
	iter->ucs4 = (FcChar32) FcCharSetNumbers(fcs)[pos] << 8;
	iter->leaf = FcCharSetLeaf(fcs, pos);
329
	iter->pos = pos;
330 331 332
    }
}

Keith Packard's avatar
Keith Packard committed
333 334 335 336 337

static void
FcCharSetIterStart (const FcCharSet *fcs, FcCharSetIter *iter)
{
    iter->ucs4 = 0;
Patrick Lam's avatar
Patrick Lam committed
338
    iter->pos = 0;
Keith Packard's avatar
Keith Packard committed
339 340 341 342 343 344
    FcCharSetIterSet (fcs, iter);
}

FcCharSet *
FcCharSetCopy (FcCharSet *src)
{
345 346
    if (src)
    {
347 348
	if (!FcRefIsConst (&src->ref))
	    FcRefInc (&src->ref);
349 350 351
	else
	    FcCacheObjectReference (src);
    }
Keith Packard's avatar
Keith Packard committed
352 353 354 355 356 357 358 359
    return src;
}

FcBool
FcCharSetEqual (const FcCharSet *a, const FcCharSet *b)
{
    FcCharSetIter   ai, bi;
    int		    i;
360

Keith Packard's avatar
Keith Packard committed
361 362
    if (a == b)
	return FcTrue;
363 364
    if (!a || !b)
	return FcFalse;
Keith Packard's avatar
Keith Packard committed
365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401
    for (FcCharSetIterStart (a, &ai), FcCharSetIterStart (b, &bi);
	 ai.leaf && bi.leaf;
	 FcCharSetIterNext (a, &ai), FcCharSetIterNext (b, &bi))
    {
	if (ai.ucs4 != bi.ucs4)
	    return FcFalse;
	for (i = 0; i < 256/32; i++)
	    if (ai.leaf->map[i] != bi.leaf->map[i])
		return FcFalse;
    }
    return ai.leaf == bi.leaf;
}

static FcBool
FcCharSetAddLeaf (FcCharSet	*fcs,
		  FcChar32	ucs4,
		  FcCharLeaf	*leaf)
{
    FcCharLeaf   *new = FcCharSetFindLeafCreate (fcs, ucs4);
    if (!new)
	return FcFalse;
    *new = *leaf;
    return FcTrue;
}

static FcCharSet *
FcCharSetOperate (const FcCharSet   *a,
		  const FcCharSet   *b,
		  FcBool	    (*overlap) (FcCharLeaf	    *result,
						const FcCharLeaf    *al,
						const FcCharLeaf    *bl),
		  FcBool	aonly,
		  FcBool	bonly)
{
    FcCharSet	    *fcs;
    FcCharSetIter   ai, bi;

402 403
    if (!a || !b)
	goto bail0;
Keith Packard's avatar
Keith Packard committed
404 405 406 407 408
    fcs = FcCharSetCreate ();
    if (!fcs)
	goto bail0;
    FcCharSetIterStart (a, &ai);
    FcCharSetIterStart (b, &bi);
409
    while ((ai.leaf || (bonly && bi.leaf)) && (bi.leaf || (aonly && ai.leaf)))
Keith Packard's avatar
Keith Packard committed
410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496
    {
	if (ai.ucs4 < bi.ucs4)
	{
	    if (aonly)
	    {
		if (!FcCharSetAddLeaf (fcs, ai.ucs4, ai.leaf))
		    goto bail1;
		FcCharSetIterNext (a, &ai);
	    }
	    else
	    {
		ai.ucs4 = bi.ucs4;
		FcCharSetIterSet (a, &ai);
	    }
	}
	else if (bi.ucs4 < ai.ucs4 )
	{
	    if (bonly)
	    {
		if (!FcCharSetAddLeaf (fcs, bi.ucs4, bi.leaf))
		    goto bail1;
		FcCharSetIterNext (b, &bi);
	    }
	    else
	    {
		bi.ucs4 = ai.ucs4;
		FcCharSetIterSet (b, &bi);
	    }
	}
	else
	{
	    FcCharLeaf  leaf;

	    if ((*overlap) (&leaf, ai.leaf, bi.leaf))
	    {
		if (!FcCharSetAddLeaf (fcs, ai.ucs4, &leaf))
		    goto bail1;
	    }
	    FcCharSetIterNext (a, &ai);
	    FcCharSetIterNext (b, &bi);
	}
    }
    return fcs;
bail1:
    FcCharSetDestroy (fcs);
bail0:
    return 0;
}

static FcBool
FcCharSetIntersectLeaf (FcCharLeaf *result,
			const FcCharLeaf *al,
			const FcCharLeaf *bl)
{
    int	    i;
    FcBool  nonempty = FcFalse;

    for (i = 0; i < 256/32; i++)
	if ((result->map[i] = al->map[i] & bl->map[i]))
	    nonempty = FcTrue;
    return nonempty;
}

FcCharSet *
FcCharSetIntersect (const FcCharSet *a, const FcCharSet *b)
{
    return FcCharSetOperate (a, b, FcCharSetIntersectLeaf, FcFalse, FcFalse);
}

static FcBool
FcCharSetUnionLeaf (FcCharLeaf *result,
		    const FcCharLeaf *al,
		    const FcCharLeaf *bl)
{
    int	i;

    for (i = 0; i < 256/32; i++)
	result->map[i] = al->map[i] | bl->map[i];
    return FcTrue;
}

FcCharSet *
FcCharSetUnion (const FcCharSet *a, const FcCharSet *b)
{
    return FcCharSetOperate (a, b, FcCharSetUnionLeaf, FcTrue, FcTrue);
}

Karl Tomlinson's avatar
Karl Tomlinson committed
497 498
FcBool
FcCharSetMerge (FcCharSet *a, const FcCharSet *b, FcBool *changed)
499
{
Karl Tomlinson's avatar
Karl Tomlinson committed
500 501
    int		ai = 0, bi = 0;
    FcChar16	an, bn;
502

503 504 505
    if (!a || !b)
	return FcFalse;

506
    if (FcRefIsConst (&a->ref)) {
507 508
	if (changed)
	    *changed = FcFalse;
Karl Tomlinson's avatar
Karl Tomlinson committed
509
	return FcFalse;
510
    }
511

Karl Tomlinson's avatar
Karl Tomlinson committed
512 513 514 515 516
    if (changed) {
	*changed = !FcCharSetIsSubset(b, a);
	if (!*changed)
	    return FcTrue;
    }
517

Karl Tomlinson's avatar
Karl Tomlinson committed
518
    while (bi < b->num)
519
    {
Karl Tomlinson's avatar
Karl Tomlinson committed
520 521
	an = ai < a->num ? FcCharSetNumbers(a)[ai] : ~0;
	bn = FcCharSetNumbers(b)[bi];
522

Karl Tomlinson's avatar
Karl Tomlinson committed
523
	if (an < bn)
524
	{
Karl Tomlinson's avatar
Karl Tomlinson committed
525 526 527
	    ai = FcCharSetFindLeafForward (a, ai + 1, bn);
	    if (ai < 0)
		ai = -ai - 1;
528 529 530
	}
	else
	{
Karl Tomlinson's avatar
Karl Tomlinson committed
531 532
	    FcCharLeaf *bl = FcCharSetLeaf(b, bi);
	    if (bn < an)
533
	    {
Karl Tomlinson's avatar
Karl Tomlinson committed
534 535 536 537 538 539 540
		if (!FcCharSetAddLeaf (a, bn << 8, bl))
		    return FcFalse;
	    }
	    else
	    {
		FcCharLeaf *al = FcCharSetLeaf(a, ai);
		FcCharSetUnionLeaf (al, al, bl);
541 542
	    }

Karl Tomlinson's avatar
Karl Tomlinson committed
543 544
	    ai++;
	    bi++;
545 546 547
	}
    }

Karl Tomlinson's avatar
Karl Tomlinson committed
548
    return FcTrue;
549 550
}

Keith Packard's avatar
Keith Packard committed
551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573
static FcBool
FcCharSetSubtractLeaf (FcCharLeaf *result,
		       const FcCharLeaf *al,
		       const FcCharLeaf *bl)
{
    int	    i;
    FcBool  nonempty = FcFalse;

    for (i = 0; i < 256/32; i++)
	if ((result->map[i] = al->map[i] & ~bl->map[i]))
	    nonempty = FcTrue;
    return nonempty;
}

FcCharSet *
FcCharSetSubtract (const FcCharSet *a, const FcCharSet *b)
{
    return FcCharSetOperate (a, b, FcCharSetSubtractLeaf, FcTrue, FcFalse);
}

FcBool
FcCharSetHasChar (const FcCharSet *fcs, FcChar32 ucs4)
{
574 575 576 577 578
    FcCharLeaf	*leaf;

    if (!fcs)
	return FcFalse;
    leaf = FcCharSetFindLeaf (fcs, ucs4);
Keith Packard's avatar
Keith Packard committed
579 580 581 582 583 584 585 586
    if (!leaf)
	return FcFalse;
    return (leaf->map[(ucs4 & 0xff) >> 5] & (1 << (ucs4 & 0x1f))) != 0;
}

static FcChar32
FcCharSetPopCount (FcChar32 c1)
{
587 588 589
#if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
    return __builtin_popcount (c1);
#else
Keith Packard's avatar
Keith Packard committed
590 591 592 593
    /* hackmem 169 */
    FcChar32	c2 = (c1 >> 1) & 033333333333;
    c2 = c1 - c2 - ((c2 >> 1) & 033333333333);
    return (((c2 + (c2 >> 3)) & 030707070707) % 077);
594
#endif
Keith Packard's avatar
Keith Packard committed
595 596 597 598 599 600 601
}

FcChar32
FcCharSetIntersectCount (const FcCharSet *a, const FcCharSet *b)
{
    FcCharSetIter   ai, bi;
    FcChar32	    count = 0;
602

603
    if (a && b)
Keith Packard's avatar
Keith Packard committed
604
    {
605 606 607
	FcCharSetIterStart (a, &ai);
	FcCharSetIterStart (b, &bi);
	while (ai.leaf && bi.leaf)
Keith Packard's avatar
Keith Packard committed
608
	{
609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627
	    if (ai.ucs4 == bi.ucs4)
	    {
		FcChar32	*am = ai.leaf->map;
		FcChar32	*bm = bi.leaf->map;
		int		i = 256/32;
		while (i--)
		    count += FcCharSetPopCount (*am++ & *bm++);
		FcCharSetIterNext (a, &ai);
	    }
	    else if (ai.ucs4 < bi.ucs4)
	    {
		ai.ucs4 = bi.ucs4;
		FcCharSetIterSet (a, &ai);
	    }
	    if (bi.ucs4 < ai.ucs4)
	    {
		bi.ucs4 = ai.ucs4;
		FcCharSetIterSet (b, &bi);
	    }
Keith Packard's avatar
Keith Packard committed
628 629 630 631 632 633 634 635 636 637
	}
    }
    return count;
}

FcChar32
FcCharSetCount (const FcCharSet *a)
{
    FcCharSetIter   ai;
    FcChar32	    count = 0;
638

639
    if (a)
Keith Packard's avatar
Keith Packard committed
640
    {
641 642 643 644
	for (FcCharSetIterStart (a, &ai); ai.leaf; FcCharSetIterNext (a, &ai))
	{
	    int		    i = 256/32;
	    FcChar32	    *am = ai.leaf->map;
Keith Packard's avatar
Keith Packard committed
645

646 647 648
	    while (i--)
		count += FcCharSetPopCount (*am++);
	}
Keith Packard's avatar
Keith Packard committed
649 650 651 652 653 654 655 656 657
    }
    return count;
}

FcChar32
FcCharSetSubtractCount (const FcCharSet *a, const FcCharSet *b)
{
    FcCharSetIter   ai, bi;
    FcChar32	    count = 0;
658

659
    if (a && b)
Keith Packard's avatar
Keith Packard committed
660
    {
661 662 663
	FcCharSetIterStart (a, &ai);
	FcCharSetIterStart (b, &bi);
	while (ai.leaf)
Keith Packard's avatar
Keith Packard committed
664
	{
665
	    if (ai.ucs4 <= bi.ucs4)
Keith Packard's avatar
Keith Packard committed
666
	    {
667 668 669 670 671 672 673 674 675 676 677 678 679 680
		FcChar32	*am = ai.leaf->map;
		int		i = 256/32;
		if (ai.ucs4 == bi.ucs4)
		{
		    FcChar32	*bm = bi.leaf->map;
		    while (i--)
			count += FcCharSetPopCount (*am++ & ~*bm++);
		}
		else
		{
		    while (i--)
			count += FcCharSetPopCount (*am++);
		}
		FcCharSetIterNext (a, &ai);
Keith Packard's avatar
Keith Packard committed
681
	    }
682
	    else if (bi.leaf)
Keith Packard's avatar
Keith Packard committed
683
	    {
684 685
		bi.ucs4 = ai.ucs4;
		FcCharSetIterSet (b, &bi);
Keith Packard's avatar
Keith Packard committed
686 687 688 689 690 691
	    }
	}
    }
    return count;
}

692 693 694 695 696 697
/*
 * return FcTrue iff a is a subset of b
 */
FcBool
FcCharSetIsSubset (const FcCharSet *a, const FcCharSet *b)
{
698 699
    int		ai, bi;
    FcChar16	an, bn;
700

701 702 703 704
    if (a == b)
	return FcTrue;
    if (!a || !b)
	return FcFalse;
705 706 707
    bi = 0;
    ai = 0;
    while (ai < a->num && bi < b->num)
708
    {
709 710
	an = FcCharSetNumbers(a)[ai];
	bn = FcCharSetNumbers(b)[bi];
711 712 713
	/*
	 * Check matching pages
	 */
714
	if (an == bn)
715
	{
716 717
	    FcChar32	*am = FcCharSetLeaf(a, ai)->map;
	    FcChar32	*bm = FcCharSetLeaf(b, bi)->map;
718
	
719
	    if (am != bm)
720
	    {
721
		int	i = 256/32;
722 723 724
		/*
		 * Does am have any bits not in bm?
		 */
725 726 727
		while (i--)
		    if (*am++ & ~*bm++)
			return FcFalse;
728
	    }
729 730 731
	    ai++;
	    bi++;
	}
732 733 734
	/*
	 * Does a have any pages not in b?
	 */
735 736 737 738
	else if (an < bn)
	    return FcFalse;
	else
	{
Karl Tomlinson's avatar
Karl Tomlinson committed
739 740 741
	    bi = FcCharSetFindLeafForward (b, bi + 1, an);
	    if (bi < 0)
		bi = -bi - 1;
742 743
	}
    }
744 745 746
    /*
     * did we look at every page?
     */
747
    return ai >= a->num;
748 749
}

750 751 752 753 754
/*
 * These two functions efficiently walk the entire charmap for
 * other software (like pango) that want their own copy
 */

755
FcChar32
756
FcCharSetNextPage (const FcCharSet  *a,
757 758
		   FcChar32	    map[FC_CHARSET_MAP_SIZE],
		   FcChar32	    *next)
759 760
{
    FcCharSetIter   ai;
761
    FcChar32	    page;
762

763 764
    if (!a)
	return FC_CHARSET_DONE;
765
    ai.ucs4 = *next;
766 767
    FcCharSetIterSet (a, &ai);
    if (!ai.leaf)
768
	return FC_CHARSET_DONE;
769

770 771 772 773 774 775 776 777 778 779 780
    /*
     * Save current information
     */
    page = ai.ucs4;
    memcpy (map, ai.leaf->map, sizeof (ai.leaf->map));
    /*
     * Step to next page
     */
    FcCharSetIterNext (a, &ai);
    *next = ai.ucs4;

781 782 783
    return page;
}

784
FcChar32
785
FcCharSetFirstPage (const FcCharSet *a,
786 787 788 789 790 791 792
		    FcChar32	    map[FC_CHARSET_MAP_SIZE],
		    FcChar32	    *next)
{
    *next = 0;
    return FcCharSetNextPage (a, map, next);
}

793 794 795
/*
 * old coverage API, rather hard to use correctly
 */
796

797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817
FcChar32
FcCharSetCoverage (const FcCharSet *a, FcChar32 page, FcChar32 *result)
{
    FcCharSetIter   ai;

    ai.ucs4 = page;
    FcCharSetIterSet (a, &ai);
    if (!ai.leaf)
    {
	memset (result, '\0', 256 / 8);
	page = 0;
    }
    else
    {
	memcpy (result, ai.leaf->map, sizeof (ai.leaf->map));
	FcCharSetIterNext (a, &ai);
	page = ai.ucs4;
    }
    return page;
}

Keith Packard's avatar
Keith Packard committed
818
static FcBool
819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834
FcNameParseRange (FcChar8 **string, FcChar32 *pfirst, FcChar32 *plast)
{
	char *s = (char *) *string;
	char *t;
	long first, last;

	while (isspace(*s) || *s == ',')
	    s++;
	t = s;
	errno = 0;
	first = last = strtol (s, &s, 16);
	if (errno)
	    return FcFalse;
	while (isspace(*s) || *s == ',')
	    s++;
	if (*s == '-')
Keith Packard's avatar
Keith Packard committed
835
	{
836 837 838 839
	    s++;
	    errno = 0;
	    last = strtol (s, &s, 16);
	    if (errno)
Keith Packard's avatar
Keith Packard committed
840
		return FcFalse;
841 842 843 844 845 846 847 848 849
	}

	if (s == t || first < 0 || last < 0 || last < first || last > 0x10ffff)
	     return FcFalse;

	*string = (FcChar8 *) s;
	*pfirst = first;
	*plast = last;
	return FcTrue;
Keith Packard's avatar
Keith Packard committed
850 851
}

852 853 854 855
FcCharSet *
FcNameParseCharSet (FcChar8 *string)
{
    FcCharSet	*c;
856
    FcChar32	first, last;
857 858 859 860 861 862

    c = FcCharSetCreate ();
    if (!c)
	goto bail0;
    while (*string)
    {
863 864 865
	FcChar32 u;

	if (!FcNameParseRange (&string, &first, &last))
866
		goto bail1;
867 868 869

	for (u = first; u < last + 1; u++)
	    FcCharSetAddChar (c, u);
870 871 872
    }
    return c;
bail1:
873
    FcCharSetDestroy (c);
874 875 876 877
bail0:
    return NULL;
}

878 879 880 881 882 883 884 885
static void
FcNameUnparseUnicode (FcStrBuf *buf, FcChar32 u)
{
    FcChar8	    buf_static[64];
    snprintf ((char *) buf_static, sizeof (buf_static), "%x", u);
    FcStrBufString (buf, buf_static);
}

886 887 888 889
FcBool
FcNameUnparseCharSet (FcStrBuf *buf, const FcCharSet *c)
{
    FcCharSetIter   ci;
890
    FcChar32	    first, last;
891 892 893 894 895
    int		    i;
#ifdef CHECK
    int		    len = buf->len;
#endif

896 897
    first = last = 0x7FFFFFFF;

898 899 900 901 902
    for (FcCharSetIterStart (c, &ci);
	 ci.leaf;
	 FcCharSetIterNext (c, &ci))
    {
	for (i = 0; i < 256/32; i++)
903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934
	{
	    FcChar32 bits = ci.leaf->map[i];
	    FcChar32 u = ci.ucs4 + i * 32;

	    while (bits)
	    {
		if (bits & 1)
		{
			if (u != last + 1)
			{
			    if (last != first)
			    {
				FcStrBufChar (buf, '-');
				FcNameUnparseUnicode (buf, last);
			    }
			    if (last != 0x7FFFFFFF)
				FcStrBufChar (buf, ',');
			    /* Start new range. */
			    first = u;
			    FcNameUnparseUnicode (buf, u);
			}
			last = u;
		}
		bits >>= 1;
		u++;
	    }
	}
    }
    if (last != first)
    {
	FcStrBufChar (buf, '-');
	FcNameUnparseUnicode (buf, last);
935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985
    }
#ifdef CHECK
    {
	FcCharSet	*check;
	FcChar32	missing;
	FcCharSetIter	ci, checki;
	
	/* null terminate for parser */
	FcStrBufChar (buf, '\0');
	/* step back over null for life after test */
	buf->len--;
	check = FcNameParseCharSet (buf->buf + len);
	FcCharSetIterStart (c, &ci);
	FcCharSetIterStart (check, &checki);
	while (ci.leaf || checki.leaf)
	{
	    if (ci.ucs4 < checki.ucs4)
	    {
		printf ("Missing leaf node at 0x%x\n", ci.ucs4);
		FcCharSetIterNext (c, &ci);
	    }
	    else if (checki.ucs4 < ci.ucs4)
	    {
		printf ("Extra leaf node at 0x%x\n", checki.ucs4);
		FcCharSetIterNext (check, &checki);
	    }
	    else
	    {
		int	    i = 256/32;
		FcChar32    *cm = ci.leaf->map;
		FcChar32    *checkm = checki.leaf->map;

		for (i = 0; i < 256; i += 32)
		{
		    if (*cm != *checkm)
			printf ("Mismatching sets at 0x%08x: 0x%08x != 0x%08x\n",
				ci.ucs4 + i, *cm, *checkm);
		    cm++;
		    checkm++;
		}
		FcCharSetIterNext (c, &ci);
		FcCharSetIterNext (check, &checki);
	    }
	}
	if ((missing = FcCharSetSubtractCount (c, check)))
	    printf ("%d missing in reparsed result\n", missing);
	if ((missing = FcCharSetSubtractCount (check, c)))
	    printf ("%d extra in reparsed result\n", missing);
	FcCharSetDestroy (check);
    }
#endif
986

987 988 989
    return FcTrue;
}

990 991 992 993 994 995 996 997 998
typedef struct _FcCharLeafEnt FcCharLeafEnt;

struct _FcCharLeafEnt {
    FcCharLeafEnt   *next;
    FcChar32	    hash;
    FcCharLeaf	    leaf;
};

#define FC_CHAR_LEAF_BLOCK	(4096 / sizeof (FcCharLeafEnt))
999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031
#define FC_CHAR_LEAF_HASH_SIZE	257

typedef struct _FcCharSetEnt FcCharSetEnt;

struct _FcCharSetEnt {
    FcCharSetEnt	*next;
    FcChar32		hash;
    FcCharSet		set;
};

typedef struct _FcCharSetOrigEnt FcCharSetOrigEnt;

struct _FcCharSetOrigEnt {
    FcCharSetOrigEnt	*next;
    const FcCharSet    	*orig;
    const FcCharSet    	*frozen;
};

#define FC_CHAR_SET_HASH_SIZE    67

struct _FcCharSetFreezer {
    FcCharLeafEnt   *leaf_hash_table[FC_CHAR_LEAF_HASH_SIZE];
    FcCharLeafEnt   **leaf_blocks;
    int		    leaf_block_count;
    FcCharSetEnt    *set_hash_table[FC_CHAR_SET_HASH_SIZE];
    FcCharSetOrigEnt	*orig_hash_table[FC_CHAR_SET_HASH_SIZE];
    FcCharLeafEnt   *current_block;
    int		    leaf_remain;
    int		    leaves_seen;
    int		    charsets_seen;
    int		    leaves_allocated;
    int		    charsets_allocated;
};
1032 1033

static FcCharLeafEnt *
1034
FcCharLeafEntCreate (FcCharSetFreezer *freezer)
1035
{
1036
    if (!freezer->leaf_remain)
1037
    {
1038 1039
	FcCharLeafEnt **newBlocks;

1040 1041
	freezer->leaf_block_count++;
	newBlocks = realloc (freezer->leaf_blocks, freezer->leaf_block_count * sizeof (FcCharLeafEnt *));
1042 1043
	if (!newBlocks)
	    return 0;
1044 1045 1046
	freezer->leaf_blocks = newBlocks;
	freezer->current_block = freezer->leaf_blocks[freezer->leaf_block_count-1] = malloc (FC_CHAR_LEAF_BLOCK * sizeof (FcCharLeafEnt));
	if (!freezer->current_block)
1047
	    return 0;
1048
	freezer->leaf_remain = FC_CHAR_LEAF_BLOCK;
1049
    }
1050 1051 1052
    freezer->leaf_remain--;
    freezer->leaves_allocated++;
    return freezer->current_block++;
1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066
}

static FcChar32
FcCharLeafHash (FcCharLeaf *leaf)
{
    FcChar32	hash = 0;
    int		i;

    for (i = 0; i < 256/32; i++)
	hash = ((hash << 1) | (hash >> 31)) ^ leaf->map[i];
    return hash;
}

static FcCharLeaf *
1067
FcCharSetFreezeLeaf (FcCharSetFreezer *freezer, FcCharLeaf *leaf)
1068 1069
{
    FcChar32			hash = FcCharLeafHash (leaf);
1070
    FcCharLeafEnt		**bucket = &freezer->leaf_hash_table[hash % FC_CHAR_LEAF_HASH_SIZE];
1071
    FcCharLeafEnt		*ent;
1072

1073 1074 1075 1076 1077 1078
    for (ent = *bucket; ent; ent = ent->next)
    {
	if (ent->hash == hash && !memcmp (&ent->leaf, leaf, sizeof (FcCharLeaf)))
	    return &ent->leaf;
    }

1079
    ent = FcCharLeafEntCreate(freezer);
1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095
    if (!ent)
	return 0;
    ent->leaf = *leaf;
    ent->hash = hash;
    ent->next = *bucket;
    *bucket = ent;
    return &ent->leaf;
}

static FcChar32
FcCharSetHash (FcCharSet *fcs)
{
    FcChar32	hash = 0;
    int		i;

    /* hash in leaves */
1096 1097
    for (i = 0; i < fcs->num; i++)
	hash = ((hash << 1) | (hash >> 31)) ^ FcCharLeafHash (FcCharSetLeaf(fcs,i));
1098 1099
    /* hash in numbers */
    for (i = 0; i < fcs->num; i++)
1100
	hash = ((hash << 1) | (hash >> 31)) ^ *FcCharSetNumbers(fcs);
1101 1102 1103
    return hash;
}

1104 1105 1106 1107 1108
static FcBool
FcCharSetFreezeOrig (FcCharSetFreezer *freezer, const FcCharSet *orig, const FcCharSet *frozen)
{
    FcCharSetOrigEnt	**bucket = &freezer->orig_hash_table[((uintptr_t) orig) & FC_CHAR_SET_HASH_SIZE];
    FcCharSetOrigEnt	*ent;
1109

1110 1111 1112 1113 1114 1115 1116 1117 1118
    ent = malloc (sizeof (FcCharSetOrigEnt));
    if (!ent)
	return FcFalse;
    ent->orig = orig;
    ent->frozen = frozen;
    ent->next = *bucket;
    *bucket = ent;
    return FcTrue;
}
1119

1120
static FcCharSet *
1121
FcCharSetFreezeBase (FcCharSetFreezer *freezer, FcCharSet *fcs)
1122 1123
{
    FcChar32		hash = FcCharSetHash (fcs);
1124
    FcCharSetEnt	**bucket = &freezer->set_hash_table[hash % FC_CHAR_SET_HASH_SIZE];
1125
    FcCharSetEnt	*ent;
1126
    int			size;
1127
    int			i;
1128 1129 1130 1131 1132

    for (ent = *bucket; ent; ent = ent->next)
    {
	if (ent->hash == hash &&
	    ent->set.num == fcs->num &&
1133
	    !memcmp (FcCharSetNumbers(&ent->set),
1134
		     FcCharSetNumbers(fcs),
1135 1136
		     fcs->num * sizeof (FcChar16)))
	{
1137 1138 1139 1140
	    FcBool ok = FcTrue;
	    int i;

	    for (i = 0; i < fcs->num; i++)
1141
		if (FcCharSetLeaf(&ent->set, i) != FcCharSetLeaf(fcs, i))
1142 1143 1144
		    ok = FcFalse;
	    if (ok)
		return &ent->set;
1145 1146 1147
	}
    }

1148 1149 1150 1151
    size = (sizeof (FcCharSetEnt) +
	    fcs->num * sizeof (FcCharLeaf *) +
	    fcs->num * sizeof (FcChar16));
    ent = malloc (size);
1152 1153
    if (!ent)
	return 0;
1154

1155
    freezer->charsets_allocated++;
1156

1157
    FcRefSetConst (&ent->set.ref);
1158
    ent->set.num = fcs->num;
1159
    if (fcs->num)
1160
    {
1161 1162 1163 1164 1165
	intptr_t    *ent_leaves;

	ent->set.leaves_offset = sizeof (ent->set);
	ent->set.numbers_offset = (ent->set.leaves_offset +
				   fcs->num * sizeof (intptr_t));
1166

1167 1168 1169 1170
	ent_leaves = FcCharSetLeaves (&ent->set);
	for (i = 0; i < fcs->num; i++)
	    ent_leaves[i] = FcPtrToOffset (ent_leaves,
					   FcCharSetLeaf (fcs, i));
1171 1172
	memcpy (FcCharSetNumbers (&ent->set),
		FcCharSetNumbers (fcs),
1173
		fcs->num * sizeof (FcChar16));
1174 1175 1176
    }
    else
    {
1177 1178
	ent->set.leaves_offset = 0;
	ent->set.numbers_offset = 0;
1179
    }
1180 1181 1182 1183

    ent->hash = hash;
    ent->next = *bucket;
    *bucket = ent;
1184

1185 1186 1187
    return &ent->set;
}

1188 1189
static const FcCharSet *
FcCharSetFindFrozen (FcCharSetFreezer *freezer, const FcCharSet *orig)
1190
{
1191 1192
    FcCharSetOrigEnt    **bucket = &freezer->orig_hash_table[((uintptr_t) orig) & FC_CHAR_SET_HASH_SIZE];
    FcCharSetOrigEnt	*ent;
1193

1194 1195 1196 1197
    for (ent = *bucket; ent; ent = ent->next)
	if (ent->orig == orig)
	    return ent->frozen;
    return NULL;
1198 1199
}

1200
const FcCharSet *
1201
FcCharSetFreeze (FcCharSetFreezer *freezer, const FcCharSet *fcs)
1202
{
1203 1204 1205 1206
    FcCharSet	    *b;
    const FcCharSet *n = 0;
    FcCharLeaf	    *l;
    int		    i;
1207 1208 1209 1210 1211 1212

    b = FcCharSetCreate ();
    if (!b)
	goto bail0;
    for (i = 0; i < fcs->num; i++)
    {
1213
	l = FcCharSetFreezeLeaf (freezer, FcCharSetLeaf(fcs, i));
1214 1215
	if (!l)
	    goto bail1;
1216
	if (!FcCharSetInsertLeaf (b, FcCharSetNumbers(fcs)[i] << 8, l))
1217 1218
	    goto bail1;
    }
1219
    n = FcCharSetFreezeBase (freezer, b);
1220 1221 1222 1223 1224 1225 1226
    if (!FcCharSetFreezeOrig (freezer, fcs, n))
    {
	n = NULL;
	goto bail1;
    }
    freezer->charsets_seen++;
    freezer->leaves_seen += fcs->num;
1227
bail1:
1228
    if (b->num)
1229
	free (FcCharSetLeaves (b));
1230
    if (b->num)
1231
	free (FcCharSetNumbers (b));
1232 1233 1234 1235 1236
    free (b);
bail0:
    return n;
}

1237
FcCharSetFreezer *
1238
FcCharSetFreezerCreate (void)
Keith Packard's avatar
Keith Packard committed
1239
{
1240
    FcCharSetFreezer	*freezer;
Keith Packard's avatar
Keith Packard committed
1241

1242 1243
    freezer = calloc (1, sizeof (FcCharSetFreezer));
    return freezer;
Keith Packard's avatar
Keith Packard committed
1244 1245
}

1246 1247
void
FcCharSetFreezerDestroy (FcCharSetFreezer *freezer)
Keith Packard's avatar
Keith Packard committed
1248
{
1249
    int i;
Keith Packard's avatar
Keith Packard committed
1250

1251
    if (FcDebug() & FC_DBG_CACHE)
Keith Packard's avatar
Keith Packard committed
1252
    {
1253 1254 1255
	printf ("\ncharsets %d -> %d leaves %d -> %d\n",
		freezer->charsets_seen, freezer->charsets_allocated,
		freezer->leaves_seen, freezer->leaves_allocated);
Keith Packard's avatar
Keith Packard committed
1256
    }
1257
    for (i = 0; i < FC_CHAR_SET_HASH_SIZE; i++)
Keith Packard's avatar
Keith Packard committed
1258
    {
1259 1260
	FcCharSetEnt	*ent, *next;
	for (ent = freezer->set_hash_table[i]; ent; ent = next)
Keith Packard's avatar
Keith Packard committed
1261
	{
1262 1263 1264 1265
	    next = ent->next;
	    free (ent);
	}
    }
Keith Packard's avatar
Keith Packard committed
1266

1267 1268 1269 1270 1271 1272 1273
    for (i = 0; i < FC_CHAR_SET_HASH_SIZE; i++)
    {
	FcCharSetOrigEnt	*ent, *next;
	for (ent = freezer->orig_hash_table[i]; ent; ent = next)
	{
	    next = ent->next;
	    free (ent);
Keith Packard's avatar
Keith Packard committed
1274 1275
	}
    }
1276 1277 1278 1279 1280 1281

    for (i = 0; i < freezer->leaf_block_count; i++)
	free (freezer->leaf_blocks[i]);

    free (freezer->leaf_blocks);
    free (freezer);
Keith Packard's avatar
Keith Packard committed
1282
}
1283

1284 1285
FcBool
FcCharSetSerializeAlloc (FcSerialize *serialize, const FcCharSet *cs)
1286
{
1287 1288
    intptr_t	    *leaves;
    FcChar16	    *numbers;
1289
    int		    i;
1290

1291
    if (!FcRefIsConst (&cs->ref))
1292 1293 1294 1295 1296 1297 1298
    {
	if (!serialize->cs_freezer)
	{
	    serialize->cs_freezer = FcCharSetFreezerCreate ();
	    if (!serialize->cs_freezer)
		return FcFalse;
	}
1299 1300
	if (FcCharSetFindFrozen (serialize->cs_freezer, cs))
	    return FcTrue;
1301

1302 1303
        cs = FcCharSetFreeze (serialize->cs_freezer, cs);
    }
1304

1305 1306
    leaves = FcCharSetLeaves (cs);
    numbers = FcCharSetNumbers (cs);
1307

1308 1309 1310 1311 1312 1313 1314 1315 1316 1317
    if (!FcSerializeAlloc (serialize, cs, sizeof (FcCharSet)))
	return FcFalse;
    if (!FcSerializeAlloc (serialize, leaves, cs->num * sizeof (intptr_t)))
	return FcFalse;
    if (!FcSerializeAlloc (serialize, numbers, cs->num * sizeof (FcChar16)))
	return FcFalse;
    for (i = 0; i < cs->num; i++)
	if (!FcSerializeAlloc (serialize, FcCharSetLeaf(cs, i),
			       sizeof (FcCharLeaf)))
	    return FcFalse;
1318 1319
    return FcTrue;
}
1320

1321 1322
FcCharSet *
FcCharSetSerialize(FcSerialize *serialize, const FcCharSet *cs)
1323
{
1324
    FcCharSet	*cs_serialized;
1325 1326 1327 1328
    intptr_t	*leaves, *leaves_serialized;
    FcChar16	*numbers, *numbers_serialized;
    FcCharLeaf	*leaf, *leaf_serialized;
    int		i;
1329

1330
    if (!FcRefIsConst (&cs->ref) && serialize->cs_freezer)
1331 1332 1333 1334 1335
    {
	cs = FcCharSetFindFrozen (serialize->cs_freezer, cs);
	if (!cs)
	    return NULL;
    }
1336
		
1337
    cs_serialized = FcSerializePtr (serialize, cs);
1338 1339
    if (!cs_serialized)
	return NULL;
1340

1341
    FcRefSetConst (&cs_serialized->ref);
1342
    cs_serialized->num = cs->num;
1343

1344
    if (cs->num)
1345
    {
1346 1347 1348 1349
	leaves = FcCharSetLeaves (cs);
	leaves_serialized = FcSerializePtr (serialize, leaves);
	if (!leaves_serialized)
	    return NULL;