brcmu_utils.h 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227
  1. /*
  2. * Copyright (c) 2010 Broadcom Corporation
  3. *
  4. * Permission to use, copy, modify, and/or distribute this software for any
  5. * purpose with or without fee is hereby granted, provided that the above
  6. * copyright notice and this permission notice appear in all copies.
  7. *
  8. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  9. * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  10. * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  11. * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  12. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
  13. * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
  14. * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  15. */
  16. #ifndef _BRCMU_UTILS_H_
  17. #define _BRCMU_UTILS_H_
  18. #include <linux/skbuff.h>
  19. /*
  20. * Spin at most 'us' microseconds while 'exp' is true.
  21. * Caller should explicitly test 'exp' when this completes
  22. * and take appropriate error action if 'exp' is still true.
  23. */
  24. #define SPINWAIT(exp, us) { \
  25. uint countdown = (us) + 9; \
  26. while ((exp) && (countdown >= 10)) {\
  27. udelay(10); \
  28. countdown -= 10; \
  29. } \
  30. }
  31. /* osl multi-precedence packet queue */
  32. #define PKTQ_LEN_DEFAULT 128 /* Max 128 packets */
  33. #define PKTQ_MAX_PREC 16 /* Maximum precedence levels */
  34. #define BCME_STRLEN 64 /* Max string length for BCM errors */
  35. /* the largest reasonable packet buffer driver uses for ethernet MTU in bytes */
  36. #define PKTBUFSZ 2048
  37. #ifndef setbit
  38. #ifndef NBBY /* the BSD family defines NBBY */
  39. #define NBBY 8 /* 8 bits per byte */
  40. #endif /* #ifndef NBBY */
  41. #define setbit(a, i) (((u8 *)a)[(i)/NBBY] |= 1<<((i)%NBBY))
  42. #define clrbit(a, i) (((u8 *)a)[(i)/NBBY] &= ~(1<<((i)%NBBY)))
  43. #define isset(a, i) (((const u8 *)a)[(i)/NBBY] & (1<<((i)%NBBY)))
  44. #define isclr(a, i) ((((const u8 *)a)[(i)/NBBY] & (1<<((i)%NBBY))) == 0)
  45. #endif /* setbit */
  46. #define NBITS(type) (sizeof(type) * 8)
  47. #define NBITVAL(nbits) (1 << (nbits))
  48. #define MAXBITVAL(nbits) ((1 << (nbits)) - 1)
  49. #define NBITMASK(nbits) MAXBITVAL(nbits)
  50. #define MAXNBVAL(nbyte) MAXBITVAL((nbyte) * 8)
  51. /* crc defines */
  52. #define CRC16_INIT_VALUE 0xffff /* Initial CRC16 checksum value */
  53. #define CRC16_GOOD_VALUE 0xf0b8 /* Good final CRC16 checksum value */
  54. /* 18-bytes of Ethernet address buffer length */
  55. #define ETHER_ADDR_STR_LEN 18
  56. struct pktq_prec {
  57. struct sk_buff_head skblist;
  58. u16 max; /* maximum number of queued packets */
  59. };
  60. /* multi-priority pkt queue */
  61. struct pktq {
  62. u16 num_prec; /* number of precedences in use */
  63. u16 hi_prec; /* rapid dequeue hint (>= highest non-empty prec) */
  64. u16 max; /* total max packets */
  65. u16 len; /* total number of packets */
  66. /*
  67. * q array must be last since # of elements can be either
  68. * PKTQ_MAX_PREC or 1
  69. */
  70. struct pktq_prec q[PKTQ_MAX_PREC];
  71. };
  72. /* operations on a specific precedence in packet queue */
  73. static inline int pktq_plen(struct pktq *pq, int prec)
  74. {
  75. return pq->q[prec].skblist.qlen;
  76. }
  77. static inline int pktq_pavail(struct pktq *pq, int prec)
  78. {
  79. return pq->q[prec].max - pq->q[prec].skblist.qlen;
  80. }
  81. static inline bool pktq_pfull(struct pktq *pq, int prec)
  82. {
  83. return pq->q[prec].skblist.qlen >= pq->q[prec].max;
  84. }
  85. static inline bool pktq_pempty(struct pktq *pq, int prec)
  86. {
  87. return skb_queue_empty(&pq->q[prec].skblist);
  88. }
  89. static inline struct sk_buff *pktq_ppeek(struct pktq *pq, int prec)
  90. {
  91. return skb_peek(&pq->q[prec].skblist);
  92. }
  93. static inline struct sk_buff *pktq_ppeek_tail(struct pktq *pq, int prec)
  94. {
  95. return skb_peek_tail(&pq->q[prec].skblist);
  96. }
  97. struct sk_buff *brcmu_pktq_penq(struct pktq *pq, int prec, struct sk_buff *p);
  98. struct sk_buff *brcmu_pktq_penq_head(struct pktq *pq, int prec,
  99. struct sk_buff *p);
  100. struct sk_buff *brcmu_pktq_pdeq(struct pktq *pq, int prec);
  101. struct sk_buff *brcmu_pktq_pdeq_tail(struct pktq *pq, int prec);
  102. struct sk_buff *brcmu_pktq_pdeq_match(struct pktq *pq, int prec,
  103. bool (*match_fn)(struct sk_buff *p,
  104. void *arg),
  105. void *arg);
  106. /* packet primitives */
  107. struct sk_buff *brcmu_pkt_buf_get_skb(uint len);
  108. void brcmu_pkt_buf_free_skb(struct sk_buff *skb);
  109. /* Empty the queue at particular precedence level */
  110. /* callback function fn(pkt, arg) returns true if pkt belongs to if */
  111. void brcmu_pktq_pflush(struct pktq *pq, int prec, bool dir,
  112. bool (*fn)(struct sk_buff *, void *), void *arg);
  113. /* operations on a set of precedences in packet queue */
  114. int brcmu_pktq_mlen(struct pktq *pq, uint prec_bmp);
  115. struct sk_buff *brcmu_pktq_mdeq(struct pktq *pq, uint prec_bmp, int *prec_out);
  116. /* operations on packet queue as a whole */
  117. static inline int pktq_len(struct pktq *pq)
  118. {
  119. return (int)pq->len;
  120. }
  121. static inline int pktq_max(struct pktq *pq)
  122. {
  123. return (int)pq->max;
  124. }
  125. static inline int pktq_avail(struct pktq *pq)
  126. {
  127. return (int)(pq->max - pq->len);
  128. }
  129. static inline bool pktq_full(struct pktq *pq)
  130. {
  131. return pq->len >= pq->max;
  132. }
  133. static inline bool pktq_empty(struct pktq *pq)
  134. {
  135. return pq->len == 0;
  136. }
  137. void brcmu_pktq_init(struct pktq *pq, int num_prec, int max_len);
  138. /* prec_out may be NULL if caller is not interested in return value */
  139. struct sk_buff *brcmu_pktq_peek_tail(struct pktq *pq, int *prec_out);
  140. void brcmu_pktq_flush(struct pktq *pq, bool dir,
  141. bool (*fn)(struct sk_buff *, void *), void *arg);
  142. /* externs */
  143. /* ip address */
  144. struct ipv4_addr;
  145. /*
  146. * bitfield macros using masking and shift
  147. *
  148. * remark: the mask parameter should be a shifted mask.
  149. */
  150. static inline void brcmu_maskset32(u32 *var, u32 mask, u8 shift, u32 value)
  151. {
  152. value = (value << shift) & mask;
  153. *var = (*var & ~mask) | value;
  154. }
  155. static inline u32 brcmu_maskget32(u32 var, u32 mask, u8 shift)
  156. {
  157. return (var & mask) >> shift;
  158. }
  159. static inline void brcmu_maskset16(u16 *var, u16 mask, u8 shift, u16 value)
  160. {
  161. value = (value << shift) & mask;
  162. *var = (*var & ~mask) | value;
  163. }
  164. static inline u16 brcmu_maskget16(u16 var, u16 mask, u8 shift)
  165. {
  166. return (var & mask) >> shift;
  167. }
  168. /* externs */
  169. /* format/print */
  170. #ifdef DEBUG
  171. void brcmu_prpkt(const char *msg, struct sk_buff *p0);
  172. #else
  173. #define brcmu_prpkt(a, b)
  174. #endif /* DEBUG */
  175. #ifdef DEBUG
  176. __printf(3, 4)
  177. void brcmu_dbg_hex_dump(const void *data, size_t size, const char *fmt, ...);
  178. #else
  179. __printf(3, 4)
  180. static inline
  181. void brcmu_dbg_hex_dump(const void *data, size_t size, const char *fmt, ...)
  182. {
  183. }
  184. #endif
  185. #define BRCMU_BOARDREV_LEN 8
  186. #define BRCMU_DOTREV_LEN 16
  187. char *brcmu_boardrev_str(u32 brev, char *buf);
  188. char *brcmu_dotrev_str(u32 dotrev, char *buf);
  189. #endif /* _BRCMU_UTILS_H_ */