1178825Sdfr/* 2233294Sstas * Copyright (c) 2004 Kungliga Tekniska H��gskolan 3233294Sstas * (Royal Institute of Technology, Stockholm, Sweden). 4233294Sstas * All rights reserved. 5178825Sdfr * 6233294Sstas * Redistribution and use in source and binary forms, with or without 7233294Sstas * modification, are permitted provided that the following conditions 8233294Sstas * are met: 9178825Sdfr * 10233294Sstas * 1. Redistributions of source code must retain the above copyright 11233294Sstas * notice, this list of conditions and the following disclaimer. 12178825Sdfr * 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. 16178825Sdfr * 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. 20178825Sdfr * 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. 32178825Sdfr */ 33178825Sdfr 34178825Sdfr#include <config.h> 35178825Sdfr 36178825Sdfr#include "roken.h" 37178825Sdfr#include "parse_time.h" 38178825Sdfr#include "test-mem.h" 39178825Sdfr#include "err.h" 40178825Sdfr 41178825Sdfrstatic struct testcase { 42178825Sdfr size_t size; 43233294Sstas int val; 44233294Sstas char *str; 45178825Sdfr} tests[] = { 46178825Sdfr { 8, 1, "1 second" }, 47178825Sdfr { 17, 61, "1 minute 1 second" }, 48178825Sdfr { 18, 62, "1 minute 2 seconds" }, 49178825Sdfr { 8, 60, "1 minute" }, 50178825Sdfr { 6, 3600, "1 hour" }, 51178825Sdfr { 15, 3601, "1 hour 1 second" }, 52178825Sdfr { 16, 3602, "1 hour 2 seconds" } 53178825Sdfr}; 54178825Sdfr 55178825Sdfrint 56178825Sdfrmain(int argc, char **argv) 57178825Sdfr{ 58178825Sdfr size_t sz; 59178825Sdfr size_t buf_sz; 60178825Sdfr int i, j; 61178825Sdfr 62178825Sdfr for (i = 0; i < sizeof(tests)/sizeof(tests[0]); ++i) { 63178825Sdfr char *buf; 64178825Sdfr 65178825Sdfr sz = unparse_time(tests[i].val, NULL, 0); 66178825Sdfr if (sz != tests[i].size) 67178825Sdfr errx(1, "sz (%lu) != tests[%d].size (%lu)", 68178825Sdfr (unsigned long)sz, i, (unsigned long)tests[i].size); 69233294Sstas 70178825Sdfr for (buf_sz = 0; buf_sz < tests[i].size + 2; buf_sz++) { 71178825Sdfr 72178825Sdfr buf = rk_test_mem_alloc(RK_TM_OVERRUN, "overrun", 73178825Sdfr NULL, buf_sz); 74178825Sdfr sz = unparse_time(tests[i].val, buf, buf_sz); 75178825Sdfr if (sz != tests[i].size) 76178825Sdfr errx(1, "sz (%lu) != tests[%d].size (%lu) with in size %lu", 77233294Sstas (unsigned long)sz, i, 78178825Sdfr (unsigned long)tests[i].size, 79178825Sdfr (unsigned long)buf_sz); 80178825Sdfr if (buf_sz > 0 && memcmp(buf, tests[i].str, buf_sz - 1) != 0) 81178825Sdfr errx(1, "test %i wrong result %s vs %s", i, buf, tests[i].str); 82178825Sdfr if (buf_sz > 0 && buf[buf_sz - 1] != '\0') 83178825Sdfr errx(1, "test %i not zero terminated", i); 84178825Sdfr rk_test_mem_free("overrun"); 85178825Sdfr 86233294Sstas buf = rk_test_mem_alloc(RK_TM_UNDERRUN, "underrun", 87178825Sdfr NULL, tests[i].size); 88233294Sstas sz = unparse_time(tests[i].val, buf, min(buf_sz, tests[i].size)); 89178825Sdfr if (sz != tests[i].size) 90178825Sdfr errx(1, "sz (%lu) != tests[%d].size (%lu) with insize %lu", 91178825Sdfr (unsigned long)sz, i, 92178825Sdfr (unsigned long)tests[i].size, 93178825Sdfr (unsigned long)buf_sz); 94233294Sstas if (buf_sz > 0 && strncmp(buf, tests[i].str, min(buf_sz, tests[i].size) - 1) != 0) 95178825Sdfr errx(1, "test %i wrong result %s vs %s", i, buf, tests[i].str); 96233294Sstas if (buf_sz > 0 && buf[min(buf_sz, tests[i].size) - 1] != '\0') 97178825Sdfr errx(1, "test %i not zero terminated", i); 98178825Sdfr rk_test_mem_free("underrun"); 99178825Sdfr } 100233294Sstas 101178825Sdfr buf = rk_test_mem_alloc(RK_TM_OVERRUN, "overrun", 102178825Sdfr tests[i].str, tests[i].size + 1); 103178825Sdfr j = parse_time(buf, "s"); 104178825Sdfr if (j != tests[i].val) 105178825Sdfr errx(1, "parse_time failed for test %d", i); 106178825Sdfr rk_test_mem_free("overrun"); 107178825Sdfr 108178825Sdfr buf = rk_test_mem_alloc(RK_TM_UNDERRUN, "underrun", 109178825Sdfr tests[i].str, tests[i].size + 1); 110178825Sdfr j = parse_time(buf, "s"); 111178825Sdfr if (j != tests[i].val) 112178825Sdfr errx(1, "parse_time failed for test %d", i); 113178825Sdfr rk_test_mem_free("underrun"); 114233294Sstas 115178825Sdfr } 116178825Sdfr return 0; 117178825Sdfr} 118