| /freebsd-12.1/contrib/googletest/googletest/scripts/ |
| H A D | gen_gtest_pred_impl.py | 188 def Iter(n, format, sep=''): function 222 impl += Iter(n, """, 228 impl += Iter(n, """, 234 impl += Iter(n, """, 244 impl += Iter(n, """ 249 impl += Iter(n, """ 266 impl += Iter(n, """, \\ 272 impl += Iter(n, """, \\ 472 tests += Iter(n, """, 499 tests += Iter(n, """, [all …]
|
| /freebsd-12.1/sys/contrib/zstd/contrib/pzstd/utils/ |
| H A D | Range.h | 47 template <typename Iter> 49 Iter b_; 50 Iter e_; 54 using iterator = Iter; 55 using const_iterator = Iter; 61 constexpr Range(Iter begin, Iter end) : b_(begin), e_(end) {} 77 (!std::is_same<Iter, OtherIter>::value && 78 std::is_convertible<OtherIter, Iter>::value), 95 Iter data() const { 98 Iter begin() const { [all …]
|
| /freebsd-12.1/contrib/compiler-rt/lib/tsan/rtl/ |
| H A D | tsan_clock.h | 43 class Iter { 45 explicit Iter(SyncClock* parent); 46 Iter& operator++(); 60 Iter begin(); 61 Iter end(); 65 friend class Iter; variable 190 return Iter(this); in begin() 194 return Iter(nullptr); in end() 201 ALWAYS_INLINE SyncClock::Iter::Iter(SyncClock* parent) in Iter() function 210 ALWAYS_INLINE SyncClock::Iter& SyncClock::Iter::operator++() { [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | StratifiedSets.h | 96 auto Iter = Values.find(Elem); in find() local 97 if (Iter == Values.end()) in find() 99 return Iter->second; in find() 284 assert(Iter != Remaps.end()); in finalizeSets() 285 Link.Above = Iter->second; in finalizeSets() 291 assert(Iter != Remaps.end()); in finalizeSets() 292 Link.Below = Iter->second; in finalizeSets() 299 auto Iter = Remaps.find(Link.Number); in finalizeSets() local 300 assert(Iter != Remaps.end()); in finalizeSets() 301 Info.Index = Iter->second; in finalizeSets() [all …]
|
| H A D | CFLSteensAliasAnalysis.cpp | 247 auto Iter = Cache.find(Fn); in ensureCached() local 248 if (Iter == Cache.end()) { in ensureCached() 250 Iter = Cache.find(Fn); in ensureCached() 251 assert(Iter != Cache.end()); in ensureCached() 252 assert(Iter->second.hasValue()); in ensureCached() 254 return Iter->second; in ensureCached()
|
| /freebsd-12.1/contrib/llvm/lib/DebugInfo/CodeView/ |
| H A D | DebugStringTableSubsection.cpp | 99 auto Iter = StringToId.find(S); in getIdForString() local 100 assert(Iter != StringToId.end()); in getIdForString() 101 return Iter->second; in getIdForString() 105 auto Iter = IdToString.find(Id); in getStringForId() local 106 assert(Iter != IdToString.end()); in getStringForId() 107 return Iter->second; in getStringForId()
|
| /freebsd-12.1/contrib/llvm/include/llvm/ADT/ |
| H A D | SparseBitVector.h | 326 ElementListConstIter Iter; variable 345 Iter = BitVector->Elements.begin(); in AdvanceToFirstNonZero() 347 unsigned BitPos = Iter->find_first(); in AdvanceToFirstNonZero() 350 Bits = Iter->word(WordNumber); in AdvanceToFirstNonZero() 369 ++Iter; in AdvanceToNextNonZero() 382 Bits = Iter->word(WordNumber); in AdvanceToNextNonZero() 386 Bits = Iter->word(WordNumber); in AdvanceToNextNonZero() 399 Iter = BitVector->Elements.begin(); in BitVector() 803 Iter != Elements.end(); in count() 804 ++Iter) in count() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFVerifier.cpp | 40 auto Iter = Pos - 1; in insert() local 42 return Iter; in insert() 54 while (Iter != End) { in insert() 56 return Iter; in insert() 57 ++Iter; in insert() 77 while (Iter != End) { in contains() 80 ++Iter; in contains() 82 if (Iter == End) in contains() 95 if (Iter == End) in intersects() 99 while (Iter != End) { in intersects() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/ProfileData/ |
| H A D | ProfileSummaryBuilder.cpp | 62 auto Iter = CountFrequencies.begin(); in computeDetailedSummary() local 77 while (CurrSum < DesiredCount && Iter != End) { in computeDetailedSummary() 78 Count = Iter->first; in computeDetailedSummary() 79 uint32_t Freq = Iter->second; in computeDetailedSummary() 82 Iter++; in computeDetailedSummary()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Tooling/Inclusions/ |
| H A D | HeaderIncludes.cpp | 250 auto Iter = in addExistingInclude() local 252 Iter->second.push_back(std::move(IncludeToAdd)); in addExistingInclude() 253 auto &CurInclude = Iter->second.back(); in addExistingInclude() 286 auto Iter = IncludesByPriority.find(Priority); in insert() local 287 if (Iter != IncludesByPriority.end()) { in insert() 288 for (const auto *Inc : Iter->second) { in insert() 310 auto Iter = ExistingIncludes.find(IncludeName); in remove() local 311 if (Iter == ExistingIncludes.end()) in remove() 313 for (const auto &Inc : Iter->second) { in remove()
|
| /freebsd-12.1/contrib/llvm/lib/Target/Mips/ |
| H A D | MipsDelaySlotFiller.cpp | 107 using Iter = MachineBasicBlock::iterator; typedef 252 Iter replaceWithCompactBranch(MachineBasicBlock &MBB, Iter Branch, 274 bool searchForward(MachineBasicBlock &MBB, Iter Slot) const; 279 bool searchSuccBBs(MachineBasicBlock &MBB, Iter Slot) const; 327 static void addLiveInRegs(Iter Filler, MachineBasicBlock &MBB) { in addLiveInRegs() 560 Iter Branch, in replaceWithCompactBranch() 607 for (Iter I = MBB.begin(); I != MBB.end(); ++I) { in runOnMachineBasicBlock() 769 Iter Slot) const { in searchForward() 776 Iter Filler; in searchForward() 790 Iter Slot) const { in searchSuccBBs() [all …]
|
| H A D | MipsAnalyzeImmediate.cpp | 29 for (InstSeqLs::iterator Iter = SeqLs.begin(); Iter != SeqLs.end(); ++Iter) in AddInstr() local 30 Iter->push_back(I); in AddInstr()
|
| H A D | MipsBranchExpansion.cpp | 124 using Iter = MachineBasicBlock::iterator; typedef 159 void replaceBranch(MachineBasicBlock &MBB, Iter Br, const DebugLoc &DL, 193 static Iter getNextMachineInstrInBB(Iter Position) { in getNextMachineInstrInBB() 194 Iter I = Position, E = Position->getParent()->end(); in getNextMachineInstrInBB() 196 [](const Iter &Insn) { return Insn->isTransient(); }); in getNextMachineInstrInBB() 203 static std::pair<Iter, bool> getNextMachineInstr(Iter Position, in getNextMachineInstr() 217 Iter Instr = getNextMachineInstrInBB(Position); in getNextMachineInstr() 335 void MipsBranchExpansion::replaceBranch(MachineBasicBlock &MBB, Iter Br, in replaceBranch() 741 for (Iter I = FI->begin(); I != FI->end(); ++I) { in handleForbiddenSlot() 747 Iter Inst; in handleForbiddenSlot() [all …]
|
| H A D | MipsSEFrameLowering.cpp | 74 using Iter = MachineBasicBlock::iterator; typedef in __anon93ab41760111::ExpandPseudo 76 bool expandInstr(MachineBasicBlock &MBB, Iter I); 77 void expandLoadCCond(MachineBasicBlock &MBB, Iter I); 78 void expandStoreCCond(MachineBasicBlock &MBB, Iter I); 82 bool expandCopy(MachineBasicBlock &MBB, Iter I); 109 for (Iter I = MBB.begin(), End = MBB.end(); I != End;) in expand() 116 bool ExpandPseudo::expandInstr(MachineBasicBlock &MBB, Iter I) { in expandInstr() 198 void ExpandPseudo::expandLoadACC(MachineBasicBlock &MBB, Iter I, in expandLoadACC() 222 void ExpandPseudo::expandStoreACC(MachineBasicBlock &MBB, Iter I, in expandStoreACC() 245 bool ExpandPseudo::expandCopy(MachineBasicBlock &MBB, Iter I) { in expandCopy() [all …]
|
| /freebsd-12.1/contrib/llvm/tools/lldb/source/Plugins/Process/elf-core/ |
| H A D | RegisterUtilities.cpp | 36 auto Iter = llvm::find_if( in getRegset() local 38 return Iter == Notes.end() ? DataExtractor() : Iter->data; in getRegset()
|
| /freebsd-12.1/contrib/llvm/include/llvm/MCA/ |
| H A D | SourceMgr.h | 36 SourceMgr(ArrayRef<UniqueInst> S, unsigned Iter) in SourceMgr() argument 37 : Sequence(S), Current(0), Iterations(Iter ? Iter : DefaultIterations) {} in SourceMgr()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | CastSizeChecker.cpp | 56 RecordDecl::field_iterator Iter(RD->field_begin()); in evenFlexibleArraySize() local 59 for (; Iter != End; ++Iter) in evenFlexibleArraySize() 60 Last = *Iter; in evenFlexibleArraySize()
|
| H A D | PaddingChecker.cpp | 287 auto Iter = std::upper_bound(CurBegin, CurEnd, InsertPoint); in calculateOptimalPad() local 288 if (Iter != CurBegin) { in calculateOptimalPad() 290 --Iter; in calculateOptimalPad() 291 NewOffset += Iter->Size; in calculateOptimalPad() 292 OptimalFieldsOrder.push_back(Iter->Field); in calculateOptimalPad() 293 Fields.erase(Iter); in calculateOptimalPad()
|
| /freebsd-12.1/contrib/llvm/tools/llvm-pdbutil/ |
| H A D | InputFile.cpp | 230 auto Iter = SC.checksums().getArray().at(Offset); in formatFromChecksumsOffset() local 231 if (Iter == SC.checksums().getArray().end()) { in formatFromChecksumsOffset() 236 uint32_t FO = Iter->FileNameOffset; in formatFromChecksumsOffset() 243 if (Iter->Kind == FileChecksumKind::None) { in formatFromChecksumsOffset() 247 formatChecksumKind(Iter->Kind), toHex(Iter->Checksum)); in formatFromChecksumsOffset() 480 auto &Iter = *SectionIter; in scanToNextDebugS() local 483 while (++Iter != End) { in scanToNextDebugS() 485 SectionRef SR = *Iter; in scanToNextDebugS()
|
| H A D | DumpOutputStyle.h | 54 auto Iter = Individual.try_emplace(Kind, 1, RecordSize); in update() local 55 if (!Iter.second) in update() 56 Iter.first->second.update(RecordSize); in update()
|
| /freebsd-12.1/contrib/llvm/include/llvm/DebugInfo/DWARF/ |
| H A D | DWARFVerifier.h | 70 auto Iter = std::upper_bound(Begin, End, R); in findRange() local 71 if (Iter != Begin) in findRange() 72 --Iter; in findRange() 73 return Iter; in findRange()
|
| /freebsd-12.1/contrib/llvm/include/llvm/TableGen/ |
| H A D | SetTheory.h | 131 template<typename Iter> 132 void evaluate(Iter begin, Iter end, RecSet &Elts, ArrayRef<SMLoc> Loc) { in evaluate()
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/ |
| H A D | UnresolvedSet.h | 40 explicit UnresolvedSetIterator(DeclAccessPair *Iter) in UnresolvedSetIterator() argument 41 : iterator_adaptor_base(Iter) {} in UnresolvedSetIterator() 42 explicit UnresolvedSetIterator(const DeclAccessPair *Iter) in UnresolvedSetIterator() argument 43 : iterator_adaptor_base(const_cast<DeclAccessPair *>(Iter)) {} in UnresolvedSetIterator()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/ObjCARC/ |
| H A D | ObjCARCContract.cpp | 79 Function &F, Instruction *Inst, inst_iterator &Iter, 94 Instruction *Release, inst_iterator &Iter, 360 Instruction *Release, inst_iterator &Iter, in tryToContractReleaseIntoStoreStrong() argument 425 if (&*Iter == Retain) ++Iter; in tryToContractReleaseIntoStoreStrong() 426 if (&*Iter == Store) ++Iter; in tryToContractReleaseIntoStoreStrong() 435 Function &F, Instruction *Inst, inst_iterator &Iter, in tryToPeepholeInstruction() argument 515 tryToContractReleaseIntoStoreStrong(Inst, Iter, BlockColors); in tryToPeepholeInstruction()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/ |
| H A D | CFGMST.h | 257 auto Iter = BBInfos.end(); in addEdge() local 259 std::tie(Iter, Inserted) = BBInfos.insert(std::make_pair(Src, nullptr)); in addEdge() 262 Iter->second = std::move(llvm::make_unique<BBInfo>(Index)); in addEdge() 265 std::tie(Iter, Inserted) = BBInfos.insert(std::make_pair(Dest, nullptr)); in addEdge() 268 Iter->second = std::move(llvm::make_unique<BBInfo>(Index)); in addEdge()
|