2 * Generic PPP layer for Linux.
4 * Copyright 1999-2002 Paul Mackerras.
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
11 * The generic PPP layer handles the PPP network interfaces, the
12 * /dev/ppp device, packet and VJ compression, and multilink.
13 * It talks to PPP `channels' via the interface defined in
14 * include/linux/ppp_channel.h. Channels provide the basic means for
15 * sending and receiving PPP frames on some kind of communications
18 * Part of the code in this driver was inspired by the old async-only
19 * PPP driver, written by Michael Callahan and Al Longyear, and
20 * subsequently hacked by Paul Mackerras.
22 * ==FILEVERSION 20041108==
25 #include <linux/config.h>
26 #include <linux/module.h>
27 #include <linux/kernel.h>
28 #include <linux/kmod.h>
29 #include <linux/init.h>
30 #include <linux/list.h>
31 #include <linux/devfs_fs_kernel.h>
32 #include <linux/netdevice.h>
33 #include <linux/poll.h>
34 #include <linux/ppp_defs.h>
35 #include <linux/filter.h>
36 #include <linux/if_ppp.h>
37 #include <linux/ppp_channel.h>
38 #include <linux/ppp-comp.h>
39 #include <linux/skbuff.h>
40 #include <linux/rtnetlink.h>
41 #include <linux/if_arp.h>
43 #include <linux/tcp.h>
44 #include <linux/spinlock.h>
45 #include <linux/smp_lock.h>
46 #include <linux/rwsem.h>
47 #include <linux/stddef.h>
48 #include <linux/device.h>
49 #include <linux/mutex.h>
50 #include <net/slhc_vj.h>
51 #include <asm/atomic.h>
53 #define PPP_VERSION "2.4.2"
56 * Network protocols we support.
58 #define NP_IP 0 /* Internet Protocol V4 */
59 #define NP_IPV6 1 /* Internet Protocol V6 */
60 #define NP_IPX 2 /* IPX protocol */
61 #define NP_AT 3 /* Appletalk protocol */
62 #define NP_MPLS_UC 4 /* MPLS unicast */
63 #define NP_MPLS_MC 5 /* MPLS multicast */
64 #define NUM_NP 6 /* Number of NPs. */
66 #define MPHDRLEN 6 /* multilink protocol header length */
67 #define MPHDRLEN_SSN 4 /* ditto with short sequence numbers */
68 #define MIN_FRAG_SIZE 64
71 * An instance of /dev/ppp can be associated with either a ppp
72 * interface unit or a ppp channel. In both cases, file->private_data
73 * points to one of these.
79 struct sk_buff_head xq; /* pppd transmit queue */
80 struct sk_buff_head rq; /* receive queue for pppd */
81 wait_queue_head_t rwait; /* for poll on reading /dev/ppp */
82 atomic_t refcnt; /* # refs (incl /dev/ppp attached) */
83 int hdrlen; /* space to leave for headers */
84 int index; /* interface unit / channel number */
85 int dead; /* unit/channel has been shut down */
88 #define PF_TO_X(pf, X) ((X *)((char *)(pf) - offsetof(X, file)))
90 #define PF_TO_PPP(pf) PF_TO_X(pf, struct ppp)
91 #define PF_TO_CHANNEL(pf) PF_TO_X(pf, struct channel)
93 #define ROUNDUP(n, x) (((n) + (x) - 1) / (x))
96 * Data structure describing one ppp unit.
97 * A ppp unit corresponds to a ppp network interface device
98 * and represents a multilink bundle.
99 * It can have 0 or more ppp channels connected to it.
102 struct ppp_file file; /* stuff for read/write/poll 0 */
103 struct file *owner; /* file that owns this unit 48 */
104 struct list_head channels; /* list of attached channels 4c */
105 int n_channels; /* how many channels are attached 54 */
106 spinlock_t rlock; /* lock for receive side 58 */
107 spinlock_t wlock; /* lock for transmit side 5c */
108 int mru; /* max receive unit 60 */
109 unsigned int flags; /* control bits 64 */
110 unsigned int xstate; /* transmit state bits 68 */
111 unsigned int rstate; /* receive state bits 6c */
112 int debug; /* debug flags 70 */
113 struct slcompress *vj; /* state for VJ header compression */
114 enum NPmode npmode[NUM_NP]; /* what to do with each net proto 78 */
115 struct sk_buff *xmit_pending; /* a packet ready to go out 88 */
116 struct compressor *xcomp; /* transmit packet compressor 8c */
117 void *xc_state; /* its internal state 90 */
118 struct compressor *rcomp; /* receive decompressor 94 */
119 void *rc_state; /* its internal state 98 */
120 unsigned long last_xmit; /* jiffies when last pkt sent 9c */
121 unsigned long last_recv; /* jiffies when last pkt rcvd a0 */
122 struct net_device *dev; /* network interface device a4 */
123 #ifdef CONFIG_PPP_MULTILINK
124 int nxchan; /* next channel to send something on */
125 u32 nxseq; /* next sequence number to send */
126 int mrru; /* MP: max reconst. receive unit */
127 u32 nextseq; /* MP: seq no of next packet */
128 u32 minseq; /* MP: min of most recent seqnos */
129 struct sk_buff_head mrq; /* MP: receive reconstruction queue */
130 #endif /* CONFIG_PPP_MULTILINK */
131 struct net_device_stats stats; /* statistics */
132 #ifdef CONFIG_PPP_FILTER
133 struct sock_filter *pass_filter; /* filter for packets to pass */
134 struct sock_filter *active_filter;/* filter for pkts to reset idle */
135 unsigned pass_len, active_len;
136 #endif /* CONFIG_PPP_FILTER */
140 * Bits in flags: SC_NO_TCP_CCID, SC_CCP_OPEN, SC_CCP_UP, SC_LOOP_TRAFFIC,
141 * SC_MULTILINK, SC_MP_SHORTSEQ, SC_MP_XSHORTSEQ, SC_COMP_TCP, SC_REJ_COMP_TCP,
143 * Bits in rstate: SC_DECOMP_RUN, SC_DC_ERROR, SC_DC_FERROR.
144 * Bits in xstate: SC_COMP_RUN
146 #define SC_FLAG_BITS (SC_NO_TCP_CCID|SC_CCP_OPEN|SC_CCP_UP|SC_LOOP_TRAFFIC \
147 |SC_MULTILINK|SC_MP_SHORTSEQ|SC_MP_XSHORTSEQ \
148 |SC_COMP_TCP|SC_REJ_COMP_TCP|SC_MUST_COMP)
151 * Private data structure for each channel.
152 * This includes the data structure used for multilink.
155 struct ppp_file file; /* stuff for read/write/poll */
156 struct list_head list; /* link in all/new_channels list */
157 struct ppp_channel *chan; /* public channel data structure */
158 struct rw_semaphore chan_sem; /* protects `chan' during chan ioctl */
159 spinlock_t downl; /* protects `chan', file.xq dequeue */
160 struct ppp *ppp; /* ppp unit we're connected to */
161 struct list_head clist; /* link in list of channels per unit */
162 rwlock_t upl; /* protects `ppp' */
163 #ifdef CONFIG_PPP_MULTILINK
164 u8 avail; /* flag used in multilink stuff */
165 u8 had_frag; /* >= 1 fragments have been sent */
166 u32 lastseq; /* MP: last sequence # received */
167 #endif /* CONFIG_PPP_MULTILINK */
171 * SMP locking issues:
172 * Both the ppp.rlock and ppp.wlock locks protect the ppp.channels
173 * list and the ppp.n_channels field, you need to take both locks
174 * before you modify them.
175 * The lock ordering is: channel.upl -> ppp.wlock -> ppp.rlock ->
180 * A cardmap represents a mapping from unsigned integers to pointers,
181 * and provides a fast "find lowest unused number" operation.
182 * It uses a broad (32-way) tree with a bitmap at each level.
183 * It is designed to be space-efficient for small numbers of entries
184 * and time-efficient for large numbers of entries.
186 #define CARDMAP_ORDER 5
187 #define CARDMAP_WIDTH (1U << CARDMAP_ORDER)
188 #define CARDMAP_MASK (CARDMAP_WIDTH - 1)
193 struct cardmap *parent;
194 void *ptr[CARDMAP_WIDTH];
196 static void *cardmap_get(struct cardmap *map, unsigned int nr);
197 static void cardmap_set(struct cardmap **map, unsigned int nr, void *ptr);
198 static unsigned int cardmap_find_first_free(struct cardmap *map);
199 static void cardmap_destroy(struct cardmap **map);
202 * all_ppp_mutex protects the all_ppp_units mapping.
203 * It also ensures that finding a ppp unit in the all_ppp_units map
204 * and updating its file.refcnt field is atomic.
206 static DEFINE_MUTEX(all_ppp_mutex);
207 static struct cardmap *all_ppp_units;
208 static atomic_t ppp_unit_count = ATOMIC_INIT(0);
211 * all_channels_lock protects all_channels and last_channel_index,
212 * and the atomicity of find a channel and updating its file.refcnt
215 static DEFINE_SPINLOCK(all_channels_lock);
216 static LIST_HEAD(all_channels);
217 static LIST_HEAD(new_channels);
218 static int last_channel_index;
219 static atomic_t channel_count = ATOMIC_INIT(0);
221 /* Get the PPP protocol number from a skb */
222 #define PPP_PROTO(skb) (((skb)->data[0] << 8) + (skb)->data[1])
224 /* We limit the length of ppp->file.rq to this (arbitrary) value */
225 #define PPP_MAX_RQLEN 32
228 * Maximum number of multilink fragments queued up.
229 * This has to be large enough to cope with the maximum latency of
230 * the slowest channel relative to the others. Strictly it should
231 * depend on the number of channels and their characteristics.
233 #define PPP_MP_MAX_QLEN 128
235 /* Multilink header bits. */
236 #define B 0x80 /* this fragment begins a packet */
237 #define E 0x40 /* this fragment ends a packet */
239 /* Compare multilink sequence numbers (assumed to be 32 bits wide) */
240 #define seq_before(a, b) ((s32)((a) - (b)) < 0)
241 #define seq_after(a, b) ((s32)((a) - (b)) > 0)
244 static int ppp_unattached_ioctl(struct ppp_file *pf, struct file *file,
245 unsigned int cmd, unsigned long arg);
246 static void ppp_xmit_process(struct ppp *ppp);
247 static void ppp_send_frame(struct ppp *ppp, struct sk_buff *skb);
248 static void ppp_push(struct ppp *ppp);
249 static void ppp_channel_push(struct channel *pch);
250 static void ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb,
251 struct channel *pch);
252 static void ppp_receive_error(struct ppp *ppp);
253 static void ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb);
254 static struct sk_buff *ppp_decompress_frame(struct ppp *ppp,
255 struct sk_buff *skb);
256 #ifdef CONFIG_PPP_MULTILINK
257 static void ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb,
258 struct channel *pch);
259 static void ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb);
260 static struct sk_buff *ppp_mp_reconstruct(struct ppp *ppp);
261 static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb);
262 #endif /* CONFIG_PPP_MULTILINK */
263 static int ppp_set_compress(struct ppp *ppp, unsigned long arg);
264 static void ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound);
265 static void ppp_ccp_closed(struct ppp *ppp);
266 static struct compressor *find_compressor(int type);
267 static void ppp_get_stats(struct ppp *ppp, struct ppp_stats *st);
268 static struct ppp *ppp_create_interface(int unit, int *retp);
269 static void init_ppp_file(struct ppp_file *pf, int kind);
270 static void ppp_shutdown_interface(struct ppp *ppp);
271 static void ppp_destroy_interface(struct ppp *ppp);
272 static struct ppp *ppp_find_unit(int unit);
273 static struct channel *ppp_find_channel(int unit);
274 static int ppp_connect_channel(struct channel *pch, int unit);
275 static int ppp_disconnect_channel(struct channel *pch);
276 static void ppp_destroy_channel(struct channel *pch);
278 static struct class *ppp_class;
280 /* Translates a PPP protocol number to a NP index (NP == network protocol) */
281 static inline int proto_to_npindex(int proto)
300 /* Translates an NP index into a PPP protocol number */
301 static const int npindex_to_proto[NUM_NP] = {
310 /* Translates an ethertype into an NP index */
311 static inline int ethertype_to_npindex(int ethertype)
331 /* Translates an NP index into an ethertype */
332 static const int npindex_to_ethertype[NUM_NP] = {
344 #define ppp_xmit_lock(ppp) spin_lock_bh(&(ppp)->wlock)
345 #define ppp_xmit_unlock(ppp) spin_unlock_bh(&(ppp)->wlock)
346 #define ppp_recv_lock(ppp) spin_lock_bh(&(ppp)->rlock)
347 #define ppp_recv_unlock(ppp) spin_unlock_bh(&(ppp)->rlock)
348 #define ppp_lock(ppp) do { ppp_xmit_lock(ppp); \
349 ppp_recv_lock(ppp); } while (0)
350 #define ppp_unlock(ppp) do { ppp_recv_unlock(ppp); \
351 ppp_xmit_unlock(ppp); } while (0)
354 * /dev/ppp device routines.
355 * The /dev/ppp device is used by pppd to control the ppp unit.
356 * It supports the read, write, ioctl and poll functions.
357 * Open instances of /dev/ppp can be in one of three states:
358 * unattached, attached to a ppp unit, or attached to a ppp channel.
360 static int ppp_open(struct inode *inode, struct file *file)
363 * This could (should?) be enforced by the permissions on /dev/ppp.
365 if (!capable(CAP_NET_ADMIN))
370 static int ppp_release(struct inode *inode, struct file *file)
372 struct ppp_file *pf = file->private_data;
376 file->private_data = NULL;
377 if (pf->kind == INTERFACE) {
379 if (file == ppp->owner)
380 ppp_shutdown_interface(ppp);
382 if (atomic_dec_and_test(&pf->refcnt)) {
385 ppp_destroy_interface(PF_TO_PPP(pf));
388 ppp_destroy_channel(PF_TO_CHANNEL(pf));
396 static ssize_t ppp_read(struct file *file, char __user *buf,
397 size_t count, loff_t *ppos)
399 struct ppp_file *pf = file->private_data;
400 DECLARE_WAITQUEUE(wait, current);
402 struct sk_buff *skb = NULL;
408 add_wait_queue(&pf->rwait, &wait);
410 set_current_state(TASK_INTERRUPTIBLE);
411 skb = skb_dequeue(&pf->rq);
417 if (pf->kind == INTERFACE) {
419 * Return 0 (EOF) on an interface that has no
420 * channels connected, unless it is looping
421 * network traffic (demand mode).
423 struct ppp *ppp = PF_TO_PPP(pf);
424 if (ppp->n_channels == 0
425 && (ppp->flags & SC_LOOP_TRAFFIC) == 0)
429 if (file->f_flags & O_NONBLOCK)
432 if (signal_pending(current))
436 set_current_state(TASK_RUNNING);
437 remove_wait_queue(&pf->rwait, &wait);
443 if (skb->len > count)
446 if (copy_to_user(buf, skb->data, skb->len))
456 static ssize_t ppp_write(struct file *file, const char __user *buf,
457 size_t count, loff_t *ppos)
459 struct ppp_file *pf = file->private_data;
466 skb = alloc_skb(count + pf->hdrlen, GFP_KERNEL);
469 skb_reserve(skb, pf->hdrlen);
471 if (copy_from_user(skb_put(skb, count), buf, count)) {
476 skb_queue_tail(&pf->xq, skb);
480 ppp_xmit_process(PF_TO_PPP(pf));
483 ppp_channel_push(PF_TO_CHANNEL(pf));
493 /* No kernel lock - fine */
494 static unsigned int ppp_poll(struct file *file, poll_table *wait)
496 struct ppp_file *pf = file->private_data;
501 poll_wait(file, &pf->rwait, wait);
502 mask = POLLOUT | POLLWRNORM;
503 if (skb_peek(&pf->rq) != 0)
504 mask |= POLLIN | POLLRDNORM;
507 else if (pf->kind == INTERFACE) {
508 /* see comment in ppp_read */
509 struct ppp *ppp = PF_TO_PPP(pf);
510 if (ppp->n_channels == 0
511 && (ppp->flags & SC_LOOP_TRAFFIC) == 0)
512 mask |= POLLIN | POLLRDNORM;
518 #ifdef CONFIG_PPP_FILTER
519 static int get_filter(void __user *arg, struct sock_filter **p)
521 struct sock_fprog uprog;
522 struct sock_filter *code = NULL;
525 if (copy_from_user(&uprog, arg, sizeof(uprog)))
533 len = uprog.len * sizeof(struct sock_filter);
534 code = kmalloc(len, GFP_KERNEL);
538 if (copy_from_user(code, uprog.filter, len)) {
543 err = sk_chk_filter(code, uprog.len);
552 #endif /* CONFIG_PPP_FILTER */
554 static int ppp_ioctl(struct inode *inode, struct file *file,
555 unsigned int cmd, unsigned long arg)
557 struct ppp_file *pf = file->private_data;
559 int err = -EFAULT, val, val2, i;
560 struct ppp_idle idle;
563 struct slcompress *vj;
564 void __user *argp = (void __user *)arg;
565 int __user *p = argp;
568 return ppp_unattached_ioctl(pf, file, cmd, arg);
570 if (cmd == PPPIOCDETACH) {
572 * We have to be careful here... if the file descriptor
573 * has been dup'd, we could have another process in the
574 * middle of a poll using the same file *, so we had
575 * better not free the interface data structures -
576 * instead we fail the ioctl. Even in this case, we
577 * shut down the interface if we are the owner of it.
578 * Actually, we should get rid of PPPIOCDETACH, userland
579 * (i.e. pppd) could achieve the same effect by closing
580 * this fd and reopening /dev/ppp.
583 if (pf->kind == INTERFACE) {
585 if (file == ppp->owner)
586 ppp_shutdown_interface(ppp);
588 if (atomic_read(&file->f_count) <= 2) {
589 ppp_release(inode, file);
592 printk(KERN_DEBUG "PPPIOCDETACH file->f_count=%d\n",
593 atomic_read(&file->f_count));
597 if (pf->kind == CHANNEL) {
598 struct channel *pch = PF_TO_CHANNEL(pf);
599 struct ppp_channel *chan;
603 if (get_user(unit, p))
605 err = ppp_connect_channel(pch, unit);
609 err = ppp_disconnect_channel(pch);
613 down_read(&pch->chan_sem);
616 if (chan && chan->ops->ioctl)
617 err = chan->ops->ioctl(chan, cmd, arg);
618 up_read(&pch->chan_sem);
623 if (pf->kind != INTERFACE) {
625 printk(KERN_ERR "PPP: not interface or channel??\n");
632 if (get_user(val, p))
639 if (get_user(val, p))
642 cflags = ppp->flags & ~val;
643 ppp->flags = val & SC_FLAG_BITS;
645 if (cflags & SC_CCP_OPEN)
651 val = ppp->flags | ppp->xstate | ppp->rstate;
652 if (put_user(val, p))
657 case PPPIOCSCOMPRESS:
658 err = ppp_set_compress(ppp, arg);
662 if (put_user(ppp->file.index, p))
668 if (get_user(val, p))
675 if (put_user(ppp->debug, p))
681 idle.xmit_idle = (jiffies - ppp->last_xmit) / HZ;
682 idle.recv_idle = (jiffies - ppp->last_recv) / HZ;
683 if (copy_to_user(argp, &idle, sizeof(idle)))
689 if (get_user(val, p))
692 if ((val >> 16) != 0) {
696 vj = slhc_init(val2+1, val+1);
698 printk(KERN_ERR "PPP: no memory (VJ compressor)\n");
712 if (copy_from_user(&npi, argp, sizeof(npi)))
714 err = proto_to_npindex(npi.protocol);
718 if (cmd == PPPIOCGNPMODE) {
720 npi.mode = ppp->npmode[i];
721 if (copy_to_user(argp, &npi, sizeof(npi)))
724 ppp->npmode[i] = npi.mode;
725 /* we may be able to transmit more packets now (??) */
726 netif_wake_queue(ppp->dev);
731 #ifdef CONFIG_PPP_FILTER
734 struct sock_filter *code;
735 err = get_filter(argp, &code);
738 kfree(ppp->pass_filter);
739 ppp->pass_filter = code;
748 struct sock_filter *code;
749 err = get_filter(argp, &code);
752 kfree(ppp->active_filter);
753 ppp->active_filter = code;
754 ppp->active_len = err;
760 #endif /* CONFIG_PPP_FILTER */
762 #ifdef CONFIG_PPP_MULTILINK
764 if (get_user(val, p))
768 ppp_recv_unlock(ppp);
771 #endif /* CONFIG_PPP_MULTILINK */
780 static int ppp_unattached_ioctl(struct ppp_file *pf, struct file *file,
781 unsigned int cmd, unsigned long arg)
783 int unit, err = -EFAULT;
785 struct channel *chan;
786 int __user *p = (int __user *)arg;
790 /* Create a new ppp unit */
791 if (get_user(unit, p))
793 ppp = ppp_create_interface(unit, &err);
796 file->private_data = &ppp->file;
799 if (put_user(ppp->file.index, p))
805 /* Attach to an existing ppp unit */
806 if (get_user(unit, p))
808 mutex_lock(&all_ppp_mutex);
810 ppp = ppp_find_unit(unit);
812 atomic_inc(&ppp->file.refcnt);
813 file->private_data = &ppp->file;
816 mutex_unlock(&all_ppp_mutex);
820 if (get_user(unit, p))
822 spin_lock_bh(&all_channels_lock);
824 chan = ppp_find_channel(unit);
826 atomic_inc(&chan->file.refcnt);
827 file->private_data = &chan->file;
830 spin_unlock_bh(&all_channels_lock);
839 static struct file_operations ppp_device_fops = {
840 .owner = THIS_MODULE,
846 .release = ppp_release
849 #define PPP_MAJOR 108
851 /* Called at boot time if ppp is compiled into the kernel,
852 or at module load time (from init_module) if compiled as a module. */
853 static int __init ppp_init(void)
857 printk(KERN_INFO "PPP generic driver version " PPP_VERSION "\n");
858 err = register_chrdev(PPP_MAJOR, "ppp", &ppp_device_fops);
860 ppp_class = class_create(THIS_MODULE, "ppp");
861 if (IS_ERR(ppp_class)) {
862 err = PTR_ERR(ppp_class);
865 class_device_create(ppp_class, NULL, MKDEV(PPP_MAJOR, 0), NULL, "ppp");
870 printk(KERN_ERR "failed to register PPP device (%d)\n", err);
874 unregister_chrdev(PPP_MAJOR, "ppp");
879 * Network interface unit routines.
882 ppp_start_xmit(struct sk_buff *skb, struct net_device *dev)
884 struct ppp *ppp = (struct ppp *) dev->priv;
888 npi = ethertype_to_npindex(ntohs(skb->protocol));
892 /* Drop, accept or reject the packet */
893 switch (ppp->npmode[npi]) {
897 /* it would be nice to have a way to tell the network
898 system to queue this one up for later. */
905 /* Put the 2-byte PPP protocol number on the front,
906 making sure there is room for the address and control fields. */
907 if (skb_headroom(skb) < PPP_HDRLEN) {
910 ns = alloc_skb(skb->len + dev->hard_header_len, GFP_ATOMIC);
913 skb_reserve(ns, dev->hard_header_len);
914 skb_copy_bits(skb, 0, skb_put(ns, skb->len), skb->len);
918 pp = skb_push(skb, 2);
919 proto = npindex_to_proto[npi];
923 netif_stop_queue(dev);
924 skb_queue_tail(&ppp->file.xq, skb);
925 ppp_xmit_process(ppp);
930 ++ppp->stats.tx_dropped;
934 static struct net_device_stats *
935 ppp_net_stats(struct net_device *dev)
937 struct ppp *ppp = (struct ppp *) dev->priv;
943 ppp_net_ioctl(struct net_device *dev, struct ifreq *ifr, int cmd)
945 struct ppp *ppp = dev->priv;
947 void __user *addr = (void __user *) ifr->ifr_ifru.ifru_data;
948 struct ppp_stats stats;
949 struct ppp_comp_stats cstats;
954 ppp_get_stats(ppp, &stats);
955 if (copy_to_user(addr, &stats, sizeof(stats)))
961 memset(&cstats, 0, sizeof(cstats));
962 if (ppp->xc_state != 0)
963 ppp->xcomp->comp_stat(ppp->xc_state, &cstats.c);
964 if (ppp->rc_state != 0)
965 ppp->rcomp->decomp_stat(ppp->rc_state, &cstats.d);
966 if (copy_to_user(addr, &cstats, sizeof(cstats)))
973 if (copy_to_user(addr, vers, strlen(vers) + 1))
985 static void ppp_setup(struct net_device *dev)
987 dev->hard_header_len = PPP_HDRLEN;
990 dev->tx_queue_len = 3;
991 dev->type = ARPHRD_PPP;
992 dev->flags = IFF_POINTOPOINT | IFF_NOARP | IFF_MULTICAST;
996 * Transmit-side routines.
1000 * Called to do any work queued up on the transmit side
1001 * that can now be done.
1004 ppp_xmit_process(struct ppp *ppp)
1006 struct sk_buff *skb;
1009 if (ppp->dev != 0) {
1011 while (ppp->xmit_pending == 0
1012 && (skb = skb_dequeue(&ppp->file.xq)) != 0)
1013 ppp_send_frame(ppp, skb);
1014 /* If there's no work left to do, tell the core net
1015 code that we can accept some more. */
1016 if (ppp->xmit_pending == 0 && skb_peek(&ppp->file.xq) == 0)
1017 netif_wake_queue(ppp->dev);
1019 ppp_xmit_unlock(ppp);
1022 static inline struct sk_buff *
1023 pad_compress_skb(struct ppp *ppp, struct sk_buff *skb)
1025 struct sk_buff *new_skb;
1027 int new_skb_size = ppp->dev->mtu +
1028 ppp->xcomp->comp_extra + ppp->dev->hard_header_len;
1029 int compressor_skb_size = ppp->dev->mtu +
1030 ppp->xcomp->comp_extra + PPP_HDRLEN;
1031 new_skb = alloc_skb(new_skb_size, GFP_ATOMIC);
1033 if (net_ratelimit())
1034 printk(KERN_ERR "PPP: no memory (comp pkt)\n");
1037 if (ppp->dev->hard_header_len > PPP_HDRLEN)
1038 skb_reserve(new_skb,
1039 ppp->dev->hard_header_len - PPP_HDRLEN);
1041 /* compressor still expects A/C bytes in hdr */
1042 len = ppp->xcomp->compress(ppp->xc_state, skb->data - 2,
1043 new_skb->data, skb->len + 2,
1044 compressor_skb_size);
1045 if (len > 0 && (ppp->flags & SC_CCP_UP)) {
1049 skb_pull(skb, 2); /* pull off A/C bytes */
1050 } else if (len == 0) {
1051 /* didn't compress, or CCP not up yet */
1057 * MPPE requires that we do not send unencrypted
1058 * frames. The compressor will return -1 if we
1059 * should drop the frame. We cannot simply test
1060 * the compress_proto because MPPE and MPPC share
1063 if (net_ratelimit())
1064 printk(KERN_ERR "ppp: compressor dropped pkt\n");
1073 * Compress and send a frame.
1074 * The caller should have locked the xmit path,
1075 * and xmit_pending should be 0.
1078 ppp_send_frame(struct ppp *ppp, struct sk_buff *skb)
1080 int proto = PPP_PROTO(skb);
1081 struct sk_buff *new_skb;
1085 if (proto < 0x8000) {
1086 #ifdef CONFIG_PPP_FILTER
1087 /* check if we should pass this packet */
1088 /* the filter instructions are constructed assuming
1089 a four-byte PPP header on each packet */
1090 *skb_push(skb, 2) = 1;
1091 if (ppp->pass_filter
1092 && sk_run_filter(skb, ppp->pass_filter,
1093 ppp->pass_len) == 0) {
1095 printk(KERN_DEBUG "PPP: outbound frame not passed\n");
1099 /* if this packet passes the active filter, record the time */
1100 if (!(ppp->active_filter
1101 && sk_run_filter(skb, ppp->active_filter,
1102 ppp->active_len) == 0))
1103 ppp->last_xmit = jiffies;
1106 /* for data packets, record the time */
1107 ppp->last_xmit = jiffies;
1108 #endif /* CONFIG_PPP_FILTER */
1111 ++ppp->stats.tx_packets;
1112 ppp->stats.tx_bytes += skb->len - 2;
1116 if (ppp->vj == 0 || (ppp->flags & SC_COMP_TCP) == 0)
1118 /* try to do VJ TCP header compression */
1119 new_skb = alloc_skb(skb->len + ppp->dev->hard_header_len - 2,
1122 printk(KERN_ERR "PPP: no memory (VJ comp pkt)\n");
1125 skb_reserve(new_skb, ppp->dev->hard_header_len - 2);
1127 len = slhc_compress(ppp->vj, cp, skb->len - 2,
1128 new_skb->data + 2, &cp,
1129 !(ppp->flags & SC_NO_TCP_CCID));
1130 if (cp == skb->data + 2) {
1131 /* didn't compress */
1134 if (cp[0] & SL_TYPE_COMPRESSED_TCP) {
1135 proto = PPP_VJC_COMP;
1136 cp[0] &= ~SL_TYPE_COMPRESSED_TCP;
1138 proto = PPP_VJC_UNCOMP;
1139 cp[0] = skb->data[2];
1143 cp = skb_put(skb, len + 2);
1150 /* peek at outbound CCP frames */
1151 ppp_ccp_peek(ppp, skb, 0);
1155 /* try to do packet compression */
1156 if ((ppp->xstate & SC_COMP_RUN) && ppp->xc_state != 0
1157 && proto != PPP_LCP && proto != PPP_CCP) {
1158 if (!(ppp->flags & SC_CCP_UP) && (ppp->flags & SC_MUST_COMP)) {
1159 if (net_ratelimit())
1160 printk(KERN_ERR "ppp: compression required but down - pkt dropped.\n");
1163 skb = pad_compress_skb(ppp, skb);
1169 * If we are waiting for traffic (demand dialling),
1170 * queue it up for pppd to receive.
1172 if (ppp->flags & SC_LOOP_TRAFFIC) {
1173 if (ppp->file.rq.qlen > PPP_MAX_RQLEN)
1175 skb_queue_tail(&ppp->file.rq, skb);
1176 wake_up_interruptible(&ppp->file.rwait);
1180 ppp->xmit_pending = skb;
1187 ++ppp->stats.tx_errors;
1191 * Try to send the frame in xmit_pending.
1192 * The caller should have the xmit path locked.
1195 ppp_push(struct ppp *ppp)
1197 struct list_head *list;
1198 struct channel *pch;
1199 struct sk_buff *skb = ppp->xmit_pending;
1204 list = &ppp->channels;
1205 if (list_empty(list)) {
1206 /* nowhere to send the packet, just drop it */
1207 ppp->xmit_pending = NULL;
1212 if ((ppp->flags & SC_MULTILINK) == 0) {
1213 /* not doing multilink: send it down the first channel */
1215 pch = list_entry(list, struct channel, clist);
1217 spin_lock_bh(&pch->downl);
1219 if (pch->chan->ops->start_xmit(pch->chan, skb))
1220 ppp->xmit_pending = NULL;
1222 /* channel got unregistered */
1224 ppp->xmit_pending = NULL;
1226 spin_unlock_bh(&pch->downl);
1230 #ifdef CONFIG_PPP_MULTILINK
1231 /* Multilink: fragment the packet over as many links
1232 as can take the packet at the moment. */
1233 if (!ppp_mp_explode(ppp, skb))
1235 #endif /* CONFIG_PPP_MULTILINK */
1237 ppp->xmit_pending = NULL;
1241 #ifdef CONFIG_PPP_MULTILINK
1243 * Divide a packet to be transmitted into fragments and
1244 * send them out the individual links.
1246 static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb)
1249 int i, bits, hdrlen, mtu;
1253 unsigned char *p, *q;
1254 struct list_head *list;
1255 struct channel *pch;
1256 struct sk_buff *frag;
1257 struct ppp_channel *chan;
1259 nfree = 0; /* # channels which have no packet already queued */
1260 navail = 0; /* total # of usable channels (not deregistered) */
1261 hdrlen = (ppp->flags & SC_MP_XSHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1263 list_for_each_entry(pch, &ppp->channels, clist) {
1264 navail += pch->avail = (pch->chan != NULL);
1266 if (skb_queue_empty(&pch->file.xq) ||
1271 if (!pch->had_frag && i < ppp->nxchan)
1278 * Don't start sending this packet unless at least half of
1279 * the channels are free. This gives much better TCP
1280 * performance if we have a lot of channels.
1282 if (nfree == 0 || nfree < navail / 2)
1283 return 0; /* can't take now, leave it in xmit_pending */
1285 /* Do protocol field compression (XXX this should be optional) */
1294 * Decide on fragment size.
1295 * We create a fragment for each free channel regardless of
1296 * how small they are (i.e. even 0 length) in order to minimize
1297 * the time that it will take to detect when a channel drops
1302 fragsize = ROUNDUP(fragsize, nfree);
1303 /* nbigger channels get fragsize bytes, the rest get fragsize-1,
1304 except if nbigger==0, then they all get fragsize. */
1305 nbigger = len % nfree;
1307 /* skip to the channel after the one we last used
1308 and start at that one */
1309 list = &ppp->channels;
1310 for (i = 0; i < ppp->nxchan; ++i) {
1312 if (list == &ppp->channels) {
1318 /* create a fragment for each channel */
1320 while (nfree > 0 || len > 0) {
1322 if (list == &ppp->channels) {
1326 pch = list_entry(list, struct channel, clist);
1332 * Skip this channel if it has a fragment pending already and
1333 * we haven't given a fragment to all of the free channels.
1335 if (pch->avail == 1) {
1343 /* check the channel's mtu and whether it is still attached. */
1344 spin_lock_bh(&pch->downl);
1345 if (pch->chan == NULL) {
1346 /* can't use this channel, it's being deregistered */
1347 spin_unlock_bh(&pch->downl);
1355 * Create a fragment for this channel of
1356 * min(max(mtu+2-hdrlen, 4), fragsize, len) bytes.
1357 * If mtu+2-hdrlen < 4, that is a ridiculously small
1358 * MTU, so we use mtu = 2 + hdrlen.
1363 mtu = pch->chan->mtu + 2 - hdrlen;
1368 if (flen == len && nfree == 0)
1370 frag = alloc_skb(flen + hdrlen + (flen == 0), GFP_ATOMIC);
1373 q = skb_put(frag, flen + hdrlen);
1375 /* make the MP header */
1378 if (ppp->flags & SC_MP_XSHORTSEQ) {
1379 q[2] = bits + ((ppp->nxseq >> 8) & 0xf);
1383 q[3] = ppp->nxseq >> 16;
1384 q[4] = ppp->nxseq >> 8;
1390 * Unfortunately there is a bug in older versions of
1391 * the Linux PPP multilink reconstruction code where it
1392 * drops 0-length fragments. Therefore we make sure the
1393 * fragment has at least one byte of data. Any bytes
1394 * we add in this situation will end up as padding on the
1395 * end of the reconstructed packet.
1398 *skb_put(frag, 1) = 0;
1400 memcpy(q + hdrlen, p, flen);
1402 /* try to send it down the channel */
1404 if (!skb_queue_empty(&pch->file.xq) ||
1405 !chan->ops->start_xmit(chan, frag))
1406 skb_queue_tail(&pch->file.xq, frag);
1412 spin_unlock_bh(&pch->downl);
1414 if (--nbigger == 0 && fragsize > 0)
1422 spin_unlock_bh(&pch->downl);
1424 printk(KERN_ERR "PPP: no memory (fragment)\n");
1425 ++ppp->stats.tx_errors;
1427 return 1; /* abandon the frame */
1429 #endif /* CONFIG_PPP_MULTILINK */
1432 * Try to send data out on a channel.
1435 ppp_channel_push(struct channel *pch)
1437 struct sk_buff *skb;
1440 spin_lock_bh(&pch->downl);
1441 if (pch->chan != 0) {
1442 while (!skb_queue_empty(&pch->file.xq)) {
1443 skb = skb_dequeue(&pch->file.xq);
1444 if (!pch->chan->ops->start_xmit(pch->chan, skb)) {
1445 /* put the packet back and try again later */
1446 skb_queue_head(&pch->file.xq, skb);
1451 /* channel got deregistered */
1452 skb_queue_purge(&pch->file.xq);
1454 spin_unlock_bh(&pch->downl);
1455 /* see if there is anything from the attached unit to be sent */
1456 if (skb_queue_empty(&pch->file.xq)) {
1457 read_lock_bh(&pch->upl);
1460 ppp_xmit_process(ppp);
1461 read_unlock_bh(&pch->upl);
1466 * Receive-side routines.
1469 /* misuse a few fields of the skb for MP reconstruction */
1470 #define sequence priority
1471 #define BEbits cb[0]
1474 ppp_do_recv(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1477 /* ppp->dev == 0 means interface is closing down */
1479 ppp_receive_frame(ppp, skb, pch);
1482 ppp_recv_unlock(ppp);
1486 ppp_input(struct ppp_channel *chan, struct sk_buff *skb)
1488 struct channel *pch = chan->ppp;
1491 if (pch == 0 || skb->len == 0) {
1496 proto = PPP_PROTO(skb);
1497 read_lock_bh(&pch->upl);
1498 if (pch->ppp == 0 || proto >= 0xc000 || proto == PPP_CCPFRAG) {
1499 /* put it on the channel queue */
1500 skb_queue_tail(&pch->file.rq, skb);
1501 /* drop old frames if queue too long */
1502 while (pch->file.rq.qlen > PPP_MAX_RQLEN
1503 && (skb = skb_dequeue(&pch->file.rq)) != 0)
1505 wake_up_interruptible(&pch->file.rwait);
1507 ppp_do_recv(pch->ppp, skb, pch);
1509 read_unlock_bh(&pch->upl);
1512 /* Put a 0-length skb in the receive queue as an error indication */
1514 ppp_input_error(struct ppp_channel *chan, int code)
1516 struct channel *pch = chan->ppp;
1517 struct sk_buff *skb;
1522 read_lock_bh(&pch->upl);
1523 if (pch->ppp != 0) {
1524 skb = alloc_skb(0, GFP_ATOMIC);
1526 skb->len = 0; /* probably unnecessary */
1528 ppp_do_recv(pch->ppp, skb, pch);
1531 read_unlock_bh(&pch->upl);
1535 * We come in here to process a received frame.
1536 * The receive side of the ppp unit is locked.
1539 ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1541 if (skb->len >= 2) {
1542 #ifdef CONFIG_PPP_MULTILINK
1543 /* XXX do channel-level decompression here */
1544 if (PPP_PROTO(skb) == PPP_MP)
1545 ppp_receive_mp_frame(ppp, skb, pch);
1547 #endif /* CONFIG_PPP_MULTILINK */
1548 ppp_receive_nonmp_frame(ppp, skb);
1553 /* note: a 0-length skb is used as an error indication */
1554 ++ppp->stats.rx_length_errors;
1557 ppp_receive_error(ppp);
1561 ppp_receive_error(struct ppp *ppp)
1563 ++ppp->stats.rx_errors;
1569 ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb)
1572 int proto, len, npi;
1575 * Decompress the frame, if compressed.
1576 * Note that some decompressors need to see uncompressed frames
1577 * that come in as well as compressed frames.
1579 if (ppp->rc_state != 0 && (ppp->rstate & SC_DECOMP_RUN)
1580 && (ppp->rstate & (SC_DC_FERROR | SC_DC_ERROR)) == 0)
1581 skb = ppp_decompress_frame(ppp, skb);
1583 if (ppp->flags & SC_MUST_COMP && ppp->rstate & SC_DC_FERROR)
1586 proto = PPP_PROTO(skb);
1589 /* decompress VJ compressed packets */
1590 if (ppp->vj == 0 || (ppp->flags & SC_REJ_COMP_TCP))
1593 if (skb_tailroom(skb) < 124) {
1594 /* copy to a new sk_buff with more tailroom */
1595 ns = dev_alloc_skb(skb->len + 128);
1597 printk(KERN_ERR"PPP: no memory (VJ decomp)\n");
1601 skb_copy_bits(skb, 0, skb_put(ns, skb->len), skb->len);
1606 skb->ip_summed = CHECKSUM_NONE;
1608 len = slhc_uncompress(ppp->vj, skb->data + 2, skb->len - 2);
1610 printk(KERN_DEBUG "PPP: VJ decompression error\n");
1615 skb_put(skb, len - skb->len);
1616 else if (len < skb->len)
1621 case PPP_VJC_UNCOMP:
1622 if (ppp->vj == 0 || (ppp->flags & SC_REJ_COMP_TCP))
1625 /* Until we fix the decompressor need to make sure
1626 * data portion is linear.
1628 if (!pskb_may_pull(skb, skb->len))
1631 if (slhc_remember(ppp->vj, skb->data + 2, skb->len - 2) <= 0) {
1632 printk(KERN_ERR "PPP: VJ uncompressed error\n");
1639 ppp_ccp_peek(ppp, skb, 1);
1643 ++ppp->stats.rx_packets;
1644 ppp->stats.rx_bytes += skb->len - 2;
1646 npi = proto_to_npindex(proto);
1648 /* control or unknown frame - pass it to pppd */
1649 skb_queue_tail(&ppp->file.rq, skb);
1650 /* limit queue length by dropping old frames */
1651 while (ppp->file.rq.qlen > PPP_MAX_RQLEN
1652 && (skb = skb_dequeue(&ppp->file.rq)) != 0)
1654 /* wake up any process polling or blocking on read */
1655 wake_up_interruptible(&ppp->file.rwait);
1658 /* network protocol frame - give it to the kernel */
1660 #ifdef CONFIG_PPP_FILTER
1661 /* check if the packet passes the pass and active filters */
1662 /* the filter instructions are constructed assuming
1663 a four-byte PPP header on each packet */
1664 *skb_push(skb, 2) = 0;
1665 if (ppp->pass_filter
1666 && sk_run_filter(skb, ppp->pass_filter,
1667 ppp->pass_len) == 0) {
1669 printk(KERN_DEBUG "PPP: inbound frame not passed\n");
1673 if (!(ppp->active_filter
1674 && sk_run_filter(skb, ppp->active_filter,
1675 ppp->active_len) == 0))
1676 ppp->last_recv = jiffies;
1679 ppp->last_recv = jiffies;
1680 #endif /* CONFIG_PPP_FILTER */
1682 if ((ppp->dev->flags & IFF_UP) == 0
1683 || ppp->npmode[npi] != NPMODE_PASS) {
1686 /* chop off protocol */
1687 skb_pull_rcsum(skb, 2);
1688 skb->dev = ppp->dev;
1689 skb->protocol = htons(npindex_to_ethertype[npi]);
1690 skb->mac.raw = skb->data;
1692 ppp->dev->last_rx = jiffies;
1699 ppp_receive_error(ppp);
1702 static struct sk_buff *
1703 ppp_decompress_frame(struct ppp *ppp, struct sk_buff *skb)
1705 int proto = PPP_PROTO(skb);
1709 /* Until we fix all the decompressor's need to make sure
1710 * data portion is linear.
1712 if (!pskb_may_pull(skb, skb->len))
1715 if (proto == PPP_COMP) {
1716 ns = dev_alloc_skb(ppp->mru + PPP_HDRLEN);
1718 printk(KERN_ERR "ppp_decompress_frame: no memory\n");
1721 /* the decompressor still expects the A/C bytes in the hdr */
1722 len = ppp->rcomp->decompress(ppp->rc_state, skb->data - 2,
1723 skb->len + 2, ns->data, ppp->mru + PPP_HDRLEN);
1725 /* Pass the compressed frame to pppd as an
1726 error indication. */
1727 if (len == DECOMP_FATALERROR)
1728 ppp->rstate |= SC_DC_FERROR;
1736 skb_pull(skb, 2); /* pull off the A/C bytes */
1739 /* Uncompressed frame - pass to decompressor so it
1740 can update its dictionary if necessary. */
1741 if (ppp->rcomp->incomp)
1742 ppp->rcomp->incomp(ppp->rc_state, skb->data - 2,
1749 ppp->rstate |= SC_DC_ERROR;
1750 ppp_receive_error(ppp);
1754 #ifdef CONFIG_PPP_MULTILINK
1756 * Receive a multilink frame.
1757 * We put it on the reconstruction queue and then pull off
1758 * as many completed frames as we can.
1761 ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1765 int mphdrlen = (ppp->flags & SC_MP_SHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1767 if (!pskb_may_pull(skb, mphdrlen) || ppp->mrru == 0)
1768 goto err; /* no good, throw it away */
1770 /* Decode sequence number and begin/end bits */
1771 if (ppp->flags & SC_MP_SHORTSEQ) {
1772 seq = ((skb->data[2] & 0x0f) << 8) | skb->data[3];
1775 seq = (skb->data[3] << 16) | (skb->data[4] << 8)| skb->data[5];
1778 skb->BEbits = skb->data[2];
1779 skb_pull(skb, mphdrlen); /* pull off PPP and MP headers */
1782 * Do protocol ID decompression on the first fragment of each packet.
1784 if ((skb->BEbits & B) && (skb->data[0] & 1))
1785 *skb_push(skb, 1) = 0;
1788 * Expand sequence number to 32 bits, making it as close
1789 * as possible to ppp->minseq.
1791 seq |= ppp->minseq & ~mask;
1792 if ((int)(ppp->minseq - seq) > (int)(mask >> 1))
1794 else if ((int)(seq - ppp->minseq) > (int)(mask >> 1))
1795 seq -= mask + 1; /* should never happen */
1796 skb->sequence = seq;
1800 * If this packet comes before the next one we were expecting,
1803 if (seq_before(seq, ppp->nextseq)) {
1805 ++ppp->stats.rx_dropped;
1806 ppp_receive_error(ppp);
1811 * Reevaluate minseq, the minimum over all channels of the
1812 * last sequence number received on each channel. Because of
1813 * the increasing sequence number rule, we know that any fragment
1814 * before `minseq' which hasn't arrived is never going to arrive.
1815 * The list of channels can't change because we have the receive
1816 * side of the ppp unit locked.
1818 list_for_each_entry(ch, &ppp->channels, clist) {
1819 if (seq_before(ch->lastseq, seq))
1822 if (seq_before(ppp->minseq, seq))
1825 /* Put the fragment on the reconstruction queue */
1826 ppp_mp_insert(ppp, skb);
1828 /* If the queue is getting long, don't wait any longer for packets
1829 before the start of the queue. */
1830 if (skb_queue_len(&ppp->mrq) >= PPP_MP_MAX_QLEN
1831 && seq_before(ppp->minseq, ppp->mrq.next->sequence))
1832 ppp->minseq = ppp->mrq.next->sequence;
1834 /* Pull completed packets off the queue and receive them. */
1835 while ((skb = ppp_mp_reconstruct(ppp)) != 0)
1836 ppp_receive_nonmp_frame(ppp, skb);
1842 ppp_receive_error(ppp);
1846 * Insert a fragment on the MP reconstruction queue.
1847 * The queue is ordered by increasing sequence number.
1850 ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb)
1853 struct sk_buff_head *list = &ppp->mrq;
1854 u32 seq = skb->sequence;
1856 /* N.B. we don't need to lock the list lock because we have the
1857 ppp unit receive-side lock. */
1858 for (p = list->next; p != (struct sk_buff *)list; p = p->next)
1859 if (seq_before(seq, p->sequence))
1861 __skb_insert(skb, p->prev, p, list);
1865 * Reconstruct a packet from the MP fragment queue.
1866 * We go through increasing sequence numbers until we find a
1867 * complete packet, or we get to the sequence number for a fragment
1868 * which hasn't arrived but might still do so.
1871 ppp_mp_reconstruct(struct ppp *ppp)
1873 u32 seq = ppp->nextseq;
1874 u32 minseq = ppp->minseq;
1875 struct sk_buff_head *list = &ppp->mrq;
1876 struct sk_buff *p, *next;
1877 struct sk_buff *head, *tail;
1878 struct sk_buff *skb = NULL;
1879 int lost = 0, len = 0;
1881 if (ppp->mrru == 0) /* do nothing until mrru is set */
1885 for (p = head; p != (struct sk_buff *) list; p = next) {
1887 if (seq_before(p->sequence, seq)) {
1888 /* this can't happen, anyway ignore the skb */
1889 printk(KERN_ERR "ppp_mp_reconstruct bad seq %u < %u\n",
1894 if (p->sequence != seq) {
1895 /* Fragment `seq' is missing. If it is after
1896 minseq, it might arrive later, so stop here. */
1897 if (seq_after(seq, minseq))
1899 /* Fragment `seq' is lost, keep going. */
1901 seq = seq_before(minseq, p->sequence)?
1902 minseq + 1: p->sequence;
1908 * At this point we know that all the fragments from
1909 * ppp->nextseq to seq are either present or lost.
1910 * Also, there are no complete packets in the queue
1911 * that have no missing fragments and end before this
1915 /* B bit set indicates this fragment starts a packet */
1916 if (p->BEbits & B) {
1924 /* Got a complete packet yet? */
1925 if (lost == 0 && (p->BEbits & E) && (head->BEbits & B)) {
1926 if (len > ppp->mrru + 2) {
1927 ++ppp->stats.rx_length_errors;
1928 printk(KERN_DEBUG "PPP: reconstructed packet"
1929 " is too long (%d)\n", len);
1930 } else if (p == head) {
1931 /* fragment is complete packet - reuse skb */
1935 } else if ((skb = dev_alloc_skb(len)) == NULL) {
1936 ++ppp->stats.rx_missed_errors;
1937 printk(KERN_DEBUG "PPP: no memory for "
1938 "reconstructed packet");
1943 ppp->nextseq = seq + 1;
1947 * If this is the ending fragment of a packet,
1948 * and we haven't found a complete valid packet yet,
1949 * we can discard up to and including this fragment.
1957 /* If we have a complete packet, copy it all into one skb. */
1959 /* If we have discarded any fragments,
1960 signal a receive error. */
1961 if (head->sequence != ppp->nextseq) {
1963 printk(KERN_DEBUG " missed pkts %u..%u\n",
1964 ppp->nextseq, head->sequence-1);
1965 ++ppp->stats.rx_dropped;
1966 ppp_receive_error(ppp);
1970 /* copy to a single skb */
1971 for (p = head; p != tail->next; p = p->next)
1972 skb_copy_bits(p, 0, skb_put(skb, p->len), p->len);
1973 ppp->nextseq = tail->sequence + 1;
1977 /* Discard all the skbuffs that we have copied the data out of
1978 or that we can't use. */
1979 while ((p = list->next) != head) {
1980 __skb_unlink(p, list);
1986 #endif /* CONFIG_PPP_MULTILINK */
1989 * Channel interface.
1993 * Create a new, unattached ppp channel.
1996 ppp_register_channel(struct ppp_channel *chan)
1998 struct channel *pch;
2000 pch = kmalloc(sizeof(struct channel), GFP_KERNEL);
2003 memset(pch, 0, sizeof(struct channel));
2007 init_ppp_file(&pch->file, CHANNEL);
2008 pch->file.hdrlen = chan->hdrlen;
2009 #ifdef CONFIG_PPP_MULTILINK
2011 #endif /* CONFIG_PPP_MULTILINK */
2012 init_rwsem(&pch->chan_sem);
2013 spin_lock_init(&pch->downl);
2014 rwlock_init(&pch->upl);
2015 spin_lock_bh(&all_channels_lock);
2016 pch->file.index = ++last_channel_index;
2017 list_add(&pch->list, &new_channels);
2018 atomic_inc(&channel_count);
2019 spin_unlock_bh(&all_channels_lock);
2024 * Return the index of a channel.
2026 int ppp_channel_index(struct ppp_channel *chan)
2028 struct channel *pch = chan->ppp;
2031 return pch->file.index;
2036 * Return the PPP unit number to which a channel is connected.
2038 int ppp_unit_number(struct ppp_channel *chan)
2040 struct channel *pch = chan->ppp;
2044 read_lock_bh(&pch->upl);
2046 unit = pch->ppp->file.index;
2047 read_unlock_bh(&pch->upl);
2053 * Disconnect a channel from the generic layer.
2054 * This must be called in process context.
2057 ppp_unregister_channel(struct ppp_channel *chan)
2059 struct channel *pch = chan->ppp;
2062 return; /* should never happen */
2066 * This ensures that we have returned from any calls into the
2067 * the channel's start_xmit or ioctl routine before we proceed.
2069 down_write(&pch->chan_sem);
2070 spin_lock_bh(&pch->downl);
2072 spin_unlock_bh(&pch->downl);
2073 up_write(&pch->chan_sem);
2074 ppp_disconnect_channel(pch);
2075 spin_lock_bh(&all_channels_lock);
2076 list_del(&pch->list);
2077 spin_unlock_bh(&all_channels_lock);
2079 wake_up_interruptible(&pch->file.rwait);
2080 if (atomic_dec_and_test(&pch->file.refcnt))
2081 ppp_destroy_channel(pch);
2085 * Callback from a channel when it can accept more to transmit.
2086 * This should be called at BH/softirq level, not interrupt level.
2089 ppp_output_wakeup(struct ppp_channel *chan)
2091 struct channel *pch = chan->ppp;
2095 ppp_channel_push(pch);
2099 * Compression control.
2102 /* Process the PPPIOCSCOMPRESS ioctl. */
2104 ppp_set_compress(struct ppp *ppp, unsigned long arg)
2107 struct compressor *cp, *ocomp;
2108 struct ppp_option_data data;
2109 void *state, *ostate;
2110 unsigned char ccp_option[CCP_MAX_OPTION_LENGTH];
2113 if (copy_from_user(&data, (void __user *) arg, sizeof(data))
2114 || (data.length <= CCP_MAX_OPTION_LENGTH
2115 && copy_from_user(ccp_option, (void __user *) data.ptr, data.length)))
2118 if (data.length > CCP_MAX_OPTION_LENGTH
2119 || ccp_option[1] < 2 || ccp_option[1] > data.length)
2122 cp = find_compressor(ccp_option[0]);
2125 request_module("ppp-compress-%d", ccp_option[0]);
2126 cp = find_compressor(ccp_option[0]);
2128 #endif /* CONFIG_KMOD */
2133 if (data.transmit) {
2134 state = cp->comp_alloc(ccp_option, data.length);
2137 ppp->xstate &= ~SC_COMP_RUN;
2139 ostate = ppp->xc_state;
2141 ppp->xc_state = state;
2142 ppp_xmit_unlock(ppp);
2144 ocomp->comp_free(ostate);
2145 module_put(ocomp->owner);
2149 module_put(cp->owner);
2152 state = cp->decomp_alloc(ccp_option, data.length);
2155 ppp->rstate &= ~SC_DECOMP_RUN;
2157 ostate = ppp->rc_state;
2159 ppp->rc_state = state;
2160 ppp_recv_unlock(ppp);
2162 ocomp->decomp_free(ostate);
2163 module_put(ocomp->owner);
2167 module_put(cp->owner);
2175 * Look at a CCP packet and update our state accordingly.
2176 * We assume the caller has the xmit or recv path locked.
2179 ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound)
2184 if (!pskb_may_pull(skb, CCP_HDRLEN + 2))
2185 return; /* no header */
2188 switch (CCP_CODE(dp)) {
2191 /* A ConfReq starts negotiation of compression
2192 * in one direction of transmission,
2193 * and hence brings it down...but which way?
2196 * A ConfReq indicates what the sender would like to receive
2199 /* He is proposing what I should send */
2200 ppp->xstate &= ~SC_COMP_RUN;
2202 /* I am proposing to what he should send */
2203 ppp->rstate &= ~SC_DECOMP_RUN;
2210 * CCP is going down, both directions of transmission
2212 ppp->rstate &= ~SC_DECOMP_RUN;
2213 ppp->xstate &= ~SC_COMP_RUN;
2217 if ((ppp->flags & (SC_CCP_OPEN | SC_CCP_UP)) != SC_CCP_OPEN)
2219 len = CCP_LENGTH(dp);
2220 if (!pskb_may_pull(skb, len + 2))
2221 return; /* too short */
2224 if (len < CCP_OPT_MINLEN || len < CCP_OPT_LENGTH(dp))
2227 /* we will start receiving compressed packets */
2228 if (ppp->rc_state == 0)
2230 if (ppp->rcomp->decomp_init(ppp->rc_state, dp, len,
2231 ppp->file.index, 0, ppp->mru, ppp->debug)) {
2232 ppp->rstate |= SC_DECOMP_RUN;
2233 ppp->rstate &= ~(SC_DC_ERROR | SC_DC_FERROR);
2236 /* we will soon start sending compressed packets */
2237 if (ppp->xc_state == 0)
2239 if (ppp->xcomp->comp_init(ppp->xc_state, dp, len,
2240 ppp->file.index, 0, ppp->debug))
2241 ppp->xstate |= SC_COMP_RUN;
2246 /* reset the [de]compressor */
2247 if ((ppp->flags & SC_CCP_UP) == 0)
2250 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN)) {
2251 ppp->rcomp->decomp_reset(ppp->rc_state);
2252 ppp->rstate &= ~SC_DC_ERROR;
2255 if (ppp->xc_state && (ppp->xstate & SC_COMP_RUN))
2256 ppp->xcomp->comp_reset(ppp->xc_state);
2262 /* Free up compression resources. */
2264 ppp_ccp_closed(struct ppp *ppp)
2266 void *xstate, *rstate;
2267 struct compressor *xcomp, *rcomp;
2270 ppp->flags &= ~(SC_CCP_OPEN | SC_CCP_UP);
2273 xstate = ppp->xc_state;
2274 ppp->xc_state = NULL;
2277 rstate = ppp->rc_state;
2278 ppp->rc_state = NULL;
2282 xcomp->comp_free(xstate);
2283 module_put(xcomp->owner);
2286 rcomp->decomp_free(rstate);
2287 module_put(rcomp->owner);
2291 /* List of compressors. */
2292 static LIST_HEAD(compressor_list);
2293 static DEFINE_SPINLOCK(compressor_list_lock);
2295 struct compressor_entry {
2296 struct list_head list;
2297 struct compressor *comp;
2300 static struct compressor_entry *
2301 find_comp_entry(int proto)
2303 struct compressor_entry *ce;
2305 list_for_each_entry(ce, &compressor_list, list) {
2306 if (ce->comp->compress_proto == proto)
2312 /* Register a compressor */
2314 ppp_register_compressor(struct compressor *cp)
2316 struct compressor_entry *ce;
2318 spin_lock(&compressor_list_lock);
2320 if (find_comp_entry(cp->compress_proto) != 0)
2323 ce = kmalloc(sizeof(struct compressor_entry), GFP_ATOMIC);
2328 list_add(&ce->list, &compressor_list);
2330 spin_unlock(&compressor_list_lock);
2334 /* Unregister a compressor */
2336 ppp_unregister_compressor(struct compressor *cp)
2338 struct compressor_entry *ce;
2340 spin_lock(&compressor_list_lock);
2341 ce = find_comp_entry(cp->compress_proto);
2342 if (ce != 0 && ce->comp == cp) {
2343 list_del(&ce->list);
2346 spin_unlock(&compressor_list_lock);
2349 /* Find a compressor. */
2350 static struct compressor *
2351 find_compressor(int type)
2353 struct compressor_entry *ce;
2354 struct compressor *cp = NULL;
2356 spin_lock(&compressor_list_lock);
2357 ce = find_comp_entry(type);
2360 if (!try_module_get(cp->owner))
2363 spin_unlock(&compressor_list_lock);
2368 * Miscelleneous stuff.
2372 ppp_get_stats(struct ppp *ppp, struct ppp_stats *st)
2374 struct slcompress *vj = ppp->vj;
2376 memset(st, 0, sizeof(*st));
2377 st->p.ppp_ipackets = ppp->stats.rx_packets;
2378 st->p.ppp_ierrors = ppp->stats.rx_errors;
2379 st->p.ppp_ibytes = ppp->stats.rx_bytes;
2380 st->p.ppp_opackets = ppp->stats.tx_packets;
2381 st->p.ppp_oerrors = ppp->stats.tx_errors;
2382 st->p.ppp_obytes = ppp->stats.tx_bytes;
2385 st->vj.vjs_packets = vj->sls_o_compressed + vj->sls_o_uncompressed;
2386 st->vj.vjs_compressed = vj->sls_o_compressed;
2387 st->vj.vjs_searches = vj->sls_o_searches;
2388 st->vj.vjs_misses = vj->sls_o_misses;
2389 st->vj.vjs_errorin = vj->sls_i_error;
2390 st->vj.vjs_tossed = vj->sls_i_tossed;
2391 st->vj.vjs_uncompressedin = vj->sls_i_uncompressed;
2392 st->vj.vjs_compressedin = vj->sls_i_compressed;
2396 * Stuff for handling the lists of ppp units and channels
2397 * and for initialization.
2401 * Create a new ppp interface unit. Fails if it can't allocate memory
2402 * or if there is already a unit with the requested number.
2403 * unit == -1 means allocate a new number.
2406 ppp_create_interface(int unit, int *retp)
2409 struct net_device *dev = NULL;
2413 ppp = kmalloc(sizeof(struct ppp), GFP_KERNEL);
2416 dev = alloc_netdev(0, "", ppp_setup);
2419 memset(ppp, 0, sizeof(struct ppp));
2422 init_ppp_file(&ppp->file, INTERFACE);
2423 ppp->file.hdrlen = PPP_HDRLEN - 2; /* don't count proto bytes */
2424 for (i = 0; i < NUM_NP; ++i)
2425 ppp->npmode[i] = NPMODE_PASS;
2426 INIT_LIST_HEAD(&ppp->channels);
2427 spin_lock_init(&ppp->rlock);
2428 spin_lock_init(&ppp->wlock);
2429 #ifdef CONFIG_PPP_MULTILINK
2431 skb_queue_head_init(&ppp->mrq);
2432 #endif /* CONFIG_PPP_MULTILINK */
2436 dev->hard_start_xmit = ppp_start_xmit;
2437 dev->get_stats = ppp_net_stats;
2438 dev->do_ioctl = ppp_net_ioctl;
2441 mutex_lock(&all_ppp_mutex);
2443 unit = cardmap_find_first_free(all_ppp_units);
2444 else if (cardmap_get(all_ppp_units, unit) != NULL)
2445 goto out2; /* unit already exists */
2447 /* Initialize the new ppp unit */
2448 ppp->file.index = unit;
2449 sprintf(dev->name, "ppp%d", unit);
2451 ret = register_netdev(dev);
2453 printk(KERN_ERR "PPP: couldn't register device %s (%d)\n",
2458 atomic_inc(&ppp_unit_count);
2459 cardmap_set(&all_ppp_units, unit, ppp);
2460 mutex_unlock(&all_ppp_mutex);
2465 mutex_unlock(&all_ppp_mutex);
2475 * Initialize a ppp_file structure.
2478 init_ppp_file(struct ppp_file *pf, int kind)
2481 skb_queue_head_init(&pf->xq);
2482 skb_queue_head_init(&pf->rq);
2483 atomic_set(&pf->refcnt, 1);
2484 init_waitqueue_head(&pf->rwait);
2488 * Take down a ppp interface unit - called when the owning file
2489 * (the one that created the unit) is closed or detached.
2491 static void ppp_shutdown_interface(struct ppp *ppp)
2493 struct net_device *dev;
2495 mutex_lock(&all_ppp_mutex);
2500 /* This will call dev_close() for us. */
2502 unregister_netdev(dev);
2505 cardmap_set(&all_ppp_units, ppp->file.index, NULL);
2508 wake_up_interruptible(&ppp->file.rwait);
2509 mutex_unlock(&all_ppp_mutex);
2513 * Free the memory used by a ppp unit. This is only called once
2514 * there are no channels connected to the unit and no file structs
2515 * that reference the unit.
2517 static void ppp_destroy_interface(struct ppp *ppp)
2519 atomic_dec(&ppp_unit_count);
2521 if (!ppp->file.dead || ppp->n_channels) {
2522 /* "can't happen" */
2523 printk(KERN_ERR "ppp: destroying ppp struct %p but dead=%d "
2524 "n_channels=%d !\n", ppp, ppp->file.dead,
2529 ppp_ccp_closed(ppp);
2534 skb_queue_purge(&ppp->file.xq);
2535 skb_queue_purge(&ppp->file.rq);
2536 #ifdef CONFIG_PPP_MULTILINK
2537 skb_queue_purge(&ppp->mrq);
2538 #endif /* CONFIG_PPP_MULTILINK */
2539 #ifdef CONFIG_PPP_FILTER
2540 kfree(ppp->pass_filter);
2541 ppp->pass_filter = NULL;
2542 kfree(ppp->active_filter);
2543 ppp->active_filter = NULL;
2544 #endif /* CONFIG_PPP_FILTER */
2550 * Locate an existing ppp unit.
2551 * The caller should have locked the all_ppp_mutex.
2554 ppp_find_unit(int unit)
2556 return cardmap_get(all_ppp_units, unit);
2560 * Locate an existing ppp channel.
2561 * The caller should have locked the all_channels_lock.
2562 * First we look in the new_channels list, then in the
2563 * all_channels list. If found in the new_channels list,
2564 * we move it to the all_channels list. This is for speed
2565 * when we have a lot of channels in use.
2567 static struct channel *
2568 ppp_find_channel(int unit)
2570 struct channel *pch;
2572 list_for_each_entry(pch, &new_channels, list) {
2573 if (pch->file.index == unit) {
2574 list_move(&pch->list, &all_channels);
2578 list_for_each_entry(pch, &all_channels, list) {
2579 if (pch->file.index == unit)
2586 * Connect a PPP channel to a PPP interface unit.
2589 ppp_connect_channel(struct channel *pch, int unit)
2595 mutex_lock(&all_ppp_mutex);
2596 ppp = ppp_find_unit(unit);
2599 write_lock_bh(&pch->upl);
2605 if (pch->file.hdrlen > ppp->file.hdrlen)
2606 ppp->file.hdrlen = pch->file.hdrlen;
2607 hdrlen = pch->file.hdrlen + 2; /* for protocol bytes */
2608 if (ppp->dev && hdrlen > ppp->dev->hard_header_len)
2609 ppp->dev->hard_header_len = hdrlen;
2610 list_add_tail(&pch->clist, &ppp->channels);
2613 atomic_inc(&ppp->file.refcnt);
2618 write_unlock_bh(&pch->upl);
2620 mutex_unlock(&all_ppp_mutex);
2625 * Disconnect a channel from its ppp unit.
2628 ppp_disconnect_channel(struct channel *pch)
2633 write_lock_bh(&pch->upl);
2636 write_unlock_bh(&pch->upl);
2638 /* remove it from the ppp unit's list */
2640 list_del(&pch->clist);
2641 if (--ppp->n_channels == 0)
2642 wake_up_interruptible(&ppp->file.rwait);
2644 if (atomic_dec_and_test(&ppp->file.refcnt))
2645 ppp_destroy_interface(ppp);
2652 * Free up the resources used by a ppp channel.
2654 static void ppp_destroy_channel(struct channel *pch)
2656 atomic_dec(&channel_count);
2658 if (!pch->file.dead) {
2659 /* "can't happen" */
2660 printk(KERN_ERR "ppp: destroying undead channel %p !\n",
2664 skb_queue_purge(&pch->file.xq);
2665 skb_queue_purge(&pch->file.rq);
2669 static void __exit ppp_cleanup(void)
2671 /* should never happen */
2672 if (atomic_read(&ppp_unit_count) || atomic_read(&channel_count))
2673 printk(KERN_ERR "PPP: removing module but units remain!\n");
2674 cardmap_destroy(&all_ppp_units);
2675 if (unregister_chrdev(PPP_MAJOR, "ppp") != 0)
2676 printk(KERN_ERR "PPP: failed to unregister PPP device\n");
2677 class_device_destroy(ppp_class, MKDEV(PPP_MAJOR, 0));
2678 class_destroy(ppp_class);
2682 * Cardmap implementation.
2684 static void *cardmap_get(struct cardmap *map, unsigned int nr)
2689 for (p = map; p != NULL; ) {
2690 if ((i = nr >> p->shift) >= CARDMAP_WIDTH)
2694 nr &= ~(CARDMAP_MASK << p->shift);
2700 static void cardmap_set(struct cardmap **pmap, unsigned int nr, void *ptr)
2706 if (p == NULL || (nr >> p->shift) >= CARDMAP_WIDTH) {
2708 /* need a new top level */
2709 struct cardmap *np = kmalloc(sizeof(*np), GFP_KERNEL);
2710 memset(np, 0, sizeof(*np));
2713 np->shift = p->shift + CARDMAP_ORDER;
2718 } while ((nr >> p->shift) >= CARDMAP_WIDTH);
2721 while (p->shift > 0) {
2722 i = (nr >> p->shift) & CARDMAP_MASK;
2723 if (p->ptr[i] == NULL) {
2724 struct cardmap *np = kmalloc(sizeof(*np), GFP_KERNEL);
2725 memset(np, 0, sizeof(*np));
2726 np->shift = p->shift - CARDMAP_ORDER;
2731 clear_bit(i, &p->inuse);
2734 i = nr & CARDMAP_MASK;
2737 set_bit(i, &p->inuse);
2739 clear_bit(i, &p->inuse);
2742 static unsigned int cardmap_find_first_free(struct cardmap *map)
2745 unsigned int nr = 0;
2748 if ((p = map) == NULL)
2751 i = find_first_zero_bit(&p->inuse, CARDMAP_WIDTH);
2752 if (i >= CARDMAP_WIDTH) {
2753 if (p->parent == NULL)
2754 return CARDMAP_WIDTH << p->shift;
2756 i = (nr >> p->shift) & CARDMAP_MASK;
2757 set_bit(i, &p->inuse);
2760 nr = (nr & (~CARDMAP_MASK << p->shift)) | (i << p->shift);
2761 if (p->shift == 0 || p->ptr[i] == NULL)
2767 static void cardmap_destroy(struct cardmap **pmap)
2769 struct cardmap *p, *np;
2772 for (p = *pmap; p != NULL; p = np) {
2773 if (p->shift != 0) {
2774 for (i = 0; i < CARDMAP_WIDTH; ++i)
2775 if (p->ptr[i] != NULL)
2777 if (i < CARDMAP_WIDTH) {
2789 /* Module/initialization stuff */
2791 module_init(ppp_init);
2792 module_exit(ppp_cleanup);
2794 EXPORT_SYMBOL(ppp_register_channel);
2795 EXPORT_SYMBOL(ppp_unregister_channel);
2796 EXPORT_SYMBOL(ppp_channel_index);
2797 EXPORT_SYMBOL(ppp_unit_number);
2798 EXPORT_SYMBOL(ppp_input);
2799 EXPORT_SYMBOL(ppp_input_error);
2800 EXPORT_SYMBOL(ppp_output_wakeup);
2801 EXPORT_SYMBOL(ppp_register_compressor);
2802 EXPORT_SYMBOL(ppp_unregister_compressor);
2803 MODULE_LICENSE("GPL");
2804 MODULE_ALIAS_CHARDEV_MAJOR(PPP_MAJOR);
2805 MODULE_ALIAS("/dev/ppp");