DJMFix.cpp
author František Kučera <franta-hg@frantovo.cz>
Sun, 20 Dec 2020 01:00:15 +0100
branchv_0
changeset 7 889b4b8737bd
parent 6 bddcf2bf29f2
child 8 87dfa7c89294
permissions -rw-r--r--
send the second message as a response (instead of after a fixed delay)
     1 /**
     2  * DJM-Fix
     3  * Copyright © 2020 František Kučera (Frantovo.cz, GlobalCode.info)
     4  *
     5  * This program is free software: you can redistribute it and/or modify
     6  * it under the terms of the GNU General Public License as published by
     7  * the Free Software Foundation, version 3 of the License.
     8  *
     9  * This program is distributed in the hope that it will be useful,
    10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
    11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    12  * GNU General Public License for more details.
    13  *
    14  * You should have received a copy of the GNU General Public License
    15  * along with this program. If not, see <http://www.gnu.org/licenses/>.
    16  */
    17 #include <iostream>
    18 #include <iomanip>
    19 #include <thread>
    20 #include <mutex>
    21 #include <atomic>
    22 #include <chrono>
    23 #include <stdexcept>
    24 #include <vector>
    25 
    26 #include "DJMFix.h"
    27 
    28 namespace djmfix {
    29 
    30 using Bytes = std::vector<uint8_t>;
    31 
    32 class DJMFixImpl : public DJMFix {
    33 private:
    34 	MidiSender* midiSender;
    35 	std::thread keepAliveThread;
    36 	std::recursive_mutex midiMutex;
    37 	std::atomic<bool> running{false};
    38 	std::atomic<bool> stopped{false};
    39 
    40 	void run() {
    41 		while (!stopped) {
    42 			std::cerr << "DJMFixImpl::run()" << std::endl; // TODO: do not mess STDIO
    43 			// TODO: send keep-alive messages
    44 			std::this_thread::sleep_for(std::chrono::milliseconds(200));
    45 		}
    46 	}
    47 
    48 	void send(const MidiMessage& midiMessage) {
    49 		std::lock_guard<std::recursive_mutex> lock(midiMutex);
    50 		midiSender->send(midiMessage);
    51 	}
    52 
    53 	std::string toString(const Bytes& midiMessage) {
    54 		std::stringstream result;
    55 		for (uint8_t b : midiMessage) result << std::hex << std::setw(2) << std::setfill('0') << (int) b;
    56 		return result.str();
    57 	}
    58 
    59 	Bytes normalize(const Bytes& data) {
    60 		if (data.size() % 2) throw std::invalid_argument("data before normalization must have even number of bytes");
    61 		Bytes result;
    62 		result.reserve(data.size() / 2);
    63 		for (size_t i = 0; i < data.size() / 2; i++) result.push_back((data[i * 2] & 0x0F) << 4 | (data[i * 2 + 1] & 0x0F));
    64 		return result;
    65 	}
    66 
    67 	uint32_t fnv32hash(const Bytes& buff) {
    68 		uint32_t hash = 0x811c9dc5;
    69 		for (uint8_t b : buff) hash = ((b^hash) * 0x1000193);
    70 		return hash;
    71 	}
    72 
    73 	Bytes toBytes(const uint32_t value) {
    74 		Bytes result;
    75 		result.reserve(4);
    76 		result.push_back(value >> 24);
    77 		result.push_back(value >> 16);
    78 		result.push_back(value >> 8);
    79 		result.push_back(value >> 0);
    80 		return result;
    81 	}
    82 
    83 	bool equals(Bytes a, Bytes b) {
    84 		if (a.size() != b.size()) return false;
    85 		for (size_t i = 0; i < a.size(); i++) if (a[i] != b[i]) return false;
    86 		return true;
    87 	}
    88 
    89 	template<typename T> std::vector<T> concat(const std::vector<T>& a, const std::vector<T>& b, const std::vector<T>& c = {}) {
    90 		std::vector<T> result;
    91 		result.reserve(a.size() + b.size() + c.size());
    92 		for (size_t i = 0; i < a.size(); i++) result.push_back(a[i]);
    93 		for (size_t i = 0; i < b.size(); i++) result.push_back(b[i]);
    94 		for (size_t i = 0; i < c.size(); i++) result.push_back(c[i]);
    95 		return result;
    96 	}
    97 
    98 	template<typename T> std::vector<T> xOR(const std::vector<T>& a, const std::vector<T>& b) {
    99 		if (a.size() != b.size()) throw std::invalid_argument("xor: both must be the same length");
   100 		std::vector<T> result;
   101 		result.reserve(a.size());
   102 		for (size_t i = 0; i < a.size(); i++) result.push_back(a[i] ^ b[i]);
   103 		return result;
   104 	}
   105 
   106 public:
   107 
   108 	virtual ~DJMFixImpl() override {
   109 		std::cerr << "~DJMFixImpl()" << std::endl; // TODO: do not mess STDIO
   110 		if (running) stop();
   111 	}
   112 
   113 	void setMidiSender(MidiSender* midiSender) {
   114 		std::cerr << "DJMFixImpl::setMidiSender()" << std::endl; // TODO: do not mess STDIO
   115 		this->midiSender = midiSender;
   116 	}
   117 
   118 	virtual void receive(const MidiMessage& midiMessage) override {
   119 		std::cerr << "DJMFixImpl::receive(): size = " << midiMessage.size() << " data = " << toString(midiMessage) << std::endl; // TODO: do not mess STDIO
   120 		std::lock_guard<std::recursive_mutex> lock(midiMutex);
   121 
   122 
   123 		if (midiMessage.size() == 12 && midiMessage[9] == 0x11) {
   124 			send({0xf0, 0x00, 0x40, 0x05, 0x00, 0x00, 0x00, 0x17, 0x00, 0x12, 0x2a, 0x01, 0x0b, 0x50, 0x69, 0x6f, 0x6e, 0x65, 0x65, 0x72, 0x44, 0x4a, 0x02, 0x0b, 0x72, 0x65, 0x6b, 0x6f, 0x72, 0x64, 0x62, 0x6f, 0x78, 0x03, 0x12, 0x02, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x03, 0x04, 0x08, 0x00, 0x00, 0x00, 0x00, 0xf7});
   125 		} else if (midiMessage.size() == 54 && midiMessage[9] == 0x13 && midiMessage[33] == 0x04 && midiMessage[43] == 0x03) {
   126 			Bytes hash1(midiMessage.begin() + 35, midiMessage.begin() + 35 + 8);
   127 			Bytes seed2(midiMessage.begin() + 45, midiMessage.begin() + 45 + 8);
   128 			hash1 = normalize(hash1);
   129 			seed2 = normalize(seed2);
   130 			std::cerr << "DJMFixImpl::receive(): got message with hash1 = " << toString(hash1) << " and seed2 = " << toString(seed2) << std::endl; // TODO: do not mess STDIO
   131 
   132 			Bytes seed0 = {0x68, 0x01, 0x31, 0xFB};
   133 			Bytes seed1 = {0x29, 0x00, 0x00, 0x00, 0x23, 0x48, 0x00, 0x00};
   134 
   135 			Bytes hash1check = toBytes(fnv32hash(concat(seed1, xOR(seed0, seed2))));
   136 
   137 			if (equals(hash1, hash1check)) {
   138 				std::cerr << "DJMFixImpl::receive(): hash1 verification: OK" << std::endl;
   139 			} else {
   140 				std::cerr << "DJMFixImpl::receive(): hash1 verification: ERROR: check = " << toString(hash1check) << std::endl;
   141 			}
   142 		}
   143 
   144 	}
   145 
   146 	void start() override {
   147 		std::cerr << "DJMFixImpl::start()" << std::endl; // TODO: do not mess STDIO
   148 		if (midiSender == nullptr) throw std::logic_error("need a midiSender when starting DJMFix");
   149 
   150 		// TODO: methods for parsing and constructing messages from parts (TLV)
   151 		send({0xf0, 0x00, 0x40, 0x05, 0x00, 0x00, 0x00, 0x17, 0x00, 0x50, 0x01, 0xf7});
   152 
   153 		keepAliveThread = std::thread(&DJMFixImpl::run, this);
   154 		running = true;
   155 
   156 	}
   157 
   158 	void stop() override {
   159 		stopped = true;
   160 		keepAliveThread.join();
   161 		running = false;
   162 		std::cerr << "DJMFixImpl::stop()" << std::endl; // TODO: do not mess STDIO
   163 	}
   164 };
   165 
   166 DJMFix* create() {
   167 	return new DJMFixImpl();
   168 }
   169 
   170 }