1995-01-31 06:29:58 +00:00
|
|
|
/*
|
|
|
|
* PPP Memory handling module
|
|
|
|
*
|
|
|
|
* Written by Toshiharu OHNO (tony-o@iij.ad.jp)
|
|
|
|
*
|
|
|
|
* Copyright (C) 1993, Internet Initiative Japan, Inc. All rights reserverd.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms are permitted
|
|
|
|
* provided that the above copyright notice and this paragraph are
|
|
|
|
* duplicated in all such forms and that any documentation,
|
|
|
|
* advertising materials, and other materials related to such
|
|
|
|
* distribution and use acknowledge that the software was developed
|
|
|
|
* by the Internet Initiative Japan, Inc. The name of the
|
|
|
|
* IIJ may not be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
|
|
|
|
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
|
|
|
|
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
*
|
1999-02-06 02:54:47 +00:00
|
|
|
* $Id: mbuf.c,v 1.22 1998/08/25 17:48:42 brian Exp $
|
1995-05-30 03:57:47 +00:00
|
|
|
*
|
1995-01-31 06:29:58 +00:00
|
|
|
*/
|
1998-04-07 00:54:26 +00:00
|
|
|
#include <sys/types.h>
|
1997-10-26 01:04:02 +00:00
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
1998-02-16 00:01:12 +00:00
|
|
|
#include <sysexits.h>
|
1998-02-10 03:23:50 +00:00
|
|
|
#include <termios.h>
|
1997-10-26 01:04:02 +00:00
|
|
|
|
1998-06-15 19:06:25 +00:00
|
|
|
#include "defs.h"
|
1997-11-22 03:37:54 +00:00
|
|
|
#include "command.h"
|
1997-10-26 01:04:02 +00:00
|
|
|
#include "mbuf.h"
|
|
|
|
#include "log.h"
|
1998-02-10 03:23:50 +00:00
|
|
|
#include "descriptor.h"
|
|
|
|
#include "prompt.h"
|
1998-02-16 00:01:12 +00:00
|
|
|
#include "main.h"
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1998-01-21 02:15:33 +00:00
|
|
|
static struct memmap {
|
1995-01-31 06:29:58 +00:00
|
|
|
struct mbuf *queue;
|
1998-08-21 18:09:57 +00:00
|
|
|
int fragments, octets;
|
1998-02-09 19:24:03 +00:00
|
|
|
} MemMap[MB_MAX + 2];
|
1995-01-31 06:29:58 +00:00
|
|
|
|
|
|
|
static int totalalloced;
|
|
|
|
|
|
|
|
int
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Length(struct mbuf * bp)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
|
|
|
int len;
|
|
|
|
|
|
|
|
for (len = 0; bp; bp = bp->next)
|
|
|
|
len += bp->cnt;
|
1997-08-25 00:29:32 +00:00
|
|
|
return (len);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
struct mbuf *
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Alloc(int cnt, int type)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
|
|
|
struct mbuf *bp;
|
|
|
|
|
|
|
|
if (type > MB_MAX)
|
1998-05-01 19:26:12 +00:00
|
|
|
log_Printf(LogERROR, "Bad mbuf type %d\n", type);
|
1998-08-21 18:10:15 +00:00
|
|
|
bp = malloc(sizeof(struct mbuf) + cnt);
|
1997-05-10 01:22:19 +00:00
|
|
|
if (bp == NULL) {
|
1998-06-27 23:48:54 +00:00
|
|
|
log_Printf(LogALERT, "failed to allocate memory: %ld\n",
|
|
|
|
(long)sizeof(struct mbuf));
|
1998-02-16 00:01:12 +00:00
|
|
|
AbortProgram(EX_OSERR);
|
1997-05-10 01:22:19 +00:00
|
|
|
}
|
1997-10-26 01:04:02 +00:00
|
|
|
memset(bp, '\0', sizeof(struct mbuf));
|
1998-08-21 18:09:57 +00:00
|
|
|
MemMap[type].fragments++;
|
|
|
|
MemMap[type].octets += cnt;
|
1995-01-31 06:29:58 +00:00
|
|
|
totalalloced += cnt;
|
|
|
|
bp->size = bp->cnt = cnt;
|
|
|
|
bp->type = type;
|
1997-12-28 02:56:43 +00:00
|
|
|
bp->pnext = NULL;
|
1997-08-25 00:29:32 +00:00
|
|
|
return (bp);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
struct mbuf *
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_FreeSeg(struct mbuf * bp)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
|
|
|
struct mbuf *nbp;
|
|
|
|
|
|
|
|
if (bp) {
|
|
|
|
nbp = bp->next;
|
1998-08-21 18:09:57 +00:00
|
|
|
MemMap[bp->type].fragments--;
|
|
|
|
MemMap[bp->type].octets -= bp->size;
|
1995-01-31 06:29:58 +00:00
|
|
|
totalalloced -= bp->size;
|
|
|
|
free(bp);
|
1997-08-25 00:29:32 +00:00
|
|
|
return (nbp);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
1997-08-25 00:29:32 +00:00
|
|
|
return (bp);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Free(struct mbuf * bp)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
|
|
|
while (bp)
|
1998-05-01 19:26:12 +00:00
|
|
|
bp = mbuf_FreeSeg(bp);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
struct mbuf *
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Read(struct mbuf * bp, u_char * ptr, int len)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
|
|
|
int nb;
|
|
|
|
|
|
|
|
while (bp && len > 0) {
|
|
|
|
if (len > bp->cnt)
|
|
|
|
nb = bp->cnt;
|
|
|
|
else
|
|
|
|
nb = len;
|
1997-10-26 01:04:02 +00:00
|
|
|
memcpy(ptr, MBUF_CTOP(bp), nb);
|
1995-01-31 06:29:58 +00:00
|
|
|
ptr += nb;
|
|
|
|
bp->cnt -= nb;
|
|
|
|
len -= nb;
|
|
|
|
bp->offset += nb;
|
1999-02-06 02:54:47 +00:00
|
|
|
if (bp->cnt == 0)
|
1998-05-01 19:26:12 +00:00
|
|
|
bp = mbuf_FreeSeg(bp);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
1997-08-25 00:29:32 +00:00
|
|
|
return (bp);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
1995-05-30 03:57:47 +00:00
|
|
|
|
1995-01-31 06:29:58 +00:00
|
|
|
void
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Write(struct mbuf * bp, u_char * ptr, int cnt)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
|
|
|
int plen;
|
|
|
|
int nb;
|
|
|
|
|
1998-05-01 19:26:12 +00:00
|
|
|
plen = mbuf_Length(bp);
|
1995-01-31 06:29:58 +00:00
|
|
|
if (plen < cnt)
|
|
|
|
cnt = plen;
|
|
|
|
|
|
|
|
while (cnt > 0) {
|
1997-08-25 00:29:32 +00:00
|
|
|
nb = (cnt < bp->cnt) ? cnt : bp->cnt;
|
1997-10-26 01:04:02 +00:00
|
|
|
memcpy(MBUF_CTOP(bp), ptr, nb);
|
1995-01-31 06:29:58 +00:00
|
|
|
cnt -= bp->cnt;
|
|
|
|
bp = bp->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Show(struct cmdargs const *arg)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
|
|
|
int i;
|
1998-04-07 01:29:44 +00:00
|
|
|
static const char *mbuftype[] = {
|
1998-08-07 18:42:51 +00:00
|
|
|
"async", "fsm", "cbcp", "hdlcout", "ipin", "echo", "lqr", "link",
|
|
|
|
"vjcomp", "ipq", "mp" };
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1998-08-21 18:09:57 +00:00
|
|
|
prompt_Printf(arg->prompt, "Fragments (octets) in use:\n");
|
1998-04-07 01:29:44 +00:00
|
|
|
for (i = 1; i < MB_MAX; i += 2)
|
1998-08-21 18:09:57 +00:00
|
|
|
prompt_Printf(arg->prompt, "%10.10s: %04d (%06d)\t%10.10s: %04d (%06d)\n",
|
|
|
|
mbuftype[i-1], MemMap[i].fragments, MemMap[i].octets, mbuftype[i],
|
|
|
|
MemMap[i+1].fragments, MemMap[i+1].octets);
|
1997-06-09 03:27:43 +00:00
|
|
|
|
1998-04-07 01:29:44 +00:00
|
|
|
if (i == MB_MAX)
|
1998-08-21 18:09:57 +00:00
|
|
|
prompt_Printf(arg->prompt, "%10.10s: %04d (%06d)\n",
|
|
|
|
mbuftype[i-1], MemMap[i].fragments, MemMap[i].octets);
|
1997-06-09 03:27:43 +00:00
|
|
|
|
|
|
|
return 0;
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Log()
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
1998-05-01 19:26:12 +00:00
|
|
|
log_Printf(LogDEBUG, "mbuf_Log: mem alloced: %d\n", totalalloced);
|
|
|
|
log_Printf(LogDEBUG, "mbuf_Log: 1: %d 2: %d 3: %d 4: %d\n",
|
1998-08-21 18:09:57 +00:00
|
|
|
MemMap[1].octets, MemMap[2].octets, MemMap[3].octets, MemMap[4].octets);
|
1998-05-01 19:26:12 +00:00
|
|
|
log_Printf(LogDEBUG, "mbuf_Log: 5: %d 6: %d 7: %d 8: %d\n",
|
1998-08-21 18:09:57 +00:00
|
|
|
MemMap[5].octets, MemMap[6].octets, MemMap[7].octets, MemMap[8].octets);
|
1998-08-07 18:42:51 +00:00
|
|
|
log_Printf(LogDEBUG, "mbuf_Log: 9: %d 10: %d 11: %d\n",
|
1998-08-21 18:09:57 +00:00
|
|
|
MemMap[9].octets, MemMap[10].octets, MemMap[11].octets);
|
1998-01-29 00:44:16 +00:00
|
|
|
}
|
1998-01-30 19:46:07 +00:00
|
|
|
|
|
|
|
struct mbuf *
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Dequeue(struct mqueue *q)
|
1998-01-30 19:46:07 +00:00
|
|
|
{
|
|
|
|
struct mbuf *bp;
|
|
|
|
|
1998-05-01 19:26:12 +00:00
|
|
|
log_Printf(LogDEBUG, "mbuf_Dequeue: queue len = %d\n", q->qlen);
|
1998-01-30 19:46:07 +00:00
|
|
|
bp = q->top;
|
|
|
|
if (bp) {
|
|
|
|
q->top = q->top->pnext;
|
|
|
|
q->qlen--;
|
|
|
|
if (q->top == NULL) {
|
|
|
|
q->last = q->top;
|
|
|
|
if (q->qlen)
|
1998-05-01 19:26:12 +00:00
|
|
|
log_Printf(LogERROR, "mbuf_Dequeue: Not zero (%d)!!!\n", q->qlen);
|
1998-01-30 19:46:07 +00:00
|
|
|
}
|
1998-06-16 19:40:20 +00:00
|
|
|
bp->pnext = NULL;
|
1998-01-30 19:46:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return bp;
|
|
|
|
}
|
|
|
|
|
1998-08-25 17:48:43 +00:00
|
|
|
|
1998-01-30 19:46:07 +00:00
|
|
|
void
|
1998-05-01 19:26:12 +00:00
|
|
|
mbuf_Enqueue(struct mqueue *queue, struct mbuf *bp)
|
1998-01-30 19:46:07 +00:00
|
|
|
{
|
|
|
|
if (queue->last) {
|
|
|
|
queue->last->pnext = bp;
|
|
|
|
queue->last = bp;
|
|
|
|
} else
|
|
|
|
queue->last = queue->top = bp;
|
|
|
|
queue->qlen++;
|
1998-05-01 19:26:12 +00:00
|
|
|
log_Printf(LogDEBUG, "mbuf_Enqueue: len = %d\n", queue->qlen);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|