/* * Simple test driver for MPI library * * Test 3a: Multiplication vs. squaring timing test * * ***** BEGIN LICENSE BLOCK ***** * Version: MPL 1.1/GPL 2.0/LGPL 2.1 * * The contents of this file are subject to the Mozilla Public License Version * 1.1 (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * http://www.mozilla.org/MPL/ * * Software distributed under the License is distributed on an "AS IS" basis, * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License * for the specific language governing rights and limitations under the * License. * * The Original Code is the MPI Arbitrary Precision Integer Arithmetic library. * * The Initial Developer of the Original Code is * Michael J. Fromberger. * Portions created by the Initial Developer are Copyright (C) 1998 * the Initial Developer. All Rights Reserved. * * Contributor(s): * * Alternatively, the contents of this file may be used under the terms of * either the GNU General Public License Version 2 or later (the "GPL"), or * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), * in which case the provisions of the GPL or the LGPL are applicable instead * of those above. If you wish to allow use of your version of this file only * under the terms of either the GPL or the LGPL, and not to allow others to * use your version of this file under the terms of the MPL, indicate your * decision by deleting the provisions above and replace them with the notice * and other provisions required by the GPL or the LGPL. If you do not delete * the provisions above, a recipient may use your version of this file under * the terms of any one of the MPL, the GPL or the LGPL. * * ***** END LICENSE BLOCK ***** */ /* $Id: mptest-3a.c,v 1.3 2004/04/27 23:04:37 gerv%gerv.net Exp $ */ #include #include #include #include #include #include #include "mpi.h" #include "mpprime.h" int main(int argc, char *argv[]) { int ix, num, prec = 8; double d1, d2; clock_t start, finish; time_t seed; mp_int a, c, d; seed = time(NULL); if(argc < 2) { fprintf(stderr, "Usage: %s []\n", argv[0]); return 1; } if((num = atoi(argv[1])) < 0) num = -num; if(!num) { fprintf(stderr, "%s: must perform at least 1 test\n", argv[0]); return 1; } if(argc > 2) { if((prec = atoi(argv[2])) <= 0) prec = 8; else prec = (prec + (DIGIT_BIT - 1)) / DIGIT_BIT; } printf("Test 3a: Multiplication vs squaring timing test\n" "Precision: %d digits (%u bits)\n" "# of tests: %d\n\n", prec, prec * DIGIT_BIT, num); mp_init_size(&a, prec); mp_init(&c); mp_init(&d); printf("Verifying accuracy ... \n"); srand((unsigned int)seed); for(ix = 0; ix < num; ix++) { mpp_random_size(&a, prec); mp_mul(&a, &a, &c); mp_sqr(&a, &d); if(mp_cmp(&c, &d) != 0) { printf("Error! Results not accurate:\n"); printf("a = "); mp_print(&a, stdout); fputc('\n', stdout); printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); printf("d = "); mp_print(&d, stdout); fputc('\n', stdout); mp_sub(&c, &d, &d); printf("dif "); mp_print(&d, stdout); fputc('\n', stdout); mp_clear(&c); mp_clear(&d); mp_clear(&a); return 1; } } printf("Accuracy is confirmed for the %d test samples\n", num); mp_clear(&d); printf("Testing squaring ... \n"); srand((unsigned int)seed); start = clock(); for(ix = 0; ix < num; ix++) { mpp_random_size(&a, prec); mp_sqr(&a, &c); } finish = clock(); d2 = (double)(finish - start) / CLOCKS_PER_SEC; printf("Testing multiplication ... \n"); srand((unsigned int)seed); start = clock(); for(ix = 0; ix < num; ix++) { mpp_random(&a); mp_mul(&a, &a, &c); } finish = clock(); d1 = (double)(finish - start) / CLOCKS_PER_SEC; printf("Multiplication time: %.3f sec (%.3f each)\n", d1, d1 / num); printf("Squaring time: %.3f sec (%.3f each)\n", d2, d2 / num); printf("Improvement: %.2f%%\n", (1.0 - (d2 / d1)) * 100.0); mp_clear(&c); mp_clear(&a); return 0; }