/external/libcxx/test/std/iterators/iterator.primitives/iterator.traits/ |
H A D | const_pointer.pass.cpp | 29 typedef std::iterator_traits<const A*> It; typedef 30 static_assert((std::is_same<It::difference_type, std::ptrdiff_t>::value), ""); 31 static_assert((std::is_same<It::value_type, A>::value), ""); 32 static_assert((std::is_same<It::pointer, const A*>::value), ""); 33 static_assert((std::is_same<It::reference, const A&>::value), ""); 34 static_assert((std::is_same<It::iterator_category, std::random_access_iterator_tag>::value), "");
|
H A D | pointer.pass.cpp | 29 typedef std::iterator_traits<A*> It; typedef 30 static_assert((std::is_same<It::difference_type, std::ptrdiff_t>::value), ""); 31 static_assert((std::is_same<It::value_type, A>::value), ""); 32 static_assert((std::is_same<It::pointer, A*>::value), ""); 33 static_assert((std::is_same<It::reference, A&>::value), ""); 34 static_assert((std::is_same<It::iterator_category, std::random_access_iterator_tag>::value), "");
|
H A D | empty.pass.cpp | 36 typedef std::iterator_traits<not_an_iterator> It; typedef 37 static_assert(!(has_value_type<It>::value), "");
|
H A D | iterator.pass.cpp | 38 typedef std::iterator_traits<test_iterator> It; typedef 39 static_assert((std::is_same<It::difference_type, int>::value), ""); 40 static_assert((std::is_same<It::value_type, A>::value), ""); 41 static_assert((std::is_same<It::pointer, A*>::value), ""); 42 static_assert((std::is_same<It::iterator_category, std::forward_iterator_tag>::value), "");
|
/external/v8/test/mjsunit/compiler/ |
H A D | load-elimination-osr.js | 32 function It(x, y) { } function 35 var o = new It(); 51 var o = new It();
|
/external/libcxx/test/std/iterators/iterator.primitives/iterator.basic/ |
H A D | iterator.pass.cpp | 32 typedef std::iterator<std::forward_iterator_tag, T> It; typedef 33 static_assert((std::is_same<typename It::value_type, T>::value), ""); 34 static_assert((std::is_same<typename It::difference_type, std::ptrdiff_t>::value), ""); 35 static_assert((std::is_same<typename It::pointer, T*>::value), ""); 36 static_assert((std::is_same<typename It::reference, T&>::value), ""); 37 static_assert((std::is_same<typename It::iterator_category, std::forward_iterator_tag>::value), ""); 44 typedef std::iterator<std::bidirectional_iterator_tag, T, short> It; typedef 45 static_assert((std::is_same<typename It::value_type, T>::value), ""); 46 static_assert((std::is_same<typename It::difference_type, short>::value), ""); 47 static_assert((std::is_same<typename It 56 typedef std::iterator<std::random_access_iterator_tag, T, int, const T*> It; typedef 68 typedef std::iterator<std::input_iterator_tag, T, long, const T*, const T&> It; typedef [all...] |
/external/clang/test/SemaTemplate/ |
H A D | overload-uneval.cpp | 28 class It class in class:Wibble 34 inline bool operator!=(const It &o) const { return i != 40 Wibble<void*>::It a, b;
|
/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/clang/include/clang/AST/ |
H A D | DeclLookups.h | 27 StoredDeclsMap::iterator It, End; member in class:clang::DeclContext::all_lookups_iterator 36 all_lookups_iterator(StoredDeclsMap::iterator It, argument 38 : It(It), End(End) {} 40 DeclarationName getLookupName() const { return It->first; } 42 reference operator*() const { return It->second.getLookupResult(); } 43 pointer operator->() const { return It->second.getLookupResult(); } 50 ++It; 51 } while (It != End && 52 It [all...] |
/external/llvm/include/llvm/IR/ |
H A D | GetElementPtrTypeIterator.h | 33 static generic_gep_type_iterator begin(Type *Ty, ItTy It) { argument 36 I.OpIt = It; 39 static generic_gep_type_iterator end(ItTy It) { argument 42 I.OpIt = It; 62 // This is a non-standard operator->. It allows you to call methods on the
|
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/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 77 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I); local 78 if (It == WorklistMap.end()) return; // Not in worklist. 81 Worklist[It->second] = nullptr; 83 WorklistMap.erase(It);
|
/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/llvm/unittests/ADT/ |
H A D | StringMapTest.cpp | 237 StringMap<uint32_t>::iterator It = local 240 EXPECT_EQ("abcdef", It->first()); 241 EXPECT_EQ(42u, It->second);
|
/external/clang/lib/Analysis/ |
H A D | ThreadSafety.cpp | 77 iterator It = std::find_if(begin(), end(), local 81 if (It == end()) 330 // valid definitions. It provides SSA-like functionality when traversing the 417 /// CFG. It must be called for every assignment or DeclStmt. 988 auto It = BMap.find(Cpvd); 989 if (It == BMap.end()) 1005 auto It = BMap.find(ArgVd); 1006 if (It == BMap.end()) 1009 ArgInfo = &It->second; 1045 auto It [all...] |
/external/clang/test/CXX/stmt.stmt/stmt.iter/stmt.ranged/ |
H A D | p1.cpp | 56 struct It { struct in struct:X::C 60 It begin(); 61 It end(); 64 constexpr int operator*(const C::It &) { return 0; }
|
/external/clang/tools/arcmt-test/ |
H A D | arcmt-test.cpp | 264 std::map<StringRef, StringRef>::iterator It; local 265 It = resultMap.find(sys::path::filename(inputOrigFname)); 266 if (It == resultMap.end()) { 272 if (!sys::fs::exists(It->second)) { 273 errs() << "error: '" << It->second << "' does not exist\n"; 281 if (!filesCompareEqual(It->second, inputResultFname)) { 282 errs() << "error: '" << It->second << "' is different than " 287 resultMap.erase(It);
|
/external/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 106 ChildItTy &It = Top.second; local 109 It = GT::child_begin(Node); 113 while (It != GT::child_end(Node)) { 114 NodeType *Next = *It++;
|
/external/llvm/include/llvm/CodeGen/ |
H A D | FunctionLoweringInfo.h | 204 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN); local 205 if (It == ValueMap.end()) 208 unsigned Reg = It->second;
|
/external/llvm/lib/Target/R600/ |
H A D | R600Packetizer.cpp | 11 /// This pass implements instructions packetization for R600. It unsets isLast 144 const DenseMap<unsigned, unsigned>::const_iterator It = PVs.find(Src); local 145 if (It != PVs.end()) 146 MI->getOperand(OperandIdx).setReg(It->second); 317 MachineBasicBlock::iterator It = VLIWPacketizerList::addToPacket(MI); variable 319 endPacket(std::next(It)->getParent(), std::next(It)); 321 return It;
|
/external/llvm/lib/ProfileData/ |
H A D | CoverageMapping.cpp | 31 auto It = ExpressionIndices.find(E); local 32 if (It != ExpressionIndices.end()) 33 return Counter::getExpression(It->second); 385 template <class It> static void sortNestedRegions(It First, It Last) {
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | InstrProfiling.cpp | 11 // profiling. It also builds the data structures and initialization code needed 174 auto It = RegionCounters.find(Name); local 175 if (It != RegionCounters.end()) 194 auto It = RegionCounters.find(Name); local 195 if (It != RegionCounters.end()) 196 return It->second;
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopUnroll.cpp | 10 // This file implements some loop unrolling utilities. It does not define any 53 ValueToValueMapTy::iterator It = VMap.find(Op); local 54 if (It != VMap.end()) 55 I->setOperand(op, It->second); 60 ValueToValueMapTy::iterator It = VMap.find(PN->getIncomingBlock(i)); local 61 if (It != VMap.end()) 62 PN->setIncomingBlock(i, cast<BasicBlock>(It->second)); 310 for (unsigned It = 1; It != Count; ++It) { 375 ValueToValueMapTy::iterator It = LastValueMap.find(Incoming); local [all...] |
/external/llvm/lib/MC/ |
H A D | MCAsmStreamer.cpp | 325 for (MCLOHArgs::const_iterator It = Args.begin(), EndIt = Args.end(); 326 It != EndIt; ++It) { 330 OS << **It; local
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64CollectLOH.cpp | 26 // It may also be turned into either the following more efficient 234 /// \param nbRegs is used internally allocate some memory. It must be consistent 279 /// definition. It also consider definitions of ADRP instructions as uses and 564 MapRegToId::const_iterator It; local 572 ((It = RegToId.find((MI)->getOperand(1).getReg())) == EndIt || 573 It->second != CurReg))) { 590 // It would have been better if we could just remove the entry 731 InstrToInstrs::const_iterator It = UseToDefs.find(&Use); 733 if (It == UseToDefs.end() || It [all...] |