tree is a list :P
* anyway, some changes here
-> a struct T consumes sizeof(struct T) of memory
-> actual wasn't really needed here. thrown away.
committer: Markus Bröker <mbroeker@largo.homelinux.org>
/**
* test/demos/crypt.c
* Copyright (C) 2008 Markus Broeker
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <crypt.h>
#define GETRANDOM(max) ('a'+(int)((float)max*rand()/RAND_MAX+1.0))
int main (int argc, char **argv)
{
char salt[20] = { 0 };
if (argc != 2) {
printf ("Usage: %s <plaintext>\n", argv[0]);
return EXIT_FAILURE;
}
srand (time (NULL));
sprintf (salt, "$1$%c%c", GETRANDOM (26), GETRANDOM (26));
printf ("%s\n", crypt (argv[1], salt));
return EXIT_SUCCESS;
}