| /netbsd-src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 91 bool hasNext() const { return !bv_.empty(); } in hasNext() function 281 bool hasNext() const { in hasNext() function 282 if (it1_.hasNext()) return true; in hasNext() 291 if (!it1_.hasNext() && !it2_.hasNext()) { in next() 300 if (!it2_.hasNext()) { in next() 301 CHECK(it1_.hasNext()); in next() 307 CHECK(it2_.hasNext()); in next() 312 if (!it1_.hasNext() && !it2_.hasNext()) in next()
|
| H A D | sanitizer_bvgraph.h | 135 for (typename BV::Iterator it(v[from]); it.hasNext(); ) { in findPath()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 90 bool hasNext() const { return !bv_.empty(); } in hasNext() function 280 bool hasNext() const { in hasNext() function 281 if (it1_.hasNext()) return true; in hasNext() 290 if (!it1_.hasNext() && !it2_.hasNext()) { in next() 299 if (!it2_.hasNext()) { in next() 300 CHECK(it1_.hasNext()); in next() 306 CHECK(it2_.hasNext()); in next() 311 if (!it1_.hasNext() && !it2_.hasNext()) in next()
|
| H A D | sanitizer_bvgraph.h | 134 for (typename BV::Iterator it(v[from]); it.hasNext(); ) { in findPath()
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| H A D | sanitizer_bitvector.h | 92 bool hasNext() const { return !bv_.empty(); } in hasNext() function 282 bool hasNext() const { in hasNext() function 283 if (it1_.hasNext()) return true; in hasNext() 292 if (!it1_.hasNext() && !it2_.hasNext()) { in next() 301 if (!it2_.hasNext()) { in next() 302 CHECK(it1_.hasNext()); in next() 308 CHECK(it2_.hasNext()); in next() 313 if (!it1_.hasNext() && !it2_.hasNext()) in next()
|
| H A D | sanitizer_bvgraph.h | 136 for (typename BV::Iterator it(v[from]); it.hasNext(); ) { in findPath()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/MCA/ |
| H A D | SourceMgr.h | 41 bool hasNext() const { return Current < (Iterations * Sequence.size()); } in hasNext() function 45 assert(hasNext() && "Already at end of sequence!"); in peekNext()
|
| /netbsd-src/external/cddl/dtracetoolkit/dist/Examples/ |
| H A D | j_flowtime_example.txt | 1084 0 311481/2 4790260421218 13 -> java/util/AbstractList$Itr.hasNext 1085 0 311481/2 4790260421229 11 <- java/util/AbstractList$Itr.hasNext 1098 0 311481/2 4790260421346 7 -> java/util/AbstractList$Itr.hasNext 1099 0 311481/2 4790260421353 7 <- java/util/AbstractList$Itr.hasNext 1137 … 4790260422029 11 -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1138 … 4790260422037 8 <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1151 … 4790260422137 7 -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1152 … 4790260422145 7 <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1154 0 311481/2 4790260422161 7 -> java/util/AbstractList$Itr.hasNext 1155 0 311481/2 4790260422168 7 <- java/util/AbstractList$Itr.hasNext [all …]
|
| H A D | j_flow_example.txt | 1083 0 311403 4789116011087 -> java/util/AbstractList$Itr.hasNext 1084 0 311403 4789116011099 <- java/util/AbstractList$Itr.hasNext 1097 0 311403 4789116011202 -> java/util/AbstractList$Itr.hasNext 1098 0 311403 4789116011209 <- java/util/AbstractList$Itr.hasNext 1136 0 311403 4789116011858 -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1137 0 311403 4789116011866 <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1150 0 311403 4789116011953 -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1151 0 311403 4789116011961 <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1153 0 311403 4789116011974 -> java/util/AbstractList$Itr.hasNext 1154 0 311403 4789116011982 <- java/util/AbstractList$Itr.hasNext [all …]
|
| H A D | j_syscolors_example.txt | 1250 [2;35m0 311542/2 17 method -> java/util/AbstractList$Itr.hasNext[0m 1251 [2;35m0 311542/2 16 method <- java/util/AbstractList$Itr.hasNext[0m 1264 [2;35m0 311542/2 10 method -> java/util/AbstractList$Itr.hasNext[0m 1265 [2;35m0 311542/2 10 method <- java/util/AbstractList$Itr.hasNext[0m 1327 …2/2 14 method -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext[0m 1328 …2/2 11 method <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext[0m 1341 …2/2 10 method -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext[0m 1342 …2/2 10 method <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext[0m 1344 [2;35m0 311542/2 10 method -> java/util/AbstractList$Itr.hasNext[0m 1345 [2;35m0 311542/2 10 method <- java/util/AbstractList$Itr.hasNext[0m [all …]
|
| H A D | j_methodcalls_example.txt | 259 311492 1 java/util/LinkedHashMap$LinkedHashIterator.hasNext 525 311492 2 java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 702 311492 5 java/util/AbstractList$Itr.hasNext
|
| /netbsd-src/external/cddl/dtracetoolkit/dist/Docs/Examples/ |
| H A D | j_flowtime_example.txt | 1084 0 311481/2 4790260421218 13 -> java/util/AbstractList$Itr.hasNext 1085 0 311481/2 4790260421229 11 <- java/util/AbstractList$Itr.hasNext 1098 0 311481/2 4790260421346 7 -> java/util/AbstractList$Itr.hasNext 1099 0 311481/2 4790260421353 7 <- java/util/AbstractList$Itr.hasNext 1137 … 4790260422029 11 -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1138 … 4790260422037 8 <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1151 … 4790260422137 7 -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1152 … 4790260422145 7 <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1154 0 311481/2 4790260422161 7 -> java/util/AbstractList$Itr.hasNext 1155 0 311481/2 4790260422168 7 <- java/util/AbstractList$Itr.hasNext [all …]
|
| H A D | j_flow_example.txt | 1083 0 311403 4789116011087 -> java/util/AbstractList$Itr.hasNext 1084 0 311403 4789116011099 <- java/util/AbstractList$Itr.hasNext 1097 0 311403 4789116011202 -> java/util/AbstractList$Itr.hasNext 1098 0 311403 4789116011209 <- java/util/AbstractList$Itr.hasNext 1136 0 311403 4789116011858 -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1137 0 311403 4789116011866 <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1150 0 311403 4789116011953 -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1151 0 311403 4789116011961 <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 1153 0 311403 4789116011974 -> java/util/AbstractList$Itr.hasNext 1154 0 311403 4789116011982 <- java/util/AbstractList$Itr.hasNext [all …]
|
| H A D | j_syscolors_example.txt | 1250 [2;35m0 311542/2 17 method -> java/util/AbstractList$Itr.hasNext[0m 1251 [2;35m0 311542/2 16 method <- java/util/AbstractList$Itr.hasNext[0m 1264 [2;35m0 311542/2 10 method -> java/util/AbstractList$Itr.hasNext[0m 1265 [2;35m0 311542/2 10 method <- java/util/AbstractList$Itr.hasNext[0m 1327 …2/2 14 method -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext[0m 1328 …2/2 11 method <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext[0m 1341 …2/2 10 method -> java/util/IdentityHashMap$IdentityHashMapIterator.hasNext[0m 1342 …2/2 10 method <- java/util/IdentityHashMap$IdentityHashMapIterator.hasNext[0m 1344 [2;35m0 311542/2 10 method -> java/util/AbstractList$Itr.hasNext[0m 1345 [2;35m0 311542/2 10 method <- java/util/AbstractList$Itr.hasNext[0m [all …]
|
| H A D | j_methodcalls_example.txt | 259 311492 1 java/util/LinkedHashMap$LinkedHashIterator.hasNext 525 311492 2 java/util/IdentityHashMap$IdentityHashMapIterator.hasNext 702 311492 5 java/util/AbstractList$Itr.hasNext
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/MCA/Stages/ |
| H A D | EntryStage.cpp | 33 if (!SM.hasNext()) in getNextInstruction()
|
| /netbsd-src/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();) { in CheckBV()
|
| /netbsd-src/external/apache2/llvm/dist/clang/include/clang/Sema/ |
| H A D | Lookup.h | 639 bool hasNext() const { in hasNext() function
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/ |
| H A D | SemaLookup.cpp | 2592 while (F.hasNext()) { in DiagnoseAmbiguousLookup() 3394 while (F.hasNext()) { in LookupLiteralOperator()
|
| H A D | SemaDecl.cpp | 1548 while (F.hasNext()) { in FilterLookupForScope() 1617 while (F.hasNext()) in RemoveUsingDecls() 2167 while (Filter.hasNext()) { in filterNonConflictingPreviousTypedefDecls() 15718 while (F.hasNext()) { in ActOnTag() 15744 while (F.hasNext()) { in ActOnTag()
|
| H A D | SemaExprCXX.cpp | 220 while (F.hasNext()) { in getDestructorName() 2692 while (Filter.hasNext()) { in FindAllocationFunctions()
|
| H A D | SemaTemplate.cpp | 147 while (filter.hasNext()) { in FilterAcceptableTemplateNames() 8902 while (F.hasNext()) { in CheckDependentFunctionTemplateSpecialization()
|
| H A D | SemaDeclCXX.cpp | 12029 while (F.hasNext()) { in BuildUsingDeclaration() 13748 while (F.hasNext()) { in buildSingleCopyAssignRecursively()
|
| H A D | SemaOpenMP.cpp | 19325 while (Filter.hasNext()) { in ActOnOpenMPDeclareReductionDirectiveStart() 19577 while (Filter.hasNext()) { in ActOnOpenMPDeclareMapperDirective()
|