mirror of https://github.com/GOSTSec/sgminer
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
88 lines
1.9 KiB
88 lines
1.9 KiB
#include <ccan/tap/tap.h> |
|
#include <stdarg.h> |
|
#include <setjmp.h> |
|
#include <stdlib.h> |
|
#include <stdarg.h> |
|
#include "utils.h" |
|
#include <ccan/opt/opt.c> |
|
#include <ccan/opt/usage.c> |
|
#include <ccan/opt/helpers.c> |
|
#include <ccan/opt/parse.c> |
|
|
|
static void reset_options(void) |
|
{ |
|
free(opt_table); |
|
opt_table = NULL; |
|
opt_count = opt_num_short = opt_num_short_arg = opt_num_long = 0; |
|
} |
|
|
|
/* Test iterators. */ |
|
int main(int argc, char *argv[]) |
|
{ |
|
unsigned j, i, len = 0; |
|
const char *p; |
|
|
|
plan_tests(37 * 2); |
|
for (j = 0; j < 2; j ++) { |
|
reset_options(); |
|
/* Giving subtable a title makes an extra entry! */ |
|
opt_register_table(subtables, j == 0 ? NULL : "subtable"); |
|
|
|
p = first_lopt(&i, &len); |
|
ok1(i == j + 0); |
|
ok1(len == 3); |
|
ok1(strncmp(p, "jjj", len) == 0); |
|
p = next_lopt(p, &i, &len); |
|
ok1(i == j + 0); |
|
ok1(len == 3); |
|
ok1(strncmp(p, "lll", len) == 0); |
|
p = next_lopt(p, &i, &len); |
|
ok1(i == j + 1); |
|
ok1(len == 3); |
|
ok1(strncmp(p, "mmm", len) == 0); |
|
p = next_lopt(p, &i, &len); |
|
ok1(i == j + 5); |
|
ok1(len == 3); |
|
ok1(strncmp(p, "ddd", len) == 0); |
|
p = next_lopt(p, &i, &len); |
|
ok1(i == j + 6); |
|
ok1(len == 3); |
|
ok1(strncmp(p, "eee", len) == 0); |
|
p = next_lopt(p, &i, &len); |
|
ok1(i == j + 7); |
|
ok1(len == 3); |
|
ok1(strncmp(p, "ggg", len) == 0); |
|
p = next_lopt(p, &i, &len); |
|
ok1(i == j + 8); |
|
ok1(len == 3); |
|
ok1(strncmp(p, "hhh", len) == 0); |
|
p = next_lopt(p, &i, &len); |
|
ok1(!p); |
|
|
|
p = first_sopt(&i); |
|
ok1(i == j + 0); |
|
ok1(*p == 'j'); |
|
p = next_sopt(p, &i); |
|
ok1(i == j + 0); |
|
ok1(*p == 'l'); |
|
p = next_sopt(p, &i); |
|
ok1(i == j + 1); |
|
ok1(*p == 'm'); |
|
p = next_sopt(p, &i); |
|
ok1(i == j + 2); |
|
ok1(*p == 'a'); |
|
p = next_sopt(p, &i); |
|
ok1(i == j + 3); |
|
ok1(*p == 'b'); |
|
p = next_sopt(p, &i); |
|
ok1(i == j + 7); |
|
ok1(*p == 'g'); |
|
p = next_sopt(p, &i); |
|
ok1(i == j + 8); |
|
ok1(*p == 'h'); |
|
p = next_sopt(p, &i); |
|
ok1(!p); |
|
} |
|
|
|
return exit_status(); |
|
}
|
|
|