2013-09-18 17:27:38 +00:00
|
|
|
/* $OpenBSD: buffer.c,v 1.33 2013/05/17 00:13:13 djm Exp $ */
|
2011-08-03 19:14:22 +00:00
|
|
|
/* $FreeBSD$ */
|
2000-02-24 14:29:47 +00:00
|
|
|
/*
|
|
|
|
* Author: Tatu Ylonen <ylo@cs.hut.fi>
|
|
|
|
* Copyright (c) 1995 Tatu Ylonen <ylo@cs.hut.fi>, Espoo, Finland
|
|
|
|
* All rights reserved
|
|
|
|
* Functions for manipulating fifo buffers (that can grow if needed).
|
2000-05-15 04:37:24 +00:00
|
|
|
*
|
2000-09-10 08:31:17 +00:00
|
|
|
* As far as I am concerned, the code I have written for this software
|
|
|
|
* can be used freely for any purpose. Any derived versions of this
|
|
|
|
* software must be clearly marked as such, and if the derived work is
|
|
|
|
* incompatible with the protocol description in the RFC file, it must be
|
|
|
|
* called by a name other than "ssh" or "Secure Shell".
|
2000-02-24 14:29:47 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "includes.h"
|
2006-09-30 13:29:51 +00:00
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdarg.h>
|
2000-02-24 14:29:47 +00:00
|
|
|
|
|
|
|
#include "xmalloc.h"
|
|
|
|
#include "buffer.h"
|
2001-05-04 03:57:05 +00:00
|
|
|
#include "log.h"
|
2000-02-24 14:29:47 +00:00
|
|
|
|
2006-09-30 13:29:51 +00:00
|
|
|
#define BUFFER_MAX_CHUNK 0x100000
|
2011-08-03 19:14:22 +00:00
|
|
|
#define BUFFER_MAX_LEN 0x4000000 /* 64MB */
|
2006-09-30 13:29:51 +00:00
|
|
|
#define BUFFER_ALLOCSZ 0x008000
|
|
|
|
|
2000-02-24 14:29:47 +00:00
|
|
|
/* Initializes the buffer structure. */
|
|
|
|
|
2000-05-15 04:37:24 +00:00
|
|
|
void
|
2000-02-24 14:29:47 +00:00
|
|
|
buffer_init(Buffer *buffer)
|
|
|
|
{
|
2003-09-26 19:15:53 +00:00
|
|
|
const u_int len = 4096;
|
|
|
|
|
|
|
|
buffer->alloc = 0;
|
|
|
|
buffer->buf = xmalloc(len);
|
|
|
|
buffer->alloc = len;
|
2000-02-24 14:29:47 +00:00
|
|
|
buffer->offset = 0;
|
|
|
|
buffer->end = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Frees any memory used for the buffer. */
|
|
|
|
|
2000-05-15 04:37:24 +00:00
|
|
|
void
|
2000-02-24 14:29:47 +00:00
|
|
|
buffer_free(Buffer *buffer)
|
|
|
|
{
|
2003-09-26 19:15:53 +00:00
|
|
|
if (buffer->alloc > 0) {
|
|
|
|
memset(buffer->buf, 0, buffer->alloc);
|
2004-01-07 11:10:17 +00:00
|
|
|
buffer->alloc = 0;
|
2013-09-18 17:27:38 +00:00
|
|
|
free(buffer->buf);
|
2003-09-26 19:15:53 +00:00
|
|
|
}
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clears any data from the buffer, making it empty. This does not actually
|
|
|
|
* zero the memory.
|
|
|
|
*/
|
|
|
|
|
2000-05-15 04:37:24 +00:00
|
|
|
void
|
2000-02-24 14:29:47 +00:00
|
|
|
buffer_clear(Buffer *buffer)
|
|
|
|
{
|
|
|
|
buffer->offset = 0;
|
|
|
|
buffer->end = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Appends data to the buffer, expanding it if necessary. */
|
|
|
|
|
2000-05-15 04:37:24 +00:00
|
|
|
void
|
2002-03-18 09:55:03 +00:00
|
|
|
buffer_append(Buffer *buffer, const void *data, u_int len)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
2002-03-18 09:55:03 +00:00
|
|
|
void *p;
|
|
|
|
p = buffer_append_space(buffer, len);
|
|
|
|
memcpy(p, data, len);
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
|
|
|
|
2006-09-30 13:29:51 +00:00
|
|
|
static int
|
|
|
|
buffer_compact(Buffer *buffer)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* If the buffer is quite empty, but all data is at the end, move the
|
|
|
|
* data to the beginning.
|
|
|
|
*/
|
|
|
|
if (buffer->offset > MIN(buffer->alloc, BUFFER_MAX_CHUNK)) {
|
|
|
|
memmove(buffer->buf, buffer->buf + buffer->offset,
|
|
|
|
buffer->end - buffer->offset);
|
|
|
|
buffer->end -= buffer->offset;
|
|
|
|
buffer->offset = 0;
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2000-02-24 14:29:47 +00:00
|
|
|
/*
|
|
|
|
* Appends space to the buffer, expanding the buffer if necessary. This does
|
|
|
|
* not actually copy the data into the buffer, but instead returns a pointer
|
|
|
|
* to the allocated region.
|
|
|
|
*/
|
|
|
|
|
2002-03-18 09:55:03 +00:00
|
|
|
void *
|
|
|
|
buffer_append_space(Buffer *buffer, u_int len)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
2003-09-16 06:11:58 +00:00
|
|
|
u_int newlen;
|
2002-03-18 09:55:03 +00:00
|
|
|
void *p;
|
|
|
|
|
2005-06-05 15:41:57 +00:00
|
|
|
if (len > BUFFER_MAX_CHUNK)
|
2002-06-29 11:34:13 +00:00
|
|
|
fatal("buffer_append_space: len %u not supported", len);
|
|
|
|
|
2000-02-24 14:29:47 +00:00
|
|
|
/* If the buffer is empty, start using it from the beginning. */
|
|
|
|
if (buffer->offset == buffer->end) {
|
|
|
|
buffer->offset = 0;
|
|
|
|
buffer->end = 0;
|
|
|
|
}
|
|
|
|
restart:
|
|
|
|
/* If there is enough space to store all data, store it now. */
|
|
|
|
if (buffer->end + len < buffer->alloc) {
|
2002-03-18 09:55:03 +00:00
|
|
|
p = buffer->buf + buffer->end;
|
2000-02-24 14:29:47 +00:00
|
|
|
buffer->end += len;
|
2002-03-18 09:55:03 +00:00
|
|
|
return p;
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
2006-09-30 13:29:51 +00:00
|
|
|
|
|
|
|
/* Compact data back to the start of the buffer if necessary */
|
|
|
|
if (buffer_compact(buffer))
|
2000-02-24 14:29:47 +00:00
|
|
|
goto restart;
|
2004-02-26 10:38:49 +00:00
|
|
|
|
2006-09-30 13:29:51 +00:00
|
|
|
/* Increase the size of the buffer and retry. */
|
|
|
|
newlen = roundup(buffer->alloc + len, BUFFER_ALLOCSZ);
|
2005-06-05 15:41:57 +00:00
|
|
|
if (newlen > BUFFER_MAX_LEN)
|
2002-06-29 11:34:13 +00:00
|
|
|
fatal("buffer_append_space: alloc %u not supported",
|
2003-09-16 06:11:58 +00:00
|
|
|
newlen);
|
2006-09-30 13:29:51 +00:00
|
|
|
buffer->buf = xrealloc(buffer->buf, 1, newlen);
|
2003-09-16 06:11:58 +00:00
|
|
|
buffer->alloc = newlen;
|
2000-02-24 14:29:47 +00:00
|
|
|
goto restart;
|
2002-03-18 09:55:03 +00:00
|
|
|
/* NOTREACHED */
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
|
|
|
|
2006-09-30 13:29:51 +00:00
|
|
|
/*
|
|
|
|
* Check whether an allocation of 'len' will fit in the buffer
|
|
|
|
* This must follow the same math as buffer_append_space
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
buffer_check_alloc(Buffer *buffer, u_int len)
|
|
|
|
{
|
|
|
|
if (buffer->offset == buffer->end) {
|
|
|
|
buffer->offset = 0;
|
|
|
|
buffer->end = 0;
|
|
|
|
}
|
|
|
|
restart:
|
|
|
|
if (buffer->end + len < buffer->alloc)
|
|
|
|
return (1);
|
|
|
|
if (buffer_compact(buffer))
|
|
|
|
goto restart;
|
|
|
|
if (roundup(buffer->alloc + len, BUFFER_ALLOCSZ) <= BUFFER_MAX_LEN)
|
|
|
|
return (1);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2000-02-24 14:29:47 +00:00
|
|
|
/* Returns the number of bytes of data in the buffer. */
|
|
|
|
|
2001-05-04 03:57:05 +00:00
|
|
|
u_int
|
2010-03-08 11:19:52 +00:00
|
|
|
buffer_len(const Buffer *buffer)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
|
|
|
return buffer->end - buffer->offset;
|
|
|
|
}
|
|
|
|
|
2011-08-03 19:14:22 +00:00
|
|
|
/* Returns the maximum number of bytes of data that may be in the buffer. */
|
|
|
|
u_int
|
|
|
|
buffer_get_max_len(void)
|
|
|
|
{
|
|
|
|
return (BUFFER_MAX_LEN);
|
|
|
|
}
|
|
|
|
|
2000-02-24 14:29:47 +00:00
|
|
|
/* Gets data from the beginning of the buffer. */
|
|
|
|
|
2005-06-05 15:40:50 +00:00
|
|
|
int
|
|
|
|
buffer_get_ret(Buffer *buffer, void *buf, u_int len)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
2005-06-05 15:40:50 +00:00
|
|
|
if (len > buffer->end - buffer->offset) {
|
|
|
|
error("buffer_get_ret: trying to get more bytes %d than in buffer %d",
|
2001-05-04 03:57:05 +00:00
|
|
|
len, buffer->end - buffer->offset);
|
2005-06-05 15:40:50 +00:00
|
|
|
return (-1);
|
|
|
|
}
|
2000-02-24 14:29:47 +00:00
|
|
|
memcpy(buf, buffer->buf + buffer->offset, len);
|
|
|
|
buffer->offset += len;
|
2005-06-05 15:40:50 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
buffer_get(Buffer *buffer, void *buf, u_int len)
|
|
|
|
{
|
|
|
|
if (buffer_get_ret(buffer, buf, len) == -1)
|
|
|
|
fatal("buffer_get: buffer error");
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Consumes the given number of bytes from the beginning of the buffer. */
|
|
|
|
|
2005-06-05 15:40:50 +00:00
|
|
|
int
|
|
|
|
buffer_consume_ret(Buffer *buffer, u_int bytes)
|
|
|
|
{
|
|
|
|
if (bytes > buffer->end - buffer->offset) {
|
|
|
|
error("buffer_consume_ret: trying to get more bytes than in buffer");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
buffer->offset += bytes;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2000-05-15 04:37:24 +00:00
|
|
|
void
|
2001-05-04 03:57:05 +00:00
|
|
|
buffer_consume(Buffer *buffer, u_int bytes)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
2005-06-05 15:40:50 +00:00
|
|
|
if (buffer_consume_ret(buffer, bytes) == -1)
|
|
|
|
fatal("buffer_consume: buffer error");
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Consumes the given number of bytes from the end of the buffer. */
|
|
|
|
|
2005-06-05 15:40:50 +00:00
|
|
|
int
|
|
|
|
buffer_consume_end_ret(Buffer *buffer, u_int bytes)
|
|
|
|
{
|
|
|
|
if (bytes > buffer->end - buffer->offset)
|
|
|
|
return (-1);
|
|
|
|
buffer->end -= bytes;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2000-05-15 04:37:24 +00:00
|
|
|
void
|
2001-05-04 03:57:05 +00:00
|
|
|
buffer_consume_end(Buffer *buffer, u_int bytes)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
2005-06-05 15:40:50 +00:00
|
|
|
if (buffer_consume_end_ret(buffer, bytes) == -1)
|
2000-05-15 04:37:24 +00:00
|
|
|
fatal("buffer_consume_end: trying to get more bytes than in buffer");
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Returns a pointer to the first used byte in the buffer. */
|
|
|
|
|
2002-03-18 09:55:03 +00:00
|
|
|
void *
|
2010-03-08 11:19:52 +00:00
|
|
|
buffer_ptr(const Buffer *buffer)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
|
|
|
return buffer->buf + buffer->offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Dumps the contents of the buffer to stderr. */
|
|
|
|
|
2000-05-15 04:37:24 +00:00
|
|
|
void
|
2010-03-08 11:19:52 +00:00
|
|
|
buffer_dump(const Buffer *buffer)
|
2000-02-24 14:29:47 +00:00
|
|
|
{
|
2004-02-26 10:38:49 +00:00
|
|
|
u_int i;
|
2002-03-18 09:55:03 +00:00
|
|
|
u_char *ucp = buffer->buf;
|
2001-05-04 03:57:05 +00:00
|
|
|
|
|
|
|
for (i = buffer->offset; i < buffer->end; i++) {
|
|
|
|
fprintf(stderr, "%02x", ucp[i]);
|
|
|
|
if ((i-buffer->offset)%16==15)
|
|
|
|
fprintf(stderr, "\r\n");
|
|
|
|
else if ((i-buffer->offset)%2==1)
|
|
|
|
fprintf(stderr, " ");
|
|
|
|
}
|
|
|
|
fprintf(stderr, "\r\n");
|
2000-02-24 14:29:47 +00:00
|
|
|
}
|