/* * Bit definitions for priv->s_flags. * These bit flags overload the bit flags defined for the QP's s_flags. * Due to the fact that these bit fields are used only for the QP priv * s_flags, there are no collisions. * * HFI1_S_TID_WAIT_INTERLCK - QP is waiting for requester interlock * HFI1_R_TID_WAIT_INTERLCK - QP is waiting for responder interlock
*/ #define HFI1_S_TID_BUSY_SET BIT(0) /* BIT(1) reserved for RVT_S_BUSY. */ #define HFI1_R_TID_RSC_TIMER BIT(2) /* BIT(3) reserved for RVT_S_RESP_PENDING. */ /* BIT(4) reserved for RVT_S_ACK_PENDING. */ #define HFI1_S_TID_WAIT_INTERLCK BIT(5) #define HFI1_R_TID_WAIT_INTERLCK BIT(6) /* BIT(7) - BIT(15) reserved for RVT_S_WAIT_*. */ /* BIT(16) reserved for RVT_S_SEND_ONE */ #define HFI1_S_TID_RETRY_TIMER BIT(17) /* BIT(18) reserved for RVT_S_ECN. */ #define HFI1_R_TID_SW_PSN BIT(19) /* BIT(26) reserved for HFI1_S_WAIT_HALT */ /* BIT(27) reserved for HFI1_S_WAIT_TID_RESP */ /* BIT(28) reserved for HFI1_S_WAIT_TID_SPACE */
/* * Unlike regular IB RDMA VERBS, which do not require an entry * in the s_ack_queue, TID RDMA WRITE requests do because they * generate responses. * Therefore, the s_ack_queue needs to be extended by a certain * amount. The key point is that the queue needs to be extended * without letting the "user" know so they user doesn't end up * using these extra entries.
*/ #define HFI1_TID_RDMA_WRITE_CNT 8
struct tid_rdma_flow *flows; /* array of tid flows */ struct rvt_sge_state ss; /* SGE state for TID RDMA requests */
u16 n_flows; /* size of the flow buffer window */
u16 setup_head; /* flow index we are setting up */
u16 clear_tail; /* flow index we are clearing */
u16 flow_idx; /* flow index most recently set up */
u16 acked_tail;
u32 seg_len;
u32 total_len;
u32 r_ack_psn; /* next expected ack PSN */
u32 r_flow_psn; /* IB PSN of next segment start */
u32 r_last_acked; /* IB PSN of last ACK'ed packet */
u32 s_next_psn; /* IB PSN of next segment start for read */
u32 total_segs; /* segments required to complete a request */
u32 cur_seg; /* index of current segment */
u32 comp_seg; /* index of last completed segment */
u32 ack_seg; /* index of last ack'ed segment */
u32 alloc_seg; /* index of next segment to be allocated */
u32 isge; /* index of "current" sge */
u32 ack_pending; /* num acks pending for this request */
enum tid_rdma_req_state state;
};
/* * When header suppression is used, PSNs associated with a "flow" are * relevant (and not the PSNs maintained by verbs). Track per-flow * PSNs here for a TID RDMA segment. *
*/ struct flow_state {
u32 flags;
u32 resp_ib_psn; /* The IB PSN of the response for this flow */
u32 generation; /* generation of flow */
u32 spsn; /* starting PSN in TID space */
u32 lpsn; /* last PSN in TID space */
u32 r_next_psn; /* next PSN to be received (in TID space) */
/* For tid rdma read */
u32 ib_spsn; /* starting PSN in Verbs space */
u32 ib_lpsn; /* last PSn in Verbs space */
};
struct tid_rdma_pageset {
dma_addr_t addr : 48; /* Only needed for the first page */
u8 idx: 8;
u8 count : 7;
u8 mapped: 1;
};
/** * kern_tid_node - used for managing TID's in TID groups * * @grp_idx: rcd relative index to tid_group * @map: grp->map captured prior to programming this TID group in HW * @cnt: Only @cnt of available group entries are actually programmed
*/ struct kern_tid_node { struct tid_group *grp;
u8 map;
u8 cnt;
};
/* Overall info for a TID RDMA segment */ struct tid_rdma_flow { /* * While a TID RDMA segment is being transferred, it uses a QP number * from the "KDETH section of QP numbers" (which is different from the * QP number that originated the request). Bits 11-15 of these QP * numbers identify the "TID flow" for the segment.
*/ struct flow_state flow_state; struct tid_rdma_request *req;
u32 tid_qpn;
u32 tid_offset;
u32 length;
u32 sent;
u8 tnode_cnt;
u8 tidcnt;
u8 tid_idx;
u8 idx;
u8 npagesets;
u8 npkts;
u8 pkt;
u8 resync_npkts; struct kern_tid_node tnode[TID_RDMA_MAX_PAGES]; struct tid_rdma_pageset pagesets[TID_RDMA_MAX_PAGES];
u32 tid_entry[TID_RDMA_MAX_PAGES];
};
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.