src/fcmatch.c

   1 /*
   2  * fontconfig/src/fcmatch.c
   3  *
   4  * Copyright © 2000 Keith Packard
   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 "fcint.h"
  26 #include <string.h>
  27 #include <ctype.h>
  28 #include <stdio.h>
  29
  30 static double
  31 FcCompareNumber (FcValue *value1, FcValue *value2)
  32 {
  33     double  v1, v2, v;
  34
  35     switch (value1->type) {
  36     case FcTypeInteger:
  37         v1 = (double) value1->u.i;
  38         break;
  39     case FcTypeDouble:
  40         v1 = value1->u.d;
  41         break;
  42     default:
  43         return -1.0;
  44     }
  45     switch (value2->type) {
  46     case FcTypeInteger:
  47         v2 = (double) value2->u.i;
  48         break;
  49     case FcTypeDouble:
  50         v2 = value2->u.d;
  51         break;
  52     default:
  53         return -1.0;
  54     }
  55     v = v2 - v1;
  56     if (v < 0)
  57         v = -v;
  58     return v;
  59 }
  60
  61 static double
  62 FcCompareString (FcValue *v1, FcValue *v2)
  63 {
  64     return (double) FcStrCmpIgnoreCase (fc_value_string(v1), fc_value_string(v2)) != 0;
  65 }
  66
  67 static double
  68 FcCompareFamily (FcValue *v1, FcValue *v2)
  69 {
  70     /* rely on the guarantee in FcPatternAddWithBinding that
  71      * families are always FcTypeString. */
  72     const FcChar8* v1_string = fc_value_string(v1);
  73     const FcChar8* v2_string = fc_value_string(v2);
  74
  75     if (FcToLower(*v1_string) != FcToLower(*v2_string) &&
  76         *v1_string != ' ' && *v2_string != ' ')
  77        return 1.0;
  78
  79     return (double) FcStrCmpIgnoreBlanksAndCase (v1_string, v2_string) != 0;
  80 }
  81
  82 static double
  83 FcCompareLang (FcValue *v1, FcValue *v2)
  84 {
  85     FcLangResult    result;
  86     FcValue value1 = FcValueCanonicalize(v1), value2 = FcValueCanonicalize(v2);
  87
  88     switch (value1.type) {
  89     case FcTypeLangSet:
  90         switch (value2.type) {
  91         case FcTypeLangSet:
  92             result = FcLangSetCompare (value1.u.l, value2.u.l);
  93             break;
  94         case FcTypeString:
  95             result = FcLangSetHasLang (value1.u.l,
  96                                        value2.u.s);
  97             break;
  98         default:
  99             return -1.0;
 100         }
 101         break;
 102     case FcTypeString:
 103         switch (value2.type) {
 104         case FcTypeLangSet:
 105             result = FcLangSetHasLang (value2.u.l, value1.u.s);
 106             break;
 107         case FcTypeString:
 108             result = FcLangCompare (value1.u.s,
 109                                     value2.u.s);
 110             break;
 111         default:
 112             return -1.0;
 113         }
 114         break;
 115     default:
 116         return -1.0;
 117     }
 118     switch (result) {
 119     case FcLangEqual:
 120         return 0;
 121     case FcLangDifferentCountry:
 122         return 1;
 123     case FcLangDifferentLang:
 124     default:
 125         return 2;
 126     }
 127 }
 128
 129 static double
 130 FcCompareBool (FcValue *v1, FcValue *v2)
 131 {
 132     if (fc_storage_type(v2) != FcTypeBool || fc_storage_type(v1) != FcTypeBool)
 133         return -1.0;
 134     return (double) v2->u.b != v1->u.b;
 135 }
 136
 137 static double
 138 FcCompareCharSet (FcValue *v1, FcValue *v2)
 139 {
 140     return (double) FcCharSetSubtractCount (fc_value_charset(v1), fc_value_charset(v2));
 141 }
 142
 143 static double
 144 FcCompareSize (FcValue *value1, FcValue *value2)
 145 {
 146     double  v1, v2, v;
 147
 148     switch (value1->type) {
 149     case FcTypeInteger:
 150         v1 = value1->u.i;
 151         break;
 152     case FcTypeDouble:
 153         v1 = value1->u.d;
 154         break;
 155     default:
 156         return -1;
 157     }
 158     switch (value2->type) {
 159     case FcTypeInteger:
 160         v2 = value2->u.i;
 161         break;
 162     case FcTypeDouble:
 163         v2 = value2->u.d;
 164         break;
 165     default:
 166         return -1;
 167     }
 168     if (v2 == 0)
 169         return 0;
 170     v = v2 - v1;
 171     if (v < 0)
 172         v = -v;
 173     return v;
 174 }
 175
 176 typedef struct _FcMatcher {
 177     FcObject        object;
 178     double          (*compare) (FcValue *value1, FcValue *value2);
 179     int             strong, weak;
 180 } FcMatcher;
 181
 182 /*
 183  * Order is significant, it defines the precedence of
 184  * each value, earlier values are more significant than
 185  * later values
 186  */
 187 static FcMatcher _FcMatchers [] = {
 188     { FC_FOUNDRY_OBJECT,        FcCompareString,        0, 0 },
 189 #define MATCH_FOUNDRY       0
 190 #define MATCH_FOUNDRY_INDEX 0
 191
 192     { FC_CHARSET_OBJECT,        FcCompareCharSet,       1, 1 },
 193 #define MATCH_CHARSET       1
 194 #define MATCH_CHARSET_INDEX 1
 195
 196     { FC_FAMILY_OBJECT,         FcCompareFamily,        2, 4 },
 197 #define MATCH_FAMILY        2
 198 #define MATCH_FAMILY_STRONG_INDEX   2
 199 #define MATCH_FAMILY_WEAK_INDEX     4
 200
 201     { FC_LANG_OBJECT,           FcCompareLang,  3, 3 },
 202 #define MATCH_LANG          3
 203 #define MATCH_LANG_INDEX    3
 204
 205     { FC_SPACING_OBJECT,        FcCompareNumber,        5, 5 },
 206 #define MATCH_SPACING       4
 207 #define MATCH_SPACING_INDEX 5
 208
 209     { FC_PIXEL_SIZE_OBJECT,     FcCompareSize,  6, 6 },
 210 #define MATCH_PIXEL_SIZE    5
 211 #define MATCH_PIXEL_SIZE_INDEX  6
 212
 213     { FC_STYLE_OBJECT,          FcCompareString,        7, 7 },
 214 #define MATCH_STYLE         6
 215 #define MATCH_STYLE_INDEX   7
 216
 217     { FC_SLANT_OBJECT,          FcCompareNumber,        8, 8 },
 218 #define MATCH_SLANT         7
 219 #define MATCH_SLANT_INDEX   8
 220
 221     { FC_WEIGHT_OBJECT,         FcCompareNumber,        9, 9 },
 222 #define MATCH_WEIGHT        8
 223 #define MATCH_WEIGHT_INDEX  9
 224
 225     { FC_WIDTH_OBJECT,          FcCompareNumber,        10, 10 },
 226 #define MATCH_WIDTH         9
 227 #define MATCH_WIDTH_INDEX   10
 228
 229     { FC_DECORATIVE_OBJECT,     FcCompareBool,          11, 11 },
 230 #define MATCH_DECORATIVE        10
 231 #define MATCH_DECORATIVE_INDEX  11
 232
 233     { FC_ANTIALIAS_OBJECT,      FcCompareBool,          12, 12 },
 234 #define MATCH_ANTIALIAS             11
 235 #define MATCH_ANTIALIAS_INDEX       12
 236
 237     { FC_RASTERIZER_OBJECT,     FcCompareString,        13, 13 },
 238 #define MATCH_RASTERIZER            12
 239 #define MATCH_RASTERIZER_INDEX      13
 240
 241     { FC_OUTLINE_OBJECT,        FcCompareBool,          14, 14 },
 242 #define MATCH_OUTLINE               13
 243 #define MATCH_OUTLINE_INDEX         14
 244
 245     { FC_FONTVERSION_OBJECT,    FcCompareNumber,        15, 15 },
 246 #define MATCH_FONTVERSION           14
 247 #define MATCH_FONTVERSION_INDEX     15
 248 };
 249
 250 #define NUM_MATCH_VALUES    16
 251
 252 static FcMatcher*
 253 FcObjectToMatcher (FcObject object)
 254 {
 255     int         i;
 256
 257     i = -1;
 258     switch (object) {
 259     case FC_FOUNDRY_OBJECT:
 260         i = MATCH_FOUNDRY; break;
 261     case FC_FONTVERSION_OBJECT:
 262         i = MATCH_FONTVERSION; break;
 263     case FC_FAMILY_OBJECT:
 264         i = MATCH_FAMILY; break;
 265     case FC_CHARSET_OBJECT:
 266         i = MATCH_CHARSET; break;
 267     case FC_ANTIALIAS_OBJECT:
 268         i = MATCH_ANTIALIAS; break;
 269     case FC_LANG_OBJECT:
 270         i = MATCH_LANG; break;
 271     case FC_SPACING_OBJECT:
 272         i = MATCH_SPACING; break;
 273     case FC_STYLE_OBJECT:
 274         i = MATCH_STYLE; break;
 275     case FC_SLANT_OBJECT:
 276         i = MATCH_SLANT; break;
 277     case FC_PIXEL_SIZE_OBJECT:
 278         i = MATCH_PIXEL_SIZE; break;
 279     case FC_WIDTH_OBJECT:
 280         i = MATCH_WIDTH; break;
 281     case FC_WEIGHT_OBJECT:
 282         i = MATCH_WEIGHT; break;
 283     case FC_RASTERIZER_OBJECT:
 284         i = MATCH_RASTERIZER; break;
 285     case FC_OUTLINE_OBJECT:
 286         i = MATCH_OUTLINE; break;
 287     case FC_DECORATIVE_OBJECT:
 288         i = MATCH_DECORATIVE; break;
 289     }
 290
 291     if (i < 0)
 292         return NULL;
 293
 294     return _FcMatchers+i;
 295 }
 296
 297 static FcBool
 298 FcCompareValueList (FcObject     object,
 299                     FcValueListPtr v1orig,      /* pattern */
 300                     FcValueListPtr v2orig,      /* target */
 301                     FcValue     *bestValue,
 302                     double      *value,
 303                     FcResult    *result)
 304 {
 305     FcValueListPtr  v1, v2;
 306     double          v, best, bestStrong, bestWeak;
 307     int             j;
 308     FcMatcher       *match = FcObjectToMatcher(object);
 309
 310     if (!match)
 311     {
 312         if (bestValue)
 313             *bestValue = FcValueCanonicalize(&v2orig->value);
 314         return FcTrue;
 315     }
 316
 317     best = 1e99;
 318     bestStrong = 1e99;
 319     bestWeak = 1e99;
 320     j = 0;
 321     for (v1 = v1orig; v1; v1 = FcValueListNext(v1))
 322     {
 323         for (v2 = v2orig; v2; v2 = FcValueListNext(v2))
 324         {
 325             v = (match->compare) (&v1->value, &v2->value);
 326             if (v < 0)
 327             {
 328                 *result = FcResultTypeMismatch;
 329                 return FcFalse;
 330             }
 331             v = v * 1000 + j;
 332             if (v < best)
 333             {
 334                 if (bestValue)
 335                     *bestValue = FcValueCanonicalize(&v2->value);
 336                 best = v;
 337             }
 338             if (v1->binding == FcValueBindingStrong)
 339             {
 340                 if (v < bestStrong)
 341                     bestStrong = v;
 342             }
 343             else
 344             {
 345                 if (v < bestWeak)
 346                     bestWeak = v;
 347             }
 348         }
 349         j++;
 350     }
 351     if (FcDebug () & FC_DBG_MATCHV)
 352     {
 353         printf (" %s: %g ", FcObjectName (object), best);
 354         FcValueListPrint (v1orig);
 355         printf (", ");
 356         FcValueListPrint (v2orig);
 357         printf ("\n");
 358     }
 359     if (value)
 360     {
 361         int weak    = match->weak;
 362         int strong  = match->strong;
 363         if (weak == strong)
 364             value[strong] += best;
 365         else
 366         {
 367             value[weak] += bestWeak;
 368             value[strong] += bestStrong;
 369         }
 370     }
 371     return FcTrue;
 372 }
 373
 374 /*
 375  * Return a value indicating the distance between the two lists of
 376  * values
 377  */
 378
 379 static FcBool
 380 FcCompare (FcPattern    *pat,
 381            FcPattern    *fnt,
 382            double       *value,
 383            FcResult     *result)
 384 {
 385     int             i, i1, i2;
 386
 387     for (i = 0; i < NUM_MATCH_VALUES; i++)
 388         value[i] = 0.0;
 389
 390     i1 = 0;
 391     i2 = 0;
 392     while (i1 < pat->num && i2 < fnt->num)
 393     {
 394         FcPatternElt *elt_i1 = &FcPatternElts(pat)[i1];
 395         FcPatternElt *elt_i2 = &FcPatternElts(fnt)[i2];
 396
 397         i = FcObjectCompare(elt_i1->object, elt_i2->object);
 398         if (i > 0)
 399             i2++;
 400         else if (i < 0)
 401             i1++;
 402         else
 403         {
 404             if (!FcCompareValueList (elt_i1->object,
 405                                      FcPatternEltValues(elt_i1),
 406                                      FcPatternEltValues(elt_i2),
 407                                      0, value, result))
 408                 return FcFalse;
 409             i1++;
 410             i2++;
 411         }
 412     }
 413     return FcTrue;
 414 }
 415
 416 FcPattern *
 417 FcFontRenderPrepare (FcConfig       *config,
 418                      FcPattern      *pat,
 419                      FcPattern      *font)
 420 {
 421     FcPattern       *new;
 422     int             i;
 423     FcPatternElt    *fe, *pe;
 424     FcValue         v;
 425     FcResult        result;
 426
 427     new = FcPatternCreate ();
 428     if (!new)
 429         return 0;
 430     for (i = 0; i < font->num; i++)
 431     {
 432         fe = &FcPatternElts(font)[i];
 433         pe = FcPatternObjectFindElt (pat, fe->object);
 434         if (pe)
 435         {
 436             if (!FcCompareValueList (pe->object, FcPatternEltValues(pe),
 437                                      FcPatternEltValues(fe), &v, 0, &result))
 438             {
 439                 FcPatternDestroy (new);
 440                 return 0;
 441             }
 442         }
 443         else
 444             v = FcValueCanonicalize(&FcPatternEltValues (fe)->value);
 445         FcPatternObjectAdd (new, fe->object, v, FcFalse);
 446     }
 447     for (i = 0; i < pat->num; i++)
 448     {
 449         pe = &FcPatternElts(pat)[i];
 450         fe = FcPatternObjectFindElt (font, pe->object);
 451         if (!fe)
 452         {
 453             v = FcValueCanonicalize(&FcPatternEltValues(pe)->value);
 454             FcPatternObjectAdd (new, pe->object, v, FcTrue);
 455         }
 456     }
 457
 458     FcConfigSubstituteWithPat (config, new, pat, FcMatchFont);
 459     return new;
 460 }
 461
 462 FcPattern *
 463 FcFontSetMatch (FcConfig    *config,
 464                 FcFontSet   **sets,
 465                 int         nsets,
 466                 FcPattern   *p,
 467                 FcResult    *result)
 468 {
 469     double          score[NUM_MATCH_VALUES], bestscore[NUM_MATCH_VALUES];
 470     int             f;
 471     FcFontSet       *s;
 472     FcPattern       *best;
 473     int             i;
 474     int             set;
 475
 476     for (i = 0; i < NUM_MATCH_VALUES; i++)
 477         bestscore[i] = 0;
 478     best = 0;
 479     if (FcDebug () & FC_DBG_MATCH)
 480     {
 481         printf ("Match ");
 482         FcPatternPrint (p);
 483     }
 484     if (!config)
 485     {
 486         config = FcConfigGetCurrent ();
 487         if (!config)
 488             return 0;
 489     }
 490     for (set = 0; set < nsets; set++)
 491     {
 492         s = sets[set];
 493         if (!s)
 494             continue;
 495         for (f = 0; f < s->nfont; f++)
 496         {
 497             if (FcDebug () & FC_DBG_MATCHV)
 498             {
 499                 printf ("Font %d ", f);
 500                 FcPatternPrint (s->fonts[f]);
 501             }
 502             if (!FcCompare (p, s->fonts[f], score, result))
 503                 return 0;
 504             if (FcDebug () & FC_DBG_MATCHV)
 505             {
 506                 printf ("Score");
 507                 for (i = 0; i < NUM_MATCH_VALUES; i++)
 508                 {
 509                     printf (" %g", score[i]);
 510                 }
 511                 printf ("\n");
 512             }
 513             for (i = 0; i < NUM_MATCH_VALUES; i++)
 514             {
 515                 if (best && bestscore[i] < score[i])
 516                     break;
 517                 if (!best || score[i] < bestscore[i])
 518                 {
 519                     for (i = 0; i < NUM_MATCH_VALUES; i++)
 520                         bestscore[i] = score[i];
 521                     best = s->fonts[f];
 522                     break;
 523                 }
 524             }
 525         }
 526     }
 527     if (FcDebug () & FC_DBG_MATCH)
 528     {
 529         printf ("Best score");
 530         for (i = 0; i < NUM_MATCH_VALUES; i++)
 531             printf (" %g", bestscore[i]);
 532         printf ("\n");
 533         FcPatternPrint (best);
 534     }
 535     if (!best)
 536     {
 537         *result = FcResultNoMatch;
 538         return 0;
 539     }
 540     return FcFontRenderPrepare (config, p, best);
 541 }
 542
 543 FcPattern *
 544 FcFontMatch (FcConfig   *config,
 545              FcPattern  *p,
 546              FcResult   *result)
 547 {
 548     FcFontSet   *sets[2];
 549     int         nsets;
 550
 551     if (!config)
 552     {
 553         config = FcConfigGetCurrent ();
 554         if (!config)
 555             return 0;
 556     }
 557     nsets = 0;
 558     if (config->fonts[FcSetSystem])
 559         sets[nsets++] = config->fonts[FcSetSystem];
 560     if (config->fonts[FcSetApplication])
 561         sets[nsets++] = config->fonts[FcSetApplication];
 562     return FcFontSetMatch (config, sets, nsets, p, result);
 563 }
 564
 565 typedef struct _FcSortNode {
 566     FcPattern   *pattern;
 567     double      score[NUM_MATCH_VALUES];
 568 } FcSortNode;
 569
 570 static int
 571 FcSortCompare (const void *aa, const void *ab)
 572 {
 573     FcSortNode  *a = *(FcSortNode **) aa;
 574     FcSortNode  *b = *(FcSortNode **) ab;
 575     double      *as = &a->score[0];
 576     double      *bs = &b->score[0];
 577     double      ad = 0, bd = 0;
 578     int         i;
 579
 580     i = NUM_MATCH_VALUES;
 581     while (i-- && (ad = *as++) == (bd = *bs++))
 582         ;
 583     return ad < bd ? -1 : ad > bd ? 1 : 0;
 584 }
 585
 586 static FcBool
 587 FcSortWalk (FcSortNode **n, int nnode, FcFontSet *fs, FcCharSet **cs, FcBool trim, FcBool build_cs)
 588 {
 589     FcCharSet   *ncs;
 590     FcSortNode  *node;
 591
 592     while (nnode--)
 593     {
 594         node = *n++;
 595
 596         /*
 597          * Only fetch node charset if we'd need it
 598          */
 599         if (trim || build_cs)
 600         {
 601             if (FcPatternGetCharSet (node->pattern, FC_CHARSET, 0, &ncs) !=
 602                 FcResultMatch)
 603                 continue;
 604         }
 605
 606         /*
 607          * If this font isn't a subset of the previous fonts,
 608          * add it to the list
 609          */
 610         if (!trim || !*cs || !FcCharSetIsSubset (ncs, *cs))
 611         {
 612             if (trim || build_cs)
 613             {
 614                 *cs = FcCharSetMerge (*cs, ncs);
 615                 if (*cs == NULL)
 616                     return FcFalse;
 617             }
 618
 619             FcPatternReference (node->pattern);
 620             if (FcDebug () & FC_DBG_MATCHV)
 621             {
 622                 printf ("Add ");
 623                 FcPatternPrint (node->pattern);
 624             }
 625             if (!FcFontSetAdd (fs, node->pattern))
 626             {
 627                 FcPatternDestroy (node->pattern);
 628                 return FcFalse;
 629             }
 630         }
 631     }
 632     return FcTrue;
 633 }
 634
 635 void
 636 FcFontSetSortDestroy (FcFontSet *fs)
 637 {
 638     FcFontSetDestroy (fs);
 639 }
 640
 641 FcFontSet *
 642 FcFontSetSort (FcConfig     *config,
 643                FcFontSet    **sets,
 644                int          nsets,
 645                FcPattern    *p,
 646                FcBool       trim,
 647                FcCharSet    **csp,
 648                FcResult     *result)
 649 {
 650     FcFontSet       *ret;
 651     FcFontSet       *s;
 652     FcSortNode      *nodes;
 653     FcSortNode      **nodeps, **nodep;
 654     int             nnodes;
 655     FcSortNode      *new;
 656     FcCharSet       *cs;
 657     int             set;
 658     int             f;
 659     int             i;
 660     int             nPatternLang;
 661     FcBool          *patternLangSat;
 662     FcValue         patternLang;
 663
 664     if (FcDebug () & FC_DBG_MATCH)
 665     {
 666         printf ("Sort ");
 667         FcPatternPrint (p);
 668     }
 669     nnodes = 0;
 670     for (set = 0; set < nsets; set++)
 671     {
 672         s = sets[set];
 673         if (!s)
 674             continue;
 675         nnodes += s->nfont;
 676     }
 677     if (!nnodes)
 678         goto bail0;
 679
 680     for (nPatternLang = 0;
 681          FcPatternGet (p, FC_LANG, nPatternLang, &patternLang) == FcResultMatch;
 682          nPatternLang++)
 683         ;
 684
 685     /* freed below */
 686     nodes = malloc (nnodes * sizeof (FcSortNode) +
 687                     nnodes * sizeof (FcSortNode *) +
 688                     nPatternLang * sizeof (FcBool));
 689     if (!nodes)
 690         goto bail0;
 691     nodeps = (FcSortNode **) (nodes + nnodes);
 692     patternLangSat = (FcBool *) (nodeps + nnodes);
 693
 694     new = nodes;
 695     nodep = nodeps;
 696     for (set = 0; set < nsets; set++)
 697     {
 698         s = sets[set];
 699         if (!s)
 700             continue;
 701         for (f = 0; f < s->nfont; f++)
 702         {
 703             if (FcDebug () & FC_DBG_MATCHV)
 704             {
 705                 printf ("Font %d ", f);
 706                 FcPatternPrint (s->fonts[f]);
 707             }
 708             new->pattern = s->fonts[f];
 709             if (!FcCompare (p, new->pattern, new->score, result))
 710                 goto bail1;
 711             if (FcDebug () & FC_DBG_MATCHV)
 712             {
 713                 printf ("Score");
 714                 for (i = 0; i < NUM_MATCH_VALUES; i++)
 715                 {
 716                     printf (" %g", new->score[i]);
 717                 }
 718                 printf ("\n");
 719             }
 720             *nodep = new;
 721             new++;
 722             nodep++;
 723         }
 724     }
 725
 726     nnodes = new - nodes;
 727
 728     qsort (nodeps, nnodes, sizeof (FcSortNode *),
 729            FcSortCompare);
 730
 731     for (i = 0; i < nPatternLang; i++)
 732         patternLangSat[i] = FcFalse;
 733
 734     for (f = 0; f < nnodes; f++)
 735     {
 736         FcBool  satisfies = FcFalse;
 737         /*
 738          * If this node matches any language, go check
 739          * which ones and satisfy those entries
 740          */
 741         if (nodeps[f]->score[MATCH_LANG_INDEX] < 200)
 742         {
 743             for (i = 0; i < nPatternLang; i++)
 744             {
 745                 FcValue     nodeLang;
 746
 747                 if (!patternLangSat[i] &&
 748                     FcPatternGet (p, FC_LANG, i, &patternLang) == FcResultMatch &&
 749                     FcPatternGet (nodeps[f]->pattern, FC_LANG, 0, &nodeLang) == FcResultMatch)
 750                 {
 751                     double  compare = FcCompareLang (&patternLang, &nodeLang);
 752                     if (compare >= 0 && compare < 2)
 753                     {
 754                         if (FcDebug () & FC_DBG_MATCHV)
 755                         {
 756                             FcChar8 *family;
 757                             FcChar8 *style;
 758
 759                             if (FcPatternGetString (nodeps[f]->pattern, FC_FAMILY, 0, &family) == FcResultMatch &&
 760                                 FcPatternGetString (nodeps[f]->pattern, FC_STYLE, 0, &style) == FcResultMatch)
 761                                 printf ("Font %s:%s matches language %d\n", family, style, i);
 762                         }
 763                         patternLangSat[i] = FcTrue;
 764                         satisfies = FcTrue;
 765                         break;
 766                     }
 767                 }
 768             }
 769         }
 770         if (!satisfies)
 771             nodeps[f]->score[MATCH_LANG_INDEX] = 10000.0;
 772     }
 773
 774     /*
 775      * Re-sort once the language issues have been settled
 776      */
 777     qsort (nodeps, nnodes, sizeof (FcSortNode *),
 778            FcSortCompare);
 779
 780     ret = FcFontSetCreate ();
 781     if (!ret)
 782         goto bail1;
 783
 784     cs = 0;
 785
 786     if (!FcSortWalk (nodeps, nnodes, ret, &cs, trim, (csp!=0)))
 787         goto bail2;
 788
 789     if (csp)
 790         *csp = cs;
 791     else
 792     {
 793         if (cs)
 794             FcCharSetDestroy (cs);
 795     }
 796
 797     free (nodes);
 798
 799     if (FcDebug() & FC_DBG_MATCH)
 800     {
 801         printf ("First font ");
 802         FcPatternPrint (ret->fonts[0]);
 803     }
 804     return ret;
 805
 806 bail2:
 807     if (cs)
 808         FcCharSetDestroy (cs);
 809     FcFontSetDestroy (ret);
 810 bail1:
 811     free (nodes);
 812 bail0:
 813     return 0;
 814 }
 815
 816 FcFontSet *
 817 FcFontSort (FcConfig    *config,
 818             FcPattern   *p,
 819             FcBool      trim,
 820             FcCharSet   **csp,
 821             FcResult    *result)
 822 {
 823     FcFontSet   *sets[2];
 824     int         nsets;
 825
 826     if (!config)
 827     {
 828         config = FcConfigGetCurrent ();
 829         if (!config)
 830             return 0;
 831     }
 832     nsets = 0;
 833     if (config->fonts[FcSetSystem])
 834         sets[nsets++] = config->fonts[FcSetSystem];
 835     if (config->fonts[FcSetApplication])
 836         sets[nsets++] = config->fonts[FcSetApplication];
 837     return FcFontSetSort (config, sets, nsets, p, trim, csp, result);
 838 }
 839 #define __fcmatch__
 840 #include "fcaliastail.h"
 841 #undef __fcmatch__