Lines Matching defs:leaf
92 * Search for the leaf containing with the specified num.
125 * Locate the leaf containing the specified char, return
150 FcCharLeaf *leaf,
218 leaves[pos] = FcPtrToOffset (leaves, leaf);
224 * Locate the leaf containing the specified char, creating it
232 FcCharLeaf *leaf;
238 leaf = calloc (1, sizeof (FcCharLeaf));
239 if (!leaf)
243 if (!FcCharSetPutLeaf (fcs, ucs4, leaf, pos))
245 free (leaf);
248 return leaf;
252 FcCharSetInsertLeaf (FcCharSet *fcs, FcChar32 ucs4, FcCharLeaf *leaf)
261 leaf);
265 return FcCharSetPutLeaf (fcs, ucs4, leaf, pos);
271 FcCharLeaf *leaf;
276 leaf = FcCharSetFindLeafCreate (fcs, ucs4);
277 if (!leaf)
279 b = &leaf->map[(ucs4 & 0xff) >> 5];
287 FcCharLeaf *leaf;
292 leaf = FcCharSetFindLeaf (fcs, ucs4);
293 if (!leaf)
295 b = &leaf->map[(ucs4 & 0xff) >> 5];
297 /* We don't bother removing the leaf if it's empty */
306 FcCharLeaf *leaf;
312 * Set iter->leaf to the leaf containing iter->ucs4 or higher
326 iter->leaf = 0;
331 iter->leaf = FcCharSetLeaf(fcs, pos);
342 iter->leaf = 0;
347 iter->leaf = FcCharSetLeaf(fcs, pos);
385 ai.leaf && bi.leaf;
391 if (ai.leaf->map[i] != bi.leaf->map[i])
394 return ai.leaf == bi.leaf;
400 FcCharLeaf *leaf)
405 *new = *leaf;
428 while ((ai.leaf || (bonly && bi.leaf)) && (bi.leaf || (aonly && ai.leaf)))
434 if (!FcCharSetAddLeaf (fcs, ai.ucs4, ai.leaf))
448 if (!FcCharSetAddLeaf (fcs, bi.ucs4, bi.leaf))
460 FcCharLeaf leaf;
462 if ((*overlap) (&leaf, ai.leaf, bi.leaf))
464 if (!FcCharSetAddLeaf (fcs, ai.ucs4, &leaf))
593 FcCharLeaf *leaf;
597 leaf = FcCharSetFindLeaf (fcs, ucs4);
598 if (!leaf)
600 return (leaf->map[(ucs4 & 0xff) >> 5] & (1U << (ucs4 & 0x1f))) != 0;
626 while (ai.leaf && bi.leaf)
630 FcChar32 *am = ai.leaf->map;
631 FcChar32 *bm = bi.leaf->map;
660 for (FcCharSetIterStart (a, &ai); ai.leaf; FcCharSetIterNext (a, &ai))
663 FcChar32 *am = ai.leaf->map;
682 while (ai.leaf)
686 FcChar32 *am = ai.leaf->map;
690 FcChar32 *bm = bi.leaf->map;
701 else if (bi.leaf)
786 if (!ai.leaf)
793 memcpy (map, ai.leaf->map, sizeof (ai.leaf->map));
823 if (!ai.leaf)
830 memcpy (result, ai.leaf->map, sizeof (ai.leaf->map));
918 ci.leaf;
923 FcChar32 bits = ci.leaf->map[i];
968 while (ci.leaf || checki.leaf)
972 printf ("Missing leaf node at 0x%x\n", ci.ucs4);
977 printf ("Extra leaf node at 0x%x\n", checki.ucs4);
983 FcChar32 *cm = ci.leaf->map;
984 FcChar32 *checkm = checki.leaf->map;
1014 FcCharLeaf leaf;
1075 FcCharLeafHash (FcCharLeaf *leaf)
1081 hash = ((hash << 1) | (hash >> 31)) ^ leaf->map[i];
1086 FcCharSetFreezeLeaf (FcCharSetFreezer *freezer, FcCharLeaf *leaf)
1088 FcChar32 hash = FcCharLeafHash (leaf);
1094 if (ent->hash == hash && !memcmp (&ent->leaf, leaf, sizeof (FcCharLeaf)))
1095 return &ent->leaf;
1101 ent->leaf = *leaf;
1105 return &ent->leaf;
1346 FcCharLeaf *leaf, *leaf_serialized;
1383 leaf = FcCharSetLeaf (cs, i);
1384 leaf_serialized = FcSerializePtr (serialize, leaf);
1387 *leaf_serialized = *leaf;