qib_file_ops.c 61 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414
  1. /*
  2. * Copyright (c) 2012, 2013 Intel Corporation. All rights reserved.
  3. * Copyright (c) 2006 - 2012 QLogic Corporation. All rights reserved.
  4. * Copyright (c) 2003, 2004, 2005, 2006 PathScale, Inc. All rights reserved.
  5. *
  6. * This software is available to you under a choice of one of two
  7. * licenses. You may choose to be licensed under the terms of the GNU
  8. * General Public License (GPL) Version 2, available from the file
  9. * COPYING in the main directory of this source tree, or the
  10. * OpenIB.org BSD license below:
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above
  17. * copyright notice, this list of conditions and the following
  18. * disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials
  23. * provided with the distribution.
  24. *
  25. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  26. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  27. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  28. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  29. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  30. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  31. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  32. * SOFTWARE.
  33. */
  34. #include <linux/pci.h>
  35. #include <linux/poll.h>
  36. #include <linux/cdev.h>
  37. #include <linux/swap.h>
  38. #include <linux/vmalloc.h>
  39. #include <linux/highmem.h>
  40. #include <linux/io.h>
  41. #include <linux/aio.h>
  42. #include <linux/jiffies.h>
  43. #include <asm/pgtable.h>
  44. #include <linux/delay.h>
  45. #include <linux/export.h>
  46. #include "qib.h"
  47. #include "qib_common.h"
  48. #include "qib_user_sdma.h"
  49. #undef pr_fmt
  50. #define pr_fmt(fmt) QIB_DRV_NAME ": " fmt
  51. static int qib_open(struct inode *, struct file *);
  52. static int qib_close(struct inode *, struct file *);
  53. static ssize_t qib_write(struct file *, const char __user *, size_t, loff_t *);
  54. static ssize_t qib_aio_write(struct kiocb *, const struct iovec *,
  55. unsigned long, loff_t);
  56. static unsigned int qib_poll(struct file *, struct poll_table_struct *);
  57. static int qib_mmapf(struct file *, struct vm_area_struct *);
  58. static const struct file_operations qib_file_ops = {
  59. .owner = THIS_MODULE,
  60. .write = qib_write,
  61. .aio_write = qib_aio_write,
  62. .open = qib_open,
  63. .release = qib_close,
  64. .poll = qib_poll,
  65. .mmap = qib_mmapf,
  66. .llseek = noop_llseek,
  67. };
  68. /*
  69. * Convert kernel virtual addresses to physical addresses so they don't
  70. * potentially conflict with the chip addresses used as mmap offsets.
  71. * It doesn't really matter what mmap offset we use as long as we can
  72. * interpret it correctly.
  73. */
  74. static u64 cvt_kvaddr(void *p)
  75. {
  76. struct page *page;
  77. u64 paddr = 0;
  78. page = vmalloc_to_page(p);
  79. if (page)
  80. paddr = page_to_pfn(page) << PAGE_SHIFT;
  81. return paddr;
  82. }
  83. static int qib_get_base_info(struct file *fp, void __user *ubase,
  84. size_t ubase_size)
  85. {
  86. struct qib_ctxtdata *rcd = ctxt_fp(fp);
  87. int ret = 0;
  88. struct qib_base_info *kinfo = NULL;
  89. struct qib_devdata *dd = rcd->dd;
  90. struct qib_pportdata *ppd = rcd->ppd;
  91. unsigned subctxt_cnt;
  92. int shared, master;
  93. size_t sz;
  94. subctxt_cnt = rcd->subctxt_cnt;
  95. if (!subctxt_cnt) {
  96. shared = 0;
  97. master = 0;
  98. subctxt_cnt = 1;
  99. } else {
  100. shared = 1;
  101. master = !subctxt_fp(fp);
  102. }
  103. sz = sizeof(*kinfo);
  104. /* If context sharing is not requested, allow the old size structure */
  105. if (!shared)
  106. sz -= 7 * sizeof(u64);
  107. if (ubase_size < sz) {
  108. ret = -EINVAL;
  109. goto bail;
  110. }
  111. kinfo = kzalloc(sizeof(*kinfo), GFP_KERNEL);
  112. if (kinfo == NULL) {
  113. ret = -ENOMEM;
  114. goto bail;
  115. }
  116. ret = dd->f_get_base_info(rcd, kinfo);
  117. if (ret < 0)
  118. goto bail;
  119. kinfo->spi_rcvhdr_cnt = dd->rcvhdrcnt;
  120. kinfo->spi_rcvhdrent_size = dd->rcvhdrentsize;
  121. kinfo->spi_tidegrcnt = rcd->rcvegrcnt;
  122. kinfo->spi_rcv_egrbufsize = dd->rcvegrbufsize;
  123. /*
  124. * have to mmap whole thing
  125. */
  126. kinfo->spi_rcv_egrbuftotlen =
  127. rcd->rcvegrbuf_chunks * rcd->rcvegrbuf_size;
  128. kinfo->spi_rcv_egrperchunk = rcd->rcvegrbufs_perchunk;
  129. kinfo->spi_rcv_egrchunksize = kinfo->spi_rcv_egrbuftotlen /
  130. rcd->rcvegrbuf_chunks;
  131. kinfo->spi_tidcnt = dd->rcvtidcnt / subctxt_cnt;
  132. if (master)
  133. kinfo->spi_tidcnt += dd->rcvtidcnt % subctxt_cnt;
  134. /*
  135. * for this use, may be cfgctxts summed over all chips that
  136. * are are configured and present
  137. */
  138. kinfo->spi_nctxts = dd->cfgctxts;
  139. /* unit (chip/board) our context is on */
  140. kinfo->spi_unit = dd->unit;
  141. kinfo->spi_port = ppd->port;
  142. /* for now, only a single page */
  143. kinfo->spi_tid_maxsize = PAGE_SIZE;
  144. /*
  145. * Doing this per context, and based on the skip value, etc. This has
  146. * to be the actual buffer size, since the protocol code treats it
  147. * as an array.
  148. *
  149. * These have to be set to user addresses in the user code via mmap.
  150. * These values are used on return to user code for the mmap target
  151. * addresses only. For 32 bit, same 44 bit address problem, so use
  152. * the physical address, not virtual. Before 2.6.11, using the
  153. * page_address() macro worked, but in 2.6.11, even that returns the
  154. * full 64 bit address (upper bits all 1's). So far, using the
  155. * physical addresses (or chip offsets, for chip mapping) works, but
  156. * no doubt some future kernel release will change that, and we'll be
  157. * on to yet another method of dealing with this.
  158. * Normally only one of rcvhdr_tailaddr or rhf_offset is useful
  159. * since the chips with non-zero rhf_offset don't normally
  160. * enable tail register updates to host memory, but for testing,
  161. * both can be enabled and used.
  162. */
  163. kinfo->spi_rcvhdr_base = (u64) rcd->rcvhdrq_phys;
  164. kinfo->spi_rcvhdr_tailaddr = (u64) rcd->rcvhdrqtailaddr_phys;
  165. kinfo->spi_rhf_offset = dd->rhf_offset;
  166. kinfo->spi_rcv_egrbufs = (u64) rcd->rcvegr_phys;
  167. kinfo->spi_pioavailaddr = (u64) dd->pioavailregs_phys;
  168. /* setup per-unit (not port) status area for user programs */
  169. kinfo->spi_status = (u64) kinfo->spi_pioavailaddr +
  170. (char *) ppd->statusp -
  171. (char *) dd->pioavailregs_dma;
  172. kinfo->spi_uregbase = (u64) dd->uregbase + dd->ureg_align * rcd->ctxt;
  173. if (!shared) {
  174. kinfo->spi_piocnt = rcd->piocnt;
  175. kinfo->spi_piobufbase = (u64) rcd->piobufs;
  176. kinfo->spi_sendbuf_status = cvt_kvaddr(rcd->user_event_mask);
  177. } else if (master) {
  178. kinfo->spi_piocnt = (rcd->piocnt / subctxt_cnt) +
  179. (rcd->piocnt % subctxt_cnt);
  180. /* Master's PIO buffers are after all the slave's */
  181. kinfo->spi_piobufbase = (u64) rcd->piobufs +
  182. dd->palign *
  183. (rcd->piocnt - kinfo->spi_piocnt);
  184. } else {
  185. unsigned slave = subctxt_fp(fp) - 1;
  186. kinfo->spi_piocnt = rcd->piocnt / subctxt_cnt;
  187. kinfo->spi_piobufbase = (u64) rcd->piobufs +
  188. dd->palign * kinfo->spi_piocnt * slave;
  189. }
  190. if (shared) {
  191. kinfo->spi_sendbuf_status =
  192. cvt_kvaddr(&rcd->user_event_mask[subctxt_fp(fp)]);
  193. /* only spi_subctxt_* fields should be set in this block! */
  194. kinfo->spi_subctxt_uregbase = cvt_kvaddr(rcd->subctxt_uregbase);
  195. kinfo->spi_subctxt_rcvegrbuf =
  196. cvt_kvaddr(rcd->subctxt_rcvegrbuf);
  197. kinfo->spi_subctxt_rcvhdr_base =
  198. cvt_kvaddr(rcd->subctxt_rcvhdr_base);
  199. }
  200. /*
  201. * All user buffers are 2KB buffers. If we ever support
  202. * giving 4KB buffers to user processes, this will need some
  203. * work. Can't use piobufbase directly, because it has
  204. * both 2K and 4K buffer base values.
  205. */
  206. kinfo->spi_pioindex = (kinfo->spi_piobufbase - dd->pio2k_bufbase) /
  207. dd->palign;
  208. kinfo->spi_pioalign = dd->palign;
  209. kinfo->spi_qpair = QIB_KD_QP;
  210. /*
  211. * user mode PIO buffers are always 2KB, even when 4KB can
  212. * be received, and sent via the kernel; this is ibmaxlen
  213. * for 2K MTU.
  214. */
  215. kinfo->spi_piosize = dd->piosize2k - 2 * sizeof(u32);
  216. kinfo->spi_mtu = ppd->ibmaxlen; /* maxlen, not ibmtu */
  217. kinfo->spi_ctxt = rcd->ctxt;
  218. kinfo->spi_subctxt = subctxt_fp(fp);
  219. kinfo->spi_sw_version = QIB_KERN_SWVERSION;
  220. kinfo->spi_sw_version |= 1U << 31; /* QLogic-built, not kernel.org */
  221. kinfo->spi_hw_version = dd->revision;
  222. if (master)
  223. kinfo->spi_runtime_flags |= QIB_RUNTIME_MASTER;
  224. sz = (ubase_size < sizeof(*kinfo)) ? ubase_size : sizeof(*kinfo);
  225. if (copy_to_user(ubase, kinfo, sz))
  226. ret = -EFAULT;
  227. bail:
  228. kfree(kinfo);
  229. return ret;
  230. }
  231. /**
  232. * qib_tid_update - update a context TID
  233. * @rcd: the context
  234. * @fp: the qib device file
  235. * @ti: the TID information
  236. *
  237. * The new implementation as of Oct 2004 is that the driver assigns
  238. * the tid and returns it to the caller. To reduce search time, we
  239. * keep a cursor for each context, walking the shadow tid array to find
  240. * one that's not in use.
  241. *
  242. * For now, if we can't allocate the full list, we fail, although
  243. * in the long run, we'll allocate as many as we can, and the
  244. * caller will deal with that by trying the remaining pages later.
  245. * That means that when we fail, we have to mark the tids as not in
  246. * use again, in our shadow copy.
  247. *
  248. * It's up to the caller to free the tids when they are done.
  249. * We'll unlock the pages as they free them.
  250. *
  251. * Also, right now we are locking one page at a time, but since
  252. * the intended use of this routine is for a single group of
  253. * virtually contiguous pages, that should change to improve
  254. * performance.
  255. */
  256. static int qib_tid_update(struct qib_ctxtdata *rcd, struct file *fp,
  257. const struct qib_tid_info *ti)
  258. {
  259. int ret = 0, ntids;
  260. u32 tid, ctxttid, cnt, i, tidcnt, tidoff;
  261. u16 *tidlist;
  262. struct qib_devdata *dd = rcd->dd;
  263. u64 physaddr;
  264. unsigned long vaddr;
  265. u64 __iomem *tidbase;
  266. unsigned long tidmap[8];
  267. struct page **pagep = NULL;
  268. unsigned subctxt = subctxt_fp(fp);
  269. if (!dd->pageshadow) {
  270. ret = -ENOMEM;
  271. goto done;
  272. }
  273. cnt = ti->tidcnt;
  274. if (!cnt) {
  275. ret = -EFAULT;
  276. goto done;
  277. }
  278. ctxttid = rcd->ctxt * dd->rcvtidcnt;
  279. if (!rcd->subctxt_cnt) {
  280. tidcnt = dd->rcvtidcnt;
  281. tid = rcd->tidcursor;
  282. tidoff = 0;
  283. } else if (!subctxt) {
  284. tidcnt = (dd->rcvtidcnt / rcd->subctxt_cnt) +
  285. (dd->rcvtidcnt % rcd->subctxt_cnt);
  286. tidoff = dd->rcvtidcnt - tidcnt;
  287. ctxttid += tidoff;
  288. tid = tidcursor_fp(fp);
  289. } else {
  290. tidcnt = dd->rcvtidcnt / rcd->subctxt_cnt;
  291. tidoff = tidcnt * (subctxt - 1);
  292. ctxttid += tidoff;
  293. tid = tidcursor_fp(fp);
  294. }
  295. if (cnt > tidcnt) {
  296. /* make sure it all fits in tid_pg_list */
  297. qib_devinfo(dd->pcidev,
  298. "Process tried to allocate %u TIDs, only trying max (%u)\n",
  299. cnt, tidcnt);
  300. cnt = tidcnt;
  301. }
  302. pagep = (struct page **) rcd->tid_pg_list;
  303. tidlist = (u16 *) &pagep[dd->rcvtidcnt];
  304. pagep += tidoff;
  305. tidlist += tidoff;
  306. memset(tidmap, 0, sizeof(tidmap));
  307. /* before decrement; chip actual # */
  308. ntids = tidcnt;
  309. tidbase = (u64 __iomem *) (((char __iomem *) dd->kregbase) +
  310. dd->rcvtidbase +
  311. ctxttid * sizeof(*tidbase));
  312. /* virtual address of first page in transfer */
  313. vaddr = ti->tidvaddr;
  314. if (!access_ok(VERIFY_WRITE, (void __user *) vaddr,
  315. cnt * PAGE_SIZE)) {
  316. ret = -EFAULT;
  317. goto done;
  318. }
  319. ret = qib_get_user_pages(vaddr, cnt, pagep);
  320. if (ret) {
  321. /*
  322. * if (ret == -EBUSY)
  323. * We can't continue because the pagep array won't be
  324. * initialized. This should never happen,
  325. * unless perhaps the user has mpin'ed the pages
  326. * themselves.
  327. */
  328. qib_devinfo(
  329. dd->pcidev,
  330. "Failed to lock addr %p, %u pages: errno %d\n",
  331. (void *) vaddr, cnt, -ret);
  332. goto done;
  333. }
  334. for (i = 0; i < cnt; i++, vaddr += PAGE_SIZE) {
  335. for (; ntids--; tid++) {
  336. if (tid == tidcnt)
  337. tid = 0;
  338. if (!dd->pageshadow[ctxttid + tid])
  339. break;
  340. }
  341. if (ntids < 0) {
  342. /*
  343. * Oops, wrapped all the way through their TIDs,
  344. * and didn't have enough free; see comments at
  345. * start of routine
  346. */
  347. i--; /* last tidlist[i] not filled in */
  348. ret = -ENOMEM;
  349. break;
  350. }
  351. tidlist[i] = tid + tidoff;
  352. /* we "know" system pages and TID pages are same size */
  353. dd->pageshadow[ctxttid + tid] = pagep[i];
  354. dd->physshadow[ctxttid + tid] =
  355. qib_map_page(dd->pcidev, pagep[i], 0, PAGE_SIZE,
  356. PCI_DMA_FROMDEVICE);
  357. /*
  358. * don't need atomic or it's overhead
  359. */
  360. __set_bit(tid, tidmap);
  361. physaddr = dd->physshadow[ctxttid + tid];
  362. /* PERFORMANCE: below should almost certainly be cached */
  363. dd->f_put_tid(dd, &tidbase[tid],
  364. RCVHQ_RCV_TYPE_EXPECTED, physaddr);
  365. /*
  366. * don't check this tid in qib_ctxtshadow, since we
  367. * just filled it in; start with the next one.
  368. */
  369. tid++;
  370. }
  371. if (ret) {
  372. u32 limit;
  373. cleanup:
  374. /* jump here if copy out of updated info failed... */
  375. /* same code that's in qib_free_tid() */
  376. limit = sizeof(tidmap) * BITS_PER_BYTE;
  377. if (limit > tidcnt)
  378. /* just in case size changes in future */
  379. limit = tidcnt;
  380. tid = find_first_bit((const unsigned long *)tidmap, limit);
  381. for (; tid < limit; tid++) {
  382. if (!test_bit(tid, tidmap))
  383. continue;
  384. if (dd->pageshadow[ctxttid + tid]) {
  385. dma_addr_t phys;
  386. phys = dd->physshadow[ctxttid + tid];
  387. dd->physshadow[ctxttid + tid] = dd->tidinvalid;
  388. /* PERFORMANCE: below should almost certainly
  389. * be cached
  390. */
  391. dd->f_put_tid(dd, &tidbase[tid],
  392. RCVHQ_RCV_TYPE_EXPECTED,
  393. dd->tidinvalid);
  394. pci_unmap_page(dd->pcidev, phys, PAGE_SIZE,
  395. PCI_DMA_FROMDEVICE);
  396. dd->pageshadow[ctxttid + tid] = NULL;
  397. }
  398. }
  399. qib_release_user_pages(pagep, cnt);
  400. } else {
  401. /*
  402. * Copy the updated array, with qib_tid's filled in, back
  403. * to user. Since we did the copy in already, this "should
  404. * never fail" If it does, we have to clean up...
  405. */
  406. if (copy_to_user((void __user *)
  407. (unsigned long) ti->tidlist,
  408. tidlist, cnt * sizeof(*tidlist))) {
  409. ret = -EFAULT;
  410. goto cleanup;
  411. }
  412. if (copy_to_user((void __user *) (unsigned long) ti->tidmap,
  413. tidmap, sizeof(tidmap))) {
  414. ret = -EFAULT;
  415. goto cleanup;
  416. }
  417. if (tid == tidcnt)
  418. tid = 0;
  419. if (!rcd->subctxt_cnt)
  420. rcd->tidcursor = tid;
  421. else
  422. tidcursor_fp(fp) = tid;
  423. }
  424. done:
  425. return ret;
  426. }
  427. /**
  428. * qib_tid_free - free a context TID
  429. * @rcd: the context
  430. * @subctxt: the subcontext
  431. * @ti: the TID info
  432. *
  433. * right now we are unlocking one page at a time, but since
  434. * the intended use of this routine is for a single group of
  435. * virtually contiguous pages, that should change to improve
  436. * performance. We check that the TID is in range for this context
  437. * but otherwise don't check validity; if user has an error and
  438. * frees the wrong tid, it's only their own data that can thereby
  439. * be corrupted. We do check that the TID was in use, for sanity
  440. * We always use our idea of the saved address, not the address that
  441. * they pass in to us.
  442. */
  443. static int qib_tid_free(struct qib_ctxtdata *rcd, unsigned subctxt,
  444. const struct qib_tid_info *ti)
  445. {
  446. int ret = 0;
  447. u32 tid, ctxttid, cnt, limit, tidcnt;
  448. struct qib_devdata *dd = rcd->dd;
  449. u64 __iomem *tidbase;
  450. unsigned long tidmap[8];
  451. if (!dd->pageshadow) {
  452. ret = -ENOMEM;
  453. goto done;
  454. }
  455. if (copy_from_user(tidmap, (void __user *)(unsigned long)ti->tidmap,
  456. sizeof(tidmap))) {
  457. ret = -EFAULT;
  458. goto done;
  459. }
  460. ctxttid = rcd->ctxt * dd->rcvtidcnt;
  461. if (!rcd->subctxt_cnt)
  462. tidcnt = dd->rcvtidcnt;
  463. else if (!subctxt) {
  464. tidcnt = (dd->rcvtidcnt / rcd->subctxt_cnt) +
  465. (dd->rcvtidcnt % rcd->subctxt_cnt);
  466. ctxttid += dd->rcvtidcnt - tidcnt;
  467. } else {
  468. tidcnt = dd->rcvtidcnt / rcd->subctxt_cnt;
  469. ctxttid += tidcnt * (subctxt - 1);
  470. }
  471. tidbase = (u64 __iomem *) ((char __iomem *)(dd->kregbase) +
  472. dd->rcvtidbase +
  473. ctxttid * sizeof(*tidbase));
  474. limit = sizeof(tidmap) * BITS_PER_BYTE;
  475. if (limit > tidcnt)
  476. /* just in case size changes in future */
  477. limit = tidcnt;
  478. tid = find_first_bit(tidmap, limit);
  479. for (cnt = 0; tid < limit; tid++) {
  480. /*
  481. * small optimization; if we detect a run of 3 or so without
  482. * any set, use find_first_bit again. That's mainly to
  483. * accelerate the case where we wrapped, so we have some at
  484. * the beginning, and some at the end, and a big gap
  485. * in the middle.
  486. */
  487. if (!test_bit(tid, tidmap))
  488. continue;
  489. cnt++;
  490. if (dd->pageshadow[ctxttid + tid]) {
  491. struct page *p;
  492. dma_addr_t phys;
  493. p = dd->pageshadow[ctxttid + tid];
  494. dd->pageshadow[ctxttid + tid] = NULL;
  495. phys = dd->physshadow[ctxttid + tid];
  496. dd->physshadow[ctxttid + tid] = dd->tidinvalid;
  497. /* PERFORMANCE: below should almost certainly be
  498. * cached
  499. */
  500. dd->f_put_tid(dd, &tidbase[tid],
  501. RCVHQ_RCV_TYPE_EXPECTED, dd->tidinvalid);
  502. pci_unmap_page(dd->pcidev, phys, PAGE_SIZE,
  503. PCI_DMA_FROMDEVICE);
  504. qib_release_user_pages(&p, 1);
  505. }
  506. }
  507. done:
  508. return ret;
  509. }
  510. /**
  511. * qib_set_part_key - set a partition key
  512. * @rcd: the context
  513. * @key: the key
  514. *
  515. * We can have up to 4 active at a time (other than the default, which is
  516. * always allowed). This is somewhat tricky, since multiple contexts may set
  517. * the same key, so we reference count them, and clean up at exit. All 4
  518. * partition keys are packed into a single qlogic_ib register. It's an
  519. * error for a process to set the same pkey multiple times. We provide no
  520. * mechanism to de-allocate a pkey at this time, we may eventually need to
  521. * do that. I've used the atomic operations, and no locking, and only make
  522. * a single pass through what's available. This should be more than
  523. * adequate for some time. I'll think about spinlocks or the like if and as
  524. * it's necessary.
  525. */
  526. static int qib_set_part_key(struct qib_ctxtdata *rcd, u16 key)
  527. {
  528. struct qib_pportdata *ppd = rcd->ppd;
  529. int i, any = 0, pidx = -1;
  530. u16 lkey = key & 0x7FFF;
  531. int ret;
  532. if (lkey == (QIB_DEFAULT_P_KEY & 0x7FFF)) {
  533. /* nothing to do; this key always valid */
  534. ret = 0;
  535. goto bail;
  536. }
  537. if (!lkey) {
  538. ret = -EINVAL;
  539. goto bail;
  540. }
  541. /*
  542. * Set the full membership bit, because it has to be
  543. * set in the register or the packet, and it seems
  544. * cleaner to set in the register than to force all
  545. * callers to set it.
  546. */
  547. key |= 0x8000;
  548. for (i = 0; i < ARRAY_SIZE(rcd->pkeys); i++) {
  549. if (!rcd->pkeys[i] && pidx == -1)
  550. pidx = i;
  551. if (rcd->pkeys[i] == key) {
  552. ret = -EEXIST;
  553. goto bail;
  554. }
  555. }
  556. if (pidx == -1) {
  557. ret = -EBUSY;
  558. goto bail;
  559. }
  560. for (any = i = 0; i < ARRAY_SIZE(ppd->pkeys); i++) {
  561. if (!ppd->pkeys[i]) {
  562. any++;
  563. continue;
  564. }
  565. if (ppd->pkeys[i] == key) {
  566. atomic_t *pkrefs = &ppd->pkeyrefs[i];
  567. if (atomic_inc_return(pkrefs) > 1) {
  568. rcd->pkeys[pidx] = key;
  569. ret = 0;
  570. goto bail;
  571. } else {
  572. /*
  573. * lost race, decrement count, catch below
  574. */
  575. atomic_dec(pkrefs);
  576. any++;
  577. }
  578. }
  579. if ((ppd->pkeys[i] & 0x7FFF) == lkey) {
  580. /*
  581. * It makes no sense to have both the limited and
  582. * full membership PKEY set at the same time since
  583. * the unlimited one will disable the limited one.
  584. */
  585. ret = -EEXIST;
  586. goto bail;
  587. }
  588. }
  589. if (!any) {
  590. ret = -EBUSY;
  591. goto bail;
  592. }
  593. for (any = i = 0; i < ARRAY_SIZE(ppd->pkeys); i++) {
  594. if (!ppd->pkeys[i] &&
  595. atomic_inc_return(&ppd->pkeyrefs[i]) == 1) {
  596. rcd->pkeys[pidx] = key;
  597. ppd->pkeys[i] = key;
  598. (void) ppd->dd->f_set_ib_cfg(ppd, QIB_IB_CFG_PKEYS, 0);
  599. ret = 0;
  600. goto bail;
  601. }
  602. }
  603. ret = -EBUSY;
  604. bail:
  605. return ret;
  606. }
  607. /**
  608. * qib_manage_rcvq - manage a context's receive queue
  609. * @rcd: the context
  610. * @subctxt: the subcontext
  611. * @start_stop: action to carry out
  612. *
  613. * start_stop == 0 disables receive on the context, for use in queue
  614. * overflow conditions. start_stop==1 re-enables, to be used to
  615. * re-init the software copy of the head register
  616. */
  617. static int qib_manage_rcvq(struct qib_ctxtdata *rcd, unsigned subctxt,
  618. int start_stop)
  619. {
  620. struct qib_devdata *dd = rcd->dd;
  621. unsigned int rcvctrl_op;
  622. if (subctxt)
  623. goto bail;
  624. /* atomically clear receive enable ctxt. */
  625. if (start_stop) {
  626. /*
  627. * On enable, force in-memory copy of the tail register to
  628. * 0, so that protocol code doesn't have to worry about
  629. * whether or not the chip has yet updated the in-memory
  630. * copy or not on return from the system call. The chip
  631. * always resets it's tail register back to 0 on a
  632. * transition from disabled to enabled.
  633. */
  634. if (rcd->rcvhdrtail_kvaddr)
  635. qib_clear_rcvhdrtail(rcd);
  636. rcvctrl_op = QIB_RCVCTRL_CTXT_ENB;
  637. } else
  638. rcvctrl_op = QIB_RCVCTRL_CTXT_DIS;
  639. dd->f_rcvctrl(rcd->ppd, rcvctrl_op, rcd->ctxt);
  640. /* always; new head should be equal to new tail; see above */
  641. bail:
  642. return 0;
  643. }
  644. static void qib_clean_part_key(struct qib_ctxtdata *rcd,
  645. struct qib_devdata *dd)
  646. {
  647. int i, j, pchanged = 0;
  648. u64 oldpkey;
  649. struct qib_pportdata *ppd = rcd->ppd;
  650. /* for debugging only */
  651. oldpkey = (u64) ppd->pkeys[0] |
  652. ((u64) ppd->pkeys[1] << 16) |
  653. ((u64) ppd->pkeys[2] << 32) |
  654. ((u64) ppd->pkeys[3] << 48);
  655. for (i = 0; i < ARRAY_SIZE(rcd->pkeys); i++) {
  656. if (!rcd->pkeys[i])
  657. continue;
  658. for (j = 0; j < ARRAY_SIZE(ppd->pkeys); j++) {
  659. /* check for match independent of the global bit */
  660. if ((ppd->pkeys[j] & 0x7fff) !=
  661. (rcd->pkeys[i] & 0x7fff))
  662. continue;
  663. if (atomic_dec_and_test(&ppd->pkeyrefs[j])) {
  664. ppd->pkeys[j] = 0;
  665. pchanged++;
  666. }
  667. break;
  668. }
  669. rcd->pkeys[i] = 0;
  670. }
  671. if (pchanged)
  672. (void) ppd->dd->f_set_ib_cfg(ppd, QIB_IB_CFG_PKEYS, 0);
  673. }
  674. /* common code for the mappings on dma_alloc_coherent mem */
  675. static int qib_mmap_mem(struct vm_area_struct *vma, struct qib_ctxtdata *rcd,
  676. unsigned len, void *kvaddr, u32 write_ok, char *what)
  677. {
  678. struct qib_devdata *dd = rcd->dd;
  679. unsigned long pfn;
  680. int ret;
  681. if ((vma->vm_end - vma->vm_start) > len) {
  682. qib_devinfo(dd->pcidev,
  683. "FAIL on %s: len %lx > %x\n", what,
  684. vma->vm_end - vma->vm_start, len);
  685. ret = -EFAULT;
  686. goto bail;
  687. }
  688. /*
  689. * shared context user code requires rcvhdrq mapped r/w, others
  690. * only allowed readonly mapping.
  691. */
  692. if (!write_ok) {
  693. if (vma->vm_flags & VM_WRITE) {
  694. qib_devinfo(dd->pcidev,
  695. "%s must be mapped readonly\n", what);
  696. ret = -EPERM;
  697. goto bail;
  698. }
  699. /* don't allow them to later change with mprotect */
  700. vma->vm_flags &= ~VM_MAYWRITE;
  701. }
  702. pfn = virt_to_phys(kvaddr) >> PAGE_SHIFT;
  703. ret = remap_pfn_range(vma, vma->vm_start, pfn,
  704. len, vma->vm_page_prot);
  705. if (ret)
  706. qib_devinfo(dd->pcidev,
  707. "%s ctxt%u mmap of %lx, %x bytes failed: %d\n",
  708. what, rcd->ctxt, pfn, len, ret);
  709. bail:
  710. return ret;
  711. }
  712. static int mmap_ureg(struct vm_area_struct *vma, struct qib_devdata *dd,
  713. u64 ureg)
  714. {
  715. unsigned long phys;
  716. unsigned long sz;
  717. int ret;
  718. /*
  719. * This is real hardware, so use io_remap. This is the mechanism
  720. * for the user process to update the head registers for their ctxt
  721. * in the chip.
  722. */
  723. sz = dd->flags & QIB_HAS_HDRSUPP ? 2 * PAGE_SIZE : PAGE_SIZE;
  724. if ((vma->vm_end - vma->vm_start) > sz) {
  725. qib_devinfo(dd->pcidev,
  726. "FAIL mmap userreg: reqlen %lx > PAGE\n",
  727. vma->vm_end - vma->vm_start);
  728. ret = -EFAULT;
  729. } else {
  730. phys = dd->physaddr + ureg;
  731. vma->vm_page_prot = pgprot_noncached(vma->vm_page_prot);
  732. vma->vm_flags |= VM_DONTCOPY | VM_DONTEXPAND;
  733. ret = io_remap_pfn_range(vma, vma->vm_start,
  734. phys >> PAGE_SHIFT,
  735. vma->vm_end - vma->vm_start,
  736. vma->vm_page_prot);
  737. }
  738. return ret;
  739. }
  740. static int mmap_piobufs(struct vm_area_struct *vma,
  741. struct qib_devdata *dd,
  742. struct qib_ctxtdata *rcd,
  743. unsigned piobufs, unsigned piocnt)
  744. {
  745. unsigned long phys;
  746. int ret;
  747. /*
  748. * When we map the PIO buffers in the chip, we want to map them as
  749. * writeonly, no read possible; unfortunately, x86 doesn't allow
  750. * for this in hardware, but we still prevent users from asking
  751. * for it.
  752. */
  753. if ((vma->vm_end - vma->vm_start) > (piocnt * dd->palign)) {
  754. qib_devinfo(dd->pcidev,
  755. "FAIL mmap piobufs: reqlen %lx > PAGE\n",
  756. vma->vm_end - vma->vm_start);
  757. ret = -EINVAL;
  758. goto bail;
  759. }
  760. phys = dd->physaddr + piobufs;
  761. #if defined(__powerpc__)
  762. /* There isn't a generic way to specify writethrough mappings */
  763. pgprot_val(vma->vm_page_prot) |= _PAGE_NO_CACHE;
  764. pgprot_val(vma->vm_page_prot) |= _PAGE_WRITETHRU;
  765. pgprot_val(vma->vm_page_prot) &= ~_PAGE_GUARDED;
  766. #endif
  767. /*
  768. * don't allow them to later change to readable with mprotect (for when
  769. * not initially mapped readable, as is normally the case)
  770. */
  771. vma->vm_flags &= ~VM_MAYREAD;
  772. vma->vm_flags |= VM_DONTCOPY | VM_DONTEXPAND;
  773. if (qib_wc_pat)
  774. vma->vm_page_prot = pgprot_writecombine(vma->vm_page_prot);
  775. ret = io_remap_pfn_range(vma, vma->vm_start, phys >> PAGE_SHIFT,
  776. vma->vm_end - vma->vm_start,
  777. vma->vm_page_prot);
  778. bail:
  779. return ret;
  780. }
  781. static int mmap_rcvegrbufs(struct vm_area_struct *vma,
  782. struct qib_ctxtdata *rcd)
  783. {
  784. struct qib_devdata *dd = rcd->dd;
  785. unsigned long start, size;
  786. size_t total_size, i;
  787. unsigned long pfn;
  788. int ret;
  789. size = rcd->rcvegrbuf_size;
  790. total_size = rcd->rcvegrbuf_chunks * size;
  791. if ((vma->vm_end - vma->vm_start) > total_size) {
  792. qib_devinfo(dd->pcidev,
  793. "FAIL on egr bufs: reqlen %lx > actual %lx\n",
  794. vma->vm_end - vma->vm_start,
  795. (unsigned long) total_size);
  796. ret = -EINVAL;
  797. goto bail;
  798. }
  799. if (vma->vm_flags & VM_WRITE) {
  800. qib_devinfo(dd->pcidev,
  801. "Can't map eager buffers as writable (flags=%lx)\n",
  802. vma->vm_flags);
  803. ret = -EPERM;
  804. goto bail;
  805. }
  806. /* don't allow them to later change to writeable with mprotect */
  807. vma->vm_flags &= ~VM_MAYWRITE;
  808. start = vma->vm_start;
  809. for (i = 0; i < rcd->rcvegrbuf_chunks; i++, start += size) {
  810. pfn = virt_to_phys(rcd->rcvegrbuf[i]) >> PAGE_SHIFT;
  811. ret = remap_pfn_range(vma, start, pfn, size,
  812. vma->vm_page_prot);
  813. if (ret < 0)
  814. goto bail;
  815. }
  816. ret = 0;
  817. bail:
  818. return ret;
  819. }
  820. /*
  821. * qib_file_vma_fault - handle a VMA page fault.
  822. */
  823. static int qib_file_vma_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
  824. {
  825. struct page *page;
  826. page = vmalloc_to_page((void *)(vmf->pgoff << PAGE_SHIFT));
  827. if (!page)
  828. return VM_FAULT_SIGBUS;
  829. get_page(page);
  830. vmf->page = page;
  831. return 0;
  832. }
  833. static struct vm_operations_struct qib_file_vm_ops = {
  834. .fault = qib_file_vma_fault,
  835. };
  836. static int mmap_kvaddr(struct vm_area_struct *vma, u64 pgaddr,
  837. struct qib_ctxtdata *rcd, unsigned subctxt)
  838. {
  839. struct qib_devdata *dd = rcd->dd;
  840. unsigned subctxt_cnt;
  841. unsigned long len;
  842. void *addr;
  843. size_t size;
  844. int ret = 0;
  845. subctxt_cnt = rcd->subctxt_cnt;
  846. size = rcd->rcvegrbuf_chunks * rcd->rcvegrbuf_size;
  847. /*
  848. * Each process has all the subctxt uregbase, rcvhdrq, and
  849. * rcvegrbufs mmapped - as an array for all the processes,
  850. * and also separately for this process.
  851. */
  852. if (pgaddr == cvt_kvaddr(rcd->subctxt_uregbase)) {
  853. addr = rcd->subctxt_uregbase;
  854. size = PAGE_SIZE * subctxt_cnt;
  855. } else if (pgaddr == cvt_kvaddr(rcd->subctxt_rcvhdr_base)) {
  856. addr = rcd->subctxt_rcvhdr_base;
  857. size = rcd->rcvhdrq_size * subctxt_cnt;
  858. } else if (pgaddr == cvt_kvaddr(rcd->subctxt_rcvegrbuf)) {
  859. addr = rcd->subctxt_rcvegrbuf;
  860. size *= subctxt_cnt;
  861. } else if (pgaddr == cvt_kvaddr(rcd->subctxt_uregbase +
  862. PAGE_SIZE * subctxt)) {
  863. addr = rcd->subctxt_uregbase + PAGE_SIZE * subctxt;
  864. size = PAGE_SIZE;
  865. } else if (pgaddr == cvt_kvaddr(rcd->subctxt_rcvhdr_base +
  866. rcd->rcvhdrq_size * subctxt)) {
  867. addr = rcd->subctxt_rcvhdr_base +
  868. rcd->rcvhdrq_size * subctxt;
  869. size = rcd->rcvhdrq_size;
  870. } else if (pgaddr == cvt_kvaddr(&rcd->user_event_mask[subctxt])) {
  871. addr = rcd->user_event_mask;
  872. size = PAGE_SIZE;
  873. } else if (pgaddr == cvt_kvaddr(rcd->subctxt_rcvegrbuf +
  874. size * subctxt)) {
  875. addr = rcd->subctxt_rcvegrbuf + size * subctxt;
  876. /* rcvegrbufs are read-only on the slave */
  877. if (vma->vm_flags & VM_WRITE) {
  878. qib_devinfo(dd->pcidev,
  879. "Can't map eager buffers as writable (flags=%lx)\n",
  880. vma->vm_flags);
  881. ret = -EPERM;
  882. goto bail;
  883. }
  884. /*
  885. * Don't allow permission to later change to writeable
  886. * with mprotect.
  887. */
  888. vma->vm_flags &= ~VM_MAYWRITE;
  889. } else
  890. goto bail;
  891. len = vma->vm_end - vma->vm_start;
  892. if (len > size) {
  893. ret = -EINVAL;
  894. goto bail;
  895. }
  896. vma->vm_pgoff = (unsigned long) addr >> PAGE_SHIFT;
  897. vma->vm_ops = &qib_file_vm_ops;
  898. vma->vm_flags |= VM_DONTEXPAND | VM_DONTDUMP;
  899. ret = 1;
  900. bail:
  901. return ret;
  902. }
  903. /**
  904. * qib_mmapf - mmap various structures into user space
  905. * @fp: the file pointer
  906. * @vma: the VM area
  907. *
  908. * We use this to have a shared buffer between the kernel and the user code
  909. * for the rcvhdr queue, egr buffers, and the per-context user regs and pio
  910. * buffers in the chip. We have the open and close entries so we can bump
  911. * the ref count and keep the driver from being unloaded while still mapped.
  912. */
  913. static int qib_mmapf(struct file *fp, struct vm_area_struct *vma)
  914. {
  915. struct qib_ctxtdata *rcd;
  916. struct qib_devdata *dd;
  917. u64 pgaddr, ureg;
  918. unsigned piobufs, piocnt;
  919. int ret, match = 1;
  920. rcd = ctxt_fp(fp);
  921. if (!rcd || !(vma->vm_flags & VM_SHARED)) {
  922. ret = -EINVAL;
  923. goto bail;
  924. }
  925. dd = rcd->dd;
  926. /*
  927. * This is the qib_do_user_init() code, mapping the shared buffers
  928. * and per-context user registers into the user process. The address
  929. * referred to by vm_pgoff is the file offset passed via mmap().
  930. * For shared contexts, this is the kernel vmalloc() address of the
  931. * pages to share with the master.
  932. * For non-shared or master ctxts, this is a physical address.
  933. * We only do one mmap for each space mapped.
  934. */
  935. pgaddr = vma->vm_pgoff << PAGE_SHIFT;
  936. /*
  937. * Check for 0 in case one of the allocations failed, but user
  938. * called mmap anyway.
  939. */
  940. if (!pgaddr) {
  941. ret = -EINVAL;
  942. goto bail;
  943. }
  944. /*
  945. * Physical addresses must fit in 40 bits for our hardware.
  946. * Check for kernel virtual addresses first, anything else must
  947. * match a HW or memory address.
  948. */
  949. ret = mmap_kvaddr(vma, pgaddr, rcd, subctxt_fp(fp));
  950. if (ret) {
  951. if (ret > 0)
  952. ret = 0;
  953. goto bail;
  954. }
  955. ureg = dd->uregbase + dd->ureg_align * rcd->ctxt;
  956. if (!rcd->subctxt_cnt) {
  957. /* ctxt is not shared */
  958. piocnt = rcd->piocnt;
  959. piobufs = rcd->piobufs;
  960. } else if (!subctxt_fp(fp)) {
  961. /* caller is the master */
  962. piocnt = (rcd->piocnt / rcd->subctxt_cnt) +
  963. (rcd->piocnt % rcd->subctxt_cnt);
  964. piobufs = rcd->piobufs +
  965. dd->palign * (rcd->piocnt - piocnt);
  966. } else {
  967. unsigned slave = subctxt_fp(fp) - 1;
  968. /* caller is a slave */
  969. piocnt = rcd->piocnt / rcd->subctxt_cnt;
  970. piobufs = rcd->piobufs + dd->palign * piocnt * slave;
  971. }
  972. if (pgaddr == ureg)
  973. ret = mmap_ureg(vma, dd, ureg);
  974. else if (pgaddr == piobufs)
  975. ret = mmap_piobufs(vma, dd, rcd, piobufs, piocnt);
  976. else if (pgaddr == dd->pioavailregs_phys)
  977. /* in-memory copy of pioavail registers */
  978. ret = qib_mmap_mem(vma, rcd, PAGE_SIZE,
  979. (void *) dd->pioavailregs_dma, 0,
  980. "pioavail registers");
  981. else if (pgaddr == rcd->rcvegr_phys)
  982. ret = mmap_rcvegrbufs(vma, rcd);
  983. else if (pgaddr == (u64) rcd->rcvhdrq_phys)
  984. /*
  985. * The rcvhdrq itself; multiple pages, contiguous
  986. * from an i/o perspective. Shared contexts need
  987. * to map r/w, so we allow writing.
  988. */
  989. ret = qib_mmap_mem(vma, rcd, rcd->rcvhdrq_size,
  990. rcd->rcvhdrq, 1, "rcvhdrq");
  991. else if (pgaddr == (u64) rcd->rcvhdrqtailaddr_phys)
  992. /* in-memory copy of rcvhdrq tail register */
  993. ret = qib_mmap_mem(vma, rcd, PAGE_SIZE,
  994. rcd->rcvhdrtail_kvaddr, 0,
  995. "rcvhdrq tail");
  996. else
  997. match = 0;
  998. if (!match)
  999. ret = -EINVAL;
  1000. vma->vm_private_data = NULL;
  1001. if (ret < 0)
  1002. qib_devinfo(dd->pcidev,
  1003. "mmap Failure %d: off %llx len %lx\n",
  1004. -ret, (unsigned long long)pgaddr,
  1005. vma->vm_end - vma->vm_start);
  1006. bail:
  1007. return ret;
  1008. }
  1009. static unsigned int qib_poll_urgent(struct qib_ctxtdata *rcd,
  1010. struct file *fp,
  1011. struct poll_table_struct *pt)
  1012. {
  1013. struct qib_devdata *dd = rcd->dd;
  1014. unsigned pollflag;
  1015. poll_wait(fp, &rcd->wait, pt);
  1016. spin_lock_irq(&dd->uctxt_lock);
  1017. if (rcd->urgent != rcd->urgent_poll) {
  1018. pollflag = POLLIN | POLLRDNORM;
  1019. rcd->urgent_poll = rcd->urgent;
  1020. } else {
  1021. pollflag = 0;
  1022. set_bit(QIB_CTXT_WAITING_URG, &rcd->flag);
  1023. }
  1024. spin_unlock_irq(&dd->uctxt_lock);
  1025. return pollflag;
  1026. }
  1027. static unsigned int qib_poll_next(struct qib_ctxtdata *rcd,
  1028. struct file *fp,
  1029. struct poll_table_struct *pt)
  1030. {
  1031. struct qib_devdata *dd = rcd->dd;
  1032. unsigned pollflag;
  1033. poll_wait(fp, &rcd->wait, pt);
  1034. spin_lock_irq(&dd->uctxt_lock);
  1035. if (dd->f_hdrqempty(rcd)) {
  1036. set_bit(QIB_CTXT_WAITING_RCV, &rcd->flag);
  1037. dd->f_rcvctrl(rcd->ppd, QIB_RCVCTRL_INTRAVAIL_ENB, rcd->ctxt);
  1038. pollflag = 0;
  1039. } else
  1040. pollflag = POLLIN | POLLRDNORM;
  1041. spin_unlock_irq(&dd->uctxt_lock);
  1042. return pollflag;
  1043. }
  1044. static unsigned int qib_poll(struct file *fp, struct poll_table_struct *pt)
  1045. {
  1046. struct qib_ctxtdata *rcd;
  1047. unsigned pollflag;
  1048. rcd = ctxt_fp(fp);
  1049. if (!rcd)
  1050. pollflag = POLLERR;
  1051. else if (rcd->poll_type == QIB_POLL_TYPE_URGENT)
  1052. pollflag = qib_poll_urgent(rcd, fp, pt);
  1053. else if (rcd->poll_type == QIB_POLL_TYPE_ANYRCV)
  1054. pollflag = qib_poll_next(rcd, fp, pt);
  1055. else /* invalid */
  1056. pollflag = POLLERR;
  1057. return pollflag;
  1058. }
  1059. static void assign_ctxt_affinity(struct file *fp, struct qib_devdata *dd)
  1060. {
  1061. struct qib_filedata *fd = fp->private_data;
  1062. const unsigned int weight = cpumask_weight(&current->cpus_allowed);
  1063. const struct cpumask *local_mask = cpumask_of_pcibus(dd->pcidev->bus);
  1064. int local_cpu;
  1065. /*
  1066. * If process has NOT already set it's affinity, select and
  1067. * reserve a processor for it on the local NUMA node.
  1068. */
  1069. if ((weight >= qib_cpulist_count) &&
  1070. (cpumask_weight(local_mask) <= qib_cpulist_count)) {
  1071. for_each_cpu(local_cpu, local_mask)
  1072. if (!test_and_set_bit(local_cpu, qib_cpulist)) {
  1073. fd->rec_cpu_num = local_cpu;
  1074. return;
  1075. }
  1076. }
  1077. /*
  1078. * If process has NOT already set it's affinity, select and
  1079. * reserve a processor for it, as a rendevous for all
  1080. * users of the driver. If they don't actually later
  1081. * set affinity to this cpu, or set it to some other cpu,
  1082. * it just means that sooner or later we don't recommend
  1083. * a cpu, and let the scheduler do it's best.
  1084. */
  1085. if (weight >= qib_cpulist_count) {
  1086. int cpu;
  1087. cpu = find_first_zero_bit(qib_cpulist,
  1088. qib_cpulist_count);
  1089. if (cpu == qib_cpulist_count)
  1090. qib_dev_err(dd,
  1091. "no cpus avail for affinity PID %u\n",
  1092. current->pid);
  1093. else {
  1094. __set_bit(cpu, qib_cpulist);
  1095. fd->rec_cpu_num = cpu;
  1096. }
  1097. }
  1098. }
  1099. /*
  1100. * Check that userland and driver are compatible for subcontexts.
  1101. */
  1102. static int qib_compatible_subctxts(int user_swmajor, int user_swminor)
  1103. {
  1104. /* this code is written long-hand for clarity */
  1105. if (QIB_USER_SWMAJOR != user_swmajor) {
  1106. /* no promise of compatibility if major mismatch */
  1107. return 0;
  1108. }
  1109. if (QIB_USER_SWMAJOR == 1) {
  1110. switch (QIB_USER_SWMINOR) {
  1111. case 0:
  1112. case 1:
  1113. case 2:
  1114. /* no subctxt implementation so cannot be compatible */
  1115. return 0;
  1116. case 3:
  1117. /* 3 is only compatible with itself */
  1118. return user_swminor == 3;
  1119. default:
  1120. /* >= 4 are compatible (or are expected to be) */
  1121. return user_swminor <= QIB_USER_SWMINOR;
  1122. }
  1123. }
  1124. /* make no promises yet for future major versions */
  1125. return 0;
  1126. }
  1127. static int init_subctxts(struct qib_devdata *dd,
  1128. struct qib_ctxtdata *rcd,
  1129. const struct qib_user_info *uinfo)
  1130. {
  1131. int ret = 0;
  1132. unsigned num_subctxts;
  1133. size_t size;
  1134. /*
  1135. * If the user is requesting zero subctxts,
  1136. * skip the subctxt allocation.
  1137. */
  1138. if (uinfo->spu_subctxt_cnt <= 0)
  1139. goto bail;
  1140. num_subctxts = uinfo->spu_subctxt_cnt;
  1141. /* Check for subctxt compatibility */
  1142. if (!qib_compatible_subctxts(uinfo->spu_userversion >> 16,
  1143. uinfo->spu_userversion & 0xffff)) {
  1144. qib_devinfo(dd->pcidev,
  1145. "Mismatched user version (%d.%d) and driver version (%d.%d) while context sharing. Ensure that driver and library are from the same release.\n",
  1146. (int) (uinfo->spu_userversion >> 16),
  1147. (int) (uinfo->spu_userversion & 0xffff),
  1148. QIB_USER_SWMAJOR, QIB_USER_SWMINOR);
  1149. goto bail;
  1150. }
  1151. if (num_subctxts > QLOGIC_IB_MAX_SUBCTXT) {
  1152. ret = -EINVAL;
  1153. goto bail;
  1154. }
  1155. rcd->subctxt_uregbase = vmalloc_user(PAGE_SIZE * num_subctxts);
  1156. if (!rcd->subctxt_uregbase) {
  1157. ret = -ENOMEM;
  1158. goto bail;
  1159. }
  1160. /* Note: rcd->rcvhdrq_size isn't initialized yet. */
  1161. size = ALIGN(dd->rcvhdrcnt * dd->rcvhdrentsize *
  1162. sizeof(u32), PAGE_SIZE) * num_subctxts;
  1163. rcd->subctxt_rcvhdr_base = vmalloc_user(size);
  1164. if (!rcd->subctxt_rcvhdr_base) {
  1165. ret = -ENOMEM;
  1166. goto bail_ureg;
  1167. }
  1168. rcd->subctxt_rcvegrbuf = vmalloc_user(rcd->rcvegrbuf_chunks *
  1169. rcd->rcvegrbuf_size *
  1170. num_subctxts);
  1171. if (!rcd->subctxt_rcvegrbuf) {
  1172. ret = -ENOMEM;
  1173. goto bail_rhdr;
  1174. }
  1175. rcd->subctxt_cnt = uinfo->spu_subctxt_cnt;
  1176. rcd->subctxt_id = uinfo->spu_subctxt_id;
  1177. rcd->active_slaves = 1;
  1178. rcd->redirect_seq_cnt = 1;
  1179. set_bit(QIB_CTXT_MASTER_UNINIT, &rcd->flag);
  1180. goto bail;
  1181. bail_rhdr:
  1182. vfree(rcd->subctxt_rcvhdr_base);
  1183. bail_ureg:
  1184. vfree(rcd->subctxt_uregbase);
  1185. rcd->subctxt_uregbase = NULL;
  1186. bail:
  1187. return ret;
  1188. }
  1189. static int setup_ctxt(struct qib_pportdata *ppd, int ctxt,
  1190. struct file *fp, const struct qib_user_info *uinfo)
  1191. {
  1192. struct qib_filedata *fd = fp->private_data;
  1193. struct qib_devdata *dd = ppd->dd;
  1194. struct qib_ctxtdata *rcd;
  1195. void *ptmp = NULL;
  1196. int ret;
  1197. int numa_id;
  1198. assign_ctxt_affinity(fp, dd);
  1199. numa_id = qib_numa_aware ? ((fd->rec_cpu_num != -1) ?
  1200. cpu_to_node(fd->rec_cpu_num) :
  1201. numa_node_id()) : dd->assigned_node_id;
  1202. rcd = qib_create_ctxtdata(ppd, ctxt, numa_id);
  1203. /*
  1204. * Allocate memory for use in qib_tid_update() at open to
  1205. * reduce cost of expected send setup per message segment
  1206. */
  1207. if (rcd)
  1208. ptmp = kmalloc(dd->rcvtidcnt * sizeof(u16) +
  1209. dd->rcvtidcnt * sizeof(struct page **),
  1210. GFP_KERNEL);
  1211. if (!rcd || !ptmp) {
  1212. qib_dev_err(dd,
  1213. "Unable to allocate ctxtdata memory, failing open\n");
  1214. ret = -ENOMEM;
  1215. goto bailerr;
  1216. }
  1217. rcd->userversion = uinfo->spu_userversion;
  1218. ret = init_subctxts(dd, rcd, uinfo);
  1219. if (ret)
  1220. goto bailerr;
  1221. rcd->tid_pg_list = ptmp;
  1222. rcd->pid = current->pid;
  1223. init_waitqueue_head(&dd->rcd[ctxt]->wait);
  1224. strlcpy(rcd->comm, current->comm, sizeof(rcd->comm));
  1225. ctxt_fp(fp) = rcd;
  1226. qib_stats.sps_ctxts++;
  1227. dd->freectxts--;
  1228. ret = 0;
  1229. goto bail;
  1230. bailerr:
  1231. if (fd->rec_cpu_num != -1)
  1232. __clear_bit(fd->rec_cpu_num, qib_cpulist);
  1233. dd->rcd[ctxt] = NULL;
  1234. kfree(rcd);
  1235. kfree(ptmp);
  1236. bail:
  1237. return ret;
  1238. }
  1239. static inline int usable(struct qib_pportdata *ppd)
  1240. {
  1241. struct qib_devdata *dd = ppd->dd;
  1242. return dd && (dd->flags & QIB_PRESENT) && dd->kregbase && ppd->lid &&
  1243. (ppd->lflags & QIBL_LINKACTIVE);
  1244. }
  1245. /*
  1246. * Select a context on the given device, either using a requested port
  1247. * or the port based on the context number.
  1248. */
  1249. static int choose_port_ctxt(struct file *fp, struct qib_devdata *dd, u32 port,
  1250. const struct qib_user_info *uinfo)
  1251. {
  1252. struct qib_pportdata *ppd = NULL;
  1253. int ret, ctxt;
  1254. if (port) {
  1255. if (!usable(dd->pport + port - 1)) {
  1256. ret = -ENETDOWN;
  1257. goto done;
  1258. } else
  1259. ppd = dd->pport + port - 1;
  1260. }
  1261. for (ctxt = dd->first_user_ctxt; ctxt < dd->cfgctxts && dd->rcd[ctxt];
  1262. ctxt++)
  1263. ;
  1264. if (ctxt == dd->cfgctxts) {
  1265. ret = -EBUSY;
  1266. goto done;
  1267. }
  1268. if (!ppd) {
  1269. u32 pidx = ctxt % dd->num_pports;
  1270. if (usable(dd->pport + pidx))
  1271. ppd = dd->pport + pidx;
  1272. else {
  1273. for (pidx = 0; pidx < dd->num_pports && !ppd;
  1274. pidx++)
  1275. if (usable(dd->pport + pidx))
  1276. ppd = dd->pport + pidx;
  1277. }
  1278. }
  1279. ret = ppd ? setup_ctxt(ppd, ctxt, fp, uinfo) : -ENETDOWN;
  1280. done:
  1281. return ret;
  1282. }
  1283. static int find_free_ctxt(int unit, struct file *fp,
  1284. const struct qib_user_info *uinfo)
  1285. {
  1286. struct qib_devdata *dd = qib_lookup(unit);
  1287. int ret;
  1288. if (!dd || (uinfo->spu_port && uinfo->spu_port > dd->num_pports))
  1289. ret = -ENODEV;
  1290. else
  1291. ret = choose_port_ctxt(fp, dd, uinfo->spu_port, uinfo);
  1292. return ret;
  1293. }
  1294. static int get_a_ctxt(struct file *fp, const struct qib_user_info *uinfo,
  1295. unsigned alg)
  1296. {
  1297. struct qib_devdata *udd = NULL;
  1298. int ret = 0, devmax, npresent, nup, ndev, dusable = 0, i;
  1299. u32 port = uinfo->spu_port, ctxt;
  1300. devmax = qib_count_units(&npresent, &nup);
  1301. if (!npresent) {
  1302. ret = -ENXIO;
  1303. goto done;
  1304. }
  1305. if (nup == 0) {
  1306. ret = -ENETDOWN;
  1307. goto done;
  1308. }
  1309. if (alg == QIB_PORT_ALG_ACROSS) {
  1310. unsigned inuse = ~0U;
  1311. /* find device (with ACTIVE ports) with fewest ctxts in use */
  1312. for (ndev = 0; ndev < devmax; ndev++) {
  1313. struct qib_devdata *dd = qib_lookup(ndev);
  1314. unsigned cused = 0, cfree = 0, pusable = 0;
  1315. if (!dd)
  1316. continue;
  1317. if (port && port <= dd->num_pports &&
  1318. usable(dd->pport + port - 1))
  1319. pusable = 1;
  1320. else
  1321. for (i = 0; i < dd->num_pports; i++)
  1322. if (usable(dd->pport + i))
  1323. pusable++;
  1324. if (!pusable)
  1325. continue;
  1326. for (ctxt = dd->first_user_ctxt; ctxt < dd->cfgctxts;
  1327. ctxt++)
  1328. if (dd->rcd[ctxt])
  1329. cused++;
  1330. else
  1331. cfree++;
  1332. if (cfree && cused < inuse) {
  1333. udd = dd;
  1334. inuse = cused;
  1335. }
  1336. }
  1337. if (udd) {
  1338. ret = choose_port_ctxt(fp, udd, port, uinfo);
  1339. goto done;
  1340. }
  1341. } else {
  1342. for (ndev = 0; ndev < devmax; ndev++) {
  1343. struct qib_devdata *dd = qib_lookup(ndev);
  1344. if (dd) {
  1345. ret = choose_port_ctxt(fp, dd, port, uinfo);
  1346. if (!ret)
  1347. goto done;
  1348. if (ret == -EBUSY)
  1349. dusable++;
  1350. }
  1351. }
  1352. }
  1353. ret = dusable ? -EBUSY : -ENETDOWN;
  1354. done:
  1355. return ret;
  1356. }
  1357. static int find_shared_ctxt(struct file *fp,
  1358. const struct qib_user_info *uinfo)
  1359. {
  1360. int devmax, ndev, i;
  1361. int ret = 0;
  1362. devmax = qib_count_units(NULL, NULL);
  1363. for (ndev = 0; ndev < devmax; ndev++) {
  1364. struct qib_devdata *dd = qib_lookup(ndev);
  1365. /* device portion of usable() */
  1366. if (!(dd && (dd->flags & QIB_PRESENT) && dd->kregbase))
  1367. continue;
  1368. for (i = dd->first_user_ctxt; i < dd->cfgctxts; i++) {
  1369. struct qib_ctxtdata *rcd = dd->rcd[i];
  1370. /* Skip ctxts which are not yet open */
  1371. if (!rcd || !rcd->cnt)
  1372. continue;
  1373. /* Skip ctxt if it doesn't match the requested one */
  1374. if (rcd->subctxt_id != uinfo->spu_subctxt_id)
  1375. continue;
  1376. /* Verify the sharing process matches the master */
  1377. if (rcd->subctxt_cnt != uinfo->spu_subctxt_cnt ||
  1378. rcd->userversion != uinfo->spu_userversion ||
  1379. rcd->cnt >= rcd->subctxt_cnt) {
  1380. ret = -EINVAL;
  1381. goto done;
  1382. }
  1383. ctxt_fp(fp) = rcd;
  1384. subctxt_fp(fp) = rcd->cnt++;
  1385. rcd->subpid[subctxt_fp(fp)] = current->pid;
  1386. tidcursor_fp(fp) = 0;
  1387. rcd->active_slaves |= 1 << subctxt_fp(fp);
  1388. ret = 1;
  1389. goto done;
  1390. }
  1391. }
  1392. done:
  1393. return ret;
  1394. }
  1395. static int qib_open(struct inode *in, struct file *fp)
  1396. {
  1397. /* The real work is performed later in qib_assign_ctxt() */
  1398. fp->private_data = kzalloc(sizeof(struct qib_filedata), GFP_KERNEL);
  1399. if (fp->private_data) /* no cpu affinity by default */
  1400. ((struct qib_filedata *)fp->private_data)->rec_cpu_num = -1;
  1401. return fp->private_data ? 0 : -ENOMEM;
  1402. }
  1403. static int find_hca(unsigned int cpu, int *unit)
  1404. {
  1405. int ret = 0, devmax, npresent, nup, ndev;
  1406. *unit = -1;
  1407. devmax = qib_count_units(&npresent, &nup);
  1408. if (!npresent) {
  1409. ret = -ENXIO;
  1410. goto done;
  1411. }
  1412. if (!nup) {
  1413. ret = -ENETDOWN;
  1414. goto done;
  1415. }
  1416. for (ndev = 0; ndev < devmax; ndev++) {
  1417. struct qib_devdata *dd = qib_lookup(ndev);
  1418. if (dd) {
  1419. if (pcibus_to_node(dd->pcidev->bus) < 0) {
  1420. ret = -EINVAL;
  1421. goto done;
  1422. }
  1423. if (cpu_to_node(cpu) ==
  1424. pcibus_to_node(dd->pcidev->bus)) {
  1425. *unit = ndev;
  1426. goto done;
  1427. }
  1428. }
  1429. }
  1430. done:
  1431. return ret;
  1432. }
  1433. static int do_qib_user_sdma_queue_create(struct file *fp)
  1434. {
  1435. struct qib_filedata *fd = fp->private_data;
  1436. struct qib_ctxtdata *rcd = fd->rcd;
  1437. struct qib_devdata *dd = rcd->dd;
  1438. if (dd->flags & QIB_HAS_SEND_DMA) {
  1439. fd->pq = qib_user_sdma_queue_create(&dd->pcidev->dev,
  1440. dd->unit,
  1441. rcd->ctxt,
  1442. fd->subctxt);
  1443. if (!fd->pq)
  1444. return -ENOMEM;
  1445. }
  1446. return 0;
  1447. }
  1448. /*
  1449. * Get ctxt early, so can set affinity prior to memory allocation.
  1450. */
  1451. static int qib_assign_ctxt(struct file *fp, const struct qib_user_info *uinfo)
  1452. {
  1453. int ret;
  1454. int i_minor;
  1455. unsigned swmajor, swminor, alg = QIB_PORT_ALG_ACROSS;
  1456. /* Check to be sure we haven't already initialized this file */
  1457. if (ctxt_fp(fp)) {
  1458. ret = -EINVAL;
  1459. goto done;
  1460. }
  1461. /* for now, if major version is different, bail */
  1462. swmajor = uinfo->spu_userversion >> 16;
  1463. if (swmajor != QIB_USER_SWMAJOR) {
  1464. ret = -ENODEV;
  1465. goto done;
  1466. }
  1467. swminor = uinfo->spu_userversion & 0xffff;
  1468. if (swminor >= 11 && uinfo->spu_port_alg < QIB_PORT_ALG_COUNT)
  1469. alg = uinfo->spu_port_alg;
  1470. mutex_lock(&qib_mutex);
  1471. if (qib_compatible_subctxts(swmajor, swminor) &&
  1472. uinfo->spu_subctxt_cnt) {
  1473. ret = find_shared_ctxt(fp, uinfo);
  1474. if (ret > 0) {
  1475. ret = do_qib_user_sdma_queue_create(fp);
  1476. if (!ret)
  1477. assign_ctxt_affinity(fp, (ctxt_fp(fp))->dd);
  1478. goto done_ok;
  1479. }
  1480. }
  1481. i_minor = iminor(file_inode(fp)) - QIB_USER_MINOR_BASE;
  1482. if (i_minor)
  1483. ret = find_free_ctxt(i_minor - 1, fp, uinfo);
  1484. else {
  1485. int unit;
  1486. const unsigned int cpu = cpumask_first(&current->cpus_allowed);
  1487. const unsigned int weight =
  1488. cpumask_weight(&current->cpus_allowed);
  1489. if (weight == 1 && !test_bit(cpu, qib_cpulist))
  1490. if (!find_hca(cpu, &unit) && unit >= 0)
  1491. if (!find_free_ctxt(unit, fp, uinfo)) {
  1492. ret = 0;
  1493. goto done_chk_sdma;
  1494. }
  1495. ret = get_a_ctxt(fp, uinfo, alg);
  1496. }
  1497. done_chk_sdma:
  1498. if (!ret)
  1499. ret = do_qib_user_sdma_queue_create(fp);
  1500. done_ok:
  1501. mutex_unlock(&qib_mutex);
  1502. done:
  1503. return ret;
  1504. }
  1505. static int qib_do_user_init(struct file *fp,
  1506. const struct qib_user_info *uinfo)
  1507. {
  1508. int ret;
  1509. struct qib_ctxtdata *rcd = ctxt_fp(fp);
  1510. struct qib_devdata *dd;
  1511. unsigned uctxt;
  1512. /* Subctxts don't need to initialize anything since master did it. */
  1513. if (subctxt_fp(fp)) {
  1514. ret = wait_event_interruptible(rcd->wait,
  1515. !test_bit(QIB_CTXT_MASTER_UNINIT, &rcd->flag));
  1516. goto bail;
  1517. }
  1518. dd = rcd->dd;
  1519. /* some ctxts may get extra buffers, calculate that here */
  1520. uctxt = rcd->ctxt - dd->first_user_ctxt;
  1521. if (uctxt < dd->ctxts_extrabuf) {
  1522. rcd->piocnt = dd->pbufsctxt + 1;
  1523. rcd->pio_base = rcd->piocnt * uctxt;
  1524. } else {
  1525. rcd->piocnt = dd->pbufsctxt;
  1526. rcd->pio_base = rcd->piocnt * uctxt +
  1527. dd->ctxts_extrabuf;
  1528. }
  1529. /*
  1530. * All user buffers are 2KB buffers. If we ever support
  1531. * giving 4KB buffers to user processes, this will need some
  1532. * work. Can't use piobufbase directly, because it has
  1533. * both 2K and 4K buffer base values. So check and handle.
  1534. */
  1535. if ((rcd->pio_base + rcd->piocnt) > dd->piobcnt2k) {
  1536. if (rcd->pio_base >= dd->piobcnt2k) {
  1537. qib_dev_err(dd,
  1538. "%u:ctxt%u: no 2KB buffers available\n",
  1539. dd->unit, rcd->ctxt);
  1540. ret = -ENOBUFS;
  1541. goto bail;
  1542. }
  1543. rcd->piocnt = dd->piobcnt2k - rcd->pio_base;
  1544. qib_dev_err(dd, "Ctxt%u: would use 4KB bufs, using %u\n",
  1545. rcd->ctxt, rcd->piocnt);
  1546. }
  1547. rcd->piobufs = dd->pio2k_bufbase + rcd->pio_base * dd->palign;
  1548. qib_chg_pioavailkernel(dd, rcd->pio_base, rcd->piocnt,
  1549. TXCHK_CHG_TYPE_USER, rcd);
  1550. /*
  1551. * try to ensure that processes start up with consistent avail update
  1552. * for their own range, at least. If system very quiet, it might
  1553. * have the in-memory copy out of date at startup for this range of
  1554. * buffers, when a context gets re-used. Do after the chg_pioavail
  1555. * and before the rest of setup, so it's "almost certain" the dma
  1556. * will have occurred (can't 100% guarantee, but should be many
  1557. * decimals of 9s, with this ordering), given how much else happens
  1558. * after this.
  1559. */
  1560. dd->f_sendctrl(dd->pport, QIB_SENDCTRL_AVAIL_BLIP);
  1561. /*
  1562. * Now allocate the rcvhdr Q and eager TIDs; skip the TID
  1563. * array for time being. If rcd->ctxt > chip-supported,
  1564. * we need to do extra stuff here to handle by handling overflow
  1565. * through ctxt 0, someday
  1566. */
  1567. ret = qib_create_rcvhdrq(dd, rcd);
  1568. if (!ret)
  1569. ret = qib_setup_eagerbufs(rcd);
  1570. if (ret)
  1571. goto bail_pio;
  1572. rcd->tidcursor = 0; /* start at beginning after open */
  1573. /* initialize poll variables... */
  1574. rcd->urgent = 0;
  1575. rcd->urgent_poll = 0;
  1576. /*
  1577. * Now enable the ctxt for receive.
  1578. * For chips that are set to DMA the tail register to memory
  1579. * when they change (and when the update bit transitions from
  1580. * 0 to 1. So for those chips, we turn it off and then back on.
  1581. * This will (very briefly) affect any other open ctxts, but the
  1582. * duration is very short, and therefore isn't an issue. We
  1583. * explicitly set the in-memory tail copy to 0 beforehand, so we
  1584. * don't have to wait to be sure the DMA update has happened
  1585. * (chip resets head/tail to 0 on transition to enable).
  1586. */
  1587. if (rcd->rcvhdrtail_kvaddr)
  1588. qib_clear_rcvhdrtail(rcd);
  1589. dd->f_rcvctrl(rcd->ppd, QIB_RCVCTRL_CTXT_ENB | QIB_RCVCTRL_TIDFLOW_ENB,
  1590. rcd->ctxt);
  1591. /* Notify any waiting slaves */
  1592. if (rcd->subctxt_cnt) {
  1593. clear_bit(QIB_CTXT_MASTER_UNINIT, &rcd->flag);
  1594. wake_up(&rcd->wait);
  1595. }
  1596. return 0;
  1597. bail_pio:
  1598. qib_chg_pioavailkernel(dd, rcd->pio_base, rcd->piocnt,
  1599. TXCHK_CHG_TYPE_KERN, rcd);
  1600. bail:
  1601. return ret;
  1602. }
  1603. /**
  1604. * unlock_exptid - unlock any expected TID entries context still had in use
  1605. * @rcd: ctxt
  1606. *
  1607. * We don't actually update the chip here, because we do a bulk update
  1608. * below, using f_clear_tids.
  1609. */
  1610. static void unlock_expected_tids(struct qib_ctxtdata *rcd)
  1611. {
  1612. struct qib_devdata *dd = rcd->dd;
  1613. int ctxt_tidbase = rcd->ctxt * dd->rcvtidcnt;
  1614. int i, cnt = 0, maxtid = ctxt_tidbase + dd->rcvtidcnt;
  1615. for (i = ctxt_tidbase; i < maxtid; i++) {
  1616. struct page *p = dd->pageshadow[i];
  1617. dma_addr_t phys;
  1618. if (!p)
  1619. continue;
  1620. phys = dd->physshadow[i];
  1621. dd->physshadow[i] = dd->tidinvalid;
  1622. dd->pageshadow[i] = NULL;
  1623. pci_unmap_page(dd->pcidev, phys, PAGE_SIZE,
  1624. PCI_DMA_FROMDEVICE);
  1625. qib_release_user_pages(&p, 1);
  1626. cnt++;
  1627. }
  1628. }
  1629. static int qib_close(struct inode *in, struct file *fp)
  1630. {
  1631. int ret = 0;
  1632. struct qib_filedata *fd;
  1633. struct qib_ctxtdata *rcd;
  1634. struct qib_devdata *dd;
  1635. unsigned long flags;
  1636. unsigned ctxt;
  1637. pid_t pid;
  1638. mutex_lock(&qib_mutex);
  1639. fd = fp->private_data;
  1640. fp->private_data = NULL;
  1641. rcd = fd->rcd;
  1642. if (!rcd) {
  1643. mutex_unlock(&qib_mutex);
  1644. goto bail;
  1645. }
  1646. dd = rcd->dd;
  1647. /* ensure all pio buffer writes in progress are flushed */
  1648. qib_flush_wc();
  1649. /* drain user sdma queue */
  1650. if (fd->pq) {
  1651. qib_user_sdma_queue_drain(rcd->ppd, fd->pq);
  1652. qib_user_sdma_queue_destroy(fd->pq);
  1653. }
  1654. if (fd->rec_cpu_num != -1)
  1655. __clear_bit(fd->rec_cpu_num, qib_cpulist);
  1656. if (--rcd->cnt) {
  1657. /*
  1658. * XXX If the master closes the context before the slave(s),
  1659. * revoke the mmap for the eager receive queue so
  1660. * the slave(s) don't wait for receive data forever.
  1661. */
  1662. rcd->active_slaves &= ~(1 << fd->subctxt);
  1663. rcd->subpid[fd->subctxt] = 0;
  1664. mutex_unlock(&qib_mutex);
  1665. goto bail;
  1666. }
  1667. /* early; no interrupt users after this */
  1668. spin_lock_irqsave(&dd->uctxt_lock, flags);
  1669. ctxt = rcd->ctxt;
  1670. dd->rcd[ctxt] = NULL;
  1671. pid = rcd->pid;
  1672. rcd->pid = 0;
  1673. spin_unlock_irqrestore(&dd->uctxt_lock, flags);
  1674. if (rcd->rcvwait_to || rcd->piowait_to ||
  1675. rcd->rcvnowait || rcd->pionowait) {
  1676. rcd->rcvwait_to = 0;
  1677. rcd->piowait_to = 0;
  1678. rcd->rcvnowait = 0;
  1679. rcd->pionowait = 0;
  1680. }
  1681. if (rcd->flag)
  1682. rcd->flag = 0;
  1683. if (dd->kregbase) {
  1684. /* atomically clear receive enable ctxt and intr avail. */
  1685. dd->f_rcvctrl(rcd->ppd, QIB_RCVCTRL_CTXT_DIS |
  1686. QIB_RCVCTRL_INTRAVAIL_DIS, ctxt);
  1687. /* clean up the pkeys for this ctxt user */
  1688. qib_clean_part_key(rcd, dd);
  1689. qib_disarm_piobufs(dd, rcd->pio_base, rcd->piocnt);
  1690. qib_chg_pioavailkernel(dd, rcd->pio_base,
  1691. rcd->piocnt, TXCHK_CHG_TYPE_KERN, NULL);
  1692. dd->f_clear_tids(dd, rcd);
  1693. if (dd->pageshadow)
  1694. unlock_expected_tids(rcd);
  1695. qib_stats.sps_ctxts--;
  1696. dd->freectxts++;
  1697. }
  1698. mutex_unlock(&qib_mutex);
  1699. qib_free_ctxtdata(dd, rcd); /* after releasing the mutex */
  1700. bail:
  1701. kfree(fd);
  1702. return ret;
  1703. }
  1704. static int qib_ctxt_info(struct file *fp, struct qib_ctxt_info __user *uinfo)
  1705. {
  1706. struct qib_ctxt_info info;
  1707. int ret;
  1708. size_t sz;
  1709. struct qib_ctxtdata *rcd = ctxt_fp(fp);
  1710. struct qib_filedata *fd;
  1711. fd = fp->private_data;
  1712. info.num_active = qib_count_active_units();
  1713. info.unit = rcd->dd->unit;
  1714. info.port = rcd->ppd->port;
  1715. info.ctxt = rcd->ctxt;
  1716. info.subctxt = subctxt_fp(fp);
  1717. /* Number of user ctxts available for this device. */
  1718. info.num_ctxts = rcd->dd->cfgctxts - rcd->dd->first_user_ctxt;
  1719. info.num_subctxts = rcd->subctxt_cnt;
  1720. info.rec_cpu = fd->rec_cpu_num;
  1721. sz = sizeof(info);
  1722. if (copy_to_user(uinfo, &info, sz)) {
  1723. ret = -EFAULT;
  1724. goto bail;
  1725. }
  1726. ret = 0;
  1727. bail:
  1728. return ret;
  1729. }
  1730. static int qib_sdma_get_inflight(struct qib_user_sdma_queue *pq,
  1731. u32 __user *inflightp)
  1732. {
  1733. const u32 val = qib_user_sdma_inflight_counter(pq);
  1734. if (put_user(val, inflightp))
  1735. return -EFAULT;
  1736. return 0;
  1737. }
  1738. static int qib_sdma_get_complete(struct qib_pportdata *ppd,
  1739. struct qib_user_sdma_queue *pq,
  1740. u32 __user *completep)
  1741. {
  1742. u32 val;
  1743. int err;
  1744. if (!pq)
  1745. return -EINVAL;
  1746. err = qib_user_sdma_make_progress(ppd, pq);
  1747. if (err < 0)
  1748. return err;
  1749. val = qib_user_sdma_complete_counter(pq);
  1750. if (put_user(val, completep))
  1751. return -EFAULT;
  1752. return 0;
  1753. }
  1754. static int disarm_req_delay(struct qib_ctxtdata *rcd)
  1755. {
  1756. int ret = 0;
  1757. if (!usable(rcd->ppd)) {
  1758. int i;
  1759. /*
  1760. * if link is down, or otherwise not usable, delay
  1761. * the caller up to 30 seconds, so we don't thrash
  1762. * in trying to get the chip back to ACTIVE, and
  1763. * set flag so they make the call again.
  1764. */
  1765. if (rcd->user_event_mask) {
  1766. /*
  1767. * subctxt_cnt is 0 if not shared, so do base
  1768. * separately, first, then remaining subctxt, if any
  1769. */
  1770. set_bit(_QIB_EVENT_DISARM_BUFS_BIT,
  1771. &rcd->user_event_mask[0]);
  1772. for (i = 1; i < rcd->subctxt_cnt; i++)
  1773. set_bit(_QIB_EVENT_DISARM_BUFS_BIT,
  1774. &rcd->user_event_mask[i]);
  1775. }
  1776. for (i = 0; !usable(rcd->ppd) && i < 300; i++)
  1777. msleep(100);
  1778. ret = -ENETDOWN;
  1779. }
  1780. return ret;
  1781. }
  1782. /*
  1783. * Find all user contexts in use, and set the specified bit in their
  1784. * event mask.
  1785. * See also find_ctxt() for a similar use, that is specific to send buffers.
  1786. */
  1787. int qib_set_uevent_bits(struct qib_pportdata *ppd, const int evtbit)
  1788. {
  1789. struct qib_ctxtdata *rcd;
  1790. unsigned ctxt;
  1791. int ret = 0;
  1792. unsigned long flags;
  1793. spin_lock_irqsave(&ppd->dd->uctxt_lock, flags);
  1794. for (ctxt = ppd->dd->first_user_ctxt; ctxt < ppd->dd->cfgctxts;
  1795. ctxt++) {
  1796. rcd = ppd->dd->rcd[ctxt];
  1797. if (!rcd)
  1798. continue;
  1799. if (rcd->user_event_mask) {
  1800. int i;
  1801. /*
  1802. * subctxt_cnt is 0 if not shared, so do base
  1803. * separately, first, then remaining subctxt, if any
  1804. */
  1805. set_bit(evtbit, &rcd->user_event_mask[0]);
  1806. for (i = 1; i < rcd->subctxt_cnt; i++)
  1807. set_bit(evtbit, &rcd->user_event_mask[i]);
  1808. }
  1809. ret = 1;
  1810. break;
  1811. }
  1812. spin_unlock_irqrestore(&ppd->dd->uctxt_lock, flags);
  1813. return ret;
  1814. }
  1815. /*
  1816. * clear the event notifier events for this context.
  1817. * For the DISARM_BUFS case, we also take action (this obsoletes
  1818. * the older QIB_CMD_DISARM_BUFS, but we keep it for backwards
  1819. * compatibility.
  1820. * Other bits don't currently require actions, just atomically clear.
  1821. * User process then performs actions appropriate to bit having been
  1822. * set, if desired, and checks again in future.
  1823. */
  1824. static int qib_user_event_ack(struct qib_ctxtdata *rcd, int subctxt,
  1825. unsigned long events)
  1826. {
  1827. int ret = 0, i;
  1828. for (i = 0; i <= _QIB_MAX_EVENT_BIT; i++) {
  1829. if (!test_bit(i, &events))
  1830. continue;
  1831. if (i == _QIB_EVENT_DISARM_BUFS_BIT) {
  1832. (void)qib_disarm_piobufs_ifneeded(rcd);
  1833. ret = disarm_req_delay(rcd);
  1834. } else
  1835. clear_bit(i, &rcd->user_event_mask[subctxt]);
  1836. }
  1837. return ret;
  1838. }
  1839. static ssize_t qib_write(struct file *fp, const char __user *data,
  1840. size_t count, loff_t *off)
  1841. {
  1842. const struct qib_cmd __user *ucmd;
  1843. struct qib_ctxtdata *rcd;
  1844. const void __user *src;
  1845. size_t consumed, copy = 0;
  1846. struct qib_cmd cmd;
  1847. ssize_t ret = 0;
  1848. void *dest;
  1849. if (count < sizeof(cmd.type)) {
  1850. ret = -EINVAL;
  1851. goto bail;
  1852. }
  1853. ucmd = (const struct qib_cmd __user *) data;
  1854. if (copy_from_user(&cmd.type, &ucmd->type, sizeof(cmd.type))) {
  1855. ret = -EFAULT;
  1856. goto bail;
  1857. }
  1858. consumed = sizeof(cmd.type);
  1859. switch (cmd.type) {
  1860. case QIB_CMD_ASSIGN_CTXT:
  1861. case QIB_CMD_USER_INIT:
  1862. copy = sizeof(cmd.cmd.user_info);
  1863. dest = &cmd.cmd.user_info;
  1864. src = &ucmd->cmd.user_info;
  1865. break;
  1866. case QIB_CMD_RECV_CTRL:
  1867. copy = sizeof(cmd.cmd.recv_ctrl);
  1868. dest = &cmd.cmd.recv_ctrl;
  1869. src = &ucmd->cmd.recv_ctrl;
  1870. break;
  1871. case QIB_CMD_CTXT_INFO:
  1872. copy = sizeof(cmd.cmd.ctxt_info);
  1873. dest = &cmd.cmd.ctxt_info;
  1874. src = &ucmd->cmd.ctxt_info;
  1875. break;
  1876. case QIB_CMD_TID_UPDATE:
  1877. case QIB_CMD_TID_FREE:
  1878. copy = sizeof(cmd.cmd.tid_info);
  1879. dest = &cmd.cmd.tid_info;
  1880. src = &ucmd->cmd.tid_info;
  1881. break;
  1882. case QIB_CMD_SET_PART_KEY:
  1883. copy = sizeof(cmd.cmd.part_key);
  1884. dest = &cmd.cmd.part_key;
  1885. src = &ucmd->cmd.part_key;
  1886. break;
  1887. case QIB_CMD_DISARM_BUFS:
  1888. case QIB_CMD_PIOAVAILUPD: /* force an update of PIOAvail reg */
  1889. copy = 0;
  1890. src = NULL;
  1891. dest = NULL;
  1892. break;
  1893. case QIB_CMD_POLL_TYPE:
  1894. copy = sizeof(cmd.cmd.poll_type);
  1895. dest = &cmd.cmd.poll_type;
  1896. src = &ucmd->cmd.poll_type;
  1897. break;
  1898. case QIB_CMD_ARMLAUNCH_CTRL:
  1899. copy = sizeof(cmd.cmd.armlaunch_ctrl);
  1900. dest = &cmd.cmd.armlaunch_ctrl;
  1901. src = &ucmd->cmd.armlaunch_ctrl;
  1902. break;
  1903. case QIB_CMD_SDMA_INFLIGHT:
  1904. copy = sizeof(cmd.cmd.sdma_inflight);
  1905. dest = &cmd.cmd.sdma_inflight;
  1906. src = &ucmd->cmd.sdma_inflight;
  1907. break;
  1908. case QIB_CMD_SDMA_COMPLETE:
  1909. copy = sizeof(cmd.cmd.sdma_complete);
  1910. dest = &cmd.cmd.sdma_complete;
  1911. src = &ucmd->cmd.sdma_complete;
  1912. break;
  1913. case QIB_CMD_ACK_EVENT:
  1914. copy = sizeof(cmd.cmd.event_mask);
  1915. dest = &cmd.cmd.event_mask;
  1916. src = &ucmd->cmd.event_mask;
  1917. break;
  1918. default:
  1919. ret = -EINVAL;
  1920. goto bail;
  1921. }
  1922. if (copy) {
  1923. if ((count - consumed) < copy) {
  1924. ret = -EINVAL;
  1925. goto bail;
  1926. }
  1927. if (copy_from_user(dest, src, copy)) {
  1928. ret = -EFAULT;
  1929. goto bail;
  1930. }
  1931. consumed += copy;
  1932. }
  1933. rcd = ctxt_fp(fp);
  1934. if (!rcd && cmd.type != QIB_CMD_ASSIGN_CTXT) {
  1935. ret = -EINVAL;
  1936. goto bail;
  1937. }
  1938. switch (cmd.type) {
  1939. case QIB_CMD_ASSIGN_CTXT:
  1940. ret = qib_assign_ctxt(fp, &cmd.cmd.user_info);
  1941. if (ret)
  1942. goto bail;
  1943. break;
  1944. case QIB_CMD_USER_INIT:
  1945. ret = qib_do_user_init(fp, &cmd.cmd.user_info);
  1946. if (ret)
  1947. goto bail;
  1948. ret = qib_get_base_info(fp, (void __user *) (unsigned long)
  1949. cmd.cmd.user_info.spu_base_info,
  1950. cmd.cmd.user_info.spu_base_info_size);
  1951. break;
  1952. case QIB_CMD_RECV_CTRL:
  1953. ret = qib_manage_rcvq(rcd, subctxt_fp(fp), cmd.cmd.recv_ctrl);
  1954. break;
  1955. case QIB_CMD_CTXT_INFO:
  1956. ret = qib_ctxt_info(fp, (struct qib_ctxt_info __user *)
  1957. (unsigned long) cmd.cmd.ctxt_info);
  1958. break;
  1959. case QIB_CMD_TID_UPDATE:
  1960. ret = qib_tid_update(rcd, fp, &cmd.cmd.tid_info);
  1961. break;
  1962. case QIB_CMD_TID_FREE:
  1963. ret = qib_tid_free(rcd, subctxt_fp(fp), &cmd.cmd.tid_info);
  1964. break;
  1965. case QIB_CMD_SET_PART_KEY:
  1966. ret = qib_set_part_key(rcd, cmd.cmd.part_key);
  1967. break;
  1968. case QIB_CMD_DISARM_BUFS:
  1969. (void)qib_disarm_piobufs_ifneeded(rcd);
  1970. ret = disarm_req_delay(rcd);
  1971. break;
  1972. case QIB_CMD_PIOAVAILUPD:
  1973. qib_force_pio_avail_update(rcd->dd);
  1974. break;
  1975. case QIB_CMD_POLL_TYPE:
  1976. rcd->poll_type = cmd.cmd.poll_type;
  1977. break;
  1978. case QIB_CMD_ARMLAUNCH_CTRL:
  1979. rcd->dd->f_set_armlaunch(rcd->dd, cmd.cmd.armlaunch_ctrl);
  1980. break;
  1981. case QIB_CMD_SDMA_INFLIGHT:
  1982. ret = qib_sdma_get_inflight(user_sdma_queue_fp(fp),
  1983. (u32 __user *) (unsigned long)
  1984. cmd.cmd.sdma_inflight);
  1985. break;
  1986. case QIB_CMD_SDMA_COMPLETE:
  1987. ret = qib_sdma_get_complete(rcd->ppd,
  1988. user_sdma_queue_fp(fp),
  1989. (u32 __user *) (unsigned long)
  1990. cmd.cmd.sdma_complete);
  1991. break;
  1992. case QIB_CMD_ACK_EVENT:
  1993. ret = qib_user_event_ack(rcd, subctxt_fp(fp),
  1994. cmd.cmd.event_mask);
  1995. break;
  1996. }
  1997. if (ret >= 0)
  1998. ret = consumed;
  1999. bail:
  2000. return ret;
  2001. }
  2002. static ssize_t qib_aio_write(struct kiocb *iocb, const struct iovec *iov,
  2003. unsigned long dim, loff_t off)
  2004. {
  2005. struct qib_filedata *fp = iocb->ki_filp->private_data;
  2006. struct qib_ctxtdata *rcd = ctxt_fp(iocb->ki_filp);
  2007. struct qib_user_sdma_queue *pq = fp->pq;
  2008. if (!dim || !pq)
  2009. return -EINVAL;
  2010. return qib_user_sdma_writev(rcd, pq, iov, dim);
  2011. }
  2012. static struct class *qib_class;
  2013. static dev_t qib_dev;
  2014. int qib_cdev_init(int minor, const char *name,
  2015. const struct file_operations *fops,
  2016. struct cdev **cdevp, struct device **devp)
  2017. {
  2018. const dev_t dev = MKDEV(MAJOR(qib_dev), minor);
  2019. struct cdev *cdev;
  2020. struct device *device = NULL;
  2021. int ret;
  2022. cdev = cdev_alloc();
  2023. if (!cdev) {
  2024. pr_err("Could not allocate cdev for minor %d, %s\n",
  2025. minor, name);
  2026. ret = -ENOMEM;
  2027. goto done;
  2028. }
  2029. cdev->owner = THIS_MODULE;
  2030. cdev->ops = fops;
  2031. kobject_set_name(&cdev->kobj, name);
  2032. ret = cdev_add(cdev, dev, 1);
  2033. if (ret < 0) {
  2034. pr_err("Could not add cdev for minor %d, %s (err %d)\n",
  2035. minor, name, -ret);
  2036. goto err_cdev;
  2037. }
  2038. device = device_create(qib_class, NULL, dev, NULL, "%s", name);
  2039. if (!IS_ERR(device))
  2040. goto done;
  2041. ret = PTR_ERR(device);
  2042. device = NULL;
  2043. pr_err("Could not create device for minor %d, %s (err %d)\n",
  2044. minor, name, -ret);
  2045. err_cdev:
  2046. cdev_del(cdev);
  2047. cdev = NULL;
  2048. done:
  2049. *cdevp = cdev;
  2050. *devp = device;
  2051. return ret;
  2052. }
  2053. void qib_cdev_cleanup(struct cdev **cdevp, struct device **devp)
  2054. {
  2055. struct device *device = *devp;
  2056. if (device) {
  2057. device_unregister(device);
  2058. *devp = NULL;
  2059. }
  2060. if (*cdevp) {
  2061. cdev_del(*cdevp);
  2062. *cdevp = NULL;
  2063. }
  2064. }
  2065. static struct cdev *wildcard_cdev;
  2066. static struct device *wildcard_device;
  2067. int __init qib_dev_init(void)
  2068. {
  2069. int ret;
  2070. ret = alloc_chrdev_region(&qib_dev, 0, QIB_NMINORS, QIB_DRV_NAME);
  2071. if (ret < 0) {
  2072. pr_err("Could not allocate chrdev region (err %d)\n", -ret);
  2073. goto done;
  2074. }
  2075. qib_class = class_create(THIS_MODULE, "ipath");
  2076. if (IS_ERR(qib_class)) {
  2077. ret = PTR_ERR(qib_class);
  2078. pr_err("Could not create device class (err %d)\n", -ret);
  2079. unregister_chrdev_region(qib_dev, QIB_NMINORS);
  2080. }
  2081. done:
  2082. return ret;
  2083. }
  2084. void qib_dev_cleanup(void)
  2085. {
  2086. if (qib_class) {
  2087. class_destroy(qib_class);
  2088. qib_class = NULL;
  2089. }
  2090. unregister_chrdev_region(qib_dev, QIB_NMINORS);
  2091. }
  2092. static atomic_t user_count = ATOMIC_INIT(0);
  2093. static void qib_user_remove(struct qib_devdata *dd)
  2094. {
  2095. if (atomic_dec_return(&user_count) == 0)
  2096. qib_cdev_cleanup(&wildcard_cdev, &wildcard_device);
  2097. qib_cdev_cleanup(&dd->user_cdev, &dd->user_device);
  2098. }
  2099. static int qib_user_add(struct qib_devdata *dd)
  2100. {
  2101. char name[10];
  2102. int ret;
  2103. if (atomic_inc_return(&user_count) == 1) {
  2104. ret = qib_cdev_init(0, "ipath", &qib_file_ops,
  2105. &wildcard_cdev, &wildcard_device);
  2106. if (ret)
  2107. goto done;
  2108. }
  2109. snprintf(name, sizeof(name), "ipath%d", dd->unit);
  2110. ret = qib_cdev_init(dd->unit + 1, name, &qib_file_ops,
  2111. &dd->user_cdev, &dd->user_device);
  2112. if (ret)
  2113. qib_user_remove(dd);
  2114. done:
  2115. return ret;
  2116. }
  2117. /*
  2118. * Create per-unit files in /dev
  2119. */
  2120. int qib_device_create(struct qib_devdata *dd)
  2121. {
  2122. int r, ret;
  2123. r = qib_user_add(dd);
  2124. ret = qib_diag_add(dd);
  2125. if (r && !ret)
  2126. ret = r;
  2127. return ret;
  2128. }
  2129. /*
  2130. * Remove per-unit files in /dev
  2131. * void, core kernel returns no errors for this stuff
  2132. */
  2133. void qib_device_remove(struct qib_devdata *dd)
  2134. {
  2135. qib_user_remove(dd);
  2136. qib_diag_remove(dd);
  2137. }