9unit/9unit.c

247 lines
4.6 KiB
C
Raw Normal View History

2023-11-06 00:04:12 -05:00
/*
9unit
Copyright (C) Jonathan Lamothe <jonathan@jlamothe.net>
2023-11-06 00:04:12 -05:00
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation, either version 3 of the
License, or (at your option) any later version.
2023-11-06 00:04:12 -05:00
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
2023-11-06 00:04:12 -05:00
You should have received a copy of the GNU Lesser General Public
License along with this program. If not, see
<http://www.gnu.org/licenses/>.
2023-11-06 00:04:12 -05:00
*/
2023-11-06 13:59:19 -05:00
#include <u.h>
#include <libc.h>
2023-11-06 15:20:09 -05:00
#include <stdio.h>
2023-11-06 13:59:19 -05:00
#include "9unit.h"
// Internal Types
// data required by the context management functions
typedef struct ContextData ContextData;
struct ContextData
{
const char *old_c; // previous context
const char *old_fc; // previous full context
const char *new_c; // new context
char *new_fc; // new full context
};
// Internal Prototypes
static void init_TestState(TestState *);
static void print_log(TestState *);
static void clear_log(TestState *);
static void reindex(TestState *);
static void report(const char *);
static void build_new_context(TestState *, ContextData *);
static void display_context(TestState *);
static void restore_context(TestState *, ContextData *);
// Public Functions
2023-11-06 14:46:01 -05:00
void
run_test(TestState *s, TestResult (*t)(TestState *))
2023-11-06 14:46:01 -05:00
{
if (!s) return;
2023-11-06 14:46:01 -05:00
s->run++;
// a null test function is a pending test
if (!t)
{
s->pending++;
return;
}
switch ((*t)(s))
2023-11-06 14:26:55 -05:00
{
2023-11-06 14:46:01 -05:00
case test_success:
2023-11-06 15:20:09 -05:00
s->passed++;
2023-11-06 14:46:01 -05:00
break;
case test_failure:
2023-11-06 15:20:09 -05:00
s->failed++;
2023-11-06 14:46:01 -05:00
break;
case test_pending:
s->pending++;
2023-11-06 14:46:01 -05:00
break;
default:
exits("test returned an invalid response");
2023-11-06 14:26:55 -05:00
}
}
2023-11-06 15:20:09 -05:00
void
run_tests(void (*tests)(TestState *))
2023-11-06 15:20:09 -05:00
{
if (!tests) return;
2023-11-06 15:20:09 -05:00
TestState s;
2023-11-14 18:08:19 -05:00
memset(&s, 0, sizeof(TestState));
s.report = report;
2023-11-06 15:20:09 -05:00
(*tests)(&s);
2023-11-07 14:36:54 -05:00
print_log(&s);
2023-11-06 15:20:09 -05:00
printf("Tests run: %d\n", s.run);
printf("Tests passed: %d\n", s.passed);
printf("Tests failed: %d\n", s.failed);
printf("Tests pending: %d\n", s.pending);
clear_log(&s);
if (s.failed) exits("test(s) failed");
}
void
append_test_log(TestState *s, const char *msg)
{
if (!(s && msg)) return;
// build a new entry:
TestLogEntry *entry = malloc(sizeof(TestLogEntry));
entry->text = malloc(strlen(msg) + 1);
strcpy(entry->text, msg);
entry->next = 0;
// add it to the list:
if (!s->last_log)
{
if (s->first_log) // no last entry but we have a first?
{
reindex(s);
s->last_log->next = entry;
}
else s->first_log = entry;
}
else // there's already a last entry
{
if (!s->first_log) // no first entry but we have a last?
reindex(s); // do our best to fix that
s->last_log->next = entry;
}
s->last_log = entry;
2023-11-06 15:20:09 -05:00
}
void
test_context(
TestState *s,
const char *label,
void (*test)(TestState *)
)
{
if (!(s && test)) return;
if (label)
{
ContextData cd;
cd.new_c = label;
build_new_context(s, &cd);
display_context(s);
(*test)(s);
restore_context(s, &cd);
}
else (*test)(s);
}
// Internal Functions
static void
print_log(TestState *s)
{
if (!s) return;
TestLogEntry *e = s->first_log;
while(e)
{
if(e->text) printf("%s\n", e->text);
else print("(empty message)\n");
e = e->next;
}
}
static void
clear_log(TestState *s)
{
if (!s) return;
if(s->last_log && !s->first_log) reindex(s); // fix if broken
TestLogEntry *e = s->first_log, *next;
s->first_log = 0;
s->last_log = 0;
while (e)
{
next = e->next;
free(e->text);
free(e);
e = next;
}
}
static void
reindex(TestState *s)
{
if (!s) return;
if (s->first_log)
{
TestLogEntry *e = s->first_log;
while (e)
{
s->last_log = e;
e = e->next;
}
}
else if (s->last_log) // we have a last log but no first?
{
s->first_log = s->last_log;
fprint(2, "potential memory leak in test log\n");
}
}
static void
report(const char *str)
{
print("%s", str);
}
static void
build_new_context(TestState *s, ContextData *cd)
{
cd->old_c = s->context;
cd->old_fc = s->full_context;
if (s->full_context)
{
cd->new_fc = malloc(strlen(cd->old_fc) + strlen(cd->new_c) + 3);
sprintf(cd->new_fc, "%s: %s", cd->old_fc, cd->new_c);
}
else
{
cd->new_fc = malloc(strlen(cd->new_c) + 1);
strcpy(cd->new_fc, cd->new_c);
}
s->context = cd->new_c;
s->full_context = cd->new_fc;
s->depth++;
}
static void
display_context(TestState *s)
{
for (int i = 1; i < s->depth; i++)
s->report("\t");
s->report(s->context);
s->report("\n");
}
static void
restore_context(TestState *s, ContextData *cd)
{
s->context = cd->old_c;
s->full_context = cd->old_fc;
s->depth--;
free(cd->new_fc);
}
2023-11-06 00:04:12 -05:00
//jl