/*--------------------------------------------------------------------------*/ /* */ /* */ /* ------------ Bit-Bucket Software, Co. */ /* \ 10001101 / Writers and Distributors of */ /* \ 011110 / Freely Available Software. */ /* \ 1011 / */ /* ------ */ /* */ /* (C) Copyright 1987-96, Bit Bucket Software Co. */ /* */ /* */ /* */ /* Communications definitions for BinkleyTerm */ /* */ /* */ /* For complete details of the licensing restrictions, please refer */ /* to the License agreement, which is published in its entirety in */ /* the MAKEFILE and BT.C, and also contained in the file LICENSE.260. */ /* */ /* USE OF THIS FILE IS SUBJECT TO THE RESTRICTIONS CONTAINED IN THE */ /* BINKLEYTERM LICENSING AGREEMENT. IF YOU DO NOT FIND THE TEXT OF */ /* THIS AGREEMENT IN ANY OF THE AFOREMENTIONED FILES, OR IF YOU DO */ /* NOT HAVE THESE FILES, YOU SHOULD IMMEDIATELY CONTACT BIT BUCKET */ /* SOFTWARE CO. AT ONE OF THE ADDRESSES LISTED BELOW. IN NO EVENT */ /* SHOULD YOU PROCEED TO USE THIS FILE WITHOUT HAVING ACCEPTED THE */ /* TERMS OF THE BINKLEYTERM LICENSING AGREEMENT, OR SUCH OTHER */ /* AGREEMENT AS YOU ARE ABLE TO REACH WITH BIT BUCKET SOFTWARE, CO. */ /* */ /* */ /* You can contact Bit Bucket Software Co. at any one of the following */ /* addresses: */ /* */ /* Bit Bucket Software Co. FidoNet 1:104/501, 1:343/491 */ /* P.O. Box 460398 AlterNet 7:42/1491 */ /* Aurora, CO 80046 BBS-Net 86:2030/1 */ /* Internet f491.n343.z1.fidonet.org */ /* */ /* Please feel free to contact us at any time to share your comments about */ /* our software and/or licensing policies. */ /* */ /*--------------------------------------------------------------------------*/ #define BITS_7 0x02 #define BITS_8 0x03 #define STOP_1 0x00 #define STOP_2 0x04 #define ODD_PARITY 0x08 #define EVEN_PARITY 0x18 #define NO_PARITY 0x00 /* Bit definitions for the driver flags */ #define USE_XON 0x01 #define USE_CTS 0x02 #define USE_DSR 0x04 #define OTHER_XON 0x08 #define BRK 0x01 #define MDM 0x02 struct LINE_CONTROL { int carrier_mask; int handshake_mask; }; struct baud_str { unsigned long rate_value; unsigned long rate_mask; }; struct parse_list { int p_length; char p_string[20]; }; struct secure { char *rq_OKFile; char *rq_FILES; char *rq_About; char *rq_Template; char *sc_Inbound; int rq_Limit; int time_Limit; long byte_Limit; int rq_Cum_Limit; long time_Cum_Limit; long byte_Cum_Limit; int security; /* Maximus Security */ }; struct req_accum { long CumBytes; long CumFiles; long CumTime; /* * This is measured in SECONDS of request processing time, as * opposed to time, below, which is the "here and now" time. * The reason for the Cum v non-Cum stuff is to allow for two sets of * verbs - one for a session limit, one for a cumulative limit. * We also need a verb to shut the accumulation shit off. */ int files; long bytes; long time; long LastTime; }; #ifdef DOS16 #include "com_dos.h" #endif #ifdef OS_2 #include "com_os2.h" #endif /* OS_2 */ #ifdef _WIN32 #include "com_nt.h" #endif /* END OF FILE: com.h */