| /netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/MCA/ |
| H A D | SourceMgr.h | 41 bool hasNext() const { return Current < (Iterations * Sequence.size()); } function in class:llvm::mca::SourceMgr
45 assert(hasNext() && "Already at end of sequence!");
|
| /netbsd-current/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 84 // for (BasicBitVector<>::Iterator it(bv); it.hasNext();) {
92 bool hasNext() const { return !bv_.empty(); } function in class:__sanitizer::BasicBitVector::Iterator
270 // for (TwoLevelBitVector<>::Iterator it(bv); it.hasNext();) {
282 bool hasNext() const { function in class:__sanitizer::BasicBitVector::TwoLevelBitVector::Iterator
283 if (it1_.hasNext()) return true;
290 // Printf("++++: %zd %zd; %d %d; size %zd\n", i0_, i1_, it1_.hasNext(),
291 // it2_.hasNext(), kSize);
292 if (!it1_.hasNext() && !it2_.hasNext()) {
296 // Printf("+i0: %zd %zd; %d %d; size %zd\n", i0_, i1_, it1_.hasNext(),
[all...] |
| H A D | sanitizer_bvgraph.h | 136 for (typename BV::Iterator it(v[from]); it.hasNext(); ) {
|
| /netbsd-current/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 82 // for (BasicBitVector<>::Iterator it(bv); it.hasNext();) {
90 bool hasNext() const { return !bv_.empty(); } function in class:__sanitizer::BasicBitVector::Iterator
268 // for (TwoLevelBitVector<>::Iterator it(bv); it.hasNext();) {
280 bool hasNext() const { function in class:__sanitizer::BasicBitVector::TwoLevelBitVector::Iterator
281 if (it1_.hasNext()) return true;
288 // Printf("++++: %zd %zd; %d %d; size %zd\n", i0_, i1_, it1_.hasNext(),
289 // it2_.hasNext(), kSize);
290 if (!it1_.hasNext() && !it2_.hasNext()) {
294 // Printf("+i0: %zd %zd; %d %d; size %zd\n", i0_, i1_, it1_.hasNext(),
[all...] |
| H A D | sanitizer_bvgraph.h | 134 for (typename BV::Iterator it(v[from]); it.hasNext(); ) {
|
| /netbsd-current/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 83 // for (BasicBitVector<>::Iterator it(bv); it.hasNext();) {
91 bool hasNext() const { return !bv_.empty(); } function in class:__sanitizer::BasicBitVector::Iterator
269 // for (TwoLevelBitVector<>::Iterator it(bv); it.hasNext();) {
281 bool hasNext() const { function in class:__sanitizer::BasicBitVector::TwoLevelBitVector::Iterator
282 if (it1_.hasNext()) return true;
289 // Printf("++++: %zd %zd; %d %d; size %zd\n", i0_, i1_, it1_.hasNext(),
290 // it2_.hasNext(), kSize);
291 if (!it1_.hasNext() && !it2_.hasNext()) {
295 // Printf("+i0: %zd %zd; %d %d; size %zd\n", i0_, i1_, it1_.hasNext(),
[all...] |
| H A D | sanitizer_bvgraph.h | 135 for (typename BV::Iterator it(v[from]); it.hasNext(); ) {
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/MCA/Stages/ |
| H A D | EntryStage.cpp | 33 if (!SM.hasNext())
|
| /netbsd-current/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| H A D | sanitizer_bitvector_test.cc | 38 for (typename BV::Iterator it(bv); it.hasNext();) {
|
| /netbsd-current/external/apache2/llvm/dist/clang/include/clang/Sema/ |
| H A D | Lookup.h | 639 bool hasNext() const { function in class:clang::LookupResult::Filter
|
| /netbsd-current/external/apache2/llvm/dist/clang/lib/Sema/ |
| H A D | SemaLookup.cpp | 2592 while (F.hasNext()) {
3394 while (F.hasNext()) {
|
| H A D | SemaDecl.cpp | 1548 while (F.hasNext()) {
1617 while (F.hasNext())
2167 while (Filter.hasNext()) {
15718 while (F.hasNext()) {
15744 while (F.hasNext()) {
|
| H A D | SemaExprCXX.cpp | 220 while (F.hasNext()) {
2692 while (Filter.hasNext()) {
|
| H A D | SemaTemplate.cpp | 147 while (filter.hasNext()) {
8902 while (F.hasNext()) {
|
| H A D | SemaDeclCXX.cpp | 12029 while (F.hasNext()) {
13748 while (F.hasNext()) {
|
| H A D | SemaOpenMP.cpp | 19325 while (Filter.hasNext()) {
19577 while (Filter.hasNext()) {
|