2020-09-20 14:16:44 +02:00
|
|
|
/* Copyright (C) 2002-2005 RealVNC Ltd. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* This 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 software 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 software; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
|
|
|
|
* USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <rdr/HexInStream.h>
|
|
|
|
#include <rdr/Exception.h>
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
|
|
|
|
using namespace rdr;
|
|
|
|
|
|
|
|
const int DEFAULT_BUF_LEN = 16384;
|
|
|
|
|
|
|
|
static inline int min(int a, int b) {return a<b ? a : b;}
|
|
|
|
|
2019-09-23 11:00:17 +02:00
|
|
|
HexInStream::HexInStream(InStream& is, size_t bufSize_)
|
2020-09-20 14:16:44 +02:00
|
|
|
: bufSize(bufSize_ ? bufSize_ : DEFAULT_BUF_LEN), offset(0), in_stream(is)
|
|
|
|
{
|
|
|
|
ptr = end = start = new U8[bufSize];
|
|
|
|
}
|
|
|
|
|
|
|
|
HexInStream::~HexInStream() {
|
|
|
|
delete [] start;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool HexInStream::readHexAndShift(char c, int* v) {
|
|
|
|
c=tolower(c);
|
|
|
|
if ((c >= '0') && (c <= '9'))
|
|
|
|
*v = (*v << 4) + (c - '0');
|
|
|
|
else if ((c >= 'a') && (c <= 'f'))
|
|
|
|
*v = (*v << 4) + (c - 'a' + 10);
|
|
|
|
else
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2019-09-23 11:00:17 +02:00
|
|
|
bool HexInStream::hexStrToBin(const char* s, char** data, size_t* length) {
|
|
|
|
size_t l=strlen(s);
|
2020-09-20 14:16:44 +02:00
|
|
|
if ((l % 2) == 0) {
|
|
|
|
delete [] *data;
|
|
|
|
*data = 0; *length = 0;
|
|
|
|
if (l == 0)
|
|
|
|
return true;
|
|
|
|
*data = new char[l/2];
|
|
|
|
*length = l/2;
|
2019-09-23 11:00:17 +02:00
|
|
|
for(size_t i=0;i<l;i+=2) {
|
2020-09-20 14:16:44 +02:00
|
|
|
int byte = 0;
|
|
|
|
if (!readHexAndShift(s[i], &byte) ||
|
|
|
|
!readHexAndShift(s[i+1], &byte))
|
|
|
|
goto decodeError;
|
|
|
|
(*data)[i/2] = byte;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
decodeError:
|
|
|
|
delete [] *data;
|
|
|
|
*data = 0;
|
|
|
|
*length = 0;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-09-23 11:00:17 +02:00
|
|
|
size_t HexInStream::pos() {
|
2020-09-20 14:16:44 +02:00
|
|
|
return offset + ptr - start;
|
|
|
|
}
|
|
|
|
|
2019-09-23 11:00:17 +02:00
|
|
|
size_t HexInStream::overrun(size_t itemSize, size_t nItems, bool wait) {
|
2020-09-20 14:16:44 +02:00
|
|
|
if (itemSize > bufSize)
|
|
|
|
throw Exception("HexInStream overrun: max itemSize exceeded");
|
|
|
|
|
|
|
|
if (end - ptr != 0)
|
|
|
|
memmove(start, ptr, end - ptr);
|
|
|
|
|
|
|
|
end -= ptr - start;
|
|
|
|
offset += ptr - start;
|
|
|
|
ptr = start;
|
|
|
|
|
2019-09-24 09:41:07 +02:00
|
|
|
while ((size_t)(end - ptr) < itemSize) {
|
2019-09-23 11:00:17 +02:00
|
|
|
size_t n = in_stream.check(2, 1, wait);
|
2020-09-20 14:16:44 +02:00
|
|
|
if (n == 0) return 0;
|
|
|
|
const U8* iptr = in_stream.getptr();
|
|
|
|
const U8* eptr = in_stream.getend();
|
2019-09-23 11:00:17 +02:00
|
|
|
size_t length = min((eptr - iptr)/2, start + bufSize - end);
|
2020-09-20 14:16:44 +02:00
|
|
|
|
|
|
|
U8* optr = (U8*) end;
|
2019-09-23 11:00:17 +02:00
|
|
|
for (size_t i=0; i<length; i++) {
|
2020-09-20 14:16:44 +02:00
|
|
|
int v = 0;
|
|
|
|
readHexAndShift(iptr[i*2], &v);
|
|
|
|
readHexAndShift(iptr[i*2+1], &v);
|
|
|
|
optr[i] = v;
|
|
|
|
}
|
|
|
|
|
|
|
|
in_stream.setptr(iptr + length*2);
|
|
|
|
end += length;
|
|
|
|
}
|
|
|
|
|
2019-09-24 09:41:07 +02:00
|
|
|
size_t nAvail;
|
|
|
|
nAvail = (end - ptr) / itemSize;
|
|
|
|
if (nAvail < nItems)
|
|
|
|
return nAvail;
|
2020-09-20 14:16:44 +02:00
|
|
|
|
|
|
|
return nItems;
|
|
|
|
}
|