Lines Matching defs:bitmap
602 if ( IS_ANYOF_TRIE(op) || trie->bitmap ) {
738 char * bitmap;
747 /* Code points that don't fit in the bitmap */
750 /* And things that aren't in the bitmap, but are small enough to be */
757 bitmap = NULL;
761 bitmap = ANYOF_BITMAP(o);
775 /* If there is stuff outside the bitmap, get it */
779 * bitmap. */
814 /* The aux data may contain stuff that could fit in the bitmap.
818 * in the bitmap (or ANYOFR). This is teased apart later */
822 /* Leave just the things that don't fit into the bitmap */
831 if ( bitmap
836 /* Then all the things that could fit in the bitmap */
839 bitmap,
854 * clearest to output them in a separate [] from the bitmap range
858 * bitmap and anything above the bitmap. */
861 if (! do_sep) { /* If didn't output anything in the bitmap
891 /* And, finally, add the above-the-bitmap stuff */
1094 * inside an ANYOF bitmap. Higher code points are simply suppressed
1246 else { /* Have to split range at the bitmap boundary */
1322 SV* invlist, /* The bitmap */
1330 /* Create and return an SV containing a displayable version of the bitmap
1346 /* First, the code points in the bitmap that are unconditionally there */
1369 * points outside the bitmap range. The call just above to
1401 char *bitmap,
1410 * 'bitmap' points to the bitmap, or NULL if to ignore that.
1412 * the bitmap range, but for some reason aren't in the bitmap; NULL if
1428 * the bitmap, etc is empty.)
1432 * When called for outputting the bitmap of a non-ANYOF node, just pass the
1433 * bitmap, with the succeeding parameters set to NULL, and the final one to
1521 if (bitmap) {
1523 if (BITMAP_TEST(bitmap, i)) {
1526 i < NUM_ANYOF_CODE_POINTS && BITMAP_TEST(bitmap, i);
1554 * form of this list when it has things above the bitmap, so don't even