cp_pattern.cpp 12 KB

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