scsl/TLV.cc

168 lines
2.6 KiB
C++
Raw Normal View History

2023-10-06 03:13:46 +00:00
#include <cstring>
#include "TLV.h"
using namespace klib;
2023-10-06 03:13:46 +00:00
#define REC_SIZE(x) ((std::size_t)x.Len + 2)
namespace klib {
2023-10-06 03:13:46 +00:00
namespace TLV {
static bool
2023-10-06 06:08:35 +00:00
spaceAvailable(Arena &arena, uint8_t *cursor, uint8_t len)
2023-10-06 03:13:46 +00:00
{
if (cursor == NULL) {
return false;
}
return arena.CursorInArena(cursor + len);
2023-10-06 03:13:46 +00:00
}
2023-10-06 06:08:35 +00:00
static inline void
clearUnused(Record &rec)
{
uint8_t trail = TLV_MAX_LEN - rec.Len;
2023-10-06 06:08:35 +00:00
memset(rec.Val + rec.Len, 0, trail);
2023-10-06 06:08:35 +00:00
}
2023-10-06 03:13:46 +00:00
uint8_t *
2023-10-06 06:08:35 +00:00
WriteToMemory(Arena &arena, uint8_t *cursor, Record &rec)
2023-10-06 03:13:46 +00:00
{
// If cursor is NULL, the user needs us to select an empty
// slot for the record. If we can't find one, that's an
// error.
//
// If, however, the user gives us a cursor, we'll trust it
2023-10-06 06:08:35 +00:00
// (though spaceAvailable will sanity check that cursor).
2023-10-06 03:13:46 +00:00
if (cursor == NULL) {
2023-10-06 06:08:35 +00:00
cursor = FindEmpty(arena, cursor);
2023-10-06 03:13:46 +00:00
if (cursor == NULL) {
return NULL;
}
}
2023-10-06 06:08:35 +00:00
if (!spaceAvailable(arena, cursor, rec.Len)) {
2023-10-06 03:13:46 +00:00
return NULL;
}
memcpy(cursor, &rec, REC_SIZE(rec));
2023-10-06 06:08:35 +00:00
cursor = SkipRecord(rec, cursor);
2023-10-06 03:13:46 +00:00
return cursor;
}
void
2023-10-06 06:08:35 +00:00
SetRecord(Record &rec, uint8_t tag, uint8_t len, const char *val)
2023-10-06 03:13:46 +00:00
{
rec.Tag = tag;
rec.Len = len;
memcpy(rec.Val, val, len);
2023-10-06 06:08:35 +00:00
clearUnused(rec);
2023-10-06 03:13:46 +00:00
}
void
2023-10-06 06:08:35 +00:00
ReadFromMemory(Record &rec, uint8_t *cursor)
2023-10-06 03:13:46 +00:00
{
rec.Tag = cursor[0];
rec.Len = cursor[1];
memcpy(rec.Val, cursor + 2, rec.Len);
2023-10-06 06:08:35 +00:00
clearUnused(rec);
2023-10-06 03:13:46 +00:00
}
/*
* returns a pointer to memory where the record was found,
2023-10-06 06:08:35 +00:00
* e.g. FindTag(...)[0] is the tag of the found record.
2023-10-06 03:13:46 +00:00
*/
uint8_t *
2023-10-06 06:08:35 +00:00
FindTag(Arena &arena, uint8_t *cursor, Record &rec)
{
cursor = LocateTag(arena, cursor, rec);
if (rec.Tag != TAG_EMPTY) {
cursor = SkipRecord(rec, cursor);
}
return cursor;
}
uint8_t *
LocateTag(Arena &arena, uint8_t *cursor, Record &rec)
2023-10-06 03:13:46 +00:00
{
uint8_t tag, len;
2023-10-06 03:13:46 +00:00
if (cursor == NULL) {
cursor = arena.NewCursor();
2023-10-06 03:13:46 +00:00
}
while ((tag = cursor[0]) != rec.Tag) {
len = cursor[1];
2023-10-06 06:08:35 +00:00
if (!spaceAvailable(arena, cursor, len)) {
2023-10-06 03:13:46 +00:00
return NULL;
}
cursor += len;
cursor += 2;
}
if (tag != rec.Tag) {
return NULL;
}
if (tag != TAG_EMPTY) {
2023-10-06 06:08:35 +00:00
ReadFromMemory(rec, cursor);
2023-10-06 03:13:46 +00:00
}
return cursor;
}
uint8_t *
FindEmpty(Arena &arena, uint8_t *cursor)
{
Record rec;
2023-10-06 03:13:46 +00:00
rec.Tag = TAG_EMPTY;
2023-10-06 06:08:35 +00:00
return FindTag(arena, cursor, rec);
2023-10-06 03:13:46 +00:00
}
uint8_t *
2023-10-06 06:08:35 +00:00
SkipRecord(Record &rec, uint8_t *cursor)
2023-10-06 03:13:46 +00:00
{
return (uint8_t *) ((uintptr_t) cursor + rec.Len + 2);
2023-10-06 03:13:46 +00:00
}
void
2023-10-06 06:08:35 +00:00
DeleteRecord(Arena &arena, uint8_t *cursor)
2023-10-06 03:13:46 +00:00
{
if (cursor == NULL) {
return;
}
uint8_t len = cursor[1] + 2;
uint8_t *stop = arena.NewCursor() + arena.Size();
2023-10-06 03:13:46 +00:00
stop -= len;
while (cursor != stop) {
cursor[0] = cursor[len];
cursor++;
}
stop += len;
while (cursor != stop) {
cursor[0] = 0;
cursor++;
}
2023-10-06 03:13:46 +00:00
}
} // namespace TLV
} // namespace klib