PCBGROUP(9)

๐Ÿ’– PCBGROUP(9) ๐Ÿ’–

okay bestie, sit down, hydrate, and let me tell you about PCBGROUP โ€” aka Distributed Protocol Control Block Groups โ€” straight outta the Kernel Developer's Manual. ๐Ÿซถ

This is kernel-dev territory, so grab a snack, we're going in. ๐Ÿ“


โœจ SYNOPSIS โœจ

options PCBGROUP

#include <sys/param.h>
#include <netinet/in.h>
#include <netinet/in_pcb.h>

void
in_pcbgroup_init(struct inpcbinfo *pcbinfo, u_int hashfields,
      int hash_nelements);

void
in_pcbgroup_destroy(struct inpcbinfo *pcbinfo);

struct inpcbgroup *
in_pcbgroup_byhash(struct inpcbinfo *pcbinfo, u_int hashtype,
      uint32_t hash);

struct inpcbgroup *
in_pcbgroup_byinpcb(struct inpcb *inp);

void
in_pcbgroup_update(struct inpcb *inp);

void
in_pcbgroup_update_mbuf(struct inpcb *inp, struct mbuf *m);

void
in_pcbgroup_remove(struct inpcb *inp);

int
in_pcbgroup_enabled(struct inpcbinfo *pcbinfo);

#include <netinet6/in6_pcb.h>

struct inpcbgroup *
in6_pcbgroup_byhash(struct inpcbinfo *pcbinfo, u_int hashtype,
      uint32_t hash);

๐ŸŒธ DESCRIPTION ๐ŸŒธ

So this implementation introduces the whole notion of affinity for connections, and it distributes work so you get less lock contention โ€” pairing up with hardware work distribution strategies like RSS. ๐Ÿงš

In this construction, connection groups supplement (not replace!!) the existing reservation tables for protocol 4-tuples. What you get instead: CPU-affine lookup tables with minimal cache line migration and minimal lock contention during steady-state operation. It's giving "efficiency, but make it iconic". ๐Ÿ’…

Internet protocols like UDP and TCP register to use connection groups by providing an ipi_hashfields value other than IPI_HASHFIELDS_NONE. That value is what tells the connection group code whether a 2-tuple or a 4-tuple gets used as an argument to the hashes that assign a connection to a particular group. โญ And this has to be aligned with any hardware-offloaded distribution model โ€” like RSS, or similar approaches taken in embedded network boards. No cap.

Wildcard sockets need special handling, as in Willmann 2006, and they're shared between connection groups while being protected by group-local locks. ๐Ÿ”’

Heads up bestie: connection establishment and teardown can be significantly more expensive than without connection groups โ€” but that steady-state processing can be significantly faster. It's a trade, and it's a real one.

Also, super important: enabling PCBGROUP in the kernel only gives you the infrastructure required to create and manage multiple PCB groups. An implementation still needs to fill in a few functions to provide PCB group hash information, in order for PCBs to actually be placed in a PCB group. Like, the scaffolding is there, the vibes are immaculate, but you gotta build the rest yourself. ๐ŸŽ€


๐Ÿฆ‹ Operation ๐Ÿฆ‹

By default, each PCB info block (struct pcbinfo) has a single hash for all PCB entries for the given protocol, with a single lock protecting it. On SMP hardware? Yeah, that can be a significant source of lock contention. ๐Ÿ˜ญ

When a PCBGROUP is created, an array of separate hash tables gets created, each with its own lock. And there's a separate table for wildcard PCBs. By default, a PCBGROUP table is created for each available CPU. ๐Ÿ‘‘

The PCBGROUP code attempts to calculate a hash value from the given PCB or mbuf when looking up a PCBGROUP. While processing a received frame, in_pcbgroup_byhash() can be used together with either:

  • a hardware-provided hash value (e.g. the RSS(9) calculated hash value provided by some NICs), or
  • a software-provided hash value

โ€ฆin order to choose a PCBGROUP table to query. โœจ

A single table lock is held while performing a wildcard match. However โ€” and this is the plot twist โ€” all of the table locks are acquired before modifying the wildcard table.

The PCBGROUP tables operate in conjunction with the normal single PCB list in a PCB info block. So inserting and removing a PCB will still incur the same costs as without PCBGROUP. ๐Ÿ’€ A protocol which uses PCBGROUP should fall back to the normal PCB list lookup if a call to the PCBGROUP layer does not yield a lookup hit.


๐ŸŒˆ Usage ๐ŸŒˆ

Initialize a PCBGROUP in a PCB info block (struct pcbinfo) by calling in_pcbgroup_init(). Easy. Slay. โœจ

Add a connection to a PCBGROUP with in_pcbgroup_update(). Connections are removed by in_pcbgroup_remove(). These in turn will determine which PCBGROUP bucket the given PCB is placed into, and calculate the hash value appropriately. ๐Ÿงฎ

Wildcard PCBs are hashed differently and placed in a single wildcard PCB list. If RSS(9) is enabled and in use, RSS-aware wildcard PCBs are placed in a single PCBGROUP based on RSS information. ๐ŸŒธ

Protocols may look up the PCB entry in a PCBGROUP by using the lookup functions in_pcbgroup_byhash() and in_pcbgroup_byinpcb(). That's the whole toolkit, bestie. ๐Ÿซถ


๐Ÿ’œ IMPLEMENTATION NOTES ๐Ÿ’œ

The PCB code in sys/netinet and sys/netinet6 is aware of PCBGROUP and will call into the PCBGROUP code to do PCBGROUP assignment and lookup, preferring a PCBGROUP lookup to the default global PCB info table. ๐Ÿ‘‘

An implementor wishing to experiment or modify the PCBGROUP assignment should modify this set of functions:

  • in_pcbgroup_getbucket() and in6_pcbgroup_getbucket() โ€” Map a given 32 bit hash value to a PCBGROUP. By default this is hash % number_of_pcbgroups. However, this distribution may not align with NIC receive queues or the netisr(9) configuration. ๐Ÿ™ˆ
  • in_pcbgroup_byhash() and in6_pcbgroup_byhash() โ€” Map a 32 bit hash value and a hash type identifier to a PCBGROUP. By default, this simply returns NULL. This function is used by the mbuf(9) receive path in sys/netinet/in_pcb.c to map an mbuf to a PCBGROUP. ๐ŸŒŸ
  • in_pcbgroup_bytuple() and in6_pcbgroup_bytuple() โ€” Map the source and destination address and port details to a PCBGROUP. By default, this does a very simple XOR hash. This function is used by both the PCB lookup code and as a fallback in the mbuf(9) receive path in sys/netinet/in_pcb.c. ๐ŸŽ€

๐Ÿ‘€ SEE ALSO ๐Ÿ‘€

And the academic baddie herself: Paul Willmann, Scott Rixner, and Alan L. Cox, โ€œAn Evaluation of Network Stack Parallelization Strategies in Modern Operating Systemsโ€, 2006 USENIX Annual Technical Conference, http://www.ece.rice.edu/~willmann/pubs/paranet_usenix.pdf, 2006. ๐Ÿ“šโœจ


๐Ÿ•ฐ๏ธ HISTORY ๐Ÿ•ฐ๏ธ

PCBGROUP first appeared in FreeBSD 9.0. A true icon of an era. ๐Ÿ’–


๐Ÿ‘‘ AUTHORS ๐Ÿ‘‘

The PCBGROUP implementation was written by Robert N. M. Watson <rwatson@FreeBSD.org> under contract to Juniper Networks, Inc. ๐Ÿค

This manual page written by Adrian Chadd <adrian@FreeBSD.org>. ๐Ÿซก


๐Ÿ’€ NOTES ๐Ÿ’€

Real talk, these are the caveats and they're important:
  • The RSS(9) implementation currently uses #ifdef blocks to tie into PCBGROUP. This is a sign that a more abstract programming API is needed. ๐Ÿ‘€
  • There is currently no support for re-balancing the PCBGROUP assignment, nor is there any support for overriding which PCBGROUP a socket/PCB should be in.
  • No statistics are kept to indicate how often PCBGROUP lookups succeed or fail. ๐Ÿ˜ญ

and that's the whole page, bestie โ€” you ate that. this one shipped out of Debian on July 23, 2014, so if you're reading it, know that this manual page is lowkey a vintage. stay curious, read your man pages, and remember: wildcard sockets deserve group-local locks too. ๐Ÿ’…๐Ÿฆ‹๐Ÿ’–

๐Ÿ“ฆ where this page comes from