1*4882a593Smuzhiyun /*
2*4882a593Smuzhiyun * Copyright (c) 2006-2008 Chelsio, Inc. All rights reserved.
3*4882a593Smuzhiyun *
4*4882a593Smuzhiyun * This software is available to you under a choice of one of two
5*4882a593Smuzhiyun * licenses. You may choose to be licensed under the terms of the GNU
6*4882a593Smuzhiyun * General Public License (GPL) Version 2, available from the file
7*4882a593Smuzhiyun * COPYING in the main directory of this source tree, or the
8*4882a593Smuzhiyun * OpenIB.org BSD license below:
9*4882a593Smuzhiyun *
10*4882a593Smuzhiyun * Redistribution and use in source and binary forms, with or
11*4882a593Smuzhiyun * without modification, are permitted provided that the following
12*4882a593Smuzhiyun * conditions are met:
13*4882a593Smuzhiyun *
14*4882a593Smuzhiyun * - Redistributions of source code must retain the above
15*4882a593Smuzhiyun * copyright notice, this list of conditions and the following
16*4882a593Smuzhiyun * disclaimer.
17*4882a593Smuzhiyun *
18*4882a593Smuzhiyun * - Redistributions in binary form must reproduce the above
19*4882a593Smuzhiyun * copyright notice, this list of conditions and the following
20*4882a593Smuzhiyun * disclaimer in the documentation and/or other materials
21*4882a593Smuzhiyun * provided with the distribution.
22*4882a593Smuzhiyun *
23*4882a593Smuzhiyun * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24*4882a593Smuzhiyun * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25*4882a593Smuzhiyun * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26*4882a593Smuzhiyun * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27*4882a593Smuzhiyun * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28*4882a593Smuzhiyun * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29*4882a593Smuzhiyun * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30*4882a593Smuzhiyun * SOFTWARE.
31*4882a593Smuzhiyun */
32*4882a593Smuzhiyun #ifndef _CHELSIO_DEFS_H
33*4882a593Smuzhiyun #define _CHELSIO_DEFS_H
34*4882a593Smuzhiyun
35*4882a593Smuzhiyun #include <linux/skbuff.h>
36*4882a593Smuzhiyun #include <net/tcp.h>
37*4882a593Smuzhiyun
38*4882a593Smuzhiyun #include "t3cdev.h"
39*4882a593Smuzhiyun
40*4882a593Smuzhiyun #include "cxgb3_offload.h"
41*4882a593Smuzhiyun
42*4882a593Smuzhiyun #define VALIDATE_TID 1
43*4882a593Smuzhiyun
44*4882a593Smuzhiyun /*
45*4882a593Smuzhiyun * Map an ATID or STID to their entries in the corresponding TID tables.
46*4882a593Smuzhiyun */
atid2entry(const struct tid_info * t,unsigned int atid)47*4882a593Smuzhiyun static inline union active_open_entry *atid2entry(const struct tid_info *t,
48*4882a593Smuzhiyun unsigned int atid)
49*4882a593Smuzhiyun {
50*4882a593Smuzhiyun return &t->atid_tab[atid - t->atid_base];
51*4882a593Smuzhiyun }
52*4882a593Smuzhiyun
stid2entry(const struct tid_info * t,unsigned int stid)53*4882a593Smuzhiyun static inline union listen_entry *stid2entry(const struct tid_info *t,
54*4882a593Smuzhiyun unsigned int stid)
55*4882a593Smuzhiyun {
56*4882a593Smuzhiyun return &t->stid_tab[stid - t->stid_base];
57*4882a593Smuzhiyun }
58*4882a593Smuzhiyun
59*4882a593Smuzhiyun /*
60*4882a593Smuzhiyun * Find the connection corresponding to a TID.
61*4882a593Smuzhiyun */
lookup_tid(const struct tid_info * t,unsigned int tid)62*4882a593Smuzhiyun static inline struct t3c_tid_entry *lookup_tid(const struct tid_info *t,
63*4882a593Smuzhiyun unsigned int tid)
64*4882a593Smuzhiyun {
65*4882a593Smuzhiyun struct t3c_tid_entry *t3c_tid = tid < t->ntids ?
66*4882a593Smuzhiyun &(t->tid_tab[tid]) : NULL;
67*4882a593Smuzhiyun
68*4882a593Smuzhiyun return (t3c_tid && t3c_tid->client) ? t3c_tid : NULL;
69*4882a593Smuzhiyun }
70*4882a593Smuzhiyun
71*4882a593Smuzhiyun /*
72*4882a593Smuzhiyun * Find the connection corresponding to a server TID.
73*4882a593Smuzhiyun */
lookup_stid(const struct tid_info * t,unsigned int tid)74*4882a593Smuzhiyun static inline struct t3c_tid_entry *lookup_stid(const struct tid_info *t,
75*4882a593Smuzhiyun unsigned int tid)
76*4882a593Smuzhiyun {
77*4882a593Smuzhiyun union listen_entry *e;
78*4882a593Smuzhiyun
79*4882a593Smuzhiyun if (tid < t->stid_base || tid >= t->stid_base + t->nstids)
80*4882a593Smuzhiyun return NULL;
81*4882a593Smuzhiyun
82*4882a593Smuzhiyun e = stid2entry(t, tid);
83*4882a593Smuzhiyun if ((void *)e->next >= (void *)t->tid_tab &&
84*4882a593Smuzhiyun (void *)e->next < (void *)&t->atid_tab[t->natids])
85*4882a593Smuzhiyun return NULL;
86*4882a593Smuzhiyun
87*4882a593Smuzhiyun return &e->t3c_tid;
88*4882a593Smuzhiyun }
89*4882a593Smuzhiyun
90*4882a593Smuzhiyun /*
91*4882a593Smuzhiyun * Find the connection corresponding to an active-open TID.
92*4882a593Smuzhiyun */
lookup_atid(const struct tid_info * t,unsigned int tid)93*4882a593Smuzhiyun static inline struct t3c_tid_entry *lookup_atid(const struct tid_info *t,
94*4882a593Smuzhiyun unsigned int tid)
95*4882a593Smuzhiyun {
96*4882a593Smuzhiyun union active_open_entry *e;
97*4882a593Smuzhiyun
98*4882a593Smuzhiyun if (tid < t->atid_base || tid >= t->atid_base + t->natids)
99*4882a593Smuzhiyun return NULL;
100*4882a593Smuzhiyun
101*4882a593Smuzhiyun e = atid2entry(t, tid);
102*4882a593Smuzhiyun if ((void *)e->next >= (void *)t->tid_tab &&
103*4882a593Smuzhiyun (void *)e->next < (void *)&t->atid_tab[t->natids])
104*4882a593Smuzhiyun return NULL;
105*4882a593Smuzhiyun
106*4882a593Smuzhiyun return &e->t3c_tid;
107*4882a593Smuzhiyun }
108*4882a593Smuzhiyun
109*4882a593Smuzhiyun int attach_t3cdev(struct t3cdev *dev);
110*4882a593Smuzhiyun void detach_t3cdev(struct t3cdev *dev);
111*4882a593Smuzhiyun #endif
112