mono/linux-packaging-mono
0
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Imported Upstream version 4.8.0.309

Browse Source 
Former-commit-id: 5f9c6ae75f295e057a7d2971f3a6df4656fa8850
This commit is contained in:
Xamarin Public Jenkins (auto-signing)
2016-11-10 13:04:39 +00:00
parent ee1447783b
commit 94b2861243
4912 changed files with 390737 additions and 49310 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
external/boringssl/crypto/lhash/CMakeLists.txt vendored Normal file
View File

@@ -0,0 +1,22 @@
include_directories(../../include)
add_library(
lhash
OBJECT
lhash.c
)
if(ENABLE_TESTS)
add_executable(
lhash_test
lhash_test.c
$<TARGET_OBJECTS:test_support>
)
target_link_libraries(lhash_test crypto)
add_dependencies(all_tests lhash_test)
endif()

346
external/boringssl/crypto/lhash/lhash.c vendored Normal file
View File

@@ -0,0 +1,346 @@
/* 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
* documentation and/or other materials provided with the distribution.
* 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.] */
#include <openssl/lhash.h>
#include <assert.h>
#include <limits.h>
#include <string.h>
#include <openssl/mem.h>
/* kMinNumBuckets is the minimum size of the buckets array in an |_LHASH|. */
static const size_t kMinNumBuckets = 16;
/* kMaxAverageChainLength contains the maximum, average chain length. When the
* average chain length exceeds this value, the hash table will be resized. */
static const size_t kMaxAverageChainLength = 2;
static const size_t kMinAverageChainLength = 1;
_LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp) {
_LHASH *ret;
ret = OPENSSL_malloc(sizeof(_LHASH));
if (ret == NULL) {
return NULL;
}
memset(ret, 0, sizeof(_LHASH));
ret->num_buckets = kMinNumBuckets;
ret->buckets = OPENSSL_malloc(sizeof(LHASH_ITEM *) * ret->num_buckets);
if (ret->buckets == NULL) {
OPENSSL_free(ret);
return NULL;
}
memset(ret->buckets, 0, sizeof(LHASH_ITEM *) * ret->num_buckets);
ret->comp = comp;
if (ret->comp == NULL) {
ret->comp = (lhash_cmp_func) strcmp;
}
ret->hash = hash;
if (ret->hash == NULL) {
ret->hash = (lhash_hash_func) lh_strhash;
}
return ret;
}
void lh_free(_LHASH *lh) {
size_t i;
LHASH_ITEM *n, *next;
if (lh == NULL) {
return;
}
for (i = 0; i < lh->num_buckets; i++) {
for (n = lh->buckets[i]; n != NULL; n = next) {
next = n->next;
OPENSSL_free(n);
}
}
OPENSSL_free(lh->buckets);
OPENSSL_free(lh);
}
size_t lh_num_items(const _LHASH *lh) { return lh->num_items; }
/* get_next_ptr_and_hash returns a pointer to the pointer that points to the
* item equal to |data|. In other words, it searches for an item equal to |data|
* and, if it's at the start of a chain, then it returns a pointer to an
* element of |lh->buckets|, otherwise it returns a pointer to the |next|
* element of the previous item in the chain. If an element equal to |data| is
* not found, it returns a pointer that points to a NULL pointer. If |out_hash|
* is not NULL, then it also puts the hash value of |data| in |*out_hash|. */
static LHASH_ITEM **get_next_ptr_and_hash(const _LHASH *lh, uint32_t *out_hash,
const void *data) {
const uint32_t hash = lh->hash(data);
LHASH_ITEM *cur, **ret;
if (out_hash != NULL) {
*out_hash = hash;
}
ret = &lh->buckets[hash % lh->num_buckets];
for (cur = *ret; cur != NULL; cur = *ret) {
if (lh->comp(cur->data, data) == 0) {
break;
}
ret = &cur->next;
}
return ret;
}
void *lh_retrieve(const _LHASH *lh, const void *data) {
LHASH_ITEM **next_ptr;
next_ptr = get_next_ptr_and_hash(lh, NULL, data);
if (*next_ptr == NULL) {
return NULL;
}
return (*next_ptr)->data;
}
/* lh_rebucket allocates a new array of |new_num_buckets| pointers and
* redistributes the existing items into it before making it |lh->buckets| and
* freeing the old array. */
static void lh_rebucket(_LHASH *lh, const size_t new_num_buckets) {
LHASH_ITEM **new_buckets, *cur, *next;
size_t i, alloc_size;
alloc_size = sizeof(LHASH_ITEM *) * new_num_buckets;
if (alloc_size / sizeof(LHASH_ITEM*) != new_num_buckets) {
return;
}
new_buckets = OPENSSL_malloc(alloc_size);
if (new_buckets == NULL) {
return;
}
memset(new_buckets, 0, alloc_size);
for (i = 0; i < lh->num_buckets; i++) {
for (cur = lh->buckets[i]; cur != NULL; cur = next) {
const size_t new_bucket = cur->hash % new_num_buckets;
next = cur->next;
cur->next = new_buckets[new_bucket];
new_buckets[new_bucket] = cur;
}
}
OPENSSL_free(lh->buckets);
lh->num_buckets = new_num_buckets;
lh->buckets = new_buckets;
}
/* lh_maybe_resize resizes the |buckets| array if needed. */
static void lh_maybe_resize(_LHASH *lh) {
size_t avg_chain_length;
if (lh->callback_depth > 0) {
/* Don't resize the hash if we are currently iterating over it. */
return;
}
assert(lh->num_buckets >= kMinNumBuckets);
avg_chain_length = lh->num_items / lh->num_buckets;
if (avg_chain_length > kMaxAverageChainLength) {
const size_t new_num_buckets = lh->num_buckets * 2;
if (new_num_buckets > lh->num_buckets) {
lh_rebucket(lh, new_num_buckets);
}
} else if (avg_chain_length < kMinAverageChainLength &&
lh->num_buckets > kMinNumBuckets) {
size_t new_num_buckets = lh->num_buckets / 2;
if (new_num_buckets < kMinNumBuckets) {
new_num_buckets = kMinNumBuckets;
}
lh_rebucket(lh, new_num_buckets);
}
}
int lh_insert(_LHASH *lh, void **old_data, void *data) {
uint32_t hash;
LHASH_ITEM **next_ptr, *item;
*old_data = NULL;
next_ptr = get_next_ptr_and_hash(lh, &hash, data);
if (*next_ptr != NULL) {
/* An element equal to |data| already exists in the hash table. It will be
* replaced. */
*old_data = (*next_ptr)->data;
(*next_ptr)->data = data;
return 1;
}
/* An element equal to |data| doesn't exist in the hash table yet. */
item = OPENSSL_malloc(sizeof(LHASH_ITEM));
if (item == NULL) {
return 0;
}
item->data = data;
item->hash = hash;
item->next = NULL;
*next_ptr = item;
lh->num_items++;
lh_maybe_resize(lh);
return 1;
}
void *lh_delete(_LHASH *lh, const void *data) {
LHASH_ITEM **next_ptr, *item, *ret;
next_ptr = get_next_ptr_and_hash(lh, NULL, data);
if (*next_ptr == NULL) {
/* No such element. */
return NULL;
}
item = *next_ptr;
*next_ptr = item->next;
ret = item->data;
OPENSSL_free(item);
lh->num_items--;
lh_maybe_resize(lh);
return ret;
}
static void lh_doall_internal(_LHASH *lh, void (*no_arg_func)(void *),
void (*arg_func)(void *, void *), void *arg) {
size_t i;
LHASH_ITEM *cur, *next;
if (lh == NULL) {
return;
}
if (lh->callback_depth < UINT_MAX) {
/* |callback_depth| is a saturating counter. */
lh->callback_depth++;
}
for (i = 0; i < lh->num_buckets; i++) {
for (cur = lh->buckets[i]; cur != NULL; cur = next) {
next = cur->next;
if (arg_func) {
arg_func(cur->data, arg);
} else {
no_arg_func(cur->data);
}
}
}
if (lh->callback_depth < UINT_MAX) {
lh->callback_depth--;
}
/* The callback may have added or removed elements and the non-zero value of
* |callback_depth| will have suppressed any resizing. Thus any needed
* resizing is done here. */
lh_maybe_resize(lh);
}
void lh_doall(_LHASH *lh, void (*func)(void *)) {
lh_doall_internal(lh, func, NULL, NULL);
}
void lh_doall_arg(_LHASH *lh, void (*func)(void *, void *), void *arg) {
lh_doall_internal(lh, NULL, func, arg);
}
uint32_t lh_strhash(const char *c) {
/* The following hash seems to work very well on normal text strings
* no collisions on /usr/dict/words and it distributes on %2^n quite
* well, not as good as MD5, but still good. */
unsigned long ret = 0;
long n;
unsigned long v;
int r;
if ((c == NULL) || (*c == '\0')) {
return (ret);
}
n = 0x100;
while (*c) {
v = n | (*c);
n += 0x100;
r = (int)((v >> 2) ^ v) & 0x0f;
ret = (ret << r) | (ret >> (32 - r));
ret &= 0xFFFFFFFFL;
ret ^= v * v;
c++;
}
return ((ret >> 16) ^ ret);
}

203
external/boringssl/crypto/lhash/lhash_test.c vendored Normal file
View File

@@ -0,0 +1,203 @@
/* Copyright (c) 2014, Google Inc.
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
* OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
* CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
#if !defined(_POSIX_C_SOURCE)
#define _POSIX_C_SOURCE 201410L
#endif
#include <openssl/crypto.h>
#include <openssl/lhash.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct dummy_lhash_node {
char *s;
struct dummy_lhash_node *next;
};
struct dummy_lhash {
struct dummy_lhash_node *head;
};
static void dummy_lh_free(struct dummy_lhash *lh) {
struct dummy_lhash_node *cur, *next;
for (cur = lh->head; cur != NULL; cur = next) {
next = cur->next;
free(cur->s);
free(cur);
}
}
static size_t dummy_lh_num_items(const struct dummy_lhash *lh) {
size_t count = 0;
struct dummy_lhash_node *cur;
for (cur = lh->head; cur != NULL; cur = cur->next) {
count++;
}
return count;
}
static char *dummy_lh_retrieve(struct dummy_lhash *lh, const char *s) {
struct dummy_lhash_node *cur;
for (cur = lh->head; cur != NULL; cur = cur->next) {
if (strcmp(cur->s, s) == 0) {
return cur->s;
}
}
return NULL;
}
static int dummy_lh_insert(struct dummy_lhash *lh, char **old_data, char *s) {
struct dummy_lhash_node *node, *cur;
for (cur = lh->head; cur != NULL; cur = cur->next) {
if (strcmp(cur->s, s) == 0) {
*old_data = cur->s;
cur->s = s;
return 1;
}
}
node = malloc(sizeof(struct dummy_lhash_node));
*old_data = NULL;
node->s = s;
node->next = lh->head;
lh->head = node;
return 1;
}
static char *dummy_lh_delete(struct dummy_lhash *lh, const void *s) {
struct dummy_lhash_node *cur, **next_ptr;
char *ret;
next_ptr = &lh->head;
for (cur = lh->head; cur != NULL; cur = cur->next) {
if (strcmp(cur->s, s) == 0) {
ret = cur->s;
*next_ptr = cur->next;
free(cur);
return ret;
}
next_ptr = &cur->next;
}
return NULL;
}
static char *rand_string(void) {
unsigned len = 1 + (rand() % 3);
char *ret = malloc(len + 1);
unsigned i;
for (i = 0; i < len; i++) {
ret[i] = '0' + (rand() & 7);
}
ret[i] = 0;
return ret;
}
int main(int argc, char **argv) {
_LHASH *lh;
struct dummy_lhash dummy_lh = {NULL};
unsigned i;
CRYPTO_library_init();
lh = lh_new(NULL, NULL);
if (lh == NULL) {
return 1;
}
for (i = 0; i < 100000; i++) {
unsigned action;
char *s, *s1, *s2;
if (dummy_lh_num_items(&dummy_lh) != lh_num_items(lh)) {
fprintf(stderr, "Length mismatch\n");
return 1;
}
action = rand() % 3;
switch (action) {
case 0:
s = rand_string();
s1 = (char *)lh_retrieve(lh, s);
s2 = dummy_lh_retrieve(&dummy_lh, s);
if (s1 != NULL && (s2 == NULL || strcmp(s1, s2) != 0)) {
fprintf(stderr, "lh_retrieve failure\n");
abort();
}
free(s);
break;
case 1:
s = rand_string();
lh_insert(lh, (void **)&s1, s);
#if defined(OPENSSL_WINDOWS)
dummy_lh_insert(&dummy_lh, &s2, _strdup(s));
#else
dummy_lh_insert(&dummy_lh, &s2, strdup(s));
#endif
if (s1 != NULL && (s2 == NULL || strcmp(s1, s2) != 0)) {
fprintf(stderr, "lh_insert failure\n");
abort();
}
if (s1) {
free(s1);
}
if (s2) {
free(s2);
}
break;
case 2:
s = rand_string();
s1 = lh_delete(lh, s);
s2 = dummy_lh_delete(&dummy_lh, s);
if (s1 != NULL && (s2 == NULL || strcmp(s1, s2) != 0)) {
fprintf(stderr, "lh_insert failure\n");
abort();
}
if (s1) {
free(s1);
}
if (s2) {
free(s2);
}
free(s);
break;
default:
abort();
}
}
lh_doall(lh, free);
lh_free(lh);
dummy_lh_free(&dummy_lh);
printf("PASS\n");
return 0;
}

67
external/boringssl/crypto/lhash/make_macros.sh vendored Normal file
View File

@@ -0,0 +1,67 @@
#!/bin/sh
include_dir=../../include/openssl
out=${include_dir}/lhash_macros.h
cat > $out << EOF
/* Copyright (c) 2014, Google Inc.
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
* OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
* CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
#if !defined(IN_LHASH_H)
#error "Don't include this file directly. Include lhash.h"
#endif
EOF
output_lhash () {
type=$1
cat >> $out << EOF
/* ${type} */
#define lh_${type}_new(hash, comp)\\
((LHASH_OF(${type})*) lh_new(CHECKED_CAST(lhash_hash_func, uint32_t (*) (const ${type} *), hash), CHECKED_CAST(lhash_cmp_func, int (*) (const ${type} *a, const ${type} *b), comp)))
#define lh_${type}_free(lh)\\
lh_free(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh));
#define lh_${type}_num_items(lh)\\
lh_num_items(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh))
#define lh_${type}_retrieve(lh, data)\\
((${type}*) lh_retrieve(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void*, ${type}*, data)))
#define lh_${type}_insert(lh, old_data, data)\\
lh_insert(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void**, ${type}**, old_data), CHECKED_CAST(void*, ${type}*, data))
#define lh_${type}_delete(lh, data)\\
((${type}*) lh_delete(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void*, ${type}*, data)))
#define lh_${type}_doall(lh, func)\\
lh_doall(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void (*)(void*), void (*) (${type}*), func));
#define lh_${type}_doall_arg(lh, func, arg)\\
lh_doall_arg(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void (*)(void*, void*), void (*) (${type}*, void*), func), arg);
EOF
}
lhash_types=$(cat ${include_dir}/lhash.h | grep '^ \* LHASH_OF:' | sed -e 's/.*LHASH_OF://' -e 's/ .*//')
for type in $lhash_types; do
echo Hash of ${type}
output_lhash "${type}"
done
clang-format -i $out