This commit was generated by cvs2svn to compensate for changes in r924,

which included commits to RCS files with non-trunk default branches.

git-svn-id: http://svn.cactuscode.org/flesh/trunk@925 17b73243-c579-4c4c-a9d2-2d5706c11dac

1 files changed, 328 insertions, 0 deletions

diff --git a/src/schedule/ScheduleSorter.c b/src/schedule/ScheduleSorter.c
new file mode 100644
index 00000000..4f77689f
--- /dev/null
+++ b/src/schedule/ScheduleSorter.c
@@ -0,0 +1,328 @@
+ /*@@
+   @file      ScheduleSorter.c
+   @date      Mon Aug 30 11:36:35 1999
+   @author    Tom Goodale
+   @desc 
+   Sorter for scheduled routines.
+   @enddesc 
+ @@*/
+
+#include <stdio.h>
+#include <stdlib.h>
+
+static char *rcsid = "$Header$";
+
+static void ScheduleSwap(int size, signed char **array, int *order, int row, int column);
+
+ /*@@
+   @routine    ScheduleSort
+   @date       Mon Aug 30 11:44:35 1999
+   @author     Tom Goodale
+   @desc 
+   Sorts the array into sort order
+   @enddesc 
+   @calls     
+   @calledby   
+   @history 
+ 
+   @endhistory 
+
+@@*/
+
+int ScheduleSort(int size, signed char **array, int *order)
+{
+  int iter;
+  int row, column;
+  int retval;
+
+  for(iter=0; iter < size*(size-1)/2; iter++)
+  {
+
+    /* Search for the first +ve entry in the matrix */
+    for(row = 0; row < size; row++)
+    {
+      for(column = row+1; column < size ; column++)
+      {
+	if(array[row][column] > 0) break;
+      }
+      if(column < size && array[row][column] > 0) break;
+    }
+    
+    /* If beyond end of matrix, must be finished */
+    if(row >= size) break;
+
+    /* Swap the rows and columns */
+    ScheduleSwap(size, array, order, row, column);
+
+  }
+
+  retval = 0;
+
+  /* Search for +ve entries in the matrix */
+  for(row = 0; row < size; row++)
+  {
+    for(column = row+1; column <size ; column++)
+    {
+	if(array[row][column] > 0) retval -= 1;
+    }
+  }
+
+  return retval;
+}
+
+static void ScheduleSwap(int size, signed char **array, int *order, int row, int column)
+{
+  signed char *tmp;
+  signed char tmp_char;
+  int tmp_int;
+  int this_row;
+
+  /* Swap the rows */
+  tmp = array[row];
+  array[row] = array[column];
+  array[column] = tmp;
+
+  /* Swap the columns */
+  for(this_row = 0; this_row < size; this_row++)
+  {
+    tmp_char = array[this_row][column];
+    array[this_row][column] = array[this_row][row];
+    array[this_row][row]=tmp_char;
+  }
+
+  /* Swap routine orders */
+  tmp_int = order[column];
+  order[column]=order[row];
+  order[row] = tmp_int;
+
+}
+
+int CCTKi_ScheduleAddRow(int size, 
+			 signed char **array, 
+			 int *order, 
+			 int item, 
+			 int *thisorders)
+{
+  int retval;
+
+  int row;
+  int column;
+  int i;
+
+  retval = 0;
+
+  order[item]=item;
+
+  row = item;
+
+  for(column=0; column < size; column++)
+  {
+    if(thisorders[column])
+    {
+      if(array[row][column] && array[row][column] != thisorders[column]) retval--;
+      array[row][column] =   thisorders[column];
+      array[column][row] = - thisorders[column];
+    }
+  }
+    
+  return retval;
+}
+
+signed char **ScheduleCreateArray(int size)
+{
+  int i, j;
+  signed char **array;
+
+  array = (signed char **)malloc(size*sizeof(signed char *));
+
+  if(array)
+  {
+    for(i=0; i < size; i++)
+    {
+      array[i] = (signed char *)malloc(size*sizeof(signed char));
+      if(!array[i]) break;
+    }
+
+    /* Check for errors */
+    if(i < size)
+    {
+      /* Free already allocated memory */
+      for(i-1; i >=0; i--)
+      {
+	free(array[i]);
+      }
+      free(array);
+      array = NULL;
+    }
+  }
+
+  /* Initialise all entries to zero. */
+  if(array)
+  {
+    for(i=0; i < size; i++)
+    {
+      for(j=0; j < size; j++)
+      {
+	array[i][j] = 0;
+      }
+    }
+  }
+
+  return array;
+}
+
+void ScheduleDestroyArray(int size, signed char **array)
+{
+  int i;
+
+  for(i=size-1; i >=0; i--)
+  {
+    free(array[i]);
+  }
+}
+
+int *ScheduleCreateIVec(int size)
+{
+  int i;
+  int *vector;
+
+  vector = (int *)malloc(size*sizeof(int));
+
+  if(vector)
+  {
+    for(i=0; i < size; i++)
+    {
+      vector[i] = 0;
+    }
+  }
+
+  return vector;
+}
+
+void ScheduleDestroyIVec(int size, int *vector)
+{
+  free(vector);
+}
+
+#ifdef TEST_SORTER
+int main(int argc, char *argv[])
+{
+  int i, j;
+  int size;
+  float weight;
+  int *order;
+  int errcode;
+  signed char **array;
+  signed char val;
+
+  if(argc < 2)
+  {
+    printf("usage: %s size [wieght]\n", argv[0]);
+    exit(0);
+  }
+
+  size = atoi(argv[1]);
+
+  if(argc > 2)
+  {
+    weight = atof(argv[2]);
+  }
+  else
+  {
+    weight = 3.0;
+  }
+
+  if(weight <= 1)
+  {
+    fprintf(stderr, "Weight must be greater than 1 !  Resetting to 3\n");
+    weight = 3.0;
+  }
+  
+  if(size < 1)
+  {
+    fprintf(stderr, "size must be 1 or more, setting to 5\n");
+    size = 5;
+  }
+  
+  order = ScheduleCreateIVec(size);
+
+  array = ScheduleCreateArray(size);
+
+  for(i=0; i < size; i++)
+  {
+    order[i] = i;
+  }
+
+  /* Populate the array */
+  for(i=0; i < size; i++)
+  {
+    for(j=i; j < size; j++)
+    {
+      if(i==j)
+      {
+	array[i][i]=0;
+      }
+      else
+      {
+
+	val = (signed char)((int)(weight*rand()/(RAND_MAX+1.0))-2);
+
+	/* Normalise */
+	if(val) val /= abs(val);
+
+	array[i][j] = val;
+	array[j][i] = -val;
+      }
+    }
+  }
+
+  printf("Initial array is...\n");
+  for(i=0; i < size; i++)
+  {
+    for(j=0; j < size; j++)
+    {
+      printf("  %d", (int)array[i][j]);
+    }
+
+    printf("\n");
+  }
+
+  printf("Initial order is...\n");
+  for(i=0; i < size; i++)
+  {
+    printf("  %d", order[i]);
+  }
+  printf("\n");
+  
+  printf("Sorting array...\n");
+
+  errcode = ScheduleSort(size, array, order);
+
+  if(errcode)
+  {
+    fprintf(stderr, "Schedule sort failed with error code %d\n", errcode);
+  }
+
+  printf("Final array is...\n");
+  for(i=0; i < size; i++)
+  {
+    for(j=0; j < size; j++)
+    {
+      printf("  %d", (int)array[i][j]);
+    }
+
+    printf("\n");
+  }
+
+  printf("Final order is...\n");
+  for(i=0; i < size; i++)
+  {
+    printf("  %d", order[i]);
+  }
+  printf("\n");
+
+  printf("\n All done.\n");
+
+  return 0;
+}
+#endif