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