jamulus/src/protocol.cpp

512 lines
13 KiB
C++
Raw Normal View History

/******************************************************************************\
* Copyright (c) 2004-2006
*
* Author(s):
* Volker Fischer
*
Protocol message definition
2006-03-01 20:46:44 +01:00
---------------------------
- All messages received need to be acknowledged by an acknowledge packet
MAIN FRAME
----------
+------------+------------+------------------+--------------+-------------+
| 2 bytes ID | 1 byte cnt | 2 bytes length n | n bytes data | 2 bytes CRC |
+------------+------------+------------------+--------------+-------------+
- message ID defined by the defines PROTMESSID_x
2006-02-19 09:14:21 +01:00
- cnt: counter which is increment for each message and wraps around at 255
- length n in bytes of the data
- actual data, dependent on message type
- 16 bits CRC, calculating over the entire message, is transmitted inverted
Generator polynom: G_16(x) = x^16 + x^12 + x^5 + 1, initial state: all ones
MESSAGES
--------
- Acknowledgement message: PROTMESSID_ACKN
2006-03-01 20:46:44 +01:00
+-----------------------------------+
| 2 bytes ID of message to be ackn. |
+-----------------------------------+
note: the cnt value is the same as of the message to be acknowledged
- Jitter buffer size: PROTMESSID_JITT_BUF_SIZE
+--------------------------+
| 2 bytes number of blocks |
+--------------------------+
- Request jitter buffer size: PROTMESSID_REQ_JITT_BUF_SIZE
note: does not have any data -> n = 0
*
******************************************************************************
*
* This program is free software; you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free Software
* Foundation; either version 2 of the License, or (at your option) any later
* version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License along with
* this program; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
\******************************************************************************/
#include "protocol.h"
/* Implementation *************************************************************/
2006-03-04 11:24:40 +01:00
CProtocol::CProtocol() : iCounter ( 0 ), iOldRecID ( PROTMESSID_ILLEGAL ),
iOldRecCnt ( 0 )
{
SendMessQueue.clear();
2006-02-26 11:50:47 +01:00
2006-03-04 11:24:40 +01:00
// connections
QObject::connect ( &TimerSendMess, SIGNAL ( timeout() ),
this, SLOT ( OnTimerSendMess() ) );
2006-02-26 11:50:47 +01:00
}
2006-03-04 11:24:40 +01:00
void CProtocol::EnqueueMessage ( CVector<uint8_t>& vecMessage,
const int iCnt,
const int iID )
{
2006-03-08 19:52:55 +01:00
bool bListWasEmpty;
Mutex.lock();
{
// check if list is empty so that we have to initiate a send process
bListWasEmpty = SendMessQueue.empty();
}
2006-03-08 19:54:09 +01:00
Mutex.unlock();
2006-02-26 11:50:47 +01:00
2006-03-04 11:24:40 +01:00
// create send message object for the queue
CSendMessage SendMessageObj ( vecMessage, iCnt, iID );
Mutex.lock();
{
// we want to have a FIFO: we add at the end and take from the beginning
SendMessQueue.push_back ( SendMessageObj );
}
Mutex.unlock();
2006-03-04 11:24:40 +01:00
// if list was empty, initiate send process
if ( bListWasEmpty )
{
SendMessage();
}
}
2006-02-26 11:50:47 +01:00
2006-03-04 11:24:40 +01:00
void CProtocol::SendMessage()
{
CVector<uint8_t> vecMessage;
bool bSendMess = false;
Mutex.lock();
{
// we have to check that list is not empty, since in another thread the
// last element of the list might have been erased
if ( !SendMessQueue.empty() )
{
vecMessage.Init ( SendMessQueue.front().vecMessage.Size() );
vecMessage = SendMessQueue.front().vecMessage;
bSendMess = true;
}
}
Mutex.unlock();
if ( bSendMess )
2006-03-04 11:24:40 +01:00
{
// send message
emit MessReadyForSending ( vecMessage );
2006-02-26 11:50:47 +01:00
2006-03-04 11:24:40 +01:00
// start time-out timer if not active
if ( !TimerSendMess.isActive() )
{
TimerSendMess.start ( SEND_MESS_TIMEOUT_MS );
}
}
else
{
// no message to send, stop timer
TimerSendMess.stop();
}
}
2006-02-26 11:50:47 +01:00
2006-03-06 18:04:07 +01:00
void CProtocol::CreateAndSendAcknMess ( const int& iID, const int& iCnt )
{
CVector<uint8_t> vecAcknMessage;
CVector<uint8_t> vecData ( 2 ); // 2 bytes of data
unsigned int iPos = 0; // init position pointer
// build data vector
PutValOnStream ( vecData, iPos, static_cast<uint32_t> ( iID ), 2 );
// build complete message
GenMessageFrame ( vecAcknMessage, iCnt, PROTMESSID_ACKN, vecData );
// immediately send acknowledge message
emit MessReadyForSending ( vecAcknMessage );
}
2006-03-07 21:22:52 +01:00
void CProtocol::DeleteSendMessQueue()
2006-03-06 18:04:07 +01:00
{
2006-03-06 20:18:25 +01:00
Mutex.lock();
{
// delete complete "send message queue"
SendMessQueue.clear();
2006-03-06 20:18:25 +01:00
}
Mutex.unlock();
2006-03-04 11:24:40 +01:00
}
2006-02-26 11:50:47 +01:00
bool CProtocol::ParseMessage ( const CVector<unsigned char>& vecbyData,
const int iNumBytes )
{
/*
return code: true -> ok; false -> error
*/
bool bRet;
int iRecCounter, iRecID, iData;
unsigned int iPos;
CVector<uint8_t> vecData;
bool bSendNextMess;
2006-02-19 18:24:30 +01:00
2006-02-26 11:50:47 +01:00
// convert unsigned char in uint8_t, TODO convert all buffers in uint8_t
2006-02-26 12:53:38 +01:00
CVector<uint8_t> vecbyDataConv ( iNumBytes );
for ( int i = 0; i < iNumBytes; i++ ) {
vecbyDataConv[i] = static_cast<uint8_t> ( vecbyData[i] );
}
2006-02-19 18:24:30 +01:00
2006-02-26 12:53:38 +01:00
// important: vecbyDataConv must have iNumBytes to get it work!!!
if ( ParseMessageFrame ( vecbyDataConv, iRecCounter, iRecID, vecData ) )
{
// In case we received a message and returned an answer but our answer
// did not make it to the receiver, he will resend his message. We check
// here if the message is the same as the old one, and if this is the
// case, just resend our old answer again
if ( ( iOldRecID == iRecID ) && ( iOldRecCnt == iRecCounter ) )
2006-03-01 20:46:44 +01:00
{
// acknowledgments are not acknowledged
if ( iRecID != PROTMESSID_ACKN )
2006-03-01 20:46:44 +01:00
{
// re-send acknowledgement
CreateAndSendAcknMess ( iRecID, iRecCounter );
2006-03-01 20:46:44 +01:00
}
}
else
{
// check which type of message we received and do action
switch ( iRecID )
2006-03-01 20:46:44 +01:00
{
case PROTMESSID_ACKN:
2006-02-19 18:24:30 +01:00
// extract data from stream and emit signal for received value
iPos = 0;
iData = static_cast<int> ( GetValFromStream ( vecData, iPos, 2 ) );
2006-02-26 12:01:30 +01:00
Mutex.lock();
{
2006-03-06 18:04:07 +01:00
// check if this is the correct acknowledgment
if ( ( SendMessQueue.front().iCnt == iRecCounter ) &&
( SendMessQueue.front().iID == iData ) )
{
// message acknowledged, remove from queue
SendMessQueue.pop_front();
2006-02-19 18:24:30 +01:00
2006-03-06 18:04:07 +01:00
// send next message in queue
bSendNextMess = true;
}
else
{
bSendNextMess = false;
2006-03-06 18:04:07 +01:00
}
}
Mutex.unlock();
2006-02-19 18:24:30 +01:00
if ( bSendNextMess )
{
SendMessage();
}
break;
case PROTMESSID_JITT_BUF_SIZE:
// extract data from stream and emit signal for received value
iPos = 0;
iData = static_cast<int> ( GetValFromStream ( vecData, iPos, 2 ) );
2006-03-04 11:24:40 +01:00
// invoke message action
emit ChangeJittBufSize ( iData );
// send acknowledge message
CreateAndSendAcknMess ( iRecID, iRecCounter );
break;
case PROTMESSID_REQ_JITT_BUF_SIZE:
// invoke message action
emit ReqJittBufSize();
// send acknowledge message
CreateAndSendAcknMess ( iRecID, iRecCounter );
break;
2006-03-01 20:46:44 +01:00
}
}
2006-02-19 18:24:30 +01:00
// save current message ID and counter to find out if message was re-sent
iOldRecID = iRecID;
iOldRecCnt = iRecCounter;
2006-03-01 20:46:44 +01:00
bRet = true; // everything was ok
}
else
{
bRet = false; // return error code
2006-03-06 19:33:23 +01:00
}
2006-03-06 20:18:25 +01:00
return bRet;
2006-03-01 20:46:44 +01:00
}
2006-02-26 11:50:47 +01:00
void CProtocol::CreateJitBufMes ( const int iJitBufSize )
{
CVector<uint8_t> vecNewMessage;
CVector<uint8_t> vecData ( 2 ); // 2 bytes of data
int iCurCounter;
unsigned int iPos = 0; // init position pointer
2006-03-06 20:18:25 +01:00
Mutex.lock();
{
2006-03-06 18:04:07 +01:00
// store current counter value
iCurCounter = iCounter;
2006-02-26 11:50:47 +01:00
2006-03-06 18:04:07 +01:00
// increase counter (wraps around automatically)
iCounter++;
}
Mutex.unlock();
2006-02-26 11:50:47 +01:00
// build data vector
PutValOnStream ( vecData, iPos, static_cast<uint32_t> ( iJitBufSize ), 2 );
2006-03-04 17:49:11 +01:00
// build complete message
GenMessageFrame ( vecNewMessage, iCurCounter, PROTMESSID_JITT_BUF_SIZE, vecData );
2006-03-04 17:49:11 +01:00
// enqueue message
EnqueueMessage ( vecNewMessage, iCurCounter, PROTMESSID_JITT_BUF_SIZE );
}
2006-02-19 18:24:30 +01:00
void CProtocol::CreateReqJitBufMes()
{
CVector<uint8_t> vecNewMessage;
int iCurCounter;
Mutex.lock();
{
// store current counter value
iCurCounter = iCounter;
// increase counter (wraps around automatically)
iCounter++;
}
Mutex.unlock();
// build complete message
GenMessageFrame ( vecNewMessage, iCurCounter, PROTMESSID_REQ_JITT_BUF_SIZE, CVector<uint8_t> ( 0 ) );
// enqueue message
EnqueueMessage ( vecNewMessage, iCurCounter, PROTMESSID_REQ_JITT_BUF_SIZE );
}
2006-02-19 18:24:30 +01:00
/******************************************************************************\
* Message generation (parsing) *
\******************************************************************************/
bool CProtocol::ParseMessageFrame ( const CVector<uint8_t>& vecIn,
int& iCnt,
int& iID,
CVector<uint8_t>& vecData )
2006-02-19 09:14:21 +01:00
{
/*
return code: true -> ok; false -> error
*/
2006-02-19 17:35:35 +01:00
int iLenBy, i;
2006-02-19 09:14:21 +01:00
unsigned int iCurPos;
// query length of input vector
const int iVecInLenByte = vecIn.Size();
// vector must be at least "MESS_LEN_WITHOUT_DATA_BYTE" bytes long
if ( iVecInLenByte < MESS_LEN_WITHOUT_DATA_BYTE )
{
return false; // return error code
}
2006-02-26 12:49:28 +01:00
2006-02-19 09:14:21 +01:00
// decode header -----
iCurPos = 0; // start from beginning
/* 2 bytes ID */
iID = static_cast<int> ( GetValFromStream ( vecIn, iCurPos, 2 ) );
2006-02-19 09:14:21 +01:00
/* 1 byte cnt */
iCnt = static_cast<int> ( GetValFromStream ( vecIn, iCurPos, 1 ) );
/* 2 bytes length */
iLenBy = static_cast<int> ( GetValFromStream ( vecIn, iCurPos, 2 ) );
2006-02-19 09:14:21 +01:00
// make sure the length is correct
if ( iLenBy != iVecInLenByte - MESS_LEN_WITHOUT_DATA_BYTE )
{
return false; // return error code
}
2006-02-26 12:49:28 +01:00
2006-02-19 09:14:21 +01:00
// now check CRC -----
CCRC CRCObj;
const int iLenCRCCalc = MESS_HEADER_LENGTH_BYTE + iLenBy;
2006-02-19 17:35:35 +01:00
iCurPos = 0; // start from beginning
2006-02-19 09:14:21 +01:00
for ( i = 0; i < iLenCRCCalc; i++ )
{
CRCObj.AddByte ( static_cast<uint8_t> (
GetValFromStream ( vecIn, iCurPos, 1 ) ) );
}
if ( CRCObj.GetCRC () != GetValFromStream ( vecIn, iCurPos, 2 ) )
{
return false; // return error code
}
2006-02-26 12:49:28 +01:00
2006-02-19 17:35:35 +01:00
// decode data -----
2006-02-26 13:18:37 +01:00
vecData.Init ( iLenBy );
2006-02-19 17:35:35 +01:00
iCurPos = MESS_HEADER_LENGTH_BYTE; // start from beginning of data
for ( i = 0; i < iLenBy; i++ )
{
vecData[i] = static_cast<uint8_t> (
GetValFromStream ( vecIn, iCurPos, 1 ) );
}
2006-02-19 09:14:21 +01:00
return true; // everything was ok
}
uint32_t CProtocol::GetValFromStream ( const CVector<uint8_t>& vecIn,
unsigned int& iPos,
const unsigned int iNumOfBytes )
{
/*
note: iPos is automatically incremented in this function
*/
// 4 bytes maximum since we return uint32
ASSERT ( ( iNumOfBytes > 0 ) && ( iNumOfBytes <= 4 ) );
ASSERT ( vecIn.Size() >= iPos + iNumOfBytes );
uint32_t iRet = 0;
for ( int i = 0; i < iNumOfBytes; i++ )
{
iRet |= vecIn[iPos] << ( i * 8 /* size of byte */ );
iPos++;
2006-02-19 09:14:21 +01:00
}
return iRet;
}
void CProtocol::GenMessageFrame ( CVector<uint8_t>& vecOut,
const int iCnt,
const int iID,
const CVector<uint8_t>& vecData )
{
2006-02-19 17:35:35 +01:00
int i;
// query length of data vector
const int iDataLenByte = vecData.Size();
// total length of message = 7 + "iDataLenByte"
// 2 byte ID + 1 byte cnt + 2 byte length + n bytes data + 2 bytes CRC
const int iTotLenByte = 7 + iDataLenByte;
// init message vector
vecOut.Init( iTotLenByte );
// encode header -----
unsigned int iCurPos = 0; // init position pointer
/* 2 bytes ID */
PutValOnStream ( vecOut, iCurPos,
static_cast<uint32_t> ( iID ), 2 );
/* 1 byte cnt */
PutValOnStream ( vecOut, iCurPos,
static_cast<uint32_t> ( iCnt ), 1 );
/* 2 bytes length */
PutValOnStream ( vecOut, iCurPos,
static_cast<uint32_t> ( iDataLenByte ), 2 );
2006-02-19 17:35:35 +01:00
// encode data -----
for ( i = 0; i < iDataLenByte; i++ )
{
PutValOnStream ( vecOut, iCurPos,
static_cast<uint32_t> ( vecData[i] ), 1 );
}
2006-02-19 17:35:35 +01:00
// encode CRC -----
CCRC CRCObj;
iCurPos = 0; // start from beginning
2006-02-19 17:35:35 +01:00
const int iLenCRCCalc = MESS_HEADER_LENGTH_BYTE + iDataLenByte;
for ( i = 0; i < iLenCRCCalc; i++ )
{
CRCObj.AddByte ( static_cast<uint8_t> (
GetValFromStream ( vecOut, iCurPos, 1 ) ) );
}
2006-02-19 17:35:35 +01:00
PutValOnStream ( vecOut, iCurPos,
static_cast<uint32_t> ( CRCObj.GetCRC () ), 2 );
}
void CProtocol::PutValOnStream ( CVector<uint8_t>& vecIn,
unsigned int& iPos,
const uint32_t iVal,
const unsigned int iNumOfBytes )
{
/*
note: iPos is automatically incremented in this function
*/
// 4 bytes maximum since we use uint32
ASSERT ( ( iNumOfBytes > 0 ) && ( iNumOfBytes <= 4 ) );
ASSERT ( vecIn.Size() >= iPos + iNumOfBytes );
for ( int i = 0; i < iNumOfBytes; i++ )
{
vecIn[iPos] =
( iVal >> ( i * 8 /* size of byte */ ) ) & 255 /* 11111111 */;
iPos++;
}
}