Skip to content
Snippets Groups Projects
ast_expr2.y 20.1 KiB
Newer Older
  • Learn to ignore specific revisions
  • %{
    /* Written by Pace Willisson (pace@blitz.com) 
     * and placed in the public domain.
     *
     * Largely rewritten by J.T. Conklin (jtc@wimsey.com)
     *
     * And then overhauled twice by Steve Murphy (murf@e-tools.com)
     * to add double-quoted strings, allow mult. spaces, improve
     * error messages, and then to fold in a flex scanner for the 
     * yylex operation.
     *
     * $FreeBSD: src/bin/expr/expr.y,v 1.16 2000/07/22 10:59:36 se Exp $
     */
    
    #include <sys/types.h>
    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    #include <locale.h>
    #include <ctype.h>
    
    #include <err.h>
    
    #else
    #define quad_t uint64_t
    #endif
    
    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
    #include <errno.h>
    #include <regex.h>
    #include <limits.h>
    #include <asterisk/ast_expr.h>
    #include <asterisk/logger.h>
    
    #ifdef LONG_LONG_MIN
    #define QUAD_MIN LONG_LONG_MIN
    #endif
    #ifdef LONG_LONG_MAX
    #define QUAD_MAX LONG_LONG_MAX
    #endif
    
    #  if ! defined(QUAD_MIN)
    #   define QUAD_MIN     (-0x7fffffffffffffffL-1)
    #  endif
    #  if ! defined(QUAD_MAX)
    #   define QUAD_MAX     (0x7fffffffffffffffL)
    #  endif
    
    #define YYPARSE_PARAM parseio
    #define YYLEX_PARAM ((struct parse_io *)parseio)->scanner
    #define YYERROR_VERBOSE 1
    
    /* #define ast_log fprintf
    #define LOG_WARNING stderr */
      
    enum valtype {
    	AST_EXPR_integer, AST_EXPR_numeric_string, AST_EXPR_string
    } ;
    
    struct val {
    	enum valtype type;
    	union {
    		char *s;
    		quad_t i;
    	} u;
    } ;
    
    typedef void *yyscan_t;
    
    struct parse_io
    {
    	char *string;
    	struct val *val;
    	yyscan_t scanner;
    };
     
    static int		chk_div __P((quad_t, quad_t));
    static int		chk_minus __P((quad_t, quad_t, quad_t));
    static int		chk_plus __P((quad_t, quad_t, quad_t));
    static int		chk_times __P((quad_t, quad_t, quad_t));
    static void		free_value __P((struct val *));
    static int		is_zero_or_null __P((struct val *));
    static int		isstring __P((struct val *));
    static struct val	*make_integer __P((quad_t));
    static struct val	*make_str __P((const char *));
    static struct val	*op_and __P((struct val *, struct val *));
    static struct val	*op_colon __P((struct val *, struct val *));
    static struct val	*op_eqtilde __P((struct val *, struct val *));
    static struct val	*op_div __P((struct val *, struct val *));
    static struct val	*op_eq __P((struct val *, struct val *));
    static struct val	*op_ge __P((struct val *, struct val *));
    static struct val	*op_gt __P((struct val *, struct val *));
    static struct val	*op_le __P((struct val *, struct val *));
    static struct val	*op_lt __P((struct val *, struct val *));
    static struct val	*op_minus __P((struct val *, struct val *));
    static struct val	*op_negate __P((struct val *));
    static struct val	*op_compl __P((struct val *));
    static struct val	*op_ne __P((struct val *, struct val *));
    static struct val	*op_or __P((struct val *, struct val *));
    static struct val	*op_plus __P((struct val *, struct val *));
    static struct val	*op_rem __P((struct val *, struct val *));
    static struct val	*op_times __P((struct val *, struct val *));
    static quad_t		to_integer __P((struct val *));
    static void		to_string __P((struct val *));
    
    /* uh, if I want to predeclare yylex with a YYLTYPE, I have to predeclare the yyltype... sigh */
    typedef struct yyltype
    {
      int first_line;
      int first_column;
    
      int last_line;
      int last_column;
    } yyltype;
    
    # define YYLTYPE yyltype
    # define YYLTYPE_IS_TRIVIAL 1
    
    /* we will get warning about no prototype for yylex! But we can't
       define it here, we have no definition yet for YYSTYPE. */
    
    int		ast_yyerror(const char *,YYLTYPE *, struct parse_io *);
     
    /* I wanted to add args to the yyerror routine, so I could print out
       some useful info about the error. Not as easy as it looks, but it
       is possible. */
    #define ast_yyerror(x) ast_yyerror(x,&yyloc,parseio)
    
    %}
     
    %pure-parser
    %locations
    /* %debug  for when you are having big problems */
    
    /* %name-prefix="ast_yy" */
    
    %union
    {
    	struct val *val;
    }
    
    /* IN_ANOTHER_LIFE
    %{
    static int		ast_yylex __P((YYSTYPE *, YYLTYPE *, yyscan_t));
    %}
    */
    
    %left <val> TOK_OR
    %left <val> TOK_AND
    %left <val> TOK_EQ TOK_GT TOK_LT TOK_GE TOK_LE TOK_NE
    %left <val> TOK_PLUS TOK_MINUS
    %left <val> TOK_MULT TOK_DIV TOK_MOD
    %left <val> TOK_COMPL TOK_EQTILDE
    %left UMINUS
    %left <val> TOK_COLON
    %left <val> TOK_RP TOK_LP
    
    %token <val> TOKEN
    %type <val> start expr
    
    %%
    
    start: expr { ((struct parse_io *)parseio)->val = (struct val *)calloc(sizeof(struct val),1);
                  ((struct parse_io *)parseio)->val->type = $$->type;
                  ((struct parse_io *)parseio)->val->u.s = $$->u.s; }
    	;
    
    expr:	TOKEN   { $$= $1;}
    	| TOK_LP expr TOK_RP { $$ = $2; 
    	                       @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						   @$.first_line=0; @$.last_line=0;}
    	| expr TOK_OR expr { $$ = op_or ($1, $3);
                             @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						 @$.first_line=0; @$.last_line=0;}
    	| expr TOK_AND expr { $$ = op_and ($1, $3); 
    	                      @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
                              @$.first_line=0; @$.last_line=0;}
    	| expr TOK_EQ expr { $$ = op_eq ($1, $3); 
    	                     @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						 @$.first_line=0; @$.last_line=0;}
    	| expr TOK_GT expr { $$ = op_gt ($1, $3);
                             @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						 @$.first_line=0; @$.last_line=0;}
    	| expr TOK_LT expr { $$ = op_lt ($1, $3); 
    	                     @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						 @$.first_line=0; @$.last_line=0;}
    	| expr TOK_GE expr  { $$ = op_ge ($1, $3); 
    	                      @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						  @$.first_line=0; @$.last_line=0;}
    	| expr TOK_LE expr  { $$ = op_le ($1, $3); 
    	                      @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						  @$.first_line=0; @$.last_line=0;}
    	| expr TOK_NE expr  { $$ = op_ne ($1, $3); 
    	                      @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						  @$.first_line=0; @$.last_line=0;}
    	| expr TOK_PLUS expr { $$ = op_plus ($1, $3); 
    	                       @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						   @$.first_line=0; @$.last_line=0;}
    	| expr TOK_MINUS expr { $$ = op_minus ($1, $3); 
    	                        @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    							@$.first_line=0; @$.last_line=0;}
    	| TOK_MINUS expr %prec UMINUS { $$ = op_negate ($2); 
    	                        @$.first_column = @1.first_column; @$.last_column = @2.last_column; 
    							@$.first_line=0; @$.last_line=0;}
    	| TOK_COMPL expr %prec UMINUS { $$ = op_compl ($2); 
    	                        @$.first_column = @1.first_column; @$.last_column = @2.last_column; 
    							@$.first_line=0; @$.last_line=0;}
    	| expr TOK_MULT expr { $$ = op_times ($1, $3); 
    	                       @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						   @$.first_line=0; @$.last_line=0;}
    	| expr TOK_DIV expr { $$ = op_div ($1, $3); 
    	                      @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						  @$.first_line=0; @$.last_line=0;}
    	| expr TOK_MOD expr { $$ = op_rem ($1, $3); 
    	                      @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    						  @$.first_line=0; @$.last_line=0;}
    	| expr TOK_COLON expr { $$ = op_colon ($1, $3); 
    	                        @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    							@$.first_line=0; @$.last_line=0;}
    	| expr TOK_EQTILDE expr { $$ = op_eqtilde ($1, $3); 
    	                        @$.first_column = @1.first_column; @$.last_column = @3.last_column; 
    							@$.first_line=0; @$.last_line=0;}
    	;
    
    %%
    
    static struct val *
    make_integer (quad_t i)
    {
    	struct val *vp;
    
    	vp = (struct val *) malloc (sizeof (*vp));
    	if (vp == NULL) {
    		ast_log(LOG_WARNING, "malloc() failed\n");
    		return(NULL);
    	}
    
    	vp->type = AST_EXPR_integer;
    	vp->u.i  = i;
    	return vp; 
    }
    
    static struct val *
    make_str (const char *s)
    {
    	struct val *vp;
    	size_t i;
    	int isint;
    
    	vp = (struct val *) malloc (sizeof (*vp));
    	if (vp == NULL || ((vp->u.s = strdup (s)) == NULL)) {
    		ast_log(LOG_WARNING,"malloc() failed\n");
    		return(NULL);
    	}
    
    	for(i = 1, isint = isdigit(s[0]) || s[0] == '-';
    	    isint && i < strlen(s);
    	    i++)
    	{
    		if(!isdigit(s[i]))
    			 isint = 0;
    	}
    
    	if (isint)
    		vp->type = AST_EXPR_numeric_string;
    	else	
    		vp->type = AST_EXPR_string;
    
    	return vp;
    }
    
    
    static void
    free_value (struct val *vp)
    {	
    	if (vp==NULL) {
    		return;
    	}
    	if (vp->type == AST_EXPR_string || vp->type == AST_EXPR_numeric_string)
    		free (vp->u.s);	
    }
    
    
    static quad_t
    to_integer (struct val *vp)
    {
    	quad_t i;
    
    	if (vp == NULL) {
    		ast_log(LOG_WARNING,"vp==NULL in to_integer()\n");
    		return(0);
    	}
    
    	if (vp->type == AST_EXPR_integer)
    		return 1;
    
    	if (vp->type == AST_EXPR_string)
    		return 0;
    
    	/* vp->type == AST_EXPR_numeric_string, make it numeric */
    	errno = 0;
    	i  = strtoq(vp->u.s, (char**)NULL, 10);
    	if (errno != 0) {
    		free(vp->u.s);
    		ast_log(LOG_WARNING,"overflow\n");
    		return(0);
    	}
    	free (vp->u.s);
    	vp->u.i = i;
    	vp->type = AST_EXPR_integer;
    	return 1;
    }
    
    static void
    strip_quotes(struct val *vp)
    {
    	if (vp->type != AST_EXPR_string && vp->type != AST_EXPR_numeric_string)
    		return;
    	
    	if( vp->u.s[0] == '"' && vp->u.s[strlen(vp->u.s)-1] == '"' )
    	{
    		char *f, *t;
    		f = vp->u.s;
    		t = vp->u.s;
    		
    		while( *f )
    		{
    			if( *f  && *f != '"' )
    				*t++ = *f++;
    			else
    				f++;
    		}
    		*t = *f;
    	}
    }
    
    static void
    to_string (struct val *vp)
    {
    	char *tmp;
    
    	if (vp->type == AST_EXPR_string || vp->type == AST_EXPR_numeric_string)
    		return;
    
    	tmp = malloc ((size_t)25);
    	if (tmp == NULL) {
    		ast_log(LOG_WARNING,"malloc() failed\n");
    		return;
    	}
    
    	sprintf (tmp, "%lld", (long long)vp->u.i);
    	vp->type = AST_EXPR_string;
    	vp->u.s  = tmp;
    }
    
    
    static int
    isstring (struct val *vp)
    {
    	/* only TRUE if this string is not a valid integer */
    	return (vp->type == AST_EXPR_string);
    }
    
    
    static int
    is_zero_or_null (struct val *vp)
    {
    	if (vp->type == AST_EXPR_integer) {
    		return (vp->u.i == 0);
    	} else {
    		return (*vp->u.s == 0 || (to_integer (vp) && vp->u.i == 0));
    	}
    	/* NOTREACHED */
    }
    
    #ifdef STANDALONE
    
    void ast_log(int level, const char *file, int line, const char *function, const char *fmt, ...)
    {
    	printf("LOG: lev:%d file:%s  line:%d func: %s  fmt:%s\n",
    		   level, file, line, function, fmt);
    	fflush(stdout);
    }
    
    int main(int argc,char **argv) {
    	char *s;
    
    	s=ast_expr(argv[1]);
    
    	printf("=====%s======\n",s);
    }
    
    #endif
    
    #undef ast_yyerror
    #define ast_yyerror(x) ast_yyerror(x, YYLTYPE *yylloc, struct parse_io *parseio)
    
    /* I put the ast_yyerror func in the flex input file,
       because it refers to the buffer state. Best to
       let it access the BUFFER stuff there and not trying
       define all the structs, macros etc. in this file! */
    
    
    static struct val *
    op_or (struct val *a, struct val *b)
    {
    	if (is_zero_or_null (a)) {
    		free_value (a);
    		return (b);
    	} else {
    		free_value (b);
    		return (a);
    	}
    }
    		
    static struct val *
    op_and (struct val *a, struct val *b)
    {
    	if (is_zero_or_null (a) || is_zero_or_null (b)) {
    		free_value (a);
    		free_value (b);
    		return (make_integer ((quad_t)0));
    	} else {
    		free_value (b);
    		return (a);
    	}
    }
    
    static struct val *
    op_eq (struct val *a, struct val *b)
    {
    	struct val *r; 
    
    	if (isstring (a) || isstring (b)) {
    		to_string (a);
    		to_string (b);	
    		r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) == 0));
    	} else {
    		(void)to_integer(a);
    		(void)to_integer(b);
    		r = make_integer ((quad_t)(a->u.i == b->u.i));
    	}
    
    	free_value (a);
    	free_value (b);
    	return r;
    }
    
    static struct val *
    op_gt (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (isstring (a) || isstring (b)) {
    		to_string (a);
    		to_string (b);
    		r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) > 0));
    	} else {
    		(void)to_integer(a);
    		(void)to_integer(b);
    		r = make_integer ((quad_t)(a->u.i > b->u.i));
    	}
    
    	free_value (a);
    	free_value (b);
    	return r;
    }
    
    static struct val *
    op_lt (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (isstring (a) || isstring (b)) {
    		to_string (a);
    		to_string (b);
    		r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) < 0));
    	} else {
    		(void)to_integer(a);
    		(void)to_integer(b);
    		r = make_integer ((quad_t)(a->u.i < b->u.i));
    	}
    
    	free_value (a);
    	free_value (b);
    	return r;
    }
    
    static struct val *
    op_ge (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (isstring (a) || isstring (b)) {
    		to_string (a);
    		to_string (b);
    		r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) >= 0));
    	} else {
    		(void)to_integer(a);
    		(void)to_integer(b);
    		r = make_integer ((quad_t)(a->u.i >= b->u.i));
    	}
    
    	free_value (a);
    	free_value (b);
    	return r;
    }
    
    static struct val *
    op_le (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (isstring (a) || isstring (b)) {
    		to_string (a);
    		to_string (b);
    		r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) <= 0));
    	} else {
    		(void)to_integer(a);
    		(void)to_integer(b);
    		r = make_integer ((quad_t)(a->u.i <= b->u.i));
    	}
    
    	free_value (a);
    	free_value (b);
    	return r;
    }
    
    static struct val *
    op_ne (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (isstring (a) || isstring (b)) {
    		to_string (a);
    		to_string (b);
    		r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) != 0));
    	} else {
    		(void)to_integer(a);
    		(void)to_integer(b);
    		r = make_integer ((quad_t)(a->u.i != b->u.i));
    	}
    
    	free_value (a);
    	free_value (b);
    	return r;
    }
    
    static int
    chk_plus (quad_t a, quad_t b, quad_t r)
    {
    	/* sum of two positive numbers must be positive */
    	if (a > 0 && b > 0 && r <= 0)
    		return 1;
    	/* sum of two negative numbers must be negative */
    	if (a < 0 && b < 0 && r >= 0)
    		return 1;
    	/* all other cases are OK */
    	return 0;
    }
    
    static struct val *
    op_plus (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (!to_integer (a)) {
    		ast_log(LOG_WARNING,"non-numeric argument\n");
    		if (!to_integer (b)) {
    			free_value(a);
    			free_value(b);
    			return make_integer(0);
    		} else {
    			free_value(a);
    			return (b);
    		}
    	} else if (!to_integer(b)) {
    		free_value(b);
    		return (a);
    	}
    
    	r = make_integer (/*(quad_t)*/(a->u.i + b->u.i));
    	if (chk_plus (a->u.i, b->u.i, r->u.i)) {
    		ast_log(LOG_WARNING,"overflow\n");
    	}
    	free_value (a);
    	free_value (b);
    	return r;
    }
    
    static int
    chk_minus (quad_t a, quad_t b, quad_t r)
    {
    	/* special case subtraction of QUAD_MIN */
    	if (b == QUAD_MIN) {
    		if (a >= 0)
    			return 1;
    		else
    			return 0;
    	}
    	/* this is allowed for b != QUAD_MIN */
    	return chk_plus (a, -b, r);
    }
    
    static struct val *
    op_minus (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (!to_integer (a)) {
    		ast_log(LOG_WARNING, "non-numeric argument\n");
    		if (!to_integer (b)) {
    			free_value(a);
    			free_value(b);
    			return make_integer(0);
    		} else {
    			r = make_integer(0 - b->u.i);
    			free_value(a);
    			free_value(b);
    			return (r);
    		}
    	} else if (!to_integer(b)) {
    		ast_log(LOG_WARNING, "non-numeric argument\n");
    		free_value(b);
    		return (a);
    	}
    
    	r = make_integer (/*(quad_t)*/(a->u.i - b->u.i));
    	if (chk_minus (a->u.i, b->u.i, r->u.i)) {
    		ast_log(LOG_WARNING, "overflow\n");
    	}
    	free_value (a);
    	free_value (b);
    	return r;
    }
    
    static struct val *
    op_negate (struct val *a)
    {
    	struct val *r;
    
    	if (!to_integer (a) ) {
    		free_value(a);
    		ast_log(LOG_WARNING, "non-numeric argument\n");
    		return make_integer(0);
    	}
    
    	r = make_integer (/*(quad_t)*/(- a->u.i));
    	if (chk_minus (0, a->u.i, r->u.i)) {
    		ast_log(LOG_WARNING, "overflow\n");
    	}
    	free_value (a);
    	return r;
    }
    
    static struct val *
    op_compl (struct val *a)
    {
    	int v1 = 1;
    	struct val *r;
    	
    	if( !a )
    	{
    		v1 = 0;
    	}
    	else
    	{
    		switch( a->type )
    		{
    		case AST_EXPR_integer:
    			if( a->u.i == 0 )
    				v1 = 0;
    			break;
    			
    		case AST_EXPR_string:
    			if( a->u.s == 0 )
    				v1 = 0;
    			else
    			{
    				if( a->u.s[0] == 0 )
    					v1 = 0;
    				else if (strlen(a->u.s) == 1 && a->u.s[0] == '0' )
    					v1 = 0;
    			}
    			break;
    			
    		case AST_EXPR_numeric_string:
    			if( a->u.s == 0 )
    				v1 = 0;
    			else
    			{
    				if( a->u.s[0] == 0 )
    					v1 = 0;
    				else if (strlen(a->u.s) == 1 && a->u.s[0] == '0' )
    					v1 = 0;
    			}
    			break;
    		}
    	}
    	
    	r = make_integer (!v1);
    	free_value (a);
    	return r;
    }
    
    static int
    chk_times (quad_t a, quad_t b, quad_t r)
    {
    	/* special case: first operand is 0, no overflow possible */
    	if (a == 0)
    		return 0;
    	/* cerify that result of division matches second operand */
    	if (r / a != b)
    		return 1;
    	return 0;
    }
    
    static struct val *
    op_times (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (!to_integer (a) || !to_integer (b)) {
    		free_value(a);
    		free_value(b);
    		ast_log(LOG_WARNING, "non-numeric argument\n");
    		return(make_integer(0));
    	}
    
    	r = make_integer (/*(quad_t)*/(a->u.i * b->u.i));
    	if (chk_times (a->u.i, b->u.i, r->u.i)) {
    		ast_log(LOG_WARNING, "overflow\n");
    	}
    	free_value (a);
    	free_value (b);
    	return (r);
    }
    
    static int
    chk_div (quad_t a, quad_t b)
    {
    	/* div by zero has been taken care of before */
    	/* only QUAD_MIN / -1 causes overflow */
    	if (a == QUAD_MIN && b == -1)
    		return 1;
    	/* everything else is OK */
    	return 0;
    }
    
    static struct val *
    op_div (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (!to_integer (a)) {
    		free_value(a);
    		free_value(b);
    		ast_log(LOG_WARNING, "non-numeric argument\n");
    		return make_integer(0);
    	} else if (!to_integer (b)) {
    		free_value(a);
    		free_value(b);
    		ast_log(LOG_WARNING, "non-numeric argument\n");
    		return make_integer(INT_MAX);
    	}
    
    	if (b->u.i == 0) {
    		ast_log(LOG_WARNING, "division by zero\n");		
    		free_value(a);
    		free_value(b);
    		return make_integer(INT_MAX);
    	}
    
    	r = make_integer (/*(quad_t)*/(a->u.i / b->u.i));
    	if (chk_div (a->u.i, b->u.i)) {
    		ast_log(LOG_WARNING, "overflow\n");
    	}
    	free_value (a);
    	free_value (b);
    	return r;
    }
    	
    static struct val *
    op_rem (struct val *a, struct val *b)
    {
    	struct val *r;
    
    	if (!to_integer (a) || !to_integer (b)) {
    		ast_log(LOG_WARNING, "non-numeric argument\n");
    		free_value(a);
    		free_value(b);
    		return make_integer(0);
    	}
    
    	if (b->u.i == 0) {
    		ast_log(LOG_WARNING, "div by zero\n");
    		free_value(a);
    		return(b);
    	}
    
    	r = make_integer (/*(quad_t)*/(a->u.i % b->u.i));
    	/* chk_rem necessary ??? */
    	free_value (a);
    	free_value (b);
    	return r;
    }
    	
    
    static struct val *
    op_colon (struct val *a, struct val *b)
    {
    	regex_t rp;
    	regmatch_t rm[2];
    	char errbuf[256];
    	int eval;
    	struct val *v;
    
    	/* coerce to both arguments to strings */
    	to_string(a);
    	to_string(b);
    	/* strip double quotes from both -- they'll screw up the pattern, and the search string starting at ^ */
    	strip_quotes(a);
    	strip_quotes(b);
    	/* compile regular expression */
    	if ((eval = regcomp (&rp, b->u.s, REG_EXTENDED)) != 0) {
    		regerror (eval, &rp, errbuf, sizeof(errbuf));
    		ast_log(LOG_WARNING,"regcomp() error : %s",errbuf);
    		free_value(a);
    		free_value(b);
    		return make_str("");		
    	}
    
    	/* compare string against pattern */
    	/* remember that patterns are anchored to the beginning of the line */
    	if (regexec(&rp, a->u.s, (size_t)2, rm, 0) == 0 && rm[0].rm_so == 0) {
    		if (rm[1].rm_so >= 0) {
    			*(a->u.s + rm[1].rm_eo) = '\0';
    			v = make_str (a->u.s + rm[1].rm_so);
    
    		} else {
    			v = make_integer ((quad_t)(rm[0].rm_eo - rm[0].rm_so));
    		}
    	} else {
    		if (rp.re_nsub == 0) {
    			v = make_integer ((quad_t)0);
    		} else {
    			v = make_str ("");
    		}
    	}
    
    	/* free arguments and pattern buffer */
    	free_value (a);
    	free_value (b);
    	regfree (&rp);
    
    	return v;
    }
    	
    
    static struct val *
    op_eqtilde (struct val *a, struct val *b)
    {
    	regex_t rp;
    	regmatch_t rm[2];
    	char errbuf[256];
    	int eval;
    	struct val *v;
    
    	/* coerce to both arguments to strings */
    	to_string(a);
    	to_string(b);
    	/* strip double quotes from both -- they'll screw up the pattern, and the search string starting at ^ */
    	strip_quotes(a);
    	strip_quotes(b);
    	/* compile regular expression */
    	if ((eval = regcomp (&rp, b->u.s, REG_EXTENDED)) != 0) {
    		regerror (eval, &rp, errbuf, sizeof(errbuf));
    		ast_log(LOG_WARNING,"regcomp() error : %s",errbuf);
    		free_value(a);
    		free_value(b);
    		return make_str("");		
    	}
    
    	/* compare string against pattern */
    	/* remember that patterns are anchored to the beginning of the line */
    	if (regexec(&rp, a->u.s, (size_t)2, rm, 0) == 0 ) {
    		if (rm[1].rm_so >= 0) {
    			*(a->u.s + rm[1].rm_eo) = '\0';
    			v = make_str (a->u.s + rm[1].rm_so);
    
    		} else {
    			v = make_integer ((quad_t)(rm[0].rm_eo - rm[0].rm_so));
    		}
    	} else {
    		if (rp.re_nsub == 0) {
    			v = make_integer ((quad_t)0);
    		} else {
    			v = make_str ("");
    		}
    	}
    
    	/* free arguments and pattern buffer */
    	free_value (a);
    	free_value (b);
    	regfree (&rp);
    
    	return v;
    }