DragonFlyBSD Kernel Audit
sys/netinet/ip_input.c
← back
   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
/*
 * Copyright (c) 2003, 2004 Jeffrey M. Hsu.  All rights reserved.
 * Copyright (c) 2003, 2004 The DragonFly Project.  All rights reserved.
 *
 * This code is derived from software contributed to The DragonFly Project
 * by Jeffrey M. Hsu.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of The DragonFly Project nor the names of its
 *    contributors may be used to endorse or promote products derived
 *    from this software without specific, prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

/*
 * Copyright (c) 1982, 1986, 1988, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)ip_input.c	8.2 (Berkeley) 1/4/94
 * $FreeBSD: src/sys/netinet/ip_input.c,v 1.130.2.52 2003/03/07 07:01:28 silby Exp $
 */

#define	_IP_VHL

#include "opt_bootp.h"
#include "opt_ipdn.h"
#include "opt_ipdivert.h"
#include "opt_ipstealth.h"
#include "opt_rss.h"

#include <sys/param.h>
#include <sys/systm.h>
#include <sys/mbuf.h>
#include <sys/malloc.h>
#include <sys/mpipe.h>
#include <sys/domain.h>
#include <sys/protosw.h>
#include <sys/socket.h>
#include <sys/time.h>
#include <sys/globaldata.h>
#include <sys/thread.h>
#include <sys/kernel.h>
#include <sys/syslog.h>
#include <sys/sysctl.h>
#include <sys/in_cksum.h>
#include <sys/lock.h>

#include <sys/mplock2.h>

#include <machine/stdarg.h>

#include <net/if.h>
#include <net/if_types.h>
#include <net/if_var.h>
#include <net/if_dl.h>
#include <net/pfil.h>
#include <net/route.h>
#include <net/netisr2.h>

#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/in_var.h>
#include <netinet/ip.h>
#include <netinet/in_pcb.h>
#include <netinet/ip_var.h>
#include <netinet/ip_icmp.h>
#include <netinet/ip_divert.h>
#include <netinet/ip_flow.h>

#include <sys/thread2.h>
#include <sys/msgport2.h>
#include <net/netmsg2.h>

#include <sys/socketvar.h>

#include <net/ipfw/ip_fw.h>
#include <net/dummynet/ip_dummynet.h>

__read_mostly int rsvp_on = 0;
__read_mostly static int ip_rsvp_on;
struct socket *ip_rsvpd;

__read_mostly int ipforwarding = 0;
SYSCTL_INT(_net_inet_ip, IPCTL_FORWARDING, forwarding, CTLFLAG_RW,
    &ipforwarding, 0, "Enable IP forwarding between interfaces");

__read_mostly static int ipsendredirects = 1; /* XXX */
SYSCTL_INT(_net_inet_ip, IPCTL_SENDREDIRECTS, redirect, CTLFLAG_RW,
    &ipsendredirects, 0, "Enable sending IP redirects");

__read_mostly int ip_defttl = IPDEFTTL;
SYSCTL_INT(_net_inet_ip, IPCTL_DEFTTL, ttl, CTLFLAG_RW,
    &ip_defttl, 0, "Maximum TTL on IP packets");

__read_mostly static int ip_dosourceroute = 0;
SYSCTL_INT(_net_inet_ip, IPCTL_SOURCEROUTE, sourceroute, CTLFLAG_RW,
    &ip_dosourceroute, 0, "Enable forwarding source routed IP packets");

__read_mostly static int ip_acceptsourceroute = 0;
SYSCTL_INT(_net_inet_ip, IPCTL_ACCEPTSOURCEROUTE, accept_sourceroute,
    CTLFLAG_RW, &ip_acceptsourceroute, 0,
    "Enable accepting source routed IP packets");

__read_mostly static int maxnipq;
SYSCTL_INT(_net_inet_ip, OID_AUTO, maxfragpackets, CTLFLAG_RW,
    &maxnipq, 0,
    "Maximum number of IPv4 fragment reassembly queue entries");

__read_mostly static int maxfragsperpacket;
SYSCTL_INT(_net_inet_ip, OID_AUTO, maxfragsperpacket, CTLFLAG_RW,
    &maxfragsperpacket, 0,
    "Maximum number of IPv4 fragments allowed per packet");

__read_mostly static int ip_sendsourcequench = 0;
SYSCTL_INT(_net_inet_ip, OID_AUTO, sendsourcequench, CTLFLAG_RW,
    &ip_sendsourcequench, 0,
    "Enable the transmission of source quench packets");

__read_mostly int ip_do_randomid = 1;
SYSCTL_INT(_net_inet_ip, OID_AUTO, random_id, CTLFLAG_RW,
    &ip_do_randomid, 0,
    "Assign random ip_id values");
/*
 * XXX - Setting ip_checkinterface mostly implements the receive side of
 * the Strong ES model described in RFC 1122, but since the routing table
 * and transmit implementation do not implement the Strong ES model,
 * setting this to 1 results in an odd hybrid.
 *
 * XXX - ip_checkinterface currently must be disabled if you use ipnat
 * to translate the destination address to another local interface.
 *
 * XXX - ip_checkinterface must be disabled if you add IP aliases
 * to the loopback interface instead of the interface where the
 * packets for those addresses are received.
 */
__read_mostly static int ip_checkinterface = 0;
SYSCTL_INT(_net_inet_ip, OID_AUTO, check_interface, CTLFLAG_RW,
    &ip_checkinterface, 0, "Verify packet arrives on correct interface");

#ifdef RSS_DEBUG
static u_long ip_rehash_count = 0;
SYSCTL_ULONG(_net_inet_ip, OID_AUTO, rehash_count, CTLFLAG_RD,
    &ip_rehash_count, 0, "Number of packets rehashed by IP");

static u_long ip_dispatch_fast = 0;
SYSCTL_ULONG(_net_inet_ip, OID_AUTO, dispatch_fast_count, CTLFLAG_RD,
    &ip_dispatch_fast, 0, "Number of packets handled on current CPU");

static u_long ip_dispatch_slow = 0;
SYSCTL_ULONG(_net_inet_ip, OID_AUTO, dispatch_slow_count, CTLFLAG_RD,
    &ip_dispatch_slow, 0, "Number of packets messaged to another CPU");
#endif

#ifdef DIAGNOSTIC
static int ipprintfs = 0;
#endif

extern	struct domain inetdomain;
extern	struct protosw inetsw[];
u_char	ip_protox[IPPROTO_MAX];
struct	in_ifaddrhead in_ifaddrheads[MAXCPU];	/* first inet address */
struct	in_ifaddrhashhead *in_ifaddrhashtbls[MAXCPU];
						/* inet addr hash table */
__read_mostly u_long	in_ifaddrhmask;		/* mask for hash table */

static struct mbuf *ipforward_mtemp[MAXCPU];

struct ip_stats ipstats_percpu[MAXCPU] __cachealign;

static int
sysctl_ipstats(SYSCTL_HANDLER_ARGS)
{
	int cpu, error = 0;

	for (cpu = 0; cpu < netisr_ncpus; ++cpu) {
		if ((error = SYSCTL_OUT(req, &ipstats_percpu[cpu],
					sizeof(struct ip_stats))))
			break;
		if ((error = SYSCTL_IN(req, &ipstats_percpu[cpu],
				       sizeof(struct ip_stats))))
			break;
	}

	return (error);
}
SYSCTL_PROC(_net_inet_ip, IPCTL_STATS, stats, (CTLTYPE_OPAQUE | CTLFLAG_RW),
    0, 0, sysctl_ipstats, "S,ip_stats", "IP statistics");

/* Packet reassembly stuff */
#define	IPREASS_NHASH_LOG2	6
#define	IPREASS_NHASH		(1 << IPREASS_NHASH_LOG2)
#define	IPREASS_HMASK		(IPREASS_NHASH - 1)
#define	IPREASS_HASH(x,y)						\
    (((((x) & 0xF) | ((((x) >> 8) & 0xF) << 4)) ^ (y)) & IPREASS_HMASK)

TAILQ_HEAD(ipqhead, ipq);
struct ipfrag_queue {
	int			nipq;
	volatile int		draining;
	struct netmsg_base	timeo_netmsg;
	struct callout		timeo_ch;
	struct netmsg_base	drain_netmsg;
	struct ipqhead		ipq[IPREASS_NHASH];
} __cachealign;

static struct ipfrag_queue	ipfrag_queue_pcpu[MAXCPU];

#ifdef IPCTL_DEFMTU
SYSCTL_INT(_net_inet_ip, IPCTL_DEFMTU, mtu, CTLFLAG_RW,
    &ip_mtu, 0, "Default MTU");
#endif

#ifdef IPSTEALTH
static int ipstealth = 0;
SYSCTL_INT(_net_inet_ip, OID_AUTO, stealth, CTLFLAG_RW, &ipstealth, 0, "");
#else
static const int ipstealth = 0;
#endif

struct mbuf *(*ip_divert_p)(struct mbuf *, int, int);

struct pfil_head inet_pfil_hook;

/*
 * struct ip_srcrt_opt is used to store packet state while it travels
 * through the stack.
 *
 * XXX Note that the code even makes assumptions on the size and
 * alignment of fields inside struct ip_srcrt so e.g. adding some
 * fields will break the code.  This needs to be fixed.
 *
 * We need to save the IP options in case a protocol wants to respond
 * to an incoming packet over the same route if the packet got here
 * using IP source routing.  This allows connection establishment and
 * maintenance when the remote end is on a network that is not known
 * to us.
 */
struct ip_srcrt {
	struct	in_addr dst;			/* final destination */
	char	nop;				/* one NOP to align */
	char	srcopt[IPOPT_OFFSET + 1];	/* OPTVAL, OLEN and OFFSET */
	struct	in_addr route[MAX_IPOPTLEN/sizeof(struct in_addr)];
};

struct ip_srcrt_opt {
	int		ip_nhops;
	struct ip_srcrt	ip_srcrt;
};

#define IPFRAG_MPIPE_MAX	4096
#define MAXIPFRAG_MIN		((IPFRAG_MPIPE_MAX * 2) / 256)

#define IPFRAG_TIMEO		(hz / PR_SLOWHZ)

static MALLOC_DEFINE(M_IPQ, "ipq", "IP Fragment Management");
static struct malloc_pipe ipq_mpipe;

static void		save_rte(struct mbuf *, u_char *, struct in_addr);
static int		ip_dooptions(struct mbuf *m, int, struct sockaddr_in *);
static void		ip_freef(struct ipfrag_queue *, struct ipqhead *,
			    struct ipq *);
static void		ip_input_handler(netmsg_t);
static void		ip_forward_redispatch(struct lwkt_port *port,
			    struct mbuf *m, boolean_t srcrt);

static void		ipfrag_timeo_dispatch(netmsg_t);
static void		ipfrag_timeo(void *);
static void		ipfrag_drain_dispatch(netmsg_t);

/*
 * IP initialization: fill in IP protocol switch table.
 * All protocols not implemented in kernel go to raw IP protocol handler.
 */
void
ip_init(void)
{
	struct ipfrag_queue *fragq;
	struct protosw *pr;
	int cpu, i;

	/*
	 * Make sure we can handle a reasonable number of fragments but
	 * cap it at IPFRAG_MPIPE_MAX.
	 */
	mpipe_init(&ipq_mpipe, M_IPQ, sizeof(struct ipq),
	    IFQ_MAXLEN, IPFRAG_MPIPE_MAX, 0, NULL, NULL, NULL);

	/*
	 * Make in_ifaddrhead and in_ifaddrhashtbl available on all CPUs,
	 * since they could be accessed by any threads.
	 */
	for (cpu = 0; cpu < ncpus; ++cpu) {
		TAILQ_INIT(&in_ifaddrheads[cpu]);
		in_ifaddrhashtbls[cpu] =
		    hashinit(INADDR_NHASH, M_IFADDR, &in_ifaddrhmask);
	}

	pr = pffindproto(PF_INET, IPPROTO_RAW, SOCK_RAW);
	if (pr == NULL)
		panic("ip_init");
	for (i = 0; i < IPPROTO_MAX; i++)
		ip_protox[i] = pr - inetsw;
	for (pr = inetdomain.dom_protosw;
	     pr < inetdomain.dom_protoswNPROTOSW; pr++) {
		if (pr->pr_domain->dom_family == PF_INET && pr->pr_protocol) {
			if (pr->pr_protocol != IPPROTO_RAW)
				ip_protox[pr->pr_protocol] = pr - inetsw;
		}
	}

	inet_pfil_hook.ph_type = PFIL_TYPE_AF;
	inet_pfil_hook.ph_af = AF_INET;
	if ((i = pfil_head_register(&inet_pfil_hook)) != 0) {
		kprintf("%s: WARNING: unable to register pfil hook, "
			"error %d\n", __func__, i);
	}

	maxnipq = (nmbclusters / 32) / netisr_ncpus;
	if (maxnipq < MAXIPFRAG_MIN)
		maxnipq = MAXIPFRAG_MIN;
	maxfragsperpacket = 16;

	ip_id = time_second & 0xffff;	/* time_second survives reboots */

	for (cpu = 0; cpu < netisr_ncpus; ++cpu) {
		/*
		 * Initialize IP statistics counters for each CPU.
		 */
		bzero(&ipstats_percpu[cpu], sizeof(struct ip_stats));

		/*
		 * Preallocate mbuf template for forwarding
		 */
		MGETHDR(ipforward_mtemp[cpu], M_WAITOK, MT_DATA);

		/*
		 * Initialize per-cpu ip fragments queues
		 */
		fragq = &ipfrag_queue_pcpu[cpu];
		for (i = 0; i < IPREASS_NHASH; i++)
			TAILQ_INIT(&fragq->ipq[i]);

		callout_init_mp(&fragq->timeo_ch);
		netmsg_init(&fragq->timeo_netmsg, NULL, &netisr_adone_rport,
			    MSGF_PRIORITY, ipfrag_timeo_dispatch);
		netmsg_init(&fragq->drain_netmsg, NULL, &netisr_adone_rport,
			    MSGF_PRIORITY, ipfrag_drain_dispatch);
	}

	netisr_register(NETISR_IP, ip_input_handler, ip_hashfn);
	netisr_register_hashcheck(NETISR_IP, ip_hashcheck);

	for (cpu = 0; cpu < netisr_ncpus; ++cpu) {
		fragq = &ipfrag_queue_pcpu[cpu];
		callout_reset_bycpu(&fragq->timeo_ch, IPFRAG_TIMEO,
				    ipfrag_timeo, NULL, cpu);
	}

	ip_porthash_trycount = 2 * netisr_ncpus;
}

/* Do transport protocol processing. */
static void
transport_processing_oncpu(struct mbuf *m, int hlen, struct ip *ip)
{
	const struct protosw *pr = &inetsw[ip_protox[ip->ip_p]];

	/*
	 * Switch out to protocol's input routine.
	 */
	PR_GET_MPLOCK(pr);
	pr->pr_input(&m, &hlen, ip->ip_p);
	PR_REL_MPLOCK(pr);
}

static void
transport_processing_handler(netmsg_t msg)
{
	struct netmsg_packet *pmsg = &msg->packet;
	struct ip *ip;
	int hlen;

	ip = mtod(pmsg->nm_packet, struct ip *);
	hlen = pmsg->base.lmsg.u.ms_result;

	transport_processing_oncpu(pmsg->nm_packet, hlen, ip);
	/* msg was embedded in the mbuf, do not reply! */
}

static void
ip_input_handler(netmsg_t msg)
{
	ip_input(msg->packet.nm_packet);
	/* msg was embedded in the mbuf, do not reply! */
}

/*
 * IP input routine.  Checksum and byte swap header.  If fragmented
 * try to reassemble.  Process options.  Pass to next level.
 */
void
ip_input(struct mbuf *m)
{
	struct ip *ip;
	struct in_ifaddr *ia = NULL;
	struct in_ifaddr_container *iac;
	int hlen, checkif;
	u_short sum;
	uint16_t ip_len;
	struct in_addr pkt_dst;
	boolean_t using_srcrt = FALSE;		/* forward (by PFIL_HOOKS) */
	struct in_addr odst;			/* original dst address(NAT) */
	struct m_tag *mtag;
	struct sockaddr_in *next_hop = NULL;
	lwkt_port_t port;

	ASSERT_NETISR_NCPUS(mycpuid);
	M_ASSERTPKTHDR(m);

	if (m->m_len < sizeof(struct ip)) {
		kprintf("Issuer to ip_input failed to check IP header atomicy (%d)\n",
			m->m_len);
		ipstat.ips_badlen++;
		goto bad;
	}
#if 0
	/* length checks already done in ip_hashfn() */
	KASSERT(m->m_len >= sizeof(struct ip), ("IP header not in one mbuf"));
#endif

	/*
	 * This routine is called from numerous places which may not have
	 * characterized the packet.
	 */
	ip = mtod(m, struct ip *);
	if (IN_MULTICAST(ntohl(ip->ip_dst.s_addr)) ||
	    (ip->ip_off & htons(IP_MF | IP_OFFMASK)))
	{
		/*
		 * Force hash recalculation for fragments and multicast
		 * packets; hardware may not do it correctly.
		 * XXX add flag to indicate the hash is from hardware
		 */
		m->m_flags &= ~M_HASH;
	}
	if ((m->m_flags & M_HASH) == 0) {
		ip_hashfn(&m, 0);
		if (m == NULL)
			return;
		KKASSERT(m->m_flags & M_HASH);

		if (&curthread->td_msgport !=
		    netisr_hashport(m->m_pkthdr.hash)) {
			netisr_queue(NETISR_IP, m);
			/* Requeued to other netisr msgport; done */
			return;
		}

		/* mbuf could have been changed */
		ip = mtod(m, struct ip *);
	}

	/*
	 * Pull out certain tags
	 */
	if (m->m_pkthdr.fw_flags & IPFORWARD_MBUF_TAGGED) {
		/* Next hop */
		mtag = m_tag_find(m, PACKET_TAG_IPFORWARD, NULL);
		KKASSERT(mtag != NULL);
		next_hop = m_tag_data(mtag);
	}

	if (m->m_pkthdr.fw_flags &
	    (DUMMYNET_MBUF_TAGGED | IPFW_MBUF_CONTINUE)) {
		/*
		 * - Dummynet already filtered this packet.
		 * - This packet was processed by ipfw on another
		 *   cpu, and the rest of the ipfw processing should
		 *   be carried out on this cpu.
		 */
		ip = mtod(m, struct ip *);
		hlen = IP_VHL_HL(ip->ip_vhl) << 2;
		goto iphack;
	}

	ipstat.ips_total++;

	if (IP_VHL_V(ip->ip_vhl) != IPVERSION) {
		ipstat.ips_badvers++;
		goto bad;
	}

	hlen = IP_VHL_HL(ip->ip_vhl) << 2;
	/* length checks already done in ip_hashfn() */
	KASSERT(hlen >= sizeof(struct ip), ("IP header len too small"));
	KASSERT(m->m_len >= hlen, ("complete IP header not in one mbuf"));

	/* 127/8 must not appear on wire - RFC1122 */
	if ((ntohl(ip->ip_dst.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET ||
	    (ntohl(ip->ip_src.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET) {
		if (!(m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK)) {
			ipstat.ips_badaddr++;
			goto bad;
		}
	}

	if (m->m_pkthdr.csum_flags & CSUM_IP_CHECKED) {
		sum = !(m->m_pkthdr.csum_flags & CSUM_IP_VALID);
	} else {
		if (hlen == sizeof(struct ip))
			sum = in_cksum_hdr(ip);
		else
			sum = in_cksum(m, hlen);
	}
	if (sum != 0) {
		ipstat.ips_badsum++;
		goto bad;
	}

#ifdef ALTQ
	if (altq_input != NULL && (*altq_input)(m, AF_INET) == 0) {
		/* packet is dropped by traffic conditioner */
		return;
	}
#endif
	/*
	 * Convert fields to host representation.
	 */
	ip_len = ntohs(ip->ip_len);

	/* length checks already done in ip_hashfn() */
	KASSERT(ip_len >= hlen, ("total length incl header"));
	KASSERT(m->m_pkthdr.len >= ip_len, ("mbuf too short"));

	/*
	 * Trim mbufs if longer than the IP header would have us expect.
	 */
	if (m->m_pkthdr.len > ip_len) {
		if (m->m_len == m->m_pkthdr.len) {
			m->m_len = ip_len;
			m->m_pkthdr.len = ip_len;
		} else {
			m_adj(m, ip_len - m->m_pkthdr.len);
		}
	}

	/*
	 * IpHack's section.
	 * Right now when no processing on packet has done
	 * and it is still fresh out of network we do our black
	 * deals with it.
	 * - Firewall: deny/allow/divert
	 * - Xlate: translate packet's addr/port (NAT).
	 * - Pipe: pass pkt through dummynet.
	 * - Wrap: fake packet's addr/port <unimpl.>
	 * - Encapsulate: put it in another IP and send out. <unimp.>
	 */

iphack:
	/*
	 * If we've been forwarded from the output side, then
	 * skip the firewall a second time
	 */
	if (next_hop != NULL)
		goto ours;

	/* No pfil hooks */
	if (!pfil_has_hooks(&inet_pfil_hook)) {
		if (m->m_pkthdr.fw_flags & DUMMYNET_MBUF_TAGGED) {
			/*
			 * Strip dummynet tags from stranded packets
			 */
			mtag = m_tag_find(m, PACKET_TAG_DUMMYNET, NULL);
			KKASSERT(mtag != NULL);
			m_tag_delete(m, mtag);
			m->m_pkthdr.fw_flags &= ~DUMMYNET_MBUF_TAGGED;
		}
		goto pass;
	}

	/*
	 * Run through list of hooks for input packets.
	 *
	 * NOTE!  If the packet is rewritten pf/ipfw/whoever must
	 *	  clear M_HASH.
	 */
	odst = ip->ip_dst;
	if (pfil_run_hooks(&inet_pfil_hook, &m, m->m_pkthdr.rcvif, PFIL_IN))
		return;
	if (m == NULL)	/* consumed by filter */
		return;
	ip = mtod(m, struct ip *);
	hlen = IP_VHL_HL(ip->ip_vhl) << 2;
	using_srcrt = (odst.s_addr != ip->ip_dst.s_addr);

	if (m->m_pkthdr.fw_flags & IPFORWARD_MBUF_TAGGED) {
		mtag = m_tag_find(m, PACKET_TAG_IPFORWARD, NULL);
		KKASSERT(mtag != NULL);
		next_hop = m_tag_data(mtag);
	}
	if (m->m_pkthdr.fw_flags & DUMMYNET_MBUF_TAGGED) {
		ip_dn_queue(m);
		return;
	}
	if (m->m_pkthdr.fw_flags & FW_MBUF_REDISPATCH)
		m->m_pkthdr.fw_flags &= ~FW_MBUF_REDISPATCH;
	if (m->m_pkthdr.fw_flags & IPFW_MBUF_CONTINUE) {
		/* ipfw was disabled/unloaded. */
		goto bad;
	}
pass:
	/*
	 * Process options and, if not destined for us,
	 * ship it on.  ip_dooptions returns 1 when an
	 * error was detected (causing an icmp message
	 * to be sent and the original packet to be freed).
	 */
	if (hlen > sizeof(struct ip) && ip_dooptions(m, 0, next_hop))
		return;

	/* greedy RSVP, snatches any PATH packet of the RSVP protocol and no
	 * matter if it is destined to another node, or whether it is
	 * a multicast one, RSVP wants it! and prevents it from being forwarded
	 * anywhere else. Also checks if the rsvp daemon is running before
	 * grabbing the packet.
	 */
	if (rsvp_on && ip->ip_p == IPPROTO_RSVP)
		goto ours;

	/*
	 * Check our list of addresses, to see if the packet is for us.
	 * If we don't have any addresses, assume any unicast packet
	 * we receive might be for us (and let the upper layers deal
	 * with it).
	 */
	if (TAILQ_EMPTY(&in_ifaddrheads[mycpuid]) &&
	    !(m->m_flags & (M_MCAST | M_BCAST)))
	{
		goto ours;
	}

	/*
	 * Cache the destination address of the packet; this may be
	 * changed by use of 'ipfw fwd'.
	 */
	pkt_dst = next_hop ? next_hop->sin_addr : ip->ip_dst;

	/*
	 * Enable a consistency check between the destination address
	 * and the arrival interface for a unicast packet (the RFC 1122
	 * strong ES model) if IP forwarding is disabled and the packet
	 * is not locally generated and the packet is not subject to
	 * 'ipfw fwd'.
	 *
	 * XXX - Checking also should be disabled if the destination
	 * address is ipnat'ed to a different interface.
	 *
	 * XXX - Checking is incompatible with IP aliases added
	 * to the loopback interface instead of the interface where
	 * the packets are received.
	 */
	checkif = ip_checkinterface &&
		  !ipforwarding &&
		  m->m_pkthdr.rcvif != NULL &&
		  !(m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) &&
		  next_hop == NULL;

	/*
	 * Check for exact addresses in the hash bucket.
	 */
	LIST_FOREACH(iac, INADDR_HASH(pkt_dst.s_addr), ia_hash) {
		ia = iac->ia;

		/*
		 * If the address matches, verify that the packet
		 * arrived via the correct interface if checking is
		 * enabled.
		 */
		if (IA_SIN(ia)->sin_addr.s_addr == pkt_dst.s_addr &&
		    (!checkif || ia->ia_ifp == m->m_pkthdr.rcvif))
		{
			goto ours;
		}
	}
	ia = NULL;

	/*
	 * Check for broadcast addresses.
	 *
	 * Only accept broadcast packets that arrive via the matching
	 * interface.  Reception of forwarded directed broadcasts would
	 * be handled via ip_forward() and ether_output() with the loopback
	 * into the stack for SIMPLEX interfaces handled by ether_output().
	 */
	if (m->m_pkthdr.rcvif != NULL &&
	    m->m_pkthdr.rcvif->if_flags & IFF_BROADCAST) {
		struct ifaddr_container *ifac;

		TAILQ_FOREACH(ifac, &m->m_pkthdr.rcvif->if_addrheads[mycpuid],
			      ifa_link) {
			struct ifaddr *ifa = ifac->ifa;

			if (ifa->ifa_addr == NULL) /* shutdown/startup race */
				continue;
			if (ifa->ifa_addr->sa_family != AF_INET)
				continue;
			ia = ifatoia(ifa);
			if (satosin(&ia->ia_broadaddr)->sin_addr.s_addr ==
								pkt_dst.s_addr)
				goto ours;
			if (ia->ia_netbroadcast.s_addr == pkt_dst.s_addr)
				goto ours;
#ifdef BOOTP_COMPAT
			if (IA_SIN(ia)->sin_addr.s_addr == INADDR_ANY)
				goto ours;
#endif
		}
	}
	if (IN_MULTICAST(ntohl(ip->ip_dst.s_addr))) {
		struct in_multi *inm;

		if (ip_mrouter != NULL) {
			/* XXX Multicast routing is not MPSAFE yet */
			get_mplock();

			/*
			 * If we are acting as a multicast router, all
			 * incoming multicast packets are passed to the
			 * kernel-level multicast forwarding function.
			 * The packet is returned (relatively) intact; if
			 * ip_mforward() returns a non-zero value, the packet
			 * must be discarded, else it may be accepted below.
			 */
			if (ip_mforward != NULL &&
			    ip_mforward(ip, m->m_pkthdr.rcvif, m, NULL) != 0) {
				rel_mplock();
				ipstat.ips_cantforward++;
				m_freem(m);
				return;
			}

			rel_mplock();

			/*
			 * The process-level routing daemon needs to receive
			 * all multicast IGMP packets, whether or not this
			 * host belongs to their destination groups.
			 */
			if (ip->ip_p == IPPROTO_IGMP)
				goto ours;
			ipstat.ips_forward++;
		}
		/*
		 * See if we belong to the destination multicast group on the
		 * arrival interface.
		 */
		inm = IN_LOOKUP_MULTI(&ip->ip_dst, m->m_pkthdr.rcvif);
		if (inm == NULL) {
			ipstat.ips_notmember++;
			m_freem(m);
			return;
		}
		goto ours;
	}
	if (ip->ip_dst.s_addr == INADDR_BROADCAST)
		goto ours;
	if (ip->ip_dst.s_addr == INADDR_ANY)
		goto ours;

	/*
	 * Not for us; forward if possible and desirable.
	 */
	if (!ipforwarding) {
		ipstat.ips_cantforward++;
		m_freem(m);
	} else {
		ip_forward(m, using_srcrt, next_hop);
	}
	return;

ours:

	/*
	 * IPSTEALTH: Process non-routing options only
	 * if the packet is destined for us.
	 */
	if (ipstealth &&
	    hlen > sizeof(struct ip) &&
	    ip_dooptions(m, 1, next_hop))
	{
		return;
	}

	/* Count the packet in the ip address stats */
	if (ia != NULL) {
		IFA_STAT_INC(&ia->ia_ifa, ipackets, 1);
		IFA_STAT_INC(&ia->ia_ifa, ibytes, m->m_pkthdr.len);
	}

	/*
	 * If offset or IP_MF are set, must reassemble.
	 * Otherwise, nothing need be done.
	 * (We could look in the reassembly queue to see
	 * if the packet was previously fragmented,
	 * but it's not worth the time; just let them time out.)
	 */
	if (ip->ip_off & htons(IP_MF | IP_OFFMASK)) {
		/*
		 * Attempt reassembly; if it succeeds, proceed.  ip_reass()
		 * will return a different mbuf.
		 *
		 * NOTE: ip_reass() returns m with M_HASH cleared to force
		 *	 us to recharacterize the packet.
		 */
		m = ip_reass(m);
		if (m == NULL)
			return;
		ip = mtod(m, struct ip *);

		/* Get the header length of the reassembled packet */
		hlen = IP_VHL_HL(ip->ip_vhl) << 2;
	}

	/*
	 * We must forward the packet to the correct protocol thread if
	 * we are not already in it.
	 *
	 * NOTE: ip_len is left in network form.  ip_len is not adjusted
	 *	 further for protocol processing, instead we pass hlen
	 *	 to the protosw and let it deal with it.
	 */
	ipstat.ips_delivered++;

	if ((m->m_flags & M_HASH) == 0) {
		m = ip_rehashm(m);
		if (m == NULL)
			return;
		ip = mtod(m, struct ip *);
	}
	port = netisr_hashport(m->m_pkthdr.hash);

	if (port != &curthread->td_msgport) {
		ip_transport_redispatch(port, m, hlen);
	} else {
#ifdef RSS_DEBUG
		atomic_add_long(&ip_dispatch_fast, 1);
#endif
		transport_processing_oncpu(m, hlen, ip);
	}
	return;

bad:
	m_freem(m);
}

struct mbuf *
ip_rehashm(struct mbuf *m)
{
	struct ip *ip = mtod(m, struct ip *);

#ifdef RSS_DEBUG
	atomic_add_long(&ip_rehash_count, 1);
#endif
	ip_hashfn(&m, 0);
	if (m == NULL)
		return NULL;

	/* 'm' might be changed by ip_hashfn(). */
	ip = mtod(m, struct ip *);
	KASSERT(m->m_flags & M_HASH, ("no hash"));

	return (m);
}

void
ip_transport_redispatch(struct lwkt_port *port, struct mbuf *m, int hlen)
{
	struct netmsg_packet *pmsg;

#ifdef RSS_DEBUG
	atomic_add_long(&ip_dispatch_slow, 1);
#endif

	pmsg = &m->m_hdr.mh_netmsg;
	netmsg_init(&pmsg->base, NULL, &netisr_apanic_rport,
		    0, transport_processing_handler);
	pmsg->nm_packet = m;
	pmsg->base.lmsg.u.ms_result = hlen;
	lwkt_sendmsg(port, &pmsg->base.lmsg);
}

static void
ip_forward_handler(netmsg_t msg)
{
	struct netmsg_forward *fmsg;
	struct mbuf *m;
	struct m_tag *mtag;
	struct sockaddr_in *next_hop = NULL;

	fmsg = &msg->forward;
	m = fmsg->nm_packet;

	/* Re-extract the next hop if it exists */
	if (m->m_pkthdr.fw_flags & IPFORWARD_MBUF_TAGGED) {
		/* Next hop */
		mtag = m_tag_find(m, PACKET_TAG_IPFORWARD, NULL);
		KKASSERT(mtag != NULL);
		next_hop = m_tag_data(mtag);
	}

	ip_forward(m, fmsg->using_srcrt, next_hop);
	/* msg was embedded in the mbuf, do not reply! */
}

static void
ip_forward_redispatch(struct lwkt_port *port, struct mbuf *m, boolean_t srcrt)
{
	struct netmsg_forward *fmsg;

	fmsg = &m->m_hdr.mh_fwdmsg;
	netmsg_init(&fmsg->base, NULL, &netisr_apanic_rport,
		    0, ip_forward_handler);
	fmsg->nm_packet = m;
	fmsg->using_srcrt = srcrt;
	lwkt_sendmsg(port, &fmsg->base.lmsg);
}

/*
 * Take incoming datagram fragment and try to reassemble it into
 * whole datagram.  If a chain for reassembly of this datagram already
 * exists, then it is given as fp; otherwise have to make a chain.
 */
struct mbuf *
ip_reass(struct mbuf *m)
{
	struct ipfrag_queue *fragq = &ipfrag_queue_pcpu[mycpuid];
	struct ip *ip = mtod(m, struct ip *);
	struct mbuf *p = NULL, *q, *nq;
	struct mbuf *n;
	struct ipq *fp = NULL;
	struct ipqhead *head;
	int hlen = IP_VHL_HL(ip->ip_vhl) << 2;
	int i, next;
	u_short sum;
	uint16_t ip_off;
	uint16_t ip_len;

	/* If maxnipq or maxfragsperpacket are 0, never accept fragments. */
	if (maxnipq == 0 || maxfragsperpacket == 0) {
		ipstat.ips_fragments++;
		ipstat.ips_fragdropped++;
		m_freem(m);
		return NULL;
	}

	sum = IPREASS_HASH(ip->ip_src.s_addr, ip->ip_id);
	/*
	 * Look for queue of fragments of this datagram.
	 */
	head = &fragq->ipq[sum];
	TAILQ_FOREACH(fp, head, ipq_list) {
		if (ip->ip_id == fp->ipq_id &&
		    ip->ip_src.s_addr == fp->ipq_src.s_addr &&
		    ip->ip_dst.s_addr == fp->ipq_dst.s_addr &&
		    ip->ip_p == fp->ipq_p)
		{
			goto found;
		}
	}

	fp = NULL;

	/*
	 * Enforce upper bound on number of fragmented packets
	 * for which we attempt reassembly;
	 * If maxnipq is -1, accept all fragments without limitation.
	 */
	if (fragq->nipq > maxnipq && maxnipq > 0) {
		/*
		 * drop something from the tail of the current queue
		 * before proceeding further
		 */
		struct ipq *q = TAILQ_LAST(head, ipqhead);
		if (q == NULL) {
			/*
			 * The current queue is empty,
			 * so drop from one of the others.
			 */
			for (i = 0; i < IPREASS_NHASH; i++) {
				struct ipq *r;

				r = TAILQ_LAST(&fragq->ipq[i], ipqhead);
				if (r) {
					ipstat.ips_fragtimeout += r->ipq_nfrags;
					ip_freef(fragq, &fragq->ipq[i], r);
					break;
				}
			}
		} else {
			ipstat.ips_fragtimeout += q->ipq_nfrags;
			ip_freef(fragq, head, q);
		}
	}
found:
	/*
	 * NOTE: ip_len is no longer adjusted to remove the header length.
	 */
	if (ip->ip_off & htons(IP_MF)) {
		/*
		 * Make sure that fragments have a data length
		 * that's a non-zero multiple of 8 bytes.  The
		 * IP header itself might be in multiples of 4
		 * bytes and is discounted.
		 */
		ip_len = ntohs(ip->ip_len) - hlen;
		if (ip_len == 0 || (ip_len & 7) != 0) {
			ipstat.ips_toosmall++; /* XXX */
			m_freem(m);
			goto done;
		}
		m->m_flags |= M_FRAG;
	} else {
		m->m_flags &= ~M_FRAG;
	}

	ipstat.ips_fragments++;
	m->m_pkthdr.header = ip;

	/*
	 * If the hardware has not done csum over this fragment
	 * then csum_data is not valid at all.
	 */
	if ((m->m_pkthdr.csum_flags & (CSUM_FRAG_NOT_CHECKED | CSUM_DATA_VALID))
	    == (CSUM_FRAG_NOT_CHECKED | CSUM_DATA_VALID))
	{
		m->m_pkthdr.csum_data = 0;
		m->m_pkthdr.csum_flags &= ~(CSUM_DATA_VALID | CSUM_PSEUDO_HDR);
	}

	/*
	 * Presence of header sizes in mbufs would confuse code below.
	 * Note that ip->ip_len is not modified and retains the header length,
	 * but local ip_len and fp_len variables remove the header length.
	 */
	m->m_data += hlen;
	m->m_len -= hlen;

	/*
	 * If first fragment to arrive, create a reassembly queue.
	 */
	if (fp == NULL) {
		if ((fp = mpipe_alloc_nowait(&ipq_mpipe)) == NULL)
			goto dropfrag;
		TAILQ_INSERT_HEAD(head, fp, ipq_list);
		fragq->nipq++;
		fp->ipq_nfrags = 1;
		fp->ipq_ttl = IPFRAGTTL;
		fp->ipq_p = ip->ip_p;
		fp->ipq_id = ip->ip_id;
		fp->ipq_src = ip->ip_src;
		fp->ipq_dst = ip->ip_dst;
		fp->ipq_frags = m;
		m->m_nextpkt = NULL;
		goto inserted;
	}
	fp->ipq_nfrags++;

#define	GETIP(m)	((struct ip*)((m)->m_pkthdr.header))

	/*
	 * Find a segment which begins after this one does.  We
	 * don't have to fully convert the offset field for this
	 * test.
	 */
	for (p = NULL, q = fp->ipq_frags; q; p = q, q = q->m_nextpkt) {
		if ((ntohs(GETIP(q)->ip_off) & IP_OFFMASK) >
		    (ntohs(ip->ip_off) & IP_OFFMASK))
		{
			break;
		}
	}

	/*
	 * Drop fragment if it overflows the maximum allowed IP
	 * packet size.
	 */
	ip_off = (ntohs(ip->ip_off) & IP_OFFMASK) << 3;
	ip_len = ntohs(ip->ip_len);

	if (ip_off + ip_len > 65535U)
		goto dropfrag;

	ip_len -= hlen;

	/*
	 * If there is a preceding segment, it may provide some of
	 * our data already.  If so, drop the data from the incoming
	 * segment.  If it provides all of our data, drop us, otherwise
	 * stick new segment in the proper place.
	 *
	 * If some of the data is dropped from the the preceding
	 * segment, then it's checksum is invalidated.
	 */

	if (p) {
		uint16_t fp_off;
		uint16_t fp_len;

		/*
		 * Calculations in bytes and ip_len/fp_len do not reflect
		 * the header size.
		 */
		fp_off = (ntohs(GETIP(p)->ip_off) & IP_OFFMASK) << 3;
		fp_len = ntohs(GETIP(p)->ip_len) -
			 (IP_VHL_HL(GETIP(p)->ip_vhl) << 2);

		if (fp_off + fp_len > ip_off) {
			i = fp_off + fp_len - ip_off;
			if (i >= ip_len)
				goto dropfrag;
			m_adj(m, i);
			m->m_pkthdr.csum_flags = 0;
			ip_off = fp_off + fp_len;
			ip_len -= i;

			/*
			 * Non-optimal modification of packet content, but
			 * in this rare case we don't care.
			 */
			ip->ip_off = htons(ip_off >> 3);
			ip->ip_len = htons(ip_len + hlen);
		}
		m->m_nextpkt = p->m_nextpkt;
		p->m_nextpkt = m;
	} else {
		m->m_nextpkt = fp->ipq_frags;
		fp->ipq_frags = m;
	}

	/*
	 * Dequeue any later segments that we completely overlap.
	 * While we overlap succeeding segments trim them or,
	 * if they are completely covered, dequeue them.
	 */
	while (q) {
		uint16_t fp_off;
		uint16_t fp_len;
		uint16_t fp_hlen;

		fp_off = (ntohs(GETIP(q)->ip_off) & IP_OFFMASK) << 3;
		fp_hlen = (IP_VHL_HL(GETIP(q)->ip_vhl) << 2);
		fp_len = ntohs(GETIP(q)->ip_len) - fp_hlen;
		if (ip_off + ip_len <= fp_off)
			break;
		i = ip_off + ip_len - fp_off;	/* bytes overlapped */

		if (i < fp_len) {
			/*
			 * Non-optimal modification of packet content, but
			 * in this rare case we don't care.
			 */
			GETIP(q)->ip_len = htons(fp_len - i + fp_hlen);
			GETIP(q)->ip_off = htons((fp_off + i) >> 3);
			m_adj(q, i);
			q->m_pkthdr.csum_flags = 0;
			break;
		}
		nq = q->m_nextpkt;
		m->m_nextpkt = nq;
		ipstat.ips_fragdropped++;
		fp->ipq_nfrags--;
		q->m_nextpkt = NULL;
		m_freem(q);

		q = nq;
	}

inserted:
	/*
	 * Check for complete reassembly and perform frag per packet
	 * limiting.
	 *
	 * Frag limiting is performed here so that the nth frag has
	 * a chance to complete the packet before we drop the packet.
	 * As a result, n+1 frags are actually allowed per packet, but
	 * only n will ever be stored. (n = maxfragsperpacket.)
	 *
	 */
	next = 0;
	for (p = NULL, q = fp->ipq_frags; q; p = q, q = q->m_nextpkt) {
		uint16_t fp_off;
		uint16_t fp_len;
		uint16_t fp_hlen;

		fp_off = (ntohs(GETIP(q)->ip_off) & IP_OFFMASK) << 3;
		fp_hlen = (IP_VHL_HL(GETIP(q)->ip_vhl) << 2);
		fp_len = ntohs(GETIP(q)->ip_len) - fp_hlen;
		if (fp_off != next) {
			if (fp->ipq_nfrags > maxfragsperpacket) {
				ipstat.ips_fragdropped += fp->ipq_nfrags;
				ip_freef(fragq, head, fp);
			}
			goto done;
		}
		next += fp_len;
	}
	/* Make sure the last packet didn't have the IP_MF flag */
	if (p->m_flags & M_FRAG) {
		if (fp->ipq_nfrags > maxfragsperpacket) {
			ipstat.ips_fragdropped += fp->ipq_nfrags;
			ip_freef(fragq, head, fp);
		}
		goto done;
	}

	/*
	 * Reassembly is complete.  Make sure the packet is a sane size.
	 */
	q = fp->ipq_frags;
	ip = GETIP(q);
	hlen = IP_VHL_HL(ip->ip_vhl) << 2;
	if (next + (IP_VHL_HL(ip->ip_vhl) << 2) > IP_MAXPACKET) {
		ipstat.ips_toolong++;
		ipstat.ips_fragdropped += fp->ipq_nfrags;
		ip_freef(fragq, head, fp);
		goto done;
	}

	/*
	 * Concatenate fragments.
	 */
	m = q;
	n = m->m_next;
	m->m_next = NULL;
	m_cat(m, n);
	nq = q->m_nextpkt;
	q->m_nextpkt = NULL;
	for (q = nq; q != NULL; q = nq) {
		nq = q->m_nextpkt;
		q->m_nextpkt = NULL;
		m->m_pkthdr.csum_flags &= q->m_pkthdr.csum_flags;
		m->m_pkthdr.csum_data += q->m_pkthdr.csum_data;
		m_cat(m, q);
	}

	/*
	 * Clean up the 1's complement checksum.  Carry over 16 bits must
	 * be added back.  This assumes no more then 65535 packet fragments
	 * were reassembled.  A second carry can also occur (but not a third).
	 */
	m->m_pkthdr.csum_data = (m->m_pkthdr.csum_data & 0xffff) +
				(m->m_pkthdr.csum_data >> 16);
	if (m->m_pkthdr.csum_data > 0xFFFF)
		m->m_pkthdr.csum_data -= 0xFFFF;

	/*
	 * Create header for new ip packet by modifying the header of the
	 * first packet.  Dequeue and discard the fragment reassembly header.
	 * Make the header visible.  Set the offset to 0 and keep only the
	 * DF flag from the first packet's ip_off field.
	 *
	 * Note that ip_len includes the header length.
	 */
	ip->ip_len = htons(next + hlen);
	ip->ip_src = fp->ipq_src;
	ip->ip_dst = fp->ipq_dst;
	ip->ip_off &= htons(IP_DF);
	TAILQ_REMOVE(head, fp, ipq_list);
	fragq->nipq--;
	mpipe_free(&ipq_mpipe, fp);

	m->m_len += (IP_VHL_HL(ip->ip_vhl) << 2);
	m->m_data -= (IP_VHL_HL(ip->ip_vhl) << 2);
	/* some debugging cruft by sklower, below, will go away soon */
	if (m->m_flags & M_PKTHDR) { /* XXX this should be done elsewhere */
		int plen = 0;

		for (n = m; n; n = n->m_next)
			plen += n->m_len;
		m->m_pkthdr.len = plen;
	}

	/*
	 * Reassembly complete, return the next protocol.
	 *
	 * Be sure to clear M_HASH to force the packet
	 * to be re-characterized.
	 *
	 * Clear M_FRAG, we are no longer a fragment.
	 */
	m->m_flags &= ~(M_HASH | M_FRAG);

	ipstat.ips_reassembled++;
	return (m);

dropfrag:
	ipstat.ips_fragdropped++;
	if (fp != NULL)
		fp->ipq_nfrags--;
	m_freem(m);
done:
	return (NULL);

#undef GETIP
}

/*
 * Free a fragment reassembly header and all
 * associated datagrams.
 */
static void
ip_freef(struct ipfrag_queue *fragq, struct ipqhead *fhp, struct ipq *fp)
{
	struct mbuf *q;

	/*
	 * Remove first to protect against blocking
	 */
	TAILQ_REMOVE(fhp, fp, ipq_list);

	/*
	 * Clean out at our leisure
	 */
	while (fp->ipq_frags) {
		q = fp->ipq_frags;
		fp->ipq_frags = q->m_nextpkt;
		q->m_nextpkt = NULL;
		m_freem(q);
	}
	mpipe_free(&ipq_mpipe, fp);
	fragq->nipq--;
}

/*
 * If a timer expires on a reassembly queue, discard it.
 */
static void
ipfrag_timeo_dispatch(netmsg_t nmsg)
{
	struct ipfrag_queue *fragq = &ipfrag_queue_pcpu[mycpuid];
	struct ipq *fp, *fp_temp;
	struct ipqhead *head;
	int i;

	crit_enter();
	netisr_replymsg(&nmsg->base, 0);  /* reply ASAP */
	crit_exit();

	if (fragq->nipq == 0)
		goto done;

	for (i = 0; i < IPREASS_NHASH; i++) {
		head = &fragq->ipq[i];
		TAILQ_FOREACH_MUTABLE(fp, head, ipq_list, fp_temp) {
			if (--fp->ipq_ttl == 0) {
				ipstat.ips_fragtimeout += fp->ipq_nfrags;
				ip_freef(fragq, head, fp);
			}
		}
	}
	/*
	 * If we are over the maximum number of fragments
	 * (due to the limit being lowered), drain off
	 * enough to get down to the new limit.
	 */
	if (maxnipq >= 0 && fragq->nipq > maxnipq) {
		for (i = 0; i < IPREASS_NHASH; i++) {
			head = &fragq->ipq[i];
			while (fragq->nipq > maxnipq && !TAILQ_EMPTY(head)) {
				ipstat.ips_fragdropped +=
				    TAILQ_FIRST(head)->ipq_nfrags;
				ip_freef(fragq, head, TAILQ_FIRST(head));
			}
		}
	}
done:
	callout_reset(&fragq->timeo_ch, IPFRAG_TIMEO, ipfrag_timeo, NULL);
}

static void
ipfrag_timeo(void *dummy __unused)
{
	struct netmsg_base *msg = &ipfrag_queue_pcpu[mycpuid].timeo_netmsg;

	crit_enter();
	if (msg->lmsg.ms_flags & MSGF_DONE)
		netisr_sendmsg_oncpu(msg);
	crit_exit();
}

/*
 * Drain off all datagram fragments.
 */
static void
ipfrag_drain_oncpu(struct ipfrag_queue *fragq)
{
	struct ipqhead *head;
	int i;

	for (i = 0; i < IPREASS_NHASH; i++) {
		head = &fragq->ipq[i];
		while (!TAILQ_EMPTY(head)) {
			ipstat.ips_fragdropped += TAILQ_FIRST(head)->ipq_nfrags;
			ip_freef(fragq, head, TAILQ_FIRST(head));
		}
	}
}

static void
ipfrag_drain_dispatch(netmsg_t nmsg)
{
	struct ipfrag_queue *fragq = &ipfrag_queue_pcpu[mycpuid];

	crit_enter();
	lwkt_replymsg(&nmsg->lmsg, 0);  /* reply ASAP */
	crit_exit();

	ipfrag_drain_oncpu(fragq);
	fragq->draining = 0;
}

static void
ipfrag_drain_ipi(void *arg __unused)
{
	int cpu = mycpuid;
	struct lwkt_msg *msg = &ipfrag_queue_pcpu[cpu].drain_netmsg.lmsg;

	crit_enter();
	if (msg->ms_flags & MSGF_DONE)
		lwkt_sendmsg_oncpu(netisr_cpuport(cpu), msg);
	crit_exit();
}

static void
ipfrag_drain(void)
{
	cpumask_t mask;
	int cpu;

	CPUMASK_ASSBMASK(mask, netisr_ncpus);
	CPUMASK_ANDMASK(mask, smp_active_mask);

	if (IN_NETISR_NCPUS(mycpuid)) {
		ipfrag_drain_oncpu(&ipfrag_queue_pcpu[mycpuid]);
		CPUMASK_NANDBIT(mask, mycpuid);
	}

	for (cpu = 0; cpu < netisr_ncpus; ++cpu) {
		struct ipfrag_queue *fragq = &ipfrag_queue_pcpu[cpu];

		if (!CPUMASK_TESTBIT(mask, cpu))
			continue;

		if (fragq->nipq == 0 || fragq->draining) {
			/* No fragments or is draining; skip this cpu. */
			CPUMASK_NANDBIT(mask, cpu);
			continue;
		}
		fragq->draining = 1;
	}

	if (CPUMASK_TESTNZERO(mask))
		lwkt_send_ipiq_mask(mask, ipfrag_drain_ipi, NULL);
}

void
ip_drain(void)
{
	ipfrag_drain();
	in_rtqdrain();
}

/*
 * Do option processing on a datagram,
 * possibly discarding it if bad options are encountered,
 * or forwarding it if source-routed.
 * The pass argument is used when operating in the IPSTEALTH
 * mode to tell what options to process:
 * [LS]SRR (pass 0) or the others (pass 1).
 * The reason for as many as two passes is that when doing IPSTEALTH,
 * non-routing options should be processed only if the packet is for us.
 * Returns 1 if packet has been forwarded/freed,
 * 0 if the packet should be processed further.
 */
static int
ip_dooptions(struct mbuf *m, int pass, struct sockaddr_in *next_hop)
{
	struct sockaddr_in ipaddr = { sizeof ipaddr, AF_INET };
	struct ip *ip = mtod(m, struct ip *);
	u_char *cp;
	struct in_ifaddr *ia;
	int opt, optlen, cnt, off, code, type = ICMP_PARAMPROB;
	boolean_t forward = FALSE;
	struct in_addr *sin, dst;
	n_time ntime;

	dst = ip->ip_dst;
	cp = (u_char *)(ip + 1);
	cnt = (IP_VHL_HL(ip->ip_vhl) << 2) - sizeof(struct ip);
	for (; cnt > 0; cnt -= optlen, cp += optlen) {
		opt = cp[IPOPT_OPTVAL];
		if (opt == IPOPT_EOL)
			break;
		if (opt == IPOPT_NOP)
			optlen = 1;
		else {
			if (cnt < IPOPT_OLEN + sizeof(*cp)) {
				code = &cp[IPOPT_OLEN] - (u_char *)ip;
				goto bad;
			}
			optlen = cp[IPOPT_OLEN];
			if (optlen < IPOPT_OLEN + sizeof(*cp) || optlen > cnt) {
				code = &cp[IPOPT_OLEN] - (u_char *)ip;
				goto bad;
			}
		}
		switch (opt) {

		default:
			break;

		/*
		 * Source routing with record.
		 * Find interface with current destination address.
		 * If none on this machine then drop if strictly routed,
		 * or do nothing if loosely routed.
		 * Record interface address and bring up next address
		 * component.  If strictly routed make sure next
		 * address is on directly accessible net.
		 */
		case IPOPT_LSRR:
		case IPOPT_SSRR:
			if (ipstealth && pass > 0)
				break;
			if (optlen < IPOPT_OFFSET + sizeof(*cp)) {
				code = &cp[IPOPT_OLEN] - (u_char *)ip;
				goto bad;
			}
			if ((off = cp[IPOPT_OFFSET]) < IPOPT_MINOFF) {
				code = &cp[IPOPT_OFFSET] - (u_char *)ip;
				goto bad;
			}
			ipaddr.sin_addr = ip->ip_dst;
			ia = (struct in_ifaddr *)
				ifa_ifwithaddr((struct sockaddr *)&ipaddr);
			if (ia == NULL) {
				if (opt == IPOPT_SSRR) {
					type = ICMP_UNREACH;
					code = ICMP_UNREACH_SRCFAIL;
					goto bad;
				}
				if (!ip_dosourceroute)
					goto nosourcerouting;
				/*
				 * Loose routing, and not at next destination
				 * yet; nothing to do except forward.
				 */
				break;
			}
			off--;			/* 0 origin */
			if (off > optlen - (int)sizeof(struct in_addr)) {
				/*
				 * End of source route.  Should be for us.
				 */
				if (!ip_acceptsourceroute)
					goto nosourcerouting;
				save_rte(m, cp, ip->ip_src);
				break;
			}
			if (ipstealth)
				goto dropit;
			if (!ip_dosourceroute) {
				if (ipforwarding) {
					char sbuf[INET_ADDRSTRLEN];
					char dbuf[INET_ADDRSTRLEN];

					/*
					 * Acting as a router, so generate ICMP
					 */
nosourcerouting:
					log(LOG_WARNING,
					    "attempted source route from %s to %s\n",
					    kinet_ntoa(ip->ip_src, sbuf),
					    kinet_ntoa(ip->ip_dst, dbuf));
					type = ICMP_UNREACH;
					code = ICMP_UNREACH_SRCFAIL;
					goto bad;
				} else {
					/*
					 * Not acting as a router,
					 * so silently drop.
					 */
dropit:
					ipstat.ips_cantforward++;
					m_freem(m);
					return (1);
				}
			}

			/*
			 * locate outgoing interface
			 */
			memcpy(&ipaddr.sin_addr, cp + off,
			    sizeof ipaddr.sin_addr);

			if (opt == IPOPT_SSRR) {
#define	INA	struct in_ifaddr *
#define	SA	struct sockaddr *
				if ((ia = (INA)ifa_ifwithdstaddr((SA)&ipaddr))
									== NULL)
					ia = (INA)ifa_ifwithnet((SA)&ipaddr);
			} else {
				ia = ip_rtaddr(ipaddr.sin_addr, NULL);
			}
			if (ia == NULL) {
				type = ICMP_UNREACH;
				code = ICMP_UNREACH_SRCFAIL;
				goto bad;
			}
			ip->ip_dst = ipaddr.sin_addr;
			memcpy(cp + off, &IA_SIN(ia)->sin_addr,
			    sizeof(struct in_addr));
			cp[IPOPT_OFFSET] += sizeof(struct in_addr);
			/*
			 * Let ip_intr's mcast routing check handle mcast pkts
			 */
			forward = !IN_MULTICAST(ntohl(ip->ip_dst.s_addr));
			break;

		case IPOPT_RR:
			if (ipstealth && pass == 0)
				break;
			if (optlen < IPOPT_OFFSET + sizeof(*cp)) {
				code = &cp[IPOPT_OFFSET] - (u_char *)ip;
				goto bad;
			}
			if ((off = cp[IPOPT_OFFSET]) < IPOPT_MINOFF) {
				code = &cp[IPOPT_OFFSET] - (u_char *)ip;
				goto bad;
			}
			/*
			 * If no space remains, ignore.
			 */
			off--;			/* 0 origin */
			if (off > optlen - (int)sizeof(struct in_addr))
				break;
			memcpy(&ipaddr.sin_addr, &ip->ip_dst,
			    sizeof ipaddr.sin_addr);
			/*
			 * locate outgoing interface; if we're the destination,
			 * use the incoming interface (should be same).
			 */
			if ((ia = (INA)ifa_ifwithaddr((SA)&ipaddr)) == NULL &&
			    (ia = ip_rtaddr(ipaddr.sin_addr, NULL)) == NULL) {
				type = ICMP_UNREACH;
				code = ICMP_UNREACH_HOST;
				goto bad;
			}
			memcpy(cp + off, &IA_SIN(ia)->sin_addr,
			    sizeof(struct in_addr));
			cp[IPOPT_OFFSET] += sizeof(struct in_addr);
			break;

		case IPOPT_TS:
			if (ipstealth && pass == 0)
				break;
			code = cp - (u_char *)ip;
			if (optlen < 4 || optlen > 40) {
				code = &cp[IPOPT_OLEN] - (u_char *)ip;
				goto bad;
			}
			if ((off = cp[IPOPT_OFFSET]) < 5) {
				code = &cp[IPOPT_OLEN] - (u_char *)ip;
				goto bad;
			}
			if (off > optlen - (int)sizeof(int32_t)) {
				cp[IPOPT_OFFSET + 1] += (1 << 4);
				if ((cp[IPOPT_OFFSET + 1] & 0xf0) == 0) {
					code = &cp[IPOPT_OFFSET] - (u_char *)ip;
					goto bad;
				}
				break;
			}
			off--;				/* 0 origin */
			sin = (struct in_addr *)(cp + off);
			switch (cp[IPOPT_OFFSET + 1] & 0x0f) {

			case IPOPT_TS_TSONLY:
				break;

			case IPOPT_TS_TSANDADDR:
				if (off + sizeof(n_time) +
				    sizeof(struct in_addr) > optlen) {
					code = &cp[IPOPT_OFFSET] - (u_char *)ip;
					goto bad;
				}
				ipaddr.sin_addr = dst;
				ia = (INA)ifaof_ifpforaddr((SA)&ipaddr,
							    m->m_pkthdr.rcvif);
				if (ia == NULL)
					continue;
				memcpy(sin, &IA_SIN(ia)->sin_addr,
				    sizeof(struct in_addr));
				cp[IPOPT_OFFSET] += sizeof(struct in_addr);
				off += sizeof(struct in_addr);
				break;

			case IPOPT_TS_PRESPEC:
				if (off + sizeof(n_time) +
				    sizeof(struct in_addr) > optlen) {
					code = &cp[IPOPT_OFFSET] - (u_char *)ip;
					goto bad;
				}
				memcpy(&ipaddr.sin_addr, sin,
				    sizeof(struct in_addr));
				if (ifa_ifwithaddr((SA)&ipaddr) == NULL)
					continue;
				cp[IPOPT_OFFSET] += sizeof(struct in_addr);
				off += sizeof(struct in_addr);
				break;

			default:
				code = &cp[IPOPT_OFFSET + 1] - (u_char *)ip;
				goto bad;
			}
			ntime = iptime();
			memcpy(cp + off, &ntime, sizeof(n_time));
			cp[IPOPT_OFFSET] += sizeof(n_time);
		}
	}
	if (forward && ipforwarding) {
		ip_forward(m, TRUE, next_hop);
		return (1);
	}
	return (0);
bad:
	icmp_error(m, type, code, 0, 0);
	ipstat.ips_badoptions++;
	return (1);
}

/*
 * Given address of next destination (final or next hop),
 * return internet address info of interface to be used to get there.
 */
struct in_ifaddr *
ip_rtaddr(struct in_addr dst, struct route *ro0)
{
	struct route sro, *ro;
	struct sockaddr_in *sin;
	struct in_ifaddr *ia;

	if (ro0 != NULL) {
		ro = ro0;
	} else {
		bzero(&sro, sizeof(sro));
		ro = &sro;
	}

	sin = (struct sockaddr_in *)&ro->ro_dst;

	if (ro->ro_rt == NULL || dst.s_addr != sin->sin_addr.s_addr) {
		if (ro->ro_rt != NULL) {
			RTFREE(ro->ro_rt);
			ro->ro_rt = NULL;
		}
		sin->sin_family = AF_INET;
		sin->sin_len = sizeof *sin;
		sin->sin_addr = dst;
		rtalloc_ign(ro, RTF_PRCLONING);
	}

	if (ro->ro_rt == NULL)
		return (NULL);

	ia = ifatoia(ro->ro_rt->rt_ifa);

	if (ro == &sro)
		RTFREE(ro->ro_rt);
	return ia;
}

/*
 * Save incoming source route for use in replies,
 * to be picked up later by ip_srcroute if the receiver is interested.
 */
static void
save_rte(struct mbuf *m, u_char *option, struct in_addr dst)
{
	struct m_tag *mtag;
	struct ip_srcrt_opt *opt;
	unsigned olen;

	mtag = m_tag_get(PACKET_TAG_IPSRCRT, sizeof(*opt), M_NOWAIT);
	if (mtag == NULL)
		return;
	opt = m_tag_data(mtag);

	olen = option[IPOPT_OLEN];
#ifdef DIAGNOSTIC
	if (ipprintfs)
		kprintf("save_rte: olen %d\n", olen);
#endif
	if (olen > sizeof(opt->ip_srcrt) - (1 + sizeof(dst))) {
		m_tag_free(mtag);
		return;
	}
	bcopy(option, opt->ip_srcrt.srcopt, olen);
	opt->ip_nhops = (olen - IPOPT_OFFSET - 1) / sizeof(struct in_addr);
	opt->ip_srcrt.dst = dst;
	m_tag_prepend(m, mtag);
}

/*
 * Retrieve incoming source route for use in replies,
 * in the same form used by setsockopt.
 * The first hop is placed before the options, will be removed later.
 */
struct mbuf *
ip_srcroute(struct mbuf *m0)
{
	struct in_addr *p, *q;
	struct mbuf *m;
	struct m_tag *mtag;
	struct ip_srcrt_opt *opt;

	if (m0 == NULL)
		return NULL;

	mtag = m_tag_find(m0, PACKET_TAG_IPSRCRT, NULL);
	if (mtag == NULL)
		return NULL;
	opt = m_tag_data(mtag);

	if (opt->ip_nhops == 0)
		return (NULL);
	m = m_get(M_NOWAIT, MT_HEADER);
	if (m == NULL)
		return (NULL);

#define	OPTSIZ	(sizeof(opt->ip_srcrt.nop) + sizeof(opt->ip_srcrt.srcopt))

	/* length is (nhops+1)*sizeof(addr) + sizeof(nop + srcrt header) */
	m->m_len = opt->ip_nhops * sizeof(struct in_addr) +
		   sizeof(struct in_addr) + OPTSIZ;
#ifdef DIAGNOSTIC
	if (ipprintfs) {
		kprintf("ip_srcroute: nhops %d mlen %d",
			opt->ip_nhops, m->m_len);
	}
#endif

	/*
	 * First save first hop for return route
	 */
	p = &opt->ip_srcrt.route[opt->ip_nhops - 1];
	*(mtod(m, struct in_addr *)) = *p--;
#ifdef DIAGNOSTIC
	if (ipprintfs)
		kprintf(" hops %x", ntohl(mtod(m, struct in_addr *)->s_addr));
#endif

	/*
	 * Copy option fields and padding (nop) to mbuf.
	 */
	opt->ip_srcrt.nop = IPOPT_NOP;
	opt->ip_srcrt.srcopt[IPOPT_OFFSET] = IPOPT_MINOFF;
	memcpy(mtod(m, caddr_t) + sizeof(struct in_addr), &opt->ip_srcrt.nop,
	    OPTSIZ);
	q = (struct in_addr *)(mtod(m, caddr_t) +
	    sizeof(struct in_addr) + OPTSIZ);
#undef OPTSIZ
	/*
	 * Record return path as an IP source route,
	 * reversing the path (pointers are now aligned).
	 */
	while (p >= opt->ip_srcrt.route) {
#ifdef DIAGNOSTIC
		if (ipprintfs)
			kprintf(" %x", ntohl(q->s_addr));
#endif
		*q++ = *p--;
	}
	/*
	 * Last hop goes to final destination.
	 */
	*q = opt->ip_srcrt.dst;
	m_tag_delete(m0, mtag);
#ifdef DIAGNOSTIC
	if (ipprintfs)
		kprintf(" %x\n", ntohl(q->s_addr));
#endif
	return (m);
}

/*
 * Strip out IP options.
 */
void
ip_stripoptions(struct mbuf *m)
{
	int datalen;
	struct ip *ip = mtod(m, struct ip *);
	caddr_t opts;
	int optlen;

	optlen = (IP_VHL_HL(ip->ip_vhl) << 2) - sizeof(struct ip);
	opts = (caddr_t)(ip + 1);
	datalen = m->m_len - (sizeof(struct ip) + optlen);
	bcopy(opts + optlen, opts, datalen);
	m->m_len -= optlen;
	if (m->m_flags & M_PKTHDR)
		m->m_pkthdr.len -= optlen;
	/* leave ip version intact */
	ip->ip_len = htons(ntohs(ip->ip_len) - optlen);
	ip->ip_vhl = IP_MAKE_VHL(IP_VHL_V(ip->ip_vhl), sizeof(struct ip) >> 2);
}

u_char inetctlerrmap[PRC_NCMDS] = {
	0,		0,		0,		0,
	0,		EMSGSIZE,	EHOSTDOWN,	EHOSTUNREACH,
	EHOSTUNREACH,	EHOSTUNREACH,	ECONNREFUSED,	ECONNREFUSED,
	EMSGSIZE,	EHOSTUNREACH,	0,		0,
	0,		0,		0,		0,
	ENOPROTOOPT,	ECONNREFUSED
};

/*
 * Forward a packet.  If some error occurs return the sender
 * an icmp packet.  Note we can't always generate a meaningful
 * icmp message because icmp doesn't have a large enough repertoire
 * of codes and types.
 *
 * If not forwarding, just drop the packet.  This could be confusing
 * if ipforwarding was zero but some routing protocol was advancing
 * us as a gateway to somewhere.  However, we must let the routing
 * protocol deal with that.
 *
 * The using_srcrt parameter indicates whether the packet is being forwarded
 * via a source route.
 */
void
ip_forward(struct mbuf *m, boolean_t using_srcrt, struct sockaddr_in *next_hop)
{
	struct ip *ip = mtod(m, struct ip *);
	struct rtentry *rt;
	struct route fwd_ro;
	int error, type = 0, code = 0, destmtu = 0;
	struct mbuf *mcopy, *mtemp = NULL;
	n_long dest;
	struct in_addr pkt_dst;

	dest = INADDR_ANY;
	/*
	 * Cache the destination address of the packet; this may be
	 * changed by use of 'ipfw fwd'.
	 */
	pkt_dst = (next_hop != NULL) ? next_hop->sin_addr : ip->ip_dst;

#ifdef DIAGNOSTIC
	if (ipprintfs)
		kprintf("forward: src %x dst %x ttl %x\n",
		       ip->ip_src.s_addr, pkt_dst.s_addr, ip->ip_ttl);
#endif

	if ((m->m_flags & M_HASH) == 0) {
		lwkt_port_t port;

		m = ip_rehashm(m);
		if (m == NULL)
			return;

		port = netisr_hashport(m->m_pkthdr.hash);

		if (port != &curthread->td_msgport) {
			ip_forward_redispatch(port, m, using_srcrt);
			/* Requeued to other msgport; done */
			return;
		}
	}
	if (m->m_flags & (M_BCAST | M_MCAST) || !in_canforward(pkt_dst)) {
		ipstat.ips_cantforward++;
		m_freem(m);
		return;
	}
	if (!ipstealth && ip->ip_ttl <= IPTTLDEC) {
		icmp_error(m, ICMP_TIMXCEED, ICMP_TIMXCEED_INTRANS, dest, 0);
		return;
	}

	bzero(&fwd_ro, sizeof(fwd_ro));
	ip_rtaddr(pkt_dst, &fwd_ro);
	if (fwd_ro.ro_rt == NULL) {
		icmp_error(m, ICMP_UNREACH, ICMP_UNREACH_HOST, dest, 0);
		return;
	}
	rt = fwd_ro.ro_rt;

	if (curthread->td_type == TD_TYPE_NETISR) {
		/*
		 * Save the IP header and at most 8 bytes of the payload,
		 * in case we need to generate an ICMP message to the src.
		 */
		mtemp = ipforward_mtemp[mycpuid];
		KASSERT((mtemp->m_flags & M_EXT) == 0 &&
		    mtemp->m_data == mtemp->m_pktdat &&
		    m_tag_first(mtemp) == NULL,
		    ("ip_forward invalid mtemp1"));

		if (!m_dup_pkthdr(mtemp, m, M_NOWAIT)) {
			/*
			 * It's probably ok if the pkthdr dup fails (because
			 * the deep copy of the tag chain failed), but for now
			 * be conservative and just discard the copy since
			 * code below may some day want the tags.
			 */
			mtemp = NULL;
		} else {
			mtemp->m_type = m->m_type;
			mtemp->m_len = imin((IP_VHL_HL(ip->ip_vhl) << 2) + 8,
					    (int)ntohs(ip->ip_len));
			mtemp->m_pkthdr.len = mtemp->m_len;
			m_copydata(m, 0, mtemp->m_len, mtod(mtemp, void *));
		}
	}

	if (!ipstealth)
		ip->ip_ttl -= IPTTLDEC;

	/*
	 * If forwarding packet using same interface that it came in on,
	 * perhaps should send a redirect to sender to shortcut a hop.
	 * Only send redirect if source is sending directly to us,
	 * and if packet was not source routed (or has any options).
	 * Also, don't send redirect if forwarding using a default route
	 * or a route modified by a redirect.
	 */
	if (rt->rt_ifp == m->m_pkthdr.rcvif &&
	    !(rt->rt_flags & (RTF_DYNAMIC | RTF_MODIFIED)) &&
	    satosin(rt_key(rt))->sin_addr.s_addr != INADDR_ANY &&
	    ipsendredirects && !using_srcrt && next_hop == NULL) {
		u_long src = ntohl(ip->ip_src.s_addr);
		struct in_ifaddr *rt_ifa = (struct in_ifaddr *)rt->rt_ifa;

		if (rt_ifa != NULL &&
		    (src & rt_ifa->ia_subnetmask) == rt_ifa->ia_subnet) {
			if (rt->rt_flags & RTF_GATEWAY)
				dest = satosin(rt->rt_gateway)->sin_addr.s_addr;
			else
				dest = pkt_dst.s_addr;
			/*
			 * Router requirements says to only send
			 * host redirects.
			 */
			type = ICMP_REDIRECT;
			code = ICMP_REDIRECT_HOST;
#ifdef DIAGNOSTIC
			if (ipprintfs)
				kprintf("redirect (%d) to %x\n", code, dest);
#endif
		}
	}

	error = ip_output(m, NULL, &fwd_ro, IP_FORWARDING, NULL, NULL);
	if (error == 0) {
		ipstat.ips_forward++;
		if (type == 0) {
			if (mtemp)
				ipflow_create(&fwd_ro, mtemp);
			goto done;
		}
		ipstat.ips_redirectsent++;
	} else {
		ipstat.ips_cantforward++;
	}

	if (mtemp == NULL)
		goto done;

	/*
	 * Errors that do not require generating ICMP message
	 */
	switch (error) {
	case ENOBUFS:
		/*
		 * A router should not generate ICMP_SOURCEQUENCH as
		 * required in RFC1812 Requirements for IP Version 4 Routers.
		 * Source quench could be a big problem under DoS attacks,
		 * or if the underlying interface is rate-limited.
		 * Those who need source quench packets may re-enable them
		 * via the net.inet.ip.sendsourcequench sysctl.
		 */
		if (!ip_sendsourcequench)
			goto done;
		break;

	case EACCES:			/* ipfw denied packet */
		goto done;
	}

	KASSERT((mtemp->m_flags & M_EXT) == 0 &&
	    mtemp->m_data == mtemp->m_pktdat,
	    ("ip_forward invalid mtemp2"));
	mcopy = m_copym(mtemp, 0, mtemp->m_len, M_NOWAIT);
	if (mcopy == NULL)
		goto done;

	/*
	 * Send ICMP message.
	 */
	switch (error) {
	case 0:				/* forwarded, but need redirect */
		/* type, code set above */
		break;

	case ENETUNREACH:		/* shouldn't happen, checked above */
	case EHOSTUNREACH:
	case ENETDOWN:
	case EHOSTDOWN:
	default:
		type = ICMP_UNREACH;
		code = ICMP_UNREACH_HOST;
		break;

	case EMSGSIZE:
		type = ICMP_UNREACH;
		code = ICMP_UNREACH_NEEDFRAG;
		if (fwd_ro.ro_rt != NULL)
			destmtu = fwd_ro.ro_rt->rt_ifp->if_mtu;
		ipstat.ips_cantfrag++;
		break;

	case ENOBUFS:
		type = ICMP_SOURCEQUENCH;
		code = 0;
		break;

	case EACCES:			/* ipfw denied packet */
		panic("ip_forward EACCES should not reach");
	}
	icmp_error(mcopy, type, code, dest, destmtu);
done:
	if (mtemp != NULL)
		m_tag_delete_chain(mtemp);
	if (fwd_ro.ro_rt != NULL)
		RTFREE(fwd_ro.ro_rt);
}

void
ip_savecontrol(struct inpcb *inp, struct mbuf **mp, struct ip *ip,
	       struct mbuf *m)
{
	if (inp->inp_socket->so_options & SO_TIMESTAMP) {
		struct timeval tv;

		microtime(&tv);
		*mp = sbcreatecontrol(&tv, sizeof(tv),
		    SCM_TIMESTAMP, SOL_SOCKET);
		if (*mp)
			mp = &(*mp)->m_next;
	}
	if (inp->inp_flags & INP_RECVDSTADDR) {
		*mp = sbcreatecontrol(&ip->ip_dst, sizeof(struct in_addr),
		    IP_RECVDSTADDR, IPPROTO_IP);
		if (*mp)
			mp = &(*mp)->m_next;
	}
	if (inp->inp_flags & INP_RECVTTL) {
		*mp = sbcreatecontrol(&ip->ip_ttl, sizeof(u_char),
		    IP_RECVTTL, IPPROTO_IP);
		if (*mp)
			mp = &(*mp)->m_next;
	}
	if (inp->inp_flags & INP_RECVTOS) {
		*mp = sbcreatecontrol(&ip->ip_tos, sizeof(u_char),
		    IP_RECVTOS, IPPROTO_IP);
		if (*mp)
			mp = &(*mp)->m_next;
	}
#ifdef notyet
	/* XXX
	 * Moving these out of udp_input() made them even more broken
	 * than they already were.
	 */
	/* options were tossed already */
	if (inp->inp_flags & INP_RECVOPTS) {
		*mp = sbcreatecontrol(opts_deleted_above,
		    sizeof(struct in_addr), IP_RECVOPTS, IPPROTO_IP);
		if (*mp)
			mp = &(*mp)->m_next;
	}
	/* ip_srcroute doesn't do what we want here, need to fix */
	if (inp->inp_flags & INP_RECVRETOPTS) {
		*mp = sbcreatecontrol(ip_srcroute(m), sizeof(struct in_addr),
		    IP_RECVRETOPTS, IPPROTO_IP);
		if (*mp)
			mp = &(*mp)->m_next;
	}
#endif
	if (inp->inp_flags & INP_RECVIF) {
		struct ifnet *ifp;
		struct sdlbuf {
			struct sockaddr_dl sdl;
			u_char	pad[32];
		} sdlbuf;
		struct sockaddr_dl *sdp;
		struct sockaddr_dl *sdl2 = &sdlbuf.sdl;

		if (((ifp = m->m_pkthdr.rcvif)) &&
		    ((ifp->if_index != 0) && (ifp->if_index <= if_index))) {
			sdp = IF_LLSOCKADDR(ifp);
			/*
			 * Change our mind and don't try copy.
			 */
			if ((sdp->sdl_family != AF_LINK) ||
			    (sdp->sdl_len > sizeof(sdlbuf))) {
				goto makedummy;
			}
			bcopy(sdp, sdl2, sdp->sdl_len);
		} else {
makedummy:
			sdl2->sdl_len =
			    offsetof(struct sockaddr_dl, sdl_data[0]);
			sdl2->sdl_family = AF_LINK;
			sdl2->sdl_index = 0;
			sdl2->sdl_nlen = sdl2->sdl_alen = sdl2->sdl_slen = 0;
		}
		*mp = sbcreatecontrol(sdl2, sdl2->sdl_len,
		    IP_RECVIF, IPPROTO_IP);
		if (*mp)
			mp = &(*mp)->m_next;
	}
}

/*
 * XXX these routines are called from the upper part of the kernel.
 *
 * They could also be moved to ip_mroute.c, since all the RSVP
 *  handling is done there already.
 */
int
ip_rsvp_init(struct socket *so)
{
	if (so->so_type != SOCK_RAW ||
	    so->so_proto->pr_protocol != IPPROTO_RSVP)
		return EOPNOTSUPP;

	if (ip_rsvpd != NULL)
		return EADDRINUSE;

	ip_rsvpd = so;
	/*
	 * This may seem silly, but we need to be sure we don't over-increment
	 * the RSVP counter, in case something slips up.
	 */
	if (!ip_rsvp_on) {
		ip_rsvp_on = 1;
		rsvp_on++;
	}

	return 0;
}

int
ip_rsvp_done(void)
{
	ip_rsvpd = NULL;
	/*
	 * This may seem silly, but we need to be sure we don't over-decrement
	 * the RSVP counter, in case something slips up.
	 */
	if (ip_rsvp_on) {
		ip_rsvp_on = 0;
		rsvp_on--;
	}
	return 0;
}

int
rsvp_input(struct mbuf **mp, int *offp, int proto)
{
	struct mbuf *m = *mp;

	*mp = NULL;

	if (rsvp_input_p) { /* call the real one if loaded */
		*mp = m;
		rsvp_input_p(mp, offp, proto);
		return(IPPROTO_DONE);
	}

	/* Can still get packets with rsvp_on = 0 if there is a local member
	 * of the group to which the RSVP packet is addressed.  But in this
	 * case we want to throw the packet away.
	 */

	if (!rsvp_on) {
		m_freem(m);
		return(IPPROTO_DONE);
	}

	if (ip_rsvpd != NULL) {
		*mp = m;
		rip_input(mp, offp, proto);
		return(IPPROTO_DONE);
	}
	/* Drop the packet */
	m_freem(m);
	return(IPPROTO_DONE);
}