ccan/tools/ccanlint/ccanlint.c

/*
 * ccanlint: assorted checks and advice for a ccan package
 * Copyright (C) 2008 Rusty Russell, Idris Soule
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the Free
 * Software Foundation; either version 2 of the License, or (at your option)
 * any later version.
 *
 *   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 General Public License for
 * more details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program; if not, write to the Free Software Foundation, Inc., 51
 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */
#include "ccanlint.h"
#include <unistd.h>
#include <getopt.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <err.h>
#include <ctype.h>

static unsigned int verbose = 0;
static LIST_HEAD(compulsory_tests);
static LIST_HEAD(normal_tests);
static LIST_HEAD(finished_tests);

static void usage(const char *name)
{
	fprintf(stderr, "Usage: %s [-s] [-v] [-d <dirname>]\n"
		"   -v: verbose mode\n"
		"   -s: simply give one line per FAIL and total score\n"
		"   -d: use this directory instead of the current one\n",
		name);
	exit(1);
}

static void indent_print(const char *string)
{
	while (*string) {
		unsigned int line = strcspn(string, "\n");
		printf("\t%.*s", line, string);
		if (string[line] == '\n') {
			printf("\n");
			line++;
		}
		string += line;
	}
}

bool ask(const char *question)
{
	char reply[2];

	printf("%s ", question);
	fflush(stdout);

	return fgets(reply, sizeof(reply), stdin) != NULL
		&& toupper(reply[0]) == 'Y';
}

static bool run_test(struct ccanlint *i,
		     bool summary,
		     unsigned int *score,
		     unsigned int *total_score,
		     struct manifest *m)
{
	void *result;
	unsigned int this_score;
	const struct dependent *d;

	if (i->total_score)
		*total_score += i->total_score;
	//one less test to run through
	list_for_each(&i->dependencies, d, node)
		d->dependent->num_depends--;
	result = i->check(m);
	if (!result) {
		if (verbose)
			printf("  %s: OK\n", i->name);
		if (i->total_score)
			*score += i->total_score;

		list_del(&i->list);
		list_add_tail(&finished_tests, &i->list);
		return true;
	}

	if (i->score)
		this_score = i->score(m, result);
	else
		this_score = 0;

	*score += this_score;
	if (summary) {
		printf("%s FAILED (%u/%u)\n",
		       i->name, this_score, i->total_score);

		if (verbose)
			indent_print(i->describe(m, result));
		list_del(&i->list);
		list_add_tail(&finished_tests, &i->list);
		return false;
	}

	printf("%s\n", i->describe(m, result));

	if (i->handle)
		i->handle(m, result);
	list_del(&i->list);
	list_add_tail(&finished_tests, &i->list);
	return false;
}

static void register_test(struct ccanlint *test, ...)
{
	va_list ap;
	struct ccanlint *depends;
	struct dependent *dchild;

	if (!test->total_score)
		list_add(&compulsory_tests, &test->list);
	else
		list_add(&normal_tests, &test->list);

	va_start(ap, test);
	/* Careful: we might have been initialized by a dependent. */
	if (test->dependencies.n.next == NULL)
		list_head_init(&test->dependencies);

	//dependent(s) args (if any), last one is NULL
	while ((depends = va_arg(ap, struct ccanlint *)) != NULL) {
		dchild = malloc(sizeof(*dchild));
		dchild->dependent = test;
		/* The thing we depend on might not be initialized yet! */
		if (depends->dependencies.n.next == NULL)
			list_head_init(&depends->dependencies);
		list_add_tail(&depends->dependencies, &dchild->node);
		test->num_depends++;
	}
	va_end(ap);
}

/**
 * get_next_test - retrieves the next test to be processed
 **/
static inline struct ccanlint *get_next_test(struct list_head *test)
{
	struct ccanlint *i;

	if (list_empty(test))
		return NULL;

	list_for_each(test, i, list) {
		if (i->num_depends == 0)
			return i;
	}
	errx(1, "Can't make process; test dependency cycle");
}

static void init_tests(void)
{
	const struct ccanlint *i;

#undef REGISTER_TEST
#define REGISTER_TEST(name, ...) register_test(&name, __VA_ARGS__)
#include "generated-init-tests"

	if (!verbose)
		return;

	printf("\nCompulsory Tests\n");
	list_for_each(&compulsory_tests, i, list) {
		printf("%s depends on %u others\n", i->name, i->num_depends);
		if (!list_empty(&i->dependencies)) {
			const struct dependent *d;
			printf("These depend on us:\n");
			list_for_each(&i->dependencies, d, node)
				printf("\t%s\n", d->dependent->name);
		}
	}

	printf("\nNormal Tests\n");
	list_for_each(&normal_tests, i, list) {
		printf("%s depends on %u others\n", i->name, i->num_depends);
		if (!list_empty(&i->dependencies)) {
			const struct dependent *d;
			printf("These depend on us:\n");
			list_for_each(&i->dependencies, d, node)
				printf("\t%s\n", d->dependent->name);
		}
	}
}

int main(int argc, char *argv[])
{
	int c;
	bool summary = false;
	unsigned int score, total_score;
	struct manifest *m;
	struct ccanlint *i;

	/* I'd love to use long options, but that's not standard. */
	/* FIXME: getopt_long ccan package? */
	while ((c = getopt(argc, argv, "sd:v")) != -1) {
		switch (c) {
		case 'd':
			if (chdir(optarg) != 0)
				err(1, "Changing into directory '%s'", optarg);
			break;
		case 's':
			summary = true;
			break;
		case 'v':
			verbose++;
			break;
		default:
			usage(argv[0]);
		}
	}

	if (optind < argc)
		usage(argv[0]);

	m = get_manifest();

	init_tests();

	/* If you don't pass the compulsory tests, you don't even get a score */
	if (verbose)
		printf("Compulsory tests:\n");

	while ((i = get_next_test(&compulsory_tests)) != NULL) {
		if (!run_test(i, summary, &score, &total_score, m))
			exit(1);
	}

	if (verbose)
		printf("\nNormal tests:\n");
	score = total_score = 0;
	while ((i = get_next_test(&normal_tests)) != NULL) {
		if (i->total_score)
			run_test(i, summary, &score, &total_score, m);
	}
	printf("Total score: %u/%u\n", score, total_score);

	return 0;
}