105 lines
3.7 KiB
C++
105 lines
3.7 KiB
C++
// Copyright 2009 Ken Shirriff
|
|
// Copyright 2017 David Conran
|
|
|
|
#include <algorithm>
|
|
#include "IRrecv.h"
|
|
#include "IRsend.h"
|
|
#include "IRutils.h"
|
|
|
|
// NN NN IIIII KK KK AAA IIIII
|
|
// NNN NN III KK KK AAAAA III
|
|
// NN N NN III KKKK AA AA III
|
|
// NN NNN III KK KK AAAAAAA III
|
|
// NN NN IIIII KK KK AA AA IIIII
|
|
|
|
// Constants
|
|
// Ref:
|
|
// https://github.com/markszabo/IRremoteESP8266/issues/309
|
|
const uint16_t kNikaiTick = 500;
|
|
const uint16_t kNikaiHdrMarkTicks = 8;
|
|
const uint16_t kNikaiHdrMark = kNikaiHdrMarkTicks * kNikaiTick;
|
|
const uint16_t kNikaiHdrSpaceTicks = 8;
|
|
const uint16_t kNikaiHdrSpace = kNikaiHdrSpaceTicks * kNikaiTick;
|
|
const uint16_t kNikaiBitMarkTicks = 1;
|
|
const uint16_t kNikaiBitMark = kNikaiBitMarkTicks * kNikaiTick;
|
|
const uint16_t kNikaiOneSpaceTicks = 2;
|
|
const uint16_t kNikaiOneSpace = kNikaiOneSpaceTicks * kNikaiTick;
|
|
const uint16_t kNikaiZeroSpaceTicks = 4;
|
|
const uint16_t kNikaiZeroSpace = kNikaiZeroSpaceTicks * kNikaiTick;
|
|
const uint16_t kNikaiMinGapTicks = 17;
|
|
const uint16_t kNikaiMinGap = kNikaiMinGapTicks * kNikaiTick;
|
|
|
|
#if SEND_NIKAI
|
|
// Send a Nikai TV formatted message.
|
|
//
|
|
// Args:
|
|
// data: The message to be sent.
|
|
// nbits: The bit size of the message being sent. typically kNikaiBits.
|
|
// repeat: The number of times the message is to be repeated.
|
|
//
|
|
// Status: STABLE / Working.
|
|
//
|
|
// Ref: https://github.com/markszabo/IRremoteESP8266/issues/309
|
|
void IRsend::sendNikai(uint64_t data, uint16_t nbits, uint16_t repeat) {
|
|
sendGeneric(kNikaiHdrMark, kNikaiHdrSpace, kNikaiBitMark, kNikaiOneSpace,
|
|
kNikaiBitMark, kNikaiZeroSpace, kNikaiBitMark, kNikaiMinGap, data,
|
|
nbits, 38, true, repeat, 33);
|
|
}
|
|
#endif
|
|
|
|
#if DECODE_NIKAI
|
|
// Decode the supplied Nikai message.
|
|
//
|
|
// Args:
|
|
// results: Ptr to the data to decode and where to store the decode result.
|
|
// nbits: Nr. of bits to expect in the data portion.
|
|
// Typically kNikaiBits.
|
|
// strict: Flag to indicate if we strictly adhere to the specification.
|
|
// Returns:
|
|
// boolean: True if it can decode it, false if it can't.
|
|
//
|
|
// Status: STABLE / Working.
|
|
//
|
|
bool IRrecv::decodeNikai(decode_results *results, uint16_t nbits, bool strict) {
|
|
if (results->rawlen < 2 * nbits + kHeader + kFooter - 1)
|
|
return false; // Can't possibly be a valid Nikai message.
|
|
if (strict && nbits != kNikaiBits)
|
|
return false; // We expect Nikai to be a certain sized message.
|
|
|
|
uint64_t data = 0;
|
|
uint16_t offset = kStartOffset;
|
|
|
|
// Header
|
|
if (!matchMark(results->rawbuf[offset], kNikaiHdrMark)) return false;
|
|
// Calculate how long the common tick time is based on the header mark.
|
|
uint32_t m_tick = results->rawbuf[offset++] * kRawTick / kNikaiHdrMarkTicks;
|
|
if (!matchSpace(results->rawbuf[offset], kNikaiHdrSpace)) return false;
|
|
// Calculate how long the common tick time is based on the header space.
|
|
uint32_t s_tick = results->rawbuf[offset++] * kRawTick / kNikaiHdrSpaceTicks;
|
|
// Data
|
|
match_result_t data_result =
|
|
matchData(&(results->rawbuf[offset]), nbits, kNikaiBitMarkTicks * m_tick,
|
|
kNikaiOneSpaceTicks * s_tick, kNikaiBitMarkTicks * m_tick,
|
|
kNikaiZeroSpaceTicks * s_tick);
|
|
if (data_result.success == false) return false;
|
|
data = data_result.data;
|
|
offset += data_result.used;
|
|
// Footer
|
|
if (!matchMark(results->rawbuf[offset++], kNikaiBitMarkTicks * m_tick))
|
|
return false;
|
|
if (offset < results->rawlen &&
|
|
!matchAtLeast(results->rawbuf[offset], kNikaiMinGapTicks * s_tick))
|
|
return false;
|
|
|
|
// Compliance
|
|
|
|
// Success
|
|
results->bits = nbits;
|
|
results->value = data;
|
|
results->decode_type = NIKAI;
|
|
results->command = 0;
|
|
results->address = 0;
|
|
return true;
|
|
}
|
|
#endif
|