--- joko/Uni/BSArch/01/prime.c 2006/05/12 21:13:49 1.6 +++ joko/Uni/BSArch/01/prime.c 2006/05/12 23:27:11 1.7 @@ -1,4 +1,4 @@ -/* $Id: prime.c,v 1.6 2006/05/12 21:13:49 joko Exp $ */ +/* $Id: prime.c,v 1.7 2006/05/12 23:27:11 joko Exp $ */ #include #include @@ -15,6 +15,11 @@ BOOL is_prime(long int number) { int i; + + /* negative values are never prime numbers */ + if (number < 2) return FALSE; + + /* check all numbers 2..sqrt(number) for being a prime number */ for (i=2; i*i <= number; i++) { if ((number % i) == 0) return FALSE; @@ -22,11 +27,14 @@ return TRUE; } -/* convert from string to long, with error checking */ +/* convert from string to long int, with error checking */ long int convert_number(const char *nptr) { long int number = strtol(nptr, (char **)NULL, 10); - if (number == LONG_MAX) { - PRINTERROR("Number '%s' is not in range of 'long int'."); + if (number == LONG_MAX || number == LONG_MIN) { + char message[254]; + snprintf(message, 255, "Number is not in range of 'long int': %s", nptr); + PRINTERROR(message); + exit(-1); } } @@ -35,14 +43,14 @@ if (argc == 1) { PRINTERROR("No arguments given."); - return -1; + exit(-1); } /* (3) range mode */ if (argc > 2) { - int i, j; - j = atoi(argv[2]); - for (i = atoi(argv[1]); i< j; i++) { + long int i, j; + j = convert_number(argv[2]); + for (i = convert_number(argv[1]); i< j; i++) { PRINTPRIME(i); } @@ -54,16 +62,15 @@ /* (1) test-single-number mode: first argument is not a filename */ if (fp == NULL) { - /* PRINTPRIME(atoi(argv[1])); */ - PRINTPRIME(convert_number(argv[1])); + long int number = convert_number(argv[1]); + PRINTPRIME(number); /* (2) file mode: read numbers from file */ } else { - char num[11]; - while (fgets(num, 11, fp)) { - printf("raw: %s\n", num); - printf("num: %i\n", atoi(num)); - PRINTPRIME(atoi(num)); + char entry[11]; + while (fgets(entry, 11, fp)) { + long int number = convert_number(entry); + PRINTPRIME(number); } fclose(fp); }