2013-05-03 06:02:03 +00:00
|
|
|
/**
|
2013-06-06 14:01:32 +00:00
|
|
|
* Copyright (c) 2007-2013, Timothy Stack
|
2013-05-03 06:02:03 +00:00
|
|
|
*
|
|
|
|
* All rights reserved.
|
2013-05-28 04:35:00 +00:00
|
|
|
*
|
2013-05-03 06:02:03 +00:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
2013-05-28 04:35:00 +00:00
|
|
|
*
|
2013-05-03 06:02:03 +00:00
|
|
|
* * 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.
|
2013-05-28 04:35:00 +00:00
|
|
|
*
|
2013-05-03 06:02:03 +00:00
|
|
|
* 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;
|
2022-03-16 22:38:08 +00:00
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
2013-05-03 06:02:03 +00:00
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
2020-08-31 05:13:56 +00:00
|
|
|
#ifndef byte_array_hh
|
|
|
|
#define byte_array_hh
|
2011-06-06 02:05:46 +00:00
|
|
|
|
2022-03-16 22:38:08 +00:00
|
|
|
#include <ostream>
|
|
|
|
#include <string>
|
|
|
|
|
2013-05-31 15:01:31 +00:00
|
|
|
#include <stdio.h>
|
2011-06-06 02:05:46 +00:00
|
|
|
#include <string.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
2019-05-08 12:30:59 +00:00
|
|
|
#include "base/lnav_log.hh"
|
2022-03-25 23:38:11 +00:00
|
|
|
#include "fmt/format.h"
|
2014-03-06 14:58:49 +00:00
|
|
|
|
2014-02-04 17:26:25 +00:00
|
|
|
template<size_t COUNT, typename T = unsigned char>
|
2011-06-06 02:05:46 +00:00
|
|
|
struct byte_array {
|
2021-02-01 23:56:37 +00:00
|
|
|
static constexpr size_t BYTE_COUNT = COUNT * sizeof(T);
|
|
|
|
static constexpr size_t STRING_SIZE = BYTE_COUNT * 2 + 1;
|
2014-02-04 17:26:25 +00:00
|
|
|
|
2022-04-30 20:05:42 +00:00
|
|
|
byte_array() {}
|
2013-05-28 04:35:00 +00:00
|
|
|
|
2022-03-16 22:38:08 +00:00
|
|
|
byte_array(const byte_array& other)
|
2013-05-28 04:35:00 +00:00
|
|
|
{
|
|
|
|
memcpy(this->ba_data, other.ba_data, BYTE_COUNT);
|
2022-04-30 20:05:42 +00:00
|
|
|
}
|
2013-05-28 04:35:00 +00:00
|
|
|
|
2022-03-16 22:38:08 +00:00
|
|
|
bool operator<(const byte_array& other) const
|
2013-05-28 04:35:00 +00:00
|
|
|
{
|
|
|
|
return memcmp(this->ba_data, other.ba_data, BYTE_COUNT) < 0;
|
2022-04-30 20:05:42 +00:00
|
|
|
}
|
2013-05-24 14:55:56 +00:00
|
|
|
|
2022-03-16 22:38:08 +00:00
|
|
|
bool operator!=(const byte_array& other) const
|
2013-05-28 04:35:00 +00:00
|
|
|
{
|
|
|
|
return memcmp(this->ba_data, other.ba_data, BYTE_COUNT) != 0;
|
2022-04-30 20:05:42 +00:00
|
|
|
}
|
2013-05-24 14:55:56 +00:00
|
|
|
|
2022-03-16 22:38:08 +00:00
|
|
|
bool operator==(const byte_array& other) const
|
2021-02-01 23:56:37 +00:00
|
|
|
{
|
|
|
|
return memcmp(this->ba_data, other.ba_data, BYTE_COUNT) == 0;
|
2022-04-30 20:05:42 +00:00
|
|
|
}
|
2021-02-01 23:56:37 +00:00
|
|
|
|
2022-04-30 20:05:42 +00:00
|
|
|
void clear() { memset(this->ba_data, 0, BYTE_COUNT); }
|
2013-06-12 04:10:59 +00:00
|
|
|
|
2022-03-25 23:38:11 +00:00
|
|
|
template<typename OutputIt>
|
|
|
|
void to_string(OutputIt out) const
|
2013-06-16 01:07:50 +00:00
|
|
|
{
|
2013-05-31 15:01:31 +00:00
|
|
|
for (size_t lpc = 0; lpc < BYTE_COUNT; lpc++) {
|
2022-03-25 23:38:11 +00:00
|
|
|
fmt::format_to(out, FMT_STRING("{:02x}"), this->ba_data[lpc]);
|
2013-05-31 15:01:31 +00:00
|
|
|
}
|
2022-03-25 23:38:11 +00:00
|
|
|
}
|
2013-05-31 15:01:31 +00:00
|
|
|
|
2021-02-01 23:56:37 +00:00
|
|
|
std::string to_string() const
|
2013-06-16 01:07:50 +00:00
|
|
|
{
|
2022-03-25 23:38:11 +00:00
|
|
|
std::string retval;
|
2013-06-02 21:20:15 +00:00
|
|
|
|
2022-03-25 23:38:11 +00:00
|
|
|
retval.reserve(STRING_SIZE);
|
|
|
|
this->to_string(std::back_inserter(retval));
|
|
|
|
return retval;
|
2013-06-02 21:20:15 +00:00
|
|
|
}
|
|
|
|
|
2022-04-30 20:05:42 +00:00
|
|
|
const unsigned char* in() const { return this->ba_data; }
|
2014-02-04 17:26:25 +00:00
|
|
|
|
2022-03-16 22:38:08 +00:00
|
|
|
T* out(int offset = 0)
|
|
|
|
{
|
|
|
|
T* ptr = (T*) this->ba_data;
|
2014-02-04 17:26:25 +00:00
|
|
|
|
|
|
|
return &ptr[offset];
|
2022-04-30 20:05:42 +00:00
|
|
|
}
|
2013-05-31 15:01:31 +00:00
|
|
|
|
2021-02-01 23:56:37 +00:00
|
|
|
unsigned char ba_data[BYTE_COUNT];
|
2011-06-06 02:05:46 +00:00
|
|
|
};
|
2021-02-01 23:56:37 +00:00
|
|
|
|
|
|
|
template<size_t COUNT, typename T = unsigned char>
|
2022-03-16 22:38:08 +00:00
|
|
|
std::ostream&
|
|
|
|
operator<<(std::ostream& os, const byte_array<COUNT, T>& ba)
|
2021-02-01 23:56:37 +00:00
|
|
|
{
|
|
|
|
os << ba.to_string();
|
|
|
|
return os;
|
|
|
|
}
|
|
|
|
|
2011-06-06 02:05:46 +00:00
|
|
|
#endif
|