| 1 | /*
|
|---|
| 2 | Copyright (c) 2017, Lawrence Livermore National Security, LLC.
|
|---|
| 3 | Produced at the Lawrence Livermore National Laboratory
|
|---|
| 4 | Written by Chunhua Liao, Pei-Hung Lin, Joshua Asplund,
|
|---|
| 5 | Markus Schordan, and Ian Karlin
|
|---|
| 6 | (email: liao6@llnl.gov, lin32@llnl.gov, asplund1@llnl.gov,
|
|---|
| 7 | schordan1@llnl.gov, karlin1@llnl.gov)
|
|---|
| 8 | LLNL-CODE-732144
|
|---|
| 9 | All rights reserved.
|
|---|
| 10 |
|
|---|
| 11 | This file is part of DataRaceBench. For details, see
|
|---|
| 12 | https://github.com/LLNL/dataracebench. Please also see the LICENSE file
|
|---|
| 13 | for our additional BSD notice.
|
|---|
| 14 |
|
|---|
| 15 | Redistribution and use in source and binary forms, with
|
|---|
| 16 | or without modification, are permitted provided that the following
|
|---|
| 17 | conditions are met:
|
|---|
| 18 |
|
|---|
| 19 | * Redistributions of source code must retain the above copyright
|
|---|
| 20 | notice, this list of conditions and the disclaimer below.
|
|---|
| 21 |
|
|---|
| 22 | * Redistributions in binary form must reproduce the above copyright
|
|---|
| 23 | notice, this list of conditions and the disclaimer (as noted below)
|
|---|
| 24 | in the documentation and/or other materials provided with the
|
|---|
| 25 | distribution.
|
|---|
| 26 |
|
|---|
| 27 | * Neither the name of the LLNS/LLNL nor the names of its contributors
|
|---|
| 28 | may be used to endorse or promote products derived from this
|
|---|
| 29 | software without specific prior written permission.
|
|---|
| 30 |
|
|---|
| 31 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
|
|---|
| 32 | CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
|---|
| 33 | INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|---|
| 34 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|---|
| 35 | DISCLAIMED. IN NO EVENT SHALL LAWRENCE LIVERMORE NATIONAL
|
|---|
| 36 | SECURITY, LLC, THE U.S. DEPARTMENT OF ENERGY OR CONTRIBUTORS BE
|
|---|
| 37 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
|
|---|
| 38 | OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|---|
| 39 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|---|
| 40 | DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|---|
| 41 | ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 42 | LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
|---|
| 43 | IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
|
|---|
| 44 | THE POSSIBILITY OF SUCH DAMAGE.
|
|---|
| 45 | */
|
|---|
| 46 |
|
|---|
| 47 | /* NOTE by WenhaoWu (wuwenhao@udel.edu)
|
|---|
| 48 | * This example is modified so that the bound can be adjusted
|
|---|
| 49 | * by defining 'N' and if it isn't defined then the bound value
|
|---|
| 50 | * in the original example is used as the default value of 'N'
|
|---|
| 51 | */
|
|---|
| 52 | #ifndef N
|
|---|
| 53 | #define N 1000
|
|---|
| 54 | #endif
|
|---|
| 55 |
|
|---|
| 56 | /*
|
|---|
| 57 | The restrict type qualifier is an indication to the compiler that,
|
|---|
| 58 | if the memory addressed by the restrict -qualified pointer is modified, no other pointer will access that same memory.
|
|---|
| 59 | If a particular chunk of memory is not modified, it can be aliased through more than one restricted pointer.
|
|---|
| 60 | A C99 restrict feature.
|
|---|
| 61 | For gcc, you must use -std=c99 to compile this program.
|
|---|
| 62 | */
|
|---|
| 63 |
|
|---|
| 64 | #include <stdlib.h>
|
|---|
| 65 | #include <stdio.h>
|
|---|
| 66 |
|
|---|
| 67 | void foo(int n, int * restrict a, int * restrict b, int * restrict c)
|
|---|
| 68 | {
|
|---|
| 69 | int i;
|
|---|
| 70 | #pragma omp parallel for
|
|---|
| 71 | for (i = 0; i < n; i++)
|
|---|
| 72 | a[i] = b[i] + c[i];
|
|---|
| 73 | }
|
|---|
| 74 |
|
|---|
| 75 | int main()
|
|---|
| 76 | {
|
|---|
| 77 | int n = N;
|
|---|
| 78 | int * a , *b, *c;
|
|---|
| 79 |
|
|---|
| 80 | a = (int*) malloc (n* sizeof (int));
|
|---|
| 81 | if (a ==0)
|
|---|
| 82 | {
|
|---|
| 83 | fprintf (stderr, "skip the execution due to malloc failures.\n");
|
|---|
| 84 | return 1;
|
|---|
| 85 | }
|
|---|
| 86 |
|
|---|
| 87 | b = (int*) malloc (n* sizeof (int));
|
|---|
| 88 | if (b ==0)
|
|---|
| 89 | {
|
|---|
| 90 | fprintf (stderr, "skip the execution due to malloc failures.\n");
|
|---|
| 91 | return 1;
|
|---|
| 92 | }
|
|---|
| 93 |
|
|---|
| 94 | c = (int*) malloc (n* sizeof (int));
|
|---|
| 95 | if (c ==0)
|
|---|
| 96 | {
|
|---|
| 97 | fprintf (stderr, "skip the execution due to malloc failures.\n");
|
|---|
| 98 | return 1;
|
|---|
| 99 | }
|
|---|
| 100 |
|
|---|
| 101 | foo (n, a, b,c);
|
|---|
| 102 |
|
|---|
| 103 | free (a);
|
|---|
| 104 | free (b);
|
|---|
| 105 | free (c);
|
|---|
| 106 | return 0;
|
|---|
| 107 | }
|
|---|
| 108 |
|
|---|