[p5sagit/p5-mst-13.2.git] / doop.c

/*    doop.c
 *
 *    Copyright (c) 1991-1994, Larry Wall
 *
 *    You may distribute under the terms of either the GNU General Public
 *    License or the Artistic License, as specified in the README file.
 *
 */

/*
 * "'So that was the job I felt I had to do when I started,' thought Sam."
 */

#include "EXTERN.h"
#include "perl.h"

#if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
#include <signal.h>
#endif

#ifdef BUGGY_MSC
 #pragma function(memcmp)
#endif /* BUGGY_MSC */

#ifdef BUGGY_MSC
 #pragma intrinsic(memcmp)
#endif /* BUGGY_MSC */

I32
do_trans(sv,arg)
SV *sv;
OP *arg;
{
    register short *tbl;
    register U8 *s;
    register U8 *send;
    register U8 *d;
    register I32 ch;
    register I32 matches = 0;
    register I32 squash = op->op_private & OPpTRANS_SQUASH;
    STRLEN len;

    if (SvREADONLY(sv))
	croak(no_modify);
    tbl = (short*)cPVOP->op_pv;
    s = (U8*)SvPV(sv, len);
    if (!len)
	return 0;
    if (!SvPOKp(sv))
	s = (U8*)SvPV_force(sv, len);
    (void)SvPOK_only(sv);
    send = s + len;
    if (!tbl || !s)
	croak("panic: do_trans");
    DEBUG_t( deb("2.TBL\n"));
    if (!op->op_private) {
	while (s < send) {
	    if ((ch = tbl[*s]) >= 0) {
		matches++;
		*s = ch;
	    }
	    s++;
	}
    }
    else {
	d = s;
	while (s < send) {
	    if ((ch = tbl[*s]) >= 0) {
		*d = ch;
		if (matches++ && squash) {
		    if (d[-1] == *d)
			matches--;
		    else
			d++;
		}
		else
		    d++;
	    }
	    else if (ch == -1)		/* -1 is unmapped character */
		*d++ = *s;		/* -2 is delete character */
	    s++;
	}
	matches += send - d;	/* account for disappeared chars */
	*d = '\0';
	SvCUR_set(sv, d - (U8*)SvPVX(sv));
    }
    SvSETMAGIC(sv);
    return matches;
}

void
do_join(sv,del,mark,sp)
register SV *sv;
SV *del;
register SV **mark;
register SV **sp;
{
    SV **oldmark = mark;
    register I32 items = sp - mark;
    register STRLEN len;
    STRLEN delimlen;
    register char *delim = SvPV(del, delimlen);
    STRLEN tmplen;

    mark++;
    len = (items > 0 ? (delimlen * (items - 1) ) : 0);
    if (SvTYPE(sv) < SVt_PV)
	sv_upgrade(sv, SVt_PV);
    if (SvLEN(sv) < len + items) {	/* current length is way too short */
	while (items-- > 0) {
	    if (*mark) {
		SvPV(*mark, tmplen);
		len += tmplen;
	    }
	    mark++;
	}
	SvGROW(sv, len + 1);		/* so try to pre-extend */

	mark = oldmark;
	items = sp - mark;;
	++mark;
    }

    if (items-- > 0) {
	char *s;

	if (*mark) {
	    s = SvPV(*mark, tmplen);
	    sv_setpvn(sv, s, tmplen);
	}
	else
	    sv_setpv(sv, "");
	mark++;
    }
    else
	sv_setpv(sv,"");
    len = delimlen;
    if (len) {
	for (; items > 0; items--,mark++) {
	    sv_catpvn(sv,delim,len);
	    sv_catsv(sv,*mark);
	}
    }
    else {
	for (; items > 0; items--,mark++)
	    sv_catsv(sv,*mark);
    }
    SvSETMAGIC(sv);
}

void
do_sprintf(sv,len,sarg)
register SV *sv;
register I32 len;
register SV **sarg;
{
    register char *s;
    register char *t;
    register char *f;
    bool dolong;
#ifdef HAS_QUAD
    bool doquad;
#endif /* HAS_QUAD */
    char ch;
    register char *send;
    register SV *arg;
    char *xs;
    I32 xlen;
    I32 pre;
    I32 post;
    double value;
    STRLEN arglen;

    sv_setpv(sv,"");
    len--;			/* don't count pattern string */
    t = s = SvPV(*sarg, arglen);	/* XXX Don't know t is writeable */
    send = s + arglen;
    sarg++;
    for ( ; ; len--) {

	/*SUPPRESS 560*/
	if (len <= 0 || !(arg = *sarg++))
	    arg = &sv_no;

	/*SUPPRESS 530*/
	for ( ; t < send && *t != '%'; t++) ;
	if (t >= send)
	    break;		/* end of run_format string, ignore extra args */
	f = t;
	*buf = '\0';
	xs = buf;
#ifdef HAS_QUAD
	doquad =
#endif /* HAS_QUAD */
	dolong = FALSE;
	pre = post = 0;
	for (t++; t < send; t++) {
	    switch (*t) {
	    default:
		ch = *(++t);
		*t = '\0';
		(void)sprintf(xs,f);
		len++, sarg--;
		xlen = strlen(xs);
		break;
	    case 'n': case '*':
		croak("Use of %c in printf format not supported", *t);

	    case '0': case '1': case '2': case '3': case '4':
	    case '5': case '6': case '7': case '8': case '9': 
	    case '.': case '#': case '-': case '+': case ' ':
		continue;
	    case 'l':
#ifdef HAS_QUAD
		if (dolong) {
		    dolong = FALSE;
		    doquad = TRUE;
		} else
#endif
		dolong = TRUE;
		continue;
	    case 'c':
		ch = *(++t);
		*t = '\0';
		xlen = SvIV(arg);
		if (strEQ(f,"%c")) { /* some printfs fail on null chars */
		    *xs = xlen;
		    xs[1] = '\0';
		    xlen = 1;
		}
		else {
		    (void)sprintf(xs,f,xlen);
		    xlen = strlen(xs);
		}
		break;
	    case 'D':
		dolong = TRUE;
		/* FALL THROUGH */
	    case 'd':
		ch = *(++t);
		*t = '\0';
#ifdef HAS_QUAD
		if (doquad)
		    (void)sprintf(buf,s,(Quad_t)SvNV(arg));
		else
#endif
		if (dolong)
		    (void)sprintf(xs,f,(long)SvNV(arg));
		else
		    (void)sprintf(xs,f,SvIV(arg));
		xlen = strlen(xs);
		break;
	    case 'X': case 'O':
		dolong = TRUE;
		/* FALL THROUGH */
	    case 'x': case 'o': case 'u':
		ch = *(++t);
		*t = '\0';
		value = SvNV(arg);
#ifdef HAS_QUAD
		if (doquad)
		    (void)sprintf(buf,s,(unsigned Quad_t)value);
		else
#endif
		if (dolong)
		    (void)sprintf(xs,f,U_L(value));
		else
		    (void)sprintf(xs,f,U_I(value));
		xlen = strlen(xs);
		break;
	    case 'E': case 'e': case 'f': case 'G': case 'g':
		ch = *(++t);
		*t = '\0';
		(void)sprintf(xs,f,SvNV(arg));
		xlen = strlen(xs);
#ifdef LC_NUMERIC
		/* User-defined locales may include arbitrary characters */
		if (! numeric_standard)
		    SvTAINTED_on(sv);
#endif
		break;
	    case 's':
		ch = *(++t);
		*t = '\0';
		xs = SvPV(arg, arglen);
		xlen = (I32)arglen;
		if (strEQ(f,"%s")) {	/* some printfs fail on >128 chars */
		    break;		/* so handle simple cases */
		}
		else if (f[1] == '-') {
		    char *mp = strchr(f, '.');
		    I32 min = atoi(f+2);

		    if (mp) {
			I32 max = atoi(mp+1);

			if (xlen > max)
			    xlen = max;
		    }
		    if (xlen < min)
			post = min - xlen;
		    break;
		}
		else if (isDIGIT(f[1])) {
		    char *mp = strchr(f, '.');
		    I32 min = atoi(f+1);

		    if (mp) {
			I32 max = atoi(mp+1);

			if (xlen > max)
			    xlen = max;
		    }
		    if (xlen < min)
			pre = min - xlen;
		    break;
		}
		strcpy(tokenbuf+64,f);	/* sprintf($s,...$s...) */
		*t = ch;
		(void)sprintf(buf,tokenbuf+64,xs);
		xs = buf;
		xlen = strlen(xs);
		break;
	    }
	    /* end of switch, copy results */
	    *t = ch;
	    if (xs == buf && xlen >= sizeof(buf)) {	/* Ooops! */
		PerlIO_puts(PerlIO_stderr(),"panic: sprintf overflow - memory corrupted!\n");
		my_exit(1);
	    }
	    SvGROW(sv, SvCUR(sv) + (f - s) + xlen + 1 + pre + post);
	    sv_catpvn(sv, s, f - s);
	    if (pre) {
		repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, pre);
		SvCUR(sv) += pre;
	    }
	    sv_catpvn(sv, xs, xlen);
	    if (post) {
		repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, post);
		SvCUR(sv) += post;
	    }
	    s = t;
	    break;		/* break from for loop */
	}
    }
    sv_catpvn(sv, s, t - s);
    SvSETMAGIC(sv);
}

void
do_vecset(sv)
SV *sv;
{
    SV *targ = LvTARG(sv);
    register I32 offset;
    register I32 size;
    register unsigned char *s;
    register unsigned long lval;
    I32 mask;
    STRLEN targlen;
    STRLEN len;

    if (!targ)
	return;
    s = (unsigned char*)SvPV_force(targ, targlen);
    lval = U_L(SvNV(sv));
    offset = LvTARGOFF(sv);
    size = LvTARGLEN(sv);
    
    len = (offset + size + 7) / 8;
    if (len > targlen) {
	s = (unsigned char*)SvGROW(targ, len + 1);
	(void)memzero(s + targlen, len - targlen + 1);
	SvCUR_set(targ, len);
    }
    
    if (size < 8) {
	mask = (1 << size) - 1;
	size = offset & 7;
	lval &= mask;
	offset >>= 3;
	s[offset] &= ~(mask << size);
	s[offset] |= lval << size;
    }
    else {
	offset >>= 3;
	if (size == 8)
	    s[offset] = lval & 255;
	else if (size == 16) {
	    s[offset] = (lval >> 8) & 255;
	    s[offset+1] = lval & 255;
	}
	else if (size == 32) {
	    s[offset] = (lval >> 24) & 255;
	    s[offset+1] = (lval >> 16) & 255;
	    s[offset+2] = (lval >> 8) & 255;
	    s[offset+3] = lval & 255;
	}
    }
}

void
do_chop(astr,sv)
register SV *astr;
register SV *sv;
{
    STRLEN len;
    char *s;
    
    if (SvTYPE(sv) == SVt_PVAV) {
	register I32 i;
        I32 max;
	AV* av = (AV*)sv;
        max = AvFILL(av);
        for (i = 0; i <= max; i++) {
	    sv = (SV*)av_fetch(av, i, FALSE);
	    if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
		do_chop(astr, sv);
	}
        return;
    }
    if (SvTYPE(sv) == SVt_PVHV) {
        HV* hv = (HV*)sv;
	HE* entry;
        (void)hv_iterinit(hv);
        /*SUPPRESS 560*/
        while (entry = hv_iternext(hv))
            do_chop(astr,hv_iterval(hv,entry));
        return;
    }
    s = SvPV(sv, len);
    if (len && !SvPOK(sv))
	s = SvPV_force(sv, len);
    if (s && len) {
	s += --len;
	sv_setpvn(astr, s, 1);
	*s = '\0';
	SvCUR_set(sv, len);
	SvNIOK_off(sv);
    }
    else
	sv_setpvn(astr, "", 0);
    SvSETMAGIC(sv);
} 

I32
do_chomp(sv)
register SV *sv;
{
    register I32 count;
    STRLEN len;
    char *s;

    if (RsSNARF(rs))
	return 0;
    count = 0;
    if (SvTYPE(sv) == SVt_PVAV) {
	register I32 i;
        I32 max;
	AV* av = (AV*)sv;
        max = AvFILL(av);
        for (i = 0; i <= max; i++) {
	    sv = (SV*)av_fetch(av, i, FALSE);
	    if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
		count += do_chomp(sv);
	}
        return count;
    }
    if (SvTYPE(sv) == SVt_PVHV) {
        HV* hv = (HV*)sv;
	HE* entry;
        (void)hv_iterinit(hv);
        /*SUPPRESS 560*/
        while (entry = hv_iternext(hv))
            count += do_chomp(hv_iterval(hv,entry));
        return count;
    }
    s = SvPV(sv, len);
    if (len && !SvPOKp(sv))
	s = SvPV_force(sv, len);
    if (s && len) {
	s += --len;
	if (RsPARA(rs)) {
	    if (*s != '\n')
		goto nope;
	    ++count;
	    while (len && s[-1] == '\n') {
		--len;
		--s;
		++count;
	    }
	}
	else {
	    STRLEN rslen;
	    char *rsptr = SvPV(rs, rslen);
	    if (rslen == 1) {
		if (*s != *rsptr)
		    goto nope;
		++count;
	    }
	    else {
		if (len < rslen - 1)
		    goto nope;
		len -= rslen - 1;
		s -= rslen - 1;
		if (memcmp(s, rsptr, rslen))
		    goto nope;
		count += rslen;
	    }
	}
	*s = '\0';
	SvCUR_set(sv, len);
	SvNIOK_off(sv);
    }
  nope:
    SvSETMAGIC(sv);
    return count;
} 

void
do_vop(optype,sv,left,right)
I32 optype;
SV *sv;
SV *left;
SV *right;
{
#ifdef LIBERAL
    register long *dl;
    register long *ll;
    register long *rl;
#endif
    register char *dc;
    STRLEN leftlen;
    STRLEN rightlen;
    register char *lc = SvPV(left, leftlen);
    register char *rc = SvPV(right, rightlen);
    register I32 len;
    I32 lensave;
    char *lsave = lc;
    char *rsave = rc;

    dc = SvPV_force(sv,na);
    len = leftlen < rightlen ? leftlen : rightlen;
    lensave = len;
    if (SvCUR(sv) < len) {
	dc = SvGROW(sv,len + 1);
	(void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
    }
    SvCUR_set(sv, len);
    (void)SvPOK_only(sv);
#ifdef LIBERAL
    if (len >= sizeof(long)*4 &&
	!((long)dc % sizeof(long)) &&
	!((long)lc % sizeof(long)) &&
	!((long)rc % sizeof(long)))	/* It's almost always aligned... */
    {
	I32 remainder = len % (sizeof(long)*4);
	len /= (sizeof(long)*4);

	dl = (long*)dc;
	ll = (long*)lc;
	rl = (long*)rc;

	switch (optype) {
	case OP_BIT_AND:
	    while (len--) {
		*dl++ = *ll++ & *rl++;
		*dl++ = *ll++ & *rl++;
		*dl++ = *ll++ & *rl++;
		*dl++ = *ll++ & *rl++;
	    }
	    break;
	case OP_BIT_XOR:
	    while (len--) {
		*dl++ = *ll++ ^ *rl++;
		*dl++ = *ll++ ^ *rl++;
		*dl++ = *ll++ ^ *rl++;
		*dl++ = *ll++ ^ *rl++;
	    }
	    break;
	case OP_BIT_OR:
	    while (len--) {
		*dl++ = *ll++ | *rl++;
		*dl++ = *ll++ | *rl++;
		*dl++ = *ll++ | *rl++;
		*dl++ = *ll++ | *rl++;
	    }
	}

	dc = (char*)dl;
	lc = (char*)ll;
	rc = (char*)rl;

	len = remainder;
    }
#endif
    {
	switch (optype) {
	case OP_BIT_AND:
	    while (len--)
		*dc++ = *lc++ & *rc++;
	    break;
	case OP_BIT_XOR:
	    while (len--)
		*dc++ = *lc++ ^ *rc++;
	    goto mop_up;
	case OP_BIT_OR:
	    while (len--)
		*dc++ = *lc++ | *rc++;
	  mop_up:
	    len = lensave;
	    if (rightlen > len)
		sv_catpvn(sv, rsave + len, rightlen - len);
	    else if (leftlen > len)
		sv_catpvn(sv, lsave + len, leftlen - len);
	    else
		*SvEND(sv) = '\0';
	    break;
	}
    }
}

OP *
do_kv(ARGS)
dARGS
{
    dSP;
    HV *hv = (HV*)POPs;
    register HE *entry;
    SV *tmpstr;
    I32 dokeys =   (op->op_type == OP_KEYS);
    I32 dovalues = (op->op_type == OP_VALUES);

    if (op->op_type == OP_RV2HV || op->op_type == OP_PADHV) 
	dokeys = dovalues = TRUE;

    if (!hv) {
	if (op->op_flags & OPf_MOD) {	/* lvalue */
	    dTARGET;		/* make sure to clear its target here */
	    if (SvTYPE(TARG) == SVt_PVLV)
		LvTARG(TARG) = Nullsv;
	    PUSHs(TARG);
	}
	RETURN;
    }

    (void)hv_iterinit(hv);	/* always reset iterator regardless */

    if (GIMME != G_ARRAY) {
	I32 i;
	dTARGET;

	if (op->op_flags & OPf_MOD) {	/* lvalue */
	    if (SvTYPE(TARG) < SVt_PVLV) {
		sv_upgrade(TARG, SVt_PVLV);
		sv_magic(TARG, Nullsv, 'k', Nullch, 0);
	    }
	    LvTYPE(TARG) = 'k';
	    LvTARG(TARG) = (SV*)hv;
	    PUSHs(TARG);
	    RETURN;
	}

	if (!SvRMAGICAL(hv) || !mg_find((SV*)hv,'P'))
	    i = HvKEYS(hv);
	else {
	    i = 0;
	    /*SUPPRESS 560*/
	    while (entry = hv_iternext(hv)) {
		i++;
	    }
	}
	PUSHi( i );
	RETURN;
    }

    /* Guess how much room we need.  hv_max may be a few too many.  Oh well. */
    EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));

    PUTBACK;	/* hv_iternext and hv_iterval might clobber stack_sp */
    while (entry = hv_iternext(hv)) {
	SPAGAIN;
	if (dokeys)
	    XPUSHs(hv_iterkeysv(entry));	/* won't clobber stack_sp */
	if (dovalues) {
	    tmpstr = NEWSV(45,0);
	    PUTBACK;
	    sv_setsv(tmpstr,hv_iterval(hv,entry));
	    SPAGAIN;
	    DEBUG_H( {
			sprintf(buf,"%d%%%d=%d\n", HeHASH(entry),
				HvMAX(hv)+1, HeHASH(entry) & HvMAX(hv));
			sv_setpv(tmpstr,buf);
	    } )
	    XPUSHs(sv_2mortal(tmpstr));
	}
	PUTBACK;
    }
    return NORMAL;
}
Commit	Line	Data
a0d0e21e	1	/* doop.c
79072805	2	*
a0d0e21e	3	* Copyright (c) 1991-1994, Larry Wall
79072805	4	*
	5	* You may distribute under the terms of either the GNU General Public
	6	* License or the Artistic License, as specified in the README file.
	7	*
a0d0e21e	8	*/
	9
	10	/*
	11	* "'So that was the job I felt I had to do when I started,' thought Sam."
79072805	12	*/
	13
	14	#include "EXTERN.h"
	15	#include "perl.h"
	16
	17	#if !defined(NSIG) \|\| defined(M_UNIX) \|\| defined(M_XENIX)
	18	#include <signal.h>
	19	#endif
	20
	21	#ifdef BUGGY_MSC
	22	#pragma function(memcmp)
	23	#endif /* BUGGY_MSC */
	24
79072805	25	#ifdef BUGGY_MSC
	26	#pragma intrinsic(memcmp)
	27	#endif /* BUGGY_MSC */
	28
	29	I32
	30	do_trans(sv,arg)
	31	SV *sv;
	32	OP *arg;
	33	{
	34	register short *tbl;
1476d272	35	register U8 *s;
	36	register U8 *send;
	37	register U8 *d;
79072805	38	register I32 ch;
1476d272	39	register I32 matches = 0;
79072805	40	register I32 squash = op->op_private & OPpTRANS_SQUASH;
463ee0b2	41	STRLEN len;
79072805	42
a0d0e21e	43	if (SvREADONLY(sv))
a0d0e21e	44	croak(no_modify);
1476d272	45	tbl = (short*)cPVOP->op_pv;
1476d272	46	s = (U8*)SvPV(sv, len);
a0d0e21e	47	if (!len)
	48	return 0;
	49	if (!SvPOKp(sv))
1476d272	50	s = (U8*)SvPV_force(sv, len);
a0d0e21e	51	(void)SvPOK_only(sv);
463ee0b2	52	send = s + len;
79072805	53	if (!tbl \|\| !s)
463ee0b2	54	croak("panic: do_trans");
79072805	55	DEBUG_t( deb("2.TBL\n"));
	56	if (!op->op_private) {
	57	while (s < send) {
1476d272	58	if ((ch = tbl[*s]) >= 0) {
79072805	59	matches++;
	60	*s = ch;
	61	}
	62	s++;
	63	}
	64	}
	65	else {
	66	d = s;
	67	while (s < send) {
1476d272	68	if ((ch = tbl[*s]) >= 0) {
79072805	69	*d = ch;
	70	if (matches++ && squash) {
	71	if (d[-1] == *d)
	72	matches--;
	73	else
	74	d++;
	75	}
	76	else
	77	d++;
	78	}
	79	else if (ch == -1) /* -1 is unmapped character */
	80	d++ = s; /* -2 is delete character */
	81	s++;
	82	}
	83	matches += send - d; /* account for disappeared chars */
	84	*d = '\0';
1476d272	85	SvCUR_set(sv, d - (U8*)SvPVX(sv));
79072805	86	}
	87	SvSETMAGIC(sv);
	88	return matches;
	89	}
	90
	91	void
	92	do_join(sv,del,mark,sp)
	93	register SV *sv;
	94	SV *del;
	95	register SV **mark;
	96	register SV **sp;
	97	{
	98	SV **oldmark = mark;
	99	register I32 items = sp - mark;
79072805	100	register STRLEN len;
463ee0b2	101	STRLEN delimlen;
	102	register char *delim = SvPV(del, delimlen);
	103	STRLEN tmplen;
79072805	104
	105	mark++;
	106	len = (items > 0 ? (delimlen * (items - 1) ) : 0);
	107	if (SvTYPE(sv) < SVt_PV)
	108	sv_upgrade(sv, SVt_PV);
	109	if (SvLEN(sv) < len + items) { /* current length is way too short */
	110	while (items-- > 0) {
	111	if (*mark) {
463ee0b2	112	SvPV(*mark, tmplen);
463ee0b2	113	len += tmplen;
79072805	114	}
	115	mark++;
	116	}
	117	SvGROW(sv, len + 1); /* so try to pre-extend */
	118
	119	mark = oldmark;
	120	items = sp - mark;;
	121	++mark;
	122	}
	123
463ee0b2	124	if (items-- > 0) {
8990e307	125	char *s;
	126
	127	if (*mark) {
	128	s = SvPV(*mark, tmplen);
	129	sv_setpvn(sv, s, tmplen);
	130	}
	131	else
	132	sv_setpv(sv, "");
463ee0b2	133	mark++;
463ee0b2	134	}
79072805	135	else
	136	sv_setpv(sv,"");
	137	len = delimlen;
	138	if (len) {
	139	for (; items > 0; items--,mark++) {
	140	sv_catpvn(sv,delim,len);
	141	sv_catsv(sv,*mark);
	142	}
	143	}
	144	else {
	145	for (; items > 0; items--,mark++)
	146	sv_catsv(sv,*mark);
	147	}
	148	SvSETMAGIC(sv);
	149	}
	150
	151	void
	152	do_sprintf(sv,len,sarg)
	153	register SV *sv;
	154	register I32 len;
	155	register SV **sarg;
	156	{
	157	register char *s;
	158	register char *t;
	159	register char *f;
	160	bool dolong;
ecfc5424	161	#ifdef HAS_QUAD
79072805	162	bool doquad;
ecfc5424	163	#endif /* HAS_QUAD */
79072805	164	char ch;
	165	register char *send;
	166	register SV *arg;
	167	char *xs;
	168	I32 xlen;
	169	I32 pre;
	170	I32 post;
	171	double value;
463ee0b2	172	STRLEN arglen;
79072805	173
	174	sv_setpv(sv,"");
	175	len--; /* don't count pattern string */
a0d0e21e	176	t = s = SvPV(sarg, arglen); / XXX Don't know t is writeable */
463ee0b2	177	send = s + arglen;
79072805	178	sarg++;
	179	for ( ; ; len--) {
	180
	181	/SUPPRESS 560/
	182	if (len <= 0 \|\| !(arg = *sarg++))
	183	arg = &sv_no;
	184
	185	/SUPPRESS 530/
	186	for ( ; t < send && *t != '%'; t++) ;
	187	if (t >= send)
	188	break; /* end of run_format string, ignore extra args */
	189	f = t;
	190	*buf = '\0';
	191	xs = buf;
ecfc5424	192	#ifdef HAS_QUAD
79072805	193	doquad =
ecfc5424	194	#endif /* HAS_QUAD */
79072805	195	dolong = FALSE;
	196	pre = post = 0;
	197	for (t++; t < send; t++) {
	198	switch (*t) {
	199	default:
	200	ch = *(++t);
	201	*t = '\0';
	202	(void)sprintf(xs,f);
	203	len++, sarg--;
	204	xlen = strlen(xs);
	205	break;
748a9306	206	case 'n': case '*':
	207	croak("Use of %c in printf format not supported", *t);
	208
79072805	209	case '0': case '1': case '2': case '3': case '4':
	210	case '5': case '6': case '7': case '8': case '9':
	211	case '.': case '#': case '-': case '+': case ' ':
	212	continue;
463ee0b2	213	case 'l':
ecfc5424	214	#ifdef HAS_QUAD
79072805	215	if (dolong) {
	216	dolong = FALSE;
	217	doquad = TRUE;
	218	} else
	219	#endif
	220	dolong = TRUE;
	221	continue;
	222	case 'c':
	223	ch = *(++t);
	224	*t = '\0';
463ee0b2	225	xlen = SvIV(arg);
79072805	226	if (strEQ(f,"%c")) { /* some printfs fail on null chars */
	227	*xs = xlen;
	228	xs[1] = '\0';
	229	xlen = 1;
	230	}
	231	else {
	232	(void)sprintf(xs,f,xlen);
	233	xlen = strlen(xs);
	234	}
	235	break;
	236	case 'D':
	237	dolong = TRUE;
	238	/* FALL THROUGH */
	239	case 'd':
	240	ch = *(++t);
	241	*t = '\0';
ecfc5424	242	#ifdef HAS_QUAD
79072805	243	if (doquad)
ecfc5424	244	(void)sprintf(buf,s,(Quad_t)SvNV(arg));
79072805	245	else
	246	#endif
	247	if (dolong)
463ee0b2	248	(void)sprintf(xs,f,(long)SvNV(arg));
79072805	249	else
463ee0b2	250	(void)sprintf(xs,f,SvIV(arg));
79072805	251	xlen = strlen(xs);
	252	break;
	253	case 'X': case 'O':
	254	dolong = TRUE;
	255	/* FALL THROUGH */
	256	case 'x': case 'o': case 'u':
	257	ch = *(++t);
	258	*t = '\0';
463ee0b2	259	value = SvNV(arg);
ecfc5424	260	#ifdef HAS_QUAD
79072805	261	if (doquad)
ecfc5424	262	(void)sprintf(buf,s,(unsigned Quad_t)value);
79072805	263	else
	264	#endif
	265	if (dolong)
	266	(void)sprintf(xs,f,U_L(value));
	267	else
	268	(void)sprintf(xs,f,U_I(value));
	269	xlen = strlen(xs);
	270	break;
	271	case 'E': case 'e': case 'f': case 'G': case 'g':
	272	ch = *(++t);
	273	*t = '\0';
463ee0b2	274	(void)sprintf(xs,f,SvNV(arg));
79072805	275	xlen = strlen(xs);
bbce6d69	276	#ifdef LC_NUMERIC
	277	/* User-defined locales may include arbitrary characters */
	278	if (! numeric_standard)
	279	SvTAINTED_on(sv);
	280	#endif
79072805	281	break;
	282	case 's':
	283	ch = *(++t);
	284	*t = '\0';
463ee0b2	285	xs = SvPV(arg, arglen);
463ee0b2	286	xlen = (I32)arglen;
79072805	287	if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
	288	break; /* so handle simple cases */
	289	}
	290	else if (f[1] == '-') {
93a17b20	291	char *mp = strchr(f, '.');
79072805	292	I32 min = atoi(f+2);
	293
	294	if (mp) {
	295	I32 max = atoi(mp+1);
	296
	297	if (xlen > max)
	298	xlen = max;
	299	}
	300	if (xlen < min)
	301	post = min - xlen;
	302	break;
	303	}
	304	else if (isDIGIT(f[1])) {
93a17b20	305	char *mp = strchr(f, '.');
79072805	306	I32 min = atoi(f+1);
	307
	308	if (mp) {
	309	I32 max = atoi(mp+1);
	310
	311	if (xlen > max)
	312	xlen = max;
	313	}
	314	if (xlen < min)
	315	pre = min - xlen;
	316	break;
	317	}
	318	strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
	319	*t = ch;
	320	(void)sprintf(buf,tokenbuf+64,xs);
	321	xs = buf;
	322	xlen = strlen(xs);
	323	break;
	324	}
	325	/* end of switch, copy results */
	326	*t = ch;
4633a7c4	327	if (xs == buf && xlen >= sizeof(buf)) { /* Ooops! */
760ac839	328	PerlIO_puts(PerlIO_stderr(),"panic: sprintf overflow - memory corrupted!\n");
4633a7c4	329	my_exit(1);
4633a7c4	330	}
79072805	331	SvGROW(sv, SvCUR(sv) + (f - s) + xlen + 1 + pre + post);
	332	sv_catpvn(sv, s, f - s);
	333	if (pre) {
463ee0b2	334	repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, pre);
79072805	335	SvCUR(sv) += pre;
	336	}
	337	sv_catpvn(sv, xs, xlen);
	338	if (post) {
463ee0b2	339	repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, post);
79072805	340	SvCUR(sv) += post;
	341	}
	342	s = t;
	343	break; /* break from for loop */
	344	}
	345	}
	346	sv_catpvn(sv, s, t - s);
	347	SvSETMAGIC(sv);
	348	}
	349
	350	void
	351	do_vecset(sv)
	352	SV *sv;
	353	{
	354	SV *targ = LvTARG(sv);
	355	register I32 offset;
	356	register I32 size;
8990e307	357	register unsigned char *s;
8990e307	358	register unsigned long lval;
79072805	359	I32 mask;
a0d0e21e	360	STRLEN targlen;
a0d0e21e	361	STRLEN len;
79072805	362
8990e307	363	if (!targ)
8990e307	364	return;
a0d0e21e	365	s = (unsigned char*)SvPV_force(targ, targlen);
8990e307	366	lval = U_L(SvNV(sv));
79072805	367	offset = LvTARGOFF(sv);
79072805	368	size = LvTARGLEN(sv);
a0d0e21e	369
	370	len = (offset + size + 7) / 8;
	371	if (len > targlen) {
	372	s = (unsigned char*)SvGROW(targ, len + 1);
	373	(void)memzero(s + targlen, len - targlen + 1);
	374	SvCUR_set(targ, len);
	375	}
	376
79072805	377	if (size < 8) {
	378	mask = (1 << size) - 1;
	379	size = offset & 7;
	380	lval &= mask;
	381	offset >>= 3;
	382	s[offset] &= ~(mask << size);
	383	s[offset] \|= lval << size;
	384	}
	385	else {
a0d0e21e	386	offset >>= 3;
79072805	387	if (size == 8)
	388	s[offset] = lval & 255;
	389	else if (size == 16) {
	390	s[offset] = (lval >> 8) & 255;
	391	s[offset+1] = lval & 255;
	392	}
	393	else if (size == 32) {
	394	s[offset] = (lval >> 24) & 255;
	395	s[offset+1] = (lval >> 16) & 255;
	396	s[offset+2] = (lval >> 8) & 255;
	397	s[offset+3] = lval & 255;
	398	}
	399	}
	400	}
	401
	402	void
	403	do_chop(astr,sv)
	404	register SV *astr;
	405	register SV *sv;
	406	{
463ee0b2	407	STRLEN len;
a0d0e21e	408	char *s;
a0d0e21e	409
79072805	410	if (SvTYPE(sv) == SVt_PVAV) {
a0d0e21e	411	register I32 i;
	412	I32 max;
	413	AV* av = (AV*)sv;
	414	max = AvFILL(av);
	415	for (i = 0; i <= max; i++) {
	416	sv = (SV*)av_fetch(av, i, FALSE);
	417	if (sv && ((sv = (SV*)sv), sv != &sv_undef))
	418	do_chop(astr, sv);
	419	}
	420	return;
79072805	421	}
79072805	422	if (SvTYPE(sv) == SVt_PVHV) {
a0d0e21e	423	HV* hv = (HV*)sv;
	424	HE* entry;
	425	(void)hv_iterinit(hv);
	426	/SUPPRESS 560/
	427	while (entry = hv_iternext(hv))
	428	do_chop(astr,hv_iterval(hv,entry));
	429	return;
79072805	430	}
a0d0e21e	431	s = SvPV(sv, len);
748a9306	432	if (len && !SvPOK(sv))
a0d0e21e	433	s = SvPV_force(sv, len);
	434	if (s && len) {
	435	s += --len;
	436	sv_setpvn(astr, s, 1);
	437	*s = '\0';
	438	SvCUR_set(sv, len);
	439	SvNIOK_off(sv);
79072805	440	}
79072805	441	else
a0d0e21e	442	sv_setpvn(astr, "", 0);
	443	SvSETMAGIC(sv);
	444	}
	445
	446	I32
	447	do_chomp(sv)
	448	register SV *sv;
	449	{
c07a80fd	450	register I32 count;
a0d0e21e	451	STRLEN len;
a0d0e21e	452	char *s;
c07a80fd	453
	454	if (RsSNARF(rs))
	455	return 0;
	456	count = 0;
a0d0e21e	457	if (SvTYPE(sv) == SVt_PVAV) {
	458	register I32 i;
	459	I32 max;
	460	AV* av = (AV*)sv;
	461	max = AvFILL(av);
	462	for (i = 0; i <= max; i++) {
	463	sv = (SV*)av_fetch(av, i, FALSE);
	464	if (sv && ((sv = (SV*)sv), sv != &sv_undef))
	465	count += do_chomp(sv);
	466	}
	467	return count;
	468	}
	469	if (SvTYPE(sv) == SVt_PVHV) {
	470	HV* hv = (HV*)sv;
	471	HE* entry;
	472	(void)hv_iterinit(hv);
	473	/SUPPRESS 560/
	474	while (entry = hv_iternext(hv))
	475	count += do_chomp(hv_iterval(hv,entry));
	476	return count;
	477	}
	478	s = SvPV(sv, len);
	479	if (len && !SvPOKp(sv))
	480	s = SvPV_force(sv, len);
	481	if (s && len) {
	482	s += --len;
c07a80fd	483	if (RsPARA(rs)) {
a0d0e21e	484	if (*s != '\n')
	485	goto nope;
	486	++count;
	487	while (len && s[-1] == '\n') {
	488	--len;
	489	--s;
	490	++count;
	491	}
	492	}
a0d0e21e	493	else {
c07a80fd	494	STRLEN rslen;
	495	char *rsptr = SvPV(rs, rslen);
	496	if (rslen == 1) {
	497	if (s != rsptr)
	498	goto nope;
	499	++count;
	500	}
	501	else {
8c2cee6f	502	if (len < rslen - 1)
c07a80fd	503	goto nope;
	504	len -= rslen - 1;
	505	s -= rslen - 1;
e963928e	506	if (memcmp(s, rsptr, rslen))
c07a80fd	507	goto nope;
	508	count += rslen;
	509	}
a0d0e21e	510	}
a0d0e21e	511	*s = '\0';
	512	SvCUR_set(sv, len);
	513	SvNIOK_off(sv);
	514	}
	515	nope:
	516	SvSETMAGIC(sv);
	517	return count;
	518	}
79072805	519
	520	void
	521	do_vop(optype,sv,left,right)
	522	I32 optype;
	523	SV *sv;
	524	SV *left;
	525	SV *right;
	526	{
	527	#ifdef LIBERAL
	528	register long *dl;
	529	register long *ll;
	530	register long *rl;
	531	#endif
	532	register char *dc;
463ee0b2	533	STRLEN leftlen;
	534	STRLEN rightlen;
	535	register char *lc = SvPV(left, leftlen);
	536	register char *rc = SvPV(right, rightlen);
79072805	537	register I32 len;
a0d0e21e	538	I32 lensave;
e963928e	539	char *lsave = lc;
e963928e	540	char *rsave = rc;
79072805	541
a0d0e21e	542	dc = SvPV_force(sv,na);
93a17b20	543	len = leftlen < rightlen ? leftlen : rightlen;
a0d0e21e	544	lensave = len;
	545	if (SvCUR(sv) < len) {
	546	dc = SvGROW(sv,len + 1);
	547	(void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
79072805	548	}
a0d0e21e	549	SvCUR_set(sv, len);
a0d0e21e	550	(void)SvPOK_only(sv);
79072805	551	#ifdef LIBERAL
	552	if (len >= sizeof(long)*4 &&
	553	!((long)dc % sizeof(long)) &&
	554	!((long)lc % sizeof(long)) &&
	555	!((long)rc % sizeof(long))) /* It's almost always aligned... */
	556	{
	557	I32 remainder = len % (sizeof(long)*4);
	558	len /= (sizeof(long)*4);
	559
	560	dl = (long*)dc;
	561	ll = (long*)lc;
	562	rl = (long*)rc;
	563
	564	switch (optype) {
	565	case OP_BIT_AND:
	566	while (len--) {
	567	dl++ = ll++ & *rl++;
	568	dl++ = ll++ & *rl++;
	569	dl++ = ll++ & *rl++;
	570	dl++ = ll++ & *rl++;
	571	}
	572	break;
a0d0e21e	573	case OP_BIT_XOR:
79072805	574	while (len--) {
	575	dl++ = ll++ ^ *rl++;
	576	dl++ = ll++ ^ *rl++;
	577	dl++ = ll++ ^ *rl++;
	578	dl++ = ll++ ^ *rl++;
	579	}
	580	break;
	581	case OP_BIT_OR:
	582	while (len--) {
	583	dl++ = ll++ \| *rl++;
	584	dl++ = ll++ \| *rl++;
	585	dl++ = ll++ \| *rl++;
	586	dl++ = ll++ \| *rl++;
	587	}
	588	}
	589
	590	dc = (char*)dl;
	591	lc = (char*)ll;
	592	rc = (char*)rl;
	593
	594	len = remainder;
	595	}
	596	#endif
a0d0e21e	597	{
a0d0e21e	598	switch (optype) {
	599	case OP_BIT_AND:
	600	while (len--)
	601	dc++ = lc++ & *rc++;
	602	break;
	603	case OP_BIT_XOR:
	604	while (len--)
	605	dc++ = lc++ ^ *rc++;
	606	goto mop_up;
	607	case OP_BIT_OR:
	608	while (len--)
	609	dc++ = lc++ \| *rc++;
	610	mop_up:
	611	len = lensave;
	612	if (rightlen > len)
	613	sv_catpvn(sv, rsave + len, rightlen - len);
	614	else if (leftlen > len)
	615	sv_catpvn(sv, lsave + len, leftlen - len);
4633a7c4	616	else
4633a7c4	617	*SvEND(sv) = '\0';
a0d0e21e	618	break;
a0d0e21e	619	}
79072805	620	}
79072805	621	}
463ee0b2	622
	623	OP *
	624	do_kv(ARGS)
	625	dARGS
	626	{
	627	dSP;
	628	HV hv = (HV)POPs;
463ee0b2	629	register HE *entry;
463ee0b2	630	SV *tmpstr;
a0d0e21e	631	I32 dokeys = (op->op_type == OP_KEYS);
	632	I32 dovalues = (op->op_type == OP_VALUES);
	633
	634	if (op->op_type == OP_RV2HV \|\| op->op_type == OP_PADHV)
	635	dokeys = dovalues = TRUE;
463ee0b2	636
85581909	637	if (!hv) {
	638	if (op->op_flags & OPf_MOD) { /* lvalue */
	639	dTARGET; /* make sure to clear its target here */
	640	if (SvTYPE(TARG) == SVt_PVLV)
	641	LvTARG(TARG) = Nullsv;
	642	PUSHs(TARG);
	643	}
463ee0b2	644	RETURN;
85581909	645	}
748a9306	646
	647	(void)hv_iterinit(hv); /* always reset iterator regardless */
	648
463ee0b2	649	if (GIMME != G_ARRAY) {
8c2cee6f	650	I32 i;
463ee0b2	651	dTARGET;
463ee0b2	652
85581909	653	if (op->op_flags & OPf_MOD) { /* lvalue */
	654	if (SvTYPE(TARG) < SVt_PVLV) {
	655	sv_upgrade(TARG, SVt_PVLV);
	656	sv_magic(TARG, Nullsv, 'k', Nullch, 0);
	657	}
	658	LvTYPE(TARG) = 'k';
	659	LvTARG(TARG) = (SV*)hv;
	660	PUSHs(TARG);
	661	RETURN;
	662	}
	663
8990e307	664	if (!SvRMAGICAL(hv) \|\| !mg_find((SV*)hv,'P'))
463ee0b2	665	i = HvKEYS(hv);
	666	else {
	667	i = 0;
463ee0b2	668	/SUPPRESS 560/
	669	while (entry = hv_iternext(hv)) {
	670	i++;
	671	}
	672	}
	673	PUSHi( i );
	674	RETURN;
	675	}
	676
	677	/* Guess how much room we need. hv_max may be a few too many. Oh well. */
	678	EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));
	679
463ee0b2	680	PUTBACK; /* hv_iternext and hv_iterval might clobber stack_sp */
	681	while (entry = hv_iternext(hv)) {
	682	SPAGAIN;
8c2cee6f	683	if (dokeys)
8c2cee6f	684	XPUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
463ee0b2	685	if (dovalues) {
	686	tmpstr = NEWSV(45,0);
	687	PUTBACK;
	688	sv_setsv(tmpstr,hv_iterval(hv,entry));
	689	SPAGAIN;
	690	DEBUG_H( {
8c2cee6f	691	sprintf(buf,"%d%%%d=%d\n", HeHASH(entry),
	692	HvMAX(hv)+1, HeHASH(entry) & HvMAX(hv));
	693	sv_setpv(tmpstr,buf);
463ee0b2	694	} )
	695	XPUSHs(sv_2mortal(tmpstr));
	696	}
	697	PUTBACK;
	698	}
	699	return NORMAL;
	700	}
	701