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, 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)
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, 0);
969 if (!ifname_is_set) {
971 snprintf(ppp->dev->name, IFNAMSIZ, "ppp%i", ret);
972 if (!__dev_get_by_name(ppp->ppp_net, ppp->dev->name))
974 unit_put(&pn->units_idr, ret);
975 ret = unit_get(&pn->units_idr, ppp, ret + 1);
981 /* Caller asked for a specific unit number. Fail with -EEXIST
982 * if unavailable. For backward compatibility, return -EEXIST
983 * too if idr allocation fails; this makes pppd retry without
984 * requesting a specific unit number.
986 if (unit_find(&pn->units_idr, unit)) {
990 ret = unit_set(&pn->units_idr, ppp, unit);
992 /* Rewrite error for backward compatibility */
997 ppp->file.index = ret;
1000 snprintf(ppp->dev->name, IFNAMSIZ, "ppp%i", ppp->file.index);
1002 mutex_unlock(&pn->all_ppp_mutex);
1004 ret = register_netdevice(ppp->dev);
1008 atomic_inc(&ppp_unit_count);
1013 mutex_lock(&pn->all_ppp_mutex);
1014 unit_put(&pn->units_idr, ppp->file.index);
1016 mutex_unlock(&pn->all_ppp_mutex);
1021 static int ppp_dev_configure(struct net *src_net, struct net_device *dev,
1022 const struct ppp_config *conf)
1024 struct ppp *ppp = netdev_priv(dev);
1030 ppp->ppp_net = src_net;
1032 ppp->owner = conf->file;
1034 init_ppp_file(&ppp->file, INTERFACE);
1035 ppp->file.hdrlen = PPP_HDRLEN - 2; /* don't count proto bytes */
1037 for (indx = 0; indx < NUM_NP; ++indx)
1038 ppp->npmode[indx] = NPMODE_PASS;
1039 INIT_LIST_HEAD(&ppp->channels);
1040 spin_lock_init(&ppp->rlock);
1041 spin_lock_init(&ppp->wlock);
1043 ppp->xmit_recursion = alloc_percpu(int);
1044 if (!ppp->xmit_recursion) {
1048 for_each_possible_cpu(cpu)
1049 (*per_cpu_ptr(ppp->xmit_recursion, cpu)) = 0;
1051 #ifdef CONFIG_PPP_MULTILINK
1053 skb_queue_head_init(&ppp->mrq);
1054 #endif /* CONFIG_PPP_MULTILINK */
1055 #ifdef CONFIG_PPP_FILTER
1056 ppp->pass_filter = NULL;
1057 ppp->active_filter = NULL;
1058 #endif /* CONFIG_PPP_FILTER */
1060 err = ppp_unit_register(ppp, conf->unit, conf->ifname_is_set);
1064 conf->file->private_data = &ppp->file;
1068 free_percpu(ppp->xmit_recursion);
1073 static const struct nla_policy ppp_nl_policy[IFLA_PPP_MAX + 1] = {
1074 [IFLA_PPP_DEV_FD] = { .type = NLA_S32 },
1077 static int ppp_nl_validate(struct nlattr *tb[], struct nlattr *data[],
1078 struct netlink_ext_ack *extack)
1083 if (!data[IFLA_PPP_DEV_FD])
1085 if (nla_get_s32(data[IFLA_PPP_DEV_FD]) < 0)
1091 static int ppp_nl_newlink(struct net *src_net, struct net_device *dev,
1092 struct nlattr *tb[], struct nlattr *data[],
1093 struct netlink_ext_ack *extack)
1095 struct ppp_config conf = {
1097 .ifname_is_set = true,
1102 file = fget(nla_get_s32(data[IFLA_PPP_DEV_FD]));
1106 /* rtnl_lock is already held here, but ppp_create_interface() locks
1107 * ppp_mutex before holding rtnl_lock. Using mutex_trylock() avoids
1108 * possible deadlock due to lock order inversion, at the cost of
1109 * pushing the problem back to userspace.
1111 if (!mutex_trylock(&ppp_mutex)) {
1116 if (file->f_op != &ppp_device_fops || file->private_data) {
1123 /* Don't use device name generated by the rtnetlink layer when ifname
1124 * isn't specified. Let ppp_dev_configure() set the device name using
1125 * the PPP unit identifer as suffix (i.e. ppp<unit_id>). This allows
1126 * userspace to infer the device name using to the PPPIOCGUNIT ioctl.
1128 if (!tb[IFLA_IFNAME] || !nla_len(tb[IFLA_IFNAME]) || !*(char *)nla_data(tb[IFLA_IFNAME]))
1129 conf.ifname_is_set = false;
1131 err = ppp_dev_configure(src_net, dev, &conf);
1134 mutex_unlock(&ppp_mutex);
1141 static void ppp_nl_dellink(struct net_device *dev, struct list_head *head)
1143 unregister_netdevice_queue(dev, head);
1146 static size_t ppp_nl_get_size(const struct net_device *dev)
1151 static int ppp_nl_fill_info(struct sk_buff *skb, const struct net_device *dev)
1156 static struct net *ppp_nl_get_link_net(const struct net_device *dev)
1158 struct ppp *ppp = netdev_priv(dev);
1160 return ppp->ppp_net;
1163 static struct rtnl_link_ops ppp_link_ops __read_mostly = {
1165 .maxtype = IFLA_PPP_MAX,
1166 .policy = ppp_nl_policy,
1167 .priv_size = sizeof(struct ppp),
1169 .validate = ppp_nl_validate,
1170 .newlink = ppp_nl_newlink,
1171 .dellink = ppp_nl_dellink,
1172 .get_size = ppp_nl_get_size,
1173 .fill_info = ppp_nl_fill_info,
1174 .get_link_net = ppp_nl_get_link_net,
1177 #define PPP_MAJOR 108
1179 /* Called at boot time if ppp is compiled into the kernel,
1180 or at module load time (from init_module) if compiled as a module. */
1181 static int __init ppp_init(void)
1185 pr_info("PPP generic driver version " PPP_VERSION "\n");
1187 err = register_pernet_device(&ppp_net_ops);
1189 pr_err("failed to register PPP pernet device (%d)\n", err);
1193 err = register_chrdev(PPP_MAJOR, "ppp", &ppp_device_fops);
1195 pr_err("failed to register PPP device (%d)\n", err);
1199 ppp_class = class_create(THIS_MODULE, "ppp");
1200 if (IS_ERR(ppp_class)) {
1201 err = PTR_ERR(ppp_class);
1205 err = rtnl_link_register(&ppp_link_ops);
1207 pr_err("failed to register rtnetlink PPP handler\n");
1211 /* not a big deal if we fail here :-) */
1212 device_create(ppp_class, NULL, MKDEV(PPP_MAJOR, 0), NULL, "ppp");
1217 class_destroy(ppp_class);
1219 unregister_chrdev(PPP_MAJOR, "ppp");
1221 unregister_pernet_device(&ppp_net_ops);
1227 * Network interface unit routines.
1230 ppp_start_xmit(struct sk_buff *skb, struct net_device *dev)
1232 struct ppp *ppp = netdev_priv(dev);
1236 npi = ethertype_to_npindex(ntohs(skb->protocol));
1240 /* Drop, accept or reject the packet */
1241 switch (ppp->npmode[npi]) {
1245 /* it would be nice to have a way to tell the network
1246 system to queue this one up for later. */
1253 /* Put the 2-byte PPP protocol number on the front,
1254 making sure there is room for the address and control fields. */
1255 if (skb_cow_head(skb, PPP_HDRLEN))
1258 pp = skb_push(skb, 2);
1259 proto = npindex_to_proto[npi];
1260 put_unaligned_be16(proto, pp);
1262 skb_scrub_packet(skb, !net_eq(ppp->ppp_net, dev_net(dev)));
1263 ppp_xmit_process(ppp, skb);
1265 return NETDEV_TX_OK;
1269 ++dev->stats.tx_dropped;
1270 return NETDEV_TX_OK;
1274 ppp_net_ioctl(struct net_device *dev, struct ifreq *ifr, int cmd)
1276 struct ppp *ppp = netdev_priv(dev);
1278 void __user *addr = (void __user *) ifr->ifr_ifru.ifru_data;
1279 struct ppp_stats stats;
1280 struct ppp_comp_stats cstats;
1285 ppp_get_stats(ppp, &stats);
1286 if (copy_to_user(addr, &stats, sizeof(stats)))
1291 case SIOCGPPPCSTATS:
1292 memset(&cstats, 0, sizeof(cstats));
1294 ppp->xcomp->comp_stat(ppp->xc_state, &cstats.c);
1296 ppp->rcomp->decomp_stat(ppp->rc_state, &cstats.d);
1297 if (copy_to_user(addr, &cstats, sizeof(cstats)))
1304 if (copy_to_user(addr, vers, strlen(vers) + 1))
1317 ppp_get_stats64(struct net_device *dev, struct rtnl_link_stats64 *stats64)
1319 struct ppp *ppp = netdev_priv(dev);
1322 stats64->rx_packets = ppp->stats64.rx_packets;
1323 stats64->rx_bytes = ppp->stats64.rx_bytes;
1324 ppp_recv_unlock(ppp);
1327 stats64->tx_packets = ppp->stats64.tx_packets;
1328 stats64->tx_bytes = ppp->stats64.tx_bytes;
1329 ppp_xmit_unlock(ppp);
1331 stats64->rx_errors = dev->stats.rx_errors;
1332 stats64->tx_errors = dev->stats.tx_errors;
1333 stats64->rx_dropped = dev->stats.rx_dropped;
1334 stats64->tx_dropped = dev->stats.tx_dropped;
1335 stats64->rx_length_errors = dev->stats.rx_length_errors;
1338 static int ppp_dev_init(struct net_device *dev)
1342 netdev_lockdep_set_classes(dev);
1344 ppp = netdev_priv(dev);
1345 /* Let the netdevice take a reference on the ppp file. This ensures
1346 * that ppp_destroy_interface() won't run before the device gets
1349 refcount_inc(&ppp->file.refcnt);
1354 static void ppp_dev_uninit(struct net_device *dev)
1356 struct ppp *ppp = netdev_priv(dev);
1357 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
1363 mutex_lock(&pn->all_ppp_mutex);
1364 unit_put(&pn->units_idr, ppp->file.index);
1365 mutex_unlock(&pn->all_ppp_mutex);
1370 wake_up_interruptible(&ppp->file.rwait);
1373 static void ppp_dev_priv_destructor(struct net_device *dev)
1377 ppp = netdev_priv(dev);
1378 if (refcount_dec_and_test(&ppp->file.refcnt))
1379 ppp_destroy_interface(ppp);
1382 static const struct net_device_ops ppp_netdev_ops = {
1383 .ndo_init = ppp_dev_init,
1384 .ndo_uninit = ppp_dev_uninit,
1385 .ndo_start_xmit = ppp_start_xmit,
1386 .ndo_do_ioctl = ppp_net_ioctl,
1387 .ndo_get_stats64 = ppp_get_stats64,
1390 static struct device_type ppp_type = {
1394 static void ppp_setup(struct net_device *dev)
1396 dev->netdev_ops = &ppp_netdev_ops;
1397 SET_NETDEV_DEVTYPE(dev, &ppp_type);
1399 dev->features |= NETIF_F_LLTX;
1401 dev->hard_header_len = PPP_HDRLEN;
1404 dev->tx_queue_len = 3;
1405 dev->type = ARPHRD_PPP;
1406 dev->flags = IFF_POINTOPOINT | IFF_NOARP | IFF_MULTICAST;
1407 dev->priv_destructor = ppp_dev_priv_destructor;
1408 netif_keep_dst(dev);
1412 * Transmit-side routines.
1415 /* Called to do any work queued up on the transmit side that can now be done */
1416 static void __ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1419 if (!ppp->closing) {
1423 skb_queue_tail(&ppp->file.xq, skb);
1424 while (!ppp->xmit_pending &&
1425 (skb = skb_dequeue(&ppp->file.xq)))
1426 ppp_send_frame(ppp, skb);
1427 /* If there's no work left to do, tell the core net
1428 code that we can accept some more. */
1429 if (!ppp->xmit_pending && !skb_peek(&ppp->file.xq))
1430 netif_wake_queue(ppp->dev);
1432 netif_stop_queue(ppp->dev);
1436 ppp_xmit_unlock(ppp);
1439 static void ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1443 if (unlikely(*this_cpu_ptr(ppp->xmit_recursion)))
1446 (*this_cpu_ptr(ppp->xmit_recursion))++;
1447 __ppp_xmit_process(ppp, skb);
1448 (*this_cpu_ptr(ppp->xmit_recursion))--;
1459 if (net_ratelimit())
1460 netdev_err(ppp->dev, "recursion detected\n");
1463 static inline struct sk_buff *
1464 pad_compress_skb(struct ppp *ppp, struct sk_buff *skb)
1466 struct sk_buff *new_skb;
1468 int new_skb_size = ppp->dev->mtu +
1469 ppp->xcomp->comp_extra + ppp->dev->hard_header_len;
1470 int compressor_skb_size = ppp->dev->mtu +
1471 ppp->xcomp->comp_extra + PPP_HDRLEN;
1472 new_skb = alloc_skb(new_skb_size, GFP_ATOMIC);
1474 if (net_ratelimit())
1475 netdev_err(ppp->dev, "PPP: no memory (comp pkt)\n");
1478 if (ppp->dev->hard_header_len > PPP_HDRLEN)
1479 skb_reserve(new_skb,
1480 ppp->dev->hard_header_len - PPP_HDRLEN);
1482 /* compressor still expects A/C bytes in hdr */
1483 len = ppp->xcomp->compress(ppp->xc_state, skb->data - 2,
1484 new_skb->data, skb->len + 2,
1485 compressor_skb_size);
1486 if (len > 0 && (ppp->flags & SC_CCP_UP)) {
1490 skb_pull(skb, 2); /* pull off A/C bytes */
1491 } else if (len == 0) {
1492 /* didn't compress, or CCP not up yet */
1493 consume_skb(new_skb);
1498 * MPPE requires that we do not send unencrypted
1499 * frames. The compressor will return -1 if we
1500 * should drop the frame. We cannot simply test
1501 * the compress_proto because MPPE and MPPC share
1504 if (net_ratelimit())
1505 netdev_err(ppp->dev, "ppp: compressor dropped pkt\n");
1507 consume_skb(new_skb);
1514 * Compress and send a frame.
1515 * The caller should have locked the xmit path,
1516 * and xmit_pending should be 0.
1519 ppp_send_frame(struct ppp *ppp, struct sk_buff *skb)
1521 int proto = PPP_PROTO(skb);
1522 struct sk_buff *new_skb;
1526 if (proto < 0x8000) {
1527 #ifdef CONFIG_PPP_FILTER
1528 /* check if we should pass this packet */
1529 /* the filter instructions are constructed assuming
1530 a four-byte PPP header on each packet */
1531 *(u8 *)skb_push(skb, 2) = 1;
1532 if (ppp->pass_filter &&
1533 BPF_PROG_RUN(ppp->pass_filter, skb) == 0) {
1535 netdev_printk(KERN_DEBUG, ppp->dev,
1536 "PPP: outbound frame "
1541 /* if this packet passes the active filter, record the time */
1542 if (!(ppp->active_filter &&
1543 BPF_PROG_RUN(ppp->active_filter, skb) == 0))
1544 ppp->last_xmit = jiffies;
1547 /* for data packets, record the time */
1548 ppp->last_xmit = jiffies;
1549 #endif /* CONFIG_PPP_FILTER */
1552 ++ppp->stats64.tx_packets;
1553 ppp->stats64.tx_bytes += skb->len - 2;
1557 if (!ppp->vj || (ppp->flags & SC_COMP_TCP) == 0)
1559 /* try to do VJ TCP header compression */
1560 new_skb = alloc_skb(skb->len + ppp->dev->hard_header_len - 2,
1563 netdev_err(ppp->dev, "PPP: no memory (VJ comp pkt)\n");
1566 skb_reserve(new_skb, ppp->dev->hard_header_len - 2);
1568 len = slhc_compress(ppp->vj, cp, skb->len - 2,
1569 new_skb->data + 2, &cp,
1570 !(ppp->flags & SC_NO_TCP_CCID));
1571 if (cp == skb->data + 2) {
1572 /* didn't compress */
1573 consume_skb(new_skb);
1575 if (cp[0] & SL_TYPE_COMPRESSED_TCP) {
1576 proto = PPP_VJC_COMP;
1577 cp[0] &= ~SL_TYPE_COMPRESSED_TCP;
1579 proto = PPP_VJC_UNCOMP;
1580 cp[0] = skb->data[2];
1584 cp = skb_put(skb, len + 2);
1591 /* peek at outbound CCP frames */
1592 ppp_ccp_peek(ppp, skb, 0);
1596 /* try to do packet compression */
1597 if ((ppp->xstate & SC_COMP_RUN) && ppp->xc_state &&
1598 proto != PPP_LCP && proto != PPP_CCP) {
1599 if (!(ppp->flags & SC_CCP_UP) && (ppp->flags & SC_MUST_COMP)) {
1600 if (net_ratelimit())
1601 netdev_err(ppp->dev,
1602 "ppp: compression required but "
1603 "down - pkt dropped.\n");
1606 skb = pad_compress_skb(ppp, skb);
1612 * If we are waiting for traffic (demand dialling),
1613 * queue it up for pppd to receive.
1615 if (ppp->flags & SC_LOOP_TRAFFIC) {
1616 if (ppp->file.rq.qlen > PPP_MAX_RQLEN)
1618 skb_queue_tail(&ppp->file.rq, skb);
1619 wake_up_interruptible(&ppp->file.rwait);
1623 ppp->xmit_pending = skb;
1629 ++ppp->dev->stats.tx_errors;
1633 * Try to send the frame in xmit_pending.
1634 * The caller should have the xmit path locked.
1637 ppp_push(struct ppp *ppp)
1639 struct list_head *list;
1640 struct channel *pch;
1641 struct sk_buff *skb = ppp->xmit_pending;
1646 list = &ppp->channels;
1647 if (list_empty(list)) {
1648 /* nowhere to send the packet, just drop it */
1649 ppp->xmit_pending = NULL;
1654 if ((ppp->flags & SC_MULTILINK) == 0) {
1655 /* not doing multilink: send it down the first channel */
1657 pch = list_entry(list, struct channel, clist);
1659 spin_lock(&pch->downl);
1661 if (pch->chan->ops->start_xmit(pch->chan, skb))
1662 ppp->xmit_pending = NULL;
1664 /* channel got unregistered */
1666 ppp->xmit_pending = NULL;
1668 spin_unlock(&pch->downl);
1672 #ifdef CONFIG_PPP_MULTILINK
1673 /* Multilink: fragment the packet over as many links
1674 as can take the packet at the moment. */
1675 if (!ppp_mp_explode(ppp, skb))
1677 #endif /* CONFIG_PPP_MULTILINK */
1679 ppp->xmit_pending = NULL;
1683 #ifdef CONFIG_PPP_MULTILINK
1684 static bool mp_protocol_compress __read_mostly = true;
1685 module_param(mp_protocol_compress, bool, 0644);
1686 MODULE_PARM_DESC(mp_protocol_compress,
1687 "compress protocol id in multilink fragments");
1690 * Divide a packet to be transmitted into fragments and
1691 * send them out the individual links.
1693 static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb)
1696 int i, bits, hdrlen, mtu;
1698 int navail, nfree, nzero;
1702 unsigned char *p, *q;
1703 struct list_head *list;
1704 struct channel *pch;
1705 struct sk_buff *frag;
1706 struct ppp_channel *chan;
1708 totspeed = 0; /*total bitrate of the bundle*/
1709 nfree = 0; /* # channels which have no packet already queued */
1710 navail = 0; /* total # of usable channels (not deregistered) */
1711 nzero = 0; /* number of channels with zero speed associated*/
1712 totfree = 0; /*total # of channels available and
1713 *having no queued packets before
1714 *starting the fragmentation*/
1716 hdrlen = (ppp->flags & SC_MP_XSHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1718 list_for_each_entry(pch, &ppp->channels, clist) {
1722 pch->speed = pch->chan->speed;
1727 if (skb_queue_empty(&pch->file.xq) ||
1729 if (pch->speed == 0)
1732 totspeed += pch->speed;
1738 if (!pch->had_frag && i < ppp->nxchan)
1744 * Don't start sending this packet unless at least half of
1745 * the channels are free. This gives much better TCP
1746 * performance if we have a lot of channels.
1748 if (nfree == 0 || nfree < navail / 2)
1749 return 0; /* can't take now, leave it in xmit_pending */
1751 /* Do protocol field compression */
1754 if (*p == 0 && mp_protocol_compress) {
1760 nbigger = len % nfree;
1762 /* skip to the channel after the one we last used
1763 and start at that one */
1764 list = &ppp->channels;
1765 for (i = 0; i < ppp->nxchan; ++i) {
1767 if (list == &ppp->channels) {
1773 /* create a fragment for each channel */
1777 if (list == &ppp->channels) {
1781 pch = list_entry(list, struct channel, clist);
1787 * Skip this channel if it has a fragment pending already and
1788 * we haven't given a fragment to all of the free channels.
1790 if (pch->avail == 1) {
1797 /* check the channel's mtu and whether it is still attached. */
1798 spin_lock(&pch->downl);
1799 if (pch->chan == NULL) {
1800 /* can't use this channel, it's being deregistered */
1801 if (pch->speed == 0)
1804 totspeed -= pch->speed;
1806 spin_unlock(&pch->downl);
1817 *if the channel speed is not set divide
1818 *the packet evenly among the free channels;
1819 *otherwise divide it according to the speed
1820 *of the channel we are going to transmit on
1824 if (pch->speed == 0) {
1831 flen = (((totfree - nzero)*(totlen + hdrlen*totfree)) /
1832 ((totspeed*totfree)/pch->speed)) - hdrlen;
1834 flen += ((totfree - nzero)*pch->speed)/totspeed;
1835 nbigger -= ((totfree - nzero)*pch->speed)/
1843 *check if we are on the last channel or
1844 *we exceded the length of the data to
1847 if ((nfree <= 0) || (flen > len))
1850 *it is not worth to tx on slow channels:
1851 *in that case from the resulting flen according to the
1852 *above formula will be equal or less than zero.
1853 *Skip the channel in this case
1857 spin_unlock(&pch->downl);
1862 * hdrlen includes the 2-byte PPP protocol field, but the
1863 * MTU counts only the payload excluding the protocol field.
1864 * (RFC1661 Section 2)
1866 mtu = pch->chan->mtu - (hdrlen - 2);
1873 frag = alloc_skb(flen + hdrlen + (flen == 0), GFP_ATOMIC);
1876 q = skb_put(frag, flen + hdrlen);
1878 /* make the MP header */
1879 put_unaligned_be16(PPP_MP, q);
1880 if (ppp->flags & SC_MP_XSHORTSEQ) {
1881 q[2] = bits + ((ppp->nxseq >> 8) & 0xf);
1885 q[3] = ppp->nxseq >> 16;
1886 q[4] = ppp->nxseq >> 8;
1890 memcpy(q + hdrlen, p, flen);
1892 /* try to send it down the channel */
1894 if (!skb_queue_empty(&pch->file.xq) ||
1895 !chan->ops->start_xmit(chan, frag))
1896 skb_queue_tail(&pch->file.xq, frag);
1902 spin_unlock(&pch->downl);
1909 spin_unlock(&pch->downl);
1911 netdev_err(ppp->dev, "PPP: no memory (fragment)\n");
1912 ++ppp->dev->stats.tx_errors;
1914 return 1; /* abandon the frame */
1916 #endif /* CONFIG_PPP_MULTILINK */
1918 /* Try to send data out on a channel */
1919 static void __ppp_channel_push(struct channel *pch)
1921 struct sk_buff *skb;
1924 spin_lock(&pch->downl);
1926 while (!skb_queue_empty(&pch->file.xq)) {
1927 skb = skb_dequeue(&pch->file.xq);
1928 if (!pch->chan->ops->start_xmit(pch->chan, skb)) {
1929 /* put the packet back and try again later */
1930 skb_queue_head(&pch->file.xq, skb);
1935 /* channel got deregistered */
1936 skb_queue_purge(&pch->file.xq);
1938 spin_unlock(&pch->downl);
1939 /* see if there is anything from the attached unit to be sent */
1940 if (skb_queue_empty(&pch->file.xq)) {
1943 __ppp_xmit_process(ppp, NULL);
1947 static void ppp_channel_push(struct channel *pch)
1949 read_lock_bh(&pch->upl);
1951 (*this_cpu_ptr(pch->ppp->xmit_recursion))++;
1952 __ppp_channel_push(pch);
1953 (*this_cpu_ptr(pch->ppp->xmit_recursion))--;
1955 __ppp_channel_push(pch);
1957 read_unlock_bh(&pch->upl);
1961 * Receive-side routines.
1964 struct ppp_mp_skb_parm {
1968 #define PPP_MP_CB(skb) ((struct ppp_mp_skb_parm *)((skb)->cb))
1971 ppp_do_recv(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1975 ppp_receive_frame(ppp, skb, pch);
1978 ppp_recv_unlock(ppp);
1982 ppp_input(struct ppp_channel *chan, struct sk_buff *skb)
1984 struct channel *pch = chan->ppp;
1992 read_lock_bh(&pch->upl);
1993 if (!pskb_may_pull(skb, 2)) {
1996 ++pch->ppp->dev->stats.rx_length_errors;
1997 ppp_receive_error(pch->ppp);
2002 proto = PPP_PROTO(skb);
2003 if (!pch->ppp || proto >= 0xc000 || proto == PPP_CCPFRAG) {
2004 /* put it on the channel queue */
2005 skb_queue_tail(&pch->file.rq, skb);
2006 /* drop old frames if queue too long */
2007 while (pch->file.rq.qlen > PPP_MAX_RQLEN &&
2008 (skb = skb_dequeue(&pch->file.rq)))
2010 wake_up_interruptible(&pch->file.rwait);
2012 ppp_do_recv(pch->ppp, skb, pch);
2016 read_unlock_bh(&pch->upl);
2019 /* Put a 0-length skb in the receive queue as an error indication */
2021 ppp_input_error(struct ppp_channel *chan, int code)
2023 struct channel *pch = chan->ppp;
2024 struct sk_buff *skb;
2029 read_lock_bh(&pch->upl);
2031 skb = alloc_skb(0, GFP_ATOMIC);
2033 skb->len = 0; /* probably unnecessary */
2035 ppp_do_recv(pch->ppp, skb, pch);
2038 read_unlock_bh(&pch->upl);
2042 * We come in here to process a received frame.
2043 * The receive side of the ppp unit is locked.
2046 ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2048 /* note: a 0-length skb is used as an error indication */
2050 skb_checksum_complete_unset(skb);
2051 #ifdef CONFIG_PPP_MULTILINK
2052 /* XXX do channel-level decompression here */
2053 if (PPP_PROTO(skb) == PPP_MP)
2054 ppp_receive_mp_frame(ppp, skb, pch);
2056 #endif /* CONFIG_PPP_MULTILINK */
2057 ppp_receive_nonmp_frame(ppp, skb);
2060 ppp_receive_error(ppp);
2065 ppp_receive_error(struct ppp *ppp)
2067 ++ppp->dev->stats.rx_errors;
2073 ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb)
2076 int proto, len, npi;
2079 * Decompress the frame, if compressed.
2080 * Note that some decompressors need to see uncompressed frames
2081 * that come in as well as compressed frames.
2083 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN) &&
2084 (ppp->rstate & (SC_DC_FERROR | SC_DC_ERROR)) == 0)
2085 skb = ppp_decompress_frame(ppp, skb);
2087 if (ppp->flags & SC_MUST_COMP && ppp->rstate & SC_DC_FERROR)
2090 proto = PPP_PROTO(skb);
2093 /* decompress VJ compressed packets */
2094 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2097 if (skb_tailroom(skb) < 124 || skb_cloned(skb)) {
2098 /* copy to a new sk_buff with more tailroom */
2099 ns = dev_alloc_skb(skb->len + 128);
2101 netdev_err(ppp->dev, "PPP: no memory "
2106 skb_copy_bits(skb, 0, skb_put(ns, skb->len), skb->len);
2111 skb->ip_summed = CHECKSUM_NONE;
2113 len = slhc_uncompress(ppp->vj, skb->data + 2, skb->len - 2);
2115 netdev_printk(KERN_DEBUG, ppp->dev,
2116 "PPP: VJ decompression error\n");
2121 skb_put(skb, len - skb->len);
2122 else if (len < skb->len)
2127 case PPP_VJC_UNCOMP:
2128 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2131 /* Until we fix the decompressor need to make sure
2132 * data portion is linear.
2134 if (!pskb_may_pull(skb, skb->len))
2137 if (slhc_remember(ppp->vj, skb->data + 2, skb->len - 2) <= 0) {
2138 netdev_err(ppp->dev, "PPP: VJ uncompressed error\n");
2145 ppp_ccp_peek(ppp, skb, 1);
2149 ++ppp->stats64.rx_packets;
2150 ppp->stats64.rx_bytes += skb->len - 2;
2152 npi = proto_to_npindex(proto);
2154 /* control or unknown frame - pass it to pppd */
2155 skb_queue_tail(&ppp->file.rq, skb);
2156 /* limit queue length by dropping old frames */
2157 while (ppp->file.rq.qlen > PPP_MAX_RQLEN &&
2158 (skb = skb_dequeue(&ppp->file.rq)))
2160 /* wake up any process polling or blocking on read */
2161 wake_up_interruptible(&ppp->file.rwait);
2164 /* network protocol frame - give it to the kernel */
2166 #ifdef CONFIG_PPP_FILTER
2167 /* check if the packet passes the pass and active filters */
2168 /* the filter instructions are constructed assuming
2169 a four-byte PPP header on each packet */
2170 if (ppp->pass_filter || ppp->active_filter) {
2171 if (skb_unclone(skb, GFP_ATOMIC))
2174 *(u8 *)skb_push(skb, 2) = 0;
2175 if (ppp->pass_filter &&
2176 BPF_PROG_RUN(ppp->pass_filter, skb) == 0) {
2178 netdev_printk(KERN_DEBUG, ppp->dev,
2179 "PPP: inbound frame "
2184 if (!(ppp->active_filter &&
2185 BPF_PROG_RUN(ppp->active_filter, skb) == 0))
2186 ppp->last_recv = jiffies;
2189 #endif /* CONFIG_PPP_FILTER */
2190 ppp->last_recv = jiffies;
2192 if ((ppp->dev->flags & IFF_UP) == 0 ||
2193 ppp->npmode[npi] != NPMODE_PASS) {
2196 /* chop off protocol */
2197 skb_pull_rcsum(skb, 2);
2198 skb->dev = ppp->dev;
2199 skb->protocol = htons(npindex_to_ethertype[npi]);
2200 skb_reset_mac_header(skb);
2201 skb_scrub_packet(skb, !net_eq(ppp->ppp_net,
2202 dev_net(ppp->dev)));
2210 ppp_receive_error(ppp);
2213 static struct sk_buff *
2214 ppp_decompress_frame(struct ppp *ppp, struct sk_buff *skb)
2216 int proto = PPP_PROTO(skb);
2220 /* Until we fix all the decompressor's need to make sure
2221 * data portion is linear.
2223 if (!pskb_may_pull(skb, skb->len))
2226 if (proto == PPP_COMP) {
2229 switch(ppp->rcomp->compress_proto) {
2231 obuff_size = ppp->mru + PPP_HDRLEN + 1;
2234 obuff_size = ppp->mru + PPP_HDRLEN;
2238 ns = dev_alloc_skb(obuff_size);
2240 netdev_err(ppp->dev, "ppp_decompress_frame: "
2244 /* the decompressor still expects the A/C bytes in the hdr */
2245 len = ppp->rcomp->decompress(ppp->rc_state, skb->data - 2,
2246 skb->len + 2, ns->data, obuff_size);
2248 /* Pass the compressed frame to pppd as an
2249 error indication. */
2250 if (len == DECOMP_FATALERROR)
2251 ppp->rstate |= SC_DC_FERROR;
2259 skb_pull(skb, 2); /* pull off the A/C bytes */
2262 /* Uncompressed frame - pass to decompressor so it
2263 can update its dictionary if necessary. */
2264 if (ppp->rcomp->incomp)
2265 ppp->rcomp->incomp(ppp->rc_state, skb->data - 2,
2272 ppp->rstate |= SC_DC_ERROR;
2273 ppp_receive_error(ppp);
2277 #ifdef CONFIG_PPP_MULTILINK
2279 * Receive a multilink frame.
2280 * We put it on the reconstruction queue and then pull off
2281 * as many completed frames as we can.
2284 ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2288 int mphdrlen = (ppp->flags & SC_MP_SHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
2290 if (!pskb_may_pull(skb, mphdrlen + 1) || ppp->mrru == 0)
2291 goto err; /* no good, throw it away */
2293 /* Decode sequence number and begin/end bits */
2294 if (ppp->flags & SC_MP_SHORTSEQ) {
2295 seq = ((skb->data[2] & 0x0f) << 8) | skb->data[3];
2298 seq = (skb->data[3] << 16) | (skb->data[4] << 8)| skb->data[5];
2301 PPP_MP_CB(skb)->BEbits = skb->data[2];
2302 skb_pull(skb, mphdrlen); /* pull off PPP and MP headers */
2305 * Do protocol ID decompression on the first fragment of each packet.
2307 if ((PPP_MP_CB(skb)->BEbits & B) && (skb->data[0] & 1))
2308 *(u8 *)skb_push(skb, 1) = 0;
2311 * Expand sequence number to 32 bits, making it as close
2312 * as possible to ppp->minseq.
2314 seq |= ppp->minseq & ~mask;
2315 if ((int)(ppp->minseq - seq) > (int)(mask >> 1))
2317 else if ((int)(seq - ppp->minseq) > (int)(mask >> 1))
2318 seq -= mask + 1; /* should never happen */
2319 PPP_MP_CB(skb)->sequence = seq;
2323 * If this packet comes before the next one we were expecting,
2326 if (seq_before(seq, ppp->nextseq)) {
2328 ++ppp->dev->stats.rx_dropped;
2329 ppp_receive_error(ppp);
2334 * Reevaluate minseq, the minimum over all channels of the
2335 * last sequence number received on each channel. Because of
2336 * the increasing sequence number rule, we know that any fragment
2337 * before `minseq' which hasn't arrived is never going to arrive.
2338 * The list of channels can't change because we have the receive
2339 * side of the ppp unit locked.
2341 list_for_each_entry(ch, &ppp->channels, clist) {
2342 if (seq_before(ch->lastseq, seq))
2345 if (seq_before(ppp->minseq, seq))
2348 /* Put the fragment on the reconstruction queue */
2349 ppp_mp_insert(ppp, skb);
2351 /* If the queue is getting long, don't wait any longer for packets
2352 before the start of the queue. */
2353 if (skb_queue_len(&ppp->mrq) >= PPP_MP_MAX_QLEN) {
2354 struct sk_buff *mskb = skb_peek(&ppp->mrq);
2355 if (seq_before(ppp->minseq, PPP_MP_CB(mskb)->sequence))
2356 ppp->minseq = PPP_MP_CB(mskb)->sequence;
2359 /* Pull completed packets off the queue and receive them. */
2360 while ((skb = ppp_mp_reconstruct(ppp))) {
2361 if (pskb_may_pull(skb, 2))
2362 ppp_receive_nonmp_frame(ppp, skb);
2364 ++ppp->dev->stats.rx_length_errors;
2366 ppp_receive_error(ppp);
2374 ppp_receive_error(ppp);
2378 * Insert a fragment on the MP reconstruction queue.
2379 * The queue is ordered by increasing sequence number.
2382 ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb)
2385 struct sk_buff_head *list = &ppp->mrq;
2386 u32 seq = PPP_MP_CB(skb)->sequence;
2388 /* N.B. we don't need to lock the list lock because we have the
2389 ppp unit receive-side lock. */
2390 skb_queue_walk(list, p) {
2391 if (seq_before(seq, PPP_MP_CB(p)->sequence))
2394 __skb_queue_before(list, p, skb);
2398 * Reconstruct a packet from the MP fragment queue.
2399 * We go through increasing sequence numbers until we find a
2400 * complete packet, or we get to the sequence number for a fragment
2401 * which hasn't arrived but might still do so.
2403 static struct sk_buff *
2404 ppp_mp_reconstruct(struct ppp *ppp)
2406 u32 seq = ppp->nextseq;
2407 u32 minseq = ppp->minseq;
2408 struct sk_buff_head *list = &ppp->mrq;
2409 struct sk_buff *p, *tmp;
2410 struct sk_buff *head, *tail;
2411 struct sk_buff *skb = NULL;
2412 int lost = 0, len = 0;
2414 if (ppp->mrru == 0) /* do nothing until mrru is set */
2418 skb_queue_walk_safe(list, p, tmp) {
2420 if (seq_before(PPP_MP_CB(p)->sequence, seq)) {
2421 /* this can't happen, anyway ignore the skb */
2422 netdev_err(ppp->dev, "ppp_mp_reconstruct bad "
2424 PPP_MP_CB(p)->sequence, seq);
2425 __skb_unlink(p, list);
2429 if (PPP_MP_CB(p)->sequence != seq) {
2431 /* Fragment `seq' is missing. If it is after
2432 minseq, it might arrive later, so stop here. */
2433 if (seq_after(seq, minseq))
2435 /* Fragment `seq' is lost, keep going. */
2438 seq = seq_before(minseq, PPP_MP_CB(p)->sequence)?
2439 minseq + 1: PPP_MP_CB(p)->sequence;
2442 netdev_printk(KERN_DEBUG, ppp->dev,
2443 "lost frag %u..%u\n",
2450 * At this point we know that all the fragments from
2451 * ppp->nextseq to seq are either present or lost.
2452 * Also, there are no complete packets in the queue
2453 * that have no missing fragments and end before this
2457 /* B bit set indicates this fragment starts a packet */
2458 if (PPP_MP_CB(p)->BEbits & B) {
2466 /* Got a complete packet yet? */
2467 if (lost == 0 && (PPP_MP_CB(p)->BEbits & E) &&
2468 (PPP_MP_CB(head)->BEbits & B)) {
2469 if (len > ppp->mrru + 2) {
2470 ++ppp->dev->stats.rx_length_errors;
2471 netdev_printk(KERN_DEBUG, ppp->dev,
2472 "PPP: reconstructed packet"
2473 " is too long (%d)\n", len);
2478 ppp->nextseq = seq + 1;
2482 * If this is the ending fragment of a packet,
2483 * and we haven't found a complete valid packet yet,
2484 * we can discard up to and including this fragment.
2486 if (PPP_MP_CB(p)->BEbits & E) {
2487 struct sk_buff *tmp2;
2489 skb_queue_reverse_walk_from_safe(list, p, tmp2) {
2491 netdev_printk(KERN_DEBUG, ppp->dev,
2492 "discarding frag %u\n",
2493 PPP_MP_CB(p)->sequence);
2494 __skb_unlink(p, list);
2497 head = skb_peek(list);
2504 /* If we have a complete packet, copy it all into one skb. */
2506 /* If we have discarded any fragments,
2507 signal a receive error. */
2508 if (PPP_MP_CB(head)->sequence != ppp->nextseq) {
2509 skb_queue_walk_safe(list, p, tmp) {
2513 netdev_printk(KERN_DEBUG, ppp->dev,
2514 "discarding frag %u\n",
2515 PPP_MP_CB(p)->sequence);
2516 __skb_unlink(p, list);
2521 netdev_printk(KERN_DEBUG, ppp->dev,
2522 " missed pkts %u..%u\n",
2524 PPP_MP_CB(head)->sequence-1);
2525 ++ppp->dev->stats.rx_dropped;
2526 ppp_receive_error(ppp);
2531 struct sk_buff **fragpp = &skb_shinfo(skb)->frag_list;
2532 p = skb_queue_next(list, head);
2533 __skb_unlink(skb, list);
2534 skb_queue_walk_from_safe(list, p, tmp) {
2535 __skb_unlink(p, list);
2541 skb->data_len += p->len;
2542 skb->truesize += p->truesize;
2548 __skb_unlink(skb, list);
2551 ppp->nextseq = PPP_MP_CB(tail)->sequence + 1;
2556 #endif /* CONFIG_PPP_MULTILINK */
2559 * Channel interface.
2562 /* Create a new, unattached ppp channel. */
2563 int ppp_register_channel(struct ppp_channel *chan)
2565 return ppp_register_net_channel(current->nsproxy->net_ns, chan);
2568 /* Create a new, unattached ppp channel for specified net. */
2569 int ppp_register_net_channel(struct net *net, struct ppp_channel *chan)
2571 struct channel *pch;
2574 pch = kzalloc(sizeof(struct channel), GFP_KERNEL);
2578 pn = ppp_pernet(net);
2582 pch->chan_net = get_net(net);
2584 init_ppp_file(&pch->file, CHANNEL);
2585 pch->file.hdrlen = chan->hdrlen;
2586 #ifdef CONFIG_PPP_MULTILINK
2588 #endif /* CONFIG_PPP_MULTILINK */
2589 init_rwsem(&pch->chan_sem);
2590 spin_lock_init(&pch->downl);
2591 rwlock_init(&pch->upl);
2593 spin_lock_bh(&pn->all_channels_lock);
2594 pch->file.index = ++pn->last_channel_index;
2595 list_add(&pch->list, &pn->new_channels);
2596 atomic_inc(&channel_count);
2597 spin_unlock_bh(&pn->all_channels_lock);
2603 * Return the index of a channel.
2605 int ppp_channel_index(struct ppp_channel *chan)
2607 struct channel *pch = chan->ppp;
2610 return pch->file.index;
2615 * Return the PPP unit number to which a channel is connected.
2617 int ppp_unit_number(struct ppp_channel *chan)
2619 struct channel *pch = chan->ppp;
2623 read_lock_bh(&pch->upl);
2625 unit = pch->ppp->file.index;
2626 read_unlock_bh(&pch->upl);
2632 * Return the PPP device interface name of a channel.
2634 char *ppp_dev_name(struct ppp_channel *chan)
2636 struct channel *pch = chan->ppp;
2640 read_lock_bh(&pch->upl);
2641 if (pch->ppp && pch->ppp->dev)
2642 name = pch->ppp->dev->name;
2643 read_unlock_bh(&pch->upl);
2650 * Disconnect a channel from the generic layer.
2651 * This must be called in process context.
2654 ppp_unregister_channel(struct ppp_channel *chan)
2656 struct channel *pch = chan->ppp;
2660 return; /* should never happen */
2665 * This ensures that we have returned from any calls into the
2666 * the channel's start_xmit or ioctl routine before we proceed.
2668 down_write(&pch->chan_sem);
2669 spin_lock_bh(&pch->downl);
2671 spin_unlock_bh(&pch->downl);
2672 up_write(&pch->chan_sem);
2673 ppp_disconnect_channel(pch);
2675 pn = ppp_pernet(pch->chan_net);
2676 spin_lock_bh(&pn->all_channels_lock);
2677 list_del(&pch->list);
2678 spin_unlock_bh(&pn->all_channels_lock);
2681 wake_up_interruptible(&pch->file.rwait);
2682 if (refcount_dec_and_test(&pch->file.refcnt))
2683 ppp_destroy_channel(pch);
2687 * Callback from a channel when it can accept more to transmit.
2688 * This should be called at BH/softirq level, not interrupt level.
2691 ppp_output_wakeup(struct ppp_channel *chan)
2693 struct channel *pch = chan->ppp;
2697 ppp_channel_push(pch);
2701 * Compression control.
2704 /* Process the PPPIOCSCOMPRESS ioctl. */
2706 ppp_set_compress(struct ppp *ppp, unsigned long arg)
2709 struct compressor *cp, *ocomp;
2710 struct ppp_option_data data;
2711 void *state, *ostate;
2712 unsigned char ccp_option[CCP_MAX_OPTION_LENGTH];
2715 if (copy_from_user(&data, (void __user *) arg, sizeof(data)))
2717 if (data.length > CCP_MAX_OPTION_LENGTH)
2719 if (copy_from_user(ccp_option, (void __user *) data.ptr, data.length))
2723 if (data.length < 2 || ccp_option[1] < 2 || ccp_option[1] > data.length)
2726 cp = try_then_request_module(
2727 find_compressor(ccp_option[0]),
2728 "ppp-compress-%d", ccp_option[0]);
2733 if (data.transmit) {
2734 state = cp->comp_alloc(ccp_option, data.length);
2737 ppp->xstate &= ~SC_COMP_RUN;
2739 ostate = ppp->xc_state;
2741 ppp->xc_state = state;
2742 ppp_xmit_unlock(ppp);
2744 ocomp->comp_free(ostate);
2745 module_put(ocomp->owner);
2749 module_put(cp->owner);
2752 state = cp->decomp_alloc(ccp_option, data.length);
2755 ppp->rstate &= ~SC_DECOMP_RUN;
2757 ostate = ppp->rc_state;
2759 ppp->rc_state = state;
2760 ppp_recv_unlock(ppp);
2762 ocomp->decomp_free(ostate);
2763 module_put(ocomp->owner);
2767 module_put(cp->owner);
2775 * Look at a CCP packet and update our state accordingly.
2776 * We assume the caller has the xmit or recv path locked.
2779 ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound)
2784 if (!pskb_may_pull(skb, CCP_HDRLEN + 2))
2785 return; /* no header */
2788 switch (CCP_CODE(dp)) {
2791 /* A ConfReq starts negotiation of compression
2792 * in one direction of transmission,
2793 * and hence brings it down...but which way?
2796 * A ConfReq indicates what the sender would like to receive
2799 /* He is proposing what I should send */
2800 ppp->xstate &= ~SC_COMP_RUN;
2802 /* I am proposing to what he should send */
2803 ppp->rstate &= ~SC_DECOMP_RUN;
2810 * CCP is going down, both directions of transmission
2812 ppp->rstate &= ~SC_DECOMP_RUN;
2813 ppp->xstate &= ~SC_COMP_RUN;
2817 if ((ppp->flags & (SC_CCP_OPEN | SC_CCP_UP)) != SC_CCP_OPEN)
2819 len = CCP_LENGTH(dp);
2820 if (!pskb_may_pull(skb, len + 2))
2821 return; /* too short */
2824 if (len < CCP_OPT_MINLEN || len < CCP_OPT_LENGTH(dp))
2827 /* we will start receiving compressed packets */
2830 if (ppp->rcomp->decomp_init(ppp->rc_state, dp, len,
2831 ppp->file.index, 0, ppp->mru, ppp->debug)) {
2832 ppp->rstate |= SC_DECOMP_RUN;
2833 ppp->rstate &= ~(SC_DC_ERROR | SC_DC_FERROR);
2836 /* we will soon start sending compressed packets */
2839 if (ppp->xcomp->comp_init(ppp->xc_state, dp, len,
2840 ppp->file.index, 0, ppp->debug))
2841 ppp->xstate |= SC_COMP_RUN;
2846 /* reset the [de]compressor */
2847 if ((ppp->flags & SC_CCP_UP) == 0)
2850 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN)) {
2851 ppp->rcomp->decomp_reset(ppp->rc_state);
2852 ppp->rstate &= ~SC_DC_ERROR;
2855 if (ppp->xc_state && (ppp->xstate & SC_COMP_RUN))
2856 ppp->xcomp->comp_reset(ppp->xc_state);
2862 /* Free up compression resources. */
2864 ppp_ccp_closed(struct ppp *ppp)
2866 void *xstate, *rstate;
2867 struct compressor *xcomp, *rcomp;
2870 ppp->flags &= ~(SC_CCP_OPEN | SC_CCP_UP);
2873 xstate = ppp->xc_state;
2874 ppp->xc_state = NULL;
2877 rstate = ppp->rc_state;
2878 ppp->rc_state = NULL;
2882 xcomp->comp_free(xstate);
2883 module_put(xcomp->owner);
2886 rcomp->decomp_free(rstate);
2887 module_put(rcomp->owner);
2891 /* List of compressors. */
2892 static LIST_HEAD(compressor_list);
2893 static DEFINE_SPINLOCK(compressor_list_lock);
2895 struct compressor_entry {
2896 struct list_head list;
2897 struct compressor *comp;
2900 static struct compressor_entry *
2901 find_comp_entry(int proto)
2903 struct compressor_entry *ce;
2905 list_for_each_entry(ce, &compressor_list, list) {
2906 if (ce->comp->compress_proto == proto)
2912 /* Register a compressor */
2914 ppp_register_compressor(struct compressor *cp)
2916 struct compressor_entry *ce;
2918 spin_lock(&compressor_list_lock);
2920 if (find_comp_entry(cp->compress_proto))
2923 ce = kmalloc(sizeof(struct compressor_entry), GFP_ATOMIC);
2928 list_add(&ce->list, &compressor_list);
2930 spin_unlock(&compressor_list_lock);
2934 /* Unregister a compressor */
2936 ppp_unregister_compressor(struct compressor *cp)
2938 struct compressor_entry *ce;
2940 spin_lock(&compressor_list_lock);
2941 ce = find_comp_entry(cp->compress_proto);
2942 if (ce && ce->comp == cp) {
2943 list_del(&ce->list);
2946 spin_unlock(&compressor_list_lock);
2949 /* Find a compressor. */
2950 static struct compressor *
2951 find_compressor(int type)
2953 struct compressor_entry *ce;
2954 struct compressor *cp = NULL;
2956 spin_lock(&compressor_list_lock);
2957 ce = find_comp_entry(type);
2960 if (!try_module_get(cp->owner))
2963 spin_unlock(&compressor_list_lock);
2968 * Miscelleneous stuff.
2972 ppp_get_stats(struct ppp *ppp, struct ppp_stats *st)
2974 struct slcompress *vj = ppp->vj;
2976 memset(st, 0, sizeof(*st));
2977 st->p.ppp_ipackets = ppp->stats64.rx_packets;
2978 st->p.ppp_ierrors = ppp->dev->stats.rx_errors;
2979 st->p.ppp_ibytes = ppp->stats64.rx_bytes;
2980 st->p.ppp_opackets = ppp->stats64.tx_packets;
2981 st->p.ppp_oerrors = ppp->dev->stats.tx_errors;
2982 st->p.ppp_obytes = ppp->stats64.tx_bytes;
2985 st->vj.vjs_packets = vj->sls_o_compressed + vj->sls_o_uncompressed;
2986 st->vj.vjs_compressed = vj->sls_o_compressed;
2987 st->vj.vjs_searches = vj->sls_o_searches;
2988 st->vj.vjs_misses = vj->sls_o_misses;
2989 st->vj.vjs_errorin = vj->sls_i_error;
2990 st->vj.vjs_tossed = vj->sls_i_tossed;
2991 st->vj.vjs_uncompressedin = vj->sls_i_uncompressed;
2992 st->vj.vjs_compressedin = vj->sls_i_compressed;
2996 * Stuff for handling the lists of ppp units and channels
2997 * and for initialization.
3001 * Create a new ppp interface unit. Fails if it can't allocate memory
3002 * or if there is already a unit with the requested number.
3003 * unit == -1 means allocate a new number.
3005 static int ppp_create_interface(struct net *net, struct file *file, int *unit)
3007 struct ppp_config conf = {
3010 .ifname_is_set = false,
3012 struct net_device *dev;
3016 dev = alloc_netdev(sizeof(struct ppp), "", NET_NAME_ENUM, ppp_setup);
3021 dev_net_set(dev, net);
3022 dev->rtnl_link_ops = &ppp_link_ops;
3026 err = ppp_dev_configure(net, dev, &conf);
3029 ppp = netdev_priv(dev);
3030 *unit = ppp->file.index;
3044 * Initialize a ppp_file structure.
3047 init_ppp_file(struct ppp_file *pf, int kind)
3050 skb_queue_head_init(&pf->xq);
3051 skb_queue_head_init(&pf->rq);
3052 refcount_set(&pf->refcnt, 1);
3053 init_waitqueue_head(&pf->rwait);
3057 * Free the memory used by a ppp unit. This is only called once
3058 * there are no channels connected to the unit and no file structs
3059 * that reference the unit.
3061 static void ppp_destroy_interface(struct ppp *ppp)
3063 atomic_dec(&ppp_unit_count);
3065 if (!ppp->file.dead || ppp->n_channels) {
3066 /* "can't happen" */
3067 netdev_err(ppp->dev, "ppp: destroying ppp struct %p "
3068 "but dead=%d n_channels=%d !\n",
3069 ppp, ppp->file.dead, ppp->n_channels);
3073 ppp_ccp_closed(ppp);
3078 skb_queue_purge(&ppp->file.xq);
3079 skb_queue_purge(&ppp->file.rq);
3080 #ifdef CONFIG_PPP_MULTILINK
3081 skb_queue_purge(&ppp->mrq);
3082 #endif /* CONFIG_PPP_MULTILINK */
3083 #ifdef CONFIG_PPP_FILTER
3084 if (ppp->pass_filter) {
3085 bpf_prog_destroy(ppp->pass_filter);
3086 ppp->pass_filter = NULL;
3089 if (ppp->active_filter) {
3090 bpf_prog_destroy(ppp->active_filter);
3091 ppp->active_filter = NULL;
3093 #endif /* CONFIG_PPP_FILTER */
3095 kfree_skb(ppp->xmit_pending);
3096 free_percpu(ppp->xmit_recursion);
3098 free_netdev(ppp->dev);
3102 * Locate an existing ppp unit.
3103 * The caller should have locked the all_ppp_mutex.
3106 ppp_find_unit(struct ppp_net *pn, int unit)
3108 return unit_find(&pn->units_idr, unit);
3112 * Locate an existing ppp channel.
3113 * The caller should have locked the all_channels_lock.
3114 * First we look in the new_channels list, then in the
3115 * all_channels list. If found in the new_channels list,
3116 * we move it to the all_channels list. This is for speed
3117 * when we have a lot of channels in use.
3119 static struct channel *
3120 ppp_find_channel(struct ppp_net *pn, int unit)
3122 struct channel *pch;
3124 list_for_each_entry(pch, &pn->new_channels, list) {
3125 if (pch->file.index == unit) {
3126 list_move(&pch->list, &pn->all_channels);
3131 list_for_each_entry(pch, &pn->all_channels, list) {
3132 if (pch->file.index == unit)
3140 * Connect a PPP channel to a PPP interface unit.
3143 ppp_connect_channel(struct channel *pch, int unit)
3150 pn = ppp_pernet(pch->chan_net);
3152 mutex_lock(&pn->all_ppp_mutex);
3153 ppp = ppp_find_unit(pn, unit);
3156 write_lock_bh(&pch->upl);
3162 spin_lock_bh(&pch->downl);
3164 /* Don't connect unregistered channels */
3165 spin_unlock_bh(&pch->downl);
3170 spin_unlock_bh(&pch->downl);
3171 if (pch->file.hdrlen > ppp->file.hdrlen)
3172 ppp->file.hdrlen = pch->file.hdrlen;
3173 hdrlen = pch->file.hdrlen + 2; /* for protocol bytes */
3174 if (hdrlen > ppp->dev->hard_header_len)
3175 ppp->dev->hard_header_len = hdrlen;
3176 list_add_tail(&pch->clist, &ppp->channels);
3179 refcount_inc(&ppp->file.refcnt);
3184 write_unlock_bh(&pch->upl);
3186 mutex_unlock(&pn->all_ppp_mutex);
3191 * Disconnect a channel from its ppp unit.
3194 ppp_disconnect_channel(struct channel *pch)
3199 write_lock_bh(&pch->upl);
3202 write_unlock_bh(&pch->upl);
3204 /* remove it from the ppp unit's list */
3206 list_del(&pch->clist);
3207 if (--ppp->n_channels == 0)
3208 wake_up_interruptible(&ppp->file.rwait);
3210 if (refcount_dec_and_test(&ppp->file.refcnt))
3211 ppp_destroy_interface(ppp);
3218 * Free up the resources used by a ppp channel.
3220 static void ppp_destroy_channel(struct channel *pch)
3222 put_net(pch->chan_net);
3223 pch->chan_net = NULL;
3225 atomic_dec(&channel_count);
3227 if (!pch->file.dead) {
3228 /* "can't happen" */
3229 pr_err("ppp: destroying undead channel %p !\n", pch);
3232 skb_queue_purge(&pch->file.xq);
3233 skb_queue_purge(&pch->file.rq);
3237 static void __exit ppp_cleanup(void)
3239 /* should never happen */
3240 if (atomic_read(&ppp_unit_count) || atomic_read(&channel_count))
3241 pr_err("PPP: removing module but units remain!\n");
3242 rtnl_link_unregister(&ppp_link_ops);
3243 unregister_chrdev(PPP_MAJOR, "ppp");
3244 device_destroy(ppp_class, MKDEV(PPP_MAJOR, 0));
3245 class_destroy(ppp_class);
3246 unregister_pernet_device(&ppp_net_ops);
3250 * Units handling. Caller must protect concurrent access
3251 * by holding all_ppp_mutex
3254 /* associate pointer with specified number */
3255 static int unit_set(struct idr *p, void *ptr, int n)
3259 unit = idr_alloc(p, ptr, n, n + 1, GFP_KERNEL);
3260 if (unit == -ENOSPC)
3265 /* get new free unit number and associate pointer with it */
3266 static int unit_get(struct idr *p, void *ptr, int min)
3268 return idr_alloc(p, ptr, min, 0, GFP_KERNEL);
3271 /* put unit number back to a pool */
3272 static void unit_put(struct idr *p, int n)
3277 /* get pointer associated with the number */
3278 static void *unit_find(struct idr *p, int n)
3280 return idr_find(p, n);
3283 /* Module/initialization stuff */
3285 module_init(ppp_init);
3286 module_exit(ppp_cleanup);
3288 EXPORT_SYMBOL(ppp_register_net_channel);
3289 EXPORT_SYMBOL(ppp_register_channel);
3290 EXPORT_SYMBOL(ppp_unregister_channel);
3291 EXPORT_SYMBOL(ppp_channel_index);
3292 EXPORT_SYMBOL(ppp_unit_number);
3293 EXPORT_SYMBOL(ppp_dev_name);
3294 EXPORT_SYMBOL(ppp_input);
3295 EXPORT_SYMBOL(ppp_input_error);
3296 EXPORT_SYMBOL(ppp_output_wakeup);
3297 EXPORT_SYMBOL(ppp_register_compressor);
3298 EXPORT_SYMBOL(ppp_unregister_compressor);
3299 MODULE_LICENSE("GPL");
3300 MODULE_ALIAS_CHARDEV(PPP_MAJOR, 0);
3301 MODULE_ALIAS_RTNL_LINK("ppp");
3302 MODULE_ALIAS("devname:ppp");