[perl5.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);
		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 LW	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 LW	8	*/
	9
	10	/*
	11	* "'So that was the job I felt I had to do when I started,' thought Sam."
79072805 LW	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 LW	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 LW	43	if (SvREADONLY(sv))
a0d0e21e LW	44	croak(no_modify);
1476d272	45	tbl = (short*)cPVOP->op_pv;
1476d272	46	s = (U8*)SvPV(sv, len);
a0d0e21e LW	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 LW	55	DEBUG_t( deb("2.TBL\n"));
	56	if (!op->op_private) {
	57	while (s < send) {
1476d272	58	if ((ch = tbl[*s]) >= 0) {
79072805 LW	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 LW	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 LW	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 LW	101	STRLEN delimlen;
	102	register char *delim = SvPV(del, delimlen);
	103	STRLEN tmplen;
79072805 LW	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 LW	112	SvPV(*mark, tmplen);
463ee0b2 LW	113	len += tmplen;
79072805 LW	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 LW	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 LW	133	mark++;
463ee0b2 LW	134	}
79072805 LW	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 LW	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 LW	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 LW	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 LW	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 LW	206	case 'n': case '*':
	207	croak("Use of %c in printf format not supported", *t);
	208
79072805 LW	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 LW	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 LW	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 LW	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 LW	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 LW	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 LW	275	xlen = strlen(xs);
	276	break;
	277	case 's':
	278	ch = *(++t);
	279	*t = '\0';
463ee0b2 LW	280	xs = SvPV(arg, arglen);
463ee0b2 LW	281	xlen = (I32)arglen;
79072805 LW	282	if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
	283	break; /* so handle simple cases */
	284	}
	285	else if (f[1] == '-') {
93a17b20	286	char *mp = strchr(f, '.');
79072805 LW	287	I32 min = atoi(f+2);
	288
	289	if (mp) {
	290	I32 max = atoi(mp+1);
	291
	292	if (xlen > max)
	293	xlen = max;
	294	}
	295	if (xlen < min)
	296	post = min - xlen;
	297	break;
	298	}
	299	else if (isDIGIT(f[1])) {
93a17b20	300	char *mp = strchr(f, '.');
79072805 LW	301	I32 min = atoi(f+1);
	302
	303	if (mp) {
	304	I32 max = atoi(mp+1);
	305
	306	if (xlen > max)
	307	xlen = max;
	308	}
	309	if (xlen < min)
	310	pre = min - xlen;
	311	break;
	312	}
	313	strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
	314	*t = ch;
	315	(void)sprintf(buf,tokenbuf+64,xs);
	316	xs = buf;
	317	xlen = strlen(xs);
	318	break;
	319	}
	320	/* end of switch, copy results */
	321	*t = ch;
4633a7c4	322	if (xs == buf && xlen >= sizeof(buf)) { /* Ooops! */
760ac839	323	PerlIO_puts(PerlIO_stderr(),"panic: sprintf overflow - memory corrupted!\n");
4633a7c4 LW	324	my_exit(1);
4633a7c4 LW	325	}
79072805 LW	326	SvGROW(sv, SvCUR(sv) + (f - s) + xlen + 1 + pre + post);
	327	sv_catpvn(sv, s, f - s);
	328	if (pre) {
463ee0b2	329	repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, pre);
79072805 LW	330	SvCUR(sv) += pre;
	331	}
	332	sv_catpvn(sv, xs, xlen);
	333	if (post) {
463ee0b2	334	repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, post);
79072805 LW	335	SvCUR(sv) += post;
	336	}
	337	s = t;
	338	break; /* break from for loop */
	339	}
	340	}
	341	sv_catpvn(sv, s, t - s);
	342	SvSETMAGIC(sv);
	343	}
	344
	345	void
	346	do_vecset(sv)
	347	SV *sv;
	348	{
	349	SV *targ = LvTARG(sv);
	350	register I32 offset;
	351	register I32 size;
8990e307 LW	352	register unsigned char *s;
8990e307 LW	353	register unsigned long lval;
79072805	354	I32 mask;
a0d0e21e LW	355	STRLEN targlen;
a0d0e21e LW	356	STRLEN len;
79072805	357
8990e307 LW	358	if (!targ)
8990e307 LW	359	return;
a0d0e21e	360	s = (unsigned char*)SvPV_force(targ, targlen);
8990e307	361	lval = U_L(SvNV(sv));
79072805 LW	362	offset = LvTARGOFF(sv);
79072805 LW	363	size = LvTARGLEN(sv);
a0d0e21e LW	364
	365	len = (offset + size + 7) / 8;
	366	if (len > targlen) {
	367	s = (unsigned char*)SvGROW(targ, len + 1);
	368	(void)memzero(s + targlen, len - targlen + 1);
	369	SvCUR_set(targ, len);
	370	}
	371
79072805 LW	372	if (size < 8) {
	373	mask = (1 << size) - 1;
	374	size = offset & 7;
	375	lval &= mask;
	376	offset >>= 3;
	377	s[offset] &= ~(mask << size);
	378	s[offset] \|= lval << size;
	379	}
	380	else {
a0d0e21e	381	offset >>= 3;
79072805 LW	382	if (size == 8)
	383	s[offset] = lval & 255;
	384	else if (size == 16) {
	385	s[offset] = (lval >> 8) & 255;
	386	s[offset+1] = lval & 255;
	387	}
	388	else if (size == 32) {
	389	s[offset] = (lval >> 24) & 255;
	390	s[offset+1] = (lval >> 16) & 255;
	391	s[offset+2] = (lval >> 8) & 255;
	392	s[offset+3] = lval & 255;
	393	}
	394	}
	395	}
	396
	397	void
	398	do_chop(astr,sv)
	399	register SV *astr;
	400	register SV *sv;
	401	{
463ee0b2	402	STRLEN len;
a0d0e21e LW	403	char *s;
a0d0e21e LW	404
79072805	405	if (SvTYPE(sv) == SVt_PVAV) {
a0d0e21e LW	406	register I32 i;
	407	I32 max;
	408	AV* av = (AV*)sv;
	409	max = AvFILL(av);
	410	for (i = 0; i <= max; i++) {
	411	sv = (SV*)av_fetch(av, i, FALSE);
	412	if (sv && ((sv = (SV*)sv), sv != &sv_undef))
	413	do_chop(astr, sv);
	414	}
	415	return;
79072805 LW	416	}
79072805 LW	417	if (SvTYPE(sv) == SVt_PVHV) {
a0d0e21e LW	418	HV* hv = (HV*)sv;
	419	HE* entry;
	420	(void)hv_iterinit(hv);
	421	/SUPPRESS 560/
	422	while (entry = hv_iternext(hv))
	423	do_chop(astr,hv_iterval(hv,entry));
	424	return;
79072805	425	}
a0d0e21e	426	s = SvPV(sv, len);
748a9306	427	if (len && !SvPOK(sv))
a0d0e21e LW	428	s = SvPV_force(sv, len);
	429	if (s && len) {
	430	s += --len;
	431	sv_setpvn(astr, s, 1);
	432	*s = '\0';
	433	SvCUR_set(sv, len);
	434	SvNIOK_off(sv);
79072805 LW	435	}
79072805 LW	436	else
a0d0e21e LW	437	sv_setpvn(astr, "", 0);
	438	SvSETMAGIC(sv);
	439	}
	440
	441	I32
	442	do_chomp(sv)
	443	register SV *sv;
	444	{
c07a80fd	445	register I32 count;
a0d0e21e LW	446	STRLEN len;
a0d0e21e LW	447	char *s;
c07a80fd	448
	449	if (RsSNARF(rs))
	450	return 0;
	451	count = 0;
a0d0e21e LW	452	if (SvTYPE(sv) == SVt_PVAV) {
	453	register I32 i;
	454	I32 max;
	455	AV* av = (AV*)sv;
	456	max = AvFILL(av);
	457	for (i = 0; i <= max; i++) {
	458	sv = (SV*)av_fetch(av, i, FALSE);
	459	if (sv && ((sv = (SV*)sv), sv != &sv_undef))
	460	count += do_chomp(sv);
	461	}
	462	return count;
	463	}
	464	if (SvTYPE(sv) == SVt_PVHV) {
	465	HV* hv = (HV*)sv;
	466	HE* entry;
	467	(void)hv_iterinit(hv);
	468	/SUPPRESS 560/
	469	while (entry = hv_iternext(hv))
	470	count += do_chomp(hv_iterval(hv,entry));
	471	return count;
	472	}
	473	s = SvPV(sv, len);
	474	if (len && !SvPOKp(sv))
	475	s = SvPV_force(sv, len);
	476	if (s && len) {
	477	s += --len;
c07a80fd	478	if (RsPARA(rs)) {
a0d0e21e LW	479	if (*s != '\n')
	480	goto nope;
	481	++count;
	482	while (len && s[-1] == '\n') {
	483	--len;
	484	--s;
	485	++count;
	486	}
	487	}
a0d0e21e	488	else {
c07a80fd	489	STRLEN rslen;
	490	char *rsptr = SvPV(rs, rslen);
	491	if (rslen == 1) {
	492	if (s != rsptr)
	493	goto nope;
	494	++count;
	495	}
	496	else {
8c2cee6f	497	if (len < rslen - 1)
c07a80fd	498	goto nope;
	499	len -= rslen - 1;
	500	s -= rslen - 1;
e963928e	501	if (memcmp(s, rsptr, rslen))
c07a80fd	502	goto nope;
	503	count += rslen;
	504	}
a0d0e21e	505	}
a0d0e21e LW	506	*s = '\0';
	507	SvCUR_set(sv, len);
	508	SvNIOK_off(sv);
	509	}
	510	nope:
	511	SvSETMAGIC(sv);
	512	return count;
	513	}
79072805 LW	514
	515	void
	516	do_vop(optype,sv,left,right)
	517	I32 optype;
	518	SV *sv;
	519	SV *left;
	520	SV *right;
	521	{
	522	#ifdef LIBERAL
	523	register long *dl;
	524	register long *ll;
	525	register long *rl;
	526	#endif
	527	register char *dc;
463ee0b2 LW	528	STRLEN leftlen;
	529	STRLEN rightlen;
	530	register char *lc = SvPV(left, leftlen);
	531	register char *rc = SvPV(right, rightlen);
79072805	532	register I32 len;
a0d0e21e	533	I32 lensave;
e963928e	534	char *lsave = lc;
e963928e	535	char *rsave = rc;
79072805	536
a0d0e21e	537	dc = SvPV_force(sv,na);
93a17b20	538	len = leftlen < rightlen ? leftlen : rightlen;
a0d0e21e LW	539	lensave = len;
	540	if (SvCUR(sv) < len) {
	541	dc = SvGROW(sv,len + 1);
	542	(void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
79072805	543	}
a0d0e21e LW	544	SvCUR_set(sv, len);
a0d0e21e LW	545	(void)SvPOK_only(sv);
79072805 LW	546	#ifdef LIBERAL
	547	if (len >= sizeof(long)*4 &&
	548	!((long)dc % sizeof(long)) &&
	549	!((long)lc % sizeof(long)) &&
	550	!((long)rc % sizeof(long))) /* It's almost always aligned... */
	551	{
	552	I32 remainder = len % (sizeof(long)*4);
	553	len /= (sizeof(long)*4);
	554
	555	dl = (long*)dc;
	556	ll = (long*)lc;
	557	rl = (long*)rc;
	558
	559	switch (optype) {
	560	case OP_BIT_AND:
	561	while (len--) {
	562	dl++ = ll++ & *rl++;
	563	dl++ = ll++ & *rl++;
	564	dl++ = ll++ & *rl++;
	565	dl++ = ll++ & *rl++;
	566	}
	567	break;
a0d0e21e	568	case OP_BIT_XOR:
79072805 LW	569	while (len--) {
	570	dl++ = ll++ ^ *rl++;
	571	dl++ = ll++ ^ *rl++;
	572	dl++ = ll++ ^ *rl++;
	573	dl++ = ll++ ^ *rl++;
	574	}
	575	break;
	576	case OP_BIT_OR:
	577	while (len--) {
	578	dl++ = ll++ \| *rl++;
	579	dl++ = ll++ \| *rl++;
	580	dl++ = ll++ \| *rl++;
	581	dl++ = ll++ \| *rl++;
	582	}
	583	}
	584
	585	dc = (char*)dl;
	586	lc = (char*)ll;
	587	rc = (char*)rl;
	588
	589	len = remainder;
	590	}
	591	#endif
a0d0e21e	592	{
a0d0e21e LW	593	switch (optype) {
	594	case OP_BIT_AND:
	595	while (len--)
	596	dc++ = lc++ & *rc++;
	597	break;
	598	case OP_BIT_XOR:
	599	while (len--)
	600	dc++ = lc++ ^ *rc++;
	601	goto mop_up;
	602	case OP_BIT_OR:
	603	while (len--)
	604	dc++ = lc++ \| *rc++;
	605	mop_up:
	606	len = lensave;
	607	if (rightlen > len)
	608	sv_catpvn(sv, rsave + len, rightlen - len);
	609	else if (leftlen > len)
	610	sv_catpvn(sv, lsave + len, leftlen - len);
4633a7c4 LW	611	else
4633a7c4 LW	612	*SvEND(sv) = '\0';
a0d0e21e LW	613	break;
a0d0e21e LW	614	}
79072805 LW	615	}
79072805 LW	616	}
463ee0b2 LW	617
	618	OP *
	619	do_kv(ARGS)
	620	dARGS
	621	{
	622	dSP;
	623	HV hv = (HV)POPs;
463ee0b2	624	register HE *entry;
463ee0b2	625	SV *tmpstr;
a0d0e21e LW	626	I32 dokeys = (op->op_type == OP_KEYS);
	627	I32 dovalues = (op->op_type == OP_VALUES);
	628
	629	if (op->op_type == OP_RV2HV \|\| op->op_type == OP_PADHV)
	630	dokeys = dovalues = TRUE;
463ee0b2	631
85581909 SB	632	if (!hv) {
	633	if (op->op_flags & OPf_MOD) { /* lvalue */
	634	dTARGET; /* make sure to clear its target here */
	635	if (SvTYPE(TARG) == SVt_PVLV)
	636	LvTARG(TARG) = Nullsv;
	637	PUSHs(TARG);
	638	}
463ee0b2	639	RETURN;
85581909	640	}
748a9306 LW	641
	642	(void)hv_iterinit(hv); /* always reset iterator regardless */
	643
463ee0b2	644	if (GIMME != G_ARRAY) {
8c2cee6f	645	I32 i;
463ee0b2 LW	646	dTARGET;
463ee0b2 LW	647
85581909 SB	648	if (op->op_flags & OPf_MOD) { /* lvalue */
	649	if (SvTYPE(TARG) < SVt_PVLV) {
	650	sv_upgrade(TARG, SVt_PVLV);
	651	sv_magic(TARG, Nullsv, 'k', Nullch, 0);
	652	}
	653	LvTYPE(TARG) = 'k';
	654	LvTARG(TARG) = (SV*)hv;
	655	PUSHs(TARG);
	656	RETURN;
	657	}
	658
8990e307	659	if (!SvRMAGICAL(hv) \|\| !mg_find((SV*)hv,'P'))
463ee0b2 LW	660	i = HvKEYS(hv);
	661	else {
	662	i = 0;
463ee0b2 LW	663	/SUPPRESS 560/
	664	while (entry = hv_iternext(hv)) {
	665	i++;
	666	}
	667	}
	668	PUSHi( i );
	669	RETURN;
	670	}
	671
	672	/* Guess how much room we need. hv_max may be a few too many. Oh well. */
	673	EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));
	674
463ee0b2 LW	675	PUTBACK; /* hv_iternext and hv_iterval might clobber stack_sp */
	676	while (entry = hv_iternext(hv)) {
	677	SPAGAIN;
8c2cee6f	678	if (dokeys)
8c2cee6f	679	XPUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
463ee0b2 LW	680	if (dovalues) {
	681	tmpstr = NEWSV(45,0);
	682	PUTBACK;
	683	sv_setsv(tmpstr,hv_iterval(hv,entry));
	684	SPAGAIN;
	685	DEBUG_H( {
8c2cee6f	686	sprintf(buf,"%d%%%d=%d\n", HeHASH(entry),
	687	HvMAX(hv)+1, HeHASH(entry) & HvMAX(hv));
	688	sv_setpv(tmpstr,buf);
463ee0b2 LW	689	} )
	690	XPUSHs(sv_2mortal(tmpstr));
	691	}
	692	PUTBACK;
	693	}
	694	return NORMAL;
	695	}
	696