main.c야

warning 경고는 pthread_create() 원형이랑 함수를 확인해 봤는데

인자로 넣는 함수는 void *thread_handle(thr_arg *src); <- 얘인데 왜 경고인지 모르겠어

원형을 똑같이 따라했으니 문제있을거라 생각하진 않구...


#include "mergesort.h"

pthread_mutex_t  mutex = PTHREAD_MUTEX_INITIALIZER;

int main(void)
{
 FILE   *fp_source;
 int   i, j, number_thr;
 int   *source_arr[MATRIX_LENGTH];
 int   *merge_problem1[2];
 int   *merge_problem2[MATRIX_LENGTH];
 int   *merge_problem3[MATRIX_LENGTH];
 arr_info  final1, final2, buf_fin;

 pthread_t  p_thread[THREAD_MAX];
 thr_arg   thr_status[THREAD_MAX];

printf("alpha block");  // segmentation fault가 뜨면서 출력이 되지 않음.

 if((fp_source = fopen("array3.txt", "r")) == NULL)
 {
  fprintf(stderr, "error open file array3.txt\\n");
  exit(1);
 }

 fseek(fp_source, 0, SEEK_SET);

 // Store data
 printf("Loading data...");

 for(i=0; i<MATRIX_LENGTH; i++)
 {
  source_arr[i] = (int *)malloc(sizeof(int)*MATRIX_WIDTH);

  for(j=0; j<MATRIX_WIDTH; j++)
  {
   fscanf(fp_source, "%d", &source_arr[i][j]);
  }
  merge_problem2[i] = (int *)malloc(sizeof(int)*MATRIX_WIDTH);
  memmove(merge_problem2[i], source_arr[i], sizeof(int)*MATRIX_WIDTH);

  merge_problem3[i] = (int *)malloc(sizeof(int)*MATRIX_WIDTH);
  memmove(merge_problem3[i], source_arr[i], sizeof(int)*MATRIX_WIDTH);
 }
 fclose(fp_source);

 merge_problem1[0] = (int *)malloc(sizeof(int)*MATRIX_WIDTH);
 merge_problem2[1] = (int *)malloc(sizeof(int)*MATRIX_WIDTH);

 memmove(merge_problem1[0], source_arr[0], sizeof(int)*MATRIX_WIDTH);
 memmove(merge_problem1[1], source_arr[1], sizeof(int)*MATRIX_WIDTH);

 puts("done\\n");

 puts("<MERGE SORT PROBLEM>\\n");

 merge_problem_1(merge_problem1[0], merge_problem1[1]);
 free(merge_problem1[0]);
 free(merge_problem1[1]);

 merge_problem_2(merge_problem2, MATRIX_LENGTH, MATRIX_WIDTH);
 for(i=0; i<MATRIX_LENGTH; i++)
 {
  free(merge_problem2[i]);
 }

 puts("Problem 3...How many threads do you want to create?");
 printf("threads have to be: 2, 4, 8");
 printf("Input << ");
 scanf("%d", &number_thr);

 for(i=0; i<number_thr; i++)
 {
  thr_status[i].src_arr = merge_problem3+((MATRIX_LENGTH/number_thr)*i);
  thr_status[i].nbr_of_line = MATRIX_LENGTH/number_thr;
  thr_status[i].elements_per_line = MATRIX_WIDTH;
  pthread_create(&p_thread[i], NULL, thread_handle, (void *)&thr_status[i]);
 }

 printf("joining threads...");
 for(i=0; i<number_thr; i++)
 {
  pthread_join(p_thread[i], NULL);
 }
 final1.arr = thr_status[0].sorted_arr;
 final2.arr = thr_status[1].sorted_arr;
 
 while(final2.arr != NULL)
 {
  for(i=0; i<number_thr; i+=2)
  {
   final1.arr = thr_status[i].sorted_arr;
   final2.arr = thr_status[i+1].sorted_arr;
   buf_fin.arr = NULL;

   final1.nbr_item = thr_status[i].sorted_nbr_item;
   final2.nbr_item = thr_status[i+1].sorted_nbr_item;
   buf_fin.nbr_item = final1.nbr_item+final2.nbr_item;
   
   buf_fin.arr = (int *)malloc(sizeof(int)*(buf_fin.nbr_item));
   
   merge_sort(final1, final2, &buf_fin);
   free(final2.arr);
   free(final1.arr);

   thr_status[i].sorted_arr = NULL;
   thr_status[i+1].sorted_arr = NULL;

   final1.nbr_item = buf_fin.nbr_item;
   thr_status[i/2].sorted_arr = (int *)malloc(sizeof(int)*(final1.nbr_item));
   
   memmove(thr_status[i/2].sorted_arr, buf_fin.arr, sizeof(int)*buf_fin.nbr_item);
   free(buf_fin.arr);
  }
  number_thr /= 2;
 }
 puts("done");
 printf("%dth number of sorted array: %d\\n", QUEST2_1, thr_status[0].sorted_arr[QUEST2_1-1]);
 printf("%dth number of sorted array: %d\\n", QUEST2_2, thr_status[0].sorted_arr[QUEST2_2-1]);
 printf("%dth number of sorted array: %d\\n", QUEST2_3, thr_status[0].sorted_arr[QUEST2_3-1]);

 for(i=0; i<MATRIX_LENGTH; i++)
 {
  free(source_arr[i]);
 }

 return 0;
}







이건 헤더 파일.

/*******************************************************************
 * <Header>
 * This header includes - header files, declares routines
 *  and constants about merge_sort
 *******************************************************************/
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <math.h>
#include <limits.h>
#include <string.h>
#include <pthread.h>

#define LOOP_ON   1
#define LOOP_OFF  0

// problem number
#define QUEST1_1  1
#define QUEST1_2  986
#define QUEST1_3  1278

#define QUEST2_1  2
#define QUEST2_2  540987
#define QUEST2_3  899743

// MATRIX_WIDTH : the number of lines - a[i][]
// MATRIX_LENGTH : the number of elements of each line - a[][j]
#define MATRIX_WIDTH 1000
#define MATRIX_LENGTH 1000

#define THREAD_MAX  8

typedef struct arr_info{
 int  *arr;
 int  nbr_item;
}arr_info;

typedef struct thr_arg{
 int  **src_arr;
 int  nbr_of_line;
 int  elements_per_line;
 int  *sorted_arr;
 int  sorted_nbr_item;
}thr_arg;

void merge_sort(const arr_info src1, const arr_info src2, arr_info *des);
void merge_problem_1(int *line1, int *line2);
void merge_problem_2(int **arr, const int nbr_of_line, const int elements_per_line);
void *thread_handle(thr_arg *src);