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/module.h>
26 #include <linux/kernel.h>
27 #include <linux/sched/signal.h>
28 #include <linux/kmod.h>
29 #include <linux/init.h>
30 #include <linux/list.h>
31 #include <linux/idr.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/ppp-ioctl.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/rwsem.h>
46 #include <linux/stddef.h>
47 #include <linux/device.h>
48 #include <linux/mutex.h>
49 #include <linux/slab.h>
50 #include <linux/file.h>
51 #include <asm/unaligned.h>
52 #include <net/slhc_vj.h>
53 #include <linux/atomic.h>
54 #include <linux/refcount.h>
56 #include <linux/nsproxy.h>
57 #include <net/net_namespace.h>
58 #include <net/netns/generic.h>
60 #define PPP_VERSION "2.4.2"
63 * Network protocols we support.
65 #define NP_IP 0 /* Internet Protocol V4 */
66 #define NP_IPV6 1 /* Internet Protocol V6 */
67 #define NP_IPX 2 /* IPX protocol */
68 #define NP_AT 3 /* Appletalk protocol */
69 #define NP_MPLS_UC 4 /* MPLS unicast */
70 #define NP_MPLS_MC 5 /* MPLS multicast */
71 #define NUM_NP 6 /* Number of NPs. */
73 #define MPHDRLEN 6 /* multilink protocol header length */
74 #define MPHDRLEN_SSN 4 /* ditto with short sequence numbers */
77 * An instance of /dev/ppp can be associated with either a ppp
78 * interface unit or a ppp channel. In both cases, file->private_data
79 * points to one of these.
85 struct sk_buff_head xq; /* pppd transmit queue */
86 struct sk_buff_head rq; /* receive queue for pppd */
87 wait_queue_head_t rwait; /* for poll on reading /dev/ppp */
88 refcount_t refcnt; /* # refs (incl /dev/ppp attached) */
89 int hdrlen; /* space to leave for headers */
90 int index; /* interface unit / channel number */
91 int dead; /* unit/channel has been shut down */
94 #define PF_TO_X(pf, X) container_of(pf, X, file)
96 #define PF_TO_PPP(pf) PF_TO_X(pf, struct ppp)
97 #define PF_TO_CHANNEL(pf) PF_TO_X(pf, struct channel)
100 * Data structure to hold primary network stats for which
101 * we want to use 64 bit storage. Other network stats
102 * are stored in dev->stats of the ppp strucute.
104 struct ppp_link_stats {
112 * Data structure describing one ppp unit.
113 * A ppp unit corresponds to a ppp network interface device
114 * and represents a multilink bundle.
115 * It can have 0 or more ppp channels connected to it.
118 struct ppp_file file; /* stuff for read/write/poll 0 */
119 struct file *owner; /* file that owns this unit 48 */
120 struct list_head channels; /* list of attached channels 4c */
121 int n_channels; /* how many channels are attached 54 */
122 spinlock_t rlock; /* lock for receive side 58 */
123 spinlock_t wlock; /* lock for transmit side 5c */
124 int __percpu *xmit_recursion; /* xmit recursion detect */
125 int mru; /* max receive unit 60 */
126 unsigned int flags; /* control bits 64 */
127 unsigned int xstate; /* transmit state bits 68 */
128 unsigned int rstate; /* receive state bits 6c */
129 int debug; /* debug flags 70 */
130 struct slcompress *vj; /* state for VJ header compression */
131 enum NPmode npmode[NUM_NP]; /* what to do with each net proto 78 */
132 struct sk_buff *xmit_pending; /* a packet ready to go out 88 */
133 struct compressor *xcomp; /* transmit packet compressor 8c */
134 void *xc_state; /* its internal state 90 */
135 struct compressor *rcomp; /* receive decompressor 94 */
136 void *rc_state; /* its internal state 98 */
137 unsigned long last_xmit; /* jiffies when last pkt sent 9c */
138 unsigned long last_recv; /* jiffies when last pkt rcvd a0 */
139 struct net_device *dev; /* network interface device a4 */
140 int closing; /* is device closing down? a8 */
141 #ifdef CONFIG_PPP_MULTILINK
142 int nxchan; /* next channel to send something on */
143 u32 nxseq; /* next sequence number to send */
144 int mrru; /* MP: max reconst. receive unit */
145 u32 nextseq; /* MP: seq no of next packet */
146 u32 minseq; /* MP: min of most recent seqnos */
147 struct sk_buff_head mrq; /* MP: receive reconstruction queue */
148 #endif /* CONFIG_PPP_MULTILINK */
149 #ifdef CONFIG_PPP_FILTER
150 struct bpf_prog *pass_filter; /* filter for packets to pass */
151 struct bpf_prog *active_filter; /* filter for pkts to reset idle */
152 #endif /* CONFIG_PPP_FILTER */
153 struct net *ppp_net; /* the net we belong to */
154 struct ppp_link_stats stats64; /* 64 bit network stats */
158 * Bits in flags: SC_NO_TCP_CCID, SC_CCP_OPEN, SC_CCP_UP, SC_LOOP_TRAFFIC,
159 * SC_MULTILINK, SC_MP_SHORTSEQ, SC_MP_XSHORTSEQ, SC_COMP_TCP, SC_REJ_COMP_TCP,
161 * Bits in rstate: SC_DECOMP_RUN, SC_DC_ERROR, SC_DC_FERROR.
162 * Bits in xstate: SC_COMP_RUN
164 #define SC_FLAG_BITS (SC_NO_TCP_CCID|SC_CCP_OPEN|SC_CCP_UP|SC_LOOP_TRAFFIC \
165 |SC_MULTILINK|SC_MP_SHORTSEQ|SC_MP_XSHORTSEQ \
166 |SC_COMP_TCP|SC_REJ_COMP_TCP|SC_MUST_COMP)
169 * Private data structure for each channel.
170 * This includes the data structure used for multilink.
173 struct ppp_file file; /* stuff for read/write/poll */
174 struct list_head list; /* link in all/new_channels list */
175 struct ppp_channel *chan; /* public channel data structure */
176 struct rw_semaphore chan_sem; /* protects `chan' during chan ioctl */
177 spinlock_t downl; /* protects `chan', file.xq dequeue */
178 struct ppp *ppp; /* ppp unit we're connected to */
179 struct net *chan_net; /* the net channel belongs to */
180 struct list_head clist; /* link in list of channels per unit */
181 rwlock_t upl; /* protects `ppp' */
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, unsigned long arg);
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);
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)
305 return net_generic(net, ppp_net_id);
308 /* Translates a PPP protocol number to a NP index (NP == network protocol) */
309 static inline int proto_to_npindex(int proto)
328 /* Translates an NP index into a PPP protocol number */
329 static const int npindex_to_proto[NUM_NP] = {
338 /* Translates an ethertype into an NP index */
339 static inline int ethertype_to_npindex(int ethertype)
359 /* Translates an NP index into an ethertype */
360 static const int npindex_to_ethertype[NUM_NP] = {
372 #define ppp_xmit_lock(ppp) spin_lock_bh(&(ppp)->wlock)
373 #define ppp_xmit_unlock(ppp) spin_unlock_bh(&(ppp)->wlock)
374 #define ppp_recv_lock(ppp) spin_lock_bh(&(ppp)->rlock)
375 #define ppp_recv_unlock(ppp) spin_unlock_bh(&(ppp)->rlock)
376 #define ppp_lock(ppp) do { ppp_xmit_lock(ppp); \
377 ppp_recv_lock(ppp); } while (0)
378 #define ppp_unlock(ppp) do { ppp_recv_unlock(ppp); \
379 ppp_xmit_unlock(ppp); } while (0)
382 * /dev/ppp device routines.
383 * The /dev/ppp device is used by pppd to control the ppp unit.
384 * It supports the read, write, ioctl and poll functions.
385 * Open instances of /dev/ppp can be in one of three states:
386 * unattached, attached to a ppp unit, or attached to a ppp channel.
388 static int ppp_open(struct inode *inode, struct file *file)
391 * This could (should?) be enforced by the permissions on /dev/ppp.
393 if (!ns_capable(file->f_cred->user_ns, CAP_NET_ADMIN))
398 static int ppp_release(struct inode *unused, struct file *file)
400 struct ppp_file *pf = file->private_data;
404 file->private_data = NULL;
405 if (pf->kind == INTERFACE) {
408 if (file == ppp->owner)
409 unregister_netdevice(ppp->dev);
412 if (refcount_dec_and_test(&pf->refcnt)) {
415 ppp_destroy_interface(PF_TO_PPP(pf));
418 ppp_destroy_channel(PF_TO_CHANNEL(pf));
426 static ssize_t ppp_read(struct file *file, char __user *buf,
427 size_t count, loff_t *ppos)
429 struct ppp_file *pf = file->private_data;
430 DECLARE_WAITQUEUE(wait, current);
432 struct sk_buff *skb = NULL;
440 add_wait_queue(&pf->rwait, &wait);
442 set_current_state(TASK_INTERRUPTIBLE);
443 skb = skb_dequeue(&pf->rq);
449 if (pf->kind == INTERFACE) {
451 * Return 0 (EOF) on an interface that has no
452 * channels connected, unless it is looping
453 * network traffic (demand mode).
455 struct ppp *ppp = PF_TO_PPP(pf);
458 if (ppp->n_channels == 0 &&
459 (ppp->flags & SC_LOOP_TRAFFIC) == 0) {
460 ppp_recv_unlock(ppp);
463 ppp_recv_unlock(ppp);
466 if (file->f_flags & O_NONBLOCK)
469 if (signal_pending(current))
473 set_current_state(TASK_RUNNING);
474 remove_wait_queue(&pf->rwait, &wait);
480 if (skb->len > count)
485 iov_iter_init(&to, READ, &iov, 1, count);
486 if (skb_copy_datagram_iter(skb, 0, &to, skb->len))
496 static ssize_t ppp_write(struct file *file, const char __user *buf,
497 size_t count, loff_t *ppos)
499 struct ppp_file *pf = file->private_data;
506 skb = alloc_skb(count + pf->hdrlen, GFP_KERNEL);
509 skb_reserve(skb, pf->hdrlen);
511 if (copy_from_user(skb_put(skb, count), buf, count)) {
518 ppp_xmit_process(PF_TO_PPP(pf), skb);
521 skb_queue_tail(&pf->xq, skb);
522 ppp_channel_push(PF_TO_CHANNEL(pf));
532 /* No kernel lock - fine */
533 static __poll_t ppp_poll(struct file *file, poll_table *wait)
535 struct ppp_file *pf = file->private_data;
540 poll_wait(file, &pf->rwait, wait);
541 mask = EPOLLOUT | EPOLLWRNORM;
542 if (skb_peek(&pf->rq))
543 mask |= EPOLLIN | EPOLLRDNORM;
546 else if (pf->kind == INTERFACE) {
547 /* see comment in ppp_read */
548 struct ppp *ppp = PF_TO_PPP(pf);
551 if (ppp->n_channels == 0 &&
552 (ppp->flags & SC_LOOP_TRAFFIC) == 0)
553 mask |= EPOLLIN | EPOLLRDNORM;
554 ppp_recv_unlock(ppp);
560 #ifdef CONFIG_PPP_FILTER
561 static int get_filter(void __user *arg, struct sock_filter **p)
563 struct sock_fprog uprog;
564 struct sock_filter *code = NULL;
567 if (copy_from_user(&uprog, arg, sizeof(uprog)))
575 len = uprog.len * sizeof(struct sock_filter);
576 code = memdup_user(uprog.filter, len);
578 return PTR_ERR(code);
583 #endif /* CONFIG_PPP_FILTER */
585 static long ppp_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
589 int err = -EFAULT, val, val2, i;
590 struct ppp_idle idle;
593 struct slcompress *vj;
594 void __user *argp = (void __user *)arg;
595 int __user *p = argp;
597 mutex_lock(&ppp_mutex);
599 pf = file->private_data;
601 err = ppp_unattached_ioctl(current->nsproxy->net_ns,
606 if (cmd == PPPIOCDETACH) {
608 * PPPIOCDETACH is no longer supported as it was heavily broken,
609 * and is only known to have been used by pppd older than
610 * ppp-2.4.2 (released November 2003).
612 pr_warn_once("%s (%d) used obsolete PPPIOCDETACH ioctl\n",
613 current->comm, current->pid);
618 if (pf->kind == CHANNEL) {
620 struct ppp_channel *chan;
622 pch = PF_TO_CHANNEL(pf);
626 if (get_user(unit, p))
628 err = ppp_connect_channel(pch, unit);
632 err = ppp_disconnect_channel(pch);
636 down_read(&pch->chan_sem);
639 if (chan && chan->ops->ioctl)
640 err = chan->ops->ioctl(chan, cmd, arg);
641 up_read(&pch->chan_sem);
646 if (pf->kind != INTERFACE) {
648 pr_err("PPP: not interface or channel??\n");
656 if (get_user(val, p))
663 if (get_user(val, p))
666 cflags = ppp->flags & ~val;
667 #ifdef CONFIG_PPP_MULTILINK
668 if (!(ppp->flags & SC_MULTILINK) && (val & SC_MULTILINK))
671 ppp->flags = val & SC_FLAG_BITS;
673 if (cflags & SC_CCP_OPEN)
679 val = ppp->flags | ppp->xstate | ppp->rstate;
680 if (put_user(val, p))
685 case PPPIOCSCOMPRESS:
686 err = ppp_set_compress(ppp, arg);
690 if (put_user(ppp->file.index, p))
696 if (get_user(val, p))
703 if (put_user(ppp->debug, p))
709 idle.xmit_idle = (jiffies - ppp->last_xmit) / HZ;
710 idle.recv_idle = (jiffies - ppp->last_recv) / HZ;
711 if (copy_to_user(argp, &idle, sizeof(idle)))
717 if (get_user(val, p))
720 if ((val >> 16) != 0) {
724 vj = slhc_init(val2+1, val+1);
739 if (copy_from_user(&npi, argp, sizeof(npi)))
741 err = proto_to_npindex(npi.protocol);
745 if (cmd == PPPIOCGNPMODE) {
747 npi.mode = ppp->npmode[i];
748 if (copy_to_user(argp, &npi, sizeof(npi)))
751 ppp->npmode[i] = npi.mode;
752 /* we may be able to transmit more packets now (??) */
753 netif_wake_queue(ppp->dev);
758 #ifdef CONFIG_PPP_FILTER
761 struct sock_filter *code;
763 err = get_filter(argp, &code);
765 struct bpf_prog *pass_filter = NULL;
766 struct sock_fprog_kern fprog = {
773 err = bpf_prog_create(&pass_filter, &fprog);
776 if (ppp->pass_filter)
777 bpf_prog_destroy(ppp->pass_filter);
778 ppp->pass_filter = pass_filter;
787 struct sock_filter *code;
789 err = get_filter(argp, &code);
791 struct bpf_prog *active_filter = NULL;
792 struct sock_fprog_kern fprog = {
799 err = bpf_prog_create(&active_filter, &fprog);
802 if (ppp->active_filter)
803 bpf_prog_destroy(ppp->active_filter);
804 ppp->active_filter = active_filter;
811 #endif /* CONFIG_PPP_FILTER */
813 #ifdef CONFIG_PPP_MULTILINK
815 if (get_user(val, p))
819 ppp_recv_unlock(ppp);
822 #endif /* CONFIG_PPP_MULTILINK */
829 mutex_unlock(&ppp_mutex);
834 static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
835 struct file *file, unsigned int cmd, unsigned long arg)
837 int unit, err = -EFAULT;
839 struct channel *chan;
841 int __user *p = (int __user *)arg;
845 /* Create a new ppp unit */
846 if (get_user(unit, p))
848 err = ppp_create_interface(net, file, &unit);
853 if (put_user(unit, p))
859 /* Attach to an existing ppp unit */
860 if (get_user(unit, p))
863 pn = ppp_pernet(net);
864 mutex_lock(&pn->all_ppp_mutex);
865 ppp = ppp_find_unit(pn, unit);
867 refcount_inc(&ppp->file.refcnt);
868 file->private_data = &ppp->file;
871 mutex_unlock(&pn->all_ppp_mutex);
875 if (get_user(unit, p))
878 pn = ppp_pernet(net);
879 spin_lock_bh(&pn->all_channels_lock);
880 chan = ppp_find_channel(pn, unit);
882 refcount_inc(&chan->file.refcnt);
883 file->private_data = &chan->file;
886 spin_unlock_bh(&pn->all_channels_lock);
896 static const struct file_operations ppp_device_fops = {
897 .owner = THIS_MODULE,
901 .unlocked_ioctl = ppp_ioctl,
903 .release = ppp_release,
904 .llseek = noop_llseek,
907 static __net_init int ppp_init_net(struct net *net)
909 struct ppp_net *pn = net_generic(net, ppp_net_id);
911 idr_init(&pn->units_idr);
912 mutex_init(&pn->all_ppp_mutex);
914 INIT_LIST_HEAD(&pn->all_channels);
915 INIT_LIST_HEAD(&pn->new_channels);
917 spin_lock_init(&pn->all_channels_lock);
922 static __net_exit void ppp_exit_net(struct net *net)
924 struct ppp_net *pn = net_generic(net, ppp_net_id);
925 struct net_device *dev;
926 struct net_device *aux;
932 for_each_netdev_safe(net, dev, aux) {
933 if (dev->netdev_ops == &ppp_netdev_ops)
934 unregister_netdevice_queue(dev, &list);
937 idr_for_each_entry(&pn->units_idr, ppp, id)
938 /* Skip devices already unregistered by previous loop */
939 if (!net_eq(dev_net(ppp->dev), net))
940 unregister_netdevice_queue(ppp->dev, &list);
942 unregister_netdevice_many(&list);
945 mutex_destroy(&pn->all_ppp_mutex);
946 idr_destroy(&pn->units_idr);
947 WARN_ON_ONCE(!list_empty(&pn->all_channels));
948 WARN_ON_ONCE(!list_empty(&pn->new_channels));
951 static struct pernet_operations ppp_net_ops = {
952 .init = ppp_init_net,
953 .exit = ppp_exit_net,
955 .size = sizeof(struct ppp_net),
958 static int ppp_unit_register(struct ppp *ppp, int unit, bool ifname_is_set)
960 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
963 mutex_lock(&pn->all_ppp_mutex);
966 ret = unit_get(&pn->units_idr, ppp);
970 /* Caller asked for a specific unit number. Fail with -EEXIST
971 * if unavailable. For backward compatibility, return -EEXIST
972 * too if idr allocation fails; this makes pppd retry without
973 * requesting a specific unit number.
975 if (unit_find(&pn->units_idr, unit)) {
979 ret = unit_set(&pn->units_idr, ppp, unit);
981 /* Rewrite error for backward compatibility */
986 ppp->file.index = ret;
989 snprintf(ppp->dev->name, IFNAMSIZ, "ppp%i", ppp->file.index);
991 mutex_unlock(&pn->all_ppp_mutex);
993 ret = register_netdevice(ppp->dev);
997 atomic_inc(&ppp_unit_count);
1002 mutex_lock(&pn->all_ppp_mutex);
1003 unit_put(&pn->units_idr, ppp->file.index);
1005 mutex_unlock(&pn->all_ppp_mutex);
1010 static int ppp_dev_configure(struct net *src_net, struct net_device *dev,
1011 const struct ppp_config *conf)
1013 struct ppp *ppp = netdev_priv(dev);
1019 ppp->ppp_net = src_net;
1021 ppp->owner = conf->file;
1023 init_ppp_file(&ppp->file, INTERFACE);
1024 ppp->file.hdrlen = PPP_HDRLEN - 2; /* don't count proto bytes */
1026 for (indx = 0; indx < NUM_NP; ++indx)
1027 ppp->npmode[indx] = NPMODE_PASS;
1028 INIT_LIST_HEAD(&ppp->channels);
1029 spin_lock_init(&ppp->rlock);
1030 spin_lock_init(&ppp->wlock);
1032 ppp->xmit_recursion = alloc_percpu(int);
1033 if (!ppp->xmit_recursion) {
1037 for_each_possible_cpu(cpu)
1038 (*per_cpu_ptr(ppp->xmit_recursion, cpu)) = 0;
1040 #ifdef CONFIG_PPP_MULTILINK
1042 skb_queue_head_init(&ppp->mrq);
1043 #endif /* CONFIG_PPP_MULTILINK */
1044 #ifdef CONFIG_PPP_FILTER
1045 ppp->pass_filter = NULL;
1046 ppp->active_filter = NULL;
1047 #endif /* CONFIG_PPP_FILTER */
1049 err = ppp_unit_register(ppp, conf->unit, conf->ifname_is_set);
1053 conf->file->private_data = &ppp->file;
1057 free_percpu(ppp->xmit_recursion);
1062 static const struct nla_policy ppp_nl_policy[IFLA_PPP_MAX + 1] = {
1063 [IFLA_PPP_DEV_FD] = { .type = NLA_S32 },
1066 static int ppp_nl_validate(struct nlattr *tb[], struct nlattr *data[],
1067 struct netlink_ext_ack *extack)
1072 if (!data[IFLA_PPP_DEV_FD])
1074 if (nla_get_s32(data[IFLA_PPP_DEV_FD]) < 0)
1080 static int ppp_nl_newlink(struct net *src_net, struct net_device *dev,
1081 struct nlattr *tb[], struct nlattr *data[],
1082 struct netlink_ext_ack *extack)
1084 struct ppp_config conf = {
1086 .ifname_is_set = true,
1091 file = fget(nla_get_s32(data[IFLA_PPP_DEV_FD]));
1095 /* rtnl_lock is already held here, but ppp_create_interface() locks
1096 * ppp_mutex before holding rtnl_lock. Using mutex_trylock() avoids
1097 * possible deadlock due to lock order inversion, at the cost of
1098 * pushing the problem back to userspace.
1100 if (!mutex_trylock(&ppp_mutex)) {
1105 if (file->f_op != &ppp_device_fops || file->private_data) {
1112 /* Don't use device name generated by the rtnetlink layer when ifname
1113 * isn't specified. Let ppp_dev_configure() set the device name using
1114 * the PPP unit identifer as suffix (i.e. ppp<unit_id>). This allows
1115 * userspace to infer the device name using to the PPPIOCGUNIT ioctl.
1117 if (!tb[IFLA_IFNAME])
1118 conf.ifname_is_set = false;
1120 err = ppp_dev_configure(src_net, dev, &conf);
1123 mutex_unlock(&ppp_mutex);
1130 static void ppp_nl_dellink(struct net_device *dev, struct list_head *head)
1132 unregister_netdevice_queue(dev, head);
1135 static size_t ppp_nl_get_size(const struct net_device *dev)
1140 static int ppp_nl_fill_info(struct sk_buff *skb, const struct net_device *dev)
1145 static struct net *ppp_nl_get_link_net(const struct net_device *dev)
1147 struct ppp *ppp = netdev_priv(dev);
1149 return ppp->ppp_net;
1152 static struct rtnl_link_ops ppp_link_ops __read_mostly = {
1154 .maxtype = IFLA_PPP_MAX,
1155 .policy = ppp_nl_policy,
1156 .priv_size = sizeof(struct ppp),
1158 .validate = ppp_nl_validate,
1159 .newlink = ppp_nl_newlink,
1160 .dellink = ppp_nl_dellink,
1161 .get_size = ppp_nl_get_size,
1162 .fill_info = ppp_nl_fill_info,
1163 .get_link_net = ppp_nl_get_link_net,
1166 #define PPP_MAJOR 108
1168 /* Called at boot time if ppp is compiled into the kernel,
1169 or at module load time (from init_module) if compiled as a module. */
1170 static int __init ppp_init(void)
1174 pr_info("PPP generic driver version " PPP_VERSION "\n");
1176 err = register_pernet_device(&ppp_net_ops);
1178 pr_err("failed to register PPP pernet device (%d)\n", err);
1182 err = register_chrdev(PPP_MAJOR, "ppp", &ppp_device_fops);
1184 pr_err("failed to register PPP device (%d)\n", err);
1188 ppp_class = class_create(THIS_MODULE, "ppp");
1189 if (IS_ERR(ppp_class)) {
1190 err = PTR_ERR(ppp_class);
1194 err = rtnl_link_register(&ppp_link_ops);
1196 pr_err("failed to register rtnetlink PPP handler\n");
1200 /* not a big deal if we fail here :-) */
1201 device_create(ppp_class, NULL, MKDEV(PPP_MAJOR, 0), NULL, "ppp");
1206 class_destroy(ppp_class);
1208 unregister_chrdev(PPP_MAJOR, "ppp");
1210 unregister_pernet_device(&ppp_net_ops);
1216 * Network interface unit routines.
1219 ppp_start_xmit(struct sk_buff *skb, struct net_device *dev)
1221 struct ppp *ppp = netdev_priv(dev);
1225 npi = ethertype_to_npindex(ntohs(skb->protocol));
1229 /* Drop, accept or reject the packet */
1230 switch (ppp->npmode[npi]) {
1234 /* it would be nice to have a way to tell the network
1235 system to queue this one up for later. */
1242 /* Put the 2-byte PPP protocol number on the front,
1243 making sure there is room for the address and control fields. */
1244 if (skb_cow_head(skb, PPP_HDRLEN))
1247 pp = skb_push(skb, 2);
1248 proto = npindex_to_proto[npi];
1249 put_unaligned_be16(proto, pp);
1251 skb_scrub_packet(skb, !net_eq(ppp->ppp_net, dev_net(dev)));
1252 ppp_xmit_process(ppp, skb);
1254 return NETDEV_TX_OK;
1258 ++dev->stats.tx_dropped;
1259 return NETDEV_TX_OK;
1263 ppp_net_ioctl(struct net_device *dev, struct ifreq *ifr, int cmd)
1265 struct ppp *ppp = netdev_priv(dev);
1267 void __user *addr = (void __user *) ifr->ifr_ifru.ifru_data;
1268 struct ppp_stats stats;
1269 struct ppp_comp_stats cstats;
1274 ppp_get_stats(ppp, &stats);
1275 if (copy_to_user(addr, &stats, sizeof(stats)))
1280 case SIOCGPPPCSTATS:
1281 memset(&cstats, 0, sizeof(cstats));
1283 ppp->xcomp->comp_stat(ppp->xc_state, &cstats.c);
1285 ppp->rcomp->decomp_stat(ppp->rc_state, &cstats.d);
1286 if (copy_to_user(addr, &cstats, sizeof(cstats)))
1293 if (copy_to_user(addr, vers, strlen(vers) + 1))
1306 ppp_get_stats64(struct net_device *dev, struct rtnl_link_stats64 *stats64)
1308 struct ppp *ppp = netdev_priv(dev);
1311 stats64->rx_packets = ppp->stats64.rx_packets;
1312 stats64->rx_bytes = ppp->stats64.rx_bytes;
1313 ppp_recv_unlock(ppp);
1316 stats64->tx_packets = ppp->stats64.tx_packets;
1317 stats64->tx_bytes = ppp->stats64.tx_bytes;
1318 ppp_xmit_unlock(ppp);
1320 stats64->rx_errors = dev->stats.rx_errors;
1321 stats64->tx_errors = dev->stats.tx_errors;
1322 stats64->rx_dropped = dev->stats.rx_dropped;
1323 stats64->tx_dropped = dev->stats.tx_dropped;
1324 stats64->rx_length_errors = dev->stats.rx_length_errors;
1327 static int ppp_dev_init(struct net_device *dev)
1331 netdev_lockdep_set_classes(dev);
1333 ppp = netdev_priv(dev);
1334 /* Let the netdevice take a reference on the ppp file. This ensures
1335 * that ppp_destroy_interface() won't run before the device gets
1338 refcount_inc(&ppp->file.refcnt);
1343 static void ppp_dev_uninit(struct net_device *dev)
1345 struct ppp *ppp = netdev_priv(dev);
1346 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
1352 mutex_lock(&pn->all_ppp_mutex);
1353 unit_put(&pn->units_idr, ppp->file.index);
1354 mutex_unlock(&pn->all_ppp_mutex);
1359 wake_up_interruptible(&ppp->file.rwait);
1362 static void ppp_dev_priv_destructor(struct net_device *dev)
1366 ppp = netdev_priv(dev);
1367 if (refcount_dec_and_test(&ppp->file.refcnt))
1368 ppp_destroy_interface(ppp);
1371 static const struct net_device_ops ppp_netdev_ops = {
1372 .ndo_init = ppp_dev_init,
1373 .ndo_uninit = ppp_dev_uninit,
1374 .ndo_start_xmit = ppp_start_xmit,
1375 .ndo_do_ioctl = ppp_net_ioctl,
1376 .ndo_get_stats64 = ppp_get_stats64,
1379 static struct device_type ppp_type = {
1383 static void ppp_setup(struct net_device *dev)
1385 dev->netdev_ops = &ppp_netdev_ops;
1386 SET_NETDEV_DEVTYPE(dev, &ppp_type);
1388 dev->features |= NETIF_F_LLTX;
1390 dev->hard_header_len = PPP_HDRLEN;
1393 dev->tx_queue_len = 3;
1394 dev->type = ARPHRD_PPP;
1395 dev->flags = IFF_POINTOPOINT | IFF_NOARP | IFF_MULTICAST;
1396 dev->priv_destructor = ppp_dev_priv_destructor;
1397 netif_keep_dst(dev);
1401 * Transmit-side routines.
1404 /* Called to do any work queued up on the transmit side that can now be done */
1405 static void __ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1408 if (!ppp->closing) {
1412 skb_queue_tail(&ppp->file.xq, skb);
1413 while (!ppp->xmit_pending &&
1414 (skb = skb_dequeue(&ppp->file.xq)))
1415 ppp_send_frame(ppp, skb);
1416 /* If there's no work left to do, tell the core net
1417 code that we can accept some more. */
1418 if (!ppp->xmit_pending && !skb_peek(&ppp->file.xq))
1419 netif_wake_queue(ppp->dev);
1421 netif_stop_queue(ppp->dev);
1423 ppp_xmit_unlock(ppp);
1426 static void ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1430 if (unlikely(*this_cpu_ptr(ppp->xmit_recursion)))
1433 (*this_cpu_ptr(ppp->xmit_recursion))++;
1434 __ppp_xmit_process(ppp, skb);
1435 (*this_cpu_ptr(ppp->xmit_recursion))--;
1446 if (net_ratelimit())
1447 netdev_err(ppp->dev, "recursion detected\n");
1450 static inline struct sk_buff *
1451 pad_compress_skb(struct ppp *ppp, struct sk_buff *skb)
1453 struct sk_buff *new_skb;
1455 int new_skb_size = ppp->dev->mtu +
1456 ppp->xcomp->comp_extra + ppp->dev->hard_header_len;
1457 int compressor_skb_size = ppp->dev->mtu +
1458 ppp->xcomp->comp_extra + PPP_HDRLEN;
1459 new_skb = alloc_skb(new_skb_size, GFP_ATOMIC);
1461 if (net_ratelimit())
1462 netdev_err(ppp->dev, "PPP: no memory (comp pkt)\n");
1465 if (ppp->dev->hard_header_len > PPP_HDRLEN)
1466 skb_reserve(new_skb,
1467 ppp->dev->hard_header_len - PPP_HDRLEN);
1469 /* compressor still expects A/C bytes in hdr */
1470 len = ppp->xcomp->compress(ppp->xc_state, skb->data - 2,
1471 new_skb->data, skb->len + 2,
1472 compressor_skb_size);
1473 if (len > 0 && (ppp->flags & SC_CCP_UP)) {
1477 skb_pull(skb, 2); /* pull off A/C bytes */
1478 } else if (len == 0) {
1479 /* didn't compress, or CCP not up yet */
1480 consume_skb(new_skb);
1485 * MPPE requires that we do not send unencrypted
1486 * frames. The compressor will return -1 if we
1487 * should drop the frame. We cannot simply test
1488 * the compress_proto because MPPE and MPPC share
1491 if (net_ratelimit())
1492 netdev_err(ppp->dev, "ppp: compressor dropped pkt\n");
1494 consume_skb(new_skb);
1501 * Compress and send a frame.
1502 * The caller should have locked the xmit path,
1503 * and xmit_pending should be 0.
1506 ppp_send_frame(struct ppp *ppp, struct sk_buff *skb)
1508 int proto = PPP_PROTO(skb);
1509 struct sk_buff *new_skb;
1513 if (proto < 0x8000) {
1514 #ifdef CONFIG_PPP_FILTER
1515 /* check if we should pass this packet */
1516 /* the filter instructions are constructed assuming
1517 a four-byte PPP header on each packet */
1518 *(u8 *)skb_push(skb, 2) = 1;
1519 if (ppp->pass_filter &&
1520 BPF_PROG_RUN(ppp->pass_filter, skb) == 0) {
1522 netdev_printk(KERN_DEBUG, ppp->dev,
1523 "PPP: outbound frame "
1528 /* if this packet passes the active filter, record the time */
1529 if (!(ppp->active_filter &&
1530 BPF_PROG_RUN(ppp->active_filter, skb) == 0))
1531 ppp->last_xmit = jiffies;
1534 /* for data packets, record the time */
1535 ppp->last_xmit = jiffies;
1536 #endif /* CONFIG_PPP_FILTER */
1539 ++ppp->stats64.tx_packets;
1540 ppp->stats64.tx_bytes += skb->len - 2;
1544 if (!ppp->vj || (ppp->flags & SC_COMP_TCP) == 0)
1546 /* try to do VJ TCP header compression */
1547 new_skb = alloc_skb(skb->len + ppp->dev->hard_header_len - 2,
1550 netdev_err(ppp->dev, "PPP: no memory (VJ comp pkt)\n");
1553 skb_reserve(new_skb, ppp->dev->hard_header_len - 2);
1555 len = slhc_compress(ppp->vj, cp, skb->len - 2,
1556 new_skb->data + 2, &cp,
1557 !(ppp->flags & SC_NO_TCP_CCID));
1558 if (cp == skb->data + 2) {
1559 /* didn't compress */
1560 consume_skb(new_skb);
1562 if (cp[0] & SL_TYPE_COMPRESSED_TCP) {
1563 proto = PPP_VJC_COMP;
1564 cp[0] &= ~SL_TYPE_COMPRESSED_TCP;
1566 proto = PPP_VJC_UNCOMP;
1567 cp[0] = skb->data[2];
1571 cp = skb_put(skb, len + 2);
1578 /* peek at outbound CCP frames */
1579 ppp_ccp_peek(ppp, skb, 0);
1583 /* try to do packet compression */
1584 if ((ppp->xstate & SC_COMP_RUN) && ppp->xc_state &&
1585 proto != PPP_LCP && proto != PPP_CCP) {
1586 if (!(ppp->flags & SC_CCP_UP) && (ppp->flags & SC_MUST_COMP)) {
1587 if (net_ratelimit())
1588 netdev_err(ppp->dev,
1589 "ppp: compression required but "
1590 "down - pkt dropped.\n");
1593 skb = pad_compress_skb(ppp, skb);
1599 * If we are waiting for traffic (demand dialling),
1600 * queue it up for pppd to receive.
1602 if (ppp->flags & SC_LOOP_TRAFFIC) {
1603 if (ppp->file.rq.qlen > PPP_MAX_RQLEN)
1605 skb_queue_tail(&ppp->file.rq, skb);
1606 wake_up_interruptible(&ppp->file.rwait);
1610 ppp->xmit_pending = skb;
1616 ++ppp->dev->stats.tx_errors;
1620 * Try to send the frame in xmit_pending.
1621 * The caller should have the xmit path locked.
1624 ppp_push(struct ppp *ppp)
1626 struct list_head *list;
1627 struct channel *pch;
1628 struct sk_buff *skb = ppp->xmit_pending;
1633 list = &ppp->channels;
1634 if (list_empty(list)) {
1635 /* nowhere to send the packet, just drop it */
1636 ppp->xmit_pending = NULL;
1641 if ((ppp->flags & SC_MULTILINK) == 0) {
1642 /* not doing multilink: send it down the first channel */
1644 pch = list_entry(list, struct channel, clist);
1646 spin_lock(&pch->downl);
1648 if (pch->chan->ops->start_xmit(pch->chan, skb))
1649 ppp->xmit_pending = NULL;
1651 /* channel got unregistered */
1653 ppp->xmit_pending = NULL;
1655 spin_unlock(&pch->downl);
1659 #ifdef CONFIG_PPP_MULTILINK
1660 /* Multilink: fragment the packet over as many links
1661 as can take the packet at the moment. */
1662 if (!ppp_mp_explode(ppp, skb))
1664 #endif /* CONFIG_PPP_MULTILINK */
1666 ppp->xmit_pending = NULL;
1670 #ifdef CONFIG_PPP_MULTILINK
1671 static bool mp_protocol_compress __read_mostly = true;
1672 module_param(mp_protocol_compress, bool, 0644);
1673 MODULE_PARM_DESC(mp_protocol_compress,
1674 "compress protocol id in multilink fragments");
1677 * Divide a packet to be transmitted into fragments and
1678 * send them out the individual links.
1680 static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb)
1683 int i, bits, hdrlen, mtu;
1685 int navail, nfree, nzero;
1689 unsigned char *p, *q;
1690 struct list_head *list;
1691 struct channel *pch;
1692 struct sk_buff *frag;
1693 struct ppp_channel *chan;
1695 totspeed = 0; /*total bitrate of the bundle*/
1696 nfree = 0; /* # channels which have no packet already queued */
1697 navail = 0; /* total # of usable channels (not deregistered) */
1698 nzero = 0; /* number of channels with zero speed associated*/
1699 totfree = 0; /*total # of channels available and
1700 *having no queued packets before
1701 *starting the fragmentation*/
1703 hdrlen = (ppp->flags & SC_MP_XSHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1705 list_for_each_entry(pch, &ppp->channels, clist) {
1709 pch->speed = pch->chan->speed;
1714 if (skb_queue_empty(&pch->file.xq) ||
1716 if (pch->speed == 0)
1719 totspeed += pch->speed;
1725 if (!pch->had_frag && i < ppp->nxchan)
1731 * Don't start sending this packet unless at least half of
1732 * the channels are free. This gives much better TCP
1733 * performance if we have a lot of channels.
1735 if (nfree == 0 || nfree < navail / 2)
1736 return 0; /* can't take now, leave it in xmit_pending */
1738 /* Do protocol field compression */
1741 if (*p == 0 && mp_protocol_compress) {
1747 nbigger = len % nfree;
1749 /* skip to the channel after the one we last used
1750 and start at that one */
1751 list = &ppp->channels;
1752 for (i = 0; i < ppp->nxchan; ++i) {
1754 if (list == &ppp->channels) {
1760 /* create a fragment for each channel */
1764 if (list == &ppp->channels) {
1768 pch = list_entry(list, struct channel, clist);
1774 * Skip this channel if it has a fragment pending already and
1775 * we haven't given a fragment to all of the free channels.
1777 if (pch->avail == 1) {
1784 /* check the channel's mtu and whether it is still attached. */
1785 spin_lock(&pch->downl);
1786 if (pch->chan == NULL) {
1787 /* can't use this channel, it's being deregistered */
1788 if (pch->speed == 0)
1791 totspeed -= pch->speed;
1793 spin_unlock(&pch->downl);
1804 *if the channel speed is not set divide
1805 *the packet evenly among the free channels;
1806 *otherwise divide it according to the speed
1807 *of the channel we are going to transmit on
1811 if (pch->speed == 0) {
1818 flen = (((totfree - nzero)*(totlen + hdrlen*totfree)) /
1819 ((totspeed*totfree)/pch->speed)) - hdrlen;
1821 flen += ((totfree - nzero)*pch->speed)/totspeed;
1822 nbigger -= ((totfree - nzero)*pch->speed)/
1830 *check if we are on the last channel or
1831 *we exceded the length of the data to
1834 if ((nfree <= 0) || (flen > len))
1837 *it is not worth to tx on slow channels:
1838 *in that case from the resulting flen according to the
1839 *above formula will be equal or less than zero.
1840 *Skip the channel in this case
1844 spin_unlock(&pch->downl);
1849 * hdrlen includes the 2-byte PPP protocol field, but the
1850 * MTU counts only the payload excluding the protocol field.
1851 * (RFC1661 Section 2)
1853 mtu = pch->chan->mtu - (hdrlen - 2);
1860 frag = alloc_skb(flen + hdrlen + (flen == 0), GFP_ATOMIC);
1863 q = skb_put(frag, flen + hdrlen);
1865 /* make the MP header */
1866 put_unaligned_be16(PPP_MP, q);
1867 if (ppp->flags & SC_MP_XSHORTSEQ) {
1868 q[2] = bits + ((ppp->nxseq >> 8) & 0xf);
1872 q[3] = ppp->nxseq >> 16;
1873 q[4] = ppp->nxseq >> 8;
1877 memcpy(q + hdrlen, p, flen);
1879 /* try to send it down the channel */
1881 if (!skb_queue_empty(&pch->file.xq) ||
1882 !chan->ops->start_xmit(chan, frag))
1883 skb_queue_tail(&pch->file.xq, frag);
1889 spin_unlock(&pch->downl);
1896 spin_unlock(&pch->downl);
1898 netdev_err(ppp->dev, "PPP: no memory (fragment)\n");
1899 ++ppp->dev->stats.tx_errors;
1901 return 1; /* abandon the frame */
1903 #endif /* CONFIG_PPP_MULTILINK */
1905 /* Try to send data out on a channel */
1906 static void __ppp_channel_push(struct channel *pch)
1908 struct sk_buff *skb;
1911 spin_lock(&pch->downl);
1913 while (!skb_queue_empty(&pch->file.xq)) {
1914 skb = skb_dequeue(&pch->file.xq);
1915 if (!pch->chan->ops->start_xmit(pch->chan, skb)) {
1916 /* put the packet back and try again later */
1917 skb_queue_head(&pch->file.xq, skb);
1922 /* channel got deregistered */
1923 skb_queue_purge(&pch->file.xq);
1925 spin_unlock(&pch->downl);
1926 /* see if there is anything from the attached unit to be sent */
1927 if (skb_queue_empty(&pch->file.xq)) {
1930 __ppp_xmit_process(ppp, NULL);
1934 static void ppp_channel_push(struct channel *pch)
1936 read_lock_bh(&pch->upl);
1938 (*this_cpu_ptr(pch->ppp->xmit_recursion))++;
1939 __ppp_channel_push(pch);
1940 (*this_cpu_ptr(pch->ppp->xmit_recursion))--;
1942 __ppp_channel_push(pch);
1944 read_unlock_bh(&pch->upl);
1948 * Receive-side routines.
1951 struct ppp_mp_skb_parm {
1955 #define PPP_MP_CB(skb) ((struct ppp_mp_skb_parm *)((skb)->cb))
1958 ppp_do_recv(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1962 ppp_receive_frame(ppp, skb, pch);
1965 ppp_recv_unlock(ppp);
1969 ppp_input(struct ppp_channel *chan, struct sk_buff *skb)
1971 struct channel *pch = chan->ppp;
1979 read_lock_bh(&pch->upl);
1980 if (!pskb_may_pull(skb, 2)) {
1983 ++pch->ppp->dev->stats.rx_length_errors;
1984 ppp_receive_error(pch->ppp);
1989 proto = PPP_PROTO(skb);
1990 if (!pch->ppp || proto >= 0xc000 || proto == PPP_CCPFRAG) {
1991 /* put it on the channel queue */
1992 skb_queue_tail(&pch->file.rq, skb);
1993 /* drop old frames if queue too long */
1994 while (pch->file.rq.qlen > PPP_MAX_RQLEN &&
1995 (skb = skb_dequeue(&pch->file.rq)))
1997 wake_up_interruptible(&pch->file.rwait);
1999 ppp_do_recv(pch->ppp, skb, pch);
2003 read_unlock_bh(&pch->upl);
2006 /* Put a 0-length skb in the receive queue as an error indication */
2008 ppp_input_error(struct ppp_channel *chan, int code)
2010 struct channel *pch = chan->ppp;
2011 struct sk_buff *skb;
2016 read_lock_bh(&pch->upl);
2018 skb = alloc_skb(0, GFP_ATOMIC);
2020 skb->len = 0; /* probably unnecessary */
2022 ppp_do_recv(pch->ppp, skb, pch);
2025 read_unlock_bh(&pch->upl);
2029 * We come in here to process a received frame.
2030 * The receive side of the ppp unit is locked.
2033 ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2035 /* note: a 0-length skb is used as an error indication */
2037 skb_checksum_complete_unset(skb);
2038 #ifdef CONFIG_PPP_MULTILINK
2039 /* XXX do channel-level decompression here */
2040 if (PPP_PROTO(skb) == PPP_MP)
2041 ppp_receive_mp_frame(ppp, skb, pch);
2043 #endif /* CONFIG_PPP_MULTILINK */
2044 ppp_receive_nonmp_frame(ppp, skb);
2047 ppp_receive_error(ppp);
2052 ppp_receive_error(struct ppp *ppp)
2054 ++ppp->dev->stats.rx_errors;
2060 ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb)
2063 int proto, len, npi;
2066 * Decompress the frame, if compressed.
2067 * Note that some decompressors need to see uncompressed frames
2068 * that come in as well as compressed frames.
2070 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN) &&
2071 (ppp->rstate & (SC_DC_FERROR | SC_DC_ERROR)) == 0)
2072 skb = ppp_decompress_frame(ppp, skb);
2074 if (ppp->flags & SC_MUST_COMP && ppp->rstate & SC_DC_FERROR)
2077 proto = PPP_PROTO(skb);
2080 /* decompress VJ compressed packets */
2081 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2084 if (skb_tailroom(skb) < 124 || skb_cloned(skb)) {
2085 /* copy to a new sk_buff with more tailroom */
2086 ns = dev_alloc_skb(skb->len + 128);
2088 netdev_err(ppp->dev, "PPP: no memory "
2093 skb_copy_bits(skb, 0, skb_put(ns, skb->len), skb->len);
2098 skb->ip_summed = CHECKSUM_NONE;
2100 len = slhc_uncompress(ppp->vj, skb->data + 2, skb->len - 2);
2102 netdev_printk(KERN_DEBUG, ppp->dev,
2103 "PPP: VJ decompression error\n");
2108 skb_put(skb, len - skb->len);
2109 else if (len < skb->len)
2114 case PPP_VJC_UNCOMP:
2115 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2118 /* Until we fix the decompressor need to make sure
2119 * data portion is linear.
2121 if (!pskb_may_pull(skb, skb->len))
2124 if (slhc_remember(ppp->vj, skb->data + 2, skb->len - 2) <= 0) {
2125 netdev_err(ppp->dev, "PPP: VJ uncompressed error\n");
2132 ppp_ccp_peek(ppp, skb, 1);
2136 ++ppp->stats64.rx_packets;
2137 ppp->stats64.rx_bytes += skb->len - 2;
2139 npi = proto_to_npindex(proto);
2141 /* control or unknown frame - pass it to pppd */
2142 skb_queue_tail(&ppp->file.rq, skb);
2143 /* limit queue length by dropping old frames */
2144 while (ppp->file.rq.qlen > PPP_MAX_RQLEN &&
2145 (skb = skb_dequeue(&ppp->file.rq)))
2147 /* wake up any process polling or blocking on read */
2148 wake_up_interruptible(&ppp->file.rwait);
2151 /* network protocol frame - give it to the kernel */
2153 #ifdef CONFIG_PPP_FILTER
2154 /* check if the packet passes the pass and active filters */
2155 /* the filter instructions are constructed assuming
2156 a four-byte PPP header on each packet */
2157 if (ppp->pass_filter || ppp->active_filter) {
2158 if (skb_unclone(skb, GFP_ATOMIC))
2161 *(u8 *)skb_push(skb, 2) = 0;
2162 if (ppp->pass_filter &&
2163 BPF_PROG_RUN(ppp->pass_filter, skb) == 0) {
2165 netdev_printk(KERN_DEBUG, ppp->dev,
2166 "PPP: inbound frame "
2171 if (!(ppp->active_filter &&
2172 BPF_PROG_RUN(ppp->active_filter, skb) == 0))
2173 ppp->last_recv = jiffies;
2176 #endif /* CONFIG_PPP_FILTER */
2177 ppp->last_recv = jiffies;
2179 if ((ppp->dev->flags & IFF_UP) == 0 ||
2180 ppp->npmode[npi] != NPMODE_PASS) {
2183 /* chop off protocol */
2184 skb_pull_rcsum(skb, 2);
2185 skb->dev = ppp->dev;
2186 skb->protocol = htons(npindex_to_ethertype[npi]);
2187 skb_reset_mac_header(skb);
2188 skb_scrub_packet(skb, !net_eq(ppp->ppp_net,
2189 dev_net(ppp->dev)));
2197 ppp_receive_error(ppp);
2200 static struct sk_buff *
2201 ppp_decompress_frame(struct ppp *ppp, struct sk_buff *skb)
2203 int proto = PPP_PROTO(skb);
2207 /* Until we fix all the decompressor's need to make sure
2208 * data portion is linear.
2210 if (!pskb_may_pull(skb, skb->len))
2213 if (proto == PPP_COMP) {
2216 switch(ppp->rcomp->compress_proto) {
2218 obuff_size = ppp->mru + PPP_HDRLEN + 1;
2221 obuff_size = ppp->mru + PPP_HDRLEN;
2225 ns = dev_alloc_skb(obuff_size);
2227 netdev_err(ppp->dev, "ppp_decompress_frame: "
2231 /* the decompressor still expects the A/C bytes in the hdr */
2232 len = ppp->rcomp->decompress(ppp->rc_state, skb->data - 2,
2233 skb->len + 2, ns->data, obuff_size);
2235 /* Pass the compressed frame to pppd as an
2236 error indication. */
2237 if (len == DECOMP_FATALERROR)
2238 ppp->rstate |= SC_DC_FERROR;
2246 skb_pull(skb, 2); /* pull off the A/C bytes */
2249 /* Uncompressed frame - pass to decompressor so it
2250 can update its dictionary if necessary. */
2251 if (ppp->rcomp->incomp)
2252 ppp->rcomp->incomp(ppp->rc_state, skb->data - 2,
2259 ppp->rstate |= SC_DC_ERROR;
2260 ppp_receive_error(ppp);
2264 #ifdef CONFIG_PPP_MULTILINK
2266 * Receive a multilink frame.
2267 * We put it on the reconstruction queue and then pull off
2268 * as many completed frames as we can.
2271 ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2275 int mphdrlen = (ppp->flags & SC_MP_SHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
2277 if (!pskb_may_pull(skb, mphdrlen + 1) || ppp->mrru == 0)
2278 goto err; /* no good, throw it away */
2280 /* Decode sequence number and begin/end bits */
2281 if (ppp->flags & SC_MP_SHORTSEQ) {
2282 seq = ((skb->data[2] & 0x0f) << 8) | skb->data[3];
2285 seq = (skb->data[3] << 16) | (skb->data[4] << 8)| skb->data[5];
2288 PPP_MP_CB(skb)->BEbits = skb->data[2];
2289 skb_pull(skb, mphdrlen); /* pull off PPP and MP headers */
2292 * Do protocol ID decompression on the first fragment of each packet.
2294 if ((PPP_MP_CB(skb)->BEbits & B) && (skb->data[0] & 1))
2295 *(u8 *)skb_push(skb, 1) = 0;
2298 * Expand sequence number to 32 bits, making it as close
2299 * as possible to ppp->minseq.
2301 seq |= ppp->minseq & ~mask;
2302 if ((int)(ppp->minseq - seq) > (int)(mask >> 1))
2304 else if ((int)(seq - ppp->minseq) > (int)(mask >> 1))
2305 seq -= mask + 1; /* should never happen */
2306 PPP_MP_CB(skb)->sequence = seq;
2310 * If this packet comes before the next one we were expecting,
2313 if (seq_before(seq, ppp->nextseq)) {
2315 ++ppp->dev->stats.rx_dropped;
2316 ppp_receive_error(ppp);
2321 * Reevaluate minseq, the minimum over all channels of the
2322 * last sequence number received on each channel. Because of
2323 * the increasing sequence number rule, we know that any fragment
2324 * before `minseq' which hasn't arrived is never going to arrive.
2325 * The list of channels can't change because we have the receive
2326 * side of the ppp unit locked.
2328 list_for_each_entry(ch, &ppp->channels, clist) {
2329 if (seq_before(ch->lastseq, seq))
2332 if (seq_before(ppp->minseq, seq))
2335 /* Put the fragment on the reconstruction queue */
2336 ppp_mp_insert(ppp, skb);
2338 /* If the queue is getting long, don't wait any longer for packets
2339 before the start of the queue. */
2340 if (skb_queue_len(&ppp->mrq) >= PPP_MP_MAX_QLEN) {
2341 struct sk_buff *mskb = skb_peek(&ppp->mrq);
2342 if (seq_before(ppp->minseq, PPP_MP_CB(mskb)->sequence))
2343 ppp->minseq = PPP_MP_CB(mskb)->sequence;
2346 /* Pull completed packets off the queue and receive them. */
2347 while ((skb = ppp_mp_reconstruct(ppp))) {
2348 if (pskb_may_pull(skb, 2))
2349 ppp_receive_nonmp_frame(ppp, skb);
2351 ++ppp->dev->stats.rx_length_errors;
2353 ppp_receive_error(ppp);
2361 ppp_receive_error(ppp);
2365 * Insert a fragment on the MP reconstruction queue.
2366 * The queue is ordered by increasing sequence number.
2369 ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb)
2372 struct sk_buff_head *list = &ppp->mrq;
2373 u32 seq = PPP_MP_CB(skb)->sequence;
2375 /* N.B. we don't need to lock the list lock because we have the
2376 ppp unit receive-side lock. */
2377 skb_queue_walk(list, p) {
2378 if (seq_before(seq, PPP_MP_CB(p)->sequence))
2381 __skb_queue_before(list, p, skb);
2385 * Reconstruct a packet from the MP fragment queue.
2386 * We go through increasing sequence numbers until we find a
2387 * complete packet, or we get to the sequence number for a fragment
2388 * which hasn't arrived but might still do so.
2390 static struct sk_buff *
2391 ppp_mp_reconstruct(struct ppp *ppp)
2393 u32 seq = ppp->nextseq;
2394 u32 minseq = ppp->minseq;
2395 struct sk_buff_head *list = &ppp->mrq;
2396 struct sk_buff *p, *tmp;
2397 struct sk_buff *head, *tail;
2398 struct sk_buff *skb = NULL;
2399 int lost = 0, len = 0;
2401 if (ppp->mrru == 0) /* do nothing until mrru is set */
2403 head = __skb_peek(list);
2405 skb_queue_walk_safe(list, p, tmp) {
2407 if (seq_before(PPP_MP_CB(p)->sequence, seq)) {
2408 /* this can't happen, anyway ignore the skb */
2409 netdev_err(ppp->dev, "ppp_mp_reconstruct bad "
2411 PPP_MP_CB(p)->sequence, seq);
2412 __skb_unlink(p, list);
2416 if (PPP_MP_CB(p)->sequence != seq) {
2418 /* Fragment `seq' is missing. If it is after
2419 minseq, it might arrive later, so stop here. */
2420 if (seq_after(seq, minseq))
2422 /* Fragment `seq' is lost, keep going. */
2425 seq = seq_before(minseq, PPP_MP_CB(p)->sequence)?
2426 minseq + 1: PPP_MP_CB(p)->sequence;
2429 netdev_printk(KERN_DEBUG, ppp->dev,
2430 "lost frag %u..%u\n",
2437 * At this point we know that all the fragments from
2438 * ppp->nextseq to seq are either present or lost.
2439 * Also, there are no complete packets in the queue
2440 * that have no missing fragments and end before this
2444 /* B bit set indicates this fragment starts a packet */
2445 if (PPP_MP_CB(p)->BEbits & B) {
2453 /* Got a complete packet yet? */
2454 if (lost == 0 && (PPP_MP_CB(p)->BEbits & E) &&
2455 (PPP_MP_CB(head)->BEbits & B)) {
2456 if (len > ppp->mrru + 2) {
2457 ++ppp->dev->stats.rx_length_errors;
2458 netdev_printk(KERN_DEBUG, ppp->dev,
2459 "PPP: reconstructed packet"
2460 " is too long (%d)\n", len);
2465 ppp->nextseq = seq + 1;
2469 * If this is the ending fragment of a packet,
2470 * and we haven't found a complete valid packet yet,
2471 * we can discard up to and including this fragment.
2473 if (PPP_MP_CB(p)->BEbits & E) {
2474 struct sk_buff *tmp2;
2476 skb_queue_reverse_walk_from_safe(list, p, tmp2) {
2478 netdev_printk(KERN_DEBUG, ppp->dev,
2479 "discarding frag %u\n",
2480 PPP_MP_CB(p)->sequence);
2481 __skb_unlink(p, list);
2484 head = skb_peek(list);
2491 /* If we have a complete packet, copy it all into one skb. */
2493 /* If we have discarded any fragments,
2494 signal a receive error. */
2495 if (PPP_MP_CB(head)->sequence != ppp->nextseq) {
2496 skb_queue_walk_safe(list, p, tmp) {
2500 netdev_printk(KERN_DEBUG, ppp->dev,
2501 "discarding frag %u\n",
2502 PPP_MP_CB(p)->sequence);
2503 __skb_unlink(p, list);
2508 netdev_printk(KERN_DEBUG, ppp->dev,
2509 " missed pkts %u..%u\n",
2511 PPP_MP_CB(head)->sequence-1);
2512 ++ppp->dev->stats.rx_dropped;
2513 ppp_receive_error(ppp);
2518 struct sk_buff **fragpp = &skb_shinfo(skb)->frag_list;
2519 p = skb_queue_next(list, head);
2520 __skb_unlink(skb, list);
2521 skb_queue_walk_from_safe(list, p, tmp) {
2522 __skb_unlink(p, list);
2528 skb->data_len += p->len;
2529 skb->truesize += p->truesize;
2535 __skb_unlink(skb, list);
2538 ppp->nextseq = PPP_MP_CB(tail)->sequence + 1;
2543 #endif /* CONFIG_PPP_MULTILINK */
2546 * Channel interface.
2549 /* Create a new, unattached ppp channel. */
2550 int ppp_register_channel(struct ppp_channel *chan)
2552 return ppp_register_net_channel(current->nsproxy->net_ns, chan);
2555 /* Create a new, unattached ppp channel for specified net. */
2556 int ppp_register_net_channel(struct net *net, struct ppp_channel *chan)
2558 struct channel *pch;
2561 pch = kzalloc(sizeof(struct channel), GFP_KERNEL);
2565 pn = ppp_pernet(net);
2569 pch->chan_net = get_net(net);
2571 init_ppp_file(&pch->file, CHANNEL);
2572 pch->file.hdrlen = chan->hdrlen;
2573 #ifdef CONFIG_PPP_MULTILINK
2575 #endif /* CONFIG_PPP_MULTILINK */
2576 init_rwsem(&pch->chan_sem);
2577 spin_lock_init(&pch->downl);
2578 rwlock_init(&pch->upl);
2580 spin_lock_bh(&pn->all_channels_lock);
2581 pch->file.index = ++pn->last_channel_index;
2582 list_add(&pch->list, &pn->new_channels);
2583 atomic_inc(&channel_count);
2584 spin_unlock_bh(&pn->all_channels_lock);
2590 * Return the index of a channel.
2592 int ppp_channel_index(struct ppp_channel *chan)
2594 struct channel *pch = chan->ppp;
2597 return pch->file.index;
2602 * Return the PPP unit number to which a channel is connected.
2604 int ppp_unit_number(struct ppp_channel *chan)
2606 struct channel *pch = chan->ppp;
2610 read_lock_bh(&pch->upl);
2612 unit = pch->ppp->file.index;
2613 read_unlock_bh(&pch->upl);
2619 * Return the PPP device interface name of a channel.
2621 char *ppp_dev_name(struct ppp_channel *chan)
2623 struct channel *pch = chan->ppp;
2627 read_lock_bh(&pch->upl);
2628 if (pch->ppp && pch->ppp->dev)
2629 name = pch->ppp->dev->name;
2630 read_unlock_bh(&pch->upl);
2637 * Disconnect a channel from the generic layer.
2638 * This must be called in process context.
2641 ppp_unregister_channel(struct ppp_channel *chan)
2643 struct channel *pch = chan->ppp;
2647 return; /* should never happen */
2652 * This ensures that we have returned from any calls into the
2653 * the channel's start_xmit or ioctl routine before we proceed.
2655 down_write(&pch->chan_sem);
2656 spin_lock_bh(&pch->downl);
2658 spin_unlock_bh(&pch->downl);
2659 up_write(&pch->chan_sem);
2660 ppp_disconnect_channel(pch);
2662 pn = ppp_pernet(pch->chan_net);
2663 spin_lock_bh(&pn->all_channels_lock);
2664 list_del(&pch->list);
2665 spin_unlock_bh(&pn->all_channels_lock);
2668 wake_up_interruptible(&pch->file.rwait);
2669 if (refcount_dec_and_test(&pch->file.refcnt))
2670 ppp_destroy_channel(pch);
2674 * Callback from a channel when it can accept more to transmit.
2675 * This should be called at BH/softirq level, not interrupt level.
2678 ppp_output_wakeup(struct ppp_channel *chan)
2680 struct channel *pch = chan->ppp;
2684 ppp_channel_push(pch);
2688 * Compression control.
2691 /* Process the PPPIOCSCOMPRESS ioctl. */
2693 ppp_set_compress(struct ppp *ppp, unsigned long arg)
2696 struct compressor *cp, *ocomp;
2697 struct ppp_option_data data;
2698 void *state, *ostate;
2699 unsigned char ccp_option[CCP_MAX_OPTION_LENGTH];
2702 if (copy_from_user(&data, (void __user *) arg, sizeof(data)))
2704 if (data.length > CCP_MAX_OPTION_LENGTH)
2706 if (copy_from_user(ccp_option, (void __user *) data.ptr, data.length))
2710 if (data.length < 2 || ccp_option[1] < 2 || ccp_option[1] > data.length)
2713 cp = try_then_request_module(
2714 find_compressor(ccp_option[0]),
2715 "ppp-compress-%d", ccp_option[0]);
2720 if (data.transmit) {
2721 state = cp->comp_alloc(ccp_option, data.length);
2724 ppp->xstate &= ~SC_COMP_RUN;
2726 ostate = ppp->xc_state;
2728 ppp->xc_state = state;
2729 ppp_xmit_unlock(ppp);
2731 ocomp->comp_free(ostate);
2732 module_put(ocomp->owner);
2736 module_put(cp->owner);
2739 state = cp->decomp_alloc(ccp_option, data.length);
2742 ppp->rstate &= ~SC_DECOMP_RUN;
2744 ostate = ppp->rc_state;
2746 ppp->rc_state = state;
2747 ppp_recv_unlock(ppp);
2749 ocomp->decomp_free(ostate);
2750 module_put(ocomp->owner);
2754 module_put(cp->owner);
2762 * Look at a CCP packet and update our state accordingly.
2763 * We assume the caller has the xmit or recv path locked.
2766 ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound)
2771 if (!pskb_may_pull(skb, CCP_HDRLEN + 2))
2772 return; /* no header */
2775 switch (CCP_CODE(dp)) {
2778 /* A ConfReq starts negotiation of compression
2779 * in one direction of transmission,
2780 * and hence brings it down...but which way?
2783 * A ConfReq indicates what the sender would like to receive
2786 /* He is proposing what I should send */
2787 ppp->xstate &= ~SC_COMP_RUN;
2789 /* I am proposing to what he should send */
2790 ppp->rstate &= ~SC_DECOMP_RUN;
2797 * CCP is going down, both directions of transmission
2799 ppp->rstate &= ~SC_DECOMP_RUN;
2800 ppp->xstate &= ~SC_COMP_RUN;
2804 if ((ppp->flags & (SC_CCP_OPEN | SC_CCP_UP)) != SC_CCP_OPEN)
2806 len = CCP_LENGTH(dp);
2807 if (!pskb_may_pull(skb, len + 2))
2808 return; /* too short */
2811 if (len < CCP_OPT_MINLEN || len < CCP_OPT_LENGTH(dp))
2814 /* we will start receiving compressed packets */
2817 if (ppp->rcomp->decomp_init(ppp->rc_state, dp, len,
2818 ppp->file.index, 0, ppp->mru, ppp->debug)) {
2819 ppp->rstate |= SC_DECOMP_RUN;
2820 ppp->rstate &= ~(SC_DC_ERROR | SC_DC_FERROR);
2823 /* we will soon start sending compressed packets */
2826 if (ppp->xcomp->comp_init(ppp->xc_state, dp, len,
2827 ppp->file.index, 0, ppp->debug))
2828 ppp->xstate |= SC_COMP_RUN;
2833 /* reset the [de]compressor */
2834 if ((ppp->flags & SC_CCP_UP) == 0)
2837 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN)) {
2838 ppp->rcomp->decomp_reset(ppp->rc_state);
2839 ppp->rstate &= ~SC_DC_ERROR;
2842 if (ppp->xc_state && (ppp->xstate & SC_COMP_RUN))
2843 ppp->xcomp->comp_reset(ppp->xc_state);
2849 /* Free up compression resources. */
2851 ppp_ccp_closed(struct ppp *ppp)
2853 void *xstate, *rstate;
2854 struct compressor *xcomp, *rcomp;
2857 ppp->flags &= ~(SC_CCP_OPEN | SC_CCP_UP);
2860 xstate = ppp->xc_state;
2861 ppp->xc_state = NULL;
2864 rstate = ppp->rc_state;
2865 ppp->rc_state = NULL;
2869 xcomp->comp_free(xstate);
2870 module_put(xcomp->owner);
2873 rcomp->decomp_free(rstate);
2874 module_put(rcomp->owner);
2878 /* List of compressors. */
2879 static LIST_HEAD(compressor_list);
2880 static DEFINE_SPINLOCK(compressor_list_lock);
2882 struct compressor_entry {
2883 struct list_head list;
2884 struct compressor *comp;
2887 static struct compressor_entry *
2888 find_comp_entry(int proto)
2890 struct compressor_entry *ce;
2892 list_for_each_entry(ce, &compressor_list, list) {
2893 if (ce->comp->compress_proto == proto)
2899 /* Register a compressor */
2901 ppp_register_compressor(struct compressor *cp)
2903 struct compressor_entry *ce;
2905 spin_lock(&compressor_list_lock);
2907 if (find_comp_entry(cp->compress_proto))
2910 ce = kmalloc(sizeof(struct compressor_entry), GFP_ATOMIC);
2915 list_add(&ce->list, &compressor_list);
2917 spin_unlock(&compressor_list_lock);
2921 /* Unregister a compressor */
2923 ppp_unregister_compressor(struct compressor *cp)
2925 struct compressor_entry *ce;
2927 spin_lock(&compressor_list_lock);
2928 ce = find_comp_entry(cp->compress_proto);
2929 if (ce && ce->comp == cp) {
2930 list_del(&ce->list);
2933 spin_unlock(&compressor_list_lock);
2936 /* Find a compressor. */
2937 static struct compressor *
2938 find_compressor(int type)
2940 struct compressor_entry *ce;
2941 struct compressor *cp = NULL;
2943 spin_lock(&compressor_list_lock);
2944 ce = find_comp_entry(type);
2947 if (!try_module_get(cp->owner))
2950 spin_unlock(&compressor_list_lock);
2955 * Miscelleneous stuff.
2959 ppp_get_stats(struct ppp *ppp, struct ppp_stats *st)
2961 struct slcompress *vj = ppp->vj;
2963 memset(st, 0, sizeof(*st));
2964 st->p.ppp_ipackets = ppp->stats64.rx_packets;
2965 st->p.ppp_ierrors = ppp->dev->stats.rx_errors;
2966 st->p.ppp_ibytes = ppp->stats64.rx_bytes;
2967 st->p.ppp_opackets = ppp->stats64.tx_packets;
2968 st->p.ppp_oerrors = ppp->dev->stats.tx_errors;
2969 st->p.ppp_obytes = ppp->stats64.tx_bytes;
2972 st->vj.vjs_packets = vj->sls_o_compressed + vj->sls_o_uncompressed;
2973 st->vj.vjs_compressed = vj->sls_o_compressed;
2974 st->vj.vjs_searches = vj->sls_o_searches;
2975 st->vj.vjs_misses = vj->sls_o_misses;
2976 st->vj.vjs_errorin = vj->sls_i_error;
2977 st->vj.vjs_tossed = vj->sls_i_tossed;
2978 st->vj.vjs_uncompressedin = vj->sls_i_uncompressed;
2979 st->vj.vjs_compressedin = vj->sls_i_compressed;
2983 * Stuff for handling the lists of ppp units and channels
2984 * and for initialization.
2988 * Create a new ppp interface unit. Fails if it can't allocate memory
2989 * or if there is already a unit with the requested number.
2990 * unit == -1 means allocate a new number.
2992 static int ppp_create_interface(struct net *net, struct file *file, int *unit)
2994 struct ppp_config conf = {
2997 .ifname_is_set = false,
2999 struct net_device *dev;
3003 dev = alloc_netdev(sizeof(struct ppp), "", NET_NAME_ENUM, ppp_setup);
3008 dev_net_set(dev, net);
3009 dev->rtnl_link_ops = &ppp_link_ops;
3013 err = ppp_dev_configure(net, dev, &conf);
3016 ppp = netdev_priv(dev);
3017 *unit = ppp->file.index;
3031 * Initialize a ppp_file structure.
3034 init_ppp_file(struct ppp_file *pf, int kind)
3037 skb_queue_head_init(&pf->xq);
3038 skb_queue_head_init(&pf->rq);
3039 refcount_set(&pf->refcnt, 1);
3040 init_waitqueue_head(&pf->rwait);
3044 * Free the memory used by a ppp unit. This is only called once
3045 * there are no channels connected to the unit and no file structs
3046 * that reference the unit.
3048 static void ppp_destroy_interface(struct ppp *ppp)
3050 atomic_dec(&ppp_unit_count);
3052 if (!ppp->file.dead || ppp->n_channels) {
3053 /* "can't happen" */
3054 netdev_err(ppp->dev, "ppp: destroying ppp struct %p "
3055 "but dead=%d n_channels=%d !\n",
3056 ppp, ppp->file.dead, ppp->n_channels);
3060 ppp_ccp_closed(ppp);
3065 skb_queue_purge(&ppp->file.xq);
3066 skb_queue_purge(&ppp->file.rq);
3067 #ifdef CONFIG_PPP_MULTILINK
3068 skb_queue_purge(&ppp->mrq);
3069 #endif /* CONFIG_PPP_MULTILINK */
3070 #ifdef CONFIG_PPP_FILTER
3071 if (ppp->pass_filter) {
3072 bpf_prog_destroy(ppp->pass_filter);
3073 ppp->pass_filter = NULL;
3076 if (ppp->active_filter) {
3077 bpf_prog_destroy(ppp->active_filter);
3078 ppp->active_filter = NULL;
3080 #endif /* CONFIG_PPP_FILTER */
3082 kfree_skb(ppp->xmit_pending);
3083 free_percpu(ppp->xmit_recursion);
3085 free_netdev(ppp->dev);
3089 * Locate an existing ppp unit.
3090 * The caller should have locked the all_ppp_mutex.
3093 ppp_find_unit(struct ppp_net *pn, int unit)
3095 return unit_find(&pn->units_idr, unit);
3099 * Locate an existing ppp channel.
3100 * The caller should have locked the all_channels_lock.
3101 * First we look in the new_channels list, then in the
3102 * all_channels list. If found in the new_channels list,
3103 * we move it to the all_channels list. This is for speed
3104 * when we have a lot of channels in use.
3106 static struct channel *
3107 ppp_find_channel(struct ppp_net *pn, int unit)
3109 struct channel *pch;
3111 list_for_each_entry(pch, &pn->new_channels, list) {
3112 if (pch->file.index == unit) {
3113 list_move(&pch->list, &pn->all_channels);
3118 list_for_each_entry(pch, &pn->all_channels, list) {
3119 if (pch->file.index == unit)
3127 * Connect a PPP channel to a PPP interface unit.
3130 ppp_connect_channel(struct channel *pch, int unit)
3137 pn = ppp_pernet(pch->chan_net);
3139 mutex_lock(&pn->all_ppp_mutex);
3140 ppp = ppp_find_unit(pn, unit);
3143 write_lock_bh(&pch->upl);
3149 spin_lock_bh(&pch->downl);
3151 /* Don't connect unregistered channels */
3152 spin_unlock_bh(&pch->downl);
3157 spin_unlock_bh(&pch->downl);
3158 if (pch->file.hdrlen > ppp->file.hdrlen)
3159 ppp->file.hdrlen = pch->file.hdrlen;
3160 hdrlen = pch->file.hdrlen + 2; /* for protocol bytes */
3161 if (hdrlen > ppp->dev->hard_header_len)
3162 ppp->dev->hard_header_len = hdrlen;
3163 list_add_tail(&pch->clist, &ppp->channels);
3166 refcount_inc(&ppp->file.refcnt);
3171 write_unlock_bh(&pch->upl);
3173 mutex_unlock(&pn->all_ppp_mutex);
3178 * Disconnect a channel from its ppp unit.
3181 ppp_disconnect_channel(struct channel *pch)
3186 write_lock_bh(&pch->upl);
3189 write_unlock_bh(&pch->upl);
3191 /* remove it from the ppp unit's list */
3193 list_del(&pch->clist);
3194 if (--ppp->n_channels == 0)
3195 wake_up_interruptible(&ppp->file.rwait);
3197 if (refcount_dec_and_test(&ppp->file.refcnt))
3198 ppp_destroy_interface(ppp);
3205 * Free up the resources used by a ppp channel.
3207 static void ppp_destroy_channel(struct channel *pch)
3209 put_net(pch->chan_net);
3210 pch->chan_net = NULL;
3212 atomic_dec(&channel_count);
3214 if (!pch->file.dead) {
3215 /* "can't happen" */
3216 pr_err("ppp: destroying undead channel %p !\n", pch);
3219 skb_queue_purge(&pch->file.xq);
3220 skb_queue_purge(&pch->file.rq);
3224 static void __exit ppp_cleanup(void)
3226 /* should never happen */
3227 if (atomic_read(&ppp_unit_count) || atomic_read(&channel_count))
3228 pr_err("PPP: removing module but units remain!\n");
3229 rtnl_link_unregister(&ppp_link_ops);
3230 unregister_chrdev(PPP_MAJOR, "ppp");
3231 device_destroy(ppp_class, MKDEV(PPP_MAJOR, 0));
3232 class_destroy(ppp_class);
3233 unregister_pernet_device(&ppp_net_ops);
3237 * Units handling. Caller must protect concurrent access
3238 * by holding all_ppp_mutex
3241 /* associate pointer with specified number */
3242 static int unit_set(struct idr *p, void *ptr, int n)
3246 unit = idr_alloc(p, ptr, n, n + 1, GFP_KERNEL);
3247 if (unit == -ENOSPC)
3252 /* get new free unit number and associate pointer with it */
3253 static int unit_get(struct idr *p, void *ptr)
3255 return idr_alloc(p, ptr, 0, 0, GFP_KERNEL);
3258 /* put unit number back to a pool */
3259 static void unit_put(struct idr *p, int n)
3264 /* get pointer associated with the number */
3265 static void *unit_find(struct idr *p, int n)
3267 return idr_find(p, n);
3270 /* Module/initialization stuff */
3272 module_init(ppp_init);
3273 module_exit(ppp_cleanup);
3275 EXPORT_SYMBOL(ppp_register_net_channel);
3276 EXPORT_SYMBOL(ppp_register_channel);
3277 EXPORT_SYMBOL(ppp_unregister_channel);
3278 EXPORT_SYMBOL(ppp_channel_index);
3279 EXPORT_SYMBOL(ppp_unit_number);
3280 EXPORT_SYMBOL(ppp_dev_name);
3281 EXPORT_SYMBOL(ppp_input);
3282 EXPORT_SYMBOL(ppp_input_error);
3283 EXPORT_SYMBOL(ppp_output_wakeup);
3284 EXPORT_SYMBOL(ppp_register_compressor);
3285 EXPORT_SYMBOL(ppp_unregister_compressor);
3286 MODULE_LICENSE("GPL");
3287 MODULE_ALIAS_CHARDEV(PPP_MAJOR, 0);
3288 MODULE_ALIAS_RTNL_LINK("ppp");
3289 MODULE_ALIAS("devname:ppp");