stack.c revision 9dc0df1bac950d6e491f9a7c7e4888f2b301cb15
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
* All rights reserved.
*
* This package is an SSL implementation written
* by Eric Young (eay@cryptsoft.com).
* The implementation was written so as to conform with Netscapes SSL.
*
* This library is free for commercial and non-commercial use as long as
* the following conditions are aheared to. The following conditions
* apply to all code found in this distribution, be it the RC4, RSA,
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
* included with this distribution is covered by the same copyright terms
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
*
* Copyright remains Eric Young's, and as such any Copyright notices in
* the code are not to be removed.
* If this package is used in a product, Eric Young should be given attribution
* as the author of the parts of the library used.
* This can be in the form of a textual message at program startup or
* in documentation (online or textual) provided with the package.
*
* 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 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 cryptographic software written by
* Eric Young (eay@cryptsoft.com)"
* The word 'cryptographic' can be left out if the rouines from the library
* being used are not cryptographic related :-).
* 4. If you include any Windows specific code (or a derivative thereof) from
* the apps directory (application code) you must include an acknowledgement:
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
*
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``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.
*
* The licence and distribution terms for any publically available version or
* derivative of this code cannot be changed. i.e. this code cannot simply be
* copied and put under another distribution licence
* [including the GNU Public Licence.]
*/
/* Code for stacks
* Author - Eric Young v 1.0
* 1.2 eay 12-Mar-97 - Modified sk_find so that it _DOES_ return the
* lowest index for the searched item.
*
* 1.1 eay - Take from netdb and added to SSLeay
*
* 1.0 eay - First version 29/07/92
*/
#include <stdio.h>
#include "cryptlib.h"
#define MIN_NODES 4
#include <errno.h>
(const char * const *, const char * const *)
{
return old;
}
{
char **s;
return(ret);
err:
if(ret)
return(NULL);
}
STACK *sk_new_null(void)
{
return sk_new((int (*)(const char * const *, const char * const *))0);
}
{
int i;
goto err;
goto err;
for (i=0; i<MIN_NODES; i++)
return(ret);
err:
if(ret)
return(NULL);
}
{
char **s;
{
if (s == NULL)
return(0);
}
else
{
int i;
char **f,**t;
t[i]=f[i];
#ifdef undef /* no memmove on sunos :-( */
#endif
}
}
{
int i;
return(NULL);
}
{
char *ret;
int i,j;
{
for (i=loc; i<j; i++)
/* In theory memcpy is not safe for this
* memcpy( &(st->data[loc]),
* &(st->data[loc+1]),
* sizeof(char *)*(st->num-loc-1));
*/
}
return(ret);
}
{
char **r;
int i;
int (*comp_func)(const void *,const void *);
{
return(i);
return(-1);
}
/* This (and the "qsort" below) are the two places in OpenSSL
* where we need to convert from our standard (type **,type **)
* compare callback type to the (void *,void *) type required by
* bsearch. However, the "data" it is being called(back) with are
* not (type *) pointers, but the *pointers* to (type *) pointers,
* so we get our extra level of pointer dereferencing that way. */
if (r == NULL) return(-1);
}
{
}
{
}
{
}
{
}
{
}
{
}
{
}
{
int i;
}
{
}
{
}
{
}
{
}
{
{
int (*comp_func)(const void *,const void *);
/* same comment as in sk_find ... previously st->comp was declared
* as a (void*,void*) callback type, but this made the population
* of the callback pointer illogical - our callbacks compare
* type** with type**, so we leave the casting until absolutely
* necessary (ie. "now"). */
}
}
{
if (!st)
return 1;
}