1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Generic PPP layer for Linux.
5 * Copyright 1999-2002 Paul Mackerras.
7 * The generic PPP layer handles the PPP network interfaces, the
8 * /dev/ppp device, packet and VJ compression, and multilink.
9 * It talks to PPP `channels' via the interface defined in
10 * include/linux/ppp_channel.h. Channels provide the basic means for
11 * sending and receiving PPP frames on some kind of communications
14 * Part of the code in this driver was inspired by the old async-only
15 * PPP driver, written by Michael Callahan and Al Longyear, and
16 * subsequently hacked by Paul Mackerras.
18 * ==FILEVERSION 20041108==
21 #include <linux/module.h>
22 #include <linux/kernel.h>
23 #include <linux/sched/signal.h>
24 #include <linux/kmod.h>
25 #include <linux/init.h>
26 #include <linux/list.h>
27 #include <linux/idr.h>
28 #include <linux/netdevice.h>
29 #include <linux/poll.h>
30 #include <linux/ppp_defs.h>
31 #include <linux/filter.h>
32 #include <linux/ppp-ioctl.h>
33 #include <linux/ppp_channel.h>
34 #include <linux/ppp-comp.h>
35 #include <linux/skbuff.h>
36 #include <linux/rtnetlink.h>
37 #include <linux/if_arp.h>
39 #include <linux/tcp.h>
40 #include <linux/spinlock.h>
41 #include <linux/rwsem.h>
42 #include <linux/stddef.h>
43 #include <linux/device.h>
44 #include <linux/mutex.h>
45 #include <linux/slab.h>
46 #include <linux/file.h>
47 #include <asm/unaligned.h>
48 #include <net/slhc_vj.h>
49 #include <linux/atomic.h>
50 #include <linux/refcount.h>
52 #include <linux/nsproxy.h>
53 #include <net/net_namespace.h>
54 #include <net/netns/generic.h>
56 #define PPP_VERSION "2.4.2"
59 * Network protocols we support.
61 #define NP_IP 0 /* Internet Protocol V4 */
62 #define NP_IPV6 1 /* Internet Protocol V6 */
63 #define NP_IPX 2 /* IPX protocol */
64 #define NP_AT 3 /* Appletalk protocol */
65 #define NP_MPLS_UC 4 /* MPLS unicast */
66 #define NP_MPLS_MC 5 /* MPLS multicast */
67 #define NUM_NP 6 /* Number of NPs. */
69 #define MPHDRLEN 6 /* multilink protocol header length */
70 #define MPHDRLEN_SSN 4 /* ditto with short sequence numbers */
72 #define PPP_PROTO_LEN 2
75 * An instance of /dev/ppp can be associated with either a ppp
76 * interface unit or a ppp channel. In both cases, file->private_data
77 * points to one of these.
83 struct sk_buff_head xq; /* pppd transmit queue */
84 struct sk_buff_head rq; /* receive queue for pppd */
85 wait_queue_head_t rwait; /* for poll on reading /dev/ppp */
86 refcount_t refcnt; /* # refs (incl /dev/ppp attached) */
87 int hdrlen; /* space to leave for headers */
88 int index; /* interface unit / channel number */
89 int dead; /* unit/channel has been shut down */
92 #define PF_TO_X(pf, X) container_of(pf, X, file)
94 #define PF_TO_PPP(pf) PF_TO_X(pf, struct ppp)
95 #define PF_TO_CHANNEL(pf) PF_TO_X(pf, struct channel)
98 * Data structure to hold primary network stats for which
99 * we want to use 64 bit storage. Other network stats
100 * are stored in dev->stats of the ppp strucute.
102 struct ppp_link_stats {
110 * Data structure describing one ppp unit.
111 * A ppp unit corresponds to a ppp network interface device
112 * and represents a multilink bundle.
113 * It can have 0 or more ppp channels connected to it.
116 struct ppp_file file; /* stuff for read/write/poll 0 */
117 struct file *owner; /* file that owns this unit 48 */
118 struct list_head channels; /* list of attached channels 4c */
119 int n_channels; /* how many channels are attached 54 */
120 spinlock_t rlock; /* lock for receive side 58 */
121 spinlock_t wlock; /* lock for transmit side 5c */
122 int __percpu *xmit_recursion; /* xmit recursion detect */
123 int mru; /* max receive unit 60 */
124 unsigned int flags; /* control bits 64 */
125 unsigned int xstate; /* transmit state bits 68 */
126 unsigned int rstate; /* receive state bits 6c */
127 int debug; /* debug flags 70 */
128 struct slcompress *vj; /* state for VJ header compression */
129 enum NPmode npmode[NUM_NP]; /* what to do with each net proto 78 */
130 struct sk_buff *xmit_pending; /* a packet ready to go out 88 */
131 struct compressor *xcomp; /* transmit packet compressor 8c */
132 void *xc_state; /* its internal state 90 */
133 struct compressor *rcomp; /* receive decompressor 94 */
134 void *rc_state; /* its internal state 98 */
135 unsigned long last_xmit; /* jiffies when last pkt sent 9c */
136 unsigned long last_recv; /* jiffies when last pkt rcvd a0 */
137 struct net_device *dev; /* network interface device a4 */
138 int closing; /* is device closing down? a8 */
139 #ifdef CONFIG_PPP_MULTILINK
140 int nxchan; /* next channel to send something on */
141 u32 nxseq; /* next sequence number to send */
142 int mrru; /* MP: max reconst. receive unit */
143 u32 nextseq; /* MP: seq no of next packet */
144 u32 minseq; /* MP: min of most recent seqnos */
145 struct sk_buff_head mrq; /* MP: receive reconstruction queue */
146 #endif /* CONFIG_PPP_MULTILINK */
147 #ifdef CONFIG_PPP_FILTER
148 struct bpf_prog *pass_filter; /* filter for packets to pass */
149 struct bpf_prog *active_filter; /* filter for pkts to reset idle */
150 #endif /* CONFIG_PPP_FILTER */
151 struct net *ppp_net; /* the net we belong to */
152 struct ppp_link_stats stats64; /* 64 bit network stats */
156 * Bits in flags: SC_NO_TCP_CCID, SC_CCP_OPEN, SC_CCP_UP, SC_LOOP_TRAFFIC,
157 * SC_MULTILINK, SC_MP_SHORTSEQ, SC_MP_XSHORTSEQ, SC_COMP_TCP, SC_REJ_COMP_TCP,
159 * Bits in rstate: SC_DECOMP_RUN, SC_DC_ERROR, SC_DC_FERROR.
160 * Bits in xstate: SC_COMP_RUN
162 #define SC_FLAG_BITS (SC_NO_TCP_CCID|SC_CCP_OPEN|SC_CCP_UP|SC_LOOP_TRAFFIC \
163 |SC_MULTILINK|SC_MP_SHORTSEQ|SC_MP_XSHORTSEQ \
164 |SC_COMP_TCP|SC_REJ_COMP_TCP|SC_MUST_COMP)
167 * Private data structure for each channel.
168 * This includes the data structure used for multilink.
171 struct ppp_file file; /* stuff for read/write/poll */
172 struct list_head list; /* link in all/new_channels list */
173 struct ppp_channel *chan; /* public channel data structure */
174 struct rw_semaphore chan_sem; /* protects `chan' during chan ioctl */
175 spinlock_t downl; /* protects `chan', file.xq dequeue */
176 struct ppp *ppp; /* ppp unit we're connected to */
177 struct net *chan_net; /* the net channel belongs to */
178 netns_tracker ns_tracker;
179 struct list_head clist; /* link in list of channels per unit */
180 rwlock_t upl; /* protects `ppp' and 'bridge' */
181 struct channel __rcu *bridge; /* "bridged" ppp channel */
182 #ifdef CONFIG_PPP_MULTILINK
183 u8 avail; /* flag used in multilink stuff */
184 u8 had_frag; /* >= 1 fragments have been sent */
185 u32 lastseq; /* MP: last sequence # received */
186 int speed; /* speed of the corresponding ppp channel*/
187 #endif /* CONFIG_PPP_MULTILINK */
197 * SMP locking issues:
198 * Both the ppp.rlock and ppp.wlock locks protect the ppp.channels
199 * list and the ppp.n_channels field, you need to take both locks
200 * before you modify them.
201 * The lock ordering is: channel.upl -> ppp.wlock -> ppp.rlock ->
205 static DEFINE_MUTEX(ppp_mutex);
206 static atomic_t ppp_unit_count = ATOMIC_INIT(0);
207 static atomic_t channel_count = ATOMIC_INIT(0);
209 /* per-net private data for this module */
210 static unsigned int ppp_net_id __read_mostly;
212 /* units to ppp mapping */
213 struct idr units_idr;
216 * all_ppp_mutex protects the units_idr mapping.
217 * It also ensures that finding a ppp unit in the units_idr
218 * map and updating its file.refcnt field is atomic.
220 struct mutex all_ppp_mutex;
223 struct list_head all_channels;
224 struct list_head new_channels;
225 int last_channel_index;
228 * all_channels_lock protects all_channels and
229 * last_channel_index, and the atomicity of find
230 * a channel and updating its file.refcnt field.
232 spinlock_t all_channels_lock;
235 /* Get the PPP protocol number from a skb */
236 #define PPP_PROTO(skb) get_unaligned_be16((skb)->data)
238 /* We limit the length of ppp->file.rq to this (arbitrary) value */
239 #define PPP_MAX_RQLEN 32
242 * Maximum number of multilink fragments queued up.
243 * This has to be large enough to cope with the maximum latency of
244 * the slowest channel relative to the others. Strictly it should
245 * depend on the number of channels and their characteristics.
247 #define PPP_MP_MAX_QLEN 128
249 /* Multilink header bits. */
250 #define B 0x80 /* this fragment begins a packet */
251 #define E 0x40 /* this fragment ends a packet */
253 /* Compare multilink sequence numbers (assumed to be 32 bits wide) */
254 #define seq_before(a, b) ((s32)((a) - (b)) < 0)
255 #define seq_after(a, b) ((s32)((a) - (b)) > 0)
258 static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
259 struct file *file, unsigned int cmd, unsigned long arg);
260 static void ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb);
261 static void ppp_send_frame(struct ppp *ppp, struct sk_buff *skb);
262 static void ppp_push(struct ppp *ppp);
263 static void ppp_channel_push(struct channel *pch);
264 static void ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb,
265 struct channel *pch);
266 static void ppp_receive_error(struct ppp *ppp);
267 static void ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb);
268 static struct sk_buff *ppp_decompress_frame(struct ppp *ppp,
269 struct sk_buff *skb);
270 #ifdef CONFIG_PPP_MULTILINK
271 static void ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb,
272 struct channel *pch);
273 static void ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb);
274 static struct sk_buff *ppp_mp_reconstruct(struct ppp *ppp);
275 static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb);
276 #endif /* CONFIG_PPP_MULTILINK */
277 static int ppp_set_compress(struct ppp *ppp, struct ppp_option_data *data);
278 static void ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound);
279 static void ppp_ccp_closed(struct ppp *ppp);
280 static struct compressor *find_compressor(int type);
281 static void ppp_get_stats(struct ppp *ppp, struct ppp_stats *st);
282 static int ppp_create_interface(struct net *net, struct file *file, int *unit);
283 static void init_ppp_file(struct ppp_file *pf, int kind);
284 static void ppp_destroy_interface(struct ppp *ppp);
285 static struct ppp *ppp_find_unit(struct ppp_net *pn, int unit);
286 static struct channel *ppp_find_channel(struct ppp_net *pn, int unit);
287 static int ppp_connect_channel(struct channel *pch, int unit);
288 static int ppp_disconnect_channel(struct channel *pch);
289 static void ppp_destroy_channel(struct channel *pch);
290 static int unit_get(struct idr *p, void *ptr, int min);
291 static int unit_set(struct idr *p, void *ptr, int n);
292 static void unit_put(struct idr *p, int n);
293 static void *unit_find(struct idr *p, int n);
294 static void ppp_setup(struct net_device *dev);
296 static const struct net_device_ops ppp_netdev_ops;
298 static struct class *ppp_class;
300 /* per net-namespace data */
301 static inline struct ppp_net *ppp_pernet(struct net *net)
303 return net_generic(net, ppp_net_id);
306 /* Translates a PPP protocol number to a NP index (NP == network protocol) */
307 static inline int proto_to_npindex(int proto)
326 /* Translates an NP index into a PPP protocol number */
327 static const int npindex_to_proto[NUM_NP] = {
336 /* Translates an ethertype into an NP index */
337 static inline int ethertype_to_npindex(int ethertype)
357 /* Translates an NP index into an ethertype */
358 static const int npindex_to_ethertype[NUM_NP] = {
370 #define ppp_xmit_lock(ppp) spin_lock_bh(&(ppp)->wlock)
371 #define ppp_xmit_unlock(ppp) spin_unlock_bh(&(ppp)->wlock)
372 #define ppp_recv_lock(ppp) spin_lock_bh(&(ppp)->rlock)
373 #define ppp_recv_unlock(ppp) spin_unlock_bh(&(ppp)->rlock)
374 #define ppp_lock(ppp) do { ppp_xmit_lock(ppp); \
375 ppp_recv_lock(ppp); } while (0)
376 #define ppp_unlock(ppp) do { ppp_recv_unlock(ppp); \
377 ppp_xmit_unlock(ppp); } while (0)
380 * /dev/ppp device routines.
381 * The /dev/ppp device is used by pppd to control the ppp unit.
382 * It supports the read, write, ioctl and poll functions.
383 * Open instances of /dev/ppp can be in one of three states:
384 * unattached, attached to a ppp unit, or attached to a ppp channel.
386 static int ppp_open(struct inode *inode, struct file *file)
389 * This could (should?) be enforced by the permissions on /dev/ppp.
391 if (!ns_capable(file->f_cred->user_ns, CAP_NET_ADMIN))
396 static int ppp_release(struct inode *unused, struct file *file)
398 struct ppp_file *pf = file->private_data;
402 file->private_data = NULL;
403 if (pf->kind == INTERFACE) {
406 if (file == ppp->owner)
407 unregister_netdevice(ppp->dev);
410 if (refcount_dec_and_test(&pf->refcnt)) {
413 ppp_destroy_interface(PF_TO_PPP(pf));
416 ppp_destroy_channel(PF_TO_CHANNEL(pf));
424 static ssize_t ppp_read(struct file *file, char __user *buf,
425 size_t count, loff_t *ppos)
427 struct ppp_file *pf = file->private_data;
428 DECLARE_WAITQUEUE(wait, current);
430 struct sk_buff *skb = NULL;
438 add_wait_queue(&pf->rwait, &wait);
440 set_current_state(TASK_INTERRUPTIBLE);
441 skb = skb_dequeue(&pf->rq);
447 if (pf->kind == INTERFACE) {
449 * Return 0 (EOF) on an interface that has no
450 * channels connected, unless it is looping
451 * network traffic (demand mode).
453 struct ppp *ppp = PF_TO_PPP(pf);
456 if (ppp->n_channels == 0 &&
457 (ppp->flags & SC_LOOP_TRAFFIC) == 0) {
458 ppp_recv_unlock(ppp);
461 ppp_recv_unlock(ppp);
464 if (file->f_flags & O_NONBLOCK)
467 if (signal_pending(current))
471 set_current_state(TASK_RUNNING);
472 remove_wait_queue(&pf->rwait, &wait);
478 if (skb->len > count)
483 iov_iter_init(&to, READ, &iov, 1, count);
484 if (skb_copy_datagram_iter(skb, 0, &to, skb->len))
494 static ssize_t ppp_write(struct file *file, const char __user *buf,
495 size_t count, loff_t *ppos)
497 struct ppp_file *pf = file->private_data;
503 /* All PPP packets should start with the 2-byte protocol */
504 if (count < PPP_PROTO_LEN)
507 skb = alloc_skb(count + pf->hdrlen, GFP_KERNEL);
510 skb_reserve(skb, pf->hdrlen);
512 if (copy_from_user(skb_put(skb, count), buf, count)) {
519 ppp_xmit_process(PF_TO_PPP(pf), skb);
522 skb_queue_tail(&pf->xq, skb);
523 ppp_channel_push(PF_TO_CHANNEL(pf));
533 /* No kernel lock - fine */
534 static __poll_t ppp_poll(struct file *file, poll_table *wait)
536 struct ppp_file *pf = file->private_data;
541 poll_wait(file, &pf->rwait, wait);
542 mask = EPOLLOUT | EPOLLWRNORM;
543 if (skb_peek(&pf->rq))
544 mask |= EPOLLIN | EPOLLRDNORM;
547 else if (pf->kind == INTERFACE) {
548 /* see comment in ppp_read */
549 struct ppp *ppp = PF_TO_PPP(pf);
552 if (ppp->n_channels == 0 &&
553 (ppp->flags & SC_LOOP_TRAFFIC) == 0)
554 mask |= EPOLLIN | EPOLLRDNORM;
555 ppp_recv_unlock(ppp);
561 #ifdef CONFIG_PPP_FILTER
562 static struct bpf_prog *get_filter(struct sock_fprog *uprog)
564 struct sock_fprog_kern fprog;
565 struct bpf_prog *res = NULL;
571 /* uprog->len is unsigned short, so no overflow here */
572 fprog.len = uprog->len;
573 fprog.filter = memdup_user(uprog->filter,
574 uprog->len * sizeof(struct sock_filter));
575 if (IS_ERR(fprog.filter))
576 return ERR_CAST(fprog.filter);
578 err = bpf_prog_create(&res, &fprog);
581 return err ? ERR_PTR(err) : res;
584 static struct bpf_prog *ppp_get_filter(struct sock_fprog __user *p)
586 struct sock_fprog uprog;
588 if (copy_from_user(&uprog, p, sizeof(struct sock_fprog)))
589 return ERR_PTR(-EFAULT);
590 return get_filter(&uprog);
594 struct sock_fprog32 {
596 compat_caddr_t filter;
599 #define PPPIOCSPASS32 _IOW('t', 71, struct sock_fprog32)
600 #define PPPIOCSACTIVE32 _IOW('t', 70, struct sock_fprog32)
602 static struct bpf_prog *compat_ppp_get_filter(struct sock_fprog32 __user *p)
604 struct sock_fprog32 uprog32;
605 struct sock_fprog uprog;
607 if (copy_from_user(&uprog32, p, sizeof(struct sock_fprog32)))
608 return ERR_PTR(-EFAULT);
609 uprog.len = uprog32.len;
610 uprog.filter = compat_ptr(uprog32.filter);
611 return get_filter(&uprog);
616 /* Bridge one PPP channel to another.
617 * When two channels are bridged, ppp_input on one channel is redirected to
618 * the other's ops->start_xmit handler.
619 * In order to safely bridge channels we must reject channels which are already
620 * part of a bridge instance, or which form part of an existing unit.
621 * Once successfully bridged, each channel holds a reference on the other
622 * to prevent it being freed while the bridge is extant.
624 static int ppp_bridge_channels(struct channel *pch, struct channel *pchb)
626 write_lock_bh(&pch->upl);
628 rcu_dereference_protected(pch->bridge, lockdep_is_held(&pch->upl))) {
629 write_unlock_bh(&pch->upl);
632 refcount_inc(&pchb->file.refcnt);
633 rcu_assign_pointer(pch->bridge, pchb);
634 write_unlock_bh(&pch->upl);
636 write_lock_bh(&pchb->upl);
638 rcu_dereference_protected(pchb->bridge, lockdep_is_held(&pchb->upl))) {
639 write_unlock_bh(&pchb->upl);
642 refcount_inc(&pch->file.refcnt);
643 rcu_assign_pointer(pchb->bridge, pch);
644 write_unlock_bh(&pchb->upl);
649 write_lock_bh(&pch->upl);
650 /* Re-read pch->bridge with upl held in case it was modified concurrently */
651 pchb = rcu_dereference_protected(pch->bridge, lockdep_is_held(&pch->upl));
652 RCU_INIT_POINTER(pch->bridge, NULL);
653 write_unlock_bh(&pch->upl);
657 if (refcount_dec_and_test(&pchb->file.refcnt))
658 ppp_destroy_channel(pchb);
663 static int ppp_unbridge_channels(struct channel *pch)
665 struct channel *pchb, *pchbb;
667 write_lock_bh(&pch->upl);
668 pchb = rcu_dereference_protected(pch->bridge, lockdep_is_held(&pch->upl));
670 write_unlock_bh(&pch->upl);
673 RCU_INIT_POINTER(pch->bridge, NULL);
674 write_unlock_bh(&pch->upl);
676 /* Only modify pchb if phcb->bridge points back to pch.
677 * If not, it implies that there has been a race unbridging (and possibly
678 * even rebridging) pchb. We should leave pchb alone to avoid either a
679 * refcount underflow, or breaking another established bridge instance.
681 write_lock_bh(&pchb->upl);
682 pchbb = rcu_dereference_protected(pchb->bridge, lockdep_is_held(&pchb->upl));
684 RCU_INIT_POINTER(pchb->bridge, NULL);
685 write_unlock_bh(&pchb->upl);
690 if (refcount_dec_and_test(&pch->file.refcnt))
691 ppp_destroy_channel(pch);
693 if (refcount_dec_and_test(&pchb->file.refcnt))
694 ppp_destroy_channel(pchb);
699 static long ppp_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
703 int err = -EFAULT, val, val2, i;
704 struct ppp_idle32 idle32;
705 struct ppp_idle64 idle64;
708 struct slcompress *vj;
709 void __user *argp = (void __user *)arg;
710 int __user *p = argp;
712 mutex_lock(&ppp_mutex);
714 pf = file->private_data;
716 err = ppp_unattached_ioctl(current->nsproxy->net_ns,
721 if (cmd == PPPIOCDETACH) {
723 * PPPIOCDETACH is no longer supported as it was heavily broken,
724 * and is only known to have been used by pppd older than
725 * ppp-2.4.2 (released November 2003).
727 pr_warn_once("%s (%d) used obsolete PPPIOCDETACH ioctl\n",
728 current->comm, current->pid);
733 if (pf->kind == CHANNEL) {
734 struct channel *pch, *pchb;
735 struct ppp_channel *chan;
738 pch = PF_TO_CHANNEL(pf);
742 if (get_user(unit, p))
744 err = ppp_connect_channel(pch, unit);
748 err = ppp_disconnect_channel(pch);
751 case PPPIOCBRIDGECHAN:
752 if (get_user(unit, p))
755 pn = ppp_pernet(current->nsproxy->net_ns);
756 spin_lock_bh(&pn->all_channels_lock);
757 pchb = ppp_find_channel(pn, unit);
758 /* Hold a reference to prevent pchb being freed while
759 * we establish the bridge.
762 refcount_inc(&pchb->file.refcnt);
763 spin_unlock_bh(&pn->all_channels_lock);
766 err = ppp_bridge_channels(pch, pchb);
767 /* Drop earlier refcount now bridge establishment is complete */
768 if (refcount_dec_and_test(&pchb->file.refcnt))
769 ppp_destroy_channel(pchb);
772 case PPPIOCUNBRIDGECHAN:
773 err = ppp_unbridge_channels(pch);
777 down_read(&pch->chan_sem);
780 if (chan && chan->ops->ioctl)
781 err = chan->ops->ioctl(chan, cmd, arg);
782 up_read(&pch->chan_sem);
787 if (pf->kind != INTERFACE) {
789 pr_err("PPP: not interface or channel??\n");
797 if (get_user(val, p))
804 if (get_user(val, p))
807 cflags = ppp->flags & ~val;
808 #ifdef CONFIG_PPP_MULTILINK
809 if (!(ppp->flags & SC_MULTILINK) && (val & SC_MULTILINK))
812 ppp->flags = val & SC_FLAG_BITS;
814 if (cflags & SC_CCP_OPEN)
820 val = ppp->flags | ppp->xstate | ppp->rstate;
821 if (put_user(val, p))
826 case PPPIOCSCOMPRESS:
828 struct ppp_option_data data;
829 if (copy_from_user(&data, argp, sizeof(data)))
832 err = ppp_set_compress(ppp, &data);
836 if (put_user(ppp->file.index, p))
842 if (get_user(val, p))
849 if (put_user(ppp->debug, p))
855 idle32.xmit_idle = (jiffies - ppp->last_xmit) / HZ;
856 idle32.recv_idle = (jiffies - ppp->last_recv) / HZ;
857 if (copy_to_user(argp, &idle32, sizeof(idle32)))
863 idle64.xmit_idle = (jiffies - ppp->last_xmit) / HZ;
864 idle64.recv_idle = (jiffies - ppp->last_recv) / HZ;
865 if (copy_to_user(argp, &idle64, sizeof(idle64)))
871 if (get_user(val, p))
874 if ((val >> 16) != 0) {
878 vj = slhc_init(val2+1, val+1);
893 if (copy_from_user(&npi, argp, sizeof(npi)))
895 err = proto_to_npindex(npi.protocol);
899 if (cmd == PPPIOCGNPMODE) {
901 npi.mode = ppp->npmode[i];
902 if (copy_to_user(argp, &npi, sizeof(npi)))
905 ppp->npmode[i] = npi.mode;
906 /* we may be able to transmit more packets now (??) */
907 netif_wake_queue(ppp->dev);
912 #ifdef CONFIG_PPP_FILTER
916 struct bpf_prog *filter = ppp_get_filter(argp);
917 struct bpf_prog **which;
919 if (IS_ERR(filter)) {
920 err = PTR_ERR(filter);
923 if (cmd == PPPIOCSPASS)
924 which = &ppp->pass_filter;
926 which = &ppp->active_filter;
929 bpf_prog_destroy(*which);
935 #endif /* CONFIG_PPP_FILTER */
937 #ifdef CONFIG_PPP_MULTILINK
939 if (get_user(val, p))
943 ppp_recv_unlock(ppp);
946 #endif /* CONFIG_PPP_MULTILINK */
953 mutex_unlock(&ppp_mutex);
959 struct ppp_option_data32 {
962 compat_int_t transmit;
964 #define PPPIOCSCOMPRESS32 _IOW('t', 77, struct ppp_option_data32)
966 static long ppp_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
969 int err = -ENOIOCTLCMD;
970 void __user *argp = (void __user *)arg;
972 mutex_lock(&ppp_mutex);
974 pf = file->private_data;
975 if (pf && pf->kind == INTERFACE) {
976 struct ppp *ppp = PF_TO_PPP(pf);
978 #ifdef CONFIG_PPP_FILTER
980 case PPPIOCSACTIVE32:
982 struct bpf_prog *filter = compat_ppp_get_filter(argp);
983 struct bpf_prog **which;
985 if (IS_ERR(filter)) {
986 err = PTR_ERR(filter);
989 if (cmd == PPPIOCSPASS32)
990 which = &ppp->pass_filter;
992 which = &ppp->active_filter;
995 bpf_prog_destroy(*which);
1001 #endif /* CONFIG_PPP_FILTER */
1002 case PPPIOCSCOMPRESS32:
1004 struct ppp_option_data32 data32;
1005 if (copy_from_user(&data32, argp, sizeof(data32))) {
1008 struct ppp_option_data data = {
1009 .ptr = compat_ptr(data32.ptr),
1010 .length = data32.length,
1011 .transmit = data32.transmit
1013 err = ppp_set_compress(ppp, &data);
1019 mutex_unlock(&ppp_mutex);
1021 /* all other commands have compatible arguments */
1022 if (err == -ENOIOCTLCMD)
1023 err = ppp_ioctl(file, cmd, (unsigned long)compat_ptr(arg));
1029 static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
1030 struct file *file, unsigned int cmd, unsigned long arg)
1032 int unit, err = -EFAULT;
1034 struct channel *chan;
1036 int __user *p = (int __user *)arg;
1040 /* Create a new ppp unit */
1041 if (get_user(unit, p))
1043 err = ppp_create_interface(net, file, &unit);
1048 if (put_user(unit, p))
1054 /* Attach to an existing ppp unit */
1055 if (get_user(unit, p))
1058 pn = ppp_pernet(net);
1059 mutex_lock(&pn->all_ppp_mutex);
1060 ppp = ppp_find_unit(pn, unit);
1062 refcount_inc(&ppp->file.refcnt);
1063 file->private_data = &ppp->file;
1066 mutex_unlock(&pn->all_ppp_mutex);
1070 if (get_user(unit, p))
1073 pn = ppp_pernet(net);
1074 spin_lock_bh(&pn->all_channels_lock);
1075 chan = ppp_find_channel(pn, unit);
1077 refcount_inc(&chan->file.refcnt);
1078 file->private_data = &chan->file;
1081 spin_unlock_bh(&pn->all_channels_lock);
1091 static const struct file_operations ppp_device_fops = {
1092 .owner = THIS_MODULE,
1096 .unlocked_ioctl = ppp_ioctl,
1097 #ifdef CONFIG_COMPAT
1098 .compat_ioctl = ppp_compat_ioctl,
1101 .release = ppp_release,
1102 .llseek = noop_llseek,
1105 static __net_init int ppp_init_net(struct net *net)
1107 struct ppp_net *pn = net_generic(net, ppp_net_id);
1109 idr_init(&pn->units_idr);
1110 mutex_init(&pn->all_ppp_mutex);
1112 INIT_LIST_HEAD(&pn->all_channels);
1113 INIT_LIST_HEAD(&pn->new_channels);
1115 spin_lock_init(&pn->all_channels_lock);
1120 static __net_exit void ppp_exit_net(struct net *net)
1122 struct ppp_net *pn = net_generic(net, ppp_net_id);
1123 struct net_device *dev;
1124 struct net_device *aux;
1130 for_each_netdev_safe(net, dev, aux) {
1131 if (dev->netdev_ops == &ppp_netdev_ops)
1132 unregister_netdevice_queue(dev, &list);
1135 idr_for_each_entry(&pn->units_idr, ppp, id)
1136 /* Skip devices already unregistered by previous loop */
1137 if (!net_eq(dev_net(ppp->dev), net))
1138 unregister_netdevice_queue(ppp->dev, &list);
1140 unregister_netdevice_many(&list);
1143 mutex_destroy(&pn->all_ppp_mutex);
1144 idr_destroy(&pn->units_idr);
1145 WARN_ON_ONCE(!list_empty(&pn->all_channels));
1146 WARN_ON_ONCE(!list_empty(&pn->new_channels));
1149 static struct pernet_operations ppp_net_ops = {
1150 .init = ppp_init_net,
1151 .exit = ppp_exit_net,
1153 .size = sizeof(struct ppp_net),
1156 static int ppp_unit_register(struct ppp *ppp, int unit, bool ifname_is_set)
1158 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
1161 mutex_lock(&pn->all_ppp_mutex);
1164 ret = unit_get(&pn->units_idr, ppp, 0);
1167 if (!ifname_is_set) {
1169 snprintf(ppp->dev->name, IFNAMSIZ, "ppp%i", ret);
1170 if (!netdev_name_in_use(ppp->ppp_net, ppp->dev->name))
1172 unit_put(&pn->units_idr, ret);
1173 ret = unit_get(&pn->units_idr, ppp, ret + 1);
1179 /* Caller asked for a specific unit number. Fail with -EEXIST
1180 * if unavailable. For backward compatibility, return -EEXIST
1181 * too if idr allocation fails; this makes pppd retry without
1182 * requesting a specific unit number.
1184 if (unit_find(&pn->units_idr, unit)) {
1188 ret = unit_set(&pn->units_idr, ppp, unit);
1190 /* Rewrite error for backward compatibility */
1195 ppp->file.index = ret;
1198 snprintf(ppp->dev->name, IFNAMSIZ, "ppp%i", ppp->file.index);
1200 mutex_unlock(&pn->all_ppp_mutex);
1202 ret = register_netdevice(ppp->dev);
1206 atomic_inc(&ppp_unit_count);
1211 mutex_lock(&pn->all_ppp_mutex);
1212 unit_put(&pn->units_idr, ppp->file.index);
1214 mutex_unlock(&pn->all_ppp_mutex);
1219 static int ppp_dev_configure(struct net *src_net, struct net_device *dev,
1220 const struct ppp_config *conf)
1222 struct ppp *ppp = netdev_priv(dev);
1228 ppp->ppp_net = src_net;
1230 ppp->owner = conf->file;
1232 init_ppp_file(&ppp->file, INTERFACE);
1233 ppp->file.hdrlen = PPP_HDRLEN - 2; /* don't count proto bytes */
1235 for (indx = 0; indx < NUM_NP; ++indx)
1236 ppp->npmode[indx] = NPMODE_PASS;
1237 INIT_LIST_HEAD(&ppp->channels);
1238 spin_lock_init(&ppp->rlock);
1239 spin_lock_init(&ppp->wlock);
1241 ppp->xmit_recursion = alloc_percpu(int);
1242 if (!ppp->xmit_recursion) {
1246 for_each_possible_cpu(cpu)
1247 (*per_cpu_ptr(ppp->xmit_recursion, cpu)) = 0;
1249 #ifdef CONFIG_PPP_MULTILINK
1251 skb_queue_head_init(&ppp->mrq);
1252 #endif /* CONFIG_PPP_MULTILINK */
1253 #ifdef CONFIG_PPP_FILTER
1254 ppp->pass_filter = NULL;
1255 ppp->active_filter = NULL;
1256 #endif /* CONFIG_PPP_FILTER */
1258 err = ppp_unit_register(ppp, conf->unit, conf->ifname_is_set);
1262 conf->file->private_data = &ppp->file;
1266 free_percpu(ppp->xmit_recursion);
1271 static const struct nla_policy ppp_nl_policy[IFLA_PPP_MAX + 1] = {
1272 [IFLA_PPP_DEV_FD] = { .type = NLA_S32 },
1275 static int ppp_nl_validate(struct nlattr *tb[], struct nlattr *data[],
1276 struct netlink_ext_ack *extack)
1281 if (!data[IFLA_PPP_DEV_FD])
1283 if (nla_get_s32(data[IFLA_PPP_DEV_FD]) < 0)
1289 static int ppp_nl_newlink(struct net *src_net, struct net_device *dev,
1290 struct nlattr *tb[], struct nlattr *data[],
1291 struct netlink_ext_ack *extack)
1293 struct ppp_config conf = {
1295 .ifname_is_set = true,
1300 file = fget(nla_get_s32(data[IFLA_PPP_DEV_FD]));
1304 /* rtnl_lock is already held here, but ppp_create_interface() locks
1305 * ppp_mutex before holding rtnl_lock. Using mutex_trylock() avoids
1306 * possible deadlock due to lock order inversion, at the cost of
1307 * pushing the problem back to userspace.
1309 if (!mutex_trylock(&ppp_mutex)) {
1314 if (file->f_op != &ppp_device_fops || file->private_data) {
1321 /* Don't use device name generated by the rtnetlink layer when ifname
1322 * isn't specified. Let ppp_dev_configure() set the device name using
1323 * the PPP unit identifer as suffix (i.e. ppp<unit_id>). This allows
1324 * userspace to infer the device name using to the PPPIOCGUNIT ioctl.
1326 if (!tb[IFLA_IFNAME] || !nla_len(tb[IFLA_IFNAME]) || !*(char *)nla_data(tb[IFLA_IFNAME]))
1327 conf.ifname_is_set = false;
1329 err = ppp_dev_configure(src_net, dev, &conf);
1332 mutex_unlock(&ppp_mutex);
1339 static void ppp_nl_dellink(struct net_device *dev, struct list_head *head)
1341 unregister_netdevice_queue(dev, head);
1344 static size_t ppp_nl_get_size(const struct net_device *dev)
1349 static int ppp_nl_fill_info(struct sk_buff *skb, const struct net_device *dev)
1354 static struct net *ppp_nl_get_link_net(const struct net_device *dev)
1356 struct ppp *ppp = netdev_priv(dev);
1358 return ppp->ppp_net;
1361 static struct rtnl_link_ops ppp_link_ops __read_mostly = {
1363 .maxtype = IFLA_PPP_MAX,
1364 .policy = ppp_nl_policy,
1365 .priv_size = sizeof(struct ppp),
1367 .validate = ppp_nl_validate,
1368 .newlink = ppp_nl_newlink,
1369 .dellink = ppp_nl_dellink,
1370 .get_size = ppp_nl_get_size,
1371 .fill_info = ppp_nl_fill_info,
1372 .get_link_net = ppp_nl_get_link_net,
1375 #define PPP_MAJOR 108
1377 /* Called at boot time if ppp is compiled into the kernel,
1378 or at module load time (from init_module) if compiled as a module. */
1379 static int __init ppp_init(void)
1383 pr_info("PPP generic driver version " PPP_VERSION "\n");
1385 err = register_pernet_device(&ppp_net_ops);
1387 pr_err("failed to register PPP pernet device (%d)\n", err);
1391 err = register_chrdev(PPP_MAJOR, "ppp", &ppp_device_fops);
1393 pr_err("failed to register PPP device (%d)\n", err);
1397 ppp_class = class_create(THIS_MODULE, "ppp");
1398 if (IS_ERR(ppp_class)) {
1399 err = PTR_ERR(ppp_class);
1403 err = rtnl_link_register(&ppp_link_ops);
1405 pr_err("failed to register rtnetlink PPP handler\n");
1409 /* not a big deal if we fail here :-) */
1410 device_create(ppp_class, NULL, MKDEV(PPP_MAJOR, 0), NULL, "ppp");
1415 class_destroy(ppp_class);
1417 unregister_chrdev(PPP_MAJOR, "ppp");
1419 unregister_pernet_device(&ppp_net_ops);
1425 * Network interface unit routines.
1428 ppp_start_xmit(struct sk_buff *skb, struct net_device *dev)
1430 struct ppp *ppp = netdev_priv(dev);
1434 npi = ethertype_to_npindex(ntohs(skb->protocol));
1438 /* Drop, accept or reject the packet */
1439 switch (ppp->npmode[npi]) {
1443 /* it would be nice to have a way to tell the network
1444 system to queue this one up for later. */
1451 /* Put the 2-byte PPP protocol number on the front,
1452 making sure there is room for the address and control fields. */
1453 if (skb_cow_head(skb, PPP_HDRLEN))
1456 pp = skb_push(skb, 2);
1457 proto = npindex_to_proto[npi];
1458 put_unaligned_be16(proto, pp);
1460 skb_scrub_packet(skb, !net_eq(ppp->ppp_net, dev_net(dev)));
1461 ppp_xmit_process(ppp, skb);
1463 return NETDEV_TX_OK;
1467 ++dev->stats.tx_dropped;
1468 return NETDEV_TX_OK;
1472 ppp_net_siocdevprivate(struct net_device *dev, struct ifreq *ifr,
1473 void __user *addr, int cmd)
1475 struct ppp *ppp = netdev_priv(dev);
1477 struct ppp_stats stats;
1478 struct ppp_comp_stats cstats;
1483 ppp_get_stats(ppp, &stats);
1484 if (copy_to_user(addr, &stats, sizeof(stats)))
1489 case SIOCGPPPCSTATS:
1490 memset(&cstats, 0, sizeof(cstats));
1492 ppp->xcomp->comp_stat(ppp->xc_state, &cstats.c);
1494 ppp->rcomp->decomp_stat(ppp->rc_state, &cstats.d);
1495 if (copy_to_user(addr, &cstats, sizeof(cstats)))
1502 if (copy_to_user(addr, vers, strlen(vers) + 1))
1515 ppp_get_stats64(struct net_device *dev, struct rtnl_link_stats64 *stats64)
1517 struct ppp *ppp = netdev_priv(dev);
1520 stats64->rx_packets = ppp->stats64.rx_packets;
1521 stats64->rx_bytes = ppp->stats64.rx_bytes;
1522 ppp_recv_unlock(ppp);
1525 stats64->tx_packets = ppp->stats64.tx_packets;
1526 stats64->tx_bytes = ppp->stats64.tx_bytes;
1527 ppp_xmit_unlock(ppp);
1529 stats64->rx_errors = dev->stats.rx_errors;
1530 stats64->tx_errors = dev->stats.tx_errors;
1531 stats64->rx_dropped = dev->stats.rx_dropped;
1532 stats64->tx_dropped = dev->stats.tx_dropped;
1533 stats64->rx_length_errors = dev->stats.rx_length_errors;
1536 static int ppp_dev_init(struct net_device *dev)
1540 netdev_lockdep_set_classes(dev);
1542 ppp = netdev_priv(dev);
1543 /* Let the netdevice take a reference on the ppp file. This ensures
1544 * that ppp_destroy_interface() won't run before the device gets
1547 refcount_inc(&ppp->file.refcnt);
1552 static void ppp_dev_uninit(struct net_device *dev)
1554 struct ppp *ppp = netdev_priv(dev);
1555 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
1561 mutex_lock(&pn->all_ppp_mutex);
1562 unit_put(&pn->units_idr, ppp->file.index);
1563 mutex_unlock(&pn->all_ppp_mutex);
1568 wake_up_interruptible(&ppp->file.rwait);
1571 static void ppp_dev_priv_destructor(struct net_device *dev)
1575 ppp = netdev_priv(dev);
1576 if (refcount_dec_and_test(&ppp->file.refcnt))
1577 ppp_destroy_interface(ppp);
1580 static int ppp_fill_forward_path(struct net_device_path_ctx *ctx,
1581 struct net_device_path *path)
1583 struct ppp *ppp = netdev_priv(ctx->dev);
1584 struct ppp_channel *chan;
1585 struct channel *pch;
1587 if (ppp->flags & SC_MULTILINK)
1590 if (list_empty(&ppp->channels))
1593 pch = list_first_entry(&ppp->channels, struct channel, clist);
1595 if (!chan->ops->fill_forward_path)
1598 return chan->ops->fill_forward_path(ctx, path, chan);
1601 static const struct net_device_ops ppp_netdev_ops = {
1602 .ndo_init = ppp_dev_init,
1603 .ndo_uninit = ppp_dev_uninit,
1604 .ndo_start_xmit = ppp_start_xmit,
1605 .ndo_siocdevprivate = ppp_net_siocdevprivate,
1606 .ndo_get_stats64 = ppp_get_stats64,
1607 .ndo_fill_forward_path = ppp_fill_forward_path,
1610 static struct device_type ppp_type = {
1614 static void ppp_setup(struct net_device *dev)
1616 dev->netdev_ops = &ppp_netdev_ops;
1617 SET_NETDEV_DEVTYPE(dev, &ppp_type);
1619 dev->features |= NETIF_F_LLTX;
1621 dev->hard_header_len = PPP_HDRLEN;
1624 dev->tx_queue_len = 3;
1625 dev->type = ARPHRD_PPP;
1626 dev->flags = IFF_POINTOPOINT | IFF_NOARP | IFF_MULTICAST;
1627 dev->priv_destructor = ppp_dev_priv_destructor;
1628 netif_keep_dst(dev);
1632 * Transmit-side routines.
1635 /* Called to do any work queued up on the transmit side that can now be done */
1636 static void __ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1639 if (!ppp->closing) {
1643 skb_queue_tail(&ppp->file.xq, skb);
1644 while (!ppp->xmit_pending &&
1645 (skb = skb_dequeue(&ppp->file.xq)))
1646 ppp_send_frame(ppp, skb);
1647 /* If there's no work left to do, tell the core net
1648 code that we can accept some more. */
1649 if (!ppp->xmit_pending && !skb_peek(&ppp->file.xq))
1650 netif_wake_queue(ppp->dev);
1652 netif_stop_queue(ppp->dev);
1656 ppp_xmit_unlock(ppp);
1659 static void ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1663 if (unlikely(*this_cpu_ptr(ppp->xmit_recursion)))
1666 (*this_cpu_ptr(ppp->xmit_recursion))++;
1667 __ppp_xmit_process(ppp, skb);
1668 (*this_cpu_ptr(ppp->xmit_recursion))--;
1679 if (net_ratelimit())
1680 netdev_err(ppp->dev, "recursion detected\n");
1683 static inline struct sk_buff *
1684 pad_compress_skb(struct ppp *ppp, struct sk_buff *skb)
1686 struct sk_buff *new_skb;
1688 int new_skb_size = ppp->dev->mtu +
1689 ppp->xcomp->comp_extra + ppp->dev->hard_header_len;
1690 int compressor_skb_size = ppp->dev->mtu +
1691 ppp->xcomp->comp_extra + PPP_HDRLEN;
1692 new_skb = alloc_skb(new_skb_size, GFP_ATOMIC);
1694 if (net_ratelimit())
1695 netdev_err(ppp->dev, "PPP: no memory (comp pkt)\n");
1698 if (ppp->dev->hard_header_len > PPP_HDRLEN)
1699 skb_reserve(new_skb,
1700 ppp->dev->hard_header_len - PPP_HDRLEN);
1702 /* compressor still expects A/C bytes in hdr */
1703 len = ppp->xcomp->compress(ppp->xc_state, skb->data - 2,
1704 new_skb->data, skb->len + 2,
1705 compressor_skb_size);
1706 if (len > 0 && (ppp->flags & SC_CCP_UP)) {
1710 skb_pull(skb, 2); /* pull off A/C bytes */
1711 } else if (len == 0) {
1712 /* didn't compress, or CCP not up yet */
1713 consume_skb(new_skb);
1718 * MPPE requires that we do not send unencrypted
1719 * frames. The compressor will return -1 if we
1720 * should drop the frame. We cannot simply test
1721 * the compress_proto because MPPE and MPPC share
1724 if (net_ratelimit())
1725 netdev_err(ppp->dev, "ppp: compressor dropped pkt\n");
1727 consume_skb(new_skb);
1734 * Compress and send a frame.
1735 * The caller should have locked the xmit path,
1736 * and xmit_pending should be 0.
1739 ppp_send_frame(struct ppp *ppp, struct sk_buff *skb)
1741 int proto = PPP_PROTO(skb);
1742 struct sk_buff *new_skb;
1746 if (proto < 0x8000) {
1747 #ifdef CONFIG_PPP_FILTER
1748 /* check if we should pass this packet */
1749 /* the filter instructions are constructed assuming
1750 a four-byte PPP header on each packet */
1751 *(u8 *)skb_push(skb, 2) = 1;
1752 if (ppp->pass_filter &&
1753 bpf_prog_run(ppp->pass_filter, skb) == 0) {
1755 netdev_printk(KERN_DEBUG, ppp->dev,
1756 "PPP: outbound frame "
1761 /* if this packet passes the active filter, record the time */
1762 if (!(ppp->active_filter &&
1763 bpf_prog_run(ppp->active_filter, skb) == 0))
1764 ppp->last_xmit = jiffies;
1767 /* for data packets, record the time */
1768 ppp->last_xmit = jiffies;
1769 #endif /* CONFIG_PPP_FILTER */
1772 ++ppp->stats64.tx_packets;
1773 ppp->stats64.tx_bytes += skb->len - PPP_PROTO_LEN;
1777 if (!ppp->vj || (ppp->flags & SC_COMP_TCP) == 0)
1779 /* try to do VJ TCP header compression */
1780 new_skb = alloc_skb(skb->len + ppp->dev->hard_header_len - 2,
1783 netdev_err(ppp->dev, "PPP: no memory (VJ comp pkt)\n");
1786 skb_reserve(new_skb, ppp->dev->hard_header_len - 2);
1788 len = slhc_compress(ppp->vj, cp, skb->len - 2,
1789 new_skb->data + 2, &cp,
1790 !(ppp->flags & SC_NO_TCP_CCID));
1791 if (cp == skb->data + 2) {
1792 /* didn't compress */
1793 consume_skb(new_skb);
1795 if (cp[0] & SL_TYPE_COMPRESSED_TCP) {
1796 proto = PPP_VJC_COMP;
1797 cp[0] &= ~SL_TYPE_COMPRESSED_TCP;
1799 proto = PPP_VJC_UNCOMP;
1800 cp[0] = skb->data[2];
1804 cp = skb_put(skb, len + 2);
1811 /* peek at outbound CCP frames */
1812 ppp_ccp_peek(ppp, skb, 0);
1816 /* try to do packet compression */
1817 if ((ppp->xstate & SC_COMP_RUN) && ppp->xc_state &&
1818 proto != PPP_LCP && proto != PPP_CCP) {
1819 if (!(ppp->flags & SC_CCP_UP) && (ppp->flags & SC_MUST_COMP)) {
1820 if (net_ratelimit())
1821 netdev_err(ppp->dev,
1822 "ppp: compression required but "
1823 "down - pkt dropped.\n");
1826 skb = pad_compress_skb(ppp, skb);
1832 * If we are waiting for traffic (demand dialling),
1833 * queue it up for pppd to receive.
1835 if (ppp->flags & SC_LOOP_TRAFFIC) {
1836 if (ppp->file.rq.qlen > PPP_MAX_RQLEN)
1838 skb_queue_tail(&ppp->file.rq, skb);
1839 wake_up_interruptible(&ppp->file.rwait);
1843 ppp->xmit_pending = skb;
1849 ++ppp->dev->stats.tx_errors;
1853 * Try to send the frame in xmit_pending.
1854 * The caller should have the xmit path locked.
1857 ppp_push(struct ppp *ppp)
1859 struct list_head *list;
1860 struct channel *pch;
1861 struct sk_buff *skb = ppp->xmit_pending;
1866 list = &ppp->channels;
1867 if (list_empty(list)) {
1868 /* nowhere to send the packet, just drop it */
1869 ppp->xmit_pending = NULL;
1874 if ((ppp->flags & SC_MULTILINK) == 0) {
1875 /* not doing multilink: send it down the first channel */
1877 pch = list_entry(list, struct channel, clist);
1879 spin_lock(&pch->downl);
1881 if (pch->chan->ops->start_xmit(pch->chan, skb))
1882 ppp->xmit_pending = NULL;
1884 /* channel got unregistered */
1886 ppp->xmit_pending = NULL;
1888 spin_unlock(&pch->downl);
1892 #ifdef CONFIG_PPP_MULTILINK
1893 /* Multilink: fragment the packet over as many links
1894 as can take the packet at the moment. */
1895 if (!ppp_mp_explode(ppp, skb))
1897 #endif /* CONFIG_PPP_MULTILINK */
1899 ppp->xmit_pending = NULL;
1903 #ifdef CONFIG_PPP_MULTILINK
1904 static bool mp_protocol_compress __read_mostly = true;
1905 module_param(mp_protocol_compress, bool, 0644);
1906 MODULE_PARM_DESC(mp_protocol_compress,
1907 "compress protocol id in multilink fragments");
1910 * Divide a packet to be transmitted into fragments and
1911 * send them out the individual links.
1913 static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb)
1916 int i, bits, hdrlen, mtu;
1918 int navail, nfree, nzero;
1922 unsigned char *p, *q;
1923 struct list_head *list;
1924 struct channel *pch;
1925 struct sk_buff *frag;
1926 struct ppp_channel *chan;
1928 totspeed = 0; /*total bitrate of the bundle*/
1929 nfree = 0; /* # channels which have no packet already queued */
1930 navail = 0; /* total # of usable channels (not deregistered) */
1931 nzero = 0; /* number of channels with zero speed associated*/
1932 totfree = 0; /*total # of channels available and
1933 *having no queued packets before
1934 *starting the fragmentation*/
1936 hdrlen = (ppp->flags & SC_MP_XSHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1938 list_for_each_entry(pch, &ppp->channels, clist) {
1942 pch->speed = pch->chan->speed;
1947 if (skb_queue_empty(&pch->file.xq) ||
1949 if (pch->speed == 0)
1952 totspeed += pch->speed;
1958 if (!pch->had_frag && i < ppp->nxchan)
1964 * Don't start sending this packet unless at least half of
1965 * the channels are free. This gives much better TCP
1966 * performance if we have a lot of channels.
1968 if (nfree == 0 || nfree < navail / 2)
1969 return 0; /* can't take now, leave it in xmit_pending */
1971 /* Do protocol field compression */
1974 if (*p == 0 && mp_protocol_compress) {
1980 nbigger = len % nfree;
1982 /* skip to the channel after the one we last used
1983 and start at that one */
1984 list = &ppp->channels;
1985 for (i = 0; i < ppp->nxchan; ++i) {
1987 if (list == &ppp->channels) {
1993 /* create a fragment for each channel */
1997 if (list == &ppp->channels) {
2001 pch = list_entry(list, struct channel, clist);
2007 * Skip this channel if it has a fragment pending already and
2008 * we haven't given a fragment to all of the free channels.
2010 if (pch->avail == 1) {
2017 /* check the channel's mtu and whether it is still attached. */
2018 spin_lock(&pch->downl);
2019 if (pch->chan == NULL) {
2020 /* can't use this channel, it's being deregistered */
2021 if (pch->speed == 0)
2024 totspeed -= pch->speed;
2026 spin_unlock(&pch->downl);
2037 *if the channel speed is not set divide
2038 *the packet evenly among the free channels;
2039 *otherwise divide it according to the speed
2040 *of the channel we are going to transmit on
2044 if (pch->speed == 0) {
2051 flen = (((totfree - nzero)*(totlen + hdrlen*totfree)) /
2052 ((totspeed*totfree)/pch->speed)) - hdrlen;
2054 flen += ((totfree - nzero)*pch->speed)/totspeed;
2055 nbigger -= ((totfree - nzero)*pch->speed)/
2063 *check if we are on the last channel or
2064 *we exceded the length of the data to
2067 if ((nfree <= 0) || (flen > len))
2070 *it is not worth to tx on slow channels:
2071 *in that case from the resulting flen according to the
2072 *above formula will be equal or less than zero.
2073 *Skip the channel in this case
2077 spin_unlock(&pch->downl);
2082 * hdrlen includes the 2-byte PPP protocol field, but the
2083 * MTU counts only the payload excluding the protocol field.
2084 * (RFC1661 Section 2)
2086 mtu = pch->chan->mtu - (hdrlen - 2);
2093 frag = alloc_skb(flen + hdrlen + (flen == 0), GFP_ATOMIC);
2096 q = skb_put(frag, flen + hdrlen);
2098 /* make the MP header */
2099 put_unaligned_be16(PPP_MP, q);
2100 if (ppp->flags & SC_MP_XSHORTSEQ) {
2101 q[2] = bits + ((ppp->nxseq >> 8) & 0xf);
2105 q[3] = ppp->nxseq >> 16;
2106 q[4] = ppp->nxseq >> 8;
2110 memcpy(q + hdrlen, p, flen);
2112 /* try to send it down the channel */
2114 if (!skb_queue_empty(&pch->file.xq) ||
2115 !chan->ops->start_xmit(chan, frag))
2116 skb_queue_tail(&pch->file.xq, frag);
2122 spin_unlock(&pch->downl);
2129 spin_unlock(&pch->downl);
2131 netdev_err(ppp->dev, "PPP: no memory (fragment)\n");
2132 ++ppp->dev->stats.tx_errors;
2134 return 1; /* abandon the frame */
2136 #endif /* CONFIG_PPP_MULTILINK */
2138 /* Try to send data out on a channel */
2139 static void __ppp_channel_push(struct channel *pch)
2141 struct sk_buff *skb;
2144 spin_lock(&pch->downl);
2146 while (!skb_queue_empty(&pch->file.xq)) {
2147 skb = skb_dequeue(&pch->file.xq);
2148 if (!pch->chan->ops->start_xmit(pch->chan, skb)) {
2149 /* put the packet back and try again later */
2150 skb_queue_head(&pch->file.xq, skb);
2155 /* channel got deregistered */
2156 skb_queue_purge(&pch->file.xq);
2158 spin_unlock(&pch->downl);
2159 /* see if there is anything from the attached unit to be sent */
2160 if (skb_queue_empty(&pch->file.xq)) {
2163 __ppp_xmit_process(ppp, NULL);
2167 static void ppp_channel_push(struct channel *pch)
2169 read_lock_bh(&pch->upl);
2171 (*this_cpu_ptr(pch->ppp->xmit_recursion))++;
2172 __ppp_channel_push(pch);
2173 (*this_cpu_ptr(pch->ppp->xmit_recursion))--;
2175 __ppp_channel_push(pch);
2177 read_unlock_bh(&pch->upl);
2181 * Receive-side routines.
2184 struct ppp_mp_skb_parm {
2188 #define PPP_MP_CB(skb) ((struct ppp_mp_skb_parm *)((skb)->cb))
2191 ppp_do_recv(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2195 ppp_receive_frame(ppp, skb, pch);
2198 ppp_recv_unlock(ppp);
2202 * __ppp_decompress_proto - Decompress protocol field, slim version.
2203 * @skb: Socket buffer where protocol field should be decompressed. It must have
2204 * at least 1 byte of head room and 1 byte of linear data. First byte of
2205 * data must be a protocol field byte.
2207 * Decompress protocol field in PPP header if it's compressed, e.g. when
2208 * Protocol-Field-Compression (PFC) was negotiated. No checks w.r.t. skb data
2209 * length are done in this function.
2211 static void __ppp_decompress_proto(struct sk_buff *skb)
2213 if (skb->data[0] & 0x01)
2214 *(u8 *)skb_push(skb, 1) = 0x00;
2218 * ppp_decompress_proto - Check skb data room and decompress protocol field.
2219 * @skb: Socket buffer where protocol field should be decompressed. First byte
2220 * of data must be a protocol field byte.
2222 * Decompress protocol field in PPP header if it's compressed, e.g. when
2223 * Protocol-Field-Compression (PFC) was negotiated. This function also makes
2224 * sure that skb data room is sufficient for Protocol field, before and after
2227 * Return: true - decompressed successfully, false - not enough room in skb.
2229 static bool ppp_decompress_proto(struct sk_buff *skb)
2231 /* At least one byte should be present (if protocol is compressed) */
2232 if (!pskb_may_pull(skb, 1))
2235 __ppp_decompress_proto(skb);
2237 /* Protocol field should occupy 2 bytes when not compressed */
2238 return pskb_may_pull(skb, 2);
2241 /* Attempt to handle a frame via. a bridged channel, if one exists.
2242 * If the channel is bridged, the frame is consumed by the bridge.
2243 * If not, the caller must handle the frame by normal recv mechanisms.
2244 * Returns true if the frame is consumed, false otherwise.
2246 static bool ppp_channel_bridge_input(struct channel *pch, struct sk_buff *skb)
2248 struct channel *pchb;
2251 pchb = rcu_dereference(pch->bridge);
2255 spin_lock(&pchb->downl);
2257 /* channel got unregistered */
2262 skb_scrub_packet(skb, !net_eq(pch->chan_net, pchb->chan_net));
2263 if (!pchb->chan->ops->start_xmit(pchb->chan, skb))
2267 spin_unlock(&pchb->downl);
2271 /* If pchb is set then we've consumed the packet */
2276 ppp_input(struct ppp_channel *chan, struct sk_buff *skb)
2278 struct channel *pch = chan->ppp;
2286 /* If the channel is bridged, transmit via. bridge */
2287 if (ppp_channel_bridge_input(pch, skb))
2290 read_lock_bh(&pch->upl);
2291 if (!ppp_decompress_proto(skb)) {
2294 ++pch->ppp->dev->stats.rx_length_errors;
2295 ppp_receive_error(pch->ppp);
2300 proto = PPP_PROTO(skb);
2301 if (!pch->ppp || proto >= 0xc000 || proto == PPP_CCPFRAG) {
2302 /* put it on the channel queue */
2303 skb_queue_tail(&pch->file.rq, skb);
2304 /* drop old frames if queue too long */
2305 while (pch->file.rq.qlen > PPP_MAX_RQLEN &&
2306 (skb = skb_dequeue(&pch->file.rq)))
2308 wake_up_interruptible(&pch->file.rwait);
2310 ppp_do_recv(pch->ppp, skb, pch);
2314 read_unlock_bh(&pch->upl);
2317 /* Put a 0-length skb in the receive queue as an error indication */
2319 ppp_input_error(struct ppp_channel *chan, int code)
2321 struct channel *pch = chan->ppp;
2322 struct sk_buff *skb;
2327 read_lock_bh(&pch->upl);
2329 skb = alloc_skb(0, GFP_ATOMIC);
2331 skb->len = 0; /* probably unnecessary */
2333 ppp_do_recv(pch->ppp, skb, pch);
2336 read_unlock_bh(&pch->upl);
2340 * We come in here to process a received frame.
2341 * The receive side of the ppp unit is locked.
2344 ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2346 /* note: a 0-length skb is used as an error indication */
2348 skb_checksum_complete_unset(skb);
2349 #ifdef CONFIG_PPP_MULTILINK
2350 /* XXX do channel-level decompression here */
2351 if (PPP_PROTO(skb) == PPP_MP)
2352 ppp_receive_mp_frame(ppp, skb, pch);
2354 #endif /* CONFIG_PPP_MULTILINK */
2355 ppp_receive_nonmp_frame(ppp, skb);
2358 ppp_receive_error(ppp);
2363 ppp_receive_error(struct ppp *ppp)
2365 ++ppp->dev->stats.rx_errors;
2371 ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb)
2374 int proto, len, npi;
2377 * Decompress the frame, if compressed.
2378 * Note that some decompressors need to see uncompressed frames
2379 * that come in as well as compressed frames.
2381 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN) &&
2382 (ppp->rstate & (SC_DC_FERROR | SC_DC_ERROR)) == 0)
2383 skb = ppp_decompress_frame(ppp, skb);
2385 if (ppp->flags & SC_MUST_COMP && ppp->rstate & SC_DC_FERROR)
2388 /* At this point the "Protocol" field MUST be decompressed, either in
2389 * ppp_input(), ppp_decompress_frame() or in ppp_receive_mp_frame().
2391 proto = PPP_PROTO(skb);
2394 /* decompress VJ compressed packets */
2395 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2398 if (skb_tailroom(skb) < 124 || skb_cloned(skb)) {
2399 /* copy to a new sk_buff with more tailroom */
2400 ns = dev_alloc_skb(skb->len + 128);
2402 netdev_err(ppp->dev, "PPP: no memory "
2407 skb_copy_bits(skb, 0, skb_put(ns, skb->len), skb->len);
2412 skb->ip_summed = CHECKSUM_NONE;
2414 len = slhc_uncompress(ppp->vj, skb->data + 2, skb->len - 2);
2416 netdev_printk(KERN_DEBUG, ppp->dev,
2417 "PPP: VJ decompression error\n");
2422 skb_put(skb, len - skb->len);
2423 else if (len < skb->len)
2428 case PPP_VJC_UNCOMP:
2429 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2432 /* Until we fix the decompressor need to make sure
2433 * data portion is linear.
2435 if (!pskb_may_pull(skb, skb->len))
2438 if (slhc_remember(ppp->vj, skb->data + 2, skb->len - 2) <= 0) {
2439 netdev_err(ppp->dev, "PPP: VJ uncompressed error\n");
2446 ppp_ccp_peek(ppp, skb, 1);
2450 ++ppp->stats64.rx_packets;
2451 ppp->stats64.rx_bytes += skb->len - 2;
2453 npi = proto_to_npindex(proto);
2455 /* control or unknown frame - pass it to pppd */
2456 skb_queue_tail(&ppp->file.rq, skb);
2457 /* limit queue length by dropping old frames */
2458 while (ppp->file.rq.qlen > PPP_MAX_RQLEN &&
2459 (skb = skb_dequeue(&ppp->file.rq)))
2461 /* wake up any process polling or blocking on read */
2462 wake_up_interruptible(&ppp->file.rwait);
2465 /* network protocol frame - give it to the kernel */
2467 #ifdef CONFIG_PPP_FILTER
2468 /* check if the packet passes the pass and active filters */
2469 /* the filter instructions are constructed assuming
2470 a four-byte PPP header on each packet */
2471 if (ppp->pass_filter || ppp->active_filter) {
2472 if (skb_unclone(skb, GFP_ATOMIC))
2475 *(u8 *)skb_push(skb, 2) = 0;
2476 if (ppp->pass_filter &&
2477 bpf_prog_run(ppp->pass_filter, skb) == 0) {
2479 netdev_printk(KERN_DEBUG, ppp->dev,
2480 "PPP: inbound frame "
2485 if (!(ppp->active_filter &&
2486 bpf_prog_run(ppp->active_filter, skb) == 0))
2487 ppp->last_recv = jiffies;
2490 #endif /* CONFIG_PPP_FILTER */
2491 ppp->last_recv = jiffies;
2493 if ((ppp->dev->flags & IFF_UP) == 0 ||
2494 ppp->npmode[npi] != NPMODE_PASS) {
2497 /* chop off protocol */
2498 skb_pull_rcsum(skb, 2);
2499 skb->dev = ppp->dev;
2500 skb->protocol = htons(npindex_to_ethertype[npi]);
2501 skb_reset_mac_header(skb);
2502 skb_scrub_packet(skb, !net_eq(ppp->ppp_net,
2503 dev_net(ppp->dev)));
2511 ppp_receive_error(ppp);
2514 static struct sk_buff *
2515 ppp_decompress_frame(struct ppp *ppp, struct sk_buff *skb)
2517 int proto = PPP_PROTO(skb);
2521 /* Until we fix all the decompressor's need to make sure
2522 * data portion is linear.
2524 if (!pskb_may_pull(skb, skb->len))
2527 if (proto == PPP_COMP) {
2530 switch(ppp->rcomp->compress_proto) {
2532 obuff_size = ppp->mru + PPP_HDRLEN + 1;
2535 obuff_size = ppp->mru + PPP_HDRLEN;
2539 ns = dev_alloc_skb(obuff_size);
2541 netdev_err(ppp->dev, "ppp_decompress_frame: "
2545 /* the decompressor still expects the A/C bytes in the hdr */
2546 len = ppp->rcomp->decompress(ppp->rc_state, skb->data - 2,
2547 skb->len + 2, ns->data, obuff_size);
2549 /* Pass the compressed frame to pppd as an
2550 error indication. */
2551 if (len == DECOMP_FATALERROR)
2552 ppp->rstate |= SC_DC_FERROR;
2560 skb_pull(skb, 2); /* pull off the A/C bytes */
2562 /* Don't call __ppp_decompress_proto() here, but instead rely on
2563 * corresponding algo (mppe/bsd/deflate) to decompress it.
2566 /* Uncompressed frame - pass to decompressor so it
2567 can update its dictionary if necessary. */
2568 if (ppp->rcomp->incomp)
2569 ppp->rcomp->incomp(ppp->rc_state, skb->data - 2,
2576 ppp->rstate |= SC_DC_ERROR;
2577 ppp_receive_error(ppp);
2581 #ifdef CONFIG_PPP_MULTILINK
2583 * Receive a multilink frame.
2584 * We put it on the reconstruction queue and then pull off
2585 * as many completed frames as we can.
2588 ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2592 int mphdrlen = (ppp->flags & SC_MP_SHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
2594 if (!pskb_may_pull(skb, mphdrlen + 1) || ppp->mrru == 0)
2595 goto err; /* no good, throw it away */
2597 /* Decode sequence number and begin/end bits */
2598 if (ppp->flags & SC_MP_SHORTSEQ) {
2599 seq = ((skb->data[2] & 0x0f) << 8) | skb->data[3];
2602 seq = (skb->data[3] << 16) | (skb->data[4] << 8)| skb->data[5];
2605 PPP_MP_CB(skb)->BEbits = skb->data[2];
2606 skb_pull(skb, mphdrlen); /* pull off PPP and MP headers */
2609 * Do protocol ID decompression on the first fragment of each packet.
2610 * We have to do that here, because ppp_receive_nonmp_frame() expects
2611 * decompressed protocol field.
2613 if (PPP_MP_CB(skb)->BEbits & B)
2614 __ppp_decompress_proto(skb);
2617 * Expand sequence number to 32 bits, making it as close
2618 * as possible to ppp->minseq.
2620 seq |= ppp->minseq & ~mask;
2621 if ((int)(ppp->minseq - seq) > (int)(mask >> 1))
2623 else if ((int)(seq - ppp->minseq) > (int)(mask >> 1))
2624 seq -= mask + 1; /* should never happen */
2625 PPP_MP_CB(skb)->sequence = seq;
2629 * If this packet comes before the next one we were expecting,
2632 if (seq_before(seq, ppp->nextseq)) {
2634 ++ppp->dev->stats.rx_dropped;
2635 ppp_receive_error(ppp);
2640 * Reevaluate minseq, the minimum over all channels of the
2641 * last sequence number received on each channel. Because of
2642 * the increasing sequence number rule, we know that any fragment
2643 * before `minseq' which hasn't arrived is never going to arrive.
2644 * The list of channels can't change because we have the receive
2645 * side of the ppp unit locked.
2647 list_for_each_entry(ch, &ppp->channels, clist) {
2648 if (seq_before(ch->lastseq, seq))
2651 if (seq_before(ppp->minseq, seq))
2654 /* Put the fragment on the reconstruction queue */
2655 ppp_mp_insert(ppp, skb);
2657 /* If the queue is getting long, don't wait any longer for packets
2658 before the start of the queue. */
2659 if (skb_queue_len(&ppp->mrq) >= PPP_MP_MAX_QLEN) {
2660 struct sk_buff *mskb = skb_peek(&ppp->mrq);
2661 if (seq_before(ppp->minseq, PPP_MP_CB(mskb)->sequence))
2662 ppp->minseq = PPP_MP_CB(mskb)->sequence;
2665 /* Pull completed packets off the queue and receive them. */
2666 while ((skb = ppp_mp_reconstruct(ppp))) {
2667 if (pskb_may_pull(skb, 2))
2668 ppp_receive_nonmp_frame(ppp, skb);
2670 ++ppp->dev->stats.rx_length_errors;
2672 ppp_receive_error(ppp);
2680 ppp_receive_error(ppp);
2684 * Insert a fragment on the MP reconstruction queue.
2685 * The queue is ordered by increasing sequence number.
2688 ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb)
2691 struct sk_buff_head *list = &ppp->mrq;
2692 u32 seq = PPP_MP_CB(skb)->sequence;
2694 /* N.B. we don't need to lock the list lock because we have the
2695 ppp unit receive-side lock. */
2696 skb_queue_walk(list, p) {
2697 if (seq_before(seq, PPP_MP_CB(p)->sequence))
2700 __skb_queue_before(list, p, skb);
2704 * Reconstruct a packet from the MP fragment queue.
2705 * We go through increasing sequence numbers until we find a
2706 * complete packet, or we get to the sequence number for a fragment
2707 * which hasn't arrived but might still do so.
2709 static struct sk_buff *
2710 ppp_mp_reconstruct(struct ppp *ppp)
2712 u32 seq = ppp->nextseq;
2713 u32 minseq = ppp->minseq;
2714 struct sk_buff_head *list = &ppp->mrq;
2715 struct sk_buff *p, *tmp;
2716 struct sk_buff *head, *tail;
2717 struct sk_buff *skb = NULL;
2718 int lost = 0, len = 0;
2720 if (ppp->mrru == 0) /* do nothing until mrru is set */
2722 head = __skb_peek(list);
2724 skb_queue_walk_safe(list, p, tmp) {
2726 if (seq_before(PPP_MP_CB(p)->sequence, seq)) {
2727 /* this can't happen, anyway ignore the skb */
2728 netdev_err(ppp->dev, "ppp_mp_reconstruct bad "
2730 PPP_MP_CB(p)->sequence, seq);
2731 __skb_unlink(p, list);
2735 if (PPP_MP_CB(p)->sequence != seq) {
2737 /* Fragment `seq' is missing. If it is after
2738 minseq, it might arrive later, so stop here. */
2739 if (seq_after(seq, minseq))
2741 /* Fragment `seq' is lost, keep going. */
2744 seq = seq_before(minseq, PPP_MP_CB(p)->sequence)?
2745 minseq + 1: PPP_MP_CB(p)->sequence;
2748 netdev_printk(KERN_DEBUG, ppp->dev,
2749 "lost frag %u..%u\n",
2756 * At this point we know that all the fragments from
2757 * ppp->nextseq to seq are either present or lost.
2758 * Also, there are no complete packets in the queue
2759 * that have no missing fragments and end before this
2763 /* B bit set indicates this fragment starts a packet */
2764 if (PPP_MP_CB(p)->BEbits & B) {
2772 /* Got a complete packet yet? */
2773 if (lost == 0 && (PPP_MP_CB(p)->BEbits & E) &&
2774 (PPP_MP_CB(head)->BEbits & B)) {
2775 if (len > ppp->mrru + 2) {
2776 ++ppp->dev->stats.rx_length_errors;
2777 netdev_printk(KERN_DEBUG, ppp->dev,
2778 "PPP: reconstructed packet"
2779 " is too long (%d)\n", len);
2784 ppp->nextseq = seq + 1;
2788 * If this is the ending fragment of a packet,
2789 * and we haven't found a complete valid packet yet,
2790 * we can discard up to and including this fragment.
2792 if (PPP_MP_CB(p)->BEbits & E) {
2793 struct sk_buff *tmp2;
2795 skb_queue_reverse_walk_from_safe(list, p, tmp2) {
2797 netdev_printk(KERN_DEBUG, ppp->dev,
2798 "discarding frag %u\n",
2799 PPP_MP_CB(p)->sequence);
2800 __skb_unlink(p, list);
2803 head = skb_peek(list);
2810 /* If we have a complete packet, copy it all into one skb. */
2812 /* If we have discarded any fragments,
2813 signal a receive error. */
2814 if (PPP_MP_CB(head)->sequence != ppp->nextseq) {
2815 skb_queue_walk_safe(list, p, tmp) {
2819 netdev_printk(KERN_DEBUG, ppp->dev,
2820 "discarding frag %u\n",
2821 PPP_MP_CB(p)->sequence);
2822 __skb_unlink(p, list);
2827 netdev_printk(KERN_DEBUG, ppp->dev,
2828 " missed pkts %u..%u\n",
2830 PPP_MP_CB(head)->sequence-1);
2831 ++ppp->dev->stats.rx_dropped;
2832 ppp_receive_error(ppp);
2837 struct sk_buff **fragpp = &skb_shinfo(skb)->frag_list;
2838 p = skb_queue_next(list, head);
2839 __skb_unlink(skb, list);
2840 skb_queue_walk_from_safe(list, p, tmp) {
2841 __skb_unlink(p, list);
2847 skb->data_len += p->len;
2848 skb->truesize += p->truesize;
2854 __skb_unlink(skb, list);
2857 ppp->nextseq = PPP_MP_CB(tail)->sequence + 1;
2862 #endif /* CONFIG_PPP_MULTILINK */
2865 * Channel interface.
2868 /* Create a new, unattached ppp channel. */
2869 int ppp_register_channel(struct ppp_channel *chan)
2871 return ppp_register_net_channel(current->nsproxy->net_ns, chan);
2874 /* Create a new, unattached ppp channel for specified net. */
2875 int ppp_register_net_channel(struct net *net, struct ppp_channel *chan)
2877 struct channel *pch;
2880 pch = kzalloc(sizeof(struct channel), GFP_KERNEL);
2884 pn = ppp_pernet(net);
2888 pch->chan_net = get_net_track(net, &pch->ns_tracker, GFP_KERNEL);
2890 init_ppp_file(&pch->file, CHANNEL);
2891 pch->file.hdrlen = chan->hdrlen;
2892 #ifdef CONFIG_PPP_MULTILINK
2894 #endif /* CONFIG_PPP_MULTILINK */
2895 init_rwsem(&pch->chan_sem);
2896 spin_lock_init(&pch->downl);
2897 rwlock_init(&pch->upl);
2899 spin_lock_bh(&pn->all_channels_lock);
2900 pch->file.index = ++pn->last_channel_index;
2901 list_add(&pch->list, &pn->new_channels);
2902 atomic_inc(&channel_count);
2903 spin_unlock_bh(&pn->all_channels_lock);
2909 * Return the index of a channel.
2911 int ppp_channel_index(struct ppp_channel *chan)
2913 struct channel *pch = chan->ppp;
2916 return pch->file.index;
2921 * Return the PPP unit number to which a channel is connected.
2923 int ppp_unit_number(struct ppp_channel *chan)
2925 struct channel *pch = chan->ppp;
2929 read_lock_bh(&pch->upl);
2931 unit = pch->ppp->file.index;
2932 read_unlock_bh(&pch->upl);
2938 * Return the PPP device interface name of a channel.
2940 char *ppp_dev_name(struct ppp_channel *chan)
2942 struct channel *pch = chan->ppp;
2946 read_lock_bh(&pch->upl);
2947 if (pch->ppp && pch->ppp->dev)
2948 name = pch->ppp->dev->name;
2949 read_unlock_bh(&pch->upl);
2956 * Disconnect a channel from the generic layer.
2957 * This must be called in process context.
2960 ppp_unregister_channel(struct ppp_channel *chan)
2962 struct channel *pch = chan->ppp;
2966 return; /* should never happen */
2971 * This ensures that we have returned from any calls into the
2972 * the channel's start_xmit or ioctl routine before we proceed.
2974 down_write(&pch->chan_sem);
2975 spin_lock_bh(&pch->downl);
2977 spin_unlock_bh(&pch->downl);
2978 up_write(&pch->chan_sem);
2979 ppp_disconnect_channel(pch);
2981 pn = ppp_pernet(pch->chan_net);
2982 spin_lock_bh(&pn->all_channels_lock);
2983 list_del(&pch->list);
2984 spin_unlock_bh(&pn->all_channels_lock);
2986 ppp_unbridge_channels(pch);
2989 wake_up_interruptible(&pch->file.rwait);
2991 if (refcount_dec_and_test(&pch->file.refcnt))
2992 ppp_destroy_channel(pch);
2996 * Callback from a channel when it can accept more to transmit.
2997 * This should be called at BH/softirq level, not interrupt level.
3000 ppp_output_wakeup(struct ppp_channel *chan)
3002 struct channel *pch = chan->ppp;
3006 ppp_channel_push(pch);
3010 * Compression control.
3013 /* Process the PPPIOCSCOMPRESS ioctl. */
3015 ppp_set_compress(struct ppp *ppp, struct ppp_option_data *data)
3018 struct compressor *cp, *ocomp;
3019 void *state, *ostate;
3020 unsigned char ccp_option[CCP_MAX_OPTION_LENGTH];
3022 if (data->length > CCP_MAX_OPTION_LENGTH)
3024 if (copy_from_user(ccp_option, data->ptr, data->length))
3028 if (data->length < 2 || ccp_option[1] < 2 || ccp_option[1] > data->length)
3031 cp = try_then_request_module(
3032 find_compressor(ccp_option[0]),
3033 "ppp-compress-%d", ccp_option[0]);
3038 if (data->transmit) {
3039 state = cp->comp_alloc(ccp_option, data->length);
3042 ppp->xstate &= ~SC_COMP_RUN;
3044 ostate = ppp->xc_state;
3046 ppp->xc_state = state;
3047 ppp_xmit_unlock(ppp);
3049 ocomp->comp_free(ostate);
3050 module_put(ocomp->owner);
3054 module_put(cp->owner);
3057 state = cp->decomp_alloc(ccp_option, data->length);
3060 ppp->rstate &= ~SC_DECOMP_RUN;
3062 ostate = ppp->rc_state;
3064 ppp->rc_state = state;
3065 ppp_recv_unlock(ppp);
3067 ocomp->decomp_free(ostate);
3068 module_put(ocomp->owner);
3072 module_put(cp->owner);
3080 * Look at a CCP packet and update our state accordingly.
3081 * We assume the caller has the xmit or recv path locked.
3084 ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound)
3089 if (!pskb_may_pull(skb, CCP_HDRLEN + 2))
3090 return; /* no header */
3093 switch (CCP_CODE(dp)) {
3096 /* A ConfReq starts negotiation of compression
3097 * in one direction of transmission,
3098 * and hence brings it down...but which way?
3101 * A ConfReq indicates what the sender would like to receive
3104 /* He is proposing what I should send */
3105 ppp->xstate &= ~SC_COMP_RUN;
3107 /* I am proposing to what he should send */
3108 ppp->rstate &= ~SC_DECOMP_RUN;
3115 * CCP is going down, both directions of transmission
3117 ppp->rstate &= ~SC_DECOMP_RUN;
3118 ppp->xstate &= ~SC_COMP_RUN;
3122 if ((ppp->flags & (SC_CCP_OPEN | SC_CCP_UP)) != SC_CCP_OPEN)
3124 len = CCP_LENGTH(dp);
3125 if (!pskb_may_pull(skb, len + 2))
3126 return; /* too short */
3129 if (len < CCP_OPT_MINLEN || len < CCP_OPT_LENGTH(dp))
3132 /* we will start receiving compressed packets */
3135 if (ppp->rcomp->decomp_init(ppp->rc_state, dp, len,
3136 ppp->file.index, 0, ppp->mru, ppp->debug)) {
3137 ppp->rstate |= SC_DECOMP_RUN;
3138 ppp->rstate &= ~(SC_DC_ERROR | SC_DC_FERROR);
3141 /* we will soon start sending compressed packets */
3144 if (ppp->xcomp->comp_init(ppp->xc_state, dp, len,
3145 ppp->file.index, 0, ppp->debug))
3146 ppp->xstate |= SC_COMP_RUN;
3151 /* reset the [de]compressor */
3152 if ((ppp->flags & SC_CCP_UP) == 0)
3155 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN)) {
3156 ppp->rcomp->decomp_reset(ppp->rc_state);
3157 ppp->rstate &= ~SC_DC_ERROR;
3160 if (ppp->xc_state && (ppp->xstate & SC_COMP_RUN))
3161 ppp->xcomp->comp_reset(ppp->xc_state);
3167 /* Free up compression resources. */
3169 ppp_ccp_closed(struct ppp *ppp)
3171 void *xstate, *rstate;
3172 struct compressor *xcomp, *rcomp;
3175 ppp->flags &= ~(SC_CCP_OPEN | SC_CCP_UP);
3178 xstate = ppp->xc_state;
3179 ppp->xc_state = NULL;
3182 rstate = ppp->rc_state;
3183 ppp->rc_state = NULL;
3187 xcomp->comp_free(xstate);
3188 module_put(xcomp->owner);
3191 rcomp->decomp_free(rstate);
3192 module_put(rcomp->owner);
3196 /* List of compressors. */
3197 static LIST_HEAD(compressor_list);
3198 static DEFINE_SPINLOCK(compressor_list_lock);
3200 struct compressor_entry {
3201 struct list_head list;
3202 struct compressor *comp;
3205 static struct compressor_entry *
3206 find_comp_entry(int proto)
3208 struct compressor_entry *ce;
3210 list_for_each_entry(ce, &compressor_list, list) {
3211 if (ce->comp->compress_proto == proto)
3217 /* Register a compressor */
3219 ppp_register_compressor(struct compressor *cp)
3221 struct compressor_entry *ce;
3223 spin_lock(&compressor_list_lock);
3225 if (find_comp_entry(cp->compress_proto))
3228 ce = kmalloc(sizeof(struct compressor_entry), GFP_ATOMIC);
3233 list_add(&ce->list, &compressor_list);
3235 spin_unlock(&compressor_list_lock);
3239 /* Unregister a compressor */
3241 ppp_unregister_compressor(struct compressor *cp)
3243 struct compressor_entry *ce;
3245 spin_lock(&compressor_list_lock);
3246 ce = find_comp_entry(cp->compress_proto);
3247 if (ce && ce->comp == cp) {
3248 list_del(&ce->list);
3251 spin_unlock(&compressor_list_lock);
3254 /* Find a compressor. */
3255 static struct compressor *
3256 find_compressor(int type)
3258 struct compressor_entry *ce;
3259 struct compressor *cp = NULL;
3261 spin_lock(&compressor_list_lock);
3262 ce = find_comp_entry(type);
3265 if (!try_module_get(cp->owner))
3268 spin_unlock(&compressor_list_lock);
3273 * Miscelleneous stuff.
3277 ppp_get_stats(struct ppp *ppp, struct ppp_stats *st)
3279 struct slcompress *vj = ppp->vj;
3281 memset(st, 0, sizeof(*st));
3282 st->p.ppp_ipackets = ppp->stats64.rx_packets;
3283 st->p.ppp_ierrors = ppp->dev->stats.rx_errors;
3284 st->p.ppp_ibytes = ppp->stats64.rx_bytes;
3285 st->p.ppp_opackets = ppp->stats64.tx_packets;
3286 st->p.ppp_oerrors = ppp->dev->stats.tx_errors;
3287 st->p.ppp_obytes = ppp->stats64.tx_bytes;
3290 st->vj.vjs_packets = vj->sls_o_compressed + vj->sls_o_uncompressed;
3291 st->vj.vjs_compressed = vj->sls_o_compressed;
3292 st->vj.vjs_searches = vj->sls_o_searches;
3293 st->vj.vjs_misses = vj->sls_o_misses;
3294 st->vj.vjs_errorin = vj->sls_i_error;
3295 st->vj.vjs_tossed = vj->sls_i_tossed;
3296 st->vj.vjs_uncompressedin = vj->sls_i_uncompressed;
3297 st->vj.vjs_compressedin = vj->sls_i_compressed;
3301 * Stuff for handling the lists of ppp units and channels
3302 * and for initialization.
3306 * Create a new ppp interface unit. Fails if it can't allocate memory
3307 * or if there is already a unit with the requested number.
3308 * unit == -1 means allocate a new number.
3310 static int ppp_create_interface(struct net *net, struct file *file, int *unit)
3312 struct ppp_config conf = {
3315 .ifname_is_set = false,
3317 struct net_device *dev;
3321 dev = alloc_netdev(sizeof(struct ppp), "", NET_NAME_ENUM, ppp_setup);
3326 dev_net_set(dev, net);
3327 dev->rtnl_link_ops = &ppp_link_ops;
3331 err = ppp_dev_configure(net, dev, &conf);
3334 ppp = netdev_priv(dev);
3335 *unit = ppp->file.index;
3349 * Initialize a ppp_file structure.
3352 init_ppp_file(struct ppp_file *pf, int kind)
3355 skb_queue_head_init(&pf->xq);
3356 skb_queue_head_init(&pf->rq);
3357 refcount_set(&pf->refcnt, 1);
3358 init_waitqueue_head(&pf->rwait);
3362 * Free the memory used by a ppp unit. This is only called once
3363 * there are no channels connected to the unit and no file structs
3364 * that reference the unit.
3366 static void ppp_destroy_interface(struct ppp *ppp)
3368 atomic_dec(&ppp_unit_count);
3370 if (!ppp->file.dead || ppp->n_channels) {
3371 /* "can't happen" */
3372 netdev_err(ppp->dev, "ppp: destroying ppp struct %p "
3373 "but dead=%d n_channels=%d !\n",
3374 ppp, ppp->file.dead, ppp->n_channels);
3378 ppp_ccp_closed(ppp);
3383 skb_queue_purge(&ppp->file.xq);
3384 skb_queue_purge(&ppp->file.rq);
3385 #ifdef CONFIG_PPP_MULTILINK
3386 skb_queue_purge(&ppp->mrq);
3387 #endif /* CONFIG_PPP_MULTILINK */
3388 #ifdef CONFIG_PPP_FILTER
3389 if (ppp->pass_filter) {
3390 bpf_prog_destroy(ppp->pass_filter);
3391 ppp->pass_filter = NULL;
3394 if (ppp->active_filter) {
3395 bpf_prog_destroy(ppp->active_filter);
3396 ppp->active_filter = NULL;
3398 #endif /* CONFIG_PPP_FILTER */
3400 kfree_skb(ppp->xmit_pending);
3401 free_percpu(ppp->xmit_recursion);
3403 free_netdev(ppp->dev);
3407 * Locate an existing ppp unit.
3408 * The caller should have locked the all_ppp_mutex.
3411 ppp_find_unit(struct ppp_net *pn, int unit)
3413 return unit_find(&pn->units_idr, unit);
3417 * Locate an existing ppp channel.
3418 * The caller should have locked the all_channels_lock.
3419 * First we look in the new_channels list, then in the
3420 * all_channels list. If found in the new_channels list,
3421 * we move it to the all_channels list. This is for speed
3422 * when we have a lot of channels in use.
3424 static struct channel *
3425 ppp_find_channel(struct ppp_net *pn, int unit)
3427 struct channel *pch;
3429 list_for_each_entry(pch, &pn->new_channels, list) {
3430 if (pch->file.index == unit) {
3431 list_move(&pch->list, &pn->all_channels);
3436 list_for_each_entry(pch, &pn->all_channels, list) {
3437 if (pch->file.index == unit)
3445 * Connect a PPP channel to a PPP interface unit.
3448 ppp_connect_channel(struct channel *pch, int unit)
3455 pn = ppp_pernet(pch->chan_net);
3457 mutex_lock(&pn->all_ppp_mutex);
3458 ppp = ppp_find_unit(pn, unit);
3461 write_lock_bh(&pch->upl);
3464 rcu_dereference_protected(pch->bridge, lockdep_is_held(&pch->upl)))
3468 spin_lock_bh(&pch->downl);
3470 /* Don't connect unregistered channels */
3471 spin_unlock_bh(&pch->downl);
3476 spin_unlock_bh(&pch->downl);
3477 if (pch->file.hdrlen > ppp->file.hdrlen)
3478 ppp->file.hdrlen = pch->file.hdrlen;
3479 hdrlen = pch->file.hdrlen + 2; /* for protocol bytes */
3480 if (hdrlen > ppp->dev->hard_header_len)
3481 ppp->dev->hard_header_len = hdrlen;
3482 list_add_tail(&pch->clist, &ppp->channels);
3485 refcount_inc(&ppp->file.refcnt);
3490 write_unlock_bh(&pch->upl);
3492 mutex_unlock(&pn->all_ppp_mutex);
3497 * Disconnect a channel from its ppp unit.
3500 ppp_disconnect_channel(struct channel *pch)
3505 write_lock_bh(&pch->upl);
3508 write_unlock_bh(&pch->upl);
3510 /* remove it from the ppp unit's list */
3512 list_del(&pch->clist);
3513 if (--ppp->n_channels == 0)
3514 wake_up_interruptible(&ppp->file.rwait);
3516 if (refcount_dec_and_test(&ppp->file.refcnt))
3517 ppp_destroy_interface(ppp);
3524 * Free up the resources used by a ppp channel.
3526 static void ppp_destroy_channel(struct channel *pch)
3528 put_net_track(pch->chan_net, &pch->ns_tracker);
3529 pch->chan_net = NULL;
3531 atomic_dec(&channel_count);
3533 if (!pch->file.dead) {
3534 /* "can't happen" */
3535 pr_err("ppp: destroying undead channel %p !\n", pch);
3538 skb_queue_purge(&pch->file.xq);
3539 skb_queue_purge(&pch->file.rq);
3543 static void __exit ppp_cleanup(void)
3545 /* should never happen */
3546 if (atomic_read(&ppp_unit_count) || atomic_read(&channel_count))
3547 pr_err("PPP: removing module but units remain!\n");
3548 rtnl_link_unregister(&ppp_link_ops);
3549 unregister_chrdev(PPP_MAJOR, "ppp");
3550 device_destroy(ppp_class, MKDEV(PPP_MAJOR, 0));
3551 class_destroy(ppp_class);
3552 unregister_pernet_device(&ppp_net_ops);
3556 * Units handling. Caller must protect concurrent access
3557 * by holding all_ppp_mutex
3560 /* associate pointer with specified number */
3561 static int unit_set(struct idr *p, void *ptr, int n)
3565 unit = idr_alloc(p, ptr, n, n + 1, GFP_KERNEL);
3566 if (unit == -ENOSPC)
3571 /* get new free unit number and associate pointer with it */
3572 static int unit_get(struct idr *p, void *ptr, int min)
3574 return idr_alloc(p, ptr, min, 0, GFP_KERNEL);
3577 /* put unit number back to a pool */
3578 static void unit_put(struct idr *p, int n)
3583 /* get pointer associated with the number */
3584 static void *unit_find(struct idr *p, int n)
3586 return idr_find(p, n);
3589 /* Module/initialization stuff */
3591 module_init(ppp_init);
3592 module_exit(ppp_cleanup);
3594 EXPORT_SYMBOL(ppp_register_net_channel);
3595 EXPORT_SYMBOL(ppp_register_channel);
3596 EXPORT_SYMBOL(ppp_unregister_channel);
3597 EXPORT_SYMBOL(ppp_channel_index);
3598 EXPORT_SYMBOL(ppp_unit_number);
3599 EXPORT_SYMBOL(ppp_dev_name);
3600 EXPORT_SYMBOL(ppp_input);
3601 EXPORT_SYMBOL(ppp_input_error);
3602 EXPORT_SYMBOL(ppp_output_wakeup);
3603 EXPORT_SYMBOL(ppp_register_compressor);
3604 EXPORT_SYMBOL(ppp_unregister_compressor);
3605 MODULE_LICENSE("GPL");
3606 MODULE_ALIAS_CHARDEV(PPP_MAJOR, 0);
3607 MODULE_ALIAS_RTNL_LINK("ppp");
3608 MODULE_ALIAS("devname:ppp");