slhc_vj.h 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185
  1. #ifndef _SLHC_H
  2. #define _SLHC_H
  3. /*
  4. * Definitions for tcp compression routines.
  5. *
  6. * $Header: slcompress.h,v 1.10 89/12/31 08:53:02 van Exp $
  7. *
  8. * Copyright (c) 1989 Regents of the University of California.
  9. * All rights reserved.
  10. *
  11. * Redistribution and use in source and binary forms are permitted
  12. * provided that the above copyright notice and this paragraph are
  13. * duplicated in all such forms and that any documentation,
  14. * advertising materials, and other materials related to such
  15. * distribution and use acknowledge that the software was developed
  16. * by the University of California, Berkeley. The name of the
  17. * University may not be used to endorse or promote products derived
  18. * from this software without specific prior written permission.
  19. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
  20. * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
  21. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
  22. *
  23. * Van Jacobson (van@helios.ee.lbl.gov), Dec 31, 1989:
  24. * - Initial distribution.
  25. *
  26. *
  27. * modified for KA9Q Internet Software Package by
  28. * Katie Stevens (dkstevens@ucdavis.edu)
  29. * University of California, Davis
  30. * Computing Services
  31. * - 01-31-90 initial adaptation
  32. *
  33. * - Feb 1991 Bill_Simpson@um.cc.umich.edu
  34. * variable number of conversation slots
  35. * allow zero or one slots
  36. * separate routines
  37. * status display
  38. */
  39. /*
  40. * Compressed packet format:
  41. *
  42. * The first octet contains the packet type (top 3 bits), TCP
  43. * 'push' bit, and flags that indicate which of the 4 TCP sequence
  44. * numbers have changed (bottom 5 bits). The next octet is a
  45. * conversation number that associates a saved IP/TCP header with
  46. * the compressed packet. The next two octets are the TCP checksum
  47. * from the original datagram. The next 0 to 15 octets are
  48. * sequence number changes, one change per bit set in the header
  49. * (there may be no changes and there are two special cases where
  50. * the receiver implicitly knows what changed -- see below).
  51. *
  52. * There are 5 numbers which can change (they are always inserted
  53. * in the following order): TCP urgent pointer, window,
  54. * acknowledgment, sequence number and IP ID. (The urgent pointer
  55. * is different from the others in that its value is sent, not the
  56. * change in value.) Since typical use of SLIP links is biased
  57. * toward small packets (see comments on MTU/MSS below), changes
  58. * use a variable length coding with one octet for numbers in the
  59. * range 1 - 255 and 3 octets (0, MSB, LSB) for numbers in the
  60. * range 256 - 65535 or 0. (If the change in sequence number or
  61. * ack is more than 65535, an uncompressed packet is sent.)
  62. */
  63. /*
  64. * Packet types (must not conflict with IP protocol version)
  65. *
  66. * The top nibble of the first octet is the packet type. There are
  67. * three possible types: IP (not proto TCP or tcp with one of the
  68. * control flags set); uncompressed TCP (a normal IP/TCP packet but
  69. * with the 8-bit protocol field replaced by an 8-bit connection id --
  70. * this type of packet syncs the sender & receiver); and compressed
  71. * TCP (described above).
  72. *
  73. * LSB of 4-bit field is TCP "PUSH" bit (a worthless anachronism) and
  74. * is logically part of the 4-bit "changes" field that follows. Top
  75. * three bits are actual packet type. For backward compatibility
  76. * and in the interest of conserving bits, numbers are chosen so the
  77. * IP protocol version number (4) which normally appears in this nibble
  78. * means "IP packet".
  79. */
  80. #include <linux/ip.h>
  81. #include <linux/tcp.h>
  82. /* SLIP compression masks for len/vers byte */
  83. #define SL_TYPE_IP 0x40
  84. #define SL_TYPE_UNCOMPRESSED_TCP 0x70
  85. #define SL_TYPE_COMPRESSED_TCP 0x80
  86. #define SL_TYPE_ERROR 0x00
  87. /* Bits in first octet of compressed packet */
  88. #define NEW_C 0x40 /* flag bits for what changed in a packet */
  89. #define NEW_I 0x20
  90. #define NEW_S 0x08
  91. #define NEW_A 0x04
  92. #define NEW_W 0x02
  93. #define NEW_U 0x01
  94. /* reserved, special-case values of above */
  95. #define SPECIAL_I (NEW_S|NEW_W|NEW_U) /* echoed interactive traffic */
  96. #define SPECIAL_D (NEW_S|NEW_A|NEW_W|NEW_U) /* unidirectional data */
  97. #define SPECIALS_MASK (NEW_S|NEW_A|NEW_W|NEW_U)
  98. #define TCP_PUSH_BIT 0x10
  99. /*
  100. * data type and sizes conversion assumptions:
  101. *
  102. * VJ code KA9Q style generic
  103. * u_char byte_t unsigned char 8 bits
  104. * u_short int16 unsigned short 16 bits
  105. * u_int int16 unsigned short 16 bits
  106. * u_long unsigned long unsigned long 32 bits
  107. * int int32 long 32 bits
  108. */
  109. typedef __u8 byte_t;
  110. typedef __u32 int32;
  111. /*
  112. * "state" data for each active tcp conversation on the wire. This is
  113. * basically a copy of the entire IP/TCP header from the last packet
  114. * we saw from the conversation together with a small identifier
  115. * the transmit & receive ends of the line use to locate saved header.
  116. */
  117. struct cstate {
  118. byte_t cs_this; /* connection id number (xmit) */
  119. bool initialized; /* true if initialized */
  120. struct cstate *next; /* next in ring (xmit) */
  121. struct iphdr cs_ip; /* ip/tcp hdr from most recent packet */
  122. struct tcphdr cs_tcp;
  123. unsigned char cs_ipopt[64];
  124. unsigned char cs_tcpopt[64];
  125. int cs_hsize;
  126. };
  127. #define NULLSLSTATE (struct cstate *)0
  128. /*
  129. * all the state data for one serial line (we need one of these per line).
  130. */
  131. struct slcompress {
  132. struct cstate *tstate; /* transmit connection states (array)*/
  133. struct cstate *rstate; /* receive connection states (array)*/
  134. byte_t tslot_limit; /* highest transmit slot id (0-l)*/
  135. byte_t rslot_limit; /* highest receive slot id (0-l)*/
  136. byte_t xmit_oldest; /* oldest xmit in ring */
  137. byte_t xmit_current; /* most recent xmit id */
  138. byte_t recv_current; /* most recent rcvd id */
  139. byte_t flags;
  140. #define SLF_TOSS 0x01 /* tossing rcvd frames until id received */
  141. int32 sls_o_nontcp; /* outbound non-TCP packets */
  142. int32 sls_o_tcp; /* outbound TCP packets */
  143. int32 sls_o_uncompressed; /* outbound uncompressed packets */
  144. int32 sls_o_compressed; /* outbound compressed packets */
  145. int32 sls_o_searches; /* searches for connection state */
  146. int32 sls_o_misses; /* times couldn't find conn. state */
  147. int32 sls_i_uncompressed; /* inbound uncompressed packets */
  148. int32 sls_i_compressed; /* inbound compressed packets */
  149. int32 sls_i_error; /* inbound error packets */
  150. int32 sls_i_tossed; /* inbound packets tossed because of error */
  151. int32 sls_i_runt;
  152. int32 sls_i_badcheck;
  153. };
  154. #define NULLSLCOMPR (struct slcompress *)0
  155. /* In slhc.c: */
  156. struct slcompress *slhc_init(int rslots, int tslots);
  157. void slhc_free(struct slcompress *comp);
  158. int slhc_compress(struct slcompress *comp, unsigned char *icp, int isize,
  159. unsigned char *ocp, unsigned char **cpp, int compress_cid);
  160. int slhc_uncompress(struct slcompress *comp, unsigned char *icp, int isize);
  161. int slhc_remember(struct slcompress *comp, unsigned char *icp, int isize);
  162. int slhc_toss(struct slcompress *comp);
  163. #endif /* _SLHC_H */