strongswan/scripts/hash_burn.c
Martin Willi 064fe9c963 enum: Return boolean result for enum_from_name() lookup
Handling the result for enum_from_name() is difficult, as checking for
negative return values requires a cast if the enum type is unsigned. The new
signature clearly differentiates lookup result from lookup value.

Further, this actually allows to convert real -1 enum values, which could not
be distinguished from "not-found" and the -1 return value.

This also fixes several clang warnings where enums are unsigned.
2014-05-16 15:42:07 +02:00

74 lines
1.6 KiB
C

/*
* Copyright (C) 2012 Martin Willi
* Copyright (C) 2012 revosec AG
*
* 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. See <http://www.fsf.org/copyleft/gpl.txt>.
*
* 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.
*/
#include <stdio.h>
#include <library.h>
int main(int argc, char *argv[])
{
hash_algorithm_t alg;
hasher_t *hasher;
char buffer[1024];
int limit = 0, i = 0;
library_init(NULL, "hash_burn");
lib->plugins->load(lib->plugins, PLUGINS);
atexit(library_deinit);
printf("loaded: %s\n", PLUGINS);
memset(buffer, 0x12, sizeof(buffer));
if (argc < 2)
{
fprintf(stderr, "usage: %s <algorithm>!\n", argv[0]);
return 1;
}
if (argc > 2)
{
limit = atoi(argv[2]);
}
if (!enum_from_name(hash_algorithm_short_names, argv[1], &alg))
{
fprintf(stderr, "unknown hash algorthm: %s\n", argv[1]);
return 1;
}
hasher = lib->crypto->create_hasher(lib->crypto, alg);
if (!hasher)
{
fprintf(stderr, "hash algorthm not supported: %N\n",
hash_algorithm_names, alg);
return 1;
}
while (TRUE)
{
if (!hasher->get_hash(hasher, chunk_from_thing(buffer), buffer))
{
fprintf(stderr, "hashing failed!\n");
return 1;
}
if (limit && ++i == limit)
{
break;
}
}
hasher->destroy(hasher);
return 0;
}