From 0909ac418c16cf9a24e7bc975c8d4efe5edc4d9e Mon Sep 17 00:00:00 2001 From: Peter Simons Date: Sat, 16 Dec 2000 12:38:21 +0000 Subject: [PATCH] Initial revision --- libmpools/Makefile | 66 ++ libmpools/mpools.c | 339 ++++++++ libmpools/mpools.h | 30 + librfc822/Makefile | 97 +++ librfc822/address.c | 1114 ++++++++++++++++++++++++ librfc822/address.y | 180 ++++ librfc822/address_scan.c | 1660 ++++++++++++++++++++++++++++++++++++ librfc822/address_scan.h | 8 + librfc822/address_scan.l | 56 ++ librfc822/address_sep.c | 152 ++++ librfc822/decomment.c | 217 +++++ librfc822/parse_address.c | 127 +++ librfc822/rfc822.h | 35 + librfc822/test.c | 55 ++ librfc822/testaddresslines | 15 + 15 files changed, 4151 insertions(+) create mode 100644 libmpools/Makefile create mode 100644 libmpools/mpools.c create mode 100644 libmpools/mpools.h create mode 100644 librfc822/Makefile create mode 100644 librfc822/address.c create mode 100644 librfc822/address.y create mode 100644 librfc822/address_scan.c create mode 100644 librfc822/address_scan.h create mode 100644 librfc822/address_scan.l create mode 100644 librfc822/address_sep.c create mode 100644 librfc822/decomment.c create mode 100644 librfc822/parse_address.c create mode 100644 librfc822/rfc822.h create mode 100644 librfc822/test.c create mode 100644 librfc822/testaddresslines diff --git a/libmpools/Makefile b/libmpools/Makefile new file mode 100644 index 0000000..6261cbc --- /dev/null +++ b/libmpools/Makefile @@ -0,0 +1,66 @@ +# +# libmpools Makefile +# +# $Header$ +# + +# Make Rules: +# =========== +# +.c.o: + $(CC) $(CFLAGS) $(CPPFLAGS) -c $< + + +# Compiler Flags: +# =============== +# +CFLAGS = -Wall +CPPFLAGS= + + +# +# Labels: +# ======= +# +SRCS = mpools.c +OBJS = $(SRCS:.c=.o) +MANFILES= $(SRCS:.c=.3) + + +# +# Targets +# +.PHONY: all man clean realclean distclean depend + +all: libmpools.a + +man: mp_malloc.3 + +clean: + rm -f libmpools.a *.o *.3 *.core + +realclean: clean + rm -rf man3 + +distclean: realclean + +depend: + makedepend -Y /usr/include $(SRCS) + @rm -f Makefile.bak + +mp_malloc.3: mpools.c + c2man -impools.h -g mpools.c; + + +# +# Actions +# +libmpools.a: $(OBJS) + rm -f $@ + $(AR) cr $@ $(OBJS) + $(RANLIB) $@ + + +# +# Dependencies +# diff --git a/libmpools/mpools.c b/libmpools/mpools.c new file mode 100644 index 0000000..089cd4f --- /dev/null +++ b/libmpools/mpools.c @@ -0,0 +1,339 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ + +#include +#include +#include +#include "../liblists/lists.h" +#include "mpools.h" + +static List mpools_list = NULL; + +/********** Internal routines **********/ + +static int +GetMemoryPool(const char * pool_name, + Node * node_ptr, + struct mp_list_entry ** mpool_entry_ptr) +{ + Node node; + + /* Sanity checks. */ + + assert(mpools_list != NULL); + assert(pool_name != NULL); + if (pool_name == NULL) + return -1; + + /* Find the pool of the right name. */ + + node = FindNodeByKey(mpools_list, (const void *) pool_name); + if (node != NULL) { + if (node_ptr != NULL) + *node_ptr = node; + if (mpool_entry_ptr != NULL) + *mpool_entry_ptr = (struct mp_list_entry *) getNodeData(node); + return 0; + } + + /* No entry available. So we create one. */ + + pool_name = strdup(pool_name); + if (pool_name == NULL) + return -1; + + node = AppendNode(mpools_list, (const void *) pool_name, NULL); + if (node == NULL) { + free((char *) pool_name); + return -1; + } + + /* Return result to caller. */ + + if (node_ptr != NULL) + *node_ptr = node; + if (mpool_entry_ptr != NULL) + *mpool_entry_ptr = (struct mp_list_entry *) getNodeData(node); + + return 0; +} + + +/********** User interface **********/ + +/* mp_malloc() allocates a block of memory using malloc(3), adds the + pointer and the size of the block to the memory pool as identified + by the 'pool_name' argument and returns the address of the memory + block to the caller. + + Memory pools are identified by a byte string, terminated with a + zero ('\\0') byte. The names are compared using strcmp(3), which is + case-sensitive. + + RETURNS: If successfull, mp_malloc() returns a pointer to the newly + allocated memory block. In case of failure, NULL is returned + instead. +*/ + +void * +mp_malloc(const char * pool_name /* ID-String of the memory pool. */, + size_t block_size /* Size of the requested memory block. */ + ) +{ + struct mp_list_entry * mpool; + Node node; + void * block; + + /* Sanity checks. */ + + assert(pool_name != NULL); + if (pool_name == NULL || block_size <= 0) + return NULL; + + /* Init the internal list structure, if it isn't already. */ + + if (mpools_list == NULL) { + mpools_list = InitList((int (*)(const void *, const void *)) strcmp); + if (mpools_list == NULL) + return NULL; + } + + /* Get the pool structure. */ + + if (GetMemoryPool(pool_name, &node, NULL) != 0) + return NULL; + + /* Allocate the memory. */ + + mpool = malloc(sizeof(struct mp_list_entry)); + if (mpool == NULL) + return NULL; + + block = malloc(block_size); + if (block == NULL) { + free(mpool); + return NULL; + } + + /* Init the mpool structure. */ + + mpool->next = NULL; + mpool->block = block; + mpool->size = block_size; + + /* Now append the structure to our list. */ + + if (getNodeData(node) != NULL) + mpool->next = (struct mp_list_entry *) getNodeData(node); + setNodeData(node, (const void *) mpool); + + return block; +} + +/* mp_free() will return the previously allocated memory block to the + system and remove the entry from the memory pool. The memory block + has to be previously allocated by mp_malloc(), or mp_free() won't + do anything. + + It is safe to call mp_free() several times for the same memory + block, or for an invalid memory block, that hasn't been allocated + by mp_malloc(). mp_free will detect this and return without doing + anything. +*/ + +void +mp_free(const char * pool_name /* ID-String of the memory pool. */, + void * block /* Pointer to a memory block + previously allocated by mp_malloc(). */ + ) +{ + struct mp_list_entry * mpool, + * prev_mpool; + Node node; + + /* Sanity checks. */ + + assert(pool_name != NULL); + if (pool_name == NULL) + return; + + /* Init the internal list structure, if it isn't already. */ + + if (mpools_list == NULL) { + mpools_list = InitList(NULL); + if (mpools_list == NULL) + return; + } + + /* Get the pool structure. */ + + if (GetMemoryPool(pool_name, &node, &mpool) != 0) + return; + + /* Find the block we should free. */ + + for (prev_mpool = NULL; + mpool != NULL && mpool->block != block; + prev_mpool = mpool, mpool = mpool->next) + ; + + if (mpool == NULL) { /* block not found */ + printf("Warning\n"); + return; + } + + /* Remove the node from the linked list. */ + + if (prev_mpool == NULL) + setNodeData(node, mpool->next); + else + prev_mpool->next = mpool->next; + + /* And free it plus our own structure stuff. */ + + free(mpool->block); + free(mpool); +} + + +/* + Remove the provided memory block from the memory pool, without + freeing the memory itself. + + It is safe to call mp_remove_block_from_pool() with invalid data. + */ + +void +mp_remove_block_from_pool(const char * pool_name /* ID-String of the memory pool. */, + void * block /* Pointer to a memory block + previously allocated by mp_malloc(). */ + ) +{ + struct mp_list_entry * mpool, + * prev_mpool; + Node node; + + /* Sanity checks. */ + + assert(pool_name != NULL); + assert(block != NULL); + if (!pool_name || !block) + return; + + /* Init the internal list structure, if it isn't already. */ + + if (mpools_list == NULL) { + mpools_list = InitList(NULL); + return; + } + + /* Get the pool structure. */ + + if (GetMemoryPool(pool_name, &node, &mpool) != 0) + return; + + /* Find the block we should free. */ + + for (prev_mpool = NULL; + mpool != NULL && mpool->block != block; + prev_mpool = mpool, mpool = mpool->next) + ; + + if (mpool == NULL) /* block not found */ + return; + + /* Remove the node from the linked list. */ + + if (prev_mpool == NULL) + setNodeData(node, mpool->next); + else + prev_mpool->next = mpool->next; + + /* Free the structure stuff. */ + + free(mpool); +} + +/* This routine will return all allocated memory blocks contained in + pool 'pool_name' to the system. +*/ + +void +mp_free_memory_pool(const char * pool_name /* ID-String of the memory pool. */ + ) +{ + struct mp_list_entry * mpool_entry, + * next_mpool_entry; + Node node; + + /* Sanity checks. */ + + assert(pool_name != NULL); + if (pool_name == NULL) + return; + + if (mpools_list == NULL) + return; + + /* Find our memory pool. */ + + node = FindNodeByKey(mpools_list, pool_name); + if (node == NULL) + return; + mpool_entry = (struct mp_list_entry *) getNodeData(node); + + /* And now we move the pool completely. */ + + RemoveNode(node); + free((void *) getNodeKey(node)); /* kill the pool name buffer */ + FreeNode(node); + + for ( ; mpool_entry != NULL; mpool_entry = next_mpool_entry) { + next_mpool_entry = mpool_entry->next; + free(mpool_entry->block); + free(mpool_entry); + } +} + + +/* This routine is experimental and for debugging purposes only. In + the current version, it will dump the contents of pool 'pool_name' + to the screen, using printf(3). +*/ + +void +mp_dump_memory_pool(const char * pool_name /* ID-String of the memory pool. */ + ) +{ + struct mp_list_entry * mpool_entry; + unsigned int total; + + /* Sanity checks. */ + + assert(pool_name != NULL); + if (pool_name == NULL) + return; + + /* Dump the specified pool. */ + + if (GetMemoryPool(pool_name, NULL, &mpool_entry) != 0) + return; + + if (mpool_entry == NULL) { + printf("mpool \"%s\" is empty.\n", pool_name); + return; + } + + for (total = 0; mpool_entry != NULL; mpool_entry = mpool_entry->next) { + printf("\"%s\": %d byte block at $%08x.\n", pool_name, mpool_entry->size, + (unsigned int) mpool_entry->block); + total += mpool_entry->size; + } + printf("Total size of mpool \"%s\" is %u byte.\n", pool_name, total); +} diff --git a/libmpools/mpools.h b/libmpools/mpools.h new file mode 100644 index 0000000..d0bf537 --- /dev/null +++ b/libmpools/mpools.h @@ -0,0 +1,30 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1996,97 by CyberSolutions GmbH. + * All rights reserved. + */ + +#ifndef __LIB_MPOOLS_H__ +#define __LIB_MPOOLS_H__ 1 + +#include +#ifdef DEBUG_DMALLOC +# include +#endif + +struct mp_list_entry { + struct mp_list_entry * next; + void * block; + size_t size; +}; + +void * mp_malloc(const char *, size_t); +void mp_free(const char * pool_name, void *); +void mp_free_memory_pool(const char *); +void mp_dump_memory_pool(const char *); +void mp_remove_block_from_pool(const char *, void *); + +#endif /* !__LIB_MPOOLS_H__ */ diff --git a/librfc822/Makefile b/librfc822/Makefile new file mode 100644 index 0000000..cfec90a --- /dev/null +++ b/librfc822/Makefile @@ -0,0 +1,97 @@ +# +# RFC Parse Library +# +# $Header$ +# + +# Make Rules: +# =========== +# +.c.o: + $(CC) $(CFLAGS) $(CPPFLAGS) -c $< + + +# Compiler flags: +# =============== +# +CFLAGS = -Wall +CPPFLAGS= + +# Linker flags: +# ============= +# +LDFLAGS = +LIBS = ../libmpools/libmpools.a ../liblists/liblists.a + + +# +# Labels: +# ======= +# +SRCS = address.c address_scan.c decomment.c address_sep.c +OBJS = $(SRCS:.c=.o) + + +# +# Targets +# +.PHONY: all man clean realclean depend + +all: librfc822.a + +man: rfc822_decomment.3 rfc822_parse_address.3 rfc822_address_sep.3 + +test: test.o librfc822.a rfc822.h $(LIBS) + $(CC) test.o librfc822.a -o $@ $(LDFLAGS) $(LIBS) + +clean: + rm -f librfc822.a test *.o *.3 *.core *.bak + +realclean: clean + rm -f address.c address_scan.c address_scan.h + +depend: + makedepend -Y /usr/include $(SRCS) + @rm -f Makefile.bak + + +# +# Actions: +#========= +# +librfc822.a: $(OBJS) + $(AR) cr $@ $(OBJS) + $(RANLIB) $@ + +address.c address_scan.h: address.y rfc822.h parse_address.c + $(YACC) -d -p "rfc822_" address.y + mv y.tab.c address.c + mv y.tab.h address_scan.h + +address_scan.c: address_scan.l rfc822.h + $(LEX) -Prfc822_ address_scan.l + mv lex.rfc822_.c $@ + +rfc822_decomment.3: decomment.c + c2man -irfc822.h decomment.c + +rfc822_parse_address.3: parse_address.c + c2man -irfc822.h parse_address.c + +rfc822_address_sep.3: address_sep.c + c2man -irfc822.h address_sep.c + +../libmpools/libmpools.a: + (cd ../libmpools;$(MAKE)) + +../liblists/liblists.a: + (cd ../liblists;$(MAKE)) + +# +# Dependencies +# + +address.o: address.c address_scan.h address_scan.c parse_address.c +address_scan.c: address_scan.l +decomment.c: rfc822.h +address_sep.c: rfc822.h diff --git a/librfc822/address.c b/librfc822/address.c new file mode 100644 index 0000000..cf382a1 --- /dev/null +++ b/librfc822/address.c @@ -0,0 +1,1114 @@ + +/* A Bison parser, made from address.y + by GNU Bison version 1.27 + */ + +#define YYBISON 1 /* Identify Bison output. */ + +#define yyparse rfc822_parse +#define yylex rfc822_lex +#define yyerror rfc822_error +#define yylval rfc822_lval +#define yychar rfc822_char +#define yydebug rfc822_debug +#define yynerrs rfc822_nerrs +#define TOK_ATOM 257 +#define TOK_ILLEGAL 258 + +#line 10 "address.y" + + /* Definitions we need in the parser. */ + +#include +#ifdef DEBUG_DMALLOC +# include +#endif + +#include "../libmpools/mpools.h" +#define yytext rfc822_text +#define yyley rfc822_lex + + /* Variables in our lexer. */ + +extern char * rfc822_address_buffer; +extern int rfc822_address_buffer_pos; +extern char * yytext; + + /* Our static/global variables. */ + +static int no_memory_flag; +static char * poolname, + * result_hostpart, + * result_localpart, + * result_address; + + /* Prototypes for internal functions. */ + +static int yyparse(void); +static int yyerror(char *); +static char * pool_strdup(char *); +static char * pool_strjoin(char *, char *); +int yylex(void); + + /* These macros call the routines we define later in a fail safe + way. */ + +#define str_dup(target,a) { \ + target = (YYSTYPE) pool_strdup((char *) a); \ + if (target == NULL) { \ + no_memory_flag++; \ + YYABORT; \ + } \ +} + +#define str_join(target,a,b) { \ + target = (YYSTYPE) pool_strjoin((char *) a, (char *) b); \ + if (target == NULL) { \ + no_memory_flag++; \ + YYABORT; \ + } \ +} + +#ifndef YYSTYPE +#define YYSTYPE int +#endif +#include + +#ifndef __cplusplus +#ifndef __STDC__ +#define const +#endif +#endif + + + +#define YYFINAL 28 +#define YYFLAG -32768 +#define YYNTBASE 8 + +#define YYTRANSLATE(x) ((unsigned)(x) <= 258 ? yytranslate[x] : 16) + +static const char yytranslate[] = { 0, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 7, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 5, 2, 2, + 2, 2, 2, 6, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 1, 3, 4 +}; + +#if YYDEBUG != 0 +static const short yyprhs[] = { 0, + 0, 2, 6, 12, 20, 21, 26, 28, 31, 33, + 36, 38, 42, 44, 46, 48 +}; + +static const short yyrhs[] = { 10, + 0, 10, 14, 11, 0, 14, 11, 15, 9, 10, + 0, 14, 11, 15, 9, 10, 14, 11, 0, 0, + 14, 11, 15, 9, 0, 12, 0, 12, 10, 0, + 13, 0, 13, 10, 0, 12, 0, 12, 13, 11, + 0, 3, 0, 7, 0, 6, 0, 5, 0 +}; + +#endif + +#if YYDEBUG != 0 +static const short yyrline[] = { 0, + 69, 74, 80, 88, 99, 100, 105, 106, 107, 108, + 111, 112, 115, 116, 117, 118 +}; +#endif + + +#if YYDEBUG != 0 || defined (YYERROR_VERBOSE) + +static const char * const yytname[] = { "$","error","$undefined.","TOK_ATOM", +"TOK_ILLEGAL","':'","'@'","'.'","address","sourceroutings","local","domain", +"atom","dot","at","colon", NULL +}; +#endif + +static const short yyr1[] = { 0, + 8, 8, 8, 8, 9, 9, 10, 10, 10, 10, + 11, 11, 12, 13, 14, 15 +}; + +static const short yyr2[] = { 0, + 1, 3, 5, 7, 0, 4, 1, 2, 1, 2, + 1, 3, 1, 1, 1, 1 +}; + +static const short yydefact[] = { 0, + 13, 15, 14, 1, 7, 9, 0, 0, 8, 10, + 0, 11, 2, 16, 5, 0, 0, 0, 12, 3, + 0, 0, 5, 4, 6, 0, 0, 0 +}; + +static const short yydefgoto[] = { 26, + 17, 4, 11, 12, 6, 18, 15 +}; + +static const short yypact[] = { 2, +-32768,-32768,-32768, -3, 12, 12, 14, 14,-32768,-32768, + 6, 15,-32768,-32768, -3, 14, 12, 14,-32768, -3, + 6, 14, -3,-32768,-32768, 21, 23,-32768 +}; + +static const short yypgoto[] = {-32768, + 3, 8, -6, 1, 16, 0, 9 +}; + + +#define YYLAST 30 + + +static const short yytable[] = { 7, + 5, 13, 2, 8, 1, 5, 5, 2, 3, 19, + 14, 21, 9, 10, 1, 24, 1, 5, 3, 22, + 27, 3, 28, 0, 20, 25, 0, 16, 0, 23 +}; + +static const short yycheck[] = { 0, + 0, 8, 6, 4, 3, 5, 6, 6, 7, 16, + 5, 18, 5, 6, 3, 22, 3, 17, 7, 20, + 0, 7, 0, -1, 17, 23, -1, 12, -1, 21 +}; +/* -*-C-*- Note some compilers choke on comments on `#line' lines. */ +#line 3 "/usr/share/bison.simple" +/* This file comes from bison-1.27. */ + +/* Skeleton output parser for bison, + Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2, or (at your option) + any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. */ + +/* As a special exception, when this file is copied by Bison into a + Bison output file, you may use that output file without restriction. + This special exception was added by the Free Software Foundation + in version 1.24 of Bison. */ + +/* This is the parser code that is written into each bison parser + when the %semantic_parser declaration is not specified in the grammar. + It was written by Richard Stallman by simplifying the hairy parser + used when %semantic_parser is specified. */ + +#ifndef YYSTACK_USE_ALLOCA +#ifdef alloca +#define YYSTACK_USE_ALLOCA +#else /* alloca not defined */ +#ifdef __GNUC__ +#define YYSTACK_USE_ALLOCA +#define alloca __builtin_alloca +#else /* not GNU C. */ +#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) +#define YYSTACK_USE_ALLOCA +#include +#else /* not sparc */ +/* We think this test detects Watcom and Microsoft C. */ +/* This used to test MSDOS, but that is a bad idea + since that symbol is in the user namespace. */ +#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) +#if 0 /* No need for malloc.h, which pollutes the namespace; + instead, just don't use alloca. */ +#include +#endif +#else /* not MSDOS, or __TURBOC__ */ +#if defined(_AIX) +/* I don't know what this was needed for, but it pollutes the namespace. + So I turned it off. rms, 2 May 1997. */ +/* #include */ + #pragma alloca +#define YYSTACK_USE_ALLOCA +#else /* not MSDOS, or __TURBOC__, or _AIX */ +#if 0 +#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, + and on HPUX 10. Eventually we can turn this on. */ +#define YYSTACK_USE_ALLOCA +#define alloca __builtin_alloca +#endif /* __hpux */ +#endif +#endif /* not _AIX */ +#endif /* not MSDOS, or __TURBOC__ */ +#endif /* not sparc */ +#endif /* not GNU C */ +#endif /* alloca not defined */ +#endif /* YYSTACK_USE_ALLOCA not defined */ + +#ifdef YYSTACK_USE_ALLOCA +#define YYSTACK_ALLOC alloca +#else +#define YYSTACK_ALLOC malloc +#endif + +/* Note: there must be only one dollar sign in this file. + It is replaced by the list of actions, each action + as one case of the switch. */ + +#define yyerrok (yyerrstatus = 0) +#define yyclearin (yychar = YYEMPTY) +#define YYEMPTY -2 +#define YYEOF 0 +#define YYACCEPT goto yyacceptlab +#define YYABORT goto yyabortlab +#define YYERROR goto yyerrlab1 +/* Like YYERROR except do call yyerror. + This remains here temporarily to ease the + transition to the new meaning of YYERROR, for GCC. + Once GCC version 2 has supplanted version 1, this can go. */ +#define YYFAIL goto yyerrlab +#define YYRECOVERING() (!!yyerrstatus) +#define YYBACKUP(token, value) \ +do \ + if (yychar == YYEMPTY && yylen == 1) \ + { yychar = (token), yylval = (value); \ + yychar1 = YYTRANSLATE (yychar); \ + YYPOPSTACK; \ + goto yybackup; \ + } \ + else \ + { yyerror ("syntax error: cannot back up"); YYERROR; } \ +while (0) + +#define YYTERROR 1 +#define YYERRCODE 256 + +#ifndef YYPURE +#define YYLEX yylex() +#endif + +#ifdef YYPURE +#ifdef YYLSP_NEEDED +#ifdef YYLEX_PARAM +#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) +#else +#define YYLEX yylex(&yylval, &yylloc) +#endif +#else /* not YYLSP_NEEDED */ +#ifdef YYLEX_PARAM +#define YYLEX yylex(&yylval, YYLEX_PARAM) +#else +#define YYLEX yylex(&yylval) +#endif +#endif /* not YYLSP_NEEDED */ +#endif + +/* If nonreentrant, generate the variables here */ + +#ifndef YYPURE + +int yychar; /* the lookahead symbol */ +YYSTYPE yylval; /* the semantic value of the */ + /* lookahead symbol */ + +#ifdef YYLSP_NEEDED +YYLTYPE yylloc; /* location data for the lookahead */ + /* symbol */ +#endif + +int yynerrs; /* number of parse errors so far */ +#endif /* not YYPURE */ + +#if YYDEBUG != 0 +int yydebug; /* nonzero means print parse trace */ +/* Since this is uninitialized, it does not stop multiple parsers + from coexisting. */ +#endif + +/* YYINITDEPTH indicates the initial size of the parser's stacks */ + +#ifndef YYINITDEPTH +#define YYINITDEPTH 200 +#endif + +/* YYMAXDEPTH is the maximum size the stacks can grow to + (effective only if the built-in stack extension method is used). */ + +#if YYMAXDEPTH == 0 +#undef YYMAXDEPTH +#endif + +#ifndef YYMAXDEPTH +#define YYMAXDEPTH 10000 +#endif + +/* Define __yy_memcpy. Note that the size argument + should be passed with type unsigned int, because that is what the non-GCC + definitions require. With GCC, __builtin_memcpy takes an arg + of type size_t, but it can handle unsigned int. */ + +#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ +#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) +#else /* not GNU C or C++ */ +#ifndef __cplusplus + +/* This is the most reliable way to avoid incompatibilities + in available built-in functions on various systems. */ +static void +__yy_memcpy (to, from, count) + char *to; + char *from; + unsigned int count; +{ + register char *f = from; + register char *t = to; + register int i = count; + + while (i-- > 0) + *t++ = *f++; +} + +#else /* __cplusplus */ + +/* This is the most reliable way to avoid incompatibilities + in available built-in functions on various systems. */ +static void +__yy_memcpy (char *to, char *from, unsigned int count) +{ + register char *t = to; + register char *f = from; + register int i = count; + + while (i-- > 0) + *t++ = *f++; +} + +#endif +#endif + +#line 216 "/usr/share/bison.simple" + +/* The user can define YYPARSE_PARAM as the name of an argument to be passed + into yyparse. The argument should have type void *. + It should actually point to an object. + Grammar actions can access the variable by casting it + to the proper pointer type. */ + +#ifdef YYPARSE_PARAM +#ifdef __cplusplus +#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM +#define YYPARSE_PARAM_DECL +#else /* not __cplusplus */ +#define YYPARSE_PARAM_ARG YYPARSE_PARAM +#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; +#endif /* not __cplusplus */ +#else /* not YYPARSE_PARAM */ +#define YYPARSE_PARAM_ARG +#define YYPARSE_PARAM_DECL +#endif /* not YYPARSE_PARAM */ + +/* Prevent warning if -Wstrict-prototypes. */ +#ifdef __GNUC__ +#ifdef YYPARSE_PARAM +int yyparse (void *); +#else +int yyparse (void); +#endif +#endif + +int +yyparse(YYPARSE_PARAM_ARG) + YYPARSE_PARAM_DECL +{ + register int yystate; + register int yyn; + register short *yyssp; + register YYSTYPE *yyvsp; + int yyerrstatus; /* number of tokens to shift before error messages enabled */ + int yychar1 = 0; /* lookahead token as an internal (translated) token number */ + + short yyssa[YYINITDEPTH]; /* the state stack */ + YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ + + short *yyss = yyssa; /* refer to the stacks thru separate pointers */ + YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ + +#ifdef YYLSP_NEEDED + YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ + YYLTYPE *yyls = yylsa; + YYLTYPE *yylsp; + +#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) +#else +#define YYPOPSTACK (yyvsp--, yyssp--) +#endif + + int yystacksize = YYINITDEPTH; + int yyfree_stacks = 0; + +#ifdef YYPURE + int yychar; + YYSTYPE yylval; + int yynerrs; +#ifdef YYLSP_NEEDED + YYLTYPE yylloc; +#endif +#endif + + YYSTYPE yyval; /* the variable used to return */ + /* semantic values from the action */ + /* routines */ + + int yylen; + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Starting parse\n"); +#endif + + yystate = 0; + yyerrstatus = 0; + yynerrs = 0; + yychar = YYEMPTY; /* Cause a token to be read. */ + + /* Initialize stack pointers. + Waste one element of value and location stack + so that they stay on the same level as the state stack. + The wasted elements are never initialized. */ + + yyssp = yyss - 1; + yyvsp = yyvs; +#ifdef YYLSP_NEEDED + yylsp = yyls; +#endif + +/* Push a new state, which is found in yystate . */ +/* In all cases, when you get here, the value and location stacks + have just been pushed. so pushing a state here evens the stacks. */ +yynewstate: + + *++yyssp = yystate; + + if (yyssp >= yyss + yystacksize - 1) + { + /* Give user a chance to reallocate the stack */ + /* Use copies of these so that the &'s don't force the real ones into memory. */ + YYSTYPE *yyvs1 = yyvs; + short *yyss1 = yyss; +#ifdef YYLSP_NEEDED + YYLTYPE *yyls1 = yyls; +#endif + + /* Get the current used size of the three stacks, in elements. */ + int size = yyssp - yyss + 1; + +#ifdef yyoverflow + /* Each stack pointer address is followed by the size of + the data in use in that stack, in bytes. */ +#ifdef YYLSP_NEEDED + /* This used to be a conditional around just the two extra args, + but that might be undefined if yyoverflow is a macro. */ + yyoverflow("parser stack overflow", + &yyss1, size * sizeof (*yyssp), + &yyvs1, size * sizeof (*yyvsp), + &yyls1, size * sizeof (*yylsp), + &yystacksize); +#else + yyoverflow("parser stack overflow", + &yyss1, size * sizeof (*yyssp), + &yyvs1, size * sizeof (*yyvsp), + &yystacksize); +#endif + + yyss = yyss1; yyvs = yyvs1; +#ifdef YYLSP_NEEDED + yyls = yyls1; +#endif +#else /* no yyoverflow */ + /* Extend the stack our own way. */ + if (yystacksize >= YYMAXDEPTH) + { + yyerror("parser stack overflow"); + if (yyfree_stacks) + { + free (yyss); + free (yyvs); +#ifdef YYLSP_NEEDED + free (yyls); +#endif + } + return 2; + } + yystacksize *= 2; + if (yystacksize > YYMAXDEPTH) + yystacksize = YYMAXDEPTH; +#ifndef YYSTACK_USE_ALLOCA + yyfree_stacks = 1; +#endif + yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); + __yy_memcpy ((char *)yyss, (char *)yyss1, + size * (unsigned int) sizeof (*yyssp)); + yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); + __yy_memcpy ((char *)yyvs, (char *)yyvs1, + size * (unsigned int) sizeof (*yyvsp)); +#ifdef YYLSP_NEEDED + yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); + __yy_memcpy ((char *)yyls, (char *)yyls1, + size * (unsigned int) sizeof (*yylsp)); +#endif +#endif /* no yyoverflow */ + + yyssp = yyss + size - 1; + yyvsp = yyvs + size - 1; +#ifdef YYLSP_NEEDED + yylsp = yyls + size - 1; +#endif + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Stack size increased to %d\n", yystacksize); +#endif + + if (yyssp >= yyss + yystacksize - 1) + YYABORT; + } + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Entering state %d\n", yystate); +#endif + + goto yybackup; + yybackup: + +/* Do appropriate processing given the current state. */ +/* Read a lookahead token if we need one and don't already have one. */ +/* yyresume: */ + + /* First try to decide what to do without reference to lookahead token. */ + + yyn = yypact[yystate]; + if (yyn == YYFLAG) + goto yydefault; + + /* Not known => get a lookahead token if don't already have one. */ + + /* yychar is either YYEMPTY or YYEOF + or a valid token in external form. */ + + if (yychar == YYEMPTY) + { +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Reading a token: "); +#endif + yychar = YYLEX; + } + + /* Convert token to internal form (in yychar1) for indexing tables with */ + + if (yychar <= 0) /* This means end of input. */ + { + yychar1 = 0; + yychar = YYEOF; /* Don't call YYLEX any more */ + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Now at end of input.\n"); +#endif + } + else + { + yychar1 = YYTRANSLATE(yychar); + +#if YYDEBUG != 0 + if (yydebug) + { + fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); + /* Give the individual parser a way to print the precise meaning + of a token, for further debugging info. */ +#ifdef YYPRINT + YYPRINT (stderr, yychar, yylval); +#endif + fprintf (stderr, ")\n"); + } +#endif + } + + yyn += yychar1; + if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) + goto yydefault; + + yyn = yytable[yyn]; + + /* yyn is what to do for this token type in this state. + Negative => reduce, -yyn is rule number. + Positive => shift, yyn is new state. + New state is final state => don't bother to shift, + just return success. + 0, or most negative number => error. */ + + if (yyn < 0) + { + if (yyn == YYFLAG) + goto yyerrlab; + yyn = -yyn; + goto yyreduce; + } + else if (yyn == 0) + goto yyerrlab; + + if (yyn == YYFINAL) + YYACCEPT; + + /* Shift the lookahead token. */ + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); +#endif + + /* Discard the token being shifted unless it is eof. */ + if (yychar != YYEOF) + yychar = YYEMPTY; + + *++yyvsp = yylval; +#ifdef YYLSP_NEEDED + *++yylsp = yylloc; +#endif + + /* count tokens shifted since error; after three, turn off error status. */ + if (yyerrstatus) yyerrstatus--; + + yystate = yyn; + goto yynewstate; + +/* Do the default action for the current state. */ +yydefault: + + yyn = yydefact[yystate]; + if (yyn == 0) + goto yyerrlab; + +/* Do a reduction. yyn is the number of a rule to reduce with. */ +yyreduce: + yylen = yyr2[yyn]; + if (yylen > 0) + yyval = yyvsp[1-yylen]; /* implement default value of the action */ + +#if YYDEBUG != 0 + if (yydebug) + { + int i; + + fprintf (stderr, "Reducing via rule %d (line %d), ", + yyn, yyrline[yyn]); + + /* Print the symbols being reduced, and their result. */ + for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) + fprintf (stderr, "%s ", yytname[yyrhs[i]]); + fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); + } +#endif + + + switch (yyn) { + +case 1: +#line 69 "address.y" +{ + result_localpart = (char *)yyvsp[0]; + str_dup(yyval,yyvsp[0]); + result_address = (char *)yyval; + ; + break;} +case 2: +#line 74 "address.y" +{ + result_localpart = (char *)yyvsp[-2]; + result_hostpart = (char *)yyvsp[0]; + str_join(yyval,yyvsp[-2],yyvsp[-1]); str_join(yyval,yyval,yyvsp[0]); + result_address = (char *)yyval; + ; + break;} +case 3: +#line 80 "address.y" +{ + result_hostpart = (char *)yyvsp[-3]; + str_join(yyval,yyvsp[-1],yyvsp[0]); + result_localpart = (char *)yyval; + str_join(yyval,yyvsp[-2],yyval); str_join(yyval,yyvsp[-3],yyval); + str_join(yyval,yyvsp[-4],yyval); + result_address = (char *)yyval; + ; + break;} +case 4: +#line 88 "address.y" +{ + result_hostpart = (char *)yyvsp[-5]; + str_join(yyval,yyvsp[-3],yyvsp[-2]); str_join(yyval,yyval,yyvsp[-1]); + str_join(yyval,yyval,yyvsp[0]); + result_localpart = (char *)yyval; + str_join(yyval,yyvsp[-4],yyval); str_join(yyval,yyvsp[-5],yyval); + str_join(yyval,yyvsp[-6],yyval); + result_address = (char *)yyval; + ; + break;} +case 5: +#line 99 "address.y" +{ yyval = (YYSTYPE) NULL; ; + break;} +case 6: +#line 100 "address.y" +{ + str_join(yyval,yyvsp[-3],yyvsp[-2]); str_join(yyval,yyval,yyvsp[-1]); + str_join(yyval,yyval,yyvsp[0]); + ; + break;} +case 7: +#line 105 "address.y" +{ yyval = yyvsp[0]; ; + break;} +case 8: +#line 106 "address.y" +{ str_join(yyval,yyvsp[-1],yyvsp[0]); ; + break;} +case 9: +#line 107 "address.y" +{ yyval = yyvsp[0]; ; + break;} +case 10: +#line 108 "address.y" +{ str_join(yyval,yyvsp[-1],yyvsp[0]); ; + break;} +case 11: +#line 111 "address.y" +{ yyval = yyvsp[0]; ; + break;} +case 12: +#line 112 "address.y" +{ str_join(yyval,yyvsp[-1],yyvsp[0]); str_join(yyval,yyvsp[-2],yyval); ; + break;} +case 13: +#line 115 "address.y" +{ str_dup(yyval,yytext); ; + break;} +case 14: +#line 116 "address.y" +{ yyval = (YYSTYPE) "."; ; + break;} +case 15: +#line 117 "address.y" +{ yyval = (YYSTYPE) "@"; ; + break;} +case 16: +#line 118 "address.y" +{ yyval = (YYSTYPE) ":"; ; + break;} +} + /* the action file gets copied in in place of this dollarsign */ +#line 542 "/usr/share/bison.simple" + + yyvsp -= yylen; + yyssp -= yylen; +#ifdef YYLSP_NEEDED + yylsp -= yylen; +#endif + +#if YYDEBUG != 0 + if (yydebug) + { + short *ssp1 = yyss - 1; + fprintf (stderr, "state stack now"); + while (ssp1 != yyssp) + fprintf (stderr, " %d", *++ssp1); + fprintf (stderr, "\n"); + } +#endif + + *++yyvsp = yyval; + +#ifdef YYLSP_NEEDED + yylsp++; + if (yylen == 0) + { + yylsp->first_line = yylloc.first_line; + yylsp->first_column = yylloc.first_column; + yylsp->last_line = (yylsp-1)->last_line; + yylsp->last_column = (yylsp-1)->last_column; + yylsp->text = 0; + } + else + { + yylsp->last_line = (yylsp+yylen-1)->last_line; + yylsp->last_column = (yylsp+yylen-1)->last_column; + } +#endif + + /* Now "shift" the result of the reduction. + Determine what state that goes to, + based on the state we popped back to + and the rule number reduced by. */ + + yyn = yyr1[yyn]; + + yystate = yypgoto[yyn - YYNTBASE] + *yyssp; + if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) + yystate = yytable[yystate]; + else + yystate = yydefgoto[yyn - YYNTBASE]; + + goto yynewstate; + +yyerrlab: /* here on detecting error */ + + if (! yyerrstatus) + /* If not already recovering from an error, report this error. */ + { + ++yynerrs; + +#ifdef YYERROR_VERBOSE + yyn = yypact[yystate]; + + if (yyn > YYFLAG && yyn < YYLAST) + { + int size = 0; + char *msg; + int x, count; + + count = 0; + /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ + for (x = (yyn < 0 ? -yyn : 0); + x < (sizeof(yytname) / sizeof(char *)); x++) + if (yycheck[x + yyn] == x) + size += strlen(yytname[x]) + 15, count++; + msg = (char *) malloc(size + 15); + if (msg != 0) + { + strcpy(msg, "parse error"); + + if (count < 5) + { + count = 0; + for (x = (yyn < 0 ? -yyn : 0); + x < (sizeof(yytname) / sizeof(char *)); x++) + if (yycheck[x + yyn] == x) + { + strcat(msg, count == 0 ? ", expecting `" : " or `"); + strcat(msg, yytname[x]); + strcat(msg, "'"); + count++; + } + } + yyerror(msg); + free(msg); + } + else + yyerror ("parse error; also virtual memory exceeded"); + } + else +#endif /* YYERROR_VERBOSE */ + yyerror("parse error"); + } + + goto yyerrlab1; +yyerrlab1: /* here on error raised explicitly by an action */ + + if (yyerrstatus == 3) + { + /* if just tried and failed to reuse lookahead token after an error, discard it. */ + + /* return failure if at end of input */ + if (yychar == YYEOF) + YYABORT; + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); +#endif + + yychar = YYEMPTY; + } + + /* Else will try to reuse lookahead token + after shifting the error token. */ + + yyerrstatus = 3; /* Each real token shifted decrements this */ + + goto yyerrhandle; + +yyerrdefault: /* current state does not do anything special for the error token. */ + +#if 0 + /* This is wrong; only states that explicitly want error tokens + should shift them. */ + yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ + if (yyn) goto yydefault; +#endif + +yyerrpop: /* pop the current state because it cannot handle the error token */ + + if (yyssp == yyss) YYABORT; + yyvsp--; + yystate = *--yyssp; +#ifdef YYLSP_NEEDED + yylsp--; +#endif + +#if YYDEBUG != 0 + if (yydebug) + { + short *ssp1 = yyss - 1; + fprintf (stderr, "Error: state stack now"); + while (ssp1 != yyssp) + fprintf (stderr, " %d", *++ssp1); + fprintf (stderr, "\n"); + } +#endif + +yyerrhandle: + + yyn = yypact[yystate]; + if (yyn == YYFLAG) + goto yyerrdefault; + + yyn += YYTERROR; + if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) + goto yyerrdefault; + + yyn = yytable[yyn]; + if (yyn < 0) + { + if (yyn == YYFLAG) + goto yyerrpop; + yyn = -yyn; + goto yyreduce; + } + else if (yyn == 0) + goto yyerrpop; + + if (yyn == YYFINAL) + YYACCEPT; + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Shifting error token, "); +#endif + + *++yyvsp = yylval; +#ifdef YYLSP_NEEDED + *++yylsp = yylloc; +#endif + + yystate = yyn; + goto yynewstate; + + yyacceptlab: + /* YYACCEPT comes here. */ + if (yyfree_stacks) + { + free (yyss); + free (yyvs); +#ifdef YYLSP_NEEDED + free (yyls); +#endif + } + return 0; + + yyabortlab: + /* YYABORT comes here. */ + if (yyfree_stacks) + { + free (yyss); + free (yyvs); +#ifdef YYLSP_NEEDED + free (yyls); +#endif + } + return 1; +} +#line 120 "address.y" + +/***** internal routines *****/ + +static int +yyerror(char * string) +{ + return 0; +} + +/* Do the same as strdup(3) but use the memory pool to allocate the + memory, so that we don't lose memory. */ + +static char * +pool_strdup(char * string) +{ + char * p; + + if (string == NULL) + return NULL; + + p = mp_malloc(poolname, strlen(string) + 1); + if (p == NULL) + return NULL; + + strcpy(p, string); + return p; +} + +/* Allocate a new buffer (using the memory pool) and join the strings + 'a' and 'b' into it. */ + +static char * +pool_strjoin(char * a, char * b) +{ + char * p; + int length = 0; + + if (a != NULL) + length += strlen(a); + if (b != NULL) + length += strlen(b); + if (length == 0) + return NULL; + + p = mp_malloc(poolname, length + 2); + if (p == NULL) + return NULL; + else + *p = '\0'; + + if (a) + strcpy(p, a); + if (b) + strcpy(&(p[strlen(p)]), b); + + return p; +} + +/****** public routines ******/ + +#include "parse_address.c" diff --git a/librfc822/address.y b/librfc822/address.y new file mode 100644 index 0000000..322be9e --- /dev/null +++ b/librfc822/address.y @@ -0,0 +1,180 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ + +%{ + /* Definitions we need in the parser. */ + +#include +#ifdef DEBUG_DMALLOC +# include +#endif + +#include "../libmpools/mpools.h" +#define yytext rfc822_text +#define yyley rfc822_lex + + /* Variables in our lexer. */ + +extern char * rfc822_address_buffer; +extern int rfc822_address_buffer_pos; +extern char * yytext; + + /* Our static/global variables. */ + +static int no_memory_flag; +static char * poolname, + * result_hostpart, + * result_localpart, + * result_address; + + /* Prototypes for internal functions. */ + +static int yyparse(void); +static int yyerror(char *); +static char * pool_strdup(char *); +static char * pool_strjoin(char *, char *); +int yylex(void); + + /* These macros call the routines we define later in a fail safe + way. */ + +#define str_dup(target,a) { \ + target = (YYSTYPE) pool_strdup((char *) a); \ + if (target == NULL) { \ + no_memory_flag++; \ + YYABORT; \ + } \ +} + +#define str_join(target,a,b) { \ + target = (YYSTYPE) pool_strjoin((char *) a, (char *) b); \ + if (target == NULL) { \ + no_memory_flag++; \ + YYABORT; \ + } \ +} + +%} +%token TOK_ATOM TOK_ILLEGAL +%left ':' +%left '@' +%% + +address: local { + result_localpart = (char *)$1; + str_dup($$,$1); + result_address = (char *)$$; + } + | local at domain { + result_localpart = (char *)$1; + result_hostpart = (char *)$3; + str_join($$,$1,$2); str_join($$,$$,$3); + result_address = (char *)$$; + } + | at domain colon sourceroutings local { + result_hostpart = (char *)$2; + str_join($$,$4,$5); + result_localpart = (char *)$$; + str_join($$,$3,$$); str_join($$,$2,$$); + str_join($$,$1,$$); + result_address = (char *)$$; + } + | at domain colon sourceroutings local at domain { + result_hostpart = (char *)$2; + str_join($$,$4,$5); str_join($$,$$,$6); + str_join($$,$$,$7); + result_localpart = (char *)$$; + str_join($$,$3,$$); str_join($$,$2,$$); + str_join($$,$1,$$); + result_address = (char *)$$; + } +; + +sourceroutings: /* empty */ { $$ = (YYSTYPE) NULL; } + | at domain colon sourceroutings { + str_join($$,$1,$2); str_join($$,$$,$3); + str_join($$,$$,$4); + } + +local: atom { $$ = $1; } + | atom local { str_join($$,$1,$2); } + | dot { $$ = $1; } + | dot local { str_join($$,$1,$2); } +; + +domain: atom { $$ = $1; } + | atom dot domain { str_join($$,$2,$3); str_join($$,$1,$$); } +; + +atom: TOK_ATOM { str_dup($$,yytext); } +dot: '.' { $$ = (YYSTYPE) "."; } +at: '@' { $$ = (YYSTYPE) "@"; } +colon: ':' { $$ = (YYSTYPE) ":"; } + +%% +/***** internal routines *****/ + +static int +yyerror(char * string) +{ + return 0; +} + +/* Do the same as strdup(3) but use the memory pool to allocate the + memory, so that we don't lose memory. */ + +static char * +pool_strdup(char * string) +{ + char * p; + + if (string == NULL) + return NULL; + + p = mp_malloc(poolname, strlen(string) + 1); + if (p == NULL) + return NULL; + + strcpy(p, string); + return p; +} + +/* Allocate a new buffer (using the memory pool) and join the strings + 'a' and 'b' into it. */ + +static char * +pool_strjoin(char * a, char * b) +{ + char * p; + int length = 0; + + if (a != NULL) + length += strlen(a); + if (b != NULL) + length += strlen(b); + if (length == 0) + return NULL; + + p = mp_malloc(poolname, length + 2); + if (p == NULL) + return NULL; + else + *p = '\0'; + + if (a) + strcpy(p, a); + if (b) + strcpy(&(p[strlen(p)]), b); + + return p; +} + +/****** public routines ******/ + +#include "parse_address.c" diff --git a/librfc822/address_scan.c b/librfc822/address_scan.c new file mode 100644 index 0000000..6ee7c2e --- /dev/null +++ b/librfc822/address_scan.c @@ -0,0 +1,1660 @@ +#define yy_create_buffer rfc822__create_buffer +#define yy_delete_buffer rfc822__delete_buffer +#define yy_scan_buffer rfc822__scan_buffer +#define yy_scan_string rfc822__scan_string +#define yy_scan_bytes rfc822__scan_bytes +#define yy_flex_debug rfc822__flex_debug +#define yy_init_buffer rfc822__init_buffer +#define yy_flush_buffer rfc822__flush_buffer +#define yy_load_buffer_state rfc822__load_buffer_state +#define yy_switch_to_buffer rfc822__switch_to_buffer +#define yyin rfc822_in +#define yyleng rfc822_leng +#define yylex rfc822_lex +#define yyout rfc822_out +#define yyrestart rfc822_restart +#define yytext rfc822_text +#define yywrap rfc822_wrap + +/* A lexical scanner generated by flex */ + +/* Scanner skeleton version: + * $Header$ + */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 + +#include + + +/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ +#ifdef c_plusplus +#ifndef __cplusplus +#define __cplusplus +#endif +#endif + + +#ifdef __cplusplus + +#include +#include + +/* Use prototypes in function declarations. */ +#define YY_USE_PROTOS + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +#if __STDC__ + +#define YY_USE_PROTOS +#define YY_USE_CONST + +#endif /* __STDC__ */ +#endif /* ! __cplusplus */ + +#ifdef __TURBOC__ + #pragma warn -rch + #pragma warn -use +#include +#include +#define YY_USE_CONST +#define YY_USE_PROTOS +#endif + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#endif + + +#ifdef YY_USE_PROTOS +#define YY_PROTO(proto) proto +#else +#define YY_PROTO(proto) () +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an unsigned + * integer for use as an array index. If the signed char is negative, + * we want to instead treat it as an 8-bit unsigned char, hence the + * double cast. + */ +#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN yy_start = 1 + 2 * + +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START ((yy_start - 1) / 2) +#define YYSTATE YY_START + +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) + +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE yyrestart( yyin ) + +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#define YY_BUF_SIZE 16384 + +typedef struct yy_buffer_state *YY_BUFFER_STATE; + +extern int yyleng; +extern FILE *yyin, *yyout; + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + +/* The funky do-while in the following #define is used to turn the definition + * int a single C statement (which needs a semi-colon terminator). This + * avoids problems with code like: + * + * if ( condition_holds ) + * yyless( 5 ); + * else + * do_something_else(); + * + * Prior to using the do-while the compiler would get upset at the + * "else" because it interpreted the "if" statement as being all + * done when it reached the ';' after the yyless() call. + */ + +/* Return all but the first 'n' matched characters back to the input stream. */ + +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + *yy_cp = yy_hold_char; \ + YY_RESTORE_YY_MORE_OFFSET \ + yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) + +#define unput(c) yyunput( c, yytext_ptr ) + +/* The following is because we cannot portably get our hands on size_t + * (without autoconf's help, which isn't available because we want + * flex-generated scanners to compile on their own). + */ +typedef unsigned int yy_size_t; + + +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + yy_size_t yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + int yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via yyrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + }; + +static YY_BUFFER_STATE yy_current_buffer = 0; + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + */ +#define YY_CURRENT_BUFFER yy_current_buffer + + +/* yy_hold_char holds the character lost when yytext is formed. */ +static char yy_hold_char; + +static int yy_n_chars; /* number of characters read into yy_ch_buf */ + + +int yyleng; + +/* Points to current character in buffer. */ +static char *yy_c_buf_p = (char *) 0; +static int yy_init = 1; /* whether we need to initialize */ +static int yy_start = 0; /* start state number */ + +/* Flag which is used to allow yywrap()'s to do buffer switches + * instead of setting up a fresh yyin. A bit of a hack ... + */ +static int yy_did_buffer_switch_on_eof; + +void yyrestart YY_PROTO(( FILE *input_file )); + +void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); +void yy_load_buffer_state YY_PROTO(( void )); +YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); +void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); +void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); +void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); +#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer ) + +YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size )); +YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str )); +YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len )); + +static void *yy_flex_alloc YY_PROTO(( yy_size_t )); +static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )); +static void yy_flex_free YY_PROTO(( void * )); + +#define yy_new_buffer yy_create_buffer + +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! yy_current_buffer ) \ + yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ + yy_current_buffer->yy_is_interactive = is_interactive; \ + } + +#define yy_set_bol(at_bol) \ + { \ + if ( ! yy_current_buffer ) \ + yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ + yy_current_buffer->yy_at_bol = at_bol; \ + } + +#define YY_AT_BOL() (yy_current_buffer->yy_at_bol) + +typedef unsigned char YY_CHAR; +FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; +typedef int yy_state_type; +extern char *yytext; +#define yytext_ptr yytext + +static yy_state_type yy_get_previous_state YY_PROTO(( void )); +static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); +static int yy_get_next_buffer YY_PROTO(( void )); +static void yy_fatal_error YY_PROTO(( yyconst char msg[] )); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + yytext_ptr = yy_bp; \ + yytext_ptr -= yy_more_len; \ + yyleng = (int) (yy_cp - yytext_ptr); \ + yy_hold_char = *yy_cp; \ + *yy_cp = '\0'; \ + yy_c_buf_p = yy_cp; + +#define YY_NUM_RULES 15 +#define YY_END_OF_BUFFER 16 +static yyconst short int yy_accept[32] = + { 0, + 0, 0, 0, 0, 0, 0, 0, 0, 16, 5, + 6, 11, 8, 7, 7, 4, 12, 14, 15, 9, + 15, 10, 5, 4, 6, 2, 12, 13, 3, 1, + 0 + } ; + +static yyconst int yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 1, 4, 1, 1, 1, 1, 1, 5, + 5, 1, 1, 5, 1, 6, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 7, 1, 5, + 1, 5, 1, 6, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static yyconst int yy_meta[9] = + { 0, + 1, 2, 3, 4, 2, 2, 2, 5 + } ; + +static yyconst short int yy_base[39] = + { 0, + 0, 0, 5, 10, 51, 40, 36, 34, 17, 8, + 13, 55, 55, 55, 55, 0, 0, 55, 8, 55, + 55, 55, 3, 0, 8, 13, 0, 55, 55, 55, + 55, 20, 25, 30, 35, 40, 45, 48 + } ; + +static yyconst short int yy_def[39] = + { 0, + 31, 1, 32, 32, 33, 33, 34, 34, 31, 35, + 31, 31, 31, 31, 31, 36, 37, 31, 31, 31, + 31, 31, 35, 36, 31, 38, 37, 31, 31, 31, + 0, 31, 31, 31, 31, 31, 31, 31 + } ; + +static yyconst short int yy_nxt[64] = + { 0, + 10, 11, 10, 12, 13, 14, 15, 16, 18, 25, + 24, 28, 19, 18, 25, 24, 31, 19, 30, 30, + 17, 17, 17, 17, 17, 20, 20, 20, 20, 20, + 22, 22, 22, 22, 22, 23, 21, 23, 21, 23, + 26, 26, 21, 26, 26, 27, 27, 27, 29, 29, + 29, 29, 29, 21, 9, 31, 31, 31, 31, 31, + 31, 31, 31 + } ; + +static yyconst short int yy_chk[64] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 3, 25, + 23, 19, 3, 4, 11, 10, 9, 4, 26, 26, + 32, 32, 32, 32, 32, 33, 33, 33, 33, 33, + 34, 34, 34, 34, 34, 35, 8, 35, 7, 35, + 36, 36, 6, 36, 36, 37, 37, 37, 38, 38, + 38, 38, 38, 5, 31, 31, 31, 31, 31, 31, + 31, 31, 31 + } ; + +static yy_state_type yy_last_accepting_state; +static char *yy_last_accepting_cpos; + +/* The intent behind this definition is that it'll catch + * any uses of REJECT which flex missed. + */ +#define REJECT reject_used_but_not_detected +static int yy_more_flag = 0; +static int yy_more_len = 0; +#define yymore() (yy_more_flag = 1) +#define YY_MORE_ADJ yy_more_len +#define YY_RESTORE_YY_MORE_OFFSET +char *yytext; +#line 1 "address_scan.l" +#define INITIAL 0 +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ +#line 11 "address_scan.l" +#ifdef DEBUG_DMALLOC +# include +#endif + +#include "rfc822.h" +#include "address_scan.h" +#define yylval rfc822_lval + +extern int yylval; + +char * rfc822_address_buffer; +int rfc822_address_buffer_pos; + +#define YY_INPUT(buf,result,max_size) { \ + buf[0] = rfc822_address_buffer[rfc822_address_buffer_pos++]; \ + result = ((buf[0] != '\0') ? 1 : YY_NULL); \ +} +#define quoted 1 +#define escaped 2 +#define escaped2 3 + +#line 435 "lex.rfc822_.c" + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int yywrap YY_PROTO(( void )); +#else +extern int yywrap YY_PROTO(( void )); +#endif +#endif + +#ifndef YY_NO_UNPUT +static void yyunput YY_PROTO(( int c, char *buf_ptr )); +#endif + +#ifndef yytext_ptr +static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int )); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen YY_PROTO(( yyconst char * )); +#endif + +#ifndef YY_NO_INPUT +#ifdef __cplusplus +static int yyinput YY_PROTO(( void )); +#else +static int input YY_PROTO(( void )); +#endif +#endif + +#if YY_STACK_USED +static int yy_start_stack_ptr = 0; +static int yy_start_stack_depth = 0; +static int *yy_start_stack = 0; +#ifndef YY_NO_PUSH_STATE +static void yy_push_state YY_PROTO(( int new_state )); +#endif +#ifndef YY_NO_POP_STATE +static void yy_pop_state YY_PROTO(( void )); +#endif +#ifndef YY_NO_TOP_STATE +static int yy_top_state YY_PROTO(( void )); +#endif + +#else +#define YY_NO_PUSH_STATE 1 +#define YY_NO_POP_STATE 1 +#define YY_NO_TOP_STATE 1 +#endif + +#ifdef YY_MALLOC_DECL +YY_MALLOC_DECL +#else +#if __STDC__ +#ifndef __cplusplus +#include +#endif +#else +/* Just try to get by without declaring the routines. This will fail + * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int) + * or sizeof(void*) != sizeof(int). + */ +#endif +#endif + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#define YY_READ_BUF_SIZE 8192 +#endif + +/* Copy whatever the last rule matched to the standard output. */ + +#ifndef ECHO +/* This used to be an fputs(), but since the string might contain NUL's, + * we now use fwrite(). + */ +#define ECHO (void) fwrite( yytext, yyleng, 1, yyout ) +#endif + +/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, + * is returned in "result". + */ +#ifndef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ + if ( yy_current_buffer->yy_is_interactive ) \ + { \ + int c = '*', n; \ + for ( n = 0; n < max_size && \ + (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ + buf[n] = (char) c; \ + if ( c == '\n' ) \ + buf[n++] = (char) c; \ + if ( c == EOF && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + result = n; \ + } \ + else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \ + && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); +#endif + +/* No semi-colon after return; correct usage is to write "yyterminate();" - + * we don't want an extra ';' after the "return" because that will cause + * some compilers to complain about unreachable statements. + */ +#ifndef yyterminate +#define yyterminate() return YY_NULL +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Report a fatal error. */ +#ifndef YY_FATAL_ERROR +#define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) +#endif + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL int yylex YY_PROTO(( void )) +#endif + +/* Code executed at the beginning of each rule, after yytext and yyleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK break; +#endif + +#define YY_RULE_SETUP \ + YY_USER_ACTION + +YY_DECL + { + register yy_state_type yy_current_state; + register char *yy_cp, *yy_bp; + register int yy_act; + +#line 30 "address_scan.l" + +#line 588 "lex.rfc822_.c" + + if ( yy_init ) + { + yy_init = 0; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! yy_start ) + yy_start = 1; /* first start state */ + + if ( ! yyin ) + yyin = stdin; + + if ( ! yyout ) + yyout = stdout; + + if ( ! yy_current_buffer ) + yy_current_buffer = + yy_create_buffer( yyin, YY_BUF_SIZE ); + + yy_load_buffer_state(); + } + + while ( 1 ) /* loops until end-of-file is reached */ + { + yy_more_len = 0; + if ( yy_more_flag ) + { + yy_more_len = yy_c_buf_p - yytext_ptr; + yy_more_flag = 0; + } + yy_cp = yy_c_buf_p; + + /* Support of yytext. */ + *yy_cp = yy_hold_char; + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = yy_start; +yy_match: + do + { + register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; + if ( yy_accept[yy_current_state] ) + { + yy_last_accepting_state = yy_current_state; + yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 32 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + ++yy_cp; + } + while ( yy_base[yy_current_state] != 55 ); + +yy_find_action: + yy_act = yy_accept[yy_current_state]; + if ( yy_act == 0 ) + { /* have to back up */ + yy_cp = yy_last_accepting_cpos; + yy_current_state = yy_last_accepting_state; + yy_act = yy_accept[yy_current_state]; + } + + YY_DO_BEFORE_ACTION; + + +do_action: /* This label is used only to access EOF actions. */ + + + switch ( yy_act ) + { /* beginning of action switch */ + case 0: /* must back up */ + /* undo the effects of YY_DO_BEFORE_ACTION */ + *yy_cp = yy_hold_char; + yy_cp = yy_last_accepting_cpos; + yy_current_state = yy_last_accepting_state; + goto yy_find_action; + +case 1: +*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ +yy_c_buf_p = yy_cp -= 2; +YY_DO_BEFORE_ACTION; /* set up yytext again */ +YY_RULE_SETUP +#line 31 "address_scan.l" +{ BEGIN(escaped2); yymore(); } + YY_BREAK +case 2: +*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ +yy_c_buf_p = yy_cp -= 1; +YY_DO_BEFORE_ACTION; /* set up yytext again */ +YY_RULE_SETUP +#line 32 "address_scan.l" +{ BEGIN(escaped2); yymore(); } + YY_BREAK +case 3: +*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ +yy_c_buf_p = yy_cp -= 2; +YY_DO_BEFORE_ACTION; /* set up yytext again */ +YY_RULE_SETUP +#line 33 "address_scan.l" +{ BEGIN(escaped); yymore(); } + YY_BREAK +case 4: +YY_RULE_SETUP +#line 34 "address_scan.l" +{ return TOK_ILLEGAL; } + YY_BREAK +case 5: +YY_RULE_SETUP +#line 35 "address_scan.l" +{ return TOK_ATOM; } + YY_BREAK +case 6: +YY_RULE_SETUP +#line 37 "address_scan.l" +/* eat up whitespace */ + YY_BREAK +case 7: +YY_RULE_SETUP +#line 38 "address_scan.l" +{ yylval = yytext[0]; return yylval; } + YY_BREAK +case 8: +YY_RULE_SETUP +#line 39 "address_scan.l" +{ return TOK_ILLEGAL; } + YY_BREAK +case 9: +YY_RULE_SETUP +#line 41 "address_scan.l" +{ BEGIN(INITIAL); yymore(); } + YY_BREAK +case 10: +YY_RULE_SETUP +#line 42 "address_scan.l" +{ BEGIN(INITIAL); return TOK_ATOM; } + YY_BREAK +case 11: +YY_RULE_SETUP +#line 44 "address_scan.l" +{ BEGIN(quoted); yymore(); } + YY_BREAK +case 12: +YY_RULE_SETUP +#line 45 "address_scan.l" +{ yymore(); } + YY_BREAK +case 13: +YY_RULE_SETUP +#line 46 "address_scan.l" +{ yymore(); } + YY_BREAK +case 14: +YY_RULE_SETUP +#line 47 "address_scan.l" +{ BEGIN(INITIAL); return TOK_ATOM; } + YY_BREAK +case YY_STATE_EOF(quoted): +#line 48 "address_scan.l" +{ BEGIN(INITIAL); return TOK_ILLEGAL; } + YY_BREAK +case 15: +YY_RULE_SETUP +#line 49 "address_scan.l" +ECHO; + YY_BREAK +#line 765 "lex.rfc822_.c" +case YY_STATE_EOF(INITIAL): +case YY_STATE_EOF(escaped): +case YY_STATE_EOF(escaped2): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = yy_hold_char; + YY_RESTORE_YY_MORE_OFFSET + + if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW ) + { + /* We're scanning a new file or input source. It's + * possible that this happened because the user + * just pointed yyin at a new source and called + * yylex(). If so, then we have to assure + * consistency between yy_current_buffer and our + * globals. Here is the right place to do so, because + * this is the first action (other than possibly a + * back-up) that will match for the new input source. + */ + yy_n_chars = yy_current_buffer->yy_n_chars; + yy_current_buffer->yy_input_file = yyin; + yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL; + } + + /* Note that here we test for yy_c_buf_p "<=" to the position + * of the first EOB in the buffer, since yy_c_buf_p will + * already have been incremented past the NUL character + * (since all states make transitions on EOB to the + * end-of-buffer state). Contrast this with the test + * in input(). + */ + if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) + { /* This was really a NUL. */ + yy_state_type yy_next_state; + + yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state(); + + /* Okay, we're now positioned to make the NUL + * transition. We couldn't have + * yy_get_previous_state() go ahead and do it + * for us because it doesn't know how to deal + * with the possibility of jamming (and we don't + * want to build jamming into it because then it + * will run more slowly). + */ + + yy_next_state = yy_try_NUL_trans( yy_current_state ); + + yy_bp = yytext_ptr + YY_MORE_ADJ; + + if ( yy_next_state ) + { + /* Consume the NUL. */ + yy_cp = ++yy_c_buf_p; + yy_current_state = yy_next_state; + goto yy_match; + } + + else + { + yy_cp = yy_c_buf_p; + goto yy_find_action; + } + } + + else switch ( yy_get_next_buffer() ) + { + case EOB_ACT_END_OF_FILE: + { + yy_did_buffer_switch_on_eof = 0; + + if ( yywrap() ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * yytext, we can now set up + * yy_c_buf_p so that if some total + * hoser (like flex itself) wants to + * call the scanner after we return the + * YY_NULL, it'll still work - another + * YY_NULL will get returned. + */ + yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; + + yy_act = YY_STATE_EOF(YY_START); + goto do_action; + } + + else + { + if ( ! yy_did_buffer_switch_on_eof ) + YY_NEW_FILE; + } + break; + } + + case EOB_ACT_CONTINUE_SCAN: + yy_c_buf_p = + yytext_ptr + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state(); + + yy_cp = yy_c_buf_p; + yy_bp = yytext_ptr + YY_MORE_ADJ; + goto yy_match; + + case EOB_ACT_LAST_MATCH: + yy_c_buf_p = + &yy_current_buffer->yy_ch_buf[yy_n_chars]; + + yy_current_state = yy_get_previous_state(); + + yy_cp = yy_c_buf_p; + yy_bp = yytext_ptr + YY_MORE_ADJ; + goto yy_find_action; + } + break; + } + + default: + YY_FATAL_ERROR( + "fatal flex scanner internal error--no action found" ); + } /* end of action switch */ + } /* end of scanning one token */ + } /* end of yylex */ + + +/* yy_get_next_buffer - try to read in a new buffer + * + * Returns a code representing an action: + * EOB_ACT_LAST_MATCH - + * EOB_ACT_CONTINUE_SCAN - continue scanning from current position + * EOB_ACT_END_OF_FILE - end of file + */ + +static int yy_get_next_buffer() + { + register char *dest = yy_current_buffer->yy_ch_buf; + register char *source = yytext_ptr; + register int number_to_move, i; + int ret_val; + + if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( yy_current_buffer->yy_fill_buffer == 0 ) + { /* Don't try to fill the buffer, so this is an EOF. */ + if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) + { + /* We matched a single character, the EOB, so + * treat this as a final EOF. + */ + return EOB_ACT_END_OF_FILE; + } + + else + { + /* We matched some text prior to the EOB, first + * process it. + */ + return EOB_ACT_LAST_MATCH; + } + } + + /* Try to read more data. */ + + /* First move last chars to start of buffer. */ + number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1; + + for ( i = 0; i < number_to_move; ++i ) + *(dest++) = *(source++); + + if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING ) + /* don't do the read, it's not guaranteed to return an EOF, + * just force an EOF + */ + yy_current_buffer->yy_n_chars = yy_n_chars = 0; + + else + { + int num_to_read = + yy_current_buffer->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ +#ifdef YY_USES_REJECT + YY_FATAL_ERROR( +"input buffer overflow, can't enlarge buffer because scanner uses REJECT" ); +#else + + /* just a shorter name for the current buffer */ + YY_BUFFER_STATE b = yy_current_buffer; + + int yy_c_buf_p_offset = + (int) (yy_c_buf_p - b->yy_ch_buf); + + if ( b->yy_is_our_buffer ) + { + int new_size = b->yy_buf_size * 2; + + if ( new_size <= 0 ) + b->yy_buf_size += b->yy_buf_size / 8; + else + b->yy_buf_size *= 2; + + b->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + yy_flex_realloc( (void *) b->yy_ch_buf, + b->yy_buf_size + 2 ); + } + else + /* Can't grow it, we don't own it. */ + b->yy_ch_buf = 0; + + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( + "fatal error - scanner input buffer overflow" ); + + yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; + + num_to_read = yy_current_buffer->yy_buf_size - + number_to_move - 1; +#endif + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]), + yy_n_chars, num_to_read ); + + yy_current_buffer->yy_n_chars = yy_n_chars; + } + + if ( yy_n_chars == 0 ) + { + if ( number_to_move == YY_MORE_ADJ ) + { + ret_val = EOB_ACT_END_OF_FILE; + yyrestart( yyin ); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + yy_current_buffer->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + yy_n_chars += number_to_move; + yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; + yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; + + yytext_ptr = &yy_current_buffer->yy_ch_buf[0]; + + return ret_val; + } + + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + +static yy_state_type yy_get_previous_state() + { + register yy_state_type yy_current_state; + register char *yy_cp; + + yy_current_state = yy_start; + + for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) + { + register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + yy_last_accepting_state = yy_current_state; + yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 32 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + } + + return yy_current_state; + } + + +/* yy_try_NUL_trans - try to make a transition on the NUL character + * + * synopsis + * next_state = yy_try_NUL_trans( current_state ); + */ + +#ifdef YY_USE_PROTOS +static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state ) +#else +static yy_state_type yy_try_NUL_trans( yy_current_state ) +yy_state_type yy_current_state; +#endif + { + register int yy_is_jam; + register char *yy_cp = yy_c_buf_p; + + register YY_CHAR yy_c = 1; + if ( yy_accept[yy_current_state] ) + { + yy_last_accepting_state = yy_current_state; + yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 32 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + yy_is_jam = (yy_current_state == 31); + + return yy_is_jam ? 0 : yy_current_state; + } + + +#ifndef YY_NO_UNPUT +#ifdef YY_USE_PROTOS +static void yyunput( int c, register char *yy_bp ) +#else +static void yyunput( c, yy_bp ) +int c; +register char *yy_bp; +#endif + { + register char *yy_cp = yy_c_buf_p; + + /* undo effects of setting up yytext */ + *yy_cp = yy_hold_char; + + if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) + { /* need to shift things up to make room */ + /* +2 for EOB chars. */ + register int number_to_move = yy_n_chars + 2; + register char *dest = &yy_current_buffer->yy_ch_buf[ + yy_current_buffer->yy_buf_size + 2]; + register char *source = + &yy_current_buffer->yy_ch_buf[number_to_move]; + + while ( source > yy_current_buffer->yy_ch_buf ) + *--dest = *--source; + + yy_cp += (int) (dest - source); + yy_bp += (int) (dest - source); + yy_current_buffer->yy_n_chars = + yy_n_chars = yy_current_buffer->yy_buf_size; + + if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) + YY_FATAL_ERROR( "flex scanner push-back overflow" ); + } + + *--yy_cp = (char) c; + + + yytext_ptr = yy_bp; + yy_hold_char = *yy_cp; + yy_c_buf_p = yy_cp; + } +#endif /* ifndef YY_NO_UNPUT */ + + +#ifdef __cplusplus +static int yyinput() +#else +static int input() +#endif + { + int c; + + *yy_c_buf_p = yy_hold_char; + + if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) + { + /* yy_c_buf_p now points to the character we want to return. + * If this occurs *before* the EOB characters, then it's a + * valid NUL; if not, then we've hit the end of the buffer. + */ + if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] ) + /* This was really a NUL. */ + *yy_c_buf_p = '\0'; + + else + { /* need more input */ + int offset = yy_c_buf_p - yytext_ptr; + ++yy_c_buf_p; + + switch ( yy_get_next_buffer() ) + { + case EOB_ACT_LAST_MATCH: + /* This happens because yy_g_n_b() + * sees that we've accumulated a + * token and flags that we need to + * try matching the token before + * proceeding. But for input(), + * there's no matching to consider. + * So convert the EOB_ACT_LAST_MATCH + * to EOB_ACT_END_OF_FILE. + */ + + /* Reset buffer status. */ + yyrestart( yyin ); + + /* fall through */ + + case EOB_ACT_END_OF_FILE: + { + if ( yywrap() ) + return EOF; + + if ( ! yy_did_buffer_switch_on_eof ) + YY_NEW_FILE; +#ifdef __cplusplus + return yyinput(); +#else + return input(); +#endif + } + + case EOB_ACT_CONTINUE_SCAN: + yy_c_buf_p = yytext_ptr + offset; + break; + } + } + } + + c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */ + *yy_c_buf_p = '\0'; /* preserve yytext */ + yy_hold_char = *++yy_c_buf_p; + + + return c; + } + + +#ifdef YY_USE_PROTOS +void yyrestart( FILE *input_file ) +#else +void yyrestart( input_file ) +FILE *input_file; +#endif + { + if ( ! yy_current_buffer ) + yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); + + yy_init_buffer( yy_current_buffer, input_file ); + yy_load_buffer_state(); + } + + +#ifdef YY_USE_PROTOS +void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) +#else +void yy_switch_to_buffer( new_buffer ) +YY_BUFFER_STATE new_buffer; +#endif + { + if ( yy_current_buffer == new_buffer ) + return; + + if ( yy_current_buffer ) + { + /* Flush out information for old buffer. */ + *yy_c_buf_p = yy_hold_char; + yy_current_buffer->yy_buf_pos = yy_c_buf_p; + yy_current_buffer->yy_n_chars = yy_n_chars; + } + + yy_current_buffer = new_buffer; + yy_load_buffer_state(); + + /* We don't actually know whether we did this switch during + * EOF (yywrap()) processing, but the only time this flag + * is looked at is after yywrap() is called, so it's safe + * to go ahead and always set it. + */ + yy_did_buffer_switch_on_eof = 1; + } + + +#ifdef YY_USE_PROTOS +void yy_load_buffer_state( void ) +#else +void yy_load_buffer_state() +#endif + { + yy_n_chars = yy_current_buffer->yy_n_chars; + yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; + yyin = yy_current_buffer->yy_input_file; + yy_hold_char = *yy_c_buf_p; + } + + +#ifdef YY_USE_PROTOS +YY_BUFFER_STATE yy_create_buffer( FILE *file, int size ) +#else +YY_BUFFER_STATE yy_create_buffer( file, size ) +FILE *file; +int size; +#endif + { + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_buf_size = size; + + /* yy_ch_buf has to be 2 characters longer than the size given because + * we need to put in 2 end-of-buffer characters. + */ + b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + yy_init_buffer( b, file ); + + return b; + } + + +#ifdef YY_USE_PROTOS +void yy_delete_buffer( YY_BUFFER_STATE b ) +#else +void yy_delete_buffer( b ) +YY_BUFFER_STATE b; +#endif + { + if ( ! b ) + return; + + if ( b == yy_current_buffer ) + yy_current_buffer = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + yy_flex_free( (void *) b->yy_ch_buf ); + + yy_flex_free( (void *) b ); + } + + +#ifndef YY_ALWAYS_INTERACTIVE +#ifndef YY_NEVER_INTERACTIVE +extern int isatty YY_PROTO(( int )); +#endif +#endif + +#ifdef YY_USE_PROTOS +void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) +#else +void yy_init_buffer( b, file ) +YY_BUFFER_STATE b; +FILE *file; +#endif + + + { + yy_flush_buffer( b ); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + +#if YY_ALWAYS_INTERACTIVE + b->yy_is_interactive = 1; +#else +#if YY_NEVER_INTERACTIVE + b->yy_is_interactive = 0; +#else + b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; +#endif +#endif + } + + +#ifdef YY_USE_PROTOS +void yy_flush_buffer( YY_BUFFER_STATE b ) +#else +void yy_flush_buffer( b ) +YY_BUFFER_STATE b; +#endif + + { + if ( ! b ) + return; + + b->yy_n_chars = 0; + + /* We always need two end-of-buffer characters. The first causes + * a transition to the end-of-buffer state. The second causes + * a jam in that state. + */ + b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; + b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; + + b->yy_buf_pos = &b->yy_ch_buf[0]; + + b->yy_at_bol = 1; + b->yy_buffer_status = YY_BUFFER_NEW; + + if ( b == yy_current_buffer ) + yy_load_buffer_state(); + } + + +#ifndef YY_NO_SCAN_BUFFER +#ifdef YY_USE_PROTOS +YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size ) +#else +YY_BUFFER_STATE yy_scan_buffer( base, size ) +char *base; +yy_size_t size; +#endif + { + YY_BUFFER_STATE b; + + if ( size < 2 || + base[size-2] != YY_END_OF_BUFFER_CHAR || + base[size-1] != YY_END_OF_BUFFER_CHAR ) + /* They forgot to leave room for the EOB's. */ + return 0; + + b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); + + b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ + b->yy_buf_pos = b->yy_ch_buf = base; + b->yy_is_our_buffer = 0; + b->yy_input_file = 0; + b->yy_n_chars = b->yy_buf_size; + b->yy_is_interactive = 0; + b->yy_at_bol = 1; + b->yy_fill_buffer = 0; + b->yy_buffer_status = YY_BUFFER_NEW; + + yy_switch_to_buffer( b ); + + return b; + } +#endif + + +#ifndef YY_NO_SCAN_STRING +#ifdef YY_USE_PROTOS +YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str ) +#else +YY_BUFFER_STATE yy_scan_string( yy_str ) +yyconst char *yy_str; +#endif + { + int len; + for ( len = 0; yy_str[len]; ++len ) + ; + + return yy_scan_bytes( yy_str, len ); + } +#endif + + +#ifndef YY_NO_SCAN_BYTES +#ifdef YY_USE_PROTOS +YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len ) +#else +YY_BUFFER_STATE yy_scan_bytes( bytes, len ) +yyconst char *bytes; +int len; +#endif + { + YY_BUFFER_STATE b; + char *buf; + yy_size_t n; + int i; + + /* Get memory for full buffer, including space for trailing EOB's. */ + n = len + 2; + buf = (char *) yy_flex_alloc( n ); + if ( ! buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); + + for ( i = 0; i < len; ++i ) + buf[i] = bytes[i]; + + buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR; + + b = yy_scan_buffer( buf, n ); + if ( ! b ) + YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); + + /* It's okay to grow etc. this buffer, and we should throw it + * away when we're done. + */ + b->yy_is_our_buffer = 1; + + return b; + } +#endif + + +#ifndef YY_NO_PUSH_STATE +#ifdef YY_USE_PROTOS +static void yy_push_state( int new_state ) +#else +static void yy_push_state( new_state ) +int new_state; +#endif + { + if ( yy_start_stack_ptr >= yy_start_stack_depth ) + { + yy_size_t new_size; + + yy_start_stack_depth += YY_START_STACK_INCR; + new_size = yy_start_stack_depth * sizeof( int ); + + if ( ! yy_start_stack ) + yy_start_stack = (int *) yy_flex_alloc( new_size ); + + else + yy_start_stack = (int *) yy_flex_realloc( + (void *) yy_start_stack, new_size ); + + if ( ! yy_start_stack ) + YY_FATAL_ERROR( + "out of memory expanding start-condition stack" ); + } + + yy_start_stack[yy_start_stack_ptr++] = YY_START; + + BEGIN(new_state); + } +#endif + + +#ifndef YY_NO_POP_STATE +static void yy_pop_state() + { + if ( --yy_start_stack_ptr < 0 ) + YY_FATAL_ERROR( "start-condition stack underflow" ); + + BEGIN(yy_start_stack[yy_start_stack_ptr]); + } +#endif + + +#ifndef YY_NO_TOP_STATE +static int yy_top_state() + { + return yy_start_stack[yy_start_stack_ptr - 1]; + } +#endif + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +#ifdef YY_USE_PROTOS +static void yy_fatal_error( yyconst char msg[] ) +#else +static void yy_fatal_error( msg ) +char msg[]; +#endif + { + (void) fprintf( stderr, "%s\n", msg ); + exit( YY_EXIT_FAILURE ); + } + + + +/* Redefine yyless() so it works in section 3 code. */ + +#undef yyless +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + yytext[yyleng] = yy_hold_char; \ + yy_c_buf_p = yytext + n; \ + yy_hold_char = *yy_c_buf_p; \ + *yy_c_buf_p = '\0'; \ + yyleng = n; \ + } \ + while ( 0 ) + + +/* Internal utility routines. */ + +#ifndef yytext_ptr +#ifdef YY_USE_PROTOS +static void yy_flex_strncpy( char *s1, yyconst char *s2, int n ) +#else +static void yy_flex_strncpy( s1, s2, n ) +char *s1; +yyconst char *s2; +int n; +#endif + { + register int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; + } +#endif + +#ifdef YY_NEED_STRLEN +#ifdef YY_USE_PROTOS +static int yy_flex_strlen( yyconst char *s ) +#else +static int yy_flex_strlen( s ) +yyconst char *s; +#endif + { + register int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; + } +#endif + + +#ifdef YY_USE_PROTOS +static void *yy_flex_alloc( yy_size_t size ) +#else +static void *yy_flex_alloc( size ) +yy_size_t size; +#endif + { + return (void *) malloc( size ); + } + +#ifdef YY_USE_PROTOS +static void *yy_flex_realloc( void *ptr, yy_size_t size ) +#else +static void *yy_flex_realloc( ptr, size ) +void *ptr; +yy_size_t size; +#endif + { + /* The cast to (char *) in the following accommodates both + * implementations that use char* generic pointers, and those + * that use void* generic pointers. It works with the latter + * because both ANSI C and C++ allow castless assignment from + * any pointer type to void*, and deal with argument conversions + * as though doing an assignment. + */ + return (void *) realloc( (char *) ptr, size ); + } + +#ifdef YY_USE_PROTOS +static void yy_flex_free( void *ptr ) +#else +static void yy_flex_free( ptr ) +void *ptr; +#endif + { + free( ptr ); + } + +#if YY_MAIN +int main() + { + yylex(); + return 0; + } +#endif +#line 49 "address_scan.l" + +/* Internal routines. */ + +int +yywrap(void) +{ + return 1; +} diff --git a/librfc822/address_scan.h b/librfc822/address_scan.h new file mode 100644 index 0000000..2efeaae --- /dev/null +++ b/librfc822/address_scan.h @@ -0,0 +1,8 @@ +#ifndef YYSTYPE +#define YYSTYPE int +#endif +#define TOK_ATOM 257 +#define TOK_ILLEGAL 258 + + +extern YYSTYPE rfc822_lval; diff --git a/librfc822/address_scan.l b/librfc822/address_scan.l new file mode 100644 index 0000000..2970ef2 --- /dev/null +++ b/librfc822/address_scan.l @@ -0,0 +1,56 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ + +%{ +#ifdef DEBUG_DMALLOC +# include +#endif + +#include "rfc822.h" +#include "address_scan.h" +#define yylval rfc822_lval + +extern int yylval; + +char * rfc822_address_buffer; +int rfc822_address_buffer_pos; + +#define YY_INPUT(buf,result,max_size) { \ + buf[0] = rfc822_address_buffer[rfc822_address_buffer_pos++]; \ + result = ((buf[0] != '\0') ? 1 : YY_NULL); \ +} +%} +%x quoted escaped escaped2 +%% +([^@\.\(\) \t<>\":,\\]*\\)/(.[@\.:]) { BEGIN(escaped2); yymore(); } +([^@\.\(\) \t<>\":,\\]*\\)/(.) { BEGIN(escaped2); yymore(); } +([^@\.\(\) \t<>\":,\\]*\\)/(.[^@\.:]) { BEGIN(escaped); yymore(); } +([^@\.\(\) \t<>\":,\\]*\\) { return TOK_ILLEGAL; } +[^@\.\(\) \t<>\":,\\]+ { return TOK_ATOM; } + +[ \t]+ /* eat up whitespace */ +[@\.:] { yylval = yytext[0]; return yylval; } +[<>\(\),:] { return TOK_ILLEGAL; } + +. { BEGIN(INITIAL); yymore(); } +. { BEGIN(INITIAL); return TOK_ATOM; } + +\" { BEGIN(quoted); yymore(); } +[^\"\\]+ { yymore(); } +\\\" { yymore(); } +\" { BEGIN(INITIAL); return TOK_ATOM; } +<> { BEGIN(INITIAL); return TOK_ILLEGAL; } +%% +/* Internal routines. */ + +int +yywrap(void) +{ + return 1; +} diff --git a/librfc822/address_sep.c b/librfc822/address_sep.c new file mode 100644 index 0000000..0eebf54 --- /dev/null +++ b/librfc822/address_sep.c @@ -0,0 +1,152 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ + +#include +#include +#include +#include +#ifdef DEBUG_DMALLOC +# include +#endif + +#include "rfc822.h" + +static char * +read_until_next_quote(char * p) +{ + while (*p) { + if (*p == '"') { + p++; + break; + } + if (*p == '\\' && p[1] != '\0') { + p += 2; + continue; + } + p++; + } + return p; +} + +static char * +read_until_close_bracket(char * p) +{ + while (*p) { + if (*p == ')') { + p++; + break; + } + if (*p == '(') { + p = read_until_close_bracket(p+1); + continue; + } + else if (*p == '\\' && p[1] != '\0') { + p += 2; + continue; + } + else if (*p == '"') { + p = read_until_next_quote(p+1); + continue; + } + p++; + } + return p; +} + +static int +is_source_routing(char * p) +{ + while (*p) { + if (*p == '(') + p = read_until_close_bracket(p+1); + + else if (*p == ' ' || *p == '\t') + p++; + + else if (*p == '@' || *p == '<') + return 1; + + else + return 0; + } + return 0; +} + +/* Split an RFC822 address line. + + This routine breaks an address line, as specified by RFC822, up + into separate addresses. The used delimiter is the comma (","). + + The usage of the routine is very similar to strsep(3). More text to + come. + + AUTHOR: Peter Simons + + */ + +char * +rfc822_address_sep(struct rfc822_address_sep_state * state) +{ + char * p, + * old; + int allow_groups; + + /* Sanity checks. */ + + assert(state != NULL); + if (!state) { + errno = EINVAL; + return NULL; + } + + if (*(state->address_line) == '\0') + return NULL; + + old = p = state->address_line; + allow_groups = !is_source_routing(p); + + while(*p) { + if (*p == ',') { + *p = '\0'; + state->address_line = p+1; + return old; + } + else if (*p == ':' && allow_groups) { + old = p+1; + state->group_nest++; + allow_groups = !is_source_routing(p+1); + } + else if (*p == ';') { + + /* If we are inside an address group, the ';' character is + interpreted like a comma. */ + + if (state->group_nest > 0) { + state->group_nest--; + *p = ','; + continue; + } + else + /* do nothing */; + } + else if (*p == '(') { + p = read_until_close_bracket(p+1); + continue; + } + else if (*p == '\\' && p[1] != '\0') + p++; + else if (*p == '"') { + p = read_until_next_quote(p+1); + continue; + } + p++; + } + state->address_line = p; + return old; +} diff --git a/librfc822/decomment.c b/librfc822/decomment.c new file mode 100644 index 0000000..58382a8 --- /dev/null +++ b/librfc822/decomment.c @@ -0,0 +1,217 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ + +#include +#include +#include +#include +#ifdef DEBUG_DMALLOC +# include +#endif + +#include "rfc822.h" + +static const char * +read_until_next_quote(const char * p) +{ + while (*p) { + if (*p == '"') { + break; + } + if (*p == '\\' && p[1] != '\0') { + p += 2; + continue; + } + p++; + } + return p; +} + +static const char * +read_until_close_bracket(const char * p) +{ + while (*p) { + if (*p == ')') { + break; + } + if (*p == '(') { + p = read_until_close_bracket(p+1); + if (*p == '\0') + break; + else { + p++; + continue; + } + } + else if (*p == '\\' && p[1] != '\0') { + p += 2; + continue; + } + else if (*p == '"') { + p = read_until_next_quote(p+1); + if (*p == '\0') + break; + else { + p++; + continue; + } + } + p++; + } + return p; +} + +/* remove all comments from an rfc822 address + + This routine takes as argument an address string conforming to the + RFC822 syntax and removes all comments from it, returning the + result in the pointer specified as second argument. + + This is very useful if you want to parse the address with a context + free grammer parser, like yacc, because recognizing the various + forms of commenting with a BNF grammar is very complicated. + + RETURNS: The routine returns an integer describing whether the + decommenting process succeeded or not. In case of an error, the + return code described the reason for failure. + + RFC822_OK: Success. + + RFC822_FATAL_ERROR: A fatal system error occured, like malloc() + failed. The global errno variable will be set accordingly. + + RFC822_UNCLOSED_COMMENT: A "(comment)"-like expression was not + closed properly. + + RFC822_UNMATCHED_CLOSE_BRACKET: A close bracket (")") was + encountered outside the comment context. + + RFC822_UNCLOSED_QUOTE: A quoted `"string"'-like expression was not + closed properly. + + RFC822_UNCLOSED_ANGEL_BRACKET: An "
"-like expression was + not closed properly. + + RFC822_NESTED_ANGEL_BRACKET: An open angel bracket ("<") was + encountered inside the "
" context. + + RFC822_UNMATCHED_CLOSE_ANGEL_BRACKET: A close angel bracket (">") was + encountered outside the "
" context. + + RFC822_SYNTAX_ERROR: The address does not follow the rfc822 syntax. + + NOTE: The returned by rfc822_decomment() has been allocated with + malloc(3) and should be freed when not needed anymore. + + AUTHOR: Peter Simons + + */ + +int +rfc822_decomment(const char * source /* String containing a formatted rfc822 address. */, + char ** destination /* Location where to store the parsed string. */) +{ + char * buffer, + * address_start, + * p; + const char * s; + int in_quote, + angel_bracket_count; + + + /* Sanity checks. */ + + assert(source != NULL); + if (!source || *source == '\0') { + errno = EINVAL; + return NULL; + } + + /* Allocate buffer. */ + + buffer = malloc(strlen(source)+1); + if (buffer == NULL) { + errno = ENOMEM; + return RFC822_FATAL_ERROR; + } + + /* Let's parse it. */ + + address_start = p = buffer; + s = source; + in_quote = 0; + angel_bracket_count = 0; + + while(*s) { + + if (*s == '"') { + in_quote = !in_quote; + } + else if (!in_quote && *s == '(') { + s = read_until_close_bracket(s+1); + if (*s == '\0') { + free(buffer); + return RFC822_UNCLOSED_COMMENT; + } + s++; + *p++ = ' '; + continue; + } + else if (!in_quote && *s == ')') { + free(buffer); + return RFC822_UNMATCHED_CLOSE_BRACKET; + } + else if (!in_quote && *s == '<') { + if (angel_bracket_count > 0) { + free(buffer); + return RFC822_NESTED_ANGEL_BRACKET; + } + s++; + p = address_start; + *p = '\0'; + angel_bracket_count++; + continue; + } + else if (!in_quote && *s == '>') { + if (angel_bracket_count == 0) { + free(buffer); + return RFC822_UNMATCHED_CLOSE_ANGEL_BRACKET; + } + *p = '\0'; + angel_bracket_count--; + break; + } + else if (!in_quote && *s == '\\') { + if (s[1] != '\0') { + *p++ = *s++; + } + else { + free(buffer); + return RFC822_SYNTAX_ERROR; + } + } + + + *p++ = *s++; + } + *p = '\0'; + if (in_quote) { + free(buffer); + return RFC822_UNCLOSED_QUOTE; + } + + if (angel_bracket_count > 0) { + free(buffer); + return RFC822_UNCLOSED_ANGEL_BRACKET; + } + + + *destination = buffer; + return RFC822_OK; +} diff --git a/librfc822/parse_address.c b/librfc822/parse_address.c new file mode 100644 index 0000000..dd4da3d --- /dev/null +++ b/librfc822/parse_address.c @@ -0,0 +1,127 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ + +#include +#include +#ifdef DEBUG_DMALLOC +# include +#endif + +#include "rfc822.h" + +/* parse an rfc822 address + + This routine is absolutely magnificent. It understands the full + variety of Internet addresses as specified by RFC822 and parses + them. "Parsing" means that it will check the address to be + syntactically corrent and then returns the two parts an address + consists of: localpart@hostpart. This may not sound like being a + big thing, but you're invited to write a parser yourself to get an + idea. :-) + + All kind of comments and delimeters are understood, due to + sophisticated memory pooling hopefully no memory is leaking and the + speed is absolutely untested. + + RETURNS: If the parsing process was successful, the local- and + hostpart of the address will be stored in the location specified by + the parameters. It will also store the parsed, canonic address + (without any blanks, comments, etc...) in the provided location. If + the address is syntactically incorrect, or if parsing failed due to + an error, NULL will be stored in all these locations. The hostpart + may also be NULL, if the address is a local address, e.g. + "username". + + If either the "address", "localpart" or "hostpart" parameters are + NULL, no result will be stored, what allows you to check an address + for syntax errors. + + If the "string" parameter is NULL, the routine will return with a + RFC822_FATAL_ERROR and set the global errno variable to EINVAL. + + RFC822_OK: Success. + + RFC822_FATAL_ERROR: A fatal system error occured, like malloc() + failed. The global errno variable will be set accordingly. + + RFC822_UNCLOSED_COMMENT: A "(comment)"-like expression was not + closed properly. + + RFC822_UNMATCHED_CLOSE_BRACKET: A close bracket (")") was + encountered outside the comment context. + + RFC822_UNCLOSED_QUOTE: A quoted `"string"'-like expression was not + closed properly. + + RFC822_UNCLOSED_ANGEL_BRACKET: An "
"-like expression was + not closed properly. + + RFC822_NESTED_ANGEL_BRACKET: An open angel bracket ("<") was + encountered inside the "
" context. + + RFC822_UNMATCHED_CLOSE_ANGEL_BRACKET: A close angel bracket (">") was + encountered outside the "
" context. + + RFC822_SYNTAX_ERROR: The address does not follow the rfc822 syntax. + + NOTE: All buffers returned by the routine are allocated by + malloc(3) and should be freed by the user when they're not needed + anymore. + + AUTHOR: Peter Simons + + */ + +int +rfc822_parse_address(const char * string /* String containing the address. */, + char ** address /* Where to store the canonic address. */, + char ** localpart /* Where to store the local part. */, + char ** hostpart /* Where to store the host part. */) +{ + int rc; + + assert(string != NULL); + if (!string) { + errno = EINVAL; + return RFC822_FATAL_ERROR; + } + + rc = rfc822_decomment(string, &rfc822_address_buffer); + if (rc != RFC822_OK) + return rc; + else + rfc822_address_buffer_pos = 0; + poolname = rfc822_address_buffer; + + no_memory_flag = 0; + result_address = NULL; + result_hostpart = NULL; + result_localpart = NULL; + + rc = yyparse(); + if (rc == RFC822_OK) { + if (address && (*address = result_address)) + mp_remove_block_from_pool(poolname, *address); + if (localpart && (*localpart = result_localpart)) + mp_remove_block_from_pool(poolname, *localpart); + if (hostpart && (*hostpart = result_hostpart)) + mp_remove_block_from_pool(poolname, *hostpart); + } + else if (no_memory_flag != 0) { + errno = ENOMEM; + rc = RFC822_FATAL_ERROR; + } + else + rc = RFC822_SYNTAX_ERROR; + + mp_free_memory_pool(poolname); + free(rfc822_address_buffer); + + return rc; +} diff --git a/librfc822/rfc822.h b/librfc822/rfc822.h new file mode 100644 index 0000000..39b5d4e --- /dev/null +++ b/librfc822/rfc822.h @@ -0,0 +1,35 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ + +#ifndef __LIB_RFC822_H__ +#define __LIB_RFC822_H__ 1 + +struct rfc822_address_sep_state { + char * address_line; + unsigned int group_nest; +}; + +enum { + RFC822_FATAL_ERROR = -1, + RFC822_OK, + RFC822_UNCLOSED_COMMENT, + RFC822_UNMATCHED_CLOSE_BRACKET, + RFC822_UNCLOSED_QUOTE, + RFC822_UNCLOSED_ANGEL_BRACKET, + RFC822_NESTED_ANGEL_BRACKET, + RFC822_UNMATCHED_CLOSE_ANGEL_BRACKET, + RFC822_SYNTAX_ERROR +}; + +int rfc822_decomment(const char *, char **); +int rfc822_parse_address(const char *, char **, char **, char **); +char * rfc822_address_sep(struct rfc822_address_sep_state *); + +#endif /* !__LIB_RFC822_H__ */ + diff --git a/librfc822/test.c b/librfc822/test.c new file mode 100644 index 0000000..5624365 --- /dev/null +++ b/librfc822/test.c @@ -0,0 +1,55 @@ +/* + * $Source$ + * $Revision$ + * $Date$ + * + * Copyright (C) 1997 by CyberSolutions GmbH. + * All rights reserved. + */ + +#include +#ifdef DEBUG_DMALLOC +# include +#endif + +#include "rfc822.h" +#define safe_free(x) if (x) free(x) + +int +main(int argc, char ** argv) +{ + struct rfc822_address_sep_state sep_state; + char buffer[4096]; + char * p, + * address, + * local, + * host; + int rc; + + while(gets(buffer)) { + + printf("Read line: '%s'\n", buffer); + sep_state.address_line = buffer; + sep_state.group_nest = 0; + while((p = rfc822_address_sep(&sep_state))) { + + if (*p == '\0') + continue; + else + printf("One part is: '%s'\n", p); + + rc = rfc822_parse_address(p, &address, &local, &host); + if (rc == RFC822_OK) { + printf("Address: '%s'\nLocal: '%s'\nHost: '%s'\n", address, local, host); + safe_free(address); + safe_free(local); + safe_free(host); + } + else + printf("Syntax error: %d\n", rc); + } + + printf("\n"); + } + return 0; +} diff --git a/librfc822/testaddresslines b/librfc822/testaddresslines new file mode 100644 index 0000000..244587a --- /dev/null +++ b/librfc822/testaddresslines @@ -0,0 +1,15 @@ +simons +simons@rhein.de +peter.simons@rhein.de + +simons (Peter Simons) +peter (peti) . simons +...... + +peter(simons)...(hallo)@rhein.de (,,,), cd@phoenix."rhein,,(,)".de + +@im.net:@gmd.de:simons@rhein.de + +group: @rhein.de:simons, group2: @im.net:@rhein.de:simons@petium, cd@phoenix; abcd; + +group: @rhein.("hallo")de:simons, group2: @im.net:@rhein.de:simons@petium , cd@phoenix; abcd;