📄 bcmutils.h
字号:
/* * Misc useful os-independent macros and functions. * * Copyright 2005-2006, Broadcom Corporation * All Rights Reserved. * * THIS SOFTWARE IS OFFERED "AS IS", AND BROADCOM GRANTS NO WARRANTIES OF ANY * KIND, EXPRESS OR IMPLIED, BY STATUTE, COMMUNICATION OR OTHERWISE. BROADCOM * SPECIFICALLY DISCLAIMS ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS * FOR A SPECIFIC PURPOSE OR NONINFRINGEMENT CONCERNING THIS SOFTWARE. * $Id$ */#ifndef _bcmutils_h_#define _bcmutils_h_/* ** driver-only section ** */#ifdef BCMDRIVER#include <osl.h>#define _BCM_U 0x01 /* upper */#define _BCM_L 0x02 /* lower */#define _BCM_D 0x04 /* digit */#define _BCM_C 0x08 /* cntrl */#define _BCM_P 0x10 /* punct */#define _BCM_S 0x20 /* white space (space/lf/tab) */#define _BCM_X 0x40 /* hex digit */#define _BCM_SP 0x80 /* hard space (0x20) */#define GPIO_PIN_NOTDEFINED 0x20 /* Pin not defined */extern unsigned char bcm_ctype[];#define bcm_ismask(x) (bcm_ctype[(int)(unsigned char)(x)])#define bcm_isalnum(c) ((bcm_ismask(c)&(_BCM_U|_BCM_L|_BCM_D)) != 0)#define bcm_isalpha(c) ((bcm_ismask(c)&(_BCM_U|_BCM_L)) != 0)#define bcm_iscntrl(c) ((bcm_ismask(c)&(_BCM_C)) != 0)#define bcm_isdigit(c) ((bcm_ismask(c)&(_BCM_D)) != 0)#define bcm_isgraph(c) ((bcm_ismask(c)&(_BCM_P|_BCM_U|_BCM_L|_BCM_D)) != 0)#define bcm_islower(c) ((bcm_ismask(c)&(_BCM_L)) != 0)#define bcm_isprint(c) ((bcm_ismask(c)&(_BCM_P|_BCM_U|_BCM_L|_BCM_D|_BCM_SP)) != 0)#define bcm_ispunct(c) ((bcm_ismask(c)&(_BCM_P)) != 0)#define bcm_isspace(c) ((bcm_ismask(c)&(_BCM_S)) != 0)#define bcm_isupper(c) ((bcm_ismask(c)&(_BCM_U)) != 0)#define bcm_isxdigit(c) ((bcm_ismask(c)&(_BCM_D|_BCM_X)) != 0)/* * Spin at most 'us' microseconds while 'exp' is true. * Caller should explicitly test 'exp' when this completes * and take appropriate error action if 'exp' is still true. */#define SPINWAIT(exp, us) { \ uint countdown = (us) + 9; \ while ((exp) && (countdown >= 10)) {\ OSL_DELAY(10); \ countdown -= 10; \ } \}/* osl multi-precedence packet queue */#define PKTQ_LEN_DEFAULT 128 /* Max 128 packets */#define PKTQ_MAX_PREC 16 /* Maximum precedence levels */struct pktq { struct pktq_prec { void *head; /* first packet to dequeue */ void *tail; /* last packet to dequeue */ uint16 len; /* number of queued packets */ uint16 max; /* maximum number of queued packets */ } q[PKTQ_MAX_PREC]; uint16 num_prec; /* number of precedences in use */ uint16 hi_prec; /* rapid dequeue hint (>= highest non-empty prec) */ uint16 max; /* total max packets */ uint16 len; /* total number of packets */};#define PKTQ_PREC_ITER(pq, prec) for (prec = (pq)->num_prec - 1; prec >= 0; prec--)/* forward definition of ether_addr structure used by some function prototypes */struct ether_addr;/* operations on a specific precedence in packet queue */#define pktq_psetmax(pq, prec, _max) ((pq)->q[prec].max = (_max))#define pktq_plen(pq, prec) ((pq)->q[prec].len)#define pktq_pavail(pq, prec) ((pq)->q[prec].max - (pq)->q[prec].len)#define pktq_pfull(pq, prec) ((pq)->q[prec].len >= (pq)->q[prec].max)#define pktq_pempty(pq, prec) ((pq)->q[prec].len == 0)#define pktq_ppeek(pq, prec) ((pq)->q[prec].head)#define pktq_ppeek_tail(pq, prec) ((pq)->q[prec].tail)extern void *pktq_penq(struct pktq *pq, int prec, void *p);extern void *pktq_penq_head(struct pktq *pq, int prec, void *p);extern void *pktq_pdeq(struct pktq *pq, int prec);extern void *pktq_pdeq_tail(struct pktq *pq, int prec);/* Empty the queue at particular precedence level */extern void pktq_pflush(osl_t *osh, struct pktq *pq, int prec, bool dir);/* Remove a specified packet from its queue */extern bool pktq_pdel(struct pktq *pq, void *p, int prec);/* operations on a set of precedences in packet queue */extern int pktq_mlen(struct pktq *pq, uint prec_bmp);extern void *pktq_mdeq(struct pktq *pq, uint prec_bmp, int *prec_out);/* operations on packet queue as a whole */#define pktq_len(pq) ((int)(pq)->len)#define pktq_max(pq) ((int)(pq)->max)#define pktq_avail(pq) ((int)((pq)->max - (pq)->len))#define pktq_full(pq) ((pq)->len >= (pq)->max)#define pktq_empty(pq) ((pq)->len == 0)/* operations for single precedence queues */#define pktenq(pq, p) pktq_penq((pq), 0, (p))#define pktenq_head(pq, p) pktq_penq_head((pq), 0, (p))#define pktdeq(pq) pktq_pdeq((pq), 0)#define pktdeq_tail(pq) pktq_pdeq_tail((pq), 0)extern void pktq_init(struct pktq *pq, int num_prec, int max_len);/* prec_out may be NULL if caller is not interested in return value */extern void *pktq_deq(struct pktq *pq, int *prec_out);extern void *pktq_deq_tail(struct pktq *pq, int *prec_out);extern void *pktq_peek(struct pktq *pq, int *prec_out);extern void *pktq_peek_tail(struct pktq *pq, int *prec_out);extern void pktq_flush(osl_t *osh, struct pktq *pq, bool dir); /* Empty the entire queue *//* externs *//* packet */extern uint pktcopy(osl_t *osh, void *p, uint offset, int len, uchar *buf);extern uint pkttotlen(osl_t *osh, void *p);extern void *pktlast(osl_t *osh, void *p);extern void pktsetprio(void *pkt, bool update_vtag);/* string */extern int bcm_atoi(char *s);extern uchar bcm_toupper(uchar c);extern ulong bcm_strtoul(char *cp, char **endp, uint base);extern char *bcmstrstr(char *haystack, char *needle);extern char *bcmstrcat(char *dest, const char *src);/* ethernet address */extern char *bcm_ether_ntoa(struct ether_addr *ea, char *buf);extern int bcm_ether_atoe(char *p, struct ether_addr *ea);/* delay */extern void bcm_mdelay(uint ms);/* variable access */extern char *getvar(char *vars, char *name);extern int getintvar(char *vars, char *name);extern uint getgpiopin(char *vars, char *pin_name, uint def_pin);#define bcm_perf_enable()#define bcmstats(fmt)#define bcmlog(fmt, a1, a2)#define bcmdumplog(buf, size) *buf = '\0'#define bcmdumplogent(buf, idx) -1#endif /* #ifdef BCMDRIVER *//* ** driver/apps-shared section ** */#define BCME_STRLEN 64 /* Max string length for BCM errors */#define VALID_BCMERROR(e) ((e <= 0) && (e >= BCME_LAST))/* * error codes could be added but the defined ones shouldn't be changed/deleted * these error codes are exposed to the user code * when ever a new error code is added to this list * please update errorstring table with the related error string and * update osl files with os specific errorcode map*/#define BCME_ERROR -1 /* Error generic */#define BCME_BADARG -2 /* Bad Argument */#define BCME_BADOPTION -3 /* Bad option */#define BCME_NOTUP -4 /* Not up */#define BCME_NOTDOWN -5 /* Not down */#define BCME_NOTAP -6 /* Not AP */#define BCME_NOTSTA -7 /* Not STA */#define BCME_BADKEYIDX -8 /* BAD Key Index */#define BCME_RADIOOFF -9 /* Radio Off */#define BCME_NOTBANDLOCKED -10 /* Not bandlocked */#define BCME_NOCLK -11 /* No Clock */#define BCME_BADRATESET -12 /* BAD RateSet */#define BCME_BADBAND -13 /* BAD Band */#define BCME_BUFTOOSHORT -14 /* Buffer too short */#define BCME_BUFTOOLONG -15 /* Buffer too Long */#define BCME_BUSY -16 /* Busy */#define BCME_NOTASSOCIATED -17 /* Not associated */#define BCME_BADSSIDLEN -18 /* BAD SSID Len */#define BCME_OUTOFRANGECHAN -19 /* Out of Range Channel */#define BCME_BADCHAN -20 /* BAD Channel */#define BCME_BADADDR -21 /* BAD Address */#define BCME_NORESOURCE -22 /* No resources */#define BCME_UNSUPPORTED -23 /* Unsupported */#define BCME_BADLEN -24 /* Bad Length */#define BCME_NOTREADY -25 /* Not ready Yet */#define BCME_EPERM -26 /* Not Permitted */#define BCME_NOMEM -27 /* No Memory */#define BCME_ASSOCIATED -28 /* Associated */#define BCME_RANGE -29 /* Range Error */#define BCME_NOTFOUND -30 /* Not found */#define BCME_WME_NOT_ENABLED -31 /* WME Not enabled */#define BCME_TSPEC_NOTFOUND -32 /* No TSPEC found */#define BCME_ACM_NOTSUPPORTED -33 /* Admission not supported for AC */#define BCME_NOT_WME_ASSOCIATION -34 /* Not wme association */#define BCME_LAST BCME_NOT_WME_ASSOCIATION#ifndef ABS#define ABS(a) (((a) < 0)?-(a):(a))#endif /* ABS */#ifndef MIN#define MIN(a, b) (((a) < (b))?(a):(b))#endif /* MIN */#ifndef MAX#define MAX(a, b) (((a) > (b))?(a):(b))#endif /* MAX */#define CEIL(x, y) (((x) + ((y)-1)) / (y))#define ROUNDUP(x, y) ((((x)+((y)-1))/(y))*(y))#define ISALIGNED(a, x) (((a) & ((x)-1)) == 0)#define ISPOWEROF2(x) ((((x)-1)&(x)) == 0)#define VALID_MASK(mask) !((mask) & ((mask) + 1))#define OFFSETOF(type, member) ((uint)(uintptr)&((type *)0)->member)#define ARRAYSIZE(a) (sizeof(a)/sizeof(a[0]))/* bit map related macros */#ifndef setbit#ifndef NBBY /* the BSD family defines NBBY */#define NBBY 8 /* 8 bits per byte */#endif /* #ifndef NBBY */#define setbit(a, i) (((uint8 *)a)[(i)/NBBY] |= 1<<((i)%NBBY))#define clrbit(a, i) (((uint8 *)a)[(i)/NBBY] &= ~(1<<((i)%NBBY)))#define isset(a, i) (((uint8 *)a)[(i)/NBBY] & (1<<((i)%NBBY)))#define isclr(a, i) ((((uint8 *)a)[(i)/NBBY] & (1<<((i)%NBBY))) == 0)#endif /* setbit */#define NBITS(type) (sizeof(type) * 8)#define NBITVAL(nbits) (1 << (nbits))#define MAXBITVAL(nbits) ((1 << (nbits)) - 1)#define NBITMASK(nbits) MAXBITVAL(nbits)#define MAXNBVAL(nbyte) MAXBITVAL((nbyte) * 8)/* basic mux operation - can be optimized on several architectures */#define MUX(pred, true, false) ((pred) ? (true) : (false))/* modulo inc/dec - assumes x E [0, bound - 1] */#define MODDEC(x, bound) MUX((x) == 0, (bound) - 1, (x) - 1)#define MODINC(x, bound) MUX((x) == (bound) - 1, 0, (x) + 1)/* modulo inc/dec, bound = 2^k */#define MODDEC_POW2(x, bound) (((x) - 1) & ((bound) - 1))#define MODINC_POW2(x, bound) (((x) + 1) & ((bound) - 1))/* modulo add/sub - assumes x, y E [0, bound - 1] */#define MODADD(x, y, bound) \ MUX((x) + (y) >= (bound), (x) + (y) - (bound), (x) + (y))#define MODSUB(x, y, bound) \ MUX(((int)(x)) - ((int)(y)) < 0, (x) - (y) + (bound), (x) - (y))/* module add/sub, bound = 2^k */#define MODADD_POW2(x, y, bound) (((x) + (y)) & ((bound) - 1))#define MODSUB_POW2(x, y, bound) (((x) - (y)) & ((bound) - 1))/* crc defines */#define CRC8_INIT_VALUE 0xff /* Initial CRC8 checksum value */#define CRC8_GOOD_VALUE 0x9f /* Good final CRC8 checksum value */#define CRC16_INIT_VALUE 0xffff /* Initial CRC16 checksum value */#define CRC16_GOOD_VALUE 0xf0b8 /* Good final CRC16 checksum value */#define CRC32_INIT_VALUE 0xffffffff /* Initial CRC32 checksum value */#define CRC32_GOOD_VALUE 0xdebb20e3 /* Good final CRC32 checksum value *//* bcm_format_flags() bit description structure */typedef struct bcm_bit_desc { uint32 bit; char* name;} bcm_bit_desc_t;/* tag_ID/length/value_buffer tuple */typedef struct bcm_tlv { uint8 id; uint8 len; uint8 data[1];} bcm_tlv_t;/* Check that bcm_tlv_t fits into the given buflen */#define bcm_valid_tlv(elt, buflen) ((buflen) >= 2 && (int)(buflen) >= (int)(2 + (elt)->len))/* buffer length for ethernet address from bcm_ether_ntoa() */#define ETHER_ADDR_STR_LEN 18 /* 18-bytes of Ethernet address buffer length *//* unaligned load and store macros */#ifdef IL_BIGENDIANstatic INLINE uint32load32_ua(uint8 *a){ return ((a[0] << 24) | (a[1] << 16) | (a[2] << 8) | a[3]);}static INLINE voidstore32_ua(uint8 *a, uint32 v){ a[0] = (v >> 24) & 0xff; a[1] = (v >> 16) & 0xff; a[2] = (v >> 8) & 0xff; a[3] = v & 0xff;}static INLINE uint16load16_ua(uint8 *a){ return ((a[0] << 8) | a[1]);}static INLINE voidstore16_ua(uint8 *a, uint16 v){ a[0] = (v >> 8) & 0xff; a[1] = v & 0xff;}#elsestatic INLINE uint32load32_ua(uint8 *a){ return ((a[3] << 24) | (a[2] << 16) | (a[1] << 8) | a[0]);}static INLINE voidstore32_ua(uint8 *a, uint32 v){ a[3] = (v >> 24) & 0xff; a[2] = (v >> 16) & 0xff; a[1] = (v >> 8) & 0xff; a[0] = v & 0xff;}static INLINE uint16load16_ua(uint8 *a){ return ((a[1] << 8) | a[0]);}static INLINE voidstore16_ua(uint8 *a, uint16 v){ a[1] = (v >> 8) & 0xff; a[0] = v & 0xff;}#endif /* IL_BIGENDIAN *//* externs *//* crc */extern uint8 hndcrc8(uint8 *p, uint nbytes, uint8 crc);extern uint16 hndcrc16(uint8 *p, uint nbytes, uint16 crc);extern uint32 hndcrc32(uint8 *p, uint nbytes, uint32 crc);/* format/print */extern void printfbig(char *buf);/* IE parsing */extern bcm_tlv_t *bcm_next_tlv(bcm_tlv_t *elt, int *buflen);extern bcm_tlv_t *bcm_parse_tlvs(void *buf, int buflen, uint key);extern bcm_tlv_t *bcm_parse_ordered_tlvs(void *buf, int buflen, uint key);/* bcmerror */extern const char *bcmerrorstr(int bcmerror);/* multi-bool data type: set of bools, mbool is true if any is set */typedef uint32 mbool;#define mboolset(mb, bit) (mb |= bit) /* set one bool */#define mboolclr(mb, bit) (mb &= ~bit) /* clear one bool */#define mboolisset(mb, bit) ((mb & bit) != 0) /* TRUE if one bool is set */#define mboolmaskset(mb, mask, val) ((mb) = (((mb) & ~(mask)) | (val)))/* power conversion */extern uint16 bcm_qdbm_to_mw(uint8 qdbm);extern uint8 bcm_mw_to_qdbm(uint16 mw);/* generic datastruct to help dump routines */struct fielddesc { char *nameandfmt; uint32 offset; uint32 len;};typedef uint32 (*readreg_rtn)(void *arg0, void *arg1, uint32 offset);extern uint bcmdumpfields(readreg_rtn func_ptr, void *arg0, void *arg1, struct fielddesc *str, char *buf, uint32 bufsize);extern uint bcm_mkiovar(char *name, char *data, uint datalen, char *buf, uint len);extern uint bcm_bitcount(uint8 *bitmap, uint bytelength);#endif /* _bcmutils_h_ */
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -