mbuf.c revision 7568150a58e78021968b6c22bc28e9787b33496a
/*
* Copyright (c) 2000, Boris Popov
* 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
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Boris Popov.
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* 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.
*
* $Id: mbuf.c,v 1.3 2004/12/13 00:25:22 lindak Exp $
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include <ctype.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h>
#include <libintl.h>
#include <assert.h>
#ifdef APPLE
#define __func__ ""
#endif
static int
{
struct mbuf *m;
if (m == NULL)
return (ENOMEM);
*mpp = m;
return (0);
}
static void
{
free(m);
}
static void
{
struct mbuf *m;
while (m0) {
m0 = m;
}
}
static size_t
{
int len = 0;
while (m) {
m = m->m_next;
}
return (len);
}
int
{
char *dp;
int error;
return (0);
}
return (error);
while (m0) {
m0 = m;
}
return (0);
}
int
{
struct mbuf *m;
int error;
return (error);
}
int
{
return (0);
}
int
{
}
return (0);
}
int
{
goto out;
break;
}
if (len > 0) {
return (error);
}
out:
return (0);
}
/*
* Routines to put data in a buffer
*/
return (error)
/*
* Check if object of size 'size' fit to the current position and
* allocate new mbuf if not. Advance pointers and increase length of mbuf(s).
* Return pointer to the object placeholder or NULL if any error occured.
*/
int
{
int error;
if (M_TRAILINGSPACE(m) < (int)size) {
return (error);
m = mn;
}
return (0);
}
int
{
*p = x;
return (0);
}
int
{
/* LINTED */
setwbe(p, 0, x);
return (0);
}
int
{
/* LINTED */
setwle(p, 0, x);
return (0);
}
int
{
/* LINTED */
setdbe(p, 0, x);
return (0);
}
int
{
/* LINTED */
setdle(p, 0, x);
return (0);
}
int
{
*p = htobeq(x);
return (0);
}
int
{
*p = htoleq(x);
return (0);
}
int
{
struct mbuf *m;
char *dst;
int error;
if (size == 0)
return (0);
return (error);
while (size > 0) {
cplen = M_TRAILINGSPACE(m);
if (cplen == 0) {
m = m->m_next;
continue;
}
if (source) {
} else
}
return (0);
}
int
{
while (m) {
break;
m = m->m_next;
}
return (0);
}
int
{
if (len > 255) {
len = 255;
}
return (error);
}
/*
* Routines for fetching data from an mbuf chain
*/
int
{
}
int
{
}
int
{
uint16_t v;
if (x != NULL)
*x = letohs(v);
return (error);
}
int
uint16_t v;
if (x != NULL)
*x = betohs(v);
return (error);
}
int
{
}
int
{
uint32_t v;
int error;
if (x != NULL)
*x = betohl(v);
return (error);
}
int
{
uint32_t v;
int error;
if (x != NULL)
*x = letohl(v);
return (error);
}
int
{
}
int
{
uint64_t v;
int error;
if (x != NULL)
*x = betohq(v);
return (error);
}
int
{
uint64_t v;
int error;
if (x != NULL)
*x = letohq(v);
return (error);
}
int
{
while (size > 0) {
if (m == NULL) {
#ifdef DEBUG
#endif
#ifdef APPLE
MBERROR("incomplete copy\n");
#endif
return (EBADRPC);
}
if (count == 0) {
if (m)
continue;
}
if (target) {
if (count == 1) {
} else {
}
}
}
return (0);
}