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
44void *cxgb_alloc_mem(unsigned long size);
45void cxgb_free_mem(void *addr);
46void cxgb_neigh_update(struct neighbour *neigh);
47void 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 */
52static 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
58static 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 */
67static 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 */
79static inline struct t3c_tid_entry *lookup_stid(const struct tid_info *t,
80						unsigned int tid)
81{
82	if (tid < t->stid_base || tid >= t->stid_base + t->nstids)
83		return NULL;
84	return &(stid2entry(t, tid)->t3c_tid);
85}
86
87/*
88 * Find the connection corresponding to an active-open TID.
89 */
90static inline struct t3c_tid_entry *lookup_atid(const struct tid_info *t,
91						unsigned int tid)
92{
93	if (tid < t->atid_base || tid >= t->atid_base + t->natids)
94		return NULL;
95	return &(atid2entry(t, tid)->t3c_tid);
96}
97
98int process_rx(struct t3cdev *dev, struct sk_buff **skbs, int n);
99int attach_t3cdev(struct t3cdev *dev);
100void detach_t3cdev(struct t3cdev *dev);
101#endif
102