File Manager

003 File Manager

Current Path: /usr/src/usr.sbin/ppp

📁 ..
📄 Makefile(1.66 KB)
📄 Makefile.depend(435 B)
📄 README.changes(7.26 KB)
📄 README.nat(14.85 KB)
📄 acf.c(3.51 KB)
📄 acf.h(1.5 KB)
📄 arp.c(8.24 KB)
📄 arp.h(1.76 KB)
📄 async.c(5.39 KB)
📄 async.h(1.9 KB)
📄 auth.c(12.02 KB)
📄 auth.h(2.69 KB)
📄 bundle.c(56.37 KB)
📄 bundle.h(7.7 KB)
📄 cbcp.c(22.53 KB)
📄 cbcp.h(2.51 KB)
📄 ccp.c(23.33 KB)
📄 ccp.h(5.53 KB)
📄 chap.c(27 KB)
📄 chap.h(2.69 KB)
📄 chap_ms.c(12.22 KB)
📄 chap_ms.h(2.48 KB)
📄 chat.c(20.41 KB)
📄 chat.h(2.92 KB)
📄 command.c(101.76 KB)
📄 command.h(3.02 KB)
📄 datalink.c(42.89 KB)
📄 datalink.h(6.11 KB)
📄 deflate.c(15.89 KB)
📄 deflate.h(1.52 KB)
📄 defs.c(8.61 KB)
📄 defs.h(5.41 KB)
📄 descriptor.h(2.24 KB)
📄 ether.c(20.81 KB)
📄 ether.h(1.73 KB)
📄 exec.c(11.47 KB)
📄 exec.h(1.67 KB)
📄 filter.c(15.76 KB)
📄 filter.h(3.8 KB)
📄 fsm.c(31.01 KB)
📄 fsm.h(7.02 KB)
📄 hdlc.c(15.17 KB)
📄 hdlc.h(3.9 KB)
📄 i4b.h(1.73 KB)
📄 id.c(6.05 KB)
📄 id.h(3.01 KB)
📄 iface.c(22.41 KB)
📄 iface.h(2.97 KB)
📄 ip.c(30.21 KB)
📄 ip.h(2.09 KB)
📄 ipcp.c(42.99 KB)
📄 ipcp.h(5.14 KB)
📄 iplist.c(5.54 KB)
📄 iplist.h(1.99 KB)
📄 ipv6cp.c(21.9 KB)
📄 ipv6cp.h(3.26 KB)
📄 layer.h(1.97 KB)
📄 lcp.c(39.22 KB)
📄 lcp.h(6.3 KB)
📄 link.c(10.36 KB)
📄 link.h(3.42 KB)
📄 log.c(11.33 KB)
📄 log.h(4.14 KB)
📄 lqr.c(17.5 KB)
📄 lqr.h(3.31 KB)
📄 main.c(17.93 KB)
📄 main.h(1.6 KB)
📄 mbuf.c(10.02 KB)
📄 mbuf.h(4 KB)
📄 mp.c(33.66 KB)
📄 mp.h(4.87 KB)
📄 mppe.c(20.27 KB)
📄 mppe.h(1.57 KB)
📄 nat_cmd.c(15.37 KB)
📄 nat_cmd.h(1.88 KB)
📄 ncp.c(13.17 KB)
📄 ncp.h(4.36 KB)
📄 ncpaddr.c(23.06 KB)
📄 ncpaddr.h(4.63 KB)
📄 netgraph.c(20.65 KB)
📄 netgraph.h(1.72 KB)
📄 pap.c(8.83 KB)
📄 pap.h(1.78 KB)
📄 physical.c(29.01 KB)
📄 physical.h(6.5 KB)
📄 ppp.8(149.48 KB)
📄 ppp.conf(1.23 KB)
📄 pred.c(8.83 KB)
📄 pred.h(1.59 KB)
📄 probe.c(2.29 KB)
📄 probe.h(1.57 KB)
📄 prompt.c(12.92 KB)
📄 prompt.h(3.87 KB)
📄 proto.c(3.22 KB)
📄 proto.h(2.4 KB)
📄 radius.c(39.38 KB)
📄 radius.h(4.6 KB)
📄 route.c(25.91 KB)
📄 route.h(3.3 KB)
📄 server.c(10.9 KB)
📄 server.h(2.26 KB)
📄 sig.c(3.45 KB)
📄 sig.h(1.6 KB)
📄 slcompress.c(17.2 KB)
📄 slcompress.h(6.48 KB)
📄 sync.c(2.7 KB)
📄 sync.h(1.44 KB)
📄 systems.c(11.45 KB)
📄 systems.h(2.02 KB)
📄 tcp.c(5.63 KB)
📄 tcp.h(1.66 KB)
📄 tcpmss.c(5.06 KB)
📄 tcpmss.h(1.44 KB)
📄 throughput.c(8.84 KB)
📄 throughput.h(2.91 KB)
📄 timer.c(8.14 KB)
📄 timer.h(2.31 KB)
📄 tty.c(20.63 KB)
📄 tty.h(1.73 KB)
📄 tun.c(3.27 KB)
📄 tun.h(1.58 KB)
📄 ua.h(2.98 KB)
📄 udp.c(8.7 KB)
📄 udp.h(1.67 KB)
📄 vjcomp.c(5.68 KB)
📄 vjcomp.h(1.53 KB)

Editing: link.c

/*-
 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
 *
 * Copyright (c) 1998 Brian Somers <brian@Awfulhak.org>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * $FreeBSD$
 *
 */

#include <sys/types.h>
#include <netinet/in_systm.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <netinet/in.h>
#include <netinet/ip.h>

#include <stdarg.h>
#include <stdio.h>
#include <string.h>
#include <termios.h>

#include "defs.h"
#include "layer.h"
#include "mbuf.h"
#include "log.h"
#include "timer.h"
#include "lqr.h"
#include "hdlc.h"
#include "throughput.h"
#include "proto.h"
#include "fsm.h"
#include "descriptor.h"
#include "lcp.h"
#include "ccp.h"
#include "link.h"
#include "prompt.h"
#include "async.h"
#include "physical.h"
#include "mp.h"
#include "iplist.h"
#include "slcompress.h"
#include "ncpaddr.h"
#include "ip.h"
#include "ipcp.h"
#include "ipv6cp.h"
#include "auth.h"
#include "pap.h"
#include "chap.h"
#include "cbcp.h"
#include "command.h"

static void Despatch(struct bundle *, struct link *, struct mbuf *, u_short);

static inline void
link_AddInOctets(struct link *l, int n)
{
  if (l->stats.gather) {
    throughput_addin(&l->stats.total, n);
    if (l->stats.parent)
      throughput_addin(l->stats.parent, n);
  }
}

static inline void
link_AddOutOctets(struct link *l, int n)
{
  if (l->stats.gather) {
    throughput_addout(&l->stats.total, n);
    if (l->stats.parent)
      throughput_addout(l->stats.parent, n);
  }
}

void
link_SequenceQueue(struct link *l)
{
  struct mqueue *queue, *highest;

log_Printf(LogDEBUG, "link_SequenceQueue\n");

highest = LINK_HIGHQ(l);
  for (queue = l->Queue; queue < highest; queue++)
    while (queue->len)
      m_enqueue(highest, m_dequeue(queue));
}

void
link_DeleteQueue(struct link *l)
{
  struct mqueue *queue, *highest;

highest = LINK_HIGHQ(l);
  for (queue = l->Queue; queue <= highest; queue++)
    while (queue->top)
      m_freem(m_dequeue(queue));
}

size_t
link_QueueLen(struct link *l)
{
  unsigned i;
  size_t len;

for (i = 0, len = 0; i < LINK_QUEUES(l); i++)
    len += l->Queue[i].len;

return len;
}

size_t
link_QueueBytes(struct link *l)
{
  unsigned i;
  size_t len, bytes;
  struct mbuf *m;

bytes = 0;
  for (i = 0, len = 0; i < LINK_QUEUES(l); i++) {
    len = l->Queue[i].len;
    m = l->Queue[i].top;
    while (len--) {
      bytes += m_length(m);
      m = m->m_nextpkt;
    }
  }

return bytes;
}

void
link_PendingLowPriorityData(struct link *l, size_t *pkts, size_t *octets)
{
  struct mqueue *queue, *highest;
  struct mbuf *m;
  size_t len;

/*
   * This is all rfc1989 stuff... because our LQR packet is going to bypass
   * everything that's not in the highest priority queue, we must be able to
   * subtract that data from our outgoing packet/octet counts.  However,
   * we've already async-encoded our data at this point, but the async
   * encodings MUSTn't be a part of the LQR-reported payload :(  So, we have
   * the async layer record how much it's padded the packet in the mbuf's
   * priv field, and when we calculate our outgoing LQR values we subtract
   * this value for each packet from the octet count sent.
   */

highest = LINK_HIGHQ(l);
  *pkts = *octets = 0;
  for (queue = l->Queue; queue < highest; queue++) {
    len = queue->len;
    *pkts += len;
    for (m = queue->top; len--; m = m->m_nextpkt)
      *octets += m_length(m) - m->priv;
  }
}

struct mbuf *
link_Dequeue(struct link *l)
{
  int pri;
  struct mbuf *bp;

for (bp = NULL, pri = LINK_QUEUES(l) - 1; pri >= 0; pri--)
    if (l->Queue[pri].len) {
      bp = m_dequeue(l->Queue + pri);
      log_Printf(LogDEBUG, "link_Dequeue: Dequeued from queue %d,"
                " containing %lu more packets\n", pri,
                (u_long)l->Queue[pri].len);
      break;
    }

return bp;
}

static struct protostatheader {
  u_short number;
  const char *name;
} ProtocolStat[NPROTOSTAT] = {
  { PROTO_IP, "IP" },
  { PROTO_VJUNCOMP, "VJ_UNCOMP" },
  { PROTO_VJCOMP, "VJ_COMP" },
  { PROTO_COMPD, "COMPD" },
  { PROTO_ICOMPD, "ICOMPD" },
  { PROTO_LCP, "LCP" },
  { PROTO_IPCP, "IPCP" },
  { PROTO_CCP, "CCP" },
  { PROTO_PAP, "PAP" },
  { PROTO_LQR, "LQR" },
  { PROTO_CHAP, "CHAP" },
  { PROTO_MP, "MULTILINK" },
  { 0, "Others" }	/* must be last */
};

void
link_ProtocolRecord(struct link *l, u_short proto, int type)
{
  int i;

for (i = 0; i < NPROTOSTAT; i++)
    if (ProtocolStat[i].number == proto || ProtocolStat[i].number == 0) {
      if (type == PROTO_IN)
        l->proto_in[i]++;
      else
        l->proto_out[i]++;
      break;
    }
}

void
link_ReportProtocolStatus(struct link *l, struct prompt *prompt)
{
  int i;

prompt_Printf(prompt, "    Protocol     in        out      "
                "Protocol      in       out\n");
  for (i = 0; i < NPROTOSTAT; i++) {
    prompt_Printf(prompt, "   %-9s: %8lu, %8lu",
	    ProtocolStat[i].name, l->proto_in[i], l->proto_out[i]);
    if ((i % 2) == 0)
      prompt_Printf(prompt, "\n");
  }
  if (!(i % 2))
    prompt_Printf(prompt, "\n");
}

void
link_PushPacket(struct link *l, struct mbuf *bp, struct bundle *b, int pri,
                u_short proto)
{
  int layer;

/*
   * When we ``push'' a packet into the link, it gets processed by the
   * ``push'' function in each layer starting at the top.
   * We never expect the result of a ``push'' to be more than one
   * packet (as we do with ``pull''s).
   */

if(pri < 0 || (unsigned)pri >= LINK_QUEUES(l))
    pri = 0;

bp->priv = 0;		/* Adjusted by the async layer ! */
  for (layer = l->nlayers; layer && bp; layer--)
    if (l->layer[layer - 1]->push != NULL)
      bp = (*l->layer[layer - 1]->push)(b, l, bp, pri, &proto);

if (bp) {
    link_AddOutOctets(l, m_length(bp));
    log_Printf(LogDEBUG, "link_PushPacket: Transmit proto 0x%04x\n", proto);
    m_enqueue(l->Queue + pri, m_pullup(bp));
  }
}

void
link_PullPacket(struct link *l, char *buf, size_t len, struct bundle *b)
{
  struct mbuf *bp, *lbp[LAYER_MAX], *next;
  u_short lproto[LAYER_MAX], proto;
  int layer;

/*
   * When we ``pull'' a packet from the link, it gets processed by the
   * ``pull'' function in each layer starting at the bottom.
   * Each ``pull'' may produce multiple packets, chained together using
   * bp->m_nextpkt.
   * Each packet that results from each pull has to be pulled through
   * all of the higher layers before the next resulting packet is pulled
   * through anything; this ensures that packets that depend on the
   * fsm state resulting from the receipt of the previous packet aren't
   * surprised.
   */

link_AddInOctets(l, len);

memset(lbp, '\0', sizeof lbp);
  lbp[0] = m_get(len, MB_UNKNOWN);
  memcpy(MBUF_CTOP(lbp[0]), buf, len);
  lproto[0] = 0;
  layer = 0;

while (layer || lbp[layer]) {
    if (lbp[layer] == NULL) {
      layer--;
      continue;
    }
    bp = lbp[layer];
    lbp[layer] = bp->m_nextpkt;
    bp->m_nextpkt = NULL;
    proto = lproto[layer];

if (l->layer[layer]->pull != NULL)
      bp = (*l->layer[layer]->pull)(b, l, bp, &proto);

if (layer == l->nlayers - 1) {
      /* We've just done the top layer, despatch the packet(s) */
      while (bp) {
        next = bp->m_nextpkt;
        bp->m_nextpkt = NULL;
        log_Printf(LogDEBUG, "link_PullPacket: Despatch proto 0x%04x\n", proto);
        Despatch(b, l, bp, proto);
        bp = next;
      }
    } else {
      lbp[++layer] = bp;
      lproto[layer] = proto;
    }
  }
}

int
link_Stack(struct link *l, struct layer *layer)
{
  if (l->nlayers == sizeof l->layer / sizeof l->layer[0]) {
    log_Printf(LogERROR, "%s: Oops, cannot stack a %s layer...\n",
               l->name, layer->name);
    return 0;
  }
  l->layer[l->nlayers++] = layer;
  return 1;
}

void
link_EmptyStack(struct link *l)
{
  l->nlayers = 0;
}

static const struct {
  u_short proto;
  struct mbuf *(*fn)(struct bundle *, struct link *, struct mbuf *);
} despatcher[] = {
  { PROTO_IP, ipv4_Input },
#ifndef NOINET6
  { PROTO_IPV6, ipv6_Input },
#endif
  { PROTO_MP, mp_Input },
  { PROTO_LCP, lcp_Input },
  { PROTO_IPCP, ipcp_Input },
#ifndef NOINET6
  { PROTO_IPV6CP, ipv6cp_Input },
#endif
  { PROTO_PAP, pap_Input },
  { PROTO_CHAP, chap_Input },
  { PROTO_CCP, ccp_Input },
  { PROTO_LQR, lqr_Input },
  { PROTO_CBCP, cbcp_Input }
};

#define DSIZE (sizeof despatcher / sizeof despatcher[0])

static void
Despatch(struct bundle *bundle, struct link *l, struct mbuf *bp, u_short proto)
{
  unsigned f;

for (f = 0; f < DSIZE; f++)
    if (despatcher[f].proto == proto) {
      bp = (*despatcher[f].fn)(bundle, l, bp);
      break;
    }

if (bp) {
    struct physical *p = link2physical(l);

log_Printf(LogPHASE, "%s protocol 0x%04x (%s)\n",
               f == DSIZE ? "Unknown" : "Unexpected", proto,
               hdlc_Protocol2Nam(proto));
    bp = m_pullup(proto_Prepend(bp, proto, 0, 0));
    lcp_SendProtoRej(&l->lcp, MBUF_CTOP(bp), bp->m_len);
    if (p) {
      p->hdlc.lqm.ifInDiscards++;
      p->hdlc.stats.unknownproto++;
    }
    m_freem(bp);
  }
}

int
link_ShowLayers(struct cmdargs const *arg)
{
  struct link *l = command_ChooseLink(arg);
  int layer;

for (layer = l->nlayers; layer; layer--)
    prompt_Printf(arg->prompt, "%s%s", layer == l->nlayers ? "" : ", ",
                  l->layer[layer - 1]->name);
  if (l->nlayers)
    prompt_Printf(arg->prompt, "\n");

return 0;
}

003 File Manager

Editing: link.c

Upload File

Create Folder