On 2024-07-28 00:45, Wathsala Wathawana Vithanage wrote:
If your patch are to have non-zero chance of being accepted, it should include
a base implementation based on getrandom() (and the Windows equivalent),
with the proper optimizations (e.g., batching entropy requests to the kernel
on a per-lc
On 2024-07-28 01:55, Stephen Hemminger wrote:
On Sat, 27 Jul 2024 22:27:05 +
Wathsala Wathawana Vithanage wrote:
The answer is to have API's like (rte_csrand) which then call the OS level
primitives. The trust is then passed to the OS. I trust Linus, Theo de Raadt,
and
the rest of the ope
Hi
I am interested to do ipsec encoding and decoding in my dpdk application
From my readings, i understand ipsec can be done one time in the nic (inline
ipsec) or with multiple calls (rte_cryptodev_enqueue_burst,
rte_cryptodev_dequeue_burst)
1. If ipsec is done by nic I only need to cal
On Sun, 28 Jul 2024 08:42:42 +0200
Mattias Rönnblom wrote:
> > 1- An implementation of rte_csrand that calls getrandom() with per-core
> > entropy caching. Which will be the default for DPDK.
> > 2- Build time flag to enable HW CSRNG for those who want to override the
> > default kernel getrand
>
> The Linux kernel in arch/arm64/include/asm/archrandom.h has support
> already. The support includes lots of checks for capabilities and caveats for
> the
> limitations of the ARM implementation that are not reflected in this
> simplistic
> version.
No, such checks are unnecessary, because
(
> > > The answer is to have API's like (rte_csrand) which then call the OS
> > > level primitives. The trust is then passed to the OS. I trust Linus,
> > > Theo de Raadt, and the rest of the open OS community to evaluate and
> > > integrate the best secure random number generator.
> >
> > Perhaps,
This patch addresses the issue by introducing a delay
before acquiring the lock in the loop. This delay allows for better
availability of the lock, ensuring that show_lcore_stats() can
periodically update the statistics even when forwarding jobs are running.
Fixes: 204896f8d66c ("examples/l2fwd-jo
This patch addresses the issue by introducing a delay
before acquiring the lock in the loop. This delay allows for better
availability of the lock, ensuring that show_lcore_stats() can
periodically update the statistics even when forwarding jobs are running.
Fixes: 204896f8d66c ("examples/l2fwd-jo
> ...to have a non-zero chance of getting accepted.
>
I see too much uncertainty in that statement with "non-zero chance". As the
maintainer
of this library and someone with the community's best interest in mind, can you
outline
the requirements for a rte_csrand implementation with a higher deg
On 2024-07-29 08:34, Wathsala Wathawana Vithanage wrote:
...to have a non-zero chance of getting accepted.
I see too much uncertainty in that statement with "non-zero chance". As the
maintainer
of this library and someone with the community's best interest in mind, can you
outline
the requir
10 matches
Mail list logo
