cp_pattern.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525
  1. /*************************************************************************/
  2. /* cp_pattern.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2020 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2020 Godot Engine contributors (cf. AUTHORS.md). */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /*************************************************************************/
  30. #include "cp_pattern.h"
  31. void CPPattern::clear() {
  32. if (event_count > 0) {
  33. CP_FREE(events);
  34. events = NULL;
  35. event_count = 0;
  36. }
  37. length = DEFAULT_LEN;
  38. }
  39. bool CPPattern::resize_event_list_to(uint32_t p_events) {
  40. //Module is slow in some cpus, so this should be fast enough
  41. uint32_t new_size = ((p_events - 1) & (~((1 << RESIZE_EVERY_BITS) - 1))) + (1 << RESIZE_EVERY_BITS);
  42. CP_ERR_COND_V(new_size < p_events, true); //bugARM_INFO
  43. if (event_count == 0 && new_size == 0)
  44. return false; //nothing to do
  45. if (event_count == 0) {
  46. events = (Event *)CP_ALLOC(new_size * sizeof(Event));
  47. } else if (new_size == 0) {
  48. CP_FREE(events);
  49. events = NULL;
  50. } else {
  51. CP_ERR_COND_V(events == NULL, true);
  52. events = (Event *)CP_REALLOC(events, new_size * sizeof(Event));
  53. }
  54. event_count = p_events;
  55. return false;
  56. }
  57. int32_t CPPattern::get_event_pos(uint16_t p_target_pos) {
  58. if (event_count == 0)
  59. return -1;
  60. int low = 0;
  61. int high = event_count - 1;
  62. int middle;
  63. while (low <= high) {
  64. middle = (low + high) / 2;
  65. if (p_target_pos == events[middle].pos) { //match
  66. break;
  67. } else if (p_target_pos < events[middle].pos)
  68. high = middle - 1; //search low end of array
  69. else
  70. low = middle + 1; //search high end of array
  71. }
  72. /* adapt so we are behind 2 */
  73. if (events[middle].pos < p_target_pos)
  74. middle++;
  75. return middle;
  76. /* Linear search for now */
  77. /*
  78. int32_t pos_idx=0;
  79. for (;pos_idx<event_count;pos_idx++) {
  80. if (event_list[pos_idx].pos>=p_target_pos)
  81. break;
  82. } */
  83. //return pos_idx;
  84. }
  85. bool CPPattern::erase_event_at_pos(uint16_t p_pos) {
  86. if (event_count == 0)
  87. return false;
  88. Event *event_list = events;
  89. int32_t pos_idx = get_event_pos(p_pos);
  90. if (pos_idx == -1) {
  91. CP_ERR_COND_V(pos_idx == -1, true);
  92. }
  93. if (pos_idx == event_count || event_list[pos_idx].pos != p_pos) {
  94. /* Nothing to Erase */
  95. return false;
  96. }
  97. for (int32_t i = pos_idx; i < (event_count - 1); i++) {
  98. event_list[i] = event_list[i + 1];
  99. }
  100. resize_event_list_to(event_count - 1);
  101. return false;
  102. }
  103. bool CPPattern::set_note(uint8_t p_column, uint16_t p_row, const CPNote &p_note) {
  104. CP_ERR_COND_V(p_column >= WIDTH, true);
  105. CP_ERR_COND_V(p_row >= length, true);
  106. int32_t new_pos;
  107. uint16_t target_pos = p_row * WIDTH + p_column;
  108. if (p_note.is_empty()) {
  109. bool res = erase_event_at_pos(target_pos);
  110. return res;
  111. ;
  112. }
  113. Event *event_list = 0;
  114. if (event_count == 0) {
  115. /* If no events, create the first */
  116. if (resize_event_list_to(1)) {
  117. CP_PRINTERR("Can't resize event list to 1");
  118. return true;
  119. }
  120. event_list = events;
  121. if (event_list == 0) {
  122. CP_PRINTERR("Can't get event list");
  123. return true;
  124. }
  125. new_pos = 0;
  126. } else {
  127. /* Prepare to add */
  128. event_list = events;
  129. if (event_list == 0) {
  130. CP_PRINTERR("Can't get event list");
  131. return true;
  132. }
  133. int32_t pos_idx = get_event_pos(target_pos);
  134. if (pos_idx == -1) {
  135. CP_PRINTERR("Can't find add position");
  136. return true;
  137. }
  138. if (pos_idx == event_count || event_list[pos_idx].pos != target_pos) {
  139. /* If the note being modified didnt exist, then we add it */
  140. //resize, and return if out of mem
  141. if (resize_event_list_to(event_count + 1)) {
  142. CP_PRINTERR("Can't resize event list");
  143. return true;
  144. }
  145. event_list = events;
  146. if (event_list == 0) {
  147. CP_PRINTERR("Can't get event list");
  148. return true;
  149. }
  150. //make room for new pos, this wont do a thing if pos_idx was ==event_count
  151. for (int32_t i = (event_count - 1); i > pos_idx; i--) {
  152. event_list[i] = event_list[i - 1];
  153. }
  154. } /* Else it means that position is taken, so we just modify it! */
  155. new_pos = pos_idx;
  156. }
  157. event_list[new_pos].pos = target_pos;
  158. event_list[new_pos].note = p_note.note;
  159. event_list[new_pos].instrument = p_note.instrument;
  160. event_list[new_pos].volume = p_note.volume;
  161. event_list[new_pos].command = p_note.command;
  162. event_list[new_pos].parameter = p_note.parameter;
  163. event_list[new_pos].script_source_sign = p_note.script_source_sign;
  164. event_list[new_pos].cloned = p_note.cloned;
  165. return false;
  166. }
  167. CPNote CPPattern::get_note(uint8_t p_column, uint16_t p_row) {
  168. if (p_column == CPNote::EMPTY) return CPNote();
  169. CP_ERR_COND_V(p_column >= WIDTH, CPNote());
  170. CP_ERR_COND_V(p_row >= length, CPNote());
  171. if (event_count == 0)
  172. return CPNote();
  173. Event *event_list = events;
  174. CP_ERR_COND_V(event_list == 0, CPNote());
  175. uint16_t target_pos = p_row * WIDTH + p_column;
  176. int32_t pos_idx = get_event_pos(target_pos);
  177. if (pos_idx == -1) {
  178. CP_PRINTERR("Can't find event pos");
  179. return CPNote();
  180. }
  181. if (pos_idx >= event_count || event_list[pos_idx].pos != target_pos) {
  182. /* no note found */
  183. return CPNote();
  184. }
  185. CPNote n;
  186. n.note = event_list[pos_idx].note;
  187. n.instrument = event_list[pos_idx].instrument;
  188. n.volume = event_list[pos_idx].volume;
  189. n.command = event_list[pos_idx].command;
  190. n.parameter = event_list[pos_idx].parameter;
  191. n.script_source_sign = event_list[pos_idx].script_source_sign;
  192. n.cloned = event_list[pos_idx].cloned;
  193. return n;
  194. }
  195. CPNote CPPattern::get_transformed_script_note(uint8_t p_column, uint16_t p_row) {
  196. CPNote n = get_note(p_column, p_row);
  197. // get source channel and note
  198. int channel = get_scripted_note_target_channel(p_column, p_row);
  199. CPNote src_n = get_note(channel, 0);
  200. if (src_n.note == CPNote::SCRIPT) return CPNote();
  201. script_transform_note(src_n, n);
  202. return src_n;
  203. }
  204. int CPPattern::get_scripted_note_target_channel(uint8_t p_column, uint16_t p_row) {
  205. CPNote n = get_note(p_column, p_row);
  206. if (n.note != CPNote::SCRIPT) return CPNote::EMPTY;
  207. int channel = n.instrument;
  208. if (n.script_source_sign == '\0') {
  209. if (channel < 0 || channel >= CPPattern::WIDTH) return CPNote::EMPTY;
  210. } else {
  211. channel = p_column + ((n.script_source_sign == '+') ? 1 : -1) * (channel + 1);
  212. if (channel < 0 || channel >= CPPattern::WIDTH) return CPNote::EMPTY;
  213. }
  214. return channel;
  215. }
  216. void CPPattern::scripted_clone(uint8_t p_column, uint16_t p_row) {
  217. int channel = get_scripted_note_target_channel(p_column, p_row);
  218. int src_row = 1;
  219. CPNote script_n = get_note(p_column, p_row);
  220. for (int row = p_row + 1; row < length; ++row) {
  221. CPNote src_n = get_note(channel, src_row);
  222. CPNote target_n = get_note(p_column, row);
  223. if (target_n.note != CPNote::SCRIPT) {
  224. if (src_n.note == CPNote::SCRIPT) {
  225. src_n = CPNote();
  226. channel = CPNote::EMPTY;
  227. }
  228. script_transform_note(src_n, script_n);
  229. src_n.cloned = true;
  230. set_note(p_column, row, src_n);
  231. } else {
  232. return;
  233. }
  234. src_row++;
  235. }
  236. }
  237. void CPPattern::scripted_clone_remove(uint8_t p_column, uint16_t p_row) {
  238. if (get_note(p_column, p_row).cloned)
  239. set_note(p_column, p_row, CPNote());
  240. for (int row = p_row + 1; row < length; ++row) {
  241. CPNote target_n = get_note(p_column, row);
  242. if (target_n.note != CPNote::SCRIPT) {
  243. set_note(p_column, row, CPNote());
  244. } else {
  245. return;
  246. }
  247. }
  248. }
  249. void CPPattern::script_transform_note(CPNote &n, const CPNote &p_note) {
  250. // set instrument
  251. if (n.note < CPNote::NOTES && p_note.volume != CPNote::EMPTY) {
  252. n.instrument = p_note.volume;
  253. }
  254. // transpose
  255. if (n.note < CPNote::NOTES && p_note.command != CPNote::EMPTY) {
  256. int transpose = (p_note.parameter & 0xF) + (p_note.parameter / 0x10) * 12;
  257. if (p_note.command == '^') {
  258. if (n.note >= CPNote::NOTES - transpose)
  259. n.note = CPNote::NOTES - 1;
  260. else
  261. n.note += transpose;
  262. } else if (p_note.command == 'v') {
  263. if (n.note <= transpose)
  264. n.note = 0;
  265. else
  266. n.note -= transpose;
  267. }
  268. }
  269. }
  270. bool CPPattern::update_scripted_clones_sourcing_channel(int channel) {
  271. bool updated = false;
  272. for (int x = 0; x < WIDTH; ++x) {
  273. for (int y = 0; y < length; ++y) {
  274. if (channel == get_scripted_note_target_channel(x, y)) {
  275. scripted_clone(x, y);
  276. updated = true;
  277. }
  278. }
  279. }
  280. return updated;
  281. }
  282. void CPPattern::set_length(uint16_t p_rows) {
  283. if (event_count == 0) {
  284. if (p_rows >= MIN_ROWS)
  285. length = p_rows;
  286. return;
  287. }
  288. if (p_rows < MIN_ROWS) {
  289. return;
  290. }
  291. if (p_rows < length) {
  292. Event *event_list = events;
  293. if (event_list == 0) {
  294. CP_PRINTERR("get_event_list() Failed");
  295. return;
  296. }
  297. uint16_t target_pos = p_rows * WIDTH;
  298. int32_t pos_idx = get_event_pos(target_pos);
  299. if (pos_idx == -1) {
  300. CP_ERR_COND(pos_idx == -1);
  301. }
  302. if (resize_event_list_to(pos_idx)) {
  303. CP_PRINTERR("resize_event_list_to(pos_idx) Failed");
  304. return;
  305. }
  306. }
  307. length = p_rows;
  308. }
  309. #if 0
  310. void CPPattern::copy_to(CPPattern *p_pattern) const {
  311. p_pattern->clear();
  312. p_pattern->length=length;
  313. if (!event_count)
  314. return;
  315. int bufsiz=MemPool_Wrapper::get_singleton()->get_mem_size( mem_handle );
  316. MemPool_Handle aux_mem_handle=MemPool_Wrapper::get_singleton()->alloc_mem( bufsiz );
  317. if (aux_mem_handle.is_null()) {
  318. CP_PRINTERR("own handle is null");
  319. return;
  320. }
  321. if (MemPool_Wrapper::get_singleton()->lock_mem(aux_mem_handle)) {
  322. CP_PRINTERR("Unable to lock aux new handle");
  323. return;
  324. }
  325. if (MemPool_Wrapper::get_singleton()->lock_mem(mem_handle)) {
  326. CP_PRINTERR("Unable to lock own handle");
  327. return;
  328. }
  329. uint8_t* srcuint8_tt8_t*)MemPool_Wrapper::get_singleton()->get_mem(mem_handle);
  330. uint8_t* dstuint8_tt8_t*)MemPool_Wrapper::get_singleton()->get_mem(aux_mem_handle);
  331. for (int i=0;i<bufsiz;i++)
  332. dst[i]=src[i];
  333. MemPool_Wrapper::get_singleton()->unlock_mem(mem_handle);
  334. MemPool_Wrapper::get_singleton()->unlock_mem(aux_mem_handle);
  335. p_pattern->mem_handle=aux_mem_handle;
  336. p_pattern->event_count=event_count;
  337. }
  338. #endif
  339. uint16_t CPPattern::get_length() {
  340. return length;
  341. }
  342. CPPattern::CPPattern() {
  343. length = DEFAULT_LEN;
  344. event_count = 0;
  345. clear();
  346. }
  347. bool CPPattern::is_empty() {
  348. return events == NULL;
  349. }
  350. CPPattern::~CPPattern() {
  351. clear();
  352. }