cxgb3_defs.h 3.1 KB

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