and threads::shared, but leaving them to Arthur).
p4raw-id: //depot/perl@14128
if (sortkeys == &PL_sv_yes) {
keys = newAV();
(void)hv_iterinit((HV*)ival);
- while (entry = hv_iternext((HV*)ival)) {
+ while ((entry = hv_iternext((HV*)ival))) {
sv = hv_iterkeysv(entry);
SvREFCNT_inc(sv);
av_push(keys, sv);
* special defines should be used, ppport.h can be run through Perl to check
* your source code. Simply say:
*
- * perl -x ppport.h *.c *.h *.xs foo/*.c [etc]
+ * perl -x ppport.h *.c *.h *.xs foo/bar*.c [etc]
*
* The result will be a list of patches suggesting changes that should at
* least be acceptable, if not necessarily the most efficient solution, or a
CODE:
{
SV * sv = newSViv(1);
- SV * rv = newRV_inc(sv);
+ newRV_inc(sv);
RETVAL = (SvREFCNT(sv) == 2);
}
OUTPUT:
CODE:
{
SV * sv = newSViv(2);
- SV * rv = newRV_noinc(sv);
+ newRV_noinc(sv);
RETVAL = (SvREFCNT(sv) == 1);
}
OUTPUT:
dmy_op.op_targ = 1;
PL_op = &dmy_op;
PL_curpad = (SV **)&my_pad;
- *(PL_ppaddr[OP_RAND])(aTHX);
+ (void)*(PL_ppaddr[OP_RAND])(aTHX);
PL_op = old_op;
PL_curpad = old_curpad;
for (index = items ; index > 1 ; ) {
SV *bitspec, *opset;
char *bitmap;
STRLEN len, on;
- dMY_CXT;
opset = sv_2mortal(new_opset(aTHX_ Nullsv));
bitmap = SvPVX(opset);
}
}
d = uvuni_to_utf8(d, uvS); /* starter (composed or not) */
- if(tmplen = t - tmp_start) { /* uncomposed combining char */
+ if((tmplen = t - tmp_start)) { /* uncomposed combining char */
t = (U8*)SvPVX(tmp);
while(tmplen--) *d++ = *t++;
}
while(@Exclus) {
my $cur = shift @Exclus;
if(@Exclus && $cur + 1 == $Exclus[0]) {
- print "$cur <= uv && uv <= ";
+ print "($cur <= uv && uv <= ";
while(@Exclus && $cur + 1 == $Exclus[0]) {
$cur = shift @Exclus;
}
- print $cur;
+ print "$cur)";
print "\n\t|| " if @Exclus;
} else {
print "uv == $cur";
str->str_nok = 1;
#ifdef DEBUGGING
if (debug & 32)
- fprintf(stderr,"0x%lx num(%"NVgf")\n",(unsigned long)str,str->str_nval);
+ fprintf(stderr,"0x%lx num(%g)\n",(unsigned long)str,str->str_nval);
#endif
return str->str_nval;
}