(int)depth * 2 + 2, "",
REG_NODE_NUM(startbranch),REG_NODE_NUM(first),
REG_NODE_NUM(last), REG_NODE_NUM(tail),
- depth);
+ (int)depth);
});
/* -- First loop and Setup --
DEBUG_TRIE_COMPILE_r(
PerlIO_printf( Perl_debug_log, "%*sTRIE(%s): W:%d C:%d Uq:%d Min:%d Max:%d\n",
(int)depth * 2 + 2,"",
- ( trie->widecharmap ? "UTF8" : "NATIVE" ), word_count,
+ ( trie->widecharmap ? "UTF8" : "NATIVE" ), (int)word_count,
(int)TRIE_CHARCOUNT(trie), trie->uniquecharcount,
(int)trie->minlen, (int)trie->maxlen )
);
if (trie->jump)
trie->jump[0] = (U16)(tail - nextbranch);
if (!jumper)
- jumper= last;
+ jumper = last;
/* XXXX */
if ( !trie->states[trie->startstate].wordnum && trie->bitmap &&
- ( (char *)jumper - (char *)convert) >= sizeof(struct regnode_charclass) )
+ ((char *)jumper - (char *)convert) >= (int)sizeof(struct regnode_charclass) )
{
OP( convert ) = TRIEC;
Copy(trie->bitmap, ((struct regnode_charclass *)convert)->bitmap, ANYOF_BITMAP_SIZE, char);
" S:%"UVuf"/%"IVdf" W:%d L:%d/%d C:%d/%d ",
(UV)trie->startstate,
(IV)trie->laststate-1,
- trie->wordcount,
+ (int)trie->wordcount,
(int)trie->minlen,
(int)trie->maxlen,
(int)TRIE_CHARCOUNT(trie),
);
if ( op==TRIEC || trie->bitmap ) {
int i;
- int rangestart= -1;
- U8* bitmap= op==TRIEC ? ANYOF_BITMAP(node) : TRIE_BITMAP(trie);
-
+ int rangestart = -1;
+ U8* bitmap = op==TRIEC ? (U8*)ANYOF_BITMAP(node) : (U8*)TRIE_BITMAP(trie);
+
sv_setpvn(sv, "", 0);
for (i = 0; i <= 256; i++) {
if (i < 256 && BITMAP_TEST(bitmap,i)) {
DEBUG_TRIE_EXECUTE_r(
if ( uc <= (U8*)last_start && !BITMAP_TEST(bitmap,*uc) ) {
dump_exec_pos( (char *)uc, c, strend, real_start,
- uc, do_utf8 );
+ (char*)uc, do_utf8 );
PerlIO_printf( Perl_debug_log,
" Scanning for legal start char...\n");
}