/src/rtpproxy/src/rtpp_pearson.c
Line | Count | Source |
1 | | /* |
2 | | * Copyright (c) 2004-2006 Maxim Sobolev <sobomax@FreeBSD.org> |
3 | | * Copyright (c) 2006-2014 Sippy Software, Inc., http://www.sippysoft.com |
4 | | * All rights reserved. |
5 | | * |
6 | | * Redistribution and use in source and binary forms, with or without |
7 | | * modification, are permitted provided that the following conditions |
8 | | * are met: |
9 | | * 1. Redistributions of source code must retain the above copyright |
10 | | * notice, this list of conditions and the following disclaimer. |
11 | | * 2. Redistributions in binary form must reproduce the above copyright |
12 | | * notice, this list of conditions and the following disclaimer in the |
13 | | * documentation and/or other materials provided with the distribution. |
14 | | * |
15 | | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
16 | | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
17 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
18 | | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
19 | | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
20 | | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
21 | | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
22 | | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
23 | | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
24 | | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
25 | | * SUCH DAMAGE. |
26 | | * |
27 | | */ |
28 | | |
29 | | #include <stdint.h> |
30 | | #include <stdlib.h> |
31 | | #include <string.h> |
32 | | |
33 | | #include "rtpp_pearson.h" |
34 | | |
35 | | void |
36 | | rtpp_pearson_shuffle(struct rtpp_pearson *rpp) |
37 | 2 | { |
38 | 2 | int i; |
39 | 2 | uint8_t rval; |
40 | | |
41 | 2 | memset(rpp->rand_table, '\0', sizeof(rpp->rand_table)); |
42 | 512 | for (i = 1; i < 256; i++) { |
43 | 1.92k | do { |
44 | 1.92k | rval = random() & 0xff; |
45 | 1.92k | } while (rpp->rand_table[rval] != 0); |
46 | 510 | rpp->rand_table[rval] = i; |
47 | 510 | } |
48 | 2 | } |
49 | | |
50 | | uint8_t |
51 | | rtpp_pearson_hash8(struct rtpp_pearson *rpp, const char *bp, const char *ep) |
52 | 263k | { |
53 | 263k | uint8_t res; |
54 | | |
55 | 3.75M | for (res = rpp->rand_table[0]; bp[0] != '\0' && bp != ep; bp++) { |
56 | 3.49M | res = rpp->rand_table[res ^ (uint8_t)(bp[0])]; |
57 | 3.49M | } |
58 | 263k | return res; |
59 | 263k | } |
60 | | |
61 | | uint8_t |
62 | | rtpp_pearson_hash8b(struct rtpp_pearson *rpp, const uint8_t *bp, size_t blen) |
63 | 0 | { |
64 | 0 | uint8_t res; |
65 | 0 | const uint8_t *ep; |
66 | |
|
67 | 0 | ep = bp + blen; |
68 | 0 | for (res = rpp->rand_table[0]; bp != ep; bp++) { |
69 | 0 | res = rpp->rand_table[res ^ bp[0]]; |
70 | 0 | } |
71 | 0 | return res; |
72 | 0 | } |