1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191
|
/* vim: set tabstop=8 shiftwidth=4 softtabstop=4 expandtab smarttab colorcolumn=80: */
/*
* Copyright 2017 Red Hat, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "../lib/hooks.h"
#include <jose/jose.h>
#include <assert.h>
#include <string.h>
#include <stdlib.h>
static int g_high_compression_tested = 0;
static int g_low_compression_tested = 0;
const struct {
const char *alg;
const char *inf;
const char *def;
} tests[] = {
{ /* RFC 7520 5.9 */
.alg = "DEF",
.inf = "WW91IGNhbiB0cnVzdCB1cyB0byBzdGljayB3aXRoIHlvdSB0aHJvdWdoIHRoaW"
"NrIGFuZCB0aGlu4oCTdG8gdGhlIGJpdHRlciBlbmQuIEFuZCB5b3UgY2FuIHRy"
"dXN0IHVzIHRvIGtlZXAgYW55IHNlY3JldCBvZiB5b3Vyc-KAk2Nsb3NlciB0aG"
"FuIHlvdSBrZWVwIGl0IHlvdXJzZWxmLiBCdXQgeW91IGNhbm5vdCB0cnVzdCB1"
"cyB0byBsZXQgeW91IGZhY2UgdHJvdWJsZSBhbG9uZSwgYW5kIGdvIG9mZiB3aX"
"Rob3V0IGEgd29yZC4gV2UgYXJlIHlvdXIgZnJpZW5kcywgRnJvZG8u",
.def = "bY_BDcIwDEVX-QNU3QEOrIA4pqlDokYxchxVvbEDGzIJbioOSJwc-f___HPjBu"
"8KVFpVtAplVE1-wZo0YjNZo3C7R5v72pV5f5X382VWjYQpqZKAyjziZOr2B7kQ"
"PSy6oZIXUnDYbVKN4jNXi2u0yB7t1qSHTjmMODf9QgvrDzfTIQXnyQRuUya4zI"
"WG3vTOdir0v7BRHFYWq3k1k1A_gSDJqtcBF-GZxw8"
},
{}
};
const uint32_t long_string_tests[] = {
2000, 200000, 10000000, 0
};
static uint8_t* get_random_string(uint32_t length)
{
assert(length);
uint8_t* c = (uint8_t*)malloc(length*sizeof(uint8_t));
assert(c);
for (uint32_t i=0; i<length; i++) {
c[i] = 'A' + (random() % 26);
}
return c;
}
static void
test_long_string(size_t inputlen) {
jose_io_auto_t *b = NULL;
jose_io_auto_t *c = NULL;
jose_io_auto_t *z = NULL;
void *buf1 = NULL;
void *buf2 = NULL;
size_t blen = 0;
size_t clen = 0;
const jose_hook_alg_t *a = jose_hook_alg_find(JOSE_HOOK_ALG_KIND_COMP, "DEF");
uint8_t* str = get_random_string(inputlen);
/* Test compression first. */
b = jose_io_malloc(NULL, &buf1, &blen);
assert(b);
z = a->comp.def(a, NULL, b);
assert(z);
assert(z->feed(z, str, inputlen));
assert(z->done(z));
/* Test decompression now */
c = jose_io_malloc(NULL, &buf2, &clen);
assert(b);
z = a->comp.inf(a, NULL, c);
assert(z);
/* If length>MAX_COMPRESSED_SIZE, it must fail due to high decompression size */
if(blen > MAX_COMPRESSED_SIZE) {
assert(!z->feed(z, buf1, blen));
g_high_compression_tested = 1;
} else {
assert(z->feed(z, buf1, blen));
g_low_compression_tested = 1;
/* Compare the final output with the original input. */
assert(clen == inputlen);
assert(memcmp(buf2, str, inputlen) == 0);
}
assert(z->done(z));
free(str);
}
static void
test(const jose_hook_alg_t *a, bool iter,
const uint8_t *i, size_t il)
{
jose_io_auto_t *b = NULL;
jose_io_auto_t *c = NULL;
jose_io_auto_t *z = NULL;
void *buf1 = NULL;
void *buf2 = NULL;
size_t blen = 0;
size_t clen = 0;
/* Test compression first. */
b = jose_io_malloc(NULL, &buf1, &blen);
assert(b);
z = a->comp.def(a, NULL, b);
assert(z);
if (iter) {
for (size_t j = 0; j < il; j++)
assert(z->feed(z, &i[j], 1));
} else {
assert(z->feed(z, i, il));
}
assert(z->done(z));
/* Test decompression now. */
c = jose_io_malloc(NULL, &buf2, &clen);
assert(b);
z = a->comp.inf(a, NULL, c);
assert(z);
if (iter) {
uint8_t *m = buf1;
for (size_t j = 0; j < blen; j++)
assert(z->feed(z, &m[j], 1));
} else {
assert(z->feed(z, buf1, blen));
}
assert(z->done(z));
/* Compare the final output with the original input. */
assert(clen == il);
assert(memcmp(buf2, i, il) == 0);
}
int
main(int argc, char *argv[])
{
for (size_t i = 0; tests[i].alg; i++) {
const size_t ilen = jose_b64_dec_buf(NULL, strlen(tests[i].inf), NULL, 0);
const size_t dlen = jose_b64_dec_buf(NULL, strlen(tests[i].def), NULL, 0);
const jose_hook_alg_t *a = NULL;
assert(ilen != SIZE_MAX);
assert(dlen != SIZE_MAX);
uint8_t tst_inf[ilen];
uint8_t tst_def[dlen];
assert((a = jose_hook_alg_find(JOSE_HOOK_ALG_KIND_COMP, tests[i].alg)));
assert(jose_b64_dec_buf(tests[i].inf, strlen(tests[i].inf),
tst_inf, sizeof(tst_inf)) == sizeof(tst_inf));
assert(jose_b64_dec_buf(tests[i].def, strlen(tests[i].def),
tst_def, sizeof(tst_def)) == sizeof(tst_def));
test(a, false,
tst_inf, sizeof(tst_inf));
test(a, true,
tst_inf, sizeof(tst_inf));
}
for (size_t i = 0; long_string_tests[i]; i++) {
test_long_string(long_string_tests[i]);
}
assert(1 == g_high_compression_tested);
assert(1 == g_low_compression_tested);
return EXIT_SUCCESS;
}
|