slcompress.h 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160
  1. /*
  2. * Definitions for tcp compression routines.
  3. */
  4. /*-
  5. * SPDX-License-Identifier: BSD-3-Clause
  6. *
  7. * Copyright (c) 1989, 1993
  8. * The Regents of the University of California. All rights reserved.
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions
  12. * are met:
  13. * 1. Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions and the following disclaimer.
  15. * 2. Redistributions in binary form must reproduce the above copyright
  16. * notice, this list of conditions and the following disclaimer in the
  17. * documentation and/or other materials provided with the distribution.
  18. * 3. Neither the name of the University nor the names of its contributors
  19. * may be used to endorse or promote products derived from this software
  20. * without specific prior written permission.
  21. *
  22. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  23. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  26. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  27. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  28. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  29. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  30. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  31. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  32. * SUCH DAMAGE.
  33. *
  34. * Van Jacobson (van@helios.ee.lbl.gov), Dec 31, 1989:
  35. * - Initial distribution.
  36. * $FreeBSD$
  37. */
  38. #ifndef _NET_SLCOMPRESS_H_
  39. #define _NET_SLCOMPRESS_H_
  40. #define MAX_STATES 16 /* must be > 2 and < 256 */
  41. #define MAX_HDR 128
  42. /*
  43. * Compressed packet format:
  44. *
  45. * The first octet contains the packet type (top 3 bits), TCP
  46. * 'push' bit, and flags that indicate which of the 4 TCP sequence
  47. * numbers have changed (bottom 5 bits). The next octet is a
  48. * conversation number that associates a saved IP/TCP header with
  49. * the compressed packet. The next two octets are the TCP checksum
  50. * from the original datagram. The next 0 to 15 octets are
  51. * sequence number changes, one change per bit set in the header
  52. * (there may be no changes and there are two special cases where
  53. * the receiver implicitly knows what changed -- see below).
  54. *
  55. * There are 5 numbers which can change (they are always inserted
  56. * in the following order): TCP urgent pointer, window,
  57. * acknowledgement, sequence number and IP ID. (The urgent pointer
  58. * is different from the others in that its value is sent, not the
  59. * change in value.) Since typical use of SLIP links is biased
  60. * toward small packets (see comments on MTU/MSS below), changes
  61. * use a variable length coding with one octet for numbers in the
  62. * range 1 - 255 and 3 octets (0, MSB, LSB) for numbers in the
  63. * range 256 - 65535 or 0. (If the change in sequence number or
  64. * ack is more than 65535, an uncompressed packet is sent.)
  65. */
  66. /*
  67. * Packet types (must not conflict with IP protocol version)
  68. *
  69. * The top nibble of the first octet is the packet type. There are
  70. * three possible types: IP (not proto TCP or tcp with one of the
  71. * control flags set); uncompressed TCP (a normal IP/TCP packet but
  72. * with the 8-bit protocol field replaced by an 8-bit connection id --
  73. * this type of packet syncs the sender & receiver); and compressed
  74. * TCP (described above).
  75. *
  76. * LSB of 4-bit field is TCP "PUSH" bit (a worthless anachronism) and
  77. * is logically part of the 4-bit "changes" field that follows. Top
  78. * three bits are actual packet type. For backward compatibility
  79. * and in the interest of conserving bits, numbers are chosen so the
  80. * IP protocol version number (4) which normally appears in this nibble
  81. * means "IP packet".
  82. */
  83. /* packet types */
  84. #define TYPE_IP 0x40
  85. #define TYPE_UNCOMPRESSED_TCP 0x70
  86. #define TYPE_COMPRESSED_TCP 0x80
  87. #define TYPE_ERROR 0x00
  88. /* Bits in first octet of compressed packet */
  89. #define NEW_C 0x40 /* flag bits for what changed in a packet */
  90. #define NEW_I 0x20
  91. #define NEW_S 0x08
  92. #define NEW_A 0x04
  93. #define NEW_W 0x02
  94. #define NEW_U 0x01
  95. /* reserved, special-case values of above */
  96. #define SPECIAL_I (NEW_S|NEW_W|NEW_U) /* echoed interactive traffic */
  97. #define SPECIAL_D (NEW_S|NEW_A|NEW_W|NEW_U) /* unidirectional data */
  98. #define SPECIALS_MASK (NEW_S|NEW_A|NEW_W|NEW_U)
  99. #define TCP_PUSH_BIT 0x10
  100. /*
  101. * "state" data for each active tcp conversation on the wire. This is
  102. * basically a copy of the entire IP/TCP header from the last packet
  103. * we saw from the conversation together with a small identifier
  104. * the transmit & receive ends of the line use to locate saved header.
  105. */
  106. struct cstate {
  107. struct cstate *cs_next; /* next most recently used cstate (xmit only) */
  108. u_int16_t cs_hlen; /* size of hdr (receive only) */
  109. u_char cs_id; /* connection # associated with this state */
  110. u_char cs_filler;
  111. union {
  112. char csu_hdr[MAX_HDR];
  113. struct ip csu_ip; /* ip/tcp hdr from most recent packet */
  114. } slcs_u;
  115. };
  116. #define cs_ip slcs_u.csu_ip
  117. #define cs_hdr slcs_u.csu_hdr
  118. /*
  119. * all the state data for one serial line (we need one of these
  120. * per line).
  121. */
  122. struct slcompress {
  123. struct cstate *last_cs; /* most recently used tstate */
  124. u_char last_recv; /* last rcvd conn. id */
  125. u_char last_xmit; /* last sent conn. id */
  126. u_int16_t flags;
  127. #ifndef SL_NO_STATS
  128. int sls_packets; /* outbound packets */
  129. int sls_compressed; /* outbound compressed packets */
  130. int sls_searches; /* searches for connection state */
  131. int sls_misses; /* times couldn't find conn. state */
  132. int sls_uncompressedin; /* inbound uncompressed packets */
  133. int sls_compressedin; /* inbound compressed packets */
  134. int sls_errorin; /* inbound unknown type packets */
  135. int sls_tossed; /* inbound packets tossed because of error */
  136. #endif
  137. struct cstate tstate[MAX_STATES]; /* xmit connection states */
  138. struct cstate rstate[MAX_STATES]; /* receive connection states */
  139. };
  140. /* flag values */
  141. #define SLF_TOSS 1 /* tossing rcvd frames because of input err */
  142. void sl_compress_init(struct slcompress *, int);
  143. u_int sl_compress_tcp(struct mbuf *, struct ip *, struct slcompress *, int);
  144. int sl_uncompress_tcp(u_char **, int, u_int, struct slcompress *);
  145. int sl_uncompress_tcp_core(u_char *, int, int, u_int,
  146. struct slcompress *, u_char **, u_int *);
  147. #endif /* !_NET_SLCOMPRESS_H_ */