2024-07-15 11:46:59 +08:00

268 lines
5.7 KiB
C++

//
// Programmer: Craig Stuart Sapp <craig@ccrma.stanford.edu>
// Creation Date: Sat Jun 30 11:52:06 PDT 2001
// Last Modified: Mon Feb 9 21:14:03 PST 2015 Updated for C++11.
// Filename: tools/midi2melody.cpp
// URL: https://github.com/craigsapp/midifile/blob/master/tools/midi2melody.cpp
// Syntax: C++11
// vim: ts=3
//
// Description: Converts a single melody MIDI file/track into an ASCII text
// format with starting time and pitch.
//
#include "MidiFile.h"
#include "Options.h"
#include <iostream>
#include <vector>
using namespace std;
using namespace smf;
class Melody {
public:
double tick;
double duration;
int pitch;
};
void checkOptions (Options& opts, int argc, char** argv);
void example (void);
void usage (const char* command);
void convertToMelody (MidiFile& midifile, vector<Melody>& melody);
void printMelody (vector<Melody>& melody, int tpq);
void sortMelody (vector<Melody>& melody);
int notecompare (const void* a, const void* b);
// User interface variables:
Options options;
int track = 0; // used with the -t option
//////////////////////////////////////////////////////////////////////////
int main(int argc, char* argv[]) {
checkOptions(options, argc, argv);
MidiFile midifile(options.getArg(1));
if (options.getBoolean("track-count")) {
cout << midifile.getTrackCount() << endl;
return 0;
}
if (!options.getBoolean("track")) {
midifile.joinTracks();
}
vector<Melody> melody;
convertToMelody(midifile, melody);
sortMelody(melody);
printMelody(melody, midifile.getTicksPerQuarterNote());
return 0;
}
//////////////////////////////////////////////////////////////////////////
//////////////////////////////
//
// sortMelody --
//
void sortMelody(vector<Melody>& melody) {
qsort(melody.data(), melody.size(), sizeof(Melody), notecompare);
}
//////////////////////////////
//
// printMelody -- Only print the highest voice if multiple notes played together.
//
void printMelody(vector<Melody>& melody, int tpq) {
if (melody.size() < 1) {
return;
}
Melody temp;
temp.tick = melody[melody.size()-1].tick + melody[melody.size()-1].duration;
temp.pitch = 0;
temp.duration = 0;
melody.push_back(temp);
for (int i=0; i<(int)melody.size()-1; i++) {
double delta = melody[i+1].tick - melody[i].tick;
if (delta == 0) {
continue;
}
cout << (double)melody[i].tick/tpq
<< "\t" << melody[i].pitch
// << "\t" << (double)melody[i].duration/tpq
<< "\n";
if (delta > melody[i].duration) {
cout << (melody[i+1].tick - (delta - melody[i].duration))/(double)tpq
<< "\t" << 0
<< "\n";
}
}
cout << (double)melody[melody.size()-1].tick/tpq
<< "\t" << 0
<< "\n";
}
//////////////////////////////
//
// convertToMelody --
//
void convertToMelody(MidiFile& midifile, vector<Melody>& melody) {
midifile.absoluteTicks();
if (track < 0 || track >= midifile.getNumTracks()) {
cout << "Invalid track: " << track << " Maximum track is: "
<< midifile.getNumTracks() - 1 << endl;
}
int numEvents = midifile.getNumEvents(track);
vector<int> state(128); // for keeping track of the note states
int i;
for (i=0; i<128; i++) {
state[i] = -1;
}
melody.reserve(numEvents);
melody.clear();
Melody mtemp;
int command;
int pitch;
int velocity;
for (i=0; i<numEvents; i++) {
command = midifile[track][i][0] & 0xf0;
if (command == 0x90) {
pitch = midifile[track][i][1];
velocity = midifile[track][i][2];
if (velocity == 0) {
// note off
goto noteoff;
} else {
// note on
state[pitch] = midifile[track][i].tick;
}
} else if (command == 0x80) {
// note off
pitch = midifile[track][i][1];
noteoff:
if (state[pitch] == -1) {
continue;
}
mtemp.tick = state[pitch];
mtemp.duration = midifile[track][i].tick - state[pitch];
mtemp.pitch = pitch;
melody.push_back(mtemp);
state[pitch] = -1;
}
}
}
//////////////////////////////
//
// checkOptions --
//
void checkOptions(Options& opts, int argc, char* argv[]) {
opts.define("t|track=i:0", "Track from which to extract melody");
options.define("c|track-count=b", "List number of tracks");
opts.define("author=b", "author of program");
opts.define("version=b", "compilation info");
opts.define("example=b", "example usages");
opts.define("h|help=b", "short description");
opts.process(argc, argv);
// handle basic options:
if (opts.getBoolean("author")) {
cout << "Written by Craig Stuart Sapp, "
<< "craig@ccrma.stanford.edu, 30 June 2001" << endl;
exit(0);
} else if (opts.getBoolean("version")) {
cout << argv[0] << ", version: June 2001" << endl;
cout << "compiled: " << __DATE__ << endl;
exit(0);
} else if (opts.getBoolean("help")) {
usage(opts.getCommand().c_str());
exit(0);
} else if (opts.getBoolean("example")) {
example();
exit(0);
}
if (opts.getArgCount() != 1) {
usage(opts.getCommand().c_str());
exit(1);
}
track = opts.getInteger("track");
}
//////////////////////////////
//
// example --
//
void example(void) {
// give example usage here
}
//////////////////////////////
//
// usage --
//
void usage(const char* command) {
// give example usage here
}
///////////////////////////////
//
// notecompare -- for sorting the times of Melody messages
//
int notecompare(const void* a, const void* b) {
const Melody& aa = *static_cast<const Melody*>(a);
const Melody& bb = *static_cast<const Melody*>(b);
if (aa.tick < bb.tick) {
return -1;
} else if (aa.tick > bb.tick) {
return 1;
} else {
// highest note comes first
if (aa.pitch > bb.pitch) {
return 1;
} else if (aa.pitch < bb.pitch) {
return -1;
} else {
return 0;
}
}
}