2002-02-15 00:34:13 +01:00
|
|
|
/*
|
2008-08-12 22:34:24 +02:00
|
|
|
* fontconfig/src/fcmatch.c
|
2002-02-15 00:34:13 +01:00
|
|
|
*
|
2004-12-07 02:14:46 +01:00
|
|
|
* Copyright © 2000 Keith Packard
|
2002-02-15 00:34:13 +01:00
|
|
|
*
|
|
|
|
* 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
|
2010-11-10 22:45:42 +01:00
|
|
|
* documentation, and that the name of the author(s) not be used in
|
2002-02-15 00:34:13 +01:00
|
|
|
* advertising or publicity pertaining to distribution of the software without
|
2010-11-10 22:45:42 +01:00
|
|
|
* specific, written prior permission. The authors make no
|
2002-02-15 00:34:13 +01:00
|
|
|
* representations about the suitability of this software for any purpose. It
|
|
|
|
* is provided "as is" without express or implied warranty.
|
|
|
|
*
|
2009-03-12 21:00:08 +01:00
|
|
|
* THE AUTHOR(S) DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
|
2002-02-15 00:34:13 +01:00
|
|
|
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
|
2009-03-12 21:00:08 +01:00
|
|
|
* EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY SPECIAL, INDIRECT OR
|
2002-02-15 00:34:13 +01:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2006-04-25 07:57:41 +02:00
|
|
|
#include "fcint.h"
|
2002-02-15 00:34:13 +01:00
|
|
|
|
|
|
|
static double
|
2005-11-25 04:00:51 +01:00
|
|
|
FcCompareNumber (FcValue *value1, FcValue *value2)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2003-02-26 20:13:17 +01:00
|
|
|
double v1, v2, v;
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2012-12-30 04:11:09 +01:00
|
|
|
switch ((int) value1->type) {
|
2003-02-26 20:13:17 +01:00
|
|
|
case FcTypeInteger:
|
2005-08-24 08:21:30 +02:00
|
|
|
v1 = (double) value1->u.i;
|
2003-02-26 20:13:17 +01:00
|
|
|
break;
|
|
|
|
case FcTypeDouble:
|
2005-08-24 08:21:30 +02:00
|
|
|
v1 = value1->u.d;
|
2003-02-26 20:13:17 +01:00
|
|
|
break;
|
|
|
|
default:
|
2002-02-15 00:34:13 +01:00
|
|
|
return -1.0;
|
2003-02-26 20:13:17 +01:00
|
|
|
}
|
2012-12-30 04:11:09 +01:00
|
|
|
switch ((int) value2->type) {
|
2003-02-26 20:13:17 +01:00
|
|
|
case FcTypeInteger:
|
2005-08-24 08:21:30 +02:00
|
|
|
v2 = (double) value2->u.i;
|
2003-02-26 20:13:17 +01:00
|
|
|
break;
|
|
|
|
case FcTypeDouble:
|
2005-08-24 08:21:30 +02:00
|
|
|
v2 = value2->u.d;
|
2003-02-26 20:13:17 +01:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return -1.0;
|
|
|
|
}
|
|
|
|
v = v2 - v1;
|
2002-02-15 00:34:13 +01:00
|
|
|
if (v < 0)
|
|
|
|
v = -v;
|
2005-11-24 21:20:26 +01:00
|
|
|
return v;
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static double
|
2005-11-25 04:00:51 +01:00
|
|
|
FcCompareString (FcValue *v1, FcValue *v2)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2009-11-16 21:46:46 +01:00
|
|
|
return (double) FcStrCmpIgnoreCase (FcValueString(v1), FcValueString(v2)) != 0;
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
|
|
|
|
2002-07-07 01:47:44 +02:00
|
|
|
static double
|
2005-11-25 04:00:51 +01:00
|
|
|
FcCompareFamily (FcValue *v1, FcValue *v2)
|
2002-07-07 01:47:44 +02:00
|
|
|
{
|
2010-04-12 18:49:53 +02:00
|
|
|
/* rely on the guarantee in FcPatternObjectAddWithBinding that
|
2005-11-24 21:20:26 +01:00
|
|
|
* families are always FcTypeString. */
|
2009-11-16 21:46:46 +01:00
|
|
|
const FcChar8* v1_string = FcValueString(v1);
|
|
|
|
const FcChar8* v2_string = FcValueString(v2);
|
2005-11-24 21:20:26 +01:00
|
|
|
|
2009-01-01 00:06:07 +01:00
|
|
|
if (FcToLower(*v1_string) != FcToLower(*v2_string) &&
|
|
|
|
*v1_string != ' ' && *v2_string != ' ')
|
2005-11-24 21:20:26 +01:00
|
|
|
return 1.0;
|
|
|
|
|
|
|
|
return (double) FcStrCmpIgnoreBlanksAndCase (v1_string, v2_string) != 0;
|
2002-07-07 01:47:44 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static double
|
2005-11-25 04:00:51 +01:00
|
|
|
FcCompareLang (FcValue *v1, FcValue *v2)
|
2002-07-07 01:47:44 +02:00
|
|
|
{
|
|
|
|
FcLangResult result;
|
2005-08-24 08:21:30 +02:00
|
|
|
FcValue value1 = FcValueCanonicalize(v1), value2 = FcValueCanonicalize(v2);
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2012-12-30 04:11:09 +01:00
|
|
|
switch ((int) value1.type) {
|
2002-08-22 09:36:45 +02:00
|
|
|
case FcTypeLangSet:
|
2012-12-30 04:11:09 +01:00
|
|
|
switch ((int) value2.type) {
|
2002-08-22 09:36:45 +02:00
|
|
|
case FcTypeLangSet:
|
2005-08-24 08:21:30 +02:00
|
|
|
result = FcLangSetCompare (value1.u.l, value2.u.l);
|
2002-08-22 09:36:45 +02:00
|
|
|
break;
|
|
|
|
case FcTypeString:
|
2010-04-12 18:18:50 +02:00
|
|
|
result = FcLangSetHasLang (value1.u.l,
|
2005-08-24 08:21:30 +02:00
|
|
|
value2.u.s);
|
2002-08-22 09:36:45 +02:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return -1.0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case FcTypeString:
|
2012-12-30 04:11:09 +01:00
|
|
|
switch ((int) value2.type) {
|
2002-08-22 09:36:45 +02:00
|
|
|
case FcTypeLangSet:
|
2005-08-24 08:21:30 +02:00
|
|
|
result = FcLangSetHasLang (value2.u.l, value1.u.s);
|
2002-08-22 09:36:45 +02:00
|
|
|
break;
|
|
|
|
case FcTypeString:
|
2010-04-12 18:18:50 +02:00
|
|
|
result = FcLangCompare (value1.u.s,
|
2005-08-24 08:21:30 +02:00
|
|
|
value2.u.s);
|
2002-08-22 09:36:45 +02:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return -1.0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
2002-07-07 01:47:44 +02:00
|
|
|
return -1.0;
|
2002-08-22 09:36:45 +02:00
|
|
|
}
|
2002-07-07 01:47:44 +02:00
|
|
|
switch (result) {
|
|
|
|
case FcLangEqual:
|
|
|
|
return 0;
|
|
|
|
case FcLangDifferentCountry:
|
|
|
|
return 1;
|
|
|
|
case FcLangDifferentLang:
|
|
|
|
default:
|
|
|
|
return 2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-02-15 00:34:13 +01:00
|
|
|
static double
|
2005-11-25 04:00:51 +01:00
|
|
|
FcCompareBool (FcValue *v1, FcValue *v2)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2009-11-16 21:43:08 +01:00
|
|
|
if (v2->type != FcTypeBool || v1->type != FcTypeBool)
|
2002-02-15 00:34:13 +01:00
|
|
|
return -1.0;
|
2005-11-24 22:40:20 +01:00
|
|
|
return (double) v2->u.b != v1->u.b;
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static double
|
2005-11-25 04:00:51 +01:00
|
|
|
FcCompareCharSet (FcValue *v1, FcValue *v2)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2009-11-16 21:46:46 +01:00
|
|
|
return (double) FcCharSetSubtractCount (FcValueCharSet(v1), FcValueCharSet(v2));
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static double
|
2005-11-25 04:00:51 +01:00
|
|
|
FcCompareSize (FcValue *value1, FcValue *value2)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
|
|
|
double v1, v2, v;
|
|
|
|
|
2012-12-30 04:11:09 +01:00
|
|
|
switch ((int) value1->type) {
|
2002-02-15 00:34:13 +01:00
|
|
|
case FcTypeInteger:
|
2005-08-24 08:21:30 +02:00
|
|
|
v1 = value1->u.i;
|
2002-02-15 00:34:13 +01:00
|
|
|
break;
|
|
|
|
case FcTypeDouble:
|
2005-08-24 08:21:30 +02:00
|
|
|
v1 = value1->u.d;
|
2002-02-15 00:34:13 +01:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
2012-12-30 04:11:09 +01:00
|
|
|
switch ((int) value2->type) {
|
2002-02-15 00:34:13 +01:00
|
|
|
case FcTypeInteger:
|
2005-08-24 08:21:30 +02:00
|
|
|
v2 = value2->u.i;
|
2002-02-15 00:34:13 +01:00
|
|
|
break;
|
|
|
|
case FcTypeDouble:
|
2005-08-24 08:21:30 +02:00
|
|
|
v2 = value2->u.d;
|
2002-02-15 00:34:13 +01:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
if (v2 == 0)
|
|
|
|
return 0;
|
|
|
|
v = v2 - v1;
|
|
|
|
if (v < 0)
|
|
|
|
v = -v;
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
2012-04-09 05:51:12 +02:00
|
|
|
static double
|
|
|
|
FcCompareFilename (FcValue *v1, FcValue *v2)
|
|
|
|
{
|
|
|
|
const FcChar8 *s1 = FcValueString (v1), *s2 = FcValueString (v2);
|
|
|
|
if (FcStrCmp (s1, s2) == 0)
|
|
|
|
return 0.0;
|
|
|
|
else if (FcStrCmpIgnoreCase (s1, s2) == 0)
|
|
|
|
return 1.0;
|
|
|
|
else if (FcStrRegexCmp (s2, s1))
|
|
|
|
return 2.0;
|
|
|
|
else if (FcStrRegexCmpIgnoreCase (s2, s1))
|
|
|
|
return 3.0;
|
|
|
|
else
|
|
|
|
return 4.0;
|
|
|
|
}
|
|
|
|
|
2013-02-06 11:02:07 +01:00
|
|
|
#define PRI_NULL(n) \
|
|
|
|
PRI_ ## n ## _STRONG = -1, \
|
|
|
|
PRI_ ## n ## _WEAK = -1,
|
|
|
|
#define PRI1(n)
|
|
|
|
#define PRI_FcCompareFamily(n) PRI1(n)
|
|
|
|
#define PRI_FcCompareString(n) PRI1(n)
|
|
|
|
#define PRI_FcCompareNumber(n) PRI1(n)
|
|
|
|
#define PRI_FcCompareSize(n) PRI1(n)
|
|
|
|
#define PRI_FcCompareBool(n) PRI1(n)
|
|
|
|
#define PRI_FcCompareFilename(n) PRI1(n)
|
|
|
|
#define PRI_FcCompareCharSet(n) PRI1(n)
|
|
|
|
#define PRI_FcCompareLang(n) PRI1(n)
|
|
|
|
|
|
|
|
#define FC_OBJECT(NAME, Type, Cmp) PRI_##Cmp(NAME)
|
|
|
|
|
|
|
|
typedef enum _FcMatcherPriorityDummy {
|
|
|
|
#include "fcobjs.h"
|
|
|
|
} FcMatcherPriorityDummy;
|
|
|
|
|
|
|
|
#undef FC_OBJECT
|
|
|
|
|
|
|
|
#undef PRI1
|
|
|
|
#define PRI1(n) \
|
|
|
|
PRI_ ## n ## _STRONG, \
|
|
|
|
PRI_ ## n ## _WEAK
|
|
|
|
|
|
|
|
typedef enum _FcMatcherPriority {
|
|
|
|
PRI1(HASH),
|
|
|
|
PRI1(FILE),
|
|
|
|
PRI1(FOUNDRY),
|
|
|
|
PRI1(CHARSET),
|
|
|
|
PRI_FAMILY_STRONG,
|
|
|
|
PRI_LANG_STRONG,
|
|
|
|
PRI_LANG_WEAK,
|
|
|
|
PRI_FAMILY_WEAK,
|
|
|
|
PRI1(SPACING),
|
|
|
|
PRI1(PIXEL_SIZE),
|
|
|
|
PRI1(STYLE),
|
|
|
|
PRI1(SLANT),
|
|
|
|
PRI1(WEIGHT),
|
|
|
|
PRI1(WIDTH),
|
|
|
|
PRI1(DECORATIVE),
|
|
|
|
PRI1(ANTIALIAS),
|
|
|
|
PRI1(RASTERIZER),
|
|
|
|
PRI1(OUTLINE),
|
|
|
|
PRI1(FONTVERSION),
|
|
|
|
PRI_END
|
|
|
|
} FcMatcherPriority;
|
|
|
|
|
|
|
|
#undef PRI1
|
|
|
|
|
2002-06-29 22:31:02 +02:00
|
|
|
typedef struct _FcMatcher {
|
2013-02-06 11:02:07 +01:00
|
|
|
FcObject object;
|
|
|
|
double (*compare) (FcValue *value1, FcValue *value2);
|
|
|
|
int strong, weak;
|
2002-06-29 22:31:02 +02:00
|
|
|
} FcMatcher;
|
|
|
|
|
2002-02-15 00:34:13 +01:00
|
|
|
/*
|
|
|
|
* Order is significant, it defines the precedence of
|
|
|
|
* each value, earlier values are more significant than
|
|
|
|
* later values
|
|
|
|
*/
|
2013-02-06 11:02:07 +01:00
|
|
|
#define FC_OBJECT(NAME, Type, Cmp) { FC_##NAME##_OBJECT, Cmp, PRI_##NAME##_STRONG, PRI_##NAME##_WEAK },
|
2009-05-26 02:26:56 +02:00
|
|
|
static const FcMatcher _FcMatchers [] = {
|
2013-02-06 11:02:07 +01:00
|
|
|
{ FC_INVALID_OBJECT, NULL, -1, -1 },
|
|
|
|
#include "fcobjs.h"
|
2002-02-15 00:34:13 +01:00
|
|
|
};
|
2013-02-06 11:02:07 +01:00
|
|
|
#undef FC_OBJECT
|
2002-02-15 00:34:13 +01:00
|
|
|
|
2009-07-23 01:01:06 +02:00
|
|
|
static const FcMatcher*
|
2012-03-26 09:34:34 +02:00
|
|
|
FcObjectToMatcher (FcObject object,
|
|
|
|
FcBool include_lang)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2013-02-06 11:02:07 +01:00
|
|
|
if (include_lang)
|
|
|
|
{
|
|
|
|
switch (object) {
|
|
|
|
case FC_FAMILYLANG_OBJECT:
|
|
|
|
case FC_STYLELANG_OBJECT:
|
|
|
|
case FC_FULLNAMELANG_OBJECT:
|
|
|
|
object = FC_LANG_OBJECT;
|
|
|
|
break;
|
2012-03-26 09:34:34 +02:00
|
|
|
}
|
2002-05-30 00:07:33 +02:00
|
|
|
}
|
2013-03-01 11:38:21 +01:00
|
|
|
if (object > FC_MAX_BASE_OBJECT ||
|
|
|
|
!_FcMatchers[object].compare ||
|
2013-02-06 11:02:07 +01:00
|
|
|
_FcMatchers[object].strong == -1 ||
|
|
|
|
_FcMatchers[object].weak == -1)
|
2006-08-30 13:16:22 +02:00
|
|
|
return NULL;
|
2005-11-28 02:40:53 +01:00
|
|
|
|
2013-02-06 11:02:07 +01:00
|
|
|
return _FcMatchers + object;
|
2005-11-28 02:40:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static FcBool
|
2012-03-26 09:34:34 +02:00
|
|
|
FcCompareValueList (FcObject object,
|
|
|
|
const FcMatcher *match,
|
|
|
|
FcValueListPtr v1orig, /* pattern */
|
|
|
|
FcValueListPtr v2orig, /* target */
|
|
|
|
FcValue *bestValue,
|
|
|
|
double *value,
|
|
|
|
int *n,
|
|
|
|
FcResult *result)
|
2005-11-28 02:40:53 +01:00
|
|
|
{
|
|
|
|
FcValueListPtr v1, v2;
|
|
|
|
double v, best, bestStrong, bestWeak;
|
2012-03-26 09:34:34 +02:00
|
|
|
int j, k, pos = 0;
|
2005-11-28 02:40:53 +01:00
|
|
|
|
|
|
|
if (!match)
|
2002-05-30 00:07:33 +02:00
|
|
|
{
|
|
|
|
if (bestValue)
|
2006-08-30 13:16:22 +02:00
|
|
|
*bestValue = FcValueCanonicalize(&v2orig->value);
|
2012-03-26 09:34:34 +02:00
|
|
|
if (n)
|
|
|
|
*n = 0;
|
2002-05-30 00:07:33 +02:00
|
|
|
return FcTrue;
|
|
|
|
}
|
2005-11-28 02:40:53 +01:00
|
|
|
|
2002-02-15 00:34:13 +01:00
|
|
|
best = 1e99;
|
2002-06-29 22:31:02 +02:00
|
|
|
bestStrong = 1e99;
|
|
|
|
bestWeak = 1e99;
|
2009-01-01 01:44:32 +01:00
|
|
|
j = 1;
|
2006-08-30 13:16:22 +02:00
|
|
|
for (v1 = v1orig; v1; v1 = FcValueListNext(v1))
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2012-03-26 09:34:34 +02:00
|
|
|
for (v2 = v2orig, k = 0; v2; v2 = FcValueListNext(v2), k++)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
v = (match->compare) (&v1->value, &v2->value);
|
2002-02-15 00:34:13 +01:00
|
|
|
if (v < 0)
|
|
|
|
{
|
|
|
|
*result = FcResultTypeMismatch;
|
|
|
|
return FcFalse;
|
|
|
|
}
|
2009-01-01 01:35:27 +01:00
|
|
|
v = v * 1000 + j;
|
2002-02-15 00:34:13 +01:00
|
|
|
if (v < best)
|
|
|
|
{
|
|
|
|
if (bestValue)
|
2006-08-30 13:16:22 +02:00
|
|
|
*bestValue = FcValueCanonicalize(&v2->value);
|
2002-02-15 00:34:13 +01:00
|
|
|
best = v;
|
2012-03-26 09:34:34 +02:00
|
|
|
pos = k;
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
2006-08-30 13:16:22 +02:00
|
|
|
if (v1->binding == FcValueBindingStrong)
|
2002-06-29 22:31:02 +02:00
|
|
|
{
|
|
|
|
if (v < bestStrong)
|
|
|
|
bestStrong = v;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (v < bestWeak)
|
|
|
|
bestWeak = v;
|
|
|
|
}
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
|
|
|
j++;
|
|
|
|
}
|
|
|
|
if (FcDebug () & FC_DBG_MATCHV)
|
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
printf (" %s: %g ", FcObjectName (object), best);
|
2002-02-15 00:34:13 +01:00
|
|
|
FcValueListPrint (v1orig);
|
|
|
|
printf (", ");
|
|
|
|
FcValueListPrint (v2orig);
|
|
|
|
printf ("\n");
|
|
|
|
}
|
2002-06-08 19:32:05 +02:00
|
|
|
if (value)
|
2002-06-29 22:31:02 +02:00
|
|
|
{
|
2005-11-28 02:40:53 +01:00
|
|
|
int weak = match->weak;
|
|
|
|
int strong = match->strong;
|
2002-06-29 22:31:02 +02:00
|
|
|
if (weak == strong)
|
|
|
|
value[strong] += best;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
value[weak] += bestWeak;
|
|
|
|
value[strong] += bestStrong;
|
|
|
|
}
|
|
|
|
}
|
2012-03-26 09:34:34 +02:00
|
|
|
if (n)
|
|
|
|
*n = pos;
|
|
|
|
|
2002-02-15 00:34:13 +01:00
|
|
|
return FcTrue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return a value indicating the distance between the two lists of
|
|
|
|
* values
|
|
|
|
*/
|
|
|
|
|
|
|
|
static FcBool
|
|
|
|
FcCompare (FcPattern *pat,
|
|
|
|
FcPattern *fnt,
|
|
|
|
double *value,
|
|
|
|
FcResult *result)
|
|
|
|
{
|
|
|
|
int i, i1, i2;
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2013-02-06 11:02:07 +01:00
|
|
|
for (i = 0; i < PRI_END; i++)
|
2002-02-15 00:34:13 +01:00
|
|
|
value[i] = 0.0;
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2002-05-30 00:07:33 +02:00
|
|
|
i1 = 0;
|
|
|
|
i2 = 0;
|
|
|
|
while (i1 < pat->num && i2 < fnt->num)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
FcPatternElt *elt_i1 = &FcPatternElts(pat)[i1];
|
|
|
|
FcPatternElt *elt_i2 = &FcPatternElts(fnt)[i2];
|
2005-11-25 04:00:51 +01:00
|
|
|
|
2006-08-30 13:16:22 +02:00
|
|
|
i = FcObjectCompare(elt_i1->object, elt_i2->object);
|
2002-05-30 00:07:33 +02:00
|
|
|
if (i > 0)
|
|
|
|
i2++;
|
|
|
|
else if (i < 0)
|
|
|
|
i1++;
|
|
|
|
else
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2012-03-26 09:34:34 +02:00
|
|
|
const FcMatcher *match = FcObjectToMatcher (elt_i1->object, FcFalse);
|
|
|
|
if (!FcCompareValueList (elt_i1->object, match,
|
2006-08-30 13:16:22 +02:00
|
|
|
FcPatternEltValues(elt_i1),
|
|
|
|
FcPatternEltValues(elt_i2),
|
2012-03-26 09:34:34 +02:00
|
|
|
NULL, value, NULL, result))
|
2002-05-30 00:07:33 +02:00
|
|
|
return FcFalse;
|
|
|
|
i1++;
|
|
|
|
i2++;
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
2002-05-30 00:07:33 +02:00
|
|
|
}
|
|
|
|
return FcTrue;
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
|
|
|
|
2002-03-03 19:39:05 +01:00
|
|
|
FcPattern *
|
|
|
|
FcFontRenderPrepare (FcConfig *config,
|
|
|
|
FcPattern *pat,
|
|
|
|
FcPattern *font)
|
|
|
|
{
|
|
|
|
FcPattern *new;
|
|
|
|
int i;
|
2012-03-26 09:34:34 +02:00
|
|
|
FcPatternElt *fe, *pe, *fel, *pel;
|
2012-11-15 08:37:01 +01:00
|
|
|
FcValue v;
|
2002-03-03 19:39:05 +01:00
|
|
|
FcResult result;
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2012-02-21 07:29:56 +01:00
|
|
|
assert (pat != NULL);
|
|
|
|
assert (font != NULL);
|
|
|
|
|
2002-03-03 19:39:05 +01:00
|
|
|
new = FcPatternCreate ();
|
|
|
|
if (!new)
|
2012-11-15 08:37:01 +01:00
|
|
|
return NULL;
|
2002-03-03 19:39:05 +01:00
|
|
|
for (i = 0; i < font->num; i++)
|
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
fe = &FcPatternElts(font)[i];
|
2012-03-26 09:34:34 +02:00
|
|
|
if (fe->object == FC_FAMILYLANG_OBJECT ||
|
|
|
|
fe->object == FC_STYLELANG_OBJECT ||
|
|
|
|
fe->object == FC_FULLNAMELANG_OBJECT)
|
|
|
|
{
|
|
|
|
/* ignore those objects. we need to deal with them
|
|
|
|
* another way */
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (fe->object == FC_FAMILY_OBJECT ||
|
|
|
|
fe->object == FC_STYLE_OBJECT ||
|
|
|
|
fe->object == FC_FULLNAME_OBJECT)
|
|
|
|
{
|
|
|
|
FC_ASSERT_STATIC ((FC_FAMILY_OBJECT + 1) == FC_FAMILYLANG_OBJECT);
|
|
|
|
FC_ASSERT_STATIC ((FC_STYLE_OBJECT + 1) == FC_STYLELANG_OBJECT);
|
|
|
|
FC_ASSERT_STATIC ((FC_FULLNAME_OBJECT + 1) == FC_FULLNAMELANG_OBJECT);
|
|
|
|
|
|
|
|
fel = FcPatternObjectFindElt (font, fe->object + 1);
|
|
|
|
pel = FcPatternObjectFindElt (pat, fe->object + 1);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
fel = NULL;
|
|
|
|
pel = NULL;
|
|
|
|
}
|
2006-08-30 13:16:22 +02:00
|
|
|
pe = FcPatternObjectFindElt (pat, fe->object);
|
2002-03-03 19:39:05 +01:00
|
|
|
if (pe)
|
|
|
|
{
|
2012-03-26 09:34:34 +02:00
|
|
|
const FcMatcher *match = FcObjectToMatcher (pe->object, FcFalse);
|
|
|
|
|
|
|
|
if (!FcCompareValueList (pe->object, match,
|
|
|
|
FcPatternEltValues(pe),
|
|
|
|
FcPatternEltValues(fe), &v, NULL, NULL, &result))
|
2002-03-03 19:39:05 +01:00
|
|
|
{
|
|
|
|
FcPatternDestroy (new);
|
2012-11-15 08:37:01 +01:00
|
|
|
return NULL;
|
2002-03-03 19:39:05 +01:00
|
|
|
}
|
2012-03-26 09:34:34 +02:00
|
|
|
if (fel && pel)
|
|
|
|
{
|
|
|
|
int n = 1, j;
|
2012-11-15 08:37:01 +01:00
|
|
|
FcValueListPtr l1, l2, ln = NULL, ll = NULL;
|
2012-03-26 09:34:34 +02:00
|
|
|
|
|
|
|
match = FcObjectToMatcher (pel->object, FcTrue);
|
|
|
|
if (!FcCompareValueList (pel->object, match,
|
|
|
|
FcPatternEltValues (pel),
|
2012-11-15 08:37:01 +01:00
|
|
|
FcPatternEltValues (fel), NULL, NULL, &n, &result))
|
2012-03-26 09:34:34 +02:00
|
|
|
{
|
|
|
|
FcPatternDestroy (new);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-11-15 08:37:01 +01:00
|
|
|
for (j = 0, l1 = FcPatternEltValues (fe), l2 = FcPatternEltValues (fel);
|
|
|
|
l1 != NULL || l2 != NULL;
|
|
|
|
j++, l1 = l1 ? FcValueListNext (l1) : NULL, l2 = l2 ? FcValueListNext (l2) : NULL)
|
|
|
|
{
|
|
|
|
if (j == n)
|
|
|
|
{
|
|
|
|
if (l1)
|
|
|
|
ln = FcValueListPrepend (ln,
|
|
|
|
FcValueCanonicalize (&l1->value),
|
|
|
|
FcValueBindingStrong);
|
|
|
|
if (l2)
|
|
|
|
ll = FcValueListPrepend (ll,
|
|
|
|
FcValueCanonicalize (&l2->value),
|
|
|
|
FcValueBindingStrong);
|
|
|
|
}
|
2012-03-26 09:34:34 +02:00
|
|
|
else
|
2012-11-15 08:37:01 +01:00
|
|
|
{
|
|
|
|
if (l1)
|
|
|
|
ln = FcValueListAppend (ln,
|
|
|
|
FcValueCanonicalize (&l1->value),
|
|
|
|
FcValueBindingStrong);
|
|
|
|
if (l2)
|
|
|
|
ll = FcValueListAppend (ll,
|
|
|
|
FcValueCanonicalize (&l2->value),
|
|
|
|
FcValueBindingStrong);
|
|
|
|
}
|
2012-03-26 09:34:34 +02:00
|
|
|
}
|
2012-11-15 08:37:01 +01:00
|
|
|
FcPatternObjectListAdd (new, fe->object, ln, FcFalse);
|
|
|
|
FcPatternObjectListAdd (new, fel->object, ll, FcFalse);
|
|
|
|
|
|
|
|
continue;
|
2012-03-26 09:34:34 +02:00
|
|
|
}
|
|
|
|
else if (fel)
|
|
|
|
{
|
2012-11-15 08:37:01 +01:00
|
|
|
FcValueListPtr l1, l2;
|
|
|
|
|
|
|
|
copy_lang:
|
|
|
|
l1 = FcValueListDuplicate (FcPatternEltValues (fe));
|
|
|
|
l2 = FcValueListDuplicate (FcPatternEltValues (fel));
|
|
|
|
FcPatternObjectListAdd (new, fe->object, l1, FcFalse);
|
|
|
|
FcPatternObjectListAdd (new, fel->object, l2, FcFalse);
|
|
|
|
|
|
|
|
continue;
|
2012-03-26 09:34:34 +02:00
|
|
|
}
|
2002-03-03 19:39:05 +01:00
|
|
|
}
|
|
|
|
else
|
2012-03-26 09:34:34 +02:00
|
|
|
{
|
|
|
|
if (fel)
|
2012-11-15 08:37:01 +01:00
|
|
|
goto copy_lang;
|
|
|
|
v = FcValueCanonicalize(&FcPatternEltValues (fe)->value);
|
2012-03-26 09:34:34 +02:00
|
|
|
}
|
2006-08-30 13:16:22 +02:00
|
|
|
FcPatternObjectAdd (new, fe->object, v, FcFalse);
|
2002-03-03 19:39:05 +01:00
|
|
|
}
|
|
|
|
for (i = 0; i < pat->num; i++)
|
|
|
|
{
|
2006-08-30 13:16:22 +02:00
|
|
|
pe = &FcPatternElts(pat)[i];
|
|
|
|
fe = FcPatternObjectFindElt (font, pe->object);
|
2013-03-07 05:19:50 +01:00
|
|
|
if (!fe &&
|
|
|
|
pe->object != FC_FAMILYLANG_OBJECT &&
|
|
|
|
pe->object != FC_STYLELANG_OBJECT &&
|
|
|
|
pe->object != FC_FULLNAMELANG_OBJECT)
|
2006-08-30 13:16:22 +02:00
|
|
|
{
|
2013-01-14 21:36:38 +01:00
|
|
|
FcPatternObjectListAdd (new, pe->object,
|
|
|
|
FcValueListDuplicate (FcPatternEltValues(pe)),
|
2013-01-14 21:39:12 +01:00
|
|
|
FcFalse);
|
2006-08-30 13:16:22 +02:00
|
|
|
}
|
2002-03-03 19:39:05 +01:00
|
|
|
}
|
2005-11-01 07:57:25 +01:00
|
|
|
|
2002-08-19 21:32:05 +02:00
|
|
|
FcConfigSubstituteWithPat (config, new, pat, FcMatchFont);
|
2002-03-03 19:39:05 +01:00
|
|
|
return new;
|
|
|
|
}
|
|
|
|
|
2009-01-01 02:16:40 +01:00
|
|
|
static FcPattern *
|
2012-12-30 04:32:56 +01:00
|
|
|
FcFontSetMatchInternal (FcFontSet **sets,
|
2009-01-01 02:16:40 +01:00
|
|
|
int nsets,
|
|
|
|
FcPattern *p,
|
|
|
|
FcResult *result)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2013-02-06 11:02:07 +01:00
|
|
|
double score[PRI_END], bestscore[PRI_END];
|
2002-02-15 00:34:13 +01:00
|
|
|
int f;
|
|
|
|
FcFontSet *s;
|
|
|
|
FcPattern *best;
|
2006-08-28 20:51:12 +02:00
|
|
|
int i;
|
2002-03-03 19:39:05 +01:00
|
|
|
int set;
|
2002-02-15 00:34:13 +01:00
|
|
|
|
2013-02-06 11:02:07 +01:00
|
|
|
for (i = 0; i < PRI_END; i++)
|
2006-08-28 20:51:12 +02:00
|
|
|
bestscore[i] = 0;
|
|
|
|
best = 0;
|
2002-02-15 00:34:13 +01:00
|
|
|
if (FcDebug () & FC_DBG_MATCH)
|
|
|
|
{
|
|
|
|
printf ("Match ");
|
|
|
|
FcPatternPrint (p);
|
|
|
|
}
|
2006-08-28 20:51:12 +02:00
|
|
|
for (set = 0; set < nsets; set++)
|
2002-02-15 00:34:13 +01:00
|
|
|
{
|
2006-08-28 20:51:12 +02:00
|
|
|
s = sets[set];
|
|
|
|
if (!s)
|
2002-02-15 00:34:13 +01:00
|
|
|
continue;
|
2006-08-28 20:51:12 +02:00
|
|
|
for (f = 0; f < s->nfont; f++)
|
2006-01-08 11:58:30 +01:00
|
|
|
{
|
|
|
|
if (FcDebug () & FC_DBG_MATCHV)
|
|
|
|
{
|
2006-08-28 20:51:12 +02:00
|
|
|
printf ("Font %d ", f);
|
|
|
|
FcPatternPrint (s->fonts[f]);
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
2006-08-28 20:51:12 +02:00
|
|
|
if (!FcCompare (p, s->fonts[f], score, result))
|
|
|
|
return 0;
|
|
|
|
if (FcDebug () & FC_DBG_MATCHV)
|
2006-01-08 11:58:30 +01:00
|
|
|
{
|
2006-08-28 20:51:12 +02:00
|
|
|
printf ("Score");
|
2013-02-06 11:02:07 +01:00
|
|
|
for (i = 0; i < PRI_END; i++)
|
2006-01-08 11:58:30 +01:00
|
|
|
{
|
2006-08-28 20:51:12 +02:00
|
|
|
printf (" %g", score[i]);
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
2006-08-28 20:51:12 +02:00
|
|
|
printf ("\n");
|
2006-01-08 11:58:30 +01:00
|
|
|
}
|
2013-02-06 11:02:07 +01:00
|
|
|
for (i = 0; i < PRI_END; i++)
|
2006-01-08 11:58:30 +01:00
|
|
|
{
|
2006-08-28 20:51:12 +02:00
|
|
|
if (best && bestscore[i] < score[i])
|
|
|
|
break;
|
|
|
|
if (!best || score[i] < bestscore[i])
|
|
|
|
{
|
2013-02-06 11:02:07 +01:00
|
|
|
for (i = 0; i < PRI_END; i++)
|
2006-08-28 20:51:12 +02:00
|
|
|
bestscore[i] = score[i];
|
|
|
|
best = s->fonts[f];
|
|
|
|
break;
|
|
|
|
}
|
2006-01-08 11:58:30 +01:00
|
|
|
}
|
|
|
|
}
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
2006-08-28 20:51:12 +02:00
|
|
|
if (FcDebug () & FC_DBG_MATCH)
|
2005-11-28 11:54:11 +01:00
|
|
|
{
|
2006-08-28 20:51:12 +02:00
|
|
|
printf ("Best score");
|
2013-02-06 11:02:07 +01:00
|
|
|
for (i = 0; i < PRI_END; i++)
|
2006-08-28 20:51:12 +02:00
|
|
|
printf (" %g", bestscore[i]);
|
2009-01-01 00:10:31 +01:00
|
|
|
printf ("\n");
|
2005-11-28 11:54:11 +01:00
|
|
|
FcPatternPrint (best);
|
|
|
|
}
|
2012-03-22 11:15:27 +01:00
|
|
|
/* assuming that 'result' is initialized with FcResultNoMatch
|
|
|
|
* outside this function */
|
|
|
|
if (best)
|
|
|
|
*result = FcResultMatch;
|
|
|
|
|
2009-01-01 02:16:40 +01:00
|
|
|
return best;
|
|
|
|
}
|
|
|
|
|
|
|
|
FcPattern *
|
|
|
|
FcFontSetMatch (FcConfig *config,
|
|
|
|
FcFontSet **sets,
|
|
|
|
int nsets,
|
|
|
|
FcPattern *p,
|
|
|
|
FcResult *result)
|
|
|
|
{
|
|
|
|
FcPattern *best;
|
|
|
|
|
2012-02-21 07:29:56 +01:00
|
|
|
assert (sets != NULL);
|
|
|
|
assert (p != NULL);
|
|
|
|
assert (result != NULL);
|
|
|
|
|
2012-03-22 11:15:27 +01:00
|
|
|
*result = FcResultNoMatch;
|
|
|
|
|
2009-01-01 02:16:40 +01:00
|
|
|
if (!config)
|
|
|
|
{
|
|
|
|
config = FcConfigGetCurrent ();
|
|
|
|
if (!config)
|
|
|
|
return 0;
|
|
|
|
}
|
2012-12-30 04:32:56 +01:00
|
|
|
best = FcFontSetMatchInternal (sets, nsets, p, result);
|
2009-01-23 20:17:08 +01:00
|
|
|
if (best)
|
|
|
|
return FcFontRenderPrepare (config, p, best);
|
|
|
|
else
|
|
|
|
return NULL;
|
2002-02-15 00:34:13 +01:00
|
|
|
}
|
2002-02-28 17:51:48 +01:00
|
|
|
|
|
|
|
FcPattern *
|
|
|
|
FcFontMatch (FcConfig *config,
|
2010-04-12 18:18:50 +02:00
|
|
|
FcPattern *p,
|
2002-02-28 17:51:48 +01:00
|
|
|
FcResult *result)
|
|
|
|
{
|
|
|
|
FcFontSet *sets[2];
|
|
|
|
int nsets;
|
2009-01-01 02:16:40 +01:00
|
|
|
FcPattern *best;
|
2002-02-28 17:51:48 +01:00
|
|
|
|
2012-02-21 07:29:56 +01:00
|
|
|
assert (p != NULL);
|
|
|
|
assert (result != NULL);
|
|
|
|
|
2012-03-22 11:15:27 +01:00
|
|
|
*result = FcResultNoMatch;
|
|
|
|
|
2002-02-28 17:51:48 +01:00
|
|
|
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];
|
2009-01-01 02:16:40 +01:00
|
|
|
|
2012-12-30 04:32:56 +01:00
|
|
|
best = FcFontSetMatchInternal (sets, nsets, p, result);
|
2009-01-23 20:17:08 +01:00
|
|
|
if (best)
|
|
|
|
return FcFontRenderPrepare (config, p, best);
|
|
|
|
else
|
|
|
|
return NULL;
|
2002-02-28 17:51:48 +01:00
|
|
|
}
|
2002-03-03 19:39:05 +01:00
|
|
|
|
|
|
|
typedef struct _FcSortNode {
|
|
|
|
FcPattern *pattern;
|
2013-02-06 11:02:07 +01:00
|
|
|
double score[PRI_END];
|
2002-03-03 19:39:05 +01:00
|
|
|
} FcSortNode;
|
|
|
|
|
2002-05-22 06:37:07 +02:00
|
|
|
static int
|
|
|
|
FcSortCompare (const void *aa, const void *ab)
|
2002-03-03 19:39:05 +01:00
|
|
|
{
|
2002-05-22 06:37:07 +02:00
|
|
|
FcSortNode *a = *(FcSortNode **) aa;
|
|
|
|
FcSortNode *b = *(FcSortNode **) ab;
|
2002-05-30 00:07:33 +02:00
|
|
|
double *as = &a->score[0];
|
|
|
|
double *bs = &b->score[0];
|
2002-06-02 23:07:57 +02:00
|
|
|
double ad = 0, bd = 0;
|
2002-05-22 06:37:07 +02:00
|
|
|
int i;
|
2002-03-03 19:39:05 +01:00
|
|
|
|
2013-02-06 11:02:07 +01:00
|
|
|
i = PRI_END;
|
2002-05-30 00:07:33 +02:00
|
|
|
while (i-- && (ad = *as++) == (bd = *bs++))
|
|
|
|
;
|
|
|
|
return ad < bd ? -1 : ad > bd ? 1 : 0;
|
2002-03-03 19:39:05 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static FcBool
|
2009-01-27 09:35:51 +01:00
|
|
|
FcSortWalk (FcSortNode **n, int nnode, FcFontSet *fs, FcCharSet **csp, FcBool trim)
|
2002-03-03 19:39:05 +01:00
|
|
|
{
|
2009-01-27 09:35:51 +01:00
|
|
|
FcBool ret = FcFalse;
|
|
|
|
FcCharSet *cs;
|
|
|
|
|
|
|
|
cs = 0;
|
|
|
|
if (trim || csp)
|
|
|
|
{
|
|
|
|
cs = FcCharSetCreate ();
|
|
|
|
if (cs == NULL)
|
|
|
|
goto bail;
|
|
|
|
}
|
2002-05-22 06:37:07 +02:00
|
|
|
|
|
|
|
while (nnode--)
|
2002-03-03 19:39:05 +01:00
|
|
|
{
|
2009-01-27 09:35:51 +01:00
|
|
|
FcSortNode *node = *n++;
|
|
|
|
FcBool adds_chars = FcFalse;
|
2008-09-23 00:51:11 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Only fetch node charset if we'd need it
|
|
|
|
*/
|
2009-01-27 09:35:51 +01:00
|
|
|
if (cs)
|
2008-09-23 00:51:11 +02:00
|
|
|
{
|
2009-01-27 09:35:51 +01:00
|
|
|
FcCharSet *ncs;
|
|
|
|
|
2008-09-23 00:51:11 +02:00
|
|
|
if (FcPatternGetCharSet (node->pattern, FC_CHARSET, 0, &ncs) !=
|
|
|
|
FcResultMatch)
|
|
|
|
continue;
|
2009-01-27 09:35:51 +01:00
|
|
|
|
|
|
|
if (!FcCharSetMerge (cs, ncs, &adds_chars))
|
|
|
|
goto bail;
|
2008-09-23 00:51:11 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If this font isn't a subset of the previous fonts,
|
|
|
|
* add it to the list
|
|
|
|
*/
|
2009-01-27 09:35:51 +01:00
|
|
|
if (!trim || adds_chars)
|
2002-03-03 19:39:05 +01:00
|
|
|
{
|
2008-09-23 00:51:11 +02:00
|
|
|
FcPatternReference (node->pattern);
|
|
|
|
if (FcDebug () & FC_DBG_MATCHV)
|
|
|
|
{
|
|
|
|
printf ("Add ");
|
|
|
|
FcPatternPrint (node->pattern);
|
|
|
|
}
|
|
|
|
if (!FcFontSetAdd (fs, node->pattern))
|
|
|
|
{
|
|
|
|
FcPatternDestroy (node->pattern);
|
2009-01-27 09:35:51 +01:00
|
|
|
goto bail;
|
2002-03-03 19:39:05 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-01-27 09:35:51 +01:00
|
|
|
if (csp)
|
|
|
|
{
|
|
|
|
*csp = cs;
|
|
|
|
cs = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = FcTrue;
|
|
|
|
|
|
|
|
bail:
|
|
|
|
if (cs)
|
|
|
|
FcCharSetDestroy (cs);
|
|
|
|
|
|
|
|
return ret;
|
2002-03-03 19:39:05 +01:00
|
|
|
}
|
|
|
|
|
2002-05-29 10:21:33 +02:00
|
|
|
void
|
|
|
|
FcFontSetSortDestroy (FcFontSet *fs)
|
|
|
|
{
|
|
|
|
FcFontSetDestroy (fs);
|
|
|
|
}
|
|
|
|
|
2002-03-03 19:39:05 +01:00
|
|
|
FcFontSet *
|
2012-12-30 04:32:56 +01:00
|
|
|
FcFontSetSort (FcConfig *config FC_UNUSED,
|
2002-03-03 19:39:05 +01:00
|
|
|
FcFontSet **sets,
|
|
|
|
int nsets,
|
|
|
|
FcPattern *p,
|
|
|
|
FcBool trim,
|
|
|
|
FcCharSet **csp,
|
|
|
|
FcResult *result)
|
|
|
|
{
|
|
|
|
FcFontSet *ret;
|
|
|
|
FcFontSet *s;
|
|
|
|
FcSortNode *nodes;
|
2002-05-22 06:37:07 +02:00
|
|
|
FcSortNode **nodeps, **nodep;
|
2002-03-03 19:39:05 +01:00
|
|
|
int nnodes;
|
|
|
|
FcSortNode *new;
|
|
|
|
int set;
|
|
|
|
int f;
|
|
|
|
int i;
|
2004-12-14 01:12:25 +01:00
|
|
|
int nPatternLang;
|
|
|
|
FcBool *patternLangSat;
|
|
|
|
FcValue patternLang;
|
2002-03-03 19:39:05 +01:00
|
|
|
|
2012-02-21 07:29:56 +01:00
|
|
|
assert (sets != NULL);
|
|
|
|
assert (p != NULL);
|
|
|
|
assert (result != NULL);
|
|
|
|
|
|
|
|
/* There are some implementation that relying on the result of
|
|
|
|
* "result" to check if the return value of FcFontSetSort
|
|
|
|
* is valid or not.
|
|
|
|
* So we should initialize it to the conservative way since
|
|
|
|
* this function doesn't return NULL anymore.
|
|
|
|
*/
|
|
|
|
if (result)
|
|
|
|
*result = FcResultNoMatch;
|
|
|
|
|
2002-07-07 01:47:44 +02:00
|
|
|
if (FcDebug () & FC_DBG_MATCH)
|
|
|
|
{
|
|
|
|
printf ("Sort ");
|
|
|
|
FcPatternPrint (p);
|
|
|
|
}
|
2002-03-03 19:39:05 +01:00
|
|
|
nnodes = 0;
|
|
|
|
for (set = 0; set < nsets; set++)
|
|
|
|
{
|
|
|
|
s = sets[set];
|
|
|
|
if (!s)
|
|
|
|
continue;
|
|
|
|
nnodes += s->nfont;
|
|
|
|
}
|
|
|
|
if (!nnodes)
|
2012-02-21 07:29:56 +01:00
|
|
|
return FcFontSetCreate ();
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2004-12-14 01:12:25 +01:00
|
|
|
for (nPatternLang = 0;
|
|
|
|
FcPatternGet (p, FC_LANG, nPatternLang, &patternLang) == FcResultMatch;
|
|
|
|
nPatternLang++)
|
|
|
|
;
|
|
|
|
|
2002-09-01 00:17:32 +02:00
|
|
|
/* freed below */
|
2010-04-12 18:18:50 +02:00
|
|
|
nodes = malloc (nnodes * sizeof (FcSortNode) +
|
2004-12-14 01:12:25 +01:00
|
|
|
nnodes * sizeof (FcSortNode *) +
|
|
|
|
nPatternLang * sizeof (FcBool));
|
2002-03-03 19:39:05 +01:00
|
|
|
if (!nodes)
|
|
|
|
goto bail0;
|
2002-05-29 10:21:33 +02:00
|
|
|
nodeps = (FcSortNode **) (nodes + nnodes);
|
2004-12-14 01:12:25 +01:00
|
|
|
patternLangSat = (FcBool *) (nodeps + nnodes);
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2002-03-03 19:39:05 +01:00
|
|
|
new = nodes;
|
2002-05-22 06:37:07 +02:00
|
|
|
nodep = nodeps;
|
2002-03-03 19:39:05 +01:00
|
|
|
for (set = 0; set < nsets; set++)
|
|
|
|
{
|
|
|
|
s = sets[set];
|
|
|
|
if (!s)
|
|
|
|
continue;
|
|
|
|
for (f = 0; f < s->nfont; f++)
|
|
|
|
{
|
|
|
|
if (FcDebug () & FC_DBG_MATCHV)
|
|
|
|
{
|
|
|
|
printf ("Font %d ", f);
|
|
|
|
FcPatternPrint (s->fonts[f]);
|
|
|
|
}
|
|
|
|
new->pattern = s->fonts[f];
|
|
|
|
if (!FcCompare (p, new->pattern, new->score, result))
|
|
|
|
goto bail1;
|
|
|
|
if (FcDebug () & FC_DBG_MATCHV)
|
|
|
|
{
|
|
|
|
printf ("Score");
|
2013-02-06 11:02:07 +01:00
|
|
|
for (i = 0; i < PRI_END; i++)
|
2002-03-03 19:39:05 +01:00
|
|
|
{
|
|
|
|
printf (" %g", new->score[i]);
|
|
|
|
}
|
|
|
|
printf ("\n");
|
|
|
|
}
|
2002-05-22 06:37:07 +02:00
|
|
|
*nodep = new;
|
2002-03-03 19:39:05 +01:00
|
|
|
new++;
|
2002-05-22 06:37:07 +02:00
|
|
|
nodep++;
|
2002-03-03 19:39:05 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-05-22 06:37:07 +02:00
|
|
|
nnodes = new - nodes;
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2002-05-29 10:21:33 +02:00
|
|
|
qsort (nodeps, nnodes, sizeof (FcSortNode *),
|
2002-05-22 06:37:07 +02:00
|
|
|
FcSortCompare);
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2004-12-14 01:12:25 +01:00
|
|
|
for (i = 0; i < nPatternLang; i++)
|
|
|
|
patternLangSat[i] = FcFalse;
|
2010-04-12 18:18:50 +02:00
|
|
|
|
2004-12-14 01:12:25 +01:00
|
|
|
for (f = 0; f < nnodes; f++)
|
|
|
|
{
|
|
|
|
FcBool satisfies = FcFalse;
|
|
|
|
/*
|
|
|
|
* If this node matches any language, go check
|
|
|
|
* which ones and satisfy those entries
|
|
|
|
*/
|
2013-02-06 11:02:07 +01:00
|
|
|
if (nodeps[f]->score[PRI_LANG_STRONG] < 2000 ||
|
|
|
|
nodeps[f]->score[PRI_LANG_WEAK] < 2000)
|
2004-12-14 01:12:25 +01:00
|
|
|
{
|
|
|
|
for (i = 0; i < nPatternLang; i++)
|
|
|
|
{
|
|
|
|
FcValue nodeLang;
|
|
|
|
|
|
|
|
if (!patternLangSat[i] &&
|
|
|
|
FcPatternGet (p, FC_LANG, i, &patternLang) == FcResultMatch &&
|
|
|
|
FcPatternGet (nodeps[f]->pattern, FC_LANG, 0, &nodeLang) == FcResultMatch)
|
|
|
|
{
|
2005-11-25 04:00:51 +01:00
|
|
|
double compare = FcCompareLang (&patternLang, &nodeLang);
|
2004-12-14 01:12:25 +01:00
|
|
|
if (compare >= 0 && compare < 2)
|
|
|
|
{
|
|
|
|
if (FcDebug () & FC_DBG_MATCHV)
|
|
|
|
{
|
|
|
|
FcChar8 *family;
|
|
|
|
FcChar8 *style;
|
|
|
|
|
|
|
|
if (FcPatternGetString (nodeps[f]->pattern, FC_FAMILY, 0, &family) == FcResultMatch &&
|
|
|
|
FcPatternGetString (nodeps[f]->pattern, FC_STYLE, 0, &style) == FcResultMatch)
|
|
|
|
printf ("Font %s:%s matches language %d\n", family, style, i);
|
|
|
|
}
|
|
|
|
patternLangSat[i] = FcTrue;
|
|
|
|
satisfies = FcTrue;
|
2013-03-01 14:21:25 +01:00
|
|
|
/* adjust score to ensure it's not more than 10000.0
|
|
|
|
* which would means the lang didn't satisfy the requirements
|
|
|
|
*/
|
|
|
|
if (nodeps[f]->score[PRI_LANG_STRONG] > 10000.0)
|
|
|
|
nodeps[f]->score[PRI_LANG_STRONG] = 10000.0;
|
|
|
|
if (nodeps[f]->score[PRI_LANG_WEAK] > 10000.0)
|
|
|
|
nodeps[f]->score[PRI_LANG_WEAK] = 10000.0;
|
2004-12-14 01:12:25 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!satisfies)
|
2013-02-06 11:02:07 +01:00
|
|
|
{
|
|
|
|
nodeps[f]->score[PRI_LANG_STRONG] = 10000.0;
|
|
|
|
nodeps[f]->score[PRI_LANG_WEAK] = 10000.0;
|
|
|
|
}
|
2004-12-14 01:12:25 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Re-sort once the language issues have been settled
|
|
|
|
*/
|
|
|
|
qsort (nodeps, nnodes, sizeof (FcSortNode *),
|
|
|
|
FcSortCompare);
|
2002-05-22 06:37:07 +02:00
|
|
|
|
2002-03-03 19:39:05 +01:00
|
|
|
ret = FcFontSetCreate ();
|
|
|
|
if (!ret)
|
|
|
|
goto bail1;
|
|
|
|
|
2009-01-27 09:35:51 +01:00
|
|
|
if (!FcSortWalk (nodeps, nnodes, ret, csp, trim))
|
2002-03-03 19:39:05 +01:00
|
|
|
goto bail2;
|
|
|
|
|
2002-05-29 10:21:33 +02:00
|
|
|
free (nodes);
|
|
|
|
|
2006-08-31 03:50:58 +02:00
|
|
|
if (FcDebug() & FC_DBG_MATCH)
|
|
|
|
{
|
|
|
|
printf ("First font ");
|
|
|
|
FcPatternPrint (ret->fonts[0]);
|
|
|
|
}
|
2012-03-22 11:15:27 +01:00
|
|
|
if (ret->nfont > 0)
|
|
|
|
*result = FcResultMatch;
|
|
|
|
|
2002-03-03 19:39:05 +01:00
|
|
|
return ret;
|
|
|
|
|
|
|
|
bail2:
|
|
|
|
FcFontSetDestroy (ret);
|
|
|
|
bail1:
|
|
|
|
free (nodes);
|
|
|
|
bail0:
|
|
|
|
return 0;
|
|
|
|
}
|
2002-05-31 06:42:42 +02:00
|
|
|
|
|
|
|
FcFontSet *
|
|
|
|
FcFontSort (FcConfig *config,
|
2010-04-12 18:18:50 +02:00
|
|
|
FcPattern *p,
|
2002-05-31 06:42:42 +02:00
|
|
|
FcBool trim,
|
|
|
|
FcCharSet **csp,
|
|
|
|
FcResult *result)
|
|
|
|
{
|
|
|
|
FcFontSet *sets[2];
|
|
|
|
int nsets;
|
|
|
|
|
2012-02-21 07:29:56 +01:00
|
|
|
assert (p != NULL);
|
|
|
|
assert (result != NULL);
|
|
|
|
|
2012-03-22 11:15:27 +01:00
|
|
|
*result = FcResultNoMatch;
|
|
|
|
|
2002-05-31 06:42:42 +02:00
|
|
|
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 FcFontSetSort (config, sets, nsets, p, trim, csp, result);
|
|
|
|
}
|
2006-09-05 11:24:01 +02:00
|
|
|
#define __fcmatch__
|
|
|
|
#include "fcaliastail.h"
|
|
|
|
#undef __fcmatch__
|