Skip to content
GitLab
Commit 7724defa authored by Uwe Schulzweida's avatar Uwe Schulzweida
Browse files

Merge declaration and definition.

parent 48d6e103
Hide whitespace changes
Inline Side-by-side
src/kdtreelib/kdtree_common.cc
View file @ 7724defa
......@@ -19,10 +19,10 @@ extern int pmergesort(struct kd_point *base, size_t nmemb, int axis, int max_thr
void *
kd_malloc(size_t size, const char *msg)
{
void *ptr;
if ((ptr = malloc(size)) == NULL)
perror(msg);
return ptr;
void *ptr;
if ((ptr = malloc(size)) == NULL)
perror(msg);
return ptr;
}
kdata_t
......@@ -34,7 +34,7 @@ kd_sqr(kdata_t x)
int
kd_isleaf(struct kdNode *n)
{
return (n->left || n->right) ? 0 : 1;
return (n->left || n->right) ? 0 : 1;
}
/* end utility functions */
......@@ -48,33 +48,33 @@ kd_isleaf(struct kdNode *n)
void
kd_printNode(struct kdNode *node)
{
if (!node) {
fprintf(stderr, "Node is empty.\n");
return;
}
printf("Node %p at (%f, %f)\n", (void *) node, node->location[0],
node->location[1]);
printf("Split axis: %d\n", node->split);
printf("Corners: (%f, %f)\t(%f, %f)\n", node->min[0], node->min[1],
node->max[0], node->max[1]);
printf("Children: %p\t%p\n", (void *) node->left, (void *) node->right);
printf("Index: %u\n", node->index);
if (!node) {
fprintf(stderr, "Node is empty.\n");
return;
}
printf("Node %p at (%f, %f)\n", (void *) node, node->location[0],
node->location[1]);
printf("\n");
printf("Split axis: %d\n", node->split);
printf("Corners: (%f, %f)\t(%f, %f)\n", node->min[0], node->min[1],
node->max[0], node->max[1]);
printf("Children: %p\t%p\n", (void *) node->left, (void *) node->right);
printf("Index: %u\n", node->index);
printf("\n");
}
void
kd_printTree(struct kdNode *node)
{
if (node == NULL)
return;
if ( node == NULL ) return;
kd_printTree(node->left);
if (kd_isleaf(node) )
printf("%f\t%f\n", node->location[0], node->location[1]);
kd_printTree(node->right);
kd_printTree(node->left);
if ( kd_isleaf(node) )
printf("%f\t%f\n", node->location[0], node->location[1]);
kd_printTree(node->right);
}
/* End helper functions */
......@@ -87,102 +87,106 @@ kd_printTree(struct kdNode *node)
void *kd_doBuildTree(void *threadarg)
{
kdata_t tmpMinLeft[KD_MAX_DIM], tmpMaxLeft[KD_MAX_DIM], tmpMinRight[KD_MAX_DIM], tmpMaxRight[KD_MAX_DIM];
struct kdNode *node;
pthread_t threads[2];
pthread_attr_t attr;
struct kd_thread_data *argleft, *argright;
struct kd_thread_data *my_data = (struct kd_thread_data *) threadarg;
struct kd_point *points = my_data->points;
unsigned long nPoints = my_data->nPoints;
kdata_t *min = my_data->min;
kdata_t *max = my_data->max;
int depth = my_data->depth;
int max_threads = my_data->max_threads;
int dim = my_data->dim;
pthread_attr_init(&attr);
pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);
int sortaxis = depth % dim;
if (nPoints == 1) {
if ((node = kd_allocNode(points, 0, min, max, sortaxis, dim)) == NULL)
return NULL;
node->index = points[0].index;
return node;
kdata_t tmpMinLeft[KD_MAX_DIM], tmpMaxLeft[KD_MAX_DIM], tmpMinRight[KD_MAX_DIM], tmpMaxRight[KD_MAX_DIM];
struct kdNode *node;
pthread_t threads[2];
pthread_attr_t attr;
struct kd_thread_data *argleft, *argright;
struct kd_thread_data *my_data = (struct kd_thread_data *) threadarg;
struct kd_point *points = my_data->points;
unsigned long nPoints = my_data->nPoints;
kdata_t *min = my_data->min;
kdata_t *max = my_data->max;
int depth = my_data->depth;
int max_threads = my_data->max_threads;
int dim = my_data->dim;
pthread_attr_init(&attr);
pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);
int sortaxis = depth % dim;
if (nPoints == 1) {
if ((node = kd_allocNode(points, 0, min, max, sortaxis, dim)) == NULL)
return NULL;
node->index = points[0].index;
return node;
}
/*
* If this iteration is allowed to start more threads, we first
* use them to parallelize the sorting
*/
pmergesort(points, nPoints, sortaxis, max_threads);
unsigned long pivot = nPoints / 2;
if ((node = kd_allocNode(points, pivot, min, max, sortaxis, dim)) == NULL)
return NULL;
memcpy(tmpMinLeft, min, dim * sizeof(kdata_t));
memcpy(tmpMaxLeft, max, dim * sizeof(kdata_t));
tmpMaxLeft[sortaxis] = node->location[sortaxis];
argleft = kd_buildArg(points, pivot, tmpMinLeft, tmpMaxLeft,
depth + 1, max_threads / 2, dim);
if (!argleft) {
kd_destroyTree(node);
return NULL;
}
if (max_threads > 1) {
pthread_create(&threads[0], &attr, kd_doBuildTree, (void *) argleft);
} else {
node->left = (kdNode *)kd_doBuildTree((void *) argleft);
free(argleft);
if (!node->left) {
kd_destroyTree(node);
return NULL;
}
/*
* If this iteration is allowed to start more threads, we first
* use them to parallelize the sorting
*/
pmergesort(points, nPoints, sortaxis, max_threads);
unsigned long pivot = nPoints / 2;
if ((node = kd_allocNode(points, pivot, min, max, sortaxis, dim)) == NULL)
return NULL;
memcpy(tmpMinLeft, min, dim * sizeof(kdata_t));
memcpy(tmpMaxLeft, max, dim * sizeof(kdata_t));
tmpMaxLeft[sortaxis] = node->location[sortaxis];
argleft = kd_buildArg(points, pivot, tmpMinLeft, tmpMaxLeft,
depth + 1, max_threads / 2, dim);
if (!argleft) {
kd_destroyTree(node);
return NULL;
}
memcpy(tmpMinRight, min, dim * sizeof(kdata_t));
memcpy(tmpMaxRight, max, dim * sizeof(kdata_t));
tmpMinRight[sortaxis] = node->location[sortaxis];
argright = kd_buildArg(&points[pivot], nPoints - pivot,
tmpMinRight, tmpMaxRight, depth + 1,
max_threads / 2, dim);
if (!argright) {
kd_destroyTree(node);
return NULL;
}
if (max_threads > 1) {
pthread_create(&threads[1], &attr, kd_doBuildTree, (void *) argright);
} else {
node->right = (kdNode *)kd_doBuildTree((void *) argright);
free(argright);
if (!node->right) {
kd_destroyTree(node);
return NULL;
}
if (max_threads > 1) {
pthread_create(&threads[0], &attr, kd_doBuildTree, (void *) argleft);
} else {
node->left = (kdNode *)kd_doBuildTree((void *) argleft);
free(argleft);
if (!node->left) {
kd_destroyTree(node);
return NULL;
}
}
if (max_threads > 1) {
pthread_join(threads[0], (void **) (&node->left));
free(argleft);
pthread_join(threads[1], (void **) (&node->right));
free(argright);
if (!node->left || !node->right) {
kd_destroyTree(node);
return NULL;
}
}
memcpy(tmpMinRight, min, dim * sizeof(kdata_t));
memcpy(tmpMaxRight, max, dim * sizeof(kdata_t));
tmpMinRight[sortaxis] = node->location[sortaxis];
argright = kd_buildArg(&points[pivot], nPoints - pivot,
tmpMinRight, tmpMaxRight, depth + 1,
max_threads / 2, dim);
if (!argright) {
kd_destroyTree(node);
return NULL;
}
if (max_threads > 1) {
pthread_create(&threads[1], &attr, kd_doBuildTree, (void *) argright);
} else {
node->right = (kdNode *)kd_doBuildTree((void *) argright);
free(argright);
if (!node->right) {
kd_destroyTree(node);
return NULL;
}
}
if (max_threads > 1) {
pthread_join(threads[0], (void **) (&node->left));
free(argleft);
pthread_join(threads[1], (void **) (&node->right));
free(argright);
if (!node->left || !node->right) {
kd_destroyTree(node);
return NULL;
}
}
return (void *) node;
return (void *) node;
}
void
kd_freeNode(kdNode *node)
{
if ( node ) free(node);
return;
if ( node ) free(node);
return;
}
......@@ -192,18 +196,20 @@ kd_buildArg(struct kd_point *points,
kdata_t *min, kdata_t *max,
int depth, int max_threads, int dim)
{
struct kd_thread_data *d;
if ((d = (kd_thread_data *)kd_malloc(sizeof(kd_thread_data), "kd_thread_data")) == NULL)
return NULL;
d->points = points;
d->nPoints = nPoints;
memcpy(d->min, min, dim*sizeof(kdata_t));
memcpy(d->max, max, dim*sizeof(kdata_t));
d->depth = depth;
d->max_threads = max_threads;
d->dim = dim;
return d;
struct kd_thread_data *d;
if ((d = (kd_thread_data *)kd_malloc(sizeof(kd_thread_data), "kd_thread_data")) == NULL)
return NULL;
d->points = points;
d->nPoints = nPoints;
memcpy(d->min, min, dim*sizeof(kdata_t));
memcpy(d->max, max, dim*sizeof(kdata_t));
d->depth = depth;
d->max_threads = max_threads;
d->dim = dim;
return d;
}
......@@ -211,17 +217,19 @@ struct kdNode *
kd_allocNode(struct kd_point *points, unsigned long pivot,
kdata_t *min, kdata_t *max, int axis, int dim)
{
struct kdNode *node;
if ((node = (kdNode *)kd_malloc(sizeof(kdNode), "kd_allocNode (node): ")) == NULL)
return NULL;
node->split = axis;
memcpy(node->location, points[pivot].point, dim * sizeof(kdata_t));
memcpy(node->min, min, dim * sizeof(kdata_t));
memcpy(node->max, max, dim * sizeof(kdata_t));
node->left = node->right = NULL;
node->index = 0;
return node;
struct kdNode *node;
if ((node = (kdNode *)kd_malloc(sizeof(kdNode), "kd_allocNode (node): ")) == NULL)
return NULL;
node->split = axis;
memcpy(node->location, points[pivot].point, dim * sizeof(kdata_t));
memcpy(node->min, min, dim * sizeof(kdata_t));
memcpy(node->max, max, dim * sizeof(kdata_t));
node->left = node->right = NULL;
node->index = 0;
return node;
}
/*!
......@@ -236,12 +244,11 @@ kd_allocNode(struct kd_point *points, unsigned long pivot,
void
kd_destroyTree(struct kdNode *node)
{
if (node == NULL)
return;
if ( node == NULL ) return;
kd_destroyTree(node->left);
kd_destroyTree(node->right);
kd_freeNode(node);
kd_destroyTree(node->left);
kd_destroyTree(node->right);
kd_freeNode(node);
}
/* end of tree construction and destruction */
......@@ -252,23 +259,23 @@ kd_destroyTree(struct kdNode *node)
int
kd_insertResTree(struct kdNode *node, struct pqueue *res)
{
struct resItem *point;
if ( node == NULL ) return 1;
if (node == NULL)
return 1;
if ( !kd_insertResTree(node->left, res) ) return 0;
if (!kd_insertResTree(node->left, res))
if ( kd_isleaf(node) )
{
struct resItem *point;
if ((point = (struct resItem *)kd_malloc(sizeof(struct resItem), "kd_insertResTree: "))
== NULL)
return 0;
if (kd_isleaf(node)) {
if ((point = (struct resItem *)kd_malloc(sizeof(struct resItem), "kd_insertResTree: "))
== NULL)
return 0;
point->node = node;
point->dist_sq = -1;
pqinsert(res, point);
point->node = node;
point->dist_sq = -1;
pqinsert(res, point);
}
if (!kd_insertResTree(node->right, res))
return 0;
return 1;
if ( !kd_insertResTree(node->right, res) ) return 0;
return 1;
}
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment

Imprint | Privacy Policy