On Sat, Apr 20, 2024 at 2:09 AM Benjamin Tissoires <bentiss@xxxxxxxxxx> wrote:
>
>
> -static void htab_map_free_timers(struct bpf_map *map)
> +static void htab_map_free_timers_and_wq(struct bpf_map *map)
> {
> struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
>
> - /* We only free timer on uref dropping to zero */
> - if (!btf_record_has_field(htab->map.record, BPF_TIMER))
> - return;
> - if (!htab_is_prealloc(htab))
> - htab_free_malloced_timers(htab);
> - else
> - htab_free_prealloced_timers(htab);
> + /* We only free timer and workqueue on uref dropping to zero */
> + if (btf_record_has_field(htab->map.record, BPF_TIMER)) {
> + if (!htab_is_prealloc(htab))
> + htab_free_malloced_timers_or_wq(htab, true);
> + else
> + htab_free_prealloced_timers(htab);
> + }
> + if (btf_record_has_field(htab->map.record, BPF_WORKQUEUE)) {
> + if (!htab_is_prealloc(htab))
> + htab_free_malloced_timers_or_wq(htab, false);
> + else
> + htab_free_prealloced_wq(htab);
> + }
I missed this earlier, but pls follow up to improve this part.
Double walk of all elements once for timer and 2nd for wq
is inefficient. Better to handle it in one go in prealloc and malloced cases.
Until we have delayed_wq it's quite possible that somebody will
have both timers and wq in map elements.
