Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

parse.h

Go to the documentation of this file.
00001 /*
00002    rdesktop: A Remote Desktop Protocol client.
00003    Parsing primitives
00004    Copyright (C) Matthew Chapman 1999-2002
00005 
00006    This program is free software; you can redistribute it and/or modify
00007    it under the terms of the GNU General Public License as published by
00008    the Free Software Foundation; either version 2 of the License, or
00009    (at your option) any later version.
00010 
00011    This program is distributed in the hope that it will be useful,
00012    but WITHOUT ANY WARRANTY; without even the implied warranty of
00013    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00014    GNU General Public License for more details.
00015 
00016    You should have received a copy of the GNU General Public License
00017    along with this program; if not, write to the Free Software
00018    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
00019 */
00020 
00021 /* Parser state */
00022 typedef struct stream
00023 {
00024         unsigned char *p;
00025         unsigned char *end;
00026         unsigned char *data;
00027         unsigned int size;
00028 //      unsigned char *next_packet;
00029 
00030 
00031         /* Offsets of various headers */
00032         unsigned char *iso_hdr;
00033         unsigned char *mcs_hdr;
00034         unsigned char *sec_hdr;
00035         unsigned char *rdp_hdr;
00036 
00037 }
00038  *STREAM;
00039 
00040 #define s_push_layer(s,h,n)     { (s)->h = (s)->p; (s)->p += n; }
00041 #define s_pop_layer(s,h)        (s)->p = (s)->h;
00042 #define s_mark_end(s)           (s)->end = (s)->p;
00043 #define s_check(s)              ((s)->p <= (s)->end)
00044 #define s_check_rem(s,n)        ((s)->p + n <= (s)->end)
00045 #define s_check_end(s)          ((s)->p == (s)->end)
00046 
00047 #if defined(L_ENDIAN) && !defined(NEED_ALIGN)
00048 #define in_uint16_le(s,v)       { v = *(uint16 *)((s)->p); (s)->p += 2; }
00049 #define in_uint32_le(s,v)       { v = *(uint32 *)((s)->p); (s)->p += 4; }
00050 #define out_uint16_le(s,v)      { *(uint16 *)((s)->p) = v; (s)->p += 2; }
00051 #define out_uint32_le(s,v)      { *(uint32 *)((s)->p) = v; (s)->p += 4; }
00052 
00053 #else
00054 #define in_uint16_le(s,v)       { v = *((s)->p++); v += *((s)->p++) << 8; }
00055 #define in_uint32_le(s,v)       { in_uint16_le(s,v) \
00056                                 v += *((s)->p++) << 16; v += *((s)->p++) << 24; }
00057 #define out_uint16_le(s,v)      { *((s)->p++) = (v) & 0xff; *((s)->p++) = ((v) >> 8) & 0xff; }
00058 #define out_uint32_le(s,v)      { out_uint16_le(s, (v) & 0xffff); out_uint16_le(s, ((v) >> 16) & 0xffff); }
00059 #endif
00060 
00061 #if defined(B_ENDIAN) && !defined(NEED_ALIGN)
00062 #define in_uint16_be(s,v)       { v = *(uint16 *)((s)->p); (s)->p += 2; }
00063 #define in_uint32_be(s,v)       { v = *(uint32 *)((s)->p); (s)->p += 4; }
00064 #define out_uint16_be(s,v)      { *(uint16 *)((s)->p) = v; (s)->p += 2; }
00065 #define out_uint32_be(s,v)      { *(uint32 *)((s)->p) = v; (s)->p += 4; }
00066 
00067 #define B_ENDIAN_PREFERRED
00068 #define in_uint16(s,v)          in_uint16_be(s,v)
00069 #define in_uint32(s,v)          in_uint32_be(s,v)
00070 #define out_uint16(s,v)         out_uint16_be(s,v)
00071 #define out_uint32(s,v)         out_uint32_be(s,v)
00072 
00073 #else
00074 #define next_be(s,v)            v = ((v) << 8) + *((s)->p++);
00075 #define in_uint16_be(s,v)       { v = *((s)->p++); next_be(s,v); }
00076 #define in_uint32_be(s,v)       { in_uint16_be(s,v); next_be(s,v); next_be(s,v); }
00077 #define out_uint16_be(s,v)      { *((s)->p++) = ((v) >> 8) & 0xff; *((s)->p++) = (v) & 0xff; }
00078 #define out_uint32_be(s,v)      { out_uint16_be(s, ((v) >> 16) & 0xffff); out_uint16_be(s, (v) & 0xffff); }
00079 #endif
00080 
00081 #ifndef B_ENDIAN_PREFERRED
00082 #define in_uint16(s,v)          in_uint16_le(s,v)
00083 #define in_uint32(s,v)          in_uint32_le(s,v)
00084 #define out_uint16(s,v)         out_uint16_le(s,v)
00085 #define out_uint32(s,v)         out_uint32_le(s,v)
00086 #endif
00087 
00088 #define in_uint8(s,v)           v = *((s)->p++);
00089 #define in_uint8p(s,v,n)        { v = (s)->p; (s)->p += n; }
00090 #define in_uint8a(s,v,n)        { memcpy(v,(s)->p,n); (s)->p += n; }
00091 #define in_uint8s(s,n)          (s)->p += n;
00092 #define out_uint8(s,v)          *((s)->p++) = v;
00093 #define out_uint8p(s,v,n)       { memcpy((s)->p,v,n); (s)->p += n; }
00094 #define out_uint8a(s,v,n)       out_uint8p(s,v,n);
00095 #define out_uint8s(s,n)         { memset((s)->p,0,n); (s)->p += n; }
00096 
00097 #if defined(B_ENDIAN)
00098 
00099 #endif
00100 #if defined(B_ENDIAN_PREFERRED)
00101 
00102 #endif
00103 #if defined(NEED_ALIGN)
00104 
00105 #endif
00106 #if defined(L_ENDIAN)
00107 
00108 #endif

Generated on Sat Nov 5 16:17:42 2005 for OPIE by  doxygen 1.4.2