mirror of https://github.com/tstack/lnav
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
95 lines
2.9 KiB
C++
95 lines
2.9 KiB
C++
/**
|
|
* Copyright (c) 2007-2013, Timothy Stack
|
|
*
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
* * Neither the name of Timothy Stack nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
|
|
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
|
|
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
#ifndef __byte_array_hh
|
|
#define __byte_array_hh
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <sys/types.h>
|
|
|
|
#include <string>
|
|
|
|
#include "base/lnav_log.hh"
|
|
|
|
template<size_t COUNT, typename T = unsigned char>
|
|
struct byte_array {
|
|
static const size_t BYTE_COUNT = COUNT * sizeof(T);
|
|
static const size_t STRING_SIZE = BYTE_COUNT * 2 + 1;
|
|
|
|
byte_array() { };
|
|
|
|
byte_array(const byte_array &other)
|
|
{
|
|
memcpy(this->ba_data, other.ba_data, BYTE_COUNT);
|
|
};
|
|
|
|
bool operator<(const byte_array &other) const
|
|
{
|
|
return memcmp(this->ba_data, other.ba_data, BYTE_COUNT) < 0;
|
|
};
|
|
|
|
bool operator!=(const byte_array &other) const
|
|
{
|
|
return memcmp(this->ba_data, other.ba_data, BYTE_COUNT) != 0;
|
|
};
|
|
|
|
void clear()
|
|
{
|
|
memset(this->ba_data, 0, BYTE_COUNT);
|
|
};
|
|
|
|
void to_string(char *buffer) const
|
|
{
|
|
require(buffer != NULL);
|
|
|
|
for (size_t lpc = 0; lpc < BYTE_COUNT; lpc++) {
|
|
snprintf(&buffer[lpc * 2], 3, "%02x", this->ba_data[lpc]);
|
|
}
|
|
};
|
|
|
|
std::string to_string() const
|
|
{
|
|
char buffer[STRING_SIZE];
|
|
|
|
this->to_string(buffer);
|
|
return std::string(buffer);
|
|
}
|
|
|
|
const unsigned char *in() const { return this->ba_data; };
|
|
|
|
T *out(int offset = 0) {
|
|
T *ptr = (T *)this->ba_data;
|
|
|
|
return &ptr[offset];
|
|
};
|
|
|
|
unsigned char ba_data[BYTE_COUNT];
|
|
};
|
|
#endif
|