1 /* crypto/pqueue/pq_test.c */ 2 /* 3 * DTLS implementation written by Nagendra Modadugu 4 * (nagendra@cs.stanford.edu) for the OpenSSL project 2005. 5 */ 6 /* ==================================================================== 7 * Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in 18 * the documentation and/or other materials provided with the 19 * distribution. 20 * 21 * 3. All advertising materials mentioning features or use of this 22 * software must display the following acknowledgment: 23 * "This product includes software developed by the OpenSSL Project 24 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" 25 * 26 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to 27 * endorse or promote products derived from this software without 28 * prior written permission. For written permission, please contact 29 * openssl-core@OpenSSL.org. 30 * 31 * 5. Products derived from this software may not be called "OpenSSL" 32 * nor may "OpenSSL" appear in their names without prior written 33 * permission of the OpenSSL Project. 34 * 35 * 6. Redistributions of any form whatsoever must retain the following 36 * acknowledgment: 37 * "This product includes software developed by the OpenSSL Project 38 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" 39 * 40 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY 41 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 43 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR 44 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 45 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 46 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 47 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 49 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 50 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED 51 * OF THE POSSIBILITY OF SUCH DAMAGE. 52 * ==================================================================== 53 * 54 * This product includes cryptographic software written by Eric Young 55 * (eay@cryptsoft.com). This product includes software written by Tim 56 * Hudson (tjh@cryptsoft.com). 57 * 58 */ 59 #include <stdio.h> 60 #include <stdlib.h> 61 #include <string.h> 62 #include "pqueue.h" 63 64 /* remember to change expected.txt if you change these values */ 65 unsigned char prio1[8] = "supercal"; 66 unsigned char prio2[8] = "ifragili"; 67 unsigned char prio3[8] = "sticexpi"; 68 69 static void 70 pqueue_print(pqueue pq) 71 { 72 pitem *iter, *item; 73 74 iter = pqueue_iterator(pq); 75 for (item = pqueue_next(&iter); item != NULL; 76 item = pqueue_next(&iter)) { 77 printf("item\t%02x%02x%02x%02x%02x%02x%02x%02x\n", 78 item->priority[0], item->priority[1], 79 item->priority[2], item->priority[3], 80 item->priority[4], item->priority[5], 81 item->priority[6], item->priority[7]); 82 } 83 } 84 85 int 86 main(void) 87 { 88 pitem *item; 89 pqueue pq; 90 91 pq = pqueue_new(); 92 93 item = pitem_new(prio3, NULL); 94 pqueue_insert(pq, item); 95 96 item = pitem_new(prio1, NULL); 97 pqueue_insert(pq, item); 98 99 item = pitem_new(prio2, NULL); 100 pqueue_insert(pq, item); 101 102 item = pqueue_find(pq, prio1); 103 fprintf(stderr, "found %p\n", item->priority); 104 105 item = pqueue_find(pq, prio2); 106 fprintf(stderr, "found %p\n", item->priority); 107 108 item = pqueue_find(pq, prio3); 109 fprintf(stderr, "found %p\n", item ? item->priority: 0); 110 111 pqueue_print(pq); 112 113 for (item = pqueue_pop(pq); item != NULL; item = pqueue_pop(pq)) 114 pitem_free(item); 115 116 pqueue_free(pq); 117 return 0; 118 } 119