| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCPreEmitPeephole.cpp | 249 // Struct to keep track of one def/use pair for a GOT indirect access.
282 GOTDefUsePair &Pair = CandPairs[Idx];
285 if (!BBI->readsRegister(Pair.DefReg, TRI) &&
286 !BBI->modifiesRegister(Pair.DefReg, TRI))
295 if (UseOp && UseOp->isReg() && UseOp->getReg() == Pair.DefReg &&
297 Pair.UseInst = BBI;
298 Pair.UseReg = BBI->getOperand(0).getReg();
299 ValidPairs.push_back(Pair);
306 for (auto Pair = ValidPairs.begin(); Pair != ValidPairs.end(); Pair++)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/ |
| BlotMapVector.h | 28 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
56 std::pair<typename MapTy::iterator, bool> Pair =
58 if (Pair.second) {
60 Pair.first->second = Num;
64 return Vector[Pair.first->second].second;
67 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) {
68 std::pair<typename MapTy::iterator, bool> Pair
[all...] |
| ProvenanceAnalysis.cpp | 171 std::pair<CachedResultsTy::iterator, bool> Pair =
173 if (!Pair.second)
174 return Pair.first->second;
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-dwp/ |
| DWPStringPool.h | 44 auto Pair = Pool.insert(std::make_pair(Str, Offset));
45 if (Pair.second) {
51 return Pair.first->second;
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| CloneChecker.cpp | 166 for (VariablePattern::SuspiciousClonePair &Pair : Pairs) {
175 Pair.FirstCloneInfo.Variable->getNameAsString() + "' here?",
176 PathDiagnosticLocation::createBegin(Pair.FirstCloneInfo.Mention, SM,
178 R->addRange(Pair.FirstCloneInfo.Mention->getSourceRange());
181 Pair.SecondCloneInfo.Variable->getNameAsString() + "' here",
182 PathDiagnosticLocation::createBegin(Pair.SecondCloneInfo.Mention,
184 Pair.SecondCloneInfo.Mention->getSourceRange());
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| LLVMContextImpl.cpp | 55 for (auto &Pair : ValueMetadata)
56 Pair.first->dump();
70 for (auto &Pair : ValuesAsMetadata)
71 Pair.second->dropUsers();
72 for (auto &Pair : MetadataAsValues)
73 Pair.second->dropUse();
117 for (auto &Pair : MetadataAsValues)
118 MDVs.push_back(Pair.second);
125 for (auto &Pair : ValuesAsMetadata)
126 delete Pair.second
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| ReplayInlineAdvisor.cpp | 44 auto Pair = Line.split(" at callsite ");
46 auto Callee = Pair.first.split(" inlined into").first.rsplit(": ").second;
48 auto CallSite = Pair.second.split(";").first;
|
| DependenceAnalysis.cpp | 17 // There's a single entry point that analyzes the dependence between a pair
175 // Calls depends() on every possible pair and prints out the result.
819 // Go through each pair and find the widest bit to which we need
821 for (Subscript *Pair : Pairs) {
822 const SCEV *Src = Pair->Src;
823 const SCEV *Dst = Pair->Dst;
845 // Now extend each pair to the widest seen.
846 for (Subscript *Pair : Pairs) {
847 const SCEV *Src = Pair->Src;
848 const SCEV *Dst = Pair->Dst
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/ |
| DebugStringTableSubsection.cpp | 72 for (auto &Pair : StringToId) {
73 StringRef S = Pair.getKey();
74 uint32_t Offset = Begin + Pair.getValue();
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyAddMissingPrototypes.cpp | 64 std::vector<std::pair<Function *, Function *>> Replacements;
132 for (auto &Pair : Replacements) {
133 Function *OldF = Pair.first;
134 Function *NewF = Pair.second;
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Frontend/ |
| AnalyzerHelpFlags.cpp | 78 using OptionAndDescriptionTy = std::pair<StringRef, std::string>;
109 for (const auto &Pair : PrintableOptions) {
110 AnalyzerOptions::printFormattedEntry(out, Pair, /*InitialPad*/ 2,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| Dominators.h | 91 BasicBlockEdge(const std::pair<BasicBlock *, BasicBlock *> &Pair)
92 : Start(Pair.first), End(Pair.second) {}
94 BasicBlockEdge(const std::pair<const BasicBlock *, const BasicBlock *> &Pair)
95 : Start(Pair.first), End(Pair.second) {}
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| X86EVEX2VEXTablesEmitter.cpp | 32 typedef std::pair<const CodeGenInstruction *, const CodeGenInstruction *> Entry;
33 typedef std::pair<StringRef, StringRef> Predicate;
68 for (auto Pair : Table) {
69 OS << " { X86::" << Pair.first->TheDef->getName()
70 << ", X86::" << Pair.second->TheDef->getName() << " },\n";
83 for (auto Pair : Predicates)
84 OS << " case X86::" << Pair.first << ": return " << Pair.second << ";\n";
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_dense_map_info.h | 34 // We extend a pair to allow users to override the bucket type with their own
255 using Pair = detail::DenseMapPair<T, U>;
259 static constexpr Pair getEmptyKey() {
264 static constexpr Pair getTombstoneKey() {
269 static constexpr unsigned getHashValue(const Pair &PairVal) {
274 static constexpr bool isEqual(const Pair &LHS, const Pair &RHS) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| RegisterPressure.h | 303 /// Mark the \p Pair.LaneMask lanes of \p Pair.Reg as live.
304 /// Returns the previously live lanes of \p Pair.Reg.
305 LaneBitmask insert(RegisterMaskPair Pair) {
306 unsigned SparseIndex = getSparseIndexFromReg(Pair.RegUnit);
307 auto InsertRes = Regs.insert(IndexMaskPair(SparseIndex, Pair.LaneMask));
310 InsertRes.first->LaneMask |= Pair.LaneMask;
316 /// Clears the \p Pair.LaneMask lanes of \p Pair.Reg (mark them as dead).
317 /// Returns the previously live lanes of \p Pair.Reg
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/AsmParser/ |
| LLLexer.cpp | 75 uint64_t Pair[2]) {
76 Pair[0] = 0;
80 Pair[0] *= 16;
81 Pair[0] += hexDigitValue(*Buffer);
84 Pair[1] = 0;
86 Pair[1] *= 16;
87 Pair[1] += hexDigitValue(*Buffer);
96 uint64_t Pair[2]) {
97 Pair[1] = 0;
100 Pair[1] *= 16
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| CFGDiff.h | 78 for (auto Pair : M) {
81 for (auto Child : Pair.second.DI[IsInsert]) {
83 Pair.first->printAsOperand(OS, false);
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| PDBStringTableBuilder.cpp | 180 for (auto &Pair : Strings) {
181 StringRef S = Pair.getKey();
182 uint32_t Offset = Pair.getValue();
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/MCTargetDesc/ |
| WebAssemblyTargetStreamer.cpp | 124 SmallVector<std::pair<wasm::ValType, uint32_t>, 4> Grouped;
133 for (auto Pair : Grouped) {
134 Streamer.emitULEB128IntValue(Pair.second);
135 emitValueType(Pair.first);
|
| WebAssemblyInstPrinter.cpp | 224 const auto &Pair = ControlFlowStack.rbegin()[Depth];
225 if (Pair.second)
228 Label += "down to catch" + utostr(Pair.first);
259 const auto &Pair = ControlFlowStack.rbegin()[Depth];
261 (Pair.second ? "up" : "down") + " to label" +
262 utostr(Pair.first));
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| DenseMapInfo.h | 213 struct DenseMapInfo<std::pair<T, U>> {
214 using Pair = std::pair<T, U>;
218 static inline Pair getEmptyKey() {
223 static inline Pair getTombstoneKey() {
228 static unsigned getHashValue(const Pair& PairVal) {
233 static bool isEqual(const Pair &LHS, const Pair &RHS) {
|
| MapVector.h | 36 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
83 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
84 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
85 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
86 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
99 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(Key, 0);
100 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
117 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/AsmParser/ |
| LLLexer.h | 99 void HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]);
100 void FP80HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| RewriteStatepointsForGC.cpp | 434 /// the second value in the returned pair will be true. Note that either a
898 for (auto Pair : States) {
899 LLVM_DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
911 for (auto Pair : States) {
912 Value *BDV = Pair.first;
960 for (auto Pair : States) {
961 Value *BDV = Pair.first;
966 !areBothVectorOrScalar(BDV, Pair.second.getBaseValue())) &&
990 for (auto Pair : States)
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-objcopy/MachO/ |
| MachOObjcopy.cpp | 284 std::pair<StringRef, StringRef> Pair = SecName.split(',');
285 StringRef TargetSegName = Pair.first;
286 Section Sec(TargetSegName, Pair.second);
322 std::pair<StringRef, StringRef> Pair = Name.split(',');
323 if (Pair.first.size() > 16)
326 Pair.first.str().c_str());
327 if (Pair.second.size() > 16)
330 Pair.second.str().c_str())
[all...] |
