Searched refs:getAndClearFirstOne (Results 1 - 10 of 10) sorted by relevance
| /netbsd-current/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 49 uptr getAndClearFirstOne() { function
93 uptr next() { return bv_.getAndClearFirstOne(); }
182 uptr getAndClearFirstOne() { function
185 uptr i1 = l1_[i0].getAndClearFirstOne();
186 uptr i2 = l2_[i0][i1].getAndClearFirstOne();
190 // Printf("getAndClearFirstOne: %zd %zd %zd => %zd\n", i0, i1, i2, res);
203 uptr i1 = t.getAndClearFirstOne();
222 uptr i1 = t.getAndClearFirstOne();
240 uptr i1 = t.getAndClearFirstOne();
261 uptr i1 = t.getAndClearFirstOne();
[all...] |
| H A D | sanitizer_bvgraph.h | 55 uptr node = t1.getAndClearFirstOne();
91 uptr idx = t1.getAndClearFirstOne();
118 uptr idx = to_visit.getAndClearFirstOne();
135 // Instead of a getAndClearFirstOne loop we use the slower iterator.
|
| H A D | sanitizer_deadlock_detector.h | 391 uptr idx = available_nodes_.getAndClearFirstOne();
|
| /netbsd-current/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 47 uptr getAndClearFirstOne() { function
91 uptr next() { return bv_.getAndClearFirstOne(); }
180 uptr getAndClearFirstOne() { function
183 uptr i1 = l1_[i0].getAndClearFirstOne();
184 uptr i2 = l2_[i0][i1].getAndClearFirstOne();
188 // Printf("getAndClearFirstOne: %zd %zd %zd => %zd\n", i0, i1, i2, res);
201 uptr i1 = t.getAndClearFirstOne();
220 uptr i1 = t.getAndClearFirstOne();
238 uptr i1 = t.getAndClearFirstOne();
259 uptr i1 = t.getAndClearFirstOne();
[all...] |
| H A D | sanitizer_bvgraph.h | 53 uptr node = t1.getAndClearFirstOne();
89 uptr idx = t1.getAndClearFirstOne();
116 uptr idx = to_visit.getAndClearFirstOne();
133 // Instead of a getAndClearFirstOne loop we use the slower iterator.
|
| H A D | sanitizer_deadlock_detector.h | 389 uptr idx = available_nodes_.getAndClearFirstOne();
|
| /netbsd-current/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 48 uptr getAndClearFirstOne() { function
92 uptr next() { return bv_.getAndClearFirstOne(); }
181 uptr getAndClearFirstOne() { function
184 uptr i1 = l1_[i0].getAndClearFirstOne();
185 uptr i2 = l2_[i0][i1].getAndClearFirstOne();
189 // Printf("getAndClearFirstOne: %zd %zd %zd => %zd\n", i0, i1, i2, res);
202 uptr i1 = t.getAndClearFirstOne();
221 uptr i1 = t.getAndClearFirstOne();
239 uptr i1 = t.getAndClearFirstOne();
260 uptr i1 = t.getAndClearFirstOne();
[all...] |
| H A D | sanitizer_bvgraph.h | 54 uptr node = t1.getAndClearFirstOne();
90 uptr idx = t1.getAndClearFirstOne();
117 uptr idx = to_visit.getAndClearFirstOne();
134 // Instead of a getAndClearFirstOne loop we use the slower iterator.
|
| H A D | sanitizer_deadlock_detector.h | 385 uptr idx = available_nodes_.getAndClearFirstOne();
|
| /netbsd-current/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| H A D | sanitizer_bitvector_test.cc | 50 uptr idx = t.getAndClearFirstOne();
64 uptr idx = t.getAndClearFirstOne();
113 // intersectsWith, and getAndClearFirstOne.
|
Completed in 269 milliseconds