Assists music production by grouping standalone programs into sessions. Community version of "Non Session Manager".
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

864 lines
18KB

  1. /*******************************************************************************/
  2. /* Copyright (C) 2007-2008 Jonathan Moore Liles */
  3. /* */
  4. /* This program is free software; you can redistribute it and/or modify it */
  5. /* under the terms of the GNU General Public License as published by the */
  6. /* Free Software Foundation; either version 2 of the License, or (at your */
  7. /* option) any later version. */
  8. /* */
  9. /* This program is distributed in the hope that it will be useful, but WITHOUT */
  10. /* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or */
  11. /* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for */
  12. /* more details. */
  13. /* */
  14. /* You should have received a copy of the GNU General Public License along */
  15. /* with This program; see the file COPYING. If not,write to the Free Software */
  16. /* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
  17. /*******************************************************************************/
  18. /* This is a generic double-buffering, optimizing canvas interface to
  19. grids (patterns and phrases). It draws only what is necessary to keep
  20. the display up-to-date. Actual drawing functions are in draw.C */
  21. #include "canvas.H"
  22. #include "pattern.H"
  23. #include "gui/draw.H"
  24. #include "common.h"
  25. #include "non.H"
  26. cell_t **
  27. Canvas::_alloc_array ( void )
  28. {
  29. cell_t **a;
  30. int one = sizeof( typeof( a ) ) * m.vp->w;
  31. int two = sizeof( typeof( a[0] ) ) * (m.vp->h * m.vp->w);
  32. a = (cell_t **) malloc( one + two );
  33. m.size = one + two;
  34. cell_t *c = (cell_t *) (((unsigned char *)a) + one);
  35. for ( uint x = m.vp->w; x-- ; )
  36. {
  37. a[x] = c;
  38. c += m.vp->h;
  39. for ( uint y = m.vp->h; y-- ; )
  40. {
  41. a[ x ][ y ].flags = 0;
  42. a[ x ][ y ].state = -1;
  43. a[ x ][ y ].shape = SQUARE;
  44. a[ x ][ y ].color = 0;
  45. }
  46. }
  47. m.w = m.vp->w;
  48. m.h = m.vp->h;
  49. return a;
  50. }
  51. Canvas::Canvas ( )
  52. {
  53. m.height = m.width = m.div_w = m.div_h = m.playhead = m.margin_top = m.margin_left = m.playhead = m.w = m.h = m.p1 = m.p2 = 0;
  54. m.margin_top = ruler_height;
  55. m.ruler_drawn = false;
  56. m.mapping_drawn = false;
  57. m.grid_drawn = false;
  58. m.current = m.previous = NULL;
  59. m.row_compact = true;
  60. m.maxh = 128;
  61. m.vp = NULL;
  62. }
  63. void
  64. Canvas::handle_event_change ( void )
  65. {
  66. /* mark the song as dirty and pass the signal on */
  67. song.dirty = true;
  68. signal_draw();
  69. }
  70. /** change grid to /g/, returns TRUE if new grid size differs from old */
  71. void
  72. Canvas::grid ( Grid *g )
  73. {
  74. m.grid = g;
  75. if ( ! g )
  76. return;
  77. m.vp = &g->viewport;
  78. char *s = m.vp->dump();
  79. DEBUG( "viewport: %s", s );
  80. free( s );
  81. m.ruler_drawn = false;
  82. resize_grid();
  83. changed_mapping();
  84. m.shape = m.grid->draw_shape();
  85. /* connect signals */
  86. /* FIXME: what happens when we do this twice? */
  87. g->signal_events_change.connect( mem_fun( this, &Canvas::handle_event_change ) );
  88. g->signal_settings_change.connect( signal_settings_change.make_slot() );
  89. signal_draw();
  90. signal_settings_change();
  91. }
  92. /** keep row compaction tables up-to-date */
  93. void
  94. Canvas::_update_row_mapping ( void )
  95. {
  96. /* reset */
  97. for ( int i = 128; i-- ; )
  98. m.rtn[i] = m.ntr[i] = -1;
  99. DEBUG( "updating row mapping" );
  100. /* rebuild */
  101. int r = 0;
  102. for ( int n = 0; n < 128; ++n )
  103. {
  104. if ( m.grid->row_name( n ) )
  105. {
  106. m.rtn[r] = n;
  107. m.ntr[n] = r;
  108. ++r;
  109. }
  110. }
  111. if ( m.row_compact && r )
  112. m.maxh = r;
  113. else
  114. m.maxh = 128;
  115. m.vp->h = min( m.vp->h, m.maxh );
  116. }
  117. /** change grid mapping */
  118. void
  119. Canvas::changed_mapping ( void )
  120. {
  121. _update_row_mapping();
  122. m.mapping_drawn = false;
  123. m.vp->y = (m.maxh / 2) - (m.vp->h / 2);
  124. resize();
  125. int old_margin = m.margin_left;
  126. m.margin_left = 0;
  127. m.draw = false;
  128. m.grid->draw_row_names( this );
  129. if ( m.margin_left != old_margin )
  130. signal_resize();
  131. else
  132. signal_draw();
  133. }
  134. Grid *
  135. Canvas::grid ( void )
  136. {
  137. return m.grid;
  138. }
  139. /** recalculate node sizes based on physical dimensions */
  140. void
  141. Canvas::resize ( void )
  142. {
  143. if ( ! m.vp )
  144. return;
  145. m.div_w = (m.width - m.margin_left) / m.vp->w;
  146. m.div_h = (m.height - m.margin_top) / m.vp->h;
  147. m.border_w = min( m.div_w, m.div_h ) / 8;
  148. m.mapping_drawn = m.ruler_drawn = false;
  149. }
  150. /** reallocate buffers to match grid dimensions */
  151. void
  152. Canvas::resize_grid ( void )
  153. {
  154. // _update_row_mapping();
  155. resize();
  156. if ( m.vp )
  157. {
  158. if ( m.vp->w != m.w || m.vp->h != m.h ||
  159. m.div_w != m.old_div_w || m.div_h != m.old_div_h )
  160. {
  161. if ( m.grid_drawn )
  162. signal_resize();
  163. m.old_div_w = m.div_w;
  164. m.old_div_h = m.div_h;
  165. }
  166. else
  167. return;
  168. }
  169. DEBUG( "resizing grid %dx%d", m.vp->w, m.vp->h );
  170. if ( m.previous )
  171. {
  172. free( m.previous );
  173. free( m.current );
  174. }
  175. m.current = _alloc_array();
  176. m.previous = _alloc_array();
  177. m.grid_drawn = false;
  178. }
  179. /** inform the canvas with new phsyical dimensions */
  180. void
  181. Canvas::resize ( int x, int y, int w, int h )
  182. {
  183. m.origin_x = x;
  184. m.origin_y = y;
  185. m.width = w;
  186. m.height = h;
  187. resize();
  188. }
  189. /***********/
  190. /* Drawing */
  191. /***********/
  192. /** copy last buffer into current */
  193. void
  194. Canvas::copy ( void )
  195. {
  196. for ( uint y = m.vp->h; y-- ; )
  197. for ( uint x = m.vp->w; x-- ; )
  198. m.current[ x ][ y ] = m.previous[ x ][ y ];
  199. }
  200. /** reset last buffer */
  201. void
  202. Canvas::_reset ( void )
  203. {
  204. cell_t empty;
  205. for ( uint y = m.vp->h; y-- ; )
  206. for ( uint x = m.vp->w; x-- ; )
  207. m.current[ x ][ y ] = empty;
  208. }
  209. /** prepare current buffer for drawing (draw "background") */
  210. void
  211. Canvas::clear ( void )
  212. {
  213. uint rule = m.grid->ppqn();
  214. uint lx = m.grid->ts_to_x( m.grid->length() );
  215. for ( uint y = m.vp->h; y--; )
  216. for ( uint x = m.vp->w; x--; )
  217. {
  218. m.current[ x ][ y ].color = 0;
  219. m.current[ x ][ y ].shape = m.shape;
  220. m.current[ x ][ y ].state = EMPTY;
  221. m.current[ x ][ y ].flags = 0;
  222. }
  223. for ( int x = m.vp->w - rule; x >= 0; x -= rule )
  224. for ( uint y = m.vp->h; y-- ; )
  225. m.current[ x ][ y ].state = LINE;
  226. int sx = (int)(lx - m.vp->x) >= 0 ? lx - m.vp->x : 0;
  227. for ( int x = sx; x < m.vp->w; ++x )
  228. for ( int y = m.vp->h; y-- ; )
  229. m.current[ x ][ y ].state = PARTIAL;
  230. }
  231. /** is /x/ within the viewport? */
  232. bool
  233. Canvas::viewable_x ( int x )
  234. {
  235. return x >= m.vp->x && x < m.vp->x + m.vp->w;
  236. }
  237. /** flush delta of last and current buffers to screen, then flip them */
  238. void
  239. Canvas::flip ( void )
  240. {
  241. /* FIXME: should this not go in clear()? */
  242. if ( m.p1 != m.p2 )
  243. {
  244. if ( viewable_x( m.p1 ) ) draw_line( m.p1 - m.vp->x, F_P1 );
  245. if ( viewable_x( m.p2 ) ) draw_line( m.p2 - m.vp->x, F_P2 );
  246. }
  247. if ( viewable_x( m.playhead ) ) draw_line( m.playhead - m.vp->x, F_PLAYHEAD );
  248. for ( uint y = m.vp->h; y--; )
  249. for ( uint x = m.vp->w; x--; )
  250. {
  251. cell_t *c = &m.current[ x ][ y ];
  252. cell_t *p = &m.previous[ x ][ y ];
  253. if ( *c != *p )
  254. gui_draw_shape( m.origin_x + m.margin_left + x * m.div_w, m.origin_y + m.margin_top + y * m.div_h, m.div_w, m.div_h, m.border_w,
  255. c->shape, c->state, c->flags, c->color );
  256. }
  257. cell_t **tmp = m.previous;
  258. m.previous = m.current;
  259. m.current = tmp;
  260. }
  261. /** redraw the ruler at the top of the canvas */
  262. void
  263. Canvas::redraw_ruler ( void )
  264. {
  265. m.margin_top = gui_draw_ruler( m.origin_x + m.margin_left, m.origin_y, m.vp->w, m.div_w, m.grid->division(), m.vp->x,
  266. m.p1 - m.vp->x, m.p2 - m.vp->x );
  267. m.ruler_drawn = true;
  268. }
  269. /** callback called by Grid::draw_row_names() to draw an individual row name */
  270. void
  271. Canvas::draw_row_name ( int y, const char *name, int color )
  272. {
  273. bool draw = m.draw;
  274. bool clear = false;
  275. y = ntr( y );
  276. if ( ! m.row_compact && ! name )
  277. clear = true;
  278. y -= m.vp->y;
  279. int bx = m.origin_x;
  280. int by = m.origin_y + m.margin_top + y * m.div_h;
  281. int bw = min( m.margin_left, m.width / 8 );
  282. int bh = m.div_h;
  283. if ( y < 0 || y >= m.vp->h )
  284. draw = false;
  285. if ( clear && draw )
  286. gui_clear_area( bx, by, bw, bh );
  287. else
  288. m.margin_left = max( m.margin_left, gui_draw_string( bx, by,
  289. bw, bh,
  290. color,
  291. name,
  292. draw ) );
  293. }
  294. /** redraw row names */
  295. void
  296. Canvas::redraw_mapping ( void )
  297. {
  298. m.margin_left = 0;
  299. m.draw = false;
  300. m.grid->draw_row_names( this );
  301. resize();
  302. m.draw = true;
  303. m.grid->draw_row_names( this );
  304. m.mapping_drawn = true;
  305. }
  306. void
  307. Canvas::draw_mapping ( void )
  308. {
  309. if ( ! m.mapping_drawn ) redraw_mapping();
  310. }
  311. void
  312. Canvas::draw_ruler ( void )
  313. {
  314. if ( ! m.ruler_drawn ) redraw_ruler();
  315. }
  316. /** "draw" a shape in the backbuffer */
  317. void
  318. Canvas::draw_shape ( int x, int y, int shape, int state, int color, bool selected )
  319. {
  320. y = ntr( y );
  321. if ( y < 0 )
  322. return;
  323. // adjust for viewport.
  324. x -= m.vp->x;
  325. y -= m.vp->y;
  326. if ( x < 0 || y < 0 || x >= m.vp->w || y >= m.vp->h )
  327. return;
  328. m.current[ x ][ y ].shape = shape;
  329. m.current[ x ][ y ].color = color;
  330. m.current[ x ][ y ].state = (uint)m.vp->x + x > m.grid->ts_to_x( m.grid->length() ) ? PARTIAL : state;
  331. m.current[ x ][ y ].flags = selected ? F_SELECTED : 0;
  332. }
  333. /** callback used by Grid::draw() */
  334. void
  335. Canvas::draw_dash ( int x, int y, int l, int shape, int color, bool selected )
  336. {
  337. draw_shape( x, y, shape, FULL, color, selected );
  338. for ( int i = x + l - 1; i > x; i-- )
  339. {
  340. draw_shape( i, y, shape, CONTINUED, 0, selected );
  341. }
  342. }
  343. /** draw a vertical line with flags */
  344. void
  345. Canvas::draw_line ( int x, int flags )
  346. {
  347. for ( uint y = m.vp->h; y-- ; )
  348. m.current[ x ][ y ].flags |= flags;
  349. }
  350. /** draw only the playhead--without reexamining the grid */
  351. int
  352. Canvas::draw_playhead ( void )
  353. {
  354. int x = m.grid->ts_to_x( m.grid->index() );
  355. if ( m.playhead == x )
  356. return 0;
  357. m.playhead = x;
  358. if ( m.playhead < m.vp->x || m.playhead >= m.vp->x + m.vp->w )
  359. {
  360. if ( config.follow_playhead )
  361. {
  362. m.vp->x = m.playhead / m.vp->w * m.vp->w;
  363. m.ruler_drawn = false;
  364. signal_draw();
  365. return 0;
  366. }
  367. }
  368. copy();
  369. for ( uint x = m.vp->w; x-- ; )
  370. for ( uint y = m.vp->h; y-- ; )
  371. m.current[ x ][ y ].flags &= ~ (F_PLAYHEAD | F_P1 | F_P2 );
  372. flip();
  373. return 1;
  374. }
  375. /** draw ONLY those nodes necessary to bring the canvas up-to-date with the grid */
  376. void
  377. Canvas::draw ( void )
  378. {
  379. DEBUG( "drawing canvas" );
  380. draw_mapping();
  381. draw_ruler();
  382. m.grid_drawn = true;
  383. m.grid->draw( this, m.vp->x, m.vp->y, m.vp->w, m.vp->h );
  384. }
  385. /** redraw every node on the canvas from the buffer (without
  386. * necessarily reexamining the grid) */
  387. void
  388. Canvas::redraw ( void )
  389. {
  390. DEBUG( "redrawing canvas" );
  391. if ( ! m.grid_drawn )
  392. draw();
  393. m.ruler_drawn = false;
  394. m.mapping_drawn = false;
  395. draw_mapping();
  396. draw_ruler();
  397. for ( int y = m.vp->h; y--; )
  398. for ( int x = m.vp->w; x--; )
  399. {
  400. cell_t c = m.previous[ x ][ y ];
  401. if ( c.shape > HEXAGON ) return;
  402. if ( m.vp->x + x == m.playhead )
  403. c.flags |= F_PLAYHEAD;
  404. gui_draw_shape( m.origin_x + m.margin_left + x * m.div_w, m.origin_y + m.margin_top + y * m.div_h, m.div_w, m.div_h, m.border_w,
  405. c.shape, c.state, c.flags, c.color );
  406. }
  407. }
  408. /** convert pixel coords into grid coords. returns true if valid */
  409. bool
  410. Canvas::grid_pos ( int *x, int *y )
  411. {
  412. *y = (*y - m.margin_top - m.origin_y) / m.div_h;
  413. *x = (*x - m.margin_left - m.origin_x) / m.div_w;
  414. if ( *x < 0 || *y < 0 || *x >= m.vp->w || *y >= m.vp->h )
  415. return false;
  416. /* adjust for viewport */
  417. *x += m.vp->x;
  418. *y += m.vp->y;
  419. /* adjust for row-compaction */
  420. *y = rtn( *y );
  421. return true;
  422. }
  423. /******************/
  424. /* Input handlers */
  425. /******************/
  426. /* These methods translate viewport pixel coords to absolute grid
  427. coords and pass on to the grid. */
  428. void
  429. Canvas::set ( int x, int y )
  430. {
  431. if ( y - m.origin_y < m.margin_top )
  432. /* looks like a click on the ruler */
  433. {
  434. if ( x - m.margin_left - m.origin_x >= 0 )
  435. {
  436. m.p1 = m.vp->x + ((x - m.margin_left - m.origin_x) / m.div_w);
  437. m.ruler_drawn = false;
  438. }
  439. _lr();
  440. signal_draw();
  441. return;
  442. }
  443. if ( ! grid_pos( &x, &y ) )
  444. return;
  445. m.grid->put( x, y, 0 );
  446. }
  447. void
  448. Canvas::unset ( int x, int y )
  449. {
  450. if ( y - m.origin_y < m.margin_top )
  451. /* looks like a click on the ruler */
  452. {
  453. if ( x - m.margin_left - m.origin_x >= 0 )
  454. {
  455. m.p2 = m.vp->x + ((x - m.margin_left - m.origin_x) / m.div_w);
  456. m.ruler_drawn = false;
  457. }
  458. _lr();
  459. signal_draw();
  460. return;
  461. }
  462. if ( ! grid_pos( &x, &y ) )
  463. return;
  464. m.grid->del( x, y );
  465. }
  466. void
  467. Canvas::adj_color ( int x, int y, int n )
  468. {
  469. if ( ! grid_pos( &x, &y ) )
  470. return;
  471. m.grid->adj_velocity( x, y, n );
  472. }
  473. void
  474. Canvas::adj_length ( int x, int y, int n )
  475. {
  476. if ( ! grid_pos( &x, &y ) )
  477. return;
  478. m.grid->adj_duration( x, y, n );
  479. }
  480. void
  481. Canvas::select ( int x, int y )
  482. {
  483. if ( ! grid_pos( &x, &y ) )
  484. return;
  485. m.grid->select( x, y, true );
  486. }
  487. void
  488. Canvas::move_selected ( int dir, int n )
  489. {
  490. switch ( dir )
  491. {
  492. case RIGHT:
  493. m.grid->move_selected( n );
  494. break;
  495. case LEFT:
  496. m.grid->move_selected( 0 - n );
  497. break;
  498. case UP:
  499. case DOWN:
  500. {
  501. /* row-compaction makes this a little complicated */
  502. event_list *el = m.grid->events();
  503. /* FIXME: don't allow movement beyond the edges! */
  504. /* int hi, lo; */
  505. /* m.grid->selected_hi_lo_note( &hi, &lo ); */
  506. /* hi = ntr( hi ) > 0 ? ntr( hi ) : */
  507. /* if ( m.grid->y_to_note( ntr( hi ) ) ) */
  508. if ( dir == UP )
  509. for ( int y = 0; y <= m.maxh; ++y )
  510. el->rewrite_selected( m.grid->y_to_note( rtn( y ) ), m.grid->y_to_note( rtn( y - n ) ) );
  511. else
  512. for ( int y = m.maxh; y >= 0; --y )
  513. el->rewrite_selected( m.grid->y_to_note( rtn( y ) ), m.grid->y_to_note( rtn( y + n ) ) );
  514. m.grid->events( el );
  515. delete el;
  516. break;
  517. }
  518. }
  519. }
  520. void
  521. Canvas::randomize_row ( int y )
  522. {
  523. int x = m.margin_left;
  524. if ( ! grid_pos( &x, &y ) )
  525. return;
  526. ((pattern*)m.grid)->randomize_row( y, song.random.feel, song.random.probability );
  527. }
  528. void
  529. Canvas::_lr ( void )
  530. {
  531. int l, r;
  532. if ( m.p2 > m.p1 )
  533. {
  534. l = m.p1;
  535. r = m.p2;
  536. }
  537. else
  538. {
  539. l = m.p2;
  540. r = m.p1;
  541. }
  542. m.p1 = l;
  543. m.p2 = r;
  544. }
  545. void
  546. Canvas::select_range ( void )
  547. {
  548. m.grid->select( m.p1, m.p2 );
  549. }
  550. void
  551. Canvas::crop ( void )
  552. {
  553. m.grid->crop( m.p1, m.p2 );
  554. m.vp->x = 0;
  555. m.p2 = m.p2 - m.p1;
  556. m.p1 = 0;
  557. m.ruler_drawn = false;
  558. }
  559. void
  560. Canvas::delete_time ( void )
  561. {
  562. m.grid->delete_time( m.p1, m.p2 );
  563. }
  564. void
  565. Canvas::insert_time ( void )
  566. {
  567. m.grid->insert_time( m.p1, m.p2 );
  568. }
  569. /** paste range as new grid */
  570. void
  571. Canvas::duplicate_range ( void )
  572. {
  573. Grid *g = m.grid->clone();
  574. g->crop( m.p1, m.p2 );
  575. g->viewport.x = 0;
  576. }
  577. void
  578. Canvas::row_compact ( int n )
  579. {
  580. switch ( n )
  581. {
  582. case OFF:
  583. m.row_compact = false;
  584. m.maxh = 128;
  585. break;
  586. case ON:
  587. m.row_compact = true;
  588. m.vp->y = 0;
  589. _update_row_mapping();
  590. break;
  591. case TOGGLE:
  592. row_compact( m.row_compact ? OFF : ON );
  593. break;
  594. }
  595. _reset();
  596. m.mapping_drawn = false;
  597. }
  598. void
  599. Canvas::pan ( int dir, int n )
  600. {
  601. switch ( dir )
  602. {
  603. case LEFT: case RIGHT: case TO_PLAYHEAD: case TO_NEXT_NOTE: case TO_PREV_NOTE:
  604. /* handle horizontal movement specially */
  605. n *= m.grid->division();
  606. m.ruler_drawn = false;
  607. break;
  608. default:
  609. n *= 5;
  610. m.mapping_drawn = false;
  611. break;
  612. }
  613. switch ( dir )
  614. {
  615. case LEFT:
  616. m.vp->x = max( m.vp->x - n, 0 );
  617. break;
  618. case RIGHT:
  619. m.vp->x += n;
  620. break;
  621. case TO_PLAYHEAD:
  622. m.vp->x = m.playhead - (m.playhead % m.grid->division());
  623. break;
  624. case UP:
  625. m.vp->y = max( m.vp->y - n, 0 );
  626. break;
  627. case DOWN:
  628. m.vp->y = min( m.vp->y + n, m.maxh - m.vp->h );
  629. break;
  630. case TO_NEXT_NOTE:
  631. {
  632. int x = m.grid->next_note_x( m.vp->x );
  633. m.vp->x = x - (x % m.grid->division() );
  634. break;
  635. }
  636. case TO_PREV_NOTE:
  637. {
  638. int x = m.grid->prev_note_x( m.vp->x );
  639. m.vp->x = x - (x % m.grid->division() );
  640. break;
  641. }
  642. }
  643. signal_draw();
  644. }
  645. /** adjust horizontal zoom (* n) */
  646. void
  647. Canvas::h_zoom ( float n )
  648. {
  649. m.vp->w = max( 32, min( (int)(m.vp->w * n), 256 ) );
  650. resize_grid();
  651. }
  652. /** adjust vertical zoom (* n) */
  653. void
  654. Canvas::v_zoom ( float n )
  655. {
  656. m.vp->h = max( 1, min( (int)(m.vp->h * n), m.maxh ) );
  657. resize_grid();
  658. }
  659. void
  660. Canvas::notes ( char *s )
  661. {
  662. m.grid->notes( s );
  663. }
  664. char *
  665. Canvas::notes ( void )
  666. {
  667. return m.grid->notes();
  668. }