Lines Matching defs:ARR
1681 static int ARR[N];
1691 // ARR[i] is accessed by threads from i-th subset
1693 CHECK(ARR[i] == 0);
1719 printf("\tGLOB=%d; ARR[1]=%d; ARR[7]=%d; ARR[N-1]=%d\n",
1720 GLOB, ARR[1], ARR[7], ARR[N-1]);
1733 static int ARR[N];
1738 // ARR[i] is protected by MUs from i-th subset of all MUs
1740 CHECK(ARR[i] == 0);
1772 int **ARR;
1778 CHECK(777 == *ARR[i]);
1785 ARR = new int *[N_free];
1793 ARR[i] = new int(777);
1796 // Need to put all ARR[i] into shared state in order
1802 for (int i = 0; i < N_free; i++) delete ARR[i];
1803 delete [] ARR;
3524 /*printf("\tGLOB=%d; ARR[1]=%d; ARR[7]=%d; ARR[N-1]=%d\n",
3616 /*printf("\tGLOB=%d; ARR[1]=%d; ARR[7]=%d; ARR[N-1]=%d\n",
4502 int arr[10];
4512 GLOB->arr[i] = 777;
4526 p->arr[index]++; // W/o the annotations the race will be reported here.
4527 CHECK(p->arr[index] == 778);
4543 printf("\t*GLOB=%d\n", GLOB->arr[0]);
