Lines Matching refs:NEW
124 // Create a new test instead.
287 ar_[0] = new MyThread(f1);
288 ar_[1] = f2 ? new MyThread(f2) : NULL;
289 ar_[2] = f3 ? new MyThread(f3) : NULL;
290 ar_[3] = f4 ? new MyThread(f4) : NULL;
291 ar_[4] = f5 ? new MyThread(f5) : NULL;
1483 Q1 = new ProducerConsumerQueue(INT_MAX);
1484 Q2 = new ProducerConsumerQueue(INT_MAX);
1710 vec[i] = new MyThread(Worker);
1753 MUs[i] = new Mutex;
1789 ARR = new int *[N_free];
1793 mus.push_back(new Mutex);
1797 ARR[i] = new int(777);
1968 Q1 = new
1969 Q2 = new ProducerConsumerQueue(INT_MAX);
2075 Q1 = new ProducerConsumerQueue(INT_MAX);
2076 Q2 = new ProducerConsumerQueue(INT_MAX);
3435 str = new char[8];
3486 // This way Helgrind will create new segments after each barrier.
3512 barriers[i] = new Barrier(Nlog);
3516 vec[i] = new MyThread(Worker);
3570 // This way Helgrind will create new segments after each barrier.
3604 barriers[i] = new Barrier(Nlog);
3608 vec[i] = new MyThread(Worker);
3774 object = new RefCountedClass;
3802 object = new RefCountedClass;
3829 object = new RefCountedClass;
3857 // We swap the new empty map 'tmp' with 'MAP'.
3953 object = new AtomicRefCountedClass;
3979 object = new AtomicRefCountedClass;
3993 // Writer creates a new object and makes the pointer visible to the Reader.
4032 foo[i] = new FOO;
4046 // At this point Reader() sees the new value of foo[i]
4047 // but in very rare cases will not see the new value of foo[i]->arr_.
4072 ptr = new int(777);
4146 // We create an object 'A *a = new B'
4159 // 1. A a* = new B;
4196 A *a = new B;
4235 // We create an object 'A *a = new C' in Thread1 and pass it to Thread2.
4273 A *a = new C;
4369 HEAP_STRUCT = new STRUCT;
4378 A *a = new C;
4514 GLOB = new ObjType;
5089 GLOB = new int;
5149 static const Foo *foo = new Foo();
5176 // pthread_create with the new thread
5193 t[i] = new MyThread(Worker, &GLOB[i]);
5231 int *NEW;
5249 (*NEW)++;
5266 NEW = new int;
5267 NEW_ARR = new int[10];
5293 FAST_MODE_INIT(NEW);
5294 ANNOTATE_EXPECT_RACE(NEW, "real race on a new-ed object");
5296 ANNOTATE_EXPECT_RACE(NEW_ARR, "real race on a new[]-ed object");
5314 delete NEW;
5432 GLOB = new char [N];
5618 t[i] = new MyThread(Worker);
5727 foo = new Foo;
5947 a_large_local_array_of_mutexes = new Mutex[N];
6038 blocking_counter = new BlockingCounter(3);
6272 // We swap the new empty map 'tmp' with 'map'.
6423 obj = new RefCountedClass;
6468 // we are publishing the new container.
6811 STR = new string ("The String");
6831 // TRACE[1]: Access{T2/S2 wr} -> new State{Mod; #LS=2; #SS=1; T2/S2}
6832 // TRACE[2]: Access{T4/S9 wr} -> new State{Mod; #LS=1; #SS=2; T2/S2, T4/S9}
6833 // TRACE[3]: Access{T5/S13 wr} -> new State{Mod; #LS=1; #SS=3; T2/S2, T4/S9, T5/S13}
6834 // TRACE[4]: Access{T6/S19 wr} -> new State{Mod; #LS=0; #SS=4; T2/S2, T4/S9, T5/S13, T6/S19}
6911 GLOB = new int;
6935 foo = new Foo;
7026 PTR = new int;
7089 PTR = new int;
7178 vec = new vector<int>;
7251 vec = new vector<int>;
7406 // this code produces a new SS with each new segment
7423 Q[i] = new ProducerConsumerQueue(1);
7562 barrier[i] = new Barrier(N_threads);
7667 Mutex * mu = new Mutex();
