1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502
|
//=============================================================================
// MuseScore
// Music Composition & Notation
//
// Copyright (C) 2009-2011 Werner Schweer
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License version 2
// as published by the Free Software Foundation and appearing in
// the file LICENCE.GPL
//=============================================================================
#include "repeatlist.h"
#include "score.h"
#include "measure.h"
#include "tempo.h"
#include "volta.h"
#include "segment.h"
#include "marker.h"
#include "jump.h"
namespace Ms {
//---------------------------------------------------------
// searchVolta
// return volta at tick
//---------------------------------------------------------
Volta* Score::searchVolta(int tick) const
{
for (const std::pair<int,Spanner*>& p : _spanner.map()) {
Spanner* s = p.second;
if (s->type() != Element::Type::VOLTA)
continue;
Volta* volta = static_cast<Volta*>(s);
if (tick >= volta->tick() && tick < volta->tick2())
return volta;
}
return 0;
}
//---------------------------------------------------------
// searchLabel
//---------------------------------------------------------
Measure* Score::searchLabel(const QString& s)
{
if (s == "start")
return firstMeasure();
else if (s == "end")
return lastMeasure();
for (Measure* m = firstMeasure(); m; m = m->nextMeasure()) {
for (auto e : m->el()) {
if (e->type() == Element::Type::MARKER) {
const Marker* marker = static_cast<const Marker*>(e);
if (marker->label() == s)
return m;
}
}
}
return 0;
}
//---------------------------------------------------------
// searchLabelWithinSectionFirst
//---------------------------------------------------------
Measure* Score::searchLabelWithinSectionFirst(const QString& s, Measure* sectionStartMeasure, Measure* sectionEndMeasure)
{
if (s == "start")
return sectionStartMeasure;
else if (s == "end")
return sectionEndMeasure;
for (Measure* m = sectionStartMeasure; m && (m != sectionEndMeasure->nextMeasure()); m = m->nextMeasure()) {
for (auto e : m->el()) {
if (e->type() == Element::Type::MARKER) {
const Marker* marker = static_cast<const Marker*>(e);
if (marker->label() == s)
return m;
}
}
}
// if did not find label within section, then search for label in entire score
return searchLabel(s);
}
//---------------------------------------------------------
// RepeatLoop
//---------------------------------------------------------
struct RepeatLoop {
enum class LoopType : char { REPEAT, JUMP };
LoopType type;
Measure* m; // start measure of LoopType::REPEAT
int count;
QString stop, cont;
RepeatLoop() {}
RepeatLoop(Measure* _m) {
m = _m;
count = 0;
type = LoopType::REPEAT;
}
RepeatLoop(const QString s, const QString c)
: stop(s), cont(c)
{
m = 0;
type = LoopType::JUMP;
}
};
//---------------------------------------------------------
// RepeatSegment
//---------------------------------------------------------
RepeatSegment::RepeatSegment()
{
tick = 0;
len = 0;
utick = 0;
utime = 0.0;
timeOffset = 0.0;
}
//---------------------------------------------------------
// RepeatList
//---------------------------------------------------------
RepeatList::RepeatList(Score* s)
{
_score = s;
idx1 = 0;
idx2 = 0;
}
//---------------------------------------------------------
// ticks
//---------------------------------------------------------
int RepeatList::ticks()
{
if (length() > 0) {
RepeatSegment* s = last();
return s->utick + s->len;
}
return 0;
}
//---------------------------------------------------------
// update
//---------------------------------------------------------
void RepeatList::update()
{
const TempoMap* tl = _score->tempomap();
int utick = 0;
qreal t = 0;
for(RepeatSegment* s : *this) {
s->utick = utick;
s->utime = t;
qreal ct = tl->tick2time(s->tick);
s->timeOffset = t - ct;
utick += s->len;
t += tl->tick2time(s->tick + s->len) - ct;
}
}
//---------------------------------------------------------
// utick2tick
//---------------------------------------------------------
int RepeatList::utick2tick(int tick) const
{
unsigned n = size();
if (n == 0)
return tick;
if (tick < 0)
return 0;
unsigned ii = (idx1 < n) && (tick >= at(idx1)->utick) ? idx1 : 0;
for (unsigned i = ii; i < n; ++i) {
if ((tick >= at(i)->utick) && ((i + 1 == n) || (tick < at(i+1)->utick))) {
idx1 = i;
return tick - (at(i)->utick - at(i)->tick);
}
}
if (MScore::debugMode) {
qFatal("tick %d not found in RepeatList", tick);
}
return 0;
}
//---------------------------------------------------------
// tick2utick
//---------------------------------------------------------
int RepeatList::tick2utick(int tick) const
{
for (const RepeatSegment* s : *this) {
if (tick >= s->tick && tick < (s->tick + s->len))
return s->utick + (tick - s->tick);
}
return last()->utick + (tick - last()->tick);
}
//---------------------------------------------------------
// utick2utime
//---------------------------------------------------------
qreal RepeatList::utick2utime(int tick) const
{
unsigned n = size();
unsigned ii = (idx1 < n) && (tick >= at(idx1)->utick) ? idx1 : 0;
for (unsigned i = ii; i < n; ++i) {
if ((tick >= at(i)->utick) && ((i + 1 == n) || (tick < at(i+1)->utick))) {
int t = tick - (at(i)->utick - at(i)->tick);
qreal tt = _score->tempomap()->tick2time(t) + at(i)->timeOffset;
return tt;
}
}
return 0.0;
}
//---------------------------------------------------------
// utime2utick
//---------------------------------------------------------
int RepeatList::utime2utick(qreal t) const
{
unsigned n = size();
unsigned ii = (idx2 < n) && (t >= at(idx2)->utime) ? idx2 : 0;
for (unsigned i = ii; i < n; ++i) {
if ((t >= at(i)->utime) && ((i + 1 == n) || (t < at(i+1)->utime))) {
idx2 = i;
return _score->tempomap()->time2tick(t - at(i)->timeOffset) + (at(i)->utick - at(i)->tick);
}
}
if (MScore::debugMode) {
qFatal("time %f not found in RepeatList", t);
}
return 0;
}
//---------------------------------------------------------
// dump
//---------------------------------------------------------
void RepeatList::dump() const
{
#if 0
qDebug("==Dump Repeat List:==");
foreach(const RepeatSegment* s, *this) {
qDebug("%p tick: %3d(%d) %3d(%d) len %d(%d) beats %f + %f", s,
s->utick / MScore::division,
s->utick / MScore::division / 4,
s->tick / MScore::division,
s->tick / MScore::division / 4,
s->len / MScore::division,
s->len / MScore::division / 4,
s->utime, s->timeOffset);
}
#endif
}
//---------------------------------------------------------
// unwind
// implements:
// - repeats
// - volta
// - d.c. al fine
// - d.s. al fine
// - d.s. al coda
//---------------------------------------------------------
void RepeatList::unwind()
{
qDeleteAll(*this);
clear();
Measure* fm = _score->firstMeasure();
if (!fm)
return;
//qDebug("unwind===================");
for (Measure* m = fm; m; m = m->nextMeasure())
m->setPlaybackCount(0);
MeasureBase* sectionStartMeasureBase = NULL; // NULL indicates haven't discovered starting Measure of section
MeasureBase* sectionEndMeasureBase = NULL;
// partition score by section breaks and unwind individual sections seperately
// note: section breaks may occur on non-Measure frames, so must seach list of all MeasureBases
for (MeasureBase* mb = _score->first(); mb; mb = mb->next()) {
// unwindSection only deals with real Measures, so sectionEndMeasureBase and sectionStartMeasureBase will only point to real Measures
if (mb->isMeasure()) {
sectionEndMeasureBase = mb; // ending measure of section is the most recently encountered actual Measure
// starting measure of section will be the first non-NULL actual Measure encountered
if (sectionStartMeasureBase == NULL)
sectionStartMeasureBase = mb;
}
// if found section break or reached final MeasureBase of score, then unwind
if (mb->sectionBreak() || !mb->nextMeasure()) {
// only unwind if section starts and ends with actual real measure
if (sectionStartMeasureBase && sectionEndMeasureBase) {
unwindSection(reinterpret_cast<Measure*>(sectionStartMeasureBase), reinterpret_cast<Measure*>(sectionEndMeasureBase));
sectionStartMeasureBase = sectionEndMeasureBase = NULL; // reset to NULL to indicate that don't know starting Measure of next section after starting new section
}
else {
qDebug( "Will not unroll a section that doesn't start or end with an actual measure. sectionStartMeasureBase = %p, sectionEndMeasureBase = %p",
sectionStartMeasureBase, sectionEndMeasureBase);
}
}
}
update();
dump();
}
//---------------------------------------------------------
// unwindSection
// unwinds from sectionStartMeasure through sectionEndMeasure
// appends repeat segments to rs
//---------------------------------------------------------
void RepeatList::unwindSection(Measure* sectionStartMeasure, Measure* sectionEndMeasure)
{
// qDebug("unwind %d-measure section starting %p through %p", sectionEndMeasure->no()+1, sectionStartMeasure, sectionEndMeasure);
QList<Jump*> jumps; // take the jumps only once so store them
rs = new RepeatSegment;
rs->tick = sectionStartMeasure->tick(); // prepare initial repeat segment for start of this section
Measure* endRepeat = 0; // measure where the current repeat should stop
Measure* continueAt = 0; // measure where the playback should continue after the repeat (To coda)
Measure* m = 0;
int loop = 0; // keeps track of how many times have repeated a :| (Repeat::END)
int repeatCount = 0;
bool isGoto = false;
for (Measure* nm = sectionStartMeasure; nm; ) {
m = nm;
m->setPlaybackCount(m->playbackCount() + 1);
Repeat flags = m->repeatFlags();
bool doJump = false; // process jump after endrepeat
// during any DC or DS, will take last time through repeat
if (isGoto && (flags & Repeat::END))
loop = m->repeatCount() - 1;
// qDebug("m%d(tick %7d) %p: playbackCount %d loop %d repeatCount %d isGoto %d endRepeat %p continueAt %p flags 0x%x",
// m->no()+1, m->tick(), m, m->playbackCount(), loop, repeatCount, isGoto, endRepeat, continueAt, int(flags));
if (endRepeat) {
Volta* volta = _score->searchVolta(m->tick());
if (volta && !volta->hasEnding(m->playbackCount())) {
// skip measure
if (rs->tick < m->tick()) {
rs->len = m->tick() - rs->tick;
append(rs);
rs = new RepeatSegment;
}
rs->tick = m->endTick();
}
else if (flags & Repeat::JUMP) {
doJump = true;
isGoto = false;
}
}
else if (flags & Repeat::JUMP) { // Jumps are only accepted outside of other repeats
doJump = true;
}
if (isGoto && (endRepeat == m)) {
if (continueAt == 0)
break;
rs->len = m->endTick() - rs->tick;
append(rs);
rs = new RepeatSegment;
rs->tick = continueAt->tick();
nm = continueAt;
isGoto = false;
endRepeat = 0;
continue;
}
else if (flags & Repeat::END) {
if (endRepeat == m) {
++loop;
if (loop >= repeatCount) {
endRepeat = 0;
loop = 0;
}
else {
nm = jumpToStartRepeat(m);
continue;
}
}
else if (endRepeat == 0) {
if (m->playbackCount() >= m->repeatCount())
break;
endRepeat = m;
repeatCount = m->repeatCount();
loop = 1;
nm = jumpToStartRepeat(m);
continue;
}
}
if (doJump && !isGoto) {
Jump* s = 0;
foreach(Element* e, m->el()) {
if (e->type() == Element::Type::JUMP) {
s = static_cast<Jump*>(e);
break;
}
}
// jump only once
if (jumps.contains(s)) {
if (endRepeat == _score->searchLabelWithinSectionFirst(s->playUntil(), sectionStartMeasure, sectionEndMeasure))
endRepeat = 0;
nm = m->nextMeasure();
if (nm == sectionEndMeasure->nextMeasure())
break;
else
continue;
}
jumps.append(s);
if (s) {
nm = _score->searchLabelWithinSectionFirst(s->jumpTo() , sectionStartMeasure, sectionEndMeasure);
endRepeat = _score->searchLabelWithinSectionFirst(s->playUntil() , sectionStartMeasure, sectionEndMeasure);
continueAt = _score->searchLabelWithinSectionFirst(s->continueAt(), sectionStartMeasure, sectionEndMeasure);
if (nm && endRepeat) {
isGoto = true;
rs->len = m->endTick() - rs->tick;
append(rs);
rs = new RepeatSegment;
rs->tick = nm->tick();
continue;
}
}
else
qDebug("Jump not found");
}
// keep looping until reach end of score or end of the section
nm = m->nextMeasure();
if (nm == sectionEndMeasure->nextMeasure())
break;
}
// append the final repeat segment of that section
if (rs) {
rs->len = m->endTick() - rs->tick;
if (rs->len)
append(rs);
else
delete rs;
}
}
//---------------------------------------------------------
// jumpToStartRepeat
//---------------------------------------------------------
Measure* RepeatList::jumpToStartRepeat(Measure* m)
{
// finalize the previous repeat segment
rs->len = m->tick() + m->ticks() - rs->tick;
append(rs);
// search backwards until find start of repeat
while (true) {
if (m->repeatFlags() & Repeat::START)
break;
if (m == _score->firstMeasure())
break;
if (m->prevMeasure()->sectionBreak())
break;
m = m->prevMeasure();
}
// initialize the next repeat segment
rs = new RepeatSegment;
rs->tick = m->tick();
return m;
}
}
|