| /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;
|
| /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;
|
| DependencyAnalysis.cpp | 218 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist;
221 std::pair<BasicBlock *, BasicBlock::iterator> Pair =
223 BasicBlock *LocalStartBB = Pair.first;
224 BasicBlock::iterator LocalStartPos = Pair.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/CodeGen/ |
| CGVTT.cpp | 168 std::pair<const CXXRecordDecl *, BaseSubobject> Pair =
171 SecondaryVirtualPointerIndices.insert(std::make_pair(Pair, I->second));
|
| CGBuiltin.cpp | 265 Value *Pair = CGF.Builder.CreateAtomicCmpXchg(
270 return CGF.Builder.CreateZExt(CGF.Builder.CreateExtractValue(Pair, 1),
274 return EmitFromInt(CGF, CGF.Builder.CreateExtractValue(Pair, 0), T,
8715 // The pair-wise function has a narrower overloaded type.
12252 std::tie(Index, Value) = StringSwitch<std::pair<unsigned, unsigned>>(CPUStr)
13331 // If palignr is shifting the pair of vectors more than the size of two
13336 // If palignr is shifting the pair of input vectors more than one lane,
15821 /// this is represented as a function that returns a {result, cc} pair.
17605 static std::pair<Intrinsic::ID, unsigned>
|
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerTracePC.h | 34 struct Pair {
44 Pair Get(size_t I) { return Table[I % kSize]; }
46 Pair Table[kSize];
191 std::pair<size_t, size_t> FocusFunction = {-1, -1}; // Module and PC IDs.
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| 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/lib/IR/ |
| DataLayout.cpp | 218 std::pair<StringRef, StringRef> &Split) {
260 std::pair<StringRef, StringRef> Split;
553 auto Pair = std::make_pair((unsigned)AlignType, BitWidth);
555 return std::make_pair(E.AlignType, E.TypeBitWidth) < Pair;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/MCTargetDesc/ |
| 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/libcxx/benchmarks/ |
| algorithms.bench.cpp | 17 enum class ValueType { Uint32, Uint64, Pair, Tuple, String };
20 "uint32", "uint64", "pair<uint32, uint32>",
30 V() == ValueType::Pair, std::pair<uint32_t, uint32_t>,
60 void fillValues(std::vector<std::pair<T, T> >& V, size_t N, Order O) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| MemoryDependenceAnalysis.h | 65 /// desired value. The pointer member of the MemDepResult pair holds the
77 /// MemDepResult pair holds the instruction that defines the memory.
98 /// More detailed state info is encoded in the upper part of the pair (i.e.
286 /// A pair<Value*, bool> where the bool is true if the dependence is a read
290 /// This pair is used when caching information for a block.
297 /// This record is the information kept for each (value, is load) pair.
299 /// The pair of the block and the skip-first-block flag.
300 BBSkipFirstBlockPair Pair;
342 using PerInstNLInfo = std::pair<NonLocalDepInfo, bool>;
|
| /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/lib/CodeGen/ |
| ShadowStackGCLowering.cpp | 62 /// Roots - GC roots in the current function. Each is a pair of the
64 std::vector<std::pair<CallInst *, AllocaInst *>> Roots;
239 SmallVector<std::pair<CallInst *, AllocaInst *>, 16> MetaRoots;
246 std::pair<CallInst *, AllocaInst *> Pair = std::make_pair(
250 Roots.push_back(Pair);
252 MetaRoots.push_back(Pair);
|
| /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/Target/Sparc/ |
| SparcISelDAGToDAG.cpp | 266 SDValue Pair = SDValue(
283 Chain = CurDAG->getCopyToReg(T1, dl, GPVR, Pair, T1.getValue(1));
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyFixFunctionBitcasts.cpp | 67 SmallVectorImpl<std::pair<Use *, Function *>> &Uses,
241 SmallVector<std::pair<Use *, Function *>, 0> Uses;
277 DenseMap<std::pair<Function *, FunctionType *>, Function *> Wrappers;
291 auto Pair = Wrappers.insert(std::make_pair(std::make_pair(F, Ty), nullptr));
292 if (Pair.second)
293 Pair.first->second = createWrapper(F, Ty);
295 Function *Wrapper = Pair.first->second;
|
| WebAssemblyFixIrreducibleControlFlow.cpp | 138 using BlockPair = std::pair<MachineBasicBlock *, MachineBasicBlock *>;
379 auto Pair = Indices.insert(std::make_pair(Entry, 0));
380 assert(Pair.second);
383 Pair.first->second = Index;
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-mc/ |
| llvm-mc.cpp | 271 auto Pair = StringRef(I).split('=');
272 auto Sym = Pair.first;
273 auto Val = Pair.second;
|
| /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...] |
| /src/external/apache2/llvm/dist/llvm/lib/Bitcode/Writer/ |
| ValueEnumerator.cpp | 51 DenseMap<const Value *, std::pair<unsigned, bool>> IDs;
66 std::pair<unsigned, bool> &operator[](const Value *V) { return IDs[V]; }
68 std::pair<unsigned, bool> lookup(const Value *V) const {
204 using Entry = std::pair<const Use *, unsigned>;
356 static bool isIntOrIntVectorValue(const std::pair<const Value*, unsigned> &V) {
419 SmallVector<std::pair<unsigned, MDNode *>, 8> MDs;
576 [this](const std::pair<const Value *, unsigned> &LHS,
577 const std::pair<const Value *, unsigned> &RHS) {
673 SmallVector<std::pair<const MDNode *, MDNode::op_iterator>, 32> Worklist;
1028 IndexAndAttrSet Pair = {i, AS}
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/Symbolize/ |
| Symbolize.cpp | 500 auto Pair = BinaryForPath.emplace(Path, OwningBinary<Binary>());
501 if (!Pair.second) {
502 Bin = Pair.first->second.getBinary();
507 Pair.first->second = std::move(BinOrErr.get());
508 Bin = Pair.first->second.getBinary();
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonAsmPrinter.cpp | 65 // Given a scalar register return its pair.
70 unsigned Pair = *SR;
71 assert(Hexagon::DoubleRegsRegClass.contains(Pair));
72 return Pair;
127 case 'H': { // The highest-numbered register of a pair.
465 // Add a new operand for the second register in the pair.
543 // Add a new operand for the second register in the pair.
555 // Add a new operand for the second register in the pair.
569 // Add a new operand for the second register in the pair.
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 122 DenseSet<std::pair<Value*, Value*> > TentativeValues;
131 typedef std::pair<BasicBlock*, BasicBlock*> BlockPair;
185 BlockPair Pair = Queue.remove_min();
186 diff(Pair.first, Pair.second);
688 SmallVector<std::pair<Function*,Function*>, 20> Queue;
730 for (SmallVectorImpl<std::pair<Function*,Function*> >::iterator
|
