1 /*
2 * Copyright (c) 2006-2007 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
44 void *cxgb_alloc_mem(unsigned long size);
45 void cxgb_free_mem(void *addr);
46 void cxgb_neigh_update(struct neighbour *neigh);
47 void cxgb_redirect(struct dst_entry *old, struct dst_entry *new);
48
49 /*
50 * Map an ATID or STID to their entries in the corresponding TID tables.
51 */
52 static inline union active_open_entry *atid2entry(const struct tid_info *t,
53 unsigned int atid)
54 {
55 return &t->atid_tab[atid - t->atid_base];
56 }
57
58 static inline union listen_entry *stid2entry(const struct tid_info *t,
59 unsigned int stid)
60 {
61 return &t->stid_tab[stid - t->stid_base];
62 }
63
64 /*
65 * Find the connection corresponding to a TID.
66 */
67 static inline struct t3c_tid_entry *lookup_tid(const struct tid_info *t,
68 unsigned int tid)
69 {
70 struct t3c_tid_entry *t3c_tid = tid < t->ntids ?
71 &(t->tid_tab[tid]) : NULL;
72
73 return (t3c_tid && t3c_tid->client) ? t3c_tid : NULL;
74 }
75
76 /*
77 * Find the connection corresponding to a server TID.
78 */
79 static inline struct t3c_tid_entry *lookup_stid(const struct tid_info *t,
80 unsigned int tid)
81 {
82 union listen_entry *e;
83
84 if (tid < t->stid_base || tid >= t->stid_base + t->nstids)
85 return NULL;
86
87 e = stid2entry(t, tid);
88 if ((void *)e->next >= (void *)t->tid_tab &&
89 (void *)e->next < (void *)&t->atid_tab[t->natids])
90 return NULL;
91
92 return &e->t3c_tid;
93 }
94
95 /*
96 * Find the connection corresponding to an active-open TID.
97 */
98 static inline struct t3c_tid_entry *lookup_atid(const struct tid_info *t,
99 unsigned int tid)
100 {
101 union active_open_entry *e;
102
103 if (tid < t->atid_base || tid >= t->atid_base + t->natids)
104 return NULL;
105
106 e = atid2entry(t, tid);
107 if ((void *)e->next >= (void *)t->tid_tab &&
108 (void *)e->next < (void *)&t->atid_tab[t->natids])
109 return NULL;
110
111 return &e->t3c_tid;
112 }
113
114 int process_rx(struct t3cdev *dev, struct sk_buff **skbs, int n);
115 int attach_t3cdev(struct t3cdev *dev);
116 void detach_t3cdev(struct t3cdev *dev);
117 #endif
118
This page was automatically generated by the
LXR engine.
Visit the LXR main site for more
information.