diff options
| author | jb <jb@138bc75d-0d04-0410-961f-82ee72b054a4> | 2006-06-06 08:10:09 +0000 |
|---|---|---|
| committer | jb <jb@138bc75d-0d04-0410-961f-82ee72b054a4> | 2006-06-06 08:10:09 +0000 |
| commit | fff369f22c8f50cd4b6040f7860d38fed7aeb963 (patch) | |
| tree | 88f8e06667bc01f3aee614a92f3130c18d864edd /libgfortran/intrinsics/random.c | |
| parent | ad82e5889ae755adf02837f5d1d71375b82da4a9 (diff) | |
| download | ppe42-gcc-fff369f22c8f50cd4b6040f7860d38fed7aeb963.tar.gz ppe42-gcc-fff369f22c8f50cd4b6040f7860d38fed7aeb963.zip | |
2006-06-06 Janne Blomqvist <jb@gcc.gnu.org>
* m4/in_pack.m4: Add TODO comment about detecting temporaries,
remove test for stride 0, update copyright year.
* m4/transpose.m4: Remove test for stride 0, update copyright
year.
* m4/iforeach.m4: Likewise.
* m4/shape.m4: Likewise.
* m4/in_unpack.m4: Likewise.
* m4/reshape.m4: Likewise.
* m4/ifunction.m4: Likewise.
* m4/matmul.m4: Likewise.
* m4/matmull.m4: Likewise.
* intrinsics/etime.c: Likewise.
* intrinsics/transpose_generic.c: Likewise.
* intrinsics/spread_generic.c: Likewise.
* intrinsics/stat.c: Likewise.
* intrinsics/reshape_generic.c: Likewise.
* intrinsics/random.c: Likewise.
* generated/*: Regenerated from above changed m4 files.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@114424 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libgfortran/intrinsics/random.c')
| -rw-r--r-- | libgfortran/intrinsics/random.c | 14 |
1 files changed, 1 insertions, 13 deletions
diff --git a/libgfortran/intrinsics/random.c b/libgfortran/intrinsics/random.c index d77a381583c..9ea2889fd25 100644 --- a/libgfortran/intrinsics/random.c +++ b/libgfortran/intrinsics/random.c @@ -1,5 +1,5 @@ /* Implementation of the RANDOM intrinsics - Copyright 2002, 2004, 2005 Free Software Foundation, Inc. + Copyright 2002, 2004, 2005, 2006 Free Software Foundation, Inc. Contributed by Lars Segerlund <seger@linuxmail.org> and Steve Kargl. @@ -188,9 +188,6 @@ arandom_r4 (gfc_array_r4 *x) dest = x->data; - if (x->dim[0].stride == 0) - x->dim[0].stride = 1; - dim = GFC_DESCRIPTOR_RANK (x); for (n = 0; n < dim; n++) @@ -261,9 +258,6 @@ arandom_r8 (gfc_array_r8 *x) dest = x->data; - if (x->dim[0].stride == 0) - x->dim[0].stride = 1; - dim = GFC_DESCRIPTOR_RANK (x); for (n = 0; n < dim; n++) @@ -349,9 +343,6 @@ random_seed (GFC_INTEGER_4 *size, gfc_array_i4 *put, gfc_array_i4 *get) if (((put->dim[0].ubound + 1 - put->dim[0].lbound)) < kiss_size) runtime_error ("Array size of PUT is too small."); - if (put->dim[0].stride == 0) - put->dim[0].stride = 1; - /* This code now should do correct strides. */ for (i = 0; i < kiss_size; i++) kiss_seed[i] =(GFC_UINTEGER_4) put->data[i * put->dim[0].stride]; @@ -368,9 +359,6 @@ random_seed (GFC_INTEGER_4 *size, gfc_array_i4 *put, gfc_array_i4 *get) if (((get->dim[0].ubound + 1 - get->dim[0].lbound)) < kiss_size) runtime_error ("Array size of GET is too small."); - if (get->dim[0].stride == 0) - get->dim[0].stride = 1; - /* This code now should do correct strides. */ for (i = 0; i < kiss_size; i++) get->data[i * get->dim[0].stride] = (GFC_INTEGER_4) kiss_seed[i]; |
