memory.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570
  1. /*
  2. * Copyright (c) by Jaroslav Kysela <perex@suse.cz>
  3. * Copyright (c) by Takashi Iwai <tiwai@suse.de>
  4. *
  5. * EMU10K1 memory page allocation (PTB area)
  6. *
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  21. *
  22. */
  23. #include <sound/driver.h>
  24. #include <linux/pci.h>
  25. #include <linux/time.h>
  26. #include <linux/mutex.h>
  27. #include <sound/core.h>
  28. #include <sound/emu10k1.h>
  29. /* page arguments of these two macros are Emu page (4096 bytes), not like
  30. * aligned pages in others
  31. */
  32. #define __set_ptb_entry(emu,page,addr) \
  33. (((u32 *)(emu)->ptb_pages.area)[page] = cpu_to_le32(((addr) << 1) | (page)))
  34. #define UNIT_PAGES (PAGE_SIZE / EMUPAGESIZE)
  35. #define MAX_ALIGN_PAGES (MAXPAGES / UNIT_PAGES)
  36. /* get aligned page from offset address */
  37. #define get_aligned_page(offset) ((offset) >> PAGE_SHIFT)
  38. /* get offset address from aligned page */
  39. #define aligned_page_offset(page) ((page) << PAGE_SHIFT)
  40. #if PAGE_SIZE == 4096
  41. /* page size == EMUPAGESIZE */
  42. /* fill PTB entrie(s) corresponding to page with addr */
  43. #define set_ptb_entry(emu,page,addr) __set_ptb_entry(emu,page,addr)
  44. /* fill PTB entrie(s) corresponding to page with silence pointer */
  45. #define set_silent_ptb(emu,page) __set_ptb_entry(emu,page,emu->silent_page.addr)
  46. #else
  47. /* fill PTB entries -- we need to fill UNIT_PAGES entries */
  48. static inline void set_ptb_entry(struct snd_emu10k1 *emu, int page, dma_addr_t addr)
  49. {
  50. int i;
  51. page *= UNIT_PAGES;
  52. for (i = 0; i < UNIT_PAGES; i++, page++) {
  53. __set_ptb_entry(emu, page, addr);
  54. addr += EMUPAGESIZE;
  55. }
  56. }
  57. static inline void set_silent_ptb(struct snd_emu10k1 *emu, int page)
  58. {
  59. int i;
  60. page *= UNIT_PAGES;
  61. for (i = 0; i < UNIT_PAGES; i++, page++)
  62. /* do not increment ptr */
  63. __set_ptb_entry(emu, page, emu->silent_page.addr);
  64. }
  65. #endif /* PAGE_SIZE */
  66. /*
  67. */
  68. static int synth_alloc_pages(struct snd_emu10k1 *hw, struct snd_emu10k1_memblk *blk);
  69. static int synth_free_pages(struct snd_emu10k1 *hw, struct snd_emu10k1_memblk *blk);
  70. #define get_emu10k1_memblk(l,member) list_entry(l, struct snd_emu10k1_memblk, member)
  71. /* initialize emu10k1 part */
  72. static void emu10k1_memblk_init(struct snd_emu10k1_memblk *blk)
  73. {
  74. blk->mapped_page = -1;
  75. INIT_LIST_HEAD(&blk->mapped_link);
  76. INIT_LIST_HEAD(&blk->mapped_order_link);
  77. blk->map_locked = 0;
  78. blk->first_page = get_aligned_page(blk->mem.offset);
  79. blk->last_page = get_aligned_page(blk->mem.offset + blk->mem.size - 1);
  80. blk->pages = blk->last_page - blk->first_page + 1;
  81. }
  82. /*
  83. * search empty region on PTB with the given size
  84. *
  85. * if an empty region is found, return the page and store the next mapped block
  86. * in nextp
  87. * if not found, return a negative error code.
  88. */
  89. static int search_empty_map_area(struct snd_emu10k1 *emu, int npages, struct list_head **nextp)
  90. {
  91. int page = 0, found_page = -ENOMEM;
  92. int max_size = npages;
  93. int size;
  94. struct list_head *candidate = &emu->mapped_link_head;
  95. struct list_head *pos;
  96. list_for_each (pos, &emu->mapped_link_head) {
  97. struct snd_emu10k1_memblk *blk = get_emu10k1_memblk(pos, mapped_link);
  98. snd_assert(blk->mapped_page >= 0, continue);
  99. size = blk->mapped_page - page;
  100. if (size == npages) {
  101. *nextp = pos;
  102. return page;
  103. }
  104. else if (size > max_size) {
  105. /* we look for the maximum empty hole */
  106. max_size = size;
  107. candidate = pos;
  108. found_page = page;
  109. }
  110. page = blk->mapped_page + blk->pages;
  111. }
  112. size = MAX_ALIGN_PAGES - page;
  113. if (size >= max_size) {
  114. *nextp = pos;
  115. return page;
  116. }
  117. *nextp = candidate;
  118. return found_page;
  119. }
  120. /*
  121. * map a memory block onto emu10k1's PTB
  122. *
  123. * call with memblk_lock held
  124. */
  125. static int map_memblk(struct snd_emu10k1 *emu, struct snd_emu10k1_memblk *blk)
  126. {
  127. int page, pg;
  128. struct list_head *next;
  129. page = search_empty_map_area(emu, blk->pages, &next);
  130. if (page < 0) /* not found */
  131. return page;
  132. /* insert this block in the proper position of mapped list */
  133. list_add_tail(&blk->mapped_link, next);
  134. /* append this as a newest block in order list */
  135. list_add_tail(&blk->mapped_order_link, &emu->mapped_order_link_head);
  136. blk->mapped_page = page;
  137. /* fill PTB */
  138. for (pg = blk->first_page; pg <= blk->last_page; pg++) {
  139. set_ptb_entry(emu, page, emu->page_addr_table[pg]);
  140. page++;
  141. }
  142. return 0;
  143. }
  144. /*
  145. * unmap the block
  146. * return the size of resultant empty pages
  147. *
  148. * call with memblk_lock held
  149. */
  150. static int unmap_memblk(struct snd_emu10k1 *emu, struct snd_emu10k1_memblk *blk)
  151. {
  152. int start_page, end_page, mpage, pg;
  153. struct list_head *p;
  154. struct snd_emu10k1_memblk *q;
  155. /* calculate the expected size of empty region */
  156. if ((p = blk->mapped_link.prev) != &emu->mapped_link_head) {
  157. q = get_emu10k1_memblk(p, mapped_link);
  158. start_page = q->mapped_page + q->pages;
  159. } else
  160. start_page = 0;
  161. if ((p = blk->mapped_link.next) != &emu->mapped_link_head) {
  162. q = get_emu10k1_memblk(p, mapped_link);
  163. end_page = q->mapped_page;
  164. } else
  165. end_page = MAX_ALIGN_PAGES;
  166. /* remove links */
  167. list_del(&blk->mapped_link);
  168. list_del(&blk->mapped_order_link);
  169. /* clear PTB */
  170. mpage = blk->mapped_page;
  171. for (pg = blk->first_page; pg <= blk->last_page; pg++) {
  172. set_silent_ptb(emu, mpage);
  173. mpage++;
  174. }
  175. blk->mapped_page = -1;
  176. return end_page - start_page; /* return the new empty size */
  177. }
  178. /*
  179. * search empty pages with the given size, and create a memory block
  180. *
  181. * unlike synth_alloc the memory block is aligned to the page start
  182. */
  183. static struct snd_emu10k1_memblk *
  184. search_empty(struct snd_emu10k1 *emu, int size)
  185. {
  186. struct list_head *p;
  187. struct snd_emu10k1_memblk *blk;
  188. int page, psize;
  189. psize = get_aligned_page(size + PAGE_SIZE -1);
  190. page = 0;
  191. list_for_each(p, &emu->memhdr->block) {
  192. blk = get_emu10k1_memblk(p, mem.list);
  193. if (page + psize <= blk->first_page)
  194. goto __found_pages;
  195. page = blk->last_page + 1;
  196. }
  197. if (page + psize > emu->max_cache_pages)
  198. return NULL;
  199. __found_pages:
  200. /* create a new memory block */
  201. blk = (struct snd_emu10k1_memblk *)__snd_util_memblk_new(emu->memhdr, psize << PAGE_SHIFT, p->prev);
  202. if (blk == NULL)
  203. return NULL;
  204. blk->mem.offset = aligned_page_offset(page); /* set aligned offset */
  205. emu10k1_memblk_init(blk);
  206. return blk;
  207. }
  208. /*
  209. * check if the given pointer is valid for pages
  210. */
  211. static int is_valid_page(struct snd_emu10k1 *emu, dma_addr_t addr)
  212. {
  213. if (addr & ~emu->dma_mask) {
  214. snd_printk(KERN_ERR "max memory size is 0x%lx (addr = 0x%lx)!!\n", emu->dma_mask, (unsigned long)addr);
  215. return 0;
  216. }
  217. if (addr & (EMUPAGESIZE-1)) {
  218. snd_printk(KERN_ERR "page is not aligned\n");
  219. return 0;
  220. }
  221. return 1;
  222. }
  223. /*
  224. * map the given memory block on PTB.
  225. * if the block is already mapped, update the link order.
  226. * if no empty pages are found, tries to release unsed memory blocks
  227. * and retry the mapping.
  228. */
  229. int snd_emu10k1_memblk_map(struct snd_emu10k1 *emu, struct snd_emu10k1_memblk *blk)
  230. {
  231. int err;
  232. int size;
  233. struct list_head *p, *nextp;
  234. struct snd_emu10k1_memblk *deleted;
  235. unsigned long flags;
  236. spin_lock_irqsave(&emu->memblk_lock, flags);
  237. if (blk->mapped_page >= 0) {
  238. /* update order link */
  239. list_del(&blk->mapped_order_link);
  240. list_add_tail(&blk->mapped_order_link, &emu->mapped_order_link_head);
  241. spin_unlock_irqrestore(&emu->memblk_lock, flags);
  242. return 0;
  243. }
  244. if ((err = map_memblk(emu, blk)) < 0) {
  245. /* no enough page - try to unmap some blocks */
  246. /* starting from the oldest block */
  247. p = emu->mapped_order_link_head.next;
  248. for (; p != &emu->mapped_order_link_head; p = nextp) {
  249. nextp = p->next;
  250. deleted = get_emu10k1_memblk(p, mapped_order_link);
  251. if (deleted->map_locked)
  252. continue;
  253. size = unmap_memblk(emu, deleted);
  254. if (size >= blk->pages) {
  255. /* ok the empty region is enough large */
  256. err = map_memblk(emu, blk);
  257. break;
  258. }
  259. }
  260. }
  261. spin_unlock_irqrestore(&emu->memblk_lock, flags);
  262. return err;
  263. }
  264. /*
  265. * page allocation for DMA
  266. */
  267. struct snd_util_memblk *
  268. snd_emu10k1_alloc_pages(struct snd_emu10k1 *emu, struct snd_pcm_substream *substream)
  269. {
  270. struct snd_pcm_runtime *runtime = substream->runtime;
  271. struct snd_sg_buf *sgbuf = snd_pcm_substream_sgbuf(substream);
  272. struct snd_util_memhdr *hdr;
  273. struct snd_emu10k1_memblk *blk;
  274. int page, err, idx;
  275. snd_assert(emu, return NULL);
  276. snd_assert(runtime->dma_bytes > 0 && runtime->dma_bytes < MAXPAGES * EMUPAGESIZE, return NULL);
  277. hdr = emu->memhdr;
  278. snd_assert(hdr, return NULL);
  279. mutex_lock(&hdr->block_mutex);
  280. blk = search_empty(emu, runtime->dma_bytes);
  281. if (blk == NULL) {
  282. mutex_unlock(&hdr->block_mutex);
  283. return NULL;
  284. }
  285. /* fill buffer addresses but pointers are not stored so that
  286. * snd_free_pci_page() is not called in in synth_free()
  287. */
  288. idx = 0;
  289. for (page = blk->first_page; page <= blk->last_page; page++, idx++) {
  290. dma_addr_t addr;
  291. #ifdef CONFIG_SND_DEBUG
  292. if (idx >= sgbuf->pages) {
  293. printk(KERN_ERR "emu: pages overflow! (%d-%d) for %d\n",
  294. blk->first_page, blk->last_page, sgbuf->pages);
  295. mutex_unlock(&hdr->block_mutex);
  296. return NULL;
  297. }
  298. #endif
  299. addr = sgbuf->table[idx].addr;
  300. if (! is_valid_page(emu, addr)) {
  301. printk(KERN_ERR "emu: failure page = %d\n", idx);
  302. mutex_unlock(&hdr->block_mutex);
  303. return NULL;
  304. }
  305. emu->page_addr_table[page] = addr;
  306. emu->page_ptr_table[page] = NULL;
  307. }
  308. /* set PTB entries */
  309. blk->map_locked = 1; /* do not unmap this block! */
  310. err = snd_emu10k1_memblk_map(emu, blk);
  311. if (err < 0) {
  312. __snd_util_mem_free(hdr, (struct snd_util_memblk *)blk);
  313. mutex_unlock(&hdr->block_mutex);
  314. return NULL;
  315. }
  316. mutex_unlock(&hdr->block_mutex);
  317. return (struct snd_util_memblk *)blk;
  318. }
  319. /*
  320. * release DMA buffer from page table
  321. */
  322. int snd_emu10k1_free_pages(struct snd_emu10k1 *emu, struct snd_util_memblk *blk)
  323. {
  324. snd_assert(emu && blk, return -EINVAL);
  325. return snd_emu10k1_synth_free(emu, blk);
  326. }
  327. /*
  328. * memory allocation using multiple pages (for synth)
  329. * Unlike the DMA allocation above, non-contiguous pages are assined.
  330. */
  331. /*
  332. * allocate a synth sample area
  333. */
  334. struct snd_util_memblk *
  335. snd_emu10k1_synth_alloc(struct snd_emu10k1 *hw, unsigned int size)
  336. {
  337. struct snd_emu10k1_memblk *blk;
  338. struct snd_util_memhdr *hdr = hw->memhdr;
  339. mutex_lock(&hdr->block_mutex);
  340. blk = (struct snd_emu10k1_memblk *)__snd_util_mem_alloc(hdr, size);
  341. if (blk == NULL) {
  342. mutex_unlock(&hdr->block_mutex);
  343. return NULL;
  344. }
  345. if (synth_alloc_pages(hw, blk)) {
  346. __snd_util_mem_free(hdr, (struct snd_util_memblk *)blk);
  347. mutex_unlock(&hdr->block_mutex);
  348. return NULL;
  349. }
  350. snd_emu10k1_memblk_map(hw, blk);
  351. mutex_unlock(&hdr->block_mutex);
  352. return (struct snd_util_memblk *)blk;
  353. }
  354. /*
  355. * free a synth sample area
  356. */
  357. int
  358. snd_emu10k1_synth_free(struct snd_emu10k1 *emu, struct snd_util_memblk *memblk)
  359. {
  360. struct snd_util_memhdr *hdr = emu->memhdr;
  361. struct snd_emu10k1_memblk *blk = (struct snd_emu10k1_memblk *)memblk;
  362. unsigned long flags;
  363. mutex_lock(&hdr->block_mutex);
  364. spin_lock_irqsave(&emu->memblk_lock, flags);
  365. if (blk->mapped_page >= 0)
  366. unmap_memblk(emu, blk);
  367. spin_unlock_irqrestore(&emu->memblk_lock, flags);
  368. synth_free_pages(emu, blk);
  369. __snd_util_mem_free(hdr, memblk);
  370. mutex_unlock(&hdr->block_mutex);
  371. return 0;
  372. }
  373. /* check new allocation range */
  374. static void get_single_page_range(struct snd_util_memhdr *hdr,
  375. struct snd_emu10k1_memblk *blk,
  376. int *first_page_ret, int *last_page_ret)
  377. {
  378. struct list_head *p;
  379. struct snd_emu10k1_memblk *q;
  380. int first_page, last_page;
  381. first_page = blk->first_page;
  382. if ((p = blk->mem.list.prev) != &hdr->block) {
  383. q = get_emu10k1_memblk(p, mem.list);
  384. if (q->last_page == first_page)
  385. first_page++; /* first page was already allocated */
  386. }
  387. last_page = blk->last_page;
  388. if ((p = blk->mem.list.next) != &hdr->block) {
  389. q = get_emu10k1_memblk(p, mem.list);
  390. if (q->first_page == last_page)
  391. last_page--; /* last page was already allocated */
  392. }
  393. *first_page_ret = first_page;
  394. *last_page_ret = last_page;
  395. }
  396. /*
  397. * allocate kernel pages
  398. */
  399. static int synth_alloc_pages(struct snd_emu10k1 *emu, struct snd_emu10k1_memblk *blk)
  400. {
  401. int page, first_page, last_page;
  402. struct snd_dma_buffer dmab;
  403. emu10k1_memblk_init(blk);
  404. get_single_page_range(emu->memhdr, blk, &first_page, &last_page);
  405. /* allocate kernel pages */
  406. for (page = first_page; page <= last_page; page++) {
  407. if (snd_dma_alloc_pages(SNDRV_DMA_TYPE_DEV, snd_dma_pci_data(emu->pci),
  408. PAGE_SIZE, &dmab) < 0)
  409. goto __fail;
  410. if (! is_valid_page(emu, dmab.addr)) {
  411. snd_dma_free_pages(&dmab);
  412. goto __fail;
  413. }
  414. emu->page_addr_table[page] = dmab.addr;
  415. emu->page_ptr_table[page] = dmab.area;
  416. }
  417. return 0;
  418. __fail:
  419. /* release allocated pages */
  420. last_page = page - 1;
  421. for (page = first_page; page <= last_page; page++) {
  422. dmab.area = emu->page_ptr_table[page];
  423. dmab.addr = emu->page_addr_table[page];
  424. dmab.bytes = PAGE_SIZE;
  425. snd_dma_free_pages(&dmab);
  426. emu->page_addr_table[page] = 0;
  427. emu->page_ptr_table[page] = NULL;
  428. }
  429. return -ENOMEM;
  430. }
  431. /*
  432. * free pages
  433. */
  434. static int synth_free_pages(struct snd_emu10k1 *emu, struct snd_emu10k1_memblk *blk)
  435. {
  436. int page, first_page, last_page;
  437. struct snd_dma_buffer dmab;
  438. get_single_page_range(emu->memhdr, blk, &first_page, &last_page);
  439. dmab.dev.type = SNDRV_DMA_TYPE_DEV;
  440. dmab.dev.dev = snd_dma_pci_data(emu->pci);
  441. for (page = first_page; page <= last_page; page++) {
  442. if (emu->page_ptr_table[page] == NULL)
  443. continue;
  444. dmab.area = emu->page_ptr_table[page];
  445. dmab.addr = emu->page_addr_table[page];
  446. dmab.bytes = PAGE_SIZE;
  447. snd_dma_free_pages(&dmab);
  448. emu->page_addr_table[page] = 0;
  449. emu->page_ptr_table[page] = NULL;
  450. }
  451. return 0;
  452. }
  453. /* calculate buffer pointer from offset address */
  454. static inline void *offset_ptr(struct snd_emu10k1 *emu, int page, int offset)
  455. {
  456. char *ptr;
  457. snd_assert(page >= 0 && page < emu->max_cache_pages, return NULL);
  458. ptr = emu->page_ptr_table[page];
  459. if (! ptr) {
  460. printk(KERN_ERR "emu10k1: access to NULL ptr: page = %d\n", page);
  461. return NULL;
  462. }
  463. ptr += offset & (PAGE_SIZE - 1);
  464. return (void*)ptr;
  465. }
  466. /*
  467. * bzero(blk + offset, size)
  468. */
  469. int snd_emu10k1_synth_bzero(struct snd_emu10k1 *emu, struct snd_util_memblk *blk,
  470. int offset, int size)
  471. {
  472. int page, nextofs, end_offset, temp, temp1;
  473. void *ptr;
  474. struct snd_emu10k1_memblk *p = (struct snd_emu10k1_memblk *)blk;
  475. offset += blk->offset & (PAGE_SIZE - 1);
  476. end_offset = offset + size;
  477. page = get_aligned_page(offset);
  478. do {
  479. nextofs = aligned_page_offset(page + 1);
  480. temp = nextofs - offset;
  481. temp1 = end_offset - offset;
  482. if (temp1 < temp)
  483. temp = temp1;
  484. ptr = offset_ptr(emu, page + p->first_page, offset);
  485. if (ptr)
  486. memset(ptr, 0, temp);
  487. offset = nextofs;
  488. page++;
  489. } while (offset < end_offset);
  490. return 0;
  491. }
  492. /*
  493. * copy_from_user(blk + offset, data, size)
  494. */
  495. int snd_emu10k1_synth_copy_from_user(struct snd_emu10k1 *emu, struct snd_util_memblk *blk,
  496. int offset, const char __user *data, int size)
  497. {
  498. int page, nextofs, end_offset, temp, temp1;
  499. void *ptr;
  500. struct snd_emu10k1_memblk *p = (struct snd_emu10k1_memblk *)blk;
  501. offset += blk->offset & (PAGE_SIZE - 1);
  502. end_offset = offset + size;
  503. page = get_aligned_page(offset);
  504. do {
  505. nextofs = aligned_page_offset(page + 1);
  506. temp = nextofs - offset;
  507. temp1 = end_offset - offset;
  508. if (temp1 < temp)
  509. temp = temp1;
  510. ptr = offset_ptr(emu, page + p->first_page, offset);
  511. if (ptr && copy_from_user(ptr, data, temp))
  512. return -EFAULT;
  513. offset = nextofs;
  514. data += temp;
  515. page++;
  516. } while (offset < end_offset);
  517. return 0;
  518. }