Hi
I am compiling exciting boron for ubuntu 14.04 64-bit.
I installed gfortran, Lapack/Blas (libblas-dev, libatlas-dev, liblapack-dev) and xsltproc. In setup.pl, I selected gfortran as the compiler and turned on MPI and SMP. When running make, I receive the following error:

zfinp.o: In function `zfinp_._omp_fn.0':
zfinp.f90:(.text+0xc): undefined reference to `omp_get_num_threads'
zfinp.f90:(.text+0x1a): undefined reference to `omp_get_thread_num'
zfinp.f90:(.text+0x126): undefined reference to `GOMP_barrier'
zfinp.f90:(.text+0x12f): undefined reference to `GOMP_atomic_start'
zfinp.o: In function `zfinp_':
zfinp.f90:(.text+0x1dd): undefined reference to `GOMP_parallel_start'
zfinp.f90:(.text+0x1ec): undefined reference to `GOMP_parallel_end'
zfinp.o: In function `zfinp_._omp_fn.0':
zfinp.f90:(.text+0x159): undefined reference to `GOMP_atomic_end'
getevecfv.o: In function `getevecfv_':
getevecfv.f90:(.text+0x1cd): undefined reference to `GOMP_critical_start'
getevecfv.f90:(.text+0xb67): undefined reference to `GOMP_critical_end'
seceqnhf.o: In function `seceqnhf_':
seceqnhf.f90:(.text+0xa5): undefined reference to `GOMP_critical_start'
seceqnhf.f90:(.text+0x134): undefined reference to `GOMP_critical_end'
atom.o: In function `atom_._omp_fn.0':
atom.f90:(.text+0x25): undefined reference to `omp_get_num_threads'
atom.f90:(.text+0x2c): undefined reference to `omp_get_thread_num'
atom.o: In function `atom_':
atom.f90:(.text+0x1273): undefined reference to `GOMP_parallel_start'
atom.f90:(.text+0x1285): undefined reference to `GOMP_parallel_end'
atom.o: In function `atom_._omp_fn.0':
atom.f90:(.text+0x105): undefined reference to `GOMP_barrier'
DIISseceqnfv.o: In function `diisseceqnfv_':
DIISseceqnfv.F90:(.text+0x5eb): undefined reference to `GOMP_critical_start'
DIISseceqnfv.F90:(.text+0x612): undefined reference to `GOMP_critical_end'
rdmminn.o: In function `rdmminn_._omp_fn.0':
rdmminn.f90:(.text+0xc): undefined reference to `omp_get_num_threads'
rdmminn.f90:(.text+0x1a): undefined reference to `omp_get_thread_num'
rdmminn.f90:(.text+0x4f): undefined reference to `GOMP_critical_start'
rdmminn.f90:(.text+0xc0): undefined reference to `GOMP_critical_end'
rdmminn.f90:(.text+0xd7): undefined reference to `GOMP_barrier'
rdmminn.o: In function `rdmminn_':
rdmminn.f90:(.text+0x2f0): undefined reference to `GOMP_parallel_start'
rdmminn.f90:(.text+0x2fc): undefined reference to `GOMP_parallel_end'
zrhogp.o: In function `zrhogp_._omp_fn.0':
zrhogp.f90:(.text+0x40): undefined reference to `omp_get_num_threads'
zrhogp.f90:(.text+0x48): undefined reference to `omp_get_thread_num'
zrhogp.o: In function `zrhogp_':
zrhogp.f90:(.text+0x6f6): undefined reference to `GOMP_parallel_start'
zrhogp.f90:(.text+0x708): undefined reference to `GOMP_parallel_end'
collect2: error: ld returned 1 exit status
make[3]: *** [exciting] Error 1
make[3]: Leaving directory `/home/manzoor/Desktop/exciting/build/mpi'
make[2]: *** [bin] Error 2
make[2]: Leaving directory `/home/manzoor/Desktop/exciting/build/mpi'
make[1]: *** [all] Error 2
make[1]: Leaving directory `/home/manzoor/Desktop/exciting/build/mpi'
make: *** [mpi] Error 2

Thanks,
kazem.manzoor

I have an other problem. I can't find the build/make.inc in the HM-16.0 test model

1. include <stdlib.h>
2. include <stdio.h>
3. include <time.h>
4. include <omp.h>

1. define NV 6

int main ( int argc, char **argv );
int *dijkstra_distance ( int ohd[NV][NV] );
void find_nearest ( int s, int e, int mind[NV], int connected[NV], int *d,int *v );
void init ( int ohd[NV][NV] );
void timestamp ( void );
void update_mind ( int s, int e, int mv, int connected[NV], int ohd[NV][NV],int mind[NV] );

int main ( int argc, char **argv )
{
int i;
int i4_huge = 2147483647;
int j;
int *mind;
int ohd[NV][NV];

timestamp ( );
fprintf ( stdout, " \n" );
fprintf ( stdout, " DIJKSTRA_OPENMP\n" );
fprintf ( stdout, " C version\n" );
fprintf ( stdout, " Use Dijkstra's algorithm to determine the minimum\n" );
fprintf ( stdout, " distance from node 0 to each node in a graph,\n" );
fprintf ( stdout, " given the distances between each pair of nodes.\n" );
fprintf ( stdout, " \n" );
fprintf ( stdout, " Although a very small example is considered, we\n" );
fprintf ( stdout, " demonstrate the use of OpenMP directives for\n" );
fprintf ( stdout, " parallel execution.\n" );
init ( ohd );

fprintf ( stdout, " \n" );
fprintf ( stdout, " Distance matrix:\n" );
fprintf ( stdout, " \n" );
for ( i = 0; i < NV; i++ )
{
for ( j = 0; j < NV; j++ )
{
if ( ohd[i][j] == i4_huge )
{
fprintf ( stdout, " Inf" );
}
else
{
fprintf ( stdout, " %3d", ohd[i][j] );
}
}
fprintf ( stdout, "\n" );
}

mind = dijkstra_distance ( ohd );

fprintf ( stdout, "\n" );
fprintf ( stdout, " Minimum distances from node 0:\n");
fprintf ( stdout, "\n" );
for ( i = 0; i < NV; i++ )
{
for ( j = 0; j < NV; j++ )
{
if ( ohd[i][j] == i4_huge )
{
fprintf ( stdout, " Inf" );
}
else
{
fprintf ( stdout, " %3d", ohd[i][j] );
}
}
fprintf ( stdout, "\n" );
}

mind = dijkstra_distance ( ohd );

fprintf ( stdout, "\n" );
fprintf ( stdout, " Minimum distances from node 0:\n");
fprintf ( stdout, "\n" );
for ( i = 0; i < NV; i++ )
{
fprintf ( stdout, " %2d %2d\n", i, mind[i] );
}

free ( mind );

fprintf ( stdout, "\n" );
fprintf ( stdout, "DIJKSTRA_OPENMP\n" );
fprintf ( stdout, " Normal end of execution.\n" );

fprintf ( stdout, "\n" );
timestamp ( );
return 0;
}

int *dijkstra_distance ( int ohd[NV][NV] )

{
int *connected;
int i;
int i4_huge = 2147483647;
int md;
int *mind;
int mv;
int my_first;
int my_id;
int my_last;
int my_md;
int my_mv;
int my_step;
int nth;

connected = ( int * ) malloc ( NV * sizeof ( int ) );

connected[0] = 1;
for ( i = 1; i < NV; i++ )
{
connected[i] = 0;
}

mind = ( int * ) malloc ( NV * sizeof ( int ) );

for ( i = 0; i < NV; i++ )
{
mind[i] = ohd[0][i];
}

# pragma omp parallel private ( my_first, my_id, my_last, my_md, my_mv, my_step ) shared ( connected, md, mind, mv, nth, ohd )
{
my_id = omp_get_thread_num ( );
nth = omp_get_num_threads ( );
my_first = ( my_id * NV ) / nth;
my_last = ( ( my_id + 1 ) * NV ) / nth - 1;

# pragma omp single
{
printf ( "\n" );
printf ( " P%d: Parallel region begins with %d threads\n", my_id, nth );
printf ( "\n" );
}
fprintf ( stdout, " P%d: First=%d Last=%d\n", my_id, my_first, my_last );

for ( my_step = 1; my_step < NV; my_step++ )
{

# pragma omp single
{
md = i4_huge;
mv = -1;
}

find_nearest ( my_first, my_last, mind, connected, &my_md, &my_mv );

# pragma omp critical
{
if ( my_md < md )
{
md = my_md;
mv = my_mv;
}
}

1. pragma omp barrier

# pragma omp single
{
if ( mv != - 1 )
{
connected[mv] = 1;
printf ( " P%d: Connecting node %d.\n", my_id, mv );
}
}

# pragma omp barrier

if ( mv != -1 )
{
update_mind ( my_first, my_last, mv, connected, ohd, mind );
}

#pragma omp barrier
}

# pragma omp single
{
printf ( "\n" );
printf ( " P%d: Exiting parallel region.\n", my_id );
}
}

free ( connected );

return mind;
}
void find_nearest ( int s, int e, int mind[NV], int connected[NV], int *d, int *v )
{
int i;
int i4_huge = 2147483647;

*d = i4_huge;
*v = -1;

for ( i = s; i <= e; i++ )
{
if ( !connected[i] && ( mind[i] < *d ) )
{
*d = mind[i];
*v = i;
}
}
return;
}
void init ( int ohd[NV][NV] )
{
int i;
int i4_huge = 2147483647;
int j;

for ( i = 0; i < NV; i++ )
{
for ( j = 0; j < NV; j++ )
{
if ( i == j )
{
ohd[i][i] = 0;
}
else
{
ohd[i][j] = i4_huge;
}
}
}
ohd[0][1] = ohd[1][0] = 40;
ohd[0][2] = ohd[2][0] = 15;
ohd[1][2] = ohd[2][1] = 20;
ohd[1][3] = ohd[3][1] = 10;
ohd[1][4] = ohd[4][1] = 25;
ohd[2][3] = ohd[3][2] = 100;
ohd[1][5] = ohd[5][1] = 6;
ohd[4][5] = ohd[5][4] = 8;

return;
}
void timestamp ( void )
{

1. define TIME_SIZE 40

static char time_buffer[TIME_SIZE];
const struct tm *tm;
size_t len;
time_t now;

now = time ( NULL );
tm = localtime ( &now );

len = strftime ( time_buffer, TIME_SIZE, "%d %B %Y %I:%M:%S %p", tm );

printf ( "%s\n", time_buffer );

return;

1. undef TIME_SIZE

}
void update_mind ( int s, int e, int mv, int connected[NV], int ohd[NV][NV], int mind[NV] )
{
int i;
int i4_huge = 2147483647;

for ( i = s; i <= e; i++ )
{
if ( !connected[i] )
{
if ( ohd[mv][i] < i4_huge )
{
if ( mind[mv] + ohd[mv][i] < mind[i] )
{
mind[i] = mind[mv] + ohd[mv][i];
}
}
}
}
return;
}

//can everyone help me, i get the 'omp_get_thread_num' and 'omp_get_num_thread'

please help

1. include <stdlib.h>
2. include <stdio.h>
3. include <time.h>
4. include <omp.h>

1. define NV 6

int main ( int argc, char **argv );
int *dijkstra_distance ( int ohd[NV][NV] );
void find_nearest ( int s, int e, int mind[NV], int connected[NV], int *d,int *v );
void init ( int ohd[NV][NV] );
void timestamp ( void );
void update_mind ( int s, int e, int mv, int connected[NV], int ohd[NV][NV],int mind[NV] );

int main ( int argc, char **argv )
{
int i;
int i4_huge = 2147483647;
int j;
int *mind;
int ohd[NV][NV];

timestamp ( );
fprintf ( stdout, " \n" );
fprintf ( stdout, " DIJKSTRA_OPENMP\n" );
fprintf ( stdout, " C version\n" );
fprintf ( stdout, " Use Dijkstra's algorithm to determine the minimum\n" );
fprintf ( stdout, " distance from node 0 to each node in a graph,\n" );
fprintf ( stdout, " given the distances between each pair of nodes.\n" );
fprintf ( stdout, " \n" );
fprintf ( stdout, " Although a very small example is considered, we\n" );
fprintf ( stdout, " demonstrate the use of OpenMP directives for\n" );
fprintf ( stdout, " parallel execution.\n" );
init ( ohd );

fprintf ( stdout, " \n" );
fprintf ( stdout, " Distance matrix:\n" );
fprintf ( stdout, " \n" );
for ( i = 0; i < NV; i++ )
{
for ( j = 0; j < NV; j++ )
{
if ( ohd[i][j] == i4_huge )
{
fprintf ( stdout, " Inf" );
}
else
{
fprintf ( stdout, " %3d", ohd[i][j] );
}
}
fprintf ( stdout, "\n" );
}

mind = dijkstra_distance ( ohd );

fprintf ( stdout, "\n" );
fprintf ( stdout, " Minimum distances from node 0:\n");
fprintf ( stdout, "\n" );
for ( i = 0; i < NV; i++ )
{
for ( j = 0; j < NV; j++ )
{
if ( ohd[i][j] == i4_huge )
{
fprintf ( stdout, " Inf" );
}
else
{
fprintf ( stdout, " %3d", ohd[i][j] );
}
}
fprintf ( stdout, "\n" );
}

mind = dijkstra_distance ( ohd );

fprintf ( stdout, "\n" );
fprintf ( stdout, " Minimum distances from node 0:\n");
fprintf ( stdout, "\n" );
for ( i = 0; i < NV; i++ )
{
fprintf ( stdout, " %2d %2d\n", i, mind[i] );
}

free ( mind );

fprintf ( stdout, "\n" );
fprintf ( stdout, "DIJKSTRA_OPENMP\n" );
fprintf ( stdout, " Normal end of execution.\n" );

fprintf ( stdout, "\n" );
timestamp ( );
return 0;
}

int *dijkstra_distance ( int ohd[NV][NV] )

{
int *connected;
int i;
int i4_huge = 2147483647;
int md;
int *mind;
int mv;
int my_first;
int my_id;
int my_last;
int my_md;
int my_mv;
int my_step;
int nth;

connected = ( int * ) malloc ( NV * sizeof ( int ) );

connected[0] = 1;
for ( i = 1; i < NV; i++ )
{
connected[i] = 0;
}

mind = ( int * ) malloc ( NV * sizeof ( int ) );

for ( i = 0; i < NV; i++ )
{
mind[i] = ohd[0][i];
}

# pragma omp parallel private ( my_first, my_id, my_last, my_md, my_mv, my_step ) shared ( connected, md, mind, mv, nth, ohd )
{
my_id = omp_get_thread_num ( );
nth = omp_get_num_threads ( );
my_first = ( my_id * NV ) / nth;
my_last = ( ( my_id + 1 ) * NV ) / nth - 1;

# pragma omp single
{
printf ( "\n" );
printf ( " P%d: Parallel region begins with %d threads\n", my_id, nth );
printf ( "\n" );
}
fprintf ( stdout, " P%d: First=%d Last=%d\n", my_id, my_first, my_last );

for ( my_step = 1; my_step < NV; my_step++ )
{

# pragma omp single
{
md = i4_huge;
mv = -1;
}

find_nearest ( my_first, my_last, mind, connected, &my_md, &my_mv );

# pragma omp critical
{
if ( my_md < md )
{
md = my_md;
mv = my_mv;
}
}

1. pragma omp barrier

# pragma omp single
{
if ( mv != - 1 )
{
connected[mv] = 1;
printf ( " P%d: Connecting node %d.\n", my_id, mv );
}
}

# pragma omp barrier

if ( mv != -1 )
{
update_mind ( my_first, my_last, mv, connected, ohd, mind );
}

#pragma omp barrier
}

# pragma omp single
{
printf ( "\n" );
printf ( " P%d: Exiting parallel region.\n", my_id );
}
}

free ( connected );

return mind;
}
void find_nearest ( int s, int e, int mind[NV], int connected[NV], int *d, int *v )
{
int i;
int i4_huge = 2147483647;

*d = i4_huge;
*v = -1;

for ( i = s; i <= e; i++ )
{
if ( !connected[i] && ( mind[i] < *d ) )
{
*d = mind[i];
*v = i;
}
}
return;
}
void init ( int ohd[NV][NV] )
{
int i;
int i4_huge = 2147483647;
int j;

for ( i = 0; i < NV; i++ )
{
for ( j = 0; j < NV; j++ )
{
if ( i == j )
{
ohd[i][i] = 0;
}
else
{
ohd[i][j] = i4_huge;
}
}
}
ohd[0][1] = ohd[1][0] = 40;
ohd[0][2] = ohd[2][0] = 15;
ohd[1][2] = ohd[2][1] = 20;
ohd[1][3] = ohd[3][1] = 10;
ohd[1][4] = ohd[4][1] = 25;
ohd[2][3] = ohd[3][2] = 100;
ohd[1][5] = ohd[5][1] = 6;
ohd[4][5] = ohd[5][4] = 8;

return;
}
void timestamp ( void )
{

1. define TIME_SIZE 40

static char time_buffer[TIME_SIZE];
const struct tm *tm;
size_t len;
time_t now;

now = time ( NULL );
tm = localtime ( &now );

len = strftime ( time_buffer, TIME_SIZE, "%d %B %Y %I:%M:%S %p", tm );

printf ( "%s\n", time_buffer );

return;

1. undef TIME_SIZE

}
void update_mind ( int s, int e, int mv, int connected[NV], int ohd[NV][NV], int mind[NV] )
{
int i;
int i4_huge = 2147483647;

for ( i = s; i <= e; i++ )
{
if ( !connected[i] )
{
if ( ohd[mv][i] < i4_huge )
{
if ( mind[mv] + ohd[mv][i] < mind[i] )
{
mind[i] = mind[mv] + ohd[mv][i];
}
}
}
}
return;
}