Skip to content
Snippets Groups Projects
Commit b88b284a authored by Matthieu Schaller's avatar Matthieu Schaller
Browse files

Rolled back the last commit. Clearly signed arithmetic is necessary here.

parent e763cea6
Branches
Tags
1 merge request!50Parallel sorting
...@@ -542,10 +542,10 @@ void space_do_parts_sort() { ...@@ -542,10 +542,10 @@ void space_do_parts_sort() {
if (!space_sort_struct.waiting) return; if (!space_sort_struct.waiting) return;
/* Get the stack entry. */ /* Get the stack entry. */
unsigned int i = space_sort_struct.stack[qid].i; int i = space_sort_struct.stack[qid].i;
unsigned int j = space_sort_struct.stack[qid].j; int j = space_sort_struct.stack[qid].j;
unsigned int min = space_sort_struct.stack[qid].min; int min = space_sort_struct.stack[qid].min;
unsigned int max = space_sort_struct.stack[qid].max; int max = space_sort_struct.stack[qid].max;
space_sort_struct.stack[qid].ready = 0; space_sort_struct.stack[qid].ready = 0;
/* Loop over sub-intervals. */ /* Loop over sub-intervals. */
...@@ -654,8 +654,8 @@ void gparts_sort(struct gpart *gparts, int *ind, int N, int min, int max) { ...@@ -654,8 +654,8 @@ void gparts_sort(struct gpart *gparts, int *ind, int N, int min, int max) {
int qstack_size = 2 * (max - min) + 10; int qstack_size = 2 * (max - min) + 10;
volatile unsigned int first, last, waiting; volatile unsigned int first, last, waiting;
unsigned int pivot; int pivot;
unsigned int i, ii, j, jj, temp_i, qid; int i, ii, j, jj, temp_i, qid;
struct gpart temp_p; struct gpart temp_p;
/* for ( int k = 0 ; k < N ; k++ ) /* for ( int k = 0 ; k < N ; k++ )
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment