HomeSort by: relevance | last modified time | path
    Searched refs:hasNext (Results 1 - 16 of 16) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/
SourceMgr.h 41 bool hasNext() const { return Current < (Iterations * Sequence.size()); }
45 assert(hasNext() && "Already at end of sequence!");
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_bitvector.h 84 // for (BasicBitVector<>::Iterator it(bv); it.hasNext();) {
92 bool hasNext() const { return !bv_.empty(); }
270 // for (TwoLevelBitVector<>::Iterator it(bv); it.hasNext();) {
282 bool hasNext() const {
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...]
sanitizer_bvgraph.h 136 for (typename BV::Iterator it(v[from]); it.hasNext(); ) {
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_bitvector.h 83 // for (BasicBitVector<>::Iterator it(bv); it.hasNext();) {
91 bool hasNext() const { return !bv_.empty(); }
269 // for (TwoLevelBitVector<>::Iterator it(bv); it.hasNext();) {
281 bool hasNext() const {
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...]
sanitizer_bvgraph.h 135 for (typename BV::Iterator it(v[from]); it.hasNext(); ) {
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_bitvector.h 83 // for (BasicBitVector<>::Iterator it(bv); it.hasNext();) {
91 bool hasNext() const { return !bv_.empty(); }
269 // for (TwoLevelBitVector<>::Iterator it(bv); it.hasNext();) {
281 bool hasNext() const {
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...]
sanitizer_bvgraph.h 135 for (typename BV::Iterator it(v[from]); it.hasNext(); ) {
  /src/external/apache2/llvm/dist/llvm/lib/MCA/Stages/
EntryStage.cpp 33 if (!SM.hasNext())
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_bitvector_test.cc 38 for (typename BV::Iterator it(bv); it.hasNext();) {
  /src/external/apache2/llvm/dist/clang/include/clang/Sema/
Lookup.h 639 bool hasNext() const {
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaLookup.cpp 2592 while (F.hasNext()) {
3394 while (F.hasNext()) {
SemaDecl.cpp 1548 while (F.hasNext()) {
1617 while (F.hasNext())
2167 while (Filter.hasNext()) {
15718 while (F.hasNext()) {
15744 while (F.hasNext()) {
SemaExprCXX.cpp 220 while (F.hasNext()) {
2692 while (Filter.hasNext()) {
SemaTemplate.cpp 147 while (filter.hasNext()) {
8902 while (F.hasNext()) {
SemaDeclCXX.cpp 12029 while (F.hasNext()) {
13748 while (F.hasNext()) {
SemaOpenMP.cpp 19325 while (Filter.hasNext()) {
19577 while (Filter.hasNext()) {

Completed in 106 milliseconds