是否OpenMP的分配内存，并释放所有的内存？ 因为我的valgrind跑，并没有释放所有我的名单..我的malloc，我才释放一切。
==11442== HEAP SUMMARY:
==11442== in use at exit: 192 bytes in 1 blocks
==11442== total heap usage: 2,001 allocs, 2,000 frees, 2,917,280 bytes allocated
==11442==
==11442== LEAK SUMMARY:
==11442== definitely lost: 0 bytes in 0 blocks
==11442== indirectly lost: 0 bytes in 0 blocks
==11442== possibly lost: 0 bytes in 0 blocks
==11442== still reachable: 192 bytes in 1 blocks
==11442== suppressed: 0 bytes in 0 blocks
如果不是为什么还有在一个块中的内存泄漏？
这是我的代码：
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
/*check definition of _OPENMP*/
#ifdef _OPENMP
#include <omp.h>
#endif
#define RMAX 10000000
/*Global variables*/
int arraySizeGlobal;
int numberOfthreads;
int *aux;
/*Functions*/
void sort(int *a);
void sort2(int *a, int lo, int hi);
void merge(int *a, int lo, int mid, int hi);
void Generate_list(int a[], int n);
void printlist(int *array);
int main(int argc, char* argv[])
{
numberOfthreads = strtol(argv[1], NULL, 10);
arraySizeGlobal = strtol(argv[2], NULL, 10);
////////////////////////////////
int *array;
array = malloc(arraySizeGlobal * sizeof(int));
Generate_list(array,arraySizeGlobal);
printf("=====================\n");
printf("////Starting list////\n");
printf("=====================\n");
printlist(array);
sort(array);
printf("=====================\n");
printf("/////Sorted list/////\n");
printf("=====================\n");
printlist(array);
free(array);
return 0;
}
void sort(int *a)
{
aux = malloc(arraySizeGlobal * sizeof(int)); // Allocate space just once.
//#pragma omp parallel num_threads(numberOfthreads)
//#pragma omp single nowait
sort2(a, 0, arraySizeGlobal - 1);
free(aux);
}
void sort2(int *a, int lo, int hi)
{ // Sort a[lo..hi].
if (hi <= lo) return;
int mid = lo + (hi - lo)/2;
#pragma omp parallel sections num_threads(numberOfthreads)
{
#pragma omp section
sort2(a, lo, mid); // Sort left half.
#pragma omp section
sort2(a, mid+1, hi); // Sort right half.
}
merge(a, lo, mid, hi); // Merge
}
void merge(int *a, int lo, int mid, int hi)
{ // Merge a[lo..mid] with a[mid+1..hi].
int i = lo, j = mid+1;
int k;
#pragma omp parallel for num_threads(numberOfthreads)
for (k = lo; k <= hi; k++) // Copy a[lo..hi] to aux[lo..hi].
aux[k] = a[k];
for (k = lo; k <= hi; k++) // Merge back to a[lo..hi].
if (i > mid) a[k] = aux[j++];
else if (j > hi ) a[k] = aux[i++];
else if (aux[j] < aux[i]) a[k] = aux[j++];
else a[k] = aux[i++];
}
void printlist(int *array)
{
int i;
for (i = 0; i < arraySizeGlobal; ++i)
{
printf("%d ", array[i]);
}
printf("\n");
}
void Generate_list(int a[], int n) {
int i;
srandom(1);
for (i = 0; i < n; i++)
a[i] = random() % RMAX;
} /* Generate_list */
================================================== ================================
此代码：从算法第四版，罗伯特·塞奇威克来到| 凯文·韦恩。 这是一个Java实现，这是我改变交流的实施和使用OpenMP瘫痪
================================================== ================================
