linux/drivers/net/ppp/ppp_generic.c
<<
>>
Prefs
   1/*
   2 * Generic PPP layer for Linux.
   3 *
   4 * Copyright 1999-2002 Paul Mackerras.
   5 *
   6 *  This program is free software; you can redistribute it and/or
   7 *  modify it under the terms of the GNU General Public License
   8 *  as published by the Free Software Foundation; either version
   9 *  2 of the License, or (at your option) any later version.
  10 *
  11 * The generic PPP layer handles the PPP network interfaces, the
  12 * /dev/ppp device, packet and VJ compression, and multilink.
  13 * It talks to PPP `channels' via the interface defined in
  14 * include/linux/ppp_channel.h.  Channels provide the basic means for
  15 * sending and receiving PPP frames on some kind of communications
  16 * channel.
  17 *
  18 * Part of the code in this driver was inspired by the old async-only
  19 * PPP driver, written by Michael Callahan and Al Longyear, and
  20 * subsequently hacked by Paul Mackerras.
  21 *
  22 * ==FILEVERSION 20041108==
  23 */
  24
  25#include <linux/module.h>
  26#include <linux/kernel.h>
  27#include <linux/kmod.h>
  28#include <linux/init.h>
  29#include <linux/list.h>
  30#include <linux/idr.h>
  31#include <linux/netdevice.h>
  32#include <linux/poll.h>
  33#include <linux/ppp_defs.h>
  34#include <linux/filter.h>
  35#include <linux/ppp-ioctl.h>
  36#include <linux/ppp_channel.h>
  37#include <linux/ppp-comp.h>
  38#include <linux/skbuff.h>
  39#include <linux/rtnetlink.h>
  40#include <linux/if_arp.h>
  41#include <linux/ip.h>
  42#include <linux/tcp.h>
  43#include <linux/spinlock.h>
  44#include <linux/rwsem.h>
  45#include <linux/stddef.h>
  46#include <linux/device.h>
  47#include <linux/mutex.h>
  48#include <linux/slab.h>
  49#include <asm/unaligned.h>
  50#include <net/slhc_vj.h>
  51#include <linux/atomic.h>
  52
  53#include <linux/nsproxy.h>
  54#include <net/net_namespace.h>
  55#include <net/netns/generic.h>
  56
  57#define PPP_VERSION     "2.4.2"
  58
  59/*
  60 * Network protocols we support.
  61 */
  62#define NP_IP   0               /* Internet Protocol V4 */
  63#define NP_IPV6 1               /* Internet Protocol V6 */
  64#define NP_IPX  2               /* IPX protocol */
  65#define NP_AT   3               /* Appletalk protocol */
  66#define NP_MPLS_UC 4            /* MPLS unicast */
  67#define NP_MPLS_MC 5            /* MPLS multicast */
  68#define NUM_NP  6               /* Number of NPs. */
  69
  70#define MPHDRLEN        6       /* multilink protocol header length */
  71#define MPHDRLEN_SSN    4       /* ditto with short sequence numbers */
  72
  73/*
  74 * An instance of /dev/ppp can be associated with either a ppp
  75 * interface unit or a ppp channel.  In both cases, file->private_data
  76 * points to one of these.
  77 */
  78struct ppp_file {
  79        enum {
  80                INTERFACE=1, CHANNEL
  81        }               kind;
  82        struct sk_buff_head xq;         /* pppd transmit queue */
  83        struct sk_buff_head rq;         /* receive queue for pppd */
  84        wait_queue_head_t rwait;        /* for poll on reading /dev/ppp */
  85        atomic_t        refcnt;         /* # refs (incl /dev/ppp attached) */
  86        int             hdrlen;         /* space to leave for headers */
  87        int             index;          /* interface unit / channel number */
  88        int             dead;           /* unit/channel has been shut down */
  89};
  90
  91#define PF_TO_X(pf, X)          container_of(pf, X, file)
  92
  93#define PF_TO_PPP(pf)           PF_TO_X(pf, struct ppp)
  94#define PF_TO_CHANNEL(pf)       PF_TO_X(pf, struct channel)
  95
  96/*
  97 * Data structure to hold primary network stats for which
  98 * we want to use 64 bit storage.  Other network stats
  99 * are stored in dev->stats of the ppp strucute.
 100 */
 101struct ppp_link_stats {
 102        u64 rx_packets;
 103        u64 tx_packets;
 104        u64 rx_bytes;
 105        u64 tx_bytes;
 106};
 107
 108/*
 109 * Data structure describing one ppp unit.
 110 * A ppp unit corresponds to a ppp network interface device
 111 * and represents a multilink bundle.
 112 * It can have 0 or more ppp channels connected to it.
 113 */
 114struct ppp {
 115        struct ppp_file file;           /* stuff for read/write/poll 0 */
 116        struct file     *owner;         /* file that owns this unit 48 */
 117        struct list_head channels;      /* list of attached channels 4c */
 118        int             n_channels;     /* how many channels are attached 54 */
 119        spinlock_t      rlock;          /* lock for receive side 58 */
 120        spinlock_t      wlock;          /* lock for transmit side 5c */
 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 sock_filter *pass_filter;        /* filter for packets to pass */
 147        struct sock_filter *active_filter;/* filter for pkts to reset idle */
 148        unsigned pass_len, active_len;
 149#endif /* CONFIG_PPP_FILTER */
 150        struct net      *ppp_net;       /* the net we belong to */
 151        struct ppp_link_stats stats64;  /* 64 bit network stats */
 152};
 153
 154/*
 155 * Bits in flags: SC_NO_TCP_CCID, SC_CCP_OPEN, SC_CCP_UP, SC_LOOP_TRAFFIC,
 156 * SC_MULTILINK, SC_MP_SHORTSEQ, SC_MP_XSHORTSEQ, SC_COMP_TCP, SC_REJ_COMP_TCP,
 157 * SC_MUST_COMP
 158 * Bits in rstate: SC_DECOMP_RUN, SC_DC_ERROR, SC_DC_FERROR.
 159 * Bits in xstate: SC_COMP_RUN
 160 */
 161#define SC_FLAG_BITS    (SC_NO_TCP_CCID|SC_CCP_OPEN|SC_CCP_UP|SC_LOOP_TRAFFIC \
 162                         |SC_MULTILINK|SC_MP_SHORTSEQ|SC_MP_XSHORTSEQ \
 163                         |SC_COMP_TCP|SC_REJ_COMP_TCP|SC_MUST_COMP)
 164
 165/*
 166 * Private data structure for each channel.
 167 * This includes the data structure used for multilink.
 168 */
 169struct channel {
 170        struct ppp_file file;           /* stuff for read/write/poll */
 171        struct list_head list;          /* link in all/new_channels list */
 172        struct ppp_channel *chan;       /* public channel data structure */
 173        struct rw_semaphore chan_sem;   /* protects `chan' during chan ioctl */
 174        spinlock_t      downl;          /* protects `chan', file.xq dequeue */
 175        struct ppp      *ppp;           /* ppp unit we're connected to */
 176        struct net      *chan_net;      /* the net channel belongs to */
 177        struct list_head clist;         /* link in list of channels per unit */
 178        rwlock_t        upl;            /* protects `ppp' */
 179#ifdef CONFIG_PPP_MULTILINK
 180        u8              avail;          /* flag used in multilink stuff */
 181        u8              had_frag;       /* >= 1 fragments have been sent */
 182        u32             lastseq;        /* MP: last sequence # received */
 183        int             speed;          /* speed of the corresponding ppp channel*/
 184#endif /* CONFIG_PPP_MULTILINK */
 185};
 186
 187/*
 188 * SMP locking issues:
 189 * Both the ppp.rlock and ppp.wlock locks protect the ppp.channels
 190 * list and the ppp.n_channels field, you need to take both locks
 191 * before you modify them.
 192 * The lock ordering is: channel.upl -> ppp.wlock -> ppp.rlock ->
 193 * channel.downl.
 194 */
 195
 196static DEFINE_MUTEX(ppp_mutex);
 197static atomic_t ppp_unit_count = ATOMIC_INIT(0);
 198static atomic_t channel_count = ATOMIC_INIT(0);
 199
 200/* per-net private data for this module */
 201static int ppp_net_id __read_mostly;
 202struct ppp_net {
 203        /* units to ppp mapping */
 204        struct idr units_idr;
 205
 206        /*
 207         * all_ppp_mutex protects the units_idr mapping.
 208         * It also ensures that finding a ppp unit in the units_idr
 209         * map and updating its file.refcnt field is atomic.
 210         */
 211        struct mutex all_ppp_mutex;
 212
 213        /* channels */
 214        struct list_head all_channels;
 215        struct list_head new_channels;
 216        int last_channel_index;
 217
 218        /*
 219         * all_channels_lock protects all_channels and
 220         * last_channel_index, and the atomicity of find
 221         * a channel and updating its file.refcnt field.
 222         */
 223        spinlock_t all_channels_lock;
 224};
 225
 226/* Get the PPP protocol number from a skb */
 227#define PPP_PROTO(skb)  get_unaligned_be16((skb)->data)
 228
 229/* We limit the length of ppp->file.rq to this (arbitrary) value */
 230#define PPP_MAX_RQLEN   32
 231
 232/*
 233 * Maximum number of multilink fragments queued up.
 234 * This has to be large enough to cope with the maximum latency of
 235 * the slowest channel relative to the others.  Strictly it should
 236 * depend on the number of channels and their characteristics.
 237 */
 238#define PPP_MP_MAX_QLEN 128
 239
 240/* Multilink header bits. */
 241#define B       0x80            /* this fragment begins a packet */
 242#define E       0x40            /* this fragment ends a packet */
 243
 244/* Compare multilink sequence numbers (assumed to be 32 bits wide) */
 245#define seq_before(a, b)        ((s32)((a) - (b)) < 0)
 246#define seq_after(a, b)         ((s32)((a) - (b)) > 0)
 247
 248/* Prototypes. */
 249static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
 250                        struct file *file, unsigned int cmd, unsigned long arg);
 251static void ppp_xmit_process(struct ppp *ppp);
 252static void ppp_send_frame(struct ppp *ppp, struct sk_buff *skb);
 253static void ppp_push(struct ppp *ppp);
 254static void ppp_channel_push(struct channel *pch);
 255static void ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb,
 256                              struct channel *pch);
 257static void ppp_receive_error(struct ppp *ppp);
 258static void ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb);
 259static struct sk_buff *ppp_decompress_frame(struct ppp *ppp,
 260                                            struct sk_buff *skb);
 261#ifdef CONFIG_PPP_MULTILINK
 262static void ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb,
 263                                struct channel *pch);
 264static void ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb);
 265static struct sk_buff *ppp_mp_reconstruct(struct ppp *ppp);
 266static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb);
 267#endif /* CONFIG_PPP_MULTILINK */
 268static int ppp_set_compress(struct ppp *ppp, unsigned long arg);
 269static void ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound);
 270static void ppp_ccp_closed(struct ppp *ppp);
 271static struct compressor *find_compressor(int type);
 272static void ppp_get_stats(struct ppp *ppp, struct ppp_stats *st);
 273static struct ppp *ppp_create_interface(struct net *net, int unit, int *retp);
 274static void init_ppp_file(struct ppp_file *pf, int kind);
 275static void ppp_shutdown_interface(struct ppp *ppp);
 276static void ppp_destroy_interface(struct ppp *ppp);
 277static struct ppp *ppp_find_unit(struct ppp_net *pn, int unit);
 278static struct channel *ppp_find_channel(struct ppp_net *pn, int unit);
 279static int ppp_connect_channel(struct channel *pch, int unit);
 280static int ppp_disconnect_channel(struct channel *pch);
 281static void ppp_destroy_channel(struct channel *pch);
 282static int unit_get(struct idr *p, void *ptr);
 283static int unit_set(struct idr *p, void *ptr, int n);
 284static void unit_put(struct idr *p, int n);
 285static void *unit_find(struct idr *p, int n);
 286
 287static struct class *ppp_class;
 288
 289/* per net-namespace data */
 290static inline struct ppp_net *ppp_pernet(struct net *net)
 291{
 292        BUG_ON(!net);
 293
 294        return net_generic(net, ppp_net_id);
 295}
 296
 297/* Translates a PPP protocol number to a NP index (NP == network protocol) */
 298static inline int proto_to_npindex(int proto)
 299{
 300        switch (proto) {
 301        case PPP_IP:
 302                return NP_IP;
 303        case PPP_IPV6:
 304                return NP_IPV6;
 305        case PPP_IPX:
 306                return NP_IPX;
 307        case PPP_AT:
 308                return NP_AT;
 309        case PPP_MPLS_UC:
 310                return NP_MPLS_UC;
 311        case PPP_MPLS_MC:
 312                return NP_MPLS_MC;
 313        }
 314        return -EINVAL;
 315}
 316
 317/* Translates an NP index into a PPP protocol number */
 318static const int npindex_to_proto[NUM_NP] = {
 319        PPP_IP,
 320        PPP_IPV6,
 321        PPP_IPX,
 322        PPP_AT,
 323        PPP_MPLS_UC,
 324        PPP_MPLS_MC,
 325};
 326
 327/* Translates an ethertype into an NP index */
 328static inline int ethertype_to_npindex(int ethertype)
 329{
 330        switch (ethertype) {
 331        case ETH_P_IP:
 332                return NP_IP;
 333        case ETH_P_IPV6:
 334                return NP_IPV6;
 335        case ETH_P_IPX:
 336                return NP_IPX;
 337        case ETH_P_PPPTALK:
 338        case ETH_P_ATALK:
 339                return NP_AT;
 340        case ETH_P_MPLS_UC:
 341                return NP_MPLS_UC;
 342        case ETH_P_MPLS_MC:
 343                return NP_MPLS_MC;
 344        }
 345        return -1;
 346}
 347
 348/* Translates an NP index into an ethertype */
 349static const int npindex_to_ethertype[NUM_NP] = {
 350        ETH_P_IP,
 351        ETH_P_IPV6,
 352        ETH_P_IPX,
 353        ETH_P_PPPTALK,
 354        ETH_P_MPLS_UC,
 355        ETH_P_MPLS_MC,
 356};
 357
 358/*
 359 * Locking shorthand.
 360 */
 361#define ppp_xmit_lock(ppp)      spin_lock_bh(&(ppp)->wlock)
 362#define ppp_xmit_unlock(ppp)    spin_unlock_bh(&(ppp)->wlock)
 363#define ppp_recv_lock(ppp)      spin_lock_bh(&(ppp)->rlock)
 364#define ppp_recv_unlock(ppp)    spin_unlock_bh(&(ppp)->rlock)
 365#define ppp_lock(ppp)           do { ppp_xmit_lock(ppp); \
 366                                     ppp_recv_lock(ppp); } while (0)
 367#define ppp_unlock(ppp)         do { ppp_recv_unlock(ppp); \
 368                                     ppp_xmit_unlock(ppp); } while (0)
 369
 370/*
 371 * /dev/ppp device routines.
 372 * The /dev/ppp device is used by pppd to control the ppp unit.
 373 * It supports the read, write, ioctl and poll functions.
 374 * Open instances of /dev/ppp can be in one of three states:
 375 * unattached, attached to a ppp unit, or attached to a ppp channel.
 376 */
 377static int ppp_open(struct inode *inode, struct file *file)
 378{
 379        /*
 380         * This could (should?) be enforced by the permissions on /dev/ppp.
 381         */
 382        if (!capable(CAP_NET_ADMIN))
 383                return -EPERM;
 384        return 0;
 385}
 386
 387static int ppp_release(struct inode *unused, struct file *file)
 388{
 389        struct ppp_file *pf = file->private_data;
 390        struct ppp *ppp;
 391
 392        if (pf) {
 393                file->private_data = NULL;
 394                if (pf->kind == INTERFACE) {
 395                        ppp = PF_TO_PPP(pf);
 396                        if (file == ppp->owner)
 397                                ppp_shutdown_interface(ppp);
 398                }
 399                if (atomic_dec_and_test(&pf->refcnt)) {
 400                        switch (pf->kind) {
 401                        case INTERFACE:
 402                                ppp_destroy_interface(PF_TO_PPP(pf));
 403                                break;
 404                        case CHANNEL:
 405                                ppp_destroy_channel(PF_TO_CHANNEL(pf));
 406                                break;
 407                        }
 408                }
 409        }
 410        return 0;
 411}
 412
 413static ssize_t ppp_read(struct file *file, char __user *buf,
 414                        size_t count, loff_t *ppos)
 415{
 416        struct ppp_file *pf = file->private_data;
 417        DECLARE_WAITQUEUE(wait, current);
 418        ssize_t ret;
 419        struct sk_buff *skb = NULL;
 420        struct iovec iov;
 421
 422        ret = count;
 423
 424        if (!pf)
 425                return -ENXIO;
 426        add_wait_queue(&pf->rwait, &wait);
 427        for (;;) {
 428                set_current_state(TASK_INTERRUPTIBLE);
 429                skb = skb_dequeue(&pf->rq);
 430                if (skb)
 431                        break;
 432                ret = 0;
 433                if (pf->dead)
 434                        break;
 435                if (pf->kind == INTERFACE) {
 436                        /*
 437                         * Return 0 (EOF) on an interface that has no
 438                         * channels connected, unless it is looping
 439                         * network traffic (demand mode).
 440                         */
 441                        struct ppp *ppp = PF_TO_PPP(pf);
 442                        if (ppp->n_channels == 0 &&
 443                            (ppp->flags & SC_LOOP_TRAFFIC) == 0)
 444                                break;
 445                }
 446                ret = -EAGAIN;
 447                if (file->f_flags & O_NONBLOCK)
 448                        break;
 449                ret = -ERESTARTSYS;
 450                if (signal_pending(current))
 451                        break;
 452                schedule();
 453        }
 454        set_current_state(TASK_RUNNING);
 455        remove_wait_queue(&pf->rwait, &wait);
 456
 457        if (!skb)
 458                goto out;
 459
 460        ret = -EOVERFLOW;
 461        if (skb->len > count)
 462                goto outf;
 463        ret = -EFAULT;
 464        iov.iov_base = buf;
 465        iov.iov_len = count;
 466        if (skb_copy_datagram_iovec(skb, 0, &iov, skb->len))
 467                goto outf;
 468        ret = skb->len;
 469
 470 outf:
 471        kfree_skb(skb);
 472 out:
 473        return ret;
 474}
 475
 476static ssize_t ppp_write(struct file *file, const char __user *buf,
 477                         size_t count, loff_t *ppos)
 478{
 479        struct ppp_file *pf = file->private_data;
 480        struct sk_buff *skb;
 481        ssize_t ret;
 482
 483        if (!pf)
 484                return -ENXIO;
 485        ret = -ENOMEM;
 486        skb = alloc_skb(count + pf->hdrlen, GFP_KERNEL);
 487        if (!skb)
 488                goto out;
 489        skb_reserve(skb, pf->hdrlen);
 490        ret = -EFAULT;
 491        if (copy_from_user(skb_put(skb, count), buf, count)) {
 492                kfree_skb(skb);
 493                goto out;
 494        }
 495
 496        skb_queue_tail(&pf->xq, skb);
 497
 498        switch (pf->kind) {
 499        case INTERFACE:
 500                ppp_xmit_process(PF_TO_PPP(pf));
 501                break;
 502        case CHANNEL:
 503                ppp_channel_push(PF_TO_CHANNEL(pf));
 504                break;
 505        }
 506
 507        ret = count;
 508
 509 out:
 510        return ret;
 511}
 512
 513/* No kernel lock - fine */
 514static unsigned int ppp_poll(struct file *file, poll_table *wait)
 515{
 516        struct ppp_file *pf = file->private_data;
 517        unsigned int mask;
 518
 519        if (!pf)
 520                return 0;
 521        poll_wait(file, &pf->rwait, wait);
 522        mask = POLLOUT | POLLWRNORM;
 523        if (skb_peek(&pf->rq))
 524                mask |= POLLIN | POLLRDNORM;
 525        if (pf->dead)
 526                mask |= POLLHUP;
 527        else if (pf->kind == INTERFACE) {
 528                /* see comment in ppp_read */
 529                struct ppp *ppp = PF_TO_PPP(pf);
 530                if (ppp->n_channels == 0 &&
 531                    (ppp->flags & SC_LOOP_TRAFFIC) == 0)
 532                        mask |= POLLIN | POLLRDNORM;
 533        }
 534
 535        return mask;
 536}
 537
 538#ifdef CONFIG_PPP_FILTER
 539static int get_filter(void __user *arg, struct sock_filter **p)
 540{
 541        struct sock_fprog uprog;
 542        struct sock_filter *code = NULL;
 543        int len, err;
 544
 545        if (copy_from_user(&uprog, arg, sizeof(uprog)))
 546                return -EFAULT;
 547
 548        if (!uprog.len) {
 549                *p = NULL;
 550                return 0;
 551        }
 552
 553        len = uprog.len * sizeof(struct sock_filter);
 554        code = memdup_user(uprog.filter, len);
 555        if (IS_ERR(code))
 556                return PTR_ERR(code);
 557
 558        err = sk_chk_filter(code, uprog.len);
 559        if (err) {
 560                kfree(code);
 561                return err;
 562        }
 563
 564        *p = code;
 565        return uprog.len;
 566}
 567#endif /* CONFIG_PPP_FILTER */
 568
 569static long ppp_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
 570{
 571        struct ppp_file *pf = file->private_data;
 572        struct ppp *ppp;
 573        int err = -EFAULT, val, val2, i;
 574        struct ppp_idle idle;
 575        struct npioctl npi;
 576        int unit, cflags;
 577        struct slcompress *vj;
 578        void __user *argp = (void __user *)arg;
 579        int __user *p = argp;
 580
 581        if (!pf)
 582                return ppp_unattached_ioctl(current->nsproxy->net_ns,
 583                                        pf, file, cmd, arg);
 584
 585        if (cmd == PPPIOCDETACH) {
 586                /*
 587                 * We have to be careful here... if the file descriptor
 588                 * has been dup'd, we could have another process in the
 589                 * middle of a poll using the same file *, so we had
 590                 * better not free the interface data structures -
 591                 * instead we fail the ioctl.  Even in this case, we
 592                 * shut down the interface if we are the owner of it.
 593                 * Actually, we should get rid of PPPIOCDETACH, userland
 594                 * (i.e. pppd) could achieve the same effect by closing
 595                 * this fd and reopening /dev/ppp.
 596                 */
 597                err = -EINVAL;
 598                mutex_lock(&ppp_mutex);
 599                if (pf->kind == INTERFACE) {
 600                        ppp = PF_TO_PPP(pf);
 601                        if (file == ppp->owner)
 602                                ppp_shutdown_interface(ppp);
 603                }
 604                if (atomic_long_read(&file->f_count) <= 2) {
 605                        ppp_release(NULL, file);
 606                        err = 0;
 607                } else
 608                        pr_warn("PPPIOCDETACH file->f_count=%ld\n",
 609                                atomic_long_read(&file->f_count));
 610                mutex_unlock(&ppp_mutex);
 611                return err;
 612        }
 613
 614        if (pf->kind == CHANNEL) {
 615                struct channel *pch;
 616                struct ppp_channel *chan;
 617
 618                mutex_lock(&ppp_mutex);
 619                pch = PF_TO_CHANNEL(pf);
 620
 621                switch (cmd) {
 622                case PPPIOCCONNECT:
 623                        if (get_user(unit, p))
 624                                break;
 625                        err = ppp_connect_channel(pch, unit);
 626                        break;
 627
 628                case PPPIOCDISCONN:
 629                        err = ppp_disconnect_channel(pch);
 630                        break;
 631
 632                default:
 633                        down_read(&pch->chan_sem);
 634                        chan = pch->chan;
 635                        err = -ENOTTY;
 636                        if (chan && chan->ops->ioctl)
 637                                err = chan->ops->ioctl(chan, cmd, arg);
 638                        up_read(&pch->chan_sem);
 639                }
 640                mutex_unlock(&ppp_mutex);
 641                return err;
 642        }
 643
 644        if (pf->kind != INTERFACE) {
 645                /* can't happen */
 646                pr_err("PPP: not interface or channel??\n");
 647                return -EINVAL;
 648        }
 649
 650        mutex_lock(&ppp_mutex);
 651        ppp = PF_TO_PPP(pf);
 652        switch (cmd) {
 653        case PPPIOCSMRU:
 654                if (get_user(val, p))
 655                        break;
 656                ppp->mru = val;
 657                err = 0;
 658                break;
 659
 660        case PPPIOCSFLAGS:
 661                if (get_user(val, p))
 662                        break;
 663                ppp_lock(ppp);
 664                cflags = ppp->flags & ~val;
 665                ppp->flags = val & SC_FLAG_BITS;
 666                ppp_unlock(ppp);
 667                if (cflags & SC_CCP_OPEN)
 668                        ppp_ccp_closed(ppp);
 669                err = 0;
 670                break;
 671
 672        case PPPIOCGFLAGS:
 673                val = ppp->flags | ppp->xstate | ppp->rstate;
 674                if (put_user(val, p))
 675                        break;
 676                err = 0;
 677                break;
 678
 679        case PPPIOCSCOMPRESS:
 680                err = ppp_set_compress(ppp, arg);
 681                break;
 682
 683        case PPPIOCGUNIT:
 684                if (put_user(ppp->file.index, p))
 685                        break;
 686                err = 0;
 687                break;
 688
 689        case PPPIOCSDEBUG:
 690                if (get_user(val, p))
 691                        break;
 692                ppp->debug = val;
 693                err = 0;
 694                break;
 695
 696        case PPPIOCGDEBUG:
 697                if (put_user(ppp->debug, p))
 698                        break;
 699                err = 0;
 700                break;
 701
 702        case PPPIOCGIDLE:
 703                idle.xmit_idle = (jiffies - ppp->last_xmit) / HZ;
 704                idle.recv_idle = (jiffies - ppp->last_recv) / HZ;
 705                if (copy_to_user(argp, &idle, sizeof(idle)))
 706                        break;
 707                err = 0;
 708                break;
 709
 710        case PPPIOCSMAXCID:
 711                if (get_user(val, p))
 712                        break;
 713                val2 = 15;
 714                if ((val >> 16) != 0) {
 715                        val2 = val >> 16;
 716                        val &= 0xffff;
 717                }
 718                vj = slhc_init(val2+1, val+1);
 719                if (!vj) {
 720                        netdev_err(ppp->dev,
 721                                   "PPP: no memory (VJ compressor)\n");
 722                        err = -ENOMEM;
 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                err = get_filter(argp, &code);
 759                if (err >= 0) {
 760                        ppp_lock(ppp);
 761                        kfree(ppp->pass_filter);
 762                        ppp->pass_filter = code;
 763                        ppp->pass_len = err;
 764                        ppp_unlock(ppp);
 765                        err = 0;
 766                }
 767                break;
 768        }
 769        case PPPIOCSACTIVE:
 770        {
 771                struct sock_filter *code;
 772                err = get_filter(argp, &code);
 773                if (err >= 0) {
 774                        ppp_lock(ppp);
 775                        kfree(ppp->active_filter);
 776                        ppp->active_filter = code;
 777                        ppp->active_len = err;
 778                        ppp_unlock(ppp);
 779                        err = 0;
 780                }
 781                break;
 782        }
 783#endif /* CONFIG_PPP_FILTER */
 784
 785#ifdef CONFIG_PPP_MULTILINK
 786        case PPPIOCSMRRU:
 787                if (get_user(val, p))
 788                        break;
 789                ppp_recv_lock(ppp);
 790                ppp->mrru = val;
 791                ppp_recv_unlock(ppp);
 792                err = 0;
 793                break;
 794#endif /* CONFIG_PPP_MULTILINK */
 795
 796        default:
 797                err = -ENOTTY;
 798        }
 799        mutex_unlock(&ppp_mutex);
 800        return err;
 801}
 802
 803static int ppp_unattached_ioctl(struct net *net, struct ppp_file *pf,
 804                        struct file *file, unsigned int cmd, unsigned long arg)
 805{
 806        int unit, err = -EFAULT;
 807        struct ppp *ppp;
 808        struct channel *chan;
 809        struct ppp_net *pn;
 810        int __user *p = (int __user *)arg;
 811
 812        mutex_lock(&ppp_mutex);
 813        switch (cmd) {
 814        case PPPIOCNEWUNIT:
 815                /* Create a new ppp unit */
 816                if (get_user(unit, p))
 817                        break;
 818                ppp = ppp_create_interface(net, unit, &err);
 819                if (!ppp)
 820                        break;
 821                file->private_data = &ppp->file;
 822                ppp->owner = file;
 823                err = -EFAULT;
 824                if (put_user(ppp->file.index, p))
 825                        break;
 826                err = 0;
 827                break;
 828
 829        case PPPIOCATTACH:
 830                /* Attach to an existing ppp unit */
 831                if (get_user(unit, p))
 832                        break;
 833                err = -ENXIO;
 834                pn = ppp_pernet(net);
 835                mutex_lock(&pn->all_ppp_mutex);
 836                ppp = ppp_find_unit(pn, unit);
 837                if (ppp) {
 838                        atomic_inc(&ppp->file.refcnt);
 839                        file->private_data = &ppp->file;
 840                        err = 0;
 841                }
 842                mutex_unlock(&pn->all_ppp_mutex);
 843                break;
 844
 845        case PPPIOCATTCHAN:
 846                if (get_user(unit, p))
 847                        break;
 848                err = -ENXIO;
 849                pn = ppp_pernet(net);
 850                spin_lock_bh(&pn->all_channels_lock);
 851                chan = ppp_find_channel(pn, unit);
 852                if (chan) {
 853                        atomic_inc(&chan->file.refcnt);
 854                        file->private_data = &chan->file;
 855                        err = 0;
 856                }
 857                spin_unlock_bh(&pn->all_channels_lock);
 858                break;
 859
 860        default:
 861                err = -ENOTTY;
 862        }
 863        mutex_unlock(&ppp_mutex);
 864        return err;
 865}
 866
 867static const struct file_operations ppp_device_fops = {
 868        .owner          = THIS_MODULE,
 869        .read           = ppp_read,
 870        .write          = ppp_write,
 871        .poll           = ppp_poll,
 872        .unlocked_ioctl = ppp_ioctl,
 873        .open           = ppp_open,
 874        .release        = ppp_release,
 875        .llseek         = noop_llseek,
 876};
 877
 878static __net_init int ppp_init_net(struct net *net)
 879{
 880        struct ppp_net *pn = net_generic(net, ppp_net_id);
 881
 882        idr_init(&pn->units_idr);
 883        mutex_init(&pn->all_ppp_mutex);
 884
 885        INIT_LIST_HEAD(&pn->all_channels);
 886        INIT_LIST_HEAD(&pn->new_channels);
 887
 888        spin_lock_init(&pn->all_channels_lock);
 889
 890        return 0;
 891}
 892
 893static __net_exit void ppp_exit_net(struct net *net)
 894{
 895        struct ppp_net *pn = net_generic(net, ppp_net_id);
 896
 897        idr_destroy(&pn->units_idr);
 898}
 899
 900static struct pernet_operations ppp_net_ops = {
 901        .init = ppp_init_net,
 902        .exit = ppp_exit_net,
 903        .id   = &ppp_net_id,
 904        .size = sizeof(struct ppp_net),
 905};
 906
 907#define PPP_MAJOR       108
 908
 909/* Called at boot time if ppp is compiled into the kernel,
 910   or at module load time (from init_module) if compiled as a module. */
 911static int __init ppp_init(void)
 912{
 913        int err;
 914
 915        pr_info("PPP generic driver version " PPP_VERSION "\n");
 916
 917        err = register_pernet_device(&ppp_net_ops);
 918        if (err) {
 919                pr_err("failed to register PPP pernet device (%d)\n", err);
 920                goto out;
 921        }
 922
 923        err = register_chrdev(PPP_MAJOR, "ppp", &ppp_device_fops);
 924        if (err) {
 925                pr_err("failed to register PPP device (%d)\n", err);
 926                goto out_net;
 927        }
 928
 929        ppp_class = class_create(THIS_MODULE, "ppp");
 930        if (IS_ERR(ppp_class)) {
 931                err = PTR_ERR(ppp_class);
 932                goto out_chrdev;
 933        }
 934
 935        /* not a big deal if we fail here :-) */
 936        device_create(ppp_class, NULL, MKDEV(PPP_MAJOR, 0), NULL, "ppp");
 937
 938        return 0;
 939
 940out_chrdev:
 941        unregister_chrdev(PPP_MAJOR, "ppp");
 942out_net:
 943        unregister_pernet_device(&ppp_net_ops);
 944out:
 945        return err;
 946}
 947
 948/*
 949 * Network interface unit routines.
 950 */
 951static netdev_tx_t
 952ppp_start_xmit(struct sk_buff *skb, struct net_device *dev)
 953{
 954        struct ppp *ppp = netdev_priv(dev);
 955        int npi, proto;
 956        unsigned char *pp;
 957
 958        npi = ethertype_to_npindex(ntohs(skb->protocol));
 959        if (npi < 0)
 960                goto outf;
 961
 962        /* Drop, accept or reject the packet */
 963        switch (ppp->npmode[npi]) {
 964        case NPMODE_PASS:
 965                break;
 966        case NPMODE_QUEUE:
 967                /* it would be nice to have a way to tell the network
 968                   system to queue this one up for later. */
 969                goto outf;
 970        case NPMODE_DROP:
 971        case NPMODE_ERROR:
 972                goto outf;
 973        }
 974
 975        /* Put the 2-byte PPP protocol number on the front,
 976           making sure there is room for the address and control fields. */
 977        if (skb_cow_head(skb, PPP_HDRLEN))
 978                goto outf;
 979
 980        pp = skb_push(skb, 2);
 981        proto = npindex_to_proto[npi];
 982        put_unaligned_be16(proto, pp);
 983
 984        skb_queue_tail(&ppp->file.xq, skb);
 985        ppp_xmit_process(ppp);
 986        return NETDEV_TX_OK;
 987
 988 outf:
 989        kfree_skb(skb);
 990        ++dev->stats.tx_dropped;
 991        return NETDEV_TX_OK;
 992}
 993
 994static int
 995ppp_net_ioctl(struct net_device *dev, struct ifreq *ifr, int cmd)
 996{
 997        struct ppp *ppp = netdev_priv(dev);
 998        int err = -EFAULT;
 999        void __user *addr = (void __user *) ifr->ifr_ifru.ifru_data;
1000        struct ppp_stats stats;
1001        struct ppp_comp_stats cstats;
1002        char *vers;
1003
1004        switch (cmd) {
1005        case SIOCGPPPSTATS:
1006                ppp_get_stats(ppp, &stats);
1007                if (copy_to_user(addr, &stats, sizeof(stats)))
1008                        break;
1009                err = 0;
1010                break;
1011
1012        case SIOCGPPPCSTATS:
1013                memset(&cstats, 0, sizeof(cstats));
1014                if (ppp->xc_state)
1015                        ppp->xcomp->comp_stat(ppp->xc_state, &cstats.c);
1016                if (ppp->rc_state)
1017                        ppp->rcomp->decomp_stat(ppp->rc_state, &cstats.d);
1018                if (copy_to_user(addr, &cstats, sizeof(cstats)))
1019                        break;
1020                err = 0;
1021                break;
1022
1023        case SIOCGPPPVER:
1024                vers = PPP_VERSION;
1025                if (copy_to_user(addr, vers, strlen(vers) + 1))
1026                        break;
1027                err = 0;
1028                break;
1029
1030        default:
1031                err = -EINVAL;
1032        }
1033
1034        return err;
1035}
1036
1037static void
1038ppp_get_stats64(struct net_device *dev, struct rtnl_link_stats64 *stats64)
1039{
1040        struct ppp *ppp = netdev_priv(dev);
1041
1042        ppp_recv_lock(ppp);
1043        stats64->rx_packets = ppp->stats64.rx_packets;
1044        stats64->rx_bytes   = ppp->stats64.rx_bytes;
1045        ppp_recv_unlock(ppp);
1046
1047        ppp_xmit_lock(ppp);
1048        stats64->tx_packets = ppp->stats64.tx_packets;
1049        stats64->tx_bytes   = ppp->stats64.tx_bytes;
1050        ppp_xmit_unlock(ppp);
1051
1052        stats64->rx_errors        = dev->stats.rx_errors;
1053        stats64->tx_errors        = dev->stats.tx_errors;
1054        stats64->rx_dropped       = dev->stats.rx_dropped;
1055        stats64->tx_dropped       = dev->stats.tx_dropped;
1056        stats64->rx_length_errors = dev->stats.rx_length_errors;
1057}
1058
1059static int ppp_dev_init(struct net_device *dev)
1060{
1061        netdev_lockdep_set_classes(dev);
1062        return 0;
1063}
1064
1065static const struct net_device_ops ppp_netdev_ops = {
1066        .ndo_init        = ppp_dev_init,
1067        .ndo_start_xmit  = ppp_start_xmit,
1068        .ndo_do_ioctl    = ppp_net_ioctl,
1069        .ndo_get_stats64 = ppp_get_stats64,
1070};
1071
1072static void ppp_setup(struct net_device *dev)
1073{
1074        dev->netdev_ops = &ppp_netdev_ops;
1075        dev->hard_header_len = PPP_HDRLEN;
1076        dev->mtu = PPP_MRU;
1077        dev->addr_len = 0;
1078        dev->tx_queue_len = 3;
1079        dev->type = ARPHRD_PPP;
1080        dev->flags = IFF_POINTOPOINT | IFF_NOARP | IFF_MULTICAST;
1081        dev->features |= NETIF_F_NETNS_LOCAL;
1082        netif_keep_dst(dev);
1083}
1084
1085/*
1086 * Transmit-side routines.
1087 */
1088
1089/*
1090 * Called to do any work queued up on the transmit side
1091 * that can now be done.
1092 */
1093static void
1094ppp_xmit_process(struct ppp *ppp)
1095{
1096        struct sk_buff *skb;
1097
1098        ppp_xmit_lock(ppp);
1099        if (!ppp->closing) {
1100                ppp_push(ppp);
1101                while (!ppp->xmit_pending &&
1102                       (skb = skb_dequeue(&ppp->file.xq)))
1103                        ppp_send_frame(ppp, skb);
1104                /* If there's no work left to do, tell the core net
1105                   code that we can accept some more. */
1106                if (!ppp->xmit_pending && !skb_peek(&ppp->file.xq))
1107                        netif_wake_queue(ppp->dev);
1108                else
1109                        netif_stop_queue(ppp->dev);
1110        }
1111        ppp_xmit_unlock(ppp);
1112}
1113
1114static inline struct sk_buff *
1115pad_compress_skb(struct ppp *ppp, struct sk_buff *skb)
1116{
1117        struct sk_buff *new_skb;
1118        int len;
1119        int new_skb_size = ppp->dev->mtu +
1120                ppp->xcomp->comp_extra + ppp->dev->hard_header_len;
1121        int compressor_skb_size = ppp->dev->mtu +
1122                ppp->xcomp->comp_extra + PPP_HDRLEN;
1123        new_skb = alloc_skb(new_skb_size, GFP_ATOMIC);
1124        if (!new_skb) {
1125                if (net_ratelimit())
1126                        netdev_err(ppp->dev, "PPP: no memory (comp pkt)\n");
1127                return NULL;
1128        }
1129        if (ppp->dev->hard_header_len > PPP_HDRLEN)
1130                skb_reserve(new_skb,
1131                            ppp->dev->hard_header_len - PPP_HDRLEN);
1132
1133        /* compressor still expects A/C bytes in hdr */
1134        len = ppp->xcomp->compress(ppp->xc_state, skb->data - 2,
1135                                   new_skb->data, skb->len + 2,
1136                                   compressor_skb_size);
1137        if (len > 0 && (ppp->flags & SC_CCP_UP)) {
1138                consume_skb(skb);
1139                skb = new_skb;
1140                skb_put(skb, len);
1141                skb_pull(skb, 2);       /* pull off A/C bytes */
1142        } else if (len == 0) {
1143                /* didn't compress, or CCP not up yet */
1144                consume_skb(new_skb);
1145                new_skb = skb;
1146        } else {
1147                /*
1148                 * (len < 0)
1149                 * MPPE requires that we do not send unencrypted
1150                 * frames.  The compressor will return -1 if we
1151                 * should drop the frame.  We cannot simply test
1152                 * the compress_proto because MPPE and MPPC share
1153                 * the same number.
1154                 */
1155                if (net_ratelimit())
1156                        netdev_err(ppp->dev, "ppp: compressor dropped pkt\n");
1157                kfree_skb(skb);
1158                consume_skb(new_skb);
1159                new_skb = NULL;
1160        }
1161        return new_skb;
1162}
1163
1164/*
1165 * Compress and send a frame.
1166 * The caller should have locked the xmit path,
1167 * and xmit_pending should be 0.
1168 */
1169static void
1170ppp_send_frame(struct ppp *ppp, struct sk_buff *skb)
1171{
1172        int proto = PPP_PROTO(skb);
1173        struct sk_buff *new_skb;
1174        int len;
1175        unsigned char *cp;
1176
1177        if (proto < 0x8000) {
1178#ifdef CONFIG_PPP_FILTER
1179                /* check if we should pass this packet */
1180                /* the filter instructions are constructed assuming
1181                   a four-byte PPP header on each packet */
1182                *(u8 *)skb_push(skb, 2) = 1;
1183                if (ppp->pass_filter &&
1184                    sk_run_filter(skb, ppp->pass_filter) == 0) {
1185                        if (ppp->debug & 1)
1186                                netdev_printk(KERN_DEBUG, ppp->dev,
1187                                              "PPP: outbound frame "
1188                                              "not passed\n");
1189                        kfree_skb(skb);
1190                        return;
1191                }
1192                /* if this packet passes the active filter, record the time */
1193                if (!(ppp->active_filter &&
1194                      sk_run_filter(skb, ppp->active_filter) == 0))
1195                        ppp->last_xmit = jiffies;
1196                skb_pull(skb, 2);
1197#else
1198                /* for data packets, record the time */
1199                ppp->last_xmit = jiffies;
1200#endif /* CONFIG_PPP_FILTER */
1201        }
1202
1203        ++ppp->stats64.tx_packets;
1204        ppp->stats64.tx_bytes += skb->len - 2;
1205
1206        switch (proto) {
1207        case PPP_IP:
1208                if (!ppp->vj || (ppp->flags & SC_COMP_TCP) == 0)
1209                        break;
1210                /* try to do VJ TCP header compression */
1211                new_skb = alloc_skb(skb->len + ppp->dev->hard_header_len - 2,
1212                                    GFP_ATOMIC);
1213                if (!new_skb) {
1214                        netdev_err(ppp->dev, "PPP: no memory (VJ comp pkt)\n");
1215                        goto drop;
1216                }
1217                skb_reserve(new_skb, ppp->dev->hard_header_len - 2);
1218                cp = skb->data + 2;
1219                len = slhc_compress(ppp->vj, cp, skb->len - 2,
1220                                    new_skb->data + 2, &cp,
1221                                    !(ppp->flags & SC_NO_TCP_CCID));
1222                if (cp == skb->data + 2) {
1223                        /* didn't compress */
1224                        consume_skb(new_skb);
1225                } else {
1226                        if (cp[0] & SL_TYPE_COMPRESSED_TCP) {
1227                                proto = PPP_VJC_COMP;
1228                                cp[0] &= ~SL_TYPE_COMPRESSED_TCP;
1229                        } else {
1230                                proto = PPP_VJC_UNCOMP;
1231                                cp[0] = skb->data[2];
1232                        }
1233                        consume_skb(skb);
1234                        skb = new_skb;
1235                        cp = skb_put(skb, len + 2);
1236                        cp[0] = 0;
1237                        cp[1] = proto;
1238                }
1239                break;
1240
1241        case PPP_CCP:
1242                /* peek at outbound CCP frames */
1243                ppp_ccp_peek(ppp, skb, 0);
1244                break;
1245        }
1246
1247        /* try to do packet compression */
1248        if ((ppp->xstate & SC_COMP_RUN) && ppp->xc_state &&
1249            proto != PPP_LCP && proto != PPP_CCP) {
1250                if (!(ppp->flags & SC_CCP_UP) && (ppp->flags & SC_MUST_COMP)) {
1251                        if (net_ratelimit())
1252                                netdev_err(ppp->dev,
1253                                           "ppp: compression required but "
1254                                           "down - pkt dropped.\n");
1255                        goto drop;
1256                }
1257                skb = pad_compress_skb(ppp, skb);
1258                if (!skb)
1259                        goto drop;
1260        }
1261
1262        /*
1263         * If we are waiting for traffic (demand dialling),
1264         * queue it up for pppd to receive.
1265         */
1266        if (ppp->flags & SC_LOOP_TRAFFIC) {
1267                if (ppp->file.rq.qlen > PPP_MAX_RQLEN)
1268                        goto drop;
1269                skb_queue_tail(&ppp->file.rq, skb);
1270                wake_up_interruptible(&ppp->file.rwait);
1271                return;
1272        }
1273
1274        ppp->xmit_pending = skb;
1275        ppp_push(ppp);
1276        return;
1277
1278 drop:
1279        kfree_skb(skb);
1280        ++ppp->dev->stats.tx_errors;
1281}
1282
1283/*
1284 * Try to send the frame in xmit_pending.
1285 * The caller should have the xmit path locked.
1286 */
1287static void
1288ppp_push(struct ppp *ppp)
1289{
1290        struct list_head *list;
1291        struct channel *pch;
1292        struct sk_buff *skb = ppp->xmit_pending;
1293
1294        if (!skb)
1295                return;
1296
1297        list = &ppp->channels;
1298        if (list_empty(list)) {
1299                /* nowhere to send the packet, just drop it */
1300                ppp->xmit_pending = NULL;
1301                kfree_skb(skb);
1302                return;
1303        }
1304
1305        if ((ppp->flags & SC_MULTILINK) == 0) {
1306                /* not doing multilink: send it down the first channel */
1307                list = list->next;
1308                pch = list_entry(list, struct channel, clist);
1309
1310                spin_lock_bh(&pch->downl);
1311                if (pch->chan) {
1312                        if (pch->chan->ops->start_xmit(pch->chan, skb))
1313                                ppp->xmit_pending = NULL;
1314                } else {
1315                        /* channel got unregistered */
1316                        kfree_skb(skb);
1317                        ppp->xmit_pending = NULL;
1318                }
1319                spin_unlock_bh(&pch->downl);
1320                return;
1321        }
1322
1323#ifdef CONFIG_PPP_MULTILINK
1324        /* Multilink: fragment the packet over as many links
1325           as can take the packet at the moment. */
1326        if (!ppp_mp_explode(ppp, skb))
1327                return;
1328#endif /* CONFIG_PPP_MULTILINK */
1329
1330        ppp->xmit_pending = NULL;
1331        kfree_skb(skb);
1332}
1333
1334#ifdef CONFIG_PPP_MULTILINK
1335static bool mp_protocol_compress __read_mostly = true;
1336module_param(mp_protocol_compress, bool, S_IRUGO | S_IWUSR);
1337MODULE_PARM_DESC(mp_protocol_compress,
1338                 "compress protocol id in multilink fragments");
1339
1340/*
1341 * Divide a packet to be transmitted into fragments and
1342 * send them out the individual links.
1343 */
1344static int ppp_mp_explode(struct ppp *ppp, struct sk_buff *skb)
1345{
1346        int len, totlen;
1347        int i, bits, hdrlen, mtu;
1348        int flen;
1349        int navail, nfree, nzero;
1350        int nbigger;
1351        int totspeed;
1352        int totfree;
1353        unsigned char *p, *q;
1354        struct list_head *list;
1355        struct channel *pch;
1356        struct sk_buff *frag;
1357        struct ppp_channel *chan;
1358
1359        totspeed = 0; /*total bitrate of the bundle*/
1360        nfree = 0; /* # channels which have no packet already queued */
1361        navail = 0; /* total # of usable channels (not deregistered) */
1362        nzero = 0; /* number of channels with zero speed associated*/
1363        totfree = 0; /*total # of channels available and
1364                                  *having no queued packets before
1365                                  *starting the fragmentation*/
1366
1367        hdrlen = (ppp->flags & SC_MP_XSHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1368        i = 0;
1369        list_for_each_entry(pch, &ppp->channels, clist) {
1370                if (pch->chan) {
1371                        pch->avail = 1;
1372                        navail++;
1373                        pch->speed = pch->chan->speed;
1374                } else {
1375                        pch->avail = 0;
1376                }
1377                if (pch->avail) {
1378                        if (skb_queue_empty(&pch->file.xq) ||
1379                                !pch->had_frag) {
1380                                        if (pch->speed == 0)
1381                                                nzero++;
1382                                        else
1383                                                totspeed += pch->speed;
1384
1385                                        pch->avail = 2;
1386                                        ++nfree;
1387                                        ++totfree;
1388                                }
1389                        if (!pch->had_frag && i < ppp->nxchan)
1390                                ppp->nxchan = i;
1391                }
1392                ++i;
1393        }
1394        /*
1395         * Don't start sending this packet unless at least half of
1396         * the channels are free.  This gives much better TCP
1397         * performance if we have a lot of channels.
1398         */
1399        if (nfree == 0 || nfree < navail / 2)
1400                return 0; /* can't take now, leave it in xmit_pending */
1401
1402        /* Do protocol field compression */
1403        p = skb->data;
1404        len = skb->len;
1405        if (*p == 0 && mp_protocol_compress) {
1406                ++p;
1407                --len;
1408        }
1409
1410        totlen = len;
1411        nbigger = len % nfree;
1412
1413        /* skip to the channel after the one we last used
1414           and start at that one */
1415        list = &ppp->channels;
1416        for (i = 0; i < ppp->nxchan; ++i) {
1417                list = list->next;
1418                if (list == &ppp->channels) {
1419                        i = 0;
1420                        break;
1421                }
1422        }
1423
1424        /* create a fragment for each channel */
1425        bits = B;
1426        while (len > 0) {
1427                list = list->next;
1428                if (list == &ppp->channels) {
1429                        i = 0;
1430                        continue;
1431                }
1432                pch = list_entry(list, struct channel, clist);
1433                ++i;
1434                if (!pch->avail)
1435                        continue;
1436
1437                /*
1438                 * Skip this channel if it has a fragment pending already and
1439                 * we haven't given a fragment to all of the free channels.
1440                 */
1441                if (pch->avail == 1) {
1442                        if (nfree > 0)
1443                                continue;
1444                } else {
1445                        pch->avail = 1;
1446                }
1447
1448                /* check the channel's mtu and whether it is still attached. */
1449                spin_lock_bh(&pch->downl);
1450                if (pch->chan == NULL) {
1451                        /* can't use this channel, it's being deregistered */
1452                        if (pch->speed == 0)
1453                                nzero--;
1454                        else
1455                                totspeed -= pch->speed;
1456
1457                        spin_unlock_bh(&pch->downl);
1458                        pch->avail = 0;
1459                        totlen = len;
1460                        totfree--;
1461                        nfree--;
1462                        if (--navail == 0)
1463                                break;
1464                        continue;
1465                }
1466
1467                /*
1468                *if the channel speed is not set divide
1469                *the packet evenly among the free channels;
1470                *otherwise divide it according to the speed
1471                *of the channel we are going to transmit on
1472                */
1473                flen = len;
1474                if (nfree > 0) {
1475                        if (pch->speed == 0) {
1476                                flen = len/nfree;
1477                                if (nbigger > 0) {
1478                                        flen++;
1479                                        nbigger--;
1480                                }
1481                        } else {
1482                                flen = (((totfree - nzero)*(totlen + hdrlen*totfree)) /
1483                                        ((totspeed*totfree)/pch->speed)) - hdrlen;
1484                                if (nbigger > 0) {
1485                                        flen += ((totfree - nzero)*pch->speed)/totspeed;
1486                                        nbigger -= ((totfree - nzero)*pch->speed)/
1487                                                        totspeed;
1488                                }
1489                        }
1490                        nfree--;
1491                }
1492
1493                /*
1494                 *check if we are on the last channel or
1495                 *we exceded the length of the data to
1496                 *fragment
1497                 */
1498                if ((nfree <= 0) || (flen > len))
1499                        flen = len;
1500                /*
1501                 *it is not worth to tx on slow channels:
1502                 *in that case from the resulting flen according to the
1503                 *above formula will be equal or less than zero.
1504                 *Skip the channel in this case
1505                 */
1506                if (flen <= 0) {
1507                        pch->avail = 2;
1508                        spin_unlock_bh(&pch->downl);
1509                        continue;
1510                }
1511
1512                /*
1513                 * hdrlen includes the 2-byte PPP protocol field, but the
1514                 * MTU counts only the payload excluding the protocol field.
1515                 * (RFC1661 Section 2)
1516                 */
1517                mtu = pch->chan->mtu - (hdrlen - 2);
1518                if (mtu < 4)
1519                        mtu = 4;
1520                if (flen > mtu)
1521                        flen = mtu;
1522                if (flen == len)
1523                        bits |= E;
1524                frag = alloc_skb(flen + hdrlen + (flen == 0), GFP_ATOMIC);
1525                if (!frag)
1526                        goto noskb;
1527                q = skb_put(frag, flen + hdrlen);
1528
1529                /* make the MP header */
1530                put_unaligned_be16(PPP_MP, q);
1531                if (ppp->flags & SC_MP_XSHORTSEQ) {
1532                        q[2] = bits + ((ppp->nxseq >> 8) & 0xf);
1533                        q[3] = ppp->nxseq;
1534                } else {
1535                        q[2] = bits;
1536                        q[3] = ppp->nxseq >> 16;
1537                        q[4] = ppp->nxseq >> 8;
1538                        q[5] = ppp->nxseq;
1539                }
1540
1541                memcpy(q + hdrlen, p, flen);
1542
1543                /* try to send it down the channel */
1544                chan = pch->chan;
1545                if (!skb_queue_empty(&pch->file.xq) ||
1546                        !chan->ops->start_xmit(chan, frag))
1547                        skb_queue_tail(&pch->file.xq, frag);
1548                pch->had_frag = 1;
1549                p += flen;
1550                len -= flen;
1551                ++ppp->nxseq;
1552                bits = 0;
1553                spin_unlock_bh(&pch->downl);
1554        }
1555        ppp->nxchan = i;
1556
1557        return 1;
1558
1559 noskb:
1560        spin_unlock_bh(&pch->downl);
1561        if (ppp->debug & 1)
1562                netdev_err(ppp->dev, "PPP: no memory (fragment)\n");
1563        ++ppp->dev->stats.tx_errors;
1564        ++ppp->nxseq;
1565        return 1;       /* abandon the frame */
1566}
1567#endif /* CONFIG_PPP_MULTILINK */
1568
1569/*
1570 * Try to send data out on a channel.
1571 */
1572static void
1573ppp_channel_push(struct channel *pch)
1574{
1575        struct sk_buff *skb;
1576        struct ppp *ppp;
1577
1578        spin_lock_bh(&pch->downl);
1579        if (pch->chan) {
1580                while (!skb_queue_empty(&pch->file.xq)) {
1581                        skb = skb_dequeue(&pch->file.xq);
1582                        if (!pch->chan->ops->start_xmit(pch->chan, skb)) {
1583                                /* put the packet back and try again later */
1584                                skb_queue_head(&pch->file.xq, skb);
1585                                break;
1586                        }
1587                }
1588        } else {
1589                /* channel got deregistered */
1590                skb_queue_purge(&pch->file.xq);
1591        }
1592        spin_unlock_bh(&pch->downl);
1593        /* see if there is anything from the attached unit to be sent */
1594        if (skb_queue_empty(&pch->file.xq)) {
1595                read_lock_bh(&pch->upl);
1596                ppp = pch->ppp;
1597                if (ppp)
1598                        ppp_xmit_process(ppp);
1599                read_unlock_bh(&pch->upl);
1600        }
1601}
1602
1603/*
1604 * Receive-side routines.
1605 */
1606
1607struct ppp_mp_skb_parm {
1608        u32             sequence;
1609        u8              BEbits;
1610};
1611#define PPP_MP_CB(skb)  ((struct ppp_mp_skb_parm *)((skb)->cb))
1612
1613static inline void
1614ppp_do_recv(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1615{
1616        ppp_recv_lock(ppp);
1617        if (!ppp->closing)
1618                ppp_receive_frame(ppp, skb, pch);
1619        else
1620                kfree_skb(skb);
1621        ppp_recv_unlock(ppp);
1622}
1623
1624void
1625ppp_input(struct ppp_channel *chan, struct sk_buff *skb)
1626{
1627        struct channel *pch = chan->ppp;
1628        int proto;
1629
1630        if (!pch) {
1631                kfree_skb(skb);
1632                return;
1633        }
1634
1635        read_lock_bh(&pch->upl);
1636        if (!pskb_may_pull(skb, 2)) {
1637                kfree_skb(skb);
1638                if (pch->ppp) {
1639                        ++pch->ppp->dev->stats.rx_length_errors;
1640                        ppp_receive_error(pch->ppp);
1641                }
1642                goto done;
1643        }
1644
1645        proto = PPP_PROTO(skb);
1646        if (!pch->ppp || proto >= 0xc000 || proto == PPP_CCPFRAG) {
1647                /* put it on the channel queue */
1648                skb_queue_tail(&pch->file.rq, skb);
1649                /* drop old frames if queue too long */
1650                while (pch->file.rq.qlen > PPP_MAX_RQLEN &&
1651                       (skb = skb_dequeue(&pch->file.rq)))
1652                        kfree_skb(skb);
1653                wake_up_interruptible(&pch->file.rwait);
1654        } else {
1655                ppp_do_recv(pch->ppp, skb, pch);
1656        }
1657
1658done:
1659        read_unlock_bh(&pch->upl);
1660}
1661
1662/* Put a 0-length skb in the receive queue as an error indication */
1663void
1664ppp_input_error(struct ppp_channel *chan, int code)
1665{
1666        struct channel *pch = chan->ppp;
1667        struct sk_buff *skb;
1668
1669        if (!pch)
1670                return;
1671
1672        read_lock_bh(&pch->upl);
1673        if (pch->ppp) {
1674                skb = alloc_skb(0, GFP_ATOMIC);
1675                if (skb) {
1676                        skb->len = 0;           /* probably unnecessary */
1677                        skb->cb[0] = code;
1678                        ppp_do_recv(pch->ppp, skb, pch);
1679                }
1680        }
1681        read_unlock_bh(&pch->upl);
1682}
1683
1684/*
1685 * We come in here to process a received frame.
1686 * The receive side of the ppp unit is locked.
1687 */
1688static void
1689ppp_receive_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1690{
1691        /* note: a 0-length skb is used as an error indication */
1692        if (skb->len > 0) {
1693#ifdef CONFIG_PPP_MULTILINK
1694                /* XXX do channel-level decompression here */
1695                if (PPP_PROTO(skb) == PPP_MP)
1696                        ppp_receive_mp_frame(ppp, skb, pch);
1697                else
1698#endif /* CONFIG_PPP_MULTILINK */
1699                        ppp_receive_nonmp_frame(ppp, skb);
1700        } else {
1701                kfree_skb(skb);
1702                ppp_receive_error(ppp);
1703        }
1704}
1705
1706static void
1707ppp_receive_error(struct ppp *ppp)
1708{
1709        ++ppp->dev->stats.rx_errors;
1710        if (ppp->vj)
1711                slhc_toss(ppp->vj);
1712}
1713
1714static void
1715ppp_receive_nonmp_frame(struct ppp *ppp, struct sk_buff *skb)
1716{
1717        struct sk_buff *ns;
1718        int proto, len, npi;
1719
1720        /*
1721         * Decompress the frame, if compressed.
1722         * Note that some decompressors need to see uncompressed frames
1723         * that come in as well as compressed frames.
1724         */
1725        if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN) &&
1726            (ppp->rstate & (SC_DC_FERROR | SC_DC_ERROR)) == 0)
1727                skb = ppp_decompress_frame(ppp, skb);
1728
1729        if (ppp->flags & SC_MUST_COMP && ppp->rstate & SC_DC_FERROR)
1730                goto err;
1731
1732        proto = PPP_PROTO(skb);
1733        switch (proto) {
1734        case PPP_VJC_COMP:
1735                /* decompress VJ compressed packets */
1736                if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
1737                        goto err;
1738
1739                if (skb_tailroom(skb) < 124 || skb_cloned(skb)) {
1740                        /* copy to a new sk_buff with more tailroom */
1741                        ns = dev_alloc_skb(skb->len + 128);
1742                        if (!ns) {
1743                                netdev_err(ppp->dev, "PPP: no memory "
1744                                           "(VJ decomp)\n");
1745                                goto err;
1746                        }
1747                        skb_reserve(ns, 2);
1748                        skb_copy_bits(skb, 0, skb_put(ns, skb->len), skb->len);
1749                        consume_skb(skb);
1750                        skb = ns;
1751                }
1752                else
1753                        skb->ip_summed = CHECKSUM_NONE;
1754
1755                len = slhc_uncompress(ppp->vj, skb->data + 2, skb->len - 2);
1756                if (len <= 0) {
1757                        netdev_printk(KERN_DEBUG, ppp->dev,
1758                                      "PPP: VJ decompression error\n");
1759                        goto err;
1760                }
1761                len += 2;
1762                if (len > skb->len)
1763                        skb_put(skb, len - skb->len);
1764                else if (len < skb->len)
1765                        skb_trim(skb, len);
1766                proto = PPP_IP;
1767                break;
1768
1769        case PPP_VJC_UNCOMP:
1770                if (!ppp->vj || (ppp->flags & SC_REJ_COMP_TCP))
1771                        goto err;
1772
1773                /* Until we fix the decompressor need to make sure
1774                 * data portion is linear.
1775                 */
1776                if (!pskb_may_pull(skb, skb->len))
1777                        goto err;
1778
1779                if (slhc_remember(ppp->vj, skb->data + 2, skb->len - 2) <= 0) {
1780                        netdev_err(ppp->dev, "PPP: VJ uncompressed error\n");
1781                        goto err;
1782                }
1783                proto = PPP_IP;
1784                break;
1785
1786        case PPP_CCP:
1787                ppp_ccp_peek(ppp, skb, 1);
1788                break;
1789        }
1790
1791        ++ppp->stats64.rx_packets;
1792        ppp->stats64.rx_bytes += skb->len - 2;
1793
1794        npi = proto_to_npindex(proto);
1795        if (npi < 0) {
1796                /* control or unknown frame - pass it to pppd */
1797                skb_queue_tail(&ppp->file.rq, skb);
1798                /* limit queue length by dropping old frames */
1799                while (ppp->file.rq.qlen > PPP_MAX_RQLEN &&
1800                       (skb = skb_dequeue(&ppp->file.rq)))
1801                        kfree_skb(skb);
1802                /* wake up any process polling or blocking on read */
1803                wake_up_interruptible(&ppp->file.rwait);
1804
1805        } else {
1806                /* network protocol frame - give it to the kernel */
1807
1808#ifdef CONFIG_PPP_FILTER
1809                /* check if the packet passes the pass and active filters */
1810                /* the filter instructions are constructed assuming
1811                   a four-byte PPP header on each packet */
1812                if (ppp->pass_filter || ppp->active_filter) {
1813                        if (skb_unclone(skb, GFP_ATOMIC))
1814                                goto err;
1815
1816                        *(u8 *)skb_push(skb, 2) = 0;
1817                        if (ppp->pass_filter &&
1818                            sk_run_filter(skb, ppp->pass_filter) == 0) {
1819                                if (ppp->debug & 1)
1820                                        netdev_printk(KERN_DEBUG, ppp->dev,
1821                                                      "PPP: inbound frame "
1822                                                      "not passed\n");
1823                                kfree_skb(skb);
1824                                return;
1825                        }
1826                        if (!(ppp->active_filter &&
1827                              sk_run_filter(skb, ppp->active_filter) == 0))
1828                                ppp->last_recv = jiffies;
1829                        __skb_pull(skb, 2);
1830                } else
1831#endif /* CONFIG_PPP_FILTER */
1832                        ppp->last_recv = jiffies;
1833
1834                if ((ppp->dev->flags & IFF_UP) == 0 ||
1835                    ppp->npmode[npi] != NPMODE_PASS) {
1836                        kfree_skb(skb);
1837                } else {
1838                        /* chop off protocol */
1839                        skb_pull_rcsum(skb, 2);
1840                        skb->dev = ppp->dev;
1841                        skb->protocol = htons(npindex_to_ethertype[npi]);
1842                        skb_reset_mac_header(skb);
1843                        netif_rx(skb);
1844                }
1845        }
1846        return;
1847
1848 err:
1849        kfree_skb(skb);
1850        ppp_receive_error(ppp);
1851}
1852
1853static struct sk_buff *
1854ppp_decompress_frame(struct ppp *ppp, struct sk_buff *skb)
1855{
1856        int proto = PPP_PROTO(skb);
1857        struct sk_buff *ns;
1858        int len;
1859
1860        /* Until we fix all the decompressor's need to make sure
1861         * data portion is linear.
1862         */
1863        if (!pskb_may_pull(skb, skb->len))
1864                goto err;
1865
1866        if (proto == PPP_COMP) {
1867                int obuff_size;
1868
1869                switch(ppp->rcomp->compress_proto) {
1870                case CI_MPPE:
1871                        obuff_size = ppp->mru + PPP_HDRLEN + 1;
1872                        break;
1873                default:
1874                        obuff_size = ppp->mru + PPP_HDRLEN;
1875                        break;
1876                }
1877
1878                ns = dev_alloc_skb(obuff_size);
1879                if (!ns) {
1880                        netdev_err(ppp->dev, "ppp_decompress_frame: "
1881                                   "no memory\n");
1882                        goto err;
1883                }
1884                /* the decompressor still expects the A/C bytes in the hdr */
1885                len = ppp->rcomp->decompress(ppp->rc_state, skb->data - 2,
1886                                skb->len + 2, ns->data, obuff_size);
1887                if (len < 0) {
1888                        /* Pass the compressed frame to pppd as an
1889                           error indication. */
1890                        if (len == DECOMP_FATALERROR)
1891                                ppp->rstate |= SC_DC_FERROR;
1892                        kfree_skb(ns);
1893                        goto err;
1894                }
1895
1896                consume_skb(skb);
1897                skb = ns;
1898                skb_put(skb, len);
1899                skb_pull(skb, 2);       /* pull off the A/C bytes */
1900
1901        } else {
1902                /* Uncompressed frame - pass to decompressor so it
1903                   can update its dictionary if necessary. */
1904                if (ppp->rcomp->incomp)
1905                        ppp->rcomp->incomp(ppp->rc_state, skb->data - 2,
1906                                           skb->len + 2);
1907        }
1908
1909        return skb;
1910
1911 err:
1912        ppp->rstate |= SC_DC_ERROR;
1913        ppp_receive_error(ppp);
1914        return skb;
1915}
1916
1917#ifdef CONFIG_PPP_MULTILINK
1918/*
1919 * Receive a multilink frame.
1920 * We put it on the reconstruction queue and then pull off
1921 * as many completed frames as we can.
1922 */
1923static void
1924ppp_receive_mp_frame(struct ppp *ppp, struct sk_buff *skb, struct channel *pch)
1925{
1926        u32 mask, seq;
1927        struct channel *ch;
1928        int mphdrlen = (ppp->flags & SC_MP_SHORTSEQ)? MPHDRLEN_SSN: MPHDRLEN;
1929
1930        if (!pskb_may_pull(skb, mphdrlen + 1) || ppp->mrru == 0)
1931                goto err;               /* no good, throw it away */
1932
1933        /* Decode sequence number and begin/end bits */
1934        if (ppp->flags & SC_MP_SHORTSEQ) {
1935                seq = ((skb->data[2] & 0x0f) << 8) | skb->data[3];
1936                mask = 0xfff;
1937        } else {
1938                seq = (skb->data[3] << 16) | (skb->data[4] << 8)| skb->data[5];
1939                mask = 0xffffff;
1940        }
1941        PPP_MP_CB(skb)->BEbits = skb->data[2];
1942        skb_pull(skb, mphdrlen);        /* pull off PPP and MP headers */
1943
1944        /*
1945         * Do protocol ID decompression on the first fragment of each packet.
1946         */
1947        if ((PPP_MP_CB(skb)->BEbits & B) && (skb->data[0] & 1))
1948                *(u8 *)skb_push(skb, 1) = 0;
1949
1950        /*
1951         * Expand sequence number to 32 bits, making it as close
1952         * as possible to ppp->minseq.
1953         */
1954        seq |= ppp->minseq & ~mask;
1955        if ((int)(ppp->minseq - seq) > (int)(mask >> 1))
1956                seq += mask + 1;
1957        else if ((int)(seq - ppp->minseq) > (int)(mask >> 1))
1958                seq -= mask + 1;        /* should never happen */
1959        PPP_MP_CB(skb)->sequence = seq;
1960        pch->lastseq = seq;
1961
1962        /*
1963         * If this packet comes before the next one we were expecting,
1964         * drop it.
1965         */
1966        if (seq_before(seq, ppp->nextseq)) {
1967                kfree_skb(skb);
1968                ++ppp->dev->stats.rx_dropped;
1969                ppp_receive_error(ppp);
1970                return;
1971        }
1972
1973        /*
1974         * Reevaluate minseq, the minimum over all channels of the
1975         * last sequence number received on each channel.  Because of
1976         * the increasing sequence number rule, we know that any fragment
1977         * before `minseq' which hasn't arrived is never going to arrive.
1978         * The list of channels can't change because we have the receive
1979         * side of the ppp unit locked.
1980         */
1981        list_for_each_entry(ch, &ppp->channels, clist) {
1982                if (seq_before(ch->lastseq, seq))
1983                        seq = ch->lastseq;
1984        }
1985        if (seq_before(ppp->minseq, seq))
1986                ppp->minseq = seq;
1987
1988        /* Put the fragment on the reconstruction queue */
1989        ppp_mp_insert(ppp, skb);
1990
1991        /* If the queue is getting long, don't wait any longer for packets
1992           before the start of the queue. */
1993        if (skb_queue_len(&ppp->mrq) >= PPP_MP_MAX_QLEN) {
1994                struct sk_buff *mskb = skb_peek(&ppp->mrq);
1995                if (seq_before(ppp->minseq, PPP_MP_CB(mskb)->sequence))
1996                        ppp->minseq = PPP_MP_CB(mskb)->sequence;
1997        }
1998
1999        /* Pull completed packets off the queue and receive them. */
2000        while ((skb = ppp_mp_reconstruct(ppp))) {
2001                if (pskb_may_pull(skb, 2))
2002                        ppp_receive_nonmp_frame(ppp, skb);
2003                else {
2004                        ++ppp->dev->stats.rx_length_errors;
2005                        kfree_skb(skb);
2006                        ppp_receive_error(ppp);
2007                }
2008        }
2009
2010        return;
2011
2012 err:
2013        kfree_skb(skb);
2014        ppp_receive_error(ppp);
2015}
2016
2017/*
2018 * Insert a fragment on the MP reconstruction queue.
2019 * The queue is ordered by increasing sequence number.
2020 */
2021static void
2022ppp_mp_insert(struct ppp *ppp, struct sk_buff *skb)
2023{
2024        struct sk_buff *p;
2025        struct sk_buff_head *list = &ppp->mrq;
2026        u32 seq = PPP_MP_CB(skb)->sequence;
2027
2028        /* N.B. we don't need to lock the list lock because we have the
2029           ppp unit receive-side lock. */
2030        skb_queue_walk(list, p) {
2031                if (seq_before(seq, PPP_MP_CB(p)->sequence))
2032                        break;
2033        }
2034        __skb_queue_before(list, p, skb);
2035}
2036
2037/*
2038 * Reconstruct a packet from the MP fragment queue.
2039 * We go through increasing sequence numbers until we find a
2040 * complete packet, or we get to the sequence number for a fragment
2041 * which hasn't arrived but might still do so.
2042 */
2043static struct sk_buff *
2044ppp_mp_reconstruct(struct ppp *ppp)
2045{
2046        u32 seq = ppp->nextseq;
2047        u32 minseq = ppp->minseq;
2048        struct sk_buff_head *list = &ppp->mrq;
2049        struct sk_buff *p, *tmp;
2050        struct sk_buff *head, *tail;
2051        struct sk_buff *skb = NULL;
2052        int lost = 0, len = 0;
2053
2054        if (ppp->mrru == 0)     /* do nothing until mrru is set */
2055                return NULL;
2056        head = list->next;
2057        tail = NULL;
2058        skb_queue_walk_safe(list, p, tmp) {
2059        again:
2060                if (seq_before(PPP_MP_CB(p)->sequence, seq)) {
2061                        /* this can't happen, anyway ignore the skb */
2062                        netdev_err(ppp->dev, "ppp_mp_reconstruct bad "
2063                                   "seq %u < %u\n",
2064                                   PPP_MP_CB(p)->sequence, seq);
2065                        __skb_unlink(p, list);
2066                        kfree_skb(p);
2067                        continue;
2068                }
2069                if (PPP_MP_CB(p)->sequence != seq) {
2070                        u32 oldseq;
2071                        /* Fragment `seq' is missing.  If it is after
2072                           minseq, it might arrive later, so stop here. */
2073                        if (seq_after(seq, minseq))
2074                                break;
2075                        /* Fragment `seq' is lost, keep going. */
2076                        lost = 1;
2077                        oldseq = seq;
2078                        seq = seq_before(minseq, PPP_MP_CB(p)->sequence)?
2079                                minseq + 1: PPP_MP_CB(p)->sequence;
2080
2081                        if (ppp->debug & 1)
2082                                netdev_printk(KERN_DEBUG, ppp->dev,
2083                                              "lost frag %u..%u\n",
2084                                              oldseq, seq-1);
2085
2086                        goto again;
2087                }
2088
2089                /*
2090                 * At this point we know that all the fragments from
2091                 * ppp->nextseq to seq are either present or lost.
2092                 * Also, there are no complete packets in the queue
2093                 * that have no missing fragments and end before this
2094                 * fragment.
2095                 */
2096
2097                /* B bit set indicates this fragment starts a packet */
2098                if (PPP_MP_CB(p)->BEbits & B) {
2099                        head = p;
2100                        lost = 0;
2101                        len = 0;
2102                }
2103
2104                len += p->len;
2105
2106                /* Got a complete packet yet? */
2107                if (lost == 0 && (PPP_MP_CB(p)->BEbits & E) &&
2108                    (PPP_MP_CB(head)->BEbits & B)) {
2109                        if (len > ppp->mrru + 2) {
2110                                ++ppp->dev->stats.rx_length_errors;
2111                                netdev_printk(KERN_DEBUG, ppp->dev,
2112                                              "PPP: reconstructed packet"
2113                                              " is too long (%d)\n", len);
2114                        } else {
2115                                tail = p;
2116                                break;
2117                        }
2118                        ppp->nextseq = seq + 1;
2119                }
2120
2121                /*
2122                 * If this is the ending fragment of a packet,
2123                 * and we haven't found a complete valid packet yet,
2124                 * we can discard up to and including this fragment.
2125                 */
2126                if (PPP_MP_CB(p)->BEbits & E) {
2127                        struct sk_buff *tmp2;
2128
2129                        skb_queue_reverse_walk_from_safe(list, p, tmp2) {
2130                                if (ppp->debug & 1)
2131                                        netdev_printk(KERN_DEBUG, ppp->dev,
2132                                                      "discarding frag %u\n",
2133                                                      PPP_MP_CB(p)->sequence);
2134                                __skb_unlink(p, list);
2135                                kfree_skb(p);
2136                        }
2137                        head = skb_peek(list);
2138                        if (!head)
2139                                break;
2140                }
2141                ++seq;
2142        }
2143
2144        /* If we have a complete packet, copy it all into one skb. */
2145        if (tail != NULL) {
2146                /* If we have discarded any fragments,
2147                   signal a receive error. */
2148                if (PPP_MP_CB(head)->sequence != ppp->nextseq) {
2149                        skb_queue_walk_safe(list, p, tmp) {
2150                                if (p == head)
2151                                        break;
2152                                if (ppp->debug & 1)
2153                                        netdev_printk(KERN_DEBUG, ppp->dev,
2154                                                      "discarding frag %u\n",
2155                                                      PPP_MP_CB(p)->sequence);
2156                                __skb_unlink(p, list);
2157                                kfree_skb(p);
2158                        }
2159
2160                        if (ppp->debug & 1)
2161                                netdev_printk(KERN_DEBUG, ppp->dev,
2162                                              "  missed pkts %u..%u\n",
2163                                              ppp->nextseq,
2164                                              PPP_MP_CB(head)->sequence-1);
2165                        ++ppp->dev->stats.rx_dropped;
2166                        ppp_receive_error(ppp);
2167                }
2168
2169                skb = head;
2170                if (head != tail) {
2171                        struct sk_buff **fragpp = &skb_shinfo(skb)->frag_list;
2172                        p = skb_queue_next(list, head);
2173                        __skb_unlink(skb, list);
2174                        skb_queue_walk_from_safe(list, p, tmp) {
2175                                __skb_unlink(p, list);
2176                                *fragpp = p;
2177                                p->next = NULL;
2178                                fragpp = &p->next;
2179
2180                                skb->len += p->len;
2181                                skb->data_len += p->len;
2182                                skb->truesize += p->truesize;
2183
2184                                if (p == tail)
2185                                        break;
2186                        }
2187                } else {
2188                        __skb_unlink(skb, list);
2189                }
2190
2191                ppp->nextseq = PPP_MP_CB(tail)->sequence + 1;
2192        }
2193
2194        return skb;
2195}
2196#endif /* CONFIG_PPP_MULTILINK */
2197
2198/*
2199 * Channel interface.
2200 */
2201
2202/* Create a new, unattached ppp channel. */
2203int ppp_register_channel(struct ppp_channel *chan)
2204{
2205        return ppp_register_net_channel(current->nsproxy->net_ns, chan);
2206}
2207
2208/* Create a new, unattached ppp channel for specified net. */
2209int ppp_register_net_channel(struct net *net, struct ppp_channel *chan)
2210{
2211        struct channel *pch;
2212        struct ppp_net *pn;
2213
2214        pch = kzalloc(sizeof(struct channel), GFP_KERNEL);
2215        if (!pch)
2216                return -ENOMEM;
2217
2218        pn = ppp_pernet(net);
2219
2220        pch->ppp = NULL;
2221        pch->chan = chan;
2222        pch->chan_net = net;
2223        chan->ppp = pch;
2224        init_ppp_file(&pch->file, CHANNEL);
2225        pch->file.hdrlen = chan->hdrlen;
2226#ifdef CONFIG_PPP_MULTILINK
2227        pch->lastseq = -1;
2228#endif /* CONFIG_PPP_MULTILINK */
2229        init_rwsem(&pch->chan_sem);
2230        spin_lock_init(&pch->downl);
2231        rwlock_init(&pch->upl);
2232
2233        spin_lock_bh(&pn->all_channels_lock);
2234        pch->file.index = ++pn->last_channel_index;
2235        list_add(&pch->list, &pn->new_channels);
2236        atomic_inc(&channel_count);
2237        spin_unlock_bh(&pn->all_channels_lock);
2238
2239        return 0;
2240}
2241
2242/*
2243 * Return the index of a channel.
2244 */
2245int ppp_channel_index(struct ppp_channel *chan)
2246{
2247        struct channel *pch = chan->ppp;
2248
2249        if (pch)
2250                return pch->file.index;
2251        return -1;
2252}
2253
2254/*
2255 * Return the PPP unit number to which a channel is connected.
2256 */
2257int ppp_unit_number(struct ppp_channel *chan)
2258{
2259        struct channel *pch = chan->ppp;
2260        int unit = -1;
2261
2262        if (pch) {
2263                read_lock_bh(&pch->upl);
2264                if (pch->ppp)
2265                        unit = pch->ppp->file.index;
2266                read_unlock_bh(&pch->upl);
2267        }
2268        return unit;
2269}
2270
2271/*
2272 * Return the PPP device interface name of a channel.
2273 */
2274char *ppp_dev_name(struct ppp_channel *chan)
2275{
2276        struct channel *pch = chan->ppp;
2277        char *name = NULL;
2278
2279        if (pch) {
2280                read_lock_bh(&pch->upl);
2281                if (pch->ppp && pch->ppp->dev)
2282                        name = pch->ppp->dev->name;
2283                read_unlock_bh(&pch->upl);
2284        }
2285        return name;
2286}
2287
2288
2289/*
2290 * Disconnect a channel from the generic layer.
2291 * This must be called in process context.
2292 */
2293void
2294ppp_unregister_channel(struct ppp_channel *chan)
2295{
2296        struct channel *pch = chan->ppp;
2297        struct ppp_net *pn;
2298
2299        if (!pch)
2300                return;         /* should never happen */
2301
2302        chan->ppp = NULL;
2303
2304        /*
2305         * This ensures that we have returned from any calls into the
2306         * the channel's start_xmit or ioctl routine before we proceed.
2307         */
2308        down_write(&pch->chan_sem);
2309        spin_lock_bh(&pch->downl);
2310        pch->chan = NULL;
2311        spin_unlock_bh(&pch->downl);
2312        up_write(&pch->chan_sem);
2313        ppp_disconnect_channel(pch);
2314
2315        pn = ppp_pernet(pch->chan_net);
2316        spin_lock_bh(&pn->all_channels_lock);
2317        list_del(&pch->list);
2318        spin_unlock_bh(&pn->all_channels_lock);
2319
2320        pch->file.dead = 1;
2321        wake_up_interruptible(&pch->file.rwait);
2322        if (atomic_dec_and_test(&pch->file.refcnt))
2323                ppp_destroy_channel(pch);
2324}
2325
2326/*
2327 * Callback from a channel when it can accept more to transmit.
2328 * This should be called at BH/softirq level, not interrupt level.
2329 */
2330void
2331ppp_output_wakeup(struct ppp_channel *chan)
2332{
2333        struct channel *pch = chan->ppp;
2334
2335        if (!pch)
2336                return;
2337        ppp_channel_push(pch);
2338}
2339
2340/*
2341 * Compression control.
2342 */
2343
2344/* Process the PPPIOCSCOMPRESS ioctl. */
2345static int
2346ppp_set_compress(struct ppp *ppp, unsigned long arg)
2347{
2348        int err;
2349        struct compressor *cp, *ocomp;
2350        struct ppp_option_data data;
2351        void *state, *ostate;
2352        unsigned char ccp_option[CCP_MAX_OPTION_LENGTH];
2353
2354        err = -EFAULT;
2355        if (copy_from_user(&data, (void __user *) arg, sizeof(data)) ||
2356            (data.length <= CCP_MAX_OPTION_LENGTH &&
2357             copy_from_user(ccp_option, (void __user *) data.ptr, data.length)))
2358                goto out;
2359        err = -EINVAL;
2360        if (data.length > CCP_MAX_OPTION_LENGTH ||
2361            ccp_option[1] < 2 || ccp_option[1] > data.length)
2362                goto out;
2363
2364        cp = try_then_request_module(
2365                find_compressor(ccp_option[0]),
2366                "ppp-compress-%d", ccp_option[0]);
2367        if (!cp)
2368                goto out;
2369
2370        err = -ENOBUFS;
2371        if (data.transmit) {
2372                state = cp->comp_alloc(ccp_option, data.length);
2373                if (state) {
2374                        ppp_xmit_lock(ppp);
2375                        ppp->xstate &= ~SC_COMP_RUN;
2376                        ocomp = ppp->xcomp;
2377                        ostate = ppp->xc_state;
2378                        ppp->xcomp = cp;
2379                        ppp->xc_state = state;
2380                        ppp_xmit_unlock(ppp);
2381                        if (ostate) {
2382                                ocomp->comp_free(ostate);
2383                                module_put(ocomp->owner);
2384                        }
2385                        err = 0;
2386                } else
2387                        module_put(cp->owner);
2388
2389        } else {
2390                state = cp->decomp_alloc(ccp_option, data.length);
2391                if (state) {
2392                        ppp_recv_lock(ppp);
2393                        ppp->rstate &= ~SC_DECOMP_RUN;
2394                        ocomp = ppp->rcomp;
2395                        ostate = ppp->rc_state;
2396                        ppp->rcomp = cp;
2397                        ppp->rc_state = state;
2398                        ppp_recv_unlock(ppp);
2399                        if (ostate) {
2400                                ocomp->decomp_free(ostate);
2401                                module_put(ocomp->owner);
2402                        }
2403                        err = 0;
2404                } else
2405                        module_put(cp->owner);
2406        }
2407
2408 out:
2409        return err;
2410}
2411
2412/*
2413 * Look at a CCP packet and update our state accordingly.
2414 * We assume the caller has the xmit or recv path locked.
2415 */
2416static void
2417ppp_ccp_peek(struct ppp *ppp, struct sk_buff *skb, int inbound)
2418{
2419        unsigned char *dp;
2420        int len;
2421
2422        if (!pskb_may_pull(skb, CCP_HDRLEN + 2))
2423                return; /* no header */
2424        dp = skb->data + 2;
2425
2426        switch (CCP_CODE(dp)) {
2427        case CCP_CONFREQ:
2428
2429                /* A ConfReq starts negotiation of compression
2430                 * in one direction of transmission,
2431                 * and hence brings it down...but which way?
2432                 *
2433                 * Remember:
2434                 * A ConfReq indicates what the sender would like to receive
2435                 */
2436                if(inbound)
2437                        /* He is proposing what I should send */
2438                        ppp->xstate &= ~SC_COMP_RUN;
2439                else
2440                        /* I am proposing to what he should send */
2441                        ppp->rstate &= ~SC_DECOMP_RUN;
2442
2443                break;
2444
2445        case CCP_TERMREQ:
2446        case CCP_TERMACK:
2447                /*
2448                 * CCP is going down, both directions of transmission
2449                 */
2450                ppp->rstate &= ~SC_DECOMP_RUN;
2451                ppp->xstate &= ~SC_COMP_RUN;
2452                break;
2453
2454        case CCP_CONFACK:
2455                if ((ppp->flags & (SC_CCP_OPEN | SC_CCP_UP)) != SC_CCP_OPEN)
2456                        break;
2457                len = CCP_LENGTH(dp);
2458                if (!pskb_may_pull(skb, len + 2))
2459                        return;         /* too short */
2460                dp += CCP_HDRLEN;
2461                len -= CCP_HDRLEN;
2462                if (len < CCP_OPT_MINLEN || len < CCP_OPT_LENGTH(dp))
2463                        break;
2464                if (inbound) {
2465                        /* we will start receiving compressed packets */
2466                        if (!ppp->rc_state)
2467                                break;
2468                        if (ppp->rcomp->decomp_init(ppp->rc_state, dp, len,
2469                                        ppp->file.index, 0, ppp->mru, ppp->debug)) {
2470                                ppp->rstate |= SC_DECOMP_RUN;
2471                                ppp->rstate &= ~(SC_DC_ERROR | SC_DC_FERROR);
2472                        }
2473                } else {
2474                        /* we will soon start sending compressed packets */
2475                        if (!ppp->xc_state)
2476                                break;
2477                        if (ppp->xcomp->comp_init(ppp->xc_state, dp, len,
2478                                        ppp->file.index, 0, ppp->debug))
2479                                ppp->xstate |= SC_COMP_RUN;
2480                }
2481                break;
2482
2483        case CCP_RESETACK:
2484                /* reset the [de]compressor */
2485                if ((ppp->flags & SC_CCP_UP) == 0)
2486                        break;
2487                if (inbound) {
2488                        if (ppp->rc_state && (ppp->rstate & SC_DECOMP_RUN)) {
2489                                ppp->rcomp->decomp_reset(ppp->rc_state);
2490                                ppp->rstate &= ~SC_DC_ERROR;
2491                        }
2492                } else {
2493                        if (ppp->xc_state && (ppp->xstate & SC_COMP_RUN))
2494                                ppp->xcomp->comp_reset(ppp->xc_state);
2495                }
2496                break;
2497        }
2498}
2499
2500/* Free up compression resources. */
2501static void
2502ppp_ccp_closed(struct ppp *ppp)
2503{
2504        void *xstate, *rstate;
2505        struct compressor *xcomp, *rcomp;
2506
2507        ppp_lock(ppp);
2508        ppp->flags &= ~(SC_CCP_OPEN | SC_CCP_UP);
2509        ppp->xstate = 0;
2510        xcomp = ppp->xcomp;
2511        xstate = ppp->xc_state;
2512        ppp->xc_state = NULL;
2513        ppp->rstate = 0;
2514        rcomp = ppp->rcomp;
2515        rstate = ppp->rc_state;
2516        ppp->rc_state = NULL;
2517        ppp_unlock(ppp);
2518
2519        if (xstate) {
2520                xcomp->comp_free(xstate);
2521                module_put(xcomp->owner);
2522        }
2523        if (rstate) {
2524                rcomp->decomp_free(rstate);
2525                module_put(rcomp->owner);
2526        }
2527}
2528
2529/* List of compressors. */
2530static LIST_HEAD(compressor_list);
2531static DEFINE_SPINLOCK(compressor_list_lock);
2532
2533struct compressor_entry {
2534        struct list_head list;
2535        struct compressor *comp;
2536};
2537
2538static struct compressor_entry *
2539find_comp_entry(int proto)
2540{
2541        struct compressor_entry *ce;
2542
2543        list_for_each_entry(ce, &compressor_list, list) {
2544                if (ce->comp->compress_proto == proto)
2545                        return ce;
2546        }
2547        return NULL;
2548}
2549
2550/* Register a compressor */
2551int
2552ppp_register_compressor(struct compressor *cp)
2553{
2554        struct compressor_entry *ce;
2555        int ret;
2556        spin_lock(&compressor_list_lock);
2557        ret = -EEXIST;
2558        if (find_comp_entry(cp->compress_proto))
2559                goto out;
2560        ret = -ENOMEM;
2561        ce = kmalloc(sizeof(struct compressor_entry), GFP_ATOMIC);
2562        if (!ce)
2563                goto out;
2564        ret = 0;
2565        ce->comp = cp;
2566        list_add(&ce->list, &compressor_list);
2567 out:
2568        spin_unlock(&compressor_list_lock);
2569        return ret;
2570}
2571
2572/* Unregister a compressor */
2573void
2574ppp_unregister_compressor(struct compressor *cp)
2575{
2576        struct compressor_entry *ce;
2577
2578        spin_lock(&compressor_list_lock);
2579        ce = find_comp_entry(cp->compress_proto);
2580        if (ce && ce->comp == cp) {
2581                list_del(&ce->list);
2582                kfree(ce);
2583        }
2584        spin_unlock(&compressor_list_lock);
2585}
2586
2587/* Find a compressor. */
2588static struct compressor *
2589find_compressor(int type)
2590{
2591        struct compressor_entry *ce;
2592        struct compressor *cp = NULL;
2593
2594        spin_lock(&compressor_list_lock);
2595        ce = find_comp_entry(type);
2596        if (ce) {
2597                cp = ce->comp;
2598                if (!try_module_get(cp->owner))
2599                        cp = NULL;
2600        }
2601        spin_unlock(&compressor_list_lock);
2602        return cp;
2603}
2604
2605/*
2606 * Miscelleneous stuff.
2607 */
2608
2609static void
2610ppp_get_stats(struct ppp *ppp, struct ppp_stats *st)
2611{
2612        struct slcompress *vj = ppp->vj;
2613
2614        memset(st, 0, sizeof(*st));
2615        st->p.ppp_ipackets = ppp->stats64.rx_packets;
2616        st->p.ppp_ierrors = ppp->dev->stats.rx_errors;
2617        st->p.ppp_ibytes = ppp->stats64.rx_bytes;
2618        st->p.ppp_opackets = ppp->stats64.tx_packets;
2619        st->p.ppp_oerrors = ppp->dev->stats.tx_errors;
2620        st->p.ppp_obytes = ppp->stats64.tx_bytes;
2621        if (!vj)
2622                return;
2623        st->vj.vjs_packets = vj->sls_o_compressed + vj->sls_o_uncompressed;
2624        st->vj.vjs_compressed = vj->sls_o_compressed;
2625        st->vj.vjs_searches = vj->sls_o_searches;
2626        st->vj.vjs_misses = vj->sls_o_misses;
2627        st->vj.vjs_errorin = vj->sls_i_error;
2628        st->vj.vjs_tossed = vj->sls_i_tossed;
2629        st->vj.vjs_uncompressedin = vj->sls_i_uncompressed;
2630        st->vj.vjs_compressedin = vj->sls_i_compressed;
2631}
2632
2633/*
2634 * Stuff for handling the lists of ppp units and channels
2635 * and for initialization.
2636 */
2637
2638/*
2639 * Create a new ppp interface unit.  Fails if it can't allocate memory
2640 * or if there is already a unit with the requested number.
2641 * unit == -1 means allocate a new number.
2642 */
2643static struct ppp *
2644ppp_create_interface(struct net *net, int unit, int *retp)
2645{
2646        struct ppp *ppp;
2647        struct ppp_net *pn;
2648        struct net_device *dev = NULL;
2649        int ret = -ENOMEM;
2650        int i;
2651
2652        dev = alloc_netdev(sizeof(struct ppp), "", ppp_setup);
2653        if (!dev)
2654                goto out1;
2655
2656        pn = ppp_pernet(net);
2657
2658        ppp = netdev_priv(dev);
2659        ppp->dev = dev;
2660        ppp->mru = PPP_MRU;
2661        init_ppp_file(&ppp->file, INTERFACE);
2662        ppp->file.hdrlen = PPP_HDRLEN - 2;      /* don't count proto bytes */
2663        for (i = 0; i < NUM_NP; ++i)
2664                ppp->npmode[i] = NPMODE_PASS;
2665        INIT_LIST_HEAD(&ppp->channels);
2666        spin_lock_init(&ppp->rlock);
2667        spin_lock_init(&ppp->wlock);
2668#ifdef CONFIG_PPP_MULTILINK
2669        ppp->minseq = -1;
2670        skb_queue_head_init(&ppp->mrq);
2671#endif /* CONFIG_PPP_MULTILINK */
2672
2673        /*
2674         * drum roll: don't forget to set
2675         * the net device is belong to
2676         */
2677        dev_net_set(dev, net);
2678
2679        mutex_lock(&pn->all_ppp_mutex);
2680
2681        if (unit < 0) {
2682                unit = unit_get(&pn->units_idr, ppp);
2683                if (unit < 0) {
2684                        ret = unit;
2685                        goto out2;
2686                }
2687        } else {
2688                ret = -EEXIST;
2689                if (unit_find(&pn->units_idr, unit))
2690                        goto out2; /* unit already exists */
2691                /*
2692                 * if caller need a specified unit number
2693                 * lets try to satisfy him, otherwise --
2694                 * he should better ask us for new unit number
2695                 *
2696                 * NOTE: yes I know that returning EEXIST it's not
2697                 * fair but at least pppd will ask us to allocate
2698                 * new unit in this case so user is happy :)
2699                 */
2700                unit = unit_set(&pn->units_idr, ppp, unit);
2701                if (unit < 0)
2702                        goto out2;
2703        }
2704
2705        /* Initialize the new ppp unit */
2706        ppp->file.index = unit;
2707        sprintf(dev->name, "ppp%d", unit);
2708
2709        ret = register_netdev(dev);
2710        if (ret != 0) {
2711                unit_put(&pn->units_idr, unit);
2712                netdev_err(ppp->dev, "PPP: couldn't register device %s (%d)\n",
2713                           dev->name, ret);
2714                goto out2;
2715        }
2716
2717        ppp->ppp_net = net;
2718
2719        atomic_inc(&ppp_unit_count);
2720        mutex_unlock(&pn->all_ppp_mutex);
2721
2722        *retp = 0;
2723        return ppp;
2724
2725out2:
2726        mutex_unlock(&pn->all_ppp_mutex);
2727        free_netdev(dev);
2728out1:
2729        *retp = ret;
2730        return NULL;
2731}
2732
2733/*
2734 * Initialize a ppp_file structure.
2735 */
2736static void
2737init_ppp_file(struct ppp_file *pf, int kind)
2738{
2739        pf->kind = kind;
2740        skb_queue_head_init(&pf->xq);
2741        skb_queue_head_init(&pf->rq);
2742        atomic_set(&pf->refcnt, 1);
2743        init_waitqueue_head(&pf->rwait);
2744}
2745
2746/*
2747 * Take down a ppp interface unit - called when the owning file
2748 * (the one that created the unit) is closed or detached.
2749 */
2750static void ppp_shutdown_interface(struct ppp *ppp)
2751{
2752        struct ppp_net *pn;
2753
2754        pn = ppp_pernet(ppp->ppp_net);
2755        mutex_lock(&pn->all_ppp_mutex);
2756
2757        /* This will call dev_close() for us. */
2758        ppp_lock(ppp);
2759        if (!ppp->closing) {
2760                ppp->closing = 1;
2761                ppp_unlock(ppp);
2762                unregister_netdev(ppp->dev);
2763                unit_put(&pn->units_idr, ppp->file.index);
2764        } else
2765                ppp_unlock(ppp);
2766
2767        ppp->file.dead = 1;
2768        ppp->owner = NULL;
2769        wake_up_interruptible(&ppp->file.rwait);
2770
2771        mutex_unlock(&pn->all_ppp_mutex);
2772}
2773
2774/*
2775 * Free the memory used by a ppp unit.  This is only called once
2776 * there are no channels connected to the unit and no file structs
2777 * that reference the unit.
2778 */
2779static void ppp_destroy_interface(struct ppp *ppp)
2780{
2781        atomic_dec(&ppp_unit_count);
2782
2783        if (!ppp->file.dead || ppp->n_channels) {
2784                /* "can't happen" */
2785                netdev_err(ppp->dev, "ppp: destroying ppp struct %p "
2786                           "but dead=%d n_channels=%d !\n",
2787                           ppp, ppp->file.dead, ppp->n_channels);
2788                return;
2789        }
2790
2791        ppp_ccp_closed(ppp);
2792        if (ppp->vj) {
2793                slhc_free(ppp->vj);
2794                ppp->vj = NULL;
2795        }
2796        skb_queue_purge(&ppp->file.xq);
2797        skb_queue_purge(&ppp->file.rq);
2798#ifdef CONFIG_PPP_MULTILINK
2799        skb_queue_purge(&ppp->mrq);
2800#endif /* CONFIG_PPP_MULTILINK */
2801#ifdef CONFIG_PPP_FILTER
2802        kfree(ppp->pass_filter);
2803        ppp->pass_filter = NULL;
2804        kfree(ppp->active_filter);
2805        ppp->active_filter = NULL;
2806#endif /* CONFIG_PPP_FILTER */
2807
2808        kfree_skb(ppp->xmit_pending);
2809
2810        free_netdev(ppp->dev);
2811}
2812
2813/*
2814 * Locate an existing ppp unit.
2815 * The caller should have locked the all_ppp_mutex.
2816 */
2817static struct ppp *
2818ppp_find_unit(struct ppp_net *pn, int unit)
2819{
2820        return unit_find(&pn->units_idr, unit);
2821}
2822
2823/*
2824 * Locate an existing ppp channel.
2825 * The caller should have locked the all_channels_lock.
2826 * First we look in the new_channels list, then in the
2827 * all_channels list.  If found in the new_channels list,
2828 * we move it to the all_channels list.  This is for speed
2829 * when we have a lot of channels in use.
2830 */
2831static struct channel *
2832ppp_find_channel(struct ppp_net *pn, int unit)
2833{
2834        struct channel *pch;
2835
2836        list_for_each_entry(pch, &pn->new_channels, list) {
2837                if (pch->file.index == unit) {
2838                        list_move(&pch->list, &pn->all_channels);
2839                        return pch;
2840                }
2841        }
2842
2843        list_for_each_entry(pch, &pn->all_channels, list) {
2844                if (pch->file.index == unit)
2845                        return pch;
2846        }
2847
2848        return NULL;
2849}
2850
2851/*
2852 * Connect a PPP channel to a PPP interface unit.
2853 */
2854static int
2855ppp_connect_channel(struct channel *pch, int unit)
2856{
2857        struct ppp *ppp;
2858        struct ppp_net *pn;
2859        int ret = -ENXIO;
2860        int hdrlen;
2861
2862        pn = ppp_pernet(pch->chan_net);
2863
2864        mutex_lock(&pn->all_ppp_mutex);
2865        ppp = ppp_find_unit(pn, unit);
2866        if (!ppp)
2867                goto out;
2868        write_lock_bh(&pch->upl);
2869        ret = -EINVAL;
2870        if (pch->ppp)
2871                goto outl;
2872
2873        ppp_lock(ppp);
2874        if (pch->file.hdrlen > ppp->file.hdrlen)
2875                ppp->file.hdrlen = pch->file.hdrlen;
2876        hdrlen = pch->file.hdrlen + 2;  /* for protocol bytes */
2877        if (hdrlen > ppp->dev->hard_header_len)
2878                ppp->dev->hard_header_len = hdrlen;
2879        list_add_tail(&pch->clist, &ppp->channels);
2880        ++ppp->n_channels;
2881        pch->ppp = ppp;
2882        atomic_inc(&ppp->file.refcnt);
2883        ppp_unlock(ppp);
2884        ret = 0;
2885
2886 outl:
2887        write_unlock_bh(&pch->upl);
2888 out:
2889        mutex_unlock(&pn->all_ppp_mutex);
2890        return ret;
2891}
2892
2893/*
2894 * Disconnect a channel from its ppp unit.
2895 */
2896static int
2897ppp_disconnect_channel(struct channel *pch)
2898{
2899        struct ppp *ppp;
2900        int err = -EINVAL;
2901
2902        write_lock_bh(&pch->upl);
2903        ppp = pch->ppp;
2904        pch->ppp = NULL;
2905        write_unlock_bh(&pch->upl);
2906        if (ppp) {
2907                /* remove it from the ppp unit's list */
2908                ppp_lock(ppp);
2909                list_del(&pch->clist);
2910                if (--ppp->n_channels == 0)
2911                        wake_up_interruptible(&ppp->file.rwait);
2912                ppp_unlock(ppp);
2913                if (atomic_dec_and_test(&ppp->file.refcnt))
2914                        ppp_destroy_interface(ppp);
2915                err = 0;
2916        }
2917        return err;
2918}
2919
2920/*
2921 * Free up the resources used by a ppp channel.
2922 */
2923static void ppp_destroy_channel(struct channel *pch)
2924{
2925        atomic_dec(&channel_count);
2926
2927        if (!pch->file.dead) {
2928                /* "can't happen" */
2929                pr_err("ppp: destroying undead channel %p !\n", pch);
2930                return;
2931        }
2932        skb_queue_purge(&pch->file.xq);
2933        skb_queue_purge(&pch->file.rq);
2934        kfree(pch);
2935}
2936
2937static void __exit ppp_cleanup(void)
2938{
2939        /* should never happen */
2940        if (atomic_read(&ppp_unit_count) || atomic_read(&channel_count))
2941                pr_err("PPP: removing module but units remain!\n");
2942        unregister_chrdev(PPP_MAJOR, "ppp");
2943        device_destroy(ppp_class, MKDEV(PPP_MAJOR, 0));
2944        class_destroy(ppp_class);
2945        unregister_pernet_device(&ppp_net_ops);
2946}
2947
2948/*
2949 * Units handling. Caller must protect concurrent access
2950 * by holding all_ppp_mutex
2951 */
2952
2953/* associate pointer with specified number */
2954static int unit_set(struct idr *p, void *ptr, int n)
2955{
2956        int unit;
2957
2958        unit = idr_alloc(p, ptr, n, n + 1, GFP_KERNEL);
2959        if (unit == -ENOSPC)
2960                unit = -EINVAL;
2961        return unit;
2962}
2963
2964/* get new free unit number and associate pointer with it */
2965static int unit_get(struct idr *p, void *ptr)
2966{
2967        return idr_alloc(p, ptr, 0, 0, GFP_KERNEL);
2968}
2969
2970/* put unit number back to a pool */
2971static void unit_put(struct idr *p, int n)
2972{
2973        idr_remove(p, n);
2974}
2975
2976/* get pointer associated with the number */
2977static void *unit_find(struct idr *p, int n)
2978{
2979        return idr_find(p, n);
2980}
2981
2982/* Module/initialization stuff */
2983
2984module_init(ppp_init);
2985module_exit(ppp_cleanup);
2986
2987EXPORT_SYMBOL(ppp_register_net_channel);
2988EXPORT_SYMBOL(ppp_register_channel);
2989EXPORT_SYMBOL(ppp_unregister_channel);
2990EXPORT_SYMBOL(ppp_channel_index);
2991EXPORT_SYMBOL(ppp_unit_number);
2992EXPORT_SYMBOL(ppp_dev_name);
2993EXPORT_SYMBOL(ppp_input);
2994EXPORT_SYMBOL(ppp_input_error);
2995EXPORT_SYMBOL(ppp_output_wakeup);
2996EXPORT_SYMBOL(ppp_register_compressor);
2997EXPORT_SYMBOL(ppp_unregister_compressor);
2998MODULE_LICENSE("GPL");
2999MODULE_ALIAS_CHARDEV(PPP_MAJOR, 0);
3000MODULE_ALIAS("devname:ppp");
3001