48 |
#pragma omp for schedule(static) |
#pragma omp for schedule(static) |
49 |
for (i=0;i<n_ptr;++i) { |
for (i=0;i<n_ptr;++i) { |
50 |
if (ptr[i]<ptr[i+1]) { |
if (ptr[i]<ptr[i+1]) { |
51 |
|
#ifdef USE_QSORTG |
52 |
qsortG(&(index[ptr[i]-1]),(size_t)(ptr[i+1]-ptr[i]),sizeof(index_t),Paso_comparIndex); |
qsortG(&(index[ptr[i]-1]),(size_t)(ptr[i+1]-ptr[i]),sizeof(index_t),Paso_comparIndex); |
53 |
|
#else |
54 |
|
qsort(&(index[ptr[i]-1]),(size_t)(ptr[i+1]-ptr[i]),sizeof(index_t),Paso_comparIndex); |
55 |
|
#endif |
56 |
loc_min_index=MIN(loc_min_index,index[ptr[i]-1]); |
loc_min_index=MIN(loc_min_index,index[ptr[i]-1]); |
57 |
loc_max_index=MAX(loc_max_index,index[ptr[i+1]-2]); |
loc_max_index=MAX(loc_max_index,index[ptr[i+1]-2]); |
58 |
} |
} |
61 |
#pragma omp for schedule(static) |
#pragma omp for schedule(static) |
62 |
for (i=0;i<n_ptr;++i) { |
for (i=0;i<n_ptr;++i) { |
63 |
if (ptr[i]<ptr[i+1]) { |
if (ptr[i]<ptr[i+1]) { |
64 |
|
#ifdef USE_QSORTG |
65 |
qsortG(&(index[ptr[i]]),(size_t)(ptr[i+1]-ptr[i]),sizeof(index_t),Paso_comparIndex); |
qsortG(&(index[ptr[i]]),(size_t)(ptr[i+1]-ptr[i]),sizeof(index_t),Paso_comparIndex); |
66 |
|
#else |
67 |
|
qsort(&(index[ptr[i]]),(size_t)(ptr[i+1]-ptr[i]),sizeof(index_t),Paso_comparIndex); |
68 |
|
#endif |
69 |
loc_min_index=MIN(loc_min_index,index[ptr[i]]); |
loc_min_index=MIN(loc_min_index,index[ptr[i]]); |
70 |
loc_max_index=MAX(loc_max_index,index[ptr[i+1]-1]); |
loc_max_index=MAX(loc_max_index,index[ptr[i+1]-1]); |
71 |
} |
} |