Commit a97d5c7c authored by Nicolas Denoyelle's avatar Nicolas Denoyelle

split files and add tleaf iterator

parent 4e08270a
......@@ -2,6 +2,6 @@ AM_CFLAGS = -Wall -Werror -pedantic
lib_LTLIBRARIES = libexcit.la
libexcit_la_SOURCES = excit.c excit.h
libexcit_la_SOURCES = excit.c tleaf.c range.c slice.c repeat.c prod.c cons.c hilbert2d.c
include_HEADERS = excit.h
#include "cons.h"
#define EXCIT_DATA(data, it) \
if(data == NULL) { return EXCIT_EINVAL; } \
do{ \
int err = excit_get_data(data, (void**)(&it)); \
if(err != EXCIT_SUCCESS) { return err; } \
} while(0); \
if(it == NULL){ return EXCIT_EINVAL; }
static void circular_fifo_add(struct circular_fifo_s *fifo, ssize_t elem)
{
if (fifo->size == fifo->length) {
fifo->start = (fifo->start + 1) % fifo->length;
fifo->end = (fifo->end + 1) % fifo->length;
} else {
fifo->end = (fifo->end + 1) % fifo->length;
fifo->size++;
}
fifo->buffer[fifo->end] = elem;
}
static void circular_fifo_dump(const struct circular_fifo_s *fifo,
ssize_t *vals)
{
ssize_t i;
ssize_t j;
for (i = 0, j = fifo->start; i < fifo->size; i++) {
vals[i] = fifo->buffer[j];
j = (j + 1) % fifo->length;
}
}
struct excit_func_table_s excit_cons_func_table = {
cons_it_alloc,
cons_it_free,
cons_it_copy,
cons_it_next,
cons_it_peek,
cons_it_size,
cons_it_rewind,
cons_it_split,
cons_it_nth,
cons_it_rank,
cons_it_pos
};
int cons_it_alloc(excit_t data)
{
struct cons_it_s *it;
EXCIT_DATA(data, it);
it->it = NULL;
it->n = 0;
it->fifo.length = 0;
it->fifo.start = 0;
it->fifo.end = -1;
it->fifo.size = 0;
it->fifo.buffer = NULL;
return EXCIT_SUCCESS;
}
void cons_it_free(excit_t data)
{
struct cons_it_s *it;
if(data == NULL) { return ; }
int err = excit_get_data(data, (void**)(&it));
if(err != EXCIT_SUCCESS) { return; }
if(it == NULL){ return; }
excit_free(it->it);
free(it->fifo.buffer);
}
int cons_it_copy(excit_t ddst, const excit_t dsrc)
{
struct cons_it_s *dst;
EXCIT_DATA(ddst, dst);
const struct cons_it_s *src;
EXCIT_DATA(dsrc, src);
excit_t copy = excit_dup(src->it);
if (!copy)
return -EXCIT_EINVAL;
dst->it = copy;
dst->n = src->n;
dst->fifo.length = src->fifo.length;
dst->fifo.start = src->fifo.start;
dst->fifo.end = src->fifo.end;
dst->fifo.size = src->fifo.size;
dst->fifo.buffer =
(ssize_t *) malloc(src->fifo.length * sizeof(ssize_t));
if (!dst->fifo.buffer) {
excit_free(copy);
return -EXCIT_ENOMEM;
}
for (int i = 0; i < dst->fifo.length; i++)
dst->fifo.buffer[i] = src->fifo.buffer[i];
return EXCIT_SUCCESS;
}
int cons_it_size(const excit_t data, ssize_t *size)
{
const struct cons_it_s *it;
EXCIT_DATA(data, it);
ssize_t tmp_size = 0;
int err = excit_size(it->it, &tmp_size);
if (err)
return err;
*size = tmp_size - (it->n - 1);
return EXCIT_SUCCESS;
}
int cons_it_split(const excit_t data, ssize_t n, excit_t *results)
{
ssize_t size;
int err = cons_it_size(data, &size);
if (err)
return err;
if (size < n)
return -EXCIT_EDOM;
if (!results)
return EXCIT_SUCCESS;
excit_t range = excit_alloc(EXCIT_RANGE);
if (!range)
return -EXCIT_ENOMEM;
err = excit_range_init(range, 0, size - 1, 1);
if (err)
goto error1;
err = excit_split(range, n, results);
if (err)
goto error1;
int i;
for (i = 0; i < n; i++) {
excit_t tmp, tmp2;
tmp = excit_dup(data);
if (!tmp)
goto error2;
tmp2 = results[i];
results[i] = excit_alloc(EXCIT_SLICE);
if (!results[i]) {
excit_free(tmp2);
goto error2;
}
err = excit_slice_init(results[i], tmp, tmp2);
if (err) {
excit_free(tmp2);
goto error2;
}
}
excit_free(range);
return EXCIT_SUCCESS;
error2:
for (; i >= 0; i--)
excit_free(results[i]);
error1:
excit_free(range);
return err;
}
int cons_it_nth(const excit_t data, ssize_t n, ssize_t *indexes)
{
ssize_t size;
int err = cons_it_size(data, &size);
if (err)
return err;
if (n < 0 || n >= size)
return -EXCIT_EDOM;
const struct cons_it_s *it;
EXCIT_DATA(data, it);
int dim = excit_get_dimension(it->it);
if (indexes) {
for (int i = 0; i < it->n; i++) {
err = excit_nth(it->it, n + i, indexes + dim * i);
if (err)
return err;
}
}
return EXCIT_SUCCESS;
}
int cons_it_rank(const excit_t data, const ssize_t *indexes, ssize_t *n)
{
const struct cons_it_s *it;
EXCIT_DATA(data, it);
ssize_t inner_n, inner_n_tmp;
int err = excit_rank(it->it, indexes, &inner_n);
if (err)
return err;
int dim = excit_get_dimension(it->it);
for (int i = 1; i < it->n; i++) {
err = excit_rank(it->it, indexes + dim * i, &inner_n_tmp);
if (err)
return err;
if (inner_n_tmp != inner_n + 1)
return -EXCIT_EINVAL;
inner_n = inner_n_tmp;
}
if (n)
*n = inner_n - (it->n - 1);
return EXCIT_SUCCESS;
}
int cons_it_pos(const excit_t data, ssize_t *n)
{
ssize_t inner_n;
const struct cons_it_s *it;
EXCIT_DATA(data, it);
int err = excit_pos(it->it, &inner_n);
if (err)
return err;
if (n)
*n = inner_n - (it->n - 1);
return EXCIT_SUCCESS;
}
int cons_it_peek(const excit_t data, ssize_t *indexes)
{
const struct cons_it_s *it;
EXCIT_DATA(data, it);
int err;
int dim = excit_get_dimension(it->it);
int n = it->n;
if (indexes) {
circular_fifo_dump(&it->fifo, indexes);
err = excit_peek(it->it, indexes + dim * (n - 1));
} else
err = excit_peek(it->it, NULL);
if (err)
return err;
return EXCIT_SUCCESS;
}
int cons_it_next(excit_t data, ssize_t *indexes)
{
struct cons_it_s *it;
EXCIT_DATA(data, it);
int err;
int dim = excit_get_dimension(it->it);
int n = it->n;
if (indexes) {
circular_fifo_dump(&it->fifo, indexes);
err = excit_next(it->it, indexes + dim * (n - 1));
} else
err = excit_next(it->it, NULL);
if (err)
return err;
if (indexes)
for (int i = dim * (n - 1); i < dim * n; i++)
circular_fifo_add(&it->fifo, indexes[i]);
return EXCIT_SUCCESS;
}
int cons_it_rewind(excit_t data)
{
struct cons_it_s *it;
EXCIT_DATA(data, it);
int err = excit_rewind(it->it);
if (err)
return err;
it->fifo.start = 0;
it->fifo.end = -1;
it->fifo.size = 0;
for (int i = 0; i < it->n - 1; i++) {
int err;
err =
excit_next(it->it, it->fifo.buffer + excit_get_dimension(it->it) * i);
if (err)
return err;
it->fifo.size += excit_get_dimension(it->it);
it->fifo.end += excit_get_dimension(it->it);
}
return EXCIT_SUCCESS;
}
int excit_cons_init(excit_t it, excit_t src, ssize_t n)
{
ssize_t src_size;
int err;
if (!it || !src || n <= 0)
return -EXCIT_EINVAL;
err = excit_size(src, &src_size);
if (err)
return err;
if (src_size < n)
return -EXCIT_EINVAL;
struct cons_it_s *cons_it;
EXCIT_DATA(it, cons_it);
free(cons_it->fifo.buffer);
excit_free(cons_it->it);
excit_set_dimension(it, excit_get_dimension(src) * n);
cons_it->it = src;
cons_it->n = n;
cons_it->fifo.length = excit_get_dimension(src) * (n - 1);
cons_it->fifo.buffer =
(ssize_t *) malloc(cons_it->fifo.length * sizeof(ssize_t));
if (!cons_it->fifo.buffer)
return -EXCIT_ENOMEM;
err = cons_it_rewind(it);
if (err) {
free(cons_it->fifo.buffer);
return err;
}
return EXCIT_SUCCESS;
}
#ifndef CONS_H
#define CONS_H
#include "excit.h"
struct circular_fifo_s {
ssize_t length;
ssize_t start;
ssize_t end;
ssize_t size;
ssize_t *buffer;
};
struct cons_it_s {
excit_t it;
ssize_t n;
struct circular_fifo_s fifo;
};
int cons_it_alloc(excit_t data);
void cons_it_free(excit_t data);
int cons_it_copy(excit_t ddst, const excit_t dsrc);
int cons_it_size(const excit_t data, ssize_t *size);
int cons_it_split(const excit_t data, ssize_t n, excit_t *results);
int cons_it_nth(const excit_t data, ssize_t n, ssize_t *indexes);
int cons_it_rank(const excit_t data, const ssize_t *indexes, ssize_t *n);
int cons_it_pos(const excit_t data, ssize_t *n);
int cons_it_peek(const excit_t data, ssize_t *indexes);
int cons_it_next(excit_t data, ssize_t *indexes);
int cons_it_rewind(excit_t data);
extern struct excit_func_table_s excit_cons_func_table;
#endif
This diff is collapsed.
#ifndef EXCIT_H
#define EXCIT_H 1
#include <stdlib.h>
/*
* The different types of iterator supported. All iterators use the same
* integer type (ssize_t) for values.
......@@ -13,6 +15,7 @@ enum excit_type_e {
EXCIT_HILBERT2D, /*!< Hilbert space filing curve */
EXCIT_PRODUCT, /*!< Iterator over the catesian product of iterators */
EXCIT_SLICE, /*!< Iterator using another iterator to index a third */
EXCIT_TLEAF, /*!< Iterator on leaves of a balanced tree */
EXCIT_USER, /*!< User-defined iterator */
EXCIT_TYPE_MAX /*!< Guard */
};
......@@ -50,16 +53,23 @@ typedef struct excit_s *excit_t;
******************************************************************************/
/*
* Sets the dimension of a user-defined iterator.
* "it": a user-defined iterator.
* Sets the dimension of a (user-defined) iterator.
* "it": a (user-defined) iterator.
* "dimension": the new dimension of the iterator.
* Returns EXCIT_SUCCESS or an error code.
*/
int excit_set_dimension(excit_t it, ssize_t dimension);
/*
* Gets the inner data pointer of a user-defined iterator.
* "it": a user-defined iterator.
* Gets the dimension of an iterator.
* "it": the iterator.
* Returns the dimension or -1 if it is NULL.
*/
ssize_t excit_get_dimension(excit_t it);
/*
* Gets the inner data pointer of a (user-defined) iterator.
* "it": a (user-defined) iterator.
* "data": a pointer to a pointer variable where the result will be written.
* Returns EXCIT_SUCCESS or an error code.
*/
......@@ -245,7 +255,7 @@ int excit_size(const excit_t it, ssize_t *size);
* "it": an iterator.
* "n": number of iterators desired.
* "results": an array of at least n excit_t, or NULL in which case no iterator
* is created.
/ * is created.
* Returns EXCIT_SUCCESS, -EXCIT_EDOM if the source iterator is too small to be
* subdivised in the wanted number or an error code.
*/
......@@ -383,4 +393,21 @@ int excit_product_split_dim(const excit_t it, ssize_t dim, ssize_t n,
* Returns EXCIT_SUCCESS or an error code.
*/
int excit_slice_init(excit_t it, excit_t src, excit_t indexer);
enum tleaf_it_policy_e {
ROUND_ROBIN, /* Iterate on tree leaves in a round-robin fashion */
SCATTER /* Iterate on tree leaves such spreading as much as possible */
};
/*
* Initialize a tleaf iterator by giving its depth, levels arity and iteration policy.
* "it": a tleaf iterator
* "depth": the total number of levels of the tree, including leaves
* "arity": For each level, the number of children attached to a node. Leaves have no children, hence last level arity must be 0.
* "iter_policy": A policy for iteration on leaves.
*/
int excit_tleaf_init(excit_t it, const ssize_t depth, const ssize_t* arity, const enum tleaf_it_policy_e iter_policy);
#endif
#include "hilbert2d.h"
struct excit_func_table_s excit_hilbert2d_func_table = {
hilbert2d_it_alloc,
hilbert2d_it_free,
hilbert2d_it_copy,
hilbert2d_it_next,
hilbert2d_it_peek,
hilbert2d_it_size,
hilbert2d_it_rewind,
hilbert2d_it_split,
hilbert2d_it_nth,
hilbert2d_it_rank,
hilbert2d_it_pos
};
#define EXCIT_DATA(data, it) \
if(data == NULL) { return EXCIT_EINVAL; } \
do{ \
int err = excit_get_data(data, (void**)(&it)); \
if(err != EXCIT_SUCCESS) { return err; } \
} while(0); \
if(it == NULL){ return EXCIT_EINVAL; }
/* Helper functions from: https://en.wikipedia.org/wiki/Hilbert_curve */
//rotate/flip a quadrant appropriately
static void rot(ssize_t n, ssize_t *x, ssize_t *y, ssize_t rx, ssize_t ry)
{
if (ry == 0) {
if (rx == 1) {
*x = n - 1 - *x;
*y = n - 1 - *y;
}
//Swap x and y
ssize_t t = *x;
*x = *y;
*y = t;
}
}
//convert (x,y) to d
static ssize_t xy2d(ssize_t n, ssize_t x, ssize_t y)
{
ssize_t rx, ry, s, d = 0;
for (s = n / 2; s > 0; s /= 2) {
rx = (x & s) > 0;
ry = (y & s) > 0;
d += s * s * ((3 * rx) ^ ry);
rot(s, &x, &y, rx, ry);
}
return d;
}
//convert d to (x,y)
static void d2xy(ssize_t n, ssize_t d, ssize_t *x, ssize_t *y)
{
ssize_t rx, ry, s, t = d;
*x = *y = 0;
for (s = 1; s < n; s *= 2) {
rx = 1 & (t / 2);
ry = 1 & (t ^ rx);
rot(s, x, y, rx, ry);
*x += s * rx;
*y += s * ry;
t /= 4;
}
}
/* End helper functions */
int hilbert2d_it_alloc(excit_t data)
{
struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
it->n = 0;
it->range_it = NULL;
return EXCIT_SUCCESS;
}
void hilbert2d_it_free(excit_t data)
{
struct hilbert2d_it_s *it;
if(data == NULL) { return ; }
int err = excit_get_data(data, (void**)(&it));
if(err != EXCIT_SUCCESS) { return; }
if(it == NULL){ return; }
excit_free(it->range_it);
}
int hilbert2d_it_copy(excit_t ddst, const excit_t dsrc)
{
struct hilbert2d_it_s *dst;
EXCIT_DATA(ddst, dst);
const struct hilbert2d_it_s *src;
EXCIT_DATA(dsrc, src);
excit_t copy = excit_dup(src->range_it);
if (!copy)
return -EXCIT_EINVAL;
dst->range_it = copy;
dst->n = src->n;
return EXCIT_SUCCESS;
}
int hilbert2d_it_rewind(excit_t data)
{
struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
return excit_rewind(it->range_it);
}
int hilbert2d_it_peek(const excit_t data, ssize_t *val)
{
struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
ssize_t d;
int err;
err = excit_peek(it->range_it, &d);
if (err)
return err;
if (val)
d2xy(it->n, d, val, val + 1);
return EXCIT_SUCCESS;
}
int hilbert2d_it_next(excit_t data, ssize_t *val)
{
struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
ssize_t d;
int err = excit_next(it->range_it, &d);
if (err)
return err;
if (val)
d2xy(it->n, d, val, val + 1);
return EXCIT_SUCCESS;
}
int hilbert2d_it_size(const excit_t data, ssize_t *size)
{
const struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
return excit_size(it->range_it, size);
}
int hilbert2d_it_nth(const excit_t data, ssize_t n, ssize_t *val)
{
ssize_t d;
struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
int err = excit_nth(it->range_it, n, &d);
if (err)
return err;
if (val)
d2xy(it->n, d, val, val + 1);
return EXCIT_SUCCESS;
}
int hilbert2d_it_rank(const excit_t data, const ssize_t *indexes,
ssize_t *n)
{
struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
if (indexes[0] < 0 || indexes[0] >= it->n || indexes[1] < 0
|| indexes[1] >= it->n)
return -EXCIT_EINVAL;
ssize_t d = xy2d(it->n, indexes[0], indexes[1]);
return excit_rank(it->range_it, &d, n);
}
int hilbert2d_it_pos(const excit_t data, ssize_t *n)
{
struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
return excit_pos(it->range_it, n);
}
int hilbert2d_it_split(const excit_t data, ssize_t n, excit_t *results)
{
const struct hilbert2d_it_s *it;
EXCIT_DATA(data, it);
int err = excit_split(it->range_it, n, results);
if (err)
return err;
if (!results)
return EXCIT_SUCCESS;
for (int i = 0; i < n; i++) {
excit_t tmp;
tmp = results[i];
results[i] = excit_alloc(EXCIT_HILBERT2D);
if (!results[i]) {
excit_free(tmp);
err = -EXCIT_ENOMEM;
goto error;
}
excit_set_dimension(results[i], 2);
struct hilbert2d_it_s *res_it;
EXCIT_DATA(results[i], res_it);
res_it->n = it->n;
res_it->range_it = tmp;
}
return EXCIT_SUCCESS;
error:
for (int i = 0; i < n; i++)
excit_free(results[i]);
return err;
}
int excit_hilbert2d_init(excit_t it, ssize_t order)
{
struct hilbert2d_it_s *hilbert2d_it;
if (!it || order <= 0)
return -EXCIT_EINVAL;
excit_set_dimension(it, 2);
EXCIT_DATA(it, hilbert2d_it);
hilbert2d_it->range_it = excit_alloc(EXCIT_RANGE);
if (!hilbert2d_it->range_it)
return -EXCIT_ENOMEM;
int n = 1 << order;
int err = excit_range_init(hilbert2d_it->range_it, 0, n * n - 1, 1);
if (err)
return err;
hilbert2d_it->n = n;
return EXCIT_SUCCESS;
}
#ifndef HILBERT2D_H
#define HILBERT2D_H
#include "excit.h"
struct hilbert2d_it_s {
ssize_t n;
excit_t range_it;
};
int hilbert2d_it_alloc(excit_t data);
void hilbert2d_it_free(excit_t data);
int hilbert2d_it_copy(excit_t ddst, const excit_t dsrc);
int hilbert2d_it_rewind(excit_t data);
int hilbert2d_it_peek(const excit_t data, ssize_t *val);
int hilbert2d_it_next(excit_t data, ssize_t *val);
int hilbert2d_it_size(const excit_t data, ssize_t *size);
int hilbert2d_it_nth(const excit_t data, ssize_t n, ssize_t *val);
int hilbert2d_it_rank(const excit_t data, const ssize_t *indexes, ssize_t *n);
int hilbert2d_it_pos(const excit_t data, ssize_t *n);
int hilbert2d_it_split(const excit_t data, ssize_t n, excit_t *results);
extern struct excit_func_table_s excit_hilbert2d_func_table;
#endif
#include "prod.h"
struct excit_func_table_s excit_prod_func_table = {
prod_it_alloc,
prod_it_free,
prod_it_copy,
prod_it_next,
prod_it_peek,
prod_it_size,
prod_it_rewind,
prod_it_split,
prod_it_nth,
prod_it_rank,
prod_it_pos
};
#define EXCIT_DATA(data, it) \
if(data == NULL) { return EXCIT_EINVAL; } \
do{ \
int err = excit_get_data(data, (void**)(&it)); \
if(err != EXCIT_SUCCESS) { return err; } \
} while(0); \
if(it == NULL){ return EXCIT_EINVAL; }
int prod_it_alloc(excit_t data)
{
struct prod_it_s *it;
EXCIT_DATA(data, it);