/******************************************************************************

* The MIT License (MIT)

*

* Copyright (c) 2015-2017 Baldur Karlsson

* Copyright (c) 2014 Crytek

*

* Permission is hereby granted, free of charge, to any person obtaining a copy

* of this software and associated documentation files (the "Software"), to deal

* in the Software without restriction, including without limitation the rights

* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell

* copies of the Software, and to permit persons to whom the Software is

* furnished to do so, subject to the following conditions:

*

* The above copyright notice and this permission notice shall be included in

* all copies or substantial portions of the Software.

*

* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE

* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,

* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN

* THE SOFTWARE.

******************************************************************************/

#pragma once

#include <stdint.h>

#include <stdlib.h>

#include <string.h>

#include <string>

#include <tuple>

#include <vector>

#ifndef DOCUMENT

#define DOCUMENT(text)

#endif

#ifndef DOCUMENT2

#define DOCUMENT2(text1, text2)

#endif

#ifndef DOCUMENT3

#define DOCUMENT3(text1, text2, text3)

#endif

#ifndef DOCUMENT4

#define DOCUMENT4(text1, text2, text3, text4)

#endif

// we provide a basic templated type that is a fixed array that just contains a pointer to the

// element

// array and a size. This could easily map to C as just void* and size but in C++ at least we can be

// type safe.

//

// While we can use STL elsewhere in the main library, we want to expose data to the UI layer as

// fixed

// arrays so that it's a plain C compatible interface.

namespace rdctype

{

template <typename A, typename B>

struct pair

{

A first;

B second;

operator std::tuple<A &, B &>() { return std::tie(first, second); }

};

template <typename A, typename B>

pair<A, B> make_pair(const A &a, const B &b)

{

pair<A, B> ret;

ret.first = a;

ret.second = b;

return ret;

}

template <typename T>

struct array

{

T *elems;

int32_t count;

array() : elems(0), count(0) {}

~array() { Delete(); }

void Delete()

{

for(int32_t i = 0; i < count; i++)

elems[i].~T();

deallocate(elems);

elems = 0;

count = 0;

}

#ifdef RENDERDOC_EXPORTS

static void *allocate(size_t s) { return malloc(s); }

static void deallocate(const void *p) { free((void *)p); }

#else

static void *allocate(size_t s) { return RENDERDOC_AllocArrayMem(s); }

static void deallocate(const void *p) { RENDERDOC_FreeArrayMem(p); }

#endif

T &operator[](size_t i) { return elems[i]; }

const T &operator[](size_t i) const { return elems[i]; }

array(const std::vector<T> &in)

{

elems = 0;

count = 0;

*this = in;

}

array &operator=(const std::vector<T> &in)

{

Delete();

count = (int32_t)in.size();

if(count == 0)

{

elems = 0;

}

else

{

elems = (T *)allocate(sizeof(T) * count);

for(int32_t i = 0; i < count; i++)

new(elems + i) T(in[i]);

}

return *this;

}

array(const std::initializer_list<T> &in)

{

elems = 0;

count = 0;

*this = in;

}

array &operator=(const std::initializer_list<T> &in)

{

Delete();

count = (int32_t)in.size();

if(count == 0)

{

elems = 0;

}

else

{

elems = (T *)allocate(sizeof(T) * count);

int i = 0;

for(const T &t : in)

{

new(elems + i) T(t);

i++;

}

}

return *this;

}

array(const array &o)

{

elems = 0;

count = 0;

*this = o;

}

array &operator=(const array &o)

{

// do nothing if we're self-assigning

if(this == &o)

return *this;

Delete();

count = o.count;

if(count == 0)

{

elems = 0;

}

else

{

elems = (T *)allocate(sizeof(T) * o.count);

for(int32_t i = 0; i < count; i++)

new(elems + i) T(o.elems[i]);

}

return *this;

}

void create(int sz)

{

Delete();

count = sz;

if(sz == 0)

{

elems = 0;

}

else

{

elems = (T *)allocate(sizeof(T) * count);

memset(elems, 0, sizeof(T) * count);

}

}

// provide some of the familiar stl interface

size_t size() const { return (size_t)count; }

void clear() { Delete(); }

bool empty() const { return count == 0; }

T *begin() { return elems ? elems : end(); }

T *end() { return elems ? elems + count : NULL; }

T &front() { return *elems; }

T &back() { return *(elems + count - 1); }

const T *begin() const { return elems ? elems : end(); }

const T *end() const { return elems ? elems + count : NULL; }

const T &front() const { return *elems; }

const T &back() const { return *(elems + count - 1); }

};

DOCUMENT("");

struct str : public rdctype::array<char>

{

str &operator=(const std::string &in);

str &operator=(const char *const in);

str() : rdctype::array<char>() {}

str(const str &o) : rdctype::array<char>() { *this = o; }

str(const std::string &o) : rdctype::array<char>() { *this = o; }

str(const char *const o) : rdctype::array<char>() { *this = o; }

str &operator=(const str &o)

{

// do nothing if we're self-assigning

if(this == &o)

return *this;

Delete();

count = o.count;

if(count == 0)

{

elems = (char *)allocate(sizeof(char));

elems[0] = 0;

}

else

{

elems = (char *)allocate(sizeof(char) * (o.count + 1));

memcpy(elems, o.elems, sizeof(char) * o.count);

elems[count] = 0;

}

return *this;

}

DOCUMENT("");

void assign(const char *const in, int32_t inCount)

{

Delete();

count = inCount;

if(inCount == 0)

{

elems = (char *)allocate(sizeof(char));

elems[0] = 0;

}

else

{

elems = (char *)allocate(sizeof(char) * (inCount + 1));

if(in)

memcpy(elems, in, sizeof(char) * inCount);

elems[count] = 0;

}

}

#if defined(RENDERDOC_QT_COMPAT)

operator QString() const { return QString::fromUtf8(elems, count); }

operator QVariant() const { return QVariant(QString::fromUtf8(elems, count)); }

#endif

operator std::string() const { return std::string(elems, elems + count); }

const char *c_str() const { return elems ? elems : ""; }

bool operator==(const char *const o) const

{

if(!elems)

return o == NULL;

return !strcmp(elems, o);

}

bool operator==(const std::string &o) const { return o == elems; }

bool operator==(const str &o) const { return *this == (const char *const)o.elems; }

bool operator!=(const char *const o) const { return !(*this == o); }

bool operator!=(const std::string &o) const { return !(*this == o); }

bool operator!=(const str &o) const { return !(*this == o); }

};

inline str &str::operator=(const std::string &in)

{

Delete();

count = (int32_t)in.size();

if(count == 0)

{

elems = (char *)allocate(sizeof(char));

elems[0] = 0;

}

else

{

elems = (char *)allocate(sizeof(char) * (count + 1));

memcpy(elems, &in[0], sizeof(char) * in.size());

elems[count] = 0;

}

return *this;

}

inline str &str::operator=(const char *const in)

{

Delete();

count = (int32_t)strlen(in);

if(count == 0)

{

elems = (char *)allocate(sizeof(char));

elems[0] = 0;

}

else

{

elems = (char *)allocate(sizeof(char) * (count + 1));

memcpy(elems, &in[0], sizeof(char) * count);

elems[count] = 0;

}

return *this;

}

}; // namespace rdctype