aboutsummaryrefslogtreecommitdiffstats
path: root/misc/kde3-i18n-ss
ModeNameSize
-rw-r--r--Makefile680logstatsplainblame
-rw-r--r--distinfo250logstatsplainblame
-rw-r--r--pkg-descr74logstatsplainblame
-rw-r--r--pkg-plist5827logstatsplainblame
'>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 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262
%{

/***************************************************************************
(C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International
Business Machines Corporation and Siemens Rolm Communications Inc.

For purposes of this license notice, the term Licensors shall mean,
collectively, Apple Computer, Inc., AT&T Corp., International
Business Machines Corporation and Siemens Rolm Communications Inc.
The term Licensor shall mean any of the Licensors.

Subject to acceptance of the following conditions, permission is hereby
granted by Licensors without the need for written agreement and without
license or royalty fees, to use, copy, modify and distribute this
software for any purpose.

The above copyright notice and the following four paragraphs must be
reproduced in all copies of this software and any software including
this software.

THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE
ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR
MODIFICATIONS.

IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT,
INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT
OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.

EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE.

The software is provided with RESTRICTED RIGHTS.  Use, duplication, or
disclosure by the government are subject to restrictions set forth in
DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable.

***************************************************************************/

/*
 * src: vcc.c
 * doc: Parser for vCard and vCalendar. Note that this code is
 * generated by a yacc parser generator. Generally it should not
 * be edited by hand. The real source is vcc.y. The #line directives
 * can be commented out here to make it easier to trace through
 * in a debugger. However, if a bug is found it should
 * be fixed in vcc.y and this file regenerated.
 */


/* debugging utilities */
#if __DEBUG
#define DBG_(x) printf x
#else
#define DBG_(x)
#endif

/****  External Functions  ****/

/* assign local name to parser variables and functions so that
   we can use more than one yacc based parser.
*/

#define yyparse mime_parse
#define yylex mime_lex
#define yyerror mime_error
#define yychar mime_char
/* #define p_yyval p_mime_val */
#undef yyval
#define yyval mime_yyval
/* #define p_yylval p_mime_lval */
#undef yylval
#define yylval mime_yylval
#define yydebug mime_debug
#define yynerrs mime_nerrs
#define yyerrflag mime_errflag
#define yyss mime_ss
#define yyssp mime_ssp
#define yyvs mime_vs
#define yyvsp mime_vsp
#define yylhs mime_lhs
#define yylen mime_len
#define yydefred mime_defred
#define yydgoto mime_dgoto
#define yysindex mime_sindex
#define yyrindex mime_rindex
#define yygindex mime_gindex
#define yytable mime_table
#define yycheck mime_check
#define yyname mime_name
#define yyrule mime_rule
#define YYPREFIX "mime_"


#ifndef _NO_LINE_FOLDING
#define _SUPPORT_LINE_FOLDING 1
#endif

/* undef below if compile with MFC */
/* #define INCLUDEMFC 1 */

#if defined(WIN32) || defined(_WIN32)
#ifdef INCLUDEMFC
#include <afx.h>
#endif
#endif

#include <string.h>
#ifndef __MWERKS__
#include <malloc.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include "vcc.h"

static int yylex(void);
static void yyerror(char *s);

/****  Types, Constants  ****/

#define YYDEBUG     1   /* 1 to compile in some debugging code */
#define MAXTOKEN    256 /* maximum token (line) length */
#define YYSTACKSIZE     50  /* ~unref ? */
#define MAXLEVEL    10  /* max # of nested objects parseable */
                /* (includes outermost) */


/****  Global Variables  ****/
int mime_lineNum, mime_numErrors; /* yyerror() can use these */
static VObject* vObjList;
static VObject *curProp;
static VObject *curObj;
static VObject* ObjStack[MAXLEVEL];
static int ObjStackTop;


/* A helpful utility for the rest of the app. */
#if __CPLUSPLUS__
extern "C" {
#endif

    extern void Parse_Debug(const char *s);
    extern void yyerror(char *s);

#if __CPLUSPLUS__
    };
#endif

int yyparse(void);

enum LexMode {
    L_NORMAL,
    L_VCARD,
    L_VCAL,
    L_VEVENT,
    L_VTODO,
    L_VALUES,
    L_BASE64,
    L_QUOTED_PRINTABLE
    };

/****  Private Forward Declarations  ****/
static int pushVObject(const char *prop);
static VObject* popVObject(void);
#ifndef _SUPPORT_LINE_FOLDING
static char* lexDataFromBase64(void);
#endif
static void lexPopMode(int top);
static int lexWithinMode(enum LexMode mode);
static void lexPushMode(enum LexMode mode);
static void enterProps(const char *s);
static void enterAttr(const char *s1, const char *s2);
#if 0
static void enterValues(const char *value);
#endif
static void mime_error_(char *s);
 static void appendValue(const char *value);

%}

/***************************************************************************/
/***                           The grammar                              ****/
/***************************************************************************/

%union {
    char *str;
    VObject *vobj;
    }

%token
    EQ COLON DOT SEMICOLON SPACE HTAB LINESEP NEWLINE
    BEGIN_VCARD END_VCARD BEGIN_VCAL END_VCAL
    BEGIN_VEVENT END_VEVENT BEGIN_VTODO END_VTODO
    ID

/*
 * NEWLINE is the token that would occur outside a vCard,
 * while LINESEP is the token that would occur inside a vCard.
 */

%token <str>
    STRING ID

%type <str> name value

%type <vobj> vcard vcal vobject

%start mime

%%


mime: vobjects
    ;

vobjects: vobject
    { addList(&vObjList, $1); curObj = 0; }
    vobjects
    | vobject
        { addList(&vObjList, $1); curObj = 0; }
    ;

vobject: vcard
    | vcal
    ;

vcard:
    BEGIN_VCARD
    {
    lexPushMode(L_VCARD);
    if (!pushVObject(VCCardProp)) YYERROR;
    }
    items END_VCARD
    {
    lexPopMode(0);
    $$ = popVObject();
    }
    | BEGIN_VCARD
    {
    lexPushMode(L_VCARD);
    if (!pushVObject(VCCardProp)) YYERROR;
    }
    END_VCARD
    {
    lexPopMode(0);
    $$ = popVObject();
    }
    ;

items: item items
    | item
    ;

item: prop COLON
    {
    lexPushMode(L_VALUES);
    }
    values LINESEP
    {
    if (lexWithinMode(L_BASE64) || lexWithinMode(L_QUOTED_PRINTABLE))
       lexPopMode(0);
    lexPopMode(0);
    }
    | error
    ;

prop: name
    {
    enterProps($1);
    }
    attr_params
    | name
    {
    enterProps($1);
    }
    ;

attr_params: attr_param attr_params
    | attr_param
    ;

attr_param: SEMICOLON attr
    ;

attr: name
    {
    enterAttr($1,0);
    }
    | name EQ name
    {
    enterAttr($1,$3);

    }
    ;

name: ID
    ;

values: value SEMICOLON { appendValue($1); } values
    | value
    { appendValue($1); }
    ;

value: STRING
    | { $$ = 0; }
    ;

vcal:
    BEGIN_VCAL
    { if (!pushVObject(VCCalProp)) YYERROR; }
    calitems
    END_VCAL
    { $$ = popVObject(); }
    | BEGIN_VCAL
    { if (!pushVObject(VCCalProp)) YYERROR; }
    END_VCAL
    { $$ = popVObject(); }
    ;

calitems: calitem calitems
    | calitem
    ;

calitem:
    eventitem
    | todoitem
    | items
    ;

eventitem:
    BEGIN_VEVENT
    {
    lexPushMode(L_VEVENT);
    if (!pushVObject(VCEventProp)) YYERROR;
    }
    items
    END_VEVENT
    {
    lexPopMode(0);
    popVObject();
    }
    | BEGIN_VEVENT
    {
    lexPushMode(L_VEVENT);
    if (!pushVObject(VCEventProp)) YYERROR;
    }
    END_VEVENT
    {
    lexPopMode(0);
    popVObject();
    }
    ;

todoitem:
    BEGIN_VTODO
    {
    lexPushMode(L_VTODO);
    if (!pushVObject(VCTodoProp)) YYERROR;
    }
    items
    END_VTODO
    {
    lexPopMode(0);
    popVObject();
    }
    | BEGIN_VTODO
    {
    lexPushMode(L_VTODO);
    if (!pushVObject(VCTodoProp)) YYERROR;
    }
    END_VTODO
    {
    lexPopMode(0);
    popVObject();
    }
    ;

%%
/* ///////////////////////////////////////////////////////////////////////// */
static int pushVObject(const char *prop)
    {
    VObject *newObj;
    if (ObjStackTop == MAXLEVEL)
    return FALSE;

    ObjStack[++ObjStackTop] = curObj;

    if (curObj) {
        newObj = addProp(curObj,prop);
        curObj = newObj;
    }
    else
    curObj = newVObject(prop);

    return TRUE;
    }


/* ///////////////////////////////////////////////////////////////////////// */
/* This pops the recently built vCard off the stack and returns it. */
static VObject* popVObject()
    {
    VObject *oldObj;
    if (ObjStackTop < 0) {
    yyerror("pop on empty Object Stack\n");
    return 0;
    }
    oldObj = curObj;
    curObj = ObjStack[ObjStackTop--];

    return oldObj;
    }

static void appendValue(const char *value)
{
  char *p1, *p2;
  wchar_t *p3;
  int i;

  if (fieldedProp && *fieldedProp) {
    if (value) {
      addPropValue(curProp, *fieldedProp, value);
    }
    /* else this field is empty, advance to next field */
    fieldedProp++;
  } else {
    if (value) {
      if (vObjectUStringZValue(curProp)) {
    p1 = fakeCString(vObjectUStringZValue(curProp));
    p2 = malloc(sizeof(char *) * (strlen(p1)+strlen(value)+1));
    strcpy(p2, p1);
    deleteStr(p1);

    i = strlen(p2);
    p2[i] = ';';
    p2[i+1] = '\0';
    p2 = strcat(p2, value);
    p3 = (wchar_t *) vObjectUStringZValue(curProp);
    free(p3);
    setVObjectUStringZValue_(curProp,fakeUnicode(p2,0));
    deleteStr(p2);
      } else {
    setVObjectUStringZValue_(curProp,fakeUnicode(value,0));
      }
    }
  }
  deleteStr(value);
}

#if 0
static void enterValues(const char *value)
    {
    if (fieldedProp && *fieldedProp) {
    if (value) {
        addPropValue(curProp,*fieldedProp,value);
        }
    /* else this field is empty, advance to next field */
    fieldedProp++;
    }
    else {
    if (value) {
        setVObjectUStringZValue_(curProp,fakeUnicode(value,0));
        }
    }
    deleteStr(value);
    }
#endif

static void enterProps(const char *s)
    {
    curProp = addGroup(curObj,s);
    deleteStr(s);
    }

static void enterAttr(const char *s1, const char *s2)
    {
    const char *p1, *p2 = NULL;
    p1 = lookupProp_(s1);
    if (s2) {
    VObject *a;
    p2 = lookupProp_(s2);
    a = addProp(curProp,p1);
    setVObjectStringZValue(a,p2);
    }
    else
    addProp(curProp,p1);
    if (stricmp(p1,VCBase64Prop) == 0 || (s2 && stricmp(p2,VCBase64Prop)==0))
    lexPushMode(L_BASE64);
    else if (stricmp(p1,VCQuotedPrintableProp) == 0
        || (s2 && stricmp(p2,VCQuotedPrintableProp)==0))
    lexPushMode(L_QUOTED_PRINTABLE);
    deleteStr(s1); deleteStr(s2);
    }


#define MAX_LEX_LOOKAHEAD_0 32
#define MAX_LEX_LOOKAHEAD 64
#define MAX_LEX_MODE_STACK_SIZE 10
#define LEXMODE() (lexBuf.lexModeStack[lexBuf.lexModeStackTop])

struct LexBuf {
    /* input */
#ifdef INCLUDEMFC
    CFile *inputFile;
#else
    FILE *inputFile;
#endif
    char *inputString;
    unsigned long curPos;
    unsigned long inputLen;
    /* lookahead buffer */
    /*   -- lookahead buffer is int instead of char so that EOF
     /      can be represented correctly.
    */
    unsigned long len;
    int buf[MAX_LEX_LOOKAHEAD];
    unsigned long getPtr;
    /* context stack */
    unsigned long lexModeStackTop;
    enum LexMode lexModeStack[MAX_LEX_MODE_STACK_SIZE];
    /* token buffer */
    unsigned long maxToken;
    char *strs;
    unsigned long strsLen;
    } lexBuf;

static void lexPushMode(enum LexMode mode)
    {
    if (lexBuf.lexModeStackTop == (MAX_LEX_MODE_STACK_SIZE-1))
    yyerror("lexical context stack overflow");
    else {
    lexBuf.lexModeStack[++lexBuf.lexModeStackTop] = mode;
    }
    }

static void lexPopMode(int top)
    {
    /* special case of pop for ease of error recovery -- this
    version will never underflow */
    if (top)
    lexBuf.lexModeStackTop = 0;
    else
    if (lexBuf.lexModeStackTop > 0) lexBuf.lexModeStackTop--;
    }

static int lexWithinMode(enum LexMode mode) {
    unsigned long i;
    for (i=0;i<lexBuf.lexModeStackTop;i++)
    if (mode == lexBuf.lexModeStack[i]) return 1;
    return 0;
    }

static int lexGetc_()
    {
    /* get next char from input, no buffering. */
    if (lexBuf.curPos == lexBuf.inputLen)
    return EOF;
    else if (lexBuf.inputString)
    return *(lexBuf.inputString + lexBuf.curPos++);
    else {
#ifdef INCLUDEMFC
    char result;
    return lexBuf.inputFile->Read(&result, 1) == 1 ? result : EOF;
#else
    return fgetc(lexBuf.inputFile);
#endif
    }
    }

static int lexGeta()
    {
    ++lexBuf.len;
    return (lexBuf.buf[lexBuf.getPtr] = lexGetc_());
    }

static int lexGeta_(int i)
    {
    ++lexBuf.len;
    return (lexBuf.buf[(lexBuf.getPtr+i)%MAX_LEX_LOOKAHEAD] = lexGetc_());
    }

static void lexSkipLookahead() {
    if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) {
    /* don't skip EOF. */
        lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD;
    lexBuf.len--;
        }
    }

static int lexLookahead() {
    int c = (lexBuf.len)?
    lexBuf.buf[lexBuf.getPtr]:
    lexGeta();
    /* do the \r\n -> \n or \r -> \n translation here */
    if (c == '\r') {
    int a = (lexBuf.len>1)?
        lexBuf.buf[(lexBuf.getPtr+1)%MAX_LEX_LOOKAHEAD]:
        lexGeta_(1);
    if (a == '\n') {
        lexSkipLookahead();
        }
    lexBuf.buf[lexBuf.getPtr] = c = '\n';
    }
    else if (c == '\n') {
    int a = (lexBuf.len>1)?
        lexBuf.buf[lexBuf.getPtr+1]:
        lexGeta_(1);
    if (a == '\r') {
        lexSkipLookahead();
        }
    lexBuf.buf[lexBuf.getPtr] = '\n';
    }
    return c;
    }

static int lexGetc() {
    int c = lexLookahead();
    if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) {
    /* EOF will remain in lookahead buffer */
        lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD;
    lexBuf.len--;
        }
    return c;
    }

static void lexSkipLookaheadWord() {
    if (lexBuf.strsLen <= lexBuf.len) {
    lexBuf.len -= lexBuf.strsLen;
    lexBuf.getPtr = (lexBuf.getPtr + lexBuf.strsLen) % MAX_LEX_LOOKAHEAD;
    }
    }

static void lexClearToken()
    {
    lexBuf.strsLen = 0;
    }

static void lexAppendc(int c)
    {
    lexBuf.strs[lexBuf.strsLen] = c;
    /* append up to zero termination */
    if (c == 0) return;
    lexBuf.strsLen++;
    if (lexBuf.strsLen >= lexBuf.maxToken) {
    /* double the token string size */
    lexBuf.maxToken <<= 1;
    lexBuf.strs = (char*) realloc(lexBuf.strs,(size_t)lexBuf.maxToken);
    }
    }

static char* lexStr() {
    return dupStr(lexBuf.strs,(size_t)lexBuf.strsLen+1);
    }

static void lexSkipWhite() {
    int c = lexLookahead();
    while (c == ' ' || c == '\t') {
    lexSkipLookahead();
    c = lexLookahead();
    }
    }

static char* lexGetWord() {
    int c;
    lexSkipWhite();
    lexClearToken();
    c = lexLookahead();
    while (c != EOF && !strchr("\t\n ;:=",c)) {
    lexAppendc(c);
    lexSkipLookahead();
    c = lexLookahead();
    }
    lexAppendc(0);
    return lexStr();
    }

#if 0
static void lexPushLookahead(char *s, int len) {
    int putptr;
    if (len == 0) len = strlen(s);
    putptr = (int)lexBuf.getPtr - len;
    /* this function assumes that length of word to push back
     /  is not greater than MAX_LEX_LOOKAHEAD.
     */
    if (putptr < 0) putptr += MAX_LEX_LOOKAHEAD;
    lexBuf.getPtr = putptr;
    while (*s) {
    lexBuf.buf[putptr] = *s++;
    putptr = (putptr + 1) % MAX_LEX_LOOKAHEAD;
    }
    lexBuf.len += len;
    }
#endif

static void lexPushLookaheadc(int c) {
    int putptr;
    /* can't putback EOF, because it never leaves lookahead buffer */
    if (c == EOF) return;
    putptr = (int)lexBuf.getPtr - 1;
    if (putptr < 0) putptr += MAX_LEX_LOOKAHEAD;
    lexBuf.getPtr = putptr;
    lexBuf.buf[putptr] = c;
    lexBuf.len += 1;
    }

static char* lexLookaheadWord() {
    /* this function can lookahead word with max size of MAX_LEX_LOOKAHEAD_0
     /  and thing bigger than that will stop the lookahead and return 0;
     / leading white spaces are not recoverable.
     */
    int c;
    int len = 0;
    int curgetptr = 0;
    lexSkipWhite();
    lexClearToken();
    curgetptr = (int)lexBuf.getPtr; /* remember! */
    while (len < (MAX_LEX_LOOKAHEAD_0)) {
    c = lexGetc();
    len++;
    if (c == EOF || strchr("\t\n ;:=", c)) {
        lexAppendc(0);
        /* restore lookahead buf. */
        lexBuf.len += len;
        lexBuf.getPtr = curgetptr;
        return lexStr();
        }
        else
        lexAppendc(c);
    }
    lexBuf.len += len;  /* char that has been moved to lookahead buffer */
    lexBuf.getPtr = curgetptr;
    return 0;
    }

#ifdef _SUPPORT_LINE_FOLDING
static void handleMoreRFC822LineBreak(int c) {
    /* suport RFC 822 line break in cases like
     *  ADR: foo;
     *    morefoo;
     *    more foo;
     */
    if (c == ';') {
    int a;
    lexSkipLookahead();
    /* skip white spaces */
    a = lexLookahead();
    while (a == ' ' || a == '\t') {
        lexSkipLookahead();
        a = lexLookahead();
        }
    if (a == '\n') {
        lexSkipLookahead();
        a = lexLookahead();
        if (a == ' ' || a == '\t') {
        /* continuation, throw away all the \n and spaces read so
         * far
         */
        lexSkipWhite();
        lexPushLookaheadc(';');
        }
        else {
        lexPushLookaheadc('\n');
        lexPushLookaheadc(';');
        }
        }
    else {
        lexPushLookaheadc(';');
        }
    }
    }

static char* lexGet1Value() {
    int c;
    lexSkipWhite();
    c = lexLookahead();
    lexClearToken();
    while (c != EOF && c != ';') {
    if (c == '\n') {
        int a;
        lexSkipLookahead();
        a  = lexLookahead();
        if (a == ' ' || a == '\t') {
        lexAppendc(' ');
        lexSkipLookahead();
        }
        else {
        lexPushLookaheadc('\n');
        break;
        }
        }
    else {
        lexAppendc(c);
        lexSkipLookahead();
        }
    c = lexLookahead();
    }
    lexAppendc(0);
    handleMoreRFC822LineBreak(c);
    return c==EOF?0:lexStr();
    }
#endif

#ifndef _SUPPORT_LINE_FOLDING
static char* lexGetStrUntil(char *termset) {
    int c = lexLookahead();
    lexClearToken();
    while (c != EOF && !strchr(termset,c)) {
    lexAppendc(c);
    lexSkipLookahead();
    c = lexLookahead();
    }
    lexAppendc(0);
    return c==EOF?0:lexStr();
    }
#endif

static int match_begin_name(int end) {
    char *n = lexLookaheadWord();
    int token = ID;
    if (n) {
    if (!stricmp(n,"vcard")) token = end?END_VCARD:BEGIN_VCARD;
    else if (!stricmp(n,"vcalendar")) token = end?END_VCAL:BEGIN_VCAL;
    else if (!stricmp(n,"vevent")) token = end?END_VEVENT:BEGIN_VEVENT;
    else if (!stricmp(n,"vtodo")) token = end?END_VTODO:BEGIN_VTODO;
    deleteStr(n);
    return token;
    }
    return 0;
    }


#ifdef INCLUDEMFC
static void initLex(const char *inputstring, unsigned long inputlen, CFile *inputfile)
#else
static void initLex(const char *inputstring, unsigned long inputlen, FILE *inputfile)
#endif
    {
    /* initialize lex mode stack */
    lexBuf.lexModeStack[lexBuf.lexModeStackTop=0] = L_NORMAL;

    /* iniatialize lex buffer. */
    lexBuf.inputString = (char*) inputstring;
    lexBuf.inputLen = inputlen;
    lexBuf.curPos = 0;
    lexBuf.inputFile = inputfile;

    lexBuf.len = 0;
    lexBuf.getPtr = 0;

    lexBuf.maxToken = MAXTOKEN;
    lexBuf.strs = (char*)malloc(MAXTOKEN);
    lexBuf.strsLen = 0;

    }

static void finiLex() {
    free(lexBuf.strs);
    }


/* ///////////////////////////////////////////////////////////////////////// */
/* This parses and converts the base64 format for binary encoding into
 * a decoded buffer (allocated with new).  See RFC 1521.
 */
static char * lexGetDataFromBase64()
    {
    unsigned long bytesLen = 0, bytesMax = 0;
    int quadIx = 0, pad = 0;
    unsigned long trip = 0;
    unsigned char b;
    int c;
    unsigned char *bytes = NULL;
    unsigned char *oldBytes = NULL;

    DBG_(("db: lexGetDataFromBase64\n"));
    while (1) {
    c = lexGetc();
    if (c == '\n') {
        ++mime_lineNum;
        if (lexLookahead() == '\n') {
        /* a '\n' character by itself means end of data */
        break;
        }
        else continue; /* ignore '\n' */
        }
    else {
        if ((c >= 'A') && (c <= 'Z'))
        b = (unsigned char)(c - 'A');
        else if ((c >= 'a') && (c <= 'z'))
        b = (unsigned char)(c - 'a') + 26;
        else if ((c >= '0') && (c <= '9'))
        b = (unsigned char)(c - '0') + 52;
        else if (c == '+')
        b = 62;
        else if (c == '/')
        b = 63;
        else if (c == '=') {
        b = 0;
        pad++;
        } else if ((c == ' ') || (c == '\t')) {
        continue;
        } else { /* error condition */
        if (bytes) free(bytes);
        else if (oldBytes) free(oldBytes);
        /* error recovery: skip until 2 adjacent newlines. */
        DBG_(("db: invalid character 0x%x '%c'\n", c,c));
        if (c != EOF)  {
            c = lexGetc();
            while (c != EOF) {
            if (c == '\n' && lexLookahead() == '\n') {
                ++mime_lineNum;
                break;
                }
            c = lexGetc();
            }
            }
        return NULL;
        }
        trip = (trip << 6) | b;
        if (++quadIx == 4) {
        unsigned char outBytes[3];
        int numOut;
        int i;
        for (i = 0; i < 3; i++) {
            outBytes[2-i] = (unsigned char)(trip & 0xFF);
            trip >>= 8;
            }
        numOut = 3 - pad;
        if (bytesLen + numOut > bytesMax) {
            if (!bytes) {
            bytesMax = 1024;
            bytes = (unsigned char*)malloc((size_t)bytesMax);
            }
            else {
            bytesMax <<= 2;
            oldBytes = bytes;
            bytes = (unsigned char*)realloc(bytes,(size_t)bytesMax);
            }
            if (bytes == 0) {
            mime_error("out of memory while processing BASE64 data\n");
            }
            }
        if (bytes) {
            memcpy(bytes + bytesLen, outBytes, numOut);
            bytesLen += numOut;
            }
        trip = 0;
        quadIx = 0;
        }
        }
    } /* while */
    DBG_(("db: bytesLen = %d\n",  bytesLen));
    /* kludge: all this won't be necessary if we have tree form
    representation */
    if (bytes) {
    setValueWithSize(curProp,bytes,(unsigned int)bytesLen);
    free(bytes);
    }
    else if (oldBytes) {
    setValueWithSize(curProp,oldBytes,(unsigned int)bytesLen);
    free(oldBytes);
    }
    return 0;
    }

static int match_begin_end_name(int end) {
    int token;
    lexSkipWhite();
    if (lexLookahead() != ':') return ID;
    lexSkipLookahead();
    lexSkipWhite();
    token = match_begin_name(end);
    if (token == ID) {
    lexPushLookaheadc(':');
    DBG_(("db: ID '%s'\n", yylval.str));
    return ID;
    }
    else if (token != 0) {
    lexSkipLookaheadWord();
    deleteStr(yylval.str);
    DBG_(("db: begin/end %d\n", token));
    return token;
    }
    return 0;
    }

static char* lexGetQuotedPrintable()
    {
    int cur;

    lexClearToken();
    do {
    cur = lexGetc();
    switch (cur) {
        case '=': {
        int c = 0;
        int next[2];
        int i;
        for (i = 0; i < 2; i++) {
            next[i] = lexGetc();
            if (next[i] >= '0' && next[i] <= '9')
            c = c * 16 + next[i] - '0';
            else if (next[i] >= 'A' && next[i] <= 'F')
            c = c * 16 + next[i] - 'A' + 10;
            else
            break;
            }
        if (i == 0) {
            /* single '=' follow by LINESEP is continuation sign? */
            if (next[0] == '\n') {
            ++mime_lineNum;
            }
            else {
            lexPushLookaheadc('=');
            goto EndString;
            }
            }
        else if (i == 1) {
            lexPushLookaheadc(next[1]);
            lexPushLookaheadc(next[0]);
            lexAppendc('=');
        } else {
            lexAppendc(c);
            }
        break;
        } /* '=' */
        case '\n':
        case ';':
          {
        lexPushLookaheadc(cur);
        goto EndString;
        }
        case EOF:
        break;
        default:
        lexAppendc(cur);
        break;
        } /* switch */
    } while (cur != EOF);

EndString:
    lexAppendc(0);
    return lexStr();
    } /* LexQuotedPrintable */

static int yylex() {
    int lexmode = LEXMODE();
    if (lexmode == L_VALUES) {
    int c = lexGetc();
    if (c == ';') {
        DBG_(("db: SEMICOLON\n"));
        lexPushLookaheadc(c);
#ifdef _SUPPORT_LINE_FOLDING
        handleMoreRFC822LineBreak(c);
#endif
        lexSkipLookahead();
        return SEMICOLON;
        }
    else if (strchr("\n",c)) {
        ++mime_lineNum;
        /* consume all line separator(s) adjacent to each other */
        c = lexLookahead();
        while (strchr("\n",c)) {
        lexSkipLookahead();
        c = lexLookahead();
        ++mime_lineNum;
        }
        DBG_(("db: LINESEP\n"));
        return LINESEP;
        }
    else {
        char *p = 0;
        lexPushLookaheadc(c);
        if (lexWithinMode(L_BASE64)) {
        /* get each char and convert to bin on the fly... */
        p = lexGetDataFromBase64();
        yylval.str = p;
        return STRING;
        }
        else if (lexWithinMode(L_QUOTED_PRINTABLE)) {
        p = lexGetQuotedPrintable();
        }
        else {
#ifdef _SUPPORT_LINE_FOLDING
        p = lexGet1Value();
#else
        p = lexGetStrUntil(";\n");
#endif
        }
        if (p) {
        DBG_(("db: STRING: '%s'\n", p));
        yylval.str = p;
        return STRING;
        }
        else return 0;
        }
    }
    else {
    /* normal mode */
    while (1) {
        int c = lexGetc();
        switch(c) {
        case ':': {
            /* consume all line separator(s) adjacent to each other */
            /* ignoring linesep immediately after colon. */
/*          c = lexLookahead();
            while (strchr("\n",c)) {
            lexSkipLookahead();
            c = lexLookahead();
            ++mime_lineNum;
            }*/
            DBG_(("db: COLON\n"));
            return COLON;
            }
        case ';':
            DBG_(("db: SEMICOLON\n"));
            return SEMICOLON;
        case '=':
            DBG_(("db: EQ\n"));
            return EQ;
        /* ignore whitespace in this mode */
        case '\t':
        case ' ': continue;
        case '\n': {
            ++mime_lineNum;
            continue;
            }
        case EOF: return 0;
            break;
        default: {
            lexPushLookaheadc(c);
            if (isalpha(c)) {
            char *t = lexGetWord();
            yylval.str = t;
            if (!stricmp(t, "begin")) {
                return match_begin_end_name(0);
                }
            else if (!stricmp(t,"end")) {
                return match_begin_end_name(1);
                }
                else {
                DBG_(("db: ID '%s'\n", t));
                return ID;
                }
            }
            else {
            /* unknow token */
            return 0;
            }
            break;
            }
        }
        }
    }
    return 0;
    }


/***************************************************************************/
/***                            Public Functions                        ****/
/***************************************************************************/

static VObject* Parse_MIMEHelper()
    {
    ObjStackTop = -1;
    mime_numErrors = 0;
    mime_lineNum = 1;
    vObjList = 0;
    curObj = 0;

    if (yyparse() != 0) {
    finiLex();
    return 0;
    }

    finiLex();
    return vObjList;
    }

/* ///////////////////////////////////////////////////////////////////////// */
DLLEXPORT(VObject*) Parse_MIME(const char *input, unsigned long len)
    {
    initLex(input, len, 0);
    return Parse_MIMEHelper();
    }


#if INCLUDEMFC

DLLEXPORT(VObject*) Parse_MIME_FromFile(CFile *file)
    {
    unsigned long startPos;
    VObject *result;

    initLex(0,-1,file);
    startPos = file->GetPosition();
    if (!(result = Parse_MIMEHelper()))
    file->Seek(startPos, CFile::begin);
    return result;
    }

#else

VObject* Parse_MIME_FromFile(FILE *file)
    {
    VObject *result;
    long startPos;

    initLex(0,(unsigned long)-1,file);
    startPos = ftell(file);
    if (!(result = Parse_MIMEHelper())) {
    fseek(file,startPos,SEEK_SET);
    }
    return result;
    }

DLLEXPORT(VObject*) Parse_MIME_FromFileName(char *fname)
    {
    FILE *fp = fopen(fname,"r");
    if (fp) {
    VObject* o = Parse_MIME_FromFile(fp);
    fclose(fp);
    return o;
    }
    else {
    char msg[256];
    snprintf(msg, sizeof(msg), "can't open file '%s' for reading\n", fname);
    mime_error_(msg);
    return 0;
    }
    }

#endif

/* ///////////////////////////////////////////////////////////////////////// */

static MimeErrorHandler mimeErrorHandler;

DLLEXPORT(void) registerMimeErrorHandler(MimeErrorHandler me)
    {
    mimeErrorHandler = me;
    }

static void mime_error(char *s)
    {
    char msg[256];
    if (mimeErrorHandler) {
    sprintf(msg,"%s at line %d", s, mime_lineNum);
    mimeErrorHandler(msg);
    }
    }

static void mime_error_(char *s)
    {
    if (mimeErrorHandler) {
    mimeErrorHandler(s);
    }
    }