/usr/include/flext/flcontainers.h is in pd-flext-dev 0.6.0+git20161101.1.01318a94-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 | /*
flext - C++ layer for Max and Pure Data externals
Copyright (c) 2001-2015 Thomas Grill (gr@grrrr.org)
For information on usage and redistribution, and for a DISCLAIMER OF ALL
WARRANTIES, see the file, "license.txt," in this distribution.
*/
/*! \file flcontainers.h
\brief Lock-free container classes
*/
#ifndef __FLCONTAINERS_H
#define __FLCONTAINERS_H
#include "flprefix.h"
#include "lockfree/stack.hpp"
#include "lockfree/fifo.hpp"
#include "flpushns.h"
class LifoCell: public lockfree::stack_node {};
class Lifo
: public lockfree::intrusive_stack<LifoCell>
{
public:
inline void Push(LifoCell *cell) { this->push(cell); }
inline LifoCell *Pop() { return this->pop(); }
inline bool Avail() const { return !this->empty(); }
};
template <typename T>
class TypedLifo
: public Lifo
{
public:
inline void Push(T *c) { Lifo::Push(static_cast<T *>(c)); }
inline T *Pop() { return static_cast<T *>(Lifo::Pop()); }
};
template <typename T>
class ValueLifoCell
: public LifoCell
{
public:
ValueLifoCell(T v): value(v) {}
T value;
};
template <typename T>
class ValueLifo
: public TypedLifo<ValueLifoCell<T> >
{
public:
inline void Push(T v)
{
TypedLifo<ValueLifoCell<T> >::Push(new ValueLifoCell<T>(v));
}
inline T Pop()
{
ValueLifoCell<T> *p = TypedLifo<ValueLifoCell<T> >::Pop();
T v = p->value;
delete p;
return v;
}
};
template <typename T,int M = 2,int O = 1>
class PooledLifo
: public TypedLifo<T>
{
public:
PooledLifo(): sz(0),resz(0) {}
void Push(T *c) { TypedLifo<T>::Push(c); ++sz; }
T *Pop() { T *r = TypedLifo<T>::Pop(); if(r) --sz; return r; }
T *New()
{
T *n = reuse.Pop();
if(n) {
--resz;
return n;
}
else
return new T;
}
inline void Free(T *p)
{
if(resz < sz*M+O) { reuse.Push(p); ++resz; }
else delete p;
}
private:
TypedLifo<T> reuse;
size_t sz,resz;
};
class FifoCell: public lockfree::fifo_node {};
class Fifo
: public lockfree::intrusive_fifo<FifoCell>
{
public:
inline void Put(FifoCell *cl) { this->enqueue(cl); }
inline FifoCell *Get() { return this->dequeue(); }
inline bool Avail() const { return !this->empty(); }
};
template <typename T>
class TypedFifo
: public Fifo
{
public:
inline void Put(T *c) { Fifo::Put(static_cast<T *>(c)); }
inline T *Get() { return static_cast<T *>(Fifo::Get()); }
};
template <typename T>
class ValueFifoCell
: public FifoCell
{
public:
ValueFifoCell(T v): value(v) {}
T value;
};
template <typename T>
class ValueFifo
: public TypedFifo<ValueFifoCell<T> >
{
public:
inline void Put(T v)
{
TypedFifo<ValueFifoCell<T> >::Put(new ValueFifoCell<T>(v));
}
inline T Get()
{
ValueFifoCell<T> *p = TypedFifo<ValueFifoCell<T> >::Get();
T v = p->value;
delete p;
return v;
}
};
template <typename T,int M = 2,int O = 1>
class PooledFifo
: public TypedFifo<T>
{
public:
~PooledFifo() { T *n; while((n = reuse.Get()) != NULL) delete n; }
inline T *New() { T *n = reuse.Get(); return n?n:new T; }
inline void Free(T *p) { if(resz < sz*M+O) reuse.Put(p); else delete p; }
private:
TypedFifo<T> reuse;
size_t sz,resz;
};
#include "flpopns.h"
#endif
|