1*4882a593Smuzhiyun #ifndef _HFI1_EXP_RCV_H
2*4882a593Smuzhiyun #define _HFI1_EXP_RCV_H
3*4882a593Smuzhiyun /*
4*4882a593Smuzhiyun * Copyright(c) 2017 Intel Corporation.
5*4882a593Smuzhiyun *
6*4882a593Smuzhiyun * This file is provided under a dual BSD/GPLv2 license. When using or
7*4882a593Smuzhiyun * redistributing this file, you may do so under either license.
8*4882a593Smuzhiyun *
9*4882a593Smuzhiyun * GPL LICENSE SUMMARY
10*4882a593Smuzhiyun *
11*4882a593Smuzhiyun * This program is free software; you can redistribute it and/or modify
12*4882a593Smuzhiyun * it under the terms of version 2 of the GNU General Public License as
13*4882a593Smuzhiyun * published by the Free Software Foundation.
14*4882a593Smuzhiyun *
15*4882a593Smuzhiyun * This program is distributed in the hope that it will be useful, but
16*4882a593Smuzhiyun * WITHOUT ANY WARRANTY; without even the implied warranty of
17*4882a593Smuzhiyun * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18*4882a593Smuzhiyun * General Public License for more details.
19*4882a593Smuzhiyun *
20*4882a593Smuzhiyun * BSD LICENSE
21*4882a593Smuzhiyun *
22*4882a593Smuzhiyun * Redistribution and use in source and binary forms, with or without
23*4882a593Smuzhiyun * modification, are permitted provided that the following conditions
24*4882a593Smuzhiyun * are met:
25*4882a593Smuzhiyun *
26*4882a593Smuzhiyun * - Redistributions of source code must retain the above copyright
27*4882a593Smuzhiyun * notice, this list of conditions and the following disclaimer.
28*4882a593Smuzhiyun * - Redistributions in binary form must reproduce the above copyright
29*4882a593Smuzhiyun * notice, this list of conditions and the following disclaimer in
30*4882a593Smuzhiyun * the documentation and/or other materials provided with the
31*4882a593Smuzhiyun * distribution.
32*4882a593Smuzhiyun * - Neither the name of Intel Corporation nor the names of its
33*4882a593Smuzhiyun * contributors may be used to endorse or promote products derived
34*4882a593Smuzhiyun * from this software without specific prior written permission.
35*4882a593Smuzhiyun *
36*4882a593Smuzhiyun * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
37*4882a593Smuzhiyun * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
38*4882a593Smuzhiyun * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
39*4882a593Smuzhiyun * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
40*4882a593Smuzhiyun * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
41*4882a593Smuzhiyun * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
42*4882a593Smuzhiyun * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
43*4882a593Smuzhiyun * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
44*4882a593Smuzhiyun * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
45*4882a593Smuzhiyun * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
46*4882a593Smuzhiyun * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
47*4882a593Smuzhiyun *
48*4882a593Smuzhiyun */
49*4882a593Smuzhiyun
50*4882a593Smuzhiyun #include "hfi.h"
51*4882a593Smuzhiyun
52*4882a593Smuzhiyun #define EXP_TID_SET_EMPTY(set) (set.count == 0 && list_empty(&set.list))
53*4882a593Smuzhiyun
54*4882a593Smuzhiyun #define EXP_TID_TIDLEN_MASK 0x7FFULL
55*4882a593Smuzhiyun #define EXP_TID_TIDLEN_SHIFT 0
56*4882a593Smuzhiyun #define EXP_TID_TIDCTRL_MASK 0x3ULL
57*4882a593Smuzhiyun #define EXP_TID_TIDCTRL_SHIFT 20
58*4882a593Smuzhiyun #define EXP_TID_TIDIDX_MASK 0x3FFULL
59*4882a593Smuzhiyun #define EXP_TID_TIDIDX_SHIFT 22
60*4882a593Smuzhiyun #define EXP_TID_GET(tid, field) \
61*4882a593Smuzhiyun (((tid) >> EXP_TID_TID##field##_SHIFT) & EXP_TID_TID##field##_MASK)
62*4882a593Smuzhiyun
63*4882a593Smuzhiyun #define EXP_TID_SET(field, value) \
64*4882a593Smuzhiyun (((value) & EXP_TID_TID##field##_MASK) << \
65*4882a593Smuzhiyun EXP_TID_TID##field##_SHIFT)
66*4882a593Smuzhiyun #define EXP_TID_CLEAR(tid, field) ({ \
67*4882a593Smuzhiyun (tid) &= ~(EXP_TID_TID##field##_MASK << \
68*4882a593Smuzhiyun EXP_TID_TID##field##_SHIFT); \
69*4882a593Smuzhiyun })
70*4882a593Smuzhiyun #define EXP_TID_RESET(tid, field, value) do { \
71*4882a593Smuzhiyun EXP_TID_CLEAR(tid, field); \
72*4882a593Smuzhiyun (tid) |= EXP_TID_SET(field, (value)); \
73*4882a593Smuzhiyun } while (0)
74*4882a593Smuzhiyun
75*4882a593Smuzhiyun /*
76*4882a593Smuzhiyun * Define fields in the KDETH header so we can update the header
77*4882a593Smuzhiyun * template.
78*4882a593Smuzhiyun */
79*4882a593Smuzhiyun #define KDETH_OFFSET_SHIFT 0
80*4882a593Smuzhiyun #define KDETH_OFFSET_MASK 0x7fff
81*4882a593Smuzhiyun #define KDETH_OM_SHIFT 15
82*4882a593Smuzhiyun #define KDETH_OM_MASK 0x1
83*4882a593Smuzhiyun #define KDETH_TID_SHIFT 16
84*4882a593Smuzhiyun #define KDETH_TID_MASK 0x3ff
85*4882a593Smuzhiyun #define KDETH_TIDCTRL_SHIFT 26
86*4882a593Smuzhiyun #define KDETH_TIDCTRL_MASK 0x3
87*4882a593Smuzhiyun #define KDETH_INTR_SHIFT 28
88*4882a593Smuzhiyun #define KDETH_INTR_MASK 0x1
89*4882a593Smuzhiyun #define KDETH_SH_SHIFT 29
90*4882a593Smuzhiyun #define KDETH_SH_MASK 0x1
91*4882a593Smuzhiyun #define KDETH_KVER_SHIFT 30
92*4882a593Smuzhiyun #define KDETH_KVER_MASK 0x3
93*4882a593Smuzhiyun #define KDETH_JKEY_SHIFT 0x0
94*4882a593Smuzhiyun #define KDETH_JKEY_MASK 0xff
95*4882a593Smuzhiyun #define KDETH_HCRC_UPPER_SHIFT 16
96*4882a593Smuzhiyun #define KDETH_HCRC_UPPER_MASK 0xff
97*4882a593Smuzhiyun #define KDETH_HCRC_LOWER_SHIFT 24
98*4882a593Smuzhiyun #define KDETH_HCRC_LOWER_MASK 0xff
99*4882a593Smuzhiyun
100*4882a593Smuzhiyun #define KDETH_GET(val, field) \
101*4882a593Smuzhiyun (((le32_to_cpu((val))) >> KDETH_##field##_SHIFT) & KDETH_##field##_MASK)
102*4882a593Smuzhiyun #define KDETH_SET(dw, field, val) do { \
103*4882a593Smuzhiyun u32 dwval = le32_to_cpu(dw); \
104*4882a593Smuzhiyun dwval &= ~(KDETH_##field##_MASK << KDETH_##field##_SHIFT); \
105*4882a593Smuzhiyun dwval |= (((val) & KDETH_##field##_MASK) << \
106*4882a593Smuzhiyun KDETH_##field##_SHIFT); \
107*4882a593Smuzhiyun dw = cpu_to_le32(dwval); \
108*4882a593Smuzhiyun } while (0)
109*4882a593Smuzhiyun
110*4882a593Smuzhiyun #define KDETH_RESET(dw, field, val) ({ dw = 0; KDETH_SET(dw, field, val); })
111*4882a593Smuzhiyun
112*4882a593Smuzhiyun /* KDETH OM multipliers and switch over point */
113*4882a593Smuzhiyun #define KDETH_OM_SMALL 4
114*4882a593Smuzhiyun #define KDETH_OM_SMALL_SHIFT 2
115*4882a593Smuzhiyun #define KDETH_OM_LARGE 64
116*4882a593Smuzhiyun #define KDETH_OM_LARGE_SHIFT 6
117*4882a593Smuzhiyun #define KDETH_OM_MAX_SIZE (1 << ((KDETH_OM_LARGE / KDETH_OM_SMALL) + 1))
118*4882a593Smuzhiyun
119*4882a593Smuzhiyun struct tid_group {
120*4882a593Smuzhiyun struct list_head list;
121*4882a593Smuzhiyun u32 base;
122*4882a593Smuzhiyun u8 size;
123*4882a593Smuzhiyun u8 used;
124*4882a593Smuzhiyun u8 map;
125*4882a593Smuzhiyun };
126*4882a593Smuzhiyun
127*4882a593Smuzhiyun /*
128*4882a593Smuzhiyun * Write an "empty" RcvArray entry.
129*4882a593Smuzhiyun * This function exists so the TID registaration code can use it
130*4882a593Smuzhiyun * to write to unused/unneeded entries and still take advantage
131*4882a593Smuzhiyun * of the WC performance improvements. The HFI will ignore this
132*4882a593Smuzhiyun * write to the RcvArray entry.
133*4882a593Smuzhiyun */
rcv_array_wc_fill(struct hfi1_devdata * dd,u32 index)134*4882a593Smuzhiyun static inline void rcv_array_wc_fill(struct hfi1_devdata *dd, u32 index)
135*4882a593Smuzhiyun {
136*4882a593Smuzhiyun /*
137*4882a593Smuzhiyun * Doing the WC fill writes only makes sense if the device is
138*4882a593Smuzhiyun * present and the RcvArray has been mapped as WC memory.
139*4882a593Smuzhiyun */
140*4882a593Smuzhiyun if ((dd->flags & HFI1_PRESENT) && dd->rcvarray_wc) {
141*4882a593Smuzhiyun writeq(0, dd->rcvarray_wc + (index * 8));
142*4882a593Smuzhiyun if ((index & 3) == 3)
143*4882a593Smuzhiyun flush_wc();
144*4882a593Smuzhiyun }
145*4882a593Smuzhiyun }
146*4882a593Smuzhiyun
tid_group_add_tail(struct tid_group * grp,struct exp_tid_set * set)147*4882a593Smuzhiyun static inline void tid_group_add_tail(struct tid_group *grp,
148*4882a593Smuzhiyun struct exp_tid_set *set)
149*4882a593Smuzhiyun {
150*4882a593Smuzhiyun list_add_tail(&grp->list, &set->list);
151*4882a593Smuzhiyun set->count++;
152*4882a593Smuzhiyun }
153*4882a593Smuzhiyun
tid_group_remove(struct tid_group * grp,struct exp_tid_set * set)154*4882a593Smuzhiyun static inline void tid_group_remove(struct tid_group *grp,
155*4882a593Smuzhiyun struct exp_tid_set *set)
156*4882a593Smuzhiyun {
157*4882a593Smuzhiyun list_del_init(&grp->list);
158*4882a593Smuzhiyun set->count--;
159*4882a593Smuzhiyun }
160*4882a593Smuzhiyun
tid_group_move(struct tid_group * group,struct exp_tid_set * s1,struct exp_tid_set * s2)161*4882a593Smuzhiyun static inline void tid_group_move(struct tid_group *group,
162*4882a593Smuzhiyun struct exp_tid_set *s1,
163*4882a593Smuzhiyun struct exp_tid_set *s2)
164*4882a593Smuzhiyun {
165*4882a593Smuzhiyun tid_group_remove(group, s1);
166*4882a593Smuzhiyun tid_group_add_tail(group, s2);
167*4882a593Smuzhiyun }
168*4882a593Smuzhiyun
tid_group_pop(struct exp_tid_set * set)169*4882a593Smuzhiyun static inline struct tid_group *tid_group_pop(struct exp_tid_set *set)
170*4882a593Smuzhiyun {
171*4882a593Smuzhiyun struct tid_group *grp =
172*4882a593Smuzhiyun list_first_entry(&set->list, struct tid_group, list);
173*4882a593Smuzhiyun list_del_init(&grp->list);
174*4882a593Smuzhiyun set->count--;
175*4882a593Smuzhiyun return grp;
176*4882a593Smuzhiyun }
177*4882a593Smuzhiyun
rcventry2tidinfo(u32 rcventry)178*4882a593Smuzhiyun static inline u32 rcventry2tidinfo(u32 rcventry)
179*4882a593Smuzhiyun {
180*4882a593Smuzhiyun u32 pair = rcventry & ~0x1;
181*4882a593Smuzhiyun
182*4882a593Smuzhiyun return EXP_TID_SET(IDX, pair >> 1) |
183*4882a593Smuzhiyun EXP_TID_SET(CTRL, 1 << (rcventry - pair));
184*4882a593Smuzhiyun }
185*4882a593Smuzhiyun
186*4882a593Smuzhiyun /**
187*4882a593Smuzhiyun * hfi1_tid_group_to_idx - convert an index to a group
188*4882a593Smuzhiyun * @rcd - the receive context
189*4882a593Smuzhiyun * @grp - the group pointer
190*4882a593Smuzhiyun */
191*4882a593Smuzhiyun static inline u16
hfi1_tid_group_to_idx(struct hfi1_ctxtdata * rcd,struct tid_group * grp)192*4882a593Smuzhiyun hfi1_tid_group_to_idx(struct hfi1_ctxtdata *rcd, struct tid_group *grp)
193*4882a593Smuzhiyun {
194*4882a593Smuzhiyun return grp - &rcd->groups[0];
195*4882a593Smuzhiyun }
196*4882a593Smuzhiyun
197*4882a593Smuzhiyun /**
198*4882a593Smuzhiyun * hfi1_idx_to_tid_group - convert a group to an index
199*4882a593Smuzhiyun * @rcd - the receive context
200*4882a593Smuzhiyun * @idx - the index
201*4882a593Smuzhiyun */
202*4882a593Smuzhiyun static inline struct tid_group *
hfi1_idx_to_tid_group(struct hfi1_ctxtdata * rcd,u16 idx)203*4882a593Smuzhiyun hfi1_idx_to_tid_group(struct hfi1_ctxtdata *rcd, u16 idx)
204*4882a593Smuzhiyun {
205*4882a593Smuzhiyun return &rcd->groups[idx];
206*4882a593Smuzhiyun }
207*4882a593Smuzhiyun
208*4882a593Smuzhiyun int hfi1_alloc_ctxt_rcv_groups(struct hfi1_ctxtdata *rcd);
209*4882a593Smuzhiyun void hfi1_free_ctxt_rcv_groups(struct hfi1_ctxtdata *rcd);
210*4882a593Smuzhiyun void hfi1_exp_tid_group_init(struct hfi1_ctxtdata *rcd);
211*4882a593Smuzhiyun
212*4882a593Smuzhiyun #endif /* _HFI1_EXP_RCV_H */
213