1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015
|
/********************************************
bi_funct.c
copyright 1991, Michael D. Brennan
This is a source file for mawk, an implementation of
the AWK programming language.
Mawk is distributed without warranty under the terms of
the GNU General Public License, version 2, 1991.
********************************************/
/* $Log: bi_funct.c,v $
* Revision 1.9 1996/01/14 17:16:11 mike
* flush_all_output() before system()
*
* Revision 1.8 1995/08/27 18:13:03 mike
* fix random number generator to work with longs larger than 32bits
*
* Revision 1.7 1995/06/09 22:53:30 mike
* change a memcmp() to strncmp() to make purify happy
*
* Revision 1.6 1994/12/13 00:26:32 mike
* rt_nr and rt_fnr for run-time error messages
*
* Revision 1.5 1994/12/11 22:14:11 mike
* remove THINK_C #defines. Not a political statement, just no indication
* that anyone ever used it.
*
* Revision 1.4 1994/12/10 21:44:12 mike
* fflush builtin
*
* Revision 1.3 1993/07/14 11:46:36 mike
* code cleanup
*
* Revision 1.2 1993/07/14 01:22:27 mike
* rm SIZE_T
*
* Revision 1.1.1.1 1993/07/03 18:58:08 mike
* move source to cvs
*
* Revision 5.5 1993/02/13 21:57:18 mike
* merge patch3
*
* Revision 5.4 1993/01/01 21:30:48 mike
* split new_STRING() into new_STRING and new_STRING0
*
* Revision 5.3.1.2 1993/01/27 01:04:06 mike
* minor tuning to str_str()
*
* Revision 5.3.1.1 1993/01/15 03:33:35 mike
* patch3: safer double to int conversion
*
* Revision 5.3 1992/12/17 02:48:01 mike
* 1.1.2d changes for DOS
*
* Revision 5.2 1992/07/08 15:43:41 brennan
* patch2: length returns. I am a wimp
*
* Revision 5.1 1991/12/05 07:55:35 brennan
* 1.1 pre-release
*
*/
#include "mawk.h"
#include "bi_funct.h"
#include "bi_vars.h"
#include "memory.h"
#include "init.h"
#include "files.h"
#include "fin.h"
#include "field.h"
#include "regexp.h"
#include "repl.h"
#include <math.h>
/* statics */
static STRING *PROTO(gsub, (PTR, CELL *, char *, int)) ;
static void PROTO(fplib_err, (char *, double, char *)) ;
/* global for the disassembler */
BI_REC bi_funct[] =
{ /* info to load builtins */
"length", bi_length, 0, 1, /* special must come first */
"index", bi_index, 2, 2,
"substr", bi_substr, 2, 3,
"sprintf", bi_sprintf, 1, 255,
"sin", bi_sin, 1, 1,
"cos", bi_cos, 1, 1,
"atan2", bi_atan2, 2, 2,
"exp", bi_exp, 1, 1,
"log", bi_log, 1, 1,
"int", bi_int, 1, 1,
"sqrt", bi_sqrt, 1, 1,
"rand", bi_rand, 0, 0,
"srand", bi_srand, 0, 1,
"close", bi_close, 1, 1,
"system", bi_system, 1, 1,
"toupper", bi_toupper, 1, 1,
"tolower", bi_tolower, 1, 1,
"fflush", bi_fflush, 0, 1,
(char *) 0, (PF_CP) 0, 0, 0} ;
/* load built-in functions in symbol table */
void
bi_funct_init()
{
register BI_REC *p ;
register SYMTAB *stp ;
/* length is special (posix bozo) */
stp = insert(bi_funct->name) ;
stp->type = ST_LENGTH ;
stp->stval.bip = bi_funct ;
for (p = bi_funct + 1; p->name; p++)
{
stp = insert(p->name) ;
stp->type = ST_BUILTIN ;
stp->stval.bip = p ;
}
/* seed rand() off the clock */
{
CELL c ;
c.type = 0 ; bi_srand(&c) ;
}
}
/**************************************************
string builtins (except split (in split.c) and [g]sub (at end))
**************************************************/
CELL *
bi_length(sp)
register CELL *sp ;
{
unsigned len ;
if (sp->type == 0) cellcpy(sp, field) ;
else sp-- ;
if (sp->type < C_STRING) cast1_to_s(sp) ;
len = string(sp)->len ;
free_STRING(string(sp)) ;
sp->type = C_DOUBLE ;
sp->dval = (double) len ;
return sp ;
}
char *
str_str(target, key, key_len)
register char *target ;
char *key ;
unsigned key_len ;
{
register int k = key[0] ;
switch (key_len)
{
case 0:
return (char *) 0 ;
case 1:
return strchr(target, k) ;
case 2:
{
int k1 = key[1] ;
while (target = strchr(target, k))
if (target[1] == k1) return target ;
else target++ ;
/*failed*/
return (char *) 0 ;
}
}
key_len-- ;
while (target = strchr(target, k))
{
if (strncmp(target + 1, key + 1, key_len) == 0) return target ;
else target++ ;
}
/*failed*/
return (char *) 0 ;
}
CELL *
bi_index(sp)
register CELL *sp ;
{
register int idx ;
unsigned len ;
char *p ;
sp-- ;
if (TEST2(sp) != TWO_STRINGS) cast2_to_s(sp) ;
if (len = string(sp + 1)->len)
idx = (p = str_str(string(sp)->str, string(sp + 1)->str, len))
? p - string(sp)->str + 1 : 0 ;
else /* index of the empty string */
idx = 1 ;
free_STRING(string(sp)) ;
free_STRING(string(sp + 1)) ;
sp->type = C_DOUBLE ;
sp->dval = (double) idx ;
return sp ;
}
/* substr(s, i, n)
if l = length(s) then get the characters
from max(1,i) to min(l,n-i-1) inclusive */
CELL *
bi_substr(sp)
CELL *sp ;
{
int n_args, len ;
register int i, n ;
STRING *sval ; /* substr(sval->str, i, n) */
n_args = sp->type ;
sp -= n_args ;
if (sp->type != C_STRING) cast1_to_s(sp) ;
/* don't use < C_STRING shortcut */
sval = string(sp) ;
if ((len = sval->len) == 0) /* substr on null string */
{
if (n_args == 3) cell_destroy(sp + 2) ;
cell_destroy(sp + 1) ;
return sp ;
}
if (n_args == 2)
{
n = MAX__INT ;
if (sp[1].type != C_DOUBLE) cast1_to_d(sp + 1) ;
}
else
{
if (TEST2(sp + 1) != TWO_DOUBLES) cast2_to_d(sp + 1) ;
n = d_to_i(sp[2].dval) ;
}
i = d_to_i(sp[1].dval) - 1 ; /* i now indexes into string */
if ( i < 0 ) { n += i ; i = 0 ; }
if (n > len - i) n = len - i ;
if (n <= 0) /* the null string */
{
sp->ptr = (PTR) & null_str ;
null_str.ref_cnt++ ;
}
else /* got something */
{
sp->ptr = (PTR) new_STRING0(n) ;
memcpy(string(sp)->str, sval->str + i, n) ;
}
free_STRING(sval) ;
return sp ;
}
/*
match(s,r)
sp[0] holds r, sp[-1] holds s
*/
CELL *
bi_match(sp)
register CELL *sp ;
{
char *p ;
unsigned length ;
if (sp->type != C_RE) cast_to_RE(sp) ;
if ((--sp)->type < C_STRING) cast1_to_s(sp) ;
cell_destroy(RSTART) ;
cell_destroy(RLENGTH) ;
RSTART->type = C_DOUBLE ;
RLENGTH->type = C_DOUBLE ;
p = REmatch(string(sp)->str, (sp + 1)->ptr, &length) ;
if (p)
{
sp->dval = (double) (p - string(sp)->str + 1) ;
RLENGTH->dval = (double) length ;
}
else
{
sp->dval = 0.0 ;
RLENGTH->dval = -1.0 ; /* posix */
}
free_STRING(string(sp)) ;
sp->type = C_DOUBLE ;
RSTART->dval = sp->dval ;
return sp ;
}
CELL *
bi_toupper(sp)
CELL *sp ;
{
STRING *old ;
register char *p, *q ;
if (sp->type != C_STRING) cast1_to_s(sp) ;
old = string(sp) ;
sp->ptr = (PTR) new_STRING0(old->len) ;
q = string(sp)->str ; p = old->str ;
while (*p)
{
*q = *p++ ;
if (*q >= 'a' && *q <= 'z') *q += 'A' - 'a' ;
q++ ;
}
free_STRING(old) ;
return sp ;
}
CELL *
bi_tolower(sp)
CELL *sp ;
{
STRING *old ;
register char *p, *q ;
if (sp->type != C_STRING) cast1_to_s(sp) ;
old = string(sp) ;
sp->ptr = (PTR) new_STRING0(old->len) ;
q = string(sp)->str ; p = old->str ;
while (*p)
{
*q = *p++ ;
if (*q >= 'A' && *q <= 'Z') *q += 'a' - 'A' ;
q++ ;
}
free_STRING(old) ;
return sp ;
}
/************************************************
arithemetic builtins
************************************************/
static void
fplib_err(fname, val, error)
char *fname ;
double val;
char *error ;
{
rt_error("%s(%g) : %s", fname, val, error) ;
}
CELL *
bi_sin(sp)
register CELL *sp ;
{
#if ! STDC_MATHERR
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
sp->dval = sin(sp->dval) ;
return sp ;
#else
double x;
errno = 0 ;
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
x = sp->dval ;
sp->dval = sin(sp->dval) ;
if (errno) fplib_err("sin", x, "loss of precision") ;
return sp ;
#endif
}
CELL *
bi_cos(sp)
register CELL *sp ;
{
#if ! STDC_MATHERR
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
sp->dval = cos(sp->dval) ;
return sp ;
#else
double x;
errno = 0 ;
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
x = sp->dval ;
sp->dval = cos(sp->dval) ;
if (errno) fplib_err("cos", x, "loss of precision") ;
return sp ;
#endif
}
CELL *
bi_atan2(sp)
register CELL *sp ;
{
#if ! STDC_MATHERR
sp-- ;
if (TEST2(sp) != TWO_DOUBLES) cast2_to_d(sp) ;
sp->dval = atan2(sp->dval, (sp + 1)->dval) ;
return sp ;
#else
errno = 0 ;
sp-- ;
if (TEST2(sp) != TWO_DOUBLES) cast2_to_d(sp) ;
sp->dval = atan2(sp->dval, (sp + 1)->dval) ;
if (errno) rt_error("atan2(0,0) : domain error") ;
return sp ;
#endif
}
CELL *
bi_log(sp)
register CELL *sp ;
{
#if ! STDC_MATHERR
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
sp->dval = log(sp->dval) ;
return sp ;
#else
double x;
errno = 0 ;
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
x = sp->dval ;
sp->dval = log(sp->dval) ;
if (errno) fplib_err("log", x, "domain error") ;
return sp ;
#endif
}
CELL *
bi_exp(sp)
register CELL *sp ;
{
#if ! STDC_MATHERR
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
sp->dval = exp(sp->dval) ;
return sp ;
#else
double x;
errno = 0 ;
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
x = sp->dval ;
sp->dval = exp(sp->dval) ;
if (errno && sp->dval) fplib_err("exp", x, "overflow") ;
/* on underflow sp->dval==0, ignore */
return sp ;
#endif
}
CELL *
bi_int(sp)
register CELL *sp ;
{
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
sp->dval = sp->dval >= 0.0 ? floor(sp->dval) : ceil(sp->dval) ;
return sp ;
}
CELL *
bi_sqrt(sp)
register CELL *sp ;
{
#if ! STDC_MATHERR
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
sp->dval = sqrt(sp->dval) ;
return sp ;
#else
double x;
errno = 0 ;
if (sp->type != C_DOUBLE) cast1_to_d(sp) ;
x = sp->dval ;
sp->dval = sqrt(sp->dval) ;
if (errno) fplib_err("sqrt", x, "domain error") ;
return sp ;
#endif
}
#ifndef NO_TIME_H
#include <time.h>
#else
#include <sys/types.h>
#endif
/* For portability, we'll use our own random number generator , taken
from: Park, SK and Miller KW, "Random Number Generators:
Good Ones are Hard to Find", CACM, 31, 1192-1201, 1988.
*/
static long seed ; /* must be >=1 and < 2^31-1 */
static CELL cseed ; /* argument of last call to srand() */
#define M 0x7fffffff /* 2^31-1 */
#define MX 0xffffffff
#define A 16807
#define Q 127773 /* M/A */
#define R 2836 /* M%A */
#if M == MAX__LONG
#define crank(s) s = A * (s % Q) - R * (s / Q) ;\
if ( s <= 0 ) s += M
#else
/* 64 bit longs */
#define crank(s) { unsigned long t = s ;\
t = (A * (t % Q) - R * (t / Q)) & MX ;\
if ( t >= M ) t = (t+M)&M ;\
s = t ;\
}
#endif
CELL *
bi_srand(sp)
register CELL *sp ;
{
CELL c ;
if (sp->type == 0) /* seed off clock */
{
cellcpy(sp, &cseed) ;
cell_destroy(&cseed) ;
cseed.type = C_DOUBLE ;
cseed.dval = (double) time((time_t *) 0) ;
}
else /* user seed */
{
sp-- ;
/* swap cseed and *sp ; don't need to adjust ref_cnts */
c = *sp ; *sp = cseed ; cseed = c ;
}
/* The old seed is now in *sp ; move the value in cseed to
seed in range [1,M) */
cellcpy(&c, &cseed) ;
if (c.type == C_NOINIT) cast1_to_d(&c) ;
seed = c.type == C_DOUBLE ? (d_to_i(c.dval) & M) % M + 1 :
hash(string(&c)->str) % M + 1 ;
if( seed == M ) seed = M-1 ;
cell_destroy(&c) ;
/* crank it once so close seeds don't give a close
first result */
crank(seed) ;
return sp ;
}
CELL *
bi_rand(sp)
register CELL *sp ;
{
crank(seed) ;
sp++ ;
sp->type = C_DOUBLE ;
sp->dval = (double) seed / (double) M ;
return sp ;
}
#undef A
#undef M
#undef MX
#undef Q
#undef R
#undef crank
/*************************************************
miscellaneous builtins
close, system and getline
fflush
*************************************************/
CELL *
bi_close(sp)
register CELL *sp ;
{
int x ;
if (sp->type < C_STRING) cast1_to_s(sp) ;
x = file_close((STRING *) sp->ptr) ;
free_STRING(string(sp)) ;
sp->type = C_DOUBLE ;
sp->dval = (double) x ;
return sp ;
}
CELL *
bi_fflush(sp)
register CELL *sp ;
{
int ret = 0 ;
if ( sp->type == 0 ) fflush(stdout) ;
else
{
sp-- ;
if ( sp->type < C_STRING ) cast1_to_s(sp) ;
ret = file_flush(string(sp)) ;
free_STRING(string(sp)) ;
}
sp->type = C_DOUBLE ;
sp->dval = (double) ret ;
return sp ;
}
#if HAVE_REAL_PIPES
CELL *
bi_system(sp)
CELL *sp ;
{
int pid ;
unsigned ret_val ;
if (sp->type < C_STRING) cast1_to_s(sp) ;
flush_all_output() ;
switch (pid = fork())
{
case -1: /* fork failed */
errmsg(errno, "could not create a new process") ;
ret_val = 127 ;
break ;
case 0: /* the child */
execl(shell, shell, "-c", string(sp)->str, (char *) 0) ;
/* if get here, execl() failed */
errmsg(errno, "execute of %s failed", shell) ;
fflush(stderr) ;
_exit(127) ;
default: /* wait for the child */
ret_val = wait_for(pid) ;
break ;
}
cell_destroy(sp) ;
sp->type = C_DOUBLE ;
sp->dval = (double) ret_val ;
return sp ;
}
#endif /* HAVE_REAL_PIPES */
#if MSDOS
CELL *
bi_system(sp)
register CELL *sp ;
{
int retval ;
if (sp->type < C_STRING) cast1_to_s(sp) ;
retval = DOSexec(string(sp)->str) ;
free_STRING(string(sp)) ;
sp->type = C_DOUBLE ;
sp->dval = (double) retval ;
return sp ;
}
#endif
/* getline() */
/* if type == 0 : stack is 0 , target address
if type == F_IN : stack is F_IN, expr(filename), target address
if type == PIPE_IN : stack is PIPE_IN, target address, expr(pipename)
*/
CELL *
bi_getline(sp)
register CELL *sp ;
{
CELL tc, *cp ;
char *p ;
unsigned len ;
FIN *fin_p ;
switch (sp->type)
{
case 0:
sp-- ;
if (!main_fin) open_main() ;
if (!(p = FINgets(main_fin, &len))) goto eof ;
cp = (CELL *) sp->ptr ;
if (TEST2(NR) != TWO_DOUBLES) cast2_to_d(NR) ;
NR->dval += 1.0 ; rt_nr++ ;
FNR->dval += 1.0 ; rt_fnr++ ;
break ;
case F_IN:
sp-- ;
if (sp->type < C_STRING) cast1_to_s(sp) ;
fin_p = (FIN *) file_find(sp->ptr, F_IN) ;
free_STRING(string(sp)) ;
sp-- ;
if (!fin_p) goto open_failure ;
if (!(p = FINgets(fin_p, &len)))
{
FINsemi_close(fin_p) ;
goto eof ;
}
cp = (CELL *) sp->ptr ;
break ;
case PIPE_IN:
sp -= 2 ;
if (sp->type < C_STRING) cast1_to_s(sp) ;
fin_p = (FIN *) file_find(sp->ptr, PIPE_IN) ;
free_STRING(string(sp)) ;
if (!fin_p) goto open_failure ;
if (!(p = FINgets(fin_p, &len)))
{
FINsemi_close(fin_p) ;
#if HAVE_REAL_PIPES
/* reclaim process slot */
wait_for(0) ;
#endif
goto eof ;
}
cp = (CELL *) (sp + 1)->ptr ;
break ;
default:
bozo("type in bi_getline") ;
}
/* we've read a line , store it */
if (len == 0)
{
tc.type = C_STRING ;
tc.ptr = (PTR) & null_str ;
null_str.ref_cnt++ ;
}
else
{
tc.type = C_MBSTRN ;
tc.ptr = (PTR) new_STRING0(len) ;
memcpy(string(&tc)->str, p, len) ;
}
slow_cell_assign(cp, &tc) ;
cell_destroy(&tc) ;
sp->dval = 1.0 ; goto done ;
open_failure:
sp->dval = -1.0 ; goto done ;
eof:
sp->dval = 0.0 ; /* fall thru to done */
done:sp->type = C_DOUBLE;
return sp ;
}
/**********************************************
sub() and gsub()
**********************************************/
/* entry: sp[0] = address of CELL to sub on
sp[-1] = substitution CELL
sp[-2] = regular expression to match
*/
CELL *
bi_sub(sp)
register CELL *sp ;
{
CELL *cp ; /* pointer to the replacement target */
CELL tc ; /* build the new string here */
CELL sc ; /* copy of the target CELL */
char *front, *middle, *back ; /* pieces */
unsigned front_len, middle_len, back_len ;
sp -= 2 ;
if (sp->type != C_RE) cast_to_RE(sp) ;
if (sp[1].type != C_REPL && sp[1].type != C_REPLV)
cast_to_REPL(sp + 1) ;
cp = (CELL *) (sp + 2)->ptr ;
/* make a copy of the target, because we won't change anything
including type unless the match works */
cellcpy(&sc, cp) ;
if (sc.type < C_STRING) cast1_to_s(&sc) ;
front = string(&sc)->str ;
if (middle = REmatch(front, sp->ptr, &middle_len))
{
front_len = middle - front ;
back = middle + middle_len ;
back_len = string(&sc)->len - front_len - middle_len ;
if ((sp + 1)->type == C_REPLV)
{
STRING *sval = new_STRING0(middle_len) ;
memcpy(sval->str, middle, middle_len) ;
replv_to_repl(sp + 1, sval) ;
free_STRING(sval) ;
}
tc.type = C_STRING ;
tc.ptr = (PTR) new_STRING0(
front_len + string(sp + 1)->len + back_len) ;
{
char *p = string(&tc)->str ;
if (front_len)
{
memcpy(p, front, front_len) ;
p += front_len ;
}
if (string(sp + 1)->len)
{
memcpy(p, string(sp + 1)->str, string(sp + 1)->len) ;
p += string(sp + 1)->len ;
}
if (back_len) memcpy(p, back, back_len) ;
}
slow_cell_assign(cp, &tc) ;
free_STRING(string(&tc)) ;
}
free_STRING(string(&sc)) ;
repl_destroy(sp + 1) ;
sp->type = C_DOUBLE ;
sp->dval = middle != (char *) 0 ? 1.0 : 0.0 ;
return sp ;
}
static unsigned repl_cnt ; /* number of global replacements */
/* recursive global subsitution
dealing with empty matches makes this mildly painful
*/
static STRING *
gsub(re, repl, target, flag)
PTR re ;
CELL *repl ; /* always of type REPL or REPLV,
destroyed by caller */
char *target ;
/* if on, match of empty string at front is OK */
int flag ;
{
char *front, *middle ;
STRING *back ;
unsigned front_len, middle_len ;
STRING *ret_val ;
CELL xrepl ; /* a copy of repl so we can change repl */
if (!(middle = REmatch(target, re, &middle_len)))
return new_STRING(target) ;/* no match */
cellcpy(&xrepl, repl) ;
if (!flag && middle_len == 0 && middle == target)
{ /* match at front that's not allowed */
if (*target == 0) /* target is empty string */
{
repl_destroy(&xrepl) ;
null_str.ref_cnt++ ;
return &null_str ;
}
else
{
char xbuff[2] ;
front_len = 0 ;
/* make new repl with target[0] */
repl_destroy(repl) ;
xbuff[0] = *target++ ; xbuff[1] = 0 ;
repl->type = C_REPL ;
repl->ptr = (PTR) new_STRING(xbuff) ;
back = gsub(re, &xrepl, target, 1) ;
}
}
else /* a match that counts */
{
repl_cnt++ ;
front = target ;
front_len = middle - target ;
if (*middle == 0) /* matched back of target */
{
back = &null_str ;
null_str.ref_cnt++ ;
}
else back = gsub(re, &xrepl, middle + middle_len, 0) ;
/* patch the &'s if needed */
if (repl->type == C_REPLV)
{
STRING *sval = new_STRING0(middle_len) ;
memcpy(sval->str, middle, middle_len) ;
replv_to_repl(repl, sval) ;
free_STRING(sval) ;
}
}
/* put the three pieces together */
ret_val = new_STRING0(front_len + string(repl)->len + back->len) ;
{
char *p = ret_val->str ;
if (front_len)
{
memcpy(p, front, front_len) ;
p += front_len ;
}
if (string(repl)->len)
{
memcpy(p, string(repl)->str, string(repl)->len) ;
p += string(repl)->len ;
}
if (back->len) memcpy(p, back->str, back->len) ;
}
/* cleanup, repl is freed by the caller */
repl_destroy(&xrepl) ;
free_STRING(back) ;
return ret_val ;
}
/* set up for call to gsub() */
CELL *
bi_gsub(sp)
register CELL *sp ;
{
CELL *cp ; /* pts at the replacement target */
CELL sc ; /* copy of replacement target */
CELL tc ; /* build the result here */
sp -= 2 ;
if (sp->type != C_RE) cast_to_RE(sp) ;
if ((sp + 1)->type != C_REPL && (sp + 1)->type != C_REPLV)
cast_to_REPL(sp + 1) ;
cellcpy(&sc, cp = (CELL *) (sp + 2)->ptr) ;
if (sc.type < C_STRING) cast1_to_s(&sc) ;
repl_cnt = 0 ;
tc.ptr = (PTR) gsub(sp->ptr, sp + 1, string(&sc)->str, 1) ;
if (repl_cnt)
{
tc.type = C_STRING ;
slow_cell_assign(cp, &tc) ;
}
/* cleanup */
free_STRING(string(&sc)) ; free_STRING(string(&tc)) ;
repl_destroy(sp + 1) ;
sp->type = C_DOUBLE ;
sp->dval = (double) repl_cnt ;
return sp ;
}
|