Home
last modified time | relevance | path

Searched refs:longest (Results 1 – 15 of 15) sorted by relevance

/f-stack/freebsd/contrib/zlib/doc/
H A Dalgorithm.txt25 the longest match is selected.
34 parameter of deflateInit). So deflate() does not always find the longest
68 input less than the length of longest code. It gets that many bits from the
77 be a first level table to cover all the way to the longest code. However,
118 longest symbol is? The reason is that if you do that, you end up spending
161 Table X is two bits long since the longest code starting with 110 is five bits
169 Table Y is three bits long since the longest code starting with 111 is six
H A Drfc1951.txt808 sequence starting at the current point, and selects the longest
/f-stack/freebsd/kern/
H A Dkern_ubsan.c125 typedef __int128 longest; typedef
128 typedef int64_t longest; typedef
260 …rializeNumberSigned(char *pBuffer, size_t zBUfferLength, struct CTypeDescriptor *pType, longest L);
266 static longest llliGetNumber(char *szLocation, struct CTypeDescriptor *pType, unsigned long ulNumbe…
1348 DeserializeNumberSigned(char *pBuffer, size_t zBUfferLength, struct CTypeDescriptor *pType, longest…
1474 static longest
1478 longest L = 0;
1490 memcpy(&L, REINTERPRET_CAST(longest *, ulNumber), sizeof(longest));
1605 longest L = llliGetNumber(szLocation, pType, ulNumber);
/f-stack/freebsd/netgraph/
H A Dng_pipe.c681 int longest = 0; in ngp_rcvdata() local
685 if (ngp_f1->packets > longest) { in ngp_rcvdata()
686 longest = ngp_f1->packets; in ngp_rcvdata()
/f-stack/dpdk/doc/guides/prog_guide/
H A Dlpm_lib.rst85 or the next hop itself if the longest prefix match has already been found.
123 (meaning the lookup process ends at this point, since this is the longest prefix that matches).
152 the longest prefix match with the rule to be deleted, but has shorter prefix.
H A Dlpm6_lib.rst103 or the next hop itself if the longest prefix match has already been found.
130 since this is the longest prefix that matches).
H A Dipsec_lib.rst168 In case of multiple matches, longest matching key will be returned.
H A Dpacket_framework.rst176 … | lookup key; in case of multiple matches, the entry with the longest prefix |
/f-stack/dpdk/doc/guides/sample_app_ug/
H A Dl3_forward.rst79 * ``-L:`` Optional, enable longest prefix match.
H A Dperformance_thread.rst731 is determined by the longest period between context switches of any running
/f-stack/freebsd/contrib/device-tree/src/arm/
H A Dexynos5800-peach-pi.dts1091 * Use longest HW watchdog in SoC (32 seconds) since the hardware
H A Dexynos5420-peach-pit.dts1109 * Use longest HW watchdog in SoC (32 seconds) since the hardware
/f-stack/freebsd/contrib/zstd/doc/
H A Dzstd_compression_format.md1241 The tree depth is 4, since its longest elements uses 4 bits
1242 (longest elements are the one with smallest frequency).
/f-stack/freebsd/contrib/zlib/
H A DChangeLog531 - Add AMD64 assembler code for longest match to contrib [Teterin]
/f-stack/dpdk/doc/guides/testpmd_app_ug/
H A Dtestpmd_funcs.rst4285 information, all the aged flows are sorted by the longest timeout time. For example, if