C++程序  |  53行  |  1.99 KB

/*-
 * Copyright (c) 1999 Brian Somers <brian@Awfulhak.org>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * $FreeBSD: src/usr.sbin/ppp/layer.h,v 1.3.62.1 2010/12/21 17:10:29 kensmith Exp $
 */

#define	LAYER_ASYNC	2
#define	LAYER_SYNC	3
#define	LAYER_HDLC	4
#define	LAYER_ACF	5
#define	LAYER_PROTO	6
#define	LAYER_LQR	7
#define	LAYER_CCP	8
#define	LAYER_VJ	9
#define	LAYER_NAT	10

#define	LAYER_MAX	10	/* How many layers we can handle on a link */

struct mbuf;
struct link;
struct bundle;

struct layer {
  int type;
  const char *name;
  struct mbuf *(*push)(struct bundle *, struct link *, struct mbuf *,
                       int pri, u_short *proto);
  struct mbuf *(*pull)(struct bundle *, struct link *, struct mbuf *,
                       u_short *);
};