drivers/net/ppp_generic.c

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