This file is indexed.

/usr/share/doc/gcc-4.4-base/fortran/gfortran.html is in gfortran-4.4-doc 4.4.7-8ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

    1
    2
    3
    4
    5
    6
    7
    8
    9
   10
   11
   12
   13
   14
   15
   16
   17
   18
   19
   20
   21
   22
   23
   24
   25
   26
   27
   28
   29
   30
   31
   32
   33
   34
   35
   36
   37
   38
   39
   40
   41
   42
   43
   44
   45
   46
   47
   48
   49
   50
   51
   52
   53
   54
   55
   56
   57
   58
   59
   60
   61
   62
   63
   64
   65
   66
   67
   68
   69
   70
   71
   72
   73
   74
   75
   76
   77
   78
   79
   80
   81
   82
   83
   84
   85
   86
   87
   88
   89
   90
   91
   92
   93
   94
   95
   96
   97
   98
   99
  100
  101
  102
  103
  104
  105
  106
  107
  108
  109
  110
  111
  112
  113
  114
  115
  116
  117
  118
  119
  120
  121
  122
  123
  124
  125
  126
  127
  128
  129
  130
  131
  132
  133
  134
  135
  136
  137
  138
  139
  140
  141
  142
  143
  144
  145
  146
  147
  148
  149
  150
  151
  152
  153
  154
  155
  156
  157
  158
  159
  160
  161
  162
  163
  164
  165
  166
  167
  168
  169
  170
  171
  172
  173
  174
  175
  176
  177
  178
  179
  180
  181
  182
  183
  184
  185
  186
  187
  188
  189
  190
  191
  192
  193
  194
  195
  196
  197
  198
  199
  200
  201
  202
  203
  204
  205
  206
  207
  208
  209
  210
  211
  212
  213
  214
  215
  216
  217
  218
  219
  220
  221
  222
  223
  224
  225
  226
  227
  228
  229
  230
  231
  232
  233
  234
  235
  236
  237
  238
  239
  240
  241
  242
  243
  244
  245
  246
  247
  248
  249
  250
  251
  252
  253
  254
  255
  256
  257
  258
  259
  260
  261
  262
  263
  264
  265
  266
  267
  268
  269
  270
  271
  272
  273
  274
  275
  276
  277
  278
  279
  280
  281
  282
  283
  284
  285
  286
  287
  288
  289
  290
  291
  292
  293
  294
  295
  296
  297
  298
  299
  300
  301
  302
  303
  304
  305
  306
  307
  308
  309
  310
  311
  312
  313
  314
  315
  316
  317
  318
  319
  320
  321
  322
  323
  324
  325
  326
  327
  328
  329
  330
  331
  332
  333
  334
  335
  336
  337
  338
  339
  340
  341
  342
  343
  344
  345
  346
  347
  348
  349
  350
  351
  352
  353
  354
  355
  356
  357
  358
  359
  360
  361
  362
  363
  364
  365
  366
  367
  368
  369
  370
  371
  372
  373
  374
  375
  376
  377
  378
  379
  380
  381
  382
  383
  384
  385
  386
  387
  388
  389
  390
  391
  392
  393
  394
  395
  396
  397
  398
  399
  400
  401
  402
  403
  404
  405
  406
  407
  408
  409
  410
  411
  412
  413
  414
  415
  416
  417
  418
  419
  420
  421
  422
  423
  424
  425
  426
  427
  428
  429
  430
  431
  432
  433
  434
  435
  436
  437
  438
  439
  440
  441
  442
  443
  444
  445
  446
  447
  448
  449
  450
  451
  452
  453
  454
  455
  456
  457
  458
  459
  460
  461
  462
  463
  464
  465
  466
  467
  468
  469
  470
  471
  472
  473
  474
  475
  476
  477
  478
  479
  480
  481
  482
  483
  484
  485
  486
  487
  488
  489
  490
  491
  492
  493
  494
  495
  496
  497
  498
  499
  500
  501
  502
  503
  504
  505
  506
  507
  508
  509
  510
  511
  512
  513
  514
  515
  516
  517
  518
  519
  520
  521
  522
  523
  524
  525
  526
  527
  528
  529
  530
  531
  532
  533
  534
  535
  536
  537
  538
  539
  540
  541
  542
  543
  544
  545
  546
  547
  548
  549
  550
  551
  552
  553
  554
  555
  556
  557
  558
  559
  560
  561
  562
  563
  564
  565
  566
  567
  568
  569
  570
  571
  572
  573
  574
  575
  576
  577
  578
  579
  580
  581
  582
  583
  584
  585
  586
  587
  588
  589
  590
  591
  592
  593
  594
  595
  596
  597
  598
  599
  600
  601
  602
  603
  604
  605
  606
  607
  608
  609
  610
  611
  612
  613
  614
  615
  616
  617
  618
  619
  620
  621
  622
  623
  624
  625
  626
  627
  628
  629
  630
  631
  632
  633
  634
  635
  636
  637
  638
  639
  640
  641
  642
  643
  644
  645
  646
  647
  648
  649
  650
  651
  652
  653
  654
  655
  656
  657
  658
  659
  660
  661
  662
  663
  664
  665
  666
  667
  668
  669
  670
  671
  672
  673
  674
  675
  676
  677
  678
  679
  680
  681
  682
  683
  684
  685
  686
  687
  688
  689
  690
  691
  692
  693
  694
  695
  696
  697
  698
  699
  700
  701
  702
  703
  704
  705
  706
  707
  708
  709
  710
  711
  712
  713
  714
  715
  716
  717
  718
  719
  720
  721
  722
  723
  724
  725
  726
  727
  728
  729
  730
  731
  732
  733
  734
  735
  736
  737
  738
  739
  740
  741
  742
  743
  744
  745
  746
  747
  748
  749
  750
  751
  752
  753
  754
  755
  756
  757
  758
  759
  760
  761
  762
  763
  764
  765
  766
  767
  768
  769
  770
  771
  772
  773
  774
  775
  776
  777
  778
  779
  780
  781
  782
  783
  784
  785
  786
  787
  788
  789
  790
  791
  792
  793
  794
  795
  796
  797
  798
  799
  800
  801
  802
  803
  804
  805
  806
  807
  808
  809
  810
  811
  812
  813
  814
  815
  816
  817
  818
  819
  820
  821
  822
  823
  824
  825
  826
  827
  828
  829
  830
  831
  832
  833
  834
  835
  836
  837
  838
  839
  840
  841
  842
  843
  844
  845
  846
  847
  848
  849
  850
  851
  852
  853
  854
  855
  856
  857
  858
  859
  860
  861
  862
  863
  864
  865
  866
  867
  868
  869
  870
  871
  872
  873
  874
  875
  876
  877
  878
  879
  880
  881
  882
  883
  884
  885
  886
  887
  888
  889
  890
  891
  892
  893
  894
  895
  896
  897
  898
  899
  900
  901
  902
  903
  904
  905
  906
  907
  908
  909
  910
  911
  912
  913
  914
  915
  916
  917
  918
  919
  920
  921
  922
  923
  924
  925
  926
  927
  928
  929
  930
  931
  932
  933
  934
  935
  936
  937
  938
  939
  940
  941
  942
  943
  944
  945
  946
  947
  948
  949
  950
  951
  952
  953
  954
  955
  956
  957
  958
  959
  960
  961
  962
  963
  964
  965
  966
  967
  968
  969
  970
  971
  972
  973
  974
  975
  976
  977
  978
  979
  980
  981
  982
  983
  984
  985
  986
  987
  988
  989
  990
  991
  992
  993
  994
  995
  996
  997
  998
  999
 1000
 1001
 1002
 1003
 1004
 1005
 1006
 1007
 1008
 1009
 1010
 1011
 1012
 1013
 1014
 1015
 1016
 1017
 1018
 1019
 1020
 1021
 1022
 1023
 1024
 1025
 1026
 1027
 1028
 1029
 1030
 1031
 1032
 1033
 1034
 1035
 1036
 1037
 1038
 1039
 1040
 1041
 1042
 1043
 1044
 1045
 1046
 1047
 1048
 1049
 1050
 1051
 1052
 1053
 1054
 1055
 1056
 1057
 1058
 1059
 1060
 1061
 1062
 1063
 1064
 1065
 1066
 1067
 1068
 1069
 1070
 1071
 1072
 1073
 1074
 1075
 1076
 1077
 1078
 1079
 1080
 1081
 1082
 1083
 1084
 1085
 1086
 1087
 1088
 1089
 1090
 1091
 1092
 1093
 1094
 1095
 1096
 1097
 1098
 1099
 1100
 1101
 1102
 1103
 1104
 1105
 1106
 1107
 1108
 1109
 1110
 1111
 1112
 1113
 1114
 1115
 1116
 1117
 1118
 1119
 1120
 1121
 1122
 1123
 1124
 1125
 1126
 1127
 1128
 1129
 1130
 1131
 1132
 1133
 1134
 1135
 1136
 1137
 1138
 1139
 1140
 1141
 1142
 1143
 1144
 1145
 1146
 1147
 1148
 1149
 1150
 1151
 1152
 1153
 1154
 1155
 1156
 1157
 1158
 1159
 1160
 1161
 1162
 1163
 1164
 1165
 1166
 1167
 1168
 1169
 1170
 1171
 1172
 1173
 1174
 1175
 1176
 1177
 1178
 1179
 1180
 1181
 1182
 1183
 1184
 1185
 1186
 1187
 1188
 1189
 1190
 1191
 1192
 1193
 1194
 1195
 1196
 1197
 1198
 1199
 1200
 1201
 1202
 1203
 1204
 1205
 1206
 1207
 1208
 1209
 1210
 1211
 1212
 1213
 1214
 1215
 1216
 1217
 1218
 1219
 1220
 1221
 1222
 1223
 1224
 1225
 1226
 1227
 1228
 1229
 1230
 1231
 1232
 1233
 1234
 1235
 1236
 1237
 1238
 1239
 1240
 1241
 1242
 1243
 1244
 1245
 1246
 1247
 1248
 1249
 1250
 1251
 1252
 1253
 1254
 1255
 1256
 1257
 1258
 1259
 1260
 1261
 1262
 1263
 1264
 1265
 1266
 1267
 1268
 1269
 1270
 1271
 1272
 1273
 1274
 1275
 1276
 1277
 1278
 1279
 1280
 1281
 1282
 1283
 1284
 1285
 1286
 1287
 1288
 1289
 1290
 1291
 1292
 1293
 1294
 1295
 1296
 1297
 1298
 1299
 1300
 1301
 1302
 1303
 1304
 1305
 1306
 1307
 1308
 1309
 1310
 1311
 1312
 1313
 1314
 1315
 1316
 1317
 1318
 1319
 1320
 1321
 1322
 1323
 1324
 1325
 1326
 1327
 1328
 1329
 1330
 1331
 1332
 1333
 1334
 1335
 1336
 1337
 1338
 1339
 1340
 1341
 1342
 1343
 1344
 1345
 1346
 1347
 1348
 1349
 1350
 1351
 1352
 1353
 1354
 1355
 1356
 1357
 1358
 1359
 1360
 1361
 1362
 1363
 1364
 1365
 1366
 1367
 1368
 1369
 1370
 1371
 1372
 1373
 1374
 1375
 1376
 1377
 1378
 1379
 1380
 1381
 1382
 1383
 1384
 1385
 1386
 1387
 1388
 1389
 1390
 1391
 1392
 1393
 1394
 1395
 1396
 1397
 1398
 1399
 1400
 1401
 1402
 1403
 1404
 1405
 1406
 1407
 1408
 1409
 1410
 1411
 1412
 1413
 1414
 1415
 1416
 1417
 1418
 1419
 1420
 1421
 1422
 1423
 1424
 1425
 1426
 1427
 1428
 1429
 1430
 1431
 1432
 1433
 1434
 1435
 1436
 1437
 1438
 1439
 1440
 1441
 1442
 1443
 1444
 1445
 1446
 1447
 1448
 1449
 1450
 1451
 1452
 1453
 1454
 1455
 1456
 1457
 1458
 1459
 1460
 1461
 1462
 1463
 1464
 1465
 1466
 1467
 1468
 1469
 1470
 1471
 1472
 1473
 1474
 1475
 1476
 1477
 1478
 1479
 1480
 1481
 1482
 1483
 1484
 1485
 1486
 1487
 1488
 1489
 1490
 1491
 1492
 1493
 1494
 1495
 1496
 1497
 1498
 1499
 1500
 1501
 1502
 1503
 1504
 1505
 1506
 1507
 1508
 1509
 1510
 1511
 1512
 1513
 1514
 1515
 1516
 1517
 1518
 1519
 1520
 1521
 1522
 1523
 1524
 1525
 1526
 1527
 1528
 1529
 1530
 1531
 1532
 1533
 1534
 1535
 1536
 1537
 1538
 1539
 1540
 1541
 1542
 1543
 1544
 1545
 1546
 1547
 1548
 1549
 1550
 1551
 1552
 1553
 1554
 1555
 1556
 1557
 1558
 1559
 1560
 1561
 1562
 1563
 1564
 1565
 1566
 1567
 1568
 1569
 1570
 1571
 1572
 1573
 1574
 1575
 1576
 1577
 1578
 1579
 1580
 1581
 1582
 1583
 1584
 1585
 1586
 1587
 1588
 1589
 1590
 1591
 1592
 1593
 1594
 1595
 1596
 1597
 1598
 1599
 1600
 1601
 1602
 1603
 1604
 1605
 1606
 1607
 1608
 1609
 1610
 1611
 1612
 1613
 1614
 1615
 1616
 1617
 1618
 1619
 1620
 1621
 1622
 1623
 1624
 1625
 1626
 1627
 1628
 1629
 1630
 1631
 1632
 1633
 1634
 1635
 1636
 1637
 1638
 1639
 1640
 1641
 1642
 1643
 1644
 1645
 1646
 1647
 1648
 1649
 1650
 1651
 1652
 1653
 1654
 1655
 1656
 1657
 1658
 1659
 1660
 1661
 1662
 1663
 1664
 1665
 1666
 1667
 1668
 1669
 1670
 1671
 1672
 1673
 1674
 1675
 1676
 1677
 1678
 1679
 1680
 1681
 1682
 1683
 1684
 1685
 1686
 1687
 1688
 1689
 1690
 1691
 1692
 1693
 1694
 1695
 1696
 1697
 1698
 1699
 1700
 1701
 1702
 1703
 1704
 1705
 1706
 1707
 1708
 1709
 1710
 1711
 1712
 1713
 1714
 1715
 1716
 1717
 1718
 1719
 1720
 1721
 1722
 1723
 1724
 1725
 1726
 1727
 1728
 1729
 1730
 1731
 1732
 1733
 1734
 1735
 1736
 1737
 1738
 1739
 1740
 1741
 1742
 1743
 1744
 1745
 1746
 1747
 1748
 1749
 1750
 1751
 1752
 1753
 1754
 1755
 1756
 1757
 1758
 1759
 1760
 1761
 1762
 1763
 1764
 1765
 1766
 1767
 1768
 1769
 1770
 1771
 1772
 1773
 1774
 1775
 1776
 1777
 1778
 1779
 1780
 1781
 1782
 1783
 1784
 1785
 1786
 1787
 1788
 1789
 1790
 1791
 1792
 1793
 1794
 1795
 1796
 1797
 1798
 1799
 1800
 1801
 1802
 1803
 1804
 1805
 1806
 1807
 1808
 1809
 1810
 1811
 1812
 1813
 1814
 1815
 1816
 1817
 1818
 1819
 1820
 1821
 1822
 1823
 1824
 1825
 1826
 1827
 1828
 1829
 1830
 1831
 1832
 1833
 1834
 1835
 1836
 1837
 1838
 1839
 1840
 1841
 1842
 1843
 1844
 1845
 1846
 1847
 1848
 1849
 1850
 1851
 1852
 1853
 1854
 1855
 1856
 1857
 1858
 1859
 1860
 1861
 1862
 1863
 1864
 1865
 1866
 1867
 1868
 1869
 1870
 1871
 1872
 1873
 1874
 1875
 1876
 1877
 1878
 1879
 1880
 1881
 1882
 1883
 1884
 1885
 1886
 1887
 1888
 1889
 1890
 1891
 1892
 1893
 1894
 1895
 1896
 1897
 1898
 1899
 1900
 1901
 1902
 1903
 1904
 1905
 1906
 1907
 1908
 1909
 1910
 1911
 1912
 1913
 1914
 1915
 1916
 1917
 1918
 1919
 1920
 1921
 1922
 1923
 1924
 1925
 1926
 1927
 1928
 1929
 1930
 1931
 1932
 1933
 1934
 1935
 1936
 1937
 1938
 1939
 1940
 1941
 1942
 1943
 1944
 1945
 1946
 1947
 1948
 1949
 1950
 1951
 1952
 1953
 1954
 1955
 1956
 1957
 1958
 1959
 1960
 1961
 1962
 1963
 1964
 1965
 1966
 1967
 1968
 1969
 1970
 1971
 1972
 1973
 1974
 1975
 1976
 1977
 1978
 1979
 1980
 1981
 1982
 1983
 1984
 1985
 1986
 1987
 1988
 1989
 1990
 1991
 1992
 1993
 1994
 1995
 1996
 1997
 1998
 1999
 2000
 2001
 2002
 2003
 2004
 2005
 2006
 2007
 2008
 2009
 2010
 2011
 2012
 2013
 2014
 2015
 2016
 2017
 2018
 2019
 2020
 2021
 2022
 2023
 2024
 2025
 2026
 2027
 2028
 2029
 2030
 2031
 2032
 2033
 2034
 2035
 2036
 2037
 2038
 2039
 2040
 2041
 2042
 2043
 2044
 2045
 2046
 2047
 2048
 2049
 2050
 2051
 2052
 2053
 2054
 2055
 2056
 2057
 2058
 2059
 2060
 2061
 2062
 2063
 2064
 2065
 2066
 2067
 2068
 2069
 2070
 2071
 2072
 2073
 2074
 2075
 2076
 2077
 2078
 2079
 2080
 2081
 2082
 2083
 2084
 2085
 2086
 2087
 2088
 2089
 2090
 2091
 2092
 2093
 2094
 2095
 2096
 2097
 2098
 2099
 2100
 2101
 2102
 2103
 2104
 2105
 2106
 2107
 2108
 2109
 2110
 2111
 2112
 2113
 2114
 2115
 2116
 2117
 2118
 2119
 2120
 2121
 2122
 2123
 2124
 2125
 2126
 2127
 2128
 2129
 2130
 2131
 2132
 2133
 2134
 2135
 2136
 2137
 2138
 2139
 2140
 2141
 2142
 2143
 2144
 2145
 2146
 2147
 2148
 2149
 2150
 2151
 2152
 2153
 2154
 2155
 2156
 2157
 2158
 2159
 2160
 2161
 2162
 2163
 2164
 2165
 2166
 2167
 2168
 2169
 2170
 2171
 2172
 2173
 2174
 2175
 2176
 2177
 2178
 2179
 2180
 2181
 2182
 2183
 2184
 2185
 2186
 2187
 2188
 2189
 2190
 2191
 2192
 2193
 2194
 2195
 2196
 2197
 2198
 2199
 2200
 2201
 2202
 2203
 2204
 2205
 2206
 2207
 2208
 2209
 2210
 2211
 2212
 2213
 2214
 2215
 2216
 2217
 2218
 2219
 2220
 2221
 2222
 2223
 2224
 2225
 2226
 2227
 2228
 2229
 2230
 2231
 2232
 2233
 2234
 2235
 2236
 2237
 2238
 2239
 2240
 2241
 2242
 2243
 2244
 2245
 2246
 2247
 2248
 2249
 2250
 2251
 2252
 2253
 2254
 2255
 2256
 2257
 2258
 2259
 2260
 2261
 2262
 2263
 2264
 2265
 2266
 2267
 2268
 2269
 2270
 2271
 2272
 2273
 2274
 2275
 2276
 2277
 2278
 2279
 2280
 2281
 2282
 2283
 2284
 2285
 2286
 2287
 2288
 2289
 2290
 2291
 2292
 2293
 2294
 2295
 2296
 2297
 2298
 2299
 2300
 2301
 2302
 2303
 2304
 2305
 2306
 2307
 2308
 2309
 2310
 2311
 2312
 2313
 2314
 2315
 2316
 2317
 2318
 2319
 2320
 2321
 2322
 2323
 2324
 2325
 2326
 2327
 2328
 2329
 2330
 2331
 2332
 2333
 2334
 2335
 2336
 2337
 2338
 2339
 2340
 2341
 2342
 2343
 2344
 2345
 2346
 2347
 2348
 2349
 2350
 2351
 2352
 2353
 2354
 2355
 2356
 2357
 2358
 2359
 2360
 2361
 2362
 2363
 2364
 2365
 2366
 2367
 2368
 2369
 2370
 2371
 2372
 2373
 2374
 2375
 2376
 2377
 2378
 2379
 2380
 2381
 2382
 2383
 2384
 2385
 2386
 2387
 2388
 2389
 2390
 2391
 2392
 2393
 2394
 2395
 2396
 2397
 2398
 2399
 2400
 2401
 2402
 2403
 2404
 2405
 2406
 2407
 2408
 2409
 2410
 2411
 2412
 2413
 2414
 2415
 2416
 2417
 2418
 2419
 2420
 2421
 2422
 2423
 2424
 2425
 2426
 2427
 2428
 2429
 2430
 2431
 2432
 2433
 2434
 2435
 2436
 2437
 2438
 2439
 2440
 2441
 2442
 2443
 2444
 2445
 2446
 2447
 2448
 2449
 2450
 2451
 2452
 2453
 2454
 2455
 2456
 2457
 2458
 2459
 2460
 2461
 2462
 2463
 2464
 2465
 2466
 2467
 2468
 2469
 2470
 2471
 2472
 2473
 2474
 2475
 2476
 2477
 2478
 2479
 2480
 2481
 2482
 2483
 2484
 2485
 2486
 2487
 2488
 2489
 2490
 2491
 2492
 2493
 2494
 2495
 2496
 2497
 2498
 2499
 2500
 2501
 2502
 2503
 2504
 2505
 2506
 2507
 2508
 2509
 2510
 2511
 2512
 2513
 2514
 2515
 2516
 2517
 2518
 2519
 2520
 2521
 2522
 2523
 2524
 2525
 2526
 2527
 2528
 2529
 2530
 2531
 2532
 2533
 2534
 2535
 2536
 2537
 2538
 2539
 2540
 2541
 2542
 2543
 2544
 2545
 2546
 2547
 2548
 2549
 2550
 2551
 2552
 2553
 2554
 2555
 2556
 2557
 2558
 2559
 2560
 2561
 2562
 2563
 2564
 2565
 2566
 2567
 2568
 2569
 2570
 2571
 2572
 2573
 2574
 2575
 2576
 2577
 2578
 2579
 2580
 2581
 2582
 2583
 2584
 2585
 2586
 2587
 2588
 2589
 2590
 2591
 2592
 2593
 2594
 2595
 2596
 2597
 2598
 2599
 2600
 2601
 2602
 2603
 2604
 2605
 2606
 2607
 2608
 2609
 2610
 2611
 2612
 2613
 2614
 2615
 2616
 2617
 2618
 2619
 2620
 2621
 2622
 2623
 2624
 2625
 2626
 2627
 2628
 2629
 2630
 2631
 2632
 2633
 2634
 2635
 2636
 2637
 2638
 2639
 2640
 2641
 2642
 2643
 2644
 2645
 2646
 2647
 2648
 2649
 2650
 2651
 2652
 2653
 2654
 2655
 2656
 2657
 2658
 2659
 2660
 2661
 2662
 2663
 2664
 2665
 2666
 2667
 2668
 2669
 2670
 2671
 2672
 2673
 2674
 2675
 2676
 2677
 2678
 2679
 2680
 2681
 2682
 2683
 2684
 2685
 2686
 2687
 2688
 2689
 2690
 2691
 2692
 2693
 2694
 2695
 2696
 2697
 2698
 2699
 2700
 2701
 2702
 2703
 2704
 2705
 2706
 2707
 2708
 2709
 2710
 2711
 2712
 2713
 2714
 2715
 2716
 2717
 2718
 2719
 2720
 2721
 2722
 2723
 2724
 2725
 2726
 2727
 2728
 2729
 2730
 2731
 2732
 2733
 2734
 2735
 2736
 2737
 2738
 2739
 2740
 2741
 2742
 2743
 2744
 2745
 2746
 2747
 2748
 2749
 2750
 2751
 2752
 2753
 2754
 2755
 2756
 2757
 2758
 2759
 2760
 2761
 2762
 2763
 2764
 2765
 2766
 2767
 2768
 2769
 2770
 2771
 2772
 2773
 2774
 2775
 2776
 2777
 2778
 2779
 2780
 2781
 2782
 2783
 2784
 2785
 2786
 2787
 2788
 2789
 2790
 2791
 2792
 2793
 2794
 2795
 2796
 2797
 2798
 2799
 2800
 2801
 2802
 2803
 2804
 2805
 2806
 2807
 2808
 2809
 2810
 2811
 2812
 2813
 2814
 2815
 2816
 2817
 2818
 2819
 2820
 2821
 2822
 2823
 2824
 2825
 2826
 2827
 2828
 2829
 2830
 2831
 2832
 2833
 2834
 2835
 2836
 2837
 2838
 2839
 2840
 2841
 2842
 2843
 2844
 2845
 2846
 2847
 2848
 2849
 2850
 2851
 2852
 2853
 2854
 2855
 2856
 2857
 2858
 2859
 2860
 2861
 2862
 2863
 2864
 2865
 2866
 2867
 2868
 2869
 2870
 2871
 2872
 2873
 2874
 2875
 2876
 2877
 2878
 2879
 2880
 2881
 2882
 2883
 2884
 2885
 2886
 2887
 2888
 2889
 2890
 2891
 2892
 2893
 2894
 2895
 2896
 2897
 2898
 2899
 2900
 2901
 2902
 2903
 2904
 2905
 2906
 2907
 2908
 2909
 2910
 2911
 2912
 2913
 2914
 2915
 2916
 2917
 2918
 2919
 2920
 2921
 2922
 2923
 2924
 2925
 2926
 2927
 2928
 2929
 2930
 2931
 2932
 2933
 2934
 2935
 2936
 2937
 2938
 2939
 2940
 2941
 2942
 2943
 2944
 2945
 2946
 2947
 2948
 2949
 2950
 2951
 2952
 2953
 2954
 2955
 2956
 2957
 2958
 2959
 2960
 2961
 2962
 2963
 2964
 2965
 2966
 2967
 2968
 2969
 2970
 2971
 2972
 2973
 2974
 2975
 2976
 2977
 2978
 2979
 2980
 2981
 2982
 2983
 2984
 2985
 2986
 2987
 2988
 2989
 2990
 2991
 2992
 2993
 2994
 2995
 2996
 2997
 2998
 2999
 3000
 3001
 3002
 3003
 3004
 3005
 3006
 3007
 3008
 3009
 3010
 3011
 3012
 3013
 3014
 3015
 3016
 3017
 3018
 3019
 3020
 3021
 3022
 3023
 3024
 3025
 3026
 3027
 3028
 3029
 3030
 3031
 3032
 3033
 3034
 3035
 3036
 3037
 3038
 3039
 3040
 3041
 3042
 3043
 3044
 3045
 3046
 3047
 3048
 3049
 3050
 3051
 3052
 3053
 3054
 3055
 3056
 3057
 3058
 3059
 3060
 3061
 3062
 3063
 3064
 3065
 3066
 3067
 3068
 3069
 3070
 3071
 3072
 3073
 3074
 3075
 3076
 3077
 3078
 3079
 3080
 3081
 3082
 3083
 3084
 3085
 3086
 3087
 3088
 3089
 3090
 3091
 3092
 3093
 3094
 3095
 3096
 3097
 3098
 3099
 3100
 3101
 3102
 3103
 3104
 3105
 3106
 3107
 3108
 3109
 3110
 3111
 3112
 3113
 3114
 3115
 3116
 3117
 3118
 3119
 3120
 3121
 3122
 3123
 3124
 3125
 3126
 3127
 3128
 3129
 3130
 3131
 3132
 3133
 3134
 3135
 3136
 3137
 3138
 3139
 3140
 3141
 3142
 3143
 3144
 3145
 3146
 3147
 3148
 3149
 3150
 3151
 3152
 3153
 3154
 3155
 3156
 3157
 3158
 3159
 3160
 3161
 3162
 3163
 3164
 3165
 3166
 3167
 3168
 3169
 3170
 3171
 3172
 3173
 3174
 3175
 3176
 3177
 3178
 3179
 3180
 3181
 3182
 3183
 3184
 3185
 3186
 3187
 3188
 3189
 3190
 3191
 3192
 3193
 3194
 3195
 3196
 3197
 3198
 3199
 3200
 3201
 3202
 3203
 3204
 3205
 3206
 3207
 3208
 3209
 3210
 3211
 3212
 3213
 3214
 3215
 3216
 3217
 3218
 3219
 3220
 3221
 3222
 3223
 3224
 3225
 3226
 3227
 3228
 3229
 3230
 3231
 3232
 3233
 3234
 3235
 3236
 3237
 3238
 3239
 3240
 3241
 3242
 3243
 3244
 3245
 3246
 3247
 3248
 3249
 3250
 3251
 3252
 3253
 3254
 3255
 3256
 3257
 3258
 3259
 3260
 3261
 3262
 3263
 3264
 3265
 3266
 3267
 3268
 3269
 3270
 3271
 3272
 3273
 3274
 3275
 3276
 3277
 3278
 3279
 3280
 3281
 3282
 3283
 3284
 3285
 3286
 3287
 3288
 3289
 3290
 3291
 3292
 3293
 3294
 3295
 3296
 3297
 3298
 3299
 3300
 3301
 3302
 3303
 3304
 3305
 3306
 3307
 3308
 3309
 3310
 3311
 3312
 3313
 3314
 3315
 3316
 3317
 3318
 3319
 3320
 3321
 3322
 3323
 3324
 3325
 3326
 3327
 3328
 3329
 3330
 3331
 3332
 3333
 3334
 3335
 3336
 3337
 3338
 3339
 3340
 3341
 3342
 3343
 3344
 3345
 3346
 3347
 3348
 3349
 3350
 3351
 3352
 3353
 3354
 3355
 3356
 3357
 3358
 3359
 3360
 3361
 3362
 3363
 3364
 3365
 3366
 3367
 3368
 3369
 3370
 3371
 3372
 3373
 3374
 3375
 3376
 3377
 3378
 3379
 3380
 3381
 3382
 3383
 3384
 3385
 3386
 3387
 3388
 3389
 3390
 3391
 3392
 3393
 3394
 3395
 3396
 3397
 3398
 3399
 3400
 3401
 3402
 3403
 3404
 3405
 3406
 3407
 3408
 3409
 3410
 3411
 3412
 3413
 3414
 3415
 3416
 3417
 3418
 3419
 3420
 3421
 3422
 3423
 3424
 3425
 3426
 3427
 3428
 3429
 3430
 3431
 3432
 3433
 3434
 3435
 3436
 3437
 3438
 3439
 3440
 3441
 3442
 3443
 3444
 3445
 3446
 3447
 3448
 3449
 3450
 3451
 3452
 3453
 3454
 3455
 3456
 3457
 3458
 3459
 3460
 3461
 3462
 3463
 3464
 3465
 3466
 3467
 3468
 3469
 3470
 3471
 3472
 3473
 3474
 3475
 3476
 3477
 3478
 3479
 3480
 3481
 3482
 3483
 3484
 3485
 3486
 3487
 3488
 3489
 3490
 3491
 3492
 3493
 3494
 3495
 3496
 3497
 3498
 3499
 3500
 3501
 3502
 3503
 3504
 3505
 3506
 3507
 3508
 3509
 3510
 3511
 3512
 3513
 3514
 3515
 3516
 3517
 3518
 3519
 3520
 3521
 3522
 3523
 3524
 3525
 3526
 3527
 3528
 3529
 3530
 3531
 3532
 3533
 3534
 3535
 3536
 3537
 3538
 3539
 3540
 3541
 3542
 3543
 3544
 3545
 3546
 3547
 3548
 3549
 3550
 3551
 3552
 3553
 3554
 3555
 3556
 3557
 3558
 3559
 3560
 3561
 3562
 3563
 3564
 3565
 3566
 3567
 3568
 3569
 3570
 3571
 3572
 3573
 3574
 3575
 3576
 3577
 3578
 3579
 3580
 3581
 3582
 3583
 3584
 3585
 3586
 3587
 3588
 3589
 3590
 3591
 3592
 3593
 3594
 3595
 3596
 3597
 3598
 3599
 3600
 3601
 3602
 3603
 3604
 3605
 3606
 3607
 3608
 3609
 3610
 3611
 3612
 3613
 3614
 3615
 3616
 3617
 3618
 3619
 3620
 3621
 3622
 3623
 3624
 3625
 3626
 3627
 3628
 3629
 3630
 3631
 3632
 3633
 3634
 3635
 3636
 3637
 3638
 3639
 3640
 3641
 3642
 3643
 3644
 3645
 3646
 3647
 3648
 3649
 3650
 3651
 3652
 3653
 3654
 3655
 3656
 3657
 3658
 3659
 3660
 3661
 3662
 3663
 3664
 3665
 3666
 3667
 3668
 3669
 3670
 3671
 3672
 3673
 3674
 3675
 3676
 3677
 3678
 3679
 3680
 3681
 3682
 3683
 3684
 3685
 3686
 3687
 3688
 3689
 3690
 3691
 3692
 3693
 3694
 3695
 3696
 3697
 3698
 3699
 3700
 3701
 3702
 3703
 3704
 3705
 3706
 3707
 3708
 3709
 3710
 3711
 3712
 3713
 3714
 3715
 3716
 3717
 3718
 3719
 3720
 3721
 3722
 3723
 3724
 3725
 3726
 3727
 3728
 3729
 3730
 3731
 3732
 3733
 3734
 3735
 3736
 3737
 3738
 3739
 3740
 3741
 3742
 3743
 3744
 3745
 3746
 3747
 3748
 3749
 3750
 3751
 3752
 3753
 3754
 3755
 3756
 3757
 3758
 3759
 3760
 3761
 3762
 3763
 3764
 3765
 3766
 3767
 3768
 3769
 3770
 3771
 3772
 3773
 3774
 3775
 3776
 3777
 3778
 3779
 3780
 3781
 3782
 3783
 3784
 3785
 3786
 3787
 3788
 3789
 3790
 3791
 3792
 3793
 3794
 3795
 3796
 3797
 3798
 3799
 3800
 3801
 3802
 3803
 3804
 3805
 3806
 3807
 3808
 3809
 3810
 3811
 3812
 3813
 3814
 3815
 3816
 3817
 3818
 3819
 3820
 3821
 3822
 3823
 3824
 3825
 3826
 3827
 3828
 3829
 3830
 3831
 3832
 3833
 3834
 3835
 3836
 3837
 3838
 3839
 3840
 3841
 3842
 3843
 3844
 3845
 3846
 3847
 3848
 3849
 3850
 3851
 3852
 3853
 3854
 3855
 3856
 3857
 3858
 3859
 3860
 3861
 3862
 3863
 3864
 3865
 3866
 3867
 3868
 3869
 3870
 3871
 3872
 3873
 3874
 3875
 3876
 3877
 3878
 3879
 3880
 3881
 3882
 3883
 3884
 3885
 3886
 3887
 3888
 3889
 3890
 3891
 3892
 3893
 3894
 3895
 3896
 3897
 3898
 3899
 3900
 3901
 3902
 3903
 3904
 3905
 3906
 3907
 3908
 3909
 3910
 3911
 3912
 3913
 3914
 3915
 3916
 3917
 3918
 3919
 3920
 3921
 3922
 3923
 3924
 3925
 3926
 3927
 3928
 3929
 3930
 3931
 3932
 3933
 3934
 3935
 3936
 3937
 3938
 3939
 3940
 3941
 3942
 3943
 3944
 3945
 3946
 3947
 3948
 3949
 3950
 3951
 3952
 3953
 3954
 3955
 3956
 3957
 3958
 3959
 3960
 3961
 3962
 3963
 3964
 3965
 3966
 3967
 3968
 3969
 3970
 3971
 3972
 3973
 3974
 3975
 3976
 3977
 3978
 3979
 3980
 3981
 3982
 3983
 3984
 3985
 3986
 3987
 3988
 3989
 3990
 3991
 3992
 3993
 3994
 3995
 3996
 3997
 3998
 3999
 4000
 4001
 4002
 4003
 4004
 4005
 4006
 4007
 4008
 4009
 4010
 4011
 4012
 4013
 4014
 4015
 4016
 4017
 4018
 4019
 4020
 4021
 4022
 4023
 4024
 4025
 4026
 4027
 4028
 4029
 4030
 4031
 4032
 4033
 4034
 4035
 4036
 4037
 4038
 4039
 4040
 4041
 4042
 4043
 4044
 4045
 4046
 4047
 4048
 4049
 4050
 4051
 4052
 4053
 4054
 4055
 4056
 4057
 4058
 4059
 4060
 4061
 4062
 4063
 4064
 4065
 4066
 4067
 4068
 4069
 4070
 4071
 4072
 4073
 4074
 4075
 4076
 4077
 4078
 4079
 4080
 4081
 4082
 4083
 4084
 4085
 4086
 4087
 4088
 4089
 4090
 4091
 4092
 4093
 4094
 4095
 4096
 4097
 4098
 4099
 4100
 4101
 4102
 4103
 4104
 4105
 4106
 4107
 4108
 4109
 4110
 4111
 4112
 4113
 4114
 4115
 4116
 4117
 4118
 4119
 4120
 4121
 4122
 4123
 4124
 4125
 4126
 4127
 4128
 4129
 4130
 4131
 4132
 4133
 4134
 4135
 4136
 4137
 4138
 4139
 4140
 4141
 4142
 4143
 4144
 4145
 4146
 4147
 4148
 4149
 4150
 4151
 4152
 4153
 4154
 4155
 4156
 4157
 4158
 4159
 4160
 4161
 4162
 4163
 4164
 4165
 4166
 4167
 4168
 4169
 4170
 4171
 4172
 4173
 4174
 4175
 4176
 4177
 4178
 4179
 4180
 4181
 4182
 4183
 4184
 4185
 4186
 4187
 4188
 4189
 4190
 4191
 4192
 4193
 4194
 4195
 4196
 4197
 4198
 4199
 4200
 4201
 4202
 4203
 4204
 4205
 4206
 4207
 4208
 4209
 4210
 4211
 4212
 4213
 4214
 4215
 4216
 4217
 4218
 4219
 4220
 4221
 4222
 4223
 4224
 4225
 4226
 4227
 4228
 4229
 4230
 4231
 4232
 4233
 4234
 4235
 4236
 4237
 4238
 4239
 4240
 4241
 4242
 4243
 4244
 4245
 4246
 4247
 4248
 4249
 4250
 4251
 4252
 4253
 4254
 4255
 4256
 4257
 4258
 4259
 4260
 4261
 4262
 4263
 4264
 4265
 4266
 4267
 4268
 4269
 4270
 4271
 4272
 4273
 4274
 4275
 4276
 4277
 4278
 4279
 4280
 4281
 4282
 4283
 4284
 4285
 4286
 4287
 4288
 4289
 4290
 4291
 4292
 4293
 4294
 4295
 4296
 4297
 4298
 4299
 4300
 4301
 4302
 4303
 4304
 4305
 4306
 4307
 4308
 4309
 4310
 4311
 4312
 4313
 4314
 4315
 4316
 4317
 4318
 4319
 4320
 4321
 4322
 4323
 4324
 4325
 4326
 4327
 4328
 4329
 4330
 4331
 4332
 4333
 4334
 4335
 4336
 4337
 4338
 4339
 4340
 4341
 4342
 4343
 4344
 4345
 4346
 4347
 4348
 4349
 4350
 4351
 4352
 4353
 4354
 4355
 4356
 4357
 4358
 4359
 4360
 4361
 4362
 4363
 4364
 4365
 4366
 4367
 4368
 4369
 4370
 4371
 4372
 4373
 4374
 4375
 4376
 4377
 4378
 4379
 4380
 4381
 4382
 4383
 4384
 4385
 4386
 4387
 4388
 4389
 4390
 4391
 4392
 4393
 4394
 4395
 4396
 4397
 4398
 4399
 4400
 4401
 4402
 4403
 4404
 4405
 4406
 4407
 4408
 4409
 4410
 4411
 4412
 4413
 4414
 4415
 4416
 4417
 4418
 4419
 4420
 4421
 4422
 4423
 4424
 4425
 4426
 4427
 4428
 4429
 4430
 4431
 4432
 4433
 4434
 4435
 4436
 4437
 4438
 4439
 4440
 4441
 4442
 4443
 4444
 4445
 4446
 4447
 4448
 4449
 4450
 4451
 4452
 4453
 4454
 4455
 4456
 4457
 4458
 4459
 4460
 4461
 4462
 4463
 4464
 4465
 4466
 4467
 4468
 4469
 4470
 4471
 4472
 4473
 4474
 4475
 4476
 4477
 4478
 4479
 4480
 4481
 4482
 4483
 4484
 4485
 4486
 4487
 4488
 4489
 4490
 4491
 4492
 4493
 4494
 4495
 4496
 4497
 4498
 4499
 4500
 4501
 4502
 4503
 4504
 4505
 4506
 4507
 4508
 4509
 4510
 4511
 4512
 4513
 4514
 4515
 4516
 4517
 4518
 4519
 4520
 4521
 4522
 4523
 4524
 4525
 4526
 4527
 4528
 4529
 4530
 4531
 4532
 4533
 4534
 4535
 4536
 4537
 4538
 4539
 4540
 4541
 4542
 4543
 4544
 4545
 4546
 4547
 4548
 4549
 4550
 4551
 4552
 4553
 4554
 4555
 4556
 4557
 4558
 4559
 4560
 4561
 4562
 4563
 4564
 4565
 4566
 4567
 4568
 4569
 4570
 4571
 4572
 4573
 4574
 4575
 4576
 4577
 4578
 4579
 4580
 4581
 4582
 4583
 4584
 4585
 4586
 4587
 4588
 4589
 4590
 4591
 4592
 4593
 4594
 4595
 4596
 4597
 4598
 4599
 4600
 4601
 4602
 4603
 4604
 4605
 4606
 4607
 4608
 4609
 4610
 4611
 4612
 4613
 4614
 4615
 4616
 4617
 4618
 4619
 4620
 4621
 4622
 4623
 4624
 4625
 4626
 4627
 4628
 4629
 4630
 4631
 4632
 4633
 4634
 4635
 4636
 4637
 4638
 4639
 4640
 4641
 4642
 4643
 4644
 4645
 4646
 4647
 4648
 4649
 4650
 4651
 4652
 4653
 4654
 4655
 4656
 4657
 4658
 4659
 4660
 4661
 4662
 4663
 4664
 4665
 4666
 4667
 4668
 4669
 4670
 4671
 4672
 4673
 4674
 4675
 4676
 4677
 4678
 4679
 4680
 4681
 4682
 4683
 4684
 4685
 4686
 4687
 4688
 4689
 4690
 4691
 4692
 4693
 4694
 4695
 4696
 4697
 4698
 4699
 4700
 4701
 4702
 4703
 4704
 4705
 4706
 4707
 4708
 4709
 4710
 4711
 4712
 4713
 4714
 4715
 4716
 4717
 4718
 4719
 4720
 4721
 4722
 4723
 4724
 4725
 4726
 4727
 4728
 4729
 4730
 4731
 4732
 4733
 4734
 4735
 4736
 4737
 4738
 4739
 4740
 4741
 4742
 4743
 4744
 4745
 4746
 4747
 4748
 4749
 4750
 4751
 4752
 4753
 4754
 4755
 4756
 4757
 4758
 4759
 4760
 4761
 4762
 4763
 4764
 4765
 4766
 4767
 4768
 4769
 4770
 4771
 4772
 4773
 4774
 4775
 4776
 4777
 4778
 4779
 4780
 4781
 4782
 4783
 4784
 4785
 4786
 4787
 4788
 4789
 4790
 4791
 4792
 4793
 4794
 4795
 4796
 4797
 4798
 4799
 4800
 4801
 4802
 4803
 4804
 4805
 4806
 4807
 4808
 4809
 4810
 4811
 4812
 4813
 4814
 4815
 4816
 4817
 4818
 4819
 4820
 4821
 4822
 4823
 4824
 4825
 4826
 4827
 4828
 4829
 4830
 4831
 4832
 4833
 4834
 4835
 4836
 4837
 4838
 4839
 4840
 4841
 4842
 4843
 4844
 4845
 4846
 4847
 4848
 4849
 4850
 4851
 4852
 4853
 4854
 4855
 4856
 4857
 4858
 4859
 4860
 4861
 4862
 4863
 4864
 4865
 4866
 4867
 4868
 4869
 4870
 4871
 4872
 4873
 4874
 4875
 4876
 4877
 4878
 4879
 4880
 4881
 4882
 4883
 4884
 4885
 4886
 4887
 4888
 4889
 4890
 4891
 4892
 4893
 4894
 4895
 4896
 4897
 4898
 4899
 4900
 4901
 4902
 4903
 4904
 4905
 4906
 4907
 4908
 4909
 4910
 4911
 4912
 4913
 4914
 4915
 4916
 4917
 4918
 4919
 4920
 4921
 4922
 4923
 4924
 4925
 4926
 4927
 4928
 4929
 4930
 4931
 4932
 4933
 4934
 4935
 4936
 4937
 4938
 4939
 4940
 4941
 4942
 4943
 4944
 4945
 4946
 4947
 4948
 4949
 4950
 4951
 4952
 4953
 4954
 4955
 4956
 4957
 4958
 4959
 4960
 4961
 4962
 4963
 4964
 4965
 4966
 4967
 4968
 4969
 4970
 4971
 4972
 4973
 4974
 4975
 4976
 4977
 4978
 4979
 4980
 4981
 4982
 4983
 4984
 4985
 4986
 4987
 4988
 4989
 4990
 4991
 4992
 4993
 4994
 4995
 4996
 4997
 4998
 4999
 5000
 5001
 5002
 5003
 5004
 5005
 5006
 5007
 5008
 5009
 5010
 5011
 5012
 5013
 5014
 5015
 5016
 5017
 5018
 5019
 5020
 5021
 5022
 5023
 5024
 5025
 5026
 5027
 5028
 5029
 5030
 5031
 5032
 5033
 5034
 5035
 5036
 5037
 5038
 5039
 5040
 5041
 5042
 5043
 5044
 5045
 5046
 5047
 5048
 5049
 5050
 5051
 5052
 5053
 5054
 5055
 5056
 5057
 5058
 5059
 5060
 5061
 5062
 5063
 5064
 5065
 5066
 5067
 5068
 5069
 5070
 5071
 5072
 5073
 5074
 5075
 5076
 5077
 5078
 5079
 5080
 5081
 5082
 5083
 5084
 5085
 5086
 5087
 5088
 5089
 5090
 5091
 5092
 5093
 5094
 5095
 5096
 5097
 5098
 5099
 5100
 5101
 5102
 5103
 5104
 5105
 5106
 5107
 5108
 5109
 5110
 5111
 5112
 5113
 5114
 5115
 5116
 5117
 5118
 5119
 5120
 5121
 5122
 5123
 5124
 5125
 5126
 5127
 5128
 5129
 5130
 5131
 5132
 5133
 5134
 5135
 5136
 5137
 5138
 5139
 5140
 5141
 5142
 5143
 5144
 5145
 5146
 5147
 5148
 5149
 5150
 5151
 5152
 5153
 5154
 5155
 5156
 5157
 5158
 5159
 5160
 5161
 5162
 5163
 5164
 5165
 5166
 5167
 5168
 5169
 5170
 5171
 5172
 5173
 5174
 5175
 5176
 5177
 5178
 5179
 5180
 5181
 5182
 5183
 5184
 5185
 5186
 5187
 5188
 5189
 5190
 5191
 5192
 5193
 5194
 5195
 5196
 5197
 5198
 5199
 5200
 5201
 5202
 5203
 5204
 5205
 5206
 5207
 5208
 5209
 5210
 5211
 5212
 5213
 5214
 5215
 5216
 5217
 5218
 5219
 5220
 5221
 5222
 5223
 5224
 5225
 5226
 5227
 5228
 5229
 5230
 5231
 5232
 5233
 5234
 5235
 5236
 5237
 5238
 5239
 5240
 5241
 5242
 5243
 5244
 5245
 5246
 5247
 5248
 5249
 5250
 5251
 5252
 5253
 5254
 5255
 5256
 5257
 5258
 5259
 5260
 5261
 5262
 5263
 5264
 5265
 5266
 5267
 5268
 5269
 5270
 5271
 5272
 5273
 5274
 5275
 5276
 5277
 5278
 5279
 5280
 5281
 5282
 5283
 5284
 5285
 5286
 5287
 5288
 5289
 5290
 5291
 5292
 5293
 5294
 5295
 5296
 5297
 5298
 5299
 5300
 5301
 5302
 5303
 5304
 5305
 5306
 5307
 5308
 5309
 5310
 5311
 5312
 5313
 5314
 5315
 5316
 5317
 5318
 5319
 5320
 5321
 5322
 5323
 5324
 5325
 5326
 5327
 5328
 5329
 5330
 5331
 5332
 5333
 5334
 5335
 5336
 5337
 5338
 5339
 5340
 5341
 5342
 5343
 5344
 5345
 5346
 5347
 5348
 5349
 5350
 5351
 5352
 5353
 5354
 5355
 5356
 5357
 5358
 5359
 5360
 5361
 5362
 5363
 5364
 5365
 5366
 5367
 5368
 5369
 5370
 5371
 5372
 5373
 5374
 5375
 5376
 5377
 5378
 5379
 5380
 5381
 5382
 5383
 5384
 5385
 5386
 5387
 5388
 5389
 5390
 5391
 5392
 5393
 5394
 5395
 5396
 5397
 5398
 5399
 5400
 5401
 5402
 5403
 5404
 5405
 5406
 5407
 5408
 5409
 5410
 5411
 5412
 5413
 5414
 5415
 5416
 5417
 5418
 5419
 5420
 5421
 5422
 5423
 5424
 5425
 5426
 5427
 5428
 5429
 5430
 5431
 5432
 5433
 5434
 5435
 5436
 5437
 5438
 5439
 5440
 5441
 5442
 5443
 5444
 5445
 5446
 5447
 5448
 5449
 5450
 5451
 5452
 5453
 5454
 5455
 5456
 5457
 5458
 5459
 5460
 5461
 5462
 5463
 5464
 5465
 5466
 5467
 5468
 5469
 5470
 5471
 5472
 5473
 5474
 5475
 5476
 5477
 5478
 5479
 5480
 5481
 5482
 5483
 5484
 5485
 5486
 5487
 5488
 5489
 5490
 5491
 5492
 5493
 5494
 5495
 5496
 5497
 5498
 5499
 5500
 5501
 5502
 5503
 5504
 5505
 5506
 5507
 5508
 5509
 5510
 5511
 5512
 5513
 5514
 5515
 5516
 5517
 5518
 5519
 5520
 5521
 5522
 5523
 5524
 5525
 5526
 5527
 5528
 5529
 5530
 5531
 5532
 5533
 5534
 5535
 5536
 5537
 5538
 5539
 5540
 5541
 5542
 5543
 5544
 5545
 5546
 5547
 5548
 5549
 5550
 5551
 5552
 5553
 5554
 5555
 5556
 5557
 5558
 5559
 5560
 5561
 5562
 5563
 5564
 5565
 5566
 5567
 5568
 5569
 5570
 5571
 5572
 5573
 5574
 5575
 5576
 5577
 5578
 5579
 5580
 5581
 5582
 5583
 5584
 5585
 5586
 5587
 5588
 5589
 5590
 5591
 5592
 5593
 5594
 5595
 5596
 5597
 5598
 5599
 5600
 5601
 5602
 5603
 5604
 5605
 5606
 5607
 5608
 5609
 5610
 5611
 5612
 5613
 5614
 5615
 5616
 5617
 5618
 5619
 5620
 5621
 5622
 5623
 5624
 5625
 5626
 5627
 5628
 5629
 5630
 5631
 5632
 5633
 5634
 5635
 5636
 5637
 5638
 5639
 5640
 5641
 5642
 5643
 5644
 5645
 5646
 5647
 5648
 5649
 5650
 5651
 5652
 5653
 5654
 5655
 5656
 5657
 5658
 5659
 5660
 5661
 5662
 5663
 5664
 5665
 5666
 5667
 5668
 5669
 5670
 5671
 5672
 5673
 5674
 5675
 5676
 5677
 5678
 5679
 5680
 5681
 5682
 5683
 5684
 5685
 5686
 5687
 5688
 5689
 5690
 5691
 5692
 5693
 5694
 5695
 5696
 5697
 5698
 5699
 5700
 5701
 5702
 5703
 5704
 5705
 5706
 5707
 5708
 5709
 5710
 5711
 5712
 5713
 5714
 5715
 5716
 5717
 5718
 5719
 5720
 5721
 5722
 5723
 5724
 5725
 5726
 5727
 5728
 5729
 5730
 5731
 5732
 5733
 5734
 5735
 5736
 5737
 5738
 5739
 5740
 5741
 5742
 5743
 5744
 5745
 5746
 5747
 5748
 5749
 5750
 5751
 5752
 5753
 5754
 5755
 5756
 5757
 5758
 5759
 5760
 5761
 5762
 5763
 5764
 5765
 5766
 5767
 5768
 5769
 5770
 5771
 5772
 5773
 5774
 5775
 5776
 5777
 5778
 5779
 5780
 5781
 5782
 5783
 5784
 5785
 5786
 5787
 5788
 5789
 5790
 5791
 5792
 5793
 5794
 5795
 5796
 5797
 5798
 5799
 5800
 5801
 5802
 5803
 5804
 5805
 5806
 5807
 5808
 5809
 5810
 5811
 5812
 5813
 5814
 5815
 5816
 5817
 5818
 5819
 5820
 5821
 5822
 5823
 5824
 5825
 5826
 5827
 5828
 5829
 5830
 5831
 5832
 5833
 5834
 5835
 5836
 5837
 5838
 5839
 5840
 5841
 5842
 5843
 5844
 5845
 5846
 5847
 5848
 5849
 5850
 5851
 5852
 5853
 5854
 5855
 5856
 5857
 5858
 5859
 5860
 5861
 5862
 5863
 5864
 5865
 5866
 5867
 5868
 5869
 5870
 5871
 5872
 5873
 5874
 5875
 5876
 5877
 5878
 5879
 5880
 5881
 5882
 5883
 5884
 5885
 5886
 5887
 5888
 5889
 5890
 5891
 5892
 5893
 5894
 5895
 5896
 5897
 5898
 5899
 5900
 5901
 5902
 5903
 5904
 5905
 5906
 5907
 5908
 5909
 5910
 5911
 5912
 5913
 5914
 5915
 5916
 5917
 5918
 5919
 5920
 5921
 5922
 5923
 5924
 5925
 5926
 5927
 5928
 5929
 5930
 5931
 5932
 5933
 5934
 5935
 5936
 5937
 5938
 5939
 5940
 5941
 5942
 5943
 5944
 5945
 5946
 5947
 5948
 5949
 5950
 5951
 5952
 5953
 5954
 5955
 5956
 5957
 5958
 5959
 5960
 5961
 5962
 5963
 5964
 5965
 5966
 5967
 5968
 5969
 5970
 5971
 5972
 5973
 5974
 5975
 5976
 5977
 5978
 5979
 5980
 5981
 5982
 5983
 5984
 5985
 5986
 5987
 5988
 5989
 5990
 5991
 5992
 5993
 5994
 5995
 5996
 5997
 5998
 5999
 6000
 6001
 6002
 6003
 6004
 6005
 6006
 6007
 6008
 6009
 6010
 6011
 6012
 6013
 6014
 6015
 6016
 6017
 6018
 6019
 6020
 6021
 6022
 6023
 6024
 6025
 6026
 6027
 6028
 6029
 6030
 6031
 6032
 6033
 6034
 6035
 6036
 6037
 6038
 6039
 6040
 6041
 6042
 6043
 6044
 6045
 6046
 6047
 6048
 6049
 6050
 6051
 6052
 6053
 6054
 6055
 6056
 6057
 6058
 6059
 6060
 6061
 6062
 6063
 6064
 6065
 6066
 6067
 6068
 6069
 6070
 6071
 6072
 6073
 6074
 6075
 6076
 6077
 6078
 6079
 6080
 6081
 6082
 6083
 6084
 6085
 6086
 6087
 6088
 6089
 6090
 6091
 6092
 6093
 6094
 6095
 6096
 6097
 6098
 6099
 6100
 6101
 6102
 6103
 6104
 6105
 6106
 6107
 6108
 6109
 6110
 6111
 6112
 6113
 6114
 6115
 6116
 6117
 6118
 6119
 6120
 6121
 6122
 6123
 6124
 6125
 6126
 6127
 6128
 6129
 6130
 6131
 6132
 6133
 6134
 6135
 6136
 6137
 6138
 6139
 6140
 6141
 6142
 6143
 6144
 6145
 6146
 6147
 6148
 6149
 6150
 6151
 6152
 6153
 6154
 6155
 6156
 6157
 6158
 6159
 6160
 6161
 6162
 6163
 6164
 6165
 6166
 6167
 6168
 6169
 6170
 6171
 6172
 6173
 6174
 6175
 6176
 6177
 6178
 6179
 6180
 6181
 6182
 6183
 6184
 6185
 6186
 6187
 6188
 6189
 6190
 6191
 6192
 6193
 6194
 6195
 6196
 6197
 6198
 6199
 6200
 6201
 6202
 6203
 6204
 6205
 6206
 6207
 6208
 6209
 6210
 6211
 6212
 6213
 6214
 6215
 6216
 6217
 6218
 6219
 6220
 6221
 6222
 6223
 6224
 6225
 6226
 6227
 6228
 6229
 6230
 6231
 6232
 6233
 6234
 6235
 6236
 6237
 6238
 6239
 6240
 6241
 6242
 6243
 6244
 6245
 6246
 6247
 6248
 6249
 6250
 6251
 6252
 6253
 6254
 6255
 6256
 6257
 6258
 6259
 6260
 6261
 6262
 6263
 6264
 6265
 6266
 6267
 6268
 6269
 6270
 6271
 6272
 6273
 6274
 6275
 6276
 6277
 6278
 6279
 6280
 6281
 6282
 6283
 6284
 6285
 6286
 6287
 6288
 6289
 6290
 6291
 6292
 6293
 6294
 6295
 6296
 6297
 6298
 6299
 6300
 6301
 6302
 6303
 6304
 6305
 6306
 6307
 6308
 6309
 6310
 6311
 6312
 6313
 6314
 6315
 6316
 6317
 6318
 6319
 6320
 6321
 6322
 6323
 6324
 6325
 6326
 6327
 6328
 6329
 6330
 6331
 6332
 6333
 6334
 6335
 6336
 6337
 6338
 6339
 6340
 6341
 6342
 6343
 6344
 6345
 6346
 6347
 6348
 6349
 6350
 6351
 6352
 6353
 6354
 6355
 6356
 6357
 6358
 6359
 6360
 6361
 6362
 6363
 6364
 6365
 6366
 6367
 6368
 6369
 6370
 6371
 6372
 6373
 6374
 6375
 6376
 6377
 6378
 6379
 6380
 6381
 6382
 6383
 6384
 6385
 6386
 6387
 6388
 6389
 6390
 6391
 6392
 6393
 6394
 6395
 6396
 6397
 6398
 6399
 6400
 6401
 6402
 6403
 6404
 6405
 6406
 6407
 6408
 6409
 6410
 6411
 6412
 6413
 6414
 6415
 6416
 6417
 6418
 6419
 6420
 6421
 6422
 6423
 6424
 6425
 6426
 6427
 6428
 6429
 6430
 6431
 6432
 6433
 6434
 6435
 6436
 6437
 6438
 6439
 6440
 6441
 6442
 6443
 6444
 6445
 6446
 6447
 6448
 6449
 6450
 6451
 6452
 6453
 6454
 6455
 6456
 6457
 6458
 6459
 6460
 6461
 6462
 6463
 6464
 6465
 6466
 6467
 6468
 6469
 6470
 6471
 6472
 6473
 6474
 6475
 6476
 6477
 6478
 6479
 6480
 6481
 6482
 6483
 6484
 6485
 6486
 6487
 6488
 6489
 6490
 6491
 6492
 6493
 6494
 6495
 6496
 6497
 6498
 6499
 6500
 6501
 6502
 6503
 6504
 6505
 6506
 6507
 6508
 6509
 6510
 6511
 6512
 6513
 6514
 6515
 6516
 6517
 6518
 6519
 6520
 6521
 6522
 6523
 6524
 6525
 6526
 6527
 6528
 6529
 6530
 6531
 6532
 6533
 6534
 6535
 6536
 6537
 6538
 6539
 6540
 6541
 6542
 6543
 6544
 6545
 6546
 6547
 6548
 6549
 6550
 6551
 6552
 6553
 6554
 6555
 6556
 6557
 6558
 6559
 6560
 6561
 6562
 6563
 6564
 6565
 6566
 6567
 6568
 6569
 6570
 6571
 6572
 6573
 6574
 6575
 6576
 6577
 6578
 6579
 6580
 6581
 6582
 6583
 6584
 6585
 6586
 6587
 6588
 6589
 6590
 6591
 6592
 6593
 6594
 6595
 6596
 6597
 6598
 6599
 6600
 6601
 6602
 6603
 6604
 6605
 6606
 6607
 6608
 6609
 6610
 6611
 6612
 6613
 6614
 6615
 6616
 6617
 6618
 6619
 6620
 6621
 6622
 6623
 6624
 6625
 6626
 6627
 6628
 6629
 6630
 6631
 6632
 6633
 6634
 6635
 6636
 6637
 6638
 6639
 6640
 6641
 6642
 6643
 6644
 6645
 6646
 6647
 6648
 6649
 6650
 6651
 6652
 6653
 6654
 6655
 6656
 6657
 6658
 6659
 6660
 6661
 6662
 6663
 6664
 6665
 6666
 6667
 6668
 6669
 6670
 6671
 6672
 6673
 6674
 6675
 6676
 6677
 6678
 6679
 6680
 6681
 6682
 6683
 6684
 6685
 6686
 6687
 6688
 6689
 6690
 6691
 6692
 6693
 6694
 6695
 6696
 6697
 6698
 6699
 6700
 6701
 6702
 6703
 6704
 6705
 6706
 6707
 6708
 6709
 6710
 6711
 6712
 6713
 6714
 6715
 6716
 6717
 6718
 6719
 6720
 6721
 6722
 6723
 6724
 6725
 6726
 6727
 6728
 6729
 6730
 6731
 6732
 6733
 6734
 6735
 6736
 6737
 6738
 6739
 6740
 6741
 6742
 6743
 6744
 6745
 6746
 6747
 6748
 6749
 6750
 6751
 6752
 6753
 6754
 6755
 6756
 6757
 6758
 6759
 6760
 6761
 6762
 6763
 6764
 6765
 6766
 6767
 6768
 6769
 6770
 6771
 6772
 6773
 6774
 6775
 6776
 6777
 6778
 6779
 6780
 6781
 6782
 6783
 6784
 6785
 6786
 6787
 6788
 6789
 6790
 6791
 6792
 6793
 6794
 6795
 6796
 6797
 6798
 6799
 6800
 6801
 6802
 6803
 6804
 6805
 6806
 6807
 6808
 6809
 6810
 6811
 6812
 6813
 6814
 6815
 6816
 6817
 6818
 6819
 6820
 6821
 6822
 6823
 6824
 6825
 6826
 6827
 6828
 6829
 6830
 6831
 6832
 6833
 6834
 6835
 6836
 6837
 6838
 6839
 6840
 6841
 6842
 6843
 6844
 6845
 6846
 6847
 6848
 6849
 6850
 6851
 6852
 6853
 6854
 6855
 6856
 6857
 6858
 6859
 6860
 6861
 6862
 6863
 6864
 6865
 6866
 6867
 6868
 6869
 6870
 6871
 6872
 6873
 6874
 6875
 6876
 6877
 6878
 6879
 6880
 6881
 6882
 6883
 6884
 6885
 6886
 6887
 6888
 6889
 6890
 6891
 6892
 6893
 6894
 6895
 6896
 6897
 6898
 6899
 6900
 6901
 6902
 6903
 6904
 6905
 6906
 6907
 6908
 6909
 6910
 6911
 6912
 6913
 6914
 6915
 6916
 6917
 6918
 6919
 6920
 6921
 6922
 6923
 6924
 6925
 6926
 6927
 6928
 6929
 6930
 6931
 6932
 6933
 6934
 6935
 6936
 6937
 6938
 6939
 6940
 6941
 6942
 6943
 6944
 6945
 6946
 6947
 6948
 6949
 6950
 6951
 6952
 6953
 6954
 6955
 6956
 6957
 6958
 6959
 6960
 6961
 6962
 6963
 6964
 6965
 6966
 6967
 6968
 6969
 6970
 6971
 6972
 6973
 6974
 6975
 6976
 6977
 6978
 6979
 6980
 6981
 6982
 6983
 6984
 6985
 6986
 6987
 6988
 6989
 6990
 6991
 6992
 6993
 6994
 6995
 6996
 6997
 6998
 6999
 7000
 7001
 7002
 7003
 7004
 7005
 7006
 7007
 7008
 7009
 7010
 7011
 7012
 7013
 7014
 7015
 7016
 7017
 7018
 7019
 7020
 7021
 7022
 7023
 7024
 7025
 7026
 7027
 7028
 7029
 7030
 7031
 7032
 7033
 7034
 7035
 7036
 7037
 7038
 7039
 7040
 7041
 7042
 7043
 7044
 7045
 7046
 7047
 7048
 7049
 7050
 7051
 7052
 7053
 7054
 7055
 7056
 7057
 7058
 7059
 7060
 7061
 7062
 7063
 7064
 7065
 7066
 7067
 7068
 7069
 7070
 7071
 7072
 7073
 7074
 7075
 7076
 7077
 7078
 7079
 7080
 7081
 7082
 7083
 7084
 7085
 7086
 7087
 7088
 7089
 7090
 7091
 7092
 7093
 7094
 7095
 7096
 7097
 7098
 7099
 7100
 7101
 7102
 7103
 7104
 7105
 7106
 7107
 7108
 7109
 7110
 7111
 7112
 7113
 7114
 7115
 7116
 7117
 7118
 7119
 7120
 7121
 7122
 7123
 7124
 7125
 7126
 7127
 7128
 7129
 7130
 7131
 7132
 7133
 7134
 7135
 7136
 7137
 7138
 7139
 7140
 7141
 7142
 7143
 7144
 7145
 7146
 7147
 7148
 7149
 7150
 7151
 7152
 7153
 7154
 7155
 7156
 7157
 7158
 7159
 7160
 7161
 7162
 7163
 7164
 7165
 7166
 7167
 7168
 7169
 7170
 7171
 7172
 7173
 7174
 7175
 7176
 7177
 7178
 7179
 7180
 7181
 7182
 7183
 7184
 7185
 7186
 7187
 7188
 7189
 7190
 7191
 7192
 7193
 7194
 7195
 7196
 7197
 7198
 7199
 7200
 7201
 7202
 7203
 7204
 7205
 7206
 7207
 7208
 7209
 7210
 7211
 7212
 7213
 7214
 7215
 7216
 7217
 7218
 7219
 7220
 7221
 7222
 7223
 7224
 7225
 7226
 7227
 7228
 7229
 7230
 7231
 7232
 7233
 7234
 7235
 7236
 7237
 7238
 7239
 7240
 7241
 7242
 7243
 7244
 7245
 7246
 7247
 7248
 7249
 7250
 7251
 7252
 7253
 7254
 7255
 7256
 7257
 7258
 7259
 7260
 7261
 7262
 7263
 7264
 7265
 7266
 7267
 7268
 7269
 7270
 7271
 7272
 7273
 7274
 7275
 7276
 7277
 7278
 7279
 7280
 7281
 7282
 7283
 7284
 7285
 7286
 7287
 7288
 7289
 7290
 7291
 7292
 7293
 7294
 7295
 7296
 7297
 7298
 7299
 7300
 7301
 7302
 7303
 7304
 7305
 7306
 7307
 7308
 7309
 7310
 7311
 7312
 7313
 7314
 7315
 7316
 7317
 7318
 7319
 7320
 7321
 7322
 7323
 7324
 7325
 7326
 7327
 7328
 7329
 7330
 7331
 7332
 7333
 7334
 7335
 7336
 7337
 7338
 7339
 7340
 7341
 7342
 7343
 7344
 7345
 7346
 7347
 7348
 7349
 7350
 7351
 7352
 7353
 7354
 7355
 7356
 7357
 7358
 7359
 7360
 7361
 7362
 7363
 7364
 7365
 7366
 7367
 7368
 7369
 7370
 7371
 7372
 7373
 7374
 7375
 7376
 7377
 7378
 7379
 7380
 7381
 7382
 7383
 7384
 7385
 7386
 7387
 7388
 7389
 7390
 7391
 7392
 7393
 7394
 7395
 7396
 7397
 7398
 7399
 7400
 7401
 7402
 7403
 7404
 7405
 7406
 7407
 7408
 7409
 7410
 7411
 7412
 7413
 7414
 7415
 7416
 7417
 7418
 7419
 7420
 7421
 7422
 7423
 7424
 7425
 7426
 7427
 7428
 7429
 7430
 7431
 7432
 7433
 7434
 7435
 7436
 7437
 7438
 7439
 7440
 7441
 7442
 7443
 7444
 7445
 7446
 7447
 7448
 7449
 7450
 7451
 7452
 7453
 7454
 7455
 7456
 7457
 7458
 7459
 7460
 7461
 7462
 7463
 7464
 7465
 7466
 7467
 7468
 7469
 7470
 7471
 7472
 7473
 7474
 7475
 7476
 7477
 7478
 7479
 7480
 7481
 7482
 7483
 7484
 7485
 7486
 7487
 7488
 7489
 7490
 7491
 7492
 7493
 7494
 7495
 7496
 7497
 7498
 7499
 7500
 7501
 7502
 7503
 7504
 7505
 7506
 7507
 7508
 7509
 7510
 7511
 7512
 7513
 7514
 7515
 7516
 7517
 7518
 7519
 7520
 7521
 7522
 7523
 7524
 7525
 7526
 7527
 7528
 7529
 7530
 7531
 7532
 7533
 7534
 7535
 7536
 7537
 7538
 7539
 7540
 7541
 7542
 7543
 7544
 7545
 7546
 7547
 7548
 7549
 7550
 7551
 7552
 7553
 7554
 7555
 7556
 7557
 7558
 7559
 7560
 7561
 7562
 7563
 7564
 7565
 7566
 7567
 7568
 7569
 7570
 7571
 7572
 7573
 7574
 7575
 7576
 7577
 7578
 7579
 7580
 7581
 7582
 7583
 7584
 7585
 7586
 7587
 7588
 7589
 7590
 7591
 7592
 7593
 7594
 7595
 7596
 7597
 7598
 7599
 7600
 7601
 7602
 7603
 7604
 7605
 7606
 7607
 7608
 7609
 7610
 7611
 7612
 7613
 7614
 7615
 7616
 7617
 7618
 7619
 7620
 7621
 7622
 7623
 7624
 7625
 7626
 7627
 7628
 7629
 7630
 7631
 7632
 7633
 7634
 7635
 7636
 7637
 7638
 7639
 7640
 7641
 7642
 7643
 7644
 7645
 7646
 7647
 7648
 7649
 7650
 7651
 7652
 7653
 7654
 7655
 7656
 7657
 7658
 7659
 7660
 7661
 7662
 7663
 7664
 7665
 7666
 7667
 7668
 7669
 7670
 7671
 7672
 7673
 7674
 7675
 7676
 7677
 7678
 7679
 7680
 7681
 7682
 7683
 7684
 7685
 7686
 7687
 7688
 7689
 7690
 7691
 7692
 7693
 7694
 7695
 7696
 7697
 7698
 7699
 7700
 7701
 7702
 7703
 7704
 7705
 7706
 7707
 7708
 7709
 7710
 7711
 7712
 7713
 7714
 7715
 7716
 7717
 7718
 7719
 7720
 7721
 7722
 7723
 7724
 7725
 7726
 7727
 7728
 7729
 7730
 7731
 7732
 7733
 7734
 7735
 7736
 7737
 7738
 7739
 7740
 7741
 7742
 7743
 7744
 7745
 7746
 7747
 7748
 7749
 7750
 7751
 7752
 7753
 7754
 7755
 7756
 7757
 7758
 7759
 7760
 7761
 7762
 7763
 7764
 7765
 7766
 7767
 7768
 7769
 7770
 7771
 7772
 7773
 7774
 7775
 7776
 7777
 7778
 7779
 7780
 7781
 7782
 7783
 7784
 7785
 7786
 7787
 7788
 7789
 7790
 7791
 7792
 7793
 7794
 7795
 7796
 7797
 7798
 7799
 7800
 7801
 7802
 7803
 7804
 7805
 7806
 7807
 7808
 7809
 7810
 7811
 7812
 7813
 7814
 7815
 7816
 7817
 7818
 7819
 7820
 7821
 7822
 7823
 7824
 7825
 7826
 7827
 7828
 7829
 7830
 7831
 7832
 7833
 7834
 7835
 7836
 7837
 7838
 7839
 7840
 7841
 7842
 7843
 7844
 7845
 7846
 7847
 7848
 7849
 7850
 7851
 7852
 7853
 7854
 7855
 7856
 7857
 7858
 7859
 7860
 7861
 7862
 7863
 7864
 7865
 7866
 7867
 7868
 7869
 7870
 7871
 7872
 7873
 7874
 7875
 7876
 7877
 7878
 7879
 7880
 7881
 7882
 7883
 7884
 7885
 7886
 7887
 7888
 7889
 7890
 7891
 7892
 7893
 7894
 7895
 7896
 7897
 7898
 7899
 7900
 7901
 7902
 7903
 7904
 7905
 7906
 7907
 7908
 7909
 7910
 7911
 7912
 7913
 7914
 7915
 7916
 7917
 7918
 7919
 7920
 7921
 7922
 7923
 7924
 7925
 7926
 7927
 7928
 7929
 7930
 7931
 7932
 7933
 7934
 7935
 7936
 7937
 7938
 7939
 7940
 7941
 7942
 7943
 7944
 7945
 7946
 7947
 7948
 7949
 7950
 7951
 7952
 7953
 7954
 7955
 7956
 7957
 7958
 7959
 7960
 7961
 7962
 7963
 7964
 7965
 7966
 7967
 7968
 7969
 7970
 7971
 7972
 7973
 7974
 7975
 7976
 7977
 7978
 7979
 7980
 7981
 7982
 7983
 7984
 7985
 7986
 7987
 7988
 7989
 7990
 7991
 7992
 7993
 7994
 7995
 7996
 7997
 7998
 7999
 8000
 8001
 8002
 8003
 8004
 8005
 8006
 8007
 8008
 8009
 8010
 8011
 8012
 8013
 8014
 8015
 8016
 8017
 8018
 8019
 8020
 8021
 8022
 8023
 8024
 8025
 8026
 8027
 8028
 8029
 8030
 8031
 8032
 8033
 8034
 8035
 8036
 8037
 8038
 8039
 8040
 8041
 8042
 8043
 8044
 8045
 8046
 8047
 8048
 8049
 8050
 8051
 8052
 8053
 8054
 8055
 8056
 8057
 8058
 8059
 8060
 8061
 8062
 8063
 8064
 8065
 8066
 8067
 8068
 8069
 8070
 8071
 8072
 8073
 8074
 8075
 8076
 8077
 8078
 8079
 8080
 8081
 8082
 8083
 8084
 8085
 8086
 8087
 8088
 8089
 8090
 8091
 8092
 8093
 8094
 8095
 8096
 8097
 8098
 8099
 8100
 8101
 8102
 8103
 8104
 8105
 8106
 8107
 8108
 8109
 8110
 8111
 8112
 8113
 8114
 8115
 8116
 8117
 8118
 8119
 8120
 8121
 8122
 8123
 8124
 8125
 8126
 8127
 8128
 8129
 8130
 8131
 8132
 8133
 8134
 8135
 8136
 8137
 8138
 8139
 8140
 8141
 8142
 8143
 8144
 8145
 8146
 8147
 8148
 8149
 8150
 8151
 8152
 8153
 8154
 8155
 8156
 8157
 8158
 8159
 8160
 8161
 8162
 8163
 8164
 8165
 8166
 8167
 8168
 8169
 8170
 8171
 8172
 8173
 8174
 8175
 8176
 8177
 8178
 8179
 8180
 8181
 8182
 8183
 8184
 8185
 8186
 8187
 8188
 8189
 8190
 8191
 8192
 8193
 8194
 8195
 8196
 8197
 8198
 8199
 8200
 8201
 8202
 8203
 8204
 8205
 8206
 8207
 8208
 8209
 8210
 8211
 8212
 8213
 8214
 8215
 8216
 8217
 8218
 8219
 8220
 8221
 8222
 8223
 8224
 8225
 8226
 8227
 8228
 8229
 8230
 8231
 8232
 8233
 8234
 8235
 8236
 8237
 8238
 8239
 8240
 8241
 8242
 8243
 8244
 8245
 8246
 8247
 8248
 8249
 8250
 8251
 8252
 8253
 8254
 8255
 8256
 8257
 8258
 8259
 8260
 8261
 8262
 8263
 8264
 8265
 8266
 8267
 8268
 8269
 8270
 8271
 8272
 8273
 8274
 8275
 8276
 8277
 8278
 8279
 8280
 8281
 8282
 8283
 8284
 8285
 8286
 8287
 8288
 8289
 8290
 8291
 8292
 8293
 8294
 8295
 8296
 8297
 8298
 8299
 8300
 8301
 8302
 8303
 8304
 8305
 8306
 8307
 8308
 8309
 8310
 8311
 8312
 8313
 8314
 8315
 8316
 8317
 8318
 8319
 8320
 8321
 8322
 8323
 8324
 8325
 8326
 8327
 8328
 8329
 8330
 8331
 8332
 8333
 8334
 8335
 8336
 8337
 8338
 8339
 8340
 8341
 8342
 8343
 8344
 8345
 8346
 8347
 8348
 8349
 8350
 8351
 8352
 8353
 8354
 8355
 8356
 8357
 8358
 8359
 8360
 8361
 8362
 8363
 8364
 8365
 8366
 8367
 8368
 8369
 8370
 8371
 8372
 8373
 8374
 8375
 8376
 8377
 8378
 8379
 8380
 8381
 8382
 8383
 8384
 8385
 8386
 8387
 8388
 8389
 8390
 8391
 8392
 8393
 8394
 8395
 8396
 8397
 8398
 8399
 8400
 8401
 8402
 8403
 8404
 8405
 8406
 8407
 8408
 8409
 8410
 8411
 8412
 8413
 8414
 8415
 8416
 8417
 8418
 8419
 8420
 8421
 8422
 8423
 8424
 8425
 8426
 8427
 8428
 8429
 8430
 8431
 8432
 8433
 8434
 8435
 8436
 8437
 8438
 8439
 8440
 8441
 8442
 8443
 8444
 8445
 8446
 8447
 8448
 8449
 8450
 8451
 8452
 8453
 8454
 8455
 8456
 8457
 8458
 8459
 8460
 8461
 8462
 8463
 8464
 8465
 8466
 8467
 8468
 8469
 8470
 8471
 8472
 8473
 8474
 8475
 8476
 8477
 8478
 8479
 8480
 8481
 8482
 8483
 8484
 8485
 8486
 8487
 8488
 8489
 8490
 8491
 8492
 8493
 8494
 8495
 8496
 8497
 8498
 8499
 8500
 8501
 8502
 8503
 8504
 8505
 8506
 8507
 8508
 8509
 8510
 8511
 8512
 8513
 8514
 8515
 8516
 8517
 8518
 8519
 8520
 8521
 8522
 8523
 8524
 8525
 8526
 8527
 8528
 8529
 8530
 8531
 8532
 8533
 8534
 8535
 8536
 8537
 8538
 8539
 8540
 8541
 8542
 8543
 8544
 8545
 8546
 8547
 8548
 8549
 8550
 8551
 8552
 8553
 8554
 8555
 8556
 8557
 8558
 8559
 8560
 8561
 8562
 8563
 8564
 8565
 8566
 8567
 8568
 8569
 8570
 8571
 8572
 8573
 8574
 8575
 8576
 8577
 8578
 8579
 8580
 8581
 8582
 8583
 8584
 8585
 8586
 8587
 8588
 8589
 8590
 8591
 8592
 8593
 8594
 8595
 8596
 8597
 8598
 8599
 8600
 8601
 8602
 8603
 8604
 8605
 8606
 8607
 8608
 8609
 8610
 8611
 8612
 8613
 8614
 8615
 8616
 8617
 8618
 8619
 8620
 8621
 8622
 8623
 8624
 8625
 8626
 8627
 8628
 8629
 8630
 8631
 8632
 8633
 8634
 8635
 8636
 8637
 8638
 8639
 8640
 8641
 8642
 8643
 8644
 8645
 8646
 8647
 8648
 8649
 8650
 8651
 8652
 8653
 8654
 8655
 8656
 8657
 8658
 8659
 8660
 8661
 8662
 8663
 8664
 8665
 8666
 8667
 8668
 8669
 8670
 8671
 8672
 8673
 8674
 8675
 8676
 8677
 8678
 8679
 8680
 8681
 8682
 8683
 8684
 8685
 8686
 8687
 8688
 8689
 8690
 8691
 8692
 8693
 8694
 8695
 8696
 8697
 8698
 8699
 8700
 8701
 8702
 8703
 8704
 8705
 8706
 8707
 8708
 8709
 8710
 8711
 8712
 8713
 8714
 8715
 8716
 8717
 8718
 8719
 8720
 8721
 8722
 8723
 8724
 8725
 8726
 8727
 8728
 8729
 8730
 8731
 8732
 8733
 8734
 8735
 8736
 8737
 8738
 8739
 8740
 8741
 8742
 8743
 8744
 8745
 8746
 8747
 8748
 8749
 8750
 8751
 8752
 8753
 8754
 8755
 8756
 8757
 8758
 8759
 8760
 8761
 8762
 8763
 8764
 8765
 8766
 8767
 8768
 8769
 8770
 8771
 8772
 8773
 8774
 8775
 8776
 8777
 8778
 8779
 8780
 8781
 8782
 8783
 8784
 8785
 8786
 8787
 8788
 8789
 8790
 8791
 8792
 8793
 8794
 8795
 8796
 8797
 8798
 8799
 8800
 8801
 8802
 8803
 8804
 8805
 8806
 8807
 8808
 8809
 8810
 8811
 8812
 8813
 8814
 8815
 8816
 8817
 8818
 8819
 8820
 8821
 8822
 8823
 8824
 8825
 8826
 8827
 8828
 8829
 8830
 8831
 8832
 8833
 8834
 8835
 8836
 8837
 8838
 8839
 8840
 8841
 8842
 8843
 8844
 8845
 8846
 8847
 8848
 8849
 8850
 8851
 8852
 8853
 8854
 8855
 8856
 8857
 8858
 8859
 8860
 8861
 8862
 8863
 8864
 8865
 8866
 8867
 8868
 8869
 8870
 8871
 8872
 8873
 8874
 8875
 8876
 8877
 8878
 8879
 8880
 8881
 8882
 8883
 8884
 8885
 8886
 8887
 8888
 8889
 8890
 8891
 8892
 8893
 8894
 8895
 8896
 8897
 8898
 8899
 8900
 8901
 8902
 8903
 8904
 8905
 8906
 8907
 8908
 8909
 8910
 8911
 8912
 8913
 8914
 8915
 8916
 8917
 8918
 8919
 8920
 8921
 8922
 8923
 8924
 8925
 8926
 8927
 8928
 8929
 8930
 8931
 8932
 8933
 8934
 8935
 8936
 8937
 8938
 8939
 8940
 8941
 8942
 8943
 8944
 8945
 8946
 8947
 8948
 8949
 8950
 8951
 8952
 8953
 8954
 8955
 8956
 8957
 8958
 8959
 8960
 8961
 8962
 8963
 8964
 8965
 8966
 8967
 8968
 8969
 8970
 8971
 8972
 8973
 8974
 8975
 8976
 8977
 8978
 8979
 8980
 8981
 8982
 8983
 8984
 8985
 8986
 8987
 8988
 8989
 8990
 8991
 8992
 8993
 8994
 8995
 8996
 8997
 8998
 8999
 9000
 9001
 9002
 9003
 9004
 9005
 9006
 9007
 9008
 9009
 9010
 9011
 9012
 9013
 9014
 9015
 9016
 9017
 9018
 9019
 9020
 9021
 9022
 9023
 9024
 9025
 9026
 9027
 9028
 9029
 9030
 9031
 9032
 9033
 9034
 9035
 9036
 9037
 9038
 9039
 9040
 9041
 9042
 9043
 9044
 9045
 9046
 9047
 9048
 9049
 9050
 9051
 9052
 9053
 9054
 9055
 9056
 9057
 9058
 9059
 9060
 9061
 9062
 9063
 9064
 9065
 9066
 9067
 9068
 9069
 9070
 9071
 9072
 9073
 9074
 9075
 9076
 9077
 9078
 9079
 9080
 9081
 9082
 9083
 9084
 9085
 9086
 9087
 9088
 9089
 9090
 9091
 9092
 9093
 9094
 9095
 9096
 9097
 9098
 9099
 9100
 9101
 9102
 9103
 9104
 9105
 9106
 9107
 9108
 9109
 9110
 9111
 9112
 9113
 9114
 9115
 9116
 9117
 9118
 9119
 9120
 9121
 9122
 9123
 9124
 9125
 9126
 9127
 9128
 9129
 9130
 9131
 9132
 9133
 9134
 9135
 9136
 9137
 9138
 9139
 9140
 9141
 9142
 9143
 9144
 9145
 9146
 9147
 9148
 9149
 9150
 9151
 9152
 9153
 9154
 9155
 9156
 9157
 9158
 9159
 9160
 9161
 9162
 9163
 9164
 9165
 9166
 9167
 9168
 9169
 9170
 9171
 9172
 9173
 9174
 9175
 9176
 9177
 9178
 9179
 9180
 9181
 9182
 9183
 9184
 9185
 9186
 9187
 9188
 9189
 9190
 9191
 9192
 9193
 9194
 9195
 9196
 9197
 9198
 9199
 9200
 9201
 9202
 9203
 9204
 9205
 9206
 9207
 9208
 9209
 9210
 9211
 9212
 9213
 9214
 9215
 9216
 9217
 9218
 9219
 9220
 9221
 9222
 9223
 9224
 9225
 9226
 9227
 9228
 9229
 9230
 9231
 9232
 9233
 9234
 9235
 9236
 9237
 9238
 9239
 9240
 9241
 9242
 9243
 9244
 9245
 9246
 9247
 9248
 9249
 9250
 9251
 9252
 9253
 9254
 9255
 9256
 9257
 9258
 9259
 9260
 9261
 9262
 9263
 9264
 9265
 9266
 9267
 9268
 9269
 9270
 9271
 9272
 9273
 9274
 9275
 9276
 9277
 9278
 9279
 9280
 9281
 9282
 9283
 9284
 9285
 9286
 9287
 9288
 9289
 9290
 9291
 9292
 9293
 9294
 9295
 9296
 9297
 9298
 9299
 9300
 9301
 9302
 9303
 9304
 9305
 9306
 9307
 9308
 9309
 9310
 9311
 9312
 9313
 9314
 9315
 9316
 9317
 9318
 9319
 9320
 9321
 9322
 9323
 9324
 9325
 9326
 9327
 9328
 9329
 9330
 9331
 9332
 9333
 9334
 9335
 9336
 9337
 9338
 9339
 9340
 9341
 9342
 9343
 9344
 9345
 9346
 9347
 9348
 9349
 9350
 9351
 9352
 9353
 9354
 9355
 9356
 9357
 9358
 9359
 9360
 9361
 9362
 9363
 9364
 9365
 9366
 9367
 9368
 9369
 9370
 9371
 9372
 9373
 9374
 9375
 9376
 9377
 9378
 9379
 9380
 9381
 9382
 9383
 9384
 9385
 9386
 9387
 9388
 9389
 9390
 9391
 9392
 9393
 9394
 9395
 9396
 9397
 9398
 9399
 9400
 9401
 9402
 9403
 9404
 9405
 9406
 9407
 9408
 9409
 9410
 9411
 9412
 9413
 9414
 9415
 9416
 9417
 9418
 9419
 9420
 9421
 9422
 9423
 9424
 9425
 9426
 9427
 9428
 9429
 9430
 9431
 9432
 9433
 9434
 9435
 9436
 9437
 9438
 9439
 9440
 9441
 9442
 9443
 9444
 9445
 9446
 9447
 9448
 9449
 9450
 9451
 9452
 9453
 9454
 9455
 9456
 9457
 9458
 9459
 9460
 9461
 9462
 9463
 9464
 9465
 9466
 9467
 9468
 9469
 9470
 9471
 9472
 9473
 9474
 9475
 9476
 9477
 9478
 9479
 9480
 9481
 9482
 9483
 9484
 9485
 9486
 9487
 9488
 9489
 9490
 9491
 9492
 9493
 9494
 9495
 9496
 9497
 9498
 9499
 9500
 9501
 9502
 9503
 9504
 9505
 9506
 9507
 9508
 9509
 9510
 9511
 9512
 9513
 9514
 9515
 9516
 9517
 9518
 9519
 9520
 9521
 9522
 9523
 9524
 9525
 9526
 9527
 9528
 9529
 9530
 9531
 9532
 9533
 9534
 9535
 9536
 9537
 9538
 9539
 9540
 9541
 9542
 9543
 9544
 9545
 9546
 9547
 9548
 9549
 9550
 9551
 9552
 9553
 9554
 9555
 9556
 9557
 9558
 9559
 9560
 9561
 9562
 9563
 9564
 9565
 9566
 9567
 9568
 9569
 9570
 9571
 9572
 9573
 9574
 9575
 9576
 9577
 9578
 9579
 9580
 9581
 9582
 9583
 9584
 9585
 9586
 9587
 9588
 9589
 9590
 9591
 9592
 9593
 9594
 9595
 9596
 9597
 9598
 9599
 9600
 9601
 9602
 9603
 9604
 9605
 9606
 9607
 9608
 9609
 9610
 9611
 9612
 9613
 9614
 9615
 9616
 9617
 9618
 9619
 9620
 9621
 9622
 9623
 9624
 9625
 9626
 9627
 9628
 9629
 9630
 9631
 9632
 9633
 9634
 9635
 9636
 9637
 9638
 9639
 9640
 9641
 9642
 9643
 9644
 9645
 9646
 9647
 9648
 9649
 9650
 9651
 9652
 9653
 9654
 9655
 9656
 9657
 9658
 9659
 9660
 9661
 9662
 9663
 9664
 9665
 9666
 9667
 9668
 9669
 9670
 9671
 9672
 9673
 9674
 9675
 9676
 9677
 9678
 9679
 9680
 9681
 9682
 9683
 9684
 9685
 9686
 9687
 9688
 9689
 9690
 9691
 9692
 9693
 9694
 9695
 9696
 9697
 9698
 9699
 9700
 9701
 9702
 9703
 9704
 9705
 9706
 9707
 9708
 9709
 9710
 9711
 9712
 9713
 9714
 9715
 9716
 9717
 9718
 9719
 9720
 9721
 9722
 9723
 9724
 9725
 9726
 9727
 9728
 9729
 9730
 9731
 9732
 9733
 9734
 9735
 9736
 9737
 9738
 9739
 9740
 9741
 9742
 9743
 9744
 9745
 9746
 9747
 9748
 9749
 9750
 9751
 9752
 9753
 9754
 9755
 9756
 9757
 9758
 9759
 9760
 9761
 9762
 9763
 9764
 9765
 9766
 9767
 9768
 9769
 9770
 9771
 9772
 9773
 9774
 9775
 9776
 9777
 9778
 9779
 9780
 9781
 9782
 9783
 9784
 9785
 9786
 9787
 9788
 9789
 9790
 9791
 9792
 9793
 9794
 9795
 9796
 9797
 9798
 9799
 9800
 9801
 9802
 9803
 9804
 9805
 9806
 9807
 9808
 9809
 9810
 9811
 9812
 9813
 9814
 9815
 9816
 9817
 9818
 9819
 9820
 9821
 9822
 9823
 9824
 9825
 9826
 9827
 9828
 9829
 9830
 9831
 9832
 9833
 9834
 9835
 9836
 9837
 9838
 9839
 9840
 9841
 9842
 9843
 9844
 9845
 9846
 9847
 9848
 9849
 9850
 9851
 9852
 9853
 9854
 9855
 9856
 9857
 9858
 9859
 9860
 9861
 9862
 9863
 9864
 9865
 9866
 9867
 9868
 9869
 9870
 9871
 9872
 9873
 9874
 9875
 9876
 9877
 9878
 9879
 9880
 9881
 9882
 9883
 9884
 9885
 9886
 9887
 9888
 9889
 9890
 9891
 9892
 9893
 9894
 9895
 9896
 9897
 9898
 9899
 9900
 9901
 9902
 9903
 9904
 9905
 9906
 9907
 9908
 9909
 9910
 9911
 9912
 9913
 9914
 9915
 9916
 9917
 9918
 9919
 9920
 9921
 9922
 9923
 9924
 9925
 9926
 9927
 9928
 9929
 9930
 9931
 9932
 9933
 9934
 9935
 9936
 9937
 9938
 9939
 9940
 9941
 9942
 9943
 9944
 9945
 9946
 9947
 9948
 9949
 9950
 9951
 9952
 9953
 9954
 9955
 9956
 9957
 9958
 9959
 9960
 9961
 9962
 9963
 9964
 9965
 9966
 9967
 9968
 9969
 9970
 9971
 9972
 9973
 9974
 9975
 9976
 9977
 9978
 9979
 9980
 9981
 9982
 9983
 9984
 9985
 9986
 9987
 9988
 9989
 9990
 9991
 9992
 9993
 9994
 9995
 9996
 9997
 9998
 9999
10000
10001
10002
10003
10004
10005
10006
10007
10008
10009
10010
10011
10012
10013
10014
10015
10016
10017
10018
10019
10020
10021
10022
10023
10024
10025
10026
10027
10028
10029
10030
10031
10032
10033
10034
10035
10036
10037
10038
10039
10040
10041
10042
10043
10044
10045
10046
10047
10048
10049
10050
10051
10052
10053
10054
10055
10056
10057
10058
10059
10060
10061
10062
10063
10064
10065
10066
10067
10068
10069
10070
10071
10072
10073
10074
10075
10076
10077
10078
10079
10080
10081
10082
10083
10084
10085
10086
10087
10088
10089
10090
10091
10092
10093
10094
10095
10096
10097
10098
10099
10100
10101
10102
10103
10104
10105
10106
10107
10108
10109
10110
10111
10112
10113
10114
10115
10116
10117
10118
10119
10120
10121
10122
10123
10124
10125
10126
10127
10128
10129
10130
10131
10132
10133
10134
10135
10136
10137
10138
10139
10140
10141
10142
10143
10144
10145
10146
10147
10148
10149
10150
10151
10152
10153
10154
10155
10156
10157
10158
10159
10160
10161
10162
10163
10164
10165
10166
10167
10168
10169
10170
10171
10172
10173
10174
10175
10176
10177
10178
10179
10180
10181
10182
10183
10184
10185
10186
10187
10188
10189
10190
10191
10192
10193
10194
10195
10196
10197
10198
10199
10200
10201
10202
10203
10204
10205
10206
10207
10208
10209
10210
10211
10212
10213
10214
10215
10216
10217
10218
10219
10220
10221
10222
10223
10224
10225
10226
10227
10228
10229
10230
10231
10232
10233
10234
10235
10236
10237
10238
10239
10240
10241
10242
10243
10244
10245
10246
10247
10248
10249
10250
10251
10252
10253
10254
10255
10256
10257
10258
10259
10260
10261
10262
10263
10264
10265
10266
10267
10268
10269
10270
10271
10272
10273
10274
10275
10276
10277
10278
10279
10280
10281
10282
10283
10284
10285
10286
10287
10288
10289
10290
10291
10292
10293
10294
10295
10296
10297
10298
10299
10300
10301
10302
10303
10304
10305
10306
10307
10308
10309
10310
10311
10312
10313
10314
10315
10316
10317
10318
10319
10320
10321
10322
10323
10324
10325
10326
10327
10328
10329
10330
10331
10332
10333
10334
10335
10336
10337
10338
10339
10340
10341
10342
10343
10344
10345
10346
10347
10348
10349
10350
10351
10352
10353
10354
10355
10356
10357
10358
10359
10360
10361
10362
10363
10364
10365
10366
10367
10368
10369
10370
10371
10372
10373
10374
10375
10376
10377
10378
10379
10380
10381
10382
10383
10384
10385
10386
10387
10388
10389
10390
10391
10392
10393
10394
10395
10396
10397
10398
10399
10400
10401
10402
10403
10404
10405
10406
10407
10408
10409
10410
10411
10412
10413
10414
10415
10416
10417
10418
10419
10420
10421
10422
10423
10424
10425
10426
10427
10428
10429
10430
10431
10432
10433
10434
10435
10436
10437
10438
10439
10440
10441
10442
10443
10444
10445
10446
10447
10448
10449
10450
10451
10452
10453
10454
10455
10456
10457
10458
10459
10460
10461
10462
10463
10464
10465
10466
10467
10468
10469
10470
10471
10472
10473
10474
10475
10476
10477
10478
10479
10480
10481
10482
10483
10484
10485
10486
10487
10488
10489
10490
10491
10492
10493
10494
10495
10496
10497
10498
10499
10500
10501
10502
10503
10504
10505
10506
10507
10508
10509
10510
10511
10512
10513
10514
10515
10516
10517
10518
10519
10520
10521
10522
10523
10524
10525
10526
10527
10528
10529
10530
10531
10532
10533
10534
10535
10536
10537
10538
10539
10540
10541
10542
10543
10544
10545
10546
10547
10548
10549
10550
10551
10552
10553
10554
10555
10556
10557
10558
10559
10560
10561
10562
10563
10564
10565
10566
10567
10568
10569
10570
10571
10572
10573
10574
10575
10576
10577
10578
10579
10580
10581
10582
10583
10584
10585
10586
10587
10588
10589
10590
10591
10592
10593
10594
10595
10596
10597
10598
10599
10600
10601
10602
10603
10604
10605
10606
10607
10608
10609
10610
10611
10612
10613
10614
10615
10616
10617
10618
10619
10620
10621
10622
10623
10624
10625
10626
10627
10628
10629
10630
10631
10632
10633
10634
10635
10636
10637
10638
10639
10640
10641
10642
10643
10644
10645
10646
10647
10648
10649
10650
10651
10652
10653
10654
10655
10656
10657
10658
10659
10660
10661
10662
10663
10664
10665
10666
10667
10668
10669
10670
10671
10672
10673
10674
10675
10676
10677
10678
10679
10680
10681
10682
10683
10684
10685
10686
10687
10688
10689
10690
10691
10692
10693
10694
10695
10696
10697
10698
10699
10700
10701
10702
10703
10704
10705
10706
10707
10708
10709
10710
10711
10712
10713
10714
10715
10716
10717
10718
10719
10720
10721
10722
10723
10724
10725
10726
10727
10728
10729
10730
10731
10732
10733
10734
10735
10736
10737
10738
10739
10740
10741
10742
10743
10744
10745
10746
10747
10748
10749
10750
10751
10752
10753
10754
10755
10756
10757
10758
10759
10760
10761
10762
10763
10764
10765
10766
10767
10768
10769
10770
10771
10772
10773
10774
10775
10776
10777
10778
10779
10780
10781
10782
10783
10784
10785
10786
10787
10788
10789
10790
10791
10792
10793
10794
10795
10796
10797
10798
10799
10800
10801
10802
10803
10804
10805
10806
10807
10808
10809
10810
10811
10812
10813
10814
10815
10816
10817
10818
10819
10820
10821
10822
10823
10824
10825
10826
10827
10828
10829
10830
10831
10832
10833
10834
10835
10836
10837
10838
10839
10840
10841
10842
10843
10844
10845
10846
10847
10848
10849
10850
10851
10852
10853
10854
10855
10856
10857
10858
10859
10860
10861
10862
10863
10864
10865
10866
10867
10868
10869
10870
10871
10872
10873
10874
10875
10876
10877
10878
10879
10880
10881
10882
10883
10884
10885
10886
10887
10888
10889
10890
10891
10892
10893
10894
10895
10896
10897
10898
10899
10900
10901
10902
10903
10904
10905
10906
10907
10908
10909
10910
10911
10912
10913
10914
10915
10916
10917
10918
10919
10920
10921
10922
10923
10924
10925
10926
10927
10928
10929
10930
10931
10932
10933
10934
10935
10936
10937
10938
10939
10940
10941
10942
10943
10944
10945
10946
10947
10948
10949
10950
10951
10952
10953
10954
10955
10956
10957
10958
10959
10960
10961
10962
10963
10964
10965
10966
10967
10968
10969
10970
10971
10972
10973
10974
10975
10976
10977
10978
10979
10980
10981
10982
10983
10984
10985
10986
10987
10988
10989
10990
10991
10992
10993
10994
10995
10996
10997
10998
10999
11000
11001
11002
11003
11004
11005
11006
11007
11008
11009
11010
11011
11012
11013
11014
11015
11016
11017
11018
11019
11020
11021
11022
11023
11024
11025
11026
11027
11028
11029
11030
11031
11032
11033
11034
11035
11036
11037
11038
11039
11040
11041
11042
11043
11044
11045
11046
11047
11048
11049
11050
11051
11052
11053
11054
11055
11056
11057
11058
11059
11060
11061
11062
11063
11064
11065
11066
11067
11068
11069
11070
11071
11072
11073
11074
11075
11076
11077
11078
11079
11080
11081
11082
11083
11084
11085
11086
11087
11088
11089
11090
11091
11092
11093
11094
11095
11096
11097
11098
11099
11100
11101
11102
11103
11104
11105
11106
11107
11108
11109
11110
11111
11112
11113
11114
11115
11116
11117
11118
11119
11120
11121
11122
11123
11124
11125
11126
11127
11128
11129
11130
11131
11132
11133
11134
11135
11136
11137
11138
11139
11140
11141
11142
11143
11144
11145
11146
11147
11148
11149
11150
11151
11152
11153
11154
11155
11156
11157
11158
11159
11160
11161
11162
11163
11164
11165
11166
11167
11168
11169
11170
11171
11172
11173
11174
11175
11176
11177
11178
11179
11180
11181
11182
11183
11184
11185
11186
11187
11188
11189
11190
11191
11192
11193
11194
11195
11196
11197
11198
11199
11200
11201
11202
11203
11204
11205
11206
11207
11208
11209
11210
11211
11212
11213
11214
11215
11216
11217
11218
11219
11220
11221
11222
11223
11224
11225
11226
11227
11228
11229
11230
11231
11232
11233
11234
11235
11236
11237
11238
11239
11240
11241
11242
11243
11244
11245
11246
11247
11248
11249
11250
11251
11252
11253
11254
11255
11256
11257
11258
11259
11260
11261
11262
11263
11264
11265
11266
11267
11268
11269
11270
11271
11272
11273
11274
11275
11276
11277
11278
11279
11280
11281
11282
11283
11284
11285
11286
11287
11288
11289
11290
11291
11292
11293
11294
11295
11296
11297
11298
11299
11300
11301
11302
11303
11304
11305
11306
11307
11308
11309
11310
11311
11312
11313
11314
11315
11316
11317
11318
11319
11320
11321
11322
11323
11324
11325
11326
11327
11328
11329
11330
11331
11332
11333
11334
11335
11336
11337
11338
11339
11340
11341
11342
11343
11344
11345
11346
11347
11348
11349
11350
11351
11352
11353
11354
11355
11356
11357
11358
11359
11360
11361
11362
11363
11364
11365
11366
11367
11368
11369
11370
11371
11372
11373
11374
11375
11376
11377
11378
11379
11380
11381
11382
11383
11384
11385
11386
11387
11388
11389
11390
11391
11392
11393
11394
11395
11396
11397
11398
11399
11400
11401
11402
11403
11404
11405
11406
11407
11408
11409
11410
11411
11412
11413
11414
11415
11416
11417
11418
11419
11420
11421
11422
11423
11424
11425
11426
11427
11428
11429
11430
11431
11432
11433
11434
11435
11436
11437
11438
11439
11440
11441
11442
11443
11444
11445
11446
11447
11448
11449
11450
11451
11452
11453
11454
11455
11456
11457
11458
11459
11460
11461
11462
11463
11464
11465
11466
11467
11468
11469
11470
11471
11472
11473
11474
11475
11476
11477
11478
11479
11480
11481
11482
11483
11484
11485
11486
11487
11488
11489
11490
11491
11492
11493
11494
11495
11496
11497
11498
11499
11500
11501
11502
11503
11504
11505
11506
11507
11508
11509
11510
11511
11512
11513
11514
11515
11516
11517
11518
11519
11520
11521
11522
11523
11524
11525
11526
11527
11528
11529
11530
11531
11532
11533
11534
11535
11536
11537
11538
11539
11540
11541
11542
11543
11544
11545
11546
11547
11548
11549
11550
11551
11552
11553
11554
11555
11556
11557
11558
11559
11560
11561
11562
11563
11564
11565
11566
11567
11568
11569
11570
11571
11572
11573
11574
11575
11576
11577
11578
11579
11580
11581
11582
11583
11584
11585
11586
11587
11588
11589
11590
11591
11592
11593
11594
11595
11596
11597
11598
11599
11600
11601
11602
11603
11604
11605
11606
11607
11608
11609
11610
11611
11612
11613
11614
11615
11616
11617
11618
11619
11620
11621
11622
11623
11624
11625
11626
11627
11628
11629
11630
11631
11632
11633
11634
11635
11636
11637
11638
11639
11640
11641
11642
11643
11644
11645
11646
11647
11648
11649
11650
11651
11652
11653
11654
11655
11656
11657
11658
11659
11660
11661
11662
11663
11664
11665
11666
11667
11668
11669
11670
11671
11672
11673
11674
11675
11676
11677
11678
11679
11680
11681
11682
11683
11684
11685
11686
11687
11688
11689
11690
11691
11692
11693
11694
11695
11696
11697
11698
11699
11700
11701
11702
11703
11704
11705
11706
11707
11708
11709
11710
11711
11712
11713
11714
11715
11716
11717
11718
11719
11720
11721
11722
11723
11724
11725
11726
11727
11728
11729
11730
11731
11732
11733
11734
11735
11736
11737
11738
11739
11740
11741
11742
11743
11744
11745
11746
11747
11748
11749
11750
11751
11752
11753
11754
11755
11756
11757
11758
11759
11760
11761
11762
11763
11764
11765
11766
11767
11768
11769
11770
11771
11772
11773
11774
11775
11776
11777
11778
11779
11780
11781
11782
11783
11784
11785
11786
11787
11788
11789
11790
11791
11792
11793
11794
11795
11796
11797
11798
11799
11800
11801
11802
11803
11804
11805
11806
11807
11808
11809
11810
11811
11812
11813
11814
11815
11816
11817
11818
11819
11820
11821
11822
11823
11824
11825
11826
11827
11828
11829
11830
11831
11832
11833
11834
11835
11836
11837
11838
11839
11840
11841
11842
11843
11844
11845
11846
11847
11848
11849
11850
11851
11852
11853
11854
11855
11856
11857
11858
11859
11860
11861
11862
11863
11864
11865
11866
11867
11868
11869
11870
11871
11872
11873
11874
11875
11876
11877
11878
11879
11880
11881
11882
11883
11884
11885
11886
11887
11888
11889
11890
11891
11892
11893
11894
11895
11896
11897
11898
11899
11900
11901
11902
11903
11904
11905
11906
11907
11908
11909
11910
11911
11912
11913
11914
11915
11916
11917
11918
11919
11920
11921
11922
11923
11924
11925
11926
11927
11928
11929
11930
11931
11932
11933
11934
11935
11936
11937
11938
11939
11940
11941
11942
11943
11944
11945
11946
11947
11948
11949
11950
11951
11952
11953
11954
11955
11956
11957
11958
11959
11960
11961
11962
11963
11964
11965
11966
11967
11968
11969
11970
11971
11972
11973
11974
11975
11976
11977
11978
11979
11980
11981
11982
11983
11984
11985
11986
11987
11988
11989
11990
11991
11992
11993
11994
11995
11996
11997
11998
11999
12000
12001
12002
12003
12004
12005
12006
12007
12008
12009
12010
12011
12012
12013
12014
12015
12016
12017
12018
12019
12020
12021
12022
12023
12024
12025
12026
12027
12028
12029
12030
12031
12032
12033
12034
12035
12036
12037
12038
12039
12040
12041
12042
12043
12044
12045
12046
12047
12048
12049
12050
12051
12052
12053
12054
12055
12056
12057
12058
12059
12060
12061
12062
12063
12064
12065
12066
12067
12068
12069
12070
12071
12072
12073
12074
12075
12076
12077
12078
12079
12080
12081
12082
12083
12084
12085
12086
12087
12088
12089
12090
12091
12092
12093
12094
12095
12096
12097
12098
12099
12100
12101
12102
12103
12104
12105
12106
12107
12108
12109
12110
12111
12112
12113
12114
12115
12116
12117
12118
12119
12120
12121
12122
12123
12124
12125
12126
12127
12128
12129
12130
12131
12132
12133
12134
12135
12136
12137
12138
12139
12140
12141
12142
12143
12144
12145
12146
12147
12148
12149
12150
12151
12152
12153
12154
12155
12156
12157
12158
12159
12160
12161
12162
12163
12164
12165
12166
12167
12168
12169
12170
12171
12172
12173
12174
12175
12176
12177
12178
12179
12180
12181
12182
12183
12184
12185
12186
12187
12188
12189
12190
12191
12192
12193
12194
12195
12196
12197
12198
12199
12200
12201
12202
12203
12204
12205
12206
12207
12208
12209
12210
12211
12212
12213
12214
12215
12216
12217
12218
12219
12220
12221
12222
12223
12224
12225
12226
12227
12228
12229
12230
12231
12232
12233
12234
12235
12236
12237
12238
12239
12240
12241
12242
12243
12244
12245
12246
12247
12248
12249
12250
12251
12252
12253
12254
12255
12256
12257
12258
12259
12260
12261
12262
12263
12264
12265
12266
12267
12268
12269
12270
12271
12272
12273
12274
12275
12276
12277
12278
12279
12280
12281
12282
12283
12284
12285
12286
12287
12288
12289
12290
12291
12292
12293
12294
12295
12296
12297
12298
12299
12300
12301
12302
12303
12304
12305
12306
12307
12308
12309
12310
12311
12312
12313
12314
12315
12316
12317
12318
12319
12320
12321
12322
12323
12324
12325
12326
12327
12328
12329
12330
12331
12332
12333
12334
12335
12336
12337
12338
12339
12340
12341
12342
12343
12344
12345
12346
12347
12348
12349
12350
12351
12352
12353
12354
12355
12356
12357
12358
12359
12360
12361
12362
12363
12364
12365
12366
12367
12368
12369
12370
12371
12372
12373
12374
12375
12376
12377
12378
12379
12380
12381
12382
12383
12384
12385
12386
12387
12388
12389
12390
12391
12392
12393
12394
12395
12396
12397
12398
12399
12400
12401
12402
12403
12404
12405
12406
12407
12408
12409
12410
12411
12412
12413
12414
12415
12416
12417
12418
12419
12420
12421
12422
12423
12424
12425
12426
12427
12428
12429
12430
12431
12432
12433
12434
12435
12436
12437
12438
12439
12440
12441
12442
12443
12444
12445
12446
12447
12448
12449
12450
12451
12452
12453
12454
12455
12456
12457
12458
12459
12460
12461
12462
12463
12464
12465
12466
12467
12468
12469
12470
12471
12472
12473
12474
12475
12476
12477
12478
12479
12480
12481
12482
12483
12484
12485
12486
12487
12488
12489
12490
12491
12492
12493
12494
12495
12496
12497
12498
12499
12500
12501
12502
12503
12504
12505
12506
12507
12508
12509
12510
12511
12512
12513
12514
12515
12516
12517
12518
12519
12520
12521
12522
12523
12524
12525
12526
12527
12528
12529
12530
12531
12532
12533
12534
12535
12536
12537
12538
12539
12540
12541
12542
12543
12544
12545
12546
12547
12548
12549
12550
12551
12552
12553
12554
12555
12556
12557
12558
12559
12560
12561
12562
12563
12564
12565
12566
12567
12568
12569
12570
12571
12572
12573
12574
12575
12576
12577
12578
12579
12580
12581
12582
12583
12584
12585
12586
12587
12588
12589
12590
12591
12592
12593
12594
12595
12596
12597
12598
12599
12600
12601
12602
12603
12604
12605
12606
12607
12608
12609
12610
12611
12612
12613
12614
12615
12616
12617
12618
12619
12620
12621
12622
12623
12624
12625
12626
12627
12628
12629
12630
12631
12632
12633
12634
12635
12636
12637
12638
12639
12640
12641
12642
12643
12644
12645
12646
12647
12648
12649
12650
12651
12652
12653
12654
12655
12656
12657
12658
12659
12660
12661
12662
12663
12664
12665
12666
12667
12668
12669
12670
12671
12672
12673
12674
12675
12676
12677
12678
12679
12680
12681
12682
12683
12684
12685
12686
12687
12688
12689
12690
12691
12692
12693
12694
12695
12696
12697
12698
12699
12700
12701
12702
12703
12704
12705
12706
12707
12708
12709
12710
12711
12712
12713
12714
12715
12716
12717
12718
12719
12720
12721
12722
12723
12724
12725
12726
12727
12728
12729
12730
12731
12732
12733
12734
12735
12736
12737
12738
12739
12740
12741
12742
12743
12744
12745
12746
12747
12748
12749
12750
12751
12752
12753
12754
12755
12756
12757
12758
12759
12760
12761
12762
12763
12764
12765
12766
12767
12768
12769
12770
12771
12772
12773
12774
12775
12776
12777
12778
12779
12780
12781
12782
12783
12784
12785
12786
12787
12788
12789
12790
12791
12792
12793
12794
12795
12796
12797
12798
12799
12800
12801
12802
12803
12804
12805
12806
12807
12808
12809
12810
12811
12812
12813
12814
12815
12816
12817
12818
12819
12820
12821
12822
12823
12824
12825
12826
12827
12828
12829
12830
12831
12832
12833
12834
12835
12836
12837
12838
12839
12840
12841
12842
12843
12844
12845
12846
12847
12848
12849
12850
12851
12852
12853
12854
12855
12856
12857
12858
12859
12860
12861
12862
12863
12864
12865
12866
12867
12868
12869
12870
12871
12872
12873
12874
12875
12876
12877
12878
12879
12880
12881
12882
12883
12884
12885
12886
12887
12888
12889
12890
12891
12892
12893
12894
12895
12896
12897
12898
12899
12900
12901
12902
12903
12904
12905
12906
12907
12908
12909
12910
12911
12912
12913
12914
12915
12916
12917
12918
12919
12920
12921
12922
12923
12924
12925
12926
12927
12928
12929
12930
12931
12932
12933
12934
12935
12936
12937
12938
12939
12940
12941
12942
12943
12944
12945
12946
12947
12948
12949
12950
12951
12952
12953
12954
12955
12956
12957
12958
12959
12960
12961
12962
12963
12964
12965
12966
12967
12968
12969
12970
12971
12972
12973
12974
12975
12976
12977
12978
12979
12980
12981
12982
12983
12984
12985
12986
12987
12988
12989
12990
12991
12992
12993
12994
12995
12996
12997
12998
12999
13000
13001
13002
13003
13004
13005
13006
13007
13008
13009
13010
13011
13012
13013
13014
13015
13016
13017
13018
13019
13020
13021
13022
13023
13024
13025
13026
13027
13028
13029
13030
13031
13032
13033
13034
13035
13036
13037
13038
13039
13040
13041
13042
13043
13044
13045
13046
13047
13048
13049
13050
13051
13052
13053
13054
13055
13056
13057
13058
13059
13060
13061
13062
13063
13064
13065
13066
13067
13068
13069
13070
13071
13072
13073
13074
13075
13076
13077
13078
13079
13080
13081
13082
13083
13084
13085
13086
13087
13088
13089
13090
13091
13092
13093
13094
13095
13096
13097
13098
13099
13100
13101
13102
13103
13104
13105
13106
13107
13108
13109
13110
13111
13112
13113
13114
13115
13116
13117
13118
13119
13120
13121
13122
13123
13124
13125
13126
13127
13128
13129
13130
13131
13132
13133
13134
13135
13136
13137
13138
13139
13140
13141
13142
13143
13144
13145
13146
13147
13148
13149
13150
13151
13152
13153
13154
13155
13156
13157
13158
13159
13160
13161
13162
13163
13164
13165
13166
13167
13168
13169
13170
13171
13172
13173
13174
13175
13176
13177
13178
13179
13180
13181
13182
13183
13184
13185
13186
13187
13188
13189
13190
13191
13192
13193
13194
13195
13196
13197
13198
13199
13200
13201
13202
13203
13204
13205
13206
13207
13208
13209
13210
13211
13212
13213
13214
13215
13216
13217
13218
13219
13220
13221
13222
13223
13224
13225
13226
13227
13228
13229
13230
13231
13232
13233
13234
13235
13236
13237
13238
13239
13240
13241
13242
13243
13244
13245
13246
13247
13248
13249
13250
13251
13252
13253
13254
13255
13256
13257
13258
13259
13260
13261
13262
13263
13264
13265
13266
13267
13268
13269
13270
13271
13272
13273
13274
13275
13276
13277
13278
13279
13280
13281
13282
13283
13284
13285
13286
13287
13288
13289
13290
13291
13292
13293
13294
13295
13296
13297
13298
13299
13300
13301
13302
13303
13304
13305
13306
13307
13308
13309
13310
13311
13312
13313
13314
13315
13316
13317
13318
13319
13320
13321
13322
13323
13324
13325
13326
13327
13328
13329
13330
13331
13332
13333
13334
13335
13336
13337
13338
13339
13340
13341
13342
13343
13344
13345
13346
13347
13348
13349
13350
13351
13352
13353
13354
13355
13356
13357
13358
13359
13360
13361
13362
13363
13364
13365
13366
13367
13368
13369
13370
13371
13372
13373
13374
13375
13376
13377
13378
13379
13380
13381
13382
13383
13384
13385
13386
13387
13388
13389
13390
13391
13392
13393
13394
13395
13396
13397
13398
13399
13400
13401
13402
13403
13404
13405
13406
13407
13408
13409
13410
13411
13412
13413
13414
13415
13416
13417
13418
13419
13420
13421
13422
13423
13424
13425
13426
13427
13428
13429
13430
13431
13432
13433
13434
13435
13436
13437
13438
13439
13440
13441
13442
13443
13444
13445
13446
13447
13448
13449
13450
13451
13452
13453
13454
13455
13456
13457
13458
13459
13460
13461
13462
13463
13464
13465
13466
13467
13468
13469
13470
13471
13472
13473
13474
13475
13476
13477
13478
13479
13480
13481
13482
13483
13484
13485
13486
13487
13488
13489
13490
13491
13492
13493
13494
13495
13496
13497
13498
13499
13500
13501
13502
13503
13504
13505
13506
13507
13508
13509
13510
13511
13512
13513
13514
13515
13516
13517
13518
13519
13520
13521
13522
13523
13524
13525
13526
13527
13528
13529
13530
13531
13532
13533
13534
13535
13536
13537
13538
13539
13540
13541
13542
13543
13544
13545
13546
13547
13548
13549
13550
13551
13552
13553
13554
13555
13556
13557
13558
13559
13560
13561
13562
13563
13564
13565
13566
13567
13568
13569
13570
13571
13572
13573
13574
13575
13576
13577
13578
13579
13580
13581
13582
13583
13584
13585
13586
13587
13588
13589
13590
13591
13592
13593
13594
13595
13596
13597
13598
13599
13600
13601
13602
13603
13604
13605
13606
13607
13608
13609
13610
13611
13612
13613
13614
13615
13616
13617
13618
13619
13620
13621
13622
13623
13624
13625
13626
13627
13628
13629
13630
13631
13632
13633
13634
13635
13636
13637
13638
13639
13640
13641
13642
13643
13644
13645
13646
13647
13648
13649
13650
13651
13652
13653
13654
13655
13656
13657
13658
13659
13660
13661
13662
13663
13664
13665
13666
13667
13668
13669
13670
13671
13672
13673
13674
13675
13676
13677
13678
13679
13680
13681
13682
13683
13684
13685
13686
13687
13688
13689
13690
13691
13692
13693
13694
13695
13696
13697
13698
13699
13700
13701
13702
13703
13704
13705
13706
13707
13708
13709
13710
13711
13712
13713
13714
13715
13716
13717
13718
13719
13720
13721
13722
13723
13724
13725
13726
13727
13728
13729
13730
13731
13732
13733
13734
13735
13736
13737
13738
13739
13740
13741
13742
13743
13744
13745
13746
13747
13748
13749
13750
13751
13752
13753
13754
13755
13756
13757
13758
13759
13760
13761
13762
13763
13764
13765
13766
13767
13768
13769
13770
13771
13772
13773
13774
13775
13776
13777
13778
13779
13780
13781
13782
13783
13784
13785
13786
13787
13788
13789
13790
13791
13792
13793
13794
13795
13796
13797
13798
13799
13800
13801
13802
13803
13804
13805
13806
13807
13808
13809
13810
13811
13812
13813
13814
13815
13816
13817
13818
13819
13820
13821
13822
13823
13824
13825
13826
13827
13828
13829
13830
13831
13832
13833
13834
13835
13836
13837
13838
13839
13840
13841
13842
13843
13844
13845
13846
13847
13848
13849
13850
13851
13852
13853
13854
13855
13856
13857
13858
13859
13860
13861
13862
13863
13864
13865
13866
13867
13868
13869
13870
13871
13872
13873
13874
13875
13876
13877
13878
13879
13880
13881
13882
13883
13884
13885
13886
13887
13888
13889
13890
13891
13892
13893
13894
13895
13896
13897
13898
13899
13900
13901
13902
13903
13904
13905
13906
13907
13908
13909
13910
13911
13912
13913
13914
13915
13916
13917
13918
13919
13920
13921
13922
13923
13924
13925
13926
13927
13928
13929
13930
13931
13932
13933
13934
13935
13936
13937
13938
13939
13940
13941
13942
13943
13944
13945
13946
13947
13948
13949
13950
13951
13952
13953
13954
13955
13956
13957
13958
13959
13960
13961
13962
13963
13964
13965
13966
13967
13968
13969
13970
13971
13972
13973
13974
13975
13976
13977
13978
13979
13980
13981
13982
13983
13984
13985
13986
13987
13988
13989
13990
13991
13992
13993
13994
13995
13996
13997
13998
13999
14000
14001
14002
14003
14004
14005
14006
14007
14008
14009
14010
14011
14012
14013
14014
14015
14016
14017
14018
14019
14020
14021
14022
14023
14024
14025
14026
14027
14028
14029
14030
14031
14032
14033
14034
14035
14036
14037
14038
14039
14040
14041
14042
14043
14044
14045
14046
14047
14048
14049
14050
14051
14052
14053
14054
14055
14056
14057
14058
14059
14060
14061
14062
14063
14064
14065
14066
14067
14068
14069
14070
14071
14072
14073
14074
14075
14076
14077
14078
14079
14080
14081
14082
14083
14084
14085
14086
14087
14088
14089
14090
14091
14092
14093
14094
14095
14096
14097
14098
14099
14100
14101
14102
14103
14104
14105
14106
14107
14108
14109
14110
14111
14112
14113
14114
14115
14116
14117
14118
14119
14120
14121
14122
14123
14124
14125
14126
14127
14128
14129
14130
14131
14132
14133
14134
14135
14136
14137
14138
14139
14140
14141
14142
14143
14144
14145
14146
14147
14148
14149
14150
14151
14152
14153
14154
14155
14156
14157
14158
14159
14160
14161
14162
14163
14164
14165
14166
14167
14168
14169
14170
14171
14172
14173
14174
14175
14176
14177
14178
14179
14180
14181
14182
14183
14184
14185
14186
14187
14188
14189
14190
14191
14192
14193
14194
14195
14196
14197
14198
14199
14200
14201
14202
14203
14204
14205
14206
14207
14208
14209
14210
14211
14212
14213
14214
14215
14216
14217
14218
14219
14220
14221
14222
14223
14224
14225
14226
14227
14228
14229
14230
14231
14232
14233
14234
14235
14236
14237
14238
14239
14240
14241
14242
14243
14244
14245
14246
14247
14248
14249
14250
14251
14252
14253
14254
14255
14256
14257
14258
14259
14260
14261
14262
14263
14264
14265
14266
14267
14268
14269
14270
14271
14272
14273
14274
14275
14276
14277
14278
14279
14280
14281
14282
14283
14284
14285
14286
14287
14288
14289
14290
14291
14292
14293
14294
14295
14296
14297
14298
14299
14300
14301
14302
14303
14304
14305
14306
14307
14308
14309
14310
14311
14312
14313
14314
14315
14316
14317
14318
14319
14320
14321
14322
14323
14324
14325
14326
14327
14328
14329
14330
14331
14332
14333
14334
14335
14336
14337
14338
14339
14340
14341
14342
14343
14344
14345
14346
14347
14348
14349
14350
14351
14352
14353
14354
14355
14356
14357
14358
14359
14360
14361
14362
14363
14364
14365
14366
14367
14368
14369
14370
14371
14372
14373
14374
14375
14376
14377
14378
14379
14380
14381
14382
14383
14384
14385
14386
14387
14388
14389
14390
14391
14392
14393
14394
14395
14396
14397
14398
14399
14400
14401
14402
14403
14404
14405
14406
14407
14408
14409
14410
14411
14412
14413
14414
14415
14416
14417
14418
14419
14420
14421
14422
14423
14424
14425
14426
14427
14428
14429
14430
14431
14432
14433
14434
14435
14436
14437
14438
14439
14440
14441
14442
14443
14444
14445
14446
14447
14448
14449
14450
14451
14452
14453
14454
14455
14456
14457
14458
14459
14460
14461
14462
14463
14464
14465
14466
14467
14468
14469
14470
14471
14472
14473
14474
14475
14476
14477
14478
14479
14480
14481
14482
14483
14484
14485
14486
14487
14488
14489
14490
14491
14492
14493
14494
14495
14496
14497
14498
14499
14500
14501
14502
14503
14504
14505
14506
14507
14508
14509
14510
14511
14512
14513
14514
14515
14516
14517
14518
14519
14520
14521
14522
14523
14524
14525
14526
14527
14528
14529
14530
14531
14532
14533
14534
14535
14536
14537
14538
14539
14540
14541
14542
14543
14544
14545
14546
14547
14548
14549
14550
14551
14552
14553
14554
14555
14556
14557
14558
14559
14560
14561
14562
14563
14564
14565
14566
14567
14568
14569
14570
14571
14572
14573
14574
14575
14576
14577
14578
14579
14580
14581
14582
14583
14584
14585
14586
14587
14588
14589
14590
14591
14592
14593
14594
14595
14596
14597
14598
14599
14600
14601
14602
14603
14604
14605
14606
14607
14608
14609
14610
14611
14612
14613
14614
14615
14616
14617
14618
14619
14620
14621
14622
14623
14624
14625
14626
14627
14628
14629
14630
14631
14632
14633
14634
14635
14636
14637
14638
14639
14640
14641
14642
14643
14644
14645
14646
14647
14648
14649
14650
14651
14652
14653
14654
14655
14656
14657
14658
14659
14660
14661
14662
14663
14664
14665
14666
14667
14668
14669
14670
14671
14672
14673
14674
14675
14676
14677
14678
14679
14680
14681
14682
14683
14684
14685
14686
14687
14688
14689
14690
14691
14692
14693
14694
14695
14696
14697
14698
14699
14700
14701
14702
14703
14704
14705
14706
14707
14708
14709
14710
14711
14712
14713
14714
14715
14716
14717
14718
14719
14720
14721
14722
14723
14724
14725
14726
14727
14728
14729
14730
14731
14732
14733
14734
14735
14736
14737
14738
14739
14740
14741
14742
14743
14744
14745
14746
14747
14748
14749
14750
14751
14752
14753
14754
14755
14756
14757
14758
14759
14760
14761
14762
14763
14764
14765
14766
14767
14768
14769
14770
14771
14772
14773
14774
14775
14776
14777
14778
14779
14780
14781
14782
14783
14784
14785
14786
14787
14788
14789
14790
14791
14792
14793
14794
14795
14796
14797
14798
14799
14800
14801
14802
14803
14804
14805
14806
14807
14808
14809
14810
14811
14812
14813
14814
14815
14816
14817
14818
14819
14820
14821
14822
14823
14824
14825
14826
14827
14828
14829
14830
14831
14832
14833
14834
14835
14836
14837
14838
14839
14840
14841
14842
14843
14844
14845
14846
14847
14848
14849
14850
14851
14852
14853
14854
14855
14856
14857
14858
14859
14860
14861
14862
14863
14864
14865
14866
14867
14868
14869
14870
14871
14872
14873
14874
14875
14876
14877
14878
14879
14880
14881
14882
14883
14884
14885
14886
14887
14888
14889
14890
14891
14892
14893
14894
14895
14896
14897
14898
14899
14900
14901
14902
14903
14904
14905
14906
14907
14908
14909
14910
14911
14912
14913
14914
14915
14916
14917
14918
14919
14920
14921
14922
14923
14924
14925
14926
14927
14928
14929
14930
14931
14932
14933
14934
14935
14936
14937
14938
14939
14940
14941
14942
14943
14944
14945
14946
14947
14948
14949
14950
14951
14952
14953
14954
14955
14956
14957
14958
14959
14960
14961
14962
14963
14964
14965
14966
14967
14968
14969
14970
14971
14972
14973
14974
14975
14976
14977
14978
14979
14980
14981
14982
14983
14984
14985
14986
14987
14988
14989
14990
14991
14992
14993
14994
14995
14996
14997
14998
14999
15000
15001
15002
15003
15004
15005
15006
15007
15008
15009
15010
15011
15012
15013
15014
15015
15016
15017
15018
15019
15020
15021
15022
15023
15024
15025
15026
15027
15028
15029
15030
15031
15032
15033
15034
15035
15036
15037
15038
15039
15040
15041
15042
15043
15044
15045
15046
15047
15048
15049
15050
15051
15052
15053
15054
15055
15056
15057
15058
15059
15060
15061
15062
15063
15064
15065
15066
15067
15068
15069
15070
15071
15072
15073
15074
15075
15076
15077
15078
15079
15080
15081
15082
15083
15084
15085
15086
15087
15088
15089
15090
15091
15092
15093
15094
15095
15096
15097
15098
15099
15100
15101
15102
15103
15104
15105
15106
15107
15108
15109
15110
15111
15112
15113
15114
15115
15116
15117
15118
15119
15120
15121
15122
15123
15124
15125
15126
15127
15128
15129
15130
15131
15132
15133
15134
15135
15136
15137
15138
15139
15140
15141
15142
15143
15144
15145
15146
15147
15148
15149
15150
15151
15152
15153
15154
15155
15156
15157
15158
15159
15160
15161
15162
15163
15164
15165
15166
15167
15168
15169
15170
15171
15172
15173
15174
15175
15176
15177
15178
15179
15180
15181
15182
15183
15184
15185
15186
15187
15188
15189
15190
15191
15192
15193
15194
15195
15196
15197
15198
15199
15200
15201
15202
15203
15204
15205
15206
15207
15208
15209
15210
15211
15212
15213
15214
15215
15216
15217
15218
15219
15220
15221
15222
15223
15224
15225
15226
15227
15228
15229
15230
15231
15232
15233
15234
15235
15236
15237
15238
15239
15240
15241
15242
15243
15244
15245
15246
15247
15248
15249
15250
15251
15252
15253
15254
15255
15256
15257
15258
15259
15260
15261
15262
15263
15264
15265
15266
15267
15268
15269
15270
15271
15272
15273
15274
15275
15276
15277
15278
15279
15280
15281
15282
15283
15284
15285
15286
15287
15288
15289
15290
15291
15292
15293
15294
15295
15296
15297
15298
15299
15300
15301
15302
15303
15304
15305
15306
15307
15308
15309
15310
15311
15312
15313
15314
15315
15316
15317
15318
15319
15320
15321
15322
15323
15324
15325
15326
15327
15328
15329
15330
15331
15332
15333
15334
15335
15336
15337
15338
15339
15340
15341
15342
15343
15344
15345
15346
15347
15348
15349
15350
15351
15352
15353
15354
15355
15356
15357
15358
15359
15360
15361
15362
15363
15364
15365
15366
15367
15368
15369
15370
15371
15372
15373
15374
15375
15376
15377
15378
15379
15380
15381
15382
15383
15384
15385
15386
15387
15388
15389
15390
15391
15392
15393
15394
15395
15396
15397
15398
15399
15400
15401
15402
15403
15404
15405
15406
15407
15408
15409
15410
15411
15412
15413
15414
15415
15416
15417
15418
15419
15420
15421
15422
15423
15424
15425
15426
15427
15428
15429
15430
15431
15432
15433
15434
15435
15436
15437
15438
15439
15440
15441
15442
15443
15444
15445
15446
15447
15448
15449
15450
15451
15452
15453
15454
15455
15456
15457
15458
15459
15460
15461
15462
15463
15464
15465
15466
15467
15468
15469
15470
15471
15472
15473
15474
15475
15476
15477
15478
15479
15480
15481
15482
15483
15484
15485
15486
15487
15488
15489
15490
15491
15492
15493
15494
15495
15496
15497
15498
15499
15500
15501
15502
15503
15504
15505
15506
15507
15508
15509
15510
15511
15512
15513
15514
15515
15516
15517
15518
15519
15520
15521
15522
15523
15524
15525
15526
15527
15528
15529
15530
15531
15532
15533
15534
15535
15536
15537
15538
15539
15540
15541
15542
15543
15544
15545
15546
15547
15548
15549
15550
15551
15552
15553
15554
15555
15556
15557
15558
15559
15560
15561
15562
15563
15564
15565
15566
15567
15568
15569
15570
15571
15572
15573
15574
15575
15576
15577
15578
15579
15580
15581
15582
15583
15584
15585
15586
15587
15588
15589
15590
15591
15592
15593
15594
15595
15596
15597
15598
15599
15600
15601
15602
15603
15604
15605
15606
15607
15608
15609
15610
15611
15612
15613
15614
15615
15616
15617
15618
15619
15620
15621
15622
15623
15624
15625
15626
15627
15628
15629
15630
15631
15632
15633
15634
15635
15636
15637
15638
15639
15640
15641
15642
15643
15644
15645
15646
15647
15648
15649
15650
15651
15652
15653
15654
15655
15656
15657
15658
15659
15660
15661
15662
15663
15664
15665
15666
15667
15668
15669
15670
15671
15672
15673
15674
15675
15676
15677
15678
15679
15680
15681
15682
15683
15684
15685
15686
15687
15688
15689
15690
15691
15692
15693
15694
15695
15696
15697
15698
15699
15700
15701
15702
15703
15704
15705
15706
15707
15708
15709
15710
15711
15712
15713
15714
15715
15716
15717
15718
15719
15720
15721
15722
15723
15724
15725
15726
15727
15728
15729
15730
15731
15732
15733
15734
15735
15736
15737
15738
15739
15740
15741
15742
15743
15744
15745
15746
15747
15748
15749
15750
15751
15752
15753
15754
15755
15756
15757
15758
15759
15760
15761
15762
15763
15764
15765
15766
15767
15768
15769
15770
15771
15772
15773
15774
15775
15776
15777
15778
15779
15780
15781
15782
15783
15784
15785
15786
15787
15788
15789
15790
15791
15792
15793
15794
15795
15796
15797
15798
15799
15800
15801
15802
15803
15804
15805
15806
15807
15808
15809
15810
15811
15812
15813
15814
15815
15816
15817
15818
15819
15820
15821
15822
15823
15824
15825
15826
15827
15828
15829
15830
15831
15832
15833
15834
15835
15836
15837
15838
15839
15840
15841
15842
15843
15844
15845
15846
15847
15848
15849
15850
15851
15852
15853
15854
15855
15856
15857
15858
15859
15860
15861
15862
15863
15864
15865
15866
15867
15868
15869
15870
15871
15872
15873
15874
15875
15876
15877
15878
15879
15880
15881
15882
15883
15884
15885
15886
15887
15888
15889
15890
15891
15892
15893
15894
15895
15896
15897
15898
15899
15900
15901
15902
15903
15904
15905
15906
15907
15908
15909
15910
15911
15912
15913
15914
15915
15916
15917
15918
15919
15920
15921
15922
15923
15924
15925
15926
15927
15928
15929
15930
15931
15932
15933
15934
15935
15936
15937
15938
15939
15940
15941
15942
15943
15944
15945
15946
15947
15948
15949
15950
15951
15952
15953
15954
15955
15956
15957
15958
15959
15960
15961
15962
15963
15964
15965
15966
15967
15968
15969
15970
15971
15972
15973
15974
15975
15976
15977
15978
15979
15980
15981
15982
15983
15984
15985
15986
15987
15988
15989
15990
15991
15992
15993
15994
15995
15996
15997
15998
15999
16000
16001
16002
16003
16004
16005
16006
16007
16008
16009
16010
16011
16012
16013
16014
16015
16016
16017
16018
16019
16020
16021
16022
16023
16024
16025
16026
16027
16028
16029
16030
16031
16032
16033
16034
16035
16036
16037
16038
16039
16040
16041
16042
16043
16044
16045
16046
16047
16048
16049
16050
16051
16052
16053
16054
16055
16056
16057
16058
16059
16060
16061
16062
16063
16064
16065
16066
16067
16068
16069
16070
16071
16072
16073
16074
16075
16076
16077
16078
16079
16080
16081
16082
16083
16084
16085
16086
16087
16088
16089
16090
16091
16092
16093
16094
16095
16096
16097
16098
16099
16100
16101
16102
16103
16104
16105
16106
16107
16108
16109
16110
16111
16112
16113
16114
16115
16116
16117
16118
16119
16120
16121
16122
16123
16124
16125
16126
16127
16128
16129
16130
16131
16132
16133
16134
16135
16136
16137
16138
16139
16140
16141
16142
16143
16144
16145
16146
16147
16148
16149
16150
16151
16152
16153
16154
16155
16156
16157
16158
16159
16160
16161
16162
16163
16164
16165
16166
16167
16168
16169
16170
16171
16172
16173
16174
16175
16176
16177
16178
16179
16180
16181
16182
16183
16184
16185
16186
16187
16188
16189
16190
16191
16192
16193
16194
16195
16196
16197
16198
16199
16200
16201
16202
16203
16204
16205
16206
16207
16208
16209
16210
16211
16212
16213
16214
16215
16216
16217
16218
16219
16220
16221
16222
16223
16224
16225
16226
16227
16228
16229
16230
16231
16232
16233
16234
16235
16236
16237
16238
16239
16240
16241
16242
16243
16244
16245
16246
16247
16248
16249
16250
16251
16252
16253
16254
16255
16256
16257
16258
16259
16260
16261
16262
16263
16264
16265
16266
16267
16268
16269
16270
16271
16272
16273
16274
16275
16276
16277
16278
16279
16280
16281
16282
16283
16284
16285
16286
16287
16288
16289
16290
16291
16292
16293
16294
16295
16296
16297
16298
16299
16300
16301
16302
16303
16304
16305
16306
16307
16308
16309
16310
16311
16312
16313
16314
16315
16316
16317
16318
16319
16320
16321
16322
16323
16324
16325
16326
16327
16328
16329
16330
16331
16332
16333
16334
16335
16336
16337
16338
16339
16340
16341
16342
16343
16344
16345
16346
16347
16348
16349
16350
16351
16352
16353
16354
16355
16356
16357
16358
16359
16360
16361
16362
16363
16364
16365
16366
16367
16368
16369
16370
16371
16372
16373
16374
16375
16376
16377
16378
16379
16380
16381
16382
16383
16384
16385
16386
16387
16388
16389
16390
16391
16392
16393
16394
16395
16396
16397
16398
16399
16400
16401
16402
16403
16404
16405
16406
16407
16408
16409
16410
16411
16412
16413
16414
16415
16416
16417
16418
16419
16420
16421
16422
16423
16424
16425
16426
16427
16428
16429
16430
16431
16432
16433
16434
16435
16436
16437
16438
16439
16440
16441
16442
16443
16444
16445
16446
16447
16448
16449
16450
16451
16452
16453
16454
16455
16456
16457
16458
16459
16460
16461
16462
16463
16464
16465
16466
16467
16468
16469
16470
16471
16472
16473
16474
16475
16476
16477
16478
16479
16480
16481
16482
16483
16484
16485
16486
16487
16488
16489
16490
16491
16492
16493
16494
16495
16496
16497
16498
16499
16500
16501
16502
16503
16504
16505
16506
16507
16508
16509
16510
16511
16512
16513
16514
16515
16516
16517
16518
16519
16520
16521
16522
16523
16524
16525
16526
16527
16528
16529
16530
16531
16532
16533
16534
16535
16536
16537
16538
16539
16540
16541
16542
16543
16544
16545
16546
16547
16548
16549
16550
16551
16552
16553
16554
16555
16556
16557
16558
16559
16560
16561
16562
16563
16564
16565
16566
16567
16568
16569
16570
16571
16572
16573
16574
16575
16576
16577
16578
16579
16580
16581
16582
16583
16584
16585
16586
16587
16588
16589
16590
16591
16592
16593
16594
16595
16596
16597
16598
16599
16600
16601
16602
16603
16604
16605
16606
16607
16608
16609
16610
16611
16612
16613
16614
16615
16616
16617
16618
16619
16620
16621
16622
16623
16624
16625
16626
16627
16628
16629
16630
16631
16632
16633
16634
16635
16636
16637
16638
16639
16640
16641
16642
16643
16644
16645
16646
16647
16648
16649
16650
16651
16652
16653
16654
16655
16656
16657
16658
16659
16660
16661
16662
16663
16664
16665
16666
16667
16668
16669
16670
16671
16672
16673
16674
16675
16676
16677
16678
16679
16680
16681
16682
16683
16684
16685
16686
16687
16688
16689
16690
16691
16692
16693
16694
16695
16696
16697
16698
16699
16700
16701
16702
16703
16704
16705
16706
16707
16708
16709
16710
16711
16712
16713
16714
16715
16716
16717
16718
16719
16720
16721
16722
16723
16724
16725
16726
16727
16728
16729
16730
16731
16732
16733
16734
16735
16736
16737
16738
16739
16740
16741
16742
16743
16744
16745
16746
16747
16748
16749
16750
16751
16752
16753
16754
16755
16756
16757
16758
16759
16760
16761
16762
16763
16764
16765
16766
16767
16768
16769
16770
16771
16772
16773
16774
16775
16776
16777
16778
16779
16780
16781
16782
16783
16784
16785
16786
16787
16788
16789
16790
16791
16792
16793
16794
16795
16796
16797
16798
16799
16800
16801
16802
16803
16804
16805
16806
16807
16808
16809
16810
16811
16812
16813
16814
16815
16816
16817
16818
16819
16820
16821
16822
16823
16824
16825
16826
16827
16828
16829
16830
16831
16832
16833
16834
16835
16836
16837
16838
16839
16840
16841
16842
16843
16844
16845
16846
16847
16848
16849
16850
16851
16852
16853
16854
16855
16856
16857
16858
16859
16860
16861
16862
16863
16864
16865
16866
16867
16868
16869
16870
16871
16872
16873
16874
16875
16876
16877
16878
16879
16880
16881
16882
16883
16884
16885
16886
16887
16888
16889
16890
16891
16892
16893
16894
16895
16896
16897
16898
16899
16900
16901
16902
16903
16904
16905
16906
16907
16908
16909
16910
16911
16912
16913
16914
16915
16916
16917
16918
16919
16920
16921
16922
16923
16924
16925
16926
16927
16928
16929
16930
16931
16932
16933
16934
16935
16936
16937
16938
16939
16940
16941
16942
16943
16944
16945
16946
16947
16948
16949
16950
16951
16952
16953
16954
16955
16956
16957
16958
16959
16960
16961
16962
16963
16964
16965
16966
16967
16968
16969
16970
16971
16972
16973
16974
16975
16976
16977
16978
16979
16980
16981
16982
16983
16984
16985
16986
16987
16988
16989
16990
16991
16992
16993
16994
16995
16996
16997
16998
16999
17000
17001
17002
17003
17004
17005
17006
17007
17008
17009
17010
17011
17012
17013
17014
17015
17016
17017
17018
17019
17020
17021
17022
17023
17024
17025
17026
17027
17028
17029
17030
17031
17032
17033
17034
17035
17036
17037
17038
17039
17040
17041
17042
17043
17044
17045
17046
17047
17048
17049
17050
17051
17052
17053
17054
17055
17056
17057
17058
17059
17060
17061
17062
17063
17064
17065
17066
17067
17068
17069
17070
17071
17072
17073
17074
17075
17076
17077
17078
17079
17080
17081
17082
17083
17084
17085
17086
17087
17088
17089
17090
17091
17092
17093
17094
17095
17096
17097
17098
17099
17100
17101
17102
17103
17104
17105
17106
17107
17108
17109
17110
17111
17112
17113
17114
17115
17116
17117
17118
17119
17120
17121
17122
17123
17124
17125
17126
17127
17128
17129
17130
17131
17132
17133
17134
17135
17136
17137
17138
17139
17140
17141
17142
17143
17144
17145
17146
17147
17148
17149
17150
17151
17152
17153
17154
17155
17156
17157
17158
17159
17160
17161
17162
17163
17164
17165
17166
17167
17168
17169
17170
17171
17172
17173
17174
17175
17176
17177
17178
17179
17180
17181
17182
17183
17184
17185
17186
17187
17188
17189
17190
17191
17192
17193
17194
17195
17196
17197
17198
17199
17200
17201
17202
17203
17204
17205
17206
17207
17208
17209
17210
17211
17212
17213
17214
17215
17216
17217
17218
17219
17220
17221
17222
17223
17224
17225
17226
17227
17228
17229
17230
17231
17232
17233
17234
17235
17236
17237
17238
17239
17240
17241
17242
17243
17244
17245
17246
17247
17248
17249
17250
17251
17252
17253
17254
17255
17256
17257
17258
17259
17260
17261
17262
17263
17264
17265
17266
17267
17268
17269
17270
17271
17272
17273
17274
17275
17276
17277
17278
17279
17280
17281
17282
17283
17284
17285
17286
17287
17288
17289
17290
17291
17292
17293
17294
17295
17296
17297
17298
17299
17300
17301
17302
17303
17304
17305
17306
17307
17308
17309
17310
17311
17312
17313
17314
17315
17316
17317
17318
17319
17320
17321
17322
17323
17324
17325
17326
17327
17328
17329
17330
17331
17332
17333
17334
17335
17336
17337
17338
17339
17340
17341
17342
17343
17344
17345
17346
17347
17348
17349
17350
17351
17352
17353
17354
17355
17356
17357
17358
17359
17360
17361
17362
17363
17364
17365
17366
17367
17368
17369
17370
17371
17372
17373
17374
17375
17376
17377
17378
17379
17380
17381
17382
17383
17384
17385
17386
17387
17388
17389
17390
17391
17392
17393
17394
17395
17396
17397
17398
17399
17400
17401
17402
17403
17404
17405
17406
17407
17408
17409
17410
17411
17412
17413
17414
17415
17416
17417
17418
17419
17420
17421
17422
17423
17424
17425
17426
17427
17428
17429
17430
17431
17432
17433
17434
17435
17436
17437
17438
17439
17440
17441
17442
17443
17444
17445
17446
17447
17448
17449
17450
17451
17452
17453
17454
17455
17456
17457
17458
17459
17460
17461
17462
17463
17464
17465
17466
17467
17468
17469
17470
17471
17472
17473
17474
17475
17476
17477
17478
17479
17480
17481
17482
17483
17484
17485
17486
17487
17488
17489
17490
17491
17492
17493
17494
17495
17496
17497
17498
17499
17500
17501
17502
17503
17504
17505
17506
17507
17508
17509
17510
17511
17512
17513
17514
17515
17516
17517
17518
17519
17520
17521
17522
17523
17524
17525
17526
17527
17528
17529
17530
17531
17532
17533
17534
17535
17536
17537
17538
17539
17540
17541
17542
17543
17544
17545
17546
17547
17548
17549
17550
17551
17552
17553
17554
17555
17556
17557
17558
17559
17560
17561
17562
17563
17564
17565
17566
17567
17568
17569
17570
17571
17572
17573
17574
17575
17576
17577
17578
17579
17580
17581
17582
17583
17584
17585
17586
17587
17588
17589
17590
17591
17592
17593
17594
17595
17596
17597
17598
17599
17600
17601
17602
17603
17604
17605
17606
17607
17608
17609
17610
17611
17612
17613
17614
17615
17616
17617
17618
17619
17620
17621
17622
17623
17624
17625
17626
17627
17628
17629
17630
17631
17632
17633
17634
17635
17636
17637
17638
17639
17640
17641
17642
17643
17644
17645
17646
17647
17648
17649
17650
17651
17652
17653
17654
17655
17656
17657
17658
17659
17660
17661
17662
17663
17664
17665
17666
17667
17668
17669
17670
17671
17672
17673
17674
17675
17676
17677
17678
17679
17680
17681
17682
17683
17684
17685
17686
17687
17688
17689
17690
17691
17692
17693
17694
17695
17696
17697
17698
17699
17700
17701
17702
17703
17704
17705
17706
17707
17708
17709
17710
17711
17712
17713
17714
17715
17716
17717
17718
17719
17720
17721
17722
17723
17724
17725
17726
17727
17728
17729
17730
17731
17732
17733
17734
17735
17736
17737
17738
17739
17740
17741
17742
17743
17744
17745
17746
17747
17748
17749
17750
17751
17752
17753
17754
17755
17756
17757
17758
17759
17760
17761
17762
17763
17764
17765
17766
17767
17768
17769
17770
17771
17772
17773
17774
17775
17776
17777
17778
17779
17780
17781
17782
17783
17784
17785
17786
17787
17788
17789
17790
17791
17792
17793
17794
17795
17796
17797
17798
17799
17800
17801
17802
17803
17804
17805
17806
17807
17808
17809
17810
17811
17812
17813
17814
17815
17816
17817
17818
17819
17820
17821
17822
17823
17824
17825
17826
17827
17828
17829
17830
17831
17832
17833
17834
17835
17836
17837
17838
17839
17840
17841
17842
17843
17844
17845
17846
17847
17848
17849
17850
17851
17852
17853
17854
17855
17856
17857
17858
17859
17860
17861
17862
17863
17864
17865
17866
17867
17868
17869
17870
17871
17872
17873
17874
17875
17876
17877
17878
17879
17880
17881
17882
17883
17884
17885
17886
17887
17888
17889
17890
17891
17892
17893
17894
17895
17896
17897
17898
17899
17900
17901
17902
17903
17904
17905
17906
17907
17908
17909
17910
17911
17912
17913
17914
17915
17916
17917
17918
17919
17920
17921
17922
17923
17924
17925
17926
17927
17928
17929
17930
17931
17932
17933
17934
17935
17936
17937
17938
17939
17940
17941
17942
17943
17944
17945
17946
17947
17948
17949
17950
17951
17952
17953
17954
17955
17956
17957
17958
17959
17960
17961
17962
17963
17964
17965
17966
17967
17968
17969
17970
17971
17972
17973
17974
17975
17976
17977
17978
17979
17980
17981
17982
17983
17984
17985
17986
17987
17988
17989
17990
17991
17992
17993
17994
17995
17996
17997
17998
17999
18000
18001
18002
18003
18004
18005
18006
18007
18008
18009
18010
18011
18012
18013
18014
18015
18016
18017
18018
18019
18020
18021
18022
18023
18024
18025
18026
18027
18028
18029
18030
18031
18032
18033
18034
18035
18036
18037
18038
18039
18040
18041
18042
18043
18044
18045
18046
18047
18048
18049
18050
18051
18052
18053
18054
18055
18056
18057
18058
18059
18060
18061
18062
18063
18064
18065
18066
18067
18068
18069
18070
18071
18072
18073
18074
18075
18076
18077
18078
18079
18080
18081
18082
18083
18084
18085
18086
18087
18088
18089
18090
18091
18092
18093
18094
18095
18096
18097
18098
18099
18100
18101
18102
18103
18104
18105
18106
18107
18108
18109
18110
18111
18112
18113
18114
18115
18116
18117
18118
18119
18120
18121
18122
18123
18124
18125
18126
18127
18128
18129
18130
18131
18132
18133
18134
18135
18136
18137
18138
18139
18140
18141
18142
18143
18144
18145
18146
18147
18148
18149
18150
18151
18152
18153
18154
18155
18156
18157
18158
18159
18160
18161
18162
18163
18164
18165
18166
18167
18168
18169
18170
18171
18172
18173
18174
18175
18176
18177
18178
18179
18180
18181
18182
18183
18184
18185
18186
18187
18188
18189
18190
18191
18192
18193
18194
18195
18196
18197
18198
18199
18200
18201
18202
18203
18204
18205
18206
18207
18208
18209
18210
18211
18212
18213
18214
18215
18216
18217
18218
18219
18220
18221
18222
18223
18224
18225
18226
18227
18228
18229
18230
18231
18232
18233
18234
18235
18236
18237
18238
18239
18240
18241
18242
18243
18244
18245
18246
18247
18248
18249
18250
18251
18252
18253
18254
18255
18256
18257
18258
18259
18260
18261
18262
18263
18264
18265
18266
18267
18268
18269
18270
18271
18272
18273
18274
18275
18276
18277
18278
18279
18280
18281
18282
18283
18284
18285
18286
18287
18288
18289
18290
18291
18292
18293
18294
18295
18296
18297
18298
18299
18300
18301
18302
18303
18304
18305
18306
18307
18308
18309
18310
18311
18312
18313
18314
18315
18316
18317
18318
18319
18320
18321
18322
18323
18324
18325
18326
18327
18328
18329
18330
18331
18332
18333
18334
18335
18336
18337
18338
18339
18340
18341
18342
18343
18344
18345
18346
18347
18348
18349
18350
18351
18352
18353
18354
18355
18356
18357
18358
18359
18360
18361
18362
18363
18364
18365
18366
18367
18368
18369
18370
18371
18372
18373
18374
18375
18376
18377
18378
18379
18380
18381
18382
18383
18384
18385
18386
18387
18388
18389
18390
18391
18392
18393
18394
18395
18396
18397
18398
18399
18400
18401
18402
18403
18404
18405
18406
18407
18408
18409
18410
18411
18412
18413
18414
18415
18416
18417
18418
18419
18420
18421
18422
18423
18424
18425
18426
18427
18428
18429
18430
18431
18432
18433
18434
18435
18436
18437
18438
18439
18440
18441
18442
18443
18444
18445
18446
18447
18448
18449
18450
18451
18452
18453
18454
18455
18456
18457
18458
18459
18460
18461
18462
18463
18464
18465
18466
18467
18468
18469
18470
18471
18472
18473
18474
18475
18476
18477
18478
18479
18480
18481
18482
18483
18484
18485
18486
18487
18488
18489
18490
18491
18492
18493
18494
18495
18496
18497
18498
18499
18500
18501
18502
18503
18504
18505
18506
18507
18508
18509
18510
18511
18512
18513
18514
18515
18516
18517
18518
18519
18520
18521
18522
18523
18524
18525
18526
18527
18528
18529
18530
18531
18532
18533
18534
18535
18536
18537
18538
18539
18540
18541
18542
18543
18544
18545
18546
18547
18548
18549
18550
18551
18552
18553
18554
18555
18556
18557
18558
18559
18560
18561
18562
18563
18564
18565
18566
18567
18568
18569
18570
18571
18572
18573
18574
18575
18576
18577
18578
18579
18580
18581
18582
18583
18584
18585
18586
18587
18588
18589
18590
18591
18592
18593
18594
18595
18596
18597
18598
18599
18600
18601
18602
18603
18604
18605
18606
18607
18608
18609
18610
18611
18612
18613
18614
18615
18616
18617
18618
18619
18620
18621
18622
18623
18624
18625
18626
18627
18628
18629
18630
18631
18632
18633
18634
18635
18636
18637
18638
18639
18640
18641
18642
18643
18644
18645
18646
18647
18648
18649
18650
18651
18652
18653
18654
18655
18656
18657
18658
18659
18660
18661
18662
18663
18664
18665
18666
18667
18668
18669
18670
18671
18672
18673
18674
18675
18676
18677
18678
18679
18680
18681
18682
18683
18684
18685
18686
18687
18688
18689
18690
18691
18692
18693
18694
18695
18696
18697
18698
18699
18700
18701
18702
18703
18704
18705
18706
18707
18708
18709
18710
18711
18712
18713
18714
18715
18716
18717
18718
18719
18720
18721
18722
18723
18724
18725
18726
18727
18728
18729
18730
18731
18732
18733
18734
18735
18736
18737
18738
18739
18740
18741
18742
18743
18744
18745
18746
18747
18748
18749
18750
18751
18752
18753
18754
18755
18756
18757
18758
18759
18760
18761
18762
18763
18764
18765
18766
18767
18768
18769
18770
18771
18772
18773
18774
18775
18776
18777
18778
18779
18780
18781
18782
18783
18784
18785
18786
18787
18788
18789
18790
18791
18792
18793
18794
18795
18796
18797
18798
18799
18800
18801
18802
18803
18804
18805
18806
18807
18808
18809
18810
18811
18812
18813
18814
18815
18816
18817
18818
18819
18820
18821
18822
18823
18824
18825
18826
18827
18828
18829
18830
18831
18832
18833
18834
18835
18836
18837
18838
18839
18840
18841
18842
18843
18844
18845
18846
18847
18848
18849
18850
18851
18852
18853
18854
18855
18856
18857
18858
18859
18860
18861
18862
18863
18864
18865
18866
18867
18868
18869
18870
18871
18872
18873
18874
18875
18876
18877
18878
18879
18880
18881
18882
18883
18884
18885
18886
18887
18888
18889
18890
18891
18892
18893
18894
18895
18896
18897
18898
18899
18900
18901
18902
18903
18904
18905
18906
18907
18908
18909
18910
18911
18912
18913
18914
18915
18916
18917
18918
18919
18920
18921
18922
18923
18924
18925
18926
18927
18928
18929
18930
18931
18932
18933
18934
18935
18936
18937
18938
18939
18940
18941
18942
18943
18944
18945
18946
18947
18948
18949
18950
18951
18952
18953
18954
18955
18956
18957
18958
18959
18960
18961
18962
18963
18964
18965
18966
18967
18968
18969
18970
18971
18972
18973
18974
18975
18976
18977
18978
18979
18980
18981
18982
18983
18984
18985
18986
18987
18988
18989
18990
18991
18992
18993
18994
18995
18996
18997
18998
18999
19000
19001
19002
19003
19004
19005
19006
19007
19008
19009
19010
19011
19012
19013
19014
19015
19016
19017
19018
19019
19020
19021
19022
19023
19024
19025
19026
19027
19028
19029
19030
19031
19032
19033
19034
19035
19036
19037
19038
19039
19040
19041
19042
19043
19044
19045
19046
19047
19048
19049
19050
19051
19052
19053
19054
19055
19056
19057
19058
19059
19060
19061
19062
19063
19064
19065
19066
19067
19068
19069
19070
19071
19072
19073
19074
19075
19076
19077
19078
19079
19080
19081
19082
19083
19084
19085
19086
19087
19088
19089
19090
19091
19092
19093
19094
19095
19096
19097
19098
19099
19100
19101
19102
19103
19104
19105
19106
19107
19108
19109
19110
19111
19112
19113
19114
19115
19116
19117
19118
19119
19120
19121
19122
19123
19124
19125
19126
19127
19128
19129
19130
19131
19132
19133
19134
19135
19136
19137
19138
19139
19140
19141
19142
19143
19144
19145
19146
19147
19148
19149
19150
19151
19152
19153
19154
19155
19156
19157
19158
19159
19160
19161
19162
19163
19164
19165
19166
19167
19168
19169
19170
19171
19172
19173
19174
19175
19176
19177
19178
19179
19180
19181
19182
19183
19184
19185
19186
19187
19188
19189
19190
19191
19192
19193
19194
19195
19196
19197
19198
19199
19200
19201
19202
19203
19204
19205
19206
19207
19208
19209
19210
19211
19212
19213
19214
19215
19216
19217
19218
19219
19220
19221
19222
19223
19224
19225
19226
19227
19228
19229
19230
19231
19232
19233
19234
19235
19236
19237
19238
19239
19240
19241
19242
19243
19244
19245
19246
19247
19248
19249
19250
19251
19252
19253
19254
19255
19256
19257
19258
19259
19260
19261
19262
19263
19264
19265
19266
19267
19268
19269
19270
19271
19272
19273
19274
19275
19276
19277
19278
19279
19280
19281
19282
19283
19284
19285
19286
19287
19288
19289
19290
19291
19292
19293
19294
19295
19296
19297
19298
19299
19300
19301
19302
19303
19304
19305
19306
19307
19308
19309
19310
19311
19312
19313
19314
19315
19316
19317
19318
19319
19320
19321
19322
19323
19324
19325
19326
19327
19328
19329
19330
19331
19332
19333
19334
19335
19336
19337
19338
19339
19340
19341
19342
19343
19344
19345
19346
19347
19348
19349
19350
19351
19352
19353
19354
19355
19356
19357
19358
19359
19360
19361
19362
19363
19364
19365
19366
19367
19368
19369
19370
19371
19372
19373
19374
19375
19376
19377
19378
19379
19380
19381
19382
19383
19384
19385
19386
19387
19388
19389
19390
19391
19392
19393
19394
19395
19396
19397
19398
19399
19400
19401
19402
19403
19404
19405
19406
19407
19408
19409
19410
19411
19412
19413
19414
19415
19416
19417
19418
19419
19420
19421
19422
19423
19424
19425
19426
19427
19428
19429
19430
19431
19432
19433
19434
19435
19436
19437
19438
19439
19440
19441
19442
19443
19444
19445
19446
19447
19448
19449
19450
19451
19452
19453
19454
19455
19456
19457
19458
19459
19460
19461
19462
19463
19464
19465
19466
19467
19468
19469
19470
19471
19472
19473
19474
19475
19476
19477
19478
19479
19480
19481
19482
19483
19484
19485
19486
19487
19488
19489
19490
19491
19492
19493
19494
19495
19496
19497
19498
19499
19500
19501
19502
19503
19504
19505
19506
19507
19508
19509
19510
19511
19512
19513
19514
19515
19516
19517
19518
19519
19520
19521
19522
19523
19524
19525
19526
19527
19528
19529
19530
19531
19532
19533
19534
19535
19536
19537
19538
19539
19540
19541
19542
19543
19544
19545
19546
19547
19548
19549
19550
19551
19552
19553
19554
19555
19556
19557
19558
19559
19560
19561
19562
19563
19564
19565
19566
19567
19568
19569
19570
19571
19572
19573
19574
19575
19576
19577
19578
19579
19580
19581
19582
19583
19584
19585
19586
19587
19588
19589
19590
19591
19592
19593
19594
19595
19596
19597
19598
19599
19600
19601
19602
19603
19604
19605
19606
19607
19608
19609
19610
19611
19612
19613
19614
19615
19616
19617
19618
19619
19620
19621
19622
19623
19624
19625
19626
19627
19628
19629
19630
19631
19632
19633
19634
19635
19636
19637
19638
19639
19640
19641
19642
19643
19644
19645
19646
19647
19648
19649
19650
19651
19652
19653
19654
19655
19656
19657
19658
19659
19660
19661
19662
19663
19664
19665
19666
19667
19668
19669
19670
19671
19672
19673
19674
19675
19676
19677
19678
19679
19680
19681
19682
19683
19684
19685
19686
19687
19688
19689
19690
19691
19692
19693
19694
19695
19696
19697
19698
19699
19700
19701
19702
19703
19704
19705
19706
19707
19708
19709
19710
19711
19712
19713
19714
19715
19716
19717
19718
19719
19720
19721
19722
19723
19724
19725
19726
19727
19728
19729
19730
19731
19732
19733
19734
19735
19736
19737
19738
19739
19740
19741
19742
19743
19744
19745
19746
19747
19748
19749
19750
19751
19752
19753
19754
19755
19756
19757
19758
19759
19760
19761
19762
19763
19764
19765
19766
19767
19768
19769
19770
19771
19772
19773
19774
19775
19776
19777
19778
19779
19780
19781
19782
19783
19784
19785
19786
19787
19788
19789
19790
19791
19792
19793
19794
19795
19796
19797
19798
19799
19800
19801
19802
19803
19804
19805
19806
19807
19808
19809
19810
19811
19812
19813
19814
19815
19816
19817
19818
19819
19820
19821
19822
19823
19824
19825
19826
19827
19828
19829
19830
19831
19832
19833
19834
19835
19836
19837
19838
19839
19840
19841
19842
19843
19844
19845
19846
19847
19848
19849
19850
19851
19852
19853
19854
19855
19856
19857
19858
19859
19860
19861
19862
19863
19864
19865
19866
19867
19868
19869
19870
19871
19872
19873
19874
19875
19876
19877
19878
19879
19880
19881
19882
19883
19884
19885
19886
19887
19888
19889
19890
19891
19892
19893
19894
19895
19896
19897
19898
19899
19900
19901
19902
19903
19904
19905
19906
19907
19908
19909
19910
19911
19912
19913
19914
19915
19916
19917
19918
19919
19920
19921
19922
19923
19924
19925
19926
19927
19928
19929
19930
19931
19932
19933
19934
19935
19936
19937
19938
19939
19940
19941
19942
19943
19944
19945
19946
19947
19948
19949
19950
19951
19952
19953
19954
19955
19956
19957
19958
19959
19960
19961
19962
19963
19964
19965
19966
19967
19968
19969
19970
19971
19972
19973
19974
19975
19976
19977
19978
19979
19980
19981
19982
19983
19984
19985
19986
19987
19988
19989
19990
19991
19992
19993
19994
19995
19996
19997
19998
19999
20000
20001
20002
20003
20004
20005
20006
20007
20008
20009
20010
20011
20012
20013
20014
20015
20016
20017
20018
20019
20020
20021
20022
20023
20024
20025
20026
20027
20028
20029
20030
20031
20032
20033
20034
20035
20036
20037
20038
20039
20040
20041
20042
20043
20044
20045
20046
20047
20048
20049
20050
20051
20052
20053
20054
20055
20056
20057
20058
20059
20060
20061
20062
20063
20064
20065
20066
20067
20068
20069
20070
20071
20072
20073
20074
20075
20076
20077
20078
20079
20080
20081
20082
20083
20084
20085
20086
20087
20088
20089
20090
20091
20092
20093
20094
20095
20096
20097
20098
20099
20100
20101
20102
20103
20104
20105
20106
20107
20108
20109
20110
20111
20112
20113
20114
20115
20116
20117
20118
20119
20120
20121
20122
20123
20124
20125
20126
20127
20128
20129
20130
20131
20132
20133
20134
20135
20136
20137
20138
20139
20140
20141
20142
20143
20144
20145
20146
20147
20148
20149
20150
20151
20152
20153
20154
20155
20156
20157
20158
20159
20160
20161
20162
20163
20164
20165
20166
20167
20168
20169
20170
20171
20172
20173
20174
20175
20176
20177
20178
20179
20180
20181
20182
20183
20184
20185
20186
20187
20188
20189
20190
20191
20192
20193
20194
20195
20196
20197
20198
20199
20200
20201
20202
20203
20204
20205
20206
20207
20208
20209
20210
20211
20212
20213
20214
20215
20216
20217
20218
20219
20220
20221
20222
20223
20224
20225
20226
20227
20228
20229
20230
20231
20232
20233
20234
20235
20236
20237
20238
20239
20240
20241
20242
20243
20244
20245
20246
20247
20248
20249
20250
20251
20252
20253
20254
20255
20256
20257
20258
20259
20260
20261
20262
20263
20264
20265
20266
20267
20268
20269
20270
20271
20272
20273
20274
20275
20276
20277
20278
20279
20280
20281
20282
20283
20284
20285
20286
20287
20288
20289
20290
20291
20292
20293
20294
20295
20296
20297
20298
20299
20300
20301
20302
20303
20304
20305
20306
20307
20308
20309
20310
20311
20312
20313
20314
20315
20316
20317
20318
20319
20320
20321
20322
20323
20324
20325
20326
20327
20328
20329
20330
20331
20332
20333
20334
20335
20336
20337
20338
20339
20340
20341
20342
20343
20344
20345
20346
20347
20348
20349
20350
20351
20352
20353
20354
20355
20356
20357
20358
20359
20360
20361
20362
20363
20364
20365
20366
20367
20368
20369
20370
20371
20372
20373
20374
20375
20376
20377
20378
20379
20380
20381
20382
20383
20384
20385
20386
20387
20388
20389
20390
20391
20392
20393
20394
20395
20396
20397
20398
20399
20400
20401
20402
20403
20404
20405
20406
20407
20408
20409
20410
20411
20412
20413
20414
20415
20416
20417
20418
20419
20420
20421
20422
20423
20424
20425
20426
20427
20428
20429
20430
20431
20432
20433
20434
20435
20436
20437
20438
20439
20440
20441
20442
20443
20444
20445
20446
20447
20448
20449
20450
20451
20452
20453
20454
20455
20456
20457
20458
20459
20460
20461
20462
20463
20464
20465
20466
20467
20468
20469
20470
20471
20472
20473
20474
20475
20476
20477
20478
20479
20480
20481
20482
20483
20484
20485
20486
20487
20488
20489
20490
20491
20492
20493
20494
20495
20496
20497
20498
20499
20500
20501
20502
20503
20504
20505
20506
20507
20508
20509
20510
20511
20512
20513
20514
20515
20516
20517
20518
20519
20520
20521
20522
20523
20524
20525
20526
20527
20528
20529
20530
20531
20532
20533
20534
20535
20536
20537
20538
20539
20540
20541
20542
20543
20544
20545
20546
20547
20548
20549
20550
20551
20552
20553
20554
20555
20556
20557
20558
20559
20560
20561
20562
20563
20564
20565
20566
20567
20568
20569
20570
20571
20572
20573
20574
20575
20576
20577
20578
20579
20580
20581
20582
20583
20584
20585
20586
20587
20588
20589
20590
20591
20592
20593
20594
20595
20596
20597
20598
20599
20600
20601
20602
20603
20604
20605
20606
20607
20608
20609
20610
20611
20612
20613
20614
20615
20616
20617
20618
20619
20620
20621
20622
20623
20624
20625
20626
20627
20628
20629
20630
20631
20632
20633
20634
20635
20636
20637
20638
20639
20640
20641
20642
20643
20644
20645
20646
20647
20648
20649
20650
20651
20652
20653
20654
20655
20656
20657
20658
20659
20660
20661
20662
20663
20664
20665
20666
20667
20668
20669
20670
20671
20672
20673
20674
20675
20676
20677
20678
20679
20680
20681
20682
20683
20684
20685
20686
20687
20688
20689
20690
20691
20692
20693
20694
20695
20696
20697
20698
20699
20700
20701
20702
20703
20704
20705
20706
20707
20708
20709
20710
20711
20712
20713
20714
20715
20716
20717
20718
20719
20720
20721
20722
20723
20724
20725
20726
20727
20728
20729
20730
20731
20732
20733
20734
20735
20736
20737
20738
20739
20740
20741
20742
20743
20744
20745
20746
20747
20748
20749
20750
20751
20752
20753
20754
20755
20756
20757
20758
20759
20760
20761
20762
20763
20764
20765
20766
20767
20768
20769
20770
20771
20772
20773
20774
20775
20776
20777
20778
20779
20780
20781
20782
20783
20784
20785
20786
20787
20788
20789
20790
20791
20792
20793
20794
20795
20796
20797
20798
20799
20800
20801
20802
20803
20804
20805
20806
20807
20808
20809
20810
20811
20812
20813
20814
20815
20816
20817
20818
20819
20820
20821
20822
20823
20824
20825
20826
20827
20828
20829
20830
20831
20832
20833
20834
20835
20836
20837
20838
20839
20840
20841
20842
20843
20844
20845
20846
20847
20848
20849
20850
20851
20852
20853
20854
20855
20856
20857
20858
20859
20860
20861
20862
20863
20864
20865
20866
20867
20868
20869
20870
20871
20872
20873
20874
20875
20876
20877
20878
20879
20880
20881
20882
20883
20884
20885
20886
20887
20888
20889
20890
20891
20892
20893
20894
20895
20896
20897
20898
20899
20900
20901
20902
20903
20904
20905
20906
20907
20908
20909
20910
20911
20912
20913
20914
20915
20916
20917
20918
20919
20920
20921
20922
20923
20924
20925
20926
20927
20928
20929
20930
20931
20932
20933
20934
20935
20936
20937
20938
20939
20940
20941
20942
20943
20944
20945
20946
20947
20948
20949
20950
20951
20952
20953
20954
20955
20956
20957
20958
20959
20960
20961
20962
20963
20964
20965
20966
20967
20968
20969
20970
20971
20972
20973
20974
20975
20976
20977
20978
20979
20980
20981
20982
20983
20984
20985
20986
20987
20988
20989
20990
20991
20992
20993
20994
20995
20996
20997
20998
20999
21000
21001
21002
21003
21004
21005
21006
21007
21008
21009
21010
21011
21012
21013
21014
21015
21016
21017
21018
21019
21020
21021
21022
21023
21024
21025
21026
21027
21028
21029
21030
21031
21032
21033
21034
21035
21036
21037
21038
21039
21040
21041
21042
21043
21044
21045
21046
21047
21048
21049
21050
21051
21052
21053
21054
21055
21056
21057
21058
21059
21060
21061
21062
21063
21064
21065
21066
21067
21068
21069
21070
21071
21072
21073
21074
21075
21076
21077
21078
21079
21080
21081
21082
21083
21084
21085
21086
21087
21088
21089
21090
21091
21092
21093
21094
21095
21096
21097
21098
21099
21100
21101
21102
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<!-- Copyright (C) 1999-2008 Free Software Foundation, Inc.

Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.2 or
any later version published by the Free Software Foundation; with the
Invariant Sections being "Funding Free Software", the Front-Cover
Texts being (a) (see below), and with the Back-Cover Texts being (b)
(see below).  A copy of the license is included in the section entitled
"GNU Free Documentation License".

(a) The FSF's Front-Cover Text is:

A GNU Manual

(b) The FSF's Back-Cover Text is:

You have freedom to copy and modify this GNU Manual, like GNU
     software.  Copies published by the Free Software Foundation raise
     funds for GNU development. -->
<!-- Created by GNU Texinfo 5.2, http://www.gnu.org/software/texinfo/ -->
<head>
<title>The GNU Fortran Compiler</title>

<meta name="description" content="The GNU Fortran Compiler">
<meta name="keywords" content="The GNU Fortran Compiler">
<meta name="resource-type" content="document">
<meta name="distribution" content="global">
<meta name="Generator" content="makeinfo">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<link href="#Top" rel="start" title="Top">
<link href="#Option-Index" rel="index" title="Option Index">
<link href="#SEC_Contents" rel="contents" title="Table of Contents">
<link href="dir.html#Top" rel="up" title="(dir)">
<style type="text/css">
<!--
a.summary-letter {text-decoration: none}
blockquote.smallquotation {font-size: smaller}
div.display {margin-left: 3.2em}
div.example {margin-left: 3.2em}
div.indentedblock {margin-left: 3.2em}
div.lisp {margin-left: 3.2em}
div.smalldisplay {margin-left: 3.2em}
div.smallexample {margin-left: 3.2em}
div.smallindentedblock {margin-left: 3.2em; font-size: smaller}
div.smalllisp {margin-left: 3.2em}
kbd {font-style:oblique}
pre.display {font-family: inherit}
pre.format {font-family: inherit}
pre.menu-comment {font-family: serif}
pre.menu-preformatted {font-family: serif}
pre.smalldisplay {font-family: inherit; font-size: smaller}
pre.smallexample {font-size: smaller}
pre.smallformat {font-family: inherit; font-size: smaller}
pre.smalllisp {font-size: smaller}
span.nocodebreak {white-space:nowrap}
span.nolinebreak {white-space:nowrap}
span.roman {font-family:serif; font-weight:normal}
span.sansserif {font-family:sans-serif; font-weight:normal}
ul.no-bullet {list-style: none}
-->
</style>


</head>

<body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000">
<h1 class="settitle" align="center">The GNU Fortran Compiler</h1>























<a name="SEC_Overview"></a>
<h2 class="shortcontents-heading">Short Table of Contents</h2>

<div class="shortcontents">
<ul class="no-bullet">
<li><a name="stoc-Introduction-2" href="#toc-Introduction-2">1 Introduction</a></li>
<li><a name="stoc-GNU-Fortran-Command-Options" href="#toc-GNU-Fortran-Command-Options">2 GNU Fortran Command Options</a></li>
<li><a name="stoc-Runtime_003a-Influencing-runtime-behavior-with-environment-variables" href="#toc-Runtime_003a-Influencing-runtime-behavior-with-environment-variables">3 Runtime:  Influencing runtime behavior with environment variables</a></li>
<li><a name="stoc-Fortran-2003-and-2008-Status" href="#toc-Fortran-2003-and-2008-Status">4 Fortran 2003 and 2008 Status</a></li>
<li><a name="stoc-Compiler-Characteristics-1" href="#toc-Compiler-Characteristics-1">5 Compiler Characteristics</a></li>
<li><a name="stoc-Extensions-1" href="#toc-Extensions-1">6 Extensions</a></li>
<li><a name="stoc-Intrinsic-Procedures-1" href="#toc-Intrinsic-Procedures-1">7 Intrinsic Procedures</a></li>
<li><a name="stoc-Intrinsic-Modules-1" href="#toc-Intrinsic-Modules-1">8 Intrinsic Modules</a></li>
<li><a name="stoc-Contributing-1" href="#toc-Contributing-1">Contributing</a></li>
<li><a name="stoc-GNU-General-Public-License" href="#toc-GNU-General-Public-License">GNU General Public License</a></li>
<li><a name="stoc-GNU-Free-Documentation-License-1" href="#toc-GNU-Free-Documentation-License-1">GNU Free Documentation License</a></li>
<li><a name="stoc-Funding-Free-Software" href="#toc-Funding-Free-Software">Funding Free Software</a></li>
<li><a name="stoc-Option-Index-1" href="#toc-Option-Index-1">Option Index</a></li>
<li><a name="stoc-Keyword-Index-1" href="#toc-Keyword-Index-1">Keyword Index</a></li>
</ul>
</div>


<a name="SEC_Contents"></a>
<h2 class="contents-heading">Table of Contents</h2>

<div class="contents">

<ul class="no-bullet">
  <li><a name="toc-Introduction-2" href="#Introduction">1 Introduction</a>
  <ul class="no-bullet">
    <li><a name="toc-About-GNU-Fortran-1" href="#About-GNU-Fortran">1.1 About GNU Fortran</a></li>
    <li><a name="toc-GNU-Fortran-and-GCC-1" href="#GNU-Fortran-and-GCC">1.2 GNU Fortran and GCC</a></li>
    <li><a name="toc-Preprocessing-and-conditional-compilation-1" href="#Preprocessing-and-conditional-compilation">1.3 Preprocessing and conditional compilation</a></li>
    <li><a name="toc-GNU-Fortran-and-G77-1" href="#GNU-Fortran-and-G77">1.4 GNU Fortran and G77</a></li>
    <li><a name="toc-Project-Status-1" href="#Project-Status">1.5 Project Status</a></li>
    <li><a name="toc-Standards-1" href="#Standards">1.6 Standards</a></li>
  </ul></li>
  <li><a name="toc-GNU-Fortran-Command-Options" href="#Invoking-GNU-Fortran">2 GNU Fortran Command Options</a>
  <ul class="no-bullet">
    <li><a name="toc-Option-summary" href="#Option-Summary">2.1 Option summary</a></li>
    <li><a name="toc-Options-controlling-Fortran-dialect" href="#Fortran-Dialect-Options">2.2 Options controlling Fortran dialect</a></li>
    <li><a name="toc-Enable-and-customize-preprocessing" href="#Preprocessing-Options">2.3 Enable and customize preprocessing</a></li>
    <li><a name="toc-Options-to-request-or-suppress-errors-and-warnings" href="#Error-and-Warning-Options">2.4 Options to request or suppress errors and warnings</a></li>
    <li><a name="toc-Options-for-debugging-your-program-or-GNU-Fortran" href="#Debugging-Options">2.5 Options for debugging your program or GNU Fortran</a></li>
    <li><a name="toc-Options-for-directory-search" href="#Directory-Options">2.6 Options for directory search</a></li>
    <li><a name="toc-Influencing-the-linking-step" href="#Link-Options">2.7 Influencing the linking step</a></li>
    <li><a name="toc-Influencing-runtime-behavior" href="#Runtime-Options">2.8 Influencing runtime behavior</a></li>
    <li><a name="toc-Options-for-code-generation-conventions" href="#Code-Gen-Options">2.9 Options for code generation conventions</a></li>
    <li><a name="toc-Environment-variables-affecting-gfortran" href="#Environment-Variables">2.10 Environment variables affecting <code>gfortran</code></a></li>
  </ul></li>
  <li><a name="toc-Runtime_003a-Influencing-runtime-behavior-with-environment-variables" href="#Runtime">3 Runtime:  Influencing runtime behavior with environment variables</a>
  <ul class="no-bullet">
    <li><a name="toc-GFORTRAN_005fSTDIN_005fUNIT_002d_002d_002dUnit-number-for-standard-input" href="#GFORTRAN_005fSTDIN_005fUNIT">3.1 <code>GFORTRAN_STDIN_UNIT</code>&mdash;Unit number for standard input</a></li>
    <li><a name="toc-GFORTRAN_005fSTDOUT_005fUNIT_002d_002d_002dUnit-number-for-standard-output" href="#GFORTRAN_005fSTDOUT_005fUNIT">3.2 <code>GFORTRAN_STDOUT_UNIT</code>&mdash;Unit number for standard output</a></li>
    <li><a name="toc-GFORTRAN_005fSTDERR_005fUNIT_002d_002d_002dUnit-number-for-standard-error" href="#GFORTRAN_005fSTDERR_005fUNIT">3.3 <code>GFORTRAN_STDERR_UNIT</code>&mdash;Unit number for standard error</a></li>
    <li><a name="toc-GFORTRAN_005fUSE_005fSTDERR_002d_002d_002dSend-library-output-to-standard-error" href="#GFORTRAN_005fUSE_005fSTDERR">3.4 <code>GFORTRAN_USE_STDERR</code>&mdash;Send library output to standard error</a></li>
    <li><a name="toc-GFORTRAN_005fTMPDIR_002d_002d_002dDirectory-for-scratch-files" href="#GFORTRAN_005fTMPDIR">3.5 <code>GFORTRAN_TMPDIR</code>&mdash;Directory for scratch files</a></li>
    <li><a name="toc-GFORTRAN_005fUNBUFFERED_005fALL_002d_002d_002dDon_0027t-buffer-I_002fO-on-all-units" href="#GFORTRAN_005fUNBUFFERED_005fALL">3.6 <code>GFORTRAN_UNBUFFERED_ALL</code>&mdash;Don&rsquo;t buffer I/O on all units</a></li>
    <li><a name="toc-GFORTRAN_005fUNBUFFERED_005fPRECONNECTED_002d_002d_002dDon_0027t-buffer-I_002fO-on-preconnected-units" href="#GFORTRAN_005fUNBUFFERED_005fPRECONNECTED">3.7 <code>GFORTRAN_UNBUFFERED_PRECONNECTED</code>&mdash;Don&rsquo;t buffer I/O on preconnected units</a></li>
    <li><a name="toc-GFORTRAN_005fSHOW_005fLOCUS_002d_002d_002dShow-location-for-runtime-errors" href="#GFORTRAN_005fSHOW_005fLOCUS">3.8 <code>GFORTRAN_SHOW_LOCUS</code>&mdash;Show location for runtime errors</a></li>
    <li><a name="toc-GFORTRAN_005fOPTIONAL_005fPLUS_002d_002d_002dPrint-leading-_002b-where-permitted" href="#GFORTRAN_005fOPTIONAL_005fPLUS">3.9 <code>GFORTRAN_OPTIONAL_PLUS</code>&mdash;Print leading + where permitted</a></li>
    <li><a name="toc-GFORTRAN_005fDEFAULT_005fRECL_002d_002d_002dDefault-record-length-for-new-files" href="#GFORTRAN_005fDEFAULT_005fRECL">3.10 <code>GFORTRAN_DEFAULT_RECL</code>&mdash;Default record length for new files</a></li>
    <li><a name="toc-GFORTRAN_005fLIST_005fSEPARATOR_002d_002d_002dSeparator-for-list-output" href="#GFORTRAN_005fLIST_005fSEPARATOR">3.11 <code>GFORTRAN_LIST_SEPARATOR</code>&mdash;Separator for list output</a></li>
    <li><a name="toc-GFORTRAN_005fCONVERT_005fUNIT_002d_002d_002dSet-endianness-for-unformatted-I_002fO" href="#GFORTRAN_005fCONVERT_005fUNIT">3.12 <code>GFORTRAN_CONVERT_UNIT</code>&mdash;Set endianness for unformatted I/O</a></li>
    <li><a name="toc-GFORTRAN_005fERROR_005fDUMPCORE_002d_002d_002dDump-core-on-run_002dtime-errors" href="#GFORTRAN_005fERROR_005fDUMPCORE">3.13 <code>GFORTRAN_ERROR_DUMPCORE</code>&mdash;Dump core on run-time errors</a></li>
    <li><a name="toc-GFORTRAN_005fERROR_005fBACKTRACE_002d_002d_002dShow-backtrace-on-run_002dtime-errors" href="#GFORTRAN_005fERROR_005fBACKTRACE">3.14 <code>GFORTRAN_ERROR_BACKTRACE</code>&mdash;Show backtrace on run-time errors</a></li>
  </ul></li>
  <li><a name="toc-Fortran-2003-and-2008-Status" href="#Fortran-2003-and-2008-status">4 Fortran 2003 and 2008 Status</a>
  <ul class="no-bullet">
    <li><a name="toc-Fortran-2003-status-1" href="#Fortran-2003-status">4.1 Fortran 2003 status</a></li>
    <li><a name="toc-Fortran-2008-status-1" href="#Fortran-2008-status">4.2 Fortran 2008 status</a></li>
  </ul></li>
  <li><a name="toc-Compiler-Characteristics-1" href="#Compiler-Characteristics">5 Compiler Characteristics</a>
  <ul class="no-bullet">
    <li><a name="toc-KIND-Type-Parameters-1" href="#KIND-Type-Parameters">5.1 KIND Type Parameters</a></li>
    <li><a name="toc-Internal-representation-of-LOGICAL-variables-1" href="#Internal-representation-of-LOGICAL-variables">5.2 Internal representation of LOGICAL variables</a></li>
  </ul></li>
  <li><a name="toc-Extensions-1" href="#Extensions">6 Extensions</a>
  <ul class="no-bullet">
    <li><a name="toc-Extensions-implemented-in-GNU-Fortran-1" href="#Extensions-implemented-in-GNU-Fortran">6.1 Extensions implemented in GNU Fortran</a>
    <ul class="no-bullet">
      <li><a name="toc-Old_002dstyle-kind-specifications-1" href="#Old_002dstyle-kind-specifications">6.1.1 Old-style kind specifications</a></li>
      <li><a name="toc-Old_002dstyle-variable-initialization-1" href="#Old_002dstyle-variable-initialization">6.1.2 Old-style variable initialization</a></li>
      <li><a name="toc-Extensions-to-namelist-1" href="#Extensions-to-namelist">6.1.3 Extensions to namelist</a></li>
      <li><a name="toc-X-format-descriptor-without-count-field-1" href="#X-format-descriptor-without-count-field">6.1.4 <code>X</code> format descriptor without count field</a></li>
      <li><a name="toc-Commas-in-FORMAT-specifications-1" href="#Commas-in-FORMAT-specifications">6.1.5 Commas in <code>FORMAT</code> specifications</a></li>
      <li><a name="toc-Missing-period-in-FORMAT-specifications-1" href="#Missing-period-in-FORMAT-specifications">6.1.6 Missing period in <code>FORMAT</code> specifications</a></li>
      <li><a name="toc-I_002fO-item-lists-1" href="#I_002fO-item-lists">6.1.7 I/O item lists</a></li>
      <li><a name="toc-BOZ-literal-constants-1" href="#BOZ-literal-constants">6.1.8 BOZ literal constants</a></li>
      <li><a name="toc-Real-array-indices-1" href="#Real-array-indices">6.1.9 Real array indices</a></li>
      <li><a name="toc-Unary-operators-1" href="#Unary-operators">6.1.10 Unary operators</a></li>
      <li><a name="toc-Implicitly-convert-LOGICAL-and-INTEGER-values-1" href="#Implicitly-convert-LOGICAL-and-INTEGER-values">6.1.11 Implicitly convert <code>LOGICAL</code> and <code>INTEGER</code> values</a></li>
      <li><a name="toc-Hollerith-constants-support-1" href="#Hollerith-constants-support">6.1.12 Hollerith constants support</a></li>
      <li><a name="toc-Cray-pointers-1" href="#Cray-pointers">6.1.13 Cray pointers</a></li>
      <li><a name="toc-CONVERT-specifier-1" href="#CONVERT-specifier">6.1.14 <code>CONVERT</code> specifier</a></li>
      <li><a name="toc-OpenMP-1" href="#OpenMP">6.1.15 OpenMP</a></li>
      <li><a name="toc-Argument-list-functions-_0025VAL_002c-_0025REF-and-_0025LOC" href="#Argument-list-functions">6.1.16 Argument list functions <code>%VAL</code>, <code>%REF</code> and <code>%LOC</code></a></li>
    </ul></li>
    <li><a name="toc-Extensions-not-implemented-in-GNU-Fortran-1" href="#Extensions-not-implemented-in-GNU-Fortran">6.2 Extensions not implemented in GNU Fortran</a>
    <ul class="no-bullet">
      <li><a name="toc-STRUCTURE-and-RECORD-1" href="#STRUCTURE-and-RECORD">6.2.1 <code>STRUCTURE</code> and <code>RECORD</code></a></li>
      <li><a name="toc-ENCODE-and-DECODE-statements-1" href="#ENCODE-and-DECODE-statements">6.2.2 <code>ENCODE</code> and <code>DECODE</code> statements</a></li>
    </ul></li>
  </ul></li>
  <li><a name="toc-Intrinsic-Procedures-1" href="#Intrinsic-Procedures">7 Intrinsic Procedures</a>
  <ul class="no-bullet">
    <li><a name="toc-Introduction-to-intrinsic-procedures" href="#Introduction-to-Intrinsics">7.1 Introduction to intrinsic procedures</a></li>
    <li><a name="toc-ABORT-_002d_002d_002d-Abort-the-program" href="#ABORT">7.2 <code>ABORT</code> &mdash; Abort the program</a></li>
    <li><a name="toc-ABS-_002d_002d_002d-Absolute-value" href="#ABS">7.3 <code>ABS</code> &mdash; Absolute value</a></li>
    <li><a name="toc-ACCESS-_002d_002d_002d-Checks-file-access-modes" href="#ACCESS">7.4 <code>ACCESS</code> &mdash; Checks file access modes</a></li>
    <li><a name="toc-ACHAR-_002d_002d_002d-Character-in-ASCII-collating-sequence" href="#ACHAR">7.5 <code>ACHAR</code> &mdash; Character in <acronym>ASCII</acronym> collating sequence</a></li>
    <li><a name="toc-ACOS-_002d_002d_002d-Arccosine-function" href="#ACOS">7.6 <code>ACOS</code> &mdash; Arccosine function</a></li>
    <li><a name="toc-ACOSH-_002d_002d_002d-Hyperbolic-arccosine-function" href="#ACOSH">7.7 <code>ACOSH</code> &mdash; Hyperbolic arccosine function</a></li>
    <li><a name="toc-ADJUSTL-_002d_002d_002d-Left-adjust-a-string" href="#ADJUSTL">7.8 <code>ADJUSTL</code> &mdash; Left adjust a string</a></li>
    <li><a name="toc-ADJUSTR-_002d_002d_002d-Right-adjust-a-string" href="#ADJUSTR">7.9 <code>ADJUSTR</code> &mdash; Right adjust a string</a></li>
    <li><a name="toc-AIMAG-_002d_002d_002d-Imaginary-part-of-complex-number" href="#AIMAG">7.10 <code>AIMAG</code> &mdash; Imaginary part of complex number</a></li>
    <li><a name="toc-AINT-_002d_002d_002d-Truncate-to-a-whole-number" href="#AINT">7.11 <code>AINT</code> &mdash; Truncate to a whole number</a></li>
    <li><a name="toc-ALARM-_002d_002d_002d-Execute-a-routine-after-a-given-delay" href="#ALARM">7.12 <code>ALARM</code> &mdash; Execute a routine after a given delay</a></li>
    <li><a name="toc-ALL-_002d_002d_002d-All-values-in-MASK-along-DIM-are-true" href="#ALL">7.13 <code>ALL</code> &mdash; All values in <var>MASK</var> along <var>DIM</var> are true</a></li>
    <li><a name="toc-ALLOCATED-_002d_002d_002d-Status-of-an-allocatable-entity" href="#ALLOCATED">7.14 <code>ALLOCATED</code> &mdash; Status of an allocatable entity</a></li>
    <li><a name="toc-AND-_002d_002d_002d-Bitwise-logical-AND" href="#AND">7.15 <code>AND</code> &mdash; Bitwise logical AND</a></li>
    <li><a name="toc-ANINT-_002d_002d_002d-Nearest-whole-number" href="#ANINT">7.16 <code>ANINT</code> &mdash; Nearest whole number</a></li>
    <li><a name="toc-ANY-_002d_002d_002d-Any-value-in-MASK-along-DIM-is-true" href="#ANY">7.17 <code>ANY</code> &mdash; Any value in <var>MASK</var> along <var>DIM</var> is true</a></li>
    <li><a name="toc-ASIN-_002d_002d_002d-Arcsine-function" href="#ASIN">7.18 <code>ASIN</code> &mdash; Arcsine function</a></li>
    <li><a name="toc-ASINH-_002d_002d_002d-Hyperbolic-arcsine-function" href="#ASINH">7.19 <code>ASINH</code> &mdash; Hyperbolic arcsine function</a></li>
    <li><a name="toc-ASSOCIATED-_002d_002d_002d-Status-of-a-pointer-or-pointer_002ftarget-pair" href="#ASSOCIATED">7.20 <code>ASSOCIATED</code> &mdash; Status of a pointer or pointer/target pair</a></li>
    <li><a name="toc-ATAN-_002d_002d_002d-Arctangent-function" href="#ATAN">7.21 <code>ATAN</code> &mdash; Arctangent function</a></li>
    <li><a name="toc-ATAN2-_002d_002d_002d-Arctangent-function" href="#ATAN2">7.22 <code>ATAN2</code> &mdash; Arctangent function</a></li>
    <li><a name="toc-ATANH-_002d_002d_002d-Hyperbolic-arctangent-function" href="#ATANH">7.23 <code>ATANH</code> &mdash; Hyperbolic arctangent function</a></li>
    <li><a name="toc-BESSEL_005fJ0-_002d_002d_002d-Bessel-function-of-the-first-kind-of-order-0" href="#BESSEL_005fJ0">7.24 <code>BESSEL_J0</code> &mdash; Bessel function of the first kind of order 0</a></li>
    <li><a name="toc-BESSEL_005fJ1-_002d_002d_002d-Bessel-function-of-the-first-kind-of-order-1" href="#BESSEL_005fJ1">7.25 <code>BESSEL_J1</code> &mdash; Bessel function of the first kind of order 1</a></li>
    <li><a name="toc-BESSEL_005fJN-_002d_002d_002d-Bessel-function-of-the-first-kind" href="#BESSEL_005fJN">7.26 <code>BESSEL_JN</code> &mdash; Bessel function of the first kind</a></li>
    <li><a name="toc-BESSEL_005fY0-_002d_002d_002d-Bessel-function-of-the-second-kind-of-order-0" href="#BESSEL_005fY0">7.27 <code>BESSEL_Y0</code> &mdash; Bessel function of the second kind of order 0</a></li>
    <li><a name="toc-BESSEL_005fY1-_002d_002d_002d-Bessel-function-of-the-second-kind-of-order-1" href="#BESSEL_005fY1">7.28 <code>BESSEL_Y1</code> &mdash; Bessel function of the second kind of order 1</a></li>
    <li><a name="toc-BESSEL_005fYN-_002d_002d_002d-Bessel-function-of-the-second-kind" href="#BESSEL_005fYN">7.29 <code>BESSEL_YN</code> &mdash; Bessel function of the second kind</a></li>
    <li><a name="toc-BIT_005fSIZE-_002d_002d_002d-Bit-size-inquiry-function" href="#BIT_005fSIZE">7.30 <code>BIT_SIZE</code> &mdash; Bit size inquiry function</a></li>
    <li><a name="toc-BTEST-_002d_002d_002d-Bit-test-function" href="#BTEST">7.31 <code>BTEST</code> &mdash; Bit test function</a></li>
    <li><a name="toc-C_005fASSOCIATED-_002d_002d_002d-Status-of-a-C-pointer" href="#C_005fASSOCIATED">7.32 <code>C_ASSOCIATED</code> &mdash; Status of a C pointer</a></li>
    <li><a name="toc-C_005fFUNLOC-_002d_002d_002d-Obtain-the-C-address-of-a-procedure" href="#C_005fFUNLOC">7.33 <code>C_FUNLOC</code> &mdash; Obtain the C address of a procedure</a></li>
    <li><a name="toc-C_005fF_005fPROCPOINTER-_002d_002d_002d-Convert-C-into-Fortran-procedure-pointer" href="#C_005fF_005fPROCPOINTER">7.34 <code>C_F_PROCPOINTER</code> &mdash; Convert C into Fortran procedure pointer</a></li>
    <li><a name="toc-C_005fF_005fPOINTER-_002d_002d_002d-Convert-C-into-Fortran-pointer" href="#C_005fF_005fPOINTER">7.35 <code>C_F_POINTER</code> &mdash; Convert C into Fortran pointer</a></li>
    <li><a name="toc-C_005fLOC-_002d_002d_002d-Obtain-the-C-address-of-an-object" href="#C_005fLOC">7.36 <code>C_LOC</code> &mdash; Obtain the C address of an object</a></li>
    <li><a name="toc-C_005fSIZEOF-_002d_002d_002d-Size-in-bytes-of-an-expression" href="#C_005fSIZEOF">7.37 <code>C_SIZEOF</code> &mdash; Size in bytes of an expression</a></li>
    <li><a name="toc-CEILING-_002d_002d_002d-Integer-ceiling-function" href="#CEILING">7.38 <code>CEILING</code> &mdash; Integer ceiling function</a></li>
    <li><a name="toc-CHAR-_002d_002d_002d-Character-conversion-function" href="#CHAR">7.39 <code>CHAR</code> &mdash; Character conversion function</a></li>
    <li><a name="toc-CHDIR-_002d_002d_002d-Change-working-directory" href="#CHDIR">7.40 <code>CHDIR</code> &mdash; Change working directory</a></li>
    <li><a name="toc-CHMOD-_002d_002d_002d-Change-access-permissions-of-files" href="#CHMOD">7.41 <code>CHMOD</code> &mdash; Change access permissions of files</a></li>
    <li><a name="toc-CMPLX-_002d_002d_002d-Complex-conversion-function" href="#CMPLX">7.42 <code>CMPLX</code> &mdash; Complex conversion function</a></li>
    <li><a name="toc-COMMAND_005fARGUMENT_005fCOUNT-_002d_002d_002d-Get-number-of-command-line-arguments" href="#COMMAND_005fARGUMENT_005fCOUNT">7.43 <code>COMMAND_ARGUMENT_COUNT</code> &mdash; Get number of command line arguments</a></li>
    <li><a name="toc-COMPLEX-_002d_002d_002d-Complex-conversion-function" href="#COMPLEX">7.44 <code>COMPLEX</code> &mdash; Complex conversion function</a></li>
    <li><a name="toc-CONJG-_002d_002d_002d-Complex-conjugate-function" href="#CONJG">7.45 <code>CONJG</code> &mdash; Complex conjugate function</a></li>
    <li><a name="toc-COS-_002d_002d_002d-Cosine-function" href="#COS">7.46 <code>COS</code> &mdash; Cosine function</a></li>
    <li><a name="toc-COSH-_002d_002d_002d-Hyperbolic-cosine-function" href="#COSH">7.47 <code>COSH</code> &mdash; Hyperbolic cosine function</a></li>
    <li><a name="toc-COUNT-_002d_002d_002d-Count-function" href="#COUNT">7.48 <code>COUNT</code> &mdash; Count function</a></li>
    <li><a name="toc-CPU_005fTIME-_002d_002d_002d-CPU-elapsed-time-in-seconds" href="#CPU_005fTIME">7.49 <code>CPU_TIME</code> &mdash; CPU elapsed time in seconds</a></li>
    <li><a name="toc-CSHIFT-_002d_002d_002d-Circular-shift-elements-of-an-array" href="#CSHIFT">7.50 <code>CSHIFT</code> &mdash; Circular shift elements of an array</a></li>
    <li><a name="toc-CTIME-_002d_002d_002d-Convert-a-time-into-a-string" href="#CTIME">7.51 <code>CTIME</code> &mdash; Convert a time into a string</a></li>
    <li><a name="toc-DATE_005fAND_005fTIME-_002d_002d_002d-Date-and-time-subroutine" href="#DATE_005fAND_005fTIME">7.52 <code>DATE_AND_TIME</code> &mdash; Date and time subroutine</a></li>
    <li><a name="toc-DBLE-_002d_002d_002d-Double-conversion-function" href="#DBLE">7.53 <code>DBLE</code> &mdash; Double conversion function</a></li>
    <li><a name="toc-DCMPLX-_002d_002d_002d-Double-complex-conversion-function" href="#DCMPLX">7.54 <code>DCMPLX</code> &mdash; Double complex conversion function</a></li>
    <li><a name="toc-DFLOAT-_002d_002d_002d-Double-conversion-function" href="#DFLOAT">7.55 <code>DFLOAT</code> &mdash; Double conversion function</a></li>
    <li><a name="toc-DIGITS-_002d_002d_002d-Significant-binary-digits-function" href="#DIGITS">7.56 <code>DIGITS</code> &mdash; Significant binary digits function</a></li>
    <li><a name="toc-DIM-_002d_002d_002d-Positive-difference" href="#DIM">7.57 <code>DIM</code> &mdash; Positive difference</a></li>
    <li><a name="toc-DOT_005fPRODUCT-_002d_002d_002d-Dot-product-function" href="#DOT_005fPRODUCT">7.58 <code>DOT_PRODUCT</code> &mdash; Dot product function</a></li>
    <li><a name="toc-DPROD-_002d_002d_002d-Double-product-function" href="#DPROD">7.59 <code>DPROD</code> &mdash; Double product function</a></li>
    <li><a name="toc-DREAL-_002d_002d_002d-Double-real-part-function" href="#DREAL">7.60 <code>DREAL</code> &mdash; Double real part function</a></li>
    <li><a name="toc-DTIME-_002d_002d_002d-Execution-time-subroutine-_0028or-function_0029" href="#DTIME">7.61 <code>DTIME</code> &mdash; Execution time subroutine (or function)</a></li>
    <li><a name="toc-EOSHIFT-_002d_002d_002d-End_002doff-shift-elements-of-an-array" href="#EOSHIFT">7.62 <code>EOSHIFT</code> &mdash; End-off shift elements of an array</a></li>
    <li><a name="toc-EPSILON-_002d_002d_002d-Epsilon-function" href="#EPSILON">7.63 <code>EPSILON</code> &mdash; Epsilon function</a></li>
    <li><a name="toc-ERF-_002d_002d_002d-Error-function" href="#ERF">7.64 <code>ERF</code> &mdash; Error function</a></li>
    <li><a name="toc-ERFC-_002d_002d_002d-Error-function" href="#ERFC">7.65 <code>ERFC</code> &mdash; Error function</a></li>
    <li><a name="toc-ERFC_005fSCALED-_002d_002d_002d-Error-function" href="#ERFC_005fSCALED">7.66 <code>ERFC_SCALED</code> &mdash; Error function</a></li>
    <li><a name="toc-ETIME-_002d_002d_002d-Execution-time-subroutine-_0028or-function_0029" href="#ETIME">7.67 <code>ETIME</code> &mdash; Execution time subroutine (or function)</a></li>
    <li><a name="toc-EXIT-_002d_002d_002d-Exit-the-program-with-status_002e" href="#EXIT">7.68 <code>EXIT</code> &mdash; Exit the program with status.</a></li>
    <li><a name="toc-EXP-_002d_002d_002d-Exponential-function" href="#EXP">7.69 <code>EXP</code> &mdash; Exponential function</a></li>
    <li><a name="toc-EXPONENT-_002d_002d_002d-Exponent-function" href="#EXPONENT">7.70 <code>EXPONENT</code> &mdash; Exponent function</a></li>
    <li><a name="toc-FDATE-_002d_002d_002d-Get-the-current-time-as-a-string" href="#FDATE">7.71 <code>FDATE</code> &mdash; Get the current time as a string</a></li>
    <li><a name="toc-FLOAT-_002d_002d_002d-Convert-integer-to-default-real" href="#FLOAT">7.72 <code>FLOAT</code> &mdash; Convert integer to default real</a></li>
    <li><a name="toc-FGET-_002d_002d_002d-Read-a-single-character-in-stream-mode-from-stdin" href="#FGET">7.73 <code>FGET</code> &mdash; Read a single character in stream mode from stdin</a></li>
    <li><a name="toc-FGETC-_002d_002d_002d-Read-a-single-character-in-stream-mode" href="#FGETC">7.74 <code>FGETC</code> &mdash; Read a single character in stream mode</a></li>
    <li><a name="toc-FLOOR-_002d_002d_002d-Integer-floor-function" href="#FLOOR">7.75 <code>FLOOR</code> &mdash; Integer floor function</a></li>
    <li><a name="toc-FLUSH-_002d_002d_002d-Flush-I_002fO-unit_0028s_0029" href="#FLUSH">7.76 <code>FLUSH</code> &mdash; Flush I/O unit(s)</a></li>
    <li><a name="toc-FNUM-_002d_002d_002d-File-number-function" href="#FNUM">7.77 <code>FNUM</code> &mdash; File number function</a></li>
    <li><a name="toc-FPUT-_002d_002d_002d-Write-a-single-character-in-stream-mode-to-stdout" href="#FPUT">7.78 <code>FPUT</code> &mdash; Write a single character in stream mode to stdout</a></li>
    <li><a name="toc-FPUTC-_002d_002d_002d-Write-a-single-character-in-stream-mode" href="#FPUTC">7.79 <code>FPUTC</code> &mdash; Write a single character in stream mode</a></li>
    <li><a name="toc-FRACTION-_002d_002d_002d-Fractional-part-of-the-model-representation" href="#FRACTION">7.80 <code>FRACTION</code> &mdash; Fractional part of the model representation</a></li>
    <li><a name="toc-FREE-_002d_002d_002d-Frees-memory" href="#FREE">7.81 <code>FREE</code> &mdash; Frees memory</a></li>
    <li><a name="toc-FSEEK-_002d_002d_002d-Low-level-file-positioning-subroutine" href="#FSEEK">7.82 <code>FSEEK</code> &mdash; Low level file positioning subroutine</a></li>
    <li><a name="toc-FSTAT-_002d_002d_002d-Get-file-status" href="#FSTAT">7.83 <code>FSTAT</code> &mdash; Get file status</a></li>
    <li><a name="toc-FTELL-_002d_002d_002d-Current-stream-position" href="#FTELL">7.84 <code>FTELL</code> &mdash; Current stream position</a></li>
    <li><a name="toc-GAMMA-_002d_002d_002d-Gamma-function" href="#GAMMA">7.85 <code>GAMMA</code> &mdash; Gamma function</a></li>
    <li><a name="toc-GERROR-_002d_002d_002d-Get-last-system-error-message" href="#GERROR">7.86 <code>GERROR</code> &mdash; Get last system error message</a></li>
    <li><a name="toc-GETARG-_002d_002d_002d-Get-command-line-arguments" href="#GETARG">7.87 <code>GETARG</code> &mdash; Get command line arguments</a></li>
    <li><a name="toc-GET_005fCOMMAND-_002d_002d_002d-Get-the-entire-command-line" href="#GET_005fCOMMAND">7.88 <code>GET_COMMAND</code> &mdash; Get the entire command line</a></li>
    <li><a name="toc-GET_005fCOMMAND_005fARGUMENT-_002d_002d_002d-Get-command-line-arguments" href="#GET_005fCOMMAND_005fARGUMENT">7.89 <code>GET_COMMAND_ARGUMENT</code> &mdash; Get command line arguments</a></li>
    <li><a name="toc-GETCWD-_002d_002d_002d-Get-current-working-directory" href="#GETCWD">7.90 <code>GETCWD</code> &mdash; Get current working directory</a></li>
    <li><a name="toc-GETENV-_002d_002d_002d-Get-an-environmental-variable" href="#GETENV">7.91 <code>GETENV</code> &mdash; Get an environmental variable</a></li>
    <li><a name="toc-GET_005fENVIRONMENT_005fVARIABLE-_002d_002d_002d-Get-an-environmental-variable" href="#GET_005fENVIRONMENT_005fVARIABLE">7.92 <code>GET_ENVIRONMENT_VARIABLE</code> &mdash; Get an environmental variable</a></li>
    <li><a name="toc-GETGID-_002d_002d_002d-Group-ID-function" href="#GETGID">7.93 <code>GETGID</code> &mdash; Group ID function</a></li>
    <li><a name="toc-GETLOG-_002d_002d_002d-Get-login-name" href="#GETLOG">7.94 <code>GETLOG</code> &mdash; Get login name</a></li>
    <li><a name="toc-GETPID-_002d_002d_002d-Process-ID-function" href="#GETPID">7.95 <code>GETPID</code> &mdash; Process ID function</a></li>
    <li><a name="toc-GETUID-_002d_002d_002d-User-ID-function" href="#GETUID">7.96 <code>GETUID</code> &mdash; User ID function</a></li>
    <li><a name="toc-GMTIME-_002d_002d_002d-Convert-time-to-GMT-info" href="#GMTIME">7.97 <code>GMTIME</code> &mdash; Convert time to GMT info</a></li>
    <li><a name="toc-HOSTNM-_002d_002d_002d-Get-system-host-name" href="#HOSTNM">7.98 <code>HOSTNM</code> &mdash; Get system host name</a></li>
    <li><a name="toc-HUGE-_002d_002d_002d-Largest-number-of-a-kind" href="#HUGE">7.99 <code>HUGE</code> &mdash; Largest number of a kind</a></li>
    <li><a name="toc-HYPOT-_002d_002d_002d-Euclidean-distance-function" href="#HYPOT">7.100 <code>HYPOT</code> &mdash; Euclidean distance function</a></li>
    <li><a name="toc-IACHAR-_002d_002d_002d-Code-in-ASCII-collating-sequence" href="#IACHAR">7.101 <code>IACHAR</code> &mdash; Code in <acronym>ASCII</acronym> collating sequence</a></li>
    <li><a name="toc-IAND-_002d_002d_002d-Bitwise-logical-and" href="#IAND">7.102 <code>IAND</code> &mdash; Bitwise logical and</a></li>
    <li><a name="toc-IARGC-_002d_002d_002d-Get-the-number-of-command-line-arguments" href="#IARGC">7.103 <code>IARGC</code> &mdash; Get the number of command line arguments</a></li>
    <li><a name="toc-IBCLR-_002d_002d_002d-Clear-bit" href="#IBCLR">7.104 <code>IBCLR</code> &mdash; Clear bit</a></li>
    <li><a name="toc-IBITS-_002d_002d_002d-Bit-extraction" href="#IBITS">7.105 <code>IBITS</code> &mdash; Bit extraction</a></li>
    <li><a name="toc-IBSET-_002d_002d_002d-Set-bit" href="#IBSET">7.106 <code>IBSET</code> &mdash; Set bit</a></li>
    <li><a name="toc-ICHAR-_002d_002d_002d-Character_002dto_002dinteger-conversion-function" href="#ICHAR">7.107 <code>ICHAR</code> &mdash; Character-to-integer conversion function</a></li>
    <li><a name="toc-IDATE-_002d_002d_002d-Get-current-local-time-subroutine-_0028day_002fmonth_002fyear_0029" href="#IDATE">7.108 <code>IDATE</code> &mdash; Get current local time subroutine (day/month/year)</a></li>
    <li><a name="toc-IEOR-_002d_002d_002d-Bitwise-logical-exclusive-or" href="#IEOR">7.109 <code>IEOR</code> &mdash; Bitwise logical exclusive or</a></li>
    <li><a name="toc-IERRNO-_002d_002d_002d-Get-the-last-system-error-number" href="#IERRNO">7.110 <code>IERRNO</code> &mdash; Get the last system error number</a></li>
    <li><a name="toc-INDEX-_002d_002d_002d-Position-of-a-substring-within-a-string" href="#INDEX-intrinsic">7.111 <code>INDEX</code> &mdash; Position of a substring within a string</a></li>
    <li><a name="toc-INT-_002d_002d_002d-Convert-to-integer-type" href="#INT">7.112 <code>INT</code> &mdash; Convert to integer type</a></li>
    <li><a name="toc-INT2-_002d_002d_002d-Convert-to-16_002dbit-integer-type" href="#INT2">7.113 <code>INT2</code> &mdash; Convert to 16-bit integer type</a></li>
    <li><a name="toc-INT8-_002d_002d_002d-Convert-to-64_002dbit-integer-type" href="#INT8">7.114 <code>INT8</code> &mdash; Convert to 64-bit integer type</a></li>
    <li><a name="toc-IOR-_002d_002d_002d-Bitwise-logical-or" href="#IOR">7.115 <code>IOR</code> &mdash; Bitwise logical or</a></li>
    <li><a name="toc-IRAND-_002d_002d_002d-Integer-pseudo_002drandom-number" href="#IRAND">7.116 <code>IRAND</code> &mdash; Integer pseudo-random number</a></li>
    <li><a name="toc-IS_005fIOSTAT_005fEND-_002d_002d_002d-Test-for-end_002dof_002dfile-value" href="#IS_005fIOSTAT_005fEND">7.117 <code>IS_IOSTAT_END</code> &mdash; Test for end-of-file value</a></li>
    <li><a name="toc-IS_005fIOSTAT_005fEOR-_002d_002d_002d-Test-for-end_002dof_002drecord-value" href="#IS_005fIOSTAT_005fEOR">7.118 <code>IS_IOSTAT_EOR</code> &mdash; Test for end-of-record value</a></li>
    <li><a name="toc-ISATTY-_002d_002d_002d-Whether-a-unit-is-a-terminal-device_002e" href="#ISATTY">7.119 <code>ISATTY</code> &mdash; Whether a unit is a terminal device.</a></li>
    <li><a name="toc-ISHFT-_002d_002d_002d-Shift-bits" href="#ISHFT">7.120 <code>ISHFT</code> &mdash; Shift bits</a></li>
    <li><a name="toc-ISHFTC-_002d_002d_002d-Shift-bits-circularly" href="#ISHFTC">7.121 <code>ISHFTC</code> &mdash; Shift bits circularly</a></li>
    <li><a name="toc-ISNAN-_002d_002d_002d-Test-for-a-NaN" href="#ISNAN">7.122 <code>ISNAN</code> &mdash; Test for a NaN</a></li>
    <li><a name="toc-ITIME-_002d_002d_002d-Get-current-local-time-subroutine-_0028hour_002fminutes_002fseconds_0029" href="#ITIME">7.123 <code>ITIME</code> &mdash; Get current local time subroutine (hour/minutes/seconds)</a></li>
    <li><a name="toc-KILL-_002d_002d_002d-Send-a-signal-to-a-process" href="#KILL">7.124 <code>KILL</code> &mdash; Send a signal to a process</a></li>
    <li><a name="toc-KIND-_002d_002d_002d-Kind-of-an-entity" href="#KIND">7.125 <code>KIND</code> &mdash; Kind of an entity</a></li>
    <li><a name="toc-LBOUND-_002d_002d_002d-Lower-dimension-bounds-of-an-array" href="#LBOUND">7.126 <code>LBOUND</code> &mdash; Lower dimension bounds of an array</a></li>
    <li><a name="toc-LEADZ-_002d_002d_002d-Number-of-leading-zero-bits-of-an-integer" href="#LEADZ">7.127 <code>LEADZ</code> &mdash; Number of leading zero bits of an integer</a></li>
    <li><a name="toc-LEN-_002d_002d_002d-Length-of-a-character-entity" href="#LEN">7.128 <code>LEN</code> &mdash; Length of a character entity</a></li>
    <li><a name="toc-LEN_005fTRIM-_002d_002d_002d-Length-of-a-character-entity-without-trailing-blank-characters" href="#LEN_005fTRIM">7.129 <code>LEN_TRIM</code> &mdash; Length of a character entity without trailing blank characters</a></li>
    <li><a name="toc-LGE-_002d_002d_002d-Lexical-greater-than-or-equal" href="#LGE">7.130 <code>LGE</code> &mdash; Lexical greater than or equal</a></li>
    <li><a name="toc-LGT-_002d_002d_002d-Lexical-greater-than" href="#LGT">7.131 <code>LGT</code> &mdash; Lexical greater than</a></li>
    <li><a name="toc-LINK-_002d_002d_002d-Create-a-hard-link" href="#LINK">7.132 <code>LINK</code> &mdash; Create a hard link</a></li>
    <li><a name="toc-LLE-_002d_002d_002d-Lexical-less-than-or-equal" href="#LLE">7.133 <code>LLE</code> &mdash; Lexical less than or equal</a></li>
    <li><a name="toc-LLT-_002d_002d_002d-Lexical-less-than" href="#LLT">7.134 <code>LLT</code> &mdash; Lexical less than</a></li>
    <li><a name="toc-LNBLNK-_002d_002d_002d-Index-of-the-last-non_002dblank-character-in-a-string" href="#LNBLNK">7.135 <code>LNBLNK</code> &mdash; Index of the last non-blank character in a string</a></li>
    <li><a name="toc-LOC-_002d_002d_002d-Returns-the-address-of-a-variable" href="#LOC">7.136 <code>LOC</code> &mdash; Returns the address of a variable</a></li>
    <li><a name="toc-LOG-_002d_002d_002d-Logarithm-function" href="#LOG">7.137 <code>LOG</code> &mdash; Logarithm function</a></li>
    <li><a name="toc-LOG10-_002d_002d_002d-Base-10-logarithm-function" href="#LOG10">7.138 <code>LOG10</code> &mdash; Base 10 logarithm function</a></li>
    <li><a name="toc-LOG_005fGAMMA-_002d_002d_002d-Logarithm-of-the-Gamma-function" href="#LOG_005fGAMMA">7.139 <code>LOG_GAMMA</code> &mdash; Logarithm of the Gamma function</a></li>
    <li><a name="toc-LOGICAL-_002d_002d_002d-Convert-to-logical-type" href="#LOGICAL">7.140 <code>LOGICAL</code> &mdash; Convert to logical type</a></li>
    <li><a name="toc-LONG-_002d_002d_002d-Convert-to-integer-type" href="#LONG">7.141 <code>LONG</code> &mdash; Convert to integer type</a></li>
    <li><a name="toc-LSHIFT-_002d_002d_002d-Left-shift-bits" href="#LSHIFT">7.142 <code>LSHIFT</code> &mdash; Left shift bits</a></li>
    <li><a name="toc-LSTAT-_002d_002d_002d-Get-file-status" href="#LSTAT">7.143 <code>LSTAT</code> &mdash; Get file status</a></li>
    <li><a name="toc-LTIME-_002d_002d_002d-Convert-time-to-local-time-info" href="#LTIME">7.144 <code>LTIME</code> &mdash; Convert time to local time info</a></li>
    <li><a name="toc-MALLOC-_002d_002d_002d-Allocate-dynamic-memory" href="#MALLOC">7.145 <code>MALLOC</code> &mdash; Allocate dynamic memory</a></li>
    <li><a name="toc-MATMUL-_002d_002d_002d-matrix-multiplication" href="#MATMUL">7.146 <code>MATMUL</code> &mdash; matrix multiplication</a></li>
    <li><a name="toc-MAX-_002d_002d_002d-Maximum-value-of-an-argument-list" href="#MAX">7.147 <code>MAX</code> &mdash; Maximum value of an argument list</a></li>
    <li><a name="toc-MAXEXPONENT-_002d_002d_002d-Maximum-exponent-of-a-real-kind" href="#MAXEXPONENT">7.148 <code>MAXEXPONENT</code> &mdash; Maximum exponent of a real kind</a></li>
    <li><a name="toc-MAXLOC-_002d_002d_002d-Location-of-the-maximum-value-within-an-array" href="#MAXLOC">7.149 <code>MAXLOC</code> &mdash; Location of the maximum value within an array</a></li>
    <li><a name="toc-MAXVAL-_002d_002d_002d-Maximum-value-of-an-array" href="#MAXVAL">7.150 <code>MAXVAL</code> &mdash; Maximum value of an array</a></li>
    <li><a name="toc-MCLOCK-_002d_002d_002d-Time-function" href="#MCLOCK">7.151 <code>MCLOCK</code> &mdash; Time function</a></li>
    <li><a name="toc-MCLOCK8-_002d_002d_002d-Time-function-_002864_002dbit_0029" href="#MCLOCK8">7.152 <code>MCLOCK8</code> &mdash; Time function (64-bit)</a></li>
    <li><a name="toc-MERGE-_002d_002d_002d-Merge-variables" href="#MERGE">7.153 <code>MERGE</code> &mdash; Merge variables</a></li>
    <li><a name="toc-MIN-_002d_002d_002d-Minimum-value-of-an-argument-list" href="#MIN">7.154 <code>MIN</code> &mdash; Minimum value of an argument list</a></li>
    <li><a name="toc-MINEXPONENT-_002d_002d_002d-Minimum-exponent-of-a-real-kind" href="#MINEXPONENT">7.155 <code>MINEXPONENT</code> &mdash; Minimum exponent of a real kind</a></li>
    <li><a name="toc-MINLOC-_002d_002d_002d-Location-of-the-minimum-value-within-an-array" href="#MINLOC">7.156 <code>MINLOC</code> &mdash; Location of the minimum value within an array</a></li>
    <li><a name="toc-MINVAL-_002d_002d_002d-Minimum-value-of-an-array" href="#MINVAL">7.157 <code>MINVAL</code> &mdash; Minimum value of an array</a></li>
    <li><a name="toc-MOD-_002d_002d_002d-Remainder-function" href="#MOD">7.158 <code>MOD</code> &mdash; Remainder function</a></li>
    <li><a name="toc-MODULO-_002d_002d_002d-Modulo-function" href="#MODULO">7.159 <code>MODULO</code> &mdash; Modulo function</a></li>
    <li><a name="toc-MOVE_005fALLOC-_002d_002d_002d-Move-allocation-from-one-object-to-another" href="#MOVE_005fALLOC">7.160 <code>MOVE_ALLOC</code> &mdash; Move allocation from one object to another</a></li>
    <li><a name="toc-MVBITS-_002d_002d_002d-Move-bits-from-one-integer-to-another" href="#MVBITS">7.161 <code>MVBITS</code> &mdash; Move bits from one integer to another</a></li>
    <li><a name="toc-NEAREST-_002d_002d_002d-Nearest-representable-number" href="#NEAREST">7.162 <code>NEAREST</code> &mdash; Nearest representable number</a></li>
    <li><a name="toc-NEW_005fLINE-_002d_002d_002d-New-line-character" href="#NEW_005fLINE">7.163 <code>NEW_LINE</code> &mdash; New line character</a></li>
    <li><a name="toc-NINT-_002d_002d_002d-Nearest-whole-number" href="#NINT">7.164 <code>NINT</code> &mdash; Nearest whole number</a></li>
    <li><a name="toc-NOT-_002d_002d_002d-Logical-negation" href="#NOT">7.165 <code>NOT</code> &mdash; Logical negation</a></li>
    <li><a name="toc-NULL-_002d_002d_002d-Function-that-returns-an-disassociated-pointer" href="#NULL">7.166 <code>NULL</code> &mdash; Function that returns an disassociated pointer</a></li>
    <li><a name="toc-OR-_002d_002d_002d-Bitwise-logical-OR" href="#OR">7.167 <code>OR</code> &mdash; Bitwise logical OR</a></li>
    <li><a name="toc-PACK-_002d_002d_002d-Pack-an-array-into-an-array-of-rank-one" href="#PACK">7.168 <code>PACK</code> &mdash; Pack an array into an array of rank one</a></li>
    <li><a name="toc-PERROR-_002d_002d_002d-Print-system-error-message" href="#PERROR">7.169 <code>PERROR</code> &mdash; Print system error message</a></li>
    <li><a name="toc-PRECISION-_002d_002d_002d-Decimal-precision-of-a-real-kind" href="#PRECISION">7.170 <code>PRECISION</code> &mdash; Decimal precision of a real kind</a></li>
    <li><a name="toc-PRESENT-_002d_002d_002d-Determine-whether-an-optional-dummy-argument-is-specified" href="#PRESENT">7.171 <code>PRESENT</code> &mdash; Determine whether an optional dummy argument is specified</a></li>
    <li><a name="toc-PRODUCT-_002d_002d_002d-Product-of-array-elements" href="#PRODUCT">7.172 <code>PRODUCT</code> &mdash; Product of array elements</a></li>
    <li><a name="toc-RADIX-_002d_002d_002d-Base-of-a-model-number" href="#RADIX">7.173 <code>RADIX</code> &mdash; Base of a model number</a></li>
    <li><a name="toc-RAN-_002d_002d_002d-Real-pseudo_002drandom-number" href="#RAN">7.174 <code>RAN</code> &mdash; Real pseudo-random number</a></li>
    <li><a name="toc-RAND-_002d_002d_002d-Real-pseudo_002drandom-number" href="#RAND">7.175 <code>RAND</code> &mdash; Real pseudo-random number</a></li>
    <li><a name="toc-RANDOM_005fNUMBER-_002d_002d_002d-Pseudo_002drandom-number" href="#RANDOM_005fNUMBER">7.176 <code>RANDOM_NUMBER</code> &mdash; Pseudo-random number</a></li>
    <li><a name="toc-RANDOM_005fSEED-_002d_002d_002d-Initialize-a-pseudo_002drandom-number-sequence" href="#RANDOM_005fSEED">7.177 <code>RANDOM_SEED</code> &mdash; Initialize a pseudo-random number sequence</a></li>
    <li><a name="toc-RANGE-_002d_002d_002d-Decimal-exponent-range" href="#RANGE">7.178 <code>RANGE</code> &mdash; Decimal exponent range</a></li>
    <li><a name="toc-REAL-_002d_002d_002d-Convert-to-real-type" href="#REAL">7.179 <code>REAL</code> &mdash; Convert to real type</a></li>
    <li><a name="toc-RENAME-_002d_002d_002d-Rename-a-file" href="#RENAME">7.180 <code>RENAME</code> &mdash; Rename a file</a></li>
    <li><a name="toc-REPEAT-_002d_002d_002d-Repeated-string-concatenation" href="#REPEAT">7.181 <code>REPEAT</code> &mdash; Repeated string concatenation</a></li>
    <li><a name="toc-RESHAPE-_002d_002d_002d-Function-to-reshape-an-array" href="#RESHAPE">7.182 <code>RESHAPE</code> &mdash; Function to reshape an array</a></li>
    <li><a name="toc-RRSPACING-_002d_002d_002d-Reciprocal-of-the-relative-spacing" href="#RRSPACING">7.183 <code>RRSPACING</code> &mdash; Reciprocal of the relative spacing</a></li>
    <li><a name="toc-RSHIFT-_002d_002d_002d-Right-shift-bits" href="#RSHIFT">7.184 <code>RSHIFT</code> &mdash; Right shift bits</a></li>
    <li><a name="toc-SCALE-_002d_002d_002d-Scale-a-real-value" href="#SCALE">7.185 <code>SCALE</code> &mdash; Scale a real value</a></li>
    <li><a name="toc-SCAN-_002d_002d_002d-Scan-a-string-for-the-presence-of-a-set-of-characters" href="#SCAN">7.186 <code>SCAN</code> &mdash; Scan a string for the presence of a set of characters</a></li>
    <li><a name="toc-SECNDS-_002d_002d_002d-Time-function" href="#SECNDS">7.187 <code>SECNDS</code> &mdash; Time function</a></li>
    <li><a name="toc-SECOND-_002d_002d_002d-CPU-time-function" href="#SECOND">7.188 <code>SECOND</code> &mdash; CPU time function</a></li>
    <li><a name="toc-SELECTED_005fCHAR_005fKIND-_002d_002d_002d-Choose-character-kind" href="#SELECTED_005fCHAR_005fKIND">7.189 <code>SELECTED_CHAR_KIND</code> &mdash; Choose character kind</a></li>
    <li><a name="toc-SELECTED_005fINT_005fKIND-_002d_002d_002d-Choose-integer-kind" href="#SELECTED_005fINT_005fKIND">7.190 <code>SELECTED_INT_KIND</code> &mdash; Choose integer kind</a></li>
    <li><a name="toc-SELECTED_005fREAL_005fKIND-_002d_002d_002d-Choose-real-kind" href="#SELECTED_005fREAL_005fKIND">7.191 <code>SELECTED_REAL_KIND</code> &mdash; Choose real kind</a></li>
    <li><a name="toc-SET_005fEXPONENT-_002d_002d_002d-Set-the-exponent-of-the-model" href="#SET_005fEXPONENT">7.192 <code>SET_EXPONENT</code> &mdash; Set the exponent of the model</a></li>
    <li><a name="toc-SHAPE-_002d_002d_002d-Determine-the-shape-of-an-array" href="#SHAPE">7.193 <code>SHAPE</code> &mdash; Determine the shape of an array</a></li>
    <li><a name="toc-SIGN-_002d_002d_002d-Sign-copying-function" href="#SIGN">7.194 <code>SIGN</code> &mdash; Sign copying function</a></li>
    <li><a name="toc-SIGNAL-_002d_002d_002d-Signal-handling-subroutine-_0028or-function_0029" href="#SIGNAL">7.195 <code>SIGNAL</code> &mdash; Signal handling subroutine (or function)</a></li>
    <li><a name="toc-SIN-_002d_002d_002d-Sine-function" href="#SIN">7.196 <code>SIN</code> &mdash; Sine function</a></li>
    <li><a name="toc-SINH-_002d_002d_002d-Hyperbolic-sine-function" href="#SINH">7.197 <code>SINH</code> &mdash; Hyperbolic sine function</a></li>
    <li><a name="toc-SIZE-_002d_002d_002d-Determine-the-size-of-an-array" href="#SIZE">7.198 <code>SIZE</code> &mdash; Determine the size of an array</a></li>
    <li><a name="toc-SIZEOF-_002d_002d_002d-Size-in-bytes-of-an-expression" href="#SIZEOF">7.199 <code>SIZEOF</code> &mdash; Size in bytes of an expression</a></li>
    <li><a name="toc-SLEEP-_002d_002d_002d-Sleep-for-the-specified-number-of-seconds" href="#SLEEP">7.200 <code>SLEEP</code> &mdash; Sleep for the specified number of seconds</a></li>
    <li><a name="toc-SNGL-_002d_002d_002d-Convert-double-precision-real-to-default-real" href="#SNGL">7.201 <code>SNGL</code> &mdash; Convert double precision real to default real</a></li>
    <li><a name="toc-SPACING-_002d_002d_002d-Smallest-distance-between-two-numbers-of-a-given-type" href="#SPACING">7.202 <code>SPACING</code> &mdash; Smallest distance between two numbers of a given type</a></li>
    <li><a name="toc-SPREAD-_002d_002d_002d-Add-a-dimension-to-an-array" href="#SPREAD">7.203 <code>SPREAD</code> &mdash; Add a dimension to an array</a></li>
    <li><a name="toc-SQRT-_002d_002d_002d-Square_002droot-function" href="#SQRT">7.204 <code>SQRT</code> &mdash; Square-root function</a></li>
    <li><a name="toc-SRAND-_002d_002d_002d-Reinitialize-the-random-number-generator" href="#SRAND">7.205 <code>SRAND</code> &mdash; Reinitialize the random number generator</a></li>
    <li><a name="toc-STAT-_002d_002d_002d-Get-file-status" href="#STAT">7.206 <code>STAT</code> &mdash; Get file status</a></li>
    <li><a name="toc-SUM-_002d_002d_002d-Sum-of-array-elements" href="#SUM">7.207 <code>SUM</code> &mdash; Sum of array elements</a></li>
    <li><a name="toc-SYMLNK-_002d_002d_002d-Create-a-symbolic-link" href="#SYMLNK">7.208 <code>SYMLNK</code> &mdash; Create a symbolic link</a></li>
    <li><a name="toc-SYSTEM-_002d_002d_002d-Execute-a-shell-command" href="#SYSTEM">7.209 <code>SYSTEM</code> &mdash; Execute a shell command</a></li>
    <li><a name="toc-SYSTEM_005fCLOCK-_002d_002d_002d-Time-function" href="#SYSTEM_005fCLOCK">7.210 <code>SYSTEM_CLOCK</code> &mdash; Time function</a></li>
    <li><a name="toc-TAN-_002d_002d_002d-Tangent-function" href="#TAN">7.211 <code>TAN</code> &mdash; Tangent function</a></li>
    <li><a name="toc-TANH-_002d_002d_002d-Hyperbolic-tangent-function" href="#TANH">7.212 <code>TANH</code> &mdash; Hyperbolic tangent function</a></li>
    <li><a name="toc-TIME-_002d_002d_002d-Time-function" href="#TIME">7.213 <code>TIME</code> &mdash; Time function</a></li>
    <li><a name="toc-TIME8-_002d_002d_002d-Time-function-_002864_002dbit_0029" href="#TIME8">7.214 <code>TIME8</code> &mdash; Time function (64-bit)</a></li>
    <li><a name="toc-TINY-_002d_002d_002d-Smallest-positive-number-of-a-real-kind" href="#TINY">7.215 <code>TINY</code> &mdash; Smallest positive number of a real kind</a></li>
    <li><a name="toc-TRAILZ-_002d_002d_002d-Number-of-trailing-zero-bits-of-an-integer" href="#TRAILZ">7.216 <code>TRAILZ</code> &mdash; Number of trailing zero bits of an integer</a></li>
    <li><a name="toc-TRANSFER-_002d_002d_002d-Transfer-bit-patterns" href="#TRANSFER">7.217 <code>TRANSFER</code> &mdash; Transfer bit patterns</a></li>
    <li><a name="toc-TRANSPOSE-_002d_002d_002d-Transpose-an-array-of-rank-two" href="#TRANSPOSE">7.218 <code>TRANSPOSE</code> &mdash; Transpose an array of rank two</a></li>
    <li><a name="toc-TRIM-_002d_002d_002d-Remove-trailing-blank-characters-of-a-string" href="#TRIM">7.219 <code>TRIM</code> &mdash; Remove trailing blank characters of a string</a></li>
    <li><a name="toc-TTYNAM-_002d_002d_002d-Get-the-name-of-a-terminal-device_002e" href="#TTYNAM">7.220 <code>TTYNAM</code> &mdash; Get the name of a terminal device.</a></li>
    <li><a name="toc-UBOUND-_002d_002d_002d-Upper-dimension-bounds-of-an-array" href="#UBOUND">7.221 <code>UBOUND</code> &mdash; Upper dimension bounds of an array</a></li>
    <li><a name="toc-UMASK-_002d_002d_002d-Set-the-file-creation-mask" href="#UMASK">7.222 <code>UMASK</code> &mdash; Set the file creation mask</a></li>
    <li><a name="toc-UNLINK-_002d_002d_002d-Remove-a-file-from-the-file-system" href="#UNLINK">7.223 <code>UNLINK</code> &mdash; Remove a file from the file system</a></li>
    <li><a name="toc-UNPACK-_002d_002d_002d-Unpack-an-array-of-rank-one-into-an-array" href="#UNPACK">7.224 <code>UNPACK</code> &mdash; Unpack an array of rank one into an array</a></li>
    <li><a name="toc-VERIFY-_002d_002d_002d-Scan-a-string-for-the-absence-of-a-set-of-characters" href="#VERIFY">7.225 <code>VERIFY</code> &mdash; Scan a string for the absence of a set of characters</a></li>
    <li><a name="toc-XOR-_002d_002d_002d-Bitwise-logical-exclusive-OR" href="#XOR">7.226 <code>XOR</code> &mdash; Bitwise logical exclusive OR</a></li>
  </ul></li>
  <li><a name="toc-Intrinsic-Modules-1" href="#Intrinsic-Modules">8 Intrinsic Modules</a>
  <ul class="no-bullet">
    <li><a name="toc-ISO_005fFORTRAN_005fENV" href="#ISO_005fFORTRAN_005fENV">8.1 <code>ISO_FORTRAN_ENV</code></a></li>
    <li><a name="toc-ISO_005fC_005fBINDING" href="#ISO_005fC_005fBINDING">8.2 <code>ISO_C_BINDING</code></a></li>
    <li><a name="toc-OpenMP-Modules-OMP_005fLIB-and-OMP_005fLIB_005fKINDS" href="#OpenMP-Modules-OMP_005fLIB-and-OMP_005fLIB_005fKINDS">8.3 OpenMP Modules <code>OMP_LIB</code> and <code>OMP_LIB_KINDS</code></a></li>
  </ul></li>
  <li><a name="toc-Contributing-1" href="#Contributing">Contributing</a>
  <ul class="no-bullet">
    <li><a name="toc-Contributors-to-GNU-Fortran" href="#Contributors">Contributors to GNU Fortran</a></li>
    <li><a name="toc-Projects-1" href="#Projects">Projects</a></li>
    <li><a name="toc-Proposed-Extensions-1" href="#Proposed-Extensions">Proposed Extensions</a>
    <ul class="no-bullet">
      <li><a name="toc-Compiler-extensions_003a" href="#Compiler-extensions_003a">Compiler extensions:</a></li>
      <li><a name="toc-Environment-Options" href="#Environment-Options">Environment Options</a></li>
    </ul></li>
  </ul></li>
  <li><a name="toc-GNU-General-Public-License" href="#Copying">GNU General Public License</a></li>
  <li><a name="toc-GNU-Free-Documentation-License-1" href="#GNU-Free-Documentation-License">GNU Free Documentation License</a>
  <ul class="no-bullet">
    <li><a name="toc-ADDENDUM_003a-How-to-use-this-License-for-your-documents" href="#ADDENDUM_003a-How-to-use-this-License-for-your-documents">ADDENDUM: How to use this License for your documents</a></li>
  </ul></li>
  <li><a name="toc-Funding-Free-Software" href="#Funding">Funding Free Software</a></li>
  <li><a name="toc-Option-Index-1" href="#Option-Index">Option Index</a></li>
  <li><a name="toc-Keyword-Index-1" href="#Keyword-Index">Keyword Index</a></li>
</ul>
</div>




<a name="Top"></a>
<div class="header">
<p>
Next: <a href="#Introduction" accesskey="n" rel="next">Introduction</a>, Up: <a href="dir.html#Top" accesskey="u" rel="up">(dir)</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Introduction-1"></a>
<h1 class="top">Introduction</h1>
<a name="index-Introduction"></a>

<p>This manual documents the use of <code>gfortran</code>, 
the GNU Fortran compiler. You can find in this manual how to invoke
<code>gfortran</code>, as well as its features and incompatibilities.
</p>

<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#Introduction" accesskey="1">Introduction</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Part I: Invoking GNU Fortran
</pre></th></tr><tr><td align="left" valign="top">&bull; <a href="#Invoking-GNU-Fortran" accesskey="2">Invoking GNU Fortran</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Command options supported by <code>gfortran</code>.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Runtime" accesskey="3">Runtime</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Influencing runtime behavior with environment variables.
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
Part II: Language Reference
</pre></th></tr><tr><td align="left" valign="top">&bull; <a href="#Fortran-2003-and-2008-status" accesskey="4">Fortran 2003 and 2008 status</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Fortran 2003 and 2008 features supported by GNU Fortran.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Compiler-Characteristics" accesskey="5">Compiler Characteristics</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">User-visible implementation details.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Extensions" accesskey="6">Extensions</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Language extensions implemented by GNU Fortran.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Intrinsic-Procedures" accesskey="7">Intrinsic Procedures</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Intrinsic procedures supported by GNU Fortran.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Intrinsic-Modules" accesskey="8">Intrinsic Modules</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Intrinsic modules supported by GNU Fortran.
</td></tr>
<tr><th colspan="3" align="left" valign="top"><pre class="menu-comment">
</pre></th></tr><tr><td align="left" valign="top">&bull; <a href="#Contributing" accesskey="9">Contributing</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">How you can help.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Copying">Copying</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">GNU General Public License says
                         how you can copy and share GNU Fortran.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GNU-Free-Documentation-License">GNU Free Documentation License</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
                         How you can copy and share this manual.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Funding">Funding</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">How to help assure continued work for free software.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Option-Index">Option Index</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Index of command line options
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Keyword-Index">Keyword Index</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Index of concepts
</td></tr>
</table>


<hr>
<a name="Introduction"></a>
<div class="header">
<p>
Next: <a href="#Invoking-GNU-Fortran" accesskey="n" rel="next">Invoking GNU Fortran</a>, Previous: <a href="#Top" accesskey="p" rel="prev">Top</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Introduction-2"></a>
<h2 class="chapter">1 Introduction</h2>


<p>The GNU Fortran compiler front end was
designed initially as a free replacement for,
or alternative to, the unix <code>f95</code> command;
<code>gfortran</code> is the command you&rsquo;ll use to invoke the compiler.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#About-GNU-Fortran" accesskey="1">About GNU Fortran</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">What you should know about the GNU Fortran compiler.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GNU-Fortran-and-GCC" accesskey="2">GNU Fortran and GCC</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">You can compile Fortran, C, or other programs.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Preprocessing-and-conditional-compilation" accesskey="3">Preprocessing and conditional compilation</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">The Fortran preprocessor
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GNU-Fortran-and-G77" accesskey="4">GNU Fortran and G77</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Why we chose to start from scratch.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Project-Status" accesskey="5">Project Status</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Status of GNU Fortran, roadmap, proposed extensions.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Standards" accesskey="6">Standards</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Standards supported by GNU Fortran.
</td></tr>
</table>



<hr>
<a name="About-GNU-Fortran"></a>
<div class="header">
<p>
Next: <a href="#GNU-Fortran-and-GCC" accesskey="n" rel="next">GNU Fortran and GCC</a>, Up: <a href="#Introduction" accesskey="u" rel="up">Introduction</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="About-GNU-Fortran-1"></a>
<h3 class="section">1.1 About GNU Fortran</h3>

<p>The GNU Fortran compiler is still in an early state of development.
It can generate code for most constructs and expressions,
but much work remains to be done.
</p>
<p>When the GNU Fortran compiler is finished,
it will do everything you expect from any decent compiler: 
</p>
<ul>
<li> Read a user&rsquo;s program,
stored in a file and containing instructions written
in Fortran 77, Fortran 90, Fortran 95, Fortran 2003 or Fortran 2008.
This file contains <em>source code</em>.

</li><li> Translate the user&rsquo;s program into instructions a computer
can carry out more quickly than it takes to translate the
instructions in the first
place.  The result after compilation of a program is
<em>machine code</em>,
code designed to be efficiently translated and processed
by a machine such as your computer.
Humans usually aren&rsquo;t as good writing machine code
as they are at writing Fortran (or C++, Ada, or Java),
because it is easy to make tiny mistakes writing machine code.

</li><li> Provide the user with information about the reasons why
the compiler is unable to create a binary from the source code.
Usually this will be the case if the source code is flawed.
The Fortran 90 standard requires that the compiler can point out
mistakes to the user.
An incorrect usage of the language causes an <em>error message</em>.

<p>The compiler will also attempt to diagnose cases where the
user&rsquo;s program contains a correct usage of the language,
but instructs the computer to do something questionable.
This kind of diagnostics message is called a <em>warning message</em>.
</p>
</li><li> Provide optional information about the translation passes
from the source code to machine code.
This can help a user of the compiler to find the cause of
certain bugs which may not be obvious in the source code,
but may be more easily found at a lower level compiler output.
It also helps developers to find bugs in the compiler itself.

</li><li> Provide information in the generated machine code that can
make it easier to find bugs in the program (using a debugging tool,
called a <em>debugger</em>, such as the GNU Debugger <code>gdb</code>). 

</li><li> Locate and gather machine code already generated to
perform actions requested by statements in the user&rsquo;s program.
This machine code is organized into <em>modules</em> and is located
and <em>linked</em> to the user program. 
</li></ul>

<p>The GNU Fortran compiler consists of several components:
</p>
<ul>
<li> A version of the <code>gcc</code> command
(which also might be installed as the system&rsquo;s <code>cc</code> command)
that also understands and accepts Fortran source code.
The <code>gcc</code> command is the <em>driver</em> program for
all the languages in the GNU Compiler Collection (GCC);
With <code>gcc</code>,
you can compile the source code of any language for
which a front end is available in GCC.

</li><li> The <code>gfortran</code> command itself,
which also might be installed as the
system&rsquo;s <code>f95</code> command.
<code>gfortran</code> is just another driver program,
but specifically for the Fortran compiler only.
The difference with <code>gcc</code> is that <code>gfortran</code>
will automatically link the correct libraries to your program.

</li><li> A collection of run-time libraries.
These libraries contain the machine code needed to support
capabilities of the Fortran language that are not directly
provided by the machine code generated by the
<code>gfortran</code> compilation phase,
such as intrinsic functions and subroutines,
and routines for interaction with files and the operating system.

</li><li> The Fortran compiler itself, (<code>f951</code>).
This is the GNU Fortran parser and code generator,
linked to and interfaced with the GCC backend library.
<code>f951</code> &ldquo;translates&rdquo; the source code to
assembler code.  You would typically not use this
program directly;
instead, the <code>gcc</code> or <code>gfortran</code> driver
programs will call it for you.
</li></ul>



<hr>
<a name="GNU-Fortran-and-GCC"></a>
<div class="header">
<p>
Next: <a href="#Preprocessing-and-conditional-compilation" accesskey="n" rel="next">Preprocessing and conditional compilation</a>, Previous: <a href="#About-GNU-Fortran" accesskey="p" rel="prev">About GNU Fortran</a>, Up: <a href="#Introduction" accesskey="u" rel="up">Introduction</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNU-Fortran-and-GCC-1"></a>
<h3 class="section">1.2 GNU Fortran and GCC</h3>
<a name="index-GNU-Compiler-Collection"></a>
<a name="index-GCC"></a>

<p>GNU Fortran is a part of GCC, the <em>GNU Compiler Collection</em>.  GCC
consists of a collection of front ends for various languages, which
translate the source code into a language-independent form called
<em>GENERIC</em>.  This is then processed by a common middle end which
provides optimization, and then passed to one of a collection of back
ends which generate code for different computer architectures and
operating systems.
</p>
<p>Functionally, this is implemented with a driver program (<code>gcc</code>)
which provides the command-line interface for the compiler.  It calls
the relevant compiler front-end program (e.g., <code>f951</code> for
Fortran) for each file in the source code, and then calls the assembler
and linker as appropriate to produce the compiled output. In a copy of
GCC which has been compiled with Fortran language support enabled,
<code>gcc</code> will recognize files with <samp>.f</samp>, <samp>.for</samp>, <samp>.ftn</samp>,
<samp>.f90</samp>, <samp>.f95</samp>, <samp>.f03</samp> and <samp>.f08</samp> extensions as
Fortran source code, and compile it accordingly. A <code>gfortran</code>
driver program is also provided, which is identical to <code>gcc</code>
except that it automatically links the Fortran runtime libraries into the
compiled program.
</p>
<p>Source files with <samp>.f</samp>, <samp>.for</samp>, <samp>.fpp</samp>, <samp>.ftn</samp>, <samp>.F</samp>,
<samp>.FOR</samp>, <samp>.FPP</samp>, and <samp>.FTN</samp> extensions are treated as fixed form.
Source files with <samp>.f90</samp>, <samp>.f95</samp>, <samp>.f03</samp>, <samp>.f08</samp>,
<samp>.F90</samp>, <samp>.F95</samp>, <samp>.F03</samp> and <samp>.F08</samp> extensions are
treated as free form.  The capitalized versions of either form are run
through preprocessing. Source files with the lower case <samp>.fpp</samp>
extension are also run through preprocessing.
</p>
<p>This manual specifically documents the Fortran front end, which handles
the programming language&rsquo;s syntax and semantics.  The aspects of GCC
which relate to the optimization passes and the back-end code generation
are documented in the GCC manual; see 
<a href="http://gcc.gnu.org/onlinedocs/gcc/index.html#Top">Introduction</a> in <cite>Using the GNU Compiler Collection (GCC)</cite>.
The two manuals together provide a complete reference for the GNU
Fortran compiler.
</p>


<hr>
<a name="Preprocessing-and-conditional-compilation"></a>
<div class="header">
<p>
Next: <a href="#GNU-Fortran-and-G77" accesskey="n" rel="next">GNU Fortran and G77</a>, Previous: <a href="#GNU-Fortran-and-GCC" accesskey="p" rel="prev">GNU Fortran and GCC</a>, Up: <a href="#Introduction" accesskey="u" rel="up">Introduction</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Preprocessing-and-conditional-compilation-1"></a>
<h3 class="section">1.3 Preprocessing and conditional compilation</h3>
<a name="index-CPP"></a>
<a name="index-FPP"></a>
<a name="index-Conditional-compilation"></a>
<a name="index-Preprocessing"></a>
<a name="index-preprocessor_002c-include-file-handling"></a>

<p>Many Fortran compilers including GNU Fortran allow passing the source code
through a C preprocessor (CPP; sometimes also called the Fortran preprocessor,
FPP) to allow for conditional compilation. In the case of GNU Fortran,
this is the GNU C Preprocessor in the traditional mode. On systems with
case-preserving file names, the preprocessor is automatically invoked if the
filename extension is <code>.F</code>, <code>.FOR</code>, <code>.FTN</code>, <code>.fpp</code>,
<code>.FPP</code>, <code>.F90</code>, <code>.F95</code>, <code>.F03</code> or <code>.F08</code>. To manually
invoke the preprocessor on any file, use <samp>-cpp</samp>, to disable
preprocessing on files where the preprocessor is run automatically, use
<samp>-nocpp</samp>.
</p>
<p>If a preprocessed file includes another file with the Fortran <code>INCLUDE</code>
statement, the included file is not preprocessed. To preprocess included
files, use the equivalent preprocessor statement <code>#include</code>.
</p>
<p>If GNU Fortran invokes the preprocessor, <code>__GFORTRAN__</code>
is defined and <code>__GNUC__</code>, <code>__GNUC_MINOR__</code> and
<code>__GNUC_PATCHLEVEL__</code> can be used to determine the version of the
compiler. See <a href="http://gcc.gnu.org/onlinedocs/cpp/index.html#Top">Overview</a> in <cite>The C Preprocessor</cite> for details.
</p>
<p>While CPP is the de-facto standard for preprocessing Fortran code,
Part 3 of the Fortran 95 standard (ISO/IEC 1539-3:1998) defines
Conditional Compilation, which is not widely used and not directly
supported by the GNU Fortran compiler. You can use the program coco
to preprocess such files (<a href="http://users.erols.com/dnagle/coco.html">http://users.erols.com/dnagle/coco.html</a>).
</p>


<hr>
<a name="GNU-Fortran-and-G77"></a>
<div class="header">
<p>
Next: <a href="#Project-Status" accesskey="n" rel="next">Project Status</a>, Previous: <a href="#Preprocessing-and-conditional-compilation" accesskey="p" rel="prev">Preprocessing and conditional compilation</a>, Up: <a href="#Introduction" accesskey="u" rel="up">Introduction</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNU-Fortran-and-G77-1"></a>
<h3 class="section">1.4 GNU Fortran and G77</h3>
<a name="index-Fortran-77"></a>
<a name="index-g77"></a>

<p>The GNU Fortran compiler is the successor to <code>g77</code>, the Fortran 
77 front end included in GCC prior to version 4.  It is an entirely new 
program that has been designed to provide Fortran 95 support and 
extensibility for future Fortran language standards, as well as providing 
backwards compatibility for Fortran 77 and nearly all of the GNU language 
extensions supported by <code>g77</code>.
</p>


<hr>
<a name="Project-Status"></a>
<div class="header">
<p>
Next: <a href="#Standards" accesskey="n" rel="next">Standards</a>, Previous: <a href="#GNU-Fortran-and-G77" accesskey="p" rel="prev">GNU Fortran and G77</a>, Up: <a href="#Introduction" accesskey="u" rel="up">Introduction</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Project-Status-1"></a>
<h3 class="section">1.5 Project Status</h3>

<blockquote>
<p>As soon as <code>gfortran</code> can parse all of the statements correctly,
it will be in the &ldquo;larva&rdquo; state.
When we generate code, the &ldquo;puppa&rdquo; state.
When <code>gfortran</code> is done,
we&rsquo;ll see if it will be a beautiful butterfly,
or just a big bug....
</p>
<p>&ndash;Andy Vaught, April 2000
</p></blockquote>

<p>The start of the GNU Fortran 95 project was announced on
the GCC homepage in March 18, 2000
(even though Andy had already been working on it for a while,
of course).
</p>
<p>The GNU Fortran compiler is able to compile nearly all
standard-compliant Fortran 95, Fortran 90, and Fortran 77 programs,
including a number of standard and non-standard extensions, and can be
used on real-world programs.  In particular, the supported extensions
include OpenMP, Cray-style pointers, and several Fortran 2003 and Fortran
2008 features such as enumeration, stream I/O, and some of the
enhancements to allocatable array support from TR 15581.  However, it is
still under development and has a few remaining rough edges.
</p>
<p>At present, the GNU Fortran compiler passes the
<a href="http://www.fortran-2000.com/ArnaudRecipes/fcvs21_f95.html">NIST Fortran 77 Test Suite</a>, and produces acceptable results on the
<a href="http://www.netlib.org/lapack/faq.html#1.21">LAPACK Test Suite</a>.
It also provides respectable performance on 
the <a href="http://www.polyhedron.com/pb05.html">Polyhedron Fortran
compiler benchmarks</a> and the
<a href="http://www.llnl.gov/asci_benchmarks/asci/limited/lfk/README.html">Livermore Fortran Kernels test</a>.  It has been used to compile a number of
large real-world programs, including
<a href="http://mysite.verizon.net/serveall/moene.pdf">the HIRLAM
weather-forecasting code</a> and
<a href="http://www.theochem.uwa.edu.au/tonto/">the Tonto quantum 
chemistry package</a>; see <a href="http://gcc.gnu.org/wiki/GfortranApps">http://gcc.gnu.org/wiki/GfortranApps</a> for an
extended list.
</p>
<p>Among other things, the GNU Fortran compiler is intended as a replacement
for G77.  At this point, nearly all programs that could be compiled with
G77 can be compiled with GNU Fortran, although there are a few minor known
regressions.
</p>
<p>The primary work remaining to be done on GNU Fortran falls into three
categories: bug fixing (primarily regarding the treatment of invalid code
and providing useful error messages), improving the compiler optimizations
and the performance of compiled code, and extending the compiler to support
future standards&mdash;in particular, Fortran 2003.
</p>


<hr>
<a name="Standards"></a>
<div class="header">
<p>
Previous: <a href="#Project-Status" accesskey="p" rel="prev">Project Status</a>, Up: <a href="#Introduction" accesskey="u" rel="up">Introduction</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Standards-1"></a>
<h3 class="section">1.6 Standards</h3>
<a name="index-Standards"></a>

<p>The GNU Fortran compiler implements
ISO/IEC 1539:1997 (Fortran 95).  As such, it can also compile essentially all
standard-compliant Fortran 90 and Fortran 77 programs.   It also supports
the ISO/IEC TR-15581 enhancements to allocatable arrays, and
the <a href="http://www.openmp.org/drupal/mp-documents/spec25.pdf">OpenMP Application Program Interface v2.5</a> specification.
</p>
<p>In the future, the GNU Fortran compiler will also support ISO/IEC
1539-1:2004 (Fortran 2003) and future Fortran standards. Partial support
of that standard is already provided; the current status of Fortran 2003
support is reported in the <a href="#Fortran-2003-status">Fortran 2003 status</a> section of the
documentation.
</p>
<p>The next version of the Fortran standard after Fortran 2003 is currently
being developed and the GNU Fortran compiler supports some of its new
features. This support is based on the latest draft of the standard
(available from <a href="http://www.nag.co.uk/sc22wg5/">http://www.nag.co.uk/sc22wg5/</a>) and no guarantee of
future compatibility is made, as the final standard might differ from the
draft. For more information, see the <a href="#Fortran-2008-status">Fortran 2008 status</a> section.
</p>






<hr>
<a name="Invoking-GNU-Fortran"></a>
<div class="header">
<p>
Next: <a href="#Runtime" accesskey="n" rel="next">Runtime</a>, Previous: <a href="#Introduction" accesskey="p" rel="prev">Introduction</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNU-Fortran-Command-Options"></a>
<h2 class="chapter">2 GNU Fortran Command Options</h2>
<a name="index-GNU-Fortran-command-options"></a>
<a name="index-command-options"></a>
<a name="index-options_002c-gfortran-command"></a>


<p>The <code>gfortran</code> command supports all the options supported by the
<code>gcc</code> command.  Only options specific to GNU Fortran are documented here.
</p>
<p>See <a href="http://gcc.gnu.org/onlinedocs/gcc/Invoking-GCC.html#Invoking-GCC">GCC Command Options</a> in <cite>Using the GNU Compiler
Collection (GCC)</cite>, for information
on the non-Fortran-specific aspects of the <code>gcc</code> command (and,
therefore, the <code>gfortran</code> command).
</p>
<a name="index-options_002c-negative-forms"></a>
<p>All GCC and GNU Fortran options
are accepted both by <code>gfortran</code> and by <code>gcc</code>
(as well as any other drivers built at the same time,
such as <code>g++</code>),
since adding GNU Fortran to the GCC distribution
enables acceptance of GNU Fortran options
by all of the relevant drivers.
</p>
<p>In some cases, options have positive and negative forms;
the negative form of <samp>-ffoo</samp> would be <samp>-fno-foo</samp>.
This manual documents only one of these two forms, whichever
one is not the default.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#Option-Summary" accesskey="1">Option Summary</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Brief list of all <code>gfortran</code> options,
                        without explanations.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Fortran-Dialect-Options" accesskey="2">Fortran Dialect Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Controlling the variant of Fortran language
                             compiled.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Preprocessing-Options" accesskey="3">Preprocessing Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Enable and customize preprocessing.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Error-and-Warning-Options" accesskey="4">Error and Warning Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">How picky should the compiler be?
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Debugging-Options" accesskey="5">Debugging Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Symbol tables, measurements, and debugging dumps.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Directory-Options" accesskey="6">Directory Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Where to find module files
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Link-Options" accesskey="7">Link Options </a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Influencing the linking step
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Runtime-Options" accesskey="8">Runtime Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Influencing runtime behavior
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Code-Gen-Options" accesskey="9">Code Gen Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Specifying conventions for function calls, data layout
                        and register usage.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Environment-Variables">Environment Variables</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Environment variables that affect <code>gfortran</code>.
</td></tr>
</table>

<hr>
<a name="Option-Summary"></a>
<div class="header">
<p>
Next: <a href="#Fortran-Dialect-Options" accesskey="n" rel="next">Fortran Dialect Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Option-summary"></a>
<h3 class="section">2.1 Option summary</h3>


<p>Here is a summary of all the options specific to GNU Fortran, grouped
by type.  Explanations are in the following sections.
</p>
<dl compact="compact">
<dt><em>Fortran Language Options</em></dt>
<dd><p>See <a href="#Fortran-Dialect-Options">Options controlling Fortran dialect</a>.
</p><div class="smallexample">
<pre class="smallexample">-fall-intrinsics  -ffree-form  -fno-fixed-form 
-fdollar-ok  -fimplicit-none  -fmax-identifier-length 
-std=<var>std</var> -fd-lines-as-code  -fd-lines-as-comments 
-ffixed-line-length-<var>n</var>  -ffixed-line-length-none 
-ffree-line-length-<var>n</var>  -ffree-line-length-none 
-fdefault-double-8  -fdefault-integer-8  -fdefault-real-8 
-fcray-pointer  -fopenmp  -fno-range-check -fbackslash -fmodule-private
</pre></div>

</dd>
<dt><em>Preprocessing Options</em></dt>
<dd><p>See <a href="#Preprocessing-Options">Enable and customize preprocessing</a>.
</p><div class="smallexample">
<pre class="smallexample">-cpp -dD -dI -dM -dN -dU -fworking-directory 
-imultilib <var>dir</var> -iprefix <var>file</var> -isysroot <var>dir</var> 
-iquote -isystem <var>dir</var> -nocpp -nostdinc -undef 
-A<var>question</var>=<var>answer</var> -A-<var>question</var><span class="roman">[</span>=<var>answer</var><span class="roman">]</span> 
-C -CC -D<var>macro</var><span class="roman">[</span>=<var>defn</var><span class="roman">]</span> -U<var>macro</var> -H -P
</pre></div>

</dd>
<dt><em>Error and Warning Options</em></dt>
<dd><p>See <a href="#Error-and-Warning-Options">Options to request or suppress errors
and warnings</a>.
</p><div class="smallexample">
<pre class="smallexample">-fmax-errors=<var>n</var> 
-fsyntax-only  -pedantic  -pedantic-errors 
-Wall  -Waliasing  -Wampersand  -Warray-bounds -Wcharacter-truncation 
-Wconversion -Wimplicit-interface  -Wline-truncation  -Wintrinsics-std 
-Wsurprising -Wno-tabs  -Wunderflow -Wunused-parameter -Wintrinsics-shadow 
-Wno-align-commons
</pre></div>

</dd>
<dt><em>Debugging Options</em></dt>
<dd><p>See <a href="#Debugging-Options">Options for debugging your program or GNU Fortran</a>.
</p><div class="smallexample">
<pre class="smallexample">-fdump-parse-tree  -ffpe-trap=<var>list</var> 
-fdump-core -fbacktrace
</pre></div>

</dd>
<dt><em>Directory Options</em></dt>
<dd><p>See <a href="#Directory-Options">Options for directory search</a>.
</p><div class="smallexample">
<pre class="smallexample">-I<var>dir</var>  -J<var>dir</var> -fintrinsic-modules-path <var>dir</var>
</pre></div>

</dd>
<dt><em>Link Options</em></dt>
<dd><p>See <a href="#Link-Options">Options for influencing the linking step</a>.
</p><div class="smallexample">
<pre class="smallexample">-static-libgfortran
</pre></div>

</dd>
<dt><em>Runtime Options</em></dt>
<dd><p>See <a href="#Runtime-Options">Options for influencing runtime behavior</a>.
</p><div class="smallexample">
<pre class="smallexample">-fconvert=<var>conversion</var>  -fno-range-check
-frecord-marker=<var>length</var>   -fmax-subrecord-length=<var>length</var>
-fsign-zero
</pre></div>

</dd>
<dt><em>Code Generation Options</em></dt>
<dd><p>See <a href="#Code-Gen-Options">Options for code generation conventions</a>.
</p><div class="smallexample">
<pre class="smallexample">-fno-automatic  -ff2c  -fno-underscoring 
-fsecond-underscore 
-fbounds-check -fcheck-array-temporaries  -fmax-array-constructor =<var>n</var> 
-fmax-stack-var-size=<var>n</var> 
-fpack-derived  -frepack-arrays  -fshort-enums  -fexternal-blas 
-fblas-matmul-limit=<var>n</var> -frecursive -finit-local-zero 
-finit-integer=<var>n</var> -finit-real=<var>&lt;zero|inf|-inf|nan&gt;</var> 
-finit-logical=<var>&lt;true|false&gt;</var> -finit-character=<var>n</var> -fno-align-commons
</pre></div>
</dd>
</dl>

<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#Fortran-Dialect-Options" accesskey="1">Fortran Dialect Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Controlling the variant of Fortran language
                             compiled.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Preprocessing-Options" accesskey="2">Preprocessing Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Enable and customize preprocessing.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Error-and-Warning-Options" accesskey="3">Error and Warning Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">How picky should the compiler be?
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Debugging-Options" accesskey="4">Debugging Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Symbol tables, measurements, and debugging dumps.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Directory-Options" accesskey="5">Directory Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Where to find module files
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Link-Options" accesskey="6">Link Options </a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Influencing the linking step
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Runtime-Options" accesskey="7">Runtime Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Influencing runtime behavior
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Code-Gen-Options" accesskey="8">Code Gen Options</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Specifying conventions for function calls, data layout
                        and register usage.
</td></tr>
</table>

<hr>
<a name="Fortran-Dialect-Options"></a>
<div class="header">
<p>
Next: <a href="#Preprocessing-Options" accesskey="n" rel="next">Preprocessing Options</a>, Previous: <a href="#Option-Summary" accesskey="p" rel="prev">Option Summary</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Options-controlling-Fortran-dialect"></a>
<h3 class="section">2.2 Options controlling Fortran dialect</h3>
<a name="index-dialect-options"></a>
<a name="index-language_002c-dialect-options"></a>
<a name="index-options_002c-dialect"></a>

<p>The following options control the details of the Fortran dialect
accepted by the compiler:
</p>
<dl compact="compact">
<dt><code>-ffree-form</code></dt>
<dt><code>-ffixed-form</code></dt>
<dd><a name="index-ffree_002dform"></a>
<a name="index-fno_002dfixed_002dform"></a>
<a name="index-options_002c-fortran-dialect"></a>
<a name="index-file-format_002c-free"></a>
<a name="index-file-format_002c-fixed"></a>
<p>Specify the layout used by the source file.  The free form layout
was introduced in Fortran 90.  Fixed form was traditionally used in
older Fortran programs.  When neither option is specified, the source
form is determined by the file extension.
</p>
</dd>
<dt><code>-fall-intrinsics</code></dt>
<dd><a name="index-fall_002dintrinsics"></a>
<p>This option causes all intrinsic procedures (including the GNU-specific
extensions) to be accepted.  This can be useful with <samp>-std=f95</samp> to
force standard-compliance but get access to the full range of intrinsics
available with <code>gfortran</code>.  As a consequence, <samp>-Wintrinsics-std</samp>
will be ignored and no user-defined procedure with the same name as any
intrinsic will be called except when it is explicitly declared <code>EXTERNAL</code>.
</p>
</dd>
<dt><code>-fd-lines-as-code</code></dt>
<dt><code>-fd-lines-as-comments</code></dt>
<dd><a name="index-fd_002dlines_002das_002dcode"></a>
<a name="index-fd_002dlines_002das_002dcomments"></a>
<p>Enable special treatment for lines beginning with <code>d</code> or <code>D</code>
in fixed form sources.  If the <samp>-fd-lines-as-code</samp> option is
given they are treated as if the first column contained a blank.  If the
<samp>-fd-lines-as-comments</samp> option is given, they are treated as
comment lines.
</p>
</dd>
<dt><code>-fdefault-double-8</code></dt>
<dd><a name="index-fdefault_002ddouble_002d8"></a>
<p>Set the <code>DOUBLE PRECISION</code> type to an 8 byte wide type.  If
<samp>-fdefault-real-8</samp> is given, <code>DOUBLE PRECISION</code> would
instead be promoted to 16 bytes if possible, and <samp>-fdefault-double-8</samp>
can be used to prevent this.  The kind of real constants like <code>1.d0</code> will
not be changed by <samp>-fdefault-real-8</samp> though, so also
<samp>-fdefault-double-8</samp> does not affect it.
</p>
</dd>
<dt><code>-fdefault-integer-8</code></dt>
<dd><a name="index-fdefault_002dinteger_002d8"></a>
<p>Set the default integer and logical types to an 8 byte wide type.
Do nothing if this is already the default.  This option also affects
the kind of integer constants like <code>42</code>.
</p>
</dd>
<dt><code>-fdefault-real-8</code></dt>
<dd><a name="index-fdefault_002dreal_002d8"></a>
<p>Set the default real type to an 8 byte wide type.
Do nothing if this is already the default.  This option also affects
the kind of non-double real constants like <code>1.0</code>, and does promote
the default width of <code>DOUBLE PRECISION</code> to 16 bytes if possible, unless
<code>-fdefault-double-8</code> is given, too.
</p>
</dd>
<dt><code>-fdollar-ok</code></dt>
<dd><a name="index-fdollar_002dok"></a>
<a name="index-_0024"></a>
<a name="index-symbol-names"></a>
<a name="index-character-set"></a>
<p>Allow &lsquo;<samp>$</samp>&rsquo; as a valid character in a symbol name.
</p>
</dd>
<dt><code>-fbackslash</code></dt>
<dd><a name="index-backslash-1"></a>
<a name="index-backslash"></a>
<a name="index-escape-characters"></a>
<p>Change the interpretation of backslashes in string literals from a single
backslash character to &ldquo;C-style&rdquo; escape characters. The following
combinations are expanded <code>\a</code>, <code>\b</code>, <code>\f</code>, <code>\n</code>,
<code>\r</code>, <code>\t</code>, <code>\v</code>, <code>\\</code>, and <code>\0</code> to the ASCII
characters alert, backspace, form feed, newline, carriage return,
horizontal tab, vertical tab, backslash, and NUL, respectively.
Additionally, <code>\x</code><var>nn</var>, <code>\u</code><var>nnnn</var> and
<code>\U</code><var>nnnnnnnn</var> (where each <var>n</var> is a hexadecimal digit) are
translated into the Unicode characters corresponding to the specified code
points. All other combinations of a character preceded by \ are
unexpanded.
</p>
</dd>
<dt><code>-fmodule-private</code></dt>
<dd><a name="index-fmodule_002dprivate"></a>
<a name="index-module-entities"></a>
<a name="index-private"></a>
<p>Set the default accessibility of module entities to <code>PRIVATE</code>.
Use-associated entities will not be accessible unless they are explicitly
declared as <code>PUBLIC</code>.
</p>
</dd>
<dt><code>-ffixed-line-length-<var>n</var></code></dt>
<dd><a name="index-ffixed_002dline_002dlength_002dn"></a>
<a name="index-file-format_002c-fixed-1"></a>
<p>Set column after which characters are ignored in typical fixed-form
lines in the source file, and through which spaces are assumed (as
if padded to that length) after the ends of short fixed-form lines.
</p>
<p>Popular values for <var>n</var> include 72 (the
standard and the default), 80 (card image), and 132 (corresponding
to &ldquo;extended-source&rdquo; options in some popular compilers).
<var>n</var> may also be &lsquo;<samp>none</samp>&rsquo;, meaning that the entire line is meaningful
and that continued character constants never have implicit spaces appended
to them to fill out the line.
<samp>-ffixed-line-length-0</samp> means the same thing as
<samp>-ffixed-line-length-none</samp>.
</p>
</dd>
<dt><code>-ffree-line-length-<var>n</var></code></dt>
<dd><a name="index-ffree_002dline_002dlength_002dn"></a>
<a name="index-file-format_002c-free-1"></a>
<p>Set column after which characters are ignored in typical free-form
lines in the source file. The default value is 132.
<var>n</var> may be &lsquo;<samp>none</samp>&rsquo;, meaning that the entire line is meaningful.
<samp>-ffree-line-length-0</samp> means the same thing as
<samp>-ffree-line-length-none</samp>.
</p>
</dd>
<dt><code>-fmax-identifier-length=<var>n</var></code></dt>
<dd><a name="index-fmax_002didentifier_002dlength_003dn"></a>
<p>Specify the maximum allowed identifier length. Typical values are
31 (Fortran 95) and 63 (Fortran 2003 and Fortran 2008).
</p>
</dd>
<dt><code>-fimplicit-none</code></dt>
<dd><a name="index-fimplicit_002dnone"></a>
<p>Specify that no implicit typing is allowed, unless overridden by explicit
<code>IMPLICIT</code> statements.  This is the equivalent of adding
<code>implicit none</code> to the start of every procedure.
</p>
</dd>
<dt><code>-fcray-pointer</code></dt>
<dd><a name="index-fcray_002dpointer"></a>
<p>Enable the Cray pointer extension, which provides C-like pointer
functionality.
</p>
</dd>
<dt><code>-fopenmp</code></dt>
<dd><a name="index-fopenmp"></a>
<a name="index-OpenMP"></a>
<p>Enable the OpenMP extensions.  This includes OpenMP <code>!$omp</code> directives
in free form
and <code>c$omp</code>, <code>*$omp</code> and <code>!$omp</code> directives in fixed form,
<code>!$</code> conditional compilation sentinels in free form
and <code>c$</code>, <code>*$</code> and <code>!$</code> sentinels in fixed form, 
and when linking arranges for the OpenMP runtime library to be linked
in.  The option <samp>-fopenmp</samp> implies <samp>-frecursive</samp>.
</p>
</dd>
<dt><code>-fno-range-check</code></dt>
<dd><a name="index-frange_002dcheck"></a>
<p>Disable range checking on results of simplification of constant
expressions during compilation.  For example, GNU Fortran will give
an error at compile time when simplifying <code>a = 1. / 0</code>.
With this option, no error will be given and <code>a</code> will be assigned
the value <code>+Infinity</code>.  If an expression evaluates to a value
outside of the relevant range of [<code>-HUGE()</code>:<code>HUGE()</code>],
then the expression will be replaced by <code>-Inf</code> or <code>+Inf</code>
as appropriate.
Similarly, <code>DATA i/Z'FFFFFFFF'/</code> will result in an integer overflow
on most systems, but with <samp>-fno-range-check</samp> the value will
&ldquo;wrap around&rdquo; and <code>i</code> will be initialized to <em>-1</em> instead.
</p>
</dd>
<dt><code>-std=<var>std</var></code></dt>
<dd><a name="index-std_003dstd-option"></a>
<p>Specify the standard to which the program is expected to conform, which
may be one of &lsquo;<samp>f95</samp>&rsquo;, &lsquo;<samp>f2003</samp>&rsquo;, &lsquo;<samp>f2008</samp>&rsquo;, &lsquo;<samp>gnu</samp>&rsquo;, or
&lsquo;<samp>legacy</samp>&rsquo;.  The default value for <var>std</var> is &lsquo;<samp>gnu</samp>&rsquo;, which
specifies a superset of the Fortran 95 standard that includes all of the
extensions supported by GNU Fortran, although warnings will be given for
obsolete extensions not recommended for use in new code.  The
&lsquo;<samp>legacy</samp>&rsquo; value is equivalent but without the warnings for obsolete
extensions, and may be useful for old non-standard programs.  The
&lsquo;<samp>f95</samp>&rsquo;, &lsquo;<samp>f2003</samp>&rsquo; and &lsquo;<samp>f2008</samp>&rsquo; values specify strict
conformance to the Fortran 95, Fortran 2003 and Fortran 2008 standards,
respectively; errors are given for all extensions beyond the relevant
language standard, and warnings are given for the Fortran 77 features
that are permitted but obsolescent in later standards.
</p>
</dd>
</dl>

<hr>
<a name="Preprocessing-Options"></a>
<div class="header">
<p>
Next: <a href="#Error-and-Warning-Options" accesskey="n" rel="next">Error and Warning Options</a>, Previous: <a href="#Fortran-Dialect-Options" accesskey="p" rel="prev">Fortran Dialect Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Enable-and-customize-preprocessing"></a>
<h3 class="section">2.3 Enable and customize preprocessing</h3>
<a name="index-preprocessor"></a>
<a name="index-options_002c-preprocessor"></a>
<a name="index-CPP-1"></a>

<p>Preprocessor related options. See section 
<a href="#Preprocessing-and-conditional-compilation">Preprocessing and conditional compilation</a> for more detailed
information on preprocessing in <code>gfortran</code>.
</p>
<dl compact="compact">
<dt><code>-cpp</code></dt>
<dt><code>-nocpp</code></dt>
<dd><a name="index-cpp"></a>
<a name="index-fpp"></a>
<a name="index-preprocessor_002c-enable"></a>
<a name="index-preprocessor_002c-disable"></a>
<p>Enable preprocessing. The preprocessor is automatically invoked if
the file extension is <samp>.fpp</samp>, <samp>.FPP</samp>,  <samp>.F</samp>, <samp>.FOR</samp>,
<samp>.FTN</samp>, <samp>.F90</samp>, <samp>.F95</samp>, <samp>.F03</samp> or <samp>.F08</samp>. Use
this option to manually enable preprocessing of any kind of Fortran file.
</p>
<p>To disable preprocessing of files with any of the above listed extensions,
use the negative form: <samp>-nocpp</samp>.
</p>
<p>The preprocessor is run in traditional mode, be aware that any
restrictions of the file-format, e.g. fixed-form line width,
apply for preprocessed output as well.
</p>
</dd>
<dt><code>-dM</code></dt>
<dd><a name="index-dM"></a>
<a name="index-preprocessor_002c-debugging"></a>
<a name="index-debugging_002c-preprocessor"></a>
<p>Instead of the normal output, generate a list of <code>'#define'</code>
directives for all the macros defined during the execution of the
preprocessor, including predefined macros. This gives you a way
of finding out what is predefined in your version of the preprocessor.
Assuming you have no file <samp>foo.f90</samp>, the command
</p><div class="smallexample">
<pre class="smallexample">  touch foo.f90; gfortran -cpp -dM foo.f90
</pre></div>
<p>will show all the predefined macros.
</p>
</dd>
<dt><code>-dD</code></dt>
<dd><a name="index-dD"></a>
<a name="index-preprocessor_002c-debugging-1"></a>
<a name="index-debugging_002c-preprocessor-1"></a>
<p>Like <samp>-dM</samp> except in two respects: it does not include the
predefined macros, and it outputs both the <code>#define</code> directives
and the result of preprocessing. Both kinds of output go to the
standard output file.
</p>
</dd>
<dt><code>-dN</code></dt>
<dd><a name="index-dN"></a>
<a name="index-preprocessor_002c-debugging-2"></a>
<a name="index-debugging_002c-preprocessor-2"></a>
<p>Like <samp>-dD</samp>, but emit only the macro names, not their expansions.
</p>
</dd>
<dt><code>-dU</code></dt>
<dd><a name="index-dU"></a>
<a name="index-preprocessor_002c-debugging-3"></a>
<a name="index-debugging_002c-preprocessor-3"></a>
<p>Like <samp>dD</samp> except that only macros that are expanded, or whose
definedness is tested in preprocessor directives, are output; the 
output is delayed until the use or test of the macro; and <code>'#undef'</code>
directives are also output for macros tested but undefined at the time.
</p>
</dd>
<dt><code>-dI</code></dt>
<dd><a name="index-dI"></a>
<a name="index-preprocessor_002c-debugging-4"></a>
<a name="index-debugging_002c-preprocessor-4"></a>
<p>Output <code>'#include'</code> directives in addition to the result
of preprocessing.
</p>
</dd>
<dt><code>-fworking-directory</code></dt>
<dd><a name="index-fworking_002ddirectory"></a>
<a name="index-preprocessor_002c-working-directory"></a>
<p>Enable generation of linemarkers in the preprocessor output that will
let the compiler know the current working directory at the time of
preprocessing. When this option is enabled, the preprocessor will emit,
after the initial linemarker, a second linemarker with the current
working directory followed by two slashes. GCC will use this directory,
when it&rsquo;s present in the preprocessed input, as the directory emitted
as the current working directory in some debugging information formats.
This option is implicitly enabled if debugging information is enabled,
but this can be inhibited with the negated form
<samp>-fno-working-directory</samp>. If the <samp>-P</samp> flag is present
in the command line, this option has no effect, since no <code>#line</code>
directives are emitted whatsoever.
</p>
</dd>
<dt><code>-idirafter <var>dir</var></code></dt>
<dd><a name="index-idirafter-dir"></a>
<a name="index-preprocessing_002c-include-path"></a>
<p>Search <var>dir</var> for include files, but do it after all directories
specified with <samp>-I</samp> and the standard system directories have
been exhausted. <var>dir</var> is treated as a system include directory.
If dir begins with <code>=</code>, then the <code>=</code> will be replaced by
the sysroot prefix; see <samp>--sysroot</samp> and <samp>-isysroot</samp>.
</p>
</dd>
<dt><code>-imultilib <var>dir</var></code></dt>
<dd><a name="index-imultilib-dir"></a>
<a name="index-preprocessing_002c-include-path-1"></a>
<p>Use <var>dir</var> as a subdirectory of the directory containing target-specific
C++ headers.
</p>
</dd>
<dt><code>-iprefix <var>prefix</var></code></dt>
<dd><a name="index-iprefix-prefix"></a>
<a name="index-preprocessing_002c-include-path-2"></a>
<p>Specify <var>prefix</var> as the prefix for subsequent <samp>-iwithprefix</samp>
options. If the <var>prefix</var> represents a directory, you should include
the final <code>'/'</code>.
</p>
</dd>
<dt><code>-isysroot <var>dir</var></code></dt>
<dd><a name="index-isysroot-dir"></a>
<a name="index-preprocessing_002c-include-path-3"></a>
<p>This option is like the <samp>--sysroot</samp> option, but applies only to
header files. See the <samp>--sysroot</samp> option for more information.
</p>
</dd>
<dt><code>-iquote <var>dir</var></code></dt>
<dd><a name="index-iquote-dir"></a>
<a name="index-preprocessing_002c-include-path-4"></a>
<p>Search <var>dir</var> only for header files requested with <code>#include &quot;file&quot;</code>;
they are not searched for <code>#include &lt;file&gt;</code>, before all directories
specified by <samp>-I</samp> and before the standard system directories. If
<var>dir</var> begins with <code>=</code>, then the <code>=</code> will be replaced by the
sysroot prefix; see <samp>--sysroot</samp> and <samp>-isysroot</samp>.
</p>
</dd>
<dt><code>-isystem <var>dir</var></code></dt>
<dd><a name="index-isystem-dir"></a>
<a name="index-preprocessing_002c-include-path-5"></a>
<p>Search <var>dir</var> for header files, after all directories specified by
<samp>-I</samp> but before the standard system directories. Mark it as a
system directory, so that it gets the same special treatment as is
applied to the standard system directories. If <var>dir</var> begins with
<code>=</code>, then the <code>=</code> will be replaced by the sysroot prefix;
see <samp>--sysroot</samp> and <samp>-isysroot</samp>.
</p>
</dd>
<dt><code>-nostdinc</code></dt>
<dd><a name="index-nostdinc"></a>
<p>Do not search the standard system directories for header files. Only
the directories you have specified with <samp>-I</samp> options (and the
directory of the current file, if appropriate) are searched.
</p>
</dd>
<dt><code>-undef</code></dt>
<dd><a name="index-undef"></a>
<p>Do not predefine any system-specific or GCC-specific macros.
The standard predefined macros remain defined.
</p>
</dd>
<dt><code>-A<var>predicate</var>=<var>answer</var></code></dt>
<dd><a name="index-Apredicate_003danswer"></a>
<a name="index-preprocessing_002c-assertation"></a>
<p>Make an assertion with the predicate <var>predicate</var> and answer <var>answer</var>.
This form is preferred to the older form -A predicate(answer), which is still
supported, because it does not use shell special characters.
</p>
</dd>
<dt><code>-A-<var>predicate</var>=<var>answer</var></code></dt>
<dd><a name="index-A_002dpredicate_003danswer"></a>
<a name="index-preprocessing_002c-assertation-1"></a>
<p>Cancel an assertion with the predicate <var>predicate</var> and answer <var>answer</var>.
</p>
</dd>
<dt><code>-C</code></dt>
<dd><a name="index-C"></a>
<a name="index-preprocessing_002c-keep-comments"></a>
<p>Do not discard comments. All comments are passed through to the output
file, except for comments in processed directives, which are deleted
along with the directive.
</p>
<p>You should be prepared for side effects when using <samp>-C</samp>; it causes
the preprocessor to treat comments as tokens in their own right. For example,
comments appearing at the start of what would be a directive line have the
effect of turning that line into an ordinary source line, since the first
token on the line is no longer a <code>'#'</code>.
</p>
<p>Warning: this currently handles C-Style comments only. The preprocessor
does not yet recognize Fortran-style comments.
</p>
</dd>
<dt><code>-CC</code></dt>
<dd><a name="index-CC"></a>
<a name="index-preprocessing_002c-keep-comments-1"></a>
<p>Do not discard comments, including during macro expansion. This is like
<samp>-C</samp>, except that comments contained within macros are also passed
through to the output file where the macro is expanded.
</p>
<p>In addition to the side-effects of the <samp>-C</samp> option, the <samp>-CC</samp>
option causes all C++-style comments inside a macro to be converted to C-style
comments. This is to prevent later use of that macro from inadvertently
commenting out the remainder of the source line. The <samp>-CC</samp> option
is generally used to support lint comments.
</p>
<p>Warning: this currently handles C- and C++-Style comments only. The
preprocessor does not yet recognize Fortran-style comments.
</p>
</dd>
<dt><code>-D<var>name</var></code></dt>
<dd><a name="index-Dname"></a>
<a name="index-preprocessing_002c-define-macros"></a>
<p>Predefine name as a macro, with definition <code>1</code>.
</p>
</dd>
<dt><code>-D<var>name</var>=<var>definition</var></code></dt>
<dd><a name="index-Dname_003ddefinition"></a>
<a name="index-preprocessing_002c-define-macros-1"></a>
<p>The contents of <var>definition</var> are tokenized and processed as if they
appeared during translation phase three in a <code>'#define'</code> directive.
In particular, the definition will be truncated by embedded newline
characters.
</p>
<p>If you are invoking the preprocessor from a shell or shell-like program
you may need to use the shell&rsquo;s quoting syntax to protect characters such
as spaces that have a meaning in the shell syntax.
</p>
<p>If you wish to define a function-like macro on the command line, write
its argument list with surrounding parentheses before the equals sign
(if any). Parentheses are meaningful to most shells, so you will need
to quote the option. With sh and csh, <code>-D'name(args...)=definition'</code>
works.
</p>
<p><samp>-D</samp> and <samp>-U</samp> options are processed in the order they are
given on the command line. All -imacros file and -include file options
are processed after all -D and -U options.
</p>
</dd>
<dt><code>-H</code></dt>
<dd><a name="index-H"></a>
<p>Print the name of each header file used, in addition to other normal
activities. Each name is indented to show how deep in the <code>'#include'</code>
stack it is.
</p>
</dd>
<dt><code>-P</code></dt>
<dd><a name="index-P"></a>
<a name="index-preprocessing_002c-no-linemarkers"></a>
<p>Inhibit generation of linemarkers in the output from the preprocessor.
This might be useful when running the preprocessor on something that
is not C code, and will be sent to a program which might be confused
by the linemarkers.
</p>
</dd>
<dt><code>-U<var>name</var></code></dt>
<dd><a name="index-Uname"></a>
<a name="index-preprocessing_002c-undefine-macros"></a>
<p>Cancel any previous definition of <var>name</var>, either built in or provided
with a <samp>-D</samp> option.
</p></dd>
</dl>


<hr>
<a name="Error-and-Warning-Options"></a>
<div class="header">
<p>
Next: <a href="#Debugging-Options" accesskey="n" rel="next">Debugging Options</a>, Previous: <a href="#Preprocessing-Options" accesskey="p" rel="prev">Preprocessing Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Options-to-request-or-suppress-errors-and-warnings"></a>
<h3 class="section">2.4 Options to request or suppress errors and warnings</h3>
<a name="index-options_002c-warnings"></a>
<a name="index-options_002c-errors"></a>
<a name="index-warnings_002c-suppressing"></a>
<a name="index-messages_002c-error"></a>
<a name="index-messages_002c-warning"></a>
<a name="index-suppressing-warnings"></a>

<p>Errors are diagnostic messages that report that the GNU Fortran compiler
cannot compile the relevant piece of source code.  The compiler will
continue to process the program in an attempt to report further errors
to aid in debugging, but will not produce any compiled output.  
</p>
<p>Warnings are diagnostic messages that report constructions which
are not inherently erroneous but which are risky or suggest there is
likely to be a bug in the program.  Unless <samp>-Werror</samp> is specified,
they do not prevent compilation of the program.
</p>
<p>You can request many specific warnings with options beginning <samp>-W</samp>,
for example <samp>-Wimplicit</samp> to request warnings on implicit
declarations.  Each of these specific warning options also has a
negative form beginning <samp>-Wno-</samp> to turn off warnings;
for example, <samp>-Wno-implicit</samp>.  This manual lists only one of the
two forms, whichever is not the default.
</p>
<p>These options control the amount and kinds of errors and warnings produced
by GNU Fortran:
</p>
<dl compact="compact">
<dt><code>-fmax-errors=<var>n</var></code></dt>
<dd><a name="index-fmax_002derrors_003dn"></a>
<a name="index-errors_002c-limiting"></a>
<p>Limits the maximum number of error messages to <var>n</var>, at which point
GNU Fortran bails out rather than attempting to continue processing the
source code.  If <var>n</var> is 0, there is no limit on the number of error
messages produced.
</p>
</dd>
<dt><code>-fsyntax-only</code></dt>
<dd><a name="index-fsyntax_002donly"></a>
<a name="index-syntax-checking"></a>
<p>Check the code for syntax errors, but don&rsquo;t actually compile it.  This
will generate module files for each module present in the code, but no
other output file.
</p>
</dd>
<dt><code>-pedantic</code></dt>
<dd><a name="index-pedantic"></a>
<p>Issue warnings for uses of extensions to Fortran 95.
<samp>-pedantic</samp> also applies to C-language constructs where they
occur in GNU Fortran source files, such as use of &lsquo;<samp>\e</samp>&rsquo; in a
character constant within a directive like <code>#include</code>.
</p>
<p>Valid Fortran 95 programs should compile properly with or without
this option.
However, without this option, certain GNU extensions and traditional
Fortran features are supported as well.
With this option, many of them are rejected.
</p>
<p>Some users try to use <samp>-pedantic</samp> to check programs for conformance.
They soon find that it does not do quite what they want&mdash;it finds some
nonstandard practices, but not all.
However, improvements to GNU Fortran in this area are welcome.
</p>
<p>This should be used in conjunction with <samp>-std=f95</samp>,
<samp>-std=f2003</samp> or <samp>-std=f2008</samp>.
</p>
</dd>
<dt><code>-pedantic-errors</code></dt>
<dd><a name="index-pedantic_002derrors"></a>
<p>Like <samp>-pedantic</samp>, except that errors are produced rather than
warnings.
</p>
</dd>
<dt><code>-Wall</code></dt>
<dd><a name="index-Wall"></a>
<a name="index-all-warnings"></a>
<a name="index-warnings_002c-all"></a>
<p>Enables commonly used warning options pertaining to usage that
we recommend avoiding and that we believe are easy to avoid.
This currently includes <samp>-Waliasing</samp>,
<samp>-Wampersand</samp>, <samp>-Wsurprising</samp>, <samp>-Wintrinsics-std</samp>,
<samp>-Wno-tabs</samp>, <samp>-Wintrinsic-shadow</samp> and <samp>-Wline-truncation</samp>.
</p>
</dd>
<dt><code>-Waliasing</code></dt>
<dd><a name="index-Waliasing"></a>
<a name="index-aliasing"></a>
<a name="index-warnings_002c-aliasing"></a>
<p>Warn about possible aliasing of dummy arguments. Specifically, it warns
if the same actual argument is associated with a dummy argument with
<code>INTENT(IN)</code> and a dummy argument with <code>INTENT(OUT)</code> in a call
with an explicit interface.
</p>
<p>The following example will trigger the warning.
</p><div class="smallexample">
<pre class="smallexample">  interface
    subroutine bar(a,b)
      integer, intent(in) :: a
      integer, intent(out) :: b
    end subroutine
  end interface
  integer :: a

  call bar(a,a)
</pre></div>

</dd>
<dt><code>-Wampersand</code></dt>
<dd><a name="index-Wampersand"></a>
<a name="index-warnings_002c-ampersand"></a>
<a name="index-_0026"></a>
<p>Warn about missing ampersand in continued character constants. The warning is
given with <samp>-Wampersand</samp>, <samp>-pedantic</samp>, <samp>-std=f95</samp>,
<samp>-std=f2003</samp> and <samp>-std=f2008</samp>. Note: With no ampersand
given in a continued character constant, GNU Fortran assumes continuation
at the first non-comment, non-whitespace character after the ampersand
that initiated the continuation.
</p>
</dd>
<dt><code>-Warray-temporaries</code></dt>
<dd><a name="index-Warray_002dtemporaries"></a>
<a name="index-warnings_002c-array-temporaries"></a>
<p>Warn about array temporaries generated by the compiler.  The information
generated by this warning is sometimes useful in optimization, in order to
avoid such temporaries.
</p>
</dd>
<dt><code>-Wcharacter-truncation</code></dt>
<dd><a name="index-Wcharacter_002dtruncation"></a>
<a name="index-warnings_002c-character-truncation"></a>
<p>Warn when a character assignment will truncate the assigned string.
</p>
</dd>
<dt><code>-Wline-truncation</code></dt>
<dd><a name="index-Wline_002dtruncation"></a>
<a name="index-warnings_002c-line-truncation"></a>
<p>Warn when a source code line will be truncated.
</p>
</dd>
<dt><code>-Wconversion</code></dt>
<dd><a name="index-Wconversion"></a>
<a name="index-warnings_002c-conversion"></a>
<a name="index-conversion"></a>
<p>Warn about implicit conversions between different types.
</p>
</dd>
<dt><code>-Wimplicit-interface</code></dt>
<dd><a name="index-Wimplicit_002dinterface"></a>
<a name="index-warnings_002c-implicit-interface"></a>
<p>Warn if a procedure is called without an explicit interface.
Note this only checks that an explicit interface is present.  It does not
check that the declared interfaces are consistent across program units.
</p>
</dd>
<dt><code>-Wintrinsics-std</code></dt>
<dd><a name="index-Wintrinsics_002dstd"></a>
<a name="index-warnings_002c-non_002dstandard-intrinsics"></a>
<a name="index-warnings_002c-intrinsics-of-other-standards"></a>
<p>Warn if <code>gfortran</code> finds a procedure named like an intrinsic not
available in the currently selected standard (with <samp>-std</samp>) and treats
it as <code>EXTERNAL</code> procedure because of this.  <samp>-fall-intrinsics</samp> can
be used to never trigger this behaviour and always link to the intrinsic
regardless of the selected standard.
</p>
</dd>
<dt><code>-Wsurprising</code></dt>
<dd><a name="index-Wsurprising"></a>
<a name="index-warnings_002c-suspicious-code"></a>
<p>Produce a warning when &ldquo;suspicious&rdquo; code constructs are encountered.
While technically legal these usually indicate that an error has been made.
</p>
<p>This currently produces a warning under the following circumstances:
</p>
<ul>
<li> An INTEGER SELECT construct has a CASE that can never be matched as its
lower value is greater than its upper value.

</li><li> A LOGICAL SELECT construct has three CASE statements.

</li><li> A TRANSFER specifies a source that is shorter than the destination.

</li><li> The type of a function result is declared more than once with the same type.  If
<samp>-pedantic</samp> or standard-conforming mode is enabled, this is an error.
</li></ul>

</dd>
<dt><code>-Wtabs</code></dt>
<dd><a name="index-Wtabs"></a>
<a name="index-warnings_002c-tabs"></a>
<a name="index-tabulators"></a>
<p>By default, tabs are accepted as whitespace, but tabs are not members
of the Fortran Character Set.  For continuation lines, a tab followed
by a digit between 1 and 9 is supported.  <samp>-Wno-tabs</samp> will cause
a warning to be issued if a tab is encountered. Note, <samp>-Wno-tabs</samp>
is active for <samp>-pedantic</samp>, <samp>-std=f95</samp>, <samp>-std=f2003</samp>,
<samp>-std=f2008</samp> and <samp>-Wall</samp>.
</p>
</dd>
<dt><code>-Wunderflow</code></dt>
<dd><a name="index-Wunderflow"></a>
<a name="index-warnings_002c-underflow"></a>
<a name="index-underflow"></a>
<p>Produce a warning when numerical constant expressions are
encountered, which yield an UNDERFLOW during compilation.
</p>
</dd>
<dt><code>-Wintrinsic-shadow</code></dt>
<dd><a name="index-Wintrinsic_002dshadow"></a>
<a name="index-warnings_002c-intrinsic"></a>
<a name="index-intrinsic"></a>
<p>Warn if a user-defined procedure or module procedure has the same name as an
intrinsic; in this case, an explicit interface or <code>EXTERNAL</code> or
<code>INTRINSIC</code> declaration might be needed to get calls later resolved to
the desired intrinsic/procedure.
</p>
</dd>
<dt><code>-Wunused-parameter</code></dt>
<dd><a name="index-Wunused_002dparameter"></a>
<a name="index-warnings_002c-unused-parameter"></a>
<a name="index-unused-parameter"></a>
<p>Contrary to <code>gcc</code>&rsquo;s meaning of <samp>-Wunused-parameter</samp>,
<code>gfortran</code>&rsquo;s implementation of this option does not warn
about unused dummy arguments, but about unused <code>PARAMETER</code> values.
<samp>-Wunused-parameter</samp> is not included in <samp>-Wall</samp> but is
implied by <samp>-Wall -Wextra</samp>.
</p>
</dd>
<dt><code>-Walign-commons</code></dt>
<dd><a name="index-Walign_002dcommons"></a>
<a name="index-warnings_002c-alignment-of-COMMON-blocks"></a>
<a name="index-alignment-of-COMMON-blocks"></a>
<p>By default, <code>gfortran</code> warns about any occasion of variables being
padded for proper alignment inside a COMMON block. This warning can be turned
off via <samp>-Wno-align-commons</samp>. See also <samp>-falign-commons</samp>.
</p>
</dd>
<dt><code>-Werror</code></dt>
<dd><a name="index-Werror"></a>
<a name="index-warnings_002c-to-errors"></a>
<p>Turns all warnings into errors.
</p></dd>
</dl>

<p>See <a href="http://gcc.gnu.org/onlinedocs/gcc/Error-and-Warning-Options.html#Error-and-Warning-Options">Options to Request or Suppress Errors and
Warnings</a> in <cite>Using the GNU Compiler Collection (GCC)</cite>, for information on
more options offered by the GBE shared by <code>gfortran</code>, <code>gcc</code>
and other GNU compilers.
</p>
<p>Some of these have no effect when compiling programs written in Fortran.
</p>
<hr>
<a name="Debugging-Options"></a>
<div class="header">
<p>
Next: <a href="#Directory-Options" accesskey="n" rel="next">Directory Options</a>, Previous: <a href="#Error-and-Warning-Options" accesskey="p" rel="prev">Error and Warning Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Options-for-debugging-your-program-or-GNU-Fortran"></a>
<h3 class="section">2.5 Options for debugging your program or GNU Fortran</h3>
<a name="index-options_002c-debugging"></a>
<a name="index-debugging-information-options"></a>

<p>GNU Fortran has various special options that are used for debugging
either your program or the GNU Fortran compiler.
</p>
<dl compact="compact">
<dt><code>-fdump-parse-tree</code></dt>
<dd><a name="index-fdump_002dparse_002dtree"></a>
<p>Output the internal parse tree before starting code generation.  Only
really useful for debugging the GNU Fortran compiler itself.
</p>
</dd>
<dt><code>-ffpe-trap=<var>list</var></code></dt>
<dd><a name="index-ffpe_002dtrap_003dlist"></a>
<p>Specify a list of IEEE exceptions when a Floating Point Exception
(FPE) should be raised.  On most systems, this will result in a SIGFPE
signal being sent and the program being interrupted, producing a core
file useful for debugging.  <var>list</var> is a (possibly empty) comma-separated
list of the following IEEE exceptions: &lsquo;<samp>invalid</samp>&rsquo; (invalid floating
point operation, such as <code>SQRT(-1.0)</code>), &lsquo;<samp>zero</samp>&rsquo; (division by
zero), &lsquo;<samp>overflow</samp>&rsquo; (overflow in a floating point operation),
&lsquo;<samp>underflow</samp>&rsquo; (underflow in a floating point operation),
&lsquo;<samp>precision</samp>&rsquo; (loss of precision during operation) and &lsquo;<samp>denormal</samp>&rsquo;
(operation produced a denormal value).
</p>
<p>Some of the routines in the Fortran runtime library, like
&lsquo;<samp>CPU_TIME</samp>&rsquo;, are likely to trigger floating point exceptions when
<code>ffpe-trap=precision</code> is used. For this reason, the use of 
<code>ffpe-trap=precision</code> is not recommended.
</p>
</dd>
<dt><code>-fbacktrace</code></dt>
<dd><a name="index-fbacktrace"></a>
<a name="index-backtrace"></a>
<a name="index-trace"></a>
<p>Specify that, when a runtime error is encountered or a deadly signal is
emitted (segmentation fault, illegal instruction, bus error or
floating-point exception), the Fortran runtime
library should output a backtrace of the error.  This option
only has influence for compilation of the Fortran main program.
</p>
</dd>
<dt><code>-fdump-core</code></dt>
<dd><a name="index-core_002c-dump"></a>
<a name="index-fdump_002dcore"></a>
<p>Request that a core-dump file is written to disk when a runtime error
is encountered on systems that support core dumps. This option is
only effective for the compilation of the Fortran main program.
</p></dd>
</dl>

<p>See <a href="http://gcc.gnu.org/onlinedocs/gcc/Debugging-Options.html#Debugging-Options">Options for Debugging Your Program or GCC</a> in <cite>Using the GNU Compiler Collection (GCC)</cite>, for more information on
debugging options.
</p>
<hr>
<a name="Directory-Options"></a>
<div class="header">
<p>
Next: <a href="#Link-Options" accesskey="n" rel="next">Link Options</a>, Previous: <a href="#Debugging-Options" accesskey="p" rel="prev">Debugging Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Options-for-directory-search"></a>
<h3 class="section">2.6 Options for directory search</h3>
<a name="index-directory_002c-options"></a>
<a name="index-options_002c-directory-search"></a>
<a name="index-search-path"></a>
<a name="index-INCLUDE-directive"></a>
<a name="index-directive_002c-INCLUDE"></a>
<p>These options affect how GNU Fortran searches
for files specified by the <code>INCLUDE</code> directive and where it searches
for previously compiled modules.
</p>
<p>It also affects the search paths used by <code>cpp</code> when used to preprocess
Fortran source.
</p>
<dl compact="compact">
<dt><code>-I<var>dir</var></code></dt>
<dd><a name="index-Idir"></a>
<a name="index-directory_002c-search-paths-for-inclusion"></a>
<a name="index-inclusion_002c-directory-search-paths-for"></a>
<a name="index-search-paths_002c-for-included-files"></a>
<a name="index-paths_002c-search"></a>
<a name="index-module-search-path"></a>
<p>These affect interpretation of the <code>INCLUDE</code> directive
(as well as of the <code>#include</code> directive of the <code>cpp</code>
preprocessor).
</p>
<p>Also note that the general behavior of <samp>-I</samp> and
<code>INCLUDE</code> is pretty much the same as of <samp>-I</samp> with
<code>#include</code> in the <code>cpp</code> preprocessor, with regard to
looking for <samp>header.gcc</samp> files and other such things.
</p>
<p>This path is also used to search for <samp>.mod</samp> files when previously
compiled modules are required by a <code>USE</code> statement.
</p>
<p>See <a href="http://gcc.gnu.org/onlinedocs/gcc/Directory-Options.html#Directory-Options">Options for Directory Search</a> in <cite>Using the GNU Compiler Collection (GCC)</cite>, for information on the
<samp>-I</samp> option.
</p>
</dd>
<dt><code>-J<var>dir</var></code></dt>
<dd><a name="index-Jdir"></a>
<a name="index-Mdir"></a>
<a name="index-paths_002c-search-1"></a>
<a name="index-module-search-path-1"></a>
<p>This option specifies where to put <samp>.mod</samp> files for compiled modules.
It is also added to the list of directories to searched by an <code>USE</code>
statement.
</p>
<p>The default is the current directory.
</p>
</dd>
<dt><code>-fintrinsic-modules-path <var>dir</var></code></dt>
<dd><a name="index-fintrinsic_002dmodules_002dpath-dir"></a>
<a name="index-paths_002c-search-2"></a>
<a name="index-module-search-path-2"></a>
<p>This option specifies the location of pre-compiled intrinsic modules, if
they are not in the default location expected by the compiler.
</p></dd>
</dl>

<hr>
<a name="Link-Options"></a>
<div class="header">
<p>
Next: <a href="#Runtime-Options" accesskey="n" rel="next">Runtime Options</a>, Previous: <a href="#Directory-Options" accesskey="p" rel="prev">Directory Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Influencing-the-linking-step"></a>
<h3 class="section">2.7 Influencing the linking step</h3>
<a name="index-options_002c-linking"></a>
<a name="index-linking_002c-static"></a>

<p>These options come into play when the compiler links object files into an 
executable output file. They are meaningless if the compiler is not doing 
a link step.
</p>
<dl compact="compact">
<dt><code>-static-libgfortran</code></dt>
<dd><a name="index-static_002dlibgfortran"></a>
<p>On systems that provide <samp>libgfortran</samp> as a shared and a static
library, this option forces the use of the static version. If no
shared version of <samp>libgfortran</samp> was built when the compiler was
configured, this option has no effect.
</p></dd>
</dl>


<hr>
<a name="Runtime-Options"></a>
<div class="header">
<p>
Next: <a href="#Code-Gen-Options" accesskey="n" rel="next">Code Gen Options</a>, Previous: <a href="#Link-Options" accesskey="p" rel="prev">Link Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Influencing-runtime-behavior"></a>
<h3 class="section">2.8 Influencing runtime behavior</h3>
<a name="index-options_002c-runtime"></a>

<p>These options affect the runtime behavior of programs compiled with GNU Fortran.
</p><dl compact="compact">
<dt><code>-fconvert=<var>conversion</var></code></dt>
<dd><a name="index-fconvert_003dconversion"></a>
<p>Specify the representation of data for unformatted files.  Valid
values for conversion are: &lsquo;<samp>native</samp>&rsquo;, the default; &lsquo;<samp>swap</samp>&rsquo;,
swap between big- and little-endian; &lsquo;<samp>big-endian</samp>&rsquo;, use big-endian
representation for unformatted files; &lsquo;<samp>little-endian</samp>&rsquo;, use little-endian
representation for unformatted files.
</p>
<p><em>This option has an effect only when used in the main program.
The <code>CONVERT</code> specifier and the GFORTRAN_CONVERT_UNIT environment
variable override the default specified by <samp>-fconvert</samp>.</em>
</p>

</dd>
<dt><code>-fno-range-check</code></dt>
<dd><a name="index-fno_002drange_002dcheck"></a>
<p>Disable range checking of input values during integer <code>READ</code> operations.
For example, GNU Fortran will give an error if an input value is
outside of the relevant range of [<code>-HUGE()</code>:<code>HUGE()</code>]. In other words,
with <code>INTEGER (kind=4) :: i</code> , attempting to read <em>-2147483648</em> will
give an error unless <samp>-fno-range-check</samp> is given. 
</p>

</dd>
<dt><code>-frecord-marker=<var>length</var></code></dt>
<dd><a name="index-frecord_002dmarker_003dlength"></a>
<p>Specify the length of record markers for unformatted files.
Valid values for <var>length</var> are 4 and 8.  Default is 4.
<em>This is different from previous versions of <code>gfortran</code></em>,
which specified a default record marker length of 8 on most
systems.  If you want to read or write files compatible
with earlier versions of <code>gfortran</code>, use <samp>-frecord-marker=8</samp>.
</p>
</dd>
<dt><code>-fmax-subrecord-length=<var>length</var></code></dt>
<dd><a name="index-fmax_002dsubrecord_002dlength_003dlength"></a>
<p>Specify the maximum length for a subrecord.  The maximum permitted
value for length is 2147483639, which is also the default.  Only
really useful for use by the gfortran testsuite.
</p>
</dd>
<dt><code>-fsign-zero</code></dt>
<dd><a name="index-fsign_002dzero"></a>
<p>When writing zero values, show the negative sign if the sign bit is set.
<code>fno-sign-zero</code> does not print the negative sign of zero values for
compatibility with F77.  Default behavior is to show the negative sign.
</p></dd>
</dl>

<hr>
<a name="Code-Gen-Options"></a>
<div class="header">
<p>
Next: <a href="#Environment-Variables" accesskey="n" rel="next">Environment Variables</a>, Previous: <a href="#Runtime-Options" accesskey="p" rel="prev">Runtime Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Options-for-code-generation-conventions"></a>
<h3 class="section">2.9 Options for code generation conventions</h3>
<a name="index-code-generation_002c-conventions"></a>
<a name="index-options_002c-code-generation"></a>
<a name="index-options_002c-run_002dtime"></a>

<p>These machine-independent options control the interface conventions
used in code generation.
</p>
<p>Most of them have both positive and negative forms; the negative form
of <samp>-ffoo</samp> would be <samp>-fno-foo</samp>.  In the table below, only
one of the forms is listed&mdash;the one which is not the default.  You
can figure out the other form by either removing <samp>no-</samp> or adding
it.
</p>
<dl compact="compact">
<dt><code>-fno-automatic</code></dt>
<dd><a name="index-fno_002dautomatic"></a>
<a name="index-SAVE-statement"></a>
<a name="index-statement_002c-SAVE"></a>
<p>Treat each program unit (except those marked as RECURSIVE) as if the
<code>SAVE</code> statement were specified for every local variable and array
referenced in it. Does not affect common blocks. (Some Fortran compilers
provide this option under the name <samp>-static</samp> or <samp>-save</samp>.)
The default, which is <samp>-fautomatic</samp>, uses the stack for local
variables smaller than the value given by <samp>-fmax-stack-var-size</samp>.
Use the option <samp>-frecursive</samp> to use no static memory. 
</p>
</dd>
<dt><code>-ff2c</code></dt>
<dd><a name="index-ff2c"></a>
<a name="index-calling-convention"></a>
<a name="index-f2c-calling-convention"></a>
<a name="index-g77-calling-convention"></a>
<a name="index-libf2c-calling-convention"></a>
<p>Generate code designed to be compatible with code generated
by <code>g77</code> and <code>f2c</code>.
</p>
<p>The calling conventions used by <code>g77</code> (originally implemented
in <code>f2c</code>) require functions that return type
default <code>REAL</code> to actually return the C type <code>double</code>, and
functions that return type <code>COMPLEX</code> to return the values via an
extra argument in the calling sequence that points to where to
store the return value.  Under the default GNU calling conventions, such
functions simply return their results as they would in GNU
C&mdash;default <code>REAL</code> functions return the C type <code>float</code>, and
<code>COMPLEX</code> functions return the GNU C type <code>complex</code>.
Additionally, this option implies the <samp>-fsecond-underscore</samp>
option, unless <samp>-fno-second-underscore</samp> is explicitly requested.
</p>
<p>This does not affect the generation of code that interfaces with
the <code>libgfortran</code> library.
</p>
<p><em>Caution:</em> It is not a good idea to mix Fortran code compiled with
<samp>-ff2c</samp> with code compiled with the default <samp>-fno-f2c</samp>
calling conventions as, calling <code>COMPLEX</code> or default <code>REAL</code>
functions between program parts which were compiled with different
calling conventions will break at execution time.
</p>
<p><em>Caution:</em> This will break code which passes intrinsic functions
of type default <code>REAL</code> or <code>COMPLEX</code> as actual arguments, as
the library implementations use the <samp>-fno-f2c</samp> calling conventions.
</p>
</dd>
<dt><code>-fno-underscoring</code></dt>
<dd><a name="index-fno_002dunderscoring"></a>
<a name="index-underscore"></a>
<a name="index-symbol-names_002c-underscores"></a>
<a name="index-transforming-symbol-names"></a>
<a name="index-symbol-names_002c-transforming"></a>
<p>Do not transform names of entities specified in the Fortran
source file by appending underscores to them.
</p>
<p>With <samp>-funderscoring</samp> in effect, GNU Fortran appends one
underscore to external names with no underscores.  This is done to ensure
compatibility with code produced by many UNIX Fortran compilers.
</p>
<p><em>Caution</em>: The default behavior of GNU Fortran is
incompatible with <code>f2c</code> and <code>g77</code>, please use the
<samp>-ff2c</samp> option if you want object files compiled with
GNU Fortran to be compatible with object code created with these
tools.
</p>
<p>Use of <samp>-fno-underscoring</samp> is not recommended unless you are
experimenting with issues such as integration of GNU Fortran into
existing system environments (vis-&agrave;-vis existing libraries, tools,
and so on).
</p>
<p>For example, with <samp>-funderscoring</samp>, and assuming other defaults like
<samp>-fcase-lower</samp> and that <code>j()</code> and <code>max_count()</code> are
external functions while <code>my_var</code> and <code>lvar</code> are local variables,
a statement like
</p><div class="smallexample">
<pre class="smallexample">I = J() + MAX_COUNT (MY_VAR, LVAR)
</pre></div>
<p>is implemented as something akin to:
</p><div class="smallexample">
<pre class="smallexample">i = j_() + max_count__(&amp;my_var__, &amp;lvar);
</pre></div>

<p>With <samp>-fno-underscoring</samp>, the same statement is implemented as:
</p>
<div class="smallexample">
<pre class="smallexample">i = j() + max_count(&amp;my_var, &amp;lvar);
</pre></div>

<p>Use of <samp>-fno-underscoring</samp> allows direct specification of
user-defined names while debugging and when interfacing GNU Fortran
code with other languages.
</p>
<p>Note that just because the names match does <em>not</em> mean that the
interface implemented by GNU Fortran for an external name matches the
interface implemented by some other language for that same name.
That is, getting code produced by GNU Fortran to link to code produced
by some other compiler using this or any other method can be only a
small part of the overall solution&mdash;getting the code generated by
both compilers to agree on issues other than naming can require
significant effort, and, unlike naming disagreements, linkers normally
cannot detect disagreements in these other areas.
</p>
<p>Also, note that with <samp>-fno-underscoring</samp>, the lack of appended
underscores introduces the very real possibility that a user-defined
external name will conflict with a name in a system library, which
could make finding unresolved-reference bugs quite difficult in some
cases&mdash;they might occur at program run time, and show up only as
buggy behavior at run time.
</p>
<p>In future versions of GNU Fortran we hope to improve naming and linking
issues so that debugging always involves using the names as they appear
in the source, even if the names as seen by the linker are mangled to
prevent accidental linking between procedures with incompatible
interfaces.
</p>
</dd>
<dt><code>-fsecond-underscore</code></dt>
<dd><a name="index-fsecond_002dunderscore"></a>
<a name="index-underscore-1"></a>
<a name="index-symbol-names_002c-underscores-1"></a>
<a name="index-transforming-symbol-names-1"></a>
<a name="index-symbol-names_002c-transforming-1"></a>
<a name="index-f2c-calling-convention-1"></a>
<a name="index-g77-calling-convention-1"></a>
<a name="index-libf2c-calling-convention-1"></a>
<p>By default, GNU Fortran appends an underscore to external
names.  If this option is used GNU Fortran appends two
underscores to names with underscores and one underscore to external names
with no underscores.  GNU Fortran also appends two underscores to
internal names with underscores to avoid naming collisions with external
names.
</p>
<p>This option has no effect if <samp>-fno-underscoring</samp> is
in effect.  It is implied by the <samp>-ff2c</samp> option.
</p>
<p>Otherwise, with this option, an external name such as <code>MAX_COUNT</code>
is implemented as a reference to the link-time external symbol
<code>max_count__</code>, instead of <code>max_count_</code>.  This is required
for compatibility with <code>g77</code> and <code>f2c</code>, and is implied
by use of the <samp>-ff2c</samp> option.
</p>
</dd>
<dt><code>-fbounds-check</code></dt>
<dd><a name="index-fbounds_002dcheck"></a>
<a name="index-array_002c-bounds-checking"></a>
<a name="index-bounds-checking"></a>
<a name="index-range-checking"></a>
<a name="index-subscript-checking"></a>
<a name="index-checking-subscripts"></a>
<p>Enable generation of run-time checks for array subscripts
and against the declared minimum and maximum values.  It also
checks array indices for assumed and deferred
shape arrays against the actual allocated bounds and ensures that all string
lengths are equal for character array constructors without an explicit
typespec.
</p>
<p>Some checks require that <samp>-fbounds-check</samp> is set for
the compilation of the main program.
</p>
<p>Note: In the future this may also include other forms of checking, e.g.,
checking substring references.
</p>

</dd>
<dt><code>fcheck-array-temporaries</code></dt>
<dd><a name="index-fcheck_002darray_002dtemporaries"></a>
<a name="index-checking-array-temporaries"></a>
<p>Warns at run time when for passing an actual argument a temporary array
had to be generated. The information generated by this warning is
sometimes useful in optimization, in order to avoid such temporaries.
</p>
<p>Note: The warning is only printed once per location.
</p>

</dd>
<dt><code>-fmax-array-constructor=<var>n</var></code></dt>
<dd><a name="index-fmax_002darray_002dconstructor"></a>
<p>This option can be used to increase the upper limit permitted in 
array constructors.  The code below requires this option to expand
the array at compile time.
</p>
<div class="smallexample">
<pre class="smallexample"><code>program test</code>
<code>implicit none</code>
<code>integer j</code>
<code>integer, parameter :: n = 100000</code>
<code>integer, parameter :: i(n) = (/ (2*j, j = 1, n) /)</code>
<code>print '(10(I0,1X))', i</code>
<code>end program test</code>
</pre></div>

<p><em>Caution:  This option can lead to long compile times and excessively
large object files.</em>
</p>
<p>The default value for <var>n</var> is 65535.
</p>

</dd>
<dt><code>-fmax-stack-var-size=<var>n</var></code></dt>
<dd><a name="index-fmax_002dstack_002dvar_002dsize"></a>
<p>This option specifies the size in bytes of the largest array that will be put
on the stack; if the size is exceeded static memory is used (except in
procedures marked as RECURSIVE). Use the option <samp>-frecursive</samp> to
allow for recursive procedures which do not have a RECURSIVE attribute or
for parallel programs. Use <samp>-fno-automatic</samp> to never use the stack.
</p>
<p>This option currently only affects local arrays declared with constant
bounds, and may not apply to all character variables.
Future versions of GNU Fortran may improve this behavior.
</p>
<p>The default value for <var>n</var> is 32768.
</p>
</dd>
<dt><code>-fpack-derived</code></dt>
<dd><a name="index-fpack_002dderived"></a>
<a name="index-structure-packing"></a>
<p>This option tells GNU Fortran to pack derived type members as closely as
possible.  Code compiled with this option is likely to be incompatible
with code compiled without this option, and may execute slower.
</p>
</dd>
<dt><code>-frepack-arrays</code></dt>
<dd><a name="index-frepack_002darrays"></a>
<a name="index-repacking-arrays"></a>
<p>In some circumstances GNU Fortran may pass assumed shape array
sections via a descriptor describing a noncontiguous area of memory.
This option adds code to the function prologue to repack the data into
a contiguous block at runtime.
</p>
<p>This should result in faster accesses to the array.  However it can introduce
significant overhead to the function call, especially  when the passed data
is noncontiguous.
</p>
</dd>
<dt><code>-fshort-enums</code></dt>
<dd><a name="index-fshort_002denums"></a>
<p>This option is provided for interoperability with C code that was
compiled with the <samp>-fshort-enums</samp> option.  It will make
GNU Fortran choose the smallest <code>INTEGER</code> kind a given
enumerator set will fit in, and give all its enumerators this kind.
</p>
</dd>
<dt><code>-fexternal-blas</code></dt>
<dd><a name="index-fexternal_002dblas"></a>
<p>This option will make <code>gfortran</code> generate calls to BLAS functions
for some matrix operations like <code>MATMUL</code>, instead of using our own
algorithms, if the size of the matrices involved is larger than a given
limit (see <samp>-fblas-matmul-limit</samp>).  This may be profitable if an
optimized vendor BLAS library is available.  The BLAS library will have
to be specified at link time.
</p>
</dd>
<dt><code>-fblas-matmul-limit=<var>n</var></code></dt>
<dd><a name="index-fblas_002dmatmul_002dlimit"></a>
<p>Only significant when <samp>-fexternal-blas</samp> is in effect.
Matrix multiplication of matrices with size larger than (or equal to) <var>n</var>
will be performed by calls to BLAS functions, while others will be
handled by <code>gfortran</code> internal algorithms. If the matrices
involved are not square, the size comparison is performed using the
geometric mean of the dimensions of the argument and result matrices.
</p>
<p>The default value for <var>n</var> is 30.
</p>
</dd>
<dt><code>-frecursive</code></dt>
<dd><a name="index-frecursive"></a>
<p>Allow indirect recursion by forcing all local arrays to be allocated
on the stack. This flag cannot be used together with
<samp>-fmax-stack-var-size=</samp> or <samp>-fno-automatic</samp>.
</p>
</dd>
<dt><code>-finit-local-zero</code></dt>
<dt><code>-finit-integer=<var>n</var></code></dt>
<dt><code>-finit-real=<var>&lt;zero|inf|-inf|nan&gt;</var></code></dt>
<dt><code>-finit-logical=<var>&lt;true|false&gt;</var></code></dt>
<dt><code>-finit-character=<var>n</var></code></dt>
<dd><a name="index-finit_002dlocal_002dzero"></a>
<a name="index-finit_002dinteger"></a>
<a name="index-finit_002dreal"></a>
<a name="index-finit_002dlogical"></a>
<a name="index-finit_002dcharacter"></a>
<p>The <samp>-finit-local-zero</samp> option instructs the compiler to
initialize local <code>INTEGER</code>, <code>REAL</code>, and <code>COMPLEX</code>
variables to zero, <code>LOGICAL</code> variables to false, and
<code>CHARACTER</code> variables to a string of null bytes.  Finer-grained
initialization options are provided by the
<samp>-finit-integer=<var>n</var></samp>,
<samp>-finit-real=<var>&lt;zero|inf|-inf|nan&gt;</var></samp> (which also initializes
the real and imaginary parts of local <code>COMPLEX</code> variables),
<samp>-finit-logical=<var>&lt;true|false&gt;</var></samp>, and
<samp>-finit-character=<var>n</var></samp> (where <var>n</var> is an ASCII character
value) options.  These options do not initialize components of derived
type variables, nor do they initialize variables that appear in an
<code>EQUIVALENCE</code> statement.  (This limitation may be removed in
future releases).
</p>
<p>Note that the <samp>-finit-real=nan</samp> option initializes <code>REAL</code>
and <code>COMPLEX</code> variables with a quiet NaN.
</p>
</dd>
<dt><code>-falign-commons</code></dt>
<dd><a name="index-falign_002dcommons"></a>
<a name="index-alignment-of-COMMON-blocks-1"></a>
<p>By default, <code>gfortran</code> enforces proper alignment of all variables in a
COMMON block by padding them as needed. On certain platforms this is mandatory,
on others it increases performance. If a COMMON block is not declared with
consistent data types everywhere, this padding can cause trouble, and
<samp>-fno-align-commons </samp> can be used to disable automatic alignment. The
same form of this option should be used for all files that share a COMMON block.
To avoid potential alignment issues in COMMON blocks, it is recommended to order
objects from largests to smallest.
</p></dd>
</dl>

<p>See <a href="http://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options">Options for Code Generation Conventions</a> in <cite>Using the GNU Compiler Collection (GCC)</cite>, for information on more options
offered by the GBE
shared by <code>gfortran</code>, <code>gcc</code>, and other GNU compilers.
</p>


<hr>
<a name="Environment-Variables"></a>
<div class="header">
<p>
Previous: <a href="#Code-Gen-Options" accesskey="p" rel="prev">Code Gen Options</a>, Up: <a href="#Invoking-GNU-Fortran" accesskey="u" rel="up">Invoking GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Environment-variables-affecting-gfortran"></a>
<h3 class="section">2.10 Environment variables affecting <code>gfortran</code></h3>
<a name="index-environment-variable"></a>


<p>The <code>gfortran</code> compiler currently does not make use of any environment
variables to control its operation above and beyond those
that affect the operation of <code>gcc</code>.
</p>
<p>See <a href="http://gcc.gnu.org/onlinedocs/gcc/Environment-Variables.html#Environment-Variables">Environment Variables Affecting GCC</a> in <cite>Using the GNU Compiler Collection (GCC)</cite>, for information on environment
variables.
</p>
<p>See <a href="#Runtime">Runtime</a>, for environment variables that affect the
run-time behavior of programs compiled with GNU Fortran.
</p>


<hr>
<a name="Runtime"></a>
<div class="header">
<p>
Next: <a href="#Fortran-2003-and-2008-status" accesskey="n" rel="next">Fortran 2003 and 2008 status</a>, Previous: <a href="#Invoking-GNU-Fortran" accesskey="p" rel="prev">Invoking GNU Fortran</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Runtime_003a-Influencing-runtime-behavior-with-environment-variables"></a>
<h2 class="chapter">3 Runtime:  Influencing runtime behavior with environment variables</h2>
<a name="index-environment-variable-1"></a>

<p>The behavior of the <code>gfortran</code> can be influenced by
environment variables.
</p>
<p>Malformed environment variables are silently ignored.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fSTDIN_005fUNIT" accesskey="1">GFORTRAN_STDIN_UNIT</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Unit number for standard input
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fSTDOUT_005fUNIT" accesskey="2">GFORTRAN_STDOUT_UNIT</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Unit number for standard output
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fSTDERR_005fUNIT" accesskey="3">GFORTRAN_STDERR_UNIT</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Unit number for standard error
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fUSE_005fSTDERR" accesskey="4">GFORTRAN_USE_STDERR</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Send library output to standard error
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fTMPDIR" accesskey="5">GFORTRAN_TMPDIR</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Directory for scratch files
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fUNBUFFERED_005fALL" accesskey="6">GFORTRAN_UNBUFFERED_ALL</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Don&rsquo;t buffer I/O for all units.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fUNBUFFERED_005fPRECONNECTED" accesskey="7">GFORTRAN_UNBUFFERED_PRECONNECTED</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Don&rsquo;t buffer I/O for preconnected units.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fSHOW_005fLOCUS" accesskey="8">GFORTRAN_SHOW_LOCUS</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Show location for runtime errors
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fOPTIONAL_005fPLUS" accesskey="9">GFORTRAN_OPTIONAL_PLUS</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Print leading + where permitted
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fDEFAULT_005fRECL">GFORTRAN_DEFAULT_RECL</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Default record length for new files
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fLIST_005fSEPARATOR">GFORTRAN_LIST_SEPARATOR</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Separator for list output
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fCONVERT_005fUNIT">GFORTRAN_CONVERT_UNIT</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Set endianness for unformatted I/O
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fERROR_005fDUMPCORE">GFORTRAN_ERROR_DUMPCORE</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Dump core on run-time errors
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GFORTRAN_005fERROR_005fBACKTRACE">GFORTRAN_ERROR_BACKTRACE</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Show backtrace on run-time errors
</td></tr>
</table>

<hr>
<a name="GFORTRAN_005fSTDIN_005fUNIT"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fSTDOUT_005fUNIT" accesskey="n" rel="next">GFORTRAN_STDOUT_UNIT</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fSTDIN_005fUNIT_002d_002d_002dUnit-number-for-standard-input"></a>
<h3 class="section">3.1 <code>GFORTRAN_STDIN_UNIT</code>&mdash;Unit number for standard input</h3>

<p>This environment variable can be used to select the unit number
preconnected to standard input.  This must be a positive integer.
The default value is 5.
</p>
<hr>
<a name="GFORTRAN_005fSTDOUT_005fUNIT"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fSTDERR_005fUNIT" accesskey="n" rel="next">GFORTRAN_STDERR_UNIT</a>, Previous: <a href="#GFORTRAN_005fSTDIN_005fUNIT" accesskey="p" rel="prev">GFORTRAN_STDIN_UNIT</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fSTDOUT_005fUNIT_002d_002d_002dUnit-number-for-standard-output"></a>
<h3 class="section">3.2 <code>GFORTRAN_STDOUT_UNIT</code>&mdash;Unit number for standard output</h3>

<p>This environment variable can be used to select the unit number
preconnected to standard output.  This must be a positive integer.
The default value is 6.
</p>
<hr>
<a name="GFORTRAN_005fSTDERR_005fUNIT"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fUSE_005fSTDERR" accesskey="n" rel="next">GFORTRAN_USE_STDERR</a>, Previous: <a href="#GFORTRAN_005fSTDOUT_005fUNIT" accesskey="p" rel="prev">GFORTRAN_STDOUT_UNIT</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fSTDERR_005fUNIT_002d_002d_002dUnit-number-for-standard-error"></a>
<h3 class="section">3.3 <code>GFORTRAN_STDERR_UNIT</code>&mdash;Unit number for standard error</h3>

<p>This environment variable can be used to select the unit number
preconnected to standard error.  This must be a positive integer.
The default value is 0.
</p>
<hr>
<a name="GFORTRAN_005fUSE_005fSTDERR"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fTMPDIR" accesskey="n" rel="next">GFORTRAN_TMPDIR</a>, Previous: <a href="#GFORTRAN_005fSTDERR_005fUNIT" accesskey="p" rel="prev">GFORTRAN_STDERR_UNIT</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fUSE_005fSTDERR_002d_002d_002dSend-library-output-to-standard-error"></a>
<h3 class="section">3.4 <code>GFORTRAN_USE_STDERR</code>&mdash;Send library output to standard error</h3>

<p>This environment variable controls where library output is sent.
If the first letter is &lsquo;<samp>y</samp>&rsquo;, &lsquo;<samp>Y</samp>&rsquo; or &lsquo;<samp>1</samp>&rsquo;, standard
error is used. If the first letter is &lsquo;<samp>n</samp>&rsquo;, &lsquo;<samp>N</samp>&rsquo; or
&lsquo;<samp>0</samp>&rsquo;, standard output is used.
</p>
<hr>
<a name="GFORTRAN_005fTMPDIR"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fUNBUFFERED_005fALL" accesskey="n" rel="next">GFORTRAN_UNBUFFERED_ALL</a>, Previous: <a href="#GFORTRAN_005fUSE_005fSTDERR" accesskey="p" rel="prev">GFORTRAN_USE_STDERR</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fTMPDIR_002d_002d_002dDirectory-for-scratch-files"></a>
<h3 class="section">3.5 <code>GFORTRAN_TMPDIR</code>&mdash;Directory for scratch files</h3>

<p>This environment variable controls where scratch files are
created.  If this environment variable is missing,
GNU Fortran searches for the environment variable <code>TMP</code>.  If
this is also missing, the default is <samp>/tmp</samp>.
</p>
<hr>
<a name="GFORTRAN_005fUNBUFFERED_005fALL"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fUNBUFFERED_005fPRECONNECTED" accesskey="n" rel="next">GFORTRAN_UNBUFFERED_PRECONNECTED</a>, Previous: <a href="#GFORTRAN_005fTMPDIR" accesskey="p" rel="prev">GFORTRAN_TMPDIR</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fUNBUFFERED_005fALL_002d_002d_002dDon_0027t-buffer-I_002fO-on-all-units"></a>
<h3 class="section">3.6 <code>GFORTRAN_UNBUFFERED_ALL</code>&mdash;Don&rsquo;t buffer I/O on all units</h3>

<p>This environment variable controls whether all I/O is unbuffered.  If
the first letter is &lsquo;<samp>y</samp>&rsquo;, &lsquo;<samp>Y</samp>&rsquo; or &lsquo;<samp>1</samp>&rsquo;, all I/O is
unbuffered. This will slow down small sequential reads and writes.  If
the first letter is &lsquo;<samp>n</samp>&rsquo;, &lsquo;<samp>N</samp>&rsquo; or &lsquo;<samp>0</samp>&rsquo;, I/O is buffered.
This is the default.
</p>
<hr>
<a name="GFORTRAN_005fUNBUFFERED_005fPRECONNECTED"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fSHOW_005fLOCUS" accesskey="n" rel="next">GFORTRAN_SHOW_LOCUS</a>, Previous: <a href="#GFORTRAN_005fUNBUFFERED_005fALL" accesskey="p" rel="prev">GFORTRAN_UNBUFFERED_ALL</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fUNBUFFERED_005fPRECONNECTED_002d_002d_002dDon_0027t-buffer-I_002fO-on-preconnected-units"></a>
<h3 class="section">3.7 <code>GFORTRAN_UNBUFFERED_PRECONNECTED</code>&mdash;Don&rsquo;t buffer I/O on preconnected units</h3>

<p>The environment variable named <code>GFORTRAN_UNBUFFERED_PRECONNECTED</code> controls
whether I/O on a preconnected unit (i.e. STDOUT or STDERR) is unbuffered.  If 
the first letter is &lsquo;<samp>y</samp>&rsquo;, &lsquo;<samp>Y</samp>&rsquo; or &lsquo;<samp>1</samp>&rsquo;, I/O is unbuffered. This
will slow down small sequential reads and writes.  If the first letter
is &lsquo;<samp>n</samp>&rsquo;, &lsquo;<samp>N</samp>&rsquo; or &lsquo;<samp>0</samp>&rsquo;, I/O is buffered.  This is the default.
</p>
<hr>
<a name="GFORTRAN_005fSHOW_005fLOCUS"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fOPTIONAL_005fPLUS" accesskey="n" rel="next">GFORTRAN_OPTIONAL_PLUS</a>, Previous: <a href="#GFORTRAN_005fUNBUFFERED_005fPRECONNECTED" accesskey="p" rel="prev">GFORTRAN_UNBUFFERED_PRECONNECTED</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fSHOW_005fLOCUS_002d_002d_002dShow-location-for-runtime-errors"></a>
<h3 class="section">3.8 <code>GFORTRAN_SHOW_LOCUS</code>&mdash;Show location for runtime errors</h3>

<p>If the first letter is &lsquo;<samp>y</samp>&rsquo;, &lsquo;<samp>Y</samp>&rsquo; or &lsquo;<samp>1</samp>&rsquo;, filename and
line numbers for runtime errors are printed.  If the first letter is
&lsquo;<samp>n</samp>&rsquo;, &lsquo;<samp>N</samp>&rsquo; or &lsquo;<samp>0</samp>&rsquo;, don&rsquo;t print filename and line numbers
for runtime errors. The default is to print the location.
</p>
<hr>
<a name="GFORTRAN_005fOPTIONAL_005fPLUS"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fDEFAULT_005fRECL" accesskey="n" rel="next">GFORTRAN_DEFAULT_RECL</a>, Previous: <a href="#GFORTRAN_005fSHOW_005fLOCUS" accesskey="p" rel="prev">GFORTRAN_SHOW_LOCUS</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fOPTIONAL_005fPLUS_002d_002d_002dPrint-leading-_002b-where-permitted"></a>
<h3 class="section">3.9 <code>GFORTRAN_OPTIONAL_PLUS</code>&mdash;Print leading + where permitted</h3>

<p>If the first letter is &lsquo;<samp>y</samp>&rsquo;, &lsquo;<samp>Y</samp>&rsquo; or &lsquo;<samp>1</samp>&rsquo;,
a plus sign is printed
where permitted by the Fortran standard.  If the first letter
is &lsquo;<samp>n</samp>&rsquo;, &lsquo;<samp>N</samp>&rsquo; or &lsquo;<samp>0</samp>&rsquo;, a plus sign is not printed
in most cases. Default is not to print plus signs.
</p>
<hr>
<a name="GFORTRAN_005fDEFAULT_005fRECL"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fLIST_005fSEPARATOR" accesskey="n" rel="next">GFORTRAN_LIST_SEPARATOR</a>, Previous: <a href="#GFORTRAN_005fOPTIONAL_005fPLUS" accesskey="p" rel="prev">GFORTRAN_OPTIONAL_PLUS</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fDEFAULT_005fRECL_002d_002d_002dDefault-record-length-for-new-files"></a>
<h3 class="section">3.10 <code>GFORTRAN_DEFAULT_RECL</code>&mdash;Default record length for new files</h3>

<p>This environment variable specifies the default record length, in
bytes, for files which are opened without a <code>RECL</code> tag in the
<code>OPEN</code> statement.  This must be a positive integer.  The
default value is 1073741824 bytes (1 GB).
</p>
<hr>
<a name="GFORTRAN_005fLIST_005fSEPARATOR"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fCONVERT_005fUNIT" accesskey="n" rel="next">GFORTRAN_CONVERT_UNIT</a>, Previous: <a href="#GFORTRAN_005fDEFAULT_005fRECL" accesskey="p" rel="prev">GFORTRAN_DEFAULT_RECL</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fLIST_005fSEPARATOR_002d_002d_002dSeparator-for-list-output"></a>
<h3 class="section">3.11 <code>GFORTRAN_LIST_SEPARATOR</code>&mdash;Separator for list output</h3>

<p>This environment variable specifies the separator when writing
list-directed output.  It may contain any number of spaces and
at most one comma.  If you specify this on the command line,
be sure to quote spaces, as in
</p><div class="smallexample">
<pre class="smallexample">$ GFORTRAN_LIST_SEPARATOR='  ,  ' ./a.out
</pre></div>
<p>when <code>a.out</code> is the compiled Fortran program that you want to run.
Default is a single space.
</p>
<hr>
<a name="GFORTRAN_005fCONVERT_005fUNIT"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fERROR_005fDUMPCORE" accesskey="n" rel="next">GFORTRAN_ERROR_DUMPCORE</a>, Previous: <a href="#GFORTRAN_005fLIST_005fSEPARATOR" accesskey="p" rel="prev">GFORTRAN_LIST_SEPARATOR</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fCONVERT_005fUNIT_002d_002d_002dSet-endianness-for-unformatted-I_002fO"></a>
<h3 class="section">3.12 <code>GFORTRAN_CONVERT_UNIT</code>&mdash;Set endianness for unformatted I/O</h3>

<p>By setting the <code>GFORTRAN_CONVERT_UNIT</code> variable, it is possible
to change the representation of data for unformatted files.
The syntax for the <code>GFORTRAN_CONVERT_UNIT</code> variable is:
</p><div class="smallexample">
<pre class="smallexample">GFORTRAN_CONVERT_UNIT: mode | mode ';' exception | exception ;
mode: 'native' | 'swap' | 'big_endian' | 'little_endian' ;
exception: mode ':' unit_list | unit_list ;
unit_list: unit_spec | unit_list unit_spec ;
unit_spec: INTEGER | INTEGER '-' INTEGER ;
</pre></div>
<p>The variable consists of an optional default mode, followed by
a list of optional exceptions, which are separated by semicolons
from the preceding default and each other.  Each exception consists
of a format and a comma-separated list of units.  Valid values for
the modes are the same as for the <code>CONVERT</code> specifier:
</p>
<ul class="no-bullet">
<li><!-- /@w --> <code>NATIVE</code> Use the native format.  This is the default.
</li><li><!-- /@w --> <code>SWAP</code> Swap between little- and big-endian.
</li><li><!-- /@w --> <code>LITTLE_ENDIAN</code> Use the little-endian format
for unformatted files.
</li><li><!-- /@w --> <code>BIG_ENDIAN</code> Use the big-endian format for unformatted files.
</li></ul>
<p>A missing mode for an exception is taken to mean <code>BIG_ENDIAN</code>.
Examples of values for <code>GFORTRAN_CONVERT_UNIT</code> are:
</p><ul class="no-bullet">
<li><!-- /@w --> <code>'big_endian'</code>  Do all unformatted I/O in big_endian mode.
</li><li><!-- /@w --> <code>'little_endian;native:10-20,25'</code>  Do all unformatted I/O 
in little_endian mode, except for units 10 to 20 and 25, which are in
native format.
</li><li><!-- /@w --> <code>'10-20'</code>  Units 10 to 20 are big-endian, the rest is native.
</li></ul>

<p>Setting the environment variables should be done on the command
line or via the <code>export</code>
command for <code>sh</code>-compatible shells and via <code>setenv</code>
for <code>csh</code>-compatible shells.
</p>
<p>Example for <code>sh</code>:
</p><div class="smallexample">
<pre class="smallexample">$ gfortran foo.f90
$ GFORTRAN_CONVERT_UNIT='big_endian;native:10-20' ./a.out
</pre></div>

<p>Example code for <code>csh</code>:
</p><div class="smallexample">
<pre class="smallexample">% gfortran foo.f90
% setenv GFORTRAN_CONVERT_UNIT 'big_endian;native:10-20'
% ./a.out
</pre></div>

<p>Using anything but the native representation for unformatted data
carries a significant speed overhead.  If speed in this area matters
to you, it is best if you use this only for data that needs to be
portable.
</p>
<p>See <a href="#CONVERT-specifier">CONVERT specifier</a>, for an alternative way to specify the
data representation for unformatted files.  See <a href="#Runtime-Options">Runtime Options</a>, for
setting a default data representation for the whole program.  The
<code>CONVERT</code> specifier overrides the <samp>-fconvert</samp> compile options.
</p>
<p><em>Note that the values specified via the GFORTRAN_CONVERT_UNIT
environment variable will override the CONVERT specifier in the
open statement</em>.  This is to give control over data formats to
users who do not have the source code of their program available.
</p>
<hr>
<a name="GFORTRAN_005fERROR_005fDUMPCORE"></a>
<div class="header">
<p>
Next: <a href="#GFORTRAN_005fERROR_005fBACKTRACE" accesskey="n" rel="next">GFORTRAN_ERROR_BACKTRACE</a>, Previous: <a href="#GFORTRAN_005fCONVERT_005fUNIT" accesskey="p" rel="prev">GFORTRAN_CONVERT_UNIT</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fERROR_005fDUMPCORE_002d_002d_002dDump-core-on-run_002dtime-errors"></a>
<h3 class="section">3.13 <code>GFORTRAN_ERROR_DUMPCORE</code>&mdash;Dump core on run-time errors</h3>

<p>If the <code>GFORTRAN_ERROR_DUMPCORE</code> variable is set to
&lsquo;<samp>y</samp>&rsquo;, &lsquo;<samp>Y</samp>&rsquo; or &lsquo;<samp>1</samp>&rsquo; (only the first letter is relevant)
then library run-time errors cause core dumps. To disable the core
dumps, set the variable to &lsquo;<samp>n</samp>&rsquo;, &lsquo;<samp>N</samp>&rsquo;, &lsquo;<samp>0</samp>&rsquo;. Default
is not to core dump unless the <samp>-fdump-core</samp> compile option
was used.
</p>
<hr>
<a name="GFORTRAN_005fERROR_005fBACKTRACE"></a>
<div class="header">
<p>
Previous: <a href="#GFORTRAN_005fERROR_005fDUMPCORE" accesskey="p" rel="prev">GFORTRAN_ERROR_DUMPCORE</a>, Up: <a href="#Runtime" accesskey="u" rel="up">Runtime</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GFORTRAN_005fERROR_005fBACKTRACE_002d_002d_002dShow-backtrace-on-run_002dtime-errors"></a>
<h3 class="section">3.14 <code>GFORTRAN_ERROR_BACKTRACE</code>&mdash;Show backtrace on run-time errors</h3>

<p>If the <code>GFORTRAN_ERROR_BACKTRACE</code> variable is set to
&lsquo;<samp>y</samp>&rsquo;, &lsquo;<samp>Y</samp>&rsquo; or &lsquo;<samp>1</samp>&rsquo; (only the first letter is relevant)
then a backtrace is printed when a run-time error occurs.
To disable the backtracing, set the variable to
&lsquo;<samp>n</samp>&rsquo;, &lsquo;<samp>N</samp>&rsquo;, &lsquo;<samp>0</samp>&rsquo;. Default is not to print a backtrace
unless the <samp>-fbacktrace</samp> compile option
was used.
</p>



<hr>
<a name="Fortran-2003-and-2008-status"></a>
<div class="header">
<p>
Next: <a href="#Compiler-Characteristics" accesskey="n" rel="next">Compiler Characteristics</a>, Previous: <a href="#Runtime" accesskey="p" rel="prev">Runtime</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Fortran-2003-and-2008-Status"></a>
<h2 class="chapter">4 Fortran 2003 and 2008 Status</h2>

<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#Fortran-2003-status" accesskey="1">Fortran 2003 status</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Fortran-2008-status" accesskey="2">Fortran 2008 status</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
</table>

<hr>
<a name="Fortran-2003-status"></a>
<div class="header">
<p>
Next: <a href="#Fortran-2008-status" accesskey="n" rel="next">Fortran 2008 status</a>, Up: <a href="#Fortran-2003-and-2008-status" accesskey="u" rel="up">Fortran 2003 and 2008 status</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Fortran-2003-status-1"></a>
<h3 class="section">4.1 Fortran 2003 status</h3>

<p>Although GNU Fortran focuses on implementing the Fortran 95
standard for the time being, a few Fortran 2003 features are currently
available.
</p>
<ul>
<li> Intrinsics <code>command_argument_count</code>, <code>get_command</code>,
<code>get_command_argument</code>, <code>get_environment_variable</code>, and
<code>move_alloc</code>.

</li><li> <a name="index-array_002c-constructors"></a>
<a name="index-_005b_002e_002e_002e_005d"></a>
Array constructors using square brackets. That is, <code>[...]</code> rather
than <code>(/.../)</code>.

</li><li> <a name="index-FLUSH-statement"></a>
<a name="index-statement_002c-FLUSH"></a>
<code>FLUSH</code> statement.

</li><li> <a name="index-IOMSG_003d-specifier"></a>
<code>IOMSG=</code> specifier for I/O statements.

</li><li> <a name="index-ENUM-statement"></a>
<a name="index-ENUMERATOR-statement"></a>
<a name="index-statement_002c-ENUM"></a>
<a name="index-statement_002c-ENUMERATOR"></a>
<a name="index-fshort_002denums-1"></a>
Support for the declaration of enumeration constants via the
<code>ENUM</code> and <code>ENUMERATOR</code> statements.  Interoperability with
<code>gcc</code> is guaranteed also for the case where the
<code>-fshort-enums</code> command line option is given.

</li><li> <a name="index-TR-15581"></a>
TR 15581:
<ul>
<li> <a name="index-ALLOCATABLE-dummy-arguments"></a>
<code>ALLOCATABLE</code> dummy arguments.
</li><li> <a name="index-ALLOCATABLE-function-results"></a>
<code>ALLOCATABLE</code> function results
</li><li> <a name="index-ALLOCATABLE-components-of-derived-types"></a>
<code>ALLOCATABLE</code> components of derived types
</li></ul>

</li><li> <a name="index-STREAM-I_002fO"></a>
<a name="index-ACCESS_003d_0027STREAM_0027-I_002fO"></a>
The <code>OPEN</code> statement supports the <code>ACCESS='STREAM'</code> specifier,
allowing I/O without any record structure.

</li><li> Namelist input/output for internal files.

</li><li> <a name="index-PROTECTED-statement"></a>
<a name="index-statement_002c-PROTECTED"></a>
The <code>PROTECTED</code> statement and attribute.

</li><li> <a name="index-VALUE-statement"></a>
<a name="index-statement_002c-VALUE"></a>
The <code>VALUE</code> statement and attribute.

</li><li> <a name="index-VOLATILE-statement"></a>
<a name="index-statement_002c-VOLATILE"></a>
The <code>VOLATILE</code> statement and attribute.

</li><li> <a name="index-IMPORT-statement"></a>
<a name="index-statement_002c-IMPORT"></a>
The <code>IMPORT</code> statement, allowing to import
host-associated derived types.

</li><li> <a name="index-USE_002c-INTRINSIC-statement"></a>
<a name="index-statement_002c-USE_002c-INTRINSIC"></a>
<a name="index-ISO_005fFORTRAN_005fENV-statement"></a>
<a name="index-statement_002c-ISO_005fFORTRAN_005fENV"></a>
<code>USE</code> statement with <code>INTRINSIC</code> and <code>NON_INTRINSIC</code>
attribute; supported intrinsic modules: <code>ISO_FORTRAN_ENV</code>,
<code>OMP_LIB</code> and <code>OMP_LIB_KINDS</code>.

</li><li> Renaming of operators in the <code>USE</code> statement.

</li><li> <a name="index-ISO-C-Bindings"></a>
Interoperability with C (ISO C Bindings)

</li><li> BOZ as argument of INT, REAL, DBLE and CMPLX.

</li></ul>


<hr>
<a name="Fortran-2008-status"></a>
<div class="header">
<p>
Previous: <a href="#Fortran-2003-status" accesskey="p" rel="prev">Fortran 2003 status</a>, Up: <a href="#Fortran-2003-and-2008-status" accesskey="u" rel="up">Fortran 2003 and 2008 status</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Fortran-2008-status-1"></a>
<h3 class="section">4.2 Fortran 2008 status</h3>

<p>The next version of the Fortran standard after Fortran 2003 is currently
being worked on by the Working Group 5 of Sub-Committee 22 of the Joint
Technical Committee 1 of the International Organization for
Standardization (ISO) and the International Electrotechnical Commission
(IEC). This group is known at <a href="http://www.nag.co.uk/sc22wg5/">WG5</a>.
The next revision of the Fortran standard is informally referred to as
Fortran 2008, reflecting its planned release year. The GNU Fortran
compiler has support for some of the new features in Fortran 2008. This
support is based on the latest draft, available from
<a href="http://www.nag.co.uk/sc22wg5/">http://www.nag.co.uk/sc22wg5/</a>. However, as the final standard may
differ from the drafts, no guarantee of backward compatibility can be
made and you should only use it for experimental purposes.
</p>


<hr>
<a name="Compiler-Characteristics"></a>
<div class="header">
<p>
Next: <a href="#Extensions" accesskey="n" rel="next">Extensions</a>, Previous: <a href="#Fortran-2003-and-2008-status" accesskey="p" rel="prev">Fortran 2003 and 2008 status</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Compiler-Characteristics-1"></a>
<h2 class="chapter">5 Compiler Characteristics</h2>

<p>This chapter describes certain characteristics of the GNU Fortran
compiler, that are not specified by the Fortran standard, but which
might in some way or another become visible to the programmer.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#KIND-Type-Parameters" accesskey="1">KIND Type Parameters</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Internal-representation-of-LOGICAL-variables" accesskey="2">Internal representation of LOGICAL variables</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
</table>


<hr>
<a name="KIND-Type-Parameters"></a>
<div class="header">
<p>
Next: <a href="#Internal-representation-of-LOGICAL-variables" accesskey="n" rel="next">Internal representation of LOGICAL variables</a>, Up: <a href="#Compiler-Characteristics" accesskey="u" rel="up">Compiler Characteristics</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="KIND-Type-Parameters-1"></a>
<h3 class="section">5.1 KIND Type Parameters</h3>
<a name="index-kind"></a>

<p>The <code>KIND</code> type parameters supported by GNU Fortran for the primitive
data types are:
</p>
<dl compact="compact">
<dt><code>INTEGER</code></dt>
<dd><p>1, 2, 4, 8*, 16*, default: 4 (1)
</p>
</dd>
<dt><code>LOGICAL</code></dt>
<dd><p>1, 2, 4, 8*, 16*, default: 4 (1)
</p>
</dd>
<dt><code>REAL</code></dt>
<dd><p>4, 8, 10**, 16**, default: 4 (2)
</p>
</dd>
<dt><code>COMPLEX</code></dt>
<dd><p>4, 8, 10**, 16**, default: 4 (2)
</p>
</dd>
<dt><code>CHARACTER</code></dt>
<dd><p>1, 4, default: 1
</p>
</dd>
</dl>

<p>* = not available on all systems <br>
** = not available on all systems; additionally 10 and 16 are never
available at the same time <br>
(1) Unless -fdefault-integer-8 is used <br>
(2) Unless -fdefault-real-8 is used
</p>
<p>The <code>KIND</code> value matches the storage size in bytes, except for
<code>COMPLEX</code> where the storage size is twice as much (or both real and
imaginary part are a real value of the given size).  It is recommended to use
the <code>SELECT_*_KIND</code> intrinsics instead of the concrete values.
</p>

<hr>
<a name="Internal-representation-of-LOGICAL-variables"></a>
<div class="header">
<p>
Previous: <a href="#KIND-Type-Parameters" accesskey="p" rel="prev">KIND Type Parameters</a>, Up: <a href="#Compiler-Characteristics" accesskey="u" rel="up">Compiler Characteristics</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Internal-representation-of-LOGICAL-variables-1"></a>
<h3 class="section">5.2 Internal representation of LOGICAL variables</h3>
<a name="index-logical_002c-variable-representation"></a>

<p>The Fortran standard does not specify how variables of <code>LOGICAL</code>
type are represented, beyond requiring that <code>LOGICAL</code> variables
of default kind have the same storage size as default <code>INTEGER</code>
and <code>REAL</code> variables.  The GNU Fortran internal representation is
as follows.
</p>
<p>A <code>LOGICAL(KIND=N)</code> variable is represented as an
<code>INTEGER(KIND=N)</code> variable, however, with only two permissible
values: <code>1</code> for <code>.TRUE.</code> and <code>0</code> for
<code>.FALSE.</code>. Any other integer value results in undefined behavior.
</p>
<p>Note that for mixed-language programming using the
<code>ISO_C_BINDING</code> feature, there is a <code>C_BOOL</code> kind that can
be used to create <code>LOGICAL(KIND=C_BOOL)</code> variables which are
interoperable with the C99 _Bool type.  The C99 _Bool type has an
internal representation described in the C99 standard, which is
identical to the above description, i.e. with 1 for true and 0 for
false being the only permissible values.  Thus the internal
representation of <code>LOGICAL</code> variables in GNU Fortran is identical
to C99 _Bool, except for a possible difference in storage size
depending on the kind.
</p>



<hr>
<a name="Extensions"></a>
<div class="header">
<p>
Next: <a href="#Intrinsic-Procedures" accesskey="n" rel="next">Intrinsic Procedures</a>, Previous: <a href="#Compiler-Characteristics" accesskey="p" rel="prev">Compiler Characteristics</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Extensions-1"></a>
<h2 class="chapter">6 Extensions</h2>
<a name="index-extensions"></a>

<p>The two sections below detail the extensions to standard Fortran that are
implemented in GNU Fortran, as well as some of the popular or
historically important extensions that are not (or not yet) implemented.
For the latter case, we explain the alternatives available to GNU Fortran
users, including replacement by standard-conforming code or GNU
extensions.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="1">Extensions implemented in GNU Fortran</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Extensions-not-implemented-in-GNU-Fortran" accesskey="2">Extensions not implemented in GNU Fortran</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
</table>


<hr>
<a name="Extensions-implemented-in-GNU-Fortran"></a>
<div class="header">
<p>
Next: <a href="#Extensions-not-implemented-in-GNU-Fortran" accesskey="n" rel="next">Extensions not implemented in GNU Fortran</a>, Up: <a href="#Extensions" accesskey="u" rel="up">Extensions</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Extensions-implemented-in-GNU-Fortran-1"></a>
<h3 class="section">6.1 Extensions implemented in GNU Fortran</h3>
<a name="index-extensions_002c-implemented"></a>

<p>GNU Fortran implements a number of extensions over standard
Fortran. This chapter contains information on their syntax and
meaning.  There are currently two categories of GNU Fortran
extensions, those that provide functionality beyond that provided
by any standard, and those that are supported by GNU Fortran
purely for backward compatibility with legacy compilers.  By default,
<samp>-std=gnu</samp> allows the compiler to accept both types of
extensions, but to warn about the use of the latter.  Specifying
either <samp>-std=f95</samp>, <samp>-std=f2003</samp> or <samp>-std=f2008</samp>
disables both types of extensions, and <samp>-std=legacy</samp> allows both
without warning.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#Old_002dstyle-kind-specifications" accesskey="1">Old-style kind specifications</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Old_002dstyle-variable-initialization" accesskey="2">Old-style variable initialization</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Extensions-to-namelist" accesskey="3">Extensions to namelist</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#X-format-descriptor-without-count-field" accesskey="4">X format descriptor without count field</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Commas-in-FORMAT-specifications" accesskey="5">Commas in FORMAT specifications</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Missing-period-in-FORMAT-specifications" accesskey="6">Missing period in FORMAT specifications</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#I_002fO-item-lists" accesskey="7">I/O item lists</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BOZ-literal-constants" accesskey="8">BOZ literal constants</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Real-array-indices" accesskey="9">Real array indices</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Unary-operators">Unary operators</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Implicitly-convert-LOGICAL-and-INTEGER-values">Implicitly convert LOGICAL and INTEGER values</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Hollerith-constants-support">Hollerith constants support</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Cray-pointers">Cray pointers</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CONVERT-specifier">CONVERT specifier</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#OpenMP">OpenMP</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Argument-list-functions">Argument list functions</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
</table>

<hr>
<a name="Old_002dstyle-kind-specifications"></a>
<div class="header">
<p>
Next: <a href="#Old_002dstyle-variable-initialization" accesskey="n" rel="next">Old-style variable initialization</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Old_002dstyle-kind-specifications-1"></a>
<h4 class="subsection">6.1.1 Old-style kind specifications</h4>
<a name="index-kind_002c-old_002dstyle"></a>

<p>GNU Fortran allows old-style kind specifications in declarations. These
look like:
</p><div class="smallexample">
<pre class="smallexample">      TYPESPEC*size x,y,z
</pre></div>
<p>where <code>TYPESPEC</code> is a basic type (<code>INTEGER</code>, <code>REAL</code>,
etc.), and where <code>size</code> is a byte count corresponding to the
storage size of a valid kind for that type.  (For <code>COMPLEX</code>
variables, <code>size</code> is the total size of the real and imaginary
parts.)  The statement then declares <code>x</code>, <code>y</code> and <code>z</code> to
be of type <code>TYPESPEC</code> with the appropriate kind.  This is
equivalent to the standard-conforming declaration
</p><div class="smallexample">
<pre class="smallexample">      TYPESPEC(k) x,y,z
</pre></div>
<p>where <code>k</code> is the kind parameter suitable for the intended precision.  As
kind parameters are implementation-dependent, use the <code>KIND</code>,
<code>SELECTED_INT_KIND</code> and <code>SELECTED_REAL_KIND</code> intrinsics to retrieve
the correct value, for instance <code>REAL*8 x</code> can be replaced by:
</p><div class="smallexample">
<pre class="smallexample">INTEGER, PARAMETER :: dbl = KIND(1.0d0)
REAL(KIND=dbl) :: x
</pre></div>

<hr>
<a name="Old_002dstyle-variable-initialization"></a>
<div class="header">
<p>
Next: <a href="#Extensions-to-namelist" accesskey="n" rel="next">Extensions to namelist</a>, Previous: <a href="#Old_002dstyle-kind-specifications" accesskey="p" rel="prev">Old-style kind specifications</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Old_002dstyle-variable-initialization-1"></a>
<h4 class="subsection">6.1.2 Old-style variable initialization</h4>

<p>GNU Fortran allows old-style initialization of variables of the
form:
</p><div class="smallexample">
<pre class="smallexample">      INTEGER i/1/,j/2/
      REAL x(2,2) /3*0.,1./
</pre></div>
<p>The syntax for the initializers is as for the <code>DATA</code> statement, but
unlike in a <code>DATA</code> statement, an initializer only applies to the
variable immediately preceding the initialization.  In other words,
something like <code>INTEGER I,J/2,3/</code> is not valid.  This style of
initialization is only allowed in declarations without double colons
(<code>::</code>); the double colons were introduced in Fortran 90, which also
introduced a standard syntax for initializing variables in type
declarations.
</p>
<p>Examples of standard-conforming code equivalent to the above example
are:
</p><div class="smallexample">
<pre class="smallexample">! Fortran 90
      INTEGER :: i = 1, j = 2
      REAL :: x(2,2) = RESHAPE((/0.,0.,0.,1./),SHAPE(x))
! Fortran 77
      INTEGER i, j
      REAL x(2,2)
      DATA i/1/, j/2/, x/3*0.,1./
</pre></div>

<p>Note that variables which are explicitly initialized in declarations
or in <code>DATA</code> statements automatically acquire the <code>SAVE</code>
attribute.
</p>
<hr>
<a name="Extensions-to-namelist"></a>
<div class="header">
<p>
Next: <a href="#X-format-descriptor-without-count-field" accesskey="n" rel="next">X format descriptor without count field</a>, Previous: <a href="#Old_002dstyle-variable-initialization" accesskey="p" rel="prev">Old-style variable initialization</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Extensions-to-namelist-1"></a>
<h4 class="subsection">6.1.3 Extensions to namelist</h4>
<a name="index-Namelist"></a>

<p>GNU Fortran fully supports the Fortran 95 standard for namelist I/O
including array qualifiers, substrings and fully qualified derived types.
The output from a namelist write is compatible with namelist read.  The
output has all names in upper case and indentation to column 1 after the
namelist name.  Two extensions are permitted:
</p>
<p>Old-style use of &lsquo;<samp>$</samp>&rsquo; instead of &lsquo;<samp>&amp;</samp>&rsquo;
</p><div class="smallexample">
<pre class="smallexample">$MYNML
 X(:)%Y(2) = 1.0 2.0 3.0
 CH(1:4) = &quot;abcd&quot;
$END
</pre></div>

<p>It should be noted that the default terminator is &lsquo;<samp>/</samp>&rsquo; rather than
&lsquo;<samp>&amp;END</samp>&rsquo;.
</p>
<p>Querying of the namelist when inputting from stdin. After at least
one space, entering &lsquo;<samp>?</samp>&rsquo; sends to stdout the namelist name and the names of
the variables in the namelist:
</p><div class="smallexample">
<pre class="smallexample"> ?

&amp;mynml
 x
 x%y
 ch
&amp;end
</pre></div>

<p>Entering &lsquo;<samp>=?</samp>&rsquo; outputs the namelist to stdout, as if
<code>WRITE(*,NML = mynml)</code> had been called:
</p><div class="smallexample">
<pre class="smallexample">=?

&amp;MYNML
 X(1)%Y=  0.000000    ,  1.000000    ,  0.000000    ,
 X(2)%Y=  0.000000    ,  2.000000    ,  0.000000    ,
 X(3)%Y=  0.000000    ,  3.000000    ,  0.000000    ,
 CH=abcd,  /
</pre></div>

<p>To aid this dialog, when input is from stdin, errors send their
messages to stderr and execution continues, even if <code>IOSTAT</code> is set.
</p>
<p><code>PRINT</code> namelist is permitted.  This causes an error if
<samp>-std=f95</samp> is used.
</p><div class="smallexample">
<pre class="smallexample">PROGRAM test_print
  REAL, dimension (4)  ::  x = (/1.0, 2.0, 3.0, 4.0/)
  NAMELIST /mynml/ x
  PRINT mynml
END PROGRAM test_print
</pre></div>

<p>Expanded namelist reads are permitted.  This causes an error if 
<samp>-std=f95</samp> is used.  In the following example, the first element
of the array will be given the value 0.00 and the two succeeding
elements will be given the values 1.00 and 2.00.
</p><div class="smallexample">
<pre class="smallexample">&amp;MYNML
  X(1,1) = 0.00 , 1.00 , 2.00
/
</pre></div>

<hr>
<a name="X-format-descriptor-without-count-field"></a>
<div class="header">
<p>
Next: <a href="#Commas-in-FORMAT-specifications" accesskey="n" rel="next">Commas in FORMAT specifications</a>, Previous: <a href="#Extensions-to-namelist" accesskey="p" rel="prev">Extensions to namelist</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="X-format-descriptor-without-count-field-1"></a>
<h4 class="subsection">6.1.4 <code>X</code> format descriptor without count field</h4>

<p>To support legacy codes, GNU Fortran permits the count field of the
<code>X</code> edit descriptor in <code>FORMAT</code> statements to be omitted.
When omitted, the count is implicitly assumed to be one.
</p>
<div class="smallexample">
<pre class="smallexample">       PRINT 10, 2, 3
10     FORMAT (I1, X, I1)
</pre></div>

<hr>
<a name="Commas-in-FORMAT-specifications"></a>
<div class="header">
<p>
Next: <a href="#Missing-period-in-FORMAT-specifications" accesskey="n" rel="next">Missing period in FORMAT specifications</a>, Previous: <a href="#X-format-descriptor-without-count-field" accesskey="p" rel="prev">X format descriptor without count field</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Commas-in-FORMAT-specifications-1"></a>
<h4 class="subsection">6.1.5 Commas in <code>FORMAT</code> specifications</h4>

<p>To support legacy codes, GNU Fortran allows the comma separator
to be omitted immediately before and after character string edit
descriptors in <code>FORMAT</code> statements.
</p>
<div class="smallexample">
<pre class="smallexample">       PRINT 10, 2, 3
10     FORMAT ('FOO='I1' BAR='I2)
</pre></div>


<hr>
<a name="Missing-period-in-FORMAT-specifications"></a>
<div class="header">
<p>
Next: <a href="#I_002fO-item-lists" accesskey="n" rel="next">I/O item lists</a>, Previous: <a href="#Commas-in-FORMAT-specifications" accesskey="p" rel="prev">Commas in FORMAT specifications</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Missing-period-in-FORMAT-specifications-1"></a>
<h4 class="subsection">6.1.6 Missing period in <code>FORMAT</code> specifications</h4>

<p>To support legacy codes, GNU Fortran allows missing periods in format
specifications if and only if <samp>-std=legacy</samp> is given on the
command line.  This is considered non-conforming code and is
discouraged.
</p>
<div class="smallexample">
<pre class="smallexample">       REAL :: value
       READ(*,10) value
10     FORMAT ('F4')
</pre></div>

<hr>
<a name="I_002fO-item-lists"></a>
<div class="header">
<p>
Next: <a href="#BOZ-literal-constants" accesskey="n" rel="next">BOZ literal constants</a>, Previous: <a href="#Missing-period-in-FORMAT-specifications" accesskey="p" rel="prev">Missing period in FORMAT specifications</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="I_002fO-item-lists-1"></a>
<h4 class="subsection">6.1.7 I/O item lists</h4>
<a name="index-I_002fO-item-lists"></a>

<p>To support legacy codes, GNU Fortran allows the input item list
of the <code>READ</code> statement, and the output item lists of the
<code>WRITE</code> and <code>PRINT</code> statements, to start with a comma.
</p>
<hr>
<a name="BOZ-literal-constants"></a>
<div class="header">
<p>
Next: <a href="#Real-array-indices" accesskey="n" rel="next">Real array indices</a>, Previous: <a href="#I_002fO-item-lists" accesskey="p" rel="prev">I/O item lists</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BOZ-literal-constants-1"></a>
<h4 class="subsection">6.1.8 BOZ literal constants</h4>
<a name="index-BOZ-literal-constants"></a>

<p>Besides decimal constants, Fortran also supports binary (<code>b</code>),
octal (<code>o</code>) and hexadecimal (<code>z</code>) integer constants. The
syntax is: &lsquo;<samp>prefix quote digits quote</samp>&rsquo;, were the prefix is
either <code>b</code>, <code>o</code> or <code>z</code>, quote is either <code>'</code> or
<code>&quot;</code> and the digits are for binary <code>0</code> or <code>1</code>, for
octal between <code>0</code> and <code>7</code>, and for hexadecimal between
<code>0</code> and <code>F</code>. (Example: <code>b'01011101'</code>.)
</p>
<p>Up to Fortran 95, BOZ literals were only allowed to initialize
integer variables in DATA statements. Since Fortran 2003 BOZ literals
are also allowed as argument of <code>REAL</code>, <code>DBLE</code>, <code>INT</code>
and <code>CMPLX</code>; the result is the same as if the integer BOZ
literal had been converted by <code>TRANSFER</code> to, respectively,
<code>real</code>, <code>double precision</code>, <code>integer</code> or <code>complex</code>.
As GNU Fortran extension the intrinsic procedures <code>FLOAT</code>,
<code>DFLOAT</code>, <code>COMPLEX</code> and <code>DCMPLX</code> are treated alike.
</p>
<p>As an extension, GNU Fortran allows hexadecimal BOZ literal constants to
be specified using the <code>X</code> prefix, in addition to the standard
<code>Z</code> prefix. The BOZ literal can also be specified by adding a
suffix to the string, for example, <code>Z'ABC'</code> and <code>'ABC'Z</code> are
equivalent.
</p>
<p>Furthermore, GNU Fortran allows using BOZ literal constants outside
DATA statements and the four intrinsic functions allowed by Fortran 2003.
In DATA statements, in direct assignments, where the right-hand side
only contains a BOZ literal constant, and for old-style initializers of
the form <code>integer i /o'0173'/</code>, the constant is transferred
as if <code>TRANSFER</code> had been used; for <code>COMPLEX</code> numbers, only
the real part is initialized unless <code>CMPLX</code> is used. In all other
cases, the BOZ literal constant is converted to an <code>INTEGER</code> value with
the largest decimal representation.  This value is then converted
numerically to the type and kind of the variable in question.
(For instance <code>real :: r = b'0000001' + 1</code> initializes <code>r</code>
with <code>2.0</code>.) As different compilers implement the extension
differently, one should be careful when doing bitwise initialization
of non-integer variables.
</p>
<p>Note that initializing an <code>INTEGER</code> variable with a statement such
as <code>DATA i/Z'FFFFFFFF'/</code> will give an integer overflow error rather
than the desired result of <em>-1</em> when <code>i</code> is a 32-bit integer
on a system that supports 64-bit integers.  The &lsquo;<samp>-fno-range-check</samp>&rsquo;
option can be used as a workaround for legacy code that initializes
integers in this manner.
</p>
<hr>
<a name="Real-array-indices"></a>
<div class="header">
<p>
Next: <a href="#Unary-operators" accesskey="n" rel="next">Unary operators</a>, Previous: <a href="#BOZ-literal-constants" accesskey="p" rel="prev">BOZ literal constants</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Real-array-indices-1"></a>
<h4 class="subsection">6.1.9 Real array indices</h4>
<a name="index-array_002c-indices-of-type-real"></a>

<p>As an extension, GNU Fortran allows the use of <code>REAL</code> expressions
or variables as array indices.
</p>
<hr>
<a name="Unary-operators"></a>
<div class="header">
<p>
Next: <a href="#Implicitly-convert-LOGICAL-and-INTEGER-values" accesskey="n" rel="next">Implicitly convert LOGICAL and INTEGER values</a>, Previous: <a href="#Real-array-indices" accesskey="p" rel="prev">Real array indices</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Unary-operators-1"></a>
<h4 class="subsection">6.1.10 Unary operators</h4>
<a name="index-operators_002c-unary"></a>

<p>As an extension, GNU Fortran allows unary plus and unary minus operators
to appear as the second operand of binary arithmetic operators without
the need for parenthesis.
</p>
<div class="smallexample">
<pre class="smallexample">       X = Y * -Z
</pre></div>

<hr>
<a name="Implicitly-convert-LOGICAL-and-INTEGER-values"></a>
<div class="header">
<p>
Next: <a href="#Hollerith-constants-support" accesskey="n" rel="next">Hollerith constants support</a>, Previous: <a href="#Unary-operators" accesskey="p" rel="prev">Unary operators</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Implicitly-convert-LOGICAL-and-INTEGER-values-1"></a>
<h4 class="subsection">6.1.11 Implicitly convert <code>LOGICAL</code> and <code>INTEGER</code> values</h4>
<a name="index-conversion_002c-to-integer"></a>
<a name="index-conversion_002c-to-logical"></a>

<p>As an extension for backwards compatibility with other compilers, GNU
Fortran allows the implicit conversion of <code>LOGICAL</code> values to
<code>INTEGER</code> values and vice versa.  When converting from a
<code>LOGICAL</code> to an <code>INTEGER</code>, <code>.FALSE.</code> is interpreted as
zero, and <code>.TRUE.</code> is interpreted as one.  When converting from
<code>INTEGER</code> to <code>LOGICAL</code>, the value zero is interpreted as
<code>.FALSE.</code> and any nonzero value is interpreted as <code>.TRUE.</code>.
</p>
<div class="smallexample">
<pre class="smallexample">        LOGICAL :: l
        l = 1
</pre></div>
<div class="smallexample">
<pre class="smallexample">        INTEGER :: i
        i = .TRUE.
</pre></div>

<p>However, there is no implicit conversion of <code>INTEGER</code> values in
<code>if</code>-statements, nor of <code>LOGICAL</code> or <code>INTEGER</code> values
in I/O operations.
</p>
<hr>
<a name="Hollerith-constants-support"></a>
<div class="header">
<p>
Next: <a href="#Cray-pointers" accesskey="n" rel="next">Cray pointers</a>, Previous: <a href="#Implicitly-convert-LOGICAL-and-INTEGER-values" accesskey="p" rel="prev">Implicitly convert LOGICAL and INTEGER values</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Hollerith-constants-support-1"></a>
<h4 class="subsection">6.1.12 Hollerith constants support</h4>
<a name="index-Hollerith-constants"></a>

<p>GNU Fortran supports Hollerith constants in assignments, function
arguments, and <code>DATA</code> and <code>ASSIGN</code> statements.  A Hollerith
constant is written as a string of characters preceded by an integer
constant indicating the character count, and the letter <code>H</code> or
<code>h</code>, and stored in bytewise fashion in a numeric (<code>INTEGER</code>,
<code>REAL</code>, or <code>complex</code>) or <code>LOGICAL</code> variable.  The
constant will be padded or truncated to fit the size of the variable in
which it is stored.
</p>
<p>Examples of valid uses of Hollerith constants:
</p><div class="smallexample">
<pre class="smallexample">      complex*16 x(2)
      data x /16Habcdefghijklmnop, 16Hqrstuvwxyz012345/
      x(1) = 16HABCDEFGHIJKLMNOP
      call foo (4h abc)
</pre></div>

<p>Invalid Hollerith constants examples:
</p><div class="smallexample">
<pre class="smallexample">      integer*4 a
      a = 8H12345678 ! Valid, but the Hollerith constant will be truncated.
      a = 0H         ! At least one character is needed.
</pre></div>

<p>In general, Hollerith constants were used to provide a rudimentary
facility for handling character strings in early Fortran compilers,
prior to the introduction of <code>CHARACTER</code> variables in Fortran 77;
in those cases, the standard-compliant equivalent is to convert the
program to use proper character strings.  On occasion, there may be a
case where the intent is specifically to initialize a numeric variable
with a given byte sequence.  In these cases, the same result can be
obtained by using the <code>TRANSFER</code> statement, as in this example.
</p><div class="smallexample">
<pre class="smallexample">      INTEGER(KIND=4) :: a
      a = TRANSFER (&quot;abcd&quot;, a)     ! equivalent to: a = 4Habcd
</pre></div>


<hr>
<a name="Cray-pointers"></a>
<div class="header">
<p>
Next: <a href="#CONVERT-specifier" accesskey="n" rel="next">CONVERT specifier</a>, Previous: <a href="#Hollerith-constants-support" accesskey="p" rel="prev">Hollerith constants support</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Cray-pointers-1"></a>
<h4 class="subsection">6.1.13 Cray pointers</h4>
<a name="index-pointer_002c-Cray"></a>

<p>Cray pointers are part of a non-standard extension that provides a
C-like pointer in Fortran.  This is accomplished through a pair of
variables: an integer &quot;pointer&quot; that holds a memory address, and a
&quot;pointee&quot; that is used to dereference the pointer.
</p>
<p>Pointer/pointee pairs are declared in statements of the form:
</p><div class="smallexample">
<pre class="smallexample">        pointer ( &lt;pointer&gt; , &lt;pointee&gt; )
</pre></div>
<p>or,
</p><div class="smallexample">
<pre class="smallexample">        pointer ( &lt;pointer1&gt; , &lt;pointee1&gt; ), ( &lt;pointer2&gt; , &lt;pointee2&gt; ), ...
</pre></div>
<p>The pointer is an integer that is intended to hold a memory address.
The pointee may be an array or scalar.  A pointee can be an assumed
size array&mdash;that is, the last dimension may be left unspecified by
using a <code>*</code> in place of a value&mdash;but a pointee cannot be an
assumed shape array.  No space is allocated for the pointee.
</p>
<p>The pointee may have its type declared before or after the pointer
statement, and its array specification (if any) may be declared
before, during, or after the pointer statement.  The pointer may be
declared as an integer prior to the pointer statement.  However, some
machines have default integer sizes that are different than the size
of a pointer, and so the following code is not portable:
</p><div class="smallexample">
<pre class="smallexample">        integer ipt
        pointer (ipt, iarr)
</pre></div>
<p>If a pointer is declared with a kind that is too small, the compiler
will issue a warning; the resulting binary will probably not work
correctly, because the memory addresses stored in the pointers may be
truncated.  It is safer to omit the first line of the above example;
if explicit declaration of ipt&rsquo;s type is omitted, then the compiler
will ensure that ipt is an integer variable large enough to hold a
pointer.
</p>
<p>Pointer arithmetic is valid with Cray pointers, but it is not the same
as C pointer arithmetic.  Cray pointers are just ordinary integers, so
the user is responsible for determining how many bytes to add to a
pointer in order to increment it.  Consider the following example:
</p><div class="smallexample">
<pre class="smallexample">        real target(10)
        real pointee(10)
        pointer (ipt, pointee)
        ipt = loc (target)
        ipt = ipt + 1       
</pre></div>
<p>The last statement does not set <code>ipt</code> to the address of
<code>target(1)</code>, as it would in C pointer arithmetic.  Adding <code>1</code>
to <code>ipt</code> just adds one byte to the address stored in <code>ipt</code>.
</p>
<p>Any expression involving the pointee will be translated to use the
value stored in the pointer as the base address.
</p>
<p>To get the address of elements, this extension provides an intrinsic
function <code>LOC()</code>.  The <code>LOC()</code> function is equivalent to the
<code>&amp;</code> operator in C, except the address is cast to an integer type:
</p><div class="smallexample">
<pre class="smallexample">        real ar(10)
        pointer(ipt, arpte(10))
        real arpte
        ipt = loc(ar)  ! Makes arpte is an alias for ar
        arpte(1) = 1.0 ! Sets ar(1) to 1.0
</pre></div>
<p>The pointer can also be set by a call to the <code>MALLOC</code> intrinsic
(see <a href="#MALLOC">MALLOC</a>).
</p>
<p>Cray pointees often are used to alias an existing variable.  For
example:
</p><div class="smallexample">
<pre class="smallexample">        integer target(10)
        integer iarr(10)
        pointer (ipt, iarr)
        ipt = loc(target)
</pre></div>
<p>As long as <code>ipt</code> remains unchanged, <code>iarr</code> is now an alias for
<code>target</code>. The optimizer, however, will not detect this aliasing, so
it is unsafe to use <code>iarr</code> and <code>target</code> simultaneously.  Using
a pointee in any way that violates the Fortran aliasing rules or
assumptions is illegal. It is the user&rsquo;s responsibility to avoid doing
this; the compiler works under the assumption that no such aliasing
occurs.
</p>
<p>Cray pointers will work correctly when there is no aliasing (i.e., when
they are used to access a dynamically allocated block of memory), and
also in any routine where a pointee is used, but any variable with which
it shares storage is not used.  Code that violates these rules may not
run as the user intends.  This is not a bug in the optimizer; any code
that violates the aliasing rules is illegal.  (Note that this is not
unique to GNU Fortran; any Fortran compiler that supports Cray pointers
will &ldquo;incorrectly&rdquo; optimize code with illegal aliasing.)
</p>
<p>There are a number of restrictions on the attributes that can be applied
to Cray pointers and pointees.  Pointees may not have the
<code>ALLOCATABLE</code>, <code>INTENT</code>, <code>OPTIONAL</code>, <code>DUMMY</code>,
<code>TARGET</code>, <code>INTRINSIC</code>, or <code>POINTER</code> attributes. Pointers
may not have the <code>DIMENSION</code>, <code>POINTER</code>, <code>TARGET</code>,
<code>ALLOCATABLE</code>, <code>EXTERNAL</code>, or <code>INTRINSIC</code> attributes.
Pointees may not occur in more than one pointer statement.  A pointee
cannot be a pointer.  Pointees cannot occur in equivalence, common, or
data statements.
</p>
<p>A Cray pointer may also point to a function or a subroutine.  For
example, the following excerpt is valid:
</p><div class="smallexample">
<pre class="smallexample">  implicit none
  external sub
  pointer (subptr,subpte)
  external subpte
  subptr = loc(sub)
  call subpte()
  [...]
  subroutine sub
  [...]
  end subroutine sub
</pre></div>

<p>A pointer may be modified during the course of a program, and this
will change the location to which the pointee refers.  However, when
pointees are passed as arguments, they are treated as ordinary
variables in the invoked function.  Subsequent changes to the pointer
will not change the base address of the array that was passed.
</p>
<hr>
<a name="CONVERT-specifier"></a>
<div class="header">
<p>
Next: <a href="#OpenMP" accesskey="n" rel="next">OpenMP</a>, Previous: <a href="#Cray-pointers" accesskey="p" rel="prev">Cray pointers</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CONVERT-specifier-1"></a>
<h4 class="subsection">6.1.14 <code>CONVERT</code> specifier</h4>
<a name="index-CONVERT-specifier"></a>

<p>GNU Fortran allows the conversion of unformatted data between little-
and big-endian representation to facilitate moving of data
between different systems.  The conversion can be indicated with
the <code>CONVERT</code> specifier on the <code>OPEN</code> statement.
See <a href="#GFORTRAN_005fCONVERT_005fUNIT">GFORTRAN_CONVERT_UNIT</a>, for an alternative way of specifying
the data format via an environment variable.
</p>
<p>Valid values for <code>CONVERT</code> are:
</p><ul class="no-bullet">
<li><!-- /@w --> <code>CONVERT='NATIVE'</code> Use the native format.  This is the default.
</li><li><!-- /@w --> <code>CONVERT='SWAP'</code> Swap between little- and big-endian.
</li><li><!-- /@w --> <code>CONVERT='LITTLE_ENDIAN'</code> Use the little-endian representation
for unformatted files.
</li><li><!-- /@w --> <code>CONVERT='BIG_ENDIAN'</code> Use the big-endian representation for
unformatted files.
</li></ul>

<p>Using the option could look like this:
</p><div class="smallexample">
<pre class="smallexample">  open(file='big.dat',form='unformatted',access='sequential', &amp;
       convert='big_endian')
</pre></div>

<p>The value of the conversion can be queried by using
<code>INQUIRE(CONVERT=ch)</code>.  The values returned are
<code>'BIG_ENDIAN'</code> and <code>'LITTLE_ENDIAN'</code>.
</p>
<p><code>CONVERT</code> works between big- and little-endian for
<code>INTEGER</code> values of all supported kinds and for <code>REAL</code>
on IEEE systems of kinds 4 and 8.  Conversion between different
&ldquo;extended double&rdquo; types on different architectures such as
m68k and x86_64, which GNU Fortran
supports as <code>REAL(KIND=10)</code> and <code>REAL(KIND=16)</code>, will
probably not work.
</p>
<p><em>Note that the values specified via the GFORTRAN_CONVERT_UNIT
environment variable will override the CONVERT specifier in the
open statement</em>.  This is to give control over data formats to
users who do not have the source code of their program available.
</p>
<p>Using anything but the native representation for unformatted data
carries a significant speed overhead.  If speed in this area matters
to you, it is best if you use this only for data that needs to be
portable.
</p>
<hr>
<a name="OpenMP"></a>
<div class="header">
<p>
Next: <a href="#Argument-list-functions" accesskey="n" rel="next">Argument list functions</a>, Previous: <a href="#CONVERT-specifier" accesskey="p" rel="prev">CONVERT specifier</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="OpenMP-1"></a>
<h4 class="subsection">6.1.15 OpenMP</h4>
<a name="index-OpenMP-1"></a>

<p>OpenMP (Open Multi-Processing) is an application programming
interface (API) that supports multi-platform shared memory 
multiprocessing programming in C/C++ and Fortran on many 
architectures, including Unix and Microsoft Windows platforms.
It consists of a set of compiler directives, library routines,
and environment variables that influence run-time behavior.
</p>
<p>GNU Fortran strives to be compatible to the 
<a href="http://www.openmp.org/drupal/mp-documents/spec25.pdf">OpenMP Application Program Interface v2.5</a>.
</p>
<p>To enable the processing of the OpenMP directive <code>!$omp</code> in
free-form source code; the <code>c$omp</code>, <code>*$omp</code> and <code>!$omp</code>
directives in fixed form; the <code>!$</code> conditional compilation sentinels
in free form; and the <code>c$</code>, <code>*$</code> and <code>!$</code> sentinels
in fixed form, <code>gfortran</code> needs to be invoked with the
<samp>-fopenmp</samp>. This also arranges for automatic linking of the
GNU OpenMP runtime library <a href="http://gcc.gnu.org/onlinedocs/libgomp/index.html#Top">libgomp</a> in <cite>GNU OpenMP
runtime library</cite>.
</p>
<p>The OpenMP Fortran runtime library routines are provided both in a
form of a Fortran 90 module named <code>omp_lib</code> and in a form of
a Fortran <code>include</code> file named <samp>omp_lib.h</samp>.
</p>
<p>An example of a parallelized loop taken from Appendix A.1 of
the OpenMP Application Program Interface v2.5:
</p><div class="smallexample">
<pre class="smallexample">SUBROUTINE A1(N, A, B)
  INTEGER I, N
  REAL B(N), A(N)
!$OMP PARALLEL DO !I is private by default
  DO I=2,N
    B(I) = (A(I) + A(I-1)) / 2.0
  ENDDO
!$OMP END PARALLEL DO
END SUBROUTINE A1
</pre></div>

<p>Please note:
</p><ul>
<li> <samp>-fopenmp</samp> implies <samp>-frecursive</samp>, i.e., all local arrays
will be allocated on the stack. When porting existing code to OpenMP,
this may lead to surprising results, especially to segmentation faults
if the stacksize is limited.

</li><li> On glibc-based systems, OpenMP enabled applications can not be statically
linked due to limitations of the underlying pthreads-implementation. It
might be possible to get a working solution if 
<code>-Wl,--whole-archive -lpthread -Wl,--no-whole-archive</code> is added
to the command line. However, this is not supported by <code>gcc</code> and
thus not recommended.
</li></ul>

<hr>
<a name="Argument-list-functions"></a>
<div class="header">
<p>
Previous: <a href="#OpenMP" accesskey="p" rel="prev">OpenMP</a>, Up: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Argument-list-functions-_0025VAL_002c-_0025REF-and-_0025LOC"></a>
<h4 class="subsection">6.1.16 Argument list functions <code>%VAL</code>, <code>%REF</code> and <code>%LOC</code></h4>
<a name="index-argument-list-functions"></a>
<a name="index-_0025VAL"></a>
<a name="index-_0025REF"></a>
<a name="index-_0025LOC"></a>

<p>GNU Fortran supports argument list functions <code>%VAL</code>, <code>%REF</code> 
and <code>%LOC</code> statements, for backward compatibility with g77. 
It is recommended that these should be used only for code that is 
accessing facilities outside of GNU Fortran, such as operating system 
or windowing facilities. It is best to constrain such uses to isolated 
portions of a program&ndash;portions that deal specifically and exclusively 
with low-level, system-dependent facilities. Such portions might well 
provide a portable interface for use by the program as a whole, but are 
themselves not portable, and should be thoroughly tested each time they 
are rebuilt using a new compiler or version of a compiler.
</p>
<p><code>%VAL</code> passes a scalar argument by value, <code>%REF</code> passes it by 
reference and <code>%LOC</code> passes its memory location.  Since gfortran 
already passes scalar arguments by reference, <code>%REF</code> is in effect 
a do-nothing.  <code>%LOC</code> has the same effect as a fortran pointer.
</p>
<p>An example of passing an argument by value to a C subroutine foo.:
</p><div class="smallexample">
<pre class="smallexample">C
C prototype      void foo_ (float x);
C
      external foo
      real*4 x
      x = 3.14159
      call foo (%VAL (x))
      end
</pre></div>

<p>For details refer to the g77 manual
<a href="http://gcc.gnu.org/onlinedocs/gcc-3.4.6/g77/index.html#Top">http://gcc.gnu.org/onlinedocs/gcc-3.4.6/g77/index.html#Top</a>.
</p>
<p>Also, the gfortran testsuite c_by_val.f and its partner c_by_val.c are
worth a look.
</p>


<hr>
<a name="Extensions-not-implemented-in-GNU-Fortran"></a>
<div class="header">
<p>
Previous: <a href="#Extensions-implemented-in-GNU-Fortran" accesskey="p" rel="prev">Extensions implemented in GNU Fortran</a>, Up: <a href="#Extensions" accesskey="u" rel="up">Extensions</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Extensions-not-implemented-in-GNU-Fortran-1"></a>
<h3 class="section">6.2 Extensions not implemented in GNU Fortran</h3>
<a name="index-extensions_002c-not-implemented"></a>

<p>The long history of the Fortran language, its wide use and broad
userbase, the large number of different compiler vendors and the lack of
some features crucial to users in the first standards have lead to the
existence of a number of important extensions to the language.  While
some of the most useful or popular extensions are supported by the GNU
Fortran compiler, not all existing extensions are supported.  This section
aims at listing these extensions and offering advice on how best make
code that uses them running with the GNU Fortran compiler.
</p>

<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#STRUCTURE-and-RECORD" accesskey="1">STRUCTURE and RECORD</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ENCODE-and-DECODE-statements" accesskey="2">ENCODE and DECODE statements</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
</table>


<hr>
<a name="STRUCTURE-and-RECORD"></a>
<div class="header">
<p>
Next: <a href="#ENCODE-and-DECODE-statements" accesskey="n" rel="next">ENCODE and DECODE statements</a>, Up: <a href="#Extensions-not-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions not implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="STRUCTURE-and-RECORD-1"></a>
<h4 class="subsection">6.2.1 <code>STRUCTURE</code> and <code>RECORD</code></h4>
<a name="index-STRUCTURE"></a>
<a name="index-RECORD"></a>

<p>Structures are user-defined aggregate data types; this functionality was
standardized in Fortran 90 with an different syntax, under the name of
&ldquo;derived types&rdquo;. Here is an example of code using the non portable
structure syntax:
</p>
<div class="example">
<pre class="example">! Declaring a structure named ``item'' and containing three fields:
! an integer ID, an description string and a floating-point price.
STRUCTURE /item/
  INTEGER id
  CHARACTER(LEN=200) description
  REAL price
END STRUCTURE

! Define two variables, an single record of type ``item''
! named ``pear'', and an array of items named ``store_catalog''
RECORD /item/ pear, store_catalog(100)

! We can directly access the fields of both variables
pear.id = 92316
pear.description = &quot;juicy D'Anjou pear&quot;
pear.price = 0.15
store_catalog(7).id = 7831
store_catalog(7).description = &quot;milk bottle&quot;
store_catalog(7).price = 1.2

! We can also manipulate the whole structure
store_catalog(12) = pear
print *, store_catalog(12)
</pre></div>

<p>This code can easily be rewritten in the Fortran 90 syntax as following:
</p>
<div class="example">
<pre class="example">! ``STRUCTURE /name/ ... END STRUCTURE'' becomes
! ``TYPE name ... END TYPE''
TYPE item
  INTEGER id
  CHARACTER(LEN=200) description
  REAL price
END TYPE

! ``RECORD /name/ variable'' becomes ``TYPE(name) variable''
TYPE(item) pear, store_catalog(100)

! Instead of using a dot (.) to access fields of a record, the
! standard syntax uses a percent sign (%)
pear%id = 92316
pear%description = &quot;juicy D'Anjou pear&quot;
pear%price = 0.15
store_catalog(7)%id = 7831
store_catalog(7)%description = &quot;milk bottle&quot;
store_catalog(7)%price = 1.2

! Assignments of a whole variable don't change
store_catalog(12) = pear
print *, store_catalog(12)
</pre></div>




<hr>
<a name="ENCODE-and-DECODE-statements"></a>
<div class="header">
<p>
Previous: <a href="#STRUCTURE-and-RECORD" accesskey="p" rel="prev">STRUCTURE and RECORD</a>, Up: <a href="#Extensions-not-implemented-in-GNU-Fortran" accesskey="u" rel="up">Extensions not implemented in GNU Fortran</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ENCODE-and-DECODE-statements-1"></a>
<h4 class="subsection">6.2.2 <code>ENCODE</code> and <code>DECODE</code> statements</h4>
<a name="index-ENCODE"></a>
<a name="index-DECODE"></a>

<p>GNU Fortran doesn&rsquo;t support the <code>ENCODE</code> and <code>DECODE</code>
statements.  These statements are best replaced by <code>READ</code> and
<code>WRITE</code> statements involving internal files (<code>CHARACTER</code>
variables and arrays), which have been part of the Fortran standard since
Fortran 77. For example, replace a code fragment like
</p>
<div class="smallexample">
<pre class="smallexample">      INTEGER*1 LINE(80)
      REAL A, B, C
c     ... Code that sets LINE
      DECODE (80, 9000, LINE) A, B, C
 9000 FORMAT (1X, 3(F10.5))
</pre></div>

<p>with the following:
</p>
<div class="smallexample">
<pre class="smallexample">      CHARACTER(LEN=80) LINE
      REAL A, B, C
c     ... Code that sets LINE
      READ (UNIT=LINE, FMT=9000) A, B, C
 9000 FORMAT (1X, 3(F10.5))
</pre></div>

<p>Similarly, replace a code fragment like
</p>
<div class="smallexample">
<pre class="smallexample">      INTEGER*1 LINE(80)
      REAL A, B, C
c     ... Code that sets A, B and C
      ENCODE (80, 9000, LINE) A, B, C
 9000 FORMAT (1X, 'OUTPUT IS ', 3(F10.5))
</pre></div>

<p>with the following:
</p>
<div class="smallexample">
<pre class="smallexample">      INTEGER*1 LINE(80)
      REAL A, B, C
c     ... Code that sets A, B and C
      WRITE (UNIT=LINE, FMT=9000) A, B, C
 9000 FORMAT (1X, 'OUTPUT IS ', 3(F10.5))
</pre></div>






<hr>
<a name="Intrinsic-Procedures"></a>
<div class="header">
<p>
Next: <a href="#Intrinsic-Modules" accesskey="n" rel="next">Intrinsic Modules</a>, Previous: <a href="#Extensions" accesskey="p" rel="prev">Extensions</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Intrinsic-Procedures-1"></a>
<h2 class="chapter">7 Intrinsic Procedures</h2>
<a name="index-intrinsic-procedures"></a>

<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#Introduction-to-Intrinsics" accesskey="1">Introduction</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top"></td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ABORT" accesskey="2"><code>ABORT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Abort the program     
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ABS" accesskey="3"><code>ABS</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Absolute value     
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ACCESS" accesskey="4"><code>ACCESS</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Checks file access modes
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ACHAR" accesskey="5"><code>ACHAR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Character in <acronym>ASCII</acronym> collating sequence
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ACOS" accesskey="6"><code>ACOS</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Arccosine function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ACOSH" accesskey="7"><code>ACOSH</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Hyperbolic arccosine function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ADJUSTL" accesskey="8"><code>ADJUSTL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Left adjust a string
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ADJUSTR" accesskey="9"><code>ADJUSTR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Right adjust a string
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#AIMAG"><code>AIMAG</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Imaginary part of complex number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#AINT"><code>AINT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Truncate to a whole number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ALARM"><code>ALARM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Set an alarm clock
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ALL"><code>ALL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Determine if all values are true
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ALLOCATED"><code>ALLOCATED</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Status of allocatable entity
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#AND"><code>AND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bitwise logical AND
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ANINT"><code>ANINT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Nearest whole number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ANY"><code>ANY</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Determine if any values are true
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ASIN"><code>ASIN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Arcsine function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ASINH"><code>ASINH</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Hyperbolic arcsine function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ASSOCIATED"><code>ASSOCIATED</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Status of a pointer or pointer/target pair
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ATAN"><code>ATAN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Arctangent function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ATAN2"><code>ATAN2</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Arctangent function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ATANH"><code>ATANH</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Hyperbolic arctangent function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BESSEL_005fJ0"><code>BESSEL_J0</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bessel function of the first kind of order 0
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BESSEL_005fJ1"><code>BESSEL_J1</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bessel function of the first kind of order 1
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BESSEL_005fJN"><code>BESSEL_JN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bessel function of the first kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BESSEL_005fY0"><code>BESSEL_Y0</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bessel function of the second kind of order 0
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BESSEL_005fY1"><code>BESSEL_Y1</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bessel function of the second kind of order 1
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BESSEL_005fYN"><code>BESSEL_YN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bessel function of the second kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BIT_005fSIZE"><code>BIT_SIZE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bit size inquiry function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#BTEST"><code>BTEST</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bit test function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#C_005fASSOCIATED"><code>C_ASSOCIATED</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Status of a C pointer
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#C_005fF_005fPOINTER"><code>C_F_POINTER</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert C into Fortran pointer
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#C_005fF_005fPROCPOINTER"><code>C_F_PROCPOINTER</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert C into Fortran procedure pointer
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#C_005fFUNLOC"><code>C_FUNLOC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Obtain the C address of a procedure
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#C_005fLOC"><code>C_LOC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Obtain the C address of an object
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#C_005fSIZEOF"><code>C_SIZEOF</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Size in bytes of an expression
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CEILING"><code>CEILING</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Integer ceiling function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CHAR"><code>CHAR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Integer-to-character conversion function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CHDIR"><code>CHDIR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Change working directory
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CHMOD"><code>CHMOD</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Change access permissions of files
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CMPLX"><code>CMPLX</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Complex conversion function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#COMMAND_005fARGUMENT_005fCOUNT"><code>COMMAND_ARGUMENT_COUNT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get number of command line arguments
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#COMPLEX"><code>COMPLEX</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Complex conversion function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CONJG"><code>CONJG</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Complex conjugate function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#COS"><code>COS</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Cosine function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#COSH"><code>COSH</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Hyperbolic cosine function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#COUNT"><code>COUNT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Count occurrences of TRUE in an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CPU_005fTIME"><code>CPU_TIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">CPU time subroutine
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CSHIFT"><code>CSHIFT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Circular shift elements of an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#CTIME"><code>CTIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Subroutine (or function) to convert a time into a string
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DATE_005fAND_005fTIME"><code>DATE_AND_TIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Date and time subroutine
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DBLE"><code>DBLE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Double precision conversion function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DCMPLX"><code>DCMPLX</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Double complex conversion function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DFLOAT"><code>DFLOAT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Double precision conversion function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DIGITS"><code>DIGITS</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Significant digits function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DIM"><code>DIM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Positive difference
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DOT_005fPRODUCT"><code>DOT_PRODUCT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Dot product function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DPROD"><code>DPROD</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Double product function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DREAL"><code>DREAL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Double real part function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#DTIME"><code>DTIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Execution time subroutine (or function)
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#EOSHIFT"><code>EOSHIFT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">End-off shift elements of an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#EPSILON"><code>EPSILON</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Epsilon function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ERF"><code>ERF</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Error function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ERFC"><code>ERFC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Complementary error function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ERFC_005fSCALED"><code>ERFC_SCALED</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Exponentially-scaled complementary error function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ETIME"><code>ETIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Execution time subroutine (or function)
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#EXIT"><code>EXIT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Exit the program with status.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#EXP"><code>EXP</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Exponential function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#EXPONENT"><code>EXPONENT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Exponent function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FDATE"><code>FDATE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Subroutine (or function) to get the current time as a string
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FGET"><code>FGET</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Read a single character in stream mode from stdin
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FGETC"><code>FGETC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Read a single character in stream mode
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FLOAT"><code>FLOAT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert integer to default real
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FLOOR"><code>FLOOR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Integer floor function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FLUSH"><code>FLUSH</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Flush I/O unit(s)
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FNUM"><code>FNUM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">File number function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FPUT"><code>FPUT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Write a single character in stream mode to stdout
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FPUTC"><code>FPUTC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Write a single character in stream mode
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FRACTION"><code>FRACTION</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Fractional part of the model representation
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FREE"><code>FREE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Memory de-allocation subroutine
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FSEEK"><code>FSEEK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Low level file positioning subroutine
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FSTAT"><code>FSTAT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get file status
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#FTELL"><code>FTELL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Current stream position
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GAMMA"><code>GAMMA</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Gamma function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GERROR"><code>GERROR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get last system error message
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GETARG"><code>GETARG</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get command line arguments
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GET_005fCOMMAND"><code>GET_COMMAND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get the entire command line
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GET_005fCOMMAND_005fARGUMENT"><code>GET_COMMAND_ARGUMENT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get command line arguments
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GETCWD"><code>GETCWD</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get current working directory
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GETENV"><code>GETENV</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get an environmental variable
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GET_005fENVIRONMENT_005fVARIABLE"><code>GET_ENVIRONMENT_VARIABLE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get an environmental variable
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GETGID"><code>GETGID</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Group ID function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GETLOG"><code>GETLOG</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get login name
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GETPID"><code>GETPID</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Process ID function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GETUID"><code>GETUID</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">User ID function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#GMTIME"><code>GMTIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert time to GMT info
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#HOSTNM"><code>HOSTNM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get system host name
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#HUGE"><code>HUGE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Largest number of a kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#HYPOT"><code>HYPOT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Euclidian distance function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IACHAR"><code>IACHAR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Code in <acronym>ASCII</acronym> collating sequence
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IAND"><code>IAND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bitwise logical and
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IARGC"><code>IARGC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get the number of command line arguments
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IBCLR"><code>IBCLR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Clear bit
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IBITS"><code>IBITS</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bit extraction
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IBSET"><code>IBSET</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Set bit
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ICHAR"><code>ICHAR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Character-to-integer conversion function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IDATE"><code>IDATE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Current local time (day/month/year)
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IEOR"><code>IEOR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bitwise logical exclusive or
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IERRNO"><code>IERRNO</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Function to get the last system error number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#INDEX-intrinsic"><code>INDEX</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Position of a substring within a string
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#INT"><code>INT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert to integer type
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#INT2"><code>INT2</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert to 16-bit integer type
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#INT8"><code>INT8</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert to 64-bit integer type
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IOR"><code>IOR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bitwise logical or
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IRAND"><code>IRAND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Integer pseudo-random number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IS_005fIOSTAT_005fEND"><code>IS_IOSTAT_END</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Test for end-of-file value
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#IS_005fIOSTAT_005fEOR"><code>IS_IOSTAT_EOR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Test for end-of-record value
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ISATTY"><code>ISATTY</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Whether a unit is a terminal device
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ISHFT"><code>ISHFT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Shift bits
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ISHFTC"><code>ISHFTC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Shift bits circularly
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ISNAN"><code>ISNAN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Tests for a NaN
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#ITIME"><code>ITIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Current local time (hour/minutes/seconds)
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#KILL"><code>KILL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Send a signal to a process
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#KIND"><code>KIND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Kind of an entity
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LBOUND"><code>LBOUND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Lower dimension bounds of an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LEADZ"><code>LEADZ</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Number of leading zero bits of an integer
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LEN"><code>LEN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Length of a character entity
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LEN_005fTRIM"><code>LEN_TRIM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Length of a character entity without trailing blank characters
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LOG_005fGAMMA"><code>LOG_GAMMA</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Logarithm of the Gamma function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LGE"><code>LGE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Lexical greater than or equal
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LGT"><code>LGT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Lexical greater than
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LINK"><code>LINK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Create a hard link
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LLE"><code>LLE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Lexical less than or equal
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LLT"><code>LLT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Lexical less than
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LNBLNK"><code>LNBLNK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Index of the last non-blank character in a string
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LOC"><code>LOC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Returns the address of a variable
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LOG"><code>LOG</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Logarithm function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LOG10"><code>LOG10</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Base 10 logarithm function 
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LOGICAL"><code>LOGICAL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert to logical type
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LONG"><code>LONG</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert to integer type
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LSHIFT"><code>LSHIFT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Left shift bits
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LSTAT"><code>LSTAT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get file status
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#LTIME"><code>LTIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert time to local time info
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MALLOC"><code>MALLOC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Dynamic memory allocation function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MATMUL"><code>MATMUL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">matrix multiplication
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MAX"><code>MAX</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Maximum value of an argument list
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MAXEXPONENT"><code>MAXEXPONENT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Maximum exponent of a real kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MAXLOC"><code>MAXLOC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Location of the maximum value within an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MAXVAL"><code>MAXVAL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Maximum value of an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MCLOCK"><code>MCLOCK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Time function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MCLOCK8"><code>MCLOCK8</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Time function (64-bit)
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MERGE"><code>MERGE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Merge arrays
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MIN"><code>MIN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Minimum value of an argument list
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MINEXPONENT"><code>MINEXPONENT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Minimum exponent of a real kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MINLOC"><code>MINLOC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Location of the minimum value within an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MINVAL"><code>MINVAL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Minimum value of an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MOD"><code>MOD</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Remainder function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MODULO"><code>MODULO</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Modulo function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MOVE_005fALLOC"><code>MOVE_ALLOC</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Move allocation from one object to another
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#MVBITS"><code>MVBITS</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Move bits from one integer to another
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#NEAREST"><code>NEAREST</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Nearest representable number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#NEW_005fLINE"><code>NEW_LINE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">New line character
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#NINT"><code>NINT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Nearest whole number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#NOT"><code>NOT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Logical negation
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#NULL"><code>NULL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Function that returns an disassociated pointer
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#OR"><code>OR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bitwise logical OR
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#PACK"><code>PACK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Pack an array into an array of rank one
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#PERROR"><code>PERROR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Print system error message
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#PRECISION"><code>PRECISION</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Decimal precision of a real kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#PRESENT"><code>PRESENT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Determine whether an optional dummy argument is specified
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#PRODUCT"><code>PRODUCT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Product of array elements
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RADIX"><code>RADIX</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Base of a data model
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RANDOM_005fNUMBER"><code>RANDOM_NUMBER</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Pseudo-random number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RANDOM_005fSEED"><code>RANDOM_SEED</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Initialize a pseudo-random number sequence
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RAND"><code>RAND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Real pseudo-random number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RANGE"><code>RANGE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Decimal exponent range
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RAN"><code>RAN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Real pseudo-random number
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#REAL"><code>REAL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert to real type 
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RENAME"><code>RENAME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Rename a file
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#REPEAT"><code>REPEAT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Repeated string concatenation
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RESHAPE"><code>RESHAPE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Function to reshape an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RRSPACING"><code>RRSPACING</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Reciprocal of the relative spacing
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#RSHIFT"><code>RSHIFT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Right shift bits
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SCALE"><code>SCALE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Scale a real value
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SCAN"><code>SCAN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Scan a string for the presence of a set of characters
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SECNDS"><code>SECNDS</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Time function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SECOND"><code>SECOND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">CPU time function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SELECTED_005fCHAR_005fKIND"><code>SELECTED_CHAR_KIND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Choose character kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SELECTED_005fINT_005fKIND"><code>SELECTED_INT_KIND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Choose integer kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SELECTED_005fREAL_005fKIND"><code>SELECTED_REAL_KIND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Choose real kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SET_005fEXPONENT"><code>SET_EXPONENT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Set the exponent of the model
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SHAPE"><code>SHAPE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Determine the shape of an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SIGN"><code>SIGN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Sign copying function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SIGNAL"><code>SIGNAL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Signal handling subroutine (or function)
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SIN"><code>SIN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Sine function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SINH"><code>SINH</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Hyperbolic sine function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SIZE"><code>SIZE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Function to determine the size of an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SIZEOF"><code>SIZEOF</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Determine the size in bytes of an expression
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SLEEP"><code>SLEEP</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Sleep for the specified number of seconds
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SNGL"><code>SNGL</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Convert double precision real to default real
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SPACING"><code>SPACING</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Smallest distance between two numbers of a given type
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SPREAD"><code>SPREAD</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Add a dimension to an array 
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SQRT"><code>SQRT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Square-root function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SRAND"><code>SRAND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Reinitialize the random number generator
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#STAT"><code>STAT</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get file status
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SUM"><code>SUM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Sum of array elements
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SYMLNK"><code>SYMLNK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Create a symbolic link
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SYSTEM"><code>SYSTEM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Execute a shell command
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#SYSTEM_005fCLOCK"><code>SYSTEM_CLOCK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Time function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TAN"><code>TAN</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Tangent function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TANH"><code>TANH</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Hyperbolic tangent function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TIME"><code>TIME</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Time function
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TIME8"><code>TIME8</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Time function (64-bit)
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TINY"><code>TINY</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Smallest positive number of a real kind
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TRAILZ"><code>TRAILZ</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Number of trailing zero bits of an integer
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TRANSFER"><code>TRANSFER</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Transfer bit patterns
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TRANSPOSE"><code>TRANSPOSE</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Transpose an array of rank two
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TRIM"><code>TRIM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Remove trailing blank characters of a string
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#TTYNAM"><code>TTYNAM</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Get the name of a terminal device.
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#UBOUND"><code>UBOUND</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Upper dimension bounds of an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#UMASK"><code>UMASK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Set the file creation mask
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#UNLINK"><code>UNLINK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Remove a file from the file system
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#UNPACK"><code>UNPACK</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Unpack an array of rank one into an array
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#VERIFY"><code>VERIFY</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Scan a string for the absence of a set of characters
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#XOR"><code>XOR</code></a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">Bitwise logical exclusive or
</td></tr>
</table>

<hr>
<a name="Introduction-to-Intrinsics"></a>
<div class="header">
<p>
Next: <a href="#ABORT" accesskey="n" rel="next">ABORT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Introduction-to-intrinsic-procedures"></a>
<h3 class="section">7.1 Introduction to intrinsic procedures</h3>

<p>The intrinsic procedures provided by GNU Fortran include all of the
intrinsic procedures required by the Fortran 95 standard, a set of
intrinsic procedures for backwards compatibility with G77, and a
selection of intrinsic procedures from the Fortran 2003 and Fortran 2008
standards.  Any conflict between a description here and a description in
either the Fortran 95 standard, the Fortran 2003 standard or the Fortran
2008 standard is unintentional, and the standard(s) should be considered
authoritative.
</p>
<p>The enumeration of the <code>KIND</code> type parameter is processor defined in
the Fortran 95 standard.  GNU Fortran defines the default integer type and
default real type by <code>INTEGER(KIND=4)</code> and <code>REAL(KIND=4)</code>,
respectively.  The standard mandates that both data types shall have
another kind, which have more precision.  On typical target architectures
supported by <code>gfortran</code>, this kind type parameter is <code>KIND=8</code>.
Hence, <code>REAL(KIND=8)</code> and <code>DOUBLE PRECISION</code> are equivalent.
In the description of generic intrinsic procedures, the kind type parameter
will be specified by <code>KIND=*</code>, and in the description of specific
names for an intrinsic procedure the kind type parameter will be explicitly
given (e.g., <code>REAL(KIND=4)</code> or <code>REAL(KIND=8)</code>).  Finally, for
brevity the optional <code>KIND=</code> syntax will be omitted.
</p>
<p>Many of the intrinsic procedures take one or more optional arguments.
This document follows the convention used in the Fortran 95 standard,
and denotes such arguments by square brackets.
</p>
<p>GNU Fortran offers the <samp>-std=f95</samp> and <samp>-std=gnu</samp> options,
which can be used to restrict the set of intrinsic procedures to a 
given standard.  By default, <code>gfortran</code> sets the <samp>-std=gnu</samp>
option, and so all intrinsic procedures described here are accepted.  There
is one caveat.  For a select group of intrinsic procedures, <code>g77</code>
implemented both a function and a subroutine.  Both classes 
have been implemented in <code>gfortran</code> for backwards compatibility
with <code>g77</code>.  It is noted here that these functions and subroutines
cannot be intermixed in a given subprogram.  In the descriptions that follow,
the applicable standard for each intrinsic procedure is noted.
</p>


<hr>
<a name="ABORT"></a>
<div class="header">
<p>
Next: <a href="#ABS" accesskey="n" rel="next">ABS</a>, Previous: <a href="#Introduction-to-Intrinsics" accesskey="p" rel="prev">Introduction to Intrinsics</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ABORT-_002d_002d_002d-Abort-the-program"></a>
<h3 class="section">7.2 <code>ABORT</code> &mdash; Abort the program</h3>
<a name="index-ABORT"></a>
<a name="index-program-termination_002c-with-core-dump"></a>
<a name="index-terminate-program_002c-with-core-dump"></a>
<a name="index-core_002c-dump-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ABORT</code> causes immediate termination of the program.  On operating
systems that support a core dump, <code>ABORT</code> will produce a core dump even if
the option <samp>-fno-dump-core</samp> is in effect, which is suitable for debugging
purposes.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL ABORT</code>
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Does not return.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_abort
  integer :: i = 1, j = 2
  if (i /= j) call abort
end program test_abort
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#EXIT">EXIT</a>, <a href="#KILL">KILL</a>
</p>
</dd>
</dl>



<hr>
<a name="ABS"></a>
<div class="header">
<p>
Next: <a href="#ACCESS" accesskey="n" rel="next">ACCESS</a>, Previous: <a href="#ABORT" accesskey="p" rel="prev">ABORT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ABS-_002d_002d_002d-Absolute-value"></a>
<h3 class="section">7.3 <code>ABS</code> &mdash; Absolute value</h3>
<a name="index-ABS"></a>
<a name="index-CABS"></a>
<a name="index-DABS"></a>
<a name="index-IABS"></a>
<a name="index-ZABS"></a>
<a name="index-CDABS"></a>
<a name="index-absolute-value"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ABS(A)</code> computes the absolute value of <code>A</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, has overloads that are GNU extensions
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ABS(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type of the argument shall be an <code>INTEGER</code>,
<code>REAL</code>, or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type and
kind as the argument except the return value is <code>REAL</code> for a
<code>COMPLEX</code> argument.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_abs
  integer :: i = -1
  real :: x = -1.e0
  complex :: z = (-1.e0,0.e0)
  i = abs(i)
  x = abs(x)
  x = abs(z)
end program test_abs
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>CABS(A)</code></td><td width="20%"><code>COMPLEX(4) Z</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>DABS(A)</code></td><td width="20%"><code>REAL(8)    X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>IABS(A)</code></td><td width="20%"><code>INTEGER(4) I</code></td><td width="20%"><code>INTEGER(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>ZABS(A)</code></td><td width="20%"><code>COMPLEX(8) Z</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
<tr><td width="20%"><code>CDABS(A)</code></td><td width="20%"><code>COMPLEX(8) Z</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="ACCESS"></a>
<div class="header">
<p>
Next: <a href="#ACHAR" accesskey="n" rel="next">ACHAR</a>, Previous: <a href="#ABS" accesskey="p" rel="prev">ABS</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ACCESS-_002d_002d_002d-Checks-file-access-modes"></a>
<h3 class="section">7.4 <code>ACCESS</code> &mdash; Checks file access modes</h3>
<a name="index-ACCESS"></a>
<a name="index-file-system_002c-access-mode"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ACCESS(NAME, MODE)</code> checks whether the file <var>NAME</var> 
exists, is readable, writable or executable. Except for the
executable check, <code>ACCESS</code> can be replaced by
Fortran 95&rsquo;s <code>INQUIRE</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ACCESS(NAME, MODE)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>NAME</var></td><td width="70%">Scalar <code>CHARACTER</code> of default kind with the
file name. Tailing blank are ignored unless the character <code>achar(0)</code>
is present, then all characters up to and excluding <code>achar(0)</code> are
used as file name.</td></tr>
<tr><td width="15%"><var>MODE</var></td><td width="70%">Scalar <code>CHARACTER</code> of default kind with the
file access mode, may be any concatenation of <code>&quot;r&quot;</code> (readable),
<code>&quot;w&quot;</code> (writable) and <code>&quot;x&quot;</code> (executable), or <code>&quot; &quot;</code> to check
for existence.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns a scalar <code>INTEGER</code>, which is <code>0</code> if the file is
accessible in the given mode; otherwise or if an invalid argument
has been given for <code>MODE</code> the value <code>1</code> is returned.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program access_test
  implicit none
  character(len=*), parameter :: file  = 'test.dat'
  character(len=*), parameter :: file2 = 'test.dat  '//achar(0)
  if(access(file,' ') == 0) print *, trim(file),' is exists'
  if(access(file,'r') == 0) print *, trim(file),' is readable'
  if(access(file,'w') == 0) print *, trim(file),' is writable'
  if(access(file,'x') == 0) print *, trim(file),' is executable'
  if(access(file2,'rwx') == 0) &amp;
    print *, trim(file2),' is readable, writable and executable'
end program access_test
</pre></div>
</dd>
<dt><em>Specific names</em>:</dt>
<dt><em>See also</em>:</dt>
</dl>



<hr>
<a name="ACHAR"></a>
<div class="header">
<p>
Next: <a href="#ACOS" accesskey="n" rel="next">ACOS</a>, Previous: <a href="#ACCESS" accesskey="p" rel="prev">ACCESS</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ACHAR-_002d_002d_002d-Character-in-ASCII-collating-sequence"></a>
<h3 class="section">7.5 <code>ACHAR</code> &mdash; Character in <acronym>ASCII</acronym> collating sequence</h3>
<a name="index-ACHAR"></a>
<a name="index-ASCII-collating-sequence"></a>
<a name="index-collating-sequence_002c-ASCII"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ACHAR(I)</code> returns the character located at position <code>I</code>
in the <acronym>ASCII</acronym> collating sequence.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ACHAR(I [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>CHARACTER</code> with a length of one.
If the <var>KIND</var> argument is present, the return value is of the
specified kind and of the default kind otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_achar
  character c
  c = achar(32)
end program test_achar
</pre></div>

</dd>
<dt><em>Note</em>:</dt>
<dd><p>See <a href="#ICHAR">ICHAR</a> for a discussion of converting between numerical values
and formatted string representations.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CHAR">CHAR</a>, <a href="#IACHAR">IACHAR</a>, <a href="#ICHAR">ICHAR</a>
</p>
</dd>
</dl>



<hr>
<a name="ACOS"></a>
<div class="header">
<p>
Next: <a href="#ACOSH" accesskey="n" rel="next">ACOSH</a>, Previous: <a href="#ACHAR" accesskey="p" rel="prev">ACHAR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ACOS-_002d_002d_002d-Arccosine-function"></a>
<h3 class="section">7.6 <code>ACOS</code> &mdash; Arccosine function</h3>
<a name="index-ACOS"></a>
<a name="index-DACOS"></a>
<a name="index-trigonometric-function_002c-cosine_002c-inverse"></a>
<a name="index-cosine_002c-inverse"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ACOS(X)</code> computes the arccosine of <var>X</var> (inverse of <code>COS(X)</code>).
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ACOS(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> with a magnitude that is
less than or equal to one.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and it lies in the
range <em>0 \leq \acos(x) \leq \pi</em>. The return value if of the same
kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_acos
  real(8) :: x = 0.866_8
  x = acos(x)
end program test_acos
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DACOS(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Inverse function: <a href="#COS">COS</a>
</p>
</dd>
</dl>



<hr>
<a name="ACOSH"></a>
<div class="header">
<p>
Next: <a href="#ADJUSTL" accesskey="n" rel="next">ADJUSTL</a>, Previous: <a href="#ACOS" accesskey="p" rel="prev">ACOS</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ACOSH-_002d_002d_002d-Hyperbolic-arccosine-function"></a>
<h3 class="section">7.7 <code>ACOSH</code> &mdash; Hyperbolic arccosine function</h3>
<a name="index-ACOSH"></a>
<a name="index-DACOSH"></a>
<a name="index-area-hyperbolic-cosine"></a>
<a name="index-hyperbolic-arccosine"></a>
<a name="index-hyperbolic-function_002c-cosine_002c-inverse"></a>
<a name="index-cosine_002c-hyperbolic_002c-inverse"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ACOSH(X)</code> computes the hyperbolic arccosine of <var>X</var> (inverse of
<code>COSH(X)</code>).
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ACOSH(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value has the same type and kind as <var>X</var>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_acosh
  REAL(8), DIMENSION(3) :: x = (/ 1.0, 2.0, 3.0 /)
  WRITE (*,*) ACOSH(x)
END PROGRAM
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DACOSH(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Inverse function: <a href="#COSH">COSH</a>
</p></dd>
</dl>



<hr>
<a name="ADJUSTL"></a>
<div class="header">
<p>
Next: <a href="#ADJUSTR" accesskey="n" rel="next">ADJUSTR</a>, Previous: <a href="#ACOSH" accesskey="p" rel="prev">ACOSH</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ADJUSTL-_002d_002d_002d-Left-adjust-a-string"></a>
<h3 class="section">7.8 <code>ADJUSTL</code> &mdash; Left adjust a string</h3>
<a name="index-ADJUSTL"></a>
<a name="index-string_002c-adjust-left"></a>
<a name="index-adjust-string"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ADJUSTL(STRING)</code> will left adjust a string by removing leading spaces.
Spaces are inserted at the end of the string as needed.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 90 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ADJUSTL(STRING)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">The type shall be <code>CHARACTER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>CHARACTER</code> and of the same kind as
<var>STRING</var> where leading spaces are removed and the same number of
spaces are inserted on the end of <var>STRING</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_adjustl
  character(len=20) :: str = '   gfortran'
  str = adjustl(str)
  print *, str
end program test_adjustl
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ADJUSTR">ADJUSTR</a>, <a href="#TRIM">TRIM</a>
</p></dd>
</dl>



<hr>
<a name="ADJUSTR"></a>
<div class="header">
<p>
Next: <a href="#AIMAG" accesskey="n" rel="next">AIMAG</a>, Previous: <a href="#ADJUSTL" accesskey="p" rel="prev">ADJUSTL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ADJUSTR-_002d_002d_002d-Right-adjust-a-string"></a>
<h3 class="section">7.9 <code>ADJUSTR</code> &mdash; Right adjust a string</h3>
<a name="index-ADJUSTR"></a>
<a name="index-string_002c-adjust-right"></a>
<a name="index-adjust-string-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ADJUSTR(STRING)</code> will right adjust a string by removing trailing spaces.
Spaces are inserted at the start of the string as needed.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ADJUSTR(STRING)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STR</var></td><td width="70%">The type shall be <code>CHARACTER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>CHARACTER</code> and of the same kind as
<var>STRING</var> where trailing spaces are removed and the same number of
spaces are inserted at the start of <var>STRING</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_adjustr
  character(len=20) :: str = 'gfortran'
  str = adjustr(str)
  print *, str
end program test_adjustr
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ADJUSTL">ADJUSTL</a>, <a href="#TRIM">TRIM</a>
</p></dd>
</dl>



<hr>
<a name="AIMAG"></a>
<div class="header">
<p>
Next: <a href="#AINT" accesskey="n" rel="next">AINT</a>, Previous: <a href="#ADJUSTR" accesskey="p" rel="prev">ADJUSTR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="AIMAG-_002d_002d_002d-Imaginary-part-of-complex-number"></a>
<h3 class="section">7.10 <code>AIMAG</code> &mdash; Imaginary part of complex number</h3>
<a name="index-AIMAG"></a>
<a name="index-DIMAG"></a>
<a name="index-IMAG"></a>
<a name="index-IMAGPART"></a>
<a name="index-complex-numbers_002c-imaginary-part"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>AIMAG(Z)</code> yields the imaginary part of complex argument <code>Z</code>.
The <code>IMAG(Z)</code> and <code>IMAGPART(Z)</code> intrinsic functions are provided
for compatibility with <code>g77</code>, and their use in new code is 
strongly discouraged.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, has overloads that are GNU extensions
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = AIMAG(Z)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>Z</var></td><td width="70%">The type of the argument shall be <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> with the
kind type parameter of the argument.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_aimag
  complex(4) z4
  complex(8) z8
  z4 = cmplx(1.e0_4, 0.e0_4)
  z8 = cmplx(0.e0_8, 1.e0_8)
  print *, aimag(z4), dimag(z8)
end program test_aimag
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DIMAG(Z)</code></td><td width="20%"><code>COMPLEX(8) Z</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
<tr><td width="20%"><code>IMAG(Z)</code></td><td width="20%"><code>COMPLEX Z</code></td><td width="20%"><code>REAL</code></td><td width="25%">GNU extension</td></tr>
<tr><td width="20%"><code>IMAGPART(Z)</code></td><td width="20%"><code>COMPLEX Z</code></td><td width="20%"><code>REAL</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="AINT"></a>
<div class="header">
<p>
Next: <a href="#ALARM" accesskey="n" rel="next">ALARM</a>, Previous: <a href="#AIMAG" accesskey="p" rel="prev">AIMAG</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="AINT-_002d_002d_002d-Truncate-to-a-whole-number"></a>
<h3 class="section">7.11 <code>AINT</code> &mdash; Truncate to a whole number</h3>
<a name="index-AINT"></a>
<a name="index-DINT"></a>
<a name="index-floor"></a>
<a name="index-rounding_002c-floor"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>AINT(A [, KIND])</code> truncates its argument to a whole number.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = AINT(A [, KIND])</code> 
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type of the argument shall be <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> with the kind type parameter of the
argument if the optional <var>KIND</var> is absent; otherwise, the kind
type parameter will be given by <var>KIND</var>.  If the magnitude of 
<var>X</var> is less than one, <code>AINT(X)</code> returns zero.  If the
magnitude is equal to or greater than one then it returns the largest
whole number that does not exceed its magnitude.  The sign is the same
as the sign of <var>X</var>. 
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_aint
  real(4) x4
  real(8) x8
  x4 = 1.234E0_4
  x8 = 4.321_8
  print *, aint(x4), dint(x8)
  x8 = aint(x4,8)
end program test_aint
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DINT(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="ALARM"></a>
<div class="header">
<p>
Next: <a href="#ALL" accesskey="n" rel="next">ALL</a>, Previous: <a href="#AINT" accesskey="p" rel="prev">AINT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ALARM-_002d_002d_002d-Execute-a-routine-after-a-given-delay"></a>
<h3 class="section">7.12 <code>ALARM</code> &mdash; Execute a routine after a given delay</h3>
<a name="index-ALARM"></a>
<a name="index-delayed-execution"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ALARM(SECONDS, HANDLER [, STATUS])</code> causes external subroutine <var>HANDLER</var>
to be executed after a delay of <var>SECONDS</var> by using <code>alarm(2)</code> to
set up a signal and <code>signal(2)</code> to catch it. If <var>STATUS</var> is
supplied, it will be returned with the number of seconds remaining until
any previously scheduled alarm was due to be delivered, or zero if there
was no previously scheduled alarm.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL ALARM(SECONDS, HANDLER [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SECONDS</var></td><td width="70%">The type of the argument shall be a scalar
<code>INTEGER</code>. It is <code>INTENT(IN)</code>.</td></tr>
<tr><td width="15%"><var>HANDLER</var></td><td width="70%">Signal handler (<code>INTEGER FUNCTION</code> or
<code>SUBROUTINE</code>) or dummy/global <code>INTEGER</code> scalar. The scalar 
values may be either <code>SIG_IGN=1</code> to ignore the alarm generated 
or <code>SIG_DFL=0</code> to set the default action. It is <code>INTENT(IN)</code>.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) <var>STATUS</var> shall be a scalar
variable of the default <code>INTEGER</code> kind. It is <code>INTENT(OUT)</code>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_alarm
  external handler_print
  integer i
  call alarm (3, handler_print, i)
  print *, i
  call sleep(10)
end program test_alarm
</pre></div>
<p>This will cause the external routine <var>handler_print</var> to be called
after 3 seconds.
</p></dd>
</dl>



<hr>
<a name="ALL"></a>
<div class="header">
<p>
Next: <a href="#ALLOCATED" accesskey="n" rel="next">ALLOCATED</a>, Previous: <a href="#ALARM" accesskey="p" rel="prev">ALARM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ALL-_002d_002d_002d-All-values-in-MASK-along-DIM-are-true"></a>
<h3 class="section">7.13 <code>ALL</code> &mdash; All values in <var>MASK</var> along <var>DIM</var> are true</h3>
<a name="index-ALL"></a>
<a name="index-array_002c-apply-condition"></a>
<a name="index-array_002c-condition-testing"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ALL(MASK [, DIM])</code> determines if all the values are true in <var>MASK</var>
in the array along dimension <var>DIM</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ALL(MASK [, DIM])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>MASK</var></td><td width="70%">The type of the argument shall be <code>LOGICAL</code> and
it shall not be scalar.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) <var>DIM</var> shall be a scalar integer
with a value that lies between one and the rank of <var>MASK</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p><code>ALL(MASK)</code> returns a scalar value of type <code>LOGICAL</code> where
the kind type parameter is the same as the kind type parameter of
<var>MASK</var>.  If <var>DIM</var> is present, then <code>ALL(MASK, DIM)</code> returns
an array with the rank of <var>MASK</var> minus 1.  The shape is determined from
the shape of <var>MASK</var> where the <var>DIM</var> dimension is elided. 
</p>
<dl compact="compact">
<dt>(A)</dt>
<dd><p><code>ALL(MASK)</code> is true if all elements of <var>MASK</var> are true.
It also is true if <var>MASK</var> has zero size; otherwise, it is false.
</p></dd>
<dt>(B)</dt>
<dd><p>If the rank of <var>MASK</var> is one, then <code>ALL(MASK,DIM)</code> is equivalent
to <code>ALL(MASK)</code>.  If the rank is greater than one, then <code>ALL(MASK,DIM)</code>
is determined by applying <code>ALL</code> to the array sections.
</p></dd>
</dl>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_all
  logical l
  l = all((/.true., .true., .true./))
  print *, l
  call section
  contains
    subroutine section
      integer a(2,3), b(2,3)
      a = 1
      b = 1
      b(2,2) = 2
      print *, all(a .eq. b, 1)
      print *, all(a .eq. b, 2)
    end subroutine section
end program test_all
</pre></div>
</dd>
</dl>



<hr>
<a name="ALLOCATED"></a>
<div class="header">
<p>
Next: <a href="#AND" accesskey="n" rel="next">AND</a>, Previous: <a href="#ALL" accesskey="p" rel="prev">ALL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ALLOCATED-_002d_002d_002d-Status-of-an-allocatable-entity"></a>
<h3 class="section">7.14 <code>ALLOCATED</code> &mdash; Status of an allocatable entity</h3>
<a name="index-ALLOCATED"></a>
<a name="index-allocation_002c-status"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ALLOCATED(ARRAY)</code> checks the status of whether <var>X</var> is allocated.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ALLOCATED(ARRAY)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">The argument shall be an <code>ALLOCATABLE</code> array.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar <code>LOGICAL</code> with the default logical
kind type parameter.  If <var>ARRAY</var> is allocated, <code>ALLOCATED(ARRAY)</code>
is <code>.TRUE.</code>; otherwise, it returns <code>.FALSE.</code> 
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_allocated
  integer :: i = 4
  real(4), allocatable :: x(:)
  if (.not. allocated(x)) allocate(x(i))
end program test_allocated
</pre></div>
</dd>
</dl>



<hr>
<a name="AND"></a>
<div class="header">
<p>
Next: <a href="#ANINT" accesskey="n" rel="next">ANINT</a>, Previous: <a href="#ALLOCATED" accesskey="p" rel="prev">ALLOCATED</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="AND-_002d_002d_002d-Bitwise-logical-AND"></a>
<h3 class="section">7.15 <code>AND</code> &mdash; Bitwise logical AND</h3>
<a name="index-AND"></a>
<a name="index-bitwise-logical-and"></a>
<a name="index-logical-and_002c-bitwise"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Bitwise logical <code>AND</code>.
</p>
<p>This intrinsic routine is provided for backwards compatibility with 
GNU Fortran 77.  For integer arguments, programmers should consider
the use of the <a href="#IAND">IAND</a> intrinsic defined by the Fortran standard.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = AND(I, J)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be either a scalar <code>INTEGER</code>
type or a scalar <code>LOGICAL</code> type.</td></tr>
<tr><td width="15%"><var>J</var></td><td width="70%">The type shall be the same as the type of <var>I</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return type is either a scalar <code>INTEGER</code> or a scalar
<code>LOGICAL</code>.  If the kind type parameters differ, then the
smaller kind type is implicitly converted to larger kind, and the 
return has the larger kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_and
  LOGICAL :: T = .TRUE., F = .FALSE.
  INTEGER :: a, b
  DATA a / Z'F' /, b / Z'3' /

  WRITE (*,*) AND(T, T), AND(T, F), AND(F, T), AND(F, F)
  WRITE (*,*) AND(a, b)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Fortran 95 elemental function: <a href="#IAND">IAND</a>
</p></dd>
</dl>



<hr>
<a name="ANINT"></a>
<div class="header">
<p>
Next: <a href="#ANY" accesskey="n" rel="next">ANY</a>, Previous: <a href="#AND" accesskey="p" rel="prev">AND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ANINT-_002d_002d_002d-Nearest-whole-number"></a>
<h3 class="section">7.16 <code>ANINT</code> &mdash; Nearest whole number</h3>
<a name="index-ANINT"></a>
<a name="index-DNINT"></a>
<a name="index-ceiling"></a>
<a name="index-rounding_002c-ceiling"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ANINT(A [, KIND])</code> rounds its argument to the nearest whole number.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ANINT(A [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type of the argument shall be <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type real with the kind type parameter of the
argument if the optional <var>KIND</var> is absent; otherwise, the kind
type parameter will be given by <var>KIND</var>.  If <var>A</var> is greater than
zero, <code>ANINT(A)</code> returns <code>AINT(X+0.5)</code>.  If <var>A</var> is
less than or equal to zero then it returns <code>AINT(X-0.5)</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_anint
  real(4) x4
  real(8) x8
  x4 = 1.234E0_4
  x8 = 4.321_8
  print *, anint(x4), dnint(x8)
  x8 = anint(x4,8)
end program test_anint
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DNINT(A)</code></td><td width="20%"><code>REAL(8) A</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="ANY"></a>
<div class="header">
<p>
Next: <a href="#ASIN" accesskey="n" rel="next">ASIN</a>, Previous: <a href="#ANINT" accesskey="p" rel="prev">ANINT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ANY-_002d_002d_002d-Any-value-in-MASK-along-DIM-is-true"></a>
<h3 class="section">7.17 <code>ANY</code> &mdash; Any value in <var>MASK</var> along <var>DIM</var> is true</h3>
<a name="index-ANY"></a>
<a name="index-array_002c-apply-condition-1"></a>
<a name="index-array_002c-condition-testing-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ANY(MASK [, DIM])</code> determines if any of the values in the logical array
<var>MASK</var> along dimension <var>DIM</var> are <code>.TRUE.</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ANY(MASK [, DIM])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>MASK</var></td><td width="70%">The type of the argument shall be <code>LOGICAL</code> and
it shall not be scalar.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) <var>DIM</var> shall be a scalar integer
with a value that lies between one and the rank of <var>MASK</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p><code>ANY(MASK)</code> returns a scalar value of type <code>LOGICAL</code> where
the kind type parameter is the same as the kind type parameter of
<var>MASK</var>.  If <var>DIM</var> is present, then <code>ANY(MASK, DIM)</code> returns
an array with the rank of <var>MASK</var> minus 1.  The shape is determined from
the shape of <var>MASK</var> where the <var>DIM</var> dimension is elided. 
</p>
<dl compact="compact">
<dt>(A)</dt>
<dd><p><code>ANY(MASK)</code> is true if any element of <var>MASK</var> is true;
otherwise, it is false.  It also is false if <var>MASK</var> has zero size.
</p></dd>
<dt>(B)</dt>
<dd><p>If the rank of <var>MASK</var> is one, then <code>ANY(MASK,DIM)</code> is equivalent
to <code>ANY(MASK)</code>.  If the rank is greater than one, then <code>ANY(MASK,DIM)</code>
is determined by applying <code>ANY</code> to the array sections.
</p></dd>
</dl>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_any
  logical l
  l = any((/.true., .true., .true./))
  print *, l
  call section
  contains
    subroutine section
      integer a(2,3), b(2,3)
      a = 1
      b = 1
      b(2,2) = 2
      print *, any(a .eq. b, 1)
      print *, any(a .eq. b, 2)
    end subroutine section
end program test_any
</pre></div>
</dd>
</dl>



<hr>
<a name="ASIN"></a>
<div class="header">
<p>
Next: <a href="#ASINH" accesskey="n" rel="next">ASINH</a>, Previous: <a href="#ANY" accesskey="p" rel="prev">ANY</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ASIN-_002d_002d_002d-Arcsine-function"></a>
<h3 class="section">7.18 <code>ASIN</code> &mdash; Arcsine function</h3>
<a name="index-ASIN"></a>
<a name="index-DASIN"></a>
<a name="index-trigonometric-function_002c-sine_002c-inverse"></a>
<a name="index-sine_002c-inverse"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ASIN(X)</code> computes the arcsine of its <var>X</var> (inverse of <code>SIN(X)</code>).
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ASIN(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>, and a magnitude that is
less than or equal to one.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and it lies in the
range <em>-\pi / 2 \leq \asin (x) \leq \pi / 2</em>.  The kind type
parameter is the same as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_asin
  real(8) :: x = 0.866_8
  x = asin(x)
end program test_asin
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DASIN(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Inverse function: <a href="#SIN">SIN</a>
</p>
</dd>
</dl>



<hr>
<a name="ASINH"></a>
<div class="header">
<p>
Next: <a href="#ASSOCIATED" accesskey="n" rel="next">ASSOCIATED</a>, Previous: <a href="#ASIN" accesskey="p" rel="prev">ASIN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ASINH-_002d_002d_002d-Hyperbolic-arcsine-function"></a>
<h3 class="section">7.19 <code>ASINH</code> &mdash; Hyperbolic arcsine function</h3>
<a name="index-ASINH"></a>
<a name="index-DASINH"></a>
<a name="index-area-hyperbolic-sine"></a>
<a name="index-hyperbolic-arcsine"></a>
<a name="index-hyperbolic-function_002c-sine_002c-inverse"></a>
<a name="index-sine_002c-hyperbolic_002c-inverse"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ASINH(X)</code> computes the hyperbolic arcsine of <var>X</var> (inverse of <code>SINH(X)</code>).
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ASINH(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type and kind as  <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_asinh
  REAL(8), DIMENSION(3) :: x = (/ -1.0, 0.0, 1.0 /)
  WRITE (*,*) ASINH(x)
END PROGRAM
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DASINH(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Inverse function: <a href="#SINH">SINH</a>
</p></dd>
</dl>



<hr>
<a name="ASSOCIATED"></a>
<div class="header">
<p>
Next: <a href="#ATAN" accesskey="n" rel="next">ATAN</a>, Previous: <a href="#ASINH" accesskey="p" rel="prev">ASINH</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ASSOCIATED-_002d_002d_002d-Status-of-a-pointer-or-pointer_002ftarget-pair"></a>
<h3 class="section">7.20 <code>ASSOCIATED</code> &mdash; Status of a pointer or pointer/target pair</h3>
<a name="index-ASSOCIATED"></a>
<a name="index-pointer_002c-status"></a>
<a name="index-association-status"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ASSOCIATED(POINTER [, TARGET])</code> determines the status of the pointer
<var>POINTER</var> or if <var>POINTER</var> is associated with the target <var>TARGET</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ASSOCIATED(POINTER [, TARGET])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>POINTER</var></td><td width="70%"><var>POINTER</var> shall have the <code>POINTER</code> attribute
and it can be of any type.</td></tr>
<tr><td width="15%"><var>TARGET</var></td><td width="70%">(Optional) <var>TARGET</var> shall be a pointer or
a target.  It must have the same type, kind type parameter, and
array rank as <var>POINTER</var>.</td></tr>
</table>
<p>The association status of neither <var>POINTER</var> nor <var>TARGET</var> shall be
undefined.
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p><code>ASSOCIATED(POINTER)</code> returns a scalar value of type <code>LOGICAL(4)</code>.
There are several cases:
</p><dl compact="compact">
<dt>(A) When the optional <var>TARGET</var> is not present then</dt>
<dd><p><code>ASSOCIATED(POINTER)</code> is true if <var>POINTER</var> is associated with a target; otherwise, it returns false.
</p></dd>
<dt>(B) If <var>TARGET</var> is present and a scalar target, the result is true if</dt>
<dd><p><var>TARGET</var> is not a zero-sized storage sequence and the target associated with <var>POINTER</var> occupies the same storage units.  If <var>POINTER</var> is
disassociated, the result is false.
</p></dd>
<dt>(C) If <var>TARGET</var> is present and an array target, the result is true if</dt>
<dd><p><var>TARGET</var> and <var>POINTER</var> have the same shape, are not zero-sized arrays,
are arrays whose elements are not zero-sized storage sequences, and
<var>TARGET</var> and <var>POINTER</var> occupy the same storage units in array element
order.
As in case(B), the result is false, if <var>POINTER</var> is disassociated.
</p></dd>
<dt>(D) If <var>TARGET</var> is present and an scalar pointer, the result is true</dt>
<dd><p>if <var>TARGET</var> is associated with <var>POINTER</var>, the target associated with
<var>TARGET</var> are not zero-sized storage sequences and occupy the same storage
units.
The result is false, if either <var>TARGET</var> or <var>POINTER</var> is disassociated.
</p></dd>
<dt>(E) If <var>TARGET</var> is present and an array pointer, the result is true if</dt>
<dd><p>target associated with <var>POINTER</var> and the target associated with <var>TARGET</var>
have the same shape, are not zero-sized arrays, are arrays whose elements are
not zero-sized storage sequences, and <var>TARGET</var> and <var>POINTER</var> occupy
the same storage units in array element order.
The result is false, if either <var>TARGET</var> or <var>POINTER</var> is disassociated.
</p></dd>
</dl>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_associated
   implicit none
   real, target  :: tgt(2) = (/1., 2./)
   real, pointer :: ptr(:)
   ptr =&gt; tgt
   if (associated(ptr)     .eqv. .false.) call abort
   if (associated(ptr,tgt) .eqv. .false.) call abort
end program test_associated
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#NULL">NULL</a>
</p></dd>
</dl>



<hr>
<a name="ATAN"></a>
<div class="header">
<p>
Next: <a href="#ATAN2" accesskey="n" rel="next">ATAN2</a>, Previous: <a href="#ASSOCIATED" accesskey="p" rel="prev">ASSOCIATED</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ATAN-_002d_002d_002d-Arctangent-function"></a>
<h3 class="section">7.21 <code>ATAN</code> &mdash; Arctangent function</h3>
<a name="index-ATAN"></a>
<a name="index-DATAN"></a>
<a name="index-trigonometric-function_002c-tangent_002c-inverse"></a>
<a name="index-tangent_002c-inverse"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ATAN(X)</code> computes the arctangent of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ATAN(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and it lies in the
range <em>- \pi / 2 \leq \atan (x) \leq \pi / 2</em>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_atan
  real(8) :: x = 2.866_8
  x = atan(x)
end program test_atan
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DATAN(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Inverse function: <a href="#TAN">TAN</a>
</p>
</dd>
</dl>



<hr>
<a name="ATAN2"></a>
<div class="header">
<p>
Next: <a href="#ATANH" accesskey="n" rel="next">ATANH</a>, Previous: <a href="#ATAN" accesskey="p" rel="prev">ATAN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ATAN2-_002d_002d_002d-Arctangent-function"></a>
<h3 class="section">7.22 <code>ATAN2</code> &mdash; Arctangent function</h3>
<a name="index-ATAN2"></a>
<a name="index-DATAN2"></a>
<a name="index-trigonometric-function_002c-tangent_002c-inverse-1"></a>
<a name="index-tangent_002c-inverse-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ATAN2(Y, X)</code> computes the arctangent of the complex number
<em>X + i Y</em>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ATAN2(Y, X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>Y</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>X</var></td><td width="70%">The type and kind type parameter shall be the same as <var>Y</var>.
If <var>Y</var> is zero, then <var>X</var> must be nonzero.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value has the same type and kind type parameter as <var>Y</var>.
It is the principal value of the complex number <em>X + i Y</em>.  If
<var>X</var> is nonzero, then it lies in the range <em>-\pi \le \atan (x) \leq \pi</em>.
The sign is positive if <var>Y</var> is positive.  If <var>Y</var> is zero, then
the return value is zero if <var>X</var> is positive and <em>\pi</em> if <var>X</var>
is negative.  Finally, if <var>X</var> is zero, then the magnitude of the result
is <em>\pi/2</em>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_atan2
  real(4) :: x = 1.e0_4, y = 0.5e0_4
  x = atan2(y,x)
end program test_atan2
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DATAN2(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="ATANH"></a>
<div class="header">
<p>
Next: <a href="#BESSEL_005fJ0" accesskey="n" rel="next">BESSEL_J0</a>, Previous: <a href="#ATAN2" accesskey="p" rel="prev">ATAN2</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ATANH-_002d_002d_002d-Hyperbolic-arctangent-function"></a>
<h3 class="section">7.23 <code>ATANH</code> &mdash; Hyperbolic arctangent function</h3>
<a name="index-ASINH-1"></a>
<a name="index-DASINH-1"></a>
<a name="index-area-hyperbolic-tangent"></a>
<a name="index-hyperbolic-arctangent"></a>
<a name="index-hyperbolic-function_002c-tangent_002c-inverse"></a>
<a name="index-tangent_002c-hyperbolic_002c-inverse"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ATANH(X)</code> computes the hyperbolic arctangent of <var>X</var> (inverse
of <code>TANH(X)</code>).
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ATANH(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value has same type and kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_atanh
  REAL, DIMENSION(3) :: x = (/ -1.0, 0.0, 1.0 /)
  WRITE (*,*) ATANH(x)
END PROGRAM
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DATANH(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Inverse function: <a href="#TANH">TANH</a>
</p></dd>
</dl>



<hr>
<a name="BESSEL_005fJ0"></a>
<div class="header">
<p>
Next: <a href="#BESSEL_005fJ1" accesskey="n" rel="next">BESSEL_J1</a>, Previous: <a href="#ATANH" accesskey="p" rel="prev">ATANH</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BESSEL_005fJ0-_002d_002d_002d-Bessel-function-of-the-first-kind-of-order-0"></a>
<h3 class="section">7.24 <code>BESSEL_J0</code> &mdash; Bessel function of the first kind of order 0</h3>
<a name="index-BESSEL_005fJ0"></a>
<a name="index-BESJ0"></a>
<a name="index-DBESJ0"></a>
<a name="index-Bessel-function_002c-first-kind"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>BESSEL_J0(X)</code> computes the Bessel function of the first kind of
order 0 of <var>X</var>. This function is available under the name
<code>BESJ0</code> as a GNU extension.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = BESSEL_J0(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>, and it shall be scalar.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and lies in the
range <em>- 0.4027... \leq Bessel (0,x) \leq 1</em>. It has the same
kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_besj0
  real(8) :: x = 0.0_8
  x = bessel_j0(x)
end program test_besj0
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DBESJ0(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="BESSEL_005fJ1"></a>
<div class="header">
<p>
Next: <a href="#BESSEL_005fJN" accesskey="n" rel="next">BESSEL_JN</a>, Previous: <a href="#BESSEL_005fJ0" accesskey="p" rel="prev">BESSEL_J0</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BESSEL_005fJ1-_002d_002d_002d-Bessel-function-of-the-first-kind-of-order-1"></a>
<h3 class="section">7.25 <code>BESSEL_J1</code> &mdash; Bessel function of the first kind of order 1</h3>
<a name="index-BESSEL_005fJ1"></a>
<a name="index-BESJ1"></a>
<a name="index-DBESJ1"></a>
<a name="index-Bessel-function_002c-first-kind-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>BESSEL_J1(X)</code> computes the Bessel function of the first kind of
order 1 of <var>X</var>. This function is available under the name
<code>BESJ1</code> as a GNU extension.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = BESSEL_J1(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>, and it shall be scalar.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and it lies in the
range <em>- 0.5818... \leq Bessel (0,x) \leq 0.5818 </em>. It has the same
kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_besj1
  real(8) :: x = 1.0_8
  x = bessel_j1(x)
end program test_besj1
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DBESJ1(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="BESSEL_005fJN"></a>
<div class="header">
<p>
Next: <a href="#BESSEL_005fY0" accesskey="n" rel="next">BESSEL_Y0</a>, Previous: <a href="#BESSEL_005fJ1" accesskey="p" rel="prev">BESSEL_J1</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BESSEL_005fJN-_002d_002d_002d-Bessel-function-of-the-first-kind"></a>
<h3 class="section">7.26 <code>BESSEL_JN</code> &mdash; Bessel function of the first kind</h3>
<a name="index-BESSEL_005fJN"></a>
<a name="index-BESJN"></a>
<a name="index-DBESJN"></a>
<a name="index-Bessel-function_002c-first-kind-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>BESSEL_JN(N, X)</code> computes the Bessel function of the first kind of
order <var>N</var> of <var>X</var>. This function is available under the name
<code>BESJN</code> as a GNU extension.
</p>
<p>If both arguments are arrays, their ranks and shapes shall conform.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = BESSEL_JN(N, X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>N</var></td><td width="70%">Shall be a scalar or an array of type  <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be a scalar or an array of type  <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>REAL</code>. It has the same
kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_besjn
  real(8) :: x = 1.0_8
  x = bessel_jn(5,x)
end program test_besjn
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DBESJN(X)</code></td><td width="20%"><code>INTEGER N</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
<tr><td width="20%"></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"></td><td width="25%"></td></tr>
</table>
</dd>
</dl>



<hr>
<a name="BESSEL_005fY0"></a>
<div class="header">
<p>
Next: <a href="#BESSEL_005fY1" accesskey="n" rel="next">BESSEL_Y1</a>, Previous: <a href="#BESSEL_005fJN" accesskey="p" rel="prev">BESSEL_JN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BESSEL_005fY0-_002d_002d_002d-Bessel-function-of-the-second-kind-of-order-0"></a>
<h3 class="section">7.27 <code>BESSEL_Y0</code> &mdash; Bessel function of the second kind of order 0</h3>
<a name="index-BESSEL_005fY0"></a>
<a name="index-BESY0"></a>
<a name="index-DBESY0"></a>
<a name="index-Bessel-function_002c-second-kind"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>BESSEL_Y0(X)</code> computes the Bessel function of the second kind of
order 0 of <var>X</var>. This function is available under the name
<code>BESY0</code> as a GNU extension.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = BESSEL_Y0(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>, and it shall be scalar.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>REAL</code>. It has the same
kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_besy0
  real(8) :: x = 0.0_8
  x = bessel_y0(x)
end program test_besy0
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DBESY0(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="BESSEL_005fY1"></a>
<div class="header">
<p>
Next: <a href="#BESSEL_005fYN" accesskey="n" rel="next">BESSEL_YN</a>, Previous: <a href="#BESSEL_005fY0" accesskey="p" rel="prev">BESSEL_Y0</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BESSEL_005fY1-_002d_002d_002d-Bessel-function-of-the-second-kind-of-order-1"></a>
<h3 class="section">7.28 <code>BESSEL_Y1</code> &mdash; Bessel function of the second kind of order 1</h3>
<a name="index-BESSEL_005fY1"></a>
<a name="index-BESY1"></a>
<a name="index-DBESY1"></a>
<a name="index-Bessel-function_002c-second-kind-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>BESSEL_Y1(X)</code> computes the Bessel function of the second kind of
order 1 of <var>X</var>. This function is available under the name
<code>BESY1</code> as a GNU extension.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = BESSEL_Y1(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>, and it shall be scalar.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>REAL</code>. It has the same
kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_besy1
  real(8) :: x = 1.0_8
  x = bessel_y1(x)
end program test_besy1
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DBESY1(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="BESSEL_005fYN"></a>
<div class="header">
<p>
Next: <a href="#BIT_005fSIZE" accesskey="n" rel="next">BIT_SIZE</a>, Previous: <a href="#BESSEL_005fY1" accesskey="p" rel="prev">BESSEL_Y1</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BESSEL_005fYN-_002d_002d_002d-Bessel-function-of-the-second-kind"></a>
<h3 class="section">7.29 <code>BESSEL_YN</code> &mdash; Bessel function of the second kind</h3>
<a name="index-BESSEL_005fYN"></a>
<a name="index-BESYN"></a>
<a name="index-DBESYN"></a>
<a name="index-Bessel-function_002c-second-kind-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>BESSEL_YN(N, X)</code> computes the Bessel function of the second kind of
order <var>N</var> of <var>X</var>. This function is available under the name
<code>BESYN</code> as a GNU extension.
</p>
<p>If both arguments are arrays, their ranks and shapes shall conform.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = BESSEL_YN(N, X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>N</var></td><td width="70%">Shall be a scalar or an array of type  <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be a scalar or an array of type  <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>REAL</code>. It has the same
kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_besyn
  real(8) :: x = 1.0_8
  x = bessel_yn(5,x)
end program test_besyn
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DBESYN(N,X)</code></td><td width="20%"><code>INTEGER N</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
<tr><td width="20%"></td><td width="20%"><code>REAL(8)    X</code></td><td width="20%"></td><td width="25%"></td></tr>
</table>
</dd>
</dl>



<hr>
<a name="BIT_005fSIZE"></a>
<div class="header">
<p>
Next: <a href="#BTEST" accesskey="n" rel="next">BTEST</a>, Previous: <a href="#BESSEL_005fYN" accesskey="p" rel="prev">BESSEL_YN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BIT_005fSIZE-_002d_002d_002d-Bit-size-inquiry-function"></a>
<h3 class="section">7.30 <code>BIT_SIZE</code> &mdash; Bit size inquiry function</h3>
<a name="index-BIT_005fSIZE"></a>
<a name="index-bits_002c-number-of"></a>
<a name="index-size-of-a-variable_002c-in-bits"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>BIT_SIZE(I)</code> returns the number of bits (integer precision plus sign bit)
represented by the type of <var>I</var>.  The result of <code>BIT_SIZE(I)</code> is
independent of the actual value of <var>I</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = BIT_SIZE(I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_bit_size
    integer :: i = 123
    integer :: size
    size = bit_size(i)
    print *, size
end program test_bit_size
</pre></div>
</dd>
</dl>



<hr>
<a name="BTEST"></a>
<div class="header">
<p>
Next: <a href="#C_005fASSOCIATED" accesskey="n" rel="next">C_ASSOCIATED</a>, Previous: <a href="#BIT_005fSIZE" accesskey="p" rel="prev">BIT_SIZE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="BTEST-_002d_002d_002d-Bit-test-function"></a>
<h3 class="section">7.31 <code>BTEST</code> &mdash; Bit test function</h3>
<a name="index-BTEST"></a>
<a name="index-bits_002c-testing"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>BTEST(I,POS)</code> returns logical <code>.TRUE.</code> if the bit at <var>POS</var>
in <var>I</var> is set.  The counting of the bits starts at 0.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = BTEST(I, POS)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>POS</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>LOGICAL</code>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_btest
    integer :: i = 32768 + 1024 + 64
    integer :: pos
    logical :: bool
    do pos=0,16
        bool = btest(i, pos) 
        print *, pos, bool
    end do
end program test_btest
</pre></div>
</dd>
</dl>


<hr>
<a name="C_005fASSOCIATED"></a>
<div class="header">
<p>
Next: <a href="#C_005fFUNLOC" accesskey="n" rel="next">C_FUNLOC</a>, Previous: <a href="#BTEST" accesskey="p" rel="prev">BTEST</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="C_005fASSOCIATED-_002d_002d_002d-Status-of-a-C-pointer"></a>
<h3 class="section">7.32 <code>C_ASSOCIATED</code> &mdash; Status of a C pointer</h3>
<a name="index-C_005fASSOCIATED"></a>
<a name="index-association-status_002c-C-pointer"></a>
<a name="index-pointer_002c-C-association-status"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>C_ASSOCIATED(c_prt_1[, c_ptr_2])</code> determines the status of the C pointer
<var>c_ptr_1</var> or if <var>c_ptr_1</var> is associated with the target <var>c_ptr_2</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = C_ASSOCIATED(c_prt_1[, c_ptr_2])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>c_ptr_1</var></td><td width="70%">Scalar of the type <code>C_PTR</code> or <code>C_FUNPTR</code>.</td></tr>
<tr><td width="15%"><var>c_ptr_2</var></td><td width="70%">(Optional) Scalar of the same type as <var>c_ptr_1</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>LOGICAL</code>; it is <code>.false.</code> if either
<var>c_ptr_1</var> is a C NULL pointer or if <var>c_ptr1</var> and <var>c_ptr_2</var>
point to different addresses.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">subroutine association_test(a,b)
  use iso_c_binding, only: c_associated, c_loc, c_ptr
  implicit none
  real, pointer :: a
  type(c_ptr) :: b
  if(c_associated(b, c_loc(a))) &amp;
     stop 'b and a do not point to same target'
end subroutine association_test
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#C_005fLOC">C_LOC</a>, <a href="#C_005fFUNLOC">C_FUNLOC</a>
</p></dd>
</dl>


<hr>
<a name="C_005fFUNLOC"></a>
<div class="header">
<p>
Next: <a href="#C_005fF_005fPROCPOINTER" accesskey="n" rel="next">C_F_PROCPOINTER</a>, Previous: <a href="#C_005fASSOCIATED" accesskey="p" rel="prev">C_ASSOCIATED</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="C_005fFUNLOC-_002d_002d_002d-Obtain-the-C-address-of-a-procedure"></a>
<h3 class="section">7.33 <code>C_FUNLOC</code> &mdash; Obtain the C address of a procedure</h3>
<a name="index-C_005fFUNLOC"></a>
<a name="index-pointer_002c-C-address-of-procedures"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>C_FUNLOC(x)</code> determines the C address of the argument.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = C_FUNLOC(x)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>x</var></td><td width="70%">Interoperable function or pointer to such function.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>C_FUNPTR</code> and contains the C address
of the argument.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">module x
  use iso_c_binding
  implicit none
contains
  subroutine sub(a) bind(c)
    real(c_float) :: a
    a = sqrt(a)+5.0
  end subroutine sub
end module x
program main
  use iso_c_binding
  use x
  implicit none
  interface
    subroutine my_routine(p) bind(c,name='myC_func')
      import :: c_funptr
      type(c_funptr), intent(in) :: p
    end subroutine
  end interface
  call my_routine(c_funloc(sub))
end program main
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#C_005fASSOCIATED">C_ASSOCIATED</a>, <a href="#C_005fLOC">C_LOC</a>, <a href="#C_005fF_005fPOINTER">C_F_POINTER</a>, <a href="#C_005fF_005fPROCPOINTER">C_F_PROCPOINTER</a>
</p></dd>
</dl>


<hr>
<a name="C_005fF_005fPROCPOINTER"></a>
<div class="header">
<p>
Next: <a href="#C_005fF_005fPOINTER" accesskey="n" rel="next">C_F_POINTER</a>, Previous: <a href="#C_005fFUNLOC" accesskey="p" rel="prev">C_FUNLOC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="C_005fF_005fPROCPOINTER-_002d_002d_002d-Convert-C-into-Fortran-procedure-pointer"></a>
<h3 class="section">7.34 <code>C_F_PROCPOINTER</code> &mdash; Convert C into Fortran procedure pointer</h3>
<a name="index-C_005fF_005fPROCPOINTER"></a>
<a name="index-pointer_002c-C-address-of-pointers"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>C_F_PROCPOINTER(CPTR, FPTR)</code> Assign the target of the C function pointer
<var>CPTR</var> to the Fortran procedure pointer <var>FPTR</var>.
</p>
<p>Note: Due to the currently lacking support of procedure pointers in GNU Fortran
this function is not fully operable.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL C_F_PROCPOINTER(cptr, fptr)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>CPTR</var></td><td width="70%">scalar of the type <code>C_FUNPTR</code>. It is
<code>INTENT(IN)</code>.</td></tr>
<tr><td width="15%"><var>FPTR</var></td><td width="70%">procedure pointer interoperable with <var>cptr</var>. It is
<code>INTENT(OUT)</code>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program main
  use iso_c_binding
  implicit none
  abstract interface
    function func(a)
      import :: c_float
      real(c_float), intent(in) :: a
      real(c_float) :: func
    end function
  end interface
  interface
     function getIterFunc() bind(c,name=&quot;getIterFunc&quot;)
       import :: c_funptr
       type(c_funptr) :: getIterFunc
     end function
  end interface
  type(c_funptr) :: cfunptr
  procedure(func), pointer :: myFunc
  cfunptr = getIterFunc()
  call c_f_procpointer(cfunptr, myFunc)
end program main
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#C_005fLOC">C_LOC</a>, <a href="#C_005fF_005fPOINTER">C_F_POINTER</a>
</p></dd>
</dl>


<hr>
<a name="C_005fF_005fPOINTER"></a>
<div class="header">
<p>
Next: <a href="#C_005fLOC" accesskey="n" rel="next">C_LOC</a>, Previous: <a href="#C_005fF_005fPROCPOINTER" accesskey="p" rel="prev">C_F_PROCPOINTER</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="C_005fF_005fPOINTER-_002d_002d_002d-Convert-C-into-Fortran-pointer"></a>
<h3 class="section">7.35 <code>C_F_POINTER</code> &mdash; Convert C into Fortran pointer</h3>
<a name="index-C_005fF_005fPOINTER"></a>
<a name="index-pointer_002c-convert-C-to-Fortran"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>C_F_POINTER(CPTR, FPTR[, SHAPE])</code> Assign the target the C pointer
<var>CPTR</var> to the Fortran pointer <var>FPTR</var> and specify its
shape.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL C_F_POINTER(CPTR, FPTR[, SHAPE])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>CPTR</var></td><td width="70%">scalar of the type <code>C_PTR</code>. It is
<code>INTENT(IN)</code>.</td></tr>
<tr><td width="15%"><var>FPTR</var></td><td width="70%">pointer interoperable with <var>cptr</var>. It is
<code>INTENT(OUT)</code>.</td></tr>
<tr><td width="15%"><var>SHAPE</var></td><td width="70%">(Optional) Rank-one array of type <code>INTEGER</code>
with <code>INTENT(IN)</code>. It shall be present
if and only if <var>fptr</var> is an array. The size
must be equal to the rank of <var>fptr</var>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program main
  use iso_c_binding
  implicit none
  interface
    subroutine my_routine(p) bind(c,name='myC_func')
      import :: c_ptr
      type(c_ptr), intent(out) :: p
    end subroutine
  end interface
  type(c_ptr) :: cptr
  real,pointer :: a(:)
  call my_routine(cptr)
  call c_f_pointer(cptr, a, [12])
end program main
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#C_005fLOC">C_LOC</a>, <a href="#C_005fF_005fPROCPOINTER">C_F_PROCPOINTER</a>
</p></dd>
</dl>


<hr>
<a name="C_005fLOC"></a>
<div class="header">
<p>
Next: <a href="#C_005fSIZEOF" accesskey="n" rel="next">C_SIZEOF</a>, Previous: <a href="#C_005fF_005fPOINTER" accesskey="p" rel="prev">C_F_POINTER</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="C_005fLOC-_002d_002d_002d-Obtain-the-C-address-of-an-object"></a>
<h3 class="section">7.36 <code>C_LOC</code> &mdash; Obtain the C address of an object</h3>
<a name="index-C_005fLOC"></a>
<a name="index-procedure-pointer_002c-convert-C-to-Fortran"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>C_LOC(X)</code> determines the C address of the argument.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = C_LOC(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Associated scalar pointer or interoperable scalar
or allocated allocatable variable with <code>TARGET</code> attribute.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>C_PTR</code> and contains the C address
of the argument.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">subroutine association_test(a,b)
  use iso_c_binding, only: c_associated, c_loc, c_ptr
  implicit none
  real, pointer :: a
  type(c_ptr) :: b
  if(c_associated(b, c_loc(a))) &amp;
     stop 'b and a do not point to same target'
end subroutine association_test
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#C_005fASSOCIATED">C_ASSOCIATED</a>, <a href="#C_005fFUNLOC">C_FUNLOC</a>, <a href="#C_005fF_005fPOINTER">C_F_POINTER</a>, <a href="#C_005fF_005fPROCPOINTER">C_F_PROCPOINTER</a>
</p></dd>
</dl>


<hr>
<a name="C_005fSIZEOF"></a>
<div class="header">
<p>
Next: <a href="#CEILING" accesskey="n" rel="next">CEILING</a>, Previous: <a href="#C_005fLOC" accesskey="p" rel="prev">C_LOC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="C_005fSIZEOF-_002d_002d_002d-Size-in-bytes-of-an-expression"></a>
<h3 class="section">7.37 <code>C_SIZEOF</code> &mdash; Size in bytes of an expression</h3>
<a name="index-C_005fSIZEOF"></a>
<a name="index-expression-size"></a>
<a name="index-size-of-an-expression"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>C_SIZEOF(X)</code> calculates the number of bytes of storage the
expression <code>X</code> occupies.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Intrinsic function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>N = C_SIZEOF(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The argument shall be of any type, rank or shape.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type integer and of the system-dependent kind
<var>C_SIZE_T</var> (from the <var>ISO_C_BINDING</var> module). Its value is the
number of bytes occupied by the argument.  If the argument has the
<code>POINTER</code> attribute, the number of bytes of the storage area pointed
to is returned.  If the argument is of a derived type with <code>POINTER</code>
or <code>ALLOCATABLE</code> components, the return value doesn&rsquo;t account for
the sizes of the data pointed to by these components.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">   use iso_c_binding
   integer(c_int) :: i
   real(c_float) :: r, s(5)
   print *, (c_sizeof(s)/c_sizeof(r) == 5)
   end
</pre></div>
<p>The example will print <code>.TRUE.</code> unless you are using a platform
where default <code>REAL</code> variables are unusually padded.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SIZEOF">SIZEOF</a>
</p></dd>
</dl>


<hr>
<a name="CEILING"></a>
<div class="header">
<p>
Next: <a href="#CHAR" accesskey="n" rel="next">CHAR</a>, Previous: <a href="#C_005fSIZEOF" accesskey="p" rel="prev">C_SIZEOF</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CEILING-_002d_002d_002d-Integer-ceiling-function"></a>
<h3 class="section">7.38 <code>CEILING</code> &mdash; Integer ceiling function</h3>
<a name="index-CEILING"></a>
<a name="index-ceiling-1"></a>
<a name="index-rounding_002c-ceiling-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>CEILING(A)</code> returns the least integer greater than or equal to <var>A</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = CEILING(A [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER(KIND)</code> if <var>KIND</var> is present
and a default-kind <code>INTEGER</code> otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_ceiling
    real :: x = 63.29
    real :: y = -63.59
    print *, ceiling(x) ! returns 64
    print *, ceiling(y) ! returns -63
end program test_ceiling
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#FLOOR">FLOOR</a>, <a href="#NINT">NINT</a>
</p>
</dd>
</dl>



<hr>
<a name="CHAR"></a>
<div class="header">
<p>
Next: <a href="#CHDIR" accesskey="n" rel="next">CHDIR</a>, Previous: <a href="#CEILING" accesskey="p" rel="prev">CEILING</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CHAR-_002d_002d_002d-Character-conversion-function"></a>
<h3 class="section">7.39 <code>CHAR</code> &mdash; Character conversion function</h3>
<a name="index-CHAR"></a>
<a name="index-conversion_002c-to-character"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>CHAR(I [, KIND])</code> returns the character represented by the integer <var>I</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = CHAR(I [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>CHARACTER(1)</code>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_char
    integer :: i = 74
    character(1) :: c
    c = char(i)
    print *, i, c ! returns 'J'
end program test_char
</pre></div>

</dd>
<dt><em>Note</em>:</dt>
<dd><p>See <a href="#ICHAR">ICHAR</a> for a discussion of converting between numerical values
and formatted string representations.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ACHAR">ACHAR</a>, <a href="#IACHAR">IACHAR</a>, <a href="#ICHAR">ICHAR</a>
</p>
</dd>
</dl>



<hr>
<a name="CHDIR"></a>
<div class="header">
<p>
Next: <a href="#CHMOD" accesskey="n" rel="next">CHMOD</a>, Previous: <a href="#CHAR" accesskey="p" rel="prev">CHAR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CHDIR-_002d_002d_002d-Change-working-directory"></a>
<h3 class="section">7.40 <code>CHDIR</code> &mdash; Change working directory</h3>
<a name="index-CHDIR"></a>
<a name="index-system_002c-working-directory"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Change current working directory to a specified path.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL CHDIR(NAME [, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = CHDIR(NAME)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>NAME</var></td><td width="70%">The type shall be <code>CHARACTER</code> of default
kind and shall specify a valid path within the file system.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) <code>INTEGER</code> status flag of the default
kind.  Returns 0 on success, and a system specific and nonzero error code
otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_chdir
  CHARACTER(len=255) :: path
  CALL getcwd(path)
  WRITE(*,*) TRIM(path)
  CALL chdir(&quot;/tmp&quot;)
  CALL getcwd(path)
  WRITE(*,*) TRIM(path)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GETCWD">GETCWD</a>
</p></dd>
</dl>



<hr>
<a name="CHMOD"></a>
<div class="header">
<p>
Next: <a href="#CMPLX" accesskey="n" rel="next">CMPLX</a>, Previous: <a href="#CHDIR" accesskey="p" rel="prev">CHDIR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CHMOD-_002d_002d_002d-Change-access-permissions-of-files"></a>
<h3 class="section">7.41 <code>CHMOD</code> &mdash; Change access permissions of files</h3>
<a name="index-CHMOD"></a>
<a name="index-file-system_002c-change-access-mode"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>CHMOD</code> changes the permissions of a file. This function invokes
<code>/bin/chmod</code> and might therefore not work on all platforms.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL CHMOD(NAME, MODE[, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = CHMOD(NAME, MODE)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>NAME</var></td><td width="70%">Scalar <code>CHARACTER</code> of default kind with the
file name. Trailing blanks are ignored unless the character
<code>achar(0)</code> is present, then all characters up to and excluding
<code>achar(0)</code> are used as the file name.</td></tr>
<tr><td width="15%"><var>MODE</var></td><td width="70%">Scalar <code>CHARACTER</code> of default kind giving the
file permission. <var>MODE</var> uses the same syntax as the <var>MODE</var>
argument of <code>/bin/chmod</code>.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(optional) scalar <code>INTEGER</code>, which is
<code>0</code> on success and nonzero otherwise.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>In either syntax, <var>STATUS</var> is set to <code>0</code> on success and nonzero
otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p><code>CHMOD</code> as subroutine
</p><div class="smallexample">
<pre class="smallexample">program chmod_test
  implicit none
  integer :: status
  call chmod('test.dat','u+x',status)
  print *, 'Status: ', status
end program chmod_test
</pre></div>
<p><code>CHMOD</code> as function:
</p><div class="smallexample">
<pre class="smallexample">program chmod_test
  implicit none
  integer :: status
  status = chmod('test.dat','u+x')
  print *, 'Status: ', status
end program chmod_test
</pre></div>

</dd>
</dl>



<hr>
<a name="CMPLX"></a>
<div class="header">
<p>
Next: <a href="#COMMAND_005fARGUMENT_005fCOUNT" accesskey="n" rel="next">COMMAND_ARGUMENT_COUNT</a>, Previous: <a href="#CHMOD" accesskey="p" rel="prev">CHMOD</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CMPLX-_002d_002d_002d-Complex-conversion-function"></a>
<h3 class="section">7.42 <code>CMPLX</code> &mdash; Complex conversion function</h3>
<a name="index-CMPLX"></a>
<a name="index-complex-numbers_002c-conversion-to"></a>
<a name="index-conversion_002c-to-complex"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>CMPLX(X [, Y [, KIND]])</code> returns a complex number where <var>X</var> is converted to
the real component.  If <var>Y</var> is present it is converted to the imaginary
component.  If <var>Y</var> is not present then the imaginary component is set to
0.0.  If <var>X</var> is complex then <var>Y</var> must not be present.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = CMPLX(X [, Y [, KIND]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type may be <code>INTEGER</code>, <code>REAL</code>,
or <code>COMPLEX</code>.</td></tr>
<tr><td width="15%"><var>Y</var></td><td width="70%">(Optional; only allowed if <var>X</var> is not
<code>COMPLEX</code>.)  May be <code>INTEGER</code> or <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of <code>COMPLEX</code> type, with a kind equal to
<var>KIND</var> if it is specified.  If <var>KIND</var> is not specified, the
result is of the default <code>COMPLEX</code> kind, regardless of the kinds of
<var>X</var> and <var>Y</var>. 
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_cmplx
    integer :: i = 42
    real :: x = 3.14
    complex :: z
    z = cmplx(i, x)
    print *, z, cmplx(x)
end program test_cmplx
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#COMPLEX">COMPLEX</a>
</p></dd>
</dl>



<hr>
<a name="COMMAND_005fARGUMENT_005fCOUNT"></a>
<div class="header">
<p>
Next: <a href="#COMPLEX" accesskey="n" rel="next">COMPLEX</a>, Previous: <a href="#CMPLX" accesskey="p" rel="prev">CMPLX</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="COMMAND_005fARGUMENT_005fCOUNT-_002d_002d_002d-Get-number-of-command-line-arguments"></a>
<h3 class="section">7.43 <code>COMMAND_ARGUMENT_COUNT</code> &mdash; Get number of command line arguments</h3>
<a name="index-COMMAND_005fARGUMENT_005fCOUNT"></a>
<a name="index-command_002dline-arguments"></a>
<a name="index-command_002dline-arguments_002c-number-of"></a>
<a name="index-arguments_002c-to-program"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>COMMAND_ARGUMENT_COUNT()</code> returns the number of arguments passed on the
command line when the containing program was invoked.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = COMMAND_ARGUMENT_COUNT()</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%">None</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER(4)</code>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_command_argument_count
    integer :: count
    count = command_argument_count()
    print *, count
end program test_command_argument_count
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GET_005fCOMMAND">GET_COMMAND</a>, <a href="#GET_005fCOMMAND_005fARGUMENT">GET_COMMAND_ARGUMENT</a>
</p></dd>
</dl>



<hr>
<a name="COMPLEX"></a>
<div class="header">
<p>
Next: <a href="#CONJG" accesskey="n" rel="next">CONJG</a>, Previous: <a href="#COMMAND_005fARGUMENT_005fCOUNT" accesskey="p" rel="prev">COMMAND_ARGUMENT_COUNT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="COMPLEX-_002d_002d_002d-Complex-conversion-function"></a>
<h3 class="section">7.44 <code>COMPLEX</code> &mdash; Complex conversion function</h3>
<a name="index-COMPLEX"></a>
<a name="index-complex-numbers_002c-conversion-to-1"></a>
<a name="index-conversion_002c-to-complex-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>COMPLEX(X, Y)</code> returns a complex number where <var>X</var> is converted
to the real component and <var>Y</var> is converted to the imaginary
component.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = COMPLEX(X, Y)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type may be <code>INTEGER</code> or <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>Y</var></td><td width="70%">The type may be <code>INTEGER</code> or <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>If <var>X</var> and <var>Y</var> are both of <code>INTEGER</code> type, then the return
value is of default <code>COMPLEX</code> type.
</p>
<p>If <var>X</var> and <var>Y</var> are of <code>REAL</code> type, or one is of <code>REAL</code>
type and one is of <code>INTEGER</code> type, then the return value is of
<code>COMPLEX</code> type with a kind equal to that of the <code>REAL</code>
argument with the highest precision.  
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_complex
    integer :: i = 42
    real :: x = 3.14
    print *, complex(i, x)
end program test_complex
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CMPLX">CMPLX</a>
</p></dd>
</dl>



<hr>
<a name="CONJG"></a>
<div class="header">
<p>
Next: <a href="#COS" accesskey="n" rel="next">COS</a>, Previous: <a href="#COMPLEX" accesskey="p" rel="prev">COMPLEX</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CONJG-_002d_002d_002d-Complex-conjugate-function"></a>
<h3 class="section">7.45 <code>CONJG</code> &mdash; Complex conjugate function</h3>
<a name="index-CONJG"></a>
<a name="index-DCONJG"></a>
<a name="index-complex-conjugate"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>CONJG(Z)</code> returns the conjugate of <var>Z</var>.  If <var>Z</var> is <code>(x, y)</code>
then the result is <code>(x, -y)</code>
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, has overloads that are GNU extensions
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>Z = CONJG(Z)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>Z</var></td><td width="70%">The type shall be <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>COMPLEX</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_conjg
    complex :: z = (2.0, 3.0)
    complex(8) :: dz = (2.71_8, -3.14_8)
    z= conjg(z)
    print *, z
    dz = dconjg(dz)
    print *, dz
end program test_conjg
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DCONJG(Z)</code></td><td width="20%"><code>COMPLEX(8) Z</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="COS"></a>
<div class="header">
<p>
Next: <a href="#COSH" accesskey="n" rel="next">COSH</a>, Previous: <a href="#CONJG" accesskey="p" rel="prev">CONJG</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="COS-_002d_002d_002d-Cosine-function"></a>
<h3 class="section">7.46 <code>COS</code> &mdash; Cosine function</h3>
<a name="index-COS"></a>
<a name="index-DCOS"></a>
<a name="index-CCOS"></a>
<a name="index-ZCOS"></a>
<a name="index-CDCOS"></a>
<a name="index-trigonometric-function_002c-cosine"></a>
<a name="index-cosine"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>COS(X)</code> computes the cosine of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, has overloads that are GNU extensions
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = COS(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> or
<code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and it lies in the
range <em>-1 \leq \cos (x) \leq 1</em>.  The kind type
parameter is the same as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_cos
  real :: x = 0.0
  x = cos(x)
end program test_cos
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DCOS(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>CCOS(X)</code></td><td width="20%"><code>COMPLEX(4) X</code></td><td width="20%"><code>COMPLEX(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>ZCOS(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
<tr><td width="20%"><code>CDCOS(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Inverse function: <a href="#ACOS">ACOS</a>
</p>
</dd>
</dl>



<hr>
<a name="COSH"></a>
<div class="header">
<p>
Next: <a href="#COUNT" accesskey="n" rel="next">COUNT</a>, Previous: <a href="#COS" accesskey="p" rel="prev">COS</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="COSH-_002d_002d_002d-Hyperbolic-cosine-function"></a>
<h3 class="section">7.47 <code>COSH</code> &mdash; Hyperbolic cosine function</h3>
<a name="index-COSH"></a>
<a name="index-DCOSH"></a>
<a name="index-hyperbolic-cosine"></a>
<a name="index-hyperbolic-function_002c-cosine"></a>
<a name="index-cosine_002c-hyperbolic"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>COSH(X)</code> computes the hyperbolic cosine of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>X = COSH(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and it is positive
(<em>\cosh (x) \geq 0 </em>).  For a <code>REAL</code> argument <var>X</var>,
<em>\cosh (x) \geq 1 </em>.
The return value is of the same kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_cosh
  real(8) :: x = 1.0_8
  x = cosh(x)
end program test_cosh
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DCOSH(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Inverse function: <a href="#ACOSH">ACOSH</a>
</p>
</dd>
</dl>



<hr>
<a name="COUNT"></a>
<div class="header">
<p>
Next: <a href="#CPU_005fTIME" accesskey="n" rel="next">CPU_TIME</a>, Previous: <a href="#COSH" accesskey="p" rel="prev">COSH</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="COUNT-_002d_002d_002d-Count-function"></a>
<h3 class="section">7.48 <code>COUNT</code> &mdash; Count function</h3>
<a name="index-COUNT"></a>
<a name="index-array_002c-conditionally-count-elements"></a>
<a name="index-array_002c-element-counting"></a>
<a name="index-array_002c-number-of-elements"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd>
<p><code>COUNT(MASK [, DIM [, KIND]])</code> counts the number of <code>.TRUE.</code>
elements of <var>MASK</var> along the dimension of <var>DIM</var>.  If <var>DIM</var> is
omitted it is taken to be <code>1</code>.  <var>DIM</var> is a scalar of type
<code>INTEGER</code> in the range of <em>1 /leq DIM /leq n)</em> where <em>n</em>
is the rank of <var>MASK</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = COUNT(MASK [, DIM [, KIND]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>MASK</var></td><td width="70%">The type shall be <code>LOGICAL</code>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
The result has a rank equal to that of <var>MASK</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_count
    integer, dimension(2,3) :: a, b
    logical, dimension(2,3) :: mask
    a = reshape( (/ 1, 2, 3, 4, 5, 6 /), (/ 2, 3 /))
    b = reshape( (/ 0, 7, 3, 4, 5, 8 /), (/ 2, 3 /))
    print '(3i3)', a(1,:)
    print '(3i3)', a(2,:)
    print *
    print '(3i3)', b(1,:)
    print '(3i3)', b(2,:)
    print *
    mask = a.ne.b
    print '(3l3)', mask(1,:)
    print '(3l3)', mask(2,:)
    print *
    print '(3i3)', count(mask)
    print *
    print '(3i3)', count(mask, 1)
    print *
    print '(3i3)', count(mask, 2)
end program test_count
</pre></div>
</dd>
</dl>



<hr>
<a name="CPU_005fTIME"></a>
<div class="header">
<p>
Next: <a href="#CSHIFT" accesskey="n" rel="next">CSHIFT</a>, Previous: <a href="#COUNT" accesskey="p" rel="prev">COUNT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CPU_005fTIME-_002d_002d_002d-CPU-elapsed-time-in-seconds"></a>
<h3 class="section">7.49 <code>CPU_TIME</code> &mdash; CPU elapsed time in seconds</h3>
<a name="index-CPU_005fTIME"></a>
<a name="index-time_002c-elapsed"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns a <code>REAL</code> value representing the elapsed CPU time in
seconds.  This is useful for testing segments of code to determine
execution time.
</p>
<p>If a time source is available, time will be reported with microsecond
resolution. If no time source is available, <var>TIME</var> is set to
<code>-1.0</code>.
</p>
<p>Note that <var>TIME</var> may contain a, system dependent, arbitrary offset
and may not start with <code>0.0</code>. For <code>CPU_TIME</code>, the absolute
value is meaningless, only differences between subsequent calls to
this subroutine, as shown in the example below, should be used.
</p>

</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL CPU_TIME(TIME)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>TIME</var></td><td width="70%">The type shall be <code>REAL</code> with <code>INTENT(OUT)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>None
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_cpu_time
    real :: start, finish
    call cpu_time(start)
        ! put code to test here
    call cpu_time(finish)
    print '(&quot;Time = &quot;,f6.3,&quot; seconds.&quot;)',finish-start
end program test_cpu_time
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SYSTEM_005fCLOCK">SYSTEM_CLOCK</a>, <a href="#DATE_005fAND_005fTIME">DATE_AND_TIME</a>
</p></dd>
</dl>



<hr>
<a name="CSHIFT"></a>
<div class="header">
<p>
Next: <a href="#CTIME" accesskey="n" rel="next">CTIME</a>, Previous: <a href="#CPU_005fTIME" accesskey="p" rel="prev">CPU_TIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CSHIFT-_002d_002d_002d-Circular-shift-elements-of-an-array"></a>
<h3 class="section">7.50 <code>CSHIFT</code> &mdash; Circular shift elements of an array</h3>
<a name="index-CSHIFT"></a>
<a name="index-array_002c-shift-circularly"></a>
<a name="index-array_002c-permutation"></a>
<a name="index-array_002c-rotate"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>CSHIFT(ARRAY, SHIFT [, DIM])</code> performs a circular shift on elements of
<var>ARRAY</var> along the dimension of <var>DIM</var>.  If <var>DIM</var> is omitted it is
taken to be <code>1</code>.  <var>DIM</var> is a scalar of type <code>INTEGER</code> in the
range of <em>1 /leq DIM /leq n)</em> where <em>n</em> is the rank of <var>ARRAY</var>.
If the rank of <var>ARRAY</var> is one, then all elements of <var>ARRAY</var> are shifted
by <var>SHIFT</var> places.  If rank is greater than one, then all complete rank one
sections of <var>ARRAY</var> along the given dimension are shifted.  Elements
shifted out one end of each rank one section are shifted back in the other end.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = CSHIFT(ARRAY, SHIFT [, DIM])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of any type.</td></tr>
<tr><td width="15%"><var>SHIFT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns an array of same type and rank as the <var>ARRAY</var> argument.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_cshift
    integer, dimension(3,3) :: a
    a = reshape( (/ 1, 2, 3, 4, 5, 6, 7, 8, 9 /), (/ 3, 3 /))
    print '(3i3)', a(1,:)
    print '(3i3)', a(2,:)
    print '(3i3)', a(3,:)    
    a = cshift(a, SHIFT=(/1, 2, -1/), DIM=2)
    print *
    print '(3i3)', a(1,:)
    print '(3i3)', a(2,:)
    print '(3i3)', a(3,:)
end program test_cshift
</pre></div>
</dd>
</dl>



<hr>
<a name="CTIME"></a>
<div class="header">
<p>
Next: <a href="#DATE_005fAND_005fTIME" accesskey="n" rel="next">DATE_AND_TIME</a>, Previous: <a href="#CSHIFT" accesskey="p" rel="prev">CSHIFT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="CTIME-_002d_002d_002d-Convert-a-time-into-a-string"></a>
<h3 class="section">7.51 <code>CTIME</code> &mdash; Convert a time into a string</h3>
<a name="index-CTIME"></a>
<a name="index-time_002c-conversion-to-string"></a>
<a name="index-conversion_002c-to-string"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>CTIME</code> converts a system time value, such as returned by
<code>TIME8()</code>, to a string of the form &lsquo;<samp>Sat Aug 19 18:13:14 1995</samp>&rsquo;.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL CTIME(TIME, RESULT)</code>.</td></tr>
<tr><td width="80%"><code>RESULT = CTIME(TIME)</code>, (not recommended).</td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>TIME</var></td><td width="70%">The type shall be of type <code>INTEGER(KIND=8)</code>.</td></tr>
<tr><td width="15%"><var>RESULT</var></td><td width="70%">The type shall be of type <code>CHARACTER</code> and
of default kind.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The converted date and time as a string.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_ctime
    integer(8) :: i
    character(len=30) :: date
    i = time8()

    ! Do something, main part of the program
    
    call ctime(i,date)
    print *, 'Program was started on ', date
end program test_ctime
</pre></div>

</dd>
<dt><em>See Also</em>:</dt>
<dd><p><a href="#GMTIME">GMTIME</a>, <a href="#LTIME">LTIME</a>, <a href="#TIME">TIME</a>, <a href="#TIME8">TIME8</a>
</p></dd>
</dl>



<hr>
<a name="DATE_005fAND_005fTIME"></a>
<div class="header">
<p>
Next: <a href="#DBLE" accesskey="n" rel="next">DBLE</a>, Previous: <a href="#CTIME" accesskey="p" rel="prev">CTIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DATE_005fAND_005fTIME-_002d_002d_002d-Date-and-time-subroutine"></a>
<h3 class="section">7.52 <code>DATE_AND_TIME</code> &mdash; Date and time subroutine</h3>
<a name="index-DATE_005fAND_005fTIME"></a>
<a name="index-date_002c-current"></a>
<a name="index-current-date"></a>
<a name="index-time_002c-current"></a>
<a name="index-current-time"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DATE_AND_TIME(DATE, TIME, ZONE, VALUES)</code> gets the corresponding date and
time information from the real-time system clock.  <var>DATE</var> is
<code>INTENT(OUT)</code> and has form ccyymmdd.  <var>TIME</var> is <code>INTENT(OUT)</code> and
has form hhmmss.sss.  <var>ZONE</var> is <code>INTENT(OUT)</code> and has form (+-)hhmm,
representing the difference with respect to Coordinated Universal Time (UTC).
Unavailable time and date parameters return blanks.
</p>
<p><var>VALUES</var> is <code>INTENT(OUT)</code> and provides the following:
</p>
<table>
<tr><td width="15%"></td><td width="30%"><code>VALUE(1)</code>:</td><td width="40%">The year</td></tr>
<tr><td width="15%"></td><td width="30%"><code>VALUE(2)</code>:</td><td width="40%">The month</td></tr>
<tr><td width="15%"></td><td width="30%"><code>VALUE(3)</code>:</td><td width="40%">The day of the month</td></tr>
<tr><td width="15%"></td><td width="30%"><code>VALUE(4)</code>:</td><td width="40%">Time difference with UTC in minutes</td></tr>
<tr><td width="15%"></td><td width="30%"><code>VALUE(5)</code>:</td><td width="40%">The hour of the day</td></tr>
<tr><td width="15%"></td><td width="30%"><code>VALUE(6)</code>:</td><td width="40%">The minutes of the hour</td></tr>
<tr><td width="15%"></td><td width="30%"><code>VALUE(7)</code>:</td><td width="40%">The seconds of the minute</td></tr>
<tr><td width="15%"></td><td width="30%"><code>VALUE(8)</code>:</td><td width="40%">The milliseconds of the second</td></tr>
</table>

</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL DATE_AND_TIME([DATE, TIME, ZONE, VALUES])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>DATE</var></td><td width="70%">(Optional) The type shall be <code>CHARACTER(LEN=8)</code>
or larger, and of default kind.</td></tr>
<tr><td width="15%"><var>TIME</var></td><td width="70%">(Optional) The type shall be <code>CHARACTER(LEN=10)</code>
or larger, and of default kind.</td></tr>
<tr><td width="15%"><var>ZONE</var></td><td width="70%">(Optional) The type shall be <code>CHARACTER(LEN=5)</code>
or larger, and of default kind.</td></tr>
<tr><td width="15%"><var>VALUES</var></td><td width="70%">(Optional) The type shall be <code>INTEGER(8)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>None
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_time_and_date
    character(8)  :: date
    character(10) :: time
    character(5)  :: zone
    integer,dimension(8) :: values
    ! using keyword arguments
    call date_and_time(date,time,zone,values)
    call date_and_time(DATE=date,ZONE=zone)
    call date_and_time(TIME=time)
    call date_and_time(VALUES=values)
    print '(a,2x,a,2x,a)', date, time, zone
    print '(8i5))', values
end program test_time_and_date
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CPU_005fTIME">CPU_TIME</a>, <a href="#SYSTEM_005fCLOCK">SYSTEM_CLOCK</a>
</p></dd>
</dl>



<hr>
<a name="DBLE"></a>
<div class="header">
<p>
Next: <a href="#DCMPLX" accesskey="n" rel="next">DCMPLX</a>, Previous: <a href="#DATE_005fAND_005fTIME" accesskey="p" rel="prev">DATE_AND_TIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DBLE-_002d_002d_002d-Double-conversion-function"></a>
<h3 class="section">7.53 <code>DBLE</code> &mdash; Double conversion function</h3>
<a name="index-DBLE"></a>
<a name="index-conversion_002c-to-real"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DBLE(A)</code> Converts <var>A</var> to double precision real type.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = DBLE(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type shall be <code>INTEGER</code>, <code>REAL</code>,
or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type double precision real.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_dble
    real    :: x = 2.18
    integer :: i = 5
    complex :: z = (2.3,1.14)
    print *, dble(x), dble(i), dble(z)
end program test_dble
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#DFLOAT">DFLOAT</a>, <a href="#FLOAT">FLOAT</a>, <a href="#REAL">REAL</a>
</p></dd>
</dl>



<hr>
<a name="DCMPLX"></a>
<div class="header">
<p>
Next: <a href="#DFLOAT" accesskey="n" rel="next">DFLOAT</a>, Previous: <a href="#DBLE" accesskey="p" rel="prev">DBLE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DCMPLX-_002d_002d_002d-Double-complex-conversion-function"></a>
<h3 class="section">7.54 <code>DCMPLX</code> &mdash; Double complex conversion function</h3>
<a name="index-DCMPLX"></a>
<a name="index-complex-numbers_002c-conversion-to-2"></a>
<a name="index-conversion_002c-to-complex-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DCMPLX(X [,Y])</code> returns a double complex number where <var>X</var> is
converted to the real component.  If <var>Y</var> is present it is converted to the
imaginary component.  If <var>Y</var> is not present then the imaginary component is
set to 0.0.  If <var>X</var> is complex then <var>Y</var> must not be present.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = DCMPLX(X [, Y])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type may be <code>INTEGER</code>, <code>REAL</code>,
or <code>COMPLEX</code>.</td></tr>
<tr><td width="15%"><var>Y</var></td><td width="70%">(Optional if <var>X</var> is not <code>COMPLEX</code>.) May be
<code>INTEGER</code> or <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>COMPLEX(8)</code>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_dcmplx
    integer :: i = 42
    real :: x = 3.14
    complex :: z
    z = cmplx(i, x)
    print *, dcmplx(i)
    print *, dcmplx(x)
    print *, dcmplx(z)
    print *, dcmplx(x,i)
end program test_dcmplx
</pre></div>
</dd>
</dl>



<hr>
<a name="DFLOAT"></a>
<div class="header">
<p>
Next: <a href="#DIGITS" accesskey="n" rel="next">DIGITS</a>, Previous: <a href="#DCMPLX" accesskey="p" rel="prev">DCMPLX</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DFLOAT-_002d_002d_002d-Double-conversion-function"></a>
<h3 class="section">7.55 <code>DFLOAT</code> &mdash; Double conversion function</h3>
<a name="index-DFLOAT"></a>
<a name="index-conversion_002c-to-real-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DFLOAT(A)</code> Converts <var>A</var> to double precision real type.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = DFLOAT(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type double precision real.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_dfloat
    integer :: i = 5
    print *, dfloat(i)
end program test_dfloat
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#DBLE">DBLE</a>, <a href="#FLOAT">FLOAT</a>, <a href="#REAL">REAL</a>
</p></dd>
</dl>



<hr>
<a name="DIGITS"></a>
<div class="header">
<p>
Next: <a href="#DIM" accesskey="n" rel="next">DIM</a>, Previous: <a href="#DFLOAT" accesskey="p" rel="prev">DFLOAT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DIGITS-_002d_002d_002d-Significant-binary-digits-function"></a>
<h3 class="section">7.56 <code>DIGITS</code> &mdash; Significant binary digits function</h3>
<a name="index-DIGITS"></a>
<a name="index-model-representation_002c-significant-digits"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DIGITS(X)</code> returns the number of significant binary digits of the internal
model representation of <var>X</var>.  For example, on a system using a 32-bit
floating point representation, a default real number would likely return 24.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = DIGITS(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type may be <code>INTEGER</code> or <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_digits
    integer :: i = 12345
    real :: x = 3.143
    real(8) :: y = 2.33
    print *, digits(i)
    print *, digits(x)
    print *, digits(y)
end program test_digits
</pre></div>
</dd>
</dl>



<hr>
<a name="DIM"></a>
<div class="header">
<p>
Next: <a href="#DOT_005fPRODUCT" accesskey="n" rel="next">DOT_PRODUCT</a>, Previous: <a href="#DIGITS" accesskey="p" rel="prev">DIGITS</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DIM-_002d_002d_002d-Positive-difference"></a>
<h3 class="section">7.57 <code>DIM</code> &mdash; Positive difference</h3>
<a name="index-DIM"></a>
<a name="index-IDIM"></a>
<a name="index-DDIM"></a>
<a name="index-positive-difference"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DIM(X,Y)</code> returns the difference <code>X-Y</code> if the result is positive;
otherwise returns zero.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = DIM(X, Y)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>INTEGER</code> or <code>REAL</code></td></tr>
<tr><td width="15%"><var>Y</var></td><td width="70%">The type shall be the same type and kind as <var>X</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> or <code>REAL</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_dim
    integer :: i
    real(8) :: x
    i = dim(4, 15)
    x = dim(4.345_8, 2.111_8)
    print *, i
    print *, x
end program test_dim
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>IDIM(X,Y)</code></td><td width="20%"><code>INTEGER(4) X,Y</code></td><td width="20%"><code>INTEGER(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>DDIM(X,Y)</code></td><td width="20%"><code>REAL(8) X,Y</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="DOT_005fPRODUCT"></a>
<div class="header">
<p>
Next: <a href="#DPROD" accesskey="n" rel="next">DPROD</a>, Previous: <a href="#DIM" accesskey="p" rel="prev">DIM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DOT_005fPRODUCT-_002d_002d_002d-Dot-product-function"></a>
<h3 class="section">7.58 <code>DOT_PRODUCT</code> &mdash; Dot product function</h3>
<a name="index-DOT_005fPRODUCT"></a>
<a name="index-dot-product"></a>
<a name="index-vector-product"></a>
<a name="index-product_002c-vector"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DOT_PRODUCT(VECTOR_A, VECTOR_B)</code> computes the dot product multiplication
of two vectors <var>VECTOR_A</var> and <var>VECTOR_B</var>.  The two vectors may be
either numeric or logical and must be arrays of rank one and of equal size. If
the vectors are <code>INTEGER</code> or <code>REAL</code>, the result is
<code>SUM(VECTOR_A*VECTOR_B)</code>. If the vectors are <code>COMPLEX</code>, the result
is <code>SUM(CONJG(VECTOR_A)*VECTOR_B)</code>. If the vectors are <code>LOGICAL</code>,
the result is <code>ANY(VECTOR_A .AND. VECTOR_B)</code>.  
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = DOT_PRODUCT(VECTOR_A, VECTOR_B)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>VECTOR_A</var></td><td width="70%">The type shall be numeric or <code>LOGICAL</code>, rank 1.</td></tr>
<tr><td width="15%"><var>VECTOR_B</var></td><td width="70%">The type shall be numeric if <var>VECTOR_A</var> is of numeric type or <code>LOGICAL</code> if <var>VECTOR_A</var> is of type <code>LOGICAL</code>. <var>VECTOR_B</var> shall be a rank-one array.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>If the arguments are numeric, the return value is a scalar of numeric type,
<code>INTEGER</code>, <code>REAL</code>, or <code>COMPLEX</code>.  If the arguments are
<code>LOGICAL</code>, the return value is <code>.TRUE.</code> or <code>.FALSE.</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_dot_prod
    integer, dimension(3) :: a, b
    a = (/ 1, 2, 3 /)
    b = (/ 4, 5, 6 /)
    print '(3i3)', a
    print *
    print '(3i3)', b
    print *
    print *, dot_product(a,b)
end program test_dot_prod
</pre></div>
</dd>
</dl>



<hr>
<a name="DPROD"></a>
<div class="header">
<p>
Next: <a href="#DREAL" accesskey="n" rel="next">DREAL</a>, Previous: <a href="#DOT_005fPRODUCT" accesskey="p" rel="prev">DOT_PRODUCT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DPROD-_002d_002d_002d-Double-product-function"></a>
<h3 class="section">7.59 <code>DPROD</code> &mdash; Double product function</h3>
<a name="index-DPROD"></a>
<a name="index-product_002c-double_002dprecision"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DPROD(X,Y)</code> returns the product <code>X*Y</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = DPROD(X, Y)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>Y</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL(8)</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_dprod
    real :: x = 5.2
    real :: y = 2.3
    real(8) :: d
    d = dprod(x,y)
    print *, d
end program test_dprod
</pre></div>
</dd>
</dl>



<hr>
<a name="DREAL"></a>
<div class="header">
<p>
Next: <a href="#DTIME" accesskey="n" rel="next">DTIME</a>, Previous: <a href="#DPROD" accesskey="p" rel="prev">DPROD</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DREAL-_002d_002d_002d-Double-real-part-function"></a>
<h3 class="section">7.60 <code>DREAL</code> &mdash; Double real part function</h3>
<a name="index-DREAL"></a>
<a name="index-complex-numbers_002c-real-part"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DREAL(Z)</code> returns the real part of complex variable <var>Z</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = DREAL(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type shall be <code>COMPLEX(8)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL(8)</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_dreal
    complex(8) :: z = (1.3_8,7.2_8)
    print *, dreal(z)
end program test_dreal
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#AIMAG">AIMAG</a>
</p>
</dd>
</dl>



<hr>
<a name="DTIME"></a>
<div class="header">
<p>
Next: <a href="#EOSHIFT" accesskey="n" rel="next">EOSHIFT</a>, Previous: <a href="#DREAL" accesskey="p" rel="prev">DREAL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="DTIME-_002d_002d_002d-Execution-time-subroutine-_0028or-function_0029"></a>
<h3 class="section">7.61 <code>DTIME</code> &mdash; Execution time subroutine (or function)</h3>
<a name="index-DTIME"></a>
<a name="index-time_002c-elapsed-1"></a>
<a name="index-elapsed-time"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>DTIME(TARRAY, RESULT)</code> initially returns the number of seconds of runtime
since the start of the process&rsquo;s execution in <var>RESULT</var>.  <var>TARRAY</var>
returns the user and system components of this time in <code>TARRAY(1)</code> and
<code>TARRAY(2)</code> respectively. <var>RESULT</var> is equal to <code>TARRAY(1) +
TARRAY(2)</code>.
</p>
<p>Subsequent invocations of <code>DTIME</code> return values accumulated since the
previous invocation.
</p>
<p>On some systems, the underlying timings are represented using types with
sufficiently small limits that overflows (wrap around) are possible, such as
32-bit types. Therefore, the values returned by this intrinsic might be, or
become, negative, or numerically less than previous values, during a single
run of the compiled program.
</p>
<p>Please note, that this implementation is thread safe if used within OpenMP
directives, i.e., its state will be consistent while called from multiple
threads. However, if <code>DTIME</code> is called from multiple threads, the result
is still the time since the last invocation. This may not give the intended
results. If possible, use <code>CPU_TIME</code> instead.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
<p><var>TARRAY</var> and <var>RESULT</var> are <code>INTENT(OUT)</code> and provide the following:
</p>
<table>
<tr><td width="15%"></td><td width="30%"><code>TARRAY(1)</code>:</td><td width="40%">User time in seconds.</td></tr>
<tr><td width="15%"></td><td width="30%"><code>TARRAY(2)</code>:</td><td width="40%">System time in seconds.</td></tr>
<tr><td width="15%"></td><td width="30%"><code>RESULT</code>:</td><td width="40%">Run time since start in seconds.</td></tr>
</table>

</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL DTIME(TARRAY, RESULT)</code>.</td></tr>
<tr><td width="80%"><code>RESULT = DTIME(TARRAY)</code>, (not recommended).</td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>TARRAY</var></td><td width="70%">The type shall be <code>REAL, DIMENSION(2)</code>.</td></tr>
<tr><td width="15%"><var>RESULT</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Elapsed time in seconds since the last invocation or since the start of program
execution if not called before.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_dtime
    integer(8) :: i, j
    real, dimension(2) :: tarray
    real :: result
    call dtime(tarray, result)
    print *, result
    print *, tarray(1)
    print *, tarray(2)   
    do i=1,100000000    ! Just a delay
        j = i * i - i
    end do
    call dtime(tarray, result)
    print *, result
    print *, tarray(1)
    print *, tarray(2)
end program test_dtime
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CPU_005fTIME">CPU_TIME</a>
</p>
</dd>
</dl>



<hr>
<a name="EOSHIFT"></a>
<div class="header">
<p>
Next: <a href="#EPSILON" accesskey="n" rel="next">EPSILON</a>, Previous: <a href="#DTIME" accesskey="p" rel="prev">DTIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="EOSHIFT-_002d_002d_002d-End_002doff-shift-elements-of-an-array"></a>
<h3 class="section">7.62 <code>EOSHIFT</code> &mdash; End-off shift elements of an array</h3>
<a name="index-EOSHIFT"></a>
<a name="index-array_002c-shift"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>EOSHIFT(ARRAY, SHIFT[, BOUNDARY, DIM])</code> performs an end-off shift on
elements of <var>ARRAY</var> along the dimension of <var>DIM</var>.  If <var>DIM</var> is
omitted it is taken to be <code>1</code>.  <var>DIM</var> is a scalar of type
<code>INTEGER</code> in the range of <em>1 /leq DIM /leq n)</em> where <em>n</em> is the
rank of <var>ARRAY</var>.  If the rank of <var>ARRAY</var> is one, then all elements of
<var>ARRAY</var> are shifted by <var>SHIFT</var> places.  If rank is greater than one,
then all complete rank one sections of <var>ARRAY</var> along the given dimension are
shifted.  Elements shifted out one end of each rank one section are dropped.  If
<var>BOUNDARY</var> is present then the corresponding value of from <var>BOUNDARY</var>
is copied back in the other end.  If <var>BOUNDARY</var> is not present then the
following are copied in depending on the type of <var>ARRAY</var>.
</p>
<table>
<tr><td width="15%"><em>Array Type</em></td><td width="80%"><em>Boundary Value</em></td></tr>
<tr><td width="15%">Numeric</td><td width="80%">0 of the type and kind of <var>ARRAY</var>.</td></tr>
<tr><td width="15%">Logical</td><td width="80%"><code>.FALSE.</code>.</td></tr>
<tr><td width="15%">Character(<var>len</var>)</td><td width="80%"><var>len</var> blanks.</td></tr>
</table>

</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = EOSHIFT(ARRAY, SHIFT [, BOUNDARY, DIM])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">May be any type, not scalar.</td></tr>
<tr><td width="15%"><var>SHIFT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>BOUNDARY</var></td><td width="70%">Same type as <var>ARRAY</var>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns an array of same type and rank as the <var>ARRAY</var> argument.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_eoshift
    integer, dimension(3,3) :: a
    a = reshape( (/ 1, 2, 3, 4, 5, 6, 7, 8, 9 /), (/ 3, 3 /))
    print '(3i3)', a(1,:)
    print '(3i3)', a(2,:)
    print '(3i3)', a(3,:)    
    a = EOSHIFT(a, SHIFT=(/1, 2, 1/), BOUNDARY=-5, DIM=2)
    print *
    print '(3i3)', a(1,:)
    print '(3i3)', a(2,:)
    print '(3i3)', a(3,:)
end program test_eoshift
</pre></div>
</dd>
</dl>



<hr>
<a name="EPSILON"></a>
<div class="header">
<p>
Next: <a href="#ERF" accesskey="n" rel="next">ERF</a>, Previous: <a href="#EOSHIFT" accesskey="p" rel="prev">EOSHIFT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="EPSILON-_002d_002d_002d-Epsilon-function"></a>
<h3 class="section">7.63 <code>EPSILON</code> &mdash; Epsilon function</h3>
<a name="index-EPSILON"></a>
<a name="index-model-representation_002c-epsilon"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>EPSILON(X)</code> returns the smallest number <var>E</var> of the same kind
as <var>X</var> such that <em>1 + E &gt; 1</em>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = EPSILON(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of same type as the argument.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_epsilon
    real :: x = 3.143
    real(8) :: y = 2.33
    print *, EPSILON(x)
    print *, EPSILON(y)
end program test_epsilon
</pre></div>
</dd>
</dl>



<hr>
<a name="ERF"></a>
<div class="header">
<p>
Next: <a href="#ERFC" accesskey="n" rel="next">ERFC</a>, Previous: <a href="#EPSILON" accesskey="p" rel="prev">EPSILON</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ERF-_002d_002d_002d-Error-function"></a>
<h3 class="section">7.64 <code>ERF</code> &mdash; Error function</h3>
<a name="index-ERF"></a>
<a name="index-error-function"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ERF(X)</code> computes the error function of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ERF(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code>, of the same kind as
<var>X</var> and lies in the range <em>-1 \leq erf (x) \leq 1 </em>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_erf
  real(8) :: x = 0.17_8
  x = erf(x)
end program test_erf
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DERF(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="ERFC"></a>
<div class="header">
<p>
Next: <a href="#ERFC_005fSCALED" accesskey="n" rel="next">ERFC_SCALED</a>, Previous: <a href="#ERF" accesskey="p" rel="prev">ERF</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ERFC-_002d_002d_002d-Error-function"></a>
<h3 class="section">7.65 <code>ERFC</code> &mdash; Error function</h3>
<a name="index-ERFC"></a>
<a name="index-error-function_002c-complementary"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ERFC(X)</code> computes the complementary error function of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ERFC(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and of the same kind as <var>X</var>.
It lies in the range <em>0 \leq erfc (x) \leq 2 </em>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_erfc
  real(8) :: x = 0.17_8
  x = erfc(x)
end program test_erfc
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DERFC(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="ERFC_005fSCALED"></a>
<div class="header">
<p>
Next: <a href="#ETIME" accesskey="n" rel="next">ETIME</a>, Previous: <a href="#ERFC" accesskey="p" rel="prev">ERFC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ERFC_005fSCALED-_002d_002d_002d-Error-function"></a>
<h3 class="section">7.66 <code>ERFC_SCALED</code> &mdash; Error function</h3>
<a name="index-ERFC_005fSCALED"></a>
<a name="index-error-function_002c-complementary_002c-exponentially_002dscaled"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ERFC_SCALED(X)</code> computes the exponentially-scaled complementary
error function of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ERFC_SCALED(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and of the same kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_erfc_scaled
  real(8) :: x = 0.17_8
  x = erfc_scaled(x)
end program test_erfc_scaled
</pre></div>
</dd>
</dl>



<hr>
<a name="ETIME"></a>
<div class="header">
<p>
Next: <a href="#EXIT" accesskey="n" rel="next">EXIT</a>, Previous: <a href="#ERFC_005fSCALED" accesskey="p" rel="prev">ERFC_SCALED</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ETIME-_002d_002d_002d-Execution-time-subroutine-_0028or-function_0029"></a>
<h3 class="section">7.67 <code>ETIME</code> &mdash; Execution time subroutine (or function)</h3>
<a name="index-ETIME"></a>
<a name="index-time_002c-elapsed-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ETIME(TARRAY, RESULT)</code> returns the number of seconds of runtime
since the start of the process&rsquo;s execution in <var>RESULT</var>.  <var>TARRAY</var>
returns the user and system components of this time in <code>TARRAY(1)</code> and
<code>TARRAY(2)</code> respectively. <var>RESULT</var> is equal to <code>TARRAY(1) + TARRAY(2)</code>.
</p>
<p>On some systems, the underlying timings are represented using types with
sufficiently small limits that overflows (wrap around) are possible, such as
32-bit types. Therefore, the values returned by this intrinsic might be, or
become, negative, or numerically less than previous values, during a single
run of the compiled program.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
<p><var>TARRAY</var> and <var>RESULT</var> are <code>INTENT(OUT)</code> and provide the following:
</p>
<table>
<tr><td width="15%"></td><td width="30%"><code>TARRAY(1)</code>:</td><td width="60%">User time in seconds.</td></tr>
<tr><td width="15%"></td><td width="30%"><code>TARRAY(2)</code>:</td><td width="60%">System time in seconds.</td></tr>
<tr><td width="15%"></td><td width="30%"><code>RESULT</code>:</td><td width="60%">Run time since start in seconds.</td></tr>
</table>

</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL ETIME(TARRAY, RESULT)</code>.</td></tr>
<tr><td width="80%"><code>RESULT = ETIME(TARRAY)</code>, (not recommended).</td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>TARRAY</var></td><td width="70%">The type shall be <code>REAL, DIMENSION(2)</code>.</td></tr>
<tr><td width="15%"><var>RESULT</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Elapsed time in seconds since the start of program execution.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_etime
    integer(8) :: i, j
    real, dimension(2) :: tarray
    real :: result
    call ETIME(tarray, result)
    print *, result
    print *, tarray(1)
    print *, tarray(2)   
    do i=1,100000000    ! Just a delay
        j = i * i - i
    end do
    call ETIME(tarray, result)
    print *, result
    print *, tarray(1)
    print *, tarray(2)
end program test_etime
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CPU_005fTIME">CPU_TIME</a>
</p>
</dd>
</dl>



<hr>
<a name="EXIT"></a>
<div class="header">
<p>
Next: <a href="#EXP" accesskey="n" rel="next">EXP</a>, Previous: <a href="#ETIME" accesskey="p" rel="prev">ETIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="EXIT-_002d_002d_002d-Exit-the-program-with-status_002e"></a>
<h3 class="section">7.68 <code>EXIT</code> &mdash; Exit the program with status.</h3>
<a name="index-EXIT"></a>
<a name="index-program-termination"></a>
<a name="index-terminate-program"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>EXIT</code> causes immediate termination of the program with status.  If status
is omitted it returns the canonical <em>success</em> for the system.  All Fortran
I/O units are closed. 
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL EXIT([STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">Shall be an <code>INTEGER</code> of the default kind.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p><code>STATUS</code> is passed to the parent process on exit.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_exit
  integer :: STATUS = 0
  print *, 'This program is going to exit.'
  call EXIT(STATUS)
end program test_exit
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ABORT">ABORT</a>, <a href="#KILL">KILL</a>
</p></dd>
</dl>



<hr>
<a name="EXP"></a>
<div class="header">
<p>
Next: <a href="#EXPONENT" accesskey="n" rel="next">EXPONENT</a>, Previous: <a href="#EXIT" accesskey="p" rel="prev">EXIT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="EXP-_002d_002d_002d-Exponential-function"></a>
<h3 class="section">7.69 <code>EXP</code> &mdash; Exponential function</h3>
<a name="index-EXP"></a>
<a name="index-DEXP"></a>
<a name="index-CEXP"></a>
<a name="index-ZEXP"></a>
<a name="index-CDEXP"></a>
<a name="index-exponential-function"></a>
<a name="index-logarithmic-function_002c-inverse"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>EXP(X)</code> computes the base <em>e</em> exponential of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, has overloads that are GNU extensions
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = EXP(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> or
<code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value has same type and kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_exp
  real :: x = 1.0
  x = exp(x)
end program test_exp
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DEXP(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>CEXP(X)</code></td><td width="20%"><code>COMPLEX(4) X</code></td><td width="20%"><code>COMPLEX(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>ZEXP(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
<tr><td width="20%"><code>CDEXP(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="EXPONENT"></a>
<div class="header">
<p>
Next: <a href="#FDATE" accesskey="n" rel="next">FDATE</a>, Previous: <a href="#EXP" accesskey="p" rel="prev">EXP</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="EXPONENT-_002d_002d_002d-Exponent-function"></a>
<h3 class="section">7.70 <code>EXPONENT</code> &mdash; Exponent function</h3>
<a name="index-EXPONENT"></a>
<a name="index-real-number_002c-exponent"></a>
<a name="index-floating-point_002c-exponent"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>EXPONENT(X)</code> returns the value of the exponent part of <var>X</var>. If <var>X</var>
is zero the value returned is zero. 
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = EXPONENT(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type default <code>INTEGER</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_exponent
  real :: x = 1.0
  integer :: i
  i = exponent(x)
  print *, i
  print *, exponent(0.0)
end program test_exponent
</pre></div>
</dd>
</dl>



<hr>
<a name="FDATE"></a>
<div class="header">
<p>
Next: <a href="#FLOAT" accesskey="n" rel="next">FLOAT</a>, Previous: <a href="#EXPONENT" accesskey="p" rel="prev">EXPONENT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FDATE-_002d_002d_002d-Get-the-current-time-as-a-string"></a>
<h3 class="section">7.71 <code>FDATE</code> &mdash; Get the current time as a string</h3>
<a name="index-FDATE"></a>
<a name="index-time_002c-current-1"></a>
<a name="index-current-time-1"></a>
<a name="index-date_002c-current-1"></a>
<a name="index-current-date-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>FDATE(DATE)</code> returns the current date (using the same format as
<code>CTIME</code>) in <var>DATE</var>. It is equivalent to <code>CALL CTIME(DATE,
TIME())</code>.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
<p><var>DATE</var> is an <code>INTENT(OUT)</code> <code>CHARACTER</code> variable of the
default kind.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL FDATE(DATE)</code>.</td></tr>
<tr><td width="80%"><code>DATE = FDATE()</code>, (not recommended).</td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>DATE</var></td><td width="70%">The type shall be of type <code>CHARACTER</code> of the
default kind</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The current date as a string.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_fdate
    integer(8) :: i, j
    character(len=30) :: date
    call fdate(date)
    print *, 'Program started on ', date
    do i = 1, 100000000 ! Just a delay
        j = i * i - i
    end do
    call fdate(date)
    print *, 'Program ended on ', date
end program test_fdate
</pre></div>
</dd>
</dl>



<hr>
<a name="FLOAT"></a>
<div class="header">
<p>
Next: <a href="#FGET" accesskey="n" rel="next">FGET</a>, Previous: <a href="#FDATE" accesskey="p" rel="prev">FDATE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FLOAT-_002d_002d_002d-Convert-integer-to-default-real"></a>
<h3 class="section">7.72 <code>FLOAT</code> &mdash; Convert integer to default real</h3>
<a name="index-FLOAT"></a>
<a name="index-conversion_002c-to-real-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>FLOAT(A)</code> converts the integer <var>A</var> to a default real value.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = FLOAT(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type default <code>REAL</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_float
    integer :: i = 1
    if (float(i) /= 1.) call abort
end program test_float
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#DBLE">DBLE</a>, <a href="#DFLOAT">DFLOAT</a>, <a href="#REAL">REAL</a>
</p></dd>
</dl>



<hr>
<a name="FGET"></a>
<div class="header">
<p>
Next: <a href="#FGETC" accesskey="n" rel="next">FGETC</a>, Previous: <a href="#FLOAT" accesskey="p" rel="prev">FLOAT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FGET-_002d_002d_002d-Read-a-single-character-in-stream-mode-from-stdin"></a>
<h3 class="section">7.73 <code>FGET</code> &mdash; Read a single character in stream mode from stdin</h3>
<a name="index-FGET"></a>
<a name="index-read-character_002c-stream-mode"></a>
<a name="index-stream-mode_002c-read-character"></a>
<a name="index-file-operation_002c-read-character"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Read a single character in stream mode from stdin by bypassing normal 
formatted output. Stream I/O should not be mixed with normal record-oriented 
(formatted or unformatted) I/O on the same unit; the results are unpredictable.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
<p>Note that the <code>FGET</code> intrinsic is provided for backwards compatibility with 
<code>g77</code>.  GNU Fortran provides the Fortran 2003 Stream facility.
Programmers should consider the use of new stream IO feature in new code 
for future portability. See also <a href="#Fortran-2003-status">Fortran 2003 status</a>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL FGET(C [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">The type shall be <code>CHARACTER</code> and of default
kind.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER</code>.
Returns 0 on success, -1 on end-of-file, and a system specific positive
error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_fget
  INTEGER, PARAMETER :: strlen = 100
  INTEGER :: status, i = 1
  CHARACTER(len=strlen) :: str = &quot;&quot;

  WRITE (*,*) 'Enter text:'
  DO
    CALL fget(str(i:i), status)
    if (status /= 0 .OR. i &gt; strlen) exit
    i = i + 1
  END DO
  WRITE (*,*) TRIM(str)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#FGETC">FGETC</a>, <a href="#FPUT">FPUT</a>, <a href="#FPUTC">FPUTC</a>
</p></dd>
</dl>



<hr>
<a name="FGETC"></a>
<div class="header">
<p>
Next: <a href="#FLOOR" accesskey="n" rel="next">FLOOR</a>, Previous: <a href="#FGET" accesskey="p" rel="prev">FGET</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FGETC-_002d_002d_002d-Read-a-single-character-in-stream-mode"></a>
<h3 class="section">7.74 <code>FGETC</code> &mdash; Read a single character in stream mode</h3>
<a name="index-FGETC"></a>
<a name="index-read-character_002c-stream-mode-1"></a>
<a name="index-stream-mode_002c-read-character-1"></a>
<a name="index-file-operation_002c-read-character-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Read a single character in stream mode by bypassing normal formatted output. 
Stream I/O should not be mixed with normal record-oriented (formatted or 
unformatted) I/O on the same unit; the results are unpredictable.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
<p>Note that the <code>FGET</code> intrinsic is provided for backwards compatibility
with <code>g77</code>.  GNU Fortran provides the Fortran 2003 Stream facility.
Programmers should consider the use of new stream IO feature in new code 
for future portability. See also <a href="#Fortran-2003-status">Fortran 2003 status</a>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL FGETC(UNIT, C [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>C</var></td><td width="70%">The type shall be <code>CHARACTER</code> and of default
kind.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER</code>.
Returns 0 on success, -1 on end-of-file and a system specific positive
error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_fgetc
  INTEGER :: fd = 42, status
  CHARACTER :: c

  OPEN(UNIT=fd, FILE=&quot;/etc/passwd&quot;, ACTION=&quot;READ&quot;, STATUS = &quot;OLD&quot;)
  DO
    CALL fgetc(fd, c, status)
    IF (status /= 0) EXIT
    call fput(c)
  END DO
  CLOSE(UNIT=fd)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#FGET">FGET</a>, <a href="#FPUT">FPUT</a>, <a href="#FPUTC">FPUTC</a>
</p></dd>
</dl>



<hr>
<a name="FLOOR"></a>
<div class="header">
<p>
Next: <a href="#FLUSH" accesskey="n" rel="next">FLUSH</a>, Previous: <a href="#FGETC" accesskey="p" rel="prev">FGETC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FLOOR-_002d_002d_002d-Integer-floor-function"></a>
<h3 class="section">7.75 <code>FLOOR</code> &mdash; Integer floor function</h3>
<a name="index-FLOOR"></a>
<a name="index-floor-1"></a>
<a name="index-rounding_002c-floor-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>FLOOR(A)</code> returns the greatest integer less than or equal to <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = FLOOR(A [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER(KIND)</code> if <var>KIND</var> is present
and of default-kind <code>INTEGER</code> otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_floor
    real :: x = 63.29
    real :: y = -63.59
    print *, floor(x) ! returns 63
    print *, floor(y) ! returns -64
end program test_floor
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CEILING">CEILING</a>, <a href="#NINT">NINT</a>
</p>
</dd>
</dl>



<hr>
<a name="FLUSH"></a>
<div class="header">
<p>
Next: <a href="#FNUM" accesskey="n" rel="next">FNUM</a>, Previous: <a href="#FLOOR" accesskey="p" rel="prev">FLOOR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FLUSH-_002d_002d_002d-Flush-I_002fO-unit_0028s_0029"></a>
<h3 class="section">7.76 <code>FLUSH</code> &mdash; Flush I/O unit(s)</h3>
<a name="index-FLUSH"></a>
<a name="index-file-operation_002c-flush"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Flushes Fortran unit(s) currently open for output. Without the optional
argument, all units are flushed, otherwise just the unit specified.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL FLUSH(UNIT)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">(Optional) The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Note</em>:</dt>
<dd><p>Beginning with the Fortran 2003 standard, there is a <code>FLUSH</code>
statement that should be preferred over the <code>FLUSH</code> intrinsic.
</p>
</dd>
</dl>



<hr>
<a name="FNUM"></a>
<div class="header">
<p>
Next: <a href="#FPUT" accesskey="n" rel="next">FPUT</a>, Previous: <a href="#FLUSH" accesskey="p" rel="prev">FLUSH</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FNUM-_002d_002d_002d-File-number-function"></a>
<h3 class="section">7.77 <code>FNUM</code> &mdash; File number function</h3>
<a name="index-FNUM"></a>
<a name="index-file-operation_002c-file-number"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>FNUM(UNIT)</code> returns the POSIX file descriptor number corresponding to the
open Fortran I/O unit <code>UNIT</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = FNUM(UNIT)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_fnum
  integer :: i
  open (unit=10, status = &quot;scratch&quot;)
  i = fnum(10)
  print *, i
  close (10)
end program test_fnum
</pre></div>
</dd>
</dl>



<hr>
<a name="FPUT"></a>
<div class="header">
<p>
Next: <a href="#FPUTC" accesskey="n" rel="next">FPUTC</a>, Previous: <a href="#FNUM" accesskey="p" rel="prev">FNUM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FPUT-_002d_002d_002d-Write-a-single-character-in-stream-mode-to-stdout"></a>
<h3 class="section">7.78 <code>FPUT</code> &mdash; Write a single character in stream mode to stdout</h3>
<a name="index-FPUT"></a>
<a name="index-write-character_002c-stream-mode"></a>
<a name="index-stream-mode_002c-write-character"></a>
<a name="index-file-operation_002c-write-character"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Write a single character in stream mode to stdout by bypassing normal 
formatted output. Stream I/O should not be mixed with normal record-oriented 
(formatted or unformatted) I/O on the same unit; the results are unpredictable.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
<p>Note that the <code>FGET</code> intrinsic is provided for backwards compatibility with 
<code>g77</code>.  GNU Fortran provides the Fortran 2003 Stream facility.
Programmers should consider the use of new stream IO feature in new code 
for future portability. See also <a href="#Fortran-2003-status">Fortran 2003 status</a>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL FPUT(C [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">The type shall be <code>CHARACTER</code> and of default
kind.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER</code>.
Returns 0 on success, -1 on end-of-file and a system specific positive
error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_fput
  CHARACTER(len=10) :: str = &quot;gfortran&quot;
  INTEGER :: i
  DO i = 1, len_trim(str)
    CALL fput(str(i:i))
  END DO
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#FPUTC">FPUTC</a>, <a href="#FGET">FGET</a>, <a href="#FGETC">FGETC</a>
</p></dd>
</dl>



<hr>
<a name="FPUTC"></a>
<div class="header">
<p>
Next: <a href="#FRACTION" accesskey="n" rel="next">FRACTION</a>, Previous: <a href="#FPUT" accesskey="p" rel="prev">FPUT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FPUTC-_002d_002d_002d-Write-a-single-character-in-stream-mode"></a>
<h3 class="section">7.79 <code>FPUTC</code> &mdash; Write a single character in stream mode</h3>
<a name="index-FPUTC"></a>
<a name="index-write-character_002c-stream-mode-1"></a>
<a name="index-stream-mode_002c-write-character-1"></a>
<a name="index-file-operation_002c-write-character-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Write a single character in stream mode by bypassing normal formatted 
output. Stream I/O should not be mixed with normal record-oriented 
(formatted or unformatted) I/O on the same unit; the results are unpredictable.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
<p>Note that the <code>FGET</code> intrinsic is provided for backwards compatibility with 
<code>g77</code>.  GNU Fortran provides the Fortran 2003 Stream facility.
Programmers should consider the use of new stream IO feature in new code 
for future portability. See also <a href="#Fortran-2003-status">Fortran 2003 status</a>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL FPUTC(UNIT, C [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>C</var></td><td width="70%">The type shall be <code>CHARACTER</code> and of default
kind.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER</code>.
Returns 0 on success, -1 on end-of-file and a system specific positive
error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_fputc
  CHARACTER(len=10) :: str = &quot;gfortran&quot;
  INTEGER :: fd = 42, i

  OPEN(UNIT = fd, FILE = &quot;out&quot;, ACTION = &quot;WRITE&quot;, STATUS=&quot;NEW&quot;)
  DO i = 1, len_trim(str)
    CALL fputc(fd, str(i:i))
  END DO
  CLOSE(fd)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#FPUT">FPUT</a>, <a href="#FGET">FGET</a>, <a href="#FGETC">FGETC</a>
</p></dd>
</dl>



<hr>
<a name="FRACTION"></a>
<div class="header">
<p>
Next: <a href="#FREE" accesskey="n" rel="next">FREE</a>, Previous: <a href="#FPUTC" accesskey="p" rel="prev">FPUTC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FRACTION-_002d_002d_002d-Fractional-part-of-the-model-representation"></a>
<h3 class="section">7.80 <code>FRACTION</code> &mdash; Fractional part of the model representation</h3>
<a name="index-FRACTION"></a>
<a name="index-real-number_002c-fraction"></a>
<a name="index-floating-point_002c-fraction"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>FRACTION(X)</code> returns the fractional part of the model
representation of <code>X</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>Y = FRACTION(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type of the argument shall be a <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type and kind as the argument.
The fractional part of the model representation of <code>X</code> is returned;
it is <code>X * RADIX(X)**(-EXPONENT(X))</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_fraction
  real :: x
  x = 178.1387e-4
  print *, fraction(x), x * radix(x)**(-exponent(x))
end program test_fraction
</pre></div>

</dd>
</dl>



<hr>
<a name="FREE"></a>
<div class="header">
<p>
Next: <a href="#FSEEK" accesskey="n" rel="next">FSEEK</a>, Previous: <a href="#FRACTION" accesskey="p" rel="prev">FRACTION</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FREE-_002d_002d_002d-Frees-memory"></a>
<h3 class="section">7.81 <code>FREE</code> &mdash; Frees memory</h3>
<a name="index-FREE"></a>
<a name="index-pointer_002c-cray"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Frees memory previously allocated by <code>MALLOC()</code>. The <code>FREE</code>
intrinsic is an extension intended to be used with Cray pointers, and is
provided in GNU Fortran to allow user to compile legacy code. For
new code using Fortran 95 pointers, the memory de-allocation intrinsic is
<code>DEALLOCATE</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL FREE(PTR)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>PTR</var></td><td width="70%">The type shall be <code>INTEGER</code>. It represents the
location of the memory that should be de-allocated.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>None
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <code>MALLOC</code> for an example.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#MALLOC">MALLOC</a>
</p></dd>
</dl>



<hr>
<a name="FSEEK"></a>
<div class="header">
<p>
Next: <a href="#FSTAT" accesskey="n" rel="next">FSTAT</a>, Previous: <a href="#FREE" accesskey="p" rel="prev">FREE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FSEEK-_002d_002d_002d-Low-level-file-positioning-subroutine"></a>
<h3 class="section">7.82 <code>FSEEK</code> &mdash; Low level file positioning subroutine</h3>
<a name="index-FSEEK"></a>
<a name="index-file-operation_002c-seek"></a>
<a name="index-file-operation_002c-position"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Moves <var>UNIT</var> to the specified <var>OFFSET</var>. If <var>WHENCE</var> 
is set to 0, the <var>OFFSET</var> is taken as an absolute value <code>SEEK_SET</code>,
if set to 1, <var>OFFSET</var> is taken to be relative to the current position 
<code>SEEK_CUR</code>, and if set to 2 relative to the end of the file <code>SEEK_END</code>.
On error, <var>STATUS</var> is set to a nonzero value. If <var>STATUS</var> the seek 
fails silently.
</p>
<p>This intrinsic routine is not fully backwards compatible with <code>g77</code>. 
In <code>g77</code>, the <code>FSEEK</code> takes a statement label instead of a 
<var>STATUS</var> variable. If FSEEK is used in old code, change
</p><div class="smallexample">
<pre class="smallexample">  CALL FSEEK(UNIT, OFFSET, WHENCE, *label)
</pre></div>
<p>to
</p><div class="smallexample">
<pre class="smallexample">  INTEGER :: status
  CALL FSEEK(UNIT, OFFSET, WHENCE, status)
  IF (status /= 0) GOTO label
</pre></div>

<p>Please note that GNU Fortran provides the Fortran 2003 Stream facility.
Programmers should consider the use of new stream IO feature in new code 
for future portability. See also <a href="#Fortran-2003-status">Fortran 2003 status</a>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL FSEEK(UNIT, OFFSET, WHENCE[, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">Shall be a scalar of type <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>OFFSET</var></td><td width="70%">Shall be a scalar of type <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>WHENCE</var></td><td width="70%">Shall be a scalar of type <code>INTEGER</code>.
Its value shall be either 0, 1 or 2.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) shall be a scalar of type 
<code>INTEGER(4)</code>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_fseek
  INTEGER, PARAMETER :: SEEK_SET = 0, SEEK_CUR = 1, SEEK_END = 2
  INTEGER :: fd, offset, ierr

  ierr   = 0
  offset = 5
  fd     = 10

  OPEN(UNIT=fd, FILE=&quot;fseek.test&quot;)
  CALL FSEEK(fd, offset, SEEK_SET, ierr)  ! move to OFFSET
  print *, FTELL(fd), ierr

  CALL FSEEK(fd, 0, SEEK_END, ierr)       ! move to end
  print *, FTELL(fd), ierr

  CALL FSEEK(fd, 0, SEEK_SET, ierr)       ! move to beginning
  print *, FTELL(fd), ierr

  CLOSE(UNIT=fd)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#FTELL">FTELL</a>
</p></dd>
</dl>



<hr>
<a name="FSTAT"></a>
<div class="header">
<p>
Next: <a href="#FTELL" accesskey="n" rel="next">FTELL</a>, Previous: <a href="#FSEEK" accesskey="p" rel="prev">FSEEK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FSTAT-_002d_002d_002d-Get-file-status"></a>
<h3 class="section">7.83 <code>FSTAT</code> &mdash; Get file status</h3>
<a name="index-FSTAT"></a>
<a name="index-file-system_002c-file-status"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>FSTAT</code> is identical to <a href="#STAT">STAT</a>, except that information about an 
already opened file is obtained.
</p>
<p>The elements in <code>BUFF</code> are the same as described by <a href="#STAT">STAT</a>.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL FSTAT(UNIT, BUFF [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">An open I/O unit number of type <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>BUFF</var></td><td width="70%">The type shall be <code>INTEGER(4), DIMENSION(13)</code>.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER(4)</code>. Returns 0 
on success and a system specific error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <a href="#STAT">STAT</a> for an example.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p>To stat a link: <a href="#LSTAT">LSTAT</a>, to stat a file: <a href="#STAT">STAT</a>
</p></dd>
</dl>



<hr>
<a name="FTELL"></a>
<div class="header">
<p>
Next: <a href="#GAMMA" accesskey="n" rel="next">GAMMA</a>, Previous: <a href="#FSTAT" accesskey="p" rel="prev">FSTAT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="FTELL-_002d_002d_002d-Current-stream-position"></a>
<h3 class="section">7.84 <code>FTELL</code> &mdash; Current stream position</h3>
<a name="index-FTELL"></a>
<a name="index-file-operation_002c-position-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Retrieves the current position within an open file.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL FTELL(UNIT, OFFSET)</code></td></tr>
<tr><td width="80%"><code>OFFSET = FTELL(UNIT)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>OFFSET</var></td><td width="70%">Shall of type <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">Shall of type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>In either syntax, <var>OFFSET</var> is set to the current offset of unit
number <var>UNIT</var>, or to <em>-1</em> if the unit is not currently open.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_ftell
  INTEGER :: i
  OPEN(10, FILE=&quot;temp.dat&quot;)
  CALL ftell(10,i)
  WRITE(*,*) i
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#FSEEK">FSEEK</a>
</p></dd>
</dl>



<hr>
<a name="GAMMA"></a>
<div class="header">
<p>
Next: <a href="#GERROR" accesskey="n" rel="next">GERROR</a>, Previous: <a href="#FTELL" accesskey="p" rel="prev">FTELL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GAMMA-_002d_002d_002d-Gamma-function"></a>
<h3 class="section">7.85 <code>GAMMA</code> &mdash; Gamma function</h3>
<a name="index-GAMMA"></a>
<a name="index-DGAMMA"></a>
<a name="index-Gamma-function"></a>
<a name="index-Factorial-function"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>GAMMA(X)</code> computes Gamma (<em>\Gamma</em>) of <var>X</var>. For positive,
integer values of <var>X</var> the Gamma function simplifies to the factorial
function <em>\Gamma(x)=(x-1)!</em>.
</p>

</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>X = GAMMA(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code> and neither zero
nor a negative integer.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> of the same kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_gamma
  real :: x = 1.0
  x = gamma(x) ! returns 1.0
end program test_gamma
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>GAMMA(X)</code></td><td width="20%"><code>REAL(4) X</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">GNU Extension</td></tr>
<tr><td width="20%"><code>DGAMMA(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU Extension</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Logarithm of the Gamma function: <a href="#LOG_005fGAMMA">LOG_GAMMA</a>
</p>
</dd>
</dl>



<hr>
<a name="GERROR"></a>
<div class="header">
<p>
Next: <a href="#GETARG" accesskey="n" rel="next">GETARG</a>, Previous: <a href="#GAMMA" accesskey="p" rel="prev">GAMMA</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GERROR-_002d_002d_002d-Get-last-system-error-message"></a>
<h3 class="section">7.86 <code>GERROR</code> &mdash; Get last system error message</h3>
<a name="index-GERROR"></a>
<a name="index-system_002c-error-handling"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the system error message corresponding to the last system error.
This resembles the functionality of <code>strerror(3)</code> in C.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GERROR(RESULT)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>RESULT</var></td><td width="70%">Shall of type <code>CHARACTER</code> and of default</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_gerror
  CHARACTER(len=100) :: msg
  CALL gerror(msg)
  WRITE(*,*) msg
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IERRNO">IERRNO</a>, <a href="#PERROR">PERROR</a>
</p></dd>
</dl>



<hr>
<a name="GETARG"></a>
<div class="header">
<p>
Next: <a href="#GET_005fCOMMAND" accesskey="n" rel="next">GET_COMMAND</a>, Previous: <a href="#GERROR" accesskey="p" rel="prev">GERROR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GETARG-_002d_002d_002d-Get-command-line-arguments"></a>
<h3 class="section">7.87 <code>GETARG</code> &mdash; Get command line arguments</h3>
<a name="index-GETARG"></a>
<a name="index-command_002dline-arguments-1"></a>
<a name="index-arguments_002c-to-program-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Retrieve the <var>POS</var>-th argument that was passed on the
command line when the containing program was invoked.
</p>
<p>This intrinsic routine is provided for backwards compatibility with 
GNU Fortran 77.  In new code, programmers should consider the use of 
the <a href="#GET_005fCOMMAND_005fARGUMENT">GET_COMMAND_ARGUMENT</a> intrinsic defined by the Fortran 2003 
standard.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GETARG(POS, VALUE)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>POS</var></td><td width="70%">Shall be of type <code>INTEGER</code> and not wider than
the default integer kind; <em><var>POS</var> \geq 0</em></td></tr>
<tr><td width="15%"><var>VALUE</var></td><td width="70%">Shall be of type <code>CHARACTER</code> and of default
kind.</td></tr>
<tr><td width="15%"><var>VALUE</var></td><td width="70%">Shall be of type <code>CHARACTER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>After <code>GETARG</code> returns, the <var>VALUE</var> argument holds the
<var>POS</var>th command line argument. If <var>VALUE</var> can not hold the
argument, it is truncated to fit the length of <var>VALUE</var>. If there are
less than <var>POS</var> arguments specified at the command line, <var>VALUE</var>
will be filled with blanks. If <em><var>POS</var> = 0</em>, <var>VALUE</var> is set
to the name of the program (on systems that support this feature).
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_getarg
  INTEGER :: i
  CHARACTER(len=32) :: arg

  DO i = 1, iargc()
    CALL getarg(i, arg)
    WRITE (*,*) arg
  END DO
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>GNU Fortran 77 compatibility function: <a href="#IARGC">IARGC</a>
</p>
<p>Fortran 2003 functions and subroutines: <a href="#GET_005fCOMMAND">GET_COMMAND</a>,
<a href="#GET_005fCOMMAND_005fARGUMENT">GET_COMMAND_ARGUMENT</a>, <a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a>
</p></dd>
</dl>



<hr>
<a name="GET_005fCOMMAND"></a>
<div class="header">
<p>
Next: <a href="#GET_005fCOMMAND_005fARGUMENT" accesskey="n" rel="next">GET_COMMAND_ARGUMENT</a>, Previous: <a href="#GETARG" accesskey="p" rel="prev">GETARG</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GET_005fCOMMAND-_002d_002d_002d-Get-the-entire-command-line"></a>
<h3 class="section">7.88 <code>GET_COMMAND</code> &mdash; Get the entire command line</h3>
<a name="index-GET_005fCOMMAND"></a>
<a name="index-command_002dline-arguments-2"></a>
<a name="index-arguments_002c-to-program-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Retrieve the entire command line that was used to invoke the program.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GET_COMMAND(COMMAND)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>COMMAND</var></td><td width="70%">Shall be of type <code>CHARACTER</code> and of default
kind.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Stores the entire command line that was used to invoke the program in
<var>COMMAND</var>. If <var>COMMAND</var> is not large enough, the command will be
truncated. 
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_get_command
  CHARACTER(len=255) :: cmd
  CALL get_command(cmd)
  WRITE (*,*) TRIM(cmd)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GET_005fCOMMAND_005fARGUMENT">GET_COMMAND_ARGUMENT</a>, <a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a>
</p></dd>
</dl>



<hr>
<a name="GET_005fCOMMAND_005fARGUMENT"></a>
<div class="header">
<p>
Next: <a href="#GETCWD" accesskey="n" rel="next">GETCWD</a>, Previous: <a href="#GET_005fCOMMAND" accesskey="p" rel="prev">GET_COMMAND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GET_005fCOMMAND_005fARGUMENT-_002d_002d_002d-Get-command-line-arguments"></a>
<h3 class="section">7.89 <code>GET_COMMAND_ARGUMENT</code> &mdash; Get command line arguments</h3>
<a name="index-GET_005fCOMMAND_005fARGUMENT"></a>
<a name="index-command_002dline-arguments-3"></a>
<a name="index-arguments_002c-to-program-3"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Retrieve the <var>NUMBER</var>-th argument that was passed on the
command line when the containing program was invoked.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GET_COMMAND_ARGUMENT(NUMBER [, VALUE, LENGTH, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>NUMBER</var></td><td width="70%">Shall be a scalar of type <code>INTEGER(4)</code>,
<em><var>NUMBER</var> \geq 0</em></td></tr>
<tr><td width="15%"><var>VALUE</var></td><td width="70%">Shall be a scalar of type <code>CHARACTER</code>
and of default kind.</td></tr>
<tr><td width="15%"><var>LENGTH</var></td><td width="70%">(Option) Shall be a scalar of type <code>INTEGER(4)</code>.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Option) Shall be a scalar of type <code>INTEGER(4)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>After <code>GET_COMMAND_ARGUMENT</code> returns, the <var>VALUE</var> argument holds the 
<var>NUMBER</var>-th command line argument. If <var>VALUE</var> can not hold the argument, it is 
truncated to fit the length of <var>VALUE</var>. If there are less than <var>NUMBER</var>
arguments specified at the command line, <var>VALUE</var> will be filled with blanks. 
If <em><var>NUMBER</var> = 0</em>, <var>VALUE</var> is set to the name of the program (on
systems that support this feature). The <var>LENGTH</var> argument contains the
length of the <var>NUMBER</var>-th command line argument. If the argument retrieval
fails, <var>STATUS</var> is a positive number; if <var>VALUE</var> contains a truncated
command line argument, <var>STATUS</var> is -1; and otherwise the <var>STATUS</var> is
zero.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_get_command_argument
  INTEGER :: i
  CHARACTER(len=32) :: arg

  i = 0
  DO
    CALL get_command_argument(i, arg)
    IF (LEN_TRIM(arg) == 0) EXIT

    WRITE (*,*) TRIM(arg)
    i = i+1
  END DO
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GET_005fCOMMAND">GET_COMMAND</a>, <a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a>
</p></dd>
</dl>



<hr>
<a name="GETCWD"></a>
<div class="header">
<p>
Next: <a href="#GETENV" accesskey="n" rel="next">GETENV</a>, Previous: <a href="#GET_005fCOMMAND_005fARGUMENT" accesskey="p" rel="prev">GET_COMMAND_ARGUMENT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GETCWD-_002d_002d_002d-Get-current-working-directory"></a>
<h3 class="section">7.90 <code>GETCWD</code> &mdash; Get current working directory</h3>
<a name="index-GETCWD"></a>
<a name="index-system_002c-working-directory-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Get current working directory.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GETCWD(C [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">The type shall be <code>CHARACTER</code> and of default kind.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag. Returns 0 on success, 
a system specific and nonzero error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_getcwd
  CHARACTER(len=255) :: cwd
  CALL getcwd(cwd)
  WRITE(*,*) TRIM(cwd)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CHDIR">CHDIR</a>
</p></dd>
</dl>



<hr>
<a name="GETENV"></a>
<div class="header">
<p>
Next: <a href="#GET_005fENVIRONMENT_005fVARIABLE" accesskey="n" rel="next">GET_ENVIRONMENT_VARIABLE</a>, Previous: <a href="#GETCWD" accesskey="p" rel="prev">GETCWD</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GETENV-_002d_002d_002d-Get-an-environmental-variable"></a>
<h3 class="section">7.91 <code>GETENV</code> &mdash; Get an environmental variable</h3>
<a name="index-GETENV"></a>
<a name="index-environment-variable-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Get the <var>VALUE</var> of the environmental variable <var>NAME</var>.
</p>
<p>This intrinsic routine is provided for backwards compatibility with 
GNU Fortran 77.  In new code, programmers should consider the use of 
the <a href="#GET_005fENVIRONMENT_005fVARIABLE">GET_ENVIRONMENT_VARIABLE</a> intrinsic defined by the Fortran
2003 standard.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GETENV(NAME, VALUE)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>NAME</var></td><td width="70%">Shall be of type <code>CHARACTER</code> and of default kind.</td></tr>
<tr><td width="15%"><var>VALUE</var></td><td width="70%">Shall be of type <code>CHARACTER</code> and of default kind.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Stores the value of <var>NAME</var> in <var>VALUE</var>. If <var>VALUE</var> is 
not large enough to hold the data, it is truncated. If <var>NAME</var>
is not set, <var>VALUE</var> will be filled with blanks.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_getenv
  CHARACTER(len=255) :: homedir
  CALL getenv(&quot;HOME&quot;, homedir)
  WRITE (*,*) TRIM(homedir)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GET_005fENVIRONMENT_005fVARIABLE">GET_ENVIRONMENT_VARIABLE</a>
</p></dd>
</dl>



<hr>
<a name="GET_005fENVIRONMENT_005fVARIABLE"></a>
<div class="header">
<p>
Next: <a href="#GETGID" accesskey="n" rel="next">GETGID</a>, Previous: <a href="#GETENV" accesskey="p" rel="prev">GETENV</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GET_005fENVIRONMENT_005fVARIABLE-_002d_002d_002d-Get-an-environmental-variable"></a>
<h3 class="section">7.92 <code>GET_ENVIRONMENT_VARIABLE</code> &mdash; Get an environmental variable</h3>
<a name="index-GET_005fENVIRONMENT_005fVARIABLE"></a>
<a name="index-environment-variable-3"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Get the <var>VALUE</var> of the environmental variable <var>NAME</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GET_ENVIRONMENT_VARIABLE(NAME[, VALUE, LENGTH, STATUS, TRIM_NAME)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>NAME</var></td><td width="70%">Shall be a scalar of type <code>CHARACTER(1)</code>.</td></tr>
<tr><td width="15%"><var>VALUE</var></td><td width="70%">Shall be a scalar of type <code>CHARACTER(1)</code>.</td></tr>
<tr><td width="15%"><var>LENGTH</var></td><td width="70%">Shall be a scalar of type <code>INTEGER(4)</code>.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">Shall be a scalar of type <code>INTEGER(4)</code>.</td></tr>
<tr><td width="15%"><var>TRIM_NAME</var></td><td width="70%">Shall be a scalar of type <code>LOGICAL(4)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Stores the value of <var>NAME</var> in <var>VALUE</var>. If <var>VALUE</var> is 
not large enough to hold the data, it is truncated. If <var>NAME</var>
is not set, <var>VALUE</var> will be filled with blanks. Argument <var>LENGTH</var>
contains the length needed for storing the environment variable <var>NAME</var>
or zero if it is not present. <var>STATUS</var> is -1 if <var>VALUE</var> is present
but too short for the environment variable; it is 1 if the environment
variable does not exist and 2 if the processor does not support environment
variables; in all other cases <var>STATUS</var> is zero. If <var>TRIM_NAME</var> is
present with the value <code>.FALSE.</code>, the trailing blanks in <var>NAME</var>
are significant; otherwise they are not part of the environment variable
name.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_getenv
  CHARACTER(len=255) :: homedir
  CALL get_environment_variable(&quot;HOME&quot;, homedir)
  WRITE (*,*) TRIM(homedir)
END PROGRAM
</pre></div>
</dd>
</dl>



<hr>
<a name="GETGID"></a>
<div class="header">
<p>
Next: <a href="#GETLOG" accesskey="n" rel="next">GETLOG</a>, Previous: <a href="#GET_005fENVIRONMENT_005fVARIABLE" accesskey="p" rel="prev">GET_ENVIRONMENT_VARIABLE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GETGID-_002d_002d_002d-Group-ID-function"></a>
<h3 class="section">7.93 <code>GETGID</code> &mdash; Group ID function</h3>
<a name="index-GETGID"></a>
<a name="index-system_002c-group-id"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the numerical group ID of the current process.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = GETGID()</code>
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value of <code>GETGID</code> is an <code>INTEGER</code> of the default
kind.
</p>

</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <code>GETPID</code> for an example.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GETPID">GETPID</a>, <a href="#GETUID">GETUID</a>
</p></dd>
</dl>



<hr>
<a name="GETLOG"></a>
<div class="header">
<p>
Next: <a href="#GETPID" accesskey="n" rel="next">GETPID</a>, Previous: <a href="#GETGID" accesskey="p" rel="prev">GETGID</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GETLOG-_002d_002d_002d-Get-login-name"></a>
<h3 class="section">7.94 <code>GETLOG</code> &mdash; Get login name</h3>
<a name="index-GETLOG"></a>
<a name="index-system_002c-login-name"></a>
<a name="index-login-name"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Gets the username under which the program is running.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GETLOG(C)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">Shall be of type <code>CHARACTER</code> and of default kind.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Stores the current user name in <var>LOGIN</var>.  (On systems where POSIX
functions <code>geteuid</code> and <code>getpwuid</code> are not available, and 
the <code>getlogin</code> function is not implemented either, this will
return a blank string.)
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM TEST_GETLOG
  CHARACTER(32) :: login
  CALL GETLOG(login)
  WRITE(*,*) login
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GETUID">GETUID</a>
</p></dd>
</dl>



<hr>
<a name="GETPID"></a>
<div class="header">
<p>
Next: <a href="#GETUID" accesskey="n" rel="next">GETUID</a>, Previous: <a href="#GETLOG" accesskey="p" rel="prev">GETLOG</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GETPID-_002d_002d_002d-Process-ID-function"></a>
<h3 class="section">7.95 <code>GETPID</code> &mdash; Process ID function</h3>
<a name="index-GETPID"></a>
<a name="index-system_002c-process-id"></a>
<a name="index-process-id"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the numerical process identifier of the current process.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = GETPID()</code>
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value of <code>GETPID</code> is an <code>INTEGER</code> of the default
kind.
</p>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program info
  print *, &quot;The current process ID is &quot;, getpid()
  print *, &quot;Your numerical user ID is &quot;, getuid()
  print *, &quot;Your numerical group ID is &quot;, getgid()
end program info
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GETGID">GETGID</a>, <a href="#GETUID">GETUID</a>
</p></dd>
</dl>



<hr>
<a name="GETUID"></a>
<div class="header">
<p>
Next: <a href="#GMTIME" accesskey="n" rel="next">GMTIME</a>, Previous: <a href="#GETPID" accesskey="p" rel="prev">GETPID</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GETUID-_002d_002d_002d-User-ID-function"></a>
<h3 class="section">7.96 <code>GETUID</code> &mdash; User ID function</h3>
<a name="index-GETUID"></a>
<a name="index-system_002c-user-id"></a>
<a name="index-user-id"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the numerical user ID of the current process.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = GETUID()</code>
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value of <code>GETUID</code> is an <code>INTEGER</code> of the default
kind.
</p>

</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <code>GETPID</code> for an example.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#GETPID">GETPID</a>, <a href="#GETLOG">GETLOG</a>
</p></dd>
</dl>



<hr>
<a name="GMTIME"></a>
<div class="header">
<p>
Next: <a href="#HOSTNM" accesskey="n" rel="next">HOSTNM</a>, Previous: <a href="#GETUID" accesskey="p" rel="prev">GETUID</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GMTIME-_002d_002d_002d-Convert-time-to-GMT-info"></a>
<h3 class="section">7.97 <code>GMTIME</code> &mdash; Convert time to GMT info</h3>
<a name="index-GMTIME"></a>
<a name="index-time_002c-conversion-to-GMT-info"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Given a system time value <var>TIME</var> (as provided by the <code>TIME8()</code>
intrinsic), fills <var>VALUES</var> with values extracted from it appropriate
to the UTC time zone (Universal Coordinated Time, also known in some
countries as GMT, Greenwich Mean Time), using <code>gmtime(3)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL GMTIME(TIME, VALUES)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>TIME</var></td><td width="70%">An <code>INTEGER</code> scalar expression
corresponding to a system time, with <code>INTENT(IN)</code>.</td></tr>
<tr><td width="15%"><var>VALUES</var></td><td width="70%">A default <code>INTEGER</code> array with 9 elements,
with <code>INTENT(OUT)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The elements of <var>VALUES</var> are assigned as follows:
</p><ol>
<li> Seconds after the minute, range 0&ndash;59 or 0&ndash;61 to allow for leap
seconds
</li><li> Minutes after the hour, range 0&ndash;59
</li><li> Hours past midnight, range 0&ndash;23
</li><li> Day of month, range 0&ndash;31
</li><li> Number of months since January, range 0&ndash;12
</li><li> Years since 1900
</li><li> Number of days since Sunday, range 0&ndash;6
</li><li> Days since January 1
</li><li> Daylight savings indicator: positive if daylight savings is in
effect, zero if not, and negative if the information is not available.
</li></ol>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CTIME">CTIME</a>, <a href="#LTIME">LTIME</a>, <a href="#TIME">TIME</a>, <a href="#TIME8">TIME8</a>
</p>
</dd>
</dl>



<hr>
<a name="HOSTNM"></a>
<div class="header">
<p>
Next: <a href="#HUGE" accesskey="n" rel="next">HUGE</a>, Previous: <a href="#GMTIME" accesskey="p" rel="prev">GMTIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="HOSTNM-_002d_002d_002d-Get-system-host-name"></a>
<h3 class="section">7.98 <code>HOSTNM</code> &mdash; Get system host name</h3>
<a name="index-HOSTNM"></a>
<a name="index-system_002c-host-name"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Retrieves the host name of the system on which the program is running.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL HOSTNM(C [, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = HOSTNM(NAME)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">Shall of type <code>CHARACTER</code> and of default kind.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER</code>.
Returns 0 on success, or a system specific error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>In either syntax, <var>NAME</var> is set to the current hostname if it can
be obtained, or to a blank string otherwise.
</p>
</dd>
</dl>



<hr>
<a name="HUGE"></a>
<div class="header">
<p>
Next: <a href="#HYPOT" accesskey="n" rel="next">HYPOT</a>, Previous: <a href="#HOSTNM" accesskey="p" rel="prev">HOSTNM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="HUGE-_002d_002d_002d-Largest-number-of-a-kind"></a>
<h3 class="section">7.99 <code>HUGE</code> &mdash; Largest number of a kind</h3>
<a name="index-HUGE"></a>
<a name="index-limits_002c-largest-number"></a>
<a name="index-model-representation_002c-largest-number"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>HUGE(X)</code> returns the largest number that is not an infinity in
the model of the type of <code>X</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = HUGE(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code> or <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type and kind as <var>X</var>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_huge_tiny
  print *, huge(0), huge(0.0), huge(0.0d0)
  print *, tiny(0.0), tiny(0.0d0)
end program test_huge_tiny
</pre></div>
</dd>
</dl>



<hr>
<a name="HYPOT"></a>
<div class="header">
<p>
Next: <a href="#IACHAR" accesskey="n" rel="next">IACHAR</a>, Previous: <a href="#HUGE" accesskey="p" rel="prev">HUGE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="HYPOT-_002d_002d_002d-Euclidean-distance-function"></a>
<h3 class="section">7.100 <code>HYPOT</code> &mdash; Euclidean distance function</h3>
<a name="index-HYPOT"></a>
<a name="index-Euclidean-distance"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>HYPOT(X,Y)</code> is the Euclidean distance function. It is equal to
<em>\sqrt{X^2 + Y^2}</em>, without undue underflow or overflow.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = HYPOT(X, Y)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>Y</var></td><td width="70%">The type and kind type parameter shall be the same as
<var>X</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value has the same type and kind type parameter as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_hypot
  real(4) :: x = 1.e0_4, y = 0.5e0_4
  x = hypot(x,y)
end program test_hypot
</pre></div>
</dd>
</dl>



<hr>
<a name="IACHAR"></a>
<div class="header">
<p>
Next: <a href="#IAND" accesskey="n" rel="next">IAND</a>, Previous: <a href="#HYPOT" accesskey="p" rel="prev">HYPOT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IACHAR-_002d_002d_002d-Code-in-ASCII-collating-sequence"></a>
<h3 class="section">7.101 <code>IACHAR</code> &mdash; Code in <acronym>ASCII</acronym> collating sequence</h3>
<a name="index-IACHAR"></a>
<a name="index-ASCII-collating-sequence-1"></a>
<a name="index-collating-sequence_002c-ASCII-1"></a>
<a name="index-conversion_002c-to-integer-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IACHAR(C)</code> returns the code for the <acronym>ASCII</acronym> character
in the first character position of <code>C</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IACHAR(C [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">Shall be a scalar <code>CHARACTER</code>, with <code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_iachar
  integer i
  i = iachar(' ')
end program test_iachar
</pre></div>

</dd>
<dt><em>Note</em>:</dt>
<dd><p>See <a href="#ICHAR">ICHAR</a> for a discussion of converting between numerical values
and formatted string representations.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ACHAR">ACHAR</a>, <a href="#CHAR">CHAR</a>, <a href="#ICHAR">ICHAR</a>
</p>
</dd>
</dl>



<hr>
<a name="IAND"></a>
<div class="header">
<p>
Next: <a href="#IARGC" accesskey="n" rel="next">IARGC</a>, Previous: <a href="#IACHAR" accesskey="p" rel="prev">IACHAR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IAND-_002d_002d_002d-Bitwise-logical-and"></a>
<h3 class="section">7.102 <code>IAND</code> &mdash; Bitwise logical and</h3>
<a name="index-IAND"></a>
<a name="index-bitwise-logical-and-1"></a>
<a name="index-logical-and_002c-bitwise-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Bitwise logical <code>AND</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IAND(I, J)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>J</var></td><td width="70%">The type shall be <code>INTEGER</code>, of the same
kind as <var>I</var>.  (As a GNU extension, different kinds are also 
permitted.)</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return type is <code>INTEGER</code>, of the same kind as the
arguments.  (If the argument kinds differ, it is of the same kind as
the larger argument.)
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_iand
  INTEGER :: a, b
  DATA a / Z'F' /, b / Z'3' /
  WRITE (*,*) IAND(a, b)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IOR">IOR</a>, <a href="#IEOR">IEOR</a>, <a href="#IBITS">IBITS</a>, <a href="#IBSET">IBSET</a>, <a href="#IBCLR">IBCLR</a>, <a href="#NOT">NOT</a>
</p>
</dd>
</dl>



<hr>
<a name="IARGC"></a>
<div class="header">
<p>
Next: <a href="#IBCLR" accesskey="n" rel="next">IBCLR</a>, Previous: <a href="#IAND" accesskey="p" rel="prev">IAND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IARGC-_002d_002d_002d-Get-the-number-of-command-line-arguments"></a>
<h3 class="section">7.103 <code>IARGC</code> &mdash; Get the number of command line arguments</h3>
<a name="index-IARGC"></a>
<a name="index-command_002dline-arguments-4"></a>
<a name="index-command_002dline-arguments_002c-number-of-1"></a>
<a name="index-arguments_002c-to-program-4"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IARGC()</code> returns the number of arguments passed on the
command line when the containing program was invoked.
</p>
<p>This intrinsic routine is provided for backwards compatibility with 
GNU Fortran 77.  In new code, programmers should consider the use of 
the <a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a> intrinsic defined by the Fortran 2003 
standard.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IARGC()</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><p>None.
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The number of command line arguments, type <code>INTEGER(4)</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <a href="#GETARG">GETARG</a>
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p>GNU Fortran 77 compatibility subroutine: <a href="#GETARG">GETARG</a>
</p>
<p>Fortran 2003 functions and subroutines: <a href="#GET_005fCOMMAND">GET_COMMAND</a>,
<a href="#GET_005fCOMMAND_005fARGUMENT">GET_COMMAND_ARGUMENT</a>, <a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a>
</p></dd>
</dl>



<hr>
<a name="IBCLR"></a>
<div class="header">
<p>
Next: <a href="#IBITS" accesskey="n" rel="next">IBITS</a>, Previous: <a href="#IARGC" accesskey="p" rel="prev">IARGC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IBCLR-_002d_002d_002d-Clear-bit"></a>
<h3 class="section">7.104 <code>IBCLR</code> &mdash; Clear bit</h3>
<a name="index-IBCLR"></a>
<a name="index-bits_002c-unset"></a>
<a name="index-bits_002c-clear"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IBCLR</code> returns the value of <var>I</var> with the bit at position
<var>POS</var> set to zero.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IBCLR(I, POS)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>POS</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the same kind as
<var>I</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IBITS">IBITS</a>, <a href="#IBSET">IBSET</a>, <a href="#IAND">IAND</a>, <a href="#IOR">IOR</a>, <a href="#IEOR">IEOR</a>, <a href="#MVBITS">MVBITS</a>
</p>
</dd>
</dl>



<hr>
<a name="IBITS"></a>
<div class="header">
<p>
Next: <a href="#IBSET" accesskey="n" rel="next">IBSET</a>, Previous: <a href="#IBCLR" accesskey="p" rel="prev">IBCLR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IBITS-_002d_002d_002d-Bit-extraction"></a>
<h3 class="section">7.105 <code>IBITS</code> &mdash; Bit extraction</h3>
<a name="index-IBITS"></a>
<a name="index-bits_002c-get"></a>
<a name="index-bits_002c-extract"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IBITS</code> extracts a field of length <var>LEN</var> from <var>I</var>,
starting from bit position <var>POS</var> and extending left for <var>LEN</var>
bits.  The result is right-justified and the remaining bits are
zeroed.  The value of <code>POS+LEN</code> must be less than or equal to the
value <code>BIT_SIZE(I)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IBITS(I, POS, LEN)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>POS</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>LEN</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the same kind as
<var>I</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#BIT_005fSIZE">BIT_SIZE</a>, <a href="#IBCLR">IBCLR</a>, <a href="#IBSET">IBSET</a>, <a href="#IAND">IAND</a>, <a href="#IOR">IOR</a>, <a href="#IEOR">IEOR</a>
</p></dd>
</dl>



<hr>
<a name="IBSET"></a>
<div class="header">
<p>
Next: <a href="#ICHAR" accesskey="n" rel="next">ICHAR</a>, Previous: <a href="#IBITS" accesskey="p" rel="prev">IBITS</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IBSET-_002d_002d_002d-Set-bit"></a>
<h3 class="section">7.106 <code>IBSET</code> &mdash; Set bit</h3>
<a name="index-IBSET"></a>
<a name="index-bits_002c-set"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IBSET</code> returns the value of <var>I</var> with the bit at position
<var>POS</var> set to one.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IBSET(I, POS)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>POS</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the same kind as
<var>I</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IBCLR">IBCLR</a>, <a href="#IBITS">IBITS</a>, <a href="#IAND">IAND</a>, <a href="#IOR">IOR</a>, <a href="#IEOR">IEOR</a>, <a href="#MVBITS">MVBITS</a>
</p>
</dd>
</dl>



<hr>
<a name="ICHAR"></a>
<div class="header">
<p>
Next: <a href="#IDATE" accesskey="n" rel="next">IDATE</a>, Previous: <a href="#IBSET" accesskey="p" rel="prev">IBSET</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ICHAR-_002d_002d_002d-Character_002dto_002dinteger-conversion-function"></a>
<h3 class="section">7.107 <code>ICHAR</code> &mdash; Character-to-integer conversion function</h3>
<a name="index-ICHAR"></a>
<a name="index-conversion_002c-to-integer-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ICHAR(C)</code> returns the code for the character in the first character
position of <code>C</code> in the system&rsquo;s native character set.
The correspondence between characters and their codes is not necessarily
the same across different GNU Fortran implementations.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortan 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ICHAR(C [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">Shall be a scalar <code>CHARACTER</code>, with <code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_ichar
  integer i
  i = ichar(' ')
end program test_ichar
</pre></div>

</dd>
<dt><em>Note</em>:</dt>
<dd><p>No intrinsic exists to convert between a numeric value and a formatted
character string representation &ndash; for instance, given the
<code>CHARACTER</code> value <code>'154'</code>, obtaining an <code>INTEGER</code> or
<code>REAL</code> value with the value 154, or vice versa. Instead, this
functionality is provided by internal-file I/O, as in the following
example:
</p><div class="smallexample">
<pre class="smallexample">program read_val
  integer value
  character(len=10) string, string2
  string = '154'
  
  ! Convert a string to a numeric value
  read (string,'(I10)') value
  print *, value
  
  ! Convert a value to a formatted string
  write (string2,'(I10)') value
  print *, string2
end program read_val
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ACHAR">ACHAR</a>, <a href="#CHAR">CHAR</a>, <a href="#IACHAR">IACHAR</a>
</p>
</dd>
</dl>



<hr>
<a name="IDATE"></a>
<div class="header">
<p>
Next: <a href="#IEOR" accesskey="n" rel="next">IEOR</a>, Previous: <a href="#ICHAR" accesskey="p" rel="prev">ICHAR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IDATE-_002d_002d_002d-Get-current-local-time-subroutine-_0028day_002fmonth_002fyear_0029"></a>
<h3 class="section">7.108 <code>IDATE</code> &mdash; Get current local time subroutine (day/month/year)</h3>
<a name="index-IDATE"></a>
<a name="index-date_002c-current-2"></a>
<a name="index-current-date-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IDATE(TARRAY)</code> Fills <var>TARRAY</var> with the numerical values at the  
current local time. The day (in the range 1-31), month (in the range 1-12), 
and year appear in elements 1, 2, and 3 of <var>TARRAY</var>, respectively. 
The year has four significant digits.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL IDATE(VALUES)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>VALUES</var></td><td width="70%">The type shall be <code>INTEGER, DIMENSION(3)</code> and
the kind shall be the default integer kind.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Does not return anything.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_idate
  integer, dimension(3) :: tarray
  call idate(tarray)
  print *, tarray(1)
  print *, tarray(2)
  print *, tarray(3)
end program test_idate
</pre></div>
</dd>
</dl>



<hr>
<a name="IEOR"></a>
<div class="header">
<p>
Next: <a href="#IERRNO" accesskey="n" rel="next">IERRNO</a>, Previous: <a href="#IDATE" accesskey="p" rel="prev">IDATE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IEOR-_002d_002d_002d-Bitwise-logical-exclusive-or"></a>
<h3 class="section">7.109 <code>IEOR</code> &mdash; Bitwise logical exclusive or</h3>
<a name="index-IEOR"></a>
<a name="index-bitwise-logical-exclusive-or"></a>
<a name="index-logical-exclusive-or_002c-bitwise"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IEOR</code> returns the bitwise boolean exclusive-OR of <var>I</var> and
<var>J</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IEOR(I, J)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>J</var></td><td width="70%">The type shall be <code>INTEGER</code>, of the same
kind as <var>I</var>.  (As a GNU extension, different kinds are also 
permitted.)</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return type is <code>INTEGER</code>, of the same kind as the
arguments.  (If the argument kinds differ, it is of the same kind as
the larger argument.)
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IOR">IOR</a>, <a href="#IAND">IAND</a>, <a href="#IBITS">IBITS</a>, <a href="#IBSET">IBSET</a>, <a href="#IBCLR">IBCLR</a>, <a href="#NOT">NOT</a>
</p></dd>
</dl>



<hr>
<a name="IERRNO"></a>
<div class="header">
<p>
Next: <a href="#INDEX-intrinsic" accesskey="n" rel="next">INDEX intrinsic</a>, Previous: <a href="#IEOR" accesskey="p" rel="prev">IEOR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IERRNO-_002d_002d_002d-Get-the-last-system-error-number"></a>
<h3 class="section">7.110 <code>IERRNO</code> &mdash; Get the last system error number</h3>
<a name="index-IERRNO"></a>
<a name="index-system_002c-error-handling-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the last system error number, as given by the C <code>errno()</code>
function.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IERRNO()</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><p>None.
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the default integer
kind.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#PERROR">PERROR</a>
</p></dd>
</dl>



<hr>
<a name="INDEX-intrinsic"></a>
<div class="header">
<p>
Next: <a href="#INT" accesskey="n" rel="next">INT</a>, Previous: <a href="#IERRNO" accesskey="p" rel="prev">IERRNO</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="INDEX-_002d_002d_002d-Position-of-a-substring-within-a-string"></a>
<h3 class="section">7.111 <code>INDEX</code> &mdash; Position of a substring within a string</h3>
<a name="index-INDEX"></a>
<a name="index-substring-position"></a>
<a name="index-string_002c-find-substring"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the position of the start of the first occurrence of string
<var>SUBSTRING</var> as a substring in <var>STRING</var>, counting from one.  If
<var>SUBSTRING</var> is not present in <var>STRING</var>, zero is returned.  If 
the <var>BACK</var> argument is present and true, the return value is the
start of the last occurrence rather than the first.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = INDEX(STRING, SUBSTRING [, BACK [, KIND]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">Shall be a scalar <code>CHARACTER</code>, with
<code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>SUBSTRING</var></td><td width="70%">Shall be a scalar <code>CHARACTER</code>, with
<code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>BACK</var></td><td width="70%">(Optional) Shall be a scalar <code>LOGICAL</code>, with
<code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SCAN">SCAN</a>, <a href="#VERIFY">VERIFY</a>
</p></dd>
</dl>



<hr>
<a name="INT"></a>
<div class="header">
<p>
Next: <a href="#INT2" accesskey="n" rel="next">INT2</a>, Previous: <a href="#INDEX-intrinsic" accesskey="p" rel="prev">INDEX intrinsic</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="INT-_002d_002d_002d-Convert-to-integer-type"></a>
<h3 class="section">7.112 <code>INT</code> &mdash; Convert to integer type</h3>
<a name="index-INT"></a>
<a name="index-IFIX"></a>
<a name="index-IDINT"></a>
<a name="index-conversion_002c-to-integer-3"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Convert to integer type
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = INT(A [, KIND))</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">Shall be of type <code>INTEGER</code>,
<code>REAL</code>, or <code>COMPLEX</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>These functions return a <code>INTEGER</code> variable or array under 
the following rules: 
</p>
<dl compact="compact">
<dt>(A)</dt>
<dd><p>If <var>A</var> is of type <code>INTEGER</code>, <code>INT(A) = A</code> 
</p></dd>
<dt>(B)</dt>
<dd><p>If <var>A</var> is of type <code>REAL</code> and <em>|A| &lt; 1</em>, <code>INT(A)</code> equals <code>0</code>. 
If <em>|A| \geq 1</em>, then <code>INT(A)</code> equals the largest integer that does not exceed 
the range of <var>A</var> and whose sign is the same as the sign of <var>A</var>.
</p></dd>
<dt>(C)</dt>
<dd><p>If <var>A</var> is of type <code>COMPLEX</code>, rule B is applied to the real part of <var>A</var>.
</p></dd>
</dl>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_int
  integer :: i = 42
  complex :: z = (-3.7, 1.0)
  print *, int(i)
  print *, int(z), int(z,8)
end program
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>IFIX(A)</code></td><td width="20%"><code>REAL(4) A</code></td><td width="20%"><code>INTEGER</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>IDINT(A)</code></td><td width="20%"><code>REAL(8) A</code></td><td width="20%"><code>INTEGER</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>

</dd>
</dl>



<hr>
<a name="INT2"></a>
<div class="header">
<p>
Next: <a href="#INT8" accesskey="n" rel="next">INT8</a>, Previous: <a href="#INT" accesskey="p" rel="prev">INT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="INT2-_002d_002d_002d-Convert-to-16_002dbit-integer-type"></a>
<h3 class="section">7.113 <code>INT2</code> &mdash; Convert to 16-bit integer type</h3>
<a name="index-INT2"></a>
<a name="index-SHORT"></a>
<a name="index-conversion_002c-to-integer-4"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Convert to a <code>KIND=2</code> integer type. This is equivalent to the
standard <code>INT</code> intrinsic with an optional argument of
<code>KIND=2</code>, and is only included for backwards compatibility.
</p>
<p>The <code>SHORT</code> intrinsic is equivalent to <code>INT2</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = INT2(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">Shall be of type <code>INTEGER</code>,
<code>REAL</code>, or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a <code>INTEGER(2)</code> variable.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#INT">INT</a>, <a href="#INT8">INT8</a>, <a href="#LONG">LONG</a>
</p></dd>
</dl>



<hr>
<a name="INT8"></a>
<div class="header">
<p>
Next: <a href="#IOR" accesskey="n" rel="next">IOR</a>, Previous: <a href="#INT2" accesskey="p" rel="prev">INT2</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="INT8-_002d_002d_002d-Convert-to-64_002dbit-integer-type"></a>
<h3 class="section">7.114 <code>INT8</code> &mdash; Convert to 64-bit integer type</h3>
<a name="index-INT8"></a>
<a name="index-conversion_002c-to-integer-5"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Convert to a <code>KIND=8</code> integer type. This is equivalent to the
standard <code>INT</code> intrinsic with an optional argument of
<code>KIND=8</code>, and is only included for backwards compatibility.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = INT8(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">Shall be of type <code>INTEGER</code>,
<code>REAL</code>, or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a <code>INTEGER(8)</code> variable.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#INT">INT</a>, <a href="#INT2">INT2</a>, <a href="#LONG">LONG</a>
</p></dd>
</dl>



<hr>
<a name="IOR"></a>
<div class="header">
<p>
Next: <a href="#IRAND" accesskey="n" rel="next">IRAND</a>, Previous: <a href="#INT8" accesskey="p" rel="prev">INT8</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IOR-_002d_002d_002d-Bitwise-logical-or"></a>
<h3 class="section">7.115 <code>IOR</code> &mdash; Bitwise logical or</h3>
<a name="index-IOR"></a>
<a name="index-bitwise-logical-or"></a>
<a name="index-logical-or_002c-bitwise"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IOR</code> returns the bitwise boolean inclusive-OR of <var>I</var> and
<var>J</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IOR(I, J)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>J</var></td><td width="70%">The type shall be <code>INTEGER</code>, of the same
kind as <var>I</var>.  (As a GNU extension, different kinds are also 
permitted.)</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return type is <code>INTEGER</code>, of the same kind as the
arguments.  (If the argument kinds differ, it is of the same kind as
the larger argument.)
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IEOR">IEOR</a>, <a href="#IAND">IAND</a>, <a href="#IBITS">IBITS</a>, <a href="#IBSET">IBSET</a>, <a href="#IBCLR">IBCLR</a>, <a href="#NOT">NOT</a>
</p></dd>
</dl>



<hr>
<a name="IRAND"></a>
<div class="header">
<p>
Next: <a href="#IS_005fIOSTAT_005fEND" accesskey="n" rel="next">IS_IOSTAT_END</a>, Previous: <a href="#IOR" accesskey="p" rel="prev">IOR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IRAND-_002d_002d_002d-Integer-pseudo_002drandom-number"></a>
<h3 class="section">7.116 <code>IRAND</code> &mdash; Integer pseudo-random number</h3>
<a name="index-IRAND"></a>
<a name="index-random-number-generation"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IRAND(FLAG)</code> returns a pseudo-random number from a uniform
distribution between 0 and a system-dependent limit (which is in most
cases 2147483647). If <var>FLAG</var> is 0, the next number
in the current sequence is returned; if <var>FLAG</var> is 1, the generator
is restarted by <code>CALL SRAND(0)</code>; if <var>FLAG</var> has any other value,
it is used as a new seed with <code>SRAND</code>.
</p>
<p>This intrinsic routine is provided for backwards compatibility with
GNU Fortran 77. It implements a simple modulo generator as provided 
by <code>g77</code>. For new code, one should consider the use of 
<a href="#RANDOM_005fNUMBER">RANDOM_NUMBER</a> as it implements a superior algorithm.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IRAND(I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">Shall be a scalar <code>INTEGER</code> of kind 4.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of <code>INTEGER(kind=4)</code> type.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_irand
  integer,parameter :: seed = 86456
  
  call srand(seed)
  print *, irand(), irand(), irand(), irand()
  print *, irand(seed), irand(), irand(), irand()
end program test_irand
</pre></div>

</dd>
</dl>



<hr>
<a name="IS_005fIOSTAT_005fEND"></a>
<div class="header">
<p>
Next: <a href="#IS_005fIOSTAT_005fEOR" accesskey="n" rel="next">IS_IOSTAT_EOR</a>, Previous: <a href="#IRAND" accesskey="p" rel="prev">IRAND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IS_005fIOSTAT_005fEND-_002d_002d_002d-Test-for-end_002dof_002dfile-value"></a>
<h3 class="section">7.117 <code>IS_IOSTAT_END</code> &mdash; Test for end-of-file value</h3>
<a name="index-IS_005fIOSTAT_005fEND"></a>
<a name="index-IOSTAT_002c-end-of-file"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IS_IOSTAT_END</code> tests whether an variable has the value of the I/O
status &ldquo;end of file&rdquo;. The function is equivalent to comparing the variable
with the <code>IOSTAT_END</code> parameter of the intrinsic module
<code>ISO_FORTRAN_ENV</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IS_IOSTAT_END(I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">Shall be of the type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns a <code>LOGICAL</code> of the default kind, which <code>.TRUE.</code> if
<var>I</var> has the value which indicates an end of file condition for
IOSTAT= specifiers, and is <code>.FALSE.</code> otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM iostat
  IMPLICIT NONE
  INTEGER :: stat, i
  OPEN(88, FILE='test.dat')
  READ(88, *, IOSTAT=stat) i
  IF(IS_IOSTAT_END(stat)) STOP 'END OF FILE'
END PROGRAM
</pre></div>
</dd>
</dl>



<hr>
<a name="IS_005fIOSTAT_005fEOR"></a>
<div class="header">
<p>
Next: <a href="#ISATTY" accesskey="n" rel="next">ISATTY</a>, Previous: <a href="#IS_005fIOSTAT_005fEND" accesskey="p" rel="prev">IS_IOSTAT_END</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="IS_005fIOSTAT_005fEOR-_002d_002d_002d-Test-for-end_002dof_002drecord-value"></a>
<h3 class="section">7.118 <code>IS_IOSTAT_EOR</code> &mdash; Test for end-of-record value</h3>
<a name="index-IS_005fIOSTAT_005fEOR"></a>
<a name="index-IOSTAT_002c-end-of-record"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IS_IOSTAT_EOR</code> tests whether an variable has the value of the I/O
status &ldquo;end of record&rdquo;. The function is equivalent to comparing the
variable with the <code>IOSTAT_EOR</code> parameter of the intrinsic module
<code>ISO_FORTRAN_ENV</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = IS_IOSTAT_EOR(I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">Shall be of the type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns a <code>LOGICAL</code> of the default kind, which <code>.TRUE.</code> if
<var>I</var> has the value which indicates an end of file condition for
IOSTAT= specifiers, and is <code>.FALSE.</code> otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM iostat
  IMPLICIT NONE
  INTEGER :: stat, i(50)
  OPEN(88, FILE='test.dat', FORM='UNFORMATTED')
  READ(88, IOSTAT=stat) i
  IF(IS_IOSTAT_EOR(stat)) STOP 'END OF RECORD'
END PROGRAM
</pre></div>
</dd>
</dl>



<hr>
<a name="ISATTY"></a>
<div class="header">
<p>
Next: <a href="#ISHFT" accesskey="n" rel="next">ISHFT</a>, Previous: <a href="#IS_005fIOSTAT_005fEOR" accesskey="p" rel="prev">IS_IOSTAT_EOR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ISATTY-_002d_002d_002d-Whether-a-unit-is-a-terminal-device_002e"></a>
<h3 class="section">7.119 <code>ISATTY</code> &mdash; Whether a unit is a terminal device.</h3>
<a name="index-ISATTY"></a>
<a name="index-system_002c-terminal"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determine whether a unit is connected to a terminal device.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ISATTY(UNIT)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">Shall be a scalar <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns <code>.TRUE.</code> if the <var>UNIT</var> is connected to a terminal 
device, <code>.FALSE.</code> otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_isatty
  INTEGER(kind=1) :: unit
  DO unit = 1, 10
    write(*,*) isatty(unit=unit)
  END DO
END PROGRAM
</pre></div>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#TTYNAM">TTYNAM</a>
</p></dd>
</dl>



<hr>
<a name="ISHFT"></a>
<div class="header">
<p>
Next: <a href="#ISHFTC" accesskey="n" rel="next">ISHFTC</a>, Previous: <a href="#ISATTY" accesskey="p" rel="prev">ISATTY</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ISHFT-_002d_002d_002d-Shift-bits"></a>
<h3 class="section">7.120 <code>ISHFT</code> &mdash; Shift bits</h3>
<a name="index-ISHFT"></a>
<a name="index-bits_002c-shift"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ISHFT</code> returns a value corresponding to <var>I</var> with all of the
bits shifted <var>SHIFT</var> places.  A value of <var>SHIFT</var> greater than
zero corresponds to a left shift, a value of zero corresponds to no
shift, and a value less than zero corresponds to a right shift.  If the
absolute value of <var>SHIFT</var> is greater than <code>BIT_SIZE(I)</code>, the
value is undefined.  Bits shifted out from the left end or right end are
lost; zeros are shifted in from the opposite end.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ISHFT(I, SHIFT)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>SHIFT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the same kind as
<var>I</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ISHFTC">ISHFTC</a>
</p></dd>
</dl>



<hr>
<a name="ISHFTC"></a>
<div class="header">
<p>
Next: <a href="#ISNAN" accesskey="n" rel="next">ISNAN</a>, Previous: <a href="#ISHFT" accesskey="p" rel="prev">ISHFT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ISHFTC-_002d_002d_002d-Shift-bits-circularly"></a>
<h3 class="section">7.121 <code>ISHFTC</code> &mdash; Shift bits circularly</h3>
<a name="index-ISHFTC"></a>
<a name="index-bits_002c-shift-circular"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ISHFTC</code> returns a value corresponding to <var>I</var> with the
rightmost <var>SIZE</var> bits shifted circularly <var>SHIFT</var> places; that
is, bits shifted out one end are shifted into the opposite end.  A value
of <var>SHIFT</var> greater than zero corresponds to a left shift, a value of
zero corresponds to no shift, and a value less than zero corresponds to
a right shift.  The absolute value of <var>SHIFT</var> must be less than
<var>SIZE</var>.  If the <var>SIZE</var> argument is omitted, it is taken to be
equivalent to <code>BIT_SIZE(I)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = ISHFTC(I, SHIFT [, SIZE])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>SHIFT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>SIZE</var></td><td width="70%">(Optional) The type shall be <code>INTEGER</code>;
the value must be greater than zero and less than or equal to
<code>BIT_SIZE(I)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the same kind as
<var>I</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ISHFT">ISHFT</a>
</p></dd>
</dl>



<hr>
<a name="ISNAN"></a>
<div class="header">
<p>
Next: <a href="#ITIME" accesskey="n" rel="next">ITIME</a>, Previous: <a href="#ISHFTC" accesskey="p" rel="prev">ISHFTC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ISNAN-_002d_002d_002d-Test-for-a-NaN"></a>
<h3 class="section">7.122 <code>ISNAN</code> &mdash; Test for a NaN</h3>
<a name="index-ISNAN"></a>
<a name="index-IEEE_002c-ISNAN"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>ISNAN</code> tests whether a floating-point value is an IEEE
Not-a-Number (NaN).
</p></dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>ISNAN(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Variable of the type <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns a default-kind <code>LOGICAL</code>. The returned value is <code>TRUE</code>
if <var>X</var> is a NaN and <code>FALSE</code> otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_nan
  implicit none
  real :: x
  x = -1.0
  x = sqrt(x)
  if (isnan(x)) stop '&quot;x&quot; is a NaN'
end program test_nan
</pre></div>
</dd>
</dl>



<hr>
<a name="ITIME"></a>
<div class="header">
<p>
Next: <a href="#KILL" accesskey="n" rel="next">KILL</a>, Previous: <a href="#ISNAN" accesskey="p" rel="prev">ISNAN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="ITIME-_002d_002d_002d-Get-current-local-time-subroutine-_0028hour_002fminutes_002fseconds_0029"></a>
<h3 class="section">7.123 <code>ITIME</code> &mdash; Get current local time subroutine (hour/minutes/seconds)</h3>
<a name="index-ITIME"></a>
<a name="index-time_002c-current-2"></a>
<a name="index-current-time-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>IDATE(VALUES)</code> Fills <var>VALUES</var> with the numerical values at the  
current local time. The hour (in the range 1-24), minute (in the range 1-60), 
and seconds (in the range 1-60) appear in elements 1, 2, and 3 of <var>VALUES</var>, 
respectively.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL ITIME(VALUES)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>VALUES</var></td><td width="70%">The type shall be <code>INTEGER, DIMENSION(3)</code>
and the kind shall be the default integer kind.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Does not return anything.
</p>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_itime
  integer, dimension(3) :: tarray
  call itime(tarray)
  print *, tarray(1)
  print *, tarray(2)
  print *, tarray(3)
end program test_itime
</pre></div>
</dd>
</dl>



<hr>
<a name="KILL"></a>
<div class="header">
<p>
Next: <a href="#KIND" accesskey="n" rel="next">KIND</a>, Previous: <a href="#ITIME" accesskey="p" rel="prev">ITIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="KILL-_002d_002d_002d-Send-a-signal-to-a-process"></a>
<h3 class="section">7.124 <code>KILL</code> &mdash; Send a signal to a process</h3>
<a name="index-KILL"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dt><em>Standard</em>:</dt>
<dd><p>Sends the signal specified by <var>SIGNAL</var> to the process <var>PID</var>.
See <code>kill(2)</code>.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL KILL(C, VALUE [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">Shall be a scalar <code>INTEGER</code>, with
<code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>VALUE</var></td><td width="70%">Shall be a scalar <code>INTEGER</code>, with
<code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER(4)</code> or
<code>INTEGER(8)</code>. Returns 0 on success, or a system-specific error code
otherwise.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ABORT">ABORT</a>, <a href="#EXIT">EXIT</a>
</p></dd>
</dl>



<hr>
<a name="KIND"></a>
<div class="header">
<p>
Next: <a href="#LBOUND" accesskey="n" rel="next">LBOUND</a>, Previous: <a href="#KILL" accesskey="p" rel="prev">KILL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="KIND-_002d_002d_002d-Kind-of-an-entity"></a>
<h3 class="section">7.125 <code>KIND</code> &mdash; Kind of an entity</h3>
<a name="index-KIND"></a>
<a name="index-kind-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>KIND(X)</code> returns the kind value of the entity <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>K = KIND(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>LOGICAL</code>, <code>INTEGER</code>,
<code>REAL</code>, <code>COMPLEX</code> or <code>CHARACTER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>INTEGER</code> and of the default
integer kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_kind
  integer,parameter :: kc = kind(' ')
  integer,parameter :: kl = kind(.true.)

  print *, &quot;The default character kind is &quot;, kc
  print *, &quot;The default logical kind is &quot;, kl
end program test_kind
</pre></div>

</dd>
</dl>



<hr>
<a name="LBOUND"></a>
<div class="header">
<p>
Next: <a href="#LEADZ" accesskey="n" rel="next">LEADZ</a>, Previous: <a href="#KIND" accesskey="p" rel="prev">KIND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LBOUND-_002d_002d_002d-Lower-dimension-bounds-of-an-array"></a>
<h3 class="section">7.126 <code>LBOUND</code> &mdash; Lower dimension bounds of an array</h3>
<a name="index-LBOUND"></a>
<a name="index-array_002c-lower-bound"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the lower bounds of an array, or a single lower bound
along the <var>DIM</var> dimension.
</p></dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LBOUND(ARRAY [, DIM [, KIND]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array, of any type.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) Shall be a scalar <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
If <var>DIM</var> is absent, the result is an array of the lower bounds of
<var>ARRAY</var>.  If <var>DIM</var> is present, the result is a scalar
corresponding to the lower bound of the array along that dimension.  If
<var>ARRAY</var> is an expression rather than a whole array or array
structure component, or if it has a zero extent along the relevant
dimension, the lower bound is taken to be 1.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#UBOUND">UBOUND</a>
</p></dd>
</dl>



<hr>
<a name="LEADZ"></a>
<div class="header">
<p>
Next: <a href="#LEN" accesskey="n" rel="next">LEN</a>, Previous: <a href="#LBOUND" accesskey="p" rel="prev">LBOUND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LEADZ-_002d_002d_002d-Number-of-leading-zero-bits-of-an-integer"></a>
<h3 class="section">7.127 <code>LEADZ</code> &mdash; Number of leading zero bits of an integer</h3>
<a name="index-LEADZ"></a>
<a name="index-zero-bits"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>LEADZ</code> returns the number of leading zero bits of an integer.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LEADZ(I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">Shall be of type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The type of the return value is the default <code>INTEGER</code>.
If all the bits of <code>I</code> are zero, the result value is <code>BIT_SIZE(I)</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_leadz
  WRITE (*,*) LEADZ(1)  ! prints 8 if BITSIZE(I) has the value 32
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#BIT_005fSIZE">BIT_SIZE</a>, <a href="#TRAILZ">TRAILZ</a>
</p></dd>
</dl>



<hr>
<a name="LEN"></a>
<div class="header">
<p>
Next: <a href="#LEN_005fTRIM" accesskey="n" rel="next">LEN_TRIM</a>, Previous: <a href="#LEADZ" accesskey="p" rel="prev">LEADZ</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LEN-_002d_002d_002d-Length-of-a-character-entity"></a>
<h3 class="section">7.128 <code>LEN</code> &mdash; Length of a character entity</h3>
<a name="index-LEN"></a>
<a name="index-string_002c-length"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the length of a character string.  If <var>STRING</var> is an array,
the length of an element of <var>STRING</var> is returned.  Note that
<var>STRING</var> need not be defined when this intrinsic is invoked, since
only the length, not the content, of <var>STRING</var> is needed.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>L = LEN(STRING [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">Shall be a scalar or array of type
<code>CHARACTER</code>, with <code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LEN_005fTRIM">LEN_TRIM</a>, <a href="#ADJUSTL">ADJUSTL</a>, <a href="#ADJUSTR">ADJUSTR</a>
</p></dd>
</dl>



<hr>
<a name="LEN_005fTRIM"></a>
<div class="header">
<p>
Next: <a href="#LGE" accesskey="n" rel="next">LGE</a>, Previous: <a href="#LEN" accesskey="p" rel="prev">LEN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LEN_005fTRIM-_002d_002d_002d-Length-of-a-character-entity-without-trailing-blank-characters"></a>
<h3 class="section">7.129 <code>LEN_TRIM</code> &mdash; Length of a character entity without trailing blank characters</h3>
<a name="index-LEN_005fTRIM"></a>
<a name="index-string_002c-length_002c-without-trailing-whitespace"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the length of a character string, ignoring any trailing blanks.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LEN_TRIM(STRING [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">Shall be a scalar of type <code>CHARACTER</code>,
with <code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LEN">LEN</a>, <a href="#ADJUSTL">ADJUSTL</a>, <a href="#ADJUSTR">ADJUSTR</a>
</p></dd>
</dl>



<hr>
<a name="LGE"></a>
<div class="header">
<p>
Next: <a href="#LGT" accesskey="n" rel="next">LGT</a>, Previous: <a href="#LEN_005fTRIM" accesskey="p" rel="prev">LEN_TRIM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LGE-_002d_002d_002d-Lexical-greater-than-or-equal"></a>
<h3 class="section">7.130 <code>LGE</code> &mdash; Lexical greater than or equal</h3>
<a name="index-LGE"></a>
<a name="index-lexical-comparison-of-strings"></a>
<a name="index-string_002c-comparison"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines whether one string is lexically greater than or equal to
another string, where the two strings are interpreted as containing
ASCII character codes.  If the String A and String B are not the same
length, the shorter is compared as if spaces were appended to it to form
a value that has the same length as the longer.
</p>
<p>In general, the lexical comparison intrinsics <code>LGE</code>, <code>LGT</code>,
<code>LLE</code>, and <code>LLT</code> differ from the corresponding intrinsic
operators <code>.GE.</code>, <code>.GT.</code>, <code>.LE.</code>, and <code>.LT.</code>, in
that the latter use the processor&rsquo;s character ordering (which is not
ASCII on some targets), whereas the former always use the ASCII
ordering.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LGE(STRING_A, STRING_B)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING_A</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STRING_B</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns <code>.TRUE.</code> if <code>STRING_A &gt;= STRING_B</code>, and <code>.FALSE.</code>
otherwise, based on the ASCII ordering.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LGT">LGT</a>, <a href="#LLE">LLE</a>, <a href="#LLT">LLT</a>
</p></dd>
</dl>



<hr>
<a name="LGT"></a>
<div class="header">
<p>
Next: <a href="#LINK" accesskey="n" rel="next">LINK</a>, Previous: <a href="#LGE" accesskey="p" rel="prev">LGE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LGT-_002d_002d_002d-Lexical-greater-than"></a>
<h3 class="section">7.131 <code>LGT</code> &mdash; Lexical greater than</h3>
<a name="index-LGT"></a>
<a name="index-lexical-comparison-of-strings-1"></a>
<a name="index-string_002c-comparison-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines whether one string is lexically greater than another string,
where the two strings are interpreted as containing ASCII character
codes.  If the String A and String B are not the same length, the
shorter is compared as if spaces were appended to it to form a value
that has the same length as the longer.
</p>
<p>In general, the lexical comparison intrinsics <code>LGE</code>, <code>LGT</code>,
<code>LLE</code>, and <code>LLT</code> differ from the corresponding intrinsic
operators <code>.GE.</code>, <code>.GT.</code>, <code>.LE.</code>, and <code>.LT.</code>, in
that the latter use the processor&rsquo;s character ordering (which is not
ASCII on some targets), whereas the former always use the ASCII
ordering.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LGT(STRING_A, STRING_B)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING_A</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STRING_B</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns <code>.TRUE.</code> if <code>STRING_A &gt; STRING_B</code>, and <code>.FALSE.</code>
otherwise, based on the ASCII ordering.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LGE">LGE</a>, <a href="#LLE">LLE</a>, <a href="#LLT">LLT</a>
</p></dd>
</dl>



<hr>
<a name="LINK"></a>
<div class="header">
<p>
Next: <a href="#LLE" accesskey="n" rel="next">LLE</a>, Previous: <a href="#LGT" accesskey="p" rel="prev">LGT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LINK-_002d_002d_002d-Create-a-hard-link"></a>
<h3 class="section">7.132 <code>LINK</code> &mdash; Create a hard link</h3>
<a name="index-LINK"></a>
<a name="index-file-system_002c-create-link"></a>
<a name="index-file-system_002c-hard-link"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Makes a (hard) link from file <var>PATH1</var> to <var>PATH2</var>. A null
character (<code>CHAR(0)</code>) can be used to mark the end of the names in
<var>PATH1</var> and <var>PATH2</var>; otherwise, trailing blanks in the file
names are ignored.  If the <var>STATUS</var> argument is supplied, it
contains 0 on success or a nonzero error code upon return; see
<code>link(2)</code>.
</p>
<p>This intrinsic is provided in both subroutine and function forms;
however, only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL LINK(PATH1, PATH2 [, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = LINK(PATH1, PATH2)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>PATH1</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>PATH2</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) Shall be of default <code>INTEGER</code> type.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SYMLNK">SYMLNK</a>, <a href="#UNLINK">UNLINK</a>
</p></dd>
</dl>



<hr>
<a name="LLE"></a>
<div class="header">
<p>
Next: <a href="#LLT" accesskey="n" rel="next">LLT</a>, Previous: <a href="#LINK" accesskey="p" rel="prev">LINK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LLE-_002d_002d_002d-Lexical-less-than-or-equal"></a>
<h3 class="section">7.133 <code>LLE</code> &mdash; Lexical less than or equal</h3>
<a name="index-LLE"></a>
<a name="index-lexical-comparison-of-strings-2"></a>
<a name="index-string_002c-comparison-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines whether one string is lexically less than or equal to another
string, where the two strings are interpreted as containing ASCII
character codes.  If the String A and String B are not the same length,
the shorter is compared as if spaces were appended to it to form a value
that has the same length as the longer.
</p>
<p>In general, the lexical comparison intrinsics <code>LGE</code>, <code>LGT</code>,
<code>LLE</code>, and <code>LLT</code> differ from the corresponding intrinsic
operators <code>.GE.</code>, <code>.GT.</code>, <code>.LE.</code>, and <code>.LT.</code>, in
that the latter use the processor&rsquo;s character ordering (which is not
ASCII on some targets), whereas the former always use the ASCII
ordering.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LLE(STRING_A, STRING_B)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING_A</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STRING_B</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns <code>.TRUE.</code> if <code>STRING_A &lt;= STRING_B</code>, and <code>.FALSE.</code>
otherwise, based on the ASCII ordering.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LGE">LGE</a>, <a href="#LGT">LGT</a>, <a href="#LLT">LLT</a>
</p></dd>
</dl>



<hr>
<a name="LLT"></a>
<div class="header">
<p>
Next: <a href="#LNBLNK" accesskey="n" rel="next">LNBLNK</a>, Previous: <a href="#LLE" accesskey="p" rel="prev">LLE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LLT-_002d_002d_002d-Lexical-less-than"></a>
<h3 class="section">7.134 <code>LLT</code> &mdash; Lexical less than</h3>
<a name="index-LLT"></a>
<a name="index-lexical-comparison-of-strings-3"></a>
<a name="index-string_002c-comparison-3"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines whether one string is lexically less than another string,
where the two strings are interpreted as containing ASCII character
codes.  If the String A and String B are not the same length, the
shorter is compared as if spaces were appended to it to form a value
that has the same length as the longer.
</p>
<p>In general, the lexical comparison intrinsics <code>LGE</code>, <code>LGT</code>,
<code>LLE</code>, and <code>LLT</code> differ from the corresponding intrinsic
operators <code>.GE.</code>, <code>.GT.</code>, <code>.LE.</code>, and <code>.LT.</code>, in
that the latter use the processor&rsquo;s character ordering (which is not
ASCII on some targets), whereas the former always use the ASCII
ordering.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LLT(STRING_A, STRING_B)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING_A</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STRING_B</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns <code>.TRUE.</code> if <code>STRING_A &lt; STRING_B</code>, and <code>.FALSE.</code>
otherwise, based on the ASCII ordering.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LGE">LGE</a>, <a href="#LGT">LGT</a>, <a href="#LLE">LLE</a>
</p></dd>
</dl>



<hr>
<a name="LNBLNK"></a>
<div class="header">
<p>
Next: <a href="#LOC" accesskey="n" rel="next">LOC</a>, Previous: <a href="#LLT" accesskey="p" rel="prev">LLT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LNBLNK-_002d_002d_002d-Index-of-the-last-non_002dblank-character-in-a-string"></a>
<h3 class="section">7.135 <code>LNBLNK</code> &mdash; Index of the last non-blank character in a string</h3>
<a name="index-LNBLNK"></a>
<a name="index-string_002c-find-non_002dblank-character"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the length of a character string, ignoring any trailing blanks.
This is identical to the standard <code>LEN_TRIM</code> intrinsic, and is only
included for backwards compatibility.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LNBLNK(STRING)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">Shall be a scalar of type <code>CHARACTER</code>,
with <code>INTENT(IN)</code></td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of <code>INTEGER(kind=4)</code> type.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#INDEX-intrinsic">INDEX intrinsic</a>, <a href="#LEN_005fTRIM">LEN_TRIM</a>
</p></dd>
</dl>



<hr>
<a name="LOC"></a>
<div class="header">
<p>
Next: <a href="#LOG" accesskey="n" rel="next">LOG</a>, Previous: <a href="#LNBLNK" accesskey="p" rel="prev">LNBLNK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LOC-_002d_002d_002d-Returns-the-address-of-a-variable"></a>
<h3 class="section">7.136 <code>LOC</code> &mdash; Returns the address of a variable</h3>
<a name="index-LOC"></a>
<a name="index-location-of-a-variable-in-memory"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>LOC(X)</code> returns the address of <var>X</var> as an integer.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LOC(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Variable of any type.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code>, with a <code>KIND</code>
corresponding to the size (in bytes) of a memory address on the target
machine.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_loc
  integer :: i
  real :: r
  i = loc(r)
  print *, i
end program test_loc
</pre></div>
</dd>
</dl>



<hr>
<a name="LOG"></a>
<div class="header">
<p>
Next: <a href="#LOG10" accesskey="n" rel="next">LOG10</a>, Previous: <a href="#LOC" accesskey="p" rel="prev">LOC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LOG-_002d_002d_002d-Logarithm-function"></a>
<h3 class="section">7.137 <code>LOG</code> &mdash; Logarithm function</h3>
<a name="index-LOG"></a>
<a name="index-ALOG"></a>
<a name="index-DLOG"></a>
<a name="index-CLOG"></a>
<a name="index-ZLOG"></a>
<a name="index-CDLOG"></a>
<a name="index-exponential-function_002c-inverse"></a>
<a name="index-logarithmic-function"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>LOG(X)</code> computes the logarithm of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LOG(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> or
<code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> or <code>COMPLEX</code>.
The kind type parameter is the same as <var>X</var>.
If <var>X</var> is <code>COMPLEX</code>, the imaginary part <em>\omega</em> is in the range
<em>-\pi \leq \omega \leq \pi</em>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_log
  real(8) :: x = 1.0_8
  complex :: z = (1.0, 2.0)
  x = log(x)
  z = log(z)
end program test_log
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>ALOG(X)</code></td><td width="20%"><code>REAL(4) X</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">f95, gnu</td></tr>
<tr><td width="20%"><code>DLOG(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">f95, gnu</td></tr>
<tr><td width="20%"><code>CLOG(X)</code></td><td width="20%"><code>COMPLEX(4) X</code></td><td width="20%"><code>COMPLEX(4)</code></td><td width="25%">f95, gnu</td></tr>
<tr><td width="20%"><code>ZLOG(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">f95, gnu</td></tr>
<tr><td width="20%"><code>CDLOG(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">f95, gnu</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="LOG10"></a>
<div class="header">
<p>
Next: <a href="#LOG_005fGAMMA" accesskey="n" rel="next">LOG_GAMMA</a>, Previous: <a href="#LOG" accesskey="p" rel="prev">LOG</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LOG10-_002d_002d_002d-Base-10-logarithm-function"></a>
<h3 class="section">7.138 <code>LOG10</code> &mdash; Base 10 logarithm function</h3>
<a name="index-LOG10"></a>
<a name="index-ALOG10"></a>
<a name="index-DLOG10"></a>
<a name="index-exponential-function_002c-inverse-1"></a>
<a name="index-logarithmic-function-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>LOG10(X)</code> computes the base 10 logarithm of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LOG10(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> or <code>COMPLEX</code>.
The kind type parameter is the same as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_log10
  real(8) :: x = 10.0_8
  x = log10(x)
end program test_log10
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>ALOG10(X)</code></td><td width="20%"><code>REAL(4) X</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">Fortran 95 and later</td></tr>
<tr><td width="20%"><code>DLOG10(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 95 and later</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="LOG_005fGAMMA"></a>
<div class="header">
<p>
Next: <a href="#LOGICAL" accesskey="n" rel="next">LOGICAL</a>, Previous: <a href="#LOG10" accesskey="p" rel="prev">LOG10</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LOG_005fGAMMA-_002d_002d_002d-Logarithm-of-the-Gamma-function"></a>
<h3 class="section">7.139 <code>LOG_GAMMA</code> &mdash; Logarithm of the Gamma function</h3>
<a name="index-LOG_005fGAMMA"></a>
<a name="index-LGAMMA"></a>
<a name="index-ALGAMA"></a>
<a name="index-DLGAMA"></a>
<a name="index-Gamma-function_002c-logarithm-of"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>LOG_GAMMA(X)</code> computes the natural logarithm of the absolute value
of the Gamma (<em>\Gamma</em>) function.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>X = LOG_GAMMA(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code> and neither zero
nor a negative integer.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> of the same kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_log_gamma
  real :: x = 1.0
  x = lgamma(x) ! returns 0.0
end program test_log_gamma
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>LGAMMA(X)</code></td><td width="20%"><code>REAL(4) X</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">GNU Extension</td></tr>
<tr><td width="20%"><code>ALGAMA(X)</code></td><td width="20%"><code>REAL(4) X</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">GNU Extension</td></tr>
<tr><td width="20%"><code>DLGAMA(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">GNU Extension</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Gamma function: <a href="#GAMMA">GAMMA</a>
</p>
</dd>
</dl>



<hr>
<a name="LOGICAL"></a>
<div class="header">
<p>
Next: <a href="#LONG" accesskey="n" rel="next">LONG</a>, Previous: <a href="#LOG_005fGAMMA" accesskey="p" rel="prev">LOG_GAMMA</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LOGICAL-_002d_002d_002d-Convert-to-logical-type"></a>
<h3 class="section">7.140 <code>LOGICAL</code> &mdash; Convert to logical type</h3>
<a name="index-LOGICAL"></a>
<a name="index-conversion_002c-to-logical-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Converts one kind of <code>LOGICAL</code> variable to another.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LOGICAL(L [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>L</var></td><td width="70%">The type shall be <code>LOGICAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a <code>LOGICAL</code> value equal to <var>L</var>, with a
kind corresponding to <var>KIND</var>, or of the default logical kind if
<var>KIND</var> is not given.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#INT">INT</a>, <a href="#REAL">REAL</a>, <a href="#CMPLX">CMPLX</a>
</p></dd>
</dl>



<hr>
<a name="LONG"></a>
<div class="header">
<p>
Next: <a href="#LSHIFT" accesskey="n" rel="next">LSHIFT</a>, Previous: <a href="#LOGICAL" accesskey="p" rel="prev">LOGICAL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LONG-_002d_002d_002d-Convert-to-integer-type"></a>
<h3 class="section">7.141 <code>LONG</code> &mdash; Convert to integer type</h3>
<a name="index-LONG"></a>
<a name="index-conversion_002c-to-integer-6"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Convert to a <code>KIND=4</code> integer type, which is the same size as a C
<code>long</code> integer.  This is equivalent to the standard <code>INT</code>
intrinsic with an optional argument of <code>KIND=4</code>, and is only
included for backwards compatibility.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LONG(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">Shall be of type <code>INTEGER</code>,
<code>REAL</code>, or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a <code>INTEGER(4)</code> variable.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#INT">INT</a>, <a href="#INT2">INT2</a>, <a href="#INT8">INT8</a>
</p></dd>
</dl>



<hr>
<a name="LSHIFT"></a>
<div class="header">
<p>
Next: <a href="#LSTAT" accesskey="n" rel="next">LSTAT</a>, Previous: <a href="#LONG" accesskey="p" rel="prev">LONG</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LSHIFT-_002d_002d_002d-Left-shift-bits"></a>
<h3 class="section">7.142 <code>LSHIFT</code> &mdash; Left shift bits</h3>
<a name="index-LSHIFT"></a>
<a name="index-bits_002c-shift-left"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>LSHIFT</code> returns a value corresponding to <var>I</var> with all of the
bits shifted left by <var>SHIFT</var> places.  If the absolute value of
<var>SHIFT</var> is greater than <code>BIT_SIZE(I)</code>, the value is undefined. 
Bits shifted out from the left end are lost; zeros are shifted in from
the opposite end.
</p>
<p>This function has been superseded by the <code>ISHFT</code> intrinsic, which
is standard in Fortran 95 and later.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = LSHIFT(I, SHIFT)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>SHIFT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the same kind as
<var>I</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ISHFT">ISHFT</a>, <a href="#ISHFTC">ISHFTC</a>, <a href="#RSHIFT">RSHIFT</a>
</p>
</dd>
</dl>



<hr>
<a name="LSTAT"></a>
<div class="header">
<p>
Next: <a href="#LTIME" accesskey="n" rel="next">LTIME</a>, Previous: <a href="#LSHIFT" accesskey="p" rel="prev">LSHIFT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LSTAT-_002d_002d_002d-Get-file-status"></a>
<h3 class="section">7.143 <code>LSTAT</code> &mdash; Get file status</h3>
<a name="index-LSTAT"></a>
<a name="index-file-system_002c-file-status-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>LSTAT</code> is identical to <a href="#STAT">STAT</a>, except that if path is a symbolic link, 
then the link itself is statted, not the file that it refers to.
</p>
<p>The elements in <code>BUFF</code> are the same as described by <a href="#STAT">STAT</a>.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL LSTAT(FILE, BUFF [, STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>FILE</var></td><td width="70%">The type shall be <code>CHARACTER</code> of the default
kind, a valid path within the file system.</td></tr>
<tr><td width="15%"><var>BUFF</var></td><td width="70%">The type shall be <code>INTEGER(4), DIMENSION(13)</code>.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER(4)</code>.
Returns 0 on success and a system specific error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <a href="#STAT">STAT</a> for an example.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p>To stat an open file: <a href="#FSTAT">FSTAT</a>, to stat a file: <a href="#STAT">STAT</a>
</p></dd>
</dl>



<hr>
<a name="LTIME"></a>
<div class="header">
<p>
Next: <a href="#MALLOC" accesskey="n" rel="next">MALLOC</a>, Previous: <a href="#LSTAT" accesskey="p" rel="prev">LSTAT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="LTIME-_002d_002d_002d-Convert-time-to-local-time-info"></a>
<h3 class="section">7.144 <code>LTIME</code> &mdash; Convert time to local time info</h3>
<a name="index-LTIME"></a>
<a name="index-time_002c-conversion-to-local-time-info"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Given a system time value <var>STIME</var> (as provided by the <code>TIME8()</code>
intrinsic), fills <var>TARRAY</var> with values extracted from it appropriate
to the local time zone using <code>localtime(3)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL LTIME(STIME, TARRAY)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STIME</var></td><td width="70%">An <code>INTEGER</code> scalar expression
corresponding to a system time, with <code>INTENT(IN)</code>.</td></tr>
<tr><td width="15%"><var>TARRAY</var></td><td width="70%">A default <code>INTEGER</code> array with 9 elements,
with <code>INTENT(OUT)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The elements of <var>TARRAY</var> are assigned as follows:
</p><ol>
<li> Seconds after the minute, range 0&ndash;59 or 0&ndash;61 to allow for leap
seconds
</li><li> Minutes after the hour, range 0&ndash;59
</li><li> Hours past midnight, range 0&ndash;23
</li><li> Day of month, range 0&ndash;31
</li><li> Number of months since January, range 0&ndash;12
</li><li> Years since 1900
</li><li> Number of days since Sunday, range 0&ndash;6
</li><li> Days since January 1
</li><li> Daylight savings indicator: positive if daylight savings is in
effect, zero if not, and negative if the information is not available.
</li></ol>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CTIME">CTIME</a>, <a href="#GMTIME">GMTIME</a>, <a href="#TIME">TIME</a>, <a href="#TIME8">TIME8</a>
</p>
</dd>
</dl>



<hr>
<a name="MALLOC"></a>
<div class="header">
<p>
Next: <a href="#MATMUL" accesskey="n" rel="next">MATMUL</a>, Previous: <a href="#LTIME" accesskey="p" rel="prev">LTIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MALLOC-_002d_002d_002d-Allocate-dynamic-memory"></a>
<h3 class="section">7.145 <code>MALLOC</code> &mdash; Allocate dynamic memory</h3>
<a name="index-MALLOC"></a>
<a name="index-pointer_002c-cray-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>MALLOC(SIZE)</code> allocates <var>SIZE</var> bytes of dynamic memory and
returns the address of the allocated memory. The <code>MALLOC</code> intrinsic
is an extension intended to be used with Cray pointers, and is provided
in GNU Fortran to allow the user to compile legacy code. For new code
using Fortran 95 pointers, the memory allocation intrinsic is
<code>ALLOCATE</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>PTR = MALLOC(SIZE)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SIZE</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER(K)</code>, with <var>K</var> such that
variables of type <code>INTEGER(K)</code> have the same size as
C pointers (<code>sizeof(void *)</code>).
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p>The following example demonstrates the use of <code>MALLOC</code> and
<code>FREE</code> with Cray pointers.
</p>
<div class="smallexample">
<pre class="smallexample">program test_malloc
  implicit none
  integer i
  real*8 x(*), z
  pointer(ptr_x,x)

  ptr_x = malloc(20*8)
  do i = 1, 20
    x(i) = sqrt(1.0d0 / i)
  end do
  z = 0
  do i = 1, 20
    z = z + x(i)
    print *, z
  end do
  call free(ptr_x)
end program test_malloc
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#FREE">FREE</a>
</p></dd>
</dl>



<hr>
<a name="MATMUL"></a>
<div class="header">
<p>
Next: <a href="#MAX" accesskey="n" rel="next">MAX</a>, Previous: <a href="#MALLOC" accesskey="p" rel="prev">MALLOC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MATMUL-_002d_002d_002d-matrix-multiplication"></a>
<h3 class="section">7.146 <code>MATMUL</code> &mdash; matrix multiplication</h3>
<a name="index-MATMUL"></a>
<a name="index-matrix-multiplication"></a>
<a name="index-product_002c-matrix"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Performs a matrix multiplication on numeric or logical arguments.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MATMUL(MATRIX_A, MATRIX_B)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>MATRIX_A</var></td><td width="70%">An array of <code>INTEGER</code>,
<code>REAL</code>, <code>COMPLEX</code>, or <code>LOGICAL</code> type, with a rank of
one or two.</td></tr>
<tr><td width="15%"><var>MATRIX_B</var></td><td width="70%">An array of <code>INTEGER</code>,
<code>REAL</code>, or <code>COMPLEX</code> type if <var>MATRIX_A</var> is of a numeric
type; otherwise, an array of <code>LOGICAL</code> type. The rank shall be one
or two, and the first (or only) dimension of <var>MATRIX_B</var> shall be
equal to the last (or only) dimension of <var>MATRIX_A</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The matrix product of <var>MATRIX_A</var> and <var>MATRIX_B</var>.  The type and
kind of the result follow the usual type and kind promotion rules, as
for the <code>*</code> or <code>.AND.</code> operators.
</p>
</dd>
<dt><em>See also</em>:</dt>
</dl>



<hr>
<a name="MAX"></a>
<div class="header">
<p>
Next: <a href="#MAXEXPONENT" accesskey="n" rel="next">MAXEXPONENT</a>, Previous: <a href="#MATMUL" accesskey="p" rel="prev">MATMUL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MAX-_002d_002d_002d-Maximum-value-of-an-argument-list"></a>
<h3 class="section">7.147 <code>MAX</code> &mdash; Maximum value of an argument list</h3>
<a name="index-MAX"></a>
<a name="index-MAX0"></a>
<a name="index-AMAX0"></a>
<a name="index-MAX1"></a>
<a name="index-AMAX1"></a>
<a name="index-DMAX1"></a>
<a name="index-maximum-value"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the argument with the largest (most positive) value.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MAX(A1, A2 [, A3 [, ...]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A1</var></td><td width="70%">The type shall be <code>INTEGER</code> or
<code>REAL</code>.</td></tr>
<tr><td width="15%"><var>A2</var>, <var>A3</var>, ...</td><td width="70%">An expression of the same type and kind
as <var>A1</var>.  (As a GNU extension, arguments of different kinds are
permitted.)</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value corresponds to the maximum value among the arguments,
and has the same type and kind as the first argument.
</p>
</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>MAX0(I)</code></td><td width="20%"><code>INTEGER(4) I</code></td><td width="20%"><code>INTEGER(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>AMAX0(I)</code></td><td width="20%"><code>INTEGER(4) I</code></td><td width="20%"><code>REAL(MAX(X))</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>MAX1(X)</code></td><td width="20%"><code>REAL X</code></td><td width="20%"><code>INT(MAX(X))</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>AMAX1(X)</code></td><td width="20%"><code>REAL(4)    X</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>DMAX1(X)</code></td><td width="20%"><code>REAL(8)    X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#MAXLOC">MAXLOC</a> <a href="#MAXVAL">MAXVAL</a>, <a href="#MIN">MIN</a>
</p>
</dd>
</dl>



<hr>
<a name="MAXEXPONENT"></a>
<div class="header">
<p>
Next: <a href="#MAXLOC" accesskey="n" rel="next">MAXLOC</a>, Previous: <a href="#MAX" accesskey="p" rel="prev">MAX</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MAXEXPONENT-_002d_002d_002d-Maximum-exponent-of-a-real-kind"></a>
<h3 class="section">7.148 <code>MAXEXPONENT</code> &mdash; Maximum exponent of a real kind</h3>
<a name="index-MAXEXPONENT"></a>
<a name="index-model-representation_002c-maximum-exponent"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>MAXEXPONENT(X)</code> returns the maximum exponent in the model of the
type of <code>X</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MAXEXPONENT(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the default integer
kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program exponents
  real(kind=4) :: x
  real(kind=8) :: y

  print *, minexponent(x), maxexponent(x)
  print *, minexponent(y), maxexponent(y)
end program exponents
</pre></div>
</dd>
</dl>



<hr>
<a name="MAXLOC"></a>
<div class="header">
<p>
Next: <a href="#MAXVAL" accesskey="n" rel="next">MAXVAL</a>, Previous: <a href="#MAXEXPONENT" accesskey="p" rel="prev">MAXEXPONENT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MAXLOC-_002d_002d_002d-Location-of-the-maximum-value-within-an-array"></a>
<h3 class="section">7.149 <code>MAXLOC</code> &mdash; Location of the maximum value within an array</h3>
<a name="index-MAXLOC"></a>
<a name="index-array_002c-location-of-maximum-element"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines the location of the element in the array with the maximum
value, or, if the <var>DIM</var> argument is supplied, determines the
locations of the maximum element along each row of the array in the
<var>DIM</var> direction.  If <var>MASK</var> is present, only the elements for
which <var>MASK</var> is <code>.TRUE.</code> are considered.  If more than one
element in the array has the maximum value, the location returned is
that of the first such element in array element order.  If the array has
zero size, or all of the elements of <var>MASK</var> are <code>.FALSE.</code>, then
the result is an array of zeroes.  Similarly, if <var>DIM</var> is supplied
and all of the elements of <var>MASK</var> along a given row are zero, the
result value for that row is zero.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>RESULT = MAXLOC(ARRAY, DIM [, MASK])</code></td></tr>
<tr><td width="80%"><code>RESULT = MAXLOC(ARRAY [, MASK])</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of type <code>INTEGER</code>,
<code>REAL</code>, or <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) Shall be a scalar of type
<code>INTEGER</code>, with a value between one and the rank of <var>ARRAY</var>,
inclusive.  It may not be an optional dummy argument.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">Shall be an array of type <code>LOGICAL</code>,
and conformable with <var>ARRAY</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>If <var>DIM</var> is absent, the result is a rank-one array with a length
equal to the rank of <var>ARRAY</var>.  If <var>DIM</var> is present, the result
is an array with a rank one less than the rank of <var>ARRAY</var>, and a
size corresponding to the size of <var>ARRAY</var> with the <var>DIM</var>
dimension removed.  If <var>DIM</var> is present and <var>ARRAY</var> has a rank
of one, the result is a scalar.  In all cases, the result is of default
<code>INTEGER</code> type.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#MAX">MAX</a>, <a href="#MAXVAL">MAXVAL</a>
</p>
</dd>
</dl>



<hr>
<a name="MAXVAL"></a>
<div class="header">
<p>
Next: <a href="#MCLOCK" accesskey="n" rel="next">MCLOCK</a>, Previous: <a href="#MAXLOC" accesskey="p" rel="prev">MAXLOC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MAXVAL-_002d_002d_002d-Maximum-value-of-an-array"></a>
<h3 class="section">7.150 <code>MAXVAL</code> &mdash; Maximum value of an array</h3>
<a name="index-MAXVAL"></a>
<a name="index-array_002c-maximum-value"></a>
<a name="index-maximum-value-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines the maximum value of the elements in an array value, or, if
the <var>DIM</var> argument is supplied, determines the maximum value along
each row of the array in the <var>DIM</var> direction.  If <var>MASK</var> is
present, only the elements for which <var>MASK</var> is <code>.TRUE.</code> are
considered.  If the array has zero size, or all of the elements of
<var>MASK</var> are <code>.FALSE.</code>, then the result is <code>-HUGE(ARRAY)</code>
if <var>ARRAY</var> is numeric, or a string of nulls if <var>ARRAY</var> is of character
type.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>RESULT = MAXVAL(ARRAY, DIM [, MASK])</code></td></tr>
<tr><td width="80%"><code>RESULT = MAXVAL(ARRAY [, MASK])</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of type <code>INTEGER</code>,
<code>REAL</code>, or <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) Shall be a scalar of type
<code>INTEGER</code>, with a value between one and the rank of <var>ARRAY</var>,
inclusive.  It may not be an optional dummy argument.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">Shall be an array of type <code>LOGICAL</code>,
and conformable with <var>ARRAY</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>If <var>DIM</var> is absent, or if <var>ARRAY</var> has a rank of one, the result
is a scalar.  If <var>DIM</var> is present, the result is an array with a
rank one less than the rank of <var>ARRAY</var>, and a size corresponding to
the size of <var>ARRAY</var> with the <var>DIM</var> dimension removed.  In all
cases, the result is of the same type and kind as <var>ARRAY</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#MAX">MAX</a>, <a href="#MAXLOC">MAXLOC</a>
</p></dd>
</dl>



<hr>
<a name="MCLOCK"></a>
<div class="header">
<p>
Next: <a href="#MCLOCK8" accesskey="n" rel="next">MCLOCK8</a>, Previous: <a href="#MAXVAL" accesskey="p" rel="prev">MAXVAL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MCLOCK-_002d_002d_002d-Time-function"></a>
<h3 class="section">7.151 <code>MCLOCK</code> &mdash; Time function</h3>
<a name="index-MCLOCK"></a>
<a name="index-time_002c-clock-ticks"></a>
<a name="index-clock-ticks"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the number of clock ticks since the start of the process, based
on the UNIX function <code>clock(3)</code>.
</p>
<p>This intrinsic is not fully portable, such as to systems with 32-bit
<code>INTEGER</code> types but supporting times wider than 32 bits. Therefore,
the values returned by this intrinsic might be, or become, negative, or
numerically less than previous values, during a single run of the
compiled program.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MCLOCK()</code>
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>INTEGER(4)</code>, equal to the
number of clock ticks since the start of the process, or <code>-1</code> if
the system does not support <code>clock(3)</code>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CTIME">CTIME</a>, <a href="#GMTIME">GMTIME</a>, <a href="#LTIME">LTIME</a>, <a href="#MCLOCK">MCLOCK</a>, <a href="#TIME">TIME</a>
</p>
</dd>
</dl>



<hr>
<a name="MCLOCK8"></a>
<div class="header">
<p>
Next: <a href="#MERGE" accesskey="n" rel="next">MERGE</a>, Previous: <a href="#MCLOCK" accesskey="p" rel="prev">MCLOCK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MCLOCK8-_002d_002d_002d-Time-function-_002864_002dbit_0029"></a>
<h3 class="section">7.152 <code>MCLOCK8</code> &mdash; Time function (64-bit)</h3>
<a name="index-MCLOCK8"></a>
<a name="index-time_002c-clock-ticks-1"></a>
<a name="index-clock-ticks-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the number of clock ticks since the start of the process, based
on the UNIX function <code>clock(3)</code>.
</p>
<p><em>Warning:</em> this intrinsic does not increase the range of the timing
values over that returned by <code>clock(3)</code>. On a system with a 32-bit
<code>clock(3)</code>, <code>MCLOCK8()</code> will return a 32-bit value, even though
it is converted to a 64-bit <code>INTEGER(8)</code> value. That means
overflows of the 32-bit value can still occur. Therefore, the values
returned by this intrinsic might be or become negative or numerically
less than previous values during a single run of the compiled program.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MCLOCK8()</code>
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>INTEGER(8)</code>, equal to the
number of clock ticks since the start of the process, or <code>-1</code> if
the system does not support <code>clock(3)</code>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CTIME">CTIME</a>, <a href="#GMTIME">GMTIME</a>, <a href="#LTIME">LTIME</a>, <a href="#MCLOCK">MCLOCK</a>, <a href="#TIME8">TIME8</a>
</p>
</dd>
</dl>



<hr>
<a name="MERGE"></a>
<div class="header">
<p>
Next: <a href="#MIN" accesskey="n" rel="next">MIN</a>, Previous: <a href="#MCLOCK8" accesskey="p" rel="prev">MCLOCK8</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MERGE-_002d_002d_002d-Merge-variables"></a>
<h3 class="section">7.153 <code>MERGE</code> &mdash; Merge variables</h3>
<a name="index-MERGE"></a>
<a name="index-array_002c-merge-arrays"></a>
<a name="index-array_002c-combine-arrays"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Select values from two arrays according to a logical mask.  The result
is equal to <var>TSOURCE</var> if <var>MASK</var> is <code>.TRUE.</code>, or equal to
<var>FSOURCE</var> if it is <code>.FALSE.</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MERGE(TSOURCE, FSOURCE, MASK)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>TSOURCE</var></td><td width="70%">May be of any type.</td></tr>
<tr><td width="15%"><var>FSOURCE</var></td><td width="70%">Shall be of the same type and type parameters
as <var>TSOURCE</var>.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">Shall be of type <code>LOGICAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result is of the same type and type parameters as <var>TSOURCE</var>.
</p>
</dd>
</dl>



<hr>
<a name="MIN"></a>
<div class="header">
<p>
Next: <a href="#MINEXPONENT" accesskey="n" rel="next">MINEXPONENT</a>, Previous: <a href="#MERGE" accesskey="p" rel="prev">MERGE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MIN-_002d_002d_002d-Minimum-value-of-an-argument-list"></a>
<h3 class="section">7.154 <code>MIN</code> &mdash; Minimum value of an argument list</h3>
<a name="index-MIN"></a>
<a name="index-MIN0"></a>
<a name="index-AMIN0"></a>
<a name="index-MIN1"></a>
<a name="index-AMIN1"></a>
<a name="index-DMIN1"></a>
<a name="index-minimum-value"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the argument with the smallest (most negative) value.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MIN(A1, A2 [, A3, ...])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A1</var></td><td width="70%">The type shall be <code>INTEGER</code> or
<code>REAL</code>.</td></tr>
<tr><td width="15%"><var>A2</var>, <var>A3</var>, ...</td><td width="70%">An expression of the same type and kind
as <var>A1</var>.  (As a GNU extension, arguments of different kinds are
permitted.)</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value corresponds to the maximum value among the arguments,
and has the same type and kind as the first argument.
</p>
</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>MIN0(I)</code></td><td width="20%"><code>INTEGER(4) I</code></td><td width="20%"><code>INTEGER(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>AMIN0(I)</code></td><td width="20%"><code>INTEGER(4) I</code></td><td width="20%"><code>REAL(MIN(X))</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>MIN1(X)</code></td><td width="20%"><code>REAL X</code></td><td width="20%"><code>INT(MIN(X))</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>AMIN1(X)</code></td><td width="20%"><code>REAL(4)    X</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">Fortran 77 and later</td></tr>
<tr><td width="20%"><code>DMIN1(X)</code></td><td width="20%"><code>REAL(8)    X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 77 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#MAX">MAX</a>, <a href="#MINLOC">MINLOC</a>, <a href="#MINVAL">MINVAL</a>
</p></dd>
</dl>



<hr>
<a name="MINEXPONENT"></a>
<div class="header">
<p>
Next: <a href="#MINLOC" accesskey="n" rel="next">MINLOC</a>, Previous: <a href="#MIN" accesskey="p" rel="prev">MIN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MINEXPONENT-_002d_002d_002d-Minimum-exponent-of-a-real-kind"></a>
<h3 class="section">7.155 <code>MINEXPONENT</code> &mdash; Minimum exponent of a real kind</h3>
<a name="index-MINEXPONENT"></a>
<a name="index-model-representation_002c-minimum-exponent"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>MINEXPONENT(X)</code> returns the minimum exponent in the model of the
type of <code>X</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MINEXPONENT(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the default integer
kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <code>MAXEXPONENT</code> for an example.
</p></dd>
</dl>



<hr>
<a name="MINLOC"></a>
<div class="header">
<p>
Next: <a href="#MINVAL" accesskey="n" rel="next">MINVAL</a>, Previous: <a href="#MINEXPONENT" accesskey="p" rel="prev">MINEXPONENT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MINLOC-_002d_002d_002d-Location-of-the-minimum-value-within-an-array"></a>
<h3 class="section">7.156 <code>MINLOC</code> &mdash; Location of the minimum value within an array</h3>
<a name="index-MINLOC"></a>
<a name="index-array_002c-location-of-minimum-element"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines the location of the element in the array with the minimum
value, or, if the <var>DIM</var> argument is supplied, determines the
locations of the minimum element along each row of the array in the
<var>DIM</var> direction.  If <var>MASK</var> is present, only the elements for
which <var>MASK</var> is <code>.TRUE.</code> are considered.  If more than one
element in the array has the minimum value, the location returned is
that of the first such element in array element order.  If the array has
zero size, or all of the elements of <var>MASK</var> are <code>.FALSE.</code>, then
the result is an array of zeroes.  Similarly, if <var>DIM</var> is supplied
and all of the elements of <var>MASK</var> along a given row are zero, the
result value for that row is zero.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>RESULT = MINLOC(ARRAY, DIM [, MASK])</code></td></tr>
<tr><td width="80%"><code>RESULT = MINLOC(ARRAY [, MASK])</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of type <code>INTEGER</code>,
<code>REAL</code>, or <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) Shall be a scalar of type
<code>INTEGER</code>, with a value between one and the rank of <var>ARRAY</var>,
inclusive.  It may not be an optional dummy argument.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">Shall be an array of type <code>LOGICAL</code>,
and conformable with <var>ARRAY</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>If <var>DIM</var> is absent, the result is a rank-one array with a length
equal to the rank of <var>ARRAY</var>.  If <var>DIM</var> is present, the result
is an array with a rank one less than the rank of <var>ARRAY</var>, and a
size corresponding to the size of <var>ARRAY</var> with the <var>DIM</var>
dimension removed.  If <var>DIM</var> is present and <var>ARRAY</var> has a rank
of one, the result is a scalar.  In all cases, the result is of default
<code>INTEGER</code> type.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#MIN">MIN</a>, <a href="#MINVAL">MINVAL</a>
</p>
</dd>
</dl>



<hr>
<a name="MINVAL"></a>
<div class="header">
<p>
Next: <a href="#MOD" accesskey="n" rel="next">MOD</a>, Previous: <a href="#MINLOC" accesskey="p" rel="prev">MINLOC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MINVAL-_002d_002d_002d-Minimum-value-of-an-array"></a>
<h3 class="section">7.157 <code>MINVAL</code> &mdash; Minimum value of an array</h3>
<a name="index-MINVAL"></a>
<a name="index-array_002c-minimum-value"></a>
<a name="index-minimum-value-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines the minimum value of the elements in an array value, or, if
the <var>DIM</var> argument is supplied, determines the minimum value along
each row of the array in the <var>DIM</var> direction.  If <var>MASK</var> is
present, only the elements for which <var>MASK</var> is <code>.TRUE.</code> are
considered.  If the array has zero size, or all of the elements of
<var>MASK</var> are <code>.FALSE.</code>, then the result is <code>HUGE(ARRAY)</code> if
<var>ARRAY</var> is numeric, or a string of <code>CHAR(255)</code> characters if
<var>ARRAY</var> is of character type.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>RESULT = MINVAL(ARRAY, DIM [, MASK])</code></td></tr>
<tr><td width="80%"><code>RESULT = MINVAL(ARRAY [, MASK])</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of type <code>INTEGER</code>,
<code>REAL</code>, or <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) Shall be a scalar of type
<code>INTEGER</code>, with a value between one and the rank of <var>ARRAY</var>,
inclusive.  It may not be an optional dummy argument.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">Shall be an array of type <code>LOGICAL</code>,
and conformable with <var>ARRAY</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>If <var>DIM</var> is absent, or if <var>ARRAY</var> has a rank of one, the result
is a scalar.  If <var>DIM</var> is present, the result is an array with a
rank one less than the rank of <var>ARRAY</var>, and a size corresponding to
the size of <var>ARRAY</var> with the <var>DIM</var> dimension removed.  In all
cases, the result is of the same type and kind as <var>ARRAY</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#MIN">MIN</a>, <a href="#MINLOC">MINLOC</a>
</p>
</dd>
</dl>



<hr>
<a name="MOD"></a>
<div class="header">
<p>
Next: <a href="#MODULO" accesskey="n" rel="next">MODULO</a>, Previous: <a href="#MINVAL" accesskey="p" rel="prev">MINVAL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MOD-_002d_002d_002d-Remainder-function"></a>
<h3 class="section">7.158 <code>MOD</code> &mdash; Remainder function</h3>
<a name="index-MOD"></a>
<a name="index-AMOD"></a>
<a name="index-DMOD"></a>
<a name="index-remainder"></a>
<a name="index-division_002c-remainder"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>MOD(A,P)</code> computes the remainder of the division of A by P. It is
calculated as <code>A - (INT(A/P) * P)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MOD(A, P)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">Shall be a scalar of type <code>INTEGER</code> or <code>REAL</code></td></tr>
<tr><td width="15%"><var>P</var></td><td width="70%">Shall be a scalar of the same type as <var>A</var> and not
equal to zero</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The kind of the return value is the result of cross-promoting
the kinds of the arguments.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_mod
  print *, mod(17,3)
  print *, mod(17.5,5.5)
  print *, mod(17.5d0,5.5)
  print *, mod(17.5,5.5d0)

  print *, mod(-17,3)
  print *, mod(-17.5,5.5)
  print *, mod(-17.5d0,5.5)
  print *, mod(-17.5,5.5d0)

  print *, mod(17,-3)
  print *, mod(17.5,-5.5)
  print *, mod(17.5d0,-5.5)
  print *, mod(17.5,-5.5d0)
end program test_mod
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Arguments</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>AMOD(A,P)</code></td><td width="20%"><code>REAL(4)</code></td><td width="20%"><code>REAL(4)</code></td><td width="25%">Fortran 95 and later</td></tr>
<tr><td width="20%"><code>DMOD(A,P)</code></td><td width="20%"><code>REAL(8)</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 95 and later</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="MODULO"></a>
<div class="header">
<p>
Next: <a href="#MOVE_005fALLOC" accesskey="n" rel="next">MOVE_ALLOC</a>, Previous: <a href="#MOD" accesskey="p" rel="prev">MOD</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MODULO-_002d_002d_002d-Modulo-function"></a>
<h3 class="section">7.159 <code>MODULO</code> &mdash; Modulo function</h3>
<a name="index-MODULO"></a>
<a name="index-modulo"></a>
<a name="index-division_002c-modulo"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>MODULO(A,P)</code> computes the <var>A</var> modulo <var>P</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = MODULO(A, P)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">Shall be a scalar of type <code>INTEGER</code> or <code>REAL</code></td></tr>
<tr><td width="15%"><var>P</var></td><td width="70%">Shall be a scalar of the same type and kind as <var>A</var></td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The type and kind of the result are those of the arguments.
</p><dl compact="compact">
<dt>If <var>A</var> and <var>P</var> are of type <code>INTEGER</code>:</dt>
<dd><p><code>MODULO(A,P)</code> has the value <var>R</var> such that <code>A=Q*P+R</code>, where
<var>Q</var> is an integer and <var>R</var> is between 0 (inclusive) and <var>P</var>
(exclusive).
</p></dd>
<dt>If <var>A</var> and <var>P</var> are of type <code>REAL</code>:</dt>
<dd><p><code>MODULO(A,P)</code> has the value of <code>A - FLOOR (A / P) * P</code>.
</p></dd>
</dl>
<p>In all cases, if <var>P</var> is zero the result is processor-dependent.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_modulo
  print *, modulo(17,3)
  print *, modulo(17.5,5.5)

  print *, modulo(-17,3)
  print *, modulo(-17.5,5.5)

  print *, modulo(17,-3)
  print *, modulo(17.5,-5.5)
end program
</pre></div>

</dd>
</dl>



<hr>
<a name="MOVE_005fALLOC"></a>
<div class="header">
<p>
Next: <a href="#MVBITS" accesskey="n" rel="next">MVBITS</a>, Previous: <a href="#MODULO" accesskey="p" rel="prev">MODULO</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MOVE_005fALLOC-_002d_002d_002d-Move-allocation-from-one-object-to-another"></a>
<h3 class="section">7.160 <code>MOVE_ALLOC</code> &mdash; Move allocation from one object to another</h3>
<a name="index-MOVE_005fALLOC"></a>
<a name="index-moving-allocation"></a>
<a name="index-allocation_002c-moving"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>MOVE_ALLOC(SRC, DEST)</code> moves the allocation from <var>SRC</var> to
<var>DEST</var>.  <var>SRC</var> will become deallocated in the process.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL MOVE_ALLOC(SRC, DEST)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SRC</var></td><td width="70%"><code>ALLOCATABLE</code>, <code>INTENT(INOUT)</code>, may be
of any type and kind.</td></tr>
<tr><td width="15%"><var>DEST</var></td><td width="70%"><code>ALLOCATABLE</code>, <code>INTENT(OUT)</code>, shall be
of the same type, kind and rank as <var>SRC</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>None
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_move_alloc
    integer, allocatable :: a(:), b(:)

    allocate(a(3))
    a = [ 1, 2, 3 ]
    call move_alloc(a, b)
    print *, allocated(a), allocated(b)
    print *, b
end program test_move_alloc
</pre></div>
</dd>
</dl>



<hr>
<a name="MVBITS"></a>
<div class="header">
<p>
Next: <a href="#NEAREST" accesskey="n" rel="next">NEAREST</a>, Previous: <a href="#MOVE_005fALLOC" accesskey="p" rel="prev">MOVE_ALLOC</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="MVBITS-_002d_002d_002d-Move-bits-from-one-integer-to-another"></a>
<h3 class="section">7.161 <code>MVBITS</code> &mdash; Move bits from one integer to another</h3>
<a name="index-MVBITS"></a>
<a name="index-bits_002c-move"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Moves <var>LEN</var> bits from positions <var>FROMPOS</var> through
<code>FROMPOS+LEN-1</code> of <var>FROM</var> to positions <var>TOPOS</var> through
<code>TOPOS+LEN-1</code> of <var>TO</var>. The portion of argument <var>TO</var> not
affected by the movement of bits is unchanged. The values of
<code>FROMPOS+LEN-1</code> and <code>TOPOS+LEN-1</code> must be less than
<code>BIT_SIZE(FROM)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL MVBITS(FROM, FROMPOS, LEN, TO, TOPOS)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>FROM</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>FROMPOS</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>LEN</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>TO</var></td><td width="70%">The type shall be <code>INTEGER</code>, of the
same kind as <var>FROM</var>.</td></tr>
<tr><td width="15%"><var>TOPOS</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IBCLR">IBCLR</a>, <a href="#IBSET">IBSET</a>, <a href="#IBITS">IBITS</a>, <a href="#IAND">IAND</a>, <a href="#IOR">IOR</a>, <a href="#IEOR">IEOR</a>
</p></dd>
</dl>



<hr>
<a name="NEAREST"></a>
<div class="header">
<p>
Next: <a href="#NEW_005fLINE" accesskey="n" rel="next">NEW_LINE</a>, Previous: <a href="#MVBITS" accesskey="p" rel="prev">MVBITS</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="NEAREST-_002d_002d_002d-Nearest-representable-number"></a>
<h3 class="section">7.162 <code>NEAREST</code> &mdash; Nearest representable number</h3>
<a name="index-NEAREST"></a>
<a name="index-real-number_002c-nearest-different"></a>
<a name="index-floating-point_002c-nearest-different"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>NEAREST(X, S)</code> returns the processor-representable number nearest
to <code>X</code> in the direction indicated by the sign of <code>S</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = NEAREST(X, S)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>S</var></td><td width="70%">(Optional) shall be of type <code>REAL</code> and
not equal to zero.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type as <code>X</code>. If <code>S</code> is
positive, <code>NEAREST</code> returns the processor-representable number
greater than <code>X</code> and nearest to it. If <code>S</code> is negative,
<code>NEAREST</code> returns the processor-representable number smaller than
<code>X</code> and nearest to it.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_nearest
  real :: x, y
  x = nearest(42.0, 1.0)
  y = nearest(42.0, -1.0)
  write (*,&quot;(3(G20.15))&quot;) x, y, x - y
end program test_nearest
</pre></div>
</dd>
</dl>



<hr>
<a name="NEW_005fLINE"></a>
<div class="header">
<p>
Next: <a href="#NINT" accesskey="n" rel="next">NINT</a>, Previous: <a href="#NEAREST" accesskey="p" rel="prev">NEAREST</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="NEW_005fLINE-_002d_002d_002d-New-line-character"></a>
<h3 class="section">7.163 <code>NEW_LINE</code> &mdash; New line character</h3>
<a name="index-NEW_005fLINE"></a>
<a name="index-newline"></a>
<a name="index-output_002c-newline"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>NEW_LINE(C)</code> returns the new-line character.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = NEW_LINE(C)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>C</var></td><td width="70%">The argument shall be a scalar or array of the
type <code>CHARACTER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns a <var>CHARACTER</var> scalar of length one with the new-line character of
the same kind as parameter <var>C</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program newline
  implicit none
  write(*,'(A)') 'This is record 1.'//NEW_LINE('A')//'This is record 2.'
end program newline
</pre></div>
</dd>
</dl>



<hr>
<a name="NINT"></a>
<div class="header">
<p>
Next: <a href="#NOT" accesskey="n" rel="next">NOT</a>, Previous: <a href="#NEW_005fLINE" accesskey="p" rel="prev">NEW_LINE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="NINT-_002d_002d_002d-Nearest-whole-number"></a>
<h3 class="section">7.164 <code>NINT</code> &mdash; Nearest whole number</h3>
<a name="index-NINT"></a>
<a name="index-IDNINT"></a>
<a name="index-rounding_002c-nearest-whole-number"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>NINT(X)</code> rounds its argument to the nearest whole number.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later, with <var>KIND</var> argument Fortran 90 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = NINT(X [, KIND])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type of the argument shall be <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns <var>A</var> with the fractional portion of its magnitude eliminated by
rounding to the nearest whole number and with its sign preserved,
converted to an <code>INTEGER</code> of the default kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_nint
  real(4) x4
  real(8) x8
  x4 = 1.234E0_4
  x8 = 4.321_8
  print *, nint(x4), idnint(x8)
end program test_nint
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="25%">Name</td><td width="25%">Argument</td><td width="25%">Standard</td></tr>
<tr><td width="25%"><code>IDNINT(X)</code></td><td width="25%"><code>REAL(8)</code></td><td width="25%">Fortran 95 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CEILING">CEILING</a>, <a href="#FLOOR">FLOOR</a>
</p>
</dd>
</dl>



<hr>
<a name="NOT"></a>
<div class="header">
<p>
Next: <a href="#NULL" accesskey="n" rel="next">NULL</a>, Previous: <a href="#NINT" accesskey="p" rel="prev">NINT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="NOT-_002d_002d_002d-Logical-negation"></a>
<h3 class="section">7.165 <code>NOT</code> &mdash; Logical negation</h3>
<a name="index-NOT"></a>
<a name="index-bits_002c-negate"></a>
<a name="index-bitwise-logical-not"></a>
<a name="index-logical-not_002c-bitwise"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>NOT</code> returns the bitwise boolean inverse of <var>I</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = NOT(I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return type is <code>INTEGER</code>, of the same kind as the
argument.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IAND">IAND</a>, <a href="#IEOR">IEOR</a>, <a href="#IOR">IOR</a>, <a href="#IBITS">IBITS</a>, <a href="#IBSET">IBSET</a>, <a href="#IBCLR">IBCLR</a>
</p>
</dd>
</dl>



<hr>
<a name="NULL"></a>
<div class="header">
<p>
Next: <a href="#OR" accesskey="n" rel="next">OR</a>, Previous: <a href="#NOT" accesskey="p" rel="prev">NOT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="NULL-_002d_002d_002d-Function-that-returns-an-disassociated-pointer"></a>
<h3 class="section">7.166 <code>NULL</code> &mdash; Function that returns an disassociated pointer</h3>
<a name="index-NULL"></a>
<a name="index-pointer_002c-status-1"></a>
<a name="index-pointer_002c-disassociated"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns a disassociated pointer.
</p>
<p>If <var>MOLD</var> is present, a dissassociated pointer of the same type is
returned, otherwise the type is determined by context.
</p>
<p>In Fortran 95, <var>MOLD</var> is optional. Please note that Fortran 2003
includes cases where it is required.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>PTR =&gt; NULL([MOLD])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>MOLD</var></td><td width="70%">(Optional) shall be a pointer of any association
status and of any type.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>A disassociated pointer.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">REAL, POINTER, DIMENSION(:) :: VEC =&gt; NULL ()
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ASSOCIATED">ASSOCIATED</a>
</p></dd>
</dl>



<hr>
<a name="OR"></a>
<div class="header">
<p>
Next: <a href="#PACK" accesskey="n" rel="next">PACK</a>, Previous: <a href="#NULL" accesskey="p" rel="prev">NULL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="OR-_002d_002d_002d-Bitwise-logical-OR"></a>
<h3 class="section">7.167 <code>OR</code> &mdash; Bitwise logical OR</h3>
<a name="index-OR"></a>
<a name="index-bitwise-logical-or-1"></a>
<a name="index-logical-or_002c-bitwise-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Bitwise logical <code>OR</code>.
</p>
<p>This intrinsic routine is provided for backwards compatibility with 
GNU Fortran 77.  For integer arguments, programmers should consider
the use of the <a href="#IOR">IOR</a> intrinsic defined by the Fortran standard.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = OR(X, Y)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be either a scalar <code>INTEGER</code>
type or a scalar <code>LOGICAL</code> type.</td></tr>
<tr><td width="15%"><var>Y</var></td><td width="70%">The type shall be the same as the type of <var>X</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return type is either a scalar <code>INTEGER</code> or a scalar
<code>LOGICAL</code>.  If the kind type parameters differ, then the
smaller kind type is implicitly converted to larger kind, and the 
return has the larger kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_or
  LOGICAL :: T = .TRUE., F = .FALSE.
  INTEGER :: a, b
  DATA a / Z'F' /, b / Z'3' /

  WRITE (*,*) OR(T, T), OR(T, F), OR(F, T), OR(F, F)
  WRITE (*,*) OR(a, b)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Fortran 95 elemental function: <a href="#IOR">IOR</a>
</p></dd>
</dl>



<hr>
<a name="PACK"></a>
<div class="header">
<p>
Next: <a href="#PERROR" accesskey="n" rel="next">PERROR</a>, Previous: <a href="#OR" accesskey="p" rel="prev">OR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="PACK-_002d_002d_002d-Pack-an-array-into-an-array-of-rank-one"></a>
<h3 class="section">7.168 <code>PACK</code> &mdash; Pack an array into an array of rank one</h3>
<a name="index-PACK"></a>
<a name="index-array_002c-packing"></a>
<a name="index-array_002c-reduce-dimension"></a>
<a name="index-array_002c-gather-elements"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Stores the elements of <var>ARRAY</var> in an array of rank one.
</p>
<p>The beginning of the resulting array is made up of elements whose <var>MASK</var> 
equals <code>TRUE</code>. Afterwards, positions are filled with elements taken from
<var>VECTOR</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = PACK(ARRAY, MASK[,VECTOR]</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of any type.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">Shall be an array of type <code>LOGICAL</code> and 
of the same size as <var>ARRAY</var>. Alternatively, it may be a <code>LOGICAL</code> 
scalar.</td></tr>
<tr><td width="15%"><var>VECTOR</var></td><td width="70%">(Optional) shall be an array of the same type 
as <var>ARRAY</var> and of rank one. If present, the number of elements in 
<var>VECTOR</var> shall be equal to or greater than the number of true elements 
in <var>MASK</var>. If <var>MASK</var> is scalar, the number of elements in 
<var>VECTOR</var> shall be equal to or greater than the number of elements in
<var>ARRAY</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result is an array of rank one and the same type as that of <var>ARRAY</var>.
If <var>VECTOR</var> is present, the result size is that of <var>VECTOR</var>, the
number of <code>TRUE</code> values in <var>MASK</var> otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p>Gathering nonzero elements from an array:
</p><div class="smallexample">
<pre class="smallexample">PROGRAM test_pack_1
  INTEGER :: m(6)
  m = (/ 1, 0, 0, 0, 5, 0 /)
  WRITE(*, FMT=&quot;(6(I0, ' '))&quot;) pack(m, m /= 0)  ! &quot;1 5&quot;
END PROGRAM
</pre></div>

<p>Gathering nonzero elements from an array and appending elements from <var>VECTOR</var>:
</p><div class="smallexample">
<pre class="smallexample">PROGRAM test_pack_2
  INTEGER :: m(4)
  m = (/ 1, 0, 0, 2 /)
  WRITE(*, FMT=&quot;(4(I0, ' '))&quot;) pack(m, m /= 0, (/ 0, 0, 3, 4 /))  ! &quot;1 2 3 4&quot;
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#UNPACK">UNPACK</a>
</p></dd>
</dl>



<hr>
<a name="PERROR"></a>
<div class="header">
<p>
Next: <a href="#PRECISION" accesskey="n" rel="next">PRECISION</a>, Previous: <a href="#PACK" accesskey="p" rel="prev">PACK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="PERROR-_002d_002d_002d-Print-system-error-message"></a>
<h3 class="section">7.169 <code>PERROR</code> &mdash; Print system error message</h3>
<a name="index-PERROR"></a>
<a name="index-system_002c-error-handling-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Prints (on the C <code>stderr</code> stream) a newline-terminated error
message corresponding to the last system error. This is prefixed by
<var>STRING</var>, a colon and a space. See <code>perror(3)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL PERROR(STRING)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">A scalar of type <code>CHARACTER</code> and of the
default kind.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#IERRNO">IERRNO</a>
</p></dd>
</dl>



<hr>
<a name="PRECISION"></a>
<div class="header">
<p>
Next: <a href="#PRESENT" accesskey="n" rel="next">PRESENT</a>, Previous: <a href="#PERROR" accesskey="p" rel="prev">PERROR</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="PRECISION-_002d_002d_002d-Decimal-precision-of-a-real-kind"></a>
<h3 class="section">7.170 <code>PRECISION</code> &mdash; Decimal precision of a real kind</h3>
<a name="index-PRECISION"></a>
<a name="index-model-representation_002c-precision"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>PRECISION(X)</code> returns the decimal precision in the model of the
type of <code>X</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = PRECISION(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code> or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the default integer
kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program prec_and_range
  real(kind=4) :: x(2)
  complex(kind=8) :: y

  print *, precision(x), range(x)
  print *, precision(y), range(y)
end program prec_and_range
</pre></div>
</dd>
</dl>



<hr>
<a name="PRESENT"></a>
<div class="header">
<p>
Next: <a href="#PRODUCT" accesskey="n" rel="next">PRODUCT</a>, Previous: <a href="#PRECISION" accesskey="p" rel="prev">PRECISION</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="PRESENT-_002d_002d_002d-Determine-whether-an-optional-dummy-argument-is-specified"></a>
<h3 class="section">7.171 <code>PRESENT</code> &mdash; Determine whether an optional dummy argument is specified</h3>
<a name="index-PRESENT"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines whether an optional dummy argument is present.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = PRESENT(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">May be of any type and may be a pointer, scalar or array
value, or a dummy procedure. It shall be the name of an optional dummy argument
accessible within the current subroutine or function.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Returns either <code>TRUE</code> if the optional argument <var>A</var> is present, or
<code>FALSE</code> otherwise.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_present
  WRITE(*,*) f(), f(42)      ! &quot;F T&quot;
CONTAINS
  LOGICAL FUNCTION f(x)
    INTEGER, INTENT(IN), OPTIONAL :: x
    f = PRESENT(x)
  END FUNCTION
END PROGRAM
</pre></div>
</dd>
</dl>



<hr>
<a name="PRODUCT"></a>
<div class="header">
<p>
Next: <a href="#RADIX" accesskey="n" rel="next">RADIX</a>, Previous: <a href="#PRESENT" accesskey="p" rel="prev">PRESENT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="PRODUCT-_002d_002d_002d-Product-of-array-elements"></a>
<h3 class="section">7.172 <code>PRODUCT</code> &mdash; Product of array elements</h3>
<a name="index-PRODUCT"></a>
<a name="index-array_002c-product"></a>
<a name="index-array_002c-multiply-elements"></a>
<a name="index-array_002c-conditionally-multiply-elements"></a>
<a name="index-multiply-array-elements"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Multiplies the elements of <var>ARRAY</var> along dimension <var>DIM</var> if
the corresponding element in <var>MASK</var> is <code>TRUE</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = PRODUCT(ARRAY[, MASK])</code>
<code>RESULT = PRODUCT(ARRAY, DIM[, MASK])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of type <code>INTEGER</code>, 
<code>REAL</code> or <code>COMPLEX</code>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) shall be a scalar of type 
<code>INTEGER</code> with a value in the range from 1 to n, where n 
equals the rank of <var>ARRAY</var>.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">(Optional) shall be of type <code>LOGICAL</code> 
and either be a scalar or an array of the same shape as <var>ARRAY</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result is of the same type as <var>ARRAY</var>.
</p>
<p>If <var>DIM</var> is absent, a scalar with the product of all elements in 
<var>ARRAY</var> is returned. Otherwise, an array of rank n-1, where n equals 
the rank of <var>ARRAY</var>, and a shape similar to that of <var>ARRAY</var> with 
dimension <var>DIM</var> dropped is returned.
</p>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_product
  INTEGER :: x(5) = (/ 1, 2, 3, 4 ,5 /)
  print *, PRODUCT(x)                    ! all elements, product = 120
  print *, PRODUCT(x, MASK=MOD(x, 2)==1) ! odd elements, product = 15
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SUM">SUM</a>
</p></dd>
</dl>



<hr>
<a name="RADIX"></a>
<div class="header">
<p>
Next: <a href="#RAN" accesskey="n" rel="next">RAN</a>, Previous: <a href="#PRODUCT" accesskey="p" rel="prev">PRODUCT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RADIX-_002d_002d_002d-Base-of-a-model-number"></a>
<h3 class="section">7.173 <code>RADIX</code> &mdash; Base of a model number</h3>
<a name="index-RADIX"></a>
<a name="index-model-representation_002c-base"></a>
<a name="index-model-representation_002c-radix"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>RADIX(X)</code> returns the base of the model representing the entity <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = RADIX(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>INTEGER</code> or <code>REAL</code></td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>INTEGER</code> and of the default
integer kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_radix
  print *, &quot;The radix for the default integer kind is&quot;, radix(0)
  print *, &quot;The radix for the default real kind is&quot;, radix(0.0)
end program test_radix
</pre></div>

</dd>
</dl>



<hr>
<a name="RAN"></a>
<div class="header">
<p>
Next: <a href="#RAND" accesskey="n" rel="next">RAND</a>, Previous: <a href="#RADIX" accesskey="p" rel="prev">RADIX</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RAN-_002d_002d_002d-Real-pseudo_002drandom-number"></a>
<h3 class="section">7.174 <code>RAN</code> &mdash; Real pseudo-random number</h3>
<a name="index-RAN"></a>
<a name="index-random-number-generation-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>For compatibility with HP FORTRAN 77/iX, the <code>RAN</code> intrinsic is
provided as an alias for <code>RAND</code>.  See <a href="#RAND">RAND</a> for complete
documentation.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#RAND">RAND</a>, <a href="#RANDOM_005fNUMBER">RANDOM_NUMBER</a>
</p></dd>
</dl>



<hr>
<a name="RAND"></a>
<div class="header">
<p>
Next: <a href="#RANDOM_005fNUMBER" accesskey="n" rel="next">RANDOM_NUMBER</a>, Previous: <a href="#RAN" accesskey="p" rel="prev">RAN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RAND-_002d_002d_002d-Real-pseudo_002drandom-number"></a>
<h3 class="section">7.175 <code>RAND</code> &mdash; Real pseudo-random number</h3>
<a name="index-RAND"></a>
<a name="index-random-number-generation-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>RAND(FLAG)</code> returns a pseudo-random number from a uniform
distribution between 0 and 1. If <var>FLAG</var> is 0, the next number
in the current sequence is returned; if <var>FLAG</var> is 1, the generator
is restarted by <code>CALL SRAND(0)</code>; if <var>FLAG</var> has any other value,
it is used as a new seed with <code>SRAND</code>.
</p>
<p>This intrinsic routine is provided for backwards compatibility with
GNU Fortran 77. It implements a simple modulo generator as provided 
by <code>g77</code>. For new code, one should consider the use of 
<a href="#RANDOM_005fNUMBER">RANDOM_NUMBER</a> as it implements a superior algorithm.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = RAND(FLAG)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>FLAG</var></td><td width="70%">Shall be a scalar <code>INTEGER</code> of kind 4.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of <code>REAL</code> type and the default kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_rand
  integer,parameter :: seed = 86456
  
  call srand(seed)
  print *, rand(), rand(), rand(), rand()
  print *, rand(seed), rand(), rand(), rand()
end program test_rand
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SRAND">SRAND</a>, <a href="#RANDOM_005fNUMBER">RANDOM_NUMBER</a>
</p>
</dd>
</dl>



<hr>
<a name="RANDOM_005fNUMBER"></a>
<div class="header">
<p>
Next: <a href="#RANDOM_005fSEED" accesskey="n" rel="next">RANDOM_SEED</a>, Previous: <a href="#RAND" accesskey="p" rel="prev">RAND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RANDOM_005fNUMBER-_002d_002d_002d-Pseudo_002drandom-number"></a>
<h3 class="section">7.176 <code>RANDOM_NUMBER</code> &mdash; Pseudo-random number</h3>
<a name="index-RANDOM_005fNUMBER"></a>
<a name="index-random-number-generation-3"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns a single pseudorandom number or an array of pseudorandom numbers
from the uniform distribution over the range <em>0 \leq x &lt; 1</em>.
</p>
<p>The runtime-library implements George Marsaglia&rsquo;s KISS (Keep It Simple 
Stupid) random number generator (RNG). This RNG combines:
</p><ol>
<li> The congruential generator <em>x(n) = 69069 \cdot x(n-1) + 1327217885</em>
with a period of <em>2^{32}</em>,
</li><li> A 3-shift shift-register generator with a period of <em>2^{32} - 1</em>,
</li><li> Two 16-bit multiply-with-carry generators with a period of
<em>597273182964842497 &gt; 2^{59}</em>.
</li></ol>
<p>The overall period exceeds <em>2^{123}</em>.
</p>
<p>Please note, this RNG is thread safe if used within OpenMP directives,
i.e., its state will be consistent while called from multiple threads.
However, the KISS generator does not create random numbers in parallel 
from multiple sources, but in sequence from a single source. If an
OpenMP-enabled application heavily relies on random numbers, one should 
consider employing a dedicated parallel random number generator instead.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RANDOM_NUMBER(HARVEST)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>HARVEST</var></td><td width="70%">Shall be a scalar or an array of type <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_random_number
  REAL :: r(5,5)
  CALL init_random_seed()         ! see example of RANDOM_SEED
  CALL RANDOM_NUMBER(r)
end program
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#RANDOM_005fSEED">RANDOM_SEED</a>
</p></dd>
</dl>



<hr>
<a name="RANDOM_005fSEED"></a>
<div class="header">
<p>
Next: <a href="#RANGE" accesskey="n" rel="next">RANGE</a>, Previous: <a href="#RANDOM_005fNUMBER" accesskey="p" rel="prev">RANDOM_NUMBER</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RANDOM_005fSEED-_002d_002d_002d-Initialize-a-pseudo_002drandom-number-sequence"></a>
<h3 class="section">7.177 <code>RANDOM_SEED</code> &mdash; Initialize a pseudo-random number sequence</h3>
<a name="index-RANDOM_005fSEED"></a>
<a name="index-random-number-generation_002c-seeding"></a>
<a name="index-seeding-a-random-number-generator"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Restarts or queries the state of the pseudorandom number generator used by 
<code>RANDOM_NUMBER</code>.
</p>
<p>If <code>RANDOM_SEED</code> is called without arguments, it is initialized to
a default state. The example below shows how to initialize the random 
seed based on the system&rsquo;s time.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL RANDOM_SEED(SIZE, PUT, GET)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SIZE</var></td><td width="70%">(Optional) Shall be a scalar and of type default 
<code>INTEGER</code>, with <code>INTENT(OUT)</code>. It specifies the minimum size 
of the arrays used with the <var>PUT</var> and <var>GET</var> arguments.</td></tr>
<tr><td width="15%"><var>PUT</var></td><td width="70%">(Optional) Shall be an array of type default 
<code>INTEGER</code> and rank one. It is <code>INTENT(IN)</code> and the size of 
the array must be larger than or equal to the number returned by the 
<var>SIZE</var> argument.</td></tr>
<tr><td width="15%"><var>GET</var></td><td width="70%">(Optional) Shall be an array of type default 
<code>INTEGER</code> and rank one. It is <code>INTENT(OUT)</code> and the size 
of the array must be larger than or equal to the number returned by 
the <var>SIZE</var> argument.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">SUBROUTINE init_random_seed()
  INTEGER :: i, n, clock
  INTEGER, DIMENSION(:), ALLOCATABLE :: seed

  CALL RANDOM_SEED(size = n)
  ALLOCATE(seed(n))

  CALL SYSTEM_CLOCK(COUNT=clock)

  seed = clock + 37 * (/ (i - 1, i = 1, n) /)
  CALL RANDOM_SEED(PUT = seed)

  DEALLOCATE(seed)
END SUBROUTINE
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#RANDOM_005fNUMBER">RANDOM_NUMBER</a>
</p></dd>
</dl>



<hr>
<a name="RANGE"></a>
<div class="header">
<p>
Next: <a href="#REAL" accesskey="n" rel="next">REAL</a>, Previous: <a href="#RANDOM_005fSEED" accesskey="p" rel="prev">RANDOM_SEED</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RANGE-_002d_002d_002d-Decimal-exponent-range"></a>
<h3 class="section">7.178 <code>RANGE</code> &mdash; Decimal exponent range</h3>
<a name="index-RANGE"></a>
<a name="index-model-representation_002c-range"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>RANGE(X)</code> returns the decimal exponent range in the model of the
type of <code>X</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = RANGE(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>INTEGER</code>, <code>REAL</code>
or <code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the default integer
kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <code>PRECISION</code> for an example.
</p></dd>
</dl>



<hr>
<a name="REAL"></a>
<div class="header">
<p>
Next: <a href="#RENAME" accesskey="n" rel="next">RENAME</a>, Previous: <a href="#RANGE" accesskey="p" rel="prev">RANGE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="REAL-_002d_002d_002d-Convert-to-real-type"></a>
<h3 class="section">7.179 <code>REAL</code> &mdash; Convert to real type</h3>
<a name="index-REAL"></a>
<a name="index-REALPART"></a>
<a name="index-conversion_002c-to-real-3"></a>
<a name="index-complex-numbers_002c-real-part-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>REAL(X [, KIND])</code> converts its argument <var>X</var> to a real type.  The
<code>REALPART(X)</code> function is provided for compatibility with <code>g77</code>,
and its use is strongly discouraged.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>RESULT = REAL(X [, KIND])</code></td></tr>
<tr><td width="80%"><code>RESULT = REALPART(Z)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be <code>INTEGER</code>, <code>REAL</code>, or
<code>COMPLEX</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>These functions return a <code>REAL</code> variable or array under
the following rules: 
</p>
<dl compact="compact">
<dt>(A)</dt>
<dd><p><code>REAL(X)</code> is converted to a default real type if <var>X</var> is an 
integer or real variable.
</p></dd>
<dt>(B)</dt>
<dd><p><code>REAL(X)</code> is converted to a real type with the kind type parameter
of <var>X</var> if <var>X</var> is a complex variable.
</p></dd>
<dt>(C)</dt>
<dd><p><code>REAL(X, KIND)</code> is converted to a real type with kind type
parameter <var>KIND</var> if <var>X</var> is a complex, integer, or real
variable.
</p></dd>
</dl>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_real
  complex :: x = (1.0, 2.0)
  print *, real(x), real(x,8), realpart(x)
end program test_real
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#DBLE">DBLE</a>, <a href="#DFLOAT">DFLOAT</a>, <a href="#FLOAT">FLOAT</a>
</p>
</dd>
</dl>



<hr>
<a name="RENAME"></a>
<div class="header">
<p>
Next: <a href="#REPEAT" accesskey="n" rel="next">REPEAT</a>, Previous: <a href="#REAL" accesskey="p" rel="prev">REAL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RENAME-_002d_002d_002d-Rename-a-file"></a>
<h3 class="section">7.180 <code>RENAME</code> &mdash; Rename a file</h3>
<a name="index-RENAME"></a>
<a name="index-file-system_002c-rename-file"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Renames a file from file <var>PATH1</var> to <var>PATH2</var>. A null
character (<code>CHAR(0)</code>) can be used to mark the end of the names in
<var>PATH1</var> and <var>PATH2</var>; otherwise, trailing blanks in the file
names are ignored.  If the <var>STATUS</var> argument is supplied, it
contains 0 on success or a nonzero error code upon return; see
<code>rename(2)</code>.
</p>
<p>This intrinsic is provided in both subroutine and function forms;
however, only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL RENAME(PATH1, PATH2 [, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = RENAME(PATH1, PATH2)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>PATH1</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>PATH2</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) Shall be of default <code>INTEGER</code> type.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LINK">LINK</a>
</p>
</dd>
</dl>



<hr>
<a name="REPEAT"></a>
<div class="header">
<p>
Next: <a href="#RESHAPE" accesskey="n" rel="next">RESHAPE</a>, Previous: <a href="#RENAME" accesskey="p" rel="prev">RENAME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="REPEAT-_002d_002d_002d-Repeated-string-concatenation"></a>
<h3 class="section">7.181 <code>REPEAT</code> &mdash; Repeated string concatenation</h3>
<a name="index-REPEAT"></a>
<a name="index-string_002c-repeat"></a>
<a name="index-string_002c-concatenate"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Concatenates <var>NCOPIES</var> copies of a string.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = REPEAT(STRING, NCOPIES)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">Shall be scalar and of type <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>NCOPIES</var></td><td width="70%">Shall be scalar and of type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>A new scalar of type <code>CHARACTER</code> built up from <var>NCOPIES</var> copies 
of <var>STRING</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_repeat
  write(*,*) repeat(&quot;x&quot;, 5)   ! &quot;xxxxx&quot;
end program
</pre></div>
</dd>
</dl>



<hr>
<a name="RESHAPE"></a>
<div class="header">
<p>
Next: <a href="#RRSPACING" accesskey="n" rel="next">RRSPACING</a>, Previous: <a href="#REPEAT" accesskey="p" rel="prev">REPEAT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RESHAPE-_002d_002d_002d-Function-to-reshape-an-array"></a>
<h3 class="section">7.182 <code>RESHAPE</code> &mdash; Function to reshape an array</h3>
<a name="index-RESHAPE"></a>
<a name="index-array_002c-change-dimensions"></a>
<a name="index-array_002c-transmogrify"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Reshapes <var>SOURCE</var> to correspond to <var>SHAPE</var>. If necessary,
the new array may be padded with elements from <var>PAD</var> or permuted
as defined by <var>ORDER</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = RESHAPE(SOURCE, SHAPE[, PAD, ORDER])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SOURCE</var></td><td width="70%">Shall be an array of any type.</td></tr>
<tr><td width="15%"><var>SHAPE</var></td><td width="70%">Shall be of type <code>INTEGER</code> and an 
array of rank one. Its values must be positive or zero.</td></tr>
<tr><td width="15%"><var>PAD</var></td><td width="70%">(Optional) shall be an array of the same 
type as <var>SOURCE</var>.</td></tr>
<tr><td width="15%"><var>ORDER</var></td><td width="70%">(Optional) shall be of type <code>INTEGER</code>
and an array of the same shape as <var>SHAPE</var>. Its values shall
be a permutation of the numbers from 1 to n, where n is the size of 
<var>SHAPE</var>. If <var>ORDER</var> is absent, the natural ordering shall
be assumed.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result is an array of shape <var>SHAPE</var> with the same type as 
<var>SOURCE</var>. 
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_reshape
  INTEGER, DIMENSION(4) :: x
  WRITE(*,*) SHAPE(x)                       ! prints &quot;4&quot;
  WRITE(*,*) SHAPE(RESHAPE(x, (/2, 2/)))    ! prints &quot;2 2&quot;
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SHAPE">SHAPE</a>
</p></dd>
</dl>



<hr>
<a name="RRSPACING"></a>
<div class="header">
<p>
Next: <a href="#RSHIFT" accesskey="n" rel="next">RSHIFT</a>, Previous: <a href="#RESHAPE" accesskey="p" rel="prev">RESHAPE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RRSPACING-_002d_002d_002d-Reciprocal-of-the-relative-spacing"></a>
<h3 class="section">7.183 <code>RRSPACING</code> &mdash; Reciprocal of the relative spacing</h3>
<a name="index-RRSPACING"></a>
<a name="index-real-number_002c-relative-spacing"></a>
<a name="index-floating-point_002c-relative-spacing"></a>


<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>RRSPACING(X)</code> returns the  reciprocal of the relative spacing of
model numbers near <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = RRSPACING(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type and kind as <var>X</var>.
The value returned is equal to
<code>ABS(FRACTION(X)) * FLOAT(RADIX(X))**DIGITS(X)</code>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SPACING">SPACING</a>
</p></dd>
</dl>



<hr>
<a name="RSHIFT"></a>
<div class="header">
<p>
Next: <a href="#SCALE" accesskey="n" rel="next">SCALE</a>, Previous: <a href="#RRSPACING" accesskey="p" rel="prev">RRSPACING</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="RSHIFT-_002d_002d_002d-Right-shift-bits"></a>
<h3 class="section">7.184 <code>RSHIFT</code> &mdash; Right shift bits</h3>
<a name="index-RSHIFT"></a>
<a name="index-bits_002c-shift-right"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>RSHIFT</code> returns a value corresponding to <var>I</var> with all of the
bits shifted right by <var>SHIFT</var> places.  If the absolute value of
<var>SHIFT</var> is greater than <code>BIT_SIZE(I)</code>, the value is undefined. 
Bits shifted out from the left end are lost; zeros are shifted in from
the opposite end.
</p>
<p>This function has been superseded by the <code>ISHFT</code> intrinsic, which
is standard in Fortran 95 and later.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = RSHIFT(I, SHIFT)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>SHIFT</var></td><td width="70%">The type shall be <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of the same kind as
<var>I</var>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ISHFT">ISHFT</a>, <a href="#ISHFTC">ISHFTC</a>, <a href="#LSHIFT">LSHIFT</a>
</p>
</dd>
</dl>



<hr>
<a name="SCALE"></a>
<div class="header">
<p>
Next: <a href="#SCAN" accesskey="n" rel="next">SCAN</a>, Previous: <a href="#RSHIFT" accesskey="p" rel="prev">RSHIFT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SCALE-_002d_002d_002d-Scale-a-real-value"></a>
<h3 class="section">7.185 <code>SCALE</code> &mdash; Scale a real value</h3>
<a name="index-SCALE"></a>
<a name="index-real-number_002c-scale"></a>
<a name="index-floating-point_002c-scale"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SCALE(X,I)</code> returns <code>X * RADIX(X)**I</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SCALE(X, I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type of the argument shall be a <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>I</var></td><td width="70%">The type of the argument shall be a <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type and kind as <var>X</var>.
Its value is <code>X * RADIX(X)**I</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_scale
  real :: x = 178.1387e-4
  integer :: i = 5
  print *, scale(x,i), x*radix(x)**i
end program test_scale
</pre></div>

</dd>
</dl>



<hr>
<a name="SCAN"></a>
<div class="header">
<p>
Next: <a href="#SECNDS" accesskey="n" rel="next">SECNDS</a>, Previous: <a href="#SCALE" accesskey="p" rel="prev">SCALE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SCAN-_002d_002d_002d-Scan-a-string-for-the-presence-of-a-set-of-characters"></a>
<h3 class="section">7.186 <code>SCAN</code> &mdash; Scan a string for the presence of a set of characters</h3>
<a name="index-SCAN"></a>
<a name="index-string_002c-find-subset"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Scans a <var>STRING</var> for any of the characters in a <var>SET</var> 
of characters.
</p>
<p>If <var>BACK</var> is either absent or equals <code>FALSE</code>, this function
returns the position of the leftmost character of <var>STRING</var> that is
in <var>SET</var>. If <var>BACK</var> equals <code>TRUE</code>, the rightmost position
is returned. If no character of <var>SET</var> is found in <var>STRING</var>, the 
result is zero.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SCAN(STRING, SET[, BACK [, KIND]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">Shall be of type <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>SET</var></td><td width="70%">Shall be of type <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>BACK</var></td><td width="70%">(Optional) shall be of type <code>LOGICAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_scan
  WRITE(*,*) SCAN(&quot;FORTRAN&quot;, &quot;AO&quot;)          ! 2, found 'O'
  WRITE(*,*) SCAN(&quot;FORTRAN&quot;, &quot;AO&quot;, .TRUE.)  ! 6, found 'A'
  WRITE(*,*) SCAN(&quot;FORTRAN&quot;, &quot;C++&quot;)         ! 0, found none
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#INDEX-intrinsic">INDEX intrinsic</a>, <a href="#VERIFY">VERIFY</a>
</p></dd>
</dl>



<hr>
<a name="SECNDS"></a>
<div class="header">
<p>
Next: <a href="#SECOND" accesskey="n" rel="next">SECOND</a>, Previous: <a href="#SCAN" accesskey="p" rel="prev">SCAN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SECNDS-_002d_002d_002d-Time-function"></a>
<h3 class="section">7.187 <code>SECNDS</code> &mdash; Time function</h3>
<a name="index-SECNDS"></a>
<a name="index-time_002c-elapsed-3"></a>
<a name="index-elapsed-time-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SECNDS(X)</code> gets the time in seconds from the real-time system clock.
<var>X</var> is a reference time, also in seconds. If this is zero, the time in
seconds from midnight is returned. This function is non-standard and its
use is discouraged.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SECNDS (X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>T</var></td><td width="70%">Shall be of type <code>REAL(4)</code>.</td></tr>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL(4)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>None
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_secnds
    integer :: i
    real(4) :: t1, t2
    print *, secnds (0.0)   ! seconds since midnight
    t1 = secnds (0.0)       ! reference time
    do i = 1, 10000000      ! do something
    end do
    t2 = secnds (t1)        ! elapsed time
    print *, &quot;Something took &quot;, t2, &quot; seconds.&quot;
end program test_secnds
</pre></div>
</dd>
</dl>



<hr>
<a name="SECOND"></a>
<div class="header">
<p>
Next: <a href="#SELECTED_005fCHAR_005fKIND" accesskey="n" rel="next">SELECTED_CHAR_KIND</a>, Previous: <a href="#SECNDS" accesskey="p" rel="prev">SECNDS</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SECOND-_002d_002d_002d-CPU-time-function"></a>
<h3 class="section">7.188 <code>SECOND</code> &mdash; CPU time function</h3>
<a name="index-SECOND"></a>
<a name="index-time_002c-elapsed-4"></a>
<a name="index-elapsed-time-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns a <code>REAL(4)</code> value representing the elapsed CPU time in
seconds.  This provides the same functionality as the standard
<code>CPU_TIME</code> intrinsic, and is only included for backwards
compatibility.
</p>
<p>This intrinsic is provided in both subroutine and function forms;
however, only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL SECOND(TIME)</code></td></tr>
<tr><td width="80%"><code>TIME = SECOND()</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>TIME</var></td><td width="70%">Shall be of type <code>REAL(4)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>In either syntax, <var>TIME</var> is set to the process&rsquo;s current runtime in
seconds.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CPU_005fTIME">CPU_TIME</a>
</p>
</dd>
</dl>



<hr>
<a name="SELECTED_005fCHAR_005fKIND"></a>
<div class="header">
<p>
Next: <a href="#SELECTED_005fINT_005fKIND" accesskey="n" rel="next">SELECTED_INT_KIND</a>, Previous: <a href="#SECOND" accesskey="p" rel="prev">SECOND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SELECTED_005fCHAR_005fKIND-_002d_002d_002d-Choose-character-kind"></a>
<h3 class="section">7.189 <code>SELECTED_CHAR_KIND</code> &mdash; Choose character kind</h3>
<a name="index-SELECTED_005fCHAR_005fKIND"></a>
<a name="index-character-kind"></a>
<a name="index-kind_002c-character"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd>
<p><code>SELECTED_CHAR_KIND(NAME)</code> returns the kind value for the character
set named <var>NAME</var>, if a character set with such a name is supported,
or <em>-1</em> otherwise. Currently, supported character sets include
&ldquo;ASCII&rdquo; and &ldquo;DEFAULT&rdquo;, which are equivalent.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SELECTED_CHAR_KIND(NAME)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>NAME</var></td><td width="70%">Shall be a scalar and of the default character type.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program ascii_kind
  integer,parameter :: ascii = selected_char_kind(&quot;ascii&quot;)
  character(kind=ascii, len=26) :: s

  s = ascii_&quot;abcdefghijklmnopqrstuvwxyz&quot;
  print *, s
end program ascii_kind
</pre></div>
</dd>
</dl>



<hr>
<a name="SELECTED_005fINT_005fKIND"></a>
<div class="header">
<p>
Next: <a href="#SELECTED_005fREAL_005fKIND" accesskey="n" rel="next">SELECTED_REAL_KIND</a>, Previous: <a href="#SELECTED_005fCHAR_005fKIND" accesskey="p" rel="prev">SELECTED_CHAR_KIND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SELECTED_005fINT_005fKIND-_002d_002d_002d-Choose-integer-kind"></a>
<h3 class="section">7.190 <code>SELECTED_INT_KIND</code> &mdash; Choose integer kind</h3>
<a name="index-SELECTED_005fINT_005fKIND"></a>
<a name="index-integer-kind"></a>
<a name="index-kind_002c-integer"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SELECTED_INT_KIND(I)</code> return the kind value of the smallest integer
type that can represent all values ranging from <em>-10^I</em> (exclusive)
to <em>10^I</em> (exclusive). If there is no integer kind that accommodates
this range, <code>SELECTED_INT_KIND</code> returns <em>-1</em>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SELECTED_INT_KIND(I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">Shall be a scalar and of type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program large_integers
  integer,parameter :: k5 = selected_int_kind(5)
  integer,parameter :: k15 = selected_int_kind(15)
  integer(kind=k5) :: i5
  integer(kind=k15) :: i15

  print *, huge(i5), huge(i15)

  ! The following inequalities are always true
  print *, huge(i5) &gt;= 10_k5**5-1
  print *, huge(i15) &gt;= 10_k15**15-1
end program large_integers
</pre></div>
</dd>
</dl>



<hr>
<a name="SELECTED_005fREAL_005fKIND"></a>
<div class="header">
<p>
Next: <a href="#SET_005fEXPONENT" accesskey="n" rel="next">SET_EXPONENT</a>, Previous: <a href="#SELECTED_005fINT_005fKIND" accesskey="p" rel="prev">SELECTED_INT_KIND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SELECTED_005fREAL_005fKIND-_002d_002d_002d-Choose-real-kind"></a>
<h3 class="section">7.191 <code>SELECTED_REAL_KIND</code> &mdash; Choose real kind</h3>
<a name="index-SELECTED_005fREAL_005fKIND"></a>
<a name="index-real-kind"></a>
<a name="index-kind_002c-real"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SELECTED_REAL_KIND(P,R)</code> returns the kind value of a real data type
with decimal precision of at least <code>P</code> digits and exponent
range greater at least <code>R</code>. 
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SELECTED_REAL_KIND(P, R)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>P</var></td><td width="70%">(Optional) shall be a scalar and of type <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>R</var></td><td width="70%">(Optional) shall be a scalar and of type <code>INTEGER</code>.</td></tr>
</table>
<p>At least one argument shall be present.
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd>
<p><code>SELECTED_REAL_KIND</code> returns the value of the kind type parameter of
a real data type with decimal precision of at least <code>P</code> digits and a
decimal exponent range of at least <code>R</code>. If more than one real data
type meet the criteria, the kind of the data type with the smallest
decimal precision is returned. If no real data type matches the criteria,
the result is
</p><dl compact="compact">
<dt>-1 if the processor does not support a real data type with a</dt>
<dd><p>precision greater than or equal to <code>P</code>
</p></dd>
<dt>-2 if the processor does not support a real type with an exponent</dt>
<dd><p>range greater than or equal to <code>R</code>
</p></dd>
<dt>-3 if neither is supported.</dt>
</dl>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program real_kinds
  integer,parameter :: p6 = selected_real_kind(6)
  integer,parameter :: p10r100 = selected_real_kind(10,100)
  integer,parameter :: r400 = selected_real_kind(r=400)
  real(kind=p6) :: x
  real(kind=p10r100) :: y
  real(kind=r400) :: z

  print *, precision(x), range(x)
  print *, precision(y), range(y)
  print *, precision(z), range(z)
end program real_kinds
</pre></div>
</dd>
</dl>



<hr>
<a name="SET_005fEXPONENT"></a>
<div class="header">
<p>
Next: <a href="#SHAPE" accesskey="n" rel="next">SHAPE</a>, Previous: <a href="#SELECTED_005fREAL_005fKIND" accesskey="p" rel="prev">SELECTED_REAL_KIND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SET_005fEXPONENT-_002d_002d_002d-Set-the-exponent-of-the-model"></a>
<h3 class="section">7.192 <code>SET_EXPONENT</code> &mdash; Set the exponent of the model</h3>
<a name="index-SET_005fEXPONENT"></a>
<a name="index-real-number_002c-set-exponent"></a>
<a name="index-floating-point_002c-set-exponent"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SET_EXPONENT(X, I)</code> returns the real number whose fractional part
is that that of <var>X</var> and whose exponent part is <var>I</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SET_EXPONENT(X, I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code>.</td></tr>
<tr><td width="15%"><var>I</var></td><td width="70%">Shall be of type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type and kind as <var>X</var>.
The real number whose fractional part
is that that of <var>X</var> and whose exponent part if <var>I</var> is returned;
it is <code>FRACTION(X) * RADIX(X)**I</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_setexp
  REAL :: x = 178.1387e-4
  INTEGER :: i = 17
  PRINT *, SET_EXPONENT(x, i), FRACTION(x) * RADIX(x)**i
END PROGRAM
</pre></div>

</dd>
</dl>



<hr>
<a name="SHAPE"></a>
<div class="header">
<p>
Next: <a href="#SIGN" accesskey="n" rel="next">SIGN</a>, Previous: <a href="#SET_005fEXPONENT" accesskey="p" rel="prev">SET_EXPONENT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SHAPE-_002d_002d_002d-Determine-the-shape-of-an-array"></a>
<h3 class="section">7.193 <code>SHAPE</code> &mdash; Determine the shape of an array</h3>
<a name="index-SHAPE"></a>
<a name="index-array_002c-shape"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines the shape of an array.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SHAPE(SOURCE)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SOURCE</var></td><td width="70%">Shall be an array or scalar of any type. 
If <var>SOURCE</var> is a pointer it must be associated and allocatable 
arrays must be allocated.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>An <code>INTEGER</code> array of rank one with as many elements as <var>SOURCE</var> 
has dimensions. The elements of the resulting array correspond to the extend
of <var>SOURCE</var> along the respective dimensions. If <var>SOURCE</var> is a scalar,
the result is the rank one array of size zero.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_shape
  INTEGER, DIMENSION(-1:1, -1:2) :: A
  WRITE(*,*) SHAPE(A)             ! (/ 3, 4 /)
  WRITE(*,*) SIZE(SHAPE(42))      ! (/ /)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#RESHAPE">RESHAPE</a>, <a href="#SIZE">SIZE</a>
</p></dd>
</dl>



<hr>
<a name="SIGN"></a>
<div class="header">
<p>
Next: <a href="#SIGNAL" accesskey="n" rel="next">SIGNAL</a>, Previous: <a href="#SHAPE" accesskey="p" rel="prev">SHAPE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SIGN-_002d_002d_002d-Sign-copying-function"></a>
<h3 class="section">7.194 <code>SIGN</code> &mdash; Sign copying function</h3>
<a name="index-SIGN"></a>
<a name="index-ISIGN"></a>
<a name="index-DSIGN"></a>
<a name="index-sign-copying"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SIGN(A,B)</code> returns the value of <var>A</var> with the sign of <var>B</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SIGN(A, B)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">Shall be of type <code>INTEGER</code> or <code>REAL</code></td></tr>
<tr><td width="15%"><var>B</var></td><td width="70%">Shall be of the same type and kind as <var>A</var></td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The kind of the return value is that of <var>A</var> and <var>B</var>.
If <em>B\ge 0</em> then the result is <code>ABS(A)</code>, else
it is <code>-ABS(A)</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_sign
  print *, sign(-12,1)
  print *, sign(-12,0)
  print *, sign(-12,-1)

  print *, sign(-12.,1.)
  print *, sign(-12.,0.)
  print *, sign(-12.,-1.)
end program test_sign
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Arguments</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>ISIGN(A,P)</code></td><td width="20%"><code>INTEGER(4)</code></td><td width="20%"><code>INTEGER(4)</code></td><td width="25%">f95, gnu</td></tr>
<tr><td width="20%"><code>DSIGN(A,P)</code></td><td width="20%"><code>REAL(8)</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">f95, gnu</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="SIGNAL"></a>
<div class="header">
<p>
Next: <a href="#SIN" accesskey="n" rel="next">SIN</a>, Previous: <a href="#SIGN" accesskey="p" rel="prev">SIGN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SIGNAL-_002d_002d_002d-Signal-handling-subroutine-_0028or-function_0029"></a>
<h3 class="section">7.195 <code>SIGNAL</code> &mdash; Signal handling subroutine (or function)</h3>
<a name="index-SIGNAL"></a>
<a name="index-system_002c-signal-handling"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SIGNAL(NUMBER, HANDLER [, STATUS])</code> causes external subroutine
<var>HANDLER</var> to be executed with a single integer argument when signal
<var>NUMBER</var> occurs.  If <var>HANDLER</var> is an integer, it can be used to
turn off handling of signal <var>NUMBER</var> or revert to its default
action.  See <code>signal(2)</code>.
</p>
<p>If <code>SIGNAL</code> is called as a subroutine and the <var>STATUS</var> argument
is supplied, it is set to the value returned by <code>signal(2)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL SIGNAL(NUMBER, HANDLER [, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = SIGNAL(NUMBER, HANDLER)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>NUMBER</var></td><td width="70%">Shall be a scalar integer, with <code>INTENT(IN)</code></td></tr>
<tr><td width="15%"><var>HANDLER</var></td><td width="70%">Signal handler (<code>INTEGER FUNCTION</code> or
<code>SUBROUTINE</code>) or dummy/global <code>INTEGER</code> scalar.
<code>INTEGER</code>. It is <code>INTENT(IN)</code>.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) <var>STATUS</var> shall be a scalar
integer. It has <code>INTENT(OUT)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The <code>SIGNAL</code> function returns the value returned by <code>signal(2)</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_signal
  intrinsic signal
  external handler_print

  call signal (12, handler_print)
  call signal (10, 1)

  call sleep (30)
end program test_signal
</pre></div>
</dd>
</dl>



<hr>
<a name="SIN"></a>
<div class="header">
<p>
Next: <a href="#SINH" accesskey="n" rel="next">SINH</a>, Previous: <a href="#SIGNAL" accesskey="p" rel="prev">SIGNAL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SIN-_002d_002d_002d-Sine-function"></a>
<h3 class="section">7.196 <code>SIN</code> &mdash; Sine function</h3>
<a name="index-SIN"></a>
<a name="index-DSIN"></a>
<a name="index-CSIN"></a>
<a name="index-ZSIN"></a>
<a name="index-CDSIN"></a>
<a name="index-trigonometric-function_002c-sine"></a>
<a name="index-sine"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SIN(X)</code> computes the sine of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SIN(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> or
<code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value has same type and kind as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_sin
  real :: x = 0.0
  x = sin(x)
end program test_sin
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DSIN(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">f95, gnu</td></tr>
<tr><td width="20%"><code>CSIN(X)</code></td><td width="20%"><code>COMPLEX(4) X</code></td><td width="20%"><code>COMPLEX(4)</code></td><td width="25%">f95, gnu</td></tr>
<tr><td width="20%"><code>ZSIN(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">f95, gnu</td></tr>
<tr><td width="20%"><code>CDSIN(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">f95, gnu</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ASIN">ASIN</a>
</p></dd>
</dl>



<hr>
<a name="SINH"></a>
<div class="header">
<p>
Next: <a href="#SIZE" accesskey="n" rel="next">SIZE</a>, Previous: <a href="#SIN" accesskey="p" rel="prev">SIN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SINH-_002d_002d_002d-Hyperbolic-sine-function"></a>
<h3 class="section">7.197 <code>SINH</code> &mdash; Hyperbolic sine function</h3>
<a name="index-SINH"></a>
<a name="index-DSINH"></a>
<a name="index-hyperbolic-sine"></a>
<a name="index-hyperbolic-function_002c-sine"></a>
<a name="index-sine_002c-hyperbolic"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SINH(X)</code> computes the hyperbolic sine of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SINH(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_sinh
  real(8) :: x = - 1.0_8
  x = sinh(x)
end program test_sinh
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DSINH(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 95 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ASINH">ASINH</a>
</p></dd>
</dl>



<hr>
<a name="SIZE"></a>
<div class="header">
<p>
Next: <a href="#SIZEOF" accesskey="n" rel="next">SIZEOF</a>, Previous: <a href="#SINH" accesskey="p" rel="prev">SINH</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SIZE-_002d_002d_002d-Determine-the-size-of-an-array"></a>
<h3 class="section">7.198 <code>SIZE</code> &mdash; Determine the size of an array</h3>
<a name="index-SIZE"></a>
<a name="index-array_002c-size"></a>
<a name="index-array_002c-number-of-elements-1"></a>
<a name="index-array_002c-count-elements"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determine the extent of <var>ARRAY</var> along a specified dimension <var>DIM</var>,
or the total number of elements in <var>ARRAY</var> if <var>DIM</var> is absent.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SIZE(ARRAY[, DIM [, KIND]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of any type. If <var>ARRAY</var> is
a pointer it must be associated and allocatable arrays must be allocated.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) shall be a scalar of type <code>INTEGER</code> 
and its value shall be in the range from 1 to n, where n equals the rank 
of <var>ARRAY</var>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_size
  WRITE(*,*) SIZE((/ 1, 2 /))    ! 2
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SHAPE">SHAPE</a>, <a href="#RESHAPE">RESHAPE</a>
</p></dd>
</dl>


<hr>
<a name="SIZEOF"></a>
<div class="header">
<p>
Next: <a href="#SLEEP" accesskey="n" rel="next">SLEEP</a>, Previous: <a href="#SIZE" accesskey="p" rel="prev">SIZE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SIZEOF-_002d_002d_002d-Size-in-bytes-of-an-expression"></a>
<h3 class="section">7.199 <code>SIZEOF</code> &mdash; Size in bytes of an expression</h3>
<a name="index-SIZEOF"></a>
<a name="index-expression-size-1"></a>
<a name="index-size-of-an-expression-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SIZEOF(X)</code> calculates the number of bytes of storage the
expression <code>X</code> occupies.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Intrinsic function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>N = SIZEOF(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The argument shall be of any type, rank or shape.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type integer and of the system-dependent kind
<var>C_SIZE_T</var> (from the <var>ISO_C_BINDING</var> module). Its value is the
number of bytes occupied by the argument.  If the argument has the
<code>POINTER</code> attribute, the number of bytes of the storage area pointed
to is returned.  If the argument is of a derived type with <code>POINTER</code>
or <code>ALLOCATABLE</code> components, the return value doesn&rsquo;t account for
the sizes of the data pointed to by these components.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">   integer :: i
   real :: r, s(5)
   print *, (sizeof(s)/sizeof(r) == 5)
   end
</pre></div>
<p>The example will print <code>.TRUE.</code> unless you are using a platform
where default <code>REAL</code> variables are unusually padded.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#C_005fSIZEOF">C_SIZEOF</a>
</p></dd>
</dl>


<hr>
<a name="SLEEP"></a>
<div class="header">
<p>
Next: <a href="#SNGL" accesskey="n" rel="next">SNGL</a>, Previous: <a href="#SIZEOF" accesskey="p" rel="prev">SIZEOF</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SLEEP-_002d_002d_002d-Sleep-for-the-specified-number-of-seconds"></a>
<h3 class="section">7.200 <code>SLEEP</code> &mdash; Sleep for the specified number of seconds</h3>
<a name="index-SLEEP"></a>
<a name="index-delayed-execution-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Calling this subroutine causes the process to pause for <var>SECONDS</var> seconds.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL SLEEP(SECONDS)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SECONDS</var></td><td width="70%">The type shall be of default <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_sleep
  call sleep(5)
end
</pre></div>
</dd>
</dl>



<hr>
<a name="SNGL"></a>
<div class="header">
<p>
Next: <a href="#SPACING" accesskey="n" rel="next">SPACING</a>, Previous: <a href="#SLEEP" accesskey="p" rel="prev">SLEEP</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SNGL-_002d_002d_002d-Convert-double-precision-real-to-default-real"></a>
<h3 class="section">7.201 <code>SNGL</code> &mdash; Convert double precision real to default real</h3>
<a name="index-SNGL"></a>
<a name="index-conversion_002c-to-real-4"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SNGL(A)</code> converts the double precision real <var>A</var>
to a default real value. This is an archaic form of <code>REAL</code>
that is specific to one type for <var>A</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SNGL(A)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>A</var></td><td width="70%">The type shall be a double precision <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type default <code>REAL</code>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#DBLE">DBLE</a>
</p></dd>
</dl>



<hr>
<a name="SPACING"></a>
<div class="header">
<p>
Next: <a href="#SPREAD" accesskey="n" rel="next">SPREAD</a>, Previous: <a href="#SNGL" accesskey="p" rel="prev">SNGL</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SPACING-_002d_002d_002d-Smallest-distance-between-two-numbers-of-a-given-type"></a>
<h3 class="section">7.202 <code>SPACING</code> &mdash; Smallest distance between two numbers of a given type</h3>
<a name="index-SPACING"></a>
<a name="index-real-number_002c-relative-spacing-1"></a>
<a name="index-floating-point_002c-relative-spacing-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines the distance between the argument <var>X</var> and the nearest 
adjacent number of the same type.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SPACING(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result is of the same type as the input argument <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_spacing
  INTEGER, PARAMETER :: SGL = SELECTED_REAL_KIND(p=6, r=37)
  INTEGER, PARAMETER :: DBL = SELECTED_REAL_KIND(p=13, r=200)

  WRITE(*,*) spacing(1.0_SGL)      ! &quot;1.1920929E-07&quot;          on i686
  WRITE(*,*) spacing(1.0_DBL)      ! &quot;2.220446049250313E-016&quot; on i686
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#RRSPACING">RRSPACING</a>
</p></dd>
</dl>



<hr>
<a name="SPREAD"></a>
<div class="header">
<p>
Next: <a href="#SQRT" accesskey="n" rel="next">SQRT</a>, Previous: <a href="#SPACING" accesskey="p" rel="prev">SPACING</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SPREAD-_002d_002d_002d-Add-a-dimension-to-an-array"></a>
<h3 class="section">7.203 <code>SPREAD</code> &mdash; Add a dimension to an array</h3>
<a name="index-SPREAD"></a>
<a name="index-array_002c-increase-dimension"></a>
<a name="index-array_002c-duplicate-elements"></a>
<a name="index-array_002c-duplicate-dimensions"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Replicates a <var>SOURCE</var> array <var>NCOPIES</var> times along a specified 
dimension <var>DIM</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SPREAD(SOURCE, DIM, NCOPIES)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SOURCE</var></td><td width="70%">Shall be a scalar or an array of any type and 
a rank less than seven.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">Shall be a scalar of type <code>INTEGER</code> with a 
value in the range from 1 to n+1, where n equals the rank of <var>SOURCE</var>.</td></tr>
<tr><td width="15%"><var>NCOPIES</var></td><td width="70%">Shall be a scalar of type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result is an array of the same type as <var>SOURCE</var> and has rank n+1
where n equals the rank of <var>SOURCE</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_spread
  INTEGER :: a = 1, b(2) = (/ 1, 2 /)
  WRITE(*,*) SPREAD(A, 1, 2)            ! &quot;1 1&quot;
  WRITE(*,*) SPREAD(B, 1, 2)            ! &quot;1 1 2 2&quot;
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#UNPACK">UNPACK</a>
</p></dd>
</dl>



<hr>
<a name="SQRT"></a>
<div class="header">
<p>
Next: <a href="#SRAND" accesskey="n" rel="next">SRAND</a>, Previous: <a href="#SPREAD" accesskey="p" rel="prev">SPREAD</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SQRT-_002d_002d_002d-Square_002droot-function"></a>
<h3 class="section">7.204 <code>SQRT</code> &mdash; Square-root function</h3>
<a name="index-SQRT"></a>
<a name="index-DSQRT"></a>
<a name="index-CSQRT"></a>
<a name="index-ZSQRT"></a>
<a name="index-CDSQRT"></a>
<a name="index-root"></a>
<a name="index-square_002droot"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SQRT(X)</code> computes the square root of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SQRT(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code> or
<code>COMPLEX</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> or <code>COMPLEX</code>.
The kind type parameter is the same as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_sqrt
  real(8) :: x = 2.0_8
  complex :: z = (1.0, 2.0)
  x = sqrt(x)
  z = sqrt(z)
end program test_sqrt
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DSQRT(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 95 and later</td></tr>
<tr><td width="20%"><code>CSQRT(X)</code></td><td width="20%"><code>COMPLEX(4) X</code></td><td width="20%"><code>COMPLEX(4)</code></td><td width="25%">Fortran 95 and later</td></tr>
<tr><td width="20%"><code>ZSQRT(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
<tr><td width="20%"><code>CDSQRT(X)</code></td><td width="20%"><code>COMPLEX(8) X</code></td><td width="20%"><code>COMPLEX(8)</code></td><td width="25%">GNU extension</td></tr>
</table>
</dd>
</dl>



<hr>
<a name="SRAND"></a>
<div class="header">
<p>
Next: <a href="#STAT" accesskey="n" rel="next">STAT</a>, Previous: <a href="#SQRT" accesskey="p" rel="prev">SQRT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SRAND-_002d_002d_002d-Reinitialize-the-random-number-generator"></a>
<h3 class="section">7.205 <code>SRAND</code> &mdash; Reinitialize the random number generator</h3>
<a name="index-SRAND"></a>
<a name="index-random-number-generation_002c-seeding-1"></a>
<a name="index-seeding-a-random-number-generator-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>SRAND</code> reinitializes the pseudo-random number generator
called by <code>RAND</code> and <code>IRAND</code>. The new seed used by the
generator is specified by the required argument <var>SEED</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL SRAND(SEED)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SEED</var></td><td width="70%">Shall be a scalar <code>INTEGER(kind=4)</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>Does not return anything.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <code>RAND</code> and <code>IRAND</code> for examples.
</p>
</dd>
<dt><em>Notes</em>:</dt>
<dd><p>The Fortran 2003 standard specifies the intrinsic <code>RANDOM_SEED</code> to
initialize the pseudo-random numbers generator and <code>RANDOM_NUMBER</code>
to generate pseudo-random numbers. Please note that in
GNU Fortran, these two sets of intrinsics (<code>RAND</code>,
<code>IRAND</code> and <code>SRAND</code> on the one hand, <code>RANDOM_NUMBER</code> and
<code>RANDOM_SEED</code> on the other hand) access two independent
pseudo-random number generators.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#RAND">RAND</a>, <a href="#RANDOM_005fSEED">RANDOM_SEED</a>, <a href="#RANDOM_005fNUMBER">RANDOM_NUMBER</a>
</p>
</dd>
</dl>



<hr>
<a name="STAT"></a>
<div class="header">
<p>
Next: <a href="#SUM" accesskey="n" rel="next">SUM</a>, Previous: <a href="#SRAND" accesskey="p" rel="prev">SRAND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="STAT-_002d_002d_002d-Get-file-status"></a>
<h3 class="section">7.206 <code>STAT</code> &mdash; Get file status</h3>
<a name="index-STAT"></a>
<a name="index-file-system_002c-file-status-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>This function returns information about a file. No permissions are required on 
the file itself, but execute (search) permission is required on all of the 
directories in path that lead to the file.
</p>
<p>The elements that are obtained and stored in the array <code>BUFF</code>:
</p><table>
<tr><td width="15%"><code>buff(1)</code></td><td width="70%">Device ID</td></tr>
<tr><td width="15%"><code>buff(2)</code></td><td width="70%">Inode number</td></tr>
<tr><td width="15%"><code>buff(3)</code></td><td width="70%">File mode</td></tr>
<tr><td width="15%"><code>buff(4)</code></td><td width="70%">Number of links</td></tr>
<tr><td width="15%"><code>buff(5)</code></td><td width="70%">Owner&rsquo;s uid</td></tr>
<tr><td width="15%"><code>buff(6)</code></td><td width="70%">Owner&rsquo;s gid</td></tr>
<tr><td width="15%"><code>buff(7)</code></td><td width="70%">ID of device containing directory entry for file (0 if not available)</td></tr>
<tr><td width="15%"><code>buff(8)</code></td><td width="70%">File size (bytes)</td></tr>
<tr><td width="15%"><code>buff(9)</code></td><td width="70%">Last access time</td></tr>
<tr><td width="15%"><code>buff(10)</code></td><td width="70%">Last modification time</td></tr>
<tr><td width="15%"><code>buff(11)</code></td><td width="70%">Last file status change time</td></tr>
<tr><td width="15%"><code>buff(12)</code></td><td width="70%">Preferred I/O block size (-1 if not available)</td></tr>
<tr><td width="15%"><code>buff(13)</code></td><td width="70%">Number of blocks allocated (-1 if not available)</td></tr>
</table>

<p>Not all these elements are relevant on all systems. 
If an element is not relevant, it is returned as 0.
</p>
<p>This intrinsic is provided in both subroutine and function forms; however,
only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL STAT(FILE,BUFF[,STATUS])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>FILE</var></td><td width="70%">The type shall be <code>CHARACTER</code>, of the
default kind and a valid path within the file system.</td></tr>
<tr><td width="15%"><var>BUFF</var></td><td width="70%">The type shall be <code>INTEGER(4), DIMENSION(13)</code>.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) status flag of type <code>INTEGER(4)</code>. Returns 0 
on success and a system specific error code otherwise.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_stat
  INTEGER, DIMENSION(13) :: buff
  INTEGER :: status

  CALL STAT(&quot;/etc/passwd&quot;, buff, status)

  IF (status == 0) THEN
    WRITE (*, FMT=&quot;('Device ID:',               T30, I19)&quot;) buff(1)
    WRITE (*, FMT=&quot;('Inode number:',            T30, I19)&quot;) buff(2)
    WRITE (*, FMT=&quot;('File mode (octal):',       T30, O19)&quot;) buff(3)
    WRITE (*, FMT=&quot;('Number of links:',         T30, I19)&quot;) buff(4)
    WRITE (*, FMT=&quot;('Owner''s uid:',            T30, I19)&quot;) buff(5)
    WRITE (*, FMT=&quot;('Owner''s gid:',            T30, I19)&quot;) buff(6)
    WRITE (*, FMT=&quot;('Device where located:',    T30, I19)&quot;) buff(7)
    WRITE (*, FMT=&quot;('File size:',               T30, I19)&quot;) buff(8)
    WRITE (*, FMT=&quot;('Last access time:',        T30, A19)&quot;) CTIME(buff(9))
    WRITE (*, FMT=&quot;('Last modification time',   T30, A19)&quot;) CTIME(buff(10))
    WRITE (*, FMT=&quot;('Last status change time:', T30, A19)&quot;) CTIME(buff(11))
    WRITE (*, FMT=&quot;('Preferred block size:',    T30, I19)&quot;) buff(12)
    WRITE (*, FMT=&quot;('No. of blocks allocated:', T30, I19)&quot;) buff(13)
  END IF
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>To stat an open file: <a href="#FSTAT">FSTAT</a>, to stat a link: <a href="#LSTAT">LSTAT</a>
</p></dd>
</dl>



<hr>
<a name="SUM"></a>
<div class="header">
<p>
Next: <a href="#SYMLNK" accesskey="n" rel="next">SYMLNK</a>, Previous: <a href="#STAT" accesskey="p" rel="prev">STAT</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SUM-_002d_002d_002d-Sum-of-array-elements"></a>
<h3 class="section">7.207 <code>SUM</code> &mdash; Sum of array elements</h3>
<a name="index-SUM"></a>
<a name="index-array_002c-sum"></a>
<a name="index-array_002c-add-elements"></a>
<a name="index-array_002c-conditionally-add-elements"></a>
<a name="index-sum-array-elements"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Adds the elements of <var>ARRAY</var> along dimension <var>DIM</var> if
the corresponding element in <var>MASK</var> is <code>TRUE</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = SUM(ARRAY[, MASK])</code>
<code>RESULT = SUM(ARRAY, DIM[, MASK])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array of type <code>INTEGER</code>, 
<code>REAL</code> or <code>COMPLEX</code>.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) shall be a scalar of type 
<code>INTEGER</code> with a value in the range from 1 to n, where n 
equals the rank of <var>ARRAY</var>.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">(Optional) shall be of type <code>LOGICAL</code> 
and either be a scalar or an array of the same shape as <var>ARRAY</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result is of the same type as <var>ARRAY</var>.
</p>
<p>If <var>DIM</var> is absent, a scalar with the sum of all elements in <var>ARRAY</var>
is returned. Otherwise, an array of rank n-1, where n equals the rank of 
<var>ARRAY</var>,and a shape similar to that of <var>ARRAY</var> with dimension <var>DIM</var> 
dropped is returned.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_sum
  INTEGER :: x(5) = (/ 1, 2, 3, 4 ,5 /)
  print *, SUM(x)                        ! all elements, sum = 15
  print *, SUM(x, MASK=MOD(x, 2)==1)     ! odd elements, sum = 9
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#PRODUCT">PRODUCT</a>
</p></dd>
</dl>



<hr>
<a name="SYMLNK"></a>
<div class="header">
<p>
Next: <a href="#SYSTEM" accesskey="n" rel="next">SYSTEM</a>, Previous: <a href="#SUM" accesskey="p" rel="prev">SUM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SYMLNK-_002d_002d_002d-Create-a-symbolic-link"></a>
<h3 class="section">7.208 <code>SYMLNK</code> &mdash; Create a symbolic link</h3>
<a name="index-SYMLNK"></a>
<a name="index-file-system_002c-create-link-1"></a>
<a name="index-file-system_002c-soft-link"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Makes a symbolic link from file <var>PATH1</var> to <var>PATH2</var>. A null
character (<code>CHAR(0)</code>) can be used to mark the end of the names in
<var>PATH1</var> and <var>PATH2</var>; otherwise, trailing blanks in the file
names are ignored.  If the <var>STATUS</var> argument is supplied, it
contains 0 on success or a nonzero error code upon return; see
<code>symlink(2)</code>.  If the system does not supply <code>symlink(2)</code>, 
<code>ENOSYS</code> is returned.
</p>
<p>This intrinsic is provided in both subroutine and function forms;
however, only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL SYMLNK(PATH1, PATH2 [, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = SYMLNK(PATH1, PATH2)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>PATH1</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>PATH2</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) Shall be of default <code>INTEGER</code> type.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LINK">LINK</a>, <a href="#UNLINK">UNLINK</a>
</p>
</dd>
</dl>



<hr>
<a name="SYSTEM"></a>
<div class="header">
<p>
Next: <a href="#SYSTEM_005fCLOCK" accesskey="n" rel="next">SYSTEM_CLOCK</a>, Previous: <a href="#SYMLNK" accesskey="p" rel="prev">SYMLNK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SYSTEM-_002d_002d_002d-Execute-a-shell-command"></a>
<h3 class="section">7.209 <code>SYSTEM</code> &mdash; Execute a shell command</h3>
<a name="index-SYSTEM"></a>
<a name="index-system_002c-system-call"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Passes the command <var>COMMAND</var> to a shell (see <code>system(3)</code>). If
argument <var>STATUS</var> is present, it contains the value returned by
<code>system(3)</code>, which is presumably 0 if the shell command succeeded.
Note that which shell is used to invoke the command is system-dependent
and environment-dependent.
</p>
<p>This intrinsic is provided in both subroutine and function forms;
however, only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL SYSTEM(COMMAND [, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = SYSTEM(COMMAND)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>COMMAND</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) Shall be of default <code>INTEGER</code> type.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
</dl>



<hr>
<a name="SYSTEM_005fCLOCK"></a>
<div class="header">
<p>
Next: <a href="#TAN" accesskey="n" rel="next">TAN</a>, Previous: <a href="#SYSTEM" accesskey="p" rel="prev">SYSTEM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="SYSTEM_005fCLOCK-_002d_002d_002d-Time-function"></a>
<h3 class="section">7.210 <code>SYSTEM_CLOCK</code> &mdash; Time function</h3>
<a name="index-SYSTEM_005fCLOCK"></a>
<a name="index-time_002c-clock-ticks-2"></a>
<a name="index-clock-ticks-2"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Determines the <var>COUNT</var> of milliseconds of wall clock time since 
the Epoch (00:00:00 UTC, January 1, 1970) modulo <var>COUNT_MAX</var>, 
<var>COUNT_RATE</var> determines the number of clock ticks per second.
<var>COUNT_RATE</var> and <var>COUNT_MAX</var> are constant and specific to 
<code>gfortran</code>.
</p>
<p>If there is no clock, <var>COUNT</var> is set to <code>-HUGE(COUNT)</code>, and
<var>COUNT_RATE</var> and <var>COUNT_MAX</var> are set to zero 
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL SYSTEM_CLOCK([COUNT, COUNT_RATE, COUNT_MAX])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>COUNT</var></td><td width="70%">(Optional) shall be a scalar of type default 
<code>INTEGER</code> with <code>INTENT(OUT)</code>.</td></tr>
<tr><td width="15%"><var>COUNT_RATE</var></td><td width="70%">(Optional) shall be a scalar of type default 
<code>INTEGER</code> with <code>INTENT(OUT)</code>.</td></tr>
<tr><td width="15%"><var>COUNT_MAX</var></td><td width="70%">(Optional) shall be a scalar of type default 
<code>INTEGER</code> with <code>INTENT(OUT)</code>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_system_clock
  INTEGER :: count, count_rate, count_max
  CALL SYSTEM_CLOCK(count, count_rate, count_max)
  WRITE(*,*) count, count_rate, count_max
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#DATE_005fAND_005fTIME">DATE_AND_TIME</a>, <a href="#CPU_005fTIME">CPU_TIME</a>
</p></dd>
</dl>



<hr>
<a name="TAN"></a>
<div class="header">
<p>
Next: <a href="#TANH" accesskey="n" rel="next">TANH</a>, Previous: <a href="#SYSTEM_005fCLOCK" accesskey="p" rel="prev">SYSTEM_CLOCK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TAN-_002d_002d_002d-Tangent-function"></a>
<h3 class="section">7.211 <code>TAN</code> &mdash; Tangent function</h3>
<a name="index-TAN"></a>
<a name="index-DTAN"></a>
<a name="index-trigonometric-function_002c-tangent"></a>
<a name="index-tangent"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>TAN(X)</code> computes the tangent of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = TAN(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code>.  The kind type parameter is
the same as <var>X</var>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_tan
  real(8) :: x = 0.165_8
  x = tan(x)
end program test_tan
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DTAN(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 95 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ATAN">ATAN</a>
</p></dd>
</dl>



<hr>
<a name="TANH"></a>
<div class="header">
<p>
Next: <a href="#TIME" accesskey="n" rel="next">TIME</a>, Previous: <a href="#TAN" accesskey="p" rel="prev">TAN</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TANH-_002d_002d_002d-Hyperbolic-tangent-function"></a>
<h3 class="section">7.212 <code>TANH</code> &mdash; Hyperbolic tangent function</h3>
<a name="index-TANH"></a>
<a name="index-DTANH"></a>
<a name="index-hyperbolic-tangent"></a>
<a name="index-hyperbolic-function_002c-tangent"></a>
<a name="index-tangent_002c-hyperbolic"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>TANH(X)</code> computes the hyperbolic tangent of <var>X</var>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 77 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>X = TANH(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>REAL</code> and lies in the range
<em>- 1 \leq tanh(x) \leq 1 </em>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">program test_tanh
  real(8) :: x = 2.1_8
  x = tanh(x)
end program test_tanh
</pre></div>

</dd>
<dt><em>Specific names</em>:</dt>
<dd><table>
<tr><td width="20%">Name</td><td width="20%">Argument</td><td width="20%">Return type</td><td width="25%">Standard</td></tr>
<tr><td width="20%"><code>DTANH(X)</code></td><td width="20%"><code>REAL(8) X</code></td><td width="20%"><code>REAL(8)</code></td><td width="25%">Fortran 95 and later</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ATANH">ATANH</a>
</p></dd>
</dl>



<hr>
<a name="TIME"></a>
<div class="header">
<p>
Next: <a href="#TIME8" accesskey="n" rel="next">TIME8</a>, Previous: <a href="#TANH" accesskey="p" rel="prev">TANH</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TIME-_002d_002d_002d-Time-function"></a>
<h3 class="section">7.213 <code>TIME</code> &mdash; Time function</h3>
<a name="index-TIME"></a>
<a name="index-time_002c-current-3"></a>
<a name="index-current-time-3"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the current time encoded as an integer (in the manner of the
UNIX function <code>time(3)</code>). This value is suitable for passing to
<code>CTIME()</code>, <code>GMTIME()</code>, and <code>LTIME()</code>.
</p>
<p>This intrinsic is not fully portable, such as to systems with 32-bit
<code>INTEGER</code> types but supporting times wider than 32 bits. Therefore,
the values returned by this intrinsic might be, or become, negative, or
numerically less than previous values, during a single run of the
compiled program.
</p>
<p>See <a href="#TIME8">TIME8</a>, for information on a similar intrinsic that might be
portable to more GNU Fortran implementations, though to fewer Fortran
compilers.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = TIME()</code>
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>INTEGER(4)</code>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CTIME">CTIME</a>, <a href="#GMTIME">GMTIME</a>, <a href="#LTIME">LTIME</a>, <a href="#MCLOCK">MCLOCK</a>, <a href="#TIME8">TIME8</a>
</p>
</dd>
</dl>



<hr>
<a name="TIME8"></a>
<div class="header">
<p>
Next: <a href="#TINY" accesskey="n" rel="next">TINY</a>, Previous: <a href="#TIME" accesskey="p" rel="prev">TIME</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TIME8-_002d_002d_002d-Time-function-_002864_002dbit_0029"></a>
<h3 class="section">7.214 <code>TIME8</code> &mdash; Time function (64-bit)</h3>
<a name="index-TIME8"></a>
<a name="index-time_002c-current-4"></a>
<a name="index-current-time-4"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the current time encoded as an integer (in the manner of the
UNIX function <code>time(3)</code>). This value is suitable for passing to
<code>CTIME()</code>, <code>GMTIME()</code>, and <code>LTIME()</code>.
</p>
<p><em>Warning:</em> this intrinsic does not increase the range of the timing
values over that returned by <code>time(3)</code>. On a system with a 32-bit
<code>time(3)</code>, <code>TIME8()</code> will return a 32-bit value, even though
it is converted to a 64-bit <code>INTEGER(8)</code> value. That means
overflows of the 32-bit value can still occur. Therefore, the values
returned by this intrinsic might be or become negative or numerically
less than previous values during a single run of the compiled program.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = TIME8()</code>
</p>
</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is a scalar of type <code>INTEGER(8)</code>.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#CTIME">CTIME</a>, <a href="#GMTIME">GMTIME</a>, <a href="#LTIME">LTIME</a>, <a href="#MCLOCK8">MCLOCK8</a>, <a href="#TIME">TIME</a>
</p>
</dd>
</dl>



<hr>
<a name="TINY"></a>
<div class="header">
<p>
Next: <a href="#TRAILZ" accesskey="n" rel="next">TRAILZ</a>, Previous: <a href="#TIME8" accesskey="p" rel="prev">TIME8</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TINY-_002d_002d_002d-Smallest-positive-number-of-a-real-kind"></a>
<h3 class="section">7.215 <code>TINY</code> &mdash; Smallest positive number of a real kind</h3>
<a name="index-TINY"></a>
<a name="index-limits_002c-smallest-number"></a>
<a name="index-model-representation_002c-smallest-number"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>TINY(X)</code> returns the smallest positive (non zero) number
in the model of the type of <code>X</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = TINY(X)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">Shall be of type <code>REAL</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of the same type and kind as <var>X</var>
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><p>See <code>HUGE</code> for an example.
</p></dd>
</dl>



<hr>
<a name="TRAILZ"></a>
<div class="header">
<p>
Next: <a href="#TRANSFER" accesskey="n" rel="next">TRANSFER</a>, Previous: <a href="#TINY" accesskey="p" rel="prev">TINY</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TRAILZ-_002d_002d_002d-Number-of-trailing-zero-bits-of-an-integer"></a>
<h3 class="section">7.216 <code>TRAILZ</code> &mdash; Number of trailing zero bits of an integer</h3>
<a name="index-TRAILZ"></a>
<a name="index-zero-bits-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p><code>TRAILZ</code> returns the number of trailing zero bits of an integer.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2008 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = TRAILZ(I)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>I</var></td><td width="70%">Shall be of type <code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The type of the return value is the default <code>INTEGER</code>.
If all the bits of <code>I</code> are zero, the result value is <code>BIT_SIZE(I)</code>.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_trailz
  WRITE (*,*) TRAILZ(8)  ! prints 3
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#BIT_005fSIZE">BIT_SIZE</a>, <a href="#LEADZ">LEADZ</a>
</p></dd>
</dl>



<hr>
<a name="TRANSFER"></a>
<div class="header">
<p>
Next: <a href="#TRANSPOSE" accesskey="n" rel="next">TRANSPOSE</a>, Previous: <a href="#TRAILZ" accesskey="p" rel="prev">TRAILZ</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TRANSFER-_002d_002d_002d-Transfer-bit-patterns"></a>
<h3 class="section">7.217 <code>TRANSFER</code> &mdash; Transfer bit patterns</h3>
<a name="index-TRANSFER"></a>
<a name="index-bits_002c-move-1"></a>
<a name="index-type-cast"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Interprets the bitwise representation of <var>SOURCE</var> in memory as if it
is the representation of a variable or array of the same type and type
parameters as <var>MOLD</var>.
</p>
<p>This is approximately equivalent to the C concept of <em>casting</em> one
type to another.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = TRANSFER(SOURCE, MOLD[, SIZE])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>SOURCE</var></td><td width="70%">Shall be a scalar or an array of any type.</td></tr>
<tr><td width="15%"><var>MOLD</var></td><td width="70%">Shall be a scalar or an array of any type.</td></tr>
<tr><td width="15%"><var>SIZE</var></td><td width="70%">(Optional) shall be a scalar of type 
<code>INTEGER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result has the same type as <var>MOLD</var>, with the bit level
representation of <var>SOURCE</var>.  If <var>SIZE</var> is present, the result is
a one-dimensional array of length <var>SIZE</var>.  If <var>SIZE</var> is absent
but <var>MOLD</var> is an array (of any size or shape), the result is a one-
dimensional array of the minimum length needed to contain the entirety
of the bitwise representation of <var>SOURCE</var>.   If <var>SIZE</var> is absent
and <var>MOLD</var> is a scalar, the result is a scalar.
</p>
<p>If the bitwise representation of the result is longer than that of
<var>SOURCE</var>, then the leading bits of the result correspond to those of
<var>SOURCE</var> and any trailing bits are filled arbitrarily.
</p>
<p>When the resulting bit representation does not correspond to a valid
representation of a variable of the same type as <var>MOLD</var>, the results
are undefined, and subsequent operations on the result cannot be
guaranteed to produce sensible behavior.  For example, it is possible to
create <code>LOGICAL</code> variables for which <code><var>VAR</var></code> and
<code>.NOT.<var>VAR</var></code> both appear to be true.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_transfer
  integer :: x = 2143289344
  print *, transfer(x, 1.0)    ! prints &quot;NaN&quot; on i686
END PROGRAM
</pre></div>
</dd>
</dl>



<hr>
<a name="TRANSPOSE"></a>
<div class="header">
<p>
Next: <a href="#TRIM" accesskey="n" rel="next">TRIM</a>, Previous: <a href="#TRANSFER" accesskey="p" rel="prev">TRANSFER</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TRANSPOSE-_002d_002d_002d-Transpose-an-array-of-rank-two"></a>
<h3 class="section">7.218 <code>TRANSPOSE</code> &mdash; Transpose an array of rank two</h3>
<a name="index-TRANSPOSE"></a>
<a name="index-array_002c-transpose"></a>
<a name="index-matrix_002c-transpose"></a>
<a name="index-transpose"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Transpose an array of rank two. Element (i, j) of the result has the value 
<code>MATRIX(j, i)</code>, for all i, j.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = TRANSPOSE(MATRIX)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>MATRIX</var></td><td width="70%">Shall be an array of any type and have a rank of two.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The result has the same type as <var>MATRIX</var>, and has shape 
<code>(/ m, n /)</code> if <var>MATRIX</var> has shape <code>(/ n, m /)</code>.
</p></dd>
</dl>



<hr>
<a name="TRIM"></a>
<div class="header">
<p>
Next: <a href="#TTYNAM" accesskey="n" rel="next">TTYNAM</a>, Previous: <a href="#TRANSPOSE" accesskey="p" rel="prev">TRANSPOSE</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TRIM-_002d_002d_002d-Remove-trailing-blank-characters-of-a-string"></a>
<h3 class="section">7.219 <code>TRIM</code> &mdash; Remove trailing blank characters of a string</h3>
<a name="index-TRIM"></a>
<a name="index-string_002c-remove-trailing-whitespace"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Removes trailing blank characters of a string.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = TRIM(STRING)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">Shall be a scalar of type <code>CHARACTER</code>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>A scalar of type <code>CHARACTER</code> which length is that of <var>STRING</var>
less the number of trailing blanks.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_trim
  CHARACTER(len=10), PARAMETER :: s = &quot;GFORTRAN  &quot;
  WRITE(*,*) LEN(s), LEN(TRIM(s))  ! &quot;10 8&quot;, with/without trailing blanks
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ADJUSTL">ADJUSTL</a>, <a href="#ADJUSTR">ADJUSTR</a>
</p></dd>
</dl>



<hr>
<a name="TTYNAM"></a>
<div class="header">
<p>
Next: <a href="#UBOUND" accesskey="n" rel="next">UBOUND</a>, Previous: <a href="#TRIM" accesskey="p" rel="prev">TRIM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="TTYNAM-_002d_002d_002d-Get-the-name-of-a-terminal-device_002e"></a>
<h3 class="section">7.220 <code>TTYNAM</code> &mdash; Get the name of a terminal device.</h3>
<a name="index-TTYNAM"></a>
<a name="index-system_002c-terminal-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Get the name of a terminal device. For more information, 
see <code>ttyname(3)</code>.
</p>
<p>This intrinsic is provided in both subroutine and function forms; 
however, only one form can be used in any given program unit. 
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL TTYNAM(UNIT, NAME)</code></td></tr>
<tr><td width="80%"><code>NAME = TTYNAM(UNIT)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>UNIT</var></td><td width="70%">Shall be a scalar <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>NAME</var></td><td width="70%">Shall be of type <code>CHARACTER</code>.</td></tr>
</table>

</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_ttynam
  INTEGER :: unit
  DO unit = 1, 10
    IF (isatty(unit=unit)) write(*,*) ttynam(unit)
  END DO
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#ISATTY">ISATTY</a>
</p></dd>
</dl>



<hr>
<a name="UBOUND"></a>
<div class="header">
<p>
Next: <a href="#UMASK" accesskey="n" rel="next">UMASK</a>, Previous: <a href="#TTYNAM" accesskey="p" rel="prev">TTYNAM</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="UBOUND-_002d_002d_002d-Upper-dimension-bounds-of-an-array"></a>
<h3 class="section">7.221 <code>UBOUND</code> &mdash; Upper dimension bounds of an array</h3>
<a name="index-UBOUND"></a>
<a name="index-array_002c-upper-bound"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Returns the upper bounds of an array, or a single upper bound
along the <var>DIM</var> dimension.
</p></dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Inquiry function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = UBOUND(ARRAY [, DIM [, KIND]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>ARRAY</var></td><td width="70%">Shall be an array, of any type.</td></tr>
<tr><td width="15%"><var>DIM</var></td><td width="70%">(Optional) Shall be a scalar <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
If <var>DIM</var> is absent, the result is an array of the upper bounds of
<var>ARRAY</var>.  If <var>DIM</var> is present, the result is a scalar
corresponding to the upper bound of the array along that dimension.  If
<var>ARRAY</var> is an expression rather than a whole array or array
structure component, or if it has a zero extent along the relevant
dimension, the upper bound is taken to be the number of elements along
the relevant dimension.
</p>
</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LBOUND">LBOUND</a>
</p></dd>
</dl>



<hr>
<a name="UMASK"></a>
<div class="header">
<p>
Next: <a href="#UNLINK" accesskey="n" rel="next">UNLINK</a>, Previous: <a href="#UBOUND" accesskey="p" rel="prev">UBOUND</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="UMASK-_002d_002d_002d-Set-the-file-creation-mask"></a>
<h3 class="section">7.222 <code>UMASK</code> &mdash; Set the file creation mask</h3>
<a name="index-UMASK"></a>
<a name="index-file-system_002c-file-creation-mask"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Sets the file creation mask to <var>MASK</var> and returns the old value in
argument <var>OLD</var> if it is supplied. See <code>umask(2)</code>.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>CALL UMASK(MASK [, OLD])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>MASK</var></td><td width="70%">Shall be a scalar of type <code>INTEGER</code>.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">(Optional) Shall be a scalar of type
<code>INTEGER</code>.</td></tr>
</table>

</dd>
</dl>



<hr>
<a name="UNLINK"></a>
<div class="header">
<p>
Next: <a href="#UNPACK" accesskey="n" rel="next">UNPACK</a>, Previous: <a href="#UMASK" accesskey="p" rel="prev">UMASK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="UNLINK-_002d_002d_002d-Remove-a-file-from-the-file-system"></a>
<h3 class="section">7.223 <code>UNLINK</code> &mdash; Remove a file from the file system</h3>
<a name="index-UNLINK"></a>
<a name="index-file-system_002c-remove-file"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Unlinks the file <var>PATH</var>. A null character (<code>CHAR(0)</code>) can be
used to mark the end of the name in <var>PATH</var>; otherwise, trailing
blanks in the file name are ignored.  If the <var>STATUS</var> argument is
supplied, it contains 0 on success or a nonzero error code upon return;
see <code>unlink(2)</code>.
</p>
<p>This intrinsic is provided in both subroutine and function forms;
however, only one form can be used in any given program unit.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Subroutine, function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><table>
<tr><td width="80%"><code>CALL UNLINK(PATH [, STATUS])</code></td></tr>
<tr><td width="80%"><code>STATUS = UNLINK(PATH)</code></td></tr>
</table>

</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>PATH</var></td><td width="70%">Shall be of default <code>CHARACTER</code> type.</td></tr>
<tr><td width="15%"><var>STATUS</var></td><td width="70%">(Optional) Shall be of default <code>INTEGER</code> type.</td></tr>
</table>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#LINK">LINK</a>, <a href="#SYMLNK">SYMLNK</a>
</p></dd>
</dl>



<hr>
<a name="UNPACK"></a>
<div class="header">
<p>
Next: <a href="#VERIFY" accesskey="n" rel="next">VERIFY</a>, Previous: <a href="#UNLINK" accesskey="p" rel="prev">UNLINK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="UNPACK-_002d_002d_002d-Unpack-an-array-of-rank-one-into-an-array"></a>
<h3 class="section">7.224 <code>UNPACK</code> &mdash; Unpack an array of rank one into an array</h3>
<a name="index-UNPACK"></a>
<a name="index-array_002c-unpacking"></a>
<a name="index-array_002c-increase-dimension-1"></a>
<a name="index-array_002c-scatter-elements"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Store the elements of <var>VECTOR</var> in an array of higher rank.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Transformational function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = UNPACK(VECTOR, MASK, FIELD)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>VECTOR</var></td><td width="70%">Shall be an array of any type and rank one. It 
shall have at least as many elements as <var>MASK</var> has <code>TRUE</code> values.</td></tr>
<tr><td width="15%"><var>MASK</var></td><td width="70%">Shall be an array of type <code>LOGICAL</code>.</td></tr>
<tr><td width="15%"><var>FIELD</var></td><td width="70%">Shall be of the same type as <var>VECTOR</var> and have
the same shape as <var>MASK</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The resulting array corresponds to <var>FIELD</var> with <code>TRUE</code> elements
of <var>MASK</var> replaced by values from <var>VECTOR</var> in array element order.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_unpack
  integer :: vector(2)  = (/1,1/)
  logical :: mask(4)  = (/ .TRUE., .FALSE., .FALSE., .TRUE. /)
  integer :: field(2,2) = 0, unity(2,2)

  ! result: unity matrix
  unity = unpack(vector, reshape(mask, (/2,2/)), field)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#PACK">PACK</a>, <a href="#SPREAD">SPREAD</a>
</p></dd>
</dl>



<hr>
<a name="VERIFY"></a>
<div class="header">
<p>
Next: <a href="#XOR" accesskey="n" rel="next">XOR</a>, Previous: <a href="#UNPACK" accesskey="p" rel="prev">UNPACK</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="VERIFY-_002d_002d_002d-Scan-a-string-for-the-absence-of-a-set-of-characters"></a>
<h3 class="section">7.225 <code>VERIFY</code> &mdash; Scan a string for the absence of a set of characters</h3>
<a name="index-VERIFY"></a>
<a name="index-string_002c-find-missing-set"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Verifies that all the characters in a <var>SET</var> are present in a <var>STRING</var>.
</p>
<p>If <var>BACK</var> is either absent or equals <code>FALSE</code>, this function
returns the position of the leftmost character of <var>STRING</var> that is
not in <var>SET</var>. If <var>BACK</var> equals <code>TRUE</code>, the rightmost position
is returned. If all characters of <var>SET</var> are found in <var>STRING</var>, the 
result is zero.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 95 and later, with <var>KIND</var> argument Fortran 2003 and later
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Elemental function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = VERIFY(STRING, SET[, BACK [, KIND]])</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>STRING</var></td><td width="70%">Shall be of type <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>SET</var></td><td width="70%">Shall be of type <code>CHARACTER</code>.</td></tr>
<tr><td width="15%"><var>BACK</var></td><td width="70%">(Optional) shall be of type <code>LOGICAL</code>.</td></tr>
<tr><td width="15%"><var>KIND</var></td><td width="70%">(Optional) An <code>INTEGER</code> initialization
expression indicating the kind parameter of the result.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return value is of type <code>INTEGER</code> and of kind <var>KIND</var>. If
<var>KIND</var> is absent, the return value is of default integer kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_verify
  WRITE(*,*) VERIFY(&quot;FORTRAN&quot;, &quot;AO&quot;)           ! 1, found 'F'
  WRITE(*,*) VERIFY(&quot;FORTRAN&quot;, &quot;FOO&quot;)          ! 3, found 'R'
  WRITE(*,*) VERIFY(&quot;FORTRAN&quot;, &quot;C++&quot;)          ! 1, found 'F'
  WRITE(*,*) VERIFY(&quot;FORTRAN&quot;, &quot;C++&quot;, .TRUE.)  ! 7, found 'N'
  WRITE(*,*) VERIFY(&quot;FORTRAN&quot;, &quot;FORTRAN&quot;)      ! 0' found none
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p><a href="#SCAN">SCAN</a>, <a href="#INDEX-intrinsic">INDEX intrinsic</a>
</p></dd>
</dl>



<hr>
<a name="XOR"></a>
<div class="header">
<p>
Previous: <a href="#VERIFY" accesskey="p" rel="prev">VERIFY</a>, Up: <a href="#Intrinsic-Procedures" accesskey="u" rel="up">Intrinsic Procedures</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="XOR-_002d_002d_002d-Bitwise-logical-exclusive-OR"></a>
<h3 class="section">7.226 <code>XOR</code> &mdash; Bitwise logical exclusive OR</h3>
<a name="index-XOR"></a>
<a name="index-bitwise-logical-exclusive-or-1"></a>
<a name="index-logical-exclusive-or_002c-bitwise-1"></a>

<dl compact="compact">
<dt><em>Description</em>:</dt>
<dd><p>Bitwise logical exclusive or. 
</p>
<p>This intrinsic routine is provided for backwards compatibility with 
GNU Fortran 77.  For integer arguments, programmers should consider
the use of the <a href="#IEOR">IEOR</a> intrinsic defined by the Fortran standard.
</p>
</dd>
<dt><em>Standard</em>:</dt>
<dd><p>GNU extension
</p>
</dd>
<dt><em>Class</em>:</dt>
<dd><p>Function
</p>
</dd>
<dt><em>Syntax</em>:</dt>
<dd><p><code>RESULT = XOR(X, Y)</code>
</p>
</dd>
<dt><em>Arguments</em>:</dt>
<dd><table>
<tr><td width="15%"><var>X</var></td><td width="70%">The type shall be either  a scalar <code>INTEGER</code>
type or a scalar <code>LOGICAL</code> type.</td></tr>
<tr><td width="15%"><var>Y</var></td><td width="70%">The type shall be the same as the type of <var>I</var>.</td></tr>
</table>

</dd>
<dt><em>Return value</em>:</dt>
<dd><p>The return type is either a scalar <code>INTEGER</code> or a scalar
<code>LOGICAL</code>.  If the kind type parameters differ, then the
smaller kind type is implicitly converted to larger kind, and the 
return has the larger kind.
</p>
</dd>
<dt><em>Example</em>:</dt>
<dd><div class="smallexample">
<pre class="smallexample">PROGRAM test_xor
  LOGICAL :: T = .TRUE., F = .FALSE.
  INTEGER :: a, b
  DATA a / Z'F' /, b / Z'3' /

  WRITE (*,*) XOR(T, T), XOR(T, F), XOR(F, T), XOR(F, F)
  WRITE (*,*) XOR(a, b)
END PROGRAM
</pre></div>

</dd>
<dt><em>See also</em>:</dt>
<dd><p>Fortran 95 elemental function: <a href="#IEOR">IEOR</a>
</p></dd>
</dl>



<hr>
<a name="Intrinsic-Modules"></a>
<div class="header">
<p>
Next: <a href="#Contributing" accesskey="n" rel="next">Contributing</a>, Previous: <a href="#Intrinsic-Procedures" accesskey="p" rel="prev">Intrinsic Procedures</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Intrinsic-Modules-1"></a>
<h2 class="chapter">8 Intrinsic Modules</h2>
<a name="index-intrinsic-Modules"></a>

<a name="ISO_005fFORTRAN_005fENV"></a>
<h3 class="section">8.1 <code>ISO_FORTRAN_ENV</code></h3>
<dl compact="compact">
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later
</p></dd>
</dl>

<p>The <code>ISO_FORTRAN_ENV</code> module provides the following scalar default-integer
named constants:
</p>
<dl compact="compact">
<dt><code>CHARACTER_STORAGE_SIZE</code>:</dt>
<dd><p>Size in bits of the character storage unit.
</p>
</dd>
<dt><code>ERROR_UNIT</code>:</dt>
<dd><p>Identifies the preconnected unit used for error reporting.
</p>
</dd>
<dt><code>FILE_STORAGE_SIZE</code>:</dt>
<dd><p>Size in bits of the file-storage unit.
</p>
</dd>
<dt><code>INPUT_UNIT</code>:</dt>
<dd><p>Identifies the preconnected unit identified by the asterisk
(<code>*</code>) in <code>READ</code> statement.
</p>
</dd>
<dt><code>IOSTAT_END</code>:</dt>
<dd><p>The value assigned to the variable passed to the IOSTAT= specifier of
an input/output statement if an end-of-file condition occurred.
</p>
</dd>
<dt><code>IOSTAT_EOR</code>:</dt>
<dd><p>The value assigned to the variable passed to the IOSTAT= specifier of
an input/output statement if an end-of-record condition occurred.
</p>
</dd>
<dt><code>NUMERIC_STORAGE_SIZE</code>:</dt>
<dd><p>The size in bits of the numeric storage unit.
</p>
</dd>
<dt><code>OUTPUT_UNIT</code>:</dt>
<dd><p>Identifies the preconnected unit identified by the asterisk
(<code>*</code>) in <code>WRITE</code> statement.
</p></dd>
</dl>

<a name="ISO_005fC_005fBINDING"></a>
<h3 class="section">8.2 <code>ISO_C_BINDING</code></h3>
<dl compact="compact">
<dt><em>Standard</em>:</dt>
<dd><p>Fortran 2003 and later, GNU extensions
</p></dd>
</dl>

<p>The following intrinsic procedures are provided by the module; their
definition can be found in the section Intrinsic Procedures of this
manual.
</p>
<dl compact="compact">
<dt><code>C_ASSOCIATED</code></dt>
<dt><code>C_F_POINTER</code></dt>
<dt><code>C_F_PROCPOINTER</code></dt>
<dt><code>C_FUNLOC</code></dt>
<dt><code>C_LOC</code></dt>
</dl>

<p>The <code>ISO_C_BINDING</code> module provides the following named constants of the
type integer, which can be used as KIND type parameter. Note that GNU
Fortran currently does not support the <code>C_INT_FAST...</code> KIND type
parameters (marked by an asterisk (<code>*</code>) in the list below).
The <code>C_INT_FAST...</code> parameters have therefore the value <em>-2</em>
and cannot be used as KIND type parameter of the <code>INTEGER</code> type.
</p>
<p>In addition to the integer named constants required by the Fortran 2003 
standard, GNU Fortran provides as an extension named constants for the 
128-bit integer types supported by the C compiler: <code>C_INT128_T, 
C_INT_LEAST128_T, C_INT_FAST128_T</code>.
</p>
<table>
<tr><td width="15%">Fortran Type</td><td width="35%">Named constant</td><td width="35%">C type</td><td width="35%">Extension</td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT</code></td><td width="35%"><code>int</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_SHORT</code></td><td width="35%"><code>short int</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_LONG</code></td><td width="35%"><code>long int</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_LONG_LONG</code></td><td width="35%"><code>long long int</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_SIGNED_CHAR</code></td><td width="35%"><code>signed char</code>/<code>unsigned char</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_SIZE_T</code></td><td width="35%"><code>size_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT8_T</code></td><td width="35%"><code>int8_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT16_T</code></td><td width="35%"><code>int16_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT32_T</code></td><td width="35%"><code>int32_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT64_T</code></td><td width="35%"><code>int64_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT128_T</code></td><td width="35%"><code>int128_t</code></td><td width="35%">Ext.</td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_LEAST8_T</code></td><td width="35%"><code>int_least8_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_LEAST16_T</code></td><td width="35%"><code>int_least16_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_LEAST32_T</code></td><td width="35%"><code>int_least32_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_LEAST64_T</code></td><td width="35%"><code>int_least64_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_LEAST128_T</code></td><td width="35%"><code>int_least128_t</code></td><td width="35%">Ext.</td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_FAST8_T</code>*</td><td width="35%"><code>int_fast8_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_FAST16_T</code>*</td><td width="35%"><code>int_fast16_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_FAST32_T</code>*</td><td width="35%"><code>int_fast32_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_FAST64_T</code>*</td><td width="35%"><code>int_fast64_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INT_FAST128_T</code>*</td><td width="35%"><code>int_fast128_t</code></td><td width="35%">Ext.</td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INTMAX_T</code></td><td width="35%"><code>intmax_t</code></td></tr>
<tr><td width="15%"><code>INTEGER</code></td><td width="35%"><code>C_INTPTR_T</code></td><td width="35%"><code>intptr_t</code></td></tr>
<tr><td width="15%"><code>REAL</code></td><td width="35%"><code>C_FLOAT</code></td><td width="35%"><code>float</code></td></tr>
<tr><td width="15%"><code>REAL</code></td><td width="35%"><code>C_DOUBLE</code></td><td width="35%"><code>double</code></td></tr>
<tr><td width="15%"><code>REAL</code></td><td width="35%"><code>C_LONG_DOUBLE</code></td><td width="35%"><code>long double</code></td></tr>
<tr><td width="15%"><code>COMPLEX</code></td><td width="35%"><code>C_FLOAT_COMPLEX</code></td><td width="35%"><code>float _Complex</code></td></tr>
<tr><td width="15%"><code>COMPLEX</code></td><td width="35%"><code>C_DOUBLE_COMPLEX</code></td><td width="35%"><code>double _Complex</code></td></tr>
<tr><td width="15%"><code>COMPLEX</code></td><td width="35%"><code>C_LONG_DOUBLE_COMPLEX</code></td><td width="35%"><code>long double _Complex</code></td></tr>
<tr><td width="15%"><code>LOGICAL</code></td><td width="35%"><code>C_BOOL</code></td><td width="35%"><code>_Bool</code></td></tr>
<tr><td width="15%"><code>CHARACTER</code></td><td width="35%"><code>C_CHAR</code></td><td width="35%"><code>char</code></td></tr>
</table>

<p>Additionally, the following <code>(CHARACTER(KIND=C_CHAR))</code> are
defined.
</p>
<table>
<tr><td width="20%">Name</td><td width="45%">C definition</td><td width="15%">Value</td></tr>
<tr><td width="20%"><code>C_NULL_CHAR</code></td><td width="45%">null character</td><td width="15%"><code>'\0'</code></td></tr>
<tr><td width="20%"><code>C_ALERT</code></td><td width="45%">alert</td><td width="15%"><code>'\a'</code></td></tr>
<tr><td width="20%"><code>C_BACKSPACE</code></td><td width="45%">backspace</td><td width="15%"><code>'\b'</code></td></tr>
<tr><td width="20%"><code>C_FORM_FEED</code></td><td width="45%">form feed</td><td width="15%"><code>'\f'</code></td></tr>
<tr><td width="20%"><code>C_NEW_LINE</code></td><td width="45%">new line</td><td width="15%"><code>'\n'</code></td></tr>
<tr><td width="20%"><code>C_CARRIAGE_RETURN</code></td><td width="45%">carriage return</td><td width="15%"><code>'\r'</code></td></tr>
<tr><td width="20%"><code>C_HORIZONTAL_TAB</code></td><td width="45%">horizontal tab</td><td width="15%"><code>'\t'</code></td></tr>
<tr><td width="20%"><code>C_VERTICAL_TAB</code></td><td width="45%">vertical tab</td><td width="15%"><code>'\v'</code></td></tr>
</table>

<a name="OpenMP-Modules-OMP_005fLIB-and-OMP_005fLIB_005fKINDS"></a>
<h3 class="section">8.3 OpenMP Modules <code>OMP_LIB</code> and <code>OMP_LIB_KINDS</code></h3>
<dl compact="compact">
<dt><em>Standard</em>:</dt>
<dd><p>OpenMP Application Program Interface v3.0
</p></dd>
</dl>


<p>The OpenMP Fortran runtime library routines are provided both in
a form of two Fortran 90 modules, named <code>OMP_LIB</code> and 
<code>OMP_LIB_KINDS</code>, and in a form of a Fortran <code>include</code> file named
<samp>omp_lib.h</samp>. The procedures provided by <code>OMP_LIB</code> can be found
in the <a href="http://gcc.gnu.org/onlinedocs/libgomp/index.html#Top">Introduction</a> in <cite>GNU OpenMP runtime library</cite> manual,
the named constants defined in the <code>OMP_LIB_KINDS</code> module are listed
below.
</p>
<p>For details refer to the actual
<a href="http://www.openmp.org/mp-documents/spec30.pdf">OpenMP Application Program Interface v3.0</a>.
</p>
<p><code>OMP_LIB_KINDS</code> provides the following scalar default-integer
named constants:
</p>
<dl compact="compact">
<dt><code>omp_integer_kind</code></dt>
<dt><code>omp_logical_kind</code></dt>
<dt><code>omp_lock_kind</code></dt>
<dt><code>omp_nest_lock_kind</code></dt>
<dt><code>omp_sched_kind</code></dt>
</dl>




<hr>
<a name="Contributing"></a>
<div class="header">
<p>
Next: <a href="#Copying" accesskey="n" rel="next">Copying</a>, Previous: <a href="#Intrinsic-Modules" accesskey="p" rel="prev">Intrinsic Modules</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Contributing-1"></a>
<h2 class="unnumbered">Contributing</h2>
<a name="index-Contributing"></a>

<p>Free software is only possible if people contribute to efforts
to create it.
We&rsquo;re always in need of more people helping out with ideas
and comments, writing documentation and contributing code.
</p>
<p>If you want to contribute to GNU Fortran,
have a look at the long lists of projects you can take on.
Some of these projects are small,
some of them are large;
some are completely orthogonal to the rest of what is
happening on GNU Fortran,
but others are &ldquo;mainstream&rdquo; projects in need of enthusiastic hackers.
All of these projects are important!
We&rsquo;ll eventually get around to the things here,
but they are also things doable by someone who is willing and able.
</p>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top">&bull; <a href="#Contributors" accesskey="1">Contributors</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Projects" accesskey="2">Projects</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top">&bull; <a href="#Proposed-Extensions" accesskey="3">Proposed Extensions</a>:</td><td>&nbsp;&nbsp;</td><td align="left" valign="top">
</td></tr>
</table>


<hr>
<a name="Contributors"></a>
<div class="header">
<p>
Next: <a href="#Projects" accesskey="n" rel="next">Projects</a>, Up: <a href="#Contributing" accesskey="u" rel="up">Contributing</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Contributors-to-GNU-Fortran"></a>
<h3 class="section">Contributors to GNU Fortran</h3>
<a name="index-Contributors"></a>
<a name="index-Credits"></a>
<a name="index-Authors"></a>

<p>Most of the parser was hand-crafted by <em>Andy Vaught</em>, who is
also the initiator of the whole project.  Thanks Andy!
Most of the interface with GCC was written by <em>Paul Brook</em>.
</p>
<p>The following individuals have contributed code and/or
ideas and significant help to the GNU Fortran project
(in alphabetical order):
</p>
<ul class="no-bullet">
<li>- Janne Blomqvist
</li><li>- Steven Bosscher
</li><li>- Paul Brook
</li><li>- Tobias Burnus
</li><li>- Fran&ccedil;ois-Xavier Coudert
</li><li>- Bud Davis
</li><li>- Jerry DeLisle
</li><li>- Erik Edelmann
</li><li>- Bernhard Fischer
</li><li>- Daniel Franke
</li><li>- Richard Guenther
</li><li>- Richard Henderson
</li><li>- Katherine Holcomb
</li><li>- Jakub Jelinek
</li><li>- Niels Kristian Bech Jensen
</li><li>- Steven Johnson
</li><li>- Steven G. Kargl
</li><li>- Thomas Koenig
</li><li>- Asher Langton
</li><li>- H. J. Lu
</li><li>- Toon Moene
</li><li>- Brooks Moses
</li><li>- Andrew Pinski
</li><li>- Tim Prince
</li><li>- Christopher D. Rickett
</li><li>- Richard Sandiford
</li><li>- Tobias Schl&uuml;ter
</li><li>- Roger Sayle
</li><li>- Paul Thomas
</li><li>- Andy Vaught
</li><li>- Feng Wang
</li><li>- Janus Weil
</li></ul>

<p>The following people have contributed bug reports,
smaller or larger patches,
and much needed feedback and encouragement for the
GNU Fortran project: 
</p>
<ul class="no-bullet">
<li>- Bill Clodius
</li><li>- Dominique d&rsquo;Humi&egrave;res
</li><li>- Kate Hedstrom
</li><li>- Erik Schnetter
</li></ul>

<p>Many other individuals have helped debug,
test and improve the GNU Fortran compiler over the past few years,
and we welcome you to do the same!
If you already have done so,
and you would like to see your name listed in the
list above, please contact us.
</p>

<hr>
<a name="Projects"></a>
<div class="header">
<p>
Next: <a href="#Proposed-Extensions" accesskey="n" rel="next">Proposed Extensions</a>, Previous: <a href="#Contributors" accesskey="p" rel="prev">Contributors</a>, Up: <a href="#Contributing" accesskey="u" rel="up">Contributing</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Projects-1"></a>
<h3 class="section">Projects</h3>

<dl compact="compact">
<dt><em>Help build the test suite</em></dt>
<dd><p>Solicit more code for donation to the test suite: the more extensive the
testsuite, the smaller the risk of breaking things in the future! We can
keep code private on request.
</p>
</dd>
<dt><em>Bug hunting/squishing</em></dt>
<dd><p>Find bugs and write more test cases! Test cases are especially very
welcome, because it allows us to concentrate on fixing bugs instead of
isolating them. Going through the bugzilla database at
<a href="http://gcc.gnu.org/bugzilla/">http://gcc.gnu.org/bugzilla/</a> to reduce testcases posted there and
add more information (for example, for which version does the testcase
work, for which versions does it fail?) is also very helpful.
</p>
</dd>
</dl>


<hr>
<a name="Proposed-Extensions"></a>
<div class="header">
<p>
Previous: <a href="#Projects" accesskey="p" rel="prev">Projects</a>, Up: <a href="#Contributing" accesskey="u" rel="up">Contributing</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Proposed-Extensions-1"></a>
<h3 class="section">Proposed Extensions</h3>

<p>Here&rsquo;s a list of proposed extensions for the GNU Fortran compiler, in no particular
order.  Most of these are necessary to be fully compatible with
existing Fortran compilers, but they are not part of the official
J3 Fortran 95 standard.
</p>
<a name="Compiler-extensions_003a"></a>
<h4 class="subsection">Compiler extensions:</h4>
<ul>
<li> User-specified alignment rules for structures.

</li><li> Automatically extend single precision constants to double.

</li><li> Compile code that conserves memory by dynamically allocating common and
module storage either on stack or heap.

</li><li> Compile flag to generate code for array conformance checking (suggest -CC).

</li><li> User control of symbol names (underscores, etc).

</li><li> Compile setting for maximum size of stack frame size before spilling
parts to static or heap.

</li><li> Flag to force local variables into static space.

</li><li> Flag to force local variables onto stack.
</li></ul>


<a name="Environment-Options"></a>
<h4 class="subsection">Environment Options</h4>
<ul>
<li> Pluggable library modules for random numbers, linear algebra.
LA should use BLAS calling conventions.

</li><li> Environment variables controlling actions on arithmetic exceptions like
overflow, underflow, precision loss&mdash;Generate NaN, abort, default.
action.

</li><li> Set precision for fp units that support it (i387).

</li><li> Variable for setting fp rounding mode.

</li><li> Variable to fill uninitialized variables with a user-defined bit
pattern.

</li><li> Environment variable controlling filename that is opened for that unit
number.

</li><li> Environment variable to clear/trash memory being freed.

</li><li> Environment variable to control tracing of allocations and frees.

</li><li> Environment variable to display allocated memory at normal program end.

</li><li> Environment variable for filename for * IO-unit.

</li><li> Environment variable for temporary file directory.

</li><li> Environment variable forcing standard output to be line buffered (unix).

</li></ul>



<hr>
<a name="Copying"></a>
<div class="header">
<p>
Next: <a href="#GNU-Free-Documentation-License" accesskey="n" rel="next">GNU Free Documentation License</a>, Previous: <a href="#Contributing" accesskey="p" rel="prev">Contributing</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNU-General-Public-License"></a>
<h2 class="unnumbered">GNU General Public License</h2>
<div align="center">Version 3, 29 June 2007
</div>

<div class="display">
<pre class="display">Copyright &copy; 2007 Free Software Foundation, Inc. <a href="http://fsf.org/">http://fsf.org/</a>

Everyone is permitted to copy and distribute verbatim copies of this
license document, but changing it is not allowed.
</pre></div>

<a name="Preamble"></a>
<h3 class="heading">Preamble</h3>

<p>The GNU General Public License is a free, copyleft license for
software and other kinds of works.
</p>
<p>The licenses for most software and other practical works are designed
to take away your freedom to share and change the works.  By contrast,
the GNU General Public License is intended to guarantee your freedom
to share and change all versions of a program&ndash;to make sure it remains
free software for all its users.  We, the Free Software Foundation,
use the GNU General Public License for most of our software; it
applies also to any other work released this way by its authors.  You
can apply it to your programs, too.
</p>
<p>When we speak of free software, we are referring to freedom, not
price.  Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
</p>
<p>To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights.  Therefore, you
have certain responsibilities if you distribute copies of the
software, or if you modify it: responsibilities to respect the freedom
of others.
</p>
<p>For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received.  You must make sure that they, too,
receive or can get the source code.  And you must show them these
terms so they know their rights.
</p>
<p>Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
</p>
<p>For the developers&rsquo; and authors&rsquo; protection, the GPL clearly explains
that there is no warranty for this free software.  For both users&rsquo; and
authors&rsquo; sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
</p>
<p>Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the
manufacturer can do so.  This is fundamentally incompatible with the
aim of protecting users&rsquo; freedom to change the software.  The
systematic pattern of such abuse occurs in the area of products for
individuals to use, which is precisely where it is most unacceptable.
Therefore, we have designed this version of the GPL to prohibit the
practice for those products.  If such problems arise substantially in
other domains, we stand ready to extend this provision to those
domains in future versions of the GPL, as needed to protect the
freedom of users.
</p>
<p>Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish
to avoid the special danger that patents applied to a free program
could make it effectively proprietary.  To prevent this, the GPL
assures that patents cannot be used to render the program non-free.
</p>
<p>The precise terms and conditions for copying, distribution and
modification follow.
</p>
<a name="TERMS-AND-CONDITIONS"></a>
<h3 class="heading">TERMS AND CONDITIONS</h3>

<ol>
<li> Definitions.

<p>&ldquo;This License&rdquo; refers to version 3 of the GNU General Public License.
</p>
<p>&ldquo;Copyright&rdquo; also means copyright-like laws that apply to other kinds
of works, such as semiconductor masks.
</p>
<p>&ldquo;The Program&rdquo; refers to any copyrightable work licensed under this
License.  Each licensee is addressed as &ldquo;you&rdquo;.  &ldquo;Licensees&rdquo; and
&ldquo;recipients&rdquo; may be individuals or organizations.
</p>
<p>To &ldquo;modify&rdquo; a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of
an exact copy.  The resulting work is called a &ldquo;modified version&rdquo; of
the earlier work or a work &ldquo;based on&rdquo; the earlier work.
</p>
<p>A &ldquo;covered work&rdquo; means either the unmodified Program or a work based
on the Program.
</p>
<p>To &ldquo;propagate&rdquo; a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy.  Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
</p>
<p>To &ldquo;convey&rdquo; a work means any kind of propagation that enables other
parties to make or receive copies.  Mere interaction with a user
through a computer network, with no transfer of a copy, is not
conveying.
</p>
<p>An interactive user interface displays &ldquo;Appropriate Legal Notices&rdquo; to
the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License.  If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
</p>
</li><li> Source Code.

<p>The &ldquo;source code&rdquo; for a work means the preferred form of the work for
making modifications to it.  &ldquo;Object code&rdquo; means any non-source form
of a work.
</p>
<p>A &ldquo;Standard Interface&rdquo; means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
</p>
<p>The &ldquo;System Libraries&rdquo; of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form.  A
&ldquo;Major Component&rdquo;, in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
</p>
<p>The &ldquo;Corresponding Source&rdquo; for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities.  However, it does not include the work&rsquo;s
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work.  For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
</p>
<p>The Corresponding Source need not include anything that users can
regenerate automatically from other parts of the Corresponding Source.
</p>
<p>The Corresponding Source for a work in source code form is that same
work.
</p>
</li><li> Basic Permissions.

<p>All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met.  This License explicitly affirms your unlimited
permission to run the unmodified Program.  The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work.  This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
</p>
<p>You may make, run and propagate covered works that you do not convey,
without conditions so long as your license otherwise remains in force.
You may convey covered works to others for the sole purpose of having
them make modifications exclusively for you, or provide you with
facilities for running those works, provided that you comply with the
terms of this License in conveying all material for which you do not
control copyright.  Those thus making or running the covered works for
you must do so exclusively on your behalf, under your direction and
control, on terms that prohibit them from making any copies of your
copyrighted material outside their relationship with you.
</p>
<p>Conveying under any other circumstances is permitted solely under the
conditions stated below.  Sublicensing is not allowed; section 10
makes it unnecessary.
</p>
</li><li> Protecting Users&rsquo; Legal Rights From Anti-Circumvention Law.

<p>No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
</p>
<p>When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such
circumvention is effected by exercising rights under this License with
respect to the covered work, and you disclaim any intention to limit
operation or modification of the work as a means of enforcing, against
the work&rsquo;s users, your or third parties&rsquo; legal rights to forbid
circumvention of technological measures.
</p>
</li><li> Conveying Verbatim Copies.

<p>You may convey verbatim copies of the Program&rsquo;s source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
</p>
<p>You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
</p>
</li><li> Conveying Modified Source Versions.

<p>You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these
conditions:
</p>
<ol>
<li> The work must carry prominent notices stating that you modified it,
and giving a relevant date.

</li><li> The work must carry prominent notices stating that it is released
under this License and any conditions added under section 7.  This
requirement modifies the requirement in section 4 to &ldquo;keep intact all
notices&rdquo;.

</li><li> You must license the entire work, as a whole, under this License to
anyone who comes into possession of a copy.  This License will
therefore apply, along with any applicable section 7 additional terms,
to the whole of the work, and all its parts, regardless of how they
are packaged.  This License gives no permission to license the work in
any other way, but it does not invalidate such permission if you have
separately received it.

</li><li> If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your work
need not make them do so.
</li></ol>

<p>A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
&ldquo;aggregate&rdquo; if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation&rsquo;s users
beyond what the individual works permit.  Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
</p>
</li><li> Conveying Non-Source Forms.

<p>You may convey a covered work in object code form under the terms of
sections 4 and 5, provided that you also convey the machine-readable
Corresponding Source under the terms of this License, in one of these
ways:
</p>
<ol>
<li> Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium customarily
used for software interchange.

</li><li> Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a written
offer, valid for at least three years and valid for as long as you
offer spare parts or customer support for that product model, to give
anyone who possesses the object code either (1) a copy of the
Corresponding Source for all the software in the product that is
covered by this License, on a durable physical medium customarily used
for software interchange, for a price no more than your reasonable
cost of physically performing this conveying of source, or (2) access
to copy the Corresponding Source from a network server at no charge.

</li><li> Convey individual copies of the object code with a copy of the written
offer to provide the Corresponding Source.  This alternative is
allowed only occasionally and noncommercially, and only if you
received the object code with such an offer, in accord with subsection
6b.

</li><li> Convey the object code by offering access from a designated place
(gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge.  You need not require recipients to copy the
Corresponding Source along with the object code.  If the place to copy
the object code is a network server, the Corresponding Source may be
on a different server (operated by you or a third party) that supports
equivalent copying facilities, provided you maintain clear directions
next to the object code saying where to find the Corresponding Source.
Regardless of what server hosts the Corresponding Source, you remain
obligated to ensure that it is available for as long as needed to
satisfy these requirements.

</li><li> Convey the object code using peer-to-peer transmission, provided you
inform other peers where the object code and Corresponding Source of
the work are being offered to the general public at no charge under
subsection 6d.

</li></ol>

<p>A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
</p>
<p>A &ldquo;User Product&rdquo; is either (1) a &ldquo;consumer product&rdquo;, which means any
tangible personal property which is normally used for personal,
family, or household purposes, or (2) anything designed or sold for
incorporation into a dwelling.  In determining whether a product is a
consumer product, doubtful cases shall be resolved in favor of
coverage.  For a particular product received by a particular user,
&ldquo;normally used&rdquo; refers to a typical or common use of that class of
product, regardless of the status of the particular user or of the way
in which the particular user actually uses, or expects or is expected
to use, the product.  A product is a consumer product regardless of
whether the product has substantial commercial, industrial or
non-consumer uses, unless such uses represent the only significant
mode of use of the product.
</p>
<p>&ldquo;Installation Information&rdquo; for a User Product means any methods,
procedures, authorization keys, or other information required to
install and execute modified versions of a covered work in that User
Product from a modified version of its Corresponding Source.  The
information must suffice to ensure that the continued functioning of
the modified object code is in no case prevented or interfered with
solely because modification has been made.
</p>
<p>If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information.  But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
</p>
<p>The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or
updates for a work that has been modified or installed by the
recipient, or for the User Product in which it has been modified or
installed.  Access to a network may be denied when the modification
itself materially and adversely affects the operation of the network
or violates the rules and protocols for communication across the
network.
</p>
<p>Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
</p>
</li><li> Additional Terms.

<p>&ldquo;Additional permissions&rdquo; are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law.  If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
</p>
<p>When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it.  (Additional permissions may be written to require their own
removal in certain cases when you modify the work.)  You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
</p>
<p>Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders
of that material) supplement the terms of this License with terms:
</p>
<ol>
<li> Disclaiming warranty or limiting liability differently from the terms
of sections 15 and 16 of this License; or

</li><li> Requiring preservation of specified reasonable legal notices or author
attributions in that material or in the Appropriate Legal Notices
displayed by works containing it; or

</li><li> Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or

</li><li> Limiting the use for publicity purposes of names of licensors or
authors of the material; or

</li><li> Declining to grant rights under trademark law for use of some trade
names, trademarks, or service marks; or

</li><li> Requiring indemnification of licensors and authors of that material by
anyone who conveys the material (or modified versions of it) with
contractual assumptions of liability to the recipient, for any
liability that these contractual assumptions directly impose on those
licensors and authors.
</li></ol>

<p>All other non-permissive additional terms are considered &ldquo;further
restrictions&rdquo; within the meaning of section 10.  If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term.  If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
</p>
<p>If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
</p>
<p>Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions; the
above requirements apply either way.
</p>
</li><li> Termination.

<p>You may not propagate or modify a covered work except as expressly
provided under this License.  Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
</p>
<p>However, if you cease all violation of this License, then your license
from a particular copyright holder is reinstated (a) provisionally,
unless and until the copyright holder explicitly and finally
terminates your license, and (b) permanently, if the copyright holder
fails to notify you of the violation by some reasonable means prior to
60 days after the cessation.
</p>
<p>Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
</p>
<p>Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License.  If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
</p>
</li><li> Acceptance Not Required for Having Copies.

<p>You are not required to accept this License in order to receive or run
a copy of the Program.  Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance.  However,
nothing other than this License grants you permission to propagate or
modify any covered work.  These actions infringe copyright if you do
not accept this License.  Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
</p>
</li><li> Automatic Licensing of Downstream Recipients.

<p>Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License.  You are not responsible
for enforcing compliance by third parties with this License.
</p>
<p>An &ldquo;entity transaction&rdquo; is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations.  If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party&rsquo;s predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
</p>
<p>You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License.  For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
</p>
</li><li> Patents.

<p>A &ldquo;contributor&rdquo; is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based.  The
work thus licensed is called the contributor&rsquo;s &ldquo;contributor version&rdquo;.
</p>
<p>A contributor&rsquo;s &ldquo;essential patent claims&rdquo; are all patent claims owned
or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version.  For
purposes of this definition, &ldquo;control&rdquo; includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
</p>
<p>Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor&rsquo;s essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
</p>
<p>In the following three paragraphs, a &ldquo;patent license&rdquo; is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement).  To &ldquo;grant&rdquo; such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
</p>
<p>If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients.  &ldquo;Knowingly relying&rdquo; means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient&rsquo;s use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
</p>
<p>If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
</p>
<p>A patent license is &ldquo;discriminatory&rdquo; if it does not include within the
scope of its coverage, prohibits the exercise of, or is conditioned on
the non-exercise of one or more of the rights that are specifically
granted under this License.  You may not convey a covered work if you
are a party to an arrangement with a third party that is in the
business of distributing software, under which you make payment to the
third party based on the extent of your activity of conveying the
work, and under which the third party grants, to any of the parties
who would receive the covered work from you, a discriminatory patent
license (a) in connection with copies of the covered work conveyed by
you (or copies made from those copies), or (b) primarily for and in
connection with specific products or compilations that contain the
covered work, unless you entered into that arrangement, or that patent
license was granted, prior to 28 March 2007.
</p>
<p>Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
</p>
</li><li> No Surrender of Others&rsquo; Freedom.

<p>If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License.  If you cannot convey
a covered work so as to satisfy simultaneously your obligations under
this License and any other pertinent obligations, then as a
consequence you may not convey it at all.  For example, if you agree
to terms that obligate you to collect a royalty for further conveying
from those to whom you convey the Program, the only way you could
satisfy both those terms and this License would be to refrain entirely
from conveying the Program.
</p>
</li><li> Use with the GNU Affero General Public License.

<p>Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work.  The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
</p>
</li><li> Revised Versions of this License.

<p>The Free Software Foundation may publish revised and/or new versions
of the GNU General Public License from time to time.  Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns.
</p>
<p>Each version is given a distinguishing version number.  If the Program
specifies that a certain numbered version of the GNU General Public
License &ldquo;or any later version&rdquo; applies to it, you have the option of
following the terms and conditions either of that numbered version or
of any later version published by the Free Software Foundation.  If
the Program does not specify a version number of the GNU General
Public License, you may choose any version ever published by the Free
Software Foundation.
</p>
<p>If the Program specifies that a proxy can decide which future versions
of the GNU General Public License can be used, that proxy&rsquo;s public
statement of acceptance of a version permanently authorizes you to
choose that version for the Program.
</p>
<p>Later license versions may give you additional or different
permissions.  However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
</p>
</li><li> Disclaimer of Warranty.

<p>THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM &ldquo;AS IS&rdquo; WITHOUT
WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND
PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE PROGRAM PROVE
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
CORRECTION.
</p>
</li><li> Limitation of Liability.

<p>IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR
CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT
NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR
LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM
TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER
PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
</p>
</li><li> Interpretation of Sections 15 and 16.

<p>If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
</p>
</li></ol>

<a name="END-OF-TERMS-AND-CONDITIONS"></a>
<h3 class="heading">END OF TERMS AND CONDITIONS</h3>

<a name="How-to-Apply-These-Terms-to-Your-New-Programs"></a>
<h3 class="heading">How to Apply These Terms to Your New Programs</h3>

<p>If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these
terms.
</p>
<p>To do so, attach the following notices to the program.  It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the &ldquo;copyright&rdquo; line and a pointer to where the full notice is found.
</p>
<div class="smallexample">
<pre class="smallexample"><var>one line to give the program's name and a brief idea of what it does.</var>  
Copyright (C) <var>year</var> <var>name of author</var>

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or (at
your option) any later version.

This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <a href="http://www.gnu.org/licenses/">http://www.gnu.org/licenses/</a>.
</pre></div>

<p>Also add information on how to contact you by electronic and paper mail.
</p>
<p>If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
</p>
<div class="smallexample">
<pre class="smallexample"><var>program</var> Copyright (C) <var>year</var> <var>name of author</var> 
This program comes with ABSOLUTELY NO WARRANTY; for details type &lsquo;<samp>show w</samp>&rsquo;.
This is free software, and you are welcome to redistribute it
under certain conditions; type &lsquo;<samp>show c</samp>&rsquo; for details.
</pre></div>

<p>The hypothetical commands &lsquo;<samp>show w</samp>&rsquo; and &lsquo;<samp>show c</samp>&rsquo; should show
the appropriate parts of the General Public License.  Of course, your
program&rsquo;s commands might be different; for a GUI interface, you would
use an &ldquo;about box&rdquo;.
</p>
<p>You should also get your employer (if you work as a programmer) or school,
if any, to sign a &ldquo;copyright disclaimer&rdquo; for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<a href="http://www.gnu.org/licenses/">http://www.gnu.org/licenses/</a>.
</p>
<p>The GNU General Public License does not permit incorporating your
program into proprietary programs.  If your program is a subroutine
library, you may consider it more useful to permit linking proprietary
applications with the library.  If this is what you want to do, use
the GNU Lesser General Public License instead of this License.  But
first, please read <a href="http://www.gnu.org/philosophy/why-not-lgpl.html">http://www.gnu.org/philosophy/why-not-lgpl.html</a>.
</p>



<hr>
<a name="GNU-Free-Documentation-License"></a>
<div class="header">
<p>
Next: <a href="#Funding" accesskey="n" rel="next">Funding</a>, Previous: <a href="#Copying" accesskey="p" rel="prev">Copying</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="GNU-Free-Documentation-License-1"></a>
<h2 class="unnumbered">GNU Free Documentation License</h2>

<a name="index-FDL_002c-GNU-Free-Documentation-License"></a>
<div align="center">Version 1.2, November 2002
</div>
<div class="display">
<pre class="display">Copyright &copy; 2000,2001,2002 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA

Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
</pre></div>

<ol>
<li> PREAMBLE

<p>The purpose of this License is to make a manual, textbook, or other
functional and useful document <em>free</em> in the sense of freedom: to
assure everyone the effective freedom to copy and redistribute it,
with or without modifying it, either commercially or noncommercially.
Secondarily, this License preserves for the author and publisher a way
to get credit for their work, while not being considered responsible
for modifications made by others.
</p>
<p>This License is a kind of &ldquo;copyleft&rdquo;, which means that derivative
works of the document must themselves be free in the same sense.  It
complements the GNU General Public License, which is a copyleft
license designed for free software.
</p>
<p>We have designed this License in order to use it for manuals for free
software, because free software needs free documentation: a free
program should come with manuals providing the same freedoms that the
software does.  But this License is not limited to software manuals;
it can be used for any textual work, regardless of subject matter or
whether it is published as a printed book.  We recommend this License
principally for works whose purpose is instruction or reference.
</p>
</li><li> APPLICABILITY AND DEFINITIONS

<p>This License applies to any manual or other work, in any medium, that
contains a notice placed by the copyright holder saying it can be
distributed under the terms of this License.  Such a notice grants a
world-wide, royalty-free license, unlimited in duration, to use that
work under the conditions stated herein.  The &ldquo;Document&rdquo;, below,
refers to any such manual or work.  Any member of the public is a
licensee, and is addressed as &ldquo;you&rdquo;.  You accept the license if you
copy, modify or distribute the work in a way requiring permission
under copyright law.
</p>
<p>A &ldquo;Modified Version&rdquo; of the Document means any work containing the
Document or a portion of it, either copied verbatim, or with
modifications and/or translated into another language.
</p>
<p>A &ldquo;Secondary Section&rdquo; is a named appendix or a front-matter section
of the Document that deals exclusively with the relationship of the
publishers or authors of the Document to the Document&rsquo;s overall
subject (or to related matters) and contains nothing that could fall
directly within that overall subject.  (Thus, if the Document is in
part a textbook of mathematics, a Secondary Section may not explain
any mathematics.)  The relationship could be a matter of historical
connection with the subject or with related matters, or of legal,
commercial, philosophical, ethical or political position regarding
them.
</p>
<p>The &ldquo;Invariant Sections&rdquo; are certain Secondary Sections whose titles
are designated, as being those of Invariant Sections, in the notice
that says that the Document is released under this License.  If a
section does not fit the above definition of Secondary then it is not
allowed to be designated as Invariant.  The Document may contain zero
Invariant Sections.  If the Document does not identify any Invariant
Sections then there are none.
</p>
<p>The &ldquo;Cover Texts&rdquo; are certain short passages of text that are listed,
as Front-Cover Texts or Back-Cover Texts, in the notice that says that
the Document is released under this License.  A Front-Cover Text may
be at most 5 words, and a Back-Cover Text may be at most 25 words.
</p>
<p>A &ldquo;Transparent&rdquo; copy of the Document means a machine-readable copy,
represented in a format whose specification is available to the
general public, that is suitable for revising the document
straightforwardly with generic text editors or (for images composed of
pixels) generic paint programs or (for drawings) some widely available
drawing editor, and that is suitable for input to text formatters or
for automatic translation to a variety of formats suitable for input
to text formatters.  A copy made in an otherwise Transparent file
format whose markup, or absence of markup, has been arranged to thwart
or discourage subsequent modification by readers is not Transparent.
An image format is not Transparent if used for any substantial amount
of text.  A copy that is not &ldquo;Transparent&rdquo; is called &ldquo;Opaque&rdquo;.
</p>
<p>Examples of suitable formats for Transparent copies include plain
<small>ASCII</small> without markup, Texinfo input format, LaTeX input
format, <acronym>SGML</acronym> or <acronym>XML</acronym> using a publicly available
<acronym>DTD</acronym>, and standard-conforming simple <acronym>HTML</acronym>,
PostScript or <acronym>PDF</acronym> designed for human modification.  Examples
of transparent image formats include <acronym>PNG</acronym>, <acronym>XCF</acronym> and
<acronym>JPG</acronym>.  Opaque formats include proprietary formats that can be
read and edited only by proprietary word processors, <acronym>SGML</acronym> or
<acronym>XML</acronym> for which the <acronym>DTD</acronym> and/or processing tools are
not generally available, and the machine-generated <acronym>HTML</acronym>,
PostScript or <acronym>PDF</acronym> produced by some word processors for
output purposes only.
</p>
<p>The &ldquo;Title Page&rdquo; means, for a printed book, the title page itself,
plus such following pages as are needed to hold, legibly, the material
this License requires to appear in the title page.  For works in
formats which do not have any title page as such, &ldquo;Title Page&rdquo; means
the text near the most prominent appearance of the work&rsquo;s title,
preceding the beginning of the body of the text.
</p>
<p>A section &ldquo;Entitled XYZ&rdquo; means a named subunit of the Document whose
title either is precisely XYZ or contains XYZ in parentheses following
text that translates XYZ in another language.  (Here XYZ stands for a
specific section name mentioned below, such as &ldquo;Acknowledgements&rdquo;,
&ldquo;Dedications&rdquo;, &ldquo;Endorsements&rdquo;, or &ldquo;History&rdquo;.)  To &ldquo;Preserve the Title&rdquo;
of such a section when you modify the Document means that it remains a
section &ldquo;Entitled XYZ&rdquo; according to this definition.
</p>
<p>The Document may include Warranty Disclaimers next to the notice which
states that this License applies to the Document.  These Warranty
Disclaimers are considered to be included by reference in this
License, but only as regards disclaiming warranties: any other
implication that these Warranty Disclaimers may have is void and has
no effect on the meaning of this License.
</p>
</li><li> VERBATIM COPYING

<p>You may copy and distribute the Document in any medium, either
commercially or noncommercially, provided that this License, the
copyright notices, and the license notice saying this License applies
to the Document are reproduced in all copies, and that you add no other
conditions whatsoever to those of this License.  You may not use
technical measures to obstruct or control the reading or further
copying of the copies you make or distribute.  However, you may accept
compensation in exchange for copies.  If you distribute a large enough
number of copies you must also follow the conditions in section 3.
</p>
<p>You may also lend copies, under the same conditions stated above, and
you may publicly display copies.
</p>
</li><li> COPYING IN QUANTITY

<p>If you publish printed copies (or copies in media that commonly have
printed covers) of the Document, numbering more than 100, and the
Document&rsquo;s license notice requires Cover Texts, you must enclose the
copies in covers that carry, clearly and legibly, all these Cover
Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
the back cover.  Both covers must also clearly and legibly identify
you as the publisher of these copies.  The front cover must present
the full title with all words of the title equally prominent and
visible.  You may add other material on the covers in addition.
Copying with changes limited to the covers, as long as they preserve
the title of the Document and satisfy these conditions, can be treated
as verbatim copying in other respects.
</p>
<p>If the required texts for either cover are too voluminous to fit
legibly, you should put the first ones listed (as many as fit
reasonably) on the actual cover, and continue the rest onto adjacent
pages.
</p>
<p>If you publish or distribute Opaque copies of the Document numbering
more than 100, you must either include a machine-readable Transparent
copy along with each Opaque copy, or state in or with each Opaque copy
a computer-network location from which the general network-using
public has access to download using public-standard network protocols
a complete Transparent copy of the Document, free of added material.
If you use the latter option, you must take reasonably prudent steps,
when you begin distribution of Opaque copies in quantity, to ensure
that this Transparent copy will remain thus accessible at the stated
location until at least one year after the last time you distribute an
Opaque copy (directly or through your agents or retailers) of that
edition to the public.
</p>
<p>It is requested, but not required, that you contact the authors of the
Document well before redistributing any large number of copies, to give
them a chance to provide you with an updated version of the Document.
</p>
</li><li> MODIFICATIONS

<p>You may copy and distribute a Modified Version of the Document under
the conditions of sections 2 and 3 above, provided that you release
the Modified Version under precisely this License, with the Modified
Version filling the role of the Document, thus licensing distribution
and modification of the Modified Version to whoever possesses a copy
of it.  In addition, you must do these things in the Modified Version:
</p>
<ol>
<li> Use in the Title Page (and on the covers, if any) a title distinct
from that of the Document, and from those of previous versions
(which should, if there were any, be listed in the History section
of the Document).  You may use the same title as a previous version
if the original publisher of that version gives permission.

</li><li> List on the Title Page, as authors, one or more persons or entities
responsible for authorship of the modifications in the Modified
Version, together with at least five of the principal authors of the
Document (all of its principal authors, if it has fewer than five),
unless they release you from this requirement.

</li><li> State on the Title page the name of the publisher of the
Modified Version, as the publisher.

</li><li> Preserve all the copyright notices of the Document.

</li><li> Add an appropriate copyright notice for your modifications
adjacent to the other copyright notices.

</li><li> Include, immediately after the copyright notices, a license notice
giving the public permission to use the Modified Version under the
terms of this License, in the form shown in the Addendum below.

</li><li> Preserve in that license notice the full lists of Invariant Sections
and required Cover Texts given in the Document&rsquo;s license notice.

</li><li> Include an unaltered copy of this License.

</li><li> Preserve the section Entitled &ldquo;History&rdquo;, Preserve its Title, and add
to it an item stating at least the title, year, new authors, and
publisher of the Modified Version as given on the Title Page.  If
there is no section Entitled &ldquo;History&rdquo; in the Document, create one
stating the title, year, authors, and publisher of the Document as
given on its Title Page, then add an item describing the Modified
Version as stated in the previous sentence.

</li><li> Preserve the network location, if any, given in the Document for
public access to a Transparent copy of the Document, and likewise
the network locations given in the Document for previous versions
it was based on.  These may be placed in the &ldquo;History&rdquo; section.
You may omit a network location for a work that was published at
least four years before the Document itself, or if the original
publisher of the version it refers to gives permission.

</li><li> For any section Entitled &ldquo;Acknowledgements&rdquo; or &ldquo;Dedications&rdquo;, Preserve
the Title of the section, and preserve in the section all the
substance and tone of each of the contributor acknowledgements and/or
dedications given therein.

</li><li> Preserve all the Invariant Sections of the Document,
unaltered in their text and in their titles.  Section numbers
or the equivalent are not considered part of the section titles.

</li><li> Delete any section Entitled &ldquo;Endorsements&rdquo;.  Such a section
may not be included in the Modified Version.

</li><li> Do not retitle any existing section to be Entitled &ldquo;Endorsements&rdquo; or
to conflict in title with any Invariant Section.

</li><li> Preserve any Warranty Disclaimers.
</li></ol>

<p>If the Modified Version includes new front-matter sections or
appendices that qualify as Secondary Sections and contain no material
copied from the Document, you may at your option designate some or all
of these sections as invariant.  To do this, add their titles to the
list of Invariant Sections in the Modified Version&rsquo;s license notice.
These titles must be distinct from any other section titles.
</p>
<p>You may add a section Entitled &ldquo;Endorsements&rdquo;, provided it contains
nothing but endorsements of your Modified Version by various
parties&mdash;for example, statements of peer review or that the text has
been approved by an organization as the authoritative definition of a
standard.
</p>
<p>You may add a passage of up to five words as a Front-Cover Text, and a
passage of up to 25 words as a Back-Cover Text, to the end of the list
of Cover Texts in the Modified Version.  Only one passage of
Front-Cover Text and one of Back-Cover Text may be added by (or
through arrangements made by) any one entity.  If the Document already
includes a cover text for the same cover, previously added by you or
by arrangement made by the same entity you are acting on behalf of,
you may not add another; but you may replace the old one, on explicit
permission from the previous publisher that added the old one.
</p>
<p>The author(s) and publisher(s) of the Document do not by this License
give permission to use their names for publicity for or to assert or
imply endorsement of any Modified Version.
</p>
</li><li> COMBINING DOCUMENTS

<p>You may combine the Document with other documents released under this
License, under the terms defined in section 4 above for modified
versions, provided that you include in the combination all of the
Invariant Sections of all of the original documents, unmodified, and
list them all as Invariant Sections of your combined work in its
license notice, and that you preserve all their Warranty Disclaimers.
</p>
<p>The combined work need only contain one copy of this License, and
multiple identical Invariant Sections may be replaced with a single
copy.  If there are multiple Invariant Sections with the same name but
different contents, make the title of each such section unique by
adding at the end of it, in parentheses, the name of the original
author or publisher of that section if known, or else a unique number.
Make the same adjustment to the section titles in the list of
Invariant Sections in the license notice of the combined work.
</p>
<p>In the combination, you must combine any sections Entitled &ldquo;History&rdquo;
in the various original documents, forming one section Entitled
&ldquo;History&rdquo;; likewise combine any sections Entitled &ldquo;Acknowledgements&rdquo;,
and any sections Entitled &ldquo;Dedications&rdquo;.  You must delete all
sections Entitled &ldquo;Endorsements.&rdquo;
</p>
</li><li> COLLECTIONS OF DOCUMENTS

<p>You may make a collection consisting of the Document and other documents
released under this License, and replace the individual copies of this
License in the various documents with a single copy that is included in
the collection, provided that you follow the rules of this License for
verbatim copying of each of the documents in all other respects.
</p>
<p>You may extract a single document from such a collection, and distribute
it individually under this License, provided you insert a copy of this
License into the extracted document, and follow this License in all
other respects regarding verbatim copying of that document.
</p>
</li><li> AGGREGATION WITH INDEPENDENT WORKS

<p>A compilation of the Document or its derivatives with other separate
and independent documents or works, in or on a volume of a storage or
distribution medium, is called an &ldquo;aggregate&rdquo; if the copyright
resulting from the compilation is not used to limit the legal rights
of the compilation&rsquo;s users beyond what the individual works permit.
When the Document is included in an aggregate, this License does not
apply to the other works in the aggregate which are not themselves
derivative works of the Document.
</p>
<p>If the Cover Text requirement of section 3 is applicable to these
copies of the Document, then if the Document is less than one half of
the entire aggregate, the Document&rsquo;s Cover Texts may be placed on
covers that bracket the Document within the aggregate, or the
electronic equivalent of covers if the Document is in electronic form.
Otherwise they must appear on printed covers that bracket the whole
aggregate.
</p>
</li><li> TRANSLATION

<p>Translation is considered a kind of modification, so you may
distribute translations of the Document under the terms of section 4.
Replacing Invariant Sections with translations requires special
permission from their copyright holders, but you may include
translations of some or all Invariant Sections in addition to the
original versions of these Invariant Sections.  You may include a
translation of this License, and all the license notices in the
Document, and any Warranty Disclaimers, provided that you also include
the original English version of this License and the original versions
of those notices and disclaimers.  In case of a disagreement between
the translation and the original version of this License or a notice
or disclaimer, the original version will prevail.
</p>
<p>If a section in the Document is Entitled &ldquo;Acknowledgements&rdquo;,
&ldquo;Dedications&rdquo;, or &ldquo;History&rdquo;, the requirement (section 4) to Preserve
its Title (section 1) will typically require changing the actual
title.
</p>
</li><li> TERMINATION

<p>You may not copy, modify, sublicense, or distribute the Document except
as expressly provided for under this License.  Any other attempt to
copy, modify, sublicense or distribute the Document is void, and will
automatically terminate your rights under this License.  However,
parties who have received copies, or rights, from you under this
License will not have their licenses terminated so long as such
parties remain in full compliance.
</p>
</li><li> FUTURE REVISIONS OF THIS LICENSE

<p>The Free Software Foundation may publish new, revised versions
of the GNU Free Documentation License from time to time.  Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns.  See
<a href="http://www.gnu.org/copyleft/">http://www.gnu.org/copyleft/</a>.
</p>
<p>Each version of the License is given a distinguishing version number.
If the Document specifies that a particular numbered version of this
License &ldquo;or any later version&rdquo; applies to it, you have the option of
following the terms and conditions either of that specified version or
of any later version that has been published (not as a draft) by the
Free Software Foundation.  If the Document does not specify a version
number of this License, you may choose any version ever published (not
as a draft) by the Free Software Foundation.
</p></li></ol>

<a name="ADDENDUM_003a-How-to-use-this-License-for-your-documents"></a>
<h3 class="unnumberedsec">ADDENDUM: How to use this License for your documents</h3>

<p>To use this License in a document you have written, include a copy of
the License in the document and put the following copyright and
license notices just after the title page:
</p>
<div class="smallexample">
<pre class="smallexample">  Copyright (C)  <var>year</var>  <var>your name</var>.
  Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.2
  or any later version published by the Free Software Foundation;
  with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
  Texts.  A copy of the license is included in the section entitled ``GNU
  Free Documentation License''.
</pre></div>

<p>If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
replace the &ldquo;with...Texts.&rdquo; line with this:
</p>
<div class="smallexample">
<pre class="smallexample">    with the Invariant Sections being <var>list their titles</var>, with
    the Front-Cover Texts being <var>list</var>, and with the Back-Cover Texts
    being <var>list</var>.
</pre></div>

<p>If you have Invariant Sections without Cover Texts, or some other
combination of the three, merge those two alternatives to suit the
situation.
</p>
<p>If your document contains nontrivial examples of program code, we
recommend releasing these examples in parallel under your choice of
free software license, such as the GNU General Public License,
to permit their use in free software.
</p>





<hr>
<a name="Funding"></a>
<div class="header">
<p>
Next: <a href="#Option-Index" accesskey="n" rel="next">Option Index</a>, Previous: <a href="#GNU-Free-Documentation-License" accesskey="p" rel="prev">GNU Free Documentation License</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Funding-Free-Software"></a>
<h2 class="unnumbered">Funding Free Software</h2>

<p>If you want to have more free software a few years from now, it makes
sense for you to help encourage people to contribute funds for its
development.  The most effective approach known is to encourage
commercial redistributors to donate.
</p>
<p>Users of free software systems can boost the pace of development by
encouraging for-a-fee distributors to donate part of their selling price
to free software developers&mdash;the Free Software Foundation, and others.
</p>
<p>The way to convince distributors to do this is to demand it and expect
it from them.  So when you compare distributors, judge them partly by
how much they give to free software development.  Show distributors
they must compete to be the one who gives the most.
</p>
<p>To make this approach work, you must insist on numbers that you can
compare, such as, &ldquo;We will donate ten dollars to the Frobnitz project
for each disk sold.&rdquo;  Don&rsquo;t be satisfied with a vague promise, such as
&ldquo;A portion of the profits are donated,&rdquo; since it doesn&rsquo;t give a basis
for comparison.
</p>
<p>Even a precise fraction &ldquo;of the profits from this disk&rdquo; is not very
meaningful, since creative accounting and unrelated business decisions
can greatly alter what fraction of the sales price counts as profit.
If the price you pay is $50, ten percent of the profit is probably
less than a dollar; it might be a few cents, or nothing at all.
</p>
<p>Some redistributors do development work themselves.  This is useful too;
but to keep everyone honest, you need to inquire how much they do, and
what kind.  Some kinds of development make much more long-term
difference than others.  For example, maintaining a separate version of
a program contributes very little; maintaining the standard version of a
program for the whole community contributes much.  Easy new ports
contribute little, since someone else would surely do them; difficult
ports such as adding a new CPU to the GNU Compiler Collection contribute more;
major new features or packages contribute the most.
</p>
<p>By establishing the idea that supporting further development is &ldquo;the
proper thing to do&rdquo; when distributing free software for a fee, we can
assure a steady flow of resources into making more free software.
</p>
<div class="display">
<pre class="display">Copyright &copy; 1994 Free Software Foundation, Inc.
Verbatim copying and redistribution of this section is permitted
without royalty; alteration is not permitted.
</pre></div>


<hr>
<a name="Option-Index"></a>
<div class="header">
<p>
Next: <a href="#Keyword-Index" accesskey="n" rel="next">Keyword Index</a>, Previous: <a href="#Funding" accesskey="p" rel="prev">Funding</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Option-Index-1"></a>
<h2 class="unnumbered">Option Index</h2>
<p><code>gfortran</code>&rsquo;s command line options are indexed here without any
initial &lsquo;<samp>-</samp>&rsquo; or &lsquo;<samp>--</samp>&rsquo;. Where an option has both positive and
negative forms (such as -foption and -fno-option), relevant entries in
the manual are indexed under the most appropriate form; it may sometimes
be useful to look up both forms.
</p><table><tr><th valign="top">Jump to: &nbsp; </th><td><a class="summary-letter" href="#Option-Index_op_letter-A"><b>A</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-B"><b>B</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-C"><b>C</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-D"><b>D</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-F"><b>F</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-H"><b>H</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-I"><b>I</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-J"><b>J</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-M"><b>M</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-N"><b>N</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-P"><b>P</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-S"><b>S</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-U"><b>U</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-W"><b>W</b></a>
 &nbsp; 
</td></tr></table>
<table class="index-op" border="0">
<tr><td></td><th align="left">Index Entry</th><td>&nbsp;</td><th align="left"> Section</th></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-A">A</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-A_002dpredicate_003danswer"><code><code>A-<var>predicate</var>=<var>answer</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Apredicate_003danswer"><code><code>A<var>predicate</var>=<var>answer</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-B">B</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-backslash-1"><code><code>backslash</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-C">C</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-C"><code><code>C</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CC"><code><code>CC</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-cpp"><code><code>cpp</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-D">D</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-dD"><code><code>dD</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-dI"><code><code>dI</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-dM"><code><code>dM</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-dN"><code><code>dN</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Dname"><code><code>D<var>name</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Dname_003ddefinition"><code><code>D<var>name</var>=<var>definition</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-dU"><code><code>dU</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-F">F</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-falign_002dcommons"><code><code>falign-commons</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fall_002dintrinsics"><code><code>fall-intrinsics</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fbacktrace"><code><code>fbacktrace</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fblas_002dmatmul_002dlimit"><code><code>fblas-matmul-limit</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fbounds_002dcheck"><code><code>fbounds-check</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fcheck_002darray_002dtemporaries"><code><code>fcheck-array-temporaries</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fconvert_003dconversion"><code><code>fconvert=</code><var>conversion</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Runtime-Options">Runtime Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fcray_002dpointer"><code><code>fcray-pointer</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fd_002dlines_002das_002dcode"><code><code>fd-lines-as-code</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fd_002dlines_002das_002dcomments"><code><code>fd-lines-as-comments</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fdefault_002ddouble_002d8"><code><code>fdefault-double-8</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fdefault_002dinteger_002d8"><code><code>fdefault-integer-8</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fdefault_002dreal_002d8"><code><code>fdefault-real-8</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fdollar_002dok"><code><code>fdollar-ok</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fdump_002dcore"><code><code>fdump-core</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fdump_002dparse_002dtree"><code><code>fdump-parse-tree</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fexternal_002dblas"><code><code>fexternal-blas</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ff2c"><code>ff2c</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ffixed_002dline_002dlength_002dn"><code><code>ffixed-line-length-</code><var>n</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ffpe_002dtrap_003dlist"><code><code>ffpe-trap=</code><var>list</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ffree_002dform"><code><code>ffree-form</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ffree_002dline_002dlength_002dn"><code><code>ffree-line-length-</code><var>n</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fimplicit_002dnone"><code><code>fimplicit-none</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-finit_002dcharacter"><code><code>finit-character</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-finit_002dinteger"><code><code>finit-integer</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-finit_002dlocal_002dzero"><code><code>finit-local-zero</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-finit_002dlogical"><code><code>finit-logical</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-finit_002dreal"><code><code>finit-real</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fintrinsic_002dmodules_002dpath-dir"><code><code>fintrinsic-modules-path</code> <var>dir</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fmax_002darray_002dconstructor"><code><code>fmax-array-constructor</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fmax_002derrors_003dn"><code><code>fmax-errors=</code><var>n</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fmax_002didentifier_002dlength_003dn"><code><code>fmax-identifier-length=</code><var>n</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fmax_002dstack_002dvar_002dsize"><code><code>fmax-stack-var-size</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fmax_002dsubrecord_002dlength_003dlength"><code><code>fmax-subrecord-length=</code><var>length</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Runtime-Options">Runtime Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fmodule_002dprivate"><code><code>fmodule-private</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fno_002dautomatic"><code><code>fno-automatic</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fno_002dfixed_002dform"><code><code>fno-fixed-form</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fno_002drange_002dcheck"><code><code>fno-range-check</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Runtime-Options">Runtime Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fno_002dunderscoring"><code><code>fno-underscoring</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fopenmp"><code><code>fopenmp</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fpack_002dderived"><code><code>fpack-derived</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fpp"><code><code>fpp</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-frange_002dcheck"><code><code>frange-check</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-frecord_002dmarker_003dlength"><code><code>frecord-marker=</code><var>length</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Runtime-Options">Runtime Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-frecursive"><code><code>frecursive</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-frepack_002darrays"><code><code>frepack-arrays</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fsecond_002dunderscore"><code><code>fsecond-underscore</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fshort_002denums"><code><code>fshort-enums</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fshort_002denums-1"><code><code>fshort-enums</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fsign_002dzero"><code><code>fsign-zero</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Runtime-Options">Runtime Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fsyntax_002donly"><code><code>fsyntax-only</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-fworking_002ddirectory"><code><code>fworking-directory</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-H">H</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-H"><code><code>H</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-I">I</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Idir"><code><code>I</code><var>dir</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-idirafter-dir"><code><code>idirafter <var>dir</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-imultilib-dir"><code><code>imultilib <var>dir</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-iprefix-prefix"><code><code>iprefix <var>prefix</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-iquote-dir"><code><code>iquote <var>dir</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-isysroot-dir"><code><code>isysroot <var>dir</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-isystem-dir"><code><code>isystem <var>dir</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-J">J</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Jdir"><code><code>J</code><var>dir</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-M">M</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Mdir"><code><code>M</code><var>dir</var></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-N">N</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-nostdinc"><code><code>nostdinc</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-P">P</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-P"><code><code>P</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pedantic"><code><code>pedantic</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pedantic_002derrors"><code><code>pedantic-errors</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-S">S</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-static_002dlibgfortran"><code><code>static-libgfortran</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Link-Options">Link Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-std_003dstd-option"><code><code>std=</code><var>std</var> option</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-U">U</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Uname"><code><code>U<var>name</var></code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-undef"><code><code>undef</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Option-Index_op_letter-W">W</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Waliasing"><code><code>Waliasing</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Walign_002dcommons"><code><code>Walign-commons</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wall"><code><code>Wall</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wampersand"><code><code>Wampersand</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Warray_002dtemporaries"><code><code>Warray-temporaries</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wcharacter_002dtruncation"><code><code>Wcharacter-truncation</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wconversion"><code><code>Wconversion</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Werror"><code><code>Werror</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wimplicit_002dinterface"><code><code>Wimplicit-interface</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wintrinsic_002dshadow"><code><code>Wintrinsic-shadow</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wintrinsics_002dstd"><code><code>Wintrinsics-std</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wline_002dtruncation"><code><code>Wline-truncation</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wsurprising"><code><code>Wsurprising</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wtabs"><code><code>Wtabs</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wunderflow"><code><code>Wunderflow</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Wunused_002dparameter"><code><code>Wunused-parameter</code></code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
</table>
<table><tr><th valign="top">Jump to: &nbsp; </th><td><a class="summary-letter" href="#Option-Index_op_letter-A"><b>A</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-B"><b>B</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-C"><b>C</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-D"><b>D</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-F"><b>F</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-H"><b>H</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-I"><b>I</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-J"><b>J</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-M"><b>M</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-N"><b>N</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-P"><b>P</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-S"><b>S</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-U"><b>U</b></a>
 &nbsp; 
<a class="summary-letter" href="#Option-Index_op_letter-W"><b>W</b></a>
 &nbsp; 
</td></tr></table>

<hr>
<a name="Keyword-Index"></a>
<div class="header">
<p>
Previous: <a href="#Option-Index" accesskey="p" rel="prev">Option Index</a>, Up: <a href="#Top" accesskey="u" rel="up">Top</a> &nbsp; [<a href="#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="#Option-Index" title="Index" rel="index">Index</a>]</p>
</div>
<a name="Keyword-Index-1"></a>
<h2 class="unnumbered">Keyword Index</h2>
<table><tr><th valign="top">Jump to: &nbsp; </th><td><a class="summary-letter" href="#Keyword-Index_cp_symbol-1"><b>$</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_symbol-2"><b>%</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_symbol-3"><b>&amp;</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_symbol-4"><b>[</b></a>
 &nbsp; 
<br>
<a class="summary-letter" href="#Keyword-Index_cp_letter-A"><b>A</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-B"><b>B</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-C"><b>C</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-D"><b>D</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-E"><b>E</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-F"><b>F</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-G"><b>G</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-H"><b>H</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-I"><b>I</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-K"><b>K</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-L"><b>L</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-M"><b>M</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-N"><b>N</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-O"><b>O</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-P"><b>P</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-R"><b>R</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-S"><b>S</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-T"><b>T</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-U"><b>U</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-V"><b>V</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-W"><b>W</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-X"><b>X</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-Z"><b>Z</b></a>
 &nbsp; 
</td></tr></table>
<table class="index-cp" border="0">
<tr><td></td><th align="left">Index Entry</th><td>&nbsp;</td><th align="left"> Section</th></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_symbol-1">$</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-_0024">$</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_symbol-2">%</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-_0025LOC"><code>%LOC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Argument-list-functions">Argument list functions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-_0025REF"><code>%REF</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Argument-list-functions">Argument list functions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-_0025VAL"><code>%VAL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Argument-list-functions">Argument list functions</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_symbol-3">&amp;</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-_0026">&amp;</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_symbol-4">[</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-_005b_002e_002e_002e_005d"><code>[...]</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-A">A</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-ABORT"><code>ABORT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABORT">ABORT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ABS"><code>ABS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABS">ABS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-absolute-value">absolute value</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABS">ABS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ACCESS"><code>ACCESS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACCESS">ACCESS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ACCESS_003d_0027STREAM_0027-I_002fO"><code>ACCESS='STREAM'</code> I/O</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ACHAR"><code>ACHAR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACHAR">ACHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ACOS"><code>ACOS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOS">ACOS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ACOSH"><code>ACOSH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOSH">ACOSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-adjust-string">adjust string</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ADJUSTL">ADJUSTL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-adjust-string-1">adjust string</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ADJUSTR">ADJUSTR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ADJUSTL"><code>ADJUSTL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ADJUSTL">ADJUSTL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ADJUSTR"><code>ADJUSTR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ADJUSTR">ADJUSTR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AIMAG"><code>AIMAG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#AIMAG">AIMAG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AINT"><code>AINT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#AINT">AINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALARM"><code>ALARM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ALARM">ALARM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALGAMA"><code>ALGAMA</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG_005fGAMMA">LOG_GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-aliasing">aliasing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-alignment-of-COMMON-blocks">alignment of COMMON blocks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-alignment-of-COMMON-blocks-1">alignment of COMMON blocks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALL"><code>ALL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ALL">ALL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-all-warnings">all warnings</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALLOCATABLE-components-of-derived-types"><code>ALLOCATABLE</code> components of derived types</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALLOCATABLE-dummy-arguments"><code>ALLOCATABLE</code> dummy arguments</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALLOCATABLE-function-results"><code>ALLOCATABLE</code> function results</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALLOCATED"><code>ALLOCATED</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ALLOCATED">ALLOCATED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-allocation_002c-moving">allocation, moving</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MOVE_005fALLOC">MOVE_ALLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-allocation_002c-status">allocation, status</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ALLOCATED">ALLOCATED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALOG"><code>ALOG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG">LOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ALOG10"><code>ALOG10</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG10">LOG10</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AMAX0"><code>AMAX0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAX">MAX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AMAX1"><code>AMAX1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAX">MAX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AMIN0"><code>AMIN0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MIN">MIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AMIN1"><code>AMIN1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MIN">MIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AMOD"><code>AMOD</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MOD">MOD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-AND"><code>AND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#AND">AND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ANINT"><code>ANINT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ANINT">ANINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ANY"><code>ANY</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ANY">ANY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-area-hyperbolic-cosine">area hyperbolic cosine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOSH">ACOSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-area-hyperbolic-sine">area hyperbolic sine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASINH">ASINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-area-hyperbolic-tangent">area hyperbolic tangent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATANH">ATANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-argument-list-functions">argument list functions</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Argument-list-functions">Argument list functions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-arguments_002c-to-program">arguments, to program</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-arguments_002c-to-program-1">arguments, to program</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETARG">GETARG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-arguments_002c-to-program-2">arguments, to program</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GET_005fCOMMAND">GET_COMMAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-arguments_002c-to-program-3">arguments, to program</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GET_005fCOMMAND_005fARGUMENT">GET_COMMAND_ARGUMENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-arguments_002c-to-program-4">arguments, to program</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IARGC">IARGC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-add-elements">array, add elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SUM">SUM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-apply-condition">array, apply condition</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ALL">ALL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-apply-condition-1">array, apply condition</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ANY">ANY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-bounds-checking">array, bounds checking</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-change-dimensions">array, change dimensions</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RESHAPE">RESHAPE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-combine-arrays">array, combine arrays</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MERGE">MERGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-condition-testing">array, condition testing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ALL">ALL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-condition-testing-1">array, condition testing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ANY">ANY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-conditionally-add-elements">array, conditionally add elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SUM">SUM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-conditionally-count-elements">array, conditionally count elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COUNT">COUNT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-conditionally-multiply-elements">array, conditionally multiply elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PRODUCT">PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-constructors">array, constructors</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-count-elements">array, count elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIZE">SIZE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-duplicate-dimensions">array, duplicate dimensions</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SPREAD">SPREAD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-duplicate-elements">array, duplicate elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SPREAD">SPREAD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-element-counting">array, element counting</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COUNT">COUNT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-gather-elements">array, gather elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PACK">PACK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-increase-dimension">array, increase dimension</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SPREAD">SPREAD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-increase-dimension-1">array, increase dimension</a>:</td><td>&nbsp;</td><td valign="top"><a href="#UNPACK">UNPACK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-indices-of-type-real">array, indices of type real</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Real-array-indices">Real array indices</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-location-of-maximum-element">array, location of maximum element</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAXLOC">MAXLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-location-of-minimum-element">array, location of minimum element</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MINLOC">MINLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-lower-bound">array, lower bound</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LBOUND">LBOUND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-maximum-value">array, maximum value</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAXVAL">MAXVAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-merge-arrays">array, merge arrays</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MERGE">MERGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-minimum-value">array, minimum value</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MINVAL">MINVAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-multiply-elements">array, multiply elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PRODUCT">PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-number-of-elements">array, number of elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COUNT">COUNT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-number-of-elements-1">array, number of elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIZE">SIZE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-packing">array, packing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PACK">PACK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-permutation">array, permutation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CSHIFT">CSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-product">array, product</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PRODUCT">PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-reduce-dimension">array, reduce dimension</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PACK">PACK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-rotate">array, rotate</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CSHIFT">CSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-scatter-elements">array, scatter elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#UNPACK">UNPACK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-shape">array, shape</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SHAPE">SHAPE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-shift">array, shift</a>:</td><td>&nbsp;</td><td valign="top"><a href="#EOSHIFT">EOSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-shift-circularly">array, shift circularly</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CSHIFT">CSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-size">array, size</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIZE">SIZE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-sum">array, sum</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SUM">SUM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-transmogrify">array, transmogrify</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RESHAPE">RESHAPE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-transpose">array, transpose</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRANSPOSE">TRANSPOSE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-unpacking">array, unpacking</a>:</td><td>&nbsp;</td><td valign="top"><a href="#UNPACK">UNPACK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-array_002c-upper-bound">array, upper bound</a>:</td><td>&nbsp;</td><td valign="top"><a href="#UBOUND">UBOUND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ASCII-collating-sequence"><acronym>ASCII</acronym> collating sequence</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACHAR">ACHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ASCII-collating-sequence-1"><acronym>ASCII</acronym> collating sequence</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IACHAR">IACHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ASIN"><code>ASIN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASIN">ASIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ASINH"><code>ASINH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASINH">ASINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ASINH-1"><code>ASINH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATANH">ATANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ASSOCIATED"><code>ASSOCIATED</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASSOCIATED">ASSOCIATED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-association-status">association status</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASSOCIATED">ASSOCIATED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-association-status_002c-C-pointer">association status, C pointer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fASSOCIATED">C_ASSOCIATED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ATAN"><code>ATAN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATAN">ATAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ATAN2"><code>ATAN2</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATAN2">ATAN2</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Authors">Authors</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Contributors">Contributors</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-B">B</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-backslash">backslash</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-backtrace">backtrace</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESJ0"><code>BESJ0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJ0">BESSEL_J0</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESJ1"><code>BESJ1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJ1">BESSEL_J1</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESJN"><code>BESJN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJN">BESSEL_JN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bessel-function_002c-first-kind">Bessel function, first kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJ0">BESSEL_J0</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bessel-function_002c-first-kind-1">Bessel function, first kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJ1">BESSEL_J1</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bessel-function_002c-first-kind-2">Bessel function, first kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJN">BESSEL_JN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bessel-function_002c-second-kind">Bessel function, second kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fY0">BESSEL_Y0</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bessel-function_002c-second-kind-1">Bessel function, second kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fY1">BESSEL_Y1</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Bessel-function_002c-second-kind-2">Bessel function, second kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fYN">BESSEL_YN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESSEL_005fJ0"><code>BESSEL_J0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJ0">BESSEL_J0</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESSEL_005fJ1"><code>BESSEL_J1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJ1">BESSEL_J1</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESSEL_005fJN"><code>BESSEL_JN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJN">BESSEL_JN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESSEL_005fY0"><code>BESSEL_Y0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fY0">BESSEL_Y0</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESSEL_005fY1"><code>BESSEL_Y1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fY1">BESSEL_Y1</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESSEL_005fYN"><code>BESSEL_YN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fYN">BESSEL_YN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESY0"><code>BESY0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fY0">BESSEL_Y0</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESY1"><code>BESY1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fY1">BESSEL_Y1</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BESYN"><code>BESYN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fYN">BESSEL_YN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-clear">bits, clear</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IBCLR">IBCLR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-extract">bits, extract</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IBITS">IBITS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-get">bits, get</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IBITS">IBITS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-move">bits, move</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MVBITS">MVBITS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-move-1">bits, move</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRANSFER">TRANSFER</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-negate">bits, negate</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NOT">NOT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-number-of">bits, number of</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BIT_005fSIZE">BIT_SIZE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-set">bits, set</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IBSET">IBSET</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-shift">bits, shift</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ISHFT">ISHFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-shift-circular">bits, shift circular</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ISHFTC">ISHFTC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-shift-left">bits, shift left</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LSHIFT">LSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-shift-right">bits, shift right</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RSHIFT">RSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-testing">bits, testing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BTEST">BTEST</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bits_002c-unset">bits, unset</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IBCLR">IBCLR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bitwise-logical-and">bitwise logical and</a>:</td><td>&nbsp;</td><td valign="top"><a href="#AND">AND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bitwise-logical-and-1">bitwise logical and</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IAND">IAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bitwise-logical-exclusive-or">bitwise logical exclusive or</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IEOR">IEOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bitwise-logical-exclusive-or-1">bitwise logical exclusive or</a>:</td><td>&nbsp;</td><td valign="top"><a href="#XOR">XOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bitwise-logical-not">bitwise logical not</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NOT">NOT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bitwise-logical-or">bitwise logical or</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IOR">IOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bitwise-logical-or-1">bitwise logical or</a>:</td><td>&nbsp;</td><td valign="top"><a href="#OR">OR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BIT_005fSIZE"><code>BIT_SIZE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BIT_005fSIZE">BIT_SIZE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-bounds-checking">bounds checking</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BOZ-literal-constants">BOZ literal constants</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BOZ-literal-constants">BOZ literal constants</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-BTEST"><code>BTEST</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BTEST">BTEST</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-C">C</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-CABS"><code>CABS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABS">ABS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-calling-convention">calling convention</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CCOS"><code>CCOS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COS">COS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CDABS"><code>CDABS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABS">ABS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CDCOS"><code>CDCOS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COS">COS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CDEXP"><code>CDEXP</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXP">EXP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CDLOG"><code>CDLOG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG">LOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CDSIN"><code>CDSIN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIN">SIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CDSQRT"><code>CDSQRT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SQRT">SQRT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CEILING"><code>CEILING</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CEILING">CEILING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ceiling">ceiling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ANINT">ANINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ceiling-1">ceiling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CEILING">CEILING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CEXP"><code>CEXP</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXP">EXP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CHAR"><code>CHAR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CHAR">CHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-character-kind">character kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fCHAR_005fKIND">SELECTED_CHAR_KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-character-set">character set</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CHDIR"><code>CHDIR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CHDIR">CHDIR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-checking-array-temporaries">checking array temporaries</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-checking-subscripts">checking subscripts</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CHMOD"><code>CHMOD</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CHMOD">CHMOD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-clock-ticks">clock ticks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MCLOCK">MCLOCK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-clock-ticks-1">clock ticks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MCLOCK8">MCLOCK8</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-clock-ticks-2">clock ticks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SYSTEM_005fCLOCK">SYSTEM_CLOCK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CLOG"><code>CLOG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG">LOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CMPLX"><code>CMPLX</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CMPLX">CMPLX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-code-generation_002c-conventions">code generation, conventions</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-collating-sequence_002c-ASCII">collating sequence, <acronym>ASCII</acronym></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACHAR">ACHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-collating-sequence_002c-ASCII-1">collating sequence, <acronym>ASCII</acronym></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IACHAR">IACHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-command-options">command options</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Invoking-GNU-Fortran">Invoking GNU Fortran</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-command_002dline-arguments">command-line arguments</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-command_002dline-arguments-1">command-line arguments</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETARG">GETARG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-command_002dline-arguments-2">command-line arguments</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GET_005fCOMMAND">GET_COMMAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-command_002dline-arguments-3">command-line arguments</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GET_005fCOMMAND_005fARGUMENT">GET_COMMAND_ARGUMENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-command_002dline-arguments-4">command-line arguments</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IARGC">IARGC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-command_002dline-arguments_002c-number-of">command-line arguments, number of</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-command_002dline-arguments_002c-number-of-1">command-line arguments, number of</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IARGC">IARGC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-COMMAND_005fARGUMENT_005fCOUNT"><code>COMMAND_ARGUMENT_COUNT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COMMAND_005fARGUMENT_005fCOUNT">COMMAND_ARGUMENT_COUNT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-COMPLEX"><code>COMPLEX</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COMPLEX">COMPLEX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-complex-conjugate">complex conjugate</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CONJG">CONJG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-complex-numbers_002c-conversion-to">complex numbers, conversion to</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CMPLX">CMPLX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-complex-numbers_002c-conversion-to-1">complex numbers, conversion to</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COMPLEX">COMPLEX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-complex-numbers_002c-conversion-to-2">complex numbers, conversion to</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DCMPLX">DCMPLX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-complex-numbers_002c-imaginary-part">complex numbers, imaginary part</a>:</td><td>&nbsp;</td><td valign="top"><a href="#AIMAG">AIMAG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-complex-numbers_002c-real-part">complex numbers, real part</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DREAL">DREAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-complex-numbers_002c-real-part-1">complex numbers, real part</a>:</td><td>&nbsp;</td><td valign="top"><a href="#REAL">REAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Conditional-compilation">Conditional compilation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-and-conditional-compilation">Preprocessing and conditional compilation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CONJG"><code>CONJG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CONJG">CONJG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Contributing">Contributing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Contributing">Contributing</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Contributors">Contributors</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Contributors">Contributors</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion">conversion</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-character">conversion, to character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CHAR">CHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-complex">conversion, to complex</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CMPLX">CMPLX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-complex-1">conversion, to complex</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COMPLEX">COMPLEX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-complex-2">conversion, to complex</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DCMPLX">DCMPLX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-integer">conversion, to integer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Implicitly-convert-LOGICAL-and-INTEGER-values">Implicitly convert LOGICAL and INTEGER values</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-integer-1">conversion, to integer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IACHAR">IACHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-integer-2">conversion, to integer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ICHAR">ICHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-integer-3">conversion, to integer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT">INT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-integer-4">conversion, to integer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT2">INT2</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-integer-5">conversion, to integer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT8">INT8</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-integer-6">conversion, to integer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LONG">LONG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-logical">conversion, to logical</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Implicitly-convert-LOGICAL-and-INTEGER-values">Implicitly convert LOGICAL and INTEGER values</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-logical-1">conversion, to logical</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOGICAL">LOGICAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-real">conversion, to real</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DBLE">DBLE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-real-1">conversion, to real</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DFLOAT">DFLOAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-real-2">conversion, to real</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FLOAT">FLOAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-real-3">conversion, to real</a>:</td><td>&nbsp;</td><td valign="top"><a href="#REAL">REAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-real-4">conversion, to real</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SNGL">SNGL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-conversion_002c-to-string">conversion, to string</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CTIME">CTIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CONVERT-specifier"><code>CONVERT</code> specifier</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CONVERT-specifier">CONVERT specifier</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-core_002c-dump">core, dump</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-core_002c-dump-1">core, dump</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABORT">ABORT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-COS"><code>COS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COS">COS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-COSH"><code>COSH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COSH">COSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-cosine">cosine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COS">COS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-cosine_002c-hyperbolic">cosine, hyperbolic</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COSH">COSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-cosine_002c-hyperbolic_002c-inverse">cosine, hyperbolic, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOSH">ACOSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-cosine_002c-inverse">cosine, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOS">ACOS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-COUNT"><code>COUNT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COUNT">COUNT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CPP">CPP</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-and-conditional-compilation">Preprocessing and conditional compilation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CPP-1">CPP</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CPU_005fTIME"><code>CPU_TIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CPU_005fTIME">CPU_TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Credits">Credits</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Contributors">Contributors</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CSHIFT"><code>CSHIFT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CSHIFT">CSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CSIN"><code>CSIN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIN">SIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CSQRT"><code>CSQRT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SQRT">SQRT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-CTIME"><code>CTIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CTIME">CTIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-current-date">current date</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DATE_005fAND_005fTIME">DATE_AND_TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-current-date-1">current date</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FDATE">FDATE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-current-date-2">current date</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IDATE">IDATE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-current-time">current time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DATE_005fAND_005fTIME">DATE_AND_TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-current-time-1">current time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FDATE">FDATE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-current-time-2">current time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ITIME">ITIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-current-time-3">current time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TIME">TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-current-time-4">current time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TIME8">TIME8</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_005fASSOCIATED"><code>C_ASSOCIATED</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fASSOCIATED">C_ASSOCIATED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_005fFUNLOC"><code>C_FUNLOC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fFUNLOC">C_FUNLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_005fF_005fPOINTER"><code>C_F_POINTER</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fF_005fPOINTER">C_F_POINTER</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_005fF_005fPROCPOINTER"><code>C_F_PROCPOINTER</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fF_005fPROCPOINTER">C_F_PROCPOINTER</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_005fLOC"><code>C_LOC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fLOC">C_LOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-C_005fSIZEOF"><code>C_SIZEOF</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fSIZEOF">C_SIZEOF</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-D">D</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-DABS"><code>DABS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABS">ABS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DACOS"><code>DACOS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOS">ACOS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DACOSH"><code>DACOSH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOSH">ACOSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DASIN"><code>DASIN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASIN">ASIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DASINH"><code>DASINH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASINH">ASINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DASINH-1"><code>DASINH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATANH">ATANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DATAN"><code>DATAN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATAN">ATAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DATAN2"><code>DATAN2</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATAN2">ATAN2</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-date_002c-current">date, current</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DATE_005fAND_005fTIME">DATE_AND_TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-date_002c-current-1">date, current</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FDATE">FDATE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-date_002c-current-2">date, current</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IDATE">IDATE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DATE_005fAND_005fTIME"><code>DATE_AND_TIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DATE_005fAND_005fTIME">DATE_AND_TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DBESJ0"><code>DBESJ0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJ0">BESSEL_J0</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DBESJ1"><code>DBESJ1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJ1">BESSEL_J1</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DBESJN"><code>DBESJN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fJN">BESSEL_JN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DBESY0"><code>DBESY0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fY0">BESSEL_Y0</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DBESY1"><code>DBESY1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fY1">BESSEL_Y1</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DBESYN"><code>DBESYN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#BESSEL_005fYN">BESSEL_YN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DBLE"><code>DBLE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DBLE">DBLE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DCMPLX"><code>DCMPLX</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DCMPLX">DCMPLX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DCONJG"><code>DCONJG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#CONJG">CONJG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DCOS"><code>DCOS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COS">COS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DCOSH"><code>DCOSH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COSH">COSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DDIM"><code>DDIM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DIM">DIM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-debugging-information-options">debugging information options</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-debugging_002c-preprocessor">debugging, preprocessor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-debugging_002c-preprocessor-1">debugging, preprocessor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-debugging_002c-preprocessor-2">debugging, preprocessor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-debugging_002c-preprocessor-3">debugging, preprocessor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-debugging_002c-preprocessor-4">debugging, preprocessor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DECODE"><code>DECODE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ENCODE-and-DECODE-statements">ENCODE and DECODE statements</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-delayed-execution">delayed execution</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ALARM">ALARM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-delayed-execution-1">delayed execution</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SLEEP">SLEEP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DEXP"><code>DEXP</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXP">EXP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DFLOAT"><code>DFLOAT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DFLOAT">DFLOAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DGAMMA"><code>DGAMMA</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GAMMA">GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-dialect-options">dialect options</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DIGITS"><code>DIGITS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DIGITS">DIGITS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DIM"><code>DIM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DIM">DIM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DIMAG"><code>DIMAG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#AIMAG">AIMAG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DINT"><code>DINT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#AINT">AINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-directive_002c-INCLUDE">directive, INCLUDE</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-directory_002c-options">directory, options</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-directory_002c-search-paths-for-inclusion">directory, search paths for inclusion</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-division_002c-modulo">division, modulo</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MODULO">MODULO</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-division_002c-remainder">division, remainder</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MOD">MOD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DLGAMA"><code>DLGAMA</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG_005fGAMMA">LOG_GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DLOG"><code>DLOG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG">LOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DLOG10"><code>DLOG10</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG10">LOG10</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DMAX1"><code>DMAX1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAX">MAX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DMIN1"><code>DMIN1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MIN">MIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DMOD"><code>DMOD</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MOD">MOD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DNINT"><code>DNINT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ANINT">ANINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-dot-product">dot product</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DOT_005fPRODUCT">DOT_PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DOT_005fPRODUCT"><code>DOT_PRODUCT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DOT_005fPRODUCT">DOT_PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DPROD"><code>DPROD</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DPROD">DPROD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DREAL"><code>DREAL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DREAL">DREAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DSIGN"><code>DSIGN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIGN">SIGN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DSIN"><code>DSIN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIN">SIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DSINH"><code>DSINH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SINH">SINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DSQRT"><code>DSQRT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SQRT">SQRT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DTAN"><code>DTAN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TAN">TAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DTANH"><code>DTANH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TANH">TANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-DTIME"><code>DTIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DTIME">DTIME</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-E">E</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-elapsed-time">elapsed time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DTIME">DTIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-elapsed-time-1">elapsed time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SECNDS">SECNDS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-elapsed-time-2">elapsed time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SECOND">SECOND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ENCODE"><code>ENCODE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ENCODE-and-DECODE-statements">ENCODE and DECODE statements</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ENUM-statement"><code>ENUM</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ENUMERATOR-statement"><code>ENUMERATOR</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-environment-variable">environment variable</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Environment-Variables">Environment Variables</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-environment-variable-1">environment variable</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Runtime">Runtime</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-environment-variable-2">environment variable</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETENV">GETENV</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-environment-variable-3">environment variable</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GET_005fENVIRONMENT_005fVARIABLE">GET_ENVIRONMENT_VARIABLE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-EOSHIFT"><code>EOSHIFT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EOSHIFT">EOSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-EPSILON"><code>EPSILON</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EPSILON">EPSILON</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ERF"><code>ERF</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ERF">ERF</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ERFC"><code>ERFC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ERFC">ERFC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ERFC_005fSCALED"><code>ERFC_SCALED</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ERFC_005fSCALED">ERFC_SCALED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-error-function">error function</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ERF">ERF</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-error-function_002c-complementary">error function, complementary</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ERFC">ERFC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-error-function_002c-complementary_002c-exponentially_002dscaled">error function, complementary, exponentially-scaled</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ERFC_005fSCALED">ERFC_SCALED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-errors_002c-limiting">errors, limiting</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-escape-characters">escape characters</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ETIME"><code>ETIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ETIME">ETIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Euclidean-distance">Euclidean distance</a>:</td><td>&nbsp;</td><td valign="top"><a href="#HYPOT">HYPOT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-EXIT"><code>EXIT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXIT">EXIT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-EXP"><code>EXP</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXP">EXP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-EXPONENT"><code>EXPONENT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXPONENT">EXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-exponential-function">exponential function</a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXP">EXP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-exponential-function_002c-inverse">exponential function, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG">LOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-exponential-function_002c-inverse-1">exponential function, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG10">LOG10</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-expression-size">expression size</a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fSIZEOF">C_SIZEOF</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-expression-size-1">expression size</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIZEOF">SIZEOF</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-extensions">extensions</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Extensions">Extensions</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-extensions_002c-implemented">extensions, implemented</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Extensions-implemented-in-GNU-Fortran">Extensions implemented in GNU Fortran</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-extensions_002c-not-implemented">extensions, not implemented</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Extensions-not-implemented-in-GNU-Fortran">Extensions not implemented in GNU Fortran</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-F">F</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-f2c-calling-convention"><code>f2c</code> calling convention</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-f2c-calling-convention-1"><code>f2c</code> calling convention</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Factorial-function">Factorial function</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GAMMA">GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FDATE"><code>FDATE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FDATE">FDATE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FDL_002c-GNU-Free-Documentation-License">FDL, GNU Free Documentation License</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GNU-Free-Documentation-License">GNU Free Documentation License</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FGET"><code>FGET</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FGET">FGET</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FGETC"><code>FGETC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FGETC">FGETC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-format_002c-fixed">file format, fixed</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-format_002c-fixed-1">file format, fixed</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-format_002c-free">file format, free</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-format_002c-free-1">file format, free</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-file-number">file operation, file number</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FNUM">FNUM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-flush">file operation, flush</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FLUSH">FLUSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-position">file operation, position</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FSEEK">FSEEK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-position-1">file operation, position</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FTELL">FTELL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-read-character">file operation, read character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FGET">FGET</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-read-character-1">file operation, read character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FGETC">FGETC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-seek">file operation, seek</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FSEEK">FSEEK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-write-character">file operation, write character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FPUT">FPUT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-operation_002c-write-character-1">file operation, write character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FPUTC">FPUTC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-access-mode">file system, access mode</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACCESS">ACCESS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-change-access-mode">file system, change access mode</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CHMOD">CHMOD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-create-link">file system, create link</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LINK">LINK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-create-link-1">file system, create link</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SYMLNK">SYMLNK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-file-creation-mask">file system, file creation mask</a>:</td><td>&nbsp;</td><td valign="top"><a href="#UMASK">UMASK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-file-status">file system, file status</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FSTAT">FSTAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-file-status-1">file system, file status</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LSTAT">LSTAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-file-status-2">file system, file status</a>:</td><td>&nbsp;</td><td valign="top"><a href="#STAT">STAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-hard-link">file system, hard link</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LINK">LINK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-remove-file">file system, remove file</a>:</td><td>&nbsp;</td><td valign="top"><a href="#UNLINK">UNLINK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-rename-file">file system, rename file</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RENAME">RENAME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-file-system_002c-soft-link">file system, soft link</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SYMLNK">SYMLNK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FLOAT"><code>FLOAT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FLOAT">FLOAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floating-point_002c-exponent">floating point, exponent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXPONENT">EXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floating-point_002c-fraction">floating point, fraction</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FRACTION">FRACTION</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floating-point_002c-nearest-different">floating point, nearest different</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NEAREST">NEAREST</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floating-point_002c-relative-spacing">floating point, relative spacing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RRSPACING">RRSPACING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floating-point_002c-relative-spacing-1">floating point, relative spacing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SPACING">SPACING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floating-point_002c-scale">floating point, scale</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SCALE">SCALE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floating-point_002c-set-exponent">floating point, set exponent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SET_005fEXPONENT">SET_EXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FLOOR"><code>FLOOR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FLOOR">FLOOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floor">floor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#AINT">AINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-floor-1">floor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FLOOR">FLOOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FLUSH"><code>FLUSH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FLUSH">FLUSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FLUSH-statement"><code>FLUSH</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FNUM"><code>FNUM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FNUM">FNUM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Fortran-77">Fortran 77</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GNU-Fortran-and-G77">GNU Fortran and G77</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FPP">FPP</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-and-conditional-compilation">Preprocessing and conditional compilation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FPUT"><code>FPUT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FPUT">FPUT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FPUTC"><code>FPUTC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FPUTC">FPUTC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FRACTION"><code>FRACTION</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FRACTION">FRACTION</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FREE"><code>FREE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FREE">FREE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FSEEK"><code>FSEEK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FSEEK">FSEEK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FSTAT"><code>FSTAT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FSTAT">FSTAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-FTELL"><code>FTELL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#FTELL">FTELL</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-G">G</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-g77"><code>g77</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GNU-Fortran-and-G77">GNU Fortran and G77</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-g77-calling-convention"><code>g77</code> calling convention</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-g77-calling-convention-1"><code>g77</code> calling convention</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GAMMA"><code>GAMMA</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GAMMA">GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Gamma-function">Gamma function</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GAMMA">GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Gamma-function_002c-logarithm-of">Gamma function, logarithm of</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG_005fGAMMA">LOG_GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GCC">GCC</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GNU-Fortran-and-GCC">GNU Fortran and GCC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GERROR"><code>GERROR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GERROR">GERROR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GETARG"><code>GETARG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETARG">GETARG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GETCWD"><code>GETCWD</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETCWD">GETCWD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GETENV"><code>GETENV</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETENV">GETENV</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GETGID"><code>GETGID</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETGID">GETGID</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GETLOG"><code>GETLOG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETLOG">GETLOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GETPID"><code>GETPID</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETPID">GETPID</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GETUID"><code>GETUID</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETUID">GETUID</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GET_005fCOMMAND"><code>GET_COMMAND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GET_005fCOMMAND">GET_COMMAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GET_005fCOMMAND_005fARGUMENT"><code>GET_COMMAND_ARGUMENT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GET_005fCOMMAND_005fARGUMENT">GET_COMMAND_ARGUMENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GET_005fENVIRONMENT_005fVARIABLE"><code>GET_ENVIRONMENT_VARIABLE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GET_005fENVIRONMENT_005fVARIABLE">GET_ENVIRONMENT_VARIABLE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GMTIME"><code>GMTIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#GMTIME">GMTIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNU-Compiler-Collection">GNU Compiler Collection</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GNU-Fortran-and-GCC">GNU Fortran and GCC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-GNU-Fortran-command-options">GNU Fortran command options</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Invoking-GNU-Fortran">Invoking GNU Fortran</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-H">H</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Hollerith-constants">Hollerith constants</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Hollerith-constants-support">Hollerith constants support</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-HOSTNM"><code>HOSTNM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#HOSTNM">HOSTNM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-HUGE"><code>HUGE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#HUGE">HUGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-arccosine">hyperbolic arccosine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOSH">ACOSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-arcsine">hyperbolic arcsine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASINH">ASINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-arctangent">hyperbolic arctangent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATANH">ATANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-cosine">hyperbolic cosine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COSH">COSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-function_002c-cosine">hyperbolic function, cosine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COSH">COSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-function_002c-cosine_002c-inverse">hyperbolic function, cosine, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOSH">ACOSH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-function_002c-sine">hyperbolic function, sine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SINH">SINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-function_002c-sine_002c-inverse">hyperbolic function, sine, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASINH">ASINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-function_002c-tangent">hyperbolic function, tangent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TANH">TANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-function_002c-tangent_002c-inverse">hyperbolic function, tangent, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATANH">ATANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-sine">hyperbolic sine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SINH">SINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-hyperbolic-tangent">hyperbolic tangent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TANH">TANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-HYPOT"><code>HYPOT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#HYPOT">HYPOT</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-I">I</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-I_002fO-item-lists">I/O item lists</a>:</td><td>&nbsp;</td><td valign="top"><a href="#I_002fO-item-lists">I/O item lists</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IABS"><code>IABS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABS">ABS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IACHAR"><code>IACHAR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IACHAR">IACHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IAND"><code>IAND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IAND">IAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IARGC"><code>IARGC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IARGC">IARGC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IBCLR"><code>IBCLR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IBCLR">IBCLR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IBITS"><code>IBITS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IBITS">IBITS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IBSET"><code>IBSET</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IBSET">IBSET</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ICHAR"><code>ICHAR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ICHAR">ICHAR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IDATE"><code>IDATE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IDATE">IDATE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IDIM"><code>IDIM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#DIM">DIM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IDINT"><code>IDINT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT">INT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IDNINT"><code>IDNINT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#NINT">NINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IEEE_002c-ISNAN">IEEE, ISNAN</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ISNAN">ISNAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IEOR"><code>IEOR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IEOR">IEOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IERRNO"><code>IERRNO</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IERRNO">IERRNO</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IFIX"><code>IFIX</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT">INT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IMAG"><code>IMAG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#AIMAG">AIMAG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IMAGPART"><code>IMAGPART</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#AIMAG">AIMAG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IMPORT-statement"><code>IMPORT</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-INCLUDE-directive">INCLUDE directive</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-inclusion_002c-directory-search-paths-for">inclusion, directory search paths for</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-INDEX"><code>INDEX</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#INDEX-intrinsic">INDEX intrinsic</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-INT"><code>INT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT">INT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-INT2"><code>INT2</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT2">INT2</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-INT8"><code>INT8</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT8">INT8</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-integer-kind">integer kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fINT_005fKIND">SELECTED_INT_KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-intrinsic">intrinsic</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-intrinsic-Modules">intrinsic Modules</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Intrinsic-Modules">Intrinsic Modules</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-intrinsic-procedures">intrinsic procedures</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Intrinsic-Procedures">Intrinsic Procedures</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Introduction">Introduction</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Top">Top</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IOMSG_003d-specifier"><code>IOMSG=</code> specifier</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IOR"><code>IOR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IOR">IOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IOSTAT_002c-end-of-file">IOSTAT, end of file</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IS_005fIOSTAT_005fEND">IS_IOSTAT_END</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IOSTAT_002c-end-of-record">IOSTAT, end of record</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IS_005fIOSTAT_005fEOR">IS_IOSTAT_EOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IRAND"><code>IRAND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IRAND">IRAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ISATTY"><code>ISATTY</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ISATTY">ISATTY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ISHFT"><code>ISHFT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ISHFT">ISHFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ISHFTC"><code>ISHFTC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ISHFTC">ISHFTC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ISIGN"><code>ISIGN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIGN">SIGN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ISNAN"><code>ISNAN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ISNAN">ISNAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ISO-C-Bindings">ISO C Bindings</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ISO_005fFORTRAN_005fENV-statement"><code>ISO_FORTRAN_ENV</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IS_005fIOSTAT_005fEND"><code>IS_IOSTAT_END</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IS_005fIOSTAT_005fEND">IS_IOSTAT_END</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-IS_005fIOSTAT_005fEOR"><code>IS_IOSTAT_EOR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#IS_005fIOSTAT_005fEOR">IS_IOSTAT_EOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ITIME"><code>ITIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ITIME">ITIME</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-K">K</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-KILL"><code>KILL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#KILL">KILL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-KIND"><code>KIND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#KIND">KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-kind">kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#KIND-Type-Parameters">KIND Type Parameters</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-kind-1">kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#KIND">KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-kind_002c-character">kind, character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fCHAR_005fKIND">SELECTED_CHAR_KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-kind_002c-integer">kind, integer</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fINT_005fKIND">SELECTED_INT_KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-kind_002c-old_002dstyle">kind, old-style</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Old_002dstyle-kind-specifications">Old-style kind specifications</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-kind_002c-real">kind, real</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fREAL_005fKIND">SELECTED_REAL_KIND</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-L">L</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-language_002c-dialect-options">language, dialect options</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LBOUND"><code>LBOUND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LBOUND">LBOUND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LEADZ"><code>LEADZ</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LEADZ">LEADZ</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LEN"><code>LEN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LEN">LEN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LEN_005fTRIM"><code>LEN_TRIM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LEN_005fTRIM">LEN_TRIM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-lexical-comparison-of-strings">lexical comparison of strings</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LGE">LGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-lexical-comparison-of-strings-1">lexical comparison of strings</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LGT">LGT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-lexical-comparison-of-strings-2">lexical comparison of strings</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LLE">LLE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-lexical-comparison-of-strings-3">lexical comparison of strings</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LLT">LLT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LGAMMA"><code>LGAMMA</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG_005fGAMMA">LOG_GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LGE"><code>LGE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LGE">LGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LGT"><code>LGT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LGT">LGT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-libf2c-calling-convention">libf2c calling convention</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-libf2c-calling-convention-1">libf2c calling convention</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-limits_002c-largest-number">limits, largest number</a>:</td><td>&nbsp;</td><td valign="top"><a href="#HUGE">HUGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-limits_002c-smallest-number">limits, smallest number</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TINY">TINY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LINK"><code>LINK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LINK">LINK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-linking_002c-static">linking, static</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Link-Options">Link Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LLE"><code>LLE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LLE">LLE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LLT"><code>LLT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LLT">LLT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LNBLNK"><code>LNBLNK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LNBLNK">LNBLNK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LOC"><code>LOC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOC">LOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-location-of-a-variable-in-memory">location of a variable in memory</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOC">LOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LOG"><code>LOG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG">LOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LOG10"><code>LOG10</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG10">LOG10</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logarithmic-function">logarithmic function</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG">LOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logarithmic-function-1">logarithmic function</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG10">LOG10</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logarithmic-function_002c-inverse">logarithmic function, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXP">EXP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LOGICAL"><code>LOGICAL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOGICAL">LOGICAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logical-and_002c-bitwise">logical and, bitwise</a>:</td><td>&nbsp;</td><td valign="top"><a href="#AND">AND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logical-and_002c-bitwise-1">logical and, bitwise</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IAND">IAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logical-exclusive-or_002c-bitwise">logical exclusive or, bitwise</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IEOR">IEOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logical-exclusive-or_002c-bitwise-1">logical exclusive or, bitwise</a>:</td><td>&nbsp;</td><td valign="top"><a href="#XOR">XOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logical-not_002c-bitwise">logical not, bitwise</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NOT">NOT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logical-or_002c-bitwise">logical or, bitwise</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IOR">IOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logical-or_002c-bitwise-1">logical or, bitwise</a>:</td><td>&nbsp;</td><td valign="top"><a href="#OR">OR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-logical_002c-variable-representation">logical, variable representation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Internal-representation-of-LOGICAL-variables">Internal representation of LOGICAL variables</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-login-name">login name</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETLOG">GETLOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LOG_005fGAMMA"><code>LOG_GAMMA</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG_005fGAMMA">LOG_GAMMA</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LONG"><code>LONG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LONG">LONG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LSHIFT"><code>LSHIFT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LSHIFT">LSHIFT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LSTAT"><code>LSTAT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LSTAT">LSTAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-LTIME"><code>LTIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LTIME">LTIME</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-M">M</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-MALLOC"><code>MALLOC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MALLOC">MALLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MATMUL"><code>MATMUL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MATMUL">MATMUL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-matrix-multiplication">matrix multiplication</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MATMUL">MATMUL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-matrix_002c-transpose">matrix, transpose</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRANSPOSE">TRANSPOSE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MAX"><code>MAX</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAX">MAX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MAX0"><code>MAX0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAX">MAX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MAX1"><code>MAX1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAX">MAX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MAXEXPONENT"><code>MAXEXPONENT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAXEXPONENT">MAXEXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-maximum-value">maximum value</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAX">MAX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-maximum-value-1">maximum value</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAXVAL">MAXVAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MAXLOC"><code>MAXLOC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAXLOC">MAXLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MAXVAL"><code>MAXVAL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAXVAL">MAXVAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MCLOCK"><code>MCLOCK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MCLOCK">MCLOCK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MCLOCK8"><code>MCLOCK8</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MCLOCK8">MCLOCK8</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MERGE"><code>MERGE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MERGE">MERGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-messages_002c-error">messages, error</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-messages_002c-warning">messages, warning</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MIN"><code>MIN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MIN">MIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MIN0"><code>MIN0</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MIN">MIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MIN1"><code>MIN1</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MIN">MIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MINEXPONENT"><code>MINEXPONENT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MINEXPONENT">MINEXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-minimum-value">minimum value</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MIN">MIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-minimum-value-1">minimum value</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MINVAL">MINVAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MINLOC"><code>MINLOC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MINLOC">MINLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MINVAL"><code>MINVAL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MINVAL">MINVAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MOD"><code>MOD</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MOD">MOD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-base">model representation, base</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RADIX">RADIX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-epsilon">model representation, epsilon</a>:</td><td>&nbsp;</td><td valign="top"><a href="#EPSILON">EPSILON</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-largest-number">model representation, largest number</a>:</td><td>&nbsp;</td><td valign="top"><a href="#HUGE">HUGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-maximum-exponent">model representation, maximum exponent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MAXEXPONENT">MAXEXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-minimum-exponent">model representation, minimum exponent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MINEXPONENT">MINEXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-precision">model representation, precision</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PRECISION">PRECISION</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-radix">model representation, radix</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RADIX">RADIX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-range">model representation, range</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RANGE">RANGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-significant-digits">model representation, significant digits</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DIGITS">DIGITS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-model-representation_002c-smallest-number">model representation, smallest number</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TINY">TINY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-module-entities">module entities</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-module-search-path">module search path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-module-search-path-1">module search path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-module-search-path-2">module search path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MODULO"><code>MODULO</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MODULO">MODULO</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-modulo">modulo</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MODULO">MODULO</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MOVE_005fALLOC"><code>MOVE_ALLOC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MOVE_005fALLOC">MOVE_ALLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-moving-allocation">moving allocation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MOVE_005fALLOC">MOVE_ALLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-multiply-array-elements">multiply array elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PRODUCT">PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-MVBITS"><code>MVBITS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#MVBITS">MVBITS</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-N">N</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-Namelist">Namelist</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Extensions-to-namelist">Extensions to namelist</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-NEAREST"><code>NEAREST</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#NEAREST">NEAREST</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-newline">newline</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NEW_005fLINE">NEW_LINE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-NEW_005fLINE"><code>NEW_LINE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#NEW_005fLINE">NEW_LINE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-NINT"><code>NINT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#NINT">NINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-NOT"><code>NOT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#NOT">NOT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-NULL"><code>NULL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#NULL">NULL</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-O">O</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenMP">OpenMP</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OpenMP-1">OpenMP</a>:</td><td>&nbsp;</td><td valign="top"><a href="#OpenMP">OpenMP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-operators_002c-unary">operators, unary</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Unary-operators">Unary operators</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-code-generation">options, code generation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-debugging">options, debugging</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-dialect">options, dialect</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-directory-search">options, directory search</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-errors">options, errors</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-fortran-dialect">options, fortran dialect</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-gfortran-command">options, <code>gfortran</code> command</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Invoking-GNU-Fortran">Invoking GNU Fortran</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-linking">options, linking</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Link-Options">Link Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-negative-forms">options, negative forms</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Invoking-GNU-Fortran">Invoking GNU Fortran</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-preprocessor">options, preprocessor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-run_002dtime">options, run-time</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-runtime">options, runtime</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Runtime-Options">Runtime Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-options_002c-warnings">options, warnings</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-OR"><code>OR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#OR">OR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-output_002c-newline">output, newline</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NEW_005fLINE">NEW_LINE</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-P">P</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-PACK"><code>PACK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#PACK">PACK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-paths_002c-search">paths, search</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-paths_002c-search-1">paths, search</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-paths_002c-search-2">paths, search</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-PERROR"><code>PERROR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#PERROR">PERROR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-C-address-of-pointers">pointer, C address of pointers</a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fF_005fPROCPOINTER">C_F_PROCPOINTER</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-C-address-of-procedures">pointer, C address of procedures</a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fFUNLOC">C_FUNLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-C-association-status">pointer, C association status</a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fASSOCIATED">C_ASSOCIATED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-convert-C-to-Fortran">pointer, convert C to Fortran</a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fF_005fPOINTER">C_F_POINTER</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-Cray">pointer, Cray</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Cray-pointers">Cray pointers</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-cray">pointer, cray</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FREE">FREE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-cray-1">pointer, cray</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MALLOC">MALLOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-disassociated">pointer, disassociated</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NULL">NULL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-status">pointer, status</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASSOCIATED">ASSOCIATED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-pointer_002c-status-1">pointer, status</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NULL">NULL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-positive-difference">positive difference</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DIM">DIM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-PRECISION"><code>PRECISION</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#PRECISION">PRECISION</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Preprocessing">Preprocessing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-and-conditional-compilation">Preprocessing and conditional compilation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-assertation">preprocessing, assertation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-assertation-1">preprocessing, assertation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-define-macros">preprocessing, define macros</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-define-macros-1">preprocessing, define macros</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-include-path">preprocessing, include path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-include-path-1">preprocessing, include path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-include-path-2">preprocessing, include path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-include-path-3">preprocessing, include path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-include-path-4">preprocessing, include path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-include-path-5">preprocessing, include path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-keep-comments">preprocessing, keep comments</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-keep-comments-1">preprocessing, keep comments</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-no-linemarkers">preprocessing, no linemarkers</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessing_002c-undefine-macros">preprocessing, undefine macros</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor">preprocessor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-debugging">preprocessor, debugging</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-debugging-1">preprocessor, debugging</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-debugging-2">preprocessor, debugging</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-debugging-3">preprocessor, debugging</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-debugging-4">preprocessor, debugging</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-disable">preprocessor, disable</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-enable">preprocessor, enable</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-include-file-handling">preprocessor, include file handling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-and-conditional-compilation">Preprocessing and conditional compilation</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-preprocessor_002c-working-directory">preprocessor, working directory</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Preprocessing-Options">Preprocessing Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-PRESENT"><code>PRESENT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#PRESENT">PRESENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-private">private</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-procedure-pointer_002c-convert-C-to-Fortran">procedure pointer, convert C to Fortran</a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fLOC">C_LOC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-process-id">process id</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETPID">GETPID</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-PRODUCT"><code>PRODUCT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#PRODUCT">PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-product_002c-double_002dprecision">product, double-precision</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DPROD">DPROD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-product_002c-matrix">product, matrix</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MATMUL">MATMUL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-product_002c-vector">product, vector</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DOT_005fPRODUCT">DOT_PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-program-termination">program termination</a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXIT">EXIT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-program-termination_002c-with-core-dump">program termination, with core dump</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABORT">ABORT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-PROTECTED-statement"><code>PROTECTED</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-R">R</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-RADIX"><code>RADIX</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RADIX">RADIX</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RAN"><code>RAN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RAN">RAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RAND"><code>RAND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RAND">RAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-random-number-generation">random number generation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IRAND">IRAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-random-number-generation-1">random number generation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RAN">RAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-random-number-generation-2">random number generation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RAND">RAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-random-number-generation-3">random number generation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RANDOM_005fNUMBER">RANDOM_NUMBER</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-random-number-generation_002c-seeding">random number generation, seeding</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RANDOM_005fSEED">RANDOM_SEED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-random-number-generation_002c-seeding-1">random number generation, seeding</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SRAND">SRAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RANDOM_005fNUMBER"><code>RANDOM_NUMBER</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RANDOM_005fNUMBER">RANDOM_NUMBER</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RANDOM_005fSEED"><code>RANDOM_SEED</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RANDOM_005fSEED">RANDOM_SEED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RANGE"><code>RANGE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RANGE">RANGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-range-checking">range checking</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-read-character_002c-stream-mode">read character, stream mode</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FGET">FGET</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-read-character_002c-stream-mode-1">read character, stream mode</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FGETC">FGETC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-REAL"><code>REAL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#REAL">REAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-real-kind">real kind</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fREAL_005fKIND">SELECTED_REAL_KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-real-number_002c-exponent">real number, exponent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXPONENT">EXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-real-number_002c-fraction">real number, fraction</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FRACTION">FRACTION</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-real-number_002c-nearest-different">real number, nearest different</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NEAREST">NEAREST</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-real-number_002c-relative-spacing">real number, relative spacing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RRSPACING">RRSPACING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-real-number_002c-relative-spacing-1">real number, relative spacing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SPACING">SPACING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-real-number_002c-scale">real number, scale</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SCALE">SCALE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-real-number_002c-set-exponent">real number, set exponent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SET_005fEXPONENT">SET_EXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-REALPART"><code>REALPART</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#REAL">REAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RECORD"><code>RECORD</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#STRUCTURE-and-RECORD">STRUCTURE and RECORD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-remainder">remainder</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MOD">MOD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RENAME"><code>RENAME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RENAME">RENAME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-repacking-arrays">repacking arrays</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-REPEAT"><code>REPEAT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#REPEAT">REPEAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RESHAPE"><code>RESHAPE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RESHAPE">RESHAPE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-root">root</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SQRT">SQRT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-rounding_002c-ceiling">rounding, ceiling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ANINT">ANINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-rounding_002c-ceiling-1">rounding, ceiling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CEILING">CEILING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-rounding_002c-floor">rounding, floor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#AINT">AINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-rounding_002c-floor-1">rounding, floor</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FLOOR">FLOOR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-rounding_002c-nearest-whole-number">rounding, nearest whole number</a>:</td><td>&nbsp;</td><td valign="top"><a href="#NINT">NINT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RRSPACING"><code>RRSPACING</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RRSPACING">RRSPACING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-RSHIFT"><code>RSHIFT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#RSHIFT">RSHIFT</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-S">S</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-SAVE-statement"><code>SAVE</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SCALE"><code>SCALE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SCALE">SCALE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SCAN"><code>SCAN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SCAN">SCAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-search-path">search path</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-search-paths_002c-for-included-files">search paths, for included files</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Directory-Options">Directory Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SECNDS"><code>SECNDS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SECNDS">SECNDS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SECOND"><code>SECOND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SECOND">SECOND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-seeding-a-random-number-generator">seeding a random number generator</a>:</td><td>&nbsp;</td><td valign="top"><a href="#RANDOM_005fSEED">RANDOM_SEED</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-seeding-a-random-number-generator-1">seeding a random number generator</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SRAND">SRAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SELECTED_005fCHAR_005fKIND"><code>SELECTED_CHAR_KIND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fCHAR_005fKIND">SELECTED_CHAR_KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SELECTED_005fINT_005fKIND"><code>SELECTED_INT_KIND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fINT_005fKIND">SELECTED_INT_KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SELECTED_005fREAL_005fKIND"><code>SELECTED_REAL_KIND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SELECTED_005fREAL_005fKIND">SELECTED_REAL_KIND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SET_005fEXPONENT"><code>SET_EXPONENT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SET_005fEXPONENT">SET_EXPONENT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SHAPE"><code>SHAPE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SHAPE">SHAPE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SHORT"><code>SHORT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#INT2">INT2</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SIGN"><code>SIGN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIGN">SIGN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-sign-copying">sign copying</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIGN">SIGN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SIGNAL"><code>SIGNAL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIGNAL">SIGNAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SIN"><code>SIN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIN">SIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-sine">sine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIN">SIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-sine_002c-hyperbolic">sine, hyperbolic</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SINH">SINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-sine_002c-hyperbolic_002c-inverse">sine, hyperbolic, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASINH">ASINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-sine_002c-inverse">sine, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASIN">ASIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SINH"><code>SINH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SINH">SINH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SIZE"><code>SIZE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIZE">SIZE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-size-of-a-variable_002c-in-bits">size of a variable, in bits</a>:</td><td>&nbsp;</td><td valign="top"><a href="#BIT_005fSIZE">BIT_SIZE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-size-of-an-expression">size of an expression</a>:</td><td>&nbsp;</td><td valign="top"><a href="#C_005fSIZEOF">C_SIZEOF</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-size-of-an-expression-1">size of an expression</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIZEOF">SIZEOF</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SIZEOF"><code>SIZEOF</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIZEOF">SIZEOF</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SLEEP"><code>SLEEP</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SLEEP">SLEEP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SNGL"><code>SNGL</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SNGL">SNGL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SPACING"><code>SPACING</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SPACING">SPACING</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SPREAD"><code>SPREAD</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SPREAD">SPREAD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SQRT"><code>SQRT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SQRT">SQRT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-square_002droot">square-root</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SQRT">SQRT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SRAND"><code>SRAND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SRAND">SRAND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-Standards">Standards</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Standards">Standards</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-STAT"><code>STAT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#STAT">STAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-ENUM">statement, <code>ENUM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-ENUMERATOR">statement, <code>ENUMERATOR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-FLUSH">statement, <code>FLUSH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-IMPORT">statement, <code>IMPORT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-ISO_005fFORTRAN_005fENV">statement, <code>ISO_FORTRAN_ENV</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-PROTECTED">statement, <code>PROTECTED</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-SAVE">statement, <code>SAVE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-USE_002c-INTRINSIC">statement, <code>USE, INTRINSIC</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-VALUE">statement, <code>VALUE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-statement_002c-VOLATILE">statement, <code>VOLATILE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-STREAM-I_002fO"><code>STREAM</code> I/O</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-stream-mode_002c-read-character">stream mode, read character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FGET">FGET</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-stream-mode_002c-read-character-1">stream mode, read character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FGETC">FGETC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-stream-mode_002c-write-character">stream mode, write character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FPUT">FPUT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-stream-mode_002c-write-character-1">stream mode, write character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FPUTC">FPUTC</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-adjust-left">string, adjust left</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ADJUSTL">ADJUSTL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-adjust-right">string, adjust right</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ADJUSTR">ADJUSTR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-comparison">string, comparison</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LGE">LGE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-comparison-1">string, comparison</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LGT">LGT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-comparison-2">string, comparison</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LLE">LLE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-comparison-3">string, comparison</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LLT">LLT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-concatenate">string, concatenate</a>:</td><td>&nbsp;</td><td valign="top"><a href="#REPEAT">REPEAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-find-missing-set">string, find missing set</a>:</td><td>&nbsp;</td><td valign="top"><a href="#VERIFY">VERIFY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-find-non_002dblank-character">string, find non-blank character</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LNBLNK">LNBLNK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-find-subset">string, find subset</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SCAN">SCAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-find-substring">string, find substring</a>:</td><td>&nbsp;</td><td valign="top"><a href="#INDEX-intrinsic">INDEX intrinsic</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-length">string, length</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LEN">LEN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-length_002c-without-trailing-whitespace">string, length, without trailing whitespace</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LEN_005fTRIM">LEN_TRIM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-remove-trailing-whitespace">string, remove trailing whitespace</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRIM">TRIM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-string_002c-repeat">string, repeat</a>:</td><td>&nbsp;</td><td valign="top"><a href="#REPEAT">REPEAT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-STRUCTURE"><code>STRUCTURE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#STRUCTURE-and-RECORD">STRUCTURE and RECORD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-structure-packing">structure packing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-subscript-checking">subscript checking</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-substring-position">substring position</a>:</td><td>&nbsp;</td><td valign="top"><a href="#INDEX-intrinsic">INDEX intrinsic</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SUM"><code>SUM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SUM">SUM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-sum-array-elements">sum array elements</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SUM">SUM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-suppressing-warnings">suppressing warnings</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-symbol-names">symbol names</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-Dialect-Options">Fortran Dialect Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-symbol-names_002c-transforming">symbol names, transforming</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-symbol-names_002c-transforming-1">symbol names, transforming</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-symbol-names_002c-underscores">symbol names, underscores</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-symbol-names_002c-underscores-1">symbol names, underscores</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SYMLNK"><code>SYMLNK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SYMLNK">SYMLNK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-syntax-checking">syntax checking</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SYSTEM"><code>SYSTEM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SYSTEM">SYSTEM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-error-handling">system, error handling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GERROR">GERROR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-error-handling-1">system, error handling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#IERRNO">IERRNO</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-error-handling-2">system, error handling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#PERROR">PERROR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-group-id">system, group id</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETGID">GETGID</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-host-name">system, host name</a>:</td><td>&nbsp;</td><td valign="top"><a href="#HOSTNM">HOSTNM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-login-name">system, login name</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETLOG">GETLOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-process-id">system, process id</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETPID">GETPID</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-signal-handling">system, signal handling</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIGNAL">SIGNAL</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-system-call">system, system call</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SYSTEM">SYSTEM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-terminal">system, terminal</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ISATTY">ISATTY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-terminal-1">system, terminal</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TTYNAM">TTYNAM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-user-id">system, user id</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETUID">GETUID</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-working-directory">system, working directory</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CHDIR">CHDIR</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-system_002c-working-directory-1">system, working directory</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETCWD">GETCWD</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-SYSTEM_005fCLOCK"><code>SYSTEM_CLOCK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SYSTEM_005fCLOCK">SYSTEM_CLOCK</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-T">T</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-tabulators">tabulators</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TAN"><code>TAN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TAN">TAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-tangent">tangent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TAN">TAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-tangent_002c-hyperbolic">tangent, hyperbolic</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TANH">TANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-tangent_002c-hyperbolic_002c-inverse">tangent, hyperbolic, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATANH">ATANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-tangent_002c-inverse">tangent, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATAN">ATAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-tangent_002c-inverse-1">tangent, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATAN2">ATAN2</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TANH"><code>TANH</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TANH">TANH</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-terminate-program">terminate program</a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXIT">EXIT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-terminate-program_002c-with-core-dump">terminate program, with core dump</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABORT">ABORT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TIME"><code>TIME</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TIME">TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-clock-ticks">time, clock ticks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MCLOCK">MCLOCK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-clock-ticks-1">time, clock ticks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#MCLOCK8">MCLOCK8</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-clock-ticks-2">time, clock ticks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SYSTEM_005fCLOCK">SYSTEM_CLOCK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-conversion-to-GMT-info">time, conversion to GMT info</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GMTIME">GMTIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-conversion-to-local-time-info">time, conversion to local time info</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LTIME">LTIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-conversion-to-string">time, conversion to string</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CTIME">CTIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-current">time, current</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DATE_005fAND_005fTIME">DATE_AND_TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-current-1">time, current</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FDATE">FDATE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-current-2">time, current</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ITIME">ITIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-current-3">time, current</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TIME">TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-current-4">time, current</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TIME8">TIME8</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-elapsed">time, elapsed</a>:</td><td>&nbsp;</td><td valign="top"><a href="#CPU_005fTIME">CPU_TIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-elapsed-1">time, elapsed</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DTIME">DTIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-elapsed-2">time, elapsed</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ETIME">ETIME</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-elapsed-3">time, elapsed</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SECNDS">SECNDS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-time_002c-elapsed-4">time, elapsed</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SECOND">SECOND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TIME8"><code>TIME8</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TIME8">TIME8</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TINY"><code>TINY</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TINY">TINY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TR-15581">TR 15581</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trace">trace</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Debugging-Options">Debugging Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TRAILZ"><code>TRAILZ</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRAILZ">TRAILZ</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TRANSFER"><code>TRANSFER</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRANSFER">TRANSFER</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-transforming-symbol-names">transforming symbol names</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-transforming-symbol-names-1">transforming symbol names</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TRANSPOSE"><code>TRANSPOSE</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRANSPOSE">TRANSPOSE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-transpose">transpose</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRANSPOSE">TRANSPOSE</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trigonometric-function_002c-cosine">trigonometric function, cosine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#COS">COS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trigonometric-function_002c-cosine_002c-inverse">trigonometric function, cosine, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ACOS">ACOS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trigonometric-function_002c-sine">trigonometric function, sine</a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIN">SIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trigonometric-function_002c-sine_002c-inverse">trigonometric function, sine, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ASIN">ASIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trigonometric-function_002c-tangent">trigonometric function, tangent</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TAN">TAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trigonometric-function_002c-tangent_002c-inverse">trigonometric function, tangent, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATAN">ATAN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-trigonometric-function_002c-tangent_002c-inverse-1">trigonometric function, tangent, inverse</a>:</td><td>&nbsp;</td><td valign="top"><a href="#ATAN2">ATAN2</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TRIM"><code>TRIM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRIM">TRIM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-TTYNAM"><code>TTYNAM</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#TTYNAM">TTYNAM</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-type-cast">type cast</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRANSFER">TRANSFER</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-U">U</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-UBOUND"><code>UBOUND</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#UBOUND">UBOUND</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UMASK"><code>UMASK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#UMASK">UMASK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-underflow">underflow</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-underscore">underscore</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-underscore-1">underscore</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Code-Gen-Options">Code Gen Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UNLINK"><code>UNLINK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#UNLINK">UNLINK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-UNPACK"><code>UNPACK</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#UNPACK">UNPACK</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-unused-parameter">unused parameter</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-USE_002c-INTRINSIC-statement"><code>USE, INTRINSIC</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-user-id">user id</a>:</td><td>&nbsp;</td><td valign="top"><a href="#GETUID">GETUID</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-V">V</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-VALUE-statement"><code>VALUE</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-vector-product">vector product</a>:</td><td>&nbsp;</td><td valign="top"><a href="#DOT_005fPRODUCT">DOT_PRODUCT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-VERIFY"><code>VERIFY</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#VERIFY">VERIFY</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-VOLATILE-statement"><code>VOLATILE</code> statement</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Fortran-2003-status">Fortran 2003 status</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-W">W</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-aliasing">warnings, aliasing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-alignment-of-COMMON-blocks">warnings, alignment of COMMON blocks</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-all">warnings, all</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-ampersand">warnings, ampersand</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-array-temporaries">warnings, array temporaries</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-character-truncation">warnings, character truncation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-conversion">warnings, conversion</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-implicit-interface">warnings, implicit interface</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-intrinsic">warnings, intrinsic</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-intrinsics-of-other-standards">warnings, intrinsics of other standards</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-line-truncation">warnings, line truncation</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-non_002dstandard-intrinsics">warnings, non-standard intrinsics</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-suppressing">warnings, suppressing</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-suspicious-code">warnings, suspicious code</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-tabs">warnings, tabs</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-to-errors">warnings, to errors</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-underflow">warnings, underflow</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-warnings_002c-unused-parameter">warnings, unused parameter</a>:</td><td>&nbsp;</td><td valign="top"><a href="#Error-and-Warning-Options">Error and Warning Options</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-write-character_002c-stream-mode">write character, stream mode</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FPUT">FPUT</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-write-character_002c-stream-mode-1">write character, stream mode</a>:</td><td>&nbsp;</td><td valign="top"><a href="#FPUTC">FPUTC</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-X">X</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-XOR"><code>XOR</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#XOR">XOR</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
<tr><th><a name="Keyword-Index_cp_letter-Z">Z</a></th><td></td><td></td></tr>
<tr><td></td><td valign="top"><a href="#index-ZABS"><code>ZABS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#ABS">ABS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ZCOS"><code>ZCOS</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#COS">COS</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-zero-bits">zero bits</a>:</td><td>&nbsp;</td><td valign="top"><a href="#LEADZ">LEADZ</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-zero-bits-1">zero bits</a>:</td><td>&nbsp;</td><td valign="top"><a href="#TRAILZ">TRAILZ</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ZEXP"><code>ZEXP</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#EXP">EXP</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ZLOG"><code>ZLOG</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#LOG">LOG</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ZSIN"><code>ZSIN</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SIN">SIN</a></td></tr>
<tr><td></td><td valign="top"><a href="#index-ZSQRT"><code>ZSQRT</code></a>:</td><td>&nbsp;</td><td valign="top"><a href="#SQRT">SQRT</a></td></tr>
<tr><td colspan="4"> <hr></td></tr>
</table>
<table><tr><th valign="top">Jump to: &nbsp; </th><td><a class="summary-letter" href="#Keyword-Index_cp_symbol-1"><b>$</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_symbol-2"><b>%</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_symbol-3"><b>&amp;</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_symbol-4"><b>[</b></a>
 &nbsp; 
<br>
<a class="summary-letter" href="#Keyword-Index_cp_letter-A"><b>A</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-B"><b>B</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-C"><b>C</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-D"><b>D</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-E"><b>E</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-F"><b>F</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-G"><b>G</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-H"><b>H</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-I"><b>I</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-K"><b>K</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-L"><b>L</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-M"><b>M</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-N"><b>N</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-O"><b>O</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-P"><b>P</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-R"><b>R</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-S"><b>S</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-T"><b>T</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-U"><b>U</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-V"><b>V</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-W"><b>W</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-X"><b>X</b></a>
 &nbsp; 
<a class="summary-letter" href="#Keyword-Index_cp_letter-Z"><b>Z</b></a>
 &nbsp; 
</td></tr></table>

<hr>



</body>
</html>