2 * Copyright(c) 2016 Intel Corporation.
4 * This file is provided under a dual BSD/GPLv2 license. When using or
5 * redistributing this file, you may do so under either license.
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of version 2 of the GNU General Public License as
11 * published by the Free Software Foundation.
13 * This program is distributed in the hope that it will be useful, but
14 * WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * General Public License for more details.
20 * Redistribution and use in source and binary forms, with or without
21 * modification, are permitted provided that the following conditions
24 * - Redistributions of source code must retain the above copyright
25 * notice, this list of conditions and the following disclaimer.
26 * - Redistributions in binary form must reproduce the above copyright
27 * notice, this list of conditions and the following disclaimer in
28 * the documentation and/or other materials provided with the
30 * - Neither the name of Intel Corporation nor the names of its
31 * contributors may be used to endorse or promote products derived
32 * from this software without specific prior written permission.
34 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
35 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
36 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
37 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
38 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
39 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
40 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
41 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
42 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
43 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
44 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
47 #if !defined(__RVT_TRACE_CQ_H) || defined(TRACE_HEADER_MULTI_READ)
48 #define __RVT_TRACE_CQ_H
50 #include <linux/tracepoint.h>
51 #include <linux/trace_seq.h>
53 #include <rdma/ib_verbs.h>
54 #include <rdma/rdmavt_cq.h>
57 #define TRACE_SYSTEM rvt_cq
59 #define wc_opcode_name(opcode) { IB_WC_##opcode, #opcode }
60 #define show_wc_opcode(opcode) \
61 __print_symbolic(opcode, \
62 wc_opcode_name(SEND), \
63 wc_opcode_name(RDMA_WRITE), \
64 wc_opcode_name(RDMA_READ), \
65 wc_opcode_name(COMP_SWAP), \
66 wc_opcode_name(FETCH_ADD), \
67 wc_opcode_name(LSO), \
68 wc_opcode_name(LOCAL_INV), \
69 wc_opcode_name(REG_MR), \
70 wc_opcode_name(MASKED_COMP_SWAP), \
71 wc_opcode_name(RECV), \
72 wc_opcode_name(RECV_RDMA_WITH_IMM))
75 "[%s] idx %u wr_id %llx status %u opcode %u,%s length %u qpn %x"
78 rvt_cq_entry_template
,
79 TP_PROTO(struct rvt_cq
*cq
, struct ib_wc
*wc
, u32 idx
),
82 RDI_DEV_ENTRY(cq
->rdi
)
91 RDI_DEV_ASSIGN(cq
->rdi
)
92 __entry
->wr_id
= wc
->wr_id
;
93 __entry
->status
= wc
->status
;
94 __entry
->opcode
= wc
->opcode
;
95 __entry
->length
= wc
->byte_len
;
96 __entry
->qpn
= wc
->qp
->qp_num
;
105 __entry
->opcode
, show_wc_opcode(__entry
->opcode
),
112 rvt_cq_entry_template
, rvt_cq_enter
,
113 TP_PROTO(struct rvt_cq
*cq
, struct ib_wc
*wc
, u32 idx
),
114 TP_ARGS(cq
, wc
, idx
));
117 rvt_cq_entry_template
, rvt_cq_poll
,
118 TP_PROTO(struct rvt_cq
*cq
, struct ib_wc
*wc
, u32 idx
),
119 TP_ARGS(cq
, wc
, idx
));
121 #endif /* __RVT_TRACE_CQ_H */
123 #undef TRACE_INCLUDE_PATH
124 #undef TRACE_INCLUDE_FILE
125 #define TRACE_INCLUDE_PATH .
126 #define TRACE_INCLUDE_FILE trace_cq
127 #include <trace/define_trace.h>