Add tests for pqueue
Reorder the tests in all_tests.sh to be in alphabetical order. Change-Id: Idc6df6ab4a25709312a6f58635061bb643582c70 Reviewed-on: https://boringssl-review.googlesource.com/1680 Reviewed-by: Adam Langley <agl@google.com>
This commit is contained in:
parent
6c7aed048c
commit
04dbb7f1d1
@ -111,7 +111,7 @@ pitem *pqueue_peek(pqueue pq);
|
|||||||
|
|
||||||
/* pqueue_find returns the item whose priority matches |prio64be| or NULL if no
|
/* pqueue_find returns the item whose priority matches |prio64be| or NULL if no
|
||||||
* such item exists. */
|
* such item exists. */
|
||||||
pitem *pqueue_find(pqueue pq, unsigned char *prio64be);
|
pitem *pqueue_find(pqueue pq, uint8_t *prio64be);
|
||||||
|
|
||||||
|
|
||||||
/* Queue mutation functions */
|
/* Queue mutation functions */
|
||||||
@ -131,7 +131,7 @@ size_t pqueue_size(pqueue pq);
|
|||||||
|
|
||||||
/* pqueue_iterator returns an iterator that can be used to iterate over the
|
/* pqueue_iterator returns an iterator that can be used to iterate over the
|
||||||
* contents of the queue. */
|
* contents of the queue. */
|
||||||
pitem *pqueue_iterator(pqueue pq);
|
piterator pqueue_iterator(pqueue pq);
|
||||||
|
|
||||||
/* pqueue_next returns the current value of |iter| and advances it to the next
|
/* pqueue_next returns the current value of |iter| and advances it to the next
|
||||||
* position. If the iterator has advanced over all the elements, it returns
|
* position. If the iterator has advanced over all the elements, it returns
|
||||||
|
@ -7,3 +7,11 @@ add_library(
|
|||||||
|
|
||||||
pqueue.c
|
pqueue.c
|
||||||
)
|
)
|
||||||
|
|
||||||
|
add_executable(
|
||||||
|
pqueue_test
|
||||||
|
|
||||||
|
pqueue_test.c
|
||||||
|
)
|
||||||
|
|
||||||
|
target_link_libraries(pqueue_test ssl)
|
||||||
|
@ -111,7 +111,7 @@ pitem *pqueue_find(pqueue_s *pq, uint8_t *prio64be) {
|
|||||||
pitem *curr;
|
pitem *curr;
|
||||||
|
|
||||||
for (curr = pq->items; curr; curr = curr->next) {
|
for (curr = pq->items; curr; curr = curr->next) {
|
||||||
if (memcmp(curr->priority, prio64be, 8) == 0) {
|
if (memcmp(curr->priority, prio64be, sizeof(curr->priority)) == 0) {
|
||||||
return curr;
|
return curr;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -130,9 +130,9 @@ size_t pqueue_size(pqueue_s *pq) {
|
|||||||
return count;
|
return count;
|
||||||
}
|
}
|
||||||
|
|
||||||
pitem *pqueue_iterator(pqueue_s *pq) { return pq->items; }
|
piterator pqueue_iterator(pqueue_s *pq) { return pq->items; }
|
||||||
|
|
||||||
pitem *pqueue_next(pitem **item) {
|
pitem *pqueue_next(piterator *item) {
|
||||||
pitem *ret;
|
pitem *ret;
|
||||||
|
|
||||||
if (item == NULL || *item == NULL) {
|
if (item == NULL || *item == NULL) {
|
||||||
@ -156,9 +156,9 @@ pitem *pqueue_insert(pqueue_s *pq, pitem *item) {
|
|||||||
for (curr = NULL, next = pq->items; next != NULL;
|
for (curr = NULL, next = pq->items; next != NULL;
|
||||||
curr = next, next = next->next) {
|
curr = next, next = next->next) {
|
||||||
/* we can compare 64-bit value in big-endian encoding with memcmp. */
|
/* we can compare 64-bit value in big-endian encoding with memcmp. */
|
||||||
int cmp = memcmp(next->priority, item->priority, 8);
|
int cmp = memcmp(next->priority, item->priority, sizeof(item->priority));
|
||||||
if (cmp > 0) /* next > item */
|
if (cmp > 0) {
|
||||||
{
|
/* next > item */
|
||||||
item->next = next;
|
item->next = next;
|
||||||
|
|
||||||
if (curr == NULL) {
|
if (curr == NULL) {
|
||||||
@ -168,8 +168,10 @@ pitem *pqueue_insert(pqueue_s *pq, pitem *item) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
return item;
|
return item;
|
||||||
} else if (cmp == 0) /* duplicates not allowed */
|
} else if (cmp == 0) {
|
||||||
|
/* duplicates not allowed */
|
||||||
return NULL;
|
return NULL;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
item->next = NULL;
|
item->next = NULL;
|
||||||
|
88
ssl/pqueue/pqueue_test.c
Normal file
88
ssl/pqueue/pqueue_test.c
Normal file
@ -0,0 +1,88 @@
|
|||||||
|
/* 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. */
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <string.h>
|
||||||
|
|
||||||
|
#include <openssl/pqueue.h>
|
||||||
|
|
||||||
|
|
||||||
|
static int trivial() {
|
||||||
|
pqueue q = pqueue_new();
|
||||||
|
if (q == NULL) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
int32_t data = 0xdeadbeef;
|
||||||
|
uint8_t priority[8] = {0};
|
||||||
|
pitem *item = pitem_new(priority, &data);
|
||||||
|
if (item == NULL ||
|
||||||
|
pqueue_insert(q, item) != item ||
|
||||||
|
pqueue_size(q) != 1 ||
|
||||||
|
pqueue_peek(q) != item ||
|
||||||
|
pqueue_pop(q) != item ||
|
||||||
|
pqueue_size(q) != 0 ||
|
||||||
|
pqueue_pop(q) != NULL) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
pitem_free(item);
|
||||||
|
pqueue_free(q);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
#define NUM_ITEMS 10
|
||||||
|
|
||||||
|
static int fixed_random() {
|
||||||
|
/* Random order of 10 elements, chosen by
|
||||||
|
random.choice(list(itertools.permutations(range(10)))) */
|
||||||
|
int ordering[NUM_ITEMS] = {9, 6, 3, 4, 0, 2, 7, 1, 8, 5};
|
||||||
|
int i;
|
||||||
|
pqueue q = pqueue_new();
|
||||||
|
if (q == NULL) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
uint8_t priority[8] = {0};
|
||||||
|
/* Insert the elements */
|
||||||
|
for (i = 0; i < NUM_ITEMS; i++) {
|
||||||
|
priority[7] = ordering[i];
|
||||||
|
pitem *item = pitem_new(priority, &ordering[i]);
|
||||||
|
pqueue_insert(q, item);
|
||||||
|
}
|
||||||
|
piterator iter = pqueue_iterator(q);
|
||||||
|
pitem *curr = pqueue_next(&iter);
|
||||||
|
if (curr == NULL) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
while (1) {
|
||||||
|
pitem *next = pqueue_next(&iter);
|
||||||
|
if (next == NULL) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
int *curr_data = (int*)curr->data;
|
||||||
|
int *next_data = (int*)next->data;
|
||||||
|
if (*curr_data >= *next_data) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
curr = next;
|
||||||
|
}
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(void) {
|
||||||
|
if (!trivial() || !fixed_random()) {
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
printf("PASS\n");
|
||||||
|
return 0;
|
||||||
|
}
|
@ -20,33 +20,34 @@ if [ "$#" -ge 1 ]; then
|
|||||||
fi
|
fi
|
||||||
|
|
||||||
TESTS="
|
TESTS="
|
||||||
./crypto/cipher/aead_test aes-128-gcm $SRC/crypto/cipher/aes_128_gcm_tests.txt
|
|
||||||
./crypto/cipher/aead_test aes-256-gcm $SRC/crypto/cipher/aes_256_gcm_tests.txt
|
|
||||||
./crypto/cipher/aead_test chacha20-poly1305 $SRC/crypto/cipher/chacha20_poly1305_tests.txt
|
|
||||||
./crypto/cipher/aead_test rc4-md5 $SRC/crypto/cipher/rc4_md5_tests.txt
|
|
||||||
./crypto/cipher/aead_test aes-128-key-wrap $SRC/crypto/cipher/aes_128_key_wrap_tests.txt
|
|
||||||
./crypto/cipher/aead_test aes-256-key-wrap $SRC/crypto/cipher/aes_256_key_wrap_tests.txt
|
|
||||||
./crypto/base64/base64_test
|
./crypto/base64/base64_test
|
||||||
./crypto/bio/bio_test
|
./crypto/bio/bio_test
|
||||||
./crypto/bn/bn_test
|
./crypto/bn/bn_test
|
||||||
|
./crypto/bytestring/bytestring_test
|
||||||
|
./crypto/cipher/aead_test aes-128-gcm $SRC/crypto/cipher/aes_128_gcm_tests.txt
|
||||||
|
./crypto/cipher/aead_test aes-128-key-wrap $SRC/crypto/cipher/aes_128_key_wrap_tests.txt
|
||||||
|
./crypto/cipher/aead_test aes-256-gcm $SRC/crypto/cipher/aes_256_gcm_tests.txt
|
||||||
|
./crypto/cipher/aead_test aes-256-key-wrap $SRC/crypto/cipher/aes_256_key_wrap_tests.txt
|
||||||
|
./crypto/cipher/aead_test chacha20-poly1305 $SRC/crypto/cipher/chacha20_poly1305_tests.txt
|
||||||
|
./crypto/cipher/aead_test rc4-md5 $SRC/crypto/cipher/rc4_md5_tests.txt
|
||||||
./crypto/cipher/cipher_test $SRC/crypto/cipher/cipher_test.txt
|
./crypto/cipher/cipher_test $SRC/crypto/cipher/cipher_test.txt
|
||||||
./crypto/dh/dh_test
|
./crypto/dh/dh_test
|
||||||
./crypto/dsa/dsa_test
|
./crypto/dsa/dsa_test
|
||||||
./crypto/err/err_test
|
|
||||||
./crypto/ec/example_mul
|
./crypto/ec/example_mul
|
||||||
./crypto/ecdsa/ecdsa_test
|
./crypto/ecdsa/ecdsa_test
|
||||||
|
./crypto/err/err_test
|
||||||
./crypto/evp/example_sign
|
./crypto/evp/example_sign
|
||||||
./crypto/hmac/hmac_test
|
./crypto/hmac/hmac_test
|
||||||
./crypto/lhash/lhash_test
|
./crypto/lhash/lhash_test
|
||||||
./crypto/md5/md5_test
|
./crypto/md5/md5_test
|
||||||
./crypto/modes/gcm_test
|
./crypto/modes/gcm_test
|
||||||
|
./crypto/pkcs8/pkcs12_test
|
||||||
./crypto/rsa/rsa_test
|
./crypto/rsa/rsa_test
|
||||||
./crypto/sha/sha1_test
|
./crypto/sha/sha1_test
|
||||||
|
./crypto/x509/pkcs7_test
|
||||||
./crypto/x509v3/tab_test
|
./crypto/x509v3/tab_test
|
||||||
./crypto/x509v3/v3name_test
|
./crypto/x509v3/v3name_test
|
||||||
./crypto/bytestring/bytestring_test
|
./ssl/pqueue/pqueue_test
|
||||||
./crypto/x509/pkcs7_test
|
|
||||||
./crypto/pkcs8/pkcs12_test
|
|
||||||
./ssl/ssl_test
|
./ssl/ssl_test
|
||||||
"
|
"
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user