155682Smarkm/* 2233294Sstas * Copyright (c) 1999 Kungliga Tekniska H��gskolan 3233294Sstas * (Royal Institute of Technology, Stockholm, Sweden). 4233294Sstas * All rights reserved. 555682Smarkm * 6233294Sstas * Redistribution and use in source and binary forms, with or without 7233294Sstas * modification, are permitted provided that the following conditions 8233294Sstas * are met: 955682Smarkm * 10233294Sstas * 1. Redistributions of source code must retain the above copyright 11233294Sstas * notice, this list of conditions and the following disclaimer. 1255682Smarkm * 13233294Sstas * 2. Redistributions in binary form must reproduce the above copyright 14233294Sstas * notice, this list of conditions and the following disclaimer in the 15233294Sstas * documentation and/or other materials provided with the distribution. 1655682Smarkm * 17233294Sstas * 3. Neither the name of the Institute nor the names of its contributors 18233294Sstas * may be used to endorse or promote products derived from this software 19233294Sstas * without specific prior written permission. 2055682Smarkm * 21233294Sstas * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 22233294Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23233294Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24233294Sstas * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 25233294Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26233294Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27233294Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28233294Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29233294Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30233294Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31233294Sstas * SUCH DAMAGE. 3255682Smarkm */ 3355682Smarkm 3455682Smarkm#include <config.h> 3555682Smarkm 3655682Smarkm#include "roken.h" 3755682Smarkm#include "parse_bytes.h" 3855682Smarkm 3955682Smarkmstatic struct testcase { 4055682Smarkm int canonicalp; 4155682Smarkm int val; 4255682Smarkm const char *def_unit; 4355682Smarkm const char *str; 4455682Smarkm} tests[] = { 4555682Smarkm {0, 0, NULL, "0 bytes"}, 4655682Smarkm {1, 0, NULL, "0"}, 4755682Smarkm {0, 1, NULL, "1"}, 4855682Smarkm {1, 1, NULL, "1 byte"}, 4955682Smarkm {0, 0, "kilobyte", "0"}, 5055682Smarkm {0, 1024, "kilobyte", "1"}, 5155682Smarkm {1, 1024, "kilobyte", "1 kilobyte"}, 5255682Smarkm {1, 1024 * 1024, NULL, "1 megabyte"}, 5355682Smarkm {0, 1025, NULL, "1 kilobyte 1"}, 5455682Smarkm {1, 1025, NULL, "1 kilobyte 1 byte"}, 5555682Smarkm}; 5655682Smarkm 5755682Smarkmint 5855682Smarkmmain(int argc, char **argv) 5955682Smarkm{ 6055682Smarkm int i; 6155682Smarkm int ret = 0; 6255682Smarkm 6355682Smarkm for (i = 0; i < sizeof(tests)/sizeof(tests[0]); ++i) { 6455682Smarkm char buf[256]; 6555682Smarkm int val = parse_bytes (tests[i].str, tests[i].def_unit); 6690926Snectar int len; 6755682Smarkm 6855682Smarkm if (val != tests[i].val) { 6955682Smarkm printf ("parse_bytes (%s, %s) = %d != %d\n", 7055682Smarkm tests[i].str, 7155682Smarkm tests[i].def_unit ? tests[i].def_unit : "none", 7255682Smarkm val, tests[i].val); 7355682Smarkm ++ret; 7455682Smarkm } 7555682Smarkm if (tests[i].canonicalp) { 7655682Smarkm len = unparse_bytes (tests[i].val, buf, sizeof(buf)); 7755682Smarkm if (strcmp (tests[i].str, buf) != 0) { 7855682Smarkm printf ("unparse_bytes (%d) = \"%s\" != \"%s\"\n", 7955682Smarkm tests[i].val, buf, tests[i].str); 8055682Smarkm ++ret; 8155682Smarkm } 82233294Sstas } 8355682Smarkm } 8455682Smarkm if (ret) { 8555682Smarkm printf ("%d errors\n", ret); 8655682Smarkm return 1; 8755682Smarkm } else 8855682Smarkm return 0; 8955682Smarkm} 90