smb_mbuf_util.c revision 3ad684d66b78e06edd37e2c4fd3b3949f095194b
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2008 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/*
* Copyright (c) 1982, 1986, 1988, 1991, 1993
* The Regents of the University of California. 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 the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
*
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* MLRPC server-side library processing. This is where we decode the
* request header to figure out what type of request is being made,
* call the server stub, if appropriate, and build the response header.
*/
#include <smbsrv/smb_incl.h>
/*
* Fragment size (5680: NT style). Tuning parameter
* used during development of multiple fragment support.
*/
#define MLRPC_FRAG_SIZE 5680
#define MLRPC_RSP_HDR_SIZE 24
/*
* smb_mbuf_get
*
* Allocate mbufs to hold the amount of data specified.
* A pointer to the head of the mbuf list is returned.
*/
struct mbuf *
{
struct mbuf *m = 0;
int count;
int offset = 0;
while (nbytes) {
if (mhead == 0) {
m = mhead;
} else {
m = m->m_next;
}
}
}
return (mhead);
}
/*
* Allocate enough mbufs to accommodate the residual count in a uio.
*/
struct mbuf *
{
struct mbuf *m = 0;
if (mhead == 0) {
m = mhead;
} else {
m = m->m_next;
}
}
iovs--;
iovp++;
}
return (mhead);
}
/*
* Trim an mbuf chain to nbytes.
*/
void
{
while (m != 0) {
if (m->m_next != 0) {
m->m_next = 0;
}
break;
}
m = m->m_next;
}
}
int
{
int used = 0;
while (m != 0) {
m = m->m_next;
}
return (used);
}
int
{
}
void
{
}
void
{
struct mbuf *m;
if (max_bytes != 0) {
m->m_len = 0;
}
}
void
{
struct mbuf *m;
m->m_nextpkt = 0;
m_freem(m);
}
}
void
{
(MBC)->chain_offset = 0;
}
void
{
struct mbuf *m;
} else {
while (m->m_next != 0)
m = m->m_next;
}
}
void
{
(MBC)->chain_offset = 0;
}
int
{
return (EMSGSIZE);
return (0);
}
int
{
int rc = 0;
int len = 0;
mbuf_t *m;
while (m) {
m = m->m_next;
continue;
}
break;
}
}
return (rc);
}
/*
* Free a single mbuf structure. Calls m->m_ext.ext_ref() to free any
* associated external buffers if present (indicated by m->m_flags & M_EXT)
*/
struct mbuf *
{
struct mbuf *n;
MFREE(m, n);
return (n);
}
/*
* Free a list of mbufs. Each mbuf in the list is freed similarly to m_free.
*/
void
{
struct mbuf *n;
if (m == NULL)
return;
/*
* Lint doesn't like the m = n assignment at the close of the loop
* but it is correct. MFREE assigns n = (m)->m_next so the loop
* is effectively assigning m = (m)->m_next then exiting when
* m == NULL
*/
do {
MFREE(m, n);
} while ((m = n) != 0);
}
/*
* Mbuffer utility routines.
*/
int /*ARGSUSED*/
{
MEM_FREE("mbuf", p);
return (0);
}
int /*ARGSUSED*/
{
return (0);
}