fccharset.c 32.1 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 819
/*
 * ASCII representation of charsets.
820
 *
Keith Packard's avatar
Keith Packard committed
821 822 823 824 825 826 827
 * Each leaf is represented as 9 32-bit values, the code of the first character followed
 * by 8 32 bit values for the leaf itself.  Each value is encoded as 5 ASCII characters,
 * only 85 different values are used to avoid control characters as well as the other
 * characters used to encode font names.  85**5 > 2^32 so things work out, but
 * it's not exactly human readable output.  As a special case, 0 is encoded as a space
 */

828
static const unsigned char	charToValue[256] = {
829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860
    /*     "" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /*   "\b" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\020" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\030" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /*    " " */ 0xff,  0x00,  0xff,  0x01,  0x02,  0x03,  0x04,  0xff,
    /*    "(" */ 0x05,  0x06,  0x07,  0x08,  0xff,  0xff,  0x09,  0x0a,
    /*    "0" */ 0x0b,  0x0c,  0x0d,  0x0e,  0x0f,  0x10,  0x11,  0x12,
    /*    "8" */ 0x13,  0x14,  0xff,  0x15,  0x16,  0xff,  0x17,  0x18,
    /*    "@" */ 0x19,  0x1a,  0x1b,  0x1c,  0x1d,  0x1e,  0x1f,  0x20,
    /*    "H" */ 0x21,  0x22,  0x23,  0x24,  0x25,  0x26,  0x27,  0x28,
    /*    "P" */ 0x29,  0x2a,  0x2b,  0x2c,  0x2d,  0x2e,  0x2f,  0x30,
    /*    "X" */ 0x31,  0x32,  0x33,  0x34,  0xff,  0x35,  0x36,  0xff,
    /*    "`" */ 0xff,  0x37,  0x38,  0x39,  0x3a,  0x3b,  0x3c,  0x3d,
    /*    "h" */ 0x3e,  0x3f,  0x40,  0x41,  0x42,  0x43,  0x44,  0x45,
    /*    "p" */ 0x46,  0x47,  0x48,  0x49,  0x4a,  0x4b,  0x4c,  0x4d,
    /*    "x" */ 0x4e,  0x4f,  0x50,  0x51,  0x52,  0x53,  0x54,  0xff,
    /* "\200" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\210" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\220" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\230" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\240" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\250" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\260" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\270" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\300" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\310" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\320" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\330" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\340" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\350" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\360" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
    /* "\370" */ 0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,  0xff,
Keith Packard's avatar
Keith Packard committed
861 862
};

863
static const FcChar8 valueToChar[0x55] = {
Keith Packard's avatar
Keith Packard committed
864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881
    /* 0x00 */ '!', '#', '$', '%', '&', '(', ')', '*',
    /* 0x08 */ '+', '.', '/', '0', '1', '2', '3', '4',
    /* 0x10 */ '5', '6', '7', '8', '9', ';', '<', '>',
    /* 0x18 */ '?', '@', 'A', 'B', 'C', 'D', 'E', 'F',
    /* 0x20 */ 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N',
    /* 0x28 */ 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V',
    /* 0x30 */ 'W', 'X', 'Y', 'Z', '[', ']', '^', 'a',
    /* 0x38 */ 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
    /* 0x40 */ 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q',
    /* 0x48 */ 'r', 's', 't', 'u', 'v', 'w', 'x', 'y',
    /* 0x50 */ 'z', '{', '|', '}', '~',
};

static FcChar8 *
FcCharSetParseValue (FcChar8 *string, FcChar32 *value)
{
    int		i;
    FcChar32	v;
882
    FcChar32	c;
883

Keith Packard's avatar
Keith Packard committed
884 885 886 887 888 889 890 891 892 893
    if (*string == ' ')
    {
	v = 0;
	string++;
    }
    else
    {
	v = 0;
	for (i = 0; i < 5; i++)
	{
894
	    if (!(c = (FcChar32) (unsigned char) *string++))
Keith Packard's avatar
Keith Packard committed
895 896 897 898 899 900 901 902 903 904 905 906
		return 0;
	    c = charToValue[c];
	    if (c == 0xff)
		return 0;
	    v = v * 85 + c;
	}
    }
    *value = v;
    return string;
}

static FcBool
907
FcCharSetUnparseValue (FcStrBuf *buf, FcChar32 value)
Keith Packard's avatar
Keith Packard committed
908 909 910 911
{
    int	    i;
    if (value == 0)
    {
912
	return FcStrBufChar (buf, ' ');
Keith Packard's avatar
Keith Packard committed
913 914 915 916 917 918 919 920 921 922 923 924
    }
    else
    {
	FcChar8	string[6];
	FcChar8	*s = string + 5;
	string[5] = '\0';
	for (i = 0; i < 5; i++)
	{
	    *--s = valueToChar[value % 85];
	    value /= 85;
	}
	for (i = 0; i < 5; i++)
925
	    if (!FcStrBufChar (buf, *s++))
Keith Packard's avatar
Keith Packard committed
926 927 928 929 930
		return FcFalse;
    }
    return FcTrue;
}

931 932 933 934 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 986 987 988 989 990 991 992 993 994 995 996 997 998 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 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050
FcCharSet *
FcNameParseCharSet (FcChar8 *string)
{
    FcCharSet	*c;
    FcChar32	ucs4;
    FcCharLeaf	*leaf;
    FcCharLeaf	temp;
    FcChar32	bits;
    int		i;

    c = FcCharSetCreate ();
    if (!c)
	goto bail0;
    while (*string)
    {
	string = FcCharSetParseValue (string, &ucs4);
	if (!string)
	    goto bail1;
	bits = 0;
	for (i = 0; i < 256/32; i++)
	{
	    string = FcCharSetParseValue (string, &temp.map[i]);
	    if (!string)
		goto bail1;
	    bits |= temp.map[i];
	}
	if (bits)
	{
	    leaf = malloc (sizeof (FcCharLeaf));
	    if (!leaf)
		goto bail1;
	    *leaf = temp;
	    if (!FcCharSetInsertLeaf (c, ucs4, leaf))
		goto bail1;
	}
    }
    return c;
bail1:
    if (c->num)
    {
	free (FcCharSetLeaves (c));
    }
    if (c->num)
    {
	free (FcCharSetNumbers (c));
    }
    free (c);
bail0:
    return NULL;
}

FcBool
FcNameUnparseCharSet (FcStrBuf *buf, const FcCharSet *c)
{
    FcCharSetIter   ci;
    int		    i;
#ifdef CHECK
    int		    len = buf->len;
#endif

    for (FcCharSetIterStart (c, &ci);
	 ci.leaf;
	 FcCharSetIterNext (c, &ci))
    {
	if (!FcCharSetUnparseValue (buf, ci.ucs4))
	    return FcFalse;
	for (i = 0; i < 256/32; i++)
	    if (!FcCharSetUnparseValue (buf, ci.leaf->map[i]))
		return FcFalse;
    }
#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
1051

1052 1053 1054
    return FcTrue;
}

1055 1056 1057 1058 1059 1060 1061 1062 1063
typedef struct _FcCharLeafEnt FcCharLeafEnt;

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

#define FC_CHAR_LEAF_BLOCK	(4096 / sizeof (FcCharLeafEnt))
1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096
#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;
};
1097 1098

static FcCharLeafEnt *
1099
FcCharLeafEntCreate (FcCharSetFreezer *freezer)
1100
{
1101
    if (!freezer->leaf_remain)
1102
    {
1103 1104
	FcCharLeafEnt **newBlocks;

1105 1106
	freezer->leaf_block_count++;
	newBlocks = realloc (freezer->leaf_blocks, freezer->leaf_block_count * sizeof (FcCharLeafEnt *));
1107 1108
	if (!newBlocks)
	    return 0;
1109 1110 1111
	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)
1112
	    return 0;
1113
	freezer->leaf_remain = FC_CHAR_LEAF_BLOCK;
1114
    }
1115 1116 1117
    freezer->leaf_remain--;
    freezer->leaves_allocated++;
    return freezer->current_block++;
1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131
}

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 *
1132
FcCharSetFreezeLeaf (FcCharSetFreezer *freezer, FcCharLeaf *leaf)
1133 1134
{
    FcChar32			hash = FcCharLeafHash (leaf);
1135
    FcCharLeafEnt		**bucket = &freezer->leaf_hash_table[hash % FC_CHAR_LEAF_HASH_SIZE];
1136
    FcCharLeafEnt		*ent;
1137

1138 1139 1140 1141 1142 1143
    for (ent = *bucket; ent; ent = ent->next)
    {
	if (ent->hash == hash && !memcmp (&ent->leaf, leaf, sizeof (FcCharLeaf)))
	    return &ent->leaf;
    }

1144
    ent = FcCharLeafEntCreate(freezer);
1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160
    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 */
1161 1162
    for (i = 0; i < fcs->num; i++)
	hash = ((hash << 1) | (hash >> 31)) ^ FcCharLeafHash (FcCharSetLeaf(fcs,i));
1163 1164
    /* hash in numbers */
    for (i = 0; i < fcs->num; i++)
1165
	hash = ((hash << 1) | (hash >> 31)) ^ *FcCharSetNumbers(fcs);
1166 1167 1168
    return hash;
}

1169 1170 1171 1172 1173
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;
1174

1175 1176 1177 1178 1179 1180 1181 1182 1183
    ent = malloc (sizeof (FcCharSetOrigEnt));
    if (!ent)
	return FcFalse;
    ent->orig = orig;
    ent->frozen = frozen;
    ent->next = *bucket;
    *bucket = ent;
    return FcTrue;
}
1184

1185
static FcCharSet *
1186
FcCharSetFreezeBase (FcCharSetFreezer *freezer, FcCharSet *fcs)
1187 1188
{
    FcChar32		hash = FcCharSetHash (fcs);
1189
    FcCharSetEnt	**bucket = &freezer->set_hash_table[hash % FC_CHAR_SET_HASH_SIZE];
1190
    FcCharSetEnt	*ent;
1191
    int			size;
1192
    int			i;
1193 1194 1195 1196 1197

    for (ent = *bucket; ent; ent = ent->next)
    {
	if (ent->hash == hash &&
	    ent->set.num == fcs->num &&
1198
	    !memcmp (FcCharSetNumbers(&ent->set),
1199
		     FcCharSetNumbers(fcs),
1200 1201
		     fcs->num * sizeof (FcChar16)))
	{
1202 1203 1204 1205
	    FcBool ok = FcTrue;
	    int i;

	    for (i = 0; i < fcs->num; i++)
1206
		if (FcCharSetLeaf(&ent->set, i) != FcCharSetLeaf(fcs, i))
1207 1208 1209
		    ok = FcFalse;
	    if (ok)
		return &ent->set;
1210 1211 1212
	}
    }

1213 1214 1215 1216
    size = (sizeof (FcCharSetEnt) +
	    fcs->num * sizeof (FcCharLeaf *) +
	    fcs->num * sizeof (FcChar16));
    ent = malloc (size);
1217 1218
    if (!ent)
	return 0;
1219

1220
    freezer->charsets_allocated++;
1221

1222
    FcRefSetConst (&ent->set.ref);
1223
    ent->set.num = fcs->num;
1224
    if (fcs->num)
1225
    {
1226 1227 1228 1229 1230
	intptr_t    *ent_leaves;

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

1232 1233 1234 1235
	ent_leaves = FcCharSetLeaves (&ent->set);
	for (i = 0; i < fcs->num; i++)
	    ent_leaves[i] = FcPtrToOffset (ent_leaves,
					   FcCharSetLeaf (fcs, i));
1236 1237
	memcpy (FcCharSetNumbers (&ent->set),
		FcCharSetNumbers (fcs),
1238
		fcs->num * sizeof (FcChar16));
1239 1240 1241
    }
    else
    {
1242 1243
	ent->set.leaves_offset = 0;
	ent->set.numbers_offset = 0;
1244
    }
1245 1246 1247 1248

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

1250 1251 1252
    return &ent->set;
}

1253 1254
static const FcCharSet *
FcCharSetFindFrozen (FcCharSetFreezer *freezer, const FcCharSet *orig)
1255
{
1256 1257
    FcCharSetOrigEnt    **bucket = &freezer->orig_hash_table[((uintptr_t) orig) & FC_CHAR_SET_HASH_SIZE];
    FcCharSetOrigEnt	*ent;
1258

1259 1260 1261 1262
    for (ent = *bucket; ent; ent = ent->next)
	if (ent->orig == orig)
	    return ent->frozen;
    return NULL;
1263 1264
}

1265
const FcCharSet *
1266
FcCharSetFreeze (FcCharSetFreezer *freezer, const FcCharSet *fcs)
1267
{
1268 1269 1270 1271
    FcCharSet	    *b;
    const FcCharSet *n = 0;
    FcCharLeaf	    *l;
    int		    i;
1272 1273 1274 1275 1276 1277

    b = FcCharSetCreate ();
    if (!b)
	goto bail0;
    for (i = 0; i < fcs->num; i++)
    {
1278
	l = FcCharSetFreezeLeaf (freezer, FcCharSetLeaf(fcs, i));
1279 1280
	if (!l)
	    goto bail1;
1281
	if (!FcCharSetInsertLeaf (b, FcCharSetNumbers(fcs)[i] << 8, l))
1282 1283
	    goto bail1;
    }
1284
    n = FcCharSetFreezeBase (freezer, b);
1285 1286 1287 1288 1289 1290 1291
    if (!FcCharSetFreezeOrig (freezer, fcs, n))
    {
	n = NULL;
	goto bail1;
    }
    freezer->charsets_seen++;
    freezer->leaves_seen += fcs->num;
1292
bail1:
1293
    if (b->num)
1294
	free (FcCharSetLeaves (b));
1295
    if (b->num)
1296
	free (FcCharSetNumbers (b));
1297 1298 1299 1300 1301
    free (b);
bail0:
    return n;
}

1302
FcCharSetFreezer *
1303
FcCharSetFreezerCreate (void)
Keith Packard's avatar
Keith Packard committed
1304
{
1305
    FcCharSetFreezer	*freezer;
Keith Packard's avatar
Keith Packard committed
1306

1307 1308
    freezer = calloc (1, sizeof (FcCharSetFreezer));
    return freezer;
Keith Packard's avatar
Keith Packard committed
1309 1310
}

1311 1312
void
FcCharSetFreezerDestroy (FcCharSetFreezer *freezer)
Keith Packard's avatar
Keith Packard committed
1313
{
1314
    int i;
Keith Packard's avatar
Keith Packard committed
1315

1316
    if (FcDebug() & FC_DBG_CACHE)
Keith Packard's avatar
Keith Packard committed
1317
    {
1318 1319 1320
	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
1321
    }
1322
    for (i = 0; i < FC_CHAR_SET_HASH_SIZE; i++)
Keith Packard's avatar
Keith Packard committed
1323
    {
1324 1325
	FcCharSetEnt	*ent, *next;
	for (ent = freezer->set_hash_table[i]; ent; ent = next)
Keith Packard's avatar
Keith Packard committed
1326
	{
1327 1328 1329 1330
	    next = ent->next;
	    free (ent);
	}
    }
Keith Packard's avatar
Keith Packard committed
1331

1332 1333 1334 1335 1336 1337 1338
    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
1339 1340
	}
    }
1341 1342 1343 1344 1345 1346

    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
1347
}
1348

1349 1350
FcBool
FcCharSetSerializeAlloc (FcSerialize *serialize, const FcCharSet *cs)
1351
{
1352 1353
    intptr_t	    *leaves;
    FcChar16	    *numbers;
1354
    int		    i;
1355

1356
    if (!FcRefIsConst (&cs->ref))
1357 1358 1359 1360 1361 1362 1363
    {
	if (!serialize->cs_freezer)
	{
	    serialize->cs_freezer = FcCharSetFreezerCreate ();
	    if (!serialize->cs_freezer)
		return FcFalse;
	}
1364 1365
	if (FcCharSetFindFrozen (serialize->cs_freezer, cs))
	    return FcTrue;
1366

1367 1368
        cs = FcCharSetFreeze (serialize->cs_freezer, cs);
    }
1369

1370 1371
    leaves = FcCharSetLeaves (cs);
    numbers = FcCharSetNumbers (cs);
1372

1373 1374 1375 1376 1377 1378 1379 1380 1381 1382
    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;
1383 1384
    return FcTrue;
}
1385

1386 1387
FcCharSet *
FcCharSetSerialize(FcSerialize *serialize, const FcCharSet *cs)
1388
{
1389
    FcCharSet	*cs_serialized;
1390 1391 1392 1393
    intptr_t	*leaves, *leaves_serialized;
    FcChar16	*numbers, *numbers_serialized;
    FcCharLeaf	*leaf, *leaf_serialized;
    int		i;