mirror of
https://github.com/tstack/lnav
synced 2024-11-03 23:15:38 +00:00
126 lines
3.9 KiB
C++
126 lines
3.9 KiB
C++
/**
|
|
* Copyright (c) 2014, Timothy Stack
|
|
*
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
* * Neither the name of Timothy Stack nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
|
|
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
|
|
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#include <assert.h>
|
|
#include <locale.h>
|
|
|
|
#include "lnav_util.hh"
|
|
#include "../src/lnav_util.hh"
|
|
|
|
static const char *GOOD_TIMES[] = {
|
|
"May 01 00:00:01",
|
|
"May 10 12:00:01",
|
|
"2014-02-11 16:12:34",
|
|
|
|
NULL
|
|
};
|
|
|
|
static const char *BAD_TIMES[] = {
|
|
"1-2-3 1:2:3",
|
|
|
|
"2013-22-01 12:01:22",
|
|
"2013-00-01 12:01:22",
|
|
|
|
"@4000000043",
|
|
|
|
NULL
|
|
};
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
setenv("TZ", "UTC", 1);
|
|
|
|
for (int lpc = 0; GOOD_TIMES[lpc]; lpc++) {
|
|
date_time_scanner dts;
|
|
struct timeval tv;
|
|
struct exttm tm;
|
|
const char *rc;
|
|
|
|
rc = dts.scan(GOOD_TIMES[lpc], strlen(GOOD_TIMES[lpc]), NULL, &tm, tv);
|
|
printf("ret %s %p\n", GOOD_TIMES[lpc], rc);
|
|
assert(rc != NULL);
|
|
|
|
char ts[64];
|
|
|
|
dts.ftime(ts, sizeof(ts), tm);
|
|
printf("orig %s\n", GOOD_TIMES[lpc]);
|
|
printf("loop %s\n", ts);
|
|
assert(strcmp(ts, GOOD_TIMES[lpc]) == 0);
|
|
}
|
|
|
|
{
|
|
date_time_scanner dts;
|
|
struct timeval tv;
|
|
|
|
dts.convert_to_timeval("@40000000433225833b6e1a8c", -1, NULL, tv);
|
|
assert(tv.tv_sec == 1127359865);
|
|
assert(tv.tv_usec == 997071);
|
|
|
|
memset(&tv, 0, sizeof(tv));
|
|
dts.convert_to_timeval("@4000000043322583", -1, NULL, tv);
|
|
assert(tv.tv_sec == 1127359865);
|
|
assert(tv.tv_usec == 0);
|
|
}
|
|
|
|
for (int lpc = 0; BAD_TIMES[lpc]; lpc++) {
|
|
date_time_scanner dts;
|
|
struct timeval tv;
|
|
struct exttm tm;
|
|
|
|
printf("Checking bad time: %s\n", BAD_TIMES[lpc]);
|
|
assert(dts.scan(BAD_TIMES[lpc], strlen(BAD_TIMES[lpc]), NULL, &tm, tv) == NULL);
|
|
}
|
|
|
|
{
|
|
const char *en_date = "Jan 1 12:00:00";
|
|
const char *es_date = " 1/Ene/2014:12:00:00 +0000";
|
|
struct timeval en_tv, es_tv;
|
|
struct exttm en_tm, es_tm;
|
|
date_time_scanner dts;
|
|
|
|
if (setlocale(LC_TIME, "es_ES.UTF-8") != NULL) {
|
|
assert(dts.scan(en_date, strlen(en_date), NULL, &en_tm, en_tv) != NULL);
|
|
dts.clear();
|
|
assert(dts.scan(es_date, strlen(es_date), NULL, &es_tm, es_tv) != NULL);
|
|
}
|
|
}
|
|
|
|
{
|
|
const char *epoch_str = "ts 1428721664 ]";
|
|
struct exttm tm;
|
|
off_t off = 0;
|
|
|
|
bool rc = ptime_fmt("ts %s ]", &tm, epoch_str, off, strlen(epoch_str));
|
|
assert(rc);
|
|
assert(tm2sec(&tm.et_tm) == 1428721664);
|
|
}
|
|
}
|