OSSP CVS Repository

ossp - Check-in [343]
Not logged in
[Honeypot]  [Browse]  [Home]  [Login]  [Reports
[Search]  [Ticket]  [Timeline
  [Patchset]  [Tagging/Branching

Check-in Number: 343
Date: 2001-Jan-20 14:42:01 (local)
2001-Jan-20 13:42:01 (UTC)
User:simons
Branch:
Comment: Underscores in file names suck, because you need an extra key-press to type them compared to the hyphen. For this reason (and for consistency) I corrected this horrible, horrible mistake of the past and renamed those files.
Tickets:
Inspections:
Files:
ossp-pkg/petidomo/Makefile.in      1.39 -> 1.40     14 inserted, 14 deleted
ossp-pkg/petidomo/acl-scan.c      added-> 1.1
ossp-pkg/petidomo/acl-scan.l      added-> 1.1
ossp-pkg/petidomo/acl.y      1.10 -> 1.11     2 inserted, 2 deleted
ossp-pkg/petidomo/acl_scan.l      1.4->removed
ossp-pkg/petidomo/generate-cookie.c      added-> 1.1
ossp-pkg/petidomo/generate_cookie.c      1.3->removed
ossp-pkg/petidomo/petidomo.h      1.17 -> 1.18     5 inserted, 6 deleted
ossp-pkg/petidomo/queue-command.c      added-> 1.1
ossp-pkg/petidomo/queue-posting.c      added-> 1.1
ossp-pkg/petidomo/queue_command.c      1.6->removed
ossp-pkg/petidomo/queue_posting.c      1.6->removed

ossp-pkg/petidomo/Makefile.in 1.39 -> 1.40

--- Makefile.in  2001/01/20 13:34:57     1.39
+++ Makefile.in  2001/01/20 13:42:01     1.40
@@ -29,11 +29,11 @@
                   YACC="$(YACC)" CFLAGS="$(CFLAGS)"                        \
                   CPPFLAGS="$(CPPFLAGS)" LDFLAGS="$(LDFLAGS)"
 
-OBJS            = acl.o archive.o authen.o help.o io.o generate_cookie.o   \
+OBJS            = acl.o archive.o authen.o help.o io.o generate-cookie.o   \
                   filter.o handleacl.o hermes.o index.o config-files.o     \
                   listserv.o mailer.o members.o parsearray.o password.o    \
                   rfcparse.o subscribe.o tool.o unsubscribe.o main.o       \
-                  queue_command.o queue_posting.o approve.o address-db.o   \
+                  queue-command.o queue-posting.o approve.o address-db.o   \
                   version.o
 LIBS            = librfc822/librfc822.a libmpools/libmpools.a              \
                   liblists/liblists.a libargv/libargv.a                    \
@@ -58,16 +58,16 @@
                 /tmp/petidomo.pod >petidomo.1; \
         rm -f /tmp/petidomo.pod
 
-acl.c acl_scan.h:       acl.y
+acl.c acl-scan.h:       acl.y
         $(YACC) -d -p acl acl.y
         mv y.tab.c acl.c
-        mv y.tab.h acl_scan.h
+        mv y.tab.h acl-scan.h
 
-acl_scan.c:             acl_scan.l acl_scan.h
-        $(LEX) -i -Pacl acl_scan.l
-        mv lex.acl.c acl_scan.c
+acl-scan.c:             acl-scan.l acl-scan.h
+        $(LEX) -i -Pacl acl-scan.l
+        mv lex.acl.c acl-scan.c
 
-acl.c:                  acl_scan.c
+acl.c:                  acl-scan.c
 
 $(LIBS):
         @subdir=`echo $@ | sed -e 's@/.*@@'`; \
@@ -114,7 +114,7 @@
         rm -f petidomo
         rm -f petidomo.1
         rm -f $(OBJS)
-        rm -f acl_scan.c acl_scan.h acl.c
+        rm -f acl-scan.c acl-scan.h acl.c
 
 distclean::     clean
         rm -f config.log config.cache config.status Makefile
@@ -135,8 +135,8 @@
 
 # Dependencies
 
-acl.o: libtext/text.h petidomo.h acl_scan.c acl_scan.h
-acl_scan.o: acl_scan.h
+acl.o: libtext/text.h petidomo.h acl-scan.c acl-scan.h
+acl-scan.o: acl-scan.h
 address-db.o: libtext/text.h petidomo.h
 approve.o: petidomo.h
 archive.o: libtext/text.h petidomo.h
@@ -144,7 +144,7 @@
 config-files.o: libtext/text.h liblists/lists.h libconfigfile/configfile.h
 config-files.o: petidomo.h
 filter.o: petidomo.h
-generate_cookie.o: petidomo.h
+generate-cookie.o: petidomo.h
 handleacl.o: petidomo.h
 help.o: libtext/text.h petidomo.h
 hermes.o: libtext/text.h petidomo.h
@@ -156,8 +156,8 @@
 members.o: libtext/text.h petidomo.h
 parsearray.o: petidomo.h
 password.o: petidomo.h
-queue_command.o: libtext/text.h petidomo.h
-queue_posting.o: libtext/text.h petidomo.h
+queue-command.o: libtext/text.h petidomo.h
+queue-posting.o: libtext/text.h petidomo.h
 rfcparse.o: librfc822/rfc822.h libtext/text.h petidomo.h
 subscribe.o: libtext/text.h petidomo.h
 tool.o: libtext/text.h petidomo.h


ossp-pkg/petidomo/acl-scan.c -> 1.1

*** /dev/null    Sat Nov 23 01:03:56 2024
--- -    Sat Nov 23 01:03:57 2024
***************
*** 0 ****
--- 1,1740 ----
+ #define yy_create_buffer acl_create_buffer
+ #define yy_delete_buffer acl_delete_buffer
+ #define yy_scan_buffer acl_scan_buffer
+ #define yy_scan_string acl_scan_string
+ #define yy_scan_bytes acl_scan_bytes
+ #define yy_flex_debug acl_flex_debug
+ #define yy_init_buffer acl_init_buffer
+ #define yy_flush_buffer acl_flush_buffer
+ #define yy_load_buffer_state acl_load_buffer_state
+ #define yy_switch_to_buffer acl_switch_to_buffer
+ #define yyin aclin
+ #define yyleng aclleng
+ #define yylex acllex
+ #define yyout aclout
+ #define yyrestart aclrestart
+ #define yytext acltext
+ #define yywrap aclwrap
+ 
+ /* A lexical scanner generated by flex */
+ 
+ /* Scanner skeleton version:
+  * $Header: /v/ossp/cvs/ossp-pkg/petidomo/Attic/acl-scan.c,v 1.1 2001/01/20 13:42:01 simons Exp $
+  */
+ 
+ #define FLEX_SCANNER
+ #define YY_FLEX_MAJOR_VERSION 2
+ #define YY_FLEX_MINOR_VERSION 5
+ 
+ #include <stdio.h>
+ 
+ 
+ /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
+ #ifdef c_plusplus
+ #ifndef __cplusplus
+ #define __cplusplus
+ #endif
+ #endif
+ 
+ 
+ #ifdef __cplusplus
+ 
+ #include <stdlib.h>
+ #include <unistd.h>
+ 
+ /* 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 <io.h>
+ #include <stdlib.h>
+ #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; \
+        yyleng = (int) (yy_cp - yy_bp); \
+        yy_hold_char = *yy_cp; \
+        *yy_cp = '\0'; \
+        yy_c_buf_p = yy_cp;
+ 
+ #define YY_NUM_RULES 27
+ #define YY_END_OF_BUFFER 28
+ static yyconst short int yy_accept[110] =
+     {   0,
+         0,    0,   28,   26,    2,    3,   26,    5,   26,   26,
+        26,   26,   26,   26,   26,   26,   26,   26,   26,   26,
+        26,   26,    2,   26,    0,   17,    6,    0,    0,    0,
+         0,    0,    0,    0,    0,    0,    4,    0,    0,   13,
+         0,    0,    0,    0,    0,    0,    0,    1,   12,    0,
+         0,    0,    0,    0,    0,    0,    0,    0,   14,    0,
+         0,    0,    0,    0,    0,   11,   18,    0,    0,    0,
+         7,    0,    0,   19,    0,    0,    0,   15,    0,    0,
+         0,    0,    0,   16,    0,    0,    0,    0,    0,   25,
+         0,   10,    0,    0,   23,    0,   20,    0,   22,   16,
+ 
+         0,    0,    8,    9,   21,    0,    0,   24,    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,    5,    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,
+         6,    1,    1,    1,    7,    8,    9,   10,   11,   12,
+         1,   13,   14,   15,    1,   16,   17,   18,   19,   20,
+         1,   21,   22,   23,   24,   25,   26,    1,   27,    1,
+         1,    1,    1,    1,    1,    1,    7,    8,    9,   10,
+ 
+        11,   12,    1,   13,   14,   15,    1,   16,   17,   18,
+        19,   20,    1,   21,   22,   23,   24,   25,   26,    1,
+        27,    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[28] =
+     {   0,
+         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 short int yy_base[112] =
+     {   0,
+         0,   26,  119,  120,  120,  120,  114,  111,   12,   97,
+        94,   96,   15,  102,  100,  104,   91,   88,  101,   96,
+        82,   92,   33,  101,   99,  120,  120,   92,   81,   90,
+        80,   73,   81,   75,   76,   87,  120,   70,   69,  120,
+        69,   27,   82,   78,   38,   85,   84,  120,  120,   65,
+        58,   64,   72,   59,   55,   63,   69,   69,  120,   55,
+        62,   64,   59,   55,   53,  120,  120,   55,   59,   62,
+       120,   57,   54,  120,   45,   56,   53,  120,   38,   43,
+        40,   39,   38,   47,   46,   33,   46,   43,   33,  120,
+        42,  120,   29,   41,   23,   25,  120,   36,  120,  120,
+ 
+        23,   31,  120,  120,  120,   21,   28,  120,  120,   38,
+        32
+     } ;
+ 
+ static yyconst short int yy_def[112] =
+     {   0,
+       109,    1,  109,  109,  109,  109,  110,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  111,  110,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  111,  111,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+ 
+       109,  109,  109,  109,  109,  109,  109,  109,    0,  109,
+       109
+     } ;
+ 
+ static yyconst short int yy_nxt[148] =
+     {   0,
+         4,    5,    6,    7,    4,    8,    9,   10,    4,   11,
+        12,   13,   14,   15,    4,    4,   16,   17,   18,   19,
+        20,   21,   22,    4,    4,    4,    4,   23,   33,   28,
+        24,   29,   47,   34,   45,   35,   61,   46,   25,   45,
+       108,   62,   46,  107,  106,  105,  104,  103,  102,  101,
+       100,   99,   98,   97,   96,   95,   94,   93,   92,   91,
+        90,   89,   88,   87,   86,   85,   84,   83,   82,   81,
+        80,   79,   78,   77,   76,   75,   74,   73,   72,   71,
+        70,   69,   68,   67,   66,   65,   48,   48,   64,   63,
+        60,   59,   58,   57,   56,   55,   54,   53,   52,   51,
+ 
+        50,   49,   26,   48,   44,   43,   42,   41,   40,   39,
+        38,   37,   36,   32,   31,   30,   27,   26,  109,    3,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109
+     } ;
+ 
+ static yyconst short int yy_chk[148] =
+     {   0,
+         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,    2,   13,    9,
+         2,    9,  111,   13,   23,   13,   42,   23,  110,   45,
+       107,   42,   45,  106,  102,  101,   98,   96,   95,   94,
+        93,   91,   89,   88,   87,   86,   85,   84,   83,   82,
+        81,   80,   79,   77,   76,   75,   73,   72,   70,   69,
+        68,   65,   64,   63,   62,   61,   60,   58,   57,   56,
+        55,   54,   53,   52,   51,   50,   47,   46,   44,   43,
+        41,   39,   38,   36,   35,   34,   33,   32,   31,   30,
+ 
+        29,   28,   25,   24,   22,   21,   20,   19,   18,   17,
+        16,   15,   14,   12,   11,   10,    8,    7,    3,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109,  109,  109,  109,
+       109,  109,  109,  109,  109,  109,  109
+     } ;
+ 
+ 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
+ #define yymore() yymore_used_but_not_detected
+ #define YY_MORE_ADJ 0
+ #define YY_RESTORE_YY_MORE_OFFSET
+ char *yytext;
+ #line 1 "acl-scan.l"
+ #define INITIAL 0
+ /*
+    $Source: /v/ossp/cvs/ossp-pkg/petidomo/Attic/acl-scan.c,v $
+    $Revision: 1.1 $
+ 
+    Copyright (C) 2000 by CyberSolutions GmbH, Germany.
+ 
+    This file is part of Petidomo.
+ 
+    Petidomo 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.
+ 
+    Petidomo 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.
+ */
+ #line 21 "acl-scan.l"
+ #include <ctype.h>
+ #include "acl-scan.h"
+ #line 469 "lex.acl.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 <stdlib.h>
+ #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 \
+        if ( yyleng > 0 ) \
+                yy_current_buffer->yy_at_bol = \
+                                (yytext[yyleng - 1] == '\n'); \
+        YY_USER_ACTION
+ 
+ YY_DECL
+        {
+        register yy_state_type yy_current_state;
+        register char *yy_cp, *yy_bp;
+        register int yy_act;
+ 
+ #line 24 "acl-scan.l"
+ 
+ #line 625 "lex.acl.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_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_current_state += YY_AT_BOL();
+ 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 >= 110 )
+                                        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] != 120 );
+ 
+ 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 -= 1;
+ YY_DO_BEFORE_ACTION; /* set up yytext again */
+ YY_RULE_SETUP
+ #line 25 "acl-scan.l"
+ /* ignore comments */
+        YY_BREAK
+ case 2:
+ YY_RULE_SETUP
+ #line 26 "acl-scan.l"
+ /* ignore whitespace */
+        YY_BREAK
+ case 3:
+ YY_RULE_SETUP
+ #line 27 "acl-scan.l"
+ lineno++;
+        YY_BREAK
+ case 4:
+ YY_RULE_SETUP
+ #line 29 "acl-scan.l"
+ return TOK_IF;
+        YY_BREAK
+ case 5:
+ YY_RULE_SETUP
+ #line 30 "acl-scan.l"
+ return TOK_EQUAL;
+        YY_BREAK
+ case 6:
+ YY_RULE_SETUP
+ #line 31 "acl-scan.l"
+ return TOK_EQUAL;
+        YY_BREAK
+ case 7:
+ YY_RULE_SETUP
+ #line 32 "acl-scan.l"
+ return TOK_FROM;
+        YY_BREAK
+ case 8:
+ YY_RULE_SETUP
+ #line 33 "acl-scan.l"
+ return TOK_SUBJECT;
+        YY_BREAK
+ case 9:
+ YY_RULE_SETUP
+ #line 34 "acl-scan.l"
+ return TOK_ENVELOPE;
+        YY_BREAK
+ case 10:
+ YY_RULE_SETUP
+ #line 35 "acl-scan.l"
+ return TOK_HEADER;
+        YY_BREAK
+ case 11:
+ YY_RULE_SETUP
+ #line 36 "acl-scan.l"
+ return TOK_BODY;
+        YY_BREAK
+ case 12:
+ YY_RULE_SETUP
+ #line 37 "acl-scan.l"
+ return TOK_AND;
+        YY_BREAK
+ case 13:
+ YY_RULE_SETUP
+ #line 38 "acl-scan.l"
+ return TOK_OR;
+        YY_BREAK
+ case 14:
+ YY_RULE_SETUP
+ #line 39 "acl-scan.l"
+ return TOK_NOT;
+        YY_BREAK
+ case 15:
+ YY_RULE_SETUP
+ #line 40 "acl-scan.l"
+ return TOK_THEN;
+        YY_BREAK
+ case 16:
+ YY_RULE_SETUP
+ #line 41 "acl-scan.l"
+ return TOK_MATCH;
+        YY_BREAK
+ case 17:
+ YY_RULE_SETUP
+ #line 42 "acl-scan.l"
+ {
+                        yytext[yyleng-1] = '\0';
+                        yytext++;
+                        yyleng -= 2;
+                        return TOK_STRING;
+                }
+        YY_BREAK
+ case 18:
+ YY_RULE_SETUP
+ #line 48 "acl-scan.l"
+ return TOK_DROP;
+        YY_BREAK
+ case 19:
+ YY_RULE_SETUP
+ #line 49 "acl-scan.l"
+ return TOK_PASS;
+        YY_BREAK
+ case 20:
+ YY_RULE_SETUP
+ #line 50 "acl-scan.l"
+ return TOK_APPROVE;
+        YY_BREAK
+ case 21:
+ YY_RULE_SETUP
+ #line 51 "acl-scan.l"
+ return TOK_REDIRECT;
+        YY_BREAK
+ case 22:
+ YY_RULE_SETUP
+ #line 52 "acl-scan.l"
+ return TOK_FORWARD;
+        YY_BREAK
+ case 23:
+ YY_RULE_SETUP
+ #line 53 "acl-scan.l"
+ return TOK_REJECT;
+        YY_BREAK
+ case 24:
+ YY_RULE_SETUP
+ #line 54 "acl-scan.l"
+ return TOK_REJECTWITH;
+        YY_BREAK
+ case 25:
+ YY_RULE_SETUP
+ #line 55 "acl-scan.l"
+ return TOK_FILTER;
+        YY_BREAK
+ case 26:
+ YY_RULE_SETUP
+ #line 57 "acl-scan.l"
+ { yylval = yytext[0]; return yylval; } /* literal */
+        YY_BREAK
+ case 27:
+ YY_RULE_SETUP
+ #line 58 "acl-scan.l"
+ ECHO;
+        YY_BREAK
+ #line 852 "lex.acl.c"
+ case YY_STATE_EOF(INITIAL):
+        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;
+        yy_current_state += YY_AT_BOL();
+ 
+        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 >= 110 )
+                                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 >= 110 )
+                        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 == 109);
+ 
+        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;
+ 
+        yy_current_buffer->yy_at_bol = (c == '\n');
+ 
+        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 58 "acl-scan.l"
+ 


ossp-pkg/petidomo/acl-scan.l -> 1.1

*** /dev/null    Sat Nov 23 01:03:56 2024
--- -    Sat Nov 23 01:03:57 2024
***************
*** 0 ****
--- 1,58 ----
+ /*
+    $Source: /v/ossp/cvs/ossp-pkg/petidomo/acl-scan.l,v $
+    $Revision: 1.1 $
+ 
+    Copyright (C) 2000 by CyberSolutions GmbH, Germany.
+ 
+    This file is part of Petidomo.
+ 
+    Petidomo 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.
+ 
+    Petidomo 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.
+ */
+ 
+ %{
+ #include <ctype.h>
+ #include "acl-scan.h"
+ %}
+ %%
+ ^[ \t]*#.*$    /* ignore comments */
+ [ \t]          /* ignore whitespace */
+ \n             lineno++;
+ 
+ if             return TOK_IF;
+ =              return TOK_EQUAL;
+ ==             return TOK_EQUAL;
+ from           return TOK_FROM;
+ subject                return TOK_SUBJECT;
+ envelope       return TOK_ENVELOPE;
+ header         return TOK_HEADER;
+ body           return TOK_BODY;
+ and            return TOK_AND;
+ or             return TOK_OR;
+ not            return TOK_NOT;
+ then           return TOK_THEN;
+ match(es)?     return TOK_MATCH;
+ \"[^\"]*\"     {
+                        yytext[yyleng-1] = '\0';
+                        yytext++;
+                        yyleng -= 2;
+                        return TOK_STRING;
+                }
+ drop           return TOK_DROP;
+ pass           return TOK_PASS;
+ approve                return TOK_APPROVE;
+ redirect       return TOK_REDIRECT;
+ forward                return TOK_FORWARD;
+ reject         return TOK_REJECT;
+ rejectwith     return TOK_REJECTWITH;
+ filter         return TOK_FILTER;
+ 
+ .              { yylval = yytext[0]; return yylval; } /* literal */
+ %%


ossp-pkg/petidomo/acl.y 1.10 -> 1.11

--- acl.y        2001/01/19 16:08:51     1.10
+++ acl.y        2001/01/20 13:42:01     1.11
@@ -1,6 +1,6 @@
 /*
    $Source: /v/ossp/cvs/ossp-pkg/petidomo/acl.y,v $
-   $Revision: 1.10 $
+   $Revision: 1.11 $
 
    Copyright (C) 2000 by CyberSolutions GmbH, Germany.
 
@@ -39,7 +39,7 @@
 char * g_parameter = NULL;
 struct Mail * g_MailStruct;
 
-#include "acl_scan.c"
+#include "acl-scan.c"
 
 #define YYERROR_VERBOSE
 %}


ossp-pkg/petidomo/acl_scan.l 1.4 -> 1.5

--- acl_scan.l   2001/01/18 20:30:50     1.4
+++ acl_scan.l   2001/01/20 13:42:01     1.5
@@ -1,6 +1,6 @@
 /*
    $Source: /v/ossp/cvs/ossp-pkg/petidomo/Attic/acl_scan.l,v $
-   $Revision: 1.4 $
+   $Revision: 1.5 $
 
    Copyright (C) 2000 by CyberSolutions GmbH, Germany.
 


ossp-pkg/petidomo/generate-cookie.c -> 1.1

*** /dev/null    Sat Nov 23 01:03:56 2024
--- -    Sat Nov 23 01:03:57 2024
***************
*** 0 ****
--- 1,398 ----
+ /*
+    $Source: /v/ossp/cvs/ossp-pkg/petidomo/generate-cookie.c,v $
+    $Revision: 1.1 $
+ 
+    Copyright (C) 2001 by Peter Simons <simons@computer.org>.
+ 
+    This file is part of Petidomo.
+ 
+    Petidomo 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.
+ 
+    Petidomo 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.
+ */
+ 
+ #include "petidomo.h"
+ #include <string.h>
+ 
+ typedef unsigned char *  POINTER;
+ 
+ #if (SIZEOF_UNSIGNED_INT == 4)
+    typedef unsigned int UINT4;
+ #else
+ #  if (SIZEOF_UNSIGNED_LONG == 4)
+       typedef unsigned long UINT4;
+ #  else
+ #    if (SIZEOF_UNSIGNED_SHORT == 4)
+         typedef unsigned short UINT4;
+ #    else
+ #      error "Ooops, we don't have a 4 byte type in C on this machine?"
+ #    endif
+ #  endif
+ #endif
+ 
+ typedef struct MD5Context
+     {
+     UINT4           state[4];  /* state (ABCD) */
+     UINT4           count[2];  /* number of bits, modulo 2^64 (lsb first) */
+     unsigned char   buffer[64];        /* input buffer */
+     }
+ MD5_CTX;
+ 
+ static void MD5Init(MD5_CTX*);
+ static void MD5Update(MD5_CTX*, const unsigned char*, unsigned int);
+ static void MD5Final(unsigned char[16], MD5_CTX*);
+ static char* encode_digest_to_ascii(unsigned char digest[16]);
+ 
+ 
+ char* generate_cookie(const char* buffer)
+     {
+     MD5_CTX        context;
+     unsigned char  digest[16];
+ 
+     MD5Init(&context);
+     MD5Update(&context, (unsigned char *) buffer, strlen((char *) buffer));
+     MD5Final(digest, &context);
+     return encode_digest_to_ascii(digest);
+     }
+ 
+ 
+ 
+ static char* encode_digest_to_ascii(unsigned char digest[16])
+     {
+     int                  i;
+     static const char    hex[] = "0123456789abcdef";
+     char *               buffer;
+ 
+     buffer = xmalloc(33);
+     for (i = 0; i < 16; i++)
+        {
+        buffer[i+i] = hex[digest[i] >> 4];
+        buffer[i+i+1] = hex[digest[i] & 0x0f];
+        }
+ 
+     buffer[i+i] = '\0';
+     return buffer;
+     }
+ 
+ 
+ 
+ /*
+  * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
+  * rights reserved.
+  *
+  * License to copy and use this software is granted provided that it
+  * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
+  * Algorithm" in all material mentioning or referencing this software
+  * or this function.
+  *
+  * License is also granted to make and use derivative works provided
+  * that such works are identified as "derived from the RSA Data
+  * Security, Inc. MD5 Message-Digest Algorithm" in all material
+  * mentioning or referencing the derived work.
+  *
+  * RSA Data Security, Inc. makes no representations concerning either
+  * the merchantability of this software or the suitability of this
+  * software for any particular purpose. It is provided "as is"
+  * without express or implied warranty of any kind.
+  *
+  * These notices must be retained in any copies of any part of this
+  * documentation and/or software.
+  */
+ 
+ #define        ZEROIZE(d, l)           memset((d), 0, (l))
+ 
+ /*
+  * Constants for MD5Transform routine.
+  */
+ #define S11 7
+ #define S12 12
+ #define S13 17
+ #define S14 22
+ #define S21 5
+ #define S22 9
+ #define S23 14
+ #define S24 20
+ #define S31 4
+ #define S32 11
+ #define S33 16
+ #define S34 23
+ #define S41 6
+ #define S42 10
+ #define S43 15
+ #define S44 21
+ 
+ static void MD5Transform(UINT4 [4], const unsigned char [64]);
+ static void Encode(unsigned char *, UINT4 *, unsigned int);
+ static void Decode(UINT4 *, const unsigned char *, unsigned int);
+ 
+ /*
+  * Encodes input (UINT4) into output (unsigned char).  Assumes len is
+  * a multiple of 4.
+  */
+ static void
+ Encode (output, input, len)
+        unsigned char *output;
+        UINT4 *input;
+        unsigned int len;
+ {
+        unsigned int i, j;
+ 
+        for (i = 0, j = 0; j < len; i++, j += 4) {
+                output[j] = (unsigned char)(input[i] & 0xff);
+                output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
+                output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
+                output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
+        }
+ }
+ 
+ /*
+  * Decodes input (unsigned char) into output (UINT4).  Assumes len is
+  * a multiple of 4.
+  */
+ static void
+ Decode (output, input, len)
+        UINT4 *output;
+        const unsigned char *input;
+        unsigned int len;
+ {
+        unsigned int i, j;
+ 
+        for (i = 0, j = 0; j < len; i++, j += 4)
+                output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
+                    (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
+ }
+ 
+ static unsigned char PADDING[64] = {
+        0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
+ };
+ 
+ /*
+  * F, G, H and I are basic MD5 functions.
+  */
+ #define F(x, y, z)     (((x) & (y)) | ((~x) & (z)))
+ #define G(x, y, z)     (((x) & (z)) | ((y) & (~z)))
+ #define H(x, y, z)     ((x) ^ (y) ^ (z))
+ #define I(x, y, z)     ((y) ^ ((x) | (~z)))
+ 
+ /*
+  * ROTATE_LEFT rotates x left n bits.
+  */
+ #define ROTATE_LEFT(x, n)      (((x) << (n)) | ((x) >> (32-(n))))
+ 
+ /*
+  * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
+  * Rotation is separate from addition to prevent recomputation.
+  */
+ #define FF(a, b, c, d, x, s, ac) { \
+        (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
+        (a) = ROTATE_LEFT ((a), (s)); \
+        (a) += (b); \
+ }
+ 
+ #define GG(a, b, c, d, x, s, ac) { \
+        (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
+        (a) = ROTATE_LEFT ((a), (s)); \
+        (a) += (b); \
+ }
+ 
+ #define HH(a, b, c, d, x, s, ac) { \
+        (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
+        (a) = ROTATE_LEFT ((a), (s)); \
+        (a) += (b); \
+ }
+ 
+ #define II(a, b, c, d, x, s, ac) { \
+        (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
+        (a) = ROTATE_LEFT ((a), (s)); \
+        (a) += (b); \
+ }
+ 
+ /*
+  * MD5 initialization. Begins an MD5 operation, writing a new context.
+  */
+ static void
+ MD5Init(context)
+        MD5_CTX *context;               /* context */
+ {
+ 
+        context->count[0] = context->count[1] = 0;
+ 
+        /* Load magic initialization constants. */
+        context->state[0] = 0x67452301;
+        context->state[1] = 0xefcdab89;
+        context->state[2] = 0x98badcfe;
+        context->state[3] = 0x10325476;
+ }
+ 
+ /*
+  * MD5 block update operation.  Continues an MD5 message-digest
+  * operation, processing another message block, and updating the
+  * context.
+  */
+ static void
+ MD5Update(context, input, inputLen)
+        MD5_CTX *context;               /* context */
+        const unsigned char *input;     /* input block */
+        unsigned int inputLen;          /* length of input block */
+ {
+        unsigned int i, idx, partLen;
+ 
+        /* Compute number of bytes mod 64 */
+        idx = (unsigned int)((context->count[0] >> 3) & 0x3F);
+ 
+        /* Update number of bits */
+        if ((context->count[0] += ((UINT4)inputLen << 3))
+            < ((UINT4)inputLen << 3))
+                context->count[1]++;
+        context->count[1] += ((UINT4)inputLen >> 29);
+ 
+        partLen = 64 - idx;
+ 
+        /* Transform as many times as possible. */
+        if (inputLen >= partLen) {
+                memcpy((POINTER)&context->buffer[idx],
+                    (POINTER)input, partLen);
+                MD5Transform(context->state, context->buffer);
+ 
+                for (i = partLen; i + 63 < inputLen; i += 64)
+                        MD5Transform(context->state, &input[i]);
+ 
+                idx = 0;
+        } else
+                i = 0;
+ 
+        /* Buffer remaining input */
+        memcpy((POINTER)&context->buffer[idx], (POINTER)&input[i],
+            inputLen - i);
+ }
+ 
+ /*
+  * MD5 finalization.  Ends an MD5 message-digest operation, writing the
+  * message digest and zeroing the context.
+  */
+ static void
+ MD5Final(digest, context)
+        unsigned char digest[16];       /* message digest */
+        MD5_CTX *context;               /* context */
+ {
+        unsigned char bits[8];
+        unsigned int idx, padLen;
+ 
+        /* Save number of bits */
+        Encode(bits, context->count, 8);
+ 
+        /* Pad out to 56 mod 64. */
+        idx = (unsigned int)((context->count[0] >> 3) & 0x3f);
+        padLen = (idx < 56) ? (56 - idx) : (120 - idx);
+        MD5Update (context, PADDING, padLen);
+ 
+        /* Append length (before padding) */
+        MD5Update(context, bits, 8);
+ 
+        /* Store state in digest */
+        Encode(digest, context->state, 16);
+ 
+        /* Zeroize sensitive information. */
+        ZEROIZE((POINTER)context, sizeof(*context));
+ }
+ 
+ /*
+  * MD5 basic transformation. Transforms state based on block.
+  */
+ static void
+ MD5Transform(state, block)
+        UINT4 state[4];
+        const unsigned char block[64];
+ {
+        UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
+ 
+        Decode(x, block, 64);
+ 
+        /* Round 1 */
+        FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
+        FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
+        FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
+        FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
+        FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
+        FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
+        FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
+        FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
+        FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
+        FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
+        FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
+        FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
+        FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
+        FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
+        FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
+        FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
+ 
+        /* Round 2 */
+        GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
+        GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
+        GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
+        GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
+        GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
+        GG (d, a, b, c, x[10], S22,  0x2441453); /* 22 */
+        GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
+        GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
+        GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
+        GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
+        GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
+        GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
+        GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
+        GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
+        GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
+        GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
+ 
+        /* Round 3 */
+        HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
+        HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
+        HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
+        HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
+        HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
+        HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
+        HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
+        HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
+        HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
+        HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
+        HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
+        HH (b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */
+        HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
+        HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
+        HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
+        HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
+ 
+        /* Round 4 */
+        II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
+        II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
+        II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
+        II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
+        II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
+        II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
+        II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
+        II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
+        II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
+        II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
+        II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
+        II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
+        II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
+        II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
+        II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
+        II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
+ 
+        state[0] += a;
+        state[1] += b;
+        state[2] += c;
+        state[3] += d;
+ 
+        /* Zeroize sensitive information. */
+        ZEROIZE((POINTER)x, sizeof (x));
+ }


ossp-pkg/petidomo/generate_cookie.c 1.3 -> 1.4

--- generate_cookie.c    2001/01/19 08:31:14     1.3
+++ generate_cookie.c    2001/01/20 13:42:01     1.4
@@ -1,6 +1,6 @@
 /*
    $Source: /v/ossp/cvs/ossp-pkg/petidomo/Attic/generate_cookie.c,v $
-   $Revision: 1.3 $
+   $Revision: 1.4 $
 
    Copyright (C) 2001 by Peter Simons <simons@computer.org>.
 


ossp-pkg/petidomo/petidomo.h 1.17 -> 1.18

--- petidomo.h   2001/01/19 12:49:44     1.17
+++ petidomo.h   2001/01/20 13:42:01     1.18
@@ -1,6 +1,6 @@
 /*
    $Source: /v/ossp/cvs/ossp-pkg/petidomo/petidomo.h,v $
-   $Revision: 1.17 $
+   $Revision: 1.18 $
 
    Copyright (C) 2000 by CyberSolutions GmbH, Germany.
 
@@ -20,7 +20,6 @@
 #ifndef __PETIDOMO_H__
 #define __PETIDOMO_H__ 1
 
-
 /********** Useful defines and declarations **********/
 
 #ifndef __HAVE_DEFINED_BOOL__
@@ -240,19 +239,19 @@
     };
 extern struct Parse ParseArray[];
 
-/********** generate_cookie.c **********/
+/********** generate-cookie.c **********/
 
 char* generate_cookie(const char*);
 
-/********** queue_posting.c **********/
+/********** queue-posting.c **********/
 
 char* queue_posting(const struct Mail* mail, const char* listname);
 
-/********** queue_command.c **********/
+/********** queue-command.c **********/
 
 char* queue_command(const struct Mail* mail, const char* command);
 
-/********** address_db.c **********/
+/********** address-db.c **********/
 
 int is_address_on_list(const char* file, const char* address);
 int add_address(const char* file, const char* address);


ossp-pkg/petidomo/queue-command.c -> 1.1

*** /dev/null    Sat Nov 23 01:03:56 2024
--- -    Sat Nov 23 01:03:57 2024
***************
*** 0 ****
--- 1,60 ----
+ /*
+    $Source: /v/ossp/cvs/ossp-pkg/petidomo/queue-command.c,v $
+    $Revision: 1.1 $
+ 
+    Copyright (C) 2000 by Peter Simons <simons@computer.org>.
+ 
+    This file is part of Petidomo.
+ 
+    Petidomo 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.
+ 
+    Petidomo 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.
+ */
+ 
+ #include <string.h>
+ #include <errno.h>
+ #include <sys/types.h>
+ #include <sys/stat.h>
+ #include "libtext/text.h"
+ #include "petidomo.h"
+ 
+ char* queue_command(const struct Mail* mail, const char* command)
+     {
+     const struct PD_Config   * MasterConfig = getMasterConfig();
+     char*   buffer;
+     char*   cookie;
+     FILE*   fh;
+ 
+     cookie = generate_cookie(mail->Header);
+     buffer = text_easy_sprintf("%s/%s", MasterConfig->ack_queue_dir, cookie);
+     fh = fopen(buffer, "w");
+     if (fh == NULL)
+        {
+        syslog(LOG_ERR, "Opening ack spool file \"%s\" failed: %s", buffer, strerror(errno));
+        exit(1);
+        }
+     fprintf(fh, "#! /bin/sh\n");
+     fprintf(fh, "\n");
+     fprintf(fh, "%s --mode=listserv --approved <<[end-of-%s-marker]\n", who_am_i, cookie);
+     fprintf(fh, "Sender: %s\n", mail->Envelope);
+     fprintf(fh, "From: %s\n", mail->From);
+     if (mail->Reply_To)
+        fprintf(fh, "Reply-To: %s\n", mail->Reply_To);
+     if (mail->Message_Id)
+        fprintf(fh, "Message-Id: %s\n", mail->Message_Id);
+     if (mail->Approve)
+        fprintf(fh, "Approve: %s\n", mail->Approve);
+     fprintf(fh, "\n");
+     fprintf(fh, "%s\n", command);
+     fprintf(fh, "[end-of-%s-marker]\n", cookie);
+     fclose(fh);
+     chmod(buffer, 0755);
+     free(buffer);
+     return cookie;
+     }


ossp-pkg/petidomo/queue-posting.c -> 1.1

*** /dev/null    Sat Nov 23 01:03:56 2024
--- -    Sat Nov 23 01:03:57 2024
***************
*** 0 ****
--- 1,52 ----
+ /*
+    $Source: /v/ossp/cvs/ossp-pkg/petidomo/queue-posting.c,v $
+    $Revision: 1.1 $
+ 
+    Copyright (C) 2000 by Peter Simons <simons@computer.org>.
+ 
+    This file is part of Petidomo.
+ 
+    Petidomo 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.
+ 
+    Petidomo 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.
+ */
+ 
+ #include <string.h>
+ #include <errno.h>
+ #include <sys/types.h>
+ #include <sys/stat.h>
+ #include "libtext/text.h"
+ #include "petidomo.h"
+ 
+ char* queue_posting(const struct Mail* mail, const char* listname)
+     {
+     const struct PD_Config   * MasterConfig = getMasterConfig();
+     char*   buffer;
+     char*   cookie;
+     FILE*   fh;
+ 
+     cookie = generate_cookie(mail->Header);
+     buffer = text_easy_sprintf("%s/%s", MasterConfig->ack_queue_dir, cookie);
+     fh = fopen(buffer, "w");
+     if (fh == NULL)
+        {
+        syslog(LOG_ERR, "Opening ack spool file \"%s\" failed: %s", buffer, strerror(errno));
+        exit(1);
+        }
+     fprintf(fh, "#! /bin/sh\n");
+     fprintf(fh, "\n");
+     fprintf(fh, "%s --mode=deliver --listname=%s --approved <<[end-of-%s-marker]\n", who_am_i, listname, cookie);
+     fprintf(fh, "%s\n", mail->Header);
+     fprintf(fh, "%s", mail->Body);
+     fprintf(fh, "[end-of-%s-marker]\n", cookie);
+     fclose(fh);
+     chmod(buffer, 0755);
+     free(buffer);
+     return cookie;
+     }


ossp-pkg/petidomo/queue_command.c 1.6 -> 1.7

--- queue_command.c      2001/01/19 14:56:33     1.6
+++ queue_command.c      2001/01/20 13:42:02     1.7
@@ -1,6 +1,6 @@
 /*
    $Source: /v/ossp/cvs/ossp-pkg/petidomo/Attic/queue_command.c,v $
-   $Revision: 1.6 $
+   $Revision: 1.7 $
 
    Copyright (C) 2000 by Peter Simons <simons@computer.org>.
 


ossp-pkg/petidomo/queue_posting.c 1.6 -> 1.7

--- queue_posting.c      2001/01/19 14:56:33     1.6
+++ queue_posting.c      2001/01/20 13:42:02     1.7
@@ -1,6 +1,6 @@
 /*
    $Source: /v/ossp/cvs/ossp-pkg/petidomo/Attic/queue_posting.c,v $
-   $Revision: 1.6 $
+   $Revision: 1.7 $
 
    Copyright (C) 2000 by Peter Simons <simons@computer.org>.
 

CVSTrac 2.0.1