Lines Matching defs:ARR
1371 static int ARR[N];
1381 // ARR[i] is accessed by threads from i-th subset
1383 CHECK(ARR[i] == 0);
1409 printf("\tGLOB=%d; ARR[1]=%d; ARR[7]=%d; ARR[N-1]=%d\n",
1410 GLOB, ARR[1], ARR[7], ARR[N-1]);
1423 static int ARR[N];
1428 // ARR[i] is protected by MUs from i-th subset of all MUs
1430 CHECK(ARR[i] == 0);
1462 int **ARR;
1468 CHECK(777 == *ARR[i]);
1475 ARR = new int *[N_free];
1483 ARR[i] = new int(777);
1486 // Need to put all ARR[i] into shared state in order
1492 for (int i = 0; i < N_free; i++) delete ARR[i];
1493 delete [] ARR;
3397 /*printf("\tGLOB=%d; ARR[1]=%d; ARR[7]=%d; ARR[N-1]=%d\n",
3478 /*printf("\tGLOB=%d; ARR[1]=%d; ARR[7]=%d; ARR[N-1]=%d\n",
4366 int arr[10];
4376 GLOB->arr[i] = 777;
4390 p->arr[index]++; // W/o the annotations the race will be reported here.
4391 CHECK(p->arr[index] == 778);
4407 printf("\t*GLOB=%d\n", GLOB->arr[0]);
5414 uint64_t arr[1000];
5462 MEM = &arr[arr_index++];
6287 int *arr;
6295 RaceyAccess(&arr[j]);
6310 arr = new int[kArraySize];
6315 delete arr;
