On Wed, Nov 11, 2015 at 11:55:59AM -0800, Alexei Starovoitov wrote: > Therefore things like memory barriers, full set of atomics are not applicable > in bpf world.
There are still plenty of wait-free constructs one can make using them. Say a barrier/rendezvous construct for knowing when an event has happened on all CPUs. But if you really do not want any of that, I suppose that is a valid choice. Is even privileged (e)BPF not allowed things like this? I was thinking the strict no loops stuff was for unpriv (e)BPF only. -- To unsubscribe from this list: send the line "unsubscribe netdev" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
