aboutsummaryrefslogtreecommitdiffstats
path: root/crypto/pqueue/pq_test.c
diff options
context:
space:
mode:
Diffstat (limited to 'crypto/pqueue/pq_test.c')
-rw-r--r--crypto/pqueue/pq_test.c53
1 files changed, 26 insertions, 27 deletions
diff --git a/crypto/pqueue/pq_test.c b/crypto/pqueue/pq_test.c
index 8d496dfc655b..479ab22488f8 100644
--- a/crypto/pqueue/pq_test.c
+++ b/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;
+}