STRUCT LIBETH_XSKFQ(9)

πŸ“¦ version 7.3.1, in nixpkgs unstable

πŸ’– NAME πŸ’–

okay so <pink>struct libeth_xskfq</pink> β€” it's a struct, it's giving "structure representing an XSk buffer (fill) queue", literally that's the whole vibe, that's the whole point of it, bestie πŸŽ€

This is a page from the Kernel API Manual (section 9), so like… kernel-internal lore, iykyk ✨


πŸ¦‹ SYNOPSIS πŸ¦‹

struct libeth_xskfq {
    struct {
      struct xsk_buff_pool    *pool;
      struct libeth_xdp_buff  **fqes;
      void *descs;
      u32 ntu;
      u32 count;
    };
    u32 pending;
    u32 thresh;
    u32 buf_len;
    u32 truesize;
    int nid;
 };

no cap, that's the whole shape of it πŸ‘‘


🌸 Members 🌸

  • {unnamed_struct} β€” anonymous. she has no name. she's mysterious. main character energy tbh πŸ™ˆ
  • pool β€” the xsk_buff_pool that handles buffer management for her πŸ’…
  • fqes β€” an array of XSk buffer pointers, cute little collection ✨
  • descs β€” opaque pointer to the HW descriptor array (opaque = don't ask, she's not telling) 🫢
  • ntu β€” index of the next buffer to poll. the next one. keep up, bestie ⭐
  • count β€” number of descriptors/buffers the queue has, like the headcount at a party πŸŽ€
  • pending β€” current number of XSkFQEs to refill (the to-do list, lowkey) πŸ¦‹
  • thresh β€” threshold below which the queue is refilled. cross it and she restocks, periodt πŸ”₯
  • buf_len β€” HW-writeable length per each buffer πŸ“
  • truesize β€” step between consecutive buffers, and it's 0 if none exists πŸ’€
  • nid β€” ID of the closest NUMA node with memory. proximity is everything, ngl 🌈

πŸ‘‘ SEE ALSO πŸ‘‘

Kernel file ./include/net/libeth/xsk.h β€” and honestly the whole friend group, all of them, no one left out:


that's the whole page, bestie, you ate that πŸ’…βœ¨

sign-off szn: this iconic little number lives at ./include/net/libeth and it was dated October 2026 πŸ—“οΈπŸ’– mwah, go read the source, ily 🫢🌸

πŸ“¦ where this page comes from