os/ossrv/ssl/libcrypto/src/crypto/bio/bss_mem.c
author sl
Tue, 10 Jun 2014 14:32:02 +0200
changeset 1 260cb5ec6c19
permissions -rw-r--r--
Update contrib.
sl@0
     1
/* crypto/bio/bss_mem.c */
sl@0
     2
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
sl@0
     3
 * All rights reserved.
sl@0
     4
 *
sl@0
     5
 * This package is an SSL implementation written
sl@0
     6
 * by Eric Young (eay@cryptsoft.com).
sl@0
     7
 * The implementation was written so as to conform with Netscapes SSL.
sl@0
     8
 * 
sl@0
     9
 * This library is free for commercial and non-commercial use as long as
sl@0
    10
 * the following conditions are aheared to.  The following conditions
sl@0
    11
 * apply to all code found in this distribution, be it the RC4, RSA,
sl@0
    12
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
sl@0
    13
 * included with this distribution is covered by the same copyright terms
sl@0
    14
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
sl@0
    15
 * 
sl@0
    16
 * Copyright remains Eric Young's, and as such any Copyright notices in
sl@0
    17
 * the code are not to be removed.
sl@0
    18
 * If this package is used in a product, Eric Young should be given attribution
sl@0
    19
 * as the author of the parts of the library used.
sl@0
    20
 * This can be in the form of a textual message at program startup or
sl@0
    21
 * in documentation (online or textual) provided with the package.
sl@0
    22
 * 
sl@0
    23
 * Redistribution and use in source and binary forms, with or without
sl@0
    24
 * modification, are permitted provided that the following conditions
sl@0
    25
 * are met:
sl@0
    26
 * 1. Redistributions of source code must retain the copyright
sl@0
    27
 *    notice, this list of conditions and the following disclaimer.
sl@0
    28
 * 2. Redistributions in binary form must reproduce the above copyright
sl@0
    29
 *    notice, this list of conditions and the following disclaimer in the
sl@0
    30
 *    documentation and/or other materials provided with the distribution.
sl@0
    31
 * 3. All advertising materials mentioning features or use of this software
sl@0
    32
 *    must display the following acknowledgement:
sl@0
    33
 *    "This product includes cryptographic software written by
sl@0
    34
 *     Eric Young (eay@cryptsoft.com)"
sl@0
    35
 *    The word 'cryptographic' can be left out if the rouines from the library
sl@0
    36
 *    being used are not cryptographic related :-).
sl@0
    37
 * 4. If you include any Windows specific code (or a derivative thereof) from 
sl@0
    38
 *    the apps directory (application code) you must include an acknowledgement:
sl@0
    39
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
sl@0
    40
 * 
sl@0
    41
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
sl@0
    42
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0
    43
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
sl@0
    44
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
sl@0
    45
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
sl@0
    46
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
sl@0
    47
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0
    48
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
sl@0
    49
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
sl@0
    50
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
sl@0
    51
 * SUCH DAMAGE.
sl@0
    52
 * 
sl@0
    53
 * The licence and distribution terms for any publically available version or
sl@0
    54
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
sl@0
    55
 * copied and put under another distribution licence
sl@0
    56
 * [including the GNU Public Licence.]
sl@0
    57
 */
sl@0
    58
/*
sl@0
    59
 © Portions copyright (c) 2006 Nokia Corporation.  All rights reserved.
sl@0
    60
 */
sl@0
    61
sl@0
    62
sl@0
    63
#include <stdio.h>
sl@0
    64
#include <errno.h>
sl@0
    65
#include "cryptlib.h"
sl@0
    66
#include <openssl/bio.h>
sl@0
    67
#if (defined(SYMBIAN) && (defined(__WINSCW__) || defined(__WINS__)))
sl@0
    68
#include "libcrypto_wsd_macros.h"
sl@0
    69
#include "libcrypto_wsd.h"
sl@0
    70
#endif
sl@0
    71
sl@0
    72
static int mem_write(BIO *h, const char *buf, int num);
sl@0
    73
static int mem_read(BIO *h, char *buf, int size);
sl@0
    74
static int mem_puts(BIO *h, const char *str);
sl@0
    75
static int mem_gets(BIO *h, char *str, int size);
sl@0
    76
static long mem_ctrl(BIO *h, int cmd, long arg1, void *arg2);
sl@0
    77
static int mem_new(BIO *h);
sl@0
    78
static int mem_free(BIO *data);
sl@0
    79
#ifndef EMULATOR
sl@0
    80
static BIO_METHOD mem_method=
sl@0
    81
	{
sl@0
    82
	BIO_TYPE_MEM,
sl@0
    83
	"memory buffer",
sl@0
    84
	mem_write,
sl@0
    85
	mem_read,
sl@0
    86
	mem_puts,
sl@0
    87
	mem_gets,
sl@0
    88
	mem_ctrl,
sl@0
    89
	mem_new,
sl@0
    90
	mem_free,
sl@0
    91
	NULL,
sl@0
    92
	};
sl@0
    93
#else
sl@0
    94
GET_STATIC_VAR_FROM_TLS(mem_method,bss_mem,BIO_METHOD)
sl@0
    95
#define mem_method (*GET_WSD_VAR_NAME(mem_method,bss_mem,s)())
sl@0
    96
const BIO_METHOD temp_s_mem_method=
sl@0
    97
	{
sl@0
    98
	BIO_TYPE_MEM,
sl@0
    99
	"memory buffer",
sl@0
   100
	mem_write,
sl@0
   101
	mem_read,
sl@0
   102
	mem_puts,
sl@0
   103
	mem_gets,
sl@0
   104
	mem_ctrl,
sl@0
   105
	mem_new,
sl@0
   106
	mem_free,
sl@0
   107
	NULL,
sl@0
   108
	};
sl@0
   109
  
sl@0
   110
sl@0
   111
#endif
sl@0
   112
/* bio->num is used to hold the value to return on 'empty', if it is
sl@0
   113
 * 0, should_retry is not set */
sl@0
   114
sl@0
   115
EXPORT_C BIO_METHOD *BIO_s_mem(void)
sl@0
   116
	{
sl@0
   117
	return(&mem_method);
sl@0
   118
	}
sl@0
   119
sl@0
   120
EXPORT_C BIO *BIO_new_mem_buf(void *buf, int len)
sl@0
   121
{
sl@0
   122
	BIO *ret;
sl@0
   123
	BUF_MEM *b;
sl@0
   124
	if (!buf) {
sl@0
   125
		BIOerr(BIO_F_BIO_NEW_MEM_BUF,BIO_R_NULL_PARAMETER);
sl@0
   126
		return NULL;
sl@0
   127
	}
sl@0
   128
	if(len == -1) len = strlen(buf);
sl@0
   129
	if(!(ret = BIO_new(BIO_s_mem())) ) return NULL;
sl@0
   130
	b = (BUF_MEM *)ret->ptr;
sl@0
   131
	b->data = buf;
sl@0
   132
	b->length = len;
sl@0
   133
	b->max = len;
sl@0
   134
	ret->flags |= BIO_FLAGS_MEM_RDONLY;
sl@0
   135
	/* Since this is static data retrying wont help */
sl@0
   136
	ret->num = 0;
sl@0
   137
	return ret;
sl@0
   138
}
sl@0
   139
sl@0
   140
static int mem_new(BIO *bi)
sl@0
   141
	{
sl@0
   142
	BUF_MEM *b;
sl@0
   143
sl@0
   144
	if ((b=BUF_MEM_new()) == NULL)
sl@0
   145
		return(0);
sl@0
   146
	bi->shutdown=1;
sl@0
   147
	bi->init=1;
sl@0
   148
	bi->num= -1;
sl@0
   149
	bi->ptr=(char *)b;
sl@0
   150
	return(1);
sl@0
   151
	}
sl@0
   152
sl@0
   153
static int mem_free(BIO *a)
sl@0
   154
	{
sl@0
   155
	if (a == NULL) return(0);
sl@0
   156
	if (a->shutdown)
sl@0
   157
		{
sl@0
   158
		if ((a->init) && (a->ptr != NULL))
sl@0
   159
			{
sl@0
   160
			BUF_MEM *b;
sl@0
   161
			b = (BUF_MEM *)a->ptr;
sl@0
   162
			if(a->flags & BIO_FLAGS_MEM_RDONLY) b->data = NULL;
sl@0
   163
			BUF_MEM_free(b);
sl@0
   164
			a->ptr=NULL;
sl@0
   165
			}
sl@0
   166
		}
sl@0
   167
	return(1);
sl@0
   168
	}
sl@0
   169
	
sl@0
   170
static int mem_read(BIO *b, char *out, int outl)
sl@0
   171
	{
sl@0
   172
	int ret= -1;
sl@0
   173
	BUF_MEM *bm;
sl@0
   174
	int i;
sl@0
   175
	char *from,*to;
sl@0
   176
sl@0
   177
	bm=(BUF_MEM *)b->ptr;
sl@0
   178
	BIO_clear_retry_flags(b);
sl@0
   179
	ret=(outl > bm->length)?bm->length:outl;
sl@0
   180
	if ((out != NULL) && (ret > 0)) {
sl@0
   181
		memcpy(out,bm->data,ret);
sl@0
   182
		bm->length-=ret;
sl@0
   183
		/* memmove(&(bm->data[0]),&(bm->data[ret]), bm->length); */
sl@0
   184
		if(b->flags & BIO_FLAGS_MEM_RDONLY) bm->data += ret;
sl@0
   185
		else {
sl@0
   186
			from=(char *)&(bm->data[ret]);
sl@0
   187
			to=(char *)&(bm->data[0]);
sl@0
   188
			for (i=0; i<bm->length; i++)
sl@0
   189
				to[i]=from[i];
sl@0
   190
		}
sl@0
   191
	} else if (bm->length == 0)
sl@0
   192
		{
sl@0
   193
		ret = b->num;
sl@0
   194
		if (ret != 0)
sl@0
   195
			BIO_set_retry_read(b);
sl@0
   196
		}
sl@0
   197
	return(ret);
sl@0
   198
	}
sl@0
   199
sl@0
   200
static int mem_write(BIO *b, const char *in, int inl)
sl@0
   201
	{
sl@0
   202
	int ret= -1;
sl@0
   203
	int blen;
sl@0
   204
	BUF_MEM *bm;
sl@0
   205
sl@0
   206
	bm=(BUF_MEM *)b->ptr;
sl@0
   207
	if (in == NULL)
sl@0
   208
		{
sl@0
   209
		BIOerr(BIO_F_MEM_WRITE,BIO_R_NULL_PARAMETER);
sl@0
   210
		goto end;
sl@0
   211
		}
sl@0
   212
sl@0
   213
	if(b->flags & BIO_FLAGS_MEM_RDONLY) {
sl@0
   214
		BIOerr(BIO_F_MEM_WRITE,BIO_R_WRITE_TO_READ_ONLY_BIO);
sl@0
   215
		goto end;
sl@0
   216
	}
sl@0
   217
sl@0
   218
	BIO_clear_retry_flags(b);
sl@0
   219
	blen=bm->length;
sl@0
   220
	if (BUF_MEM_grow_clean(bm,blen+inl) != (blen+inl))
sl@0
   221
		goto end;
sl@0
   222
	memcpy(&(bm->data[blen]),in,inl);
sl@0
   223
	ret=inl;
sl@0
   224
end:
sl@0
   225
	return(ret);
sl@0
   226
	}
sl@0
   227
sl@0
   228
static long mem_ctrl(BIO *b, int cmd, long num, void *ptr)
sl@0
   229
	{
sl@0
   230
	long ret=1;
sl@0
   231
	char **pptr;
sl@0
   232
sl@0
   233
	BUF_MEM *bm=(BUF_MEM *)b->ptr;
sl@0
   234
sl@0
   235
	switch (cmd)
sl@0
   236
		{
sl@0
   237
	case BIO_CTRL_RESET:
sl@0
   238
		if (bm->data != NULL)
sl@0
   239
			{
sl@0
   240
			/* For read only case reset to the start again */
sl@0
   241
			if(b->flags & BIO_FLAGS_MEM_RDONLY) 
sl@0
   242
				{
sl@0
   243
				bm->data -= bm->max - bm->length;
sl@0
   244
				bm->length = bm->max;
sl@0
   245
				}
sl@0
   246
			else
sl@0
   247
				{
sl@0
   248
				memset(bm->data,0,bm->max);
sl@0
   249
				bm->length=0;
sl@0
   250
				}
sl@0
   251
			}
sl@0
   252
		break;
sl@0
   253
	case BIO_CTRL_EOF:
sl@0
   254
		ret=(long)(bm->length == 0);
sl@0
   255
		break;
sl@0
   256
	case BIO_C_SET_BUF_MEM_EOF_RETURN:
sl@0
   257
		b->num=(int)num;
sl@0
   258
		break;
sl@0
   259
	case BIO_CTRL_INFO:
sl@0
   260
		ret=(long)bm->length;
sl@0
   261
		if (ptr != NULL)
sl@0
   262
			{
sl@0
   263
			pptr=(char **)ptr;
sl@0
   264
			*pptr=(char *)&(bm->data[0]);
sl@0
   265
			}
sl@0
   266
		break;
sl@0
   267
	case BIO_C_SET_BUF_MEM:
sl@0
   268
		mem_free(b);
sl@0
   269
		b->shutdown=(int)num;
sl@0
   270
		b->ptr=ptr;
sl@0
   271
		break;
sl@0
   272
	case BIO_C_GET_BUF_MEM_PTR:
sl@0
   273
		if (ptr != NULL)
sl@0
   274
			{
sl@0
   275
			pptr=(char **)ptr;
sl@0
   276
			*pptr=(char *)bm;
sl@0
   277
			}
sl@0
   278
		break;
sl@0
   279
	case BIO_CTRL_GET_CLOSE:
sl@0
   280
		ret=(long)b->shutdown;
sl@0
   281
		break;
sl@0
   282
	case BIO_CTRL_SET_CLOSE:
sl@0
   283
		b->shutdown=(int)num;
sl@0
   284
		break;
sl@0
   285
sl@0
   286
	case BIO_CTRL_WPENDING:
sl@0
   287
		ret=0L;
sl@0
   288
		break;
sl@0
   289
	case BIO_CTRL_PENDING:
sl@0
   290
		ret=(long)bm->length;
sl@0
   291
		break;
sl@0
   292
	case BIO_CTRL_DUP:
sl@0
   293
	case BIO_CTRL_FLUSH:
sl@0
   294
		ret=1;
sl@0
   295
		break;
sl@0
   296
	case BIO_CTRL_PUSH:
sl@0
   297
	case BIO_CTRL_POP:
sl@0
   298
	default:
sl@0
   299
		ret=0;
sl@0
   300
		break;
sl@0
   301
		}
sl@0
   302
	return(ret);
sl@0
   303
	}
sl@0
   304
sl@0
   305
static int mem_gets(BIO *bp, char *buf, int size)
sl@0
   306
	{
sl@0
   307
	int i,j;
sl@0
   308
	int ret= -1;
sl@0
   309
	char *p;
sl@0
   310
	BUF_MEM *bm=(BUF_MEM *)bp->ptr;
sl@0
   311
sl@0
   312
	BIO_clear_retry_flags(bp);
sl@0
   313
	j=bm->length;
sl@0
   314
	if (j <= 0)
sl@0
   315
		{
sl@0
   316
		*buf='\0';
sl@0
   317
		return 0;
sl@0
   318
		}
sl@0
   319
	p=bm->data;
sl@0
   320
	for (i=0; i<j; i++)
sl@0
   321
		{
sl@0
   322
		if (p[i] == '\n') break;
sl@0
   323
		}
sl@0
   324
	if (i == j)
sl@0
   325
		{
sl@0
   326
		BIO_set_retry_read(bp);
sl@0
   327
		/* return(-1);  change the semantics 0.6.6a */ 
sl@0
   328
		}
sl@0
   329
	else
sl@0
   330
		i++;
sl@0
   331
	/* i is the max to copy */
sl@0
   332
	if ((size-1) < i) i=size-1;
sl@0
   333
	i=mem_read(bp,buf,i);
sl@0
   334
	if (i > 0) buf[i]='\0';
sl@0
   335
	ret=i;
sl@0
   336
	return(ret);
sl@0
   337
	}
sl@0
   338
sl@0
   339
static int mem_puts(BIO *bp, const char *str)
sl@0
   340
	{
sl@0
   341
	int n,ret;
sl@0
   342
sl@0
   343
	n=strlen(str);
sl@0
   344
	ret=mem_write(bp,str,n);
sl@0
   345
	/* memory semantics is that it will always work */
sl@0
   346
	return(ret);
sl@0
   347
	}
sl@0
   348