fccharset.c 32.6 KB
Newer Older
Keith Packard's avatar
Keith Packard committed
1
/*
Keith Packard's avatar
Keith Packard committed
2
 * $RCSId: xc/lib/fontconfig/src/fccharset.c,v 1.18 2002/08/22 07:36:44 keithp Exp $
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 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
 *
 * 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
 * documentation, and that the name of Keith Packard not be used in
 * advertising or publicity pertaining to distribution of the software without
 * specific, written prior permission.  Keith Packard makes no
 * representations about the suitability of this software for any purpose.  It
 * is provided "as is" without express or implied warranty.
 *
 * KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
 * EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
 * 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 <stdlib.h>
#include "fcint.h"

/* #define CHECK */

30
/* #define CHATTY */
Keith Packard's avatar
Keith Packard committed
31

32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
static FcCharSet * charsets = 0;
static FcChar16 * numbers = 0;
static int charset_ptr, charset_count;
static int charset_numbers_ptr, charset_numbers_count;
static FcCharLeaf * leaves = 0;
static int charset_leaf_ptr, charset_leaf_count;
static int * leaf_idx = 0;
static int charset_leaf_idx_ptr, charset_leaf_idx_count;

void
FcCharSetClearStatic()
{
    charsets = 0;
    numbers = 0;
    charset_ptr = 0; charset_count = 0;
    leaves = 0;
    charset_leaf_ptr = 0; charset_leaf_count = 0;
    leaf_idx = 0;
    charset_leaf_idx_ptr = 0; charset_leaf_idx_count = 0;
}

Keith Packard's avatar
Keith Packard committed
53 54 55 56 57 58 59 60 61 62
FcCharSet *
FcCharSetCreate (void)
{
    FcCharSet	*fcs;

    fcs = (FcCharSet *) malloc (sizeof (FcCharSet));
    if (!fcs)
	return 0;
    FcMemAlloc (FC_MEM_CHARSET, sizeof (FcCharSet));
    fcs->ref = 1;
63
    fcs->num = 0;
64 65 66
    fcs->storage = FcStorageDynamic;
    fcs->u.dyn.leaves = 0;
    fcs->u.dyn.numbers = 0;
Keith Packard's avatar
Keith Packard committed
67 68 69 70 71 72 73 74 75 76 77 78
    return fcs;
}

FcCharSet *
FcCharSetNew (void);
    
FcCharSet *
FcCharSetNew (void)
{
    return FcCharSetCreate ();
}

79 80 81 82 83 84 85 86 87 88 89
void
FcCharSetPtrDestroy (FcCharSetPtr fcs)
{
    FcCharSetDestroy (FcCharSetPtrU(fcs));
    if (fcs.storage == FcStorageDynamic && 
	FcCharSetPtrU(fcs)->ref != FC_REF_CONSTANT)
    {
	free (fcs.u.dyn);
	FcMemFree (FC_MEM_CHARSET, sizeof(FcCharSet));
    }
}
Keith Packard's avatar
Keith Packard committed
90 91 92 93

void
FcCharSetDestroy (FcCharSet *fcs)
{
94 95 96 97 98
    int i;
    if (fcs->ref == FC_REF_CONSTANT)
	return;
    if (--fcs->ref > 0)
	return;
99
    if (fcs->storage == FcStorageDynamic)
100
    {
101 102 103 104 105 106 107 108 109 110 111 112 113 114 115
	for (i = 0; i < fcs->num; i++)
	{
	    FcMemFree (FC_MEM_CHARLEAF, sizeof (FcCharLeaf));
	    free (fcs->u.dyn.leaves[i]);
	}
	if (fcs->u.dyn.leaves)
	{
	    FcMemFree (FC_MEM_CHARSET, fcs->num * sizeof (FcCharLeaf *));
	    free (fcs->u.dyn.leaves);
	}
	if (fcs->u.dyn.numbers)
	{
	    FcMemFree (FC_MEM_CHARSET, fcs->num * sizeof (FcChar16));
	    free (fcs->u.dyn.numbers);
	}
116 117 118
    }
    FcMemFree (FC_MEM_CHARSET, sizeof (FcCharSet));
    free (fcs);
Keith Packard's avatar
Keith Packard committed
119 120 121
}

/*
122 123 124
 * 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
Keith Packard's avatar
Keith Packard committed
125 126
 */

127 128 129
static int
FcCharSetFindLeafPos (const FcCharSet *fcs, FcChar32 ucs4)
{
130
    FcChar16		*numbers = FcCharSetGetNumbers(fcs);
131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148
    FcChar16		page;
    int			low = 0;
    int			high = fcs->num - 1;

    if (!numbers)
	return -1;
    ucs4 >>= 8;
    while (low <= high)
    {
	int mid = (low + high) >> 1;
	page = numbers[mid];
	if (page == ucs4)
	    return mid;
	if (page < ucs4)
	    low = mid + 1;
	else
	    high = mid - 1;
    }
149
    if (high < 0 || (high < fcs->num && numbers[high] < ucs4))
150 151 152 153
	high++;
    return -(high + 1);
}

Keith Packard's avatar
Keith Packard committed
154 155 156
static FcCharLeaf *
FcCharSetFindLeaf (const FcCharSet *fcs, FcChar32 ucs4)
{
157 158
    int	pos = FcCharSetFindLeafPos (fcs, ucs4);
    if (pos >= 0)
159
	return FcCharSetGetLeaf(fcs, pos);
160 161
    return 0;
}
Keith Packard's avatar
Keith Packard committed
162

163 164 165 166 167 168 169 170 171 172 173 174
static FcBool
FcCharSetPutLeaf (FcCharSet	*fcs, 
		  FcChar32	ucs4,
		  FcCharLeaf	*leaf, 
		  int		pos)
{
    FcCharLeaf	**leaves;
    FcChar16	*numbers;

    ucs4 >>= 8;
    if (ucs4 >= 0x10000)
	return FcFalse;
175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193
    if (fcs->storage == FcStorageStatic)
    {
	int i;

	leaves = malloc ((fcs->num + 1) * sizeof (FcCharLeaf *));
	if (!leaves)
	    return FcFalse;
	FcMemAlloc (FC_MEM_CHARSET, (fcs->num + 1) * sizeof (FcCharLeaf *));
	numbers = malloc ((fcs->num + 1) * sizeof (FcChar16));
	if (!numbers)
	    return FcFalse;
	FcMemAlloc (FC_MEM_CHARSET, (fcs->num + 1) * sizeof (FcChar16));

	for (i = 0; i < fcs->num; i++)
	    leaves[i] = FcCharSetGetLeaf(fcs, i);
	memcpy (numbers, FcCharSetGetNumbers(fcs), 
		fcs->num * sizeof (FcChar16));
	fcs->storage = FcStorageDynamic;
    }
194
    else
195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216
    {
	if (!fcs->u.dyn.leaves)
	    leaves = malloc (sizeof (FcCharLeaf *));
	else
	    leaves = realloc (fcs->u.dyn.leaves, (fcs->num + 1) * sizeof (FcCharLeaf *));
	if (!leaves)
	    return FcFalse;
	if (fcs->num)
	    FcMemFree (FC_MEM_CHARSET, fcs->num * sizeof (FcCharLeaf *));
	FcMemAlloc (FC_MEM_CHARSET, (fcs->num + 1) * sizeof (FcCharLeaf *));
	fcs->u.dyn.leaves = leaves;
	if (!fcs->u.dyn.numbers)
	    numbers = malloc (sizeof (FcChar16));
	else
	    numbers = realloc (fcs->u.dyn.numbers, (fcs->num + 1) * sizeof (FcChar16));
	if (!numbers)
	    return FcFalse;
	if (fcs->num)
	    FcMemFree (FC_MEM_CHARSET, fcs->num * sizeof (FcChar16));
	FcMemAlloc (FC_MEM_CHARSET, (fcs->num + 1) * sizeof (FcChar16));
	fcs->u.dyn.numbers = numbers;
    }
217
    
218
    memmove (fcs->u.dyn.leaves + pos + 1, fcs->u.dyn.leaves + pos, 
219
	     (fcs->num - pos) * sizeof (FcCharLeaf *));
220
    memmove (fcs->u.dyn.numbers + pos + 1, fcs->u.dyn.numbers + pos,
221
	     (fcs->num - pos) * sizeof (FcChar16));
222 223
    fcs->u.dyn.numbers[pos] = (FcChar16) ucs4;
    fcs->u.dyn.leaves[pos] = leaf;
224 225
    fcs->num++;
    return FcTrue;
Keith Packard's avatar
Keith Packard committed
226 227 228 229 230 231 232
}

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

233
FcCharLeaf *
Keith Packard's avatar
Keith Packard committed
234 235
FcCharSetFindLeafCreate (FcCharSet *fcs, FcChar32 ucs4)
{
236 237
    int			pos;
    FcCharLeaf		*leaf;
Keith Packard's avatar
Keith Packard committed
238

239 240
    pos = FcCharSetFindLeafPos (fcs, ucs4);
    if (pos >= 0)
241
	return FcCharSetGetLeaf(fcs, pos);
242 243 244 245 246 247 248
    
    leaf = calloc (1, sizeof (FcCharLeaf));
    if (!leaf)
	return 0;
    
    pos = -pos - 1;
    if (!FcCharSetPutLeaf (fcs, ucs4, leaf, pos))
Keith Packard's avatar
Keith Packard committed
249
    {
250 251
	free (leaf);
	return 0;
Keith Packard's avatar
Keith Packard committed
252
    }
253
    FcMemAlloc (FC_MEM_CHARLEAF, sizeof (FcCharLeaf));
254 255 256 257 258 259 260 261 262 263
    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
264
    {
265
	FcMemFree (FC_MEM_CHARLEAF, sizeof (FcCharLeaf));
266 267 268 269 270 271 272 273 274
	if (fcs->storage == FcStorageDynamic)
	{
	    free (fcs->u.dyn.leaves[pos]);
	    fcs->u.dyn.leaves[pos] = leaf;
	}
	else
	{
	    leaves[leaf_idx[fcs->u.stat.leafidx_offset]+pos] = *leaf;
	}
275
	return FcTrue;
Keith Packard's avatar
Keith Packard committed
276
    }
277 278
    pos = -pos - 1;
    return FcCharSetPutLeaf (fcs, ucs4, leaf, pos);
Keith Packard's avatar
Keith Packard committed
279 280 281 282 283 284 285 286
}

FcBool
FcCharSetAddChar (FcCharSet *fcs, FcChar32 ucs4)
{
    FcCharLeaf	*leaf;
    FcChar32	*b;
    
287
    if (fcs->ref == FC_REF_CONSTANT)
Keith Packard's avatar
Keith Packard committed
288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303
	return FcFalse;
    leaf = FcCharSetFindLeafCreate (fcs, ucs4);
    if (!leaf)
	return FcFalse;
    b = &leaf->map[(ucs4 & 0xff) >> 5];
    *b |= (1 << (ucs4 & 0x1f));
    return FcTrue;
}

/*
 * An iterator for the leaves of a charset
 */

typedef struct _fcCharSetIter {
    FcCharLeaf	    *leaf;
    FcChar32	    ucs4;
304
    int		    pos;
Keith Packard's avatar
Keith Packard committed
305 306 307
} FcCharSetIter;

/*
308
 * Set iter->leaf to the leaf containing iter->ucs4 or higher
Keith Packard's avatar
Keith Packard committed
309 310 311 312 313
 */

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

316
    if (pos < 0)
317
    {
318 319
	pos = -pos - 1;
	if (pos == fcs->num)
320
	{
321 322 323
	    iter->ucs4 = ~0;
	    iter->leaf = 0;
	    return;
324
	}
325
        iter->ucs4 = (FcChar32) FcCharSetGetNumbers(fcs)[pos] << 8;
326
    }
327
    iter->leaf = FcCharSetGetLeaf(fcs, pos);
328 329 330
    iter->pos = pos;
#ifdef CHATTY
    printf ("set %08x: %08x\n", iter->ucs4, (FcChar32) iter->leaf);
331
#endif
Keith Packard's avatar
Keith Packard committed
332 333 334 335 336
}

static void
FcCharSetIterNext (const FcCharSet *fcs, FcCharSetIter *iter)
{
337 338
    int	pos = iter->pos + 1;
    if (pos >= fcs->num)
339 340 341 342
    {
	iter->ucs4 = ~0;
	iter->leaf = 0;
    }
343
    else
344
    {
345 346
	iter->ucs4 = (FcChar32) FcCharSetGetNumbers(fcs)[pos] << 8;
	iter->leaf = FcCharSetGetLeaf(fcs, pos);
347
	iter->pos = pos;
348 349 350
    }
}

351
#ifdef CHATTY
352
static void
353
FcCharSetDump (const FcCharSet *fcs)
354
{
355 356 357 358
    int		pos;

    printf ("fcs %08x:\n", (FcChar32) fcs);
    for (pos = 0; pos < fcs->num; pos++)
359
    {
360 361 362 363
	FcCharLeaf	*leaf = fcs->leaves[pos];
	FcChar32	ucs4 = (FcChar32) fcs->numbers[pos] << 8;
	
	printf ("    %08x: %08x\n", ucs4, (FcChar32) leaf);
364
    }
Keith Packard's avatar
Keith Packard committed
365
}
366
#endif
Keith Packard's avatar
Keith Packard committed
367 368 369 370

static void
FcCharSetIterStart (const FcCharSet *fcs, FcCharSetIter *iter)
{
371 372
#ifdef CHATTY
    FcCharSetDump (fcs);
373
#endif
Keith Packard's avatar
Keith Packard committed
374 375 376 377 378 379 380
    iter->ucs4 = 0;
    FcCharSetIterSet (fcs, iter);
}

FcCharSet *
FcCharSetCopy (FcCharSet *src)
{
381 382
    if (src->ref != FC_REF_CONSTANT)
	src->ref++;
Keith Packard's avatar
Keith Packard committed
383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 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
    return src;
}

FcBool
FcCharSetEqual (const FcCharSet *a, const FcCharSet *b)
{
    FcCharSetIter   ai, bi;
    int		    i;
    
    if (a == b)
	return FcTrue;
    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;

    fcs = FcCharSetCreate ();
    if (!fcs)
	goto bail0;
    FcCharSetIterStart (a, &ai);
    FcCharSetIterStart (b, &bi);
436
    while ((ai.leaf || (bonly && bi.leaf)) && (bi.leaf || (aonly && ai.leaf)))
Keith Packard's avatar
Keith Packard committed
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 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647
    {
	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);
}

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)
{
    FcCharLeaf	*leaf = FcCharSetFindLeaf (fcs, ucs4);
    if (!leaf)
	return FcFalse;
    return (leaf->map[(ucs4 & 0xff) >> 5] & (1 << (ucs4 & 0x1f))) != 0;
}

static FcChar32
FcCharSetPopCount (FcChar32 c1)
{
    /* hackmem 169 */
    FcChar32	c2 = (c1 >> 1) & 033333333333;
    c2 = c1 - c2 - ((c2 >> 1) & 033333333333);
    return (((c2 + (c2 >> 3)) & 030707070707) % 077);
}

FcChar32
FcCharSetIntersectCount (const FcCharSet *a, const FcCharSet *b)
{
    FcCharSetIter   ai, bi;
    FcChar32	    count = 0;
    
    FcCharSetIterStart (a, &ai);
    FcCharSetIterStart (b, &bi);
    while (ai.leaf && bi.leaf)
    {
	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);
	}
    }
    return count;
}

FcChar32
FcCharSetCount (const FcCharSet *a)
{
    FcCharSetIter   ai;
    FcChar32	    count = 0;
    
    for (FcCharSetIterStart (a, &ai); ai.leaf; FcCharSetIterNext (a, &ai))
    {
	int		    i = 256/32;
	FcChar32	    *am = ai.leaf->map;

	while (i--)
	    count += FcCharSetPopCount (*am++);
    }
    return count;
}

FcChar32
FcCharSetSubtractCount (const FcCharSet *a, const FcCharSet *b)
{
    FcCharSetIter   ai, bi;
    FcChar32	    count = 0;
    
    FcCharSetIterStart (a, &ai);
    FcCharSetIterStart (b, &bi);
    while (ai.leaf)
    {
	if (ai.ucs4 <= bi.ucs4)
	{
	    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);
	}
	else if (bi.leaf)
	{
	    bi.ucs4 = ai.ucs4;
	    FcCharSetIterSet (b, &bi);
	}
    }
    return count;
}

648 649 650 651 652 653
/*
 * return FcTrue iff a is a subset of b
 */
FcBool
FcCharSetIsSubset (const FcCharSet *a, const FcCharSet *b)
{
654 655 656 657 658 659 660
    int		ai, bi;
    FcChar16	an, bn;
    
    if (a == b) return FcTrue;
    bi = 0;
    ai = 0;
    while (ai < a->num && bi < b->num)
661
    {
662 663
	an = FcCharSetGetNumbers(a)[ai];
	bn = FcCharSetGetNumbers(b)[bi];
664 665 666
	/*
	 * Check matching pages
	 */
667
	if (an == bn)
668
	{
669 670
	    FcChar32	*am = FcCharSetGetLeaf(a, ai)->map;
	    FcChar32	*bm = FcCharSetGetLeaf(b, bi)->map;
671 672
	    
	    if (am != bm)
673
	    {
674
		int	i = 256/32;
675 676 677
		/*
		 * Does am have any bits not in bm?
		 */
678 679 680
		while (i--)
		    if (*am++ & ~*bm++)
			return FcFalse;
681
	    }
682 683 684
	    ai++;
	    bi++;
	}
685 686 687
	/*
	 * Does a have any pages not in b?
	 */
688 689 690 691 692 693 694
	else if (an < bn)
	    return FcFalse;
	else
	{
	    int	    low = bi + 1;
	    int	    high = b->num - 1;

695 696 697
	    /*
	     * Search for page 'an' in 'b'
	     */
698
	    while (low <= high)
699
	    {
700
		int mid = (low + high) >> 1;
701
		bn = FcCharSetGetNumbers(b)[mid];
702 703 704
		if (bn == an)
		{
		    high = mid;
705
		    break;
706 707 708 709 710
		}
		if (bn < an)
		    low = mid + 1;
		else
		    high = mid - 1;
711
	    }
712
	    bi = high;
713
	    while (bi < b->num && FcCharSetGetNumbers(b)[bi] < an)
714
		bi++;
715 716
	}
    }
717 718 719
    /*
     * did we look at every page?
     */
720
    return ai >= a->num;
721 722
}

723 724 725 726 727
/*
 * These two functions efficiently walk the entire charmap for
 * other software (like pango) that want their own copy
 */

728
FcChar32
729 730 731
FcCharSetNextPage (const FcCharSet  *a, 
		   FcChar32	    map[FC_CHARSET_MAP_SIZE],
		   FcChar32	    *next)
732 733
{
    FcCharSetIter   ai;
734
    FcChar32	    page;
735

736
    ai.ucs4 = *next;
737 738
    FcCharSetIterSet (a, &ai);
    if (!ai.leaf)
739 740 741 742 743 744 745 746 747 748 749 750 751
	return FC_CHARSET_DONE;
    
    /*
     * 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;

752 753 754
    return page;
}

755 756 757 758 759 760 761 762 763
FcChar32
FcCharSetFirstPage (const FcCharSet *a, 
		    FcChar32	    map[FC_CHARSET_MAP_SIZE],
		    FcChar32	    *next)
{
    *next = 0;
    return FcCharSetNextPage (a, map, next);
}

764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790
/*
 * old coverage API, rather hard to use correctly
 */
FcChar32
FcCharSetCoverage (const FcCharSet *a, FcChar32 page, FcChar32 *result);
    
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
791 792 793 794 795 796 797 798 799 800
/*
 * ASCII representation of charsets.
 * 
 * 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
 */

801
static const unsigned char	charToValue[256] = {
Keith Packard's avatar
Keith Packard committed
802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835
    /*     "" */ 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, 
};

836
static const FcChar8 valueToChar[0x55] = {
Keith Packard's avatar
Keith Packard committed
837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854
    /* 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;
855
    FcChar32	c;
Keith Packard's avatar
Keith Packard committed
856 857 858 859 860 861 862 863 864 865 866
    
    if (*string == ' ')
    {
	v = 0;
	string++;
    }
    else
    {
	v = 0;
	for (i = 0; i < 5; i++)
	{
867
	    if (!(c = (FcChar32) (unsigned char) *string++))
Keith Packard's avatar
Keith Packard committed
868 869 870 871 872 873 874 875 876 877 878 879
		return 0;
	    c = charToValue[c];
	    if (c == 0xff)
		return 0;
	    v = v * 85 + c;
	}
    }
    *value = v;
    return string;
}

static FcBool
880
FcCharSetUnparseValue (FcStrBuf *buf, FcChar32 value)
Keith Packard's avatar
Keith Packard committed
881 882 883 884
{
    int	    i;
    if (value == 0)
    {
885
	return FcStrBufChar (buf, ' ');
Keith Packard's avatar
Keith Packard committed
886 887 888 889 890 891 892 893 894 895 896 897
    }
    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++)
898
	    if (!FcStrBufChar (buf, *s++))
Keith Packard's avatar
Keith Packard committed
899 900 901 902 903
		return FcFalse;
    }
    return FcTrue;
}

904 905 906 907 908 909 910 911 912
typedef struct _FcCharLeafEnt FcCharLeafEnt;

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

#define FC_CHAR_LEAF_BLOCK	(4096 / sizeof (FcCharLeafEnt))
913 914
static FcCharLeafEnt **FcCharLeafBlocks;
static int FcCharLeafBlockCount;
915 916 917 918 919 920 921 922 923

static FcCharLeafEnt *
FcCharLeafEntCreate (void)
{
    static FcCharLeafEnt    *block;
    static int		    remain;

    if (!remain)
    {
924 925 926 927 928 929 930 931
	FcCharLeafEnt **newBlocks;

	FcCharLeafBlockCount++;
	newBlocks = realloc (FcCharLeafBlocks, FcCharLeafBlockCount * sizeof (FcCharLeafEnt *));
	if (!newBlocks)
	    return 0;
	FcCharLeafBlocks = newBlocks;
	block = FcCharLeafBlocks[FcCharLeafBlockCount-1] = malloc (FC_CHAR_LEAF_BLOCK * sizeof (FcCharLeafEnt));
932 933
	if (!block)
	    return 0;
934
	FcMemAlloc (FC_MEM_CHARLEAF, FC_CHAR_LEAF_BLOCK * sizeof (FcCharLeafEnt));
935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956
	remain = FC_CHAR_LEAF_BLOCK;
    }
    remain--;
    return block++;
}

#define FC_CHAR_LEAF_HASH_SIZE	257

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 int	FcCharLeafTotal;
static int	FcCharLeafUsed;

957 958
static FcCharLeafEnt	*FcCharLeafHashTable[FC_CHAR_LEAF_HASH_SIZE];

959
static FcCharLeaf *
960
FcCharSetFreezeLeaf (FcCharLeaf *leaf)
961 962
{
    FcChar32			hash = FcCharLeafHash (leaf);
963
    FcCharLeafEnt		**bucket = &FcCharLeafHashTable[hash % FC_CHAR_LEAF_HASH_SIZE];
964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983
    FcCharLeafEnt		*ent;
    
    FcCharLeafTotal++;
    for (ent = *bucket; ent; ent = ent->next)
    {
	if (ent->hash == hash && !memcmp (&ent->leaf, leaf, sizeof (FcCharLeaf)))
	    return &ent->leaf;
    }

    ent = FcCharLeafEntCreate();
    if (!ent)
	return 0;
    FcCharLeafUsed++;
    ent->leaf = *leaf;
    ent->hash = hash;
    ent->next = *bucket;
    *bucket = ent;
    return &ent->leaf;
}

984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002
static void
FcCharSetThawAllLeaf (void)
{
    int i;

    for (i = 0; i < FC_CHAR_LEAF_HASH_SIZE; i++)
	FcCharLeafHashTable[i] = 0;

    FcCharLeafTotal = 0;
    FcCharLeafUsed = 0;

    for (i = 0; i < FcCharLeafBlockCount; i++)
	free (FcCharLeafBlocks[i]);

    free (FcCharLeafBlocks);
    FcCharLeafBlocks = 0;
    FcCharLeafBlockCount = 0;
}

1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020
typedef struct _FcCharSetEnt FcCharSetEnt;

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

#define FC_CHAR_SET_HASH_SIZE    67

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

    /* hash in leaves */
    for (i = 0; i < fcs->num * sizeof (FcCharLeaf *) / sizeof (FcChar32); i++)
1021
	hash = ((hash << 1) | (hash >> 31)) ^ (FcChar32)(FcCharSetGetLeaf(fcs, i)->map);
1022 1023
    /* hash in numbers */
    for (i = 0; i < fcs->num; i++)
1024
	hash = ((hash << 1) | (hash >> 31)) ^ *FcCharSetGetNumbers(fcs);
1025 1026 1027 1028 1029 1030 1031
    return hash;
}

static int	FcCharSetTotal;
static int	FcCharSetUsed;
static int	FcCharSetTotalEnts, FcCharSetUsedEnts;

1032 1033
static FcCharSetEnt	*FcCharSetHashTable[FC_CHAR_SET_HASH_SIZE];

1034
static FcCharSet *
1035
FcCharSetFreezeBase (FcCharSet *fcs)
1036 1037
{
    FcChar32		hash = FcCharSetHash (fcs);
1038
    FcCharSetEnt	**bucket = &FcCharSetHashTable[hash % FC_CHAR_SET_HASH_SIZE];
1039
    FcCharSetEnt	*ent;
1040
    int			size;
1041 1042 1043 1044 1045 1046 1047

    FcCharSetTotal++;
    FcCharSetTotalEnts += fcs->num;
    for (ent = *bucket; ent; ent = ent->next)
    {
	if (ent->hash == hash &&
	    ent->set.num == fcs->num &&
1048 1049
	    !memcmp (FcCharSetGetNumbers(&ent->set), 
		     FcCharSetGetNumbers(fcs),
1050 1051
		     fcs->num * sizeof (FcChar16)))
	{
1052 1053 1054 1055 1056 1057 1058 1059
	    FcBool ok = FcTrue;
	    int i;

	    for (i = 0; i < fcs->num; i++)
		if (FcCharSetGetLeaf(&ent->set, i) != FcCharSetGetLeaf(fcs, i))
		    ok = FcFalse;
	    if (ok)
		return &ent->set;
1060 1061 1062
	}
    }

1063 1064 1065 1066
    size = (sizeof (FcCharSetEnt) +
	    fcs->num * sizeof (FcCharLeaf *) +
	    fcs->num * sizeof (FcChar16));
    ent = malloc (size);
1067 1068
    if (!ent)
	return 0;
1069
    FcMemAlloc (FC_MEM_CHARSET, size);
1070 1071 1072
    FcCharSetUsed++;
    FcCharSetUsedEnts += fcs->num;
    
1073
    ent->set.ref = FC_REF_CONSTANT;
1074
    ent->set.num = fcs->num;
1075 1076
    ent->set.storage = fcs->storage;
    if (fcs->storage == FcStorageDynamic)
1077
    {
1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089
	if (fcs->num)
	{
	    ent->set.u.dyn.leaves = (FcCharLeaf **) (ent + 1);
	    ent->set.u.dyn.numbers = (FcChar16 *) (ent->set.u.dyn.leaves + fcs->num);
	    memcpy (ent->set.u.dyn.leaves, fcs->u.dyn.leaves, fcs->num * sizeof (FcCharLeaf *));
	    memcpy (ent->set.u.dyn.numbers, fcs->u.dyn.numbers, fcs->num * sizeof (FcChar16));
	}
	else
	{
	    ent->set.u.dyn.leaves = 0;
	    ent->set.u.dyn.numbers = 0;
	}
1090 1091 1092
    }
    else
    {
1093 1094
	ent->set.u.stat.leafidx_offset = fcs->u.stat.leafidx_offset;
	ent->set.u.stat.numbers_offset = fcs->u.stat.numbers_offset;
1095
    }
1096 1097 1098 1099 1100 1101 1102

    ent->hash = hash;
    ent->next = *bucket;
    *bucket = ent;
    return &ent->set;
}

1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126
void
FcCharSetThawAll (void)
{
    int i;
    FcCharSetEnt	*ent, *next;

    for (i = 0; i < FC_CHAR_SET_HASH_SIZE; i++)
    {
	for (ent = FcCharSetHashTable[i]; ent; ent = next)
	{
	    next = ent->next;
	    free (ent);
	}
	FcCharSetHashTable[i] = 0;
    }

    FcCharSetTotal = 0;
    FcCharSetTotalEnts = 0;
    FcCharSetUsed = 0;
    FcCharSetUsedEnts = 0;

    FcCharSetThawAllLeaf ();
}

1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139
FcCharSet *
FcCharSetFreeze (FcCharSet *fcs)
{
    FcCharSet	*b;
    FcCharSet	*n = 0;
    FcCharLeaf	*l;
    int		i;

    b = FcCharSetCreate ();
    if (!b)
	goto bail0;
    for (i = 0; i < fcs->num; i++)
    {
1140
	l = FcCharSetFreezeLeaf (FcCharSetGetLeaf(fcs, i));
1141 1142
	if (!l)
	    goto bail1;
1143
	if (!FcCharSetInsertLeaf (b, FcCharSetGetNumbers(fcs)[i] << 8, l))
1144 1145 1146 1147
	    goto bail1;
    }
    n = FcCharSetFreezeBase (b);
bail1:
1148
    if (b->storage == FcStorageDynamic)
1149
    {
1150 1151 1152 1153 1154 1155 1156 1157 1158 1159
	if (b->u.dyn.leaves)
	{
	    FcMemFree (FC_MEM_CHARSET, b->num * sizeof (FcCharLeaf *));
	    free (b->u.dyn.leaves);
	}
	if (b->u.dyn.numbers)
	{
	    FcMemFree (FC_MEM_CHARSET, b->num * sizeof (FcChar16));
	    free (b->u.dyn.numbers);
	}
1160 1161
    }
    FcMemFree (FC_MEM_CHARSET, sizeof (FcCharSet));
1162 1163 1164 1165 1166
    free (b);
bail0:
    return n;
}

Keith Packard's avatar
Keith Packard committed
1167 1168 1169
FcCharSet *
FcNameParseCharSet (FcChar8 *string)
{
1170
    FcCharSet	*c, *n = 0;
Keith Packard's avatar
Keith Packard committed
1171 1172
    FcChar32	ucs4;
    FcCharLeaf	*leaf;
1173 1174
    FcCharLeaf	temp;
    FcChar32	bits;
Keith Packard's avatar
Keith Packard committed
1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
    int		i;

    c = FcCharSetCreate ();
    if (!c)
	goto bail0;
    while (*string)
    {
	string = FcCharSetParseValue (string, &ucs4);
	if (!string)
	    goto bail1;
1185
	bits = 0;
Keith Packard's avatar
Keith Packard committed
1186 1187
	for (i = 0; i < 256/32; i++)
	{
1188
	    string = FcCharSetParseValue (string, &temp.map[i]);
Keith Packard's avatar
Keith Packard committed
1189 1190
	    if (!string)
		goto bail1;
1191 1192 1193 1194
	    bits |= temp.map[i];
	}
	if (bits)
	{
1195
	    leaf = FcCharSetFreezeLeaf (&temp);
1196 1197 1198 1199
	    if (!leaf)
		goto bail1;
	    if (!FcCharSetInsertLeaf (c, ucs4, leaf))
		goto bail1;
Keith Packard's avatar
Keith Packard committed
1200 1201
	}
    }
1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222
#ifdef CHATTY
    printf ("          %8s %8s %8s %8s\n", "total", "totalmem", "new", "newmem");
    printf ("Leaves:   %8d %8d %8d %8d\n",
	    FcCharLeafTotal, sizeof (FcCharLeaf) * FcCharLeafTotal,
	    FcCharLeafUsed, sizeof (FcCharLeaf) * FcCharLeafUsed);
    printf ("Charsets: %8d %8d %8d %8d\n",
	    FcCharSetTotal, sizeof (FcCharSet) * FcCharSetTotal,
	    FcCharSetUsed, sizeof (FcCharSet) * FcCharSetUsed);
    printf ("Tables:   %8d %8d %8d %8d\n",
	    FcCharSetTotalEnts, FcCharSetTotalEnts * (sizeof (FcCharLeaf *) + sizeof (FcChar16)),
	    FcCharSetUsedEnts, FcCharSetUsedEnts * (sizeof (FcCharLeaf *) + sizeof (FcChar16)));
    printf ("Total:    %8s %8d %8s %8d\n", 
	    "", 
	    sizeof (FcCharLeaf) * FcCharLeafTotal +
	    sizeof (FcCharSet) * FcCharSetTotal +
	    FcCharSetTotalEnts * (sizeof (FcCharLeaf *) + sizeof (FcChar16)),
	    "",
	    sizeof (FcCharLeaf) * FcCharLeafUsed +
	    sizeof (FcCharSet) * FcCharSetUsed +
	    FcCharSetUsedEnts * (sizeof (FcCharLeaf *) + sizeof (FcChar16)));
#endif
1223
    n = FcCharSetFreezeBase (c);
Keith Packard's avatar
Keith Packard committed
1224
bail1:
1225
    if (c->storage == FcStorageDynamic)
1226
    {
1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237
	if (c->u.dyn.leaves)
	{
	    FcMemFree (FC_MEM_CHARSET, c->num * sizeof (FcCharLeaf *));
	    free (c->u.dyn.leaves);
	}
	if (c->u.dyn.numbers)
	{
	    FcMemFree (FC_MEM_CHARSET, c->num * sizeof (FcChar16));
	    free (c->u.dyn.numbers);
	}
	FcMemFree (FC_MEM_CHARSET, sizeof (FcCharSet));
1238
    }
1239
    free (c);
Keith Packard's avatar
Keith Packard committed
1240
bail0:
1241
    return n;
Keith Packard's avatar
Keith Packard committed
1242 1243 1244
}

FcBool
1245
FcNameUnparseCharSet (FcStrBuf *buf, const FcCharSet *c)
Keith Packard's avatar
Keith Packard committed
1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269
{
    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 */
1270
	FcStrBufChar (buf, '\0');
Keith Packard's avatar
Keith Packard committed
1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315
	/* 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
    
    return FcTrue;
}
1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428


FcCharSet *
FcCharSetPtrU (FcCharSetPtr ci)
{
    switch (ci.storage)
    {
    case FcStorageDynamic:
	return ci.u.dyn;
    case FcStorageStatic:
	return &charsets[ci.u.stat];
    default:
	return 0;
    }
}

FcCharSetPtr
FcCharSetPtrCreateDynamic(FcCharSet *c)
{
    FcCharSetPtr new;

    new.storage = FcStorageDynamic;
    new.u.dyn = c;
    return new;
}

FcBool
FcCharSetPrepareSerialize(FcCharSet *c)
{
    /* note the redundancy */
    charset_count++;
    charset_leaf_idx_count++;
    charset_leaf_count += c->num;
    charset_numbers_count += c->num;
    return FcTrue;
}

FcCharSetPtr
FcCharSetSerialize(FcCharSet *c)
{
    int i;
    FcCharSetPtr newp;
    FcCharSet new;

    if (!charsets)
    {
	charsets = malloc(sizeof(FcCharSet) * charset_count);
	if (!charsets) goto bail;
	numbers = malloc(sizeof(FcChar16) * charset_numbers_count);
	if (!numbers) goto bail1;
	leaves = malloc(sizeof(FcCharLeaf) * charset_leaf_count);
	if (!leaves) goto bail2;
	leaf_idx = malloc(sizeof(int)*charset_leaf_idx_count);
	if (!leaf_idx) goto bail3;
    }

    new.ref = c->ref;
    new.storage = FcStorageStatic;
    new.u.stat.leafidx_offset = charset_leaf_ptr;
    new.u.stat.numbers_offset = charset_numbers_ptr;

    newp.storage = FcStorageStatic;
    newp.u.stat = charset_ptr;
    charsets[charset_ptr++] = new;

    leaf_idx[charset_leaf_idx_ptr++] = charset_leaf_ptr;
    for (i = 0; i < c->num; i++)
    {
	memcpy (&leaves[charset_leaf_ptr++], 
		c->u.dyn.leaves[i], sizeof(FcCharLeaf));
	numbers[charset_numbers_ptr++] = c->u.dyn.numbers[i];
    }

    return newp;

 bail3: 
    free (leaves);
 bail2:
    free (numbers);
 bail1:
    free (charsets);
 bail:
    return FcCharSetPtrCreateDynamic(0);
}

FcCharLeaf *
FcCharSetGetLeaf(const FcCharSet *c, int i)
{
    switch (c->storage)
    {
    case FcStorageDynamic:
	return c->u.dyn.leaves[i];
    case FcStorageStatic:
	return &leaves[leaf_idx[c->u.stat.leafidx_offset]+i];
    default:
	return 0;
    }
}

FcChar16 *
FcCharSetGetNumbers(const FcCharSet *c)
{
    switch (c->storage)
    {
    case FcStorageDynamic:
	return c->u.dyn.numbers;
    case FcStorageStatic:
	return &numbers[c->u.stat.numbers_offset];
    default:
	return 0;
    }
}