libgfortran.h (likely,unlikely): New makros.
2008-09-06 Tobias Burnus <burnus@net-b.de> * libgfortran.h (likely,unlikely): New makros. (runtime_warning_at,__mingw_snprintf): Add __attribute__(format()). * m4/spread.m4 (spread_'rtype_code`): Use unlikely for bounds_check. * m4/iforeach.m4 (name`'rtype_qual`_'atype_code): Ditto. * m4/matmull.m4 (matmul_'rtype_code`): Ditto. * m4/ifunction_logical.m4 (name`'rtype_qual`_'atype_code): Ditto. * m4/ifunction.m4 (name`'rtype_qual`_'atype_code): Ditto. * m4/matmul.m4 (matmul_'rtype_code`): Ditto. * generated/minval_r8.c: Regenerated. * generated/spread_r10.c: Regenerated. * generated/minloc1_16_r16.c: Regenerated. * generated/maxloc1_4_r8.c: Regenerated. * generated/sum_i8.c: Regenerated. * generated/any_l16.c: Regenerated. * generated/spread_i8.c: Regenerated. * generated/maxval_i2.c: Regenerated. * generated/any_l2.c: Regenerated. * generated/product_r4.c: Regenerated. * generated/maxloc1_8_i4.c: Regenerated. * generated/maxloc0_4_r4.c: Regenerated. * generated/all_l1.c: Regenerated. * generated/matmul_r8.c: Regenerated. * generated/product_i2.c: Regenerated. * generated/minloc0_4_r16.c: Regenerated. * generated/minloc0_4_i1.c: Regenerated. * generated/maxloc0_4_r16.c: Regenerated. * generated/maxloc0_4_i2.c: Regenerated. * generated/minloc1_8_r16.c: Regenerated. * generated/maxloc1_8_r16.c: Regenerated. * generated/maxloc0_8_i8.c: Regenerated. * generated/sum_r16.c: Regenerated. * generated/sum_i1.c: Regenerated. * generated/minloc1_4_r8.c: Regenerated. * generated/maxloc1_16_r16.c: Regenerated. * generated/minloc1_16_i4.c: Regenerated. * generated/maxloc1_16_i4.c: Regenerated. * generated/minloc0_16_i8.c: Regenerated. * generated/spread_i1.c: Regenerated. * generated/maxloc0_16_i8.c: Regenerated. * generated/maxval_r16.c: Regenerated. * generated/product_c10.c: Regenerated. * generated/minloc1_8_i4.c: Regenerated. * generated/minloc0_16_i16.c: Regenerated. * generated/matmul_r16.c: Regenerated. * generated/minloc0_4_r4.c: Regenerated. * generated/all_l2.c: Regenerated. * generated/product_c4.c: Regenerated. * generated/sum_r4.c: Regenerated. * generated/minloc0_4_i2.c: Regenerated. * generated/spread_c10.c: Regenerated. * generated/maxloc0_8_i1.c: Regenerated. * generated/spread_r4.c: Regenerated. * generated/minloc0_8_i8.c: Regenerated. * generated/matmul_c8.c: Regenerated. * generated/all_l16.c: Regenerated. * generated/minloc1_16_r10.c: Regenerated. * generated/sum_i2.c: Regenerated. * generated/minloc0_16_i1.c: Regenerated. * generated/maxloc0_16_i1.c: Regenerated. * generated/maxloc1_8_r8.c: Regenerated. * generated/minval_i16.c: Regenerated. * generated/spread_i2.c: Regenerated. * generated/maxval_i4.c: Regenerated. * generated/minval_i8.c: Regenerated. * generated/any_l4.c: Regenerated. * generated/maxloc1_4_i8.c: Regenerated. * generated/maxloc0_16_i16.c: Regenerated. * generated/maxloc0_8_r4.c: Regenerated. * generated/minloc1_4_i16.c: Regenerated. * generated/maxloc1_4_i16.c: Regenerated. * generated/minloc0_4_r10.c: Regenerated. * generated/minloc0_8_i16.c: Regenerated. * generated/maxloc0_4_r10.c: Regenerated. * generated/maxloc0_8_i16.c: Regenerated. * generated/minloc1_8_r10.c: Regenerated. * generated/product_i4.c: Regenerated. * generated/minloc0_16_r4.c: Regenerated. * generated/sum_c16.c: Regenerated. * generated/maxloc1_8_r10.c: Regenerated. * generated/maxloc0_16_r4.c: Regenerated. * generated/minloc1_16_r8.c: Regenerated. * generated/minloc0_8_i1.c: Regenerated. * generated/maxloc0_4_i4.c: Regenerated. * generated/maxloc1_16_r8.c: Regenerated. * generated/maxloc0_8_i2.c: Regenerated. * generated/sum_r10.c: Regenerated. * generated/count_4_l.c: Regenerated. * generated/sum_c4.c: Regenerated. * generated/count_8_l.c: Regenerated. * generated/maxloc1_16_r10.c: Regenerated. * generated/matmul_i8.c: Regenerated. * generated/minloc0_16_i2.c: Regenerated. * generated/minloc1_8_r8.c: Regenerated. * generated/maxloc0_16_i2.c: Regenerated. * generated/spread_c4.c: Regenerated. * generated/matmul_c16.c: Regenerated. * generated/maxval_r10.c: Regenerated. * generated/minval_i1.c: Regenerated. * generated/maxloc1_4_i1.c: Regenerated. * generated/matmul_r10.c: Regenerated. * generated/minloc1_4_i8.c: Regenerated. * generated/minloc0_8_r4.c: Regenerated. * generated/matmul_l4.c: Regenerated. * generated/product_i16.c: Regenerated. * generated/minloc0_16_r16.c: Regenerated. * generated/all_l4.c: Regenerated. * generated/minloc0_4_i4.c: Regenerated. * generated/minloc0_8_i2.c: Regenerated. * generated/matmul_i1.c: Regenerated. * generated/minval_r4.c: Regenerated. * generated/maxloc1_4_r4.c: Regenerated. * generated/spread_i16.c: Regenerated. * generated/sum_i4.c: Regenerated. * generated/maxval_r8.c: Regenerated. * generated/spread_i4.c: Regenerated. * generated/minloc1_4_i1.c: Regenerated. * generated/minval_r16.c: Regenerated. * generated/minval_i2.c: Regenerated. * generated/maxloc1_4_i2.c: Regenerated. * generated/product_r8.c: Regenerated. * generated/maxloc1_8_i8.c: Regenerated. * generated/maxloc0_4_r8.c: Regenerated. * generated/maxloc0_16_r16.c: Regenerated. * generated/matmul_r4.c: Regenerated. * generated/sum_c10.c: Regenerated. * generated/minloc1_4_r16.c: Regenerated. * generated/maxloc1_4_r16.c: Regenerated. * generated/minloc0_8_r16.c: Regenerated. * generated/maxloc0_8_r16.c: Regenerated. * generated/count_1_l.c: Regenerated. * generated/maxloc0_8_i4.c: Regenerated. * generated/matmul_i2.c: Regenerated. * generated/minloc1_4_r4.c: Regenerated. * generated/matmul_c10.c: Regenerated. * generated/minloc0_16_i4.c: Regenerated. * generated/maxloc0_16_i4.c: Regenerated. * generated/minloc1_16_i8.c: Regenerated. * generated/maxloc1_16_i8.c: Regenerated. * generated/minloc1_4_i2.c: Regenerated. * generated/matmul_l16.c: Regenerated. * generated/maxloc1_8_i1.c: Regenerated. * generated/minloc0_16_r10.c: Regenerated. * generated/minloc1_8_i8.c: Regenerated. * generated/minloc0_4_r8.c: Regenerated. * generated/product_r16.c: Regenerated. * generated/product_c8.c: Regenerated. * generated/sum_r8.c: Regenerated. * generated/minloc0_8_i4.c: Regenerated. * generated/matmul_c4.c: Regenerated. * generated/minloc1_16_i16.c: Regenerated. * generated/spread_r8.c: Regenerated. * generated/maxloc1_8_r4.c: Regenerated. * generated/minloc1_16_i1.c: Regenerated. * generated/maxloc1_16_i1.c: Regenerated. * generated/spread_r16.c: Regenerated. * generated/minval_r10.c: Regenerated. * generated/count_16_l.c: Regenerated. * generated/minval_i4.c: Regenerated. * generated/minloc1_8_i1.c: Regenerated. * generated/maxloc1_4_i4.c: Regenerated. * generated/maxloc1_8_i2.c: Regenerated. * generated/maxval_i8.c: Regenerated. * generated/any_l8.c: Regenerated. * generated/maxloc0_16_r10.c: Regenerated. * generated/minloc0_4_i16.c: Regenerated. * generated/maxloc0_8_r8.c: Regenerated. * generated/maxloc0_4_i16.c: Regenerated. * generated/minloc1_4_r10.c: Regenerated. * generated/minloc1_8_i16.c: Regenerated. * generated/maxloc1_4_r10.c: Regenerated. * generated/maxloc1_8_i16.c: Regenerated. * generated/minloc0_8_r10.c: Regenerated. * generated/maxloc0_8_r10.c: Regenerated. * generated/minloc1_16_r4.c: Regenerated. * generated/maxloc1_16_r4.c: Regenerated. * generated/minloc0_16_r8.c: Regenerated. * generated/product_i8.c: Regenerated. * generated/maxloc0_16_r8.c: Regenerated. * generated/sum_i16.c: Regenerated. * generated/count_2_l.c: Regenerated. * generated/maxloc0_4_i8.c: Regenerated. * generated/maxloc1_16_i16.c: Regenerated. * generated/matmul_i4.c: Regenerated. * generated/minloc1_8_r4.c: Regenerated. * generated/sum_c8.c: Regenerated. * generated/minloc1_16_i2.c: Regenerated. * generated/maxloc1_16_i2.c: Regenerated. * generated/maxval_i16.c: Regenerated. * generated/spread_c8.c: Regenerated. * generated/matmul_i16.c: Regenerated. * generated/minloc1_4_i4.c: Regenerated. * generated/maxval_i1.c: Regenerated. * generated/minloc1_8_i2.c: Regenerated. * generated/any_l1.c: Regenerated. * generated/product_c16.c: Regenerated. * generated/minloc0_8_r8.c: Regenerated. * generated/matmul_l8.c: Regenerated. * generated/product_r10.c: Regenerated. * generated/product_i1.c: Regenerated. * generated/all_l8.c: Regenerated. * generated/maxloc0_4_i1.c: Regenerated. * generated/minloc0_4_i8.c: Regenerated. * generated/spread_c16.c: Regenerated. * generated/maxval_r4.c: Regenerated. From-SVN: r140060
This commit is contained in:
Tobias Burnus
Tobias Burnus
parent
cf90009713
commit
9731c4a348
@ -1,3 +1,211 @@
|
||||
2008-09-06 Tobias Burnus <burnus@net-b.de>
|
||||
|
||||
* libgfortran.h (likely,unlikely): New makros.
|
||||
(runtime_warning_at,__mingw_snprintf): Add __attribute__(format()).
|
||||
* m4/spread.m4 (spread_'rtype_code`): Use unlikely for bounds_check.
|
||||
* m4/iforeach.m4 (name`'rtype_qual`_'atype_code): Ditto.
|
||||
* m4/matmull.m4 (matmul_'rtype_code`): Ditto.
|
||||
* m4/ifunction_logical.m4 (name`'rtype_qual`_'atype_code): Ditto.
|
||||
* m4/ifunction.m4 (name`'rtype_qual`_'atype_code): Ditto.
|
||||
* m4/matmul.m4 (matmul_'rtype_code`): Ditto.
|
||||
|
||||
* generated/minval_r8.c: Regenerated.
|
||||
* generated/spread_r10.c: Regenerated.
|
||||
* generated/minloc1_16_r16.c: Regenerated.
|
||||
* generated/maxloc1_4_r8.c: Regenerated.
|
||||
* generated/sum_i8.c: Regenerated.
|
||||
* generated/any_l16.c: Regenerated.
|
||||
* generated/spread_i8.c: Regenerated.
|
||||
* generated/maxval_i2.c: Regenerated.
|
||||
* generated/any_l2.c: Regenerated.
|
||||
* generated/product_r4.c: Regenerated.
|
||||
* generated/maxloc1_8_i4.c: Regenerated.
|
||||
* generated/maxloc0_4_r4.c: Regenerated.
|
||||
* generated/all_l1.c: Regenerated.
|
||||
* generated/matmul_r8.c: Regenerated.
|
||||
* generated/product_i2.c: Regenerated.
|
||||
* generated/minloc0_4_r16.c: Regenerated.
|
||||
* generated/minloc0_4_i1.c: Regenerated.
|
||||
* generated/maxloc0_4_r16.c: Regenerated.
|
||||
* generated/maxloc0_4_i2.c: Regenerated.
|
||||
* generated/minloc1_8_r16.c: Regenerated.
|
||||
* generated/maxloc1_8_r16.c: Regenerated.
|
||||
* generated/maxloc0_8_i8.c: Regenerated.
|
||||
* generated/sum_r16.c: Regenerated.
|
||||
* generated/sum_i1.c: Regenerated.
|
||||
* generated/minloc1_4_r8.c: Regenerated.
|
||||
* generated/maxloc1_16_r16.c: Regenerated.
|
||||
* generated/minloc1_16_i4.c: Regenerated.
|
||||
* generated/maxloc1_16_i4.c: Regenerated.
|
||||
* generated/minloc0_16_i8.c: Regenerated.
|
||||
* generated/spread_i1.c: Regenerated.
|
||||
* generated/maxloc0_16_i8.c: Regenerated.
|
||||
* generated/maxval_r16.c: Regenerated.
|
||||
* generated/product_c10.c: Regenerated.
|
||||
* generated/minloc1_8_i4.c: Regenerated.
|
||||
* generated/minloc0_16_i16.c: Regenerated.
|
||||
* generated/matmul_r16.c: Regenerated.
|
||||
* generated/minloc0_4_r4.c: Regenerated.
|
||||
* generated/all_l2.c: Regenerated.
|
||||
* generated/product_c4.c: Regenerated.
|
||||
* generated/sum_r4.c: Regenerated.
|
||||
* generated/minloc0_4_i2.c: Regenerated.
|
||||
* generated/spread_c10.c: Regenerated.
|
||||
* generated/maxloc0_8_i1.c: Regenerated.
|
||||
* generated/spread_r4.c: Regenerated.
|
||||
* generated/minloc0_8_i8.c: Regenerated.
|
||||
* generated/matmul_c8.c: Regenerated.
|
||||
* generated/all_l16.c: Regenerated.
|
||||
* generated/minloc1_16_r10.c: Regenerated.
|
||||
* generated/sum_i2.c: Regenerated.
|
||||
* generated/minloc0_16_i1.c: Regenerated.
|
||||
* generated/maxloc0_16_i1.c: Regenerated.
|
||||
* generated/maxloc1_8_r8.c: Regenerated.
|
||||
* generated/minval_i16.c: Regenerated.
|
||||
* generated/spread_i2.c: Regenerated.
|
||||
* generated/maxval_i4.c: Regenerated.
|
||||
* generated/minval_i8.c: Regenerated.
|
||||
* generated/any_l4.c: Regenerated.
|
||||
* generated/maxloc1_4_i8.c: Regenerated.
|
||||
* generated/maxloc0_16_i16.c: Regenerated.
|
||||
* generated/maxloc0_8_r4.c: Regenerated.
|
||||
* generated/minloc1_4_i16.c: Regenerated.
|
||||
* generated/maxloc1_4_i16.c: Regenerated.
|
||||
* generated/minloc0_4_r10.c: Regenerated.
|
||||
* generated/minloc0_8_i16.c: Regenerated.
|
||||
* generated/maxloc0_4_r10.c: Regenerated.
|
||||
* generated/maxloc0_8_i16.c: Regenerated.
|
||||
* generated/minloc1_8_r10.c: Regenerated.
|
||||
* generated/product_i4.c: Regenerated.
|
||||
* generated/minloc0_16_r4.c: Regenerated.
|
||||
* generated/sum_c16.c: Regenerated.
|
||||
* generated/maxloc1_8_r10.c: Regenerated.
|
||||
* generated/maxloc0_16_r4.c: Regenerated.
|
||||
* generated/minloc1_16_r8.c: Regenerated.
|
||||
* generated/minloc0_8_i1.c: Regenerated.
|
||||
* generated/maxloc0_4_i4.c: Regenerated.
|
||||
* generated/maxloc1_16_r8.c: Regenerated.
|
||||
* generated/maxloc0_8_i2.c: Regenerated.
|
||||
* generated/sum_r10.c: Regenerated.
|
||||
* generated/count_4_l.c: Regenerated.
|
||||
* generated/sum_c4.c: Regenerated.
|
||||
* generated/count_8_l.c: Regenerated.
|
||||
* generated/maxloc1_16_r10.c: Regenerated.
|
||||
* generated/matmul_i8.c: Regenerated.
|
||||
* generated/minloc0_16_i2.c: Regenerated.
|
||||
* generated/minloc1_8_r8.c: Regenerated.
|
||||
* generated/maxloc0_16_i2.c: Regenerated.
|
||||
* generated/spread_c4.c: Regenerated.
|
||||
* generated/matmul_c16.c: Regenerated.
|
||||
* generated/maxval_r10.c: Regenerated.
|
||||
* generated/minval_i1.c: Regenerated.
|
||||
* generated/maxloc1_4_i1.c: Regenerated.
|
||||
* generated/matmul_r10.c: Regenerated.
|
||||
* generated/minloc1_4_i8.c: Regenerated.
|
||||
* generated/minloc0_8_r4.c: Regenerated.
|
||||
* generated/matmul_l4.c: Regenerated.
|
||||
* generated/product_i16.c: Regenerated.
|
||||
* generated/minloc0_16_r16.c: Regenerated.
|
||||
* generated/all_l4.c: Regenerated.
|
||||
* generated/minloc0_4_i4.c: Regenerated.
|
||||
* generated/minloc0_8_i2.c: Regenerated.
|
||||
* generated/matmul_i1.c: Regenerated.
|
||||
* generated/minval_r4.c: Regenerated.
|
||||
* generated/maxloc1_4_r4.c: Regenerated.
|
||||
* generated/spread_i16.c: Regenerated.
|
||||
* generated/sum_i4.c: Regenerated.
|
||||
* generated/maxval_r8.c: Regenerated.
|
||||
* generated/spread_i4.c: Regenerated.
|
||||
* generated/minloc1_4_i1.c: Regenerated.
|
||||
* generated/minval_r16.c: Regenerated.
|
||||
* generated/minval_i2.c: Regenerated.
|
||||
* generated/maxloc1_4_i2.c: Regenerated.
|
||||
* generated/product_r8.c: Regenerated.
|
||||
* generated/maxloc1_8_i8.c: Regenerated.
|
||||
* generated/maxloc0_4_r8.c: Regenerated.
|
||||
* generated/maxloc0_16_r16.c: Regenerated.
|
||||
* generated/matmul_r4.c: Regenerated.
|
||||
* generated/sum_c10.c: Regenerated.
|
||||
* generated/minloc1_4_r16.c: Regenerated.
|
||||
* generated/maxloc1_4_r16.c: Regenerated.
|
||||
* generated/minloc0_8_r16.c: Regenerated.
|
||||
* generated/maxloc0_8_r16.c: Regenerated.
|
||||
* generated/count_1_l.c: Regenerated.
|
||||
* generated/maxloc0_8_i4.c: Regenerated.
|
||||
* generated/matmul_i2.c: Regenerated.
|
||||
* generated/minloc1_4_r4.c: Regenerated.
|
||||
* generated/matmul_c10.c: Regenerated.
|
||||
* generated/minloc0_16_i4.c: Regenerated.
|
||||
* generated/maxloc0_16_i4.c: Regenerated.
|
||||
* generated/minloc1_16_i8.c: Regenerated.
|
||||
* generated/maxloc1_16_i8.c: Regenerated.
|
||||
* generated/minloc1_4_i2.c: Regenerated.
|
||||
* generated/matmul_l16.c: Regenerated.
|
||||
* generated/maxloc1_8_i1.c: Regenerated.
|
||||
* generated/minloc0_16_r10.c: Regenerated.
|
||||
* generated/minloc1_8_i8.c: Regenerated.
|
||||
* generated/minloc0_4_r8.c: Regenerated.
|
||||
* generated/product_r16.c: Regenerated.
|
||||
* generated/product_c8.c: Regenerated.
|
||||
* generated/sum_r8.c: Regenerated.
|
||||
* generated/minloc0_8_i4.c: Regenerated.
|
||||
* generated/matmul_c4.c: Regenerated.
|
||||
* generated/minloc1_16_i16.c: Regenerated.
|
||||
* generated/spread_r8.c: Regenerated.
|
||||
* generated/maxloc1_8_r4.c: Regenerated.
|
||||
* generated/minloc1_16_i1.c: Regenerated.
|
||||
* generated/maxloc1_16_i1.c: Regenerated.
|
||||
* generated/spread_r16.c: Regenerated.
|
||||
* generated/minval_r10.c: Regenerated.
|
||||
* generated/count_16_l.c: Regenerated.
|
||||
* generated/minval_i4.c: Regenerated.
|
||||
* generated/minloc1_8_i1.c: Regenerated.
|
||||
* generated/maxloc1_4_i4.c: Regenerated.
|
||||
* generated/maxloc1_8_i2.c: Regenerated.
|
||||
* generated/maxval_i8.c: Regenerated.
|
||||
* generated/any_l8.c: Regenerated.
|
||||
* generated/maxloc0_16_r10.c: Regenerated.
|
||||
* generated/minloc0_4_i16.c: Regenerated.
|
||||
* generated/maxloc0_8_r8.c: Regenerated.
|
||||
* generated/maxloc0_4_i16.c: Regenerated.
|
||||
* generated/minloc1_4_r10.c: Regenerated.
|
||||
* generated/minloc1_8_i16.c: Regenerated.
|
||||
* generated/maxloc1_4_r10.c: Regenerated.
|
||||
* generated/maxloc1_8_i16.c: Regenerated.
|
||||
* generated/minloc0_8_r10.c: Regenerated.
|
||||
* generated/maxloc0_8_r10.c: Regenerated.
|
||||
* generated/minloc1_16_r4.c: Regenerated.
|
||||
* generated/maxloc1_16_r4.c: Regenerated.
|
||||
* generated/minloc0_16_r8.c: Regenerated.
|
||||
* generated/product_i8.c: Regenerated.
|
||||
* generated/maxloc0_16_r8.c: Regenerated.
|
||||
* generated/sum_i16.c: Regenerated.
|
||||
* generated/count_2_l.c: Regenerated.
|
||||
* generated/maxloc0_4_i8.c: Regenerated.
|
||||
* generated/maxloc1_16_i16.c: Regenerated.
|
||||
* generated/matmul_i4.c: Regenerated.
|
||||
* generated/minloc1_8_r4.c: Regenerated.
|
||||
* generated/sum_c8.c: Regenerated.
|
||||
* generated/minloc1_16_i2.c: Regenerated.
|
||||
* generated/maxloc1_16_i2.c: Regenerated.
|
||||
* generated/maxval_i16.c: Regenerated.
|
||||
* generated/spread_c8.c: Regenerated.
|
||||
* generated/matmul_i16.c: Regenerated.
|
||||
* generated/minloc1_4_i4.c: Regenerated.
|
||||
* generated/maxval_i1.c: Regenerated.
|
||||
* generated/minloc1_8_i2.c: Regenerated.
|
||||
* generated/any_l1.c: Regenerated.
|
||||
* generated/product_c16.c: Regenerated.
|
||||
* generated/minloc0_8_r8.c: Regenerated.
|
||||
* generated/matmul_l8.c: Regenerated.
|
||||
* generated/product_r10.c: Regenerated.
|
||||
* generated/product_i1.c: Regenerated.
|
||||
* generated/all_l8.c: Regenerated.
|
||||
* generated/maxloc0_4_i1.c: Regenerated.
|
||||
* generated/minloc0_4_i8.c: Regenerated.
|
||||
* generated/spread_c16.c: Regenerated.
|
||||
* generated/maxval_r4.c: Regenerated.
|
||||
|
||||
2008-09-01 Jerry DeLisle <jvdelisle@gcc.gnu.org>
|
||||
|
||||
PR libfortran/37301
|
||||
|
||||
@ -127,7 +127,7 @@ all_l1 (gfc_array_l1 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ all_l16 (gfc_array_l16 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ all_l2 (gfc_array_l2 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ all_l4 (gfc_array_l4 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ all_l8 (gfc_array_l8 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ any_l1 (gfc_array_l1 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ any_l16 (gfc_array_l16 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ any_l2 (gfc_array_l2 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ any_l4 (gfc_array_l4 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ any_l8 (gfc_array_l8 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ count_16_l (gfc_array_i16 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ count_1_l (gfc_array_i1 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ count_2_l (gfc_array_i2 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ count_4_l (gfc_array_i4 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -127,7 +127,7 @@ count_8_l (gfc_array_i8 * const restrict retarray,
|
||||
(long int) GFC_DESCRIPTOR_RANK (retarray),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_c10 (gfc_array_c10 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_COMPLEX_10) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_c16 (gfc_array_c16 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_COMPLEX_16) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_c4 (gfc_array_c4 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_COMPLEX_4) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_c8 (gfc_array_c8 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_COMPLEX_8) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_i1 (gfc_array_i1 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_INTEGER_1) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_i16 (gfc_array_i16 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_INTEGER_16) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_i2 (gfc_array_i2 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_INTEGER_2) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_i4 (gfc_array_i4 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_INTEGER_4) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_i8 (gfc_array_i8 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_INTEGER_8) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -99,7 +99,7 @@ matmul_l16 (gfc_array_l16 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_LOGICAL_16) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -99,7 +99,7 @@ matmul_l4 (gfc_array_l4 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_LOGICAL_4) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -99,7 +99,7 @@ matmul_l8 (gfc_array_l8 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_LOGICAL_8) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_r10 (gfc_array_r10 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_REAL_10) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_r16 (gfc_array_r16 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_REAL_16) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_r4 (gfc_array_r4 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_REAL_4) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -135,7 +135,7 @@ matmul_r8 (gfc_array_r8 * const restrict retarray,
|
||||
= internal_malloc_size (sizeof (GFC_REAL_8) * size0 ((array_t *) retarray));
|
||||
retarray->offset = 0;
|
||||
}
|
||||
else if (compile_options.bounds_check)
|
||||
else if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
index_type ret_extent, arg_extent;
|
||||
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ maxloc0_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mmaxloc0_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ smaxloc0_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -124,7 +124,7 @@ maxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -318,7 +318,7 @@ mmaxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -508,7 +508,7 @@ smaxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -123,7 +123,7 @@ maxval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -312,7 +312,7 @@ mmaxval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
if (rank != GFC_DESCRIPTOR_RANK (retarray))
|
||||
runtime_error ("rank of return array incorrect in MAXVAL intrinsic");
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
@ -497,7 +497,7 @@ smaxval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
(long int) (GFC_DESCRIPTOR_RANK (retarray)),
|
||||
(long int) rank);
|
||||
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
for (n=0; n < rank; n++)
|
||||
{
|
||||
|
||||
@ -69,7 +69,7 @@ minloc0_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mminloc0_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ sminloc0_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ minloc0_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mminloc0_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ sminloc0_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ minloc0_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mminloc0_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ sminloc0_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ minloc0_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mminloc0_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ sminloc0_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
@ -69,7 +69,7 @@ minloc0_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
@ -193,7 +193,7 @@ mminloc0_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank, mask_rank;
|
||||
index_type ret_extent;
|
||||
@ -353,7 +353,7 @@ sminloc0_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
}
|
||||
else
|
||||
{
|
||||
if (compile_options.bounds_check)
|
||||
if (unlikely (compile_options.bounds_check))
|
||||
{
|
||||
int ret_rank;
|
||||
index_type ret_extent;
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue
Block a user