STRUCT ISCSI_CID_QUEUE(9)
π struct iscsi_cid_queue β the Kernel API Manual glow-up
okay bestie, so this is struct iscsi_cid_queue(9) from the Kernel API Manual, and it's basically the per-adapter bookkeeping situation for iSCSI CIDs. lowkey iconic. let's get into it π
β¨ NAME β¨
struct iscsi_cid_queue β the per adapter iscsi cid queue. that's it, that's the whole vibe π¦
β¨ SYNOPSIS β¨
here's the whole struct, copied exactly, no cap:
struct iscsi_cid_queue {
void *cid_que_base;
u32 *cid_que;
u32 cid_q_prod_idx;
u32 cid_q_cons_idx;
u32 cid_q_max_idx;
u32 cid_free_cnt;
struct qedi_conn **conn_cid_tbl;
};
πΈ Members πΈ
these are the fields, and yes every single one matters π
cid_que_baseβ the queue base memory. it's avoid *, so it's giving mysterious main character energy β¨cid_queβ the queue memory pointer, au32 *. this is the actual pointer-pointer situation, iykykcid_q_prod_idxβ the produce index πcid_q_cons_idxβ the consumer index π«Άcid_q_max_idxβ the max index. it's used to detect the wrap around condition π (yes bestie, wrap-around detection is real and it's doing the most)cid_free_cntβ the queue size πconn_cid_tblβ the iscsi cid to conn structure mapping table. it's astruct qedi_conn **, so like, a table of pointers to pointers to conns. table-ception fr fr π
π Description π
Per adapter iSCSI CID Queue. that's the whole description and honestly? slay. short, sweet, to the point. π
β SEE ALSO β
- the kernel file
./drivers/scsi/qedi/qedi.hβ go read it bestie, it's right there π₯
ngl this page is a little brief, but that's just how the kernel docs roll sometimes. no invented lore, no extra claims β we keep it exactly as the source says. π
and that's the page!! brought to you by ./drivers/scsi/qedi, October 2026 edition, from the Kernel API Manual. drink some water, hydrate, and go map some cids to conns π§ πβ¨
π¦ where this page comes from
- nixpkgs unstable: linux-manual 7.3.1
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms