fwsignal.c 67 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490
  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. #include <linux/types.h>
  17. #include <linux/module.h>
  18. #include <linux/if_ether.h>
  19. #include <linux/spinlock.h>
  20. #include <linux/skbuff.h>
  21. #include <linux/netdevice.h>
  22. #include <linux/etherdevice.h>
  23. #include <linux/err.h>
  24. #include <linux/jiffies.h>
  25. #include <net/cfg80211.h>
  26. #include <brcmu_utils.h>
  27. #include <brcmu_wifi.h>
  28. #include "core.h"
  29. #include "debug.h"
  30. #include "bus.h"
  31. #include "fwil.h"
  32. #include "fwil_types.h"
  33. #include "fweh.h"
  34. #include "fwsignal.h"
  35. #include "p2p.h"
  36. #include "cfg80211.h"
  37. #include "proto.h"
  38. #include "common.h"
  39. /**
  40. * DOC: Firmware Signalling
  41. *
  42. * Firmware can send signals to host and vice versa, which are passed in the
  43. * data packets using TLV based header. This signalling layer is on top of the
  44. * BDC bus protocol layer.
  45. */
  46. /*
  47. * single definition for firmware-driver flow control tlv's.
  48. *
  49. * each tlv is specified by BRCMF_FWS_TLV_DEF(name, ID, length).
  50. * A length value 0 indicates variable length tlv.
  51. */
  52. #define BRCMF_FWS_TLV_DEFLIST \
  53. BRCMF_FWS_TLV_DEF(MAC_OPEN, 1, 1) \
  54. BRCMF_FWS_TLV_DEF(MAC_CLOSE, 2, 1) \
  55. BRCMF_FWS_TLV_DEF(MAC_REQUEST_CREDIT, 3, 2) \
  56. BRCMF_FWS_TLV_DEF(TXSTATUS, 4, 4) \
  57. BRCMF_FWS_TLV_DEF(PKTTAG, 5, 4) \
  58. BRCMF_FWS_TLV_DEF(MACDESC_ADD, 6, 8) \
  59. BRCMF_FWS_TLV_DEF(MACDESC_DEL, 7, 8) \
  60. BRCMF_FWS_TLV_DEF(RSSI, 8, 1) \
  61. BRCMF_FWS_TLV_DEF(INTERFACE_OPEN, 9, 1) \
  62. BRCMF_FWS_TLV_DEF(INTERFACE_CLOSE, 10, 1) \
  63. BRCMF_FWS_TLV_DEF(FIFO_CREDITBACK, 11, 6) \
  64. BRCMF_FWS_TLV_DEF(PENDING_TRAFFIC_BMP, 12, 2) \
  65. BRCMF_FWS_TLV_DEF(MAC_REQUEST_PACKET, 13, 3) \
  66. BRCMF_FWS_TLV_DEF(HOST_REORDER_RXPKTS, 14, 10) \
  67. BRCMF_FWS_TLV_DEF(TRANS_ID, 18, 6) \
  68. BRCMF_FWS_TLV_DEF(COMP_TXSTATUS, 19, 1) \
  69. BRCMF_FWS_TLV_DEF(FILLER, 255, 0)
  70. /*
  71. * enum brcmf_fws_tlv_type - definition of tlv identifiers.
  72. */
  73. #define BRCMF_FWS_TLV_DEF(name, id, len) \
  74. BRCMF_FWS_TYPE_ ## name = id,
  75. enum brcmf_fws_tlv_type {
  76. BRCMF_FWS_TLV_DEFLIST
  77. BRCMF_FWS_TYPE_INVALID
  78. };
  79. #undef BRCMF_FWS_TLV_DEF
  80. /*
  81. * enum brcmf_fws_tlv_len - definition of tlv lengths.
  82. */
  83. #define BRCMF_FWS_TLV_DEF(name, id, len) \
  84. BRCMF_FWS_TYPE_ ## name ## _LEN = (len),
  85. enum brcmf_fws_tlv_len {
  86. BRCMF_FWS_TLV_DEFLIST
  87. };
  88. #undef BRCMF_FWS_TLV_DEF
  89. /* AMPDU rx reordering definitions */
  90. #define BRCMF_RXREORDER_FLOWID_OFFSET 0
  91. #define BRCMF_RXREORDER_MAXIDX_OFFSET 2
  92. #define BRCMF_RXREORDER_FLAGS_OFFSET 4
  93. #define BRCMF_RXREORDER_CURIDX_OFFSET 6
  94. #define BRCMF_RXREORDER_EXPIDX_OFFSET 8
  95. #define BRCMF_RXREORDER_DEL_FLOW 0x01
  96. #define BRCMF_RXREORDER_FLUSH_ALL 0x02
  97. #define BRCMF_RXREORDER_CURIDX_VALID 0x04
  98. #define BRCMF_RXREORDER_EXPIDX_VALID 0x08
  99. #define BRCMF_RXREORDER_NEW_HOLE 0x10
  100. #ifdef DEBUG
  101. /*
  102. * brcmf_fws_tlv_names - array of tlv names.
  103. */
  104. #define BRCMF_FWS_TLV_DEF(name, id, len) \
  105. { id, #name },
  106. static struct {
  107. enum brcmf_fws_tlv_type id;
  108. const char *name;
  109. } brcmf_fws_tlv_names[] = {
  110. BRCMF_FWS_TLV_DEFLIST
  111. };
  112. #undef BRCMF_FWS_TLV_DEF
  113. static const char *brcmf_fws_get_tlv_name(enum brcmf_fws_tlv_type id)
  114. {
  115. int i;
  116. for (i = 0; i < ARRAY_SIZE(brcmf_fws_tlv_names); i++)
  117. if (brcmf_fws_tlv_names[i].id == id)
  118. return brcmf_fws_tlv_names[i].name;
  119. return "INVALID";
  120. }
  121. #else
  122. static const char *brcmf_fws_get_tlv_name(enum brcmf_fws_tlv_type id)
  123. {
  124. return "NODEBUG";
  125. }
  126. #endif /* DEBUG */
  127. /*
  128. * The PKTTAG tlv has additional bytes when firmware-signalling
  129. * mode has REUSESEQ flag set.
  130. */
  131. #define BRCMF_FWS_TYPE_SEQ_LEN 2
  132. /*
  133. * flags used to enable tlv signalling from firmware.
  134. */
  135. #define BRCMF_FWS_FLAGS_RSSI_SIGNALS 0x0001
  136. #define BRCMF_FWS_FLAGS_XONXOFF_SIGNALS 0x0002
  137. #define BRCMF_FWS_FLAGS_CREDIT_STATUS_SIGNALS 0x0004
  138. #define BRCMF_FWS_FLAGS_HOST_PROPTXSTATUS_ACTIVE 0x0008
  139. #define BRCMF_FWS_FLAGS_PSQ_GENERATIONFSM_ENABLE 0x0010
  140. #define BRCMF_FWS_FLAGS_PSQ_ZERO_BUFFER_ENABLE 0x0020
  141. #define BRCMF_FWS_FLAGS_HOST_RXREORDER_ACTIVE 0x0040
  142. #define BRCMF_FWS_MAC_DESC_TABLE_SIZE 32
  143. #define BRCMF_FWS_MAC_DESC_ID_INVALID 0xff
  144. #define BRCMF_FWS_HOSTIF_FLOWSTATE_OFF 0
  145. #define BRCMF_FWS_HOSTIF_FLOWSTATE_ON 1
  146. #define BRCMF_FWS_FLOWCONTROL_HIWATER 128
  147. #define BRCMF_FWS_FLOWCONTROL_LOWATER 64
  148. #define BRCMF_FWS_PSQ_PREC_COUNT ((BRCMF_FWS_FIFO_COUNT + 1) * 2)
  149. #define BRCMF_FWS_PSQ_LEN 256
  150. #define BRCMF_FWS_HTOD_FLAG_PKTFROMHOST 0x01
  151. #define BRCMF_FWS_HTOD_FLAG_PKT_REQUESTED 0x02
  152. #define BRCMF_FWS_RET_OK_NOSCHEDULE 0
  153. #define BRCMF_FWS_RET_OK_SCHEDULE 1
  154. #define BRCMF_FWS_MODE_REUSESEQ_SHIFT 3 /* seq reuse */
  155. #define BRCMF_FWS_MODE_SET_REUSESEQ(x, val) ((x) = \
  156. ((x) & ~(1 << BRCMF_FWS_MODE_REUSESEQ_SHIFT)) | \
  157. (((val) & 1) << BRCMF_FWS_MODE_REUSESEQ_SHIFT))
  158. #define BRCMF_FWS_MODE_GET_REUSESEQ(x) \
  159. (((x) >> BRCMF_FWS_MODE_REUSESEQ_SHIFT) & 1)
  160. /**
  161. * enum brcmf_fws_skb_state - indicates processing state of skb.
  162. *
  163. * @BRCMF_FWS_SKBSTATE_NEW: sk_buff is newly arrived in the driver.
  164. * @BRCMF_FWS_SKBSTATE_DELAYED: sk_buff had to wait on queue.
  165. * @BRCMF_FWS_SKBSTATE_SUPPRESSED: sk_buff has been suppressed by firmware.
  166. * @BRCMF_FWS_SKBSTATE_TIM: allocated for TIM update info.
  167. */
  168. enum brcmf_fws_skb_state {
  169. BRCMF_FWS_SKBSTATE_NEW,
  170. BRCMF_FWS_SKBSTATE_DELAYED,
  171. BRCMF_FWS_SKBSTATE_SUPPRESSED,
  172. BRCMF_FWS_SKBSTATE_TIM
  173. };
  174. /**
  175. * struct brcmf_skbuff_cb - control buffer associated with skbuff.
  176. *
  177. * @bus_flags: 2 bytes reserved for bus specific parameters
  178. * @if_flags: holds interface index and packet related flags.
  179. * @htod: host to device packet identifier (used in PKTTAG tlv).
  180. * @htod_seq: this 16-bit is original seq number for every suppress packet.
  181. * @state: transmit state of the packet.
  182. * @mac: descriptor related to destination for this packet.
  183. *
  184. * This information is stored in control buffer struct sk_buff::cb, which
  185. * provides 48 bytes of storage so this structure should not exceed that.
  186. */
  187. struct brcmf_skbuff_cb {
  188. u16 bus_flags;
  189. u16 if_flags;
  190. u32 htod;
  191. u16 htod_seq;
  192. enum brcmf_fws_skb_state state;
  193. struct brcmf_fws_mac_descriptor *mac;
  194. };
  195. /*
  196. * macro casting skbuff control buffer to struct brcmf_skbuff_cb.
  197. */
  198. #define brcmf_skbcb(skb) ((struct brcmf_skbuff_cb *)((skb)->cb))
  199. /*
  200. * sk_buff control if flags
  201. *
  202. * b[11] - packet sent upon firmware request.
  203. * b[10] - packet only contains signalling data.
  204. * b[9] - packet is a tx packet.
  205. * b[8] - packet used requested credit
  206. * b[7] - interface in AP mode.
  207. * b[3:0] - interface index.
  208. */
  209. #define BRCMF_SKB_IF_FLAGS_REQUESTED_MASK 0x0800
  210. #define BRCMF_SKB_IF_FLAGS_REQUESTED_SHIFT 11
  211. #define BRCMF_SKB_IF_FLAGS_SIGNAL_ONLY_MASK 0x0400
  212. #define BRCMF_SKB_IF_FLAGS_SIGNAL_ONLY_SHIFT 10
  213. #define BRCMF_SKB_IF_FLAGS_TRANSMIT_MASK 0x0200
  214. #define BRCMF_SKB_IF_FLAGS_TRANSMIT_SHIFT 9
  215. #define BRCMF_SKB_IF_FLAGS_REQ_CREDIT_MASK 0x0100
  216. #define BRCMF_SKB_IF_FLAGS_REQ_CREDIT_SHIFT 8
  217. #define BRCMF_SKB_IF_FLAGS_IF_AP_MASK 0x0080
  218. #define BRCMF_SKB_IF_FLAGS_IF_AP_SHIFT 7
  219. #define BRCMF_SKB_IF_FLAGS_INDEX_MASK 0x000f
  220. #define BRCMF_SKB_IF_FLAGS_INDEX_SHIFT 0
  221. #define brcmf_skb_if_flags_set_field(skb, field, value) \
  222. brcmu_maskset16(&(brcmf_skbcb(skb)->if_flags), \
  223. BRCMF_SKB_IF_FLAGS_ ## field ## _MASK, \
  224. BRCMF_SKB_IF_FLAGS_ ## field ## _SHIFT, (value))
  225. #define brcmf_skb_if_flags_get_field(skb, field) \
  226. brcmu_maskget16(brcmf_skbcb(skb)->if_flags, \
  227. BRCMF_SKB_IF_FLAGS_ ## field ## _MASK, \
  228. BRCMF_SKB_IF_FLAGS_ ## field ## _SHIFT)
  229. /*
  230. * sk_buff control packet identifier
  231. *
  232. * 32-bit packet identifier used in PKTTAG tlv from host to dongle.
  233. *
  234. * - Generated at the host (e.g. dhd)
  235. * - Seen as a generic sequence number by firmware except for the flags field.
  236. *
  237. * Generation : b[31] => generation number for this packet [host->fw]
  238. * OR, current generation number [fw->host]
  239. * Flags : b[30:27] => command, status flags
  240. * FIFO-AC : b[26:24] => AC-FIFO id
  241. * h-slot : b[23:8] => hanger-slot
  242. * freerun : b[7:0] => A free running counter
  243. */
  244. #define BRCMF_SKB_HTOD_TAG_GENERATION_MASK 0x80000000
  245. #define BRCMF_SKB_HTOD_TAG_GENERATION_SHIFT 31
  246. #define BRCMF_SKB_HTOD_TAG_FLAGS_MASK 0x78000000
  247. #define BRCMF_SKB_HTOD_TAG_FLAGS_SHIFT 27
  248. #define BRCMF_SKB_HTOD_TAG_FIFO_MASK 0x07000000
  249. #define BRCMF_SKB_HTOD_TAG_FIFO_SHIFT 24
  250. #define BRCMF_SKB_HTOD_TAG_HSLOT_MASK 0x00ffff00
  251. #define BRCMF_SKB_HTOD_TAG_HSLOT_SHIFT 8
  252. #define BRCMF_SKB_HTOD_TAG_FREERUN_MASK 0x000000ff
  253. #define BRCMF_SKB_HTOD_TAG_FREERUN_SHIFT 0
  254. #define brcmf_skb_htod_tag_set_field(skb, field, value) \
  255. brcmu_maskset32(&(brcmf_skbcb(skb)->htod), \
  256. BRCMF_SKB_HTOD_TAG_ ## field ## _MASK, \
  257. BRCMF_SKB_HTOD_TAG_ ## field ## _SHIFT, (value))
  258. #define brcmf_skb_htod_tag_get_field(skb, field) \
  259. brcmu_maskget32(brcmf_skbcb(skb)->htod, \
  260. BRCMF_SKB_HTOD_TAG_ ## field ## _MASK, \
  261. BRCMF_SKB_HTOD_TAG_ ## field ## _SHIFT)
  262. #define BRCMF_SKB_HTOD_SEQ_FROMFW_MASK 0x2000
  263. #define BRCMF_SKB_HTOD_SEQ_FROMFW_SHIFT 13
  264. #define BRCMF_SKB_HTOD_SEQ_FROMDRV_MASK 0x1000
  265. #define BRCMF_SKB_HTOD_SEQ_FROMDRV_SHIFT 12
  266. #define BRCMF_SKB_HTOD_SEQ_NR_MASK 0x0fff
  267. #define BRCMF_SKB_HTOD_SEQ_NR_SHIFT 0
  268. #define brcmf_skb_htod_seq_set_field(skb, field, value) \
  269. brcmu_maskset16(&(brcmf_skbcb(skb)->htod_seq), \
  270. BRCMF_SKB_HTOD_SEQ_ ## field ## _MASK, \
  271. BRCMF_SKB_HTOD_SEQ_ ## field ## _SHIFT, (value))
  272. #define brcmf_skb_htod_seq_get_field(skb, field) \
  273. brcmu_maskget16(brcmf_skbcb(skb)->htod_seq, \
  274. BRCMF_SKB_HTOD_SEQ_ ## field ## _MASK, \
  275. BRCMF_SKB_HTOD_SEQ_ ## field ## _SHIFT)
  276. #define BRCMF_FWS_TXSTAT_GENERATION_MASK 0x80000000
  277. #define BRCMF_FWS_TXSTAT_GENERATION_SHIFT 31
  278. #define BRCMF_FWS_TXSTAT_FLAGS_MASK 0x78000000
  279. #define BRCMF_FWS_TXSTAT_FLAGS_SHIFT 27
  280. #define BRCMF_FWS_TXSTAT_FIFO_MASK 0x07000000
  281. #define BRCMF_FWS_TXSTAT_FIFO_SHIFT 24
  282. #define BRCMF_FWS_TXSTAT_HSLOT_MASK 0x00FFFF00
  283. #define BRCMF_FWS_TXSTAT_HSLOT_SHIFT 8
  284. #define BRCMF_FWS_TXSTAT_FREERUN_MASK 0x000000FF
  285. #define BRCMF_FWS_TXSTAT_FREERUN_SHIFT 0
  286. #define brcmf_txstatus_get_field(txs, field) \
  287. brcmu_maskget32(txs, BRCMF_FWS_TXSTAT_ ## field ## _MASK, \
  288. BRCMF_FWS_TXSTAT_ ## field ## _SHIFT)
  289. /* How long to defer borrowing in jiffies */
  290. #define BRCMF_FWS_BORROW_DEFER_PERIOD (HZ / 10)
  291. /**
  292. * enum brcmf_fws_fifo - fifo indices used by dongle firmware.
  293. *
  294. * @BRCMF_FWS_FIFO_FIRST: first fifo, ie. background.
  295. * @BRCMF_FWS_FIFO_AC_BK: fifo for background traffic.
  296. * @BRCMF_FWS_FIFO_AC_BE: fifo for best-effort traffic.
  297. * @BRCMF_FWS_FIFO_AC_VI: fifo for video traffic.
  298. * @BRCMF_FWS_FIFO_AC_VO: fifo for voice traffic.
  299. * @BRCMF_FWS_FIFO_BCMC: fifo for broadcast/multicast (AP only).
  300. * @BRCMF_FWS_FIFO_ATIM: fifo for ATIM (AP only).
  301. * @BRCMF_FWS_FIFO_COUNT: number of fifos.
  302. */
  303. enum brcmf_fws_fifo {
  304. BRCMF_FWS_FIFO_FIRST,
  305. BRCMF_FWS_FIFO_AC_BK = BRCMF_FWS_FIFO_FIRST,
  306. BRCMF_FWS_FIFO_AC_BE,
  307. BRCMF_FWS_FIFO_AC_VI,
  308. BRCMF_FWS_FIFO_AC_VO,
  309. BRCMF_FWS_FIFO_BCMC,
  310. BRCMF_FWS_FIFO_ATIM,
  311. BRCMF_FWS_FIFO_COUNT
  312. };
  313. /**
  314. * enum brcmf_fws_txstatus - txstatus flag values.
  315. *
  316. * @BRCMF_FWS_TXSTATUS_DISCARD:
  317. * host is free to discard the packet.
  318. * @BRCMF_FWS_TXSTATUS_CORE_SUPPRESS:
  319. * 802.11 core suppressed the packet.
  320. * @BRCMF_FWS_TXSTATUS_FW_PS_SUPPRESS:
  321. * firmware suppress the packet as device is already in PS mode.
  322. * @BRCMF_FWS_TXSTATUS_FW_TOSSED:
  323. * firmware tossed the packet.
  324. * @BRCMF_FWS_TXSTATUS_HOST_TOSSED:
  325. * host tossed the packet.
  326. */
  327. enum brcmf_fws_txstatus {
  328. BRCMF_FWS_TXSTATUS_DISCARD,
  329. BRCMF_FWS_TXSTATUS_CORE_SUPPRESS,
  330. BRCMF_FWS_TXSTATUS_FW_PS_SUPPRESS,
  331. BRCMF_FWS_TXSTATUS_FW_TOSSED,
  332. BRCMF_FWS_TXSTATUS_HOST_TOSSED
  333. };
  334. enum brcmf_fws_fcmode {
  335. BRCMF_FWS_FCMODE_NONE,
  336. BRCMF_FWS_FCMODE_IMPLIED_CREDIT,
  337. BRCMF_FWS_FCMODE_EXPLICIT_CREDIT
  338. };
  339. enum brcmf_fws_mac_desc_state {
  340. BRCMF_FWS_STATE_OPEN = 1,
  341. BRCMF_FWS_STATE_CLOSE
  342. };
  343. /**
  344. * struct brcmf_fws_mac_descriptor - firmware signalling data per node/interface
  345. *
  346. * @occupied: slot is in use.
  347. * @mac_handle: handle for mac entry determined by firmware.
  348. * @interface_id: interface index.
  349. * @state: current state.
  350. * @suppressed: mac entry is suppressed.
  351. * @generation: generation bit.
  352. * @ac_bitmap: ac queue bitmap.
  353. * @requested_credit: credits requested by firmware.
  354. * @ea: ethernet address.
  355. * @seq: per-node free-running sequence.
  356. * @psq: power-save queue.
  357. * @transit_count: packet in transit to firmware.
  358. */
  359. struct brcmf_fws_mac_descriptor {
  360. char name[16];
  361. u8 occupied;
  362. u8 mac_handle;
  363. u8 interface_id;
  364. u8 state;
  365. bool suppressed;
  366. u8 generation;
  367. u8 ac_bitmap;
  368. u8 requested_credit;
  369. u8 requested_packet;
  370. u8 ea[ETH_ALEN];
  371. u8 seq[BRCMF_FWS_FIFO_COUNT];
  372. struct pktq psq;
  373. int transit_count;
  374. int suppr_transit_count;
  375. bool send_tim_signal;
  376. u8 traffic_pending_bmp;
  377. u8 traffic_lastreported_bmp;
  378. };
  379. #define BRCMF_FWS_HANGER_MAXITEMS 1024
  380. /**
  381. * enum brcmf_fws_hanger_item_state - state of hanger item.
  382. *
  383. * @BRCMF_FWS_HANGER_ITEM_STATE_FREE: item is free for use.
  384. * @BRCMF_FWS_HANGER_ITEM_STATE_INUSE: item is in use.
  385. * @BRCMF_FWS_HANGER_ITEM_STATE_INUSE_SUPPRESSED: item was suppressed.
  386. */
  387. enum brcmf_fws_hanger_item_state {
  388. BRCMF_FWS_HANGER_ITEM_STATE_FREE = 1,
  389. BRCMF_FWS_HANGER_ITEM_STATE_INUSE,
  390. BRCMF_FWS_HANGER_ITEM_STATE_INUSE_SUPPRESSED
  391. };
  392. /**
  393. * struct brcmf_fws_hanger_item - single entry for tx pending packet.
  394. *
  395. * @state: entry is either free or occupied.
  396. * @pkt: packet itself.
  397. */
  398. struct brcmf_fws_hanger_item {
  399. enum brcmf_fws_hanger_item_state state;
  400. struct sk_buff *pkt;
  401. };
  402. /**
  403. * struct brcmf_fws_hanger - holds packets awaiting firmware txstatus.
  404. *
  405. * @pushed: packets pushed to await txstatus.
  406. * @popped: packets popped upon handling txstatus.
  407. * @failed_to_push: packets that could not be pushed.
  408. * @failed_to_pop: packets that could not be popped.
  409. * @failed_slotfind: packets for which failed to find an entry.
  410. * @slot_pos: last returned item index for a free entry.
  411. * @items: array of hanger items.
  412. */
  413. struct brcmf_fws_hanger {
  414. u32 pushed;
  415. u32 popped;
  416. u32 failed_to_push;
  417. u32 failed_to_pop;
  418. u32 failed_slotfind;
  419. u32 slot_pos;
  420. struct brcmf_fws_hanger_item items[BRCMF_FWS_HANGER_MAXITEMS];
  421. };
  422. struct brcmf_fws_macdesc_table {
  423. struct brcmf_fws_mac_descriptor nodes[BRCMF_FWS_MAC_DESC_TABLE_SIZE];
  424. struct brcmf_fws_mac_descriptor iface[BRCMF_MAX_IFS];
  425. struct brcmf_fws_mac_descriptor other;
  426. };
  427. struct brcmf_fws_stats {
  428. u32 tlv_parse_failed;
  429. u32 tlv_invalid_type;
  430. u32 header_only_pkt;
  431. u32 header_pulls;
  432. u32 pkt2bus;
  433. u32 send_pkts[5];
  434. u32 requested_sent[5];
  435. u32 generic_error;
  436. u32 mac_update_failed;
  437. u32 mac_ps_update_failed;
  438. u32 if_update_failed;
  439. u32 packet_request_failed;
  440. u32 credit_request_failed;
  441. u32 rollback_success;
  442. u32 rollback_failed;
  443. u32 delayq_full_error;
  444. u32 supprq_full_error;
  445. u32 txs_indicate;
  446. u32 txs_discard;
  447. u32 txs_supp_core;
  448. u32 txs_supp_ps;
  449. u32 txs_tossed;
  450. u32 txs_host_tossed;
  451. u32 bus_flow_block;
  452. u32 fws_flow_block;
  453. };
  454. struct brcmf_fws_info {
  455. struct brcmf_pub *drvr;
  456. spinlock_t spinlock;
  457. ulong flags;
  458. struct brcmf_fws_stats stats;
  459. struct brcmf_fws_hanger hanger;
  460. enum brcmf_fws_fcmode fcmode;
  461. bool fw_signals;
  462. bool bcmc_credit_check;
  463. struct brcmf_fws_macdesc_table desc;
  464. struct workqueue_struct *fws_wq;
  465. struct work_struct fws_dequeue_work;
  466. u32 fifo_enqpkt[BRCMF_FWS_FIFO_COUNT];
  467. int fifo_credit[BRCMF_FWS_FIFO_COUNT];
  468. int credits_borrowed[BRCMF_FWS_FIFO_AC_VO + 1];
  469. int deq_node_pos[BRCMF_FWS_FIFO_COUNT];
  470. u32 fifo_credit_map;
  471. u32 fifo_delay_map;
  472. unsigned long borrow_defer_timestamp;
  473. bool bus_flow_blocked;
  474. bool creditmap_received;
  475. u8 mode;
  476. bool avoid_queueing;
  477. };
  478. /*
  479. * brcmf_fws_prio2fifo - mapping from 802.1d priority to firmware fifo index.
  480. */
  481. static const int brcmf_fws_prio2fifo[] = {
  482. BRCMF_FWS_FIFO_AC_BE,
  483. BRCMF_FWS_FIFO_AC_BK,
  484. BRCMF_FWS_FIFO_AC_BK,
  485. BRCMF_FWS_FIFO_AC_BE,
  486. BRCMF_FWS_FIFO_AC_VI,
  487. BRCMF_FWS_FIFO_AC_VI,
  488. BRCMF_FWS_FIFO_AC_VO,
  489. BRCMF_FWS_FIFO_AC_VO
  490. };
  491. #define BRCMF_FWS_TLV_DEF(name, id, len) \
  492. case BRCMF_FWS_TYPE_ ## name: \
  493. return len;
  494. /**
  495. * brcmf_fws_get_tlv_len() - returns defined length for given tlv id.
  496. *
  497. * @fws: firmware-signalling information.
  498. * @id: identifier of the TLV.
  499. *
  500. * Return: the specified length for the given TLV; Otherwise -EINVAL.
  501. */
  502. static int brcmf_fws_get_tlv_len(struct brcmf_fws_info *fws,
  503. enum brcmf_fws_tlv_type id)
  504. {
  505. switch (id) {
  506. BRCMF_FWS_TLV_DEFLIST
  507. default:
  508. fws->stats.tlv_invalid_type++;
  509. break;
  510. }
  511. return -EINVAL;
  512. }
  513. #undef BRCMF_FWS_TLV_DEF
  514. static void brcmf_fws_lock(struct brcmf_fws_info *fws)
  515. __acquires(&fws->spinlock)
  516. {
  517. spin_lock_irqsave(&fws->spinlock, fws->flags);
  518. }
  519. static void brcmf_fws_unlock(struct brcmf_fws_info *fws)
  520. __releases(&fws->spinlock)
  521. {
  522. spin_unlock_irqrestore(&fws->spinlock, fws->flags);
  523. }
  524. static bool brcmf_fws_ifidx_match(struct sk_buff *skb, void *arg)
  525. {
  526. u32 ifidx = brcmf_skb_if_flags_get_field(skb, INDEX);
  527. return ifidx == *(int *)arg;
  528. }
  529. static void brcmf_fws_psq_flush(struct brcmf_fws_info *fws, struct pktq *q,
  530. int ifidx)
  531. {
  532. bool (*matchfn)(struct sk_buff *, void *) = NULL;
  533. struct sk_buff *skb;
  534. int prec;
  535. if (ifidx != -1)
  536. matchfn = brcmf_fws_ifidx_match;
  537. for (prec = 0; prec < q->num_prec; prec++) {
  538. skb = brcmu_pktq_pdeq_match(q, prec, matchfn, &ifidx);
  539. while (skb) {
  540. brcmu_pkt_buf_free_skb(skb);
  541. skb = brcmu_pktq_pdeq_match(q, prec, matchfn, &ifidx);
  542. }
  543. }
  544. }
  545. static void brcmf_fws_hanger_init(struct brcmf_fws_hanger *hanger)
  546. {
  547. int i;
  548. memset(hanger, 0, sizeof(*hanger));
  549. for (i = 0; i < ARRAY_SIZE(hanger->items); i++)
  550. hanger->items[i].state = BRCMF_FWS_HANGER_ITEM_STATE_FREE;
  551. }
  552. static u32 brcmf_fws_hanger_get_free_slot(struct brcmf_fws_hanger *h)
  553. {
  554. u32 i;
  555. i = (h->slot_pos + 1) % BRCMF_FWS_HANGER_MAXITEMS;
  556. while (i != h->slot_pos) {
  557. if (h->items[i].state == BRCMF_FWS_HANGER_ITEM_STATE_FREE) {
  558. h->slot_pos = i;
  559. goto done;
  560. }
  561. i++;
  562. if (i == BRCMF_FWS_HANGER_MAXITEMS)
  563. i = 0;
  564. }
  565. brcmf_err("all slots occupied\n");
  566. h->failed_slotfind++;
  567. i = BRCMF_FWS_HANGER_MAXITEMS;
  568. done:
  569. return i;
  570. }
  571. static int brcmf_fws_hanger_pushpkt(struct brcmf_fws_hanger *h,
  572. struct sk_buff *pkt, u32 slot_id)
  573. {
  574. if (slot_id >= BRCMF_FWS_HANGER_MAXITEMS)
  575. return -ENOENT;
  576. if (h->items[slot_id].state != BRCMF_FWS_HANGER_ITEM_STATE_FREE) {
  577. brcmf_err("slot is not free\n");
  578. h->failed_to_push++;
  579. return -EINVAL;
  580. }
  581. h->items[slot_id].state = BRCMF_FWS_HANGER_ITEM_STATE_INUSE;
  582. h->items[slot_id].pkt = pkt;
  583. h->pushed++;
  584. return 0;
  585. }
  586. static inline int brcmf_fws_hanger_poppkt(struct brcmf_fws_hanger *h,
  587. u32 slot_id, struct sk_buff **pktout,
  588. bool remove_item)
  589. {
  590. if (slot_id >= BRCMF_FWS_HANGER_MAXITEMS)
  591. return -ENOENT;
  592. if (h->items[slot_id].state == BRCMF_FWS_HANGER_ITEM_STATE_FREE) {
  593. brcmf_err("entry not in use\n");
  594. h->failed_to_pop++;
  595. return -EINVAL;
  596. }
  597. *pktout = h->items[slot_id].pkt;
  598. if (remove_item) {
  599. h->items[slot_id].state = BRCMF_FWS_HANGER_ITEM_STATE_FREE;
  600. h->items[slot_id].pkt = NULL;
  601. h->popped++;
  602. }
  603. return 0;
  604. }
  605. static int brcmf_fws_hanger_mark_suppressed(struct brcmf_fws_hanger *h,
  606. u32 slot_id)
  607. {
  608. if (slot_id >= BRCMF_FWS_HANGER_MAXITEMS)
  609. return -ENOENT;
  610. if (h->items[slot_id].state == BRCMF_FWS_HANGER_ITEM_STATE_FREE) {
  611. brcmf_err("entry not in use\n");
  612. return -EINVAL;
  613. }
  614. h->items[slot_id].state = BRCMF_FWS_HANGER_ITEM_STATE_INUSE_SUPPRESSED;
  615. return 0;
  616. }
  617. static void brcmf_fws_hanger_cleanup(struct brcmf_fws_info *fws,
  618. bool (*fn)(struct sk_buff *, void *),
  619. int ifidx)
  620. {
  621. struct brcmf_fws_hanger *h = &fws->hanger;
  622. struct sk_buff *skb;
  623. int i;
  624. enum brcmf_fws_hanger_item_state s;
  625. for (i = 0; i < ARRAY_SIZE(h->items); i++) {
  626. s = h->items[i].state;
  627. if (s == BRCMF_FWS_HANGER_ITEM_STATE_INUSE ||
  628. s == BRCMF_FWS_HANGER_ITEM_STATE_INUSE_SUPPRESSED) {
  629. skb = h->items[i].pkt;
  630. if (fn == NULL || fn(skb, &ifidx)) {
  631. /* suppress packets freed from psq */
  632. if (s == BRCMF_FWS_HANGER_ITEM_STATE_INUSE)
  633. brcmu_pkt_buf_free_skb(skb);
  634. h->items[i].state =
  635. BRCMF_FWS_HANGER_ITEM_STATE_FREE;
  636. }
  637. }
  638. }
  639. }
  640. static void brcmf_fws_macdesc_set_name(struct brcmf_fws_info *fws,
  641. struct brcmf_fws_mac_descriptor *desc)
  642. {
  643. if (desc == &fws->desc.other)
  644. strlcpy(desc->name, "MAC-OTHER", sizeof(desc->name));
  645. else if (desc->mac_handle)
  646. scnprintf(desc->name, sizeof(desc->name), "MAC-%d:%d",
  647. desc->mac_handle, desc->interface_id);
  648. else
  649. scnprintf(desc->name, sizeof(desc->name), "MACIF:%d",
  650. desc->interface_id);
  651. }
  652. static void brcmf_fws_macdesc_init(struct brcmf_fws_mac_descriptor *desc,
  653. u8 *addr, u8 ifidx)
  654. {
  655. brcmf_dbg(TRACE,
  656. "enter: desc %p ea=%pM, ifidx=%u\n", desc, addr, ifidx);
  657. desc->occupied = 1;
  658. desc->state = BRCMF_FWS_STATE_OPEN;
  659. desc->requested_credit = 0;
  660. desc->requested_packet = 0;
  661. /* depending on use may need ifp->bsscfgidx instead */
  662. desc->interface_id = ifidx;
  663. desc->ac_bitmap = 0xff; /* update this when handling APSD */
  664. if (addr)
  665. memcpy(&desc->ea[0], addr, ETH_ALEN);
  666. }
  667. static
  668. void brcmf_fws_macdesc_deinit(struct brcmf_fws_mac_descriptor *desc)
  669. {
  670. brcmf_dbg(TRACE,
  671. "enter: ea=%pM, ifidx=%u\n", desc->ea, desc->interface_id);
  672. desc->occupied = 0;
  673. desc->state = BRCMF_FWS_STATE_CLOSE;
  674. desc->requested_credit = 0;
  675. desc->requested_packet = 0;
  676. }
  677. static struct brcmf_fws_mac_descriptor *
  678. brcmf_fws_macdesc_lookup(struct brcmf_fws_info *fws, u8 *ea)
  679. {
  680. struct brcmf_fws_mac_descriptor *entry;
  681. int i;
  682. if (ea == NULL)
  683. return ERR_PTR(-EINVAL);
  684. entry = &fws->desc.nodes[0];
  685. for (i = 0; i < ARRAY_SIZE(fws->desc.nodes); i++) {
  686. if (entry->occupied && !memcmp(entry->ea, ea, ETH_ALEN))
  687. return entry;
  688. entry++;
  689. }
  690. return ERR_PTR(-ENOENT);
  691. }
  692. static struct brcmf_fws_mac_descriptor*
  693. brcmf_fws_macdesc_find(struct brcmf_fws_info *fws, struct brcmf_if *ifp, u8 *da)
  694. {
  695. struct brcmf_fws_mac_descriptor *entry = &fws->desc.other;
  696. bool multicast;
  697. multicast = is_multicast_ether_addr(da);
  698. /* Multicast destination, STA and P2P clients get the interface entry.
  699. * STA/GC gets the Mac Entry for TDLS destinations, TDLS destinations
  700. * have their own entry.
  701. */
  702. if (multicast && ifp->fws_desc) {
  703. entry = ifp->fws_desc;
  704. goto done;
  705. }
  706. entry = brcmf_fws_macdesc_lookup(fws, da);
  707. if (IS_ERR(entry))
  708. entry = ifp->fws_desc;
  709. done:
  710. return entry;
  711. }
  712. static bool brcmf_fws_macdesc_closed(struct brcmf_fws_info *fws,
  713. struct brcmf_fws_mac_descriptor *entry,
  714. int fifo)
  715. {
  716. struct brcmf_fws_mac_descriptor *if_entry;
  717. bool closed;
  718. /* for unique destination entries the related interface
  719. * may be closed.
  720. */
  721. if (entry->mac_handle) {
  722. if_entry = &fws->desc.iface[entry->interface_id];
  723. if (if_entry->state == BRCMF_FWS_STATE_CLOSE)
  724. return true;
  725. }
  726. /* an entry is closed when the state is closed and
  727. * the firmware did not request anything.
  728. */
  729. closed = entry->state == BRCMF_FWS_STATE_CLOSE &&
  730. !entry->requested_credit && !entry->requested_packet;
  731. /* Or firmware does not allow traffic for given fifo */
  732. return closed || !(entry->ac_bitmap & BIT(fifo));
  733. }
  734. static void brcmf_fws_macdesc_cleanup(struct brcmf_fws_info *fws,
  735. struct brcmf_fws_mac_descriptor *entry,
  736. int ifidx)
  737. {
  738. if (entry->occupied && (ifidx == -1 || ifidx == entry->interface_id)) {
  739. brcmf_fws_psq_flush(fws, &entry->psq, ifidx);
  740. entry->occupied = !!(entry->psq.len);
  741. }
  742. }
  743. static void brcmf_fws_bus_txq_cleanup(struct brcmf_fws_info *fws,
  744. bool (*fn)(struct sk_buff *, void *),
  745. int ifidx)
  746. {
  747. struct brcmf_fws_hanger_item *hi;
  748. struct pktq *txq;
  749. struct sk_buff *skb;
  750. int prec;
  751. u32 hslot;
  752. txq = brcmf_bus_gettxq(fws->drvr->bus_if);
  753. if (IS_ERR(txq)) {
  754. brcmf_dbg(TRACE, "no txq to clean up\n");
  755. return;
  756. }
  757. for (prec = 0; prec < txq->num_prec; prec++) {
  758. skb = brcmu_pktq_pdeq_match(txq, prec, fn, &ifidx);
  759. while (skb) {
  760. hslot = brcmf_skb_htod_tag_get_field(skb, HSLOT);
  761. hi = &fws->hanger.items[hslot];
  762. WARN_ON(skb != hi->pkt);
  763. hi->state = BRCMF_FWS_HANGER_ITEM_STATE_FREE;
  764. brcmu_pkt_buf_free_skb(skb);
  765. skb = brcmu_pktq_pdeq_match(txq, prec, fn, &ifidx);
  766. }
  767. }
  768. }
  769. static void brcmf_fws_cleanup(struct brcmf_fws_info *fws, int ifidx)
  770. {
  771. int i;
  772. struct brcmf_fws_mac_descriptor *table;
  773. bool (*matchfn)(struct sk_buff *, void *) = NULL;
  774. if (fws == NULL)
  775. return;
  776. if (ifidx != -1)
  777. matchfn = brcmf_fws_ifidx_match;
  778. /* cleanup individual nodes */
  779. table = &fws->desc.nodes[0];
  780. for (i = 0; i < ARRAY_SIZE(fws->desc.nodes); i++)
  781. brcmf_fws_macdesc_cleanup(fws, &table[i], ifidx);
  782. brcmf_fws_macdesc_cleanup(fws, &fws->desc.other, ifidx);
  783. brcmf_fws_bus_txq_cleanup(fws, matchfn, ifidx);
  784. brcmf_fws_hanger_cleanup(fws, matchfn, ifidx);
  785. }
  786. static u8 brcmf_fws_hdrpush(struct brcmf_fws_info *fws, struct sk_buff *skb)
  787. {
  788. struct brcmf_fws_mac_descriptor *entry = brcmf_skbcb(skb)->mac;
  789. u8 *wlh;
  790. u16 data_offset = 0;
  791. u8 fillers;
  792. __le32 pkttag = cpu_to_le32(brcmf_skbcb(skb)->htod);
  793. __le16 pktseq = cpu_to_le16(brcmf_skbcb(skb)->htod_seq);
  794. brcmf_dbg(TRACE, "enter: %s, idx=%d hslot=%d htod %X seq %X\n",
  795. entry->name, brcmf_skb_if_flags_get_field(skb, INDEX),
  796. (le32_to_cpu(pkttag) >> 8) & 0xffff,
  797. brcmf_skbcb(skb)->htod, brcmf_skbcb(skb)->htod_seq);
  798. if (entry->send_tim_signal)
  799. data_offset += 2 + BRCMF_FWS_TYPE_PENDING_TRAFFIC_BMP_LEN;
  800. if (BRCMF_FWS_MODE_GET_REUSESEQ(fws->mode))
  801. data_offset += BRCMF_FWS_TYPE_SEQ_LEN;
  802. /* +2 is for Type[1] and Len[1] in TLV, plus TIM signal */
  803. data_offset += 2 + BRCMF_FWS_TYPE_PKTTAG_LEN;
  804. fillers = round_up(data_offset, 4) - data_offset;
  805. data_offset += fillers;
  806. skb_push(skb, data_offset);
  807. wlh = skb->data;
  808. wlh[0] = BRCMF_FWS_TYPE_PKTTAG;
  809. wlh[1] = BRCMF_FWS_TYPE_PKTTAG_LEN;
  810. memcpy(&wlh[2], &pkttag, sizeof(pkttag));
  811. if (BRCMF_FWS_MODE_GET_REUSESEQ(fws->mode)) {
  812. wlh[1] += BRCMF_FWS_TYPE_SEQ_LEN;
  813. memcpy(&wlh[2 + BRCMF_FWS_TYPE_PKTTAG_LEN], &pktseq,
  814. sizeof(pktseq));
  815. }
  816. wlh += wlh[1] + 2;
  817. if (entry->send_tim_signal) {
  818. entry->send_tim_signal = 0;
  819. wlh[0] = BRCMF_FWS_TYPE_PENDING_TRAFFIC_BMP;
  820. wlh[1] = BRCMF_FWS_TYPE_PENDING_TRAFFIC_BMP_LEN;
  821. wlh[2] = entry->mac_handle;
  822. wlh[3] = entry->traffic_pending_bmp;
  823. brcmf_dbg(TRACE, "adding TIM info: handle %d bmp 0x%X\n",
  824. entry->mac_handle, entry->traffic_pending_bmp);
  825. wlh += BRCMF_FWS_TYPE_PENDING_TRAFFIC_BMP_LEN + 2;
  826. entry->traffic_lastreported_bmp = entry->traffic_pending_bmp;
  827. }
  828. if (fillers)
  829. memset(wlh, BRCMF_FWS_TYPE_FILLER, fillers);
  830. return (u8)(data_offset >> 2);
  831. }
  832. static bool brcmf_fws_tim_update(struct brcmf_fws_info *fws,
  833. struct brcmf_fws_mac_descriptor *entry,
  834. int fifo, bool send_immediately)
  835. {
  836. struct sk_buff *skb;
  837. struct brcmf_skbuff_cb *skcb;
  838. s32 err;
  839. u32 len;
  840. u8 data_offset;
  841. int ifidx;
  842. /* check delayedQ and suppressQ in one call using bitmap */
  843. if (brcmu_pktq_mlen(&entry->psq, 3 << (fifo * 2)) == 0)
  844. entry->traffic_pending_bmp &= ~NBITVAL(fifo);
  845. else
  846. entry->traffic_pending_bmp |= NBITVAL(fifo);
  847. entry->send_tim_signal = false;
  848. if (entry->traffic_lastreported_bmp != entry->traffic_pending_bmp)
  849. entry->send_tim_signal = true;
  850. if (send_immediately && entry->send_tim_signal &&
  851. entry->state == BRCMF_FWS_STATE_CLOSE) {
  852. /* create a dummy packet and sent that. The traffic */
  853. /* bitmap info will automatically be attached to that packet */
  854. len = BRCMF_FWS_TYPE_PKTTAG_LEN + 2 +
  855. BRCMF_FWS_TYPE_SEQ_LEN +
  856. BRCMF_FWS_TYPE_PENDING_TRAFFIC_BMP_LEN + 2 +
  857. 4 + fws->drvr->hdrlen;
  858. skb = brcmu_pkt_buf_get_skb(len);
  859. if (skb == NULL)
  860. return false;
  861. skb_pull(skb, len);
  862. skcb = brcmf_skbcb(skb);
  863. skcb->mac = entry;
  864. skcb->state = BRCMF_FWS_SKBSTATE_TIM;
  865. skcb->htod = 0;
  866. skcb->htod_seq = 0;
  867. data_offset = brcmf_fws_hdrpush(fws, skb);
  868. ifidx = brcmf_skb_if_flags_get_field(skb, INDEX);
  869. brcmf_fws_unlock(fws);
  870. err = brcmf_proto_txdata(fws->drvr, ifidx, data_offset, skb);
  871. brcmf_fws_lock(fws);
  872. if (err)
  873. brcmu_pkt_buf_free_skb(skb);
  874. return true;
  875. }
  876. return false;
  877. }
  878. static void
  879. brcmf_fws_flow_control_check(struct brcmf_fws_info *fws, struct pktq *pq,
  880. u8 if_id)
  881. {
  882. struct brcmf_if *ifp = brcmf_get_ifp(fws->drvr, if_id);
  883. if (WARN_ON(!ifp))
  884. return;
  885. if ((ifp->netif_stop & BRCMF_NETIF_STOP_REASON_FWS_FC) &&
  886. pq->len <= BRCMF_FWS_FLOWCONTROL_LOWATER)
  887. brcmf_txflowblock_if(ifp,
  888. BRCMF_NETIF_STOP_REASON_FWS_FC, false);
  889. if (!(ifp->netif_stop & BRCMF_NETIF_STOP_REASON_FWS_FC) &&
  890. pq->len >= BRCMF_FWS_FLOWCONTROL_HIWATER) {
  891. fws->stats.fws_flow_block++;
  892. brcmf_txflowblock_if(ifp, BRCMF_NETIF_STOP_REASON_FWS_FC, true);
  893. }
  894. return;
  895. }
  896. static int brcmf_fws_rssi_indicate(struct brcmf_fws_info *fws, s8 rssi)
  897. {
  898. brcmf_dbg(CTL, "rssi %d\n", rssi);
  899. return 0;
  900. }
  901. static
  902. int brcmf_fws_macdesc_indicate(struct brcmf_fws_info *fws, u8 type, u8 *data)
  903. {
  904. struct brcmf_fws_mac_descriptor *entry, *existing;
  905. u8 mac_handle;
  906. u8 ifidx;
  907. u8 *addr;
  908. mac_handle = *data++;
  909. ifidx = *data++;
  910. addr = data;
  911. entry = &fws->desc.nodes[mac_handle & 0x1F];
  912. if (type == BRCMF_FWS_TYPE_MACDESC_DEL) {
  913. if (entry->occupied) {
  914. brcmf_dbg(TRACE, "deleting %s mac %pM\n",
  915. entry->name, addr);
  916. brcmf_fws_lock(fws);
  917. brcmf_fws_macdesc_cleanup(fws, entry, -1);
  918. brcmf_fws_macdesc_deinit(entry);
  919. brcmf_fws_unlock(fws);
  920. } else
  921. fws->stats.mac_update_failed++;
  922. return 0;
  923. }
  924. existing = brcmf_fws_macdesc_lookup(fws, addr);
  925. if (IS_ERR(existing)) {
  926. if (!entry->occupied) {
  927. brcmf_fws_lock(fws);
  928. entry->mac_handle = mac_handle;
  929. brcmf_fws_macdesc_init(entry, addr, ifidx);
  930. brcmf_fws_macdesc_set_name(fws, entry);
  931. brcmu_pktq_init(&entry->psq, BRCMF_FWS_PSQ_PREC_COUNT,
  932. BRCMF_FWS_PSQ_LEN);
  933. brcmf_fws_unlock(fws);
  934. brcmf_dbg(TRACE, "add %s mac %pM\n", entry->name, addr);
  935. } else {
  936. fws->stats.mac_update_failed++;
  937. }
  938. } else {
  939. if (entry != existing) {
  940. brcmf_dbg(TRACE, "copy mac %s\n", existing->name);
  941. brcmf_fws_lock(fws);
  942. memcpy(entry, existing,
  943. offsetof(struct brcmf_fws_mac_descriptor, psq));
  944. entry->mac_handle = mac_handle;
  945. brcmf_fws_macdesc_deinit(existing);
  946. brcmf_fws_macdesc_set_name(fws, entry);
  947. brcmf_fws_unlock(fws);
  948. brcmf_dbg(TRACE, "relocate %s mac %pM\n", entry->name,
  949. addr);
  950. } else {
  951. brcmf_dbg(TRACE, "use existing\n");
  952. WARN_ON(entry->mac_handle != mac_handle);
  953. /* TODO: what should we do here: continue, reinit, .. */
  954. }
  955. }
  956. return 0;
  957. }
  958. static int brcmf_fws_macdesc_state_indicate(struct brcmf_fws_info *fws,
  959. u8 type, u8 *data)
  960. {
  961. struct brcmf_fws_mac_descriptor *entry;
  962. u8 mac_handle;
  963. int ret;
  964. mac_handle = data[0];
  965. entry = &fws->desc.nodes[mac_handle & 0x1F];
  966. if (!entry->occupied) {
  967. fws->stats.mac_ps_update_failed++;
  968. return -ESRCH;
  969. }
  970. brcmf_fws_lock(fws);
  971. /* a state update should wipe old credits */
  972. entry->requested_credit = 0;
  973. entry->requested_packet = 0;
  974. if (type == BRCMF_FWS_TYPE_MAC_OPEN) {
  975. entry->state = BRCMF_FWS_STATE_OPEN;
  976. ret = BRCMF_FWS_RET_OK_SCHEDULE;
  977. } else {
  978. entry->state = BRCMF_FWS_STATE_CLOSE;
  979. brcmf_fws_tim_update(fws, entry, BRCMF_FWS_FIFO_AC_BK, false);
  980. brcmf_fws_tim_update(fws, entry, BRCMF_FWS_FIFO_AC_BE, false);
  981. brcmf_fws_tim_update(fws, entry, BRCMF_FWS_FIFO_AC_VI, false);
  982. brcmf_fws_tim_update(fws, entry, BRCMF_FWS_FIFO_AC_VO, true);
  983. ret = BRCMF_FWS_RET_OK_NOSCHEDULE;
  984. }
  985. brcmf_fws_unlock(fws);
  986. return ret;
  987. }
  988. static int brcmf_fws_interface_state_indicate(struct brcmf_fws_info *fws,
  989. u8 type, u8 *data)
  990. {
  991. struct brcmf_fws_mac_descriptor *entry;
  992. u8 ifidx;
  993. int ret;
  994. ifidx = data[0];
  995. if (ifidx >= BRCMF_MAX_IFS) {
  996. ret = -ERANGE;
  997. goto fail;
  998. }
  999. entry = &fws->desc.iface[ifidx];
  1000. if (!entry->occupied) {
  1001. ret = -ESRCH;
  1002. goto fail;
  1003. }
  1004. brcmf_dbg(TRACE, "%s (%d): %s\n", brcmf_fws_get_tlv_name(type), type,
  1005. entry->name);
  1006. brcmf_fws_lock(fws);
  1007. switch (type) {
  1008. case BRCMF_FWS_TYPE_INTERFACE_OPEN:
  1009. entry->state = BRCMF_FWS_STATE_OPEN;
  1010. ret = BRCMF_FWS_RET_OK_SCHEDULE;
  1011. break;
  1012. case BRCMF_FWS_TYPE_INTERFACE_CLOSE:
  1013. entry->state = BRCMF_FWS_STATE_CLOSE;
  1014. ret = BRCMF_FWS_RET_OK_NOSCHEDULE;
  1015. break;
  1016. default:
  1017. ret = -EINVAL;
  1018. brcmf_fws_unlock(fws);
  1019. goto fail;
  1020. }
  1021. brcmf_fws_unlock(fws);
  1022. return ret;
  1023. fail:
  1024. fws->stats.if_update_failed++;
  1025. return ret;
  1026. }
  1027. static int brcmf_fws_request_indicate(struct brcmf_fws_info *fws, u8 type,
  1028. u8 *data)
  1029. {
  1030. struct brcmf_fws_mac_descriptor *entry;
  1031. entry = &fws->desc.nodes[data[1] & 0x1F];
  1032. if (!entry->occupied) {
  1033. if (type == BRCMF_FWS_TYPE_MAC_REQUEST_CREDIT)
  1034. fws->stats.credit_request_failed++;
  1035. else
  1036. fws->stats.packet_request_failed++;
  1037. return -ESRCH;
  1038. }
  1039. brcmf_dbg(TRACE, "%s (%d): %s cnt %d bmp %d\n",
  1040. brcmf_fws_get_tlv_name(type), type, entry->name,
  1041. data[0], data[2]);
  1042. brcmf_fws_lock(fws);
  1043. if (type == BRCMF_FWS_TYPE_MAC_REQUEST_CREDIT)
  1044. entry->requested_credit = data[0];
  1045. else
  1046. entry->requested_packet = data[0];
  1047. entry->ac_bitmap = data[2];
  1048. brcmf_fws_unlock(fws);
  1049. return BRCMF_FWS_RET_OK_SCHEDULE;
  1050. }
  1051. static void
  1052. brcmf_fws_macdesc_use_req_credit(struct brcmf_fws_mac_descriptor *entry,
  1053. struct sk_buff *skb)
  1054. {
  1055. if (entry->requested_credit > 0) {
  1056. entry->requested_credit--;
  1057. brcmf_skb_if_flags_set_field(skb, REQUESTED, 1);
  1058. brcmf_skb_if_flags_set_field(skb, REQ_CREDIT, 1);
  1059. if (entry->state != BRCMF_FWS_STATE_CLOSE)
  1060. brcmf_err("requested credit set while mac not closed!\n");
  1061. } else if (entry->requested_packet > 0) {
  1062. entry->requested_packet--;
  1063. brcmf_skb_if_flags_set_field(skb, REQUESTED, 1);
  1064. brcmf_skb_if_flags_set_field(skb, REQ_CREDIT, 0);
  1065. if (entry->state != BRCMF_FWS_STATE_CLOSE)
  1066. brcmf_err("requested packet set while mac not closed!\n");
  1067. } else {
  1068. brcmf_skb_if_flags_set_field(skb, REQUESTED, 0);
  1069. brcmf_skb_if_flags_set_field(skb, REQ_CREDIT, 0);
  1070. }
  1071. }
  1072. static void brcmf_fws_macdesc_return_req_credit(struct sk_buff *skb)
  1073. {
  1074. struct brcmf_fws_mac_descriptor *entry = brcmf_skbcb(skb)->mac;
  1075. if ((brcmf_skb_if_flags_get_field(skb, REQ_CREDIT)) &&
  1076. (entry->state == BRCMF_FWS_STATE_CLOSE))
  1077. entry->requested_credit++;
  1078. }
  1079. static void brcmf_fws_return_credits(struct brcmf_fws_info *fws,
  1080. u8 fifo, u8 credits)
  1081. {
  1082. int lender_ac;
  1083. int *borrowed;
  1084. int *fifo_credit;
  1085. if (!credits)
  1086. return;
  1087. fws->fifo_credit_map |= 1 << fifo;
  1088. if ((fifo == BRCMF_FWS_FIFO_AC_BE) &&
  1089. (fws->credits_borrowed[0])) {
  1090. for (lender_ac = BRCMF_FWS_FIFO_AC_VO; lender_ac >= 0;
  1091. lender_ac--) {
  1092. borrowed = &fws->credits_borrowed[lender_ac];
  1093. if (*borrowed) {
  1094. fws->fifo_credit_map |= (1 << lender_ac);
  1095. fifo_credit = &fws->fifo_credit[lender_ac];
  1096. if (*borrowed >= credits) {
  1097. *borrowed -= credits;
  1098. *fifo_credit += credits;
  1099. return;
  1100. } else {
  1101. credits -= *borrowed;
  1102. *fifo_credit += *borrowed;
  1103. *borrowed = 0;
  1104. }
  1105. }
  1106. }
  1107. }
  1108. fws->fifo_credit[fifo] += credits;
  1109. }
  1110. static void brcmf_fws_schedule_deq(struct brcmf_fws_info *fws)
  1111. {
  1112. /* only schedule dequeue when there are credits for delayed traffic */
  1113. if ((fws->fifo_credit_map & fws->fifo_delay_map) ||
  1114. (!brcmf_fws_fc_active(fws) && fws->fifo_delay_map))
  1115. queue_work(fws->fws_wq, &fws->fws_dequeue_work);
  1116. }
  1117. static int brcmf_fws_enq(struct brcmf_fws_info *fws,
  1118. enum brcmf_fws_skb_state state, int fifo,
  1119. struct sk_buff *p)
  1120. {
  1121. int prec = 2 * fifo;
  1122. u32 *qfull_stat = &fws->stats.delayq_full_error;
  1123. struct brcmf_fws_mac_descriptor *entry;
  1124. struct pktq *pq;
  1125. struct sk_buff_head *queue;
  1126. struct sk_buff *p_head;
  1127. struct sk_buff *p_tail;
  1128. u32 fr_new;
  1129. u32 fr_compare;
  1130. entry = brcmf_skbcb(p)->mac;
  1131. if (entry == NULL) {
  1132. brcmf_err("no mac descriptor found for skb %p\n", p);
  1133. return -ENOENT;
  1134. }
  1135. brcmf_dbg(DATA, "enter: fifo %d skb %p\n", fifo, p);
  1136. if (state == BRCMF_FWS_SKBSTATE_SUPPRESSED) {
  1137. prec += 1;
  1138. qfull_stat = &fws->stats.supprq_full_error;
  1139. /* Fix out of order delivery of frames. Dont assume frame */
  1140. /* can be inserted at the end, but look for correct position */
  1141. pq = &entry->psq;
  1142. if (pktq_full(pq) || pktq_pfull(pq, prec)) {
  1143. *qfull_stat += 1;
  1144. return -ENFILE;
  1145. }
  1146. queue = &pq->q[prec].skblist;
  1147. p_head = skb_peek(queue);
  1148. p_tail = skb_peek_tail(queue);
  1149. fr_new = brcmf_skb_htod_tag_get_field(p, FREERUN);
  1150. while (p_head != p_tail) {
  1151. fr_compare = brcmf_skb_htod_tag_get_field(p_tail,
  1152. FREERUN);
  1153. /* be sure to handle wrap of 256 */
  1154. if (((fr_new > fr_compare) &&
  1155. ((fr_new - fr_compare) < 128)) ||
  1156. ((fr_new < fr_compare) &&
  1157. ((fr_compare - fr_new) > 128)))
  1158. break;
  1159. p_tail = skb_queue_prev(queue, p_tail);
  1160. }
  1161. /* Position found. Determine what to do */
  1162. if (p_tail == NULL) {
  1163. /* empty list */
  1164. __skb_queue_tail(queue, p);
  1165. } else {
  1166. fr_compare = brcmf_skb_htod_tag_get_field(p_tail,
  1167. FREERUN);
  1168. if (((fr_new > fr_compare) &&
  1169. ((fr_new - fr_compare) < 128)) ||
  1170. ((fr_new < fr_compare) &&
  1171. ((fr_compare - fr_new) > 128))) {
  1172. /* After tail */
  1173. __skb_queue_after(queue, p_tail, p);
  1174. } else {
  1175. /* Before tail */
  1176. __skb_insert(p, p_tail->prev, p_tail, queue);
  1177. }
  1178. }
  1179. /* Complete the counters and statistics */
  1180. pq->len++;
  1181. if (pq->hi_prec < prec)
  1182. pq->hi_prec = (u8) prec;
  1183. } else if (brcmu_pktq_penq(&entry->psq, prec, p) == NULL) {
  1184. *qfull_stat += 1;
  1185. return -ENFILE;
  1186. }
  1187. /* increment total enqueued packet count */
  1188. fws->fifo_delay_map |= 1 << fifo;
  1189. fws->fifo_enqpkt[fifo]++;
  1190. /* update the sk_buff state */
  1191. brcmf_skbcb(p)->state = state;
  1192. /*
  1193. * A packet has been pushed so update traffic
  1194. * availability bitmap, if applicable
  1195. */
  1196. brcmf_fws_tim_update(fws, entry, fifo, true);
  1197. brcmf_fws_flow_control_check(fws, &entry->psq,
  1198. brcmf_skb_if_flags_get_field(p, INDEX));
  1199. return 0;
  1200. }
  1201. static struct sk_buff *brcmf_fws_deq(struct brcmf_fws_info *fws, int fifo)
  1202. {
  1203. struct brcmf_fws_mac_descriptor *table;
  1204. struct brcmf_fws_mac_descriptor *entry;
  1205. struct sk_buff *p;
  1206. int num_nodes;
  1207. int node_pos;
  1208. int prec_out;
  1209. int pmsk;
  1210. int i;
  1211. table = (struct brcmf_fws_mac_descriptor *)&fws->desc;
  1212. num_nodes = sizeof(fws->desc) / sizeof(struct brcmf_fws_mac_descriptor);
  1213. node_pos = fws->deq_node_pos[fifo];
  1214. for (i = 0; i < num_nodes; i++) {
  1215. entry = &table[(node_pos + i) % num_nodes];
  1216. if (!entry->occupied ||
  1217. brcmf_fws_macdesc_closed(fws, entry, fifo))
  1218. continue;
  1219. if (entry->suppressed)
  1220. pmsk = 2;
  1221. else
  1222. pmsk = 3;
  1223. p = brcmu_pktq_mdeq(&entry->psq, pmsk << (fifo * 2), &prec_out);
  1224. if (p == NULL) {
  1225. if (entry->suppressed) {
  1226. if (entry->suppr_transit_count)
  1227. continue;
  1228. entry->suppressed = false;
  1229. p = brcmu_pktq_mdeq(&entry->psq,
  1230. 1 << (fifo * 2), &prec_out);
  1231. }
  1232. }
  1233. if (p == NULL)
  1234. continue;
  1235. brcmf_fws_macdesc_use_req_credit(entry, p);
  1236. /* move dequeue position to ensure fair round-robin */
  1237. fws->deq_node_pos[fifo] = (node_pos + i + 1) % num_nodes;
  1238. brcmf_fws_flow_control_check(fws, &entry->psq,
  1239. brcmf_skb_if_flags_get_field(p,
  1240. INDEX)
  1241. );
  1242. /*
  1243. * A packet has been picked up, update traffic
  1244. * availability bitmap, if applicable
  1245. */
  1246. brcmf_fws_tim_update(fws, entry, fifo, false);
  1247. /*
  1248. * decrement total enqueued fifo packets and
  1249. * clear delay bitmap if done.
  1250. */
  1251. fws->fifo_enqpkt[fifo]--;
  1252. if (fws->fifo_enqpkt[fifo] == 0)
  1253. fws->fifo_delay_map &= ~(1 << fifo);
  1254. goto done;
  1255. }
  1256. p = NULL;
  1257. done:
  1258. brcmf_dbg(DATA, "exit: fifo %d skb %p\n", fifo, p);
  1259. return p;
  1260. }
  1261. static int brcmf_fws_txstatus_suppressed(struct brcmf_fws_info *fws, int fifo,
  1262. struct sk_buff *skb,
  1263. u32 genbit, u16 seq)
  1264. {
  1265. struct brcmf_fws_mac_descriptor *entry = brcmf_skbcb(skb)->mac;
  1266. u32 hslot;
  1267. int ret;
  1268. hslot = brcmf_skb_htod_tag_get_field(skb, HSLOT);
  1269. /* this packet was suppressed */
  1270. if (!entry->suppressed) {
  1271. entry->suppressed = true;
  1272. entry->suppr_transit_count = entry->transit_count;
  1273. brcmf_dbg(DATA, "suppress %s: transit %d\n",
  1274. entry->name, entry->transit_count);
  1275. }
  1276. entry->generation = genbit;
  1277. brcmf_skb_htod_tag_set_field(skb, GENERATION, genbit);
  1278. brcmf_skbcb(skb)->htod_seq = seq;
  1279. if (brcmf_skb_htod_seq_get_field(skb, FROMFW)) {
  1280. brcmf_skb_htod_seq_set_field(skb, FROMDRV, 1);
  1281. brcmf_skb_htod_seq_set_field(skb, FROMFW, 0);
  1282. } else {
  1283. brcmf_skb_htod_seq_set_field(skb, FROMDRV, 0);
  1284. }
  1285. ret = brcmf_fws_enq(fws, BRCMF_FWS_SKBSTATE_SUPPRESSED, fifo, skb);
  1286. if (ret != 0) {
  1287. /* suppress q is full drop this packet */
  1288. brcmf_fws_hanger_poppkt(&fws->hanger, hslot, &skb, true);
  1289. } else {
  1290. /* Mark suppressed to avoid a double free during wlfc cleanup */
  1291. brcmf_fws_hanger_mark_suppressed(&fws->hanger, hslot);
  1292. }
  1293. return ret;
  1294. }
  1295. static int
  1296. brcmf_fws_txs_process(struct brcmf_fws_info *fws, u8 flags, u32 hslot,
  1297. u32 genbit, u16 seq)
  1298. {
  1299. u32 fifo;
  1300. int ret;
  1301. bool remove_from_hanger = true;
  1302. struct sk_buff *skb;
  1303. struct brcmf_skbuff_cb *skcb;
  1304. struct brcmf_fws_mac_descriptor *entry = NULL;
  1305. struct brcmf_if *ifp;
  1306. brcmf_dbg(DATA, "flags %d\n", flags);
  1307. if (flags == BRCMF_FWS_TXSTATUS_DISCARD)
  1308. fws->stats.txs_discard++;
  1309. else if (flags == BRCMF_FWS_TXSTATUS_CORE_SUPPRESS) {
  1310. fws->stats.txs_supp_core++;
  1311. remove_from_hanger = false;
  1312. } else if (flags == BRCMF_FWS_TXSTATUS_FW_PS_SUPPRESS) {
  1313. fws->stats.txs_supp_ps++;
  1314. remove_from_hanger = false;
  1315. } else if (flags == BRCMF_FWS_TXSTATUS_FW_TOSSED)
  1316. fws->stats.txs_tossed++;
  1317. else if (flags == BRCMF_FWS_TXSTATUS_HOST_TOSSED)
  1318. fws->stats.txs_host_tossed++;
  1319. else
  1320. brcmf_err("unexpected txstatus\n");
  1321. ret = brcmf_fws_hanger_poppkt(&fws->hanger, hslot, &skb,
  1322. remove_from_hanger);
  1323. if (ret != 0) {
  1324. brcmf_err("no packet in hanger slot: hslot=%d\n", hslot);
  1325. return ret;
  1326. }
  1327. skcb = brcmf_skbcb(skb);
  1328. entry = skcb->mac;
  1329. if (WARN_ON(!entry)) {
  1330. brcmu_pkt_buf_free_skb(skb);
  1331. return -EINVAL;
  1332. }
  1333. entry->transit_count--;
  1334. if (entry->suppressed && entry->suppr_transit_count)
  1335. entry->suppr_transit_count--;
  1336. brcmf_dbg(DATA, "%s flags %d htod %X seq %X\n", entry->name, flags,
  1337. skcb->htod, seq);
  1338. /* pick up the implicit credit from this packet */
  1339. fifo = brcmf_skb_htod_tag_get_field(skb, FIFO);
  1340. if ((fws->fcmode == BRCMF_FWS_FCMODE_IMPLIED_CREDIT) ||
  1341. (brcmf_skb_if_flags_get_field(skb, REQ_CREDIT)) ||
  1342. (flags == BRCMF_FWS_TXSTATUS_HOST_TOSSED)) {
  1343. brcmf_fws_return_credits(fws, fifo, 1);
  1344. brcmf_fws_schedule_deq(fws);
  1345. }
  1346. brcmf_fws_macdesc_return_req_credit(skb);
  1347. ret = brcmf_proto_hdrpull(fws->drvr, false, skb, &ifp);
  1348. if (ret) {
  1349. brcmu_pkt_buf_free_skb(skb);
  1350. return -EINVAL;
  1351. }
  1352. if (!remove_from_hanger)
  1353. ret = brcmf_fws_txstatus_suppressed(fws, fifo, skb,
  1354. genbit, seq);
  1355. if (remove_from_hanger || ret)
  1356. brcmf_txfinalize(ifp, skb, true);
  1357. return 0;
  1358. }
  1359. static int brcmf_fws_fifocreditback_indicate(struct brcmf_fws_info *fws,
  1360. u8 *data)
  1361. {
  1362. int i;
  1363. if (fws->fcmode != BRCMF_FWS_FCMODE_EXPLICIT_CREDIT) {
  1364. brcmf_dbg(INFO, "ignored\n");
  1365. return BRCMF_FWS_RET_OK_NOSCHEDULE;
  1366. }
  1367. brcmf_dbg(DATA, "enter: data %pM\n", data);
  1368. brcmf_fws_lock(fws);
  1369. for (i = 0; i < BRCMF_FWS_FIFO_COUNT; i++)
  1370. brcmf_fws_return_credits(fws, i, data[i]);
  1371. brcmf_dbg(DATA, "map: credit %x delay %x\n", fws->fifo_credit_map,
  1372. fws->fifo_delay_map);
  1373. brcmf_fws_unlock(fws);
  1374. return BRCMF_FWS_RET_OK_SCHEDULE;
  1375. }
  1376. static int brcmf_fws_txstatus_indicate(struct brcmf_fws_info *fws, u8 *data)
  1377. {
  1378. __le32 status_le;
  1379. __le16 seq_le;
  1380. u32 status;
  1381. u32 hslot;
  1382. u32 genbit;
  1383. u8 flags;
  1384. u16 seq;
  1385. fws->stats.txs_indicate++;
  1386. memcpy(&status_le, data, sizeof(status_le));
  1387. status = le32_to_cpu(status_le);
  1388. flags = brcmf_txstatus_get_field(status, FLAGS);
  1389. hslot = brcmf_txstatus_get_field(status, HSLOT);
  1390. genbit = brcmf_txstatus_get_field(status, GENERATION);
  1391. if (BRCMF_FWS_MODE_GET_REUSESEQ(fws->mode)) {
  1392. memcpy(&seq_le, &data[BRCMF_FWS_TYPE_PKTTAG_LEN],
  1393. sizeof(seq_le));
  1394. seq = le16_to_cpu(seq_le);
  1395. } else {
  1396. seq = 0;
  1397. }
  1398. brcmf_fws_lock(fws);
  1399. brcmf_fws_txs_process(fws, flags, hslot, genbit, seq);
  1400. brcmf_fws_unlock(fws);
  1401. return BRCMF_FWS_RET_OK_NOSCHEDULE;
  1402. }
  1403. static int brcmf_fws_dbg_seqnum_check(struct brcmf_fws_info *fws, u8 *data)
  1404. {
  1405. __le32 timestamp;
  1406. memcpy(&timestamp, &data[2], sizeof(timestamp));
  1407. brcmf_dbg(CTL, "received: seq %d, timestamp %d\n", data[1],
  1408. le32_to_cpu(timestamp));
  1409. return 0;
  1410. }
  1411. static int brcmf_fws_notify_credit_map(struct brcmf_if *ifp,
  1412. const struct brcmf_event_msg *e,
  1413. void *data)
  1414. {
  1415. struct brcmf_fws_info *fws = ifp->drvr->fws;
  1416. int i;
  1417. u8 *credits = data;
  1418. if (e->datalen < BRCMF_FWS_FIFO_COUNT) {
  1419. brcmf_err("event payload too small (%d)\n", e->datalen);
  1420. return -EINVAL;
  1421. }
  1422. if (fws->creditmap_received)
  1423. return 0;
  1424. fws->creditmap_received = true;
  1425. brcmf_dbg(TRACE, "enter: credits %pM\n", credits);
  1426. brcmf_fws_lock(fws);
  1427. for (i = 0; i < ARRAY_SIZE(fws->fifo_credit); i++) {
  1428. if (*credits)
  1429. fws->fifo_credit_map |= 1 << i;
  1430. else
  1431. fws->fifo_credit_map &= ~(1 << i);
  1432. fws->fifo_credit[i] = *credits++;
  1433. }
  1434. brcmf_fws_schedule_deq(fws);
  1435. brcmf_fws_unlock(fws);
  1436. return 0;
  1437. }
  1438. static int brcmf_fws_notify_bcmc_credit_support(struct brcmf_if *ifp,
  1439. const struct brcmf_event_msg *e,
  1440. void *data)
  1441. {
  1442. struct brcmf_fws_info *fws = ifp->drvr->fws;
  1443. if (fws) {
  1444. brcmf_fws_lock(fws);
  1445. fws->bcmc_credit_check = true;
  1446. brcmf_fws_unlock(fws);
  1447. }
  1448. return 0;
  1449. }
  1450. static void brcmf_rxreorder_get_skb_list(struct brcmf_ampdu_rx_reorder *rfi,
  1451. u8 start, u8 end,
  1452. struct sk_buff_head *skb_list)
  1453. {
  1454. /* initialize return list */
  1455. __skb_queue_head_init(skb_list);
  1456. if (rfi->pend_pkts == 0) {
  1457. brcmf_dbg(INFO, "no packets in reorder queue\n");
  1458. return;
  1459. }
  1460. do {
  1461. if (rfi->pktslots[start]) {
  1462. __skb_queue_tail(skb_list, rfi->pktslots[start]);
  1463. rfi->pktslots[start] = NULL;
  1464. }
  1465. start++;
  1466. if (start > rfi->max_idx)
  1467. start = 0;
  1468. } while (start != end);
  1469. rfi->pend_pkts -= skb_queue_len(skb_list);
  1470. }
  1471. void brcmf_fws_rxreorder(struct brcmf_if *ifp, struct sk_buff *pkt)
  1472. {
  1473. u8 *reorder_data;
  1474. u8 flow_id, max_idx, cur_idx, exp_idx, end_idx;
  1475. struct brcmf_ampdu_rx_reorder *rfi;
  1476. struct sk_buff_head reorder_list;
  1477. struct sk_buff *pnext;
  1478. u8 flags;
  1479. u32 buf_size;
  1480. reorder_data = ((struct brcmf_skb_reorder_data *)pkt->cb)->reorder;
  1481. flow_id = reorder_data[BRCMF_RXREORDER_FLOWID_OFFSET];
  1482. flags = reorder_data[BRCMF_RXREORDER_FLAGS_OFFSET];
  1483. /* validate flags and flow id */
  1484. if (flags == 0xFF) {
  1485. brcmf_err("invalid flags...so ignore this packet\n");
  1486. brcmf_netif_rx(ifp, pkt);
  1487. return;
  1488. }
  1489. rfi = ifp->drvr->reorder_flows[flow_id];
  1490. if (flags & BRCMF_RXREORDER_DEL_FLOW) {
  1491. brcmf_dbg(INFO, "flow-%d: delete\n",
  1492. flow_id);
  1493. if (rfi == NULL) {
  1494. brcmf_dbg(INFO, "received flags to cleanup, but no flow (%d) yet\n",
  1495. flow_id);
  1496. brcmf_netif_rx(ifp, pkt);
  1497. return;
  1498. }
  1499. brcmf_rxreorder_get_skb_list(rfi, rfi->exp_idx, rfi->exp_idx,
  1500. &reorder_list);
  1501. /* add the last packet */
  1502. __skb_queue_tail(&reorder_list, pkt);
  1503. kfree(rfi);
  1504. ifp->drvr->reorder_flows[flow_id] = NULL;
  1505. goto netif_rx;
  1506. }
  1507. /* from here on we need a flow reorder instance */
  1508. if (rfi == NULL) {
  1509. buf_size = sizeof(*rfi);
  1510. max_idx = reorder_data[BRCMF_RXREORDER_MAXIDX_OFFSET];
  1511. buf_size += (max_idx + 1) * sizeof(pkt);
  1512. /* allocate space for flow reorder info */
  1513. brcmf_dbg(INFO, "flow-%d: start, maxidx %d\n",
  1514. flow_id, max_idx);
  1515. rfi = kzalloc(buf_size, GFP_ATOMIC);
  1516. if (rfi == NULL) {
  1517. brcmf_err("failed to alloc buffer\n");
  1518. brcmf_netif_rx(ifp, pkt);
  1519. return;
  1520. }
  1521. ifp->drvr->reorder_flows[flow_id] = rfi;
  1522. rfi->pktslots = (struct sk_buff **)(rfi + 1);
  1523. rfi->max_idx = max_idx;
  1524. }
  1525. if (flags & BRCMF_RXREORDER_NEW_HOLE) {
  1526. if (rfi->pend_pkts) {
  1527. brcmf_rxreorder_get_skb_list(rfi, rfi->exp_idx,
  1528. rfi->exp_idx,
  1529. &reorder_list);
  1530. WARN_ON(rfi->pend_pkts);
  1531. } else {
  1532. __skb_queue_head_init(&reorder_list);
  1533. }
  1534. rfi->cur_idx = reorder_data[BRCMF_RXREORDER_CURIDX_OFFSET];
  1535. rfi->exp_idx = reorder_data[BRCMF_RXREORDER_EXPIDX_OFFSET];
  1536. rfi->max_idx = reorder_data[BRCMF_RXREORDER_MAXIDX_OFFSET];
  1537. rfi->pktslots[rfi->cur_idx] = pkt;
  1538. rfi->pend_pkts++;
  1539. brcmf_dbg(DATA, "flow-%d: new hole %d (%d), pending %d\n",
  1540. flow_id, rfi->cur_idx, rfi->exp_idx, rfi->pend_pkts);
  1541. } else if (flags & BRCMF_RXREORDER_CURIDX_VALID) {
  1542. cur_idx = reorder_data[BRCMF_RXREORDER_CURIDX_OFFSET];
  1543. exp_idx = reorder_data[BRCMF_RXREORDER_EXPIDX_OFFSET];
  1544. if ((exp_idx == rfi->exp_idx) && (cur_idx != rfi->exp_idx)) {
  1545. /* still in the current hole */
  1546. /* enqueue the current on the buffer chain */
  1547. if (rfi->pktslots[cur_idx] != NULL) {
  1548. brcmf_dbg(INFO, "HOLE: ERROR buffer pending..free it\n");
  1549. brcmu_pkt_buf_free_skb(rfi->pktslots[cur_idx]);
  1550. rfi->pktslots[cur_idx] = NULL;
  1551. }
  1552. rfi->pktslots[cur_idx] = pkt;
  1553. rfi->pend_pkts++;
  1554. rfi->cur_idx = cur_idx;
  1555. brcmf_dbg(DATA, "flow-%d: store pkt %d (%d), pending %d\n",
  1556. flow_id, cur_idx, exp_idx, rfi->pend_pkts);
  1557. /* can return now as there is no reorder
  1558. * list to process.
  1559. */
  1560. return;
  1561. }
  1562. if (rfi->exp_idx == cur_idx) {
  1563. if (rfi->pktslots[cur_idx] != NULL) {
  1564. brcmf_dbg(INFO, "error buffer pending..free it\n");
  1565. brcmu_pkt_buf_free_skb(rfi->pktslots[cur_idx]);
  1566. rfi->pktslots[cur_idx] = NULL;
  1567. }
  1568. rfi->pktslots[cur_idx] = pkt;
  1569. rfi->pend_pkts++;
  1570. /* got the expected one. flush from current to expected
  1571. * and update expected
  1572. */
  1573. brcmf_dbg(DATA, "flow-%d: expected %d (%d), pending %d\n",
  1574. flow_id, cur_idx, exp_idx, rfi->pend_pkts);
  1575. rfi->cur_idx = cur_idx;
  1576. rfi->exp_idx = exp_idx;
  1577. brcmf_rxreorder_get_skb_list(rfi, cur_idx, exp_idx,
  1578. &reorder_list);
  1579. brcmf_dbg(DATA, "flow-%d: freeing buffers %d, pending %d\n",
  1580. flow_id, skb_queue_len(&reorder_list),
  1581. rfi->pend_pkts);
  1582. } else {
  1583. u8 end_idx;
  1584. brcmf_dbg(DATA, "flow-%d (0x%x): both moved, old %d/%d, new %d/%d\n",
  1585. flow_id, flags, rfi->cur_idx, rfi->exp_idx,
  1586. cur_idx, exp_idx);
  1587. if (flags & BRCMF_RXREORDER_FLUSH_ALL)
  1588. end_idx = rfi->exp_idx;
  1589. else
  1590. end_idx = exp_idx;
  1591. /* flush pkts first */
  1592. brcmf_rxreorder_get_skb_list(rfi, rfi->exp_idx, end_idx,
  1593. &reorder_list);
  1594. if (exp_idx == ((cur_idx + 1) % (rfi->max_idx + 1))) {
  1595. __skb_queue_tail(&reorder_list, pkt);
  1596. } else {
  1597. rfi->pktslots[cur_idx] = pkt;
  1598. rfi->pend_pkts++;
  1599. }
  1600. rfi->exp_idx = exp_idx;
  1601. rfi->cur_idx = cur_idx;
  1602. }
  1603. } else {
  1604. /* explicity window move updating the expected index */
  1605. exp_idx = reorder_data[BRCMF_RXREORDER_EXPIDX_OFFSET];
  1606. brcmf_dbg(DATA, "flow-%d (0x%x): change expected: %d -> %d\n",
  1607. flow_id, flags, rfi->exp_idx, exp_idx);
  1608. if (flags & BRCMF_RXREORDER_FLUSH_ALL)
  1609. end_idx = rfi->exp_idx;
  1610. else
  1611. end_idx = exp_idx;
  1612. brcmf_rxreorder_get_skb_list(rfi, rfi->exp_idx, end_idx,
  1613. &reorder_list);
  1614. __skb_queue_tail(&reorder_list, pkt);
  1615. /* set the new expected idx */
  1616. rfi->exp_idx = exp_idx;
  1617. }
  1618. netif_rx:
  1619. skb_queue_walk_safe(&reorder_list, pkt, pnext) {
  1620. __skb_unlink(pkt, &reorder_list);
  1621. brcmf_netif_rx(ifp, pkt);
  1622. }
  1623. }
  1624. void brcmf_fws_hdrpull(struct brcmf_if *ifp, s16 siglen, struct sk_buff *skb)
  1625. {
  1626. struct brcmf_skb_reorder_data *rd;
  1627. struct brcmf_fws_info *fws = ifp->drvr->fws;
  1628. u8 *signal_data;
  1629. s16 data_len;
  1630. u8 type;
  1631. u8 len;
  1632. u8 *data;
  1633. s32 status;
  1634. s32 err;
  1635. brcmf_dbg(HDRS, "enter: ifidx %d, skblen %u, sig %d\n",
  1636. ifp->ifidx, skb->len, siglen);
  1637. WARN_ON(siglen > skb->len);
  1638. if (!siglen)
  1639. return;
  1640. /* if flow control disabled, skip to packet data and leave */
  1641. if ((!fws) || (!fws->fw_signals)) {
  1642. skb_pull(skb, siglen);
  1643. return;
  1644. }
  1645. fws->stats.header_pulls++;
  1646. data_len = siglen;
  1647. signal_data = skb->data;
  1648. status = BRCMF_FWS_RET_OK_NOSCHEDULE;
  1649. while (data_len > 0) {
  1650. /* extract tlv info */
  1651. type = signal_data[0];
  1652. /* FILLER type is actually not a TLV, but
  1653. * a single byte that can be skipped.
  1654. */
  1655. if (type == BRCMF_FWS_TYPE_FILLER) {
  1656. signal_data += 1;
  1657. data_len -= 1;
  1658. continue;
  1659. }
  1660. len = signal_data[1];
  1661. data = signal_data + 2;
  1662. brcmf_dbg(HDRS, "tlv type=%s (%d), len=%d (%d)\n",
  1663. brcmf_fws_get_tlv_name(type), type, len,
  1664. brcmf_fws_get_tlv_len(fws, type));
  1665. /* abort parsing when length invalid */
  1666. if (data_len < len + 2)
  1667. break;
  1668. if (len < brcmf_fws_get_tlv_len(fws, type))
  1669. break;
  1670. err = BRCMF_FWS_RET_OK_NOSCHEDULE;
  1671. switch (type) {
  1672. case BRCMF_FWS_TYPE_COMP_TXSTATUS:
  1673. break;
  1674. case BRCMF_FWS_TYPE_HOST_REORDER_RXPKTS:
  1675. rd = (struct brcmf_skb_reorder_data *)skb->cb;
  1676. rd->reorder = data;
  1677. break;
  1678. case BRCMF_FWS_TYPE_MACDESC_ADD:
  1679. case BRCMF_FWS_TYPE_MACDESC_DEL:
  1680. brcmf_fws_macdesc_indicate(fws, type, data);
  1681. break;
  1682. case BRCMF_FWS_TYPE_MAC_OPEN:
  1683. case BRCMF_FWS_TYPE_MAC_CLOSE:
  1684. err = brcmf_fws_macdesc_state_indicate(fws, type, data);
  1685. break;
  1686. case BRCMF_FWS_TYPE_INTERFACE_OPEN:
  1687. case BRCMF_FWS_TYPE_INTERFACE_CLOSE:
  1688. err = brcmf_fws_interface_state_indicate(fws, type,
  1689. data);
  1690. break;
  1691. case BRCMF_FWS_TYPE_MAC_REQUEST_CREDIT:
  1692. case BRCMF_FWS_TYPE_MAC_REQUEST_PACKET:
  1693. err = brcmf_fws_request_indicate(fws, type, data);
  1694. break;
  1695. case BRCMF_FWS_TYPE_TXSTATUS:
  1696. brcmf_fws_txstatus_indicate(fws, data);
  1697. break;
  1698. case BRCMF_FWS_TYPE_FIFO_CREDITBACK:
  1699. err = brcmf_fws_fifocreditback_indicate(fws, data);
  1700. break;
  1701. case BRCMF_FWS_TYPE_RSSI:
  1702. brcmf_fws_rssi_indicate(fws, *data);
  1703. break;
  1704. case BRCMF_FWS_TYPE_TRANS_ID:
  1705. brcmf_fws_dbg_seqnum_check(fws, data);
  1706. break;
  1707. case BRCMF_FWS_TYPE_PKTTAG:
  1708. case BRCMF_FWS_TYPE_PENDING_TRAFFIC_BMP:
  1709. default:
  1710. fws->stats.tlv_invalid_type++;
  1711. break;
  1712. }
  1713. if (err == BRCMF_FWS_RET_OK_SCHEDULE)
  1714. status = BRCMF_FWS_RET_OK_SCHEDULE;
  1715. signal_data += len + 2;
  1716. data_len -= len + 2;
  1717. }
  1718. if (data_len != 0)
  1719. fws->stats.tlv_parse_failed++;
  1720. if (status == BRCMF_FWS_RET_OK_SCHEDULE)
  1721. brcmf_fws_schedule_deq(fws);
  1722. /* signalling processing result does
  1723. * not affect the actual ethernet packet.
  1724. */
  1725. skb_pull(skb, siglen);
  1726. /* this may be a signal-only packet
  1727. */
  1728. if (skb->len == 0)
  1729. fws->stats.header_only_pkt++;
  1730. }
  1731. static u8 brcmf_fws_precommit_skb(struct brcmf_fws_info *fws, int fifo,
  1732. struct sk_buff *p)
  1733. {
  1734. struct brcmf_skbuff_cb *skcb = brcmf_skbcb(p);
  1735. struct brcmf_fws_mac_descriptor *entry = skcb->mac;
  1736. u8 flags;
  1737. if (skcb->state != BRCMF_FWS_SKBSTATE_SUPPRESSED)
  1738. brcmf_skb_htod_tag_set_field(p, GENERATION, entry->generation);
  1739. flags = BRCMF_FWS_HTOD_FLAG_PKTFROMHOST;
  1740. if (brcmf_skb_if_flags_get_field(p, REQUESTED)) {
  1741. /*
  1742. * Indicate that this packet is being sent in response to an
  1743. * explicit request from the firmware side.
  1744. */
  1745. flags |= BRCMF_FWS_HTOD_FLAG_PKT_REQUESTED;
  1746. }
  1747. brcmf_skb_htod_tag_set_field(p, FLAGS, flags);
  1748. return brcmf_fws_hdrpush(fws, p);
  1749. }
  1750. static void brcmf_fws_rollback_toq(struct brcmf_fws_info *fws,
  1751. struct sk_buff *skb, int fifo)
  1752. {
  1753. struct brcmf_fws_mac_descriptor *entry;
  1754. struct sk_buff *pktout;
  1755. int qidx, hslot;
  1756. int rc = 0;
  1757. entry = brcmf_skbcb(skb)->mac;
  1758. if (entry->occupied) {
  1759. qidx = 2 * fifo;
  1760. if (brcmf_skbcb(skb)->state == BRCMF_FWS_SKBSTATE_SUPPRESSED)
  1761. qidx++;
  1762. pktout = brcmu_pktq_penq_head(&entry->psq, qidx, skb);
  1763. if (pktout == NULL) {
  1764. brcmf_err("%s queue %d full\n", entry->name, qidx);
  1765. rc = -ENOSPC;
  1766. }
  1767. } else {
  1768. brcmf_err("%s entry removed\n", entry->name);
  1769. rc = -ENOENT;
  1770. }
  1771. if (rc) {
  1772. fws->stats.rollback_failed++;
  1773. hslot = brcmf_skb_htod_tag_get_field(skb, HSLOT);
  1774. brcmf_fws_txs_process(fws, BRCMF_FWS_TXSTATUS_HOST_TOSSED,
  1775. hslot, 0, 0);
  1776. } else {
  1777. fws->stats.rollback_success++;
  1778. brcmf_fws_return_credits(fws, fifo, 1);
  1779. brcmf_fws_macdesc_return_req_credit(skb);
  1780. }
  1781. }
  1782. static int brcmf_fws_borrow_credit(struct brcmf_fws_info *fws)
  1783. {
  1784. int lender_ac;
  1785. if (time_after(fws->borrow_defer_timestamp, jiffies)) {
  1786. fws->fifo_credit_map &= ~(1 << BRCMF_FWS_FIFO_AC_BE);
  1787. return -ENAVAIL;
  1788. }
  1789. for (lender_ac = 0; lender_ac <= BRCMF_FWS_FIFO_AC_VO; lender_ac++) {
  1790. if (fws->fifo_credit[lender_ac]) {
  1791. fws->credits_borrowed[lender_ac]++;
  1792. fws->fifo_credit[lender_ac]--;
  1793. if (fws->fifo_credit[lender_ac] == 0)
  1794. fws->fifo_credit_map &= ~(1 << lender_ac);
  1795. fws->fifo_credit_map |= (1 << BRCMF_FWS_FIFO_AC_BE);
  1796. brcmf_dbg(DATA, "borrow credit from: %d\n", lender_ac);
  1797. return 0;
  1798. }
  1799. }
  1800. fws->fifo_credit_map &= ~(1 << BRCMF_FWS_FIFO_AC_BE);
  1801. return -ENAVAIL;
  1802. }
  1803. static int brcmf_fws_commit_skb(struct brcmf_fws_info *fws, int fifo,
  1804. struct sk_buff *skb)
  1805. {
  1806. struct brcmf_skbuff_cb *skcb = brcmf_skbcb(skb);
  1807. struct brcmf_fws_mac_descriptor *entry;
  1808. int rc;
  1809. u8 ifidx;
  1810. u8 data_offset;
  1811. entry = skcb->mac;
  1812. if (IS_ERR(entry))
  1813. return PTR_ERR(entry);
  1814. data_offset = brcmf_fws_precommit_skb(fws, fifo, skb);
  1815. entry->transit_count++;
  1816. if (entry->suppressed)
  1817. entry->suppr_transit_count++;
  1818. ifidx = brcmf_skb_if_flags_get_field(skb, INDEX);
  1819. brcmf_fws_unlock(fws);
  1820. rc = brcmf_proto_txdata(fws->drvr, ifidx, data_offset, skb);
  1821. brcmf_fws_lock(fws);
  1822. brcmf_dbg(DATA, "%s flags %X htod %X bus_tx %d\n", entry->name,
  1823. skcb->if_flags, skcb->htod, rc);
  1824. if (rc < 0) {
  1825. entry->transit_count--;
  1826. if (entry->suppressed)
  1827. entry->suppr_transit_count--;
  1828. (void)brcmf_proto_hdrpull(fws->drvr, false, skb, NULL);
  1829. goto rollback;
  1830. }
  1831. fws->stats.pkt2bus++;
  1832. fws->stats.send_pkts[fifo]++;
  1833. if (brcmf_skb_if_flags_get_field(skb, REQUESTED))
  1834. fws->stats.requested_sent[fifo]++;
  1835. return rc;
  1836. rollback:
  1837. brcmf_fws_rollback_toq(fws, skb, fifo);
  1838. return rc;
  1839. }
  1840. static int brcmf_fws_assign_htod(struct brcmf_fws_info *fws, struct sk_buff *p,
  1841. int fifo)
  1842. {
  1843. struct brcmf_skbuff_cb *skcb = brcmf_skbcb(p);
  1844. int rc, hslot;
  1845. skcb->htod = 0;
  1846. skcb->htod_seq = 0;
  1847. hslot = brcmf_fws_hanger_get_free_slot(&fws->hanger);
  1848. brcmf_skb_htod_tag_set_field(p, HSLOT, hslot);
  1849. brcmf_skb_htod_tag_set_field(p, FREERUN, skcb->mac->seq[fifo]);
  1850. brcmf_skb_htod_tag_set_field(p, FIFO, fifo);
  1851. rc = brcmf_fws_hanger_pushpkt(&fws->hanger, p, hslot);
  1852. if (!rc)
  1853. skcb->mac->seq[fifo]++;
  1854. else
  1855. fws->stats.generic_error++;
  1856. return rc;
  1857. }
  1858. int brcmf_fws_process_skb(struct brcmf_if *ifp, struct sk_buff *skb)
  1859. {
  1860. struct brcmf_pub *drvr = ifp->drvr;
  1861. struct brcmf_fws_info *fws = drvr->fws;
  1862. struct brcmf_skbuff_cb *skcb = brcmf_skbcb(skb);
  1863. struct ethhdr *eh = (struct ethhdr *)(skb->data);
  1864. int fifo = BRCMF_FWS_FIFO_BCMC;
  1865. bool multicast = is_multicast_ether_addr(eh->h_dest);
  1866. int rc = 0;
  1867. brcmf_dbg(DATA, "tx proto=0x%X\n", ntohs(eh->h_proto));
  1868. /* determine the priority */
  1869. if ((skb->priority == 0) || (skb->priority > 7))
  1870. skb->priority = cfg80211_classify8021d(skb, NULL);
  1871. drvr->tx_multicast += !!multicast;
  1872. if (fws->avoid_queueing) {
  1873. rc = brcmf_proto_txdata(drvr, ifp->ifidx, 0, skb);
  1874. if (rc < 0)
  1875. brcmf_txfinalize(ifp, skb, false);
  1876. return rc;
  1877. }
  1878. /* set control buffer information */
  1879. skcb->if_flags = 0;
  1880. skcb->state = BRCMF_FWS_SKBSTATE_NEW;
  1881. brcmf_skb_if_flags_set_field(skb, INDEX, ifp->ifidx);
  1882. if (!multicast)
  1883. fifo = brcmf_fws_prio2fifo[skb->priority];
  1884. brcmf_fws_lock(fws);
  1885. if (fifo != BRCMF_FWS_FIFO_AC_BE && fifo < BRCMF_FWS_FIFO_BCMC)
  1886. fws->borrow_defer_timestamp = jiffies +
  1887. BRCMF_FWS_BORROW_DEFER_PERIOD;
  1888. skcb->mac = brcmf_fws_macdesc_find(fws, ifp, eh->h_dest);
  1889. brcmf_dbg(DATA, "%s mac %pM multi %d fifo %d\n", skcb->mac->name,
  1890. eh->h_dest, multicast, fifo);
  1891. if (!brcmf_fws_assign_htod(fws, skb, fifo)) {
  1892. brcmf_fws_enq(fws, BRCMF_FWS_SKBSTATE_DELAYED, fifo, skb);
  1893. brcmf_fws_schedule_deq(fws);
  1894. } else {
  1895. brcmf_err("drop skb: no hanger slot\n");
  1896. brcmf_txfinalize(ifp, skb, false);
  1897. rc = -ENOMEM;
  1898. }
  1899. brcmf_fws_unlock(fws);
  1900. return rc;
  1901. }
  1902. void brcmf_fws_reset_interface(struct brcmf_if *ifp)
  1903. {
  1904. struct brcmf_fws_mac_descriptor *entry = ifp->fws_desc;
  1905. brcmf_dbg(TRACE, "enter: bsscfgidx=%d\n", ifp->bsscfgidx);
  1906. if (!entry)
  1907. return;
  1908. brcmf_fws_macdesc_init(entry, ifp->mac_addr, ifp->ifidx);
  1909. }
  1910. void brcmf_fws_add_interface(struct brcmf_if *ifp)
  1911. {
  1912. struct brcmf_fws_info *fws = ifp->drvr->fws;
  1913. struct brcmf_fws_mac_descriptor *entry;
  1914. if (!ifp->ndev)
  1915. return;
  1916. entry = &fws->desc.iface[ifp->ifidx];
  1917. ifp->fws_desc = entry;
  1918. brcmf_fws_macdesc_init(entry, ifp->mac_addr, ifp->ifidx);
  1919. brcmf_fws_macdesc_set_name(fws, entry);
  1920. brcmu_pktq_init(&entry->psq, BRCMF_FWS_PSQ_PREC_COUNT,
  1921. BRCMF_FWS_PSQ_LEN);
  1922. brcmf_dbg(TRACE, "added %s\n", entry->name);
  1923. }
  1924. void brcmf_fws_del_interface(struct brcmf_if *ifp)
  1925. {
  1926. struct brcmf_fws_mac_descriptor *entry = ifp->fws_desc;
  1927. if (!entry)
  1928. return;
  1929. brcmf_fws_lock(ifp->drvr->fws);
  1930. ifp->fws_desc = NULL;
  1931. brcmf_dbg(TRACE, "deleting %s\n", entry->name);
  1932. brcmf_fws_macdesc_deinit(entry);
  1933. brcmf_fws_cleanup(ifp->drvr->fws, ifp->ifidx);
  1934. brcmf_fws_unlock(ifp->drvr->fws);
  1935. }
  1936. static void brcmf_fws_dequeue_worker(struct work_struct *worker)
  1937. {
  1938. struct brcmf_fws_info *fws;
  1939. struct brcmf_pub *drvr;
  1940. struct sk_buff *skb;
  1941. int fifo;
  1942. u32 hslot;
  1943. u32 ifidx;
  1944. int ret;
  1945. fws = container_of(worker, struct brcmf_fws_info, fws_dequeue_work);
  1946. drvr = fws->drvr;
  1947. brcmf_fws_lock(fws);
  1948. for (fifo = BRCMF_FWS_FIFO_BCMC; fifo >= 0 && !fws->bus_flow_blocked;
  1949. fifo--) {
  1950. if (!brcmf_fws_fc_active(fws)) {
  1951. while ((skb = brcmf_fws_deq(fws, fifo)) != NULL) {
  1952. hslot = brcmf_skb_htod_tag_get_field(skb,
  1953. HSLOT);
  1954. brcmf_fws_hanger_poppkt(&fws->hanger, hslot,
  1955. &skb, true);
  1956. ifidx = brcmf_skb_if_flags_get_field(skb,
  1957. INDEX);
  1958. /* Use proto layer to send data frame */
  1959. brcmf_fws_unlock(fws);
  1960. ret = brcmf_proto_txdata(drvr, ifidx, 0, skb);
  1961. brcmf_fws_lock(fws);
  1962. if (ret < 0)
  1963. brcmf_txfinalize(brcmf_get_ifp(drvr,
  1964. ifidx),
  1965. skb, false);
  1966. if (fws->bus_flow_blocked)
  1967. break;
  1968. }
  1969. continue;
  1970. }
  1971. while ((fws->fifo_credit[fifo]) || ((!fws->bcmc_credit_check) &&
  1972. (fifo == BRCMF_FWS_FIFO_BCMC))) {
  1973. skb = brcmf_fws_deq(fws, fifo);
  1974. if (!skb)
  1975. break;
  1976. fws->fifo_credit[fifo]--;
  1977. if (brcmf_fws_commit_skb(fws, fifo, skb))
  1978. break;
  1979. if (fws->bus_flow_blocked)
  1980. break;
  1981. }
  1982. if ((fifo == BRCMF_FWS_FIFO_AC_BE) &&
  1983. (fws->fifo_credit[fifo] == 0) &&
  1984. (!fws->bus_flow_blocked)) {
  1985. while (brcmf_fws_borrow_credit(fws) == 0) {
  1986. skb = brcmf_fws_deq(fws, fifo);
  1987. if (!skb) {
  1988. brcmf_fws_return_credits(fws, fifo, 1);
  1989. break;
  1990. }
  1991. if (brcmf_fws_commit_skb(fws, fifo, skb))
  1992. break;
  1993. if (fws->bus_flow_blocked)
  1994. break;
  1995. }
  1996. }
  1997. }
  1998. brcmf_fws_unlock(fws);
  1999. }
  2000. #ifdef DEBUG
  2001. static int brcmf_debugfs_fws_stats_read(struct seq_file *seq, void *data)
  2002. {
  2003. struct brcmf_bus *bus_if = dev_get_drvdata(seq->private);
  2004. struct brcmf_fws_stats *fwstats = &bus_if->drvr->fws->stats;
  2005. seq_printf(seq,
  2006. "header_pulls: %u\n"
  2007. "header_only_pkt: %u\n"
  2008. "tlv_parse_failed: %u\n"
  2009. "tlv_invalid_type: %u\n"
  2010. "mac_update_fails: %u\n"
  2011. "ps_update_fails: %u\n"
  2012. "if_update_fails: %u\n"
  2013. "pkt2bus: %u\n"
  2014. "generic_error: %u\n"
  2015. "rollback_success: %u\n"
  2016. "rollback_failed: %u\n"
  2017. "delayq_full: %u\n"
  2018. "supprq_full: %u\n"
  2019. "txs_indicate: %u\n"
  2020. "txs_discard: %u\n"
  2021. "txs_suppr_core: %u\n"
  2022. "txs_suppr_ps: %u\n"
  2023. "txs_tossed: %u\n"
  2024. "txs_host_tossed: %u\n"
  2025. "bus_flow_block: %u\n"
  2026. "fws_flow_block: %u\n"
  2027. "send_pkts: BK:%u BE:%u VO:%u VI:%u BCMC:%u\n"
  2028. "requested_sent: BK:%u BE:%u VO:%u VI:%u BCMC:%u\n",
  2029. fwstats->header_pulls,
  2030. fwstats->header_only_pkt,
  2031. fwstats->tlv_parse_failed,
  2032. fwstats->tlv_invalid_type,
  2033. fwstats->mac_update_failed,
  2034. fwstats->mac_ps_update_failed,
  2035. fwstats->if_update_failed,
  2036. fwstats->pkt2bus,
  2037. fwstats->generic_error,
  2038. fwstats->rollback_success,
  2039. fwstats->rollback_failed,
  2040. fwstats->delayq_full_error,
  2041. fwstats->supprq_full_error,
  2042. fwstats->txs_indicate,
  2043. fwstats->txs_discard,
  2044. fwstats->txs_supp_core,
  2045. fwstats->txs_supp_ps,
  2046. fwstats->txs_tossed,
  2047. fwstats->txs_host_tossed,
  2048. fwstats->bus_flow_block,
  2049. fwstats->fws_flow_block,
  2050. fwstats->send_pkts[0], fwstats->send_pkts[1],
  2051. fwstats->send_pkts[2], fwstats->send_pkts[3],
  2052. fwstats->send_pkts[4],
  2053. fwstats->requested_sent[0],
  2054. fwstats->requested_sent[1],
  2055. fwstats->requested_sent[2],
  2056. fwstats->requested_sent[3],
  2057. fwstats->requested_sent[4]);
  2058. return 0;
  2059. }
  2060. #else
  2061. static int brcmf_debugfs_fws_stats_read(struct seq_file *seq, void *data)
  2062. {
  2063. return 0;
  2064. }
  2065. #endif
  2066. int brcmf_fws_init(struct brcmf_pub *drvr)
  2067. {
  2068. struct brcmf_fws_info *fws;
  2069. struct brcmf_if *ifp;
  2070. u32 tlv = BRCMF_FWS_FLAGS_RSSI_SIGNALS;
  2071. int rc;
  2072. u32 mode;
  2073. drvr->fws = kzalloc(sizeof(*(drvr->fws)), GFP_KERNEL);
  2074. if (!drvr->fws) {
  2075. rc = -ENOMEM;
  2076. goto fail;
  2077. }
  2078. fws = drvr->fws;
  2079. spin_lock_init(&fws->spinlock);
  2080. /* set linkage back */
  2081. fws->drvr = drvr;
  2082. fws->fcmode = drvr->settings->fcmode;
  2083. if ((drvr->bus_if->always_use_fws_queue == false) &&
  2084. (fws->fcmode == BRCMF_FWS_FCMODE_NONE)) {
  2085. fws->avoid_queueing = true;
  2086. brcmf_dbg(INFO, "FWS queueing will be avoided\n");
  2087. return 0;
  2088. }
  2089. fws->fws_wq = create_singlethread_workqueue("brcmf_fws_wq");
  2090. if (fws->fws_wq == NULL) {
  2091. brcmf_err("workqueue creation failed\n");
  2092. rc = -EBADF;
  2093. goto fail;
  2094. }
  2095. INIT_WORK(&fws->fws_dequeue_work, brcmf_fws_dequeue_worker);
  2096. /* enable firmware signalling if fcmode active */
  2097. if (fws->fcmode != BRCMF_FWS_FCMODE_NONE)
  2098. tlv |= BRCMF_FWS_FLAGS_XONXOFF_SIGNALS |
  2099. BRCMF_FWS_FLAGS_CREDIT_STATUS_SIGNALS |
  2100. BRCMF_FWS_FLAGS_HOST_PROPTXSTATUS_ACTIVE |
  2101. BRCMF_FWS_FLAGS_HOST_RXREORDER_ACTIVE;
  2102. rc = brcmf_fweh_register(drvr, BRCMF_E_FIFO_CREDIT_MAP,
  2103. brcmf_fws_notify_credit_map);
  2104. if (rc < 0) {
  2105. brcmf_err("register credit map handler failed\n");
  2106. goto fail;
  2107. }
  2108. rc = brcmf_fweh_register(drvr, BRCMF_E_BCMC_CREDIT_SUPPORT,
  2109. brcmf_fws_notify_bcmc_credit_support);
  2110. if (rc < 0) {
  2111. brcmf_err("register bcmc credit handler failed\n");
  2112. brcmf_fweh_unregister(drvr, BRCMF_E_FIFO_CREDIT_MAP);
  2113. goto fail;
  2114. }
  2115. /* Setting the iovar may fail if feature is unsupported
  2116. * so leave the rc as is so driver initialization can
  2117. * continue. Set mode back to none indicating not enabled.
  2118. */
  2119. fws->fw_signals = true;
  2120. ifp = brcmf_get_ifp(drvr, 0);
  2121. if (brcmf_fil_iovar_int_set(ifp, "tlv", tlv)) {
  2122. brcmf_err("failed to set bdcv2 tlv signaling\n");
  2123. fws->fcmode = BRCMF_FWS_FCMODE_NONE;
  2124. fws->fw_signals = false;
  2125. }
  2126. if (brcmf_fil_iovar_int_set(ifp, "ampdu_hostreorder", 1))
  2127. brcmf_dbg(INFO, "enabling AMPDU host-reorder failed\n");
  2128. /* Enable seq number reuse, if supported */
  2129. if (brcmf_fil_iovar_int_get(ifp, "wlfc_mode", &mode) == 0) {
  2130. if (BRCMF_FWS_MODE_GET_REUSESEQ(mode)) {
  2131. mode = 0;
  2132. BRCMF_FWS_MODE_SET_REUSESEQ(mode, 1);
  2133. if (brcmf_fil_iovar_int_set(ifp,
  2134. "wlfc_mode", mode) == 0) {
  2135. BRCMF_FWS_MODE_SET_REUSESEQ(fws->mode, 1);
  2136. }
  2137. }
  2138. }
  2139. brcmf_fws_hanger_init(&fws->hanger);
  2140. brcmf_fws_macdesc_init(&fws->desc.other, NULL, 0);
  2141. brcmf_fws_macdesc_set_name(fws, &fws->desc.other);
  2142. brcmu_pktq_init(&fws->desc.other.psq, BRCMF_FWS_PSQ_PREC_COUNT,
  2143. BRCMF_FWS_PSQ_LEN);
  2144. /* create debugfs file for statistics */
  2145. brcmf_debugfs_add_entry(drvr, "fws_stats",
  2146. brcmf_debugfs_fws_stats_read);
  2147. brcmf_dbg(INFO, "%s bdcv2 tlv signaling [%x]\n",
  2148. fws->fw_signals ? "enabled" : "disabled", tlv);
  2149. return 0;
  2150. fail:
  2151. brcmf_fws_deinit(drvr);
  2152. return rc;
  2153. }
  2154. void brcmf_fws_deinit(struct brcmf_pub *drvr)
  2155. {
  2156. struct brcmf_fws_info *fws = drvr->fws;
  2157. if (!fws)
  2158. return;
  2159. if (drvr->fws->fws_wq)
  2160. destroy_workqueue(drvr->fws->fws_wq);
  2161. /* cleanup */
  2162. brcmf_fws_lock(fws);
  2163. brcmf_fws_cleanup(fws, -1);
  2164. drvr->fws = NULL;
  2165. brcmf_fws_unlock(fws);
  2166. /* free top structure */
  2167. kfree(fws);
  2168. }
  2169. bool brcmf_fws_fc_active(struct brcmf_fws_info *fws)
  2170. {
  2171. if (!fws->creditmap_received)
  2172. return false;
  2173. return fws->fcmode != BRCMF_FWS_FCMODE_NONE;
  2174. }
  2175. void brcmf_fws_bustxfail(struct brcmf_fws_info *fws, struct sk_buff *skb)
  2176. {
  2177. u32 hslot;
  2178. if (brcmf_skbcb(skb)->state == BRCMF_FWS_SKBSTATE_TIM) {
  2179. brcmu_pkt_buf_free_skb(skb);
  2180. return;
  2181. }
  2182. brcmf_fws_lock(fws);
  2183. hslot = brcmf_skb_htod_tag_get_field(skb, HSLOT);
  2184. brcmf_fws_txs_process(fws, BRCMF_FWS_TXSTATUS_HOST_TOSSED, hslot, 0, 0);
  2185. brcmf_fws_unlock(fws);
  2186. }
  2187. void brcmf_fws_bus_blocked(struct brcmf_pub *drvr, bool flow_blocked)
  2188. {
  2189. struct brcmf_fws_info *fws = drvr->fws;
  2190. struct brcmf_if *ifp;
  2191. int i;
  2192. if (fws->avoid_queueing) {
  2193. for (i = 0; i < BRCMF_MAX_IFS; i++) {
  2194. ifp = drvr->iflist[i];
  2195. if (!ifp || !ifp->ndev)
  2196. continue;
  2197. brcmf_txflowblock_if(ifp, BRCMF_NETIF_STOP_REASON_FLOW,
  2198. flow_blocked);
  2199. }
  2200. } else {
  2201. fws->bus_flow_blocked = flow_blocked;
  2202. if (!flow_blocked)
  2203. brcmf_fws_schedule_deq(fws);
  2204. else
  2205. fws->stats.bus_flow_block++;
  2206. }
  2207. }