Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * Generic PPP layer for Linux.
4 *
5 * Copyright 1999-2002 Paul Mackerras.
6 *
7 * The generic PPP layer handles the PPP network interfaces, the
8 * /dev/ppp device, packet and VJ compression, and multilink.
9 * It talks to PPP `channels' via the interface defined in
10 * include/linux/ppp_channel.h. Channels provide the basic means for
11 * sending and receiving PPP frames on some kind of communications
12 * channel.
13 *
14 * Part of the code in this driver was inspired by the old async-only
15 * PPP driver, written by Michael Callahan and Al Longyear, and
16 * subsequently hacked by Paul Mackerras.
17 *
18 * ==FILEVERSION 20041108==
19 */
20
21#include <linux/module.h>
22#include <linux/kernel.h>
23#include <linux/sched/signal.h>
24#include <linux/kmod.h>
25#include <linux/init.h>
26#include <linux/list.h>
27#include <linux/idr.h>
28#include <linux/netdevice.h>
29#include <linux/poll.h>
30#include <linux/ppp_defs.h>
31#include <linux/filter.h>
32#include <linux/ppp-ioctl.h>
33#include <linux/ppp_channel.h>
34#include <linux/ppp-comp.h>
35#include <linux/skbuff.h>
36#include <linux/rtnetlink.h>
37#include <linux/if_arp.h>
38#include <linux/ip.h>
39#include <linux/tcp.h>
40#include <linux/spinlock.h>
41#include <linux/rwsem.h>
42#include <linux/stddef.h>
43#include <linux/device.h>
44#include <linux/mutex.h>
45#include <linux/slab.h>
46#include <linux/file.h>
47#include <asm/unaligned.h>
48#include <net/slhc_vj.h>
49#include <linux/atomic.h>
50#include <linux/refcount.h>
51
52#include <linux/nsproxy.h>
53#include <net/net_namespace.h>
54#include <net/netns/generic.h>
55
56#define PPP_VERSION "2.4.2"
57
58/*
59 * Network protocols we support.
60 */
61#define NP_IP 0 /* Internet Protocol V4 */
62#define NP_IPV6 1 /* Internet Protocol V6 */
63#define NP_IPX 2 /* IPX protocol */
64#define NP_AT 3 /* Appletalk protocol */
65#define NP_MPLS_UC 4 /* MPLS unicast */
66#define NP_MPLS_MC 5 /* MPLS multicast */
67#define NUM_NP 6 /* Number of NPs. */
68
69#define MPHDRLEN 6 /* multilink protocol header length */
70#define MPHDRLEN_SSN 4 /* ditto with short sequence numbers */
71
72#define PPP_PROTO_LEN 2
73
74/*
75 * An instance of /dev/ppp can be associated with either a ppp
76 * interface unit or a ppp channel. In both cases, file->private_data
77 * points to one of these.
78 */
79struct ppp_file {
80 enum {
81 INTERFACE=1, CHANNEL
82 } kind;
83 struct sk_buff_head xq; /* pppd transmit queue */
84 struct sk_buff_head rq; /* receive queue for pppd */
85 wait_queue_head_t rwait; /* for poll on reading /dev/ppp */
86 refcount_t refcnt; /* # refs (incl /dev/ppp attached) */
87 int hdrlen; /* space to leave for headers */
88 int index; /* interface unit / channel number */
89 int dead; /* unit/channel has been shut down */
90};
91
92#define PF_TO_X(pf, X) container_of(pf, X, file)
93
94#define PF_TO_PPP(pf) PF_TO_X(pf, struct ppp)
95#define PF_TO_CHANNEL(pf) PF_TO_X(pf, struct channel)
96
97/*
98 * Data structure to hold primary network stats for which
99 * we want to use 64 bit storage. Other network stats
100 * are stored in dev->stats of the ppp strucute.
101 */
102struct ppp_link_stats {
103 u64 rx_packets;
104 u64 tx_packets;
105 u64 rx_bytes;
106 u64 tx_bytes;
107};
108
109/*
110 * Data structure describing one ppp unit.
111 * A ppp unit corresponds to a ppp network interface device
112 * and represents a multilink bundle.
113 * It can have 0 or more ppp channels connected to it.
114 */
115struct ppp {
116 struct ppp_file file; /* stuff for read/write/poll 0 */
117 struct file *owner; /* file that owns this unit 48 */
118 struct list_head channels; /* list of attached channels 4c */
119 int n_channels; /* how many channels are attached 54 */
120 spinlock_t rlock; /* lock for receive side 58 */
121 spinlock_t wlock; /* lock for transmit side 5c */
122 int __percpu *xmit_recursion; /* xmit recursion detect */
123 int mru; /* max receive unit 60 */
124 unsigned int flags; /* control bits 64 */
125 unsigned int xstate; /* transmit state bits 68 */
126 unsigned int rstate; /* receive state bits 6c */
127 int debug; /* debug flags 70 */
128 struct slcompress *vj; /* state for VJ header compression */
129 enum NPmode npmode[NUM_NP]; /* what to do with each net proto 78 */
130 struct sk_buff *xmit_pending; /* a packet ready to go out 88 */
131 struct compressor *xcomp; /* transmit packet compressor 8c */
132 void *xc_state; /* its internal state 90 */
133 struct compressor *rcomp; /* receive decompressor 94 */
134 void *rc_state; /* its internal state 98 */
135 unsigned long last_xmit; /* jiffies when last pkt sent 9c */
136 unsigned long last_recv; /* jiffies when last pkt rcvd a0 */
137 struct net_device *dev; /* network interface device a4 */
138 int closing; /* is device closing down? a8 */
139#ifdef CONFIG_PPP_MULTILINK
140 int nxchan; /* next channel to send something on */
141 u32 nxseq; /* next sequence number to send */
142 int mrru; /* MP: max reconst. receive unit */
143 u32 nextseq; /* MP: seq no of next packet */
144 u32 minseq; /* MP: min of most recent seqnos */
145 struct sk_buff_head mrq; /* MP: receive reconstruction queue */
146#endif /* CONFIG_PPP_MULTILINK */
147#ifdef CONFIG_PPP_FILTER
148 struct bpf_prog *pass_filter; /* filter for packets to pass */
149 struct bpf_prog *active_filter; /* filter for pkts to reset idle */
150#endif /* CONFIG_PPP_FILTER */
151 struct net *ppp_net; /* the net we belong to */
152 struct ppp_link_stats stats64; /* 64 bit network stats */
153};
154
155/*
156 * Bits in flags: SC_NO_TCP_CCID, SC_CCP_OPEN, SC_CCP_UP, SC_LOOP_TRAFFIC,
157 * SC_MULTILINK, SC_MP_SHORTSEQ, SC_MP_XSHORTSEQ, SC_COMP_TCP, SC_REJ_COMP_TCP,
158 * SC_MUST_COMP
159 * Bits in rstate: SC_DECOMP_RUN, SC_DC_ERROR, SC_DC_FERROR.
160 * Bits in xstate: SC_COMP_RUN
161 */
162#define SC_FLAG_BITS (SC_NO_TCP_CCID|SC_CCP_OPEN|SC_CCP_UP|SC_LOOP_TRAFFIC \
163 |SC_MULTILINK|SC_MP_SHORTSEQ|SC_MP_XSHORTSEQ \
164 |SC_COMP_TCP|SC_REJ_COMP_TCP|SC_MUST_COMP)
165
166/*
167 * Private data structure for each channel.
168 * This includes the data structure used for multilink.
169 */
170struct channel {
171 struct ppp_file file; /* stuff for read/write/poll */
172 struct list_head list; /* link in all/new_channels list */
173 struct ppp_channel *chan; /* public channel data structure */
174 struct rw_semaphore chan_sem; /* protects `chan' during chan ioctl */
175 spinlock_t downl; /* protects `chan', file.xq dequeue */
176 struct ppp *ppp; /* ppp unit we're connected to */
177 struct net *chan_net; /* the net channel belongs to */
178 netns_tracker ns_tracker;
179 struct list_head clist; /* link in list of channels per unit */
180 rwlock_t upl; /* protects `ppp' and 'bridge' */
181 struct channel __rcu *bridge; /* "bridged" ppp channel */
182#ifdef CONFIG_PPP_MULTILINK
183 u8 avail; /* flag used in multilink stuff */
184 u8 had_frag; /* >= 1 fragments have been sent */
185 u32 lastseq; /* MP: last sequence # received */
186 int speed; /* speed of the corresponding ppp channel*/
187#endif /* CONFIG_PPP_MULTILINK */
188};
189
190struct ppp_config {
191 struct file *file;
192 s32 unit;
193 bool ifname_is_set;
194};
195
196/*
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 ->
202 * channel.downl.
203 */
204
205static DEFINE_MUTEX(ppp_mutex);
206static atomic_t ppp_unit_count = ATOMIC_INIT(0);
207static atomic_t channel_count = ATOMIC_INIT(0);
208
209/* per-net private data for this module */
210static unsigned int ppp_net_id __read_mostly;
211struct ppp_net {
212 /* units to ppp mapping */
213 struct idr units_idr;
214
215 /*
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.
219 */
220 struct mutex all_ppp_mutex;
221
222 /* channels */
223 struct list_head all_channels;
224 struct list_head new_channels;
225 int last_channel_index;
226
227 /*
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.
231 */
232 spinlock_t all_channels_lock;
233};
234
235/* Get the PPP protocol number from a skb */
236#define PPP_PROTO(skb) get_unaligned_be16((skb)->data)
237
238/* We limit the length of ppp->file.rq to this (arbitrary) value */
239#define PPP_MAX_RQLEN 32
240
241/*
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.
246 */
247#define PPP_MP_MAX_QLEN 128
248
249/* Multilink header bits. */
250#define B 0x80 /* this fragment begins a packet */
251#define E 0x40 /* this fragment ends a packet */
252
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)
256
257/* Prototypes. */
258static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
259 struct file *file, unsigned int cmd, unsigned long arg);
260static void ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb);
261static void ppp_send_frame(struct ppp *ppp, struct sk_buff *skb);
262static void ppp_push(struct ppp *ppp);
263static void ppp_channel_push(struct channel *pch);
264static void ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb,
265 struct channel *pch);
266static void ppp_receive_error(struct ppp *ppp);
267static void ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb);
268static struct sk_buff *ppp_decompress_frame(struct ppp *ppp,
269 struct sk_buff *skb);
270#ifdef CONFIG_PPP_MULTILINK
271static void ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb,
272 struct channel *pch);
273static void ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb);
274static struct sk_buff *ppp_mp_reconstruct(struct ppp *ppp);
275static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb);
276#endif /* CONFIG_PPP_MULTILINK */
277static int ppp_set_compress(struct ppp *ppp, struct ppp_option_data *data);
278static void ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound);
279static void ppp_ccp_closed(struct ppp *ppp);
280static struct compressor *find_compressor(int type);
281static void ppp_get_stats(struct ppp *ppp, struct ppp_stats *st);
282static int ppp_create_interface(struct net *net, struct file *file, int *unit);
283static void init_ppp_file(struct ppp_file *pf, int kind);
284static void ppp_destroy_interface(struct ppp *ppp);
285static struct ppp *ppp_find_unit(struct ppp_net *pn, int unit);
286static struct channel *ppp_find_channel(struct ppp_net *pn, int unit);
287static int ppp_connect_channel(struct channel *pch, int unit);
288static int ppp_disconnect_channel(struct channel *pch);
289static void ppp_destroy_channel(struct channel *pch);
290static int unit_get(struct idr *p, void *ptr, int min);
291static int unit_set(struct idr *p, void *ptr, int n);
292static void unit_put(struct idr *p, int n);
293static void *unit_find(struct idr *p, int n);
294static void ppp_setup(struct net_device *dev);
295
296static const struct net_device_ops ppp_netdev_ops;
297
298static struct class *ppp_class;
299
300/* per net-namespace data */
301static inline struct ppp_net *ppp_pernet(struct net *net)
302{
303 return net_generic(net, ppp_net_id);
304}
305
306/* Translates a PPP protocol number to a NP index (NP == network protocol) */
307static inline int proto_to_npindex(int proto)
308{
309 switch (proto) {
310 case PPP_IP:
311 return NP_IP;
312 case PPP_IPV6:
313 return NP_IPV6;
314 case PPP_IPX:
315 return NP_IPX;
316 case PPP_AT:
317 return NP_AT;
318 case PPP_MPLS_UC:
319 return NP_MPLS_UC;
320 case PPP_MPLS_MC:
321 return NP_MPLS_MC;
322 }
323 return -EINVAL;
324}
325
326/* Translates an NP index into a PPP protocol number */
327static const int npindex_to_proto[NUM_NP] = {
328 PPP_IP,
329 PPP_IPV6,
330 PPP_IPX,
331 PPP_AT,
332 PPP_MPLS_UC,
333 PPP_MPLS_MC,
334};
335
336/* Translates an ethertype into an NP index */
337static inline int ethertype_to_npindex(int ethertype)
338{
339 switch (ethertype) {
340 case ETH_P_IP:
341 return NP_IP;
342 case ETH_P_IPV6:
343 return NP_IPV6;
344 case ETH_P_IPX:
345 return NP_IPX;
346 case ETH_P_PPPTALK:
347 case ETH_P_ATALK:
348 return NP_AT;
349 case ETH_P_MPLS_UC:
350 return NP_MPLS_UC;
351 case ETH_P_MPLS_MC:
352 return NP_MPLS_MC;
353 }
354 return -1;
355}
356
357/* Translates an NP index into an ethertype */
358static const int npindex_to_ethertype[NUM_NP] = {
359 ETH_P_IP,
360 ETH_P_IPV6,
361 ETH_P_IPX,
362 ETH_P_PPPTALK,
363 ETH_P_MPLS_UC,
364 ETH_P_MPLS_MC,
365};
366
367/*
368 * Locking shorthand.
369 */
370#define ppp_xmit_lock(ppp) spin_lock_bh(&(ppp)->wlock)
371#define ppp_xmit_unlock(ppp) spin_unlock_bh(&(ppp)->wlock)
372#define ppp_recv_lock(ppp) spin_lock_bh(&(ppp)->rlock)
373#define ppp_recv_unlock(ppp) spin_unlock_bh(&(ppp)->rlock)
374#define ppp_lock(ppp) do { ppp_xmit_lock(ppp); \
375 ppp_recv_lock(ppp); } while (0)
376#define ppp_unlock(ppp) do { ppp_recv_unlock(ppp); \
377 ppp_xmit_unlock(ppp); } while (0)
378
379/*
380 * /dev/ppp device routines.
381 * The /dev/ppp device is used by pppd to control the ppp unit.
382 * It supports the read, write, ioctl and poll functions.
383 * Open instances of /dev/ppp can be in one of three states:
384 * unattached, attached to a ppp unit, or attached to a ppp channel.
385 */
386static int ppp_open(struct inode *inode, struct file *file)
387{
388 /*
389 * This could (should?) be enforced by the permissions on /dev/ppp.
390 */
391 if (!ns_capable(file->f_cred->user_ns, CAP_NET_ADMIN))
392 return -EPERM;
393 return 0;
394}
395
396static int ppp_release(struct inode *unused, struct file *file)
397{
398 struct ppp_file *pf = file->private_data;
399 struct ppp *ppp;
400
401 if (pf) {
402 file->private_data = NULL;
403 if (pf->kind == INTERFACE) {
404 ppp = PF_TO_PPP(pf);
405 rtnl_lock();
406 if (file == ppp->owner)
407 unregister_netdevice(ppp->dev);
408 rtnl_unlock();
409 }
410 if (refcount_dec_and_test(&pf->refcnt)) {
411 switch (pf->kind) {
412 case INTERFACE:
413 ppp_destroy_interface(PF_TO_PPP(pf));
414 break;
415 case CHANNEL:
416 ppp_destroy_channel(PF_TO_CHANNEL(pf));
417 break;
418 }
419 }
420 }
421 return 0;
422}
423
424static ssize_t ppp_read(struct file *file, char __user *buf,
425 size_t count, loff_t *ppos)
426{
427 struct ppp_file *pf = file->private_data;
428 DECLARE_WAITQUEUE(wait, current);
429 ssize_t ret;
430 struct sk_buff *skb = NULL;
431 struct iovec iov;
432 struct iov_iter to;
433
434 ret = count;
435
436 if (!pf)
437 return -ENXIO;
438 add_wait_queue(&pf->rwait, &wait);
439 for (;;) {
440 set_current_state(TASK_INTERRUPTIBLE);
441 skb = skb_dequeue(&pf->rq);
442 if (skb)
443 break;
444 ret = 0;
445 if (pf->dead)
446 break;
447 if (pf->kind == INTERFACE) {
448 /*
449 * Return 0 (EOF) on an interface that has no
450 * channels connected, unless it is looping
451 * network traffic (demand mode).
452 */
453 struct ppp *ppp = PF_TO_PPP(pf);
454
455 ppp_recv_lock(ppp);
456 if (ppp->n_channels == 0 &&
457 (ppp->flags & SC_LOOP_TRAFFIC) == 0) {
458 ppp_recv_unlock(ppp);
459 break;
460 }
461 ppp_recv_unlock(ppp);
462 }
463 ret = -EAGAIN;
464 if (file->f_flags & O_NONBLOCK)
465 break;
466 ret = -ERESTARTSYS;
467 if (signal_pending(current))
468 break;
469 schedule();
470 }
471 set_current_state(TASK_RUNNING);
472 remove_wait_queue(&pf->rwait, &wait);
473
474 if (!skb)
475 goto out;
476
477 ret = -EOVERFLOW;
478 if (skb->len > count)
479 goto outf;
480 ret = -EFAULT;
481 iov.iov_base = buf;
482 iov.iov_len = count;
483 iov_iter_init(&to, ITER_DEST, &iov, 1, count);
484 if (skb_copy_datagram_iter(skb, 0, &to, skb->len))
485 goto outf;
486 ret = skb->len;
487
488 outf:
489 kfree_skb(skb);
490 out:
491 return ret;
492}
493
494static ssize_t ppp_write(struct file *file, const char __user *buf,
495 size_t count, loff_t *ppos)
496{
497 struct ppp_file *pf = file->private_data;
498 struct sk_buff *skb;
499 ssize_t ret;
500
501 if (!pf)
502 return -ENXIO;
503 /* All PPP packets should start with the 2-byte protocol */
504 if (count < PPP_PROTO_LEN)
505 return -EINVAL;
506 ret = -ENOMEM;
507 skb = alloc_skb(count + pf->hdrlen, GFP_KERNEL);
508 if (!skb)
509 goto out;
510 skb_reserve(skb, pf->hdrlen);
511 ret = -EFAULT;
512 if (copy_from_user(skb_put(skb, count), buf, count)) {
513 kfree_skb(skb);
514 goto out;
515 }
516
517 switch (pf->kind) {
518 case INTERFACE:
519 ppp_xmit_process(PF_TO_PPP(pf), skb);
520 break;
521 case CHANNEL:
522 skb_queue_tail(&pf->xq, skb);
523 ppp_channel_push(PF_TO_CHANNEL(pf));
524 break;
525 }
526
527 ret = count;
528
529 out:
530 return ret;
531}
532
533/* No kernel lock - fine */
534static __poll_t ppp_poll(struct file *file, poll_table *wait)
535{
536 struct ppp_file *pf = file->private_data;
537 __poll_t mask;
538
539 if (!pf)
540 return 0;
541 poll_wait(file, &pf->rwait, wait);
542 mask = EPOLLOUT | EPOLLWRNORM;
543 if (skb_peek(&pf->rq))
544 mask |= EPOLLIN | EPOLLRDNORM;
545 if (pf->dead)
546 mask |= EPOLLHUP;
547 else if (pf->kind == INTERFACE) {
548 /* see comment in ppp_read */
549 struct ppp *ppp = PF_TO_PPP(pf);
550
551 ppp_recv_lock(ppp);
552 if (ppp->n_channels == 0 &&
553 (ppp->flags & SC_LOOP_TRAFFIC) == 0)
554 mask |= EPOLLIN | EPOLLRDNORM;
555 ppp_recv_unlock(ppp);
556 }
557
558 return mask;
559}
560
561#ifdef CONFIG_PPP_FILTER
562static struct bpf_prog *get_filter(struct sock_fprog *uprog)
563{
564 struct sock_fprog_kern fprog;
565 struct bpf_prog *res = NULL;
566 int err;
567
568 if (!uprog->len)
569 return NULL;
570
571 /* uprog->len is unsigned short, so no overflow here */
572 fprog.len = uprog->len;
573 fprog.filter = memdup_array_user(uprog->filter,
574 uprog->len, sizeof(struct sock_filter));
575 if (IS_ERR(fprog.filter))
576 return ERR_CAST(fprog.filter);
577
578 err = bpf_prog_create(&res, &fprog);
579 kfree(fprog.filter);
580
581 return err ? ERR_PTR(err) : res;
582}
583
584static struct bpf_prog *ppp_get_filter(struct sock_fprog __user *p)
585{
586 struct sock_fprog uprog;
587
588 if (copy_from_user(&uprog, p, sizeof(struct sock_fprog)))
589 return ERR_PTR(-EFAULT);
590 return get_filter(&uprog);
591}
592
593#ifdef CONFIG_COMPAT
594struct sock_fprog32 {
595 unsigned short len;
596 compat_caddr_t filter;
597};
598
599#define PPPIOCSPASS32 _IOW('t', 71, struct sock_fprog32)
600#define PPPIOCSACTIVE32 _IOW('t', 70, struct sock_fprog32)
601
602static struct bpf_prog *compat_ppp_get_filter(struct sock_fprog32 __user *p)
603{
604 struct sock_fprog32 uprog32;
605 struct sock_fprog uprog;
606
607 if (copy_from_user(&uprog32, p, sizeof(struct sock_fprog32)))
608 return ERR_PTR(-EFAULT);
609 uprog.len = uprog32.len;
610 uprog.filter = compat_ptr(uprog32.filter);
611 return get_filter(&uprog);
612}
613#endif
614#endif
615
616/* Bridge one PPP channel to another.
617 * When two channels are bridged, ppp_input on one channel is redirected to
618 * the other's ops->start_xmit handler.
619 * In order to safely bridge channels we must reject channels which are already
620 * part of a bridge instance, or which form part of an existing unit.
621 * Once successfully bridged, each channel holds a reference on the other
622 * to prevent it being freed while the bridge is extant.
623 */
624static int ppp_bridge_channels(struct channel *pch, struct channel *pchb)
625{
626 write_lock_bh(&pch->upl);
627 if (pch->ppp ||
628 rcu_dereference_protected(pch->bridge, lockdep_is_held(&pch->upl))) {
629 write_unlock_bh(&pch->upl);
630 return -EALREADY;
631 }
632 refcount_inc(&pchb->file.refcnt);
633 rcu_assign_pointer(pch->bridge, pchb);
634 write_unlock_bh(&pch->upl);
635
636 write_lock_bh(&pchb->upl);
637 if (pchb->ppp ||
638 rcu_dereference_protected(pchb->bridge, lockdep_is_held(&pchb->upl))) {
639 write_unlock_bh(&pchb->upl);
640 goto err_unset;
641 }
642 refcount_inc(&pch->file.refcnt);
643 rcu_assign_pointer(pchb->bridge, pch);
644 write_unlock_bh(&pchb->upl);
645
646 return 0;
647
648err_unset:
649 write_lock_bh(&pch->upl);
650 /* Re-read pch->bridge with upl held in case it was modified concurrently */
651 pchb = rcu_dereference_protected(pch->bridge, lockdep_is_held(&pch->upl));
652 RCU_INIT_POINTER(pch->bridge, NULL);
653 write_unlock_bh(&pch->upl);
654 synchronize_rcu();
655
656 if (pchb)
657 if (refcount_dec_and_test(&pchb->file.refcnt))
658 ppp_destroy_channel(pchb);
659
660 return -EALREADY;
661}
662
663static int ppp_unbridge_channels(struct channel *pch)
664{
665 struct channel *pchb, *pchbb;
666
667 write_lock_bh(&pch->upl);
668 pchb = rcu_dereference_protected(pch->bridge, lockdep_is_held(&pch->upl));
669 if (!pchb) {
670 write_unlock_bh(&pch->upl);
671 return -EINVAL;
672 }
673 RCU_INIT_POINTER(pch->bridge, NULL);
674 write_unlock_bh(&pch->upl);
675
676 /* Only modify pchb if phcb->bridge points back to pch.
677 * If not, it implies that there has been a race unbridging (and possibly
678 * even rebridging) pchb. We should leave pchb alone to avoid either a
679 * refcount underflow, or breaking another established bridge instance.
680 */
681 write_lock_bh(&pchb->upl);
682 pchbb = rcu_dereference_protected(pchb->bridge, lockdep_is_held(&pchb->upl));
683 if (pchbb == pch)
684 RCU_INIT_POINTER(pchb->bridge, NULL);
685 write_unlock_bh(&pchb->upl);
686
687 synchronize_rcu();
688
689 if (pchbb == pch)
690 if (refcount_dec_and_test(&pch->file.refcnt))
691 ppp_destroy_channel(pch);
692
693 if (refcount_dec_and_test(&pchb->file.refcnt))
694 ppp_destroy_channel(pchb);
695
696 return 0;
697}
698
699static long ppp_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
700{
701 struct ppp_file *pf;
702 struct ppp *ppp;
703 int err = -EFAULT, val, val2, i;
704 struct ppp_idle32 idle32;
705 struct ppp_idle64 idle64;
706 struct npioctl npi;
707 int unit, cflags;
708 struct slcompress *vj;
709 void __user *argp = (void __user *)arg;
710 int __user *p = argp;
711
712 mutex_lock(&ppp_mutex);
713
714 pf = file->private_data;
715 if (!pf) {
716 err = ppp_unattached_ioctl(current->nsproxy->net_ns,
717 pf, file, cmd, arg);
718 goto out;
719 }
720
721 if (cmd == PPPIOCDETACH) {
722 /*
723 * PPPIOCDETACH is no longer supported as it was heavily broken,
724 * and is only known to have been used by pppd older than
725 * ppp-2.4.2 (released November 2003).
726 */
727 pr_warn_once("%s (%d) used obsolete PPPIOCDETACH ioctl\n",
728 current->comm, current->pid);
729 err = -EINVAL;
730 goto out;
731 }
732
733 if (pf->kind == CHANNEL) {
734 struct channel *pch, *pchb;
735 struct ppp_channel *chan;
736 struct ppp_net *pn;
737
738 pch = PF_TO_CHANNEL(pf);
739
740 switch (cmd) {
741 case PPPIOCCONNECT:
742 if (get_user(unit, p))
743 break;
744 err = ppp_connect_channel(pch, unit);
745 break;
746
747 case PPPIOCDISCONN:
748 err = ppp_disconnect_channel(pch);
749 break;
750
751 case PPPIOCBRIDGECHAN:
752 if (get_user(unit, p))
753 break;
754 err = -ENXIO;
755 pn = ppp_pernet(current->nsproxy->net_ns);
756 spin_lock_bh(&pn->all_channels_lock);
757 pchb = ppp_find_channel(pn, unit);
758 /* Hold a reference to prevent pchb being freed while
759 * we establish the bridge.
760 */
761 if (pchb)
762 refcount_inc(&pchb->file.refcnt);
763 spin_unlock_bh(&pn->all_channels_lock);
764 if (!pchb)
765 break;
766 err = ppp_bridge_channels(pch, pchb);
767 /* Drop earlier refcount now bridge establishment is complete */
768 if (refcount_dec_and_test(&pchb->file.refcnt))
769 ppp_destroy_channel(pchb);
770 break;
771
772 case PPPIOCUNBRIDGECHAN:
773 err = ppp_unbridge_channels(pch);
774 break;
775
776 default:
777 down_read(&pch->chan_sem);
778 chan = pch->chan;
779 err = -ENOTTY;
780 if (chan && chan->ops->ioctl)
781 err = chan->ops->ioctl(chan, cmd, arg);
782 up_read(&pch->chan_sem);
783 }
784 goto out;
785 }
786
787 if (pf->kind != INTERFACE) {
788 /* can't happen */
789 pr_err("PPP: not interface or channel??\n");
790 err = -EINVAL;
791 goto out;
792 }
793
794 ppp = PF_TO_PPP(pf);
795 switch (cmd) {
796 case PPPIOCSMRU:
797 if (get_user(val, p))
798 break;
799 ppp->mru = val;
800 err = 0;
801 break;
802
803 case PPPIOCSFLAGS:
804 if (get_user(val, p))
805 break;
806 ppp_lock(ppp);
807 cflags = ppp->flags & ~val;
808#ifdef CONFIG_PPP_MULTILINK
809 if (!(ppp->flags & SC_MULTILINK) && (val & SC_MULTILINK))
810 ppp->nextseq = 0;
811#endif
812 ppp->flags = val & SC_FLAG_BITS;
813 ppp_unlock(ppp);
814 if (cflags & SC_CCP_OPEN)
815 ppp_ccp_closed(ppp);
816 err = 0;
817 break;
818
819 case PPPIOCGFLAGS:
820 val = ppp->flags | ppp->xstate | ppp->rstate;
821 if (put_user(val, p))
822 break;
823 err = 0;
824 break;
825
826 case PPPIOCSCOMPRESS:
827 {
828 struct ppp_option_data data;
829 if (copy_from_user(&data, argp, sizeof(data)))
830 err = -EFAULT;
831 else
832 err = ppp_set_compress(ppp, &data);
833 break;
834 }
835 case PPPIOCGUNIT:
836 if (put_user(ppp->file.index, p))
837 break;
838 err = 0;
839 break;
840
841 case PPPIOCSDEBUG:
842 if (get_user(val, p))
843 break;
844 ppp->debug = val;
845 err = 0;
846 break;
847
848 case PPPIOCGDEBUG:
849 if (put_user(ppp->debug, p))
850 break;
851 err = 0;
852 break;
853
854 case PPPIOCGIDLE32:
855 idle32.xmit_idle = (jiffies - ppp->last_xmit) / HZ;
856 idle32.recv_idle = (jiffies - ppp->last_recv) / HZ;
857 if (copy_to_user(argp, &idle32, sizeof(idle32)))
858 break;
859 err = 0;
860 break;
861
862 case PPPIOCGIDLE64:
863 idle64.xmit_idle = (jiffies - ppp->last_xmit) / HZ;
864 idle64.recv_idle = (jiffies - ppp->last_recv) / HZ;
865 if (copy_to_user(argp, &idle64, sizeof(idle64)))
866 break;
867 err = 0;
868 break;
869
870 case PPPIOCSMAXCID:
871 if (get_user(val, p))
872 break;
873 val2 = 15;
874 if ((val >> 16) != 0) {
875 val2 = val >> 16;
876 val &= 0xffff;
877 }
878 vj = slhc_init(val2+1, val+1);
879 if (IS_ERR(vj)) {
880 err = PTR_ERR(vj);
881 break;
882 }
883 ppp_lock(ppp);
884 if (ppp->vj)
885 slhc_free(ppp->vj);
886 ppp->vj = vj;
887 ppp_unlock(ppp);
888 err = 0;
889 break;
890
891 case PPPIOCGNPMODE:
892 case PPPIOCSNPMODE:
893 if (copy_from_user(&npi, argp, sizeof(npi)))
894 break;
895 err = proto_to_npindex(npi.protocol);
896 if (err < 0)
897 break;
898 i = err;
899 if (cmd == PPPIOCGNPMODE) {
900 err = -EFAULT;
901 npi.mode = ppp->npmode[i];
902 if (copy_to_user(argp, &npi, sizeof(npi)))
903 break;
904 } else {
905 ppp->npmode[i] = npi.mode;
906 /* we may be able to transmit more packets now (??) */
907 netif_wake_queue(ppp->dev);
908 }
909 err = 0;
910 break;
911
912#ifdef CONFIG_PPP_FILTER
913 case PPPIOCSPASS:
914 case PPPIOCSACTIVE:
915 {
916 struct bpf_prog *filter = ppp_get_filter(argp);
917 struct bpf_prog **which;
918
919 if (IS_ERR(filter)) {
920 err = PTR_ERR(filter);
921 break;
922 }
923 if (cmd == PPPIOCSPASS)
924 which = &ppp->pass_filter;
925 else
926 which = &ppp->active_filter;
927 ppp_lock(ppp);
928 if (*which)
929 bpf_prog_destroy(*which);
930 *which = filter;
931 ppp_unlock(ppp);
932 err = 0;
933 break;
934 }
935#endif /* CONFIG_PPP_FILTER */
936
937#ifdef CONFIG_PPP_MULTILINK
938 case PPPIOCSMRRU:
939 if (get_user(val, p))
940 break;
941 ppp_recv_lock(ppp);
942 ppp->mrru = val;
943 ppp_recv_unlock(ppp);
944 err = 0;
945 break;
946#endif /* CONFIG_PPP_MULTILINK */
947
948 default:
949 err = -ENOTTY;
950 }
951
952out:
953 mutex_unlock(&ppp_mutex);
954
955 return err;
956}
957
958#ifdef CONFIG_COMPAT
959struct ppp_option_data32 {
960 compat_uptr_t ptr;
961 u32 length;
962 compat_int_t transmit;
963};
964#define PPPIOCSCOMPRESS32 _IOW('t', 77, struct ppp_option_data32)
965
966static long ppp_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
967{
968 struct ppp_file *pf;
969 int err = -ENOIOCTLCMD;
970 void __user *argp = (void __user *)arg;
971
972 mutex_lock(&ppp_mutex);
973
974 pf = file->private_data;
975 if (pf && pf->kind == INTERFACE) {
976 struct ppp *ppp = PF_TO_PPP(pf);
977 switch (cmd) {
978#ifdef CONFIG_PPP_FILTER
979 case PPPIOCSPASS32:
980 case PPPIOCSACTIVE32:
981 {
982 struct bpf_prog *filter = compat_ppp_get_filter(argp);
983 struct bpf_prog **which;
984
985 if (IS_ERR(filter)) {
986 err = PTR_ERR(filter);
987 break;
988 }
989 if (cmd == PPPIOCSPASS32)
990 which = &ppp->pass_filter;
991 else
992 which = &ppp->active_filter;
993 ppp_lock(ppp);
994 if (*which)
995 bpf_prog_destroy(*which);
996 *which = filter;
997 ppp_unlock(ppp);
998 err = 0;
999 break;
1000 }
1001#endif /* CONFIG_PPP_FILTER */
1002 case PPPIOCSCOMPRESS32:
1003 {
1004 struct ppp_option_data32 data32;
1005 if (copy_from_user(&data32, argp, sizeof(data32))) {
1006 err = -EFAULT;
1007 } else {
1008 struct ppp_option_data data = {
1009 .ptr = compat_ptr(data32.ptr),
1010 .length = data32.length,
1011 .transmit = data32.transmit
1012 };
1013 err = ppp_set_compress(ppp, &data);
1014 }
1015 break;
1016 }
1017 }
1018 }
1019 mutex_unlock(&ppp_mutex);
1020
1021 /* all other commands have compatible arguments */
1022 if (err == -ENOIOCTLCMD)
1023 err = ppp_ioctl(file, cmd, (unsigned long)compat_ptr(arg));
1024
1025 return err;
1026}
1027#endif
1028
1029static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
1030 struct file *file, unsigned int cmd, unsigned long arg)
1031{
1032 int unit, err = -EFAULT;
1033 struct ppp *ppp;
1034 struct channel *chan;
1035 struct ppp_net *pn;
1036 int __user *p = (int __user *)arg;
1037
1038 switch (cmd) {
1039 case PPPIOCNEWUNIT:
1040 /* Create a new ppp unit */
1041 if (get_user(unit, p))
1042 break;
1043 err = ppp_create_interface(net, file, &unit);
1044 if (err < 0)
1045 break;
1046
1047 err = -EFAULT;
1048 if (put_user(unit, p))
1049 break;
1050 err = 0;
1051 break;
1052
1053 case PPPIOCATTACH:
1054 /* Attach to an existing ppp unit */
1055 if (get_user(unit, p))
1056 break;
1057 err = -ENXIO;
1058 pn = ppp_pernet(net);
1059 mutex_lock(&pn->all_ppp_mutex);
1060 ppp = ppp_find_unit(pn, unit);
1061 if (ppp) {
1062 refcount_inc(&ppp->file.refcnt);
1063 file->private_data = &ppp->file;
1064 err = 0;
1065 }
1066 mutex_unlock(&pn->all_ppp_mutex);
1067 break;
1068
1069 case PPPIOCATTCHAN:
1070 if (get_user(unit, p))
1071 break;
1072 err = -ENXIO;
1073 pn = ppp_pernet(net);
1074 spin_lock_bh(&pn->all_channels_lock);
1075 chan = ppp_find_channel(pn, unit);
1076 if (chan) {
1077 refcount_inc(&chan->file.refcnt);
1078 file->private_data = &chan->file;
1079 err = 0;
1080 }
1081 spin_unlock_bh(&pn->all_channels_lock);
1082 break;
1083
1084 default:
1085 err = -ENOTTY;
1086 }
1087
1088 return err;
1089}
1090
1091static const struct file_operations ppp_device_fops = {
1092 .owner = THIS_MODULE,
1093 .read = ppp_read,
1094 .write = ppp_write,
1095 .poll = ppp_poll,
1096 .unlocked_ioctl = ppp_ioctl,
1097#ifdef CONFIG_COMPAT
1098 .compat_ioctl = ppp_compat_ioctl,
1099#endif
1100 .open = ppp_open,
1101 .release = ppp_release,
1102 .llseek = noop_llseek,
1103};
1104
1105static __net_init int ppp_init_net(struct net *net)
1106{
1107 struct ppp_net *pn = net_generic(net, ppp_net_id);
1108
1109 idr_init(&pn->units_idr);
1110 mutex_init(&pn->all_ppp_mutex);
1111
1112 INIT_LIST_HEAD(&pn->all_channels);
1113 INIT_LIST_HEAD(&pn->new_channels);
1114
1115 spin_lock_init(&pn->all_channels_lock);
1116
1117 return 0;
1118}
1119
1120static __net_exit void ppp_exit_net(struct net *net)
1121{
1122 struct ppp_net *pn = net_generic(net, ppp_net_id);
1123 struct net_device *dev;
1124 struct net_device *aux;
1125 struct ppp *ppp;
1126 LIST_HEAD(list);
1127 int id;
1128
1129 rtnl_lock();
1130 for_each_netdev_safe(net, dev, aux) {
1131 if (dev->netdev_ops == &ppp_netdev_ops)
1132 unregister_netdevice_queue(dev, &list);
1133 }
1134
1135 idr_for_each_entry(&pn->units_idr, ppp, id)
1136 /* Skip devices already unregistered by previous loop */
1137 if (!net_eq(dev_net(ppp->dev), net))
1138 unregister_netdevice_queue(ppp->dev, &list);
1139
1140 unregister_netdevice_many(&list);
1141 rtnl_unlock();
1142
1143 mutex_destroy(&pn->all_ppp_mutex);
1144 idr_destroy(&pn->units_idr);
1145 WARN_ON_ONCE(!list_empty(&pn->all_channels));
1146 WARN_ON_ONCE(!list_empty(&pn->new_channels));
1147}
1148
1149static struct pernet_operations ppp_net_ops = {
1150 .init = ppp_init_net,
1151 .exit = ppp_exit_net,
1152 .id = &ppp_net_id,
1153 .size = sizeof(struct ppp_net),
1154};
1155
1156static int ppp_unit_register(struct ppp *ppp, int unit, bool ifname_is_set)
1157{
1158 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
1159 int ret;
1160
1161 mutex_lock(&pn->all_ppp_mutex);
1162
1163 if (unit < 0) {
1164 ret = unit_get(&pn->units_idr, ppp, 0);
1165 if (ret < 0)
1166 goto err;
1167 if (!ifname_is_set) {
1168 while (1) {
1169 snprintf(ppp->dev->name, IFNAMSIZ, "ppp%i", ret);
1170 if (!netdev_name_in_use(ppp->ppp_net, ppp->dev->name))
1171 break;
1172 unit_put(&pn->units_idr, ret);
1173 ret = unit_get(&pn->units_idr, ppp, ret + 1);
1174 if (ret < 0)
1175 goto err;
1176 }
1177 }
1178 } else {
1179 /* Caller asked for a specific unit number. Fail with -EEXIST
1180 * if unavailable. For backward compatibility, return -EEXIST
1181 * too if idr allocation fails; this makes pppd retry without
1182 * requesting a specific unit number.
1183 */
1184 if (unit_find(&pn->units_idr, unit)) {
1185 ret = -EEXIST;
1186 goto err;
1187 }
1188 ret = unit_set(&pn->units_idr, ppp, unit);
1189 if (ret < 0) {
1190 /* Rewrite error for backward compatibility */
1191 ret = -EEXIST;
1192 goto err;
1193 }
1194 }
1195 ppp->file.index = ret;
1196
1197 if (!ifname_is_set)
1198 snprintf(ppp->dev->name, IFNAMSIZ, "ppp%i", ppp->file.index);
1199
1200 mutex_unlock(&pn->all_ppp_mutex);
1201
1202 ret = register_netdevice(ppp->dev);
1203 if (ret < 0)
1204 goto err_unit;
1205
1206 atomic_inc(&ppp_unit_count);
1207
1208 return 0;
1209
1210err_unit:
1211 mutex_lock(&pn->all_ppp_mutex);
1212 unit_put(&pn->units_idr, ppp->file.index);
1213err:
1214 mutex_unlock(&pn->all_ppp_mutex);
1215
1216 return ret;
1217}
1218
1219static int ppp_dev_configure(struct net *src_net, struct net_device *dev,
1220 const struct ppp_config *conf)
1221{
1222 struct ppp *ppp = netdev_priv(dev);
1223 int indx;
1224 int err;
1225 int cpu;
1226
1227 ppp->dev = dev;
1228 ppp->ppp_net = src_net;
1229 ppp->mru = PPP_MRU;
1230 ppp->owner = conf->file;
1231
1232 init_ppp_file(&ppp->file, INTERFACE);
1233 ppp->file.hdrlen = PPP_HDRLEN - 2; /* don't count proto bytes */
1234
1235 for (indx = 0; indx < NUM_NP; ++indx)
1236 ppp->npmode[indx] = NPMODE_PASS;
1237 INIT_LIST_HEAD(&ppp->channels);
1238 spin_lock_init(&ppp->rlock);
1239 spin_lock_init(&ppp->wlock);
1240
1241 ppp->xmit_recursion = alloc_percpu(int);
1242 if (!ppp->xmit_recursion) {
1243 err = -ENOMEM;
1244 goto err1;
1245 }
1246 for_each_possible_cpu(cpu)
1247 (*per_cpu_ptr(ppp->xmit_recursion, cpu)) = 0;
1248
1249#ifdef CONFIG_PPP_MULTILINK
1250 ppp->minseq = -1;
1251 skb_queue_head_init(&ppp->mrq);
1252#endif /* CONFIG_PPP_MULTILINK */
1253#ifdef CONFIG_PPP_FILTER
1254 ppp->pass_filter = NULL;
1255 ppp->active_filter = NULL;
1256#endif /* CONFIG_PPP_FILTER */
1257
1258 err = ppp_unit_register(ppp, conf->unit, conf->ifname_is_set);
1259 if (err < 0)
1260 goto err2;
1261
1262 conf->file->private_data = &ppp->file;
1263
1264 return 0;
1265err2:
1266 free_percpu(ppp->xmit_recursion);
1267err1:
1268 return err;
1269}
1270
1271static const struct nla_policy ppp_nl_policy[IFLA_PPP_MAX + 1] = {
1272 [IFLA_PPP_DEV_FD] = { .type = NLA_S32 },
1273};
1274
1275static int ppp_nl_validate(struct nlattr *tb[], struct nlattr *data[],
1276 struct netlink_ext_ack *extack)
1277{
1278 if (!data)
1279 return -EINVAL;
1280
1281 if (!data[IFLA_PPP_DEV_FD])
1282 return -EINVAL;
1283 if (nla_get_s32(data[IFLA_PPP_DEV_FD]) < 0)
1284 return -EBADF;
1285
1286 return 0;
1287}
1288
1289static int ppp_nl_newlink(struct net *src_net, struct net_device *dev,
1290 struct nlattr *tb[], struct nlattr *data[],
1291 struct netlink_ext_ack *extack)
1292{
1293 struct ppp_config conf = {
1294 .unit = -1,
1295 .ifname_is_set = true,
1296 };
1297 struct file *file;
1298 int err;
1299
1300 file = fget(nla_get_s32(data[IFLA_PPP_DEV_FD]));
1301 if (!file)
1302 return -EBADF;
1303
1304 /* rtnl_lock is already held here, but ppp_create_interface() locks
1305 * ppp_mutex before holding rtnl_lock. Using mutex_trylock() avoids
1306 * possible deadlock due to lock order inversion, at the cost of
1307 * pushing the problem back to userspace.
1308 */
1309 if (!mutex_trylock(&ppp_mutex)) {
1310 err = -EBUSY;
1311 goto out;
1312 }
1313
1314 if (file->f_op != &ppp_device_fops || file->private_data) {
1315 err = -EBADF;
1316 goto out_unlock;
1317 }
1318
1319 conf.file = file;
1320
1321 /* Don't use device name generated by the rtnetlink layer when ifname
1322 * isn't specified. Let ppp_dev_configure() set the device name using
1323 * the PPP unit identifer as suffix (i.e. ppp<unit_id>). This allows
1324 * userspace to infer the device name using to the PPPIOCGUNIT ioctl.
1325 */
1326 if (!tb[IFLA_IFNAME] || !nla_len(tb[IFLA_IFNAME]) || !*(char *)nla_data(tb[IFLA_IFNAME]))
1327 conf.ifname_is_set = false;
1328
1329 err = ppp_dev_configure(src_net, dev, &conf);
1330
1331out_unlock:
1332 mutex_unlock(&ppp_mutex);
1333out:
1334 fput(file);
1335
1336 return err;
1337}
1338
1339static void ppp_nl_dellink(struct net_device *dev, struct list_head *head)
1340{
1341 unregister_netdevice_queue(dev, head);
1342}
1343
1344static size_t ppp_nl_get_size(const struct net_device *dev)
1345{
1346 return 0;
1347}
1348
1349static int ppp_nl_fill_info(struct sk_buff *skb, const struct net_device *dev)
1350{
1351 return 0;
1352}
1353
1354static struct net *ppp_nl_get_link_net(const struct net_device *dev)
1355{
1356 struct ppp *ppp = netdev_priv(dev);
1357
1358 return ppp->ppp_net;
1359}
1360
1361static struct rtnl_link_ops ppp_link_ops __read_mostly = {
1362 .kind = "ppp",
1363 .maxtype = IFLA_PPP_MAX,
1364 .policy = ppp_nl_policy,
1365 .priv_size = sizeof(struct ppp),
1366 .setup = ppp_setup,
1367 .validate = ppp_nl_validate,
1368 .newlink = ppp_nl_newlink,
1369 .dellink = ppp_nl_dellink,
1370 .get_size = ppp_nl_get_size,
1371 .fill_info = ppp_nl_fill_info,
1372 .get_link_net = ppp_nl_get_link_net,
1373};
1374
1375#define PPP_MAJOR 108
1376
1377/* Called at boot time if ppp is compiled into the kernel,
1378 or at module load time (from init_module) if compiled as a module. */
1379static int __init ppp_init(void)
1380{
1381 int err;
1382
1383 pr_info("PPP generic driver version " PPP_VERSION "\n");
1384
1385 err = register_pernet_device(&ppp_net_ops);
1386 if (err) {
1387 pr_err("failed to register PPP pernet device (%d)\n", err);
1388 goto out;
1389 }
1390
1391 err = register_chrdev(PPP_MAJOR, "ppp", &ppp_device_fops);
1392 if (err) {
1393 pr_err("failed to register PPP device (%d)\n", err);
1394 goto out_net;
1395 }
1396
1397 ppp_class = class_create("ppp");
1398 if (IS_ERR(ppp_class)) {
1399 err = PTR_ERR(ppp_class);
1400 goto out_chrdev;
1401 }
1402
1403 err = rtnl_link_register(&ppp_link_ops);
1404 if (err) {
1405 pr_err("failed to register rtnetlink PPP handler\n");
1406 goto out_class;
1407 }
1408
1409 /* not a big deal if we fail here :-) */
1410 device_create(ppp_class, NULL, MKDEV(PPP_MAJOR, 0), NULL, "ppp");
1411
1412 return 0;
1413
1414out_class:
1415 class_destroy(ppp_class);
1416out_chrdev:
1417 unregister_chrdev(PPP_MAJOR, "ppp");
1418out_net:
1419 unregister_pernet_device(&ppp_net_ops);
1420out:
1421 return err;
1422}
1423
1424/*
1425 * Network interface unit routines.
1426 */
1427static netdev_tx_t
1428ppp_start_xmit(struct sk_buff *skb, struct net_device *dev)
1429{
1430 struct ppp *ppp = netdev_priv(dev);
1431 int npi, proto;
1432 unsigned char *pp;
1433
1434 npi = ethertype_to_npindex(ntohs(skb->protocol));
1435 if (npi < 0)
1436 goto outf;
1437
1438 /* Drop, accept or reject the packet */
1439 switch (ppp->npmode[npi]) {
1440 case NPMODE_PASS:
1441 break;
1442 case NPMODE_QUEUE:
1443 /* it would be nice to have a way to tell the network
1444 system to queue this one up for later. */
1445 goto outf;
1446 case NPMODE_DROP:
1447 case NPMODE_ERROR:
1448 goto outf;
1449 }
1450
1451 /* Put the 2-byte PPP protocol number on the front,
1452 making sure there is room for the address and control fields. */
1453 if (skb_cow_head(skb, PPP_HDRLEN))
1454 goto outf;
1455
1456 pp = skb_push(skb, 2);
1457 proto = npindex_to_proto[npi];
1458 put_unaligned_be16(proto, pp);
1459
1460 skb_scrub_packet(skb, !net_eq(ppp->ppp_net, dev_net(dev)));
1461 ppp_xmit_process(ppp, skb);
1462
1463 return NETDEV_TX_OK;
1464
1465 outf:
1466 kfree_skb(skb);
1467 ++dev->stats.tx_dropped;
1468 return NETDEV_TX_OK;
1469}
1470
1471static int
1472ppp_net_siocdevprivate(struct net_device *dev, struct ifreq *ifr,
1473 void __user *addr, int cmd)
1474{
1475 struct ppp *ppp = netdev_priv(dev);
1476 int err = -EFAULT;
1477 struct ppp_stats stats;
1478 struct ppp_comp_stats cstats;
1479 char *vers;
1480
1481 switch (cmd) {
1482 case SIOCGPPPSTATS:
1483 ppp_get_stats(ppp, &stats);
1484 if (copy_to_user(addr, &stats, sizeof(stats)))
1485 break;
1486 err = 0;
1487 break;
1488
1489 case SIOCGPPPCSTATS:
1490 memset(&cstats, 0, sizeof(cstats));
1491 if (ppp->xc_state)
1492 ppp->xcomp->comp_stat(ppp->xc_state, &cstats.c);
1493 if (ppp->rc_state)
1494 ppp->rcomp->decomp_stat(ppp->rc_state, &cstats.d);
1495 if (copy_to_user(addr, &cstats, sizeof(cstats)))
1496 break;
1497 err = 0;
1498 break;
1499
1500 case SIOCGPPPVER:
1501 vers = PPP_VERSION;
1502 if (copy_to_user(addr, vers, strlen(vers) + 1))
1503 break;
1504 err = 0;
1505 break;
1506
1507 default:
1508 err = -EINVAL;
1509 }
1510
1511 return err;
1512}
1513
1514static void
1515ppp_get_stats64(struct net_device *dev, struct rtnl_link_stats64 *stats64)
1516{
1517 struct ppp *ppp = netdev_priv(dev);
1518
1519 ppp_recv_lock(ppp);
1520 stats64->rx_packets = ppp->stats64.rx_packets;
1521 stats64->rx_bytes = ppp->stats64.rx_bytes;
1522 ppp_recv_unlock(ppp);
1523
1524 ppp_xmit_lock(ppp);
1525 stats64->tx_packets = ppp->stats64.tx_packets;
1526 stats64->tx_bytes = ppp->stats64.tx_bytes;
1527 ppp_xmit_unlock(ppp);
1528
1529 stats64->rx_errors = dev->stats.rx_errors;
1530 stats64->tx_errors = dev->stats.tx_errors;
1531 stats64->rx_dropped = dev->stats.rx_dropped;
1532 stats64->tx_dropped = dev->stats.tx_dropped;
1533 stats64->rx_length_errors = dev->stats.rx_length_errors;
1534}
1535
1536static int ppp_dev_init(struct net_device *dev)
1537{
1538 struct ppp *ppp;
1539
1540 netdev_lockdep_set_classes(dev);
1541
1542 ppp = netdev_priv(dev);
1543 /* Let the netdevice take a reference on the ppp file. This ensures
1544 * that ppp_destroy_interface() won't run before the device gets
1545 * unregistered.
1546 */
1547 refcount_inc(&ppp->file.refcnt);
1548
1549 return 0;
1550}
1551
1552static void ppp_dev_uninit(struct net_device *dev)
1553{
1554 struct ppp *ppp = netdev_priv(dev);
1555 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
1556
1557 ppp_lock(ppp);
1558 ppp->closing = 1;
1559 ppp_unlock(ppp);
1560
1561 mutex_lock(&pn->all_ppp_mutex);
1562 unit_put(&pn->units_idr, ppp->file.index);
1563 mutex_unlock(&pn->all_ppp_mutex);
1564
1565 ppp->owner = NULL;
1566
1567 ppp->file.dead = 1;
1568 wake_up_interruptible(&ppp->file.rwait);
1569}
1570
1571static void ppp_dev_priv_destructor(struct net_device *dev)
1572{
1573 struct ppp *ppp;
1574
1575 ppp = netdev_priv(dev);
1576 if (refcount_dec_and_test(&ppp->file.refcnt))
1577 ppp_destroy_interface(ppp);
1578}
1579
1580static int ppp_fill_forward_path(struct net_device_path_ctx *ctx,
1581 struct net_device_path *path)
1582{
1583 struct ppp *ppp = netdev_priv(ctx->dev);
1584 struct ppp_channel *chan;
1585 struct channel *pch;
1586
1587 if (ppp->flags & SC_MULTILINK)
1588 return -EOPNOTSUPP;
1589
1590 if (list_empty(&ppp->channels))
1591 return -ENODEV;
1592
1593 pch = list_first_entry(&ppp->channels, struct channel, clist);
1594 chan = pch->chan;
1595 if (!chan->ops->fill_forward_path)
1596 return -EOPNOTSUPP;
1597
1598 return chan->ops->fill_forward_path(ctx, path, chan);
1599}
1600
1601static const struct net_device_ops ppp_netdev_ops = {
1602 .ndo_init = ppp_dev_init,
1603 .ndo_uninit = ppp_dev_uninit,
1604 .ndo_start_xmit = ppp_start_xmit,
1605 .ndo_siocdevprivate = ppp_net_siocdevprivate,
1606 .ndo_get_stats64 = ppp_get_stats64,
1607 .ndo_fill_forward_path = ppp_fill_forward_path,
1608};
1609
1610static struct device_type ppp_type = {
1611 .name = "ppp",
1612};
1613
1614static void ppp_setup(struct net_device *dev)
1615{
1616 dev->netdev_ops = &ppp_netdev_ops;
1617 SET_NETDEV_DEVTYPE(dev, &ppp_type);
1618
1619 dev->features |= NETIF_F_LLTX;
1620
1621 dev->hard_header_len = PPP_HDRLEN;
1622 dev->mtu = PPP_MRU;
1623 dev->addr_len = 0;
1624 dev->tx_queue_len = 3;
1625 dev->type = ARPHRD_PPP;
1626 dev->flags = IFF_POINTOPOINT | IFF_NOARP | IFF_MULTICAST;
1627 dev->priv_destructor = ppp_dev_priv_destructor;
1628 netif_keep_dst(dev);
1629}
1630
1631/*
1632 * Transmit-side routines.
1633 */
1634
1635/* Called to do any work queued up on the transmit side that can now be done */
1636static void __ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1637{
1638 ppp_xmit_lock(ppp);
1639 if (!ppp->closing) {
1640 ppp_push(ppp);
1641
1642 if (skb)
1643 skb_queue_tail(&ppp->file.xq, skb);
1644 while (!ppp->xmit_pending &&
1645 (skb = skb_dequeue(&ppp->file.xq)))
1646 ppp_send_frame(ppp, skb);
1647 /* If there's no work left to do, tell the core net
1648 code that we can accept some more. */
1649 if (!ppp->xmit_pending && !skb_peek(&ppp->file.xq))
1650 netif_wake_queue(ppp->dev);
1651 else
1652 netif_stop_queue(ppp->dev);
1653 } else {
1654 kfree_skb(skb);
1655 }
1656 ppp_xmit_unlock(ppp);
1657}
1658
1659static void ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1660{
1661 local_bh_disable();
1662
1663 if (unlikely(*this_cpu_ptr(ppp->xmit_recursion)))
1664 goto err;
1665
1666 (*this_cpu_ptr(ppp->xmit_recursion))++;
1667 __ppp_xmit_process(ppp, skb);
1668 (*this_cpu_ptr(ppp->xmit_recursion))--;
1669
1670 local_bh_enable();
1671
1672 return;
1673
1674err:
1675 local_bh_enable();
1676
1677 kfree_skb(skb);
1678
1679 if (net_ratelimit())
1680 netdev_err(ppp->dev, "recursion detected\n");
1681}
1682
1683static inline struct sk_buff *
1684pad_compress_skb(struct ppp *ppp, struct sk_buff *skb)
1685{
1686 struct sk_buff *new_skb;
1687 int len;
1688 int new_skb_size = ppp->dev->mtu +
1689 ppp->xcomp->comp_extra + ppp->dev->hard_header_len;
1690 int compressor_skb_size = ppp->dev->mtu +
1691 ppp->xcomp->comp_extra + PPP_HDRLEN;
1692 new_skb = alloc_skb(new_skb_size, GFP_ATOMIC);
1693 if (!new_skb) {
1694 if (net_ratelimit())
1695 netdev_err(ppp->dev, "PPP: no memory (comp pkt)\n");
1696 return NULL;
1697 }
1698 if (ppp->dev->hard_header_len > PPP_HDRLEN)
1699 skb_reserve(new_skb,
1700 ppp->dev->hard_header_len - PPP_HDRLEN);
1701
1702 /* compressor still expects A/C bytes in hdr */
1703 len = ppp->xcomp->compress(ppp->xc_state, skb->data - 2,
1704 new_skb->data, skb->len + 2,
1705 compressor_skb_size);
1706 if (len > 0 && (ppp->flags & SC_CCP_UP)) {
1707 consume_skb(skb);
1708 skb = new_skb;
1709 skb_put(skb, len);
1710 skb_pull(skb, 2); /* pull off A/C bytes */
1711 } else if (len == 0) {
1712 /* didn't compress, or CCP not up yet */
1713 consume_skb(new_skb);
1714 new_skb = skb;
1715 } else {
1716 /*
1717 * (len < 0)
1718 * MPPE requires that we do not send unencrypted
1719 * frames. The compressor will return -1 if we
1720 * should drop the frame. We cannot simply test
1721 * the compress_proto because MPPE and MPPC share
1722 * the same number.
1723 */
1724 if (net_ratelimit())
1725 netdev_err(ppp->dev, "ppp: compressor dropped pkt\n");
1726 kfree_skb(skb);
1727 consume_skb(new_skb);
1728 new_skb = NULL;
1729 }
1730 return new_skb;
1731}
1732
1733/*
1734 * Compress and send a frame.
1735 * The caller should have locked the xmit path,
1736 * and xmit_pending should be 0.
1737 */
1738static void
1739ppp_send_frame(struct ppp *ppp, struct sk_buff *skb)
1740{
1741 int proto = PPP_PROTO(skb);
1742 struct sk_buff *new_skb;
1743 int len;
1744 unsigned char *cp;
1745
1746 skb->dev = ppp->dev;
1747
1748 if (proto < 0x8000) {
1749#ifdef CONFIG_PPP_FILTER
1750 /* check if we should pass this packet */
1751 /* the filter instructions are constructed assuming
1752 a four-byte PPP header on each packet */
1753 *(u8 *)skb_push(skb, 2) = 1;
1754 if (ppp->pass_filter &&
1755 bpf_prog_run(ppp->pass_filter, skb) == 0) {
1756 if (ppp->debug & 1)
1757 netdev_printk(KERN_DEBUG, ppp->dev,
1758 "PPP: outbound frame "
1759 "not passed\n");
1760 kfree_skb(skb);
1761 return;
1762 }
1763 /* if this packet passes the active filter, record the time */
1764 if (!(ppp->active_filter &&
1765 bpf_prog_run(ppp->active_filter, skb) == 0))
1766 ppp->last_xmit = jiffies;
1767 skb_pull(skb, 2);
1768#else
1769 /* for data packets, record the time */
1770 ppp->last_xmit = jiffies;
1771#endif /* CONFIG_PPP_FILTER */
1772 }
1773
1774 ++ppp->stats64.tx_packets;
1775 ppp->stats64.tx_bytes += skb->len - PPP_PROTO_LEN;
1776
1777 switch (proto) {
1778 case PPP_IP:
1779 if (!ppp->vj || (ppp->flags & SC_COMP_TCP) == 0)
1780 break;
1781 /* try to do VJ TCP header compression */
1782 new_skb = alloc_skb(skb->len + ppp->dev->hard_header_len - 2,
1783 GFP_ATOMIC);
1784 if (!new_skb) {
1785 netdev_err(ppp->dev, "PPP: no memory (VJ comp pkt)\n");
1786 goto drop;
1787 }
1788 skb_reserve(new_skb, ppp->dev->hard_header_len - 2);
1789 cp = skb->data + 2;
1790 len = slhc_compress(ppp->vj, cp, skb->len - 2,
1791 new_skb->data + 2, &cp,
1792 !(ppp->flags & SC_NO_TCP_CCID));
1793 if (cp == skb->data + 2) {
1794 /* didn't compress */
1795 consume_skb(new_skb);
1796 } else {
1797 if (cp[0] & SL_TYPE_COMPRESSED_TCP) {
1798 proto = PPP_VJC_COMP;
1799 cp[0] &= ~SL_TYPE_COMPRESSED_TCP;
1800 } else {
1801 proto = PPP_VJC_UNCOMP;
1802 cp[0] = skb->data[2];
1803 }
1804 consume_skb(skb);
1805 skb = new_skb;
1806 cp = skb_put(skb, len + 2);
1807 cp[0] = 0;
1808 cp[1] = proto;
1809 }
1810 break;
1811
1812 case PPP_CCP:
1813 /* peek at outbound CCP frames */
1814 ppp_ccp_peek(ppp, skb, 0);
1815 break;
1816 }
1817
1818 /* try to do packet compression */
1819 if ((ppp->xstate & SC_COMP_RUN) && ppp->xc_state &&
1820 proto != PPP_LCP && proto != PPP_CCP) {
1821 if (!(ppp->flags & SC_CCP_UP) && (ppp->flags & SC_MUST_COMP)) {
1822 if (net_ratelimit())
1823 netdev_err(ppp->dev,
1824 "ppp: compression required but "
1825 "down - pkt dropped.\n");
1826 goto drop;
1827 }
1828 skb = pad_compress_skb(ppp, skb);
1829 if (!skb)
1830 goto drop;
1831 }
1832
1833 /*
1834 * If we are waiting for traffic (demand dialling),
1835 * queue it up for pppd to receive.
1836 */
1837 if (ppp->flags & SC_LOOP_TRAFFIC) {
1838 if (ppp->file.rq.qlen > PPP_MAX_RQLEN)
1839 goto drop;
1840 skb_queue_tail(&ppp->file.rq, skb);
1841 wake_up_interruptible(&ppp->file.rwait);
1842 return;
1843 }
1844
1845 ppp->xmit_pending = skb;
1846 ppp_push(ppp);
1847 return;
1848
1849 drop:
1850 kfree_skb(skb);
1851 ++ppp->dev->stats.tx_errors;
1852}
1853
1854/*
1855 * Try to send the frame in xmit_pending.
1856 * The caller should have the xmit path locked.
1857 */
1858static void
1859ppp_push(struct ppp *ppp)
1860{
1861 struct list_head *list;
1862 struct channel *pch;
1863 struct sk_buff *skb = ppp->xmit_pending;
1864
1865 if (!skb)
1866 return;
1867
1868 list = &ppp->channels;
1869 if (list_empty(list)) {
1870 /* nowhere to send the packet, just drop it */
1871 ppp->xmit_pending = NULL;
1872 kfree_skb(skb);
1873 return;
1874 }
1875
1876 if ((ppp->flags & SC_MULTILINK) == 0) {
1877 /* not doing multilink: send it down the first channel */
1878 list = list->next;
1879 pch = list_entry(list, struct channel, clist);
1880
1881 spin_lock(&pch->downl);
1882 if (pch->chan) {
1883 if (pch->chan->ops->start_xmit(pch->chan, skb))
1884 ppp->xmit_pending = NULL;
1885 } else {
1886 /* channel got unregistered */
1887 kfree_skb(skb);
1888 ppp->xmit_pending = NULL;
1889 }
1890 spin_unlock(&pch->downl);
1891 return;
1892 }
1893
1894#ifdef CONFIG_PPP_MULTILINK
1895 /* Multilink: fragment the packet over as many links
1896 as can take the packet at the moment. */
1897 if (!ppp_mp_explode(ppp, skb))
1898 return;
1899#endif /* CONFIG_PPP_MULTILINK */
1900
1901 ppp->xmit_pending = NULL;
1902 kfree_skb(skb);
1903}
1904
1905#ifdef CONFIG_PPP_MULTILINK
1906static bool mp_protocol_compress __read_mostly = true;
1907module_param(mp_protocol_compress, bool, 0644);
1908MODULE_PARM_DESC(mp_protocol_compress,
1909 "compress protocol id in multilink fragments");
1910
1911/*
1912 * Divide a packet to be transmitted into fragments and
1913 * send them out the individual links.
1914 */
1915static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb)
1916{
1917 int len, totlen;
1918 int i, bits, hdrlen, mtu;
1919 int flen;
1920 int navail, nfree, nzero;
1921 int nbigger;
1922 int totspeed;
1923 int totfree;
1924 unsigned char *p, *q;
1925 struct list_head *list;
1926 struct channel *pch;
1927 struct sk_buff *frag;
1928 struct ppp_channel *chan;
1929
1930 totspeed = 0; /*total bitrate of the bundle*/
1931 nfree = 0; /* # channels which have no packet already queued */
1932 navail = 0; /* total # of usable channels (not deregistered) */
1933 nzero = 0; /* number of channels with zero speed associated*/
1934 totfree = 0; /*total # of channels available and
1935 *having no queued packets before
1936 *starting the fragmentation*/
1937
1938 hdrlen = (ppp->flags & SC_MP_XSHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1939 i = 0;
1940 list_for_each_entry(pch, &ppp->channels, clist) {
1941 if (pch->chan) {
1942 pch->avail = 1;
1943 navail++;
1944 pch->speed = pch->chan->speed;
1945 } else {
1946 pch->avail = 0;
1947 }
1948 if (pch->avail) {
1949 if (skb_queue_empty(&pch->file.xq) ||
1950 !pch->had_frag) {
1951 if (pch->speed == 0)
1952 nzero++;
1953 else
1954 totspeed += pch->speed;
1955
1956 pch->avail = 2;
1957 ++nfree;
1958 ++totfree;
1959 }
1960 if (!pch->had_frag && i < ppp->nxchan)
1961 ppp->nxchan = i;
1962 }
1963 ++i;
1964 }
1965 /*
1966 * Don't start sending this packet unless at least half of
1967 * the channels are free. This gives much better TCP
1968 * performance if we have a lot of channels.
1969 */
1970 if (nfree == 0 || nfree < navail / 2)
1971 return 0; /* can't take now, leave it in xmit_pending */
1972
1973 /* Do protocol field compression */
1974 p = skb->data;
1975 len = skb->len;
1976 if (*p == 0 && mp_protocol_compress) {
1977 ++p;
1978 --len;
1979 }
1980
1981 totlen = len;
1982 nbigger = len % nfree;
1983
1984 /* skip to the channel after the one we last used
1985 and start at that one */
1986 list = &ppp->channels;
1987 for (i = 0; i < ppp->nxchan; ++i) {
1988 list = list->next;
1989 if (list == &ppp->channels) {
1990 i = 0;
1991 break;
1992 }
1993 }
1994
1995 /* create a fragment for each channel */
1996 bits = B;
1997 while (len > 0) {
1998 list = list->next;
1999 if (list == &ppp->channels) {
2000 i = 0;
2001 continue;
2002 }
2003 pch = list_entry(list, struct channel, clist);
2004 ++i;
2005 if (!pch->avail)
2006 continue;
2007
2008 /*
2009 * Skip this channel if it has a fragment pending already and
2010 * we haven't given a fragment to all of the free channels.
2011 */
2012 if (pch->avail == 1) {
2013 if (nfree > 0)
2014 continue;
2015 } else {
2016 pch->avail = 1;
2017 }
2018
2019 /* check the channel's mtu and whether it is still attached. */
2020 spin_lock(&pch->downl);
2021 if (pch->chan == NULL) {
2022 /* can't use this channel, it's being deregistered */
2023 if (pch->speed == 0)
2024 nzero--;
2025 else
2026 totspeed -= pch->speed;
2027
2028 spin_unlock(&pch->downl);
2029 pch->avail = 0;
2030 totlen = len;
2031 totfree--;
2032 nfree--;
2033 if (--navail == 0)
2034 break;
2035 continue;
2036 }
2037
2038 /*
2039 *if the channel speed is not set divide
2040 *the packet evenly among the free channels;
2041 *otherwise divide it according to the speed
2042 *of the channel we are going to transmit on
2043 */
2044 flen = len;
2045 if (nfree > 0) {
2046 if (pch->speed == 0) {
2047 flen = len/nfree;
2048 if (nbigger > 0) {
2049 flen++;
2050 nbigger--;
2051 }
2052 } else {
2053 flen = (((totfree - nzero)*(totlen + hdrlen*totfree)) /
2054 ((totspeed*totfree)/pch->speed)) - hdrlen;
2055 if (nbigger > 0) {
2056 flen += ((totfree - nzero)*pch->speed)/totspeed;
2057 nbigger -= ((totfree - nzero)*pch->speed)/
2058 totspeed;
2059 }
2060 }
2061 nfree--;
2062 }
2063
2064 /*
2065 *check if we are on the last channel or
2066 *we exceded the length of the data to
2067 *fragment
2068 */
2069 if ((nfree <= 0) || (flen > len))
2070 flen = len;
2071 /*
2072 *it is not worth to tx on slow channels:
2073 *in that case from the resulting flen according to the
2074 *above formula will be equal or less than zero.
2075 *Skip the channel in this case
2076 */
2077 if (flen <= 0) {
2078 pch->avail = 2;
2079 spin_unlock(&pch->downl);
2080 continue;
2081 }
2082
2083 /*
2084 * hdrlen includes the 2-byte PPP protocol field, but the
2085 * MTU counts only the payload excluding the protocol field.
2086 * (RFC1661 Section 2)
2087 */
2088 mtu = pch->chan->mtu - (hdrlen - 2);
2089 if (mtu < 4)
2090 mtu = 4;
2091 if (flen > mtu)
2092 flen = mtu;
2093 if (flen == len)
2094 bits |= E;
2095 frag = alloc_skb(flen + hdrlen + (flen == 0), GFP_ATOMIC);
2096 if (!frag)
2097 goto noskb;
2098 q = skb_put(frag, flen + hdrlen);
2099
2100 /* make the MP header */
2101 put_unaligned_be16(PPP_MP, q);
2102 if (ppp->flags & SC_MP_XSHORTSEQ) {
2103 q[2] = bits + ((ppp->nxseq >> 8) & 0xf);
2104 q[3] = ppp->nxseq;
2105 } else {
2106 q[2] = bits;
2107 q[3] = ppp->nxseq >> 16;
2108 q[4] = ppp->nxseq >> 8;
2109 q[5] = ppp->nxseq;
2110 }
2111
2112 memcpy(q + hdrlen, p, flen);
2113
2114 /* try to send it down the channel */
2115 chan = pch->chan;
2116 if (!skb_queue_empty(&pch->file.xq) ||
2117 !chan->ops->start_xmit(chan, frag))
2118 skb_queue_tail(&pch->file.xq, frag);
2119 pch->had_frag = 1;
2120 p += flen;
2121 len -= flen;
2122 ++ppp->nxseq;
2123 bits = 0;
2124 spin_unlock(&pch->downl);
2125 }
2126 ppp->nxchan = i;
2127
2128 return 1;
2129
2130 noskb:
2131 spin_unlock(&pch->downl);
2132 if (ppp->debug & 1)
2133 netdev_err(ppp->dev, "PPP: no memory (fragment)\n");
2134 ++ppp->dev->stats.tx_errors;
2135 ++ppp->nxseq;
2136 return 1; /* abandon the frame */
2137}
2138#endif /* CONFIG_PPP_MULTILINK */
2139
2140/* Try to send data out on a channel */
2141static void __ppp_channel_push(struct channel *pch)
2142{
2143 struct sk_buff *skb;
2144 struct ppp *ppp;
2145
2146 spin_lock(&pch->downl);
2147 if (pch->chan) {
2148 while (!skb_queue_empty(&pch->file.xq)) {
2149 skb = skb_dequeue(&pch->file.xq);
2150 if (!pch->chan->ops->start_xmit(pch->chan, skb)) {
2151 /* put the packet back and try again later */
2152 skb_queue_head(&pch->file.xq, skb);
2153 break;
2154 }
2155 }
2156 } else {
2157 /* channel got deregistered */
2158 skb_queue_purge(&pch->file.xq);
2159 }
2160 spin_unlock(&pch->downl);
2161 /* see if there is anything from the attached unit to be sent */
2162 if (skb_queue_empty(&pch->file.xq)) {
2163 ppp = pch->ppp;
2164 if (ppp)
2165 __ppp_xmit_process(ppp, NULL);
2166 }
2167}
2168
2169static void ppp_channel_push(struct channel *pch)
2170{
2171 read_lock_bh(&pch->upl);
2172 if (pch->ppp) {
2173 (*this_cpu_ptr(pch->ppp->xmit_recursion))++;
2174 __ppp_channel_push(pch);
2175 (*this_cpu_ptr(pch->ppp->xmit_recursion))--;
2176 } else {
2177 __ppp_channel_push(pch);
2178 }
2179 read_unlock_bh(&pch->upl);
2180}
2181
2182/*
2183 * Receive-side routines.
2184 */
2185
2186struct ppp_mp_skb_parm {
2187 u32 sequence;
2188 u8 BEbits;
2189};
2190#define PPP_MP_CB(skb) ((struct ppp_mp_skb_parm *)((skb)->cb))
2191
2192static inline void
2193ppp_do_recv(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2194{
2195 ppp_recv_lock(ppp);
2196 if (!ppp->closing)
2197 ppp_receive_frame(ppp, skb, pch);
2198 else
2199 kfree_skb(skb);
2200 ppp_recv_unlock(ppp);
2201}
2202
2203/**
2204 * __ppp_decompress_proto - Decompress protocol field, slim version.
2205 * @skb: Socket buffer where protocol field should be decompressed. It must have
2206 * at least 1 byte of head room and 1 byte of linear data. First byte of
2207 * data must be a protocol field byte.
2208 *
2209 * Decompress protocol field in PPP header if it's compressed, e.g. when
2210 * Protocol-Field-Compression (PFC) was negotiated. No checks w.r.t. skb data
2211 * length are done in this function.
2212 */
2213static void __ppp_decompress_proto(struct sk_buff *skb)
2214{
2215 if (skb->data[0] & 0x01)
2216 *(u8 *)skb_push(skb, 1) = 0x00;
2217}
2218
2219/**
2220 * ppp_decompress_proto - Check skb data room and decompress protocol field.
2221 * @skb: Socket buffer where protocol field should be decompressed. First byte
2222 * of data must be a protocol field byte.
2223 *
2224 * Decompress protocol field in PPP header if it's compressed, e.g. when
2225 * Protocol-Field-Compression (PFC) was negotiated. This function also makes
2226 * sure that skb data room is sufficient for Protocol field, before and after
2227 * decompression.
2228 *
2229 * Return: true - decompressed successfully, false - not enough room in skb.
2230 */
2231static bool ppp_decompress_proto(struct sk_buff *skb)
2232{
2233 /* At least one byte should be present (if protocol is compressed) */
2234 if (!pskb_may_pull(skb, 1))
2235 return false;
2236
2237 __ppp_decompress_proto(skb);
2238
2239 /* Protocol field should occupy 2 bytes when not compressed */
2240 return pskb_may_pull(skb, 2);
2241}
2242
2243/* Attempt to handle a frame via. a bridged channel, if one exists.
2244 * If the channel is bridged, the frame is consumed by the bridge.
2245 * If not, the caller must handle the frame by normal recv mechanisms.
2246 * Returns true if the frame is consumed, false otherwise.
2247 */
2248static bool ppp_channel_bridge_input(struct channel *pch, struct sk_buff *skb)
2249{
2250 struct channel *pchb;
2251
2252 rcu_read_lock();
2253 pchb = rcu_dereference(pch->bridge);
2254 if (!pchb)
2255 goto out_rcu;
2256
2257 spin_lock(&pchb->downl);
2258 if (!pchb->chan) {
2259 /* channel got unregistered */
2260 kfree_skb(skb);
2261 goto outl;
2262 }
2263
2264 skb_scrub_packet(skb, !net_eq(pch->chan_net, pchb->chan_net));
2265 if (!pchb->chan->ops->start_xmit(pchb->chan, skb))
2266 kfree_skb(skb);
2267
2268outl:
2269 spin_unlock(&pchb->downl);
2270out_rcu:
2271 rcu_read_unlock();
2272
2273 /* If pchb is set then we've consumed the packet */
2274 return !!pchb;
2275}
2276
2277void
2278ppp_input(struct ppp_channel *chan, struct sk_buff *skb)
2279{
2280 struct channel *pch = chan->ppp;
2281 int proto;
2282
2283 if (!pch) {
2284 kfree_skb(skb);
2285 return;
2286 }
2287
2288 /* If the channel is bridged, transmit via. bridge */
2289 if (ppp_channel_bridge_input(pch, skb))
2290 return;
2291
2292 read_lock_bh(&pch->upl);
2293 if (!ppp_decompress_proto(skb)) {
2294 kfree_skb(skb);
2295 if (pch->ppp) {
2296 ++pch->ppp->dev->stats.rx_length_errors;
2297 ppp_receive_error(pch->ppp);
2298 }
2299 goto done;
2300 }
2301
2302 proto = PPP_PROTO(skb);
2303 if (!pch->ppp || proto >= 0xc000 || proto == PPP_CCPFRAG) {
2304 /* put it on the channel queue */
2305 skb_queue_tail(&pch->file.rq, skb);
2306 /* drop old frames if queue too long */
2307 while (pch->file.rq.qlen > PPP_MAX_RQLEN &&
2308 (skb = skb_dequeue(&pch->file.rq)))
2309 kfree_skb(skb);
2310 wake_up_interruptible(&pch->file.rwait);
2311 } else {
2312 ppp_do_recv(pch->ppp, skb, pch);
2313 }
2314
2315done:
2316 read_unlock_bh(&pch->upl);
2317}
2318
2319/* Put a 0-length skb in the receive queue as an error indication */
2320void
2321ppp_input_error(struct ppp_channel *chan, int code)
2322{
2323 struct channel *pch = chan->ppp;
2324 struct sk_buff *skb;
2325
2326 if (!pch)
2327 return;
2328
2329 read_lock_bh(&pch->upl);
2330 if (pch->ppp) {
2331 skb = alloc_skb(0, GFP_ATOMIC);
2332 if (skb) {
2333 skb->len = 0; /* probably unnecessary */
2334 skb->cb[0] = code;
2335 ppp_do_recv(pch->ppp, skb, pch);
2336 }
2337 }
2338 read_unlock_bh(&pch->upl);
2339}
2340
2341/*
2342 * We come in here to process a received frame.
2343 * The receive side of the ppp unit is locked.
2344 */
2345static void
2346ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2347{
2348 /* note: a 0-length skb is used as an error indication */
2349 if (skb->len > 0) {
2350 skb_checksum_complete_unset(skb);
2351#ifdef CONFIG_PPP_MULTILINK
2352 /* XXX do channel-level decompression here */
2353 if (PPP_PROTO(skb) == PPP_MP)
2354 ppp_receive_mp_frame(ppp, skb, pch);
2355 else
2356#endif /* CONFIG_PPP_MULTILINK */
2357 ppp_receive_nonmp_frame(ppp, skb);
2358 } else {
2359 kfree_skb(skb);
2360 ppp_receive_error(ppp);
2361 }
2362}
2363
2364static void
2365ppp_receive_error(struct ppp *ppp)
2366{
2367 ++ppp->dev->stats.rx_errors;
2368 if (ppp->vj)
2369 slhc_toss(ppp->vj);
2370}
2371
2372static void
2373ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb)
2374{
2375 struct sk_buff *ns;
2376 int proto, len, npi;
2377
2378 /*
2379 * Decompress the frame, if compressed.
2380 * Note that some decompressors need to see uncompressed frames
2381 * that come in as well as compressed frames.
2382 */
2383 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN) &&
2384 (ppp->rstate & (SC_DC_FERROR | SC_DC_ERROR)) == 0)
2385 skb = ppp_decompress_frame(ppp, skb);
2386
2387 if (ppp->flags & SC_MUST_COMP && ppp->rstate & SC_DC_FERROR)
2388 goto err;
2389
2390 /* At this point the "Protocol" field MUST be decompressed, either in
2391 * ppp_input(), ppp_decompress_frame() or in ppp_receive_mp_frame().
2392 */
2393 proto = PPP_PROTO(skb);
2394 switch (proto) {
2395 case PPP_VJC_COMP:
2396 /* decompress VJ compressed packets */
2397 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2398 goto err;
2399
2400 if (skb_tailroom(skb) < 124 || skb_cloned(skb)) {
2401 /* copy to a new sk_buff with more tailroom */
2402 ns = dev_alloc_skb(skb->len + 128);
2403 if (!ns) {
2404 netdev_err(ppp->dev, "PPP: no memory "
2405 "(VJ decomp)\n");
2406 goto err;
2407 }
2408 skb_reserve(ns, 2);
2409 skb_copy_bits(skb, 0, skb_put(ns, skb->len), skb->len);
2410 consume_skb(skb);
2411 skb = ns;
2412 }
2413 else
2414 skb->ip_summed = CHECKSUM_NONE;
2415
2416 len = slhc_uncompress(ppp->vj, skb->data + 2, skb->len - 2);
2417 if (len <= 0) {
2418 netdev_printk(KERN_DEBUG, ppp->dev,
2419 "PPP: VJ decompression error\n");
2420 goto err;
2421 }
2422 len += 2;
2423 if (len > skb->len)
2424 skb_put(skb, len - skb->len);
2425 else if (len < skb->len)
2426 skb_trim(skb, len);
2427 proto = PPP_IP;
2428 break;
2429
2430 case PPP_VJC_UNCOMP:
2431 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2432 goto err;
2433
2434 /* Until we fix the decompressor need to make sure
2435 * data portion is linear.
2436 */
2437 if (!pskb_may_pull(skb, skb->len))
2438 goto err;
2439
2440 if (slhc_remember(ppp->vj, skb->data + 2, skb->len - 2) <= 0) {
2441 netdev_err(ppp->dev, "PPP: VJ uncompressed error\n");
2442 goto err;
2443 }
2444 proto = PPP_IP;
2445 break;
2446
2447 case PPP_CCP:
2448 ppp_ccp_peek(ppp, skb, 1);
2449 break;
2450 }
2451
2452 ++ppp->stats64.rx_packets;
2453 ppp->stats64.rx_bytes += skb->len - 2;
2454
2455 npi = proto_to_npindex(proto);
2456 if (npi < 0) {
2457 /* control or unknown frame - pass it to pppd */
2458 skb_queue_tail(&ppp->file.rq, skb);
2459 /* limit queue length by dropping old frames */
2460 while (ppp->file.rq.qlen > PPP_MAX_RQLEN &&
2461 (skb = skb_dequeue(&ppp->file.rq)))
2462 kfree_skb(skb);
2463 /* wake up any process polling or blocking on read */
2464 wake_up_interruptible(&ppp->file.rwait);
2465
2466 } else {
2467 /* network protocol frame - give it to the kernel */
2468
2469#ifdef CONFIG_PPP_FILTER
2470 /* check if the packet passes the pass and active filters */
2471 /* the filter instructions are constructed assuming
2472 a four-byte PPP header on each packet */
2473 if (ppp->pass_filter || ppp->active_filter) {
2474 if (skb_unclone(skb, GFP_ATOMIC))
2475 goto err;
2476
2477 *(u8 *)skb_push(skb, 2) = 0;
2478 if (ppp->pass_filter &&
2479 bpf_prog_run(ppp->pass_filter, skb) == 0) {
2480 if (ppp->debug & 1)
2481 netdev_printk(KERN_DEBUG, ppp->dev,
2482 "PPP: inbound frame "
2483 "not passed\n");
2484 kfree_skb(skb);
2485 return;
2486 }
2487 if (!(ppp->active_filter &&
2488 bpf_prog_run(ppp->active_filter, skb) == 0))
2489 ppp->last_recv = jiffies;
2490 __skb_pull(skb, 2);
2491 } else
2492#endif /* CONFIG_PPP_FILTER */
2493 ppp->last_recv = jiffies;
2494
2495 if ((ppp->dev->flags & IFF_UP) == 0 ||
2496 ppp->npmode[npi] != NPMODE_PASS) {
2497 kfree_skb(skb);
2498 } else {
2499 /* chop off protocol */
2500 skb_pull_rcsum(skb, 2);
2501 skb->dev = ppp->dev;
2502 skb->protocol = htons(npindex_to_ethertype[npi]);
2503 skb_reset_mac_header(skb);
2504 skb_scrub_packet(skb, !net_eq(ppp->ppp_net,
2505 dev_net(ppp->dev)));
2506 netif_rx(skb);
2507 }
2508 }
2509 return;
2510
2511 err:
2512 kfree_skb(skb);
2513 ppp_receive_error(ppp);
2514}
2515
2516static struct sk_buff *
2517ppp_decompress_frame(struct ppp *ppp, struct sk_buff *skb)
2518{
2519 int proto = PPP_PROTO(skb);
2520 struct sk_buff *ns;
2521 int len;
2522
2523 /* Until we fix all the decompressor's need to make sure
2524 * data portion is linear.
2525 */
2526 if (!pskb_may_pull(skb, skb->len))
2527 goto err;
2528
2529 if (proto == PPP_COMP) {
2530 int obuff_size;
2531
2532 switch(ppp->rcomp->compress_proto) {
2533 case CI_MPPE:
2534 obuff_size = ppp->mru + PPP_HDRLEN + 1;
2535 break;
2536 default:
2537 obuff_size = ppp->mru + PPP_HDRLEN;
2538 break;
2539 }
2540
2541 ns = dev_alloc_skb(obuff_size);
2542 if (!ns) {
2543 netdev_err(ppp->dev, "ppp_decompress_frame: "
2544 "no memory\n");
2545 goto err;
2546 }
2547 /* the decompressor still expects the A/C bytes in the hdr */
2548 len = ppp->rcomp->decompress(ppp->rc_state, skb->data - 2,
2549 skb->len + 2, ns->data, obuff_size);
2550 if (len < 0) {
2551 /* Pass the compressed frame to pppd as an
2552 error indication. */
2553 if (len == DECOMP_FATALERROR)
2554 ppp->rstate |= SC_DC_FERROR;
2555 kfree_skb(ns);
2556 goto err;
2557 }
2558
2559 consume_skb(skb);
2560 skb = ns;
2561 skb_put(skb, len);
2562 skb_pull(skb, 2); /* pull off the A/C bytes */
2563
2564 /* Don't call __ppp_decompress_proto() here, but instead rely on
2565 * corresponding algo (mppe/bsd/deflate) to decompress it.
2566 */
2567 } else {
2568 /* Uncompressed frame - pass to decompressor so it
2569 can update its dictionary if necessary. */
2570 if (ppp->rcomp->incomp)
2571 ppp->rcomp->incomp(ppp->rc_state, skb->data - 2,
2572 skb->len + 2);
2573 }
2574
2575 return skb;
2576
2577 err:
2578 ppp->rstate |= SC_DC_ERROR;
2579 ppp_receive_error(ppp);
2580 return skb;
2581}
2582
2583#ifdef CONFIG_PPP_MULTILINK
2584/*
2585 * Receive a multilink frame.
2586 * We put it on the reconstruction queue and then pull off
2587 * as many completed frames as we can.
2588 */
2589static void
2590ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2591{
2592 u32 mask, seq;
2593 struct channel *ch;
2594 int mphdrlen = (ppp->flags & SC_MP_SHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
2595
2596 if (!pskb_may_pull(skb, mphdrlen + 1) || ppp->mrru == 0)
2597 goto err; /* no good, throw it away */
2598
2599 /* Decode sequence number and begin/end bits */
2600 if (ppp->flags & SC_MP_SHORTSEQ) {
2601 seq = ((skb->data[2] & 0x0f) << 8) | skb->data[3];
2602 mask = 0xfff;
2603 } else {
2604 seq = (skb->data[3] << 16) | (skb->data[4] << 8)| skb->data[5];
2605 mask = 0xffffff;
2606 }
2607 PPP_MP_CB(skb)->BEbits = skb->data[2];
2608 skb_pull(skb, mphdrlen); /* pull off PPP and MP headers */
2609
2610 /*
2611 * Do protocol ID decompression on the first fragment of each packet.
2612 * We have to do that here, because ppp_receive_nonmp_frame() expects
2613 * decompressed protocol field.
2614 */
2615 if (PPP_MP_CB(skb)->BEbits & B)
2616 __ppp_decompress_proto(skb);
2617
2618 /*
2619 * Expand sequence number to 32 bits, making it as close
2620 * as possible to ppp->minseq.
2621 */
2622 seq |= ppp->minseq & ~mask;
2623 if ((int)(ppp->minseq - seq) > (int)(mask >> 1))
2624 seq += mask + 1;
2625 else if ((int)(seq - ppp->minseq) > (int)(mask >> 1))
2626 seq -= mask + 1; /* should never happen */
2627 PPP_MP_CB(skb)->sequence = seq;
2628 pch->lastseq = seq;
2629
2630 /*
2631 * If this packet comes before the next one we were expecting,
2632 * drop it.
2633 */
2634 if (seq_before(seq, ppp->nextseq)) {
2635 kfree_skb(skb);
2636 ++ppp->dev->stats.rx_dropped;
2637 ppp_receive_error(ppp);
2638 return;
2639 }
2640
2641 /*
2642 * Reevaluate minseq, the minimum over all channels of the
2643 * last sequence number received on each channel. Because of
2644 * the increasing sequence number rule, we know that any fragment
2645 * before `minseq' which hasn't arrived is never going to arrive.
2646 * The list of channels can't change because we have the receive
2647 * side of the ppp unit locked.
2648 */
2649 list_for_each_entry(ch, &ppp->channels, clist) {
2650 if (seq_before(ch->lastseq, seq))
2651 seq = ch->lastseq;
2652 }
2653 if (seq_before(ppp->minseq, seq))
2654 ppp->minseq = seq;
2655
2656 /* Put the fragment on the reconstruction queue */
2657 ppp_mp_insert(ppp, skb);
2658
2659 /* If the queue is getting long, don't wait any longer for packets
2660 before the start of the queue. */
2661 if (skb_queue_len(&ppp->mrq) >= PPP_MP_MAX_QLEN) {
2662 struct sk_buff *mskb = skb_peek(&ppp->mrq);
2663 if (seq_before(ppp->minseq, PPP_MP_CB(mskb)->sequence))
2664 ppp->minseq = PPP_MP_CB(mskb)->sequence;
2665 }
2666
2667 /* Pull completed packets off the queue and receive them. */
2668 while ((skb = ppp_mp_reconstruct(ppp))) {
2669 if (pskb_may_pull(skb, 2))
2670 ppp_receive_nonmp_frame(ppp, skb);
2671 else {
2672 ++ppp->dev->stats.rx_length_errors;
2673 kfree_skb(skb);
2674 ppp_receive_error(ppp);
2675 }
2676 }
2677
2678 return;
2679
2680 err:
2681 kfree_skb(skb);
2682 ppp_receive_error(ppp);
2683}
2684
2685/*
2686 * Insert a fragment on the MP reconstruction queue.
2687 * The queue is ordered by increasing sequence number.
2688 */
2689static void
2690ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb)
2691{
2692 struct sk_buff *p;
2693 struct sk_buff_head *list = &ppp->mrq;
2694 u32 seq = PPP_MP_CB(skb)->sequence;
2695
2696 /* N.B. we don't need to lock the list lock because we have the
2697 ppp unit receive-side lock. */
2698 skb_queue_walk(list, p) {
2699 if (seq_before(seq, PPP_MP_CB(p)->sequence))
2700 break;
2701 }
2702 __skb_queue_before(list, p, skb);
2703}
2704
2705/*
2706 * Reconstruct a packet from the MP fragment queue.
2707 * We go through increasing sequence numbers until we find a
2708 * complete packet, or we get to the sequence number for a fragment
2709 * which hasn't arrived but might still do so.
2710 */
2711static struct sk_buff *
2712ppp_mp_reconstruct(struct ppp *ppp)
2713{
2714 u32 seq = ppp->nextseq;
2715 u32 minseq = ppp->minseq;
2716 struct sk_buff_head *list = &ppp->mrq;
2717 struct sk_buff *p, *tmp;
2718 struct sk_buff *head, *tail;
2719 struct sk_buff *skb = NULL;
2720 int lost = 0, len = 0;
2721
2722 if (ppp->mrru == 0) /* do nothing until mrru is set */
2723 return NULL;
2724 head = __skb_peek(list);
2725 tail = NULL;
2726 skb_queue_walk_safe(list, p, tmp) {
2727 again:
2728 if (seq_before(PPP_MP_CB(p)->sequence, seq)) {
2729 /* this can't happen, anyway ignore the skb */
2730 netdev_err(ppp->dev, "ppp_mp_reconstruct bad "
2731 "seq %u < %u\n",
2732 PPP_MP_CB(p)->sequence, seq);
2733 __skb_unlink(p, list);
2734 kfree_skb(p);
2735 continue;
2736 }
2737 if (PPP_MP_CB(p)->sequence != seq) {
2738 u32 oldseq;
2739 /* Fragment `seq' is missing. If it is after
2740 minseq, it might arrive later, so stop here. */
2741 if (seq_after(seq, minseq))
2742 break;
2743 /* Fragment `seq' is lost, keep going. */
2744 lost = 1;
2745 oldseq = seq;
2746 seq = seq_before(minseq, PPP_MP_CB(p)->sequence)?
2747 minseq + 1: PPP_MP_CB(p)->sequence;
2748
2749 if (ppp->debug & 1)
2750 netdev_printk(KERN_DEBUG, ppp->dev,
2751 "lost frag %u..%u\n",
2752 oldseq, seq-1);
2753
2754 goto again;
2755 }
2756
2757 /*
2758 * At this point we know that all the fragments from
2759 * ppp->nextseq to seq are either present or lost.
2760 * Also, there are no complete packets in the queue
2761 * that have no missing fragments and end before this
2762 * fragment.
2763 */
2764
2765 /* B bit set indicates this fragment starts a packet */
2766 if (PPP_MP_CB(p)->BEbits & B) {
2767 head = p;
2768 lost = 0;
2769 len = 0;
2770 }
2771
2772 len += p->len;
2773
2774 /* Got a complete packet yet? */
2775 if (lost == 0 && (PPP_MP_CB(p)->BEbits & E) &&
2776 (PPP_MP_CB(head)->BEbits & B)) {
2777 if (len > ppp->mrru + 2) {
2778 ++ppp->dev->stats.rx_length_errors;
2779 netdev_printk(KERN_DEBUG, ppp->dev,
2780 "PPP: reconstructed packet"
2781 " is too long (%d)\n", len);
2782 } else {
2783 tail = p;
2784 break;
2785 }
2786 ppp->nextseq = seq + 1;
2787 }
2788
2789 /*
2790 * If this is the ending fragment of a packet,
2791 * and we haven't found a complete valid packet yet,
2792 * we can discard up to and including this fragment.
2793 */
2794 if (PPP_MP_CB(p)->BEbits & E) {
2795 struct sk_buff *tmp2;
2796
2797 skb_queue_reverse_walk_from_safe(list, p, tmp2) {
2798 if (ppp->debug & 1)
2799 netdev_printk(KERN_DEBUG, ppp->dev,
2800 "discarding frag %u\n",
2801 PPP_MP_CB(p)->sequence);
2802 __skb_unlink(p, list);
2803 kfree_skb(p);
2804 }
2805 head = skb_peek(list);
2806 if (!head)
2807 break;
2808 }
2809 ++seq;
2810 }
2811
2812 /* If we have a complete packet, copy it all into one skb. */
2813 if (tail != NULL) {
2814 /* If we have discarded any fragments,
2815 signal a receive error. */
2816 if (PPP_MP_CB(head)->sequence != ppp->nextseq) {
2817 skb_queue_walk_safe(list, p, tmp) {
2818 if (p == head)
2819 break;
2820 if (ppp->debug & 1)
2821 netdev_printk(KERN_DEBUG, ppp->dev,
2822 "discarding frag %u\n",
2823 PPP_MP_CB(p)->sequence);
2824 __skb_unlink(p, list);
2825 kfree_skb(p);
2826 }
2827
2828 if (ppp->debug & 1)
2829 netdev_printk(KERN_DEBUG, ppp->dev,
2830 " missed pkts %u..%u\n",
2831 ppp->nextseq,
2832 PPP_MP_CB(head)->sequence-1);
2833 ++ppp->dev->stats.rx_dropped;
2834 ppp_receive_error(ppp);
2835 }
2836
2837 skb = head;
2838 if (head != tail) {
2839 struct sk_buff **fragpp = &skb_shinfo(skb)->frag_list;
2840 p = skb_queue_next(list, head);
2841 __skb_unlink(skb, list);
2842 skb_queue_walk_from_safe(list, p, tmp) {
2843 __skb_unlink(p, list);
2844 *fragpp = p;
2845 p->next = NULL;
2846 fragpp = &p->next;
2847
2848 skb->len += p->len;
2849 skb->data_len += p->len;
2850 skb->truesize += p->truesize;
2851
2852 if (p == tail)
2853 break;
2854 }
2855 } else {
2856 __skb_unlink(skb, list);
2857 }
2858
2859 ppp->nextseq = PPP_MP_CB(tail)->sequence + 1;
2860 }
2861
2862 return skb;
2863}
2864#endif /* CONFIG_PPP_MULTILINK */
2865
2866/*
2867 * Channel interface.
2868 */
2869
2870/* Create a new, unattached ppp channel. */
2871int ppp_register_channel(struct ppp_channel *chan)
2872{
2873 return ppp_register_net_channel(current->nsproxy->net_ns, chan);
2874}
2875
2876/* Create a new, unattached ppp channel for specified net. */
2877int ppp_register_net_channel(struct net *net, struct ppp_channel *chan)
2878{
2879 struct channel *pch;
2880 struct ppp_net *pn;
2881
2882 pch = kzalloc(sizeof(struct channel), GFP_KERNEL);
2883 if (!pch)
2884 return -ENOMEM;
2885
2886 pn = ppp_pernet(net);
2887
2888 pch->ppp = NULL;
2889 pch->chan = chan;
2890 pch->chan_net = get_net_track(net, &pch->ns_tracker, GFP_KERNEL);
2891 chan->ppp = pch;
2892 init_ppp_file(&pch->file, CHANNEL);
2893 pch->file.hdrlen = chan->hdrlen;
2894#ifdef CONFIG_PPP_MULTILINK
2895 pch->lastseq = -1;
2896#endif /* CONFIG_PPP_MULTILINK */
2897 init_rwsem(&pch->chan_sem);
2898 spin_lock_init(&pch->downl);
2899 rwlock_init(&pch->upl);
2900
2901 spin_lock_bh(&pn->all_channels_lock);
2902 pch->file.index = ++pn->last_channel_index;
2903 list_add(&pch->list, &pn->new_channels);
2904 atomic_inc(&channel_count);
2905 spin_unlock_bh(&pn->all_channels_lock);
2906
2907 return 0;
2908}
2909
2910/*
2911 * Return the index of a channel.
2912 */
2913int ppp_channel_index(struct ppp_channel *chan)
2914{
2915 struct channel *pch = chan->ppp;
2916
2917 if (pch)
2918 return pch->file.index;
2919 return -1;
2920}
2921
2922/*
2923 * Return the PPP unit number to which a channel is connected.
2924 */
2925int ppp_unit_number(struct ppp_channel *chan)
2926{
2927 struct channel *pch = chan->ppp;
2928 int unit = -1;
2929
2930 if (pch) {
2931 read_lock_bh(&pch->upl);
2932 if (pch->ppp)
2933 unit = pch->ppp->file.index;
2934 read_unlock_bh(&pch->upl);
2935 }
2936 return unit;
2937}
2938
2939/*
2940 * Return the PPP device interface name of a channel.
2941 */
2942char *ppp_dev_name(struct ppp_channel *chan)
2943{
2944 struct channel *pch = chan->ppp;
2945 char *name = NULL;
2946
2947 if (pch) {
2948 read_lock_bh(&pch->upl);
2949 if (pch->ppp && pch->ppp->dev)
2950 name = pch->ppp->dev->name;
2951 read_unlock_bh(&pch->upl);
2952 }
2953 return name;
2954}
2955
2956
2957/*
2958 * Disconnect a channel from the generic layer.
2959 * This must be called in process context.
2960 */
2961void
2962ppp_unregister_channel(struct ppp_channel *chan)
2963{
2964 struct channel *pch = chan->ppp;
2965 struct ppp_net *pn;
2966
2967 if (!pch)
2968 return; /* should never happen */
2969
2970 chan->ppp = NULL;
2971
2972 /*
2973 * This ensures that we have returned from any calls into
2974 * the channel's start_xmit or ioctl routine before we proceed.
2975 */
2976 down_write(&pch->chan_sem);
2977 spin_lock_bh(&pch->downl);
2978 pch->chan = NULL;
2979 spin_unlock_bh(&pch->downl);
2980 up_write(&pch->chan_sem);
2981 ppp_disconnect_channel(pch);
2982
2983 pn = ppp_pernet(pch->chan_net);
2984 spin_lock_bh(&pn->all_channels_lock);
2985 list_del(&pch->list);
2986 spin_unlock_bh(&pn->all_channels_lock);
2987
2988 ppp_unbridge_channels(pch);
2989
2990 pch->file.dead = 1;
2991 wake_up_interruptible(&pch->file.rwait);
2992
2993 if (refcount_dec_and_test(&pch->file.refcnt))
2994 ppp_destroy_channel(pch);
2995}
2996
2997/*
2998 * Callback from a channel when it can accept more to transmit.
2999 * This should be called at BH/softirq level, not interrupt level.
3000 */
3001void
3002ppp_output_wakeup(struct ppp_channel *chan)
3003{
3004 struct channel *pch = chan->ppp;
3005
3006 if (!pch)
3007 return;
3008 ppp_channel_push(pch);
3009}
3010
3011/*
3012 * Compression control.
3013 */
3014
3015/* Process the PPPIOCSCOMPRESS ioctl. */
3016static int
3017ppp_set_compress(struct ppp *ppp, struct ppp_option_data *data)
3018{
3019 int err = -EFAULT;
3020 struct compressor *cp, *ocomp;
3021 void *state, *ostate;
3022 unsigned char ccp_option[CCP_MAX_OPTION_LENGTH];
3023
3024 if (data->length > CCP_MAX_OPTION_LENGTH)
3025 goto out;
3026 if (copy_from_user(ccp_option, data->ptr, data->length))
3027 goto out;
3028
3029 err = -EINVAL;
3030 if (data->length < 2 || ccp_option[1] < 2 || ccp_option[1] > data->length)
3031 goto out;
3032
3033 cp = try_then_request_module(
3034 find_compressor(ccp_option[0]),
3035 "ppp-compress-%d", ccp_option[0]);
3036 if (!cp)
3037 goto out;
3038
3039 err = -ENOBUFS;
3040 if (data->transmit) {
3041 state = cp->comp_alloc(ccp_option, data->length);
3042 if (state) {
3043 ppp_xmit_lock(ppp);
3044 ppp->xstate &= ~SC_COMP_RUN;
3045 ocomp = ppp->xcomp;
3046 ostate = ppp->xc_state;
3047 ppp->xcomp = cp;
3048 ppp->xc_state = state;
3049 ppp_xmit_unlock(ppp);
3050 if (ostate) {
3051 ocomp->comp_free(ostate);
3052 module_put(ocomp->owner);
3053 }
3054 err = 0;
3055 } else
3056 module_put(cp->owner);
3057
3058 } else {
3059 state = cp->decomp_alloc(ccp_option, data->length);
3060 if (state) {
3061 ppp_recv_lock(ppp);
3062 ppp->rstate &= ~SC_DECOMP_RUN;
3063 ocomp = ppp->rcomp;
3064 ostate = ppp->rc_state;
3065 ppp->rcomp = cp;
3066 ppp->rc_state = state;
3067 ppp_recv_unlock(ppp);
3068 if (ostate) {
3069 ocomp->decomp_free(ostate);
3070 module_put(ocomp->owner);
3071 }
3072 err = 0;
3073 } else
3074 module_put(cp->owner);
3075 }
3076
3077 out:
3078 return err;
3079}
3080
3081/*
3082 * Look at a CCP packet and update our state accordingly.
3083 * We assume the caller has the xmit or recv path locked.
3084 */
3085static void
3086ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound)
3087{
3088 unsigned char *dp;
3089 int len;
3090
3091 if (!pskb_may_pull(skb, CCP_HDRLEN + 2))
3092 return; /* no header */
3093 dp = skb->data + 2;
3094
3095 switch (CCP_CODE(dp)) {
3096 case CCP_CONFREQ:
3097
3098 /* A ConfReq starts negotiation of compression
3099 * in one direction of transmission,
3100 * and hence brings it down...but which way?
3101 *
3102 * Remember:
3103 * A ConfReq indicates what the sender would like to receive
3104 */
3105 if(inbound)
3106 /* He is proposing what I should send */
3107 ppp->xstate &= ~SC_COMP_RUN;
3108 else
3109 /* I am proposing to what he should send */
3110 ppp->rstate &= ~SC_DECOMP_RUN;
3111
3112 break;
3113
3114 case CCP_TERMREQ:
3115 case CCP_TERMACK:
3116 /*
3117 * CCP is going down, both directions of transmission
3118 */
3119 ppp->rstate &= ~SC_DECOMP_RUN;
3120 ppp->xstate &= ~SC_COMP_RUN;
3121 break;
3122
3123 case CCP_CONFACK:
3124 if ((ppp->flags & (SC_CCP_OPEN | SC_CCP_UP)) != SC_CCP_OPEN)
3125 break;
3126 len = CCP_LENGTH(dp);
3127 if (!pskb_may_pull(skb, len + 2))
3128 return; /* too short */
3129 dp += CCP_HDRLEN;
3130 len -= CCP_HDRLEN;
3131 if (len < CCP_OPT_MINLEN || len < CCP_OPT_LENGTH(dp))
3132 break;
3133 if (inbound) {
3134 /* we will start receiving compressed packets */
3135 if (!ppp->rc_state)
3136 break;
3137 if (ppp->rcomp->decomp_init(ppp->rc_state, dp, len,
3138 ppp->file.index, 0, ppp->mru, ppp->debug)) {
3139 ppp->rstate |= SC_DECOMP_RUN;
3140 ppp->rstate &= ~(SC_DC_ERROR | SC_DC_FERROR);
3141 }
3142 } else {
3143 /* we will soon start sending compressed packets */
3144 if (!ppp->xc_state)
3145 break;
3146 if (ppp->xcomp->comp_init(ppp->xc_state, dp, len,
3147 ppp->file.index, 0, ppp->debug))
3148 ppp->xstate |= SC_COMP_RUN;
3149 }
3150 break;
3151
3152 case CCP_RESETACK:
3153 /* reset the [de]compressor */
3154 if ((ppp->flags & SC_CCP_UP) == 0)
3155 break;
3156 if (inbound) {
3157 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN)) {
3158 ppp->rcomp->decomp_reset(ppp->rc_state);
3159 ppp->rstate &= ~SC_DC_ERROR;
3160 }
3161 } else {
3162 if (ppp->xc_state && (ppp->xstate & SC_COMP_RUN))
3163 ppp->xcomp->comp_reset(ppp->xc_state);
3164 }
3165 break;
3166 }
3167}
3168
3169/* Free up compression resources. */
3170static void
3171ppp_ccp_closed(struct ppp *ppp)
3172{
3173 void *xstate, *rstate;
3174 struct compressor *xcomp, *rcomp;
3175
3176 ppp_lock(ppp);
3177 ppp->flags &= ~(SC_CCP_OPEN | SC_CCP_UP);
3178 ppp->xstate = 0;
3179 xcomp = ppp->xcomp;
3180 xstate = ppp->xc_state;
3181 ppp->xc_state = NULL;
3182 ppp->rstate = 0;
3183 rcomp = ppp->rcomp;
3184 rstate = ppp->rc_state;
3185 ppp->rc_state = NULL;
3186 ppp_unlock(ppp);
3187
3188 if (xstate) {
3189 xcomp->comp_free(xstate);
3190 module_put(xcomp->owner);
3191 }
3192 if (rstate) {
3193 rcomp->decomp_free(rstate);
3194 module_put(rcomp->owner);
3195 }
3196}
3197
3198/* List of compressors. */
3199static LIST_HEAD(compressor_list);
3200static DEFINE_SPINLOCK(compressor_list_lock);
3201
3202struct compressor_entry {
3203 struct list_head list;
3204 struct compressor *comp;
3205};
3206
3207static struct compressor_entry *
3208find_comp_entry(int proto)
3209{
3210 struct compressor_entry *ce;
3211
3212 list_for_each_entry(ce, &compressor_list, list) {
3213 if (ce->comp->compress_proto == proto)
3214 return ce;
3215 }
3216 return NULL;
3217}
3218
3219/* Register a compressor */
3220int
3221ppp_register_compressor(struct compressor *cp)
3222{
3223 struct compressor_entry *ce;
3224 int ret;
3225 spin_lock(&compressor_list_lock);
3226 ret = -EEXIST;
3227 if (find_comp_entry(cp->compress_proto))
3228 goto out;
3229 ret = -ENOMEM;
3230 ce = kmalloc(sizeof(struct compressor_entry), GFP_ATOMIC);
3231 if (!ce)
3232 goto out;
3233 ret = 0;
3234 ce->comp = cp;
3235 list_add(&ce->list, &compressor_list);
3236 out:
3237 spin_unlock(&compressor_list_lock);
3238 return ret;
3239}
3240
3241/* Unregister a compressor */
3242void
3243ppp_unregister_compressor(struct compressor *cp)
3244{
3245 struct compressor_entry *ce;
3246
3247 spin_lock(&compressor_list_lock);
3248 ce = find_comp_entry(cp->compress_proto);
3249 if (ce && ce->comp == cp) {
3250 list_del(&ce->list);
3251 kfree(ce);
3252 }
3253 spin_unlock(&compressor_list_lock);
3254}
3255
3256/* Find a compressor. */
3257static struct compressor *
3258find_compressor(int type)
3259{
3260 struct compressor_entry *ce;
3261 struct compressor *cp = NULL;
3262
3263 spin_lock(&compressor_list_lock);
3264 ce = find_comp_entry(type);
3265 if (ce) {
3266 cp = ce->comp;
3267 if (!try_module_get(cp->owner))
3268 cp = NULL;
3269 }
3270 spin_unlock(&compressor_list_lock);
3271 return cp;
3272}
3273
3274/*
3275 * Miscelleneous stuff.
3276 */
3277
3278static void
3279ppp_get_stats(struct ppp *ppp, struct ppp_stats *st)
3280{
3281 struct slcompress *vj = ppp->vj;
3282
3283 memset(st, 0, sizeof(*st));
3284 st->p.ppp_ipackets = ppp->stats64.rx_packets;
3285 st->p.ppp_ierrors = ppp->dev->stats.rx_errors;
3286 st->p.ppp_ibytes = ppp->stats64.rx_bytes;
3287 st->p.ppp_opackets = ppp->stats64.tx_packets;
3288 st->p.ppp_oerrors = ppp->dev->stats.tx_errors;
3289 st->p.ppp_obytes = ppp->stats64.tx_bytes;
3290 if (!vj)
3291 return;
3292 st->vj.vjs_packets = vj->sls_o_compressed + vj->sls_o_uncompressed;
3293 st->vj.vjs_compressed = vj->sls_o_compressed;
3294 st->vj.vjs_searches = vj->sls_o_searches;
3295 st->vj.vjs_misses = vj->sls_o_misses;
3296 st->vj.vjs_errorin = vj->sls_i_error;
3297 st->vj.vjs_tossed = vj->sls_i_tossed;
3298 st->vj.vjs_uncompressedin = vj->sls_i_uncompressed;
3299 st->vj.vjs_compressedin = vj->sls_i_compressed;
3300}
3301
3302/*
3303 * Stuff for handling the lists of ppp units and channels
3304 * and for initialization.
3305 */
3306
3307/*
3308 * Create a new ppp interface unit. Fails if it can't allocate memory
3309 * or if there is already a unit with the requested number.
3310 * unit == -1 means allocate a new number.
3311 */
3312static int ppp_create_interface(struct net *net, struct file *file, int *unit)
3313{
3314 struct ppp_config conf = {
3315 .file = file,
3316 .unit = *unit,
3317 .ifname_is_set = false,
3318 };
3319 struct net_device *dev;
3320 struct ppp *ppp;
3321 int err;
3322
3323 dev = alloc_netdev(sizeof(struct ppp), "", NET_NAME_ENUM, ppp_setup);
3324 if (!dev) {
3325 err = -ENOMEM;
3326 goto err;
3327 }
3328 dev_net_set(dev, net);
3329 dev->rtnl_link_ops = &ppp_link_ops;
3330
3331 rtnl_lock();
3332
3333 err = ppp_dev_configure(net, dev, &conf);
3334 if (err < 0)
3335 goto err_dev;
3336 ppp = netdev_priv(dev);
3337 *unit = ppp->file.index;
3338
3339 rtnl_unlock();
3340
3341 return 0;
3342
3343err_dev:
3344 rtnl_unlock();
3345 free_netdev(dev);
3346err:
3347 return err;
3348}
3349
3350/*
3351 * Initialize a ppp_file structure.
3352 */
3353static void
3354init_ppp_file(struct ppp_file *pf, int kind)
3355{
3356 pf->kind = kind;
3357 skb_queue_head_init(&pf->xq);
3358 skb_queue_head_init(&pf->rq);
3359 refcount_set(&pf->refcnt, 1);
3360 init_waitqueue_head(&pf->rwait);
3361}
3362
3363/*
3364 * Free the memory used by a ppp unit. This is only called once
3365 * there are no channels connected to the unit and no file structs
3366 * that reference the unit.
3367 */
3368static void ppp_destroy_interface(struct ppp *ppp)
3369{
3370 atomic_dec(&ppp_unit_count);
3371
3372 if (!ppp->file.dead || ppp->n_channels) {
3373 /* "can't happen" */
3374 netdev_err(ppp->dev, "ppp: destroying ppp struct %p "
3375 "but dead=%d n_channels=%d !\n",
3376 ppp, ppp->file.dead, ppp->n_channels);
3377 return;
3378 }
3379
3380 ppp_ccp_closed(ppp);
3381 if (ppp->vj) {
3382 slhc_free(ppp->vj);
3383 ppp->vj = NULL;
3384 }
3385 skb_queue_purge(&ppp->file.xq);
3386 skb_queue_purge(&ppp->file.rq);
3387#ifdef CONFIG_PPP_MULTILINK
3388 skb_queue_purge(&ppp->mrq);
3389#endif /* CONFIG_PPP_MULTILINK */
3390#ifdef CONFIG_PPP_FILTER
3391 if (ppp->pass_filter) {
3392 bpf_prog_destroy(ppp->pass_filter);
3393 ppp->pass_filter = NULL;
3394 }
3395
3396 if (ppp->active_filter) {
3397 bpf_prog_destroy(ppp->active_filter);
3398 ppp->active_filter = NULL;
3399 }
3400#endif /* CONFIG_PPP_FILTER */
3401
3402 kfree_skb(ppp->xmit_pending);
3403 free_percpu(ppp->xmit_recursion);
3404
3405 free_netdev(ppp->dev);
3406}
3407
3408/*
3409 * Locate an existing ppp unit.
3410 * The caller should have locked the all_ppp_mutex.
3411 */
3412static struct ppp *
3413ppp_find_unit(struct ppp_net *pn, int unit)
3414{
3415 return unit_find(&pn->units_idr, unit);
3416}
3417
3418/*
3419 * Locate an existing ppp channel.
3420 * The caller should have locked the all_channels_lock.
3421 * First we look in the new_channels list, then in the
3422 * all_channels list. If found in the new_channels list,
3423 * we move it to the all_channels list. This is for speed
3424 * when we have a lot of channels in use.
3425 */
3426static struct channel *
3427ppp_find_channel(struct ppp_net *pn, int unit)
3428{
3429 struct channel *pch;
3430
3431 list_for_each_entry(pch, &pn->new_channels, list) {
3432 if (pch->file.index == unit) {
3433 list_move(&pch->list, &pn->all_channels);
3434 return pch;
3435 }
3436 }
3437
3438 list_for_each_entry(pch, &pn->all_channels, list) {
3439 if (pch->file.index == unit)
3440 return pch;
3441 }
3442
3443 return NULL;
3444}
3445
3446/*
3447 * Connect a PPP channel to a PPP interface unit.
3448 */
3449static int
3450ppp_connect_channel(struct channel *pch, int unit)
3451{
3452 struct ppp *ppp;
3453 struct ppp_net *pn;
3454 int ret = -ENXIO;
3455 int hdrlen;
3456
3457 pn = ppp_pernet(pch->chan_net);
3458
3459 mutex_lock(&pn->all_ppp_mutex);
3460 ppp = ppp_find_unit(pn, unit);
3461 if (!ppp)
3462 goto out;
3463 write_lock_bh(&pch->upl);
3464 ret = -EINVAL;
3465 if (pch->ppp ||
3466 rcu_dereference_protected(pch->bridge, lockdep_is_held(&pch->upl)))
3467 goto outl;
3468
3469 ppp_lock(ppp);
3470 spin_lock_bh(&pch->downl);
3471 if (!pch->chan) {
3472 /* Don't connect unregistered channels */
3473 spin_unlock_bh(&pch->downl);
3474 ppp_unlock(ppp);
3475 ret = -ENOTCONN;
3476 goto outl;
3477 }
3478 spin_unlock_bh(&pch->downl);
3479 if (pch->file.hdrlen > ppp->file.hdrlen)
3480 ppp->file.hdrlen = pch->file.hdrlen;
3481 hdrlen = pch->file.hdrlen + 2; /* for protocol bytes */
3482 if (hdrlen > ppp->dev->hard_header_len)
3483 ppp->dev->hard_header_len = hdrlen;
3484 list_add_tail(&pch->clist, &ppp->channels);
3485 ++ppp->n_channels;
3486 pch->ppp = ppp;
3487 refcount_inc(&ppp->file.refcnt);
3488 ppp_unlock(ppp);
3489 ret = 0;
3490
3491 outl:
3492 write_unlock_bh(&pch->upl);
3493 out:
3494 mutex_unlock(&pn->all_ppp_mutex);
3495 return ret;
3496}
3497
3498/*
3499 * Disconnect a channel from its ppp unit.
3500 */
3501static int
3502ppp_disconnect_channel(struct channel *pch)
3503{
3504 struct ppp *ppp;
3505 int err = -EINVAL;
3506
3507 write_lock_bh(&pch->upl);
3508 ppp = pch->ppp;
3509 pch->ppp = NULL;
3510 write_unlock_bh(&pch->upl);
3511 if (ppp) {
3512 /* remove it from the ppp unit's list */
3513 ppp_lock(ppp);
3514 list_del(&pch->clist);
3515 if (--ppp->n_channels == 0)
3516 wake_up_interruptible(&ppp->file.rwait);
3517 ppp_unlock(ppp);
3518 if (refcount_dec_and_test(&ppp->file.refcnt))
3519 ppp_destroy_interface(ppp);
3520 err = 0;
3521 }
3522 return err;
3523}
3524
3525/*
3526 * Free up the resources used by a ppp channel.
3527 */
3528static void ppp_destroy_channel(struct channel *pch)
3529{
3530 put_net_track(pch->chan_net, &pch->ns_tracker);
3531 pch->chan_net = NULL;
3532
3533 atomic_dec(&channel_count);
3534
3535 if (!pch->file.dead) {
3536 /* "can't happen" */
3537 pr_err("ppp: destroying undead channel %p !\n", pch);
3538 return;
3539 }
3540 skb_queue_purge(&pch->file.xq);
3541 skb_queue_purge(&pch->file.rq);
3542 kfree(pch);
3543}
3544
3545static void __exit ppp_cleanup(void)
3546{
3547 /* should never happen */
3548 if (atomic_read(&ppp_unit_count) || atomic_read(&channel_count))
3549 pr_err("PPP: removing module but units remain!\n");
3550 rtnl_link_unregister(&ppp_link_ops);
3551 unregister_chrdev(PPP_MAJOR, "ppp");
3552 device_destroy(ppp_class, MKDEV(PPP_MAJOR, 0));
3553 class_destroy(ppp_class);
3554 unregister_pernet_device(&ppp_net_ops);
3555}
3556
3557/*
3558 * Units handling. Caller must protect concurrent access
3559 * by holding all_ppp_mutex
3560 */
3561
3562/* associate pointer with specified number */
3563static int unit_set(struct idr *p, void *ptr, int n)
3564{
3565 int unit;
3566
3567 unit = idr_alloc(p, ptr, n, n + 1, GFP_KERNEL);
3568 if (unit == -ENOSPC)
3569 unit = -EINVAL;
3570 return unit;
3571}
3572
3573/* get new free unit number and associate pointer with it */
3574static int unit_get(struct idr *p, void *ptr, int min)
3575{
3576 return idr_alloc(p, ptr, min, 0, GFP_KERNEL);
3577}
3578
3579/* put unit number back to a pool */
3580static void unit_put(struct idr *p, int n)
3581{
3582 idr_remove(p, n);
3583}
3584
3585/* get pointer associated with the number */
3586static void *unit_find(struct idr *p, int n)
3587{
3588 return idr_find(p, n);
3589}
3590
3591/* Module/initialization stuff */
3592
3593module_init(ppp_init);
3594module_exit(ppp_cleanup);
3595
3596EXPORT_SYMBOL(ppp_register_net_channel);
3597EXPORT_SYMBOL(ppp_register_channel);
3598EXPORT_SYMBOL(ppp_unregister_channel);
3599EXPORT_SYMBOL(ppp_channel_index);
3600EXPORT_SYMBOL(ppp_unit_number);
3601EXPORT_SYMBOL(ppp_dev_name);
3602EXPORT_SYMBOL(ppp_input);
3603EXPORT_SYMBOL(ppp_input_error);
3604EXPORT_SYMBOL(ppp_output_wakeup);
3605EXPORT_SYMBOL(ppp_register_compressor);
3606EXPORT_SYMBOL(ppp_unregister_compressor);
3607MODULE_DESCRIPTION("Generic PPP layer driver");
3608MODULE_LICENSE("GPL");
3609MODULE_ALIAS_CHARDEV(PPP_MAJOR, 0);
3610MODULE_ALIAS_RTNL_LINK("ppp");
3611MODULE_ALIAS("devname:ppp");
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * Generic PPP layer for Linux.
4 *
5 * Copyright 1999-2002 Paul Mackerras.
6 *
7 * The generic PPP layer handles the PPP network interfaces, the
8 * /dev/ppp device, packet and VJ compression, and multilink.
9 * It talks to PPP `channels' via the interface defined in
10 * include/linux/ppp_channel.h. Channels provide the basic means for
11 * sending and receiving PPP frames on some kind of communications
12 * channel.
13 *
14 * Part of the code in this driver was inspired by the old async-only
15 * PPP driver, written by Michael Callahan and Al Longyear, and
16 * subsequently hacked by Paul Mackerras.
17 *
18 * ==FILEVERSION 20041108==
19 */
20
21#include <linux/module.h>
22#include <linux/kernel.h>
23#include <linux/sched/signal.h>
24#include <linux/kmod.h>
25#include <linux/init.h>
26#include <linux/list.h>
27#include <linux/idr.h>
28#include <linux/netdevice.h>
29#include <linux/poll.h>
30#include <linux/ppp_defs.h>
31#include <linux/filter.h>
32#include <linux/ppp-ioctl.h>
33#include <linux/ppp_channel.h>
34#include <linux/ppp-comp.h>
35#include <linux/skbuff.h>
36#include <linux/rtnetlink.h>
37#include <linux/if_arp.h>
38#include <linux/ip.h>
39#include <linux/tcp.h>
40#include <linux/spinlock.h>
41#include <linux/rwsem.h>
42#include <linux/stddef.h>
43#include <linux/device.h>
44#include <linux/mutex.h>
45#include <linux/slab.h>
46#include <linux/file.h>
47#include <asm/unaligned.h>
48#include <net/slhc_vj.h>
49#include <linux/atomic.h>
50#include <linux/refcount.h>
51
52#include <linux/nsproxy.h>
53#include <net/net_namespace.h>
54#include <net/netns/generic.h>
55
56#define PPP_VERSION "2.4.2"
57
58/*
59 * Network protocols we support.
60 */
61#define NP_IP 0 /* Internet Protocol V4 */
62#define NP_IPV6 1 /* Internet Protocol V6 */
63#define NP_IPX 2 /* IPX protocol */
64#define NP_AT 3 /* Appletalk protocol */
65#define NP_MPLS_UC 4 /* MPLS unicast */
66#define NP_MPLS_MC 5 /* MPLS multicast */
67#define NUM_NP 6 /* Number of NPs. */
68
69#define MPHDRLEN 6 /* multilink protocol header length */
70#define MPHDRLEN_SSN 4 /* ditto with short sequence numbers */
71
72/*
73 * An instance of /dev/ppp can be associated with either a ppp
74 * interface unit or a ppp channel. In both cases, file->private_data
75 * points to one of these.
76 */
77struct ppp_file {
78 enum {
79 INTERFACE=1, CHANNEL
80 } kind;
81 struct sk_buff_head xq; /* pppd transmit queue */
82 struct sk_buff_head rq; /* receive queue for pppd */
83 wait_queue_head_t rwait; /* for poll on reading /dev/ppp */
84 refcount_t refcnt; /* # refs (incl /dev/ppp attached) */
85 int hdrlen; /* space to leave for headers */
86 int index; /* interface unit / channel number */
87 int dead; /* unit/channel has been shut down */
88};
89
90#define PF_TO_X(pf, X) container_of(pf, X, file)
91
92#define PF_TO_PPP(pf) PF_TO_X(pf, struct ppp)
93#define PF_TO_CHANNEL(pf) PF_TO_X(pf, struct channel)
94
95/*
96 * Data structure to hold primary network stats for which
97 * we want to use 64 bit storage. Other network stats
98 * are stored in dev->stats of the ppp strucute.
99 */
100struct ppp_link_stats {
101 u64 rx_packets;
102 u64 tx_packets;
103 u64 rx_bytes;
104 u64 tx_bytes;
105};
106
107/*
108 * Data structure describing one ppp unit.
109 * A ppp unit corresponds to a ppp network interface device
110 * and represents a multilink bundle.
111 * It can have 0 or more ppp channels connected to it.
112 */
113struct ppp {
114 struct ppp_file file; /* stuff for read/write/poll 0 */
115 struct file *owner; /* file that owns this unit 48 */
116 struct list_head channels; /* list of attached channels 4c */
117 int n_channels; /* how many channels are attached 54 */
118 spinlock_t rlock; /* lock for receive side 58 */
119 spinlock_t wlock; /* lock for transmit side 5c */
120 int __percpu *xmit_recursion; /* xmit recursion detect */
121 int mru; /* max receive unit 60 */
122 unsigned int flags; /* control bits 64 */
123 unsigned int xstate; /* transmit state bits 68 */
124 unsigned int rstate; /* receive state bits 6c */
125 int debug; /* debug flags 70 */
126 struct slcompress *vj; /* state for VJ header compression */
127 enum NPmode npmode[NUM_NP]; /* what to do with each net proto 78 */
128 struct sk_buff *xmit_pending; /* a packet ready to go out 88 */
129 struct compressor *xcomp; /* transmit packet compressor 8c */
130 void *xc_state; /* its internal state 90 */
131 struct compressor *rcomp; /* receive decompressor 94 */
132 void *rc_state; /* its internal state 98 */
133 unsigned long last_xmit; /* jiffies when last pkt sent 9c */
134 unsigned long last_recv; /* jiffies when last pkt rcvd a0 */
135 struct net_device *dev; /* network interface device a4 */
136 int closing; /* is device closing down? a8 */
137#ifdef CONFIG_PPP_MULTILINK
138 int nxchan; /* next channel to send something on */
139 u32 nxseq; /* next sequence number to send */
140 int mrru; /* MP: max reconst. receive unit */
141 u32 nextseq; /* MP: seq no of next packet */
142 u32 minseq; /* MP: min of most recent seqnos */
143 struct sk_buff_head mrq; /* MP: receive reconstruction queue */
144#endif /* CONFIG_PPP_MULTILINK */
145#ifdef CONFIG_PPP_FILTER
146 struct bpf_prog *pass_filter; /* filter for packets to pass */
147 struct bpf_prog *active_filter; /* filter for pkts to reset idle */
148#endif /* CONFIG_PPP_FILTER */
149 struct net *ppp_net; /* the net we belong to */
150 struct ppp_link_stats stats64; /* 64 bit network stats */
151};
152
153/*
154 * Bits in flags: SC_NO_TCP_CCID, SC_CCP_OPEN, SC_CCP_UP, SC_LOOP_TRAFFIC,
155 * SC_MULTILINK, SC_MP_SHORTSEQ, SC_MP_XSHORTSEQ, SC_COMP_TCP, SC_REJ_COMP_TCP,
156 * SC_MUST_COMP
157 * Bits in rstate: SC_DECOMP_RUN, SC_DC_ERROR, SC_DC_FERROR.
158 * Bits in xstate: SC_COMP_RUN
159 */
160#define SC_FLAG_BITS (SC_NO_TCP_CCID|SC_CCP_OPEN|SC_CCP_UP|SC_LOOP_TRAFFIC \
161 |SC_MULTILINK|SC_MP_SHORTSEQ|SC_MP_XSHORTSEQ \
162 |SC_COMP_TCP|SC_REJ_COMP_TCP|SC_MUST_COMP)
163
164/*
165 * Private data structure for each channel.
166 * This includes the data structure used for multilink.
167 */
168struct channel {
169 struct ppp_file file; /* stuff for read/write/poll */
170 struct list_head list; /* link in all/new_channels list */
171 struct ppp_channel *chan; /* public channel data structure */
172 struct rw_semaphore chan_sem; /* protects `chan' during chan ioctl */
173 spinlock_t downl; /* protects `chan', file.xq dequeue */
174 struct ppp *ppp; /* ppp unit we're connected to */
175 struct net *chan_net; /* the net channel belongs to */
176 struct list_head clist; /* link in list of channels per unit */
177 rwlock_t upl; /* protects `ppp' */
178#ifdef CONFIG_PPP_MULTILINK
179 u8 avail; /* flag used in multilink stuff */
180 u8 had_frag; /* >= 1 fragments have been sent */
181 u32 lastseq; /* MP: last sequence # received */
182 int speed; /* speed of the corresponding ppp channel*/
183#endif /* CONFIG_PPP_MULTILINK */
184};
185
186struct ppp_config {
187 struct file *file;
188 s32 unit;
189 bool ifname_is_set;
190};
191
192/*
193 * SMP locking issues:
194 * Both the ppp.rlock and ppp.wlock locks protect the ppp.channels
195 * list and the ppp.n_channels field, you need to take both locks
196 * before you modify them.
197 * The lock ordering is: channel.upl -> ppp.wlock -> ppp.rlock ->
198 * channel.downl.
199 */
200
201static DEFINE_MUTEX(ppp_mutex);
202static atomic_t ppp_unit_count = ATOMIC_INIT(0);
203static atomic_t channel_count = ATOMIC_INIT(0);
204
205/* per-net private data for this module */
206static unsigned int ppp_net_id __read_mostly;
207struct ppp_net {
208 /* units to ppp mapping */
209 struct idr units_idr;
210
211 /*
212 * all_ppp_mutex protects the units_idr mapping.
213 * It also ensures that finding a ppp unit in the units_idr
214 * map and updating its file.refcnt field is atomic.
215 */
216 struct mutex all_ppp_mutex;
217
218 /* channels */
219 struct list_head all_channels;
220 struct list_head new_channels;
221 int last_channel_index;
222
223 /*
224 * all_channels_lock protects all_channels and
225 * last_channel_index, and the atomicity of find
226 * a channel and updating its file.refcnt field.
227 */
228 spinlock_t all_channels_lock;
229};
230
231/* Get the PPP protocol number from a skb */
232#define PPP_PROTO(skb) get_unaligned_be16((skb)->data)
233
234/* We limit the length of ppp->file.rq to this (arbitrary) value */
235#define PPP_MAX_RQLEN 32
236
237/*
238 * Maximum number of multilink fragments queued up.
239 * This has to be large enough to cope with the maximum latency of
240 * the slowest channel relative to the others. Strictly it should
241 * depend on the number of channels and their characteristics.
242 */
243#define PPP_MP_MAX_QLEN 128
244
245/* Multilink header bits. */
246#define B 0x80 /* this fragment begins a packet */
247#define E 0x40 /* this fragment ends a packet */
248
249/* Compare multilink sequence numbers (assumed to be 32 bits wide) */
250#define seq_before(a, b) ((s32)((a) - (b)) < 0)
251#define seq_after(a, b) ((s32)((a) - (b)) > 0)
252
253/* Prototypes. */
254static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
255 struct file *file, unsigned int cmd, unsigned long arg);
256static void ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb);
257static void ppp_send_frame(struct ppp *ppp, struct sk_buff *skb);
258static void ppp_push(struct ppp *ppp);
259static void ppp_channel_push(struct channel *pch);
260static void ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb,
261 struct channel *pch);
262static void ppp_receive_error(struct ppp *ppp);
263static void ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb);
264static struct sk_buff *ppp_decompress_frame(struct ppp *ppp,
265 struct sk_buff *skb);
266#ifdef CONFIG_PPP_MULTILINK
267static void ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb,
268 struct channel *pch);
269static void ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb);
270static struct sk_buff *ppp_mp_reconstruct(struct ppp *ppp);
271static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb);
272#endif /* CONFIG_PPP_MULTILINK */
273static int ppp_set_compress(struct ppp *ppp, unsigned long arg);
274static void ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound);
275static void ppp_ccp_closed(struct ppp *ppp);
276static struct compressor *find_compressor(int type);
277static void ppp_get_stats(struct ppp *ppp, struct ppp_stats *st);
278static int ppp_create_interface(struct net *net, struct file *file, int *unit);
279static void init_ppp_file(struct ppp_file *pf, int kind);
280static void ppp_destroy_interface(struct ppp *ppp);
281static struct ppp *ppp_find_unit(struct ppp_net *pn, int unit);
282static struct channel *ppp_find_channel(struct ppp_net *pn, int unit);
283static int ppp_connect_channel(struct channel *pch, int unit);
284static int ppp_disconnect_channel(struct channel *pch);
285static void ppp_destroy_channel(struct channel *pch);
286static int unit_get(struct idr *p, void *ptr);
287static int unit_set(struct idr *p, void *ptr, int n);
288static void unit_put(struct idr *p, int n);
289static void *unit_find(struct idr *p, int n);
290static void ppp_setup(struct net_device *dev);
291
292static const struct net_device_ops ppp_netdev_ops;
293
294static struct class *ppp_class;
295
296/* per net-namespace data */
297static inline struct ppp_net *ppp_pernet(struct net *net)
298{
299 BUG_ON(!net);
300
301 return net_generic(net, ppp_net_id);
302}
303
304/* Translates a PPP protocol number to a NP index (NP == network protocol) */
305static inline int proto_to_npindex(int proto)
306{
307 switch (proto) {
308 case PPP_IP:
309 return NP_IP;
310 case PPP_IPV6:
311 return NP_IPV6;
312 case PPP_IPX:
313 return NP_IPX;
314 case PPP_AT:
315 return NP_AT;
316 case PPP_MPLS_UC:
317 return NP_MPLS_UC;
318 case PPP_MPLS_MC:
319 return NP_MPLS_MC;
320 }
321 return -EINVAL;
322}
323
324/* Translates an NP index into a PPP protocol number */
325static const int npindex_to_proto[NUM_NP] = {
326 PPP_IP,
327 PPP_IPV6,
328 PPP_IPX,
329 PPP_AT,
330 PPP_MPLS_UC,
331 PPP_MPLS_MC,
332};
333
334/* Translates an ethertype into an NP index */
335static inline int ethertype_to_npindex(int ethertype)
336{
337 switch (ethertype) {
338 case ETH_P_IP:
339 return NP_IP;
340 case ETH_P_IPV6:
341 return NP_IPV6;
342 case ETH_P_IPX:
343 return NP_IPX;
344 case ETH_P_PPPTALK:
345 case ETH_P_ATALK:
346 return NP_AT;
347 case ETH_P_MPLS_UC:
348 return NP_MPLS_UC;
349 case ETH_P_MPLS_MC:
350 return NP_MPLS_MC;
351 }
352 return -1;
353}
354
355/* Translates an NP index into an ethertype */
356static const int npindex_to_ethertype[NUM_NP] = {
357 ETH_P_IP,
358 ETH_P_IPV6,
359 ETH_P_IPX,
360 ETH_P_PPPTALK,
361 ETH_P_MPLS_UC,
362 ETH_P_MPLS_MC,
363};
364
365/*
366 * Locking shorthand.
367 */
368#define ppp_xmit_lock(ppp) spin_lock_bh(&(ppp)->wlock)
369#define ppp_xmit_unlock(ppp) spin_unlock_bh(&(ppp)->wlock)
370#define ppp_recv_lock(ppp) spin_lock_bh(&(ppp)->rlock)
371#define ppp_recv_unlock(ppp) spin_unlock_bh(&(ppp)->rlock)
372#define ppp_lock(ppp) do { ppp_xmit_lock(ppp); \
373 ppp_recv_lock(ppp); } while (0)
374#define ppp_unlock(ppp) do { ppp_recv_unlock(ppp); \
375 ppp_xmit_unlock(ppp); } while (0)
376
377/*
378 * /dev/ppp device routines.
379 * The /dev/ppp device is used by pppd to control the ppp unit.
380 * It supports the read, write, ioctl and poll functions.
381 * Open instances of /dev/ppp can be in one of three states:
382 * unattached, attached to a ppp unit, or attached to a ppp channel.
383 */
384static int ppp_open(struct inode *inode, struct file *file)
385{
386 /*
387 * This could (should?) be enforced by the permissions on /dev/ppp.
388 */
389 if (!ns_capable(file->f_cred->user_ns, CAP_NET_ADMIN))
390 return -EPERM;
391 return 0;
392}
393
394static int ppp_release(struct inode *unused, struct file *file)
395{
396 struct ppp_file *pf = file->private_data;
397 struct ppp *ppp;
398
399 if (pf) {
400 file->private_data = NULL;
401 if (pf->kind == INTERFACE) {
402 ppp = PF_TO_PPP(pf);
403 rtnl_lock();
404 if (file == ppp->owner)
405 unregister_netdevice(ppp->dev);
406 rtnl_unlock();
407 }
408 if (refcount_dec_and_test(&pf->refcnt)) {
409 switch (pf->kind) {
410 case INTERFACE:
411 ppp_destroy_interface(PF_TO_PPP(pf));
412 break;
413 case CHANNEL:
414 ppp_destroy_channel(PF_TO_CHANNEL(pf));
415 break;
416 }
417 }
418 }
419 return 0;
420}
421
422static ssize_t ppp_read(struct file *file, char __user *buf,
423 size_t count, loff_t *ppos)
424{
425 struct ppp_file *pf = file->private_data;
426 DECLARE_WAITQUEUE(wait, current);
427 ssize_t ret;
428 struct sk_buff *skb = NULL;
429 struct iovec iov;
430 struct iov_iter to;
431
432 ret = count;
433
434 if (!pf)
435 return -ENXIO;
436 add_wait_queue(&pf->rwait, &wait);
437 for (;;) {
438 set_current_state(TASK_INTERRUPTIBLE);
439 skb = skb_dequeue(&pf->rq);
440 if (skb)
441 break;
442 ret = 0;
443 if (pf->dead)
444 break;
445 if (pf->kind == INTERFACE) {
446 /*
447 * Return 0 (EOF) on an interface that has no
448 * channels connected, unless it is looping
449 * network traffic (demand mode).
450 */
451 struct ppp *ppp = PF_TO_PPP(pf);
452
453 ppp_recv_lock(ppp);
454 if (ppp->n_channels == 0 &&
455 (ppp->flags & SC_LOOP_TRAFFIC) == 0) {
456 ppp_recv_unlock(ppp);
457 break;
458 }
459 ppp_recv_unlock(ppp);
460 }
461 ret = -EAGAIN;
462 if (file->f_flags & O_NONBLOCK)
463 break;
464 ret = -ERESTARTSYS;
465 if (signal_pending(current))
466 break;
467 schedule();
468 }
469 set_current_state(TASK_RUNNING);
470 remove_wait_queue(&pf->rwait, &wait);
471
472 if (!skb)
473 goto out;
474
475 ret = -EOVERFLOW;
476 if (skb->len > count)
477 goto outf;
478 ret = -EFAULT;
479 iov.iov_base = buf;
480 iov.iov_len = count;
481 iov_iter_init(&to, READ, &iov, 1, count);
482 if (skb_copy_datagram_iter(skb, 0, &to, skb->len))
483 goto outf;
484 ret = skb->len;
485
486 outf:
487 kfree_skb(skb);
488 out:
489 return ret;
490}
491
492static ssize_t ppp_write(struct file *file, const char __user *buf,
493 size_t count, loff_t *ppos)
494{
495 struct ppp_file *pf = file->private_data;
496 struct sk_buff *skb;
497 ssize_t ret;
498
499 if (!pf)
500 return -ENXIO;
501 ret = -ENOMEM;
502 skb = alloc_skb(count + pf->hdrlen, GFP_KERNEL);
503 if (!skb)
504 goto out;
505 skb_reserve(skb, pf->hdrlen);
506 ret = -EFAULT;
507 if (copy_from_user(skb_put(skb, count), buf, count)) {
508 kfree_skb(skb);
509 goto out;
510 }
511
512 switch (pf->kind) {
513 case INTERFACE:
514 ppp_xmit_process(PF_TO_PPP(pf), skb);
515 break;
516 case CHANNEL:
517 skb_queue_tail(&pf->xq, skb);
518 ppp_channel_push(PF_TO_CHANNEL(pf));
519 break;
520 }
521
522 ret = count;
523
524 out:
525 return ret;
526}
527
528/* No kernel lock - fine */
529static __poll_t ppp_poll(struct file *file, poll_table *wait)
530{
531 struct ppp_file *pf = file->private_data;
532 __poll_t mask;
533
534 if (!pf)
535 return 0;
536 poll_wait(file, &pf->rwait, wait);
537 mask = EPOLLOUT | EPOLLWRNORM;
538 if (skb_peek(&pf->rq))
539 mask |= EPOLLIN | EPOLLRDNORM;
540 if (pf->dead)
541 mask |= EPOLLHUP;
542 else if (pf->kind == INTERFACE) {
543 /* see comment in ppp_read */
544 struct ppp *ppp = PF_TO_PPP(pf);
545
546 ppp_recv_lock(ppp);
547 if (ppp->n_channels == 0 &&
548 (ppp->flags & SC_LOOP_TRAFFIC) == 0)
549 mask |= EPOLLIN | EPOLLRDNORM;
550 ppp_recv_unlock(ppp);
551 }
552
553 return mask;
554}
555
556#ifdef CONFIG_PPP_FILTER
557static int get_filter(void __user *arg, struct sock_filter **p)
558{
559 struct sock_fprog uprog;
560 struct sock_filter *code = NULL;
561 int len;
562
563 if (copy_from_user(&uprog, arg, sizeof(uprog)))
564 return -EFAULT;
565
566 if (!uprog.len) {
567 *p = NULL;
568 return 0;
569 }
570
571 len = uprog.len * sizeof(struct sock_filter);
572 code = memdup_user(uprog.filter, len);
573 if (IS_ERR(code))
574 return PTR_ERR(code);
575
576 *p = code;
577 return uprog.len;
578}
579#endif /* CONFIG_PPP_FILTER */
580
581static long ppp_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
582{
583 struct ppp_file *pf;
584 struct ppp *ppp;
585 int err = -EFAULT, val, val2, i;
586 struct ppp_idle idle;
587 struct npioctl npi;
588 int unit, cflags;
589 struct slcompress *vj;
590 void __user *argp = (void __user *)arg;
591 int __user *p = argp;
592
593 mutex_lock(&ppp_mutex);
594
595 pf = file->private_data;
596 if (!pf) {
597 err = ppp_unattached_ioctl(current->nsproxy->net_ns,
598 pf, file, cmd, arg);
599 goto out;
600 }
601
602 if (cmd == PPPIOCDETACH) {
603 /*
604 * PPPIOCDETACH is no longer supported as it was heavily broken,
605 * and is only known to have been used by pppd older than
606 * ppp-2.4.2 (released November 2003).
607 */
608 pr_warn_once("%s (%d) used obsolete PPPIOCDETACH ioctl\n",
609 current->comm, current->pid);
610 err = -EINVAL;
611 goto out;
612 }
613
614 if (pf->kind == CHANNEL) {
615 struct channel *pch;
616 struct ppp_channel *chan;
617
618 pch = PF_TO_CHANNEL(pf);
619
620 switch (cmd) {
621 case PPPIOCCONNECT:
622 if (get_user(unit, p))
623 break;
624 err = ppp_connect_channel(pch, unit);
625 break;
626
627 case PPPIOCDISCONN:
628 err = ppp_disconnect_channel(pch);
629 break;
630
631 default:
632 down_read(&pch->chan_sem);
633 chan = pch->chan;
634 err = -ENOTTY;
635 if (chan && chan->ops->ioctl)
636 err = chan->ops->ioctl(chan, cmd, arg);
637 up_read(&pch->chan_sem);
638 }
639 goto out;
640 }
641
642 if (pf->kind != INTERFACE) {
643 /* can't happen */
644 pr_err("PPP: not interface or channel??\n");
645 err = -EINVAL;
646 goto out;
647 }
648
649 ppp = PF_TO_PPP(pf);
650 switch (cmd) {
651 case PPPIOCSMRU:
652 if (get_user(val, p))
653 break;
654 ppp->mru = val;
655 err = 0;
656 break;
657
658 case PPPIOCSFLAGS:
659 if (get_user(val, p))
660 break;
661 ppp_lock(ppp);
662 cflags = ppp->flags & ~val;
663#ifdef CONFIG_PPP_MULTILINK
664 if (!(ppp->flags & SC_MULTILINK) && (val & SC_MULTILINK))
665 ppp->nextseq = 0;
666#endif
667 ppp->flags = val & SC_FLAG_BITS;
668 ppp_unlock(ppp);
669 if (cflags & SC_CCP_OPEN)
670 ppp_ccp_closed(ppp);
671 err = 0;
672 break;
673
674 case PPPIOCGFLAGS:
675 val = ppp->flags | ppp->xstate | ppp->rstate;
676 if (put_user(val, p))
677 break;
678 err = 0;
679 break;
680
681 case PPPIOCSCOMPRESS:
682 err = ppp_set_compress(ppp, arg);
683 break;
684
685 case PPPIOCGUNIT:
686 if (put_user(ppp->file.index, p))
687 break;
688 err = 0;
689 break;
690
691 case PPPIOCSDEBUG:
692 if (get_user(val, p))
693 break;
694 ppp->debug = val;
695 err = 0;
696 break;
697
698 case PPPIOCGDEBUG:
699 if (put_user(ppp->debug, p))
700 break;
701 err = 0;
702 break;
703
704 case PPPIOCGIDLE:
705 idle.xmit_idle = (jiffies - ppp->last_xmit) / HZ;
706 idle.recv_idle = (jiffies - ppp->last_recv) / HZ;
707 if (copy_to_user(argp, &idle, sizeof(idle)))
708 break;
709 err = 0;
710 break;
711
712 case PPPIOCSMAXCID:
713 if (get_user(val, p))
714 break;
715 val2 = 15;
716 if ((val >> 16) != 0) {
717 val2 = val >> 16;
718 val &= 0xffff;
719 }
720 vj = slhc_init(val2+1, val+1);
721 if (IS_ERR(vj)) {
722 err = PTR_ERR(vj);
723 break;
724 }
725 ppp_lock(ppp);
726 if (ppp->vj)
727 slhc_free(ppp->vj);
728 ppp->vj = vj;
729 ppp_unlock(ppp);
730 err = 0;
731 break;
732
733 case PPPIOCGNPMODE:
734 case PPPIOCSNPMODE:
735 if (copy_from_user(&npi, argp, sizeof(npi)))
736 break;
737 err = proto_to_npindex(npi.protocol);
738 if (err < 0)
739 break;
740 i = err;
741 if (cmd == PPPIOCGNPMODE) {
742 err = -EFAULT;
743 npi.mode = ppp->npmode[i];
744 if (copy_to_user(argp, &npi, sizeof(npi)))
745 break;
746 } else {
747 ppp->npmode[i] = npi.mode;
748 /* we may be able to transmit more packets now (??) */
749 netif_wake_queue(ppp->dev);
750 }
751 err = 0;
752 break;
753
754#ifdef CONFIG_PPP_FILTER
755 case PPPIOCSPASS:
756 {
757 struct sock_filter *code;
758
759 err = get_filter(argp, &code);
760 if (err >= 0) {
761 struct bpf_prog *pass_filter = NULL;
762 struct sock_fprog_kern fprog = {
763 .len = err,
764 .filter = code,
765 };
766
767 err = 0;
768 if (fprog.filter)
769 err = bpf_prog_create(&pass_filter, &fprog);
770 if (!err) {
771 ppp_lock(ppp);
772 if (ppp->pass_filter)
773 bpf_prog_destroy(ppp->pass_filter);
774 ppp->pass_filter = pass_filter;
775 ppp_unlock(ppp);
776 }
777 kfree(code);
778 }
779 break;
780 }
781 case PPPIOCSACTIVE:
782 {
783 struct sock_filter *code;
784
785 err = get_filter(argp, &code);
786 if (err >= 0) {
787 struct bpf_prog *active_filter = NULL;
788 struct sock_fprog_kern fprog = {
789 .len = err,
790 .filter = code,
791 };
792
793 err = 0;
794 if (fprog.filter)
795 err = bpf_prog_create(&active_filter, &fprog);
796 if (!err) {
797 ppp_lock(ppp);
798 if (ppp->active_filter)
799 bpf_prog_destroy(ppp->active_filter);
800 ppp->active_filter = active_filter;
801 ppp_unlock(ppp);
802 }
803 kfree(code);
804 }
805 break;
806 }
807#endif /* CONFIG_PPP_FILTER */
808
809#ifdef CONFIG_PPP_MULTILINK
810 case PPPIOCSMRRU:
811 if (get_user(val, p))
812 break;
813 ppp_recv_lock(ppp);
814 ppp->mrru = val;
815 ppp_recv_unlock(ppp);
816 err = 0;
817 break;
818#endif /* CONFIG_PPP_MULTILINK */
819
820 default:
821 err = -ENOTTY;
822 }
823
824out:
825 mutex_unlock(&ppp_mutex);
826
827 return err;
828}
829
830static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
831 struct file *file, unsigned int cmd, unsigned long arg)
832{
833 int unit, err = -EFAULT;
834 struct ppp *ppp;
835 struct channel *chan;
836 struct ppp_net *pn;
837 int __user *p = (int __user *)arg;
838
839 switch (cmd) {
840 case PPPIOCNEWUNIT:
841 /* Create a new ppp unit */
842 if (get_user(unit, p))
843 break;
844 err = ppp_create_interface(net, file, &unit);
845 if (err < 0)
846 break;
847
848 err = -EFAULT;
849 if (put_user(unit, p))
850 break;
851 err = 0;
852 break;
853
854 case PPPIOCATTACH:
855 /* Attach to an existing ppp unit */
856 if (get_user(unit, p))
857 break;
858 err = -ENXIO;
859 pn = ppp_pernet(net);
860 mutex_lock(&pn->all_ppp_mutex);
861 ppp = ppp_find_unit(pn, unit);
862 if (ppp) {
863 refcount_inc(&ppp->file.refcnt);
864 file->private_data = &ppp->file;
865 err = 0;
866 }
867 mutex_unlock(&pn->all_ppp_mutex);
868 break;
869
870 case PPPIOCATTCHAN:
871 if (get_user(unit, p))
872 break;
873 err = -ENXIO;
874 pn = ppp_pernet(net);
875 spin_lock_bh(&pn->all_channels_lock);
876 chan = ppp_find_channel(pn, unit);
877 if (chan) {
878 refcount_inc(&chan->file.refcnt);
879 file->private_data = &chan->file;
880 err = 0;
881 }
882 spin_unlock_bh(&pn->all_channels_lock);
883 break;
884
885 default:
886 err = -ENOTTY;
887 }
888
889 return err;
890}
891
892static const struct file_operations ppp_device_fops = {
893 .owner = THIS_MODULE,
894 .read = ppp_read,
895 .write = ppp_write,
896 .poll = ppp_poll,
897 .unlocked_ioctl = ppp_ioctl,
898 .open = ppp_open,
899 .release = ppp_release,
900 .llseek = noop_llseek,
901};
902
903static __net_init int ppp_init_net(struct net *net)
904{
905 struct ppp_net *pn = net_generic(net, ppp_net_id);
906
907 idr_init(&pn->units_idr);
908 mutex_init(&pn->all_ppp_mutex);
909
910 INIT_LIST_HEAD(&pn->all_channels);
911 INIT_LIST_HEAD(&pn->new_channels);
912
913 spin_lock_init(&pn->all_channels_lock);
914
915 return 0;
916}
917
918static __net_exit void ppp_exit_net(struct net *net)
919{
920 struct ppp_net *pn = net_generic(net, ppp_net_id);
921 struct net_device *dev;
922 struct net_device *aux;
923 struct ppp *ppp;
924 LIST_HEAD(list);
925 int id;
926
927 rtnl_lock();
928 for_each_netdev_safe(net, dev, aux) {
929 if (dev->netdev_ops == &ppp_netdev_ops)
930 unregister_netdevice_queue(dev, &list);
931 }
932
933 idr_for_each_entry(&pn->units_idr, ppp, id)
934 /* Skip devices already unregistered by previous loop */
935 if (!net_eq(dev_net(ppp->dev), net))
936 unregister_netdevice_queue(ppp->dev, &list);
937
938 unregister_netdevice_many(&list);
939 rtnl_unlock();
940
941 mutex_destroy(&pn->all_ppp_mutex);
942 idr_destroy(&pn->units_idr);
943 WARN_ON_ONCE(!list_empty(&pn->all_channels));
944 WARN_ON_ONCE(!list_empty(&pn->new_channels));
945}
946
947static struct pernet_operations ppp_net_ops = {
948 .init = ppp_init_net,
949 .exit = ppp_exit_net,
950 .id = &ppp_net_id,
951 .size = sizeof(struct ppp_net),
952};
953
954static int ppp_unit_register(struct ppp *ppp, int unit, bool ifname_is_set)
955{
956 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
957 int ret;
958
959 mutex_lock(&pn->all_ppp_mutex);
960
961 if (unit < 0) {
962 ret = unit_get(&pn->units_idr, ppp);
963 if (ret < 0)
964 goto err;
965 } else {
966 /* Caller asked for a specific unit number. Fail with -EEXIST
967 * if unavailable. For backward compatibility, return -EEXIST
968 * too if idr allocation fails; this makes pppd retry without
969 * requesting a specific unit number.
970 */
971 if (unit_find(&pn->units_idr, unit)) {
972 ret = -EEXIST;
973 goto err;
974 }
975 ret = unit_set(&pn->units_idr, ppp, unit);
976 if (ret < 0) {
977 /* Rewrite error for backward compatibility */
978 ret = -EEXIST;
979 goto err;
980 }
981 }
982 ppp->file.index = ret;
983
984 if (!ifname_is_set)
985 snprintf(ppp->dev->name, IFNAMSIZ, "ppp%i", ppp->file.index);
986
987 mutex_unlock(&pn->all_ppp_mutex);
988
989 ret = register_netdevice(ppp->dev);
990 if (ret < 0)
991 goto err_unit;
992
993 atomic_inc(&ppp_unit_count);
994
995 return 0;
996
997err_unit:
998 mutex_lock(&pn->all_ppp_mutex);
999 unit_put(&pn->units_idr, ppp->file.index);
1000err:
1001 mutex_unlock(&pn->all_ppp_mutex);
1002
1003 return ret;
1004}
1005
1006static int ppp_dev_configure(struct net *src_net, struct net_device *dev,
1007 const struct ppp_config *conf)
1008{
1009 struct ppp *ppp = netdev_priv(dev);
1010 int indx;
1011 int err;
1012 int cpu;
1013
1014 ppp->dev = dev;
1015 ppp->ppp_net = src_net;
1016 ppp->mru = PPP_MRU;
1017 ppp->owner = conf->file;
1018
1019 init_ppp_file(&ppp->file, INTERFACE);
1020 ppp->file.hdrlen = PPP_HDRLEN - 2; /* don't count proto bytes */
1021
1022 for (indx = 0; indx < NUM_NP; ++indx)
1023 ppp->npmode[indx] = NPMODE_PASS;
1024 INIT_LIST_HEAD(&ppp->channels);
1025 spin_lock_init(&ppp->rlock);
1026 spin_lock_init(&ppp->wlock);
1027
1028 ppp->xmit_recursion = alloc_percpu(int);
1029 if (!ppp->xmit_recursion) {
1030 err = -ENOMEM;
1031 goto err1;
1032 }
1033 for_each_possible_cpu(cpu)
1034 (*per_cpu_ptr(ppp->xmit_recursion, cpu)) = 0;
1035
1036#ifdef CONFIG_PPP_MULTILINK
1037 ppp->minseq = -1;
1038 skb_queue_head_init(&ppp->mrq);
1039#endif /* CONFIG_PPP_MULTILINK */
1040#ifdef CONFIG_PPP_FILTER
1041 ppp->pass_filter = NULL;
1042 ppp->active_filter = NULL;
1043#endif /* CONFIG_PPP_FILTER */
1044
1045 err = ppp_unit_register(ppp, conf->unit, conf->ifname_is_set);
1046 if (err < 0)
1047 goto err2;
1048
1049 conf->file->private_data = &ppp->file;
1050
1051 return 0;
1052err2:
1053 free_percpu(ppp->xmit_recursion);
1054err1:
1055 return err;
1056}
1057
1058static const struct nla_policy ppp_nl_policy[IFLA_PPP_MAX + 1] = {
1059 [IFLA_PPP_DEV_FD] = { .type = NLA_S32 },
1060};
1061
1062static int ppp_nl_validate(struct nlattr *tb[], struct nlattr *data[],
1063 struct netlink_ext_ack *extack)
1064{
1065 if (!data)
1066 return -EINVAL;
1067
1068 if (!data[IFLA_PPP_DEV_FD])
1069 return -EINVAL;
1070 if (nla_get_s32(data[IFLA_PPP_DEV_FD]) < 0)
1071 return -EBADF;
1072
1073 return 0;
1074}
1075
1076static int ppp_nl_newlink(struct net *src_net, struct net_device *dev,
1077 struct nlattr *tb[], struct nlattr *data[],
1078 struct netlink_ext_ack *extack)
1079{
1080 struct ppp_config conf = {
1081 .unit = -1,
1082 .ifname_is_set = true,
1083 };
1084 struct file *file;
1085 int err;
1086
1087 file = fget(nla_get_s32(data[IFLA_PPP_DEV_FD]));
1088 if (!file)
1089 return -EBADF;
1090
1091 /* rtnl_lock is already held here, but ppp_create_interface() locks
1092 * ppp_mutex before holding rtnl_lock. Using mutex_trylock() avoids
1093 * possible deadlock due to lock order inversion, at the cost of
1094 * pushing the problem back to userspace.
1095 */
1096 if (!mutex_trylock(&ppp_mutex)) {
1097 err = -EBUSY;
1098 goto out;
1099 }
1100
1101 if (file->f_op != &ppp_device_fops || file->private_data) {
1102 err = -EBADF;
1103 goto out_unlock;
1104 }
1105
1106 conf.file = file;
1107
1108 /* Don't use device name generated by the rtnetlink layer when ifname
1109 * isn't specified. Let ppp_dev_configure() set the device name using
1110 * the PPP unit identifer as suffix (i.e. ppp<unit_id>). This allows
1111 * userspace to infer the device name using to the PPPIOCGUNIT ioctl.
1112 */
1113 if (!tb[IFLA_IFNAME])
1114 conf.ifname_is_set = false;
1115
1116 err = ppp_dev_configure(src_net, dev, &conf);
1117
1118out_unlock:
1119 mutex_unlock(&ppp_mutex);
1120out:
1121 fput(file);
1122
1123 return err;
1124}
1125
1126static void ppp_nl_dellink(struct net_device *dev, struct list_head *head)
1127{
1128 unregister_netdevice_queue(dev, head);
1129}
1130
1131static size_t ppp_nl_get_size(const struct net_device *dev)
1132{
1133 return 0;
1134}
1135
1136static int ppp_nl_fill_info(struct sk_buff *skb, const struct net_device *dev)
1137{
1138 return 0;
1139}
1140
1141static struct net *ppp_nl_get_link_net(const struct net_device *dev)
1142{
1143 struct ppp *ppp = netdev_priv(dev);
1144
1145 return ppp->ppp_net;
1146}
1147
1148static struct rtnl_link_ops ppp_link_ops __read_mostly = {
1149 .kind = "ppp",
1150 .maxtype = IFLA_PPP_MAX,
1151 .policy = ppp_nl_policy,
1152 .priv_size = sizeof(struct ppp),
1153 .setup = ppp_setup,
1154 .validate = ppp_nl_validate,
1155 .newlink = ppp_nl_newlink,
1156 .dellink = ppp_nl_dellink,
1157 .get_size = ppp_nl_get_size,
1158 .fill_info = ppp_nl_fill_info,
1159 .get_link_net = ppp_nl_get_link_net,
1160};
1161
1162#define PPP_MAJOR 108
1163
1164/* Called at boot time if ppp is compiled into the kernel,
1165 or at module load time (from init_module) if compiled as a module. */
1166static int __init ppp_init(void)
1167{
1168 int err;
1169
1170 pr_info("PPP generic driver version " PPP_VERSION "\n");
1171
1172 err = register_pernet_device(&ppp_net_ops);
1173 if (err) {
1174 pr_err("failed to register PPP pernet device (%d)\n", err);
1175 goto out;
1176 }
1177
1178 err = register_chrdev(PPP_MAJOR, "ppp", &ppp_device_fops);
1179 if (err) {
1180 pr_err("failed to register PPP device (%d)\n", err);
1181 goto out_net;
1182 }
1183
1184 ppp_class = class_create(THIS_MODULE, "ppp");
1185 if (IS_ERR(ppp_class)) {
1186 err = PTR_ERR(ppp_class);
1187 goto out_chrdev;
1188 }
1189
1190 err = rtnl_link_register(&ppp_link_ops);
1191 if (err) {
1192 pr_err("failed to register rtnetlink PPP handler\n");
1193 goto out_class;
1194 }
1195
1196 /* not a big deal if we fail here :-) */
1197 device_create(ppp_class, NULL, MKDEV(PPP_MAJOR, 0), NULL, "ppp");
1198
1199 return 0;
1200
1201out_class:
1202 class_destroy(ppp_class);
1203out_chrdev:
1204 unregister_chrdev(PPP_MAJOR, "ppp");
1205out_net:
1206 unregister_pernet_device(&ppp_net_ops);
1207out:
1208 return err;
1209}
1210
1211/*
1212 * Network interface unit routines.
1213 */
1214static netdev_tx_t
1215ppp_start_xmit(struct sk_buff *skb, struct net_device *dev)
1216{
1217 struct ppp *ppp = netdev_priv(dev);
1218 int npi, proto;
1219 unsigned char *pp;
1220
1221 npi = ethertype_to_npindex(ntohs(skb->protocol));
1222 if (npi < 0)
1223 goto outf;
1224
1225 /* Drop, accept or reject the packet */
1226 switch (ppp->npmode[npi]) {
1227 case NPMODE_PASS:
1228 break;
1229 case NPMODE_QUEUE:
1230 /* it would be nice to have a way to tell the network
1231 system to queue this one up for later. */
1232 goto outf;
1233 case NPMODE_DROP:
1234 case NPMODE_ERROR:
1235 goto outf;
1236 }
1237
1238 /* Put the 2-byte PPP protocol number on the front,
1239 making sure there is room for the address and control fields. */
1240 if (skb_cow_head(skb, PPP_HDRLEN))
1241 goto outf;
1242
1243 pp = skb_push(skb, 2);
1244 proto = npindex_to_proto[npi];
1245 put_unaligned_be16(proto, pp);
1246
1247 skb_scrub_packet(skb, !net_eq(ppp->ppp_net, dev_net(dev)));
1248 ppp_xmit_process(ppp, skb);
1249
1250 return NETDEV_TX_OK;
1251
1252 outf:
1253 kfree_skb(skb);
1254 ++dev->stats.tx_dropped;
1255 return NETDEV_TX_OK;
1256}
1257
1258static int
1259ppp_net_ioctl(struct net_device *dev, struct ifreq *ifr, int cmd)
1260{
1261 struct ppp *ppp = netdev_priv(dev);
1262 int err = -EFAULT;
1263 void __user *addr = (void __user *) ifr->ifr_ifru.ifru_data;
1264 struct ppp_stats stats;
1265 struct ppp_comp_stats cstats;
1266 char *vers;
1267
1268 switch (cmd) {
1269 case SIOCGPPPSTATS:
1270 ppp_get_stats(ppp, &stats);
1271 if (copy_to_user(addr, &stats, sizeof(stats)))
1272 break;
1273 err = 0;
1274 break;
1275
1276 case SIOCGPPPCSTATS:
1277 memset(&cstats, 0, sizeof(cstats));
1278 if (ppp->xc_state)
1279 ppp->xcomp->comp_stat(ppp->xc_state, &cstats.c);
1280 if (ppp->rc_state)
1281 ppp->rcomp->decomp_stat(ppp->rc_state, &cstats.d);
1282 if (copy_to_user(addr, &cstats, sizeof(cstats)))
1283 break;
1284 err = 0;
1285 break;
1286
1287 case SIOCGPPPVER:
1288 vers = PPP_VERSION;
1289 if (copy_to_user(addr, vers, strlen(vers) + 1))
1290 break;
1291 err = 0;
1292 break;
1293
1294 default:
1295 err = -EINVAL;
1296 }
1297
1298 return err;
1299}
1300
1301static void
1302ppp_get_stats64(struct net_device *dev, struct rtnl_link_stats64 *stats64)
1303{
1304 struct ppp *ppp = netdev_priv(dev);
1305
1306 ppp_recv_lock(ppp);
1307 stats64->rx_packets = ppp->stats64.rx_packets;
1308 stats64->rx_bytes = ppp->stats64.rx_bytes;
1309 ppp_recv_unlock(ppp);
1310
1311 ppp_xmit_lock(ppp);
1312 stats64->tx_packets = ppp->stats64.tx_packets;
1313 stats64->tx_bytes = ppp->stats64.tx_bytes;
1314 ppp_xmit_unlock(ppp);
1315
1316 stats64->rx_errors = dev->stats.rx_errors;
1317 stats64->tx_errors = dev->stats.tx_errors;
1318 stats64->rx_dropped = dev->stats.rx_dropped;
1319 stats64->tx_dropped = dev->stats.tx_dropped;
1320 stats64->rx_length_errors = dev->stats.rx_length_errors;
1321}
1322
1323static int ppp_dev_init(struct net_device *dev)
1324{
1325 struct ppp *ppp;
1326
1327 ppp = netdev_priv(dev);
1328 /* Let the netdevice take a reference on the ppp file. This ensures
1329 * that ppp_destroy_interface() won't run before the device gets
1330 * unregistered.
1331 */
1332 refcount_inc(&ppp->file.refcnt);
1333
1334 return 0;
1335}
1336
1337static void ppp_dev_uninit(struct net_device *dev)
1338{
1339 struct ppp *ppp = netdev_priv(dev);
1340 struct ppp_net *pn = ppp_pernet(ppp->ppp_net);
1341
1342 ppp_lock(ppp);
1343 ppp->closing = 1;
1344 ppp_unlock(ppp);
1345
1346 mutex_lock(&pn->all_ppp_mutex);
1347 unit_put(&pn->units_idr, ppp->file.index);
1348 mutex_unlock(&pn->all_ppp_mutex);
1349
1350 ppp->owner = NULL;
1351
1352 ppp->file.dead = 1;
1353 wake_up_interruptible(&ppp->file.rwait);
1354}
1355
1356static void ppp_dev_priv_destructor(struct net_device *dev)
1357{
1358 struct ppp *ppp;
1359
1360 ppp = netdev_priv(dev);
1361 if (refcount_dec_and_test(&ppp->file.refcnt))
1362 ppp_destroy_interface(ppp);
1363}
1364
1365static const struct net_device_ops ppp_netdev_ops = {
1366 .ndo_init = ppp_dev_init,
1367 .ndo_uninit = ppp_dev_uninit,
1368 .ndo_start_xmit = ppp_start_xmit,
1369 .ndo_do_ioctl = ppp_net_ioctl,
1370 .ndo_get_stats64 = ppp_get_stats64,
1371};
1372
1373static struct device_type ppp_type = {
1374 .name = "ppp",
1375};
1376
1377static void ppp_setup(struct net_device *dev)
1378{
1379 dev->netdev_ops = &ppp_netdev_ops;
1380 SET_NETDEV_DEVTYPE(dev, &ppp_type);
1381
1382 dev->features |= NETIF_F_LLTX;
1383
1384 dev->hard_header_len = PPP_HDRLEN;
1385 dev->mtu = PPP_MRU;
1386 dev->addr_len = 0;
1387 dev->tx_queue_len = 3;
1388 dev->type = ARPHRD_PPP;
1389 dev->flags = IFF_POINTOPOINT | IFF_NOARP | IFF_MULTICAST;
1390 dev->priv_destructor = ppp_dev_priv_destructor;
1391 netif_keep_dst(dev);
1392}
1393
1394/*
1395 * Transmit-side routines.
1396 */
1397
1398/* Called to do any work queued up on the transmit side that can now be done */
1399static void __ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1400{
1401 ppp_xmit_lock(ppp);
1402 if (!ppp->closing) {
1403 ppp_push(ppp);
1404
1405 if (skb)
1406 skb_queue_tail(&ppp->file.xq, skb);
1407 while (!ppp->xmit_pending &&
1408 (skb = skb_dequeue(&ppp->file.xq)))
1409 ppp_send_frame(ppp, skb);
1410 /* If there's no work left to do, tell the core net
1411 code that we can accept some more. */
1412 if (!ppp->xmit_pending && !skb_peek(&ppp->file.xq))
1413 netif_wake_queue(ppp->dev);
1414 else
1415 netif_stop_queue(ppp->dev);
1416 } else {
1417 kfree_skb(skb);
1418 }
1419 ppp_xmit_unlock(ppp);
1420}
1421
1422static void ppp_xmit_process(struct ppp *ppp, struct sk_buff *skb)
1423{
1424 local_bh_disable();
1425
1426 if (unlikely(*this_cpu_ptr(ppp->xmit_recursion)))
1427 goto err;
1428
1429 (*this_cpu_ptr(ppp->xmit_recursion))++;
1430 __ppp_xmit_process(ppp, skb);
1431 (*this_cpu_ptr(ppp->xmit_recursion))--;
1432
1433 local_bh_enable();
1434
1435 return;
1436
1437err:
1438 local_bh_enable();
1439
1440 kfree_skb(skb);
1441
1442 if (net_ratelimit())
1443 netdev_err(ppp->dev, "recursion detected\n");
1444}
1445
1446static inline struct sk_buff *
1447pad_compress_skb(struct ppp *ppp, struct sk_buff *skb)
1448{
1449 struct sk_buff *new_skb;
1450 int len;
1451 int new_skb_size = ppp->dev->mtu +
1452 ppp->xcomp->comp_extra + ppp->dev->hard_header_len;
1453 int compressor_skb_size = ppp->dev->mtu +
1454 ppp->xcomp->comp_extra + PPP_HDRLEN;
1455 new_skb = alloc_skb(new_skb_size, GFP_ATOMIC);
1456 if (!new_skb) {
1457 if (net_ratelimit())
1458 netdev_err(ppp->dev, "PPP: no memory (comp pkt)\n");
1459 return NULL;
1460 }
1461 if (ppp->dev->hard_header_len > PPP_HDRLEN)
1462 skb_reserve(new_skb,
1463 ppp->dev->hard_header_len - PPP_HDRLEN);
1464
1465 /* compressor still expects A/C bytes in hdr */
1466 len = ppp->xcomp->compress(ppp->xc_state, skb->data - 2,
1467 new_skb->data, skb->len + 2,
1468 compressor_skb_size);
1469 if (len > 0 && (ppp->flags & SC_CCP_UP)) {
1470 consume_skb(skb);
1471 skb = new_skb;
1472 skb_put(skb, len);
1473 skb_pull(skb, 2); /* pull off A/C bytes */
1474 } else if (len == 0) {
1475 /* didn't compress, or CCP not up yet */
1476 consume_skb(new_skb);
1477 new_skb = skb;
1478 } else {
1479 /*
1480 * (len < 0)
1481 * MPPE requires that we do not send unencrypted
1482 * frames. The compressor will return -1 if we
1483 * should drop the frame. We cannot simply test
1484 * the compress_proto because MPPE and MPPC share
1485 * the same number.
1486 */
1487 if (net_ratelimit())
1488 netdev_err(ppp->dev, "ppp: compressor dropped pkt\n");
1489 kfree_skb(skb);
1490 consume_skb(new_skb);
1491 new_skb = NULL;
1492 }
1493 return new_skb;
1494}
1495
1496/*
1497 * Compress and send a frame.
1498 * The caller should have locked the xmit path,
1499 * and xmit_pending should be 0.
1500 */
1501static void
1502ppp_send_frame(struct ppp *ppp, struct sk_buff *skb)
1503{
1504 int proto = PPP_PROTO(skb);
1505 struct sk_buff *new_skb;
1506 int len;
1507 unsigned char *cp;
1508
1509 if (proto < 0x8000) {
1510#ifdef CONFIG_PPP_FILTER
1511 /* check if we should pass this packet */
1512 /* the filter instructions are constructed assuming
1513 a four-byte PPP header on each packet */
1514 *(u8 *)skb_push(skb, 2) = 1;
1515 if (ppp->pass_filter &&
1516 BPF_PROG_RUN(ppp->pass_filter, skb) == 0) {
1517 if (ppp->debug & 1)
1518 netdev_printk(KERN_DEBUG, ppp->dev,
1519 "PPP: outbound frame "
1520 "not passed\n");
1521 kfree_skb(skb);
1522 return;
1523 }
1524 /* if this packet passes the active filter, record the time */
1525 if (!(ppp->active_filter &&
1526 BPF_PROG_RUN(ppp->active_filter, skb) == 0))
1527 ppp->last_xmit = jiffies;
1528 skb_pull(skb, 2);
1529#else
1530 /* for data packets, record the time */
1531 ppp->last_xmit = jiffies;
1532#endif /* CONFIG_PPP_FILTER */
1533 }
1534
1535 ++ppp->stats64.tx_packets;
1536 ppp->stats64.tx_bytes += skb->len - 2;
1537
1538 switch (proto) {
1539 case PPP_IP:
1540 if (!ppp->vj || (ppp->flags & SC_COMP_TCP) == 0)
1541 break;
1542 /* try to do VJ TCP header compression */
1543 new_skb = alloc_skb(skb->len + ppp->dev->hard_header_len - 2,
1544 GFP_ATOMIC);
1545 if (!new_skb) {
1546 netdev_err(ppp->dev, "PPP: no memory (VJ comp pkt)\n");
1547 goto drop;
1548 }
1549 skb_reserve(new_skb, ppp->dev->hard_header_len - 2);
1550 cp = skb->data + 2;
1551 len = slhc_compress(ppp->vj, cp, skb->len - 2,
1552 new_skb->data + 2, &cp,
1553 !(ppp->flags & SC_NO_TCP_CCID));
1554 if (cp == skb->data + 2) {
1555 /* didn't compress */
1556 consume_skb(new_skb);
1557 } else {
1558 if (cp[0] & SL_TYPE_COMPRESSED_TCP) {
1559 proto = PPP_VJC_COMP;
1560 cp[0] &= ~SL_TYPE_COMPRESSED_TCP;
1561 } else {
1562 proto = PPP_VJC_UNCOMP;
1563 cp[0] = skb->data[2];
1564 }
1565 consume_skb(skb);
1566 skb = new_skb;
1567 cp = skb_put(skb, len + 2);
1568 cp[0] = 0;
1569 cp[1] = proto;
1570 }
1571 break;
1572
1573 case PPP_CCP:
1574 /* peek at outbound CCP frames */
1575 ppp_ccp_peek(ppp, skb, 0);
1576 break;
1577 }
1578
1579 /* try to do packet compression */
1580 if ((ppp->xstate & SC_COMP_RUN) && ppp->xc_state &&
1581 proto != PPP_LCP && proto != PPP_CCP) {
1582 if (!(ppp->flags & SC_CCP_UP) && (ppp->flags & SC_MUST_COMP)) {
1583 if (net_ratelimit())
1584 netdev_err(ppp->dev,
1585 "ppp: compression required but "
1586 "down - pkt dropped.\n");
1587 goto drop;
1588 }
1589 skb = pad_compress_skb(ppp, skb);
1590 if (!skb)
1591 goto drop;
1592 }
1593
1594 /*
1595 * If we are waiting for traffic (demand dialling),
1596 * queue it up for pppd to receive.
1597 */
1598 if (ppp->flags & SC_LOOP_TRAFFIC) {
1599 if (ppp->file.rq.qlen > PPP_MAX_RQLEN)
1600 goto drop;
1601 skb_queue_tail(&ppp->file.rq, skb);
1602 wake_up_interruptible(&ppp->file.rwait);
1603 return;
1604 }
1605
1606 ppp->xmit_pending = skb;
1607 ppp_push(ppp);
1608 return;
1609
1610 drop:
1611 kfree_skb(skb);
1612 ++ppp->dev->stats.tx_errors;
1613}
1614
1615/*
1616 * Try to send the frame in xmit_pending.
1617 * The caller should have the xmit path locked.
1618 */
1619static void
1620ppp_push(struct ppp *ppp)
1621{
1622 struct list_head *list;
1623 struct channel *pch;
1624 struct sk_buff *skb = ppp->xmit_pending;
1625
1626 if (!skb)
1627 return;
1628
1629 list = &ppp->channels;
1630 if (list_empty(list)) {
1631 /* nowhere to send the packet, just drop it */
1632 ppp->xmit_pending = NULL;
1633 kfree_skb(skb);
1634 return;
1635 }
1636
1637 if ((ppp->flags & SC_MULTILINK) == 0) {
1638 /* not doing multilink: send it down the first channel */
1639 list = list->next;
1640 pch = list_entry(list, struct channel, clist);
1641
1642 spin_lock(&pch->downl);
1643 if (pch->chan) {
1644 if (pch->chan->ops->start_xmit(pch->chan, skb))
1645 ppp->xmit_pending = NULL;
1646 } else {
1647 /* channel got unregistered */
1648 kfree_skb(skb);
1649 ppp->xmit_pending = NULL;
1650 }
1651 spin_unlock(&pch->downl);
1652 return;
1653 }
1654
1655#ifdef CONFIG_PPP_MULTILINK
1656 /* Multilink: fragment the packet over as many links
1657 as can take the packet at the moment. */
1658 if (!ppp_mp_explode(ppp, skb))
1659 return;
1660#endif /* CONFIG_PPP_MULTILINK */
1661
1662 ppp->xmit_pending = NULL;
1663 kfree_skb(skb);
1664}
1665
1666#ifdef CONFIG_PPP_MULTILINK
1667static bool mp_protocol_compress __read_mostly = true;
1668module_param(mp_protocol_compress, bool, 0644);
1669MODULE_PARM_DESC(mp_protocol_compress,
1670 "compress protocol id in multilink fragments");
1671
1672/*
1673 * Divide a packet to be transmitted into fragments and
1674 * send them out the individual links.
1675 */
1676static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb)
1677{
1678 int len, totlen;
1679 int i, bits, hdrlen, mtu;
1680 int flen;
1681 int navail, nfree, nzero;
1682 int nbigger;
1683 int totspeed;
1684 int totfree;
1685 unsigned char *p, *q;
1686 struct list_head *list;
1687 struct channel *pch;
1688 struct sk_buff *frag;
1689 struct ppp_channel *chan;
1690
1691 totspeed = 0; /*total bitrate of the bundle*/
1692 nfree = 0; /* # channels which have no packet already queued */
1693 navail = 0; /* total # of usable channels (not deregistered) */
1694 nzero = 0; /* number of channels with zero speed associated*/
1695 totfree = 0; /*total # of channels available and
1696 *having no queued packets before
1697 *starting the fragmentation*/
1698
1699 hdrlen = (ppp->flags & SC_MP_XSHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1700 i = 0;
1701 list_for_each_entry(pch, &ppp->channels, clist) {
1702 if (pch->chan) {
1703 pch->avail = 1;
1704 navail++;
1705 pch->speed = pch->chan->speed;
1706 } else {
1707 pch->avail = 0;
1708 }
1709 if (pch->avail) {
1710 if (skb_queue_empty(&pch->file.xq) ||
1711 !pch->had_frag) {
1712 if (pch->speed == 0)
1713 nzero++;
1714 else
1715 totspeed += pch->speed;
1716
1717 pch->avail = 2;
1718 ++nfree;
1719 ++totfree;
1720 }
1721 if (!pch->had_frag && i < ppp->nxchan)
1722 ppp->nxchan = i;
1723 }
1724 ++i;
1725 }
1726 /*
1727 * Don't start sending this packet unless at least half of
1728 * the channels are free. This gives much better TCP
1729 * performance if we have a lot of channels.
1730 */
1731 if (nfree == 0 || nfree < navail / 2)
1732 return 0; /* can't take now, leave it in xmit_pending */
1733
1734 /* Do protocol field compression */
1735 p = skb->data;
1736 len = skb->len;
1737 if (*p == 0 && mp_protocol_compress) {
1738 ++p;
1739 --len;
1740 }
1741
1742 totlen = len;
1743 nbigger = len % nfree;
1744
1745 /* skip to the channel after the one we last used
1746 and start at that one */
1747 list = &ppp->channels;
1748 for (i = 0; i < ppp->nxchan; ++i) {
1749 list = list->next;
1750 if (list == &ppp->channels) {
1751 i = 0;
1752 break;
1753 }
1754 }
1755
1756 /* create a fragment for each channel */
1757 bits = B;
1758 while (len > 0) {
1759 list = list->next;
1760 if (list == &ppp->channels) {
1761 i = 0;
1762 continue;
1763 }
1764 pch = list_entry(list, struct channel, clist);
1765 ++i;
1766 if (!pch->avail)
1767 continue;
1768
1769 /*
1770 * Skip this channel if it has a fragment pending already and
1771 * we haven't given a fragment to all of the free channels.
1772 */
1773 if (pch->avail == 1) {
1774 if (nfree > 0)
1775 continue;
1776 } else {
1777 pch->avail = 1;
1778 }
1779
1780 /* check the channel's mtu and whether it is still attached. */
1781 spin_lock(&pch->downl);
1782 if (pch->chan == NULL) {
1783 /* can't use this channel, it's being deregistered */
1784 if (pch->speed == 0)
1785 nzero--;
1786 else
1787 totspeed -= pch->speed;
1788
1789 spin_unlock(&pch->downl);
1790 pch->avail = 0;
1791 totlen = len;
1792 totfree--;
1793 nfree--;
1794 if (--navail == 0)
1795 break;
1796 continue;
1797 }
1798
1799 /*
1800 *if the channel speed is not set divide
1801 *the packet evenly among the free channels;
1802 *otherwise divide it according to the speed
1803 *of the channel we are going to transmit on
1804 */
1805 flen = len;
1806 if (nfree > 0) {
1807 if (pch->speed == 0) {
1808 flen = len/nfree;
1809 if (nbigger > 0) {
1810 flen++;
1811 nbigger--;
1812 }
1813 } else {
1814 flen = (((totfree - nzero)*(totlen + hdrlen*totfree)) /
1815 ((totspeed*totfree)/pch->speed)) - hdrlen;
1816 if (nbigger > 0) {
1817 flen += ((totfree - nzero)*pch->speed)/totspeed;
1818 nbigger -= ((totfree - nzero)*pch->speed)/
1819 totspeed;
1820 }
1821 }
1822 nfree--;
1823 }
1824
1825 /*
1826 *check if we are on the last channel or
1827 *we exceded the length of the data to
1828 *fragment
1829 */
1830 if ((nfree <= 0) || (flen > len))
1831 flen = len;
1832 /*
1833 *it is not worth to tx on slow channels:
1834 *in that case from the resulting flen according to the
1835 *above formula will be equal or less than zero.
1836 *Skip the channel in this case
1837 */
1838 if (flen <= 0) {
1839 pch->avail = 2;
1840 spin_unlock(&pch->downl);
1841 continue;
1842 }
1843
1844 /*
1845 * hdrlen includes the 2-byte PPP protocol field, but the
1846 * MTU counts only the payload excluding the protocol field.
1847 * (RFC1661 Section 2)
1848 */
1849 mtu = pch->chan->mtu - (hdrlen - 2);
1850 if (mtu < 4)
1851 mtu = 4;
1852 if (flen > mtu)
1853 flen = mtu;
1854 if (flen == len)
1855 bits |= E;
1856 frag = alloc_skb(flen + hdrlen + (flen == 0), GFP_ATOMIC);
1857 if (!frag)
1858 goto noskb;
1859 q = skb_put(frag, flen + hdrlen);
1860
1861 /* make the MP header */
1862 put_unaligned_be16(PPP_MP, q);
1863 if (ppp->flags & SC_MP_XSHORTSEQ) {
1864 q[2] = bits + ((ppp->nxseq >> 8) & 0xf);
1865 q[3] = ppp->nxseq;
1866 } else {
1867 q[2] = bits;
1868 q[3] = ppp->nxseq >> 16;
1869 q[4] = ppp->nxseq >> 8;
1870 q[5] = ppp->nxseq;
1871 }
1872
1873 memcpy(q + hdrlen, p, flen);
1874
1875 /* try to send it down the channel */
1876 chan = pch->chan;
1877 if (!skb_queue_empty(&pch->file.xq) ||
1878 !chan->ops->start_xmit(chan, frag))
1879 skb_queue_tail(&pch->file.xq, frag);
1880 pch->had_frag = 1;
1881 p += flen;
1882 len -= flen;
1883 ++ppp->nxseq;
1884 bits = 0;
1885 spin_unlock(&pch->downl);
1886 }
1887 ppp->nxchan = i;
1888
1889 return 1;
1890
1891 noskb:
1892 spin_unlock(&pch->downl);
1893 if (ppp->debug & 1)
1894 netdev_err(ppp->dev, "PPP: no memory (fragment)\n");
1895 ++ppp->dev->stats.tx_errors;
1896 ++ppp->nxseq;
1897 return 1; /* abandon the frame */
1898}
1899#endif /* CONFIG_PPP_MULTILINK */
1900
1901/* Try to send data out on a channel */
1902static void __ppp_channel_push(struct channel *pch)
1903{
1904 struct sk_buff *skb;
1905 struct ppp *ppp;
1906
1907 spin_lock(&pch->downl);
1908 if (pch->chan) {
1909 while (!skb_queue_empty(&pch->file.xq)) {
1910 skb = skb_dequeue(&pch->file.xq);
1911 if (!pch->chan->ops->start_xmit(pch->chan, skb)) {
1912 /* put the packet back and try again later */
1913 skb_queue_head(&pch->file.xq, skb);
1914 break;
1915 }
1916 }
1917 } else {
1918 /* channel got deregistered */
1919 skb_queue_purge(&pch->file.xq);
1920 }
1921 spin_unlock(&pch->downl);
1922 /* see if there is anything from the attached unit to be sent */
1923 if (skb_queue_empty(&pch->file.xq)) {
1924 ppp = pch->ppp;
1925 if (ppp)
1926 __ppp_xmit_process(ppp, NULL);
1927 }
1928}
1929
1930static void ppp_channel_push(struct channel *pch)
1931{
1932 read_lock_bh(&pch->upl);
1933 if (pch->ppp) {
1934 (*this_cpu_ptr(pch->ppp->xmit_recursion))++;
1935 __ppp_channel_push(pch);
1936 (*this_cpu_ptr(pch->ppp->xmit_recursion))--;
1937 } else {
1938 __ppp_channel_push(pch);
1939 }
1940 read_unlock_bh(&pch->upl);
1941}
1942
1943/*
1944 * Receive-side routines.
1945 */
1946
1947struct ppp_mp_skb_parm {
1948 u32 sequence;
1949 u8 BEbits;
1950};
1951#define PPP_MP_CB(skb) ((struct ppp_mp_skb_parm *)((skb)->cb))
1952
1953static inline void
1954ppp_do_recv(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1955{
1956 ppp_recv_lock(ppp);
1957 if (!ppp->closing)
1958 ppp_receive_frame(ppp, skb, pch);
1959 else
1960 kfree_skb(skb);
1961 ppp_recv_unlock(ppp);
1962}
1963
1964/**
1965 * __ppp_decompress_proto - Decompress protocol field, slim version.
1966 * @skb: Socket buffer where protocol field should be decompressed. It must have
1967 * at least 1 byte of head room and 1 byte of linear data. First byte of
1968 * data must be a protocol field byte.
1969 *
1970 * Decompress protocol field in PPP header if it's compressed, e.g. when
1971 * Protocol-Field-Compression (PFC) was negotiated. No checks w.r.t. skb data
1972 * length are done in this function.
1973 */
1974static void __ppp_decompress_proto(struct sk_buff *skb)
1975{
1976 if (skb->data[0] & 0x01)
1977 *(u8 *)skb_push(skb, 1) = 0x00;
1978}
1979
1980/**
1981 * ppp_decompress_proto - Check skb data room and decompress protocol field.
1982 * @skb: Socket buffer where protocol field should be decompressed. First byte
1983 * of data must be a protocol field byte.
1984 *
1985 * Decompress protocol field in PPP header if it's compressed, e.g. when
1986 * Protocol-Field-Compression (PFC) was negotiated. This function also makes
1987 * sure that skb data room is sufficient for Protocol field, before and after
1988 * decompression.
1989 *
1990 * Return: true - decompressed successfully, false - not enough room in skb.
1991 */
1992static bool ppp_decompress_proto(struct sk_buff *skb)
1993{
1994 /* At least one byte should be present (if protocol is compressed) */
1995 if (!pskb_may_pull(skb, 1))
1996 return false;
1997
1998 __ppp_decompress_proto(skb);
1999
2000 /* Protocol field should occupy 2 bytes when not compressed */
2001 return pskb_may_pull(skb, 2);
2002}
2003
2004void
2005ppp_input(struct ppp_channel *chan, struct sk_buff *skb)
2006{
2007 struct channel *pch = chan->ppp;
2008 int proto;
2009
2010 if (!pch) {
2011 kfree_skb(skb);
2012 return;
2013 }
2014
2015 read_lock_bh(&pch->upl);
2016 if (!ppp_decompress_proto(skb)) {
2017 kfree_skb(skb);
2018 if (pch->ppp) {
2019 ++pch->ppp->dev->stats.rx_length_errors;
2020 ppp_receive_error(pch->ppp);
2021 }
2022 goto done;
2023 }
2024
2025 proto = PPP_PROTO(skb);
2026 if (!pch->ppp || proto >= 0xc000 || proto == PPP_CCPFRAG) {
2027 /* put it on the channel queue */
2028 skb_queue_tail(&pch->file.rq, skb);
2029 /* drop old frames if queue too long */
2030 while (pch->file.rq.qlen > PPP_MAX_RQLEN &&
2031 (skb = skb_dequeue(&pch->file.rq)))
2032 kfree_skb(skb);
2033 wake_up_interruptible(&pch->file.rwait);
2034 } else {
2035 ppp_do_recv(pch->ppp, skb, pch);
2036 }
2037
2038done:
2039 read_unlock_bh(&pch->upl);
2040}
2041
2042/* Put a 0-length skb in the receive queue as an error indication */
2043void
2044ppp_input_error(struct ppp_channel *chan, int code)
2045{
2046 struct channel *pch = chan->ppp;
2047 struct sk_buff *skb;
2048
2049 if (!pch)
2050 return;
2051
2052 read_lock_bh(&pch->upl);
2053 if (pch->ppp) {
2054 skb = alloc_skb(0, GFP_ATOMIC);
2055 if (skb) {
2056 skb->len = 0; /* probably unnecessary */
2057 skb->cb[0] = code;
2058 ppp_do_recv(pch->ppp, skb, pch);
2059 }
2060 }
2061 read_unlock_bh(&pch->upl);
2062}
2063
2064/*
2065 * We come in here to process a received frame.
2066 * The receive side of the ppp unit is locked.
2067 */
2068static void
2069ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2070{
2071 /* note: a 0-length skb is used as an error indication */
2072 if (skb->len > 0) {
2073 skb_checksum_complete_unset(skb);
2074#ifdef CONFIG_PPP_MULTILINK
2075 /* XXX do channel-level decompression here */
2076 if (PPP_PROTO(skb) == PPP_MP)
2077 ppp_receive_mp_frame(ppp, skb, pch);
2078 else
2079#endif /* CONFIG_PPP_MULTILINK */
2080 ppp_receive_nonmp_frame(ppp, skb);
2081 } else {
2082 kfree_skb(skb);
2083 ppp_receive_error(ppp);
2084 }
2085}
2086
2087static void
2088ppp_receive_error(struct ppp *ppp)
2089{
2090 ++ppp->dev->stats.rx_errors;
2091 if (ppp->vj)
2092 slhc_toss(ppp->vj);
2093}
2094
2095static void
2096ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb)
2097{
2098 struct sk_buff *ns;
2099 int proto, len, npi;
2100
2101 /*
2102 * Decompress the frame, if compressed.
2103 * Note that some decompressors need to see uncompressed frames
2104 * that come in as well as compressed frames.
2105 */
2106 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN) &&
2107 (ppp->rstate & (SC_DC_FERROR | SC_DC_ERROR)) == 0)
2108 skb = ppp_decompress_frame(ppp, skb);
2109
2110 if (ppp->flags & SC_MUST_COMP && ppp->rstate & SC_DC_FERROR)
2111 goto err;
2112
2113 /* At this point the "Protocol" field MUST be decompressed, either in
2114 * ppp_input(), ppp_decompress_frame() or in ppp_receive_mp_frame().
2115 */
2116 proto = PPP_PROTO(skb);
2117 switch (proto) {
2118 case PPP_VJC_COMP:
2119 /* decompress VJ compressed packets */
2120 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2121 goto err;
2122
2123 if (skb_tailroom(skb) < 124 || skb_cloned(skb)) {
2124 /* copy to a new sk_buff with more tailroom */
2125 ns = dev_alloc_skb(skb->len + 128);
2126 if (!ns) {
2127 netdev_err(ppp->dev, "PPP: no memory "
2128 "(VJ decomp)\n");
2129 goto err;
2130 }
2131 skb_reserve(ns, 2);
2132 skb_copy_bits(skb, 0, skb_put(ns, skb->len), skb->len);
2133 consume_skb(skb);
2134 skb = ns;
2135 }
2136 else
2137 skb->ip_summed = CHECKSUM_NONE;
2138
2139 len = slhc_uncompress(ppp->vj, skb->data + 2, skb->len - 2);
2140 if (len <= 0) {
2141 netdev_printk(KERN_DEBUG, ppp->dev,
2142 "PPP: VJ decompression error\n");
2143 goto err;
2144 }
2145 len += 2;
2146 if (len > skb->len)
2147 skb_put(skb, len - skb->len);
2148 else if (len < skb->len)
2149 skb_trim(skb, len);
2150 proto = PPP_IP;
2151 break;
2152
2153 case PPP_VJC_UNCOMP:
2154 if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
2155 goto err;
2156
2157 /* Until we fix the decompressor need to make sure
2158 * data portion is linear.
2159 */
2160 if (!pskb_may_pull(skb, skb->len))
2161 goto err;
2162
2163 if (slhc_remember(ppp->vj, skb->data + 2, skb->len - 2) <= 0) {
2164 netdev_err(ppp->dev, "PPP: VJ uncompressed error\n");
2165 goto err;
2166 }
2167 proto = PPP_IP;
2168 break;
2169
2170 case PPP_CCP:
2171 ppp_ccp_peek(ppp, skb, 1);
2172 break;
2173 }
2174
2175 ++ppp->stats64.rx_packets;
2176 ppp->stats64.rx_bytes += skb->len - 2;
2177
2178 npi = proto_to_npindex(proto);
2179 if (npi < 0) {
2180 /* control or unknown frame - pass it to pppd */
2181 skb_queue_tail(&ppp->file.rq, skb);
2182 /* limit queue length by dropping old frames */
2183 while (ppp->file.rq.qlen > PPP_MAX_RQLEN &&
2184 (skb = skb_dequeue(&ppp->file.rq)))
2185 kfree_skb(skb);
2186 /* wake up any process polling or blocking on read */
2187 wake_up_interruptible(&ppp->file.rwait);
2188
2189 } else {
2190 /* network protocol frame - give it to the kernel */
2191
2192#ifdef CONFIG_PPP_FILTER
2193 /* check if the packet passes the pass and active filters */
2194 /* the filter instructions are constructed assuming
2195 a four-byte PPP header on each packet */
2196 if (ppp->pass_filter || ppp->active_filter) {
2197 if (skb_unclone(skb, GFP_ATOMIC))
2198 goto err;
2199
2200 *(u8 *)skb_push(skb, 2) = 0;
2201 if (ppp->pass_filter &&
2202 BPF_PROG_RUN(ppp->pass_filter, skb) == 0) {
2203 if (ppp->debug & 1)
2204 netdev_printk(KERN_DEBUG, ppp->dev,
2205 "PPP: inbound frame "
2206 "not passed\n");
2207 kfree_skb(skb);
2208 return;
2209 }
2210 if (!(ppp->active_filter &&
2211 BPF_PROG_RUN(ppp->active_filter, skb) == 0))
2212 ppp->last_recv = jiffies;
2213 __skb_pull(skb, 2);
2214 } else
2215#endif /* CONFIG_PPP_FILTER */
2216 ppp->last_recv = jiffies;
2217
2218 if ((ppp->dev->flags & IFF_UP) == 0 ||
2219 ppp->npmode[npi] != NPMODE_PASS) {
2220 kfree_skb(skb);
2221 } else {
2222 /* chop off protocol */
2223 skb_pull_rcsum(skb, 2);
2224 skb->dev = ppp->dev;
2225 skb->protocol = htons(npindex_to_ethertype[npi]);
2226 skb_reset_mac_header(skb);
2227 skb_scrub_packet(skb, !net_eq(ppp->ppp_net,
2228 dev_net(ppp->dev)));
2229 netif_rx(skb);
2230 }
2231 }
2232 return;
2233
2234 err:
2235 kfree_skb(skb);
2236 ppp_receive_error(ppp);
2237}
2238
2239static struct sk_buff *
2240ppp_decompress_frame(struct ppp *ppp, struct sk_buff *skb)
2241{
2242 int proto = PPP_PROTO(skb);
2243 struct sk_buff *ns;
2244 int len;
2245
2246 /* Until we fix all the decompressor's need to make sure
2247 * data portion is linear.
2248 */
2249 if (!pskb_may_pull(skb, skb->len))
2250 goto err;
2251
2252 if (proto == PPP_COMP) {
2253 int obuff_size;
2254
2255 switch(ppp->rcomp->compress_proto) {
2256 case CI_MPPE:
2257 obuff_size = ppp->mru + PPP_HDRLEN + 1;
2258 break;
2259 default:
2260 obuff_size = ppp->mru + PPP_HDRLEN;
2261 break;
2262 }
2263
2264 ns = dev_alloc_skb(obuff_size);
2265 if (!ns) {
2266 netdev_err(ppp->dev, "ppp_decompress_frame: "
2267 "no memory\n");
2268 goto err;
2269 }
2270 /* the decompressor still expects the A/C bytes in the hdr */
2271 len = ppp->rcomp->decompress(ppp->rc_state, skb->data - 2,
2272 skb->len + 2, ns->data, obuff_size);
2273 if (len < 0) {
2274 /* Pass the compressed frame to pppd as an
2275 error indication. */
2276 if (len == DECOMP_FATALERROR)
2277 ppp->rstate |= SC_DC_FERROR;
2278 kfree_skb(ns);
2279 goto err;
2280 }
2281
2282 consume_skb(skb);
2283 skb = ns;
2284 skb_put(skb, len);
2285 skb_pull(skb, 2); /* pull off the A/C bytes */
2286
2287 /* Don't call __ppp_decompress_proto() here, but instead rely on
2288 * corresponding algo (mppe/bsd/deflate) to decompress it.
2289 */
2290 } else {
2291 /* Uncompressed frame - pass to decompressor so it
2292 can update its dictionary if necessary. */
2293 if (ppp->rcomp->incomp)
2294 ppp->rcomp->incomp(ppp->rc_state, skb->data - 2,
2295 skb->len + 2);
2296 }
2297
2298 return skb;
2299
2300 err:
2301 ppp->rstate |= SC_DC_ERROR;
2302 ppp_receive_error(ppp);
2303 return skb;
2304}
2305
2306#ifdef CONFIG_PPP_MULTILINK
2307/*
2308 * Receive a multilink frame.
2309 * We put it on the reconstruction queue and then pull off
2310 * as many completed frames as we can.
2311 */
2312static void
2313ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
2314{
2315 u32 mask, seq;
2316 struct channel *ch;
2317 int mphdrlen = (ppp->flags & SC_MP_SHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
2318
2319 if (!pskb_may_pull(skb, mphdrlen + 1) || ppp->mrru == 0)
2320 goto err; /* no good, throw it away */
2321
2322 /* Decode sequence number and begin/end bits */
2323 if (ppp->flags & SC_MP_SHORTSEQ) {
2324 seq = ((skb->data[2] & 0x0f) << 8) | skb->data[3];
2325 mask = 0xfff;
2326 } else {
2327 seq = (skb->data[3] << 16) | (skb->data[4] << 8)| skb->data[5];
2328 mask = 0xffffff;
2329 }
2330 PPP_MP_CB(skb)->BEbits = skb->data[2];
2331 skb_pull(skb, mphdrlen); /* pull off PPP and MP headers */
2332
2333 /*
2334 * Do protocol ID decompression on the first fragment of each packet.
2335 * We have to do that here, because ppp_receive_nonmp_frame() expects
2336 * decompressed protocol field.
2337 */
2338 if (PPP_MP_CB(skb)->BEbits & B)
2339 __ppp_decompress_proto(skb);
2340
2341 /*
2342 * Expand sequence number to 32 bits, making it as close
2343 * as possible to ppp->minseq.
2344 */
2345 seq |= ppp->minseq & ~mask;
2346 if ((int)(ppp->minseq - seq) > (int)(mask >> 1))
2347 seq += mask + 1;
2348 else if ((int)(seq - ppp->minseq) > (int)(mask >> 1))
2349 seq -= mask + 1; /* should never happen */
2350 PPP_MP_CB(skb)->sequence = seq;
2351 pch->lastseq = seq;
2352
2353 /*
2354 * If this packet comes before the next one we were expecting,
2355 * drop it.
2356 */
2357 if (seq_before(seq, ppp->nextseq)) {
2358 kfree_skb(skb);
2359 ++ppp->dev->stats.rx_dropped;
2360 ppp_receive_error(ppp);
2361 return;
2362 }
2363
2364 /*
2365 * Reevaluate minseq, the minimum over all channels of the
2366 * last sequence number received on each channel. Because of
2367 * the increasing sequence number rule, we know that any fragment
2368 * before `minseq' which hasn't arrived is never going to arrive.
2369 * The list of channels can't change because we have the receive
2370 * side of the ppp unit locked.
2371 */
2372 list_for_each_entry(ch, &ppp->channels, clist) {
2373 if (seq_before(ch->lastseq, seq))
2374 seq = ch->lastseq;
2375 }
2376 if (seq_before(ppp->minseq, seq))
2377 ppp->minseq = seq;
2378
2379 /* Put the fragment on the reconstruction queue */
2380 ppp_mp_insert(ppp, skb);
2381
2382 /* If the queue is getting long, don't wait any longer for packets
2383 before the start of the queue. */
2384 if (skb_queue_len(&ppp->mrq) >= PPP_MP_MAX_QLEN) {
2385 struct sk_buff *mskb = skb_peek(&ppp->mrq);
2386 if (seq_before(ppp->minseq, PPP_MP_CB(mskb)->sequence))
2387 ppp->minseq = PPP_MP_CB(mskb)->sequence;
2388 }
2389
2390 /* Pull completed packets off the queue and receive them. */
2391 while ((skb = ppp_mp_reconstruct(ppp))) {
2392 if (pskb_may_pull(skb, 2))
2393 ppp_receive_nonmp_frame(ppp, skb);
2394 else {
2395 ++ppp->dev->stats.rx_length_errors;
2396 kfree_skb(skb);
2397 ppp_receive_error(ppp);
2398 }
2399 }
2400
2401 return;
2402
2403 err:
2404 kfree_skb(skb);
2405 ppp_receive_error(ppp);
2406}
2407
2408/*
2409 * Insert a fragment on the MP reconstruction queue.
2410 * The queue is ordered by increasing sequence number.
2411 */
2412static void
2413ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb)
2414{
2415 struct sk_buff *p;
2416 struct sk_buff_head *list = &ppp->mrq;
2417 u32 seq = PPP_MP_CB(skb)->sequence;
2418
2419 /* N.B. we don't need to lock the list lock because we have the
2420 ppp unit receive-side lock. */
2421 skb_queue_walk(list, p) {
2422 if (seq_before(seq, PPP_MP_CB(p)->sequence))
2423 break;
2424 }
2425 __skb_queue_before(list, p, skb);
2426}
2427
2428/*
2429 * Reconstruct a packet from the MP fragment queue.
2430 * We go through increasing sequence numbers until we find a
2431 * complete packet, or we get to the sequence number for a fragment
2432 * which hasn't arrived but might still do so.
2433 */
2434static struct sk_buff *
2435ppp_mp_reconstruct(struct ppp *ppp)
2436{
2437 u32 seq = ppp->nextseq;
2438 u32 minseq = ppp->minseq;
2439 struct sk_buff_head *list = &ppp->mrq;
2440 struct sk_buff *p, *tmp;
2441 struct sk_buff *head, *tail;
2442 struct sk_buff *skb = NULL;
2443 int lost = 0, len = 0;
2444
2445 if (ppp->mrru == 0) /* do nothing until mrru is set */
2446 return NULL;
2447 head = __skb_peek(list);
2448 tail = NULL;
2449 skb_queue_walk_safe(list, p, tmp) {
2450 again:
2451 if (seq_before(PPP_MP_CB(p)->sequence, seq)) {
2452 /* this can't happen, anyway ignore the skb */
2453 netdev_err(ppp->dev, "ppp_mp_reconstruct bad "
2454 "seq %u < %u\n",
2455 PPP_MP_CB(p)->sequence, seq);
2456 __skb_unlink(p, list);
2457 kfree_skb(p);
2458 continue;
2459 }
2460 if (PPP_MP_CB(p)->sequence != seq) {
2461 u32 oldseq;
2462 /* Fragment `seq' is missing. If it is after
2463 minseq, it might arrive later, so stop here. */
2464 if (seq_after(seq, minseq))
2465 break;
2466 /* Fragment `seq' is lost, keep going. */
2467 lost = 1;
2468 oldseq = seq;
2469 seq = seq_before(minseq, PPP_MP_CB(p)->sequence)?
2470 minseq + 1: PPP_MP_CB(p)->sequence;
2471
2472 if (ppp->debug & 1)
2473 netdev_printk(KERN_DEBUG, ppp->dev,
2474 "lost frag %u..%u\n",
2475 oldseq, seq-1);
2476
2477 goto again;
2478 }
2479
2480 /*
2481 * At this point we know that all the fragments from
2482 * ppp->nextseq to seq are either present or lost.
2483 * Also, there are no complete packets in the queue
2484 * that have no missing fragments and end before this
2485 * fragment.
2486 */
2487
2488 /* B bit set indicates this fragment starts a packet */
2489 if (PPP_MP_CB(p)->BEbits & B) {
2490 head = p;
2491 lost = 0;
2492 len = 0;
2493 }
2494
2495 len += p->len;
2496
2497 /* Got a complete packet yet? */
2498 if (lost == 0 && (PPP_MP_CB(p)->BEbits & E) &&
2499 (PPP_MP_CB(head)->BEbits & B)) {
2500 if (len > ppp->mrru + 2) {
2501 ++ppp->dev->stats.rx_length_errors;
2502 netdev_printk(KERN_DEBUG, ppp->dev,
2503 "PPP: reconstructed packet"
2504 " is too long (%d)\n", len);
2505 } else {
2506 tail = p;
2507 break;
2508 }
2509 ppp->nextseq = seq + 1;
2510 }
2511
2512 /*
2513 * If this is the ending fragment of a packet,
2514 * and we haven't found a complete valid packet yet,
2515 * we can discard up to and including this fragment.
2516 */
2517 if (PPP_MP_CB(p)->BEbits & E) {
2518 struct sk_buff *tmp2;
2519
2520 skb_queue_reverse_walk_from_safe(list, p, tmp2) {
2521 if (ppp->debug & 1)
2522 netdev_printk(KERN_DEBUG, ppp->dev,
2523 "discarding frag %u\n",
2524 PPP_MP_CB(p)->sequence);
2525 __skb_unlink(p, list);
2526 kfree_skb(p);
2527 }
2528 head = skb_peek(list);
2529 if (!head)
2530 break;
2531 }
2532 ++seq;
2533 }
2534
2535 /* If we have a complete packet, copy it all into one skb. */
2536 if (tail != NULL) {
2537 /* If we have discarded any fragments,
2538 signal a receive error. */
2539 if (PPP_MP_CB(head)->sequence != ppp->nextseq) {
2540 skb_queue_walk_safe(list, p, tmp) {
2541 if (p == head)
2542 break;
2543 if (ppp->debug & 1)
2544 netdev_printk(KERN_DEBUG, ppp->dev,
2545 "discarding frag %u\n",
2546 PPP_MP_CB(p)->sequence);
2547 __skb_unlink(p, list);
2548 kfree_skb(p);
2549 }
2550
2551 if (ppp->debug & 1)
2552 netdev_printk(KERN_DEBUG, ppp->dev,
2553 " missed pkts %u..%u\n",
2554 ppp->nextseq,
2555 PPP_MP_CB(head)->sequence-1);
2556 ++ppp->dev->stats.rx_dropped;
2557 ppp_receive_error(ppp);
2558 }
2559
2560 skb = head;
2561 if (head != tail) {
2562 struct sk_buff **fragpp = &skb_shinfo(skb)->frag_list;
2563 p = skb_queue_next(list, head);
2564 __skb_unlink(skb, list);
2565 skb_queue_walk_from_safe(list, p, tmp) {
2566 __skb_unlink(p, list);
2567 *fragpp = p;
2568 p->next = NULL;
2569 fragpp = &p->next;
2570
2571 skb->len += p->len;
2572 skb->data_len += p->len;
2573 skb->truesize += p->truesize;
2574
2575 if (p == tail)
2576 break;
2577 }
2578 } else {
2579 __skb_unlink(skb, list);
2580 }
2581
2582 ppp->nextseq = PPP_MP_CB(tail)->sequence + 1;
2583 }
2584
2585 return skb;
2586}
2587#endif /* CONFIG_PPP_MULTILINK */
2588
2589/*
2590 * Channel interface.
2591 */
2592
2593/* Create a new, unattached ppp channel. */
2594int ppp_register_channel(struct ppp_channel *chan)
2595{
2596 return ppp_register_net_channel(current->nsproxy->net_ns, chan);
2597}
2598
2599/* Create a new, unattached ppp channel for specified net. */
2600int ppp_register_net_channel(struct net *net, struct ppp_channel *chan)
2601{
2602 struct channel *pch;
2603 struct ppp_net *pn;
2604
2605 pch = kzalloc(sizeof(struct channel), GFP_KERNEL);
2606 if (!pch)
2607 return -ENOMEM;
2608
2609 pn = ppp_pernet(net);
2610
2611 pch->ppp = NULL;
2612 pch->chan = chan;
2613 pch->chan_net = get_net(net);
2614 chan->ppp = pch;
2615 init_ppp_file(&pch->file, CHANNEL);
2616 pch->file.hdrlen = chan->hdrlen;
2617#ifdef CONFIG_PPP_MULTILINK
2618 pch->lastseq = -1;
2619#endif /* CONFIG_PPP_MULTILINK */
2620 init_rwsem(&pch->chan_sem);
2621 spin_lock_init(&pch->downl);
2622 rwlock_init(&pch->upl);
2623
2624 spin_lock_bh(&pn->all_channels_lock);
2625 pch->file.index = ++pn->last_channel_index;
2626 list_add(&pch->list, &pn->new_channels);
2627 atomic_inc(&channel_count);
2628 spin_unlock_bh(&pn->all_channels_lock);
2629
2630 return 0;
2631}
2632
2633/*
2634 * Return the index of a channel.
2635 */
2636int ppp_channel_index(struct ppp_channel *chan)
2637{
2638 struct channel *pch = chan->ppp;
2639
2640 if (pch)
2641 return pch->file.index;
2642 return -1;
2643}
2644
2645/*
2646 * Return the PPP unit number to which a channel is connected.
2647 */
2648int ppp_unit_number(struct ppp_channel *chan)
2649{
2650 struct channel *pch = chan->ppp;
2651 int unit = -1;
2652
2653 if (pch) {
2654 read_lock_bh(&pch->upl);
2655 if (pch->ppp)
2656 unit = pch->ppp->file.index;
2657 read_unlock_bh(&pch->upl);
2658 }
2659 return unit;
2660}
2661
2662/*
2663 * Return the PPP device interface name of a channel.
2664 */
2665char *ppp_dev_name(struct ppp_channel *chan)
2666{
2667 struct channel *pch = chan->ppp;
2668 char *name = NULL;
2669
2670 if (pch) {
2671 read_lock_bh(&pch->upl);
2672 if (pch->ppp && pch->ppp->dev)
2673 name = pch->ppp->dev->name;
2674 read_unlock_bh(&pch->upl);
2675 }
2676 return name;
2677}
2678
2679
2680/*
2681 * Disconnect a channel from the generic layer.
2682 * This must be called in process context.
2683 */
2684void
2685ppp_unregister_channel(struct ppp_channel *chan)
2686{
2687 struct channel *pch = chan->ppp;
2688 struct ppp_net *pn;
2689
2690 if (!pch)
2691 return; /* should never happen */
2692
2693 chan->ppp = NULL;
2694
2695 /*
2696 * This ensures that we have returned from any calls into the
2697 * the channel's start_xmit or ioctl routine before we proceed.
2698 */
2699 down_write(&pch->chan_sem);
2700 spin_lock_bh(&pch->downl);
2701 pch->chan = NULL;
2702 spin_unlock_bh(&pch->downl);
2703 up_write(&pch->chan_sem);
2704 ppp_disconnect_channel(pch);
2705
2706 pn = ppp_pernet(pch->chan_net);
2707 spin_lock_bh(&pn->all_channels_lock);
2708 list_del(&pch->list);
2709 spin_unlock_bh(&pn->all_channels_lock);
2710
2711 pch->file.dead = 1;
2712 wake_up_interruptible(&pch->file.rwait);
2713 if (refcount_dec_and_test(&pch->file.refcnt))
2714 ppp_destroy_channel(pch);
2715}
2716
2717/*
2718 * Callback from a channel when it can accept more to transmit.
2719 * This should be called at BH/softirq level, not interrupt level.
2720 */
2721void
2722ppp_output_wakeup(struct ppp_channel *chan)
2723{
2724 struct channel *pch = chan->ppp;
2725
2726 if (!pch)
2727 return;
2728 ppp_channel_push(pch);
2729}
2730
2731/*
2732 * Compression control.
2733 */
2734
2735/* Process the PPPIOCSCOMPRESS ioctl. */
2736static int
2737ppp_set_compress(struct ppp *ppp, unsigned long arg)
2738{
2739 int err;
2740 struct compressor *cp, *ocomp;
2741 struct ppp_option_data data;
2742 void *state, *ostate;
2743 unsigned char ccp_option[CCP_MAX_OPTION_LENGTH];
2744
2745 err = -EFAULT;
2746 if (copy_from_user(&data, (void __user *) arg, sizeof(data)))
2747 goto out;
2748 if (data.length > CCP_MAX_OPTION_LENGTH)
2749 goto out;
2750 if (copy_from_user(ccp_option, (void __user *) data.ptr, data.length))
2751 goto out;
2752
2753 err = -EINVAL;
2754 if (data.length < 2 || ccp_option[1] < 2 || ccp_option[1] > data.length)
2755 goto out;
2756
2757 cp = try_then_request_module(
2758 find_compressor(ccp_option[0]),
2759 "ppp-compress-%d", ccp_option[0]);
2760 if (!cp)
2761 goto out;
2762
2763 err = -ENOBUFS;
2764 if (data.transmit) {
2765 state = cp->comp_alloc(ccp_option, data.length);
2766 if (state) {
2767 ppp_xmit_lock(ppp);
2768 ppp->xstate &= ~SC_COMP_RUN;
2769 ocomp = ppp->xcomp;
2770 ostate = ppp->xc_state;
2771 ppp->xcomp = cp;
2772 ppp->xc_state = state;
2773 ppp_xmit_unlock(ppp);
2774 if (ostate) {
2775 ocomp->comp_free(ostate);
2776 module_put(ocomp->owner);
2777 }
2778 err = 0;
2779 } else
2780 module_put(cp->owner);
2781
2782 } else {
2783 state = cp->decomp_alloc(ccp_option, data.length);
2784 if (state) {
2785 ppp_recv_lock(ppp);
2786 ppp->rstate &= ~SC_DECOMP_RUN;
2787 ocomp = ppp->rcomp;
2788 ostate = ppp->rc_state;
2789 ppp->rcomp = cp;
2790 ppp->rc_state = state;
2791 ppp_recv_unlock(ppp);
2792 if (ostate) {
2793 ocomp->decomp_free(ostate);
2794 module_put(ocomp->owner);
2795 }
2796 err = 0;
2797 } else
2798 module_put(cp->owner);
2799 }
2800
2801 out:
2802 return err;
2803}
2804
2805/*
2806 * Look at a CCP packet and update our state accordingly.
2807 * We assume the caller has the xmit or recv path locked.
2808 */
2809static void
2810ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound)
2811{
2812 unsigned char *dp;
2813 int len;
2814
2815 if (!pskb_may_pull(skb, CCP_HDRLEN + 2))
2816 return; /* no header */
2817 dp = skb->data + 2;
2818
2819 switch (CCP_CODE(dp)) {
2820 case CCP_CONFREQ:
2821
2822 /* A ConfReq starts negotiation of compression
2823 * in one direction of transmission,
2824 * and hence brings it down...but which way?
2825 *
2826 * Remember:
2827 * A ConfReq indicates what the sender would like to receive
2828 */
2829 if(inbound)
2830 /* He is proposing what I should send */
2831 ppp->xstate &= ~SC_COMP_RUN;
2832 else
2833 /* I am proposing to what he should send */
2834 ppp->rstate &= ~SC_DECOMP_RUN;
2835
2836 break;
2837
2838 case CCP_TERMREQ:
2839 case CCP_TERMACK:
2840 /*
2841 * CCP is going down, both directions of transmission
2842 */
2843 ppp->rstate &= ~SC_DECOMP_RUN;
2844 ppp->xstate &= ~SC_COMP_RUN;
2845 break;
2846
2847 case CCP_CONFACK:
2848 if ((ppp->flags & (SC_CCP_OPEN | SC_CCP_UP)) != SC_CCP_OPEN)
2849 break;
2850 len = CCP_LENGTH(dp);
2851 if (!pskb_may_pull(skb, len + 2))
2852 return; /* too short */
2853 dp += CCP_HDRLEN;
2854 len -= CCP_HDRLEN;
2855 if (len < CCP_OPT_MINLEN || len < CCP_OPT_LENGTH(dp))
2856 break;
2857 if (inbound) {
2858 /* we will start receiving compressed packets */
2859 if (!ppp->rc_state)
2860 break;
2861 if (ppp->rcomp->decomp_init(ppp->rc_state, dp, len,
2862 ppp->file.index, 0, ppp->mru, ppp->debug)) {
2863 ppp->rstate |= SC_DECOMP_RUN;
2864 ppp->rstate &= ~(SC_DC_ERROR | SC_DC_FERROR);
2865 }
2866 } else {
2867 /* we will soon start sending compressed packets */
2868 if (!ppp->xc_state)
2869 break;
2870 if (ppp->xcomp->comp_init(ppp->xc_state, dp, len,
2871 ppp->file.index, 0, ppp->debug))
2872 ppp->xstate |= SC_COMP_RUN;
2873 }
2874 break;
2875
2876 case CCP_RESETACK:
2877 /* reset the [de]compressor */
2878 if ((ppp->flags & SC_CCP_UP) == 0)
2879 break;
2880 if (inbound) {
2881 if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN)) {
2882 ppp->rcomp->decomp_reset(ppp->rc_state);
2883 ppp->rstate &= ~SC_DC_ERROR;
2884 }
2885 } else {
2886 if (ppp->xc_state && (ppp->xstate & SC_COMP_RUN))
2887 ppp->xcomp->comp_reset(ppp->xc_state);
2888 }
2889 break;
2890 }
2891}
2892
2893/* Free up compression resources. */
2894static void
2895ppp_ccp_closed(struct ppp *ppp)
2896{
2897 void *xstate, *rstate;
2898 struct compressor *xcomp, *rcomp;
2899
2900 ppp_lock(ppp);
2901 ppp->flags &= ~(SC_CCP_OPEN | SC_CCP_UP);
2902 ppp->xstate = 0;
2903 xcomp = ppp->xcomp;
2904 xstate = ppp->xc_state;
2905 ppp->xc_state = NULL;
2906 ppp->rstate = 0;
2907 rcomp = ppp->rcomp;
2908 rstate = ppp->rc_state;
2909 ppp->rc_state = NULL;
2910 ppp_unlock(ppp);
2911
2912 if (xstate) {
2913 xcomp->comp_free(xstate);
2914 module_put(xcomp->owner);
2915 }
2916 if (rstate) {
2917 rcomp->decomp_free(rstate);
2918 module_put(rcomp->owner);
2919 }
2920}
2921
2922/* List of compressors. */
2923static LIST_HEAD(compressor_list);
2924static DEFINE_SPINLOCK(compressor_list_lock);
2925
2926struct compressor_entry {
2927 struct list_head list;
2928 struct compressor *comp;
2929};
2930
2931static struct compressor_entry *
2932find_comp_entry(int proto)
2933{
2934 struct compressor_entry *ce;
2935
2936 list_for_each_entry(ce, &compressor_list, list) {
2937 if (ce->comp->compress_proto == proto)
2938 return ce;
2939 }
2940 return NULL;
2941}
2942
2943/* Register a compressor */
2944int
2945ppp_register_compressor(struct compressor *cp)
2946{
2947 struct compressor_entry *ce;
2948 int ret;
2949 spin_lock(&compressor_list_lock);
2950 ret = -EEXIST;
2951 if (find_comp_entry(cp->compress_proto))
2952 goto out;
2953 ret = -ENOMEM;
2954 ce = kmalloc(sizeof(struct compressor_entry), GFP_ATOMIC);
2955 if (!ce)
2956 goto out;
2957 ret = 0;
2958 ce->comp = cp;
2959 list_add(&ce->list, &compressor_list);
2960 out:
2961 spin_unlock(&compressor_list_lock);
2962 return ret;
2963}
2964
2965/* Unregister a compressor */
2966void
2967ppp_unregister_compressor(struct compressor *cp)
2968{
2969 struct compressor_entry *ce;
2970
2971 spin_lock(&compressor_list_lock);
2972 ce = find_comp_entry(cp->compress_proto);
2973 if (ce && ce->comp == cp) {
2974 list_del(&ce->list);
2975 kfree(ce);
2976 }
2977 spin_unlock(&compressor_list_lock);
2978}
2979
2980/* Find a compressor. */
2981static struct compressor *
2982find_compressor(int type)
2983{
2984 struct compressor_entry *ce;
2985 struct compressor *cp = NULL;
2986
2987 spin_lock(&compressor_list_lock);
2988 ce = find_comp_entry(type);
2989 if (ce) {
2990 cp = ce->comp;
2991 if (!try_module_get(cp->owner))
2992 cp = NULL;
2993 }
2994 spin_unlock(&compressor_list_lock);
2995 return cp;
2996}
2997
2998/*
2999 * Miscelleneous stuff.
3000 */
3001
3002static void
3003ppp_get_stats(struct ppp *ppp, struct ppp_stats *st)
3004{
3005 struct slcompress *vj = ppp->vj;
3006
3007 memset(st, 0, sizeof(*st));
3008 st->p.ppp_ipackets = ppp->stats64.rx_packets;
3009 st->p.ppp_ierrors = ppp->dev->stats.rx_errors;
3010 st->p.ppp_ibytes = ppp->stats64.rx_bytes;
3011 st->p.ppp_opackets = ppp->stats64.tx_packets;
3012 st->p.ppp_oerrors = ppp->dev->stats.tx_errors;
3013 st->p.ppp_obytes = ppp->stats64.tx_bytes;
3014 if (!vj)
3015 return;
3016 st->vj.vjs_packets = vj->sls_o_compressed + vj->sls_o_uncompressed;
3017 st->vj.vjs_compressed = vj->sls_o_compressed;
3018 st->vj.vjs_searches = vj->sls_o_searches;
3019 st->vj.vjs_misses = vj->sls_o_misses;
3020 st->vj.vjs_errorin = vj->sls_i_error;
3021 st->vj.vjs_tossed = vj->sls_i_tossed;
3022 st->vj.vjs_uncompressedin = vj->sls_i_uncompressed;
3023 st->vj.vjs_compressedin = vj->sls_i_compressed;
3024}
3025
3026/*
3027 * Stuff for handling the lists of ppp units and channels
3028 * and for initialization.
3029 */
3030
3031/*
3032 * Create a new ppp interface unit. Fails if it can't allocate memory
3033 * or if there is already a unit with the requested number.
3034 * unit == -1 means allocate a new number.
3035 */
3036static int ppp_create_interface(struct net *net, struct file *file, int *unit)
3037{
3038 struct ppp_config conf = {
3039 .file = file,
3040 .unit = *unit,
3041 .ifname_is_set = false,
3042 };
3043 struct net_device *dev;
3044 struct ppp *ppp;
3045 int err;
3046
3047 dev = alloc_netdev(sizeof(struct ppp), "", NET_NAME_ENUM, ppp_setup);
3048 if (!dev) {
3049 err = -ENOMEM;
3050 goto err;
3051 }
3052 dev_net_set(dev, net);
3053 dev->rtnl_link_ops = &ppp_link_ops;
3054
3055 rtnl_lock();
3056
3057 err = ppp_dev_configure(net, dev, &conf);
3058 if (err < 0)
3059 goto err_dev;
3060 ppp = netdev_priv(dev);
3061 *unit = ppp->file.index;
3062
3063 rtnl_unlock();
3064
3065 return 0;
3066
3067err_dev:
3068 rtnl_unlock();
3069 free_netdev(dev);
3070err:
3071 return err;
3072}
3073
3074/*
3075 * Initialize a ppp_file structure.
3076 */
3077static void
3078init_ppp_file(struct ppp_file *pf, int kind)
3079{
3080 pf->kind = kind;
3081 skb_queue_head_init(&pf->xq);
3082 skb_queue_head_init(&pf->rq);
3083 refcount_set(&pf->refcnt, 1);
3084 init_waitqueue_head(&pf->rwait);
3085}
3086
3087/*
3088 * Free the memory used by a ppp unit. This is only called once
3089 * there are no channels connected to the unit and no file structs
3090 * that reference the unit.
3091 */
3092static void ppp_destroy_interface(struct ppp *ppp)
3093{
3094 atomic_dec(&ppp_unit_count);
3095
3096 if (!ppp->file.dead || ppp->n_channels) {
3097 /* "can't happen" */
3098 netdev_err(ppp->dev, "ppp: destroying ppp struct %p "
3099 "but dead=%d n_channels=%d !\n",
3100 ppp, ppp->file.dead, ppp->n_channels);
3101 return;
3102 }
3103
3104 ppp_ccp_closed(ppp);
3105 if (ppp->vj) {
3106 slhc_free(ppp->vj);
3107 ppp->vj = NULL;
3108 }
3109 skb_queue_purge(&ppp->file.xq);
3110 skb_queue_purge(&ppp->file.rq);
3111#ifdef CONFIG_PPP_MULTILINK
3112 skb_queue_purge(&ppp->mrq);
3113#endif /* CONFIG_PPP_MULTILINK */
3114#ifdef CONFIG_PPP_FILTER
3115 if (ppp->pass_filter) {
3116 bpf_prog_destroy(ppp->pass_filter);
3117 ppp->pass_filter = NULL;
3118 }
3119
3120 if (ppp->active_filter) {
3121 bpf_prog_destroy(ppp->active_filter);
3122 ppp->active_filter = NULL;
3123 }
3124#endif /* CONFIG_PPP_FILTER */
3125
3126 kfree_skb(ppp->xmit_pending);
3127 free_percpu(ppp->xmit_recursion);
3128
3129 free_netdev(ppp->dev);
3130}
3131
3132/*
3133 * Locate an existing ppp unit.
3134 * The caller should have locked the all_ppp_mutex.
3135 */
3136static struct ppp *
3137ppp_find_unit(struct ppp_net *pn, int unit)
3138{
3139 return unit_find(&pn->units_idr, unit);
3140}
3141
3142/*
3143 * Locate an existing ppp channel.
3144 * The caller should have locked the all_channels_lock.
3145 * First we look in the new_channels list, then in the
3146 * all_channels list. If found in the new_channels list,
3147 * we move it to the all_channels list. This is for speed
3148 * when we have a lot of channels in use.
3149 */
3150static struct channel *
3151ppp_find_channel(struct ppp_net *pn, int unit)
3152{
3153 struct channel *pch;
3154
3155 list_for_each_entry(pch, &pn->new_channels, list) {
3156 if (pch->file.index == unit) {
3157 list_move(&pch->list, &pn->all_channels);
3158 return pch;
3159 }
3160 }
3161
3162 list_for_each_entry(pch, &pn->all_channels, list) {
3163 if (pch->file.index == unit)
3164 return pch;
3165 }
3166
3167 return NULL;
3168}
3169
3170/*
3171 * Connect a PPP channel to a PPP interface unit.
3172 */
3173static int
3174ppp_connect_channel(struct channel *pch, int unit)
3175{
3176 struct ppp *ppp;
3177 struct ppp_net *pn;
3178 int ret = -ENXIO;
3179 int hdrlen;
3180
3181 pn = ppp_pernet(pch->chan_net);
3182
3183 mutex_lock(&pn->all_ppp_mutex);
3184 ppp = ppp_find_unit(pn, unit);
3185 if (!ppp)
3186 goto out;
3187 write_lock_bh(&pch->upl);
3188 ret = -EINVAL;
3189 if (pch->ppp)
3190 goto outl;
3191
3192 ppp_lock(ppp);
3193 spin_lock_bh(&pch->downl);
3194 if (!pch->chan) {
3195 /* Don't connect unregistered channels */
3196 spin_unlock_bh(&pch->downl);
3197 ppp_unlock(ppp);
3198 ret = -ENOTCONN;
3199 goto outl;
3200 }
3201 spin_unlock_bh(&pch->downl);
3202 if (pch->file.hdrlen > ppp->file.hdrlen)
3203 ppp->file.hdrlen = pch->file.hdrlen;
3204 hdrlen = pch->file.hdrlen + 2; /* for protocol bytes */
3205 if (hdrlen > ppp->dev->hard_header_len)
3206 ppp->dev->hard_header_len = hdrlen;
3207 list_add_tail(&pch->clist, &ppp->channels);
3208 ++ppp->n_channels;
3209 pch->ppp = ppp;
3210 refcount_inc(&ppp->file.refcnt);
3211 ppp_unlock(ppp);
3212 ret = 0;
3213
3214 outl:
3215 write_unlock_bh(&pch->upl);
3216 out:
3217 mutex_unlock(&pn->all_ppp_mutex);
3218 return ret;
3219}
3220
3221/*
3222 * Disconnect a channel from its ppp unit.
3223 */
3224static int
3225ppp_disconnect_channel(struct channel *pch)
3226{
3227 struct ppp *ppp;
3228 int err = -EINVAL;
3229
3230 write_lock_bh(&pch->upl);
3231 ppp = pch->ppp;
3232 pch->ppp = NULL;
3233 write_unlock_bh(&pch->upl);
3234 if (ppp) {
3235 /* remove it from the ppp unit's list */
3236 ppp_lock(ppp);
3237 list_del(&pch->clist);
3238 if (--ppp->n_channels == 0)
3239 wake_up_interruptible(&ppp->file.rwait);
3240 ppp_unlock(ppp);
3241 if (refcount_dec_and_test(&ppp->file.refcnt))
3242 ppp_destroy_interface(ppp);
3243 err = 0;
3244 }
3245 return err;
3246}
3247
3248/*
3249 * Free up the resources used by a ppp channel.
3250 */
3251static void ppp_destroy_channel(struct channel *pch)
3252{
3253 put_net(pch->chan_net);
3254 pch->chan_net = NULL;
3255
3256 atomic_dec(&channel_count);
3257
3258 if (!pch->file.dead) {
3259 /* "can't happen" */
3260 pr_err("ppp: destroying undead channel %p !\n", pch);
3261 return;
3262 }
3263 skb_queue_purge(&pch->file.xq);
3264 skb_queue_purge(&pch->file.rq);
3265 kfree(pch);
3266}
3267
3268static void __exit ppp_cleanup(void)
3269{
3270 /* should never happen */
3271 if (atomic_read(&ppp_unit_count) || atomic_read(&channel_count))
3272 pr_err("PPP: removing module but units remain!\n");
3273 rtnl_link_unregister(&ppp_link_ops);
3274 unregister_chrdev(PPP_MAJOR, "ppp");
3275 device_destroy(ppp_class, MKDEV(PPP_MAJOR, 0));
3276 class_destroy(ppp_class);
3277 unregister_pernet_device(&ppp_net_ops);
3278}
3279
3280/*
3281 * Units handling. Caller must protect concurrent access
3282 * by holding all_ppp_mutex
3283 */
3284
3285/* associate pointer with specified number */
3286static int unit_set(struct idr *p, void *ptr, int n)
3287{
3288 int unit;
3289
3290 unit = idr_alloc(p, ptr, n, n + 1, GFP_KERNEL);
3291 if (unit == -ENOSPC)
3292 unit = -EINVAL;
3293 return unit;
3294}
3295
3296/* get new free unit number and associate pointer with it */
3297static int unit_get(struct idr *p, void *ptr)
3298{
3299 return idr_alloc(p, ptr, 0, 0, GFP_KERNEL);
3300}
3301
3302/* put unit number back to a pool */
3303static void unit_put(struct idr *p, int n)
3304{
3305 idr_remove(p, n);
3306}
3307
3308/* get pointer associated with the number */
3309static void *unit_find(struct idr *p, int n)
3310{
3311 return idr_find(p, n);
3312}
3313
3314/* Module/initialization stuff */
3315
3316module_init(ppp_init);
3317module_exit(ppp_cleanup);
3318
3319EXPORT_SYMBOL(ppp_register_net_channel);
3320EXPORT_SYMBOL(ppp_register_channel);
3321EXPORT_SYMBOL(ppp_unregister_channel);
3322EXPORT_SYMBOL(ppp_channel_index);
3323EXPORT_SYMBOL(ppp_unit_number);
3324EXPORT_SYMBOL(ppp_dev_name);
3325EXPORT_SYMBOL(ppp_input);
3326EXPORT_SYMBOL(ppp_input_error);
3327EXPORT_SYMBOL(ppp_output_wakeup);
3328EXPORT_SYMBOL(ppp_register_compressor);
3329EXPORT_SYMBOL(ppp_unregister_compressor);
3330MODULE_LICENSE("GPL");
3331MODULE_ALIAS_CHARDEV(PPP_MAJOR, 0);
3332MODULE_ALIAS_RTNL_LINK("ppp");
3333MODULE_ALIAS("devname:ppp");