* PERFORMANCE OF THIS SOFTWARE.
*/
+#include "fcint.h"
#include <string.h>
#include <ctype.h>
-#include "fcint.h"
#include <stdio.h>
static double
FcMatcher *weak_matchers[NUM_MATCH_VALUES];
FcPatternElt *pat_elts[NUM_MATCH_VALUES];
int pat_elt;
- FcBool *match_blocked;
+ int *match_blocked;
int block_start;
if (!nsets || !sets || !p)
fonts_left = nfonts;
- match_blocked = (FcBool*)calloc(nfonts, sizeof(FcBool));
+ match_blocked = (int*)calloc(nfonts, sizeof(int));
/* Find out all necessary matchers first, so we don't need to find them
* in every loop.
int cand_elt;
FcPatternElt *cand_elts;
- if (match_blocked[f + sets_offset[set]])
+ if (match_blocked[f + sets_offset[set]] == 1)
continue;
score = 1e99;
}
}
+ /* We had no matching, just try the next one */
+ if (score == 1e99)
+ {
+ match_blocked[f + sets_offset[set]] = 2;
+ continue;
+ }
+ match_blocked[f + sets_offset[set]] = 0;
/* If there's a previous champion, and current score
* beats previous best score, on this element, then
* knock out the previous champion and anything
for (b = block_start; b < f + sets_offset[set]; ++b)
if (!match_blocked[b])
{
- match_blocked[b] = FcTrue;
+ match_blocked[b] = 1;
--fonts_left;
}
}
bestscore = score;
best = s->fonts[f];
- block_start = f + sets_offset[set];
+ /* This kills too many fonts, unfortunately. */
+ /* block_start = f + sets_offset[set]; */
}
/* If f loses, then it's out too. */
if (best && score > bestscore)
{
- match_blocked[f + sets_offset[set]] = FcTrue;
+ match_blocked[f + sets_offset[set]] = 1;
--fonts_left;
}
}
static FcBool
-FcSortWalk (FcSortNode **n, int nnode, FcFontSet *fs, FcCharSet **cs, FcBool trim)
+FcSortWalk (FcSortNode **n, int nnode, FcFontSet *fs, FcCharSet **cs, FcBool trim, FcBool build_cs)
{
FcCharSet *ncs;
FcSortNode *node;
*/
if (!trim || !*cs || !FcCharSetIsSubset (ncs, *cs))
{
- if (*cs)
- {
- ncs = FcCharSetUnion (ncs, *cs);
- if (!ncs)
- return FcFalse;
- FcCharSetDestroy (*cs);
- }
- else
- ncs = FcCharSetCopy (ncs);
- *cs = ncs;
+ if (trim || build_cs)
+ {
+ if (*cs)
+ {
+ ncs = FcCharSetUnion (ncs, *cs);
+ if (!ncs)
+ return FcFalse;
+ FcCharSetDestroy (*cs);
+ }
+ else
+ ncs = FcCharSetCopy (ncs);
+ *cs = ncs;
+ }
+
FcPatternReference (node->pattern);
if (FcDebug () & FC_DBG_MATCH)
{
cs = 0;
- if (!FcSortWalk (nodeps, nnodes, ret, &cs, trim))
+ if (!FcSortWalk (nodeps, nnodes, ret, &cs, trim, (csp!=0)))
goto bail2;
if (csp)
*csp = cs;
else
- FcCharSetDestroy (cs);
+ {
+ if (cs)
+ FcCharSetDestroy (cs);
+ }
free (nodes);