mirror of
https://git.FreeBSD.org/src.git
synced 2024-12-18 10:35:55 +00:00
76bd0c0a9d
ppp based on these patches for about 3 weeks with no downtime. The original submitters comments: Two features iijppp has over kernel ppp that I like are predictor1 compression and demand dialing. Here are a few bug fixes. I expanded the priority queueing scheme and discovered it was broken due to the assignment at ip.c line 300. All packets were being queued at the same priority. Fixing priority queueing broke predictor1 compression. Packets were compressed before being queued and predictor1 worked as long as the packets were popped off the queue in the same order they were pushed onto the queue. There were a few byte order problems in IP header tests also. There is a recursion problem in SendLqrReport(). LcpClose() is called when "Too many echo packets are lost" which winds up in SendLqrReport() again. I believe the original intention was to just stop the LQR timer with the call to StopLqr() but the side effects hurt. Submitted by: John Capo <jc@irbs.com>
67 lines
2.1 KiB
C
67 lines
2.1 KiB
C
/*
|
|
* Written by Toshiharu OHNO (tony-o@iij.ad.jp)
|
|
*
|
|
* Copyright (C) 1993, Internet Initiative Japan, Inc. All rights reserverd.
|
|
*
|
|
* Redistribution and use in source and binary forms are permitted
|
|
* provided that the above copyright notice and this paragraph are
|
|
* duplicated in all such forms and that any documentation,
|
|
* advertising materials, and other materials related to such
|
|
* distribution and use acknowledge that the software was developed
|
|
* by the Internet Initiative Japan. The name of the
|
|
* IIJ may not be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
*
|
|
* $Id: hdlc.h,v 1.3 1996/01/11 17:48:48 phk Exp $
|
|
*
|
|
* TODO:
|
|
*/
|
|
|
|
#ifndef _HDLC_H_
|
|
#define _HDLC_H_
|
|
|
|
/*
|
|
* Definition for Async HDLC
|
|
*/
|
|
#define HDLC_SYN 0x7e /* SYNC character */
|
|
#define HDLC_ESC 0x7d /* Escape character */
|
|
#define HDLC_XOR 0x20 /* Modifier value */
|
|
|
|
#define HDLC_ADDR 0xff
|
|
#define HDLC_UI 0x03
|
|
/*
|
|
* Definition for HDLC Frame Check Sequence
|
|
*/
|
|
#define INITFCS 0xffff /* Initial value for FCS computation */
|
|
#define GOODFCS 0xf0b8 /* Good FCS value */
|
|
|
|
#define DEF_MRU 1500
|
|
#define MAX_MRU 2000
|
|
#define MIN_MRU 296
|
|
|
|
/*
|
|
* Output priority
|
|
*/
|
|
/* PRI_NORMAL and PRI_FAST have meaning only on the IP queue.
|
|
* All IP frames have the same priority once they are compressed.
|
|
* IP frames stay on the IP queue till they can be sent on the
|
|
* link. They are compressed at that time.
|
|
*/
|
|
#define PRI_NORMAL 0 /* Normal priority */
|
|
#define PRI_FAST 1 /* Fast (interractive) */
|
|
#define PRI_LINK 1 /* Urgent (LQR packets) */
|
|
|
|
unsigned char EscMap[33];
|
|
|
|
void HdlcInit __P((void));
|
|
void HdlcErrorCheck __P((void));
|
|
void HdlcInput __P((struct mbuf *bp));
|
|
void HdlcOutput __P((int pri, u_short proto, struct mbuf *bp));
|
|
void AsyncOutput __P((int pri, struct mbuf *bp, int proto));
|
|
u_short HdlcFcs __P((u_short, u_char *, int));
|
|
void DecodePacket __P((u_short, struct mbuf *));
|
|
#endif
|