gus_mem.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /*
  3. * Copyright (c) by Jaroslav Kysela <perex@perex.cz>
  4. * GUS's memory allocation routines / bottom layer
  5. */
  6. #include <linux/slab.h>
  7. #include <linux/string.h>
  8. #include <sound/core.h>
  9. #include <sound/gus.h>
  10. #include <sound/info.h>
  11. #ifdef CONFIG_SND_DEBUG
  12. static void snd_gf1_mem_info_read(struct snd_info_entry *entry,
  13. struct snd_info_buffer *buffer);
  14. #endif
  15. static struct snd_gf1_mem_block *
  16. snd_gf1_mem_xalloc(struct snd_gf1_mem *alloc, struct snd_gf1_mem_block *block,
  17. const char *name)
  18. {
  19. struct snd_gf1_mem_block *pblock, *nblock;
  20. nblock = kmalloc_obj(struct snd_gf1_mem_block);
  21. if (nblock == NULL)
  22. return NULL;
  23. *nblock = *block;
  24. nblock->name = kstrdup(name, GFP_KERNEL);
  25. if (!nblock->name) {
  26. kfree(nblock);
  27. return NULL;
  28. }
  29. pblock = alloc->first;
  30. while (pblock) {
  31. if (pblock->ptr > nblock->ptr) {
  32. nblock->prev = pblock->prev;
  33. nblock->next = pblock;
  34. pblock->prev = nblock;
  35. if (pblock == alloc->first)
  36. alloc->first = nblock;
  37. else
  38. nblock->prev->next = nblock;
  39. return nblock;
  40. }
  41. pblock = pblock->next;
  42. }
  43. nblock->next = NULL;
  44. if (alloc->last == NULL) {
  45. nblock->prev = NULL;
  46. alloc->first = alloc->last = nblock;
  47. } else {
  48. nblock->prev = alloc->last;
  49. alloc->last->next = nblock;
  50. alloc->last = nblock;
  51. }
  52. return nblock;
  53. }
  54. int snd_gf1_mem_xfree(struct snd_gf1_mem * alloc, struct snd_gf1_mem_block * block)
  55. {
  56. if (block->share) { /* ok.. shared block */
  57. block->share--;
  58. return 0;
  59. }
  60. if (alloc->first == block) {
  61. alloc->first = block->next;
  62. if (block->next)
  63. block->next->prev = NULL;
  64. } else {
  65. block->prev->next = block->next;
  66. if (block->next)
  67. block->next->prev = block->prev;
  68. }
  69. if (alloc->last == block) {
  70. alloc->last = block->prev;
  71. if (block->prev)
  72. block->prev->next = NULL;
  73. } else {
  74. block->next->prev = block->prev;
  75. if (block->prev)
  76. block->prev->next = block->next;
  77. }
  78. kfree(block->name);
  79. kfree(block);
  80. return 0;
  81. }
  82. static struct snd_gf1_mem_block *snd_gf1_mem_look(struct snd_gf1_mem * alloc,
  83. unsigned int address)
  84. {
  85. struct snd_gf1_mem_block *block;
  86. for (block = alloc->first; block; block = block->next) {
  87. if (block->ptr == address) {
  88. return block;
  89. }
  90. }
  91. return NULL;
  92. }
  93. static struct snd_gf1_mem_block *snd_gf1_mem_share(struct snd_gf1_mem * alloc,
  94. unsigned int *share_id)
  95. {
  96. struct snd_gf1_mem_block *block;
  97. if (!share_id[0] && !share_id[1] &&
  98. !share_id[2] && !share_id[3])
  99. return NULL;
  100. for (block = alloc->first; block; block = block->next)
  101. if (!memcmp(share_id, block->share_id,
  102. sizeof(block->share_id)))
  103. return block;
  104. return NULL;
  105. }
  106. static int snd_gf1_mem_find(struct snd_gf1_mem * alloc,
  107. struct snd_gf1_mem_block * block,
  108. unsigned int size, int w_16, int align)
  109. {
  110. struct snd_gf1_bank_info *info = w_16 ? alloc->banks_16 : alloc->banks_8;
  111. unsigned int idx, boundary;
  112. int size1;
  113. struct snd_gf1_mem_block *pblock;
  114. unsigned int ptr1, ptr2;
  115. if (w_16 && align < 2)
  116. align = 2;
  117. block->flags = w_16 ? SNDRV_GF1_MEM_BLOCK_16BIT : 0;
  118. block->owner = SNDRV_GF1_MEM_OWNER_DRIVER;
  119. block->share = 0;
  120. block->share_id[0] = block->share_id[1] =
  121. block->share_id[2] = block->share_id[3] = 0;
  122. block->name = NULL;
  123. block->prev = block->next = NULL;
  124. for (pblock = alloc->first, idx = 0; pblock; pblock = pblock->next) {
  125. while (pblock->ptr >= (boundary = info[idx].address + info[idx].size))
  126. idx++;
  127. while (pblock->ptr + pblock->size >= (boundary = info[idx].address + info[idx].size))
  128. idx++;
  129. ptr2 = boundary;
  130. if (pblock->next) {
  131. if (pblock->ptr + pblock->size == pblock->next->ptr)
  132. continue;
  133. if (pblock->next->ptr < boundary)
  134. ptr2 = pblock->next->ptr;
  135. }
  136. ptr1 = ALIGN(pblock->ptr + pblock->size, align);
  137. if (ptr1 >= ptr2)
  138. continue;
  139. size1 = ptr2 - ptr1;
  140. if ((int)size <= size1) {
  141. block->ptr = ptr1;
  142. block->size = size;
  143. return 0;
  144. }
  145. }
  146. while (++idx < 4) {
  147. if (size <= info[idx].size) {
  148. /* I assume that bank address is already aligned.. */
  149. block->ptr = info[idx].address;
  150. block->size = size;
  151. return 0;
  152. }
  153. }
  154. return -ENOMEM;
  155. }
  156. struct snd_gf1_mem_block *snd_gf1_mem_alloc(struct snd_gf1_mem * alloc, int owner,
  157. char *name, int size, int w_16, int align,
  158. unsigned int *share_id)
  159. {
  160. struct snd_gf1_mem_block block, *nblock;
  161. guard(mutex)(&alloc->memory_mutex);
  162. if (share_id != NULL) {
  163. nblock = snd_gf1_mem_share(alloc, share_id);
  164. if (nblock != NULL) {
  165. if (size != (int)nblock->size) {
  166. /* TODO: remove in the future */
  167. pr_err("%s - share: sizes differ\n", __func__);
  168. goto __std;
  169. }
  170. nblock->share++;
  171. return NULL;
  172. }
  173. }
  174. __std:
  175. if (snd_gf1_mem_find(alloc, &block, size, w_16, align) < 0)
  176. return NULL;
  177. if (share_id != NULL)
  178. memcpy(&block.share_id, share_id, sizeof(block.share_id));
  179. block.owner = owner;
  180. nblock = snd_gf1_mem_xalloc(alloc, &block, name);
  181. return nblock;
  182. }
  183. int snd_gf1_mem_free(struct snd_gf1_mem * alloc, unsigned int address)
  184. {
  185. struct snd_gf1_mem_block *block;
  186. guard(mutex)(&alloc->memory_mutex);
  187. block = snd_gf1_mem_look(alloc, address);
  188. if (block)
  189. return snd_gf1_mem_xfree(alloc, block);
  190. return -EINVAL;
  191. }
  192. int snd_gf1_mem_init(struct snd_gus_card * gus)
  193. {
  194. struct snd_gf1_mem *alloc;
  195. struct snd_gf1_mem_block block;
  196. alloc = &gus->gf1.mem_alloc;
  197. mutex_init(&alloc->memory_mutex);
  198. alloc->first = alloc->last = NULL;
  199. if (!gus->gf1.memory)
  200. return 0;
  201. memset(&block, 0, sizeof(block));
  202. block.owner = SNDRV_GF1_MEM_OWNER_DRIVER;
  203. if (gus->gf1.enh_mode) {
  204. block.ptr = 0;
  205. block.size = 1024;
  206. if (!snd_gf1_mem_xalloc(alloc, &block, "InterWave LFOs"))
  207. return -ENOMEM;
  208. }
  209. block.ptr = gus->gf1.default_voice_address;
  210. block.size = 4;
  211. if (!snd_gf1_mem_xalloc(alloc, &block, "Voice default (NULL's)"))
  212. return -ENOMEM;
  213. #ifdef CONFIG_SND_DEBUG
  214. snd_card_ro_proc_new(gus->card, "gusmem", gus, snd_gf1_mem_info_read);
  215. #endif
  216. return 0;
  217. }
  218. int snd_gf1_mem_done(struct snd_gus_card * gus)
  219. {
  220. struct snd_gf1_mem *alloc;
  221. struct snd_gf1_mem_block *block, *nblock;
  222. alloc = &gus->gf1.mem_alloc;
  223. block = alloc->first;
  224. while (block) {
  225. nblock = block->next;
  226. snd_gf1_mem_xfree(alloc, block);
  227. block = nblock;
  228. }
  229. return 0;
  230. }
  231. #ifdef CONFIG_SND_DEBUG
  232. static void snd_gf1_mem_info_read(struct snd_info_entry *entry,
  233. struct snd_info_buffer *buffer)
  234. {
  235. struct snd_gus_card *gus;
  236. struct snd_gf1_mem *alloc;
  237. struct snd_gf1_mem_block *block;
  238. unsigned int total, used;
  239. int i;
  240. gus = entry->private_data;
  241. alloc = &gus->gf1.mem_alloc;
  242. guard(mutex)(&alloc->memory_mutex);
  243. snd_iprintf(buffer, "8-bit banks : \n ");
  244. for (i = 0; i < 4; i++)
  245. snd_iprintf(buffer, "0x%06x (%04ik)%s", alloc->banks_8[i].address, alloc->banks_8[i].size >> 10, i + 1 < 4 ? "," : "");
  246. snd_iprintf(buffer, "\n"
  247. "16-bit banks : \n ");
  248. for (i = total = 0; i < 4; i++) {
  249. snd_iprintf(buffer, "0x%06x (%04ik)%s", alloc->banks_16[i].address, alloc->banks_16[i].size >> 10, i + 1 < 4 ? "," : "");
  250. total += alloc->banks_16[i].size;
  251. }
  252. snd_iprintf(buffer, "\n");
  253. used = 0;
  254. for (block = alloc->first, i = 0; block; block = block->next, i++) {
  255. used += block->size;
  256. snd_iprintf(buffer, "Block %i onboard 0x%x size %i (0x%x):\n", i, block->ptr, block->size, block->size);
  257. if (block->share ||
  258. block->share_id[0] || block->share_id[1] ||
  259. block->share_id[2] || block->share_id[3])
  260. snd_iprintf(buffer, " Share : %i [id0 0x%x] [id1 0x%x] [id2 0x%x] [id3 0x%x]\n",
  261. block->share,
  262. block->share_id[0], block->share_id[1],
  263. block->share_id[2], block->share_id[3]);
  264. snd_iprintf(buffer, " Flags :%s\n",
  265. block->flags & SNDRV_GF1_MEM_BLOCK_16BIT ? " 16-bit" : "");
  266. snd_iprintf(buffer, " Owner : ");
  267. switch (block->owner) {
  268. case SNDRV_GF1_MEM_OWNER_DRIVER:
  269. snd_iprintf(buffer, "driver - %s\n", block->name);
  270. break;
  271. case SNDRV_GF1_MEM_OWNER_WAVE_SIMPLE:
  272. snd_iprintf(buffer, "SIMPLE wave\n");
  273. break;
  274. case SNDRV_GF1_MEM_OWNER_WAVE_GF1:
  275. snd_iprintf(buffer, "GF1 wave\n");
  276. break;
  277. case SNDRV_GF1_MEM_OWNER_WAVE_IWFFFF:
  278. snd_iprintf(buffer, "IWFFFF wave\n");
  279. break;
  280. default:
  281. snd_iprintf(buffer, "unknown\n");
  282. }
  283. }
  284. snd_iprintf(buffer, " Total: memory = %i, used = %i, free = %i\n",
  285. total, used, total - used);
  286. #if 0
  287. ultra_iprintf(buffer, " Verify: free = %i, max 8-bit block = %i, max 16-bit block = %i\n",
  288. ultra_memory_free_size(card, &card->gf1.mem_alloc),
  289. ultra_memory_free_block(card, &card->gf1.mem_alloc, 0),
  290. ultra_memory_free_block(card, &card->gf1.mem_alloc, 1));
  291. #endif
  292. }
  293. #endif