| /freebsd/crypto/openssh/ |
| H A D | PROTOCOL.chacha20poly1305 | 1 This document describes the chacha20-poly1305@openssh.com authenticated
5 ----------
12 Poly1305[2], also by Daniel Bernstein, is a one-time Carter-Wegman MAC
13 that computes a 128 bit integrity tag given a message and a single-use
16 The chacha20-poly1305@openssh.com combines these two primitives into an
17 authenticated encryption mode. The construction used is based on that
19 data passed to the MAC and in the addition of encryption of the packet
23 -----------
25 The chacha20-poly1305@openssh.com offers both encryption and
27 chacha20-poly1305@openssh.com cipher is selected in key exchange,
[all …]
|
| /freebsd/share/man/man4/ |
| H A D | le.4 | 3 .\"-
8 .\" at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
47 .Bd -ragged -offset indent
54 .Bd -literal -offset indent
58 For ISA non-PnP adapters, the port address as well as the IRQ and the DRQ
74 driver provides support for Ethernet adapters based on the
78 .Pq CMOS, pin-compatible
85 driver also supports Ethernet adapters based on the
91 family of chips, which are single-chip implementations of a
99 .Tn AMD Am79C970 PCnet-PCI
[all …]
|
| H A D | cc_cdg.4 | 33 CAIA-Delay Gradient (CDG) is a hybrid congestion control algorithm which reacts
34 to both packet loss and inferred queuing delay.
35 It attempts to operate as a delay-based algorithm where possible, but utilises
36 heuristics to detect loss-based TCP cross traffic and will compete effectively
41 During delay-based operation, CDG uses a delay-gradient based probabilistic
43 packet losses and avoid backing off when they occur.
44 During loss-based operation, CDG essentially reverts to
45 .Xr cc_newreno 4 Ns - Ns like
48 CDG switches to loss-based operation when it detects that a configurable number
49 of consecutive delay-based backoffs have had no measurable effect.
[all …]
|
| H A D | cc_hd.4 | 2 .\" Copyright (c) 2010-2011 The FreeBSD Foundation
37 Institute's delay-based congestion control which aims to keep network queuing
40 HD probabilistically reduces the congestion window (cwnd) based on its estimate
45 Loss-based congestion control algorithms such as NewReno probe for network
46 capacity by filling queues until there is a packet loss.
47 HD competes with loss-based congestion control algorithms by allowing its
57 .Bl -tag -width ".Va queue_threshold"
62 Per packet maximum backoff probability as a percentage.
86 .%T "A strategy for fair coexistence of loss and delay-based congestion control algorithms"
91 .%P "555-557"
[all …]
|
| H A D | dummymbuf.4 | 2 .\" SPDX-License-Identifier: BSD-2-Clause
27 .\" Note: The date here should be updated whenever a non-trivial
39 .Bd -ragged -offset indent
46 .Bd -literal -offset indent
57 .Bd -litera
[all...] |
| H A D | sfxge.4 | 1 .\" Copyright (c) 2011-2016 Solarflare Communications Inc.
39 .Bd -ragged -offset indent
46 .Bd -literal -offset indent
52 driver provides support for 10Gb Ethernet adapters based on
57 and Receive Side Scaling (RSS) using MSI-X interrupts.
79 driver supports all 10Gb Ethernet adapters based on Solarflare SFC9000
88 .Bl -tag -width indent
96 The maximum length of the deferred packet
97 .Dq get-list
98 for queued transmit packets (TCP and non-TCP), used only if the transmit
[all …]
|
| H A D | cxgbev.4 | 1 .\" Copyright (c) 2011-2016, Chelsio Inc
37 .Nd "Chelsio T4-, T5-, and T6-based 100Gb, 40Gb, 25Gb, 10Gb, and 1Gb Ethernet VF driver"
42 .Bd -ragged -offset indent
50 .Bd -literal -offset indent
57 based on the Chelsio Terminator 4, Terminator 5, and Terminator 6 ASICs
69 driver uses different names for devices based on the associated ASIC:
70 .Bl -column -offset indent "ASIC" "Port Name"
93 based on the T6 ASIC:
95 .Bl -bullet -compact
97 Chelsio T6225-CR
[all …]
|
| H A D | cc_chd.4 | 2 .\" Copyright (c) 2010-2011 The FreeBSD Foundation
38 It provides tolerance to non-congestion related packet loss and improvements to
39 coexistence with traditional loss-based TCP flows, especially when the
44 probabilistically based on its estimate of the network queuing delay.
47 .Bl -bullet
53 Packet losses that occur while the queuing delay is less than queue_threshold
57 competing with loss-based TCP flows.
65 .Bl -tag -width ".Va queue_threshold"
101 .%T "Improved coexistence and loss tolerance for delay based TCP congestion control"
104 .%P "24-31"
[all …]
|
| /freebsd/contrib/libpcap/ |
| H A D | README.md | 3 **To report a security issue please send an e-mail to security@tcpdump.org.**
14 https://github.com/the-tcpdump-group/libpcap.git
16 This directory contains source code for libpcap, a system-independent
17 interface for user-level packet capture. libpcap provides a portable
18 framework for low-level network monitoring. Applications include
21 for packet capture, and since we've developed several tools that
22 require this functionality, we've created this system-independent API
24 system-dependent packet capture modules in each application.
29 ftp://ftp.ee.lbl.gov/old/libpcap-0.4a7.tar.Z
34 with the OS's interface for packet capture on those platforms, such as
[all …]
|
| /freebsd/share/doc/smm/18.net/ |
| H A D | c.t | 53 occurs must kept small compared to the average inter-packet
104 based on the amount of space in the associated socket queues. That
105 is, send windows are calculated based on the amount of free space
107 based on the amount of data awaiting transmission in the send queue.
125 incoming packet can be calculated so that an acceptable
126 ``packet handling rate''
128 adjusted based on a host's network load and the number of packets
134 Packet forwarding
138 any other problems encountered during packet forwarding are also
|
| H A D | a.t | 42 gatewaying and packet routing become very important. Certain
52 This section will describe the facilities provided for packet
60 packet to its destination. These tables are of the form:
70 struct ifnet *rt_ifp; /* interface to give packet to */
78 for both broadcast and multi-drop type networks, and
79 also for networks built from point-to-point links (e.g
83 Two 32-bit hash values are calculated by routines defined for
84 each address family; one based on the destination being
88 hash table size) and the entire 32-bit value is then
101 a gateway to which to send the packet,
[all …]
|
| /freebsd/contrib/tcpdump/ |
| H A D | print-ipcomp.c | 26 #include "netdissect-stdinc.h"
43 ndo->ndo_protocol = "ipcomp"; in ipcomp_print()
45 cpi = GET_BE_U_2(ipcomp->comp_cpi); in ipcomp_print()
50 * XXX - based on the CPI, we could decompress the packet here. in ipcomp_print()
51 * Packet buffer management is a headache (if we decompress, in ipcomp_print()
52 * packet will become larger). in ipcomp_print()
54 * We would decompress the packet and then call a routine that, in ipcomp_print()
55 * based on ipcomp->comp_nxt, dissects the decompressed data. in ipcomp_print()
57 * Until we do that, however, we just return -1, so that in ipcomp_print()
59 * stops - there's nothing more it can do with a compressed in ipcomp_print()
|
| /freebsd/sbin/routed/ |
| H A D | radix.h | 1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
45 short rn_b; /* bit offset; -1-index(netmask) */
82 short rm_b; /* bit offset; -1-index(netmask) */
99 rn_mkfreelist = (m)->rm_mklist; \
103 #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
109 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
112 struct radix_node *(*rnh_addpkt) /* add based on packet hdr */
115 struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */
117 struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */
[all …]
|
| /freebsd/sbin/natd/ |
| H A D | README | 7 This is a simple daemon based on FreeBSD divert sockets
10 It is based on packet aliasing package (see README.alias)
19 1) Get FreeBSD 2.2 - I think the divert sockets are
38 Charles Mott <cm@linktel.net> Packet aliasing engine
39 Eivind Eklund <eivind@dimaga.com> Packet aliasing engine
44 Happy Networking - comments and fixes are welcome!
|
| /freebsd/share/man/man5/ |
| H A D | pf.conf.5 | 10 .\" - Redistributions of source code must retain the above copyright
12 .\" - Redistributions in binary form must reproduce the above
35 .Nd packet filter configuration file
39 packet filter modifies, drops or passes packets according to rules or
45 .Bl -tag -width xxxx
47 User-defined variables may be defined and used later, simplifying
55 Options tune the behaviour of the packet filtering engine.
57 Ethernet filtering provides rule-based blocking or passing of Ethernet packets.
62 Queueing provides rule-based bandwidth control.
66 .It Cm Packet Filtering
[all …]
|
| /freebsd/share/doc/IPv6/ |
| H A D | IMPLEMENTATION | 9 applicable to KAME-integrated *BSD releases, as we have certain amount
11 KAME-integrated *BSD releases.
23 1.4.1 Assignment of link-local, and special addresses
59 2.1 FreeBSD 2.2.x-RELEASE
62 2.4 FreeBSD 3.x-RELEASE
63 2.5 FreeBSD 4.x-RELEASE
68 3.2 IPv6-to-IPv4 header translator
79 4.8.2 draft-touch-ipsec-vpn approach
94 below (NOTE: this is not a complete list - this is too hard to maintain...).
110 * KAME-supplied route6d, bgpd and hroute6d support this.
[all …]
|
| /freebsd/contrib/processor-trace/libipt/internal/include/ |
| H A D | pt_tnt_cache.h | 2 * Copyright (c) 2013-2019, Intel Corporation
60 * Returns -pte_invalid if @cache is NULL.
70 * Returns -pte_invalid if @cache is NULL.
71 * Returns -pte_bad_query if there is no tnt cached.
75 /* Update the tnt cache based on Intel PT packets.
77 * Updates @cache based on @packet and, if non-null, @config.
80 * Returns -pte_invalid if @cache or @packet is NULL.
81 * Returns -pte_bad_packet if @packet appears to be corrupted.
82 * Returns -pte_bad_context if the tnt cache is not empty.
85 const struct pt_packet_tnt *packet,
|
| H A D | pt_time.h | 2 * Copyright (c) 2014-2019, Intel Corporation
68 /* A flag saying whether we have seen a TSC packet. */
71 /* A flag saying whether we have seen a CBR packet. */
74 /* A flag saying whether we have seen a TMA packet. */
77 /* A flag saying whether we have seen a MTC packet. */
92 * Returns -pte_internal if @tsc or @time is NULL.
93 * Returns -pte_no_time if there has not been a TSC packet.
103 * Returns -pte_internal if @cbr or @time is NULL.
104 * Returns -pte_no_cbr if there has not been a CBR packet.
108 /* Update the time based on an Intel PT packet.
[all …]
|
| /freebsd/usr.sbin/cxgbetool/ |
| H A D | cxgbetool.8 | 40 .Bl -item -compact
47 .Nm Ar nexus Cm clip Bro Cm hold | release Brc Ar ipv6-address
55 .Nm Ar nexus Cm hashfilter Ar filter-specification
63 .Nm Ar nexus Cm filter Ar idx Ar filter-specification
71 .Nm Ar nexus Cm loadcfg Ar fw-config.txt
75 .Nm Ar nexus Cm loadfw Ar fw-image.bin
85 .Nm Ar nexus Cm regdump Op Ar register-block ...
87 .Nm Ar nexus Cm sched-class Ar sub-command Op Ar param Ar value
89 .Nm Ar nexus Cm sched-queue Ar port Ar queue Ar class
97 provides command-line access to features and debug facilities exported by
[all …]
|
| /freebsd/sys/contrib/dev/athk/ath12k/ |
| H A D | rx_desc.h | 1 /* SPDX-License-Identifier: BSD-3-Clause-Clear */
3 * Copyright (c) 2018-2021 The Linux Foundation. All rights reserved.
4 * Copyright (c) 2021-2022 Qualcomm Innovation Center, Inc. All rights reserved.
169 * Indication to Rx OLE to enable REO destination routing based
200 * If set, WDS learning detection based on SA search and notification
202 * field in address search failure cache-only entry should
206 * If set, intra-BSS routing detection is enabled
213 * buffers shall be disabled based on an RXDMA configuration,
223 * host SW/accelerator subsystem that also handles packet
224 * uffer management for WiFi-to-PPE routing.
[all …]
|
| /freebsd/sbin/ipf/ipf/ |
| H A D | ipf.5 | 3 ipf, ipf.conf \- IPFilter firewall rules file format
5 The ipf.conf file is used to specify rules for the firewall, packet
6 authentication and packet accounting components of IPFilter. To load rules
26 the direction of the packet (in or out)
69 of a packet that matches it will be. Descriptions of the many and various
70 sections that can be used to match on the contents of packet headers will
77 rules that match a packet indicate to ipfilter that it should be
81 rules are used when it is desirable to prevent a packet from going
86 when IPFilter successfully matches a packet against a log rule a log
88 have no impact on whether or not a packet is allowed through or not.
[all …]
|
| /freebsd/sys/netpfil/ipfw/ |
| H A D | dn_aqm_codel.h | 2 * Codel - The Controlled-Delay Active Queue Management algorithm.
8 * Implemented by Rasool Al-Saadi <ralsaadi@swin.edu.au>
10 * Copyright (C) 2011-2014 Kathleen Nichols <nichols@pollere.com>.
71 uint16_t maxpkt_size; /* max packet size seen so far */
89 cst = q->aqm_status; in codel_dodequeue()
92 /* queue is empty - we can't be above target */ in codel_dodequeue()
93 cst->first_above_time= 0; in codel_dodequeue()
97 cprms = q->fs->aqmcfg; in codel_dodequeue()
100 * different AQMs in parallel. One is sojourn-time-based in codel_dodequeue()
101 * and takes effect when the time to send an MTU-sized in codel_dodequeue()
[all …]
|
| H A D | dn_sched_fq_codel_helper.h | 2 * Codel - The Controlled-Delay Active Queue Management algorithm.
8 * Implemented by Rasool Al-Saadi <ralsaadi@swin.edu.au>
10 * Copyright (C) 2011-2014 Kathleen Nichols <nichols@pollere.com>.
55 struct fq_codel_schk *schk = (struct fq_codel_schk *)(si->_si.sched+1); in fqc_dodequeue()
62 /*queue is empty - we can't be above target*/ in fqc_dodequeue()
63 q->cst.first_above_time= 0; in fqc_dodequeue()
68 * different AQMs in parallel. One is sojourn-time-based in fqc_dodequeue()
69 * and takes effect when the time to send an MTU-sized in fqc_dodequeue()
70 * packet is less than target. The 1st term of the "if" in fqc_dodequeue()
71 * below does this. The other is backlog-based and takes in fqc_dodequeue()
[all …]
|
| /freebsd/sbin/ping/ |
| H A D | ping.8 | 58 .Ar IPv4-host
77 .Ar IPv4-mcast-group
96 .Op Ar IPv6-hops ...
97 .Ar IPv6-host
102 .Ar ( IPv4-host
104 .Ar IPv4-mcast-group )
121 bytes used to fill out the packet.
124 .Ar ( IPv6-host ) ,
148 For backwards-compatibility, ICMPv6 can also be selected by invoking the binary
152 .Bl -tag -width indent
[all …]
|
| /freebsd/share/doc/smm/12.timed/ |
| H A D | timed.ms | 45 Command under contract No. N00039-84-C-0089, and by the Italian CSELT
53 .OH 'The Berkeley UNIX Time Synchronization Protocol''SMM:12-%'
54 .EH 'SMM:12-%''The Berkeley UNIX Time Synchronization Protocol'
64 is based on a master slave scheme.
77 (one per machine) and is based on a master-slave
117 terminate (for example, because of a run-time error), or the network be
151 All fields are based upon 8-bit bytes. Fields should be sent in
163 Eight bytes of packet specific data. This field contains two 4 byte time
165 of the packet.
167 A zero-terminated string of up to 256 \s-2ASCII\s+2 characters with the name of
[all …]
|