| 1 | /*
|
|---|
| 2 | * Copyright (c) 1999 Kungliga Tekniska Högskolan
|
|---|
| 3 | * (Royal Institute of Technology, Stockholm, Sweden).
|
|---|
| 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 | *
|
|---|
| 10 | * 1. Redistributions of source code must retain the above copyright
|
|---|
| 11 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 12 | *
|
|---|
| 13 | * 2. Redistributions in binary form must reproduce the above copyright
|
|---|
| 14 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 15 | * documentation and/or other materials provided with the distribution.
|
|---|
| 16 | *
|
|---|
| 17 | * 3. Neither the name of the Institute nor the names of its contributors
|
|---|
| 18 | * may be used to endorse or promote products derived from this software
|
|---|
| 19 | * without specific prior written permission.
|
|---|
| 20 | *
|
|---|
| 21 | * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|---|
| 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 31 | * SUCH DAMAGE.
|
|---|
| 32 | */
|
|---|
| 33 |
|
|---|
| 34 | #include <config.h>
|
|---|
| 35 |
|
|---|
| 36 | #include "roken.h"
|
|---|
| 37 | #include "parse_bytes.h"
|
|---|
| 38 |
|
|---|
| 39 | static struct testcase {
|
|---|
| 40 | int canonicalp;
|
|---|
| 41 | int val;
|
|---|
| 42 | const char *def_unit;
|
|---|
| 43 | const char *str;
|
|---|
| 44 | } tests[] = {
|
|---|
| 45 | {0, 0, NULL, "0 bytes"},
|
|---|
| 46 | {1, 0, NULL, "0"},
|
|---|
| 47 | {0, 1, NULL, "1"},
|
|---|
| 48 | {1, 1, NULL, "1 byte"},
|
|---|
| 49 | {0, 0, "kilobyte", "0"},
|
|---|
| 50 | {0, 1024, "kilobyte", "1"},
|
|---|
| 51 | {1, 1024, "kilobyte", "1 kilobyte"},
|
|---|
| 52 | {1, 1024 * 1024, NULL, "1 megabyte"},
|
|---|
| 53 | {0, 1025, NULL, "1 kilobyte 1"},
|
|---|
| 54 | {1, 1025, NULL, "1 kilobyte 1 byte"},
|
|---|
| 55 | };
|
|---|
| 56 |
|
|---|
| 57 | int
|
|---|
| 58 | main(int argc, char **argv)
|
|---|
| 59 | {
|
|---|
| 60 | int i;
|
|---|
| 61 | int ret = 0;
|
|---|
| 62 |
|
|---|
| 63 | for (i = 0; i < sizeof(tests)/sizeof(tests[0]); ++i) {
|
|---|
| 64 | char buf[256];
|
|---|
| 65 | int val = parse_bytes (tests[i].str, tests[i].def_unit);
|
|---|
| 66 | int len;
|
|---|
| 67 |
|
|---|
| 68 | if (val != tests[i].val) {
|
|---|
| 69 | printf ("parse_bytes (%s, %s) = %d != %d\n",
|
|---|
| 70 | tests[i].str,
|
|---|
| 71 | tests[i].def_unit ? tests[i].def_unit : "none",
|
|---|
| 72 | val, tests[i].val);
|
|---|
| 73 | ++ret;
|
|---|
| 74 | }
|
|---|
| 75 | if (tests[i].canonicalp) {
|
|---|
| 76 | len = unparse_bytes (tests[i].val, buf, sizeof(buf));
|
|---|
| 77 | if (strcmp (tests[i].str, buf) != 0) {
|
|---|
| 78 | printf ("unparse_bytes (%d) = \"%s\" != \"%s\"\n",
|
|---|
| 79 | tests[i].val, buf, tests[i].str);
|
|---|
| 80 | ++ret;
|
|---|
| 81 | }
|
|---|
| 82 | }
|
|---|
| 83 | }
|
|---|
| 84 | if (ret) {
|
|---|
| 85 | printf ("%d errors\n", ret);
|
|---|
| 86 | return 1;
|
|---|
| 87 | } else
|
|---|
| 88 | return 0;
|
|---|
| 89 | }
|
|---|
