double benchmark_fadd_longlong (struct pe_vars v, union data_types *buffer, unsigned long iterations) { int64_t begin, end; int i; static double rate = 0, sum_rate = 0, lat = 0, sum_lat = 0; /* * Touch memory */ memset(buffer, CHAR_MAX * drand48(), sizeof(union data_types [ITERATIONS])); shmem_barrier_all(); if (v.me < v.pairs) { long long value = 1; long long old_value; begin = TIME(); for (i = 0; i < iterations; i++) { old_value = shmem_longlong_fadd(&(buffer[i].longlong_type), value, v.nxtpe); } end = TIME(); rate = ((double)iterations * 1e6) / (end - begin); lat = (end - begin) / (double)iterations; } shmem_double_sum_to_all(&sum_rate, &rate, 1, 0, 0, v.npes, pwrk1, psync1); shmem_double_sum_to_all(&sum_lat, &lat, 1, 0, 0, v.npes, pwrk2, psync2); print_operation_rate(v.me, "shmem_longlong_fadd", sum_rate/1e6, sum_lat/v.pairs); return 0; }
int main(int argc, char* argv[]) { int me, num_pes, l, pe; int Verbose = 0; start_pes(0); me = _my_pe(); num_pes = _num_pes(); for (l = 0 ; l < loops ; ++l) { if ((src_int = shmalloc(sizeof(int))) == NULL) { printf("PE-%d int shmalloc() failed?\n", me); exit(1); } *src_int = 4; dst_int = itmp = 0; if ((src_long = shmalloc(sizeof(long))) == NULL) { printf("PE-%d long shmalloc() failed?\n", me); exit(1); } *src_long = 8; dst_long = ltmp = 0; if ((src_llong = shmalloc(sizeof(long long))) == NULL) { printf("PE-%d long long shmalloc() failed?\n", me); exit(1); } *src_llong = 16; dst_llong = lltmp = 0; //printf("PE-%d malloc()s done.\n",me); shmem_barrier_all(); if ( me == 0 ) { /* integer swap */ itmp = shmem_int_g(src_int,1); Vprintf("PE-0 Initial Conditions(int) local %d rem(%d)\n", dst_int,itmp); dst_int = shmem_int_cswap(src_int,*src_int,0,1); if (dst_int != 4) { printf("PE-%d dst_int %d != 4?\n",me,dst_int); exit(1); } /* verify remote data */ itmp = shmem_int_g(src_int,1); if (itmp != 0) { printf("PE-%d rem %d != 0?\n",me,itmp); exit(1); } Vprintf("PE-0 1st int_cswap done: local %d rem(%d)\n",dst_int,itmp); dst_int = shmem_int_cswap(src_int,0,dst_int,1); if (dst_int != 0) { printf("PE-%d dst_int %d != 0?\n",me,dst_int); exit(1); } /* verify remote data */ itmp = shmem_int_g(src_int,1); if (itmp != 4) { printf("PE-%d rem %d != 4?\n",me,itmp); exit(1); } Vprintf("PE-0 2nd int_swap done: local %d rem(%d)\n",dst_int,itmp); /* cswap() should not swap as cond(0) != remote(4) */ dst_int = shmem_int_cswap(src_int,0,0,1); if (dst_int != 4) { printf("PE-%d int no-swap returned dst_int %d != 4?\n", me,dst_int); exit(1); } /* verify previous cswap() did not swap */ itmp = shmem_int_g(src_int,1); if (itmp != 4) { printf("PE-%d failed cond int_cswap() swapped? rem(%d) != 4?\n", me,itmp); exit(1); } /* long swap */ ltmp = shmem_long_g(src_long,1); Vprintf("PE-0 Initial Conditions(long) local %ld rem(%ld)\n", dst_long,ltmp); dst_long = shmem_long_cswap(src_long,*src_long,0,1); if (dst_long != 8) { printf("PE-%d dst_long %ld != 8?\n",me,dst_long); exit(1); } /* verify remote data */ ltmp = shmem_long_g(src_long,1); if (ltmp != 0) { printf("PE-%d long rem(%ld) != 0?\n",me,ltmp); exit(1); } Vprintf("PE-0 1st long_cswap done: local %ld rem(%ld)\n", dst_long,ltmp); dst_long = shmem_long_cswap(src_long,0,dst_long,1); if (dst_long != 0) { printf("PE-%d dst_long %ld != 0?\n",me,dst_long); exit(1); } /* verify remote data */ ltmp = shmem_long_g(src_long,1); if (ltmp != 8) { printf("PE-%d long rem(%ld) != 8?\n",me,ltmp); exit(1); } Vprintf("PE-0 2nd long_swap done: local %ld rem(%ld)\n", dst_long,ltmp); /* cswap() should not swap as cond(0) != remote(8) */ dst_long = shmem_long_cswap(src_long,0,0,1); if (dst_long != 8) { printf("PE-%d long no-swap returned dst_long %ld != 8?\n", me,dst_long); exit(1); } /* verify previous cswap() did not swap */ ltmp = shmem_long_g(src_long,1); if (ltmp != 8) { printf("PE-%d failed cond long_cswap() swapped? rem(%ld) != 8?\n", me,ltmp); exit(1); } /* long long swap */ lltmp = shmem_longlong_g(src_llong,1); Vprintf("PE-0 Initial Conditions(long long) local %lld rem(%lld)\n", dst_llong,lltmp); dst_llong = shmem_longlong_cswap(src_llong,*src_llong,0,1); if (dst_llong != 16) { printf("PE-%d dst_llong %lld != 16?\n",me,dst_llong); exit(1); } /* verify remote data */ lltmp = shmem_longlong_g(src_llong,1); if (lltmp != 0) { printf("PE-%d longlong rem(%lld) != 0?\n",me,lltmp); exit(1); } Vprintf("PE-0 1st longlong_cswap done: local %lld rem(%lld)\n", dst_llong, lltmp); dst_llong = shmem_longlong_cswap(src_llong,0,dst_llong,1); if (dst_llong != 0) { printf("PE-%d dst_llong %lld != 0?\n",me,dst_llong); exit(1); } /* verify remote data */ lltmp = shmem_longlong_g(src_llong,1); if (lltmp != 16) { printf("PE-%d long long rem(%lld) != 16?\n",me,lltmp); exit(1); } Vprintf("PE-0 2nd longlong_swap done: local %lld rem(%lld)\n", dst_llong,lltmp); /* cswap() should not swap as cond(0) != remote(8) */ dst_llong = shmem_longlong_cswap(src_llong,0,0,1); if (dst_llong != 16) { printf("PE-%d longlong no-swap returned dst_llong %lld != 16?\n", me,dst_llong); exit(1); } /* verify previous cswap() did not swap */ lltmp = shmem_longlong_g(src_llong,1); if (lltmp != 16) { printf("PE-0 failed cond longlong_cswap() swapped? rem(%lld) != 16?\n", lltmp); exit(1); } } else { if (!shmem_addr_accessible(src_int,0)) { printf("PE-%d local src_int %p not accessible from PE-%d?\n", me, (void*)src_int, 0); exit(1); } if (!shmem_addr_accessible(src_long,0)) { printf("PE-%d local src_long %p not accessible from PE-%d?\n", me, (void*)src_long, 0); exit(1); } if (!shmem_addr_accessible(src_llong,0)) { printf("PE-%d local src_llong %p not accessible from PE-%d?\n", me, (void*)src_llong, 0); exit(1); } } shmem_barrier_all(); /* shmem_*fadd() exercise */ if (me == 0) { itmp = 0; ltmp = 0; lltmp = 0; *src_int = 0; *src_long = 0; *src_llong = 0; } shmem_barrier_all(); (void)shmem_int_fadd( &itmp, me+1, 0 ); (void)shmem_long_fadd( <mp, me+1, 0 ); (void)shmem_longlong_fadd( &lltmp, me+1, 0 ); shmem_barrier_all(); if (me == 0) { int tot; for(pe=0,tot=0; pe < num_pes; pe++) tot += pe+1; if ( itmp != tot ) printf("fadd() total %d != expected %d?\n",itmp,tot); if ( ltmp != (long)tot ) printf("fadd() total %ld != expected %d?\n",ltmp,tot); if ( lltmp != (long long)tot ) printf("fadd() total %lld != expected %d?\n",lltmp,tot); } shmem_barrier_all(); (void)shmem_int_finc(src_int,0); (void)shmem_long_finc(src_long,0); (void)shmem_longlong_finc(src_llong,0); shmem_barrier_all(); if (me == 0) { int tot = num_pes; if ( *src_int != tot ) printf("finc() total %d != expected %d?\n",*src_int,tot); if ( *src_long != (long)tot ) printf("finc() total %ld != expected %d?\n",*src_long,tot); if ( *src_llong != (long long)tot ) printf("finc() total %lld != expected %d?\n",*src_llong,tot); } shmem_barrier_all(); shfree(src_int); shfree(src_long); shfree(src_llong); } if (Verbose) fprintf(stderr,"[%d] exit\n",_my_pe()); return 0; }
/* * Each PE sends the contents of its local buckets to the PE that owns that bucket. */ static KEY_TYPE * exchange_keys(int const * const send_offsets, int const * const local_bucket_sizes, KEY_TYPE const * const my_local_bucketed_keys) { timer_start(&timers[TIMER_ATA_KEYS]); const int my_rank = shmem_my_pe(); unsigned int total_keys_sent = 0; // Keys destined for local key buffer can be written with memcpy const long long int write_offset_into_self = shmem_longlong_fadd( &receive_offset, (long long int)local_bucket_sizes[my_rank], my_rank); assert((unsigned long long)write_offset_into_self + (unsigned long long)local_bucket_sizes[my_rank] <= KEY_BUFFER_SIZE); memcpy(&my_bucket_keys[write_offset_into_self], &my_local_bucketed_keys[send_offsets[my_rank]], local_bucket_sizes[my_rank]*sizeof(KEY_TYPE)); for(uint64_t i = 0; i < NUM_PES; ++i){ #ifdef PERMUTE const int target_pe = permute_array[i]; #elif INCAST const int target_pe = i; #else const int target_pe = (my_rank + i) % NUM_PES; #endif // Local keys already written with memcpy if(target_pe == my_rank){ continue; } const int read_offset_from_self = send_offsets[target_pe]; const int my_send_size = local_bucket_sizes[target_pe]; const long long int write_offset_into_target = shmem_longlong_fadd( &receive_offset, (long long int)my_send_size, target_pe); #ifdef DEBUG printf("Rank: %d Target: %d Offset into target: %lld Offset into myself: %d Send Size: %d\n", my_rank, target_pe, write_offset_into_target, read_offset_from_self, my_send_size); #endif // fprintf(stderr, "PUTTING %llu\n", my_send_size); assert((unsigned long long)write_offset_into_target + (unsigned long long)my_send_size <= KEY_BUFFER_SIZE); assert((unsigned long long)read_offset_from_self + (unsigned long long)my_send_size <= NUM_KEYS_PER_PE); shmem_int_put(&(my_bucket_keys[write_offset_into_target]), &(my_local_bucketed_keys[read_offset_from_self]), my_send_size, target_pe); total_keys_sent += my_send_size; } #ifdef BARRIER_ATA SHMEM_BARRIER_AT_EXCHANGE; #endif timer_stop(&timers[TIMER_ATA_KEYS]); timer_count(&timers[TIMER_ATA_KEYS], total_keys_sent); #ifdef DEBUG wait_my_turn(); char msg[1024]; sprintf(msg,"Rank %d: Bucket Size %lld | Total Keys Sent: %u | Keys after exchange:", my_rank, receive_offset, total_keys_sent); for(long long int i = 0; i < receive_offset; ++i){ if(i < PRINT_MAX) sprintf(msg + strlen(msg),"%d ", my_bucket_keys[i]); } sprintf(msg + strlen(msg),"\n"); printf("%s",msg); fflush(stdout); my_turn_complete(); #endif return my_bucket_keys; }
int main () { int me, npes; int *dest1; float *dest2; long *dest3; double *dest4; long long *dest5; int swapped_val1, new_val1; float swapped_val2, new_val2; long swapped_val3, new_val3; double swapped_val4, new_val4; long long swapped_val5, new_val5; int success = 1; int success1_p1; int success2_p1; int success3_p1; int success4_p1; int success5_p1; shmem_init (); me = shmem_my_pe (); npes = shmem_n_pes (); shmem_barrier_all (); /* Checks if there are atleast 2 executing PEs */ if (npes > 1) { dest1 = (int *) shmem_malloc (sizeof (*dest1)); dest2 = (float *) shmem_malloc (sizeof (*dest2)); dest3 = (long *) shmem_malloc (sizeof (*dest3)); dest4 = (double *) shmem_malloc (sizeof (*dest4)); dest5 = (long long *) shmem_malloc (sizeof (*dest5)); *dest1 = *dest2 = *dest3 = *dest4 = *dest5 = me; new_val1 = new_val2 = new_val3 = new_val4 = new_val5 = me; success1_p1 = success1_p2 = success2_p1 = success2_p2 = success3_p1 = success3_p2 = success4_p1 = success4_p2 = success5_p1 = success5_p2 = -1; shmem_barrier_all (); swapped_val1 = shmem_int_swap (dest1, new_val1, (me + 1) % npes); swapped_val2 = shmem_float_swap (dest2, new_val2, (me + 1) % npes); swapped_val3 = shmem_long_swap (dest3, new_val3, (me + 1) % npes); swapped_val4 = shmem_double_swap (dest4, new_val4, (me + 1) % npes); swapped_val5 = shmem_longlong_swap (dest5, new_val5, (me + 1) % npes); /* To validate the working of swap we need to check the value received at the PE that initiated the swap as well as the dest PE */ if (me == 0) { if (swapped_val1 == 1) { success1_p1 = 1; } if (swapped_val2 == 1) { success2_p1 = 1; } if (swapped_val3 == 1) { success3_p1 = 1; } if (swapped_val4 == 1) { success4_p1 = 1; } if (swapped_val5 == 1) { success5_p1 = 1; } } if (me == 1) { if (*dest1 == 0) { shmem_int_put (&success1_p2, &success, 1, 0); } if (*dest2 == 0) { shmem_int_put (&success2_p2, &success, 1, 0); } if (*dest3 == 0) { shmem_int_put (&success3_p2, &success, 1, 0); } if (*dest4 == 0) { shmem_int_put (&success4_p2, &success, 1, 0); } if (*dest5 == 0) { shmem_int_put (&success5_p2, &success, 1, 0); } } shmem_barrier_all (); if (me == 0) { if (success1_p1 && success1_p2) { printf ("Test shmem_int_swap: Passed\n"); } else { printf ("Test shmem_int_swap: Failed\n"); } if (success2_p1 && success2_p2) { printf ("Test shmem_float_swap: Passed\n"); } else { printf ("Test shmem_float_swap: Failed\n"); } if (success3_p1 && success3_p2) { printf ("Test shmem_long_swap: Passed\n"); } else { printf ("Test shmem_long_swap: Failed\n"); } if (success4_p1 && success4_p2) { printf ("Test shmem_double_swap: Passed\n"); } else { printf ("Test shmem_double_swap: Failed\n"); } if (success5_p1 && success5_p2) { printf ("Test shmem_longlong_swap: Passed\n"); } else { printf ("Test shmem_longlong_swap: Failed\n"); } } shmem_barrier_all (); /* Test conditional swaps shmem_longlong_cswap, shmem_long_cswap, shmem_int_cswap, */ *dest1 = *dest3 = *dest5 = me; new_val1 = new_val3 = new_val5 = me; success1_p1 = success1_p2 = success3_p1 = success3_p2 = success5_p1 = success5_p2 = -1; shmem_barrier_all (); swapped_val1 = shmem_int_cswap (dest1, me + 1, (long) me, 1); swapped_val3 = shmem_long_cswap (dest3, me + 1, (long) me, 1); swapped_val5 = shmem_longlong_cswap (dest5, me + 1, (long) me, 1); /* To validate the working of conditionalswap we need to check the value received at the PE that initiated the conditional swap as well as the dest PE */ if (me == 0) { if (swapped_val1 == 1) { success1_p1 = 1; } if (swapped_val3 == 1) { success3_p1 = 1; } if (swapped_val5 == 1) { success5_p1 = 1; } } if (me == 1) { if (*dest1 == 0) { shmem_int_put (&success1_p2, &success, 1, 0); } if (*dest3 == 0) { shmem_int_put (&success3_p2, &success, 1, 0); } if (*dest5 == 0) { shmem_int_put (&success5_p2, &success, 1, 0); } } shmem_barrier_all (); if (me == 0) { if (success1_p1 && success1_p2) { printf ("Test shmem_int_cswap: Passed\n"); } else { printf ("Test shmem_int_cswap: Failed\n"); } if (success3_p1 && success3_p2) { printf ("Test shmem_long_cswap: Passed\n"); } else { printf ("Test shmem_long_cswap: Failed\n"); } if (success5_p1 && success5_p2) { printf ("Test shmem_longlong_cswap: Passed\n"); } else { printf ("Test shmem_longlong_cswap: Failed\n"); } } shmem_barrier_all (); /* Test shmem_long_fadd, shmem_int_fadd, shmem_longlong_fadd */ *dest1 = *dest3 = *dest5 = me; new_val1 = new_val3 = new_val5 = me; success1_p1 = success1_p2 = success3_p1 = success3_p2 = success5_p1 = success5_p2 = -1; shmem_barrier_all (); swapped_val1 = shmem_int_fadd (dest1, 1, 0); swapped_val3 = shmem_long_fadd (dest3, 1, 0); swapped_val5 = shmem_longlong_fadd (dest5, 1, 0); /* To validate the working of fetch and add we need to check the old value received at the PE that initiated the fetch and increment as well as the new value on the dest PE */ if (me != 0) { if (swapped_val1 == 0) { success1_p1 = 1; } if (swapped_val3 == 0) { success3_p1 = 1; } if (swapped_val5 == 0) { success5_p1 = 1; } } if (me == 0) { if (*dest1 == npes - 1) { shmem_int_put (&success1_p2, &success, 1, npes - 1); } if (*dest3 == npes - 1) { shmem_int_put (&success3_p2, &success, 1, npes - 1); } if (*dest5 == npes - 1) { shmem_int_put (&success5_p2, &success, 1, npes - 1); } } shmem_barrier_all (); if (me == npes - 1) { if (success1_p1 && success1_p2) { printf ("Test shmem_int_fadd: Passed\n"); } else { printf ("Test shmem_int_fadd: Failed\n"); } if (success3_p1 && success3_p2) { printf ("Test shmem_long_fadd: Passed\n"); } else { printf ("Test shmem_long_fadd: Failed\n"); } if (success5_p1 && success5_p2) { printf ("Test shmem_longlong_fadd: Passed\n"); } else { printf ("Test shmem_longlong_fadd: Failed\n"); } } shmem_barrier_all (); /* Test shmem_long_finc, shmem_int_finc, shmem_longlong_finc */ *dest1 = *dest3 = *dest5 = me; new_val1 = new_val3 = new_val5 = me; success1_p1 = success1_p2 = success3_p1 = success3_p2 = success5_p1 = success5_p2 = -1; shmem_barrier_all (); swapped_val1 = shmem_int_finc (dest1, 0); swapped_val3 = shmem_long_finc (dest3, 0); swapped_val5 = shmem_longlong_finc (dest5, 0); /* To validate the working of fetch and increment we need to check the old value received at the PE that initiated the fetch and increment as well as the new value on the dest PE */ if (me != 0) { if (swapped_val1 == 0) { success1_p1 = 1; } if (swapped_val3 == 0) { success3_p1 = 1; } if (swapped_val5 == 0) { success5_p1 = 1; } } if (me == 0) { if (*dest1 == npes - 1) { shmem_int_put (&success1_p2, &success, 1, npes - 1); } if (*dest3 == npes - 1) { shmem_int_put (&success3_p2, &success, 1, npes - 1); } if (*dest5 == npes - 1) { shmem_int_put (&success5_p2, &success, 1, npes - 1); } } shmem_barrier_all (); if (me == npes - 1) { if (success1_p1 && success1_p2) { printf ("Test shmem_int_finc: Passed\n"); } else { printf ("Test shmem_int_finc: Failed\n"); } if (success3_p1 && success3_p2) { printf ("Test shmem_long_finc: Passed\n"); } else { printf ("Test shmem_long_finc: Failed\n"); } if (success5_p1 && success5_p2) { printf ("Test shmem_longlong_finc: Passed\n"); } else { printf ("Test shmem_longlong_finc: Failed\n"); } } shmem_barrier_all (); shmem_free (dest1); shmem_free (dest2); shmem_free (dest3); shmem_free (dest4); shmem_free (dest5); } else { printf ("Number of PEs must be > 1 to test shmem atomics, test skipped\n"); } shmem_finalize (); return 0; }
int main(int argc, char **argv) { int i,j; short modjs, oldjs, oldxmodjs, valuejs; int modji, oldji, oldxmodji, valueji; long modjl, oldjl, oldxmodjl, valuejl; long long modjll,oldjll,oldxmodjll, valuejll; int my_pe,n_pes; size_t max_elements,max_elements_bytes; static short *xs; static int *xi; static long *xl; static long long *xll; shmem_init(); my_pe = shmem_my_pe(); n_pes = shmem_n_pes(); #ifdef HAVE_SET_CACHE_INV shmem_set_cache_inv(); #endif /* fail if trying to use only one processor */ if ( n_pes <= 1 ){ fprintf(stderr, "FAIL - test requires at least two PEs\n"); exit(1); } if(my_pe == 0) fprintf(stderr, "shmem_fadd(%s) n_pes=%d\n", argv[0],n_pes); /* test shmem_short_fadd */ #ifdef HAVE_SHORT /* shmalloc xs on all pes (only use the one on PE 0) */ max_elements_bytes = (size_t) (sizeof(short) * n_pes); xs = shmem_malloc( max_elements_bytes ); for(i=0; i<n_pes; i++) xs[i] = 0; count_short = 0; shmem_barrier_all(); for(i=0; i<ITER; i++) { if (my_pe != 0) { oldjs = shmem_short_finc(&count_short, 0); /* get index oldjs from PE 0 */ modjs = (oldjs % (n_pes-1)); /* PE 0 is just the counter/checker */ /* add 10 to value in xs[modjs] */ valuejs = (short) 10; oldxmodjs = shmem_short_fadd(&xs[modjs], valuejs, 0); /* printf("PE=%d,oldjs=%d,modjs=%d,oldxmodjs=%d,valuejs=%d\n", my_pe,oldjs,modjs,oldxmodjs,valuejs); */ } } shmem_barrier_all(); if (my_pe == 0) { /* check xs[j] array on PE 0 */ for(j=1 ; j<n_pes; j++) { if (xs[j-1] != 10*ITER) fprintf(stderr, "FAIL PE %d of %d: xs[%d] = %d expected = %d\n", my_pe, n_pes, j-1, xs[j-1], ITER); } } shmem_free(xs); #endif /* test shmem_int_fadd */ /* shmalloc xi on all pes (only use the one on PE 0) */ max_elements_bytes = (size_t) (sizeof(int) * n_pes); xi = shmem_malloc( max_elements_bytes ); for(i=0; i<n_pes; i++) xi[i] = 0; count_int = 0; shmem_barrier_all(); for(i=0; i<ITER; i++) { if (my_pe != 0) { oldji = shmem_int_finc(&count_int, 0); /* get index oldji from PE 0 */ modji = (oldji % (n_pes-1)); /* PE 0 is just the counter/checker */ /* add 10 to value in xi[modji] */ valueji = (int) 10; oldxmodji = shmem_int_fadd(&xi[modji], valueji, 0); /* printf("PE=%d,oldji=%d,modji=%d,oldxmodji=%d,valueji=%d\n", my_pe,oldji,modji,oldxmodji,valueji); */ } } shmem_barrier_all(); if (my_pe == 0) { /* check xi[j] array on PE 0 */ for(j=1 ; j<n_pes; j++) { if (xi[j-1] != 10*ITER) fprintf(stderr, "FAIL PE %d of %d: xi[%d] = %d expected = %d\n", my_pe, n_pes, j-1, xi[j-1], ITER); } } shmem_free(xi); /* test shmem_long_fadd */ /* shmalloc xl on all pes (only use the one on PE 0) */ max_elements_bytes = (size_t) (sizeof(long) * n_pes); xl = shmem_malloc( max_elements_bytes ); for(i=0; i<n_pes; i++) xl[i] = 0; count_long = 0; shmem_barrier_all(); for(i=0; i<ITER; i++) { if (my_pe != 0) { oldjl = shmem_long_finc(&count_long, 0); /* get index oldjl from PE 0 */ modjl = (oldjl % (n_pes-1)); /* PE 0 is just the counter/checker */ /* add 10 to value in xl[modjl] */ valuejl = (long) 10; oldxmodjl = shmem_long_fadd(&xl[modjl], valuejl, 0); /* printf("PE=%d,oldjl=%ld,modjl=%ld,oldxmodjl=%ld,valuejl=%ld\n", my_pe,oldjl,modjl,oldxmodjl,valuejl); */ } } shmem_barrier_all(); if (my_pe == 0) { /* check xl[j] array on PE 0 */ for(j=1 ; j<n_pes; j++) { if (xl[j-1] != 10*ITER) fprintf(stderr, "FAIL PE %d of %d: xl[%d] = %ld expected = %ld\n", my_pe, n_pes, j-1, xl[j-1], ITER); } } shmem_free(xl); /* test shmem_longlong_fadd */ #ifdef HAVE_LONG_LONG /* shmalloc xll on all pes (only use the one on PE 0) */ max_elements_bytes = (size_t) (sizeof(long long) * n_pes); xll = shmem_malloc( max_elements_bytes ); for(i=0; i<n_pes; i++) xll[i] = 0; count_longlong = 0; shmem_barrier_all(); for(i=0; i<ITER; i++) { if (my_pe != 0) { oldjll = shmem_longlong_finc(&count_longlong, 0); /* get index oldjll from PE 0 */ modjll = (oldjll % (n_pes-1)); /* PE 0 is just the counter/checker */ /* add 10 to value in xll[modjll] */ valuejll = (long long) 10; oldxmodjll = shmem_longlong_fadd(&xll[modjll], valuejll, 0); /* printf("PE=%d,oldjll=%ld,modjll=%ld,oldxmodjll=%ld,valuejll=%ld\n", my_pe,oldjll,modjll,oldxmodjll,valuejll); */ } } shmem_barrier_all(); if (my_pe == 0) { /* check xll[j] array on PE 0 */ for(j=1 ; j<n_pes; j++) { if (xll[j-1] != 10*ITER) fprintf(stderr, "FAIL PE %d of %d: xll[%d] = %ld expected = %ld\n", my_pe, n_pes, j-1, xll[j-1], ITER); } } shmem_free(xll); #endif #ifdef SHMEM_C_GENERIC_32 /* test shmem_fadd (GENERIC 32) */ /* shmalloc xi on all pes (only use the one on PE 0) */ max_elements_bytes = (size_t) (sizeof(int) * n_pes); xi = shmem_malloc( max_elements_bytes ); for(i=0; i<n_pes; i++) xi[i] = 0; count_int = 0; shmem_barrier_all(); for(i=0; i<ITER; i++) { if (my_pe != 0) { oldji = shmem_finc(&count_int, 0); /* get index oldji from PE 0 */ modji = (oldji % (n_pes-1)); /* PE 0 is just the counter/checker */ /* add 10 to value in xi[modji] */ valueji = (int) 10; oldxmodji = shmem_fadd(&xi[modji], valueji, 0); /* printf("PE=%d,oldji=%d,modji=%d,oldxmodji=%d,valueji=%d\n", my_pe,oldji,modji,oldxmodji,valueji); */ } } shmem_barrier_all(); if (my_pe == 0) { /* check xi[j] array on PE 0 */ for(j=1 ; j<n_pes; j++) { if (xi[j-1] != 10*ITER) fprintf(stderr, "FAIL pe %d of %d: xi[%d] = %d expected = %d\n", my_pe, n_pes, j-1, xi[j-1], ITER); } } shmem_free(xi); #else /* test shmem_fadd (GENERIC 64) */ /* shmalloc xl on all pes (only use the one on PE 0) */ max_elements_bytes = (size_t) (sizeof(long) * n_pes); xl = shmem_malloc( max_elements_bytes ); for(i=0; i<n_pes; i++) xl[i] = 0; count_long = 0; shmem_barrier_all(); for(i=0; i<ITER; i++) { if (my_pe != 0) { #if (defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L) oldjl = shmem_finc(&count_long, 0); /* get index oldjl from PE 0 */ #else oldjl = shmem_long_finc(&count_long, 0); /* get index oldjl from PE 0 */ #endif modjl = (oldjl % (n_pes-1)); /* PE 0 is just the counter/checker */ /* add 10 to value in xl[modjl] */ valuejl = (long) 10; #if (defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L) oldxmodjl = shmem_fadd(&xl[modjl], valuejl, 0); #else oldxmodjl = shmem_long_fadd(&xl[modjl], valuejl, 0); #endif /* printf("PE=%d,oldjl=%ld,modjl=%ld,oldxmodjl=%ld,valuejl=%ld\n", my_pe,oldjl,modjl,oldxmodjl,valuejl); */ } } shmem_barrier_all(); if (my_pe == 0) { /* check xl[j] array on PE 0 */ for(j=1 ; j<n_pes; j++) { if (xl[j-1] != 10*ITER) fprintf(stderr, "FAIL pe %d of %d: xl[%d] = %ld expected = %ld\n", my_pe, n_pes, j-1, xl[j-1], ITER); } } shmem_free(xl); #endif shmem_barrier_all(); #ifdef NEEDS_FINALIZE shmem_finalize(); #endif return 0; }