libgfortran/generated/dotprod_r8.c

   1 /* Implementation of the DOT_PRODUCT intrinsic
   2    Copyright 2002 Free Software Foundation, Inc.
   3    Contributed by Paul Brook <paul@nowt.org>
   4
   5 This file is part of the GNU Fortran 95 runtime library (libgfor).
   6
   7 Libgfortran is free software; you can redistribute it and/or
   8 modify it under the terms of the GNU Lesser General Public
   9 License as published by the Free Software Foundation; either
  10 version 2.1 of the License, or (at your option) any later version.
  11
  12 Libgfortran is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU Lesser General Public License for more details.
  16
  17 You should have received a copy of the GNU Lesser General Public
  18 License along with libgfor; see the file COPYING.LIB.  If not,
  19 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  20 Boston, MA 02111-1307, USA.  */
  21
  22 #include "config.h"
  23 #include <stdlib.h>
  24 #include <assert.h>
  25 #include "libgfortran.h"
  26
  27 typedef GFC_ARRAY_DESCRIPTOR(GFC_MAX_DIMENSIONS, char) char_array;
  28
  29 /* Both parameters will already have been converted to the result type.  */
  30 GFC_REAL_8
  31 __dot_product_r8 (gfc_array_r8 * a, gfc_array_r8 * b)
  32 {
  33   GFC_REAL_8 *pa;
  34   GFC_REAL_8 *pb;
  35   GFC_REAL_8 res;
  36   index_type count;
  37   index_type astride;
  38   index_type bstride;
  39
  40   assert (GFC_DESCRIPTOR_RANK (a) == 1
  41           && GFC_DESCRIPTOR_RANK (b) == 1);
  42
  43   if (a->dim[0].stride == 0)
  44     a->dim[0].stride = 1;
  45   if (b->dim[0].stride == 0)
  46     b->dim[0].stride = 1;
  47
  48   astride = a->dim[0].stride;
  49   bstride = b->dim[0].stride;
  50   count = a->dim[0].ubound + 1 - a->dim[0].lbound;
  51   res = 0;
  52   pa = a->data;
  53   pb = b->data;
  54
  55   while (count--)
  56     {
  57       res += *pa * *pb;
  58       pa += astride;
  59       pb += bstride;
  60     }
  61
  62   return res;
  63 }
  64