summaryrefslogtreecommitdiff
path: root/drivers/builtin_openssl2/crypto/pqueue/pq_test.c
diff options
context:
space:
mode:
authorRémi Verschelde <remi@verschelde.fr>2016-04-11 23:16:31 +0200
committerRémi Verschelde <remi@verschelde.fr>2016-04-11 23:16:31 +0200
commit925aa086a27fc06d7dacc866fed975046652cf23 (patch)
tree2b8b62259a10351b224a43444ff08592f446efff /drivers/builtin_openssl2/crypto/pqueue/pq_test.c
parent89fcd529f3966a2f4977402f9d8f1ec25dfeb53e (diff)
parentc860574d8ba246b5e2c59578f24accd2ace5e9bc (diff)
Merge pull request #4275 from mrezai/openssl-1.0.1s
Update OpenSSL to version 1.0.1s
Diffstat (limited to 'drivers/builtin_openssl2/crypto/pqueue/pq_test.c')
-rw-r--r--drivers/builtin_openssl2/crypto/pqueue/pq_test.c53
1 files changed, 26 insertions, 27 deletions
diff --git a/drivers/builtin_openssl2/crypto/pqueue/pq_test.c b/drivers/builtin_openssl2/crypto/pqueue/pq_test.c
index 8d496dfc65..479ab22488 100644
--- a/drivers/builtin_openssl2/crypto/pqueue/pq_test.c
+++ b/drivers/builtin_openssl2/crypto/pqueue/pq_test.c
@@ -1,7 +1,7 @@
/* crypto/pqueue/pq_test.c */
-/*
+/*
* DTLS implementation written by Nagendra Modadugu
- * (nagendra@cs.stanford.edu) for the OpenSSL project 2005.
+ * (nagendra@cs.stanford.edu) for the OpenSSL project 2005.
*/
/* ====================================================================
* Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved.
@@ -11,7 +11,7 @@
* are met:
*
* 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
+ * 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
@@ -59,37 +59,36 @@
#include "pqueue.h"
-int
-main(void)
- {
- pitem *item;
- pqueue pq;
+int main(void)
+{
+ pitem *item;
+ pqueue pq;
- pq = pqueue_new();
+ pq = pqueue_new();
- item = pitem_new(3, NULL);
- pqueue_insert(pq, item);
+ item = pitem_new(3, NULL);
+ pqueue_insert(pq, item);
- item = pitem_new(1, NULL);
- pqueue_insert(pq, item);
+ item = pitem_new(1, NULL);
+ pqueue_insert(pq, item);
- item = pitem_new(2, NULL);
- pqueue_insert(pq, item);
+ item = pitem_new(2, NULL);
+ pqueue_insert(pq, item);
- item = pqueue_find(pq, 1);
- fprintf(stderr, "found %ld\n", item->priority);
+ item = pqueue_find(pq, 1);
+ fprintf(stderr, "found %ld\n", item->priority);
- item = pqueue_find(pq, 2);
- fprintf(stderr, "found %ld\n", item->priority);
+ item = pqueue_find(pq, 2);
+ fprintf(stderr, "found %ld\n", item->priority);
- item = pqueue_find(pq, 3);
- fprintf(stderr, "found %ld\n", item ? item->priority: 0);
+ item = pqueue_find(pq, 3);
+ fprintf(stderr, "found %ld\n", item ? item->priority : 0);
- pqueue_print(pq);
+ pqueue_print(pq);
- for(item = pqueue_pop(pq); item != NULL; item = pqueue_pop(pq))
- pitem_free(item);
+ for (item = pqueue_pop(pq); item != NULL; item = pqueue_pop(pq))
+ pitem_free(item);
- pqueue_free(pq);
- return 0;
- }
+ pqueue_free(pq);
+ return 0;
+}