1 files changed, 236 insertions, 0 deletions
diff --git a/usr/src/lib/smbsrv/libmlrpc/common/mlrpc_heap.c b/usr/src/lib/smbsrv/libmlrpc/common/mlrpc_heap.c
new file mode 100644
index 0000000000..97a16ea010
--- /dev/null
+++ b/usr/src/lib/smbsrv/libmlrpc/common/mlrpc_heap.c
@@ -0,0 +1,236 @@
+/*
+ * 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
+ * or http://www.opensolaris.org/os/licensing.
+ * 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 2007 Sun Microsystems, Inc.  All rights reserved.
+ * Use is subject to license terms.
+ */
+
+#pragma ident	"%Z%%M%	%I%	%E% SMI"
+
+/*
+ * MLRPC heap management. The heap is used for temporary storage by
+ * both the client and server side library routines.  In order to
+ * support the different requirements of the various RPCs, the heap
+ * can grow dynamically if required.  We start with a single block
+ * and perform sub-allocations from it.  If an RPC requires more space
+ * we will continue to add it a block at a time.  This means that we
+ * don't hog lots of memory on every call to support the few times
+ * that we actually need a lot heap space.
+ *
+ * Note that there is no individual free function.  Once space has been
+ * allocated, it remains allocated until the heap is destroyed.  This
+ * shouldn't be an issue because the heap is being filled with data to
+ * be marshalled or unmarshalled and we need it all to be there until
+ * the point that the entire heap is no longer required.
+ */
+
+#include <sys/errno.h>
+#include <stdlib.h>
+#include <string.h>
+#include <strings.h>
+#include <sys/uio.h>
+
+#include <smbsrv/libsmb.h>
+#include <smbsrv/mlrpc.h>
+
+/*
+ * Allocate a heap structure and the first heap block.  For many RPC
+ * operations this will be the only time we need to malloc memory
+ * in this instance of the heap.  The only point of note here is that
+ * we put the heap management data in the first block to avoid a
+ * second malloc. Make sure that sizeof(mlrpc_heap_t) is smaller
+ * than MLRPC_HEAP_BLKSZ.
+ *
+ * Note that the heap management data is at the start of the first block.
+ *
+ * Returns a pointer to the newly created heap, which is used like an
+ * opaque handle with the rest of the heap management interface..
+ */
+mlrpc_heap_t *
+mlrpc_heap_create(void)
+{
+	mlrpc_heap_t *heap;
+	char *base;
+
+	if ((base = (char *)malloc(MLRPC_HEAP_BLKSZ)) == NULL)
+		return (NULL);
+
+	/*LINTED E_BAD_PTR_CAST_ALIGN*/
+	heap = (mlrpc_heap_t *)base;
+	bzero(heap, sizeof (mlrpc_heap_t));
+
+	heap->iovcnt = MLRPC_HEAP_MAXIOV;
+	heap->iov = heap->iovec;
+	heap->iov->iov_base = base;
+	heap->iov->iov_len = sizeof (mlrpc_heap_t);
+	heap->top = base + MLRPC_HEAP_BLKSZ;
+	heap->next = base + sizeof (mlrpc_heap_t);
+
+	return (heap);
+}
+
+/*
+ * Deallocate all of the memory associated with a heap.  This is the
+ * only way to deallocate heap memory, it isn't possible to free the
+ * space obtained by individual malloc calls.
+ *
+ * Note that the first block contains the heap management data, which
+ * is deleted last.
+ */
+void
+mlrpc_heap_destroy(mlrpc_heap_t *heap)
+{
+	int i;
+	char *p;
+
+	if (heap) {
+		for (i = 1; i < MLRPC_HEAP_MAXIOV; ++i) {
+			if ((p = heap->iovec[i].iov_base) != NULL)
+				free(p);
+		}
+
+		free(heap);
+	}
+}
+
+/*
+ * Allocate space in the specified heap.  All requests are padded, if
+ * required, to ensure dword alignment.  If the current iov will be
+ * exceeded, we allocate a new block and setup the next iov.  Otherwise
+ * all we have to do is move the next pointer and update the current
+ * iov length.
+ *
+ * On success, a pointer to the allocated (dword aligned) area is
+ * returned.  Otherwise a null pointer is returned.
+ */
+void *
+mlrpc_heap_malloc(mlrpc_heap_t *heap, unsigned size)
+{
+	char *p;
+	int align;
+	int incr_size;
+
+	align = (4 - size) & 3;
+	size += align;
+
+	if (heap == NULL || size == 0)
+		return (NULL);
+
+	p = heap->next;
+
+	if (p + size > heap->top) {
+		if ((heap->iovcnt == 0) || ((--heap->iovcnt) == 0))
+			return (NULL);
+
+		incr_size = (size < MLRPC_HEAP_BLKSZ) ? MLRPC_HEAP_BLKSZ : size;
+
+		if ((p = (char *)malloc(incr_size)) == NULL)
+			return (NULL);
+
+		++heap->iov;
+		heap->iov->iov_base = p;
+		heap->iov->iov_len = 0;
+		heap->top = p + incr_size;
+	}
+
+	heap->next = p + size;
+	heap->iov->iov_len += size;
+	return ((void *)p);
+}
+
+/*
+ * Convenience function to do heap strdup.
+ */
+void *
+mlrpc_heap_strsave(mlrpc_heap_t *heap, char *s)
+{
+	int len;
+	void *p;
+
+	if (s == NULL)
+		return (NULL);
+
+	/*
+	 * We don't need to clutter the heap with empty strings.
+	 */
+	if ((len = strlen(s)) == 0)
+		return ("");
+
+	if ((p = mlrpc_heap_malloc(heap, len+1)) != NULL)
+		(void) strcpy((char *)p, s);
+
+	return (p);
+}
+
+/*
+ * Our regular string marshalling always creates null terminated strings
+ * but some Windows clients and servers are pedantic about the string
+ * formats they will accept and require non-null terminated strings.
+ * This function can be used to build a wide-char, non-null terminated
+ * string in the heap as a varying/conformant array.  We need to do the
+ * wide-char conversion here because the marshalling code won't be
+ * aware that this is really a string.
+ */
+void
+mlrpc_heap_mkvcs(mlrpc_heap_t *heap, char *s, mlrpc_vcbuf_t *vcs)
+{
+	int mlen;
+
+	vcs->wclen = mts_wcequiv_strlen(s);
+	vcs->wcsize = vcs->wclen;
+
+	mlen = sizeof (struct mlrpc_vcb) + vcs->wcsize + sizeof (mts_wchar_t);
+
+	vcs->vcb = (struct mlrpc_vcb *)mlrpc_heap_malloc(heap, mlen);
+
+	if (vcs->vcb) {
+		vcs->vcb->vc_first_is = 0;
+		vcs->vcb->vc_length_is = vcs->wclen / sizeof (mts_wchar_t);
+		(void) mts_mbstowcs((mts_wchar_t *)vcs->vcb->buffer, s,
+		    vcs->vcb->vc_length_is);
+	}
+}
+
+int
+mlrpc_heap_used(mlrpc_heap_t *heap)
+{
+	int used = 0;
+	int i;
+
+	for (i = 0; i < MLRPC_HEAP_MAXIOV; ++i)
+		used += heap->iovec[i].iov_len;
+
+	return (used);
+}
+
+int
+mlrpc_heap_avail(mlrpc_heap_t *heap)
+{
+	int avail;
+	int count;
+
+	count = (heap->iovcnt == 0) ? 0 : (heap->iovcnt - 1);
+
+	avail = count * MLRPC_HEAP_BLKSZ;
+	avail += (heap->top - heap->next);
+
+	return (avail);
+}