1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/***************************************************************************
* Copyright (C) 2005-2006 Nicolas Hadacek <hadacek@kde.org> *
* *
* 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. *
***************************************************************************/
#include "misc.h"
#include <unistd.h>
#include <tqregexp.h>
#include <tqtimer.h>
#include "number.h"
//-----------------------------------------------------------------------------
uchar bin2bcd(uchar bin)
{
char h = bin / 10;
char l = bin % 10;
return (h*16) + l;
}
uchar bcd2bin(uchar bcd)
{
char h = bcd / 16;
char l = bcd % 16;
return (h*10) + l;
}
TQString escapeXml(const TQString &cs)
{
TQString s;
for (uint i=0; i<uint(cs.length()); i++) {
if ( cs[i]=='<' ) s += "<";
else if ( cs[i]=='>' ) s += ">";
else s += cs[i];
}
return s;
}
TQString htmlTableRow(const TQString &title, const TQString &value)
{
return "<tr><td>" + title + ":</td><td>" + value + "</td></tr>";
}
void crash(const char *assert, const char *file, int line)
{
qDebug("CRASH_ASSERT: \"%s\" in %s (%d)", assert, file, line);
int * ptr = 0;
(*ptr)++;
}
bool checkAvailable(const TQByteArray &data, uint offset, uint nbBytes)
{
return ( offset+nbBytes<=uint(data.size()) );
}
TQ_UINT32 getULong(const TQByteArray &data, uint offset, uint nbBytes, bool *ok)
{
Q_ASSERT( nbBytes<=8 );
if ( !checkAvailable(data, offset, nbBytes) ) {
if (ok) *ok = false;
return 0;
}
if (ok) *ok = true;
TQ_UINT32 r = 0;
for (uint i=0; i<nbBytes; i++) r += TQ_UINT8(data[offset+i]) << (8*i);
return r;
}
|
