/external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.star/ |
H A D | op_star.pass.cpp | 35 template <class It> 37 test(It i, typename std::iterator_traits<It>::value_type x) 39 std::move_iterator<It> r(i); 41 typename std::iterator_traits<It>::value_type x2 = *r;
|
/external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.op=/ |
H A D | reverse_iterator.pass.cpp | 27 template <class It, class U> 32 std::reverse_iterator<It> r1; 33 std::reverse_iterator<It>& rr = r1 = r2;
|
/external/libcxx/test/std/utilities/memory/specialized.algorithms/specialized.destroy/ |
H A D | destroy.pass.cpp | 36 using It = forward_iterator<Counted*>; 45 std::destroy(It(p), It(p + 4));
|
/external/llvm/lib/Target/X86/ |
H A D | X86CallingConv.h | 91 for (auto &It : PendingMembers) { 93 It.convertToReg(State.AllocateReg(RegList[FirstFree++])); 95 It.convertToMem(State.AllocateStack(4, 4)); 96 State.addLoc(It);
|
/external/libcxx/test/std/utilities/memory/specialized.algorithms/uninitialized.move/ |
H A D | uninitialized_move.pass.cpp | 61 using It = forward_iterator<ThrowsCounted*>; 68 std::uninitialized_move(values, values + N, It(p)); 83 using It = input_iterator<int*>; 89 auto ret = std::uninitialized_move(It(values), It(values + 1), FIt(p)); 95 ret = std::uninitialized_move(It(values+1), It(values+N), FIt(p+1));
|
H A D | uninitialized_move_n.pass.cpp | 61 using It = forward_iterator<ThrowsCounted*>; 68 std::uninitialized_move_n(values, N, It(p)); 83 using It = input_iterator<int*>; 89 auto ret = std::uninitialized_move_n(It(values), 1, FIt(p)); 90 assert(ret.first == It(values +1)); 96 ret = std::uninitialized_move_n(It(values+1), N-1, FIt(p+1)); 97 assert(ret.first == It(values+N));
|
/external/libcxx/test/std/strings/basic.string/string.cons/ |
H A D | iter_alloc.pass.cpp | 26 template <class It> 28 test(It first, It last) 30 typedef typename std::iterator_traits<It>::value_type charT; 37 for (It it = first; it != last; ++it, ++i) 43 template <class It, class A> 45 test(It first, It last, const A& a) 47 typedef typename std::iterator_traits<It>::value_type charT; 53 for (It i [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 74 typename MapTy::iterator It = Map.find(Key); local 75 if (It == Map.end()) 77 return Vector.begin() + It->second; 81 typename MapTy::const_iterator It = Map.find(Key); local 82 if (It == Map.end()) 84 return Vector.begin() + It->second; 91 typename MapTy::iterator It = Map.find(Key); local 92 if (It == Map.end()) 94 Vector[It->second].first = KeyT(); 95 Map.erase(It); [all...] |
/external/libcxx/test/std/experimental/filesystem/class.path/path.member/ |
H A D | path.append.pass.cpp | 251 template <class It, class = decltype(fs::path{}.append(std::declval<It>()))> 253 template <class It> 256 template <class It, class = decltype(fs::path{}.operator/=(std::declval<It>()))> 258 template <class It> 261 template <class It> 263 static_assert(has_append<It>(0) == has_append_op<It>(0), "must be same"); 264 return has_append<It>( [all...] |
H A D | path.concat.pass.cpp | 269 template <class It, class = decltype(fs::path{}.concat(std::declval<It>()))> 271 template <class It> 274 template <class It, class = decltype(fs::path{}.operator+=(std::declval<It>()))> 276 template <class It> 278 template <class It> 279 constexpr bool has_concat_op() { return has_concat_op<It>(0); } 281 template <class It> 283 static_assert(has_concat<It>( [all...] |
/external/libcxx/test/support/ |
H A D | test_iterators.h | 26 template <class It> 29 It it_; 35 typedef typename std::iterator_traits<It>::difference_type difference_type; 36 typedef It pointer; 37 typedef typename std::iterator_traits<It>::reference reference; 39 It base() const {return it_;} 42 explicit output_iterator(It it) : it_(it) {} 56 template <class It, 57 class ItTraits = It> 61 It it [all...] |
/external/llvm/include/llvm/IR/ |
H A D | CFG.h | 35 USE_iterator It; member in class:llvm::PredIterator 39 while (!It.atEnd() && !isa<TerminatorInst>(*It)) 40 ++It; 48 explicit inline PredIterator(Ptr *bb) : It(bb->user_begin()) { 51 inline PredIterator(Ptr *bb, bool) : It(bb->user_end()) {} 53 inline bool operator==(const Self& x) const { return It == x.It; } 57 assert(!It.atEnd() && "pred_iterator out of range!"); 58 return cast<TerminatorInst>(*It) [all...] |
/external/clang/unittests/Tooling/ |
H A D | TestVisitor.h | 138 It = ExpectedMatches.begin(), End = ExpectedMatches.end(); 139 It != End; ++It) { 140 It->ExpectFound(); 153 It = DisallowedMatches.begin(), End = DisallowedMatches.end(); 154 It != End; ++It) { 155 EXPECT_FALSE(It->Matches(Name, FullLocation)) 156 << "Matched disallowed " << *It; 160 It [all...] |
/external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.const/ |
H A D | convert.pass.cpp | 26 template <class It, class U> 31 std::move_iterator<It> r1 = r2;
|
/external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.cons/ |
H A D | reverse_iterator.pass.cpp | 26 template <class It, class U> 31 std::reverse_iterator<It> r1 = r2;
|
/external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.opref/ |
H A D | op_arrow.pass.cpp | 43 template <class It> 45 test(It i, typename std::iterator_traits<It>::value_type x) 47 std::reverse_iterator<It> r(i);
|
/external/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 78 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I); local 79 if (It == WorklistMap.end()) return; // Not in worklist. 82 Worklist[It->second] = nullptr; 84 WorklistMap.erase(It);
|
/external/llvm/lib/Analysis/ |
H A D | IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); 49 It != End; ++It) 50 IntervalMap.insert(std::make_pair(*It, I));
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); 49 It != End; ++It) 50 IntervalMap.insert(std::make_pair(*It, I));
|
/external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 67 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I); local 68 if (It == WorklistMap.end()) return; // Not in worklist. 71 Worklist[It->second] = 0; 73 WorklistMap.erase(It);
|
/external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op=/ |
H A D | move_iterator.pass.cpp | 27 template <class It, class U> 32 std::move_iterator<It> r1; 33 std::move_iterator<It>& rr = r1 = r2;
|
/external/llvm/include/llvm/Support/ |
H A D | Options.h | 112 auto It = Options.find(&detail::OptionKey<ValT, Base, Mem>::ID); local 113 assert(It != Options.end() && "Option not in OptionRegistry"); 114 return *(cl::opt<ValT> *)It->second;
|
/external/llvm/lib/Target/AMDGPU/ |
H A D | AMDILCFGStructurizer.cpp | 218 int countActiveBlock(MBBVector::const_iterator It, 342 MBBInfoMap::const_iterator It = BlockInfoMap.find(MBB); local 343 if (It == BlockInfoMap.end()) 345 return (*It).second->SccNum; 350 LoopLandInfoMap::const_iterator It = LLInfoMap.find(LoopRep); local 351 if (It == LLInfoMap.end()) 353 return (*It).second; 365 MBBInfoMap::const_iterator It = BlockInfoMap.find(MBB); local 366 if (It == BlockInfoMap.end()) 368 return (*It) 401 countActiveBlock(MBBVector::const_iterator It, MBBVector::const_iterator E) const argument 565 MachineBasicBlock::succ_iterator It = MBB->succ_begin(); local 607 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); local 631 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); local 686 MachineBasicBlock::iterator It = Pre; local 778 SmallVectorImpl<MachineBasicBlock *>::const_iterator It = local 911 MachineFunction::iterator It = GTM::nodes_begin(MF), E = GTM::nodes_end(MF); local [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | CFG.h | 33 USE_iterator It; member in class:llvm::PredIterator 37 while (!It.atEnd() && !isa<TerminatorInst>(*It)) 38 ++It; 45 explicit inline PredIterator(Ptr *bb) : It(bb->use_begin()) { 48 inline PredIterator(Ptr *bb, bool) : It(bb->use_end()) {} 50 inline bool operator==(const Self& x) const { return It == x.It; } 54 assert(!It.atEnd() && "pred_iterator out of range!"); 55 return cast<TerminatorInst>(*It) [all...] |
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64CallingConvention.h | 52 for (auto &It : PendingMembers) { 53 It.convertToMem(State.AllocateStack(Size, std::max(Align, SlotAlign))); 54 State.addLoc(It); 117 for (auto &It : PendingMembers) { 118 It.convertToReg(RegResult); 119 State.addLoc(It);
|