netwerk/srtp/src/crypto/replay/ut_sim.c@6474c204b198 (annotated)
netwerk/srtp/src/crypto/replay/ut_sim.c
Wed, 31 Dec 2014 06:09:35 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 06:09:35 +0100
- changeset 0
- 6474c204b198
- permissions
- -rw-r--r--
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
| michael@0 | 1 | /* |
| michael@0 | 2 | * ut_sim.c |
| michael@0 | 3 | * |
| michael@0 | 4 | * an unreliable transport simulator |
| michael@0 | 5 | * (for testing replay databases and suchlike) |
| michael@0 | 6 | * |
| michael@0 | 7 | * David A. McGrew |
| michael@0 | 8 | * Cisco Systems, Inc. |
| michael@0 | 9 | */ |
| michael@0 | 10 | |
| michael@0 | 11 | /* |
| michael@0 | 12 | * |
| michael@0 | 13 | * Copyright (c) 2001-2006, Cisco Systems, Inc. |
| michael@0 | 14 | * All rights reserved. |
| michael@0 | 15 | * |
| michael@0 | 16 | * Redistribution and use in source and binary forms, with or without |
| michael@0 | 17 | * modification, are permitted provided that the following conditions |
| michael@0 | 18 | * are met: |
| michael@0 | 19 | * |
| michael@0 | 20 | * Redistributions of source code must retain the above copyright |
| michael@0 | 21 | * notice, this list of conditions and the following disclaimer. |
| michael@0 | 22 | * |
| michael@0 | 23 | * Redistributions in binary form must reproduce the above |
| michael@0 | 24 | * copyright notice, this list of conditions and the following |
| michael@0 | 25 | * disclaimer in the documentation and/or other materials provided |
| michael@0 | 26 | * with the distribution. |
| michael@0 | 27 | * |
| michael@0 | 28 | * Neither the name of the Cisco Systems, Inc. nor the names of its |
| michael@0 | 29 | * contributors may be used to endorse or promote products derived |
| michael@0 | 30 | * from this software without specific prior written permission. |
| michael@0 | 31 | * |
| michael@0 | 32 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| michael@0 | 33 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| michael@0 | 34 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
| michael@0 | 35 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
| michael@0 | 36 | * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, |
| michael@0 | 37 | * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| michael@0 | 38 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
| michael@0 | 39 | * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| michael@0 | 40 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
| michael@0 | 41 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| michael@0 | 42 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
| michael@0 | 43 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 44 | * |
| michael@0 | 45 | */ |
| michael@0 | 46 | |
| michael@0 | 47 | |
| michael@0 | 48 | #include "ut_sim.h" |
| michael@0 | 49 | |
| michael@0 | 50 | |
| michael@0 | 51 | int |
| michael@0 | 52 | ut_compar(const void *a, const void *b) { |
| michael@0 | 53 | return rand() > (RAND_MAX/2) ? -1 : 1; |
| michael@0 | 54 | } |
| michael@0 | 55 | |
| michael@0 | 56 | void |
| michael@0 | 57 | ut_init(ut_connection *utc) { |
| michael@0 | 58 | int i; |
| michael@0 | 59 | utc->index = 0; |
| michael@0 | 60 | |
| michael@0 | 61 | for (i=0; i < UT_BUF; i++) |
| michael@0 | 62 | utc->buffer[i] = i; |
| michael@0 | 63 | |
| michael@0 | 64 | qsort(utc->buffer, UT_BUF, sizeof(uint32_t), ut_compar); |
| michael@0 | 65 | |
| michael@0 | 66 | utc->index = UT_BUF - 1; |
| michael@0 | 67 | } |
| michael@0 | 68 | |
| michael@0 | 69 | uint32_t |
| michael@0 | 70 | ut_next_index(ut_connection *utc) { |
| michael@0 | 71 | uint32_t tmp; |
| michael@0 | 72 | |
| michael@0 | 73 | tmp = utc->buffer[0]; |
| michael@0 | 74 | utc->index++; |
| michael@0 | 75 | utc->buffer[0] = utc->index; |
| michael@0 | 76 | |
| michael@0 | 77 | qsort(utc->buffer, UT_BUF, sizeof(uint32_t), ut_compar); |
| michael@0 | 78 | |
| michael@0 | 79 | return tmp; |
| michael@0 | 80 | } |
| michael@0 | 81 | |
| michael@0 | 82 | |
| michael@0 | 83 | |
| michael@0 | 84 | #ifdef UT_TEST |
| michael@0 | 85 | |
| michael@0 | 86 | #include <stdio.h> |
| michael@0 | 87 | |
| michael@0 | 88 | int |
| michael@0 | 89 | main() { |
| michael@0 | 90 | uint32_t i, irecvd, idiff; |
| michael@0 | 91 | ut_connection utc; |
| michael@0 | 92 | |
| michael@0 | 93 | ut_init(&utc); |
| michael@0 | 94 | |
| michael@0 | 95 | for (i=0; i < 1000; i++) { |
| michael@0 | 96 | irecvd = ut_next_index(&utc); |
| michael@0 | 97 | idiff = i - irecvd; |
| michael@0 | 98 | printf("%lu\t%lu\t%d\n", i, irecvd, idiff); |
| michael@0 | 99 | } |
| michael@0 | 100 | |
| michael@0 | 101 | return 0; |
| michael@0 | 102 | } |
| michael@0 | 103 | |
| michael@0 | 104 | |
| michael@0 | 105 | #endif |
