mirror of
https://github.com/VDR4Arch/vdr.git
synced 2023-10-10 13:36:52 +02:00
347 lines
11 KiB
C++
347 lines
11 KiB
C++
/*
|
|
* tools.h: Various tools
|
|
*
|
|
* See the main source file 'vdr.c' for copyright information and
|
|
* how to reach the author.
|
|
*
|
|
* $Id: tools.h 1.87 2005/12/29 15:48:46 kls Exp $
|
|
*/
|
|
|
|
#ifndef __TOOLS_H
|
|
#define __TOOLS_H
|
|
|
|
#include <dirent.h>
|
|
#include <errno.h>
|
|
#include <fcntl.h>
|
|
#include <poll.h>
|
|
#include <stddef.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <syslog.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/types.h>
|
|
|
|
typedef unsigned char uchar;
|
|
typedef unsigned long long int uint64;
|
|
|
|
extern int SysLogLevel;
|
|
|
|
#define esyslog(a...) void( (SysLogLevel > 0) ? syslog(LOG_ERR, a) : void() )
|
|
#define isyslog(a...) void( (SysLogLevel > 1) ? syslog(LOG_INFO, a) : void() )
|
|
#define dsyslog(a...) void( (SysLogLevel > 2) ? syslog(LOG_DEBUG, a) : void() )
|
|
|
|
#define LOG_ERROR esyslog("ERROR (%s,%d): %m", __FILE__, __LINE__)
|
|
#define LOG_ERROR_STR(s) esyslog("ERROR: %s: %m", s)
|
|
|
|
#define SECSINDAY 86400
|
|
|
|
#define KILOBYTE(n) ((n) * 1024)
|
|
#define MEGABYTE(n) ((n) * 1024 * 1024)
|
|
|
|
#define MALLOC(type, size) (type *)malloc(sizeof(type) * (size))
|
|
|
|
#define DELETENULL(p) (delete (p), p = NULL)
|
|
|
|
#define CHECK(s) { if ((s) < 0) LOG_ERROR; } // used for 'ioctl()' calls
|
|
#define FATALERRNO (errno && errno != EAGAIN && errno != EINTR)
|
|
|
|
#ifndef __STL_CONFIG_H // in case some plugin needs to use the STL
|
|
template<class T> inline T min(T a, T b) { return a <= b ? a : b; }
|
|
template<class T> inline T max(T a, T b) { return a >= b ? a : b; }
|
|
template<class T> inline int sgn(T a) { return a < 0 ? -1 : a > 0 ? 1 : 0; }
|
|
template<class T> inline void swap(T &a, T &b) { T t = a; a = b; b = t; }
|
|
#endif
|
|
|
|
#define BCDCHARTOINT(x) (10 * ((x & 0xF0) >> 4) + (x & 0xF))
|
|
int BCD2INT(int x);
|
|
|
|
// Unfortunately there are no platform independent macros for unaligned
|
|
// access. so we do it this way:
|
|
|
|
template<class T> inline T get_unaligned(T *p)
|
|
{
|
|
struct s { T v; } __attribute__((packed));
|
|
return ((s *)p)->v;
|
|
}
|
|
|
|
template<class T> inline void put_unaligned(unsigned int v, T* p)
|
|
{
|
|
struct s { T v; } __attribute__((packed));
|
|
((s *)p)->v = v;
|
|
}
|
|
|
|
class cString {
|
|
private:
|
|
char *s;
|
|
public:
|
|
cString(const char *S = NULL, bool TakePointer = false);
|
|
cString(const cString &String);
|
|
virtual ~cString();
|
|
operator const char * () const { return s; } // for use in (const char *) context
|
|
const char * operator*() const { return s; } // for use in (const void *) context (printf() etc.)
|
|
cString &operator=(const cString &String);
|
|
static cString sprintf(const char *fmt, ...) __attribute__ ((format (printf, 1, 2)));
|
|
};
|
|
|
|
ssize_t safe_read(int filedes, void *buffer, size_t size);
|
|
ssize_t safe_write(int filedes, const void *buffer, size_t size);
|
|
void writechar(int filedes, char c);
|
|
int WriteAllOrNothing(int fd, const uchar *Data, int Length, int TimeoutMs = 0, int RetryMs = 0);
|
|
///< Writes either all Data to the given file descriptor, or nothing at all.
|
|
///< If TimeoutMs is greater than 0, it will only retry for that long, otherwise
|
|
///< it will retry forever. RetryMs defines the time between two retries.
|
|
char *strcpyrealloc(char *dest, const char *src);
|
|
char *strn0cpy(char *dest, const char *src, size_t n);
|
|
char *strreplace(char *s, char c1, char c2);
|
|
char *strreplace(char *s, const char *s1, const char *s2); ///< re-allocates 's' and deletes the original string if necessary!
|
|
char *skipspace(const char *s);
|
|
char *stripspace(char *s);
|
|
char *compactspace(char *s);
|
|
cString strescape(const char *s, const char *chars);
|
|
bool startswith(const char *s, const char *p);
|
|
bool endswith(const char *s, const char *p);
|
|
bool isempty(const char *s);
|
|
int numdigits(int n);
|
|
bool isnumber(const char *s);
|
|
cString itoa(int n);
|
|
cString AddDirectory(const char *DirName, const char *FileName);
|
|
int FreeDiskSpaceMB(const char *Directory, int *UsedMB = NULL);
|
|
bool DirectoryOk(const char *DirName, bool LogErrors = false);
|
|
bool MakeDirs(const char *FileName, bool IsDirectory = false);
|
|
bool RemoveFileOrDir(const char *FileName, bool FollowSymlinks = false);
|
|
bool RemoveEmptyDirectories(const char *DirName, bool RemoveThis = false);
|
|
int DirSizeMB(const char *DirName); ///< returns the total size of the files in the given directory, or -1 in case of an error
|
|
char *ReadLink(const char *FileName); ///< returns a new string allocated on the heap, which the caller must delete (or NULL in case of an error)
|
|
bool SpinUpDisk(const char *FileName);
|
|
void TouchFile(const char *FileName);
|
|
time_t LastModifiedTime(const char *FileName);
|
|
cString WeekDayName(int WeekDay);
|
|
cString WeekDayName(time_t t);
|
|
cString DayDateTime(time_t t = 0);
|
|
cString TimeToString(time_t t);
|
|
cString DateString(time_t t);
|
|
cString TimeString(time_t t);
|
|
uchar *RgbToJpeg(uchar *Mem, int Width, int Height, int &Size, int Quality = 100);
|
|
///< Converts the given Memory to a JPEG image and returns a pointer
|
|
///< to the resulting image. Mem must point to a data block of exactly
|
|
///< (Width * Height) triplets of RGB image data bytes. Upon return, Size
|
|
///< will hold the number of bytes of the resulting JPEG data.
|
|
///< Quality can be in the range 0..100 and controls the quality of the
|
|
///< resulting image, where 100 is "best". The caller takes ownership of
|
|
///< the result and has to delete it once it is no longer needed.
|
|
///< The result may be NULL in case of an error.
|
|
|
|
class cBase64Encoder {
|
|
private:
|
|
const uchar *data;
|
|
int length;
|
|
int maxResult;
|
|
int i;
|
|
char *result;
|
|
static const char *b64;
|
|
public:
|
|
cBase64Encoder(const uchar *Data, int Length, int MaxResult = 64);
|
|
///< Sets up a new base 64 encoder for the given Data, with the given Length.
|
|
///< Data will not be copied and must be valid for the entire lifetime of the
|
|
///< encoder. MaxResult defines the maximum number of characters in any
|
|
///< result line. The resulting lines may be shorter than MaxResult in case
|
|
///< its value is not a multiple of 4.
|
|
~cBase64Encoder();
|
|
const char *NextLine(void);
|
|
///< Returns the next line of encoded data (terminated by '\0'), or NULL if
|
|
///< there is no more encoded data. The caller must call NextLine() and process
|
|
///< each returned line until NULL is returned, in order to get the entire
|
|
///< data encoded.
|
|
};
|
|
|
|
class cTimeMs {
|
|
private:
|
|
uint64 begin;
|
|
public:
|
|
cTimeMs(void);
|
|
static uint64 Now(void);
|
|
void Set(int Ms = 0);
|
|
bool TimedOut(void);
|
|
uint64 Elapsed(void);
|
|
};
|
|
|
|
class cReadLine {
|
|
private:
|
|
size_t size;
|
|
char *buffer;
|
|
public:
|
|
cReadLine(void);
|
|
~cReadLine();
|
|
char *Read(FILE *f);
|
|
};
|
|
|
|
class cPoller {
|
|
private:
|
|
enum { MaxPollFiles = 16 };
|
|
pollfd pfd[MaxPollFiles];
|
|
int numFileHandles;
|
|
public:
|
|
cPoller(int FileHandle = -1, bool Out = false);
|
|
bool Add(int FileHandle, bool Out);
|
|
bool Poll(int TimeoutMs = 0);
|
|
};
|
|
|
|
class cReadDir {
|
|
private:
|
|
DIR *directory;
|
|
struct dirent *result;
|
|
union { // according to "The GNU C Library Reference Manual"
|
|
struct dirent d;
|
|
char b[offsetof(struct dirent, d_name) + NAME_MAX + 1];
|
|
} u;
|
|
public:
|
|
cReadDir(const char *Directory);
|
|
~cReadDir();
|
|
bool Ok(void) { return directory != NULL; }
|
|
struct dirent *Next(void);
|
|
};
|
|
|
|
class cFile {
|
|
private:
|
|
static bool files[];
|
|
static int maxFiles;
|
|
int f;
|
|
public:
|
|
cFile(void);
|
|
~cFile();
|
|
operator int () { return f; }
|
|
bool Open(const char *FileName, int Flags, mode_t Mode = DEFFILEMODE);
|
|
bool Open(int FileDes);
|
|
void Close(void);
|
|
bool IsOpen(void) { return f >= 0; }
|
|
bool Ready(bool Wait = true);
|
|
static bool AnyFileReady(int FileDes = -1, int TimeoutMs = 1000);
|
|
static bool FileReady(int FileDes, int TimeoutMs = 1000);
|
|
static bool FileReadyForWriting(int FileDes, int TimeoutMs = 1000);
|
|
};
|
|
|
|
class cSafeFile {
|
|
private:
|
|
FILE *f;
|
|
char *fileName;
|
|
char *tempName;
|
|
public:
|
|
cSafeFile(const char *FileName);
|
|
~cSafeFile();
|
|
operator FILE* () { return f; }
|
|
bool Open(void);
|
|
bool Close(void);
|
|
};
|
|
|
|
/// cUnbufferedFile is used for large files that are mainly written or read
|
|
/// in a streaming manner, and thus should not be cached.
|
|
|
|
class cUnbufferedFile {
|
|
private:
|
|
int fd;
|
|
off_t begin;
|
|
off_t end;
|
|
off_t ahead;
|
|
ssize_t written;
|
|
public:
|
|
cUnbufferedFile(void);
|
|
~cUnbufferedFile();
|
|
int Open(const char *FileName, int Flags, mode_t Mode = DEFFILEMODE);
|
|
int Close(void);
|
|
off_t Seek(off_t Offset, int Whence);
|
|
ssize_t Read(void *Data, size_t Size);
|
|
ssize_t Write(const void *Data, size_t Size);
|
|
static cUnbufferedFile *Create(const char *FileName, int Flags, mode_t Mode = DEFFILEMODE);
|
|
};
|
|
|
|
class cLockFile {
|
|
private:
|
|
char *fileName;
|
|
int f;
|
|
public:
|
|
cLockFile(const char *Directory);
|
|
~cLockFile();
|
|
bool Lock(int WaitSeconds = 0);
|
|
void Unlock(void);
|
|
};
|
|
|
|
class cListObject {
|
|
private:
|
|
cListObject *prev, *next;
|
|
public:
|
|
cListObject(void);
|
|
virtual ~cListObject();
|
|
virtual int Compare(const cListObject &ListObject) const { return 0; }
|
|
///< Must return 0 if this object is equal to ListObject, a positive value
|
|
///< if it is "greater", and a negative value if it is "smaller".
|
|
void Append(cListObject *Object);
|
|
void Insert(cListObject *Object);
|
|
void Unlink(void);
|
|
int Index(void) const;
|
|
cListObject *Prev(void) const { return prev; }
|
|
cListObject *Next(void) const { return next; }
|
|
};
|
|
|
|
class cListBase {
|
|
protected:
|
|
cListObject *objects, *lastObject;
|
|
cListBase(void);
|
|
int count;
|
|
public:
|
|
virtual ~cListBase();
|
|
void Add(cListObject *Object, cListObject *After = NULL);
|
|
void Ins(cListObject *Object, cListObject *Before = NULL);
|
|
void Del(cListObject *Object, bool DeleteObject = true);
|
|
virtual void Move(int From, int To);
|
|
void Move(cListObject *From, cListObject *To);
|
|
virtual void Clear(void);
|
|
cListObject *Get(int Index) const;
|
|
int Count(void) const { return count; }
|
|
void Sort(void);
|
|
};
|
|
|
|
template<class T> class cList : public cListBase {
|
|
public:
|
|
T *Get(int Index) const { return (T *)cListBase::Get(Index); }
|
|
T *First(void) const { return (T *)objects; }
|
|
T *Last(void) const { return (T *)lastObject; }
|
|
T *Prev(const T *object) const { return (T *)object->cListObject::Prev(); } // need to call cListObject's members to
|
|
T *Next(const T *object) const { return (T *)object->cListObject::Next(); } // avoid ambiguities in case of a "list of lists"
|
|
};
|
|
|
|
class cHashObject : public cListObject {
|
|
friend class cHashBase;
|
|
private:
|
|
unsigned int id;
|
|
cListObject *object;
|
|
public:
|
|
cHashObject(cListObject *Object, unsigned int Id) { object = Object; id = Id; }
|
|
cListObject *Object(void) { return object; }
|
|
};
|
|
|
|
class cHashBase {
|
|
private:
|
|
cList<cHashObject> **hashTable;
|
|
int size;
|
|
unsigned int hashfn(unsigned int Id) const { return Id % size; }
|
|
protected:
|
|
cHashBase(int Size);
|
|
public:
|
|
virtual ~cHashBase();
|
|
void Add(cListObject *Object, unsigned int Id);
|
|
void Del(cListObject *Object, unsigned int Id);
|
|
void Clear(void);
|
|
cListObject *Get(unsigned int Id) const;
|
|
cList<cHashObject> *GetList(unsigned int Id) const;
|
|
};
|
|
|
|
#define HASHSIZE 512
|
|
|
|
template<class T> class cHash : public cHashBase {
|
|
public:
|
|
cHash(int Size = HASHSIZE) : cHashBase(Size) {}
|
|
T *Get(unsigned int Id) const { return (T *)cHashBase::Get(Id); }
|
|
};
|
|
|
|
#endif //__TOOLS_H
|