pred.c (8857) | pred.c (13379) |
---|---|
1#include "fsm.h" 2#include "hdlc.h" 3#include "lcpproto.h" 4#include "ccp.h" 5 6/* 7 * | 1#include "fsm.h" 2#include "hdlc.h" 3#include "lcpproto.h" 4#include "ccp.h" 5 6/* 7 * |
8 * $Id: pred.c,v 1.2 1995/02/26 12:17:55 amurai Exp $ | 8 * $Id: pred.c,v 1.3 1995/05/30 03:50:55 rgrimes Exp $ |
9 * 10 * pred.c -- Test program for Dave Rand's rendition of the 11 * predictor algorithm 12 * Updated by: iand@labtam.labtam.oz.au (Ian Donaldson) 13 * Updated by: Carsten Bormann <cabo@cs.tu-berlin.de> 14 * Original : Dave Rand <dlr@bungi.com>/<dave_rand@novell.com> 15 */ 16 --- 35 unchanged lines hidden (view full) --- 52 return(dest - orgdest); 53} 54 55static void 56SyncTable(source, dest, len) 57unsigned char *source, *dest; 58int len; 59{ | 9 * 10 * pred.c -- Test program for Dave Rand's rendition of the 11 * predictor algorithm 12 * Updated by: iand@labtam.labtam.oz.au (Ian Donaldson) 13 * Updated by: Carsten Bormann <cabo@cs.tu-berlin.de> 14 * Original : Dave Rand <dlr@bungi.com>/<dave_rand@novell.com> 15 */ 16 --- 35 unchanged lines hidden (view full) --- 52 return(dest - orgdest); 53} 54 55static void 56SyncTable(source, dest, len) 57unsigned char *source, *dest; 58int len; 59{ |
60 int i; | |
61 62 while (len--) { 63 if (InputGuessTable[iHash] != *source) { 64 InputGuessTable[iHash] = *source; 65 } 66 IHASH(*dest++ = *source++); 67 } 68} --- 150 unchanged lines hidden --- | 60 61 while (len--) { 62 if (InputGuessTable[iHash] != *source) { 63 InputGuessTable[iHash] = *source; 64 } 65 IHASH(*dest++ = *source++); 66 } 67} --- 150 unchanged lines hidden --- |