[fontconfig.git] / src / fclist.c

/*
 * $RCSId: xc/lib/fontconfig/src/fclist.c,v 1.11tsi Exp $
 *
 * Copyright © 2000 Keith Packard
 *
 * 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"

FcObjectSet *
FcObjectSetCreate (void)
{
    FcObjectSet    *os;

    os = (FcObjectSet *) malloc (sizeof (FcObjectSet));
    if (!os)
	return 0;
    FcMemAlloc (FC_MEM_OBJECTSET, sizeof (FcObjectSet));
    os->nobject = 0;
    os->sobject = 0;
    os->objects = 0;
    return os;
}

FcBool
FcObjectSetAdd (FcObjectSet *os, const char *object)
{
    int		s;
    const char	**objects;
    int		high, low, mid, c;
    
    if (os->nobject == os->sobject)
    {
	s = os->sobject + 4;
	if (os->objects)
	    objects = (const char **) realloc ((void *) os->objects,
					       s * sizeof (const char *));
	else
	    objects = (const char **) malloc (s * sizeof (const char *));
	if (!objects)
	    return FcFalse;
	if (os->sobject)
	    FcMemFree (FC_MEM_OBJECTPTR, os->sobject * sizeof (const char *));
	FcMemAlloc (FC_MEM_OBJECTPTR, s * sizeof (const char *));
	os->objects = objects;
	os->sobject = s;
    }
    high = os->nobject - 1;
    low = 0;
    mid = 0;
    c = 1;
    while (low <= high)
    {
	mid = (low + high) >> 1;
	c = strcmp (os->objects[mid], object);
	if (c == 0)
	    return FcTrue;
	if (c < 0)
	    low = mid + 1;
	else
	    high = mid - 1;
    }
    if (c < 0)
	mid++;
    memmove (os->objects + mid + 1, os->objects + mid, 
	     (os->nobject - mid) * sizeof (const char *));
    os->objects[mid] = FcObjectStaticName (object);
    os->nobject++;
    return FcTrue;
}

void
FcObjectSetDestroy (FcObjectSet *os)
{
    if (os->objects)
    {
	FcMemFree (FC_MEM_OBJECTPTR, os->sobject * sizeof (const char *));
	free ((void *) os->objects);
    }
    FcMemFree (FC_MEM_OBJECTSET, sizeof (FcObjectSet));
    free (os);
}

FcObjectSet *
FcObjectSetVaBuild (const char *first, va_list va)
{
    FcObjectSet    *ret;

    FcObjectSetVapBuild (ret, first, va);
    return ret;
}

FcObjectSet *
FcObjectSetBuild (const char *first, ...)
{
    va_list	    va;
    FcObjectSet    *os;

    va_start (va, first);
    FcObjectSetVapBuild (os, first, va);
    va_end (va);
    return os;
}

/*
 * Font must have a containing value for every value in the pattern
 */
static FcBool
FcListValueListMatchAny (FcValueList *patOrig,	    /* pattern */
			 FcValueList *fntOrig)	    /* font */
{
    FcValueList	    *pat, *fnt;

    for (pat = patOrig; pat; pat = pat->next)
    {
	for (fnt = fntOrig; fnt; fnt = fnt->next)
	{
	    /*
	     * make sure the font 'contains' the pattern.
	     * (OpListing is OpContains except for strings
	     *  where it requires an exact match)
	     */
	    if (FcConfigCompareValue (fnt->value,
				      FcOpListing, 
				      pat->value)) 
		break;
	}
	if (!fnt)
	    return FcFalse;
    }
    return FcTrue;
}

static FcBool
FcListValueListEqual (FcValueList   *v1orig,
		      FcValueList   *v2orig)
{
    FcValueList	    *v1, *v2;

    for (v1 = v1orig; v1; v1 = v1->next)
    {
	for (v2 = v2orig; v2; v2 = v2->next)
	    if (FcValueEqual (v1->value, v2->value))
		break;
	if (!v2)
	    return FcFalse;
    }
    for (v2 = v2orig; v2; v2 = v2->next)
    {
	for (v1 = v1orig; v1; v1 = v1->next)
	    if (FcValueEqual (v1->value, v2->value))
		break;
	if (!v1)
	    return FcFalse;
    }
    return FcTrue;
}

static FcBool
FcListPatternEqual (FcPattern	*p1,
		    FcPattern	*p2,
		    FcObjectSet	*os)
{
    int		    i;
    FcPatternElt    *e1, *e2;

    for (i = 0; i < os->nobject; i++)
    {
	e1 = FcPatternFindElt (p1, os->objects[i]);
	e2 = FcPatternFindElt (p2, os->objects[i]);
	if (!e1 && !e2)
	    continue;
	if (!e1 || !e2)
	    return FcFalse;
	if (!FcListValueListEqual (e1->values, e2->values))
	    return FcFalse;
    }
    return FcTrue;
}

/*
 * FcTrue iff all objects in "p" match "font"
 */

FcBool
FcListPatternMatchAny (const FcPattern *p,
		       const FcPattern *font)
{
    int		    i;
    FcPatternElt   *e;

    for (i = 0; i < p->num; i++)
    {
	e = FcPatternFindElt (font, p->elts[i].object);
	if (!e)
	    return FcFalse;
	if (!FcListValueListMatchAny (p->elts[i].values,    /* pat elts */
				      e->values))	    /* font elts */
	    return FcFalse;
    }
    return FcTrue;
}

static FcChar32
FcListMatrixHash (const FcMatrix *m)
{
    int	    xx = (int) (m->xx * 100), 
	    xy = (int) (m->xy * 100), 
	    yx = (int) (m->yx * 100),
	    yy = (int) (m->yy * 100);

    return ((FcChar32) xx) ^ ((FcChar32) xy) ^ ((FcChar32) yx) ^ ((FcChar32) yy);
}

static FcChar32
FcListValueHash (FcValue    v)
{
    switch (v.type) {
    case FcTypeVoid:
	return 0;
    case FcTypeInteger:
	return (FcChar32) v.u.i;
    case FcTypeDouble:
	return (FcChar32) (int) v.u.d;
    case FcTypeString:
	return FcStrHashIgnoreCase (v.u.s);
    case FcTypeBool:
	return (FcChar32) v.u.b;
    case FcTypeMatrix:
	return FcListMatrixHash (v.u.m);
    case FcTypeCharSet:
	return FcCharSetCount (v.u.c);
    case FcTypeFTFace:
	return (long) v.u.f;
    case FcTypeLangSet:
	return FcLangSetHash (v.u.l);
    }
    return 0;
}

static FcChar32
FcListValueListHash (FcValueList    *list)
{
    FcChar32	h = 0;
    
    while (list)
    {
	h = h ^ FcListValueHash (list->value);
	list = list->next;
    }
    return h;
}

static FcChar32
FcListPatternHash (FcPattern	*font,
		   FcObjectSet	*os)
{
    int		    n;
    FcPatternElt    *e;
    FcChar32	    h = 0;

    for (n = 0; n < os->nobject; n++)
    {
	e = FcPatternFindElt (font, os->objects[n]);
	if (e)
	    h = h ^ FcListValueListHash (e->values);
    }
    return h;
}

typedef struct _FcListBucket {
    struct _FcListBucket    *next;
    FcChar32		    hash;
    FcPattern		    *pattern;
} FcListBucket;

#define FC_LIST_HASH_SIZE   4099

typedef struct _FcListHashTable {
    int		    entries;
    FcListBucket    *buckets[FC_LIST_HASH_SIZE];
} FcListHashTable;
    
static void
FcListHashTableInit (FcListHashTable *table)
{
    table->entries = 0;
    memset (table->buckets, '\0', sizeof (table->buckets));
}

static void
FcListHashTableCleanup (FcListHashTable *table)
{
    int	i;
    FcListBucket    *bucket, *next;

    for (i = 0; i < FC_LIST_HASH_SIZE; i++)
    {
	for (bucket = table->buckets[i]; bucket; bucket = next)
	{
	    next = bucket->next;
	    FcPatternDestroy (bucket->pattern);
	    FcMemFree (FC_MEM_LISTBUCK, sizeof (FcListBucket));
	    free (bucket);
	}
	table->buckets[i] = 0;
    }
    table->entries = 0;
}

static FcBool
FcListAppend (FcListHashTable	*table,
	      FcPattern		*font,
	      FcObjectSet	*os)
{
    int		    o;
    FcPatternElt    *e;
    FcValueList	    *v;
    FcChar32	    hash;
    FcListBucket    **prev, *bucket;

    hash = FcListPatternHash (font, os);
    for (prev = &table->buckets[hash % FC_LIST_HASH_SIZE];
	 (bucket = *prev); prev = &(bucket->next))
    {
	if (bucket->hash == hash && 
	    FcListPatternEqual (bucket->pattern, font, os))
	    return FcTrue;
    }
    bucket = (FcListBucket *) malloc (sizeof (FcListBucket));
    if (!bucket)
	goto bail0;
    FcMemAlloc (FC_MEM_LISTBUCK, sizeof (FcListBucket));
    bucket->next = 0;
    bucket->hash = hash;
    bucket->pattern = FcPatternCreate ();
    if (!bucket->pattern)
	goto bail1;
    
    for (o = 0; o < os->nobject; o++)
    {
	e = FcPatternFindElt (font, os->objects[o]);
	if (e)
	{
	    for (v = e->values; v; v = v->next)
	    {
		if (!FcPatternAdd (bucket->pattern, 
				   os->objects[o], 
				   v->value, FcTrue))
		    goto bail2;
	    }
	}
    }
    *prev = bucket;
    ++table->entries;

    return FcTrue;
    
bail2:
    FcPatternDestroy (bucket->pattern);
bail1:
    FcMemFree (FC_MEM_LISTBUCK, sizeof (FcListBucket));
    free (bucket);
bail0:
    return FcFalse;
}

FcFontSet *
FcFontSetList (FcConfig	    *config,
	       FcFontSet    **sets,
	       int	    nsets,
	       FcPattern    *p,
	       FcObjectSet  *os)
{
    FcFontSet	    *ret;
    FcFontSet	    *s;
    int		    f;
    int		    set;
    FcListHashTable table;
    int		    i;
    FcListBucket    *bucket;

    if (!config)
    {
	if (!FcInitBringUptoDate ())
	    goto bail0;

	config = FcConfigGetCurrent ();
	if (!config)
	    goto bail0;
    }
    FcListHashTableInit (&table);
    /*
     * Walk all available fonts adding those that
     * match to the hash table
     */
    for (set = 0; set < nsets; set++)
    {
	s = sets[set];
	if (!s)
	    continue;
	for (f = 0; f < s->nfont; f++)
	    if (FcListPatternMatchAny (p,		/* pattern */
				       s->fonts[f]))	/* font */
		if (!FcListAppend (&table, s->fonts[f], os))
		    goto bail1;
    }
#if 0
    {
	int	max = 0;
	int	full = 0;
	int	ents = 0;
	int	len;
	for (i = 0; i < FC_LIST_HASH_SIZE; i++)
	{
	    if ((bucket = table.buckets[i]))
	    {
		len = 0;
		for (; bucket; bucket = bucket->next)
		{
		    ents++;
		    len++;
		}
		if (len > max)
		    max = len;
		full++;
	    }
	}
	printf ("used: %d max: %d avg: %g\n", full, max, 
		(double) ents / FC_LIST_HASH_SIZE);
    }
#endif
    /*
     * Walk the hash table and build
     * a font set
     */
    ret = FcFontSetCreate ();
    if (!ret)
	goto bail0;
    for (i = 0; i < FC_LIST_HASH_SIZE; i++)
	while ((bucket = table.buckets[i]))
	{
	    if (!FcFontSetAdd (ret, bucket->pattern))
		goto bail2;
	    table.buckets[i] = bucket->next;
	    FcMemFree (FC_MEM_LISTBUCK, sizeof (FcListBucket));
	    free (bucket);
	}
    
    return ret;

bail2:
    FcFontSetDestroy (ret);
bail1:
    FcListHashTableCleanup (&table);
bail0:
    return 0;
}

FcFontSet *
FcFontList (FcConfig	*config,
	    FcPattern	*p,
	    FcObjectSet *os)
{
    FcFontSet	*sets[2];
    int		nsets;

    if (!config)
    {
	config = FcConfigGetCurrent ();
	if (!config)
	    return 0;
    }
    nsets = 0;
    if (config->fonts[FcSetSystem])
	sets[nsets++] = config->fonts[FcSetSystem];
    if (config->fonts[FcSetApplication])
	sets[nsets++] = config->fonts[FcSetApplication];
    return FcFontSetList (config, sets, nsets, p, os);
}
Commit	Line	Data
24330d27	1	/*
793e946c	2	* $RCSId: xc/lib/fontconfig/src/fclist.c,v 1.11tsi Exp $
24330d27	3	*
46b51147	4	* Copyright © 2000 Keith Packard
24330d27 KP	5	*
	6	* Permission to use, copy, modify, distribute, and sell this software and its
	7	* documentation for any purpose is hereby granted without fee, provided that
	8	* the above copyright notice appear in all copies and that both that
	9	* copyright notice and this permission notice appear in supporting
	10	* documentation, and that the name of Keith Packard not be used in
	11	* advertising or publicity pertaining to distribution of the software without
	12	* specific, written prior permission. Keith Packard makes no
	13	* representations about the suitability of this software for any purpose. It
	14	* is provided "as is" without express or implied warranty.
	15	*
	16	* KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
	17	* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
	18	* EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
	19	* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
	20	* DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
	21	* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
	22	* PERFORMANCE OF THIS SOFTWARE.
	23	*/
	24
	25	#include <stdlib.h>
	26	#include "fcint.h"
	27
	28	FcObjectSet *
	29	FcObjectSetCreate (void)
	30	{
	31	FcObjectSet *os;
	32
	33	os = (FcObjectSet *) malloc (sizeof (FcObjectSet));
	34	if (!os)
	35	return 0;
	36	FcMemAlloc (FC_MEM_OBJECTSET, sizeof (FcObjectSet));
	37	os->nobject = 0;
	38	os->sobject = 0;
	39	os->objects = 0;
	40	return os;
	41	}
	42
	43	FcBool
	44	FcObjectSetAdd (FcObjectSet os, const char object)
	45	{
	46	int s;
	47	const char **objects;
e9be9cd1	48	int high, low, mid, c;
24330d27 KP	49
	50	if (os->nobject == os->sobject)
	51	{
	52	s = os->sobject + 4;
	53	if (os->objects)
	54	objects = (const char *) realloc ((void ) os->objects,
	55	s * sizeof (const char *));
	56	else
	57	objects = (const char *) malloc (s sizeof (const char *));
	58	if (!objects)
	59	return FcFalse;
	60	if (os->sobject)
	61	FcMemFree (FC_MEM_OBJECTPTR, os->sobject * sizeof (const char *));
	62	FcMemAlloc (FC_MEM_OBJECTPTR, s * sizeof (const char *));
	63	os->objects = objects;
	64	os->sobject = s;
	65	}
e9be9cd1 KP	66	high = os->nobject - 1;
	67	low = 0;
	68	mid = 0;
	69	c = 1;
	70	while (low <= high)
	71	{
	72	mid = (low + high) >> 1;
	73	c = strcmp (os->objects[mid], object);
	74	if (c == 0)
	75	return FcTrue;
	76	if (c < 0)
	77	low = mid + 1;
	78	else
	79	high = mid - 1;
	80	}
	81	if (c < 0)
	82	mid++;
5b1bfa5d KP	83	memmove (os->objects + mid + 1, os->objects + mid,
5b1bfa5d KP	84	(os->nobject - mid) * sizeof (const char *));
1c52c0f0	85	os->objects[mid] = FcObjectStaticName (object);
e9be9cd1	86	os->nobject++;
24330d27 KP	87	return FcTrue;
	88	}
	89
	90	void
	91	FcObjectSetDestroy (FcObjectSet *os)
	92	{
	93	if (os->objects)
	94	{
	95	FcMemFree (FC_MEM_OBJECTPTR, os->sobject * sizeof (const char *));
	96	free ((void *) os->objects);
	97	}
	98	FcMemFree (FC_MEM_OBJECTSET, sizeof (FcObjectSet));
	99	free (os);
	100	}
	101
	102	FcObjectSet *
	103	FcObjectSetVaBuild (const char *first, va_list va)
	104	{
	105	FcObjectSet *ret;
	106
	107	FcObjectSetVapBuild (ret, first, va);
	108	return ret;
	109	}
	110
	111	FcObjectSet *
	112	FcObjectSetBuild (const char *first, ...)
	113	{
	114	va_list va;
	115	FcObjectSet *os;
	116
	117	va_start (va, first);
	118	FcObjectSetVapBuild (os, first, va);
	119	va_end (va);
	120	return os;
	121	}
	122
74a623e0 KP	123	/*
	124	* Font must have a containing value for every value in the pattern
	125	*/
24330d27	126	static FcBool
74a623e0 KP	127	FcListValueListMatchAny (FcValueList patOrig, / pattern */
74a623e0 KP	128	FcValueList fntOrig) / font */
24330d27	129	{
74a623e0	130	FcValueList pat, fnt;
24330d27	131
74a623e0 KP	132	for (pat = patOrig; pat; pat = pat->next)
	133	{
	134	for (fnt = fntOrig; fnt; fnt = fnt->next)
	135	{
	136	/*
	137	* make sure the font 'contains' the pattern.
	138	* (OpListing is OpContains except for strings
	139	* where it requires an exact match)
	140	*/
	141	if (FcConfigCompareValue (fnt->value,
	142	FcOpListing,
	143	pat->value))
	144	break;
	145	}
	146	if (!fnt)
	147	return FcFalse;
	148	}
	149	return FcTrue;
24330d27 KP	150	}
	151
	152	static FcBool
	153	FcListValueListEqual (FcValueList *v1orig,
	154	FcValueList *v2orig)
	155	{
	156	FcValueList v1, v2;
	157
	158	for (v1 = v1orig; v1; v1 = v1->next)
	159	{
	160	for (v2 = v2orig; v2; v2 = v2->next)
47d4f950	161	if (FcValueEqual (v1->value, v2->value))
24330d27 KP	162	break;
	163	if (!v2)
	164	return FcFalse;
	165	}
	166	for (v2 = v2orig; v2; v2 = v2->next)
	167	{
	168	for (v1 = v1orig; v1; v1 = v1->next)
47d4f950	169	if (FcValueEqual (v1->value, v2->value))
24330d27 KP	170	break;
	171	if (!v1)
	172	return FcFalse;
	173	}
	174	return FcTrue;
	175	}
	176
24330d27	177	static FcBool
e9be9cd1 KP	178	FcListPatternEqual (FcPattern *p1,
	179	FcPattern *p2,
	180	FcObjectSet *os)
24330d27 KP	181	{
24330d27 KP	182	int i;
e9be9cd1	183	FcPatternElt e1, e2;
24330d27	184
e9be9cd1	185	for (i = 0; i < os->nobject; i++)
24330d27	186	{
e9be9cd1 KP	187	e1 = FcPatternFindElt (p1, os->objects[i]);
	188	e2 = FcPatternFindElt (p2, os->objects[i]);
	189	if (!e1 && !e2)
47d4f950	190	continue;
e9be9cd1	191	if (!e1 \|\| !e2)
24330d27	192	return FcFalse;
e9be9cd1	193	if (!FcListValueListEqual (e1->values, e2->values))
24330d27 KP	194	return FcFalse;
	195	}
	196	return FcTrue;
	197	}
	198
e9be9cd1 KP	199	/*
	200	* FcTrue iff all objects in "p" match "font"
	201	*/
	202
4f27c1c0 KP	203	FcBool
	204	FcListPatternMatchAny (const FcPattern *p,
	205	const FcPattern *font)
24330d27 KP	206	{
24330d27 KP	207	int i;
e9be9cd1	208	FcPatternElt *e;
24330d27	209
e9be9cd1	210	for (i = 0; i < p->num; i++)
24330d27	211	{
e9be9cd1 KP	212	e = FcPatternFindElt (font, p->elts[i].object);
e9be9cd1 KP	213	if (!e)
24330d27	214	return FcFalse;
74a623e0 KP	215	if (!FcListValueListMatchAny (p->elts[i].values, /* pat elts */
74a623e0 KP	216	e->values)) /* font elts */
24330d27 KP	217	return FcFalse;
	218	}
	219	return FcTrue;
	220	}
	221
24330d27 KP	222	static FcChar32
	223	FcListMatrixHash (const FcMatrix *m)
	224	{
	225	int xx = (int) (m->xx * 100),
	226	xy = (int) (m->xy * 100),
	227	yx = (int) (m->yx * 100),
	228	yy = (int) (m->yy * 100);
	229
	230	return ((FcChar32) xx) ^ ((FcChar32) xy) ^ ((FcChar32) yx) ^ ((FcChar32) yy);
	231	}
	232
	233	static FcChar32
	234	FcListValueHash (FcValue v)
	235	{
	236	switch (v.type) {
	237	case FcTypeVoid:
	238	return 0;
	239	case FcTypeInteger:
	240	return (FcChar32) v.u.i;
	241	case FcTypeDouble:
	242	return (FcChar32) (int) v.u.d;
	243	case FcTypeString:
192296d8	244	return FcStrHashIgnoreCase (v.u.s);
24330d27 KP	245	case FcTypeBool:
	246	return (FcChar32) v.u.b;
	247	case FcTypeMatrix:
	248	return FcListMatrixHash (v.u.m);
	249	case FcTypeCharSet:
	250	return FcCharSetCount (v.u.c);
88c747e2	251	case FcTypeFTFace:
d1bec8c6	252	return (long) v.u.f;
d8d73958 KP	253	case FcTypeLangSet:
d8d73958 KP	254	return FcLangSetHash (v.u.l);
24330d27 KP	255	}
	256	return 0;
	257	}
	258
	259	static FcChar32
	260	FcListValueListHash (FcValueList *list)
	261	{
	262	FcChar32 h = 0;
	263
	264	while (list)
	265	{
	266	h = h ^ FcListValueHash (list->value);
	267	list = list->next;
	268	}
	269	return h;
	270	}
	271
	272	static FcChar32
	273	FcListPatternHash (FcPattern *font,
	274	FcObjectSet *os)
	275	{
	276	int n;
	277	FcPatternElt *e;
	278	FcChar32 h = 0;
	279
	280	for (n = 0; n < os->nobject; n++)
	281	{
e9be9cd1	282	e = FcPatternFindElt (font, os->objects[n]);
24330d27 KP	283	if (e)
	284	h = h ^ FcListValueListHash (e->values);
	285	}
	286	return h;
	287	}
	288
	289	typedef struct _FcListBucket {
	290	struct _FcListBucket *next;
	291	FcChar32 hash;
	292	FcPattern *pattern;
	293	} FcListBucket;
	294
	295	#define FC_LIST_HASH_SIZE 4099
	296
	297	typedef struct _FcListHashTable {
	298	int entries;
	299	FcListBucket *buckets[FC_LIST_HASH_SIZE];
	300	} FcListHashTable;
	301
	302	static void
	303	FcListHashTableInit (FcListHashTable *table)
	304	{
	305	table->entries = 0;
	306	memset (table->buckets, '\0', sizeof (table->buckets));
	307	}
	308
	309	static void
	310	FcListHashTableCleanup (FcListHashTable *table)
	311	{
	312	int i;
	313	FcListBucket bucket, next;
	314
	315	for (i = 0; i < FC_LIST_HASH_SIZE; i++)
	316	{
	317	for (bucket = table->buckets[i]; bucket; bucket = next)
	318	{
	319	next = bucket->next;
	320	FcPatternDestroy (bucket->pattern);
	321	FcMemFree (FC_MEM_LISTBUCK, sizeof (FcListBucket));
	322	free (bucket);
	323	}
	324	table->buckets[i] = 0;
	325	}
	326	table->entries = 0;
	327	}
	328
	329	static FcBool
	330	FcListAppend (FcListHashTable *table,
	331	FcPattern *font,
	332	FcObjectSet *os)
	333	{
	334	int o;
	335	FcPatternElt *e;
	336	FcValueList *v;
	337	FcChar32 hash;
	338	FcListBucket *prev, bucket;
	339
	340	hash = FcListPatternHash (font, os);
	341	for (prev = &table->buckets[hash % FC_LIST_HASH_SIZE];
	342	(bucket = *prev); prev = &(bucket->next))
	343	{
	344	if (bucket->hash == hash &&
	345	FcListPatternEqual (bucket->pattern, font, os))
	346	return FcTrue;
347	}
348	bucket = (FcListBucket *) malloc (sizeof (FcListBucket));
349	if (!bucket)
350	goto bail0;
351	FcMemAlloc (FC_MEM_LISTBUCK, sizeof (FcListBucket));
352	bucket->next = 0;
353	bucket->hash = hash;
354	bucket->pattern = FcPatternCreate ();
355	if (!bucket->pattern)
356	goto bail1;
357
358	for (o = 0; o < os->nobject; o++)
359	{
e9be9cd1	360	e = FcPatternFindElt (font, os->objects[o]);
24330d27 KP	361	if (e)
	362	{
	363	for (v = e->values; v; v = v->next)
	364	{
	365	if (!FcPatternAdd (bucket->pattern,
	366	os->objects[o],
	367	v->value, FcTrue))
	368	goto bail2;
	369	}
	370	}
	371	}
	372	*prev = bucket;
	373	++table->entries;
	374
	375	return FcTrue;
	376
	377	bail2:
	378	FcPatternDestroy (bucket->pattern);
	379	bail1:
	380	FcMemFree (FC_MEM_LISTBUCK, sizeof (FcListBucket));
	381	free (bucket);
	382	bail0:
	383	return FcFalse;
	384	}
	385
	386	FcFontSet *
80c053b7 KP	387	FcFontSetList (FcConfig *config,
	388	FcFontSet **sets,
	389	int nsets,
	390	FcPattern *p,
	391	FcObjectSet *os)
24330d27 KP	392	{
	393	FcFontSet *ret;
	394	FcFontSet *s;
	395	int f;
80c053b7	396	int set;
24330d27 KP	397	FcListHashTable table;
	398	int i;
	399	FcListBucket *bucket;
	400
	401	if (!config)
	402	{
179c3995 KP	403	if (!FcInitBringUptoDate ())
	404	goto bail0;
	405
24330d27 KP	406	config = FcConfigGetCurrent ();
	407	if (!config)
	408	goto bail0;
	409	}
	410	FcListHashTableInit (&table);
	411	/*
	412	* Walk all available fonts adding those that
	413	* match to the hash table
	414	*/
80c053b7	415	for (set = 0; set < nsets; set++)
24330d27	416	{
80c053b7	417	s = sets[set];
24330d27 KP	418	if (!s)
	419	continue;
	420	for (f = 0; f < s->nfont; f++)
74a623e0 KP	421	if (FcListPatternMatchAny (p, /* pattern */
74a623e0 KP	422	s->fonts[f])) /* font */
24330d27 KP	423	if (!FcListAppend (&table, s->fonts[f], os))
	424	goto bail1;
	425	}
	426	#if 0
	427	{
	428	int max = 0;
	429	int full = 0;
	430	int ents = 0;
	431	int len;
	432	for (i = 0; i < FC_LIST_HASH_SIZE; i++)
	433	{
	434	if ((bucket = table.buckets[i]))
	435	{
	436	len = 0;
	437	for (; bucket; bucket = bucket->next)
	438	{
	439	ents++;
	440	len++;
	441	}
	442	if (len > max)
	443	max = len;
	444	full++;
	445	}
	446	}
	447	printf ("used: %d max: %d avg: %g\n", full, max,
	448	(double) ents / FC_LIST_HASH_SIZE);
	449	}
	450	#endif
	451	/*
	452	* Walk the hash table and build
	453	* a font set
	454	*/
	455	ret = FcFontSetCreate ();
	456	if (!ret)
	457	goto bail0;
	458	for (i = 0; i < FC_LIST_HASH_SIZE; i++)
	459	while ((bucket = table.buckets[i]))
	460	{
	461	if (!FcFontSetAdd (ret, bucket->pattern))
	462	goto bail2;
	463	table.buckets[i] = bucket->next;
	464	FcMemFree (FC_MEM_LISTBUCK, sizeof (FcListBucket));
	465	free (bucket);
	466	}
	467
	468	return ret;
	469
	470	bail2:
	471	FcFontSetDestroy (ret);
	472	bail1:
	473	FcListHashTableCleanup (&table);
	474	bail0:
	475	return 0;
	476	}
80c053b7 KP	477
	478	FcFontSet *
	479	FcFontList (FcConfig *config,
	480	FcPattern *p,
	481	FcObjectSet *os)
	482	{
	483	FcFontSet *sets[2];
	484	int nsets;
	485
	486	if (!config)
	487	{
	488	config = FcConfigGetCurrent ();
	489	if (!config)
	490	return 0;
	491	}
	492	nsets = 0;
	493	if (config->fonts[FcSetSystem])
	494	sets[nsets++] = config->fonts[FcSetSystem];
	495	if (config->fonts[FcSetApplication])
	496	sets[nsets++] = config->fonts[FcSetApplication];
	497	return FcFontSetList (config, sets, nsets, p, os);
	498	}